coreseek-4.1-beta/ 40777 0 0 0 11647317435 7121 5coreseek-4.1-beta/csft-4.1/ 40777 0 0 0 11647305347 10357 5coreseek-4.1-beta/csft-4.1/acinclude.m4100777 0 0 30211 11643565730 12665 0dnl --------------------------------------------------------------------------- dnl Macro: AC_CHECK_MYSQL dnl Check for custom MySQL paths in --with-mysql-* options. dnl If some paths are missing, check if mysql_config exists. dnl --------------------------------------------------------------------------- AC_DEFUN([AC_CHECK_MYSQL],[ mysqlconfig_locations="mysql_config /usr/bin/mysql_config /usr/local/bin/mysql_config /usr/local/mysql/bin/mysql_config /opt/mysql/bin/mysql_config /usr/pkg/bin/mysql_config" user_mysql_includes= user_mysql_libs= # check explicit MySQL root for mysql_config, include, lib if test [ x$1 != xyes -a x$1 != xno ] then mysqlroot=`echo $1 | sed -e 's+/$++'` if test [ -x "$mysqlroot/bin/mysql_config" ] then # if there's mysql_config, that's the best route mysqlconfig_locations="$mysqlroot/bin/mysql_config" elif test [ -d "$mysqlroot/include" -a -d "$mysqlroot/lib" ] then # explicit root; do not check well-known paths mysqlconfig_locations= # includes if test [ -d "$mysqlroot/include/mysql" ] then user_mysql_includes="$mysqlroot/include/mysql" else user_mysql_includes="$mysqlroot/include" fi # libs if test [ -d "$mysqlroot/lib/mysql" ] then user_mysql_libs="$mysqlroot/lib/mysql" else user_mysql_libs="$mysqlroot/lib" fi else AC_MSG_ERROR([invalid MySQL root directory '$mysqlroot'; neither bin/mysql_config, nor include/ and lib/ were found there]) fi fi # try running mysql_config AC_MSG_CHECKING([for mysql_config]) for mysqlconfig in $mysqlconfig_locations do if test [ -n "$mysqlconfig" ] then MYSQL_CFLAGS=`${mysqlconfig} --cflags 2>/dev/null` MYSQL_LIBS=`${mysqlconfig} --libs 2>/dev/null` if test [ $? -eq 0 ] then AC_MSG_RESULT([$mysqlconfig]) mysqlconfig= break else MYSQL_CFLAGS= MYSQL_LIBS= fi fi done if test [ -n "$mysqlconfig" ] then mysqlconfig_used= AC_MSG_RESULT([not found]) else mysqlconfig_used=yes fi # if there's nothing from mysql_config, check well-known include paths # explicit overrides will be applied later if test [ -z "$MYSQL_CFLAGS" ] then for CANDIDATE in "$user_mysql_includes" "/usr/local/mysql/include" "/usr/local/mysql/include/mysql" \ "/usr/include/mysql" do if test [ -n "$CANDIDATE" -a -r "$CANDIDATE/mysql.h" ] then MYSQL_CFLAGS="-I$CANDIDATE" break fi done fi # if there's nothing from mysql_config, check well-known library paths # explicit overrides will be applied later if test [ -z "$MYSQL_LIBS" ] then for CANDIDATE in "$user_mysql_libs" "/usr/lib64/mysql" \ "/usr/local/mysql/lib/mysql" "/usr/local/mysql/lib" \ "/usr/local/lib/mysql" "/usr/lib/mysql" \ "/opt/mysql/lib/mysql" "/usr/pkg/lib/mysql" do if test [ -n "$CANDIDATE" -a -d "$CANDIDATE" ] then MYSQL_LIBS="-L$CANDIDATE -lmysqlclient -lz" break fi done fi # apply explicit include path overrides AC_ARG_WITH([mysql-includes], AC_HELP_STRING([--with-mysql-includes], [path to MySQL header files]), [ac_cv_mysql_includes=$withval]) if test [ -n "$ac_cv_mysql_includes" ] then MYSQL_CFLAGS="-I$ac_cv_mysql_includes" fi # apply explicit lib path overrides AC_ARG_WITH([mysql-libs], AC_HELP_STRING([--with-mysql-libs], [path to MySQL libraries]), [ac_cv_mysql_libs=$withval]) if test [ -n "$ac_cv_mysql_libs" ] then # Trim trailing '.libs' if user passed it in --with-mysql-libs option ac_cv_mysql_libs=`echo ${ac_cv_mysql_libs} | sed -e 's/.libs$//' \ -e 's+.libs/$++'` MYSQL_LIBS="-L$ac_cv_mysql_libs -lmysqlclient -lz" fi # if we got options from mysqlconfig try to actually use them if test [ -n "$mysqlconfig_used" -a -n "$MYSQL_CFLAGS" -a -n "$MYSQL_LIBS" ] then _CFLAGS=$CFLAGS _LIBS=$LIBS CFLAGS="$CFLAGS $MYSQL_CFLAGS" LIBS="$LIBS $MYSQL_LIBS" AC_CHECK_FUNC(mysql_real_connect,[], [ # if mysql binary was built using a different compiler and we # got options from mysql_config some of them might not work # with compiler we will be using # throw away everything that isn't one of -D -L -I -l and retry MYSQL_CFLAGS=`echo $MYSQL_CFLAGS | sed -e 's/-[[^DLIl]][[^ ]]*//g'` MYSQL_LIBS=`echo $MYSQL_LIBS | sed -e 's/-[[^DLIl]][[^ ]]*//g'` CFLAGS="$_CFLAGS $MYSQL_CFLAGS" LIBS="$_LIBS $MYSQL_LIBS" unset ac_cv_func_mysql_real_connect AC_CHECK_FUNC(mysql_real_connect,[], [ # ... that didn't help # clear flags, the code below will complain MYSQL_CFLAGS= MYSQL_LIBS= ]) ]) CFLAGS=$_CFLAGS LIBS=$_LIBS fi # now that we did all we could, perform final checks AC_MSG_CHECKING([MySQL include files]) if test [ -z "$MYSQL_CFLAGS" ] then AC_MSG_ERROR([missing include files. ****************************************************************************** ERROR: cannot find MySQL include files. Check that you do have MySQL include files installed. The package name is typically 'mysql-devel'. If include files are installed on your system, but you are still getting this message, you should do one of the following: 1) either specify includes location explicitly, using --with-mysql-includes; 2) or specify MySQL installation root location explicitly, using --with-mysql; 3) or make sure that the path to 'mysql_config' program is listed in your PATH environment variable. To disable MySQL support, use --without-mysql option. ****************************************************************************** ]) else AC_MSG_RESULT([$MYSQL_CFLAGS]) fi AC_MSG_CHECKING([MySQL libraries]) if test [ -z "$MYSQL_LIBS" ] then AC_MSG_ERROR([missing libraries. ****************************************************************************** ERROR: cannot find MySQL libraries. Check that you do have MySQL libraries installed. The package name is typically 'mysql-devel'. If libraries are installed on your system, but you are still getting this message, you should do one of the following: 1) either specify libraries location explicitly, using --with-mysql-libs; 2) or specify MySQL installation root location explicitly, using --with-mysql; 3) or make sure that the path to 'mysql_config' program is listed in your PATH environment variable. To disable MySQL support, use --without-mysql option. ****************************************************************************** ]) else AC_MSG_RESULT([$MYSQL_LIBS]) fi ]) dnl --------------------------------------------------------------------------- dnl Macro: AC_CHECK_PGSQL dnl First check for custom PostgreSQL paths in --with-pgsql-* options. dnl If some paths are missing, check if pg_config exists. dnl --------------------------------------------------------------------------- AC_DEFUN([AC_CHECK_PGSQL],[ # Check for custom includes path if test [ -z "$ac_cv_pgsql_includes" ] then AC_ARG_WITH([pgsql-includes], AC_HELP_STRING([--with-pgsql-includes], [path to PostgreSQL header files]), [ac_cv_pgsql_includes=$withval]) fi if test [ -n "$ac_cv_pgsql_includes" ] then AC_CACHE_CHECK([PostgreSQL includes], [ac_cv_pgsql_includes], [ac_cv_pgsql_includes=""]) PGSQL_CFLAGS="-I$ac_cv_pgsql_includes" fi # Check for custom library path if test [ -z "$ac_cv_pgsql_libs" ] then AC_ARG_WITH([pgsql-libs], AC_HELP_STRING([--with-pgsql-libs], [path to PostgreSQL libraries]), [ac_cv_pgsql_libs=$withval]) fi if test [ -n "$ac_cv_pgsql_libs" ] then AC_CACHE_CHECK([PostgreSQL libraries], [ac_cv_pgsql_libs], [ac_cv_pgsql_libs=""]) PGSQL_LIBS="-L$ac_cv_pgsql_libs -lpq" fi # If some path is missing, try to autodetermine with pgsql_config if test [ -z "$ac_cv_pgsql_includes" -o -z "$ac_cv_pgsql_libs" ] then if test [ -z "$pgconfig" ] then AC_PATH_PROG(pgconfig,pg_config) fi if test [ -z "$pgconfig" ] then AC_MSG_ERROR([pg_config executable not found ******************************************************************************** ERROR: cannot find PostgreSQL libraries. If you want to compile with PosgregSQL support, you must either specify file locations explicitly using --with-pgsql-includes and --with-pgsql-libs options, or make sure path to pg_config is listed in your PATH environment variable. If you want to disable PostgreSQL support, use --without-pgsql option. ******************************************************************************** ]) else if test [ -z "$ac_cv_pgsql_includes" ] then AC_MSG_CHECKING(PostgreSQL C flags) PGSQL_CFLAGS="-I`${pgconfig} --includedir`" AC_MSG_RESULT($PGSQL_CFLAGS) fi if test [ -z "$ac_cv_pgsql_libs" ] then AC_MSG_CHECKING(PostgreSQL linker flags) PGSQL_LIBS="-L`${pgconfig} --libdir` -lpq" AC_MSG_RESULT($PGSQL_LIBS) fi fi fi ]) dnl --------------------------------------------------------------------------- dnl Macro: AC_CHECK_MMSEG dnl First check for custom PostgreSQL paths in --with-mmseg-* options. dnl If some paths are missing, check if pg_config exists. dnl --------------------------------------------------------------------------- AC_DEFUN([AC_CHECK_MMSEG],[ # if there's nothing from mysql_config, check well-known include paths # explicit overrides will be applied later if test [ -z "$MMSEG_CFLAGS" ] then for CANDIDATE in "$user_mmseg_includes" "/usr/local/include/mmseg" "/usr/include/mmseg" do if test [ -n "$CANDIDATE" -a -r "$CANDIDATE/Segmenter.h" ] then MMSEG_CFLAGS="-I$CANDIDATE" break fi done fi # if there's nothing from mysql_config, check well-known library paths # explicit overrides will be applied later if test [ -z "$MMSEG_LIBS" ] then for CANDIDATE in "$user_mmseg_libs" "/usr/lib64" \ "/usr/local/lib" "/usr/local/mmseg/lib" \ "/usr/local/lib/mmseg" "/usr/lib" \ "/opt/mmseg/lib" do if test [ -n "$CANDIDATE" -a -d "$CANDIDATE" ] then MMSEG_LIBS="-L$CANDIDATE -lmmseg" break fi done fi # apply explicit include path overrides AC_ARG_WITH([mmseg-includes], AC_HELP_STRING([--with-mmseg-includes], [path to libmmseg header files]), [ac_cv_mmseg_includes=$withval]) if test [ -n "$ac_cv_mmseg_includes" ] then MMSEG_CFLAGS="-I$ac_cv_mmseg_includes" fi # apply explicit lib path overrides AC_ARG_WITH([mmseg-libs], AC_HELP_STRING([--with-mmseg-libs], [path to libmmseg libraries]), [ac_cv_mmseg_libs=$withval]) if test [ -n "$ac_cv_mmseg_libs" ] then # Trim trailing '.libs' if user passed it in --with-mysql-libs option ac_cv_mmseg_libs=`echo ${ac_cv_mmseg_libs} | sed -e 's/.libs$//' \ -e 's+.libs/$++'` MMSEG_LIBS="-L$ac_cv_mmseg_libs -lmmseg" fi # now that we did all we could, perform final checks AC_MSG_CHECKING([libmmseg include files]) if test [ -z "$MMSEG_CFLAGS" ] then AC_MSG_ERROR([missing include files. ****************************************************************************** ERROR: cannot find libmmseg include files. To disable libmmseg support, use --without-mmseg option. ****************************************************************************** ]) else AC_MSG_RESULT([$MMSEG_CFLAGS]) fi AC_MSG_CHECKING([libmmseg libraries]) if test [ -z "$MMSEG_LIBS" ] then AC_MSG_ERROR([missing libraries. ****************************************************************************** ERROR: cannot find libmmseg libraries. To disable libmmseg support, use --without-mmseg option. ****************************************************************************** ]) else AC_MSG_RESULT([$MMSEG_LIBS]) fi ]) dnl --------------------------------------------------------------------------- dnl Macro: SPHINX_CONFIGURE_PART dnl dnl Tells what stage is ./configure running now, nicely formatted dnl --------------------------------------------------------------------------- dnl SPHINX_CONFIGURE_PART(MESSAGE) AC_DEFUN([SPHINX_CONFIGURE_PART],[ AC_MSG_RESULT() AC_MSG_RESULT([$1]) TMP=`echo $1 | sed -e sX.X-Xg` AC_MSG_RESULT([$TMP]) AC_MSG_RESULT() ]) dnl --------------------------------------------------------------------------- dnl Macro: SPHINX_CHECK_DEFINE dnl dnl Checks if this symbol is defined in that header file dnl --------------------------------------------------------------------------- AC_DEFUN([SPHINX_CHECK_DEFINE],[ AC_CACHE_CHECK([for $1 in $2],ac_cv_define_$1,[ AC_EGREP_CPP(YES_IS_DEFINED, [ #include <$2> #ifdef $1 YES_IS_DEFINED #endif ], ac_cv_define_$1=yes, ac_cv_define_$1=no) ]) if test "$ac_cv_define_$1" = "yes"; then AC_DEFINE(HAVE_$1, 1, [Define if $1 is defined in $2]) fi ]) coreseek-4.1-beta/csft-4.1/api/ 40777 0 0 0 11647303447 11127 5coreseek-4.1-beta/csft-4.1/api/java/ 40777 0 0 0 11647307514 12047 5coreseek-4.1-beta/csft-4.1/api/java/Makefile100777 0 0 1041 11620775670 13606 0# # $Id$ # # Makefile to automate sphinxapi.jar source builds # # order matters; full rebuild is always performed; but it somehow works SOURCES = \ SphinxMatch.java \ SphinxException.java \ SphinxWordInfo.java \ SphinxResult.java \ SphinxClient.java \ test.java CLASSES = $(SOURCES:.java=.class) all : sphinxapi.jar clean: rm -fr org rm -f sphinxapi.jar sphinxapi.jar: $(CLASSES) jar cfm sphinxapi.jar MANIFEST.MF org/sphx/api .SUFFIXES: .java .class vpath %.class org/sphx/api .java.class: javac -classpath . -d . $< # # $Id$ # coreseek-4.1-beta/csft-4.1/api/java/MANIFEST.MF100777 0 0 64 11643565730 13543 0Manifest-Version: 1.0 Main-Class: org.sphx.api.test coreseek-4.1-beta/csft-4.1/api/java/mk.cmd100777 0 0 124 11643565730 13222 0@echo off javac -cp . -d . *.java jar cfm sphinxapi.jar MANIFEST.MF org/sphx/api coreseek-4.1-beta/csft-4.1/api/java/mkdoc.cmd100777 0 0 26 11643565730 13671 0@javadoc *.java -d doccoreseek-4.1-beta/csft-4.1/api/java/README100777 0 0 1325 11643565730 13032 0Sphinx Java API notes ---------------------- 0) THIS IS A WORK IN PROGRESS. COMPATIBILITY-BREAKING CLASS INTERFACE CHANGES STILL MIGHT BE PERFORMED. SUGGESTIONS ARE WELCOME. 1) Officially supported JDKs are 1.5 and above. 2) The code would probably build with prior JDK versions as well, but since JDK 1.4 is already in End-Of-Life transition period, this could be gradually dropped. 3) To build `sphinxapi.jar': - make sure that `javac' and `jar' are in PATH - make sure JAVA_HOME is properly set - issue `make' 4) To run sample client program: - issue `java -jar sphinxapi.jar' 5) Warnings about "unchecked" mode on 1.5+ are caused by keeping the code compatible with 1.4. Fix suggestions are welcome. --eof-- coreseek-4.1-beta/csft-4.1/api/java/SphinxClient.java100777 0 0 126262 11643565730 15475 0/* * $Id$ * * Java version of Sphinx searchd client (Java API) * * Copyright (c) 2007, Vladimir Fedorkov * Copyright (c) 2007-2011, Andrew Aksyonoff * Copyright (c) 2008-2011, Sphinx Technologies Inc * All rights reserved * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License. You should have * received a copy of the GPL license along with this program; if you * did not, you can find it at http://www.gnu.org/ */ package org.sphx.api; import java.io.*; import java.net.*; import java.util.*; import java.net.SocketAddress.*; /** Sphinx client class */ public class SphinxClient { /* matching modes */ public final static int SPH_MATCH_ALL = 0; public final static int SPH_MATCH_ANY = 1; public final static int SPH_MATCH_PHRASE = 2; public final static int SPH_MATCH_BOOLEAN = 3; public final static int SPH_MATCH_EXTENDED = 4; public final static int SPH_MATCH_FULLSCAN = 5; public final static int SPH_MATCH_EXTENDED2 = 6; /* ranking modes (extended2 only) */ public final static int SPH_RANK_PROXIMITY_BM25 = 0; public final static int SPH_RANK_BM25 = 1; public final static int SPH_RANK_NONE = 2; public final static int SPH_RANK_WORDCOUNT = 3; public final static int SPH_RANK_PROXIMITY = 4; public final static int SPH_RANK_MATCHANY = 5; public final static int SPH_RANK_FIELDMASK = 6; public final static int SPH_RANK_SPH04 = 7; public final static int SPH_RANK_TOTAL = 8; /* sorting modes */ public final static int SPH_SORT_RELEVANCE = 0; public final static int SPH_SORT_ATTR_DESC = 1; public final static int SPH_SORT_ATTR_ASC = 2; public final static int SPH_SORT_TIME_SEGMENTS = 3; public final static int SPH_SORT_EXTENDED = 4; public final static int SPH_SORT_EXPR = 5; /* grouping functions */ public final static int SPH_GROUPBY_DAY = 0; public final static int SPH_GROUPBY_WEEK = 1; public final static int SPH_GROUPBY_MONTH = 2; public final static int SPH_GROUPBY_YEAR = 3; public final static int SPH_GROUPBY_ATTR = 4; public final static int SPH_GROUPBY_ATTRPAIR = 5; /* searchd reply status codes */ public final static int SEARCHD_OK = 0; public final static int SEARCHD_ERROR = 1; public final static int SEARCHD_RETRY = 2; public final static int SEARCHD_WARNING = 3; /* attribute types */ public final static int SPH_ATTR_INTEGER = 1; public final static int SPH_ATTR_TIMESTAMP = 2; public final static int SPH_ATTR_ORDINAL = 3; public final static int SPH_ATTR_BOOL = 4; public final static int SPH_ATTR_FLOAT = 5; public final static int SPH_ATTR_BIGINT = 6; public final static int SPH_ATTR_STRING = 7; public final static int SPH_ATTR_MULTI = 0x40000001; public final static int SPH_ATTR_MULTI64 = 0x40000002; /* searchd commands */ private final static int SEARCHD_COMMAND_SEARCH = 0; private final static int SEARCHD_COMMAND_EXCERPT = 1; private final static int SEARCHD_COMMAND_UPDATE = 2; private final static int SEARCHD_COMMAND_KEYWORDS = 3; private final static int SEARCHD_COMMAND_PERSIST = 4; private final static int SEARCHD_COMMAND_FLUSHATTRS = 7; /* searchd command versions */ private final static int VER_MAJOR_PROTO = 0x1; private final static int VER_COMMAND_SEARCH = 0x119; private final static int VER_COMMAND_EXCERPT = 0x102; private final static int VER_COMMAND_UPDATE = 0x102; private final static int VER_COMMAND_KEYWORDS = 0x100; private final static int VER_COMMAND_FLUSHATTRS = 0x100; /* filter types */ private final static int SPH_FILTER_VALUES = 0; private final static int SPH_FILTER_RANGE = 1; private final static int SPH_FILTER_FLOATRANGE = 2; private String _host; private int _port; private String _path; private Socket _socket; private int _offset; private int _limit; private int _mode; private int[] _weights; private int _sort; private String _sortby; private int _minId; private int _maxId; private ByteArrayOutputStream _rawFilters; private DataOutputStream _filters; private int _filterCount; private String _groupBy; private int _groupFunc; private String _groupSort; private String _groupDistinct; private int _maxMatches; private int _cutoff; private int _retrycount; private int _retrydelay; private String _latitudeAttr; private String _longitudeAttr; private float _latitude; private float _longitude; private String _error; private String _warning; private boolean _connerror; private int _timeout; private ArrayList _reqs; private Map _indexWeights; private int _ranker; private int _maxQueryTime; private Map _fieldWeights; private Map _overrideTypes; private Map _overrideValues; private String _select; /** Creates a new SphinxClient instance. */ public SphinxClient() { this("localhost", 9312); } /** Creates a new SphinxClient instance, with host:port specification. */ public SphinxClient(String host, int port) { _host = host; _port = port; _path = null; _socket = null; _offset = 0; _limit = 20; _mode = SPH_MATCH_ALL; _sort = SPH_SORT_RELEVANCE; _sortby = ""; _minId = 0; _maxId = 0; _filterCount = 0; _rawFilters = new ByteArrayOutputStream(); _filters = new DataOutputStream(_rawFilters); _groupBy = ""; _groupFunc = SPH_GROUPBY_DAY; _groupSort = "@group desc"; _groupDistinct = ""; _maxMatches = 1000; _cutoff = 0; _retrycount = 0; _retrydelay = 0; _latitudeAttr = null; _longitudeAttr = null; _latitude = 0; _longitude = 0; _error = ""; _warning = ""; _connerror = false; _timeout = 1000; _reqs = new ArrayList(); _weights = null; _indexWeights = new LinkedHashMap(); _fieldWeights = new LinkedHashMap(); _ranker = SPH_RANK_PROXIMITY_BM25; _overrideTypes = new LinkedHashMap(); _overrideValues = new LinkedHashMap(); _select = "*"; } /** Get last error message, if any. */ public String GetLastError() { return _error; } /** Get last warning message, if any. */ public String GetLastWarning() { return _warning; } /** Get last error flag (to tell network connection errors from searchd errors or broken responses). */ public boolean IsConnectError() { return _connerror; } /** Set searchd host and port to connect to. */ public void SetServer(String host, int port) throws SphinxException { myAssert ( host!=null && host.length()>0, "host name must not be empty" ); myAssert ( port>0 && port<65536, "port must be in 1..65535 range" ); _host = host; _port = port; } /** Set server connection timeout (0 to remove), in milliseconds. */ public void SetConnectTimeout ( int timeout ) { _timeout = Math.max ( timeout, 0 ); } /** Internal method. Sanity check. */ private void myAssert ( boolean condition, String err ) throws SphinxException { if ( !condition ) { _error = err; throw new SphinxException ( err ); } } /** Internal method. String IO helper. */ private static void writeNetUTF8 ( DataOutputStream ostream, String str ) throws IOException { if ( str==null ) { ostream.writeInt ( 0 ); return; } byte[] sBytes = str.getBytes ( "UTF-8" ); int iLen = sBytes.length; ostream.writeInt ( iLen ); ostream.write ( sBytes ); } /** Internal method. String IO helper. */ private static String readNetUTF8(DataInputStream istream) throws IOException { int iLen = istream.readInt(); byte[] sBytes = new byte [ iLen ]; istream.readFully ( sBytes ); return new String ( sBytes, "UTF-8"); } /** Internal method. Unsigned int IO helper. */ private static long readDword ( DataInputStream istream ) throws IOException { long v = (long) istream.readInt (); if ( v<0 ) v += 4294967296L; return v; } /** Internal method. Connect to searchd and exchange versions. */ private Socket _Connect() { if ( _socket!=null ) return _socket; _connerror = false; Socket sock = null; try { sock = new Socket (); sock.setSoTimeout ( _timeout ); InetSocketAddress addr = new InetSocketAddress ( _host, _port ); sock.connect ( addr, _timeout ); DataInputStream sIn = new DataInputStream ( sock.getInputStream() ); int version = sIn.readInt(); if ( version<1 ) { sock.close (); _error = "expected searchd protocol version 1+, got version " + version; return null; } DataOutputStream sOut = new DataOutputStream ( sock.getOutputStream() ); sOut.writeInt ( VER_MAJOR_PROTO ); } catch ( IOException e ) { _error = "connection to " + _host + ":" + _port + " failed: " + e; _connerror = true; try { if ( sock!=null ) sock.close (); } catch ( IOException e1 ) {} return null; } return sock; } /** Internal method. Get and check response packet from searchd. */ private byte[] _GetResponse ( Socket sock ) { /* connect */ DataInputStream sIn = null; InputStream SockInput = null; try { SockInput = sock.getInputStream(); sIn = new DataInputStream ( SockInput ); } catch ( IOException e ) { _error = "getInputStream() failed: " + e; return null; } /* read response */ byte[] response = null; short status = 0, ver = 0; int len = 0; try { /* read status fields */ status = sIn.readShort(); ver = sIn.readShort(); len = sIn.readInt(); /* read response if non-empty */ if ( len<=0 ) { _error = "invalid response packet size (len=" + len + ")"; return null; } response = new byte[len]; sIn.readFully ( response, 0, len ); /* check status */ if ( status==SEARCHD_WARNING ) { DataInputStream in = new DataInputStream ( new ByteArrayInputStream ( response ) ); int iWarnLen = in.readInt (); _warning = new String ( response, 4, iWarnLen ); System.arraycopy ( response, 4+iWarnLen, response, 0, response.length-4-iWarnLen ); } else if ( status==SEARCHD_ERROR ) { _error = "searchd error: " + new String ( response, 4, response.length-4 ); return null; } else if ( status==SEARCHD_RETRY ) { _error = "temporary searchd error: " + new String ( response, 4, response.length-4 ); return null; } else if ( status!=SEARCHD_OK ) { _error = "searched returned unknown status, code=" + status; return null; } } catch ( IOException e ) { if ( len!=0 ) { /* get trace, to provide even more failure details */ PrintWriter ew = new PrintWriter ( new StringWriter() ); e.printStackTrace ( ew ); ew.flush (); ew.close (); String sTrace = ew.toString (); /* build error message */ _error = "failed to read searchd response (status=" + status + ", ver=" + ver + ", len=" + len + ", trace=" + sTrace +")"; } else { _error = "received zero-sized searchd response (searchd crashed?): " + e.getMessage(); } return null; } finally { if ( _socket==null ) { try { if ( sIn!=null ) sIn.close(); if ( sock!=null && !sock.isConnected() ) sock.close(); } catch ( IOException e ) { /* silently ignore close failures; nothing could be done anyway */ } } } return response; } /** Internal method. Connect to searchd, send request, get response as DataInputStream. */ private DataInputStream _DoRequest ( int command, int version, ByteArrayOutputStream req ) { /* connect */ Socket sock = _Connect(); if ( sock==null ) return null; /* send request */ byte[] reqBytes = req.toByteArray(); try { DataOutputStream sockDS = new DataOutputStream ( sock.getOutputStream() ); sockDS.writeShort ( command ); sockDS.writeShort ( version ); sockDS.writeInt ( reqBytes.length ); sockDS.write ( reqBytes ); } catch ( Exception e ) { _error = "network error: " + e; _connerror = true; return null; } /* get response */ byte[] response = _GetResponse ( sock ); if ( response==null ) return null; /* spawn that tampon */ return new DataInputStream ( new ByteArrayInputStream ( response ) ); } /** Set matches offset and limit to return to client, max matches to retrieve on server, and cutoff. */ public void SetLimits ( int offset, int limit, int max, int cutoff ) throws SphinxException { myAssert ( offset>=0, "offset must not be negative" ); myAssert ( limit>0, "limit must be positive" ); myAssert ( max>0, "max must be positive" ); myAssert ( cutoff>=0, "cutoff must not be negative" ); _offset = offset; _limit = limit; _maxMatches = max; _cutoff = cutoff; } /** Set matches offset and limit to return to client, and max matches to retrieve on server. */ public void SetLimits ( int offset, int limit, int max ) throws SphinxException { SetLimits ( offset, limit, max, _cutoff ); } /** Set matches offset and limit to return to client. */ public void SetLimits ( int offset, int limit) throws SphinxException { SetLimits ( offset, limit, _maxMatches, _cutoff ); } /** Set maximum query time, in milliseconds, per-index, 0 means "do not limit". */ public void SetMaxQueryTime ( int maxTime ) throws SphinxException { myAssert ( maxTime>=0, "max_query_time must not be negative" ); _maxQueryTime = maxTime; } /** Set matching mode. */ public void SetMatchMode(int mode) throws SphinxException { myAssert ( mode==SPH_MATCH_ALL || mode==SPH_MATCH_ANY || mode==SPH_MATCH_PHRASE || mode==SPH_MATCH_BOOLEAN || mode==SPH_MATCH_EXTENDED || mode==SPH_MATCH_FULLSCAN || mode==SPH_MATCH_EXTENDED2, "unknown mode value; use one of the SPH_MATCH_xxx constants" ); _mode = mode; } /** Set ranking mode. */ public void SetRankingMode ( int ranker ) throws SphinxException { myAssert ( ranker>=0 && ranker0 ), "sortby string must not be empty in selected mode" ); _sort = mode; _sortby = ( sortby==null ) ? "" : sortby; } /** Set per-field weights (all values must be positive). WARNING: DEPRECATED, use SetFieldWeights() instead. */ public void SetWeights(int[] weights) throws SphinxException { myAssert ( weights!=null, "weights must not be null" ); for (int i = 0; i < weights.length; i++) { int weight = weights[i]; myAssert ( weight>0, "all weights must be greater than 0" ); } _weights = weights; } /** * Bind per-field weights by field name. * @param fieldWeights hash which maps String index names to Integer weights */ public void SetFieldWeights ( Map fieldWeights ) throws SphinxException { /* FIXME! implement checks here */ _fieldWeights = ( fieldWeights==null ) ? new LinkedHashMap () : fieldWeights; } /** * Bind per-index weights by index name (and enable summing the weights on duplicate matches, instead of replacing them). * @param indexWeights hash which maps String index names to Integer weights */ public void SetIndexWeights ( Map indexWeights ) throws SphinxException { /* FIXME! implement checks here */ _indexWeights = ( indexWeights==null ) ? new LinkedHashMap () : indexWeights; } /** Set document IDs range to match. */ public void SetIDRange ( int min, int max ) throws SphinxException { myAssert ( min<=max, "min must be less or equal to max" ); _minId = min; _maxId = max; } /** Set values filter. Only match records where attribute value is in given set. */ public void SetFilter ( String attribute, int[] values, boolean exclude ) throws SphinxException { myAssert ( values!=null && values.length>0, "values array must not be null or empty" ); myAssert ( attribute!=null && attribute.length()>0, "attribute name must not be null or empty" ); try { writeNetUTF8 ( _filters, attribute ); _filters.writeInt ( SPH_FILTER_VALUES ); _filters.writeInt ( values.length ); for ( int i=0; i0, "values array must not be null or empty" ); myAssert ( attribute!=null && attribute.length()>0, "attribute name must not be null or empty" ); try { writeNetUTF8 ( _filters, attribute ); _filters.writeInt ( SPH_FILTER_VALUES ); _filters.writeInt ( values.length ); for ( int i=0; i0, "longitudeAttr string must not be null or empty" ); myAssert ( longitudeAttr!=null && longitudeAttr.length()>0, "longitudeAttr string must not be null or empty" ); _latitudeAttr = latitudeAttr; _longitudeAttr = longitudeAttr; _latitude = latitude; _longitude = longitude; } /** Set grouping attribute and function. */ public void SetGroupBy ( String attribute, int func, String groupsort ) throws SphinxException { myAssert ( func==SPH_GROUPBY_DAY || func==SPH_GROUPBY_WEEK || func==SPH_GROUPBY_MONTH || func==SPH_GROUPBY_YEAR || func==SPH_GROUPBY_ATTR || func==SPH_GROUPBY_ATTRPAIR, "unknown func value; use one of the available SPH_GROUPBY_xxx constants" ); _groupBy = attribute; _groupFunc = func; _groupSort = groupsort; } /** Set grouping attribute and function with default ("@group desc") groupsort (syntax sugar). */ public void SetGroupBy(String attribute, int func) throws SphinxException { SetGroupBy(attribute, func, "@group desc"); } /** Set count-distinct attribute for group-by queries. */ public void SetGroupDistinct(String attribute) { _groupDistinct = attribute; } /** Set distributed retries count and delay. */ public void SetRetries ( int count, int delay ) throws SphinxException { myAssert ( count>=0, "count must not be negative" ); myAssert ( delay>=0, "delay must not be negative" ); _retrycount = count; _retrydelay = delay; } /** Set distributed retries count with default (zero) delay (syntax sugar). */ public void SetRetries ( int count ) throws SphinxException { SetRetries ( count, 0 ); } /** * Set attribute values override (one override list per attribute). * @param values maps Long document IDs to Int/Long/Float values (as specified in attrtype). */ public void SetOverride ( String attrname, int attrtype, Map values ) throws SphinxException { myAssert ( attrname!=null && attrname.length()>0, "attrname must not be empty" ); myAssert ( attrtype==SPH_ATTR_INTEGER || attrtype==SPH_ATTR_TIMESTAMP || attrtype==SPH_ATTR_BOOL || attrtype==SPH_ATTR_FLOAT || attrtype==SPH_ATTR_BIGINT, "unsupported attrtype (must be one of INTEGER, TIMESTAMP, BOOL, FLOAT, or BIGINT)" ); _overrideTypes.put ( attrname, new Integer ( attrtype ) ); _overrideValues.put ( attrname, values ); } /** Set select-list (attributes or expressions), SQL-like syntax. */ public void SetSelect ( String select ) throws SphinxException { myAssert ( select!=null, "select clause string must not be null" ); _select = select; } /** Reset all currently set filters (for multi-queries). */ public void ResetFilters() { /* should we close them first? */ _rawFilters = new ByteArrayOutputStream(); _filters = new DataOutputStream(_rawFilters); _filterCount = 0; /* reset GEO anchor */ _latitudeAttr = null; _longitudeAttr = null; _latitude = 0; _longitude = 0; } /** Clear groupby settings (for multi-queries). */ public void ResetGroupBy () { _groupBy = ""; _groupFunc = SPH_GROUPBY_DAY; _groupSort = "@group desc"; _groupDistinct = ""; } /** Clear all attribute value overrides (for multi-queries). */ public void ResetOverrides () { _overrideTypes.clear (); _overrideValues.clear (); } /** Connect to searchd server and run current search query against all indexes (syntax sugar). */ public SphinxResult Query ( String query ) throws SphinxException { return Query ( query, "*", "" ); } /** Connect to searchd server and run current search query against all indexes (syntax sugar). */ public SphinxResult Query ( String query, String index ) throws SphinxException { return Query ( query, index, "" ); } /** Connect to searchd server and run current search query. */ public SphinxResult Query ( String query, String index, String comment ) throws SphinxException { myAssert ( _reqs==null || _reqs.size()==0, "AddQuery() and Query() can not be combined; use RunQueries() instead" ); AddQuery ( query, index, comment ); SphinxResult[] results = RunQueries(); _reqs = new ArrayList(); /* just in case it failed too early */ if ( results==null || results.length<1 ) return null; /* probably network error; error message should be already filled */ SphinxResult res = results[0]; _warning = res.warning; _error = res.error; if ( res==null || res.getStatus()==SEARCHD_ERROR ) return null; return res; } /** Add new query with current settings to current search request. */ public int AddQuery ( String query, String index, String comment ) throws SphinxException { ByteArrayOutputStream req = new ByteArrayOutputStream(); /* build request */ try { DataOutputStream out = new DataOutputStream(req); out.writeInt(_offset); out.writeInt(_limit); out.writeInt(_mode); out.writeInt(_ranker); out.writeInt(_sort); writeNetUTF8(out, _sortby); writeNetUTF8(out, query); int weightLen = _weights != null ? _weights.length : 0; out.writeInt(weightLen); if (_weights != null) { for (int i = 0; i < _weights.length; i++) out.writeInt(_weights[i]); } writeNetUTF8(out, index); out.writeInt(0); out.writeInt(_minId); out.writeInt(_maxId); /* filters */ out.writeInt(_filterCount); out.write(_rawFilters.toByteArray()); /* group-by, max matches, sort-by-group flag */ out.writeInt(_groupFunc); writeNetUTF8(out, _groupBy); out.writeInt(_maxMatches); writeNetUTF8(out, _groupSort); out.writeInt(_cutoff); out.writeInt(_retrycount); out.writeInt(_retrydelay); writeNetUTF8(out, _groupDistinct); /* anchor point */ if (_latitudeAttr == null || _latitudeAttr.length() == 0 || _longitudeAttr == null || _longitudeAttr.length() == 0) { out.writeInt(0); } else { out.writeInt(1); writeNetUTF8(out, _latitudeAttr); writeNetUTF8(out, _longitudeAttr); out.writeFloat(_latitude); out.writeFloat(_longitude); } /* per-index weights */ out.writeInt(_indexWeights.size()); for (Iterator e = _indexWeights.keySet().iterator(); e.hasNext();) { String indexName = (String) e.next(); Integer weight = (Integer) _indexWeights.get(indexName); writeNetUTF8(out, indexName); out.writeInt(weight.intValue()); } /* max query time */ out.writeInt ( _maxQueryTime ); /* per-field weights */ out.writeInt ( _fieldWeights.size() ); for ( Iterator e=_fieldWeights.keySet().iterator(); e.hasNext(); ) { String field = (String) e.next(); Integer weight = (Integer) _fieldWeights.get ( field ); writeNetUTF8 ( out, field ); out.writeInt ( weight.intValue() ); } /* comment */ writeNetUTF8 ( out, comment ); /* overrides */ out.writeInt ( _overrideTypes.size() ); for ( Iterator e=_overrideTypes.keySet().iterator(); e.hasNext(); ) { String attr = (String) e.next(); Integer type = (Integer) _overrideTypes.get ( attr ); Map values = (Map) _overrideValues.get ( attr ); writeNetUTF8 ( out, attr ); out.writeInt ( type.intValue() ); out.writeInt ( values.size() ); for ( Iterator e2=values.keySet().iterator(); e2.hasNext(); ) { Long id = (Long) e2.next (); out.writeLong ( id.longValue() ); switch ( type.intValue() ) { case SPH_ATTR_FLOAT: out.writeFloat ( ( (Float) values.get ( id ) ).floatValue() ); break; case SPH_ATTR_BIGINT: out.writeLong ( ( (Long)values.get ( id ) ).longValue() ); break; default: out.writeInt ( ( (Integer)values.get ( id ) ).intValue() ); break; } } } /* select-list */ writeNetUTF8 ( out, _select ); /* done! */ out.flush (); int qIndex = _reqs.size(); _reqs.add ( qIndex, req.toByteArray() ); return qIndex; } catch ( Exception e ) { myAssert ( false, "error in AddQuery(): " + e + ": " + e.getMessage() ); } finally { try { _filters.close (); _rawFilters.close (); } catch ( IOException e ) { myAssert ( false, "error in AddQuery(): " + e + ": " + e.getMessage() ); } } return -1; } /** Run all previously added search queries. */ public SphinxResult[] RunQueries() throws SphinxException { if ( _reqs==null || _reqs.size()<1 ) { _error = "no queries defined, issue AddQuery() first"; return null; } /* build the mega-request */ int nreqs = _reqs.size(); ByteArrayOutputStream reqBuf = new ByteArrayOutputStream(); try { DataOutputStream req = new DataOutputStream ( reqBuf ); /* its a client */ req.writeInt(0); req.writeInt ( nreqs ); for ( int i=0; i 0, "BuildExcerpts: Have no documents to process"); myAssert(index != null && index.length() > 0, "BuildExcerpts: Have no index to process documents"); myAssert(words != null && words.length() > 0, "BuildExcerpts: Have no words to highlight"); if (opts == null) opts = new LinkedHashMap(); /* fixup options */ if (!opts.containsKey("before_match")) opts.put("before_match", ""); if (!opts.containsKey("after_match")) opts.put("after_match", ""); if (!opts.containsKey("chunk_separator")) opts.put("chunk_separator", "..."); if (!opts.containsKey("html_strip_mode")) opts.put("html_strip_mode", "index"); if (!opts.containsKey("limit")) opts.put("limit", new Integer(256)); if (!opts.containsKey("limit_passages")) opts.put("limit_passages", new Integer(0)); if (!opts.containsKey("limit_words")) opts.put("limit_words", new Integer(0)); if (!opts.containsKey("around")) opts.put("around", new Integer(5)); if (!opts.containsKey("start_passage_id")) opts.put("start_passage_id", new Integer(1)); if (!opts.containsKey("exact_phrase")) opts.put("exact_phrase", new Integer(0)); if (!opts.containsKey("single_passage")) opts.put("single_passage", new Integer(0)); if (!opts.containsKey("use_boundaries")) opts.put("use_boundaries", new Integer(0)); if (!opts.containsKey("weight_order")) opts.put("weight_order", new Integer(0)); if (!opts.containsKey("load_files")) opts.put("load_files", new Integer(0)); if (!opts.containsKey("allow_empty")) opts.put("allow_empty", new Integer(0)); if (!opts.containsKey("query_mode")) opts.put("query_mode", new Integer(0)); if (!opts.containsKey("force_all_words")) opts.put("force_all_words", new Integer(0)); /* build request */ ByteArrayOutputStream reqBuf = new ByteArrayOutputStream(); DataOutputStream req = new DataOutputStream ( reqBuf ); try { req.writeInt(0); int iFlags = 1; /* remove_spaces */ if ( ((Integer)opts.get("exact_phrase")).intValue()!=0 ) iFlags |= 2; if ( ((Integer)opts.get("single_passage")).intValue()!=0 ) iFlags |= 4; if ( ((Integer)opts.get("use_boundaries")).intValue()!=0 ) iFlags |= 8; if ( ((Integer)opts.get("weight_order")).intValue()!=0 ) iFlags |= 16; if ( ((Integer)opts.get("query_mode")).intValue()!=0 ) iFlags |= 32; if ( ((Integer)opts.get("force_all_words")).intValue()!=0 ) iFlags |= 64; if ( ((Integer)opts.get("load_files")).intValue()!=0 ) iFlags |= 128; if ( ((Integer)opts.get("allow_empty")).intValue()!=0 ) iFlags |= 256; req.writeInt ( iFlags ); writeNetUTF8 ( req, index ); writeNetUTF8 ( req, words ); /* send options */ writeNetUTF8 ( req, (String) opts.get("before_match") ); writeNetUTF8 ( req, (String) opts.get("after_match") ); writeNetUTF8 ( req, (String) opts.get("chunk_separator") ); req.writeInt ( ((Integer) opts.get("limit")).intValue() ); req.writeInt ( ((Integer) opts.get("around")).intValue() ); req.writeInt ( ((Integer) opts.get("limit_passages")).intValue() ); req.writeInt ( ((Integer) opts.get("limit_words")).intValue() ); req.writeInt ( ((Integer) opts.get("start_passage_id")).intValue() ); writeNetUTF8 ( req, (String) opts.get("html_strip_mode") ); /* send documents */ req.writeInt ( docs.length ); for ( int i=0; i * String[] attrs = new String[1]; * * attrs[0] = "group_id"; * long[][] values = new long[2][2]; * * values[0] = new long[2]; values[0][0] = 1; values[0][1] = 123; * values[1] = new long[2]; values[1][0] = 3; values[1][1] = 456; * * int res = cl.UpdateAttributes ( "test1", attrs, values ); * * * @param index index name(s) to update; might be distributed * @param attrs array with the names of the attributes to update * @param values array of updates; each long[] entry must contains document ID * in the first element, and all new attribute values in the following ones * @return -1 on failure, amount of actually found and updated documents (might be 0) on success * * @throws SphinxException on invalid parameters */ public int UpdateAttributes ( String index, String[] attrs, long[][] values ) throws SphinxException { /* check args */ myAssert ( index!=null && index.length()>0, "no index name provided" ); myAssert ( attrs!=null && attrs.length>0, "no attribute names provided" ); myAssert ( values!=null && values.length>0, "no update entries provided" ); for ( int i=0; i * String[] attrs = new String[1]; * * attrs[0] = "group_id"; * int[][] values = new int[1][3]; * * values[0] = new int[3]; values[0][0] = 123; values[0][1] = 456; values[0][2] = 789 * * int res = cl.UpdateAttributesMVA ( "test1", 10, attrs, values ); * * * @param index index name(s) to update; might be distributed * @param docid id of document to update * @param attrs array with the names of the attributes to update * @param values array of updates; each int[] entry must contains all new attribute values * @return -1 on failure, amount of actually found and updated documents (might be 0) on success * * @throws SphinxException on invalid parameters */ public int UpdateAttributesMVA ( String index, long docid, String[] attrs, int[][] values ) throws SphinxException { /* check args */ myAssert ( index!=null && index.length()>0, "no index name provided" ); myAssert ( docid>0, "invalid document id" ); myAssert ( attrs!=null && attrs.length>0, "no attribute names provided" ); myAssert ( values!=null && values.length>0, "no update entries provided" ); myAssert ( values.length==attrs.length, "update entry has wrong length" ); for ( int i=0; i\tconnect to searchd at host HOST\n" ); System.out.print ( "-p, --port\t\tconnect to searchd at port PORT\n" ); System.out.print ( "-i, --index \tsearch through index(es) specified by IDX\n" ); System.out.print ( "-s, --sortby \tsort matches by 'CLAUSE' in sort_extended mode\n" ); System.out.print ( "-S, --sortexpr \tsort matches by 'EXPR' DESC in sort_expr mode\n" ); System.out.print ( "-a, --any\t\tuse 'match any word' matching mode\n" ); System.out.print ( "-b, --boolean\t\tuse 'boolean query' matching mode\n" ); System.out.print ( "-e, --extended\t\tuse 'extended query' matching mode\n" ); System.out.print ( "-ph,--phrase\t\tuse 'exact phrase' matching mode\n" ); // System.out.print ( "-f, --filter \tfilter by attribute 'ATTR' (default is 'group_id')\n" ); // System.out.print ( "-v, --value \tadd VAL to allowed 'group_id' values list\n" ); System.out.print ( "-g, --groupby \tgroup matches by 'EXPR'\n" ); System.out.print ( "-gs,--groupsort \tsort groups by 'EXPR'\n" ); // System.out.print ( "-d, --distinct \tcount distinct values of 'ATTR''\n" ); System.out.print ( "-l, --limit \tretrieve COUNT matches (default: 20)\n" ); System.out.print ( "-ga, --geoanchor \n" ); System.out.print ( "\t\t\tset anchor for geodistance\n" ); System.out.print ( "--select \tselect the listed expressions only\n" ); System.exit ( 0 ); } StringBuffer q = new StringBuffer(); String host = "localhost"; int port = 9312; int mode = SphinxClient.SPH_MATCH_ALL; String index = "*"; int offset = 0; int limit = 20; int sortMode = SphinxClient.SPH_SORT_RELEVANCE; String sortClause = ""; String groupBy = ""; String groupSort = ""; SphinxClient cl = new SphinxClient(); /* parse arguments */ if ( argv!=null) for ( int i=0; i0 ) cl.SetGroupBy ( groupBy, SphinxClient.SPH_GROUPBY_ATTR, groupSort ); SphinxResult res = cl.Query(q.toString(), index); if ( res==null ) { System.err.println ( "Error: " + cl.GetLastError() ); System.exit ( 1 ); } if ( cl.GetLastWarning()!=null && cl.GetLastWarning().length()>0 ) System.out.println ( "WARNING: " + cl.GetLastWarning() + "\n" ); /* print me out */ System.out.println ( "Query '" + q + "' retrieved " + res.total + " of " + res.totalFound + " matches in " + res.time + " sec." ); System.out.println ( "Query stats:" ); for ( int i=0; i&1 | (egrep -v '(AC_TRY_RUN called without default to allow cross compiling|AC_PROG_CXXCPP was called before AC_PROG_CXX|defined in acinclude.m4 but never used|AC_PROG_LEX invoked multiple times|AC_DECL_YYTEXT is expanded from...|the top level)'||true) AUTOCONF ?= 'autoconf' ACLOCAL ?= 'aclocal' AUTOHEADER ?= 'autoheader' AUTOMAKE ?= 'automake' AUTOUPDATE ?= 'autoupdate' LIBTOOLIZE ?= 'libtoolize' config_h_in = sphinxclient_config.h.in targets = $(config_h_in) configure makefiles all: $(targets) aclocal.m4: $(ACLOCAL) $(config_h_in): configure @echo rebuilding $@ @rm -f $@ $(AUTOHEADER) $(SUPPRESS_WARNINGS) configure: aclocal.m4 configure.in @echo rebuilding $@ $(LIBTOOLIZE) --copy $(AUTOCONF) $(SUPPRESS_WARNINGS) makefiles: configure Makefile.am @echo rebuilding Makefile.in files $(AUTOMAKE) --add-missing --copy cvsclean: @rm -rf *.lo *.la *.o *.a .libs Makefile Makefile.in stamp-h1 test sphinxclient_config.h* rm -rf aclocal.m4 autom4te.cache install.sh libtool Makefile Makefile.in 'configure.in~' missing config.h* configure rm -f config.guess config.log config.status config.sub cscope.out install-sh ltmain.sh coreseek-4.1-beta/csft-4.1/api/libsphinxclient/buildconf.sh100777 0 0 1200 11643565730 16721 0#!/bin/sh eval `grep '^EXTRA_VERSION=' configure.in` case "$EXTRA_VERSION" in *-dev) rebuildok=1 ;; *) rebuildok=0 ;; esac cvsclean=0 while test $# -gt 0; do if test "$1" = "--force"; then rebuildok=1 echo "Forcing buildconf" fi if test "$1" = "--clean"; then cvsclean=1 fi shift done if test "$rebuildok" = "0"; then echo "You should not run buildconf in a release package." echo "use buildconf --force to override this check." exit 1 fi if test "$cvsclean" = "1"; then echo "Cleaning autogenerated files" ${MAKE:-make} -s -f build.mk cvsclean else ${MAKE:-make} -s -f build.mk fi coreseek-4.1-beta/csft-4.1/api/libsphinxclient/config.guess100777 0 0 122065 11643565730 17012 0#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003 Free Software Foundation, Inc. timestamp='2003-06-17' # 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 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, write to the Free Software # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. # # 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 Per Bothner . # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit build system type. 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 (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001 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 0 ;; --version | -v ) echo "$version" ; exit 0 ;; --help | --h* | -h ) echo "$usage"; exit 0 ;; -- ) # 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 -q "$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 ;' # 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 ## for Red Hat Linux if test -f /etc/redhat-release ; then VENDOR=redhat ; else VENDOR= ; fi # 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 tupples: *-*-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 ;; *) 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 __ELF__ >/dev/null 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 0 ;; amiga:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; arc:OpenBSD:*:*) echo mipsel-unknown-openbsd${UNAME_RELEASE} exit 0 ;; hp300:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; mac68k:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; macppc:OpenBSD:*:*) echo powerpc-unknown-openbsd${UNAME_RELEASE} exit 0 ;; mvme68k:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; mvme88k:OpenBSD:*:*) echo m88k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; mvmeppc:OpenBSD:*:*) echo powerpc-unknown-openbsd${UNAME_RELEASE} exit 0 ;; pmax:OpenBSD:*:*) echo mipsel-unknown-openbsd${UNAME_RELEASE} exit 0 ;; sgi:OpenBSD:*:*) echo mipseb-unknown-openbsd${UNAME_RELEASE} exit 0 ;; sun3:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; wgrisc:OpenBSD:*:*) echo mipsel-unknown-openbsd${UNAME_RELEASE} exit 0 ;; *:OpenBSD:*:*) echo ${UNAME_MACHINE}-unknown-openbsd${UNAME_RELEASE} exit 0 ;; alpha:OSF1:*:*) if test $UNAME_RELEASE = "V4.0"; then UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` fi # 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 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/^[VTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit 0 ;; Alpha*:OpenVMS:*:*) echo alpha-hp-vms exit 0 ;; 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 0 ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit 0 ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit 0;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit 0 ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit 0 ;; *:OS/390:*:*) echo i370-ibm-openedition exit 0 ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit 0;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit 0;; 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 0 ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit 0 ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit 0 ;; DRS?6000:UNIX_SV:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7 && exit 0 ;; esac ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; i86pc:SunOS:5.*:*) echo i386-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; 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 0 ;; 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 0 ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit 0 ;; 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 0 ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit 0 ;; # 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 0 ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit 0 ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit 0 ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit 0 ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit 0 ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit 0 ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit 0 ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit 0 ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit 0 ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit 0 ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit 0 ;; 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 \ && $dummy `echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` \ && exit 0 echo mips-mips-riscos${UNAME_RELEASE} exit 0 ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit 0 ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit 0 ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit 0 ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit 0 ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit 0 ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit 0 ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit 0 ;; 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 0 ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit 0 ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit 0 ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit 0 ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit 0 ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit 0 ;; ????????: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 0 ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit 0 ;; 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 0 ;; *: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 $CC_FOR_BUILD -o $dummy $dummy.c && $dummy && exit 0 echo rs6000-ibm-aix3.2.5 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 0 ;; *:AIX:*:[45]) 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 0 ;; *:AIX:*:*) echo rs6000-ibm-aix exit 0 ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit 0 ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit 0 ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit 0 ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit 0 ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit 0 ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit 0 ;; 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 # avoid double evaluation of $set_cc_for_build test -n "$CC_FOR_BUILD" || eval $set_cc_for_build if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E -) | grep __LP64__ >/dev/null then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit 0 ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit 0 ;; 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 && $dummy && exit 0 echo unknown-hitachi-hiuxwe2 exit 0 ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit 0 ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit 0 ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit 0 ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit 0 ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit 0 ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit 0 ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit 0 ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit 0 ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit 0 ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit 0 ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit 0 ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit 0 ;; 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 0 ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit 0 ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit 0 ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit 0 ;; *:UNICOS/mp:*:*) echo nv1-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit 0 ;; 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 0 ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit 0 ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit 0 ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit 0 ;; *:FreeBSD:*:*|*:GNU/FreeBSD:*:*) # Determine whether the default compiler uses glibc. eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include #if __GLIBC__ >= 2 LIBC=gnu #else LIBC= #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep ^LIBC=` echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`${LIBC:+-$LIBC} exit 0 ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit 0 ;; i*:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit 0 ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit 0 ;; x86:Interix*:[34]*) echo i586-pc-interix${UNAME_RELEASE}|sed -e 's/\..*//' exit 0 ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit 0 ;; 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 0 ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit 0 ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit 0 ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; *:GNU:*:*) echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit 0 ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit 0 ;; arm*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit 0 ;; cris:Linux:*:*) echo cris-axis-linux-gnu exit 0 ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-${VENDOR:-unknown}-linux-gnu exit 0 ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit 0 ;; mips:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips #undef mipsel #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mipsel #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips #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-gnu" && exit 0 ;; mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips64 #undef mips64el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mips64el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips64 #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-gnu" && exit 0 ;; ppc:Linux:*:*) echo powerpc-${VENDOR:-unknown}-linux-gnu exit 0 ;; ppc64:Linux:*:*) echo powerpc64-${VENDOR:-unknown}-linux-gnu exit 0 ;; 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 ld.so.1 >/dev/null if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} exit 0 ;; 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-gnu ;; PA8*) echo hppa2.0-unknown-linux-gnu ;; *) echo hppa-unknown-linux-gnu ;; esac exit 0 ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-gnu exit 0 ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-${VENDOR:-ibm}-linux-gnu exit 0 ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit 0 ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit 0 ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit 0 ;; x86_64:Linux:*:*) echo x86_64-${VENDOR:-unknown}-linux-gnu exit 0 ;; i*86:Linux:*:*) # The BFD linker knows what the default object file format is, so # first see if it will tell us. cd to the root directory to prevent # problems with other programs or directories called `ld' in the path. # Set LC_ALL=C to ensure ld outputs messages in English. ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \ | sed -ne '/supported targets:/!d s/[ ][ ]*/ /g s/.*supported targets: *// s/ .*// p'` case "$ld_supported_targets" in elf32-i386) TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu" ;; a.out-i386-linux) echo "${UNAME_MACHINE}-pc-linux-gnuaout" exit 0 ;; coff-i386) echo "${UNAME_MACHINE}-pc-linux-gnucoff" exit 0 ;; "") # Either a pre-BFD a.out linker (linux-gnuoldld) or # one that does not give us useful --help. echo "${UNAME_MACHINE}-pc-linux-gnuoldld" exit 0 ;; esac # Determine whether the default compiler is a.out or elf eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include #ifdef __ELF__ # ifdef __GLIBC__ # if __GLIBC__ >= 2 LIBC=gnu # else LIBC=gnulibc1 # endif # else LIBC=gnulibc1 # endif #else #ifdef __INTEL_COMPILER LIBC=gnu #else LIBC=gnuaout #endif #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep ^LIBC=` test x"${LIBC}" != x && echo "${UNAME_MACHINE}-${VENDOR:-pc}-linux-${LIBC}" && exit 0 test x"${TENTATIVE}" != x && echo "${TENTATIVE}" && exit 0 ;; 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 0 ;; 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 0 ;; 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 0 ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit 0 ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit 0 ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit 0 ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit 0 ;; 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 0 ;; i*86:*:5:[78]*) 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 0 ;; 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 0 ;; 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 i386. echo i386-pc-msdosdjgpp exit 0 ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit 0 ;; paragon:*:*:*) echo i860-intel-osf1 exit 0 ;; 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 0 ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit 0 ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit 0 ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit 0 ;; M68*:*:R3V[567]*:*) test -r /sysV68 && echo 'm68k-motorola-sysv' && exit 0 ;; 3[34]??:*: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) 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 0 /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && echo i586-ncr-sysv4.3${OS_REL} && exit 0 ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && echo i486-ncr-sysv4 && exit 0 ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit 0 ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit 0 ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit 0 ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit 0 ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.0*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit 0 ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit 0 ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit 0 ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit 0 ;; *: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 0 ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit 0 ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit 0 ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit 0 ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit 0 ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit 0 ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit 0 ;; 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 0 ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit 0 ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit 0 ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit 0 ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit 0 ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit 0 ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit 0 ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit 0 ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit 0 ;; *:Darwin:*:*) case `uname -p` in *86) UNAME_PROCESSOR=i686 ;; powerpc) UNAME_PROCESSOR=powerpc ;; esac echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit 0 ;; *: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 0 ;; *:QNX:*:4*) echo i386-pc-qnx exit 0 ;; NSR-[DGKLNPTVW]:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit 0 ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit 0 ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit 0 ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit 0 ;; *: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 0 ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit 0 ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit 0 ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit 0 ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit 0 ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit 0 ;; *:ITS:*:*) echo pdp10-unknown-its exit 0 ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit 0 ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 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"); 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 && $dummy && exit 0 # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit 0; } # 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 0 ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; c34*) echo c34-convex-bsd exit 0 ;; c38*) echo c38-convex-bsd exit 0 ;; c4*) echo c4-convex-bsd exit 0 ;; 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: coreseek-4.1-beta/csft-4.1/api/libsphinxclient/config.sub100777 0 0 73015 11643565730 16435 0#! /bin/sh # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003 Free Software Foundation, Inc. timestamp='2003-06-18' # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # 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 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, write to the Free Software # Foundation, Inc., 59 Temple Place - Suite 330, # Boston, MA 02111-1307, USA. # 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. # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # 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. # 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 (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001 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 0 ;; --version | -v ) echo "$version" ; exit 0 ;; --help | --h* | -h ) echo "$usage"; exit 0 ;; -- ) # 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 0;; * ) 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* | freebsd*-gnu* | netbsd*-gnu* | storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; *) 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) os= basic_machine=$1 ;; -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 ;; -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/'` ;; -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*) 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 \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr \ | c4x | clipper \ | d10v | d30v | dlx | dsp16xx \ | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | i370 | i860 | i960 | ia64 \ | ip2k \ | m32r | m68000 | m68k | m88k | mcore \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64vr | mips64vrel \ | mips64orion | mips64orionel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | msp430 \ | ns16k | ns32k \ | openrisc | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ | s390 | s390x \ | sh | sh[1234] | sh[23]e | sh[34]eb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc86x | sparclet | sparclite | sparcv9 | sparcv9b \ | strongarm \ | tahoe | thumb | tic4x | tic80 | tron \ | v850 | v850e \ | we32k \ | x86 | xscale | xstormy16 | xtensa \ | z8k) basic_machine=$basic_machine-unknown ;; m6811 | m68hc11 | m6812 | m68hc12) # Motorola 68HC11/12. basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; # 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-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* \ | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ | clipper-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* \ | m32r-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | mcore-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64vr-* | mips64vrel-* \ | mips64orion-* | mips64orionel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipstx39-* | mipstx39el-* \ | msp430-* \ | none-* | np1-* | nv1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \ | pyramid-* \ | romp-* | rs6000-* \ | s390-* | s390x-* \ | sh-* | sh[1234]-* | sh[23]e-* | sh[34]eb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc86x-* | sparclet-* | sparclite-* \ | sparcv9-* | sparcv9b-* | strongarm-* | sv1-* | sx?-* \ | tahoe-* | thumb-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ | x86-* | x86_64-* | xps100-* | xscale-* | xstormy16-* \ | xtensa-* \ | ymp-* \ | z8k-*) ;; # 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 ;; 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 ;; 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 ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; c90) basic_machine=c90-cray os=-unicos ;; 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 ;; crds | unos) basic_machine=m68k-crds ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; 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 ;; 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'm not sure what "Sysv32" means. Should this be sysv3.2? 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 ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; mingw32) basic_machine=i386-pc os=-mingw32 ;; 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 ;; mmix*) basic_machine=mmix-knuth os=-mmixware ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; mvs) basic_machine=i370-ibm os=-mvs ;; 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 ;; nv1) basic_machine=nv1-cray os=-unicosmp ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; or32 | or32-*) basic_machine=or32-unknown os=-coff ;; 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 ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; 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) basic_machine=powerpc-unknown ;; ppc-*) 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 ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; 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 ;; 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 ;; tic54x | c54x*) basic_machine=tic54x-unknown os=-coff ;; tic55x | c55x*) basic_machine=tic55x-unknown os=-coff ;; tic6x | c6x*) basic_machine=tic6x-unknown os=-coff ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; 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 ;; xps | xps100) basic_machine=xps100-honeywell ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-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 ;; 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 ;; sh3 | sh4 | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sh64) basic_machine=sh64-unknown ;; sparc | sparcv9 | sparcv9b) 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. -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* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -netbsd* | -openbsd* | -freebsd* | -riscix* \ | -lynxos* | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* \ | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -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*) # 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* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -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 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -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 ;; -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 ;; -kaos*) os=-kaos ;; -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 *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) 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 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; m68*-cisco) os=-aout ;; mips*-cisco) os=-elf ;; mips*-*) 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 ;; *-ibm) os=-aix ;; *-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 ;; -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 ;; -ptx*) vendor=sequent ;; -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 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: coreseek-4.1-beta/csft-4.1/api/libsphinxclient/configure100777 0 0 2371470 11643565730 16431 0#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.59 for libsphinxclient 0.0.1. # # Copyright (C) 2003 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 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+"$@"}'='"$@"' elif test -n "${BASH_VERSION+set}" && (set -o posix) >/dev/null 2>&1; then set -o posix fi DUALCASE=1; export DUALCASE # for MKS sh # Support unset when possible. if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then as_unset=unset else as_unset=false fi # Work around bugs in pre-3.0 UWIN ksh. $as_unset ENV MAIL MAILPATH PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. for as_var in \ LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ LC_TELEPHONE LC_TIME do if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then eval $as_var=C; export $as_var else $as_unset $as_var fi done # Required to use basename. if expr a : '\(a\)' >/dev/null 2>&1; 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 # Name of the executable. as_me=`$as_basename "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)$' \| \ . : '\(.\)' 2>/dev/null || echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/; q; } /^X\/\(\/\/\)$/{ s//\1/; q; } /^X\/\(\/\).*/{ s//\1/; q; } s/.*/./; q'` # PATH needs CR, and LINENO needs CR and PATH. # 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 # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then echo "#! /bin/sh" >conf$$.sh echo "exit 0" >>conf$$.sh chmod +x conf$$.sh if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then PATH_SEPARATOR=';' else PATH_SEPARATOR=: fi rm -f conf$$.sh fi as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" || { # Find who we are. Look in the path if we contain no path at all # relative or not. 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 ;; 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 { echo "$as_me: error: cannot find myself; rerun with an absolute path" >&2 { (exit 1); exit 1; }; } fi case $CONFIG_SHELL in '') as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for as_base in sh bash ksh sh5; do case $as_dir in /*) if ("$as_dir/$as_base" -c ' as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" ') 2>/dev/null; then $as_unset BASH_ENV || test "${BASH_ENV+set}" != set || { BASH_ENV=; export BASH_ENV; } $as_unset ENV || test "${ENV+set}" != set || { ENV=; export ENV; } CONFIG_SHELL=$as_dir/$as_base export CONFIG_SHELL exec "$CONFIG_SHELL" "$0" ${1+"$@"} fi;; esac done done ;; esac # Create $as_me.lineno as a copy of $as_myself, but with $LINENO # uniformly replaced by the line number. The first 'sed' inserts a # line-number line before each line; the second 'sed' does the real # work. The second script uses 'N' to pair each line-number line # with the numbered line, and appends trailing '-' during # substitution so that $LINENO is not a special case at line end. # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the # second 'sed' script. Blame Lee E. McMahon for sed's syntax. :-) sed '=' <$as_myself | sed ' N s,$,-, : loop s,^\(['$as_cr_digits']*\)\(.*\)[$]LINENO\([^'$as_cr_alnum'_]\),\1\2\1\3, t loop s,-$,, s,^['$as_cr_digits']*\n,, ' >$as_me.lineno && chmod +x $as_me.lineno || { echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2 { (exit 1); exit 1; }; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensible to this). . ./$as_me.lineno # Exit status is that of the last command. exit } case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in *c*,-n*) ECHO_N= ECHO_C=' ' ECHO_T=' ' ;; *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; *) ECHO_N= ECHO_C='\c' ECHO_T= ;; esac if expr a : '\(a\)' >/dev/null 2>&1; then as_expr=expr else as_expr=false fi rm -f conf$$ conf$$.exe conf$$.file echo >conf$$.file if ln -s conf$$.file conf$$ 2>/dev/null; then # We could just check for DJGPP; but this test a) works b) is more generic # and c) will remain valid once DJGPP supports symlinks (DJGPP 2.04). if test -f conf$$.exe; then # Don't use ln at all; we don't have any links as_ln_s='cp -p' else as_ln_s='ln -s' fi elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.file if mkdir -p . 2>/dev/null; then as_mkdir_p=: else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_executable_p="test -f" # 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'" # IFS # We need space, tab and new line, in precisely that order. as_nl=' ' IFS=" $as_nl" # CDPATH. $as_unset CDPATH # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$ECHO" | sed 's,\\\\\$\\$0,'$0','` ;; esac echo=${ECHO-echo} if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`($echo '\t') 2>/dev/null`" = 'X\t' ; then # Yippee, $echo works! : else # Restart under the correct shell. exec $SHELL "$0" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat </dev/null && echo_test_string="`eval $cmd`" && (test "X$echo_test_string" = "X$echo_test_string") 2>/dev/null then break fi done fi if test "X`($echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then echo="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$echo" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`(print -r '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`(print -r "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. echo='print -r' elif (test -f /bin/ksh || test -f /bin/ksh$ac_exeext) && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "$0" --no-reexec ${1+"$@"} else # Try using printf. echo='printf %s\n' if test "X`($echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL echo="$CONFIG_SHELL $0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then echo="$CONFIG_SHELL $0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "$0"' 'sed 10q "$0"' 'sed 20q "$0"' 'sed 50q "$0"'; do if (test "X$echo_test_string" = "X`eval $cmd`") 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "$0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "$0" ${1+"$@"} else # Oops. We lost completely, so just stick with echo. echo=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. ECHO=$echo if test "X$ECHO" = "X$CONFIG_SHELL $0 --fallback-echo"; then ECHO="$CONFIG_SHELL \\\$\$0 --fallback-echo" fi tagnames=${tagnames+${tagnames},}CXX tagnames=${tagnames+${tagnames},}F77 # Name of the host. # hostname on some systems (SVR3.2, Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` exec 6>&1 # # Initializations. # ac_default_prefix=/usr/local ac_config_libobj_dir=. cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= SHELL=${CONFIG_SHELL-/bin/sh} # Maximum number of lines to put in a shell here document. # This variable seems obsolete. It should probably be removed, and # only ac_max_sed_lines should be used. : ${ac_max_here_lines=38} # Identity of this package. PACKAGE_NAME='libsphinxclient' PACKAGE_TARNAME='libsphinxclient' PACKAGE_VERSION='0.0.1' PACKAGE_STRING='libsphinxclient 0.0.1' PACKAGE_BUGREPORT='' ac_unique_file="README" ac_unique_file="sphinxclient.h" # Factoring default headers for most tests. ac_includes_default="\ #include #if HAVE_SYS_TYPES_H # include #endif #if HAVE_SYS_STAT_H # include #endif #if STDC_HEADERS # include # include #else # if HAVE_STDLIB_H # include # endif #endif #if HAVE_STRING_H # if !STDC_HEADERS && HAVE_MEMORY_H # include # endif # include #endif #if HAVE_STRINGS_H # include #endif #if HAVE_INTTYPES_H # include #else # if HAVE_STDINT_H # include # endif #endif #if HAVE_UNISTD_H # include #endif" ac_subst_vars='SHELL PATH_SEPARATOR PACKAGE_NAME PACKAGE_TARNAME PACKAGE_VERSION PACKAGE_STRING PACKAGE_BUGREPORT exec_prefix prefix program_transform_name bindir sbindir libexecdir datadir sysconfdir sharedstatedir localstatedir libdir includedir oldincludedir infodir mandir build_alias host_alias target_alias DEFS ECHO_C ECHO_N ECHO_T LIBS INSTALL_PROGRAM INSTALL_SCRIPT INSTALL_DATA CYGPATH_W PACKAGE VERSION ACLOCAL AUTOCONF AUTOMAKE AUTOHEADER MAKEINFO install_sh STRIP ac_ct_STRIP INSTALL_STRIP_PROGRAM mkdir_p AWK SET_MAKE am__leading_dot AMTAR am__tar am__untar MAINTAINER_MODE_TRUE MAINTAINER_MODE_FALSE MAINT CC CFLAGS LDFLAGS CPPFLAGS ac_ct_CC EXEEXT OBJEXT DEPDIR am__include am__quote AMDEP_TRUE AMDEP_FALSE AMDEPBACKSLASH CCDEPMODE am__fastdepCC_TRUE am__fastdepCC_FALSE build build_cpu build_vendor build_os host host_cpu host_vendor host_os EGREP LN_S ECHO AR ac_ct_AR RANLIB ac_ct_RANLIB CPP CXXCPP LIBTOOL INSTALL_STRIP_FLAG LIBOBJS LTLIBOBJS' ac_subst_files='' # Initialize some variables set by options. ac_init_help= ac_init_version=false # 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. bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datadir='${prefix}/share' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' libdir='${exec_prefix}/lib' includedir='${prefix}/include' oldincludedir='/usr/include' infodir='${prefix}/info' mandir='${prefix}/man' ac_prev= 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 ac_optarg=`expr "x$ac_option" : 'x[^=]*=\(.*\)'` # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_option in -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 | --data | --dat | --da) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=* | --data=* | --dat=* \ | --da=*) datadir=$ac_optarg ;; -disable-* | --disable-*) ac_feature=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_feature" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid feature name: $ac_feature" >&2 { (exit 1); exit 1; }; } ac_feature=`echo $ac_feature | sed 's/-/_/g'` eval "enable_$ac_feature=no" ;; -enable-* | --enable-*) ac_feature=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_feature" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid feature name: $ac_feature" >&2 { (exit 1); exit 1; }; } ac_feature=`echo $ac_feature | sed 's/-/_/g'` case $ac_option in *=*) ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"`;; *) ac_optarg=yes ;; esac eval "enable_$ac_feature='$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 ;; -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 ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst \ | --locals | --local | --loca | --loc | --lo) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* \ | --locals=* | --local=* | --loca=* | --loc=* | --lo=*) 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 ;; -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_package=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_package" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid package name: $ac_package" >&2 { (exit 1); exit 1; }; } ac_package=`echo $ac_package| sed 's/-/_/g'` case $ac_option in *=*) ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"`;; *) ac_optarg=yes ;; esac eval "with_$ac_package='$ac_optarg'" ;; -without-* | --without-*) ac_package=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_package" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid package name: $ac_package" >&2 { (exit 1); exit 1; }; } ac_package=`echo $ac_package | sed 's/-/_/g'` eval "with_$ac_package=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 ;; -*) { echo "$as_me: error: unrecognized option: $ac_option Try \`$0 --help' for more information." >&2 { (exit 1); exit 1; }; } ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. expr "x$ac_envvar" : ".*[^_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid variable name: $ac_envvar" >&2 { (exit 1); exit 1; }; } ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` eval "$ac_envvar='$ac_optarg'" export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && 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'` { echo "$as_me: error: missing argument to $ac_option" >&2 { (exit 1); exit 1; }; } fi # Be sure to have absolute paths. for ac_var in exec_prefix prefix do eval ac_val=$`echo $ac_var` case $ac_val in [\\/$]* | ?:[\\/]* | NONE | '' ) ;; *) { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2 { (exit 1); exit 1; }; };; esac done # Be sure to have absolute paths. for ac_var in bindir sbindir libexecdir datadir sysconfdir sharedstatedir \ localstatedir libdir includedir oldincludedir infodir mandir do eval ac_val=$`echo $ac_var` case $ac_val in [\\/$]* | ?:[\\/]* ) ;; *) { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2 { (exit 1); exit 1; }; };; esac 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 echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used." >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null # 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 its parent. ac_confdir=`(dirname "$0") 2>/dev/null || $as_expr X"$0" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$0" : 'X\(//\)[^/]' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$0" | 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 if test "$ac_srcdir_defaulted" = yes; then { echo "$as_me: error: cannot find sources ($ac_unique_file) in $ac_confdir or .." >&2 { (exit 1); exit 1; }; } else { echo "$as_me: error: cannot find sources ($ac_unique_file) in $srcdir" >&2 { (exit 1); exit 1; }; } fi fi (cd $srcdir && test -r ./$ac_unique_file) 2>/dev/null || { echo "$as_me: error: sources are in $srcdir, but \`cd $srcdir' does not work" >&2 { (exit 1); exit 1; }; } srcdir=`echo "$srcdir" | sed 's%\([^\\/]\)[\\/]*$%\1%'` ac_env_build_alias_set=${build_alias+set} ac_env_build_alias_value=$build_alias ac_cv_env_build_alias_set=${build_alias+set} ac_cv_env_build_alias_value=$build_alias ac_env_host_alias_set=${host_alias+set} ac_env_host_alias_value=$host_alias ac_cv_env_host_alias_set=${host_alias+set} ac_cv_env_host_alias_value=$host_alias ac_env_target_alias_set=${target_alias+set} ac_env_target_alias_value=$target_alias ac_cv_env_target_alias_set=${target_alias+set} ac_cv_env_target_alias_value=$target_alias ac_env_CC_set=${CC+set} ac_env_CC_value=$CC ac_cv_env_CC_set=${CC+set} ac_cv_env_CC_value=$CC ac_env_CFLAGS_set=${CFLAGS+set} ac_env_CFLAGS_value=$CFLAGS ac_cv_env_CFLAGS_set=${CFLAGS+set} ac_cv_env_CFLAGS_value=$CFLAGS ac_env_LDFLAGS_set=${LDFLAGS+set} ac_env_LDFLAGS_value=$LDFLAGS ac_cv_env_LDFLAGS_set=${LDFLAGS+set} ac_cv_env_LDFLAGS_value=$LDFLAGS ac_env_CPPFLAGS_set=${CPPFLAGS+set} ac_env_CPPFLAGS_value=$CPPFLAGS ac_cv_env_CPPFLAGS_set=${CPPFLAGS+set} ac_cv_env_CPPFLAGS_value=$CPPFLAGS ac_env_CPP_set=${CPP+set} ac_env_CPP_value=$CPP ac_cv_env_CPP_set=${CPP+set} ac_cv_env_CPP_value=$CPP ac_env_CXXCPP_set=${CXXCPP+set} ac_env_CXXCPP_value=$CXXCPP ac_cv_env_CXXCPP_set=${CXXCPP+set} ac_cv_env_CXXCPP_value=$CXXCPP # # 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 libsphinxclient 0.0.1 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] _ACEOF cat <<_ACEOF 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] --datadir=DIR read-only architecture-independent data [PREFIX/share] --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] --infodir=DIR info documentation [PREFIX/info] --mandir=DIR man documentation [PREFIX/man] _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 libsphinxclient 0.0.1:";; esac cat <<\_ACEOF Optional Features: --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-maintainer-mode enable make rules and dependencies not useful (and sometimes confusing) to the casual installer --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) --enable-debug enable debugging symbols and compile flags Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-pic try to use only PIC/non-PIC objects [default=use both] --with-tags[=TAGS] include additional configurations [automatic] 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 CPPFLAGS C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory 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. _ACEOF fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. ac_popdir=`pwd` for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d $ac_dir || continue ac_builddir=. if test "$ac_dir" != .; then ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A "../" for each directory in $ac_dir_suffix. ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` else ac_dir_suffix= ac_top_builddir= fi case $srcdir in .) # No --srcdir option. We are building in place. ac_srcdir=. if test -z "$ac_top_builddir"; then ac_top_srcdir=. else ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` fi ;; [\\/]* | ?:[\\/]* ) # Absolute path. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ;; *) # Relative path. ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_builddir$srcdir ;; esac # Do not use `cd foo && pwd` to compute absolute paths, because # the directories may not exist. case `pwd` in .) ac_abs_builddir="$ac_dir";; *) case "$ac_dir" in .) ac_abs_builddir=`pwd`;; [\\/]* | ?:[\\/]* ) ac_abs_builddir="$ac_dir";; *) ac_abs_builddir=`pwd`/"$ac_dir";; esac;; esac case $ac_abs_builddir in .) ac_abs_top_builddir=${ac_top_builddir}.;; *) case ${ac_top_builddir}. in .) ac_abs_top_builddir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_builddir=${ac_top_builddir}.;; *) ac_abs_top_builddir=$ac_abs_builddir/${ac_top_builddir}.;; esac;; esac case $ac_abs_builddir in .) ac_abs_srcdir=$ac_srcdir;; *) case $ac_srcdir in .) ac_abs_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_srcdir=$ac_srcdir;; *) ac_abs_srcdir=$ac_abs_builddir/$ac_srcdir;; esac;; esac case $ac_abs_builddir in .) ac_abs_top_srcdir=$ac_top_srcdir;; *) case $ac_top_srcdir in .) ac_abs_top_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_srcdir=$ac_top_srcdir;; *) ac_abs_top_srcdir=$ac_abs_builddir/$ac_top_srcdir;; esac;; esac cd $ac_dir # Check for guested configure; otherwise get Cygnus style 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 elif test -f $ac_srcdir/configure.ac || test -f $ac_srcdir/configure.in; then echo $ac_configure --help else echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi cd $ac_popdir done fi test -n "$ac_init_help" && exit 0 if $ac_init_version; then cat <<\_ACEOF libsphinxclient configure 0.0.1 generated by GNU Autoconf 2.59 Copyright (C) 2003 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 0 fi exec 5>config.log cat >&5 <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by libsphinxclient $as_me 0.0.1, which was generated by GNU Autoconf 2.59. Invocation command line was $ $0 $@ _ACEOF { 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` hostinfo = `(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=. echo "PATH: $as_dir" done } >&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_sep= 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=`echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) ac_configure_args0="$ac_configure_args0 '$ac_arg'" ;; 2) ac_configure_args1="$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 ac_configure_args="$ac_configure_args$ac_sep'$ac_arg'" # Get rid of the leading space. ac_sep=" " ;; esac done done $as_unset ac_configure_args0 || test "${ac_configure_args0+set}" != set || { ac_configure_args0=; export ac_configure_args0; } $as_unset ac_configure_args1 || test "${ac_configure_args1+set}" != set || { ac_configure_args1=; export 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: Be sure not to use single quotes in there, as some shells, # such as our DU 5.0 friend, will then `close' the trap. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo cat <<\_ASBOX ## ---------------- ## ## Cache variables. ## ## ---------------- ## _ASBOX echo # The following way of writing the cache mishandles newlines in values, { (set) 2>&1 | case `(ac_space='"'"' '"'"'; set | grep ac_space) 2>&1` in *ac_space=\ *) sed -n \ "s/'"'"'/'"'"'\\\\'"'"''"'"'/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='"'"'\\2'"'"'/p" ;; *) sed -n \ "s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1=\\2/p" ;; esac; } echo cat <<\_ASBOX ## ----------------- ## ## Output variables. ## ## ----------------- ## _ASBOX echo for ac_var in $ac_subst_vars do eval ac_val=$`echo $ac_var` echo "$ac_var='"'"'$ac_val'"'"'" done | sort echo if test -n "$ac_subst_files"; then cat <<\_ASBOX ## ------------- ## ## Output files. ## ## ------------- ## _ASBOX echo for ac_var in $ac_subst_files do eval ac_val=$`echo $ac_var` echo "$ac_var='"'"'$ac_val'"'"'" done | sort echo fi if test -s confdefs.h; then cat <<\_ASBOX ## ----------- ## ## confdefs.h. ## ## ----------- ## _ASBOX echo sed "/^$/d" confdefs.h | sort echo fi test "$ac_signal" != 0 && echo "$as_me: caught signal $ac_signal" echo "$as_me: exit $exit_status" } >&5 rm -f core *.core && rm -rf conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; { (exit 1); exit 1; }' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -rf conftest* confdefs.h # AIX cpp loses on an empty file, so make sure it contains at least a newline. echo >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 # Let the site file select an alternate cache file if it wants to. # Prefer explicitly selected file to automatically selected ones. if test -z "$CONFIG_SITE"; then if test "x$prefix" != xNONE; then CONFIG_SITE="$prefix/share/config.site $prefix/etc/config.site" else CONFIG_SITE="$ac_default_prefix/share/config.site $ac_default_prefix/etc/config.site" fi fi for ac_site_file in $CONFIG_SITE; do if test -r "$ac_site_file"; then { echo "$as_me:$LINENO: loading site script $ac_site_file" >&5 echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" 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. if test -f "$cache_file"; then { echo "$as_me:$LINENO: loading cache $cache_file" >&5 echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . $cache_file;; *) . ./$cache_file;; esac fi else { echo "$as_me:$LINENO: creating cache $cache_file" >&5 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 `(set) 2>&1 | sed -n 's/^ac_env_\([a-zA-Z_0-9]*\)_set=.*/\1/p'`; 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,) { echo "$as_me:$LINENO: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { echo "$as_me:$LINENO: error: \`$ac_var' was not set in the previous run" >&5 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 { echo "$as_me:$LINENO: error: \`$ac_var' has changed since the previous run:" >&5 echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} { echo "$as_me:$LINENO: former value: $ac_old_val" >&5 echo "$as_me: former value: $ac_old_val" >&2;} { echo "$as_me:$LINENO: current value: $ac_new_val" >&5 echo "$as_me: current value: $ac_new_val" >&2;} ac_cache_corrupted=: fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?\"\']*) ac_arg=$ac_var=`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. *) ac_configure_args="$ac_configure_args '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { echo "$as_me:$LINENO: error: changes in the environment can compromise the build" >&5 echo "$as_me: error: changes in the environment can compromise the build" >&2;} { { echo "$as_me:$LINENO: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&5 echo "$as_me: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&2;} { (exit 1); exit 1; }; } 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_config_headers="$ac_config_headers sphinxclient_config.h" am__api_version="1.9" ac_aux_dir= for ac_dir in $srcdir $srcdir/.. $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 { { echo "$as_me:$LINENO: error: cannot find install-sh or install.sh in $srcdir $srcdir/.. $srcdir/../.." >&5 echo "$as_me: error: cannot find install-sh or install.sh in $srcdir $srcdir/.. $srcdir/../.." >&2;} { (exit 1); exit 1; }; } fi ac_config_guess="$SHELL $ac_aux_dir/config.guess" ac_config_sub="$SHELL $ac_aux_dir/config.sub" ac_configure="$SHELL $ac_aux_dir/configure" # This should be Cygnus configure. # 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. echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5 echo $ECHO_N "checking for a BSD-compatible install... $ECHO_C" >&6 if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_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 ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi done done ;; esac done 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. We don't cache a # path for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the path is relative. INSTALL=$ac_install_sh fi fi echo "$as_me:$LINENO: result: $INSTALL" >&5 echo "${ECHO_T}$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' echo "$as_me:$LINENO: checking whether build environment is sane" >&5 echo $ECHO_N "checking whether build environment is sane... $ECHO_C" >&6 # Just in case sleep 1 echo timestamp > conftest.file # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt $srcdir/configure conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t $srcdir/configure conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". { { echo "$as_me:$LINENO: error: ls -t appears to fail. Make sure there is not a broken alias in your environment" >&5 echo "$as_me: error: ls -t appears to fail. Make sure there is not a broken alias in your environment" >&2;} { (exit 1); exit 1; }; } fi test "$2" = conftest.file ) then # Ok. : else { { echo "$as_me:$LINENO: error: newly created file is older than distributed files! Check your system clock" >&5 echo "$as_me: error: newly created file is older than distributed files! Check your system clock" >&2;} { (exit 1); exit 1; }; } fi echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 test "$program_prefix" != NONE && program_transform_name="s,^,$program_prefix,;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s,\$,$program_suffix,;$program_transform_name" # Double any \ or $. echo might interpret backslashes. # By default was `s,x,x', remove it if useless. cat <<\_ACEOF >conftest.sed s/[\\$]/&&/g;s/;s,x,x,$// _ACEOF program_transform_name=`echo $program_transform_name | sed -f conftest.sed` rm conftest.sed # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` test x"${MISSING+set}" = xset || MISSING="\${SHELL} $am_aux_dir/missing" # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { echo "$as_me:$LINENO: WARNING: \`missing' script is too old or missing" >&5 echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi if mkdir -p --version . >/dev/null 2>&1 && test ! -d ./--version; then # We used to keeping the `.' as first argument, in order to # allow $(mkdir_p) to be used without argument. As in # $(mkdir_p) $(somedir) # where $(somedir) is conditionally defined. However this is wrong # for two reasons: # 1. if the package is installed by a user who cannot write `.' # make install will fail, # 2. the above comment should most certainly read # $(mkdir_p) $(DESTDIR)$(somedir) # so it does not work when $(somedir) is undefined and # $(DESTDIR) is not. # To support the latter case, we have to write # test -z "$(somedir)" || $(mkdir_p) $(DESTDIR)$(somedir), # so the `.' trick is pointless. mkdir_p='mkdir -p --' else # On NextStep and OpenStep, the `mkdir' command does not # recognize any option. It will interpret all options as # directories to create, and then abort because `.' already # exists. for d in ./-p ./--version; do test -d $d && rmdir $d done # $(mkinstalldirs) is defined by Automake if mkinstalldirs exists. if test -f "$ac_aux_dir/mkinstalldirs"; then mkdir_p='$(mkinstalldirs)' else mkdir_p='$(install_sh) -d' fi fi 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_AWK+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AWK="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then echo "$as_me:$LINENO: result: $AWK" >&5 echo "${ECHO_T}$AWK" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$AWK" && break done echo "$as_me:$LINENO: checking whether ${MAKE-make} sets \$(MAKE)" >&5 echo $ECHO_N "checking whether ${MAKE-make} sets \$(MAKE)... $ECHO_C" >&6 set dummy ${MAKE-make}; ac_make=`echo "$2" | sed 'y,:./+-,___p_,'` if eval "test \"\${ac_cv_prog_make_${ac_make}_set+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.make <<\_ACEOF all: @echo 'ac_maketemp="$(MAKE)"' _ACEOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. eval `${MAKE-make} -f conftest.make 2>/dev/null | grep temp=` if test -n "$ac_maketemp"; then eval ac_cv_prog_make_${ac_make}_set=yes else eval ac_cv_prog_make_${ac_make}_set=no fi rm -f conftest.make fi if eval "test \"`echo '$ac_cv_prog_make_'${ac_make}_set`\" = yes"; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 SET_MAKE= else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}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 # test to see if srcdir already configured if test "`cd $srcdir && pwd`" != "`pwd`" && test -f $srcdir/config.status; then { { echo "$as_me:$LINENO: error: source directory already configured; run \"make distclean\" there first" >&5 echo "$as_me: error: source directory already configured; run \"make distclean\" there first" >&2;} { (exit 1); exit 1; }; } 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='libsphinxclient' VERSION='0.0.1' # 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"} install_sh=${install_sh-"$am_aux_dir/install-sh"} # 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then echo "$as_me:$LINENO: result: $STRIP" >&5 echo "${ECHO_T}$STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_STRIP="strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_STRIP" && ac_cv_prog_ac_ct_STRIP=":" fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then echo "$as_me:$LINENO: result: $ac_ct_STRIP" >&5 echo "${ECHO_T}$ac_ct_STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi STRIP=$ac_ct_STRIP else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\${SHELL} \$(install_sh) -c -s" # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. AMTAR=${AMTAR-"${am_missing_run}tar"} am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -' echo "$as_me:$LINENO: checking whether to enable maintainer-specific portions of Makefiles" >&5 echo $ECHO_N "checking whether to enable maintainer-specific portions of Makefiles... $ECHO_C" >&6 # Check whether --enable-maintainer-mode or --disable-maintainer-mode was given. if test "${enable_maintainer_mode+set}" = set; then enableval="$enable_maintainer_mode" USE_MAINTAINER_MODE=$enableval else USE_MAINTAINER_MODE=no fi; echo "$as_me:$LINENO: result: $USE_MAINTAINER_MODE" >&5 echo "${ECHO_T}$USE_MAINTAINER_MODE" >&6 if test $USE_MAINTAINER_MODE = yes; then MAINTAINER_MODE_TRUE= MAINTAINER_MODE_FALSE='#' else MAINTAINER_MODE_TRUE='#' MAINTAINER_MODE_FALSE= fi MAINT=$MAINTAINER_MODE_TRUE 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 echo "${ECHO_T}$ac_ct_CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi CC=$ac_ct_CC 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="cc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 echo "${ECHO_T}$ac_ct_CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi CC=$ac_ct_CC else CC="$ac_cv_prog_CC" 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_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" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done 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 echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 echo "${ECHO_T}$ac_ct_CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$ac_ct_CC" && break done CC=$ac_ct_CC fi fi test -z "$CC" && { { echo "$as_me:$LINENO: error: no acceptable C compiler found in \$PATH See \`config.log' for more details." >&5 echo "$as_me: error: no acceptable C compiler found in \$PATH See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } # Provide some information about the compiler. echo "$as_me:$LINENO:" \ "checking for C compiler version" >&5 ac_compiler=`set X $ac_compile; echo $2` { (eval echo "$as_me:$LINENO: \"$ac_compiler --version &5\"") >&5 (eval $ac_compiler --version &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -v &5\"") >&5 (eval $ac_compiler -v &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -V &5\"") >&5 (eval $ac_compiler -V &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out 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. echo "$as_me:$LINENO: checking for C compiler default output file name" >&5 echo $ECHO_N "checking for C compiler default output file name... $ECHO_C" >&6 ac_link_default=`echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` if { (eval echo "$as_me:$LINENO: \"$ac_link_default\"") >&5 (eval $ac_link_default) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # Find the output, starting from the most likely. This scheme is # not robust to junk in `.', hence go to wildcards (a.*) only as a last # resort. # Be careful to initialize this variable, since it used to be cached. # Otherwise an old cache value of `no' led to `EXEEXT = no' in a Makefile. ac_cv_exeext= # b.out is created by i960 compilers. for ac_file in a_out.exe a.exe conftest.exe a.out conftest a.* conftest.* b.out do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.o | *.obj ) ;; conftest.$ac_ext ) # This is the source file. ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` # FIXME: I believe we export ac_cv_exeext for Libtool, # but it would be cool to find out if it's true. Does anybody # maintain Libtool? --akim. export ac_cv_exeext break;; * ) break;; esac done else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { echo "$as_me:$LINENO: error: C compiler cannot create executables See \`config.log' for more details." >&5 echo "$as_me: error: C compiler cannot create executables See \`config.log' for more details." >&2;} { (exit 77); exit 77; }; } fi ac_exeext=$ac_cv_exeext echo "$as_me:$LINENO: result: $ac_file" >&5 echo "${ECHO_T}$ac_file" >&6 # Check the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. echo "$as_me:$LINENO: checking whether the C compiler works" >&5 echo $ECHO_N "checking whether the C compiler works... $ECHO_C" >&6 # FIXME: These cross compiler hacks should be removed for Autoconf 3.0 # If not cross compiling, check that we can run a simple program. if test "$cross_compiling" != yes; then if { ac_try='./$ac_file' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { echo "$as_me:$LINENO: error: cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." >&5 echo "$as_me: error: cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi fi fi echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 rm -f a.out a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save # Check the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. echo "$as_me:$LINENO: checking whether we are cross compiling" >&5 echo $ECHO_N "checking whether we are cross compiling... $ECHO_C" >&6 echo "$as_me:$LINENO: result: $cross_compiling" >&5 echo "${ECHO_T}$cross_compiling" >&6 echo "$as_me:$LINENO: checking for suffix of executables" >&5 echo $ECHO_N "checking for suffix of executables... $ECHO_C" >&6 if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; 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 | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` export ac_cv_exeext break;; * ) break;; esac done else { { echo "$as_me:$LINENO: error: cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." >&5 echo "$as_me: error: cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi rm -f conftest$ac_cv_exeext echo "$as_me:$LINENO: result: $ac_cv_exeext" >&5 echo "${ECHO_T}$ac_cv_exeext" >&6 rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT echo "$as_me:$LINENO: checking for suffix of object files" >&5 echo $ECHO_N "checking for suffix of object files... $ECHO_C" >&6 if test "${ac_cv_objext+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then for ac_file in `(ls conftest.o conftest.obj; ls conftest.*) 2>/dev/null`; do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { echo "$as_me:$LINENO: error: cannot compute suffix of object files: cannot compile See \`config.log' for more details." >&5 echo "$as_me: error: cannot compute suffix of object files: cannot compile See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_objext" >&5 echo "${ECHO_T}$ac_cv_objext" >&6 OBJEXT=$ac_cv_objext ac_objext=$OBJEXT echo "$as_me:$LINENO: checking whether we are using the GNU C compiler" >&5 echo $ECHO_N "checking whether we are using the GNU C compiler... $ECHO_C" >&6 if test "${ac_cv_c_compiler_gnu+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_compiler_gnu=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_compiler_gnu=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi echo "$as_me:$LINENO: result: $ac_cv_c_compiler_gnu" >&5 echo "${ECHO_T}$ac_cv_c_compiler_gnu" >&6 GCC=`test $ac_compiler_gnu = yes && echo yes` ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS CFLAGS="-g" echo "$as_me:$LINENO: checking whether $CC accepts -g" >&5 echo $ECHO_N "checking whether $CC accepts -g... $ECHO_C" >&6 if test "${ac_cv_prog_cc_g+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_prog_cc_g=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_prog_cc_g=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_prog_cc_g" >&5 echo "${ECHO_T}$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 echo "$as_me:$LINENO: checking for $CC option to accept ANSI C" >&5 echo $ECHO_N "checking for $CC option to accept ANSI C... $ECHO_C" >&6 if test "${ac_cv_prog_cc_stdc+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_prog_cc_stdc=no ac_save_CC=$CC cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std1 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 -std1. */ int osf4_cc_array ['\x00' == 0 ? 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 # Don't try gcc -ansi; that turns off useful extensions and # breaks some systems' header files. # AIX -qlanglvl=ansi # Ultrix and OSF/1 -std1 # HP-UX 10.20 and later -Ae # HP-UX older versions -Aa -D_HPUX_SOURCE # SVR4 -Xc -D__EXTENSIONS__ for ac_arg in "" -qlanglvl=ansi -std1 -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_prog_cc_stdc=$ac_arg break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext done rm -f conftest.$ac_ext conftest.$ac_objext CC=$ac_save_CC fi case "x$ac_cv_prog_cc_stdc" in x|xno) echo "$as_me:$LINENO: result: none needed" >&5 echo "${ECHO_T}none needed" >&6 ;; *) echo "$as_me:$LINENO: result: $ac_cv_prog_cc_stdc" >&5 echo "${ECHO_T}$ac_cv_prog_cc_stdc" >&6 CC="$CC $ac_cv_prog_cc_stdc" ;; esac # Some people use a C++ compiler to compile C. Since we use `exit', # in C++ we need to declare it. In case someone uses the same compiler # for both compiling C and C++ we need to have the C++ compiler decide # the declaration of exit, since it's the most demanding environment. cat >conftest.$ac_ext <<_ACEOF #ifndef __cplusplus choke me #endif _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then for ac_declaration in \ '' \ 'extern "C" void std::exit (int) throw (); using std::exit;' \ 'extern "C" void std::exit (int); using std::exit;' \ 'extern "C" void exit (int) throw ();' \ 'extern "C" void exit (int);' \ 'void exit (int);' do cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_declaration #include int main () { exit (42); ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 continue fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_declaration int main () { exit (42); ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext done rm -f conftest* if test -n "$ac_declaration"; then echo '#ifdef __cplusplus' >>confdefs.h echo $ac_declaration >>confdefs.h echo '#endif' >>confdefs.h fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo done .PHONY: am__doit END # If we don't find an include directive, just comment out the code. echo "$as_me:$LINENO: checking for style of include used by $am_make" >&5 echo $ECHO_N "checking for style of include used by $am_make... $ECHO_C" >&6 am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # We grep out `Entering directory' and `Leaving directory' # messages which can occur if `w' ends up in MAKEFLAGS. # In particular we don't look at `^make:' because GNU make might # be invoked under some other name (usually "gmake"), in which # case it prints its new name instead of `make'. if test "`$am_make -s -f confmf 2> /dev/null | grep -v 'ing directory'`" = "done"; then am__include=include am__quote= _am_result=GNU fi # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf if test "`$am_make -s -f confmf 2> /dev/null`" = "done"; then am__include=.include am__quote="\"" _am_result=BSD fi fi echo "$as_me:$LINENO: result: $_am_result" >&5 echo "${ECHO_T}$_am_result" >&6 rm -f confinc confmf # Check whether --enable-dependency-tracking or --disable-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='\' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CC" am_compiler_list= echo "$as_me:$LINENO: checking dependency style of $depcc" >&5 echo $ECHO_N "checking dependency style of $depcc... $ECHO_C" >&6 if test "${am_cv_CC_dependencies_compiler_type+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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'. 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 for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf case $depmode in 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 ;; none) break ;; esac # 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. if depmode=$depmode \ source=sub/conftest.c object=sub/conftest.${OBJEXT-o} \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c -o sub/conftest.${OBJEXT-o} sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftest.${OBJEXT-o} 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 echo "$as_me:$LINENO: result: $am_cv_CC_dependencies_compiler_type" >&5 echo "${ECHO_T}$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 echo "$as_me:$LINENO: checking for a sed that does not truncate output" >&5 echo $ECHO_N "checking for a sed that does not truncate output... $ECHO_C" >&6 if test "${lt_cv_path_SED+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # 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 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 && break 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 fi echo "$as_me:$LINENO: result: $SED" >&5 echo "${ECHO_T}$SED" >&6 # Make sure we can run config.sub. $ac_config_sub sun4 >/dev/null 2>&1 || { { echo "$as_me:$LINENO: error: cannot run $ac_config_sub" >&5 echo "$as_me: error: cannot run $ac_config_sub" >&2;} { (exit 1); exit 1; }; } echo "$as_me:$LINENO: checking build system type" >&5 echo $ECHO_N "checking build system type... $ECHO_C" >&6 if test "${ac_cv_build+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_build_alias=$build_alias test -z "$ac_cv_build_alias" && ac_cv_build_alias=`$ac_config_guess` test -z "$ac_cv_build_alias" && { { echo "$as_me:$LINENO: error: cannot guess build type; you must specify one" >&5 echo "$as_me: error: cannot guess build type; you must specify one" >&2;} { (exit 1); exit 1; }; } ac_cv_build=`$ac_config_sub $ac_cv_build_alias` || { { echo "$as_me:$LINENO: error: $ac_config_sub $ac_cv_build_alias failed" >&5 echo "$as_me: error: $ac_config_sub $ac_cv_build_alias failed" >&2;} { (exit 1); exit 1; }; } fi echo "$as_me:$LINENO: result: $ac_cv_build" >&5 echo "${ECHO_T}$ac_cv_build" >&6 build=$ac_cv_build build_cpu=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` build_vendor=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` build_os=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` echo "$as_me:$LINENO: checking host system type" >&5 echo $ECHO_N "checking host system type... $ECHO_C" >&6 if test "${ac_cv_host+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_host_alias=$host_alias test -z "$ac_cv_host_alias" && ac_cv_host_alias=$ac_cv_build_alias ac_cv_host=`$ac_config_sub $ac_cv_host_alias` || { { echo "$as_me:$LINENO: error: $ac_config_sub $ac_cv_host_alias failed" >&5 echo "$as_me: error: $ac_config_sub $ac_cv_host_alias failed" >&2;} { (exit 1); exit 1; }; } fi echo "$as_me:$LINENO: result: $ac_cv_host" >&5 echo "${ECHO_T}$ac_cv_host" >&6 host=$ac_cv_host host_cpu=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` host_vendor=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` host_os=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` echo "$as_me:$LINENO: checking for egrep" >&5 echo $ECHO_N "checking for egrep... $ECHO_C" >&6 if test "${ac_cv_prog_egrep+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if echo a | (grep -E '(a|b)') >/dev/null 2>&1 then ac_cv_prog_egrep='grep -E' else ac_cv_prog_egrep='egrep' fi fi echo "$as_me:$LINENO: result: $ac_cv_prog_egrep" >&5 echo "${ECHO_T}$ac_cv_prog_egrep" >&6 EGREP=$ac_cv_prog_egrep # Check whether --with-gnu-ld or --without-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. echo "$as_me:$LINENO: checking for ld used by $CC" >&5 echo $ECHO_N "checking for ld used by $CC... $ECHO_C" >&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 echo "$as_me:$LINENO: checking for GNU ld" >&5 echo $ECHO_N "checking for GNU ld... $ECHO_C" >&6 else echo "$as_me:$LINENO: checking for non-GNU ld" >&5 echo $ECHO_N "checking for non-GNU ld... $ECHO_C" >&6 fi if test "${lt_cv_path_LD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 GNU ld's 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 echo "${ECHO_T}$LD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -z "$LD" && { { echo "$as_me:$LINENO: error: no acceptable ld found in \$PATH" >&5 echo "$as_me: error: no acceptable ld found in \$PATH" >&2;} { (exit 1); exit 1; }; } echo "$as_me:$LINENO: checking if the linker ($LD) is GNU ld" >&5 echo $ECHO_N "checking if the linker ($LD) is GNU ld... $ECHO_C" >&6 if test "${lt_cv_prog_gnu_ld+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # I'd rather use --version here, but apparently some GNU ld's only accept -v. case `$LD -v 2>&1 &5 echo "${ECHO_T}$lt_cv_prog_gnu_ld" >&6 with_gnu_ld=$lt_cv_prog_gnu_ld # Check whether --enable-shared or --disable-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 or --disable-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 --enable-fast-install or --disable-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; echo "$as_me:$LINENO: checking for $LD option to reload object files" >&5 echo $ECHO_N "checking for $LD option to reload object files... $ECHO_C" >&6 if test "${lt_cv_ld_reload_flag+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_ld_reload_flag='-r' fi echo "$as_me:$LINENO: result: $lt_cv_ld_reload_flag" >&5 echo "${ECHO_T}$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' echo "$as_me:$LINENO: checking for BSD-compatible nm" >&5 echo $ECHO_N "checking for BSD-compatible nm... $ECHO_C" >&6 if test "${lt_cv_path_NM+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/${ac_tool_prefix}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" test -z "$lt_cv_path_NM" && lt_cv_path_NM=nm fi fi echo "$as_me:$LINENO: result: $lt_cv_path_NM" >&5 echo "${ECHO_T}$lt_cv_path_NM" >&6 NM="$lt_cv_path_NM" echo "$as_me:$LINENO: checking whether ln -s works" >&5 echo $ECHO_N "checking whether ln -s works... $ECHO_C" >&6 LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no, using $LN_S" >&5 echo "${ECHO_T}no, using $LN_S" >&6 fi echo "$as_me:$LINENO: checking how to recognise dependent libraries" >&5 echo $ECHO_N "checking how to recognise dependent libraries... $ECHO_C" >&6 if test "${lt_cv_deplibs_check_method+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 aix4* | aix5*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi4*) 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'. lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | kfreebsd*-gnu) 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)/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 ;; gnu*) 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]) 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 ;; 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 Linux ELF. linux*) case $host_cpu in alpha*|hppa*|i*86|ia64*|m68*|mips*|powerpc*|sparc*|s390*|sh*|x86_64*) lt_cv_deplibs_check_method=pass_all ;; *) # glibc up to 2.1.1 does not perform some relocations on ARM # this will be overridden with pass_all, but let us keep it just in case lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; esac lt_cv_file_magic_test_file=`echo /lib/libc.so* /lib/libc-*.so` lt_cv_deplibs_check_method=pass_all ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; nto-qnx*) lt_cv_deplibs_check_method=unknown ;; openbsd*) lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB shared object' else lt_cv_deplibs_check_method='file_magic OpenBSD.* shared library' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; sco3.2v5*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) 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 ;; esac ;; sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[78]* | unixware7* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; esac fi echo "$as_me:$LINENO: result: $lt_cv_deplibs_check_method" >&5 echo "${ECHO_T}$lt_cv_deplibs_check_method" >&6 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 no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # Allow CC to be a program name with arguments. compiler=$CC # Check whether --enable-libtool-lock or --disable-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:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; 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 3668 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; 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-*linux*|ppc*-*linux*|powerpc*-*linux*|s390*-*linux*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case "`/usr/bin/file conftest.o`" in *32-bit*) case $host in x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*) 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" echo "$as_me:$LINENO: checking whether the C compiler needs -belf" >&5 echo $ECHO_N "checking whether the C compiler needs -belf... $ECHO_C" >&6 if test "${lt_cv_cc_needs_belf+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then lt_cv_cc_needs_belf=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 lt_cv_cc_needs_belf=no fi rm -f 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 echo "$as_me:$LINENO: result: $lt_cv_cc_needs_belf" >&5 echo "${ECHO_T}$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 ;; esac need_locks="$enable_libtool_lock" 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 echo "$as_me:$LINENO: checking how to run the C preprocessor" >&5 echo $ECHO_N "checking how to run the C preprocessor... $ECHO_C" >&6 # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if test "${ac_cv_prog_CPP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f 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 echo "$as_me:$LINENO: result: $CPP" >&5 echo "${ECHO_T}$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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { echo "$as_me:$LINENO: error: C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." >&5 echo "$as_me: error: C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } 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 echo "$as_me:$LINENO: checking for ANSI C header files" >&5 echo $ECHO_N "checking for ANSI C header files... $ECHO_C" >&6 if test "${ac_cv_header_stdc+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_header_stdc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_header_stdc=no fi rm -f 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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* 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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* 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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #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)) exit(2); exit (0); } _ACEOF rm -f conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='./conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: program exited with status $ac_status" >&5 echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ( exit $ac_status ) ac_cv_header_stdc=no fi rm -f core *.core gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext fi fi fi echo "$as_me:$LINENO: result: $ac_cv_header_stdc" >&5 echo "${ECHO_T}$ac_cv_header_stdc" >&6 if test $ac_cv_header_stdc = yes; then cat >>confdefs.h <<\_ACEOF #define STDC_HEADERS 1 _ACEOF 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=`echo "ac_cv_header_$ac_header" | $as_tr_sh` echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then eval "$as_ac_Header=yes" else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 eval "$as_ac_Header=no" fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` if eval "test \"\${$as_ac_Header+set}\" = set"; then echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 else # Is the header compilable? echo "$as_me:$LINENO: checking $ac_header usability" >&5 echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_header_compiler=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_compiler=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 echo "${ECHO_T}$ac_header_compiler" >&6 # Is the header present? echo "$as_me:$LINENO: checking $ac_header presence" >&5 echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include <$ac_header> _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then ac_header_preproc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_preproc=no fi rm -f conftest.err conftest.$ac_ext echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 echo "${ECHO_T}$ac_header_preproc" >&6 # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in yes:no: ) { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the compiler's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the compiler's result" >&2;} ac_header_preproc=yes ;; no:yes:* ) { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: see the Autoconf documentation" >&5 echo "$as_me: WARNING: $ac_header: see the Autoconf documentation" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&5 echo "$as_me: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: in the future, the compiler will take precedence" >&5 echo "$as_me: WARNING: $ac_header: in the future, the compiler will take precedence" >&2;} ( cat <<\_ASBOX ## ------------------------------------------ ## ## Report this to the libsphinxclient lists. ## ## ------------------------------------------ ## _ASBOX ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else eval "$as_ac_Header=\$ac_header_preproc" fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 fi if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done ac_ext=cc 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 echo "$as_me:$LINENO: checking how to run the C++ preprocessor" >&5 echo $ECHO_N "checking how to run the C++ preprocessor... $ECHO_C" >&6 if test -z "$CXXCPP"; then if test "${ac_cv_prog_CXXCPP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f 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 echo "$as_me:$LINENO: result: $CXXCPP" >&5 echo "${ECHO_T}$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 >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { echo "$as_me:$LINENO: error: C++ preprocessor \"$CXXCPP\" fails sanity check See \`config.log' for more details." >&5 echo "$as_me: error: C++ preprocessor \"$CXXCPP\" fails sanity check See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi ac_ext=cc 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 # Autoconf 2.13's AC_OBJEXT and AC_EXEEXT macros only works for C compilers! # find the maximum length of command line arguments echo "$as_me:$LINENO: checking the maximum length of command line arguments" >&5 echo $ECHO_N "checking the maximum length of command line arguments... $ECHO_C" >&6 if test "${lt_cv_sys_max_cmd_len+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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*) # 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; ;; 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; ;; *) # 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"`$CONFIG_SHELL $0 --fallback-echo "X$teststring" 2>/dev/null` \ = "XX$teststring") >/dev/null 2>&1 && new_result=`expr "X$teststring" : ".*" 2>&1` && lt_cv_sys_max_cmd_len=$new_result && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done 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` ;; esac fi if test -n $lt_cv_sys_max_cmd_len ; then echo "$as_me:$LINENO: result: $lt_cv_sys_max_cmd_len" >&5 echo "${ECHO_T}$lt_cv_sys_max_cmd_len" >&6 else echo "$as_me:$LINENO: result: none" >&5 echo "${ECHO_T}none" >&6 fi # Check for command to grab the raw symbol name followed by C symbol from nm. echo "$as_me:$LINENO: checking command to parse $NM output from $compiler object" >&5 echo $ECHO_N "checking command to parse $NM output from $compiler object... $ECHO_C" >&6 if test "${lt_cv_sys_global_symbol_pipe+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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]*\)' # Transform the above into a raw symbol and a C symbol. symxfrm='\1 \2\3 \3' # Transform an extracted symbol line into a proper C declaration lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^. .* \(.*\)$/extern int \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\\\", (lt_ptr) 0},/p' -e 's/^$symcode \([^ ]*\) \([^ ]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'" # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32*) symcode='[ABCDGISTW]' ;; hpux*) # Its linker distinguishes data from code symbols if test "$host_cpu" = ia64; then symcode='[ABCDEGRST]' fi lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'" ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris* | sysv5*) symcode='[BDRT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # 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 # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac # Try without a prefix undercore, then with it. for ac_symprfx in "" "_"; do # Write the raw and C identifiers. lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*\($ac_symprfx\)$sympat$opt_cr$/$symxfrm/p'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # Now try to grab the symbols. nlist=conftest.nm if { (eval echo "$as_me:$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=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && 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 < conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | grep -v main >> conftest.$ac_ext' cat <> conftest.$ac_ext #if defined (__STDC__) && __STDC__ # define lt_ptr_t void * #else # define lt_ptr_t char * # define const #endif /* The mapping between symbol names and symbols. */ const struct { const char *name; lt_ptr_t address; } lt_preloaded_symbols[] = { EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (lt_ptr_t) \&\2},/" < "$nlist" | grep -v main >> conftest.$ac_ext cat <<\EOF >> conftest.$ac_ext {0, (lt_ptr_t) 0} }; #ifdef __cplusplus } #endif EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_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 -f 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 echo "$as_me:$LINENO: result: failed" >&5 echo "${ECHO_T}failed" >&6 else echo "$as_me:$LINENO: result: ok" >&5 echo "${ECHO_T}ok" >&6 fi echo "$as_me:$LINENO: checking for objdir" >&5 echo $ECHO_N "checking for objdir... $ECHO_C" >&6 if test "${lt_cv_objdir+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 echo "$as_me:$LINENO: result: $lt_cv_objdir" >&5 echo "${ECHO_T}$lt_cv_objdir" >&6 objdir=$lt_cv_objdir 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 # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed='sed -e s/^X//' 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 avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Constants: rm="rm -f" # Global variables: default_ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except M$VC, # which needs '.lib'). libext=a ltmain="$ac_aux_dir/ltmain.sh" ofile="$default_ofile" with_gnu_ld="$lt_cv_prog_gnu_ld" if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ar", so it can be a program name with args. set dummy ${ac_tool_prefix}ar; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_AR+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AR="${ac_tool_prefix}ar" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then echo "$as_me:$LINENO: result: $AR" >&5 echo "${ECHO_T}$AR" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$ac_cv_prog_AR"; then ac_ct_AR=$AR # Extract the first word of "ar", so it can be a program name with args. set dummy ar; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_AR+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_AR="ar" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_AR" && ac_cv_prog_ac_ct_AR="false" fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then echo "$as_me:$LINENO: result: $ac_ct_AR" >&5 echo "${ECHO_T}$ac_ct_AR" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi AR=$ac_ct_AR else AR="$ac_cv_prog_AR" fi 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_RANLIB+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then echo "$as_me:$LINENO: result: $RANLIB" >&5 echo "${ECHO_T}$RANLIB" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_RANLIB+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_RANLIB="ranlib" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_RANLIB" && ac_cv_prog_ac_ct_RANLIB=":" fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then echo "$as_me:$LINENO: result: $ac_ct_RANLIB" >&5 echo "${ECHO_T}$ac_ct_RANLIB" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi RANLIB=$ac_ct_RANLIB else RANLIB="$ac_cv_prog_RANLIB" 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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then echo "$as_me:$LINENO: result: $STRIP" >&5 echo "${ECHO_T}$STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}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 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_STRIP="strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_STRIP" && ac_cv_prog_ac_ct_STRIP=":" fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then echo "$as_me:$LINENO: result: $ac_ct_STRIP" >&5 echo "${ECHO_T}$ac_ct_STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi STRIP=$ac_ct_STRIP else STRIP="$ac_cv_prog_STRIP" fi old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru test -z "$AS" && AS=as test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$DLLTOOL" && DLLTOOL=dlltool test -z "$LD" && LD=ld test -z "$LN_S" && LN_S="ln -s" test -z "$MAGIC_CMD" && MAGIC_CMD=file test -z "$NM" && NM=nm test -z "$SED" && SED=sed test -z "$OBJDUMP" && OBJDUMP=objdump test -z "$RANLIB" && RANLIB=: test -z "$STRIP" && STRIP=: test -z "$ac_objext" && ac_objext=o # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="\$RANLIB -t \$oldlib~$old_postinstall_cmds" ;; *) old_postinstall_cmds="\$RANLIB \$oldlib~$old_postinstall_cmds" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi # Only perform the check for file, if the check method requires it case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then echo "$as_me:$LINENO: checking for ${ac_tool_prefix}file" >&5 echo $ECHO_N "checking for ${ac_tool_prefix}file... $ECHO_C" >&6 if test "${lt_cv_path_MAGIC_CMD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 <&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 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 echo "$as_me:$LINENO: result: $MAGIC_CMD" >&5 echo "${ECHO_T}$MAGIC_CMD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then echo "$as_me:$LINENO: checking for file" >&5 echo $ECHO_N "checking for file... $ECHO_C" >&6 if test "${lt_cv_path_MAGIC_CMD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 <&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 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 echo "$as_me:$LINENO: result: $MAGIC_CMD" >&5 echo "${ECHO_T}$MAGIC_CMD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi else MAGIC_CMD=: fi fi fi ;; esac enable_dlopen=no enable_win32_dll=no # Check whether --enable-libtool-lock or --disable-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 # Check whether --with-pic or --without-pic was given. if test "${with_pic+set}" = set; then withval="$with_pic" pic_mode="$withval" else pic_mode=default fi; test -z "$pic_mode" && pic_mode=default # Use C for the default configuration in the libtool script tagname= 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;\n" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}\n' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # Allow CC to be a program name with arguments. compiler=$CC # # Check for any special shared library compilation flags. # lt_prog_cc_shlib= if test "$GCC" = no; then case $host_os in sco3.2v5*) lt_prog_cc_shlib='-belf' ;; esac fi if test -n "$lt_prog_cc_shlib"; then { echo "$as_me:$LINENO: WARNING: \`$CC' requires \`$lt_prog_cc_shlib' to build shared libraries" >&5 echo "$as_me: WARNING: \`$CC' requires \`$lt_prog_cc_shlib' to build shared libraries" >&2;} if echo "$old_CC $old_CFLAGS " | grep "[ ]$lt_prog_cc_shlib[ ]" >/dev/null; then : else { echo "$as_me:$LINENO: WARNING: add \`$lt_prog_cc_shlib' to the CC or CFLAGS env variable and reconfigure" >&5 echo "$as_me: WARNING: add \`$lt_prog_cc_shlib' to the CC or CFLAGS env variable and reconfigure" >&2;} lt_cv_prog_cc_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # echo "$as_me:$LINENO: checking if $compiler static flag $lt_prog_compiler_static works" >&5 echo $ECHO_N "checking if $compiler static flag $lt_prog_compiler_static works... $ECHO_C" >&6 if test "${lt_prog_compiler_static_works+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_static_works=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_prog_compiler_static" printf "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The compiler 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 else lt_prog_compiler_static_works=yes fi fi $rm conftest* LDFLAGS="$save_LDFLAGS" fi echo "$as_me:$LINENO: result: $lt_prog_compiler_static_works" >&5 echo "${ECHO_T}$lt_prog_compiler_static_works" >&6 if test x"$lt_prog_compiler_static_works" = xyes; then : else lt_prog_compiler_static= fi lt_prog_compiler_no_builtin_flag= if test "$GCC" = yes; then lt_prog_compiler_no_builtin_flag=' -fno-builtin' echo "$as_me:$LINENO: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 echo $ECHO_N "checking if $compiler supports -fno-rtti -fno-exceptions... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_rtti_exceptions+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:5576: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:5580: \$? = $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 if test ! -s conftest.err; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 echo "${ECHO_T}$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= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 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*) # 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' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | pw32* | os2*) # 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' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; 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 ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; hpux*) # 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='-fPIC' ;; esac ;; *) lt_prog_compiler_pic='-fPIC' ;; 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* | pw32* | os2*) # 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' ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; linux*) case $CC in icc* | ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; esac ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; sco3.2v5*) lt_prog_compiler_pic='-Kpic' lt_prog_compiler_static='-dn' ;; solaris*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) 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 ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic" >&5 echo "${ECHO_T}$lt_prog_compiler_pic" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:5809: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:5813: \$? = $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 if test ! -s conftest.err; then lt_prog_compiler_pic_works=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works" >&6 if test x"$lt_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 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 echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:5869: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:5873: \$? = $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 if test ! -s out/conftest.err; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . $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 .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o" >&5 echo "${ECHO_T}$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 echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&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 echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 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 echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 runpath_var= allow_undefined_flag= enable_shared_with_static_runtimes=no archive_cmds= archive_expsym_cmds= old_archive_From_new_cmds= old_archive_from_expsyms_cmds= export_dynamic_flag_spec= whole_archive_flag_spec= thread_safe_flag_spec= hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld= hardcode_libdir_separator= hardcode_direct=no hardcode_minus_L=no hardcode_shlibpath_var=unsupported link_all_deplibs=unknown hardcode_automatic=no module_cmds= module_expsym_cmds= always_export_symbols=no export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' # 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_" # 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. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32*) # 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 ;; openbsd*) with_gnu_ld=no ;; esac ld_shlibs=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # See if GNU ld supports shared libraries. case $host_os in aix3* | aix4* | aix5*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs=no cat <&2 *** Warning: the GNU linker, at least up to release 2.9.1, 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 modify your PATH *** so that a non-GNU linker is found, and then restart. EOF fi ;; amigaos*) 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 # Samuel A. Falvo II reports # that the semantics of dynamic libraries on AmigaOS, at least up # to version 4, is to share data among multiple programs linked # with the same dynamic library. Since this doesn't match the # behavior of shared libraries on other platforms, we can't use # them. ld_shlibs=no ;; 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*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' 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 '\''/^[BCDGS] /s/.* \([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$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}--image-base=0x10000000 ${wl}--out-implib,$lib' else ld_shlibs=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $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' fi ;; solaris* | sysv5*) if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <&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. EOF elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then 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 ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; linux*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then tmp_archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_cmds="$tmp_archive_cmds" supports_anon_versioning=no case `$LD -v 2>/dev/null` in *\ 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 if test $supports_anon_versioning = yes; 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 -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' else archive_expsym_cmds="$tmp_archive_cmds" fi else ld_shlibs=no fi ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then 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 if test "$ld_shlibs" = yes; then 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 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 "$link_static_flag"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix4* | aix5*) 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 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")) && (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].*|aix5*) 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_libdir_separator=':' link_all_deplibs=yes 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 hardcode_direct=yes 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' 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 # 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. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${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 $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; 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' # -bexpall does not export symbols beginning with underscore (_) always_export_symbols=yes # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec=' ' archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds it's shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) 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 # see comment about different semantics on the GNU ld section ld_shlibs=no ;; bsdi4*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32*) # 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. 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 `echo "$deplibs" | $SED -e '\''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' fix_srcfile_path='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes=yes ;; darwin* | rhapsody*) if test "$GXX" = yes ; then archive_cmds_need_lc=no case "$host_os" in rhapsody* | darwin1.[012]) allow_undefined_flag='-undefined suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag='-flat_namespace -undefined suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag='-flat_namespace -undefined suppress' ;; 10.*) allow_undefined_flag='-undefined dynamic_lookup' ;; esac fi ;; esac lt_int_apple_cc_single_mod=no output_verbose_link_cmd='echo' if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then lt_int_apple_cc_single_mod=yes fi if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_cmds='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' else archive_cmds='$CC -r ${wl}-bind_at_load -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' fi module_cmds='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else archive_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -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~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' fi module_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported whole_archive_flag_spec='-all_load $convenience' link_all_deplibs=yes 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 ;; freebsd1*) ld_shlibs=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* | kfreebsd*-gnu) archive_cmds='$CC -shared -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 -fPIC ${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* | hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case "$host_cpu" in hppa*64*|ia64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case "$host_cpu" in hppa*64*|ia64*) archive_cmds='$LD -b +h $soname -o $lib $libobjs $deplibs $linker_flags' ;; *) archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' ;; esac fi if test "$with_gnu_ld" = no; then case "$host_cpu" in hppa*64*) hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_flag_spec_ld='+b $libdir' hardcode_libdir_separator=: hardcode_direct=no hardcode_shlibpath_var=no ;; ia64*) hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=no hardcode_shlibpath_var=no # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; *) hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=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 $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_ld='-rpath $libdir' fi hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: link_all_deplibs=yes ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; openbsd*) hardcode_direct=yes hardcode_shlibpath_var=no 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' 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 ;; 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" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' fi 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} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${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='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -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; echo "-hidden">> $lib.exp~ $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib~$rm $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi hardcode_libdir_separator=: ;; sco3.2v5*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='${wl}-Bexport' runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ;; solaris*) no_undefined_flag=' -z text' if test "$GCC" = yes; then archive_cmds='$CC -shared ${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 ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp' else 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' fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec='-z allextract$convenience -z defaultextract' ;; 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.2uw2*) archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=no hardcode_shlibpath_var=no hardcode_runpath_var=yes runpath_var=LD_RUN_PATH ;; sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[78]* | unixware7*) no_undefined_flag='${wl}-z ${wl}text' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' fi runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv5*) no_undefined_flag=' -z text' # $CC -shared without GNU ld will not create a library from C++ # object files and a static libstdc++, better avoid it by now 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' hardcode_libdir_flag_spec= hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' ;; 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 fi echo "$as_me:$LINENO: result: $ld_shlibs" >&5 echo "${ECHO_T}$ld_shlibs" >&6 test "$ld_shlibs" = 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 # # 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. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl 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:$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=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc=no else archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $rm conftest* echo "$as_me:$LINENO: result: $archive_cmds_need_lc" >&5 echo "${ECHO_T}$archive_cmds_need_lc" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&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" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # 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. 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 else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi 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 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' ;; aix4* | aix5*) version_type=linux 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*) 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=`$echo "X$lib" | $Xsed -e '\''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' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi4*) version_type=linux 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*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) 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' 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="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. 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 ;; 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 ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # 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}${versuffix}$shared_ext ${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)' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) 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 ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-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='GNU ld.so' ;; freebsd*) objformat=`test -x /usr/bin/objformat && /usr/bin/objformat || echo aout` 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 ;; *) # from 3.2 on shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; esac ;; 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 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' ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux 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 Linux ELF. linux*) 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' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # 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 # find out which ABI we are using libsuff= case "$host_cpu" in x86_64*|s390x*|powerpc64*) echo '#line 7203 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case `/usr/bin/file conftest.$ac_objext` in *64-bit*) libsuff=64 sys_lib_search_path_spec="/lib${libsuff} /usr/lib${libsuff} /usr/local/lib${libsuff}" ;; esac fi rm -rf conftest* ;; esac # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`$SED -e 's/:,\t/ /g;s/=^=*$//;s/=^= * / /g' /etc/ld.so.conf | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib${libsuff} /usr/lib${libsuff} $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' ;; knetbsd*-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='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux 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=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=yes ;; openbsd*) version_type=sunos need_lib_prefix=no need_version=yes 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" ;; sco3.2v5*) version_type=osf 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 ;; solaris*) 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=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.2uw2* | sysv4.3* | sysv5*) version_type=linux 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 export_dynamic_flag_spec='${wl}-Blargedynsym' 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 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 ;; uts4*) version_type=linux 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 echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&6 hardcode_action= if test -n "$hardcode_libdir_flag_spec" || \ test -n "$runpath_var " || \ test "X$hardcode_automatic"="Xyes" ; then # We can hardcode non-existant 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_AC_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 echo "$as_me:$LINENO: result: $hardcode_action" >&5 echo "${ECHO_T}$hardcode_action" >&6 if test "$hardcode_action" = relink; 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 striplib= old_striplib= echo "$as_me:$LINENO: checking whether stripping libraries is possible" >&5 echo $ECHO_N "checking whether stripping libraries is possible... $ECHO_C" >&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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi ;; *) echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 ;; esac 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*) 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 echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; 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 ;; *) echo "$as_me:$LINENO: checking for shl_load" >&5 echo $ECHO_N "checking for shl_load... $ECHO_C" >&6 if test "${ac_cv_func_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define shl_load to an innocuous variant, in case declares shl_load. For example, HP-UX 11i declares gettimeofday. */ #define shl_load innocuous_shl_load /* System header to define __stub macros and hopefully few prototypes, which can conflict with char shl_load (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef shl_load /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); /* 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_shl_load) || defined (__stub___shl_load) choke me #else char (*f) () = shl_load; #endif #ifdef __cplusplus } #endif int main () { return f != shl_load; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_shl_load" >&5 echo "${ECHO_T}$ac_cv_func_shl_load" >&6 if test $ac_cv_func_shl_load = yes; then lt_cv_dlopen="shl_load" else echo "$as_me:$LINENO: checking for shl_load in -ldld" >&5 echo $ECHO_N "checking for shl_load in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); int main () { shl_load (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_shl_load" >&5 echo "${ECHO_T}$ac_cv_lib_dld_shl_load" >&6 if test $ac_cv_lib_dld_shl_load = yes; then lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-dld" else echo "$as_me:$LINENO: checking for dlopen" >&5 echo $ECHO_N "checking for dlopen... $ECHO_C" >&6 if test "${ac_cv_func_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define dlopen to an innocuous variant, in case declares dlopen. For example, HP-UX 11i declares gettimeofday. */ #define dlopen innocuous_dlopen /* System header to define __stub macros and hopefully few prototypes, which can conflict with char dlopen (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef dlopen /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); /* 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_dlopen) || defined (__stub___dlopen) choke me #else char (*f) () = dlopen; #endif #ifdef __cplusplus } #endif int main () { return f != dlopen; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_dlopen" >&5 echo "${ECHO_T}$ac_cv_func_dlopen" >&6 if test $ac_cv_func_dlopen = yes; then lt_cv_dlopen="dlopen" else echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else echo "$as_me:$LINENO: checking for dlopen in -lsvld" >&5 echo $ECHO_N "checking for dlopen in -lsvld... $ECHO_C" >&6 if test "${ac_cv_lib_svld_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_svld_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_svld_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_svld_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_svld_dlopen" >&6 if test $ac_cv_lib_svld_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else echo "$as_me:$LINENO: checking for dld_link in -ldld" >&5 echo $ECHO_N "checking for dld_link in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_dld_link+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dld_link (); int main () { dld_link (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_dld_link=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_dld_link=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_dld_link" >&5 echo "${ECHO_T}$ac_cv_lib_dld_dld_link" >&6 if test $ac_cv_lib_dld_dld_link = yes; then lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-dld" 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" eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" echo "$as_me:$LINENO: checking whether a program can dlopen itself" >&5 echo $ECHO_N "checking whether a program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 < #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 #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=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; /* dlclose (self); */ } exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) 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_unknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self" >&5 echo "${ECHO_T}$lt_cv_dlopen_self" >&6 if test "x$lt_cv_dlopen_self" = xyes; then LDFLAGS="$LDFLAGS $link_static_flag" echo "$as_me:$LINENO: checking whether a statically linked program can dlopen itself" >&5 echo $ECHO_N "checking whether a statically linked program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self_static+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 < #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 #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=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; /* dlclose (self); */ } exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) 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_unknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self_static" >&5 echo "${ECHO_T}$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 # Report which librarie types wil actually be built echo "$as_me:$LINENO: checking if libtool supports shared libraries" >&5 echo $ECHO_N "checking if libtool supports shared libraries... $ECHO_C" >&6 echo "$as_me:$LINENO: result: $can_build_shared" >&5 echo "${ECHO_T}$can_build_shared" >&6 echo "$as_me:$LINENO: checking whether to build shared libraries" >&5 echo $ECHO_N "checking whether to build shared libraries... $ECHO_C" >&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 ;; aix4* | aix5*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; darwin* | rhapsody*) if test "$GCC" = yes; then archive_cmds_need_lc=no case "$host_os" in rhapsody* | darwin1.[012]) allow_undefined_flag='-undefined suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag='-flat_namespace -undefined suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag='-flat_namespace -undefined suppress' ;; 10.*) allow_undefined_flag='-undefined dynamic_lookup' ;; esac fi ;; esac output_verbose_link_cmd='echo' archive_cmds='$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs$compiler_flags -install_name $rpath/$soname $verstring' module_cmds='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's archive_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs$compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported whole_archive_flag_spec='-all_load $convenience' link_all_deplibs=yes else ld_shlibs=no fi ;; esac echo "$as_me:$LINENO: result: $enable_shared" >&5 echo "${ECHO_T}$enable_shared" >&6 echo "$as_me:$LINENO: checking whether to build static libraries" >&5 echo $ECHO_N "checking whether to build static libraries... $ECHO_C" >&6 # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes echo "$as_me:$LINENO: result: $enable_static" >&5 echo "${ECHO_T}$enable_static" >&6 # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # 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 # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler \ CC \ LD \ lt_prog_compiler_wl \ lt_prog_compiler_pic \ lt_prog_compiler_static \ lt_prog_compiler_no_builtin_flag \ export_dynamic_flag_spec \ thread_safe_flag_spec \ whole_archive_flag_spec \ enable_shared_with_static_runtimes \ old_archive_cmds \ old_archive_from_new_cmds \ predep_objects \ postdep_objects \ predeps \ postdeps \ compiler_lib_search_path \ archive_cmds \ archive_expsym_cmds \ postinstall_cmds \ postuninstall_cmds \ old_archive_from_expsyms_cmds \ allow_undefined_flag \ no_undefined_flag \ export_symbols_cmds \ hardcode_libdir_flag_spec \ hardcode_libdir_flag_spec_ld \ hardcode_libdir_separator \ hardcode_automatic \ module_cmds \ module_expsym_cmds \ lt_cv_prog_compiler_c_o \ exclude_expsyms \ include_expsyms; do case $var in old_archive_cmds | \ old_archive_from_new_cmds | \ archive_cmds | \ archive_expsym_cmds | \ module_cmds | \ module_expsym_cmds | \ old_archive_from_expsyms_cmds | \ export_symbols_cmds | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="${ofile}T" trap "$rm \"$cfgfile\"; exit 1" 1 2 15 $rm -f "$cfgfile" { echo "$as_me:$LINENO: creating $ofile" >&5 echo "$as_me: creating $ofile" >&6;} cat <<__EOF__ >> "$cfgfile" #! $SHELL # `$echo "$cfgfile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $PROGRAM (GNU $PACKAGE $VERSION$TIMESTAMP) # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001 # Free Software Foundation, Inc. # # This file is part of GNU Libtool: # Originally by Gordon Matzigkeit , 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 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, write to the Free Software # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. # # 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. # 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 s/^X//" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. if test "X\${CDPATH+set}" = Xset; then CDPATH=:; export CDPATH; fi # The names of the tagged configurations supported by this script. available_tags= # ### BEGIN LIBTOOL CONFIG # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # 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 # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # A language-specific compiler. CC=$lt_compiler # Is the compiler the GNU C compiler? with_gcc=$GCC # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Must we lock files when doing compilation ? need_locks=$lt_need_locks # 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 # 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 # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # 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 # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec # Library versioning type. version_type=$version_type # 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 # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # 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 and install a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps # Dependencies to place after the objects being linked to create a # shared library. 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 # 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 # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # 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 # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # 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 # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld # 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 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 # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # 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 # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path" # 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 # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_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 # ### END LIBTOOL CONFIG __EOF__ case $host_os in aix3*) cat <<\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 EOF ;; esac # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || \ (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" 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 CC="$lt_save_CC" # Check whether --with-tags or --without-tags was given. if test "${with_tags+set}" = set; then withval="$with_tags" tagnames="$withval" fi; if test -f "$ltmain" && test -n "$tagnames"; then if test ! -f "${ofile}"; then { echo "$as_me:$LINENO: WARNING: output file \`$ofile' does not exist" >&5 echo "$as_me: WARNING: output file \`$ofile' does not exist" >&2;} fi if test -z "$LTCC"; then eval "`$SHELL ${ofile} --config | grep '^LTCC='`" if test -z "$LTCC"; then { echo "$as_me:$LINENO: WARNING: output file \`$ofile' does not look like a libtool script" >&5 echo "$as_me: WARNING: output file \`$ofile' does not look like a libtool script" >&2;} else { echo "$as_me:$LINENO: WARNING: using \`LTCC=$LTCC', extracted from \`$ofile'" >&5 echo "$as_me: WARNING: using \`LTCC=$LTCC', extracted from \`$ofile'" >&2;} fi fi # Extract list of available tagged configurations in $ofile. # Note that this assumes the entire list is on one line. available_tags=`grep "^available_tags=" "${ofile}" | $SED -e 's/available_tags=\(.*$\)/\1/' -e 's/\"//g'` lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for tagname in $tagnames; do IFS="$lt_save_ifs" # Check whether tagname contains only valid characters case `$echo "X$tagname" | $Xsed -e 's:[-_ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890,/]::g'` in "") ;; *) { { echo "$as_me:$LINENO: error: invalid tag name: $tagname" >&5 echo "$as_me: error: invalid tag name: $tagname" >&2;} { (exit 1); exit 1; }; } ;; esac if grep "^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$" < "${ofile}" > /dev/null then { { echo "$as_me:$LINENO: error: tag name \"$tagname\" already exists" >&5 echo "$as_me: error: tag name \"$tagname\" already exists" >&2;} { (exit 1); exit 1; }; } fi # Update the list of available tags. if test -n "$tagname"; then echo appending configuration tag \"$tagname\" to $ofile case $tagname in CXX) if test -n "$CXX" && test "X$CXX" != "Xno"; then ac_ext=cc 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= export_dynamic_flag_spec_CXX= hardcode_direct_CXX=no hardcode_libdir_flag_spec_CXX= hardcode_libdir_flag_spec_ld_CXX= hardcode_libdir_separator_CXX= hardcode_minus_L_CXX=no hardcode_automatic_CXX=no module_cmds_CXX= module_expsym_cmds_CXX= link_all_deplibs_CXX=unknown old_archive_cmds_CXX=$old_archive_cmds no_undefined_flag_CXX= whole_archive_flag_spec_CXX= enable_shared_with_static_runtimes_CXX=no # 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= # Source file extension for C++ test sources. ac_ext=cc # Object file extension for compiled C++ test sources. objext=o objext_CXX=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;\n" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *) { return(0); }\n' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # Allow CC to be a program name with arguments. compiler=$CC # Allow CC to be a program name with arguments. lt_save_CC=$CC 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 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 unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} compiler=$CC compiler_CXX=$CC cc_basename=`$echo X"$compiler" | $Xsed -e 's%^.*/%%'` # We don't want -fno-exception wen 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 or --without-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. echo "$as_me:$LINENO: checking for ld used by $CC" >&5 echo $ECHO_N "checking for ld used by $CC... $ECHO_C" >&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 echo "$as_me:$LINENO: checking for GNU ld" >&5 echo $ECHO_N "checking for GNU ld... $ECHO_C" >&6 else echo "$as_me:$LINENO: checking for non-GNU ld" >&5 echo $ECHO_N "checking for non-GNU ld... $ECHO_C" >&6 fi if test "${lt_cv_path_LD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 GNU ld's 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 echo "${ECHO_T}$LD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -z "$LD" && { { echo "$as_me:$LINENO: error: no acceptable ld found in \$PATH" >&5 echo "$as_me: error: no acceptable ld found in \$PATH" >&2;} { (exit 1); exit 1; }; } echo "$as_me:$LINENO: checking if the linker ($LD) is GNU ld" >&5 echo $ECHO_N "checking if the linker ($LD) is GNU ld... $ECHO_C" >&6 if test "${lt_cv_prog_gnu_ld+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # I'd rather use --version here, but apparently some GNU ld's only accept -v. case `$LD -v 2>&1 &5 echo "${ECHO_T}$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 -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -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 "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 ld_shlibs_CXX=yes case $host_os in aix3*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aix4* | aix5*) 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].*|aix5*) 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_libdir_separator_CXX=':' link_all_deplibs_CXX=yes 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 hardcode_direct_CXX=yes 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' 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 # 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. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_CXX="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${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 $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; 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' # -bexpall does not export symbols beginning with underscore (_) always_export_symbols_CXX=yes # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_CXX=' ' archive_cmds_need_lc_CXX=yes # This is similar to how AIX traditionally builds it's shared libraries. archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; cygwin* | mingw* | pw32*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_CXX='-L$libdir' 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}--image-base=0x10000000 ${wl}--out-implib,$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}--image-base=0x10000000 ${wl}--out-implib,$lib' else ld_shlibs_CXX=no fi ;; darwin* | rhapsody*) if test "$GXX" = yes; then archive_cmds_need_lc_CXX=no case "$host_os" in rhapsody* | darwin1.[012]) allow_undefined_flag_CXX='-undefined suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag_CXX='-flat_namespace -undefined suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag_CXX='-flat_namespace -undefined suppress' ;; 10.*) allow_undefined_flag_CXX='-undefined dynamic_lookup' ;; esac fi ;; esac lt_int_apple_cc_single_mod=no output_verbose_link_cmd='echo' if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then lt_int_apple_cc_single_mod=yes fi if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_cmds_CXX='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' else archive_cmds_CXX='$CC -r ${wl}-bind_at_load -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' fi module_cmds_CXX='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else archive_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -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~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' fi module_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' hardcode_direct_CXX=no hardcode_automatic_CXX=yes hardcode_shlibpath_var_CXX=unsupported whole_archive_flag_spec_CXX='-all_load $convenience' link_all_deplibs_CXX=yes 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 ;; freebsd12*) # 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* | kfreebsd*-gnu) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions ld_shlibs_CXX=yes ;; gnu*) ;; 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) | grep "-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' ;; *) if test "$GXX" = yes; then archive_cmds_CXX='$rm $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${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 case "$host_cpu" in hppa*64*) hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_flag_spec_ld_CXX='+b $libdir' hardcode_libdir_separator_CXX=: ;; ia64*) hardcode_libdir_flag_spec_CXX='-L$libdir' ;; *) hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: export_dynamic_flag_spec_CXX='${wl}-E' ;; esac fi case "$host_cpu" in hppa*64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no ;; ia64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. ;; *) hardcode_direct_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*|ia64*) archive_cmds_CXX='$LD -b +h $soname -o $lib $linker_flags $libobjs $deplibs' ;; *) 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; echo $list' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case "$host_cpu" in ia64*|hppa*64*) archive_cmds_CXX='$LD -b +h $soname -o $lib $linker_flags $libobjs $deplibs' ;; *) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${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 ;; 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" && echo -set_version $verstring` -update_registry ${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 -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib' else archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${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=: ;; linux*) 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; echo $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) # Intel C++ with_gnu_ld=yes archive_cmds_need_lc_CXX=no 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' 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' ;; 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=`echo $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; echo $list' ;; 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::"' ;; osf3*) 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 # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; RCC) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx) 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" && echo ${wl}-set_version $verstring` -update_registry ${objdir}/so_locations -o $lib' 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. # # 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=`echo $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; echo $list' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib' 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 "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; 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. old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;; RCC) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx) 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" && echo -set_version $verstring` -update_registry ${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 $objdir/so_locations -o $lib~ $rm $lib.exp' 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" | grep -v "ld:"`; templist=`echo $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; echo $list' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib' 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 "\-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 ;; sco*) archive_cmds_need_lc_CXX=no case $cc_basename in CC) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; 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) # Sun C++ 4.2, 5.x and Centerline C++ no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -nolib -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} -nolib ${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 C++ compiler is used as linker so we must use $wl # flag to pass the commands to the underlying system # linker. # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac link_all_deplibs_CXX=yes # 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 -G $CFLAGS -v conftest.$objext 2>&1 | grep "\-[LR]"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' # 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 -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 -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 \"\-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 \"\-L\"" fi hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir' fi ;; esac ;; sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[78]* | unixware7*) archive_cmds_need_lc_CXX=no ;; 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 echo "$as_me:$LINENO: result: $ld_shlibs_CXX" >&5 echo "${ECHO_T}$ld_shlibs_CXX" >&6 test "$ld_shlibs_CXX" = no && can_build_shared=no GCC_CXX="$GXX" LD_CXX="$LD" cat > conftest.$ac_ext <&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; 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 # The `*' in the case matches for architectures that use `case' in # $output_verbose_cmd can trigger glob expansion during the loop # eval without this substitution. output_verbose_link_cmd="`$echo \"X$output_verbose_link_cmd\" | $Xsed -e \"$no_glob_subst\"`" for p in `eval $output_verbose_link_cmd`; do case $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 else prev= fi if test "$pre_test_object_deps_done" = no; then case $p 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 ;; *.$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 case " $postdeps_CXX " in *" -lc "*) archive_cmds_need_lc_CXX=no ;; esac lt_prog_compiler_wl_CXX= lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 # 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*) # 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' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | os2* | pw32*) # 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' ;; 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= ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_CXX=-Kconform_pic fi ;; hpux*) # 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*) ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac else case $host_os in aix4* | aix5*) # 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_AC_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 ;; 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* | kfreebsd*-gnu) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX="${ac_cv_prog_cc_wl}-a ${ac_cv_prog_cc_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="${ac_cv_prog_cc_wl}-a ${ac_cv_prog_cc_wl}archive" case "$host_cpu" in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_CXX='+Z' ;; esac ;; *) ;; esac ;; 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*) case $cc_basename in KCC) # KAI C++ Compiler lt_prog_compiler_wl_CXX='--backend -Wl,' lt_prog_compiler_pic_CXX='-fPIC' ;; icpc) # Intel C++ lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-static' ;; 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' ;; *) ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx) lt_prog_compiler_pic_CXX='-W c,exportall' ;; *) ;; esac ;; netbsd*) ;; 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*) ;; sco*) case $cc_basename in CC) lt_prog_compiler_pic_CXX='-fPIC' ;; *) ;; esac ;; solaris*) case $cc_basename in CC) # 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 ;; tandem*) case $cc_basename in NCC) # NonStop-UX NCC 3.20 lt_prog_compiler_pic_CXX='-KPIC' ;; *) ;; esac ;; unixware*) ;; vxworks*) ;; *) lt_prog_compiler_can_build_shared_CXX=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_CXX" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_CXX" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_CXX"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works_CXX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works_CXX=no ac_outfile=conftest.$ac_objext printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:10351: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:10355: \$? = $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 if test ! -s conftest.err; then lt_prog_compiler_pic_works_CXX=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works_CXX" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works_CXX" >&6 if test x"$lt_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 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 echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o_CXX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o_CXX=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:10411: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:10415: \$? = $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 if test ! -s out/conftest.err; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . $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 .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o_CXX" >&5 echo "${ECHO_T}$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 echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&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 echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 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 echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' case $host_os in aix4* | aix5*) # 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 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")) && (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*) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGS] /s/.* \([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac echo "$as_me:$LINENO: result: $ld_shlibs_CXX" >&5 echo "${ECHO_T}$ld_shlibs_CXX" >&6 test "$ld_shlibs_CXX" = 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 # # 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. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_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:$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=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc_CXX=no else 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* echo "$as_me:$LINENO: result: $archive_cmds_need_lc_CXX" >&5 echo "${ECHO_T}$archive_cmds_need_lc_CXX" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&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" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # 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. 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 else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi 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 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' ;; aix4* | aix5*) version_type=linux 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*) 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=`$echo "X$lib" | $Xsed -e '\''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' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi4*) version_type=linux 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*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) 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' 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="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. 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 ;; 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 ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # 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}${versuffix}$shared_ext ${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)' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) 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 ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-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='GNU ld.so' ;; freebsd*) objformat=`test -x /usr/bin/objformat && /usr/bin/objformat || echo aout` 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 ;; *) # from 3.2 on shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; esac ;; 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 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' ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux 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 Linux ELF. linux*) 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' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # 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 # find out which ABI we are using libsuff= case "$host_cpu" in x86_64*|s390x*|powerpc64*) echo '#line 10922 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case `/usr/bin/file conftest.$ac_objext` in *64-bit*) libsuff=64 sys_lib_search_path_spec="/lib${libsuff} /usr/lib${libsuff} /usr/local/lib${libsuff}" ;; esac fi rm -rf conftest* ;; esac # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`$SED -e 's/:,\t/ /g;s/=^=*$//;s/=^= * / /g' /etc/ld.so.conf | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib${libsuff} /usr/lib${libsuff} $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' ;; knetbsd*-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='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux 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=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=yes ;; openbsd*) version_type=sunos need_lib_prefix=no need_version=yes 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" ;; sco3.2v5*) version_type=osf 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 ;; solaris*) 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=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.2uw2* | sysv4.3* | sysv5*) version_type=linux 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 export_dynamic_flag_spec='${wl}-Blargedynsym' 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 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 ;; uts4*) version_type=linux 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 echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&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-existant 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_AC_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 echo "$as_me:$LINENO: result: $hardcode_action_CXX" >&5 echo "${ECHO_T}$hardcode_action_CXX" >&6 if test "$hardcode_action_CXX" = relink; 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 striplib= old_striplib= echo "$as_me:$LINENO: checking whether stripping libraries is possible" >&5 echo $ECHO_N "checking whether stripping libraries is possible... $ECHO_C" >&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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi ;; *) echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 ;; esac 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*) 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 echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; 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 ;; *) echo "$as_me:$LINENO: checking for shl_load" >&5 echo $ECHO_N "checking for shl_load... $ECHO_C" >&6 if test "${ac_cv_func_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define shl_load to an innocuous variant, in case declares shl_load. For example, HP-UX 11i declares gettimeofday. */ #define shl_load innocuous_shl_load /* System header to define __stub macros and hopefully few prototypes, which can conflict with char shl_load (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef shl_load /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); /* 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_shl_load) || defined (__stub___shl_load) choke me #else char (*f) () = shl_load; #endif #ifdef __cplusplus } #endif int main () { return f != shl_load; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_shl_load" >&5 echo "${ECHO_T}$ac_cv_func_shl_load" >&6 if test $ac_cv_func_shl_load = yes; then lt_cv_dlopen="shl_load" else echo "$as_me:$LINENO: checking for shl_load in -ldld" >&5 echo $ECHO_N "checking for shl_load in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); int main () { shl_load (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_shl_load" >&5 echo "${ECHO_T}$ac_cv_lib_dld_shl_load" >&6 if test $ac_cv_lib_dld_shl_load = yes; then lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-dld" else echo "$as_me:$LINENO: checking for dlopen" >&5 echo $ECHO_N "checking for dlopen... $ECHO_C" >&6 if test "${ac_cv_func_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define dlopen to an innocuous variant, in case declares dlopen. For example, HP-UX 11i declares gettimeofday. */ #define dlopen innocuous_dlopen /* System header to define __stub macros and hopefully few prototypes, which can conflict with char dlopen (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef dlopen /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); /* 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_dlopen) || defined (__stub___dlopen) choke me #else char (*f) () = dlopen; #endif #ifdef __cplusplus } #endif int main () { return f != dlopen; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_dlopen" >&5 echo "${ECHO_T}$ac_cv_func_dlopen" >&6 if test $ac_cv_func_dlopen = yes; then lt_cv_dlopen="dlopen" else echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else echo "$as_me:$LINENO: checking for dlopen in -lsvld" >&5 echo $ECHO_N "checking for dlopen in -lsvld... $ECHO_C" >&6 if test "${ac_cv_lib_svld_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_svld_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_svld_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_svld_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_svld_dlopen" >&6 if test $ac_cv_lib_svld_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else echo "$as_me:$LINENO: checking for dld_link in -ldld" >&5 echo $ECHO_N "checking for dld_link in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_dld_link+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dld_link (); int main () { dld_link (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_dld_link=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_dld_link=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_dld_link" >&5 echo "${ECHO_T}$ac_cv_lib_dld_dld_link" >&6 if test $ac_cv_lib_dld_dld_link = yes; then lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-dld" 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" eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" echo "$as_me:$LINENO: checking whether a program can dlopen itself" >&5 echo $ECHO_N "checking whether a program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 < #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 #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=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; /* dlclose (self); */ } exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) 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_unknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self" >&5 echo "${ECHO_T}$lt_cv_dlopen_self" >&6 if test "x$lt_cv_dlopen_self" = xyes; then LDFLAGS="$LDFLAGS $link_static_flag" echo "$as_me:$LINENO: checking whether a statically linked program can dlopen itself" >&5 echo $ECHO_N "checking whether a statically linked program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self_static+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 < #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 #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=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; /* dlclose (self); */ } exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) 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_unknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self_static" >&5 echo "${ECHO_T}$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 # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # 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 # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_CXX \ CC_CXX \ LD_CXX \ lt_prog_compiler_wl_CXX \ lt_prog_compiler_pic_CXX \ lt_prog_compiler_static_CXX \ lt_prog_compiler_no_builtin_flag_CXX \ export_dynamic_flag_spec_CXX \ thread_safe_flag_spec_CXX \ whole_archive_flag_spec_CXX \ enable_shared_with_static_runtimes_CXX \ old_archive_cmds_CXX \ old_archive_from_new_cmds_CXX \ predep_objects_CXX \ postdep_objects_CXX \ predeps_CXX \ postdeps_CXX \ compiler_lib_search_path_CXX \ archive_cmds_CXX \ archive_expsym_cmds_CXX \ postinstall_cmds_CXX \ postuninstall_cmds_CXX \ old_archive_from_expsyms_cmds_CXX \ allow_undefined_flag_CXX \ no_undefined_flag_CXX \ export_symbols_cmds_CXX \ hardcode_libdir_flag_spec_CXX \ hardcode_libdir_flag_spec_ld_CXX \ hardcode_libdir_separator_CXX \ hardcode_automatic_CXX \ module_cmds_CXX \ module_expsym_cmds_CXX \ lt_cv_prog_compiler_c_o_CXX \ exclude_expsyms_CXX \ include_expsyms_CXX; do case $var in old_archive_cmds_CXX | \ old_archive_from_new_cmds_CXX | \ archive_cmds_CXX | \ archive_expsym_cmds_CXX | \ module_cmds_CXX | \ module_expsym_cmds_CXX | \ old_archive_from_expsyms_cmds_CXX | \ export_symbols_cmds_CXX | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # 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 # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # A language-specific compiler. CC=$lt_compiler_CXX # Is the compiler the GNU C compiler? with_gcc=$GCC_CXX # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_CXX # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_CXX # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_CXX pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX # Must we lock files when doing compilation ? need_locks=$lt_need_locks # 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 # 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 # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_CXX # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_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 # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_CXX # Library versioning type. version_type=$version_type # 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 # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_CXX old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # 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 and install a shared archive. archive_cmds=$lt_archive_cmds_CXX archive_expsym_cmds=$lt_archive_expsym_cmds_CXX postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_CXX module_expsym_cmds=$lt_module_expsym_cmds_CXX # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_CXX # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_CXX # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_CXX # Dependencies to place after the objects being linked to create a # shared library. 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 # 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 # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_CXX # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_CXX # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # 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 # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_CXX # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # 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 # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_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 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 # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_CXX # 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 # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_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 # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # 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 # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" 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 CC=$lt_save_CC LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ldcxx=$with_gnu_ld 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 else tagname="" fi ;; F77) if test -n "$F77" && test "X$F77" != "Xno"; then ac_ext=f ac_compile='$F77 -c $FFLAGS conftest.$ac_ext >&5' ac_link='$F77 -o conftest$ac_exeext $FFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_f77_compiler_gnu archive_cmds_need_lc_F77=no allow_undefined_flag_F77= always_export_symbols_F77=no archive_expsym_cmds_F77= export_dynamic_flag_spec_F77= hardcode_direct_F77=no hardcode_libdir_flag_spec_F77= hardcode_libdir_flag_spec_ld_F77= hardcode_libdir_separator_F77= hardcode_minus_L_F77=no hardcode_automatic_F77=no module_cmds_F77= module_expsym_cmds_F77= link_all_deplibs_F77=unknown old_archive_cmds_F77=$old_archive_cmds no_undefined_flag_F77= whole_archive_flag_spec_F77= enable_shared_with_static_runtimes_F77=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o objext_F77=$objext # Code to be used in simple compile tests lt_simple_compile_test_code=" subroutine t\n return\n end\n" # Code to be used in simple link tests lt_simple_link_test_code=" program t\n end\n" # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # Allow CC to be a program name with arguments. compiler=$CC # Allow CC to be a program name with arguments. lt_save_CC="$CC" CC=${F77-"f77"} compiler=$CC compiler_F77=$CC cc_basename=`$echo X"$compiler" | $Xsed -e 's%^.*/%%'` echo "$as_me:$LINENO: checking if libtool supports shared libraries" >&5 echo $ECHO_N "checking if libtool supports shared libraries... $ECHO_C" >&6 echo "$as_me:$LINENO: result: $can_build_shared" >&5 echo "${ECHO_T}$can_build_shared" >&6 echo "$as_me:$LINENO: checking whether to build shared libraries" >&5 echo $ECHO_N "checking whether to build shared libraries... $ECHO_C" >&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 ;; aix4* | aix5*) test "$enable_shared" = yes && enable_static=no ;; esac echo "$as_me:$LINENO: result: $enable_shared" >&5 echo "${ECHO_T}$enable_shared" >&6 echo "$as_me:$LINENO: checking whether to build static libraries" >&5 echo $ECHO_N "checking whether to build static libraries... $ECHO_C" >&6 # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes echo "$as_me:$LINENO: result: $enable_static" >&5 echo "${ECHO_T}$enable_static" >&6 test "$ld_shlibs_F77" = no && can_build_shared=no GCC_F77="$G77" LD_F77="$LD" lt_prog_compiler_wl_F77= lt_prog_compiler_pic_F77= lt_prog_compiler_static_F77= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 if test "$GCC" = yes; then lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_static_F77='-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_F77='-Bstatic' fi ;; amigaos*) # 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_F77='-m68020 -resident32 -malways-restore-a4' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | pw32* | os2*) # 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_F77='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_F77='-fno-common' ;; 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_F77=no enable_shared=no ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_F77=-Kconform_pic fi ;; hpux*) # 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_F77='-fPIC' ;; esac ;; *) lt_prog_compiler_pic_F77='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl_F77='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_F77='-Bstatic' else lt_prog_compiler_static_F77='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | pw32* | os2*) # 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_F77='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl_F77='-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_F77='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static_F77='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl_F77='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static_F77='-non_shared' ;; newsos6) lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-Bstatic' ;; linux*) case $CC in icc* | ecc*) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-static' ;; ccc*) lt_prog_compiler_wl_F77='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static_F77='-non_shared' ;; esac ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl_F77='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static_F77='-non_shared' ;; sco3.2v5*) lt_prog_compiler_pic_F77='-Kpic' lt_prog_compiler_static_F77='-dn' ;; solaris*) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-Bstatic' ;; sunos4*) lt_prog_compiler_wl_F77='-Qoption ld ' lt_prog_compiler_pic_F77='-PIC' lt_prog_compiler_static_F77='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic_F77='-Kconform_pic' lt_prog_compiler_static_F77='-Bstatic' fi ;; uts4*) lt_prog_compiler_pic_F77='-pic' lt_prog_compiler_static_F77='-Bstatic' ;; *) lt_prog_compiler_can_build_shared_F77=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_F77" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_F77" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_F77"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic_F77 works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic_F77 works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works_F77+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works_F77=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_F77" # 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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:12718: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:12722: \$? = $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 if test ! -s conftest.err; then lt_prog_compiler_pic_works_F77=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works_F77" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works_F77" >&6 if test x"$lt_prog_compiler_pic_works_F77" = xyes; then case $lt_prog_compiler_pic_F77 in "" | " "*) ;; *) lt_prog_compiler_pic_F77=" $lt_prog_compiler_pic_F77" ;; esac else lt_prog_compiler_pic_F77= lt_prog_compiler_can_build_shared_F77=no fi fi case "$host_os" in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_F77= ;; *) lt_prog_compiler_pic_F77="$lt_prog_compiler_pic_F77" ;; esac echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o_F77+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o_F77=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:12778: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:12782: \$? = $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 if test ! -s out/conftest.err; then lt_cv_prog_compiler_c_o_F77=yes fi fi chmod u+w . $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 .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o_F77" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_c_o_F77" >&6 hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_F77" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&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 echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 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 echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 runpath_var= allow_undefined_flag_F77= enable_shared_with_static_runtimes_F77=no archive_cmds_F77= archive_expsym_cmds_F77= old_archive_From_new_cmds_F77= old_archive_from_expsyms_cmds_F77= export_dynamic_flag_spec_F77= whole_archive_flag_spec_F77= thread_safe_flag_spec_F77= hardcode_libdir_flag_spec_F77= hardcode_libdir_flag_spec_ld_F77= hardcode_libdir_separator_F77= hardcode_direct_F77=no hardcode_minus_L_F77=no hardcode_shlibpath_var_F77=unsupported link_all_deplibs_F77=unknown hardcode_automatic_F77=no module_cmds_F77= module_expsym_cmds_F77= always_export_symbols_F77=no export_symbols_cmds_F77='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms_F77= # 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_F77="_GLOBAL_OFFSET_TABLE_" # 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. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32*) # 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 ;; openbsd*) with_gnu_ld=no ;; esac ld_shlibs_F77=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # See if GNU ld supports shared libraries. case $host_os in aix3* | aix4* | aix5*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs_F77=no cat <&2 *** Warning: the GNU linker, at least up to release 2.9.1, 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 modify your PATH *** so that a non-GNU linker is found, and then restart. EOF fi ;; amigaos*) archive_cmds_F77='$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_F77='-L$libdir' hardcode_minus_L_F77=yes # Samuel A. Falvo II reports # that the semantics of dynamic libraries on AmigaOS, at least up # to version 4, is to share data among multiple programs linked # with the same dynamic library. Since this doesn't match the # behavior of shared libraries on other platforms, we can't use # them. ld_shlibs_F77=no ;; beos*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_F77=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_F77='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_F77=no fi ;; cygwin* | mingw* | pw32*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, F77) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_F77='-L$libdir' allow_undefined_flag_F77=unsupported always_export_symbols_F77=no enable_shared_with_static_runtimes_F77=yes export_symbols_cmds_F77='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGS] /s/.* \([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_F77='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}--image-base=0x10000000 ${wl}--out-implib,$lib' else ld_shlibs=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_F77='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris* | sysv5*) if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then ld_shlibs_F77=no cat <&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. EOF elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_F77=no fi ;; sunos4*) archive_cmds_F77='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; linux*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then tmp_archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_cmds_F77="$tmp_archive_cmds" supports_anon_versioning=no case `$LD -v 2>/dev/null` in *\ 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 if test $supports_anon_versioning = yes; then archive_expsym_cmds_F77='$echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ $echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' else archive_expsym_cmds_F77="$tmp_archive_cmds" fi else ld_shlibs_F77=no fi ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_F77=no fi ;; esac if test "$ld_shlibs_F77" = yes; then runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_F77='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_F77='${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_F77="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_F77= fi fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag_F77=unsupported always_export_symbols_F77=yes archive_expsym_cmds_F77='$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_F77=yes if test "$GCC" = yes && test -z "$link_static_flag"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct_F77=unsupported fi ;; aix4* | aix5*) 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 if $NM -V 2>&1 | grep 'GNU' > /dev/null; then export_symbols_cmds_F77='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_F77='$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].*|aix5*) 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_F77='' hardcode_direct_F77=yes hardcode_libdir_separator_F77=':' link_all_deplibs_F77=yes 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 hardcode_direct_F77=yes else # We have old collect2 hardcode_direct_F77=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_F77=yes hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_libdir_separator_F77= fi esac shared_flag='-shared' 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 # 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_F77=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_F77='-berok' # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF program main end _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_f77_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_F77='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_F77="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_F77='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_F77="-z nodefs" archive_expsym_cmds_F77="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF program main end _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_f77_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_F77='${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_F77=' ${wl}-bernotok' allow_undefined_flag_F77=' ${wl}-berok' # -bexpall does not export symbols beginning with underscore (_) always_export_symbols_F77=yes # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_F77=' ' archive_cmds_need_lc_F77=yes # This is similar to how AIX traditionally builds it's shared libraries. archive_expsym_cmds_F77="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) archive_cmds_F77='$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_F77='-L$libdir' hardcode_minus_L_F77=yes # see comment about different semantics on the GNU ld section ld_shlibs_F77=no ;; bsdi4*) export_dynamic_flag_spec_F77=-rdynamic ;; cygwin* | mingw* | pw32*) # 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. hardcode_libdir_flag_spec_F77=' ' allow_undefined_flag_F77=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_F77='$CC -o $lib $libobjs $compiler_flags `echo "$deplibs" | $SED -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_From_new_cmds_F77='true' # FIXME: Should let the user specify the lib program. old_archive_cmds_F77='lib /OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes_F77=yes ;; darwin* | rhapsody*) if test "$GXX" = yes ; then archive_cmds_need_lc_F77=no case "$host_os" in rhapsody* | darwin1.[012]) allow_undefined_flag_F77='-undefined suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag_F77='-flat_namespace -undefined suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag_F77='-flat_namespace -undefined suppress' ;; 10.*) allow_undefined_flag_F77='-undefined dynamic_lookup' ;; esac fi ;; esac lt_int_apple_cc_single_mod=no output_verbose_link_cmd='echo' if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then lt_int_apple_cc_single_mod=yes fi if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_cmds_F77='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' else archive_cmds_F77='$CC -r ${wl}-bind_at_load -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' fi module_cmds_F77='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_expsym_cmds_F77='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else archive_expsym_cmds_F77='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -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~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' fi module_expsym_cmds_F77='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' hardcode_direct_F77=no hardcode_automatic_F77=yes hardcode_shlibpath_var_F77=unsupported whole_archive_flag_spec_F77='-all_load $convenience' link_all_deplibs_F77=yes else ld_shlibs_F77=no fi ;; dgux*) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_shlibpath_var_F77=no ;; freebsd1*) ld_shlibs_F77=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_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=yes hardcode_minus_L_F77=yes hardcode_shlibpath_var_F77=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | kfreebsd*-gnu) archive_cmds_F77='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds_F77='$rm $output_objdir/$soname~$CC -shared -fPIC ${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_F77='$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_F77='${wl}+b ${wl}$libdir' hardcode_libdir_separator_F77=: hardcode_direct_F77=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_F77=yes export_dynamic_flag_spec_F77='${wl}-E' ;; hpux10* | hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case "$host_cpu" in hppa*64*|ia64*) archive_cmds_F77='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_F77='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case "$host_cpu" in hppa*64*|ia64*) archive_cmds_F77='$LD -b +h $soname -o $lib $libobjs $deplibs $linker_flags' ;; *) archive_cmds_F77='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' ;; esac fi if test "$with_gnu_ld" = no; then case "$host_cpu" in hppa*64*) hardcode_libdir_flag_spec_F77='${wl}+b ${wl}$libdir' hardcode_libdir_flag_spec_ld_F77='+b $libdir' hardcode_libdir_separator_F77=: hardcode_direct_F77=no hardcode_shlibpath_var_F77=no ;; ia64*) hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_direct_F77=no hardcode_shlibpath_var_F77=no # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_F77=yes ;; *) hardcode_libdir_flag_spec_F77='${wl}+b ${wl}$libdir' hardcode_libdir_separator_F77=: hardcode_direct_F77=yes export_dynamic_flag_spec_F77='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_F77=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_F77='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_ld_F77='-rpath $libdir' fi hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_F77=: link_all_deplibs_F77=yes ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds_F77='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; newsos6) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=yes hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_F77=: hardcode_shlibpath_var_F77=no ;; openbsd*) hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds_F77='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_F77='${wl}-rpath,$libdir' export_dynamic_flag_spec_F77='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_F77='-R$libdir' ;; *) archive_cmds_F77='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_F77='${wl}-rpath,$libdir' ;; esac fi ;; os2*) hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_minus_L_F77=yes allow_undefined_flag_F77=unsupported archive_cmds_F77='$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_F77='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag_F77=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_F77='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag_F77=' -expect_unresolved \*' archive_cmds_F77='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' fi hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_F77=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag_F77=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_F77='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' else allow_undefined_flag_F77=' -expect_unresolved \*' archive_cmds_F77='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_F77='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; echo "-hidden">> $lib.exp~ $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib~$rm $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec_F77='-rpath $libdir' fi hardcode_libdir_separator_F77=: ;; sco3.2v5*) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_F77=no export_dynamic_flag_spec_F77='${wl}-Bexport' runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ;; solaris*) no_undefined_flag_F77=' -z text' if test "$GCC" = yes; then archive_cmds_F77='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_F77='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp' else archive_cmds_F77='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds_F77='$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' fi hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_shlibpath_var_F77=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_F77='-z allextract$convenience -z defaultextract' ;; esac link_all_deplibs_F77=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_F77='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_F77='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_direct_F77=yes hardcode_minus_L_F77=yes hardcode_shlibpath_var_F77=no ;; sysv4) case $host_vendor in sni) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds_F77='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds_F77='$CC -r -o $output$reload_objs' hardcode_direct_F77=no ;; motorola) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var_F77=no ;; sysv4.3*) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_F77=no export_dynamic_flag_spec_F77='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_F77=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs_F77=yes fi ;; sysv4.2uw2*) archive_cmds_F77='$LD -G -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=yes hardcode_minus_L_F77=no hardcode_shlibpath_var_F77=no hardcode_runpath_var=yes runpath_var=LD_RUN_PATH ;; sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[78]* | unixware7*) no_undefined_flag_F77='${wl}-z ${wl}text' if test "$GCC" = yes; then archive_cmds_F77='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_F77='$CC -G ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' fi runpath_var='LD_RUN_PATH' hardcode_shlibpath_var_F77=no ;; sysv5*) no_undefined_flag_F77=' -z text' # $CC -shared without GNU ld will not create a library from C++ # object files and a static libstdc++, better avoid it by now archive_cmds_F77='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds_F77='$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' hardcode_libdir_flag_spec_F77= hardcode_shlibpath_var_F77=no runpath_var='LD_RUN_PATH' ;; uts4*) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_shlibpath_var_F77=no ;; *) ld_shlibs_F77=no ;; esac fi echo "$as_me:$LINENO: result: $ld_shlibs_F77" >&5 echo "${ECHO_T}$ld_shlibs_F77" >&6 test "$ld_shlibs_F77" = 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 # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_F77" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_F77=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_F77 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. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_F77 compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_F77 allow_undefined_flag_F77= if { (eval echo "$as_me:$LINENO: \"$archive_cmds_F77 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1\"") >&5 (eval $archive_cmds_F77 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc_F77=no else archive_cmds_need_lc_F77=yes fi allow_undefined_flag_F77=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $rm conftest* echo "$as_me:$LINENO: result: $archive_cmds_need_lc_F77" >&5 echo "${ECHO_T}$archive_cmds_need_lc_F77" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&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" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # 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. 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 else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi 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 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' ;; aix4* | aix5*) version_type=linux 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*) 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=`$echo "X$lib" | $Xsed -e '\''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' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi4*) version_type=linux 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*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) 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' 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="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. 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 ;; 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 ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # 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}${versuffix}$shared_ext ${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)' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) 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 ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-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='GNU ld.so' ;; freebsd*) objformat=`test -x /usr/bin/objformat && /usr/bin/objformat || echo aout` 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 ;; *) # from 3.2 on shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; esac ;; 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 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' ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux 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 Linux ELF. linux*) 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' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # 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 # find out which ABI we are using libsuff= case "$host_cpu" in x86_64*|s390x*|powerpc64*) echo '#line 14092 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case `/usr/bin/file conftest.$ac_objext` in *64-bit*) libsuff=64 sys_lib_search_path_spec="/lib${libsuff} /usr/lib${libsuff} /usr/local/lib${libsuff}" ;; esac fi rm -rf conftest* ;; esac # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`$SED -e 's/:,\t/ /g;s/=^=*$//;s/=^= * / /g' /etc/ld.so.conf | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib${libsuff} /usr/lib${libsuff} $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' ;; knetbsd*-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='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux 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=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=yes ;; openbsd*) version_type=sunos need_lib_prefix=no need_version=yes 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" ;; sco3.2v5*) version_type=osf 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 ;; solaris*) 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=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.2uw2* | sysv4.3* | sysv5*) version_type=linux 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 export_dynamic_flag_spec='${wl}-Blargedynsym' 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 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 ;; uts4*) version_type=linux 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 echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&6 hardcode_action_F77= if test -n "$hardcode_libdir_flag_spec_F77" || \ test -n "$runpath_var F77" || \ test "X$hardcode_automatic_F77"="Xyes" ; then # We can hardcode non-existant directories. if test "$hardcode_direct_F77" != 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_AC_TAGVAR(hardcode_shlibpath_var, F77)" != no && test "$hardcode_minus_L_F77" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_F77=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_F77=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_F77=unsupported fi echo "$as_me:$LINENO: result: $hardcode_action_F77" >&5 echo "${ECHO_T}$hardcode_action_F77" >&6 if test "$hardcode_action_F77" = relink; 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 striplib= old_striplib= echo "$as_me:$LINENO: checking whether stripping libraries is possible" >&5 echo $ECHO_N "checking whether stripping libraries is possible... $ECHO_C" >&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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi ;; *) echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 ;; esac fi # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # 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 # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_F77 \ CC_F77 \ LD_F77 \ lt_prog_compiler_wl_F77 \ lt_prog_compiler_pic_F77 \ lt_prog_compiler_static_F77 \ lt_prog_compiler_no_builtin_flag_F77 \ export_dynamic_flag_spec_F77 \ thread_safe_flag_spec_F77 \ whole_archive_flag_spec_F77 \ enable_shared_with_static_runtimes_F77 \ old_archive_cmds_F77 \ old_archive_from_new_cmds_F77 \ predep_objects_F77 \ postdep_objects_F77 \ predeps_F77 \ postdeps_F77 \ compiler_lib_search_path_F77 \ archive_cmds_F77 \ archive_expsym_cmds_F77 \ postinstall_cmds_F77 \ postuninstall_cmds_F77 \ old_archive_from_expsyms_cmds_F77 \ allow_undefined_flag_F77 \ no_undefined_flag_F77 \ export_symbols_cmds_F77 \ hardcode_libdir_flag_spec_F77 \ hardcode_libdir_flag_spec_ld_F77 \ hardcode_libdir_separator_F77 \ hardcode_automatic_F77 \ module_cmds_F77 \ module_expsym_cmds_F77 \ lt_cv_prog_compiler_c_o_F77 \ exclude_expsyms_F77 \ include_expsyms_F77; do case $var in old_archive_cmds_F77 | \ old_archive_from_new_cmds_F77 | \ archive_cmds_F77 | \ archive_expsym_cmds_F77 | \ module_cmds_F77 | \ module_expsym_cmds_F77 | \ old_archive_from_expsyms_cmds_F77 | \ export_symbols_cmds_F77 | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_F77 # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_F77 # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # A language-specific compiler. CC=$lt_compiler_F77 # Is the compiler the GNU C compiler? with_gcc=$GCC_F77 # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_F77 # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_F77 # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_F77 pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_F77 # Must we lock files when doing compilation ? need_locks=$lt_need_locks # 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 # 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 # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_F77 # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_F77 # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_F77 # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_F77 # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_F77 # Library versioning type. version_type=$version_type # 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 # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_F77 old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_F77 # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_F77 # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds_F77 archive_expsym_cmds=$lt_archive_expsym_cmds_F77 postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_F77 module_expsym_cmds=$lt_module_expsym_cmds_F77 # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_F77 # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_F77 # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_F77 # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps_F77 # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_F77 # 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 # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_F77 # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_F77 # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # 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 # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_F77 # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # 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_F77 # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_F77 # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_F77 # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct_F77 # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L_F77 # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_F77 # 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_F77 # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_F77 # 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 # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_F77" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols_F77 # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_F77 # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_F77 # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_F77 # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" 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 CC="$lt_save_CC" else tagname="" fi ;; GCJ) if test -n "$GCJ" && test "X$GCJ" != "Xno"; then # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o objext_GCJ=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}\n" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String argv) {}; }\n' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # Allow CC to be a program name with arguments. compiler=$CC # Allow CC to be a program name with arguments. lt_save_CC="$CC" CC=${GCJ-"gcj"} compiler=$CC compiler_GCJ=$CC # GCJ did not exist at the time GCC didn't implicitly link libc in. archive_cmds_need_lc_GCJ=no lt_prog_compiler_no_builtin_flag_GCJ= if test "$GCC" = yes; then lt_prog_compiler_no_builtin_flag_GCJ=' -fno-builtin' echo "$as_me:$LINENO: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 echo $ECHO_N "checking if $compiler supports -fno-rtti -fno-exceptions... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_rtti_exceptions+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:14833: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:14837: \$? = $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 if test ! -s conftest.err; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_rtti_exceptions" >&6 if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag_GCJ="$lt_prog_compiler_no_builtin_flag_GCJ -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl_GCJ= lt_prog_compiler_pic_GCJ= lt_prog_compiler_static_GCJ= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 if test "$GCC" = yes; then lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_static_GCJ='-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_GCJ='-Bstatic' fi ;; amigaos*) # 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_GCJ='-m68020 -resident32 -malways-restore-a4' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | pw32* | os2*) # 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_GCJ='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_GCJ='-fno-common' ;; 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_GCJ=no enable_shared=no ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_GCJ=-Kconform_pic fi ;; hpux*) # 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_GCJ='-fPIC' ;; esac ;; *) lt_prog_compiler_pic_GCJ='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl_GCJ='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_GCJ='-Bstatic' else lt_prog_compiler_static_GCJ='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | pw32* | os2*) # 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_GCJ='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl_GCJ='-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_GCJ='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static_GCJ='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl_GCJ='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static_GCJ='-non_shared' ;; newsos6) lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; linux*) case $CC in icc* | ecc*) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-static' ;; ccc*) lt_prog_compiler_wl_GCJ='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static_GCJ='-non_shared' ;; esac ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl_GCJ='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static_GCJ='-non_shared' ;; sco3.2v5*) lt_prog_compiler_pic_GCJ='-Kpic' lt_prog_compiler_static_GCJ='-dn' ;; solaris*) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; sunos4*) lt_prog_compiler_wl_GCJ='-Qoption ld ' lt_prog_compiler_pic_GCJ='-PIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic_GCJ='-Kconform_pic' lt_prog_compiler_static_GCJ='-Bstatic' fi ;; uts4*) lt_prog_compiler_pic_GCJ='-pic' lt_prog_compiler_static_GCJ='-Bstatic' ;; *) lt_prog_compiler_can_build_shared_GCJ=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_GCJ" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_GCJ" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_GCJ"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic_GCJ works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic_GCJ works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works_GCJ+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works_GCJ=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_GCJ" # 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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:15066: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:15070: \$? = $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 if test ! -s conftest.err; then lt_prog_compiler_pic_works_GCJ=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works_GCJ" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works_GCJ" >&6 if test x"$lt_prog_compiler_pic_works_GCJ" = xyes; then case $lt_prog_compiler_pic_GCJ in "" | " "*) ;; *) lt_prog_compiler_pic_GCJ=" $lt_prog_compiler_pic_GCJ" ;; esac else lt_prog_compiler_pic_GCJ= lt_prog_compiler_can_build_shared_GCJ=no fi fi case "$host_os" in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_GCJ= ;; *) lt_prog_compiler_pic_GCJ="$lt_prog_compiler_pic_GCJ" ;; esac echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o_GCJ+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o_GCJ=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$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}? :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:15126: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:15130: \$? = $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 if test ! -s out/conftest.err; then lt_cv_prog_compiler_c_o_GCJ=yes fi fi chmod u+w . $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 .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o_GCJ" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_c_o_GCJ" >&6 hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_GCJ" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&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 echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 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 echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 runpath_var= allow_undefined_flag_GCJ= enable_shared_with_static_runtimes_GCJ=no archive_cmds_GCJ= archive_expsym_cmds_GCJ= old_archive_From_new_cmds_GCJ= old_archive_from_expsyms_cmds_GCJ= export_dynamic_flag_spec_GCJ= whole_archive_flag_spec_GCJ= thread_safe_flag_spec_GCJ= hardcode_libdir_flag_spec_GCJ= hardcode_libdir_flag_spec_ld_GCJ= hardcode_libdir_separator_GCJ= hardcode_direct_GCJ=no hardcode_minus_L_GCJ=no hardcode_shlibpath_var_GCJ=unsupported link_all_deplibs_GCJ=unknown hardcode_automatic_GCJ=no module_cmds_GCJ= module_expsym_cmds_GCJ= always_export_symbols_GCJ=no export_symbols_cmds_GCJ='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms_GCJ= # 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_GCJ="_GLOBAL_OFFSET_TABLE_" # 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. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32*) # 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 ;; openbsd*) with_gnu_ld=no ;; esac ld_shlibs_GCJ=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # See if GNU ld supports shared libraries. case $host_os in aix3* | aix4* | aix5*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs_GCJ=no cat <&2 *** Warning: the GNU linker, at least up to release 2.9.1, 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 modify your PATH *** so that a non-GNU linker is found, and then restart. EOF fi ;; amigaos*) archive_cmds_GCJ='$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_GCJ='-L$libdir' hardcode_minus_L_GCJ=yes # Samuel A. Falvo II reports # that the semantics of dynamic libraries on AmigaOS, at least up # to version 4, is to share data among multiple programs linked # with the same dynamic library. Since this doesn't match the # behavior of shared libraries on other platforms, we can't use # them. ld_shlibs_GCJ=no ;; beos*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_GCJ=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_GCJ='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_GCJ=no fi ;; cygwin* | mingw* | pw32*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, GCJ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_GCJ='-L$libdir' allow_undefined_flag_GCJ=unsupported always_export_symbols_GCJ=no enable_shared_with_static_runtimes_GCJ=yes export_symbols_cmds_GCJ='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGS] /s/.* \([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_GCJ='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}--image-base=0x10000000 ${wl}--out-implib,$lib' else ld_shlibs=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_GCJ='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris* | sysv5*) if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then ld_shlibs_GCJ=no cat <&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. EOF elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_GCJ=no fi ;; sunos4*) archive_cmds_GCJ='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; linux*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then tmp_archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_cmds_GCJ="$tmp_archive_cmds" supports_anon_versioning=no case `$LD -v 2>/dev/null` in *\ 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 if test $supports_anon_versioning = yes; then archive_expsym_cmds_GCJ='$echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ $echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' else archive_expsym_cmds_GCJ="$tmp_archive_cmds" fi else ld_shlibs_GCJ=no fi ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_GCJ=no fi ;; esac if test "$ld_shlibs_GCJ" = yes; then runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_GCJ='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_GCJ='${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_GCJ="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_GCJ= fi fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag_GCJ=unsupported always_export_symbols_GCJ=yes archive_expsym_cmds_GCJ='$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_GCJ=yes if test "$GCC" = yes && test -z "$link_static_flag"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct_GCJ=unsupported fi ;; aix4* | aix5*) 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 if $NM -V 2>&1 | grep 'GNU' > /dev/null; then export_symbols_cmds_GCJ='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_GCJ='$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].*|aix5*) 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_GCJ='' hardcode_direct_GCJ=yes hardcode_libdir_separator_GCJ=':' link_all_deplibs_GCJ=yes 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 hardcode_direct_GCJ=yes else # We have old collect2 hardcode_direct_GCJ=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_GCJ=yes hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_libdir_separator_GCJ= fi esac shared_flag='-shared' 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 # 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_GCJ=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_GCJ='-berok' # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_GCJ='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_GCJ="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_GCJ='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_GCJ="-z nodefs" archive_expsym_cmds_GCJ="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_GCJ='${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_GCJ=' ${wl}-bernotok' allow_undefined_flag_GCJ=' ${wl}-berok' # -bexpall does not export symbols beginning with underscore (_) always_export_symbols_GCJ=yes # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_GCJ=' ' archive_cmds_need_lc_GCJ=yes # This is similar to how AIX traditionally builds it's shared libraries. archive_expsym_cmds_GCJ="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) archive_cmds_GCJ='$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_GCJ='-L$libdir' hardcode_minus_L_GCJ=yes # see comment about different semantics on the GNU ld section ld_shlibs_GCJ=no ;; bsdi4*) export_dynamic_flag_spec_GCJ=-rdynamic ;; cygwin* | mingw* | pw32*) # 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. hardcode_libdir_flag_spec_GCJ=' ' allow_undefined_flag_GCJ=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_GCJ='$CC -o $lib $libobjs $compiler_flags `echo "$deplibs" | $SED -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_From_new_cmds_GCJ='true' # FIXME: Should let the user specify the lib program. old_archive_cmds_GCJ='lib /OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes_GCJ=yes ;; darwin* | rhapsody*) if test "$GXX" = yes ; then archive_cmds_need_lc_GCJ=no case "$host_os" in rhapsody* | darwin1.[012]) allow_undefined_flag_GCJ='-undefined suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag_GCJ='-flat_namespace -undefined suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag_GCJ='-flat_namespace -undefined suppress' ;; 10.*) allow_undefined_flag_GCJ='-undefined dynamic_lookup' ;; esac fi ;; esac lt_int_apple_cc_single_mod=no output_verbose_link_cmd='echo' if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then lt_int_apple_cc_single_mod=yes fi if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_cmds_GCJ='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' else archive_cmds_GCJ='$CC -r ${wl}-bind_at_load -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' fi module_cmds_GCJ='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_expsym_cmds_GCJ='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else archive_expsym_cmds_GCJ='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -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~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' fi module_expsym_cmds_GCJ='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' hardcode_direct_GCJ=no hardcode_automatic_GCJ=yes hardcode_shlibpath_var_GCJ=unsupported whole_archive_flag_spec_GCJ='-all_load $convenience' link_all_deplibs_GCJ=yes else ld_shlibs_GCJ=no fi ;; dgux*) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_shlibpath_var_GCJ=no ;; freebsd1*) ld_shlibs_GCJ=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_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=yes hardcode_minus_L_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | kfreebsd*-gnu) archive_cmds_GCJ='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds_GCJ='$rm $output_objdir/$soname~$CC -shared -fPIC ${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_GCJ='$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_GCJ='${wl}+b ${wl}$libdir' hardcode_libdir_separator_GCJ=: hardcode_direct_GCJ=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_GCJ=yes export_dynamic_flag_spec_GCJ='${wl}-E' ;; hpux10* | hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case "$host_cpu" in hppa*64*|ia64*) archive_cmds_GCJ='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_GCJ='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case "$host_cpu" in hppa*64*|ia64*) archive_cmds_GCJ='$LD -b +h $soname -o $lib $libobjs $deplibs $linker_flags' ;; *) archive_cmds_GCJ='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' ;; esac fi if test "$with_gnu_ld" = no; then case "$host_cpu" in hppa*64*) hardcode_libdir_flag_spec_GCJ='${wl}+b ${wl}$libdir' hardcode_libdir_flag_spec_ld_GCJ='+b $libdir' hardcode_libdir_separator_GCJ=: hardcode_direct_GCJ=no hardcode_shlibpath_var_GCJ=no ;; ia64*) hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_direct_GCJ=no hardcode_shlibpath_var_GCJ=no # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_GCJ=yes ;; *) hardcode_libdir_flag_spec_GCJ='${wl}+b ${wl}$libdir' hardcode_libdir_separator_GCJ=: hardcode_direct_GCJ=yes export_dynamic_flag_spec_GCJ='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_GCJ=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_GCJ='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_ld_GCJ='-rpath $libdir' fi hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_GCJ=: link_all_deplibs_GCJ=yes ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds_GCJ='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; newsos6) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=yes hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_GCJ=: hardcode_shlibpath_var_GCJ=no ;; openbsd*) hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds_GCJ='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_GCJ='${wl}-rpath,$libdir' export_dynamic_flag_spec_GCJ='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_GCJ='-R$libdir' ;; *) archive_cmds_GCJ='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_GCJ='${wl}-rpath,$libdir' ;; esac fi ;; os2*) hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_minus_L_GCJ=yes allow_undefined_flag_GCJ=unsupported archive_cmds_GCJ='$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_GCJ='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag_GCJ=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_GCJ='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag_GCJ=' -expect_unresolved \*' archive_cmds_GCJ='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' fi hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_GCJ=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag_GCJ=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_GCJ='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' else allow_undefined_flag_GCJ=' -expect_unresolved \*' archive_cmds_GCJ='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_GCJ='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; echo "-hidden">> $lib.exp~ $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib~$rm $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec_GCJ='-rpath $libdir' fi hardcode_libdir_separator_GCJ=: ;; sco3.2v5*) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_GCJ=no export_dynamic_flag_spec_GCJ='${wl}-Bexport' runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ;; solaris*) no_undefined_flag_GCJ=' -z text' if test "$GCC" = yes; then archive_cmds_GCJ='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_GCJ='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp' else archive_cmds_GCJ='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds_GCJ='$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' fi hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_shlibpath_var_GCJ=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_GCJ='-z allextract$convenience -z defaultextract' ;; esac link_all_deplibs_GCJ=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_GCJ='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_GCJ='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_direct_GCJ=yes hardcode_minus_L_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; sysv4) case $host_vendor in sni) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds_GCJ='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds_GCJ='$CC -r -o $output$reload_objs' hardcode_direct_GCJ=no ;; motorola) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var_GCJ=no ;; sysv4.3*) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_GCJ=no export_dynamic_flag_spec_GCJ='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_GCJ=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs_GCJ=yes fi ;; sysv4.2uw2*) archive_cmds_GCJ='$LD -G -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=yes hardcode_minus_L_GCJ=no hardcode_shlibpath_var_GCJ=no hardcode_runpath_var=yes runpath_var=LD_RUN_PATH ;; sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[78]* | unixware7*) no_undefined_flag_GCJ='${wl}-z ${wl}text' if test "$GCC" = yes; then archive_cmds_GCJ='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_GCJ='$CC -G ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' fi runpath_var='LD_RUN_PATH' hardcode_shlibpath_var_GCJ=no ;; sysv5*) no_undefined_flag_GCJ=' -z text' # $CC -shared without GNU ld will not create a library from C++ # object files and a static libstdc++, better avoid it by now archive_cmds_GCJ='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds_GCJ='$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' hardcode_libdir_flag_spec_GCJ= hardcode_shlibpath_var_GCJ=no runpath_var='LD_RUN_PATH' ;; uts4*) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_shlibpath_var_GCJ=no ;; *) ld_shlibs_GCJ=no ;; esac fi echo "$as_me:$LINENO: result: $ld_shlibs_GCJ" >&5 echo "${ECHO_T}$ld_shlibs_GCJ" >&6 test "$ld_shlibs_GCJ" = 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 # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_GCJ" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_GCJ=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_GCJ 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. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_GCJ compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_GCJ allow_undefined_flag_GCJ= if { (eval echo "$as_me:$LINENO: \"$archive_cmds_GCJ 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1\"") >&5 (eval $archive_cmds_GCJ 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc_GCJ=no else archive_cmds_need_lc_GCJ=yes fi allow_undefined_flag_GCJ=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $rm conftest* echo "$as_me:$LINENO: result: $archive_cmds_need_lc_GCJ" >&5 echo "${ECHO_T}$archive_cmds_need_lc_GCJ" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&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" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # 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. 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 else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi 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 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' ;; aix4* | aix5*) version_type=linux 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*) 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=`$echo "X$lib" | $Xsed -e '\''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' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi4*) version_type=linux 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*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) 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' 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="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. 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 ;; 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 ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # 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}${versuffix}$shared_ext ${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)' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) 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 ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-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='GNU ld.so' ;; freebsd*) objformat=`test -x /usr/bin/objformat && /usr/bin/objformat || echo aout` 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 ;; *) # from 3.2 on shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; esac ;; 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 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' ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux 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 Linux ELF. linux*) 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' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # 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 # find out which ABI we are using libsuff= case "$host_cpu" in x86_64*|s390x*|powerpc64*) echo '#line 16460 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case `/usr/bin/file conftest.$ac_objext` in *64-bit*) libsuff=64 sys_lib_search_path_spec="/lib${libsuff} /usr/lib${libsuff} /usr/local/lib${libsuff}" ;; esac fi rm -rf conftest* ;; esac # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`$SED -e 's/:,\t/ /g;s/=^=*$//;s/=^= * / /g' /etc/ld.so.conf | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib${libsuff} /usr/lib${libsuff} $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' ;; knetbsd*-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='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux 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=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=yes ;; openbsd*) version_type=sunos need_lib_prefix=no need_version=yes 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" ;; sco3.2v5*) version_type=osf 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 ;; solaris*) 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=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.2uw2* | sysv4.3* | sysv5*) version_type=linux 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 export_dynamic_flag_spec='${wl}-Blargedynsym' 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 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 ;; uts4*) version_type=linux 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 echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&6 hardcode_action_GCJ= if test -n "$hardcode_libdir_flag_spec_GCJ" || \ test -n "$runpath_var GCJ" || \ test "X$hardcode_automatic_GCJ"="Xyes" ; then # We can hardcode non-existant directories. if test "$hardcode_direct_GCJ" != 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_AC_TAGVAR(hardcode_shlibpath_var, GCJ)" != no && test "$hardcode_minus_L_GCJ" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_GCJ=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_GCJ=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_GCJ=unsupported fi echo "$as_me:$LINENO: result: $hardcode_action_GCJ" >&5 echo "${ECHO_T}$hardcode_action_GCJ" >&6 if test "$hardcode_action_GCJ" = relink; 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 striplib= old_striplib= echo "$as_me:$LINENO: checking whether stripping libraries is possible" >&5 echo $ECHO_N "checking whether stripping libraries is possible... $ECHO_C" >&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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}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" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi ;; *) echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 ;; esac 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*) 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 echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; 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 ;; *) echo "$as_me:$LINENO: checking for shl_load" >&5 echo $ECHO_N "checking for shl_load... $ECHO_C" >&6 if test "${ac_cv_func_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define shl_load to an innocuous variant, in case declares shl_load. For example, HP-UX 11i declares gettimeofday. */ #define shl_load innocuous_shl_load /* System header to define __stub macros and hopefully few prototypes, which can conflict with char shl_load (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef shl_load /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); /* 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_shl_load) || defined (__stub___shl_load) choke me #else char (*f) () = shl_load; #endif #ifdef __cplusplus } #endif int main () { return f != shl_load; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_shl_load" >&5 echo "${ECHO_T}$ac_cv_func_shl_load" >&6 if test $ac_cv_func_shl_load = yes; then lt_cv_dlopen="shl_load" else echo "$as_me:$LINENO: checking for shl_load in -ldld" >&5 echo $ECHO_N "checking for shl_load in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); int main () { shl_load (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_shl_load" >&5 echo "${ECHO_T}$ac_cv_lib_dld_shl_load" >&6 if test $ac_cv_lib_dld_shl_load = yes; then lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-dld" else echo "$as_me:$LINENO: checking for dlopen" >&5 echo $ECHO_N "checking for dlopen... $ECHO_C" >&6 if test "${ac_cv_func_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define dlopen to an innocuous variant, in case declares dlopen. For example, HP-UX 11i declares gettimeofday. */ #define dlopen innocuous_dlopen /* System header to define __stub macros and hopefully few prototypes, which can conflict with char dlopen (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef dlopen /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); /* 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_dlopen) || defined (__stub___dlopen) choke me #else char (*f) () = dlopen; #endif #ifdef __cplusplus } #endif int main () { return f != dlopen; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_dlopen" >&5 echo "${ECHO_T}$ac_cv_func_dlopen" >&6 if test $ac_cv_func_dlopen = yes; then lt_cv_dlopen="dlopen" else echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else echo "$as_me:$LINENO: checking for dlopen in -lsvld" >&5 echo $ECHO_N "checking for dlopen in -lsvld... $ECHO_C" >&6 if test "${ac_cv_lib_svld_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_svld_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_svld_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_svld_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_svld_dlopen" >&6 if test $ac_cv_lib_svld_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else echo "$as_me:$LINENO: checking for dld_link in -ldld" >&5 echo $ECHO_N "checking for dld_link in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_dld_link+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dld_link (); int main () { dld_link (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_dld_link=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_dld_link=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_dld_link" >&5 echo "${ECHO_T}$ac_cv_lib_dld_dld_link" >&6 if test $ac_cv_lib_dld_dld_link = yes; then lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-dld" 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" eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" echo "$as_me:$LINENO: checking whether a program can dlopen itself" >&5 echo $ECHO_N "checking whether a program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 < #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 #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=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; /* dlclose (self); */ } exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) 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_unknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self" >&5 echo "${ECHO_T}$lt_cv_dlopen_self" >&6 if test "x$lt_cv_dlopen_self" = xyes; then LDFLAGS="$LDFLAGS $link_static_flag" echo "$as_me:$LINENO: checking whether a statically linked program can dlopen itself" >&5 echo $ECHO_N "checking whether a statically linked program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self_static+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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 < #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 #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=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; /* dlclose (self); */ } exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) 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_unknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self_static" >&5 echo "${ECHO_T}$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 # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # 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 # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_GCJ \ CC_GCJ \ LD_GCJ \ lt_prog_compiler_wl_GCJ \ lt_prog_compiler_pic_GCJ \ lt_prog_compiler_static_GCJ \ lt_prog_compiler_no_builtin_flag_GCJ \ export_dynamic_flag_spec_GCJ \ thread_safe_flag_spec_GCJ \ whole_archive_flag_spec_GCJ \ enable_shared_with_static_runtimes_GCJ \ old_archive_cmds_GCJ \ old_archive_from_new_cmds_GCJ \ predep_objects_GCJ \ postdep_objects_GCJ \ predeps_GCJ \ postdeps_GCJ \ compiler_lib_search_path_GCJ \ archive_cmds_GCJ \ archive_expsym_cmds_GCJ \ postinstall_cmds_GCJ \ postuninstall_cmds_GCJ \ old_archive_from_expsyms_cmds_GCJ \ allow_undefined_flag_GCJ \ no_undefined_flag_GCJ \ export_symbols_cmds_GCJ \ hardcode_libdir_flag_spec_GCJ \ hardcode_libdir_flag_spec_ld_GCJ \ hardcode_libdir_separator_GCJ \ hardcode_automatic_GCJ \ module_cmds_GCJ \ module_expsym_cmds_GCJ \ lt_cv_prog_compiler_c_o_GCJ \ exclude_expsyms_GCJ \ include_expsyms_GCJ; do case $var in old_archive_cmds_GCJ | \ old_archive_from_new_cmds_GCJ | \ archive_cmds_GCJ | \ archive_expsym_cmds_GCJ | \ module_cmds_GCJ | \ module_expsym_cmds_GCJ | \ old_archive_from_expsyms_cmds_GCJ | \ export_symbols_cmds_GCJ | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_GCJ # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_GCJ # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # A language-specific compiler. CC=$lt_compiler_GCJ # Is the compiler the GNU C compiler? with_gcc=$GCC_GCJ # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_GCJ # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_GCJ # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_GCJ pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_GCJ # Must we lock files when doing compilation ? need_locks=$lt_need_locks # 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 # 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 # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_GCJ # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_GCJ # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_GCJ # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_GCJ # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_GCJ # Library versioning type. version_type=$version_type # 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 # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_GCJ old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_GCJ # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_GCJ # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds_GCJ archive_expsym_cmds=$lt_archive_expsym_cmds_GCJ postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_GCJ module_expsym_cmds=$lt_module_expsym_cmds_GCJ # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_GCJ # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_GCJ # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_GCJ # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps_GCJ # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_GCJ # 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 # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_GCJ # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_GCJ # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # 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 # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_GCJ # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # 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_GCJ # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_GCJ # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_GCJ # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct_GCJ # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L_GCJ # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_GCJ # 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_GCJ # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_GCJ # 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 # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_GCJ" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols_GCJ # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_GCJ # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_GCJ # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_GCJ # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" 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 CC="$lt_save_CC" else tagname="" fi ;; RC) # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o objext_RC=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }\n' # 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. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # Allow CC to be a program name with arguments. compiler=$CC # Allow CC to be a program name with arguments. lt_save_CC="$CC" CC=${RC-"windres"} compiler=$CC compiler_RC=$CC lt_cv_prog_compiler_c_o_RC=yes # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # 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 # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_RC \ CC_RC \ LD_RC \ lt_prog_compiler_wl_RC \ lt_prog_compiler_pic_RC \ lt_prog_compiler_static_RC \ lt_prog_compiler_no_builtin_flag_RC \ export_dynamic_flag_spec_RC \ thread_safe_flag_spec_RC \ whole_archive_flag_spec_RC \ enable_shared_with_static_runtimes_RC \ old_archive_cmds_RC \ old_archive_from_new_cmds_RC \ predep_objects_RC \ postdep_objects_RC \ predeps_RC \ postdeps_RC \ compiler_lib_search_path_RC \ archive_cmds_RC \ archive_expsym_cmds_RC \ postinstall_cmds_RC \ postuninstall_cmds_RC \ old_archive_from_expsyms_cmds_RC \ allow_undefined_flag_RC \ no_undefined_flag_RC \ export_symbols_cmds_RC \ hardcode_libdir_flag_spec_RC \ hardcode_libdir_flag_spec_ld_RC \ hardcode_libdir_separator_RC \ hardcode_automatic_RC \ module_cmds_RC \ module_expsym_cmds_RC \ lt_cv_prog_compiler_c_o_RC \ exclude_expsyms_RC \ include_expsyms_RC; do case $var in old_archive_cmds_RC | \ old_archive_from_new_cmds_RC | \ archive_cmds_RC | \ archive_expsym_cmds_RC | \ module_cmds_RC | \ module_expsym_cmds_RC | \ old_archive_from_expsyms_cmds_RC | \ export_symbols_cmds_RC | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_RC # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_RC # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # A language-specific compiler. CC=$lt_compiler_RC # Is the compiler the GNU C compiler? with_gcc=$GCC_RC # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_RC # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_RC # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_RC pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_RC # Must we lock files when doing compilation ? need_locks=$lt_need_locks # 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 # 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 # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_RC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_RC # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_RC # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_RC # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_RC # Library versioning type. version_type=$version_type # 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 # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_RC old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_RC # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_RC # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds_RC archive_expsym_cmds=$lt_archive_expsym_cmds_RC postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_RC module_expsym_cmds=$lt_module_expsym_cmds_RC # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_RC # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_RC # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_RC # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps_RC # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_RC # 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 # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_RC # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_RC # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # 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 # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_RC # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # 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_RC # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_RC # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_RC # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct_RC # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L_RC # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_RC # 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_RC # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_RC # 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 # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_RC" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols_RC # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_RC # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_RC # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_RC # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" 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 CC="$lt_save_CC" ;; *) { { echo "$as_me:$LINENO: error: Unsupported tag name: $tagname" >&5 echo "$as_me: error: Unsupported tag name: $tagname" >&2;} { (exit 1); exit 1; }; } ;; esac # Append the new tag name to the list of available tags. if test -n "$tagname" ; then available_tags="$available_tags $tagname" fi fi done IFS="$lt_save_ifs" # Now substitute the updated list of available tags. if eval "sed -e 's/^available_tags=.*\$/available_tags=\"$available_tags\"/' \"$ofile\" > \"${ofile}T\""; then mv "${ofile}T" "$ofile" chmod +x "$ofile" else rm -f "${ofile}T" { { echo "$as_me:$LINENO: error: unable to update list of available tagged configurations." >&5 echo "$as_me: error: unable to update list of available tagged configurations." >&2;} { (exit 1); exit 1; }; } fi fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ac_aux_dir/ltmain.sh" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' # Prevent multiple expansion # 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. echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5 echo $ECHO_N "checking for a BSD-compatible install... $ECHO_C" >&6 if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&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_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 ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi done done ;; esac done 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. We don't cache a # path for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the path is relative. INSTALL=$ac_install_sh fi fi echo "$as_me:$LINENO: result: $INSTALL" >&5 echo "${ECHO_T}$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' echo "$as_me:$LINENO: checking for size_t" >&5 echo $ECHO_N "checking for size_t... $ECHO_C" >&6 if test "${ac_cv_type_size_t+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default int main () { if ((size_t *) 0) return 0; if (sizeof (size_t)) return 0; ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_type_size_t=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_type_size_t=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_type_size_t" >&5 echo "${ECHO_T}$ac_cv_type_size_t" >&6 if test $ac_cv_type_size_t = yes; then : else cat >>confdefs.h <<_ACEOF #define size_t unsigned _ACEOF fi for ac_header in string.h strings.h unistd.h stdint.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` if eval "test \"\${$as_ac_Header+set}\" = set"; then echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 else # Is the header compilable? echo "$as_me:$LINENO: checking $ac_header usability" >&5 echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_header_compiler=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_compiler=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 echo "${ECHO_T}$ac_header_compiler" >&6 # Is the header present? echo "$as_me:$LINENO: checking $ac_header presence" >&5 echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include <$ac_header> _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then ac_header_preproc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_preproc=no fi rm -f conftest.err conftest.$ac_ext echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 echo "${ECHO_T}$ac_header_preproc" >&6 # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in yes:no: ) { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the compiler's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the compiler's result" >&2;} ac_header_preproc=yes ;; no:yes:* ) { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: see the Autoconf documentation" >&5 echo "$as_me: WARNING: $ac_header: see the Autoconf documentation" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&5 echo "$as_me: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: in the future, the compiler will take precedence" >&5 echo "$as_me: WARNING: $ac_header: in the future, the compiler will take precedence" >&2;} ( cat <<\_ASBOX ## ------------------------------------------ ## ## Report this to the libsphinxclient lists. ## ## ------------------------------------------ ## _ASBOX ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else eval "$as_ac_Header=\$ac_header_preproc" fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 fi if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done DEFAULT_INSTALL_PREFIX="/usr/local" # Check whether --enable-debug or --disable-debug was given. if test "${enable_debug+set}" = set; then enableval="$enable_debug" if test x"$enableval" = xyes ; then debug="yes" else debug="no" fi fi; if test x"$debug" = xyes ; then cat >>confdefs.h <<\_ACEOF #define SPHINXCLIENT_DEBUG _ACEOF if test x"$GCC" = xyes; then CFLAGS=`echo "$CFLAGS" | /usr/bin/sed -e 's/-O[0-9s]*//g'` CFLAGS=`echo "$CFLAGS" | /usr/bin/sed -e 's/-g[0-2]\? //g'` CFLAGS="$CFLAGS -g3 -Wall -O0" fi INSTALL_STRIP_FLAG="" else INSTALL_STRIP_FLAG="-s" fi ac_config_files="$ac_config_files 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, don't put newlines in cache variables' values. # 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. { (set) 2>&1 | case `(ac_space=' '; set | grep ac_space) 2>&1` in *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 \ "s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1=\\2/p" ;; esac; } | sed ' t clear : clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end /^ac_cv_env/!s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ : end' >>confcache if diff $cache_file confcache >/dev/null 2>&1; then :; else if test -w $cache_file; then test "x$cache_file" != "x/dev/null" && echo "updating cache $cache_file" cat confcache >$cache_file else echo "not updating unwritable cache $cache_file" 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}' # VPATH may cause trouble with some makes, so we remove $(srcdir), # ${srcdir} and @srcdir@ 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[ ]*=/{ s/:*\$(srcdir):*/:/; s/:*\${srcdir}:*/:/; s/:*@srcdir@:*/:/; s/^\([^=]*=[ ]*\):*/\1/; s/:*$//; s/^[^=]*=[ ]*$//; }' fi DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_i=`echo "$ac_i" | sed 's/\$U\././;s/\.o$//;s/\.obj$//'` # 2. Add them. ac_libobjs="$ac_libobjs $ac_i\$U.$ac_objext" ac_ltlibobjs="$ac_ltlibobjs $ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -z "${MAINTAINER_MODE_TRUE}" && test -z "${MAINTAINER_MODE_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"MAINTAINER_MODE\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"MAINTAINER_MODE\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi : ${CONFIG_STATUS=./config.status} ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { echo "$as_me:$LINENO: creating $CONFIG_STATUS" >&5 echo "$as_me: creating $CONFIG_STATUS" >&6;} cat >$CONFIG_STATUS <<_ACEOF #! $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} _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF ## --------------------- ## ## M4sh Initialization. ## ## --------------------- ## # 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+"$@"}'='"$@"' elif test -n "${BASH_VERSION+set}" && (set -o posix) >/dev/null 2>&1; then set -o posix fi DUALCASE=1; export DUALCASE # for MKS sh # Support unset when possible. if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then as_unset=unset else as_unset=false fi # Work around bugs in pre-3.0 UWIN ksh. $as_unset ENV MAIL MAILPATH PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. for as_var in \ LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ LC_TELEPHONE LC_TIME do if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then eval $as_var=C; export $as_var else $as_unset $as_var fi done # Required to use basename. if expr a : '\(a\)' >/dev/null 2>&1; 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 # Name of the executable. as_me=`$as_basename "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)$' \| \ . : '\(.\)' 2>/dev/null || echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/; q; } /^X\/\(\/\/\)$/{ s//\1/; q; } /^X\/\(\/\).*/{ s//\1/; q; } s/.*/./; q'` # PATH needs CR, and LINENO needs CR and PATH. # 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 # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then echo "#! /bin/sh" >conf$$.sh echo "exit 0" >>conf$$.sh chmod +x conf$$.sh if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then PATH_SEPARATOR=';' else PATH_SEPARATOR=: fi rm -f conf$$.sh fi as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" || { # Find who we are. Look in the path if we contain no path at all # relative or not. 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 ;; 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 { { echo "$as_me:$LINENO: error: cannot find myself; rerun with an absolute path" >&5 echo "$as_me: error: cannot find myself; rerun with an absolute path" >&2;} { (exit 1); exit 1; }; } fi case $CONFIG_SHELL in '') as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for as_base in sh bash ksh sh5; do case $as_dir in /*) if ("$as_dir/$as_base" -c ' as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" ') 2>/dev/null; then $as_unset BASH_ENV || test "${BASH_ENV+set}" != set || { BASH_ENV=; export BASH_ENV; } $as_unset ENV || test "${ENV+set}" != set || { ENV=; export ENV; } CONFIG_SHELL=$as_dir/$as_base export CONFIG_SHELL exec "$CONFIG_SHELL" "$0" ${1+"$@"} fi;; esac done done ;; esac # Create $as_me.lineno as a copy of $as_myself, but with $LINENO # uniformly replaced by the line number. The first 'sed' inserts a # line-number line before each line; the second 'sed' does the real # work. The second script uses 'N' to pair each line-number line # with the numbered line, and appends trailing '-' during # substitution so that $LINENO is not a special case at line end. # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the # second 'sed' script. Blame Lee E. McMahon for sed's syntax. :-) sed '=' <$as_myself | sed ' N s,$,-, : loop s,^\(['$as_cr_digits']*\)\(.*\)[$]LINENO\([^'$as_cr_alnum'_]\),\1\2\1\3, t loop s,-$,, s,^['$as_cr_digits']*\n,, ' >$as_me.lineno && chmod +x $as_me.lineno || { { echo "$as_me:$LINENO: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&5 echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2;} { (exit 1); exit 1; }; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensible to this). . ./$as_me.lineno # Exit status is that of the last command. exit } case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in *c*,-n*) ECHO_N= ECHO_C=' ' ECHO_T=' ' ;; *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; *) ECHO_N= ECHO_C='\c' ECHO_T= ;; esac if expr a : '\(a\)' >/dev/null 2>&1; then as_expr=expr else as_expr=false fi rm -f conf$$ conf$$.exe conf$$.file echo >conf$$.file if ln -s conf$$.file conf$$ 2>/dev/null; then # We could just check for DJGPP; but this test a) works b) is more generic # and c) will remain valid once DJGPP supports symlinks (DJGPP 2.04). if test -f conf$$.exe; then # Don't use ln at all; we don't have any links as_ln_s='cp -p' else as_ln_s='ln -s' fi elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.file if mkdir -p . 2>/dev/null; then as_mkdir_p=: else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_executable_p="test -f" # 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'" # IFS # We need space, tab and new line, in precisely that order. as_nl=' ' IFS=" $as_nl" # CDPATH. $as_unset CDPATH exec 6>&1 # Open the log real soon, to keep \$[0] and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. Logging --version etc. is OK. exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX } >&5 cat >&5 <<_CSEOF This file was extended by libsphinxclient $as_me 0.0.1, which was generated by GNU Autoconf 2.59. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ _CSEOF echo "on `(hostname || uname -n) 2>/dev/null | sed 1q`" >&5 echo >&5 _ACEOF # Files that config.status was made for. if test -n "$ac_config_files"; then echo "config_files=\"$ac_config_files\"" >>$CONFIG_STATUS fi if test -n "$ac_config_headers"; then echo "config_headers=\"$ac_config_headers\"" >>$CONFIG_STATUS fi if test -n "$ac_config_links"; then echo "config_links=\"$ac_config_links\"" >>$CONFIG_STATUS fi if test -n "$ac_config_commands"; then echo "config_commands=\"$ac_config_commands\"" >>$CONFIG_STATUS fi cat >>$CONFIG_STATUS <<\_ACEOF ac_cs_usage="\ \`$as_me' instantiates files from templates according to the current configuration. Usage: $0 [OPTIONS] [FILE]... -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 --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_cs_version="\\ libsphinxclient config.status 0.0.1 configured by $0, generated by GNU Autoconf 2.59, with options \\"`echo "$ac_configure_args" | sed 's/[\\""\`\$]/\\\\&/g'`\\" Copyright (C) 2003 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." srcdir=$srcdir INSTALL="$INSTALL" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # If no file are specified by the user, then we need to provide default # value. By we need to know if files were specified by the user. 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=$1 ac_optarg=$2 ac_shift=shift ;; *) # This is not an option, so the user has probably given explicit # arguments. ac_option=$1 ac_need_defaults=false;; esac case $ac_option in # Handling of the options. _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --vers* | -V ) echo "$ac_cs_version"; exit 0 ;; --he | --h) # Conflict between --help and --header { { echo "$as_me:$LINENO: error: ambiguous option: $1 Try \`$0 --help' for more information." >&5 echo "$as_me: error: ambiguous option: $1 Try \`$0 --help' for more information." >&2;} { (exit 1); exit 1; }; };; --help | --hel | -h ) echo "$ac_cs_usage"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift CONFIG_FILES="$CONFIG_FILES $ac_optarg" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift CONFIG_HEADERS="$CONFIG_HEADERS $ac_optarg" ac_need_defaults=false;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) { { echo "$as_me:$LINENO: error: unrecognized option: $1 Try \`$0 --help' for more information." >&5 echo "$as_me: error: unrecognized option: $1 Try \`$0 --help' for more information." >&2;} { (exit 1); exit 1; }; } ;; *) ac_config_targets="$ac_config_targets $1" ;; 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 if \$ac_cs_recheck; then echo "running $SHELL $0 " $ac_configure_args \$ac_configure_extra_args " --no-create --no-recursion" >&6 exec $SHELL $0 $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF # # INIT-COMMANDS section. # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF for ac_config_target in $ac_config_targets do case "$ac_config_target" in # Handling of arguments. "Makefile" ) CONFIG_FILES="$CONFIG_FILES Makefile" ;; "depfiles" ) CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "sphinxclient_config.h" ) CONFIG_HEADERS="$CONFIG_HEADERS sphinxclient_config.h" ;; *) { { echo "$as_me:$LINENO: error: invalid argument: $ac_config_target" >&5 echo "$as_me: error: invalid argument: $ac_config_target" >&2;} { (exit 1); exit 1; }; };; 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 to put it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Create a temporary directory, and hook for its removal unless debugging. $debug || { trap 'exit_status=$?; rm -rf $tmp && exit $exit_status' 0 trap '{ (exit 1); exit 1; }' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d -q "./confstatXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" } || { tmp=./confstat$$-$RANDOM (umask 077 && mkdir $tmp) } || { echo "$me: cannot create a temporary directory in ." >&2 { (exit 1); exit 1; } } _ACEOF cat >>$CONFIG_STATUS <<_ACEOF # # CONFIG_FILES section. # # No need to generate the scripts if there are no CONFIG_FILES. # This happens for instance when ./config.status config.h if test -n "\$CONFIG_FILES"; then # Protect against being on the right side of a sed subst in config.status. sed 's/,@/@@/; s/@,/@@/; s/,;t t\$/@;t t/; /@;t t\$/s/[\\\\&,]/\\\\&/g; s/@@/,@/; s/@@/@,/; s/@;t t\$/,;t t/' >\$tmp/subs.sed <<\\CEOF s,@SHELL@,$SHELL,;t t s,@PATH_SEPARATOR@,$PATH_SEPARATOR,;t t s,@PACKAGE_NAME@,$PACKAGE_NAME,;t t s,@PACKAGE_TARNAME@,$PACKAGE_TARNAME,;t t s,@PACKAGE_VERSION@,$PACKAGE_VERSION,;t t s,@PACKAGE_STRING@,$PACKAGE_STRING,;t t s,@PACKAGE_BUGREPORT@,$PACKAGE_BUGREPORT,;t t s,@exec_prefix@,$exec_prefix,;t t s,@prefix@,$prefix,;t t s,@program_transform_name@,$program_transform_name,;t t s,@bindir@,$bindir,;t t s,@sbindir@,$sbindir,;t t s,@libexecdir@,$libexecdir,;t t s,@datadir@,$datadir,;t t s,@sysconfdir@,$sysconfdir,;t t s,@sharedstatedir@,$sharedstatedir,;t t s,@localstatedir@,$localstatedir,;t t s,@libdir@,$libdir,;t t s,@includedir@,$includedir,;t t s,@oldincludedir@,$oldincludedir,;t t s,@infodir@,$infodir,;t t s,@mandir@,$mandir,;t t s,@build_alias@,$build_alias,;t t s,@host_alias@,$host_alias,;t t s,@target_alias@,$target_alias,;t t s,@DEFS@,$DEFS,;t t s,@ECHO_C@,$ECHO_C,;t t s,@ECHO_N@,$ECHO_N,;t t s,@ECHO_T@,$ECHO_T,;t t s,@LIBS@,$LIBS,;t t s,@INSTALL_PROGRAM@,$INSTALL_PROGRAM,;t t s,@INSTALL_SCRIPT@,$INSTALL_SCRIPT,;t t s,@INSTALL_DATA@,$INSTALL_DATA,;t t s,@CYGPATH_W@,$CYGPATH_W,;t t s,@PACKAGE@,$PACKAGE,;t t s,@VERSION@,$VERSION,;t t s,@ACLOCAL@,$ACLOCAL,;t t s,@AUTOCONF@,$AUTOCONF,;t t s,@AUTOMAKE@,$AUTOMAKE,;t t s,@AUTOHEADER@,$AUTOHEADER,;t t s,@MAKEINFO@,$MAKEINFO,;t t s,@install_sh@,$install_sh,;t t s,@STRIP@,$STRIP,;t t s,@ac_ct_STRIP@,$ac_ct_STRIP,;t t s,@INSTALL_STRIP_PROGRAM@,$INSTALL_STRIP_PROGRAM,;t t s,@mkdir_p@,$mkdir_p,;t t s,@AWK@,$AWK,;t t s,@SET_MAKE@,$SET_MAKE,;t t s,@am__leading_dot@,$am__leading_dot,;t t s,@AMTAR@,$AMTAR,;t t s,@am__tar@,$am__tar,;t t s,@am__untar@,$am__untar,;t t s,@MAINTAINER_MODE_TRUE@,$MAINTAINER_MODE_TRUE,;t t s,@MAINTAINER_MODE_FALSE@,$MAINTAINER_MODE_FALSE,;t t s,@MAINT@,$MAINT,;t t s,@CC@,$CC,;t t s,@CFLAGS@,$CFLAGS,;t t s,@LDFLAGS@,$LDFLAGS,;t t s,@CPPFLAGS@,$CPPFLAGS,;t t s,@ac_ct_CC@,$ac_ct_CC,;t t s,@EXEEXT@,$EXEEXT,;t t s,@OBJEXT@,$OBJEXT,;t t s,@DEPDIR@,$DEPDIR,;t t s,@am__include@,$am__include,;t t s,@am__quote@,$am__quote,;t t s,@AMDEP_TRUE@,$AMDEP_TRUE,;t t s,@AMDEP_FALSE@,$AMDEP_FALSE,;t t s,@AMDEPBACKSLASH@,$AMDEPBACKSLASH,;t t s,@CCDEPMODE@,$CCDEPMODE,;t t s,@am__fastdepCC_TRUE@,$am__fastdepCC_TRUE,;t t s,@am__fastdepCC_FALSE@,$am__fastdepCC_FALSE,;t t s,@build@,$build,;t t s,@build_cpu@,$build_cpu,;t t s,@build_vendor@,$build_vendor,;t t s,@build_os@,$build_os,;t t s,@host@,$host,;t t s,@host_cpu@,$host_cpu,;t t s,@host_vendor@,$host_vendor,;t t s,@host_os@,$host_os,;t t s,@EGREP@,$EGREP,;t t s,@LN_S@,$LN_S,;t t s,@ECHO@,$ECHO,;t t s,@AR@,$AR,;t t s,@ac_ct_AR@,$ac_ct_AR,;t t s,@RANLIB@,$RANLIB,;t t s,@ac_ct_RANLIB@,$ac_ct_RANLIB,;t t s,@CPP@,$CPP,;t t s,@CXXCPP@,$CXXCPP,;t t s,@LIBTOOL@,$LIBTOOL,;t t s,@INSTALL_STRIP_FLAG@,$INSTALL_STRIP_FLAG,;t t s,@LIBOBJS@,$LIBOBJS,;t t s,@LTLIBOBJS@,$LTLIBOBJS,;t t CEOF _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # Split the substitutions into bite-sized pieces for seds with # small command number limits, like on Digital OSF/1 and HP-UX. ac_max_sed_lines=48 ac_sed_frag=1 # Number of current file. ac_beg=1 # First line for current file. ac_end=$ac_max_sed_lines # Line after last line for current file. ac_more_lines=: ac_sed_cmds= while $ac_more_lines; do if test $ac_beg -gt 1; then sed "1,${ac_beg}d; ${ac_end}q" $tmp/subs.sed >$tmp/subs.frag else sed "${ac_end}q" $tmp/subs.sed >$tmp/subs.frag fi if test ! -s $tmp/subs.frag; then ac_more_lines=false else # The purpose of the label and of the branching condition is to # speed up the sed processing (if there are no `@' at all, there # is no need to browse any of the substitutions). # These are the two extra sed commands mentioned above. (echo ':t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b' && cat $tmp/subs.frag) >$tmp/subs-$ac_sed_frag.sed if test -z "$ac_sed_cmds"; then ac_sed_cmds="sed -f $tmp/subs-$ac_sed_frag.sed" else ac_sed_cmds="$ac_sed_cmds | sed -f $tmp/subs-$ac_sed_frag.sed" fi ac_sed_frag=`expr $ac_sed_frag + 1` ac_beg=$ac_end ac_end=`expr $ac_end + $ac_max_sed_lines` fi done if test -z "$ac_sed_cmds"; then ac_sed_cmds=cat fi fi # test -n "$CONFIG_FILES" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF for ac_file in : $CONFIG_FILES; do test "x$ac_file" = x: && continue # Support "outfile[:infile[:infile...]]", defaulting infile="outfile.in". case $ac_file in - | *:- | *:-:* ) # input from stdin cat >$tmp/stdin ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; *:* ) ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; * ) ac_file_in=$ac_file.in ;; esac # Compute @srcdir@, @top_srcdir@, and @INSTALL@ for subdirectories. ac_dir=`(dirname "$ac_file") 2>/dev/null || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p "$ac_dir" else as_dir="$ac_dir" as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory \"$ac_dir\"" >&5 echo "$as_me: error: cannot create directory \"$ac_dir\"" >&2;} { (exit 1); exit 1; }; }; } ac_builddir=. if test "$ac_dir" != .; then ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A "../" for each directory in $ac_dir_suffix. ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` else ac_dir_suffix= ac_top_builddir= fi case $srcdir in .) # No --srcdir option. We are building in place. ac_srcdir=. if test -z "$ac_top_builddir"; then ac_top_srcdir=. else ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` fi ;; [\\/]* | ?:[\\/]* ) # Absolute path. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ;; *) # Relative path. ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_builddir$srcdir ;; esac # Do not use `cd foo && pwd` to compute absolute paths, because # the directories may not exist. case `pwd` in .) ac_abs_builddir="$ac_dir";; *) case "$ac_dir" in .) ac_abs_builddir=`pwd`;; [\\/]* | ?:[\\/]* ) ac_abs_builddir="$ac_dir";; *) ac_abs_builddir=`pwd`/"$ac_dir";; esac;; esac case $ac_abs_builddir in .) ac_abs_top_builddir=${ac_top_builddir}.;; *) case ${ac_top_builddir}. in .) ac_abs_top_builddir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_builddir=${ac_top_builddir}.;; *) ac_abs_top_builddir=$ac_abs_builddir/${ac_top_builddir}.;; esac;; esac case $ac_abs_builddir in .) ac_abs_srcdir=$ac_srcdir;; *) case $ac_srcdir in .) ac_abs_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_srcdir=$ac_srcdir;; *) ac_abs_srcdir=$ac_abs_builddir/$ac_srcdir;; esac;; esac case $ac_abs_builddir in .) ac_abs_top_srcdir=$ac_top_srcdir;; *) case $ac_top_srcdir in .) ac_abs_top_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_srcdir=$ac_top_srcdir;; *) ac_abs_top_srcdir=$ac_abs_builddir/$ac_top_srcdir;; esac;; esac case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_builddir$INSTALL ;; esac if test x"$ac_file" != x-; then { echo "$as_me:$LINENO: creating $ac_file" >&5 echo "$as_me: creating $ac_file" >&6;} rm -f "$ac_file" fi # 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. */ if test x"$ac_file" = x-; then configure_input= else configure_input="$ac_file. " fi configure_input=$configure_input"Generated from `echo $ac_file_in | sed 's,.*/,,'` by configure." # First look for the input files in the build tree, otherwise in the # src tree. ac_file_inputs=`IFS=: for f in $ac_file_in; do case $f in -) echo $tmp/stdin ;; [\\/$]*) # Absolute (can't be DOS-style, as IFS=:) test -f "$f" || { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } echo "$f";; *) # Relative if test -f "$f"; then # Build tree echo "$f" elif test -f "$srcdir/$f"; then # Source tree echo "$srcdir/$f" else # /dev/null tree { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } fi;; esac done` || { (exit 1); exit 1; } _ACEOF cat >>$CONFIG_STATUS <<_ACEOF sed "$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s,@configure_input@,$configure_input,;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,@top_builddir@,$ac_top_builddir,;t t s,@abs_top_builddir@,$ac_abs_top_builddir,;t t s,@INSTALL@,$ac_INSTALL,;t t " $ac_file_inputs | (eval "$ac_sed_cmds") >$tmp/out rm -f $tmp/stdin if test x"$ac_file" != x-; then mv $tmp/out $ac_file else cat $tmp/out rm -f $tmp/out fi done _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # # CONFIG_HEADER section. # # These sed commands are passed to sed as "A NAME B NAME C VALUE D", where # NAME is the cpp macro being defined and VALUE is the value it is being given. # # ac_d sets the value in "#define NAME VALUE" lines. ac_dA='s,^\([ ]*\)#\([ ]*define[ ][ ]*\)' ac_dB='[ ].*$,\1#\2' ac_dC=' ' ac_dD=',;t' # ac_u turns "#undef NAME" without trailing blanks into "#define NAME VALUE". ac_uA='s,^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' ac_uB='$,\1#\2define\3' ac_uC=' ' ac_uD=',;t' for ac_file in : $CONFIG_HEADERS; do test "x$ac_file" = x: && continue # Support "outfile[:infile[:infile...]]", defaulting infile="outfile.in". case $ac_file in - | *:- | *:-:* ) # input from stdin cat >$tmp/stdin ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; *:* ) ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; * ) ac_file_in=$ac_file.in ;; esac test x"$ac_file" != x- && { echo "$as_me:$LINENO: creating $ac_file" >&5 echo "$as_me: creating $ac_file" >&6;} # First look for the input files in the build tree, otherwise in the # src tree. ac_file_inputs=`IFS=: for f in $ac_file_in; do case $f in -) echo $tmp/stdin ;; [\\/$]*) # Absolute (can't be DOS-style, as IFS=:) test -f "$f" || { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } # Do quote $f, to prevent DOS paths from being IFS'd. echo "$f";; *) # Relative if test -f "$f"; then # Build tree echo "$f" elif test -f "$srcdir/$f"; then # Source tree echo "$srcdir/$f" else # /dev/null tree { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } fi;; esac done` || { (exit 1); exit 1; } # Remove the trailing spaces. sed 's/[ ]*$//' $ac_file_inputs >$tmp/in _ACEOF # Transform confdefs.h into two sed scripts, `conftest.defines' and # `conftest.undefs', that substitutes the proper values into # config.h.in to produce config.h. The first handles `#define' # templates, and the second `#undef' templates. # And first: Protect against being on the right side of a sed subst in # config.status. Protect against being in an unquoted here document # in config.status. rm -f conftest.defines conftest.undefs # Using a here document instead of a string reduces the quoting nightmare. # Putting comments in sed scripts is not portable. # # `end' is used to avoid that the second main sed command (meant for # 0-ary CPP macros) applies to n-ary macro definitions. # See the Autoconf documentation for `clear'. cat >confdef2sed.sed <<\_ACEOF s/[\\&,]/\\&/g s,[\\$`],\\&,g t clear : clear s,^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*\)\(([^)]*)\)[ ]*\(.*\)$,${ac_dA}\1${ac_dB}\1\2${ac_dC}\3${ac_dD},gp t end s,^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\)$,${ac_dA}\1${ac_dB}\1${ac_dC}\2${ac_dD},gp : end _ACEOF # If some macros were called several times there might be several times # the same #defines, which is useless. Nevertheless, we may not want to # sort them, since we want the *last* AC-DEFINE to be honored. uniq confdefs.h | sed -n -f confdef2sed.sed >conftest.defines sed 's/ac_d/ac_u/g' conftest.defines >conftest.undefs rm -f confdef2sed.sed # This sed command replaces #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. cat >>conftest.undefs <<\_ACEOF s,^[ ]*#[ ]*undef[ ][ ]*[a-zA-Z_][a-zA-Z_0-9]*,/* & */, _ACEOF # Break up conftest.defines because some shells have a limit on the size # of here documents, and old seds have small limits too (100 cmds). echo ' # Handle all the #define templates only if necessary.' >>$CONFIG_STATUS echo ' if grep "^[ ]*#[ ]*define" $tmp/in >/dev/null; then' >>$CONFIG_STATUS echo ' # If there are no defines, we may have an empty if/fi' >>$CONFIG_STATUS echo ' :' >>$CONFIG_STATUS rm -f conftest.tail while grep . conftest.defines >/dev/null do # Write a limited-size here document to $tmp/defines.sed. echo ' cat >$tmp/defines.sed <>$CONFIG_STATUS # Speed up: don't consider the non `#define' lines. echo '/^[ ]*#[ ]*define/!b' >>$CONFIG_STATUS # Work around the forget-to-reset-the-flag bug. echo 't clr' >>$CONFIG_STATUS echo ': clr' >>$CONFIG_STATUS sed ${ac_max_here_lines}q conftest.defines >>$CONFIG_STATUS echo 'CEOF sed -f $tmp/defines.sed $tmp/in >$tmp/out rm -f $tmp/in mv $tmp/out $tmp/in ' >>$CONFIG_STATUS sed 1,${ac_max_here_lines}d conftest.defines >conftest.tail rm -f conftest.defines mv conftest.tail conftest.defines done rm -f conftest.defines echo ' fi # grep' >>$CONFIG_STATUS echo >>$CONFIG_STATUS # Break up conftest.undefs because some shells have a limit on the size # of here documents, and old seds have small limits too (100 cmds). echo ' # Handle all the #undef templates' >>$CONFIG_STATUS rm -f conftest.tail while grep . conftest.undefs >/dev/null do # Write a limited-size here document to $tmp/undefs.sed. echo ' cat >$tmp/undefs.sed <>$CONFIG_STATUS # Speed up: don't consider the non `#undef' echo '/^[ ]*#[ ]*undef/!b' >>$CONFIG_STATUS # Work around the forget-to-reset-the-flag bug. echo 't clr' >>$CONFIG_STATUS echo ': clr' >>$CONFIG_STATUS sed ${ac_max_here_lines}q conftest.undefs >>$CONFIG_STATUS echo 'CEOF sed -f $tmp/undefs.sed $tmp/in >$tmp/out rm -f $tmp/in mv $tmp/out $tmp/in ' >>$CONFIG_STATUS sed 1,${ac_max_here_lines}d conftest.undefs >conftest.tail rm -f conftest.undefs mv conftest.tail conftest.undefs done rm -f conftest.undefs cat >>$CONFIG_STATUS <<\_ACEOF # 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. */ if test x"$ac_file" = x-; then echo "/* Generated by configure. */" >$tmp/config.h else echo "/* $ac_file. Generated by configure. */" >$tmp/config.h fi cat $tmp/in >>$tmp/config.h rm -f $tmp/in if test x"$ac_file" != x-; then if diff $ac_file $tmp/config.h >/dev/null 2>&1; then { echo "$as_me:$LINENO: $ac_file is unchanged" >&5 echo "$as_me: $ac_file is unchanged" >&6;} else ac_dir=`(dirname "$ac_file") 2>/dev/null || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p "$ac_dir" else as_dir="$ac_dir" as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory \"$ac_dir\"" >&5 echo "$as_me: error: cannot create directory \"$ac_dir\"" >&2;} { (exit 1); exit 1; }; }; } rm -f $ac_file mv $tmp/config.h $ac_file fi else cat $tmp/config.h rm -f $tmp/config.h fi # Compute $ac_file's index in $config_headers. _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $ac_file | $ac_file:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $ac_file" >`(dirname $ac_file) 2>/dev/null || $as_expr X$ac_file : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X$ac_file : 'X\(//\)[^/]' \| \ X$ac_file : 'X\(//\)$' \| \ X$ac_file : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X$ac_file | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'`/stamp-h$_am_stamp_count done _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # # CONFIG_COMMANDS section. # for ac_file in : $CONFIG_COMMANDS; do test "x$ac_file" = x: && continue ac_dest=`echo "$ac_file" | sed 's,:.*,,'` ac_source=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_dir=`(dirname "$ac_dest") 2>/dev/null || $as_expr X"$ac_dest" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_dest" : 'X\(//\)[^/]' \| \ X"$ac_dest" : 'X\(//\)$' \| \ X"$ac_dest" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$ac_dest" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p "$ac_dir" else as_dir="$ac_dir" as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory \"$ac_dir\"" >&5 echo "$as_me: error: cannot create directory \"$ac_dir\"" >&2;} { (exit 1); exit 1; }; }; } ac_builddir=. if test "$ac_dir" != .; then ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A "../" for each directory in $ac_dir_suffix. ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` else ac_dir_suffix= ac_top_builddir= fi case $srcdir in .) # No --srcdir option. We are building in place. ac_srcdir=. if test -z "$ac_top_builddir"; then ac_top_srcdir=. else ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` fi ;; [\\/]* | ?:[\\/]* ) # Absolute path. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ;; *) # Relative path. ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_builddir$srcdir ;; esac # Do not use `cd foo && pwd` to compute absolute paths, because # the directories may not exist. case `pwd` in .) ac_abs_builddir="$ac_dir";; *) case "$ac_dir" in .) ac_abs_builddir=`pwd`;; [\\/]* | ?:[\\/]* ) ac_abs_builddir="$ac_dir";; *) ac_abs_builddir=`pwd`/"$ac_dir";; esac;; esac case $ac_abs_builddir in .) ac_abs_top_builddir=${ac_top_builddir}.;; *) case ${ac_top_builddir}. in .) ac_abs_top_builddir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_builddir=${ac_top_builddir}.;; *) ac_abs_top_builddir=$ac_abs_builddir/${ac_top_builddir}.;; esac;; esac case $ac_abs_builddir in .) ac_abs_srcdir=$ac_srcdir;; *) case $ac_srcdir in .) ac_abs_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_srcdir=$ac_srcdir;; *) ac_abs_srcdir=$ac_abs_builddir/$ac_srcdir;; esac;; esac case $ac_abs_builddir in .) ac_abs_top_srcdir=$ac_top_srcdir;; *) case $ac_top_srcdir in .) ac_abs_top_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_srcdir=$ac_top_srcdir;; *) ac_abs_top_srcdir=$ac_abs_builddir/$ac_top_srcdir;; esac;; esac { echo "$as_me:$LINENO: executing $ac_dest commands" >&5 echo "$as_me: executing $ac_dest commands" >&6;} case $ac_dest in depfiles ) test x"$AMDEP_TRUE" != x"" || for mf in $CONFIG_FILES; 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. # So let's grep whole file. if grep '^#.*generated by automake' $mf > /dev/null 2>&1; then dirpart=`(dirname "$mf") 2>/dev/null || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`(dirname "$file") 2>/dev/null || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p $dirpart/$fdir else as_dir=$dirpart/$fdir as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory $dirpart/$fdir" >&5 echo "$as_me: error: cannot create directory $dirpart/$fdir" >&2;} { (exit 1); exit 1; }; }; } # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done ;; esac done _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF { (exit 0); exit 0; } _ACEOF chmod +x $CONFIG_STATUS ac_clean_files=$ac_clean_files_save # 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 || { (exit 1); exit 1; } fi coreseek-4.1-beta/csft-4.1/api/libsphinxclient/configure.in100777 0 0 3160 11643565730 16740 0dnl this file has to be processed by autoconf AC_PREREQ(2.59) MAJOR_VERSION=0 MINOR_VERSION=0 BUGFIX_VERSION=1 EXTRA_VERSION="-dev" LIBSPHINXCLIENT_VERSION="${MAJOR_VERSION}.${MINOR_VERSION}.${BUGFIX_VERSION}${EXTRA_VERSION}" AC_INIT([libsphinxclient],[0.0.1]) AC_CONFIG_SRCDIR([README]) AC_CONFIG_SRCDIR(sphinxclient.h) AC_CONFIG_HEADERS(sphinxclient_config.h) AM_INIT_AUTOMAKE([no-define]) AM_MAINTAINER_MODE dnl Checks for programs. AC_PROG_CC AC_PROG_LD m4_undefine([AC_PROG_CXX]) m4_defun([AC_PROG_CXX],[]) m4_undefine([AC_PROG_F77]) m4_defun([AC_PROG_F77],[]) AM_PROG_LIBTOOL AC_PROG_INSTALL dnl Checks for typedefs, structures, and compiler characteristics. AC_TYPE_SIZE_T dnl Checks for header files. AC_CHECK_HEADERS(string.h strings.h unistd.h stdint.h) DEFAULT_INSTALL_PREFIX="/usr/local" AC_ARG_ENABLE(debug, [AS_HELP_STRING([--enable-debug],[enable debugging symbols and compile flags]) ], [ if test x"$enableval" = xyes ; then debug="yes" else debug="no" fi ] ) if test x"$debug" = xyes ; then AC_DEFINE([SPHINXCLIENT_DEBUG], [], [debug build]) if test x"$GCC" = xyes; then dnl Remove any optimization flags from CFLAGS changequote({,}) CFLAGS=`echo "$CFLAGS" | /usr/bin/sed -e 's/-O[0-9s]*//g'` CFLAGS=`echo "$CFLAGS" | /usr/bin/sed -e 's/-g[0-2]\? //g'` changequote([,]) CFLAGS="$CFLAGS -g3 -Wall -O0" fi dnl Do not strip symbols from developer object files. INSTALL_STRIP_FLAG="" else dnl Make sure to strip symbols from non-developer object files. INSTALL_STRIP_FLAG="-s" fi AC_SUBST(INSTALL_STRIP_FLAG) AC_CONFIG_FILES([Makefile]) AC_OUTPUT coreseek-4.1-beta/csft-4.1/api/libsphinxclient/COPYING100777 0 0 61274 11643565730 15514 0 GNU LIBRARY GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1991 Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the library GPL. It is numbered 2 because it goes with version 2 of the ordinary GPL.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Library General Public License, applies to some specially designated Free Software Foundation software, and to any other libraries whose authors decide to use it. You can use it for your libraries, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library, or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link a program with the library, you must provide complete object files to the recipients so that they can relink them with the library, after making changes to the library and recompiling it. And you must show them these terms so they know their rights. Our method of protecting your rights has two steps: (1) copyright the library, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the library. Also, for each distributor's protection, we want to make certain that everyone understands that there is no warranty for this free library. If the library is modified by someone else and passed on, we want its recipients to know that what they have is not the original version, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that companies distributing free software will individually obtain patent licenses, thus in effect transforming the program into proprietary software. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License, which was designed for utility programs. This license, the GNU Library General Public License, applies to certain designated libraries. This license is quite different from the ordinary one; be sure to read it in full, and don't assume that anything in it is the same as in the ordinary license. The reason we have a separate public license for some libraries is that they blur the distinction we usually make between modifying or adding to a program and simply using it. Linking a program with a library, without changing the library, is in some sense simply using the library, and is analogous to running a utility program or application program. However, in a textual and legal sense, the linked executable is a combined work, a derivative of the original library, and the ordinary General Public License treats it as such. Because of this blurred distinction, using the ordinary General Public License for libraries did not effectively promote software sharing, because most developers did not use the libraries. We concluded that weaker conditions might promote sharing better. However, unrestricted linking of non-free programs would deprive the users of those programs of all benefit from the free status of the libraries themselves. This Library General Public License is intended to permit developers of non-free programs to use free libraries, while preserving your freedom as a user of such programs to change the free libraries that are incorporated in them. (We have not seen how to achieve this as regards changes in header files, but we have achieved it as regards changes in the actual functions of the Library.) The hope is that this will lead to faster development of free libraries. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, while the latter only works together with the library. Note that it is possible for a library to be covered by the ordinary General Public License rather than by this special one. GNU LIBRARY GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Library General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also compile or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. c) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. d) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Library General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; if not, write to the Free Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! coreseek-4.1-beta/csft-4.1/api/libsphinxclient/install-sh100777 0 0 21766 11643565730 16464 0#!/bin/sh # install - install a program, script, or datafile scriptversion=2004-09-10.20 # 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. It can only install one file at a time, a restriction # shared with many OS's install programs. # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit="${DOITPROG-}" # put in absolute paths if you don't have them in your path; or use env. vars. mvprog="${MVPROG-mv}" cpprog="${CPPROG-cp}" chmodprog="${CHMODPROG-chmod}" chownprog="${CHOWNPROG-chown}" chgrpprog="${CHGRPPROG-chgrp}" stripprog="${STRIPPROG-strip}" rmprog="${RMPROG-rm}" mkdirprog="${MKDIRPROG-mkdir}" chmodcmd="$chmodprog 0755" chowncmd= chgrpcmd= stripcmd= rmcmd="$rmprog -f" mvcmd="$mvprog" src= dst= dir_arg= dstarg= 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: -c (ignored) -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. --help display this help and exit. --version display version info and exit. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test -n "$1"; do case $1 in -c) shift continue;; -d) dir_arg=true shift continue;; -g) chgrpcmd="$chgrpprog $2" shift shift continue;; --help) echo "$usage"; exit 0;; -m) chmodcmd="$chmodprog $2" shift shift continue;; -o) chowncmd="$chownprog $2" shift shift continue;; -s) stripcmd=$stripprog shift continue;; -t) dstarg=$2 shift shift continue;; -T) no_target_directory=true shift continue;; --version) echo "$0 $scriptversion"; exit 0;; *) # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. test -n "$dir_arg$dstarg" && break # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dstarg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dstarg" shift # fnord fi shift # arg dstarg=$arg done break;; esac done if test -z "$1"; 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 for src do # Protect names starting with `-'. case $src in -*) src=./$src ;; esac if test -n "$dir_arg"; then dst=$src src= if test -d "$dst"; then mkdircmd=: chmodcmd= else mkdircmd=$mkdirprog fi 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 "$dstarg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dstarg # Protect names starting with `-'. case $dst in -*) dst=./$dst ;; esac # 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: $dstarg: Is a directory" >&2 exit 1 fi dst=$dst/`basename "$src"` fi fi # This sed command emulates the dirname command. dstdir=`echo "$dst" | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'` # Make sure that the destination directory exists. # Skip lots of stat calls in the usual case. if test ! -d "$dstdir"; then defaultIFS=' ' IFS="${IFS-$defaultIFS}" oIFS=$IFS # Some sh's can't handle IFS=/ for some reason. IFS='%' set - `echo "$dstdir" | sed -e 's@/@%@g' -e 's@^%@/@'` IFS=$oIFS pathcomp= while test $# -ne 0 ; do pathcomp=$pathcomp$1 shift if test ! -d "$pathcomp"; then $mkdirprog "$pathcomp" # mkdir can fail with a `File exist' error in case several # install-sh are creating the directory concurrently. This # is OK. test -d "$pathcomp" || exit fi pathcomp=$pathcomp/ done fi if test -n "$dir_arg"; then $doit $mkdircmd "$dst" \ && { test -z "$chowncmd" || $doit $chowncmd "$dst"; } \ && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } \ && { test -z "$stripcmd" || $doit $stripcmd "$dst"; } \ && { test -z "$chmodcmd" || $doit $chmodcmd "$dst"; } else dstfile=`basename "$dst"` # 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 trap '(exit $?); exit' 1 2 13 15 # Copy the file name to the temp name. $doit $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 "$dsttmp"; } && # Now rename the file to the real destination. { $doit $mvcmd -f "$dsttmp" "$dstdir/$dstfile" 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. { if test -f "$dstdir/$dstfile"; then $doit $rmcmd -f "$dstdir/$dstfile" 2>/dev/null \ || $doit $mvcmd -f "$dstdir/$dstfile" "$rmtmp" 2>/dev/null \ || { echo "$0: cannot unlink or rename $dstdir/$dstfile" >&2 (exit 1); exit } else : fi } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dstdir/$dstfile" } } fi || { (exit 1); exit; } done # The final little trick to "correctly" pass the exit status to the exit trap. { (exit 0); exit } # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: coreseek-4.1-beta/csft-4.1/api/libsphinxclient/libsphinxclient.vcproj100777 0 0 6763 11643565730 21067 0 coreseek-4.1-beta/csft-4.1/api/libsphinxclient/ltmain.sh100777 0 0 546662 11643565730 16332 0# ltmain.sh - Provide generalized library-building support services. # NOTE: Changing this file will not affect anything until you rerun configure. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004 # Free Software Foundation, Inc. # Originally by Gordon Matzigkeit , 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 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, write to the Free Software # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. # # 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. basename="s,^.*/,,g" # 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" # RH: define SED for historic ltconfig's generated by Libtool 1.3 [ -z "$SED" ] && SED=sed # The name of this program: progname=`echo "$progpath" | $SED $basename` modename="$progname" # Global variables: EXIT_SUCCESS=0 EXIT_FAILURE=1 PROGRAM=ltmain.sh PACKAGE=libtool VERSION=1.5.6 TIMESTAMP=" (1.1220.2.95 2004/04/11 05:50:42)" # Check that we have a working $echo. if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`($echo '\t') 2>/dev/null`" = 'X\t'; then # Yippee, $echo works! : else # Restart under the correct shell, and then maybe $echo will work. exec $SHELL "$progpath" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat <&2 $echo "Fatal configuration error. See the $PACKAGE docs for more information." 1>&2 exit $EXIT_FAILURE fi # Global variables. mode=$default_mode nonopt= prev= prevopt= run= show="$echo" show_help= execute_dlfiles= lo2o="s/\\.lo\$/.${objext}/" o2lo="s/\\.${objext}\$/.lo/" ##################################### # Shell function definitions: # This seems to be the best place for them # 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. func_win32_libid () { 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 if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | \ $EGREP -e 'file format pe-i386(.*architecture: i386)?' >/dev/null ; then win32_nmres=`eval $NM -f posix -A $1 | \ sed -n -e '1,100{/ I /{x;/import/!{s/^/import/;h;p;};x;};}'` if test "X$win32_nmres" = "Ximport" ; then win32_libid_type="x86 archive import" else win32_libid_type="x86 archive static" fi 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_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 () { if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac CC_quoted="$CC_quoted $arg" done 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 "* | " `$echo $CC` "* | "`$echo $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$echo $CC_quoted` "* | "`$echo $CC_quoted` "*) ;; # 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. case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac CC_quoted="$CC_quoted $arg" done case "$@ " in " $CC "* | "$CC "* | " `$echo $CC` "* | "`$echo $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$echo $CC_quoted` "* | "`$echo $CC_quoted` "*) # 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 $echo "$modename: unable to infer tagged configuration" $echo "$modename: specify a tag with \`--tag'" 1>&2 exit $EXIT_FAILURE # else # $echo "$modename: using $tagname tagged configuration" fi ;; esac fi } # End of Shell function definitions ##################################### # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Parse our command line options once, thoroughly. while test "$#" -gt 0 do arg="$1" shift case $arg in -*=*) optarg=`$echo "X$arg" | $Xsed -e 's/[-_a-zA-Z0-9]*=//'` ;; *) optarg= ;; esac # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in execute_dlfiles) execute_dlfiles="$execute_dlfiles $arg" ;; tag) tagname="$arg" preserve_args="${preserve_args}=$arg" # Check whether tagname contains only valid characters case $tagname in *[!-_A-Za-z0-9,/]*) $echo "$progname: invalid tag name: $tagname" 1>&2 exit $EXIT_FAILURE ;; esac case $tagname in CC) # Don't test for the "default" C tag, as we know, it's there, but # not specially marked. ;; *) if grep "^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$" < "$progpath" > /dev/null; then taglist="$taglist $tagname" # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$tagname'$/,/^# ### END LIBTOOL TAG CONFIG: '$tagname'$/p' < $progpath`" else $echo "$progname: ignoring unknown tag $tagname" 1>&2 fi ;; esac ;; *) eval "$prev=\$arg" ;; esac prev= prevopt= continue fi # Have we seen a non-optional argument yet? case $arg in --help) show_help=yes ;; --version) $echo "$PROGRAM (GNU $PACKAGE) $VERSION$TIMESTAMP" $echo $echo "Copyright (C) 2003 Free Software Foundation, Inc." $echo "This is free software; see the source for copying conditions. There is NO" $echo "warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." exit $EXIT_SUCCESS ;; --config) ${SED} -e '1,/^# ### BEGIN LIBTOOL CONFIG/d' -e '/^# ### END LIBTOOL CONFIG/,$d' $progpath # Now print the configurations for the tags. for tagname in $taglist; do ${SED} -n -e "/^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$/,/^# ### END LIBTOOL TAG CONFIG: $tagname$/p" < "$progpath" done exit $EXIT_SUCCESS ;; --debug) $echo "$progname: enabling shell trace mode" set -x preserve_args="$preserve_args $arg" ;; --dry-run | -n) run=: ;; --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 $EXIT_SUCCESS ;; --finish) mode="finish" ;; --mode) prevopt="--mode" prev=mode ;; --mode=*) mode="$optarg" ;; --preserve-dup-deps) duplicate_deps="yes" ;; --quiet | --silent) show=: preserve_args="$preserve_args $arg" ;; --tag) prevopt="--tag" prev=tag ;; --tag=*) set tag "$optarg" ${1+"$@"} shift prev=tag preserve_args="$preserve_args --tag" ;; -dlopen) prevopt="-dlopen" prev=execute_dlfiles ;; -*) $echo "$modename: unrecognized option \`$arg'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; *) nonopt="$arg" break ;; esac done if test -n "$prevopt"; then $echo "$modename: option \`$prevopt' requires an argument" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # 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= if test -z "$show_help"; then # Infer the operation mode. if test -z "$mode"; then $echo "*** Warning: inferring the mode of operation is deprecated." 1>&2 $echo "*** Future versions of Libtool will require -mode=MODE be specified." 1>&2 case $nonopt in *cc | cc* | *++ | gcc* | *-gcc* | g++* | xlc*) mode=link for arg do case $arg in -c) mode=compile break ;; esac done ;; *db | *dbx | *strace | *truss) mode=execute ;; *install*|cp|mv) mode=install ;; *rm) mode=uninstall ;; *) # If we have no mode, but dlfiles were specified, then do execute mode. test -n "$execute_dlfiles" && mode=execute # Just use the default operation mode. if test -z "$mode"; then if test -n "$nonopt"; then $echo "$modename: warning: cannot infer operation mode from \`$nonopt'" 1>&2 else $echo "$modename: warning: cannot infer operation mode without MODE-ARGS" 1>&2 fi fi ;; esac fi # Only execute mode is allowed to have -dlopen flags. if test -n "$execute_dlfiles" && test "$mode" != execute; then $echo "$modename: unrecognized option \`-dlopen'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help="$help" help="Try \`$modename --help --mode=$mode' for more information." # These modes are in order of execution frequency so that they run quickly. case $mode in # libtool compile mode compile) modename="$modename: compile" # 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= 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) if test -n "$libobj" ; then $echo "$modename: you cannot specify \`-o' more than once" 1>&2 exit $EXIT_FAILURE fi arg_mode=target continue ;; -static | -prefer-pic | -prefer-non-pic) later="$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,*) args=`$echo "X$arg" | $Xsed -e "s/^-Wc,//"` lastarg= save_ifs="$IFS"; IFS=',' for arg in $args; do IFS="$save_ifs" # Double-quote args containing other shell metacharacters. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac lastarg="$lastarg $arg" done IFS="$save_ifs" lastarg=`$echo "X$lastarg" | $Xsed -e "s/^ //"` # Add the arguments to base_compile. base_compile="$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. lastarg=`$echo "X$lastarg" | $Xsed -e "$sed_quote_subst"` case $lastarg in # Double-quote args containing other shell metacharacters. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") lastarg="\"$lastarg\"" ;; esac base_compile="$base_compile $lastarg" done # for arg case $arg_mode in arg) $echo "$modename: you must specify an argument for -Xcompile" exit $EXIT_FAILURE ;; target) $echo "$modename: you must specify a target with \`-o'" 1>&2 exit $EXIT_FAILURE ;; *) # Get the name of the library object. [ -z "$libobj" ] && libobj=`$echo "X$srcfile" | $Xsed -e 's%^.*/%%'` ;; esac # Recognize several different file suffixes. # If the user specifies -o file.o, it is replaced with file.lo xform='[cCFSifmso]' case $libobj in *.ada) xform=ada ;; *.adb) xform=adb ;; *.ads) xform=ads ;; *.asm) xform=asm ;; *.c++) xform=c++ ;; *.cc) xform=cc ;; *.ii) xform=ii ;; *.class) xform=class ;; *.cpp) xform=cpp ;; *.cxx) xform=cxx ;; *.f90) xform=f90 ;; *.for) xform=for ;; *.java) xform=java ;; esac libobj=`$echo "X$libobj" | $Xsed -e "s/\.$xform$/.lo/"` case $libobj in *.lo) obj=`$echo "X$libobj" | $Xsed -e "$lo2o"` ;; *) $echo "$modename: cannot determine name of library object from \`$libobj'" 1>&2 exit $EXIT_FAILURE ;; esac func_infer_tag $base_compile for arg in $later; do case $arg in -static) build_old_libs=yes continue ;; -prefer-pic) pic_mode=yes continue ;; -prefer-non-pic) pic_mode=no continue ;; esac done objname=`$echo "X$obj" | $Xsed -e 's%^.*/%%'` xdir=`$echo "X$obj" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$obj"; then xdir= else xdir=$xdir/ fi lobj=${xdir}$objdir/$objname if test -z "$base_compile"; then $echo "$modename: you must specify a compilation command" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # 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 $run $rm $removelist trap "$run $rm $removelist; exit $EXIT_FAILURE" 1 2 15 # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2*) 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 "X$srcfile" | $Xsed -e 's%^.*/%%' -e 's%\.[^.]*$%%'`.${objext} lockfile="$output_obj.lock" removelist="$removelist $output_obj $lockfile" trap "$run $rm $removelist; exit $EXIT_FAILURE" 1 2 15 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 $run ln "$progpath" "$lockfile" 2>/dev/null; do $show "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." $run $rm $removelist exit $EXIT_FAILURE fi $echo $srcfile > "$lockfile" fi if test -n "$fix_srcfile_path"; then eval srcfile=\"$fix_srcfile_path\" fi $run $rm "$libobj" "${libobj}T" # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. test -z "$run" && cat > ${libobj}T </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." $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 $show "$mv $output_obj $lobj" if $run $mv $output_obj $lobj; then : else error=$? $run $rm $removelist exit $error fi fi # Append the name of the PIC object to the libtool object file. test -z "$run" && cat >> ${libobj}T <> ${libobj}T </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." $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 $show "$mv $output_obj $obj" if $run $mv $output_obj $obj; then : else error=$? $run $rm $removelist exit $error fi fi # Append the name of the non-PIC object the libtool object file. # Only append if the libtool object file exists. test -z "$run" && cat >> ${libobj}T <> ${libobj}T <&2 fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi else if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi fi build_libtool_libs=no build_old_libs=yes prefer_static_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 case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") qarg=\"`$echo "X$arg" | $Xsed -e "$sed_quote_subst"`\" ### testsuite: skip nested quoting test ;; *) qarg=$arg ;; esac libtool_args="$libtool_args $qarg" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) compile_command="$compile_command @OUTPUT@" finalize_command="$finalize_command @OUTPUT@" ;; esac case $prev in dlfiles|dlprefiles) if test "$preload" = no; then # Add the symbol object into the linking commands. compile_command="$compile_command @SYMFILE@" finalize_command="$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 dlfiles="$dlfiles $arg" else dlprefiles="$dlprefiles $arg" fi prev= continue ;; esac ;; expsyms) export_symbols="$arg" if test ! -f "$arg"; then $echo "$modename: symbol file \`$arg' does not exist" exit $EXIT_FAILURE fi prev= continue ;; expsyms_regex) export_symbols_regex="$arg" prev= continue ;; inst_prefix) inst_prefix_dir="$arg" prev= continue ;; precious_regex) precious_files_regex="$arg" prev= continue ;; release) release="-$arg" prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat $save_arg` do # moreargs="$moreargs $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if (${SED} -e '2q' $arg | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then pic_object= non_pic_object= # Read the .lo file # If there is no directory component, then add one. case $arg in */* | *\\*) . $arg ;; *) . ./$arg ;; esac if test -z "$pic_object" || \ test -z "$non_pic_object" || test "$pic_object" = none && \ test "$non_pic_object" = none; then $echo "$modename: cannot find name of object for \`$arg'" 1>&2 exit $EXIT_FAILURE fi # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi 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 dlfiles="$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. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. libobjs="$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 non_pic_objects="$non_pic_objects $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi fi else # Only an error if not doing a dry-run. if test -z "$run"; then $echo "$modename: \`$arg' is not a valid libtool object" 1>&2 exit $EXIT_FAILURE else # Dry-run case. # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi pic_object=`$echo "X${xdir}${objdir}/${arg}" | $Xsed -e "$lo2o"` non_pic_object=`$echo "X${xdir}${arg}" | $Xsed -e "$lo2o"` libobjs="$libobjs $pic_object" non_pic_objects="$non_pic_objects $non_pic_object" fi fi done else $echo "$modename: link input file \`$save_arg' does not exist" exit $EXIT_FAILURE fi arg=$save_arg prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) $echo "$modename: only absolute run-paths are allowed" 1>&2 exit $EXIT_FAILURE ;; esac if test "$prev" = rpath; then case "$rpath " in *" $arg "*) ;; *) rpath="$rpath $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) xrpath="$xrpath $arg" ;; esac fi prev= continue ;; xcompiler) compiler_flags="$compiler_flags $qarg" prev= compile_command="$compile_command $qarg" finalize_command="$finalize_command $qarg" continue ;; xlinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $wl$qarg" prev= compile_command="$compile_command $wl$qarg" finalize_command="$finalize_command $wl$qarg" continue ;; xcclinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $qarg" prev= compile_command="$compile_command $qarg" finalize_command="$finalize_command $qarg" continue ;; shrext) shrext_cmds="$arg" prev= 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 compile_command="$compile_command $link_static_flag" finalize_command="$finalize_command $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. $echo "$modename: \`-allow-undefined' is deprecated because it is the default" 1>&2 continue ;; -avoid-version) avoid_version=yes 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 $echo "$modename: more than one -exported-symbols argument is not allowed" exit $EXIT_FAILURE fi if test "X$arg" = "X-export-symbols"; then prev=expsyms else prev=expsyms_regex fi 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*) compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" ;; esac continue ;; -L*) dir=`$echo "X$arg" | $Xsed -e 's/^-L//'` # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then $echo "$modename: cannot determine absolute directory name of \`$dir'" 1>&2 exit $EXIT_FAILURE fi dir="$absdir" ;; esac case "$deplibs " in *" -L$dir "*) ;; *) deplibs="$deplibs -L$dir" lib_search_path="$lib_search_path $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2*) case :$dllsearchpath: in *":$dir:"*) ;; *) dllsearchpath="$dllsearchpath:$dir";; esac ;; esac continue ;; -l*) if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then case $host in *-*-cygwin* | *-*-pw32* | *-*-beos*) # These systems don't actually have a C or math library (as such) continue ;; *-*-mingw* | *-*-os2*) # These systems don't actually have a C library (as such) test "X$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd*) # 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 deplibs="$deplibs -framework System" continue esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi deplibs="$deplibs $arg" continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe) deplibs="$deplibs $arg" continue ;; -module) module=yes continue ;; # gcc -m* arguments should be passed to the linker via $compiler_flags # in order to pass architecture information to the linker # (e.g. 32 vs 64-bit). This may also be accomplished via -Wl,-mfoo # but this is not reliable with gcc because gcc may use -mfoo to # select a different linker, different libraries, etc, while # -Wl,-mfoo simply passes -mfoo to the linker. -m*) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" if test "$with_gcc" = "yes" ; then compiler_flags="$compiler_flags $arg" fi continue ;; -shrext) prev=shrext continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2*) # The PATH hackery in wrapper scripts is required on Windows # in order for the loader to find any dlls it needs. $echo "$modename: warning: \`-no-install' is ignored for $host" 1>&2 $echo "$modename: warning: assuming \`-no-fast-install' instead" 1>&2 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*) dir=`$echo "X$arg" | $Xsed -e 's/^-R//'` # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) $echo "$modename: only absolute run-paths are allowed" 1>&2 exit $EXIT_FAILURE ;; esac case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac continue ;; -static) # 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 ;; -Wc,*) args=`$echo "X$arg" | $Xsed -e "$sed_quote_subst" -e 's/^-Wc,//'` arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" case $flag in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") flag="\"$flag\"" ;; esac arg="$arg $wl$flag" compiler_flags="$compiler_flags $flag" done IFS="$save_ifs" arg=`$echo "X$arg" | $Xsed -e "s/^ //"` ;; -Wl,*) args=`$echo "X$arg" | $Xsed -e "$sed_quote_subst" -e 's/^-Wl,//'` arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" case $flag in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") flag="\"$flag\"" ;; esac arg="$arg $wl$flag" compiler_flags="$compiler_flags $wl$flag" linker_flags="$linker_flags $flag" done IFS="$save_ifs" arg=`$echo "X$arg" | $Xsed -e "s/^ //"` ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # Some other compiler flag. -* | +*) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac ;; *.$objext) # A standard object. objs="$objs $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if (${SED} -e '2q' $arg | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then pic_object= non_pic_object= # Read the .lo file # If there is no directory component, then add one. case $arg in */* | *\\*) . $arg ;; *) . ./$arg ;; esac if test -z "$pic_object" || \ test -z "$non_pic_object" || test "$pic_object" = none && \ test "$non_pic_object" = none; then $echo "$modename: cannot find name of object for \`$arg'" 1>&2 exit $EXIT_FAILURE fi # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi 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 dlfiles="$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. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. libobjs="$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 non_pic_objects="$non_pic_objects $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi fi else # Only an error if not doing a dry-run. if test -z "$run"; then $echo "$modename: \`$arg' is not a valid libtool object" 1>&2 exit $EXIT_FAILURE else # Dry-run case. # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi pic_object=`$echo "X${xdir}${objdir}/${arg}" | $Xsed -e "$lo2o"` non_pic_object=`$echo "X${xdir}${arg}" | $Xsed -e "$lo2o"` libobjs="$libobjs $pic_object" non_pic_objects="$non_pic_objects $non_pic_object" fi fi ;; *.$libext) # An archive. deplibs="$deplibs $arg" old_deplibs="$old_deplibs $arg" continue ;; *.la) # A libtool-controlled library. if test "$prev" = dlfiles; then # This library was specified with -dlopen. dlfiles="$dlfiles $arg" prev= elif test "$prev" = dlprefiles; then # The library was specified with -dlpreopen. dlprefiles="$dlprefiles $arg" prev= else deplibs="$deplibs $arg" 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. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" fi done # argument parsing loop if test -n "$prev"; then $echo "$modename: the \`$prevarg' option requires an argument" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" fi oldlibs= # calculate the name of the file, without its directory outputname=`$echo "X$output" | $Xsed -e 's%^.*/%%'` libobjs_save="$libobjs" if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$echo \"X\${$shlibpath_var}\" \| \$Xsed -e \'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\" output_objdir=`$echo "X$output" | $Xsed -e 's%/[^/]*$%%'` if test "X$output_objdir" = "X$output"; then output_objdir="$objdir" else output_objdir="$output_objdir/$objdir" fi # Create the object directory. if test ! -d "$output_objdir"; then $show "$mkdir $output_objdir" $run $mkdir $output_objdir status=$? if test "$status" -ne 0 && test ! -d "$output_objdir"; then exit $status fi fi # Determine the type of output case $output in "") $echo "$modename: you must specify an output file" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac case $host in *cygwin* | *mingw* | *pw32*) # don't eliminate duplications in $postdeps and $predeps duplicate_compiler_generated_deps=yes ;; *) duplicate_compiler_generated_deps=$duplicate_deps ;; 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 test "X$duplicate_deps" = "Xyes" ; then case "$libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi libs="$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 test "X$duplicate_compiler_generated_deps" = "Xyes" ; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) specialdeplibs="$specialdeplibs $pre_post_deps" ;; esac pre_post_deps="$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 link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) $echo "$modename: libraries can \`-dlopen' only libtool libraries: $file" 1>&2 exit $EXIT_FAILURE ;; 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 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% $dependency_libs" ;; esac 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) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then $echo "$modename: warning: \`-l' is ignored for archives/objects" 1>&2 continue fi if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi name=`$echo "X$deplib" | $Xsed -e 's/^-l//'` for searchdir in $newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path; 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 (${SED} -e '2q' $lib | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then library_names= old_library= case $lib in */* | *\\*) . $lib ;; *) . ./$lib ;; esac 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 ladir=`$echo "X$lib" | $Xsed -e 's%/[^/]*$%%'` test "X$ladir" = "X$lib" && ladir="." 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 -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test "$pass" = conv && continue newdependency_libs="$deplib $newdependency_libs" newlib_search_path="$newlib_search_path "`$echo "X$deplib" | $Xsed -e 's/^-L//'` ;; 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 newlib_search_path="$newlib_search_path "`$echo "X$deplib" | $Xsed -e 's/^-L//'` ;; *) $echo "$modename: warning: \`-L' is ignored for archives/objects" 1>&2 ;; esac # linkmode continue ;; # -L -R*) if test "$pass" = link; then dir=`$echo "X$deplib" | $Xsed -e 's/^-R//'` # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) lib="$deplib" ;; *.$libext) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) if test "$deplibs_check_method" != pass_all; 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 used here." else $echo $echo "*** Warning: Linking the shared library $output against the" $echo "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi 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. newdlprefiles="$newdlprefiles $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else newdlfiles="$newdlfiles $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else $echo "$modename: cannot find the library \`$lib'" 1>&2 exit $EXIT_FAILURE fi # Check to see that this really is a libtool archive. if (${SED} -e '2q' $lib | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then : else $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi ladir=`$echo "X$lib" | $Xsed -e 's%/[^/]*$%%'` test "X$ladir" = "X$lib" && ladir="." dlname= dlopen= dlpreopen= libdir= library_names= old_library= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no # Read the .la file case $lib in */* | *\\*) . $lib ;; *) . ./$lib ;; esac if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && dlfiles="$dlfiles $dlopen" test -n "$dlpreopen" && dlprefiles="$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 $echo "$modename: cannot find name of link library for \`$lib'" 1>&2 exit $EXIT_FAILURE fi # It is a libtool convenience library, so add in its objects. convenience="$convenience $ladir/$objdir/$old_library" old_convenience="$old_convenience $ladir/$objdir/$old_library" tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if test "X$duplicate_deps" = "Xyes" ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done elif test "$linkmode" != prog && test "$linkmode" != lib; then $echo "$modename: \`$lib' is not a convenience library" 1>&2 exit $EXIT_FAILURE fi continue fi # $pass = conv # Get the name of the library we link against. linklib= for l in $old_library $library_names; do linklib="$l" done if test -z "$linklib"; then $echo "$modename: cannot find name of link library for \`$lib'" 1>&2 exit $EXIT_FAILURE fi # This library was specified with -dlopen. if test "$pass" = dlopen; then if test -z "$libdir"; then $echo "$modename: cannot -dlopen a convenience library: \`$lib'" 1>&2 exit $EXIT_FAILURE 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. dlprefiles="$dlprefiles $lib $dependency_libs" else newdlfiles="$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 $echo "$modename: warning: cannot determine absolute directory name of \`$ladir'" 1>&2 $echo "$modename: passing it literally to the linker, although it might fail" 1>&2 abs_ladir="$ladir" fi ;; esac laname=`$echo "X$lib" | $Xsed -e 's%^.*/%%'` # Find the relevant object directory and library name. if test "X$installed" = Xyes; then if test ! -f "$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then $echo "$modename: warning: library \`$lib' was moved." 1>&2 dir="$ladir" absdir="$abs_ladir" libdir="$abs_ladir" else dir="$libdir" absdir="$libdir" fi else dir="$ladir/$objdir" absdir="$abs_ladir/$objdir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" fi # $installed = yes name=`$echo "X$laname" | $Xsed -e 's/\.la$//' -e 's/^lib//'` # This library was specified with -dlpreopen. if test "$pass" = dlpreopen; then if test -z "$libdir"; then $echo "$modename: cannot -dlpreopen a convenience library: \`$lib'" 1>&2 exit $EXIT_FAILURE fi # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then newdlprefiles="$newdlprefiles $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then newdlprefiles="$newdlprefiles $dir/$dlname" else newdlprefiles="$newdlprefiles $dir/$linklib" fi 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 newlib_search_path="$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*) newlib_search_path="$newlib_search_path "`$echo "X$deplib" | $Xsed -e 's/^-L//'`;; ### testsuite: skip nested quoting test 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 test "X$duplicate_deps" = "Xyes" ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$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 -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var"; then # Make sure the rpath contains only unique directories. case "$temp_rpath " in *" $dir "*) ;; *" $absdir "*) ;; *) temp_rpath="$temp_rpath $dir" ;; 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 "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$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 if test -n "$library_names" && { test "$prefer_static_libs" = no || test -z "$old_library"; }; then if test "$installed" = no; then notinst_deplibs="$notinst_deplibs $lib" need_relink=yes fi # This is a shared library # Warn about portability, can't link against -module's on # some systems (darwin) if 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 "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names realname="$2" shift; 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*) major=`expr $current - $age` versuffix="-$major" ;; esac eval soname=\"$soname_spec\" else soname="$realname" fi # Make a new name for the extract_expsyms_cmds to use soroot="$soname" soname=`$echo $soroot | ${SED} -e 's/^.*\///'` newlib="libimp-`$echo $soname | ${SED} 's/^lib//;s/\.dll$//'`.a" # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else $show "extracting exported symbol list from \`$soname'" save_ifs="$IFS"; IFS='~' cmds=$extract_expsyms_cmds for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else $show "generating import library for \`$soname'" save_ifs="$IFS"; IFS='~' cmds=$old_archive_from_expsyms_cmds for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" 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 "$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* ) add_dir="-L$dir" ;; *-*-darwin* ) # if the lib is a module then we can not link against # it, someone is ignoring the new warnings I added if /usr/bin/file -L $add 2> /dev/null | $EGREP "bundle" >/dev/null ; 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 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; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$dir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case "$libdir" in [\\/]*) add_dir="$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 $echo "$modename: configuration error: unsupported hardcode properties" exit $EXIT_FAILURE fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) compile_shlibpath="$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:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes; 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:"*) ;; *) finalize_shlibpath="$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 [\\/]*) add_dir="$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 convenience="$convenience $dir/$old_library" old_convenience="$old_convenience $dir/$old_library" 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*) temp_xrpath=`$echo "X$libdir" | $Xsed -e 's/^-R//'` case " $xrpath " in *" $temp_xrpath "*) ;; *) xrpath="$xrpath $temp_xrpath";; esac;; *) temp_deplibs="$temp_deplibs $libdir";; esac done dependency_libs="$temp_deplibs" fi newlib_search_path="$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" if test "X$duplicate_deps" = "Xyes" ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done if test "$link_all_deplibs" != no; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do case $deplib in -L*) path="$deplib" ;; *.la) dir=`$echo "X$deplib" | $Xsed -e 's%/[^/]*$%%'` test "X$dir" = "X$deplib" && dir="." # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then $echo "$modename: warning: cannot determine absolute directory name of \`$dir'" 1>&2 absdir="$dir" fi ;; esac if grep "^installed=no" $deplib > /dev/null; then path="$absdir/$objdir" else eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` if test -z "$libdir"; then $echo "$modename: \`$deplib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi if test "$absdir" != "$libdir"; then $echo "$modename: warning: \`$deplib' seems to be moved" 1>&2 fi path="$absdir" fi depdepl= case $host in *-*-darwin*) # we do not want to link against static libs, # but need to link against shared 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 "$path/$depdepl" ; then depdepl="$path/$depdepl" fi # do not add paths which are already there case " $newlib_search_path " in *" $path "*) ;; *) newlib_search_path="$newlib_search_path $path";; esac fi path="" ;; *) path="-L$path" ;; esac ;; -l*) case $host in *-*-darwin*) # Again, we only want to link against shared libraries eval tmp_libs=`$echo "X$deplib" | $Xsed -e "s,^\-l,,"` for tmp in $newlib_search_path ; do if test -f "$tmp/lib$tmp_libs.dylib" ; then eval depdepl="$tmp/lib$tmp_libs.dylib" break fi done path="" ;; *) continue ;; esac ;; *) continue ;; esac case " $deplibs " in *" $depdepl "*) ;; *) deplibs="$depdepl $deplibs" ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$deplibs $path" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs 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 "*) ;; *) lib_search_path="$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 "*) ;; *) tmp_libs="$tmp_libs $deplib" ;; esac ;; *) tmp_libs="$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 tmp_libs="$tmp_libs $i" fi done dependency_libs=$tmp_libs done # for pass if test "$linkmode" = prog; then dlfiles="$newdlfiles" dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$deplibs"; then $echo "$modename: warning: \`-l' and \`-L' are ignored for archives" 1>&2 fi if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then $echo "$modename: warning: \`-dlopen' is ignored for archives" 1>&2 fi if test -n "$rpath"; then $echo "$modename: warning: \`-rpath' is ignored for archives" 1>&2 fi if test -n "$xrpath"; then $echo "$modename: warning: \`-R' is ignored for archives" 1>&2 fi if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info/-version-number' is ignored for archives" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for archives" 1>&2 fi if test -n "$export_symbols" || test -n "$export_symbols_regex"; then $echo "$modename: warning: \`-export-symbols' is ignored for archives" 1>&2 fi # Now set the variables for building old libraries. build_libtool_libs=no oldlibs="$output" objs="$objs$old_deplibs" ;; lib) # Make sure we only generate libraries of the form `libNAME.la'. case $outputname in lib*) name=`$echo "X$outputname" | $Xsed -e 's/\.la$//' -e 's/^lib//'` eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) if test "$module" = no; then $echo "$modename: libtool library \`$output' must begin with \`lib'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test "$need_lib_prefix" != no; then # Add the "lib" prefix for modules if required name=`$echo "X$outputname" | $Xsed -e 's/\.la$//'` eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else libname=`$echo "X$outputname" | $Xsed -e 's/\.la$//'` fi ;; esac if test -n "$objs"; then if test "$deplibs_check_method" != pass_all; then $echo "$modename: cannot build libtool library \`$output' from non-libtool objects on this host:$objs" 2>&1 exit $EXIT_FAILURE else $echo $echo "*** Warning: Linking the shared library $output against the non-libtool" $echo "*** objects $objs is not portable!" libobjs="$libobjs $objs" fi fi if test "$dlself" != no; then $echo "$modename: warning: \`-dlopen self' is ignored for libtool libraries" 1>&2 fi set dummy $rpath if test "$#" -gt 2; then $echo "$modename: warning: ignoring multiple \`-rpath's for a libtool library" 1>&2 fi install_libdir="$2" 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 if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info/-version-number' is ignored for convenience libraries" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for convenience libraries" 1>&2 fi else # Parse the version information argument. save_ifs="$IFS"; IFS=':' set dummy $vinfo 0 0 0 IFS="$save_ifs" if test -n "$8"; then $echo "$modename: too many parameters to \`-version-info'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # 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="$2" number_minor="$3" number_revision="$4" # # 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 darwin|linux|osf|windows) current=`expr $number_major + $number_minor` age="$number_minor" revision="$number_revision" ;; freebsd-aout|freebsd-elf|sunos) current="$number_major" revision="$number_minor" age="0" ;; irix|nonstopux) current=`expr $number_major + $number_minor - 1` age="$number_minor" revision="$number_minor" ;; esac ;; no) current="$2" revision="$3" age="$4" ;; esac # Check that each of the things are valid numbers. case $current in [0-9]*) ;; *) $echo "$modename: CURRENT \`$current' is not a nonnegative integer" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE ;; esac case $revision in [0-9]*) ;; *) $echo "$modename: REVISION \`$revision' is not a nonnegative integer" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE ;; esac case $age in [0-9]*) ;; *) $echo "$modename: AGE \`$age' is not a nonnegative integer" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE ;; esac if test "$age" -gt "$current"; then $echo "$modename: AGE \`$age' is greater than the current interface number \`$current'" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE 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 major=.`expr $current - $age` versuffix="$major.$age.$revision" # Darwin ld doesn't like 0 for these options... minor_current=`expr $current + 1` 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) major=`expr $current - $age + 1` 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 iface=`expr $revision - $loop` loop=`expr $loop - 1` verstring="$verstring_prefix$major.$iface:$verstring" done # Before this point, $major must not contain `.'. major=.$major versuffix="$major.$revision" ;; linux) major=.`expr $current - $age` versuffix="$major.$age.$revision" ;; osf) major=.`expr $current - $age` 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 iface=`expr $current - $loop` loop=`expr $loop - 1` verstring="$verstring:${iface}.0" done # Make executables depend on our current version. verstring="$verstring:${current}.0" ;; sunos) major=".$current" versuffix=".$current.$revision" ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 filesystems. major=`expr $current - $age` versuffix="-$major" ;; *) $echo "$modename: unknown library version type \`$version_type'" 1>&2 $echo "Fatal configuration error. See the $PACKAGE docs for more information." 1>&2 exit $EXIT_FAILURE ;; 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 $echo "$modename: warning: undefined symbols not allowed in $host shared libraries" 1>&2 build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi if test "$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) ;; $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 removelist="$removelist $p" ;; *) ;; esac done if test -n "$removelist"; then $show "${rm}r $removelist" $run ${rm}r $removelist fi fi # Now set the variables for building old libraries. if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then oldlibs="$oldlibs $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$echo "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}'$/d' -e "$lo2o" | $NL2SP` fi # Eliminate all temporary directories. for path in $notinst_path; do lib_search_path=`$echo "$lib_search_path " | ${SED} -e 's% $path % %g'` deplibs=`$echo "$deplibs " | ${SED} -e 's% -L$path % %g'` dependency_libs=`$echo "$dependency_libs " | ${SED} -e '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 temp_xrpath="$temp_xrpath -R$libdir" case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$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 "*) ;; *) dlfiles="$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 "*) ;; *) dlprefiles="$dlprefiles $lib" ;; esac done if test "$build_libtool_libs" = yes; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework deplibs="$deplibs -framework System" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && continue ;; *) # Add libc to deplibs on all other systems if necessary. if test "$build_libtool_need_lc" = "yes"; then deplibs="$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. $rm conftest.c cat > conftest.c </dev/null` 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 "X$potlib" | $Xsed -e 's,[^/]*$,,'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null \ | ${SED} 10q \ | $EGREP "$file_magic_regex" > /dev/null; then newdeplibs="$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 else # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" fi done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method match_pattern_regex=`expr "$deplibs_check_method" : "$2 \(.*\)"` for a_deplib in $deplibs; do name="`expr $a_deplib : '-l\(.*\)'`" # If $name is empty we are operating on a -L argument. if test -n "$name" && test "$name" != "0"; then if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $a_deplib "*) newdeplibs="$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 newdeplibs="$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 else # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" fi done # Gone through all deplibs. ;; none | unknown | *) newdeplibs="" tmp_deplibs=`$echo "X $deplibs" | $Xsed -e 's/ -lc$//' \ -e '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 "X $tmp_deplibs" | ${SED} -e "1s,^X,," -e "s,$i,,"` done fi if $echo "X $tmp_deplibs" | $Xsed -e 's/[ ]//g' \ | grep . >/dev/null; then $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 fi ;; 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 is the System framework newdeplibs=`$echo "X $newdeplibs" | $Xsed -e 's/ -lc / -framework System /'` ;; 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 # 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 if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$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 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"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" dep_rpath="$dep_rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$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" if test -n "$hardcode_libdir_flag_spec_ld"; then eval dep_rpath=\"$hardcode_libdir_flag_spec_ld\" else eval dep_rpath=\"$hardcode_libdir_flag_spec\" fi fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$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 "$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 realname="$2" shift; 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" for link do linknames="$linknames $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$echo "X$libobjs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then $show "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $run $rm $export_symbols cmds=$export_symbols_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" if len=`expr "X$cmd" : ".*"` && test "$len" -le "$max_cmd_len" || test "$max_cmd_len" -le -1; then $show "$cmd" $run eval "$cmd" || exit $? skipped_export=false else # The command line is too long to execute in one step. $show "using reloadable object file for export list..." skipped_export=: fi done IFS="$save_ifs" if test -n "$export_symbols_regex"; then $show "$EGREP -e \"$export_symbols_regex\" \"$export_symbols\" > \"${export_symbols}T\"" $run eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' $show "$mv \"${export_symbols}T\" \"$export_symbols\"" $run eval '$mv "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then $run eval '$echo "X$include_expsyms" | $SP2NL >> "$export_symbols"' fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) tmp_deplibs="$tmp_deplibs $test_deplib" ;; esac done deplibs="$tmp_deplibs" if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" else gentop="$output_objdir/${outputname}x" $show "${rm}r $gentop" $run ${rm}r "$gentop" $show "$mkdir $gentop" $run $mkdir "$gentop" status=$? if test "$status" -ne 0 && test ! -d "$gentop"; then exit $status fi generated="$generated $gentop" for xlib in $convenience; do # Extract the objects. case $xlib in [\\/]* | [A-Za-z]:[\\/]*) xabs="$xlib" ;; *) xabs=`pwd`"/$xlib" ;; esac xlib=`$echo "X$xlib" | $Xsed -e 's%^.*/%%'` xdir="$gentop/$xlib" $show "${rm}r $xdir" $run ${rm}r "$xdir" $show "$mkdir $xdir" $run $mkdir "$xdir" status=$? if test "$status" -ne 0 && test ! -d "$xdir"; then exit $status fi # We will extract separately just the conflicting names and we will no # longer touch any unique names. It is faster to leave these extract # automatically by $AR in one run. $show "(cd $xdir && $AR x $xabs)" $run eval "(cd \$xdir && $AR x \$xabs)" || exit $? if ($AR t "$xabs" | sort | sort -uc >/dev/null 2>&1); then : else $echo "$modename: warning: object name conflicts; renaming object files" 1>&2 $echo "$modename: warning: to ensure that they will not overwrite" 1>&2 $AR t "$xabs" | sort | uniq -cd | while read -r count name do i=1 while test "$i" -le "$count" do # Put our $i before any first dot (extension) # Never overwrite any file name_to="$name" while test "X$name_to" = "X$name" || test -f "$xdir/$name_to" do name_to=`$echo "X$name_to" | $Xsed -e "s/\([^.]*\)/\1-$i/"` done $show "(cd $xdir && $AR xN $i $xabs '$name' && $mv '$name' '$name_to')" $run eval "(cd \$xdir && $AR xN $i \$xabs '$name' && $mv '$name' '$name_to')" || exit $? i=`expr $i + 1` done done fi libobjs="$libobjs "`find $xdir -name \*.$objext -print -o -name \*.lo -print | $NL2SP` done fi fi if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" linker_flags="$linker_flags $flag" fi # Make a backup of the uninstalled library when relinking if test "$mode" = relink; then $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:" && len=`expr "X$test_cmds" : ".*"` && test "$len" -le "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise. $echo "creating reloadable object files..." # 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 # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= delfiles= last_robj= k=1 output=$output_objdir/$save_output-${k}.$objext # Loop over the list of objects to be linked. for obj in $save_libobjs do eval test_cmds=\"$reload_cmds $objlist $last_robj\" if test "X$objlist" = X || { len=`expr "X$test_cmds" : ".*"` && test "$len" -le "$max_cmd_len"; }; then objlist="$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. eval concat_cmds=\"$reload_cmds $objlist $last_robj\" else # All subsequent reloadable object files will link in # the last one created. eval concat_cmds=\"\$concat_cmds~$reload_cmds $objlist $last_robj\" fi last_robj=$output_objdir/$save_output-${k}.$objext k=`expr $k + 1` output=$output_objdir/$save_output-${k}.$objext objlist=$obj len=1 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~ eval concat_cmds=\"\${concat_cmds}$reload_cmds $objlist $last_robj\" if ${skipped_export-false}; then $show "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $run $rm $export_symbols libobjs=$output # Append the command to create the export file. eval concat_cmds=\"\$concat_cmds~$export_symbols_cmds\" fi # Set up a command to remove the reloadale object files # after they are used. i=0 while test "$i" -lt "$k" do i=`expr $i + 1` delfiles="$delfiles $output_objdir/$save_output-${i}.$objext" done $echo "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" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" 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\" 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 # Append the command to remove the reloadable object files # to the just-reset $cmds. eval cmds=\"\$cmds~\$rm $delfiles\" fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" # Restore the uninstalled library and exit if test "$mode" = relink; then $run eval '(cd $output_objdir && $rm ${realname}T && $mv $realname ${realname}T && $mv "$realname"U $realname)' || exit $? exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then $show "(cd $output_objdir && $rm $linkname && $LN_S $realname $linkname)" $run 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 "$deplibs"; then $echo "$modename: warning: \`-l' and \`-L' are ignored for objects" 1>&2 fi if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then $echo "$modename: warning: \`-dlopen' is ignored for objects" 1>&2 fi if test -n "$rpath"; then $echo "$modename: warning: \`-rpath' is ignored for objects" 1>&2 fi if test -n "$xrpath"; then $echo "$modename: warning: \`-R' is ignored for objects" 1>&2 fi if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info' is ignored for objects" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for objects" 1>&2 fi case $output in *.lo) if test -n "$objs$old_deplibs"; then $echo "$modename: cannot build library object \`$output' from non-libtool objects" 1>&2 exit $EXIT_FAILURE fi libobj="$output" obj=`$echo "X$output" | $Xsed -e "$lo2o"` ;; *) libobj= obj="$output" ;; esac # Delete the old objects. $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 wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval reload_conv_objs=\"\$reload_objs $whole_archive_flag_spec\" else gentop="$output_objdir/${obj}x" $show "${rm}r $gentop" $run ${rm}r "$gentop" $show "$mkdir $gentop" $run $mkdir "$gentop" status=$? if test "$status" -ne 0 && test ! -d "$gentop"; then exit $status fi generated="$generated $gentop" for xlib in $convenience; do # Extract the objects. case $xlib in [\\/]* | [A-Za-z]:[\\/]*) xabs="$xlib" ;; *) xabs=`pwd`"/$xlib" ;; esac xlib=`$echo "X$xlib" | $Xsed -e 's%^.*/%%'` xdir="$gentop/$xlib" $show "${rm}r $xdir" $run ${rm}r "$xdir" $show "$mkdir $xdir" $run $mkdir "$xdir" status=$? if test "$status" -ne 0 && test ! -d "$xdir"; then exit $status fi # We will extract separately just the conflicting names and we will no # longer touch any unique names. It is faster to leave these extract # automatically by $AR in one run. $show "(cd $xdir && $AR x $xabs)" $run eval "(cd \$xdir && $AR x \$xabs)" || exit $? if ($AR t "$xabs" | sort | sort -uc >/dev/null 2>&1); then : else $echo "$modename: warning: object name conflicts; renaming object files" 1>&2 $echo "$modename: warning: to ensure that they will not overwrite" 1>&2 $AR t "$xabs" | sort | uniq -cd | while read -r count name do i=1 while test "$i" -le "$count" do # Put our $i before any first dot (extension) # Never overwrite any file name_to="$name" while test "X$name_to" = "X$name" || test -f "$xdir/$name_to" do name_to=`$echo "X$name_to" | $Xsed -e "s/\([^.]*\)/\1-$i/"` done $show "(cd $xdir && $AR xN $i $xabs '$name' && $mv '$name' '$name_to')" $run eval "(cd \$xdir && $AR xN $i \$xabs '$name' && $mv '$name' '$name_to')" || exit $? i=`expr $i + 1` done done fi reload_conv_objs="$reload_objs "`find $xdir -name \*.$objext -print -o -name \*.lo -print | $NL2SP` done fi fi # Create the old-style object. reload_objs="$objs$old_deplibs "`$echo "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}$'/d' -e '/\.lib$/d' -e "$lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test output="$obj" cmds=$reload_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then $show "${rm}r $gentop" $run ${rm}r $gentop fi exit $EXIT_SUCCESS fi if test "$build_libtool_libs" != yes; then if test -n "$gentop"; then $show "${rm}r $gentop" $run ${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" # $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" cmds=$reload_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" fi if test -n "$gentop"; then $show "${rm}r $gentop" $run ${rm}r $gentop fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) output=`$echo $output | ${SED} -e 's,.exe$,,;s,$,.exe,'` ;; esac if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info' is ignored for programs" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for programs" 1>&2 fi if test "$preload" = yes; then if test "$dlopen_support" = unknown && test "$dlopen_self" = unknown && test "$dlopen_self_static" = unknown; then $echo "$modename: warning: \`AC_LIBTOOL_DLOPEN' not used. Assuming no dlopen support." fi fi case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$echo "X $compile_deplibs" | $Xsed -e 's/ -lc / -framework System /'` finalize_deplibs=`$echo "X $finalize_deplibs" | $Xsed -e 's/ -lc / -framework System /'` ;; esac case $host in *darwin*) # Don't allow lazy linking, it breaks C++ global constructors if test "$tagname" = CXX ; then compile_command="$compile_command ${wl}-bind_at_load" finalize_command="$finalize_command ${wl}-bind_at_load" fi ;; esac compile_command="$compile_command $compile_deplibs" finalize_command="$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 "*) ;; *) finalize_rpath="$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"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2*) case :$dllsearchpath: in *":$libdir:"*) ;; *) dllsearchpath="$dllsearchpath:$libdir";; 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"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) finalize_perm_rpath="$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 "X$compile_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` finalize_command=`$echo "X$finalize_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` fi dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then if test -n "$NM" && test -n "$global_symbol_pipe"; then dlsyms="${outputname}S.c" else $echo "$modename: not configured to extract global symbols from dlpreopened files" 1>&2 fi fi if test -n "$dlsyms"; then case $dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist="$output_objdir/${outputname}.nm" $show "$rm $nlist ${nlist}S ${nlist}T" $run $rm "$nlist" "${nlist}S" "${nlist}T" # Parse the name list into a source file. $show "creating $output_objdir/$dlsyms" test -z "$run" && $echo > "$output_objdir/$dlsyms" "\ /* $dlsyms - symbol resolution table for \`$outputname' dlsym emulation. */ /* Generated by $PROGRAM - GNU $PACKAGE $VERSION$TIMESTAMP */ #ifdef __cplusplus extern \"C\" { #endif /* Prevent the only kind of declaration conflicts we can make. */ #define lt_preloaded_symbols some_other_symbol /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; then $show "generating symbol list for \`$output'" test -z "$run" && $echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$echo "X$objs$old_deplibs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` for arg in $progfiles; do $show "extracting global C symbols from \`$arg'" $run eval "$NM $arg | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $run eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' $run eval '$mv "$nlist"T "$nlist"' fi if test -n "$export_symbols_regex"; then $run eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' $run eval '$mv "$nlist"T "$nlist"' fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols="$output_objdir/$output.exp" $run $rm $export_symbols $run eval "${SED} -n -e '/^: @PROGRAM@$/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' else $run eval "${SED} -e 's/\([][.*^$]\)/\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$output.exp"' $run eval 'grep -f "$output_objdir/$output.exp" < "$nlist" > "$nlist"T' $run eval 'mv "$nlist"T "$nlist"' fi fi for arg in $dlprefiles; do $show "extracting global C symbols from \`$arg'" name=`$echo "$arg" | ${SED} -e 's%^.*/%%'` $run eval '$echo ": $name " >> "$nlist"' $run eval "$NM $arg | $global_symbol_pipe >> '$nlist'" done if test -z "$run"; then # 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/$dlsyms"' else $echo '/* NONE */' >> "$output_objdir/$dlsyms" fi $echo >> "$output_objdir/$dlsyms" "\ #undef lt_preloaded_symbols #if defined (__STDC__) && __STDC__ # define lt_ptr void * #else # define lt_ptr char * # define const #endif /* The mapping between symbol names and symbols. */ const struct { const char *name; lt_ptr address; } lt_preloaded_symbols[] = {\ " eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$dlsyms" $echo >> "$output_objdir/$dlsyms" "\ {0, (lt_ptr) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " fi pic_flag_for_symtable= 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*) case "$compile_command " in *" -static "*) ;; *) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND";; esac;; *-*-hpux*) case "$compile_command " in *" -static "*) ;; *) pic_flag_for_symtable=" $pic_flag";; esac esac # Now compile the dynamic symbol file. $show "(cd $output_objdir && $LTCC -c$no_builtin_flag$pic_flag_for_symtable \"$dlsyms\")" $run eval '(cd $output_objdir && $LTCC -c$no_builtin_flag$pic_flag_for_symtable "$dlsyms")' || exit $? # Clean up the generated files. $show "$rm $output_objdir/$dlsyms $nlist ${nlist}S ${nlist}T" $run $rm "$output_objdir/$dlsyms" "$nlist" "${nlist}S" "${nlist}T" # Transform the symbol file into the correct name. compile_command=`$echo "X$compile_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}S.${objext}%"` finalize_command=`$echo "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}S.${objext}%"` ;; *) $echo "$modename: unknown suffix for \`$dlsyms'" 1>&2 exit $EXIT_FAILURE ;; 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 "X$compile_command" | $Xsed -e "s% @SYMFILE@%%"` finalize_command=`$echo "X$finalize_command" | $Xsed -e "s% @SYMFILE@%%"` fi if test "$need_relink" = no || test "$build_libtool_libs" != yes; then # Replace the output file specification. compile_command=`$echo "X$compile_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` link_command="$compile_command$compile_rpath" # We have no uninstalled library dependencies, so finalize right now. $show "$link_command" $run eval "$link_command" status=$? # Delete the generated files. if test -n "$dlsyms"; then $show "$rm $output_objdir/${outputname}S.${objext}" $run $rm "$output_objdir/${outputname}S.${objext}" fi exit $status fi if test -n "$shlibpath_var"; then # We should set the shlibpath_var rpath= for dir in $temp_rpath; do case $dir in [\\/]* | [A-Za-z]:[\\/]*) # Absolute path. rpath="$rpath$dir:" ;; *) # Relative path: add a thisdir entry. rpath="$rpath\$thisdir/$dir:" ;; esac done temp_rpath="$rpath" 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 rpath="$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 rpath="$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 "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $run $rm $output # Link the executable and exit $show "$link_command" $run eval "$link_command" || exit $? 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" $echo "$modename: warning: this platform does not like uninstalled shared libraries" 1>&2 $echo "$modename: \`$output' will be relinked during installation" 1>&2 else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$echo "X$compile_var$compile_command$compile_rpath" | $Xsed -e '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 "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $run $rm $output $output_objdir/$outputname $output_objdir/lt-$outputname $show "$link_command" $run eval "$link_command" || exit $? # Now create the wrapper script. $show "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}\" || 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 var_value=`$echo "X$var_value" | $Xsed -e "$sed_quote_subst"` relink_command="$var=\"$var_value\"; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$echo "X$relink_command" | $Xsed -e "$sed_quote_subst"` fi # Quote $echo for shipping. if test "X$echo" = "X$SHELL $progpath --fallback-echo"; then case $progpath in [\\/]* | [A-Za-z]:[\\/]*) qecho="$SHELL $progpath --fallback-echo";; *) qecho="$SHELL `pwd`/$progpath --fallback-echo";; esac qecho=`$echo "X$qecho" | $Xsed -e "$sed_quote_subst"` else qecho=`$echo "X$echo" | $Xsed -e "$sed_quote_subst"` fi # Only actually do things if our run command is non-null. if test -z "$run"; then # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) output=`$echo $output|${SED} 's,.exe$,,'` ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe outputname=`$echo $outputname|${SED} 's,.exe$,,'` ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) cwrappersource=`$echo ${objdir}/lt-${output}.c` cwrapper=`$echo ${output}.exe` $rm $cwrappersource $cwrapper trap "$rm $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 cat > $cwrappersource <> $cwrappersource<<"EOF" #include #include #include #include #include #include #if defined(PATH_MAX) # define LT_PATHMAX PATH_MAX #elif defined(MAXPATHLEN) # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef DIR_SEPARATOR #define DIR_SEPARATOR '/' #endif #if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \ defined (__OS2__) #define HAVE_DOS_BASED_FILE_SYSTEM #ifndef DIR_SEPARATOR_2 #define DIR_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 */ #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free ((void *) stale); stale = 0; } \ } while (0) const char *program_name = NULL; void * xmalloc (size_t num); char * xstrdup (const char *string); char * basename (const char *name); char * fnqualify(const char *path); char * strendzap(char *str, const char *pat); void lt_fatal (const char *message, ...); int main (int argc, char *argv[]) { char **newargz; int i; program_name = (char *) xstrdup ((char *) basename (argv[0])); newargz = XMALLOC(char *, argc+2); EOF cat >> $cwrappersource <> $cwrappersource <<"EOF" newargz[1] = fnqualify(argv[0]); /* we know the script has the same name, without the .exe */ /* so make sure newargz[1] doesn't end in .exe */ strendzap(newargz[1],".exe"); for (i = 1; i < argc; i++) newargz[i+1] = xstrdup(argv[i]); newargz[argc+1] = NULL; EOF cat >> $cwrappersource <> $cwrappersource <<"EOF" } void * xmalloc (size_t num) { void * p = (void *) malloc (num); if (!p) lt_fatal ("Memory exhausted"); return p; } char * xstrdup (const char *string) { return string ? strcpy ((char *) xmalloc (strlen (string) + 1), string) : NULL ; } char * basename (const char *name) { const char *base; #if defined (HAVE_DOS_BASED_FILE_SYSTEM) /* Skip over the disk name in MSDOS pathnames. */ if (isalpha (name[0]) && name[1] == ':') name += 2; #endif for (base = name; *name; name++) if (IS_DIR_SEPARATOR (*name)) base = name + 1; return (char *) base; } char * fnqualify(const char *path) { size_t size; char *p; char tmp[LT_PATHMAX + 1]; assert(path != NULL); /* Is it qualified already? */ #if defined (HAVE_DOS_BASED_FILE_SYSTEM) if (isalpha (path[0]) && path[1] == ':') return xstrdup (path); #endif if (IS_DIR_SEPARATOR (path[0])) return xstrdup (path); /* prepend the current directory */ /* doesn't handle '~' */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); size = strlen(tmp) + 1 + strlen(path) + 1; /* +2 for '/' and '\0' */ p = XMALLOC(char, size); sprintf(p, "%s%c%s", tmp, DIR_SEPARATOR, path); return p; } 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; } static void lt_error_core (int exit_status, const char * mode, const char * message, va_list ap) { fprintf (stderr, "%s: %s: ", program_name, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, "FATAL", message, ap); va_end (ap); } EOF # we should really use a build-platform specific compiler # here, but OTOH, the wrappers (shell script and this C one) # are only useful if you want to execute the "real" binary. # Since the "real" binary is built for $host, then this # wrapper might as well be built for $host, too. $run $LTCC -s -o $cwrapper $cwrappersource ;; esac $rm $output trap "$rm $output; exit $EXIT_FAILURE" 1 2 15 $echo > $output "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM - GNU $PACKAGE $VERSION$TIMESTAMP # # 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. Xsed='${SED} -e 1s/^X//' sed_quote_subst='$sed_quote_subst' # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. if test \"\${CDPATH+set}\" = set; then CDPATH=:; export CDPATH; fi relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variable: 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 echo=\"$qecho\" file=\"\$0\" # Make sure echo works. if test \"X\$1\" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test \"X\`(\$echo '\t') 2>/dev/null\`\" = 'X\t'; then # Yippee, \$echo works! : else # Restart under the correct shell, and then maybe \$echo will work. exec $SHELL \"\$0\" --no-reexec \${1+\"\$@\"} fi fi\ " $echo >> $output "\ # Find the directory that this script lives in. thisdir=\`\$echo \"X\$file\" | \$Xsed -e '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 \"X\$file\" | \$Xsed -e '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 \"X\$file\" | \$Xsed -e 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | ${SED} -n 's/.*-> //p'\` done # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test "$fast_install" = yes; then $echo >> $output "\ 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 >> $output "\ # 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 $EXIT_FAILURE fi fi $mv \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $rm \"\$progdir/\$program\"; $mv \"\$progdir/\$file\" \"\$progdir/\$program\"; } $rm \"\$progdir/\$file\" fi" else $echo >> $output "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $echo >> $output "\ if test -f \"\$progdir/\$program\"; then" # Export our shlibpath_var if we have one. if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $echo >> $output "\ # 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 \"X\$$shlibpath_var\" | \$Xsed -e 's/::*\$//'\` export $shlibpath_var " fi # fixup the dll searchpath if we need to. if test -n "$dllsearchpath"; then $echo >> $output "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi $echo >> $output "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2*) $echo >> $output "\ exec \$progdir\\\\\$program \${1+\"\$@\"} " ;; *) $echo >> $output "\ exec \$progdir/\$program \${1+\"\$@\"} " ;; esac $echo >> $output "\ \$echo \"\$0: cannot exec \$program \${1+\"\$@\"}\" exit $EXIT_FAILURE 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 $EXIT_FAILURE fi fi\ " chmod +x $output fi 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" 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" fi addlibs="$old_convenience" fi if test -n "$addlibs"; then gentop="$output_objdir/${outputname}x" $show "${rm}r $gentop" $run ${rm}r "$gentop" $show "$mkdir $gentop" $run $mkdir "$gentop" status=$? if test "$status" -ne 0 && test ! -d "$gentop"; then exit $status fi generated="$generated $gentop" # Add in members from convenience archives. for xlib in $addlibs; do # Extract the objects. case $xlib in [\\/]* | [A-Za-z]:[\\/]*) xabs="$xlib" ;; *) xabs=`pwd`"/$xlib" ;; esac xlib=`$echo "X$xlib" | $Xsed -e 's%^.*/%%'` xdir="$gentop/$xlib" $show "${rm}r $xdir" $run ${rm}r "$xdir" $show "$mkdir $xdir" $run $mkdir "$xdir" status=$? if test "$status" -ne 0 && test ! -d "$xdir"; then exit $status fi # We will extract separately just the conflicting names and we will no # longer touch any unique names. It is faster to leave these extract # automatically by $AR in one run. $show "(cd $xdir && $AR x $xabs)" $run eval "(cd \$xdir && $AR x \$xabs)" || exit $? if ($AR t "$xabs" | sort | sort -uc >/dev/null 2>&1); then : else $echo "$modename: warning: object name conflicts; renaming object files" 1>&2 $echo "$modename: warning: to ensure that they will not overwrite" 1>&2 $AR t "$xabs" | sort | uniq -cd | while read -r count name do i=1 while test "$i" -le "$count" do # Put our $i before any first dot (extension) # Never overwrite any file name_to="$name" while test "X$name_to" = "X$name" || test -f "$xdir/$name_to" do name_to=`$echo "X$name_to" | $Xsed -e "s/\([^.]*\)/\1-$i/"` done $show "(cd $xdir && $AR xN $i $xabs '$name' && $mv '$name' '$name_to')" $run eval "(cd \$xdir && $AR xN $i \$xabs '$name' && $mv '$name' '$name_to')" || exit $? i=`expr $i + 1` done done fi oldobjs="$oldobjs "`find $xdir -name \*.${objext} -print -o -name \*.lo -print | $NL2SP` done 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 eval cmds=\"$old_archive_cmds\" if len=`expr "X$cmds" : ".*"` && test "$len" -le "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts $echo "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs # GNU ar 2.10+ was changed to match POSIX; thus no paths are # encoded into archives. This makes 'ar r' malfunction in # this piecewise linking case whenever conflicting object # names appear in distinct ar calls; check, warn and compensate. if (for obj in $save_oldobjs do $echo "X$obj" | $Xsed -e 's%^.*/%%' done | sort | sort -uc >/dev/null 2>&1); then : else $echo "$modename: warning: object name conflicts; overriding AR_FLAGS to 'cq'" 1>&2 $echo "$modename: warning: to ensure that POSIX-compatible ar will work" 1>&2 AR_FLAGS=cq fi # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done for obj in $save_oldobjs do oldobjs="$objlist $obj" objlist="$objlist $obj" eval test_cmds=\"$old_archive_cmds\" if len=`expr "X$test_cmds" : ".*"` && test "$len" -le "$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= 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 save_ifs="$IFS"; IFS='~' for cmd in $cmds; do eval cmd=\"$cmd\" IFS="$save_ifs" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" done if test -n "$generated"; then $show "${rm}r$generated" $run ${rm}r$generated fi # Now create the libtool archive. case $output in *.la) old_library= test "$build_old_libs" = yes && old_library="$libname.$libext" $show "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}\" || 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 var_value=`$echo "X$var_value" | $Xsed -e "$sed_quote_subst"` relink_command="$var=\"$var_value\"; 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 "X$relink_command" | $Xsed -e "$sed_quote_subst"` if test "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. if test -z "$run"; then 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) name=`$echo "X$deplib" | $Xsed -e 's%^.*/%%'` eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` if test -z "$libdir"; then $echo "$modename: \`$deplib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi newdependency_libs="$newdependency_libs $libdir/$name" ;; *) newdependency_libs="$newdependency_libs $deplib" ;; esac done dependency_libs="$newdependency_libs" newdlfiles= for lib in $dlfiles; do name=`$echo "X$lib" | $Xsed -e 's%^.*/%%'` eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` if test -z "$libdir"; then $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi newdlfiles="$newdlfiles $libdir/$name" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do name=`$echo "X$lib" | $Xsed -e 's%^.*/%%'` eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` if test -z "$libdir"; then $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi newdlprefiles="$newdlprefiles $libdir/$name" done dlprefiles="$newdlprefiles" else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlfiles="$newdlfiles $abs" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlprefiles="$newdlprefiles $abs" done dlprefiles="$newdlprefiles" fi $rm $output # place dlname in correct position for cygwin tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll) tdlname=../bin/$dlname ;; esac $echo > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM - GNU $PACKAGE $VERSION$TIMESTAMP # # 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' # Libraries that this one depends upon. dependency_libs='$dependency_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 fi # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. $show "(cd $output_objdir && $rm $outputname && $LN_S ../$outputname $outputname)" $run eval '(cd $output_objdir && $rm $outputname && $LN_S ../$outputname $outputname)' || exit $? ;; esac exit $EXIT_SUCCESS ;; # libtool install mode install) modename="$modename: install" # 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. $echo "X$nonopt" | $Xsed | grep shtool > /dev/null; then # Aesthetically quote it. arg=`$echo "X$nonopt" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*) arg="\"$arg\"" ;; esac install_prog="$arg " arg="$1" shift else install_prog= arg="$nonopt" fi # The real first argument should be the name of the installation program. # Aesthetically quote it. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*) arg="\"$arg\"" ;; esac install_prog="$install_prog$arg" # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=no stripme= for arg do if test -n "$dest"; then files="$files $dest" dest="$arg" continue fi case $arg in -d) isdir=yes ;; -f) prev="-f" ;; -g) prev="-g" ;; -m) prev="-m" ;; -o) prev="-o" ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then prev= else dest="$arg" continue fi ;; esac # Aesthetically quote the argument. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*) arg="\"$arg\"" ;; esac install_prog="$install_prog $arg" done if test -z "$install_prog"; then $echo "$modename: you must specify an install program" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test -n "$prev"; then $echo "$modename: the \`$prev' option requires an argument" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test -z "$files"; then if test -z "$dest"; then $echo "$modename: no file or destination specified" 1>&2 else $echo "$modename: you must specify a destination" 1>&2 fi $echo "$help" 1>&2 exit $EXIT_FAILURE fi # Strip any trailing slash from the destination. dest=`$echo "X$dest" | $Xsed -e 's%/$%%'` # Check to see that the destination is a directory. test -d "$dest" && isdir=yes if test "$isdir" = yes; then destdir="$dest" destname= else destdir=`$echo "X$dest" | $Xsed -e 's%/[^/]*$%%'` test "X$destdir" = "X$dest" && destdir=. destname=`$echo "X$dest" | $Xsed -e 's%^.*/%%'` # Not a directory, so check to see that there is only one file specified. set dummy $files if test "$#" -gt 2; then $echo "$modename: \`$dest' is not a directory" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) $echo "$modename: \`$destdir' must be an absolute directory name" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; 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. staticlibs="$staticlibs $file" ;; *.la) # Check to see that this really is a libtool archive. if (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then : else $echo "$modename: \`$file' is not a valid libtool archive" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi library_names= old_library= relink_command= # If there is no directory component, then add one. case $file in */* | *\\*) . $file ;; *) . ./$file ;; esac # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) current_libdirs="$current_libdirs $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) future_libdirs="$future_libdirs $libdir" ;; esac fi dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'`/ test "X$dir" = "X$file/" && dir= dir="$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 "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. if test "$inst_prefix_dir" = "$destdir"; then $echo "$modename: error: cannot install \`$file' to a directory not ending in $libdir" 1>&2 exit $EXIT_FAILURE fi 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 $echo "$modename: warning: relinking \`$file'" 1>&2 $show "$relink_command" if $run eval "$relink_command"; then : else $echo "$modename: error: relink \`$file' with the above command before installing it" 1>&2 exit $EXIT_FAILURE fi fi # See the names of the shared library. set dummy $library_names if test -n "$2"; then realname="$2" shift shift srcname="$realname" test -n "$relink_command" && srcname="$realname"T # Install the shared library and build the symlinks. $show "$install_prog $dir/$srcname $destdir/$realname" $run eval "$install_prog $dir/$srcname $destdir/$realname" || exit $? if test -n "$stripme" && test -n "$striplib"; then $show "$striplib $destdir/$realname" $run eval "$striplib $destdir/$realname" || exit $? fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. for linkname do if test "$linkname" != "$realname"; then $show "(cd $destdir && $rm $linkname && $LN_S $realname $linkname)" $run eval "(cd $destdir && $rm $linkname && $LN_S $realname $linkname)" fi done fi # Do each command in the postinstall commands. lib="$destdir/$realname" cmds=$postinstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" fi # Install the pseudo-library for information purposes. name=`$echo "X$file" | $Xsed -e 's%^.*/%%'` instname="$dir/$name"i $show "$install_prog $instname $destdir/$name" $run eval "$install_prog $instname $destdir/$name" || exit $? # Maybe install the static library, too. test -n "$old_library" && staticlibs="$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 destfile=`$echo "X$file" | $Xsed -e 's%^.*/%%'` destfile="$destdir/$destfile" fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) staticdest=`$echo "X$destfile" | $Xsed -e "$lo2o"` ;; *.$objext) staticdest="$destfile" destfile= ;; *) $echo "$modename: cannot copy a libtool object to \`$destfile'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; esac # Install the libtool object if requested. if test -n "$destfile"; then $show "$install_prog $file $destfile" $run eval "$install_prog $file $destfile" || exit $? fi # Install the old object if enabled. if test "$build_old_libs" = yes; then # Deduce the name of the old-style object file. staticobj=`$echo "X$file" | $Xsed -e "$lo2o"` $show "$install_prog $staticobj $staticdest" $run 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 destfile=`$echo "X$file" | $Xsed -e 's%^.*/%%'` 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 file=`$echo $file|${SED} 's,.exe$,,'` stripped_ext=".exe" fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin*|*mingw*) wrapper=`$echo $file | ${SED} -e 's,.exe$,,'` ;; *) wrapper=$file ;; esac if (${SED} -e '4q' $wrapper | grep "^# Generated by .*$PACKAGE")>/dev/null 2>&1; then notinst_deplibs= relink_command= # To insure that "foo" is sourced, and not "foo.exe", # finese the cygwin/MSYS system by explicitly sourcing "foo." # which disallows the automatic-append-.exe behavior. case $build in *cygwin* | *mingw*) wrapperdot=${wrapper}. ;; *) wrapperdot=${wrapper} ;; esac # If there is no directory component, then add one. case $file in */* | *\\*) . ${wrapperdot} ;; *) . ./${wrapperdot} ;; esac # Check the variables that should have been set. if test -z "$notinst_deplibs"; then $echo "$modename: invalid libtool wrapper script \`$wrapper'" 1>&2 exit $EXIT_FAILURE fi finalize=yes for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then # If there is no directory component, then add one. case $lib in */* | *\\*) . $lib ;; *) . ./$lib ;; esac fi libfile="$libdir/"`$echo "X$lib" | $Xsed -e 's%^.*/%%g'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then $echo "$modename: warning: \`$lib' has not been installed in \`$libdir'" 1>&2 finalize=no fi done relink_command= # To insure that "foo" is sourced, and not "foo.exe", # finese the cygwin/MSYS system by explicitly sourcing "foo." # which disallows the automatic-append-.exe behavior. case $build in *cygwin* | *mingw*) wrapperdot=${wrapper}. ;; *) wrapperdot=${wrapper} ;; esac # If there is no directory component, then add one. case $file in */* | *\\*) . ${wrapperdot} ;; *) . ./${wrapperdot} ;; esac outputname= if test "$fast_install" = no && test -n "$relink_command"; then if test "$finalize" = yes && test -z "$run"; then tmpdir="/tmp" test -n "$TMPDIR" && tmpdir="$TMPDIR" tmpdir="$tmpdir/libtool-$$" save_umask=`umask` umask 0077 if $mkdir "$tmpdir"; then umask $save_umask else umask $save_umask $echo "$modename: error: cannot create temporary directory \`$tmpdir'" 1>&2 continue fi file=`$echo "X$file$stripped_ext" | $Xsed -e 's%^.*/%%'` outputname="$tmpdir/$file" # Replace the output file specification. relink_command=`$echo "X$relink_command" | $Xsed -e 's%@OUTPUT@%'"$outputname"'%g'` $show "$relink_command" if $run eval "$relink_command"; then : else $echo "$modename: error: relink \`$file' with the above command before installing it" 1>&2 ${rm}r "$tmpdir" continue fi file="$outputname" else $echo "$modename: warning: cannot relink \`$file'" 1>&2 fi else # Install the binary that we compiled earlier. file=`$echo "X$file$stripped_ext" | $Xsed -e "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyways case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) destfile=`$echo $destfile | ${SED} -e 's,.exe$,,'` ;; esac ;; esac $show "$install_prog$stripme $file $destfile" $run eval "$install_prog\$stripme \$file \$destfile" || exit $? test -n "$outputname" && ${rm}r "$tmpdir" ;; esac done for file in $staticlibs; do name=`$echo "X$file" | $Xsed -e 's%^.*/%%'` # Set up the ranlib parameters. oldlib="$destdir/$name" $show "$install_prog $file $oldlib" $run eval "$install_prog \$file \$oldlib" || exit $? if test -n "$stripme" && test -n "$old_striplib"; then $show "$old_striplib $oldlib" $run eval "$old_striplib $oldlib" || exit $? fi # Do each command in the postinstall commands. cmds=$old_postinstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" done if test -n "$future_libdirs"; then $echo "$modename: warning: remember to run \`$progname --finish$future_libdirs'" 1>&2 fi if test -n "$current_libdirs"; then # Maybe just do a dry run. test -n "$run" && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi ;; # libtool finish mode finish) modename="$modename: finish" libdirs="$nonopt" admincmds= if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for dir do libdirs="$libdirs $dir" done for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. cmds=$finish_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || admincmds="$admincmds $cmd" done IFS="$save_ifs" fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $run eval "$cmds" || admincmds="$admincmds $cmds" fi done fi # Exit here if they wanted silent mode. test "$show" = : && exit $EXIT_SUCCESS $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" $echo "more information, such as the ld(1) and ld.so(8) manual pages." $echo "----------------------------------------------------------------------" exit $EXIT_SUCCESS ;; # libtool execute mode execute) modename="$modename: execute" # The first argument is the command name. cmd="$nonopt" if test -z "$cmd"; then $echo "$modename: you must specify a COMMAND" 1>&2 $echo "$help" exit $EXIT_FAILURE fi # Handle -dlopen flags immediately. for file in $execute_dlfiles; do if test ! -f "$file"; then $echo "$modename: \`$file' is not a file" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi dir= case $file in *.la) # Check to see that this really is a libtool archive. if (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then : else $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # Read the libtool library. dlname= library_names= # If there is no directory component, then add one. case $file in */* | *\\*) . $file ;; *) . ./$file ;; esac # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && $echo "$modename: warning: \`$file' was not linked with \`-export-dynamic'" continue fi dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'` test "X$dir" = "X$file" && dir=. if test -f "$dir/$objdir/$dlname"; then dir="$dir/$objdir" else $echo "$modename: cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'" 1>&2 exit $EXIT_FAILURE fi ;; *.lo) # Just add the directory containing the .lo file. dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'` test "X$dir" = "X$file" && dir=. ;; *) $echo "$modename: warning \`-dlopen' is ignored for non-libtool libraries and objects" 1>&2 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 -*) ;; *) # Do a test to see if this is really a libtool program. if (${SED} -e '4q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then # If there is no directory component, then add one. case $file in */* | *\\*) . $file ;; *) . ./$file ;; esac # Transform arg to wrapped name. file="$progdir/$program" fi ;; esac # Quote arguments (to preserve shell metacharacters). file=`$echo "X$file" | $Xsed -e "$sed_quote_subst"` args="$args \"$file\"" done if test -z "$run"; then if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables if test "${save_LC_ALL+set}" = set; then LC_ALL="$save_LC_ALL"; export LC_ALL fi if test "${save_LANG+set}" = set; then LANG="$save_LANG"; export LANG fi # 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 ;; # libtool clean and uninstall mode clean | uninstall) modename="$modename: $mode" 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) rm="$rm $arg"; rmforce=yes ;; -*) rm="$rm $arg" ;; *) files="$files $arg" ;; esac done if test -z "$rm"; then $echo "$modename: you must specify an RM program" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi rmdirs= origobjdir="$objdir" for file in $files; do dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'` if test "X$dir" = "X$file"; then dir=. objdir="$origobjdir" else objdir="$dir/$origobjdir" fi name=`$echo "X$file" | $Xsed -e 's%^.*/%%'` test "$mode" = uninstall && objdir="$dir" # Remember objdir for removal later, being careful to avoid duplicates if test "$mode" = clean; then case " $rmdirs " in *" $objdir "*) ;; *) rmdirs="$rmdirs $objdir" ;; 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 (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then . $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do rmfiles="$rmfiles $objdir/$n" done test -n "$old_library" && rmfiles="$rmfiles $objdir/$old_library" test "$mode" = clean && rmfiles="$rmfiles $objdir/$name $objdir/${name}i" if test "$mode" = uninstall; then if test -n "$library_names"; then # Do each command in the postuninstall commands. cmds=$postuninstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" if test "$?" -ne 0 && test "$rmforce" != yes; then exit_status=1 fi done IFS="$save_ifs" fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. cmds=$old_postuninstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" if test "$?" -ne 0 && test "$rmforce" != yes; then exit_status=1 fi done IFS="$save_ifs" fi # FIXME: should reinstall the best remaining shared library. fi fi ;; *.lo) # Possibly a libtool object, so verify it. if (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then # Read the .lo file . $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" \ && test "$pic_object" != none; then rmfiles="$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 rmfiles="$rmfiles $dir/$non_pic_object" fi fi ;; *) if test "$mode" = clean ; then noexename=$name case $file in *.exe) file=`$echo $file|${SED} 's,.exe$,,'` noexename=`$echo $name|${SED} 's,.exe$,,'` # $file with .exe has already been added to rmfiles, # add $file without .exe rmfiles="$rmfiles $file" ;; esac # Do a test to see if this is a libtool program. if (${SED} -e '4q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then relink_command= . $dir/$noexename # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles rmfiles="$rmfiles $objdir/$name $objdir/${name}S.${objext}" if test "$fast_install" = yes && test -n "$relink_command"; then rmfiles="$rmfiles $objdir/lt-$name" fi if test "X$noexename" != "X$name" ; then rmfiles="$rmfiles $objdir/lt-${noexename}.c" fi fi fi ;; esac $show "$rm $rmfiles" $run $rm $rmfiles || exit_status=1 done objdir="$origobjdir" # Try to remove the ${objdir}s in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then $show "rmdir $dir" $run rmdir $dir >/dev/null 2>&1 fi done exit $exit_status ;; "") $echo "$modename: you must specify a MODE" 1>&2 $echo "$generic_help" 1>&2 exit $EXIT_FAILURE ;; esac if test -z "$exec_cmd"; then $echo "$modename: invalid operation mode \`$mode'" 1>&2 $echo "$generic_help" 1>&2 exit $EXIT_FAILURE fi fi # test -z "$show_help" if test -n "$exec_cmd"; then eval exec $exec_cmd exit $EXIT_FAILURE fi # We need to display help for each of the modes. case $mode in "") $echo \ "Usage: $modename [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 --finish same as \`--mode=finish' --help display this help message and exit --mode=MODE use operation mode MODE [default=inferred from MODE-ARGS] --quiet same as \`--silent' --silent don't print informational messages --tag=TAG use configuration variables from tag TAG --version print version information 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. Try \`$modename --help --mode=MODE' for a more detailed description of MODE. Report bugs to ." exit $EXIT_SUCCESS ;; clean) $echo \ "Usage: $modename [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: $modename [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 -prefer-pic try to building PIC objects only -prefer-non-pic try to building non-PIC objects only -static always build a \`.o' file suitable for static linking 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: $modename [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: $modename [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: $modename [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 rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $echo \ "Usage: $modename [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 -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 -static do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] 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: $modename [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." ;; *) $echo "$modename: invalid operation mode \`$mode'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; esac $echo $echo "Try \`$modename --help' for more information about other modes." exit $EXIT_SUCCESS # 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: coreseek-4.1-beta/csft-4.1/api/libsphinxclient/Makefile.am100777 0 0 517 11643565730 16446 0AUTOMAKE_OPTIONS = foreign no-dependencies lib_LTLIBRARIES = libsphinxclient.la noinst_PROGRAMS = test libsphinxclient_la_SOURCES = sphinxclient.c test_SOURCES = test.c libsphinxclient_la_LIBADD = @LTLIBOBJS@ libsphinxclient_la_LDFLAGS = -release @VERSION@ include_HEADERS = sphinxclient.h test_LDADD = .libs/libsphinxclient.a coreseek-4.1-beta/csft-4.1/api/libsphinxclient/missing100777 0 0 24533 11643565730 16052 0#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2004-09-07.08 # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004 # Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA # 02111-1307, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case "$1" in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file tar try tar, gnutar, gtar, then tar without non-portable flags yacc create \`y.tab.[ch]', if possible, from existing .[ch] Send bug reports to ." exit 0 ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit 0 ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). case "$1" in lex|yacc) # Not GNU programs, they don't have --version. ;; tar) if test -n "$run"; then echo 1>&2 "ERROR: \`tar' requires --run" exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then exit 1 fi ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case "$1" in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case "$f" in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n 's/.*--output[ =]*\([^ ]*\).*/\1/p'` test -z "$file" && file=`echo "$*" | sed -n 's/.*-o[ ]*\([^ ]*\).*/\1/p'` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison|yacc) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if [ $# -ne 1 ]; then eval LASTARG="\${$#}" case "$LASTARG" in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" y.tab.h fi ;; esac fi if [ ! -f y.tab.h ]; then echo >y.tab.h fi if [ ! -f y.tab.c ]; then echo 'main() { return 0; }' >y.tab.c fi ;; lex|flex) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if [ $# -ne 1 ]; then eval LASTARG="\${$#}" case "$LASTARG" in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if [ ! -f lex.yy.c ]; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` if test -z "$file"; then file=`echo "$*" | sed -n 's/.*--output=\([^ ]*\).*/\1/p'` fi if [ -f "$file" ]; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit 1 fi ;; makeinfo) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` if test -z "$file"; then file=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n '/^@setfilename/ { s/.* \([^ ]*\) *$/\1/; p; q; }' $file` fi touch $file ;; tar) shift # We have already tried tar in the generic part. # Look for gnutar/gtar before invocation to avoid ugly error # messages. if (gnutar --version > /dev/null 2>&1); then gnutar "$@" && exit 0 fi if (gtar --version > /dev/null 2>&1); then gtar "$@" && exit 0 fi firstarg="$1" if shift; then case "$firstarg" in *o*) firstarg=`echo "$firstarg" | sed s/o//` tar "$firstarg" "$@" && exit 0 ;; esac case "$firstarg" in *h*) firstarg=`echo "$firstarg" | sed s/h//` tar "$firstarg" "$@" && exit 0 ;; esac fi echo 1>&2 "\ WARNING: I can't seem to be able to run \`tar' with the given arguments. You may want to install GNU tar or Free paxutils, or check the command line arguments." exit 1 ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: coreseek-4.1-beta/csft-4.1/api/libsphinxclient/README100777 0 0 2656 11643565730 15320 0Pure C searchd client API library Sphinx search engine, http://sphinxsearch.com/ API notes ---------- 1. API can either copy the contents of passed pointer arguments, or rely on the application that the pointer will not become invalid. This is controlled on per-client basis; see 'copy_args' argument to the sphinx_create() call. When 'copy_args' is true, API will create and manage a copy of every string and array passed to it. This causes additional malloc() pressure, but makes calling code easier to write. When 'copy_args' is false, API expects that pointers passed to sphinx_set_xxx() calls will still be valid at the time when sphinx_query() or sphinx_add_query() are called. Rule of thumb: when 'copy_args' is false, do not free query arguments until you have the search result. Example code for that case: VALID CODE: char * my_filter_name; my_filter_name = malloc ( 256 ); strncpy ( my_filter_name, "test", 256 ); sphinx_add_filter_range ( client, my_filter_name, 10, 20, false ); result = sphinx_query ( client ); free ( my_filter_name ); my_filter_name = NULL; INVALID CODE: void setup_my_filter ( sphinx_client * client ) { char buffer[256]; strncpy ( buffer, "test", sizeof(buffer) ); // INVALID! by the time when sphinx_query() is called, // buffer will be out of scope sphinx_add_filter_range ( client, buffer, 10, 20, false ); } setup_my_filter ( client ); result = sphinx_query ( client ); --eof-- coreseek-4.1-beta/csft-4.1/api/libsphinxclient/smoke_ref.txt100777 0 0 22402 11643565730 17162 0exact_phrase=0 n=1, res=this is my test text to be highlighted ... n=2, res=another test text to be highlighted, below limit n=3, res=test number three, without phrase match n=4, res=final test, not only without ... with swapped phrase text test as well exact_phrase=1 n=1, res=this is my test text to be highlighted ... n=2, res=another test text to be highlighted, below limit n=3, res=test number three, without phrase match n=4, res=final test, not only without phrase match, but also above ... passage_boundary=zone n=1, res= ... manager it. Is Filing this report and. It is signed hereby represent. That it is all information.are It or is cool It is cooler It is another ... passage_boundary=sentence n=1, res= ... The institutional investment manager it. ... Is Filing this report and. ... It is signed hereby represent. ... That it is all information.are It or is cool It is cooler It is another place! ... build_keywords result: 1. tokenized=hello, normalized=hello, docs=0, hits=0 2. tokenized=test, normalized=test, docs=3, hits=5 3. tokenized=one, normalized=one, docs=1, hits=2 Query 'is' retrieved 4 of 4 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) 2. doc_id=2, weight=1304, idd=2, group_id=1, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6) 3. doc_id=3, weight=1304, idd=3, group_id=2, tag=(15), tag64=(15), tag2=(15) 4. doc_id=4, weight=1304, idd=4, group_id=2, tag=(7,40), tag64=(7,40), tag2=(7,40) Query 'is test' retrieved 3 of 3 matches. Query stats: 'is' found 4 times in 4 documents 'test' found 5 times in 3 documents Matches: 1. doc_id=1, weight=101362, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) 2. doc_id=2, weight=101362, idd=2, group_id=1, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6) 3. doc_id=4, weight=1373, idd=4, group_id=2, tag=(7,40), tag64=(7,40), tag2=(7,40) Query 'test number' retrieved 3 of 3 matches. Query stats: 'test' found 5 times in 3 documents 'number' found 3 times in 3 documents Matches: 1. doc_id=4, weight=101442, idd=4, group_id=2, tag=(7,40), tag64=(7,40), tag2=(7,40) 2. doc_id=1, weight=101432, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) 3. doc_id=2, weight=101432, idd=2, group_id=1, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6) Query 'is' retrieved 2 of 2 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=1, @count=2 2. doc_id=3, weight=1304, idd=3, group_id=2, tag=(15), tag64=(15), tag2=(15), @groupby=2, @count=2 Query 'is' retrieved 9 of 9 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=1, @count=1 2. doc_id=2, weight=1304, idd=2, group_id=1, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), @groupby=2, @count=1 3. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=3, @count=1 4. doc_id=2, weight=1304, idd=2, group_id=1, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), @groupby=4, @count=1 5. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=5, @count=1 6. doc_id=2, weight=1304, idd=2, group_id=1, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), @groupby=6, @count=1 7. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=7, @count=2 8. doc_id=3, weight=1304, idd=3, group_id=2, tag=(15), tag64=(15), tag2=(15), @groupby=15, @count=1 9. doc_id=4, weight=1304, idd=4, group_id=2, tag=(7,40), tag64=(7,40), tag2=(7,40), @groupby=40, @count=1 Query 'is' retrieved 2 of 2 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) 2. doc_id=2, weight=1304, idd=2, group_id=1, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6) Query 'is' retrieved 2 of 2 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) 2. doc_id=4, weight=1304, idd=4, group_id=2, tag=(7,40), tag64=(7,40), tag2=(7,40) update success, 1 rows updated update mva success, 1 rows updated Query 'is' retrieved 4 of 4 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=4, weight=1304, idd=4, group_id=2, tag=(7,40), tag64=(7,40), tag2=(7,40) 2. doc_id=3, weight=1304, idd=3, group_id=2, tag=(7,77,177), tag64=(15), tag2=(15) 3. doc_id=2, weight=1304, idd=2, group_id=123, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6) 4. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) update success, 1 rows updated update success, 1 rows updated Query 'is' retrieved 4 of 4 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) 2. doc_id=2, weight=1304, idd=2, group_id=123, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6) 3. doc_id=3, weight=1304, idd=3, group_id=123, tag=(7,77,177), tag64=(15), tag2=(15) 4. doc_id=4, weight=1304, idd=4, group_id=123, tag=(7,40), tag64=(7,40), tag2=(7,40) Query 'is' retrieved 2 of 2 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=1, @count=1 2. doc_id=2, weight=1304, idd=2, group_id=123, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), @groupby=123, @count=3 Query 'is' retrieved 10 of 10 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=1, @count=1 2. doc_id=2, weight=1304, idd=2, group_id=123, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), @groupby=2, @count=1 3. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=3, @count=1 4. doc_id=2, weight=1304, idd=2, group_id=123, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), @groupby=4, @count=1 5. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=5, @count=1 6. doc_id=2, weight=1304, idd=2, group_id=123, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), @groupby=6, @count=1 7. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), @groupby=7, @count=3 8. doc_id=4, weight=1304, idd=4, group_id=123, tag=(7,40), tag64=(7,40), tag2=(7,40), @groupby=40, @count=1 9. doc_id=3, weight=1304, idd=3, group_id=123, tag=(7,77,177), tag64=(15), tag2=(15), @groupby=77, @count=1 10. doc_id=3, weight=1304, idd=3, group_id=123, tag=(7,77,177), tag64=(15), tag2=(15), @groupby=177, @count=1 Query 'is' retrieved 1 of 1 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) Query 'is' retrieved 3 of 3 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7) 2. doc_id=3, weight=1304, idd=3, group_id=123, tag=(7,77,177), tag64=(15), tag2=(15) 3. doc_id=4, weight=1304, idd=4, group_id=123, tag=(7,40), tag64=(7,40), tag2=(7,40) Query 'is' retrieved 4 of 4 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, group_id=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), q=1010 2. doc_id=2, weight=1304, idd=2, group_id=123, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), q=123020 3. doc_id=3, weight=1304, idd=3, group_id=123, tag=(7,77,177), tag64=(15), tag2=(15), q=123030 4. doc_id=4, weight=1304, idd=4, group_id=123, tag=(7,40), tag64=(7,40), tag2=(7,40), q=123040 Query 'is' retrieved 4 of 4 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), group_id=1, q=1010 2. doc_id=2, weight=1304, idd=2, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), group_id=2000, q=2000020 3. doc_id=3, weight=1304, idd=3, tag=(7,77,177), tag64=(15), tag2=(15), group_id=123, q=123030 4. doc_id=4, weight=1304, idd=4, tag=(7,40), tag64=(7,40), tag2=(7,40), group_id=123, q=123040 Query 'is' retrieved 3 of 3 matches. Query stats: 'is' found 4 times in 4 documents Matches: 1. doc_id=1, weight=1304, idd=1, tag=(1,3,5,7), tag64=(1,3,5,7), tag2=(1,3,5,7), group_id=1, q=1010, @groupby=1, @count=1 2. doc_id=3, weight=1304, idd=3, tag=(7,77,177), tag64=(15), tag2=(15), group_id=123, q=123030, @groupby=123, @count=2 3. doc_id=2, weight=1304, idd=2, tag=(2,4,6), tag64=(2,4,6), tag2=(2,4,6), group_id=2000, q=2000020, @groupby=2000, @count=1 connections: 17 maxed_out: 0 command_search: 16 command_excerpt: 4 command_update: 4 command_keywords: 1 command_persist: 1 command_status: 1 command_flushattrs: 0 agent_connect: 0 agent_retry: 0 queries: 16 dist_queries: 0 query_cpu: OFF dist_local: 0.000 dist_wait: 0.000 query_reads: OFF query_readkb: OFF avg_query_cpu: OFF avg_dist_local: 0.000 avg_dist_wait: 0.000 avg_query_reads: OFF avg_query_readkb: OFF coreseek-4.1-beta/csft-4.1/api/libsphinxclient/smoke_test.conf100777 0 0 1657 11643565730 17464 0 source src1 { type = mysql sql_host = localhost sql_user = test sql_pass = sql_db = test sql_port = 3306 # optional, default is 3306 sql_query = SELECT id, id as idd, group_id, title, content FROM documents sql_attr_uint = group_id sql_attr_uint = idd sql_attr_multi = uint tag from query; SELECT docid, tagid FROM tags sql_attr_multi = bigint tag64 from query; SELECT docid, tagid FROM tags sql_attr_multi = uint tag2 from query; SELECT docid, tagid FROM tags } index test1 { source = src1 path = ../../test/data/test1 docinfo = extern charset_type = utf-8 } indexer { mem_limit = 32M } searchd { listen = 10312 listen = 10306:mysql41 read_timeout = 5 max_children = 30 pid_file = searchd.pid log = ../../test/searchd.log query_log = ../../test/query.log max_matches = 1000 workers = threads # for RT to work binlog_path = } coreseek-4.1-beta/csft-4.1/api/libsphinxclient/smoke_test.sh100777 0 0 1637 11643565730 17147 0#!/bin/sh FAILLOG="/tmp/faillog1" DIFF='smoke_diff.txt' RES='smoke_test.txt' REF='smoke_ref.txt' LINE='-----------------------------\n' die() { cat $FAILLOG echo $LINE [ ! "z$2" = "z" ] && { eval $2; echo "$LINE"; } echo "C API:$1" [ -e "$FAILLOG" ] && rm $FAILLOG exit 1 } cmd () { echo "Executing: $1\n">$FAILLOG eval $1 1>>$FAILLOG 2>&1 || die "$2" "$3" } cmd "./configure --with-debug" "configure failed" cmd "make clean" "make clean failed" cmd "make" "make failed" cmd "../../src/indexer -c smoke_test.conf --all" "indexing failed" cmd "../../src/searchd -c smoke_test.conf --test" "searchd start failed" cmd "./test --smoke --port 10312>$RES" "test --smoke --port 10312 failed" cmd "../../src/searchd -c smoke_test.conf --stop" "searchd stop failed" cmd "make clean" " " cmd "diff --unified=3 $REF $RES >$DIFF" 'diff failed' "cat $DIFF" rm $RES rm $DIFF rm $FAILLOG echo "all ok" exit 0 coreseek-4.1-beta/csft-4.1/api/libsphinxclient/sphinxclient.c100777 0 0 170253 11643565730 17353 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU Library General Public License. You should // have received a copy of the LGPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #ifdef _WIN32 #if _MSC_VER>=1400 // VS 2005 and above #define _CRT_SECURE_NO_DEPRECATE 1 #define _CRT_NONSTDC_NO_DEPRECATE 1 #else // VS 2003 and below #define vsnprintf _vsnprintf #endif #endif #include #include #include #include #ifndef _WIN32 #include "sphinxclient_config.h" #endif #include "sphinxclient.h" #if _WIN32 // Win-specific headers, calls, libraries #include #include #pragma comment(linker, "/defaultlib:wsock32.lib") #pragma message("Automatically linking with wsock32.lib") #define EWOULDBLOCK WSAEWOULDBLOCK #define EINTR WSAEINTR #else // UNIX-specific headers and calls #include #include #include #include #include #include #include #include #include #endif ////////////////////////////////////////////////////////////////////////// #define MAX_REQS 32 #define CONNECT_TIMEOUT_MSEC 1000 #define MAX_PACKET_LEN (8*1024*1024) enum { SEARCHD_COMMAND_SEARCH = 0, SEARCHD_COMMAND_EXCERPT = 1, SEARCHD_COMMAND_UPDATE = 2, SEARCHD_COMMAND_KEYWORDS = 3, SEARCHD_COMMAND_PERSIST = 4, SEARCHD_COMMAND_STATUS = 5 }; enum { VER_COMMAND_EXCERPT = 0x103, VER_COMMAND_UPDATE = 0x102, VER_COMMAND_KEYWORDS = 0x100, VER_COMMAND_STATUS = 0x100 }; ////////////////////////////////////////////////////////////////////////// struct st_filter { const char * attr; int filter_type; int num_values; const sphinx_int64_t * values; sphinx_int64_t umin; sphinx_int64_t umax; float fmin; float fmax; int exclude; }; union un_attr_value { sphinx_int64_t int_value; float float_value; unsigned int * mva_value; const char * string; }; struct st_override { const char * attr; const sphinx_uint64_t * docids; int num_values; const unsigned int * uint_values; }; struct st_sphinx_client { unsigned short ver_search; ///< compatibility mode sphinx_bool copy_args; ///< whether to create a copy of each passed argument void * head_alloc; ///< head of client-owned allocations list const char * error; ///< last error const char * warning; ///< last warning char local_error_buf[256]; ///< buffer to store 'local' error messages (eg. connect() error) const char * host; int port; float timeout; int offset; int limit; int mode; int num_weights; const int * weights; int sort; const char * sortby; sphinx_uint64_t minid; sphinx_uint64_t maxid; const char * group_by; int group_func; const char * group_sort; const char * group_distinct; int max_matches; int cutoff; int retry_count; int retry_delay; const char * geoanchor_attr_lat; const char * geoanchor_attr_long; float geoanchor_lat; float geoanchor_long; int num_filters; int max_filters; struct st_filter * filters; int num_index_weights; const char ** index_weights_names; const int * index_weights_values; int ranker; int max_query_time; int num_field_weights; const char ** field_weights_names; const int * field_weights_values; int num_overrides; int max_overrides; struct st_override * overrides; const char * select_list; int num_reqs; int req_lens [ MAX_REQS ]; char * reqs [ MAX_REQS ]; int response_len; char * response_buf; ///< where the buffer begins (might also contain heading warning) char * response_start; ///< where the data to parse starts int num_results; sphinx_result results [ MAX_REQS ]; int sock; ///< open socket for pconns; -1 if none sphinx_bool persist; }; ////////////////////////////////////////////////////////////////////////// static void * chain ( sphinx_client * client, const void * ptr, size_t len ); static const char * strchain ( sphinx_client * client, const char * s ); static void unchain ( sphinx_client * client, const void * ptr ); static void unchain_all ( sphinx_client * client ); sphinx_client * sphinx_create ( sphinx_bool copy_args ) { sphinx_client * client; int i; // allocate client = malloc ( sizeof(sphinx_client) ); if ( !client ) return NULL; // initialize defaults and return client->ver_search = 0x119; // 0x113 for 0.9.8, 0x116 for 0.9.9rc2 client->copy_args = copy_args; client->head_alloc = NULL; client->error = NULL; client->warning = NULL; client->local_error_buf[0] = '\0'; client->host = strchain ( client, "localhost" ); client->port = 9312; client->timeout = 0.0f; client->offset = 0; client->limit = 20; client->mode = SPH_MATCH_ALL; client->num_weights = 0; client->weights = NULL; client->sort = SPH_SORT_RELEVANCE; client->sortby = NULL; client->minid = 0; client->maxid = 0; client->group_by = NULL; client->group_func = SPH_GROUPBY_ATTR; client->group_sort = strchain ( client, "@groupby desc" ); client->group_distinct = NULL; client->max_matches = 1000; client->cutoff = 0; client->retry_count = 0; client->retry_delay = 0; client->geoanchor_attr_lat = NULL; client->geoanchor_attr_long = NULL; client->geoanchor_lat = 0.0f; client->geoanchor_long = 0.0f; client->num_filters = 0; client->max_filters = 0; client->filters = NULL; client->num_index_weights = 0; client->index_weights_names = NULL; client->index_weights_values = NULL; client->ranker = SPH_RANK_DEFAULT; client->max_query_time = 0; client->num_field_weights = 0; client->field_weights_names = NULL; client->field_weights_values = NULL; client->num_overrides = 0; client->max_overrides = 0; client->overrides = NULL; client->select_list = NULL; client->num_reqs = 0; client->response_len = 0; client->response_buf = NULL; client->num_results = 0; for ( i=0; iresults[i].values_pool = NULL; client->results[i].words = NULL; client->results[i].fields = NULL; client->results[i].attr_names = NULL; client->results[i].attr_types = NULL; } client->sock = -1; client->persist = SPH_FALSE; return client; } static void sphinx_free_results ( sphinx_client * client ) { int i; for ( i=0; inum_results; i++ ) { free ( client->results[i].values_pool ); free ( client->results[i].words ); free ( client->results[i].fields ); free ( client->results[i].attr_names ); free ( client->results[i].attr_types ); client->results[i].values_pool = NULL; client->results[i].words = NULL; client->results[i].fields = NULL; client->results[i].attr_names = NULL; client->results[i].attr_types = NULL; } client->num_results = 0; } void sock_close ( int sock ); #define safe_free(_ptr) \ if ( _ptr ) \ { \ free ( _ptr ); \ _ptr = NULL; \ } void sphinx_cleanup ( sphinx_client * client ) { int i; if ( !client ) return; for ( i=0; inum_reqs; i++ ) safe_free ( client->reqs[i] ); client->num_reqs = 0; sphinx_free_results ( client ); client->num_results = 0; client->num_results = 0; safe_free ( client->response_buf ); } void sphinx_destroy ( sphinx_client * client ) { int i; if ( !client ) return; for ( i=0; inum_reqs; i++ ) safe_free ( client->reqs[i] ); sphinx_free_results ( client ); unchain_all ( client ); safe_free ( client->filters ); safe_free ( client->response_buf ); if ( client->sock>=0 ) sock_close ( client->sock ); free ( client ); } const char * sphinx_error ( sphinx_client * client ) { return client->error ? client->error : ""; } const char * sphinx_warning ( sphinx_client * client ) { return client->warning ? client->warning : ""; } static void set_error ( sphinx_client * client, const char * template, ... ) { va_list ap; if ( !client ) return; va_start ( ap, template ); vsnprintf ( client->local_error_buf, sizeof(client->local_error_buf), template, ap ); va_end ( ap ); client->error = client->local_error_buf; client->warning = NULL; } ////////////////////////////////////////////////////////////////////////// struct st_memblock { struct st_memblock * prev; struct st_memblock * next; }; static void * chain ( sphinx_client * client, const void * ptr, size_t len ) { struct st_memblock * entry; if ( !client->copy_args || !ptr ) return (void*) ptr; entry = malloc ( sizeof(struct st_memblock) + len ); if ( !entry ) { set_error ( client, "malloc() failed (bytes=%d)", sizeof(struct st_memblock) + len ); return NULL; } entry->prev = NULL; entry->next = client->head_alloc; if ( entry->next ) entry->next->prev = entry; client->head_alloc = entry; entry++; memcpy ( entry, ptr, len ); return entry; } static const char * strchain ( sphinx_client * client, const char * s ) { return s ? chain ( client, s, 1+strlen(s) ) : NULL; } static void unchain ( sphinx_client * client, const void * ptr ) { struct st_memblock * entry; if ( !client->copy_args || !ptr ) return; entry = (struct st_memblock*) ptr; entry--; if ( entry->prev ) entry->prev->next = entry->next; else client->head_alloc = entry->next; if ( entry->next ) entry->next->prev = entry->prev; free ( entry ); } static void unchain_all ( sphinx_client * client ) { struct st_memblock *to_free, *cur; if ( !client || !client->copy_args ) return; cur = client->head_alloc; while ( cur ) { to_free = cur; cur = cur->next; free ( to_free ); } client->head_alloc = NULL; } ////////////////////////////////////////////////////////////////////////// sphinx_bool sphinx_set_server ( sphinx_client * client, const char * host, int port ) { if ( !client || !host || !host[0] ) { set_error ( client, "invalid arguments (host must not be empty)" ); return SPH_FALSE; } unchain ( client, client->host ); client->host = strchain ( client, host ); client->port = port; return SPH_TRUE; } sphinx_bool sphinx_set_connect_timeout ( sphinx_client * client, float seconds ) { if ( !client ) return SPH_FALSE; client->timeout = seconds; return SPH_TRUE; } sphinx_bool sphinx_set_limits ( sphinx_client * client, int offset, int limit, int max_matches, int cutoff ) { if ( !client || offset<0 || limit<=0 || max_matches<0 || cutoff<0 ) { if ( offset<0 ) set_error ( client, "invalid arguments (offset must be >= 0)" ); else if ( limit<=0 ) set_error ( client, "invalid arguments (limit must be > 0)" ); else if ( max_matches<0 ) set_error ( client, "invalid arguments (max_matches must be >= 0)" ); else if ( cutoff<0 ) set_error ( client, "invalid arguments (cutoff must be >= 0)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } client->offset = offset; client->limit = limit; if ( max_matches>=0 ) client->max_matches = max_matches; if ( cutoff>=0 ) client->cutoff = cutoff; return SPH_TRUE; } sphinx_bool sphinx_set_max_query_time ( sphinx_client * client, int max_query_time ) { if ( !client || max_query_time<=0 ) { set_error ( client, "invalid arguments (max_query_time must be > 0)" ); return SPH_FALSE; } client->max_query_time = max_query_time; return SPH_TRUE; } sphinx_bool sphinx_set_match_mode ( sphinx_client * client, int mode ) { if ( !client || modeSPH_MATCH_EXTENDED2 ) // FIXME? { set_error ( client, "invalid arguments (matching mode %d out of bounds)", mode ); return SPH_FALSE; } client->mode = mode; return SPH_TRUE; } sphinx_bool sphinx_set_ranking_mode ( sphinx_client * client, int ranker ) { if ( !client || rankerSPH_RANK_SPH04 ) // FIXME? { set_error ( client, "invalid arguments (ranking mode %d out of bounds)", ranker ); return SPH_FALSE; } client->ranker = ranker; return SPH_TRUE; } sphinx_bool sphinx_set_sort_mode ( sphinx_client * client, int mode, const char * sortby ) { if ( !client || modeSPH_SORT_EXPR || ( mode!=SPH_SORT_RELEVANCE && ( !sortby || !sortby[0] ) ) ) { if ( modeSPH_SORT_EXPR ) { set_error ( client, "invalid arguments (sorting mode %d out of bounds)", mode ); } else if ( mode!=SPH_SORT_RELEVANCE && ( !sortby || !sortby[0] ) ) { set_error ( client, "invalid arguments (sortby clause must not be empty)", mode ); } else { set_error ( client, "invalid arguments", mode ); } return SPH_FALSE; } client->sort = mode; unchain ( client, client->sortby ); client->sortby = strchain ( client, sortby ); return SPH_TRUE; } sphinx_bool sphinx_set_field_weights ( sphinx_client * client, int num_weights, const char ** field_names, const int * field_weights ) { int i; if ( !client || num_weights<=0 || !field_names || !field_weights ) { if ( num_weights<=0 ) set_error ( client, "invalid arguments (num_weights must be > 0)" ); else if ( !field_names ) set_error ( client, "invalid arguments (field_names must not be NULL)" ); else if ( !field_names ) set_error ( client, "invalid arguments (field_weights must not be NULL)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } if ( client->copy_args ) { for ( i=0; inum_field_weights; i++ ) unchain ( client, client->field_weights_names[i] ); unchain ( client, client->field_weights_names ); unchain ( client, client->field_weights_values ); field_names = chain ( client, field_names, num_weights*sizeof(const char*) ); for ( i=0; inum_field_weights = num_weights; client->field_weights_names = field_names; client->field_weights_values = field_weights; return SPH_TRUE; } sphinx_bool sphinx_set_index_weights ( sphinx_client * client, int num_weights, const char ** index_names, const int * index_weights ) { int i; if ( !client || num_weights<=0 || !index_names || !index_weights ) { if ( num_weights<=0 ) set_error ( client, "invalid arguments (num_weights must be > 0)" ); else if ( !index_names ) set_error ( client, "invalid arguments (index_names must not be NULL)" ); else if ( !index_names ) set_error ( client, "invalid arguments (index_weights must not be NULL)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } if ( client->copy_args ) { for ( i=0; inum_index_weights; i++ ) unchain ( client, client->index_weights_names[i] ); unchain ( client, client->index_weights_names ); unchain ( client, client->index_weights_values ); index_names = chain ( client, index_names, num_weights*sizeof(const char*) ); for ( i=0; inum_index_weights = num_weights; client->index_weights_names = index_names; client->index_weights_values = index_weights; return SPH_TRUE; } sphinx_bool sphinx_set_id_range ( sphinx_client * client, sphinx_uint64_t minid, sphinx_uint64_t maxid ) { if ( !client || minid>maxid ) { set_error ( client, "invalid arguments (minid must be <= maxid)" ); return SPH_FALSE; } client->minid = minid; client->maxid = maxid; return SPH_TRUE; } static struct st_filter * sphinx_add_filter_entry ( sphinx_client * client ) { int len; if ( client->num_filters>=client->max_filters ) { len = ( client->max_filters<=0 ) ? client->num_filters + 8 : 2*client->max_filters; len *= sizeof(struct st_filter); client->filters = realloc ( client->filters, len ); if ( !client->filters ) { set_error ( client, "realloc() failed (bytes=%d)", len ); return NULL; } } return client->filters + client->num_filters++; } sphinx_bool sphinx_add_filter ( sphinx_client * client, const char * attr, int num_values, const sphinx_int64_t * values, sphinx_bool exclude ) { struct st_filter * filter; if ( !client || !attr || num_values<=0 || !values ) { if ( !attr ) set_error ( client, "invalid arguments (attr must not be empty)" ); else if ( num_values<=0 ) set_error ( client, "invalid arguments (num_values must be > 0)" ); else if ( !values ) set_error ( client, "invalid arguments (values must not be NULL)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } filter = sphinx_add_filter_entry ( client ); if ( !filter ) return SPH_FALSE; filter->attr = strchain ( client, attr ); filter->filter_type = SPH_FILTER_VALUES; filter->num_values = num_values; filter->values = chain ( client, values, num_values*sizeof(sphinx_int64_t) ); filter->exclude = exclude; return SPH_TRUE; } sphinx_bool sphinx_add_filter_range ( sphinx_client * client, const char * attr, sphinx_int64_t umin, sphinx_int64_t umax, sphinx_bool exclude ) { struct st_filter * filter; if ( !client || !attr || umin>umax ) { if ( !attr ) set_error ( client, "invalid arguments (attr must not be empty)" ); else if ( umin>umax ) set_error ( client, "invalid arguments (umin must be <= umax)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } filter = sphinx_add_filter_entry ( client ); if ( !filter ) return SPH_FALSE; filter->attr = strchain ( client, attr ); filter->filter_type = SPH_FILTER_RANGE; filter->umin = umin; filter->umax = umax; filter->exclude = exclude; return SPH_TRUE; } sphinx_bool sphinx_add_filter_float_range ( sphinx_client * client, const char * attr, float fmin, float fmax, sphinx_bool exclude ) { struct st_filter * filter; if ( !client || !attr || fmin>fmax ) { if ( !attr ) set_error ( client, "invalid arguments (attr must not be empty)" ); else if ( fmin>fmax ) set_error ( client, "invalid arguments (fmin must be <= fmax)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } filter = sphinx_add_filter_entry ( client ); if ( !filter ) return SPH_FALSE; filter->attr = strchain ( client, attr ); filter->filter_type = SPH_FILTER_FLOATRANGE; filter->fmin = fmin; filter->fmax = fmax; filter->exclude = exclude; return SPH_TRUE; } sphinx_bool sphinx_set_geoanchor ( sphinx_client * client, const char * attr_latitude, const char * attr_longitude, float latitude, float longitude ) { if ( !client || !attr_latitude || !attr_latitude[0] || !attr_longitude || !attr_longitude[0] ) { if ( !attr_latitude || !attr_latitude[0] ) set_error ( client, "invalid arguments (attr_latitude must not be empty)" ); else if ( !attr_longitude || !attr_longitude[0] ) set_error ( client, "invalid arguments (attr_longitude must not be empty)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } unchain ( client, client->geoanchor_attr_lat ); unchain ( client, client->geoanchor_attr_long ); client->geoanchor_attr_lat = strchain ( client, attr_latitude ); client->geoanchor_attr_long = strchain ( client, attr_longitude ); client->geoanchor_lat = latitude; client->geoanchor_long = longitude; return SPH_TRUE; } sphinx_bool sphinx_set_groupby ( sphinx_client * client, const char * attr, int groupby_func, const char * group_sort ) { if ( !client || !attr || groupby_funcSPH_GROUPBY_ATTRPAIR ) { if ( !attr ) { set_error ( client, "invalid arguments (attr must not be empty)" ); } else if ( groupby_funcSPH_GROUPBY_ATTRPAIR ) { set_error ( client, "invalid arguments (groupby_func %d out of bounds)", groupby_func ); } else { set_error ( client, "invalid arguments" ); } return SPH_FALSE; } unchain ( client, client->group_by ); unchain ( client, client->group_sort ); client->group_by = strchain ( client, attr ); client->group_func = groupby_func; client->group_sort = strchain ( client, group_sort ? group_sort : "@groupby desc" ); return SPH_TRUE; } sphinx_bool sphinx_set_groupby_distinct ( sphinx_client * client, const char * attr ) { if ( !client || !attr ) { if ( !attr ) set_error ( client, "invalid arguments (attr must not be empty)" ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } unchain ( client, client->group_distinct ); client->group_distinct = strchain ( client, attr ); return SPH_TRUE; } sphinx_bool sphinx_set_retries ( sphinx_client * client, int count, int delay ) { if ( !client || count<0 || count>1000 || delay<0 || delay>100000 ) { if ( count<0 || count>1000 ) set_error ( client, "invalid arguments (count value %d out of bounds)", count ); else if ( delay<0 || delay>100000 ) set_error ( client, "invalid arguments (delay value %d out of bounds)", delay ); else set_error ( client, "invalid arguments" ); return SPH_FALSE; } client->retry_count = count; client->retry_delay = delay; return SPH_TRUE; } sphinx_bool sphinx_add_override ( sphinx_client * client, const char * attr, const sphinx_uint64_t * docids, int num_values, const unsigned int * values ) { struct st_override * p; if ( !client ) return SPH_FALSE; if ( client->ver_search<0x115 ) { set_error ( client, "sphinx_add_override not supported by chosen protocol version" ); return SPH_FALSE; } if ( client->num_overrides>=client->max_overrides ) { client->max_overrides = ( client->max_overrides<=0 ) ? 8 : 2*client->max_overrides; client->overrides = realloc ( client->overrides, client->max_overrides *sizeof(struct st_override) ); } p = client->overrides + client->num_overrides; client->num_overrides++; p->attr = strchain ( client, attr ); p->docids = chain ( client, docids, sizeof(sphinx_uint64_t)*num_values ); p->num_values = num_values; p->uint_values = chain ( client, values, sizeof(unsigned int)*num_values ); return SPH_TRUE; } sphinx_bool sphinx_set_select ( sphinx_client * client, const char * select_list ) { if ( !client ) return SPH_FALSE; if ( client->ver_search<0x116 ) { set_error ( client, "sphinx_set_select not supported by chosen protocol version" ); return SPH_FALSE; } unchain ( client, client->select_list ); client->select_list = strchain ( client, select_list ); return SPH_TRUE; } void sphinx_reset_filters ( sphinx_client * client ) { int i; if ( !client ) return; if ( client->filters ) { if ( client->copy_args ) for ( i=0; inum_filters; i++ ) { unchain ( client, client->filters[i].attr ); if ( client->filters[i].filter_type==SPH_FILTER_VALUES ) unchain ( client, client->filters[i].values ); } free ( client->filters ); client->filters = NULL; } client->num_filters = client->max_filters = 0; } void sphinx_reset_groupby ( sphinx_client * client ) { if ( !client ) return; unchain ( client, client->group_by ); unchain ( client, client->group_sort ); client->group_by = NULL; client->group_func = SPH_GROUPBY_ATTR; client->group_sort = strchain ( client, "@groupby desc" ); client->group_distinct = NULL; } ////////////////////////////////////////////////////////////////////////// static int sphinx_dismiss_requests ( sphinx_client * client ) { int nreqs = client->num_reqs, i; for ( i=0; inum_reqs; i++ ) free ( client->reqs[i] ); client->num_reqs = 0; return nreqs; } sphinx_result * sphinx_query ( sphinx_client * client, const char * query, const char * index_list, const char * comment ) { sphinx_result * res; if ( !client ) return NULL; if ( client->num_reqs!=0 ) { set_error ( client, "sphinx_query() must not be called after sphinx_add_query()" ); return NULL; } if ( sphinx_add_query ( client, query, index_list, comment )!=0 ) return NULL; res = sphinx_run_queries ( client ); // just a shortcut for client->results[0] sphinx_dismiss_requests ( client ); // sphinx_query() is fire and forget; dismiss request in all cases if ( !res ) return NULL; client->error = res->error; client->warning = res->warning; return ( res->status==SEARCHD_ERROR ) ? NULL : res; } static size_t safestrlen ( const char * s ) { return s ? strlen(s) : 0; } static int calc_req_len ( sphinx_client * client, const char * query, const char * index_list, const char * comment ) { int i, filter_val_size; size_t res; res = 96 + 2*(int)sizeof(sphinx_uint64_t) + 4*client->num_weights + safestrlen ( client->sortby ) + safestrlen ( query ) + safestrlen ( index_list ) + safestrlen ( client->group_by ) + safestrlen ( client->group_sort ) + safestrlen ( client->group_distinct ) + safestrlen ( comment ); filter_val_size = ( client->ver_search>=0x114 ) ? 8 : 4; for ( i=0; inum_filters; i++ ) { const struct st_filter * filter = &client->filters[i]; res += 12 + safestrlen ( filter->attr ); // string attr-name; int type; int exclude-flag switch ( filter->filter_type ) { case SPH_FILTER_VALUES: res += 4 + filter_val_size*filter->num_values; break; // int values-count; uint32/int64[] values case SPH_FILTER_RANGE: res += 2*filter_val_size; break; // uint32/int64 min-val, max-val case SPH_FILTER_FLOATRANGE: res += 8; break; // float min-val,max-val } } if ( client->geoanchor_attr_lat && client->geoanchor_attr_long ) res += 16 + safestrlen ( client->geoanchor_attr_lat ) + safestrlen ( client->geoanchor_attr_long ); // string lat-attr, long-attr; float lat, long for ( i=0; inum_index_weights; i++ ) res += 8 + safestrlen ( client->index_weights_names[i] ); // string index-name; int index-weight for ( i=0; inum_field_weights; i++ ) res += 8 + safestrlen ( client->field_weights_names[i] ); // string field-name; int field-weight if ( client->ver_search>=0x115 ) { res += 4; // int overrides-count for ( i=0; inum_overrides; i++ ) { res += 8 + safestrlen ( client->overrides[i].attr ); // string attr, int attr-type res += 4 + 12*client->overrides[i].num_values; // int values-count, { uint64 docid, uint32 value }[] override } } if ( client->ver_search>=0x116 ) res += 4 + safestrlen ( client->select_list ); // string select_list return (int)res; } static void send_bytes ( char ** pp, const char * bytes, int len ) { char * ptr; int i; ptr = *pp; if ( ptr ) for ( i=0; i> 24 ) & 0xff; b[1] = ( value >> 16 ) & 0xff; b[2] = ( value >> 8 ) & 0xff; b[3] = ( value & 0xFF ); *pp += 4; } static void send_word ( char ** pp, unsigned short value ) { unsigned char * b = (unsigned char*) *pp; b[0] = ( value >> 8 ); b[1] = ( value & 0xFF ); *pp += 2; } static void send_str ( char ** pp, const char * s ) { int len; len = s ? (int)strlen(s) : 0; send_int ( pp, len ); send_bytes ( pp, s, len ); } static void send_qword ( char ** pp, sphinx_uint64_t value ) { send_int ( pp, (int)( value >> 32 ) ); send_int ( pp, (int)( value & ((sphinx_uint64_t)0xffffffffL) ) ); } static void send_float ( char ** pp, float value ) { union { float f; int i; } u; u.f = value; send_int ( pp, u.i ); } int sphinx_add_query ( sphinx_client * client, const char * query, const char * index_list, const char * comment ) { int i, j, req_len; char * req; if ( client->num_reqs<0 || client->num_reqs>=MAX_REQS ) { set_error ( client, "num_reqs=%d out of bounds (too many queries?)", client->num_reqs ); return -1; } req_len = calc_req_len ( client, query, index_list, comment ); req = malloc ( req_len ); if ( !req ) { set_error ( client, "malloc() failed (bytes=%d)", req_len ); return -1; } client->reqs[client->num_reqs] = req; client->req_lens[client->num_reqs] = req_len; client->num_reqs++; send_int ( &req, client->offset ); send_int ( &req, client->limit ); send_int ( &req, client->mode ); send_int ( &req, client->ranker ); send_int ( &req, client->sort ); send_str ( &req, client->sortby ); send_str ( &req, query ); send_int ( &req, client->num_weights ); for ( i=0; inum_weights; i++ ) send_int ( &req, client->weights[i] ); send_str ( &req, index_list ); send_int ( &req, 1 ); // id range bits send_qword ( &req, client->minid ); send_qword ( &req, client->maxid ); send_int ( &req, client->num_filters ); for ( i=0; inum_filters; i++ ) { send_str ( &req, client->filters[i].attr ); send_int ( &req, client->filters[i].filter_type ); switch ( client->filters[i].filter_type ) { case SPH_FILTER_VALUES: send_int ( &req, client->filters[i].num_values ); if ( client->ver_search>=0x114 ) { for ( j=0; jfilters[i].num_values; j++ ) send_qword ( &req, client->filters[i].values[j] ); } else { for ( j=0; jfilters[i].num_values; j++ ) send_int ( &req, (unsigned int)client->filters[i].values[j] ); } break; case SPH_FILTER_RANGE: if ( client->ver_search>=0x114 ) { send_qword ( &req, client->filters[i].umin ); send_qword ( &req, client->filters[i].umax ); } else { send_int ( &req, (unsigned int)client->filters[i].umin ); send_int ( &req, (unsigned int)client->filters[i].umax ); } break; case SPH_FILTER_FLOATRANGE: send_float ( &req, client->filters[i].fmin ); send_float ( &req, client->filters[i].fmax ); break; } send_int ( &req, client->filters[i].exclude ); } send_int ( &req, client->group_func ); send_str ( &req, client->group_by ); send_int ( &req, client->max_matches ); send_str ( &req, client->group_sort ); send_int ( &req, client->cutoff ); send_int ( &req, client->retry_count ); send_int ( &req, client->retry_delay ); send_str ( &req, client->group_distinct ); if ( client->geoanchor_attr_lat && client->geoanchor_attr_long ) { send_int ( &req, 1 ); send_str ( &req, client->geoanchor_attr_lat ); send_str ( &req, client->geoanchor_attr_long ); send_float ( &req, client->geoanchor_lat ); send_float ( &req, client->geoanchor_long ); } else { send_int ( &req, 0 ); } send_int ( &req, client->num_index_weights ); for ( i=0; inum_index_weights; i++ ) { send_str ( &req, client->index_weights_names[i] ); send_int ( &req, client->index_weights_values[i] ); } send_int ( &req, client->max_query_time ); send_int ( &req, client->num_field_weights ); for ( i=0; inum_field_weights; i++ ) { send_str ( &req, client->field_weights_names[i] ); send_int ( &req, client->field_weights_values[i] ); } send_str ( &req, comment ); if ( client->ver_search>=0x115 ) { send_int ( &req, client->num_overrides ); for ( i=0; inum_overrides; i++ ) { send_str ( &req, client->overrides[i].attr ); send_int ( &req, SPH_ATTR_INTEGER ); send_int ( &req, client->overrides[i].num_values ); for ( j=0; joverrides[i].num_values; j++ ) { send_qword ( &req, client->overrides[i].docids[j] ); send_int ( &req, client->overrides[i].uint_values[j] ); } } } if ( client->ver_search>=0x116 ) send_str ( &req, client->select_list ); if ( !req ) { set_error ( client, "internal error, failed to build request" ); free ( client->reqs [ --client->num_reqs ] ); return -1; } return client->num_reqs-1; } static const char * sock_error () { #if _WIN32 static char sBuf [ 256 ]; int iErr; iErr = WSAGetLastError (); _snprintf ( sBuf, sizeof(sBuf), "WSA error %d", iErr ); return sBuf; #else return strerror ( errno ); #endif } static int sock_errno () { #ifdef _WIN32 return WSAGetLastError (); #else return errno; #endif } static int sock_set_nonblocking ( int sock ) { #if _WIN32 u_long uMode = 1; return ioctlsocket ( sock, FIONBIO, &uMode ); #else return fcntl ( sock, F_SETFL, O_NONBLOCK ); #endif } static int sock_set_blocking ( int sock ) { #if _WIN32 u_long uMode = 0; return ioctlsocket ( sock, FIONBIO, &uMode ); #else return fcntl ( sock, F_SETFL, 0 ); #endif } void sock_close ( int sock ) { if ( sock<0 ) return; #if _WIN32 closesocket ( sock ); #else close ( sock ); #endif } // wrap FD_SET to prevent warnings on Windows #if _WIN32 #pragma warning(disable:4127) // conditional expr is const #pragma warning(disable:4389) // signed/unsigned mismatch void SPH_FD_SET ( int fd, fd_set * fdset ) { FD_SET ( fd, fdset ); } #pragma warning(default:4127) // conditional expr is const #pragma warning(default:4389) // signed/unsigned mismatch #else // !USE_WINDOWS #define SPH_FD_SET FD_SET #endif static sphinx_bool net_write ( int fd, const char * bytes, int len, sphinx_client * client ) { int res; #if defined(_WIN32) || defined(SO_NOSIGPIPE) res = send ( fd, bytes, len, 0 ); #else res = send ( fd, bytes, len, MSG_NOSIGNAL ); #endif if ( res<0 ) { set_error ( client, "send() error: %s", sock_error() ); return SPH_FALSE; } if ( res!=len ) { set_error ( client, "send() error: incomplete write (len=%d, sent=%d)", len, res ); return SPH_FALSE; } return SPH_TRUE; } static sphinx_bool net_read ( int fd, char * buf, int len, sphinx_client * client ) { int res, err; for ( ;; ) { res = recv ( fd, buf, len, 0 ); if ( res<0 ) { err = sock_errno(); if ( err==EINTR || err==EWOULDBLOCK ) // FIXME! remove non-blocking mode here; add timeout continue; set_error ( client, "recv(): read error (error=%s)", sock_error() ); return SPH_FALSE; } len -= res; buf += res; if ( len==0 ) return SPH_TRUE; if ( res==0 ) { set_error ( client, "recv(): incomplete read (len=%d, recv=%d)", len, res ); return SPH_FALSE; } } } static int net_create_inet_sock ( sphinx_client * client ) { struct hostent * hp; struct sockaddr_in sa; int sock, res, err, optval; hp = gethostbyname ( client->host ); if ( !hp ) { set_error ( client, "host name lookup failed (host=%s, error=%s)", client->host, sock_error() ); return -1; } memset ( &sa, 0, sizeof(sa) ); memcpy ( &sa.sin_addr, hp->h_addr_list[0], hp->h_length ); sa.sin_family = hp->h_addrtype; sa.sin_port = htons ( (unsigned short)client->port ); sock = (int) socket ( hp->h_addrtype, SOCK_STREAM, 0 ); if ( sock<0 ) { set_error ( client, "socket() failed: %s", sock_error() ); return -1; } if ( sock_set_nonblocking ( sock )<0 ) { set_error ( client, "sock_set_nonblocking() failed: %s", sock_error() ); return -1; } optval = 1; #if defined(SO_NOSIGPIPE) if ( setsockopt ( sock, SOL_SOCKET, SO_NOSIGPIPE, (void *)&optval, (socklen_t)sizeof(optval) ) < 0 ) { set_error ( client, "setsockopt() failed: %s", sock_error() ); return -1; } #endif res = connect ( sock, (struct sockaddr*)&sa, sizeof(sa) ); if ( res==0 ) return sock; err = sock_errno(); #ifdef EINPROGRESS if ( err!=EWOULDBLOCK && err!=EINPROGRESS ) #else if ( err!=EWOULDBLOCK ) #endif { set_error ( client, "connect() failed: %s", sock_error() ); return -1; } return sock; } #ifndef _WIN32 static int net_create_unix_sock ( sphinx_client * client ) { struct hostent * hp; struct sockaddr_un uaddr; int sock, res, err, optval, len; len = strlen ( client->host ); if ( len + 1 > sizeof( uaddr.sun_path ) ) set_error ( client, "UNIX socket path is too long (len=%d)", len ); memset ( &uaddr, 0, sizeof(uaddr) ); uaddr.sun_family = AF_UNIX; memcpy ( uaddr.sun_path, client->host, len + 1 ); sock = socket ( AF_UNIX, SOCK_STREAM, 0 ); if ( sock<0 ) { set_error ( client, "UNIX socket() failed: %s", sock_error() ); return -1; } if ( sock_set_nonblocking ( sock )<0 ) { set_error ( client, "sock_set_nonblocking() failed: %s", sock_error() ); return -1; } optval = 1; #if defined(SO_NOSIGPIPE) if ( setsockopt ( sock, SOL_SOCKET, SO_NOSIGPIPE, (void *)&optval, (socklen_t)sizeof(optval) ) < 0 ) { set_error ( client, "setsockopt() failed: %s", sock_error() ); return -1; } #endif res = connect ( sock, (struct sockaddr *)&uaddr, sizeof(uaddr) ); if ( res==0 ) return sock; err = sock_errno(); #ifdef EINPROGRESS if ( err!=EWOULDBLOCK && err!=EINPROGRESS ) #else if ( err!=EWOULDBLOCK ) #endif { set_error ( client, "connect() failed: %s", sock_error() ); return -1; } return sock; } #endif static int net_connect_get ( sphinx_client * client ) { struct timeval timeout; fd_set fds_write; int sock, to_wait, res, my_proto; if ( client->sock>=0 ) return client->sock; sock = -1; if ( client->host[0]!='/' ) { sock = net_create_inet_sock ( client ); } else { #ifdef _WIN32 set_error ( client, "UNIX sockets are not supported on Windows" ); return -1; #else sock = net_create_unix_sock ( client ); #endif } if ( sock<0 ) return -1; to_wait = (int)( 1000*client->timeout ); if ( to_wait<=0 ) to_wait = CONNECT_TIMEOUT_MSEC; { timeout.tv_sec = to_wait / 1000; // full seconds timeout.tv_usec = ( to_wait % 1000 ) * 1000; // remainder is msec, so *1000 for usec FD_ZERO ( &fds_write ); SPH_FD_SET ( sock, &fds_write ); res = select ( 1+sock, NULL, &fds_write, NULL, &timeout ); if ( res>=0 && FD_ISSET ( sock, &fds_write ) ) { sock_set_blocking ( sock ); // now send major client protocol version my_proto = htonl ( 1 ); if ( !net_write ( sock, (char*)&my_proto, sizeof(my_proto), client ) ) { sock_close ( sock ); set_error ( client, "failed to send client protocol version" ); return -1; } // check daemon version if ( !net_read ( sock, (char*)&my_proto, sizeof(my_proto), client ) ) { sock_close ( sock ); return -1; } my_proto = ntohl ( my_proto ); if ( my_proto<1 ) { sock_close ( sock ); set_error ( client, "expected searchd protocol version 1+, got version %d", my_proto ); return -1; } return sock; } /*!COMMIT handle EINTR here*/ sock_close ( sock ); set_error ( client, "connect() timed out" ); return -1; } } static sphinx_bool net_sock_eof ( int sock ) { struct timeval tv; fd_set fds_read, fds_except; int res; char buf; // wrong arg, consider dead if ( sock<0 ) return SPH_TRUE; // select() on a socket and watch for exceptions FD_ZERO ( &fds_read ); FD_ZERO ( &fds_except ); SPH_FD_SET ( sock, &fds_read ); SPH_FD_SET ( sock, &fds_except ); tv.tv_sec = 0; tv.tv_usec = 0; res = select ( 1+sock, &fds_read, NULL, &fds_except, &tv ); // select() failed, assume something is wrong if ( res<0 ) return SPH_TRUE; // got any events to read? (either normal via fds_read, or OOB via fds_except set) if ( FD_ISSET ( sock, &fds_read ) || FD_ISSET ( sock, &fds_except ) ) if ( recv ( sock, &buf, sizeof(buf), MSG_PEEK )<=0 ) if ( sock_errno()!=EWOULDBLOCK ) return SPH_TRUE; // it seems alive return SPH_FALSE; } static int net_connect_ex ( sphinx_client * client ) { if ( client->sock>=0 ) { // in case of a persistent connection, check for eof // then attempt to reestablish lost pconn once if ( !net_sock_eof ( client->sock ) ) return client->sock; sock_close ( client->sock ); client->sock = -1; } if ( !client->persist ) return net_connect_get ( client ); sphinx_open ( client ); return client->sock; } static unsigned short unpack_short ( char ** cur ) { unsigned short v; memcpy ( &v, *cur, sizeof(unsigned short) ); (*cur) += sizeof(unsigned short); return ntohs ( v ); } static unsigned int unpack_int ( char ** cur ) { unsigned int v; memcpy ( &v, *cur, sizeof(unsigned int) ); (*cur) += sizeof(unsigned int); return ntohl ( v ); } static char * unpack_str ( char ** cur ) { // we play a trick // we move the string in-place to free space for trailing zero but avoid malloc unsigned int len; len = unpack_int ( cur ); memmove ( (*cur)-1, (*cur), len ); (*cur) += len; (*cur)[-1] = '\0'; return (*cur)-len-1; } static sphinx_uint64_t unpack_qword ( char ** cur ) { sphinx_uint64_t hi, lo; hi = unpack_int ( cur ); lo = unpack_int ( cur ); return ( hi<<32 ) + lo; } static float unpack_float ( char ** cur ) { union { unsigned int n; float f; } u; u.n = unpack_int ( cur ); return u.f; } static void net_get_response ( int fd, sphinx_client * client ) { int len; char header_buf[32], *cur, *response; unsigned short status, ver; // dismiss previous response if ( client->response_buf ) { free ( client->response_buf ); client->response_len = 0; client->response_buf = NULL; } // read and parse the header if ( !net_read ( fd, header_buf, 8, client ) ) { sock_close ( fd ); if ( client->sock>0 ) client->sock = -1; return; } cur = header_buf; status = unpack_short ( &cur ); ver = unpack_short ( &cur ); len = unpack_int ( &cur ); // sanity check the length, alloc the buffer if ( len<0 || len>MAX_PACKET_LEN ) { set_error ( client, "response length out of bounds (len=%d)", len ); return; } response = malloc ( len ); if ( !response ) { set_error ( client, "malloc() failed (bytes=%d)", len ); return; } // read the response if ( !net_read ( fd, response, len, client ) ) { sock_close ( fd ); if ( client->sock>0 ) client->sock = -1; free ( response ); return; } // check status cur = response; switch ( status ) { case SEARCHD_OK: case SEARCHD_WARNING: client->error = NULL; // so far so good if ( status==SEARCHD_WARNING ) client->warning = unpack_str ( &cur ); else client->warning = NULL; client->response_len = len; client->response_buf = response; client->response_start = cur; break; case SEARCHD_ERROR: case SEARCHD_RETRY: // copy error message, so that we can immediately free the response set_error ( client, "%s", unpack_str ( &cur ) ); free ( response ); break; default: set_error ( client, "unknown status code (status=%d)", status ); free ( response ); break; } // close one-time socket on success if ( client->sock<0 ) sock_close ( fd ); } sphinx_bool sphinx_open ( sphinx_client * client ) { char buf[16], *pbuf; if ( client->sock>=0 ) { set_error ( client, "already connected" ); return SPH_FALSE; } client->sock = net_connect_get ( client ); if ( client->sock<0 ) return SPH_FALSE; pbuf = buf; send_word ( &pbuf, SEARCHD_COMMAND_PERSIST ); send_word ( &pbuf, 0 ); // dummy version send_int ( &pbuf, 4 ); // dummy body len send_int ( &pbuf, 1 ); // dummy body if ( !net_write ( client->sock, buf, (int)(pbuf-buf), client ) ) { sock_close ( client->sock ); client->sock = -1; return SPH_FALSE; } client->persist = SPH_TRUE; return SPH_TRUE; } sphinx_bool sphinx_close ( sphinx_client * client ) { if ( client->sock<0 ) { set_error ( client, "not connected" ); return SPH_FALSE; } sock_close ( client->sock ); client->sock = -1; client->persist = SPH_FALSE; return SPH_TRUE; } static void * sphinx_malloc ( int len, sphinx_client * client ) { void * res; if ( len<0 || len>MAX_PACKET_LEN ) { set_error ( client, "malloc() length out of bounds, possibly broken response packet (len=%d)", len ); return NULL; } res = malloc ( len ); if ( !res ) set_error ( client, "malloc() failed (bytes=%d)", len ); return res; } sphinx_result * sphinx_run_queries ( sphinx_client * client ) { int i, j, k, l, fd, len, nreqs, id64; char req_header[32], *req, *p, *pmax; sphinx_result * res; union un_attr_value * pval; if ( !client ) return NULL; if ( client->num_reqs<=0 || client->num_reqs>MAX_REQS ) { set_error ( client, "num_reqs=%d out of bounds (too many queries?)", client->num_reqs ); return NULL; } fd = net_connect_ex ( client ); if ( fd<0 ) return NULL; // free previous results sphinx_free_results ( client ); // send query, get response len = 8; for ( i=0; inum_reqs; i++ ) len += client->req_lens[i]; req = req_header; send_word ( &req, SEARCHD_COMMAND_SEARCH ); send_word ( &req, client->ver_search ); send_int ( &req, len ); send_int ( &req, 0 ); // its a client send_int ( &req, client->num_reqs ); if ( !net_write ( fd, req_header, (int)(req-req_header), client ) ) return NULL; for ( i=0; inum_reqs; i++ ) if ( !net_write ( fd, client->reqs[i], client->req_lens[i], client ) ) return NULL; net_get_response ( fd, client ); if ( !client->response_buf ) return NULL; // dismiss request data, memorize count nreqs = sphinx_dismiss_requests ( client ); // parse response p = client->response_start; pmax = client->response_start + client->response_len; // max position for checks, to protect against broken responses for ( i=0; iresults[i]; client->num_results++; res->error = NULL; res->warning = NULL; res->status = unpack_int ( &p ); if ( res->status!=SEARCHD_OK ) { if ( res->status==SEARCHD_WARNING ) { res->warning = unpack_str ( &p ); } else { res->error = unpack_str ( &p ); continue; } } // fields res->num_fields = unpack_int ( &p ); res->fields = sphinx_malloc ( res->num_fields*sizeof(const char*), client ); if ( !res->fields ) return NULL; for ( j=0; jnum_fields; j++ ) res->fields[j] = unpack_str ( &p ); // attrs res->num_attrs = unpack_int ( &p ); res->attr_names = sphinx_malloc ( res->num_attrs*sizeof(const char*), client ); if ( !res->attr_names ) return NULL; res->attr_types = sphinx_malloc ( res->num_attrs*sizeof(int), client ); if ( !res->attr_types ) return NULL; for ( j=0; jnum_attrs; j++ ) { res->attr_names[j] = unpack_str ( &p ); res->attr_types[j] = unpack_int ( &p ); } // match count, id bits flag res->num_matches = unpack_int ( &p ); id64 = unpack_int ( &p ); res->values_pool = sphinx_malloc ( (2+res->num_attrs) * res->num_matches * sizeof(union un_attr_value), client ); if ( !res->values_pool ) return NULL; pval = res->values_pool; // matches for ( j=0; jnum_matches; j++ ) { // id if ( id64 ) pval->int_value = unpack_qword ( &p ); else pval->int_value = unpack_int ( &p ); pval++; // weight pval->int_value = unpack_int ( &p ); pval++; // attrs for ( k=0; knum_attrs; k++ ) { switch ( res->attr_types[k] ) { case SPH_ATTR_MULTI64: case SPH_ATTR_MULTI: /*!COMMIT this is totally unsafe on some arches (eg. SPARC)*/ pval->mva_value = (unsigned int *) p; len = unpack_int ( &p ); for ( l=0; l<=len; l++ ) // including first one that is len pval->mva_value[l] = ntohl ( pval->mva_value[l] ); if ( res->attr_types[k]==SPH_ATTR_MULTI64 ) { pval->mva_value[0] = pval->mva_value[0]/2; } p += len*sizeof(unsigned int); break; case SPH_ATTR_FLOAT: pval->float_value = unpack_float ( &p ); break; case SPH_ATTR_BIGINT: pval->int_value = unpack_qword ( &p ); break; case SPH_ATTR_STRING: pval->string = unpack_str ( &p ); break; default: pval->int_value = unpack_int ( &p ); break; } pval++; } } // totals res->total = unpack_int ( &p ); res->total_found = unpack_int ( &p ); res->time_msec = unpack_int ( &p ); res->num_words = unpack_int ( &p ); if ( res->words ) free ( res->words ); res->words = sphinx_malloc ( res->num_words*sizeof(struct st_sphinx_wordinfo), client ); if ( !res->words ) return NULL; // words for ( j=0; jnum_words; j++ ) { res->words[j].word = unpack_str ( &p ); res->words[j].docs = unpack_int ( &p ); res->words[j].hits = unpack_int ( &p ); } // sanity check // FIXME! add it to each unpack? if ( p>pmax ) { set_error ( client, "unpack error (req=%d, reqs=%d)", i, nreqs ); return NULL; } } return client->results; } ////////////////////////////////////////////////////////////////////////// int sphinx_get_num_results ( sphinx_client * client ) { return client ? client->num_results : -1; } sphinx_uint64_t sphinx_get_id ( sphinx_result * result, int match ) { return sphinx_get_int ( result, match, -2 ); } int sphinx_get_weight ( sphinx_result * result, int match ) { return (int)sphinx_get_int ( result, match, -1 ); } sphinx_int64_t sphinx_get_int ( sphinx_result * result, int match, int attr ) { // FIXME! add safety and type checks union un_attr_value * pval; pval = result->values_pool; return pval [ (2+result->num_attrs)*match+2+attr ].int_value; } float sphinx_get_float ( sphinx_result * result, int match, int attr ) { // FIXME! add safety and type checks union un_attr_value * pval; pval = result->values_pool; return pval [ (2+result->num_attrs)*match+2+attr ].float_value; } unsigned int * sphinx_get_mva ( sphinx_result * result, int match, int attr ) { // FIXME! add safety and type checks union un_attr_value * pval; pval = result->values_pool; return pval [ (2+result->num_attrs)*match+2+attr ].mva_value; } sphinx_uint64_t sphinx_get_mva64_value ( unsigned int * mva, int i ) { sphinx_uint64_t uVal; uVal = ( ( ( (sphinx_uint64_t)( mva[i*2] ) )<<32 ) | (sphinx_uint64_t)( mva[i*2+1] ) ); return uVal; } const char * sphinx_get_string ( sphinx_result * result, int match, int attr ) { // FIXME! add safety and type checks union un_attr_value * pval; pval = result->values_pool; return pval [ (2+result->num_attrs)*match+2+attr ].string; } ////////////////////////////////////////////////////////////////////////// static sphinx_bool net_simple_query ( sphinx_client * client, char * buf, int req_len ) { int fd; fd = net_connect_ex ( client ); if ( fd<0 ) { free ( buf ); return SPH_FALSE; } if ( !net_write ( fd, buf, 8+req_len, client ) ) { free ( buf ); return SPH_FALSE; } free ( buf ); net_get_response ( fd, client ); if ( !client->response_buf ) return SPH_FALSE; return SPH_TRUE; } void sphinx_init_excerpt_options ( sphinx_excerpt_options * opts ) { if ( !opts ) return; opts->before_match = ""; opts->after_match = ""; opts->chunk_separator = " ... "; opts->html_strip_mode = "index"; opts->passage_boundary = "none"; opts->limit = 256; opts->limit_passages = 0; opts->limit_words = 0; opts->around = 5; opts->start_passage_id = 1; opts->exact_phrase = SPH_FALSE; opts->single_passage = SPH_FALSE; opts->use_boundaries = SPH_FALSE; opts->weight_order = SPH_FALSE; opts->query_mode = SPH_FALSE; opts->force_all_words = SPH_FALSE; opts->load_files = SPH_FALSE; opts->allow_empty = SPH_FALSE; opts->emit_zones = SPH_FALSE; } char ** sphinx_build_excerpts ( sphinx_client * client, int num_docs, const char ** docs, const char * index, const char * words, sphinx_excerpt_options * opts ) { sphinx_excerpt_options def_opt; int i, req_len, flags; char *buf, *req, *p, *pmax, **result; if ( !client || !docs || !index || !words || num_docs<=0 ) { if ( !docs ) set_error ( client, "invalid arguments (docs must not be empty)" ); else if ( !index ) set_error ( client, "invalid arguments (index must not be empty)" ); else if ( !words ) set_error ( client, "invalid arguments (words must not be empty)" ); else if ( num_docs<=0 ) set_error ( client, "invalid arguments (num_docs must be positive)" ); return NULL; } // fixup options if ( !opts ) { sphinx_init_excerpt_options ( &def_opt ); opts = &def_opt; } // alloc buffer req_len = (int)( 60 + strlen(index) + strlen(words) + safestrlen(opts->before_match) + safestrlen(opts->after_match) + safestrlen(opts->chunk_separator) + safestrlen(opts->html_strip_mode) + safestrlen(opts->passage_boundary) ); for ( i=0; iexact_phrase ) flags |= 2; if ( opts->single_passage ) flags |= 4; if ( opts->use_boundaries ) flags |= 8; if ( opts->weight_order ) flags |= 16; if ( opts->query_mode ) flags |= 32; if ( opts->force_all_words ) flags |= 64; if ( opts->load_files ) flags |= 128; if ( opts->allow_empty ) flags |= 256; if ( opts->emit_zones ) flags |= 512; send_int ( &req, 0 ); send_int ( &req, flags ); send_str ( &req, index ); send_str ( &req, words ); send_str ( &req, opts->before_match ); send_str ( &req, opts->after_match ); send_str ( &req, opts->chunk_separator ); send_int ( &req, opts->limit ); send_int ( &req, opts->around ); send_int ( &req, opts->limit_passages ); // v1.2 send_int ( &req, opts->limit_words ); send_int ( &req, opts->start_passage_id ); send_str ( &req, opts->html_strip_mode ); send_str ( &req, opts->passage_boundary ); send_int ( &req, num_docs ); for ( i=0; iresponse_start; pmax = client->response_start + client->response_len; // max position for checks, to protect against broken responses result = malloc ( (1+num_docs)*sizeof(char*) ); if ( !result ) { set_error ( client, "malloc() failed (bytes=%d)", (1+num_docs)*sizeof(char*) ); return NULL; } for ( i=0; i<=num_docs; i++ ) result[i] = NULL; for ( i=0; ipmax ) { for ( i=0; iresponse_len<4 ) { set_error ( client, "incomplete reply" ); return -1; } p = client->response_start; return unpack_int ( &p ); } int sphinx_update_attributes_mva ( sphinx_client * client, const char * index, const char * attr, sphinx_uint64_t docid, int num_values, const unsigned int * values ) { int i, req_len; char *buf, *req, *p; // check args if ( !client || !index || !attr || num_values<=0 || !values ) { if ( !index ) set_error ( client, "invalid arguments (index must not be empty)" ); else if ( !attr ) set_error ( client, "invalid arguments (attr must not empty)" ); else if ( num_values<=0 ) set_error ( client, "invalid arguments (num_values must be positive)" ); else if ( !values ) set_error ( client, "invalid arguments (values must not be empty)" ); } // alloc buffer req_len = (int)( 38 + safestrlen(index) + safestrlen(attr) + num_values*4 ); buf = malloc ( 12+req_len ); // request body length plus 12 header bytes if ( !buf ) { set_error ( client, "malloc() failed (bytes=%d)", req_len ); return -1; } // build request req = buf; send_word ( &req, SEARCHD_COMMAND_UPDATE ); send_word ( &req, VER_COMMAND_UPDATE ); send_int ( &req, req_len ); send_str ( &req, index ); send_int ( &req, 1 ); send_str ( &req, attr ); send_int ( &req, 1 ); // SPH_ATTR_MULTI flag send_int ( &req, 1 ); send_qword ( &req, docid ); send_int ( &req, num_values ); for ( i=0; iresponse_len<4 ) { set_error ( client, "incomplete reply" ); return -1; } p = client->response_start; return unpack_int ( &p ); } ////////////////////////////////////////////////////////////////////////// sphinx_keyword_info * sphinx_build_keywords ( sphinx_client * client, const char * query, const char * index, sphinx_bool hits, int * out_num_keywords ) { int i, req_len, nwords, len; char *buf, *req, *p, *pmax; sphinx_keyword_info *res; // check args if ( !client || !query || !index ) { if ( !query ) set_error ( client, "invalid arguments (query must not be empty)" ); else if ( !index ) set_error ( client, "invalid arguments (index must not be empty)" ); else if ( !out_num_keywords ) set_error ( client, "invalid arguments (out_num_keywords must not be null)" ); return NULL; } // alloc buffer req_len = (int)( safestrlen(query) + safestrlen(index) + 12 ); buf = malloc ( 12+req_len ); // request body length plus 12 header bytes if ( !buf ) { set_error ( client, "malloc() failed (bytes=%d)", req_len ); return NULL; } // build request req = buf; send_word ( &req, SEARCHD_COMMAND_KEYWORDS ); send_word ( &req, VER_COMMAND_KEYWORDS ); send_int ( &req, req_len ); send_str ( &req, query ); send_str ( &req, index ); send_int ( &req, hits ); // send query, get response if ( !net_simple_query ( client, buf, req_len ) ) return NULL; // parse response p = client->response_start; pmax = client->response_start + client->response_len; // max position for checks, to protect against broken responses nwords = unpack_int ( &p ); *out_num_keywords = nwords; len = nwords*sizeof(sphinx_keyword_info); res = (sphinx_keyword_info*) malloc ( len ); if ( !res ) { set_error ( client, "malloc() failed (bytes=%d)", len ); return NULL; } memset ( res, 0, len ); for ( i=0; iresponse_start; pmax = client->response_start + client->response_len; // max position for checks, to protect against broken responses *num_rows = unpack_int ( &p ); *num_cols = unpack_int ( &p ); n = (*num_rows)*(*num_cols); res = (char**) malloc ( n*sizeof(char*) ); for ( i=0; i header file. */ #undef HAVE_DLFCN_H /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Define 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 version of this package. */ #undef PACKAGE_VERSION /* debug build */ #undef SPHINXCLIENT_DEBUG /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define to `unsigned' if does not define. */ #undef size_t coreseek-4.1-beta/csft-4.1/api/libsphinxclient/test.c100777 0 0 25021 11643565730 15572 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU Library General Public License. You should // have received a copy of the LGPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include #include #include #if _WIN32 #include #endif #include "sphinxclient.h" static sphinx_bool g_smoke = SPH_FALSE; static int g_failed = 0; void die ( const char * template, ... ) { va_list ap; va_start ( ap, template ); printf ( "FATAL: " ); vprintf ( template, ap ); printf ( "\n" ); va_end ( ap ); exit ( 1 ); } void net_init () { #if _WIN32 // init WSA on Windows WSADATA wsa_data; int wsa_startup_err; wsa_startup_err = WSAStartup ( WINSOCK_VERSION, &wsa_data ); if ( wsa_startup_err ) die ( "failed to initialize WinSock2: error %d", wsa_startup_err ); #endif } void test_query ( sphinx_client * client, const char * query ) { sphinx_result * res; const char *index; int i, j, k, mva_len; unsigned int * mva; const char * field_names[2]; int field_weights[2]; index = "test1"; field_names[0] = "title"; field_names[1] = "content"; field_weights[0] = 100; field_weights[1] = 1; sphinx_set_field_weights ( client, 2, field_names, field_weights ); field_weights[0] = 1; field_weights[1] = 1; res = sphinx_query ( client, query, index, NULL ); if ( !res ) { g_failed += ( res==NULL ); if ( !g_smoke ) die ( "query failed: %s", sphinx_error(client) ); } if ( g_smoke ) printf ( "Query '%s' retrieved %d of %d matches.\n", query, res->total, res->total_found ); else printf ( "Query '%s' retrieved %d of %d matches in %d.%03d sec.\n", query, res->total, res->total_found, res->time_msec/1000, res->time_msec%1000 ); printf ( "Query stats:\n" ); for ( i=0; inum_words; i++ ) printf ( "\t'%s' found %d times in %d documents\n", res->words[i].word, res->words[i].hits, res->words[i].docs ); printf ( "\nMatches:\n" ); for ( i=0; inum_matches; i++ ) { printf ( "%d. doc_id=%d, weight=%d", 1+i, (int)sphinx_get_id ( res, i ), sphinx_get_weight ( res, i ) ); for ( j=0; jnum_attrs; j++ ) { printf ( ", %s=", res->attr_names[j] ); switch ( res->attr_types[j] ) { case SPH_ATTR_MULTI64: case SPH_ATTR_MULTI: mva = sphinx_get_mva ( res, i, j ); mva_len = *mva++; printf ( "(" ); for ( k=0; kattr_types[j]==SPH_ATTR_MULTI ? mva[k] : (unsigned int)sphinx_get_mva64_value ( mva, k ) ) ); printf ( ")" ); break; case SPH_ATTR_FLOAT: printf ( "%f", sphinx_get_float ( res, i, j ) ); break; case SPH_ATTR_STRING: printf ( "%s", sphinx_get_string ( res, i, j ) ); break; default: printf ( "%u", (unsigned int)sphinx_get_int ( res, i, j ) ); break; } } printf ( "\n" ); } printf ( "\n" ); } void test_excerpt ( sphinx_client * client ) { const char * docs[] = { "this is my test text to be highlighted, and for the sake of the testing we need to pump its length somewhat", "another test text to be highlighted, below limit", "test number three, without phrase match", "final test, not only without phrase match, but also above limit and with swapped phrase text test as well" }; const int ndocs = sizeof(docs)/sizeof(docs[0]); const char * words = "test text"; const char * index = "test1"; sphinx_excerpt_options opts; char ** res; int i, j; sphinx_init_excerpt_options ( &opts ); opts.limit = 60; opts.around = 3; opts.allow_empty = SPH_TRUE; for ( j=0; j<2; j++ ) { opts.exact_phrase = j; printf ( "exact_phrase=%d\n", j ); res = sphinx_build_excerpts ( client, ndocs, docs, index, words, &opts ); if ( !res ) { g_failed += ( res==NULL ); if ( !g_smoke ) die ( "query failed: %s", sphinx_error(client) ); } for ( i=0; i" "The institutional investment manager it. Is Filing this report and." "" "It is signed hereby represent. That it is all information." "are It or is" "" "" "cool It is cooler" "" "It is another place!" "" }; const int ndocs = sizeof(docs)/sizeof(docs[0]); const char * words = "it is"; const char * index = "test1"; sphinx_excerpt_options opts; char ** res; int i, j; sphinx_init_excerpt_options ( &opts ); opts.limit = 150; opts.limit_passages = 8; opts.around = 8; opts.html_strip_mode = "strip"; opts.passage_boundary = "zone"; opts.emit_zones = SPH_TRUE; for ( j=0; j<2; j++ ) { if ( j==1 ) { opts.passage_boundary = "sentence"; opts.emit_zones = SPH_FALSE; } printf ( "passage_boundary=%s\n", opts.passage_boundary ); res = sphinx_build_excerpts ( client, ndocs, docs, index, words, &opts ); if ( !res ) die ( "query failed: %s", sphinx_error(client) ); for ( i=0; i % s <-\n\n", name ); } int main ( int argc, char ** argv ) { int i, port = 0; sphinx_client * client; sphinx_uint64_t override_docid = 2; unsigned int override_value = 2000; for ( i=1; i coreseek-4.1-beta/csft-4.1/api/libsphinxclient/test03.sln100777 0 0 1605 11643565730 16271 0Microsoft Visual Studio Solution File, Format Version 8.00 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test03", "test03.vcproj", "{3F3C7CA8-E864-4FB5-8EB0-A114FAFBE24E}" ProjectSection(ProjectDependencies) = postProject EndProjectSection EndProject Global GlobalSection(SolutionConfiguration) = preSolution Debug = Debug Release = Release EndGlobalSection GlobalSection(ProjectConfiguration) = postSolution {3F3C7CA8-E864-4FB5-8EB0-A114FAFBE24E}.Debug.ActiveCfg = Debug|Win32 {3F3C7CA8-E864-4FB5-8EB0-A114FAFBE24E}.Debug.Build.0 = Debug|Win32 {3F3C7CA8-E864-4FB5-8EB0-A114FAFBE24E}.Release.ActiveCfg = Release|Win32 {3F3C7CA8-E864-4FB5-8EB0-A114FAFBE24E}.Release.Build.0 = Release|Win32 EndGlobalSection GlobalSection(ExtensibilityGlobals) = postSolution EndGlobalSection GlobalSection(ExtensibilityAddIns) = postSolution EndGlobalSection EndGlobal coreseek-4.1-beta/csft-4.1/api/libsphinxclient/test03.vcproj100777 0 0 6645 11643565730 17011 0 coreseek-4.1-beta/csft-4.1/api/ruby/ 40777 0 0 0 11647303450 12102 5coreseek-4.1-beta/csft-4.1/api/ruby/init.rb100777 0 0 57 11643565730 13443 0require File.dirname(__FILE__) + '/lib/sphinx' coreseek-4.1-beta/csft-4.1/api/ruby/install.rb100777 0 0 377 11643565730 14173 0require 'fileutils' sphinx_config = File.dirname(__FILE__) + '/../../../config/sphinx.yml' FileUtils.cp File.dirname(__FILE__) + '/sphinx.yml.tpl', sphinx_config unless File.exist?(sphinx_config) puts IO.read(File.join(File.dirname(__FILE__), 'README')) coreseek-4.1-beta/csft-4.1/api/ruby/lib/ 40777 0 0 0 11647303447 12656 5coreseek-4.1-beta/csft-4.1/api/ruby/lib/sphinx/ 40777 0 0 0 11647303447 14167 5coreseek-4.1-beta/csft-4.1/api/ruby/lib/sphinx.rb100777 0 0 253 11643565730 14575 0require File.dirname(__FILE__) + '/sphinx/request' require File.dirname(__FILE__) + '/sphinx/response' require File.dirname(__FILE__) + '/sphinx/client' module Sphinx endcoreseek-4.1-beta/csft-4.1/api/ruby/lib/sphinx/client.rb100777 0 0 112707 11643565730 16143 0# = client.rb - Sphinx Client API # # Author:: Dmytro Shteflyuk . # Copyright:: Copyright (c) 2006 - 2008 Dmytro Shteflyuk # License:: Distributes under the same terms as Ruby # Version:: 0.9.9-r1299 # Website:: http://kpumuk.info/projects/ror-plugins/sphinx # # This library is distributed under the terms of the Ruby license. # You can freely distribute/modify this library. # ==Sphinx Client API # # The Sphinx Client API is used to communicate with searchd # daemon and get search results from Sphinx. # # ===Usage # # sphinx = Sphinx::Client.new # result = sphinx.Query('test') # ids = result['matches'].map { |match| match['id'] }.join(',') # posts = Post.find :all, :conditions => "id IN (#{ids})" # # docs = posts.map(&:body) # excerpts = sphinx.BuildExcerpts(docs, 'index', 'test') require 'socket' module Sphinx # :stopdoc: class SphinxError < StandardError; end class SphinxArgumentError < SphinxError; end class SphinxConnectError < SphinxError; end class SphinxResponseError < SphinxError; end class SphinxInternalError < SphinxError; end class SphinxTemporaryError < SphinxError; end class SphinxUnknownError < SphinxError; end # :startdoc: class Client # :stopdoc: # Known searchd commands # search command SEARCHD_COMMAND_SEARCH = 0 # excerpt command SEARCHD_COMMAND_EXCERPT = 1 # update command SEARCHD_COMMAND_UPDATE = 2 # keywords command SEARCHD_COMMAND_KEYWORDS = 3 # Current client-side command implementation versions # search command version VER_COMMAND_SEARCH = 0x119 # excerpt command version VER_COMMAND_EXCERPT = 0x102 # update command version VER_COMMAND_UPDATE = 0x102 # keywords command version VER_COMMAND_KEYWORDS = 0x100 # Known searchd status codes # general success, command-specific reply follows SEARCHD_OK = 0 # general failure, command-specific reply may follow SEARCHD_ERROR = 1 # temporaty failure, client should retry later SEARCHD_RETRY = 2 # general success, warning message and command-specific reply follow SEARCHD_WARNING = 3 # :startdoc: # Known match modes # match all query words SPH_MATCH_ALL = 0 # match any query word SPH_MATCH_ANY = 1 # match this exact phrase SPH_MATCH_PHRASE = 2 # match this boolean query SPH_MATCH_BOOLEAN = 3 # match this extended query SPH_MATCH_EXTENDED = 4 # match all document IDs w/o fulltext query, apply filters SPH_MATCH_FULLSCAN = 5 # extended engine V2 (TEMPORARY, WILL BE REMOVED IN 0.9.8-RELEASE) SPH_MATCH_EXTENDED2 = 6 # Known ranking modes (ext2 only) # default mode, phrase proximity major factor and BM25 minor one SPH_RANK_PROXIMITY_BM25 = 0 # statistical mode, BM25 ranking only (faster but worse quality) SPH_RANK_BM25 = 1 # no ranking, all matches get a weight of 1 SPH_RANK_NONE = 2 # simple word-count weighting, rank is a weighted sum of per-field keyword occurence counts SPH_RANK_WORDCOUNT = 3 # phrase proximity SPH_RANK_PROXIMITY = 4 # Known sort modes # sort by document relevance desc, then by date SPH_SORT_RELEVANCE = 0 # sort by document date desc, then by relevance desc SPH_SORT_ATTR_DESC = 1 # sort by document date asc, then by relevance desc SPH_SORT_ATTR_ASC = 2 # sort by time segments (hour/day/week/etc) desc, then by relevance desc SPH_SORT_TIME_SEGMENTS = 3 # sort by SQL-like expression (eg. "@relevance DESC, price ASC, @id DESC") SPH_SORT_EXTENDED = 4 # sort by arithmetic expression in descending order (eg. "@id + max(@weight,1000)*boost + log(price)") SPH_SORT_EXPR = 5 # Known filter types # filter by integer values set SPH_FILTER_VALUES = 0 # filter by integer range SPH_FILTER_RANGE = 1 # filter by float range SPH_FILTER_FLOATRANGE = 2 # Known attribute types # this attr is just an integer SPH_ATTR_INTEGER = 1 # this attr is a timestamp SPH_ATTR_TIMESTAMP = 2 # this attr is an ordinal string number (integer at search time, # specially handled at indexing time) SPH_ATTR_ORDINAL = 3 # this attr is a boolean bit field SPH_ATTR_BOOL = 4 # this attr is a float SPH_ATTR_FLOAT = 5 # signed 64-bit integer SPH_ATTR_BIGINT = 6 # string SPH_ATTR_STRING = 7 # this attr has multiple values (0 or more) SPH_ATTR_MULTI = 0x40000001 SPH_ATTR_MULTI64 = 0x40000002 # Known grouping functions # group by day SPH_GROUPBY_DAY = 0 # group by week SPH_GROUPBY_WEEK = 1 # group by month SPH_GROUPBY_MONTH = 2 # group by year SPH_GROUPBY_YEAR = 3 # group by attribute value SPH_GROUPBY_ATTR = 4 # group by sequential attrs pair SPH_GROUPBY_ATTRPAIR = 5 # Constructs the Sphinx::Client object and sets options to their default values. def initialize # per-client-object settings @host = 'localhost' # searchd host (default is "localhost") @port = 9312 # searchd port (default is 9312) # per-query settings @offset = 0 # how many records to seek from result-set start (default is 0) @limit = 20 # how many records to return from result-set starting at offset (default is 20) @mode = SPH_MATCH_ALL # query matching mode (default is SPH_MATCH_ALL) @weights = [] # per-field weights (default is 1 for all fields) @sort = SPH_SORT_RELEVANCE # match sorting mode (default is SPH_SORT_RELEVANCE) @sortby = '' # attribute to sort by (defualt is "") @min_id = 0 # min ID to match (default is 0, which means no limit) @max_id = 0 # max ID to match (default is 0, which means no limit) @filters = [] # search filters @groupby = '' # group-by attribute name @groupfunc = SPH_GROUPBY_DAY # function to pre-process group-by attribute value with @groupsort = '@group desc' # group-by sorting clause (to sort groups in result set with) @groupdistinct = '' # group-by count-distinct attribute @maxmatches = 1000 # max matches to retrieve @cutoff = 0 # cutoff to stop searching at (default is 0) @retrycount = 0 # distributed retries count @retrydelay = 0 # distributed retries delay @anchor = [] # geographical anchor point @indexweights = [] # per-index weights @ranker = SPH_RANK_PROXIMITY_BM25 # ranking mode (default is SPH_RANK_PROXIMITY_BM25) @maxquerytime = 0 # max query time, milliseconds (default is 0, do not limit) @fieldweights = {} # per-field-name weights @overrides = [] # per-query attribute values overrides @select = '*' # select-list (attributes or expressions, with optional aliases) # per-reply fields (for single-query case) @error = '' # last error message @warning = '' # last warning message @reqs = [] # requests storage (for multi-query case) @mbenc = '' # stored mbstring encoding end # Get last error message. def GetLastError @error end # Get last warning message. def GetLastWarning @warning end # Set searchd host name (string) and port (integer). def SetServer(host, port) assert { host.instance_of? String } assert { port.instance_of? Fixnum } @host = host @port = port end # Set offset and count into result set, # and optionally set max-matches and cutoff limits. def SetLimits(offset, limit, max = 0, cutoff = 0) assert { offset.instance_of? Fixnum } assert { limit.instance_of? Fixnum } assert { max.instance_of? Fixnum } assert { offset >= 0 } assert { limit > 0 } assert { max >= 0 } @offset = offset @limit = limit @maxmatches = max if max > 0 @cutoff = cutoff if cutoff > 0 end # Set maximum query time, in milliseconds, per-index, # integer, 0 means "do not limit" def SetMaxQueryTime(max) assert { max.instance_of? Fixnum } assert { max >= 0 } @maxquerytime = max end # Set matching mode. def SetMatchMode(mode) assert { mode == SPH_MATCH_ALL \ || mode == SPH_MATCH_ANY \ || mode == SPH_MATCH_PHRASE \ || mode == SPH_MATCH_BOOLEAN \ || mode == SPH_MATCH_EXTENDED \ || mode == SPH_MATCH_FULLSCAN \ || mode == SPH_MATCH_EXTENDED2 } @mode = mode end # Set ranking mode. def SetRankingMode(ranker) assert { ranker == SPH_RANK_PROXIMITY_BM25 \ || ranker == SPH_RANK_BM25 \ || ranker == SPH_RANK_NONE \ || ranker == SPH_RANK_WORDCOUNT \ || ranker == SPH_RANK_PROXIMITY } @ranker = ranker end # Set matches sorting mode. def SetSortMode(mode, sortby = '') assert { mode == SPH_SORT_RELEVANCE \ || mode == SPH_SORT_ATTR_DESC \ || mode == SPH_SORT_ATTR_ASC \ || mode == SPH_SORT_TIME_SEGMENTS \ || mode == SPH_SORT_EXTENDED \ || mode == SPH_SORT_EXPR } assert { sortby.instance_of? String } assert { mode == SPH_SORT_RELEVANCE || !sortby.empty? } @sort = mode @sortby = sortby end # Bind per-field weights by order. # # DEPRECATED; use SetFieldWeights() instead. def SetWeights(weights) assert { weights.instance_of? Array } weights.each do |weight| assert { weight.instance_of? Fixnum } end @weights = weights end # Bind per-field weights by name. # # Takes string (field name) to integer name (field weight) hash as an argument. # * Takes precedence over SetWeights(). # * Unknown names will be silently ignored. # * Unbound fields will be silently given a weight of 1. def SetFieldWeights(weights) assert { weights.instance_of? Hash } weights.each do |name, weight| assert { name.instance_of? String } assert { weight.instance_of? Fixnum } end @fieldweights = weights end # Bind per-index weights by name. def SetIndexWeights(weights) assert { weights.instance_of? Hash } weights.each do |index, weight| assert { index.instance_of? String } assert { weight.instance_of? Fixnum } end @indexweights = weights end # Set IDs range to match. # # Only match records if document ID is beetwen min_id and max_id (inclusive). def SetIDRange(min, max) assert { min.instance_of?(Fixnum) or min.instance_of?(Bignum) } assert { max.instance_of?(Fixnum) or max.instance_of?(Bignum) } assert { min <= max } @min_id = min @max_id = max end # Set values filter. # # Only match those records where attribute column values # are in specified set. def SetFilter(attribute, values, exclude = false) assert { attribute.instance_of? String } assert { values.instance_of? Array } assert { !values.empty? } if values.instance_of?(Array) && values.size > 0 values.each do |value| assert { value.instance_of? Fixnum } end @filters << { 'type' => SPH_FILTER_VALUES, 'attr' => attribute, 'exclude' => exclude, 'values' => values } end end # Set range filter. # # Only match those records where attribute column value # is beetwen min and max (including min and max). def SetFilterRange(attribute, min, max, exclude = false) assert { attribute.instance_of? String } assert { min.instance_of? Fixnum or min.instance_of? Bignum } assert { max.instance_of? Fixnum or max.instance_of? Bignum } assert { min <= max } @filters << { 'type' => SPH_FILTER_RANGE, 'attr' => attribute, 'exclude' => exclude, 'min' => min, 'max' => max } end # Set float range filter. # # Only match those records where attribute column value # is beetwen min and max (including min and max). def SetFilterFloatRange(attribute, min, max, exclude = false) assert { attribute.instance_of? String } assert { min.instance_of? Float } assert { max.instance_of? Float } assert { min <= max } @filters << { 'type' => SPH_FILTER_FLOATRANGE, 'attr' => attribute, 'exclude' => exclude, 'min' => min, 'max' => max } end # Setup anchor point for geosphere distance calculations. # # Required to use @geodist in filters and sorting # distance will be computed to this point. Latitude and longitude # must be in radians. # # * attrlat -- is the name of latitude attribute # * attrlong -- is the name of longitude attribute # * lat -- is anchor point latitude, in radians # * long -- is anchor point longitude, in radians def SetGeoAnchor(attrlat, attrlong, lat, long) assert { attrlat.instance_of? String } assert { attrlong.instance_of? String } assert { lat.instance_of? Float } assert { long.instance_of? Float } @anchor = { 'attrlat' => attrlat, 'attrlong' => attrlong, 'lat' => lat, 'long' => long } end # Set grouping attribute and function. # # In grouping mode, all matches are assigned to different groups # based on grouping function value. # # Each group keeps track of the total match count, and the best match # (in this group) according to current sorting function. # # The final result set contains one best match per group, with # grouping function value and matches count attached. # # Groups in result set could be sorted by any sorting clause, # including both document attributes and the following special # internal Sphinx attributes: # # * @id - match document ID; # * @weight, @rank, @relevance - match weight; # * @group - groupby function value; # * @count - amount of matches in group. # # the default mode is to sort by groupby value in descending order, # ie. by '@group desc'. # # 'total_found' would contain total amount of matching groups over # the whole index. # # WARNING: grouping is done in fixed memory and thus its results # are only approximate; so there might be more groups reported # in total_found than actually present. @count might also # be underestimated. # # For example, if sorting by relevance and grouping by "published" # attribute with SPH_GROUPBY_DAY function, then the result set will # contain one most relevant match per each day when there were any # matches published, with day number and per-day match count attached, # and sorted by day number in descending order (ie. recent days first). def SetGroupBy(attribute, func, groupsort = '@group desc') assert { attribute.instance_of? String } assert { groupsort.instance_of? String } assert { func == SPH_GROUPBY_DAY \ || func == SPH_GROUPBY_WEEK \ || func == SPH_GROUPBY_MONTH \ || func == SPH_GROUPBY_YEAR \ || func == SPH_GROUPBY_ATTR \ || func == SPH_GROUPBY_ATTRPAIR } @groupby = attribute @groupfunc = func @groupsort = groupsort end # Set count-distinct attribute for group-by queries. def SetGroupDistinct(attribute) assert { attribute.instance_of? String } @groupdistinct = attribute end # Set distributed retries count and delay. def SetRetries(count, delay = 0) assert { count.instance_of? Fixnum } assert { delay.instance_of? Fixnum } @retrycount = count @retrydelay = delay end # Set attribute values override # # There can be only one override per attribute. # +values+ must be a hash that maps document IDs to attribute values. def SetOverride(attrname, attrtype, values) assert { attrname.instance_of? String } assert { [SPH_ATTR_INTEGER, SPH_ATTR_TIMESTAMP, SPH_ATTR_BOOL, SPH_ATTR_FLOAT, SPH_ATTR_BIGINT].include?(attrtype) } assert { values.instance_of? Hash } @overrides << { 'attr' => attrname, 'type' => attrtype, 'values' => values } end # Set select-list (attributes or expressions), SQL-like syntax. def SetSelect(select) assert { select.instance_of? String } @select = select end # Clear all filters (for multi-queries). def ResetFilters @filters = [] @anchor = [] end # Clear groupby settings (for multi-queries). def ResetGroupBy @groupby = '' @groupfunc = SPH_GROUPBY_DAY @groupsort = '@group desc' @groupdistinct = '' end # Clear all attribute value overrides (for multi-queries). def ResetOverrides @overrides = [] end # Connect to searchd server and run given search query. # # query is query string # index is index name (or names) to query. default value is "*" which means # to query all indexes. Accepted characters for index names are letters, numbers, # dash, and underscore; everything else is considered a separator. Therefore, # all the following calls are valid and will search two indexes: # # sphinx.Query('test query', 'main delta') # sphinx.Query('test query', 'main;delta') # sphinx.Query('test query', 'main, delta') # # Index order matters. If identical IDs are found in two or more indexes, # weight and attribute values from the very last matching index will be used # for sorting and returning to client. Therefore, in the example above, # matches from "delta" index will always "win" over matches from "main". # # Returns false on failure. # Returns hash which has the following keys on success: # # * 'matches' -- array of hashes {'weight', 'group', 'id'}, where 'id' is document_id. # * 'total' -- total amount of matches retrieved (upto SPH_MAX_MATCHES, see sphinx.h) # * 'total_found' -- total amount of matching documents in index # * 'time' -- search time # * 'words' -- hash which maps query terms (stemmed!) to ('docs', 'hits') hash def Query(query, index = '*', comment = '') assert { @reqs.empty? } @reqs = [] self.AddQuery(query, index, comment) results = self.RunQueries # probably network error; error message should be already filled return false unless results.instance_of?(Array) @error = results[0]['error'] @warning = results[0]['warning'] return false if results[0]['status'] == SEARCHD_ERROR return results[0] end # Add query to batch. # # Batch queries enable searchd to perform internal optimizations, # if possible; and reduce network connection overheads in all cases. # # For instance, running exactly the same query with different # groupby settings will enable searched to perform expensive # full-text search and ranking operation only once, but compute # multiple groupby results from its output. # # Parameters are exactly the same as in Query call. # Returns index to results array returned by RunQueries call. def AddQuery(query, index = '*', comment = '') # build request # mode and limits request = Request.new request.put_int @offset, @limit, @mode, @ranker, @sort request.put_string @sortby # query itself request.put_string query # weights request.put_int_array @weights # indexes request.put_string index # id64 range marker request.put_int 1 # id64 range request.put_int64 @min_id.to_i, @max_id.to_i # filters request.put_int @filters.length @filters.each do |filter| request.put_string filter['attr'] request.put_int filter['type'] case filter['type'] when SPH_FILTER_VALUES request.put_int64_array filter['values'] when SPH_FILTER_RANGE request.put_int64 filter['min'], filter['max'] when SPH_FILTER_FLOATRANGE request.put_float filter['min'], filter['max'] else raise SphinxInternalError, 'Internal error: unhandled filter type' end request.put_int filter['exclude'] ? 1 : 0 end # group-by clause, max-matches count, group-sort clause, cutoff count request.put_int @groupfunc request.put_string @groupby request.put_int @maxmatches request.put_string @groupsort request.put_int @cutoff, @retrycount, @retrydelay request.put_string @groupdistinct # anchor point if @anchor.empty? request.put_int 0 else request.put_int 1 request.put_string @anchor['attrlat'], @anchor['attrlong'] request.put_float @anchor['lat'], @anchor['long'] end # per-index weights request.put_int @indexweights.length @indexweights.each do |idx, weight| request.put_string idx request.put_int weight end # max query time request.put_int @maxquerytime # per-field weights request.put_int @fieldweights.length @fieldweights.each do |field, weight| request.put_string field request.put_int weight end # comment request.put_string comment # attribute overrides request.put_int @overrides.length for entry in @overrides do request.put_string entry['attr'] request.put_int entry['type'], entry['values'].size entry['values'].each do |id, val| assert { id.instance_of?(Fixnum) || id.instance_of?(Bignum) } assert { val.instance_of?(Fixnum) || val.instance_of?(Bignum) || val.instance_of?(Float) } request.put_int64 id case entry['type'] when SPH_ATTR_FLOAT request.put_float val when SPH_ATTR_BIGINT request.put_int64 val else request.put_int val end end end # select-list request.put_string @select # store request to requests array @reqs << request.to_s; return @reqs.length - 1 end # Run queries batch. # # Returns an array of result sets on success. # Returns false on network IO failure. # # Each result set in returned array is a hash which containts # the same keys as the hash returned by Query, plus: # # * 'error' -- search error for this query # * 'words' -- hash which maps query terms (stemmed!) to ( "docs", "hits" ) hash def RunQueries if @reqs.empty? @error = 'No queries defined, issue AddQuery() first' return false end req = @reqs.join('') nreqs = @reqs.length @reqs = [] response = PerformRequest(:search, req, nreqs) # parse response begin results = [] ires = 0 while ires < nreqs ires += 1 result = {} result['error'] = '' result['warning'] = '' # extract status status = result['status'] = response.get_int if status != SEARCHD_OK message = response.get_string if status == SEARCHD_WARNING result['warning'] = message else result['error'] = message results << result next end end # read schema fields = [] attrs = {} attrs_names_in_order = [] nfields = response.get_int while nfields > 0 nfields -= 1 fields << response.get_string end result['fields'] = fields nattrs = response.get_int while nattrs > 0 nattrs -= 1 attr = response.get_string type = response.get_int attrs[attr] = type attrs_names_in_order << attr end result['attrs'] = attrs # read match count count = response.get_int id64 = response.get_int # read matches result['matches'] = [] while count > 0 count -= 1 if id64 != 0 doc = response.get_int64 weight = response.get_int else doc, weight = response.get_ints(2) end r = {} # This is a single result put in the result['matches'] array r['id'] = doc r['weight'] = weight attrs_names_in_order.each do |a| r['attrs'] ||= {} case attrs[a] when SPH_ATTR_BIGINT # handle 64-bit ints r['attrs'][a] = response.get_int64 when SPH_ATTR_FLOAT # handle floats r['attrs'][a] = response.get_float when SPH_ATTR_STRING # handle string r['attrs'][a] = response.get_string else # handle everything else as unsigned ints val = response.get_int if attrs[a]==SPH_ATTR_MULTI r['attrs'][a] = [] 1.upto(val) do r['attrs'][a] << response.get_int end elsif attrs[a]==SPH_ATTR_MULTI64 r['attrs'][a] = [] val = val/2 1.upto(val) do r['attrs'][a] << response.get_int64 end else r['attrs'][a] = val end end end result['matches'] << r end result['total'], result['total_found'], msecs, words = response.get_ints(4) result['time'] = '%.3f' % (msecs / 1000.0) result['words'] = {} while words > 0 words -= 1 word = response.get_string docs, hits = response.get_ints(2) result['words'][word] = { 'docs' => docs, 'hits' => hits } end results << result end #rescue EOFError # @error = 'incomplete reply' # raise SphinxResponseError, @error end return results end # Connect to searchd server and generate exceprts from given documents. # # * docs -- an array of strings which represent the documents' contents # * index -- a string specifiying the index which settings will be used # for stemming, lexing and case folding # * words -- a string which contains the words to highlight # * opts is a hash which contains additional optional highlighting parameters. # # You can use following parameters: # * 'before_match' -- a string to insert before a set of matching words, default is "" # * 'after_match' -- a string to insert after a set of matching words, default is "" # * 'chunk_separator' -- a string to insert between excerpts chunks, default is " ... " # * 'limit' -- max excerpt size in symbols (codepoints), default is 256 # * 'around' -- how much words to highlight around each match, default is 5 # * 'exact_phrase' -- whether to highlight exact phrase matches only, default is false # * 'single_passage' -- whether to extract single best passage only, default is false # * 'use_boundaries' -- whether to extract passages by phrase boundaries setup in tokenizer # * 'weight_order' -- whether to order best passages in document (default) or weight order # # Returns false on failure. # Returns an array of string excerpts on success. def BuildExcerpts(docs, index, words, opts = {}) assert { docs.instance_of? Array } assert { index.instance_of? String } assert { words.instance_of? String } assert { opts.instance_of? Hash } # fixup options opts['before_match'] ||= ''; opts['after_match'] ||= ''; opts['chunk_separator'] ||= ' ... '; opts['html_strip_mode'] ||= 'index'; opts['limit'] ||= 256; opts['limit_passages'] ||= 0; opts['limit_words'] ||= 0; opts['around'] ||= 5; opts['start_passage_id'] ||= 1; opts['exact_phrase'] ||= false opts['single_passage'] ||= false opts['use_boundaries'] ||= false opts['weight_order'] ||= false opts['load_files'] ||= false opts['allow_empty'] ||= false # build request # v.1.0 req flags = 1 flags |= 2 if opts['exact_phrase'] flags |= 4 if opts['single_passage'] flags |= 8 if opts['use_boundaries'] flags |= 16 if opts['weight_order'] flags |= 32 if opts['query_mode'] flags |= 64 if opts['force_all_words'] flags |= 128 if opts['load_files'] flags |= 256 if opts['allow_empty'] request = Request.new request.put_int 0, flags # mode=0, flags=1 (remove spaces) # req index request.put_string index # req words request.put_string words # options request.put_string opts['before_match'] request.put_string opts['after_match'] request.put_string opts['chunk_separator'] request.put_int opts['limit'].to_i, opts['around'].to_i # options v1.2 request.put_int opts['limit_passages'].to_i request.put_int opts['limit_words'].to_i request.put_int opts['start_passage_id'].to_i request.put_string opts['html_strip_mode'] # documents request.put_int docs.size docs.each do |doc| assert { doc.instance_of? String } request.put_string doc end response = PerformRequest(:excerpt, request) # parse response begin res = [] docs.each do |doc| res << response.get_string end rescue EOFError @error = 'incomplete reply' raise SphinxResponseError, @error end return res end # Connect to searchd server, and generate keyword list for a given query. # # Returns an array of words on success. def BuildKeywords(query, index, hits) assert { query.instance_of? String } assert { index.instance_of? String } assert { hits.instance_of?(TrueClass) || hits.instance_of?(FalseClass) } # build request request = Request.new # v.1.0 req request.put_string query # req query request.put_string index # req index request.put_int hits ? 1 : 0 response = PerformRequest(:keywords, request) # parse response begin res = [] nwords = response.get_int 0.upto(nwords - 1) do |i| tokenized = response.get_string normalized = response.get_string entry = { 'tokenized' => tokenized, 'normalized' => normalized } entry['docs'], entry['hits'] = response.get_ints(2) if hits res << entry end rescue EOFError @error = 'incomplete reply' raise SphinxResponseError, @error end return res end # Batch update given attributes in given rows in given indexes. # # * +index+ is a name of the index to be updated # * +attrs+ is an array of attribute name strings. # * +values+ is a hash where key is document id, and value is an array of # * +mva+ identifies whether update MVA # new attribute values # # Returns number of actually updated documents (0 or more) on success. # Returns -1 on failure. # # Usage example: # sphinx.UpdateAttributes('test1', ['group_id'], { 1 => [456] }) def UpdateAttributes(index, attrs, values, mva = false) # verify everything assert { index.instance_of? String } assert { mva.instance_of?(TrueClass) || mva.instance_of?(FalseClass) } assert { attrs.instance_of? Array } attrs.each do |attr| assert { attr.instance_of? String } end assert { values.instance_of? Hash } values.each do |id, entry| assert { id.instance_of? Fixnum } assert { entry.instance_of? Array } assert { entry.length == attrs.length } entry.each do |v| if mva assert { v.instance_of? Array } v.each { |vv| assert { vv.instance_of? Fixnum } } else assert { v.instance_of? Fixnum } end end end # build request request = Request.new request.put_string index request.put_int attrs.length for attr in attrs request.put_string attr request.put_int mva ? 1 : 0 end request.put_int values.length values.each do |id, entry| request.put_int64 id if mva entry.each { |v| request.put_int_array v } else request.put_int(*entry) end end response = PerformRequest(:update, request) # parse response begin return response.get_int rescue EOFError @error = 'incomplete reply' raise SphinxResponseError, @error end end protected # Connect to searchd server. def Connect begin if @host[0,1]=='/' sock = UNIXSocket.new(@host) else sock = TCPSocket.new(@host, @port) end rescue => err @error = "connection to #{@host}:#{@port} failed (error=#{err})" raise SphinxConnectError, @error end v = sock.recv(4).unpack('N*').first if v < 1 sock.close @error = "expected searchd protocol version 1+, got version '#{v}'" raise SphinxConnectError, @error end sock.send([1].pack('N'), 0) sock end # Get and check response packet from searchd server. def GetResponse(sock, client_version) response = '' len = 0 header = sock.recv(8) if header.length == 8 status, ver, len = header.unpack('n2N') left = len.to_i while left > 0 do begin chunk = sock.recv(left) if chunk response << chunk left -= chunk.length end rescue EOFError break end end end sock.close # check response read = response.length if response.empty? or read != len.to_i @error = response.empty? \ ? 'received zero-sized searchd response' \ : "failed to read searchd response (status=#{status}, ver=#{ver}, len=#{len}, read=#{read})" raise SphinxResponseError, @error end # check status if (status == SEARCHD_WARNING) wlen = response[0, 4].unpack('N*').first @warning = response[4, wlen] return response[4 + wlen, response.length - 4 - wlen] end if status == SEARCHD_ERROR @error = 'searchd error: ' + response[4, response.length - 4] raise SphinxInternalError, @error end if status == SEARCHD_RETRY @error = 'temporary searchd error: ' + response[4, response.length - 4] raise SphinxTemporaryError, @error end unless status == SEARCHD_OK @error = "unknown status code: '#{status}'" raise SphinxUnknownError, @error end # check version if ver < client_version @warning = "searchd command v.#{ver >> 8}.#{ver & 0xff} older than client's " + "v.#{client_version >> 8}.#{client_version & 0xff}, some options might not work" end return response end # Connect, send query, get response. def PerformRequest(command, request, additional = nil) cmd = command.to_s.upcase command_id = Sphinx::Client.const_get('SEARCHD_COMMAND_' + cmd) command_ver = Sphinx::Client.const_get('VER_COMMAND_' + cmd) sock = self.Connect len = request.to_s.length + (additional != nil ? 8 : 0) header = [command_id, command_ver, len].pack('nnN') header << [0, additional].pack('NN') if additional != nil sock.send(header + request.to_s, 0) response = self.GetResponse(sock, command_ver) return Response.new(response) end # :stopdoc: def assert raise 'Assertion failed!' unless yield if $DEBUG end # :startdoc: end end coreseek-4.1-beta/csft-4.1/api/ruby/lib/sphinx/request.rb100777 0 0 2434 11643565730 16310 0module Sphinx # Pack ints, floats, strings, and arrays to internal representation # needed by Sphinx search engine. class Request # Initialize new request. def initialize @request = '' end # Put int(s) to request. def put_int(*ints) ints.each { |i| @request << [i].pack('N') } end # Put 64-bit int(s) to request. def put_int64(*ints) ints.each { |i| @request << [i].pack('q').reverse }#[i >> 32, i & ((1 << 32) - 1)].pack('NN') } end # Put string(s) to request (first length, then the string itself). def put_string(*strings) strings.each { |s| @request << [s.length].pack('N') + s } end # Put float(s) to request. def put_float(*floats) floats.each do |f| t1 = [f].pack('f') # machine order t2 = t1.unpack('L*').first # int in machine order @request << [t2].pack('N') end end # Put array of ints to request (first length, then the array itself) def put_int_array(arr) put_int arr.length, *arr end # Put array of 64-bit ints to request (first length, then the array itself) def put_int64_array(arr) put_int arr.length put_int64(*arr) end # Returns the entire message def to_s @request end end end coreseek-4.1-beta/csft-4.1/api/ruby/lib/sphinx/response.rb100777 0 0 3255 11643565730 16460 0module Sphinx # Unpack internal Sphinx representation of ints, floats, strings, and arrays. # needed by Sphinx search engine. class Response # Initialize new request. def initialize(response) @response = response @position = 0 @size = response.length end # Gets current stream position. def position @position end # Gets response size. def size @size end # Returns true when response stream is out. def eof? @position >= @size end # Get int from stream. def get_int raise EOFError if @position + 4 > @size value = @response[@position, 4].unpack('N*').first @position += 4 return value end # Get 64-bit int from stream. def get_int64 raise EOFError if @position + 8 > @size hi, lo = @response[@position, 8].unpack('N*N*') @position += 8 return (hi << 32) + lo end # Get array of count ints from stream. def get_ints(count) length = 4 * count raise EOFError if @position + length > @size values = @response[@position, length].unpack('N*' * count) @position += length return values end # Get string from stream. def get_string length = get_int raise EOFError if @position + length > @size value = length > 0 ? @response[@position, length] : '' @position += length return value end # Get float from stream. def get_float raise EOFError if @position + 4 > @size uval = @response[@position, 4].unpack('N*').first; @position += 4 return ([uval].pack('L')).unpack('f*').first end end endcoreseek-4.1-beta/csft-4.1/api/ruby/Rakefile100777 0 0 1032 11643565730 13652 0require 'rake' require 'spec/rake/spectask' require 'rake/rdoctask' desc 'Default: run unit tests.' task :default => :spec desc 'Test the sphinx plugin.' Spec::Rake::SpecTask.new(:spec) do |t| t.libs << 'lib' t.pattern = 'spec/*_spec.rb' end desc 'Generate documentation for the sphinx plugin.' Rake::RDocTask.new(:rdoc) do |rdoc| rdoc.rdoc_dir = 'rdoc' rdoc.title = 'Sphinx Client API' rdoc.options << '--line-numbers' << '--inline-source' rdoc.rdoc_files.include('README') rdoc.rdoc_files.include('lib/**/*.rb') end coreseek-4.1-beta/csft-4.1/api/ruby/README.rdoc100777 0 0 2305 11643565730 14017 0=Sphinx Client API 0.9.9-dev (r1299) This document gives an overview of what is Sphinx itself and how to use in within Ruby on Rails. For more information or documentation, please go to http://www.sphinxsearch.com ==Sphinx Sphinx is a standalone full-text search engine, meant to provide fast, size-efficient and relevant fulltext search functions to other applications. Sphinx was specially designed to integrate well with SQL databases and scripting languages. Currently built-in data sources support fetching data either via direct connection to MySQL, or from an XML pipe. Simplest way to communicate with Sphinx is to use searchd - a daemon to search through fulltext indices from external software. ==Documentation You can create the documentation by running: rake rdoc ==Latest version You can always get latest version from http://kpumuk.info/projects/ror-plugins/sphinx ==Credits Dmytro Shteflyuk http://kpumuk.info Andrew Aksyonoff http://sphinxsearch.com/ Special thanks to Alexey Kovyrin http://blog.kovyrin.net ==License This library is distributed under the terms of the Ruby license. You can freely distribute/modify this library. coreseek-4.1-beta/csft-4.1/api/ruby/spec/ 40777 0 0 0 11647303447 13042 5coreseek-4.1-beta/csft-4.1/api/ruby/spec/client_response_spec.rb100777 0 0 11140 11643565730 17713 0require File.dirname(__FILE__) + '/../init' # To execute these tests you need to execute sphinx_test.sql and configure sphinx using sphinx.conf # (both files are placed under sphinx directory) context 'The SphinxApi connected to Sphinx' do setup do @sphinx = Sphinx::Client.new end specify 'should parse response in Query method' do result = @sphinx.Query('wifi', 'test1') validate_results_wifi(result) end specify 'should process 64-bit keys in Query method' do result = @sphinx.Query('wifi', 'test2') result['total_found'].should == 3 result['matches'].length.should == 3 result['matches'][0]['id'].should == 4294967298 result['matches'][1]['id'].should == 4294967299 result['matches'][2]['id'].should == 4294967297 end specify 'should parse batch-query responce in RunQueries method' do @sphinx.AddQuery('wifi', 'test1') @sphinx.AddQuery('gprs', 'test1') results = @sphinx.RunQueries results.should be_an_instance_of(Array) results.length.should == 2 validate_results_wifi(results[0]) end specify 'should parse response in BuildExcerpts method' do result = @sphinx.BuildExcerpts(['what the world', 'London is the capital of Great Britain'], 'test1', 'the') result.should == ['what the world', 'London is the capital of Great Britain'] end specify 'should parse response in BuildKeywords method' do result = @sphinx.BuildKeywords('wifi gprs', 'test1', true) result.should == [ { 'normalized' => 'wifi', 'tokenized' => 'wifi', 'hits' => 6, 'docs' => 3 }, { 'normalized' => 'gprs', 'tokenized' => 'gprs', 'hits' => 1, 'docs' => 1 } ] end specify 'should parse response in UpdateAttributes method' do @sphinx.UpdateAttributes('test1', ['group_id'], { 2 => [1] }).should == 1 result = @sphinx.Query('wifi', 'test1') result['matches'][0]['attrs']['group_id'].should == 1 @sphinx.UpdateAttributes('test1', ['group_id'], { 2 => [2] }).should == 1 result = @sphinx.Query('wifi', 'test1') result['matches'][0]['attrs']['group_id'].should == 2 end specify 'should parse response in UpdateAttributes method with MVA' do @sphinx.UpdateAttributes('test1', ['tags'], { 2 => [[1, 2, 3, 4, 5, 6, 7, 8, 9]] }, true).should == 1 result = @sphinx.Query('wifi', 'test1') result['matches'][0]['attrs']['tags'].should == [1, 2, 3, 4, 5, 6, 7, 8, 9] @sphinx.UpdateAttributes('test1', ['tags'], { 2 => [[5, 6, 7, 8]] }, true).should == 1 result = @sphinx.Query('wifi', 'test1') result['matches'][0]['attrs']['tags'].should == [5, 6, 7, 8] end specify 'should process errors in Query method' do @sphinx.Query('wifi', 'fakeindex').should be_false @sphinx.GetLastError.length.should_not == 0 end specify 'should process errors in RunQueries method' do @sphinx.AddQuery('wifi', 'fakeindex') r = @sphinx.RunQueries r[0]['error'].length.should_not == 0 end def validate_results_wifi(result) result['total_found'].should == 3 result['matches'].length.should == 3 result['time'].should_not be_nil result['attrs'].should == { 'group_id' => Sphinx::Client::SPH_ATTR_INTEGER, 'created_at' => Sphinx::Client::SPH_ATTR_TIMESTAMP, 'rating' => Sphinx::Client::SPH_ATTR_FLOAT, 'tags' => Sphinx::Client::SPH_ATTR_MULTI | Sphinx::Client::SPH_ATTR_INTEGER } result['fields'].should == [ 'name', 'description' ] result['total'].should == 3 result['matches'].should be_an_instance_of(Array) result['matches'][0]['id'].should == 2 result['matches'][0]['weight'].should == 2 result['matches'][0]['attrs']['group_id'].should == 2 result['matches'][0]['attrs']['created_at'].should == 1175658555 result['matches'][0]['attrs']['tags'].should == [5, 6, 7, 8] ('%0.2f' % result['matches'][0]['attrs']['rating']).should == '54.85' result['matches'][1]['id'].should == 3 result['matches'][1]['weight'].should == 2 result['matches'][1]['attrs']['group_id'].should == 1 result['matches'][1]['attrs']['created_at'].should == 1175658647 result['matches'][1]['attrs']['tags'].should == [1, 7, 9, 10] ('%0.2f' % result['matches'][1]['attrs']['rating']).should == '16.25' result['matches'][2]['id'].should == 1 result['matches'][2]['weight'].should == 1 result['matches'][2]['attrs']['group_id'].should == 1 result['matches'][2]['attrs']['created_at'].should == 1175658490 result['matches'][2]['attrs']['tags'].should == [1, 2, 3, 4] ('%0.2f' % result['matches'][2]['attrs']['rating']).should == '13.32' result['words'].should == { 'wifi' => { 'hits' => 6, 'docs' => 3 } } end end coreseek-4.1-beta/csft-4.1/api/ruby/spec/client_spec.rb100777 0 0 43121 11643565730 16001 0require File.dirname(__FILE__) + '/../init' class SphinxSpecError < StandardError; end module SphinxFixtureHelper def sphinx_fixture(name) `php #{File.dirname(__FILE__)}/fixtures/#{name}.php` end end module SphinxApiCall def create_sphinx @sphinx = Sphinx::Client.new @sock = mock('TCPSocket') @sphinx.stub!(:Connect).and_return(@sock) @sphinx.stub!(:GetResponse).and_raise(SphinxSpecError) return @sphinx end def safe_call yield rescue SphinxSpecError end end describe 'The Connect method of Sphinx::Client' do before(:each) do @sphinx = Sphinx::Client.new @sock = mock('TCPSocket') end it 'should establish TCP connection to the server and initialize session' do TCPSocket.should_receive(:new).with('localhost', 9312).and_return(@sock) @sock.should_receive(:recv).with(4).and_return([1].pack('N')) @sock.should_receive(:send).with([1].pack('N'), 0) @sphinx.send(:Connect).should be(@sock) end it 'should raise exception when searchd protocol is not 1+' do TCPSocket.should_receive(:new).with('localhost', 9312).and_return(@sock) @sock.should_receive(:recv).with(4).and_return([0].pack('N')) @sock.should_receive(:close) lambda { @sphinx.send(:Connect) }.should raise_error(Sphinx::SphinxConnectError) @sphinx.GetLastError.should == 'expected searchd protocol version 1+, got version \'0\'' end it 'should raise exception on connection error' do TCPSocket.should_receive(:new).with('localhost', 9312).and_raise(Errno::EBADF) lambda { @sphinx.send(:Connect) }.should raise_error(Sphinx::SphinxConnectError) @sphinx.GetLastError.should == 'connection to localhost:9312 failed' end it 'should use custom host and port' do @sphinx.SetServer('anotherhost', 55555) TCPSocket.should_receive(:new).with('anotherhost', 55555).and_raise(Errno::EBADF) lambda { @sphinx.send(:Connect) }.should raise_error(Sphinx::SphinxConnectError) end end describe 'The GetResponse method of Sphinx::Client' do before(:each) do @sphinx = Sphinx::Client.new @sock = mock('TCPSocket') @sock.should_receive(:close) end it 'should receive response' do @sock.should_receive(:recv).with(8).and_return([Sphinx::Client::SEARCHD_OK, 1, 4].pack('n2N')) @sock.should_receive(:recv).with(4).and_return([0].pack('N')) @sphinx.send(:GetResponse, @sock, 1) end it 'should raise exception on zero-sized response' do @sock.should_receive(:recv).with(8).and_return([Sphinx::Client::SEARCHD_OK, 1, 0].pack('n2N')) lambda { @sphinx.send(:GetResponse, @sock, 1) }.should raise_error(Sphinx::SphinxResponseError) end it 'should raise exception when response is incomplete' do @sock.should_receive(:recv).with(8).and_return([Sphinx::Client::SEARCHD_OK, 1, 4].pack('n2N')) @sock.should_receive(:recv).with(4).and_raise(EOFError) lambda { @sphinx.send(:GetResponse, @sock, 1) }.should raise_error(Sphinx::SphinxResponseError) end it 'should set warning message when SEARCHD_WARNING received' do @sock.should_receive(:recv).with(8).and_return([Sphinx::Client::SEARCHD_WARNING, 1, 14].pack('n2N')) @sock.should_receive(:recv).with(14).and_return([5].pack('N') + 'helloworld') @sphinx.send(:GetResponse, @sock, 1).should == 'world' @sphinx.GetLastWarning.should == 'hello' end it 'should raise exception when SEARCHD_ERROR received' do @sock.should_receive(:recv).with(8).and_return([Sphinx::Client::SEARCHD_ERROR, 1, 9].pack('n2N')) @sock.should_receive(:recv).with(9).and_return([1].pack('N') + 'hello') lambda { @sphinx.send(:GetResponse, @sock, 1) }.should raise_error(Sphinx::SphinxInternalError) @sphinx.GetLastError.should == 'searchd error: hello' end it 'should raise exception when SEARCHD_RETRY received' do @sock.should_receive(:recv).with(8).and_return([Sphinx::Client::SEARCHD_RETRY, 1, 9].pack('n2N')) @sock.should_receive(:recv).with(9).and_return([1].pack('N') + 'hello') lambda { @sphinx.send(:GetResponse, @sock, 1) }.should raise_error(Sphinx::SphinxTemporaryError) @sphinx.GetLastError.should == 'temporary searchd error: hello' end it 'should raise exception when unknown status received' do @sock.should_receive(:recv).with(8).and_return([65535, 1, 9].pack('n2N')) @sock.should_receive(:recv).with(9).and_return([1].pack('N') + 'hello') lambda { @sphinx.send(:GetResponse, @sock, 1) }.should raise_error(Sphinx::SphinxUnknownError) @sphinx.GetLastError.should == 'unknown status code: \'65535\'' end it 'should set warning when server is older than client' do @sock.should_receive(:recv).with(8).and_return([Sphinx::Client::SEARCHD_OK, 1, 9].pack('n2N')) @sock.should_receive(:recv).with(9).and_return([1].pack('N') + 'hello') @sphinx.send(:GetResponse, @sock, 5) @sphinx.GetLastWarning.should == 'searchd command v.0.1 older than client\'s v.0.5, some options might not work' end end describe 'The Query method of Sphinx::Client' do include SphinxFixtureHelper include SphinxApiCall before(:each) do @sphinx = create_sphinx end it 'should generate valid request with default parameters' do expected = sphinx_fixture('default_search') @sock.should_receive(:send).with(expected, 0) @sphinx.Query('query') rescue nil? end it 'should generate valid request with default parameters and index' do expected = sphinx_fixture('default_search_index') @sock.should_receive(:send).with(expected, 0) @sphinx.Query('query', 'index') rescue nil? end it 'should generate valid request with limits' do expected = sphinx_fixture('limits') @sock.should_receive(:send).with(expected, 0) @sphinx.SetLimits(10, 20) @sphinx.Query('query') rescue nil? end it 'should generate valid request with limits and max number to retrieve' do expected = sphinx_fixture('limits_max') @sock.should_receive(:send).with(expected, 0) @sphinx.SetLimits(10, 20, 30) @sphinx.Query('query') rescue nil? end it 'should generate valid request with limits and cutoff to retrieve' do expected = sphinx_fixture('limits_cutoff') @sock.should_receive(:send).with(expected, 0) @sphinx.SetLimits(10, 20, 30, 40) @sphinx.Query('query') rescue nil? end it 'should generate valid request with max query time specified' do expected = sphinx_fixture('max_query_time') @sock.should_receive(:send).with(expected, 0) @sphinx.SetMaxQueryTime(1000) @sphinx.Query('query') rescue nil? end describe 'with match' do [ :all, :any, :phrase, :boolean, :extended, :fullscan, :extended2 ].each do |match| it "should generate valid request for SPH_MATCH_#{match.to_s.upcase}" do expected = sphinx_fixture("match_#{match}") @sock.should_receive(:send).with(expected, 0) @sphinx.SetMatchMode(Sphinx::Client::const_get("SPH_MATCH_#{match.to_s.upcase}")) @sphinx.Query('query') rescue nil? end end end describe 'with rank' do [ :proximity_bm25, :bm25, :none, :wordcount, :proximity ].each do |rank| it "should generate valid request for SPH_RANK_#{rank.to_s.upcase}" do expected = sphinx_fixture("ranking_#{rank}") @sock.should_receive(:send).with(expected, 0) @sphinx.SetRankingMode(Sphinx::Client.const_get("SPH_RANK_#{rank.to_s.upcase}")) @sphinx.Query('query') rescue nil? end end end describe 'with sorting' do [ :attr_desc, :relevance, :attr_asc, :time_segments, :extended, :expr ].each do |mode| it "should generate valid request for SPH_SORT_#{mode.to_s.upcase}" do expected = sphinx_fixture("sort_#{mode}") @sock.should_receive(:send).with(expected, 0) @sphinx.SetSortMode(Sphinx::Client.const_get("SPH_SORT_#{mode.to_s.upcase}"), mode == :relevance ? '' : 'sortby') @sphinx.Query('query') rescue nil? end end end it 'should generate valid request with weights' do expected = sphinx_fixture('weights') @sock.should_receive(:send).with(expected, 0) @sphinx.SetWeights([10, 20, 30, 40]) @sphinx.Query('query') rescue nil? end it 'should generate valid request with field weights' do expected = sphinx_fixture('field_weights') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFieldWeights({'field1' => 10, 'field2' => 20}) @sphinx.Query('query') rescue nil? end it 'should generate valid request with index weights' do expected = sphinx_fixture('index_weights') @sock.should_receive(:send).with(expected, 0) @sphinx.SetIndexWeights({'index1' => 10, 'index2' => 20}) @sphinx.Query('query') rescue nil? end it 'should generate valid request with ID range' do expected = sphinx_fixture('id_range') @sock.should_receive(:send).with(expected, 0) @sphinx.SetIDRange(10, 20) @sphinx.Query('query') rescue nil? end it 'should generate valid request with ID range and 64-bit ints' do expected = sphinx_fixture('id_range64') @sock.should_receive(:send).with(expected, 0) @sphinx.SetIDRange(8589934591, 17179869183) @sphinx.Query('query') rescue nil? end it 'should generate valid request with values filter' do expected = sphinx_fixture('filter') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilter('attr', [10, 20, 30]) @sphinx.Query('query') rescue nil? end it 'should generate valid request with two values filters' do expected = sphinx_fixture('filters') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilter('attr2', [40, 50]) @sphinx.SetFilter('attr1', [10, 20, 30]) @sphinx.Query('query') rescue nil? end it 'should generate valid request with values filter excluded' do expected = sphinx_fixture('filter_exclude') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilter('attr', [10, 20, 30], true) @sphinx.Query('query') rescue nil? end it 'should generate valid request with values filter range' do expected = sphinx_fixture('filter_range') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilterRange('attr', 10, 20) @sphinx.Query('query') rescue nil? end it 'should generate valid request with two filter ranges' do expected = sphinx_fixture('filter_ranges') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilterRange('attr2', 30, 40) @sphinx.SetFilterRange('attr1', 10, 20) @sphinx.Query('query') rescue nil? end it 'should generate valid request with filter range excluded' do expected = sphinx_fixture('filter_range_exclude') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilterRange('attr', 10, 20, true) @sphinx.Query('query') rescue nil? end it 'should generate valid request with signed int64-based filter range' do expected = sphinx_fixture('filter_range_int64') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilterRange('attr1', -10, 20) @sphinx.SetFilterRange('attr2', -1099511627770, 1099511627780) safe_call { @sphinx.Query('query') } end it 'should generate valid request with float filter range' do expected = sphinx_fixture('filter_float_range') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilterFloatRange('attr', 10.5, 20.3) @sphinx.Query('query') rescue nil? end it 'should generate valid request with float filter excluded' do expected = sphinx_fixture('filter_float_range_exclude') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilterFloatRange('attr', 10.5, 20.3, true) @sphinx.Query('query') rescue nil? end it 'should generate valid request with different filters' do expected = sphinx_fixture('filters_different') @sock.should_receive(:send).with(expected, 0) @sphinx.SetFilterRange('attr1', 10, 20, true) @sphinx.SetFilter('attr3', [30, 40, 50]) @sphinx.SetFilterRange('attr1', 60, 70) @sphinx.SetFilter('attr2', [80, 90, 100], true) @sphinx.SetFilterFloatRange('attr1', 60.8, 70.5) @sphinx.Query('query') rescue nil? end it 'should generate valid request with geographical anchor point' do expected = sphinx_fixture('geo_anchor') @sock.should_receive(:send).with(expected, 0) @sphinx.SetGeoAnchor('attrlat', 'attrlong', 20.3, 40.7) @sphinx.Query('query') rescue nil? end describe 'with group by' do [ :day, :week, :month, :year, :attr, :attrpair ].each do |groupby| it "should generate valid request for SPH_GROUPBY_#{groupby.to_s.upcase}" do expected = sphinx_fixture("group_by_#{groupby}") @sock.should_receive(:send).with(expected, 0) @sphinx.SetGroupBy('attr', Sphinx::Client::const_get("SPH_GROUPBY_#{groupby.to_s.upcase}")) @sphinx.Query('query') rescue nil? end end it 'should generate valid request for SPH_GROUPBY_DAY with sort' do expected = sphinx_fixture('group_by_day_sort') @sock.should_receive(:send).with(expected, 0) @sphinx.SetGroupBy('attr', Sphinx::Client::SPH_GROUPBY_DAY, 'somesort') @sphinx.Query('query') rescue nil? end it 'should generate valid request with count-distinct attribute' do expected = sphinx_fixture('group_distinct') @sock.should_receive(:send).with(expected, 0) @sphinx.SetGroupBy('attr', Sphinx::Client::SPH_GROUPBY_DAY) @sphinx.SetGroupDistinct('attr') @sphinx.Query('query') rescue nil? end end it 'should generate valid request with retries count specified' do expected = sphinx_fixture('retries') @sock.should_receive(:send).with(expected, 0) @sphinx.SetRetries(10) @sphinx.Query('query') rescue nil? end it 'should generate valid request with retries count and delay specified' do expected = sphinx_fixture('retries_delay') @sock.should_receive(:send).with(expected, 0) @sphinx.SetRetries(10, 20) @sphinx.Query('query') rescue nil? end it 'should generate valid request for SetOverride' do expected = sphinx_fixture('set_override') @sock.should_receive(:send).with(expected, 0) @sphinx.SetOverride('attr1', Sphinx::Client::SPH_ATTR_INTEGER, { 10 => 20 }) @sphinx.SetOverride('attr2', Sphinx::Client::SPH_ATTR_FLOAT, { 11 => 30.3 }) @sphinx.SetOverride('attr3', Sphinx::Client::SPH_ATTR_BIGINT, { 12 => 1099511627780 }) @sphinx.Query('query') rescue nil? end it 'should generate valid request for SetSelect' do expected = sphinx_fixture('select') @sock.should_receive(:send).with(expected, 0) @sphinx.SetSelect('attr1, attr2') @sphinx.Query('query') rescue nil? end end describe 'The RunQueries method of Sphinx::Client' do include SphinxFixtureHelper before(:each) do @sphinx = Sphinx::Client.new @sock = mock('TCPSocket') @sphinx.stub!(:Connect).and_return(@sock) @sphinx.stub!(:GetResponse).and_raise(Sphinx::SphinxError) end it 'should generate valid request for multiple queries' do expected = sphinx_fixture('miltiple_queries') @sock.should_receive(:send).with(expected, 0) @sphinx.SetRetries(10, 20) @sphinx.AddQuery('test1') @sphinx.SetGroupBy('attr', Sphinx::Client::SPH_GROUPBY_DAY) @sphinx.AddQuery('test2') rescue nil? @sphinx.RunQueries rescue nil? end end describe 'The BuildExcerpts method of Sphinx::Client' do include SphinxFixtureHelper before(:each) do @sphinx = Sphinx::Client.new @sock = mock('TCPSocket') @sphinx.stub!(:Connect).and_return(@sock) @sphinx.stub!(:GetResponse).and_raise(Sphinx::SphinxError) end it 'should generate valid request with default parameters' do expected = sphinx_fixture('excerpt_default') @sock.should_receive(:send).with(expected, 0) @sphinx.BuildExcerpts(['10', '20'], 'index', 'word1 word2') rescue nil? end it 'should generate valid request with custom parameters' do expected = sphinx_fixture('excerpt_custom') @sock.should_receive(:send).with(expected, 0) @sphinx.BuildExcerpts(['10', '20'], 'index', 'word1 word2', { 'before_match' => 'before', 'after_match' => 'after', 'chunk_separator' => 'separator', 'limit' => 10 }) rescue nil? end it 'should generate valid request with flags' do expected = sphinx_fixture('excerpt_flags') @sock.should_receive(:send).with(expected, 0) @sphinx.BuildExcerpts(['10', '20'], 'index', 'word1 word2', { 'exact_phrase' => true, 'single_passage' => true, 'use_boundaries' => true, 'weight_order' => true }) rescue nil? end end describe 'The BuildKeywords method of Sphinx::Client' do include SphinxFixtureHelper include SphinxApiCall before(:each) do @sphinx = create_sphinx end it 'should generate valid request' do expected = sphinx_fixture('keywords') @sock.should_receive(:send).with(expected, 0) safe_call { @sphinx.BuildKeywords('test', 'index', true) } end end describe 'The UpdateAttributes method of Sphinx::Client' do include SphinxFixtureHelper include SphinxApiCall before(:each) do @sphinx = create_sphinx end it 'should generate valid request' do expected = sphinx_fixture('update_attributes') @sock.should_receive(:send).with(expected, 0) safe_call { @sphinx.UpdateAttributes('index', ['group'], { 123 => [456] }) } end it 'should generate valid request for MVA' do expected = sphinx_fixture('update_attributes_mva') @sock.should_receive(:send).with(expected, 0) safe_call { @sphinx.UpdateAttributes('index', ['group', 'category'], { 123 => [ [456, 789], [1, 2, 3] ] }, true) } end end coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/ 40777 0 0 0 11647303447 14713 5coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/default_search.php100777 0 0 125 11643565730 20454 0Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/default_search_index.php100777 0 0 136 11643565730 21645 0Query('query', 'index'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/excerpt_custom.php100777 0 0 671 11643565730 20555 0BuildExcerpts(array('10', '20'), 'index', 'word1 word2', array('before_match' => 'before', 'after_match' => 'after', 'chunk_separator' => 'separator', 'limit' => 10)); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/excerpt_default.php100777 0 0 177 11643565730 20670 0BuildExcerpts(array('10', '20'), 'index', 'word1 word2'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/excerpt_flags.php100777 0 0 666 11643565730 20343 0BuildExcerpts(array('10', '20'), 'index', 'word1 word2', array('exact_phrase' => true, 'single_passage' => true, 'use_boundaries' => true, 'weight_order' => true)); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/field_weights.php100777 0 0 222 11643565730 20316 0SetFieldWeights(array('field1' => 10, 'field2' => 20)); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter.php100777 0 0 200 11643565730 16762 0SetFilter('attr', array(10, 20, 30)); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filters.php100777 0 0 251 11643565730 17153 0SetFilter('attr2', array(40, 50)); $cl->SetFilter('attr1', array(10, 20, 30)); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filters_different.php100777 0 0 465 11643565730 21210 0SetFilterRange('attr1', 10, 20, true); $cl->SetFilter('attr3', array(30, 40, 50)); $cl->SetFilterRange('attr1', 60, 70); $cl->SetFilter('attr2', array(80, 90, 100), true); $cl->SetFilterFloatRange('attr1', 60.8, 70.5); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter_exclude.php100777 0 0 206 11643565730 20501 0SetFilter('attr', array(10, 20, 30), true); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter_float_range.php100777 0 0 203 11643565730 21326 0SetFilterFloatRange('attr', 10.5, 20.3); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter_float_range_exclude.php100777 0 0 211 11643565730 23036 0SetFilterFloatRange('attr', 10.5, 20.3, true); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter_range.php100777 0 0 172 11643565730 20146 0SetFilterRange('attr', 10, 20); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter_ranges.php100777 0 0 241 11643565730 20326 0SetFilterRange('attr2', 30, 40); $cl->SetFilterRange('attr1', 10, 20); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter_range_exclude.php100777 0 0 200 11643565730 21647 0SetFilterRange('attr', 10, 20, true); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/filter_range_int64.php100777 0 0 272 11643565730 21173 0SetFilterRange('attr1', -10, 20); $cl->SetFilterRange('attr2', -1099511627770, 1099511627780); $cl->Query('query'); ?> coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/geo_anchor.php100777 0 0 213 11643565730 17605 0SetGeoAnchor('attrlat', 'attrlong', 20.3, 40.7); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_by_attr.php100777 0 0 200 11643565730 20355 0SetGroupBy('attr', SPH_GROUPBY_ATTR); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_by_attrpair.php100777 0 0 204 11643565730 21235 0SetGroupBy('attr', SPH_GROUPBY_ATTRPAIR); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_by_day.php100777 0 0 177 11643565730 20175 0SetGroupBy('attr', SPH_GROUPBY_DAY); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_by_day_sort.php100777 0 0 213 11643565730 21233 0SetGroupBy('attr', SPH_GROUPBY_DAY, 'somesort'); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_by_month.php100777 0 0 201 11643565730 20531 0SetGroupBy('attr', SPH_GROUPBY_MONTH); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_by_week.php100777 0 0 200 11643565730 20336 0SetGroupBy('attr', SPH_GROUPBY_WEEK); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_by_year.php100777 0 0 200 11643565730 20343 0SetGroupBy('attr', SPH_GROUPBY_YEAR); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/group_distinct.php100777 0 0 236 11643565730 20543 0SetGroupBy('attr', SPH_GROUPBY_DAY); $cl->SetGroupDistinct('attr'); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/id_range.php100777 0 0 156 11643565730 17257 0SetIDRange(10, 20); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/id_range64.php100777 0 0 177 11643565730 17434 0SetIDRange(8589934591, 17179869183); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/index_weights.php100777 0 0 222 11643565730 20342 0SetIndexWeights(array('index1' => 10, 'index2' => 20)); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/keywords.php100777 0 0 153 11643565730 17353 0BuildKeywords('test', 'index', true); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/limits.php100777 0 0 155 11643565730 17007 0SetLimits(10, 20); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/limits_cutoff.php100777 0 0 165 11643565730 20356 0SetLimits(10, 20, 30, 40); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/limits_max.php100777 0 0 161 11643565730 17651 0SetLimits(10, 20, 30); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/limits_max_cutoff.php100777 0 0 165 11643565730 21223 0SetLimits(10, 20, 30, 40); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/match_all.php100777 0 0 167 11643565730 17435 0SetMatchMode(SPH_MATCH_ALL); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/match_any.php100777 0 0 167 11643565730 17454 0SetMatchMode(SPH_MATCH_ANY); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/match_boolean.php100777 0 0 173 11643565730 20301 0SetMatchMode(SPH_MATCH_BOOLEAN); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/match_extended.php100777 0 0 174 11643565730 20463 0SetMatchMode(SPH_MATCH_EXTENDED); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/match_extended2.php100777 0 0 175 11643565730 20546 0SetMatchMode(SPH_MATCH_EXTENDED2); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/match_fullscan.php100777 0 0 174 11643565730 20472 0SetMatchMode(SPH_MATCH_FULLSCAN); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/match_phrase.php100777 0 0 172 11643565730 20143 0SetMatchMode(SPH_MATCH_PHRASE); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/max_query_time.php100777 0 0 161 11643565730 20533 0SetMaxQueryTime(1000); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/miltiple_queries.php100777 0 0 306 11643565730 21060 0SetRetries(10, 20); $cl->AddQuery('test1'); $cl->SetGroupBy('attr', SPH_GROUPBY_DAY); $cl->AddQuery('test2'); $cl->RunQueries(); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/ranking_bm25.php100777 0 0 171 11643565730 17762 0SetRankingMode(SPH_RANK_BM25); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/ranking_none.php100777 0 0 171 11643565730 20154 0SetRankingMode(SPH_RANK_NONE); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/ranking_proximity.php100777 0 0 177 11643565730 21267 0SetRankingMode(SPH_RANK_PROXIMITY); $cl->Query('query'); ?> coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/ranking_proximity_bm25.php100777 0 0 203 11643565730 22102 0SetRankingMode(SPH_RANK_PROXIMITY_BM25); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/ranking_wordcount.php100777 0 0 176 11643565730 21246 0SetRankingMode(SPH_RANK_WORDCOUNT); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/retries.php100777 0 0 152 11643565730 17160 0SetRetries(10); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/retries_delay.php100777 0 0 156 11643565730 20342 0SetRetries(10, 20); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/select.php100777 0 0 166 11643565730 16767 0SetSelect('attr1, attr2'); $cl->Query('query'); ?> coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/set_override.php100777 0 0 432 11643565730 20176 0SetOverride('attr1', SPH_ATTR_INTEGER, array(10 => 20)); $cl->SetOverride('attr2', SPH_ATTR_FLOAT, array(11 => 30.3)); $cl->SetOverride('attr3', SPH_ATTR_BIGINT, array(12 => 1099511627780)); $cl->Query('query'); ?> coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/sort_attr_asc.php100777 0 0 204 11643565730 20350 0SetSortMode(SPH_SORT_ATTR_ASC, 'sortby'); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/sort_attr_desc.php100777 0 0 205 11643565730 20521 0SetSortMode(SPH_SORT_ATTR_DESC, 'sortby'); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/sort_expr.php100777 0 0 200 11643565730 17522 0SetSortMode(SPH_SORT_EXPR, 'sortby'); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/sort_extended.php100777 0 0 204 11643565730 20350 0SetSortMode(SPH_SORT_EXTENDED, 'sortby'); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/sort_relevance.php100777 0 0 173 11643565730 20521 0SetSortMode(SPH_SORT_RELEVANCE); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/sort_time_segments.php100777 0 0 211 11643565730 21411 0SetSortMode(SPH_SORT_TIME_SEGMENTS, 'sortby'); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/sphinxapi.php100777 0 0 106534 11643565730 17601 0=8 ) { $i = (int)$v; return pack ( "NN", $i>>32, $i&((1<<32)-1) ); } // x32 route, bcmath $x = "4294967296"; if ( function_exists("bcmul") ) { $h = bcdiv ( $v, $x, 0 ); $l = bcmod ( $v, $x ); if ( $v<0 ) { $h = -1+(float)$h; $l = $l+(float)$x; } return pack ( "NN", (float)$h, (float)$l ); // conversion to float is intentional; int would lose 31st bit } // x32 route, 15 or less decimal digits // we can use float, because its actually double and has 52 precision bits if ( strlen($v)<=15 ) { $f = (float)$v; $h = (int)($f/$x); $l = $f-$x*(float)$h; if ( $v<0 ) { $h = -1+(float)$h; $l = $l+(float)$x; } return pack ( "NN", $h, $l ); } // x32 route, 16 or more decimal digits // well, let me know if you *really* need this die ( "INTERNAL ERROR: packing more than 15-digit numeric on 32-bit PHP is not implemented yet (contact support)" ); } /// portably unpack 64 signed bits, network order to numeric function sphUnpack64 ( $v ) { list($h,$l) = array_values ( unpack ( "N*N*", $v ) ); // x64 route if ( PHP_INT_SIZE>=8 ) { if ( $h<0 ) $h += (1<<32); // because php 5.2.2 to 5.2.5 is totally fucked up again if ( $l<0 ) $l += (1<<32); return ($h<<32) + $l; } // x32 route $x = "4294967296"; $y = 0; $p = ""; if ( $h<0 ) { $h = ~$h; $l = ~$l; $y = 1; $p = "-"; } $h = sprintf ( "%u", $h ); $l = sprintf ( "%u", $l ); // bcmath if ( function_exists("bcmul") ) return $p . bcadd ( bcadd ( $l, bcmul ( $x, $h ) ), $y ); // no bcmath, 15 or less decimal digits // we can use float, because its actually double and has 52 precision bits if ( $h<1048576 ) { $f = ((float)$h)*$x + (float)$l + (float)$y; return $p . sprintf ( "%.0f", $f ); // builtin conversion is only about 39-40 bits precise! } // x32 route, 16 or more decimal digits // well, let me know if you *really* need this die ( "INTERNAL ERROR: unpacking more than 15-digit numeric on 32-bit PHP is not implemented yet (contact support)" ); } /// sphinx searchd client class class SphinxClient { var $_host; ///< searchd host (default is "localhost") var $_port; ///< searchd port (default is 9312) var $_offset; ///< how many records to seek from result-set start (default is 0) var $_limit; ///< how many records to return from result-set starting at offset (default is 20) var $_mode; ///< query matching mode (default is SPH_MATCH_ALL) var $_weights; ///< per-field weights (default is 1 for all fields) var $_sort; ///< match sorting mode (default is SPH_SORT_RELEVANCE) var $_sortby; ///< attribute to sort by (defualt is "") var $_min_id; ///< min ID to match (default is 0, which means no limit) var $_max_id; ///< max ID to match (default is 0, which means no limit) var $_filters; ///< search filters var $_groupby; ///< group-by attribute name var $_groupfunc; ///< group-by function (to pre-process group-by attribute value with) var $_groupsort; ///< group-by sorting clause (to sort groups in result set with) var $_groupdistinct;///< group-by count-distinct attribute var $_maxmatches; ///< max matches to retrieve var $_cutoff; ///< cutoff to stop searching at (default is 0) var $_retrycount; ///< distributed retries count var $_retrydelay; ///< distributed retries delay var $_anchor; ///< geographical anchor point var $_indexweights; ///< per-index weights var $_ranker; ///< ranking mode (default is SPH_RANK_PROXIMITY_BM25) var $_maxquerytime; ///< max query time, milliseconds (default is 0, do not limit) var $_fieldweights; ///< per-field-name weights var $_overrides; ///< per-query attribute values overrides var $_select; ///< select-list (attributes or expressions, with optional aliases) var $_error; ///< last error message var $_warning; ///< last warning message var $_reqs; ///< requests array for multi-query var $_mbenc; ///< stored mbstring encoding var $_arrayresult; ///< whether $result["matches"] should be a hash or an array ///////////////////////////////////////////////////////////////////////////// // common stuff ///////////////////////////////////////////////////////////////////////////// /// create a new client object and fill defaults function SphinxClient () { // per-client-object settings $this->_host = "localhost"; $this->_port = 9312; // per-query settings $this->_offset = 0; $this->_limit = 20; $this->_mode = SPH_MATCH_ALL; $this->_weights = array (); $this->_sort = SPH_SORT_RELEVANCE; $this->_sortby = ""; $this->_min_id = 0; $this->_max_id = 0; $this->_filters = array (); $this->_groupby = ""; $this->_groupfunc = SPH_GROUPBY_DAY; $this->_groupsort = "@group desc"; $this->_groupdistinct= ""; $this->_maxmatches = 1000; $this->_cutoff = 0; $this->_retrycount = 0; $this->_retrydelay = 0; $this->_anchor = array (); $this->_indexweights= array (); $this->_ranker = SPH_RANK_PROXIMITY_BM25; $this->_maxquerytime= 0; $this->_fieldweights= array(); $this->_overrides = array(); $this->_select = "*"; $this->_error = ""; // per-reply fields (for single-query case) $this->_warning = ""; $this->_reqs = array (); // requests storage (for multi-query case) $this->_mbenc = ""; $this->_arrayresult = false; } /// get last error message (string) function GetLastError () { return $this->_error; } /// get last warning message (string) function GetLastWarning () { return $this->_warning; } /// set searchd host name (string) and port (integer) function SetServer ( $host, $port ) { assert ( is_string($host) ); assert ( is_int($port) ); $this->_host = $host; $this->_port = $port; } ///////////////////////////////////////////////////////////////////////////// /// enter mbstring workaround mode function _MBPush () { $this->_mbenc = ""; if ( ini_get ( "mbstring.func_overload" ) & 2 ) { $this->_mbenc = mb_internal_encoding(); mb_internal_encoding ( "latin1" ); } } /// leave mbstring workaround mode function _MBPop () { if ( $this->_mbenc ) mb_internal_encoding ( $this->_mbenc ); } /// connect to searchd server function _Connect () { return fopen('php://stdout', 'w'); } function _OldConnect() { if (!( $fp = @fsockopen ( $this->_host, $this->_port ) ) ) { $this->_error = "connection to {$this->_host}:{$this->_port} failed"; return false; } // check version list(,$v) = unpack ( "N*", fread ( $fp, 4 ) ); $v = (int)$v; if ( $v<1 ) { fclose ( $fp ); $this->_error = "expected searchd protocol version 1+, got version '$v'"; return false; } // all ok, send my version fwrite ( $fp, pack ( "N", 1 ) ); return $fp; } /// get and check response packet from searchd server function _GetResponse ( $fp, $client_ver ) { return false; } function _OldGetResponse ( $fp, $client_ver ) { $response = ""; $len = 0; $header = fread ( $fp, 8 ); if ( strlen($header)==8 ) { list ( $status, $ver, $len ) = array_values ( unpack ( "n2a/Nb", $header ) ); $left = $len; while ( $left>0 && !feof($fp) ) { $chunk = fread ( $fp, $left ); if ( $chunk ) { $response .= $chunk; $left -= strlen($chunk); } } } fclose ( $fp ); // check response $read = strlen ( $response ); if ( !$response || $read!=$len ) { $this->_error = $len ? "failed to read searchd response (status=$status, ver=$ver, len=$len, read=$read)" : "received zero-sized searchd response"; return false; } // check status if ( $status==SEARCHD_WARNING ) { list(,$wlen) = unpack ( "N*", substr ( $response, 0, 4 ) ); $this->_warning = substr ( $response, 4, $wlen ); return substr ( $response, 4+$wlen ); } if ( $status==SEARCHD_ERROR ) { $this->_error = "searchd error: " . substr ( $response, 4 ); return false; } if ( $status==SEARCHD_RETRY ) { $this->_error = "temporary searchd error: " . substr ( $response, 4 ); return false; } if ( $status!=SEARCHD_OK ) { $this->_error = "unknown status code '$status'"; return false; } // check version if ( $ver<$client_ver ) { $this->_warning = sprintf ( "searchd command v.%d.%d older than client's v.%d.%d, some options might not work", $ver>>8, $ver&0xff, $client_ver>>8, $client_ver&0xff ); } return $response; } ///////////////////////////////////////////////////////////////////////////// // searching ///////////////////////////////////////////////////////////////////////////// /// set offset and count into result set, /// and optionally set max-matches and cutoff limits function SetLimits ( $offset, $limit, $max=0, $cutoff=0 ) { assert ( is_int($offset) ); assert ( is_int($limit) ); assert ( $offset>=0 ); assert ( $limit>0 ); assert ( $max>=0 ); $this->_offset = $offset; $this->_limit = $limit; if ( $max>0 ) $this->_maxmatches = $max; if ( $cutoff>0 ) $this->_cutoff = $cutoff; } /// set maximum query time, in milliseconds, per-index /// integer, 0 means "do not limit" function SetMaxQueryTime ( $max ) { assert ( is_int($max) ); assert ( $max>=0 ); $this->_maxquerytime = $max; } /// set matching mode function SetMatchMode ( $mode ) { assert ( $mode==SPH_MATCH_ALL || $mode==SPH_MATCH_ANY || $mode==SPH_MATCH_PHRASE || $mode==SPH_MATCH_BOOLEAN || $mode==SPH_MATCH_EXTENDED || $mode==SPH_MATCH_FULLSCAN || $mode==SPH_MATCH_EXTENDED2 ); $this->_mode = $mode; } /// set ranking mode function SetRankingMode ( $ranker ) { assert ( $ranker==SPH_RANK_PROXIMITY_BM25 || $ranker==SPH_RANK_BM25 || $ranker==SPH_RANK_NONE || $ranker==SPH_RANK_WORDCOUNT || $ranker==SPH_RANK_PROXIMITY ); $this->_ranker = $ranker; } /// set matches sorting mode function SetSortMode ( $mode, $sortby="" ) { assert ( $mode==SPH_SORT_RELEVANCE || $mode==SPH_SORT_ATTR_DESC || $mode==SPH_SORT_ATTR_ASC || $mode==SPH_SORT_TIME_SEGMENTS || $mode==SPH_SORT_EXTENDED || $mode==SPH_SORT_EXPR ); assert ( is_string($sortby) ); assert ( $mode==SPH_SORT_RELEVANCE || strlen($sortby)>0 ); $this->_sort = $mode; $this->_sortby = $sortby; } /// bind per-field weights by order /// DEPRECATED; use SetFieldWeights() instead function SetWeights ( $weights ) { assert ( is_array($weights) ); foreach ( $weights as $weight ) assert ( is_int($weight) ); $this->_weights = $weights; } /// bind per-field weights by name function SetFieldWeights ( $weights ) { assert ( is_array($weights) ); foreach ( $weights as $name=>$weight ) { assert ( is_string($name) ); assert ( is_int($weight) ); } $this->_fieldweights = $weights; } /// bind per-index weights by name function SetIndexWeights ( $weights ) { assert ( is_array($weights) ); foreach ( $weights as $index=>$weight ) { assert ( is_string($index) ); assert ( is_int($weight) ); } $this->_indexweights = $weights; } /// set IDs range to match /// only match records if document ID is beetwen $min and $max (inclusive) function SetIDRange ( $min, $max ) { assert ( is_numeric($min) ); assert ( is_numeric($max) ); assert ( $min<=$max ); $this->_min_id = $min; $this->_max_id = $max; } /// set values set filter /// only match records where $attribute value is in given set function SetFilter ( $attribute, $values, $exclude=false ) { assert ( is_string($attribute) ); assert ( is_array($values) ); assert ( count($values) ); if ( is_array($values) && count($values) ) { foreach ( $values as $value ) assert ( is_numeric($value) ); $this->_filters[] = array ( "type"=>SPH_FILTER_VALUES, "attr"=>$attribute, "exclude"=>$exclude, "values"=>$values ); } } /// set range filter /// only match records if $attribute value is beetwen $min and $max (inclusive) function SetFilterRange ( $attribute, $min, $max, $exclude=false ) { assert ( is_string($attribute) ); assert ( is_numeric($min) ); assert ( is_numeric($max) ); assert ( $min<=$max ); $this->_filters[] = array ( "type"=>SPH_FILTER_RANGE, "attr"=>$attribute, "exclude"=>$exclude, "min"=>$min, "max"=>$max ); } /// set float range filter /// only match records if $attribute value is beetwen $min and $max (inclusive) function SetFilterFloatRange ( $attribute, $min, $max, $exclude=false ) { assert ( is_string($attribute) ); assert ( is_float($min) ); assert ( is_float($max) ); assert ( $min<=$max ); $this->_filters[] = array ( "type"=>SPH_FILTER_FLOATRANGE, "attr"=>$attribute, "exclude"=>$exclude, "min"=>$min, "max"=>$max ); } /// setup anchor point for geosphere distance calculations /// required to use @geodist in filters and sorting /// latitude and longitude must be in radians function SetGeoAnchor ( $attrlat, $attrlong, $lat, $long ) { assert ( is_string($attrlat) ); assert ( is_string($attrlong) ); assert ( is_float($lat) ); assert ( is_float($long) ); $this->_anchor = array ( "attrlat"=>$attrlat, "attrlong"=>$attrlong, "lat"=>$lat, "long"=>$long ); } /// set grouping attribute and function function SetGroupBy ( $attribute, $func, $groupsort="@group desc" ) { assert ( is_string($attribute) ); assert ( is_string($groupsort) ); assert ( $func==SPH_GROUPBY_DAY || $func==SPH_GROUPBY_WEEK || $func==SPH_GROUPBY_MONTH || $func==SPH_GROUPBY_YEAR || $func==SPH_GROUPBY_ATTR || $func==SPH_GROUPBY_ATTRPAIR ); $this->_groupby = $attribute; $this->_groupfunc = $func; $this->_groupsort = $groupsort; } /// set count-distinct attribute for group-by queries function SetGroupDistinct ( $attribute ) { assert ( is_string($attribute) ); $this->_groupdistinct = $attribute; } /// set distributed retries count and delay function SetRetries ( $count, $delay=0 ) { assert ( is_int($count) && $count>=0 ); assert ( is_int($delay) && $delay>=0 ); $this->_retrycount = $count; $this->_retrydelay = $delay; } /// set result set format (hash or array; hash by default) /// PHP specific; needed for group-by-MVA result sets that may contain duplicate IDs function SetArrayResult ( $arrayresult ) { assert ( is_bool($arrayresult) ); $this->_arrayresult = $arrayresult; } /// set attribute values override /// there can be only one override per attribute /// $values must be a hash that maps document IDs to attribute values function SetOverride ( $attrname, $attrtype, $values ) { assert ( is_string ( $attrname ) ); assert ( in_array ( $attrtype, array ( SPH_ATTR_INTEGER, SPH_ATTR_TIMESTAMP, SPH_ATTR_BOOL, SPH_ATTR_FLOAT, SPH_ATTR_BIGINT ) ) ); assert ( is_array ( $values ) ); $this->_overrides[$attrname] = array ( "attr"=>$attrname, "type"=>$attrtype, "values"=>$values ); } /// set select-list (attributes or expressions), SQL-like syntax function SetSelect ( $select ) { assert ( is_string ( $select ) ); $this->_select = $select; } ////////////////////////////////////////////////////////////////////////////// /// clear all filters (for multi-queries) function ResetFilters () { $this->_filters = array(); $this->_anchor = array(); } /// clear groupby settings (for multi-queries) function ResetGroupBy () { $this->_groupby = ""; $this->_groupfunc = SPH_GROUPBY_DAY; $this->_groupsort = "@group desc"; $this->_groupdistinct= ""; } /// clear all attribute value overrides (for multi-queries) function ResetOverrides () { $this->_overrides = array (); } ////////////////////////////////////////////////////////////////////////////// /// connect to searchd server, run given search query through given indexes, /// and return the search results function Query ( $query, $index="*", $comment="" ) { assert ( empty($this->_reqs) ); $this->AddQuery ( $query, $index, $comment ); $results = $this->RunQueries (); if ( !is_array($results) ) return false; // probably network error; error message should be already filled $this->_error = $results[0]["error"]; $this->_warning = $results[0]["warning"]; if ( $results[0]["status"]==SEARCHD_ERROR ) return false; else return $results[0]; } /// helper to pack floats in network byte order function _PackFloat ( $f ) { $t1 = pack ( "f", $f ); // machine order list(,$t2) = unpack ( "L*", $t1 ); // int in machine order return pack ( "N", $t2 ); } /// add query to multi-query batch /// returns index into results array from RunQueries() call function AddQuery ( $query, $index="*", $comment="" ) { // mbstring workaround $this->_MBPush (); // build request $req = pack ( "NNNNN", $this->_offset, $this->_limit, $this->_mode, $this->_ranker, $this->_sort ); // mode and limits $req .= pack ( "N", strlen($this->_sortby) ) . $this->_sortby; $req .= pack ( "N", strlen($query) ) . $query; // query itself $req .= pack ( "N", count($this->_weights) ); // weights foreach ( $this->_weights as $weight ) $req .= pack ( "N", (int)$weight ); $req .= pack ( "N", strlen($index) ) . $index; // indexes $req .= pack ( "N", 1 ); // id64 range marker $req .= sphPack64 ( $this->_min_id ) . sphPack64 ( $this->_max_id ); // id64 range // filters $req .= pack ( "N", count($this->_filters) ); foreach ( $this->_filters as $filter ) { $req .= pack ( "N", strlen($filter["attr"]) ) . $filter["attr"]; $req .= pack ( "N", $filter["type"] ); switch ( $filter["type"] ) { case SPH_FILTER_VALUES: $req .= pack ( "N", count($filter["values"]) ); foreach ( $filter["values"] as $value ) $req .= sphPack64 ( $value ); break; case SPH_FILTER_RANGE: $req .= sphPack64 ( $filter["min"] ) . sphPack64 ( $filter["max"] ); break; case SPH_FILTER_FLOATRANGE: $req .= $this->_PackFloat ( $filter["min"] ) . $this->_PackFloat ( $filter["max"] ); break; default: assert ( 0 && "internal error: unhandled filter type" ); } $req .= pack ( "N", $filter["exclude"] ); } // group-by clause, max-matches count, group-sort clause, cutoff count $req .= pack ( "NN", $this->_groupfunc, strlen($this->_groupby) ) . $this->_groupby; $req .= pack ( "N", $this->_maxmatches ); $req .= pack ( "N", strlen($this->_groupsort) ) . $this->_groupsort; $req .= pack ( "NNN", $this->_cutoff, $this->_retrycount, $this->_retrydelay ); $req .= pack ( "N", strlen($this->_groupdistinct) ) . $this->_groupdistinct; // anchor point if ( empty($this->_anchor) ) { $req .= pack ( "N", 0 ); } else { $a =& $this->_anchor; $req .= pack ( "N", 1 ); $req .= pack ( "N", strlen($a["attrlat"]) ) . $a["attrlat"]; $req .= pack ( "N", strlen($a["attrlong"]) ) . $a["attrlong"]; $req .= $this->_PackFloat ( $a["lat"] ) . $this->_PackFloat ( $a["long"] ); } // per-index weights $req .= pack ( "N", count($this->_indexweights) ); foreach ( $this->_indexweights as $idx=>$weight ) $req .= pack ( "N", strlen($idx) ) . $idx . pack ( "N", $weight ); // max query time $req .= pack ( "N", $this->_maxquerytime ); // per-field weights $req .= pack ( "N", count($this->_fieldweights) ); foreach ( $this->_fieldweights as $field=>$weight ) $req .= pack ( "N", strlen($field) ) . $field . pack ( "N", $weight ); // comment $req .= pack ( "N", strlen($comment) ) . $comment; // attribute overrides $req .= pack ( "N", count($this->_overrides) ); foreach ( $this->_overrides as $key => $entry ) { $req .= pack ( "N", strlen($entry["attr"]) ) . $entry["attr"]; $req .= pack ( "NN", $entry["type"], count($entry["values"]) ); foreach ( $entry["values"] as $id=>$val ) { assert ( is_numeric($id) ); assert ( is_numeric($val) ); $req .= sphPack64 ( $id ); switch ( $entry["type"] ) { case SPH_ATTR_FLOAT: $req .= $this->_PackFloat ( $val ); break; case SPH_ATTR_BIGINT: $req .= sphPack64 ( $val ); break; default: $req .= pack ( "N", $val ); break; } } } // select-list $req .= pack ( "N", strlen($this->_select) ) . $this->_select; // mbstring workaround $this->_MBPop (); // store request to requests array $this->_reqs[] = $req; return count($this->_reqs)-1; } /// connect to searchd, run queries batch, and return an array of result sets function RunQueries () { if ( empty($this->_reqs) ) { $this->_error = "no queries defined, issue AddQuery() first"; return false; } // mbstring workaround $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop (); return false; } //////////////////////////// // send query, get response //////////////////////////// $nreqs = count($this->_reqs); $req = join ( "", $this->_reqs ); $len = 4+strlen($req); $req = pack ( "nnNN", SEARCHD_COMMAND_SEARCH, VER_COMMAND_SEARCH, $len, $nreqs ) . $req; // add header fwrite ( $fp, $req, $len+8 ); if (!( $response = $this->_GetResponse ( $fp, VER_COMMAND_SEARCH ) )) { $this->_MBPop (); return false; } $this->_reqs = array (); ////////////////// // parse response ////////////////// $p = 0; // current position $max = strlen($response); // max position for checks, to protect against broken responses $results = array (); for ( $ires=0; $ires<$nreqs && $p<$max; $ires++ ) { $results[] = array(); $result =& $results[$ires]; $result["error"] = ""; $result["warning"] = ""; // extract status list(,$status) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $result["status"] = $status; if ( $status!=SEARCHD_OK ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $message = substr ( $response, $p, $len ); $p += $len; if ( $status==SEARCHD_WARNING ) { $result["warning"] = $message; } else { $result["error"] = $message; continue; } } // read schema $fields = array (); $attrs = array (); list(,$nfields) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; while ( $nfields-->0 && $p<$max ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $fields[] = substr ( $response, $p, $len ); $p += $len; } $result["fields"] = $fields; list(,$nattrs) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; while ( $nattrs-->0 && $p<$max ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $attr = substr ( $response, $p, $len ); $p += $len; list(,$type) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $attrs[$attr] = $type; } $result["attrs"] = $attrs; // read match count list(,$count) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; list(,$id64) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; // read matches $idx = -1; while ( $count-->0 && $p<$max ) { // index into result array $idx++; // parse document id and weight if ( $id64 ) { $doc = sphUnpack64 ( substr ( $response, $p, 8 ) ); $p += 8; list(,$weight) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; } else { list ( $doc, $weight ) = array_values ( unpack ( "N*N*", substr ( $response, $p, 8 ) ) ); $p += 8; if ( PHP_INT_SIZE>=8 ) { // x64 route, workaround broken unpack() in 5.2.2+ if ( $doc<0 ) $doc += (1<<32); } else { // x32 route, workaround php signed/unsigned braindamage $doc = sprintf ( "%u", $doc ); } } $weight = sprintf ( "%u", $weight ); // create match entry if ( $this->_arrayresult ) $result["matches"][$idx] = array ( "id"=>$doc, "weight"=>$weight ); else $result["matches"][$doc]["weight"] = $weight; // parse and create attributes $attrvals = array (); foreach ( $attrs as $attr=>$type ) { // handle 64bit ints if ( $type==SPH_ATTR_BIGINT ) { $attrvals[$attr] = sphUnpack64 ( substr ( $response, $p, 8 ) ); $p += 8; continue; } // handle floats if ( $type==SPH_ATTR_FLOAT ) { list(,$uval) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; list(,$fval) = unpack ( "f*", pack ( "L", $uval ) ); $attrvals[$attr] = $fval; continue; } // handle everything else as unsigned ints list(,$val) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; if ( $type & SPH_ATTR_MULTI ) { $attrvals[$attr] = array (); $nvalues = $val; while ( $nvalues-->0 && $p<$max ) { list(,$val) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $attrvals[$attr][] = sprintf ( "%u", $val ); } } else { $attrvals[$attr] = sprintf ( "%u", $val ); } } if ( $this->_arrayresult ) $result["matches"][$idx]["attrs"] = $attrvals; else $result["matches"][$doc]["attrs"] = $attrvals; } list ( $total, $total_found, $msecs, $words ) = array_values ( unpack ( "N*N*N*N*", substr ( $response, $p, 16 ) ) ); $result["total"] = sprintf ( "%u", $total ); $result["total_found"] = sprintf ( "%u", $total_found ); $result["time"] = sprintf ( "%.3f", $msecs/1000 ); $p += 16; while ( $words-->0 && $p<$max ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $word = substr ( $response, $p, $len ); $p += $len; list ( $docs, $hits ) = array_values ( unpack ( "N*N*", substr ( $response, $p, 8 ) ) ); $p += 8; $result["words"][$word] = array ( "docs"=>sprintf ( "%u", $docs ), "hits"=>sprintf ( "%u", $hits ) ); } } $this->_MBPop (); return $results; } ///////////////////////////////////////////////////////////////////////////// // excerpts generation ///////////////////////////////////////////////////////////////////////////// /// connect to searchd server, and generate exceprts (snippets) /// of given documents for given query. returns false on failure, /// an array of snippets on success function BuildExcerpts ( $docs, $index, $words, $opts=array() ) { assert ( is_array($docs) ); assert ( is_string($index) ); assert ( is_string($words) ); assert ( is_array($opts) ); $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop(); return false; } ///////////////// // fixup options ///////////////// if ( !isset($opts["before_match"]) ) $opts["before_match"] = ""; if ( !isset($opts["after_match"]) ) $opts["after_match"] = ""; if ( !isset($opts["chunk_separator"]) ) $opts["chunk_separator"] = " ... "; if ( !isset($opts["limit"]) ) $opts["limit"] = 256; if ( !isset($opts["around"]) ) $opts["around"] = 5; if ( !isset($opts["exact_phrase"]) ) $opts["exact_phrase"] = false; if ( !isset($opts["single_passage"]) ) $opts["single_passage"] = false; if ( !isset($opts["use_boundaries"]) ) $opts["use_boundaries"] = false; if ( !isset($opts["weight_order"]) ) $opts["weight_order"] = false; ///////////////// // build request ///////////////// // v.1.0 req $flags = 1; // remove spaces if ( $opts["exact_phrase"] ) $flags |= 2; if ( $opts["single_passage"] ) $flags |= 4; if ( $opts["use_boundaries"] ) $flags |= 8; if ( $opts["weight_order"] ) $flags |= 16; $req = pack ( "NN", 0, $flags ); // mode=0, flags=$flags $req .= pack ( "N", strlen($index) ) . $index; // req index $req .= pack ( "N", strlen($words) ) . $words; // req words // options $req .= pack ( "N", strlen($opts["before_match"]) ) . $opts["before_match"]; $req .= pack ( "N", strlen($opts["after_match"]) ) . $opts["after_match"]; $req .= pack ( "N", strlen($opts["chunk_separator"]) ) . $opts["chunk_separator"]; $req .= pack ( "N", (int)$opts["limit"] ); $req .= pack ( "N", (int)$opts["around"] ); // documents $req .= pack ( "N", count($docs) ); foreach ( $docs as $doc ) { assert ( is_string($doc) ); $req .= pack ( "N", strlen($doc) ) . $doc; } //////////////////////////// // send query, get response //////////////////////////// $len = strlen($req); $req = pack ( "nnN", SEARCHD_COMMAND_EXCERPT, VER_COMMAND_EXCERPT, $len ) . $req; // add header $wrote = fwrite ( $fp, $req, $len+8 ); if (!( $response = $this->_GetResponse ( $fp, VER_COMMAND_EXCERPT ) )) { $this->_MBPop (); return false; } ////////////////// // parse response ////////////////// $pos = 0; $res = array (); $rlen = strlen($response); for ( $i=0; $i $rlen ) { $this->_error = "incomplete reply"; $this->_MBPop (); return false; } $res[] = $len ? substr ( $response, $pos, $len ) : ""; $pos += $len; } $this->_MBPop (); return $res; } ///////////////////////////////////////////////////////////////////////////// // keyword generation ///////////////////////////////////////////////////////////////////////////// /// connect to searchd server, and generate keyword list for a given query /// returns false on failure, /// an array of words on success function BuildKeywords ( $query, $index, $hits ) { assert ( is_string($query) ); assert ( is_string($index) ); assert ( is_bool($hits) ); $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop(); return false; } ///////////////// // build request ///////////////// // v.1.0 req $req = pack ( "N", strlen($query) ) . $query; // req query $req .= pack ( "N", strlen($index) ) . $index; // req index $req .= pack ( "N", (int)$hits ); //////////////////////////// // send query, get response //////////////////////////// $len = strlen($req); $req = pack ( "nnN", SEARCHD_COMMAND_KEYWORDS, VER_COMMAND_KEYWORDS, $len ) . $req; // add header $wrote = fwrite ( $fp, $req, $len+8 ); if (!( $response = $this->_GetResponse ( $fp, VER_COMMAND_KEYWORDS ) )) { $this->_MBPop (); return false; } ////////////////// // parse response ////////////////// $pos = 0; $res = array (); $rlen = strlen($response); list(,$nwords) = unpack ( "N*", substr ( $response, $pos, 4 ) ); $pos += 4; for ( $i=0; $i<$nwords; $i++ ) { list(,$len) = unpack ( "N*", substr ( $response, $pos, 4 ) ); $pos += 4; $tokenized = $len ? substr ( $response, $pos, $len ) : ""; $pos += $len; list(,$len) = unpack ( "N*", substr ( $response, $pos, 4 ) ); $pos += 4; $normalized = $len ? substr ( $response, $pos, $len ) : ""; $pos += $len; $res[] = array ( "tokenized"=>$tokenized, "normalized"=>$normalized ); if ( $hits ) { list($ndocs,$nhits) = array_values ( unpack ( "N*N*", substr ( $response, $pos, 8 ) ) ); $pos += 8; $res [$i]["docs"] = $ndocs; $res [$i]["hits"] = $nhits; } if ( $pos > $rlen ) { $this->_error = "incomplete reply"; $this->_MBPop (); return false; } } $this->_MBPop (); return $res; } function EscapeString ( $string ) { $from = array ( '(',')','|','-','!','@','~','"','&', '/' ); $to = array ( '\(','\)','\|','\-','\!','\@','\~','\"', '\&', '\/' ); return str_replace ( $from, $to, $string ); } ///////////////////////////////////////////////////////////////////////////// // attribute updates ///////////////////////////////////////////////////////////////////////////// /// batch update given attributes in given rows in given indexes /// returns amount of updated documents (0 or more) on success, or -1 on failure function UpdateAttributes ( $index, $attrs, $values, $mva=false ) { // verify everything assert ( is_string($index) ); assert ( is_bool($mva) ); assert ( is_array($attrs) ); foreach ( $attrs as $attr ) assert ( is_string($attr) ); assert ( is_array($values) ); foreach ( $values as $id=>$entry ) { assert ( is_numeric($id) ); assert ( is_array($entry) ); assert ( count($entry)==count($attrs) ); foreach ( $entry as $v ) { if ( $mva ) { assert ( is_array($v) ); foreach ( $v as $vv ) assert ( is_int($vv) ); } else assert ( is_int($v) ); } } // build request $req = pack ( "N", strlen($index) ) . $index; $req .= pack ( "N", count($attrs) ); foreach ( $attrs as $attr ) { $req .= pack ( "N", strlen($attr) ) . $attr; $req .= pack ( "N", $mva ? 1 : 0 ); } $req .= pack ( "N", count($values) ); foreach ( $values as $id=>$entry ) { $req .= sphPack64 ( $id ); foreach ( $entry as $v ) { $req .= pack ( "N", $mva ? count($v) : $v ); if ( $mva ) foreach ( $v as $vv ) $req .= pack ( "N", $vv ); } } // connect, send query, get response if (!( $fp = $this->_Connect() )) return -1; $len = strlen($req); $req = pack ( "nnN", SEARCHD_COMMAND_UPDATE, VER_COMMAND_UPDATE, $len ) . $req; // add header fwrite ( $fp, $req, $len+8 ); if (!( $response = $this->_GetResponse ( $fp, VER_COMMAND_UPDATE ) )) return -1; // parse response list(,$updated) = unpack ( "N*", substr ( $response, 0, 4 ) ); return $updated; } } // // $Id$ // ?> coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/update_attributes.php100777 0 0 212 11643565730 21230 0UpdateAttributes('index', array('group'), array(123 => array(456))); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/update_attributes_mva.php100777 0 0 271 11643565730 22100 0UpdateAttributes('index', array('group', 'category'), array(123 => array(array(456, 789), array(1, 2, 3))), true); ?> coreseek-4.1-beta/csft-4.1/api/ruby/spec/fixtures/weights.php100777 0 0 175 11643565730 17162 0SetWeights(array(10, 20, 30, 40)); $cl->Query('query'); ?>coreseek-4.1-beta/csft-4.1/api/ruby/spec/sphinx/ 40777 0 0 0 11647303450 14345 5coreseek-4.1-beta/csft-4.1/api/ruby/spec/sphinx/sphinx-id64.conf100777 0 0 3553 11643565730 17406 0source src1 { type = mysql sql_host = localhost sql_user = root sql_pass = sql_db = sphinx_test sql_port = 3306 sql_query = SELECT id, name, description, UNIX_TIMESTAMP(created_at) AS created_at, group_id, rating FROM links sql_attr_uint = group_id sql_attr_timestamp = created_at sql_attr_float = rating sql_attr_multi = uint tags from query; SELECT link_id, tag_id FROM links_tags sql_query_info = SELECT * FROM links WHERE id=$id } source src2 { type = mysql sql_host = localhost sql_user = root sql_pass = sql_db = sphinx_test sql_port = 3306 sql_query = SELECT id, name, description, UNIX_TIMESTAMP(created_at) AS created_at, group_id FROM links64 sql_attr_uint = group_id sql_attr_timestamp = created_at sql_query_info = SELECT * FROM links WHERE id=$id } index test1 { source = src1 path = /opt/sphinx-0.9.9-id64/var/data/test1 docinfo = extern morphology = none stopwords = charset_type = utf-8 } index test2 { source = src2 path = /opt/sphinx-0.9.9-id64/var/data/test2 docinfo = extern morphology = none stopwords = charset_type = utf-8 } indexer { mem_limit = 32M } searchd { port = 9312 log = /opt/sphinx-0.9.9-id64/var/log/searchd.log query_log = /opt/sphinx-0.9.9-id64/var/log/query.log read_timeout = 5 max_children = 30 pid_file = /opt/sphinx-0.9.9-id64/var/log/searchd.pid max_matches = 1000 } coreseek-4.1-beta/csft-4.1/api/ruby/spec/sphinx/sphinx.conf100777 0 0 3522 11643565730 16636 0source src1 { type = mysql sql_host = localhost sql_user = root sql_pass = sql_db = sphinx_test sql_port = 3306 sql_query = SELECT id, name, description, UNIX_TIMESTAMP(created_at) AS created_at, group_id, rating FROM links sql_attr_uint = group_id sql_attr_timestamp = created_at sql_attr_float = rating sql_attr_multi = uint tags from query; SELECT link_id, tag_id FROM links_tags sql_query_info = SELECT * FROM links WHERE id=$id } source src2 { type = mysql sql_host = localhost sql_user = root sql_pass = sql_db = sphinx_test sql_port = 3306 sql_query = SELECT id, name, description, UNIX_TIMESTAMP(created_at) AS created_at, group_id FROM links64 sql_attr_uint = group_id sql_attr_timestamp = created_at sql_query_info = SELECT * FROM links WHERE id=$id } index test1 { source = src1 path = /opt/sphinx-0.9.9/var/data/test1 docinfo = extern morphology = none stopwords = charset_type = utf-8 } index test2 { source = src2 path = /opt/sphinx-0.9.9/var/data/test2 docinfo = extern morphology = none stopwords = charset_type = utf-8 } indexer { mem_limit = 32M } searchd { port = 9312 log = /opt/sphinx-0.9.9/var/log/searchd.log query_log = /opt/sphinx-0.9.9/var/log/query.log read_timeout = 5 max_children = 30 pid_file = /opt/sphinx-0.9.9/var/log/searchd.pid max_matches = 1000 } coreseek-4.1-beta/csft-4.1/api/ruby/spec/sphinx/sphinx_test.sql100777 0 0 7062 11643565730 17552 0/* SQLyog Enterprise - MySQL GUI v5.20 Host - 5.0.27-community-nt : Database - sphinx_test ********************************************************************* Server version : 5.0.27-community-nt */ SET NAMES utf8; SET SQL_MODE=''; CREATE database IF NOT EXISTS `sphinx_test`; USE `sphinx_test`; /* Table structure for table `links` */ DROP TABLE IF EXISTS `links`; CREATE TABLE `links` ( `id` INT(11) NOT NULL auto_increment, `name` VARCHAR(255) NOT NULL, `created_at` DATETIME NOT NULL, `description` TEXT, `group_id` INT(11) NOT NULL, `rating` FLOAT NOT NULL, PRIMARY KEY (`id`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8; /* Table structure for table `tags` */ DROP TABLE IF EXISTS `tags`; CREATE TABLE `tags` ( `id` INT(11) NOT NULL auto_increment, `tag` VARCHAR(255) NOT NULL, PRIMARY KEY (`id`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8; /* Table structure for table `links_tags` */ DROP TABLE IF EXISTS `links_tags`; CREATE TABLE `links_tags` ( `link_id` INT(11) NOT NULL, `tag_id` INT(11) NOT NULL, PRIMARY KEY (`link_id`,`tag_id`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8; /* Table structure for table `links64` */ DROP TABLE IF EXISTS `links64`; CREATE TABLE `links64` ( `id` BIGINT(11) NOT NULL auto_increment, `name` VARCHAR(255) NOT NULL, `created_at` DATETIME NOT NULL, `description` TEXT, `group_id` INT(11) NOT NULL, PRIMARY KEY (`id`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8; /* Data for the table `links` */ INSERT INTO `links`(`id`,`name`,`created_at`,`description`,`group_id`,`rating`) VALUES (1,'Paint Protects WiFi Network from Hackers','2007-04-04 06:48:10','A company known as SEC Technologies has created a special type of paint that blocks Wi-Fi signals so that you can be sure hackers can ',1,13.32), (2,'Airplanes To Become WiFi Hotspots','2007-04-04 06:49:15','Airlines will start turning their airplanes into WiFi hotspots beginning early next year, WSJ reports. Here\'s what you need to know...',2,54.85), (3,'Planet VIP-195 GSM/WiFi Phone With Windows Messanger','2007-04-04 06:50:47','The phone does comply with IEEE 802.11b and IEEE 802.11g to provide phone capability via WiFi. As GSM phone the VIP-195 support 900/1800/1900 band and GPRS too. It comes with simple button to switch between WiFi or GSM mod',1,16.25); /* Data for the table `tags` */ INSERT INTO `tags`(`id`,`tag`) VALUES (1, 'tag1'),(2, 'tag2'),(3, 'tag3'),(4, 'tag4'),(5, 'tag5'), (6, 'tag6'),(7, 'tag7'),(8, 'tag8'),(9, 'tag9'),(10, 'tag5'); /* Data for the table `links_tags` */ INSERT INTO `links_tags`(`link_id`,`tag_id`) VALUES (1, 1),(1, 2),(1, 3),(1, 4), (2, 5),(2, 6),(2, 7),(2, 8), (3, 9),(3, 1),(3, 7),(3, 10); /* Data for the table `links64` */ INSERT INTO `links64`(`id`,`name`,`created_at`,`description`,`group_id`) VALUES (4294967297,'Paint Protects WiFi Network from Hackers','2007-04-04 06:48:10','A company known as SEC Technologies has created a special type of paint that blocks Wi-Fi signals so that you can be sure hackers can ',1), (4294967298,'Airplanes To Become WiFi Hotspots','2007-04-04 06:49:15','Airlines will start turning their airplanes into WiFi hotspots beginning early next year, WSJ reports. Here\'s what you need to know...',2), (4294967299,'Planet VIP-195 GSM/WiFi Phone With Windows Messanger','2007-04-04 06:50:47','The phone does comply with IEEE 802.11b and IEEE 802.11g to provide phone capability via WiFi. As GSM phone the VIP-195 support 900/1800/1900 band and GPRS too. It comes with simple button to switch between WiFi or GSM mod',1); coreseek-4.1-beta/csft-4.1/api/ruby/sphinx.yml.tpl100777 0 0 130 11643565730 15015 0config_file: /opt/sphinx/etc/sphinx.conf root_dir: /opt/sphinx/bin indexes: test1 test2 coreseek-4.1-beta/csft-4.1/api/ruby/tasks/ 40777 0 0 0 11647303450 13227 5coreseek-4.1-beta/csft-4.1/api/ruby/tasks/sphinx.rake100777 0 0 4354 11643565730 15521 0namespace :sphinx do desc 'Run indexer for configured indexes' task :index do config = load_config if config[:indexes] system "#{config[:root_dir]}/indexer --config \"#{config[:config_file]}\" #{config[:indexes]}" else puts 'You should specify indexes in sphinx.yml' end end desc 'Run indexer for all indexes' task :index_all do config = load_config system "#{config[:root_dir]}/indexer --config \"#{config[:config_file]}\" --all" end desc 'Rotate configured indexes and restart searchd server' task :rotate do config = load_config if config[:indexes] system "#{config[:root_dir]}/indexer --config \"#{config[:config_file]}\" --rotate #{config[:indexes]}" else puts 'You should specify indexes in sphinx.yml' end end desc 'Rotate all indexes and restart searchd server' task :rotate_all do config = load_config system "#{config[:root_dir]}/indexer --config \"#{config[:config_file]}\" --rotate --all" end desc 'Start searchd server' task :start do config = load_config if File.exists?(config[:pid_file]) puts 'Sphinx searchd server is already started.' else system "#{config[:root_dir]}/searchd --config \"#{config[:config_file]}\"" puts 'Sphinx searchd server started.' end end desc 'Stop searchd server' task :stop do config = load_config unless File.exists?(config[:pid_file]) puts 'Sphinx searchd server is not running.' else pid = File.read(config[:pid_file]).chomp kill 'SIGHUP', pid puts 'Sphinx searchd server stopped.' end end desc 'Restart searchd server' task :restart => [:stop, :start] def load_config return @sphinx_config if @sphinx_config options = YAML.load_file(File.dirname(__FILE__) + '/../../../../config/sphinx.yml') rescue {} @sphinx_config = { :config_file => options['config_file'] || '/etc/sphinx.conf', :root_dir => options['root_dir'] || '/usr/bin', :indexes => options['indexes'] } sphinx_config = File.read(@sphinx_config[:config_file]) rescue '' sphinx_config =~ /searchd\s*{.*pid_file\s*=\s*(.*?)\n.*}/m @sphinx_config[:pid_file] = $1 || '/var/run/searchd.pid' return @sphinx_config end end coreseek-4.1-beta/csft-4.1/api/ruby/test.rb100777 0 0 1222 11643565730 13512 0# # $Id$ # require 'init.rb' q = ARGV.join(' ') @sphinx = Sphinx::Client.new # @sphinx.SetSortMode(Sphinx::Client::SPH_SORT_ATTR_ASC, 'created_at') results = @sphinx.Query(q) puts "Query '#{q}' retrieved #{results['total']} of #{results['total_found']} matches in #{results['time']} sec."; puts "Query stats:"; results['words'].each do |word, info| puts " '#{word}' found #{info['hits']} times in #{info['docs']} documents\n" end puts n = 1 results['matches'].each do |doc| print "#{n}. doc_id=#{doc['id']}, weight=#{doc['weight']}" doc['attrs'].each do |attr, value| print ", #{attr}=#{value}" end puts n = n+1 end coreseek-4.1-beta/csft-4.1/api/sphinxapi.php100777 0 0 134406 11643565730 14014 0=8 ) { $v = (int)$v; return pack ( "NN", $v>>32, $v&0xFFFFFFFF ); } // x32, int if ( is_int($v) ) return pack ( "NN", $v < 0 ? -1 : 0, $v ); // x32, bcmath if ( function_exists("bcmul") ) { if ( bccomp ( $v, 0 ) == -1 ) $v = bcadd ( "18446744073709551616", $v ); $h = bcdiv ( $v, "4294967296", 0 ); $l = bcmod ( $v, "4294967296" ); return pack ( "NN", (float)$h, (float)$l ); // conversion to float is intentional; int would lose 31st bit } // x32, no-bcmath $p = max(0, strlen($v) - 13); $lo = abs((float)substr($v, $p)); $hi = abs((float)substr($v, 0, $p)); $m = $lo + $hi*1316134912.0; // (10 ^ 13) % (1 << 32) = 1316134912 $q = floor($m/4294967296.0); $l = $m - ($q*4294967296.0); $h = $hi*2328.0 + $q; // (10 ^ 13) / (1 << 32) = 2328 if ( $v<0 ) { if ( $l==0 ) $h = 4294967296.0 - $h; else { $h = 4294967295.0 - $h; $l = 4294967296.0 - $l; } } return pack ( "NN", $h, $l ); } /// pack 64-bit unsigned function sphPackU64 ( $v ) { assert ( is_numeric($v) ); // x64 if ( PHP_INT_SIZE>=8 ) { assert ( $v>=0 ); // x64, int if ( is_int($v) ) return pack ( "NN", $v>>32, $v&0xFFFFFFFF ); // x64, bcmath if ( function_exists("bcmul") ) { $h = bcdiv ( $v, 4294967296, 0 ); $l = bcmod ( $v, 4294967296 ); return pack ( "NN", $h, $l ); } // x64, no-bcmath $p = max ( 0, strlen($v) - 13 ); $lo = (int)substr ( $v, $p ); $hi = (int)substr ( $v, 0, $p ); $m = $lo + $hi*1316134912; $l = $m % 4294967296; $h = $hi*2328 + (int)($m/4294967296); return pack ( "NN", $h, $l ); } // x32, int if ( is_int($v) ) return pack ( "NN", 0, $v ); // x32, bcmath if ( function_exists("bcmul") ) { $h = bcdiv ( $v, "4294967296", 0 ); $l = bcmod ( $v, "4294967296" ); return pack ( "NN", (float)$h, (float)$l ); // conversion to float is intentional; int would lose 31st bit } // x32, no-bcmath $p = max(0, strlen($v) - 13); $lo = (float)substr($v, $p); $hi = (float)substr($v, 0, $p); $m = $lo + $hi*1316134912.0; $q = floor($m / 4294967296.0); $l = $m - ($q * 4294967296.0); $h = $hi*2328.0 + $q; return pack ( "NN", $h, $l ); } // unpack 64-bit unsigned function sphUnpackU64 ( $v ) { list ( $hi, $lo ) = array_values ( unpack ( "N*N*", $v ) ); if ( PHP_INT_SIZE>=8 ) { if ( $hi<0 ) $hi += (1<<32); // because php 5.2.2 to 5.2.5 is totally fucked up again if ( $lo<0 ) $lo += (1<<32); // x64, int if ( $hi<=2147483647 ) return ($hi<<32) + $lo; // x64, bcmath if ( function_exists("bcmul") ) return bcadd ( $lo, bcmul ( $hi, "4294967296" ) ); // x64, no-bcmath $C = 100000; $h = ((int)($hi / $C) << 32) + (int)($lo / $C); $l = (($hi % $C) << 32) + ($lo % $C); if ( $l>$C ) { $h += (int)($l / $C); $l = $l % $C; } if ( $h==0 ) return $l; return sprintf ( "%d%05d", $h, $l ); } // x32, int if ( $hi==0 ) { if ( $lo>0 ) return $lo; return sprintf ( "%u", $lo ); } $hi = sprintf ( "%u", $hi ); $lo = sprintf ( "%u", $lo ); // x32, bcmath if ( function_exists("bcmul") ) return bcadd ( $lo, bcmul ( $hi, "4294967296" ) ); // x32, no-bcmath $hi = (float)$hi; $lo = (float)$lo; $q = floor($hi/10000000.0); $r = $hi - $q*10000000.0; $m = $lo + $r*4967296.0; $mq = floor($m/10000000.0); $l = $m - $mq*10000000.0; $h = $q*4294967296.0 + $r*429.0 + $mq; $h = sprintf ( "%.0f", $h ); $l = sprintf ( "%07.0f", $l ); if ( $h=="0" ) return sprintf( "%.0f", (float)$l ); return $h . $l; } // unpack 64-bit signed function sphUnpackI64 ( $v ) { list ( $hi, $lo ) = array_values ( unpack ( "N*N*", $v ) ); // x64 if ( PHP_INT_SIZE>=8 ) { if ( $hi<0 ) $hi += (1<<32); // because php 5.2.2 to 5.2.5 is totally fucked up again if ( $lo<0 ) $lo += (1<<32); return ($hi<<32) + $lo; } // x32, int if ( $hi==0 ) { if ( $lo>0 ) return $lo; return sprintf ( "%u", $lo ); } // x32, int elseif ( $hi==-1 ) { if ( $lo<0 ) return $lo; return sprintf ( "%.0f", $lo - 4294967296.0 ); } $neg = ""; $c = 0; if ( $hi<0 ) { $hi = ~$hi; $lo = ~$lo; $c = 1; $neg = "-"; } $hi = sprintf ( "%u", $hi ); $lo = sprintf ( "%u", $lo ); // x32, bcmath if ( function_exists("bcmul") ) return $neg . bcadd ( bcadd ( $lo, bcmul ( $hi, "4294967296" ) ), $c ); // x32, no-bcmath $hi = (float)$hi; $lo = (float)$lo; $q = floor($hi/10000000.0); $r = $hi - $q*10000000.0; $m = $lo + $r*4967296.0; $mq = floor($m/10000000.0); $l = $m - $mq*10000000.0 + $c; $h = $q*4294967296.0 + $r*429.0 + $mq; if ( $l==10000000 ) { $l = 0; $h += 1; } $h = sprintf ( "%.0f", $h ); $l = sprintf ( "%07.0f", $l ); if ( $h=="0" ) return $neg . sprintf( "%.0f", (float)$l ); return $neg . $h . $l; } function sphFixUint ( $value ) { if ( PHP_INT_SIZE>=8 ) { // x64 route, workaround broken unpack() in 5.2.2+ if ( $value<0 ) $value += (1<<32); return $value; } else { // x32 route, workaround php signed/unsigned braindamage return sprintf ( "%u", $value ); } } /// sphinx searchd client class class SphinxClient { var $_host; ///< searchd host (default is "localhost") var $_port; ///< searchd port (default is 9312) var $_offset; ///< how many records to seek from result-set start (default is 0) var $_limit; ///< how many records to return from result-set starting at offset (default is 20) var $_mode; ///< query matching mode (default is SPH_MATCH_ALL) var $_weights; ///< per-field weights (default is 1 for all fields) var $_sort; ///< match sorting mode (default is SPH_SORT_RELEVANCE) var $_sortby; ///< attribute to sort by (defualt is "") var $_min_id; ///< min ID to match (default is 0, which means no limit) var $_max_id; ///< max ID to match (default is 0, which means no limit) var $_filters; ///< search filters var $_groupby; ///< group-by attribute name var $_groupfunc; ///< group-by function (to pre-process group-by attribute value with) var $_groupsort; ///< group-by sorting clause (to sort groups in result set with) var $_groupdistinct;///< group-by count-distinct attribute var $_maxmatches; ///< max matches to retrieve var $_cutoff; ///< cutoff to stop searching at (default is 0) var $_retrycount; ///< distributed retries count var $_retrydelay; ///< distributed retries delay var $_anchor; ///< geographical anchor point var $_indexweights; ///< per-index weights var $_ranker; ///< ranking mode (default is SPH_RANK_PROXIMITY_BM25) var $_rankexpr; ///< ranking mode expression (for SPH_RANK_EXPR) var $_maxquerytime; ///< max query time, milliseconds (default is 0, do not limit) var $_fieldweights; ///< per-field-name weights var $_overrides; ///< per-query attribute values overrides var $_select; ///< select-list (attributes or expressions, with optional aliases) var $_error; ///< last error message var $_warning; ///< last warning message var $_connerror; ///< connection error vs remote error flag var $_reqs; ///< requests array for multi-query var $_mbenc; ///< stored mbstring encoding var $_arrayresult; ///< whether $result["matches"] should be a hash or an array var $_timeout; ///< connect timeout ///////////////////////////////////////////////////////////////////////////// // common stuff ///////////////////////////////////////////////////////////////////////////// /// create a new client object and fill defaults function SphinxClient () { // per-client-object settings $this->_host = "localhost"; $this->_port = 9312; $this->_path = false; $this->_socket = false; // per-query settings $this->_offset = 0; $this->_limit = 20; $this->_mode = SPH_MATCH_ALL; $this->_weights = array (); $this->_sort = SPH_SORT_RELEVANCE; $this->_sortby = ""; $this->_min_id = 0; $this->_max_id = 0; $this->_filters = array (); $this->_groupby = ""; $this->_groupfunc = SPH_GROUPBY_DAY; $this->_groupsort = "@group desc"; $this->_groupdistinct= ""; $this->_maxmatches = 1000; $this->_cutoff = 0; $this->_retrycount = 0; $this->_retrydelay = 0; $this->_anchor = array (); $this->_indexweights= array (); $this->_ranker = SPH_RANK_PROXIMITY_BM25; $this->_rankexpr = ""; $this->_maxquerytime= 0; $this->_fieldweights= array(); $this->_overrides = array(); $this->_select = "*"; $this->_error = ""; // per-reply fields (for single-query case) $this->_warning = ""; $this->_connerror = false; $this->_reqs = array (); // requests storage (for multi-query case) $this->_mbenc = ""; $this->_arrayresult = false; $this->_timeout = 0; } function __destruct() { if ( $this->_socket !== false ) fclose ( $this->_socket ); } /// get last error message (string) function GetLastError () { return $this->_error; } /// get last warning message (string) function GetLastWarning () { return $this->_warning; } /// get last error flag (to tell network connection errors from searchd errors or broken responses) function IsConnectError() { return $this->_connerror; } /// set searchd host name (string) and port (integer) function SetServer ( $host, $port = 0 ) { assert ( is_string($host) ); if ( $host[0] == '/') { $this->_path = 'unix://' . $host; return; } if ( substr ( $host, 0, 7 )=="unix://" ) { $this->_path = $host; return; } assert ( is_int($port) ); $this->_host = $host; $this->_port = $port; $this->_path = ''; } /// set server connection timeout (0 to remove) function SetConnectTimeout ( $timeout ) { assert ( is_numeric($timeout) ); $this->_timeout = $timeout; } function _Send ( $handle, $data, $length ) { if ( feof($handle) || fwrite ( $handle, $data, $length ) !== $length ) { $this->_error = 'connection unexpectedly closed (timed out?)'; $this->_connerror = true; return false; } return true; } ///////////////////////////////////////////////////////////////////////////// /// enter mbstring workaround mode function _MBPush () { $this->_mbenc = ""; if ( ini_get ( "mbstring.func_overload" ) & 2 ) { $this->_mbenc = mb_internal_encoding(); mb_internal_encoding ( "latin1" ); } } /// leave mbstring workaround mode function _MBPop () { if ( $this->_mbenc ) mb_internal_encoding ( $this->_mbenc ); } /// connect to searchd server function _Connect () { if ( $this->_socket!==false ) { // we are in persistent connection mode, so we have a socket // however, need to check whether it's still alive if ( !@feof ( $this->_socket ) ) return $this->_socket; // force reopen $this->_socket = false; } $errno = 0; $errstr = ""; $this->_connerror = false; if ( $this->_path ) { $host = $this->_path; $port = 0; } else { $host = $this->_host; $port = $this->_port; } if ( $this->_timeout<=0 ) $fp = @fsockopen ( $host, $port, $errno, $errstr ); else $fp = @fsockopen ( $host, $port, $errno, $errstr, $this->_timeout ); if ( !$fp ) { if ( $this->_path ) $location = $this->_path; else $location = "{$this->_host}:{$this->_port}"; $errstr = trim ( $errstr ); $this->_error = "connection to $location failed (errno=$errno, msg=$errstr)"; $this->_connerror = true; return false; } // send my version // this is a subtle part. we must do it before (!) reading back from searchd. // because otherwise under some conditions (reported on FreeBSD for instance) // TCP stack could throttle write-write-read pattern because of Nagle. if ( !$this->_Send ( $fp, pack ( "N", 1 ), 4 ) ) { fclose ( $fp ); $this->_error = "failed to send client protocol version"; return false; } // check version list(,$v) = unpack ( "N*", fread ( $fp, 4 ) ); $v = (int)$v; if ( $v<1 ) { fclose ( $fp ); $this->_error = "expected searchd protocol version 1+, got version '$v'"; return false; } return $fp; } /// get and check response packet from searchd server function _GetResponse ( $fp, $client_ver ) { $response = ""; $len = 0; $header = fread ( $fp, 8 ); if ( strlen($header)==8 ) { list ( $status, $ver, $len ) = array_values ( unpack ( "n2a/Nb", $header ) ); $left = $len; while ( $left>0 && !feof($fp) ) { $chunk = fread ( $fp, min ( 8192, $left ) ); if ( $chunk ) { $response .= $chunk; $left -= strlen($chunk); } } } if ( $this->_socket === false ) fclose ( $fp ); // check response $read = strlen ( $response ); if ( !$response || $read!=$len ) { $this->_error = $len ? "failed to read searchd response (status=$status, ver=$ver, len=$len, read=$read)" : "received zero-sized searchd response"; return false; } // check status if ( $status==SEARCHD_WARNING ) { list(,$wlen) = unpack ( "N*", substr ( $response, 0, 4 ) ); $this->_warning = substr ( $response, 4, $wlen ); return substr ( $response, 4+$wlen ); } if ( $status==SEARCHD_ERROR ) { $this->_error = "searchd error: " . substr ( $response, 4 ); return false; } if ( $status==SEARCHD_RETRY ) { $this->_error = "temporary searchd error: " . substr ( $response, 4 ); return false; } if ( $status!=SEARCHD_OK ) { $this->_error = "unknown status code '$status'"; return false; } // check version if ( $ver<$client_ver ) { $this->_warning = sprintf ( "searchd command v.%d.%d older than client's v.%d.%d, some options might not work", $ver>>8, $ver&0xff, $client_ver>>8, $client_ver&0xff ); } return $response; } ///////////////////////////////////////////////////////////////////////////// // searching ///////////////////////////////////////////////////////////////////////////// /// set offset and count into result set, /// and optionally set max-matches and cutoff limits function SetLimits ( $offset, $limit, $max=0, $cutoff=0 ) { assert ( is_int($offset) ); assert ( is_int($limit) ); assert ( $offset>=0 ); assert ( $limit>0 ); assert ( $max>=0 ); $this->_offset = $offset; $this->_limit = $limit; if ( $max>0 ) $this->_maxmatches = $max; if ( $cutoff>0 ) $this->_cutoff = $cutoff; } /// set maximum query time, in milliseconds, per-index /// integer, 0 means "do not limit" function SetMaxQueryTime ( $max ) { assert ( is_int($max) ); assert ( $max>=0 ); $this->_maxquerytime = $max; } /// set matching mode function SetMatchMode ( $mode ) { assert ( $mode==SPH_MATCH_ALL || $mode==SPH_MATCH_ANY || $mode==SPH_MATCH_PHRASE || $mode==SPH_MATCH_BOOLEAN || $mode==SPH_MATCH_EXTENDED || $mode==SPH_MATCH_FULLSCAN || $mode==SPH_MATCH_EXTENDED2 ); $this->_mode = $mode; } /// set ranking mode function SetRankingMode ( $ranker, $rankexpr="" ) { assert ( $ranker>=0 && $ranker_ranker = $ranker; $this->_rankexpr = $rankexpr; } /// set matches sorting mode function SetSortMode ( $mode, $sortby="" ) { assert ( $mode==SPH_SORT_RELEVANCE || $mode==SPH_SORT_ATTR_DESC || $mode==SPH_SORT_ATTR_ASC || $mode==SPH_SORT_TIME_SEGMENTS || $mode==SPH_SORT_EXTENDED || $mode==SPH_SORT_EXPR ); assert ( is_string($sortby) ); assert ( $mode==SPH_SORT_RELEVANCE || strlen($sortby)>0 ); $this->_sort = $mode; $this->_sortby = $sortby; } /// bind per-field weights by order /// DEPRECATED; use SetFieldWeights() instead function SetWeights ( $weights ) { assert ( is_array($weights) ); foreach ( $weights as $weight ) assert ( is_int($weight) ); $this->_weights = $weights; } /// bind per-field weights by name function SetFieldWeights ( $weights ) { assert ( is_array($weights) ); foreach ( $weights as $name=>$weight ) { assert ( is_string($name) ); assert ( is_int($weight) ); } $this->_fieldweights = $weights; } /// bind per-index weights by name function SetIndexWeights ( $weights ) { assert ( is_array($weights) ); foreach ( $weights as $index=>$weight ) { assert ( is_string($index) ); assert ( is_int($weight) ); } $this->_indexweights = $weights; } /// set IDs range to match /// only match records if document ID is beetwen $min and $max (inclusive) function SetIDRange ( $min, $max ) { assert ( is_numeric($min) ); assert ( is_numeric($max) ); assert ( $min<=$max ); $this->_min_id = $min; $this->_max_id = $max; } /// set values set filter /// only match records where $attribute value is in given set function SetFilter ( $attribute, $values, $exclude=false ) { assert ( is_string($attribute) ); assert ( is_array($values) ); assert ( count($values) ); if ( is_array($values) && count($values) ) { foreach ( $values as $value ) assert ( is_numeric($value) ); $this->_filters[] = array ( "type"=>SPH_FILTER_VALUES, "attr"=>$attribute, "exclude"=>$exclude, "values"=>$values ); } } /// set range filter /// only match records if $attribute value is beetwen $min and $max (inclusive) function SetFilterRange ( $attribute, $min, $max, $exclude=false ) { assert ( is_string($attribute) ); assert ( is_numeric($min) ); assert ( is_numeric($max) ); assert ( $min<=$max ); $this->_filters[] = array ( "type"=>SPH_FILTER_RANGE, "attr"=>$attribute, "exclude"=>$exclude, "min"=>$min, "max"=>$max ); } /// set float range filter /// only match records if $attribute value is beetwen $min and $max (inclusive) function SetFilterFloatRange ( $attribute, $min, $max, $exclude=false ) { assert ( is_string($attribute) ); assert ( is_float($min) ); assert ( is_float($max) ); assert ( $min<=$max ); $this->_filters[] = array ( "type"=>SPH_FILTER_FLOATRANGE, "attr"=>$attribute, "exclude"=>$exclude, "min"=>$min, "max"=>$max ); } /// setup anchor point for geosphere distance calculations /// required to use @geodist in filters and sorting /// latitude and longitude must be in radians function SetGeoAnchor ( $attrlat, $attrlong, $lat, $long ) { assert ( is_string($attrlat) ); assert ( is_string($attrlong) ); assert ( is_float($lat) ); assert ( is_float($long) ); $this->_anchor = array ( "attrlat"=>$attrlat, "attrlong"=>$attrlong, "lat"=>$lat, "long"=>$long ); } /// set grouping attribute and function function SetGroupBy ( $attribute, $func, $groupsort="@group desc" ) { assert ( is_string($attribute) ); assert ( is_string($groupsort) ); assert ( $func==SPH_GROUPBY_DAY || $func==SPH_GROUPBY_WEEK || $func==SPH_GROUPBY_MONTH || $func==SPH_GROUPBY_YEAR || $func==SPH_GROUPBY_ATTR || $func==SPH_GROUPBY_ATTRPAIR ); $this->_groupby = $attribute; $this->_groupfunc = $func; $this->_groupsort = $groupsort; } /// set count-distinct attribute for group-by queries function SetGroupDistinct ( $attribute ) { assert ( is_string($attribute) ); $this->_groupdistinct = $attribute; } /// set distributed retries count and delay function SetRetries ( $count, $delay=0 ) { assert ( is_int($count) && $count>=0 ); assert ( is_int($delay) && $delay>=0 ); $this->_retrycount = $count; $this->_retrydelay = $delay; } /// set result set format (hash or array; hash by default) /// PHP specific; needed for group-by-MVA result sets that may contain duplicate IDs function SetArrayResult ( $arrayresult ) { assert ( is_bool($arrayresult) ); $this->_arrayresult = $arrayresult; } /// set attribute values override /// there can be only one override per attribute /// $values must be a hash that maps document IDs to attribute values function SetOverride ( $attrname, $attrtype, $values ) { assert ( is_string ( $attrname ) ); assert ( in_array ( $attrtype, array ( SPH_ATTR_INTEGER, SPH_ATTR_TIMESTAMP, SPH_ATTR_BOOL, SPH_ATTR_FLOAT, SPH_ATTR_BIGINT ) ) ); assert ( is_array ( $values ) ); $this->_overrides[$attrname] = array ( "attr"=>$attrname, "type"=>$attrtype, "values"=>$values ); } /// set select-list (attributes or expressions), SQL-like syntax function SetSelect ( $select ) { assert ( is_string ( $select ) ); $this->_select = $select; } ////////////////////////////////////////////////////////////////////////////// /// clear all filters (for multi-queries) function ResetFilters () { $this->_filters = array(); $this->_anchor = array(); } /// clear groupby settings (for multi-queries) function ResetGroupBy () { $this->_groupby = ""; $this->_groupfunc = SPH_GROUPBY_DAY; $this->_groupsort = "@group desc"; $this->_groupdistinct= ""; } /// clear all attribute value overrides (for multi-queries) function ResetOverrides () { $this->_overrides = array (); } ////////////////////////////////////////////////////////////////////////////// /// connect to searchd server, run given search query through given indexes, /// and return the search results function Query ( $query, $index="*", $comment="" ) { assert ( empty($this->_reqs) ); $this->AddQuery ( $query, $index, $comment ); $results = $this->RunQueries (); $this->_reqs = array (); // just in case it failed too early if ( !is_array($results) ) return false; // probably network error; error message should be already filled $this->_error = $results[0]["error"]; $this->_warning = $results[0]["warning"]; if ( $results[0]["status"]==SEARCHD_ERROR ) return false; else return $results[0]; } /// helper to pack floats in network byte order function _PackFloat ( $f ) { $t1 = pack ( "f", $f ); // machine order list(,$t2) = unpack ( "L*", $t1 ); // int in machine order return pack ( "N", $t2 ); } /// add query to multi-query batch /// returns index into results array from RunQueries() call function AddQuery ( $query, $index="*", $comment="" ) { // mbstring workaround $this->_MBPush (); // build request $req = pack ( "NNNN", $this->_offset, $this->_limit, $this->_mode, $this->_ranker ); if ( $this->_ranker==SPH_RANK_EXPR ) $req .= pack ( "N", strlen($this->_rankexpr) ) . $this->_rankexpr; $req .= pack ( "N", $this->_sort ); // (deprecated) sort mode $req .= pack ( "N", strlen($this->_sortby) ) . $this->_sortby; $req .= pack ( "N", strlen($query) ) . $query; // query itself $req .= pack ( "N", count($this->_weights) ); // weights foreach ( $this->_weights as $weight ) $req .= pack ( "N", (int)$weight ); $req .= pack ( "N", strlen($index) ) . $index; // indexes $req .= pack ( "N", 1 ); // id64 range marker $req .= sphPackU64 ( $this->_min_id ) . sphPackU64 ( $this->_max_id ); // id64 range // filters $req .= pack ( "N", count($this->_filters) ); foreach ( $this->_filters as $filter ) { $req .= pack ( "N", strlen($filter["attr"]) ) . $filter["attr"]; $req .= pack ( "N", $filter["type"] ); switch ( $filter["type"] ) { case SPH_FILTER_VALUES: $req .= pack ( "N", count($filter["values"]) ); foreach ( $filter["values"] as $value ) $req .= sphPackI64 ( $value ); break; case SPH_FILTER_RANGE: $req .= sphPackI64 ( $filter["min"] ) . sphPackI64 ( $filter["max"] ); break; case SPH_FILTER_FLOATRANGE: $req .= $this->_PackFloat ( $filter["min"] ) . $this->_PackFloat ( $filter["max"] ); break; default: assert ( 0 && "internal error: unhandled filter type" ); } $req .= pack ( "N", $filter["exclude"] ); } // group-by clause, max-matches count, group-sort clause, cutoff count $req .= pack ( "NN", $this->_groupfunc, strlen($this->_groupby) ) . $this->_groupby; $req .= pack ( "N", $this->_maxmatches ); $req .= pack ( "N", strlen($this->_groupsort) ) . $this->_groupsort; $req .= pack ( "NNN", $this->_cutoff, $this->_retrycount, $this->_retrydelay ); $req .= pack ( "N", strlen($this->_groupdistinct) ) . $this->_groupdistinct; // anchor point if ( empty($this->_anchor) ) { $req .= pack ( "N", 0 ); } else { $a =& $this->_anchor; $req .= pack ( "N", 1 ); $req .= pack ( "N", strlen($a["attrlat"]) ) . $a["attrlat"]; $req .= pack ( "N", strlen($a["attrlong"]) ) . $a["attrlong"]; $req .= $this->_PackFloat ( $a["lat"] ) . $this->_PackFloat ( $a["long"] ); } // per-index weights $req .= pack ( "N", count($this->_indexweights) ); foreach ( $this->_indexweights as $idx=>$weight ) $req .= pack ( "N", strlen($idx) ) . $idx . pack ( "N", $weight ); // max query time $req .= pack ( "N", $this->_maxquerytime ); // per-field weights $req .= pack ( "N", count($this->_fieldweights) ); foreach ( $this->_fieldweights as $field=>$weight ) $req .= pack ( "N", strlen($field) ) . $field . pack ( "N", $weight ); // comment $req .= pack ( "N", strlen($comment) ) . $comment; // attribute overrides $req .= pack ( "N", count($this->_overrides) ); foreach ( $this->_overrides as $key => $entry ) { $req .= pack ( "N", strlen($entry["attr"]) ) . $entry["attr"]; $req .= pack ( "NN", $entry["type"], count($entry["values"]) ); foreach ( $entry["values"] as $id=>$val ) { assert ( is_numeric($id) ); assert ( is_numeric($val) ); $req .= sphPackU64 ( $id ); switch ( $entry["type"] ) { case SPH_ATTR_FLOAT: $req .= $this->_PackFloat ( $val ); break; case SPH_ATTR_BIGINT: $req .= sphPackI64 ( $val ); break; default: $req .= pack ( "N", $val ); break; } } } // select-list $req .= pack ( "N", strlen($this->_select) ) . $this->_select; // mbstring workaround $this->_MBPop (); // store request to requests array $this->_reqs[] = $req; return count($this->_reqs)-1; } /// connect to searchd, run queries batch, and return an array of result sets function RunQueries () { if ( empty($this->_reqs) ) { $this->_error = "no queries defined, issue AddQuery() first"; return false; } // mbstring workaround $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop (); return false; } // send query, get response $nreqs = count($this->_reqs); $req = join ( "", $this->_reqs ); $len = 8+strlen($req); $req = pack ( "nnNNN", SEARCHD_COMMAND_SEARCH, VER_COMMAND_SEARCH, $len, 0, $nreqs ) . $req; // add header if ( !( $this->_Send ( $fp, $req, $len+8 ) ) || !( $response = $this->_GetResponse ( $fp, VER_COMMAND_SEARCH ) ) ) { $this->_MBPop (); return false; } // query sent ok; we can reset reqs now $this->_reqs = array (); // parse and return response return $this->_ParseSearchResponse ( $response, $nreqs ); } /// parse and return search query (or queries) response function _ParseSearchResponse ( $response, $nreqs ) { $p = 0; // current position $max = strlen($response); // max position for checks, to protect against broken responses $results = array (); for ( $ires=0; $ires<$nreqs && $p<$max; $ires++ ) { $results[] = array(); $result =& $results[$ires]; $result["error"] = ""; $result["warning"] = ""; // extract status list(,$status) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $result["status"] = $status; if ( $status!=SEARCHD_OK ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $message = substr ( $response, $p, $len ); $p += $len; if ( $status==SEARCHD_WARNING ) { $result["warning"] = $message; } else { $result["error"] = $message; continue; } } // read schema $fields = array (); $attrs = array (); list(,$nfields) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; while ( $nfields-->0 && $p<$max ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $fields[] = substr ( $response, $p, $len ); $p += $len; } $result["fields"] = $fields; list(,$nattrs) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; while ( $nattrs-->0 && $p<$max ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $attr = substr ( $response, $p, $len ); $p += $len; list(,$type) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $attrs[$attr] = $type; } $result["attrs"] = $attrs; // read match count list(,$count) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; list(,$id64) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; // read matches $idx = -1; while ( $count-->0 && $p<$max ) { // index into result array $idx++; // parse document id and weight if ( $id64 ) { $doc = sphUnpackU64 ( substr ( $response, $p, 8 ) ); $p += 8; list(,$weight) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; } else { list ( $doc, $weight ) = array_values ( unpack ( "N*N*", substr ( $response, $p, 8 ) ) ); $p += 8; $doc = sphFixUint($doc); } $weight = sprintf ( "%u", $weight ); // create match entry if ( $this->_arrayresult ) $result["matches"][$idx] = array ( "id"=>$doc, "weight"=>$weight ); else $result["matches"][$doc]["weight"] = $weight; // parse and create attributes $attrvals = array (); foreach ( $attrs as $attr=>$type ) { // handle 64bit ints if ( $type==SPH_ATTR_BIGINT ) { $attrvals[$attr] = sphUnpackI64 ( substr ( $response, $p, 8 ) ); $p += 8; continue; } // handle floats if ( $type==SPH_ATTR_FLOAT ) { list(,$uval) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; list(,$fval) = unpack ( "f*", pack ( "L", $uval ) ); $attrvals[$attr] = $fval; continue; } // handle everything else as unsigned ints list(,$val) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; if ( $type==SPH_ATTR_MULTI ) { $attrvals[$attr] = array (); $nvalues = $val; while ( $nvalues-->0 && $p<$max ) { list(,$val) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $attrvals[$attr][] = sphFixUint($val); } } else if ( $type==SPH_ATTR_MULTI64 ) { $attrvals[$attr] = array (); $nvalues = $val; while ( $nvalues>0 && $p<$max ) { $val = sphUnpackU64 ( substr ( $response, $p, 8 ) ); $p += 8; $attrvals[$attr][] = strval( $val ); // FIXME!!! sphFixUint returns MVA values as string so It to $nvalues -= 2; } } else if ( $type==SPH_ATTR_STRING ) { $attrvals[$attr] = substr ( $response, $p, $val ); $p += $val; } else { $attrvals[$attr] = sphFixUint($val); } } if ( $this->_arrayresult ) $result["matches"][$idx]["attrs"] = $attrvals; else $result["matches"][$doc]["attrs"] = $attrvals; } list ( $total, $total_found, $msecs, $words ) = array_values ( unpack ( "N*N*N*N*", substr ( $response, $p, 16 ) ) ); $result["total"] = sprintf ( "%u", $total ); $result["total_found"] = sprintf ( "%u", $total_found ); $result["time"] = sprintf ( "%.3f", $msecs/1000 ); $p += 16; while ( $words-->0 && $p<$max ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $word = substr ( $response, $p, $len ); $p += $len; list ( $docs, $hits ) = array_values ( unpack ( "N*N*", substr ( $response, $p, 8 ) ) ); $p += 8; $result["words"][$word] = array ( "docs"=>sprintf ( "%u", $docs ), "hits"=>sprintf ( "%u", $hits ) ); } } $this->_MBPop (); return $results; } ///////////////////////////////////////////////////////////////////////////// // excerpts generation ///////////////////////////////////////////////////////////////////////////// /// connect to searchd server, and generate exceprts (snippets) /// of given documents for given query. returns false on failure, /// an array of snippets on success function BuildExcerpts ( $docs, $index, $words, $opts=array() ) { assert ( is_array($docs) ); assert ( is_string($index) ); assert ( is_string($words) ); assert ( is_array($opts) ); $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop(); return false; } ///////////////// // fixup options ///////////////// if ( !isset($opts["before_match"]) ) $opts["before_match"] = ""; if ( !isset($opts["after_match"]) ) $opts["after_match"] = ""; if ( !isset($opts["chunk_separator"]) ) $opts["chunk_separator"] = " ... "; if ( !isset($opts["limit"]) ) $opts["limit"] = 256; if ( !isset($opts["limit_passages"]) ) $opts["limit_passages"] = 0; if ( !isset($opts["limit_words"]) ) $opts["limit_words"] = 0; if ( !isset($opts["around"]) ) $opts["around"] = 5; if ( !isset($opts["exact_phrase"]) ) $opts["exact_phrase"] = false; if ( !isset($opts["single_passage"]) ) $opts["single_passage"] = false; if ( !isset($opts["use_boundaries"]) ) $opts["use_boundaries"] = false; if ( !isset($opts["weight_order"]) ) $opts["weight_order"] = false; if ( !isset($opts["query_mode"]) ) $opts["query_mode"] = false; if ( !isset($opts["force_all_words"]) ) $opts["force_all_words"] = false; if ( !isset($opts["start_passage_id"]) ) $opts["start_passage_id"] = 1; if ( !isset($opts["load_files"]) ) $opts["load_files"] = false; if ( !isset($opts["html_strip_mode"]) ) $opts["html_strip_mode"] = "index"; if ( !isset($opts["allow_empty"]) ) $opts["allow_empty"] = false; if ( !isset($opts["passage_boundary"]) ) $opts["passage_boundary"] = "none"; if ( !isset($opts["emit_zones"]) ) $opts["emit_zones"] = false; ///////////////// // build request ///////////////// // v.1.2 req $flags = 1; // remove spaces if ( $opts["exact_phrase"] ) $flags |= 2; if ( $opts["single_passage"] ) $flags |= 4; if ( $opts["use_boundaries"] ) $flags |= 8; if ( $opts["weight_order"] ) $flags |= 16; if ( $opts["query_mode"] ) $flags |= 32; if ( $opts["force_all_words"] ) $flags |= 64; if ( $opts["load_files"] ) $flags |= 128; if ( $opts["allow_empty"] ) $flags |= 256; if ( $opts["emit_zones"] ) $flags |= 512; $req = pack ( "NN", 0, $flags ); // mode=0, flags=$flags $req .= pack ( "N", strlen($index) ) . $index; // req index $req .= pack ( "N", strlen($words) ) . $words; // req words // options $req .= pack ( "N", strlen($opts["before_match"]) ) . $opts["before_match"]; $req .= pack ( "N", strlen($opts["after_match"]) ) . $opts["after_match"]; $req .= pack ( "N", strlen($opts["chunk_separator"]) ) . $opts["chunk_separator"]; $req .= pack ( "NN", (int)$opts["limit"], (int)$opts["around"] ); $req .= pack ( "NNN", (int)$opts["limit_passages"], (int)$opts["limit_words"], (int)$opts["start_passage_id"] ); // v.1.2 $req .= pack ( "N", strlen($opts["html_strip_mode"]) ) . $opts["html_strip_mode"]; $req .= pack ( "N", strlen($opts["passage_boundary"]) ) . $opts["passage_boundary"]; // documents $req .= pack ( "N", count($docs) ); foreach ( $docs as $doc ) { assert ( is_string($doc) ); $req .= pack ( "N", strlen($doc) ) . $doc; } //////////////////////////// // send query, get response //////////////////////////// $len = strlen($req); $req = pack ( "nnN", SEARCHD_COMMAND_EXCERPT, VER_COMMAND_EXCERPT, $len ) . $req; // add header if ( !( $this->_Send ( $fp, $req, $len+8 ) ) || !( $response = $this->_GetResponse ( $fp, VER_COMMAND_EXCERPT ) ) ) { $this->_MBPop (); return false; } ////////////////// // parse response ////////////////// $pos = 0; $res = array (); $rlen = strlen($response); for ( $i=0; $i $rlen ) { $this->_error = "incomplete reply"; $this->_MBPop (); return false; } $res[] = $len ? substr ( $response, $pos, $len ) : ""; $pos += $len; } $this->_MBPop (); return $res; } ///////////////////////////////////////////////////////////////////////////// // keyword generation ///////////////////////////////////////////////////////////////////////////// /// connect to searchd server, and generate keyword list for a given query /// returns false on failure, /// an array of words on success function BuildKeywords ( $query, $index, $hits ) { assert ( is_string($query) ); assert ( is_string($index) ); assert ( is_bool($hits) ); $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop(); return false; } ///////////////// // build request ///////////////// // v.1.0 req $req = pack ( "N", strlen($query) ) . $query; // req query $req .= pack ( "N", strlen($index) ) . $index; // req index $req .= pack ( "N", (int)$hits ); //////////////////////////// // send query, get response //////////////////////////// $len = strlen($req); $req = pack ( "nnN", SEARCHD_COMMAND_KEYWORDS, VER_COMMAND_KEYWORDS, $len ) . $req; // add header if ( !( $this->_Send ( $fp, $req, $len+8 ) ) || !( $response = $this->_GetResponse ( $fp, VER_COMMAND_KEYWORDS ) ) ) { $this->_MBPop (); return false; } ////////////////// // parse response ////////////////// $pos = 0; $res = array (); $rlen = strlen($response); list(,$nwords) = unpack ( "N*", substr ( $response, $pos, 4 ) ); $pos += 4; for ( $i=0; $i<$nwords; $i++ ) { list(,$len) = unpack ( "N*", substr ( $response, $pos, 4 ) ); $pos += 4; $tokenized = $len ? substr ( $response, $pos, $len ) : ""; $pos += $len; list(,$len) = unpack ( "N*", substr ( $response, $pos, 4 ) ); $pos += 4; $normalized = $len ? substr ( $response, $pos, $len ) : ""; $pos += $len; $res[] = array ( "tokenized"=>$tokenized, "normalized"=>$normalized ); if ( $hits ) { list($ndocs,$nhits) = array_values ( unpack ( "N*N*", substr ( $response, $pos, 8 ) ) ); $pos += 8; $res [$i]["docs"] = $ndocs; $res [$i]["hits"] = $nhits; } if ( $pos > $rlen ) { $this->_error = "incomplete reply"; $this->_MBPop (); return false; } } $this->_MBPop (); return $res; } function EscapeString ( $string ) { $from = array ( '\\', '(',')','|','-','!','@','~','"','&', '/', '^', '$', '=' ); $to = array ( '\\\\', '\(','\)','\|','\-','\!','\@','\~','\"', '\&', '\/', '\^', '\$', '\=' ); return str_replace ( $from, $to, $string ); } ///////////////////////////////////////////////////////////////////////////// // attribute updates ///////////////////////////////////////////////////////////////////////////// /// batch update given attributes in given rows in given indexes /// returns amount of updated documents (0 or more) on success, or -1 on failure function UpdateAttributes ( $index, $attrs, $values, $mva=false ) { // verify everything assert ( is_string($index) ); assert ( is_bool($mva) ); assert ( is_array($attrs) ); foreach ( $attrs as $attr ) assert ( is_string($attr) ); assert ( is_array($values) ); foreach ( $values as $id=>$entry ) { assert ( is_numeric($id) ); assert ( is_array($entry) ); assert ( count($entry)==count($attrs) ); foreach ( $entry as $v ) { if ( $mva ) { assert ( is_array($v) ); foreach ( $v as $vv ) assert ( is_int($vv) ); } else assert ( is_int($v) ); } } // build request $this->_MBPush (); $req = pack ( "N", strlen($index) ) . $index; $req .= pack ( "N", count($attrs) ); foreach ( $attrs as $attr ) { $req .= pack ( "N", strlen($attr) ) . $attr; $req .= pack ( "N", $mva ? 1 : 0 ); } $req .= pack ( "N", count($values) ); foreach ( $values as $id=>$entry ) { $req .= sphPackU64 ( $id ); foreach ( $entry as $v ) { $req .= pack ( "N", $mva ? count($v) : $v ); if ( $mva ) foreach ( $v as $vv ) $req .= pack ( "N", $vv ); } } // connect, send query, get response if (!( $fp = $this->_Connect() )) { $this->_MBPop (); return -1; } $len = strlen($req); $req = pack ( "nnN", SEARCHD_COMMAND_UPDATE, VER_COMMAND_UPDATE, $len ) . $req; // add header if ( !$this->_Send ( $fp, $req, $len+8 ) ) { $this->_MBPop (); return -1; } if (!( $response = $this->_GetResponse ( $fp, VER_COMMAND_UPDATE ) )) { $this->_MBPop (); return -1; } // parse response list(,$updated) = unpack ( "N*", substr ( $response, 0, 4 ) ); $this->_MBPop (); return $updated; } ///////////////////////////////////////////////////////////////////////////// // persistent connections ///////////////////////////////////////////////////////////////////////////// function Open() { if ( $this->_socket !== false ) { $this->_error = 'already connected'; return false; } if ( !$fp = $this->_Connect() ) return false; // command, command version = 0, body length = 4, body = 1 $req = pack ( "nnNN", SEARCHD_COMMAND_PERSIST, 0, 4, 1 ); if ( !$this->_Send ( $fp, $req, 12 ) ) return false; $this->_socket = $fp; return true; } function Close() { if ( $this->_socket === false ) { $this->_error = 'not connected'; return false; } fclose ( $this->_socket ); $this->_socket = false; return true; } ////////////////////////////////////////////////////////////////////////// // status ////////////////////////////////////////////////////////////////////////// function Status () { $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop(); return false; } $req = pack ( "nnNN", SEARCHD_COMMAND_STATUS, VER_COMMAND_STATUS, 4, 1 ); // len=4, body=1 if ( !( $this->_Send ( $fp, $req, 12 ) ) || !( $response = $this->_GetResponse ( $fp, VER_COMMAND_STATUS ) ) ) { $this->_MBPop (); return false; } $res = substr ( $response, 4 ); // just ignore length, error handling, etc $p = 0; list ( $rows, $cols ) = array_values ( unpack ( "N*N*", substr ( $response, $p, 8 ) ) ); $p += 8; $res = array(); for ( $i=0; $i<$rows; $i++ ) for ( $j=0; $j<$cols; $j++ ) { list(,$len) = unpack ( "N*", substr ( $response, $p, 4 ) ); $p += 4; $res[$i][] = substr ( $response, $p, $len ); $p += $len; } $this->_MBPop (); return $res; } ////////////////////////////////////////////////////////////////////////// // flush ////////////////////////////////////////////////////////////////////////// function FlushAttributes () { $this->_MBPush (); if (!( $fp = $this->_Connect() )) { $this->_MBPop(); return -1; } $req = pack ( "nnN", SEARCHD_COMMAND_FLUSHATTRS, VER_COMMAND_FLUSHATTRS, 0 ); // len=0 if ( !( $this->_Send ( $fp, $req, 8 ) ) || !( $response = $this->_GetResponse ( $fp, VER_COMMAND_FLUSHATTRS ) ) ) { $this->_MBPop (); return -1; } $tag = -1; if ( strlen($response)==4 ) list(,$tag) = unpack ( "N*", $response ); else $this->_error = "unexpected response length"; $this->_MBPop (); return $tag; } } // // $Id$ // coreseek-4.1-beta/csft-4.1/api/sphinxapi.py100777 0 0 73100 11643565730 13626 0# # $Id$ # # Python version of Sphinx searchd client (Python API) # # Copyright (c) 2006, Mike Osadnik # Copyright (c) 2006-2011, Andrew Aksyonoff # Copyright (c) 2008-2011, Sphinx Technologies Inc # All rights reserved # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License. You should have # received a copy of the GPL license along with this program; if you # did not, you can find it at http://www.gnu.org/ # import sys import select import socket import re from struct import * # known searchd commands SEARCHD_COMMAND_SEARCH = 0 SEARCHD_COMMAND_EXCERPT = 1 SEARCHD_COMMAND_UPDATE = 2 SEARCHD_COMMAND_KEYWORDS = 3 SEARCHD_COMMAND_PERSIST = 4 SEARCHD_COMMAND_STATUS = 5 SEARCHD_COMMAND_FLUSHATTRS = 7 # current client-side command implementation versions VER_COMMAND_SEARCH = 0x119 VER_COMMAND_EXCERPT = 0x103 VER_COMMAND_UPDATE = 0x102 VER_COMMAND_KEYWORDS = 0x100 VER_COMMAND_STATUS = 0x100 VER_COMMAND_FLUSHATTRS = 0x100 # known searchd status codes SEARCHD_OK = 0 SEARCHD_ERROR = 1 SEARCHD_RETRY = 2 SEARCHD_WARNING = 3 # known match modes SPH_MATCH_ALL = 0 SPH_MATCH_ANY = 1 SPH_MATCH_PHRASE = 2 SPH_MATCH_BOOLEAN = 3 SPH_MATCH_EXTENDED = 4 SPH_MATCH_FULLSCAN = 5 SPH_MATCH_EXTENDED2 = 6 # known ranking modes (extended2 mode only) SPH_RANK_PROXIMITY_BM25 = 0 # default mode, phrase proximity major factor and BM25 minor one SPH_RANK_BM25 = 1 # statistical mode, BM25 ranking only (faster but worse quality) SPH_RANK_NONE = 2 # no ranking, all matches get a weight of 1 SPH_RANK_WORDCOUNT = 3 # simple word-count weighting, rank is a weighted sum of per-field keyword occurence counts SPH_RANK_PROXIMITY = 4 SPH_RANK_MATCHANY = 5 SPH_RANK_FIELDMASK = 6 SPH_RANK_SPH04 = 7 SPH_RANK_EXPR = 8 SPH_RANK_TOTAL = 9 # known sort modes SPH_SORT_RELEVANCE = 0 SPH_SORT_ATTR_DESC = 1 SPH_SORT_ATTR_ASC = 2 SPH_SORT_TIME_SEGMENTS = 3 SPH_SORT_EXTENDED = 4 SPH_SORT_EXPR = 5 # known filter types SPH_FILTER_VALUES = 0 SPH_FILTER_RANGE = 1 SPH_FILTER_FLOATRANGE = 2 # known attribute types SPH_ATTR_NONE = 0 SPH_ATTR_INTEGER = 1 SPH_ATTR_TIMESTAMP = 2 SPH_ATTR_ORDINAL = 3 SPH_ATTR_BOOL = 4 SPH_ATTR_FLOAT = 5 SPH_ATTR_BIGINT = 6 SPH_ATTR_STRING = 7 SPH_ATTR_MULTI = 0X40000001L SPH_ATTR_MULTI64 = 0X40000002L SPH_ATTR_TYPES = (SPH_ATTR_NONE, SPH_ATTR_INTEGER, SPH_ATTR_TIMESTAMP, SPH_ATTR_ORDINAL, SPH_ATTR_BOOL, SPH_ATTR_FLOAT, SPH_ATTR_BIGINT, SPH_ATTR_STRING, SPH_ATTR_MULTI, SPH_ATTR_MULTI64) # known grouping functions SPH_GROUPBY_DAY = 0 SPH_GROUPBY_WEEK = 1 SPH_GROUPBY_MONTH = 2 SPH_GROUPBY_YEAR = 3 SPH_GROUPBY_ATTR = 4 SPH_GROUPBY_ATTRPAIR = 5 class SphinxClient: def __init__ (self): """ Create a new client object, and fill defaults. """ self._host = 'localhost' # searchd host (default is "localhost") self._port = 9312 # searchd port (default is 9312) self._path = None # searchd unix-domain socket path self._socket = None self._offset = 0 # how much records to seek from result-set start (default is 0) self._limit = 20 # how much records to return from result-set starting at offset (default is 20) self._mode = SPH_MATCH_ALL # query matching mode (default is SPH_MATCH_ALL) self._weights = [] # per-field weights (default is 1 for all fields) self._sort = SPH_SORT_RELEVANCE # match sorting mode (default is SPH_SORT_RELEVANCE) self._sortby = '' # attribute to sort by (defualt is "") self._min_id = 0 # min ID to match (default is 0) self._max_id = 0 # max ID to match (default is UINT_MAX) self._filters = [] # search filters self._groupby = '' # group-by attribute name self._groupfunc = SPH_GROUPBY_DAY # group-by function (to pre-process group-by attribute value with) self._groupsort = '@group desc' # group-by sorting clause (to sort groups in result set with) self._groupdistinct = '' # group-by count-distinct attribute self._maxmatches = 1000 # max matches to retrieve self._cutoff = 0 # cutoff to stop searching at self._retrycount = 0 # distributed retry count self._retrydelay = 0 # distributed retry delay self._anchor = {} # geographical anchor point self._indexweights = {} # per-index weights self._ranker = SPH_RANK_PROXIMITY_BM25 # ranking mode self._rankexpr = '' # ranking expression for SPH_RANK_EXPR self._maxquerytime = 0 # max query time, milliseconds (default is 0, do not limit) self._timeout = 1.0 # connection timeout self._fieldweights = {} # per-field-name weights self._overrides = {} # per-query attribute values overrides self._select = '*' # select-list (attributes or expressions, with optional aliases) self._error = '' # last error message self._warning = '' # last warning message self._reqs = [] # requests array for multi-query def __del__ (self): if self._socket: self._socket.close() def GetLastError (self): """ Get last error message (string). """ return self._error def GetLastWarning (self): """ Get last warning message (string). """ return self._warning def SetServer (self, host, port = None): """ Set searchd server host and port. """ assert(isinstance(host, str)) if host.startswith('/'): self._path = host return elif host.startswith('unix://'): self._path = host[7:] return assert(isinstance(port, int)) self._host = host self._port = port self._path = None def SetConnectTimeout ( self, timeout ): """ Set connection timeout ( float second ) """ assert (isinstance(timeout, float)) # set timeout to 0 make connaection non-blocking that is wrong so timeout got clipped to reasonable minimum self._timeout = max ( 0.001, timeout ) def _Connect (self): """ INTERNAL METHOD, DO NOT CALL. Connects to searchd server. """ if self._socket: # we have a socket, but is it still alive? sr, sw, _ = select.select ( [self._socket], [self._socket], [], 0 ) # this is how alive socket should look if len(sr)==0 and len(sw)==1: return self._socket # oops, looks like it was closed, lets reopen self._socket.close() self._socket = None try: if self._path: af = socket.AF_UNIX addr = self._path desc = self._path else: af = socket.AF_INET addr = ( self._host, self._port ) desc = '%s;%s' % addr sock = socket.socket ( af, socket.SOCK_STREAM ) sock.settimeout ( self._timeout ) sock.connect ( addr ) except socket.error, msg: if sock: sock.close() self._error = 'connection to %s failed (%s)' % ( desc, msg ) return v = unpack('>L', sock.recv(4)) if v<1: sock.close() self._error = 'expected searchd protocol version, got %s' % v return # all ok, send my version sock.send(pack('>L', 1)) return sock def _GetResponse (self, sock, client_ver): """ INTERNAL METHOD, DO NOT CALL. Gets and checks response packet from searchd server. """ (status, ver, length) = unpack('>2HL', sock.recv(8)) response = '' left = length while left>0: chunk = sock.recv(left) if chunk: response += chunk left -= len(chunk) else: break if not self._socket: sock.close() # check response read = len(response) if not response or read!=length: if length: self._error = 'failed to read searchd response (status=%s, ver=%s, len=%s, read=%s)' \ % (status, ver, length, read) else: self._error = 'received zero-sized searchd response' return None # check status if status==SEARCHD_WARNING: wend = 4 + unpack ( '>L', response[0:4] )[0] self._warning = response[4:wend] return response[wend:] if status==SEARCHD_ERROR: self._error = 'searchd error: '+response[4:] return None if status==SEARCHD_RETRY: self._error = 'temporary searchd error: '+response[4:] return None if status!=SEARCHD_OK: self._error = 'unknown status code %d' % status return None # check version if ver>8, ver&0xff, client_ver>>8, client_ver&0xff) return response def SetLimits (self, offset, limit, maxmatches=0, cutoff=0): """ Set offset and count into result set, and optionally set max-matches and cutoff limits. """ assert ( type(offset) in [int,long] and 0<=offset<16777216 ) assert ( type(limit) in [int,long] and 0=0) self._offset = offset self._limit = limit if maxmatches>0: self._maxmatches = maxmatches if cutoff>=0: self._cutoff = cutoff def SetMaxQueryTime (self, maxquerytime): """ Set maximum query time, in milliseconds, per-index. 0 means 'do not limit'. """ assert(isinstance(maxquerytime,int) and maxquerytime>0) self._maxquerytime = maxquerytime def SetMatchMode (self, mode): """ Set matching mode. """ assert(mode in [SPH_MATCH_ALL, SPH_MATCH_ANY, SPH_MATCH_PHRASE, SPH_MATCH_BOOLEAN, SPH_MATCH_EXTENDED, SPH_MATCH_FULLSCAN, SPH_MATCH_EXTENDED2]) self._mode = mode def SetRankingMode ( self, ranker, rankexpr='' ): """ Set ranking mode. """ assert(ranker>=0 and ranker=0) assert(isinstance(delay,int) and delay>=0) self._retrycount = count self._retrydelay = delay def SetOverride (self, name, type, values): assert(isinstance(name, str)) assert(type in SPH_ATTR_TYPES) assert(isinstance(values, dict)) self._overrides[name] = {'name': name, 'type': type, 'values': values} def SetSelect (self, select): assert(isinstance(select, str)) self._select = select def ResetOverrides (self): self._overrides = {} def ResetFilters (self): """ Clear all filters (for multi-queries). """ self._filters = [] self._anchor = {} def ResetGroupBy (self): """ Clear groupby settings (for multi-queries). """ self._groupby = '' self._groupfunc = SPH_GROUPBY_DAY self._groupsort = '@group desc' self._groupdistinct = '' def Query (self, query, index='*', comment=''): """ Connect to searchd server and run given search query. Returns None on failure; result set hash on success (see documentation for details). """ assert(len(self._reqs)==0) self.AddQuery(query,index,comment) results = self.RunQueries() self._reqs = [] # we won't re-run erroneous batch if not results or len(results)==0: return None self._error = results[0]['error'] self._warning = results[0]['warning'] if results[0]['status'] == SEARCHD_ERROR: return None return results[0] def AddQuery (self, query, index='*', comment=''): """ Add query to batch. """ # build request req = [] req.append(pack('>4L', self._offset, self._limit, self._mode, self._ranker)) if self._ranker==SPH_RANK_EXPR: req.append(pack('>L', len(self._rankexpr))) req.append(self._rankexpr) req.append(pack('>L', self._sort)) req.append(pack('>L', len(self._sortby))) req.append(self._sortby) if isinstance(query,unicode): query = query.encode('utf-8') assert(isinstance(query,str)) req.append(pack('>L', len(query))) req.append(query) req.append(pack('>L', len(self._weights))) for w in self._weights: req.append(pack('>L', w)) req.append(pack('>L', len(index))) req.append(index) req.append(pack('>L',1)) # id64 range marker req.append(pack('>Q', self._min_id)) req.append(pack('>Q', self._max_id)) # filters req.append ( pack ( '>L', len(self._filters) ) ) for f in self._filters: req.append ( pack ( '>L', len(f['attr'])) + f['attr']) filtertype = f['type'] req.append ( pack ( '>L', filtertype)) if filtertype == SPH_FILTER_VALUES: req.append ( pack ('>L', len(f['values']))) for val in f['values']: req.append ( pack ('>q', val)) elif filtertype == SPH_FILTER_RANGE: req.append ( pack ('>2q', f['min'], f['max'])) elif filtertype == SPH_FILTER_FLOATRANGE: req.append ( pack ('>2f', f['min'], f['max'])) req.append ( pack ( '>L', f['exclude'] ) ) # group-by, max-matches, group-sort req.append ( pack ( '>2L', self._groupfunc, len(self._groupby) ) ) req.append ( self._groupby ) req.append ( pack ( '>2L', self._maxmatches, len(self._groupsort) ) ) req.append ( self._groupsort ) req.append ( pack ( '>LLL', self._cutoff, self._retrycount, self._retrydelay)) req.append ( pack ( '>L', len(self._groupdistinct))) req.append ( self._groupdistinct) # anchor point if len(self._anchor) == 0: req.append ( pack ('>L', 0)) else: attrlat, attrlong = self._anchor['attrlat'], self._anchor['attrlong'] latitude, longitude = self._anchor['lat'], self._anchor['long'] req.append ( pack ('>L', 1)) req.append ( pack ('>L', len(attrlat)) + attrlat) req.append ( pack ('>L', len(attrlong)) + attrlong) req.append ( pack ('>f', latitude) + pack ('>f', longitude)) # per-index weights req.append ( pack ('>L',len(self._indexweights))) for indx,weight in self._indexweights.items(): req.append ( pack ('>L',len(indx)) + indx + pack ('>L',weight)) # max query time req.append ( pack ('>L', self._maxquerytime) ) # per-field weights req.append ( pack ('>L',len(self._fieldweights) ) ) for field,weight in self._fieldweights.items(): req.append ( pack ('>L',len(field)) + field + pack ('>L',weight) ) # comment req.append ( pack('>L',len(comment)) + comment ) # attribute overrides req.append ( pack('>L', len(self._overrides)) ) for v in self._overrides.values(): req.extend ( ( pack('>L', len(v['name'])), v['name'] ) ) req.append ( pack('>LL', v['type'], len(v['values'])) ) for id, value in v['values'].iteritems(): req.append ( pack('>Q', id) ) if v['type'] == SPH_ATTR_FLOAT: req.append ( pack('>f', value) ) elif v['type'] == SPH_ATTR_BIGINT: req.append ( pack('>q', value) ) else: req.append ( pack('>l', value) ) # select-list req.append ( pack('>L', len(self._select)) ) req.append ( self._select ) # send query, get response req = ''.join(req) self._reqs.append(req) return def RunQueries (self): """ Run queries batch. Returns None on network IO failure; or an array of result set hashes on success. """ if len(self._reqs)==0: self._error = 'no queries defined, issue AddQuery() first' return None sock = self._Connect() if not sock: return None req = ''.join(self._reqs) length = len(req)+8 req = pack('>HHLLL', SEARCHD_COMMAND_SEARCH, VER_COMMAND_SEARCH, length, 0, len(self._reqs))+req sock.send(req) response = self._GetResponse(sock, VER_COMMAND_SEARCH) if not response: return None nreqs = len(self._reqs) # parse response max_ = len(response) p = 0 results = [] for i in range(0,nreqs,1): result = {} results.append(result) result['error'] = '' result['warning'] = '' status = unpack('>L', response[p:p+4])[0] p += 4 result['status'] = status if status != SEARCHD_OK: length = unpack('>L', response[p:p+4])[0] p += 4 message = response[p:p+length] p += length if status == SEARCHD_WARNING: result['warning'] = message else: result['error'] = message continue # read schema fields = [] attrs = [] nfields = unpack('>L', response[p:p+4])[0] p += 4 while nfields>0 and pL', response[p:p+4])[0] p += 4 fields.append(response[p:p+length]) p += length result['fields'] = fields nattrs = unpack('>L', response[p:p+4])[0] p += 4 while nattrs>0 and pL', response[p:p+4])[0] p += 4 attr = response[p:p+length] p += length type_ = unpack('>L', response[p:p+4])[0] p += 4 attrs.append([attr,type_]) result['attrs'] = attrs # read match count count = unpack('>L', response[p:p+4])[0] p += 4 id64 = unpack('>L', response[p:p+4])[0] p += 4 # read matches result['matches'] = [] while count>0 and pQL', response[p:p+12]) p += 12 else: doc, weight = unpack('>2L', response[p:p+8]) p += 8 match = { 'id':doc, 'weight':weight, 'attrs':{} } for i in range(len(attrs)): if attrs[i][1] == SPH_ATTR_FLOAT: match['attrs'][attrs[i][0]] = unpack('>f', response[p:p+4])[0] elif attrs[i][1] == SPH_ATTR_BIGINT: match['attrs'][attrs[i][0]] = unpack('>q', response[p:p+8])[0] p += 4 elif attrs[i][1] == SPH_ATTR_STRING: slen = unpack('>L', response[p:p+4])[0] p += 4 match['attrs'][attrs[i][0]] = '' if slen>0: match['attrs'][attrs[i][0]] = response[p:p+slen] p += slen-4 elif attrs[i][1] == SPH_ATTR_MULTI: match['attrs'][attrs[i][0]] = [] nvals = unpack('>L', response[p:p+4])[0] p += 4 for n in range(0,nvals,1): match['attrs'][attrs[i][0]].append(unpack('>L', response[p:p+4])[0]) p += 4 p -= 4 elif attrs[i][1] == SPH_ATTR_MULTI64: match['attrs'][attrs[i][0]] = [] nvals = unpack('>L', response[p:p+4])[0] nvals = nvals/2 p += 4 for n in range(0,nvals,1): match['attrs'][attrs[i][0]].append(unpack('>q', response[p:p+8])[0]) p += 8 p -= 4 else: match['attrs'][attrs[i][0]] = unpack('>L', response[p:p+4])[0] p += 4 result['matches'].append ( match ) result['total'], result['total_found'], result['time'], words = unpack('>4L', response[p:p+16]) result['time'] = '%.3f' % (result['time']/1000.0) p += 16 result['words'] = [] while words>0: words -= 1 length = unpack('>L', response[p:p+4])[0] p += 4 word = response[p:p+length] p += length docs, hits = unpack('>2L', response[p:p+8]) p += 8 result['words'].append({'word':word, 'docs':docs, 'hits':hits}) self._reqs = [] return results def BuildExcerpts (self, docs, index, words, opts=None): """ Connect to searchd server and generate exceprts from given documents. """ if not opts: opts = {} if isinstance(words,unicode): words = words.encode('utf-8') assert(isinstance(docs, list)) assert(isinstance(index, str)) assert(isinstance(words, str)) assert(isinstance(opts, dict)) sock = self._Connect() if not sock: return None # fixup options opts.setdefault('before_match', '') opts.setdefault('after_match', '') opts.setdefault('chunk_separator', ' ... ') opts.setdefault('html_strip_mode', 'index') opts.setdefault('limit', 256) opts.setdefault('limit_passages', 0) opts.setdefault('limit_words', 0) opts.setdefault('around', 5) opts.setdefault('start_passage_id', 1) opts.setdefault('passage_boundary', 'none') # build request # v.1.0 req flags = 1 # (remove spaces) if opts.get('exact_phrase'): flags |= 2 if opts.get('single_passage'): flags |= 4 if opts.get('use_boundaries'): flags |= 8 if opts.get('weight_order'): flags |= 16 if opts.get('query_mode'): flags |= 32 if opts.get('force_all_words'): flags |= 64 if opts.get('load_files'): flags |= 128 if opts.get('allow_empty'): flags |= 256 if opts.get('emit_zones'): flags |= 256 # mode=0, flags req = [pack('>2L', 0, flags)] # req index req.append(pack('>L', len(index))) req.append(index) # req words req.append(pack('>L', len(words))) req.append(words) # options req.append(pack('>L', len(opts['before_match']))) req.append(opts['before_match']) req.append(pack('>L', len(opts['after_match']))) req.append(opts['after_match']) req.append(pack('>L', len(opts['chunk_separator']))) req.append(opts['chunk_separator']) req.append(pack('>L', int(opts['limit']))) req.append(pack('>L', int(opts['around']))) req.append(pack('>L', int(opts['limit_passages']))) req.append(pack('>L', int(opts['limit_words']))) req.append(pack('>L', int(opts['start_passage_id']))) req.append(pack('>L', len(opts['html_strip_mode']))) req.append((opts['html_strip_mode'])) req.append(pack('>L', len(opts['passage_boundary']))) req.append((opts['passage_boundary'])) # documents req.append(pack('>L', len(docs))) for doc in docs: if isinstance(doc,unicode): doc = doc.encode('utf-8') assert(isinstance(doc, str)) req.append(pack('>L', len(doc))) req.append(doc) req = ''.join(req) # send query, get response length = len(req) # add header req = pack('>2HL', SEARCHD_COMMAND_EXCERPT, VER_COMMAND_EXCERPT, length)+req wrote = sock.send(req) response = self._GetResponse(sock, VER_COMMAND_EXCERPT ) if not response: return [] # parse response pos = 0 res = [] rlen = len(response) for i in range(len(docs)): length = unpack('>L', response[pos:pos+4])[0] pos += 4 if pos+length > rlen: self._error = 'incomplete reply' return [] res.append(response[pos:pos+length]) pos += length return res def UpdateAttributes ( self, index, attrs, values, mva=False ): """ Update given attribute values on given documents in given indexes. Returns amount of updated documents (0 or more) on success, or -1 on failure. 'attrs' must be a list of strings. 'values' must be a dict with int key (document ID) and list of int values (new attribute values). optional boolean parameter 'mva' points that there is update of MVA attributes. In this case the 'values' must be a dict with int key (document ID) and list of lists of int values (new MVA attribute values). Example: res = cl.UpdateAttributes ( 'test1', [ 'group_id', 'date_added' ], { 2:[123,1000000000], 4:[456,1234567890] } ) """ assert ( isinstance ( index, str ) ) assert ( isinstance ( attrs, list ) ) assert ( isinstance ( values, dict ) ) for attr in attrs: assert ( isinstance ( attr, str ) ) for docid, entry in values.items(): AssertUInt32(docid) assert ( isinstance ( entry, list ) ) assert ( len(attrs)==len(entry) ) for val in entry: if mva: assert ( isinstance ( val, list ) ) for vals in val: AssertInt32(vals) else: AssertInt32(val) # build request req = [ pack('>L',len(index)), index ] req.append ( pack('>L',len(attrs)) ) mva_attr = 0 if mva: mva_attr = 1 for attr in attrs: req.append ( pack('>L',len(attr)) + attr ) req.append ( pack('>L', mva_attr ) ) req.append ( pack('>L',len(values)) ) for docid, entry in values.items(): req.append ( pack('>Q',docid) ) for val in entry: val_len = val if mva: val_len = len ( val ) req.append ( pack('>L',val_len ) ) if mva: for vals in val: req.append ( pack ('>L',vals) ) # connect, send query, get response sock = self._Connect() if not sock: return None req = ''.join(req) length = len(req) req = pack ( '>2HL', SEARCHD_COMMAND_UPDATE, VER_COMMAND_UPDATE, length ) + req wrote = sock.send ( req ) response = self._GetResponse ( sock, VER_COMMAND_UPDATE ) if not response: return -1 # parse response updated = unpack ( '>L', response[0:4] )[0] return updated def BuildKeywords ( self, query, index, hits ): """ Connect to searchd server, and generate keywords list for a given query. Returns None on failure, or a list of keywords on success. """ assert ( isinstance ( query, str ) ) assert ( isinstance ( index, str ) ) assert ( isinstance ( hits, int ) ) # build request req = [ pack ( '>L', len(query) ) + query ] req.append ( pack ( '>L', len(index) ) + index ) req.append ( pack ( '>L', hits ) ) # connect, send query, get response sock = self._Connect() if not sock: return None req = ''.join(req) length = len(req) req = pack ( '>2HL', SEARCHD_COMMAND_KEYWORDS, VER_COMMAND_KEYWORDS, length ) + req wrote = sock.send ( req ) response = self._GetResponse ( sock, VER_COMMAND_KEYWORDS ) if not response: return None # parse response res = [] nwords = unpack ( '>L', response[0:4] )[0] p = 4 max_ = len(response) while nwords>0 and pL', response[p:p+4] )[0] p += 4 tokenized = response[p:p+length] p += length length = unpack ( '>L', response[p:p+4] )[0] p += 4 normalized = response[p:p+length] p += length entry = { 'tokenized':tokenized, 'normalized':normalized } if hits: entry['docs'], entry['hits'] = unpack ( '>2L', response[p:p+8] ) p += 8 res.append ( entry ) if nwords>0 or p>max_: self._error = 'incomplete reply' return None return res def Status ( self ): """ Get the status """ # connect, send query, get response sock = self._Connect() if not sock: return None req = pack ( '>2HLL', SEARCHD_COMMAND_STATUS, VER_COMMAND_STATUS, 4, 1 ) wrote = sock.send ( req ) response = self._GetResponse ( sock, VER_COMMAND_STATUS ) if not response: return None # parse response res = [] p = 8 max_ = len(response) while pL', response[p:p+4] )[0] k = response[p+4:p+length+4] p += 4+length length = unpack ( '>L', response[p:p+4] )[0] v = response[p+4:p+length+4] p += 4+length res += [[k, v]] return res ### persistent connections def Open(self): if self._socket: self._error = 'already connected' return None server = self._Connect() if not server: return None # command, command version = 0, body length = 4, body = 1 request = pack ( '>hhII', SEARCHD_COMMAND_PERSIST, 0, 4, 1 ) server.send ( request ) self._socket = server return True def Close(self): if not self._socket: self._error = 'not connected' return self._socket.close() self._socket = None def EscapeString(self, string): return re.sub(r"([=\(\)|\-!@~\"&/\\\^\$\=])", r"\\\1", string) def FlushAttributes(self): sock = self._Connect() if not sock: return -1 request = pack ( '>hhI', SEARCHD_COMMAND_FLUSHATTRS, VER_COMMAND_FLUSHATTRS, 0 ) # cmd, ver, bodylen sock.send ( request ) response = self._GetResponse ( sock, VER_COMMAND_FLUSHATTRS ) if not response or len(response)!=4: self._error = 'unexpected response length' return -1 tag = unpack ( '>L', response[0:4] )[0] return tag def AssertInt32 ( value ): assert(isinstance(value, (int, long))) assert(value>=-2**32-1 and value<=2**32-1) def AssertUInt32 ( value ): assert(isinstance(value, (int, long))) assert(value>=0 and value<=2**32-1) # # $Id$ # coreseek-4.1-beta/csft-4.1/api/test.php100777 0 0 13037 11643565730 12744 0\tconnect to searchd at host HOST\n" ); print ( "-p, --port\t\tconnect to searchd at port PORT\n" ); print ( "-i, --index \tsearch through index(es) specified by IDX\n" ); print ( "-s, --sortby \tsort matches by 'CLAUSE' in sort_extended mode\n" ); print ( "-S, --sortexpr \tsort matches by 'EXPR' DESC in sort_expr mode\n" ); print ( "-a, --any\t\tuse 'match any word' matching mode\n" ); print ( "-b, --boolean\t\tuse 'boolean query' matching mode\n" ); print ( "-e, --extended\t\tuse 'extended query' matching mode\n" ); print ( "-ph,--phrase\t\tuse 'exact phrase' matching mode\n" ); print ( "-f, --filter \tfilter by attribute 'ATTR' (default is 'group_id')\n" ); print ( "-fr,--filterrange \n\t\t\tadd specified range filter\n" ); print ( "-v, --value \tadd VAL to allowed 'group_id' values list\n" ); print ( "-g, --groupby \tgroup matches by 'EXPR'\n" ); print ( "-gs,--groupsort \tsort groups by 'EXPR'\n" ); print ( "-d, --distinct \tcount distinct values of 'ATTR''\n" ); print ( "-l, --limit \tretrieve COUNT matches (default: 20)\n" ); print ( "--select \tuse 'EXPRLIST' as select-list (default: *)\n" ); exit; } $args = array(); foreach ( $_SERVER["argv"] as $arg ) $args[] = $arg; $cl = new SphinxClient (); $q = ""; $sql = ""; $mode = SPH_MATCH_ALL; $host = "localhost"; $port = 9312; $index = "*"; $groupby = ""; $groupsort = "@group desc"; $filter = "group_id"; $filtervals = array(); $distinct = ""; $sortby = ""; $sortexpr = ""; $limit = 20; $ranker = SPH_RANK_PROXIMITY_BM25; $select = ""; for ( $i=0; $iSetFilterRange ( $args[++$i], $args[++$i], $args[++$i] ); else if ( $arg=="-r" ) { $arg = strtolower($args[++$i]); if ( $arg=="bm25" ) $ranker = SPH_RANK_BM25; if ( $arg=="none" ) $ranker = SPH_RANK_NONE; if ( $arg=="wordcount" )$ranker = SPH_RANK_WORDCOUNT; if ( $arg=="fieldmask" )$ranker = SPH_RANK_FIELDMASK; if ( $arg=="sph04" ) $ranker = SPH_RANK_SPH04; } else $q .= $args[$i] . " "; } //////////// // do query //////////// $cl->SetServer ( $host, $port ); $cl->SetConnectTimeout ( 1 ); $cl->SetArrayResult ( true ); $cl->SetWeights ( array ( 100, 1 ) ); $cl->SetMatchMode ( $mode ); if ( count($filtervals) ) $cl->SetFilter ( $filter, $filtervals ); if ( $groupby ) $cl->SetGroupBy ( $groupby, SPH_GROUPBY_ATTR, $groupsort ); if ( $sortby ) $cl->SetSortMode ( SPH_SORT_EXTENDED, $sortby ); if ( $sortexpr ) $cl->SetSortMode ( SPH_SORT_EXPR, $sortexpr ); if ( $distinct ) $cl->SetGroupDistinct ( $distinct ); if ( $select ) $cl->SetSelect ( $select ); if ( $limit ) $cl->SetLimits ( 0, $limit, ( $limit>1000 ) ? $limit : 1000 ); $cl->SetRankingMode ( $ranker ); $res = $cl->Query ( $q, $index ); //////////////// // print me out //////////////// if ( $res===false ) { print "Query failed: " . $cl->GetLastError() . ".\n"; } else { if ( $cl->GetLastWarning() ) print "WARNING: " . $cl->GetLastWarning() . "\n\n"; print "Query '$q' retrieved $res[total] of $res[total_found] matches in $res[time] sec.\n"; print "Query stats:\n"; if ( is_array($res["words"]) ) foreach ( $res["words"] as $word => $info ) print " '$word' found $info[hits] times in $info[docs] documents\n"; print "\n"; if ( is_array($res["matches"]) ) { $n = 1; print "Matches:\n"; foreach ( $res["matches"] as $docinfo ) { print "$n. doc_id=$docinfo[id], weight=$docinfo[weight]"; foreach ( $res["attrs"] as $attrname => $attrtype ) { $value = $docinfo["attrs"][$attrname]; if ( $attrtype==SPH_ATTR_MULTI || $attrtype==SPH_ATTR_MULTI64 ) { $value = "(" . join ( ",", $value ) .")"; } else { if ( $attrtype==SPH_ATTR_TIMESTAMP ) $value = date ( "Y-m-d H:i:s", $value ); } print ", $attrname=$value"; } print "\n"; $n++; } } } // // $Id$ // ?>coreseek-4.1-beta/csft-4.1/api/test.py100777 0 0 6255 11643565730 12571 0# # $Id$ # from sphinxapi import * import sys, time if not sys.argv[1:]: print "Usage: python test.py [OPTIONS] query words\n" print "Options are:" print "-h, --host \tconnect to searchd at host HOST" print "-p, --port\t\tconnect to searchd at port PORT" print "-i, --index \tsearch through index(es) specified by IDX" print "-s, --sortby \tsort matches by 'EXPR'" print "-a, --any\t\tuse 'match any word' matching mode" print "-b, --boolean\t\tuse 'boolean query' matching mode" print "-e, --extended\t\tuse 'extended query' matching mode" print "-f, --filter \tfilter by attribute 'ATTR' (default is 'group_id')" print "-v, --value \tadd VAL to allowed 'group_id' values list" print "-g, --groupby \tgroup matches by 'EXPR'" print "-gs,--groupsort \tsort groups by 'EXPR'" print "-l, --limit \tretrieve COUNT matches (default is 20)" sys.exit(0) q = '' mode = SPH_MATCH_ALL host = 'localhost' port = 9312 index = '*' filtercol = 'group_id' filtervals = [] sortby = '' groupby = '' groupsort = '@group desc' limit = 0 i = 1 while (i "", "after_match" => "", "chunk_separator" => " ... ", "limit" => 60, "around" => 3, ); foreach ( array(0,1) as $exact ) { $opts["exact_phrase"] = $exact; print "exact_phrase=$exact\n"; $cl = new SphinxClient (); $res = $cl->BuildExcerpts ( $docs, $index, $words, $opts ); if ( !$res ) { die ( "ERROR: " . $cl->GetLastError() . ".\n" ); } else { $n = 0; foreach ( $res as $entry ) { $n++; print "n=$n, res=$entry\n"; } print "\n"; } } // // $Id$ // ?>coreseek-4.1-beta/csft-4.1/api/test2.py100777 0 0 755 11643565730 12632 0# # $Id$ # from sphinxapi import * import sys docs = ['this is my test text to be highlighted','this is another test text to be highlighted'] words = 'test text' index = 'test1' opts = {'before_match':'', 'after_match':'', 'chunk_separator':' ... ', 'limit':400, 'around':15} cl = SphinxClient() res = cl.BuildExcerpts(docs, index, words, opts) if not res: print 'ERROR:', cl.GetLastError() else: n = 0 for entry in res: n += 1 print 'n=%d, res=%s' % (n, entry) # # $Id$ # coreseek-4.1-beta/csft-4.1/buildconf.sh100777 0 0 112 11643565730 12732 0#! /bin/sh autoheader \ && aclocal \ && automake --foreign \ && autoconf coreseek-4.1-beta/csft-4.1/codeblocks/ 40777 0 0 0 11647303453 12463 5coreseek-4.1-beta/csft-4.1/codeblocks/indexer.cbp100777 0 0 4112 11643565730 14711 0 coreseek-4.1-beta/csft-4.1/codeblocks/indextool.cbp100777 0 0 3754 11643565731 15274 0 coreseek-4.1-beta/csft-4.1/codeblocks/libsphinx.cbp100777 0 0 5745 11643565731 15271 0 coreseek-4.1-beta/csft-4.1/codeblocks/README.txt100777 0 0 111 11643565730 14236 0You need to run ../configure script in order to use Code::Blocks projectscoreseek-4.1-beta/csft-4.1/codeblocks/search.cbp100777 0 0 3740 11643565731 14527 0 coreseek-4.1-beta/csft-4.1/codeblocks/searchd.cbp100777 0 0 6743 11643565731 14701 0 coreseek-4.1-beta/csft-4.1/codeblocks/spelldump.cbp100777 0 0 3754 11643565731 15274 0 coreseek-4.1-beta/csft-4.1/codeblocks/testrt.cbp100777 0 0 3736 11643565731 14614 0 coreseek-4.1-beta/csft-4.1/codeblocks/tests.cbp100777 0 0 3734 11643565731 14427 0 coreseek-4.1-beta/csft-4.1/config/ 40777 0 0 0 11647307534 11624 5coreseek-4.1-beta/csft-4.1/configure.ac100777 0 0 37505 11643565731 13000 0dnl Process this file with autoconf to produce a configure script. AC_PREREQ(2.59) AC_INIT([sphinx], [1.11], [shodan(at)shodan.ru]) m4_include([python.m4]) dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([checking build environment]) AC_CONFIG_AUX_DIR([config]) AM_INIT_AUTOMAKE([-Wall -Werror foreign]) AM_MAINTAINER_MODE AM_PATH_PYTHON AC_CONFIG_SRCDIR([src/searchd.cpp]) AC_CONFIG_HEADER([config/config.h]) # hack to locate expat/iconv in /usr/local on BSD systems CPPFLAGS="$CPPFLAGS -I/usr/local/include" LIBS="$LIBS -L/usr/local/lib" dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([checking for compiler programs]) AC_ARG_WITH([debug], AC_HELP_STRING([--with-debug], [compile slower debug version (default is disabled)]), [ac_cv_use_debug=$withval], [ac_cv_use_debug=no] ) AC_MSG_CHECKING([whether to compile debug version]) if test x$ac_cv_use_debug != xno; then SPHINX_CFLAGS="-Wall -g -D_FILE_OFFSET_BITS=64" SPHINX_INJECT_FLAGS="-D_FILE_OFFSET_BITS=64" AC_MSG_RESULT([yes]) else SPHINX_CFLAGS="-Wall -g -D_FILE_OFFSET_BITS=64 -O3 -DNDEBUG" SPHINX_INJECT_FLAGS="-D_FILE_OFFSET_BITS=64 -DNDEBUG" AC_MSG_RESULT([no]) fi dnl set flags for C compiler if there are no user overrides dnl inject required defines if there are if test x$ac_env_CFLAGS_set != xset; then CFLAGS=$SPHINX_CFLAGS else CFLAGS="$CFLAGS $SPHINX_INJECT_FLAGS" fi dnl set flags for C++ compiler if there are no user overrides dnl inject required defines if there are if test x$ac_env_CXXFLAGS_set != xset; then CXXFLAGS=$SPHINX_CFLAGS else CXXFLAGS="$CXXFLAGS $SPHINX_INJECT_FLAGS" fi AC_PROG_CC AC_PROG_CXX AC_PROG_RANLIB dnl Checks for embedded interpretors. INN_ARG_PYTHON AC_COMPILE_IFELSE([ #ifdef __GNUC__ #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3) void main() {} #else syntax error #endif #endif ], [], [AC_MSG_ERROR([Gcc version error. Minspec is 3.4])]) AC_DEFINE_UNQUOTED([COMPILER],"$CC `$CC -dumpversion`",[Define to be the name of the compiler.]) AC_DEFINE_UNQUOTED([OS_UNAME],"`uname -a`",[Full name OS]) dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([checking for header files]) # Checks for header files. AC_HEADER_STDC AC_HEADER_SYS_WAIT AC_CHECK_HEADERS([fcntl.h limits.h netdb.h netinet/in.h stdlib.h string.h sys/file.h sys/socket.h sys/time.h unistd.h pthread.h execinfo.h]) AC_CHECK_HEADER(expat.h,[have_expat_h=yes],[have_expat_h=no]) AC_CHECK_HEADER(iconv.h,[have_iconv_h=yes],[have_iconv_h=no]) AC_CHECK_HEADER(zlib.h,[have_zlib_h=yes],[have_zlib_h=no]) AC_CHECK_HEADER(sql.h,[have_sql_h=yes],[have_sql_h=no]) AC_CHECK_HEADER(syslog.h,[have_syslog_h=yes],[have_syslog_h=no]) dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([checking for types]) # Checks for typedefs, structures, and compiler characteristics. AC_HEADER_STDBOOL AC_C_CONST AC_C_INLINE AC_TYPE_OFF_T AC_TYPE_SIZE_T AC_HEADER_TIME dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([checking for library functions]) # Checks for library functions. AC_FUNC_FORK AC_FUNC_MALLOC AC_FUNC_REALLOC AC_FUNC_SELECT_ARGTYPES AC_TYPE_SIGNAL AC_FUNC_STAT AC_FUNC_VPRINTF AC_SEARCH_LIBS([setsockopt],[socket]) AC_SEARCH_LIBS([gethostbyname],[nsl socket resolv]) AC_SEARCH_LIBS([XML_Parse],[expat],[have_libexpat=yes],[have_libexpat=no]) AC_SEARCH_LIBS([iconv],[iconv],[have_libiconv=yes],[have_libiconv=no]) AC_SEARCH_LIBS([inflate],[z],[have_lz=yes],[have_lz=no]) AC_SEARCH_LIBS([logf],[m]) AC_CHECK_FUNCS([dup2 gethostbyname gettimeofday memmove memset select socket strcasecmp strchr strerror strncasecmp strstr strtol logf pread]) AC_CHECK_FUNCS([backtrace backtrace_symbols]) # most systems require the program be linked with librt library to use # the function clock_gettime my_save_LIBS="$LIBS" LIBS="" AC_CHECK_LIB(rt,clock_gettime) LIBRT=$LIBS LIBS="$my_save_LIBS" AC_SUBST(LIBRT) LIBS="$LIBS $LIBRT" AC_CHECK_FUNCS(clock_gettime) SPHINX_CHECK_DEFINE(LOCK_EX,sys/file.h) SPHINX_CHECK_DEFINE(F_SETLKW,fcntl.h) # check for dlopen # FIXME! technically, only needed in searchd # but as UDF manager is curently in libsphinx, we link everything AC_CHECK_LIB(dl,dlopen) AC_CHECK_FUNCS(dlopen dlerror) dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([configuring Sphinx]) dnl --- # check for pthreads dnl helper that runs a test program and checks for success pthread_prog=" #include #include void * thread_routine ( void * data ) { return data; } int main () { pthread_t thd; pthread_mutexattr_t mattr; pthread_once_t once_init = PTHREAD_ONCE_INIT; int data = 1; pthread_mutexattr_init ( &mattr ); return pthread_create ( &thd, NULL, thread_routine, &data ); } " AC_DEFUN([PTHREADS_TRY_RUNCOMPILE],[ if test x$cross_compiling = xno ; then AC_TRY_RUN($pthread_prog, [pthreads_try_run=yes], [pthreads_try_run=no], [pthreads_try_run=no]) if test x$pthreads_try_run = xyes ; then $1 fi else AC_COMPILE_IFELSE($pthread_prog, [pthreads_try_compile=yes], [pthreads_try_compile=no], [pthreads_try_compile=no]) if test x$pthreads_try_compile = xyes ; then $1 fi fi ]) AC_DEFUN([PTHREADS_TRY_RUNLINK],[ if test x$cross_compiling = xno ; then AC_TRY_RUN($pthread_prog, [pthreads_try_run=yes], [pthreads_try_run=no], [pthreads_try_run=no]) if test x$pthreads_try_run = xyes ; then $1 fi else AC_LINK_IFELSE($pthread_prog, [pthreads_try_link=yes], [pthreads_try_link=no], [pthreads_try_link=no]) if test x$pthreads_try_link = xyes ; then $1 fi fi ]) # check for needed cflags AC_CACHE_CHECK([for CFLAGS needed for pthreads], [sphinx_cv_pthreads_cflags], [ save_cflags=$CFLAGS for flag in none -kthread -pthread -pthreads -mt -mthreads -Kthread -threads; do CFLAGS=$save_cflags test "x$flag" != "xnone" && CFLAGS="$CFLAGS $flag" PTHREADS_TRY_RUNCOMPILE([ sphinx_cv_pthreads_cflags="$flag" break ]) done CFLAGS=$save_cflags ]) if test -n "$sphinx_cv_pthreads_cflags"; then have_pthreads=yes if test "x$sphinx_cv_pthreads_cflags" != "xnone"; then CPPFLAGS="$CPPFLAGS $sphinx_cv_pthreads_cflags" fi fi # check for needed libs AC_CACHE_CHECK([for LIBS needed for pthreads], [sphinx_cv_pthreads_libs], [ save_libs=$LIBS for lib in -lpthread -lpthreads -lc_r; do LIBS="$save_libs $lib" PTHREADS_TRY_RUNLINK([ sphinx_cv_pthreads_libs=$lib break ]) done LIBS=$save_libs ]) if test -n "$sphinx_cv_pthreads_libs"; then have_pthreads=yes LIBS="$LIBS $sphinx_cv_pthreads_libs" fi # final check AC_MSG_CHECKING([for pthreads]) if test x$have_pthreads = xyes; then if test x$cross_compiling = xno; then AC_MSG_RESULT([found]) else AC_MSG_RESULT([assumed as found (cross-compiling)]) fi else AC_MSG_ERROR([no working pthreads library found]) fi AC_CHECK_FUNCS([pthread_mutex_timedlock]) dnl --- # check if we should compile with MySQL support AC_ARG_WITH([mysql], AC_HELP_STRING([--with-mysql], [compile with MySQL support (default is enabled)]), [ac_cv_use_mysql=$withval], [ac_cv_use_mysql=yes] ) AC_MSG_CHECKING([whether to compile with MySQL support]) if test x$ac_cv_use_mysql != xno; then AC_MSG_RESULT([yes]) AC_CHECK_MYSQL([$ac_cv_use_mysql]) AC_DEFINE(USE_MYSQL,1,[Define to 1 if you want to compile with MySQL support]) AC_SUBST([MYSQL_LIBS]) AC_SUBST([MYSQL_CFLAGS]) else AC_MSG_RESULT([no]) fi AM_CONDITIONAL(USE_MYSQL, test x$ac_cv_use_mysql != xno) # check if we should statically link the mysql library AC_ARG_WITH([static-mysql], AC_HELP_STRING([--with-static-mysql], [link statically with MySQL library (default is no)]), [ac_cv_use_static_mysql=$withval], [ac_cv_use_static_mysql=no] ) AC_MSG_CHECKING([whether to link statically with MySQL support]) if test x$ac_cv_use_mysql != xno; then if test x$ac_cv_use_static_mysql != xno; then AC_CHECK_MYSQL([$ac_cv_use_static_mysql]) MYSQL_LIBS=`echo $MYSQL_LIBS | sed -e 's/\-Bdynamic/\-Bstatic/g'` MYSQL_LIBS="-Wl,-Bstatic $MYSQL_LIBS -Wl,-Bdynamic" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi fi # check if we should compile with PostgreSQL support AC_ARG_WITH([pgsql], AC_HELP_STRING([--with-pgsql], [compile with PostgreSQL support (default is disabled)]), [ac_cv_use_pgsql=$withval], [ac_cv_use_pgsql=no] ) AC_MSG_CHECKING([whether to compile with PostgreSQL support]) if test x$ac_cv_use_pgsql != xno; then AC_MSG_RESULT([yes]) AC_CHECK_PGSQL([$ac_cv_use_pgsql]) AC_DEFINE(USE_PGSQL,1,[Define to 1 if you want to compile with PostgreSQL support]) AC_SUBST([PGSQL_LIBS]) AC_SUBST([PGSQL_CFLAGS]) else AC_MSG_RESULT([no]) fi AM_CONDITIONAL(USE_PGSQL, test x$ac_cv_use_pgsql != xno) dnl --- # check if we should complie with libmmseg (a mmseg Chinese Segmenter) support AC_ARG_WITH([mmseg], AC_HELP_STRING([--with-mmseg], [compile with libmmseg, a mmseg Chinese Segmenter support (default is enabled)]), [ac_cv_use_mmseg=$withval], [ac_cv_use_mmseg=yes] ) AC_MSG_CHECKING([whether to compile with libmmseg support]) if test x$ac_cv_use_mmseg != xno; then AC_MSG_RESULT([yes]) AC_CHECK_MMSEG([$ac_cv_use_mmseg]) AC_DEFINE(USE_MMSEG,1,[Define to 1 if you want to compile with libmmseg support]) AC_SUBST([MMSEG_LIBS]) AC_SUBST([MMSEG_CFLAGS]) else AC_MSG_RESULT([no]) fi AM_CONDITIONAL(USE_MMSEG, test x$ac_cv_use_mmseg != xno) # add macports include directory if (echo $MYSQL_LIBS | grep -q -- -L/opt/local/lib); then MYSQL_CFLAGS="$MYSQL_CFLAGS -I/opt/local/include" fi # we can now set preprocessor flags for both C and C++ compilers CPPFLAGS="$CPPFLAGS $MYSQL_CFLAGS $PGSQL_CFLAGS $MMSEG_CFLAGS" AM_CONDITIONAL(USE_PYTHON, test x"$USE_PYTHON" = xDO) CPPFLAGS="$CPPFLAGS $PYTHON_CPPFLAGS" LIBS="$LIBS $PYTHON_LIBS" dnl --- AC_MSG_CHECKING([whether to use 64-bit document/word IDs]) sph_enable_id64=no AC_ARG_ENABLE([id64], [ --enable-id64 use 64-bit document and word IDs (default is no)], [sph_enable_id64=$enableval]) if test x$sph_enable_id64 != xno; then AC_DEFINE(USE_64BIT, 1, [64-bit document and word IDs]) AC_MSG_RESULT([yes]) else AC_DEFINE(USE_64BIT, 0, [64-bit document and word IDs]) AC_MSG_RESULT([no]) fi dnl --- AC_ARG_WITH([libstemmer], AC_HELP_STRING([--with-libstemmer], [compile with libstemmer support (default is disabled)]), [ac_cv_use_libstemmer=$withval], [ac_cv_use_libstemmer=no] ) AC_MSG_CHECKING([whether to compile with libstemmer support]) if test x$ac_cv_use_libstemmer != xno; then if test -d libstemmer_c && test -f libstemmer_c/include/libstemmer.h; then AC_MSG_RESULT([yes]) AC_DEFINE(USE_LIBSTEMMER, 1, [libstemmer support]) else AC_MSG_ERROR([missing libstemmer sources from libstemmer_c. Please download the C version of libstemmer library from http://snowball.tartarus.org/ and extract its sources over libstemmer_c/ subdirectory in order to build Sphinx with libstemmer support. ]) fi else AC_MSG_RESULT([no]) AC_DEFINE(USE_LIBSTEMMER, 0, [libstemmer support]) fi AM_CONDITIONAL(USE_LIBSTEMMER, test x$ac_cv_use_libstemmer != xno) dnl --- got_expat=0 AC_MSG_CHECKING([for libexpat]) if test [ $have_expat_h = yes -a $have_libexpat = yes ]; then AC_DEFINE([USE_LIBEXPAT],1,[define to use expat XML library]) AC_MSG_RESULT([found]) got_expat=1 else AC_MSG_RESULT([not found]) AC_MSG_WARN([xmlpipe2 will NOT be available]) fi dnl --- AC_ARG_WITH([iconv], AC_HELP_STRING([--with-iconv], [compile with iconv support (default is autodetect)]), [ac_cv_use_iconv=$withval], [ac_cv_use_iconv=yes] ) AC_MSG_CHECKING([for libiconv]) if test [ $have_iconv_h = yes \ -a $have_libiconv = yes \ -a $got_expat -eq 1 \ -a $ac_cv_use_iconv != no ]; \ then AC_DEFINE([USE_LIBICONV],1,[define to use iconv library]) AC_MSG_RESULT([found]) AC_MSG_CHECKING([for iconv() arg types]) AC_LANG_PUSH([C++]) AC_COMPILE_IFELSE( [AC_LANG_PROGRAM([[ #include #include ]], [const char * inbuf; iconv_t cd; iconv ( cd, &inbuf, NULL, NULL, NULL ); ])], [iconv_inbuf_const=yes], [iconv_inbuf_const=no]) AC_LANG_POP([C++]) if test [ $iconv_inbuf_const = yes ]; then AC_DEFINE([ICONV_INBUF_CONST],1,[whether 2nd arg to iconv() is const ptr]) AC_MSG_RESULT([const char **]) else AC_DEFINE([ICONV_INBUF_CONST],0,[whether 2nd arg to iconv() is const ptr]) AC_MSG_RESULT([char **]) fi else if test [ $got_expat -eq 1 ]; then if test [ $ac_cv_use_iconv = no ]; then AC_MSG_RESULT([disabled]) else AC_MSG_RESULT([not found]) fi AC_MSG_WARN([xmlpipe2 will only support default encodings (latin-1, utf-8)]) else AC_MSG_RESULT([not required]) fi fi dnl --- if test [ $have_zlib_h = yes -a $have_lz = yes ]; then AC_DEFINE([USE_ZLIB],1,[define to use Zlib]) fi dnl --- AC_ARG_WITH([unixodbc], AC_HELP_STRING([--with-unixodbc], [compile with UnixODBC support (default is autodetect)]), [ac_cv_use_unixodbc=$withval], [ac_cv_use_unixodbc=yes] ) AC_MSG_CHECKING([for UnixODBC]) if test [ $ac_cv_use_unixodbc != no ]; then if test [ $have_sql_h = yes ]; then AC_SEARCH_LIBS([SQLConnect],[odbc iodbc],[have_libodbc=yes],[have_libodbc=no]) if test [ $have_libodbc = yes ]; then AC_DEFINE([USE_ODBC],1,[define to use ODBC library]) AC_MSG_RESULT([found]) else AC_MSG_RESULT([not found]) AC_MSG_WARN([ODBC source support will NOT be available]) fi fi else AC_MSG_RESULT([disabled]) fi dnl --- AC_ARG_WITH([syslog], AC_HELP_STRING([--with-syslog], [compile with possibility to use syslog for logging (default is no)]), [ac_cv_use_syslog=$withval], [ac_cv_use_syslog=no] ) AC_MSG_CHECKING([for Syslog]) if test [ $ac_cv_use_syslog != no ]; then if test [ $have_syslog_h = yes ]; then AC_DEFINE([USE_SYSLOG],1,[define to use POSIX Syslog for logging]) AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi else AC_MSG_RESULT([disabled]) fi dnl --- AC_CACHE_CHECK([for unaligned RAM access],[sphinx_cv_unaligned_ram_access],[ AC_LANG_PUSH([C++]) AC_RUN_IFELSE( [AC_LANG_PROGRAM([[ #include #include ]], [[char * sBuf = new char [ 8*sizeof(int) ]; for ( int i=0; i<8*sizeof(int); i++ ) sBuf[i] = i; // check for crashes (SPARC) volatile int iRes = 0; for ( int i=0; i<(int)sizeof(int); i++ ) { int * pPtr = (int*)( sBuf+i ); iRes += *pPtr; } // check for correct values (ARM) iRes = *(int*)( sBuf+1 ); if (!( iRes==0x01020304 || iRes==0x04030201 )) return 1; // all seems ok return 0;]])], [sphinx_cv_unaligned_ram_access=yes], [sphinx_cv_unaligned_ram_access=no], [AC_MSG_RESULT([unknown (cross-compiling), assume no]) sphinx_cv_unaligned_ram_access=no]) ]) if test x$sphinx_cv_unaligned_ram_access = xyes ; then AC_DEFINE([UNALIGNED_RAM_ACCESS],1,[whether unaligned RAM access is possible]) else AC_DEFINE([UNALIGNED_RAM_ACCESS],0) fi # check endianness AC_C_BIGENDIAN( AC_DEFINE(USE_LITTLE_ENDIAN, 0, [big-endian]), AC_DEFINE(USE_LITTLE_ENDIAN, 1, [little-endian]), AC_MSG_ERROR(unknown endianess not supported), AC_MSG_ERROR(universial endianess not supported) ) dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([generating configuration files]) if test "$prefix" = "NONE"; then my_op_prefix="/var" else my_op_prefix="$localstatedir" fi CONFDIR=`eval echo "${my_op_prefix}"` AC_SUBST(CONFDIR) AC_CONFIG_FILES([Makefile src/Makefile libstemmer_c/Makefile doc/Makefile sphinx.conf.dist:sphinx.conf.in \ sphinx-min.conf.dist:sphinx-min.conf.in]) AC_OUTPUT dnl -------------------------------------------------------------------------- SPHINX_CONFIGURE_PART([configuration done]) echo "You can now run 'make install' to build and install Sphinx binaries." echo "On a multi-core machine, try 'make -j4 install' to speed up the build." echo echo "Updates, articles, help forum, and commercial support, consulting, training," echo "and development services are available at http://sphinxsearch.com/" echo echo "Thank you for choosing Sphinx!" echo coreseek-4.1-beta/csft-4.1/config/depcomp100777 0 0 37100 11620775670 13320 0#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2005-07-09.11 # Copyright (C) 1999, 2000, 2003, 2004, 2005 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, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # 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 outputing dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi 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. "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> $depfile echo >> $depfile # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> $depfile else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. stripped=`echo "$object" | sed 's/\(.*\)\..*$/\1/'` tmpdepfile="$stripped.u" if test "$libtool" = yes; then "$@" -Wc,-M else "$@" -M fi stat=$? if test -f "$tmpdepfile"; then : else stripped=`echo "$stripped" | sed 's,^.*/,,'` tmpdepfile="$stripped.u" fi if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi if test -f "$tmpdepfile"; then outname="$stripped.o" # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^$outname:,$object :," < "$tmpdepfile" > "$depfile" sed -e "s,^$outname: \(.*\)$,\1:," < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mecanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; #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 $1 != '--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # X makedepend shift cleared=no for arg in "$@"; do case $cleared in no) set ""; shift cleared=yes ;; esac 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. -*|$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" cat < "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test $1 != '--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, regardless of -o, # because we must use -o when running libtool. "$@" || exit $? IFS=" " for arg do case "$arg" in "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::echo "`cygpath -u \\"\1\\"`":p' | sort | uniq > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; 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-end: "$" # End: coreseek-4.1-beta/csft-4.1/config/install-sh100777 0 0 22021 11620775670 13743 0#!/bin/sh # install - install a program, script, or datafile scriptversion=2005-05-14.22 # 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. It can only install one file at a time, a restriction # shared with many OS's install programs. # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit="${DOITPROG-}" # put in absolute paths if you don't have them in your path; or use env. vars. mvprog="${MVPROG-mv}" cpprog="${CPPROG-cp}" chmodprog="${CHMODPROG-chmod}" chownprog="${CHOWNPROG-chown}" chgrpprog="${CHGRPPROG-chgrp}" stripprog="${STRIPPROG-strip}" rmprog="${RMPROG-rm}" mkdirprog="${MKDIRPROG-mkdir}" chmodcmd="$chmodprog 0755" chowncmd= chgrpcmd= stripcmd= rmcmd="$rmprog -f" mvcmd="$mvprog" src= dst= dir_arg= dstarg= 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: -c (ignored) -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. --help display this help and exit. --version display version info and exit. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test -n "$1"; do case $1 in -c) shift continue;; -d) dir_arg=true shift continue;; -g) chgrpcmd="$chgrpprog $2" shift shift continue;; --help) echo "$usage"; exit $?;; -m) chmodcmd="$chmodprog $2" shift shift continue;; -o) chowncmd="$chownprog $2" shift shift continue;; -s) stripcmd=$stripprog shift continue;; -t) dstarg=$2 shift shift continue;; -T) no_target_directory=true shift continue;; --version) echo "$0 $scriptversion"; exit $?;; *) # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. test -n "$dir_arg$dstarg" && break # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dstarg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dstarg" shift # fnord fi shift # arg dstarg=$arg done break;; esac done if test -z "$1"; 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 for src do # Protect names starting with `-'. case $src in -*) src=./$src ;; esac if test -n "$dir_arg"; then dst=$src src= if test -d "$dst"; then mkdircmd=: chmodcmd= else mkdircmd=$mkdirprog fi 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 "$dstarg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dstarg # Protect names starting with `-'. case $dst in -*) dst=./$dst ;; esac # 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: $dstarg: Is a directory" >&2 exit 1 fi dst=$dst/`basename "$src"` fi fi # This sed command emulates the dirname command. dstdir=`echo "$dst" | sed -e 's,/*$,,;s,[^/]*$,,;s,/*$,,;s,^$,.,'` # Make sure that the destination directory exists. # Skip lots of stat calls in the usual case. if test ! -d "$dstdir"; then defaultIFS=' ' IFS="${IFS-$defaultIFS}" oIFS=$IFS # Some sh's can't handle IFS=/ for some reason. IFS='%' set x `echo "$dstdir" | sed -e 's@/@%@g' -e 's@^%@/@'` shift IFS=$oIFS pathcomp= while test $# -ne 0 ; do pathcomp=$pathcomp$1 shift if test ! -d "$pathcomp"; then $mkdirprog "$pathcomp" # mkdir can fail with a `File exist' error in case several # install-sh are creating the directory concurrently. This # is OK. test -d "$pathcomp" || exit fi pathcomp=$pathcomp/ done fi if test -n "$dir_arg"; then $doit $mkdircmd "$dst" \ && { test -z "$chowncmd" || $doit $chowncmd "$dst"; } \ && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } \ && { test -z "$stripcmd" || $doit $stripcmd "$dst"; } \ && { test -z "$chmodcmd" || $doit $chmodcmd "$dst"; } else dstfile=`basename "$dst"` # 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 trap '(exit $?); exit' 1 2 13 15 # Copy the file name to the temp name. $doit $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 "$dsttmp"; } && # Now rename the file to the real destination. { $doit $mvcmd -f "$dsttmp" "$dstdir/$dstfile" 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. { if test -f "$dstdir/$dstfile"; then $doit $rmcmd -f "$dstdir/$dstfile" 2>/dev/null \ || $doit $mvcmd -f "$dstdir/$dstfile" "$rmtmp" 2>/dev/null \ || { echo "$0: cannot unlink or rename $dstdir/$dstfile" >&2 (exit 1); exit 1 } else : fi } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dstdir/$dstfile" } } fi || { (exit 1); exit 1; } done # The final little trick to "correctly" pass the exit status to the exit trap. { (exit 0); exit 0 } # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: coreseek-4.1-beta/csft-4.1/config/missing100777 0 0 25406 11620775670 13350 0#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2005-06-08.21 # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005 # Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case "$1" in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file tar try tar, gnutar, gtar, then tar without non-portable flags yacc create \`y.tab.[ch]', if possible, from existing .[ch] 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 # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). case "$1" in lex|yacc) # Not GNU programs, they don't have --version. ;; tar) if test -n "$run"; then echo 1>&2 "ERROR: \`tar' requires --run" exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then exit 1 fi ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case "$1" in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case "$f" in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n 's/.*--output[ =]*\([^ ]*\).*/\1/p'` test -z "$file" && file=`echo "$*" | sed -n 's/.*-o[ ]*\([^ ]*\).*/\1/p'` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison|yacc) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if [ $# -ne 1 ]; then eval LASTARG="\${$#}" case "$LASTARG" in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" y.tab.h fi ;; esac fi if [ ! -f y.tab.h ]; then echo >y.tab.h fi if [ ! -f y.tab.c ]; then echo 'main() { return 0; }' >y.tab.c fi ;; lex|flex) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if [ $# -ne 1 ]; then eval LASTARG="\${$#}" case "$LASTARG" in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if [ ! -f lex.yy.c ]; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` if test -z "$file"; then file=`echo "$*" | sed -n 's/.*--output=\([^ ]*\).*/\1/p'` fi if [ -f "$file" ]; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit 1 fi ;; makeinfo) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n '/^@setfilename/ { s/.* \([^ ]*\) *$/\1/; p; q; }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; tar) shift # We have already tried tar in the generic part. # Look for gnutar/gtar before invocation to avoid ugly error # messages. if (gnutar --version > /dev/null 2>&1); then gnutar "$@" && exit 0 fi if (gtar --version > /dev/null 2>&1); then gtar "$@" && exit 0 fi firstarg="$1" if shift; then case "$firstarg" in *o*) firstarg=`echo "$firstarg" | sed s/o//` tar "$firstarg" "$@" && exit 0 ;; esac case "$firstarg" in *h*) firstarg=`echo "$firstarg" | sed s/h//` tar "$firstarg" "$@" && exit 0 ;; esac fi echo 1>&2 "\ WARNING: I can't seem to be able to run \`tar' with the given arguments. You may want to install GNU tar or Free paxutils, or check the command line arguments." exit 1 ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: coreseek-4.1-beta/csft-4.1/contrib/ 40777 0 0 0 11647303453 12013 5coreseek-4.1-beta/csft-4.1/contrib/README100777 0 0 1016 11643565731 12776 0User contributions ------------------- This directory contains user-contributed Sphinx stuff - native API ports to different programming languages, useful scripts, not-yet-official patches, etc. All materials within this directory are copyright their respective authors, including (but not limited to): * Perl API is copyright (c) 2006, Len Kranendonk http://www.ilance.nl/sphinx_perl_api * Ruby API is copyright (c) 2006, Dmytro Shteflyuk http://kpumuk.info Many thanks to everyone who contributed! --eof-- coreseek-4.1-beta/csft-4.1/contrib/scripts/ 40777 0 0 0 11647303453 13502 5coreseek-4.1-beta/csft-4.1/contrib/scripts/cachecleanup.sh100777 0 0 1057 11643565731 16561 0#!/bin/bash # cache directory cleanup script example # # removes all old cached files with mtime older than index mtime # # there MUST be your ACTUAL index names and FULL PATHS to indexfiles indexnames=( test1 test2 ) indexfiles=( /usr/local/sphinx/test1.spd /benchmarks/work/test/test2.spd ) cachedir=/tmp/cache for element in $(seq 0 $((${#indexnames[@]} - 1))) do echo "processing index ${indexnames[$element]}" find "$cachedir/${indexnames[$element]}" \( ! -newer "${indexfiles[$element]}" \) -type f -print0 | xargs -0 -r rm -f done coreseek-4.1-beta/csft-4.1/contrib/scripts/searchd100777 0 0 2305 11643565731 15143 0#!/bin/bash # # Init file for searchd # # chkconfig: 2345 55 25 # # description: searchd # # USE "chkconfig --add searchd" to configure Sphinx searchd service # # by Vladimir Fedorkov Mar 1, 2006, info@astellar.com # public domain SUDO_USER=searchd BASE_PATH=/release/search PID_FILE=$BASE_PATH/searchd.pid CONFIG_FILE=$BASE_PATH/sphinx.conf EXEC_PATH=$BASE_PATH LOG_PATH=$EXEC_PATH RETVAL=0 prog="searchd" do_config() { mkdir -p $EXEC_PATH mkdir $EXEC_PATH/data mkdir -p $LOG_PATH chown -R $SUDO_USER $EXEC_PATH chown -R $SUDO_USER $EXEC_PATH/$CONFIG_FILE chown -R $SUDO_USER $LOG_PATH chmod 600 $EXEC_PATH/$CONFIG_FILE chmod u+rwx $EXEC_PATH/* chmod -R u+rw,go-rwx $EXEC_PATH/data chmod -R u+rw,go-rwx $LOG_PATH } do_start() { echo "Starting $prog" sudo -u $SUDO_USER $EXEC_PATH/$prog --config $CONFIG_FILE RETVAL=$? echo return $RETVAL } do_stop() { echo "Stopping $prog" if [ -e $PID_FILE ] ; then kill -15 `cat $PID_FILE` sleep 5 if [ -e $PID_FILE ] ; then kill -9 `cat $PID_FILE` fi fi RETVAL=$? echo return $RETVAL } case $* in config) do_config ;; start) do_start ;; stop) do_stop ;; *) echo "usage: $0 {start|stop|config}" >&2 exit 1 ;; esac exit $RETVAL coreseek-4.1-beta/csft-4.1/COPYING100777 0 0 43126 11643565730 11540 0 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy 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, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19yy name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. coreseek-4.1-beta/csft-4.1/cs_test/ 40777 0 0 0 11647303454 12020 5coreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/ 40777 0 0 0 11647303453 14301 5coreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/csft.conf100777 0 0 3414 11643565731 16216 0# # Minimal Sphinx configuration sample (clean, simple, functional) # source src1 { type = xmlpipe2 xmlpipe_command = cat data.xml } index test_utf8 { source = src1 path = ./idx/test_utf8 docinfo = extern #charset_debug = 1 charset_type = utf-8 } index test_mmseg { source = src1 path = ./idx/test_mmseg docinfo = extern #charset_debug = 1 charset_type = zh_cn.utf-8 charset_dictpath = ./dict } index test_mmseg_thesaurus { source = src1 path = ./idx/test_mmseg_thesaurus docinfo = extern #charset_debug = 1 charset_type = zh_cn.utf-8 charset_dictpath = ./dict_thesaurus } index test_sym { source = src1 path = ./idx/test_mmseg docinfo = extern #charset_debug = 1 charset_type = utf-8 #charset_type = zh_cn.utf-8 #charset_dictpath = ./dict exceptions = ./dict/exceptions.txt } index test_sym_cjk { source = src1 path = ./idx/test_sym_cjk docinfo = extern charset_debug = 1 charset_type = zh_cn.utf-8 charset_dictpath = ./dict exceptions = ./dict/exceptions.txt wordforms = ./dict/wordform.txt } index test2 { source = src1 path = .\idx\test2 docinfo = extern #charset_debug = 1 #prefix_token_fields = message, charset_type = utf-8 #charset_type = zh_cn.utf-8 #charset_dictpath = .\dict } indexer { mem_limit = 32M } searchd { port = 9312 log = @CONFDIR@/log/searchd.log query_log = @CONFDIR@/log/query.log read_timeout = 5 max_children = 30 pid_file = @CONFDIR@/log/searchd.pid max_matches = 1000 seamless_rotate = 1 preopen_indexes = 0 unlink_old = 1 } coreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/data.xml100777 0 0 3014 11643565731 16037 0 1 2 2 2 2 coreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/dict/ 40777 0 0 0 11647303454 15225 5coreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/dict/exceptions.txt100777 0 0 220 11643565731 20225 0MS Windows => ms windows Microsoft Windows => ms windows C++ => cplusplus c++ => cplusplus C plus plus => cplusplus test 中文 => 测试中文 coreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/dict/uni.lib100777 0 0 16163600 11643565731 16731 0ABABFieiGFGmem&8&C818H878?8CQ8~8_8y8811111&&H7?&8osY bwV7QQQQQQQQ~_yQQ y   j__**, ! !$%$%''oSoMboo؍ooo o2QG2W}{}!{Wx%0011E4c4d4j55!666;;jjx<V<?V?m@ A^A^_IJGKLL~MOoRRoA^]a_  ".  "(6(.)3) 3 474 1:17*MQB,&"QBN#=NM&,=#aM*+a+GSG/e9`9f`/-fHH;}2?U?<t<}D0}PpPZ|8ZiiIgL gR>hwh;-wT@p0222 2^ 2 2I8L6bEd>(T@bA(dEKn//AnKOO77yW:Y:yWY[[DD_F[_FNNPPjjsvls[[vvxxdd~~kklqqvv~~        :%4%3A<#BS<4`UBe3XKXAtHD|A#YY\i0iZ??^R   HK^Z__jSySmCaVztI]z "VI" ` t   xx,o,pCyopr2r2beuesG${mj()*bLG$ul({*JL88);`>; :<^Mx|>lll?PJQJ>d|~e!BfeZH+ + K\1&1/'/' ,3399FF  0!OQ: Q#O#!jy<5T=5=@?.T.@^?RkRk Mn on  os  <uAuDpDpj^AjBB"xSNN"Mx-S0m-mb22w20b2xHxUxCq|;#q#yvEy'w|C'vE--Vx\xHP7ttP799;WUWV;\EEHHddShRhRSTsTsr]s]_zrz_hhllppssvv  &,%%11))   = =4*(4(.+.+*?UPQ,V,V`JY`//Y0W0X >8 e8XWeZ8GGffmfmIrZdrIOkOk|M$|$bd:db\c2\gq~g2$d}qn"<n:"<$&&oBB++uF/o/tFNNui[:}~:w??CC[KxKyiiiSSllz[[`wxy`wczcjjkkzyyz     ..!''44! ( -U22-B;>A>D@310;D3@1JB0AFTFT5%5WXWXaIaL)\Mc~JA\L)ImBnmnEe^eobHfoEvpp^vbH*Z~O,~6Z&t&O*w{w|dhg7|{,9_hd68g7_}}}89%%Gq)*/)qM/RGrNrMNR<<*AABBNs}iKKPliPxlWWssss`xz`zeemmqq yy||}(A!%L!+--+2&:&2: G GHMMQEEQL".#L".#\$\b$cgcg0@@05 d5 d; w j; bjlwlCkkHC'R(hhSHoYo,zp] S'Y( n],*1p3^^36n16b  !bRf?xfzB!xB+9:;CY.?1lDDr  # X1 9 y X~w rn v p }~ggkkrr||~~  "%%"'-',#,#<<007B7BF>>(F(+IQ&QI)&9)*P@P*@ [:.W]W\[. ]\1hhl1 pbb  :l pdmdm;MnM$C/wnwExG2CxK3NE$  jT4Y5jiG/K2N3T4y45iyy=o=?s?&'oDD/D'D/&s2LL62}8}<U<UZCZFKFC6KLQqQ8UUVqqqqVbbcLhhicixx    -!!(()$.$)011*  *+ :-+ 1-11O:OXX17G7G1"5M"HH5_>Mg19jN>g_9WjT  W?T?n==YNYnEkE `  ` kP%  s%lR%PsR l   [/33 ^^ d88d;@8m$ wrAI@/ w$ mqA;lqJ/ rIJL5 5 {a\= Z= o? @ {\Z\aH H I ? I iiiR R T T p[ op[ \ y@ zzye l e l \ u u           0             ! &   !  '   &     2  2 * * % '  #  : :  %  3 ; 3 ;   1  " O N Q N " D Q D W O W # + , +  a a X , X  q   1 g  c g c f q  f h >  h > 9 [ y  w r C ( r C   o  i ]  i J k  _ o  J _ - n M  M  ] ( k ( t  -  t - 4 v  4  s 6 6 p x 8 8 d d s # m # { E A m x A { E . . I 0 ` z 4 0 { } " 4 T  S ] M U u } ` K K t W W | 3 a C a | | | l l p p x x { {        "              5 7  7 ; ; B 5 B 8  8 % % H G  H  J  G J  S  1 ' 1 ' = Q $  ]  Q R Z R * + * < & < =  $  9 ` 2  9 Z  2 @ & M @  C _ C M  U o  s o  s  [ [ X X   i ^  i O  f ^ ! f O ! U (  T (  T S Y , 3  Y z 0 0 ] b 3  0 b : u w > w : ! m ! m > ? ? ) ) + + I t r r I L y 1 P L } P } 1 y V : : = = , V d \ D \ h H c J c D d h H k k Y z q q Y J _ _ z z | ~ d | ~ d o o r r t t w w y y z | z       |     *  *   (  (   .  .  &      3 " + ` B  B 8 3 3 C M E M  ' E Z  ' _ c ^ X ^ 8 " ^ ^  c ^ ^ Z / ^ ^ /  ^  c A a A a i n n  i  ^ # X u @  u q G   ^ q G R Q   R T J ^ ^ @ # Q # T # } ^ , } W  , ^ ^  ^  ^  W  ^ ' ^ 7 A ^ i ^ ` ^ 7 h > h e e > $ > j $ > + j + , , I K I K 7 7 U   U V V ? ? @ B B E E H H ` ` L L N N p S S p t v t v ` ` { { | k @ k m s s m x x             &    "       0 /  0 /  2       ' '  J 2 /  Q  J  Q J O   V  V X Y F J F Y A A O a ^ ^ a e Z   \ e . \ Z .  R W  J [ 4  R 4  [ _ t _ X Q t  T P p T ]  n p  u    P n u # U # # " j " j # U ~ U   -  } f  -  } f 3  b 1 1 ~   b # # w > g > g @ l w ) ) l E E E G v G v K K 6 9 6 9 c > > d B B 3 h q | d c h h h h h U U q r r \ \ y _ y | _ g g m m p p             & &  *   * .  . % %  5 @ 5   7   ;       @ ; ' 7  W ] , ? R R V  , : J V J 0  ] 0 ( K ( + + L K  L  : ?  A o ! i c E c o C ] ? h x h A ` N G N j } " j k E ! q " M q $ M r $ r } k ! !D i    D  * @ y u O y u O 7 K 79 9 O Y ==~ d  Y ~ ^ E ^ E d f f NN l RS l S R X X s t ] ] t  d  h h s v   v xz zx                        (   ( )   )   + ? .+ .'   ':  :-HG  <H*I1C I@ <-$x $ _G G W&_,W1&K^b^bfFfF Oq kqk"d A?iJA#`i`B%MpQML?pB"|ZaJ#L"Q%0|aZ/0n;nr 9$r/d; 9j$jC,mC-m,-{t//{P3355}P9}T9@@BBeoITseMMOIOos[ss xd x[diijjq q xx}}~~      "40" 4 ,DA D"DEZAGDC88CFFS.S.#Q#Q1VE2V1 Z=`662D7 >7D>=N;pYG`pL?j "N!XX:X;!Y!! L TTsrt-rZb\by<aH\:a<%%Ks--JyPJHKP::]^^]IIcNcNOOTTVVtutu]waa]wggjjkoopkrvvw{wp{r $P0 =++W U$; D?D9LALP\?<\9?=[*<*[ =b_b_;l FfEElAFfWsQsY|YQ| USJJSRR  X!P M!Z^m^XxZ.y.xyMtmcu @u}z>&&z@ }G>tG`33dO6~e:t6~n:BBG`GqLdLieiknkkqq[[^^ccoouu{{V}~~)>EQ  + ;+?A') 1' 18C84C77D2I42D((>5!5E!_"a"_*)a?H9?9NN Qc ]MM ]qnqn@mnnnnn@wnvvnOn%b%nzbznUU=mqF#$nnf0nfnf=#k'':nin++FkFSn/22L55688SS>>?/\E\E`I`I?ggRRllYY[[``}n}}&}u}}ll6ssuu{{    I  $( $! 11%% =$*( HH H= @&O9@OB9$Bw3&03JJ4fO:kbk:;XhZ;hGiG}K}LKrL\r)S\_ ]MM)*] _*f/cc6<e#nenaa<<#F????kFz2z2PP8W8WgAAjmgOOjomoqq[[wwyyddkkwwwyy !&-(- &( ./))&@F4H/&@H 'P&bXF& Z'&PN;"; ++&RK,N KR*">1 +>1 GT* , T < G`<`=u=CWC{u_uL}LIxhh!!{x lt0li3_babgi0a3g37n79  z9z&nu&u {|uI}/|/J6uuJ6Q~;;YQYXXCCcHcHMMeeps[lpspp[vv``hhkklmnmnwwx}}    .x '+ 'R,<=,=9<P PP9PPG?GPW?c%}ce\eDD1P^1I4I_5t ^_P1t4>P5Jt,PJ!FyFKN!yNo oOP &~&zpzvp33u!u!$q>$@@))qq,2vL{L23|O~|77{3~==>>VYYGVGHLHLMffjljsWsrs_fxM_Wrefmoemoqq~~ +   t,y  4#4#  1..@%-\@:-:+N5N5+005OQSO^U^h'KSQha@@ @6 T6E  TaEZ?kXR?@RX\gx]x"g\k]"%% %Y Y,9`"y7b9ypbp;"#&;&A(A(+,H16+@Z6VPz#,FFIIrfiorrrsd?NHRcdrWQgvsuiu}}~~  5Q%%) 8)U'8?0*:*%0.?.:kV_GV/NmV_/aMNG/MON OU bUb7m79Za`Z@yy@Pk  zik i 9m  1roT-llcT-,oc111`h`e;h&;&'ADqDDqA'r445779;;W5EWDDEGGIIJfJfjUjUVVYYZ[vv|9[kkmmZ|yyzz   6AA>:(>88(:?,<,N*1N1*M<H=M=BP22+PB+FXF\O\3cK R3Ke?C@LeCWlde RT#QL)QTSd# l ])-o_-rp^]ifo_ariu^u $x gb$;x'(-EE-/v/22`hj{89:8<n?Z?:Dp`fa9'`<b{hOORjRTTDsnsZq(__|z|Zffqxx"B.Gjokw   64!!664"#@  #@AA%  BXO.@.GU)U&.11*WE.C+GSWC GNGNXS FSjooFBuzKzKuJIHI  Yeeo3kqp0[/q[3p0vv;"~~r"r;<LnMmok-m-Q/PwnLy/tMyPt9Q9:<<==VBB]GGddbbOOhhU:UXX[{[}^{}hVh^]qqsuuzzs  %    ''4!&)*E+4X! 2>2&(N>(5,H.JAC6A;1;?Y]n]jVjtt&t5tnV,t.tMEa6t?tEMl}atbt l )b_)tt7|avfattav|_ttf7#:t#iDt)o)oDFyyFLtt ttLt6689<U<@ZZ@CCEEF8IILL9NNSSTUUTrr\sFz~\~kkvuuv||}}       3,2,,:,J,>,3D,~,],3, $ j,N$, 24;4C1X,,,,:;,,OYO0A,,,,JA0>, ,.,}nn7ldlde^D:[^xw[ew~zxzMMi#y! i ]iyjf-{fX{a"a="=$%Bho-jB%o,$hI!~1I55,799;;17UAACCDEFEHLHLNNUFUVV``ceggtscDste{{}}  -  &22Y*)* 6:6(.:I0I0S7/I<S/<.84^4'PT=3()@'3T?BR? jZ =jfBhQQ^^yPyR@y@fyhuyGu>u*uJu8SZ$$\$$yk]yyyyy\dyyyky>y))*/dG]G/J22y~Oy~8W8WAADDEEJJgiiRRmqmqXt\\X^|^b|dbgOgooyyd-&  (() # #,  ,f@@@>>@@BBSSTKTK%U%Q$QVWWUV$HH_C9@FO@<_<hm]meveGYnlICU~liY`a~ a iFUG]WhU+cppzz+I]Zsj669""f%u?AA`njE?twu%w7cZtOOO78<8<>>?BsBEEGGHk?NNOQkSOHQYY{xx_`a`{e_jajSppqrqzz}}re6h,   $U]nf6666$66K6T6b6u6 $64FF4666K=M=666$vM66F6666b6666b16AL6TToAoICICuTdK  VP T dPVxvZxZ  ssu9ttk;k;((B,,--wJ0w9uLO099:<<=>>AABD=FGIJKIL:FPKRllPXXrZ\\B`D`RbcdbfgGgdcftrtvrZ}}~~$4 v$$   48/8?1EHELMT2"NQ"QO]V1O]PUZvMh6_7Nh2h7Th_UhVhNj6h{hhhh{hhhhhhh*ohj*h3hhhhq3h2h[hn7hXhKhghq=((C{DCJ00J3o{n3<<W?@AA?aIaIJJmgPPRRW@mWYWv\^^_`cYc~_~~i`nnouwuwzo\zi4/?  #  H2&2&5-59'9G8$)8)==4*CBG'2]SC[]7[M2aM*4 X7T bTab>UU>KgqVq   v[  Z+N O{Z ee O{+ dvN ~X d6 j6rj! r! |A* * E- EJJ- |= = fhC _ C K K kfQ hQ klT U lT Z Z ssb c xb c e e f l U xf l m m p q q w p w ~ ~     #          -'$4B , , , " , < ,  , 5 ,  , 1 , " " < > , 5 ] ,  W , S  9 H  H 9 n , 3  , @ 3 @ , 1  L  L   ( i , , , (  > , Y  # , V , , # Y , , ,  ] B D B D  V a a V W v ? v n ~ s E  s k  y k !y !G I !!n !G ! !g z !g !! !) h ) r h !n !r !- !/ i / x !x !!!"!| ! "!o $! &!$!o &! !i ,!,! ! 0! 0!| 4! 4!5!6!5! 6! !?!>! C! C!D!E!E! H! H!t J! f j f R! R! j D! W! W![! t J! [!\! _!`! {  \! _! g!h!n!  { ?! h! n!o! s! s!t!v! v!x! x!y!t! {!  y! ! !o! !!{! ! !`! ! !!!g! ! !! ! !! ! ! !! ! ! ! !! !! #! %! !!! !'! ! !! !!!#!!!!!%!! !!!!!8!!!8!!!!!!#! '!!2!2! !-!! 7! !! G!G!!j!!U!!m!!+!!!!!+!! G!!!!!7! !G!! S!A! 3!A! 3!!!S!!? !G!Z! !!G!)!(!E a!(!!)!I !Z!!!a!9!Y!!9!!I!N!!z !!I!!!F!(! !!N! !!G!F!;! !!!f!Y!!f!u!;!!u!!z!!e!z!"e! ! !" ! !!!j!]!Q!Q!!!"j!"]!"""U!""m!"""!"! 0!"" 5!"!" 5! 5! "! "!:!!!:!!!!&"!&"'"(""m!~!!!!!!!!!!!!!!!!!!!!"!!!"!("~!;"!;"}!V!!}!?"!?" [!"!"!"!N"!D"!H"!E"!H"7"!>"!J"!L"M" h!'"!k!!!k!Z"!c"!]"!U"!t"!"!"!!!Z"["\""!"!"!"!V!!"!"! {!["!L"!\"!h"h"!!!M"!m"!m"n"o"s"!n"!o"!s""!!!"!!!y"!y"z"!!|"!!~"!!~"!|"!""""!"!!"!""""!!!!"!"!""!!!!"""!z"!" "!"" "!!"!""/"!"!!!" "!"!"" "!!!!"!t#!#!$!"!"/""""""!"""""/""""!"""<"""<"""""")"""!""-"!="-")"""""="""N""!D"""""I"I"!*"!"""W""W"*"!E"B"!O"B""O"""7""^"!!>"">"P"^""""P""S"6"" "J"6" ""S"">""c"""""]"F"r"!"F""w"""""U"!D"w"@"#q"d"#q"$"t"X"R"#@"!"! "d""""c"R"$"#X"!'"}"p"#}"##"##"]"#`"1"#u"##"u"`"###"""!#"!#$#"""$#&#"&#(#"(#)#*#)#"x""#"K""/#3#""K"""3#4#4#"*#"""/#x"9#T"""T"=#"=#1""?##""Y"""""D#9#"D#"Y""I#"I#"a"""L#a""!h"!h"!h"!h"""L#"U#"U#?#"""Y#"Y#""""]#"]#^#_#""^#"""""f#"""f#i#"""i#j#""!"""""""p#_#"r#""""j#"r#"""""#"{#|#""""{#"|#""" #"!"#"#"#"B#"F#"#"P#"Q#"`#"5#"O#""#a#"#""###"#"#"######""#"#"#""###""#" #p#"## ## ##"###"#"#+#"#",#+#####,##""###########-#-#@##"##A#0### ##A#0#"#F##B#######P######R#V##R###Q###F#r""#<#<#%#%#""`#####5# #O##E#E#.#.###X#X#M##p"##5##F#M# ##a###q###o#q#G##w#:##w# #[##o#t##P#[#t#$#F#"#\#t#"#:# ##P#$\#b#t#S#t#$[#"(#$$$x##$S#"*#$x#$b#1#Z##1#Z#t#$$##t#$$ $# $#t##t##t###C##*$##}#*$}#C#-$#-$.$#t##t##t#3$#3$5$#5$6$8$#8$.$###<$#<$#T#?$#?$T##F$#########F$####$#####6$#####O$s####O$#####W$#W$#s#Z$#Z$[$\$##$#\$#[$##|#e$#!$#e$+$###$#i$j$k$j$#o$#o$i$#$# $#K$#u$#u$##$$#####N$#{$##:$#####=$#f$#w$#####{$#$#$$#$##$ ##$####k$#$##$##$##$#$###$$$$#$$####$## $#@##$ $$$$$$#$$$$##$#$!$$$$+$$$$#$$$$$$$$$$$$#$"$V### $$$$$$$#$$ $$$G$$$H$H$9$$$K$G$$$$#$$#$$$7$#$2$2$7$$$N$$G###$$@$]$$$@$$$=$$$:$$C$$_$,$$_$`$C$$`$$$$f$a$B$$$a$$$$$T$E$D$T$>$$E$$$=$$w$$f$$$>$$%X$%%p$X$$%p$$# $$$m$y$ %m$ %'$$Y$'$%$%b$U$^$Y$%0$^$d$$U$0$}$$$$$$$$%b$$$!%d$$f$!%"%$$$$$f$"%}$$w$+%$$$+%$r$/%$r$I$/%$J$x$$J$$4%x$4%5%$$8%$8%5%$;%$;%=%$=%>%$$@%A%B%#\$A%$#\$$$I$$I%$I%J%K%K%$$$>%$P%$P%R%$R%$$T%U%T%$U%$X%Z%$Z%z$$$v$$$X%$$z$g%$@%$$$$$B%$g%J%$v$$l%$l%o%$$$o%$$r%$r%#$$$$$w%x%$$$$%$$$}%~%w%$$$}%$#$%~%%%$M%$p%$%$%$%$%$%$$%% %%$$$%#$%$%$$%$%$%$%%$%$$$$$%%$"$$%%%#% %%%$%%$#%$$$%%%%$$$%%$%$%%%$%%% %$$ %%9$$ %$%$$%%%$%$%$%%$%%$%%%,%$$%$?%$]$$$%L%?%,$$%%$L%,%$E%$(%E%%(%0%%%M%B$$$0%%M%H%$O%H%%S%Q%D$$%M%%O%%S%%[%)%1%$)%%F%1%$[%%F%%%6%f% %6%y$%7% %%N%<%9%7%%9%%N%%%p%%q%&p%D%%G%%%M%q%D%<%%v%G%&v%&&&&t%&&y%.%{%t%|%'%p%V%'%W%*%{%W%y%V%\%-%*%p%|%.%%\%-%p%:%%%_%&%&%2%%%$5%_%:%!&%!&#&%#&%h%&&%&&%%$B%Y%%2%p%,&%%,&%%%$J%1&%%%z%4&6&%6&%%1&%9&d%%;&$R%]%%a%%%%%Y%4&%^%%z%^%9&%%]%%]%%a%%c%%%c%%%d%;&%O&%O&P&Q&$l%$l%U&%U&%%P&%%%%%Z&[&Z&%$x% &x%?*x%+x%-x%/x%$~%h&%Q&% %~%h&$%%%%%%%m&m&%%%%%%%%%w&%[&%w&%%%%%%%%%%%%&%&%%%%&%&&&%%&%%&&%%%% && &%%@& &%%L& &a& &z& && &&& & &&&%& && & ' &' &( &4( &( &%( &!( &Z( &%&%%&%)( &@( &v( &% &%&T( &%%%%x( &( &( &( &%%Q%%&&& &%&&( &) &R) &_) &|) &n) &k) &<& &) &) &) &) & * &%<&K&%2&K&&2&&&%@&f%%$&%&5&5&$&&&L&&&%&%&L&\&%&&&&\&=&^&^&%>&3&%>&&=&&_&&7&_&A&D&&&A&&7&D&&&a&&:& &%L&f&:& &f&r& &I&r&&I&&&L&B&&M&B&&&M&&L&'z&'F&&q&F& &q&R& &'h%#&%#&&z&'V&V&R& '&'&&&+&&n&+&'{&{&n&&&'0&&&0&&& &a&'E&& 'z&&a&&e&'&C&&W&&~&e&`&&e&C&u&C&s&E&-'&&s&-'J&~&t&J&&t&c&&2'|&u&&&'&z&2'&8'&8'T&|&%U&&T&&W&&&X&&&&D'&&X&Q'&D'&`&&&&&b&&J'&J'&b&&c&&&P'&P'Q'S'&S'v&&&&&o&&&o&&Z'&Z'&v&&x&&x&x&&&&b'&b'&&e'&e'&&g'&&&&&&&&g'&&&&&&&&&w'&&&w'&&&&&&&&&&'&'&&&''&&&&&&&&''&&&&&'&&'&'&&'''&&&'&&&' ''&'''&&'''&'&&&&&&&&&&&&& ''&'&&'&& ''&&& '&''&''&.'''&&'.'&' '''&6'&&6'' '+'&3'+''.''3'''0'0'9''9'&3&&7'C'(' '&7''('''@' '&F'C'&F'*'C''''N'?'@'&&*'K'C'W'C''N''$'M'&K'?'&'$'M'&'K'''5'5' ''&W')'&/')''V'''&6'R'C' '''/'''''R''V'' 'o':' ''i'q''O'O':''T'q'''i''|'''c'x'|''x''o'C'T'C'c'C'h''('h'Y''['Y'#'r'(['U'#'r'' (}''t''(t'''X'U' (X'(1'}'4'''1'j'''''4'd''(d'(a''#(a';'j'';'#(<'''<'y'''('''(y'G''s'''G'0(s'0(I'''I'3(z''3(z'\''''''9(^''''<(''9('<('`''''C('C('\''^'&b''`'''''N('f'''f'N(k'''k'''R(''R('''''''p'''p'''[(\('''u'\('{'''{'''c([('c('~'''~'k('''k(''''''''''t('''t(u(u('''''y(('''''&'''y('''''''((''('('(('('((( ((u''( ((&'C''''''''''''( ('('(('('(('(((('(((((('''''((''('('.(-((('.('('''(-((/( ( ('(/(((2(((2((((((4((''4(('"(G((1('(G("(1(('((''((''A(A((>('J(>((J(('%(('(L(L((5(((((5((!(((Z((a(8('a(F($($('(F(((()( (@((`(:((](=(W((=(7( (:( (](7((`(E( ((Y(E(W(((Y(B(((m((m(B((((v((T((H(((|((I(|()I() )X(d(( )&(d(X(o(^(( )o(&((&(*(q(~(j( )^(j(*()~()b(h(e(()e(){((?({((6(q((r(n( )6(b(((D(( )r(n(?(')(')(s(K(x(O((.)}(}((s(D(.)((z(K(2)(2)(z(6)((O(6)((S(((S(((;);)(>)(>)((B)(f((B)i((((G)(K)(G)J)(((J)K)(((f(W)((i(l(((((l(V)(V)W)((((Z)(('u( (u(((Z)(a)(a)((((((((((((((((((l)l)(((q)(q)s)(s)((((((((x){)(x)({)~)(((~)))))((()))(((((()()))))()())()()((()((())))(((((())()()))())(())((()()&)( )&)) ))))())))())"))")())))))))())))) )((3)4)))()4))3) ))(5)H))5))8(()()H))?)))(?)L)()()()()L)/)())Q)/))Q))(+)F)())N)F))+)!))N)H(((((R)h((((h)(])h) )]))S)))S)M)))g))_)M) )9)I))9)g)D))I))C)=)m)t))_)D))=))*m))C)}))t))*O)})***|)*O))P))#) *j))R) **|)*#)))X)*))j))u)*)**n)Y)u)*Y)**)b)(6))_)@)k))*k)<))*n))<)(>)A*k)b)@)))(*)(*)*E))))-*)-*.*w)E))w).*z)(K)))T))))8*))[)))T)(W)8*)@*)))@*A*)[)))D*D*)F*)^)^))))F*)L*)L*))i)))i)))z))R*))T*o))R*))o)v))(s)(s)T*))v))))y)y))c*)c*))e*k*)(~)))e*)))k*n*)()n*))p*))p*)()))))))z*)z*))))*)**)**)))))))))*)*)**)***))* ****)))**)** **)))))))*)**))**))*)**)))*)***))))))!))'*))'**)*** ****+****:*))&**)&*:*1*)) **?*2*?*<*?*h*?*{*?**?**1**?**?**?**?**?*+?****)3*3*****?*+?*%+?* +?*W+?*G+?*N*)?+?*n+?*i+?*H*N**H****2**<***Y*Y*,*,***0*P)**0*;*w+?*+?**h*+?**+?*+?*+?*X)*+?*+?*;**m*>**m**h*+?*E**+I*I*E*++]*J**]*i**+h*Z*i* +Z* +h* + + +{* + +X*U*))**U*))*))*+X*++*+5***_*'+*_*5*9**+f*9*b*9*o*f*+o**b* +{*&+*&+'+B****)A**B*)F*K**3+*1+***1+*K*3+***O***O**9+*9+:+:+***[**@+***@+*[***s**^**E+*^***H+l**)e*)e*H+**e***E+**l***V+*V+*q***[+***[+*s***v***v*`+**`+*|*****|*h+***h+j+*j+************s+*s+********z+***z+q******+*++*++**+****++*****+****+++*+++**+**** + ++**+**+**+*++*+**++*++*+*****+*+*+$+-+*+-+**$++*++*++++(+**+**+(++++%+++ +++=+++++ ++#+*++>++*>+/+*++++<+M+*<++J+J+A++%+*<+>**/+*+ ++A+*T+*+T++++++c+C+*U+C+*U+)++c+++W+J*++\+0++\++W+2+R++R++++2+g+7+U* ++g++;+F++;++G+++d+d+I+++n+++?+t+~+P+x+"+t+I++F++,P+,++,+, ,~+!+x+"++"+!+n+*+i++m+m+*+,+,,u+u+]+,+.+++*3+.+w+5+++5+|++,*:+,|+*:+%,+B++%,+l+l+B+D++++*,/,+ ,n+*,++D+/,y+K+N++K+++y++N+++6,6,+S++X+++S++S++++X+++A,+A,^++++D,++D,++^+e+++e+++P,+f+++f+++P,R,+R,++o+++o+W,+W,++++v++],++v+],++a,+a,+}+g,+}++++f,g,*+*+++f,+m,+m,o,+o,++++t,+++t,++++x,y,++{,|,x,+|,+++++y,+,+,,++{,+,++,,+S,+++U,+,<,+,+I,+,+,+,+,+++,+++++++,+-+,+,+++,+,+-+-+-+,+,,,=+++,.-+#++M++++5-+S-+m-+-+w-+',+,,+,',,,+,,+7,,:,,+7, ,+,,,:,,, ,)++,++,, , ,,,,,+,,0++,,,,,,N,J,7+++N,",&,,",,,,B,&,+2,T,+2,(,+,#,,#,(,,S,,L,+-,),4,L,+-,,4,,,O,.,Q,,.,,O,0,0,,,U,e,9, ,e,^, ,9,,d,^,,d,,]+,,<,-V,C,,r,C,,r,z,,-V,z, ,I,-w,},K,K, ,X,!,-!,},B,J,1,, -, -8,,s,i,--s,w,X,;,,-,Z,Y,3,Z,Y,1,,\,\,3,,_,_,5,-=,b,,,i,8,b,`,>,,h,>,`,;,,>,,h,,=,E,,5,,+-u,+-,,--,E,H,,u,,,H,~,,--~,9-,+R,+R,9-[,,,,=-,=-,,c,,,,C-,,,C-,[,,,j,,J-,,,,c,J-+a,,,l,,,,,j,,l,U-,,l,,l,U-,,W-+o,W-,,,[-[-,,,`-,,,`-c-,,,c-,,e-,,e-,,,,,+,+,,,,,,,,,,,s-t-,,,,s-,,,,,t-,,,,,,,,,--,,,,,,,,,--,---,-,,,,,,-,-, ---- --,,,,,,,,,,--,-,,,,-,,,-,,,,-,--,--------,,-----!-(--!-----,,,-,J,,,,-T,,---,/-/->--,--$-,-$---- -D-- -),,--6--Q,,"-@-,:-,.---:--@-,-,---"--,5-]-,R-]--R-T-O--T---S-Y-*--Y---S-b-7-O--*---b-k--7--d-k-%-S--N-r--d--f--N---l-A--r--l-A-h--B--g-B-.g-..v-H-i-h--v---.X--.i-H-%-j-%-.X--j-0--~-V-.~-.a-1--1-V-0--a-4--1-m-u-4-,9-,9-,9-f-k-,9--u-'.-'.E-x-x---E-..---.././.----I-I-w-L---L---8.-Q-Q----8.-------@.-\----.-.-@.-(.---_---_-.-.---O.-O.P.--o----F.--o-P.-Z.-,t-Z.--j.-^.-^.`.-`.w.-|.-.--|-\------.-.-.-.-----.-.-.-|--/-:/-a/---~.~.----.--.--.-.-.--.----..--------.-.-(--.-.--.-,-..>--..D--..---!.--..-..%...!..-.--.."...".-...#..#.-6--%...*.-.*..--.--&.-.--&.$...$.....>.6..>..-(.J. . .--J.).-.;.....-..--R.2.-;.).R..+.-.T..=.2.-=.,.W..-F.9.-W.-T.+. .F.C.9..C..,.a.H..H...a.7. . .d.d.7.I. ..i.i.I....j...w...S.S.G...|..X.[.1.|..X.b.k./k../|. /o./b. /{.N.0.{. / /l.l.Q.v../v.///4..Q.0..\..1.o.[..j.e.4././<../|.m.<..e.?..y.t..<..m.)/y.t.?.)/...E.//p.E..p..//K.....K...5/.5/-P.V......U...U.>/..V.>/?/@/A/]...]..]...-`..c.K/.c..K/?/.....P/.P/@/...A/.q.....q.W/.r.\/.....\/]/W/._/..r..]/..z.......h/.h/........n/.n/.._/.t/...z..t/u/....u/.....|/.|/..~//..~/......./....././/../...././//../.../-./..././-..//.'/.../././.../////'/////6..///./"///../..//..../ //&/6//./&///. /6/.//9///-//9/B///-/C////:/$/=/.//$//E/L///D/%/G//%//E/D/./8/#/J/L/./#//.:/=/.7/O//!/M//7/ /!///G../:/;/R/[..F/+/N..G///a/0/,// /://F/J//M///0/O//,/ /*/a/+/ /R//\.//;/x/S//x/^/N/3/a/0/0}////0/-0///00/000// 0 0/////////0 00/0////0/ 0// 00/0/0/00$0$0/000)000// 0/0 0)0//0,0/00,0000/0;0040//;0604006000/00/00000.0/E0.00E000/F000G0/0300=0G0S//0/030/O00/00/=0"0/N0"0/N00[00J0V0&0/[0&0/>0V0//J0/0/080/00t00S00800-0W00Q0W00f0p000Q000j0S0<00<0d0<00<0@00f0@0I000R0I0U000R01x00T01P00L0p0 1h0x0U0 1j0W0y0p00L0T0W000y0h0P01r01z001r0X0100Z0101z0X000000i0Z0?0i0w0~01w01B0d0/9000K0g0%10g0k0%1~0?0k0B00B000,10,1Y000s0\00]000K071031000|031071}0091=1091}000=1s0Y000|0\0B10]0D10000B10I10I10b000D10b0000l00V100l000V1X10X1u000u0000000`10`100c10c10000/0/000000000000000o1p100o100000w1000w1p10 0000000000000000000000000000001010000011001110100000001 100100101000011 110110010100101001101111111&10010&10 1010 181018110111'1011'1111110;1101511151111100:111Q1K1(1K1<00000000101Q11O101<1 1O101;1011 111F1T11(1:1011F1111)1U1>111U11]1111111]1>111W11d1d1W11B11s1N1t11N111^1?1s1A11]11A11A111A12^11A12m1v12m11v1)1T12 21 2 2g1 2*1R1k1}11s12k1}1*12g1v12~12221r112r1220712f1"21071f11"2#2#21q11R1v1'2~1v1*2{1*2'2q1.210D1.2/2/211v1{1152152111111:21:2<2|1<211?21?2A21A2B2E21B21E2F2F21K2111K211M211O2O21T2111M21T2V21V211X2Z21Z21111X211111b21b2d21d2h21|1111h2j21j2k2l2m211p21p2k21t2111t211v211{21v2111{21111l211111211121021,2121N212211111111m21212221201011K11T11>11W1121J2121211221Y21212^212222(2222P21(21Q21`212222222122212222222<1120222 21220222 22,2222 212C2122 2222222N222222222;2;22A11112121J3131t111J22212Y2?11v11111111112242[2242222n2L262q2622L222q22\2_22222\22^2z2}22P23z23 2P23Q233 323`2}2 2 32R2)22n2[2S2)22Y23y23y2S2a222U222a232U222333c2323!32c2222!3#3f2#3$3'32$3f2'3(3,3222f22,322222G2G229322222221M222222293<3222<3=31X2221X222F32222222F3G3G32L3222(32L31d2O32O3P3P321m21m2221m2X32X3[32=32[322w222w222a32a3c32c3d3f32f3g3d32i3i32g32l3q32221222q3l3222u3w32w3u3222z3{332{32323222z323322322232223 32)321222322232323223333333333 3332323332%322212222333&333C223&32233333333)33332333"3+32"3+332>333333>3333333;333%33H3;3J333373[2236223-3_22H3J373303V330333-3J3I3J33Y33I33333*33K333D33)33*333E333\3R2 333^332 3Y3V3A3@333v33*3J3K3J33A3C3y33C3D3J3y33^334B344Q3 34]3`3~3E3J3\3J3 3`3x3~3R3Q34R344x344Z32,342,3v33B33]333e34343343444j3!4j3333!4j32=3(4333(4+433m3+43o3Z3~304304333433444334432P3;43;4T333T33333A43A4C43C42[3jE4F4_333_3I4333333F4333O4I432l32l32l32l33l333X4O43]43X43]433_4_43b43b4c4Kd433h4333h43333333333333333333333u43u433w433w4333}4333}4~4444343323333333433344344433333334 4~434433 4 4344444443443433344444"44433343434343444444#4#444433V335444"4354$443$4944.44434.443944'4'44444343J4444444J444P4M444J4`4M44P4G4R43G4r4M4T434@33S4T44S43 4U434-44t4M44m4M44`4-4U44/44~34e34 4R4/4R4K46444K44r4N4 4e4D4v4N4 4e44v444t44D444m4444V45L445445x45f45f4L4 54Q4V44m3(4o3(43(43(43(4544Y45a45Y414x4474p444 54a444447444!54!544<444<4(5444(5443E4H443E44H4y4405p44W4s405y4443O495|4|4495444444=5441444W4B54B53]4=5444s44H54H53d44d4M4d44d44d45d444P5P5444T54T5X544444X54q444q444444^5^54z444z4c54c5d5d54f5i54f54i534m54m544p54p5r54r534 4444x54x5z54z5444444545555455455454444444544454544544454455454445455455554555555 5554555544555545444555$55544545$5R44&555&5555%55"55554>5:54 5:54 554354%5555555644>55O5355O555<5555E5Q55E55'5?55#5N555'55#55G55545555e555Q45454545455e5@5h5j5g5g55o555@55j55A5o5555@545?55A5_5h55_5k5t55k55u5w5G5N565R5t555J5w55)5y56u5*55J5h56M5M5S5R5)5y5h55h5S5*5665666`5|556|5666n56n5555s!665`5h5q5l5&6{55(6,655l54B5,6&6q5F555F55555(6{5365655636576=655}55555765=6D65555Z55555Z55D6E6E655555K6555K6L6M6M65P65P6Q655Q654m5X654m5X655\65L65\65555a65a6c65c6e65e655g6i65i6g6555555555u65555555u6w65w6y65y6{65{655}6}6565655656555555555555 5555656455566<55Q55?5566666665566665566666"5565656665#6666666666#6666$66656866"666$656"668666066%6*6N55666666-66%666665556A6h5555556<66J6466J6666.6F6S66k6666666666S66.66#66^65S66^6F6W65`65]6W6-6*6 6]6I6H66d6`6A6<66d66I6H6 66 626N6 626N6r6 6O6r666O6l66>6l6666>66G6s6 6S67G676S6l5!65!65!65!66!66!65&67k676S6R666S67R65,6}5,675,6j6_6_6/6/667j677f667767f65=6?6|6n6p6%7&7p6?6x6t6U66%7n65E65E65E65E65E666E76M76&7x6T6667666766T66U666|66S76[666[666D76D7E76666I76I7J766L7M7J76L7666Q7Q76S7U76U7V7V766o666\76\7v66666v666~66c76c7666~66666666666n76n7o66s76w76s766v76v7w766z76z7{7~76{76~776766566666*66<66466667677 76677666 7767677767777776 77677777677066777 76"7777'77677'7 76767777 777 77 777777766=768696:6:66=777"7F66)776=77)777"797-779776=77=7q7=7a7=7e7=7r7=77777@77$7777=77/777=77=77=77Z77=7!7877=7^7877!77=77=7s66[77R7[777R78=7)8=78=78=768=77^77t7o767@8=77_7B8=7b8=7q8=7x8=78=7@7_7Z7_78t788678`7t678678x78 8u7 8p7$7/7_7`7o7}7p78}7888a7x7o78q787]788878e78r788t777 8 87<777<777%87<777+87%87u7o7+86E70876E708887776M7O77T777O77788777T7;8777X7X77?8?87Y77777Y7;87G87G8L87f77777f7L87g7777h777Q8Q87S8T8g77T8777S876s7^87h776w7^8776{76{76{7 7{7"7{7i87i8j87777j8777o8777777o87t8w8777w87777z877}87}877t87z87777787887778778788877777878777777777787877777777877777777787_778877o7788878-777787888)8887)8"8718"881888.888888888.8788788877)88888(887>88(8887$88>8J88)8888J8888J88R8J88$88888)87R8E87U8E888I888U88`88 8688`8V8X8288868828 88X88@88B88889898k8]78I8J8h8D89h898b8978F8d8!8q89F8d88-8q8{8!8&8e8e8{8p8&8~8p899~838q88-8f88Y8/8708/8f8a8Y89a89]8u8u83878]8878<8q888"98"9r8<88=8s8r888=8s8)98)9H8x888-98-9.98H8.982982939883988M8|88887S8M88W8|88W8@98@98888887^88\8c88J98888c8J9n8888888898(98y88/98+98&986988n87t87t8987t88y8`9887z8%98`9898K98<98]98;98\88u98989898t98t9x989888x9y9z9888888y9898z989988889898999889889898898988 988 9988888988988899889899889899899898999899899889888J88!9,99!99V889(9999#988/9989#99889+999$9819$99199&998690988+99'999999%9'9099999A999999K999Q9B99Q9999<9k88D889L9R9R989Z9Z9M98L9999N9M989]999K99E999?9 98<9C9?9E9499;9N9R99C9989h9989999g9 9]99O9F99O9g9~9:_9_9~9::|9:*9u9U9w9 :U99K9 : : :S99:S9:w9*9:9:9}9|9~9::9 :u9829:9::9::9:: :99c99:c999 :u9 :9':i99*:i9*:H99{99-:':99H90:0:99I9-:{94:99W998:99::I99@:9999W94:9@:::9B:99D:9[99999998:999B:9D:99999R:99V:9R:9V:X:9X:8t98t98t9998t999999999[9999f:899989f:9m:999m:n:9999t:9t:u:99u:9y:9y:z:z:9999999::n:999:9999:9::99::9::::99:999:::,99:::::::::9:99:999::9:::999999:::9:?:::::::::):::):9:::::::I::A99"::::N:::": :.:h:::::T::::B99c::{:::::C::: :9:+:::9::?:::::,:,:A:499F:6::::?::F:#:L:J:L:::h99W:L::#:F99~99:9J::K:Y:9:K:Y:C:.::W:::1:1:U::::G:H:l::H:9 ::::}9 ::I::<:<:E::h:E:::N:!:=:^:[:;^:=:Z:9:G:U:;9:9:Z::$:T:P:b:|:q: ;[:!: ;|:b:$:q:%:9':%:P:;c:;c:;;:/:/:{:\::;;;;\:_:j: ;:;_: ;#;:9::#;p:k:::v::::::-;p:-;r::/;/;r:O:v:Q:s:s::;{::::O:9R::Q:::::::::?;@;::?;:::@;:::H;:::H;:: ;:L;:L;::N;;:o::R;x:::::o:Y;:;:::Y;Z;R;:`;:9u:.;::x:`;a;N;:::a;:Z;:::::::::j;::n;:n;o;9:q;j;:::o;:q;:::x;:x;y;z;{;|;::|;:z;:y;:::;:;::::{;:::::::;::;:;::;:;9::;::;:;;:;;;;;:::;:.::+::; ;;;; ;::;;;::;;:;;; ;:;;;;:;::;);: ;A::6:: ;::; ;:;: ;:L::U::;;);:l::;;.;;;;';(;<;";A;:";;<;:';;;(;;:8;;:;:;;;8;;:;;;K;U;M;;U;K;S;;;W;;;;:X;;$;X;S;;b;S;$;:;b;;;;;*;;C;;D;;E;;;k;;^;k;c;;;^;E;;d;;];;l;>;g;G;;g;;l;%;O;;+;T;;;F;j:;G;;d;c;];c;F;;W;M;p;s;k:#;:#;>;%;*;S;C;S;<p;<m;w;D;S;<m;O;c;T;c;;+;<<~;i;<_;e;4;<t;<<!<;_;s;4;~;!<t;e;#<$<u;s;:@;;s;(<<u;:@;2<;#<v;v;s;;s;$<v;;s;2<4<;4<8<;(<v;?<;8<;;;;;;><;><?<:Z;A<:Z;;;D<J<;D<;G<;;;;J<f;;;;N<;N<;f;;;R<;R<S<;;:o;S<;[<;:o;A<;[<\<G<;\<;;;:z;};;b<;;b<;;};f<i<;;;i<k<;k<f<;;;n<n<;p<;;:;;;:;;;:;w<qx<w<;;;p<;;;;;;;;;;;;;;;;;;;;;;;;;<;<;<<;;;;;;<;;;<;;<;<<<<;<; <;;;;;<<;<;<;;<<;<<;;<<<<;;S;;c;;s;;;;;;A;;;;<<<;<<<M;;<<<<:<<<<:<;;5<6<<5<<<<<<6<<<<<<@<<7<.<<=<;7<;<<<;<:<<<<=<;;P<<"<;<;@<6<E<;<"<E<%<V<<Q</<<%</<;C<B<<Q<<q<^<,<;C<<^<y<,<<^<z<,<<^<W<<q<<9<W<<9<<&<^<F<q<-<^<<w;<Y<e<<Y<P<=<<<r<O<O<<i;<<F<<r<<<<<=<=)<<U<|< =T<&< =<T<=|<)< =U<=]<-< =X<=y<I<Z<Z<]<;2<;2<=^<;2<c<`<X<|<==c<= =!==z<m<<H<m<(=<!=}<<h<(=)=;A<2=t<;G<;G<`<I<;G<h<H<)=}<2=4=<4=5=5={<_<<<<a<< =z<;=~<<d<<;=~<<<g<<<<C=<C=D=j<<<_<<a<<d<<<D=<O=<<g<}<<O=<j<t<<Y=<<<<o<{<<<<<<<<Y=Z=\=<\=;x<<x<6<x<.<x<V<x<B<x<f=<<<<<f=g=<<o<<g=<<<<<<<<<r=<<<<<r=<<v=<v=<<x=<< =<<<<<<<x=<=<<< <<<<<<=<<<<Z=<<<<<<<<<=<<==<=< ==<<<<<===<=<==<<<=<=<==<==<=<=<%=%=< === ===<=====<<==<==<=<#===<<=<=8==#=<===<<<========<8=7=8==7==>=:==3=8===,<<<<8=<=<=<=><1=8=l=8=<==>=+=<"=+=m=8=u=8==h=8=<3==="=&=Q=Q=<e<<=&=<1=,=<<?=?=,=i=8=A=<==P==8=b=8==8=P=A==l===m= =p==8==E=]==E=]= ==u=@==p=@==e=n==e===>h==^=^=R=>{==_=y=`={=><!==_=[==>`= >[= >a=X='=i=X='=>a=>>=>6=b=B==>=>>d=6==6==d=}=====6=>}=#>=#>=j=&>=&>'>'>=j=B=q==,>q=,>s=~=/>s=/>1>=1>==4>=4>6>=6>9>===9>:>@>=======:>=@>==D>===D>c====k====I>=c=I>===<g=o==Q>===Q>=k====o===X>=X>Y>====Y>=z==b>==z=b>e>===e>h>===h>==================u>===u>========{>={>}>=}>>=>========>==>>===><=====>==>==>=>>><==>=======>>=>=>=======>=>>=>>>>==== >=>=====:======> >>=>>">>>">=>2> >> >=>>2>>>!>=>!>=>>>A>>>=>=A>%>8>>%>;>=>>=>$>G>=;>8>=>$>>>+>>=O>>>G>=5>=O>>V>5>+>=>->=>>V>>>>=>(>S>>>>(>n==>>>R==>>Z>l>\>\>>Z>.>y=>[>=>i>=>=>>->>l>>H>n>>H>>>3>>>[>><>>>v>]>=>a><>>a>v>B>>>i>>>F>?P>F>>>>?>]>?p>>P>p>)>j>>x>s>M>j>R>*>>>R>>R>x>)>0>j>?s>M>*>??~=,>m>0>=1>=1>7>z>=1>?|>z>m>o>7>|>o>?>>C>>!?>c>3>n>c>?>!?t>+?>L>>r>C>t>r>+?>>J>>>>0?>0?>J>w>L>T>>>y>>L>>w>7?8?y>T>>T>>>8?>^>>>>7?>A?>A?H?>>>>^>>>>>>>H?I?I?>>>M?>M?O?>O?Q?>Q?S?>S?T?X?>>>>q>X?Y?Y?>]?>>>]?_?>_?>>a?c?>c?d?>>a?>T?>d?>m?>>>>>m?o?>o?>>>>>>>>>>>>>>>>y?y?>|?>|?}??>}?>q>>??>>>??>>?>?>??>?>>>>>>>>?>>??>>>?>>?>?>??>>??>>>>>>?>>????>?>>?%?????????&????,? ?1?? ?>>S>>?%??,?5????>9? ?>?:?:? ?????5??4????????(?.>>?n>>?E?&??F?E????*?P??*???F???/?/????B>>;?Z?9?5?[?\?=?E????[?^?E??;?-?>4?5??5?K?-?R>?>?>???5??E???=??K?p?3?>=?(?5?3???p????q????^??q??@w?w?~?@@??@@?@ @U?@J? @?"?e??W?'?'?V?"??J?~??W?@e?>+?@6?k?@f?k?r?r?2?f??@>?u?u?g??{?2?`??6???@??@????C?C??V?~?@w?`?~???1@2@1@?4@2@???4@?????<@?<@h?~??~?>X?b??A@i????>]?H@???H@A@?>c??b??????i?Q@?Q@S@?S@>o???V@V@?Y@?Y@????]@??_@]@?b@?b@c@c@???_@?????????l@?l@m@n@o@????????y@???@???n@?y@??o@???~@?~@????????@?@??@?@@@?@??@?@@?@@??@@@@@@ @@1?? @???@@?@@@@?@@?@@@@? @@??@@@@???@!@??@@-@@@!@???@@@??%@?-@P??%@???Z?? @?\??@0@@0@ @@@@@@@@3@9@@@@@@@@3@?@@I@@@D@@@@?I@@@5@=@@@D@@5@@@@#@@T@@@@@K@@???~??????????@N@#@@@@B@f@@U@\@@B@?@@U@@K@@@@>@@@9@N@@@@L@@@s@@s@?@@p@@@>@f@@{@L@f@{@W@`@}@AA`@Av@|@AM@Av@Ap@f@&@R@ AX@&@ Aa@ AZ@i@AZ@Aa@X@A@u@Aq@A@Ax@j@Ax@A%A8@d@r@6@AR@|@@@A@d@r@@8@#A%A@%A@t@q@i@(A)A+A@+A@@.A@.A/A@w@@@M@}@@z@@z@@z@Az@Az@Az@"Az@4Az@(A@?S@@@6@@#A@)A@BA@BA/A@DA@@?]@DA@JA@JA@@LA@@OA@OALA@\A@?m@@@m@f@m@W@m@}@m@|@m@@@YA@@YA@\A@@?y@?y@@y@@y@@@eA@eA@@hA@hA@@jAlA@lA@@jA@oA@@@@@@oA@uA@uA@@@@@@@@?@@@|A~A@~AAA|A@@@AAA@ @@A@@@@@A?@@@-@@?@A@@A@@AAA@A@A@@A@AAAAAA@@A@AAAAAAAAAAAA@AAA9@@=@@@AA@A@AAAAAAAAA AAAA1AA@A1A@AAAT@@A@@@2A@AAA AAA@AA!A2AA3AAA!AA"A3A$AA\@@0A6AA0AAA4AAAAGAA4AAA7A@@,A?@@5A7A,A&A A:A8AEAEA@KA@A5ARA=AA8AARAAXAKAAXAAA9A`AA=A AA`A AAi@ Au@ AA9AAj@ AAkAAGA@GAAGA:AEAdA>Az@ABADAFA}GAzHA AGA BdAAkAAkAt@#Aw@#A B-AAVAQABVA@)A@)A@)AQA-ABBAAvABAA>B"BBA(BBB>BBBVB+BWBBB+BBBBCB>C?C@CCCB@CBCCBBBBGCBBBBGCBBBQCB.CBQCAkBVCBAkBAkBVCZCBBBBBZC\CB\C]C`CBBB`CbCBbCBBBB]CBBBBBBBBBBBBBqCBBB(BBABqC*BB?CBuCBuCBBBBxCzCBzC{CBBxCBBB{CBCBCCCBCCBCBBCBBBBCBC CCBCBBBBCBCBBCBCBBCCCCCBCCCCCBBBCBBBCCCCCCBB$CB;BBBCC$CCBB CCCBBCC)CCC)CCCCC CCC CC C0CCC*CCCCB#CCBC,C,CCC#C=CC CC CWBBC CC C=CCECEC=C!C=CCZBBCBD?DUCCAD>DCmCCCC?DCCCCC-DC.DCCCADCNDCCCNDODODCUDCCmCCCCCUDXDCCCXDYDYDC\DC\D]DCCcDCCCB{CCCcDfDC]DCfDCCCCBC;DCCCCCCCCCpDCpDCCCCsDsDCuDvDCCuDCCCzD{DzDCCCCC{DCDBCCCCCDD0CCDCCCCCCCCCCDCDCDD DDDCDDDDCCCC DDDCD DDDDDDDDCDDDDCDDD=CCHCCICCvDCyCC DCDDDDDDDDCDDDCCDDDDD DDD"DCCDCCDD DD DC DD DDDDD DD"D D%DD DD DDDDD$DDCD$DDDD/DD/DFEDUE>FEEAFEAFaEEDFEDFEEFFEEIFEIFEaE,FENFENFEEPFPFEEETFETFVFEVFuEEXFEEZFEuEEuEDvEZFEXFE`FEwEbFEEdFwEEEEgFEEEEbFEEEFFEEEEEpFEpFqFEEsFEE`FEqFEsFEEEEEEEdFEFFEFFEFgFEFFFEFE FFFFFEFEFEEEEFFEFFEEEFEFFEFEFE FFEFEEFFEEF FEFFFFFE;EE0EEHEE0FFBFFFEFFE FFEFRFFrFFEEFKFFFFFEtFFFFEEVEEFFFFFFFFFFFFMEEFF&F FF&FBEEFFF?FEBFE0F?FE FEFFGF6GFGF:GF FEF0FFF-FEF\FE'F\F4F-FF'FF4FFERF@FEFQFFQF@FE0FFFRFFF2FiFF=FiF2FSFF=FFEFWFFrFFFFWFFFKFFEFnEFFrFGKFbEFEFEFEFeFHFGeFFRFGjFlF GjF G GF]F GkFGFGGE,FGGUFFFUF]FGFGGuFFGuFF5FkFlF"G~F"G5FFF:FFFE>F'G:FtF*GF*GFF.GFEFF.G0GF0GFF'GF~FFENFJFFENFF{F9G{FJF=GF9GF=GFFFF@GCGF@GFCGDGEGFFHGFHGJGFJGFfFEGFFFfFFFFRGFRGUGFFFUGVGFFXGVGFXGFEsF\G_GFFF_G`GFF}FF\GF`GFF}FFFhGhGFFFFFmGmGF FFpGDGFpGFtGFtGFFFFyGFyGFFFF|GFFFFG|GFFFGFGFGFFGFGFFGFFFGFFFFFFGFFFFGFFFGFGGGFGFGFFEFGFGFGFGGFGFGGFGFFFFGGFFGFGGGGGGGGFGGG/G1GGGG/GGG6GG2GFGGGFGG2GGGG3GFF4GGFGG4G3GGGFGGGF:GGGGFF6GGGFMGGGGMGGSFFG6GGFG!GG!GGGNGWG%G GHFFGNGlFF]FFG%GGHG/H}G1H}GKH}G>HGGAHGAHGGDHGDHF\GFHF`GF`GGaGGGLHLHGPHGPHQHQHGTHGTHGGVHXHGXHGGVHG\HG\H`HGGGFHG`HGxGG{GxGGdHFGGGGGdHG{GGGGGGGGGGvHGvHwHxHyH|HGwHG|H}H}HGGGHGHGGGGGHHGxHGHGHHHHGGGGGHGHGHHGHGG1GGGGyHGHHGHGGHHH HHHHHHGHHHHGHHGHGGHHGHHHH+HHH+H GGH H-HH HHH HH'H(HH'HHHHHHH HHH8HH@HH,HHWGGG@HHHGHHH,HHHH HGH)H?HHGGHH?HH7GGHHHGH/H.H:HHHEHHHH/H0H$HHH2HH.HH0HHHHHH/HH%HHHHKHHHH;H3HH;HSH%H3HH1HRHSHHRHHaHsHEH:HHaHGHHHHHzHkHzHHrHzHIkHIHrHHzHUHHII~H~HUHIIItHtHbHHH=HHHzHHzHHzH1IHHzHHzHHzHHzHHzHHHIzHHzHIrHHzH%IzH*IzH/IzHIzHHHH=HG>HG>H;IzHHH0IHGFHGFHGFHGFH0I1I2INHH{HNH5I^IzHH{H8I_IzH:I2IHIII>IIIIIKI!IH*IHI!IHHKI6IHIDISHHIDI6IsHHI;II7I4III9II\IYII7IIICIHIGII\II9IGICII^IH_IIIaI-IFI-IbISIIbIISIIbHIIFIIIPIIIaIPIVIdIVIcIVIIdIIIIIIcIfIqIgIAIIqIIqI{IqIIeIIfI&IgI+IgIeIVIWI&I J JrIlI&IJrIWIIqIJhImI+IJjIJJJItII}IqIJIIJJJJJIIqIIqIH=IvIIH=IH=IH=IH=IhIlIjImIIqIJ{IIJI2JvI2JIIJtI6JI6J8JI8J9JII9JI>J}I>JHZIHZIHZIIIHZIJIGJIGJJJIIIJJKJLJNJINJIIPJIkIPJIIIKJIIkIXJIkIIXJYJIIYJIIIHsIaJIHzIaJdJILJIdJIIfJIIfJIjJIjJkJIIIIIIIIrJHIHI IIkJIxJIxJrJIIIII|JJIIIJ|JIIIJIIIIJJIIIJJIJIIIIIJIJIJJIJJIIIIJJJJIIJJJJJJJJJJ JJJJJ JJJJJJJJJI$JJIJJIIJJ,JJ,J$JJJIIIIJIJJIJJJJJJ%J4IIIIYIIJJJJJJI&JJJJJ$JJ%J$JJAJ&JJ-IIqIIIIJI$JIQJI JIJJJJ JVIIJ#JAJQJJ$J#J$JJUJJWJAIIJJ+JJI(JZJIJ,JJUJUJQJ*JZJJ*JJWJQJJ7JJJ+JQJ(JQJBJ;JJBJHJ;J7JQJeJ;JJgJ;JJHJbJsJJbJJJJeJsJJKgJIJKIJKoJKoJJ KVJ K K}J KKK~JJ'JKVJJ'J\JJJKJhJJKhJKKyJKKK]JI8JJJ}JJ"KJ"K#K#KJyJJJiJ)KJ)KJJ,KJ,KIGJ~JJJvJOJJ2KJ2K3KINJINJJOJJJ3KJ\JJJJ@KJ@KJJJJDKJDKEKEKJGKJJIKJKIfJIfJIfJIKJ]JJJJTKJTKUKJmJJJJJJJmJJJJJJ`KJJJ`KaKbKbKJJJJJJJJJIJKJJJoKJUKJKJoKJKJJJaKJJJJJJJJJJJKJzKJzK{K{KJ~KJ~KKJJ KJKJJJ$KJJJKJ KJKJKJJKKJ KKKJJKKJKJKKJKKKKKKKKKKKJKKJJJKKJKKKK KK%KKJKKKJJKKK$KKJKKKKKKKKKKKK KK0KKKKKKK8KJKKJKK0K&K8KKK&KKKK!KK0KKKK:K!KK:K0K%KK+KNKWK0KKtK0KK+K;JJJJKHKJJJJJJYK0KKKK_KKKdK0KK0KK0KxK0K|K0KK_KK0KK0KK0KK[K1KK0KK0KK0KK[KKXKKXKcKKWKK:KK KtK9KiKK9KKKK1KKcKKKKYKLfKLfKFKKdKLiK KLiJ"KLLKKQKLKeK LK LLKLLKvJ,KLKZKLKYKuK\KLuKL\K4KgK4KL;KKLKhKKLKgKK;K"LLdKjKK%LJ@K)LxKLhK)L%LjK2LkKJGKJGK0KGKKGKLGK9LGK2LkKK5L|K5LK}K7LVKKLK7LKKVK]KKJUK4KKKKBLKBLKKlKKKKK]KJbKK^KJbK^KKKK"LKULKKlKULKpKKKYLKYLKsKyKKKKKyK_LKwK_LKKKcLcLKJK KKKKKKpKKwKKKKsKKKKqLKqLrLrLKKKuLvLxLKxLKKzLuLKKKvLKLKLKKJKJKzLKKKLKLLKKLKKLLKLLKKKLLKKKLKKKKKLKKKKKKLKLKLLKKLLLLKKKKNKKKLLLLL L LLKL LLLKLK!LLLLLKLLLLLHKKL&LLKLKKKL9L LK-L LL-L&LLLLLLLLLKLL#L*LK$L*LLLFLLLKOLLLKLL$LL9LL9LLOLLKNMN2NNN2NNNNNM!NNNNN+N5NN+NHNKNNNHNNNN NM>NMNMNN5N*NMNMNJN=N!N>NMJNN?NNN?NN+NN8N8N"NNM_NM^N_NKNMN^N"NN-N&NM+N&NNN-NNPMNNgNNNMNNiN7NoNN7NNNNhNhNoNN:NNN\NgN=NiN=NANNcNANNcNINSNOOINOSNNtOOpNOOnN:NoN ON O\NoNnNUNNUNrNUNNUNNUNNUNNUNNUNpNoNNNONOOrNOdNNOaNNOdN"OaN"O$ON$ONN&O)OzNzNN)O+OsN+OMGN&OrNMGNNqN2O2ON5ON5O6O7OTN|NNNNTN|NN6ON>ON>OZNNNZNNNBODONDONNIONMbNMbNIOMbNBONNfNOONfNNOOPOsNNPONNNNNUONNXONXOYOYON[OxNNNNNxNUONNNaObOeONNNeOaONNN7ONjONNMNMNbONoOMNNNNNNNNNONNNONNN[ONHON\ONVONjON~OOOONOOOOOOOOO]ONRONtONoONONOOONNNNMNONONONOOON~ONOONONONONONOOOONNN%OONNONONO%ONNONOOOPNOOOO(OOOOO O*OOONNONOO#O'OO OO#OOOOOOOOO'OO-OOAOOCOFOOOCOOAO-OEO.OOOOLOOEOOKONO/OSOOKOOO/OGOOOOGOQOOONNHOOQOOOO\OO4ONdO4OJON8OJONVONdOUNONO0POPOLQOQOLOSOO8OON OOOOO?O?OcOOOVOO]OOwOONOOVONOMOwOO\OOVO PMO P PO]ON&O PROqN&O_OrOP_OPPtOP^OO0OOO0OP^OPPOPN7OPOP PgOfO$PgO PO$P&PO&P'POOOOTOO+P,P'POuOO,PO1PuO1P}OO+PO7P}ONOONOO7PNOOWOOOTOOWOOOOWOBPOBPCPOOEPOOCPOEPOJPOJPNPONPOPOPOSPOOOSPVPOOOVPXPOXPYP[PO[PYPO]POOOOaPOaPcPOcPfPOOOfPgPgPOiPkPOkPOOmPOOOOOOmPOuPOuPxPOOOxP{POOO{POO}POOPPO]POiPOOOPOP}POPPPPPPPPOOPOPPO PPP(OOPPO*OOOOPONO'OO-OOFOOOPPPPOPPOOPPPPPP(POOPOPPOP.OOSOOO"PNOOP0PPOPPO0PP0PP0POO(P0PO"P#P0PPQQDQQQiQyPQPQ>QLQQcQLQ?QZQQiQLQQLQdQUQQ7QvPQQQ?QPQvQLQQLQQLQeQQQdQ7QeQQLQQLQ RQ RQ RQLQQLQFQQ R/QRQwP&QRQWQP-Q[Q/QQ[QRQR"RQsQQRRsQRnQnQQQQRAQQ!R"RfQQQ~Q!RfQ'RQ'RQAQ*RvQ*R+RQFQQQ1RQuQtQ+RuQ1RQQPMQPQvQQPQ8RQ8RQPQQQQQTQQQTQ?RQ?RARQARBRCRDRQ^QDRQQQPaQPaQ^QQMRQMRORQORQRQQRQQQQTRQoQTRQoQQqQQQQZRQqQZRQ]R_RQ_RBRQ}QQQ}QQQQQQQQQhRQhRQQQQQQQQQQpRQ]RQpRCRQsRQsRuRQuRQQQQQQQQzRQQQQQQzRQRQQQQQQQRRQRQQQRQQRQRQPQ RQRRR+QQRRRRQRRRRRQQRRRQQQRRRRQQ RRQRQQQRQRQRRQQRRRQRRRRR$RRR$RRR2RQQ2R#RR RR%RQQ RR%RQRRRRRR RR)RRR)RR RR&R0RR]QQRRR&RRR RRLRRLRRRPRRR4RRPRZQQUQQRRJRRRR,RT=TS>TTTTFTSlSSnSS$TKTT,TKTT$TTHTTHTT,TdTT6TdTT]T]T[TT6TTbT^TTbTTITTTT%TgT[TTYT8TUYT^TT4TET^STSTSTJTOTSTUUUuTUTJTHTETgTMTuTMT8TTITdTTQTOT%ToTMTUTUrS*T2ToTU`TUUpTxS/TS/TS/TT/TET/TKT/TzS5TmT2T`TmTUUtTUpTTS;TtTTT{TTTTTUgTTTTT+UTTT+UTT.UT.U/U}TTwTvT/UwT4U}T4UTTRTTTRTTTUoU>UUUUU{UUUoUU~U~UUHUUjUHUVUaUUUU{UU{U{TU2UKU VjU V V VUVUUVU[UaUUUvT.UT.UT.UFUaURUaUVUUUVUUVUVVVUUU"VAUUUhU'VUhUAU'V+VlUU{U"VU+VUUUUUU/V1VU1V2VOUUULUUOU6VUU6VU9V;VU;VUUUlUULUUT\U/VUUUUUUUHVUUUHVUUUUUUUUUMVUUUiUPVMVUUUiUUPVUVUVUYVU!VUYVUtUUtUUtUUtUUU`VU`VUUVUUUUUhVUUU VUhV9VUVUUUUUUUUUpVUpVUUUUVUVUTU4VUtUUVUUUUUIVUVUUUUUBVUUUUUVUVUUUUUUVVVUVVUVV VVVUUVUVVVVVU VUUUVUVUVV VUUUUUU!VUUVUV VUUVVUVUVVUUVU VVUVVVVV%VUUVV%VVVVUVV0V0VU3V5VV5VUVVV3VUVV,V*VVV,V#VUVVV VU4V V#V>V?VVIVUIVV>VVUVVVEVVVVVVVUBVVEVU.VXV>UUUUUUUUU.VUU?VUQVXV-VUfVXVVUFV-VVFVVVQVVDVjVVDVjVV\VXVVfVVJVUVVVV[V~VXVVVVVXVVJVVVXVVXVVgVVW_V_VGVWWOVWzVuVWzVWgVUVOVUVVXVVXV)V\VVXVVXVoV)VV)V}VoV7V}VVnVWVVXV&W\VU2VU2VXV2VV2VV2VW2VnV7VWVV=VVU;ViV=V%WVViV%W&W(W~V(W*WV*W,WV,WVV/WV/W1WV1W3WV3W7WVRVVVV7W=WVVRVUPVVVVRV=WZVVVZVVVBWVBWDWVDWFWVFWIWVVVIWVbVbVVVVVVkVVPWVPWVVVkVmVVVmVUWVVVVVVsVVVsVUWVVV^W`WV`W^WVeWVVVeWgWVgWVVVVjWVVVVVVVVVVVVVVjWVsWtWsWVvWtWVVVVVVVVVvWVVVVVVVVVVVWVVVVVVWVWVWVVWVVWVWVWWWVWWVVVWWVWWWWWVVWVWWVWWWVWVVVVWWWWWWWV*VVWWWVVVVVVW'WWWWWV'WWVVW"WWV W+WWWVW"WWW+WVWWVWWWWW WWWWWW;WWW;W-WW)W.WVJW.WVAWVWWJWWV)WWGWW4WAW?WWUVVWGWVWWuVVV4WQWW[VVOWNWWWOWW?WWVGVVWNWVW?WWWVWWWWQWHWfWRW]W WHWWpW_WWQW]W WWRWWpWW@WiWW@WWWWWWdWEWSWWWEWWWWKWWdWCWmWhWWmWWlWuWWW XuW X XcWlWKW XaWTWXXnWkWXaWXV,WXYWoWXYWoW0W}WWX}W0WnWXX:WWcWhWqWWW:WrWW9WrWW9WWWXqWWW(XW(XWWVDW,XW,XWW.X.XW0XWxWWWWxWZWWWWXWW8XW8XWWXXfWWX9X_WWiWWSWWX)XUXXKX*XUXX>XUXXXEX XX>XKXUXXEXCWWhWWXX4X3XX?XCXX4XX6XX XXXUXXkX3XX]XXX?X6XUXXX]XTW XkXUXkWXXXXMXvXWXWXWXvXXYMXYYxXUX\XUXYxXYsXUXYkXQX$X}XQX'X}XZXuXYZXXUXuX'XYXUXY\XYYsXxW0XW0XUX0XX0XX0XX0XYY$XxXYXXfX YXgX YXBXXXdX'YXgXAX'YdXBXXmX*YmXDXDXXXX*YX0YX0Y2YX2YPXXXXWOXRXXXwXwXRXzXPXXzX;YXXWWX>Y?Y^XX;YX>YXXX?YXFYXFYX^XXXKYXhXXKYXXXhXXXXXnXXAXXXXXnXXYXXXXYXX\YXXX\Y]Y^Y]YX^YXeYXXXXXeYfYfYXXXXXXXWXpYXpYXXXXXXXXvYXvYxYXxYyY{YX{Y|YyYX~YYXXXXXYXXWXXX|YXXX~YXYXXYXYXYXXXXYXYXXYXXXXXXXYYXYY YYYXXYXX XXXYYXYYYXYYYYYYYYYYYXYYXYXYYYYYYYYYY1YYXXYY1YY.Y/YY.YYYYY#YYYY(YYYYYYY Y5YGYY5YYCXX(Y/YYXYY\+\\[ \\[\[@\\&\\[@\\&\\[\4\9\\4\\\+\[>\9\[\[\;\J\\[J\;\2\\2\[[\3\[0\3\\0\\\"\\[W\W\P\B\[\\\1\\(\1\B\\S\F[\"\+\\\M\\M\-\]\\C\]\\T\m\\T\\o\o\8\\S\\C\E\:\n\m\8\\\E\\\n\!\n\\\\\\:\\(\P\]\\I\]b\]b\L\V\U\]V\\m\p\!\]\\p\]y[)\S\P\.\\5\\Y\.\\Y\]~\~\q\]]\]]q\5\]\{\\ ]{\ ]#]\[=\#]$]$]u\(]\[A\(]u\\\m\\r\\m\\\Z\\\\[\\\\r\N\\N\\N\\\\N\9]\9]\\;]<]?]\;]\?]\Z\\\\[\<]\F]\F]\\J]\\\J]K]L][h\\g\\\\\L]\l\\g\\\l\V]\\V]\\\\\\]]]\\\]\\\b]\b]]]\d]e]\\g]\\\\\\\\e]\[\\\p]\\[\g]\|]\[\\\\\[\\\\\|]p]\]\]\\]\]]\]]]\\\]\]]\]\\\\\\\\]]\]\\]\\\\]]\]\]\]]\%\\\\]] ]]]\]]\\\\\]]\\&]*]]&]]]]\%]%]+]\\\\]]']\\']]\]]]] ] ]] ]]]]"]5]]5]]+]]"]]]]\]]]D]]]]A]\=]A].]-]-\\\.]\=] ]]B]-]>]\]]M]O])]>]])]]M]]B]]D]5]Y]C]]Y]]I\\U\\ ]]Z]]Z]L\]Z]/]Q]/]R]/]]]/]]6]3]q]/]]6]]]Q]]f]W]h]X]X]]]f]]h]]]t]l]]^v]t]i]\]\]v]l]^^^R]^^^] ^q] ^w]c]^w]^R]u]]^,]u]^c],]^]^^^4]]]]^y]m]4]x]m]j]]^j] ^x] ^]:]:]]]]y]]z]](^^u](^z]G]]]G]r]]\F]\K]6^r]\K]\K]\K]6^]]]];^]]];^[]]]]]]A^]]]A^E^]][]]_]E^F^]]H^\d]\d]]d]+]d]5]d]-]d]_]]]]H^]F^]]]U^]U^]]]]Y^]Y^Z^{]]]]Z^]_^]_^`^]{]`^]]]d^e^]]]]d^]e^]]]\]m^]m^n^]]]]]]n^]]]u^]u^]]w^]]w^]z^]]]]z^]]]^]]]\]^^]]]]]]]]^^]]^^]]]]]]^]^*]]]]]]]]^^]^^^^^^ ^]^^^^^ ^^^ ]]^]^^]^^^^^]^^]]^]^]^#^^)^^#^]]^4^]]4^^^^^^^O]]^]^^^!^C]]^?^]?^'^ ^#^?^/]]]]]]]]]]?^]^'^^^3]]^=^^)^?^^%^?^^^^^%^W]]$^?^^$^i]]1^?^^^^W^?^^%^^1^^W^^1^^^)^^Q^2^^Q^G^2^@^2^^i^2^f^[^X^2^^f^^^G^^^^@^^^X^]^]^^i^^y^c^_y^_x^{^b^{^^{^_x^__^{^^{^|^L^^{^^{^^{^_|^^{^_x^____]^]^\^^{^^{^_^^{^^{^__^{^_b^^{^g^}^$_^$_^l^_g^(_^(_)_*_)_^._^^{^._^~^0_1_0_^3_^{^5_^{^^^8_^{^8_^5_^>_^?_^>_?_@_^^^^^E_^^^^E_]`^I_^]`^I_1_^M_^M_N_N_^^^T_^*_^T_@_^W_^W_X_X_^\_^\___^3_^__a_^a_b_c_d_e_d_^g_^^e_^l_^b_^l_g_^p_^]^p_q_r_s_t_c_^s_^^^^^^^q_^t_^]^_^_^_^^__^_^^^_^_r_^^^-_^_^_^4_^2_^___^_^__^_^]^!^^_^ ^^_=^^____6_^__:_^_^____^_^__^^^__^-_^^___^__________2__4____2____________7_______6___A_2^^{^^^^f_^_^`^__[^^_!__C_A_D_`_9___`_^_H__^_!_7__c^^C_7___L^__u_F_\^_G_f__G__:_F_ _j_;_ _j__u____h_f__f_J_k__J__o_O__f__f__f__o_}^_``_h_x_L_l^$_~_f__}_`__f__f_`~^*__f_`x__f__f_``__f__h__f_^5_``w__"`_`i__f_"`#``h_`w___'`__'`_+`_+`i_}_#`n_1`__}___1`3`_3`^N_5`__5`_9`_9`;`_;`<`@`~_<`_n__@`A`B`F`_A`_B`_F`G`H`H`_J`K`^g_J`_O`_O`Q`_Q`__T`_T`V`_V`W`X`X`_^s___\`G`_____W`_c`_c`__\`___^_^_l`_m`_l`m`__p`_p`r`_r`__t`v`_v`x`_x`__}`___t`_}`K`_`___```__^_``_____`_`_``___`_`__`^_____`_```__`_`_``_```__`_```!`_```_7___`D__9__H___`````` `!```_` `````!```_``&``__``````` ` `` ``` `````C````(``````;__k__O__C`S``7```(`S`$```D```7`S``$`)`I`D`S``.``)```L`a`e``a``e```L_`}_``_``L`_`2`h``2```f`8``f`.`S```U`y``M```U``^`M`h``g`z``L`S``L`E``g`E``M`j`z` aj` a^`h`a~``a{``,`Y`i`,`Y`/`~`a[`n`/`[`n`{`h`a_5```a`a a=`q`"a a|```w```=``=`"a`*aw`*a,a`,a``.a.a`0aN``Z``3a`N```3a`7a````````]````_``Ca````Z`Ca7a``_``]`Ia`IaJaJa`Na`NaPa`Pa|``Va`_m`q````Va_m`Xau`````u```````_x`````ea`ea``ga``ga`na`Xa```na``ra`ra````````xa`xa``````````````````a`a````a`a_`````a a a`aaa`aa``aa```````a`&````-a``aa`aa`aa``aaa a`a ``S``h``i``````a-aa a!a````aaa aa`a`a(a`a`-aaa``aI``(aa`!aa`a`%aaa%aa`aa aaaa a`aa5a5aaa`#aaKaa``&aaa)aAaa)aAa`aa+a8``y``a#aKaaLa&aKaaaa`aaaaaa\aaaa\a`aQa1aa/aaQaaa2ajaa9asa]aa2a9ajazajaasaakaja]aamacaama{ajaaazaajaa+aKabkaLaKabWahabbWa b{a b b baa~aba_ajabbbyayajab_a`0a`0a`0a`0aKa0a`a0a/a`alajabblab!ba!baiadaa%bda%b'ba'b(b(ba+ba+bvaEa|avaEaa0b|a0baaOaaaaSaaaaaaaOaaSaaa;b;ba?ba?b@b@baDbaaaDbaaFbFbaKbaaaKbaaNbaNbQbaaaQbRbSbaaRbaSbaaaXbaaaaaaaaaa_ba_bbbaXbabbebaaaebhbaaahbibibaaaaaaaaaaaqbaqbsbasbtbaawbawb`aaa`aaatbaaa~baaaabaaabbaababaaaa~babaaababbbabbbbaaaaabaaabbbbbbbaabbabbbbbb"bbbb baambabbabbaababba2baaaaababab-b-bbbbbbbb b"bb2bb)bbbb)bb1bbababba2b1b,bbb1aajaaaaaaaaaabObbbMbPbHb4cMbBcMbbPbldMbeMbZbLbhMb)iMbcaaqiMbkMbkMbkMb pMbbcbbWbpMbbZbpMbrMbHbbhabb!rMbLbb7rMbqrMb~a b~rMbuMbuMbuMb1wMb;wMbb`bFwMbwMbxMbRxMbbObWbbxMb1zMbbTbYyMbiabTbobjbobCzMbcbWbcjbbobMbckbb^bbc^bc.bkbubb/bub`bWbb.bdb/bccvbvbdbab3b3brbcrbfb clbabnbb#c cb#cnbclbbmb.cpbbAbAbbpbbaDb.c/c3cbbb/cb3c4cbyb7cb7cVbbYbbbbbVbbbaXbbYbAcbAc^BcCcbbCcbIcbacbIcabbbbbgbbbgbbaibbbbbbbbbUcbbbbXcbbxbbbbbbUcbbxbbbXcbacbcb}bbb}bbbcba~bbbkcbbbkclcbbocbocbb"cb'cbbbbbbbbbabbbcblcbbb"bbbbcbbbcbbbbbbabbbbbcb5cb6cbcbccbabWbbobbbbbbbbbc cbbbc cbbcccccbcbcccccc ccc c!c$ccc!c,bbcbb"ccc%ccbcccbb&ccbcc%cc'ccbccb&cbbccccbbc)c(c,cbb)ccc-c,cDcbb-ccc*c*cDcc5cccccc6ccLc:cGc0cGc8cGcc:cZcGccccc0cccc8ccZccEcEcGcc2cb+c2cc=ccc`c`cGcc+ccJc_c9ccbEc1cFcc1c_cc=c9ccJcbcbcfbcecGcccecccccNccHcccddcKcfccHccKcddcc dScmb#c d;cVcvctcSccVcc>cvcchcddcNcfcgccdddc^c@ccyb4cb4cdgcddcdpcd#dcdrctc;c#dhc>cic@ccicc>cbBcGcBcfcBccBccBcdrc.dbIcbIcrccccPcccPcpcc~ccQc~c:dcQccc:dc[cc.dcccccc[cc]ccccccccc]ccLdcLdNdcNdOdccOdcccTdcTdccVdcqcccVdcwcccc^dcqcc^dcc`dcwc|ccc|cc{cccccccjdc{ccjdkdldcc`dccccc0dcdccc6dcBdckdccccccccc{ddcccccccddcccccdc$ccccccdcc{dcdccddcdddcccddccccddcddccdddccd(ccdcddccccdcddcdd(ddd(dddcd d+dddcdcd ddLccddcdc/ddddd0d9ddc9ddddpdd>d dhdmddhddUdSdSddd^cd dAddUdvdaddPd"dvdebdfdebdewdead dfd"d eid e eid eedZd)dedPdYdXdd_ddZd)dYdddd_dedeeedede e e|d#ed#edd~dd'e~d'e)ed)eddzdnd/ezddd/e2eddd2e9esd|ddsddcOdddcOd9e:ecdd[dd:e}dddddBedd[dBe}ddDeEeHedDedHedcdddKeOedKedEedOeddcldPdlddldelddld%elddrdrdduddduddd\e^ed^e`ed`e\eddddeddeddfehedheddfedddddddoeqedqeddddoedddcddddddd+dd|ed|e}edd}edddedeeedddddddededdddddedddeedd/ddeeedeeddedeeeedddded ddeeedeededdeeeddeeedeeddeeed,e3eeddd3ee6eee(e e,ed6ede(ee1e%ed1ee*ee*eddee-ee%e;edde-e;eeeeeedddeIeemddeddIe.eQeeee.e]e"ee"ee"ee"e4eSee]ee"eeQede,ee]ee=eeeyee>eemeAefmefZexe!eCeCegefZefyePexe!esee&ese fNef]e fae&efNeaeAe+ege+ee+ekee5eke{eXef{eff]efXe5e7eed2ee7e fwe fweelee#f@eieieee@e#flee?eFeeee?eeeFe.fe.fdHeJeeeJezee4f5f6f4fze8f8fe=fe~eRee~e=f>f@fe@feeeeGfe5fed`ed`eGfee6feece>feceeNfeNfOfeeeeeeueeeeeeOfeReeeefeeuedfeee^fefe^feeecfeed}ecfehfehfeeeekfeeofekfeofbfeVferfsfvfeeesfeeemfetfeeefe~fe~feerfefee{feeffefnfefeeefeeeDfeRfefefe%feeeefeeeffeffffeeeeffef eeeeeefe fef fffffefffffffeffffeffee%fff"eeeefe+gezgegee%ffffff fSee f0ff0eef+fffff?f0fe+feeffDfefffUfDfHfeAfef?fHffff=eeff1fBfe1fAf7fBfffUff7ffeCfCfDfSfePfe2fSfff2fffEfPfFfDfIfRffEffffFffIfffdfffefKf:ffKffHf:ffQffflfg\flfQffIfJffgLfff\fJffdffffgLfg g gbf gef ggVfggvfg,fmfXf,fpfXfgfdfgtfgpfgxf_fgxfgfdfgf_f9fg9ftfMf{f&gffife>fe>f&g'g*gf'gnf*gTff.gfff.g/g/gf1gifMffzf4g4gfeOfffeOfeOffTfffffffff@gf@gAgffAgfffEgEgfHgfHguffffffffffRgfffffgfRgffffff1gfYgfYgwfffuffuffwfffffbgfbgfffffgffggg"gfffffffmggfmgfffffsgfsgugfugggfffygfygff{g|gffgfggfgfggfffgffgfggfg{gfffffffggffgfffg gffffff ggggffffffgfffgfggggg"ggf|gfggfgggggggg+ggfgggfggf+gggggggfgg+g3ggggggggg+g g=gfgggg3gg ggggg=gfg5g>gf5gg+gggg,ggfg$gFg?g+gg$ggggMgg?gMg+gg>gfCg+g2g+gg>gBgTg,gfgBgggFgfGg+ggPggCgggg2ggGgg[gdgg[gggrggggrgdggwgPgTgwgzgtgzggwgigzgghgjggtghhgjggh^gzgegzggGgkgzg hig h\gqghh\g(g^gg(gZgghZgh6gegzf1gh_gxgh_ghkgxg6ghhgh8ggvg8g"h"hngDggglgngvgf@gf@ggzg~gDgg~g/hg}gIgggIggzggg6hg6h7hgzg/hggzggUgUgggg@hg7hg@hDhgggggDhggoggGhggOhgMhgGhgMhNhOhNhgggRhRhggoggogVhVhgYhgYhfugggggggggehghghghgggehf|ggghhihggihggggggg,hggggghgggggzhg*hgzhhhghghghhghgghgghgggghgghhghgfghhgghghhgg hhghghIhggghgghghg hggghhgghhhh=gghg-hgghhghh h-hhh hh hg,hhghhhghhhhhhhg hhhg*h hg#h hTggh#hh3hhhgh3hhhgh9hhghg*hhIh9hhhBhgFhFhhShh?hgdgg8h?hh2hg8h:hgh2h:hhShhg\h\h!h+hghUhUh+hXh%hhXhh]h(hTh+h hThh]h%hhhChJhQhWhKhWh(h hhQhqg hhChrhPhjhWhhrhhJhhhKhPhhhiohohEhiHhhhjhhHhlgh$hh}ghiuhiuhkh'h_hkh$h_hWhh'hiZhhhhihiibhiiZhhvhihi4hshshhh4hg7hg7hihibhhfhhhh%ifh%ighh(igh(i)i,iyhyhh,i.ih.i/i0i4ih0ihhxh4igOhgOhhh9ih9ihhi~h>i/ihgYh~hhgYhhhEihhJihhhJiEihhhghhhhhhRihRiSiSihUihhhhXiYiXihYihhhwhhhhhwhhhaih{hci{hhghaihhhghhhmihcihmioihoihhqihhsihhsihwihwiUihhhzihh~ihzih~iihhhihhhhhhihihiiihhihih ihi ihhiihhhiihiih ihhhiiihhihiiihihihhi@ih7ih*ihMihhhihbihdih;ihiiirihQihi iii ihh!hhWhhhhhhhhiiihi:ii iiiii@ii iih@ii iihii iii2ihi2ii7ihi iiiiFiii!iiii!iiii8ii*iFihih8i$iiihh7iEhhh7iiMii7iiiibii3iiidiNi3ii;iiNiih@iiriOi\iiOi=iniii=ivhiiQii\iiiivijiiniiiiHiiQiHiijjj}ij j jh%i jti jjh)ih)ih)ih)ih)iiVixh0iviyi}iyitiyijjij{iyi j{ih9i$jih9i j{ih9i$jipijipiAiiyiiyij{ijvi.ji.jiyiiyiPiiiyiiyiiyiiPi7j7jiiijj@jjnjXjjnjjPjgjjsjgjksjkkk[j kxjjHj3j#jej#j;j#j>j#j kXj#jxjUj[j`jYjtjk+jYjk`j+jjUjyjzjk|j1j1jyjj|jkjuj{j5jujj5jjj"kj"kAjjCjjjjjjjAjjAjjCj,kjjj,k}jjjEjEj}jjj4kjkxj4k5kjj:kjjjjj:k=kjjj=k@kjKkj@k5kjjjDkDkjHkj]kjHkjjJkKkJkjjjOkjOkjjQkQkjjjUkjUkjjXkjXkZkjZk\kj\k]k^k^kj`kak`kj~jjj~jjjjjhkjhkkkjjjkkjjjjjjijqkjqkjjjjtkjjjjtkjjj|kj|k~kj~kjjjjjjjjjkkjkjkjjkjjjkkjkakjjjkjjjkjjjjjkkkkkkjjkkjkkkkkjkj kkjkjkj kkkjk&kkkkkkkkkkjjjkjkkkkkk*jjkkkjjkkkkKjjkkk?kkkkkkkkkkkBkk&kkkkjEkkj;kkj;kk%k%k!kk!kjj*k'k>kk&kBk&kEk&kk'kk#kMk*k&k>kjk#kkkkkkCkk*kTkckkCk&kMkkbk+kUjkjkjk kk&kkckkkTkkbkktj kmkYkkmkkWkzjkkk{jkfkkWkfkXkkGk$kIklklklllkNkk}kGk$kkRkkRkkRkkRkkRkkRklkkRklkllek2kkl_k2kik_kllykFkkllikllk.lkkjKkjKkjKkjKkSkkek}kkPkdkkkSkkklkkHlkBlkBlokkGlkkkjakGlHlkklkkOlkkdkkgkkkOlkkklkTlkTlrkkVlukkkrkkokVlkkukkk]l]lk_lkkalkkalkj~kkk_lkkkjlkjlllkllkkkkkkkkrlkrlkkwlkkkkkwlxlkkkklkjkkkkkkkkkxlklkklkkkk kklklkkkllklkllkkkjkkkkkkkkkkklklllklllllkl#llll!ll!l?kkk#llk*l!lfl!llkql!lcl!lk$ll!ll!ll!ll!l|l!lk*l$lklklllllll!llk-lk^lkllIkkl!llll-ll!ll!llll!lMl-l+kkYkkl!lll!ll!ll!ll!ll!ll!llMlk*lk*llm!ll!l%l lm!llm!lOm!l(l^ll(ll%lRkk!lkjmknk[nknkNkll lfl l;l0l l}kl;l0lPl lslPlllslllqlClpllCllplllllclm"ll&ldllqlmclmldlLlLl"ll"lSl&lblSl m5llll mblmlmm1lllUll1lmolollml5lm\llfl\llm!ml!m"m"ml$m%mgll(mgl(m)mtll)mylFlllFlkHl/m1m|l1mllQll/mtllullQl$ml;ml;m=ml=mll@ml@mllCmlCmDmk_l%mlJmlDmlyllJmMmlllMmllllklllklkllllTm[mlllTmllnlnllll[m]ml]mllzll`m`mllzlllllllhmlllhmkmlllkmllllllomllrmlrmumlomlumllllymlymllll}ml}mmlllmllllllmlmmlllmmmlllmlmmmllllmlllmllmmmlmmmmmmmmmlmm mmmmlllmmmmlmlmlmlmlmmmmmmmmml#m+m+mlm#mlmmmmmmmmmm ll0m*ml0m2m,m,mlm2mmm>mmmmmmmm>m*mm.mmlmmImm3mEmlmmImEm&mml4mmlmOm.m*mmm&mmWmmm7mUmmm*mmQmem6m5mm6m9m5mm9mmQmmammm3mmbm4m3mRmamm7mmRmmmZmWmjmmgmbmjmgmLmmUlmLmmZmjmlmjmvmjmqmjm-mlmnpmfmmjmn nmjml%m nnpmmjmnqmnnmfm-mmwmul1ml1mmjml1mmjmn nvmmcmmjmmjmAmmmjmmjmnlm/nmmAmlCmmm.nmlCm nvm.n/nKmqmmKm2n8nmmmmKmmm2nm8n9n9nm;n;n~mVmm~mmmVmAnmAnl]m^mmmmm^ml]mmmHnimmmmHnmNnmmmNnmmmimQnmmmUnmQnmUnmmmtmmmmmmmtm\nm\n^nm^nmmzmmmzmbnmmmmfnmfngngnmmmmmmmbnmmmmmlmmmmmmmxn{nmxnm{n~nmmm~nmmmmmmmmlmmn mmnmnmnmnmmnmmnnmmnnmmmnmnnmmnmnmmnmmmmnnmnmm*mm3mmmnnnn%nnnnmnmmmn,nnmmnmnmnnnm%nnnnmmnnn nm$nnCnn-n nn-nnm,n+nnn+nnmn5mmUmmnnemmnnnn$nnnnnnmnnnmnCnnnnmnBnnnInnn0nVnBn[nm0nanmIn[nnCnnPn=n[nm$n:n[nyn[nPnann=nn[nmn[nnMnnn:n4nn]nMnnOn4nn]nnOnn[nn>n>no+ooniononooVnno>oonoo#oo#onoo-onoo?o?o-o@o/oonoooo@oo5oEoo5oonoo'oo&o8o'ooo(oo&oooQooonQo)o;o]oo;o0oLooo0o]oo8oooNogooAogofoooAoBofoooXoooGooBonooqonooqoJoooCoJooCooxo oPoPoyopwowodop!oioyoo pWoWoHodo oHo!o pZ poRopo{oRop4oooRo2o{oouopsovopsopopn.ouo2ovo4ooopopoomo p pootoookooo'po'p(p)p*p)po|oo-p.p(pto0p1pzoo1po.p|o0pzoMoooMo*pooo-ponVoooYooooBpooYoBpooGpoo[onaoGpooJpoJpKpeoooooeoKpooo\pooooo[ooYpoYpZpoo\pZpo_po_poobpobpoodpoodpooooooompompnpooppoooopponpoooooxpoxpoooooooooopopoooopoooppopppopppopopppppooopoooo pop ppppo ppono+ooooooppooppopppppp poppo$ppp$pp/oopojppp3ppppopo2poEooppopppopo2pp^pp>ppo]p7po@pApAppp@p9p7ppp9pHppipNppRo po po po pQpNpo ppipfpHppfpppQpppqQpp]pOpappNppOpPptpqtppmopko ppNpvpNpRp|p qpPppNp qRp;p`pXppqXpqqCppp[p=pp`p|pqppepqzpzpcpq?ppppp;p"q#qep=pp?ppp#qpcpCp"qpEpvp}pEpp}p.qp.q/qoKp/qpppLppoKpwpLpp{ppwppp9qpp{pSpSpppTpTppppppCqpCqgppIqppppp9qpIqJqjppLqpgppppjpWqpLqppkponppponpppWqXqkpppppqpXqpppppqppaqpaqbqppbqpopppgqhqjqpjqlqplqpppqppppqgqppppptqppJqphqp|qptqp|q ppoppppppppppppppqppppqpqqppq ppqpppqppppqpqopNppppqp$qpTqppqpppppqqqppqpppqqq qqqpp'qq)qp qpqpq)qqqqpqpqqq'qqp0qq qpppq qq-qqq q0qq qpq&q-qqpq&q qq:q$qq:q5q$qqq5qqpqMqpq;qMqq;qPqp?qPqq$qq?qp!qqqFqqqqq!q$qqAq,qNqq,qappqAq%qSqEqFq$qqSqqq@q|pq@qTq[pq=qqqqQqqUqQqTqUq=qGqTqqqnqkqqnqqGq~qqr]qVqTq]q~qrrRqOq*qVqr1q`qrRqoqYqrroq rrqp"qZq[q`qTq\qTqYq*qrcq_q{qTqr3q{qrZqq^q r\q[q1qdq3qrtrrcqeqdqrrqq!r#rq#rreqqqfqqqqiqDqqqDqxqq-rxq-rrqq0rrq0rqq3rq3r4r4ryqyqq7rq}q9r=rqq}q9rq=rpXq?r?rqqqCrqCrqqmqqFrqqpbqFrqpbqpbqqqOrqOrqqQrQrqqmqqqVrqVrqqqqZr\rq\rZrqqqqwqwqqqqdrqdrerqqhrqhrqqqqerqqqqqprqqqprqrqqsrsrqqqvrvrqqqzrqzrqq}rq}r~rqqqqqqrqrrrqrqqrqrqrqrrrqrqrrrrrrqqqrqrqrrrqq rqqrqrqrqrr qq rqrqrqqrrr%rqqq%rrqq%r"r%rrr$rr%rrrBr%rr%rr%r'rqrr%qqNqqEqqr"rr'rr"rrrr%rrrrrrr%rr%rrBrr%rrBrr+rr%rrLrrr%r+rDr/rUrr/rrYrqqPrrBrkqqr%rr%rr%r2rYrrrBrr%rr%rrBrr2rOqrLrDrrErr5rjrrr5r^q r_q rPrUrrr@r`rr@rrrnrr>rrSrXr[rrfqrErUrrSrr[riq!rq!r srq!rq#r ssorssror[rsrrwrssrrsursrr^rss#s{r}q7rq7rq7rq7rq7rq7r{rr#surxrrr'sqCr'sryrr-syr-s0srrr0s1s|rMr3srrqOrr|r1sr3sr=srMrr=srr?s@s?srrr@srarrq\rr_rrrHsHsrrarqhrOsrOs_rrQsRsQsrUsrUsRsrqqrrtrqqrqqrtrrqvrrrasrasbsq~r%r~rs~rs~r/t~rt~risqrrrmsrmsnsnsrrsrbsrrsrrvsrwsrvswsxsqrisrrrxsr}s~srr~sr}srrrrrrrrrrrssrssrsrs$rrrsrsrsrsqrrsssssrrrrss/sssrrsss"ssss+ssTsssssqssssssssDrrUrrjrrsssssssr6srs6srsssrss)srs)sssssssssIs9ssssssssss8ssIssss;ssssssAsAsJs;sss/ss9sssSsSs4ss2sKs`rrss"sss2ssnrrsXrrs+s5s,ssTsPs,sssPssss:ss5sskssss[s0tTss^rsrsrssssrsrsstMswrs:szsxrstrss[stt tstMskszstes t[szssststsszstlsttsttsMszst`sst`slsstttstssss%tsr=sts%t&tss&tseszs-tsssszs-t.t.ts0t2tqs2tNsssNsss8tsss8tssVssts>tsssVsBtsBtCtssCtsssssHtItHtsItsMtsMtNtNtsssssStsStssVtsVtWtrrsWtsssss^t^tsatsatssctetsetctsssssssmtsmtotsotptssttsptsttvtsvtssssyt{ts{t|tts|tsytsttttssssststttssssssssssstssstsstrs8ss9ssssssJssts#tstst t tsttsts ts4tst t tstttt ts:tst#ttttt6ttt6tttt4tt tt4sstKsst tt:tttt7ttt,sszssssssssss7t/tt=tEt/ttEttt:ttt=t/tt1ttAtAt't1t/tGtFtZt/ttttZtKt/ttZtttGtJt_ttJttttTtTt?ttKtst/ttttKttKttt;tutt;t[t\ttt[tttuhtLtDthtrtuuuusttKttwttLtu uuhtut ust uuuutxttttuxtuuztttuftuzt`tuuu]tut ut u ust'utttftttttt'usBtsBttt-ut ut-u3utsIt]ttsIt4ut3u4uPtttPttttttt:usVtsVtsVtsVtsVtttDut:utDuEuttttEutMutttttttMuttOuPuOutPutTutTuttttYutYu[ut[u\utt_ut_uttau\utttautstttstjutjulutlustttrutstrusuttvutvusutxuyuttxut|u}uyutut}utttttuutuutttutttt|utttutuuu uuuututtttttuttttttuttutuutuuuutuuttutttuutuuuu%ututtuutu%uuuuuuRutuuuuu5u'tttuuuuFttuuu uuutuCuuuu uuu"uu5u%uu>uuu(uu_tt?uu?tt>uvvsvvtvdvvvvv wcvwwu0vu5vu5vwvcvvu5vvvqvvwqvvvv>vvvvv(wv(w+wvvv+w-wv-w.w/w.wv1w}vJvvxvJvv/wvv}v:wv:w;wuUvvv?wv?wBwvvvBwEwvvvEwFwKwvPwvvvvvKwvvjvvvvvjvPwSwvvvSwTwTwvvvYwvYwZwvvvv_wvZwv_w`w`wvcwvcwuvuvuvuvuvvvkwvkwnwvvvnwvvvvvvvvvvuwuwvvvvvvv{w|w}w{wv|wv}wvvvvvwwvvvwwvwvvvwvvwvwvwvvvvvvv wwvvwvw wwvwwv wwwwwvwvww wvvww wwwvvwv$w wwwwwwwwwv?vvv www$wwFvvww w ww ww w wwwwvw ww7wv2w7w ww wwwww8w>ww8www!w!w%wwwwww@wwv*ww>wvMwAwv@w>wMw>wOwv*wOw9wAww9wwwwUwwwww&www)w)wNwwfvwdvwwGwwRwjww\wjww\ww&w>wwRww5wwvwwwtwvwwvwwwDwwwNwwjwwtwwwwpxwpxwwrxsxrxwwwsxwxxwxxwwvwxw wwvw wwxxwxxxxwx\xwxwwwxwwwxxxwwxwwwwwx xww xxwxxxxwwwwxxwwwxwxww2wwwwwwxwwwxwx*xxxwww*xxw xwxw%wwxw+xxwxwxwxwxx xx+xxwxx%x'xwx'xxxxuxw8x.x9xxxx8xxxNxxTxxxxxFxoxxUxxw.xwxQx0xxxQxx6xx6xSxxNxxx9xwxwXxVxwXx0xwDww^xwx;xbx`x^xx`xx;xgxx>xgxx>xx8xxxjxxlw xxxxoxxxxUxxTxxIxxxvxxyWyWyyy>yxyjy=yxyyyhyyy`y@yy`yzjyzyyyyzyz z z zbyy zby zyRyZycyyzRyzzzy0ycyfy[yZy0yx2y1yfydyyy1yzzqyz!zyzdy!zyy#zkyy#zy(zky(z*zy*zyByyyyy0zyyy0z1ztyyByy6zty zy6zyy9zy9zyyzy>zqyyyYyBzyBzĽCzyyEzFzyyyyyyyyzyzy)zyyy-zyEzyRzyRzyyTzUzVz\zyyyxsyxsyyy\zxyyyxyfzyyy{yyy{yx|yyyFzyfzgzizyizTzylzylzyyyyxyqzyqzszysztzyzytzyyygzyyzyyzyUzyyyzyzzyyyyyyzyyyyyzyzVzyyyzyzyyzyyyyyyzyyyzzy yyzyzzyzzzzzzyzzzzyyzzyzyzyyyzzyzyyzyyzzyzzzz zyz/yyyzzzyyz zyzyyzyzzzz)zzz-zzzz2z8yyz2zAzzAzzAzzzyzz-z@zAzIzAzvzAzbzAzZzAzzAzzAzzAzzAzzAzOzyMzOzUyyzzzMzz@zzAzzAzzAzzz:z:z$z@yyzAzzAzzAzz-{AzezDz zezz+zz+zWzzIz%{Az${Az{Az){Azf{Azz@zDzzWz z[yzM{Az{Azhzz{Az{Az{AzXzhzYzz {zy!zzXz { {zYz {vz{bz{[zjz{{zjz,z{^zkz,zZzy1z3z[z{^z{kz3zwznzrz7z7zwzy9zmzrz"{#{"{mzzzzz#{zyCzAzCz5|Cz}Cz"~Cz~Cz2{zyFzzz2{{z6{z6{8{|z8{|zzzz<{z<{yVz@{z@{zzC{zC{D{D{zF{G{zzdzzzdzF{zzzQ{zyizyizQ{T{zyizT{V{zV{zzY{zY{uzzzz`{zzxzzzzuz`{zzzzzyyzxzzzzzzzzzj{zzzj{l{zl{zzzzzzG{zzzr{zzr{zv{zv{w{zzw{zzzzzzzzz{z{z{{zz{zzzzzz{zzzzzzz{z{ {zzz{ {zzzzzz{{{zzzzz{zzzzz{{z{{{ {zz{zz{zz{{{{z{{zz{{{{{{z-{zz{z{z{{{{{zz{%{{z{z%{{z${zz&{={{{z&{{-{={z{z{{$zz{{{%{{{z1{{{:{z1{{+{:{{+{{{/{>{{/{'{ {{${z'{{,{({z{{{,{({.{\{{U{\{z{.{{z){U{^{{X{{^{{{f{{4{ {5{4{{5{?{;{{{M{{;{{k{p{{?{{k{O{c{{O{X{^{{c{{!{B{nz{z{B{p{z{x{!{|R{x{ |n{|R{ |*{{P{[{|P{|{{[{*{0{Z{]{{| {f{{0{|]{Z{{|{|7{{{7{{{o{{n{p{q{{z@{)|o{)|*|*|q{I{{zG{t{I{{t{1|{1|4|{{{4|7|z{z{{7|{{zT{{{{{=|{{_{{C|{=|{{{C|E|{E|G|{G|H|{_{{{L|{L|{d{{{{{d{{i{{{i{zl{V|{H|{V|X|{X|{s{s{{{{\|\|{^|zw{{y{{{{{{{^|{y{{{{{{{{{{l|{z{l|{{{{o|p|{{{{{{{{p|{}|{o|{{{{{z{{{{{}|{{{{{{ |{{{|{|||{ {{|z{{{|{{ |{{|{|{|{|{{|{{{||{{{{|{{|{||{| ||| ||{||||||{{{|{||%||{{|{{|,|||,|{{ {{|{5|||>{{%|5|]|5|||||||q|5|||| ||5||B|||.||| |B|||D|(||5||5||D||.|B||;|||5||5||B||||5||5|||p{{{{|J|{{{{||Q|||5|}5|-|/|#}5|$}5||-|C}5|||}5|||]|F|h|h| |}5|v}5| |q|n}5||F|J|;|Q|;|`||}q|}q|[|`|}[|}}}N| |M|~|} |M| }z|}r|r|N| }'|v|Y|'||Y|}|}}}||_|0||b|0||b|}|{4|}}||]|z|~|}|x|"}|"}v|~||t|@|||@|'}n||'}n|I||s|w|-}{H|-}s|w|I|3}|3}4}6}|6}|x||~|||A}||W|{X|{X|{X|W||A}||||a||E}e|||a|4}|E}||e|f|||||f|||Q}|Q}R}S}||u||||W}R}|W}|||[}y|||u|||_}_}|c}||y|c}g}|||||g}j}|S}|j}||m}|m}s}|o}o}|||||s}||||||[}||||||}||||}||~}~}|}|||}||}||||||{|}}|}||}|}|}}|||B||(||;||/||}|}|}}}}}|}|||}|}||||||}|}||}}}}}}}&}}|}}|}}}|}}#}}}}$}}}$}}|}}}$}}}|}}%}7}*}7}}|}%}}}|}}}}}}*}} }|8} }}|(}}8}}!}}}M}},}P}|%}(}7}},}}|=}T}}}|=}P}}9}P}}|}}T}}9})}|}F}F})}}P}!}7}}O}|L}O}~|}_|}t|}x|}|X}}L}M}7}}N}D}G} }} }N}}V}V}G}}H}}Z}`}}H}D}}Z}}~C}~~}~u}{}X}P}~u}~~.}y} ~}} ~ ~t}}~t}~~Y}+}}}~}\}.}y}Y}]}0}^}]}}}\}0}v}5}^}~|6}}5}~n}|6}~ ~}x}>}}}r}r}>} ~}~}(~}(~)~~}z}}}}/~z}+}}/~)~}}}}}6~}}}6~ ~}}}}}:~|S}?~}}}}}?~|[}}}B~:~}}}b}}}b}|c}|c}B~}|c}}}}}}}}}}l}l}}T~}T~U~U~}}}w}}^~}}}}}}w}}w}^~}}b~}}}b~}}i~}}}|}}}}}i~}}l~}l~p~}}}}}p~|}|}t~}t~v~}v~w~y~}y~|~}w~}|~}~}}~~~}}~}}~}~}~}~~}}}~}}~}~~ ~~ ~~~&}}}}~}}~~~}|}7}}P}}~}D}}`}}}}~}~#~"~~~}#~}~~"~~}%~}~%~~}"~~~~~~}~"~~}}}~-~}}-~~$~~~1~~}}$~ ~~0~1~"~~~~}~2~@~~0~"~ ~}~2~@~}5~F~~5~~K~"~}K~~=~}~=~}~E~;~V~"~;~}~~~E~<~"~~V~~~R~}4~R~I~"~~4~}<~~~P~"~~~S~~<~~<~A~~~<~*~~X~*~Y~M~{}~~~S~A~ ~X~~e~} ~M~ ~~Y~~I~d~~e~>~u~d~~u~~z~_~~z~~W~x~n~~~W~Z~n~~V~ \~\~m~x} ~  P~ Z~~~O~a~~})~~'~})~'~~~a~~~~~~~c~C~s~~q~~q~~~%~%)f~f~~s~~)~C~,~,~~~~~~~~~3~3~~~~]~~~~~~~~}U~}U~~~}U~@~@~~~~~]~`~~~~K~~~~`~Kh~~~~Q~~~~h~Q~~S~~S~~Z~r~~~r~Z~~\_~\~_~~~~d~~~dg~}~g~~~~~~l~l~~}~~~}~~~ru~~~u~~r~~~~~~~}~}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~F~~~ ~~ ~22~  &.  ;~~#~#;- G'~>~~_~~1Lx~~m~~!~ 1!'=[~=U~"`"U]]/7/b/YjY660kC7O~ XXe0eCk:fc~~~~~~?bÀހ`Uinׁi+zn:fe?Eh|E|q1r1ы33TӋ/TgrG+ލ~_GIIhP~gh~gPRRmmUUYY~u]]^^ee~g~mgmoovvww||}}   .&  GL[-!))0;0;  ÀĀ6 B &B6&/Ā׀Bj#<#ր<ր׀؀S2؀S݀"݀ހ%$%L=L.@fDf@.=Da"2p \ll__ rrytafiiHzHpfz JJdThds,,n4h`~ns`~4"\fty"##%&'()%(u)2{&27zu799WWb'YD{DGGOb€OPȀPSTSqYxv_€Y_ՀaxadhȀThʀԀlʀd€lۀqsۀsuuƀxxƀ{{Ԁ߀ڀ߀܀!܀ڀـــ! À2À  -+H8$ހ=ހfހ-yހʁHʁ́́ρ@ρЁсՁ/Ё*@$Ձցׁс,*$/<5C.<ށ5ށ,$3[ց.HԀƀ߀3q4T ~444 qirr i=oo=ekeq||JR6JKt ~Kq Q:j0~;~Q0q2>t6fcqj:f;c>%%pwwAAEp}Ev}-.G-v.99<<@@EEՀ_GJGJLLˁOˁOlRys΁ [12[Ӂ΁yӁففyK#,^_Rrrsـ!$<||܁܁ԁԁ +8߁߁ &́&́ / ؁Cׁ[ׁ؁‚1‚:' 4cł/Ђ'Ђ҂2҂ӂӂK#(M!M(݂!݂߂,߂^k_eZe44;R`cZ`nq3n\;3c\cNc]c]Nhcc{T{"T~i)] ~i" _a ut) uc0ahcct0}5b5 !bj$<$((mFF..001Lv1v88;;<<??@!EEÂł@JÂJKLȂ̂QȂłKÂQRlLooƂRւlւڂ^ڂ^_`_ՂԂffՂׂׂт`قrтrłƂł{ق{ɂł؂ɂ܂܂ނނ ؂":‚%"%%2ă/ăƃƃCɃɃʃʃ C,7>">M7"׃M׃GqۃS/""ۃDUSGDU 663 Fd93944 ON dNmnFGO:cc=A}mAH,CsosgnHj!]z ] m(Pt P~v*v*0ahagoh~e''**+uq//4uw}ww4̂Lzw9}9;;==YYABBEԂ`AJÃJiƒNǃǃNOOiÃXX΃x΃^^xEŃfgg܃҃jk܃f˃ovӃj҃ko˃vwwσσz"CG:݃ރ݃ރككԃԃ߃M ߃ 2ȃ#"#,,"ȃ)̃Ճ) Ճ؃55(̃#Ä(؃ÄƄ-ƄDŽ΄6DŽK΄"фф҄Z2PM=o)zt҄2HZބHބYI%KI-)<717<1a7:6KRp:R8pUUF~KeMKlQGlYKG aTQT bbw++҃++q/c_c a _ddid !"d"i''((++!00334:4S}}S:;;~XAŃXACCFGFGLLM~MXӃoXuӄτuτzzddԄӄԄׄׄrrքքՄۄ؄ڄЄՄЄڄ؄)K%7ۄӄՄ܄ՄՄ݄ل܄݄   % ##̈́̄*<̄Pф̈́ɅȅȅɅ˅D˅D҅*8F҅ӅԅӅ<II$څ&څ5>&$5%ԅ<),)H^E-^E,-K_ WW_ J<]]fZudՄ%xKHJNN""uf"ZZz`a`77{cc&&(C*}BB}1*z122yM7{7yRąR…ՅBօB[D[DbąJJ(bhQQS…STUTՅUօ؅ZtͅttمͅaZمaŅ؅gׅ؅ghhŅƅkl؅υ؅لvkƅх؅v|ÅۅlׅÅ|hąۅυޅ؅ͅ؅х؅"ޅ ##".-"/ԅ>ԅHԅ8_"<<$d" A./Ȇ 0"ȆɆc"Ɇ>Ά>+Άb"CHW"ՆC8/Ն-׆׆VFVFfxaK"+_%LL%dI[35I30c]4]4bWww^{K{z z 'YY'P Pc\}1\`}``j$j$%''-цoE%o-.ۆˆ.9;;9??؆CCE†EĆELLhOOQQnцnVVZֆrrZvʆrĆĆֆʆabcdkabۆkodˆo†rr؆ÆÆ͆zz͆ԆņԆņ /$A+Hcۆ"")φ#)#φφ ن(+(+ن&چچ 6&Ň6Ň447=D=ˇˇD[A1чA5ч҇@҇,*ׇRׇ*71, X݇0[:U^ B:_>@7/݇0Bh4R/eJe[ U _hPhYhX7`ĆFJP!YI|I2\>F]l8g|!}]}y3pfv5jfpl2y3\hv5Gm8j{i<<gh&&imH{G0H0K3~Tx3KxT<<^??EEH^HKKÇMNćMnkƇUsɇćnɇNsۇwۇwUcc؇ff؇hՇ܇܇ՇtÇtЇȇЇ ‡ȇ‡߇߇Ç7h~LJ LJʇʇ.2.X2Z2~2هs22^2.22'ه22('DɈ(ɈFD͈+F͈2;Ј+485452Ј86WV7VW6ވXވ7L[LLj2[@:Z2@:2ψ2Ո222=ZReR=>edlld>gqgq;D~O"PO \o##P\o )sYY)Z,u,u~"~s9^9A"#ji"jiA#))C0wGwG022yzSyzQƇN;;>S>??]`]C`JJKVh2h+hhhhKmVrLj؈Qv؈rv__{{hmhkkˈˈs܈܈݈ڈs~݈~ڈψʈΈʈΈψ҈߈҈߈ՈۈۈÈ !ˆ È!ˆ+&ƈȈ1+ƈ &Ȉ <+ӈ1--ӈ:ӈو و%:*+d+L+ % \+z+p+͉͉<<r++݉++݉$XÉ+$HXHZZ*/.`9`/d Rc^cR3.'L=59FFa,=3\(ztN4tY7p^ |@| nWn uAW5'uN(a,rB[DY47d[yz$eE$g@AyBeDgDEII3434}P99PU>>]UFb]FbffQiiQ‰lo‰oXXZÉZ^^ww{ˉʼnƉeˉeʼnډՉډl{ÉĉrĉrՉƉЉ ҉|҉|ЉԉԉӉ މӉ ۉىۉىމ'ɉ'ɉ((!׉Ɗ.׉. P Ɗʊ##::ʊ%KHЊpЊYPDGDGtRBيBيR%&@@&+5+Ka1L5 1a,lElLINMA, HE INAMphn"hmq Y)mnq O"o SO* oST*sTz*)-bb-sz}44`8`x88t}8==&&xC++C}J{2{J2VUy778~~UyV[[ZF\F\ciĊ8ĊiR׊RWvWw׊uuvwÊÊaacފފckkފppqZr݊w݊cwŊy܊yŊ}܊}ۊҊۊ!Ҋ""('(%NJ%NJ3*39,9ڊ;>ڊ‹>‹Ëŋ5ŋȋCË.ȋ.-ˋ!ˋ*;,G4ЋGЋыC*ӋHZ/Z݋ދ݋/ދHX[X\TT\!*B[B5-Q6`Q6:`INPNfJfJ<e<EmIEI[Xmvh#Uvh#xU[xt^oz=gAt=oAzg,,--/055770^;==??;DDFFJcJKK͋R͋R̋V̋Vrr'r*r4rw`ɋ`wfɋfghih׋iq΋q]rwwyy΋׋ʋʋ ҋҋ,-ƋƋ##>Ӌ[ӋӋӋoӋӋ1.  1nj njɌ>Ɍ!@! Ό&ΌAՌ::Ռ֌&$P2U:%<eA LX֌%NL2]^3<]CCMB[3dEEdGG[BQQY|[|jSj"IIO nHS"H[n\ NXTO\(+(T+////k s *???P?k*q+.t.vtWvȌtzsP7::WW_7Ez_Ea__aOg׋gOʌlʌlЌUЌUVrr<r[rOrrVȌyaayyٌތތ͌ތhٌhڌތÌoˌތÌǒތssttvv͌}ڌ}ތŌƌŌƌ܌܌ό̌ˌތڌٌ ݌ ݌ .!!%% @Ɍ$Ɍ"U֌X֌^֌M֌;ƍō ;ōƍǍ<FǍ<,-ˍˍ,͍ύ)ύЍHPЍHRBR͍BIIP?ݍ?ݍ-ލ#Z3Y#3>Y_WYM4^4=@iGF@]])Fk]AJM_^_G_r WZ wjt+ތ++"+F+P+k Jywj##f&&'',,..0103{535~:V:BDDEFB1ɍFNNElUUV[\l؍V؍[\]]ȍ؍؍ee ؍(؍*؍؍؍uߍόx؍؍؍؍؍uv؍؍͕؍v؍Η؍؍؍ʍƘ؍U؍Ӎ_؍ߙ؍ȍ ؍]؍w؍̙؍؍Q؍;ߍ%!%+ʍ-Ǎ(!4! / (!)4ÎÎZލŎ-)_ލŎ->+͎I͎ώώЎՎ76=Ў2Վ7*i4"J܎"I)܎AɍcYc26Ya8r9hT<THh;a8q?qW_H=ynWn9JZ^^dZLf#`d R `>qL_XwC.X{3~33AOoo  gGx%R>%m,mA@PwC,KgG@qfrKxOPV!V)V6VJV;V\\Ӎ\\GrGiĎĎpfiUUp̎ю\̎юt\yԎ؎؎yzԎzݎcӎʎgʎ׎cӎg֎oqqo֎stsytyzzݎ}~tĎ}~׎ََ/  $**2ˎ2*Ўڎ$ˎ8ڎ8+ގގǏ+Ǐߎߎʏʏ͏J͏JE<5֏CCHH֏=_5E-E?E[KE_66I-IA[KL[A<;;<]F Lm[]Fmfu>fMwvwMjvjbOb: Z!eN!eu[OnZnYi00>[kikh=p=?p?''()*)lr11h4{8{84<<==AABEBEaaIILLPPQQV̏VXs|̏z|dƏXdgϏgiiҏkˏƏkҏϏttuxԏԏȏxyˏyُُՏuҏݏՏݏݏ܏ݏ Ώ25265֏ΏC76ŐCŐ&ǐ&3HHǐ̐͐̐+MҐFҐ+9͐-Fא0א:;ِِ:ݐ.ݐސސ//^S^-5M5[^p^cYcG05N .5 6m^{^YJJ>oRZeRYZ|[SGYp|e?p^l(r****ݏ*܏*oY]^@hhjl88!l!%mDj]?%@?DK{,,qI3qK36K688;;==V\\CFFCIIMMΐnkSnWWSYYÐÐϐ`ѐȏu`eӐehؐؐʐhjjkkѐϐʐpqrpqrwwxyzyȐڐڐĐɐĐƐȐƐʐzɐ ېАӐϐې5^ΐߐ-ߐАː#.P739 ːː@Ԑ7 7Ԑ;א ֐֐>ސYސeސǑǑɑ-ɑ#̑+̑9+9.&NԑG&ԑՑG'ՑP@NKQ'KQ?R?RTa4)J^T)4^lali>i >mAA mLZVV\aLi\staUsZbsg|g|U$bo$ot2t/X/Xn2{n6d{u;Bd%&}%BO}F&uF[445OO~cA]~ϐWʐW_WA[]5_cNNOOUUʑvʑZؑZvĐxxaxxxבxؑllבґґّבyyzۑzّܑܑȑȑۑבבYڑڑ ڑݑ ݑ""'-Б"-'/'0' Б8D'8 ,Œ,Œǒ/ǒ?ɒʒʒ0ɒJDI<ԒIԒ֒R֒<SWڒSڒےޒVޒ]]1X[R'V'FFeX36d326qeQdQopupےReY{}uY^\ee^`a# K q#`}_Kacbf*rrf*cw:~:od~t&w&((s*,,*sEE11v55Th|T>>?BB?’FFHHƒȒ|MƒM’hQ’QRVђ˒R˒VђÒĒ[[x^^ܒܒxbҒbҒϒiikknϒn̒̒͒tΒtuuВڑ'eU~~͒ВΒ ݒݒ8 Ӓ?ǒ"/-$-/"Ӓ22W֒ē8ē!E1ޒ[ޒ˓!3E˓̓2d{\_̓3%ՓNUדדNՓG'ܓܓGߓXߓ.+_.)\W\+@06fXUSCbS60_@W`YIJ`wIt KxwOx#KzOvOvv,,#wz4{a]]4Za!!##&?&?Ȓ?m++-r-ry001e717ÒR<ĒR}<={?@ZDDғeǓSSnǓ^nn=ғ^?ғ@ғdǓdfϓfiijjqqrr xxۓϓǓ" ۓ$ ''Eē%ē ѓ))(6*ѓ:ԓ3ԓ3T'ד(Ĕ6Ĕ)Wf_CY>ΔӔ*"$.ӔΔ֔;֔ה;,Mה:ݔTݔޔߔޔ"Mߔ$YX.JYkXOX4b kb 49Wva9Xs~vasWXloo ul um&y&pt}1ehyp}pye$}8t$&&pǓDw,Dtɔ۔133,1z8z<<??@AF@ÔAFHƔHJJLLƔÔPPQSSQɔWWY\Ŕ\]YɔŔҔcҔch۔Ô]ɔhÔllєʔpєp̔ڔss̔xڔxy{{yǔ˔˔ǔՔՔ>Ĕ/,Ӕ47ܔ4 ܔ(7 ŕ(ŕƕǕƕ "/ʕ#͕̕Bʕ%-ѕՕ;̕*Օ%#ѕ:"Ǖ! 7^.*';+z+U+o+~;!7:-B2i.0i^0 D C ZD ;;Z)jpwvMvjCh5z9NmI m UM)ooq}|N5 z }8Ô8 8I9~>k>kqt,,1t1R8Q8<RQ<B˕YB]IIJKPJPޕSKUʔlȕSU]]ɕ"{dĕĕdffghh˕p••ҕҕÕpÕgttvvyyӕ|ӕ|~~֕֕7/'ޕ"*+͕͕4͕m͕Ȗ͕͕442Օ24*4=/–=–24ƖƖ4C43̖Ж̖3?Жі>4ӖO4і.!T2VXږӖ!ږVޖCޖ5;5O>@e@Y.?\iFmiZ FrR[MArm|~\ZRmMNj^sN[m$kbmqkqm$^mb1q7D7Ye7<<<m?DDu1u122QQȕSSɕS>>?@@FFGǖJJGMMNOǖNȖOVԖVZbZ˖vvaabee~~ǖߖjkjoϖkopԖȖrstvȖϖȖyvstݖҖݖpϖrϖȖ Ֆߖ  ! =!/ y BƖ?ƖTƖXƖ .. 7$78<8——=;ޖƗBƗǗ4 Ǘ4E˗eZ(Η 0˗֗0 ED֗PHٗPٗUYܗUܗޗDޗAjs/]/&&]RL]iR]LAC5A5dqfqCdfIx^xi]LTQ u W[ I]u]T Wi\h{hwz]66w""#'?ǖ?'?z|0#|0133477~4A˖ZADD1__bߖbLL̗PPQQ̗SЗŗė×YЗYZs\Sė`Җy`Z̗חחɗڗfڗ\̗ʗjjՖɗfʗ ϗȗ{ԗ {җϗԗҗȗ <ۗӗӗݗݗ$՗  ,Η]ΗΗΗΗΗ,՗9H֗Y֗9== ĘߗƘ+Ę ;--5ј:јӘ+ӘԘߗ FOטԘ;טFEOۘ5ݘ!OUO!ۘFuO:^wOQݘE[OX/X/ U[ G ccGu\{w[@i@iazaO$Ill$ Iz.|r.rt~3q4z3< x xss<#$$((,|z,-p-02}208tz×Q8ŗQ;;~#>]B>B]^^dd˘k˘RkUXXR}Ҙ]]Ҙ_aϘaǘϘeØkkeۗ٘rtØtr٘ɘ{ɘ{ؘ֘֘ژؘ̘̘ژ ͘&ƘOƘzƘqƘƘƘ!͘&՘!' ՘ '՘ܘ ™)ܘ9+™3 3)9 ˙˙ Ι?ΙFЙЙәәՙ=ՙיHיܙH*?+ܙ/.ߙ/:Z6<V1S=FMVZ5:41464MSD<DAWAWqhPhb`bcx x YNqVmNc`(mYp-[ss[~8o$$%o%vv,,..11446|6;;UUCC__+_F_._ǘaKKÙNN|křϙUřUWƙWؙZؙZ\\]ۙ`ۙ`ڙ}gٙٙ}ghƙϙmڙhmԙϙԙuwu{{ę}ə}ę͙͙֙ݙݙəޙ &&//̙ ̙+2*ՙ 3)3)4ߙ-'VߙPߙ`ߙߙ5-͚Κ͚55VIΚ!'!7+/V><[S<>[ST8IcTc9I8MOM2/ON Ù ϙ =^9L=^vLvyny(bbdd~s~P#n$ln#lRP0Rs(:ttn0?xxz@|#;#z:|?ij@DEDEjF33FQX:Q==:WX]CD]``eeeDʚkʚPT˚kT̚V[ԚC[wwwwwwÚgÚPVg)hȚԚ̚˚֙̚pȚpКsКsttyƚޙyۚۚZǚ Ϛƚ h7IniuҚ&jvisEҚ $ I`5Ϛ5ÛfÛ AǛ ǛȣɛΛɛ,Λ-4$ԛ0ԛPRכ9B- 5BכZ?Z?SXS5`, 55,AXa`aYa6&5q6]6i66\Y6\>ff>AqqUUrW%)^aW^)]qi_ !=%j%''j!%q..112u288::>>BBbbLLhhhʛޛVVYțYڛxʛx՛bbdޛdmǚ5$AR-mțssuuvћ{ћ{}ڛ՛֛ٛٛ  ߛ֛  ěvě}&4Λ &  œœŜ ŜƜǜ;6Nќ)Ɯ( N(Nǜ(H);NڜHڜQ$?"="=?$4CRC3RhQNr\4NM\M3NhN9l9NTnWp_lNTpW[+[[N*fNZz Zz*X+kkXu.oq5q5<"<"%&BrB%t&o/1r1J/tJ7878f==>?@ABc?ABc@QQќSTSZTZ̜˜`w̜͜͜w`ޜb}eҜefΜbߜʜmfߜʜmۜќ>ќsۜsҜќuyy{ɜ{~Μќ~ߛϜɜМϜ ќӜ՜Ӝܜܜ# # ՜'E'I'9:2Ý:ÝŝŝɝEC+'ɝʝ̝I̝Ν+Νϝ3;ʝEԝ0ϝ3ԝHLםHם؝؝DF9nޝ<<G]0'ޝD9KO,464]JMlKtj,OMt__cLPdaRv NdP&aUvig gzNc\z\\\}55V}!##&&B)q)!q225566<<>?V˜ZޜZ>GG?KKLOOPLPmXѝѝXZZu'uLuGuߝsМ՝o͝͝՝oqНqНٝsuuҝݝҝݝ}}~~ߝ ߝ 92C   (;Ν(,T*F؝ܝ ܝIڝڝ77JOF6l-I͞Ӟ,3*(@͞-ӞԞ֞T֞S۞Sjc۞Ri8=8FU3Ԟ,@BJBMnpAAdn\d gdJM]dg]HUrzr$Ud$t)wtHd5_x!d!wd#xߞٞɞx#{{2233y6699;yƞ;ZCCٝZўIIȞLȞLNŞiŞNiĞZZמ]]^^؞|ߞc|ϞfgϞc˞gpٞpqɞqyƞy{ў{}}؞מĞҞҞ ( fߞޞޞ  (&'>)& ՞'( ՞ܞ-֞=֞ܞ=%- : :ȟ=ȟɟɟ>˟̟%̟)MK Kԟԟ՟՟ "pK0KF*ߟOߟF"0R4 R4UGO*UBKdKBzduKzKBG XeXe˟>uiKz_מ_Ki|P+|K \ \~~+__5Y5 b3 !"z!b*j*/j/00447"78989@@BBŸFFHHIJJ˞fhŸQhQmʟmI֟ʟr֟ZrZcc͟i؟͟؟ijҟҟŸŸuuvŸ||ßßΟ  Οݟ KŸݟ32.. 3G,1#Ġ+1ĠƠ2ƠǠȠǠ ;͠Ƞ ͠GAAҠҠԠ,ԠET5T&T٠E٠ڠ۠ܠ+#ڠ5۠&K\ܠ6:f6T-PKT\T^:Thf<V=hWYS_=Sm}-T}D^TVT ]WTDTm d]Tsdsnnylryss#g#&&'(('--I00113377;;>l>??aJrgaIJIɠɠjkʠՠa̠kvvTvvvvabeՠeg̠gbʠiߠmߠmݠpprrswޠwxxϠ||  ϠѠϠѠ֠Π֠Π Р Рננ.# ;Ǡ ˠ. ˠA/ <<áAáġ5ġ/ʡ5ʡˡ<BCˡBFCFE8ҡ8EONMҡNDCHOݡHMݡߡDߡ_G$G2T2U]S],X9,C4[XC9o[oYu4CYouojttfy )dh{dP*vP*h{)UT*jo yfo6_^_^6q""=q=?**yoKvoz/6JKQz}6}Q89/98AADDELKxKLMiݠiޠišMWssCsosssWۡcyzkkllcqӡ١tӡtwܡqwxyz}ܡ١}~ۡơơ ۡۡ~ 00-5-70:Ȣ7$ߡTߡ\SߡȢ3ʢ+HFʢ3B:5ӢBӢ[N'j'N4O4ݢ\$CݢOC$>V>V+H<iQm Q<i =f=JgJUdh[HF[hd{PP{ j e bena1abo1ps |;s;$pUg')EEE E<EEEKšKKKK١K$88ob 'CŢC)¢ĢFĢF¢JJǢMMբuŢ͢SˢYâSâY_բ͢u_``Ƣeeffp΢עrբp rsuuxxɢz̢sˢ΢ɢϢѢТzѢ֢Ԣ֢ עߢ ߢ5  ȢȢ // !! +66<ۢ=ۢ=ޢ + <ޢ2Σ2ΣϣϣNѣңmң"գ֣֣,fգ#gݣѣNݣO,EE%DR((aGROEaGN<3l3"<%En #<q]q[>[l}dDE}d*|L LtL mb'.'Ģ'Ǣ'b*m-.119gyy9 #t g#v%%v(i()+n)w+-4KP4KnPiT|UTU>>wZB\\Ƣ__ɢ_IKL|LBʣTTZK̢sϢsТs_ʣ_`ӣɣbdӣdԢfmbܣmoܣoqqsˣsvvxǣx{ {~~̣ڣǣԣԣ٣ۣڣ٣ףۣˣޣף̣ޣȣȣȣ ȣȣ!ȣ 22,,!J¤*¤*Gʤʤ"1Ѥ1"GѤҤҤ-Ԥ֤S֤-G]&GԤ&SGݤXݤޤޤHF@>MV@McVLXGHGFGc3G3UG<GU<]]ajRjR]NWOeO \ e W\.nn.!|!g#%p%D#gtD++,-II0tQuʣIyP8uy89QpC[[|C^ɣ`^dfffkfkTϤӤTXϤXYդ]Y]Ӥ_}ĤbФb}ĤӤӤФˤӤ_kkͤnͤnפӤrˤӤrstߤt{ȤӤsפ{}Ȥ}ڤڤؤؤ٤ܤ Ӥܤ٤ۤ GaO ((".&151: . ĥ22;ĥ<? ɥɥͥ?&"<ͥIMХIХҥNҥL4եL35NMեRU3R4ݥUݥ$Q$**':5c'cN5`j`f=f=A@A6DDSePgPgOEZEa V |%\W\m|W6ml9Ӥ99 9M939''(**(pz1¥13443eOɦB դYVB|8 `ЩLǥ$LNN%,kѥWWWXXѥǥߤsץԥ_إb_ץbإnޥޥnqqssuuvwwߥߥ֥zۤ "5;ڥvڥ  ƥ  ¥¥ƥƥ/%/Ŧ0Qݥ Ŧ'@ɦ<: jP ԦPԦ٦A0%<:٦ڦASڦ"&$"Z&a=ZY,Yh7,haaZ7f]m?@tM=ZfZ|l`i Q p(((ԥ((֥(Q?]Z} k@4^ t %j%''Mj,//|KK7,7`=}=@@AkAFFb^MMNPPQĦ˦UĦUWӦWӦazzaQzzNhlۦhlmmǦܦrsrܦǦȦ||sǦզʦΦʦզΦצզ צ% $($*ɦZɦɦɦ8ɦkɦ0+018+81$ڦ§;§;Bߦ!ߦަ1ަ!2˧2˧̧ͧͧ)̧#C"#CԧקGԧ"ק*(iߧ6ߧZJZ.\.)8G8I5i6845dj4\dn?n8I\o?KyyKokpqH`Hkp tTOOT3tzTz3b9::9))L//FLuRuN9˦N9:R:AABDEDEBIɧKMȧMIQŧۦhQKħUwWWȦssզsէ٧swU{٧{{}է}emӧȧɧŧmesstӧtڧ (0ڧ֧ާ֧ާ  B&&-ʧ-ʧͧ..6&2!ҧ21ҧ*1*6?3Jߧ\ߧiߧjߧ#J#ͨJͨΨ?&Ψ%;Ө;ӨL5ը֨֨0ըL4X$ި4@Xިߨߨ@%&$,F,qF`fGkG05T &  ] f]=YY]b=]yHyR_R gwZ wxqg_xoSonjnh\cacha8 #r#p%%pB**EɧE112442zvħQ::zV@V@CCGGJJèMMPʨPRШRUUXX[ѨѨ˨[]ר]ʨ_`e_بۨۨehƨۨۨШۨoƨohب٨v٨vyyz{}¨}~{ڨ~¨ר˨ϨڨۨϨ!ܨz$3Ĩ'Ĩܨ$Ҩ,Ҩ5ӨXӨ-<'$©-©ũ55<ũȩ Dȩɩɩ!ͩ(,$ͩΩ3ЩkΩ$!<6֩ש֩6٩(<ܩTܩש>>S$٩>H_ZqSjETS;ESnmln;SVmWiV\wtKlSr ##lv#NWmt|xxK|imwm:N|:$%ug(u(**,GèJG335656YZY˨XZCCDۨ```$`<`DѩSSѩVVWYZZYکaadԩdeiԩکil˩˩کlmmososveԩvyϩϩy||کҩҩکө  ө^!Dũ!!3ͩ ЩSЩmЩ|ЩЩЩ4 4'ª2ª'24ǪǪȪɪɪ-&ͪͪ&ϪЪȪӪ>ӪԪԪTTLЪ4#Lު#!)LުߪPϪ--4ߪ)XP+XLILI4JLJ>4bMfnHMqbLfLpqcqnJHcp~r ~ [g%(u,,,]xxux#]u#$%&%()D&rq(}[)}x35x3;;WکWWWWWCC$5GGJJWKMMeŪSŪSƪ˪XƪXĪw^wv^vʪ٪bݪgݪgbʪooڪ̪uuzz{{̪êѪΪ٪4LuxѪK  ٪YS T k m   s  ج + +ɪ 2-2ժ ! 82 ժ īī+ߪ: ' ʫ-ʫ85 2IHIӫHP2ӫ6֫6֫42ثFLګثqګFP@W@4WVcQeQc0V21R 0Ne1R>?>?mhfThmOsjsTxxUkp k`\fO`*vn*Yn cv_Yc3c9ad9d==q))q..7~KK˪KĪK٪KK_7Z>[>~B[BEZEbJJbڪbͫPPR˫RSTWWXX]aҫ]ê{aΪ{ffhh˫ͫҫk׫mޫѫqޫqs߫uu̫̫߫{{2QO\ԫ ۫ ۫ ԫ !$!'ǫ*ǫūūӫ/Lث 4Ǭ5Ǭɬ0ɬCˬ'$*$54ˬC("N$0׬(׬xجK/$$MK&"=&A&e&&c&jUM+pU<+<U6bb6=AZ;Z eaͫV [V#Ki#[ic22ww "d" %%**+-p-00+334488T;;TT׫TpBXBd¬¬GG֬¬¬¬N¬N¬¬Rѫm ¬?¬bssss$sRì¬:¬1¬b٬Q¬O¬۬id¬i٬̬Ԭs̬U¬u¬¬s¬լìʬլԬʬ|¬|֬¬ȬڬȬڬݬ٬ݬЬ Ь֬ ެެ 4&.( !#262#7&ج¬ججججaج&! 5ɭ5ɭ?ͭϭԭ/ͭ.!ԭϭF9٭F٭ۭ:ۭ1'/$;@'@QO\A\d=<U=STSnfnoECAu uS)EoHj~jI""IV rH)2u+٬+ʬ+۬+Ԭ+0r^ m##&}&'pt'pPu//112z55PX:;X:;CCEEGŭGǭILLOIOέRέRSTSTȭYYZ[[x^^խZabdѭխxŭbíaí dѭNyyzǭz~­~*3حVƭp֭!(67  ­ P} ح ƭ ֭ ! !($ϭ 9ϭ0(0$ 8î%îĮȮDD-Į Ȯ8JϮ,<(ϮҮN%JҮծ+Jծ+UTfFC~V\`\*$(,-3V.HnH^ m } t .n]pumu JqxqPFU r X hpr]nvz2__ep=;ǭ;=wX&)}&w)++.l{./0lM/OMh0ȭS::==>W[ [[([J[-[Wޮ̮Ю>ɮdWɮW[ˮ[Ů_ٮѮcٮcd_Ůޮͮiͮiko̮koqЮquˮu׮z׮z{{®ƮƮӮή֮خӮ֮ ߮% * ,$,%UҮ*`Ү<  <Ư'9ȯȯ'2˯үD˯--1ƯnDBүCKԯԯC֯JO;;ܯJ֯2ܯ?@ޯޯ?ObambxHRHja4F2ve4jrajj`aگabaapxpFar `a w{)))|Za^Z|^|%a!#ɮ>>Ѯ>-t!#t-003r3556699<<=@@BBDDHHI=OǯOlʯIlXXǯد\ٯ\^^ۯЯ®{{dۯdЯhhmׯήׯmخrӯrsկvvsگѯzѯz ʯد~~¯į߮¯ӯٯدϯدϯݯ߯ $߯ 91B(K%(* 1 G2֯@֯8844 E ŰF w K +ʰ̰ʰ+RҰEA̰Ұ:;:21ٰڰٰ;"$"UxU''`cŰ4`FMGZZ د ڰFQMtw[GCFQCZt][F}u}] _ K NN wTTpY7pif_uif7?"e"$p$%n*%pe?*xnİ3x355ɰݰ<<==Ab°K°AЯ^ѰbbKLPǰLİǰΰPQSɰSTưVX԰XկssįsݯssV`ݰ`acceѰeTɰѰkkаpаpqذq Qİ||}~԰ưȰ~հѰ۰۰*1aݰ 'ϱK}հ'ŰAŰ-d'l'j'-6..'۰.$ڰ.±0±cڰ'''F-˱α4.αCtu˱.'ڱ&'ڱ۱۱W'M+6-)-+Z0- ..1]]fd4FmgY &F mRYRYhCdNWFhMF[r)Z_[n%%%1Zr\_lsUsj !"##"&(()B& t..tB336ΰL6<ưT<=!)ñ=EñEIȱIiPiWбֱPWӱذquӱu\]^``]Ȱ~.~-~F~Z~f~jֱjk\^koqqϱuouyбȱyϱޱұϱϱޱܱϱ1ϱ ϱұݱٱٱݱ$ܱ*%/̱/'--̱%'7*D8$,?˲D8߱1+߱ ˲,:Kϲ:ϲвѲ0CղQղײGײFg+79Fܲ4޲CN\52Kв2fAf9ܲ;BhGKѲ0;4Ge5KHbBe>UQC޲@d_d@K_bHJL x{cN{ xR[r[msZs| t666ȱ6 !iOimr&v&vg*nn*S//01}0wcLRNOt|1}w;;S@@AAEEFHFJHMMNPòPQRNRJQŲuŲԲu``cزcز²ffhԲԲ̲ԲhpƲԲòԲ̲pԲԲٱҲ~۲Ҳ~۲IJƲԲIJڲڲԲ7߲߲Dz?Dz-2Cв"8+8"7³7+³-2ų,ų Cȳ ȳɳɳAγGhγггԳ(CԳճܳD(S>Jr|ܳݳճ#߳D232d=+߳5ݳ3,+#Sde4e52UUn::nZ>{B{LjGC>nLjvg!!Բ!2!n!!i&&vnwTwggx0xvin "a"$s$'ysn'IlynlEnnI33zVz66R²RR||VaYYCCDDFIFLLM˳IhUMUXóXZZ]]__ij۳fijfٳjjmm۳׳ϳ׳sϳsttyy||~~޳޳ֳֳ +CS (() &# )&.سڳ//س+س*ڳĴ*Ĵ=߳@+@ȴ112.ȴϴ2ϴҴ4Ҵ4O,մմO;ٴٴܴJBܴݴ޴ߴN9-,ݴOߴ7N7,Q޴-8i8?EQ5i ?l TSlxSJ;zkAkWzTAWKK{een T b b ''g'cYdYa`a} g: }%%'(1rDD˳DqóD(r1445PPV==V?ZZDD?GGHMHٳfMfRzôRôYдôôôYt+ô:ôô_gŴٷô_ôдgi>ôiYô`ôeôfôiôֳ).4,9 zpôôôŴʹʹʹ # ƴ ##*ִ*;մ8ִ8õ,õƴȵAȵʵʵ˵5͵E͵"˵ԵI,ԵA׵!XX!\׵PK\AcdPK"c{nIcPckkc]cyctcPdm de Ze^cZjc`]ҵcyc̵ct jq''' ^6j-oεcc`-o`cnjc65ôS3vs:*-C7S8[:{%r+Ơ6-wJ7B^ E88[!""$J$-FQbJkmno/pap{؄[zдzѵfѵŴfʹc+mnҵصֵصuuֵyyڵ̵~ڵ~εɵϵɵ۵ϵ۵޵ݵݵ޵ߵ  ߵ,+е,+""еӵ-  ӵٵ5Dٵ?D?-+2 2˶ ˶ζF5+ζF+.9նmնKL9ٶKٶ.+<Hݶ<ݶ߶)߶)+;INI;;+;3S3omo `\E\`mESXgXgtiJitmTJTmmVM mV &}h&^h^bq4b}m46 6 !##!jv))+-|-jq/|r232399:;/|Y;YCD_C_DMʶMQʶQSSTжԶXжXYѶ^Yw^``̶T̶w׶Ҷ׶jjҶmmͶqqͶѶ϶uuwֶywӶ}}~~ڶѶyֶ۶޶ ӶѶܶض ܶڶ޶ ö öǶǶ"((4.Lն $Hն ·B17"BF1IH4̷I̷Nη.·GJη<HַGַط6طtٷ7>N8N>%=%O%8=_h6J_hMi5n5KanOPnnpnE?q<FnE||Roav# PR *r+x*+++@xc\ihpncn::gѶ::\@Kh)L),,rUrsz9LMMLԶM{Vz9sU{V<WZ<WCCZ`HILķHLIķRRm϶mZZ[ww۶w[ccdԷiiзϷoضot ۷twwԷݷd$÷FJзݷ÷ѷ ܷܷ%.2.շ!շ%ٷnٷٷٷٷEٷ%ȸȸ66EOGME*EK׸OK!?׸3EܸMܸ?EjE*:`:G3feekE|Eof?jBbBpqhqyJyTsET{gvr]krpb"v}"]}'|P'$QPVV$Q+x+s~--x~  !"l!g((+"l+-.-33z7.799z==>@@gFFGHdϷd۷dHdmǸnǸmnWWY̸ظ]]^ݸ`^G̸defdݸillѸٸoѸopqʸvʸڸvw¸ѷ}ڸ}q¸ŸĸŸƸwʸƸϸϸ  2øɸ  # &*&ø ɸ#v1۸1??۸0ùƹ`ù0ƹ$I$AййѹԹ2/%ԹعLѹ/bعhJ{ݹDݹRN߹a'2Aa߹RNBMZBZ_8MEKEOLA8O_JgcgJcQnQDAjjs! !Pu\yh\Sy PS-z33k ! !hs>>k>,,-//5tVt5Xz[z-UVXظY[]H`HbbmNiٸim[ppp۹Np[\չ~h۹\Uĸ}}չ~}}h޹޹ܹڹܹppٹvٹvxxy~ϹϹy~Ĺ ڹ* ŹAMny)¹)¹ŹIƹ%ƹ  13136ú'ݹúȺC63C2Ⱥʺʺ.̺̺D_KDVֺSgֺVSGFGhS7_QS[S8F_7sSFue$S4S^4^;W8]WrS2;e]s!sPHSSPYbPxSY0S90d`:dw`9w:#b#$&&r@r$E0E077º}UU??ĺCCaGGaJJK@ڹhQºQlKźUUźͺlĺttyĹyyy˺eeggiͺiƺkokƺoqqrt˺tuuκɺκǺѺǺrɺѺ кѺк  (  .Ⱥ(̺Ϻ4Ϻ/4Һ/Һ**%2% ܺܺ9< ݺ<Fݺ5Fʻ5ʻ.8.292ѻ8ѻ2ջ+ջ׻H׻+2H2:Xܻܻ:޻߻Y>޻;Y߻3;X3XaP2Xnf\f6vaX[dnXdx]6XvX[X)w]XwXp)pvy=y}77{=%}%@@}{v//022088TTZ@Z@A^A^^KKhOiQRRO»ػZ&[^лZ»^__лӻeӻegiϻԻirϻٻrgtvwv{w{̻ٻû̻ûɻٻ)tɻ:Ļ('('Ļ˻)˻ǻǻ1313:¼¼üüɼ >߻= =ɼ=BEͼBͼѼEѼӼPӼ=P=ټF\ټܼ6F=ܼݼݼ\߼4W߼`x;W4;>6=fUf>Wkn\=<n<kW?`=?WDWDocoaca Xa p bXa0zbapa##^$%&%zs/s/~ss24~48QػQ89<??[[=[W[a[[&<9OOQQT̼ԻiT̼ԼVռּVt^ռ2^_`b_`ڼؼ޼ڼ޼bؼۼps޼sȼ޼pۼwȼ޼ϼϼ޼wʼ˼˼޼ʼ޼ !!+'6':6)6'ǽ:;6ǽɽ)ɽʽ̽D̽ʽ;Ͻ(Ͻн+ӽ>ӽUнֽD6۽@ֽ*۽ݽPݽ߽߽S*a-GBG,-@aPaS.B(6\6>6makkAuo,aou\GzRs$$޼$$$+$mamctRamczax55xaefq"f"y$$y&&r++--002233rԼQ<=WּVW=<GGHHJJOORRTTUVUͽν[ѽVͽ[ѽνҽĽcҽcdd˽fgflȽlopqrȽսt{gսoq½˽ν{p½սý׽ƽt׽ƽνԽٽڽԽٽ6aսڽ  ''ؽ 4784 ؽ8¾ ¾ Ǿ.GǾW9˾!˾C;,C;Ծ,!9Ծ־־ؾSؾپپDܾWܾA޾߾CSC߾ZZK*L*/La^YL/t^a޾WYMsNsDCXML\\XeQIqQubw z zvuk&n(mn(|k]m_1i31_iwb|b:&&''}++:x-4JJJνJJ4y88-y<<??Ľ[GGHξx}~ξSžSlžrrLrbrrr^^bϾý{b~ϾҾҾlln۾nȾsȾ۾suuvvɾ{ɾ{оѾѾվ  оuݾ 7 ʾ9¾C¾ʾ##̾̾ Ӿ"("Ӿ׾(׾ @׾6@ǿ06K޾ǿ21$=Cο2=ο0ӿJ$ӿտAտ>I.ٿIٿNW9CIJZW1AZ.>Z)Z)jfjfv] oPdPd DUDVXKXoZUY\Y}}L w` |`L | ''''VZwZcc""Bk%&kB%,,HHHHվHH&8x89;;9AABDDĿFxHIIgLLFgRRVϿHnVɿYɿY]B]߿Ͽ޿yƿy~߿hڿڿֿֿ~Ŀhѿܿmܿm̿޿wxwĿĿݾZĿ޿ĿĿƿ޿˿ѿ޿ҿ ҿԿؿ̿޿ؿۿԿ п !(.!$Ϳ.пͿ(#**$9ٿ)'+)>><+<8-G=G@_0@U3K\53U?1f-01E<j?5[iMinenfEJoto[EojNy _N z &zP&_y\\Je4p~4a~a66ku#k#;'u'(Cp(Ks{/5KKKK5/{OO<<CVsDGDGIIJggJPPWqWYYqv}aav}ffgg˿ pۿpvvx}x}  # '<= )$ )* *,),)?$EMet4V4K++KVLL!ATAQTcTeT=TQAykbPk?:?cenwnw=HhHZZhE"[M"OOMoyoq`Ehqy`{i{ir j !rt!~~>u>**tyu.//22.uz5jy5z8;;<<AADDFFJJfffmfmsUUYsY\\]]_hihillppuu ||Thy ""# 6#6( (''!379>93+3b0EO0+E:OWP3$$=W'3(3>C=)31M1XQ3:7j:[7k7{?@?CPGXM[jGkSaS%ammd^% z z^wTwdTd888888d&&'()o,,v/v/225{577::<<>>?@A@A______?OOQTTVV{u]]``cceehhiimmtstsyyzz >+P--..00  11JCBUC 4 FM37d@J= F6=D_J_DUgg;3;afanYWnjGoYuEEfuWGvYopY v r o)))))jfw[ p{[{xwx"~"H}}')),,H~0'446Q0|6QQ|??AADDFFGGKKMiQQRmRVXXtt ttt``bbmmpprwsuuz{rz{fYB/46/ 23$.+.$BY-21!(!(3*5*ULU#[#+[Y-7ZI13C\8_@Z7r [ MvVvx@svvv3vxJvvv8IvSv v JvWT3vvWvnv}yvPqvrvDvvvv=vv(v2vvvJvyWv vvMMMnP::VXV\BBDDGbcGcblC_lSWWssssssaadsdff}kkmmpp||""0"B*1"#*#0591L!$!"2 44!$"- AA-AE3=N32"''FR8e87RFJ7JSMEATSATHccN=MATAHcYgYI{ I X(XU(U&y&VyVl..l66nb;}b;}&n&)t)**003v6688ZKK@@tZFFGHH!JfMMQGQRqq``cdcdffjjkoksosR~~"Ac+ 92$S ,+--,;l=Fee;2+'$$E!!E$4Y4S1Z^g{^g1aLaIm7AI7leKTqpipq i"K%W|\NU.uutT WpNbpU"t%|pwpS)b\.v333339w<9p<xpv%(%v()-)x-5JJpJJJ*J5[{X}Ry:X{:By[B}]]KKnPrnPr[[z_zbbg_gjnjnqqww "$$*'&Y +&*@,Zg@FCFLmA.*]*>99AHW,+/.1J1H>CWcfc]2=29<de@D<?d?N?/Cp?NeDpy|yhz|z{|||xh|0x~6{}Ull~0||7}U6o6o7||&&B|||I|I0044|||||X>XACCF>F``AMMNOjNjjOrWWrZ]]Zbbcggijjrrtw"ctiw  +@CA" J f++'G'RQR=?|_z-?-\E6_6\)=)?Xff`5K5 9=E9^a X_o_u__Bas__B__o_u`K^xk x &&&_,mp,__vp_hmk__yv88e%ehk%''(l*F*lHs{H2{2P45PS~}S}|54|=Z([DZD~FGGFKK=MiMSSUUWrYW[wYw`bbc`fgcjjf[gppqttqwwx[x{}}{1"3>XOGQ""7@Cne7+100J<3J 9 L9QNQL9X>]8]O@EPh,PE,CkyTT:neyyz??zz@\\zz m#Rm_&~_(~ &R6^#d6kd;k;z&&u)u),|z,//06MMz6:z:>0>B[BalabKKLL|jSlSqrZ[rwZa[affkkmmqrr+q ' <9N13'177!8!8W* 8J 4*4J;; h<5F<" :F59HC9\"=HWCcW=\cNVcD@`cDNo@ov^VsvO#s$`OAtTt\{A#}T$z&&&&&zc\^cuc?2z{2cE^G p c"%%)"u}?)*,,pGE~xwLLPxLR~PR*<<UUAABBGGddLLfyXX]]|y|ddhhmmttuyuyzz}} 3& c 4&!8!4.4-54.;-;5 99 10D 0D1N4\474NOO=CSCU\V22V__PP7Q[[QR6>6Rf8fgMgMd#nvnE|EvFj>Q|jHF#H#" | T/w**WcUSWc/wwoi|o&i&((**+GGGGY667::Z>>+YCCZFFlLL7kkmlWWYY]]__bbeeffooqqrvrvyy{{  y ! "!,=S <9 =#BB#;9<?)IAI="?@$PP@$'XE^'^XT DDXEXshGMtpuMpEsXGthXU U Q%t%QuiHliul|#$n$*#*,w,.HnJxJ3wO6.w88`YYYYY6`OH`HNNggTTVVWXXWv^^vcceemmnqqsszz!";,<n    )A9XM|) 2EY29FF7)+?+?E4Y4]=]:L;_;L=G]:<GJ54J<]Mp]Ml@lt<xt]x]h{EhuUu dx$ fdOfaj]v]|y1[133]3333o|[$o$%}k)%})k,,..0022j{6v6::<<??@@DD^bbWNNrVnVWn[r[^^_cc_~~mmqqrssr  ''(""7*'+3('11-4G_AEA4P5*'Hp8SPE8I#@{k#+'IJ/J/HEQBUUOaaa7e7{777x77ayBUvFvFKzbOK eObp |p5|wMw{`]M5`a $i$&&')DD/'x/)113Qy3Qy<<=>=[[>JcJLLMhiMZZ[h 4ee[}iA7}V*ixx'3-GE !!# %%54S5..ABEB7N?7YNV*U6UY6X7XS0YgY^S^z0bb\-A5FY]YgrP`YrkY]YFg|Hy]H(|Y` ky(aY'-\8aww8!!8%%'t'))+n+,,J4455787t8>>B[BnEEFMFMNNRRSS[[^x^aaggjjmnnssxmxzz}} # (  E? *..**&--C:C*&3WCbCuCcC\CCCC:3CP6ZV6CC--CCCV@CCC<tO<OCCCCItICCCbWCh{'C{~JeJW~ h #eX# \X1ff \,//b1uc w w"#"A&yA&+y+--E11MKKMR;;==>?AAEEH>HJJdOdOQQSSTTV?Y[Y[__z#zziijjsvsvVx{{}}C9Jx ! ', ,%. %.9 9 Z@K9/@/K959d9\9IW99Ky9!X7Xc97Z2ZKJ5f9o929dbbP9ee66ghghM\`M`\NzNW|L | kR(kmnn(-dma]yad!c!""f(o?A(**GG.~3.~3466884;;V@V@BBHIHINjQQNTUXgvTv g$'qqst0+<{{UXs!t @$'I011+2)2)+C5C<5<//JcJ>D=JPKJ>L7YMVM79V9LDzc=A^A^hJ/LifiR f ho]SJuJollJ KJSeJmJ%u\k \J k%u**emw w x?$$%%x?BBpEEBpH/116678/8;==>?X>FFL7L?UUXX\\^^``{ddff~~nnq;vvw||}()w} ' (DY'()A9A<&<D@5452S4#aS#222jS*..*~SsSa:IIj:_SEJJEBGl{SKGBlCOD@SSOKPxPzxzp]rSSSSpzj]~ZsZ33_"H"${$>t''t**,,-HFuMuMq6699-UWBWWWBW^JJKKOOSmqSqqGq_qqmwS``wccddjjooppww||~~  .#9&@% . 0 1!1!0 #  %GC?C2=2P/PCz/53r35A_A^N^ee_iZD4D:MQQ7:HHfLqkXLGXki_Z_ Y$ r r+sUU+;uhY_hg 6s__ !u;g>&&!l@n@n..3v>s38V\8{S;vV;{VWW\HHKdKmtOOXmmmmXx\t\yxyeekkpphr">/}}~~ " ?=66#55#9'>N9G/<G47Mfq<IN/0I0+Z+^Ng^gfbxgg{gg gfggggxx[P[l`Sg`S#g!&gNg Ro(R(/gll(g9gfgHgyg3mt:myiYggjgi:ggxgg+y x+0x.n.n033557{788{:;T=?:TDD;MjLMajLUUVrgr7rr rr=`ab}~V`bhiiklnn?qtqt zkz}l} h #& ''/()<<9 144Z12E2(JbJEPWC9]S]*PQQ>@cKO@PEK9N9o t  WEfNcFBGXF*SHGyY J uR,xZ,uZsxZ0j j A||g%%*~~AD*,-.5-,MM5Mw99.?S?AABFBFHHJJMMOOQSnnnQn]]^^aabbefggqfqrruuvve||~~ ')"$ ES>c&0'6(6177C7777+1+77O7;D;/ 7$72V&7207B=8_8_X7/7U7c7C7Uj7E7R7=VR s x7c\\swYw`jCYhEg  R xWZZy}{ yw55555W !"Z{!{((l"--KK3388SdAAEEdiLLgiTTVVZ[[^Zz^z~h~ihillnnppssxx}"}  ' ( ,%%DV, 7 7 t 7X   U  ::B@F@s`;h\;F?.1.2/\F26 7c6c]?F]=__=X=}taamUdw d ffkl(zX{g{Xbeb88zk8g((w**//11446699;;<V>BV>B<DqIIKKyiRRUqpUyyyff~~mmooyy F1!.!0 0.B ,! 2 !=GG/=!HH#F#F3!!3!::JZ+)ZJm+ 0Eewkge:ENrNZrPPJhwhwL~QLD k \Y M7t\VVQ~k~ZaM~`t~4 Y7n7an @?~v@?''lD!DJD~DDDlvK335588~~??[[DD]]HgHNgNiiqqZZ}{{{}{fghigfissuuh{{~~,2  -)- 4+)+46)*6*:),)e.):,&P.PT[\T[/#S#&)9\/Tj\9e_e0@jB]Brcrb`c0\wb]wJvJQ""OQ1OR@\ttYXYR17^5"w 7| w%|%})^)A,Av,1331`>>CCEE`kNNPk PXXZZqqaabgbgii)T\]uuvwwv & -- ..0 -0 ;''-: S!G!:-_?2<24O<O2@[@[-?-BJ-<oB<YoFoYXFM\xMoVy } # QQ#rhhrxxz{3{z\oxoyo%%''CCCCCVo11|35t5t3|9<9</=ABABCDDbRCRSUUWWXZZuuX^u^Sddiiw~w~&6;!#G#64E@;;EF @FG@G*"TOH"@H@0]0::]7]e7\6??V8cp8*@YO@gY{gh[qe]I\]pch]PNPf[qI]]r1111`fq,==@=]===ACrC,q1133LL99;;>ZZZ>HHIILLNONQTQTUVUXYVXYk knnrrwwyyO}} !    *<@*55 T<22@+CC8V)8c4=`4@+AJNq`+aa)a`AaJaP6aBaGaq6P?q?GBDaZa~aDEtEbaaa Z ~aaa[baaaaa ;;u&&''up+p+,,vRxKv5KL5x88RWWYYYYYFEEFIIJMJMQQlXlYXY[[]_]bbff_uuww||a#2v  ""!#!2:0:#=;D;D==K$K%B?2$%A9(NUN12>-9(>t-42O214ABS2SO[HeHTvsT\C\nnc}yh} qh q `.o)~R)oRsv3z`^^./l/lZZ3~v37zv7'' (pppFFF11LP778PaL=>=[BDD>aHHIINNBTTUUWXX__``8gghhkkWww{{0 *  *BU, 9,9 @ ++@: 4:<$M$ 4 Me;< O?[Ccy;ML?AeAEGf^QF^fOMCYfGLMEMFQPCYGPsZJdZSld"l"p(( (M(f((ttv.sf.ySfivc58c 5i'yf'))**u,m,112zzzz9z9u;<=X\;<\\aHaHjQQRjRUWWXY`YUX`aa=~~qquuvw{vw{|  |   ""&$$&  % .. [>A7>+A7e#!#+!K/>K[/?BB-?ZVZJcdPd]4]bgTCTbcVSrSDFixir }x-[F hhm,6z22 222%2}6""$$''l*l*,-,33-8899W?C?CEFFIJEjISkjkSoWZZs|s~h|~hmmpqpwwyy{{ q VP4C>[.++.()) (RT =V2H4/Dg=!RDT/=V2:eBe !D[:o[o4HoroccGKGtooKo Oo UUOtYvYoxbr!d9!ol&ld&((**LFou3J355L::;WWWoWW6W;EEFFaaaOiOikkXqX\\z^|}cz|^}clnnluu{}}{ %" =H%D'" G'G7#IB76?+#$?GtM$I6P0M6PLL6H6W8W99Yvx,LDrDbKyKD kkN/H Qm Q URu**Uy,N/m/__zz<qq<;@@))AA..0022343|S~S4S|AADDFFHHNNRRUUVnnV[[``ccddkknnuu{{  *+,,+I+*&6&6IB0I7$78YrB5=58YSOS8/(9jZ9O>]Gj><?R   <lX?X_Jl](OShKh/Y MM| w~ GO wxWxJ]W h:~33^^!:!i$$''o))oFFFFFF55y7:7y:m\\FFb b%|kqA[Bq[]]`d`d+Kyzyz{|}}{6YO]_|$+=+4;? ? 9 - -Z.QB.BGP<PZA\9=Ka1|=a~ G^g^@Ix@xcx hxx;x9xi!QxGxQ Zx'\xAx=xcx_hxxxx:x:':::o:CxxxCx~,0,~0YxxxxxxSS<<@@Ab]AbMPPRRMUUVVYZ]Z]`ac`efannpqcpvzvz{{ef q  4   '' - '9''"'"<'D'!?'.'C!CI'1gDI&G&d'Q'g'['?'t'F4F'4.H=1.=HX1 XB >>B?dWEWE_ILQg )  [^)_^t _\5u5uo:"o:l"lj+t+,--,KK8S8>>@G]SG@NffNPPRRTTUUWss``aadeeWdjmjmqquu||~4 3~;-.K99B#1i#$4 / G/ 366;L?LK.EHEHI0I0K;B9LCbg5g1CisofoXosyo9hSf\ShXkkvo{oyoooj"ool)lo-{oonp:$$nfA))Do:pG)22466z9z9;;??BBCDC`HHILeLANDIrN4rZZw``cfDwcfmoowwyy||~~$   g?,,#, # :  /: .:/5/b.FFPTP<8EA@MMEAv<:3@58:a3:O:U5gUgbnrnW:8brKaKW\qO!\!%zz}%}qps]ts66pq&t&((G+,,GuuL+6699S;;?S^B^EEB?MMjjPPmmmXmXxvwxccddffnnqv q:q!!T**< . 2""N/4NN4ON5NO7)72./.>N5>@83R-R@U[U8kQUUGJ]kAGA||[Q xzu((((xuila$ali$J%h,h**o,E001{w313{88<<>>@@CCDDHJHLPLJPmmYY\\]^^ee]hjjkokhopqpq.N-U !< 2  "2+.A#)+ 5=. 5&=3JA62#&?-?=-9KO/O4W;9=/='25z u i l I;INWSXNK=X__SS|Q| Q h%%%%%!%zSzo**mw1r1r`a6`a:f:&f&'xCC,,GHGLLL5G@5;;??@BbEGGbJJKdeBEKWdWXXZ[v[``abveeffsZrsarx}x{{}$Tb " =4Sm$$$$$$+$+$$$ $$ $$ 1$I$ L$c$M$g$IT$Y$6i$767\$~$D!DLV$$cMgT^8^8IYdAuFud__hmk\l ~imk L ~x' YVli9o9#;o#%|%@@*t*++/n/J|t9n9~??HHJJLLMfRRSXXZZ^M^aax}eeffjjkksvsvyy{{S  $1 $<$&2!) ) C C<&&2GGT'AF'T,T:'hA6:T,AUhl NUThTUPKPlTEtEoOoNT`TtTVicTTVpTh`-|Tu-T//-rurc"p"$|$%''w%|,,DD1122:S:;<;}<?@ACCDD}OfORkRSkS?bb{ffmmoorr@Awwx{x{<|B>FI   # &((!)# = 8!6)!+08EBQ+=>&QGKO6U6iFcTcH5TBI--Hg5gVkJ Kk]kknkkkkkBY[YVnJ VkkKk%w%L]Vtkkkk9lt\l\kkzd#k9!z!~k"k\kMCCCJkC\LdLM44~L99::==??AABB^^H^HMMNjjQQUUVWYZNZVY|k|i|H||C|Wkkmmooqrsq &!r=s~~E0..1G#55U,@,2C2F C@D7XE<F@7\"J[ED@</i/LpibLb[iip>jxi>iliiIyi}w{iiivwi ii}v[ziIji[t izt"x"$$%Gl%,,G..1y1u35|53{|::WBZBEEGGIIKKLOQQOLUZUssZ[[^a^aeeggnnpptztz1   @ X '!0!22) ;; # 4+M#H4+ Aj'\HHY&AV_YVHwjtWNHWHH&Vbo=HcC]_VACbNj=]H \HcNjV ow\lRu,#\ldwdv333ik3<i5!v!<#&~~m&{(**(--00J5J5669<9<f@AA@FaaafFQQs[ppppsp[\\``ccdeggdemmpprr||~~0)/''BVN/+M""B?,?,88C$O7B7:=O$=$CHVH_>:>_HJVMnVaMa;;NRw IR XW]WRDnXGkIE}{VYV}hm#J{# { lq))Ylq-V66j6Kj&&''LoP--T7KsSwL7wTPsS==@@AB\\HHbkbkTTt[rt[\]``]d\dhohorrvwvw +0V/>>##?;?533NEG]5D88( 9NN$ ))^$0_h_.L.aY. _^acc LObOYQmmQfCUeeUCgfgi o'jtVk,jt**Vx, iqx q|y<u<k#|y|BBB BnB#us55}PP<<BBDDG]GldLLdPPRRSplpYY[[w^^bwwbSeewwyy{{}}~~0;(9 /! ) ,!,((!3838"!K!",.!N$!K$1 M 1!IbC/I!C%0)00N:N/TFN`N:FF`O=j=?EhzhEQnztfstdfON&dU& kr'kUr]'V]}55qVfqlH*mq*qH00m2525>>@@BBF^^FLLMMP SSPUUWYYuu__aa|Wk|~krvvrzz{}}~~  ) { .3(3M(63%31T8,-33 3339(389(j$63V-Qf1333-3$3V3w333u3]K] K3N QQN]3wyHlHy | #X#|Xu//lgl5m $g $&&((-/s/006-6s??AABFFBMMOOPQQSXPX\S\]]``dffd~klklrrvvxz{x{~~z.  ,1)D GY8.8E<E)1D22G=%=%Y++Z^ZLZZmZ^ZZHH3UUgNsN>|ZIi[ZmLILZ m>s n((((Z mZ^ccm"a"$$aj[s))**|F//223636779WSW]9__]JMMJRRSTlVSYTttYVeennopopttxxzz}} ,.<,-' :8: ZOa8??3gsNO#OiN! ';!;D.&#<.[a&[lA`n LUDlaLlAjFcFgKgK<ODOQX%PqqX%+Q%%vd(+(v'/{d{44>f>f&&'()/)(/0w047478S;;==Y8DDGGIIKbOObVVXX]]K``bddbiiknknoottvvxxzz - '    +,,""*<@3@5>5#C#$H$-->kEE`Uc%YY%J..J1[hP 2Fh1m2mA[mAmmFmAm ALpN{|{Lm|N mp}}mw//r/qlmmm"w;m"q)~mmm)wu-r}-././y~uPP99:BXXX:XB]FFJJeeggQSsSQZZs\v``accdhdahjmmooqqrjuuvr\ v+ *<>3'CH'mw!# #G+EW(ACbT7RU'+RK0;GWACb7T2=2} =l u y U(E??wYwwg0Egy;EYYp V **xxww^1^]zswz1]<99tww<w))Vy-s-}It}I225w566::;<;<EGEGeeiRRiWWYYZu]]aZadd ooss|| ! E,=!,K33, / /HH7,=!..#SS#>?>S*V*ypA8e?S^@eBCI?FyQtztCz8SUFQyufN f @S^SAVUymbmX{X{9{9}'}')})*+p{/p/*Kb2xxuyxT~9T9~==??A]]]2A[QQ%Y%Y]^A]^cZUlluu%wuwSl7 ,,4SIy{4 VD;D H<C<H@CKBKBB>UL>ZLZI(EIEU[[G@-F-NbM6_nM6mqmot_UocjRn RnU h.h!cq.vx222@2U2q2jq v !##$$'',,../1133~6~69Q9/>>bY\^^\^bbbPPiiTTYr[rY__cc|ggkklrrlww| (  ;("(" --(FG424%+))0Q%50SJ8S \`=tD+<+:85Q:<\pC `CI;Iph;D=hE~~RFFU& ]]&?}b@i7s|sa|7}EpUpB$$%uAb?i@aBAtutp133481894==9F[[[+[p[[FIIJJjPPjSUUSrZ]]bbcZfhcllhopopf    2 # #QJ))&2/ /"+ <C<C2&AATL?LT"/B\B?ReRY_ReY_EK>@@DVE`GnOdnOK`DdHMN t%%%% %%>`G`V`M`a`gr9jv9gq$%''qi$j*--s~s0s449~QQ9:;:*;GGJJKLfLPP0TTUWWXX_uu_zKzjkkootjtxxzz|}|}U & /+&# L`riv())> \ +>E#&&(&!C"C")!/Y<+@HY>)&@Za,qiN/>memyiq<>a>M88[\p,>apMerAr\iys%%%&%>%i%{q{*0s~7]sv7]b "";v))++..//II57795<<=XABC=9BcCccSSunnYZu\\Yeeiinnqqss EC -#;#;V;- ZD:0:DKI0K??e[A-VJ[[;>J2F>Fc;1^^21c_QkQ_jo@dl~@jbtGojlM t P$dMNp$NmPmuW~,f~f6ra6a,urp hg"$$v"h(yHx(vHOx0L:LOR0y:R>>FZZZ;ZjZFGGwMMPPSSnUnYYZw``aazffiizvvyy}}Z:I!!%% 44//47' 74' <JJk<4),4MGp)W484X468VeVep4Xk\kpd]^@d]TTT[^gK rhKg #h rbg[b#cc__**Wjl~noWnl$%&&j,,GtI$ozt11z446I6UUU~AUAFFGGJJMMOOQQTTXX[[uudd}jjnntut4[~  +' 7+75",65''" I IC8C8N?L L!?UU N'\!@PP@SS9H(Hfef/VaWg/WVge\alRvlRe#voKx|_#\e%%%%%o_Kx`|y4 ! w!&&'z)`'z2)23557}7wTY<}<[YhH3cMHhjcMSr^grZuu^'uc{c{Zgllpupuxx{{||  ("($.$(@.( 9(eB.BfvBKUKCEC]=E]NLLI4I4N1Y1Y_??_fBfVV`rTrFkyRdTRF%P+wwk##d%z#fPkn++~ny+~}}qqyz799#f%%@)@)DoG0o0G23447v78SSSSS8BB^EHEHIDLLOORRUUVWsI2a3abceeVWsbcuuv v(  "("="(" ((((((( ( (s( (X(U=](z( G(((NJN($((((P`Z((GN(JN((([`N$N[PNMMCCnZNptpjqjK_n`sXY  SQ YS\x_qwr \iz]8w899$y$y&(m(**+Kt.Iirm|II}&z.+}99:;^=F=d^FHH:fdfRRSSVVXX{\]u{\]~~;mmnqrnyyN`tqq "r  ""1")7"8")<"%"2214"@"7Q"8><>I?I?N"W"c"e"p"%"l"4{"@CA"QAC5O5bYQbxNoZWoZcrBvjjPk[B~w~wk[!e!}}Q|&p**-cdd;"l"##l;&((-p,{,-Hut&u-{6699;;^XAACC^OOQQ XX*\\``dd0gghK8h>srrw wR}}~~!! '*..'3/)/%) % + + OY$10:$TH44TvP<2KDVD75V:1f^f^7><5j 8bjbku >uksxox_q_oRt##Zz Zvz vRW--y?=sWy "n"q=$%{?CCCCCC$p J{npJ%??[D[DFFHHIIOORRTTWW``a* kk)aooqssqxxy~~y3! 12H5* )99=-=-+3#.#3(!=(+=='=;=,=\XL=Y=';:=]=l=\^U;^Q=PK,zPKLY:]y[=ElZQEZ/[__tbM0 hMd$h|b|ect/c0 em8w8f"f"&&))++,--}mHH445599;;W=??=,gH}wgHkVVWq\q\]]vvWggkklmrrttumu . e16X#060F#F UM I373N7'OJ 2T[T1P1Md[ N{ sssPYYs< sB sS{C sSQ s s s sRQcRx s s s s"sxssvAs^ss^ns#ss#s@}@?L}Dsss+sQss2s2LU>1MIU>?@?N]@bbMMPPlllllY'vYuuuuObbJ2e}ggecqqstst  +' '5+* -77 1 $8$ I 1I1O!O!UQURW)Z)RZ*5T.w.a.o.}.~.T-5<i<u6"rur:xjw6xTw:aj"  o   a STw}SvX^{^~cc!f@@ 7G//224466!0VV?`DRD[L?V`oqrk^k^y||yffhhjjlmlmvvwx{{w}~x} 5~1 &8$$1OQ7W133 .(Q 7G0iRGP P'95CO9C'5Oa>aRG>8:[v X8LX{X=]_]Goggyf!R b!!  ZS\( (Zc\c|;epe;%%&by&q,r,0|022K44y7z99z;<7K;B<`dG`IdGhITsTmVsVaBx``addggllmmssttww&+(1 =our(+h(1:6 9::+ -R-=K3UK83_LS=LYySpEkE=YSe5cfoe?5>cfMnM]FnF]ur h vN_$O_  O$v,oq^^q"7"h@y@y**,,-.I-x5}58.x89<<9>?ZZ?DE}aEaXaD>WWXYY^^__zddjjmzmqqssuuxzx|z| 6(+ R (8U((6//Sk+C@C (((/(F(@U( Ff(Q(>?G(&R](& +Uw((}(O3ZOZ0N UfR QTBT[LG^ o [GpP  p  VoLkV\'k'  `) r    { )] wr`v w! ! {:v:$ h& $ & t+ E+ . / / }II~4 5 :wb4 5 . ~XB B C igC bbgiS S U U X X [ [ ` u` }   o o  z z | | }           +  6                          "   "      (   (  , ,      7 ' 3  3   )    7 )        9 0    -  A  %   K 37 Q ' Q   Q * @ 9 Q  b Q  V  * B V @ LP\e : ^ Q - Z  Q t Q  e l Q  Q  Q  Q  _ f  _   b  b v Q % Z   Q   Q A Z ] u   Q  ]  ^ K Z  L i W   L  N  N W   h$     q t$ \    ^ 1 t q Y c n  6 l  \ n 1  c  6 r  8 r g m m 8 ! " ! g "  h  & ' & h ) * )  *    . / / v O    .  4  O 7  7 8 '  4  8  x< X     @   B O    ` d  @  `  a   a   d   B  O  j j    T  T       Y  Y   ^      ^ _ _  b  b }   f     k    k f  m p    p q r   r  q  v   y  y |    |     v                 %              m                                     %              Z  @    :  f   ( ( +     +        6   =   +  ;    ; =  9  ,   ,   A       >  :  3 C  :  3   $  =  1  ? \ # 6 + u   \ 9 = A = 1 > 0   $ ? 0  i  #    E  K e 2 Y  K i E l    e  X [  X   D D l $ =   N N l  2   M  i  [   w   o   Z ` ~  `  o  "     }    *  n  s     d 5 M l w l 5 t  d F    <  < + < = < l <  < Z l    @ n  u F } l s   u   Q x  Q  T t   T   ]  A    A B C  ] F  F G  b K  G  K L M x    M  R  R  m  m   V     Z  Z   ]  ] V    a  a d    d         j  j k   n  n L    r  r         w w  {  {                      k                                      !    !            #          $   - 1  -  #      C   0      '   9  #                (  @ @ D  0   :   8   8 :  D   3 ) 5 ) _ )  3  \ *  \   ?  ? H $ # ' 0  5   9   _ ~  I < ( 0 ;   I [ ;   [  g N  g l S N  S c b  b    o  c ~ E  ~  Y E q E  " v o J J " v O & ~ p & i p  i   Y       q s    s            $  $  >   (  (  C  C  C  C  C     >  4  4 z P  z P  ;    ; =  = >     >  C  C   F  F G G  K  K L   L      R  R   W    W X X  \    \         b  b c c  f  f g         m   #  0    )  l    g  m    x y   {     y       {                                 1                   9     %       !     # " !    "  %     #              *  ,  2   , H   2   3    7  <   7   A  ' /   < N  < /  ' B N A 3  B  Q - -   H E              , O   Q D I H /  D   Y ^  J  Y  ? E  ?  O U  O  @ d   ~ h  M  ~  @ e h     e @ J I   M I S h   j  S   V j V i  w _  w _ .  . i  `  o | 8 o r   r  |  |   8 "  " :   :   & &  P v  n +  + -  - v |    | 1  K   n P 1  T  =  `   T   =   Z   Z B  B   D I    D    I a   a   N  N O   O    p    V  V  p   q   q      x  x 3 x / x I x h x   n        m  m n   q  q       v  v   x x                                                   K                         #       #  #               )   )                 4  C   >   4 C  # % 5   A C  %  A     #  ^  E  U  d   C  #  W 9 ;  #  9  #  W C T C  F L  F  5   T @ 0 V            b C  C  W 0   @ a  E  r E  G a |     G  r M  u M u b  z z P s   K K s      _   ^  . Z  Z   .  j   t "## { ? &'_  ) {  D j  ?  t  &  w  w  w  w } | 9} 9'   @ )   @AA C  C H H  J   c   J   c    U  n UW WXYY [^  v ^__ c X c  [ h h  k kll   p pqq   w wy yz~     ~  z     #  C                                 >        /3/0  0;     +*  *  +  L  ,Q,PTPI\Z$!$L:\L-4IaMM1R`P RdOr]-aO4at^ t{d`E}s|}]`w ""a""""vj| ) ) ) ) )|av5n5na!!"$$>">E{..11445x5:xS:S>>AAe ^E ^ ^ ^eERRUUWWXX\\]]__ ~ff ~jjllqqssvxy {|}v y{ 3|    ** QT}8/!8Z 2:  2 /1`rN{O6NNN6N#JON#NCM&MJN+sCNja+NSQ`6`N=SaN=;cN;[NeNc~NO[ eZNiN     ~ Z iVV17g7<g<%rr%>*FF3*345P45RT<<T\\\\NNoPmWmomW[[\xNxxx)x|xf }f\jjllnnqqrrxxzz  (()6..82&DD@2@)6) "Q D)S+S+TV-)d)T-X)]_]M)DdbUd-bd^e^XMtgtodV_o|eg`Y##ZcZaco},,`|Y||7h7pph##$$isi|)~yFyF)suI~I4466<==<ABBJIIJLLOOQRTTnQr[[]]__aaziimmnnRxxzz{{8"'1'1,7 "' .3 .3/ CU  2:,'29U!D!9:'7'U-M -DZMZScPaS } VP cvvYFYFK\\Kp~|u(e5~VrvpU|(rXe8X56d8dvu>>AAAAA/I/I225u59}R9WWAA^^``JJKggiKooWWXX[[yy``lloopprswwy}y}rs'"C: !  / :03<1!!i:  ;-;L@@LF)F0H3H)I*IZRZU>D>MGM<eeYY1Oi? P?Pti OURtciQ^_cqiQN^kq kc iivi}55~8im8bm"b"i''((*-*-002v23S3T9T<S9?<[[GG?KhMKhQuoMsuQ__bb}}}}llnooC  O X #-R6)) / k/ 45 45*RDG1+1+CO JI X#$$::N7V7_VRk6ZPZPTUTspUsNpNm~mp&c!x^~IJcpp~!W&&pp&&pxW^]-8]jaj=dra8>rd=v'v>'DD.G.//SY66SSSSS[Y@`I[@`bIeeOOtRnnpnnnntRyybb}}iliruul{{}}r "" ++**(1(J 2 0A  0GKGA#L%=21%#SJSZMZ&&$]$)B)M4BN 57 8]M87^nmnD4M_5M`jDm`a^M_mam^vmU,w]w,v:xmc9xc9k:"y<ok%py"o%+p+../H/qHs5566::<<@@CCVDIIKKMMOOSS<WWXqsXbbddeemmrrs  -  s18'  (J ##Mm -K11&L=J 7978''AEA N(;;F0T0JGNUN_L_VBjUBYZ\ [VUPp =oop\`ot~q~PU}ZU}qGT[U`Q=URQRtt223tvtf!!#:#0tDDUDtDD Dt0]vMM5M5^;;==3??^]^GGIIJeJeRRkk\]^b^\b]efefoqotuwwytquy  ' & 99 "&"4   E E - 2%2FTA '9(4331L($$%a Y 1KK@E77UHUA&HQq`*`*aOOc6c6 NNc:VV :ShhSlNvfvxz}z} W  r ssWxlcTiiT|{~d~d<<|??**+nrx//12466R12??BBDDbbg4bgPPQjSTSjTqu\yh\hiiooqqrss{&-{r    (@ ( '  '  <A)A)$$GcxG!R!NNE,< 5#<U8U-.8.0WW05EMk]kMwk]wVk{,R#ElltV p wXn f[^n++ X++[pk166  "$c$%fk'(%jIvB'Ic(vwy_yQQQ QRQEQj\"_LLgguTTVVXXxu_x_aazzjjqqxyxy%8kq6Y#**# 7.7./0B/=-k0=83 8>1>WH1WRSR2)B=<db6b2d<6t ilEO9iZ ln 9 E ^O=YZ=YIoIt``t Mk!MM!MMMgkg45?z4z5v4!v&!h%h?%&@))GuGmuJmJ228~|NN~|@89N<9[CX[CcKcKnpQQWnwWps<[^w^``}}ggkkpprrts{t{~~[       N ( I G U =3H)Zf T    x  $$    -  S -' ' @,@FF:11:NI(**L$MPMZoRcRZPM T Gb ebe=od=dVoVUhwhu Gyuf"yl"Nql   qT./XY/XY f66v"<<"v(()*+6/)/*335x577:+:\>>?@E@\.E_H_?MHMOOPPSSss_rt_iippyy}}~~; ,2:,,LPc;1-1-0=0=.TT4JA.JA%<b<w4TWa[K[K%T989RcRVWTaTWVChTChtfft I    hITTeTWe/qhqz66g# zgs..#26s2688PQ=|=|@@YY]]IILLPPkkUUXXu{u{ggiikkllooQvzvz2     ""+ + $ %  1 $%b' 1D38'(D(c'Y 3Y090QC9QFCF*;e;KRTjT``jN:NZ<:ZO[<MOj s m [j tx,,KeVV\sjRe7^!}7!$$%n'A'nyA+tmry+4}\x45^xx85;WU;CCWIIKKOOPPWW[[\w\w~~ggijkmmjqiv|v|2"29" 1) ?*ejm3x)?N-N-9( 9MXXRa*3NRM19(N*aAFLFA6LNn6MNo^Y_YottHpnarH#`p#XN%rr%.V%`UVUo.ZZf7fs$s788888;$%%llu++..11K446>=W=>?WE]]?EIIKKMMNiPQPSNQqxqqcxvvSc~~hhnno9Na^o     00" )" )5'  F5AF'AFA,,YA22Y;A;__U_UH``ACUu\ApAxAC9\pxRBRBV@@VF{ ~# O#r~{Vf[[a8Or6666 6f8=''DqDq//0v044Tu88;|T;@u@A|EAEJJLLMMRRSToSoTY[[__`a`aiijjuxxz{uz {A      $$(+(*9  *79%:C<.5.:5CD229<D : :Z :!:1":$:%:%:H\U\HFA%:':':(:US(:DT(:d(:(:=o>?p=D>W?*:yaZhqoDq^h!ZbOO! }Q-}QbUQQ]-1yp-c1v0]Bede"c&&dBG)/rts)tsG/112M~6~67}7"}YYYYYYEEFFII2LLOOvllYYZZ\vvdd\ggppuuzz|| ,   +*7 % 3KDWp^% 0%0$$..F,**3KM((#>-4+#]T4-]>VGWe_e<_(MQ   M T s Ws:sVT?<?+M:tsbb}HJH  J t  ~hi i ~r&Sss  S   GT `x {{^  `   " " # ' ' ( ( , , . . 0 2 0 v8 2 # 8 : : < < ? ? A vD D G H dK A P P T G T V V W H xZ K W _ _ ` c c ` i i l l o o r r  x x $  | ~ ~  |                             !      $            )    ) % 3    1   5 5 ;     4   1 3       =    &       J /  J   M   M   & 4 = 4       - - X    * 7 +   L  \  6 * 4 } L 4 6 Y \ Y h  9 d    9  7 F >  e  q g  q  ^      x  F @ m e Y } t !!} !! O S  !O  ! [  !p  !z!C  b  p [ E b !, m Y  ] !u  ] u f !B  ! I   n  !  ! h "!"!y j k *! N j h B t @  C *!  f E  s /! /!0!n I y  s N       8! 8!9!  0!   >!Z Z 4 Z Y Z [ Z _ _   _ _ K! K!L!L!     >! v  T! 9! T!  Z! r r  r Z!r      v z    x  z       f!    j! j!f!     o! o!r!   r!  u! u!v!  z! z!v! |!    |!   !        !   !  ! !  ! !  !  ! ! !! !%   !!  !!  ! 3  ;    !!!!  !  !;!!M!D!!!M!=!:!'!A!!'!?!D!A! g  !! =!!5!!!!J!J!b!!!)!b!!)!!?!1!\![!b!!@!!1!!!S !!d!W!b!Q!q!] ! ! !!D!!b!!!!!Q!!d!\!N!i!!N!!"[!5!D!"@!D!!W!`!!^!`!$!^!k "!!! "! "! "!$!"O!"3!!.!k!O!b!!t!t!.!k!b! 0!!3!"!!!""!"!! 9!!b!B!!w!!%"!!%"w!C!!!B!E!!!E!!C!!!0"!0"1" L! L!!{!!{!!{!!{!!{!<"!!{!<">"!>"]!!!!_!!!]!!!E"!E"H"!!_!H"I"!!K"!!e!!P"!!e!P"!g!g!!!!T"T"! o! o! o!["!I"!["]"!]"^"!!a"!a" |! |! |!g"!g"!!k"!!!k"K"!!!!!!!!!!!!!!!!!"!!!"!2"!"!!!"!^"!"""!!!!!!! "!!!"!""3"!"!!","!"!""!"""!""!?"!_"!V"!""!!!!-!!#!!X"!"!!""!"!{"!"""!"!"""""!!!!!"!"""!"!!"!"""!:!!""""5""2""""""7"#""7"""""""" """"\!!q!!"2"""i!!""L"!3""",""L"!""!?"@"""!!@""'"'"U"U"!"""\"\"b""""_""h"S"""h""V"`""A"""i"c"A""i"`"""?"""Z"Z"=""X""c"D"="""D"""?""X"G"r"#"r"#G"#"#"r"#"# #N" # #d"" # #"N"r""r"#W"##e""{!1"!1""1"#1"#1"#1" #d"#"##e"W""""##l"##$#""$#j"l"")#")#+#p"+#F"""o"o"F"J"""}"}"J"3#"3#5#"5#7#{"7#"":#":#""=#"=#"~"@#"@#m""""f""j""H#"""!^"H#J#"J#L#"L#"f"""!g"n""""R#S#X#""n"R#""m"X#p""s"""s"""^#"^#|""""S#""|"""""!"m#"""""""#"m#""""""""""""""""#"""z#"""z##"""%#"#"#"""""""""""##"""""#""#"###"!"4#"!";#"[#"\#"###I#"T#"#"l#"#####""##""#"#5""#""""#%##"""#"###"""""""#""#"'#'#"#"#""6#0#0#"###"#6#####"#<#<##"####"4#b"""#(####(###S""9#&##9###;##"&#"=""r""""""""*#A##Z#"W#Z##"#W###*###M#",#M#>#-#U###-#_#f##_###[####E##;##`###\#,#A#E#`##I####T#Y#e#$$l#$Y#$#[#$}##$}#$ $k##a##.#k#d##$$a# $b###$$#$?###.#b##g#c#n#t#$n#$$$#"7#$d#"7#~"7#$g#####$$t#?#&$'$###p####q#0$#&$###0$##3$#3$"L###8$|#'$#8$:$#:$V#####V###A$#A$##]##E$#E$###]###K$#K$M$#M$O$#O$P$P$###T$#T$##W$#W$Y$#Y$[$#[$]$#]$^$^$####{###{##|######l$#k$#k$l$######p$p$#u$#"###u$##########|$#|$##########$$#$#$#$#$####$###$#$############$#$$$##### $##$$$#$#$#$ $#$ $$#$$$$$##$$$##$$$*$$$$$ $$$$$$7$$"$$A##>##f###<$#$$$$"$$#$$$($ $*$$$$$#$/$>$9$;$$($;$#U##$/$$9$$$#$$Q$U$$Q$$$*$$X$#$>$$L$?$$)$$L$$$($*$e##H$G$)$+$$`$$H$<$7$`$*$$+$$#$# $$m$# $c# $$N$j$$$N$$$m$G$$Z$b$a$$b$e$B$%e$p#$%%%X$U$R$d$Z$j$% %V$$ %n$ %q#'$%R$%g$#'$n$S$%o$$%% %V$%o$$1$%%r$$s$%q$r$$%$%"%$$s$"%$$%%$%%$$(%$(%*%$*%1$q$$$.%$.%$s$0%1%2%q$$0%$$$7%7%$1%$2%$=%$g$$=%$$?%?%$A%c$$$$$$$$$$$c$$$K%T%$$$t$$K%$v$$$$#l$$$T%#l$V%X%$X%$t$Z%$$\%$v$y$$$y$$$\%$$y$$$h%$h%$$Z%$$$l%$$$$#$#$$$ $$V%$l%$$$$$$$$${%}%$}%{%$%$$$$%$%$%%%$$%%$$%$%$)%$&%$%$%%$$$*$$G$$j$$a$$d$$-%$/%$%$%%%7$$%%%$$$%%;%$%$%$$$%$$$%$%$$%$$>$$%+%%%U$$?$$%3%$%% %$% %$%$%%)%[%$%%%&%%%%,%%%%%% %B%%,%% %%%%%%%-%%/%$;%%$%9%%%9%%%%)%%%%3%%%%%B$$%$%%[%%U%!%>%a%$U%a%$%>%%%f%%%S%%S%_%S$%$%$%s$%$%$%f%r%%@%%z%r%g%r%^%w%%f%Y%%]%Y%%r%%%%]%&z%&&&~%%r%~%`%%^%&g%& &%$"%$"% &W%x%%%y%r%&&&%&W%4%k%&%r%%r%$2%@%_%%%k%%&%%4%q%%%r%"&q%"&%r%$&I%%$A%$A%r%A%%A%;&A%u&A%$&%%t%%r%%I%0&0&%%%5&y%5&6&%%6&%:&%:&b%%%%>&%>&A&%$Z%A&B&$Z%$Z%B&%c%%G&G&%I&%b%%%%c%I&%Q&%%%Q&S&%S&%%V&%V&Y&%%%Y&Z&%%\&%%\&%Z&%%%b&%b&%%$%$%%%$%$%+%%j&%%%%%%p&%$%p&q&%%%%%%j&%%%q&%%%z&&%z&%%%%%&%&&%&%&%%&&%&&&%%%&&&&%&%% &&&%%%%%&&%%%%%%%%%$%%%&%&&&&&&%&&&%%% &&&% &&&B%%%%&#&,&%&,&%%%%#&+&%%&+&&%&&&&&&%&&&1&&&&&'&%;&1&;&&(&&&1&?&%%&!%%J&&&2&;&&(&&J&'&?&&&_%%w%%&E&&&&2&H&&%H&E&)&*&%R&*&&&&R&C&@&&&&&&3&&C&&8&&W&&7&`%&&&d&3&;&W&;&&&R&&l&%&x%&&<&i&&&<&&8&;&%&%&7&;&d&;&l&;&&<&n&u&&n&&X&`&''X&'T&''k&'!&&&!&t%$&&&&K&.&&T&u&'&'''e&'k&u&K&.&'m&m&[&'e&t&'&''&c&%6&g&f&!'&!'D&g&&u&r&&,'r&'m&c&D&&&&&,'&t&F&r&&F&&&&&3'3'&6'&6'%Q&%Q&%Q&;'&;'&&&&>'C'&%Z&>'&&&C'D'&&&]&]&&o&&&&D'&&&M'&M'&&&&Q'&Q'R'&&R'&&o&W'&W'&&Z'&Z'&&&&`'&`'&&c'&c'd'&&&&g'j'&d'&j'&&%&%&g'&%& &&&&&&t't'&&&x'&x'y'y'&{'&&}'{'&&&&&&&&&}'&'&&'&&&'&''&&&&&'''''''''&'''&' ''''&''''' '&'&'(&&&&&&& '& '&'&'''''''&''+'+'(''''''-''#')&&'&&-'('@&&''''2'''')'& ''&'5')'2'('& ''5'''F''''&F'K'.'4''.''&I'*'7'''*'7'&'G'''i&&'H''/''F''L'\'''L'b'&'('T'b''0'P'`&&'T'8'P''''''8''S''0'S'f''I'K'(?'[&'&'&'(''K''P''G'K'&H't&''S'?'f'/'K'f&'(H'K'v'E''v'J'm'((m''(J'a'~' (a' ((''~'('['1''h'^'(h':''(''['1'''('(o''!(o'''!(&;'^':'&;'z''''*('*('r'N''u'''~'1(u'1(3('3(4(4(z''N'''''&Q'<('<(&W'''''A('A(]''''']'&`'&`'&`'K('&`'K(M('M(N(N('''R('R(S(T(U(''''X(U('X(''''''w'w''''b('|''b('|'d(e(g('g(i('i(''e('n('''n(&'r('''r(''''u(''u('z('z(|('|(('''''((('('(('''(('((''('((((''((''(('#''''''''('(('('(' (( (( ('('('' (( (('(((((((( (((((4''((((( ('0( ('('0(('(8(((((((&(&(8((((8(\''(&('((P((('(((&((((f'''P(E''(9(9('(5((("((("()((('C(J('C(#(;(J((;(((8((((O((f((Q(~'('((8((8('((8((O(o((8((=((8(Y(G(Q(o((Y(((f(o((~(B(j())B(G(('()() )a( )W($( )( )Z(^()r'*()Z($(V(a(W(^(,(.([(,(((((.(y(()y()'4('4( )x(=(o( )~(o([(($)($)x((')(')(o(D((((((V(o((D(((/)/)(2)(2)((4)4)(((8)(8)'T('T('T(((?)(?)@)((@)(](((](E)F)((F)('d('d((((d('d(E)(((R)(R)((T)U)U)(Y)('r(Y)Z)Z)(\)((^)T)(\)(^)(((((f)(f)((((((((l)(l)((((((((s)(((s)u)(u)((x)(x)((((((((~)(~))()'(8(()(5)(X)()(())())) ))())())( )))()))) ))((())()()())()()))()) ))(())))(() )((()5(()(())))))(((")(()("))())))))))5))(())9)((:):)9)%)))%)#((o(((()((((())).))A))))!))))*))O)G)(A)5)O)X)[)X).)5)(O)B)G))I)V)3)S)(B)H)X)V)(j((S)()I)!)5))3)))))H))[)*)5)W)g)))o))_)J))W))_))t)J))))<)<)h)){))a){)*c)t)])))c))*N))#)N))a)v)M)+)v)M)#))`)))o)X))+)))`)X)*)**)**e)****)q)e));))m);));)*b)*d))k)q)=))m)b)))*))*K)z)=)))n)z)).*d))))n)K))K).*)5*)5*p))i))))))));*(R)))))@*)@*E*)))(\)(\)E*(\)j))));*)r))K*)))))))i))j))i)K*))))p))))))r)Z*)Z*)r)w)))w)(x)y)))))y))y)))))e*))h*)h*j*)j*e*)))))))))r*)))r*u*)))u*))))))*) ))))))))))))**)))*))*)******) **)*)) *)) * **) * *)*)*)*)**)**)*)*)**)***)***)** ******O+* **c+*+*"**)****+**))**"*+**+**)*$**)***%**&,*)**#*)2*<,*2*&**%**!*D***)#*)**(*O*),*>*O**>*)***g))G*Q*)G*+*)*!*,*]*+*]))h))-*_-**]***A**H*)'*A*H*/*-*,*Q*c*-**/**),**c***V*n**V**c**l*n*F*n*`*n**l***F***`***R**+T*k)*)*******++0**U*m*'*U*~**+~**'*++T*++*R*n*T*n***+***+m*0**3*3************"+*"+$+*$+*y*&+x*s*s*B*&+x*B**,+*,+*n*.+**1+*1+3+*3+4+6+*6+**4+***=+*.+*=+>+******>+*D+*D+_***_*G+L+***G+***L+M+M+*O+k***k****i*i********X+****[+z**[+*^+_+*z**{*X+*c+f+***f+{**i+*i+********^+*_+*****~+***z+*z+******~+****+*+++***&**D**+*Q**+**+**+*+**+ ++** +***+++*+++++++*$**++*+**+***++**++***++*+++**+ +*(**+ +**+++7++++7++++ +*+'+%+ +*%+**++'++++++*+-**n**********-+++-+#+*+K+A+#++-+*A+K+)++)+*++++B+B+/+@+/++@++]+a++]+++E++E+N+F+Y++F++V+0++V+++;++;+`++p++8+?++8++q+u++q++d+Y+*+\+b++\++g+l+++g+,h+I+,h+,,e+H+,{+, ,+,d+ ,,e+ ,y*$+{+Y+r+v+ ,k+p+`+,r+,*.+,x+w+, ,++j+n+m+,n++t+ ,,x+k+j+s+o+$,$,+&,|++(,.,+y+C++++++y+.,C+s++J+J+|+++*O+*O+(,+8,+8,++;,+;,<,=,=,+++B,+++B,D,+D,++++++*c+*c+*c+}++O,+O,++++R,++U,+U,++++X,X,+Z,Z,+++R,++++++++++}+g,+++g,h,++h,+++l,l,+n,++++n,+++++++w,+w,z,+*+z,++++++++++++,+++*+++++++++++,,++,++++++++,+++,+ ,++,+,++++ ,+,,++,+++++,,+!,,,+,++,+,,,,+",,+,,+,+,+,,,,++ ,,+!,++3,7,,3,,,",,,:,,!,:,!,,',/++Y++,,m++t++,,, ,',6,, ,a++N++,,4,,,0++`+++,,?++u++b++4,C,,,1,,,S,S,Y,,,5,,,,,>,E,,9,l++,5,Y,I+, ,,C,,H+,,>,,\,j+,,,F,f,v+,\,E,6,,@,?,Q,K,,G,,@,A,,,Q,1,C,,,F,K,,G,A,-w+,r,},-r,--s,-o+ ,s,},9,Y,-u,+&,+&,--{,+&,-,,,~,,,/,|,|,~,+.,q,/,,q,-,-o,,-o,-I,,,d,+<,+<,!,<,&-,Y,<,&-m,,,,,-m,+D,+D,,-+D,d,I,0-,0-2-,2-4-,4-,M,,P,,,M,,,,u,},{,},P,,,},,,,,+Z,,,E-,b,,E-,,G-,,,b,G-,,,i,,P-,,,,,P-S-,,i,S-U-,U-,,W-W-,Z-,Z-\-,\-^-,^-_-,,,,,,,,f-,,,f-,,,,,,,,,,,,,,n-,,,,n-,,,,,,,,,,,,,y-,,,,y-,}--,--,,,-,-,,,,-,,--,-,+,,,,,-,7,,}---- --,---t.--,l/---,,,-.-, -,--, -,.-/-:1-,,4--,---4-- -,4-4-,-4-/-,4--,-/--4---:--*5--:----9-,----<-E,,?,,f,,55-q5-6---e7-o7-<-,-------@---M--->----@--->-----3-A-;--A------},-,-,-,-,-3-e-L--->---e--3-Y-e-p-L-t-e-[-e--p-Q-e---Y---t----Q--[--.]-]-e--e-..~-h-..~- .- .`-e-N-- . .N-..-X-.]--e-i-e-.`-.-...-..a--e--e--e--e-a--$.i-$.-e---(.-(.--*.*.-,...x-..2.-,.-x--2.3.u--6.u-6.3.---9.;.-;..->.->.b----B.-B.--D.,_-,_-9.-H.I.T.--b---------D.-------T.I.----q-H.---q-----w-w----b.-----b.,}-,}-,}-f.-}-h.k.-h.-k.m.-m.o.-o.p.--p.---------x.--------f.---x.-,---.-...-...-...------.-. .--e----.-=.-.- ....-...-.--...--.-...-9--M--...-.---.-..........-.-1. .-1... ....".-.:.5.=.-5.-.0.=...:.".;--..-......0....-@..+.R...=.+.-@.=..R..-..-...8..Z.O.8.=.4.=.g.=..Z...V...4..S.-..S.h-....g.`.=.- .v.=..=.r.e..r.X-.V.O..=....=...W...U.U.w..Y.-./q.///N./ /-$.-$.Y.w./[. /}..l././-,.q.w./.././/`.-3.//..W.e.n.z.A..(/./g./n.-;.?.v..?.[.w...(/*/.*/.A.J.../-I..J.N.w...7/.}.w../.7/..:/.:/;/;/...>/>/.A/.A/B/B/.....G/.G/J/...J/K/K/..d.N/......N/.U/...U/..[/.d...t..t.[/.t...^/^/.{...{...c/c/.h/.....h/..k/.k/l/..o/.o/-.....t/z/.......t/.z/~/.....~///.../..//......./.././.../.....-...../././/...../...//./////// /////../...+///+/ /,/./..//,/.,/&/,///&////,//1//.//1/,///1////8//// /O../ / //D///C//-..//L/D/,/L/0e//>0/////;0/.^///J0/////J0K0/e///K0/u//U0/.l///.l/U0//W0W0/Y0///u/Y0///.t/}//|///|////}/e0/e0r0/./,////50/s0/~0/v0/.///.///r0u0///u0v0//y0/y0{0/{0}0/}00/0//0//0/0/000///0/00/0/////0//000000/////0//////////////00/ //008//0/0/0000/// 000/2$2<2>2D2J2D2h2D22D2^2D22$22u2D22J22D22F2L22F222E2G2G222E2M222D2X2M22X22D222D222D22D22D2O2:22D22D22J22O22D223~2~2N23e2R23e22J233a223a2 3h2 3 3 32%2^22t2t2%232333u2y2b23y2332322332323 3 3z21;222$3n22&3$32&3n222+32+3-32-322/32K2222I2K22/3222I221P222:32:3;3>3222>31Z21Z2;321Z2E32E3f2222I32I32d2L32L3z22N32f21i222d222o222X32X3Y3v22\32\32v2^3_322N32o2222d3g3222g322_3222d322222o32o32222r3s3^32s32122222r32|32|3~32~3Y322232333233332223223232 3323222222323323333332332223!3223=2222223232!3225223223033C333232"332"34332233333733A333203=33Z3332933[33a333337363)336333C3L223243133328331323W33323t33%323332:22N2232A3R2222V3283%3(3223(3*3V333*33=3f3.3.333f33G3F33Z3F333G333 3[3`3 3393p3`333p3333a3b234W32323234y3}3 4W3#3y34K3K3z34z3#3 4 4 4 4t3 433]3433a3444v334c3c3b34v34n3n33443343!43!4"4@3m3332;3"433@3*43*4+4,4+4q3J33{333J314w333344,4w314{33333:4;4:43U333U333A43A4e332^3332^3H43m33H4I4I433e32g3x33q33333333S433S43W43W4332s32s3443^433x3^433`43333;4333g43g4`43l432323l4m4 33r4333m43r4v433333v43333z43z4334333334433344433343334443434343333 43434443 444433434344434343333343344)334344444444334#444344344#444%433434444%444446444=4444484D4334436444D4444<4444F4=44<444444?444B44J4'43B4L4$43L44J44>4Q444>43P4$43'43@43 4]4]4@44f4}344434f4C434b4444K4C4 4]3 4b3 4a4E444?4F44d44a44k4M44k44445N4{4j4{45N4d4G45j454~4 5&4R4(44P4Q4~4&4 5p44(4K4b4p443+45e45554u445u4344554555R4{4$5h44454$5%5%5q444)54)5*5.54h444s4.53I4q44w4t435w435e4{455754754x4444{4V444V4443W4[444[4C54C55444443`4L54L5i44444i444R54R544y4444Y543r444Y5\5444\5^54^544a54a54y4444444g5g543444444444p54p5q544v544444v544z5444z5544444~54454~55445445455444 555543454454544444545555555445455554444F4454554&554844545"55 5555(55554;555(55?5555"544Q44b44E4455 5595555/5855/55'5G50555S555555<55'5<5555;555?55550559555S5G44M445[5Z5555[55E55#5{444444E5-544-555T555#5Z55:55_5T5Z5555h55A55h5b55Q55f5>5N5M55N5A5b5>555G56f56w5{56w566F566:5Z56U5_5Z5i5O56s4*56i5F5{5t4*5U5{5655{566665x455455455Q5b5455!6y5!6"65j5y5j5"6l5)65)6l55,65,6-65555-654L5554L55555765765555;65;6>6555>655e555555D65D6G6555G655555e5555e5O65O6Q65Q655555k5k554q55q5Z5q5b5q5M5q5{5q555 65555555e65e6g65g6i65i645m6555m6 55q6545q6r6r65v65v655x655z6z65~65x65~665555656566665655656566555&55556566 6666655566656556555656 6 66%6666%6855G5555666565666566555666566666#6656:6666#6666556656:6666666 66 66%66 66H6<6 666H6646<6J6<6A6<6646666J666A6669696N6646.6N6666.66V666<6f6[666f66I66|6<6626V6N6626l66c6O5666Y666C666I6[66=66u66j565666<666666c6l67s676W6776 7P6 7P6W6n6t67n65)65)65)67767w6{67j616Y6l67w6C6l66j67616|67=6l6y66#76k6&76&7'7u6l6#7y6s6l666'7617617}663737}6668765Q687:76:7=7666=7?76?766A766D76D766A7666K76K766M7P76M76P76h66666T7h666p6T76p66665v65v65v6665v6b76b7c766e7c7666i76i76666m76m766o7p7q7q7666p766666666666{7566666667666676767666666{76 766 7667v7766767776667767667777677766 8766767676767667767676777777(7(77!7777776!776.76777676777777N66[66l66W66t667C77.79C7$=C777%=C7=C7>C7>C7$77?C7aAC76$7BC78BC7CBC7BC7EC7[FC7pKC7Z76LC7Q7Z7LC7KC7LC7&MC7rNC7NC7NC7NC77Q77SOC77N7L7^PC7~OC7pPC7QC77N7RC7RC7SC7R7H7+SC7SC77{67V7}7`77H777V7SC77R7778`78k6#76#7 86#76#7f7h78f78k7x78k787W78788|7617|7Y76178g7788g7977797u77>7u7"8j7>77j7"877@7)87)87777G777G77G77G7@773876K73877O777778887O7787=87887=87777@8@87B8[777[7777777B87K87K8L86e7P876e7P87777776o76q7776o777L87]87]8v777v777b87b87777f87f86777n8767777777n8p87p8r87r877t8t87678787+9797V97777787877777777878878788877C88 87777 8777777778788877 8777778708887 88781888787787 878 88878887887N88w88878887787!878!888*878888*8888<8798<878798+8788>8>8+88C88708,87;87:87-8,88.8;88.88-8L778}7788M88M8:88E88E8/88`8(88188`888.88N88O8a888H88O88888c8h7 8x7 8W7 8Y7 87 8?8V88?88T888S888F8A8Q8s8H8a8c8a8T8D88Q8S8V8_888F8v8_8 9v8 9 9 9Y8g8 9u8 9Y8~8q89~89o889o828d8u8s8988828989G8w8688x8688e8 9J88h8x8 9h8I887=88k8d8s8e8G8k8I8y8J8090988y88z88z8R88798R8U88z8U88U88U888798Z88888Z8C98C9^88888^888I98I988i8888N98N9888i8l888l8W98W988{88|88[988[9888888{8888888888|8f9888888f988888888888988888888888z98z988|9888888|989899899888888998998999898889888898888999889988988898989898888899989998888989898+988989999999$9988 9989$9999899899999 9+99399+9/889(8898,9999!9B998a88V88A88s88888999D88B989!9D98*9D99*9,999R9V9 9R959Z9959A9(99A999`9P99E99`9939+9(9929X9929Q99b9Q9g8 9q8 99B9Z9 99b999X9 99p99"9r9E9Z9G99h9@9:h9p9F9r9G99F9t9F99F99F99F9:#99J9n9&9J9@9"9n9#9O9&9{9O99p9:{9:)99\9-9v9)9s9v99\9:s9:19t991969i9i99969::c9c99 :!:!:9 :99u9~9j9':~9':k99):L9k9M999l9):9.:9}99H9l9L9T99}9M99:y9.:9S9w9w99y999:99-999T99S9]999999999]999^999^9N:999 :9H9999T:9C:9N:P:9P:m999m99m999o9999k:9Z:99o9Z:99\:9x999x99i:9:999p:9:999\:9:9:9:9999989:9:9:989 ;9z:9z:9999:99999:::9:9::99999:9:9::9:99:9:: :::99999:: ::9:::99: :9999::9: ::::999: :99:9:9: :9::9:9:92:99::9::2::::9:9: :9::: :::::9::::;:9":=:99:#:=:":;::#::9A:4:9D:4::D::6:8:P9996::F::::97:F:9E:9:J:J:E:1:E:F9999);9l;9;9<9A:;:::1:::::,::-:,::-::S:h: :S:G:j:::_:m:b::G::m::j: :7:8::Y:::8:Y:d::d::b:::::T:H:::W:$:C:%:y:y:I:W:H:`:o:;`:u9 :;j9 :I:$:&:k:o:%:_:h:u:&:Q:u:(:Q:U:(:;e:e:U:;;i:;3:::::3:;::;:<:i:l:<:|:f:>:::l:f:>:(;|:(;:B:K::n::::B:n:/;:/;L:p:s::O:s::K::L::O:::8;V::8;:=;:[:}:=;:V:}::a:::[:^:::::::^::a::a::::a:M;:M;O;:O;::::R;S;q::R;::::q:S;::::q:];:];~:::::{:c;:::c;:~::~:::h;:h;i;::k;k;:i;:::p;:p;::::::::v;:v;::::::::{;::::::::{;:9:;::{::8::::h::::::::;:::;;;;;::::;:;:;: ;::::;;;;;;;::;;: ;;;::;;;;; ;;);:::;;::';;:;';:+;);4;);::;;:+;::;:!;:;:;!;;?;;0;);>;);;?;;:A;A;;*;:G;);W;);;*;;;;:4;5;:;5;:;;2;7;:2;7;;;0;U;);;";6;;";;B;:;B;1;::;@;1;;;@;:>;;,;:E;,;;E;;G;:0;3;;e;3; ;e;N;P;;;N;P; ; ;W;C; ;;J;;J;C;;U;j;;r;j;;r;;;:; ;n;;X;X;l;<n;Q;Y;l;<T;m;[;l;m; ;&;Y;};l;<T;V;t;<V;u;&;Z;u;;l;<|;|;d;;l;;l;<;l;;^;<;:;Z;<;[;<;l;D;};;l;;l;d;:;^;<;;;;;;;w;;%<%<w;;l;;o;o;D;F;;q;;;;1<;;F;;H;H;q;1<3<;3<4<4<;9<;;x;9<\;;;;;;><;><?<@<;\;;;?<;;;;\;b;;;b;;;J<;J<f;;L<@<;;;;f;L<;:i;s;;y;;;;;;V<W<;s;V<;W<;z;;^<;;;^<;y;~;;;;;;;~;;z;;;g<;g<;;;;;;;;;;q<;;;;;;;q<;;;;;;;;;;y<;;;y<{<;{<;;;;;;;;<<;;<;;;;<;;<;;;;;;;;;;;;;<;;;<;;<;<;;<<;;;;;;<;;<<;;<;;<;<<<<<;<<<<;<;;<<<< <<<<$< <F<<<$<b<<<,<.< <.<<,<<Q<<; <:< <<:<<<!<<<<6;;;;.<;!<;<;0<; <; <; <;-<</<<;-<<;</<<<<;<;<0<<+<<+<0<<<6<;;X<<C<<c<(<Q;;t;;<c<<+<C<6<<8<Y<<X<0<7<<<Y<< <F<<<<<8<A< <<7<<r<f<d<<x< <d<<<f<<m<r<A<m<A<u<<p<u<<p<<s<x<<s<e<M<M<<=e<= <b<o< <K<o<#<K<<#<P<<=P<=Z<*<*<Q<h<<2<<<Z<=h<==z<<<2<v<<i<<<2<<2<x;3<;9<;9<"=v<=z<"=#=$=%=*=j<j<k<#=i<<k<*=,=<,=t<<.=/=4=<.=t<<</=<4=5=<<<<O<<<O<<<<<<<T<<<T<C=<<<A=A=<C=E=<E=F=F=<I=<I=<<l<<O=<<<<<O=P=<<<l<P=<5=<U=V=<<V=<\=<<<<<\=]=U=<]=<<<<<b=|<<<|<<<<<b=<j=<j=k=k=<m=o=<o=p=<<<<t=<t=p=<<<x=<x=y=z=<<<<y=<z=<=<<<===<=<<=<=<<=<<<<<<<=<<<<<====<=<=m=<=<===<<=<<<<=<<===<==<<=< ='== ='=<<(===<<(==<<<<==<===<<=<=+=<0=!===!===?==6=)==6=(<<==6=====-==<=2=======1===K=B=)=====1==3==B===+=(==M=0=(==W=X==+==W===?=(=[=X==[==N===8===Y=f==H==Y==M=7=H=q==@==r=Q====r=N=X=@=f==>g=D=>g=>_=l=>>u=8=X==_=3=K=k<%=<%=<%=<%=(=%=)=%=u=l=h=l=`=^==_=>h=>>>>`=>c=>c=a=>v=>v=a==a========<===<====(>R==(>=->===->=s=<I=========S==s=R=9>=9>=====S=<V==Z=A>A>=C>====<]===d===d=e===e===>===C>==i=S>==c>=<p=<p=>=S>===7>= >=3>===Z==i==={=+>=c>!>={======X>=======p>=<=p>q>========q>=x>=x>==z>==z>===<=======>==>=>>>==>=>==>==>=========>=>====>>==>=>=>==>>>====>>=>>>=>>>=>==>2==-====K==>===>>>=>>>>>>=7>>>=>>> > >>>6>>>6>7==X==f==> >Q==l==>><>>>>>F>>>>>3>>=+>H>D>=H> >$>>>!>>L>N>q==>L>>> >>X>>D>=>^>>P>>^>O>>D=>$>=Y>:>^=>>Y>> >b>_>?>O>>?> >>_>>>K>>> >K>>>>j>>P>n>|>j> >`>b>n>>P>`>n>a=>=>n>>>>>>E?>a>n>>n>>n>&>|>>n>>`>>n>\>&>]>\>??]>>n>?a>?{>,>,>>e>{>?e>?>4>=>o>>n>>n>!?y>y>f>o>>!?f>=>%?>>n>%?&?>n>(?*?>*?,?>,?-?-?>>>&?>4>>(?>5?>5?Q>>>Q>>>R>>>>=?>>R>=???>??[>>>>>[>>>D?D?>d>>>>L?>>>g>>>d>L?>g>k>>R?>>k>>>R?r>>T?Y?>>>T?>>r>Y?>>\?>\?>s>=x>}>>e?>>}>>>>>e?>>s>>>>>>l?>l?=>=>r?>>>=>r?>>>>>>>>w?>>z?>z?>>w?>=>?>?>>>>>>>>?>>>>>>>???>> ?>>=>>>>>?>> ??>>>>?>?>>>>>> ?>?> ?>?>>>?>>>><>>F>>>>>>?>?>?>>3?>>"?>>2?0???>?2?"?>)?3??>?)?????N>>?????0?>???6?E?A?E?7?E?:>>?6????B?M?>B??>4?????4??A?I?>N?I??.?>N?.?K????$?/?>$??7?:?1??_?U??>?8?E?K?>1?>?:?U???_?>?E??8?O???>A???@??V??s?@?O???s?F??p?[??@S?V?C?v?C?a?C?p?F?S?[?@n?C??C?@V?@@@v?@g?m? @g? @u?j?@u?@@a?@@>,?@@V???@?@n?@@?@@d?@a?@ @?d?? @?o?#@?#@>??????{?q???,@{?,@-@??-@???2@?2@P??4@|?P???4@????|?<@?<@??Z?????Z?B@?B@C@C@???H@???H@??????M@?M@Q@?????Q@????T@????t??X@???t?]@?]@?t?X@?}??b@?b@?}?T@????}???j@l@?l@j@?n@????n@?????u@?u@v@????{@???{@??~@?~@@@???@?@@?@??@?@@@???@?@@?@@@@?@@@@@@v@?@???@?@??@@@?@?????? @?@??@?@ @@@@@?@?@@@?@@@1@??M??@.@/@??@@/@??@@0@@@(@@!@$@@&@??(@/??0@1@ @&@@@!@@ @(@1@3@@@?@@1@@3@>@?V@>@@C??????1@?y@?@?F???@1@@V@@?@@?;@[@1@;@O@*@?D@*@@@D@@[@@@F@1@@F@m?@Z@1@g@1@j?@ @Z@9@ @\@9@@@g@@\@@E@@o@y@?@@o@q@E@@q@Ae@Az@y@Ad@_@@Ao? @a@y@ Az@q? @e@_@ AA@r@y@d@_@AAAa@@|@AAh@c@?-@AAr@Ah@x@y@Ax@@y@Af@y@ A Ax@#A@#A$AAz@$Af@@@@y@+A@+A,A?C@}@y@,A@0A1A4A@1A}@4A@@@P@?M@@y@:A@:A@@AA|AAWAA>AdAZAABZABAHABBANARA BNA BsAMA@$AMA'A'AqABsABeAwABWAdABBAB|AdABBeABuA?AAuAAAcABgA}ABrAABgA#BrA#B$BBvA}A?A'B$BAACAAAA'ByAAAAAA.B.BAyA{ACAAAA7BA@JAAAA{A7B8B:BA:BB%BHBHBABBB%BB3AAdAAAAHAARAA6BB>BBLBBIBBBpBBBBPBPB!BB]BFBA]B^BAB6BBLB+B^BBBSBB;B[BB;BBBBBB+BABBBQBdBBABBQBBBMBrBBLBBMBBBcABABAB{ABABCpBBLBBIBBIBSBFBC CpBOB|BCOBBLBC C{B C CBB{B|B0BBCBRBBBBBCBBRB0BBBCBBBBBBBBBA8BA8BBB!CB!C"C"CBeBB'CeBCB'C/CkBACBACB BCBBCBBBGBB/CBBBGBBB4CB4C5CBxBTBBBBCB#CBBTB>CB2CB>C CBkBBGCBCBCBHCB=CBGCKCBBBCCBLCBLCMCBhBBBAjBAjBMCBAjBBBhBBBBWC5CBvBBWCBBvBBBBB_C_CBaCbCBzBBBeCzBBeCBjCBaCBjClCBlCmCBBBBqCBqCrCBBrCBBBBBBBBBbCBBBBBCBCCCCBBBBBBBCBCBCBCCCBBCBBBBBCCCBCBBCBCBBBBCB!DBDBEBC/BBCCBBCCBBB#CCBCCmCB@BBCC&CBB&CCCB$CBC$CBCB)CCCBC2CCCCCCC CC)CBCBCB CCB!BBFBB[BBdBBBCBC CBC C C CCCCCCCCHCCFCCCCDC.CCDCCC=CCCBACrBBB#CCKC(CSCCCC(CC*C\CAC%CSCBCCBCC3CBCC3C|BCC*CCCKCCCCdCCC@CCCKC@CdC?CkCCC?CC[CCBCBCCHCCTCCKCC[CICOCuCDOCDDoCDCKCZCzC+CZCTCC DtCsC DtCDYCDD`CDoCCsC+CYCC`CCCCDCDCCxB5C DC}CCCCCC DCCC;C#DCCCCCC;CxCCCCC#DCxCvCBGC/D}C/DCC2DC2DNCCCNCBMCBMCCCCC9DCC;D;DCCCCCADCADBDBDCEDCEDCCHDCHDCCJDJDCCCCC9DCRDCRDCCUDCUDVDWDVDCwCCCCyCCCwCeDCfDCCyCCCcDcDCeDfDgDBCjDCjDCCCCCCCCCCqDCqDrDrDCCCCCyDCCCCCyDzDCCBCCCgDCCCDzDCCCDCDCCCDDCBCDWDCCCDDDCCCC DCC DCCDDDCDCCCCDCDCCDCCCCCC CCDCDDCD DCC!DDCC DDCDD!DDCC!DDDD!DDDDDFCCD!DD!D.CCDCDD!D5DC D!DD!D%CCD5DDDDDDDC D\CC*DFDD*DCD!DTD!DDDYD!D$D3DDFDChD!DGD!DD$D7D!DDCDDkCCDD6DXDICCZD!DD!DD6DDDTDD(D'DD(DDDYD)DaDuCCD)D'DDDzCDDDDDDGDDhDSDDDDDSDD7DQDEDEDEE>EEEdEyE}EFyEdEQEFGEUE!EGEF}EEUEEVE~EF~E!E FE FFVE*EbEEQEbEE|E*EFFEqEEE|EFqEEEFFEFdEFF!FrEFeEeEE!F$FhEhEE$FEEE=E(FE(FDCE=EE.FEEE.FEIEIEE2FE2FEEWEE5FEEDPEDPEDPEDPEEEEWE5FE@FEEE@FrEEDFEDFFFEFFGFEEGFEDcEEEEEEEPFEgEEPFEgEEEEETFEETFEtEEYFEYFEtE[FEE]FEEEEhFED{ED{E]FEE{EEEEEEEhFFElFEFElFEEqFEEEEEqFEEEEEEEEEEEEEEEE}FEEE}F~FEEEEEEEEFEF~FEEEFEFEEFEF#EEFEFFFEEFEEEFEFEE FEFF FEEFFFFEEFEFFEEFEEEFEFEEQEEEEEEEEEEFEEF FEFF/F FF/FFFFFFF6FFF)F;F=FFZF=FF=FF=FF=FF=FIF9FF>FFIFFFKFFKF?F?EE?FEDEEF=FF=FE;FF=FF=FF=F+FEF=FEF+FFEFF2G=F FNFF6FLFFF6FE6F>G=FG=FNFLFQG=FlG=FFZFFZFcF FE FvG=FG=FoG=FG=FuFcFG=FG=FG=FFuFFFpFoFGGpFFJFjFUFGUFFGjFRFtF GRF GGGxFGrFrFtFGgFXFGgF$GZFG3FFFvFF3FGGFwFFFFJFoF!GwF!G"G"GF$G%GFsFsFAFAFF%GFFBF0GFEFFEFFxFtFBFF0GFFFFMFFFF6GF6GFMFFSFFFaFFSFF=GHGFFFE[F=F[FG[F@I[FI[FZJ[FFaF=GFHGIGKGFKGLGFFOGFOGFiFFFRGLGFmFFRGFFmFZGFFFYGZGIGFYGF]GiFFFFFyF]GFF|FFFE~FE~FE~FyFF|FFFFFFrGFFFqGFqGrGsGtGtGFEFEFxGEFEFFF}GF}GFFGFGGFGFFGFFGFGFGsGFFFGFFFGFFFFGxGFGGFFGFGFGGGGGGGGGFFFGFGGFFFFFFFGFGG7FF)FFGF9FFGGGFFGGGG-GGG-GGF2GGFGGGGG9GGGGG>GGG9G GG GGGCG GGCGGG>GG/GG>GFGG(G7G7GFG(GG.G.GFGGGGPG@GGGPGF>GG@GFFG?GFGG:G:G?GGQGGBG)GGBGoFFtFFXFFvFFFFG>GVGJG)GGGVGGGJGG8GeGG8GGGSGfGXGXGGGfGGiG\GGiGGGGGDGyGjGHyGDGuGGQGGlGHSGeG GlG HlG HjG G H{GnGH{GHHWGGHHWG1GvG[GGHG1GHvGHG HlGH[GHHHGHgGG!H!HgG$HoG$HHlGGmG(HG(H+HGGG+HFGGGFG.HGGGFG.HGFLGGG5HG5H7HG7H~GG:H~G:HGUG>HGGG>HGGGGBHGBH^GGGGEHaGGGaGG^GEHGGcGGGcGGGGQHGQHpGGSHTHwGGUGGGpGGGGGGGSHGTHGGwGFxGFxGGG|GGG|GGGFGFGnHGnHGGGGHGGGGGGGHG?HG[HGFHGrHGHGGGUHGGGHHGGGHlHGHbHGHHdHGHGHGHGHGHGHGHGIGIGHGHHGIGIGGGGGGGHGHGGGHHGH GGHG GG GG/GGHHHHHGHHGHH*HGGHHHHHHGGGGHH,HHH,HGH-HHHHHHH#H HH#H&HG6H&H2H&HGHGHH6HHH2HHHHH?HHH9HHHHH?HHKHG*HHeGG\GGAHKHGAHHYH HGHH[HHYH HWHZHHWHHuGGG?HH]HH8H3HH/HPHH8HHHH/HIHJHJH HHIHnG H H[HHGHHFH]HZHCHHH[H^HH|HCHH|H\HH_H\HI`H^HIIrHIGHI_HI`H%HHmG$HaH%H I{H IG$H{HaHIUHIIlHIIH1HIbH1HdHhHHIhHG7HI;HHHoH#IHHH#IoH;HG>HDH}HHH,IHHDH,I.IH.I/IqHH2IqH2IHMH5IH5IHHRHHHHHOHHRHOHHHH>I?IHH>IHBIHHBIH/IHMHH?IH}HHKIHKIMIHMIRIHHeHHHHHRIHHsHHHpHVIHpHXIVIHHsH[IXIHHHHHHxHeHHpHHHHdIdIHiIHxHH[IHiIkIHkIGHGHHHHHqIHqIsIHsItIHHxIHtIHxIHHzI{IHH}IIHI}IHHHIHIzIHHHHHHHHHHHHHIHHHHIHIHHIHIH{IHIHIHIHHHHII-HHIIIHIHIIIIIIII HHIHIHHHIIHIIHIIHIIHI"IH&I"II9HHIHIIIII III;IIII;III IIZHH3HHIIPHHI'IIII@IIII0IAI!I'I@IIAII0I@I4I@IeI@IoI@I I&III@IaI@I$I+IIYI+IQI@II@II$IIYITI@III@II@IyI@II@I I4IIfII@IfIZIIIeII@IZI IIIoIIIIIIIaII@I^IJII@IJ^II@II@IJaIJJIIJ%IQIJSISIIJ(II)IUII%IUIgIJ]IgI(I]IWIJ1ITIWI)I7ITIH/IuI1I3IlIlIuImIbIJbI3IJmII7III!JI!JwIJIJIIJJIIJJJIIJI&IIJJJJIIJIJIIIJJ J JIJ JII IIJJ2JIRJIIJ JIJ JJJJJIJIJJJ!IIJ+IIIIJJJJI)J JJ)JJJ/JJJJ-J-J"JJJJ>JJJJ@JIJ/JI2JI1J JI4J JJ1J@JJ4JJJJI8JJJRJJJJJ8JWJ JJWJ^JZJJAJZJ_JZJJ^J$J;JJvJZJJ$JJGJ+JIGJ+JJIAJJ_JJJ2JfJZJJjJZJ\JZJI2J{JZJJZJJZJJZJJZJJZJJZJJ^JJZJpJdJJpJJJZJcJJKnJnJcJKKvJKKgJmJ KgJJ_JKfJ KsJ%J%JjJJ_J,JjJSJsJeJ*J*JSJK[JK[JeJJZJ]J,J:JJiJ`JJZJJ]JKBJ\JJJqJlJ"KJ`J:JKiJ"KCJqJ%K{J%K&KI?JlJBJrJoJDJJJDJJJJCJ/KJ/K0K&KrJJyJ4KJ4K6KJ6KJJIQJJJ;K;KJJJJXJXJJBKJ0KJBKCKDKCKJJJJaJIKJIKOKJDKJhJJJJJhJOKtJJQKQKJJJaJJUKWKJWKUKJJJJtJ[K[KJJJ_KJ_K`KaK`KJaKJJ~JJJfKhKJhKfKJJJJJJJnKJnKJJpKJJJJ~JJJJJJJJJJIJ{KJ{KJJ}KJJJJJJKJJJKJJKJ}KJKJJKKKJJJKKJKJK KJKJJJJJKJJJK KK KJJJJJK K JJ'KJKKJKKJKKK7KKKK8K K*K=KJ8KJKK KJFKJ=KJK*KKK)KAK2KK)KFKKKK"L LK"L0L LK8L.L LLL.L8LLL0LLL%LLLKL LK@L3LK@L%L L3LKLKLKL:LLLLBLKGLLGLLBL1LL=L:LK=LLTLL'LL1LKL$LRLLMKKLHL2LLTL2LKL$LLHLLK'L`LbLL`LLLNLLLM2M2MMM>MMMMYM7MMMMMMOMJMM7MGM8MQM9M MGM6MJMMsMpMMsM9M MMQMMmMcMNmMN,MJMLM`M M NrMYMJM N~MhM}L&ML&M@M&MpM&MM&MM&MrM`M.M^M0M~MhM.MM0MMMNMNMMNMMMN!NM:MMtM:M!NMtMAMzMMM&NM&NMAMzMMMMMAM^MpMIMM MsMLHMMIMMM2N2NM5NM5N7N{M7NMM9NMRM9NMLVMMMRMMMMCNMMZMMMCN[MMM[MMM{MMZMMJNMJNMNMMMMNMMMMMMRNMRNMMTNMMMMYNMYNZNZNMTNMMMaNMMMaNcNMcN|MMMMM|MMMLMMMMMMMMMnNMnNpNMpNqNXrNqNMMMMMMMMMMMzNMzNMM|N|NMNMNNMNMMMMMMNMMNMMNM NMMMN NMMNMMMMNMMMNMNNNNMMMMNNMMMNMMMNMMMNMMMMMMNMMMMNNNNNNNNMNMNM#NNMNMNN"N'NNNN'NN(NMNN-NNNNN N6N?N,NN?NM N-NMNM,NMNNN6NNNNtNkNoNgNNwN>N+ONNNvNNNwNGNN{NoN+OKNN-O_NNtNNNGNNKNNNNNNN-ONMRNMRNMRN=ON=O`NNBONNNNNBODONDONNFOFONN`NNNKONNMOKONMONRONROSONNxNNNNNNMrNMrN"NrN(NrNNxNMzNcONcOeONeOiONNNNNiOkONkONNNNMNNNNNMNtONtOuOvOuONvONNNNNNNNNNNONMNONNONONNNNONOONONNONONNNNNNNNONNNO#NN O OO ON OOONNOOONOOOOOONO6NN3NNO OBNN$NNONOONOOOO OOOO8O OO)OOOOOOOOOOO8OO5O*ON5OO7ONO#O*O&OOO&OOO#OOO OOO0OXNN*NNO*O7ONO/NNoNNNN~NNNNNN0OGOOOTOGOONCOGOOTOOOCOOOOOO)OOO:OOOHOHO'OOOAOOOGOOOhOOOONOO.OOOOIOOpOOOpOjO:OGOAOGOOQOOXOhOGOOOOfOOyOO.OGOIOGOQOjOXOjOPxOP PmOyOwO P PNO P PxOwO PUOP}OPPPnOnOqOPoOoOqOPzO1O1OYOPOOhOPPbOPfOjOOzOYOqO!PgOOmOwO!P{ObOqO(PgO(P)P)PONOwO{OONFONFO3P|OUOwO3P4P}OwO4PONSONSO OSO*OSOOSOOSOOOOWO|OOOOOOOOEPOEPFPFPOJPOWOOJPLPOLPOOQPOOONiOQPNiOTPOTPWPOOOWPOOZPOZPOONvO]P^POO]POOOOOhPOOOO~OO~OOOhPkPONOkPOOmPmPOOOtpPOOOOOONOOOvPOOOOzPOzPvPO}PO}P~POO~POPPOPPOOPONO)OOOPOPOPOOOPPOPPOPOPIPPQQNQQQ9Q-QKQ8QKQQ8QcQ^QdQKQ9QBQQcQqQKQQHQ Q>Q QQdQQQqQQ^QQQDQQDQKQBQQVQ{QQKQQVQQtQKQRR_QPQ_QfQRQRRQOQUQ$QRtQ$QQQUQRQRRjQjQQRRSQRRzQRR6QpQSQQzQvQRaQQ6Q`QQRR`QQoQ#RQ#R$RaQQ$RkQQQpQQGQQQmQ.RQmQGQkQQ.RQQ0R0RQ3RuQ3R4RPLQuQQ4RQQQWQQQWQARQQQQQARQQ\QQQ\QFRQFRQQQbQbQQeQQQQQeQQQQQRRQRRwQQWRQPlQWRQQ|QQxQQ[R[RQQwQQQQQQQQxQQ|QdRQdRPQPQPQQQnRQnRQQQQQQQQQQQQQQvRwRQQyR{RQ{RyRQRQvRQQQRQRRRQRQRPQ"QQQQ)QQwRQRQRQRQQQQRQRR RRRR RRRRQRRRRQQQQRRQQQRRQRRRRRQQRQ%R%RRRRQQRQRQRRQQQKQQQQQQQQQQRQ1RQ,RQQ R1RQRR,RRR!RR'RRR1RRQ!RRR RRR'RRRRR"RRRJRRRHRRRR;RJRR"R1RRRR(R;RNRRRRR5RR-RR R?R{QQ?RLRHR1RfQQ_R`RR_R5RNRR-RNRRIR(R1RIRNRR5ROQRRMRcRR`R RRRMRiR:RRiR>RRjR>RRjRRKRzRRvQRKRzRRYRPRSYRSORQRSSSORoQRoRhRSoRS SxRQ$RQ$R S S SkRpR\RSSpRlR~R^R*R*RlRxRhR}R^R]R~RSSS]RSSmR~RS}RkRhRSmRSSSR"S/S8S:RRPRRR/SQRR8SR$SR=S$SS=SDS9SSCS>SS^SSTSGSSTSSPSShRS\RS~RSSCSrRSnSPSSnSSSQSSTTTSTTSSTTTTSTTT0TTTT0TTT'TTTSS:T,TSTSTTTTTT,T'TTTTTT:TTT?TTT/TGSSTTT2TTTTTT*TTTGTTGTNTTTTT:TTVT!TTVTWT!TQT%TSQToSST/T?TTNTDTS6TDTT6TTTCTCT-TZTMTT*T2T_S TS TS TS TS TS TET]TTZTTETTTMTT]TTTWTTTVTTzTpT[TpTUzTUTSTSTtTsTTUUTU"T_TUTsToT"TcToT U U U[TUTTpT_TtT UcTTWT3TXTXT\TUuTTaT3TUTTTaTUuTUTU UTpTTpT U|TwTvT&UTT)UT)UTpTTT-UT-U&UwTTTTT2UT2U3U3UT5U5UTTT:U}T:U|TT=UT=UTT?U?UTBUTBU}TTFUTFUHUTHUJUTJUTTTTgTTTgTTTPUPUTTTkTTTkTTTVUVUTZUTZU[U[UTTT_UaUTaU_UTdUTdUTTfUTTfUTTTTTTTTTTTnUnUTSTTTTTvUTvUwUwUTzUTzUTTTT TTSTTTTTTTTTTTTTTTUTTTTUTUTUUUTTTTTTTTTTTUTT?TT2TTUNTTTTUTUUUUTUUTTTTTUUUUUUTU!UUUUUT!UUUU'UU UUU UUUUUTUUUUU U UU UUUU!TTpTTTTTTUTUT'UU%TT-TTUUUIUTUU$U+UT0U+UT0U,UT$U,UUUU(UUXUEUTWUEUTU*UUXUUYU@UU/UOUAUGUUYUtTUU/UGUUUAUU(UIUlUcUUlUUKU1U\T UT UT UT UT U1UU*UIUUKUCUU\UCUUDUSUVDUVU\UWUIUVvT UeULUTULU VULUVTU VeUVVUVV~UVmUUVVmU~UUVVVUVUU|UVVUUUVUU"VU"V}UUUU&VqU&V'VUU'VU+VoU+V.VUUU.VUU2VUTJU2VTJUUUQU}UUQUUUUUUU^UUqUU=VU=V?VU?VoUUT[UU^UUUIVUUUUUUUIVVUMVUTfUMVOVUOVUUUUUUVVUVVpUUUU[VUUpU[V]VU]V^V_V^VUaV_VUUUeVUeVgVUgVhVUUUUhVUnVUaVUnVoVoVUUUsVuVUuVxVUsVUxVUUUUUUUUUUUUUUUUUUUUVUUUVUUUUTUVUVVUVVUVVUVUVVUUVUUVVVVUUUUVU UUUUUUV VVUUIUU VU@UUSUUUVUVUVVUUUUUUUVVUVVVUVVUVVVVVU VU8VVV#VV8VV#VU4VVV4VVVVV;V@VOUUV;VcUUV!VV$V:VVVVV$VV:VVVVU3VV3V:VVVbVVV>VQVUVUAViVQVLUVUVUVUV8VV:VV V8VViVVpVVV8VV!V8VUVVCVCVyVVcVV|UVVWVRVVW`VcVyVW`VRVUVUVdVVUVUV WdV WqVVWrVkVAVbVWqV,VrVV{V{V,VV,VWVWVVWVWWWpVbV"WVWV"WVjVVVtVV&W|VlV+W|V&WtVWVyV+W,WV~V.WV}V0W1W.WV0WVVV1WVVzVSVVVVWWWWWQWW%WW*WW*WWW`WdWW`WWW-WWWWbWWWjWWQWW2WWVWjW?WWVWV WWVWWOWuWWOWWWTWyWWVWWTWWWWX4WXWjVWXgWVWlVWgW}W(WiWAW]WX^WV"W]WpW2WWpW(WX^WtW~V,WbWW}V,WFWWVWWV0WXWW}W4WiWWWWWWWWzV0WV=WV=WV=WV=WW=W/W=WtWAWWWWWWWWWWFWWFWVIWWWVIWWW6XWWW6XWW9XW9X:XWW4XW@XWSXW:XW@X-XWWWEXWEXFX/XWhXWFXWLXWQXWLXWWNXRXWNXWVkWRXTXWTXWWVXVXWYXWYXZXZXWWW_XW_XWWWWW{WXWgXW{WWgXjXWWWjXkXkXWWWWWrXWWWrXVWWWWWWWWWWWyXyXW~XWWW~XWWXXWXXWXXXWWWWWWVWXWXWWWXWXWXXWXXWXWXWWXW3WWXWXWWWXXXWWXWWXWWWWWWWWWWWwXWXWKYWlYWWWXW.XXWWXW.XXXXXXWXWXXXXX7X:WW>WWX?X XX?XXXXXXXXXXBXXXX;XAXXX;XX,XdWWXX4XXX?WWuWW,XAXXSXX4X XIX2XMXXXIX!XX2XXXKX X-XXyWWKXCXX/XXX%X%XWXXXeXXXXX!XXX XhXXXPXMX XCX XPX XXQXXX`X`XGX\XXHX\XXXHXmXwXXmXXXXzXYYX^XY|XYXY YtX Y Y{XlX YzXwX|XwXeXWX YUXYcX Y{XXwXXwXY|XY}XwXtX^XnXXXwXYYYnXYXwXUXoXcXoX#YDXXXwXW@XW@XYXXwXXwXXDXXXXwXXwX2YX2Y3Y4Y4Y}X7Y}X7Y:YX3YX:YWTXbXX]XXXXWZXWZXWZXWZXWZXX]XXXIYXYXXbXIYLYX#YXLYNYXNYXXpXXXXRYUYXRYXUYXpXXXXYXYX[YX[Y]YX]Y^Y^YXaYXaYbYbYXdYeYXXXXXXWXWXWXXX7XXAXXXXeYXXXXXXXXXvYXvYzYXXXXXzY|YX|YXXXXXXXXXXYXXXdYXYYXYYYYYYXXXYYXXXXXYXYXXXXYX YXXXXYYXYXXYYXYY%YX YX!YXYX XXYYXXYXBXXYXYYYXYXY YYYXXYXY%YYYYYYY!YXYY YXYYYYXY5YXY5YYY8YXY)YX8YX>Y)YY>YYYYWXXYYYYYYKYYYY9YYY'YYYKYX*YFYXOYFYYYOYYGXX9YKYYYY;Y+YYYY;YYZY'YKYYY^XYlXYoXYXYY=YYgY*YKYYYKYYYoYlYYfYqYlYYYYZZZZIZQY ZY ZZ6ZZ`ZZVZZ?Z%ZkZIZ>Z'ZkZZYZhYZYZYZhZEZ[hZ[nYZ@ZkZ [oZYZ [VZkZ [ [oZgZkZiZkZY+ZY+Z`ZkZ3ZZpZZZ[[[pZoZkZZZ3Z[ZZkZ[Y7ZyZeZ"[yZ"[fZZZkZ'[fZ'[)[jZ)[jZkZZkZ-[Z-[.[ZZ4[qZ[Z.[Z4[YPZYPZZPZZPZ?ZPZ)ZPZZZ>[B[ZqZZ>[ZB[D[ZD[G[ZZZG[H[I[H[ZI[ZZZO[ZO[ZZlZZR[YnZZlZX[ZR[ZZZX[ZZZ[ZZZZ][^[][Z^[Zc[ZZ[Zc[e[Ze[YZYZi[Zi[ZZZZl[ZZn[ZZZZu[ZZZZZl[Zu[ZZz[z[Z}[Z}[ZZZZ[ZZZZZZZ [Z[[Z[Z[Z[Z[[[[[[[Z[ [[[ [[ZZ[Z[[[[[ [[[[Z[Z[[ZZ[[[ZZ[Z[[[![%[[![[[[[ZZkZZZZZZZZZZ[[[[[[,[,[&[[[[[[[[n[8[[ [[[[[([[]8[C]8[U]8[]8[]8[@a8[C[F[[[C[c8[[[[A[!h8[[Fh8[$i8[k8[l8[Z:[l8[J[M[[[[M[Z/m8[[J[[Xm8[n8[q8[q8[EZZ=q8[+r8[Fr8[r8[Ts8[gs8[rs8[s8[v8[2w8[!x8[x8[#y8[:y8[z8[vz8[.{8[a{8[b{8[z8[[p[[N[[T[U[[p[[T[m[\[A[p[\m[:[p[\[[\\\\o[eZ[\[Z[[s[ \g[ \ \[p[[[g[s[\[\\d[\N[p[2[[`[2[[_[[`[Z4[\[a[2[\\[a[\[o[p[$\h[$\ \g[[[d[p[)\[[.\[h[p[)\[.\/\0\/\q[[[q[[[[[x[0\[8\[8\9\9\[|[[?\|[[V[[[?\[[A\ZZ[E\[A\[E\[[I\[V[[I\[[L\[L\[[N\N\[[[R\[R\Zn[p[n[[n[[n[[n[\n[b\[Zu[[[Zu[Zu[[u[Zu[Zz[[[b\e\[[[e\[[[[[[[[[[[[m\[m\n\n\[[[[[[[t\[t\y\[[[[[[[y\[[~\[Z[Z[~\\[[[[[[[[[\[[[\\\[[[\[[\[%[[[[\[\\[[[\\\[\\\\\\&[[[\\[\[\ [[([[[\F[[\[F\[D\[\[\&\(\\U\[\&\\[\\\[\\-\1\\-\\\[\\\[[*\[%\*\,\[\%\\\\\\,\\ \\\ \,\\\\F\\\\F\G\=\\\\G\\D\\\M\\2\P\\\\[(\M\3\\\U\\2\\F\\\U[[[\_\\[\\U\\\\'\\P\'\K\\s[\\f\\[\f\O\l\o\\U\\l\\]U\\s\\\\>\_[\\\a\\\\\\Z\\Z\a\]S\]]z\\]z\]]\x\ ]\ ]}\\S\a\T\Q\]}\]]T\]\]]p\x[/\[/\]]\[/\]]\\p\\r\\\\s\o\;\r\\;\>\o\\\@\\q\\(]\\\@\(]q\J\\V\\[E\\\\J\1]\\[L\[L\6]\6]\|\1]\W\\\\\\\V\\W\\\]\\A]\A]\]\C]F]\\\F]G]\\\\G]\N]\N]\i\i\\\\R]S]R]\ U]\\W]X]S]\W]\[]\\c]\[y\\y\\\[y\X]\c]e]\e]h]\\\h]\\\\l]l]\n][]\p]\\u]\\\p]\u]\\\\\\n]\\\\\\\\\\\\\\\\\(\\]\]]\\]]\]\]]\]\]\]]]]]]]]]]\\\]]\1\\]]\ ]]]]\]]]]]]]]\]]]]]\ ]\]]\]]']\]]]\\]=\\]*]]]\\]3\\]-]]']\P\\]] ].]]] ]]]]]]]]]]_\\]!]>]K\\O\\]0]o\\a\\8]0]]8]]!]]]9]]]]]])]Y]3]-]*]]].];]\]]Y]];]]]7] ]L]7]a]]7]].]Q\]]]b]x\]L]4]b]4]]{]4]]4]9]>]a] ])]>]];]]b]]]]j]]]]j]]]]\]\]|\]y]H]^y]^v]J]^^v]k]] ^k] ^ ^+]{] ^Z]m]w]^^w]+]^m]^{]]b]2]]]x]x]2]^]^^]^]b]^]^!^]!^%^z]#^z]]%^&^B]]~]B]\C]&^|]+^\C]|]}]2^]/^]~]+^]2^]]/^]6^]6^7^Z]]9^:^\U]\U]\U]\U]\U]9^]\[]7^]I^]\[]:^]]]L^]I^]]#^]L^M^]]O^\h]M^]O^]]o]V^W^X^]]V^]W^]X^]^^]^^_^_^]c^]]]c^d^d^]g^]g^j^]]]j^\]]]]] ]]*]]\]]]]]]]]]]]]y^]o]]y^]]]]]]}^ ]]]]]]\]^}^]]]^]^]^^^]]]^]^]^^]^^]]]^^]]^]]^^^^]^^^^^^^.]]0]]]^>]]3]] ^]^^^^ ^] ^]^^^^,^"^ ^^^,^^^ ^^]^^^^]^^^]^^]$^-^*^$^]^-^] ^]'^^^;^^1^^^*^]^;^]4]]a^]^]_] `]e`]^]^"^]D^]N^D^^^N^0^]^(^0^^^^^S^^P^^R^R^Q^]a^^(^H]]J]]]a^]]]a^]a^]a^]a^S^3^]a^b^@^]a^]a^]a^]a^]a^^b^]a^3^^P^<^@^^^]a^^?^[^^^a^]a^^a^ ^a^^a^'^a^ ^a^1^a^]#^`^[^}]#^_`^^a^?^a^^^^a^^a^|^a^~^a^__^]2^^a^^a^^a^^a^_^a^]:^^a^%_^]^]^%_^k^^^)_^)_+_|^+_._^^^._J^~^^J^r^^5_r^]L^^J^5_6_6_z^T^^^^z^^;_^T^?_^?_;_^B_^B_e^^^^F_^F_G_f^^^^^e^L_^L_^f^]d^]j^l^^G_^]j^^l^^^V_V_^X_X_^[_^[_\_^w^^^`_^`_^{^\_^^^^^^^^^^^j_^]^j_k_^^^^^^k_^^^t_^^^t_u_]^^^^^_^_^ _^^^_^^^>_^,_^8_^I_^_<_^^^^^u_^1_^_^_w^^{^^^^_^_H_^U_^a_^J_^_^^___c_^_^q_^w_^_^_______^___________ _______^^_'_'_^_^^_(_^_^_____^__^<^^Q^^_^__ ____ _(__>__A_@_____A__,___^8_"_^_"____=_^7_=__7__^I_M_^___M__,__-_^/_-___<__/___<_0_Y____2___0_K_2__K__1_ _H_C_ ___D_C__U_`U_h_Z__D__h__v_f_^I__v__``a_`}_m_m__`}_````J_z_l_k^%_`z_`_`P__`P_`^+_*_c__*__a___`_```_`q_`9_w__9_g__!`!`g_n__$`,`_y__$`y_E_n_______,`_E___N__1`1`{____N_____Q__{___Q___<`<`__T_^V_A`_A`__T______I`___I`__L`_L`____Q`_Q`R`__R`___V`Z`_____Z`^u_V`_^`_^`__|___|___f`_f`________m`_m`__p`_p`____t`_t`u`u`_______{`{`_______`_`______`_`````_` `` `_ `` `` ` ` ``2` `_```___``__`_``__`````_````_````__`#``_#``_+` ```@__`````````2`` ``_+`` ``_``` ``&` ` `7````&`(` `` ```=`*` `.` `_&`Y__` `=`_```_(`%`N``N`_`*```%`'`M``@`__*`Z__f__`'`-`@`` ``:``)`__-`:`)``.```T`e``.`g`e`l_` `T`O`3``O```_``g`>`;``\`e``>`3` `Y`z`_````e`W`e``B`B`_`aY`ao`e`a`e`a\`b`e`a a`` a aW` aS``aS`aa`e`ao`aa`aa9``4`b`i`4`j`i`aj`y`e``9`#a``e```#a`e`v`?`&aD`y`w`v`&aw`|`D`+a`s`0a`}`|`+a}`0a2a`2a4a`4aX````9a``~`9a_R`?````~`X`?a`?aJ@a````_Z`DaEa``c```c```Da`h``Ea`Ua``h```SaSa`Ua``q``_p``q```[ax````[a``x`ba`ba``dada`````ja`ja``````a`qa`a`qarasa``'a`/a`{a`a`>a`Ha`{a|a``ra`sa`a````6a`\a```a`aa`^a```a`aa``|a`a```Pa`Za`Ma`a`a`a`aaaa``a`a`aaa`a`a`7``a`a``a`a`aaaaaaaaa-aaaaaa`a`a`'a`(a(aaa`.aaM``aa.a8aaa)aaa`Haa5a`a3a$a5a`aVa`$a`;``a3az``a'aRaVa`6a`Ra,aCaa`\a`-aCa`a,aOa`;aOaaQa7aaa;aaQa7aa^aaIamaaaaIa` a=a aaPa aTaAa=aualaauaa>aaAaalaaaZabBaKaFaFaaJaabBaJaTamaaKabMab bna b bXaWanaa b]abbgas`+abaabgaoababXababaabab`4a`4a bxa bcafa"b"bca`@a`@aa@a>b@ab@ab@a]aaaa-b-ba/b/ba2ba2baa6ba6b7b9ba9b`Uabab4baLb4bbHbaLbHbaa!bbbb&bbmaabbabObbbOb1b>bpb>bbabab1b)b(ba&bb)bb]bib>b]b+bb+bbZbabbZbbdbbabWaboababbpbbdb8bbebbeb:b8bbbibPbbbYbPbabbYbfabababxbbcxbcbb{bb cb c c{b cmbb*bmbUb*bbUbcbc.bsbbqbsb[bqb.bcbcbbccb!cyba7b!cacbabbcc0cccccccb.cDcccc)cbcc.cDcb5cbbcOcbcQc5ccQcccBcBcOccc3c:bbc4cccc6cbcc0c*cbcc*ccncbcEcbcGcbcycbcfcbccbccbcc6ccbcb ccbc[b cb ccbccncccwcwcqcccEcccdcbccGc"cycdGccbccbccbccbccbc\c"cc\cdcddfcdcbcZcuccbccbcdZcb-cdc|cdcdcdbccc dczdbcydbc dYdbc#dc#d&djcjcc&d'd'dc*dc*d+dcccc/d/dc1dcKc3d1dc+dcczczcRc{ccRc{c3dcedaddddXedIedIe@eddadLeMeMed4ed6edRedReTedTeUecpdcpddpddpdUeddddddddd`ed`ecedddceddddddiediejeLedddddpedpesedddseueduevejedxedd:ddEdd,dd\ddvedddedeedexedddedeeeddeedeeededede eeeddeeeed eedeedeeddeeeeedeeeeedd eee eeeeedee+ee ee/e1e+eedee/eeee"ed eeeeee5eee#eee,eeeee=e=e7eeeee&eeee-ee-dd]ddXdd|ddd(ee:e ee9e edeeeXeee?eOeeeBee@ee?eeEeoeBeqekeqe{eqeemeqeeeeke}eqeeZeeqee{eeEeeqefeqefdefyeeqeyeweeqeeqe fe f f|e ffeefeffne)eewefmeeqe fqeeneeqefd6eeqefqef)e}efeeqef{efqefqef}e*fef{e*f+ffqefqe)fqe1fe1f~ee3f|ewe5f3f~e7f7feeedUe5fe@fedUeee@fCfeeeCfDfIfe+feeeDfeIfeeKfLfKfeeeRfedjeeeRfLfedjeUfVfYfeeeYfUfeee]fe]fdxe_feeafdxecfVfeefcfeafeefe_feeeeeofeeeofeeeeeeeeufeufeexfexfyfzfzfeeeeefeyfeffde eeeef1eefefefeefefeefeeffffeffeeeeefef ffeffefffeff#ee,ee7eefffefffffff,f$fffe,fefffeff$feff)fff0fe2ffef>f>fe0feefefffffff.f-fNeeff6ff.ffOee=f ff=fffffef feoeef/ffff/fff2f^ff^f6f^ff^ff^f(fZf/f^fweff(f8f^ff8fffdffSf^f9f^ffSfdfbfffffhff8ff9feffWffWf^fffBffjfFfhf^fBfFfPfFfwfFffjff^ff^f gPff^f g gwf gf^ff^ffffNghffff^ff^fe1fgffe1fgg^ff^f0g^f!gf!g"g"gf)g~fffe@fe@fe@f)g+gf+g-gmf-gvff/g/gvf5gfeLf~ffeLf5geLf9gfff9g;gf;gff>gf>g@gf@gBgfBgDgfDge_fe_fe_fmffe_fKgfKgffeefNgffffRgfRgffUgfUgXgfffXgYg\gfff\gff_gf_gffYgfezfffhgfhgfflgffflgffogfogffefefugfugff|gfffffffef|g~gf~ggffgfgffgfggfffggffgfgfffgfggggggggggfgffgfgfgfggggfffggfgggg#gggggggffggfgggggg-ffggf$ggfggfgggfggggggfggfgg$gg0gggggZffgbffgFgg0gg.ggggAgGgggAgggEgFgSgg&gggIggEgSggg&gGggIgg[gFffffffffffffgbg^gSg[g]ggZg=gg0gWgSgbg]gHgSggSgigSg`gSggZggngSggmgVgagSggmggEggg^ggEg}gSgsgxgVggxgghsghhhWghHgh h hg hig hcgSggSghhhaghngh`gh1g}ghrggg1ghrghhhghhcg h!hvgeg#hgeg#hvg(hg(h)h hg/hggg)hg/h1hg1h4hggg4hfNggggg8hh}g8hgBhgfXgfXgfXgfXgfXgBhChChgggFhggThgggfgggfgggggjggUhggjgggggggThUhVhVhgXhYhggXhgwgggggwgYhgahgahfhgggggfgfhhhghhihggihgggfgfgggrhgrhshvhgshgvhwhggggfgfgggwhggggghgfghhfg#gghggghggghg hg hhhhggghghgggg hhhg$gghhggghhhhghggghhghg hh hgghh hhghgg hh.gghhggGgghhhghghg hhghh h hgg]gg2h h=ggh hGh hg%h"h3hhhh"hh2h;hhg;hAhhhAhhhghhGhh*h=hh*hhhShhhEhhghHhghIhh6hHhSh=hg6hhQhhIhhhghhhRhh[hNh-hEh=hhQh[hmhhAhh=h^hmhhNh-hhkh:hhohmhhkh:hhQh=hRh=hh^hhhohhi}hiiinhnhh$hDhdhcheg!hg!hg!hg!h&hdhi]h]hlhch$hlh&hiihi+hxhihizh+hhzhDhhiyhhhiehh}hmhxhh!ieh!i#ih#i4$iyhhLhh(ih(igBh*igFhgFh hFh=hFhmhFhhFh|hLhZhh*ihh{hh{hh{hh|hh{hh{hgYhhhhZhhhh\hhh\hhGihGiIihIihbhgfhhhjhhNihhhjhQiNihSihhQihWihWiXiZihZiXih\i]i^i]ih`iaiSihhhhhhhhhhhhhhh^ihliqihhhhh\ihqihhlihhhuixihbhhxiyihhhhuihhhyihhhihhhhhhhhhghghii`ihihih"ihhh1ihaihihhihiiiiiiiii%ih%hhihi3hhhhiiiiiiiiiiihihhhhihii,i.iihhii,iiii"iihiiii1iiihh%ii7ii7ii8i=iii8ii i iDi=iCi=ii ii2i=i@i=i?i=iibicii3iii?iibii[i=ii-iYiiii=ii=iciiij}i>jiiAjiAjEjiiiiiEjhaiiiIjiIjiiLjiLjOjiiiOjPjQjiiQjiiiriiVjii^jihqiPjiiriVjiii^j_jiiiicjijiiiiiiiiiij_jiiiljiicjiqjiiiqjiiiitjiitjiiiljizjizj{j|j{jiiiii|jiijjijjijjiiiiijjiijihiii jjj j.iijjijjjijjjijjjjjjjjjjjjj"jjjiijjj iijiiiijMii/iiiijjjiijjjijij2j6jj2jj:ji8j:jj?jij8ji)j=j?jjijj=j4jii)j>iijj)jjRjj*j4jjjhjjj*jjlkkWk>l;lkkkAlBlkkBlkElkkAlkkckkckkckkckkkckkkkElkQlkkQlkkkVlkVlZlkkkkkZl[l\l[lk\lkalkkkalkkcldleldlkkkkkklkelkklkkclkkkplkplrlkrltlktlulkkwlxlkk~lkulk kk~llkwlkklxlkllklklkklllklljkkkkkkklklkklkkklk'kkkklklkkkkklkkkllllklkklllklkl#kkJkklklllll ll&lk llll&ll lll ll5kkl7llllGkkl4ll'lll'll(l:ll(ll:llkll+llllk[kkFl:llll4l7l+lllFlkllklllllTlCl6lCllTlll6llRlk#lRlk)ll#llflmlmmmlEmEm7mmm$ml-m$m2llm-mmmPm5llPm1mm0m*myllmmLmm0mmmAmmGllllm@m}llllllllm3mmQmcmmmQmmimmpmmCmCmon|onnn{onRononmnonon4nn on onn oonon onnnooonooonon nnoooonoonoonooooo%oo&oon&o#on2o#oo2ooo6o'oo6ooooo-oo oooo ono.oo3onnAoAo3oon8nnnnonpnSpnpno.ooo1ooooBoo!oonIo"oncon(o"oYoVooYoVonoCocon(o^onho^onCoohooooboooo>ojoUoo>oojolo;oUoo;oooloooo[oo[odoo|ooo{oHoooIomoHoppmounoioNo pzn$o pio ppRopoaopvn,on,opoobo p{opppopopokoppop7ooo7o pyo poeoyoo$po$pn@on@o'p'p}o*po*pEoooEoqoo/pqo/p1po1p4po}oo4p5pnMooo5po:po:poo=po=poo@po@pooooooDpn`on`on`oKpoooooKpooMpooooooooooooVpoooVpMpoYpoYpoooo]po]p^poo^poooookpoooooipoooipDpokpmpompopoopooqprptpotpupvpwpypoypvpo|po|p}poo}pooopoopoooooppoopoopooppopoppoupopoppppooppoopopooo'oopopoqporpowpopp8ppoo0pp ppp3pppopppBppopoopoppppp8ppop2pp ppo2pp ppopp0ppp"po p po"p p,pop9p,pp9pppppppBpp3pp6ppTpSpppTpoLpLpSppJpp`pQp;po7pSpJp;pp`ppp>pdooOpSp>pWp?pSpNopp7pZpSp[pSpWppIppXpIpppXppOppzpSpaoppSpp?pEplpkopplpppZpqeopnpSppSppSppEpspp q[pxpsp q q qpqxp qgppqgpqpp qzppSpqpqqpppqo5pqnpo5pqqpppqp$qp$q%q&q%qp(q(qpp{p-qp-q.qRpppHpp~pppoMpHpp.qp8qp&qp8q~pRp:qpp>qppp>q?qpppppp?qpo^pp\p\ppIqpIqepppepppppppppppppppSqppppppSqp:qppp[qp[qpppp`qp`qppdqpppdqgqpppgqppppjqjqpppnqpnqpqppqpppptqptqqpwqpwqpppp{qp{q}qp}qqpqopppppqpppqpqppqqpppqppqppppqpqpqqqqqppqqppq qqqpp qqqqpqqppqqpqpqpqqpqqqqq'qqqpqpppqqqq6pp5qpp5q!qpq!qqqq1q4qqppqq1qqqqQppq+qqp0q qq'r(r(rmqmqq+r'rq.ryq.r1rsqyqq1rsqq4rq4rqq8rq8rqq:rXqq=rq=rqq?r@rqXqqq:rqqq?rqFrq^q^qqp`q@rqqqPrqpgqqqPrpgqrqqXrqqqqqqqqrqXruqqqqquqqqqxqbrqxqqqqbrqqdrerfrqqdrqfrqerqqqqqqqqqurqpqpqurqqqqqqqq{rq{r}rq}r~rqqqqqq~rqrqrqrrqrrrqqrqqrqrrqqqqqqqqrrqrqrqqpq4qqGqq@qqOqqqqqrrqrqrqrqrrr#rqqrr&rrqrq*r$rqq%r%r$rrqrrrrr6rqqqrqrrr6rrrq,rrqr,rrrrrr rqBr rqBrr r#rr&rr*rrrrrssRs[smsfsvstsvs*s[sosvs]sst,stshsnssvst]ssvssvs.shsdss ts|s tdssvsxsyssvsms)ss*ssvssvsns,ss.sys/ssvs/sos|s2stvssvststr:s2sxs$tsr:s$ts?sss't(tzsCs'tsszssFssvsFsssstvs?ss4ts4t5ttvsss8t8tsrTs;tsUsrTsrTsssAtsAtssss(tsCssrasissNts5tsUss;tsrgsNtsisssksssksVtsrlsssVt\tsrrsss[ts[t\t]tss`ts`tssbt]ts}ssbtss}sssjtsjtktrsktsptsptqtqtsrsvss.tstsSususrsss|ts|tsssssssssssststsssssssstssttstsstsstttsststtsttstttstssts tssts tssstttsstttttss&tss%tt&t9ssttt.t!t.tt.t3t.tCt.tYt.tttt1t.tst ttnt.ttsWt.tt tttt~t.tttyt.tt)tt,txt.tttt!tt.ttttttt3ttFtQtsFttt/t/t6t6tst!t>ssusst.tt.tt%tt.tt.tt.tt.ttCtQtst.tts3ttYtt.ttt1ttDtmttDtmtt tntctdtt9t tOtstHt9ttHttOtdttstttcttrtttWttfttWttt^ttftrtutthttu^tattuuattht u*t~t utSt*tet*tutSt-tutottt-tut0tuotgttuu0tttwttttetuvt:tugt!us;ts;ts;ts;tuyt:twt+uxtut!uyt+uttItttGttItGtttt3utvt3ut6uPtttttPtTtttTttt>ut>u6ut@uButButts]ts]tittIutIuKutKuttMu@uttttitttRuttVutMutVuXutXuYu]utRutYut]uztt}tttztttfutttt}tt}tfutthuhutttmutttmunuttttttnutttuuuutttxu{utxut{u|uttttuttt|utuuttt#utttututttututuuu%tttt)tt,ttututuu*utuutuuuttutuuttuuutttutttut&uttttt,ut u,uut#u1utu u u1uuu uuuuuttu8u8utuuu*uutu9u.ut9uu.utuuDutuDututu%uGu utu uGutu%uu)uNut&uu)uuNutCuSuu$uuuSu$u;utCu;utuuuuvvv;vEv9vEvjuuHvEvWvEvjvEv=uusuuvv9vvvnvEvvNvvvvvHvv^vJvEvcvEvvuvEvvvEvIvOvvIvvrvEvvvuvvWvvvjvv{vEvvEvvnvvtvEv}vEvvWvvJvv|vEvvEvwcvvEvwvEvvHvwuvww^vNv wvv w wrv w w{v w)vvv)vRvvwwRvwtvwwv]vwvww}vww|vwwvvevww?wCwv>wv?wvCwDwDwvFwvvvvKwvFwvKwMwvMwvvvvvvvvvvUwvUwYwvvvvvYw\wvvv\w]wvvvv]wvvvdwvvvdwfwvfwvviwviwvvvvmwvmwowvowvvrwvrwtwvtwuwvvwwvvvvvvuwvwwv}wvvwwvwwvvvwvv wvvvw}wvwvwvw wuvEvvvvwvOwvXwvvvvvwwvwvwvvvvvwwwwwwvvwwvwwvww"w"wwww#ww&ww#wwvwwvww!w>vv'wwwwv)www)wvvwwwwwww!ww wwwNvvww-w-wwOvvw ww&ww'wz>zFzzzAzzzz\zzazUz|d||c|n||$}n|$}%}|>|}||%}m|*}|*}-}|||-}.}||[|v|v||||||||||||||9}|9}.}|=}||T|=}>}A}|>}|A}|||||[|_|||_|e||T||||||||||N}|N}|e|T}|||l|||l|T}||||}||s|x||||||]}}|<}|]}||x|{z|?}|{z|3}|s||||||||||||n}|n}t}|||||||||t}v}|v}w}y}|y}w}|||||||||||}|||}{|||||||||}|||}}}||}}| }|}| }||}|}|||}}|||}}|}}}||}| }||}||||||A||}}}}|+} }|'}|+}'}|}|}|}|}}6})}|}}|)}||6}#}||#}}}}}|}}}<}}?}}}B}4}}|B}}}}(}(}||3}}F}F}||}}?}G}|Q}G}}Q}}!}K}5}K}[}K}}}K}}!}}^}"}"}||5}|^}}0}}M}K}z}K}L}K}C}|:}|}K}}K}_}:}}}K}}_} }[}0}C};} }s}I} }@}@};}p|}}s}I} }}}P}c|}|}K}}}}}};~}&}}}}K},}O}O}J}|}~}~~M}~ ~ ~z}1}L}J}&}W}}/}W}~S}}~S}u}l}{}}2}u}P},}~{}}1}}/}l}1}b}1}~}2}r}b}8}r}}8}}}"~}"~D}}E}}}}}~}(~}(~}}}D}}D}H}}~}E}}H}}H}}H}}H}}H}x}}4~}}4~x}8~}8~:~}:~=~}}}=~}}@~}@~C~}}}C~D~E~D~}H~}H~I~J~J~}L~}}O~}O~Q~}Q~R~}}}}R~}E~}L~}b~}}}|}}a~}I~}}}}}}}a~b~}|}e~}e~g~}g~j~}}}j~l~}l~}}n~}}n~}|}}}}}}}}}|~}}}}}|~}~~}~}}~}}~}}}}}~}~}}~}}~}}}}~}}}~~~~} ~}}}} ~}~}~}~}~ ~~}~ ~ ~~}}~~~}~~~~~~} ~ ~}~ ~}~}#~4}}}}}~~}}}~~}#~}~}1~}~1~}~~~~}~~~~~~;~~~~~~~~$~~+~/~}2~/~}}+~G~}~~~~~G~2~~~3~9~~3~~~$~;~~~%~~V~~%~5~V~!~c~!~i~!~~;~p~!~x~!~W~}}?~?~W~}V~M~}6~M~~h~_~ ~c~f~*~~6~~f~~h~*~ ~~~c~~~s~>~<~~i~~o~w~~>~_~~<~~~o~K~~~w~~m~~~~N~~s~K~~N~~p~P~m~p~ x~ P~U~T~U~\~~\~x~~~k~~~k~  ~q~$~$%u~~(~(r~~*~~~~q~~~~%u~*r~4~45~~5~}R~:~:~~~~?~~?@A~~@~I~~`~`~~~~A~I~~~~~~~~~~~~t~~X~~~}n~~~~~~~~X~~\~\~t~_~_~~aba~}~}~b~i~~i!~~~p~~~~~pqr~~~r~ ~~y~yz|~|z~~q~#~V~'~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~9~~ ~!~~65~~!~~~~[~~O~~6~~""-E-F+FL;LV'U~T#U[][TPW~^[[[dWT~d]^[KYK~~~~~}[cjkn~ck~jfnf[)ge [[[gf[)~*llf[m{ eo7 7mtoh>v>''s**+0h{tu{0 usv+5{99;};<@<@5DDHHJJNNPPSSwZ~r~r~rZ~r~r__wccffggllnpprrn{{ !#E+;!B1)#ŀ$P$ŀǀBǀɀ1ɀˀ̀ˀ̀)FOрCOFRO(Yf{рYY""IO[O(Ch/ChRIiO[itOtzTzTaOOOa aOXq[ XO  `OOa`u^^k ; ;;joEoE,,//w2w2J5577PUU==??@@D_k_DLLggOQmȀWQmOW[[^€Ȁ^)_}̀y}Àـπ̀ yÀooqـqssπyy݀||~~€ʀʀЀЀۀۀӀ#ƀ+!ԀE"G"ր#ӀԀ-ր؀33-)؀)ހ+4&&ހǁ4ǁ:E;:ˁˁ;/ρGρIԁIƀԁՁف1ՁفC1C>C8C>A%VCAJ.%J8060H.qVH6u TCuCUZCUx}`}hdihadj   $T$ K *uK*txZ9tzkv{vkw<z9{<&&mw+m@@+--22NNO;>;>AACC__C_v___́MḾPȁPTȁTVVYqY؁\؁\݀ycځ΁chځ́́nnÁ΁ƁÁtuxtƁxzցz{}}{ׁuƁŁс!Łہ݁߁ց߁сׁہā)ā݁)$$)ށ#. '܁)܁'ށ#) .΂.΂Ђ7Ђтт/:N7)ׂ:Zׂ`ai1<݂/)"*"<݂1*Z I@@0d4G0 INdNjjeJe|e|`b`w4NJQe QJ ' GNUUUԂUɂUۂUjo_oqqy"%l"$%>'$~pEE~p.F'.lyF7P7y9SS==Y@BBEEHHIIK@hhh)hNheh9WԂW͂‚‚rw͂rԂw__bbeɂfɂefhۂʂlʂlǂނǂppނsĂsuقuKĂǂԂ{߂{قhɂ߂łł!ς/3\܂j܂GN na !̃׃ւڂ,ւ,<ׂZׂ(ڂ) ( ˃)˃̓/̓AA>҃3D҃D:MFFM#:߃3ރ#ރ߃C5CcXcbX\2Y2Yj3U      GJ^L_yknJakL a  o N'oQ|R|0ZZ066!"!@''@"OP00T44O778~PT>8>@@[[]EdÃ]EdMNP̃PMqŃrŃYqrYZ_׃tZЃ_NЃtڃ؃؃؃ڃnσσn׃ςv؃vÃz{{ăzƃȃ$ ۃ& BCF] ăɃ)Ƀ>̓$G&rtx`)1;փ1փ~Ä$# ʄ#5ʄ̈́B&̈́΄τ  ф+Qτ+քCք(FVބ<=<=Ä&ބ߄^΄BV(]߄FA^]GQ R AHdSHS\\RwRiфBF%r*|iD|}eeIr,tX}%Tp.TI*bWW-p,X.bx9`~89q:"q:"J~-t*y*//yJ4477::UU@Af؃_a@̄aaAڄ̄fRRȄԄWWYY^^ƄلDŽلbƄbdDŽdeƃȃellmnm nڄvلvӄɄӄ||ۃ ȄЄЄԄ;  Ä „(„ -҄Q΄҄5,(, 5. Ņ;ZDGŅ.̅D1̅х=^8хOV0IxdwD;݅VO݅߅Z߅0\`\Z9]91= I<6> B__<B?>?tCItCxxqq   ~~ oca]y2y2o:gfg:a&&4p΅pƅpppppPM4LPiPPMYلYYhGGIIjLhjirÅTÅTDžWWY΅YDžrɄvuu`څ`څąccefgeƅۅjjۅmӅmfƅӅssuuxyyޅx|~~|gƅɅɅʅ- ޅG8% #ͅ ***%*<*R*/ͅS*n*^*d**9/%*9()؅dž,o*؅(*dž`߅***]͆*͆%,)EAE6?ֆֆ׆Ȇ*߆***Æ*?]6%׆]*<*ц*h*2*><P>2hPRSHiHcfp*&n^'ddZZ'Sdb373obd7k ! k#!@@B}@B..#K}K44OO:=:=AYąYAB†EEFBaJKFgggglƆlaƆ[ȆJ[\w\ȆwȆbbdf߆fKʅkmpdȆprrssÆz݆z݆Ć؆ن؆ɆĆц#k߆Ɇm߆  ʆʆ>;A͆@I6͆7Rl`oކÇ>GÇ5ކa959D?gh?wЇDЇӇӇԇ;QH{ԇQH"]"i]@7I7;R l6 ee6nNnNxx<<`oaG_g%$h_$q%UolUqw8{|8Cu u|iL g'iC'†BF..F1L4455}1ڇDɇCCDFFHHLևNLSNsنsS}yLJaLJȧeeggkyknnososڇׇvvćzɇćzׇƇ݇݇ևއ  އ  ߇߇$$&& >&ч &"&7&&I&чĈ>ĈňG A9O&9G̈Ä͈V&m&͈h&ӈ"ӈ׈7M&}&׈ڈQQ2ڈq&E//EI30t&3&OV,f,mň>hJjKXJ0XwKM{~{!}RTlrl~wjr#T! } #Ryyi}q11t88xu:""#uq)*DDD#:x*1224P88P4BɈWB^^Ġaad)1dGW|ɈpшSшoˆp\ˆSÈ\^^_`|Ƈz_È҈݈j҈jklk҈lwvvwxш݈ʈȈʈՈՈ݈xΈ ň&&&&,&c&o&&3Έ- 3ֈ &ֈ&-2׈&&&&̉&̉Љ&Ɖ&ȉ&f҉,҉ىN&&&މ&ɉ&ىjN6݉[݉ʉ&&͉&߉&щ&&&d+[6dCgC c5R5i R a n E ]R]baIben}Ee!}Z!yZ  y MQM cIao~W79~YYiW779<ih<"mh$??"mp*,,..1*p122$566::<<>>AADD`&````o`ÉMM5OωlSSUUWXXЉZ\Ɖ\x^O^ʼnbȉbccʼnȈՉWՉmmlj։։qljquuxމxyzyɉ~zʉ~ˉ͉ˉ߉щ׉ZЉ׉ۉ ۉ( &/F73T(Ӊ6҉&+҉Ӊg҉Ê++N؉iÊoKƊ؉&'-ˊ'ˊ̊_ƊϊЊъϊЊF̊/؊7؊ڊ3ڊ! ݊!݊[%Y3Y0%ad[a8`8`PlPlTQ NъFioVBVKnenefJf _T]$g)ohs p]s)hk9k6?9pg>{?>É>{11337ttωO78O<<>>\CCjEIEIrwOOfj|XӊrXr8rw}ӊ``|}ފeފefhhillΊՊrΊr׊uuvvzzĊ|i|ĊՊ׊  Պ   'Ŋ %RVŊ-ƊŊ֊/֊ ڊ0ڊD/dڊƋDƋȋ'ȋɋˋˋ%AҋBGҋ؋;ڋ%GAɋ'؋;Bڋ܋R܋݋VB(@(@HFJFHYKYMWMnno]oVQo]_p_pQTLyPNJqToLoyooP݋RoN~q~coa^-kk-a3y!Sc?!j?&mU)j)&-oxw4x467mS67U?C?CDFF‹HHbNċNObsO{ċ‹͋XsX׋ŋv}׋zʋd͋{d}ŋhh̋j֋j̋o‹ՋՋ‹o֋ŋߋŋߋʋNjNjۋӋыߋыً Ӌۋًۋًۋ " " ././΋΋#Ћ#  Ћ:=: =NŒŌ8Ōƌƌ;8>22>KW;33IJGJKIՌGՌ֌ڌ55֌KڌYEB@B\@E\`Z`<ZJ+M<MYI1+I[_r[s^m1I^^cgagcPPkg$arIsIY|$b|kw----ybfgf9{$9$(D‹DŋDۋD D D{(LL6677nj;>;>DDFFÌJJÌenjΌeČΌhlČTlTUVWȌ׌YYȌ]]^^όs`dٌd،ٌWʌˌhinی،׌hʌň܌͌̌i͌ό׌v݌xیٌx݌v܌ЌɌٌ Ќٌ ԌތɌٌԌ/ŒIŒgŒyŒŒŒ-%-4 4ь** ь֌ߌ++ 8Í Íč8ߌ=ȍ ȍ?č?΍!!΍ύЍA#ύA&M0#_Ѝ&H =.HMmC.C*0)'*)Z'MSNSNlQlgcgRmRLLe@O@f{rGf rwtt "w  KKoo"}|}a|/y|22/}77a77'y'B-Bp-.2.z2P7z|799PV׌V??CCٌ````ˌdLLMNONOZZ[[]aƍƍ]abcՍՍcээoorތҍҍ֍֍ʍԍԍ}ʍbƍ}~ɍɍӍӍ׍׍%#Qcmō = ōǍ Ǎ MύL(*(*++(Î4Î>܍B܍ˎ:4 Z:BˎҎAAҎ@%@׎%׎E!!)TEݎTݎe{= R=POG|R/_<53 _53 < e ` G<D`DGXeXpmp|Jm|ddY#h$Yp'$#ff\0g\hFz0q6;qz6gk;&s&Hisk-iF-0nI0IHMMMnQQSS@@AAGGĎ^I^KĎIOΎSΎOS͎ŎV͎VKrʎю\ʎ\ڎxڎexǎߎx~e܎ߎp܎pǎӎ̎xxӎَ}}ӎǎ̎ώЎЎَ      ގ(Ǝ Ԏ > )P Ǝ/ %%.؎+1Ԏ+/ Ԏ֎ .֎Ï/1؎Ï?'>ɏ>ɏˏ?ˏM'HQ"E"ԏEԏ׏6?׏؏4؏4NTTߏNߏM6"W[_[W^_Jo^QL9LbnhbJn`oJwPi`wBiofoUYXr#U r#*yy(P*o(` Xf77kcjc;!;j:m:!kCm**C-oKK-ŎKRюK88Z=R=a]E]ZE|FaʏďllWǏǏqqWXXʏZ[[ď__aacȏcȏ~ޏޏ~ώ܏͏̏pprݏΏy܏ry|͏|̏ގZʏޏݏΏяя  $ ÏƏ"Ə ŏŏ"Hˏ 35953&>Ð&ÐƐ+Ɛǐ+>GIː3$ːGΐϐJAѐѐJ$>$֐,֐9R@hݐRǐ>ݐO/BYL,$O@/LMCMD@CD??Nΐ>`Bf`HBϐ>bt\wbK\tKwm} m   diixYYd}} {e {$&&)w)*FF$F$F@Fw*z55zw99::>>?BB?FFHHJNJNɐkkɐVVWXZWʐZ]͐͐aab̐bȐАȐӐknАnr͐rkӐXʐvvwx|ĐxՐĐ|ԐŐҐʐՐŐwԐސܐؐҐܐؐאސא   ِ 9ڐ  ېIǐ!!11Aϐߐ#"#.ِڐÑېÑ"ߐ7ȑ-"ˑ-ˑ͑,͑БKȑБK3G,"NH4Gّ4ّ3"QLfޑQޑKw<[}xM[<8^8Ms`I@^s`t\me/O\Pl'P _oI[O{o'@[t[q{l/i{ _c/0d50cd "i"p>> q(p(++,}0},u01;5z5NSzSu;==>>BB͐]̐aaKKMMjjSǑ̑SYǑyY~Ővv"vLv[vmv̑yΑ~ё~ggΑjjmՑmё֑qq֑‘ߑuɑu‘ϑɑՑߑ}~}ϑ~đđߑ ߑؑבؑ!ߑ .#ґ!7Ñ#őő͑2 ґ8<8ő Ò)ÒĒĒG%G̒̒$)2ϒ&Oϒ?6?$OA*6גؒؒT&%TALA-Rג*ߒ/@L@/ߒ-JA{J429ha 9aNQhN FFhPhQhFh|h|{r{.rs Ps''h c,c.1ߑ121%1A15!!$$((p,,..00UV3668WUWV38DDHIHΒdʒΒQʒQlmIloԒoԒYYuudu͒ڒc͒cfђfggْiْƒiВlnҒlבВwnӒ}~}Ӓ~ђڒƒޒޒՒ <9%#%Œ%6%r%Œ7#%7%%-%.%Rؒ@%F%<'Ǔ Ǔe% F'/%/%hڒƒ%<F%ݖ% %%*%%%\FJ&&JXX1AF \\L:1 LpF: AsFhthtjjxxzFpsmm !zqp(`o `**oqW{]|]"v88"=u;=Wv|;u001144688<<=@=@CCDD{IKgҒgIRRUKUXXYwY~ۓۓkmՒpkrȓmēȓēؓpؓ#ޓܓړܓޓF|##!! # ! !֓֓ !!ÔĔĔ!ȔȔÔ ̔̔-!FEДҔ-ҔДF֔L֔ؔؔڔTڔH^[L!!T!^HB)B)A`MPsqs>nanQ{S{QtSWwuV wA[WZ`[` O(OM[**%>qVt1P[666666(c?~%cu?~v,,-./0/x0ux99:;U:;@CCbFbɔfɔfŔNNŔRSՔRyՔrr#r!r[rqr͔y`͔ٔd`ٔdeݔܔʔʔkܔkoړos”ƔsݔS”Ɣyy{{|~|Δǔ˔˔˔ǔݔ~Δ ݔ))1E̔ӔӔƕ718K33Tƕɕ72ɕʕ#V4Еʕ8ӕKӕЕ4וTוٕ#ٕܕVܕaWHWt>DD><OuZ8<n=hg=OOn]v]t?tZZ\b\gn]UQ]nngUG.[[.0zn zqn Aznn%Iqn%A@FFGIG3355676S7@@A^A^ccݔeNeNOmÕOmΕuȕoȕÕؕ\Εu\]]aؕabl˔nؕblmmǕؕqĕqsŕs͕v͕vwxwxە~~ѕؕǕؕҕߕەՕĕؕԕŕؕҕؕߕՕѕ  ̕2 ԕ) ̕ϕ'ϕ')֕ ! ֕Ö!Ö>Hܕ""(̖̖(ΖіEΖіhBQ>זBזSQTږܖSܖݖږ?H$bHe:E>:eUCCU 2Q9 2cY9DcYDWWrZ`nt{#t{kj kZr   j# |*|yuuo/4d^/4^dop4f`r"f"nr$$Fp,Gz,zG}F0}340Pϖ43HPHJK JSϖKSUUXʖss֖s`ʖ`= ;˖ff͖Җ֖nҖnoӖoӖwwyzԖޖz}Ֆɖ͖ؖɖ}ԖXϖؖՖyϖ) >Q#Ė#Ė-Ж )ٖ)ЖߖTזٖ=$ݖcݖrݖyݖߖ-# 5E E/5/ϗ ϗї;їA<ԗAԗ՗ڗ%՗..>R<ڗVZݗVݗRLWP?L%>W?PMYM]]INQIO[\GcONYQ^\^<Y[IGcTppT^  { 'uR ab'd((00a_u_x_xdeg@ebi$i@$,,/H/011056S56X˖XA͖XAXCICIKhmhmWKWɗӗZɗZ[ח]_͗_ޖz[cٗcʗg]gl֗lnnpȗpӗٗӗ֗ʗȗǗǗ~~͗חΗؗ ؗΗۗۗ — —'ėė +.+>ԗfZԗ-ܗ4-42EܗFEǘǘFɘʘ?:?ʘ2Θ:Θ77 ҘԘ&Ԙ &9NژژܘRܘݘ\Bݘ8983\%LL%ɘ4G TU_ӗʗ { erO rrTGrgrrUOurrҘNrrrr Y  r Phr;vvr}r rsw`rdrbr;rrr)s)CrN1 r!r1Tr3z3Re;;VVBח[B^EF^EYPOOQoQИoИ}ޘ]]^_٘^ޘh٘FhkјјȘko_ޘ͘o͘tØtwӘӘwȘ~~֘ØȘĘ'֘ۘ ߘߘ.?Ęۘ" ' $" (טט3ܘ'!?Bܘ$ə!ə*+@*Ι@ΙϙљљҙD+?X?ҙS&%ٙٙ&G?ϙ+C?ߙXߙGYIIYa,r?,aC4P4JlJlh  rA RAReT?Te?SDs?wsxMxyM#y {z# {z `}[.`[V UV.-p6-Uz333Ș336 upHu p)Kv)vH|K44557:|:;;>7CC>GG˙LLNNjЙjmЙ͙m͙YY[˙[^^șڙڙƙcԙcۙݙޙiۙiݙmșmoԙoqqƙuęęә{{ޙՙ̙әʙʙ֙ՙؙؙ™ ( ™י!!Dϙ%ϙܙ"יי#%#"ܙ$-H-ǚ$ǚE9ɚ'9ɚEPњ'-њӚ1ӚԚ19ؚ֚KؚښAښޚ6*9ޚԚ1R֚*2@2=\g\<\gK9R6=j} <A9pOpHaak|B|BsF s  t l]j\lwXwyyXn5zn!!~z>'~'((*}-//*4L48-}8:<:<AA[[DL`ddLDešϚeϚšVoVvr͚Zvߚru̙u͚ZߚbКffggҚkך֙qךk՚qۚٚٚ{{ҚК՚КÚÚܚܚ   k% 9ǚ6ǚ@ǚ\ǚOǚ 22%+ݚ  %+ݚ=˛˛=ϛ>>ϛЛЛԛOMԛ՛՛"ٛSٛCO#$SC"M$Mk`aa,363F]UW6Et ;] ]EP;X`MPUEWzzilr&lu|^r|&)u}i}^)\[11m !%j[r%((,mr,../LN/~~N99T==@@ADDEEКbۚbbnpɛ̛RӛnZRɛ̛pZ[ڛ]_ӛ_`{[e]eқhÛhmڛmooÛuuwxy{{֛yw ֛xߛܛ`ӛߛܛ؛؛M6rA++b+f+)++++#Л)+++++L+r+v+`+a+:33M3̜:,++̜͜͜ӜM++Ӝ+'+-+ۜ""3V++ۜ$-0Π+$;3;O31 +10*+k+2dSO4  2S4<3<8F8Q\KQ|Btjtzj!!j \   i(iK|X\zp^fB|>fzq>AAAAAAXz^zq1122pz7788;<<@@CCEIIJқeJOORМRSS;МŜYYМ\\^^ayabeќќefǜiǜiΜߜkkΜnٜnϜٜߜqĜϜŜqĜМ՜EԜ՜ԜҜҜߜ֜ܜٜ֜ܜ3|zМ  œœ%%" Ȝ# Ȝ#"ל)) ל"؜؜ݜ&ݜ-ۜ&> '>$d͝$>B>͝9ԝ=(9'[>=+ԝ+(535ܝ3ܝBFH!H]Z][!cTXcUWt>v>XDUK Z>>KTDt>}F}gogGd*G l ,vhP Vl* hP,~,w|,w~67x6!yx%%!y'A+L+'11LAvM:NŜS:M_>N>pm_bfߜfffQfQmΝpΝpWYpWY؝zzѝeeѝҝi؝iߝmnomoםnҝӝߝӝ{ݝם{ݝޝޝ>     ÝÝ  '*4 #՝4#Þ,՝Þ*@DǞ@ǞȞ5Ȟ7T7 **WўAA8R8֞֞R)?ڞ*ߞ33?ڞ)ߞ92F.o,*d95*g<6gZ;.?ў5V <| w=;Zwj]]jJkJk_|_s""flsf|&lh&h~~|a=Zc`d$qqa|p$tCtBpBBC--KK33c|778d|>>8BBEEGIIGLMOMƞuƞOYĞĞrYu͞v͞^^`adʞʞdϞ՞ϞgŞҞٞgɞlҞl؞ٞОٞr؞rv۞ɞŞ۞vxОxݞܞ˞˞ܞݞ  *?26Zޞޞ ޞ ##DÞ̞̞ ў2  :&ğ&ğş2ş%FʟFʟ .: ΟH;/HҟٟC;Οҟ/ٟP%:jC!"(0eb0(e,Q,"P|Q2KbKjoj=<=o<`sAsN|Nc z c|i|iyz|q_qfy|f|""#$#h&'B&u|$kk-0G08LOhu~8~{<{<=A=ACCEEaٞaa՞dŸNNßǟQßQSSVrZZ۟t۟ڟtxڟccffןiiƟןןȟܟȟޞ2.Pb ޟןןܟŸݟݟ؟؟ ޟ  ş ϟ%ɟ П%ϟП!ҟ!ɟ(6(57! ,ߟ ɠ7ɠߟ9͠3͠ΠϠ39Ҡ*ҠϠ)FנؠڠLڠ۠נ)*/LHB[]A|ؠ.56]/,b^Bb۠1Tn?>?Tm.Fme^_Uy>1HU__evgvWMW M    Yddg~---oŸ-ǟ-4oY`}~4} !hpjh r!ju)u)*rpKwKw6OO6789QVןVVV6V,V8ZEEF9lƠF ƟfsƠ\ƠSƠk lSlܠƠԡƠsYeƠ\Yxx7lӠfƠӠƠtƠl ƠޠrƠrƠƠ>ƠĠƠ٠~~٠֠֠}ƠՠĠޠàà ++ǠǠΠ/ΠnΠeΠgΠFҠHҠՠ[Ҡ ,ܠ00,4,:15/ɡ5ɡ:1/Ρ4Ρ>"ӡ'ӡԡK'"ء-ء١B-+B;١#K&y#&@&@HH_GG_3_O_`  3O ~posoLsMLM$k`kyVy x2q`$_qR*m_xtR.[.[ t2_em!!v$$%%n**--//uP8uN{P.{8TTN>>Z\ޠ\\G\\GHLLZʡHSʡSաUˡUաYYwááˡ\\aơ̡̡waϡddefסiijۡjڡݡۡpݡڡסps֡stvޡvy¡ޡyšġơˡ~š~ߡ͡ߡܡ͡¡ܡA  "  &""С#'"#'С>Ρ&ԡ_ԡԡԡˡԡϡԡ;١ ŢŢ ɢ: "ɢ A .A΢ ΢Ϣ9:"ϢӢ.(ע(עӢڢ)ݢ2I[+Aڢ+Z[ݢ,,)9A2ZCVCI656mQmgQgbgbhIzFcFQevIO On% zgu%^wowh]k]""?l?%%xxl))+|+|rHu1H3^13TT=>B=B¢DD{ƢƢסfMM}ܢnբ֡pnt͢Ԣġtt`͢`Ȣ{}Ȣ}ʢgԢܢgoʢoޢ~Ңޢ"AI~ Ңբ̢̢֢ТآТ& ߢ٢ آ ߢ!ĢĢ!,!&Ģ#ˢˢ&#Ѣ9΢ Ѣ-ۢ,- $:!'!ã$ۢãţ:ţͣ '.! ͣ  .*5gco*ܣܣ4S4GS/(XqS05Vf?5fX0/2?2@lplG;;Hqjrk6jstFP7sFsJKH8Ju_ u 9|Z  r)))|cCiEait6P7_8Z9>>!>S>cr>¢BCE../4/a45578<7<>>@@CCD8DNNPPRR£VVZZ֣\\{У{ddѣߣgѣg֢iڣiݣlڣۣlqqУtݣ٢ǣǣt}ģգۣʣʣգݣߣޣأأ ƣ  ޣ  ƣqä666-6%¤%=6¤äǤ:(VǤ@ʤ6Τ:ѤAѤԤM6ԤפTʤ?פ2Wpߤ2666"6ߤ#D6U6V6Y6=-6Kߣۣ?ai6Bmeo6;6;v;;;Τ?B#WnAaemobMao` ` Lu L p+Tav  f{""f%%&pCC+nm&w040w477£R::;~A~A;֣ZjOjRS$R=S^O^_.Cģ}}kZ}9J_kFդooդݤ\vݤuvxϤxWzzϤ ؤؤ;ݥT-ɤäaäWämäbää ɤ'2'Ҥ#!!Ҥ8#18¥1¥åĥťå(ȥ$ȥʥʥĥ)ͥ=ͥ?ϥХť*ϥӥ.+֥,ڥC֥>ڥ(8Х,ߥZӥ=ߥ9H@H@Jc5>+c5Jnmnp)86p*8u 6F\{D{J\KIK{ -Pl  P&uW&l-~t !q#&;&--//~t55~88 :;Rq:;CCEF!EFkkkk2k8k#ZZɥ˥aɥaܥfۥƥfh˥hikklnnooۥqΥݥݥtqƥtΥyy{{|ե~~ޥǥݥեԥ|ǥi˥ ޥݥԥݥ l 'Ħ?ͥͥ(+'++<=¦¦ĦB> Ǧ B"1(+1$ϦǦ>ҦҦצϦ*mצT*$NTݦNOTݦަަODq)I^PG)T^GTJbjjJ?YbUY@wUmwm[RcRMHpMu X &&Huxr4s[ms4  ;"#Xu)}x}pm)#zFzLL44L66VV??\D\ܥaeevQQRRTUVXXYtvئ̦TbئbΦdeΦdeiknknoΦզߦtզȦߦtuuȦw|ܦ|ŦŦwۦܦ+<=ۦ &'Ӧ "Ħ&--2- ---'-L--Ӧ/֦z-/-H-֦ŧŧ--P-2-H~-:Ч:ЧJE%0? Je-@mcur>EPPK%-\W0-\@gH-@gc-f- >5K W 5hh SjmpSxmpZBxZlfxl""fq[ }}))s]sr [2v2 ={=##yvy(CD],D//22z4z~{C~==B̦YVB^§§^`Ƨ`ƧIJJI(˧i˧,XʧߦoʧoXۦo\\4_ا_`bݧbddh֧hاݧlҧlnǧnէ`اuuxɧx֧{ͧ{|ҧ٧ħǧ|٧EjBΧէɧϧͧ  ܧܧϧȧ&&--ȧ*!ѧק!ѧ))ק8<8*<"<ɨɨ>$<̨0O'$̨">LO'0רLר٨K٨ۨ6ۨZMK<MZ+%a6<a<+^Wq^<fmrfW<Ne TTiNveYg]P Y.ccQz    < m  yPijvo}}g.ykj7 7p p)q]io)AAqJ~3~3R77;R;==??AACCGGHHcLƨrs˨U˨UƨZrsZ[[bħ{Χ{bȨddȨԨiԨiƨߨߨըըӨqӨqxxz~~֨֨ܨܨAŨ !  èè! +Ũ14 +6 Ψ  Ψ8Ψ6"81"%ۨި4ިݨ:,,ݨɩ:ɩ@>&>ϩ##Dϩ(IѩM/9@PPPeBPѩ(iQkTP9E&MSPDtPIBE1^^2jgjTVP\f/|P\fPcP$S'u_vuNN$PP_v'}PPtV|c<}h<Fh$$rrK))J-OFJKƨL-OLLΩAZAaaRKKkͩکQQRTTͩkөZZ©]]_Ω_`aک`ҩ̩a̩ҩuuyԩyԩP*Yթթکթ    *ȩ&ȩ+*+Щ,֩% Щ% ٩ ֩٩ש.ש CŪCŪ&*,*Ȫʪ2ʪ7D"!DЪ6Ъ!32ڪMgME.*#*Ȫ#ڪHYEH2*6"//YW7*1Y1L^L^SjSjB 8qtt qWY?U|\h\3DbBY8Yb|z?Yz---dUY|Yf5sd95cfcs9$$}'}'F{G,,F00G2{x55VөTV[©T[DDEEIILLNNêRRѪVVƪѪZƪZ[ɪ_[_`ܪҪcҪ~eܪ~ԪӪhѪ`chԪ̪Ӫq̪qrtªtݪ٪ĪªӪݪǪĪ|۪|Ǫ˪۪Ӫr̪˪ϪͪϪͪΪުΪުתת ߪ     ""  «  «ī>ī <ȫ >ȫʫ4ʫ4@OJҫ@^ҫӫ֫3b֫f3&۫Oi۫ܫܫJ\T\^hbӫ4i^fdnd88g=Y=aSaSjnGMMGv}v}jk*ldm*+dx222omê2Ѫ2kn!p!+o?pz?xz?lnnFxFuI1u13PUP~83~8@U@]E]ɪZEGHGӪeeTeewT˫{y٪t]w]ͫyͫ{ce̫efhi̫iΫƫΫrrttǫǫhѫߪnޫի ի ٫<٫#A(+-*sw*<ī|ʫ׫ث6&ӫ6׫ث ì TܫìŬŬ I):?ɬI:%Kɬ%ά?O9OKRά"")>9gYM9LRDLJD߬>߬Jd^^dNCMg++gNa U ;aPU=;Pl=lYYVVj\#[\j[k``myv ym#  }  -}_WX-oX,oZ,bZnb!xx!<#%%A(*+*-H~˫HQ~u44uSQS<<=zpG=G{¬IcIhƫhѫhRRXpXsڬ\ڬ\wҬ֬Ҭz{|ϬˬϬӬ֬ˬѬӬpѬޫpج¬ج̬̬Ԭ,ԬDլ [ d )9C&Ү& "1 1­­íĭí8"8'ϭϭ$Jѭ'/fJ׭S׭ѭ$ڭVڭFUFޭUޭYQĭ"S)//kQYv_T.fTPlPW hn hl>DD>CKqMEWEMVJ[wqK,[LyWl   L (Zny,-]b}bn00Z}Cld!dw!##r']w'Hj+j+,0H0N4N:4}:<<@@B^DEB^eEeiUUiŭYYŭ[ʭ_֭x_c֭xcdgǭǭҭgiȭilխȭҭlӭԭխҭԭլlw}yӭyحʭ~ح~٭ɭ٭  ۭܭܭƭ  1$"ƭ˭)˭-*Э)ѭЭ-"$)$..%®®Ů22ŮAǮʮ5Ǯʮ.ήήCGѮCѮҮӮӮ(ծ(Fخ خٮIFծI$ٮ9ޮ Fޮ11&\N3J\aR&9/5AaJN36W 8Z6R8n`nppeArwww jjq  XsX ww,,,,u}uw7w7=z)ww|wzw=(()DD/ɮw/v1|v5|w5616;;<<>C>ʭ[CîEEîKҭdKffĮPPĮTTU̮UԮY\Y\_ЮЮڮ_abݮۮdd̮ɭaݮbݮˮˮsۭ{s{|}}ͮͮܮƮ֮֮$*%AG׮׮߮®Ȯ Ȯɮ'ɮ 'FҮ$/Ү**79̯ ̯7*ϯ79?W ?F@Z$'ϯJJ`ݯFݯJI+Ie+LRRLN- WqJNs WAq GqG}BBeHcHJwzwJ[O [,~ ~Sv)))̮)ڮ)ۮ),n/nrr8i8xi!!xy$Qj$yNCj+EKlUKKQҷ]/ԮUBB]HtYHM 0MN˯SSUUWïWYYЯ^Я^կկeܮ||Ʈ}e|hhjjklk߮lүѯtwίtүwܯٯ˯ԯկٯܯկկï˯ۯίѯׯׯ6ׯOׯfׯvׯ  "" į į ӯ .@ϯ֯ .ӯ((֯+گ+İ1گ1İ߯8߯V߯߯6ͰͰΰ-8ΰAeKK8װذ%V>Iװ>ذ%c-Z-7ZOzOgJS 6 gPpJpmqPqmfOf#vL& sL# 'vQ&T'TnTsQ,,7Zrnr9%ް%oDo0EDE01˯NNկNѯNԯN-.|9[1BB[+jaIIMMpiuUa\U\{Ӱuy~ްܰ{ް~~߰ܰh߰ӰhհհׯC%yۯvvyy~~°°˰̰ ̰˰ְְ   Ű ""Ű-.а  а/,6,4&&ٰٰ/Iذ4ݰ6233ݰDZADZ2ααѱ+A5ѱO;7;ձ.F:ڱFڱ۱$ձ7-O8۱9@E@:EaXLX[[Pa=8$<98 j` o`oNVVC]N]tcQTQ!Tjtc!    r psrR xx|1ije jz s?z?((u++uHHJqJ4M4q889::??@A@AZEZ±JJ±ESϱSWYYW\ٱww9űٱ\űiij)lm6orϱrñttñvбzбz}}ƱıvܱƱjܱlmo ,5ȱ )ȱʱʱӱ8ѱ<ѱӱ=ѱLѱ6  IJ775IJ*2C!CͲ*CͲββ!ѲѲ$CPղ$ղ;";,"۲۲,CXC>C)D-PCD=/XK0KHC=CsC0C]R PsB>H]BpCdgdeghhFF# T k#Tk'sq'~q~'pa<ee  "<G"p±AAϱAA.G.//;;ZZ^Z^FFIIKKnuɲPyƲPnwƲŲrɲuvyŲwȲı}}DzgȲײgֲڲ ttvvwyy˲}}~~Dzײ˲ֲʲֲwڲ %5%>% 2`%)̲ ̲ղ5 -ղ/ղݲA% ݲa%,ݲ& \%ɳ&ɳ9,̳9̳>-?z%-D!ӳDӳ?<!<޳NNQ:J޳X:X_Q_=7J>=7j```EjER88RbGbGkaAoaoH$[kb[u$SuS''c{mfc0{f033\hd@Cpph$d@BzB$C+rr1rr1r44668899UUʳϳHԳH߳JKJKPPSʳSTXϳ۳Xس[\\Գ^aTʳa˳7^Գjjt߳<ʲ3?Bt_ڳڳ}ݳݳ}۳س[ϳܳ) ܳ    5ijij γ2)γ 2;;7´ƴ<ƴǴɴ3ɴ˴?˴δ=δUѴ=Ǵ<Ѵ,״B,U״ٴ*ٴ۴R۴ݴݴ޴WL޴W*]_- B_Hm@-R] @´7bkbk L >:D>dYxodAxYMNvMve | fZr++++8+y+D]cYf""Z&&'c*n4'*4577;~?;==?CϴJ5C˳aJMMôRȴ̴RTTUpUʴpӴʴp\Ӵ\__``ϴմddfŴfjŴjkմkopqpȴoôʹzʹzq̴}}~Ҵ~ϴߴߴԴҴԴִ)ִ Ĵ Ĵд  ˴-д8 8:<]״:8µǵ 8ǵȵ8˵)˵̵ϵ!̵ϵеѵȵе,µ+@:Aصص,ѵ+1ݵ1ݵLLA-8WoNe88g8)8/8>h| !8>,8W8g8A/yguPguyPQ Q V X yn*mVyeYXytYy!t~77y!"{y$?"B{B**FrFrwIIvw$y7v7yZS=SZZ=DDEGHHGKOƵƵO͵lҵll͵XXxεҵ\cõx|ε\Ե|Եc׵׵fҵfõյqڵŵյqڵӵʵŵɵʵӵlƵ޵޵ɵֵ۵ߵߵ ֵ۵  <ٵ   8ܵ 44@еص ٵ3ܵ ܵɶ8ɶ˶˶&5ж&жѶh 3N'NR(P5RWPA.ѶA(Z.-M60]0]6MZW_-W_W``m d^`WmW99aeda^QyyiUhWi#QU# mZ h}YT)}T)Ywsspb!!#p#&&BnjBjCCn--EKKWKKKK99<<??@@öEeEMǶegMgǶlTTFUrWrW̶ݶ||ȶdȶdee̶̶Ҷ۶jҶjllܶܶpprݶrͶttͶwwxӶzxӶƶzԶ~Ķ۶~Ķ ض ֶֶ>AضԶ = D"G";fK'˶:նն6ٶ67$ٶ7$÷÷Ʒ>Ʒ. ȷȷ.˷̷˷%(ϷѷAѷԷ=̷%ԷַDַG ٷ;ٷVV 8N8;NBQCfQBXCXHkHFLFIuL :Ϸ>wbKu Kvu'IYq Ymu {uq'{[uvu}Z}0y0m!!yu|%&ö@&**,,Jm%|JO6O688AUUuUUUUABCBHHIb۶eηCNͷIͷbͷSoӷoNηW_rrƶrӷWڷ_ڷSͷɷܷccɷhݷ۷hݷŷ߷mŷ۷ܷmnonзqotq޷tз߷y{{|߷|·ʷy·׷׷޷߷  ʷǷ## ƷƷǷ''(Ʒҷ(շշ>> ĸ)ǸǸȸ˸ȸD˸DEG.θи@иѸEθGѸ׸Q@E׸kٸڸڸJݸ"ݸ߸X߸^EQE^KMRZRMKĸ> F:?? :JE"E[ ZXEwrl~sPK~ٸQP}}ppFZ\u wZ \]VVrZ[]x[lZ`v e e#f#`(()*,k,*/1126)zv6OSܷS߷SkO2azGGaƸLƸLNɸNPʸPQfTҸTQ̸͸ӸXY[[bøӸɸX͸ʸøbeظeffk̸kԸҸnոոrrոY͸nԸ/ָϸܸϸ  ۸ָܸ۸(޸޸ EKu)ĸ .˸ 0"-3.0¹ &@ʹ -"I4ʹ˹Z˹3s&Թ@$"ԹֹIֹ׹¹"׹Iڹܹܹݹڹ4ݹ$=UBU=RUBR7U\adx 7iji\UaUdUqqosMUhsogmghS M 'uy]uU]{'{+//Ӹ//ظ/ո/+y!!##%&)%)+/+/v2552v99;;==?B?B^^&``NNϹkXϹkXYt^^_͹_͹ccfιfϸUιѹrѹrsuv޹svععùù޹ȹȹuѹӹӹ . Ĺ" "(Ĺ*̹* ̹ ',,̹86'8 6 ۹C۹ƺCƺǺǺ>$D-DκKκKк >6IE׺I׺-joSmк.1ZH$6RF.61H6R7g70:m[mO[ho:OmhoM0g\M\{l{SlSx ~PPPʺPP~Td3T/ii3@`!#;~((`@#..x!4x46679<<=YY6YgYmYlY=_79KKMʺMúPPQRSUUSrYѺ[պͺ^պ^}[YQʺº}RʺݺºhݺhߺϺlٺlٺϺnoppsۺstۺtź{{ (غغܺߺܺnߺDX ںoߺ\ ; H zZvq )EкZкֺ&+ֺ*+ͻĻ*ĻAǻǻɻ%ɻF˻˻'ͻλ'л&)λJ8JлDػ8ػٻڻ%Aܻݻ޻߻ܻX\;ݻX޻XHdd]P  >  d Խ ߻XDuٻDTdڻDTrzFFE Z!! !!vu](,yyx}/qx}/5,v5""#%m%mw'>++,'.00>2úM4#9|R9EWWѺYCͺY,CFû.FbƻƻbLLiQiQXϻpźpXYp2Y4ۻۻûeۻeϻϻѻssѻ̻wwxxһ{ں{һ̻׻ )A &&׻$ɻ / )*ӻֻ)ֻӻ*::>üż8ż >8>5>ͼ5ü ͼμ]rμ>Z>[>_>N>ݼz>>ݼ޼>޼Z>[_><>><^>ɼ>ZI_yIVaayVN_KznK}|Ww#n}b b -|oo-|.\44̻444""$$&z+z+../0/0557799==>>ACCAļFc¼¼cFKfNKf̼k̼Nk&XXļuʼļu]]ϼ`ɼ`aммϼhhʼlmlҼ׼msҼsvv˼yaɼ|ȼѼȼ Ѽ|ȼ y˼#$ؼ߼ؼ%/1 ) <#'6'ƼƼӼ%μ8Ӽ81;;) DĽĽDƽ3˽3ƽ<˽̽ͽν^̽ͽII6Mν?M!?!\\dVd}WUdVHdEdOdURdHbdjdE\QQWccYORuYuf b *"wSPS*+w{dd0j\ddd@{9ļ99d=ýdtGt@L{,,p0G0pL334x64x86;;??@AAEEGŽGaK8KeŽ@eQRQRýǽԽ׼mԽнԽ\ǽ\]]_a޽aѼ|_н߼|i޽ԽikkԽԽԽ[ԽսrսrsmԽwȽwԽ½ֽs½}ֽ}ؽԽԽȽؽʽӽ׽Խӽʽ׽ٽٽ  #ѽ"#ƽҽ*#̽# # "ѽѽ)ҽ) #þ*B#þžžǾǾʾ 5#ʾ˾;5;˾BоNо+PҾҾ+N#׾I׾ؾؾCY2Y-ݾݾHWWH-W2<JMZffJM<2P  ZUT<T UtVnnXVpIP^p^cCP`!Sj!`tfj  bl.~l.obXf[c3o88$mS~e$&&A++--//M06xzx56ھx858<<>??>DDGGIILL̾¾NN̾kk׽kkkԾ\Ծ\aaddegھghhپk޾kleپ޾ӾȾlzz}}~~Ⱦ#P2fѾ  Ѿ־ ־ ߾ ߾! !ƾ% "ƾ" % 2ǿ92(93( (*((ǿ̿S(_(3̿7744տտؿ*ؿڿڿݿS[(ݿ޿Y%UYUZ]]Z_..V;c;F:[F@WWeB@:B|wwnQnqw|J ޿SqQ JisSX|Xx00(0|0Ŀ00z6666¾66{|jy|''|M,-|,|uM-u8{|8:y:<<=^?@=\`?`^@ĿLLOӾhOƿRRUUVYVYZ\Ͽ\ZvпvcпcdÿĿghӿgӿĿoophyĿĿϿĿÿĿp¿yʿ¿ʿdϿͿͿ ԿԿֿٿٿ )()   ((5}55(  I2IVc89F(FX(+(X+7>9 ;7(>(Qj(i;_s9bj5aJb aAfNkjANfKKk!ssk[ii!lk[ ^k kk^Tltq1t]1`kuqkk%u%kk**+,,0+01L1ƿLP{{P8989WB\BCWFFJJCNNPPUUVYYVvvbbcdc}jdj}qqrrwֿw~~(k   2  " ! 5 $$"5::##2_2 ;h;KKJQDME[aeQKGeHhHh>mDKSSsT]>MKEKu[KaK`IkIkX ZXGK zRuslR zpRRZ zlp6ff6!!vx=l(({/v/{x=33556P\ U \EEFGFJJRMvnG]RSp6TS\\^^__yfyfhijihjuuyy||}~}~! "$KHms$ :: %*%*7C7C#+<'+H<KOHK'=,=&#M,& M@OL@L2b2Rmkgb g k;;llvm`mvcIcn-]dtoa .d  I)T rZ ot- pa.8r3q)nwq8##$%&nvw.BsB.%s3x3N<RRRR<x&INI{NNi$TT]]cz{cdzdkklnnoossuulzz" (!(:;  H!G@:['*)4'2*;KHG=>,=+>,@`MSMG[2 99mp VmUY`mUApZAfmV||tmtWjWj-`mXwmmXOOaw-a-/f/mmhe!m!h$m''((++,,.1$123P9{{P9T;<.><>2EEIIJJiiq3UUWWqx_x_;}}hhjjmoppmovv||}  %")"%)4")&"#"K*0":"K"+e"*^"S"SV"&w"-5Z"#-:Yt"0T""GP?P?KeG/:]n] nD kDeki^iaalylyqeQQqS w^ V Z t6x4TsrsxX3X4r6""%%&&**,,-00334-u4~9;;9>>AACCuLMfLVVMpzlz{}"}}} }H}f{lyy   )()..(5  + / /2+/2 DEDEFH=F'= KK' 1N!I?!N?I1HT :68O^O<TH<^^ 86:Hjii@n@r@G@nx@irGix   " \mB\o]}5m0~47]}5"7"&o~>&BJP.kk.RJ5J5PR;~;==_YY__JJeePPQSSUQUZZ[]][aaiirssr(##$$ + !-%*%2->CEC?HEBGLLGB!HC@>E2>I\I'0',3,4O7O47bNN^hKh>|KbOnnRmtft|  mh  jjuT(u(ggwv}(weeee"e;e",(++,1/1/445599=S=@@XXEE_G_JKGMMJkTyKkTyxxggiilloossuuwzz{w{+mIy*Op?\30H&H@O^QQ& -'! N'!;a;R>^F>.f^DDj7T L7mL mIveGF}~-Ny}" }" )fOb)YYb,,,,1[|[66p::&&**+f~mG/2K234K773:<<>>A+AZ/``HHJKK4iiSiiSUUZZ\\wwZddee:kkmJwwyym    &'66Na.Fj'@1-1 -BB0OLG0OL@PGP9G8G![!~|GGG9Gn;n58EGGGG9GGG5DxEGxi}iV p  s V}gg]oo4^ !!z#^] #).{p}.)01|J1|88;;>s}>zBBC\\HHIILLMNMRNRSSUVWYYVW\\_0U'C/_PA3Q2^uml~r  '' '&"++"[ / ,(;,D}{JFPJA3KT-KQj`j2Oo^uOuaqabmQ-T  l~Q lc0005y lp5yp#c#$v?kv$rDk)nDtn?r)t1124457782XZXXZEEG8GM5MNPPTTss\N\__wwggiijllj &"'' * (F --    *6=33FFTL6.A.`Uo0LFOFC@Fqb0;9FoF}FC;@OVdV<W9<UAco:oQ>QRmfSfFR]L b  hhX Y((kvkY/p[[/p{e]m{m!}!e:u%%bmo**++w00226N6N89=>=>?@\@IIMMNwRjRSNYSYZ\]\aabbffjj?lmmqql||*Z]  &&=')A;'),:((,:44-KK-OdWPPOO`O>mX`v_US_^cTchAdhVQegkiVXxWe^OdOXFkW[nu!!!F[ {{ nuroy2y59999995z%@tBBouptvzsv<%<<w>>Zez{.;VVZZ}w~ e}~efllttww||}}f   )!!OAQ&&+303*+*;)4D1UD7JTg;0ixTA[)0TaaA_L_I40CMb YLIAM J7puMCAursbEYEpEcE#Y\\c#v%%% %%[,[,2pXX25jj5x~"x"##qz*q*FHHzFss99:V:B`B`dffQ dQnnv],v]y.cycgiigqssq{{07A      1, .+''55+6< C6+<+ C+E+Rv7+788R0-W0R-YXX/_/>_>F=F=hd@Glvd;lG@mzYRSvhRmzZvSPv~  Z[v  SP12[ta1ta2vfA""u'v'AuA,,..1122v5O|O|;;<>?>DDGGnj5OOjjonoWXXW\__``\?iiknnpp{{k&(&( 4   4 $WEE00=LI4$4=4IL4;]4UPUP]6AQd4Q@@A6d aa7B4M z4:M:RwRBfdtH td~SS ~ z %|y%|Ty^33}5'<<<<<<')o,,-//-xN5N566<<=??@@[EE=[KK)}QmQmmZZ\\ddeoossyyz{}}4   && ""9%09%0%%AC7wA%S7S7MH`*F*+U+::OaOT aIOhW`Fhi^^i^I|jMSnOa|!nk!Xk XgO   go)b[~x/1[3btt13q nll~#q#B@ nB*--.NK*N7799;TTC\CFFIIJeJPPRRrmmsr^^{{{{ggiijnjnssuwwy|}uy}|%"C"%!//) SF)U&!%&%::8+8<O~6=W(6<'TU=<'?>T>(VdjQmNV@QXN mW[cDd@WAD[KcA~`h`h $b\$bSz\ Yz.0.{K0];;;;;%;BE{C~E[qIY2q244Zia99y]{ZZa$kkVnVXXvvyddggjjllnns{s{}}   '<?+U'6'  '6003+GI@XG<<3 B )'A'3')3Ev$E$__Y-ZfS H;O;S-YZY?u?fYQtt|SOQuirU ~ h  HYm1``vo1o"iu"ruUumh(p(wF--p2w2~u77::W?W?@@BEEFIIJOgOkkJVnVWWZ[^^yy}Z}ffhhijjuuxxy{     +!I ! 'B.)9 .#+',FYOuh;)#,PMP;19#+#1\U\L\U|L;5D5KA%__CQbGdQGlNlD\A\|pe&nC$b%&"//22cc'BBB'H|HzSenzS==AA[aamLLiRRikmoko\\ww{cdecdvev}}#;M\  #F#,., // .  ? ? 3 K36OOQQNd64[4DBNDN-[YY-BHgH;Mf<  ME<ETxThS]uSWiW  ay;g k ayhxot ux_zt !"!zll)_y)pkxlFF00233{|9|29;;=>>BBDDFFGG=cQQWW\\]]bb lloorrsuuvv{{CR%s*  ((##77-gxytC11<H++''$E$ERf&N&%H<]d,*,4i6LR6K8LS8fVoKLYfSLdNeweYV l""L"V"k"" p)-OnOkZ-knZ{222^kk5^5""::>&jw&kG3GMJGjM3J779}9<}<@@AEAbbEJMbMNNXX\u\^^aaJffglmglmuuxzzx <)8:;): 2N 4G+-+K$K$L(FLK(KW[W%RG2w?b8?RbYiYU6Ue6>6e>rprjpDDB]hP]~ n~HFKP jyppp%[pny1y7c$pp$@@.ppppq.pq1M44778<H8<?X?XABDDBaIILLOAORRSkkSZttZxcciimmnoptvv{ot{pn8i  ;2-K[b  ex()55  l"!E)(2!HCC6p =@@HB(hP(T"(T9=H/9a>ajQUQejF2ExPH/HldbdcbqKK%kk~z}zq~W4g6ys6&qyfgs&uDD-DJ-J668V%\V8\DGDGcLLOOPPSSWpW[wp[wbbeehhjjnnvvyy(EH>U         * ' *7.7,7-7.<<>( (7'7;>E>;/>E/7FF75F57]>]?37?N>B>o>H9C7.cH[7fcT}>fV;NW}r>9p>BVofuQ` } Q r RpRzti4tqw4qw:@g:#$g@#xk+$x+,w-{/11/{3663|9~9;~S;C|CEGKEKMMNjjjGNss^^__cciinnppqqy~y~'  >zk  .)2)%% :=:23T&&<0>0>?8DF8FO@?<JJ@IRI7e4D<O<`754RSRSeRHRbRSHbiLQULWkPRPW YkUTY V-----dxV`` Ad6 h##%%&&AC{C-{-us0xX0Z\x;;==??sXZ\CFFIIJJgPPTgTpppZ[Z^^_f_fhhjmjmttuwwuy{y{ f. 2 =" )<*2*2)44) <' ARQTk 56A@M'<ODL< )KOD(+@16@ENbN``xKDED+DLGdM@X~nG(D1D~Q`bh xQ    ezz\ppu-XdrlssqqgHrggg&RCC}+2CvH&||vex26S6+}R<S<a[[[[aLLNONkOmk]\]`\`{{{{ uuwwx )<dx@Db !!-'-%''%''""'9,9'S),S/*#(*/'(%#n.Se.ex\Z__@1J1ZA@AGk^QQ^Ilkyg')JyGJIV j jyR0lYRaly3zcWa0cW3Yy6s:s$~n:~n$&&BB..1133KK6zy6>AA>DDEE`JJSSTTWW[[\`\`eefhhqq~~    %%+(+--8!8(4(!"4"(=#22 # /,@@'*,/(*'QLV7):)Q_)95x)7g9:Gg G; X_X;ZYZxKV]RKYVRz}0z s ]  is^jUa|^0bk| k <a"<}>**EE-//00i}NN889j}U}c9CCl`JcJff(f)f}f|fTTWlWYY-\^{{^hhimmissuuw\w||=%X%21Y2<=< A 5L&N!#N!&#3R4VD3N4NRN4X>Q>cQcBdBQVNDNdqbSnSq]"""""XN}}d]q[j[7ffj7o""&y&'(-(o'C-/y/113388;;<=<~=BCB\C~IIMMPPQQVVmX Yvvwaddhahnnooxx{{~~1)4%  KN=SAUNQq0)4i6s% G >E>454K2?2+*N+S%n5E097iU69s[Ut_tOqOy}Zqq,yZb b .Z,.gg/$8qqq$%q%qq/s/11|34R3|:R:<=YYqYYY"Y4<=JJLdLkVVoro[[]krbb{]iikklloovvyy{{   !" "!GE&"-?*!&('-&H'(H;A"NK7FFOA_KN@&&;'X\XR^Z}`^_m6@O6CC`Z_Zc|uuwmZzcZwZZ)|f.f)Zzwq.Zqw99"jx"x''((DDsw0s0M}5M8P5}P>>?8?]FFHOHOQQRTTUoX]UX]^`c{c`^jjkmmnRknuu&'NO   $+ +977B4&9 4IB\Z. 7B@&$8B:&)=)=@ABM1M1:-S-EBBBSBVBtlBWotoWpApeCj" ZY \CoeoV\eYo_Zoh>'V'w*w*++FFII1~4~4178<U<@@ADDEFINchNIVFVnssv_v_`{`ci{ikkmmcuuvv{{||   &o./   /=3   >B>3(5(P=,P=,[Z[\A\aXZ]a]Xd^bf^Zdoqrhq_l?gjr?sjnplbZxpfZxoegoz)-srn-yWr88Wz)e"}t%%&A))EEEEhoywwIw}~Q"Q~==@@D&DOOSSXXv^^g$gnnZorp  $B5 0/ /01/1 .9.9 / ##G/</G<2/2**EA6+-+RE/A/676/7/R-8?8W;WiHvc;iw/?iH?IHcI>tvYx[ZYZ[   _V T),)iiV,_riirm#mr#$%%((**+,,N+|NN|OU<U<EXXXX]E]PQ$PQRTRVTYY[[_c_cffgjjglmqmquwwu{{~~ #3BI^j]A[m) t z   5 ?>    =?5=51@1=@FKF)>Sx)=K0ZS=0=Z=2=2LAM`=U=L/Wh`AWT sXIUbobs=IXoxyNz| y\pNx zx]^d9e9rd!!e$%]x'%t)$r^xt11')Q99VVVVBBGGJJcUllllUVqV[[^^``bbcfcfiij=xvvzjz}}   >&&//"". ;0; ;0I/M(;hAI=;A(=R;:;RX;:XMMW>\|pE>;nE\n_gpghokh{dk\Q#{~Q *~ex e#x*Z!l!{#%%''((*Z{//*l{;||||||;|??@@BC]I]BIcKMMRjjRjCYY[[j&5zjk;\{mkKxyxy .   ++&5=:=$5$W&&A_.QpoE.GA:DFD&H0F>_>LNLZH]d ]5GQJ eSE:OeJOdTgwowgPoTVSG|###%#W##PdZ_V'za~a/6~b6cbcp""$i$ip*Ul*WmqsXqt/6KK/KK68|8|lUsWtX@@AADDEFGFEGKLMMLjjTTKYY[[yhhiippqtytyzz~~  q(:Q0_d(%%%++%%%9C<NC9%::NNHIWOWO\+I%1W]\ZW1]bWZ>P>bJJvp{v{JWvW{Wm^vmW&r&_r_^WWW6446x""$m&&$x}//11v3v|S|S:;:>AA;>EE`HH`OOPkknnUUWZcZcde dWrryey||~~P    )<( ' (! H  6)!' 6< '?2?P5M59--N9G=TT@@7FGM=Mi^NBh`sTM7DI`JsFMhDJBMxsKK^IziM xL}$ lflss|333M3s33mCjfs#$>(>(C#j$mQ{w2R{2wQRRL??@@BEHHIMMERRUUurru\\^7 ggjjkppqukuq{{}}   *< 27<>>))  JF JAA7-;7&XVX"&";d+z-d[d+drd7yddddddd;[rdoGorddG ddddd d d )d2dtd#dCdyGd?dy y yy,d]dOdTdUd|{d&|&'(+B+B'y//I4I4778(y;;<=U8=AB^d^^(^^c^IBM<MIRRSSplX\Xu\uu`c`celgkekm*gyyzm|Az| < )F2.V.##GC*00*GEE?,G]]#O>>fThdZjjhZFtUHTTFDK{KH_]Oi_pi Tp-lx-xln/4$n${**+--t/ p5M/5~>~>@\D@HHIqKcgNgWN+IqWvKv\]Dzzz\ghgll]hrrstsxxyy   t%(& &(   ( 3(P(J(2(Q(o( a(fi(dv((m(3''D3(3PJ2j(((((3QF6MOMFo989aOq6{q{R|iuRuT| v QTf^fv`t--`w--}~b  !i$$}~!m+j+,H,1vNLL1::;;@@E]]]E]HKHKMMOOT[T[]]__ddeegiigsszz}*}#7"%%X *#<7< 05 /F)G)503-3"%8/0XNUN\F0\c`cAcIc`XA^  RpI`whc~cQcRyc~mccbv|tcvh k  x  ccl' Q,xl,'~r^ryk|m;##f;BfB++,J,t/u/uSJPPPS=T@@BB_n=oLLNNjjjjnoXZZ\޸]__`acc\X`ass3  0G-..!!;;3A<$ A U<HK3H$M?Fp?1VMR1GR&->R0Y{R&|RRRRRM0R5|5eG>f4e^ SRdSRR4RfdRRRR*R{br#R 4R+R|FR/RR b[!|[qq}C|!~#lDl#~(v(vDCIJIJ13}P1P89389@@A]R]]H]]3]IIJOJOkkTTWWYZwAYwaaZkkuuwyy  w*  2KFV-Y2..))$?4$0:0+ 5 F/%5%7CC;HL7&<<&hLH46>6hr KejeB =E>=BFiEiM`!KLo""Mo`'gG}QxxUS!czg!c%&\'}G//11JJJQ%zUS  Z\G&LGL#RRpYY\p\w``bbeejjkkmttuu{{m   (( ?:#5$5.=$.; L=j H0 20)K)M2'MKHAHA9H'aHoH-9]E4-4]6NCHcH}H6aoQ;zHP[PwHHHQ[C cHH;Hr pr  p } sh*s3}q*^qll^11137zvg: 7gn? ?n:vFw|Fx|I22Sw4Ix4TST==??AAG``Gd`dMyMSSVV\\^^_y~_mms~ws}}  w   ' '(3(,,3:>:>EE&EN33FF373@3!B3D3u3$R$Y&!6Y67U)U@)*`W*Ha`WabH[Ch [bBCi;i;urDjrjzJL|FJ+L#z|##X##X+/f/f]8]ll8t9!9tn~v)~!n?Kz),Iz,..GvKNIy{N{QQ;;ZAABZBIIccMMPPQRWRWXQ]]Xbbclclmmttvwvzz}}w  $''   R% %9669(( N< 9N/"/U-U-&#"9&U8J9Usg#UTLdjs8UjSrusrgU*SYZYu3DTU0__eDsofssohZ*sy,LUdUh0ssse3f:4i:"">ki>4kyqqC+ssCy2I+2445588O<<OX??A\\GGJJnQQRSnSZZ5[\t^z3'^\mRtmt$ ! ),#%%<C.$.$C-  -@>@DEEFTT)#,=:D>F>=9BLB:LV]I]9>fWfV>PWKPUXUKIXqM{HqiinYMn HY!_  ( _(vv`6h`ha6jaj7r;k""|;kAAAA{q7|r/c/>s2b2d99;l;>H[/[[$[[[^HIVcbdIlUVUXZuXZuzzddffghppssuuyyzz  g,h>W. %#&1& =*=00  CC$ I3'<SA*AS(M4@4@M5_+_5^a)+^iFkF38[TnTW\~W~rer\n8kbY  bO-qiO|-s/ i/w|#m? ii.iwq5i#B{t?[kmtB,,-.-11{56N<6<=NXBBDEDGcJKKN=PEcjpppGJNv__bbjvkP prkrp{{%#1 *$</")/i////V/Y/(////@/s/////////4/8/P/Q/Y/I///// //a*/"#/U//// //V/T/c///////k n e Y YOSYY YOm`m(Yyqy~Vw~ w  |  n(&gt&(}tgn.}%Y7h7""==%CssohnC*uF.F.*uRTPRT<<ZFZJcFGGJceePPSSTvzZZ\\vzddeeTlloovv||''!!//99@NKM@@K@@6@!@HMH)N)A;A;2IS`CIC1Q1Qq|DEObDb[7[2Nh^h=@OB@^nLnR}cLcUtr t o%%}R~~VV_--]_6ff!:z=:p&zB&p..`Ys2556Wa6HWY2\Y\L`aHKKLMMkSSUku[[uaUaffllppsvsvzz||    ,, 33 (4%(7898EOO-P7LUP-FVFVEE\/:GG/8Qr;:;NPYPN<YI?e]?JmmP"RnhJ'n"h""Rt'WtXjWjr1Xr1kkx=x}"=@"}w@w],H,uHZu{bMP6{6~8UU_~UZCC8]_]HbdOdOPQoopQY[[Yv^``^cchjkhkqrstrv||tvq j   7%s$9*.#-:)##):==F%#\F#77<2<2++RU'&'EU@EU@eB445B/1J1JUm5mUUn_nUi>i>lU{l{x0UfMUfKUSb3Sudb0Zud3]]weo#w#o'?'?..00K255P78PP2==@B@BDDF}F7McMjjXXyZ[vy[8Z}hhikklloixx}}o$.-%< R1! 1  &4  *4>/5*>_ C+$"$T+UUYT9%9G,GVV:c:xI3MITKEKNmmNcZeJ&OjPO(j&(Tv;v\c\c0c\;;=z'z'+DD+.D.0Lu7L6u67;;<]AA]^bbIJMIMnRR<konoow^wwc||cJ~~jjooprpr   !      " CY2%,("!(1"@#B*3@CE#B!1*C*\3\3>SS)JD>DY)HGP fH?n?G nK=Z`=KZ{{abu&ab$e$f&u~e~/4[[t47h<@YfttJ%*@OY~ ALf`G~uihc*TXt$iikko/ott{{    2 ''% !!.+.+=>=>* & &  <;<@CC?%?@%*O,0@`*TGT,@@UgXgD @:D:QRRQ]_] O_OUG`Ph`"hn n aP"(aO(/Yq/rq/5r55l5y"y"l%%BB++,-,E3~-34z4S~zS;;ZWEZZZZZEFWffFmEmTTsZZswwdd}}mmnopopny{y{     ;'' 2!20GA8X 8.!.ALV0VQ7Q\75(\/A^N5^fbObgO]g]L`h9hA_j`_G~P}G#uP v k#)ivkfl)XqlXr:Wr11qWa=3wwa:c=?|?z''z)H,IHI01)Y1[,=|0=CY[CDGDGHKKMMOOQQSHsV\s\Sx`df`xdfsVxsxyy*   0 /.(N 2*. 2AA*T779*j%%UL+J LJ3*}N^Ng[g3 bbWX[t>_>TXYiYP_ioRou#eTeu)#R]h-c-t1]hPipc;p;&t&((++--H/H2Z2889/==>AZAC>CHHaaKfNNRK9RSSVVq]]qvv||eeiittuvyu{y{v$$$$$ $$$$$ $'$a$W$[$z$h$$$$U+$'$$$ $ $$$%$^:$'$/$ $2$W*,*XG,=$Xf$GaJ.Ja.O4m4Om?Z?UfYfYpQQWZUpgwgwkP)n[knP)jja5\c5\|c|!z!<=~<<hIh)~),,--0I0N6678S_8>7b>_`bKKloSlSVoVXYqv`XY}e}eggqllpprrvv}}      # (%(%: $$4U'.'UGU/ 2=;=+*+;B4?4?Ph=:<b<fxhB x xyyWJHZH1xZ q   Jz9zs{3s[1{1]3w1][9w8EixiEK/^X6]Jloq99AXXXAX`D`MOOjjDp5[=w__`yDMjmjmsuuv{j{||`sv  #2.2! ! G%)'*B)KBB&$1'K$b1%/^W++aXU6UbVFbaV]4d4JSgSdFgE\\Ei}J~c~Ki} l nc(o(^ne*o*f77xf#x#??w''w)*++-.-y.y44)7799:WRWWRBBET``h:Qh*QZETqqXZ\X\`|e|e`iikklmmttuzuz}}l  %%//&  22 >  CDH @3@OSO>1J5C;aJ1;a5D[GFG^F8^=?d58[ewA?gA[gwKj Knss  n  ophoh][-0q0rrqyy~<|~I|( w({<y+,+LyIMN{L,MxxNTRYYZBBFFG_RvGfQfQllTTl_ZZv]^dz]^dffkkppyxy|}~x|~#1}I_b `r  -@J0$Ia$HW#3)S|1=.=@.C@CJ99#dX 1XI%/K%?/K?@_Y7Y755Uj1Ubbp b] WgWCIgDND`NwHH w   \[ qq \`uhohvvrict{8j8it{&'))&j'ssu11336688:T:??BBC^^ea^eaClRlnXRXYYzfuyze}ef }mmssuvn{{v)"  J  (( !!-7.F.-7@F**/#+H9+#HJZN0NZ0U<,GUGj,<;j`E0E;`[  o I\\orKDKTDcrog^g^%a4s'%wToWnp2n332w4h=|Ayy)~*|~=A)*,,-qt-q5LMM5787<<=??=_D_GG_Dff8lQlVVQXXLv^^__ccggjjlmOTkb|wwxx}}l"   22/9 6:6""33C$C1419N.N@9!OOE0o0E;>S``;T[S>@.a hhaBsOphksBFz[AHzIFTIkMH%bM%(W( T|Wt,K\J|8"88"k-((,Du,-.\J0KtLvLv66;P;|=XXZFZ.Fd0KKNdNXP=mmmm mmXy]]wywddo :o ?VP@YGDs  $4.! 33 ))  >E1E ?1A77''V?P/A/A+H+@HVB`^`^2B YhThIT QIQfGZfMrZMrYY DJii !J"!u"[[4t0n~nk}9:ke~4}9:"e"=&s&CC,,--LL445OOSW5WXXBBSFFHHIJMMPPQRSppWSW[wwzzIJQ[Rnnoqqro6K`rpbasm >.   '6'.2!(N$7$(N!KK6/ALD/1ALD1GGUKT6\^\T^U`]]8x?x%pc*hcOy8bOhV)p?% & pV)Y*yYaedesfm"f"%%i''i)-upu-//01J6J067S::<<>>@@)H7HLLPP1kkWWt\\twwccee}h}hrt?.{4{|Kr[ tSXg~|  #979=((=##?22.48583#5K;A;[[DOB*YEQTQBIA4JSGEM]VdDYCUNFGUM]JIS&X%Nz&)[dzdgifq_iq~R<<<%<}%}mZ../^334=uPP4>u/~R=>`mZCCEE`^KKMkOjkMjOZYYZ[[_`_`|cceejjkkttuu#    A @ I W 3"d B v A#"r #* (O CTH5Hx G A$   aXFVD   $D:Da:FVG5X@VF8U8WInLnd<ff_LB<f\&v\N r N&w'ow)o^){--x'ryh{6h4y^6 q q##$|i($|()sp/)Js/JPQO7QP7<<]AABB]HH``KLMMKQQlLlz]]~}}zd~f"+dfvvE3aFe  (5%"+ 2 24!4!  E3;6=0;%+U6*=*DNNDO0'YO'YaC.Cgg.>:>[[:c9cP@P@eyGF{G,y~j~Gi# nnz- p){Xaz-j,,1wh1wh^^  #q<#qk&&',u'||u,-.2-2}99<<UUUBBCCELLEQfQT.tttTwddffhhmmnrnrssyyzz!! 000()6)6+.:9FF+; 0DD;*P$*;$"0G $ 43](04;=b3=P;" [q^Xk^qivgvXgX[b%l Rt ibj% XRjpV wpU5}2U2k5 o "oktglg"**E,|.w.|5,u5SuS@@_D_GGHDLOHOPQRLTP]rQ]__RbbgTghllhvv||}}0;bg  !3$3$  $ ? 8;8>]9>;/+7+8BB76:9;0ZUZU0+-E22EKV:7KVN/;-Z67V [SS[;<ZC<AI{NZ m{FCZ{ I"" m   AZsy s ty tny  n. FZ  y ~ r=$ r=$ ?( ( ) po, p, G0 G0 M~yMyWRR> > B WB C E E H H K K gggggV V W X W X ^ u^ uf f i i r r C t w w y z y ~ ~                    !        H         ;7Z{y%   %   - F / 2 4  /  7  -  A   < 6  <      5 A 6 5 &  ?  ? &     1     1 M P  F  M   4  P  7    U     +  !  U Z  ! Z  7 + Z . Z  .  _ _ Z    ]  @     D  O @ Z      u ] Z D Z  U  F  I   p  |   O Z | Z u Z      o) ) )   ) I Z   u     p Z   Z  |    |     ! " #   % !      C C   %  C #  /   2  2  L 4     L } 4  =    = X   `  X }    "   `   J  /  J K L K  N P  P N  T  V  T   V L    t   t   z z e  z f  e f h  h j  j l  l m m        r             |  |     r        Z        c      2                               $                $                +      5   5   7    >      >     F  ? C  ?   (   &   F 3   6   (  I A  I W   O S  O   5  U X  &  U    3 Z ^  Z   6   Y c  W 8  G 8  G B _ b c  B  Y     b _    H      M  E  w H c n  M c D n  R R   D E c    M  u   z    # [ Q \ Q  z )  w c     `   [   ]  `  ) \  {   ] {     %   i     %  t (  (   * *  , .  . 0  0   3  3 4   d        <  < 4   V     a      ,  H    H I  a        d O      m I  O   m Y  Y [  [ ]  ] ^ `  ` ^  c  c e  e f f  h l      l h      q  q           x  x       |           |                           +              7                    C        $  $    &  "    $ F $ &  A  S  - $   $ ; $   9 $ 2 $ Q $ X   !    C $ ^  "   !   F    -    ? K  ? w $ P  ' P  '   ;   L   / 6   9 6   d $  2 i $  $  /   Q   Q g Z  g  Q      $      J   M J  M   C y W  y W  N    }  Q  w   } N i  t  V ~  V   k   k     d     i   a    p   d  p 5 a  4 r   4   5 !  ! " # " r # s (  ( *  * s   v v G  z G   w   5  5 : { R   R   :   {    ?  ? @   @  \   \   _   _   J J    O  O P P    V    V      q  q      u     g    u          g i  i   k k    q  s  q t  s t   w  w x z  z { }  } {                x                                                           $          /        ,  0 ,  K    )       L     )    3 3    %    A     Z    1 8 %   8    U T  U  1 9 T    9  =   S W  S  B   2   c -  c   4 D C d ~   6 ^  4  C D  d   6 p `  p   j   L  L X  j v 2 W G v ^  \ v  c `   G = T  o v  \  & o B T h & Y h b _  z *  b + Y _ +  |  7  | v  v ~ 7    #   ~  j #  v '  '  v   ,  , r  H r  v  H 3    3  N 5  v 8  8   5  <  < =   =  @ A A  C     H  @  H I I  L  L O    O Q  Q    i   N  W  W   Y Y  u   u ]  t ]    e        e   h  h   l    l n  n       r t  t w    w y  y           C  A  T  W               $  /          r  '         0                                     /   /  0     0      >      4 >   4 ;   ;          -  v                 R    7 T 2  T 7 6 2  )  9   / X   ^ d )  ^ R 6  d  ^ '^ H^ ^ j  ? j X^ v^  ? ^  a B ^ 9^ (^ ^  q q 9 V^ B   a    _^ }^  D \ ^ D M \ M } M  } p M    '  ' p ^ ^ ^ ` |^ ^ u ^ `  u     F     f  < '  m 'E |  x  C m F G    x E 1  G 12  2 7 S  7 }  S |        B  W BD D _ _            g   g       S S      Z Z\ \   w    v v  c ce eg gi i          p  s sp uu   y y          6                                     +  +   ""8%  #8  H # KKFFCH$H  $RI%5HC RI 5%M       H  : d:HdH4 wHo4 ohVV hrHwr[HT}TUH&[LUf  YvL]H(YX v&)X( x)fxf]6bk;b"k6zz;"#$${#j'))lj{G|GM7M|7~<W~<=W= \EEGGHImInPWmnWYYP\\^^_ccdfdf oottwwzz~~ _   %% +1+19+44:8:8//A?A?9CC55((J;K;FQ  FJQK&X}*J&*2XL32De3 D`Z`Z ham[bhbanNxgNvyxgmynMviMj{l'''i'6p r]kO]j6s !S=!}[erlpRs)T}q,HHHHHlOuqRSuT)Y|,G_GkLMLMTTWWXZZtt__aa|~hhkkttvyy||~~+m   "$JLe$**33: 4 F 5;I1Y/8I;408Y0M{b[i>i6f11;ob;[;m<546o7m<NBlBOsPsOQjuPNf%Qu%  },,^znOf^}fn9rn'r'/(*q*HqppwHR44w6RS=n6=XX@XJaSJLQL@Q{VVXbXvvvv vvb{jjkkprrttupwuw"  4;>f F2112/:8:8878-7C?;7EC8?8RUMU;80ljE8Y0Rc9d9RYRIKhdmfzB_B]^ImcRdes W p((((((Kmshm|fm]mW  !^m|x!@'em)@+l+HH334x';;<4ZZE<)EFLFLMMkUUVYYvv^^_ccdedemmnnuuxx| |} 8Rm, #-#  % 626M , %2A*AHAIA55- *::(&(H.>=A\_2IiAjA\1hI.=Jfh7 g@ Jg&>a`wA7f"jkCai$w/skC"Zqs Z o~bv$o8bNbl+vq/p?:b~88r8p$)~l?)vl.G.$rGMN7z7z:@XXV@]]t__ccccyOO{WWXXty{}}}}}}llppzz{{Av6 3,-6 31%%,@3`M/M\M3>&>TMYMgM<5<'5(/\UMTmMYSM[MggM]MU}M`MMSm[SyMM  M   } ]^Z`g ]^ y !##&!y&}nCon+o+,,II|JJ|8 8V~V~AABEBEIIhhCRRVVWXYY\\^^{{ffggmmnnttuuww}}~~WM4X*4*&'()$D$4CFC'7D.M1N7K"'0:)4-(3"%.ZL[Z-1/N[j0L3TjT2Q]oZ5_]`S6HlQZ_ZxH`KM   bhzx;czd aa9beo2l6S5d9h;'kcek'**,,G{2qGq{2556969::>>AACCEEHHNNTTUVUV[[w__aacdd~cllmmwwzz{|}} { %F%7+(M:/<? S($%+%<?<K% K#n#o#h#f#(QWQW343 4i77 in``RoeXYZeZY~~KSP o \))S]jb-n\gj-]bg8s k8":$hf "Cok.$.0s44N0^:>:[E^EFFLaLNNpqpq>__g||||%|<|g#l'lmrrmzz{}}{    #',, #O% $6+G+I@ O OB6O6IOBOcOMOBR#@XT7TCOjOaO7[OwOPjcbOM;OS;CSv``iOvOOOjOZOaxZ x ([%~U(~U|%PP|-wo-ob4e88c$i$(e>(DDn,/,n/11Q447Q7>>AACCFFGGddNNgRRTTY^Y^bb}iikkuuxx}}  %G++&&   ##D:D  ExE?E}EEE!E%!EII7EXEI"`Ey""E|"'S;EgI'ege@EKEELILKtEEUM}EXUnlI~EXEnlVM{)V{P y P)Z|Z\5\c58c _ _8<<f;wf;)w)-C-sOHH5tsO5OtOW??W^aaJJMMOjjVoVorOZrvxvxZiirkkvvw|}w| , $ <!ft"7} :!+6+3 3#S#,*>*,9C$9>B!$CQ"BTKT"K<bDFQ>Fb.D __l;;77  XGjGj f`U`mUaWapWx^RRmpa x^ %t](]%(YY0co/o/tc0rut:ru:=g##gn=-@qEEnXl-sqLz@szLMS99<S<S?C?CEELdeedLhhy^^wy~}~llmmtt~~6""2!2!67K76>> F:.FD7lG7;7 ::O7KPMP@$MDr7JSH\@$SJo7\v7HXGWX W7A YYA;sIsNVVZ{{NIQTZO[T]'[ _kRQR' ]bT*bk*_4r`4y4f5a`5anfy=qini=?'q'z**eUoup|}/h/|cudvw99pU>j>?FFHHwdO}ezchORjRTTYY[[xddnnvvyy{{}~~  &&006-63;=13..A(I;-Q<QEB@EB88@LL::(AISUmb Sm^b ^Jo\ocucijzjGDVGMMV]s]     Nh _NW_Zpwwpsr7r!|7!""?????k,,PK|rKiuP8T<<X8AAXCCK`````KMMNNQQUUXX[[]`]`d}dff}iiUJuz-=++1-  <9:*@ E?@?/1/.69-E:-*.6@#0\&@$3#$D&O -3sWh^BgBhBZ ^O@WaWpHnHnghStSc k"   z je%jm%zm2rssq4llo2b44{b{""cttre|vDvDqt/|/LL 6677::;}>}>@CCFFGHGHkpikTTp[[]]__yyffgmmrrgtww||}~-@Bt*%*1,-0,' '8=883=  -m888888 8I8I#3OUOX8a^8US8D#Jn8+D3+J?4hhA8e 8?Pyk4P8MyoMXsQLx&QsKxNoKN&(oR(.R.  ;v#u%@#v@Cy0%u01V{1zSS<{V<V\D\DEIEIzLOORRnnLYYt\\aa~hhjjkkmoossuuyy%4:.!!-4:.&23&3FG(P;9(;>AkX>$$,*-[,S["5Z*KL55 nnpl ?lSF?rrpqpTMCMqYvvt |}  |  PP] ~~^Tpe8e_{`x__c8xdcd!#{#w%&z))H/%w/H&zKI!xKRRXX??CCHGHGPPmUUVV[[uuuccffiijjppFZpww{{||- 2G9"  ; ;@!8@8$0$711D7D '99""/ 0C'0>R*>RTM`t^M}]TO2Aqq<_ 2`M+IA`xNx`!!!boobI`\oO*N+y--y4\d4`d=##=JgCgo++CCHJ33Q77Q::==XABB^E^EAQiiiQiSUUXXss`_`_ccddggjjlmnlm ,*0,(*8 8 8! 8!`oK 8Z 8"C"2U!82RK!8'P9I!8<JP'9 8)PK^P!8IRJ)!8^!8!86 ^ GGP 8k6khshz@ozP @pP b p[b [Jv$Pav -ey auq y-0eq0 u      <r<% % ' ' * r* , , $pxLL5 5 7 ~7 SSSSSC C E E G ~G fM M Q fQ tX nnX [ t[ c c f f k k p p r r t t x x z z   *(             P           ( (  C          6  6    8 /  /              !  !   J !  9 ! - !  J  : !  J L !   9    -   1 .  1  L  :  2 P  N sN R oR 2   < d  @  @ d  <  e U o 4  V 4  V e d o   U    I >  F  g  h !I >   !i m   g d Y m W  " W  "  i O   !O  ! ! !Y !!x, ! `  !` h d !l j n \ !\ 3 !?  7  s 3 l F d ! !n u ? A  &!!q y A &!  y H   m  H  H  u   9! v K  v T    Q Q 9!Q  T   ?! q  ?! Z B! B!    a     a H!  H! {  L!L!     f w    S!S! U!W! W!X!    \! \!X!  w _!z z  }    { }  k!   _! k!  s!           s!t!u!t!  x!y!       u! y!         x! !   !!!  ! !! ! !! ! 8  ! !  !!!!!! !! ! !!!!!!! !!! !  !  d  m    s  !  !!! !!!!!#!!! !!!!!!6!!3!/!!!!3!.   !! !!!>!!#!!!!>!!!!%!P  %!@!!D!-!!D!4!-!!!!4!!!!!"!!!0! !"!P!0!!P!!!5!  [!C!5!!!C!M!#C#"K#"_#">#"C#D#""""G#""D#"G#"K#N#"""N#""p""V#"!m"""!m""p"V#[#"}""g#"""[#\#]#""_#c#"\#"]#"c#"""}"""g#""j#"j#""""o#"o#r#"""r#s#""s#"#"""x#x#"z#z#"#"#"!"#"!"#""""""#"#'#"#$"#"""""##""##""#"T#"3$"#"#k#"" ##I$"#" #"""#"###"""#<""###"##"#""##-###!#-###!##T""]""##"7"",##"""###,###?##B####"B##A# #^""#A#&##"&#E#%##I###"%#"##"# #"#<#0#S#U#"<#"E##S#I#"U#"##W#"L#W#^##L#0##=#b##`##=##^#"#9###Y#9#a#`#0##5#4##5###F#h#q#t##F##q#Y#a##u###O#O#H#P#u#"#${#Q##P#Q##l"#x"#p#l#${# $p# $#e#e#'#$#$q"+#"+#$2##"+##n#i#n#f#2#$$$#$#$#|#$ $";# $##f###'$#$i#'$v#m#$v##m#,$#,$-$w#y#/$"K###"K#3$##"K#-$w###"N#m#T##T#y#T##T#Z#####Z#/$#d####D$D$###H$#H$I$##N$##d#"g#N$##"j##k#}######U$U$###"s#"s#"s#"s#"s#^$#^$##`$##g$#`$##}##}###g$i$#i$j$j$#q$#"#"#####q$r$##########r$#{$#{$}$#}$"###$#$$###$$#$$##$##$#$$$$##$$##$$#$$$##$####$##$$##$##?###$##$###$###$$#$$$$)$$($$#$#$($$$&$!$$#!$#$$#$#$ $#>$ $0##b##a##H##l##$&$0$$"$$#0$*$$#>$9$#K$$$9$$$"$$$$$$$*$%$?$$K$#$$?$#4##$$h##t##$M$$=$$$J$%%J$$T$$%$&J$[&J$$|&J$I'J$<(J$(J$(J$(J$c)J$(J$)J$'*J$G$4$K+J$$G$$j-J$-J$O$h$s$ $n#$p$s$$p$-J$,J$$,J$ $O$-J$|#$$$~$-J$M$~$-J$=$~$Q$P$T$~$ %$~$%$% %Q$$$%a$%%%%%$~$#3$$~$a$$$~$$~$%$"%$"%$~$$~$'%$%$'%%$+%$+%$~$$~$#I$#I$#I$#I$#I$5%$5%6%$~$V$$%$6%$$~$$V$$$Y$$$Y$$$D%$C%$C%D%$$b$$$b$H%H%$$$k$$$$M%V%$$$$k$M%$$$U%V%Z%$#r$U%$Z%[%^%$$$^%`%$`%b%$b%c%[%$$$c%$j%$k%$$$j%k%l%$$$$o%p%#$o%$$$$$#$$$$$p%$l%$$$$$$$$$$$%$%%$$$%$%%%%$$$$%$$)$$%$%$$ %$$%$$%%%$%%%$$~$$$$%$7%$a%$$$ %$%$%%%$$ %%%%%%%%%%%%%%%%%%%%$%%%%%%%$,%%)%)%$%%$$%%%%-%$%$%%%$%$%$1%4$$h$$,%%P$$$$.%$I%.%%I%%O%3%9%7%-%%%%$9%%$J%%$J%3%$%O%%1%%%W%%%K%W%7%%K%X%$#%A%$L%A%%L%%#%7%Y%a%%%Y%%e%%%:%%%%B%%8%%_% %%F% %]%%B%\%%%F%_%n%N%e%a%%h%}%&h%:%a%%n%8%a%]%a%&%d%%g%& & &~%N%%%~%m%&|%&}%%%(%%%%%(%&%i%/%&&&&%&d%a%|%m%/%|%g%a%&%%%%i%&%%%-&%%m%$D%$D%%%%m%-&$D%P%%2&%%%2&4&%4&6&%6&9&%%P%9&%%%%=&%=&%%?&?&%%%D&%D&$[%I&%$b%$b%I&N&%f%%%%%f%N&%%Q&%Q&S&%S&%%$o%%%%%%%Z&%Z&[&%%x%%%x%%x%%%b&%b&%%e&%e&%%g&h&g&%h&%%%l&m&l&%r&%%%m&%r&s&%%%%x&%s&%x&%%{&%{&|&%%&%&&%%%&%%%%%&%&%%&%&&&%&%%&&%&&%&&&&%&%&$%% &%%% & &%&%&&&&&%&&%%&&&&&%&&&%'&&%&&)&&&%&&&&&%&%&.&&&&&)&&&&&&&&&)&&3&&X%%&"&5&%&&&&%"&&3&&&3&5&%&&H&%B&H&&B&&0&3&&0&&M&3&&M&&&\%%&&8&&8&3&%:&K&Y&%K&:&3&J&%\&3&Y&%d&3&a&J&&a&&&\&&&d&&m%&%&%&%&%&j&i&&&&;&&j&&<&&&;&n&A&w&&@&<&i&'A&'&&&&&M&@&i&&M&L&& '&i& 'L&'f&']&V&']&'&v&'&''f&i&'^&'&''&k&'&'&'&&!'c&&&'c&^&i&C&p&&'''E&&&C&&&''q&F&&&E&%I&&F&%I&%I&&&6'&6'!'&:'y&&&:';';'&='>'?'%[&%[&%[&%[&%[&y&&&&='&?'&I'p&&K'>'&&&z&&&&K'&&&&&\'&&&q&&&&&&&&&&%s&&&\'^'&^'&z&&&%|&&|&3&|&i&|&&|&&|&&&&&j'&j'&&&&&&o'&o'&&&&t'&t'&&v'&&&&y'&&v'&|' &&&&&&'&'y'&&&'&'&'&&'&&&''''&'&'&&'&&&&' ''&&& '|'& '&'&'&''&.&&'&&&'&&"'&'"''%'&'%''&('&''(''''&'''&)'')'')'''''&''&''&'9'''&)''''7''''''5'7')'''2'')'5')'1')'''''A'A'J''''1' ')''''F'L'n&&'F''-')'' 'w&&]'`''']''7'+'*''+'M'D'''-'''M''d''d'_''5'N'l'V&'''V''N''U'v&''U'@'@''k&'V'l'(m'((R'(m'l'(i'h'(W'#'Y'R'l' (i'h'#' (,'''T'''.''T','X'c'(X'(((n'c'.'((p'p''(((n'a'q'W'l'!(a'!("("(w'<'}'r'<'(n's'r'Y'l')(+('+('')(s'&I'&I')'I'l'I''I''I'6('6(''9(~'9(:(:('`<(''Z''?('Z'A(n''''?('&^'~''''w''A('}''g''u'''g'S('''''''S(V('&o'V(&o'''''Z('u'''`('Z('x''`(a('x'''a('''''j('j(m('''m(''''''''''&''''' ''&'''''''''''('(('''''(('''((((''''('(((('(''('''('''''(''''''''''''9''''''''('(((((#((('($(2''''('((J''''1((%((((%('1(('(((((((*''L''(((`''D''(((,('(((*(G(('(-((-((G(''@((*(_''('.((R(((>(R(&(@( (&(''E(.( (E(\(>(](]('((^($(#((^(2(2(';(I(((;((b(0(=(0((b('/((((=(C(K((((c((D(K((C((D(c(K(W(F((W(f(O('(O(()f())q'()o(o(K()~(K( )~( ))c((K( )( ))))p()((Y()())h(((p(()x(_()x()/(\(y(( )y( )'<('<('<('<(#(<((<(H((h(((((q(((0)(q(H(((0)2)(2)(z(P((({({(P(8)(8)9):)|((9)|(:)((((X(D)(X(((X(((D)H)('`(((H)e(((e(((M)(M)((P)(P)Q)((S)S)(r((((((Z)(Z)])((r(])^)^)(((c)e)(e)Q)(((((((((((((((o)o)('((((((((('(((((})(((})(()(((((((()((()))())()((((()())))(()(()))(()))(()()((()()))((((,(()()(()))()(((I(()) (() )())\(())))() )()))( ))()(( )*)()*)())@))())5))(5)))=)%)(=)#)B))#)0((K(((((((((()@))N)$))N))H)E)"))E))F((F)X)B)(Y)X))F)))Y))))C))A))G)_)))T))G)R))`)R)))`)?)j))Y())?)u)l))u))))U)T)_)_()()U)I)[))*[)*!))C)X)V)!) * *{){)g) * *m))W)V) *W)r)g)a))A)X)*m)*z(2)(2)4)))4))) *a)*)*<)r)#*)t)g)k)<)#*)k)&*t)&*'*J)q))*)*s)q)n)s)p)p)J)))|))z))))7*)))7*9*|)9*<*z)))<*\)))))))))\)))F*)F*(])(c)(c)))))()c)N*)N*))Q*)Q*))T*)T*V*)V*))))w))a*)))))*))w)))*)a*))))))()k*)()()))k*l*))l*)))p*s*)p*)s*t*t*)))))))y*))))))y*)))*)))*))))))))*)****)))**)*** *)) *))******)***))))*)*****)*))*))**)*)****)**)))****)),**%))$))*,********)*)8*.*)8***)*.**"))X))_))j))l))g))*C*****************C***E***>*G**>*:*?*$*H**$**):**H*)`*]*I))))e*]**`**C**/*\*P*]**/*=*]*U*]***E**e***E*C**P**=*) *) **I*I*m*h*@*m***h**@***U**J*A*|*]**J*K**+*K*+*+**K*+ +|* +b*S*n)'*)'**'*C*'*]*'**'*-*b*+*o*-**o*n*]*++n*+*c**]*;**f*d*d*;*$+f*)<*)<*$+)<*)<*(+*(+)+*D****B***D****u**)+u*B**L***L*R******8+*R*8+*)V*)V********W*D+***D+E+E+*G+J+*G+*J+%K+O+***i**O+*i***)l*************[+*[+^+*W**^+_+d+***_+***d+e+**e+*i+*i+k+*k+l+**l+*s+*******s+t+****)*****t+*******+*++*++*+*++*+*+*****++*++*+*+**+*++++*+++++*+++*+++'++6++;++ ++V++X++\++S+++*+'++*+++'++**+++*F+++G**?**<+*u++:++=+<+N+++=+>+++j++++6++-+0+*-+r++P++|++\**L+*}+++L++++%+B++%+g++++++;+*'+++++ +++V++'+++Z+Z+`+A**++X+++M+*++M+++\+++S++Q+U++S* ++Q++F+++++u++:++N+++>++++j+c*+,f+,,r+,f+H+,,P+,&+|+T+!+R+&+!+w+w+R++X+m+T+,,m+,}+,a++,a+,r+,,,g+,+,!,o+o+h+!,",",+%,~+%,~+n+(,+(,),b++++9,+++I+++I+*K++K++K+$,K+,K+,K+*O+++++9,:,p++c++++,+++:,+++*^+ ,+*^+*^+*^++c++b++c+++),+O,+++O,++Q,n,+++,++++++p+Q,+y+++p+[,[,++++++y++y++y+o,++y+++f,+f,++i,+i,*+++m,+m,n,o,++*+++t,+t,u,u,+++y,+y,z,++|,++++z,+,+|,+,,+,+,,+,+++,++++,,+,+ ,,+++++++++,+,+++,, ,,,,+,+,+,,,+ ,,,,, ,,,++ ,,+0++B++,+,+,,++,,,,,,,$,,,,,$,W,$,, ,,,, ,/,T,$,,<, ,,, ,,@,,3,',,`++*,$,*++,3,X,$,F,C,=,$,,F,U,$,,S,.,,,<,/,p,$,U++@,/,,S,,,Y,,,4,Y,.,,q,$,4,],,H++,W,,,T,,,,*,,X,,;,\,,,;,6,l,,6,,,M,,,=,,b,E,,b,,,,,U,+,,,p,,L,r,,q,,,,,-L,,,-h+,n+", -},,,`,,+,, --,,,V,V,+,},r,,-,,,-,---,-,--`,---, -, -!-"-,,s,?,>,w,?,v,,>,"-h,)---,M,l,w,s,--.-.-,)-v,,,,,,,h,,R,,v,,,R,9-,,<-{,<-9-,@-,@-,,,,C-{,,J-,,,,,,,C-,J-K-K-,!-,,,,,,,+o,+o,+o,[-,,o,+u,[-\-\-,_-,_-,,b-,b-d-,d-,,,~,,,i-,i-j-,,~,,,,p-,p-q-q-,,,u-,u-v-,,{-, ,,v-,{--,,,,,--,,,,-,--,-,,-,,-,-,,,,-,-,,,--,-,,---,,,,--,,,,,-,,/,,',,C,,.,,],, - -- -----,-- -,&---,,-'-'-*--,,-*-,-,-1-,-,, -,--- -/-,-,-,-,-1----,---#-#-/---2-:--:--2-%-0-----0--%---\,,4-8-l,,---F-(--F---+-+--E,,-4-7-N-;-I--G-W---G--&-r,,-6--7--M-T-(--6-3--;--M----5--g-g-c---N--k-R-W--5->-]->--k-3--I---D-o-.]-c--R--..D-.$-}-H-x- .H- .x-$-=-t-}--O-~-..O-.y-t--y--,.-h--...h-..-..^--e-$.--e-^----~-=-$.--,@-B---B-l----E-l----E-0.-0.,K-,K-5.---5.6.6.w-w--;.-;.--=.=.-a--@.@.--------a--a---I.,d-M.-I.-M.m--,j-,j-,j--m---U.U.-,q-,q-,q-Z.--Z.-]._.-_.-z-b.-b.].-------h.----,-z----,-h.---,-------u.u.-,--- -- --&--------6/---A/-b/-/-0-.-4- 5-.--5-.-...6-=5---%6-6--.7-9- :-:-;--.=->-9?-P@-cA-.-A--.--%.-A-A-:--0---..%.B-..[B-B-B-B-8--D-D--*....-uE-LF-F-..8.-.8.,...!....!..'..&..H...H...'....T--.B...K.>----.-).-x.-.-K.D....P.--&..P..L.-[.L..[..Y.)./.)..Y.o-.../. .+.+.`.`..E..7. ..N.7..N.j.E..j.<..S.<..S..Q.x....a.e-..Q.a.x./l./.g.R.. /X. /X.R.l.x.T../V..///T././V./c./\../-5./\./e....-;.c..n../n.&/e.&/..)/.)/v..C.v.m.C..m.././...2/.2/t..5/t.5/6/.{.g.x.;/.;/.W...^....@/A/......W...^.I/.@/.I/.d.L/.L/T/...i..d.......i.T/..V/V/...Y/..[/_/.[/.Y/._/a/.a/b/..f/...f/~...~...k/.k/....n/......r/..u/.u/..n/.....z/..~/...~/..r/...z/...../////./..../..//..//./.../.*.././ /./,..//.... //...//.../././/......////////0/. //B..*/ //*/D../n/7//+///+/!////.7/'///./!////'///"/"/8/0//9/N////7//9/:/N//:/>/N//>//N////3/N//=/N//3//.=//c/0000>0//*0020/0*000 0/)0?0/0/ 0?000A00#0C0 0H0/#0000 00%0/H0//@0@0B0/W0]//+0%00+0S0:000S0J//0c0:0/0Y0J0000Y00j00A0G0k00G000\000V00[0 0I0[0\0D00Z00W0B0x/0w/0/0 0s0z0Z00I00z01111K0 1T0s001L00010 1/$010101x01041011d0101/101011s0L0010B10#1m010#1G10/=0/=0L10C10K00+10+1T00-1x0001001106101010617181d0010001010810D10m0010+2000D1F10F100/a071000P100000P1l0000S10l000S10r000r00000-10/v000a10a100/~0/~000j1000j1l10l1/00022020\3030/0w1000w100z10z1{100}10000{1011}101100010000001110111110 100 1000010001110(00011110001001110110010000 10$1 111$111"1 11"10 10100 1011C0011:1%101B001411 111%101:111101;10>1;11>11 111J111J1J001111111B1k001111D0091*111910G1T1Q11T1111Q101L11(1V11G11L11(101010101011K1Y11n11K1n1U111L1X1111L1Y11Z1X1?1[11Z1U112?122C12212M1x12 212M1 2&11.11q1&1b1q1,1b111211,12c1k12k1.121c11.1g1p1p1212g1!211111<11 2!2 21'211h1111<1'2h1@111*211,2-2*21@111x111|1N1N111|1:21-21,21:2111W1W11?21?211A211111]1E2G21G2J2111J2i11L2M21i1A211i1L21E2111]11111111^21M21t111t111^211`2`21c21c211f21f211h2i211l21l211n2o2i21s2101s2h21n2111x21x211z2{2}21}211111111111121o21221211211221222122z211211112122 11222 22221121222{212211111 22 221222222+22"211 2222222 222222 29222925222"2 22*11@222F222222C2;22C22222U222V11.222.227222252222@22Q2T2|2222Q222F222221U2[11p222222222222S21222222222d2S2x122522d222222/2/2a22222a2 22722j2V222u22j22222|2D2q22D23g233g2q2k2X23k2 2U21!21!2e2r21!2 3Y22 3e2u2V232p21-23Y21-21-21-23232323_2622_28223~2b2b282#32#3H223~2(322m2(3K2222+32v2y2H2221J21J21J22y22K21J2R229322R262293+3222Z2222>32Z2[22222[2>32D322H32D32H3J32J3L32L3M322P32P3R32R3S31n222V3[32M321s2V32[3]32]32t2e32221{2222222e322l32222222S32l3222222s3222s3t3t3222222222222222 2222 2222t222222 323222323$32 321232222233233233232333233 3323232322323232222333"3333;222232222$33232333 322 3 3 33 3333 33T223 3333%3333:3%33:333E333B3333333333O33T3=3B3E32Q3=3232I3!3433V223T3O3\3383Q3\33!3q22U3X3X223U3r22<334323?333I3\3?3<383\3C3\33C3F3W3X333F333c33c3G33v333a3f3v3\34a3Y3\3K3N343K34 4`3m2#32#3v2#3 4`3\3g3\34g34u3\34^3.34u3,333,3w3\33^34Y333y3\34344@33.3u33h34w33@3x33(4(4x33~3Z33o33/4o32D3/4041454304y33{35474}37414y32S3}333333_33333Z3B43B4G432]33_333G4H4H433333i33M4333i333333333q33\43333q333M4333\4]4]43_433a4_43e43a43e4h4343h433k43k43333p4333p4q4q4333u43u4333333333333334343333333343343434334443"33443433444433344433334 434 43343443%3343E33334444$4$4#444 4 4#443!44)4)43444!4#4334344444'444,44:44343:424"4'4#443,4#442443!434I4>4"434I4444J4W33G334#444!4>434Q4433Q4J44A4=4K4=44#4Q4#44A44R4344K44R4`4N44N33f334`4344N444L44c4;44L4=448484;44c494b4O494444j44b44?4w444?44x4j4P4v44l44S4v4h3455t4~345V 5t4l4 5 5^4^4T45S44T4x4w45455{31455455r455f4@44r44|4s4f44$5|4$5'54s4@4'5*5444*5-543B4-53H444254442545445754447595z495:544<5Z44:5444z444Z44Z444443_4445444J544<54m443h44444444m44n44444n443q4[54J54[5]54]5^5^5444a5a5444e54e5f544f54j54j544n5444n534q54q5r5s5r54s5444w5x544344434#44=44O44P44w4444w5454534445455445445x54545 555 544555544444444445455555545554554445 5454 5445 5 5&554545555555&554554&54455554554!55&555555545540545&5!55 5055E554555 5545E5555&55,555555R5553554Q5S5W55S5,5_5555_55`5c5N55T5W545c55T5;55U55T4 54 54 54 55 55 5v5M5R5_535_5Q5_55v55;55V5M5h5D5`5_5"5h54545y5l5g5M56d556y5666g5l5"5U5N56d5u5M56{5%56p56V5%5u54-5p5{56.55555.5554456566566495|55$6|55=5$6%6k5m5C5k55m55C55C5o55,6,6o555551651636536465596546596:6:65>65>6@65@6A6B6C6A65B6555554a54a555C65N65N6O6R654j5R6S6O6555S65555555^654w5^6}5555555555555}555i6l65i65l645p6555p655555555v65v65555z65z6{6~6545~665565555555655566545&55_55N55M555565655{656665666555 665 65556666655566566665665556666666#6.66666.66.6"6.6?6.66#6)6.66D6.6 66P6.676.6e6.666.6c6.6\6.65666q6.65 66<6<6 666J66E6.6=666=6665J6666'656 656'66565x6.66"6666?6k6.6j6.6D556)65566D666f6.66P66766.666e66w6.666666c666c666\6666q666x666k66H6b6b666E66H6y666j6`6y67`677I6r67I6m5%65%65%65%65%67j677j67777f677676]6766}676766 77j6 766;6&7665B65B65B65B6&76;66.707w607t66.766657t657|6677:7666:7;777|66666_66;7666F766_666F766K766666K7L7O7666O766S766m6S7T7L7666T766666^7666^7666666f76665666f766666666k7m6666k76p76p7q7q766666w7666w7y76y7z766|7z76|76766766656.66667676>7666676666777767 77677767 7 776767677776666677667677676 777767 76777677766176717776676777766-776677-767 7777>7<7>77>7678737627 777877767=7,77976=727737677<7767?767777"7>777"77!7V7A7>797?7V76@7,77@77!7W7>776A77W77Y7J77U7J777Y7777b77C77r677m7 7_7X7 777l7m7X77U7>7[7Z77[77}67]67_7C767b7H7l7H7v7H7]7H78v77H77H787P7%77\7%7877\7887b78888`78]7`777{7878867765787}7e7"86;7r77%8'87'8"8}78v7+87+8%8r7-848n77I7-878v7776K748I77Q777Q7n77776T7777777777777D87D87777J877777J8K8M87M8K87O8Q87Q8R8U8777U8 87Y87R87Y8[87[87777776z76z7877787877777)87!877777n87n887O8777s87s8187787<87F8777z87z877777777887777777 7787888787877777787887778778 8887778878888888787888788888788)88878878)8,777.88/82888/885888!88888;888;88881808688888088<887F887888888788H7777f878787F97818838,8V88Z77Z8V88,87Z858288X8E8E878a838f8B8f88X8j8f8P78^88i8^88i888B88W8f88j888W878{788a8V889=8\8f8=8p89e788\8q8f878|8f898f88f8S888f88f8(8S8]8P8P8(8999q899\898|8_8e899]899|89_8o8f8}8f89q8e898#988f8#9$9&98&9(98(9)9L88H8o8)98u8H88u8t8L849r8r8t84969}869~888989~88888=98=97Y87Y87Y87Y8`88b88D988D98G9G988`88b88888P9888P9Q988Q98T9W98$98W9T9888Z988Z98v888v888{888{8e9888e988g988i9j9l98l9g98j98o988i9888888888x98x9y9z9o98y98888878z989898888888888898888899999988998898.882889998'989999989889989996889999989999%99999999V888898 99989 998,9,98899899 989+98'9+9 9*9F9999F99*999@9F99@9999@99N9K98N99989I999-9F99I99990989-9.9F99M9p888/99.99/9F99J9J9F9999M909893929939d9R99d99;9h99;999u9u9R99n999H9>9n99>99S9k9::\9\9w9:S9::::[9 ::Y9V9|9H9R9 :Y9U9:O99U9::9:::`9 :V9:99`99~9{9869O9w986979~999979#:9#:%:9%:&:&:9):9):9q9+:+:98G98G92:r92:999{9[9w9}99::<:9<:::}9:9]9999A:r999]99999a999a999A:9L:999L:M:N:N:9S:999M:9S:9999W:9W:Y:9Y:Z:9999Z:9^:99`:`:9d:999d:99999999^:999p:999p:q:99q:9999999999999}:99}:999:9:9999999999::999899:::99:%99999 ::89:9:999 : :9::999 :999: ::9:::9":::9::9::'::::99::9:9::9(:99:(:9:9K99:9":9::.::::::::9>:,:9:$:$:,:::F::=::J:I:9=::J:I:9::299R99:@:k99w99:1::::::R:h99::3::':"::/:::-:T:::P::*::7:6::7:::H:::-:U9 :9 :9 :: :9 :": :H:6:>:o:]:f:|9:F:o:@:o::]::1:o:{9:;t::o:;;K:u:;;R:o:;K:;U:O:{:3:o: ;O: ;/:o:*:o:q9)::r:P:o:;t:;:;::;:;92:;~:;;: ;:t:o:; ;U:o:~:o:e::$;$;e:h::B:h:w:B:|:w::o:-;|:-;.;::.;:Q:::x:4;:4;::x:Q:V::;;:9S:9S:;;<;:V:[::::<;::[:::9^:::H;:H;::9d:::::N;:N;O;::::O;:S;T;T;:S;:::::];:::];_;:_;:z:::c;:c;e;:e;h;:::h;j;:j;::::::z::p;:p;q;::q;:::::::::y;z;y;:::;: ::;::::z;:::;;;::::;:::;:::::;:;;9:o::::::::::::;:::::;:.::::;;:::;;;:;;;(;;::;;;;#;;;7;#;;:;:;:P;:X;:=;:;^;:n;:;;7;;;;;5;+;;5;;:;;A;;;;T:::F;;3;F;;;6::;;;f::;;;#;(;;;P;;;?;E;;?;;;:;6;3;:;;>;>;B;;C;L;;;C;;X;;u:;;d;;8;V;;{:;r:;d;:;;:;8;V;;;P;;^;;6;E;;=;f;D;;;n;;;f;;m;;<I;<<g;<<<m;;: ;: ;I;;g;;;l;r;;<r;<;<<g;;;<r;W;`;<W;<<s;;<<s;<9;;{;;;9;k;;!<!<k;'<{;<r;;;'<(<)<(<o;o;|;)<{;;};;;;;;;;;Q;;:O;;;7<;Q;7<;:T;;;=<;=<;;;;;;E<;F<;E<F<;a;a;;;;K<i;;K<;;;;i;P<;;t;;U<;P<;U<V<V<;Y<;Y<;t;[<;;[<;;;_<:z;c<;:z;c<_<;;;;;;;;;i<k<;k<m<;m<i<;;;;;;;;;u<;u<;;:;;;;;;;{<|<{<;|<;<;;;;;;;;<;<<;<<;<;;<;<;;;;<<;;<;;;:;;;*<;W<;<;<;<;;;;;;;;;<#;;+;;<<A;;<<<;<#<<;;<;<#<<<$<;*<;*<<<<<1<;*<;*<;*<<*<<<;*<<<<;E;;B;;L;;;*<$<*<;*<<*<<<*<:<&<<:<J<*<O<*<<G<I<<:;;<G<<<<<<<<<O<<J<<$<<<M<<<D;;"<Z<<M<*<<R<<"<R<*<8<W<<8<<<+<+<\<Q<W<<]<,<l;<`;<h<W<<]<<<W< <?<L< <<<W<X<L<N<t<<N<<<X<?<\<l<r<<<l<<<;<S<w<x<W<<Q<~<<=~<<W<=}<<<h<s<}<<S< =s< = =<T<=|;'< =h<};)<<W<T</<=<`<^<<<=</<`<==<=y<<"=y<"=$=<$=%=%=j<<<j<v<*=<*=-=<<<-=.=/=2=<.=<2=/=x<5=<5=<<a<<>=<<<<<b<<<<<<>=;Y<<<<<;Y<D=<D=d<<<a<<b<;c<<d<g<<<<<g<<<P=<P=Q=Q=<;m<V=<;m<V=W=W=<[=<<<[=<<z<<`=<<z<`=<<<<f=<;<g=<f=g=<<i=<<k=<<<<<<<<<<<<<<k=<i=<y=<y=<<|=<|=}=}=<=<<==<====<=<==========<<<=<=<==<= ====1<< =<=<<<<<==<<<<=<==<=====<&<<='==I<<==<!==='=!=====!===<====7=====#=====!=Z<<=====3========3=\<<t<<=1==r<<,<<=J==!==(=I=====#=7=6====7==6==(===;==7==1=3===?==w<<+=_==<<=X=?=)===+==4==J=3==q=T=^< =< =< =v< =< =G=n=\=n==G=;====q==X=_==I=b=t=~==t===b=>~=>>\=> >d= > >d==,=Z==&==U===>U=,= >=&==^=Y=>^=>u==4=_=>u=>>a=>>=> > >=a==#>==&>w=&>==*>z=#>=*>->===->=r=0>=0>==3>=3>v==5>5>v===c==9>9>==>==>====<[=<[=Z==e=======c======e===w==<i=z==m===m=W>===W>X>X>=\>=\>^>=^>a>=<y=a>b>b>=d><===<=====k>=k>====o>=o>==s>===s>==d>=w>=w><=<=====}>=}>==>=>========== >=1>===!==7==3==I=====>===>>=>==>=>=>>=>=>>=>>>>>>>>>>>>!>>>!>>>>> >>>>>>=>>=>>/>/>=>=>>=>>1>>>>>6>>>>4>>>>>>> >)==_==n====>7>>>>>8>6>?>>B>:>G>>>>G>>>>>:>T==>==Z>2>>4>?>>Z>>>>Y>>>+>Y>;>+>[>>C>?C>>N>>?>>C>;>>;>>S>N>[>>>n>>>h>?C>?C>>Y=>=>=>?>>;>>>>7>?>8>?>i>I>B>?>?i>?=>=>r=>=>=>T>H>?T>? ?O>S>[>O>V> ?n>[>f>>?f>??Q>??h>[>??{>??>>j>{>]>???x>?x>p>Q>>z>>$?z>$?&?>&?'?'?>)?~>>>>>>.?~>.?0?>0?1?1?>4?>4?5?5?|>|>>9?;?>;?>>>>>>@?>@?>>C?>C?D?>>G?>G?D?>=d>=d>=d>=d>>>Q?>Q?R?>>T?R?>V?T?>X?[?>>>[?V?>^?>^?)?>>>>>c?c?>>>g?>g?h?>>>>>>>>>>h?>>>p?>>p?>>>t?u?>>X?>>>>>>>=>>>>>>>>>?>>>u?>??>???>???>t?>>>??>>>>??>>>>=>>>????>? ???>?>??>>>???>??>?>>??????>?"??>?>>>>??>>?>?G>>? ???2>>??>>?!? ???"???!??>?3?:??3??[>>I>>H>>V>>>>??>??????U???????U?>%?%?W??Y?=?W?>?8???I?=?>8????Y???Z???I?????j??B?f?A?7?Z???E? ??i??B???N?N?v???]>?j>??B? ?A?i?E?S?H?p>?@S??\?>?@ @`?`?J? @?J? @]?? @j?f? @`?@?@@~?@??@?@ @]?@@??\?f?@?>4?>9?>9??9???9?f?9??9??f??f?@???)@>D?~?l?,@)@?,@?1@?1@?y?4@?4@??6@6@?:@?:@;@<@=@;@?????<@???C@=@?C@???>^?????K@?K@L@L@???O@P@Q@O@?Q@?????>t?\@???\@??_@?_@b@???b@e@???e@??g@??i@??k@g@?m@k@?p@?p@>? ??i@?v@?v@w@??w@?|@???|@@?m@?@@?@@@?@>??@??@?@@??????@@@???@@@??@@?@@??@@@@@@@?@@?@@@ ??@@@@@?@?:??@@%@@@@@@?@@?@@@@?@@-@@6??@-@0@@@@0@@@@@.@0@@%@@@?@0@@@R@0@J@0@ @7@@.@@ @@@@@!@?@I@@?@T@0@@?@I@!@7??@v???J@?@??@H@?@R@W@H@@W@H??@J??@T@@@F@@c@@F@0@h@0@2@@c@2@@h@@@U@@@@D@@X@@? @Z@G@U@n@D@n@@G@l?@?@?@AZ@AA@?@AX@n@t@]@At@}@n@Aa@@ Aa@ A(@}@S@(@As@As@S@Aj@AY@@AY@Ay?1@?1@?1@?1@?1@j@n@@l@A@n@A@@n@{@@%A{@%A&A&A@o@@)A+A@+A@@-A.A)Ao@-A@@M@@@?P@0@P@n@P@@P@@P@=A@=A.A@M@@GA@?\@?\@@\@@\@%@\@GAIA@IA@@KAKA@OA@@@OAPA@@@@UA@PA@UAWA@WA@@@@ZAZA@^A@^A@@aA@aAbAcA@@eA@@bA@jA@@@jA@@@@@@pA@@@pA@@@@@@@@@@eA@xA@xAyAyA@@@}A@}A~AA@@~A@A@@@@@A@A@AAA@A@@@@A@A@AAA@AA@@@A@@A@A@A@@A@AAA@@ A7@@A@A@AAA@AA@AAAAAAAA@AAAA@A@@AAAAAA A@AA AA5AAAA,A@AA'A5A;AA,A;A@/AAA3AAA3AAAAAAA(AA*AAAAADAJAADAACAFAA@@AG@@FA@]@@ACA@@'A;AAJA/A;AA;AAA(A;AHA\AAHA@AdAA@A*A;AAA0A>A_A1AA_AA0AAABABAqAAAkAsASAA;A@AAsAl@AA@AAhAAgAiAhAzAA]ABSAABgABAvAzAB BvA B B BA@&ABABBBBmA{AA{ABABmABB!BfABAAABABA{ABmAfAA!BAzAkAqA&BA&BAA(B(BAAzAAA-B-BA0BA0BAA2BNA|A@OAANAAMA2BAMAAAA@UAAAAA@UA|AA`AAGBA@^AAAAAA`AGB@cA@cAAcAAA@cA@jA@jA@jA@jAUBAUBAAXBAXBYBAA[BAAYBAaBA`BA`BaBAAAAAAAAgBAgBhBhBAAAAAnBAAAnBpBApBAAsBAsBuBAuBvBAA@AAAvBAAAAAAAAAAAAAAAAAAAAABA AABBAABABAB@ABAABBABBABBAA@ABABBBAA@A;AA>AAqAAzAA{AAABBBBAABABBBBBBBABBABBBBABB BBBB4BBB4BB_BJAAB8B\AAdAAB8BB'BBPBBbBBSBBBBMBBBBBB'BB8BABB'BB8BBBBB1AAB8BBFBLBBFBBB:B:B)BBBBPBBB*BVBBB*BBBbBBB%BB8BBiAA]ABBbB%BfBBBSBBBMBBBB]BBZB;B"BZB>B^B]BqBBPBB>BBBqBBqBoBDBBqBAB;BBBqBABABABABABBqB^B"B CoBBPB CBqBBqBA&BB]BBqBBqBB]BBqBBqBBBBqBCBBqBCCBCBBBqB!CBqBCqBBrBrB?B!CBKBBBBBqB?BB CqBBCqB^CqBcCqBBKBBB3C3CB6CB6CB|B8C8CBBBCB>CGCBA[BA[BA[BA[BB[BA[BAaBGCHCdBBAaBBdBBeBBBBBPCBPCeBBRCtBBWCBBBRCBWCXCBtB[CB[CBwBXCBwBBByB`C`CBBBBByBBgCBgCBBBBlCBBBlCnCBnCHCBpCqCrCsCtCpCBBBBBBB|CBABAB|CBBBB BBBBBBCBCCBBCBCCBBCCCBCqCBBBCBBCBCrCBCBCC CCBCCCBBBBqBBvCBCBCBCDBCCsCB CBtCBBCCCBBCBBBCBBBCCLBBCC)BBCC CCCCC CCCCC0CCC.C0CCBC$CC0C$CCCBCVBBC.CCCCCCCfBBC?CCBECC C?C0CC*CCCCCCCCB;C;C@CEC0C&CUCC&CC]CZC*CBCBCDBBBBACBUCBC]C_CACC_CCCBCbCC4CbCC4CCC0CDCCC9CCCC^CuCOC9CDC\CCCcCCuCaC\CCCOCCCCaCCeCfCQCeCvCDDTCDDDkCCFCTCwCDCZCFCvCkCvCDfCCvCDCDDzCzCCDDCCDC2CCC1C~C2C|B6CDkCB6CmC~CD1CCDmC#DC#D%DC%DCvCCCxCCCvCCC.DC.D0DxC0D1D3DC3D4DCCCC1DCCC:D4DC:DCCCCCCYCCCCCCCYCCCCCCMDCKDCKDCCMDCCPDCPDCCSDCSDVDCCCVDCCYDCYD]DCBtCCC]D^D^DC}CCdDCC}CCCdDCCiDCCCCCiDjDBCjDCBCBCCCBCCCuDCuDwDCwDCCyDCCBCyDC~DC~DCC CCDCDCCCCCCCCCCCCCCDCDCCCCDCCCDCCDDDD DDDDDD DCDDDDC0CC@CCD DZCCDDDD D DCDCDCDDDDD DD DDCC DCCD D$DCC DCDD=DCCCDCCCDDDCCDC=DC8D DCD DDD8D DD DDD DC9DCDDD@DCDD9DD@DDDDDDDDDDD;DDD;D!DNDD!DDCDD?DCDD(DDCQDQDWD(DNDQCCEDCwCCDDnDnDADODCDDODDDDTDCDADDeDDEXDeDEXDDD&DDvDD)DvDDODD&DD)D|DDDDZDDE2D|DEEDEDDzDzD2DEZDC4DC4DxDDEEDDExD$EDDD$E%E%ED(EgD(EDDgDDoDD.ED.E0EoD0E1ECMDCMD1EDDDDDCMDUDDDD`DDDUD=ED=E>E?E>ED?EDDDDDDDbDDD`DDbDKEDDDKENEDDDNECjDCjDREDRESEDDVEDVEDDDDZEZEDSED]E_ED_E`EDDDD`EDDD]EDiEDDDiEDDmEDmEDDDDDDrEDrEtEDtEuEDDwEDDEDDDDDDDwEDDDDDDDDDEEDEEEDEEDCDEEEDEED$DDEDDEDD EDDEDDDDD E EDDDDDDEEEEEEDE EE&EDDDD&EEEEDEE EEEDE EDDE E*E EDDEEEEEEDDNDDDD4E E@E;EWDDEDEE@EE*EEE4EEE EkE EPE E;EDED"EAECEvE ECED"E)E[DDEAEEE/EEEE/E2EWEEE2EEDEFE>DDDDDDDDDDDDDDEOEDGEOEEGEEdEMEEdEEEEEEEeEE4EeEYEEEkEE4EE EEEYE EEEPEEEEvEHEBExEEIExEEjE}EFjEEHEFUE}EDEFUEyE}EFEIE,EED%EEaE'EyEFaE'EhE{EFhEFsEsE}E{E,EbE}EFFFFFbE^E}EFEF^EEE!FE!F#FE#FEE&FE&F'FEE*FE*FEkE.FE'F|E.F2FEEEE}E2F3FEE3FE8FE8FEEEE;FFFFwFyFFFFwF^FfFF^FFFiFAFKFFMFFFKFGTFKFZFcFSFMF GbFF GZFE#F]FFGSF-FTFGbFFrFGcF-FG]FG}FxFG}FFrFGGG_FGGFFGFGFGFGFIF_FkFFkFFkF'IFFBFFkFhJFEFFiJFCKFELFELFELFFFELFELFWFF>GFKFKFKFFWFLF>GFFvKFKF`FFLFF`FFGGGHGGGFKFFFKFFGFFFFFFFBFFHGFsFFLF,MF6OFJOF#PFFsFqGFPFE|FE|FFFEFFF0FF4FFAFF>FFFFFFFFpGqGpGFuGFFFuGFFwGxGFFFFwGFFFFFFFGFxGFGFFGFGEFGFGFGGFGGFFFFGFEFGFGGFFGFGGGGGGGGFGFFGGGGGGGGGGGGFGGGGGG GGGG$GFG#GFGCFF5FF G$GFG2G#GG GG"G#GF2GGFF,G:G8GGG8GFG:GGG"G,GGGG+GGGGIG+G%FFG+GGIGGGGG=FFGCGGG%GGCG#G&G!GGDFFfFFFFGxFF!GF%G.GG&GF%GyFF-G.GDG.GGDGGG-GhGgGGGhGGKGGGkG]G GkGcG GBGcG GBGAG GJGAGG_GdGG_GGGJGGlGGGlGdGkFGFGGG#GG.GGgGG{GLG^GvGGLGGLG'G{GrGLGKGgGGLGvG'G)G^GG)GGGG'GHGGHG/GGGsGHGsG/GHyG1GHGyGHG"HG1GG"HGjG$HIILI9I>I*I+I!IJI8II+IJJ-J*J]J*J>JIJJ:J\J*JOII)J.JJJ)JI-JGJ9JaII[JJJI?J*JIGJNJ*JYJ*JJ[J9JIJJ]JnJ*JJJ\JJ3J*JI?J2JIJJ*JJJNJJJAJAJ2JJYJJJnJJJJ3JJLJqJJJWJJJJJJLJJsJJJ`JJeIJIJIJKjJKKvJKKKTJWJqJsJqJvJJTJJKeJeJJKKJKJJKJK`JqJKKmJJ}I1JI1JKKwJjJqJKyJJJJoJ"KJ"KwJJpJJKmJ(KpJ(KJJ*K,KxJ,K-KxJJ*KJ-KJ2KJ2KJJJJJJ6KJQJyJJISJ>KJQJJ6KJJJ>K?KIZJ?KJIZJCKEKJEKFKtJJJJuJJJJJJFKJJJJJIiJ*JiJqJiJJiJJiJJtJIrJJuJJJ_KJ_K`K`KJJJJJJJJJJJJJJJmKJJJmKnKJJrKJrKJJnKJJJJJJJ}KJJJJJJJJJ}KJJIJJJJJJJKJKJJKKKKJJJJKKJKJKKKKJJKKKKKKJJKJ KJKJJKJKJ KJJKJJKJKKKKJJJIJJKK!K.JJK KKKKJJKKJK K)KJJ)KKKKK KJ3K KKK3KK#KJKKJK7KKKK/K8K5K8KK/KK8KK7KKTK8KK5K KKKJKHKGKGKJIKJJHKKAK@KKAK!KKK@KJJTKKKK.KKKKJKIKKJK.KJNK8K^K8KiKMKKiKK9K4K KNK4K KbKWKKbKKK^KK9KWKKPK8KLKKKaKKVK[K KVKlKcKaKLKKPKLlKoJKJKLwKkK[KKLwKcK KL L L~K~KoKKeKKeKLKL+KKKjKdKKjK+K1KKLdKLJ2KK1KLKKLBKKKfKLKsKfKK;K;KKKhKhKBKJCKJCKJCKJCKKCKKCK/LsK/L|KK3L|KKK3LuKKOKuKKOK8L{K8L;LK{KK;LKRKRKKKKXKKKXKKKCLKKgKKFLKKKKCLKKKFLKNLKKgKNLPLKPLKKKKSLKKqKKKqKpKKxKKKpKKKSLKKvKKKKxKKKeLKeLKKgLKKKKKKKKgLKmLmLKKKKKKKsLKsLKKKKwLKwLKKKKKKKKKKJKKKKKLKKKKKKKKKLLLKLLKKLLKKKLKKLLKLKKKKKKKLKJKLKKLLL#KKKKLLLLKLKLLKKKLKKKKLLK8KKkKKoKKeKK(LLL(LLLK.LL-LKKLL.LLLLL LKLLLLLGLL>L'L4LLKL#LLLLRLLTLKGLKL!LKQLQL?L^LTLK^L&LJLJLKL5LK!L4L7L?LL&LWL5LLWL1LDLLDLLLL?LL1LL7LVL?LLLLL@LLRL4LL9LLhLLkLLhL@LKQLXLLOLLYLOL9LXLfKLKLKLMYLKLMHLkL$LHL|LfL M|L M MVL MfL$LULtLdLuLMdLMuL)L)LULLL2LL`L2LrL2LL`LK3L6LLMM}LL6L}LLLL!MjLrL:LjLL:LLL'ML'M(M!MLvLL(MvLד,MILLyLILLIL0MLxLLILLxLLxL0MLKPLLyLZL~L;MLLL;MMLMMLLLLMMLMDMLM^MLML\MLL MLLLLLLMLMMMMMLMMMLMMMMMMMMMMMMM4LL?LLtLLLLLLLL#LLLMM)MMLML2MM)MM"MLL"MMLMMM&MMLM%ML&M%MM=MMMMMMM9M M MLLMM9MMM:MMMLMM+M MM+MMMMMMMMMMMM>MMDMMM1M2MMM1MTMM^MMMM\MM/ML.M/MM.MM^MMM]MMM[M[McMMMMWMMM]MOMrML\M]MkMWMkMMOMMM`MdMkM`MrMMNaMoMkMaMIMhMkMMkMmMkMNN|MkMgMvMN}MkMMkMNdMNgMUMM NNoM NUMNxL,ML,MkM,MM,M-N,MN,M_MzMNMkMN_MMkMmN,MNMM NM NMkM%NMNhM%N&N(NmM(N)N+N}M+N)N|M.NM.N/N/NM1N2N2NM4N4NMMM7N7NMM~MMM;N>NM;NM>NLXMANMANMMMMDNMMMM&NM1NMDNMLNMLNONMMMONPNQNQNMPNMMMMMMMXNMXNLsMxMMMMMMMuMMxMMMLyMLyMuMMMMgNMgNMMMM NMMMMMMMMMMMMMrNMrNsNwNM MMsNMwN'NMMM{N{NMMMNMNNMNNMNMMMMNNMMNNMMMNMMMMMM=MMMMNMNMNN NNNNMMNNNNMNN"NMMMN NMNN NMMN"NNMMMMMNNN'NNNNMN-NNNNNNN MMNMMMMN!NN3NNNMNNNMNNTMMNN NNN3NM-NNFN N,NNN5NNNN!N!N-NN5NcMMN-N0NSN3N-NrMMN0NIMMNNN-NFN-N]N-NGN-NN]NRN-NuN-NNFNUN-NN]NNNNGNvMN8N6NMNkN-NNYNbNNYNNN8NNNNNtNNNNzMNN:NNRNnNNORNiNnNN:NbNNiNOOOuNMNOUNOOkNO$NvNTN$NvNN*NxNN_NOON_N*NxNTNOyNOOO`NO~M2NM2NyNNM2N9NeNOzN`NN ON O!O}N9NzNNM>NN}N(ONeNN(OMDNNmNNNMDNMDN!ONNNKNNNKNNN5ON5O6O7ONN:ON:ONVNNN=O7ON?OVNNNN?ON=ONNNGONGOIONIOJONNNNMOPONNNPONNpNNTONTONNNpNNNXOMONNN\O]OMwNNNMwNXON\ONNNfONfO]ONNNMNMNMNlONNoONoOsONlONNNsONNNNNNNNNNNNzOzONNNMNONOONNNOONOOOONONONNONNONNNNONNONNNONNOOONNOONNNNONO OONNNNNN ONNONO,NN+ON/O+ONONONNNOSNNNO6NNO/OONOONNONNON.OOOOOOO.OOOOHOOO8OO@OON@OON OOO OOOHOOOO8OO;OOOOODObNNtNNWO;OOOO0O;OOWOON0OOO^OObOYOOOO>OCOYO OCOUO OOnOBOUOOBOOOOmOOxOOOpOOOxOOKOOPVOmOFOPnObOpOKORONOPOOxObOPROOLOPOPLObO,OcOvO,OuOvOcO}OO}OPuOPPOPVObON6ON6O"P~ON6ON6O~O}O"P#P&POOgO&P(PO(P)P*P-PO)PqO-P*PrONJONJOOJO;OJObOJO}OJOOONMOOO:POqOO:POO=PO=PrOOOOCPOOOCPEPOEPGPOGPHPJPOJPHPONfONfONfOOOOORPORPVPOOOOOVPXPOXPYPYPOOO\POO_PO_POOaPOOaPOePOePgPOgPOOOOOOmPOOOmPOOpPOpPOOOOsPOOOOOOsPO|PO\PO|P~PO~PPOOOPPPNOPOPOOPOPPOOOOPOOOOOOOPOOPPPPOPPPPPOPOOOPOOOPOOOOPOPPPOPPPOP'PPOP+PPOOPPOPPOO.PP+PPPPPPDOOPPP P3PP3P.PPP PPPPP/PPPP>P>PDPPPPPPP/PP,PPO$P;PPPOP;PPPQPPPP$P3PPPPPPP0P PQP3PPFOOPTPP2PP3PTP3PcP]PP PP]PP2P3PP8PNOPP0POP8P]PPZP]PPcPLP3PPZPPPLPPPPPoPyPAPPLPPyPPP^PFPQ^PQPTPQ,PDPoPPQNPgO#PO#PO#PP#P3P#PQMPMPPNPPPTP[PPQO-PO-PO-PQ[PQQQP`PPQQQ`P!QrPP!QqP$Q'QtP$QrP'Q)QP)Q+QP+QPxP-QPP6QPOHPqPPtPPPP-QPPP6Q7QORPPPPP7QPPPBQPPPOXPBQCQbPPO\PCQPPbPhPPPPKQPPPPPhPQPKQPPPRQSQSQPRQPXQPOpPXQPPPPPuPuPP_QP_QPPaQeQPaQPO~PeQfQO~PfQPlQPlQPPOPoQOPoQPPPsQPPPPvQvQP|QPPPsQPPP|Qq}Q~QQPPP QP}QQQPPRQPPSQ~QQPPSQSQ'PPPPQP TQQQ8\QQQ}]Q\Q]QQ Q0^QQP~^QQPP_QPQQPQQQ_QQQQG_QPPDPPQQPQQQQQPQQo_QQQI_QQPPQQ'`Q``Qv`QQQ`QLaQbQbQQ*Q;QP%Q;QQPQQRQQQQ"RRQ@QgQQ>QEQgQQ@Q"RQnQEQQnQ-RQ-RrQIQIQwQwQqQQrQgQQ4R8RQQQ4RQ8R:RQ:R=RQQQ=R>RPXQARQARBRQQDRBRQGRQGRDRQMRQQQQQMRORQORQQmQQQQQmQURQURVRQQPsQQQVRQQQ>RQ^RQ^RQQQQQQP}QHQ}QQ}QQ}QQ}QQ}QiRQiRjRQQjRQQQpRQpRQQsRQsRtRtRQQQxRQxRyRzRQQQQQQQQQQyRQQQQQQQzRQRQQQRRQQRRRQRQRRQQRRQQRQRRQRQQRRRQRQRRQRQQRRQRQRQQRQRRQRQRRRQRQRRRRRRRRRRRRRRQRRRRRRRR3R6R3RQR0RQR0RRR6RRR'RRRR'R RR;R;R3RRRRRKRRR#RRRKR3RRCRRQRiQQRRRRRQWRRRRRWRPR@RQ.R@RR.RRR2R_RR2RGQQQQQQQQqQQ#R3RQR3RLQRR5RRR`RRRcRRRRRER5R_R`R_RR7RRRaRIRaRRRRRRIRRS?R?RqRSlRHR!RlR}RnRS}RSScR_R SdR SnR!R*RkRER_RdRSReR*R~R)R)RRkRSRR~RReRSRSRR7R_RSRSRRSRRRbRSRRR%SR%SRRFRR(S+SR(SR+SRRRFRJRRRrRR{R5SR{RJRTRR5SRRRRXRR9SRR9SRrRTR?SRRR?S@SRRRXRRRFSRFSGSISRISRRRRGSRMS@SRmRRoRRRRRmRRoRYSRMSRRRYSZSQsRRRZSRRRcSRQzRRzRRzRcSRRRRgSRgShSkSRhSRkSlSRRnSnSRlSRRRrStSRtSRRRRRRRRRRrSRRRRRRRRRSRSSSRQRRRRRRRRRRR3RR_RRRRaRRRRQRRRRRRRS SRRSSRRSRSSS SRR SSRRSS"SS SRSRS"SSRSSRSS RR SRSSRS SS,SSSSSCRRSS&S)SS&SSS0SSSSPRRSSS8SS-SSS:SS;S=SS.S1SS.SR;S1SRSSSS!S0S)SS-S)S!SUyTS(TDUyTUgT?UyTUgT2UyTTTVUyT_UyT]UyTcUyTUTTUToTJUyTzUyT[UyTqUyTUyTUyTSoT}UyTToTS@TUyTUyTVyTVyT;VyT1VyTSTTVyT/UTT=VyTmVyTuVyTVyT/UTVyTVyTVyTVyTTSTTUT=UT=U[TTTTT[TAUTTTTTTT_TAUTUTT_TTMUTMUNUTTQUTQURURUTSnTUUYUTUUTTTYUTT\UT\UxTTTxTTTS{TT{TdUTT{TdUeUeUThUThUSTTTNUTTTnUTnUTTTTTTtUTtUTTTTxUTxUTTTTTTTTTTTTSTTTTTUTUTTTTUTTTTTUUTUTUTUUUSTTTUTUTUUTUTTTUTTTTUUTUUUU UTU UTTTUTTTTUUUUUUUUT&UUTUU*UUUTUUUUUUUUT1UUTUUUUUTUUUUUU>UU7UUU3UUUUU@U0UU@UU'TTUDUULU9UULUUUU'UU?U]TT'U UU1UUUSUUUT2UU%UT"UTUUEU"UUVUUEU5U%UU5UUUU>UU_UV/VV>VV;VVV1VVV9VVV1V9V0VVVAV#VVAVVV?V#VUfUU`UUUVVVUVU=V?VUVVV1VV3VRVVPVV=VVV=VV3VPVWVgUVVVVV=VV;VWVVVmVbV@VV=VVbVV=V@VVVVVYVXX?XXPXXXRXXXdXdX@XeX?XXUWX!XfXXUXYlXYYlXSX@XXQXXSX!XYYXzXmX YzX YYYW*X,XnXYgXaX,XbXaXYsXYbXYYiXXXXDXXXXXXXXYiXXXXXKYXXXXXXDXXXXXXXuXXXXYX YXXXuXXXXX YXYXXXYXXXX.YXXXYX%YXHYX+YXNYXHY YXVYXKYLYLYXpXXXXPYXX'YX`YXPYXXpXWqXXpXZYXZYvXXXvXXX_YX_YaYXaYbYXXbYXX}XXXXXhYXXWXmYXmYhYXpYXpYtYXXX}XXtYyYXXXXXXXyYzYzYXXX~YX~YXXYXYXXXXYXXXXXXXXYXXXYYXXXXX+XXYYXXXXXYYYY YYYXYYYYYXYYXXYXXXYYYYY(XXXXXXYY YYX:XXYYYYLXXXXY(Y(YXYYYYYYX.YY&YYYYYY%YYYYYX+YYYYY/Y*Y&YXY/YYYEYY*YXX+YYXYMYYYYYMYYY YYNYY2Y$YY2YYY6YY;Y>Y6YYY;YYYVYYY'YYYY`YQY)YYYOY3YmXYYOYYQY0YWYYYY0YYoYZkY ZoYY`Y ZoYoYuYqYuYYuYYuYYuYYuYXYYYuYYuYYuYYuYYuYkYXYZYuYYuYYuYYuYZuYYuY Z Z ZqY ZZYZuYYwYZYdYwY,YZYZZZuY*ZuY8ZuY8YY,YqY?ZuYdY8YvYfYrY9YZYYrY!ZuYGZuY{ZuY~ZuY+ZY9YvYgZuY+ZSZuYZuY.ZYYYIY.ZY7ZYpZuYZuYZuYIYY7Z9ZY9Z:ZYY=ZY=Z>Z>ZY@Z:ZYYY^YYY^Y@ZYYYHZKZYHZYKZYgYeYYYYYeYYYQZQZYTZYTZYYWZYWZXZXpYXZY[Z\Z]Z]ZYXzYYYcZYcZdZdZYY}YX~YYYYY}YYYYYY[ZYnZYYnZYqZsZYsZqZYYYYYwZxZ|ZYgYYYY|ZxZYYYwZYZYYYYYYYYYY\ZYZZYZYZZYYYZZYZYZYZZYYYYYYYYZZYYYZZZZYZYZZYZZZZZZZYYZZ ZZYYZ Z ZYZ ZEYYZZZZYZYYZZY*Z3ZZZYZ3ZZZ8ZYZZ$YYYY>YYZ[[m[s[&\V[l[s[>[&\m[,\[,\-\J[[[[[J[u[J[-\[[u[[[5\[[[P[R8\P[[f[[[[5\[[[A\[[[A\B\[[[[B\[[[[c[n[[c[[[f[[f[[f[P\[[[P\Q\Q\[[[[n[[[X\[X\t[[Z\[t[[[Z\[`\[`\[[[[c\[[c\[h\[[[h\l\[[[Z[l\[[Z[q\[q\[[t\[t\[[v\v\[z\[z\[[\[[[\[[[\[[\[[[[[\[ [[\\[(\[\7\[[[\[\\\[[)\[M\[ \[\[[\\[r\[\[[[\\\[[[\[[\\[[\[\[\\\\\[[\\[[[[[\[(\[[\[\[[+\+\\\[\9\9\\\\7\\\\7\\\\ \\[ \\[\7\\\\7\\\\\\\\[)\\;\\;\*\\M\\\ \*\[\\S\[\6\.\\\6\\1\.\[\\\\\=\W\\=\\\\T\:\]\\\:\m\j\e\\[\_\e\\m\\_\\\\\n\T\W\\V\V\^\\r\\l[\"\L\[\\|\k\>\L\[\[\\1\S\]k\]$\x\o\f\]>\"\ ]Y\f\$\]o\ ]n\j\0\}\]\\y\}\a\\\S\]|\\g\a\y\0\]]b\]]]\[8\[8\\8\\8\\8\\8\x\\G\\]g\p\w\(]{\\Y\\(]p\b\\w\G\\G\0]{\0]\\4]\\\4]\\\\8]<]\8]\i\\<]=]\~\s\\\\u\\\\\\D]\\\\G]\\[c\[c\[c\D]\[c\\\~\i\\\Q]Q]\=]\V]\G]\V]\\X]\s\\\\u\\\\\X]\_]\\\\_]\h]\\\\\[\h]i]\\\\\\\\\\i]\\\\\y]\\\\\\\\\\\y]z]z]\\\}]\\\\[\]]\]\\\]\\\\\\]\\]\\\\]]]\\\]]\\ ]]\\\]\]\\]\] ]]] ]]\ ]\\\]]\\\]]\]\]] ]\] ]\\]\]\],]\)]\)]]],])]1]\\\]]1]]2])]])]]2]S\\W\\]\\j\\^\\])]]]5])]]"]]]]]]\]F])]6]\J]6]*])]\J]]C]C]H]] ]3]] ]]],]S])]\5]H]\P])]]F]]>])]]*]]]I]]I]E]]S]]3]\]P]],]K]]]]Y]]a]d]]>] ]a]c] ]7]c]Y]K]a\ ]]7]]j]]]`]]]{]{]j]L]^]]]L]p]^]^p]^^T]^M]q]s]]U]s] ^T]^] ^U]]M]|]e]+]|]^k]b]b]+]^k]]]^]^9]]`]d]^m]^f]]^]]m]] ^u]]9] ^^f]\=]l]]&^l]&^'^'^]]]+^]+^-^x]-^/^w]/^0^2^]2^]]5^]5^6^6^]9^]9^:^]]\V]]]x]]]]w]]]]]]]]]]:^]u]]N^]N^P^]P^R^]R^r]]]]]]]]]]]r]]]\^]\^]]_^]_^]]h^]]]\}]]~]\}]\}]~]]h^j^]j^l^]l^]]]]o^]]o^]]]]]v^]v^x^]x^]]{^]{^}^]}^~~^^]^^]]]^^\])]]d]]^]]]]]]^]]]]]]]]^]^]^^]]^]]]^]\]]]^]]^^]^]]]]]^^^]]]!^ ^]"]]^ ^^^^]]^%^%^]]]^]]^]^^^^^]^^^]^]^^^7^]!^ ^]^(^7^ ^^^@^@^ ^^] ^^]*^E]]^8^ ^4^;^4^D^]8^D^]!^>^4^M^]F^M^^F^^!^^^^;^U^W^]U^^S^^(^!^G^4^)^]O^4^S^)^^>^^^q]^e]^^G^^O^^^^^^^T^*^D^T^^m^n^^n^^t^]^^m^^t^y^f^f^^^]^_^y^k^r^_k^__g^_X^p^__X^u^Z^ _u^ _]'^^Q^^V^,^^V^,^1^^^^]0^]0^]0^]0^^1^_^__d^e^ _d^ _^e^g^r^%_^%_q^^'_'_q^E^^^^^E^-_^-_^^H^^^H^^^^L^L^^6_^]P^6_^^]P^]P^^^?_^?_^^A_A_^^^F_^F_G_a^^^^^a^i^^^^^^O_^O_^i^^^^^]l^s^^w^^^^X_^^X_^^s^^^^w^z^^f_^^z^^^]~^!^~^4^~^f_^^]^~^]^k_^k_^^n_^n_o_t_^]^^^u_^t_u_v_^^^^ _^_^^^_^_^^^v_^_^^_^__^_^________^^_^^ __^____ ____ _^^^^_^^^___^^^^_^_^_______ ^^_^___^^!__^^!_^,__^______"_&_*___^^"_^__*___^_!_7_!___W^^^_/___/____7_^=_=__#_^___#__)_!__)_8_!___^___8__K__0_^7___0_!__C__.____Z_3_2_K_Y___@_r^_p^__3_Z^_Q^__Z_1_a_l_ _a_C_Y__r_H_._Y__r_]_E__]_H_ ___M___m_m_y____>_____`|_M_E_e^_^_^_^_|_y_@_Y_` ` `_ `_ ``T_T__``_`__`_``__```__``______y_$`_`_`_$`&`x_&`'`^?__y_`_x_z_^G_^G_z_I_^G__s_~_J__~_5`_5`J__7`P___y__P___7`_`_____A`_A`C`_C`D`G`___G`D`_I`___e_e__^f___Q`_Q`R`I`_^o_!_o_Y_o_E_o_y_o__o_^t___^t__t_ _t___\``____R`___________l`___l`__o`_o`____r`______v`r`___z`_z`____~`_~``_``__`_``_`__`_```_`_`_ `_`,__ ``__`_____`_````__&____```___``__`___``````````____``)`(````_````(```_)```_`"`(` ```_``4`1`_4`%`+`_``%`1`_1__+`_`_"`2__` ``_K```K```=`=`(`` ```l__` `N`(`_N`M`(`B`_`)`_3`3`L`^`B``^`` `M`L`_`>__,`F``,`<`S`H`S``<``#`H`U`S`J`g`F` ``W`W`8`!`J`_ `_ `_ ```d```\``\`E```-`u`aP`O`an``P`_`8`!`u`S``S`g`#`n`Y`s_'``[`aa`_'`_'``U`Y`-`a`ae`c`ad`g`ae```6```6`_7`_`` a_` af`{`:``{`:`T`f`'a`m`'a`V``y`x`,a,ay`/a`/a_I```4a```4a``6a8a`8am`T``}`6a`x`V`?a`?a@a````Ka`@a`_``_``_``````KaLa````j```j`Sa```Sap````q```p``q```_v`_v`_v``v``v``v`da```da````ia```ia_`````oa`oa````ra``````````ya`yaa`````a`````aa``a``a``a```a`aa```"a```(``S````a```a`aa``a````ra```````aaa`aaaaaa`"a.a```a#aa`````aaaaa#a`aa.aa```aa+a``aa)aaa+a`:a`a>a`)a:a5a>aaa5aaaa-a;a`a;a`a-aaaaFaaaa.aa3aaaFaNaDaNaaDa`a`a!a`3a`a.aGa!aaGaaaE``O``a1aaNa1aNaBaNaaBa[`aaOaNaaBaaaaOapaWaaapaUaTacjcc=cWcc>ccscctcxcctccccKc@cacd}cdKcxcEcWcpbc~ccdd~cscjckccdkcvb'cwccdcVc/cccccd1chchccc/cdccc1cc1cgccdgcdAchcccdcd"dccdc"dccccccdcAccc}cxcCcwccCcccccMcccc/dccNcuccMccNc/dc7dc7d8dbRccc=dc8dc=d>dccZcccccZcbccccb^cb`ccbcKdcKdLdPdcccLdcPd>dclccclcccbnccpcbncccYdYdcpcc\ducc^dccccccb|c!c|cc|c c|cWc|cidcccidjdccjdc\dcndccccbcndccctdcctdcccccccccdccc^dcdccccdcddddcddcccddcddcdcddcddcdc#cc2ccdcdddcddddcdddddd d!ddcccd dd dcddf>feBfeeeBfCfCfeeeeeeeddeddeOfe ede edeOfQfeQfeeTfeTfeeWfeWfYfeYfZf]feZfe]f^feeeedfeeedfee^feeehfhfeeeeemfemfofeofpfeepfetfetfvfevfeeyfeyfee|fe|f}f}feeeee$feeedefeeefeeffffedede8ee=eeBeeffeefeeefffeffffff f ff ffeefe.f ffe f ff$ffe@eeff fff)fff/f9f fffff)f'ff.ffefff/f'ff ffffff9ffFffe'fff:f:fff;fff;ffh@hg@h]gggg4hgg]g>hg`ggg`gggLhgLhNhgNhOhOhgQhggThgThVhgVhWhgqgggbhgfvgfvgfvgfvggvggvgQhgbhchf{gggggggihgihggfggggggg hghgthghghgthgg~hgWhggggggggghghg~hiViiPhhi*ii,ii6i9iUii5i3i0i)iii/iiXiii5iieii,iUhi^hih:iioiii>ii6ii9iiMiKiEioiOiViiCiiEiinhiXiCiiKiOiijDijjZijjYij_ii`ii j_ijii jh(ij`ijjjijjgigiijjiiijjFibikiibifiLiiNi~ijki~imiii$jiii$jh?i(jiii(jrisiPiriiiiFiiiii0ji0jiiiimiLiiNi7ji7jRiiiPiiRiiiii>ji>jiWiWiiiiii[iii[iiiiiIjiIjliiiiOjiniiiiOjRjihiiRjiliiniVjiVjiiii[ji[j]ji]jiviviiiicjicjdjiidjihjihjiijjojijjiiiiiojpjpjiiiiiiiujiiujiiiyjiiii|j}jiijijijyji|jiijijiiijijjjjjij6jj!jjGjjjij}jijjijijjiiii)iijijjijjjiijjjjjijjiiijiij1iijijiiiji3ii5jjbjjNjj'jjAjjj'jj=ii j1jj j=jjjj6jjiiUiiiijjjmJkkskmJklJkmJk=kkZkwkkZkmJk|kkmJk`k|kll`kSmJk>nJklXklbk^kl lqk lmJk llbkqkgkkVklj(klkkVklklltkltkkkkl7kk9kxkuk7kkkk9klkxkukkk%l%lk'lmkk'lk,lmk,l-lk{k/l/lkkkkLk3lkkkk6l7l~kkLkk:lkk3lk@lk:l~kkk@l7lkkkckkkkFlGlKlkkckkkKlLljfkjikkkFlkkknkkknkTlUlTlkkkYlkYl\lkUlk\lkkkkkkalkalkkkkflkkkflhlkhlklkkkkljkkkkkkkkktlkkktlkkkkxlkxlkkkkkk}lk}lkkkklllkljkkkUkk^kkkkgkkkklklkllllkllklkklklll llkljk$kkl lllkkl llkll llllll"lll"lllklllllkklll.llll.llllll)llk&l lk1l lll>ll)lll1lllBlll>l0ll llElllk=lAkkwkk&ll?lkllOl?l l0llOl2lAll4lll2lWlHllWll*lkl5l*l;lVll5ll;ldlRl8ll9l8ll9lldlll4lAlVk lk lllmlk lVllllllDlRllIllXlIlDlJlJlllXlElBllmNl=lBlmPl^lmmPlmzlmKmzlnllQl m mlmlm{ljlllm{l{k-lmk/l]llm]lmmmk6lk7lk6lNlmlk6lmsl#ml#m$msll$ml(mgl(m)m*m)mlllkGlll*mlmslkLlkLlllkLlkLlll9ml9mmlllZll[lBm[llDmGmlllGmHmNmlllBmlllllNmPmlPmTmlkklDmlTmVmlVmWmllWmlZm]mlZml]mkxlllHmllldmllldmklll0llBllAllHlllmllmllnmllqmlqmnmllltmllllkltmlzmlzm}mlll}m~mllml~mlklmmmlllllllmlllllllmmmmmmll mll mmlllllmllmlmmllllllmmmmmmlllmlmlmmmlmmmlmm ml&mlm&mm mmmmm'mmm'mmlmmm mlmmlmm ml mmmm!mm'm!m'mmlm0ml+ml"m0mm+mm"mmlmmmmmmm;mmllmmnllm=mmmmQmm'mm;m.mQm%mImRmKmRmmImmmKmm,mXmmm,m^lm=m.mm3mmmMmQlmlmlmlmmmmYmjlmhmEmmhmmCmommmCmmpmmpmommOm3mRmOmJmFm^mLmvm-mFmnJmmMmRm[mrmnLmYmRmn[mnUmmnvm-mwm{mnUmnwmnnmn_mumn_mnemmnnemmm)nml>ml>ml>ml>ml>ml>m)n*n*nmmrmxmm/n0n0nm|mm/nxm4n5n6n5nmmmmSmmSmmm4n|m6nm>n?nmmAn?nmAnmEnmEnGnmGnInmInmmMnmMnOnmOnQnmQnllmmmTnmmTnmmmmm\nmmm\nmmmmbnmlzmmmbnenmmmengnmgnlmlmjnlnmlnmmjnmmmpnrnmrnmmmmmmpnmmmmmmmmmmm}nm}nmmmmmmmmlmmmnmnnnmmnmnnmmmmmmnmmmnmlm'mmmmnmnnnmnmmnmnmmm mmmmn nmmmmnnmnmomnnmnnnmmnnnmnm.nEomnm.nnnm.mm1nnnn1n!n-nm!nmn%mmRmmEmmomm^mmrmmn=n-nm=nmXmm@nm"nm`nmnm+nnnnn+nnHn%n#n,n#nn%nnnn,nnnRnRn@nnnUnn(n"nn(nn3n2nn3n8nWnWnnXn`nnnXnUn7nnknnan nnLnLnannHn=nkn`nnmnumnn8nmnCnBn{mnn~nZnnn~nnCnnqnmnnnnooonnnn otn oVnntnnqnZn9nVnYn[nm*no]nnoo]noYnonoooqnn_nono[n9nmnn"om>nm>nm>nm>nm>nm>n"omnFnnnvnvnFnJnn2ownJn4onwn2on8on8onn:onnnn4on?on?oBon:onBonnDoEoGonGoDonnnnnLonLoMonnnnMononnnhnnnnnnnhnnnonnnnn]on]onxn_onnnn_ondondonnnngogonnnnnnnmnmnmnxnnmnnnnnonmnnnnnonnn~on~oonnon onpnnnnnnnoTononnnYono oooomnonnnnnDpnnnnn]pnonnnonnnnnzpnnnonnnoono%o%on{pnnnoooo+o.oo$oo+oooo/ooooo#nnoo1oo$o1o$oo o9o$ooooo3o2nn7nnoo,oooooo9o o;ooo oon'o=onoHoo5o'o$oHo=oooIoononoKoKo>oo0ooo^oooFo^oNoFo0oooJoo5o;o\oCon oJo7o7o o@oNoQoNoo\ooo`oOoooooo o@o oyo_nonooQo`oOooVonoSo oVoPo peoRoPo poRoyoPoaoboeoSo&oaop{o&oo{opopo[opoppppocoopoppoppcofoo!p!pfoopon:o'po'puoo-puonEonEonEo-poo0po0poo3pzo3poooooo8po8p9poo9pooTo>poYoooBpoBpooDpn_oooHpoHpKpo>poKpLpzooLpoooSpoSpooVpoVprooooorooo[p[po]p`pooo`poooohponono$ooNoohpCoooolpolpoooooooospooospypoooooooooypzp{p|poo~poo|pooooooo~pooooooooopooooopoppooppooooppopo.oopp/oopopoppppopppp p3oop popo,ooppop%ppp;ooo%pp"popp"ppopoppopppp+pp-ooopp pppp4p(p5poo4pp5ppppoppo/ppp?pp?pp ppppp pp2p2p6pp$p#po$p:p#p&pIppIpoPp#pp p+ppPppPoo.p\ppp:pboop.pp&ppap1p7p@ppp1pbp@pppbppapppTpppTp;ppYpppOp[opoppopopopopppapvqapipeppTpqapJrapopYrap0vapcwapwapxapqipxapqopupxapyapqopyapyapyapyapqqp/|apqqpq"qpYppB|apD|apOpp"q#qpppp(qp#qmp(q)qoDpoDp)qpoDpoDppp3qp3q4q4qpUppppXpppUp@qpppppmpppXp@qEqpo]po]po]pEqFqo]pppppppFqpOqpOqQqpQqppTqpTqUqXqpppXqppUqp^qppp^qbqpppo{pbqo~pppppgqgqpjqpjqppoqpppppoqqqpqqrqppppppkvqppxqppzqrqpppppqpopqopqqppqpxqpzqpqpppqpppppp%ppppqpppppppopqpqqpqq qqqpqqp+pp(ppqppqpqq qqppppqqqqpqqppq%q-qq%qqq$qppqq$q-q6ppqpqqq#ppqq\ppqqqqqq7qq5qqp-qq.qq2q qp2q7ppBqpqBqqqqq1qq>qq1qqq5qqq>q;ppppppppppppqqGqRqqqKqRqqKqqGqqepp&q\qq&qqupp.q7qqDqqqGq8qdqqq8qq>q qeqDqRqkq qHqkqqq=qqqcqqHqqqAqYqNqAqsqNqqrYqrrrZq{qrZqrIqeqRq=qRqSq]qrcqRq+qSqVq+qrq[qVqrr[qrqrIqsqqqrqrruqq{qrrtqqqqrtqq{q%rq%rJqfq'rqquq{qfq{qq{q'rq.rq.rqqqJq2rq2ryqqqq6ryq6rqq8r9r:r8rq=rq=rqqqqqq:rqBrFrq9rqBrqFrHrqHrpbqJrqqqqNrqNrOrqqOrqqqUrqUrVrqqVrqvYr}qqpvqpvqpvqqvqpvq-qvqqqq}qrqyrqrqqqlrqlrmrqqorqqqrqqqqmrqurxrqqqxrqqqqorqrqqqqrqrrrqqqrqrqqrrqqqrrrrqqrqrqrqqrqqqrrrrrqqqqqrrqrqqrqqRqqsqq{qqqqurq7qq qqrqqqr rrrqrrr rqrr#rrr#r-rrrr-rrr3r3rrrrrrr5rrr rrrr;rqrr/rrrrrrrr/rqrrr>rrstsrJss>s%s%srMsr.sMss:sss#ss.sr,sr:sDsWsWsrsDssNs`ssNsss/ssFsPrsvrss0ssFsOsOss;sss[s;ssiss[ssssYsXrsrsrsrsrsrs,sCsEssYsEstcssPst tcs}ss tws tcsrsss}swsrs t t t\s]s tsfsttksts t\stt0s`sttvststtsstststtss"ts"t$ts$t(tssms(tssssms,tss,t/tsrHs/tsstvsss6ts6t7t7tsss;ttt]tttAtnttAtctwtuctstu>tt tCt=tstwt tstms$ts$ts$ts$ts$ts$ts(tuts(ts(t.tstutuuutCtstuuttsttsttdtuutstott&utuot&u)uttt)u+ut+u,u,uttsttst2ut2u4ut4u6ut6utt9ut9u:utt:utttkutttttCutCuEutEubttLuttbtttttttLuttttPuPutsltUutttUuVuWu]utVutWutsvttt]usvtttbutttbutteuteuhuttthuiuiutkunutttnuouttsutttsuttttttouttt{ustttttttutu{utuutttttttttutttuttttuuutuuuututuuutuutXutuuuu utOutYutt uttutuuuu ttutuutuu-ututtutuu3utputttt'uuuuuuuuu uu|uttuuu u;uu uHttut;utuuuuGutuu?u5uGuuu?uu!u8u8ttntt#utTu#u'uuuTut!uuuuXuuOuuuuYu*uAuu*uuu>u>u@uuRutHuRuuHut-uuuu3uFujuuFuu3uuuuuupuqumuuuquSuxuuuSuuudtutututututuyuauvyuvuZuuIulufu vlu v v(u|uu(u^uu.ugu v^uu`uv`u.uZuxuvuguuvvuuv[uv=uuu7ut9uvuu=uvruIuxuruuuuuqu[uu7uuuuuu-vu-v/vu/v~0vuuuzu4vuzu~uuuzuv\vnvvv>vvv@vvHvvwLvLvvovvw wovqvvKvvvvvv w w wKv wqv wwvwv'v^vv'v^vvvwvzu0vu0v6v0v\v0vv0vv0vu4v@v\vu4vww!wv!wrvv$wv$wvvDvrv(wv(w.wyvuCvwvuCvvDv.w/wvv/wvvvMvvvMvvv6w:w}vyvv6wv:wuUvw"wwwv>wwwvEww=wv#wwww"ww#wwKw&wvKww3vvwv&wvw+ww2ww=wv'wv+w'wwSwXwwSwww3wEw5wwwwFwwFw*w2w5w,w*ww,wOw*wwOwwOwwww8www8wiwwRw3w5wvwRwiwwTwiwgwiwwTwwtwiw}wiwxgwxxtwxx}wx xzwv!wzwiw xPwmw xPwqwiw xrwiwwiwxqwwRwxhwiwxxv/wwiwwiwwiwxrwxwxxhwx xw x!xwiwwiw?wwwww?wxrw*xw!xw*x+x+xw/xw/x1xw1x2xww6xw2xw6x8xxw8x:xw:x;xwwww>x@xw@xAxww>xwGxwwwGxvcwvcwwcwwcw5wcwXwcwwwQxwwwQxRxAxwRxwWxwxwwWxwwwwZx[xvvw^xw^xwwwwZxw;xw[xwwwfxwfxwwixwixwwlxwlxpxwwwwwpxwwtxwtxwxwwwwxwwzxwzx|xw|x}x}xwxwwxxwwwwwxwwxwxwxxwxwwwwxwxwxwwxwxxxwwxwxxwwxwwwwxwxxxxxwwwwxxwxxwxw&xxw&xwxwwxxx&xx0xwx0xxxxxwx'xxx'xx4x,xx4xxxx(x)xxxx(xxx*wwiwwwwwwwwxwx3xDxxx5xwx=xx3xxx-x=x5xwxxNxxNx-xxxJxxxxxxUxxysyy;yiy>y*zpy;yy*z-zyKyly-zlyyytytyKyxHy5zyxNy5z9zyyOyyy9zOyzyZyyyyyUyUyyyyyZyBzyBz`yyyyyyyyzyyyyMzyy`yyymyyMzyyRzyyyyyRzqyyyyyyzyymyyqyyyZzZzy\zyyyy\zyxxyyyyynzyzyyyzyx}yyyyyyyxyyyyynzyyyyyy"zy'zyyyyyyyyyKzyyyyy]zyyyzOzyQzyzyyyzyyzyzzyyyzyzyzyyyyzzzzyzyzzyzyy0yy1yyFyy[yyyyzyyzzyzyzyzyzzyzzzzyz&zzzyzzzzz zyz zzzyy,z(zyyz,zy"zy3z&zy.zy;zy8zy6zy3z.z2z6zz2zzzzz7z;zy7zCzAz,yyyyzyzy {yP{yAzyzCzzyLz+z@zLz8z@zyz+zeyyWyyzz'zz[z>zy[z/zyz)zz)z/zGyy:zFzy:zDzyzHzzzz.zHzDzzKzzSzGzEzVzzSzVzzzz]zzzzJzzEzzOzozz\yzNzozzYzzwzYzzwzzJzIzzKzazz{Tzz{z{xzzNzzQzxzzzazzzzTz{zz0zzzXz=zz{fzbzXz0zz0zzz{fzz0zzzzzzzzz?zzzzzzbz=z|zzz?z'{yzz'{yz+{|z+{zzz.{z.{zzzz3{z3{zz5{zzzPzPzz5{z;{z;{zz={={zzUzzzA{zzA{zE{zE{UzzG{H{K{zG{zK{M{zM{O{zO{zzkzzzkzH{zzzV{zV{W{W{zzpzzzpzzzz`{z`{zzc{zc{e{ze{zzzzzzk{zk{l{l{zzzzzzzs{zzzs{zzzzx{zyzx{zzzzzz|{{zzz{zz|{z{z{zzzz{{zzzzzzz{{{zz{zz{{z{z{yz(zzzz{ {{{zzz{z{{z {zzzz{zzz{z${ {0{ {zz{z{{{{${zz{{z {{0{&{ {{zz {,{z {{z{z{{{{{N{ {{ {{2{ {{2{{B{7{>zzFzz{B{{{){/{{){{&{{I{{{zzI{J{{Gzz{J{{{{N{z1{1{9{L{P{zL{Izz{L{9{z:{zT{z%{T{{{%{Z{^{{Z{{{4{F{P{^{{D{P{u{P{X{:{Y{P{4{9{Q{:{{X{{p{m{m{{{p{{g{P{{{F{{]{z{|]{|{Q{h{P{{D{|b{R{{b{R{| |u{ |a{{{!{{P{!{Y{*{a{w{j{j{*{|zz+{|g{z+{|w{|[{{|{r{|[{|{|| |{ |z;{y{{z;{|h{?{y{{?{n{{)|+|{+|.|{)|n{.|/|1|{1|6|{{{{{{zO{6|8|{8|{{\{{;|{{{{;|{{{@|@|{B|{\{D|E|z`{{{E|{I|d{{{{L|{{{d{L|{{{R|{R|S|V|{{{V|{{X|S|{j|{"~{{{{${{{A{X|{{{e|{{e|{{{k{i|j|{{i|{{{I|{{{{Ɂ{ʁ{ρ{Ё{x|{{{x|y|y|{||{||{{{‚{|{|{{{{|Â{{{{{{{{{{{{|{{{|{{{{||{|{:{||{|,{{ {{ {{7{{/{{{{{{|{|{{||{{|{{{|{||{|||||{-||{|||,|{{,|-|||-|!|-|||*|-|0|-|J|-|||||!| |4||*|k|-|| |||{0|>|{F|-||>|||-|||{J||-||C||C|{|-|#|{"|{{||2||-|2|"|9|#||-||9||,||||*||-|z{{|-||-||-||-|G|3||G||K| | |k|_|K||_||||F|Q|=||Q||o|Y||o|{||r{|}}F|}b|}|M|H|}M|{ |&|| }b| }|J|||}|&|}v|}}v||}|}^||{{/|{/|{/|}^|}q|{/|}}|}}u|}}}z|#}|||#}u|||~|(}|(}O||{D|,}|,}{D|z||||0}q||{I|4}t|4}|||O|t||||{S||~|{S|0}|{S|||?}?}|B}|B}C}C}|\|||\||||a|K}|a||K}M}|M}||{j|-|j||j|%}j|L}j|}j|||V}||Y}|Y}||V}|^}|^}a}|||a}||{||d}e}g}|g}d}|k}|k}||||||o}o}|||s}|s}u}|u}v}v}|y}|y}z}||e}|}|z}|}||||||}|}}{|||}|}|}|||}||}|||}}}}}}}}}}}}}|||}}}}|}}|}}}4||}}|}|}|}}} }}|}}}}}|}|)}}|}}||)}|}|8}}%}}|}$}}}}}%}}};}%}$}}8} }|;}7}|@}7}}}@}}}>}}3||}&}}|9}>}%}+}|A}+}}}}A}'}L}}'}|-}N}P}S}|}=||Y||&}%}-}L}9}%}G}S}}G}H|}|}|}~|}|}|}P}}}N}}Q}};}}}q}}c}6}}c}q}D}}}}l}F}E}}Q}L}}f}t}}l}L}}F}H}t}~~H}~i}I} }i}I}~ }w} ~~}f}L}w}L}|}}~}} ~|}W}}~W}}}~~}~~}~~x}_}~~~}~{}~~x}}}"~#~#~}%~(~}}}(~{}},~}}r},~}r}}r}}r}2~}}r}2~|M}4~5~}}}O}O}}U}}4~}}U}%~}5~}|Y}}}B~}B~D~}D~E~}`}}}}}|a}E~}}}}}~}}}|k}}}}}X~}}}}}X~Y~Y~}[~\~\~}`}}`~}`~a~c~}c~~}}e~[~}}}}~}}}}}}}|}e~}~}}}}}}}}}u~}} ~}}}}}u~}~}$~})~}~}~}}~}}~}~}~~}~~~}}~}~}~~}~}~ }}a~}~} ~}}~}~}~~~}} }}~}~~~ ~~~}~}}~~~$~~ ~~~}~~}~~~)~~+~~~}}~~ ~~+~~!~/~~!~7~/~~~$~@~/~~$~~7~~~9~.~/~~]~/~9~6~H~/~} ~~f~/~}~/~~7~*~}~*~~~ ~6~~3~~/~~D}}6}}E}}~~1~-~~1~q~/~~~&~R~~$~~/~~/~~&~~~@~~~~/~~.~ ~.~8~ ~~0~~~~}~0~8~~]~~H~~I~g~~I~~:~d~'~f~{~W~_}~{~d~y~t~|~F~r}"~}"~/~"~~"~~"~."~;~|~y~'~<~f~F~'~t~y~i~i~~~x~_~v~~~]~_~~~}~W~:~~;~~v~<~&~&(q~(*~*+,+~,~w~~~~2w~233~~N~~~~~~z~N~~V~~~V~~~~~A~AC~C~^~b~~F~~~~~b~^~~L~LF~NO~h~h~~N~~~n~~~n~O~~~~r~~~^~~~r~~^_~~~~~~~d~d~~~~~~~}~~~_~~~~~~~~~s~s~~u~~~~~~}~u~~~}~}~~~~~~~~~}~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~ ~!6~~3~~~~!~~~.#-."~8~ "~--~~~ //~ 8 R~~.G.K. .=.[.G~K01<~ 10;=g.g~~YEY[gMHi. Mm.HD@ ]@]fDfhlhlx~iJbVb~JVkkm[ { 'XX'{PcRRcq5q\z~25\!""$!n))nn..//Q5v577zvQ;z;<@<@8AE~_EHHIIKKOOUrwrwaacceegkgklnnlxzU~xz{{~~ #    (46(64<  :;  :6Ā#Ā#&E&1-πр-π18?=р33=ـ8ـڀڀV݀S݀>Z߀TTZ%߀>F\V6P%ZCFZS6C9BQdwq]\ZQBq^d ^L WwMLM Wn$$ $)X|D|J_GXAA AA6AZA_DJG7J7Y}<==<B}YBDDMffMOOgǀˀSǀSoUoUɀ\ʀɀ\]ŀƀ]ab̀ʀàbӀӀkՀՀȀހpހpqqȀxx{{~~̀ЀȀ̀րր؀؀€?€΀(+΀Ҁ( - Ҁ-Ԁ.Ԁ.>;ÁÁ>Ɓ4ƁȁCȁɁʁ́$́!8΁ρЁсҁсE$ҁ9ˀƀ΁!E V])G')VGV4;/1/3d3de'VC;efrF?r?^RJRAA|Ts^KcIT c h   hYXYgjl: h:v#=j=#v(++..001Ӂ66W1S>ŀS>W[Bځ[B(IIJJMMPPȀkkЀkˁVVWẂ́ف\ف\]__`߁{]Ӂj߁`joځosԁԁstz+z{Ձ}ցցށ}Ձ{ށ؁ׁ؁ށt; ʁ8ʁ - ЁVЁfЁJЁ|Ё-‚jÂɂ8ǂ8ǂ2ɂ˂1˂N&тLQEN&FтL5<݂5<݂Zb3EZb3Yd YscKIԁK X g eEcl eSUfUS^^|AfaUaAT|~y ~ Xr i Xmir++[g/[/hgh:k:!m!&m&'(k.'.001MˁMMM(::;p;1CCEEFFIKKMMNIƂnnłƂp[[ςƂ__ׂa߂c}afclςׁłlmfȂĂȂmrurĂNuẑzƂЂՂ؂؂ԂԂՂ܂܂ނ̂ނTЂ ÂEÂUÂTÂyÂrÂ2ǂ˂"Q˂ "//A3)Ƀ,,4) 3Ƀd4A-=JA-HՃHՃ׃J׃؃؃QLUSL#S߃U߃GYZGZOQAOVAVRR2{AWA\A[ƂtAoAvAQ{AA~{T ~P  X}  \T(tt Ww Xj{  "q"qjs&&)o),v3v,..w {3NׂN߂N88=]=^?`^]FFHăH`?ăMʃMOȃOknÃRk̓̃̃nR̓XXYYكʃۃbyσȃۃÃكybƒ˃d˃|ۃdƒkkmŃmoo҃ۃvۃσۃ|σv΃y}Ѓۃ}փ΃Aۃ ;Ńۃyփۃ ۃЃۃ܃   ƃ  =ƃ !Ӄ'уу//Ӄ!#؃Y؃$;'„$„݃5Ą (݃5Ą(̄Ī@ՄIЄ@Є2N:ӄӄNՄ<#ׄׄ<ڄ1ڄB܄%1]܄UU%I;r;PB]AC;|;SESET9T} rcsc_;WzwjsWC|^^ _JJZA] ~~`w*[{[,*`w33{e%%''**F..u2u24V499:;V;BBCGCGKKDŽMPPMƄɄTƄTU҃oU\؄\ ]]؄Ȅ̈́``Ȅ}ф˄؄gфgjjkkń؄؄΄҄s΄˄sτ؄ʄwwʄ܃؄ʅ؄̈́لń̈́ͅ؄؄W؄؄g؄ل֏؄׏؄ ؄؄ @؄     „(̄!:̄ τ&& #Մ]Մ89Մ(1<߄1D߄)Dȅȅ)ʅ˅+$ͅ˅+=Ol_օSօׅ>܅>S=ׅO܅szJO-NQN@@QZ-lee5_ui[ue?v5Wvv ?rRcvOrR vW{v   d,d WVzvV,cv22vxv|yv:::Ʉ::v(|ąv(**FxyFv2{vDŽK2Y66}Xz::<<}X@Y@BB̈́]EEÅ҄]JÅ`JLąLNNPPn΅nqԅԅ΅Ѕq؅ЅZ؅Zڅ~__`̅Ņ`ممڅڅ~̅څllڅ!څƅ݅|݅ƅڅ+څڅڅ|7څ~څ~υڅ=څ?څ\څVڅUڅDڅ8<+ʅͅvͅڅͅͅͅ3ׅͅۅ79Æ9JׅۅÆޅ'ޅ#'ʆ#++ʆ/0/03҆>>3҆Ԇ=ԆՆֆՆ?Siچ+چ߆\߆V8&8Ad;XCAH;^Q^ HCUKֆ?rYVVrKD!jh!UffVj{o{egezv5Ćv5h$h##$Fot'()EtF'(ˆN)779z9І@@BBaĆŅ``ȆaȆKKiNNRiRSSVˆVW͆Z͆Z[[]Ά؆]bΆbcӆfӆfhh̆p̆υpqцs{ІqsWˆ{c~׆~׆ننφφ 3 3"3+SֆÇ=Ç8Ň&+dXŇ8%Ġχ"̇%χ=+:34Qׇ4X3ׇ؇<3L3؇:އXއ;^L;YJ3JM<iPMPi\ `d 5d5g>k`A_AA>|jmA`|_    m  * m*)aox#nC#n%&r@)D+Ct%0)&r+z9<z <9WD0‡؆]ՇcӇQ‡Qɇ:UV2цq.S͇L_͇U‡_aaeՇneڇkkӇ)V‡8yLJLJy{ɇ{}}ه··ƇۇƇЇчЇч݇݇+G'$҇ȇ$'χ,҇҇,--/"ˆ/ˆ=Ĉ^އ:ĈȈɈ=Ɉ2̈Ј>ȇ$\Ј>1ڈÖ.Azڊjڈ$k݈Ȉ:݈.jSTF*?T*EO1jE?F7j7L^g^funfuaoRzG3bbl zxSn qqnt++tYG3Y3t;Rg;v&v&'((*++-|w0s0w4s46699=V=*V@BBC@FFʈLjIJڇeIʈJˈoΈoΈWWxψ-'xֈcֈه{ۇ{c{{шԈkԈklÈ׈ƈ؈oCl؈ՈÈyψˈoƈшˈ'y߈وˈ҈܈߈҈وՈ׈܈""" )1 1̈1252ۈ83<)ވ3.$É<ۈ$ۈވ.:?ˉˉLÉ:)ELED#׉׉#ىglىD,G),HK[XHbPYP YN h;M?z>;NRR{vzvDQ!n]VV!n{   {T|* ]-e\-Amffi 9 77jpq(p@@Lj@(iA\}T{g}ˈJ׈JJe{JD[XbmMhj>Q?؉܉gPPʉgƉʉTƉTɉ͉WɉWYY[\-:$Lԉ0\؉Hk][Fkn؉u؉nމމttuvwvy}ωyω}~wډ‰~ډ̉̉щщ܉ʼn5ĉĉʼn"/3/-+#GىÊÊ߉:7߉7NJNJ̊$K̊-LϊϊMԊ0M!Ԋ5=5R1؊!؊R݊91݊ފH{q͉ee.UQUފ0Q]ddoF9=h8h8^rrzsxCsCxz{g{z%VZ%Z'gzVz'_zjz2^h_!j2!iz|zpz&i&'zz-pz-.z'|.N3Nzzzz3>>AAԉ\DDFFHHJJLLNNfRRSSVnɊVيڊˊڊyaيfa‰yڊʊڊڊъڊɊˊڊ͊͊ssvvʊ܊܊ڊ6ڊڊ@ڊъBڊڊ ڊ,ڊՊՊ"*ڊ3Gڊ_ڊ+# "" ++ 2=Ԋ6#(Ƌ(Ƌȋ@ȋ.ˋ̋̋BЋЋыCˋ@ыO?֋֋O o$E))$ߋ,ߋPPE*_IjcjGI00bijdc8h8ixjKjjujxdbjjKmjUm%U}%jt}tu...[[jҋje!##f!e'f'())+nT004+455ynT=C(y=C^GGJŋ^JKNKNŋQɋlSlҋQɋPWSԋ{ԋb݋dԋՋ{b݋Ջde‹ۋgg‹Nj׋NjËppËՊ׋u zzϋ͋ċʋu͋eԋًċʋ΋Ӌϋ2ًދڋڋ#Ӌ%%.,%.,.CЋ8.^.,?ы_.i.c.o.Č8ČŌH / B ʌHʌˌ{.Ό/ΌԌBbm.ˌH.Ԍ;9Ō8،;،%ڌ3Yh....͌.ڌ83]]X.׌.[^_ikhkcfAlqqAflo[X{MOr#M$mr$1O++7+2j21aca77@sj%)||%s)@,},G.2}K23PPRR:~:.W.WW0W^WWB3EEFn~tۋeNNP͌PRRwьVҌьVnҌdՌtwxՌƌx΋zaaٌٌƌdffBȌ̌̌o׌Ȍ֌opFÌtÌtuuwӌ܌یދp׌܌wیӌnjόόތތ݌݌ߌߌ+Œ Ō9ŌŒ  +Ќ**Ќ110660YڌXڌƍ0ƍǍǍ ʍ ʍ<C̍-̍<Ѝ9ЍэҍCۍK 0 0э/-0hҍ/ۍݍZݍJZ^J"4$>A90$4Av^/0K0O^`^>WL Wq[[ T^qvO`T\^MyM\U  b   _U^b^^z;ze]j__^^^j{e{; %%rmDmD.r.HH1155XLRRXkxXFgFIh֌dLIghllTT΍kȍ΍WWȍɍnju|_܍ɍx_܍׍x׍}|Ӎ}fӍߍt͍ߍՍf͍tōōԍz}}֍ zԍՍ֍ ލڍÍލčˍÍÍč**ˍ&&6(6()6"ݍLݍ& Ȏ)8606Ȏ ˎ8ˎE4ΎEΎЎ0ЎююMԎ:Ԏ֎2֎؎D؎܎H2NM6܎DNHN9`U`UJ:6&9NyGNQNOJOGQ\]?\?VgVPvsxwy  S xK  SyPgovg Yo]<$Kg<$sgu)u)**R.|L.{8|8R;;>>??EEHHJJÎOOPjPҎjҎW~ĎĎZӎrW͎ZӎfÎ͎~rfghiÎhsisݎݎڍ}}ŽʎʎŽ׎׎ 6NgÎŎ!! Ǝ! ŎƎ4ˎ/&"==6Aď6ďƏ4Ə Bȏˏ'ȏ ˏ1G&/"/'Bҏ1ҏNRՏNՏ֏׏ITڏIڏ܏D܏ޏ0ޏ[DT3_20T3,M,w<Q<@Y UrF[T@_C]F_C]zv4AzUU~^~    j$ y{*j^*2TyXX\\ q ';;q'Kw+w+,E,225K5PP8::8==@@BBCCHKKggHgAgVVYsY[[ΏߏaΏabdߏdeeɏɏяi͏imϏmnn؏rُrsuusЏwxbΏ͏яُяwЏяx/ԏԏ""BƏGƏ*RƏ(3ӏT׏_׏r׏^׏ӏÐÐ0*"Ɛ4Ɛ40АF(""MQА3"ӐԐאOԐ-אؐڐAڐؐ6">]vF"L7.9lX   я   ӐFGt-vEtOv6vEG|qzzy P  f  o Av>vkLv7vltk  ""#|tk#Py-9v.vfy-qt66:{{oy:==Yl@֐GGLLĐPϏiP؏iҐUҐUW}Wː^ː^aѐa}ccѐǐ~ǐl~̐l̐͐o͐ottՐՐzz|֐|"vtyܐ% 7''drq%ې !,ސ!  ,ېÑ7Ñސ4ё4ёґӑO>ӑבOב1ّ(ّ(ETߑEߑQM`[`\Y1>`<ґ4\[pQTh<mpmA_X{XY[)dnH&n}VMT####V&H)}rhZq!y9qhmf9dyf!Am0g@@@@@@N_mGĐGG0GgNNR88=RR=]AABD]BDccMMNOϑNSϑSTOT\\ܑ_ܑ_bƑ|b|ffggjjݑƑݑ‘pȑp‘vʑđܐvʑБđՑՑБԑHK#Ñ>ÑTÑ[ÑmÑ{Ñ (͑*];X ( Y3͑`333 4̒ ̒͒͒4ВВҒ?ҒԒԒ֒H֒ڒJڒ?ޒKޒ*^ 3^+#3],Zh, ;1a1a XPuPYZUdUd`QwQR    i-zihZ..z-Re]ec k <<#G#BwBcG112WBOOO2WkmBCDFFŒlCMŒMNPjmȑjjDlPNْ\ْ\^ϒ^ӒcϒcȒΒfȒf’kkՒӒpגpԑ3ߒגyz{{ߒzՒےؒؒܒyܒ   ĒĒĒ!&!J֒Ó.&Óē +((ē/=/ZГ=ГғғJ.&&דד&ٓړړ'u$"a%ٓ$[7[[a[<4Zw[>[N[Q[&[g[![/[4z[[[nG[3[n'JEX<JOXڙ[#[,Ei )xj[ x  O TSTj)[̚[ښ[X[[i,gg|[l>ddle#>#e((*+,F,*+5N5N7}<~;<;~?@?“ӓI@IKK’fΒcOOQRœѓYœY[ӓ[ȓQRa͓aؓؓƓǓmǓΓے͓muܓȓɓȓƓuۓxxܓۓ{}Γ}{ɓ ϓݓޓޓ&JX "-ēʓ-ʓ'8.8}"ד00%ړ  ”"” Ɣ/ƔɔDD9ɔ̔/=̔ϔZϔG61ҔҔ6ՔCՔ֔ה֔)הݔ$=ݔޔB$B=>&:>2BC=3ޔ2TPTS | l B)= GGP:AFi3AFkykMqMy\tt]t\et+E]o`oe~}7777ݓ77<#?“?HrNrH`E6KKKqyNѓK6779#<<9>@@FFGJGJMNMQRnnR\є\`ڔx`Ĕڔ|є|gĔgiܔiӔnϓnsswÔԔwÔ||~ؔ~۔ؔŔŔܔΔʔԔΔ۔ٔ ٔ'.ʔǔ =B&Ai 9Ɣ$ǔ$ 111ϔ8(ߔ8(Õ. :. Õĕ:ߔ =ĕ ;"ΕI";ΕI22Օ=ՕPK3KSUTU3ݕH?HݕT$BPyt~B=]?eapkS=Aa^Dpe^EVCkEDOtLy} yj xj  xAP]PC^OYY}o}L^ou4mu}V^z4__zh##>>&m}(@(.qq.rJ2r23<QQ=QPQ^Q}Q<>>@@\DDFFGG3ƕNNOӔiƕ•ɕO•TƕƕXʕXʕƕ[˕[Tܕ`ܕ`bbchc˕ƕ͕hkޕƕkmmoڕopprsϕsϕƕޕƕ̕z ӕzƕѕѕڕƕƕrҕ*ӕߕߕ'ǕǕ=*ЕЕ//0וו=40 ەە4ÖĖ1 Ö1Ė5A,̖̖A)MϖҖHϖ)ҖՖKKEՖ֖זJP6+זJI+֖6Y5?V5HMtYQVIE?PSU5RS]5QPRUWg\tW\thgd Uq&ƕ&&5&&Ж&Zd ].Z3w;f;f##%%@nl((n,GɕG,2256567::;<>>7[^EE^^͕bMN;MʖЖۖЖNʖЖWXW̕ssXۖ]ݖ__a]aŖ<fؖf~gjܖŖjkpҕprrܖwԖkwy|ƖؖЖ|yԖƖ'ޖ ,ĖMĖEĖPĖޖ*ǖ)* Ӗ)    Ӗ+B4+ߖB&ǖ ߖʗʗ˗͗&͗$Lϗϗ$ԗJ՗Jԗ՗JLؗJؗ-PPޗZޗF˗+`SZ-'FLb`Li8'LDSL8THIbLUowJ8LiLQl%% b%TYDHs qqs7!IUl?>?*CC/*vx5vNo5{z8{8Q??BqBEݖ]E]ǗIǗIЗYgggLgggTЗTVVΗ}ɗɗ\Η\tїt`ח`a}̗ۗaחїiۗiߗkkߗooqqrwܗrҗwyzyėٗҗėٗ֗֗  ݗ 4""ӗ)  #ӗ36˜Ø6 7$ ˜$͘Ø  ͘) G7G4GԘ4Ԙ@G[GSG٘@٘('ۘۘ(JHJ[QRQSZGRZdUd:<LD9;:gl9GLgxFK{xF;DcKl!v%NcMN%  mmW|x//̗///z5uvu  ""##nnAA*O*//v}36O6~~;;X??XDDĘFGJGJFĘhhO˘jSOjŘŘƘܗrėzzݗzzzS˘hƘјhjҘjǘǘјҘӘv՘v՘Әzz̘ޘ||̘~ט~טܘϘؘ#3ܘ  G<Dl{ϘΘؘ Θ%%=!'٘ęHۘęH1ƙ4I4ƙH̙I̙͙+4љ+љUייؙؙ<ڙۙߙT,&Qߙۙ&RERTc͙IMv}!=,Q4<4mpW mN| @rkrksaasP\Pn^\n$#U$VqVU}tW~3333=343Nc!}qn!@c#AlyAy)l+D//){22{5u566<<u@@A]]NAM+MNPPRRUUWřWYYZZǙޘzzřǙǙǙЙԙЙkǙ™ǙԙșssܙǙwkșwzz||}ܙ}™ޙޙٙٙҙ ٙҙݙ  1ę   ((ә1әcڙnڙWڙڙQߙEߙB1pߙ˚B˚̚ϚϚ0Eњњ0H$F$ךHךٚFٚrښ74["4[7Q"VDVc^[c\3_ QKnK_ 3g]:]``Ot{~{L^L&jl##Ǚ### #^a&jXbgn/v/ba[no8tno$$%%t'xnn++'xGG3355TT<<d>e>8deMMNɚȚlɚККlTWNWXTZӚȚ]Ԛaǚa͚՚cc͚Ԛ]ŚݚlŚݚlmZǚΚmvҚvxݙxΚҚ֚ۚܚؚؚ֚ޚݚߚ2ߚޚ!l!!!̚E̚$̚D" Û "ښnښښښÛȚښAEțAțD̛G\̛2>GEJC՛Do՛؛2j؛88B:9O~`9`747YCYJXv6kk6o??nQ;bbQn;sySySzztu  &_LL&_+w}q-sn+r-wq~!!"#~}F#I.FutI2M.77::<<XݚXXۚXXFӚZF՚aLLNNjΛjUΛU"[[śڛ|ś^{^|ڛ{ϛiikӛklܚ}ӛϛxx!"E››4ɛЛɛЛ ۛߛ$'33(J$'B؛?4؛C؛ĜĜ 6(6ȜɜȜ B0BММӜJӜɜ(G0nݜtrݜ8]ߜߜ8,&%4%]MM4K&]9=>A>,]P;hEK];hQZEOZ*w\oQ"\QOOwT9]=]o*P]}22@yϛ27}7y#~~m#$&u&'m@$+p+/'u/00t5t5z898z9{==>{BBCEKEKuM͜MjΜjT͜lTlj؜ΜZ؜Zp]_Ü_`cŜnŜcٜ]ggɛ]On rru`ÜuxלxۛϜߛ~ÜŜ̜ל̜ ~ۜ. ):?  D ;4<GӜ?.)Ýĝ6ĝ:ȝȝɝ1 ˝˝1Dɝ:-Ý)N-՝N2՝I2AIٝڝܝ ܝ373ٝ7;*UڝD4T*@^^ma<?OtFLbOiP@ivyFHJy  J z   ssV+m^55}o } a&a>&'CCCŝCWCӞC'E0bHv7;z;07dHHKdKٜcNNOOSSV͝Vw͝ŝrwa۝۝ϜxaeǝΝeΝŝǝj̝ŝ̝jНoϝŝrŝ$ŝНϝʝxxۜo+ŝDŝԝݝrݝԝ6ĝ ɝ%(!%(% #)Ğ#Ğ"ߝߝ$:ߝU6"̞6̞ΞLΞ*:ОQG՞QО*L"՞מDמ+%ڞ۞Lt]ڞ,GP!% %%۞X,W<[R<@AR@TAV  o TXWUZCFFC]WZzzbUWYWY iPiWWWcc Y0c  yy;&k&))*+*../33O9|/k9+@@ADDGAGJJKLMKLMƞUƞӞUVӞXsʝrٞ_ٞVs_{Ԟ{dߞߞԞd|ԝ%j)ӞӞvXMrvȞEQdjz|ȞJ|Ҟ ҞҞҞܞ8Ʃܞ !3!aIʞ ʞўў00؞ğ??4ğ,%؞Bǟȟǟ,1ȟ1̟͟Ο[ΟO͟ҟӟ-S֟-ٟ֟QQWٟڟܟ<ܟ$($Cb<PҟO5YRӟOڟOP      5BnZnq]̟B]q^}}HkP l kTBaTO<RP^ןaߟ^!e!u(uПn()@)xD //*L33L5% E`>5>?Lyjllex?ʟMMPPQRQϟRџVVYdԟҞvvvvvqvʟԟYdf؟fiϟʟißmßmnqޟޟŸqş՟ttşxxɟ˟ɟ|ʟ|˟۟؟۟ןПџߟݟݟ 4%  * Sӟ Wӟ%41&1 4 Ġ(ܟʠEĠ Yʠ<̠ϠJ̠Ϡ"Ҡ"ҠZ&E Tؠ ؠ٠ Tޠߠ٠`7_.H7h.TʟџXޠ`hLoeJ<ߠ`okrkygBjgvGX_v z!zZ  U'U p`WpZl'j!!""s=((**HHs33נ<<=۠?F= F+B#=ONNΠQQˠàVˠŸn՟nVWnXZ РUàu_ _aԠa?ŠRWנdYmuZננnŠnԠРΠttڠܠw}ݠwڠ}Π۠֠֠    '' <ʠݠѠѠѠ ġ+ġš ǡ_ʡBʡˡ̡̡͡#ϡѡ@ѡ@͡#١Oš+١ϡ#eܡrܡOXJ)BGJǡ+ZˡB)U7I799PRduluEWzEzYdm&\[ v U[^^b&vb*c~\c`f fe##g~gΠ?j j,,22M|:|Ρ:;;hMРZZBZơHáHKBơKLOhOQQRաkkRΡաYYZZáڡ_ڡܠt_`bݡb¡{{ԡgȡȡllL`ágԡu uvwxݡv¡xסס֡֡Сס  w/M4"-/ϡ=JP/ޡ87ء)ء8ââ7ޡ )ߡ ˢE!ߡE!ء/ˢ̢͢΢͢M΢4ѢIPԢ*+"*N?N+ܢ?ܢޢ-ޢl][V=Ѣ4]VSԢ4JP̢/TSTqaqao`oqcCyceoydqrqpqqq rqqqp33"{{e;"rŢq1pD2pD--/|/ 123367O6==??ZBBDD|fŢKKfMNiNǢ7ǢiǢss\\]^zz^}}]ǢjӢojoСrwۢrӢۢȢwߢ{ߢ{|բբТϢТϢҢ,.  |ߢ ɢɢ'S,  .ţ [ޢţƣƣɣɣ'!ͣ4ͣΣ4!J>Σ'֣J>֣أSأ٣ڣZ(ڣ589CZ#d8YH;@b9#5h H٣S(h;Yhkhb @keghhzhgp[hpF`h z ~&*&[~_*lnnhl_`3a:}a!u}!:%%uq)q)*+*s+./.MMhMMMMsQQ/??C]CdcdcǣOPOǣPУTңTUYȣUȢrYZ\\ܣ__``fУңf£hh£ȣoӣҢorߣwߣwããףףʣZȣԣʣӣ   -  ģԣˣģ,-ˣ ۣΣ գ1 00գ1¤,¤9Ĥ ۣĤ23&5293"9Ѥ&5Ѥ#6$M6"M#ۤ$ۤ<FFNN4Vd''4F:V<9ElE^RDT^7R:97tytDpvepceca !ay ;zzs8g=siui>.|y@|8%;u=%@>+{+m.m.H~gy55yH~;;XX{BbBܣ\EKbKMMäPäPQSSrrr9rdrlr^^ڤǤaڤaccdϤդgϤghФjhܤnܤnpߤpqvǤqŤԤvƤxxzߤ|ŤҤݤݤͤݤҤҤ   ޤޤ?ޤ0ޤLޤȤ ɤ $  ȤȤ'Ȥʤ$ɤ Ӥ ʤ(1(1Ӥ!Ӥ!@٤&@¥٤¥&'ǥ-ǥ̥?̥-ΥAHҥHҥAIT4I٥4٥y*T*7Y78vΥ?68602e2LeNk:kN:\k\D]wk`kkD__OJ\J w  f")t"`i)+tfiok3oskl3y#yl<#$<&$kEE w&s2255QQǤQ<<??AACCDDmbդdbTФdjԤjmƤjTVͥVWYYZWZ]^fƥ]Ҥ|ƥѥ| |f^ԥԥͥԥͤХsХԥsԥwԥwyyޤkԥSϥԥϥԥԥԥԥԥ')')Υӥ0YΥե0ӥ ե æ4æƦ4Ʀ ȦȦ;@J @ JѦѦISMSILG;O!3SBSOL]ObSGM!361B\lmS\6bm=nn=H~SS`H`~KSSK S hS&&&SXxXha_a!!"$$%(()ECEt0)t0"NN%<<[F[]ѥ]]F]Jee¦¦oUoUWӦWXԦͦX{Ŧ`ԦŦ`ͦ{Ӧզ{hhmҦҦͦmզooצssЦxЦx{{|ĦɦئǦئɦ֦Ǧ Dʦ   Ʀ &˦ ʦ&˦ۦ- /''-9*9 ۦ,ܦ19649S9\9H96,ܦ*ѧ411ѧM9#Dl /קQBڧQڧۧۧSߧ;u9ߧ.7\ק#7;+9S.HH=aLR =LR ̧9ާ9xg>2grt_rM~n5u~N  ?kkTllZ00Gwt2bun5wT?O@@@@-bG-//JJ7JO78<8<@>>CCG`G^ħ^ħƧOƧOŖRTTXççצoXYΧ]]Ħx`ާ`a||Y̧ϧfghfkokosaާswݧ֦wxxgާ§ͧhާŧŧݧ9:bͧ  ǧ ' ǧ'ʧ..Dѧʧէ Bѧ :է٧*٧+ۧ*0:P:ȨȨ,@0,Ea%E>Ѩ%Ѩ@ԨPԨQ:3:Q)5)2Mި2ިߨB:5ߨ3 BMD+D;FS;N6b6+ lVldWdZS:Z?VZzJ?W[y[zb  u u{ {(~(p~v4pJbv4!||e!<$c$c((CH}q/qH}/22KK6R8R6UUΧY\\EEIJϧaɨIJQSɨSTTQtt_§w_ӨdӨ¨dϨШҨkϨ¨kըmըҨuܨmרШרuvܨŨبvب~~ݨĨĨ٨֨  Ũèݨ٨ę̀))+̨##ڨ%4 ڨۨ4© ©éé3ۨƩ>Aɩ>ɩH̩̩ѩDF+%+ѩԩNNBԩ֩R֩ة0ة3+۩7۩ܩ&5DARA,'ܩ&cUcy,::KaMbaKxV0Ax7APee"PWhMKbKh" W q^ss^b..rrX<y]#y88888]<#{&{&((),z|,)|II22I3OY}O;;`ZZY`JJKKNNORRSSҩOXX[ש[^z^کީbک٩ީb٩ǩϩǩlҩlϩ֨ttwЩwxxЩשĩ~ĩ~ȩΩ˩ީΩ+թЩީȩ  AƩ 'Ʃ+Hɩ%%Bѩ 9 5۩HƪƪU ʪ9ʪU̪M8+ЪMЪTҪVKs̪H۪U۪-ҪHVeq-..*GG*TVEkE\1\QIQddmWki>Xim>YeW`Y`kn jy  ujnuy ]!!PP]U__}333ש3ީ33  ko%&&%o,,././8899;;>>AAFFHHILǪLMIPPTTӪrrZZ^ͪ^_ͪ8a_Ϊ֪nΪ˩kӪթnӪªqǪêܪĪߪMǪª֪qĪܪêߪުުժ תժת  6NgbD!V0[mc8̪rp44ī   ī ȫɫЫ6ȫ֫ЫOGԫO1ԫI׫(׫K<5(Jɫ<`K`eN*-*-1=1=N6Q@g:@ :Ri bRiWQDWDhYhj\j \ [ &&&VbYmkkcms!!##>%>g%rEpuuE..//2244{P{SX=S=>X@d>aaޫa aFaas@dQQoѫūoΫūYΫqYv֫^ثӫvثӫ^_bҫҫޫbc_֫c٫٫ޫݫޫͫիͫnիnpݫpquޫޫuvvzëëޫzޫޫƫƫ߫ޫګ߫ܫګ!0ޫ۫۫ޫܫqݫ  «"  « 3 GЫJЫ 5Ы"      ŬŬƬBFƬBͬ?ͬ5GϬ*OϬ5Ӭ*ӬԬԬ$H6ݬRK6RKݬ߬Z߬8)a)a9Ce?FC-X-XiD iDT$FHFZFM8FlT{g9FlE{TFMFL P L  Pj]jS[0yk0wko11wo  <<$$2@]ѫ@[yxJxI23J58|89||==??3CCDDFJcJfFfsʬQQ5<ʬs[[\\ά_`a9_ì+aج.h/LopxopƲٲpw֬wͲ{Ѭ{dzެѬ`ìhجެ׬άڬ٬ڬ3ì! جǬ"ȬǬ"ȬȬ֬GͬOͬ'׬۬ĭ'!!۬!H!ĭ1 4 ȭ;ȭ4e1L;ЭLЭҭHҭӭڭB:6B:6<ڭGGK@K@EgWW<*S7ӭHY*<AmS>S 7<Y<NN<AUsNYUryx~~y I rsZ% zZ%b ztxs}Is|55!5<5s55""#bs%(?(/#t/11}s6699::<==?@%ƭޭۭ?ddgʭgʭQQSƭSUoU_w_@ܭcܭc׭׭jjkknoouuwޭwzۭ٬z|ϭ|ϭnحح5 7fDEGi5{ AݭAƮ0!ݭ0!Ʈ44$-2 ͮ-2ͮή>ή7ѮӮӮԮ m;;ԮBYܮB`C&&)')ܮ'`fdhd8,Ѯ78KDGK>Eii{qxqF  .\~R*~Fx\xvx}*xR.l}xx//lv<<x<<Ϯ<<))*+vxHJJ5577SS;S*;+AADDEEIIJJMˮMNRNRnnϮVҮVHҮ\]ˮ]֮֮ۮ\nnpۮprrŮ®ǮŮxxǮzȮȮz®ɮϮ ծ  # !$!   "",ѮYѮCѮ#6-6:>¯:¯0Ư 0Ư8C8ͯ //ͯ1C1hկ,կ֯>SWگSگ3F֯3ޯ$ޯ%B%$F?22G?9P<OHTXH9POT<Y_YZ[tL[ZK vUQ  hvs  a&({u(wuccwh^`^Lt `&d{a7QtkggUtA*kds*,,-o-1y12ey9~b9}2~@@AAf]G}bJJeGMRfRUïMUqqZϯZ]ů]ůѯϯ|ݯݯѯѯί|ίɮkïkooqɯq 0FGծɯѯǯǯȯȯٯۯٯ ۯܯ,->&(&+˯(/'+˯/3+' .=  W֯=0%E+3Bޯư˰E9O˰̰B̰ư0ӰӰ5QDQXWD۰W۰OYB_KtsIYO5B_hID_d4^ ddKCK4>V[g+Bht[vmvmi iN  TTN  s slPlx|o,x>hVhhb eet u77ru;;)bh)A+--./rt1wy1M88~UѯUU@~U@CCEİHİHIJJLMLQQjTjTE^^``I}ްǰŰŰ}lްkǰMklްnʰȰҰȰvʰvܯyҰy||ϰnްϰ!. %! ,5'5ñı 5,5ñı3ɱ5=̱ͱ̱ɱ3CͱGӱӱձPձֱױرܱ55ܱޱ#ޱvP35|2]G5ֱP#a2aNajd]K5P5jױP5AqAduaRaqUiaNSSUauرP  R~_w+_s{y///5/a//1s9ia%i9#o%#oD,E,D001136677:=:=XXCCDDHHI3LIPȱVȱmVPYYraϱٱm۱бr۱бaϱݱ}߱ݱeű}ұe߱űoopqƱuѱڱ_xڱq}}uѱʱʱ  Ʊ'˱=ɱ$˱ $˱ &4&4(²ò5òƲ²2;ʲ2ʲ˲˲Kd'EвѲ+Ѳв'FززٲA!FݲAݲEO9@@J?KB.Og?;>~ 9g +E{ >gtgngBtrgnrfvflgih{g l  {gi %`_/`]/g|/y]gg|y6gg=gG))**--..3GL3ٱLQP7~Q~SS7бYұYBBEEFFŲcŲKLȲDzIJLDzQUKcUpXXZZ\Qxx&x(x\ӲeIJɲ޲ɲȲr޲ers۲s۲ײxȲӲβxײβӲӲӲӲӲ5²#;ƲEƲͲ  4# &ij !ٲgٲٲIJٲӲٲ4ٲijƳ@Ƴdz 2$@ .JK4ѳ2#4ѳG564Gس56س/</;>ݳ;ݳ"T$>%'1"%v'2hT1HlOHOngkg9_=9dS=SdVoIMMobP b PY+uqN,qN+z+}+W,WVkuY{z{c}?c""#p?#p))Y*-B-.t.ȲL6*{67g'7<>ZCC~GGJIJKRRVҳóVrrYrYr]͸óónW˳г˳fгfjó˳j̺]ooԳrt޳tórֳӳz{óó޳zֳȳҳóȳڳڳ    &  $dzndz1/kdzѳ1<ѳ$$&´''8´3ĴĴȴ&ȴI˴I˴̴8̴EO8LAE4lִLX8ִشOشٴK9ٴK5\IYXP^p8Pimi\5pMllDBDMkbdb|  u  v vZt*ó*˳*c*lk sukskghck!!$$'gk'hk)l-l-)N232N737;;==>?BBC>CFG?GŴʴOFOWƴԳoWXŴXӳt__ȳ{{8{k{{ʴ{ʴglѴƴʴѴڴ۴ڴln۴nմմʴwwzz{{ɴɴ״ʴ״ϴϴ ϴϴ  /3´ȴ4ȴAȴ&0δ&δ0ʹҴ4Ҵ49ش5شܴ+ʹ 6ܴȵ@@(^6m@׵:ȵ(׵صE ڵ۵*ص:^]BڵEd۵J^dj9D|j+@:@*@Z J@\k\D@SHkNH}~} NI Sk d]'pi,`,`xh131hf88f%%>A'))*CCssLM55|7*LMT|<T>?@A?DAIIR7ڴgggg@RDYY\ĵĵ\__˵aaӵzeƵeƵٵkkϴ@kI~ŵzz{ǵܵ{ǵ~ݵյյݵɵ޵ ٵ޵ & &͵(! ͵( 4ε! ε ,2¶Ŷ;]۵Ŷ:ȶɶC# ɶȶ¶9,4CBֶMֶ׶MB׶EN8ܶNܶG""GE#O+OF4;4.c+84F.`i`fXp =g=HhfxgLbjb}h|oL|i} i o''-'U-U0l0luHc+Xc>>˵>>ŵ>ܵ>|+1III1Iu|Q|Q>WW>??BBӵaHIHKm϶ζҶmҶppYYZw϶wжxжǶxͶǶbͶbɵ~~4~#~8~c~kkllssuζuvvZӶӶѶ~Ķ~ѶĶضض   .2ö  ö:Ŷ%-̶2̶ -۶ @·!R!/÷/۶·÷ķķ.Ƿ%Ƿ߶߶0ϷϷзз20շ@շRSMEEM|S[_^_[^j|_Rc3^cD]D]`4y_T8T`8[rGi_rtJtJofoamf | a y n_iU(+_(nzU5zqqjj5 $}$} ?yFFFKK_KKKڷK99;;>>@@DDFFHIIMŷMpƷgg˷HT˷TpWW]ַڷַڷ]xԷȷԷ{d{ȷdff߷̷ҷ̷xַŷҷڷ߷ڷٷٷxxηƷʷηڷѷʷѷ޷޷ݷݷ &'&ӷ/#/ӷ(5,۷øøĸ-5'۷,ĸ-̸B̸͸ϸ7ϸ(#34G7GmKGK)<8B58)1<12U.X.LX02GjV C jL0V E N JE?P?SlJONqYiOUGSiCGY uqQP ZuQZww^kl33k:y"y:"ho=hm=&'lm&Dr}'r00{4{}4R[R::>>\[\_\_JJe¸eOOPVpn¸VWpP˸ٸttиc˸иָȸcٸzָɸzjѷ'#5ǸjǸxȸxzɸzʸҸʸظظҸ׸׸ ݸ)(1Ӹ)*Ѹ*G͸$l͸͸Ѹ ѸӸ ù1(ù5ǹǹȹȹ25͹͹2$!AԹ!Aչ$ԹչֹLQֹLM=ܹMܹ[@=[7Q8o}+8+X_l=X^=Nf=dd9M^u=@l^R||MRp,p  kN_fS,ukSt0tvvw$w;;$&~&~yBB,B,0033PB¹BWW=WWݹWWBϹHHJJĹeNŹŹĹNPPQSSTT¹WϹWqQ׹[[׹^^aݹabqϹb߹eƹiƹijklٹkٹjl߹ݹйyйy{{~ݸ~ݹѹݹݹعݹݹѹݹعݹݹ(" +ʹ(' ʹ8 +Qչ' )7ܹƺƺɺ8)ɺ˺E˺̺E<M_Ӻ<9Ӻ7KM7Kۺܺۺ-XDXDDܺ-`UYX`U=mX4=4Y5c@X5DwXmR__@RqqFd wXXdpy$X ZOX,,..ZO6ve6v||e##%%AA*hh*,,t//66V;;\V@@]\]GҺGMպMȺnkknκWκWYY[Һ[\׺Ժ\c׺ֺúcg}giٺnٺnrպrstusֺtú||ккuúѺ}ҺѺͺغںںiҺ"ϺϺ޺ݺ޺ߺ غ ߺºĺĺ""ʺ̺X̺̺̺̺S̺0ʺ0º--:2Ż:Ż27λλBѻѻһһ7KSֻKֻcڻLڻLS߻L]$޻߻޻].<F<Sph1h.Sm8S8O jm9OjeUU9ef_ddS_fw{{w!!vZ  ZTvSt,llVVbb"yx"$$&&o**+x.+p112ȺM.2y8::p==@@[Ժ[FF9J8LXpJq}Ի׻`Իe`akû׻}ͺLݻ qݻgݻܻ vɻwݺ~ɻû~-ػۻͻۻػͻaݻܻ  ջٻջٻ   »»%Ļ(%(Ļ/('(Bλi(/N(q(<$ڻ<)'ȼl(('ȼ1(b(c(,(')0W((((' W0߼ ߼(ϼ(-_Ƽ((((-iT Ng;!guuC#{{XG3qE5C!}MG# }o$  l bcE3M5l>A(o>|>oA(Kmm|F(FF0FFFLK667:7:Y>>Y@]\¼\¼IaIKKLLɼPPQk@Qüļp̼ļpü[̼p[^^zwμwμccͼgϼͼghiik]hƼnksksؼǼyǼynz&OdoݼWݼ  r,ƽ*Ľ**./Լ.3,ͽ˽,Լ3<ټ488ټŽ4Ž̽_CGʽCʽ˽̽&559ӽDӽԽ׽OD9׽;X۽O۽TY\YTԽ&)0)\0R]]HEERHbj__jdb;ommpV= oplO=V eM el`M  - `Z-aaZW? uu f:rdfA?BFF/ANɼL/NNS::<SqC<CDtvBDNȽLLNýSýwSTUqZƽtZؼs_ĽȽvw_`ܽ`ͽddսiڽڽսilTlmmssUҽ|ҽ|½/<G½ؽؽֽֽ߽ܽٽ߽޽޽ݽɽɽ#,0ѽ#70F0G03ѽ8ѽH03[0E00680¾þY۽}0x00¾6;000;վʾ0þվ0PMؾ5!!־0Pؾ57׾00V]*9*V-g-g90F G= cO c=IOIH[ut\@\uw~ W"E@$wW^~"   ^$jbjae4}aY4>h Yfk$>'{'hz$k{o/}/012 }N1x620};;==XpXDDEܽ`EľJJn6˾ƾqQRSmQƾp˾nqRʾSξyξ^۾^y`۾bcc־`۾fhhkپkϾnϾnp׾prrsf־ub۾ٽݽsǾǾuоھоھپ,,.#?!;þMþž žd,Ҿ4Ҿ4.ʿ.<)ÿ<ÿɿmy]ɿʿF3ͿFͿqT- !tzT*8*ۿ8ۿܿ޿#޿U%>]U>]t,@B@iGGiܿ.?ab7feax7eedIjg YIYo$z$l\   lmj y[9ovw6tq9oqCv{CzľE,,./|/|77SV{<}<}VB.B_G_GfؿfSSW߿W~ֿZ^ֿ^ؿcƿZc~jjƿϿǿϿqqw߿w߿˿˿̿~~̿ӿĿӿ!ѿ¿ѿ * )¿ÿ¿ſ ſȿ ȿ""3ʿ-ʿп*п+ҿ+ ҿ   %޿B޿=?=>D*F>D--:PxC0[0!6J\!\6F?J1b1g\EkE:?P?e8Vedm;8Hb[m#HVC?IwRIRofn;#nf z ppoblX2lg23s3gszb7{""{ArA'(B-B'u-ur(t337yy7t9<<WBB]]``LLhhvǿjUUWWXZZ`v|`c|cddĿkkmmnopn?[bo    #..+:+$4$@ >> F @CF00Ckd1/T1JRDJ!TD!8R=8%=%QQe:eG2GY_Y5fX:fA_;sMs;Kq;IMINbN b K *{6{g g#-*6999#~&&(~(EE11PuuP8899XXXhDiDOhjOiljlp ppp:p/pwwaazzjjqqss||# 4'' **6,6*, 0 :M:+25+LML UAUZ3Z3lZN-bZN uZ0qNf5flbS>TZ5S=_=_UuTRRVy$y^HyPPP^H$(c..cXX7`79`;";$"$vvEEzEEtzJt}Jx}5x5Q88Q??BB]]HHggiiOoOomm[[{__{ddeggkuuwwzz}}   0ZV   **''6229; ; %-(A(+@@D6'DP!!&%'P>+'C&CE])E>)FP>FooF=\=\{#{vJ,vhWhJ# fM f QqiN-Q.iW,N-j.^j:x^q#:#G%&B*%*mllGq65567x7UU<A<ADDE``e&NWkkkN'kFkWYY\\__aaEzeeJgssyyz||  z  9A!))!]/)) )/)! )B-X)BGFGP=)X118)I+=XIi2iTQTM q  Q  8?tMt?[tMll@@[x[Zt `Z`K  R m*''4]49o7o]qn q !n9#H!uALERt#u5Hu5L8899==YEEHHIKKgg)gtgggUIUVWVW^^aaccefefuuvwx|x|  ""/-FP,+<+.%4'+%M2G/MP(P(,.<STJSGTJ11G>)&)6X&6'4XKAh:7h?gg?\y\>GqiCFC$FijAG7GY j$   Z Y kqyplkp`];`9 Blmb9{; {bBLm,-}I,}L~t5Z_UWW5~WW_FHFHnoSSonrrZZ`wwww`<weeggiiv uuvyYahyipxo=!!"!4.!!Gy"#!/!.P!6!4L!4C>C>#7J7J3M3/;!:(!P6OL$T$;(XXU080jtU9thIRbDpcp]Dz       NVkt-V5NNY# h!$R.137:;gEPavDYh(yW#`L^($16<FIBK-QTV]Wvv!vUvvvNjzffhooIttww}}R9kbc+1+!M!# 1.,#,.0=0 =O@TC;G;@@84L4VC<R%R2X)O2DO\O)D\Y@V@ BlG"BHqL%HS<@YOpOKnX]O|O$Kq"N$  xONpuZu]Sq|[5c5c>$jjm$m>(x(~+~+sFF112266QQ<<WWAAI^^IKKLNNLTWTWY[[w]]wabffbhikknnww}}{@O&&  "",::GGXG;;!%C!ln%#,?G8^8M,VGZPZE@E.UU.X ?B #CrBrZj``j~G'VRyMCFp[F\G)R ~   \  y'p)s+-S_-_cd9c66e96  eo%%(|(Hq|oHo4|334x66;;<<YY@@CEaCEaMMNNiiiilXlXY[[Yz{z{hihklooprrsGoikls   C^P@7!"!88-/-"/?7$?KT$FTFLK8#\#c#P#BLB#O*80*O]0\]cS cd tD'tggquA>a>.~~v)u^^P   wq(q' A+v+a)fn.w,,x44+cIf%%@@@,,nGxI/11x445Qy@|QG|WW5@__GGbbPPQmmQpp\\/z{az{affhhi iuu~~   #LY ;<  ;838&&EFEF<==#L#O'O'-DRR*VY6YV-L-RLKYMYT*T2g2gWjW6Kjqq>UU]lMlYXY>]yeyezXzYk[ {d{cY k`^Y.vYy/Y`.cmn__77m?v&tp?&?|rD.rntp.00D|w}3453w7574AABBEEGGobbPiPiSoXXSZZxxccnnott{  {    "3"" 6?"$  ?F";"$?;F?+8+ "8[_[6")_?9_)TC[Td^dN<^9M]^]O<uQud_QvJvIN_qIq\gpg\%UR%UM_}0g:pwj=whb|j::b=h@|@x((x++--E2}2335775y:y:=`@E@E`GHcL}LHRR\oo"o?o_oOo\zzcceehhnnGvvxxyy ##, ,     >>00??  B/6C/1;1;!<!%4%UQQ$C$W$o$}$JgA9C98m``iAUd8dRQUWlzlCzFF{f{f o Z W }pW|[p|tt b !==== ==b)D!rr/P PD"??@)@\/FGGKKOORwRTTFW4\W\wHBgIJgiinnttxx|}}|B6< " 4$4$pp- ->D>#DHBmi(BI(%BPJ::+S9S9eAcLcZ L^b[^PpUwApepUZpMp&Z_`pzpupPp_[M[&pp`pYYo5`oy5#`!y$`!p#$krpCk**,z,CNuK4K4KQNQ<<=??XXBB]]=NNPPUjjUZssZvv{{deedllo ssvvo -"&6LH$ #  - "&%6@&@86+8'J'7760V0b9 w9D%DLAX(A:X HFF55 fptI ftI kmHEkE~^S^~x  )r$g TqT gmp)~pW[Wpzxzppp"##pp)p)CM{Cyr3/{6rM3/y"z6QQRR=\B=BE\EFJFJeLeLTTWWYYZZvvv}}llqquuyyz{{z &+&$%$&+%JV&& %&9?:(M'MN9&S.SCC>N*NGNX^TNv^G*NXSN0xq[70N N.N7NNFNNN NN@cNNH@ Ni!i NHN!NNNNssv\\np1n|1w|w""c%%'(*rF'(Ottx*rO99;;=T=[F[FIIJJNNQQSST}~_q_zccee}~ininoorruuwwxyyx&?  &/#/#'.^2>2 +)E   C,K),C<H<434R30:^^:]U]bXbXR0HLkLp >| fpf$sA@pAsVz|Kzc"@$~aY-ax(~ZZ-.>k9hhh?g?g((DDG//4GII4MMTTTTWTBWBDDFKKLNNPLSPVVv{v]wS{]kktt{{ & - ##k+EK00-1HU!?!?2 2 M-M..E6E6J$JVRWR;`;`5335YI*Ie>e7>fpfG7nGnigigo_Z_"ZoHhH Y  " Tl TlY|8hha8##%%s=s)=FFFF$FWF|4)4w8w89UU=C[CDE[9=EKMMPjjKPD\\bbc~~iipprrww~~ 1 2&&   3A32 (( .!.A!BF7G*>JFXJ@7p+H$GI7+INH11NX>l>:Ud:edenqqOsn}fsa@F}g g%ttx_4_kka x%%&momm&om22M66SS<<@@BBFFGccccccOOGRRTTyYYzyzfghfkkngnppttxxlOh B 33))$44'C5!CISULX8XI!SL8:af:HZ__Zl[l[  k eeUzu\uMzM\W|a m        ruW qq`.rv./d/|idvi6Ha5^{s@(J(soJ4459y9TyTC`fgGGH  HNNPPRRYY]]^`{d{dg`gnnoyy~~  )'.!001$51Xa 8-8 %B%>@2B!.J-@O6I6U:L:L2|`*OJ3a =Q3=cKQ/KbT/ <_E_ESr*B<SeWWekM  ##sMl(+lm+fmwf5599#Tb#ke((*j*Ujtt0v0X45V5{4UVvX{sBBC[EIKgEKhhIo[ooo__`addfgiijajqqxxyy ). $Bab_ )>JI+7 )73 63 F>F6@J@L.cL.!'),!QQ^=Y<DrD]^6s^ <JwY =]JshvRovkRcclok,J  lmO -[t** m*h^Z-zZz[n!{!""{$|$CCC1rI1335|57|799==bBBDD`b`RbggJg^gkgRSSppttZ[Z[yggjjkmmnppssuukyy{{n+ # #*>*4 4,',?:66 F U \ :C ?%%FFL6NLNOQOQ&8 U&\C2EHeFEO     n _t;ovtKKIvI ar""X iziU_q=$~==$%*Uq\cd%=7>78>;2=e;*8c_oXcaRRrnwrqw;)y,3=jMjklknppl~vw6[cn>Nv     w x  /  ),3 4?4?8  @+''@-GH+-M.HH<KS<.5SK5DPDP[6c_hh_>]z AB]AdCEdNCBTxUxZxET\x\Uox0*ZW^Wx^0`qb9b9q$o=x$xFrm)IFQ3I)rI3xxxQQQ==@@aCCeafefNNiisSnSs\\]``ccdffhdmhm  ]/vvxx}}~~""%%G  ,,  :!:A:P:!?D:#AP!TU[UE:s:D[#?T+B+BbLbHa<aEL HV <V|:G:s`Ga|kIMee zzMm$I  k P-|g''i--gy-i448{y8{w%%w--uJJ39W39;;<WXX^]^H]HIJ<jPPjmmmXmXZZIaaccddJkoorttkr:    !! ?++5+5??(,,/G/G"OO&6 &"6U'U :Q':1=1V=@`V0R`@RApS  KA`sgpgsSW[wWLTiK`*T#[MjyYwi#u$M.]]uWj*u-\.2zv4v$Yy\24zw B x{>>xw''B+{FFJ+^7799<<=AZA^bbddQQRRUUWWYY[\]\][ffkrkruu   !!(($%%))/*/*QB0`DJL-JB/-;*DZ;ZV;V&PwF&;P;^0_^K_KF;lpl@@p`?LtLHeNT`pSN?pig,STaa,jibHpgbjd::!======nCCep!nIOIO6:6:;;Ych]HHcLLMhMQSQUSq[[\^aa^cdgghhllmoomvvyyzz($  /;pb " &#&  *$*  $7++8'288'%(%(,)),N0?OV99O.VD80W0-t.e7*b8W<i5<C4C4f@N8?8D8b8@fX5idpXi-O  n  uujqeWrbrsqjpiAkj!!k=>wwAs,,tJJx33466{Q94<<>]A\\A]HHddd ddd|TTV`9Vy`aa}|~~mmpp}xyyx"#8inj2  (+55n""+'B '//)B;):I;E.EIUI:UWZW=CZ=P]c]cfbfbdQd2 t G2GStqtS#q$RR?PCtYDY^NN?#D$N(^[(x,{,-\[\1_1ee_u9">~>>>J"uFu~FH}J}5-::>5>AAEEGGJJKgKgRlRWpWlaabbiiBpprrtt{{||       ##&&$$' ICQ '6% % ? L++3F3**;C-,!,-d_!N 6Cl?6dLCfM1Mo 6fCkC`CoufwcCuwHk`}S}c hl hVV(X.eX.g00gq7qy7ejyx<>$><j>+zx+z//5JJ$J588;;TTCCEEJIJbmIQQVmVXX[t[t`t`aaffgjjgnss~~   *',R'Z)&) %F;,_ Ao * ,d-=-!22Dk1HW!=4H,4NN.RT(66(MTM,SZ A4FbFBSb BXSodkzezPp PU    U Wv3uulm3m!v!;h>(>h(Ktt+E2+wwqqK2373y7Y==Y?@^@^^IxINNPPRnnnnn>nsRsx_{{?_ffhlhlooppttww||&%"  " =D H.9>98A8A < <#56*M#6 >CT/GC$TGO:ep/DOi:ib4DiJibgiJ;B;BgyKxlvEKvjE}!!j }  Vu VWeW..0eY0Yy33 mq& @&m@yiz,,z.00r4466SS=BUU=BC`HH`ffffCS[S4[w5ddffiimmmqqy(yzz~i~ !!%%" 5* $3M$  $"ixu "++848INIUN?::;?D;#UW\#WK`KD''1e\OFeO`1lkWqluouoA^A^(v|svJ)|xxa_t/*_Qs()aQ*r..t/.rr}""##}CCC"C3C}223453{TT<<>YY[>GGgLLgjjmmmZZw]]wbgbgllmoouuxxy{y{  NFk/ (( **$  $/% :%? ?67-  -7D6:C&1IXD:IBHB,;,;[JaT[} Tfe@&:@8C:fqe 1:q9A^PAPs|K|KU!~}}!! ~ nnrVr_z\_{55=5Ezk\=$k$p&&p()w)wEG//G6M6SMS;;??BBFFbbKKMMQQmmm:mHmYY[[\\_d{{{d_hihooss~~    %%7 = X89^V=L'L' >,OE >O,:b:bsU.<.g<gj@]Ac@NjAcEOCZNClP}Peef lZ S  SfR((((n^1^#71n`N88#Z[-BBBBBB-0p016167}:XX:@@BD`M`DBMNiiWooWooZ[\\``eegghkhknnuuwwzz||}  7> 0F4bgOjZ4!j))?5]C5CPQOQP8OH$E$AaA}aKEKH8*9R*]9]R l??;lFmom^pipSi{IqrSrI Ys{s bYT^U^d_xy xy7d :$$>>~++JVJJJ3N=X3V=>X[[E[E`KKMMOOPkTPT[[\\``aa}e}heoopxpxzz}}8ERh !#0# --2,#2,0#9 #D#-LNCB&Fo;T59pq)Q;Q7Fc ?7]9L] DL&FXt8bNLUC8_tCLBLcXy~?Xu&Lff s5L )LfuUfUUUk1kUsWW1ddb""*>>#>L>X>*EEEE/u1Ry6v69vR==9@AA@G/GHHO1OPPUUVYY[[\\w``b~bewoeoqq~tuut)23 SV>I]Bricvxy)##+}+&2 &5<5;3;;7SU> T% ZZW>]II8843^?Xr?iBaDaDbNLLN%T  c^X c vxy11111__Ch$w$%%'hC,'y,..113}34|{4|d==AVADHDfHMdfMNNRRVVWXXq__`ff jkpk`pqrssxxy!Wqyj  r <-7"-!255/>TW)># T>)#&L&49X0>6(>7>?>+T8>0b<b<(6Lt>9Lz>w>?T K^K^ 7 Z8l>>>Z@gBtg:[[hwO O   z''wh*l;{3m|C3m !;: !w|Co}F{}*tHFF6{68Q8R~QAABEE`HIBILHPPQkYQZsYZss__cLcdeedkkmmppww{{ "2/  L+ #'#77 - $9$9-1D2D12DOODGD@G&\DB`7,F,SKKRnRn5R&DFS5:R:q\Dt]qRt`D]u}%u go!~!gV V%O~y~x~yx]zf"z!"o!''(**+(+4vLL46677TTXXBBEEaKaKvNNOkOkkXXYYaa|cd|dllcrrtt'DSR]~#%)%#,G,:/MA::8:&)>&>$/$)MA9L9Z;Z.-eC}0;C0[n[nSf-o.oeofoSohoUoeooeofo"gosoheU(ooo"oo"#&s#g&'oDD0o's022355OPWW??YBBDDFF3HIHILMPMPQQPXXwuwbub~~ggLj) qrt !tjr4q 1 oGx   8 $$// !4 L 1G%G7*(G%*7(: 66G8+:Y@d Y@A`ASG9l94lSTN];]xRcZx;GNGTG 8Y+Ykx ZS'RkZmsmxxa a ##%}%u'){),y'u,sx//0OMO}x{;;VVVAAEFyHHEeeTnTnrr rr rrvavabddfgfjklrklrvw|vw|}~}~          -- 8Yd`886.6156+2+196.259UCCUXPe"PcX"e3h4D??B34GmoNnN[GcScnp! ]q![pom t&sq&s(Sx{{(**x00]t7iic7yc:J:y**zFFJIuIzLuL77VVW>?WE>EGbGbKLWjjj j8j6jKWLreeffiikkqqzz{{      '') 00H )!!H;##;&h&NDB:)Omc""N:,.-O,@,.gVgjprCr:O@ljV=IQ^J^pVoP o vshhlu=Ium  ##?????N?QEt0t01R1|R8|==8BBDDEGGEOOkkkTWWXYX[\\[aabgbgkkllYTssuuwwyy}~~} )  G  *6,6 ,,     I9-V 9CINNN):<<NN2N!N:}NNx>NN NNJmNMNLPvsNHc NNNN:N=NNNN>xFNh Neh eRN HN-NzN.nz)Lz.FnpcMx!{dd!"$r$p,@v@EE,Jv{r|J4456|="{T6=@@BB[aa5MMPPVVXXYZ_YZ_aay~~ggjjkkrruuvv~~*  )) -7.-7/>1 1:D :E/.G>.GC8JN8OOF3#;W;TI^IH9bQ93FqQ?q<#FALSNJS?A`d`TWK ww[ K'c['cd]**\\eHW]2f|2i| i V!f#$==@@pp+#+xsUR$x66hR<<=@U@CCEEFaaaaFh=mjmUUWmW}}inntitvwx{{vw .CJF)*>x  %(E%D/&/"00)*>-? W-b?d1^ ?,2&<>1L2A`34BL `bcbBc hgegkkjyHPPyH^jGmp!!!>!!!m^,}^s+A+}34`hyIye"e"K@( '(I-K6677zS#??%EEHHIMIMOSOllqqZ\\Z|~|dd~hhqrsqrsuuyy&"(   '-#%8>8@A A L;@>;$>>P>B><,>!1G1!^PB.>,X>X.N9]==C9>N>Npek]pekzYo` z  )o V^)+_V+_^`z6cbcvvg&&''w*{*E2EEw{244Q|Q::[[DFFGDJJLLMGMQQSTTWWssZsssZkklmmlwxw{{x}S $6,"<<6,//< +5;) 6B+66)?B?0RR#0-!XC-!#[Y56Y9U>fAf AU~;6\ ]\s]@PEs=y=bP@|Eg|nyVnV[X^_$YX`~$^9Xb_.ba.`g1|4a4g1~""&cc&((**+,+IINN,99;;==AAGGdLdLMiiMqqXX]]uu}}6}?}X}>}mmw|w|    "      55)1  )'-'I34I34RNRN=75##57TU6[T5U6[5.dSk.SfpOfPVVPY>llQyxy\"Ok   QYkWnWWWWW 2nt#t#==<)>k)+,<. ,+445.5;;2 !$-aa8NNPPWKT7\WvXv^^_{{_{mm  5dk  1-! $-1&1&8*8* 86??6@22@KK99p-/M/MQx\T7\Y0Y0W    n  UwUw\rBBrXOjOKX z  cXzjcu {b{bx\a~a;;;g;A&A&oAo--HGG44Q::Q=V?@AZHZV=@?OOQUQAUWW]]``abbamumu8T<^ePj Yk o!!~+//33 8  ; ;8DDT<XBX^<Be>Zj8>u x TPjJppJ~gds dqjqF{F  j      YRRk jon5n577k%%AAAEAE-v-v22477S~4;S;@@\\GGHHffMPMPQSSUUQ]]^bbee^ oo 9! J"B#ITD  L6+ 00<..9!J1CZ1/E/EJ"B?RR#?Is{OKOTDV8L6\8V\:N=N:vnsysWnvfnyjj  rnX[&X&xx3fr W`32iwin`""wnnn v))*+np*1p1t3+3Z{9SY9YAC{Zc^ckukYoAYuC||f,fhhjjmmnoost'stn < ,%.C%':=&=&;K@;@> E<## =E^^D<D'2e2/epeQe/[ wiWeeXewpdduuBrB{{eJz J  Q W+et+0Xyeq0q5k5vke|ee?"$$x?"'vx++,--IIM'yM,|>>D\\\DFFGKGKgglPPVlVYoY^a^aeegghhjkljk~l~.:>^ e::  A ?A<?A<ACH(iH /!R! `(r]Ad][\Ed[zCA`RX[X\88[JAqmqIZL_i_Ix   J[ sTsbi.U bu.UuvL[cvff##$$n''((*+o*p1n1+55889pB9BDDEEHHLLhPPhSSUUrrZZ\]^]\}}~l~^lppvv AR[Zi! ") /)"   22MMEC"%&>%&::>VNVm_`3";_;bC3,xi6[mT     " j i,bcm[uju{~~{dqwcO co' djtn..t99s9s'wj'())o(00224579UUUUUU4F75FGG9ffSSUUWWZZ[[adadeehihivuuvz ! z>N`b*  * + /"":, !+.6;-3-,+66#1NONO:+1PNP8&8.+#+?M?<O<V<n:=@=lNljxj~~NyXm X no))noo{p{pgg{!w!$$&&p**FFF1w1JJ59{9J:5B@@[B]]^^LLOOQQqUqU]]aajjttuyyu  +Nm{/  "!3;"#(#'('%6060-%'2&MV@- /FC2C/ <,<,.88.+)+F)3R[^x34dl^4y[RkeekfdGfgGqlzRgq_H_Hz VV~  n n~**WW`?X7`7:::R:~::X@~??EE00sMsM9Q9:<<=C?:YC]?bbOOmYmUUrr\\]]``jjmmoossttxx~~/./*1*(;>; &   BB%%DKEED")$)@$G62'K2AZPR6@PA[(1 n3S3S cYiHc|"Duvu[RI!re!nRr_e _ t ,bWbgIvWWg,WY|77{ { pd=====.=CCi|-pC-L}dJL44QyH|Q::;;JBB}yG`GIINNQQUUqwq^w^_w_hhmmttuyuy||1& 2>>  D@ 772G!8'ZR==!??"330*"0%9%9[O|v[>'&'S&SObOb55OdOdJW   O z  <ixxz<wvYw#Y`V`Mv$MV#R$JOPRPcpWp}gZf{}n n ;#g#$$fC}ZCC0{cz022T5Q5T<<>~>]D]DGGIIKKNNPP.RTT[[~aae|ehhiinnpprrvwvyw{y{      8**(    *&&% 33)  )%'MM./i1"SE:1/"/.SH4H:Q^^++EJQJ6dkdWfmMf~~kt}tk}LVk LU   VX]XW]kYbb#?jj?#z))z,,-uuu\N66RR R'RRkRA[A[[G\G_LLMSi_MSTTWWrYZwwwZwYeemqqmttyyz(    """$"."%"F"\"""$/E4*.*00//%"DHDF6"&PU&w"m""1+UP3_IU31PjW :o4:+_YI_j_N||NoKld#l4_\VVu-----55""%%?))~C.kCk~./Q4w/4KQ?::<<@@CCDFFGDGVVXX[[]]^z"zzzz=z^ggjjmmnnuxux~~ H$P_od 00  8=801'1KI9IK=L393JJ YPLPYQ &6&6?YJYb,-,-YYYoYYY#YbLY1YkQiYYYA]YY\A#\ YO Y8 YizkzOg Y#t# Yt? Yha Yf Y Yb Y444hz  {z'{lo&l&'(.D(w.G1{zzR66wR1UU==BXBEEL``LMjjjMpZpZ\\]]``acc2jajlluuw{w{~~$',9- zCXH,!%*!/%2)$C$<)<-,DWF"XW+DC"3XFCYYG99[0d^3N0dN_H>x>_x@@OOeJKe|JIp}o 5s7s'yw'b}ykbk}57if#i#.ABBAK|.//MMMMM,M;p|;==?gmEEHHJKKgRqmRqYYZ]]``bbccffggqqsstwtw{{}}Z  /*!''11+4 8G[8:3 %7":%^3 B4 BMAU7A[V "[! 1I|}fDFF9D>eTeM XjXU >dzPGdjPz~~mvma a  &&x \|_^/|i^_loCyGj\)??yn)COl-n-.JJJJJ JoO.>>@@AAZGGhLLOhOQQprpZZr\_\_`a{j`jknnoarrk!1:V  !%!   // 0(0 36:6327  2H3<F<F##9T8D8NNj~I3HIE"ER3C3Ri3CvxiP3l3i=3J3S3"lP=^CJS]K ]  {  {mTq Tdd%ee%''p.p.M33MU99:U:AACGGCIKKLILjSSo3ooo(oottydyccdffhhiittuzz{|}}u{|% (:7)()#0D0(,81;;1  #(>,(8(*MB&BM*&>(>4Y4Tx(Z(+a+(OKmqknZakPpNggpPTYxeFeHFHJ Q  Oa l[J..Q.rr_!!ljy&&y))l-oNn-.j.~KK[99::>>DD_GGIIKKNONoVVXXttt t~bObccqqssxx~~V  BYanp/"44/5/+;8;5#*0*8"/<$/$=CC+/#/</=/F7/ 7@aS/T/Jna @JSTP?EWzB?BWPEiiz%{{zl| l  |%'QY'{ hzzvhYzvz}fA}!``!"r:'r"'mAzmHHzzz>z7Oz7Q|Z==>ZBBCdCecdMeMOOTjjTppYY]]^j^ccggllnnuuyyzz/z(v     ((0030(.(3.8#(D8 1(F,#G,G1n-(b(F D8-9$9?2?$2AI(dhdbfLfeiIervrRR{Soj%ofEE{ ""  m%)|QQ)Svv m}v:":|"#>&w&'*wp*'sspp}4466<<==WWBBCHHKKMMNVCNnnVYY]]azaccgghhllmoouuv |vm|-$Ah 8  8 7-??-PLiUOOUI$RI+$WLjR-+LW7-9i pTp9>A>[XJ\}\rz_}rp####-#Z}_^ZdXiqqdjjw;s[iDwJi;x&&xCtC+--D+t^}1yQ6Q6Q;;??YDDNe``ccNeQQsWW[[\\_|_||hiimmnrrhuuzzn   ":  "  #P  i}<=<<!=>=!Y=H.H%I%TA/Y>(=()Z@2@zZaJaJRaRCaja`a)=Cj]OCka]^^/IL    `y+vak11111wa v "w"#'fl#l'(**+(o+11334|4PP;;f@o@ABF\AFHHgOgOQTmm\Q\]T}}Bjjkmnokomuun ~~ =a#    .I& &)E$)UEY%J2-D-=JIU$Y%GGCOLfZfDScbbcESZ ad VaZgZxZVdghhplXl x  x  PZ|ZP|^^|4 xtt "" i''qs))q--//22R<RQQ<==W]Z]]]]KiKOOQQRWWRZZuWuuajajkkttuvvuzz||}}   1$I=1:!:C$#55>3$@G@1BGBS;S&4E4p\X1U6U33s??Xmbs m&s\sss s Csss Cb"sss"" \VYs V  r r   ssc~   c s ! ss! ) ) + ,  s s$ s+ 2 2  s5 5 , 8 9 8 9 > > ? D ? D H H J J L M L M S S V V W wZ \ wW d d \ Z j j k o k o q t t v v y y ~ ~ q      sP                            !   (  # (        $ >    - %  -     G6 :  6 ;          E ;   C 6  XbY      P   K  N    "  P = I  =  P  $   ; P < X   P K P N P " P E P _ P  E Q P  < F P r P | P  _    p Y  ~ ] P  p  K  F  Q Y   r    |     R O    R  u  ]    l  T    x [ 1 1      [  5 5       ? ? ? u  ?    r l  - z -   / T    2 2  / { ;        z  ;   >  > ? ?    E  E {    I  I     M  M O  O P   U  P  k U   q q Y _        Y  _ ` a `  ~    ~     h   a    m  m o  o   r  r       v v      |  |   h                                                  %       :                   '  &  C        &      ) % '      6 %   )        6 3  I   #   < <  B *  ,  3 X   B # 3 *  F  R F    R  J  4 J  =  4 S   H H S    G G C X  5 X 7 W , 3  A j X = 3 W   7  5 O    j K 0  q l 0   L L @ ! V  K l  V t  q   Z d x   A C " x  V n ] x t $ Z  b  n @ ! d "  ] $  Q     1 \  T  .   . b t \   / c   c  1     k  "    " D g Q t k  &  >  z  p p D  D   N   I  I &   I T t   z N [  6 6  s8    U ~  > ~ >   @  [ B g  B  @  F         F  O  O Q  Q R R  U  U      r  r ^   r   ^  y y    c  c   f  f  g     k  k         s    s t t  x  x       }  }                   3  C  t                                                                   1     1     5             5     9     : ?   ? 9  :   G 4  G        V  <  ! 4  !  < W V  W  2 C    2 N H H   N 7 _   7  D  _  0 = - T -  =   T  A m 3 m    ;  3   S ; m  D C Z p l p  A v p  Z  y q  y    l j z  j    u     n    h      h         v    { ]   8  8  8  8  8  8    {  p (  l  B   S m   /  / (  3  3 5  5 7 w 7     ;  ;   >  > ? A  A w      F  F   I  I K  K  g  g  g 4 g C g   T    T     o     o \  \ ]  x ]   x a  x   e  e f   h h      m n m  s      s n    x  x z  z |  | }     }                                                                #             )  &   &   $      +  )   '   9         C *   % *  % -  m  p  ]      C !  R  <     B   <      @   E E 4   ,  6 $ Z  Z 1 D q   1 z   + Z  2 D  u  n    ' Z   , @ 9 Z 6 L  B  Z  Z b    R Z G b    G d  " d  J J i  c  i "  Y B Z  2 Z c Z Y k X  t   X   t   ~  y {  y          ! " l   g  ?  ?  ? !   ? " l ,  , - 0  -  0  u M  6   M   6 ~  V   ~      V       A  A   E  E   G G       a  f  f  f  f   T    T  m   W W  Z  Z [ [  ^  ^ a    a b c h   |     h   j   j      Z        v  v x  x                                                  #                                c # '   #  # 9#  # # #   !  # # #  #  # =# k# # # # # # # Z# @  4  # L   ' # # /# # # # O# /  $  # # # # #  / # w#   ~# & U   $ # # # j#  & P 1  P  2 3  + e  +  2  k   _    m  `   r  S V  S    q   {  t  q |  i o  g  i t o  d  | %  d l   g O g l %  Y } y _ e u 0  0  0  0  r Y | } k s !"` e m e r e   !k D  "w  D   / w s / { 2 2K     K 7 7  9:: > >@ @AE   A EG GN  c  c    c  c N      T TV VX XZ Z[  ]b [ ]   b  e eg gh  j  n   n      r    r h         j              e  |  s  {                    U  1  3   $$ R B  M  $  $  ((00# 3     3%%*?*D  D  6 86& 81 '& #--1'V   RSWSW + CBOC+MO\\Y= pY pPaO  y  P=ay BHJIHyILyLlyJy l "yy fsftwt^lwyy| 9 9 9 9 9%|%FyymyxFx00yyy!yy/yUy_=U=`CCi_u`qMM gi gSSUUXXqu]__z]z}}ggqqrrwz}zw y1# ?}  !/##21@12"<"<61?@:1 BKt1 P3D1PB38>8!d1EJK?E$2@O1v16N:$Naa``YAYAs ^ tmtDlTlTd&OQQ'vZ&'*Z*[[hhu4ux^^4x;s;#FysHi-iC#yF-LH4{4{L676S=7=>>@A@FFGIILLPPGU|UYAYaa|ffjjkkoo||    ?>22 1,),&5&J8!  )!HCCH0D30<?3?D<RKR%J29KX%JXB[.9[Mh M_OO _chEhchbQQEiNWw WM wbSwVSNSiSV]wh]hlwl!h!$$h&'&**'m..Iw23237799;;\==\EEmaaPPSjSrrh]]yygghjjllmmoqqrr~~  1  58o+" +)/((-#K-B88#86G6.h MAM")U4UF1FSwW)?O ?VDW050a0VAG5OD in pnti tavzpv{{_y_uyszs u  Xy XkykY|Yw:x<#:>>@<x--./006|w@#}6<SS<=>>A.}/GGeAeVVWXW\\aaXggjkmjmyy~~)#G1/!''!!1! %% 1$(4$(*0zywyD@CD:CC@*(M;:;NENEM2?2?""^,B,F3B[4e3Fe[^L9L49nSIHH^I^Sn{JxO| |J^TqT 8{^x^O^}778'{===='K+l+../6z/}lKz677;;>>??YCC``bbaLLMNNkkkk!k(kWM\\W^aaeeY^iikknnrrttwwyy  ,!,^  88 ##<-$=$=RHR0HK K H0[VV(I=I()5B3GDq )l5l BGUD Ulu@@luljFjc  Tco%vT%s/lll}"}o"#l;{l-lllvo-/{/#121288|;;<<AADD\\OKKMMOPSSVPVpXXtpccddx xzz  !    <-$0!!&&*. ' *797(l*T,*L3,*9LTBTRT>NB:T>$Fos$(Q(00_eQ:mmT]5]R?W?W5uZZuf@\)f\Te_b@bbT#\a)sasTY(b33|88888phCp{&&{(C--/r/11t33tOr88~U~UX[X[EEHHIIMMiijjVVWYYZ[wW[eeggjjnwqnwq}}w!  .'  "%$N0))(_0G G"$%  B BQQXJR'J!T!'*~,T*\,]+7+_+\K.].^cK7^@@oYh_sosPSvSvk N   Uf(`PoU1]ylyko`o;t;~h~=y,=No,./8I5.5az8<<ZZZ%Z ZRZFaJFJNNRRWWYY^^_aa|_l|lssuuyyzz      )    X  $'('(+ofl$;*;#c#PS+"!") QQG%OSPOc>I>-V?3g3h32?eb&exMTHT0g4xU-cUfthkhk+P `` I%H&||{v{///b2M0z5f455  !"!%%')Cp'}C-0o-w0pw}|LL787~R8Y]]"aGo)LLGOSSXXZZuuuuu``ffmm  Pcvvxx||  *    (&..&( !$<G=2= 2+=CKCK3~<+JEJ*WN#N*PW5aP5c:M:RgcWRWTvopoYeQb]dQ]d1_   ht_Uu hYpgWepTWit[1u\[jil%w%j)w)++,r,y^7OOO7Oy=S=??A^n``AKKLsLkRRkUnsz`v`zcceeggjjlooplpvvwzz|~U|$ ### #''##//-6-E # #WpbUt.>> a4>MO>.BBMENE64a>MONa*fYf0[Y[*>2b 2< @<C^\h^@ChuFulTS T Xk X i((xr,xd}1m1im;8a;qn*sn*q8sL4L466PPWW==ZFZFGGKMtKryVVXXtrwyMwdd~~~~'jvuuvxx#>^Sk## - ++: - - : CC0b9AC9,Q,<22<QD[L[LZD\-ZP\PF010b313Ob&O;7d } ;swsI%ey|yneb$7&I%|$vw&9]b.^.]_^_blbb#l#@#  1~@~Jg G  J5 5S9SS9i!E!EIIJPJjPjj-jWWZZ[cxx{[c{ffiikkloolssttxx{f  "bAQ0000"0060 6:0G'O0VG$N\HV`:0FjXFKG0$`N`\`'0RO0jGH`TMLR`S~Q~T`SO~RL`%Q%YM`Yp~p]7a}{{7"}";;du??a~u++/I/III55^d~==??@@BCD^DHBJKLfCRYKoYtRHLeefJfkkllnn0`~v~~ $%%$!2!$##<&<'&MKXE8P>8E3X3ZN7N]MP([Q>EU[U d_ (7]79_*9ZX]Qpdp``wyppypS{V|p)Sp p V Tp,T^|)ppw*,/^qqapy""&rpp&r**+C+./0.LL667;7;<</@@CCDDQ0QSsSsZvvpv8vvvZeeffhhmmnpprrntuut   2!'%%EX788F FG8929MG'K(E' ( 8>>`X`L8=J^[{^[H=XN8Jl8kILI{ak{OjN l UWTO,UT,-Wo-yqyov||~!!s%%''))AAP002zq2\wP9vRRsz\FFJwJgiigVVXXtt}t``}nnrrss!      2KE+,M,+XH{$(>$K IK&>( &I--KQ"4KQ4jeaeKdadbffbkkgl<lS^\Sm^mThT~Z\ohtq#poptZ#iqi999+99K9+i+--u336688<<>>@@BC[I[IjjwUUWWxvvBwxxcCcffgkgkttyy    ! $$ 2 !9=9" ; 0 ,;"J4N4! 0 g0N<, JX^XD:M??D:F^MFKhbhpqp]HHr]qiOK^YEYiuL#uL eR e u++.+/jj./vmA8 GvxsmA()-C(x-sG)z0133w88909{zZ{CZ__CIlOOgSlS|}I__``|}llmmt txx{{ "^p  2 9="""'"' 2/=/6 "56="D.*DLL77bqrONYNM:%PMP:W%W+4fE*/a4aR  ;c BfcB;k?k?ewe XXw  r  rwQU   Qs  s      w111111! }! " $ }$ @n@AnA- - . . w2 KTK7 2 T; = = 7 [; " [L M L M W W X X uzxuzxd d f f g l k l k p  p ~ ~       "/.Y                    2      5          *            5      9  1   *   5  1    : +w: > 4  4     3  3 < , I  ,       6 G  9 5  6  I  C   @ '  @  O \  O  h F  h U 8     K C G  N K 8   ^ ?  ^ y Y N F  y b ?  !b !Y  P | !# V !P } x r | !x # V Q Z { !} !Z !S ) [ S ) R !t v !t !![ R { i ` !i !!r !! ! _ j e #!  | #!)! A j = _ A   )!*!+!*! +!     J   J   T  4!4!  |   :! :!     T ]      a     ] G!   G!   a m  g g  g g g  g l  m   n  Y!  n   Y!w  z   w   ^!_! z   _!   e! e!f!^! f! i!  k!k!       r! r!      x!   x!y!z!  z!   ! !!   !!!  !y! !!! ! ! !!!!   !   5  I  G   ! ! !!!!!! !    >   !<  ! !!! !!! !!!!!!! !!! !!!'!!!"!!!$!6!!$! ! !!!"!!! !!!3!!!%!!!!&!!!'  '!!\  !3!F  @!!%!,!!@!!! N!!C!1! N!-!!!!!!U!L!!U!?  |    C!1!  !!!X!Z!0!`!3!6!!X!Q !{ !v !!h!` !!!h!!h!!0!a!5!!h!!a!="h!&!6!A"h!["h!i"h!"h!!l!>!!l!!#h!!q!B!"q!"e !!{! !Q#h!#h! "!#h!#h!$h! ""!"$h!S!!"S!"!W!2!!$h!d!!|!2!%h!"!"!"d!!|!%h!%h!!"?!!9%h!:%h!}!?!!m!("!("E!!!A!!}!!!!E!A!!1"!1"!!!J!7"!!!J!~!7"!{!9"!!9"!!!="@"!!!@"A"C"!C"!! _!!!~!!K"!K"g!!!g! i!!! i! i!!i!!!s!!!!Z"!!s!Z"[" r!!!_"_"!!!b"b"!!!!!!!h"!h"i"!!!!!!n"!n"!!!!!!s"!s"!!u"u"!!!!!!!!!!!!!!!!!!!!"""!!!!!!!!!6!!,!!!!"!"!""!!"!"""""!!!!!"!"!""!"""!""!!""""&""""""!!'"!!$"#""!*"""#"!!$""!!!'"!"*"-!!L!!"!)"%""""""" """)"" ""+"""`!!Z!!5!!+"""I"L""""I""5".""%""5"""",","M"""-"M""-"<"O""<""P">!!""V""B!!{!!!!j"E"!!"c"""j"c"k""k""8"4"""l"J"g""8""J"Q"G"P"M"G"""Q"V"M"W!"l"E""x"|""x""Y"E"#D"U"#D"#""m!!"#"# #Y" # #\"y"#l" #\"""#"###^"^"o"##""#"#"#""#!7""e"##""#""#m">"!=">"""m"!A"(#!A"""""!C"#"(#"2#"2#}""4#4#}"""8#"8#T"""""T"X"""""X"?#@#!["I#"!["!["""""""I#@#"?#"""M#!i"!i"M#"Q#!i""i"""""Y#"q"""q"Y#""v""_#""v"""_#b#"""b#c#"""~"~""""c#"!"%""M""E""y""""u#"u#!"!"!"""!"""""#"""""####""""""""""#""#"#&""#"#" ##""""""##"###""""""""#"#"""" #"" ##$#"""L"".""# ##$######"#" #+####+##"###'##"'#1## # ###O""#!## ####C###C###<#<#,####1#%#*#7#L##%##7###4""g""!#1#:#&#|""#:##### #O#&#""## ##P##.#A##.#d#`####d#U"#"#`##e#3#Z#3#D#3#\#3##e#t#3###Z#" ####D#o"#"#"#"#"####D##\#e"#$t#$k#}#$k#$$p#$$T#/#l#l#[#P#O#p#}#~#}#$$~#T#a#[#)#$$#$)#p#$s#a#/#$$#$#}#$"4#!$#$#!$$$|##f#$$B##&$m#B#n#m#&$n#s#}#r##-$4$##}##}###-$r#"I#4$|#}#"Q#"Q#"Q#"Q###"Q##}#A$###A$B$C$C$#G$#G$##J$#J$K$K$#N$#N$h###h#B$###V$#####V$######\$#\$^$#^$##w###w#b$########b$#"# ####,##L####p$#p$q$s$#s$######q$#####|$#|$~$#~$##$#$##$##$$##$$$##$$$#$#####$####$$#$$$$######1##$$#$##$$$$#$$$#$##$#$##$l$$#$$$$$$$$$*##$$$$#$##$#O##A##$$$3$#$'$# $'$$ $$$$$$7$$D$3##}##########$3$#*$*$.$$7$($#$$($#P$<$$P$%$"$$.$#=$"$E$"$#%$0$)$$0$$=$$)$#$E$$c$9$<$$$$$c$d$j$$d$$$$L$$8$$$m$8$r$n$$$_$n$t$?$ $_$$Q$M$$t$$f#$%$c$m$r$$S$?$ $$Q$%R$$O$g$ %#$R$Z$U$g$#$ %Z$+$O$%%$$$%U$+$w$}$%w$L$j$%S$r$%$%x$$%x$%>$$$%$$$h$>$$%$h$u$o$$$H$$F$u$v$$+%$F$$$#G$$F$$H$3%$+%v$3%$$T$$y$$7%7%y$9%:%;%$T$=%;%$B%$=%$$$B%C%D%D%$H%$$$H%$$J%$$$$P%$J%$P%R%$R%k$$$$$k$z$$W%X%^%$$$$$$$W%$^%$${$$$z$${$$$$$f%$f%$$$$$$k%$k%$$$$#$#$#$#$$$#$$$C%$$$X%$$$$${%{%$$$%$%$%$$&$w&$&$$$&$%$%%($#$($%%$$3$$%$D$$%$%%($$$($)$%)$$$+$p,$ .$a.$$$.$$$-$%$.$%%%.$%%%%% %.$.$ %#%.$%%%%#%%$#%%$%%"%%%(%"$$9$$j$$r$$M$$$%%4%>%%4%%%5%>%%5%"%#%E%%%%%E%%K%%8%%%O%%%G%%%8%>%G%M%%%%%Q%K%>%%%L%<%%%%L%(%#%*%)%%*%e%6%%e%%%/%%/%6%%<%%I%2% %I%$%@% %F% %%p%%$%$%%o$%$% %?%N%w%}$%?%@%%Q%M%%I%S%]%&b%v%&b%p%F%&&S%$% &_% &Z%%&Z%%N%&&&s%&T%T%%&%%&%&&&l%|%%&&|%&U%%[%%$:%%h%%%#&%%#&%%%(&%(&$C%_%v%$C%$C%$C%%%0&%0&t%%s%%a%x%5&t%5&x%%9&%9&%%c%%%U%%%%U%$X%l%%`%%$X%%[%E&%E&%`%%a%J&%%c%J&%%L&S&%%%L&%%%%%$k%S&U&%U&W&%W&%%%%\&%%%\&^&%^&_&%%_&%d&%d&$%#%%>%%M%%<%%%%%%m&%m&n&o&%%o&%$%v&%n&%%%v&w&%%%%%%{&%%{&%~&%%%%%%%%~&%&%%%%%&&&%%&&%%&%&%%&&&%%%&%%%%%%T&& &%%%%&%%%% &%&%&%%%& &&&%&& &%&&&%%&&&%&&&&%&&&&&&&&O%%&*&&-&&&&:&6&&&:&&)&&)%%&)&&6%%& &&&/&& &+&%.&&2&&&%O&2%%]%%v%%&O&%%%%&O&2&%&&*&&*&O&w%%&O&-&O&/&+&&F&&&&1&`&&1&&&.&&T&.&O&F&O&&]&4&&&I&&:&I&4&&T&O&&]&&=&Z&&=&&&a&&%&]&O&p&O&a&c&Q&O&b&O&h%&%&%&%&%&%&&T&&O& 'p&&O& '&O&&O&'Q&'Q&''3&b&&&7&&''&3&'g&e&'&y&&e&7&'g&'&$'y&>&&%9&$'&>&''&''@&&&@&&&B&&&B&q&&.'/'.'q&/'&3'&3'6'&%L&6'8'&8':'&:'&&='}&='&&?'%W&&&E'&?'&E'&&&&&&J'&J'M'&&&M'}&&&&T'&%m&&&T'U'&&Z'&&&&&Z'&&b'&%w&&&%w&%w&%w&b'e'&U'&e'g'&g'r'&&&&&&&'&@'&'&#'&7'&%&r'%&&&u'A'&&&x'u'&&&&&%&O&&&&X'&'&'&x'&&&'&'&&'&''%&&&&''&&&''&&&''''&''''&''''&&''&'&6&&&&'&+&&&''''''&''('+'''(''&'"')''"'''&&'&& '&''9'&';' '&;'-'5'5'&'-''2'9''2''''@''<''''&'>'H'`&&'C''&#''''&'>''C'H'&'7''A'''K''K'X'B'X'L'0'Z&&c&&'&+'`'X'c'X'G'X''''L''`''p'X'''1''c'''F' '''B''h'''p''Q'Y''N'F'1'D'P''_'X''K' 'c'v'i''N''G'O'I'(v'('X''X'o'X'm'R' (m'h'P''O''Q' ((n'(n'w','_'(q'\',''X'q'\'(('(('((o'((&8'''!('!(('&='((j'&='&='((*('*(.('''j''.(0('0(2('2(''''7('7(8(9(&T'8('9('''''A('A(B(''B('G('G(H(''J(H('''M(f'''''f'''''M('''''''''i('&r'J('''&x'''&x'd('d(''''h('h(i(''''l(''''l('''''&'&'&'''w('w(''{('''{(''}(''('}('(''&'&'+'')''''''''''('('((('('(('((''('''''((''''('(''('''(''('((((('<''('(('((('(('(((4('('(()(+(((((()(0''('(( (((D(D(3((((:(%(K((%((( (+(((D''I''&( ((&(((Q((Y''(i''R''w''Q( (((L((](b((]((a(W(L(-((+(N(-(,(<((,((a(W(((:(3((=(e((N(((O(e((=((n(k((f(k((O(#(f(V(t((L()V(n(e()'()P()j(x(z(( )P(e(t(#( )z(/(j()~())Z()~(e(Z(e(|(e('0((/('0()|())c(e(")c(")((%)(%)u((')')u(((+)(+)-)(-)0)('H(0)6)('M((('M(((6)(()|(((<)(<)=)=)(?)((?)(D)(D)E)((E)(I)(I)J)((((((O)(O)((J)(R)S)S)(((R)((((q(q(((('w(((`)a)b)c)b)(c)(`)(((((k)(((k)m)(m)a)(p)(p)q)((((q)((((()((((((((('((('((((()()))((((()()(((())((()())((((4((()(()()())()())+(() ))) (()())))())))3((K(())( )() ))()()())()))()($)(#)(.)#)).)))-((e((((((((@)()))b(())<((H)L))H))$)))K)@))K))&)))&)@))/)/)@)1)@),)M))),)))))[)X))[))e)d))P)N)))1)))e)5))x())2))P)T)5)2)@)))Q)j))_)t))_)))Q)[)))M))r)U)Y))T)r)G)Y)))G)\)G)l)G) *U) *(%)())(%)W)*))W)V)()*)s)*)*s)V)*\)(0)*3)l)u)))3)*u)*!*z)!*#*)#*(?)(?)z))(?)(?)y))-*y))))n)-*.*.*)))))N*){))))))7*{)7*8*8*)));*))));*)))B*B*)))*)))H*)H*))(c)M*)M*N*O*O*)))S*)S*))U*U*)(q)))]*)))^*)]*^**)))d*)))d*f*)f*))i*)i*()k*l*))o*)o*q*)q*))s*|*)))s*)())))) ))))|*}*))}*)*)**)*)**)))*k*)*))*)*****)*)*))***))) *l*)*)** ***** *****)***********) ****))******+** **L))))***)****6** **M))2*6*X))d))N))*2****9** **@*&**@****'*3****'**4****=*(******=*V*W**j))*V*t))*$**G))))e*)*)*)B+)+****)***0*m***g*g*m*9*e* *e***j***_****h**:***e**A*$*e***T*+b*+)*e*0*e*n**b*n*j*e*+Y*+n)!*Q*P* +Q* +++*+p*+z**+z*).*).*_*e*).*).* +p*:*e*h*e*+++*** +A**#+*#+%+*%+&+&+r*T***+**+)B*,+-+Y******,+*R**p**-+*)O*)O*)O****R*****?+*?+@+r****C+)^*G+***G+**@+***K+****R+*C+*)f*K+*R+**T+V+*V+******\+*\+**T+*_+`+`+***)}*_+***i+*i+k+*k+n+***n+o+)*****)*****x+*x+z+*z+ *******)*6******++*++*****+*+*++*****+o+*++****++**+***'+*+**+**+++*++*++**+ +*+*"+*+ ++++*"++*+++&**++3**4**(**W***2++*+'++'++++*/+)+*/+++)++++E+B++!+++'++E++!+++D+<++D+++9+++A+*9++$+*+;+;+$++.+++1+*+H++++(++>+*.+H+1++E+Y+*>+Y+*I+++A+B+4+^++0+++N++4+(+B+P*++0+3++^+N+f++7+7+f+++J+f+*++O+*+++J++W++++O+f+I+B+[+++[++d+d++ ,X+ ,t+]+ ,t+ ,,,+,,~+**+,,W+f+,+X++a++,,+,a+,8++e+8++++e+!,#,{+#,++~++!,+(,g+(,+,+*@++,++.,r+.,4,+++*K+*K+*K+4,++7,+7,9,+9,++++++++@,+@,C,+{++C,++b++*`++++b+++,+h++M,+++h+g++*k+M,+T,+T,U,U,+*o+++*o+r++\,+\,^,+^,_,++++++e,+e,_,+g,j,+++j,++g,+n,+n,++p,*+++++++++++++x,++++x,+++},~,++++++,+++++++++},+++,,,++,,+,+,,++,,,2++, ,,,,+,,+,,,++,+,,,,,,%,,&,',~,+,,,,,&,++,,,+,<++,,+++,,,,),,,,),+,+++,",,,,:,8,,+/,,*,,:,,,3++^++++++++++f++++++++++",+,+,E,,V,*,,,,,,+V,,W, ,V,,V,,,H,+V,,,,V,),V,,O,,,S,O,Y,,,-,H,1,]+ ,L,q,,V,,L,,,r,h,,Z,;,,r,,a,,`,y,/,V,S,Y,-,Z,-K,-E,V,-,,V,---`,$,,W,V,P,$,[,,b,P,-,V,0,b,K,V,,V,a,h,-[,,V,-f,,,0,-f,--,-,,-d,,!-"-,,!-d,,,--,"-,-,{,,,,,,--/-{,/-N,,,,,,,N,,,6-7-7-,6-,,,X,,A-,c,,-,,X,,,A-B-+\,+_,i,,B-,,,,,,c,,,,,k,,N-,N-,,,i,Q-,k,,m,,,+p,V,p,,p,,p,,p,`-p,m,,,u,,,u,,Q-,|,,,|,,,f-,f-h-,h-,,,,,,,,,,n-s-,,,,,+,s-n-,v-,v-x-,x-z-,z-|-,|-,,,,,,,,,,,,-,,,,,,,%,,,,',,,,-,-,,,,-,----,,-,--------------,,,----------8,,-,-,-,,-,,---.-.- --, -,----,, -,-,-,$-,1-,- -------$----- -1,,Y,,q,,h,,;,,y,,-1-------1-9---9--T-L--T---0---O---X--X-#--Y-`---Y--V--0-L--R-V-`--R-:-O-L--k--W-\---W--j-j-\---q-k-`---S-w-U-u-y-`--S--U--{---F--y-F-{-o--Z-o-.q-\- .^--.Z-a-p- .-%-p-'- .a-.}-'-^-.b--.]-[-.b-%-]-}-[-.b-..-..~--!.-!.'.-.~-------'.(.(.--l-----/.-/.-I-J-----J-6.-6.-P-----I--<.-<.P----B.---_--B.C.--c--I.--_-C.-I.--K.---c-O.-O.-g-----g------t--K.-X.--Z.-t-X.-----_._.-a.Z.-c.c.-----------j.k.m.-m.------j.-----k.-,-----{.----.-.{.-..--...-----...------....-.- ...-- .---.--.-.--..-.....-..". --. .*.&..------.-"..--....*..---L----#--.+.+.&..-- ..;...;.-..>.?.....-..>.......8.8...:--..D.....=....\--w--D.E.=.E.u--..).N.S.M..R..)..S..R..R..R.&/R.?.-0R...P..1R.P.G.].d...[- .- .- .- .- .- .1R.N..91R..].M...A.h..A.P1R.V1R..G..f1R.H.n./H./0R.1R.,.~.(1R.U.u.~.n.l-'.-'.2R.-.U.$2R.u.,.y.-.[.y.//[././5.i..5.//z.i..z.."/p."/#/}..#/}.j&/F.|.-C.)/.n.)/.|.s.-C..s..s..F....s.4/.4/5/6/8/.8/../U/>//(//*/+//*///J/7//J//O////N////./N/@//c/l/./l//c/p/b///p//D///B//H/=//`/D/l//B/l/A/R/0A/0`/l/0q/000L/q/l/."/t/l/s.&/.&//&/l/&//&//&/L/l//l//c//l/0/w/0/0t//l/0{/l//l///0/0#0y/.8/.8/#0%0/%0(0//l/(0*0/*0+0.C/+0{/00/00M/////M///60/6070809070///T///T/A0/y//A080//\///90/e//////I0///e/I0/.d/T0/\////T0.k/x//X0/X0//\0/\0]0^0/x/]0/^0/.z/d0/d0./////i0j0k0j0///////k0/i0///w0///////w0y0/y0z0//}0/}00/00//0/000/0 //00/0/00////000////0/00/00///0/z0/00/0 0/00/00/0000///0//0//0/0=//0/0/00&00/00000000"0"000>// 00&040000000:0000+//7//04000)0/0/00<0000@//0400<0040b//)0?0:040000J0Q0/K0Q0/J050-0050/K0-0/00R//J0<0c0Z00c000b00;0R00;0<0Z00/0R0 0/0l0n00l000J0n0 00V000E000m0E0o0w/0b0<0/0m0_0011101e01P010q0110 1p0q0O0{0'0O00'01W0 1p01V0n0f0q011/00W000o011011f00`0e0o0/90v00$1v000$1'10P0o0'100*10*100G000G00G001001110041041110617161x0910000710x0000B10B100D1F10F1G100/d0/d0/d0D10O10O1P10000G10U1V1s000r0Y1Z1000s0U10Z10b1000r00b1Y10e10e1f10000/00000/000400<00o00q00/000000000{10{100001011011001110100110110011011111011000110111101111100111011 1011 1000000110111101?0010010111100111111111>10 1131>103111 11+1 1011111+1110 111J1011,1J111,111H11H11#1Q1?1Q11#111?151Q11_001511%1E111%11_111)1:11)1g1h1_1E1111g11W1111[1{0 1181W1Q1l1m11l11112=11p1`010101011p1p1m12X1R122X1z1q1 2z1 21|181Q1[1Q1|1(121220*122r12}1}1i1r1i12=1m1o112o12209109111#21#2$2%22j111(2(21,21,2w11/2w1/202120211~1525210P1110V10V10V111?21111?21`11j111`111I21I2J20f10f11f11f1+1f111R2%21121J2111\21R21[21[2\2a21111111a22111d2d21211111j21j21101112111&31I31J31v21v2z2101e21z211112121b31312212210122211112222312121M312111 21 22122 211111221112112212 2122 2221221222222222222 22222211Q11m11R11q11122212)221!2212E11:11&22h112&2*21 221822182*2N221N2)222-22222-21.2Q222 22.2!222A2G22A2272W2272V2W2K22_2K2 2_232S222V223222M2l2S2 22L222q222M2L2W2i1212Y2E2122Y222h2h2B2 2Q2p22y2E2w2p233w2Z2i2q2W2'2Z21%21%2 3n22 3n22'23y23s2242s262f2f2222~1121122423233]23262!3t2!322%321?2%3&3*3k2x2@2@2u2*3-3|2k2x2-3.3u22.3{21J22322532537327383<3283~223}2<3=3=32]22221\21\21\222G321\2G3|22I3J3t222e2{22}2222m2222Y322m22222~2222Y322221v21v2_32_3`322.b3c322`32g32g322222222n32n3c32r32r32222v32v3 2222222222}3~3}322232~333333222223232322122233223323:322323322233332233233233323333233333'333 333$33 333333323333"323$33333"3Q22W22E222222'3$33333$33,3,3$3G223#3;3K3;323(323>332#33K33333>3(3C3Q33C3l223331333'333B333B22i2233?3Z3a33Z3333+33L343O33+3j33133L33C3D3O33;33D33303T33@33?3T3E3/3H313Q3B3Q34^3^3s34444{33t343{334d32&32&32&3?3Q32&3@3j3433\3p33E3/3s303\3]3H3j34p34333e33!4e3!4m3l3d3j3A3m333F333A333*4N33*433F3.433w33P3w3333N33M33P3.43<43<433W433343c53*63463i332b3J43J42b3q63z633i333o336333V433o3V4sW4632r333\43\43333633363332~3h43 73h43323l43l4232333p4p4373*8333y43y4z42333$33;33Q33a33z4333434434434434444344 434443443344334433323 43334 4443444433444433 44344 443 444344-44/4344/4444444444448440454434404+4444+44347444"44544"44@443@4j3333433l334484-44T4314T444144Y44Y4643,4:4#44B4=44B44#434:47454,464444344t3444U4942444944H444U4k44c4H4k4>4k4]344>44c4]44K4m445s4s4m455}455O455455K4k454 5u444U4%4u4Q4%4i4Q45i45545 545455545454n444554"5a444"53<4}4k4O4k43<44k444+54+5a44I4v4444I44425425N4{44N4754v4475{449544;59543W454W44W464W4=4W43\43\43\4;5444J54J54e444N54N5e444444S54S5T5T544444Z54Z54q4q4444w4444b544w4b5c53z4f54f5~444~44444444444q543444q54444t54444 443444{5444434 444434484444t5445445445{545454444544444455 555444544 55 5455%555 554454D55d5545655555555455 55l55445 5/55 544555,55 55!5555555)5455-545:5-54<55:5.54<5)5Y555)5E5.55E555854244k44444544444 5#585545 5)55#555]4445=54D5M5K54M5U5H55U5=545%5!5/5K54H54555d55655R5G55R515F554 55155l555Y5F5555h5>55h5e5O5555e5n45Q5O55Q545V5g565}5P5}56566V5 6P5k5}5 66k566655X5055~556?5i55056~55}5j55z5355z535j5656@55555r5A55X5?5)65r5@55A5)6*65n5-65-655/6/6536536465|566965i5}5965|54T566555>6B655555B6>65E65E65555N654c55c5O5c5}5c55c5N6O6O65R65R655U65U6W65W6Y65Y6\654t5\655^6^65555555f6555f65555i655i65m65m6o65o655q655s6s65555555y65y6z655~6555~6656564555/5565,55655656655 665555655556566565556656666566 6 66)55666 6!666!66666"66666"66 66566566656666.6656+6556:6+6 66666:66.666@66666656666A666&666666A6G66G55666A66@6.65?6L6K6?6#65L6>5566.656.606,6,65&6G6g55Q6Z6K6566866066Q6a66d6a6 6d661616S66S6 66g6666t666M686Z66`6[6p66[6M6=66j6]6P66=667j6`6P6]666T6T6p677g6Z6t6Z67b6k6h66(6r6(6n5*6w667(6k65*6b6p6c6r6|5465465465465467w6#7c66p6596#7$76p6D66l66$7l66D666/76F666F6/70766272764747{6076{666666>766666>7?7A76A7F765\66666F766?7666e66665f66e666Q7666Q7666666u66665q6Y76Y76u65q6^766v6^75z66z65z6 6z65z666766676j76j7666666o76o7p7p76r766v66r76x76x766z766|7566666666666.66G66|76z766677 766 766666766667666767766776766666667666 7667677 7 76777777676)777676766)767*777677677%7#66Z6677%767 7&77 77677@7776!7776!77677777=7@76=7:777:77777697R76971767177L7R7777L77(7G7p666676@76R766+7G767(773777.77575737.7U7h6767777[7[7M7+7R777`7U7 77H7s777c77H7}7_77}77I7n7_778I78b7O77b7T77 8d7`7M7d7T7 8 87c7M7 8,7a7a77-7u777u7V7V7,77-78788t7887776278f7778787v7 8"87"8i77$86?7 8f77n76?7$8i7*8,8k7,8k7q7/87/808v777708w7w77687687N7@8777N77t7777W777W777@877C87C8D877H87D87H877^87d87h777h7776j76j76j7X876j777y8787X8\879777\877^8a8777a8e87@97d8e87777j87n97j8l87l87797779797=:777E:7v8v8777y8b:777d:7m:787978v:7878888887887777777 77878778877777878*7777877787878888877877778787!8&7777888 8887878 8788881818+88 8788#8718#8 8728487838828+838488988888A8>8=888_8=88>88888E8887%88B8=8:8=87E898+8N8=8M77n7777888778+88s778%88S8M88S8A8+878588588878 8_8U8=8O78]8T88]8h8=888B8F8=8T8 8888N8888U88:8;8u88;888h888f8q8x888f88F8{8x89{8997"8 9w89|8 9 9 9O8O8}8q7*87*87*89898898999|8q8988b88`89898`8<8888?888<8o88'98?87D8'9o87D87D88}8w8q8883983949498887988;98;979888?98?9@9B98B9D98D988887^87d87d87d888O98O9R9888R9S9X98S988888X9Z98Z9[9e98[987y87y87y87y8!8y88y888e988i9888i988k9m98m9n9888888t98t9v98v9w9x97888w9888k98x98789898898889899999999998899898999999998+88=88q88}8888999999$9!988889$999&9999999898988880988888809M88&9!9.98889.999!999<9999999<99)9%99899999A9%99)9999999A999I99E9K99A99E99999M9M9I9999=9u8899M9999\999Y9C9Y99999C999]9Y9F9P959Y9a9Y99]99q9Y9959999F9H9u99>9>9^9b89`89898989=9I9:H9\9I9: 9a9}9 9p9 9o9}9 : :j9 :o9 :j9p9~9Y9:::~9:q99l9::y9z9:9:y9`9_9:`9::99 :9 :!:!:b9#:998@98@98@9b9l98@98@9{9|9#:{90:90:1:6:91:9:y98O96:8:98:9:9:9;:99=:99;:999B:9B:99D:E:99D:999I:I:999M:9M:99O:O:9Q:99S:8n98n98n99n9!9n9S:9999999Q:999`:9`:a:b:a:9d:99g:9g:99i:99l:9l:m:o:9o:9999i:999u:9u:v:999999999999:9:::99999999999:999:99:9:99:99899989999:9::::999:999::99::99::::99%99:9:::::::h;:::):9::;:: ::: :I99Y99l99|9999::K99:):;::%::9%:::$:.:;::;:::$:<::::<:.:9*:H:::*:P99+:H::+:::A:::::U:::^99u995:V:U:A::5:":K::"::::Y:Y:,:e:'::F:h:R:,:':::F::e:h:::R:::@::@:c::[:[:c:::::T:_9::x:z9:9:X:~:;X:;;;w:;;J:; ;q:w:~: ;f:]:;Z:;f:;;\:(:W:]:T:c:(:W:Z:~:x:c:::91:y:\:;y:;:J:~:;j::;;j: ;";:";9=: ;k:9=:';:';(;*;n:*;9E:9E:9E:9E:1;:k::1;q:~:::9O:::7;:7;9O::::;(;::;:::@;:::@;A;A;:D;:D;E;E;:n::::L;:9d:9d:L;9d:::O;::O;:T;:9m:T;::V;V;:X;::X;:9v:9v:::::::::c;:c;e;:e;::g;h;i;::::g;:::::p;:p;::9:i;:::9:x;:x;::z;::::::z;:;::;;:9:::;:;9:::::;:;;;;;;;;;;:::;:;;::::::::;::;;:;:;:;:;;:;;:;;;;: ;::+;:::H::A::);.;V::K:::&;;+;.;::::);;;0;;6;:&;?;6;:;=;:2;=;:2;;;::?;0;; ;9;: ;>;;;;>;,::::::::::9;::#;:C;;:C;Q;Q;:c::~::]::::::;&;;:W;;;;W;;_;P;;;;;_;P;:;:,;];H;B;H;;];3;;F;;R;3;;R;;;l;;#;6;l;F;;;6;,;6;;B;;;f;;;;;I;v;o;;v;;<;;I;G;<Y;f;H;n;{;<n;< < <U;U;{;;; < <;-;q;`;;<<`;d<;;[;<;-;<;;w;i<;q;{;<;<<#<;<;:7;;};Y;o;#<$<%<o<;$<k;%<j;*<;*<;{;;;/<;/<u<;:L;:L;:L;:L;k;;=;;;x?;U@;=<;A;=<B<~;gB;,D;~;;B<j;;E<;E<F<F<;I<;I<K<;K<;;Q<;:h;:h;:i;Q<;;;;;;W<;W<;;;;;;s;;;s;;;|;;;;a<;|;a<;d<e<:;;;:;i<;;n<;e<;;;n<o<r<;;;r<s<s<;u<;;:;:;&;; ;;6;;H;;;;;;;;;;<;;;<;;;<<<;;;<;<<;;;;;<<;<<<;<<<<<<<;<<<;<<<;<;;)<<<;;<;;<;<!<<<<<<<<"<<<<<;<<<&<< <'<< <<)<<!<<3<<<<<<<<9<<<< <<<; <<6<<C<<6<<<;<&<U<<<<3<<<9<<7<<<<7<A<<<C<<<U<<<<A<<D<<<<<;><G;;o;;{;;;;;;;;><0<:<;<[<[<:<<A<<k<`<<k<w<`<p<<<X<`<t<p<; <<`<<<`<<`<[;<w;<<w<<t<<<<<<`<<`<<y<H<G<<H<<<y<v<<]<};<<`< =< = = =X<j<<<k<<`<=j<==~<<`<<`<=;/<<`<<`<]<v<=<==<<=<#=h<#=&=z<h<<&='='=<|<l<-=|<z<<-=.=J<<<J<x<<<L<{<<6=<6=L<x<;Q<;=<.={<;===<==<<@=<@=A=~<<^<<A=<<^<<<I=<I=;d<<<L=M=M=<L=<;i<S=<S=T=T=<q<<<q<<<<<;u<<u<`<u<<u<<u< =u<<<}<<<}<f=<f=<<<<<<k=<k=l=<<n=;<;<t=<<<n=<t=<<<<z=<<<<<z={=}=<}={=<<<=<==<==<<<==<==<<<<<====<< =< ="<<= ==<=<='<<<<l=<<<===<< ==< =<<= =<<<= ===<=<<!==<<=<==<!====<<=<<=<===<"=<<==8= ===<%=%===8=D<< =<(====<0<<====<(====<=====<7===7===/====<%==+=)==G<<=U==_=v<<<<=+=U=G=/=d==V==V=d==W=R=d=j=d=m=d==E=Z===< ==d==d==E==s=s=Z=_=G=u=y==u==V==o=v=>o==d==d=W=G=><=>g=<=l<=>=d==d= > >V= >=^=>0=R=>= >V==d==d=i=0==i=>=g=v=>>j==d==d=>=d=#>m==d==d=#><====(>=(>)>==,>=,>==/>=/>0><I=0>=~=x=4>:>===K>=L>=4>~=:>;>;>===?>=?>A>=A>)>=====H>=H>==J>K>L>J>=O>=O>==R>=R>==U>=U>==r===r=Y>_>=Y>=<t=====_>`>b>=b>==f>=`>=f>j>=<===j>====n>=n>o>o>=q>r>u>=r>=u>======y>z>}>=y>=}>>=>==>=>>>==>=>q>=>===>=>=>==>=>> > >>>>> >>>>>>>=>="==>==d=='>=>=>=?===z>=>>>='> >'>=&>>>>=>'>>>>>='>>='>>>=>'>>=>2>='>2>'>S>'>%>*>=%>>>)==G==Z==Z>'>y==v==>=\>'>>>]>'>=2>>>2>Q>E>>E>=>Q>>.>'>G>>m>'>>G>>|>'>M>'>>S>>>>>->>>>Z>>>>>\>>>]>>+><>>+>>>>.>5>3>>>5>^>c>>F>c>>^>d>c>^= >>F>>>>Z>>v>>Z>>d>>?D>??m>D>e>??|>???M>v>c> ?M>=#> ?6>s>>S>?t>=)>=)>s>>?t>g>?>x=0>=0>=0>=0>=0>?7>{>>>w>7>g>6>?%?>>w>{>>>>?>%?=?>'?p>>>>>>'?>.?p>.?0?~>0?1?F?>1?>>>>>>>=O>~>>G?>;?>;?=U>=U>>>A?>>>A?>>>>D?D?>F?G?>>>>>>>>M?M?>P?>P?=j>S?>S?U?>U?>>Y?>=q>Y?Z?[?\?Z?>[?>\?>`?>>c?>c?d?>>g?>g?>>i?j?k?p?>i?>=>j?>p?q?`?>>>q?>k?>>>>>z?{?|?d?>z?>?>>>?>>{?>|?>>>>> ?>? ???>&>>?? ???? ???????>>??>?????*>>??>>??>???>>?>n?>?>>??>>???^?>?>????>>?>?>?>>??????4??????(??>??->>? ?(?4?> ?? ?>?+??B??B?+??K?<>>??3>>c>>e>>????=??J?Q??J????H?L??W???H??W?T?'?>'?>'?>'?>'? @?s?a?@r? @e?h?b?]?u?@@@?@@^?t???8?@@o?o??#@?#@????@n?.@?????m?~?8?t?>G?e?u?.@/@/@???4@?4@??7@?7@??;@?>U?;@>@???>@?V?B@?B@????G@?V??G@>`?K@?>d?K@>d???O@?O@P@??T@?P@?T@[U@????>q???\@???\@]@?x?b@?>{?>{?b@?{??{?]@???k@???k@??o@?o@??????s@t@??w@?w@@?s@???|@?|@@???@@?@@@???@?????@????t@?@?5@???@@? ??4??+??K??@@Q??@@@@?@@??@?@?@@@@?@@@?@@@?@??@ @@@? @@??? @@?@ @@??%@?-@%@@-@@@5@@@?@)@"@?@?)@@"@'@@"@?@'@L??@?T??@@)??a??b??~??u????0@@?@@0@E??@?2@V@&@V@S@V@@2@@R@ @?&@ @?C@V@@R@@a@L@W@V@u@V@@a@L@@@S@v?@@H@V@@C@`@V@@@@6@@C@n@V@6@8@@@X@_@@@@@@W@N@@@@N@Au@A@X@AH@Av@V@A`@A A`@?#@ A?#@(@n@?#@An@@(@1@m@m@@AAAp@p@Y@Y@1@Av@AA@AAA#A@Ax@@@#A$A&Ae@&A(A@(A?B@Ax@,A@,Ax@@@@0A@0A@@3A@3A@@6A@6A}@~@?P@c@}@?U@?U@V@U@@U@@U@ AU@@@e@@$A@@c@JA@JA@@@@@@@@PA@PAQA@@@@@@@@QA@@@ZA@@@ZA\A@\A@@?t@`A@`AbA@bAdA@dA@@gA@gAiA@iA@@lA@lAmA@@?@mA@@@@@@@@@vA@vA@@zA@@@zA@@|AA@@@AAAA@A|A@A@AAA@AA@@@@@ A@ A@ AA@@@@@A@A@@AAA@@@@@AAAA AAA@AAAA@A@@@@ AAAA%A+A AAAA@AAA1A4AA AA1AAAA7AAAAA+AA@A!AAA>AAA@AAAA:A:AAAA-AAAA5ABA@AAAA5A^AAAAnAAAAOAAAA8@@AARAA'A A%A@%AA7A4AVA8AAVAkAAA_@@AAAUA)AAUA'AOAA)AAANA]AA-AANAA8AAAaAA:AAAAAA:AKAqAAKAAAAjAAAAAABAAAAAAAAAAAABBBAAOAAABBBBABBBB$BBBBBBBB BBB8BA9B8B7BB!BBAB]BBB9BBBBBBTBBB$B]AAqAAwAAzBBjBBBB,B:BB,BBBBBBB>BDBB>BBBB7BB!BBBB]B=BIBBBBBB=BBB@BMAB@BiBABBB]BSBQBBBkBBBSBBbBBkB^BBBBBTBBzBBBBzBB?BBjBrB}BCrB}BBCCBbB^BBBIBCsBNB C CsBMBBCMBCCCCtBClBA.BtBBCoBCC?B^B|BB~A6B CBA6BBBC|B C!C!CBBB&CeBlBB&C'C(CeBBBB'CB(CBBBBBBvB1CB1CBBBB5CB5C7CB7CBBBB:CC?CBBBBBBoBBBBBB>CBBBBBBBBB?CBAgBBgBBgBCgBeCgBCgBBBVCBVCXCBXCYCZCZCB]CB]C_CB_CBB{BBAyBdCBdCB{BfCBBhCiCBBBBBBhCBiCBrCBrCtCBtCuCBBBBzCBBBzC{CBB{CBCBCfCBBCBCBCCBCBBBBCBBCBBCBBCBCCBYCBCCCBCCC CCCCCCCBuCBBCCBCCCC C BBCBCCBCBCCCCBCC%CCCC:BBB%CBBB$CDBBCBCC,CCCCB#CCCC9CC"CCECC$CBC,CC@CCCCC#CIBBiBB^BBCCCC9CCCCECC"CCQBBCMCCCOCCC6CC#CC[CCBNCC[CCBC3C.CCRCNC)CC#CCRCC3C CSCCMCeCOCeCCSC-C-CCClCNBCBCCBC.C C6CeCCCmCmCgCCCClCCqCC\CCCCRCeCGCFCDGCDC`CDTCDlCeC DIC D DC DCCvB(CB(CB(CB(CB(CDC\CeCqCeCDC`CD`CeCTCeCbC4CcCbC4C^C"DC^CC"DDcCICeCCeC&D(DsC(DsCC+DoC+D,D-D-DCCC&DCCwCCwCCwCCwCCwC7DC7D8D8DC;DC;DaCCCCCC?DoCC?DCDDCDDEDEDCCaCCCCCCCCCBfCCCCCCCTDCDCTDCCvCCxCCDCZDBuCCvCCCCxCDCCC DCCxCZDCeDCeDfDgDDCfDCjDDCBCCCoDgDCtDC DCjDCtD0DCBCoDCCCDCCC}D'DC}DCDCDDCDCDDCCDCCCDBCCCDCCCDDDDD DD DCCCDDCCDCDCC@CCDDDDDDD DDDDDDDDDDDD DD DD0DCDDDD2DDD2DDDD1DD6DDD9D6DD)CCDDDDD'D*D>DD*DDDD1DDD4DD%D)DLDDDD:DD)D.DNDDDXDbDADDbDVD[DDDDPD%D>DDiDPDhDD=DSDXD[DDXD@DmDD@DmDDDDrDD=DiD[DDrD[DDDDBDD:DLDElDuDDlDDQDQDuDEDE{D#DEQD#DvDC&D~D{DBD[DD[DD[DwC,DC,D[D,DD,DE,DFE,DE~DEEDuDEdDEvDuDEwDdDpDC;DDD%EDwDuDqDuD%E&EDuD&EqD+ED+ECED-E-EDDIDDD2ED2EDDIDD5E6E9ED5ED9E:E:EDDD=EDD6ED@EDED@EDDDDE=EDDDDDJEDJEKEKEDDDDDQEDCjDQEDDSECjDSEDXEDXEDD[ED[EDD]EDxDxDDDDDDdEDdEDDhEDDDhECDCDDDDDmEoEDoEpEpEDwED]EDDDDDmEDwEDDzEDzECDDD~ED~EEEDDDDEDEDDDEEDEDDEDDEDDDEEDDEDEEEEEEDEEDDEDEEEDDE EDDED9DDE EEE EEE"EEEE!E!E'E>DDLDDEEENDDEDEEDEDED0EDDEDEEEE#EEE EE"EEEE$EE;EEEDEEEDEEE0EE$EFEADDEEiE>EEiE'FCEEECE'FEnEEEE-FHEnEEHE4FtEDKE-FEDKE4F6FE6FtEEEE;FE;FFE>FEEYEEEYEBFBFEEEEEEEEEEEEEF)G*GFF*GF-G.GxFtFFtFMFF.GxFFMFEKFFF;GFSFFFSFFF;GGF>GpFFFYFFFE\FkFFYFFJJDJ>JDJUJDJJIUJLJ J JIJLJ=JDJ]JDJVIIPJK4KKKKK>K9KKKKBKKK2KKK4KKKKKKKKK9KKEKKCKKBK8JJuJJBK9KKKEKCKKHKKKKKKKZK^KKZKDK^KKKKaKKKDKK(KKCKKK0KHKCKK2K9KGKjKKKGKcKjK6K]KKKcKK6KKCKKKmJKK;KbJKJK;KjKKKCKL_KLL}KLaK^K LK_KjK L L L LYK L(K^K LbK}KjKLK0K^KLVKKLVKL LYKLkKLJ5KL LKkKKJ5K LLKK8KKKKKKhKIKK8KK*LnK*L+LrKKnKK/LrK/LKIKKKNKKKNKQKKKKKQKKKJSKJSKJSKJSK=LKK@LK@LiKKKKKK=LKlKKHLKHLILKKKLKfKJgKPLKKKPLKLKKiKULKKlKULKKJqKXLKK[LK[LKKKK^L^LKKKJ|KK|K9K|KCK|K^K|KjK|KXLKKKiLKKkLiLKkLKnLnLKKKqLqLKKKCtLKKKKKKKKKKKKKKKKLKLLKLKKKKKKKKJKLJKKLKKKKKKKKKKKKKKLKKKKKKKLKLLLLLLLLLKKLKKLL~LKKLKKLKLKLLLKLLLLLKLLLLLK.L,LLLLK?L,LL.LKL1LKL3L5L,L3L1LLLKLLL?LKLKLLLLL5LLL,LLLLLELEL,LLLLLL,LL0LLLLQLLRL]KKL0L,LLQL,LRL,LSL"LL\LLLaLLSLL.L\L,LLLcLLaL,LL.LcL,L8LeLjLeLL8LLLLLFLLLjLFLeLL:L:LeL_LeLxLeLLLjLLMxLpLeLML_LoLeLrLGLMrLMsL{L M MsLYL{L MYL MMWLMMLK+LK+LLeLK+LMLeLlLLMMMlLMLLmLLL ML M!MLeL!MpL'MoL'M(M)MWL{L(MLLLKILKILKILKILKILKILKPL)MLL{L:ML:MKUL=ML=MLL@ML@MAMBMLLAMLLLBMLLLIMLIMKMLKMhLLLLLhLLLPMPMLKiLLLTMVMLVMWMWMLKtLLtLLtLTML^ML^M`ML`MLLbMcMbMLLLLLiMLcMLiMLLLLLLLLoMsMLLLLLsMtMoMLLLLLyMLyMLL{MLLLLLLLL{MLMLMMLMKL,LLeLLLLLLLLMLMMMMMMLLMMMMLLLMMLMLLKLLLMLLLLMMMMMM MMMM MMLMLML"MLLLLMM ML MLMLMLLLMLMMMMMMMMM*M2M*MM2MMMMMM#M"LL5M>M1M>MM5MMM1MML7MLGM%MLGM%MHMLMMHMMM$MLMM$MM#M*M+MLMM+MMMMMMMMM/M/MQMMMLMM&MMMMOMGLM{LMM8MLMmLMLMMOMM7M>MMdM&MLMOMLMM8MLMM?MpMMuMdMLMM?M}MMuM|M~M}MMM~MNDM.MuMSMMMRMNMMMMM|MnM|MRMM NM NDMSMNNhMNXML(MNhMUMrMzMNrMNYM.MaM3MMYMMaM3MMNMN;MMMMM9MM;M$NM$N'NnML@M'NL@M)NL@M+NM|MM|M9MMNMMMMXMMM|MMNMZMMMM6N6NM8N)NM:NM|M8NMMMMM:NMMMMZMDNM+NMDNFNMFNGNfMML`MMMMMMfMMMMM NMMMMmMMMTNwMMmMMTNMLtMLtMMtMLtMMtMMwMMwMMMcNMcNMMMMMMgNhNMMhNMMMlNgNMlNMqNMMMqNMMvNMMMLMvNMM|NMMMMMMM|NMMMMNMMMNNMMMMMMNNMMLM*MM>MMLMM|MMMMNMMMMM"MMMMMMMMMMNNNMNMN NNNMNNMN NNM NMNMMMMNN NMNNNNN-NNNNN NMM-NMMNNMMNNMMNMMNNMMNNM%N.NN%NNNMN/NNNNNN&NN2NQMMNNNN2N NNNNN1N1NNN NNNNRNHNNRNNNCNNNNCN0NN!N*NpMMONNMMUMMzMMN!NNNLN@NN0NNLNNNONKNNmNKN4N*N/N.NN4NNmNNENbNiNbNN^NfNNENN^NNN_NNNeNNNbNpNANNOdNnNbNNbNNpNOdNWNOOsNOVN~N OVNOIN OMNwN OMN OOOUNOiNINWNO_NfNsNWN5NNaNN7NaNUNwNOZNN5NOZNtN OnNtN7N OeNfNrNN#OxN>N#OrN>NNNxN)ON)OyNN+OMGNNGNbNGNNGNNGNNGN+OyN5ON5O9ONNNNN9O;ON;O=ON=ONNNN@ONN@ONNN`NNN`NNNjNNNNJONJOKONNKONMhNNjNNNSOUONUOoNNSONNoNNNMvNMvNNNMvNNNzNNNNNzNdONdOeONNiONeONiOjOjONlOnONnONNqONqOsONsOtONNtONxONxONN{ON{ONN~ON~OOONNNOONNNNNONNONONNNNNNNN ONN OlONNNNNONOOOOOOOOOOOONON.NN&NN NNOOONONOOONNNNNNO ONN NNHNN0NN*NN@NNON OOONNO.OO'O-ON'OO.O OOO,OOONO,OON"OO4O:O"O2O(O2ON4OOOOOEO>OOfOOfO>OYO|O]O>OO?OOEOPYOPOvOvOODOON O_OOO_O PO P P P]OuOOwOOPuOPPPwOPPPOOOOOPPOPOO}OPPN9OPOOO"P"POyOO%P&PN=O)PO)P%PyOOOOOOOOO0PO0PNKO2PPwO&PyOOOOO7P8P8POO}OOO2PO?PO?PBPOOOBPOOFPOOOFPOOcOOOcO7POOONPONPPPOPPRPORPOOUPOUP]PONqOzOONqONqOOOOO]P^P^POOzOcPOcPnPONOOONO OO2OOOOOOOOOOnPOOqPOqPPOuPOOOuPOOzPOyPOyPzPOOOO}POO}POPOOOOOPPOPOOOPOOOOPOPOPOOOOOPPPPOPPPPOPOPPPPPPPOP-OOPPPPPPOPPPPO$P*P'PPOP PPPPPP$PPP*PP,PPPPPP$PPP3PPO+PPPPO PP+PPP9PPO;P5POPP;PP4P5PP4PPPBOOPGOOPP-PP PP(P P$PP.P3POPPPPOHP>OOOOOO$POOPOSPOoOOP$P,P$PP$P|OOP>POODPO POPP>PbPDPPbPGPAP-PSP>PSPPP/PAPPPHPSP9POPPGP/PSPfPXPlPSPPfPVPSPPPlPPP POP}OPOPPIPPVP.POP!PPYPoP QVPoP!P QYP Q Q(POPQ~PO)P~PSPQPP1PPP\P\P1PQPQQQPQO7PPPPP Q QP#QrP#Q$QrPPPkP$QPEPP,QPpPEPPpP,QOFPPP/QP{PJPP/QP{PJP6QvP6Q7QPPPPOPPTPPOUPPTP7QPPZPPPEQPUP VPEQvPPGQ VPVPJQKQLQLQPkVPtPPWPPP]WP_WPUQOnPWPXQVPPtPOuPWPWPXQPXPXPUQPWXPOzPXXPPPqYP1ZPPPPPPPPPPP QPQPQP9`PZPPPPPPaPGQPxQPxQPPPPPP~QP~QPPJQPPPPPQPPQPPPPPPPPPPPQPP'PPQPQPPQKQPQPPPPPPP QQQ QQQPPQQPPQPQQ QQQQPQQPP'QPQ'QQPQPPQQQQPQQ Q-QQ QQQQQQQQQQQQQQQ9Q9Q.QQPQQQQ0Q&QQ0QP%QQAQ%QAQ(QAQ3QPQFQAQQAQQAQ RAQ8Q3Q!RAQQ8QQ(QQXPPVQYQQQVQQFQQAQRAQQ$RAQIPPRAQRAQ)RAQ;RAQ:RAQ RAQRAQRAQQRQQwRAQQRAQcQQQ[QPQRAQQ?QQRAQRBQRAQRAQPQPQPQRRRQRSQR R_QkP$QP$Q R R^Q RRQRRQ[QQRBQQQQSQQRQ_QQRRsQRP7QAQ7QR7QS7QsT7Q#U7Q^QQQQuQQ'RuQQQ'R(R(RQ*RQQ-RQ-R/RQ/R*RQ1RQQ3RsQQQQ3RQ7RQQZQQQQ?RQQQPXQPXQ?RPXQ1RQ7RQQZQERQERHRQQQHRQQLRQLRMRQQQQMRQSRQSRQQVRQVRXRQXRZRQZR]RQQQ]R_RQ_R`RbRQbRcRfRQQQfRhRQhRiRQQQQiRQpRQQQpRcRQ`RQQQQQvRQQ{RQQQQQ{R}RQ}R~R~RQRQQQQvRQRQRQQRPQQQRQQQ-QQQQQQRQRQRRQRRQRRR RRRRQQRRRQR RQQ.QQRR&QQRRQRRQ"RRR"RRRR!RRRQRRRRR RQ$R.RRRQR.RRRRRRR)RRQ RQ;RR RYQQRRFRQR R1QQQQQQQQQQQQRFRRQRR:RRRQR RRRRRRR>RR>RR4R+RRR4R#RGRQ#R5R@RR5R@RQRR0RRRR>RR0R[RR8RYRR\RR8RRRRWRR9RRKRqRRKRRRtRRRPRRRlRlRdRtRqRRRSBRWRYRRARSQRS^RTRSIR\R[R SR9RYRARdRRaR S%R^RgRRaR%RSgRSSoRSPRqR6RkRBRdRSIRdRSRjRRSR6RSRSeRR S!S"SoRR$S SeR&SkRRSjR*SwR*S!SR"SRRrRRR$SRNRR6S|RRNR6S|RR8S9SRR8SRRR9SRRR@SR@SRRBSRRnRRBSRmRRISRIS&SRRRMSRMSNSNSRPSsRRRRRmRRnRPSRuRRRsRQpRRRRuR_SR_SaSRaScSRcSdSdSRgSRgSRRRRQRRRmSRmSRRoSRRRRtSRoSRtSvSRvSRRRRRRzSSRRRRRzSRSRRRR RRRRRRRRSRRR(SRRSRSRSSR]SRSSSRbSRSRSSSRSRRRSSRSSRSRRRSR}SRRSRRSRSRSRSRSRSRSRSRRRSS'SRS'SSSRSSSSSS(SSS(S7SRSS7S;S#SS;S+RRGRR[RRSSSSS S SSS S,S=SS5S=SS,SS5S%S=SYRRqRRdRRTRRRRSSS#SS(SSS%S-S=SS-SSS%SSJSSSKSSSSLSJS=SSYS^SSSYSSSSZSS`SSKS=SLS=S S4S`ShSSfSfSASSAS SSSQSSS:SOSuSZS^SSKSSSuSSQSCSSRSSOSRS+SSSiSnSTTiS T]S T T4ShS~SSrR*SR*SSYSnS+SR*SR*S T~STbSTT TSTbS TTS>TVSS|SSATSSETSATSETGTSGTITSITJTOTSSeSSSJTSOTQTSQTSTSSTSSVTSVTpSSSSYTSpSYTSRvSRvSRvSeSSSvSSSbTbTSeTSeTSSSSmTSSSSSSSSSmT TSoT2TSqTuTSSSTSuTqTS*TSTSTS}TS}T~TToTSSTSSTSTSTTTTSTSTSST=TSLTSTFTSSSTT~TS/TSTTSTTTTTSSTTPTSdTSRSTTTTT#SSTSTTSSSTT%TT)TT SS=SS^SShSSCSSTTT)TT.TTSTT.TTT TTT2TTTTTTT-TTT-TT0TTT0TTTTTTTTT*TTHTHTTTTTTTTKTBTTTKTTTTTTT7T7TCTTTTTTTT=TTTTLTTTTT=TTTTTTTFTT/TTTTPTTTT TdTfT3TTfTS T3T TTTgTgTsTTT=TpTsTTTpTTTgTMTsTTsTTsTUUTsTTsTURTUUUMTUTT$TUUT^TTS(TTsTS(TUTT$TTU^TUUnTUU`TUUTURTTTsTjTTTT!UT!UTsTTsTDTjTTsTTvTSATTsTTsTvTDTTsT1UTTT1UTsTUsT6UTSOT6UTT;UTnTT`TT;UU#U0U#UUU U#UU>UU>UUDU#UU,U#UU0UUUT U+U8UU(U(U"UU+UUUDUUHUUUHUU.U.UMUUTU0UU?U#UU,UUU?UUUTUkUOU"UTTUTUTUTUTUMUU8UUUkUU UlUlUOU=U UUUUUUU=UUJUUUeUeUpUUUUVUUJUOUQU}UUwUVQUVVViUV VXUXUaUVUpU Vc V VV{UwUpUV{UxUVUVyUzUiUpUVdUUVwUVVyUVVdUU~UVVUUU!VU!V(VUUUUUAUU'VU'V(VUAUUU,VU,V|UUUxU/V0V2VU2V3V4VUU/V|U0VU9VU9V:V;V=VU=VUU3VUU[U4VUUU:VUUU^UUU^U;VUUUKVUT`UKV[UUUUUUOVUUTjUUUOVUUU[VUToUaVU[V^VUUU^VTvUUUaVUUUUUUUUUUhVUhViViVUkVoVUqVUUUoVsVUqVUUsVUUUUUUUUUUUU{VU{VUU~VU~VVVVUVUVVVUVUUVUUUVUUUUVVUU VVVUUUVVUVVVVTUVVUVVVVVUUU VVUUU VVVUUVUVVUUVUUVUVUVVUVUVVUUVUVVVVVUU$V#VVVU$V5VUV6VVV6V5VV VVV8VXVV@VVAVVVVAVV>VXVV&V-V@V}UUVVFVVVeVfVV?VVeVVVGV?V@VVVQVxU VU VVGV&VXVQV]V]VVSVVVBVCVSVzUVVWUVVCV~UVUVUVUVUVFVXVUVnVWBVXVU!VLV|V WLV WVxVWVWWWpVWVYVgVYVDVVEVVWyVVrVyVtVWWWWgVW_V W!W%WV!WzVGVfV%W WuVpVnVrVDV,W}V,WtVEV_VVVV1W2WuVV2WV1WVVVUOV:WVUOV:WVV=WV=W>WVV>WV\VVV\VVVzVVVVVVGWGWVIWJWUaVIWVVVJWVVVUkVUkVVkVXVkVfVkVnVkVUqVUqVVVVV\WV\W]W}VV_W`WVV`WVVVeWVeWgWVgWiWViWlWVVVlWVVVVVVqWVqWrWrWV VVVVVVVVVV{WV{WVV}WVVVVVVVVVVVVVV}WVVVWVWVVVVVVVVVVVVWVVVVVWWWVWVWW WWVVWWWW#VVWWVWWWWWWWVV W"VVWWW"W"WWWVWWWWVWVWVWWWW"WWWVVW@VVVWVVVV'WW WW W'WVWWWWV WW'WV7WAW WVAW$W-WW7W'WWVW$WW5W WVWW#WEW5W'WWKWOWWWWKWWMWW#WMWCWWWWKW-WVCWV?W(WWW.WW?W.W@WWQWPWWWQWWLWX/XXXW=X=XX(WW@WWPWWXBXX/XXX>XXXW9X/XWXFX/X'XXBXW_X/XYXX YXYYXXXXYYY YYXXXYYX YX Y YX&YXX'YYX'YYXYXYX2YYYYXYYY5YXXY Y5YY YX;YYYYXYYYYXX.Y1YYX1YYXY(Y(YYYX>YX)YYXY9Y9YY)YYYXFY?YIYYX_YIYSXXYYX?YFYSYSYXYXBYKYXBYKYY=YcYIY=YX\YXY+Y+Y\YY@YCYY_YYYcYY@YYCYYEYfYYEYYAYAYVYYYVYYDYYtYrYY]YYiYgXYrYY]YIYZtYiYDYZYIYZ YZYJYkY ZJYuYIYkY Y ZjY$Y ZnYjY ZnY$YuYXYY0YYvYY*YXYbY*YYbYY0YZvYZwYYZHYYoY3YYcY3YwYhYoYY6YxYYZhYYY&ZY&Z6YxYYYzYYMYYNYzYYYYY0ZYYHY0Z1ZXLYYMYYNYXLYY~YY~YY~YY~YY~YZ~YXWYBZYBZCZYYEZEZYXaYHZYYmYYLZYLZYdYNZYYRZYNZYRZYmYTZ\ZYXqYXqYIYqYYqYCZYYqY\ZXsYYY_ZYYcZYTZYcZYYYYYY_ZYiZYiZjZkZYYdYYjZYYYHZYYYYYsZvZYsZYvZYYYYYY{ZY{ZZYYYYYZZYYYZYYkZYYYYYYZZYYYYYZYZZZZYZYZZZZZZZZYZZZZYZZZZYYZZZZYZZ/ZZPZZ?ZZtZZZZZbZZZwZZZZZZZZZZZZZZZ/Z Z'ZZZZ'ZZYY ZY/ZZZZZZZZZZZZZ[Z[Z [Z[Z3[Z;[Z[ZH[Z@[Z2[ZZ/Zo[Z[ZJZY[Z[ZFZJZZFZfYYZ[Z[Z[Z[Z[Z\Z[Z[ZZZZZOZOZDZZZ/ZZ/ZZZKZ(Z>Z7ZZKZZZPZ ZPZZ>ZhZYZZhZYZZZVZ ZdZVZ=ZZZdZWZ=ZZZWZZ?ZqZZ^ZqZZ^ZZ[tZ[[[ZZ!ZbZgZfZ[ZZfZ!Z [Z[gZ [lZrZ [lZ [[wZ8ZwZ[[QZQZZ[[zZ[Z~Y1ZZ1Z5\1ZI]1Z#^1Z^1Z[zZ[Z8Z[ [xZ ["[Z"[AZ|Z%[Z%[xZmZoZAZ|ZnZZZZoZ,[Z,[pZZ.[.[pZ0[5[Z[wZZZYNZ5[0[ZZZ8[8[ZYTZ<[Z<[=[>[ZZZZZXZXZZG[ZZ]ZY_Z]ZZG[ZaZZZZZM[ZaZZM[U[ZuZZZZYkZYkZYkZyZZU[W[ZW[ZZZ[ZZ[=[ZZuZZZZyZ`[Z`[a[ZyZa[Zd[ZZZZg[YZg[ZZZZZZZn[Zn[q[ZZZq[ZZZZ>[ZYZx[Zx[z[Zz[|[Z|[ZZYZd[Z[Z[[Z[ZZ[Z[[[[[Z[[[ZZZZZZZZZZZZ[[[[[ZZ'ZZDZZ[Z[Z[[[ZZ[[[Z[Z [[[[[Z[[[ZZZ[ZZ[[ [Z[[[[Z[1[[[Z[1[[Z[[3[[ [[[[[4[?[Z[[;[[;[ [?[[[[Z[ZH[[[ [[Z[(ZZ#[[7ZZC[$[[#[[C[[[[V[L[[[V[[@[[&[T[[&[[\[_[[H[[\[[[[][[2[)[b[][A[[)[Z[rZ[[o[[[7[e[[o[Z[[7[[\o[[X[[X[B[A[[b[[p[c[\p[\mZ[\\f[nZ"[\Z"[Z"[Z"[Z"[f[[[/[o[\o[r[[\\\r[{[/[\[s[{[i[j[\\6[s[\:[[j[6[h[:[[h["\[[\i["\[[['\(\'\[(\[+\-\[-\\o[[E[[t[N[[3\[N[3\[[[9\[9\:\;\;\[Y[[[Y[[Y[[Y[:\[[[D\D\[E[[k[[[[I\[[K\I\[[[K\[P\[P\T\[[k[[[T\U\+\[[[u[[d\[o\[[u[U\[[u[[[Z|[c\d\[[Z|[g\c\[Z[[[g\[n\[n\o\[[[[[[[[v\[v\[[x\[[x\[[[|\~\[~\\[\\[[[[[[\[\Z[\[[[|\[\[\[\\\\[[[[[[\[[[Z[\\ \[\\\[\ \\4[[\\[[\\\[\[\\\\*\\\*\[\!\\\$[[\)\[\L[[\[!\5\\\\[[5\)\5\\\6\4\T[[_[[\6\\\.\\\5\.\5\V\5\Y\5\\5\s\5\B\\t\5\\5\\5\\5\\B\\\5\e[[\5\&\%\\5\\B[[[V\c[[W\[\J\\5\\5\J\W\\&\\5\\5\\5\ ]5\]5\]5\[[\\]5\[\&]5\"]5\\M\\Q\^\^\\\Q\X\b\b\\\\i\\\Y\\X\#\Y\i\\\\M\W\\V\N\#\f\N\r\#\,\f\O\p\ ]/\\ ]O\\r\\w\t[-\p\,\]\]]\]w\/\]]\_\8\\y\8\ ]\ ]\y\$]s\$]']k\k\\'](](]\]\\\/]t\/]]\1]\\5]\1]\5][P\7]8]\\<]\8]\<]=]\\=]\A]\A]B]C]D]D]\a\\\\\a\L]\[d\\a\L]\\[d\\\Q]\Q]R]V]\[o\R]\V]X]\X]Y]Z]Z]\]]\]]_]\_]\\a]j]\[~\[~\[~\7]\[~\a]\\\j]\\B]\C]\\\\\p]\\\\Y]\p]\\\\\x]z]\z]\\~]\x]\~]]\\]\\\]]\[\]\\\\]\]]]\\\]]\\\]\\\[\\\]]\\]\]]\\\\]\]\]]]\] ]4\\]]#]\]#]]]\]\]\\]]]]]\\%\\]]\]\]]\]]\)]]*]\\]] ])]\*]\]\]]]\]]]] ]9]] ]]\ ]\ ]]]]]]]]]&]]"]]N]I]]]]]N]]N]]]]:]U]!]?]!]:]I]]I]]I]\U]]]?]]\]\>]\]]]>]]I]]O]+]:]],]],]i]O]i]]I]]I]]I]]I]^]i]]I]]I]]I]]^]]I]v]]o]v]^o]_\]^{]l]^]I]]I]]I]]I]^{]]I]k]m]\$]\$]^k]^]r]^r]+]^]^]^^t]^\1]}]y]t]`]b]6]]b]\7]6]}]^ ^ ^]^]]]\=]'^]'^)^])^*^]].^]*^].^/^]]]]/^]6^]]]6^8^]8^]S]:^]]:^]W]]]W]?^G^]?^]]]\]]\]]S]]]]G^H^H^]]]]]M^]h]O^S^]h]]O^]S^M^]U^]]]]s]]\^]]s]U^]\^]^^^]u]\z]\z]\z]u]]]]g^]g^i^]i^j^\]]^]j^]]]p^p^]]]]]]]v^]v^w^]]]]{^]{^w^]}^\]]]]]^]^]]^^^^]^^]^]\]^]]]]^]^]]]^\]^^^}^]^]]]^]]]^]]]]^]]]]]]]^]^^^^#^^]^#^]^^]^^^^9]]^#^ ^#^"^#^C^#^1^#^7^#^9^#^b^#^^]_^#^^^W^#^B^#^^^^^] ^!]]i]]^]l]]A^^m]]l^#^^A^^#^^^T^#^^y^#^2^F^^2^^^]"^F^]^q^#^^#^@^0^^#^^@^s^#^^^#^^C^^!^<^]!^3^Y^<^]^#^Y^]^#^^3^^^^7^^1^^k^Q^^9^Q^^^k^^^^R^^b^R^;^^]C^^_^^^W^`]^y]^^>^n^^>^^__B^u^^m^^^l^e^u^] ^] ^] ^ _e^ _z^m^ _z^ ___^_l^_^,^d^^,^T^_d^_x^~^_x^_____y^ _^_q^ _!_r^^#_$_#_r^'_^'_!_^*_s^*_+__q^/_^]G^/_+_^]G^N^^7_^^N^6_^6_7_8_^^^^^V^V^^8_^@_^@_A_^^^^^^$_^A_^G_^^I_I_^^^G_^O_^O_P_Y_^]j^^^^^^^^^P_^^^Y_V_^^^b_^j_^U_^a_^H_^a_e_^k_^w_^e_M_^_^]^i_^^m_^z_^m_n_n_^^^r_^r_|_^^^^^^^^^x_x_^^^{_^^i_^_^_^__^__^_^^^^_^_^_{_^_^__^^__^^^_^^______^_^_^______^__^__^__ ___%_______)_____^__^_^_ ___,_%__^3_0^^___-___,_3__^_______ _^)__C_-_3___9_____^__J_Q_^J_Q___;^^._R__.__3_____E_^3_____V_^<_B_0_n^^0_^<_(__B___3__b_(____9_h_W_ _3_C_3__h_9_3__T_>__j__T__>___U_[__o_[__o____H__~^_`_k_`]__`]_ `w_^!_`k_ `l_q_ ` `l_1_M_```_s_X_`z_``s_X_1_`|_`_`_`_c__^7_` `}_f_"` `c_"`}___'`_'`(`__(`_.`_^G_.`0`_0`_K___K__^O___8`_8`9`;`_;`______^Y__Z_____F`_F`G`G`___L`_L`P`_Z__^i_P`p__S`_S`^n__________p_^`_^`_`_`___c`_c`f`___f`h`_h`^___)__3____R________`_________________}`~```}`_`___~`_```_`_`_`#`__ ``_`_`_`_`__3`_`_`_ ``_`1`_`_`_I`_7`_______`_`4`_```s`_m`_e`_``r`_``_````_````#``_%`````_``_````2```2``3``_``1``E__``_`=`_`1``=`$`_M`$```_M``>`&`_`>`&```W__`_K``?`_`)`K`!`)`?`-`__+```I``/`+`*`R`@``R``__/`-`@```7``,`\``,`````Q`q_ `````4``a`D``a```s``t`d```t``m```_`f_`_`a_`_`n`j` an`ae` a ar` a aaU`a a`6`[`|``U``a|`5`g`aaa]`v`k`A`v``5``6``o`_9`_9``9``9` a9`a9`)a`o`A`)a``B```B```2a```_G`g``2a3a4a_P`_P`3a`_P`V``_P`[``]``4a``V`Aa``````````````Aa`Ma`Ma_f`Pa`PaQaQa```TaTa```Xa`Xa``[a`[a_a`^a`^a_aaa`aaba````fa`faga``ja`jakaga`oa`ka`oa ``_` ``satasa`ta`````ba```{a{a```a`aaa`a`aa`aa`````a``a`aa`a``a`_`a_`````` aaa`%``a` a``a`````aa aa`aaa`aa``aaaa!aaa+aa`aaaaaa!aa:aaa` a a a&aaa aa!``*``'aaaaaa`:aaa#a`a#aaaaa&aaaaa'a0aDaa0aaaaa\``Q```a5a``.aaa`.a5a7aaa7a'aD``a&aCa$aaCaZa$a*aSaaad``a*aaZaaaGaaj`aGa`aSaada`aadaaaYala]aalaacabaa@b`[a@ba>baFbaFbaaIbaIbJbraa`ba`gaaaaaaaJbaaaVbaVbYba`oaYb`ta[bara[baaaaabbabbdbadbiba`aaa`aibkbakbnbaaanbpbapb[qbaaaaubaaaaubaaa|ba|b}baa}baqbaaaaaba%cacaaabbaaacacaaabudaaabda+aaaa aacadabaaadab7na bbsnaoqaqararabab b\sausarabDaasaab3babab"ta?vajvaa3bkvavaa9b:baa"ba5b$aa`aaaaaaaaa5ba5ba5b"b:bba8bbb8bbbaab+bba+bbLbb?bLbabbbbb1b!b'b2baa!b$ba-b$ba-bGb2bbbGbbAbb5bRbbQbRbbzabababababAbebbQb1b?b9b5b;bebBbbb;bbbxbbCbBbbCbzb~bczbcccbbKbcbccMbcNbb c]bb(b]bxbeb cNbvb(bcbvbcccbbwbbebcba0bcsbbcsbccctbybfbbbbbob)cbobObbbob)cb0cbaFb0c1c2c6cb{bOb2cb6cbbb{b9cSbbbb>cbbSb>c@cb@c1cb9cbbbDca[bDcbHcbHcbbgbbLcbLcbbQcbbgbQcbbbbTc^cbaqb5bqb?bqb'bqbebqbbqbbbTcb^cbbbbbbccbccfcbbbfcbbbbjcbjclcblcocbbbocpctcbababtcbbbbbbycbycbb}cb}c~ccbcbcbbcbcccbcbcccbcbbbcb cb ccc~cbccbbbpcbcccccccbcccbcccbbcc ccccb cccccbcbcccb"ccc"cc+c/cc+ccc&cbcccccc4c,cc4cccccbc ccc;cbccc8ccb c;cFcc,cc$cccc*cccc&c/cc=cccbc=cUcc.cc.cUcccc,cce8ede e e8ee e>eeeedfe0fe(fefefe;eee;eeed:ere;e&fe&ferefefefefe.fe.fgefe+geSgedge^ge5fPeveePeeeeeagegegegeeXeXeeBfeBfaeegegeeaegeeegege,heHheQfediediedieQfdiedieoeeeoeee5feZfeZfeueee^fe^f_fee|eee|eeeefeefeeueeeeeeeelfelfmf_feeeeeeeeemfeeeeexfeeexfeeee~fedeee~feedeeeeefefeefefeeeedeeeeeeeeeeeeeeeeeeeee fee ffefefeffeeeffffffefeefeee ffe fefefeeeeffffffeef fff)feeff f?fe"f)fe"feffff8ff8ff4f?fe4ff-ffe-ffffefee9ff'f9fffff>ff'fee0fJfeff:fJff:fffOfff(feOf,fe/f,fff3ff/ffeEfEfRfSfRfIfRfGfeHfGfffHffDfffSf3f,f1ffDf1ffIfCffNfCffNff=fff`ffpfRffpffpf`f=frfjffrfffwfwfsfjffafMfg}ffgafMffuf}fgfwfgufqf%f gofqf gofPfsf2fPfnfUfgnfg6ffgyffUf2fgyfvf\fffgf6fgff7f!gf!g"gfsff;f7fvfAf|f;ftftfzffffAf{ffff.g"g{fKff3gfff3gfKf%fwf.gf|fzfff>gfTfffTf>gfYfBgfffBgYffffe_fffe_fJgfffJgMgfffMgNgffNgfRgfRgffffWgfffWgffffZg[gffZgfff[gf`gff`gfcgcgfffffffffffjgffffmgffffffjgfffffffffffffffffffffffffgfffmgffggffffffgfffffffgfgffg gfg gffgfgfffg ggg ggggfgfggggffgfggffgf$ggf ggfgfggg&g#gg&ggg+g$gfg gf(gff(ggggggfgffRffsff\ffzfffff+ggfg5gggggf5ggggggCg:g*gffCgg*ggKg/ggggKgg0g4gg%gfg0gfLgfSggSgDgfLg%gg+gXgDggXgggPg'ggPggg\ggdg1gg\g1gnggg2gngg2ggg^ggigihi+i+i>iiiEiih9i5i;iiiEihh5ii7iii;ihiiVhhh.i i=i7iBiiAii-iBihFih6iFiii6iCiiieiIijiii.i i.ijiiiAiiIiHi iiVieiCiih@iiqiibi^iiqiiiiiqiibiJipijjJiViHiuiijuijj{ij{ii j jQi jqh$ijhijrixizilij/irijli/i|i~ijzii2idiij}iiKii2i|ijjhijdiifi jqi#jii+jih?iMii#jij}iii+j/jiLiihGi/j0j1jisiiKifiLiiiiMihRi?jiiOiiTiTiihRiOiihYi?jAjiAjh\i0jiiiiai1jiciiiciiiiiiiMjigiOjgiiiiRjMjiaiiiiOjiZjiiiiiZjiviii]jvii]jiiicjiRjicjejiejiiiiljiiiiiiiljiiiipjipjsjiiisjiiiiiizjiiizjiiii}j~jiiii}jiijiij~jiiiiiiijjjiijjjiiijii jij j jj jjjjijjijj jijjjjjjijiijijjijijjijjjiijjjijjjijjjjiijjjjjii(jjjjjijjj&j%jjjjijjjjj ji jj2j%jiji&jj5jjj5jJj7jjJjjjjj*jPjj*jjjjj2jjj8jj,ji-j,j=jiYjijBj=jjBjj-j^iipiiiijj7j^jYjj^j3jLjj!jIjjXji8jj3jjj6jXjQjj"j9j6j4jjxijjajjj9jNjjj~ijjTj>j$jNjjTj`jhj'j`jkLjj[j_jk[j)jwj.jxjQj!j k>j$j4j"j kj_j'jUj)jxjUjjVj:jjVj.j;jjgjdjj\jsi1jkkjjjQkjZkjQk.kjNkjxkjTkjdkjtjjkjisjjtjjjakj}kjkjakbkjjjjjjjjkjkjkjkjljkjjjskjjjskukjukjjwkjjjjjjwkjjjijjjjjjjbkjjjjjjjkijkjkkjj kkkjkjkjjkjjjkkkkkkkjkkjk(jjkkjkjjj kj k kkkjkkjjkk kkjkjj kkjjjk7jjPjjkjjjjj kjjjkkkk kk+kkkk,kj9k1kjjkk"kk1kk"k4k4kjkkkkjEk k6kj k!k(k6kj(kj7kjk!kkk9k5k7kk5kkkOkkk[kkjjjhjjk1k$kPkk$kkk>kkckekkkZkkckkk.kkkNk8k?k?kkklkpkklkk8kkIkgkgkkkNkkIkkkxkktkVkrkkktkRkrkllRknkklvknkhkmklvkj kj kkhkkmk&kkSk&klklkUkkSk/kTk-kkUk/kfk-kkfkllkllldklkzkykl=kkkklzk{k=k$l%lkk$likkkkyk%lkik{k.lk.l/l/lkMk}k|kMkLkkkLkkkk|k8lk8l9lkk9l}k~kk@lkWk~kkWk@l\kkElkk\kkkElk_k`kkkkk`kkkLlLlkkkSlkokk_kkkkSlkkkokXlk`lkXlkkkkjuk kukkk_lk_l`lkkclkclkkelelkkkjlkkkjlkkkkkknlqlknlkqlkkslslkkkkkkkkkkkzlzlkkk}l~l}lkkk~lkkkkkkkkklkllklkk lkkklkkkl lllklkkkklkkkllllkkklkkllllkkllllklkllll lkkllk!llkllkklll(lkkl(l lk l6l(l6l!lkl6lHl6l7l;ll7lll5l6l=l6lllllll4l{l"lxllllllk9l&mfll>l&m(ml(mlCl*m*mlCl{lll.mllPll1mltl7ml1mltlPl.m{l7mllVllllll>mllVl>mlWlWlll]ll]l\lll\lk`lllk`lImImlkelkelllkelOmlglllRmgllll]llWmlWmXmlrlOmlllvlllvlrll_m`mlll|lemlk}lemk}lRmlXmlllllll_mloml`mlomllllklllllllxmlllxmzmlzmll|llllllllmlmllmlmmmmmmmllllllmlmll mlklm mmmmlllmmmll;lllmlllmmm+mmml3mmmmmmmmllmmmllmNllllEmm-mmmlml$mmmlYmmtmmmmmmmml+mpmmmml+mmlmmmm3mmmmmmwmmm2mmmmlEm6m?mm6mmm-m?mlmmCmmmQmmmml$m mmm$mmlm mmmmmYmFml:mFml:mHmlKmHmmlYmm mrWqq_qqqq>rqq_qqqFrFrqIrqIrKrqKrNrqqqNrqqPrqqqqSrrqqpoqqqqqqpoqpsqqqqpsqqrqqq^rPrqcrq^rqcrfrqgrqfrgrqqqqjrqqqqpq#qqqqqqqqqq qqqqqqjrqqqqq{rq{rSrqqqrqrrqqqqqqqqrrrqpqrqqqrqqqrqqrr rqrqqrqrqrqqrrpqrqrrrrqrrqrrrrqrrrrrqrrrqrrrq+rrAqqrrrq2r0rrq0rqq#r rr2rKqqq#rrr rqrqrr*r6rrrrr6rr@rrrrrMrrrrrrQrrr&r?rrr$r*r0rr&r=rWrr@r0rr:rr0r:rWrMr0rrr=rrXrrr0rQr0r$r0rXrWrrHrHrWrUrWrarWrrHrrerWrr7rqrr7rrrrWrrUrrarr|rErs|rssArAr}rsssersJrmr%rJrnrYrsarrWr snr sYr%rsrssrss[rrs[rrrs~rr9rr\rrs\r s~rr9r strr#str#s$s'sirrhr's$srBrurrrrBr.sr.s/swrr1s/sur1swrrr7sr7s8s8srirrsssBs9ss9sqrrr>ssHs!s]ss!sDs]ssErrsDss}rssssKs;sMs]ss`ssKsmrsCs9s3s9ss@s@s]s`sPsssLsassOsssrssMsasssLsVsssTstOs]sSs]sbssWsssVs&sssbshr#sms&stssSsTs]stWssmsttrsttfsr/stskst?ssdscss4sss4sdsts!t "t#tcs?ssssssnssnssnssnssns!tsYssrJsrss#ts8tsUssJtsrQsfss8trQssssUssUs^ss?ts?tsYsr\sr\sr\ss^sssr\sHtsHtssJtsesssessssgsssgsStsStUtsUtssXtsXtYtZtrvsrusrvsss`tZtsmtsssetset`tsitsitssltsltmtssrsss9ss]sssskss{tswtswtss}tszt{tzts}ttsttssttYtsttssttssttsstt ssstsssttttststttttttsttttsssttssttttstttsstttsst ttttttttts,ttNtttstt tstss$tt'tt-ttTtt[ttst(ts t(ts tttts@ttt@ttt,tttCttttCtKt;ssPsstNttttt$tAt9tstsAts$t9tstNt%tstFtFt%ttt'ttt-tttTttt[ttttgttt[ttVtttItt3tLtt3ttt4ttttnttstgtxtjttvtjtstWttvtt\t~tuVtxtuItxtu\tns"tt"txt"tt"t u"tru"t4txtntxttxttxtutu^t+tat|ttxttxt|t0t+tattxtot^tuuuotttuntdt:ttdt#ut#u$u%u:tttxttBttxt*uMttqttBtqt$uttxtutt*uuttMttxttt8ut0tt8u9uut;usUttt%utsZt9ut;utsZt_ttFut_tttttFutttfttQuttttftQupttSusmtsmttptttSut[uttt[u\uttttttytt`ueuttyttttteuhut`uthukutttkumutmuttttsttttttt\uttt|ut|ustutstuttutuutuutuuutttttuttttttttttt u utttutttttututtuuuutu uutuu u utttt uttu u-u uuuuutuu-uKttuuuttu/uuuuu'u,uuuttuuu'uu)uu(uuu5uu/u uDu:u5u0uuDuuuuEuuGuuutu"u7uEu uGu u7utu.u.u uu uLttt"u&uIuuWtt~tt)u,u1u u^u uu1uIutu&uuu^u(u,uHuuufufuHuujuu2uuu^uuuju2uTuruuTuuuuTuuouuuuuMuvsuuJuvZuuvZutuMuLuouruvvsuLuuYuJurut%uuruuruvXuuouvuvvvluuruluvuvuvvnuuvuurupuuv?v>vu]uuu]uu]ubuuHvuuuubuHvuduuuduuuuthuuuuuSvuSvuuVvuVvXvuXvxuuuuutuuuuxuuutuuavuavuucvfvucvufvuuivuivjvkvuumvmvuuuqvuutvutvuuvvwvuuvvuqvuuuuuuuuuwvuuuuuvvuvutuvvvvvvuvvuvvuuuvuuuuuuvuvuuuvuvuu,uuvu0uu:uuvvvvvvvvvuvv"wvuu#wv'wv+wvv!vowvOzvvuuzv{v{vvvvvvzvv#vv v/v{v#vv{v|v!vvu v|vvBv~v~vvvBvuv9v3v~vu9v~v$vu<v-v$vv-vvBvLvvEvEvvv+v)vDvv+vRvvLuuuuYuuvuu@vZvvFvJv5vZvv@vvFvvAvgvvvCvhvvAvv5vhv v vGvvCvvvWvvvvv[vvIvWvDvvzvGvZvvw|vwwsvwzvKvsvlvvMvw]vlvwvxvPv wIvZv ww wxv w]v[vZv|vZvw`vvvwvwwwnvwdv:vuvuvovw`vlvrv:vdvrv"w#wu?vu?vu?v'wu?vu?vnvv+wLvvpvv.w{vv.wpv}vvvLvvyvvNv5wQvvvQv~vv9wNv{vwvJvv8w>wgvvv!ww8w%w@w:w@www&w@wv-ww:www%wv&wwDvv?www?wKvvw3wwvw\ww3w(ww\w@wwOwOwAwwMvwPvwfw@w(wwlw@w6w=wvw@wkw@wzw@ww6wAw ww=w ww@wwfww@wTwwvBwovww@w xfw_wTw)w_wNw[wxNww\w w\wx x/wlwVwqw xVw xwsw[w)wyv+wv+wv+wv+wv+wv+w0wvwsw0www0wqw/w2wwmw2w]wmwx]wxwwwCww!xvxx-x>xxxx,x@xx,xx-xxw'x4xw9x4xxxw9xxwSxxxSxxy-yx>yy?yxyy1yxy1yy?yyyIyyyyxyyx"yxy0yIyyyy(yxyUy#y"y[xxyyx#y0y(yyy/yyJySyyJyyyy)yyMyfy^yyfyHy`yyHy^yyy`yyy.yygyjy ygyPx yDy yEyDyyyEyyqyyhylyyTyZyyTyyhyyzYyzLy~yzLyzzQyzzQy~y*yvyx$yx$yx$yzNyYyZyy*yzcycyyzzyzNy~yzyzyy2yyyyz2yiyzy!zwy!z9yryy9yryyyyvy~yy~y(z)zyy(zy-zy-zy~y/z4zpy/zypyyiy~y4zPyy)zwyyPyyyyyzSyyz$z>zFz zFzzz zzzzzzzzzFzHzzz6z$z6zjyyyHzEzPzzEzzzXzzzzXzPzylyyzZz&zZyyz]z&zzzZzzzzZzzXzz]z0z^z_z^zhz^zz0z z_z9zezez zz9zzzhzzzGzzazxzGz^z#zazzdzz%zTzdzQz{{`zTz^z`zJzz^zzFzzqzy!zQz#zJz%z {ztz^z {+zzqz%zz+zzzzz1zzy/z{zz^zz1zy/z{{tz{{{{zz{z%{z{z%{&{zzlz@zzzzlzzz@zz&{z.{0{zz0{LzzzLzzzyOzyOz zOz6zOzFzOzzOz.{z{z={z={zzzzzzzzczzzz[zzz[zzczM{zM{O{zO{zzzzizizzS{T{zzzzzzS{zzzZ{zzzzT{za{zzza{c{zc{d{z~z~zzzzzzZ{zd{zm{zm{zzp{zp{q{q{zzzyzx{zx{y{{{z{{zz~{z~{{y{z{{yz*zz{zzz{{{{{zzzzzzzzzz{z{{ {zz {{{zz{{ {zz {{zzz{z zz {{{z{zz{{ {`{{{{z{{{{z{{"{{{z{{{{zz{{"{/{z'{){{4{#{{z{){{4{#{z{z/{{${{{2{{&zz^zzzzzzzzzz{/{{{'{/{{{{zB{({7{${/{{ {9{{({7{zz3{9{z{ {{2{/{{/{xzzB{/{{:{{{A{{{N{3{/{{N{R{:{/{L{R{{L{A{/{{^{R{|{R{g{8{{g{I{r{{I{{r{{W{D{{W{{}{{{E{z{|^{{E{G{}{{G{{R{|{R{{R{|{||{P{ |{P{ | |{b{{|{|b{||v{||j{ |{||{1{|s{s{{{{|1{|{|{<{{'|w{v{{{<{w{{'|)|{)|*|{{{{j{{.|/|0|{{0|{{{{{/|{zO{zO{U{{.|{{{{U{*|{{{zZ{B|{B|C|{{{{F|{_{{{C|{F|{zc{M|{M|_{{O|n{{{{O|{{{{n{{{{{u{{{{[|{[|{u{{{{u{{{a|a|{c|{{{{z{{{{{z{{{m|{c|{m|o|{o|p|q|p|{{{{{q|{x|{x|y|z{y|{{{{{{{|{|{{{{{{{{|||{{z{/{{R{{{{{{|{|{{{|{||{|{{{{|{|||{||||||{||{||{{ |{{|{{{{{||||||{|+|{{{{|||{|||{{|2|||||| |||||| |2||||5||"||||<|<|||?|||?|+||{|6||&|||||6|8{{D{{|&|z{{|5|||Q||||R|S|D|I|3|Q|]|>|D||2| |S|R|]||I|A|]|r|]|"|5|P{|{|{|w|]|Z|]|||]|||]||]||>||3| |||A|||@|u||r||@||||]|s|V||s|U||}b||]||R|b|U||]||w|} }| }|t||]||]||]||]|}}d|v|}d|{.|{.|1|Z|{.|z|1|4||~|4|{|~||]|}|9|9||}{||z|||%}%}|'}||G||}|||E|E|}||G|}w|'}|||G|4}|4}||6}6}|9}|9}W||||>}||W|>}|W|||^|||||^|E}F}F}|{c||`|E}|||N}|N}O}Q}|Q}`||||O}|||{p|Y}|{p|Y}||||||||_}||_}|b}d}|d}||f}k}|b}|||||k}f}|||||||q}|q}||||t}||||x}|x}t}|z}}}|{|}}}|}}|}||||||}|||}2||5|| ||}|}z}|||||}}|}}}}||| }}}}||| }|}|}|}}}}}|| }}}| }| }}}}}}}||]|| }|S}|}|}|}}||| }}}}},}}| }}}} }| }}}}}5}}}}|5}D||| }0}|}}}0}}}=}}}}}}} }}}}} }} },} }=}S}|<}$}|}(}} }<}S}J}S}(}$}}} }u||}J}}}B}}V||}C}t||}}\}}}\}B}S}K}?}}}K} }[}C}S}A} }}]}[}G}]}A}}v|}}}m}}\}S}}Z}}}}P}m}S}~H}Z}S}~~n}~P}S}n}}}}s}}c}e}&}c}M}&}{}M}~H}S}h}}}}}}}}}}~{}}}~}~~s}~~h}}}~:}|}v}}}:}}}|}g}%~v}%~'~}'~}j}j}D}}}I}}}}-~-~}/~2~}}I}2~3~3~}5~}}8~}8~|O}:~<~}<~=~=~}A~}:~}A~}}C~C~}G~}}}G~I~}I~J~J~}M~}M~}}P~}P~Q~|k}5~}T~D}}Z~}}}\~}Z~}}\~]~}}}}/~}d~}}}d~}}]~}g~j~}|}j~Q~}T~}}}}}g~}}}t~}}}|}t~}}}}w~}}}}w~}}}}}~~~~}}}}}}}~}~}}~}}~}~}}}}~}~~}~}~~~~}~}~~~}}~~}~}~~}~}}~~~~~~~}}}~~}}~~~~~~~~~~~#~#~~}}~~~~~}~}}~}~~ ~~~~~~&~ ~;~~~} ~9~}~4~ ~9~} ~~~ ~~~~D~$~4~}}D~?}}~G}}~E~}~E~~~>~U~~~~>~~~[~"~ ~~O~U~~[~ ~;~~O~~~~.~~~,~b~b~~B~0~~?~e}~~,~~B~~.~U~ ~@~?~U~F~ ~~e~~~E~@~f~R~f~H~f~~R~~L~v~!~H~~~(~^~c~^~f~g}~K~e~F~v~!~~N~ c~f~~L~V~(~ h~N~V~h~x~k~x~y~)~+~u~z~+~u~y~{~z~i~x~{~)~k~h~S~i~l~~#K~f~~~'~'+~}A~~~+#l~-~~}~~W~}~~~}M~-~6~677~~S~X~~;<~~;~~W~~X~~~B}]~DEE~~~m~~~~~~~~~~o~~NO}j~}j~`R~m~}j~~~~~~o~N~Y[~[\]Y~]~O~~~c~c~~~~~~k~~~~~~~k~~~~~~~~p\~~~~~p~}~z~z{|~~|~}~~~~~}~~~~~{~~~~~~ ~~~~~&~~;~~$~~U~~~~~~~~ ~~~~ ~~~~~~$~~./.)"~~~0~"~~8$8F~440P"0~~f~~x~~~~~~%FP5~~G~%HFG5T~9TH`9d1=n2X`FdFn:X:ZrZI?I?1F=FJ^vih^&hj j &*lJrl~+*~+~+uuxx>!"#>+~m~mwmm~D+m"~D#3w344QQ~R RRFRrRAAaCCFFa!ԀaaـLMoo]7<]__=~{bPggiio+~opEp}}~~/)''    $  $,;ŀŀ<EȀȀ<̀ ̀΀:΀2Ҁ%ҀӀԀNG&=؀N؀ـӀ&OL>>߀L߀-1O(M`M-;,vi` E?^ 0?7 @79:E%E@0^9^QeKeKnnhQ^m!!!!E!=!mm*Wt*XtWaX\5\b5Bussub""IyyHxw'BB+'x{DHwI+D{668899<<??@A@A_HHKKLMNjÀjÀNƀǀՀƀ[ǀ[ɀ€z|ɀЀۀ€zdЀzdۀ|ڀ܀ڀl׀l܀݀׀րqtހqtwˀހրw݀̀Հ{|ˀ|{̀ππ ,  !(0 GԀ7-(ـ1ـ,$!((ā7ā(,F́́-΁Ё/Ё΁#^ha#F4ف4ف./FG.FZGZ0()F)\I*I\*FaaF:FU3 UOii :O\}}FQQ ~~x_ 1_mR  mnR1ku5ku5j!!##&&'')BBj)00MՀMրMMM7<=n@@CCGGbJMMJOPTǁˁOTppǁсXXZ]Ɓ]`Ɂ`aaffiׁijπ(FzށƁсjׁށzZǁׁށ ҁɁсҁ Ձہہ݁݁$Ё((: ܁6:,, ƂN:H:ƂFe:{:܁6+BւDQق6B+3ւDQFقނ*UVLނ^:6VU*LN_:Hb_ bxgeK gKh::hYRxRvnvS[}[{c ^N   -WWd-Sx1m1c}kdk$=$pu==mI,p,ssI00t\l55сPPՁPPP>ˁT>t\qDDIIrwNN‚RĂRlyĂqr^тς‚w^yɂ߂ʂ|~ɂgʂ߂|g~тÂӂrӂ˂˂rÂvςvyyڂڂ  :%Gcł  ł%͂͂Ђ Ђ  Ђ##Ԃׂ('ׂ'ÃÃԂ CGC˃8˃( %8</G.<ރ?Yxn?}.ރ/3%\cc\_K_212W  L ]3G\iZCi\cFaFZLKn]K[w[u$ d ocounacttff"#@{@){#)"+p../1z1dw5z58|8<|u<==@@AACEFEFŃCŃ/QQXX[ƃ[^^߃aa߃ddggijkipʃpqjqǃ{ǃ{~~׃׃  k  ʃȃ!$ ȃ ̃!̃у0$у&((& 0ڃ%*ڃ*$$҄1Kaw҄3;ԄՄՄ> ->;Ԅ3܄ ܄URVRU'V, J9JB,-BY7SH6SY4924 7Zbb:NZ?NTW\T\DHccW]L_M wL w]  _`p++++++G`:6hh } l%IlD?%''W?u*EnCnI*uGK6K6z9e}9mBƃXB„^EÄozeMÄMNOgQQsVV„mNoOsӄńĄ˄ӄӄӄfńfh˄hӄ̄mmqڄӄӄqrrӄք{||{քڄ̄ф$;-2Zф % ,.,)3737+7<ل<)(ل'܄ (ąDžą DžɅ+Ʌʅ8>/>ͅ΅ͅ8҅D΅/҅ԅԅօIօ:S!S$ۅ"D>ۅ$"LMI7ʅ+;[;^U=^]W ]JGTJTXGoYonHnttHZj  Zp_***p=[QU?y"l-"y?''(EӄEE)E7EE(D377;QĄQ?r?PEEGGKKL…̄hP…PQTTUVхՅrVх]]__Åbbccυiijj˅luLυÅuvŅv̅Յ˅̅ŅՅӅ܅. ݅Ӆ ݅ ƅ ƅ-܅>ʅ:ʅ-+/+/ЅЅ!օ5@fgs9̆5̆,1ΆΆ,[UWXYRM؆<؆RN=<ކ=ކ߆߆)@)NW2WH5j2_f gA skAk9mIyyFIFz}n}mzp n  p  a%'%S XX}~a~ddh337!!##%oS}%,o,-.2Ow2Z{{.O{QՅUÅUUwZFFeIIeLLOWdžlll}lllWȆdžȆO\\]ɆцȆaɆaȆddȆ҆Ȇhh͆ȆklȆkr͆l҆ȆrttuvԆȆȆvԆ]{u~~φՆφȆ{ԆՆ  * ˆ11̆M̆ˆ* ֆ1ֆ++ÇćÇ/ć4ʇGʇ4/̇·;·Ї7Ї҇0G/0և؇և݇8;/݇7/3V"9҇735؇78/"/<6j Si AiA9m65m<mZho@SṁGom@KZ%_p(({-Ȇ--/-m--p2ZZm_m: | n:|n''())D,(,22i37788;?^?ц]F^FGGJMMJLJqLJhUɇɇUs‡qՇsՇ\\^ч^``ȇƇهȇއԇffއˇkч‡kl͇Ӈlڇׇ܇ԇqrx܇͇qׇx{χχ{ڇˇ߇ ߇   ۇ#*ŇŇ *҇ 5ۇ5>#V݇ȈAȈ LHψLCHψшCшjKQ׈KA>׈I-RIR-.++.IHX6SYXHYSKa m99VV mNtONZu6HaHOeTetHunonTcZe cpe w$w$oas|300vs3sDp;;;‡;ه;ˇ;?v|DyEyE1133MWz}P:z:==}W?[[GƇ`GˆbJbÈNNPQ?ӇlJˆPQrrr>rHrerֈ؈aֈa҈ccf߈ɈfLjp߈pqqʈڈ̋ 3w|ʈو|Ј~~ЈňLj҈  ۈ ۈ""(ƈ'(ƈ.ˈ'.ӈӈQш--<‰<‰*C*ȉȉB$;B;H$KщSEH4SK4ډIщډI߉E߉>_n'6Hˈ'>zH6rHH}H2j@2 @AA55 ]j]el\HHHl|ezHLRrRL  y%}y%sv\UsU{obo0{0d"!"&!d?&*gÈ?g*tFGt006uMTuM6؈QڈQQT@F@CCDEF҈aɈailjوaFDikUEkUXX\\lj``ӉcӉceۉeňHۉs̉܉̉܉sΉ݉xx݉~ ~މމˉˉ  É(É (C‰ #$ $;; /Ŋ Ŋ_߉$/<8<8Ί4 Ί4%5%֊֊5'I'IOO])Z]Z-)-A]A bkk=b79K= v7p79vbKv??dlPPld+p QQ  V& VVq+q22qy:ybf:!|!|f%w%&Br&BwGGHtH4t48R8RXrXEEFG͊eΉeFGŠmmTTVu͊Êz؊ڊ\Êu\؊Vbbڊz~ƊЊiƊ~~i̊ϊn̊nҊҊttNJyӊy}׊}׊ъȊ݊Ԋ݊ȊNJԊߊՊՊӊۊۊ#+يي ߊ   Ɋ,))Ɋ ފ/ /#++ ŋ9-  , ŋ  ފ93#̋׋H=0ً=37Њߊ׋HًSQSI݋.'U.I݋'UZ(BZQB(O7OK1;YWKaD[]aWQ;Y>Md[MLuwJDdLuw|Nmo$$N`o f>QJQ `z{2^ef2zeg55""^m?g(hh?(*q*PRŠGr223vXrP::R_>XqCCv_>IILƋLjOjȋRϊiORsɋsЋɋȋ`Ћъy`bʋb֋e֋efދfkڋkNjʋȋNjssuuۋw؋{{}؋} -ڋȋߋߋыҋҋËыË̋Q̋m̋̋̋̋  0׋ ČČD/ G /=4=̌4̌DD7D'D1]׌G׌#XDP݌#rD݌ߌPߌD$ݗDϘD$d.c|.YFD=DYTD9DDyDDDaQaGDDG{^DˡD^g o o,i,[,UW[W3ȋ3Uiۋ399$$?v?C,,?ƋI115v577;Z;SZCCS_F_FbދbLLʌnjkTnjTVԌVWtٌŌŌt]ٌw]wwwʌɌ͌}Ɍ}ԌʌiikkތmތoЌ܌Ȍ|܌ʌmЌo|ƌƌWԌՌ͌ό، ، ʌ͌Ȍ"%*&%ŒŒ&Ռ"" ь 00ь׌d׌34c׌Í3T׌Íō*ōƍƍʍ?ʍHG?GH'`G"#(#dGpGKGQgލ(ލ--UJ>>qGxG?vGJ`wGjajdGtGprGyGK`GXZXGGG x `uq)vs)swll!t!"%y"r%&)&),,-1z1LNMM;NM;->>BBDDFFǍbbcǍbcPPn΍V΍nVXXYYэ[ڍ][||ό| |ڍ|iimٍٍˍmnppˍrڍڍxۍnэڍxrҍڍ܍ڍ]э܍GڍJHۍڍ׍ڍҍڍ׍$4 $'ʍUʍ ύύ7ύ9.7.Î9ÎĎŎ  Ŏ Ď9LJ̎̎Lююӎ'ӎJՎ֎aڎ*ڎ4H܎$CHC'JՎ((JZ܎4G֎/\GH00HM^\MIu _IJ_TUokkO/JO^HzUN*JzNtNNNoTNz&U-+z5tb5b6{{6s8+zsq@@'A'qK8tA00K7zR7RQQZ`ZDYBD`BccdȎˎˎdOȎOlƎjƎjlXXYYҎ[ێҎێx׍xߎێe׎ێ ێeێEێɎ)ێVێێێێێێێɎx͎x͎ʎΎ|}ێێێێ5ێ3ێ׎ʎ|Ύ7ێ#ێގގ [Ҏ&ێHێAێKێnێwێ }ŽŽ Ď   ԎԎ9;9:ŏ< ŏȏɏʏȏ<E.6.ɏʏ6P6&L&ُLُPW*Nێtk$*W)QFIFQINNZV] ` g U]Us= Vu`us=\n\nGg~z~!Gz!_+V_! ZN lRVR++,lv,ovoh/h/ffa"a"?w?w))H--H1122466S4STT@@Cߎ[C[FFccMMiimmҏWҏWrÏrԏtÏΏԏt_Ώ_aaccۏǏۏ܏g܏gllϏ֏qˏϏqˏ֏yߏyzzՏߏ͏͏ڏڏԏЏ Տݏ  ݏƏя;:$ ŏƏ0ӏ0я5ӏ$я %%׏׏3 ؏؏ <%:: <? ɐ?ɐʐː7ʐ! 'E8Ӑ'!8ӐԐՐBIː#ՐHڐBڐ9ZܐݐݐHԐ&ܐ9AG[G[JJ**L] LUKHUoo nYmYmTNTw`fODN(`kxnk+}O}Qdh x(w dh+;p)p|vvbwb;SpÐߐ((){&FV2e256E8J{S<<Vkˑӑ HHrÐǏcce~Ð052*r^6ސrHa^ېސ``ېhjÐΐ~ΐ͐h͐jlҐЏlߐqҐqѐvvxx||}~}ߐŐѐא~ߐ֐ؐ֐  ؐĐ#Ȑ#Ȑ+ϐ&"Eː"ϐ+*IՐZՐĐǑ'Ǒ* ' ,-,͑ϑEϑKG]K͑-=ؑ>>=Eؑ3Xڑڑ3ܑVNVEܑ@DfFM/4FM/Q4J8I@XEgIgJ|iJiO!kO!k%ku%muQm..[kr77r<t#Bt)knBn)#L//1LzPz:P1:;<;@@BFF<KKƑMBoˑMȑsȑlɑloۑoɑs[[בۑ^ב^yёёyŐ}ّgّא~}gޑޑ̑kklˑݑґˑl֐xx̑ББݑґˑߑӑߑ ÑÑ$őő  $%Ց0%GϑXϑNϑՑՑ=-Ē-=Ē8 8ǒ2ǒ+˒Β"ΒI+˒3Ԓ4CԒ֒*֒ CH3P " 4!P(!(>6aS6>hSD_ h_ QEtNtDu9jduj[ƑIC&Etd Nt T9& ߒtttt Tttct't#tttAcs;%s%@@AGm,,mG0!t0Mtdt77RR==XXXCC’F’FHHffQ\QnVnV̒oҒo͒Ғ[\[͒גwwӒӒՒגbbՒeߒeђɒȒȒђmɒmnnqqssؒܒvvÒϒؒВÒϒʒْВʒݒݒْƒŒ'Œƒ  #ڒے*ޒڒ*ےޒޒǓǓɓ!ɓ"-"̓I̓EEIГ)>>ӓ$@ӓ)ۓ$ۓޓ66RޓXX8Г!GMG8JdSOOSjk  jW iiWNkopkJ8oKyNy?}N?}kK|a |TP ka&&Tk/tēkf/2ptfkkܓk2_:_ԓkkk{:{kAAkk,H̒H,LLUY99]U??@\Y^]@ē^cœcMœђeMhʓlʓh͓l˓l͓qYܒqY˓[x[֓xΓ֓``Γܓؓؓ“ii“kmmғғtƓtuƓyԓyzÓzÓѓѓȓȓkܓדݓܓדuܓݓ$ϓՓ#($-ɓ#ߓ(ϓГ$@Г$$ٓ$ՓE$]$ٓRۓ8ۓ Aߓʔ ʔ:J͔͔:6p$V$6/NRՔNՔהEהڔTTSڔ&KAK&J/R=c=7\Z- 7Z fPf. E- . j Uj]UlbOlDbDOTF!~^L~FL!%p)nn%^Q)QVd]do>qr>$v@'BPsroBs$vw22w55wP::<WC<CWHHIIMMNNRRSk̔]̔̔ٔ̔̔]˔̔`ٔ`c̔ce˔e̔iє̔im̔mDov̔̔#oєSvy̔y{{}}̔ΔߔΔ̔ߔ  ۔۔   &((.&., Sהcה\הÕ?ÕŕBŕƕƕ ȕʕ"ʕȕ&)K,.ԕ)EKԕוE?.וٕ8ٕڕڕDߕ#B.ߕ@T .8K.@J1TLV16".VY6Y_apbq_LaLopnbLXXnww[|[w''L'n'|''~~d|!"#!qq"#C--I̔III.IKI7799||??@@DDĕFFĕǕLLNPPSVNVSXϕzϕҕҕzabddeabɕΕ̕eΕ˕pprvɕvwەەܕw͕ӕܕӕ͕ѕՕؕؕѕ    ֕ +֕ 1–% 5ȖJߕ–%Ȗʖ4ʖ1+4+$B.$+'+.AՖBՖ&Aؖ&ؖQ+'f+MTM/W/ Q\Z]+QYY^W \T_Z ^ 8 `8sHcK`_^dfǕHK|s c g|}}(**]h(g~~00h~~j:~~":j&&((++,,.5~II~577~S.ikX̕X"˕XDlGbmĖLGDxikĖmlqqrr rrL^^xÖzzhhݖjՕÖɖݖɖŖjŖƖzҖҖ˖zƖܖۖϖۖږіږϖ˖ܖזזі ǖ#+~Ö/# 5̖ ǖ /%̖ӖӖޖ'Ԗ':8:ߖ48ޖ>ߖ/Vߖ>0;>Ԗ-0З-З;֗ 4/ ֗KVKWXXܗWܗݗEMC2E2Z)9)Z[)CZM1NIYIYN1O 6O6dR9Rdfwfw[[_$mm_Pp*u Z<sPp$u||si(i*]]rr||=``||=<)0)FqF/q/03vv3557|SSSS7@\DD@\GIɗIggkGϗkϗTɗTXXYYtӗt]ɗӗɗɗ]їɗdgޗɗgiїijҗjޗҗԗ—ԗr—rssߗʗʗ{ߗɗ{ޗۗחחۗdӗ  %$&&  ++1'1)ݗ|ݗɗݗݗݗݗ-2Θ-ΘϘҘ"$Ҙ.VJJؘVؘ" . % ޘ%ޘߘZW_^ߘZ,f,4ac6oU64UcaZq=q=xUaaUExENmh N   e_W)emc^Wtha7l#l#k%nnk+m%+FGFK3K377<<=>>`F`FbKĘtbKpPPǘSSȘ˘ĘpZȘטZ֘јsטb֘ט˜טטbӘטטff!ט٘jjkmnkܘ טmvט,טvn˜.ט{ט̘͘{˜Mט͘՘Hט՘\טӘIטpטoט '2  Ř!  ϘWϘaϘmϘϘϘŘ!:-:ژ""ژÙÙř,ř&ݘǙݘ.Ǚ//&͙f͙ΙLΙә@oA?!2@әAݙ2ݙߙMߙHJaJa`'`'\\\Ih chUicUiop Iklgd$]  ](}r$r(q0^+[[0q}x7g=ט==6===p^xl212gdǘP˘PјP]љٙș F1FGJJG٘ffƙPU!PܘnUWљWXYZ[Z]^^ٙ`a̘{ddXљj`ٙjkƙaٙkop[rs]uv֙sș vușԙԙoYљp    r-!  ͙LΙ?͙ЙЙ666י.@6T6יŚ.ŚV6!Κ@>6=6Қ@Κ:њњҚC%՚C՚ךTךؚؚٚVܚ>ܚ=OSOSN6_6\6l6Nb<\le5x A6m6b_5ecQAQcmf~~fg ||ٚV hli}n/}/2gl  "n"i''BBGƙG0022MM77==??AACCaKKȚNNPPQݚÚTUQ[x˚[֙vÚxvTݚb˚bUӚgšښǚkkgښnӚnršǚrԚĚtutԚuxxƚƚޚɚɚК|ߚ ۚߚʚʚ:Κ$%Қ $6* Û6Û8ɛ*9 ɛ %&̛&Л<Л̛%ԛ8ԛS؛9؛ڛSڛܛRܛRXM(+MX+(,),^D-hFhLh -X^XDX\XW\OeW_qvL_Oqc#}w."c_m#Y}`m`.Z1Y1Zw_~""s$sp>j>AAȚAzpjE//JEzJV8Y9=8=??VBBDEF$FbPPQREDRWWXXZĚrޚuQZaa՛˛śf՛f˛śě˛КX_ۚƛ˛~ƛ ~˛֛֛ߛǛߛǛٛ  ݛ0ݛ7ݛ;ݛٛʛ &ɛ ʛ11ћ0!%#ޛœƜ7#ޛ%Ɯǜ)˜;ћ˜Μܜ;ΜG0+GFœ0'ڜ+&ܜڜ[ޜߜ['e(3ޜ(v_2-ߜ)_2Iǜ7:smT^cH~VMT_^ V yM*vr*Ts4vr.ttk499˛999).k_Ik:.s.mT1Usy88\kU1\ĜGĜGHěaHKRŜۜKRSϜuŜȜSԜuԜ{{ddeeۜhȜhk͜͜knonoqqrsrvvwwМݛiќМќݜs ݜ 2?T! =˜̜̜)&˜N  609Y؜67؜):7:ÝÝ23ܜƝǝ&*&//-ΝΝН?НѝIӝƝ2LIӝLǝ2X<۝X۝ܝܝT=ѝ?HNc9Yj3jaa>lill@x?|AZY@ixi|i V[ y V AiZiyifixf{ { !"#ii!"))#.~.}J4Jz459ϜR9=}5~=\BBC\CHHIJ˝JhPPSSTUTUI\\]b]ϝbcecԝϝie̝̝ȝlnos͝ԝnswiҝo֝wxyҝ~~֝͝lҝxם؝ם՝ٝ0  ĝ ĝ&ŝ(ŝ(*ǝ '-ڝ<ӝ&ݝ,Ğ-ڝ8 ݝ'Ğ 8Ǟ81ʞ˞ʞ:Ǟ$$:1@23˞@>+O?,8؞O؞ٞڞ$8ٞWڞ;;%A>>D/+802?g[   W80jA8D/8kKXragjakjrpp Kj*vXj MtY3tY*Mjuzz.uvj{z3|#9#%%Ej{)},E)}˝JJ,{99;;<<CCDEDGȞJȞJOEȝcOQQSS̞ƞ\̞\^Þ^yÞԞ؝y՝~eƞɞŞ͞ɞžٝԞeӞӞž{Ş{}۞}ޞޞ۞͞8j{՞О Оݞݞ  ߞ ߞߞߞ(ߞ ߞ'ΞΞ(' (=.%ٞ=ßßğ?b? F?ğk?ABA?Hџ*H՟>џ*՟1R$R?۟1۟?Ɵ?ʟ?:T:7?˟?.bK>BoK֟?̟???o7T_h_ȟ???Yz$BFɟ??|YPVMMLI P kj]c]kwwWIzttx""##um<(m())pux1GԞG͞G՞G123277~S3>>AADDEHEHIIKdKPpTTU]ʟUƟdP]^_^e˟_}efh֟hj̟jllmpȟmpy wwyߞ? .f˟ɟ͟͟  ޟ  ޟ   .    , BğTğ   ,*+*M  à-Š-9ʠBF9àFʠ͠JŠF͠Π,ΠGԠCԠՠՠ.,.WhzLVB9$[XW$,X054J9:iVd5G98jcC9W:Rdk\zVx\M S 0WQ`Qt/taa/g8igs~7777S%s>%(Ri(ki,u,00v4u455|P<<Z>Z>BG|GccBRRnnUVU֠֠۠ˠ__a۠abVeˠeggjjkנkנnĠpqrsɠyȠnǠsȠyǠ qɠ}}b۠pĠrɠϠϠݠؠؠݠ  ޠ+9W4iz Ơ Ơ).) +!ӠӠ-![ՠ-ߠ.ߠʡ.+.ʡˡ$/Ρ$ΡNK.ҡNҡӡSSTQ1f{ӡYTYYQJYYY&J&.ʤYqYۥYY173oH$Y3o7` .YYYYYu[ųY1YdXzYXGYY`YYYd[v,\,2,Y Yh2tthf!{!$$~'~'+v+,CLCvL55ZO`zO;@@ZBC;,LBLilOiC klOɡѡաѡ]ɡ]^yۡѡbաbc֡ϡhۡc֡ܡѡhjܡjllpѡѡprrtޡt^ɡ ޠ}}סѡߡޡѡ̡ڡ̡סڡߡ    á áС--/ˡKˡСݡ(ӡӡѡӡӡӡ"ӡ".ݡŢ("%.Ţ<44<E<DТТDH[z\E)M%"Mߢ)ߢH_d*=*o*_Hde>>e `=`7Q IQITVJVJTaouZuyysv!! UN f ggq fqok\vsNsk888Us''FFn/n/11226699::??@@DDGHĢMGϡbMQ͢͢Ģ٢ĢQc͢VVWϢ¢WĢ^Ϣt^HբɢĢbcbĢg٢gililmmqqɢttĢƢĢ~~Ƣݢݢآ آ   ̢ ̢  -+ע!+!-AעA*ĢAvA0NAC07a֣C֣ףףN=I="ݣ<ݣ<I.ZZs`JBBUU3.AJAZA`A>aBA>\BxvLKJxKzLd  P  X)n\)zvydvXvy\Pvnvze &we w&@@po-p-..}2}2446Q6¢QբQ==?CCDʣDGJJOʣgOϣRR?UUlrˣ\ˣͣr\G``bͣbƣѣƣgƣgiѣikkޣޣƣvv yyzߣzۣۣܣܣɣɣ      " ""ף#$ڣ**$>:Ǥ>ǤȤȤ/ʤڣ:ͤE#3ͤ3/#aEQ@ܤܤKK@3QF^[^[<SSHM1!NFQ<QMNQa8%LjLQjdeƣߣ HtQVQ1aQt8! uu o&Q+Vld%e+~+.]..le~]ee""#$B$?#BIq-qII~I55ϣO~-U<<YY@@EEF_ff_FQQŤŤmTӤTpm̤p_̤_`zѤ|z`Ҥ|iߤߤҤijӤjppqvyyvɤޤ}ɤ}ϤϤԤФԤ# Ф '¤'QʤʤӤʤѤʤʤդդ4ݤ7ݤ 7ȥ ȥ9+¤̥9̥ͥG8ͥG*6ԥ*ԥR֥֥R&Nڥ&ڥۥBZZOBH]PU>UC;Cg=:IlI]OKM=SDg>KSttJ^L r^ rVLnPO %tVnfu%n  w&?wk?&kY,, t3u3ƥ889AΥޥťĥYACCDD9ǥJJʥMOƥOPPMSSqqqq4qq]]^^Υ`abޤyaޥeߥץɥץmߥmoťopqpxqĥ`Υĥbޥxܥ~ǥǥܥ ~٥ ٥ϥʥϥإإeޥ  )+6%''˥/Х/>8̥ Х4˥+0եN֥0HۥMۥDۥ4 O>:l̦)̦ե;Ѧ>ѦӦ7Ӧ7(E(٦FF*٦*BVަBަߦ[ߦ:JEcEdcV1 ldG 1cNN;gGg;fQ:E[EvK  t tlcffQcZYZvc#hKc#$hrHrs-sL-.HuL3553SUU;X\X\EEK_;Kɥe_ƦæQƦQUUæXXZZ]Ǧ]^ĦϦ^¦|ĦȦ|cȦæc~ئ˦kئkmʦmo֦oɦʦϦΦڦЦҦŦyҦڦΦŦyЦɦԦ}֦Ϧ¦Ǧۦ%+ۦݦ}Ԧצզצڦܦܦݦ((!"ͦ!ͦ%ͦ/Ѧ '  /&%'*< )%B*Ƨ&ѧF)B 61<ѧ1 "Ƨ6֧֧קF"ק7G7,2GA0,NANH0T+8H,2_?h_hS98T4sbsY9Y@Y@IxC:I~xh$=~\Yu..æ.Ǧ.Ϧ.ڦ.3 C:>\=j>jD,D,--LL4; Q4;WW@@AAEEFFII˦cLɧLɧNNTTǧWΧWXYǧ\\اΧǧzاXΧ§zcۧcۧ§ǧǧܧݧnզvܧnݧڧǧwvwxyǧxڧŧŧާާ",4YΧyڧħççħ!)!) ..+ѧ/ 3ߧ3>>ߧȨȨ<C<C̨2Ѩ#/1Ѩ?S12#bJPQJۨۨQPG@ǧ xP aP5a5R5M5: f:fe5d]d]RZZDDRMP eaGJ  RUS U--{{^h=hbqbt&q^=&(t()Hp+pz+ss||H3I3)t5}5V<<V>?[[?\\ΨJJgLggLVWYΨYZVZϨ`abddh`hi>miߨsaΨWsvvxxڨڨרĨ~ר~٨ǨǨĨmƨ٨ƨbΨ٨ިި   , .,-'5̨̨̨=̨c̨{̨-.4©©4ĩƩƩ=ʩʩ//ĩө11=өԩթ֩֩KܩXK=X=ܩީީ[^[ԩ1_c_=թ1\0 \Mc@cS e fe  Mf@zIyyNT wr |OI |wrzc 6RUz)RIcNc2j{27}5TcjcU]]67$$%?%gCCDnnD001uPg{5kP5{oYϨYEEGGbpKqKǩPǩPkߨmopp̩ҩé\ҩq\``۩d۩dffh̩hةةͩΩépϩpvکͩvѩ{ѩ{Ωϩ̩ͩکͩ٩  ݩݩ٩ '/    3 S T  8 6&6I :+ê:êĪȪ3Ī7^ީȪ4,Ϊ40Ϊ7+Ѫ)Ѫ=2֪=֪تSت٪٪Tݪݪߪ<ߪ[<'),[(^O^U/OU8/I9e9jlFCNljCFgwgwN#NVsktVQ#tkmQ W m-WxXq-qu11 1l1x1y;yi;i%%''))++--ru00rz|88~==@@]]FF7GIIKKPRϪRUªPUnҪnŪҪ]]^``bϪǪӪ}^bƪӪklª}ǪڪԪkƪڪl~Ū~ɪתʪʪתժժ+&  ˪  ,Ȫ˪2Ȫ ˪q  #۪,ު# 343۪'ݪ(ݪƫB4ުƫOݪ,!>̫!B̫1>.>ϫЫЫ1ӫ.ӫϫ!*ګDeD::ګY*>HYH>J>W5J5sWA>Aa>\;E>h>a\XE~>_Cc>h_|m|      cz+u+ |+qxqi"i"ūǫx GGGԪGɪGIOO??C CFFJJbNNPūPQSooS«īrī[\r[\ǫԫbbfǫsǫfgʪ׫l׫lgͫͫrsuuvvիrիz{{~~Qū۫۫ΫΫzݫ>2Adɫ ɫ..25-¬52Ĭ¬BBADĬBʬˬDAͬʬͬ/Ӭ:EAӬG>KA;_A/&1A]AcAݬGݬ߬R߬:&CERH2_Km1-2]c6ˬDodoIaxIA6ALLTUyeh Uad  'VqV'))q3Zt`3edt`9hdi$i$%'n'9wC*C%x-..*-|M355|Q«Q::M<<}}EZwԫ\xnEF3FLfLNNfQŬQRRìlVVWuWbbc~fլfcլǬƬuݫuŬìƬ}}ϬϬڬڬ  & (&ˬHˬ//>Ӭ(&;;/ííŭŭǭǭɭ4ɭ//M=/=ҭMҭԭ1ԭ#9ح#1Sح?ۭ ۭ>ޭJޭ߭ ?HT+H+>S߭AA4/y/V   / S d pdpJSUdUhdiediIhe [ j   2wASW XKX\\\Gw`2_[dg:j&&A߱++`G0r0jGd7Mdz7 9iWVD~׳DEEKrȭǬcKMMȭȭRȭRȭVȭVȭ[ܭȭ[_ܭ_`9`٭cӭ٭ȭӭȭʭiil­ʭl­ȭppڭuuwwȭyڭyխ֭խȭݭ֭ȭݭ c٭&׭ѭѭ׭   ĭ ĭĭϭϭ,,-9ԭ;;4-AîĮ'FA4îĮ212ҮFҮ'1 ?: ۮۮ:L?߮L߮PQP]I.fB.5Bd53\ ȭ   A ] 'AQ]<Ce~<dT~ex~Txg }}N gYkkh8j{Y~m8Cdm{t>t*>*++zznII2O|O552|RR==W??CCGGJJKNNPPlήTVVT֮v֮v^_خaܮѮfܮ^afgޮjޮjklȮȮk®lӮwwyy{{ϮȮϮȮƮȮƮծ  r    , -   <:<.ïů)ů  ,)fʯ˯3d~hj#0BXBï:0:RݯXʯ:#RݯޯMR%RDRbRޯM%'D['[bNHR˯:77hddYhH\cm\mRURcHnMvRtR(UR](`]1`pWpmvW1tve>""o>r??o/r/11KήKK667;;V7Jqɯخ_IѮ_ǯIJKgȮgggծgg®kVӮkVKǯqsƯxƯͯ_ͯx_aaۯ̯dۯdfɯfghghЯįЯpspįrsȯدϯدȯԯsϯrįѯԯR*Lԯ -ѯ   .ίï)) ί*$*@*A**+ׯ$#ׯ=#°=°ܯ@ܯ>*ɰʰʰA̰ΰϰɰM,ΰMBQհհϰBڰ><*ڰ%(Yݰ<ݰ%'..L5PL'*P5N̰AR?R?mHi{HOivSveiEcEU{EicTSmLU Xuu TwXDwqo6#;#$CquoDFFCJu$w5577а˰>>@@CӰCII̯aMMOORRͰTTͰWWtZZ[tѰð`[а`ѰҰްfҰfgiik˰klmmlӰ԰tt԰x|װް|۰xװ۰gҰ2(ְ  ְ+<)  ,̰Q̰2( <(ڰA3ññAƱ)ƱDZȱDZ*ʱNK%'KJ*ȱʱPJ1'ױ1ױٱPٱNJN6?OEJ;J6SJ?;Y=YB=BS^J^oLJLoJhJh}Qna} Q c-p+Qc+j-yqqja7n !!%h%*y pCC*,,CU141479:;<U;?<A7ð[ް[bb?MMNOO±rıYѱѱrYZ[[˱]^^`9ı±|`۱]f±:s̱ZN۱ϱ̱ϱϱ˱±ϱ syͱ±f۱±ϱyͱܱޱܱ '3# ű #Ʊű%ʱ'αα-α66-=2+=IJ00"IJ̲"߱+2//߱>̲>5&85BԲ@B@$Բٲڲ\)ٲB޲\޲a8$(&aڲ(P.P3gRgRC3n_nhFLwbDcEHCgbcIxIt GQ v**hgevzLgz}}ez#wg#QgA±AϱAޱA2ADF/xGz/tG447799::??BB²DD²iòdLòLMDzDzRRiTXTDzXsϲDzs^ϲ^β`{Ųβ{ffֲ`DznnpزpݲݲtֲDztyزDzy}}~~DzҲDzղҲ ղ  !   !˲˲ Բ8)ڲ³)<³"Ƴ)Ƴdz=.gz8=>*>_޳*޳-OEH-SG"8ZGHGSZHSj[jooYY cc@FlF}CdCr\ erl  v&Uq\lmsss&Us muvzelsl;z#xxus;#s''B+s+w{.II7.{DzMM8M<M799::<>><CCEEGŲ^KGKijMggóPMRSSʳPʳɳԳYгɳ[Yij`г`ccdedeijl̳lj[ʳóijRóγγٳٳ||̳γ~ȳϳȳ˳˳ϳѳѳڳ  dzOdzGdz 00 3";"1׳3 F1ǴǴF,-, ʹ-ʹ? ϴϴ?ѴҴNUND[U۴O@lsijɳTD^O۴^dTbbVѴh2kWQfQq 2D fҴhGhthhhɵhVWnxh}hhhhrk m hurw+ husy!h,hUhhHo*<<nrh*mssoH002L2L::ԳS==>]>]EEfGJJLLNP´RSVRVXԴXSZN\ZԴ´´\ɴȳ~~~ ~~;~ٴɴkٴkmmooȴsȴմstwڳw PԴ´δմִִܴܴ  / ʹ 1DҴҴ1"Ҵ õ õĵ;ƵƵ3ĵɵ3 #AK/KѵҵҵFFA$#ѵ!.))T޵.T!޵ "'[5'I[$A&5I&AseAWAMAeWBMrQyD?Q|BAr|DUOOUnl z(n% %](zb]Y0^|b|_|^|_pp$$'='())+G´GɴGմG|Gv|(v99;;>B`BDD>a`aKK˵µO˵OQQSSӵUԵWX+δtܴtUXεx̵xWεϵյggϵjj׵̵̵ֵw׵";ԵԵw|ֵ|}еٵٵݵ  ݵص ص   ĵAɵ|ɵvɵɵԵɵ00  ,&,öö& /@-Ͷ7/Ѷ7C/Ѷ-ͶֶCֶ5ٶ5ٶڶF@ݶFݶA%A?YlHEHE<bIbڶ5d`d<HT?p?thryqyr~~.hJu~z~q#  a~x~zuT`.22ai#ril~x$l~$&&((DµDtp~v~~1v13v355RRRӵS~յX@@CCDEDGHHĶEKLLNKǶǶĶǶooǶNӶsbǶsǶǶ۶ǶӶbе}}G}ȶǶǶǶl۶Ƕlmmȶص &wwyy߶Ƕ}~~Ƕ߶˶˶׶}޶  ׶)޶ ŶŶ/  )8%ݶ6:6ǷͷB /)Ƿ:ͷBMӷ'I`ӷp/ )8)?)8ݷ"ݷA)?J~Ƕ)UA0UVU0IUuU'M VeJ eJf9fI9uOtvU"MvOPW { xki\+x P\+i|__77``!""|k<<g((F,1sFg1s35588::<YYBC3C<KB·ddȷ·KȷTT^UWWZZ[\[ɷη\ٷeɷeg÷g߷˷k߷ηk޷Ϸηշηq޷qssvvxշxη~~ ʷϷηַзڷڷзַ÷ٷ -@% 6M/.Iѷ*+-+#$øǸ@ѷø$Ǹʸ%ʸ̸/̸͸͸.ϸAϸҸIҸ9F9ٸFٸڸ'Jڸ'޸S޸N2tMSJ6-6`WG`>`k   G6^NJ>^Xouuhh2Jo`H  iH MJ! !w  ],,,,_i`!!r}?=}?&=r&,,-Op-tO9tO9UηUUJU`UwUYٷ\Y˷\apaJJLƸOƸOPQѸLUWWQsPU^^__ȸzcԸȸcԸɸʷhӸzhɸqָָӸqssttոѸи|и|׸׸۸Ѹ۸ܸ*#((ɹ(P(v(1w(Aϸ(((1(..(μ(*ùùŹ5ȹ5ȹɹ()͹͹)Թ3(+(ԹֹHֹٹHNٹڹs(ڹ߹'X߹`(((4[(((TT/Ź.46e6j] ==_ѸN=A}nAn'}j}I x "]Xii"}ι}IXx]fu<d<d$$%%u((++޹}ƹ}0011~44~LP}}U>}>??_IIaaMhMQQRRW˹WZոsZ]ӹ]^a^۹accfĹĹfhimhimܸ˹xιx}޹۹ӹ}~~ƹӹӹܹܹ  ¹¹''*ɹ}ɹ"ɹoɹɹɹ 2"׹"NԹ׹ "N"5" *":"/߹[߹ʺ e߹L"ʺ̺&̺#3κκ#K)6"ӺKӺԺԺNA"Aӹ5&2:*LA67l@@o9o97[oSJkuoSDkDfyo[uyne o nYYoUUoX_{_o\Xo j #pj#B&)B)\o&w0w03355699;<=;=<``GGpO6OPȺRRWWźֺZźZaƺvvƺɺvazͺͺzhúǺúhȺǺߺɺߺrϺ׺wrϺ׺ĺ{{ĺܺܺ˺  23)_""ٺ.444.4">ٺ>4ʻ7ʻ̻!̻?"ӻ?l74ӻ,:I:!4ػ,4IػLL8J%/(/MM4CF%IC4(@48ATeF4@cFxHN{cvANuxvH]\l# \ uv[))]vv~v~nv|vvm ~6 k$kx$%)|=%n)[l--..4466ȺPUֺPUYYDDEEJJŻPPRŻRSUUVVԻXYSXYĻwܺwջabaջgлb˺gԻllmrɻmƻĻrл|ܻƻ|ɻܻ׻׻4v!! " "̻00 7  #ļ>ļżƼ& >#ż'1/ͼμ(1TƼ&F8F,8,9ټ*(ټ9ͼ*Q2Q:H'7O:LZLZl]M]@h@^cW^_4W_}A}mOHq~~~~ ~~x~+q{e~~{e+op~~ϼ~p  ""~%%~'z',,ü~~ۼ~225x6x5678~78<~@Y@EEGGJJNiNiQϼQRTTVVRϼ[[]ü]__bۼ<bҼfۼfhhijkǼjǼҼitڼktzּּڼz̼}̼} ڼ    7 /#!## ʼʼμ2μMμhμcμӼ)Ӽ09ܼ1ܼ9/  0?H˽/˽ͽ1ͽϽIϽҽ-?ҽӽB:ֽ+:ֽ+ڽLڽӽ-ܽ.#)#A~#?pUI?ܽAX.D-?B?L?XDpPHPo;SA?U?^q^~;pSp&~pa&z''YappYow=ow37vp>~<v='=>'r*r*J+,u,GOuxOxW7{7{V=>W>=EEIIKǽKLQLQSSmZŽmŽZٽsٽ__`bb߽e޽߽g߽g޽ennqǽqt߽t׽½vv׽zz{|ؽ|ؽ۽!{߽̽۽̽ݽݽ۽߽!2ƽ!ƽ2ս5ս5C5A5@Y5w5ɾ@ɾ˾C˾J.;;JѾѾҾҾC}5M5־HOPپھUG־A5پOFUG&ھF555qY5AY5&jN5j55T<uuH<TwiVi}hVXhMX$$$~~u++++9f9rf$y$?l?y,lE,-.-11.446S<<6??[[BkD`߽````BDNNkkоUUξYYξ½txľƾ`ľƾx`acgacgjj̾l̾qqluuww߾yyӾ۾߾Ӿ۾ؾؾ5e޿=7 + '([.˾˾H7::P־ÿÿ/%ſ8%ſ/˿8˿̿FJѿ"N̿Fѿӿ+ӿԿ0;@Iؿ@ؿԿ0ܿGܿHK[('"JHb\\QRbQ hhekeOeR k>rK;>OPenrznzxGIPe{eeXsee3Xe..Ŀeef36e#f#$$v'EvD}E'}оDL1L1S88WSWZ?Z?]E]aELLgPgPSSTTտYZZĿ]]^^ƿ޿ƿ޿Yֿοֿο޿llmm׿qq׿tݿt޿~~ݿ޿'޿޿.޿  ٿٿ &޿%J!!%. пп&;ӿIԿ7 75=ڿ544ڿ = FC>H//F=C=R9R9rX((Rx)*A2G>=A*G2{s`)RXR_gH=WDruru`RzzvcvpVpV $$do_RgRWRDR ckvsvdnvkwvwh!!h%s%v*nxv*+,+v/,v7/xPP7տPUU[U@@a[HaHJJiiRRmWWXX^^y`d`dyhhllvvxxzz % --1'0IRv'="F10".I.=9B9FAA2U1$L$L2T3DTU66>5D3\5\;S ;oUgUo ] O]iUUUOuU>SmramaYrYKo  ZZn (g_(V_Vi4bf/[<48[sb:s:f8t<ks%%jjtCk oyC+qy+q.Mw.uM66|9|9;>>;cXpEEe{JecJ}SSVp~V``{f}~fkkmmooU  !   &&B(#  !477)*4#)8BK(!KIIFR8:F<O,:O@,$T$_P_KjijG=nGUUHD gCQ RB<BDQgCaLa eLMu %M8eWw.,wt 9 9##$$HKUC /04_w4t88XHX@@[X[FFJJKKkSSTUTUZZ]]eejjkkrrvvwxzwzx!#B*""3*6&6@"3iT..P.=CC!HM;H55;ML![L[>W>?3Cu N<<qGqGN?OqQqcEcdbOQdyi m y { hXh|mi~ns!"!s{i%tn~p*"t--X|*p}K5}577 89::@9@A]AIIJJOPkkOP\\]x]bbggiikkmmnsnstutu?q *&   .22/4H;/ #4 ;C; 1=10306E.E6(KZ>$>REbi|([+[+RLl_BhBdNjFj_L=~rZKHvFdL H X%%NpeWrpppl[eo<88888<qp%@%Xvx}*q,M|wo|J*xMSwS<<==@@AY]A]YPPySTS{TYY~eyy{ef~jfjllnoqnoqxx ||~~C=3#""  $Lp}KB  B F BF5M5B+6Ch :CBE+E &Wv&WW-i.i/^/G`2b2b 6B-: GR>RpDpaDa{VQv rkyykQ{k r,,,B,:,V{z_m33z!m!$g$@t(t(v{--0H0KN8KN8::UBZZBCFFHHIIOfOTlTUUZZ\\]`]`bbffhhmmswswyzyz?            M     5 " N 5A)A".`. N^SD&DM S; &V>{k_g.++LGVDKKGML.;gig[@[9P9WNXdXada oo{ Q|n$}QPW}rete~cc ""j&k-CCC&-/02n{OOOOO2>>^BBC^E_EOHCOOQQTTppuu]f]xfxp  iWdp{{|}}'0p| #3#  )!D3!,,$$((8+8?  ?J;J;KFKI*IK(@@PA@'PL' L_*_SA7{r| 7 VZ S `Z`~t7uVuUuU~GjRuk NG W%"%N~WguRug00i4i49%9uxu%)uu)C++uHXxuHu5588TTTFTX@@BBDEDEKKLLjjmmVVWW[[\\^^g|ghiimmxxh  + " ..- -" 7"'u "7FC2F2&&CM9M9,<HH,GUG3<30/0/(1(J*YY*`J`1SOSqqN>_I]>PXIawvPw yaQ kR)4kbZzdvb4:zlpe:c8le%p%yvBTE../Zv116/{6fj>T>nWoEEGGHJLLHfj{nroreJ|bb|eggjjkkvv}}       !3U"2"270;$0$:;4:=ON]_R3 ! #Q&X'QQv?9?_#=R=R CU_UCcdiTNNFYYiUa4^(^Zf Z %9'f(TUoaUlnn/mhm!!#z#$&'l$&..0o669h9=>=>z]]FGKGFKLggLqTpqpuu^v^vafgTfghiih{}~ {}~  7=a"" R%n $%(7(h :s&U t:-   *N*(7(8I IFN++OA8N??/WW`AOXX`Q]w\wQ`mk]OOlm_  l_O']`k\[000s_s u9 !!$$&|&'|'n++/u/3344;;>>@@[DDEa aOaaaaghEhooVYY[]]Vaa[cchhmmrrttuuzz}}(-N      * -0 #0-#7:7%RC*%C/`\_RO=O<=<()O,\-2)\,JbBPH2OJO:bOHPBO^O^vFKFU_WMvvOM$n'''''_s.wUssWsx.llxyxy ~ ~ws%%{w(G({/G/013v083|81>>YYY|``f`fqRRmoVoq[[\\zzdVdeehh{mmoorrwwxx{}}-:  Os ,          * *( 9,D,9==DE,24EU#U?N?PNWNYNPKWB,YBNQNQ]p^inizi^nz]N?pN_|y``Xy|_i  uuyvyva3t~tbq!""$(j!($*by..j01LM*y0L;;1ZZkCCDE\MDEeeeeRkooZZ__``}ffggmmnpwpw~~  '& &2'4#72Niy72)/)<+<F9F+94G4GHI+H5,+VV[LKI,4XL=M> a >oJod~J>qNNxzza =[OSSiiM[>[d[6jr8r6tt8sc#s#$j{kk*{*|,P,q04045|P5RR;;<?<?AABZBJJLMLMWnn2nW^^``ccffghgppqqstxx||       /!+[xO45 %26 6&K&9892'C8'TK):)=H>GXG=>XauGd1   c duP[PyQ[yQaKTrZzZyyk$$$y$$raq,{Vl{wwo!o!$$yB+y+y0033N;yN/y;==>YCYCDGGD>NNhRRTTUttt`txU`}}hhlltt}}!% 9 %%C)*)T:.. A HGBF*B9:91A   :&&H<V<H('az(VSKSH44<PmPjaOVOaljmwakJnkv w $vn$$boiy//oy__ s##&~& E~p8EGGGGs778@YY@AAEEJJKMKqPMPuXqXux]xd]dkkqquu <m F!! %/4 "/%4"'>>'B'* *- -$K$5O5B"ORCRCJ2?,?,)6)[[.Z<Z1Q251S9bie9eScsco__Ywsp##x  xN\a\av88888"8y(v({,E,IIost3t35y566<<>>??``KdKMMdjjllYY[[]]z`c`ciijjnnopuopuwwzz||}~}~z$56 ) 9'=B8A.8<Q"-9sYWwHWE7W^SAR+F$Z+Z-R'9@fTWhWf^FD zWW\TVS{@WWERVWbgD{bW{((/XWX/\d6mGr{{{?\{d{--{rGHJJ667_m{<AaACC_<aKKLNLNRTTpRZZ\\``cceegghppqqwwz}}$8R{    )9 =  'B !  " "("!=$0$=55>#DE11E%F%(FOGI&)9O9PD0*GP)*2&Fja442HmgIFJj[WH[MjWJQaSBMQBU^XVY  XS +UV+& Yt_7778t778%%&'nvC'C.v.005N5::;;>>ZFFHHKKhhllXXYZYZbzbczchhjj  uuww||'(0# >#""  ((# 88$ ## 2=#lme#2l#9# =J=J/=V=#/B4B4V^k3k^^l_`@?@C<<Ax~GG~ITIT`l } n&&&&&&qiqCdx}DoLd&&>))/DH/HoL6677y99>>y__GHHGTTWWY\\__Ybbcddcnn{{|~|   $ # ""  #9~'8'#*8*B8D8C8[8E8u8003:3:3%;;%y8?B ?=A?=D5-5V8`8f8AeQi 88pQp8eArlrZFFZC[Eu $yk$k  V`/]f/]<Ij <>>>j ,. uINN,8:.8@@^^:KKggPPQXQXv^^vbb~vhhikimkomsso||~~8f&&##--   ! "! ;9"< 0$N-l0;9$33ZRZ$RNc$FcF`f`OefeAOjgY7Y>Ij>%\q(g'GIAfqC\lrrgf tC% Gp/wd_+['t(n+.[f_/dwn}ff=}(}f$=$u=f'('*+1*}+yJJ1uyJ77::TT]AAD]D^JJxMMOTvOTUUo^v^xzdzdekklppssvzzv   <)!)!/" 3   ";66&.t2%-C2z&C#7l9p9%#,0X0`]5]5`-\>\N4?f N?f BBmt<tIqInPnr_rwh  a yao h_ZyoZgxP/gc{{_3o3x337=c$$|=)|),,..00RR;;<<EEFIFIKKeRlRllWWsZ_sZ_bbekekllppsstvxxvz{{  ;&&.,(-X''=?=>*4m<*##!Y(-!GNG2Nq2MwCMYL&LLLLB LgBun{LCY`gu#L+LJQOL Q qqmhnu`u[j^[}y!Ju$$^hI&yrroo+.+.H4H!y4P||PT~T~=AA=____ifNifNWWYZttw{{w{YZppqssuuwwxq{{||-x  'Yuhr  '(::(I"I6)>))"HKV-VH#-``%K*efefO9O9m]]OFBBPMS;~^PjM~R}Fr;rTTrtrRo&&&&"&>&trgagnrr00r n rv$=J$y@z@yzErEJ1r351:3:;>5>?DDFFHHdh^LhhdL}VV;\^\}?ffiinssn}}  0604#r4*%O*-4-7,E,JQQJ*4!6XS62X^P2@UPUj]I]I9j9!7<<o=dbbKaK={{WpY~@X Yv   h MpWhTZ.``.Z8""&T&(l(*k*lqG--q11OMxO8x99k;;?[?[DD^eeNPiGNrPr]]__bbddejejoorrzz   $ 7XoWE$$:$:3}<<@273$2AA7@>6>64%%dJ!BB4!)..)J@0XT~XWiWcT i=5fT=5 cZ$0@ltfl nK nkgKL#ZLZ&#g+}px/px+8qu/1}kmuaCha8mEG"#?{h?(qkvE+C({vsGIwsIY|"w|UU|>>HY``GGHddydQQ~VV\\y``e~ekkpprruuwwxx @Tk$!%0   ;$:;:6A69=1E!91=2<2E&<&%0K__?^)*)t^IK'^I5^ X*SRX33R S[=^[@qmOqvZO/^z^^^U^R^mvZ^#]  ]T|++7b+++,,^^^T7bf##&'&yo*--*yHH2z2445a9z9DFFaDagOgOjnnUXUXs]j]^_^bb_ggi  iy syz||z  =&2!  A%  !"//"101 ++@)?@0 0$0CCA$M6II@vf:VM`:cVjV06`<`c3;3;jPVP<kxYsk`SxQ Y o'''x`Y`shs`tS`5505A5`5t5Q`t=f='f'**r.ht./11u667N7N@@AAd____dMMNNlmlmZ[Z]^[^ee]jjmmooqqvvxx_z35=%$$),0,V3%%22889DD9=(5T(T&PP&V_0S>S4l3lg\Vl4l_ll>slllllllgt{t{}l} s klr*lllu//////ll l  ##llA l)l.lp,/,/|272|789;;<?<?@@CCH]]]HaLLdna8noX9Xuu^^zlzIzzazzdllopttop{{~~$0   !('!'-0- $+)$.: ":13")INIOI\NYKY5ISInIeI_I+OI4IIISI>5>4k nIIIIhIIhA`D`Ses w  p# ews_=uu//bebb==)n).GvGG.v2v244:99:UU@@[[CCEGELLNNOOmm[qqZZ[\]__`\{G]`mqmqttvxxv||~!(0 ~ += 1#'#3-/" 6H/+  +=K6?? K=K&&M6>>(HADWaW3b^b3aBaBQAdAeVewdVzfyzfnnyQawazaass5zlaaSUUaS{a75a7;a:;u&)l&u)D}D--./2}234774;.;<=]EE``<IJN/=NPPQQkI_3k_xddJkklmlmssyy||( '-" (M( # 6#656(5'6>6' >^  6O@8X!O6@65X#8yCO!60SihzhijhRDC606{S6R`K`Kz}hThchj}thg[hT*gU^h*Uc~ht/^hh~h$$A=nA(?opn?p0(o03346677z;<>B<B>DGDGHIHNNQQl4;Iss]]^^bbcchhiivw6h vwxyy|}~x| }   ~   "%"%. # #.!'! ? @:&*)-&?O D+O)+1TF@',F1_Rjg9,j:?[E*?SP_?CAUR?9g/CUn{skV{8kEg qSg \ \   oYYPgazn/qga!s8oo!$$%&&J)r%,)ruoKJ,K8W89ZW9ZBCCBIIJJeeQQmmT>ZZCEEHCHaKK5QQRTT_spsssp_aaddggjjkknonvvo& )    -!-  )9)= =A0A08F669BWBlW89yPZPOG4Gq [DN[2`2222^ 2DX J N^XUJUIVVI#`"`ShmMmY"&zbtOZh# t&M%%SzY*w*xw3x\3\55ee b##%*%i*+--//3K3556RR6RRR@+@AGAGcMMikUoUWWcy__yddk !9kppqssvqvxxzzF.Z4.,,O &==>>C2bRR''O &,C9b974979Nb4cK cl tbrlrNbtSb?y?SebVubT"wVT"wX\euX/bb{b{@DDH|H1}2}12P}|66P::==WZ[[EE^G^GZQQRS~RS\\^^__ee~mmnnxx{{}} !  ((((((%(8&(8>g(9B9I4(I3"H-"BKH;W-;v(w(}((W$y)V)VOO.(.//?XfXPdPat#a\lg%lh<hi@J`MiT'`g#<%JT'co,p,cpo7~7 ~w ''DwDu.u.K]K3U3SUG]_GjKKMMNQjQrNVVnrZZ[[__bbddeeiikkmoopmss !p>B3 ("4 ,$?dt6808 4; 4&<&:<O6):)f*?O*IA/\\/ I>J@M6 >ll@J f9@ fLqLqPAPrXRXRnnI `    c Sc]t]1u1t #h w#v%&wuvz--//yx33`Tyh}}T==SBBDDa_aeQggjQj|{ZZ[[__``{|ggnnrrssvwzz||}(",  0;!"!*(*("2(?2($'E$()HC5H9'(55+PC:'r+:P],a)(].aif.iod6dp;q;ZWGGuFWjeFui0of  e] z& ~RT1Rx---pf-j0Y31T4o4hYh%%~O)))D3;3>66h;;@@G0[G(ILILNONnO)YYy]]wy}}}}"}nnottxx~~(P* *E 0 (7."7(.,,fq"00A/M&D"0'06,$$0'/A0&>F>MDljlU a8VV H8urErEmUjeajHqeHjujq mjkmz_kjli m{izj%_j;;%'{'))*+*p-0v022+s-vuN88;;==YBpBDDEEsJJNN OPQPToQoo\xbb|sT\|suu xz||}}0jx  z #$ $,M, ##55#   #&:HH<G&#:#56S7V67(XW`W`^WI/./1XvWG<(VI1]K]K^vwywLY~_LW{!!  Y{`~+eZ{kg9c9!!#o#&_&ckge./0.0:OO#O<OSOVO:ZA/AEoEffRRTTUXXYuuuY``bbhhijUsisuuwwxzz~~j>91D x ++955?<.WB?1DB<K272WW7y$$aIaI8PdadNSPN89kakyaFdJaeFeKLakZ%ly\\ Jaa  LlZ& d%acfco3^6m^3:no6n&m&A(p+p+{{GGq114q4(77V=V=]]GGIIJJggOOUUVWWZVttZbbcciillmmqquyuya^  $$ K76#A6 F,/P,SF6/Q5-5H-'^'C[^QPC9[[X>\>\nX^n^_@_]fTp]^TSHPfpf%%o  oda)}a)d.}j~~.jhh|77|##&&''){wwDrDD0{0Jr44696;=j>`9=e`cNeNggsSVVqsqSqxx^b^bcdcllmmrrsuuxxzzsd"@#A"$%(($P%,,</<@:+1C:?+19C2KK?H?2B@B?e?HpS`Ze`OZhO?gOI?QZqgT?p?|?Bq?QOWHWhP!!InP  n*TURUpR*-|w-w3{34}{77}";">>?>>>W>,,-F-4Fv4vX9:9:XCCaIaIMdMOOPVPmVXsX^^_dd_hhjjkllqqktt|yy{|{/((#$=#$=??%J%%JQWZWQZY]W8Y=8S[6i6S[]]i`>@W<WwW @b n>`nbpW<oewoTWrW}m}eTz\ z fpfR*x.xa.a*r !!g$&$g*&*~../05U/5UV?CCD_Dv?Okk kkOtvbbg|gvvxx      "A"'3'>>3=11=;K;@L@LGE<E%<7HA7M#G%28Q I8m9#K\MHRS 9SRodo2HjjN~IQuVRQuw  Z  N(V) w)Z+{000H0+d0555R: :B(sB+x(/Xt4gy4888WyX\+``tMM/Z#Z\\zzddffgjgjqqrrxx{{}}'K  !  "!".#0::D@1@Q>@e@D1@`@@@?'@?>@>05[5^@;@@;^G<<]G@@@{ c_n=n@D@@c=@@@b%e~%][N~N))/////66`a"a"#%%&#&**+HvH|v2|2yOyO77::;;>>??ZE+EFbihKMMhibWKWXX\]]``\bddffbnnFuuwyy  w  G}.0..0'0=0[_=D19,9<<'(L(-G-@ T $SS$THD0O_NNHOV_VA_JcATUBjY|xjBx|YPG^I|^ Z zJ_Zi+p/i/e/gez|c_U_!!Cpg&&(({**C2234:4P3}:;==W[[W;FFLdddLNNRRTWTWYY\\^^_y_ddiikkppruurw{{w  0,'L#")1>++ _|@{'"O.7.5U#>)'KO5UK5DD$ZbZ1KEhOIE gMBB 5OM]nGn1bVb][a[ghbGjbXjX V  V `mcm<$4`neel<=e$'l',,/s/11L;}LLS}S;=|=|YBodq B-ckZ?oq"qZq.xxaackQdglklnnuvLuvyy~~   7+!+!(*A0$AE3-E ?"hnI(*3N:Na.\7\GV?G2Q64276dgc JpJL 7j>#jXqXm4e1VpmHq#} ]%s,o] 5ox1x5w9{9{((+.}.003355U%+}UAAIIJLLJOOrlUlUWrYttvaWabb~~~ghhllmooYvvgyyzz}}  m 0 11711I:1N17B,,BD1;1NX1D;X<>H=Z'<1Z=1[e1cc[>T1PTq1P1>dpdGdpG``QHHRw\{ nn]   ~# e SS]\d^~#ed/__6/^6qf$f$''(-(-//w223O6677:>>BB:iKKL3iLTTUUrZZsr^x^dfgdfoorwwr    ,,  9 "".. 'd{] .;=99.=9 &4&4!!;]QR+]+)a)0b0_<<?kkji?hj_btjilmh~v~RR\\  `ycsc1tp1w/ml6pn`$$((u*+*u+MxNxM7N78::>>@BH@BHqeSggg gSTUUW[q[\e{{}T}hhkkppqq{{ab  - - 2  2 '' <;<E4!;'EIGFI33N?jnl?N!55VJOvFGydJa as dA aa=z===K=mK=)ame^eiLiLJ  oR R)a`) os`sx1x|1|z888:##jD+jC@+,DCz/w225,59}9;;<=W}\\\\/=JJK<NKPRRSUSUY[[Yb{bd !GNlnldPsn s|~~3o|4'@23""14@44V@O1G=bzRA.V^G4763W7.4W3DFV4D0--3640eZea\TtX]BT]rvBvaZr\Zh^hXZ  o }z&`z8o ^&w//`pqqjj8 >&<<&)>)p}--. oJLLOO889R<<=YYBBE=EFF9.fPfPRRSnSVXu[uX^_`a_eaefghijrVh`jirsfsvv[~^~g4FZt'  ' $ $11,'>(,>(* *0/'C0@@D3255A6U3bUIbcb6ctblbITub} J Nblbbbbbbbbbb!bbtJT ubb .btN)7b'b(bIbhbbbbbbbb'bb=w&&*w*,,0E02t2889:V=>>AAF=9FGJGJS:jSTTVYVY[[``bbeegpgpr{r{|}~}~    / | ! C.7'D?A7(((-//-(<D!D<@H31H@31U\U(IBha5aB4hhZsZw5msCmIh^RCWRWhhX h Xww]00Ih!:LhNh>!GGGGx22x<<==AABHBHIbKLKNQQWjjXWXrt[_[_``ffiik psstpk{{    ?' ( (  595" 9*E\4'6DCJ-DJSS>T1?1^T+e+@FV7yaF]zy6z?z~bxzxa@z7zbz~ztzzzzz|]xzt|xzzzzzzuzz zzzz zzI1u144zz z+z9z>>A9ACC_G_GOOQQTTVVXXYZ\\ZaabceeiimnnYmuuwwxzxbzc    " *   E ++C-> !!DDe2R$RV2^RgRHRKR[FR[$RrRsRgf;{R^RRRR]R2RR;fRRHKkjRRRRRRRk  RRRv,dv3d3_y_=r99999)ryv=()(Is|t|/|I4t/4565{69:;:@,@CCD`9`JJeeeOOPQPlQlXXY[\[a;a~YD~\jjttvvyzyz{ {     ' ' <K+,F F =1 <7G7WGKSU38^3VRVR$<+,j$>F1W_A_SIKAI??UFS^TeeT iZ|  i|gDZ`~Um0 bmcc0`b|#f%%f(@*(*//11Lg|L;::;#AYA\dDDIIdLOOPlLPll\\wwbbddffii qq yy||!ScT  ="& 8&"> !! ?B? B8+8+M<<MGSXX$$0'0'.cY[.JY[JT|a5aWW2`c}5rC~2`}rhshs^^ H##S H~)]~)***]}u}6u7}}kck6v67{;"{"@v;@)),E,E/}w5}/5}RR9;>9>B;BDDGGHdHdjPPRjTWZZT]]yWRccffiimmvvxxyy}}~~"!p6{+-G-+J &3 83FEeEAIIFAC0F102_1J=_=N2O_K6L_K___nN_nO@?@[[?||_VVoL____aaw/4\\4_:_e:;e$$s&CkkCD&..H010M1M99T==AACCFF^^ccMMOOggTTqmq^^``c}cffhhkkooppxxzz{{_P   # 5 2   5>>DD''EHE36HPIPGPIVZV?8P_  _G]d]8odmimiqrWqPUansrrPnPaUjPeWe g~YRR%%gY jPjqjuu !" l=l++C"vvs1133688::==@@BBC6CHHJJLLhhSSp^^``aaffhkmqmhqkttww}}~~#    2 % ) - -03)0`<%<Z*9,4;I9I,4%;7T7DE\TFTD_TF\UAU_~ ddT]T|Tv?vYTT]{TyT{xs!!!!%!!T\|Y1cb!c:!:#r&r&(p(++,2#,sx23zL6883y6z<<XZZpH``sHLLXRkRTXqXYTY\^^``}f\fmmqqrwwzz}}r T **11  5 5 994 4-**E-;>I ' AI?] = >*: ?'?]_J--J=x_:k@KppM@7O[OkAiM7KxDibD[xuou# n## Z.UU.c/C{c3b,/vg8noZo{EgvooooogCo,FEF33~~N6R6;;==>@@>adaJdfPNJPSSTTWWZ^Z^``aaeeggmmpvv||}} Y;  &0(*!0*0)020!*% %)7H7  0N0<0KA40\02MoNU0t0<Q0l04q0Hd00\b08b0U8bt]A]iActicIQ\ l  R~  R+qq+VVd/d/?f""&f? l&(o(*j*tjr002{2o45Px9x94<<5?@?@hJJKhKnUnUppc{pc)momww06No&( $$1!1)!6'#6 'M#A6AM DOAD%LNLWWP_C_FNEIF%6EQ+3`3~ ppV+NRnqnR`bbNGS,vrr|~v.|TZSNGNr(tT~,Z.^t5ssky$kz<$l&@&@x,,-u-y1u125v56:2z:==>B>BDDEHEHIILRLRSToSYY\\Tdffdjjmmnnzz{ !F J'+'")"!(#.O.PCQ @#(@F`VqJ/WG +/WUNeUg0A<<;A0GWeN;CgN?i^; W}ahkiKhol$Px$CN?N}aPo-r$c666666rp$'q'cq,,..MIOMO;;AVVAY``__MMOOQQSSUV^UV^f{{{W{N{K{fiioorr +)}}(    005# 5R#+K+IPIP!HR"E"::%%!?W?BN]BTk] N\ C\Ca uaYqqXJ Yuhphq_JcLZX[XL&`&x&[Zc'_z`zxj!l!8p<p<((jxslxsF//vb4t466wO:==:@D@DFFHvbweeeeeXeHmmVVZZ\\]^_`]_f^`fs sttE   K*1*)1*H'22+WT*- )*0 037 +3I-+";I'*"RX+R>R8Ko<8 ,>X95<,Kd ?dcoc9wjwzJ?zGSSLP#JoON%OM%#M%PW.Wt/.YA66{6g {$g$ iA+iD+Db!QQ:: " =>/ H=]]7 ]N >N\  N   - D ]  u  u  aablm&;fylqqrruuvv}~}~*+ 7  %% **!)&)&99;  'B"B F "F34345A66MQJ-QMjJMRG;L7?[-MNRM[<;M<@s@?YszCztcCPtP  7MwZ{Z{xyff{D{ !y>j )j)E/|E|D/2x24488::UUBBCCGGbbbMMNNmmWWZZuab}basts{{ }t !} ' M@{A"7"" <7"< ""D"TPTQPOP7QO??[*Vc*PVPffPXPwXYJ9xYPJ$>Ek9Vd>P%ED lj!!!"!D!P!lPk$Vd% ,oiocci,  0j0mj m  f:n! " # w=! nrp# ru=uxwvFFx. . / vH4 zS7 NS4 z\@ B C Z\@ C R R S U B yc t   yS c f  f h h i u ,  0 J '  u i  W | X | >        U                                       *      *  %      %  3 $  3   ,   &      &  [   -  0     J       8    '  8    W  ( O   < X +    (  > < + 1 N   T N   Z  1 P   L P  L ;  l ;    V c  l  Y Y A 2 r T q  J Z q D E V q 5 D x G  x   H m   r q p" "  y ] q  m q y q ~ q  q  ] b `  q  q  b E 2   G 5  ~ 7 7 q 7  7 f 7  7 # ~ #  q    q  q *  *  q  q  q  q ` H 3  3 5  5  } 9   y 9 ;  ; < >  > ? @   ?  @    F  F G   G  J K J      R  i n  R S  n W  S  W   Y Z Y  Z  K  ^ `  ` <   {   d  {    d  k  k   n  n p  p q     y         y   { ^        {      {    q                                        $                    -          ,    ,  4     4      B   O        C     H 8     4  X  -    -   7  D 7  D A      B    C  [ _ M M  [ I  _    8  X    L = f E f A    b f  b  =  E N \  L A  P   h  N P f h f T  i T c   i  f  z c  z  #  f          l 2 ] o 2 :  } 5 l f  ~  o    ~ :    > O  ] f    @ +  ,   r + , t   G   U t  K   8 v Q   K r O v  8 9 9   Q >  >  U   a  C C    G  G I  I  a M    M N O      j     O  j   q  q   [  [ \   ^ ^    b  b d  d f  f   h l    h  l     o q  q r s     o    s    r                                                                                    " )   H   "   %            % )  ' '     # <  #  ; ?  ;   !   $     !   I  K  @ @  _  D    R   <  P  L   \       R   _  X X (  (   D  B  - B  5 0 6  -  0   g 5 i 6  g i  7 n J i  H t  7  H $ <  A i t   J   A    ` w ~ K S S  & Q ` T ~   w  K  .  T & Q i  i V .  V       i  : x    a x j  a : =  !  g    > z = ,   i  i v z ! v ,  F  E F    E    6   N  N 6 U    9   9  Y     U G   Y    \  \ ) \  \ < \ G H   H  k   f   Q    Q  k T  T     u   s Z    u y  Z   y a  a   |   | e     m  e      m o  o     r r  v  v           }  }                                                                      ?      & $    &    i      8  :    P  L    $      8       @ '   '   @     8    1  (   4 4 :   * :  *  O     n  )   L    : P    #  L ) K #  K   M   8  8  + + P  .  M . ( 8  I >  S p  I   1 8  :  S N J  X J  X  j  q c   N  q  w     ! [ R  [   g U  g s U  U -  2   s  -  -   d 2  d 3    t 3    t  g u   f % f  n  ( ( n  D  D % u x  / 1  1  y 4  4   6 6  / x   :   >  :  > ? ?  A   A  ^     ^   K     a K   h     h Q     Q   o z      Y Y  \  \ E]   b     z b d  d   g  g     j n    j  n   p p        w  w x     x      ~         ~                                         D                  "      ,   ,              ) O             -  - #   < " =  ) < #  = !   = T = v =   @ !   @  = S 7  S  -  >  p   R  =  J   =  = c   =  = R N  E  E N w  R   T    =  = O U  O V U  =  V  =  h h L  L   =  f   y y ^ W  r r W  q &  z k . T  % z k &  q f U s  s | { . y 1 e v e {  6  6  }  $a a  } i $% A C   A %  C +  + ./1 122 P  X   P   9.   9 / A  X A ]  ]  ]  ] I  b I  L LN NQ R QRSU UVS Y Yt   t  u u    V       e   eg g  ii m   mn    r r          0 n  7   H :   =    _                 )  #  7  N  !  !   - -0 3"  3 7( 4(4& & BE< B8 U  ^  q  <8|  7HZ#ZFF5::7;K6_;=6hh[[=_a_a>\jkqki  \_bWb |  *t  TX*PWsX>_ sv]v``j_|!ulTtDu!PoDo--1 I13z3z77c<<@@DDFFGcKG gQKQSSTXTXpp\\aaxxfgflglm  xx     +" &),)%E#5%&9>9>9$$99Z9K^92249&h9U9p9=Y9ZO9$^L'qLZ9s949[0[ceec9h9j99U]lpYOM]uuMz z (nq]nq(.s_.ii_""#:#j:**p,G..11t55N88SN<,<`CE`CHELLMNQQkmmmm\\Hkklnno ) SuazXzKftMo9yul, Nk  -'=> >2/6'60)IJJ0&I&=T=T 3!SO3aO7X)'-!72/UPUm]] m KfStX^q^q_ VVXS [g V`s [t11`"`1dpd"##%F_q%sFH22W<Y<@W@YCCDEENDNPPRURUZrZ]r]u_`ad_dagghkklm`tthlzmz{{ - /0&.V9K88&(7F;?1AFPST7('L'.Q6Q69q.KV?14b;4bg A^f^TSWypJyeGSJGWe IIO c %,Y cyi,jX}yYyji!|Xy}y!"$$"~&yooDDoo11|y3~yy3[::;;@U@BBC[CJJKKhUUVpt[[\\``{ffVpnnqq ||  (%;L%.  ..A/.A./.FF.S.S7f D  7>'<'.<.L.X.HZLHFPP?XOj> =gWY=jhWcRchhuhRGh^aL s o&&.&h&&hth^eaesb]38d8]ild "u"$$@h l())-t-//1126267887;=@=@AA(```RRTTXXZZx_xe_efppqqtty  #&&#,,D9*  *99Z?'35O3Og:YGebi>.:5<5?59>[5<[KK`?'9xSYx`PSBJGG  u%Uu%PYidJYvB`vd  ;;$$U@@))i,,DD1133|M|6M<T6<>>?Z?IIOffOlMlTTZZ[]yyy]y[effemmnn  ~.~"=+ ! ,@  Lb 95`Y (( **--4.4+.7.8+8F:2:GG5&&!5B@B@"CJJF7;N"9C0^;0DAKQA #jDE=EKjLlLL|LLLX#kXv/kvSlS/bb} } "|"#&>&*g>#*UzUzgzMVzM< U<UU@A[ @AeeefQQSSUV4TC\\]^]c[cemmoorrwwyzy^z 72  $$(2(2-- !9!'!N4 / /^PFP%H)Q=4LEl)RBIB+HRX561TXT 6T_ E_EWxCW[`n+Rn`  T e  fefY gl!{!g}&}&''**-p-/|J/J|Z6Q86{V~~ZBB^^^KpK8PPQQqZ[^^Zaacceffkqkmoom[uuww e ' ) %FRI) ;>">) "FEF95E+19Ex%=%R=DMDY:_:S<S+EAE]RE@]l?dYMAE@EYO?HLHOlbbll x   ,n NN`xl,n`ghqgvhp !y#pisr sB!vBt,#y.00q33,tz7TTUU??BBDDEEjJJPPRRjo7o{[[|ad{d|ajjllppqtt~q~  ;'%%$$&55 M_< *AC$A'44@6d)IHSH6IS9>L)&$@IQ>Q81NG-28FN2G` h  f;mf<M<muirM{u(vcucK9I#vLnr eW nK(:eZW+z......uum  Z:+m=({uu=m(u--Eu11u55Tx:xR:U]ATUA]FFGGbLLkSkSTXTXZZ]]^_w^ddefwIFfe_b}}$*C  )7  8+)''**$$ 7 +8H-uYl7);HLMMUUJC/9/JC),Y3b,[3bc[c4 Wr\ n=>=>n\QlQ`VV`NNaO"sNgsOh"u(.uRRm4Ym.WYgh1alNlj!!"ik@@iEEFj224477o{T;{=T;CF^FJJCfPQTPoZQZ[[]`T`a]agg ooprttwwrp     9 31$3 99)3%3#) 03$E3G&&G#1X3630L:L%:EX5'5'd/dHebe6<eHbve8nhI8hv@<UIR~S~R@e^Sk" ^ (V""W(iWY++i\Y\UeBmVezu  !===3=e==!uzB+F2002mx77}99??BBDDFFKKMMNNQ[Qpt[]]tbbccggiijmmjssxxz||z~~   1""- -313< .==%./@@%CC*n,<1(*(,);^(4(^>;&>E6(4)&6LEL_\f 8 d\_dah8_hfyOyoyeyR`R` O  o n+++ ++x0ell}77nk77m!""p&p&+q+HGrGrH3u3u9Q9}<<}>>ABBKAccKcNQNtTQ[sT[s]t{]{gghkkttvvxx~~h1(_y  $($  %%(' ' 61)1)*0* 0-;-DFaG6;.=:F;//.,G=6Y,2^Y^2Sq4 6kWqniyS^i\|z4^!!!6!;!q& zuVuRR}j}Z\yZ|yC9Wn"##r%@@>@C"s%//L{wL3N583w8TXXr{A]5]HKLOOAHKoo[pp[\\aabgiigllssuvvzz||    u     1D1 .:- 66- 44 +G+^ny@,2,?I M0I09 M=@Gj?9F<7_heh7=V _: j <=rno=rkGFBfkfoePjPJwJs%yYhYi~>~5E %dF >% dqp,q_ ,I!H !LLLp!^"e"<<==@m~"#$6$G$@bbbbbNNRRmmt]ut]__yccffghigsx Gx2s|}}  |.7 >C4-'7:: ;;>CB4 -? ?:n'E//EPYYPA0A0G.WGP.BLQwLWPHPH88PjP[PPj[JttdP~P^PJPP"e"p%Ped3^~Xy^X3y3  9z9zk%=%))DDII22OO7UU7=>=>GaGaLcaLMiiPii i.iUWWYZ[[UY__ZeefhllhMsswwzz||  f        &.&./ / *  *.H.<. BH,.<,"?Q".B.@?CD@$.BDC$R4R4181XKX8Ed AA5E\ PP\]I]FQS{^SaaIk      'i'bbFdQdH~`oc}^dcJ&~&(o(*}*rO-t-t`J33M5i{O5V>V>VDDGGgkKKOOgpkpX[[X__abfbfiaippqtw{wtq{  ))/  /  0  +0+K ,6d{5`, =ZZ=`7e9Re9gEe7g^C^CNeRleE\H\EeNneze#lc#r# k rr*   n ~Ykc ~  ]]|   hy   e% % ( z h( I* * y}IuIuII5 O5 }OOO; ; ? ? A B A B E F bddM M R R T T sW W qsvw` ` vf f i i n n r r } } ~  ~                                              +       ! !   6          8 )  8   +    /  /    ,  @  :  ,  I :  I    @ V N V Q & Q < C &  > N  C H<  >   U .   D U N D .   Y   L  S c  S    ^   ]   ] = G k Y | y Y N j g L N !j  ! G ! ! # K '  ^ N p #  N  ^ K   p   [ ' v [ !v !! X  !!!X h  3 h  3 !   !! !o w  w !o '! | w '!)!| )!*!1! F F F  !o  F 1!y w  w *!y   O  M  O Z      ! >!$7$$$-$$B$$$1$@$N$$>$X###@$0$#1$0$$$H$$$X$$I$)$,$#X$`$)$$L$`$Y$`$F$,$f$`$#I$$`$$$$F$$`$?$V$C$V$$C$$g$n$$g$$$U$t$$U$$$?$$X$$`$%P$%%Y$$`$$`$%$L$%##$ %r$##$ %##$$`$%f$$`$P$t$%o$%$`$r$b$%%%p$p$$$`$%[$#6$$`$$`$#6$o$b$[$$#=$%%$%%$$(%$(%+%$$$+%#G$#G$#G$#G$$z$#G$J$$5%$$J$5%6%$$$z$$$6%$#T$=%$=%$$B%$^$$#W$B%$$$^$F%$F%G%$$e$$J%$e$$$N%$N%Q%$G%$Q%S%$S%$$J%$$$W%W%$$$#q$]%$]%_%$_%a%$a%$x$g%$x$$#$$$g%h%j%$j%#$`$$$$k%$%$:&$h%$r%s%t%s%$$$t%${%${%|%$$$$|%$%$%%%$$%$$$$$%$$$$$$$%$%%%$$%$%$$9$$8$$%%%r%$%%%%%%%% %$% %%%$%$8%$9%$P%$%$7%$b%$u%$%$%%%%%"%$$"%,%$$%,%%%$%$%$%%$%%% %*%$$%%N$$% %%%>%%%%% % %%&%%% %%&%%>%*%%8%%%%9%V$$I%M%%%n$$%I%%P%%%%%%t$$%%%7%%*%'%`%%%'%%^%%e%i%%e%^%:%%b$%$%$%z$%$%%b%%P%}%%%P%%v%%v%}%%&z%z%k%%u%&c%H%H%%%R%& &L% &)%X%R%k%%P%&c%%)%X%l%L%k%%%%k%&%%k%&m%1%1%x%x%w%&%&&%&&%m%d%%&d%%&%%&o%k%%k%%%*&+&%%$G%$G%+&o%*&%2&%2&4&%4&5&%%Z%%5&%%%%%$S%%%$S%%%%Z%%%E&%E&%%f%%H&H&%n%%%%%f%%%%f%%%P&%%R&%%%n%q%%%q%P&%%% &%]&%R&%]&^&%%e&%${%%%%%${%e&%%%%h&%%%%h&%$%$%%%&%&&%%%u&%^&%u&w&%w&x&%%z&z&%%%~&%~&%%%%%%x&%&%$%$%&&%&&%&&&%&&&%%&%&%%%$%*%%%% %%%%%%%%%%&%&&%%& &&&%&%%&%&&%&%%&&&&&&&&&&&&&%&&%%&%%%%$&%&$&&#&:&M%%&#&&&&#&T&:&&#&.& &&&&&=&`%%:%%&.&i%%&&&'&L&&&'&A&:&C&(&&C&&&D&D&M&&W&:&9&8&&9&%S&&&&|&:&&8&%%T&c&,&,&%&T&&c&&T&;&&&&U&&U&;&I&K&&l% &S&M&&S&&I&w% &&V&&V&K&&_&&y&i&&y&N&_&''A&'N&'%&'J&!&"&m&m&J&'W&!&|&n&"&%%&Y&n&'Y&'%+&''&[&/&&&[&&[&&/&'&&'&'|&7&&&7&&& ' '&"'#'#'&F&&G&&&&&j&)'O&&j&F&X&&&G&}&&)'}&&q&&&2'2'&Q&&&&"'&&Q&q&O&&&='&='>'&X&>'&A'B'%^&B'&%^&&&L'&&&L'N'&N'&&P'&&&&W'&P'&&&W'r&&['&&r&['&&%x&^'%x&%x&&x&d'&&&d'&&f'f'&&&&&&&A'&&&o'&&&o'q'&q'r's'&&r'&s'&&&&&z'&z'{'{'&~'&~'''&&&'&'&&'&&&&&&&'^'&'&''&&&'&'&& ' '& '&&'&%&&' '&''' '&&&& '''''& &&=&&L&&(&&'M&&'%'''&&'''&&&'&''''''''4''''!''''3''''3'$'8'''$'''''''''&1'4''''!'''&''',''%''''''*'K&&'',''''E''(''Q'Y'*'('E'(''Q''''O'1'''V'\'i&&'V''0'T''0'''9';'''9'G'5't';''G'''C'U''t''C'[&'&'&'&'&'''''(j'j'F'((H'(+'i'(O'Y'H''h'Z'(h'i''(u'((''(v'.']'/''Z'+''.'|'/'(g'(g'|'((y''((w'(y'''(''x'&('&('?''?'''?''''u''v''1('1(''3(&N'8(''x'&N'8('']''w''<(=(3('=('<('_''''F('F('_'I('I(''''N('N(P('P(Q(''Q('''V(V('''\('&r'\(''''`(a(b(`('d(''''d('b('''a('m('''m(''p('p(s('''s(w('''''w({('''''{(|(''|('''''''('((('('('''(('((('''''(&''''''('' (''''8'''' ('('(('(((((('((('('''(''Y''((T''''''('''('#(((#((('!(!(('.(.((%('(%(((4($('(('0(4('(($(((''(0('('\''J((((J(5("((5(((4((;''(5''U''-(K('-(6(*(((((*(')(R((6(S('(')(9(S(h(4(F''''''''''''(h((9(T(4(((k((k(7((X(?((T((X((c(t((c((E(Y((E((((n((}(~(^(}(G()~(^((x'()))u((O( ) )(j(x((x()j()n(Y(e(x(v(y()u(Y()v()())e()](())]((( )( )o(:(q(o((:((:(>(q((())((>())*)((((*)('I('I(2)(2)((5)(5)((7)7)(z((<)z('V(<)@)('V('V(@)A)((D)(D)A)((('b(H)K)('b(K)'b((g(((r((g((((((T)(T)U)(((((r(\)('s(U)(\)((((`)(`)(('|((('|((((|((((((((('(((((p)(((p)((s)(s)((((((w){)(w)((({)|)|)((()(()(((()((((((((( )()))) )()(((( )(())(())) ))()()((4((Y((( )((x((())()())))())()((&)(()"(((.))()())))(-)( )-).)(K((R(((.)) ))))#)(!)()#))))))=)=)!)")%)E)((")>)E))>)])&))3):)7(((3)9)6))?((L)')6)()9)t(((L))Z))1)(G((Z)1))]));)Y));))))^)O())J)))B))d)h)))d)f) )^)Y) )d)y()[)f))[)r)l))r)l)))*z)()**S)Q)()*S)*y* *q) * *o)J)Y) *))()e)+))(*)W)+))()(*)B)Y)m)W)**m)0)))0)g))?)g)!*b)(7)(7)(7)q))!*o))b))z)h)'*))?)'*(*(*)n)),*n),*(H)(H)(H)&)H)Y)H)h)H)M))})M))})e))R))<*))R)))))<*=*))=*)A*)A*))))_))G*))_)G*K*)))))K*M*)M*))))R*)))R*S*t))))Z*)))))))Z*)t)]*)]*x)))))x)(|)c*)c*d*))i*)S*)))i*m*)d*)))m*n*))n*)))t*)t*))w*)w*))y*z*))))y*)*)**)**z*)*))*)))))***))*)*)*)()%)):))*'))** *)))**)* ***)** **))*)) **)****))********)**$*****1*****1*))*) *******#****2*%**2**E*)**E***$********3*5***+***3****+*"*B**"***4*&*N***9**)*N*)*&**O*)6*O***8*X*Q)**9*4***7*)*)*)*)*)**6**8*L*:***L*s*v**s**7*O*+f*I*+f*++J*+-*o*J*{*o*{* + +[*[*T* +)(* +p*p*x*|****+|*}**T*-*+++Y*+*Y**+++~*e*+~*+}**q*$+g**$+**+g*)A*)A**+++++r***0+*r**0+1+**4+*4+5+6+**6+*U**)S*5+**U**W***A+*A+W**)]*`*****`***I+*I+J+****J+*****)i*)i***)i*****X+*X+**]+*****]+^+********f+*^+***f+g+************o+*o+p+****s+t+u+s+***g+*****t+* **)***p+* *****+**u+**+**+*++**+******+)*$****B**4****+*+*++*++++*++*++ +#**%**)**+5**+++++*+*++****+++++**+*++++,+++*+,+*+ ++.++*.+++2+++++ +++++++7+++3++X**++%++)+++,+:**v**++++:+2+*+%+<+7+,+N+"+*N+3+,+)+<+Z+*T+Z++T++*K+;+*I*+*+q*+*+*+{*++<+U+;++U+x*+++9+:+<+K+<+9+<++++L+L+<+\+<+@+B++@+*+F++x+F+e*+,x+,,Q+,Q+v+V+k+,,V+ , ,\+ ,M+ ,,,,n+a++,`+`++,*++n++*1+*1++1++1+,a+,d+,,,e+M+k+z++#,z+#,%,j+%,}++C+}+y+q++,y+q+C++,++w+++H+H+++H+5,w+*J+5,|+++P+++d++P+|+;,<,e++;,+++++G,+*]+*]+*]+G,j++c+++c++c+M,+M,++O,++++m++O,++m+++++*p+++_,+++++*u+++{++_,+++{+~++c,c,++~+++g,i,+i,k,+k,++m,n,n,+++s,+++s,++++v,m,+++v,+|,+|,,+*+ ,+ ,+ ,+++++,+,,+,,,+,(,+,+,+,++,+g,+,,,,+,*+,++<++++++,+,,,,, ,,,,,++,,,+ ++, ,,,",,,",,,,,,, ,,, ,,,(,,+,++,+"++, ,+,,,,+,A,,,,A,,A,,,,,,,+,,,:,K,+$,+:,,&,,+,$,,,*,+/,',+,&,,.,',,R,*,,B++v++k++/,A,,.,,R,A,>,A,,>,,,1,Z,,8,Z,,8,,,a,,!,I,I,`,@,P,,@,,1,A,,],a,A,],A,,u,A,,,],[,A,,u,,),[,-J,-[,-J,N,--f,o,+,-,f,b,},P,!, - -Y,+%, -b, --d,-N,),--r,--[,},-,-e,2,h,,2,j,2,\,,--\,,4,4,w,Y,,,,+<,+<,A,<,,<,,<,,<,d,,w,j,+-,+-e,,.-y,.-/-0-/-,r,,3-0-,6-x,6-7-h,,z,,7-z,V,,,V,y,,,,,,,,B-C-,,B-,,,J-,J-,,C-,N-,N-P-,P-U-,+m,+m,+m,U-,,Y-,,,Y-,,\-,\-x,,,,_-3-,c-,_-,c-d-,,,,,,j-,,,j-,,,,n-r-,n-,,,r-t-,t-+,v-,,x-x-,v-,,,}-,}-~--,+,--~-,,,-,,,,,,,,+,-,--P-----, --,,-,,,,- -,, ,,,,--,,-,-,,----,-, -,---,--'---*---*--,--,-'-,,,K,,- -----,-------8-----8-,--1-:-Z-:-9--K-:--k-:--:-{-:--:--:--:--:--:--:-D-,-9--:--D--`,,-:--:-----:--:--:--:--Z---1-M->--M--1-,1--.:-.:-.:-o,-- .:-.:--1-W-^-- .:-S.:-*.:-c.:--Z-M.:-y-[-j.:--W--y--`-i--`--..-K-p---p-.-..k-.R-"-"--.Z-O-R-V--)-O--)-.Z-.V-..{-...-.-..-]-..-.!.-.--m-!.--$.-$.--'.-'.---?-+.-+.,.-.o---.o-3.-,.-3.--5..{-?--5.---<.-<.=.>.,Y-,Y->.---a--D.E.-a-D.---,d-,d-,d-,d-,d-E.-O.l---l-=.---T.V.-V.T.---Z.Z.-\.].^._.^.-].---d.-d._.-f.h.-h.O.---,-l.--p.-f.-p.--~.-,-:--.-/-s0-0-----------~..-l.-.--.--.-,-\.-.-...-.-. ...--.. .......-..- ..--.---....-----...... ..-...---.-.--.--. .-. ..-)...-. ...-..0.-.- .....- .. .. .0.-.->--......7.--...1.7..1.^--.[--i---S.;.-U.;.-U.".4.4.-..-*..".&.-#.&.G.-.#..C.G..C...c..Y.L..Y....c..R.b. .R..i.W. .i.W..e. .r.e..c..S..r...M.]-..w.t.(.w.%.j.m-.-.-.X.N./.|.2.. / /t.%./X.N.(. /v.g../-,.a.[./.|... /a./[.2.-3./g./u./:...m.-5.m.:.s.:...j.-=.&/.&/.s.0/.)/v....u........0/)/.2/3/2/.y..3/.../>/_//./g//./_////]/R/. /r/L//q//V/Z//V///r/Z////=//|//B/d/'/B/b/H/00b/N/R/U/T/-/|/+/U/ 0h/ 0H/'////e/j/q/g/W/+/h/W/Y/-//Y/j///0e/0000/000/00f//0f/#0x/#0$0k//)0k/0|/$0x/)0*0-0/*0m/-0.0/0~/I//~/I//0//0/70/.0/7090/90:0//:0/>0/>0?0//////?0///////////O0///Q0/0///O00/Q0R0////0/W0/W0R0/Y0//[00/]0// 0/40/80/[0/e0/e0f0f0/i0/i0n0/ 0/0/Y0/n0//////// 0/0/T0/]0/./// ////}0}0///////00/0/00000/////00000000/.//00//000000/00////0000/0///0//0//00000 000+00+0%0 //R//Q//g//L//040$//0/800000/0 000000000/ 0&0/,0&010/;0&00,00000;02010020000@0000@0!0L00030C00!000T00000/T0<0/^0<000^0030d//T//00S00N00c000L0500000D000g0N05000S0s00I0c0s000\000D0s00_00D00I0U0v0g0s01\0s0/0I0s0 1J0_0s01U0 1/$0J0s01M0M0s00s00s00s01u0s0{0s010110s00j0100s01010s0/900s0#10#1q000s0'1q0'10s0000s0,1.10.1,1041u00s00s00s04161{0610P0P0000:1/Q0:10Z000X00Z000/Y000E1E10/]0X00d000d00000M1M10Q100h0Q1h00U10U100X10X1Y1Z1Y10]10]1^1_1c10^10_10c1d1d1000k10h100h10k1m10m10000q10q100Z10t1u1u1000000000{1t10~10~1{101000010010/00010000051010110A10(10710100011B10%00&1000100R1000000010?10a100000111C10I10111O1011[101011 110 1000L001C0011105110111111111111111111A111(1111111711B111&111R111+111+181111?111!1!1911111C1v001a1111I11C1\1-11511\1-11111O111111[1<1;11<1=111a11I11[1j01z1=11z12@12@1|12|112122`1 2V1`110#1 20#111}1n12V112}12122r122o122l12212221v12s1#211n1r1n1#2,21o1n1l1n11n1i1n12i111s1n1,2-2-211112112223242524213215219211;20U1=211921221;2121=2121V41I21I24111310c10h1310h141411111410t141@41A41g41H51^51k511151515161'611111n21<61J61n211K6111116111115111111111{21161{211111212212221112212121111112121122120121 211111121 221112112"2221222222222+22 222222122121"212+222%2+2O2+22J2+22%2 2121811222'2722'29112$211 22(22262)2+2262K2 22<2+2b2+2 2K2d2+22 22;1111n11v1111112O2(2$222J222)22*22N2*2P2+22N2|2+2 2<2G2T2T2 22G222b22o2e22o2222!2d22_2_2>2222P22b2&2|2f2i23f2333U2>2!2c2}2 3c2 3 3k2 3 3i2&2 323l2U223322b23323122122122122122k22~22:2~2j2:2222j2#3$3l22$3~222#32)322,32,3)32222223223226326383283:32:3<32<32W2222222D322222D3E3G32G322E3222K3K32g222g2R32Q32Q3R3p22222222Z322p22p2Z3222222_32w2a322w22e32e3_3222h32222W22a32221222222222222222h32222222323222222333223322333 312+22222232{32 32333332332 3333 332323332 33332333337223222K22323332!333233!3233*334333333323303343*33=333A3333333*33"303*333"3A33I33M3&3M33333&3333H3e22333=3*3393I3A33\3`33\3333b3P3O333c33P3}23]3d33]3O33333S333r333H3M333T3U3q33T3r3{3T3{3233M33U3234Y3~3{3Y3g3g334S3d3b3`3 4~3 4%3393M3[3%3X3[33{33r3^3{32,3m3{3o3{33{3c3`313X33134333{3434^34!4m3!4#4o3#4j3i3&4j3&433)43)433,43,4.43.42G31431444333446436474847433333338433333C43C4E43E4F4G4H4F433333G43H4333Q43Q43l3U4333U4V4X43X4Y4Z4l33Y43Z4333_4`43333`43333333j43j4k433m4o43o423_4333m43333333w4x4w43x433333~4~43333343334434 3333434k4333444433423*33A33M33`33d3333334343343443344t4444344334444444443333"4(4(434"4943-43444434-44944444404444444444*4344B454443*433544443444B43$4344 44$444 4%43M4/4342434+4'4344K4q33M4'4K4+444944[4]4:4+433424/4 4[4444:4;4 44D4N444I44D4I4;4444\44\4<44^45J4^4a45b4O4R4O45b4W4O45=4R4h4e4i3#43#43#43#43#43#45h45J4a44s4545?4W45d4d4y45545c444y45L44i445 54f45c4 5n4e4=4y4?4l44f4@4z4A45i4n4z4-5l4-5/54/5054z44L40544{44z4{4P44z4P443V43V43V44V43V44V4B54B544G54p4444G5H5443`4L54L5M5M54Q544g4Q5U54443o4U54p444Y54Y544\54\53x4^544`5444|4}443~4|44444}444`54j5k5j5444o5o5444444444444444{54{544444444444444444444545443404454544444555445455 55554 55544555545 55454455 5555555!55545554#5!5544545545544%44254554+4455?55555525C5;55C5555%5I5&5A5]445%5554&5359555435(515954N44<445(555F55585a44O4444585_5515455a5K5J55K575_5575555<5F5A55 5n5T5 5c5T5n5O5<5N55c5s4555E5=55r555I55E55r5p5D5v566}56D564 56X56 6*5|5R5z5|5S5X5P5Z5*5 6R56565Z5a5_5656656655w55b566l55!6l5!6"6#6m5s5"6m5#65'655)6)65q55-6q5-65654H5}5v54H55z55s555568655586;6555;6<6>65>6[554Y555555[54^54^555I65I6J6K6N6555N6O6O65Q64k54k5 5k55k555555555Q65]65]655_6_65c65c6d655d6555j65j655m65m6n6p65p6q6n65q65t655v6w6t65y6|65y65|6 5555w65v65555545A55_55N55566656565 66#5565655556555666565665656656 666 66?55 65;55I55656 66666666666666666 666666666666%626=6526656,6 656656665=6536 6,66J55536655C66D66&6566C666G6O55696D6&666X666=55v55P556z55w55p55X6+66646606/66666616^6S5 676b660661667666o6B66`66x6i66o66x66b5696G6L6z6777L65677k6s566P6b6$6k6}6B6$65'65'65)6765'677u67[667[67Z66~6a67Z67?6~6`6b6586a6:6s6:65<65<66?66s6(76(7*76*76s6F666F66{6/75K65K65K66K6 6K6u6}65O6$665Q6/765Q676:66Y66G766Y666I767666F76F7G766I75c6L76L7666676765j6U7676U7Y766676Y7Z7865t6Z7666668686f7686f7g7_96g76;6666666<6q76<6q7<6H=6t7666676t7656665666 66%6676666667666667666776777776766 766 77666776777766666677677 77 76667 777 76677676#7776767.777"77-7%77-77.7#777G6646677/66707 767+667&77 777777777$77767!7!776776$7Q76^66M7Q77M777C7C7N77+7T77+777X7[7i667X7H7'7"7#7z667H7737177&707737}677'77P6747d71777477]7d7:7d77]777:777u7z7767_7z78u77_777J7J7O7O7787o7R7y7y77o7P7888e7 8u7d78R7`7V7V7)78w7{6*7e7d7)7^78 8`7v7h727\7h7278v78^7d7\77 87 8!87777w7d7!87(8r7(87n7+87+8,87s7,876I76I76I76L76L76L7r777777;87;8<877<87@87@87777a77E87E8777a777i7777K8M87M8N87i7K8777N87V8777V877Z87Z8[8\8]8^87777[87]87\87777777777777^87m8n8q87n87q8m87776777777777}8777}8~8~8777888777776777N7777778867878#7777%77077 877 87787777787888888888677878887 8878 8788 88887888878888#88887#8"88/8888888T77[778888:888888?888888I8I8)8888d7777777777%888"88%8/8"8X8088X88"888Y88$87888D88$888B8B8W888.8.8g8P78C8g8D878888C88F8Y80888P888J8s88J8888Q8Q8p888d8d8p8r8p889G8t89G8F8g8P8g89899 989r88R8 9n7(8s7(88p88`87(898988-888-88p8989_8688_86888p8!98!9#98#988(987@87@8(9*98*988,98t8/9z8/98x8198y849{8498L8,9888L88198>9888>988@988B9D98D9B987]888@98K9888K9L9M9L9888P9M98P98U98z88U9X98{88X98888\988\98q_988h9888987~88|8|8888h98888l98l988n9q9888q9888888u988u98x9y988888888y988898889988988"8888)88 88x9889 98888 998888n98989898 9 98 999 9999899998888$9989888889:888&9?88'988'99%99880888%9788W88g889898 999999 99999:999C99993999998)98F99F9979:9F99)9F979F9?9F9N9F9a9F99?9J9F9939&9$99s889-9p8888988888[9F99t88-9.99N999F99F9R89R9j99`899R999F99F99:99F99a99S99Q9v99F99F99F99F9O9S9:O9:9F99F9+9J99Q98#9 :T9z9 :T99N9:[9:z9+9:d9::9:d9c9x8/9y8498498499c9849m9k9:99:m9#:9#:%:9%:&:(:9(:E99o9E9G999o99G9991:91:3:93:99V998P97:8P97:999=:9&:9=:e99?:9V9?:9998_9F9_99_9:_9:_9=;_9K:9K:p999e9N:9999Q:99S:N:9S:99p98q99999t999t999^:9^:_:8y9_:9b:d:9d:f:9f:g:9999Q:9g:999999999s:999s:9999w:9w:99|:9b:999|:899999:9!:9+:989:$99-:9999999@:999::999:9 :9999:9D:9::F:9:99,:9`:9:99::9B:9::m:999:9::J:9::!::::C999:::W:9:*::9:9::9:)::9:9::)::*:9:+::9:9-::98:9:::::.99>:8::>:::@::::+:9D:':;:;:99':j99"::::99F::":0:2:90::O:2:9:@:$:9:O:$:v999,:U:9Y:U::Y::H:H:A:A:::h:::`:I:C::L:L:h:C:::I::r:h: :r:t: :Z:t:c9:k9::Z::9::B:E:a:~:k:a:::E:;~:;:m:k::}::;V:}: ;J:;V: ; ; ;W:c:T:;[::;\::;X:;c:]:.:.:\:;[:;;93:X:]:;:z:6:u:z:;<:u:y:6:;p::<:p::9=::y:G::::);:);+;:+;,;:G:::,;:x::6::2;5;::M:5;:P:9Q:2;x:9;9Q:<;:<;::>;e::::>;:B;D;:D;M::::B;:::J;:J;M;::e:M;N;N;:P;S;:P;:S;U;:U;W;:W;Z;:P::Z;[;::];`;:];:`;::[;:::::9;:::::::9:::::::::::p;:p;q;::::q;::: ::;:z;:z;{;::::~;::::::::::::;:{;:;:~;:;:;;:;;::;:;:;:;;;;:;:;:;;:;::;;;;;::/;:#;;;#;;:;; ;::: ; ;: ;:;;;;;;;;;;;:;:/;;1;;;1;:;;;-;-;=;;?;=;;=;;;?;;:;=;;;;;:;;;4;:;/;:;;-;;;;4;:;;;;=;;=;L;:%;=;F;L;;F;;;;;;%;;;O;";:O;*;::E;E;*;.;:;Q;X;6;.;;;;6;;Q;;c;a;;o;k;7;a;T: ;: ;:;;o;;;7;;C;;b;s;;;b;R;w;;I;; ;R;I;G;<!;l;t;V;;v;G; ;c;X;C;k;$;t;V;!;v;$;l;T;f;T;;T;<;<;Y;3;;<;Y;0;;e;<<f;<<;<e;3; <;;;;8; <!<!<|;:<;$<@;;;@;0;l;)<;)<+<;+<|;;:D;;;;;2<;2<8;;9<;T<;;;;;$<|;9<<<;;};<<;;?<;?<@<A<;;;;A<;@<;:`;K<;;;K<;;M<;;;;M<;R<;;T<R<;V<;r;;;\<;V<;r;;\<^<;^<;;;;:z;;;;;e<e<;;;h<i<i<;h<;;;t<;;;;;;;;;;;t<;;;;y<;;;y<;;|<;|<<;;;;;;;;;<<;;;;<;<<;;<;;;;;;;;<;;;<;;;;;<;<<;;<<;<; <<<; <;;<<;<;;;<;<;< <<<<<;< <<<<<<<<<<;<(<;&<<;;<;;<;:<< <8<<<<;8<;(<&<<<";;X;;k;;s;;:<&<G<&<< <<<G<<<3<<<'<,<;<<'<<<<I<<<<I<;<<</<<=<<w;;=</<*<W<<*<3<&<T;<;<;<<<&<<,<<<3<<f<p<7<B<7<<p<<<B<<X<k<<w<n<<X<<w<<<<S<b<`<<b<a<v<<a<v<<x<<=O<=O<x<%<P<<%<l<<4<l<<<==<-<f<P<`<r<-<<r<><<};2<;2<;2<;2<;2<;2<f<`<<4<j<><<j<%=E<<%=<S<k<<<<E<<<F<<<F<<<0=1=0=<<<6=<1=<6=7=<<7=z<<<;=Y<<<<<U<U<<z<<<Y<;=<F=<F=<<H=.I=c<<<<<c<<<I=<Q=<Q=R=A<<<$A<3A<N@<[=<@A<@<[=<<A<<<<<YB<a=<<c=~<<<<B<<~<o=<B<B<<<B<B<W=K=>u=>>>\=>L= >q= > >*==h=&=&=]==h=b=*=>`=b=>v=>`=>>>x=x=g=>^= >q=>i=n= > >i=#>=#>==&>=&>'>)>=)>,>j=j==,>4>=<I==I==I=?I=?I=)@I=4>===O===<R=:>=:>O===S=A>===S====A>==l==E>=E>F>==I>=I><c=========Q>='>=Q>=l=F>=U>=U>V>============>=>=V>=>===e>=e>====>=k>=<=k>======>=>===y>=>==>=@>=u>=>=>=y>>=>=>=>=>=>= ==>=>>=>>=>>===> >>>>=> >>=>>=>>,===== >>>>=>===>==>=>>>>>>>>>>>>>>>>>=>>>>>>>>>=+>>+>=>=>7>>>7>>>>>>0>>>C==>>>= >(>>2>>>(>>(>>>>2>>>D>">>D>>=8>8>1>-><>>>->>>H>;>>H><>=>>=>==>>9>>>=>>.>[>=d>[>>2>>d>>>?>>>6>.>;>>K>K>>>>6>?>9>;>>@>>C>i>>B>i>>j>\>>>j>g=>>C>?u>?J>m>>B>R>>T>R>>J>?T>n=>? ? ?^>L>=#>*>^>s>O>=)> ?s>O>*>???>>>?>? ?u>?>=4>=4>?>>:?>!?w>!?#?|>#?'?}>w>>?u>'?)?>)?@?>=F>0?o>=F>>>0?1?>>1?>6?>6?7?H?>>>:?>>>?>7?>>?o>>@?>>>>|>>D?>>}>>G?H?D?>K?>K?L?M?G?>P?>P?>l>l>>L?>>>>>M?>W?r>>>r>\?>>>\?>>>>>x>a?W?>>>x>>e?>~>h?>h?>>k?>k?m?>m?s?>=>>>>>>>s?>>>>a?>~>>e?>>>>>}?> >>}?~??>>>???>??>~?>?>>??>?>>??>?>>>?>>>?>?>??>??>>>>?=>?>? ??>>? ?????>>>>0>>>>">>1>>?>+?? ???>;??8???>?>????> ????*?]??q??3???>?*???4?;>>^?????E???>>>??? ?>?$???$?Y???S???>>>? ???+???;?????8?>i>>\>>%?-?? ?????]??L> ????q??3??^???>?>?>?>??q??y?y?C??E?Q??I?Q?@@I?@ @S?@Y? @?"?d??,?R?"?d???@?@?,?@R??@V???V??@@?@n?n??{??o??@v??>:?#@{?#@??>@?'@o?'@*@v?>@?*@???r?.@/@.@?/@?T??6@?>P?6@>P?>P???>@????T?>@_???????????_???????J@?J@K@K@?i???i???????>m?>m?t??[@????t?[@\@\@???a@?a@c@?c@j@??|???|??????j@??>?o@?o@p@q@p@?s@??u@??q@???u@???~@?~@@?@@@?@@?s@?@@?????@?@@?@??@@@@@?@@@@?@?@@@??@@4??@? @??@@?@??@@@%@@@%@@@)@ @)@?&@0@????(@@)@@@?0@@??@?@@@(@?@1@?@&??2??O??&@)@+@?B??@)@@)@,@)@:@)@V@)@F@)@!@+@7@)@@!@@@U@)@@@d@)@@,@@L@D@@L@k@)@@?:@@?@2@2@@@@V@@@C??@F@@@@@U@@@A@@P@3@-@@3@P@G@@7@@@7@A@5@G@@]@8@@@]@i@^@@i@_@@@@r@r@_@@d@@M@n@AM@AAAk@AAt@y@v@y@ A A A@ AAd@A At@r?*@ Av@Ab@A@`@b@`@A@A@`@w@@A@h@9@@h@9@=@@l@@#A$A?>@Aw@@=@x@@|@C@+A#Al@C@x@@|@+A@@@1A1A@3A4A9A@@@@N@@@9A@@A-@@%A(AA A>A"AAAA5@@8@@^@@*A(AAAAGA(ACA(AAAIAAAA*A'A(AAAGAAHA(AACAAA'AAA%AAHAA.A[An@@A.AA2A/ALA[AAALAy@A`@AA2A@A5A[AAAoANAAoAA5AAAeAAeA[AADAAAApAMAiAAMAgAAhAgABBhADA[ABsABByAjApA[A@$AByAsA[ArA[ABrAA[A{A[AB@+A0ArAlA[ABABjA0A@3AB{ABBlAB"BAAA@9A@9A"B#B|AA%B@@A@@A#B|A@@A@@AAzA%B|A.BA.BAA0BQAAAA0BA4B5B:BAAQA4BA5BA:B;BA}AXAAAXA;BAAAAABBAADBEB@`AAABBAEBAMBAMBNBOBNBASBASBVBAOBAVBAAAAYBZBZBAAA]B^B_BAAAAAADBA@~A]BA_BA@A(AA[AAAAAAAA^BA@A@AAAAAAAAAAAyBAA|BA|BBA@AAAyBAAAABBAAAB@A@ABABBAAABA BBBABBBABAA BBBBBBB@AAABBAABAAAA"AABABBBBBBBBBBBBBBBABA$BBBABBABBBBB*BBB BBBB B BB+B3BA BB+BBB2BBBBB B2B B6BGBB6BB/AABBBBBB/BABBBB/BBB BBBBNAAB1BBB?BB9BTBBBBBiAA?B1BB9BCB,B BABB8BB`BBCBBB7BhBBBBPBHBUBB9BBBdBBB7BB>BBHBBBgBB>BJBaBIBBBaBLBBQBLBiBBABPBhBgBJB CQB C CXBRBzA%B[BiBCC8BTBCfB`BTBmBpBdBhB CXB=BmBBBCC[BBcBfBbB$CBCB}A:BbBCB>CAYBAYBBYBBYBA]BFCBFCBBICBICJCJCBBBBBNCBBrBBBBBBNCBBBBBYCBBrBYC]CBBBBB]CBBaCBaCBBcCBBcCBhCBhCBBjCjCBBBBBBBoCAB BBuCBoCBBBuCwCBwCyCByC{CB{C|C}CBBABBBBBBBBBCBC|CB}CBCBBCBCCBBBCCBCCB$BBBBCCCBCBCCCCBB*BB BB BBCGBBCBBBCC3BBCCBCB&CCB'C&CCCC'C/C*CCBBBABB1BBC&CTBB,BBBBB/C6CB4C6C?C&CZC&CC4CCCCSC&CCC7CCB?CdC&CECCBECC2CfC&C7C,CCCCB1CB2CBC.C1ChBBJBBB.CUBBHC&CpC&CDCBC&C+CDCC+CC&CCC&CsC&CBZCIBB5CBCPCPC5CbCKCCbCCCSCKCCCWCClCGCClCLCWCRB CCLCCCMCCCXC=CMC:CCdCCXCCCCHCCDmCcBCCfCDmCeCDQCvCDRC C[CRCkC!ClB%CB%C&C%CC%CC%CC%CDpCDQCCkC!C[C CpCDCDDCDzC`CDDzCDCDqCnCCgC!D"D(DCrCnCCC!DqC"DrC(D*DC*D,DC,DBFC.DCtC2DCBJC2D.DsCCC5DCC5DCFjFF>FlF>FFF*G*GFsFlF3GsFEHFEHFEHFEHFEHF3GFFFF6G[FFYFFZFFFF>GFF|F6GF>GFF|F[FFZFFF]FFF\FF]FFFIGFIG\FFFFMGMGFOGFFRGFRGqFFOGFpFFFpFFpFFqFEtFFFEtFFFdGFyFFFyFaGaGFFFdGFFhGFmGFhG:HFkGFkGHFmGFFFFHF FFFFuGFFFuGvGFFxGvGFFFFFFF~GHF~GFGFGFFxGFFFGGFFFFFFGFFGFG GGIF3IFGG7GGFF:GGGFFFFFEF5FF0FFGFFFFFGFJGGGF'GFG'GGGFGFGF GGFFFFFGGGGGGG/GGGGGG(G(GGKGGTFFGYGG?G#GG?GGVFFnGG9GGeFFG9GG GG+G1GG+GGGGG7G.G4GG.GGGQGGQG8G)GGGGG)GGI5IIHH"HH^KISHHoKIIII>IKII>IJIUHHFI IIFII I8II II8HHIHIIIII III I0IIII0IIIJIIIIIIEHHGI&I)IHYI&IHI&IDI)IHGIIDIIIYIIIhIIIHIMI]INIIhINIIMIIIBIIYHIHIxHIHIBI]IZHIsHIJKIJKI]I~IIJ~IJJIpI$IIOI$IJSISIOIJIJJIJII.IIJ^I.IJII^I{H3IH3IH3IH3IH3IH3IIIHJI>JIIIZIZIICJICJIJI`III`IIIIIIJIIKJIIgIIIgIiIIKJIIIRJIiIRJIIIInIIIIoIIoIIIrIIIrIoIIHyIIyIIyIIyIHyI5IyIIIfJIfJIIIIkJIkJlJIIIIIIpJIIlJIIIIIIIIIIIIIIIIIIIJIJIIIIJIIIJIIIJJJIJJIJIIIIJJJJJIIJIIJJJJJIIJIJ JJIJJ JJJJ JIIJ JI IIJJII8IIJJ&JJ J-J$J$JIIJJ-JJ JJJJJJIJ*J)JJII*JJIJJJJJJJIII0J@JJI@J&II]IIpIIIIII0J JJ JJI/JIJ'J'J/JJJJJJMJJJJJFJJJJ1JJ&JFJMJ7J+JeJ+JI7JPJaJJPJaJIJ JeJNJJJJIJ8JMhMMNAMM>M|LMLMLMLMLMNMTMjMhM}MrMM}MVMIMIMMJMM NJM%MVMM%M NiMrMM'MNMMMNN'MiMMMNMNsMMNNNsMN|MDMcML8ML8MyMM#NyMLNNNM=N)ON)O+ON+O,O,ONNuN1ON1O3ON3ONN>NNMPNMPN:ON:O;ONN=OMYNMYNhNYNNYN7OYNOYN=ONdNNNdNNNNNiNNNiN;ONRONROSOSONNNVONNVONZONZOMrN]ON]ONNaONaOM{NcOfONcONfONNNNNNNNkOkONNNoONoOpONNNNNNNNpONNNNNNNzO{OzON}O{ONNNNNONNNNNNN-ONMNNNNNONN}ONNNNNNNNNONOO OONNONMN OOO OON O OONNOO ONOOOOO ON%NNNONNO OO#O"O!NNO#OOON"ONNOONONNO-OOONOO$OOONN7O$O7OOO9OOOOOO&NNONN>ONONON(O(NNAOO9NNNAO(OFOO%O/ONO8OO%OO6OFON6OLONKO7O8O/OJOLOOJOOO$ONOO&ON.O&OOOKOOO.OOGOQNO~NONORNOGO7OBO7ObOO@ObOOPO7OOOCO7OOBOOGOO@O[OtOOO[OOPOOOPwOwOqOOCOOOFOPxOO!OxOuOHOHO!O PuO PUOTONOO'ONOPUOTO'OPPgOuN,OP0OOOrO~OyON,OrO0O2OOPOOPOyO2OP|O4OgOOO|OOODOOOvON;OOO4OOP~OIOO)POOODOvODO)PsOOIOQOOOvOOOsOO5PO5P8POOQO8PNSO:P;P?PONSOOO?PNZOOOCPFPOCPOFPHPOHPOOKPOKPNfOiOONfOOiORPOOORPSPOOSPOOOOONpOOO[PO[P]PO]POOOO`PcPOOOcPOON}OO}OOOhPOOOOOOOOhPOqPOqPOOOOOOwPOwPOOzPOzP{P{POOOPOOOPOOOOPOOPOOPPOOOOOPOPP PPPPPPPPOOPOPPPPOPOOOOOOPOOOPPPPPOP6PPOPPPPP@PP7PBPAPyPAP>P\PPBPPPyPfP\PPQPbPQ@P\PQQPQsPQ^PTPQ^PQ Q}P Q_PoP Q Q7P\P Q_PVPPP QVPQaPYP}PTPQPPQQPQ4P~PQaPQdPnP4P|PnP Q|PsPbP QO;PO;PO;PO;PrPuP(QrP(QPpPDPPvPDPOFP.QP.QdPPPuPPuPPuPPvPPPUPPPPQP>QAQPPPAQePPPPDQO`PO`PO`PO`P P`PP`PPPiPPPePDQPPiPPPRQRQPPPPPWQXQXQPWQPPP^QP^QxPPPxPPPPPdQPdQeQeQPPPiQPiQkQPkQmQPmQPPpQPpQPPsQPsQPPPPPPzQPPPPPzQPP~QPPP~QPPPPQPPQPPPPPPPPPPPQQQPPPPPPPQPPPPQPQQPPQP"PPPPQQQQPPQQQPPPPQPQPPQPPPQ%QQ QQQP PPIPPPPP)QQQ-QPPQ)QQQR-QQP"QPR-Q*QP7Q*QQ7QMPPQQR-QQ3QQQQR-QR-QR-QP8Q@QQ"Q&QQPP@QQQ\PPAPPTPPPPPS-QQQ8QQQPQ6PPQ Q%Q/Q'Q%S-QT-QT-Q3Q&Q8Q&QPQ&QS-QQPT-QQ/QT-QQfQ&QbPPQ=Q\QQ=QQ QfQQ;Q;Q0QT-Q?Q2QQ?QQQoP Q0Q Q2QQQ6Q6Q[QYPQPQuPQPQPQPQHQ[Q}QtQQPQR}QROQ[QUQ[Q{QQQR{QR!QHQgQIQIQ!Q RROQ RgQpP(QRP(QP(QRUQRR]Q,Q,QQQQYQ]QRYQRRRRQRuQR RQhQ R|QuQQ%RQ%R&RQQ&RQ*RQ*RQQ-RnQ-R/RQ/RRQnQQ4RwQ4R6RQ6RQQQQRR RRR>RRIRR\QQRR2RR$RARR$RRRRRIRtQQR'RQQQRRRRVRR:RR#RR>R#RXRVRRR`RXRRR@RuRXRR^RJR{RXRR}RXRGRERR^RhRXR:RRRRGRRmRqRRmRRRsRRRcR_RQRQRQRQRQRRXR@RRRhQRRHRScRSSSfRSS`RfRpR SuR S\R~RS\RSbRaRQ*RSS{RSS}RSbRSSShRSRSS"SRRRSiRsRqR"SRR$SiRvRHRqRRjR$SRQFR-SR-S0SRRrR0SRRRR5SRRR5SSR>S?S?SRRRCSCSRRRGSRGSRRISRRLSRLSISRPSRQgRPSRRRRRRVSRVSXSRXSRRZSRR\S]S]SRZSR\SRRReSReSRRRRiSRiSkSRkSmSRmSQRoSpSRRpSRRRRRvSRvSoSRRRRRRRRRRRSRRRRRSRRRRRRSRRRRRRRSSRRSRQRSSSRSSRRSRS SRSRS SSSSRSSSSRSSRSR RRRRXRRRRRRRR4SRRS.RRRR)SRS*S.SS*SSSSSR2RRSARRS)SSSSSS3S4SSRS3SSRRRJRRERRqRR_RRSRSRSSSSS SSSSS SSS SRBS!SKS SSBSSR!SSRSSS&S=S(STSKSRS(S=SRS)SR&S#SRTSR1S/SRS#SS.SS1SS2SbSSS2SAS,S7SSS`SSnSFSpRSSAS`S7S~R SSnSaR S@SSSlSSlS@SuSSSSuSSjRSvRSTqSTRSRSTSqSaSTSQSgSQS TgS TWSUSQS%SUS%STWSTTrR-SR-SR-SYScSR-S6SYSSSTSTTT8SSS6SfS8SShSSfSrShSSdSDSSTSdSDS.TrS.T1T{S{SS1T3TzS3TSNSNSSRPSzSSRPS|SS:TSS:T|S>TS>T[SSS[SSSR]SR]SSSHTHTSSSjSSSSMTSSMTSsSSSStSSSSSjSWTSRoSWTRoSSSSSSS\TSsSStS}SS\TSSSSSS}SSSS}SS}SSSSSnTSSSSSnTRSSSSSuTSRSRSuTRS{TSSSSSSS{T|TSSRSSS|TSSS.SSSSSSSSSSSSSSTSTTSTSSTTSTTSTTTTTTTSTT TTTTSTTTST TTTTTTTTTTTTSTTT TTTTTTTSSTT*TTSST*T/SSbSSSSSaSST&T7TT&TS TTT T TTTTSTTTBT TTBTTTTT T2TTTTT2TT7TTT,SSFSS0TCTT0TTTTTTT;TTZT#TTZTTOTTT,TT`T)TT`TTTT?T5T4TT5T?T4T^TTAT4T/T^TTT/TTATTQT8TTQTTTVTVT6TTcSTvTDTTTvTTT8TTTJT UmThSTSTSTTTTT7TT;TOTDT!T,TOT!TTTTJT[T UTUTFTTmT[TNTT+TTXT+TUTT[TUTXTUTT[TUU?UTUTTiTTS>TwUT%UTrTFTTrT/U/UTmVTVTTNTwTT6U6UwT9UT9UTT;U/VT;UT=VTy?UTVTTTCUTCUTTaTTTTTTTaTbTTTTTbTLUTgTgTTLUTTgTTTTTTTVUTVUWUWUT[UT[U`UTTTTTTT`UTzTTTTTS|TS|ThUTzTThUTTjUjUTTTTTTTTTTTTTsUsUTTTvUTTyUTyUTTvUTTT TTTTTTTT TTTTTTTTUTUTUUTTTUUTUTTTTUUUUTTUTUTUUTUUTUUTUUUUUTUTTUUUTTUUU TTUUTTUTUU UUTTUUUUU0UCTTUUU-U!UU-UUUUOTT4TT UU:U>UU:U#TTUUUT4UUTU)TTUAUAUU4UEUUUT1U3U8UUUU3UU8UTUUUUUUVUVUUUUUVUUUUUVVVUVUVU#V!VUVU!VVVV5VUUVVVU+VVV5VV+VDUUVV'VNUU#VVVVV0VVV?VVUUUV0VVV'VV0VVVVVV0VRVVIVVVV$VVVVVVVRVVVIVVVU*VV*VVV'VVVVUVNVNVUV$VVV:VcVV:VV9VJV1VVJV1VVVVWVVIVQVVUIVWVQVVV7VGVCVqUV9VcVCVVVGVV7VcVkVhVVVkVWsVWWKVWKVOV[VHVSVvVU"V W%V[VYVrV W WYVvV%VVVVW WSVWV-V\VdV-VsVcV\VVV/VnVdV6VnVVaVaV6VWVWeV`VWWeVUXW>XWWWWBXWBXCXWWWWGXWGXCXWJXWJXWWOXWWfWWWOXPXQXfWWVlWWWWWVpWQXWrWWPXWWrW]XW]XWWWWdXWWWW{WWWdX{WWWWWWWWWWVWWWVWoXWWWoXWWWWrXWWtXWWWWxXWxXVW!WW4WWVWCWW;WWWWXrXWtXWXWXWXXWWXXWXWXWXWWXXXXXWWXXXWXWXWWWWXXWWWWXWWXWXXXXXWWXWXXXWWW!XWWXWXWWXXXWW XXW XWWXXWXWWXW0XWXX0XPWWXX*WW8X6XW8XWW XW X XX XXXXXhWWWWWWWW!XWHWW\WWyWWXXXDXXXXXDX#XFXX#XIX.XXIXXX+XXXXX$XX?X,XX?XX$X+XX,XW)X^XX)XXJWXUXHXXUXXXZXX:X=X9XRX=X XRXX X9XX:XXXsYsYsY sY !sY"sYE)sY*sY.sY.sY`XEYXBY/sY/sYK<sYOsYTsYXsY^sYeXMYwXPYXPYXPYXRYYPYXPYYUYYYXVYYYXZYCZYX\YCZNYYEZgYYYY)YYYYYYXdYYgYYYYYpYYYYYYXlYXlYXlYYpYYYXZYXZZZYZZ\ZY\ZYYYYYYZY{YYY{Y!ZYZYZYYYZYZYEZYmZYYYmZoZYoZYY-ZYrZvZYrZYGZYvZXYxZzZYzZBZY YY6ZYYYxZYZYZZYYYYZYZZYYZYZZZYZZZZZZYZYYZYYZYZZYZZYZZYYZYYZYYYYYwZY[Y[Y.\YYYZZZZZ!ZZZZYYZZZZYZ ZZZ ZZZZZZ,ZYZ,ZZZ2ZZZZZZYZ ZY>Z ZY>ZAZZZYZAZZY-Z/ZYFZ/ZYFZ ZDZZ ZZ:ZJZYGZY:Z%Z+ZDZYZ%ZZZjYYZ1Z+ZYZJZY1ZIZY)Z?ZYUZ?ZZUZZZZ4Z_ZZZZHZZ4Z)ZIZZ3ZZBZVZZiZVZZiZZZ6ZZZQZnZZKZZHZZKZgZlZlZ ZZgZZKZwZZGZ`ZwZZwZHZIZ ZQZZ3Z_ZyZwZZwZZwZ[`ZbZwZ{ZwZ[[[Z&ZyZ [aZ[Z&Z [aZ[Z[ZZwZ[|ZwZ[Z[[ZZwZZwZZwZ[ZZZwZ[bZ[ [![eZZ [{Z![Z&[eZ&[+[ZZwZZkZZwZ+[ZwZZwZZwZ3[|ZZwZ3[ZwZ7[Z7[9[Z9[:[:[ZZZ>[Z>[ZZ@[@[ZY\ZE[ZY\ZE[ZZZ]Z]ZZcZZZZN[ZZcZZZN[hZZZZZhZZZT[ZT[V[ZV[W[W[ZsZZ][ZZsZZZ][_[Z_[}ZZZZYzZZ}Zf[Zf[g[ZZi[j[ZZn[ZZZn[ZZj[Zs[Zi[Zs[g[ZZZw[w[ZZZZZ{[|[ZZZZYZ|[ZZ[[[A[[;[[L[[[Z{[Zl[[o[[[k[[[ZZ[[[Z~[[ZZZZO[[ZZ[Z[YZ2ZZ[[[[Z[[[Ze[[[[[[x[[[[[[[[[[[[[[ZZ}[[[[[[[[['[[[[[[[[[[IZZ[Z_ZZ[[[[[[[[[[/[Z$[[[[/[$[[[[[ZA[,[[[,[[[[Z[[?[[[(["[?[[Z*[nZZJ[P[[J[[([*[Y[P[Z[A[[ZU[1[ZF[1[[F[[[X[G[G[Z[[[A[[X[[;[B[<[[A[[[L[[[l[[B[[U[Y[[o[[[[[k[Z[H[r[ZA[[H[\~[\\\O[Z![[y[ \[kZ![ \t[`[ \ \t[\[\\[[-[[z[v[v[-[\z[\Z[\\e[\[h[6[[[6[[[!\[Z:[!\Z:[#\$\$\[Z@[#\[+\x[+\,\/\[,\[/\[[I[[[I[[[5\[5\6\R[[[R[[[6\}[;\[[[@\[;\[[[@\A\[[[[[E\[E\F\[[A\[K\[K\P\[Zg[[[F\[P\R\[R\[[V\[V\W\W\[Zs[Z\[\[\[_\[`\[_\`\e\[Z|[[[[[e\[[g\[[[[g\[[[[[m\n\[[n\[[[v\[Z[Z\[v\x\[x\[[{\[{\}\[}\[[\\m\[\[[[\\[\[\\\[[[[[\[[[\[\'[[$[[\\[\\\[[[\[[\[\[[\\[\\[[[\\ \\\[\ \[\\\\\[[\[\.\\\\\\-\\\[["[[\Y[[\\\\\'\\\\\\\\.\\(\-\.\\.\\\)\ \\.\\0\:\\)\\\<[[%\M\\%\S\I\\0\\S\\\ \<\\1\\ \'\.\\\\L\L\2\D\H\r[[1\I\\D\\\X\\.\\\y[\`[\(\.\7\3\\Q\p\ \N\p\ \7\\r\\X\M\\N\o\j\\o\y\j\[\z\r\\z\\t\\h[\\o\G\t\]\j\ ]y\]G\~\j\Q\M\\j\ ]Y\f\ ]*\\\\ ]Y\\*\]\][/\]~\]4\\]i\i\\]]b\\4\]=\h\\8\8\\k\=\h\\q\\\k\[A\[A\(][A\b\j\[A\/]\/](]q\\\3]4]\|\8]\3]\8]\|\:];]:]\=]\\=]\;]\\\D]D]\F]G]I]\I]G]\\\\\\\[e\Q]\Q]S]\S]T]U]V]\\X]T]\U]\[]_]\V]\[x\_]X]\[]\[x\\\d]d]\[\[\\\\\\\\\\\F]\\\\\p]q]q]\\\p]\w]\w]x]\\z]|]\|][\x]\[\\\\\\\]\\\\\z]\\\]]\]]\\\]]]][\\\]\]\]]]]]]\]\]]]]]!]\\\\!]\\\\\\\\\\]'] \\:\\']\M\\j\\\\] ]0]I\\<\\2\\] ]H\\]],]1]\\1],]6]6]\]]]].]]2]]].]]]]]]]]&]%]]]&]2]0]]3\\]\-]L]\@]L]\@]]\]]]]]5]]]]]J]]]0]]*]5]0]E]W]]7]e]W]Z]W]]E]j]W]]]5]]e]]J]<]-]0]*]0]9]]7]0]]\]]f\ ]]Z]]]j]\]9]]]]]K]]]]^]b]]]t]]^]]^O]^^t]`]$]v])]h]O]`]K]W]]]W]v]P]]P]R]$]h]R]k])]^]]k]^]e]?]]^\/]|\4]\4]\4]0]4]W]4]`]4]^]]f]]]\=]f]?]]]B]]]B]]]*^*^]]].^].^\I]]]3^]]]3^]]8^]]N]]M]8^]]]]Y]]]]@^]M]]@^B^]B^]Y]\_]]]]]\_]g]]]]c]]]c]]g]]]]]Q^N]]Q^]r]]]]Y^]]]]r]Y^[^][^\^\^]]]]u]]]a^u]]\|]\|]\|]a^]h^]h^j^]j^]]]]]]]]o^]]q^o^]]]]]]]q^]y^]y^]]]]|^}^]]]]]]]]]]}^]|^]]]]]]]]]^]]^]^^]^^^]^^ ^^^]^]^]] ^]]]]]^^]]^^^\]^]]!^^]!^]]]]%]]^]^]^^^^^^]^'^^])^^]^!^^^^^]^5^]^5^]!^^^ ^)^!^9^]<]]^^^ ^9^^^^^<^]^]/^:^]^1^^1^:^]=^/^<^H^] ^H^^ ^^^^R^^K^U^^0^^K^^^^!^]-^^]^^=^<^b]]>^2^2^]^>^P]^]^]^!^^<^^Z^^R^<^]^Z^-^Z^^^^0^<^^^^Z^^s^^s^Z^p^Z^r^Z^^p^g^^L^Z^^Z^k^Z^z^g^_z^___L^__r^___^#^k^^#^n^^_^Z^(^n^c^^^(^_c^_t^Z^^Z^_^^Z^^Z^__^__`^i^__`^_^_ _#_^_t^#_u^^%_^^A^^%_u^v^A^*_^v^^C^*_^C^^~^^0_0_~^3_^3_^^6_^6_7_<_^^^{^^@_{^<_ _^^^^^@_d^^^^^^][^F_^F_I_^^b^I_K_^K_^^^d^R_^]j^^^^^R_S_T_S_^^^X_^X_b^^T_^\_^\_^_^^___`_`_^__^c_d_^^^^^^^^d_^n_^n_p_^p_^^t_^^^t_^^^^^^^^^^{_^{_^^^^^^__^^^_^c_^^^^^_^^___^_^_^ __^_^_^ _^ __^__^^^_'^^_ ___^^^___^"_^ _ _^"__^_^^___^^ ___(_^ ___^_^^_(_^__!_'___^_!__8__ _____ ___U^^_^ _:_9_H_9__ _$_9__:___H___&_9__&___$__B______G____)_9__Y____)___A__V_Y_9___=__=_9_A_[_V_[__C___Q_Q_l__D_l_O_b__O___5_e__5__D__]__M_]___;__M__+_m__J_P__E_;_l_i^_-_v__J__V_m_l_~_L_v_l_ `~_ `^#_^#_`E_]_`_P_+_L_-_``U_`_U_l__l_`C_[__l_^3_^7_^7_ _7_9_7_[_7_l_7_^<___$`$`_g_l_(`g_(`)`,`r_r__,`-`-`_/`0`0`_3`}_3`w______8`w_8`__<`_/`_<`__W___W_@`B`_B`@`___G`___G`__^c_}__^c_O`_O`Q`_Q`R`S`T`T`_^p________u_\`__y_____y_u____e`_e`__\`_j`_j`k`^___k`___p`__t`_p`_t`__w`_w`y`_y`z`{`{`_______^_`_^_``_```__```_`_`___ ``_``_`````'__8__`_```_`_````__````___``_```_```__``````_```"`````B__``_`7`G__`````````*`#````*`_```C```H`C`%`C````H``'``1````7`1`_`_`_I`b__`K`P`P`_`K`e__`%`I````9`_N`9`U`V`_`E``N`+`+```Y`W``=``X````;`Y`W`?` `;`?`E`V``[`X`^`]``]`` `Y``[``Z`=`ai``^``Z`_`ai`D`_`}`a&`x`x`}` ab` a af` a``&`f`}`a_)`_)`_)`_)`_)`a`a_`aaf`b```a`a`}```qa``` a a`a`$a`$a,a`a```-a`(b`Mb``}`,aya```2a`eb`fb`2a3a``3a`6a`|`_S`_S`_S`_S`_S`gb`b`b`b`3c`d``Ea``Ac`````Ea`Bc`Cc`c``d`_j`d`d`Ra6a`TaVa`VaYa`Ra`Ya[a`[a_a```Ta`_a_z``z`_z``z``z`ga```ga``iaia`oa`_``` ``oa``qara``ra```wa`waxa``xa```~a~a`aa``a``a``a`a`a``a`aaaaaaa`a`a``aaa aaa`"``7``aa`aa``a``aaaaa`aaa#``C``U``a`a!aaa``aa`aa`'``a aa```a``!aaa4aa+a a`+aa`%aaa%aaaaaDa``a` a/aa5aDa`5a8a;a;a`aa/aa4aaa8aKaOaaKaaaLa(a.a`aa(aa"aLaaGaLa.a`a"aaGaaD``}``````````a0aaa]a]a`aaadaa=ab=b>b b>b'b>bbbbab,b>b*b0bb*b5b>bbbGbb_b>b/bbb/bb.bRbb.bbb=bNb>bbb bbb'bb[b>b]b`bBb>bb]bbbb5bb,bbGb0bdbTbbbdbb_bbbb[bbNbbbBbbbrbbrb>bbbb@b@b>bbbKbKbObcsbckbxbsbxbc}bbkbccIbcabb c c c c^b caba(ba(b}bxb cabcVbccb^bbcca3bblbcbcwbcIbxbpbbbb"cpb"cVbbCbb%cbb+cbnbCbbnbaDb+c.cb%cb.c/cqbb2cqb2c3cbbbb/cb7cbbSbbbbbSb7cb@cb@cAcBcCcDcwbbbbDcbmbbbbJcbbagbRcbagbagbbgbJcbRcbmbbbbbbbXcbXcZcbZcbbtbbbtbbubbbbbbcbbcccubbbbccbicbickcbkcqcbabbbbbbbqcrcrcbbbbbbbbb|cbbb|c~cb~cbbcbccbcccbbbccbbcbccbbbbbbbbbbcbbbbbbbcccbbbbbbbcbcccbbccbb>bbxbbbbbbbbccbbccbbccb0bbccbbbcRbbcbb0cccb0cb0cbc4ccb0cb0ccbb4cc0cccccc>c1cccb>c`bbccccEcc;cccIcccIccTbbcc#cc0cEcb#cGccTcccLc c$c!cc$c;c0ccObbIc0cUc=ccbcLccUccc?cc?c^ccc5cKccccTc0cHc^c5c^cOc^cc6ccHcjc^c6cKccjcccgcclbcgc^c_c^ccOcd_cddvcddtcddb"c d]c ddVcvc^cd]chcucddhcdcdccddccdtc^cVc^cb3c8cmcdcb7cc8clc{c"dlc"dMcnc%doc%d.dcdmcbCcbCcbCcbCcbCcbCc.dncsc1dc1dccocwcwcMc]ccmcccced>eAedddAeBeDedDeddbddHedHedddbdLedLeddjdddddjdqddddddTeUe]eddddqdBedTeddddvd]eddvdd`eae`edddddddddddddkedkemedmeddpedpeqeqedddvedddvedddd}eddddd}e~eedddedddde~edcd#dddd@ddBddd eedddedee eeeeededdeddedde*ddddedeeed ed e!e ed ee eedeee!eede9ddeeee*eedeeeeed$e$ed"e.e4ee.edd"eede4eKdde[dd e8eed*ee eeee/e=ee/eWddeddddEeeJeJe?e?edeKeNe2eNeidde*eeKeee2eeoddeHdddddddddddde%ee1eee6eee-e_ee-eee:ee:e_e3eYee3eebeYee8e@eFeee@eebeeEe=e%eNeehe1eNe6eNefefffGefeef fWe f#egee#efeceeGehed)eWeefceffd0eoedefgefoefreeffre!fwewee!fsee#f}$f#fseene*feene*f,fe,fIee.fuee3fxeeIe.fue3fete6fe6f7f8f8fye@fedUeyeedUegee7fe@fBfeBfCfCfeEfLfedae eae eaeQfe*eaeLfMfEfeeeMfeQfRfdmeRfedmeeedmexeeeeee[fee_fe[fe_feeeeeegfegfhflfeeeeelfeeeeeeeeeeeeeeeeeeeezfezf eedehfefeeeeefeeeefeeffefeffeeeefefeffefeeffeeffffde8ee=eeNeefefefeffeffff ff fef f fffffffeffefffeff"ffff"ffffffffefff fefff"fff ff fffffIffffNfff_eeffYeefheeeIfFfffeFeef"feFfDfe9fDfffNff9ffff4fJf=ff4fafff4f0f)fKfafbfaff0ffJfefdefefefffKff fbfrf fOfrfjfmfPfafmfffjfAfaffOffofaffffAffPfgofifafVfafgggifgVfne$fe$ff$faf$ff$ff$f~fafgg~fggZfgte,feffnffgefgffgge7fZfafffgnfkfdf$gf$ggkf&gff&gfeCfeCffsf|ff.gff.g|fff3gf3g5gf5g6g6gfeRf:gf:gg>gfBgfffBgCgffffcfff`ffcfffffKg`ffffKgfCgfTgfffTgUgUgfff[gf[g\g]g^gfffffff{fegfffeg{ffigf]gfigffffffmgffffffqgtgfmgftgugffxgfxgefffffffff^gfgf\gfqgfffgggfffgfgffgfefgfgggfgffffgfffgf gg g gggggggggggggfffffggff g gf#gggggf g#g gg,g%g gfgggfffg,ggg gf!gfgf%gfg!gg ggggggg(gg(ggg gg gggg=ffggg)ffg8gGgggg8gggGggggg1gggSggNgggNggggg-gg"gg"g_g1gGgg`ggg7gRgWgVggWg-g_g g7gEg=ggEggggnggngHg=g g9gXggrggdggg9ggogggSgYg?g`g_ggYghIgdfghrgHghogg hvgSgGgIggsf$gf$g h hwgghwg hg/gZghhag/ghghh~g{ggggh{ghbgvggbgagh@gggg~ggZggfji>j?jii?jiCjiCjDjDjiFj)jiiiiiFjihiiihiPiiiiRjiRjiiiiiiiiXjiXjYjZjYjiyiiZji`jiii`jajajiiyiiiejfjgjgjiijfjiejimjimjiiijiiiiiiisjtjiiiiwjiiiisjiiiiiwjiiiiijijiiiiiiiiiiiiiijjjjjiiijiiijijijjjij jjjjjji jijjijjjjij*jjjitjiii3iiCiij*jjj!jjjj7iiiiDii8iiiiji jijjjijjjj!jii jjjjjj jijiji"jjijjj jj/jJiijjj=j"jKj/jjKiijUii=jKjjSjjj1jjj1jTji&jTjXiii&jAjiSjKjjjKj.jAjEjKjljKjnjKjj.jxiijj jjjcjWjjjEjyjKjjcjdjKjjWj jjEj6jpjj6jjuijbjVjjjbjjVjjj_jjEjkjxjiSjjSjkxjjk_jhjk kyj kkjknjkljkkjjjkkkjjkdj0jjj0jjjkjk{j4jqj{jj4jkjj kj k!k"kjrj(kj%k"kojojj(kiCjiCjiCjkqj%kjjujjj1kj1k2kjj:kjjj7kj7kjjjj:k;kj|jjj;kjCkj\jjj\jCkDkDkjFkiajHkjjKkjKkjjMkFkjQkjQkVkjimjHkjMkjVkjjXkXkjjjkjjjkjkjkjkjjjkjjjkjhkjkjjkjjjjhkjokjokpkkjpkjjjvkjvkijjjjjVljeljjjijkjfljkkjkkjjjkkjjjijjjjjkkjkkjjkjjjkkkjj kkjjkkjk kkjjjkjj#kjj kkj#k kjkjkkkkjjkkkkjjk+kjk+kkkkk&kkkkk$kkk6kkjjk$kk9kkkkk=kk=k3kk?kAkkjkk k6kkk?kk kk,kk k3kBkJkjBkkjj,kk@kjkpjjk'k@kkkYkkkk'kTkSkk k9k*k)kk*khjjLk)kYk/kkLkik[kkTkkikkkNkkNkSkj kkIkkktkqkIkSkktkEkSkjkkEkk]kqkk]kZk-kGkZkkrkbklGkSkllrkl_kl|kj!klPkOkrj!kj!k_kkuj(k.kPkl`kll}klOk-kbk.kl\k|kklldkj2kllj7klakl|j7k!lakkkk$l%lkk+lklk`kk+l,l,lkRkkkkjHkjMkjMkjMkjMkjMkjMkkk!lkkRk}kk?lkjXk\kk?lkkBlkBlkkdkkckkHlkkkHlkckKlkKlNlk$lkNlkkPlPlkSlkSlkkUlVlkkXl%lkXlk]lk]lkkUlkkkkkclclkelflglkkglkllkllkknlkkkknlkkkkkkkwlkkkwlxlkkzl{lkkkkkkkkzlkkkxlklk{lkllkkklkllkkkklkjk&kkkk9kkJkklklkkklkllllkklklmkmknkllkklk3kknkAkklkllokoklkllkoklk(lkl@nkkk(ll-lkk-ll.l lkll)kkSkkkkkkkkkk/kk.l ll1l[kk/lCll1llllll/lklOlllkllkOlLlkl8ll8lk3lLlllk3l:llllCllZl lkZl ll:llkTlTl@lMlkl6l6lMllTllQl2llQlYl2l^l2llYl`l2lll^lll`llblilRlil}lillblDlllWlDllWllRllm}lmmGlmmulmGlilmlmulillil mrl m m ml|l_lm|lmmmlmmjlmllmrlillilllmlmlm m mollmmTmmMmm>mEmlmMmEmnnmEmnwmwmEmn[mmzmNmmzmnnm'mom`m[mNm'm0mhmnm>nmmmmCnmmmCnEnmEnFnFnmHnKnmmmKnmmMnQnmmmljmQn@mmSnUnmUnqmmmmmqmHnm\nmlum\n]n^nlymlym]nm mym^nmhnmmmmmhninmminmmmSnmMnmmmmmmmmmvnmmmmvnmlm}nmmm}nmmlmmmmmnmmmmmmmmnmnmnmmmmmm nmn nnm nlmmmnmn nnnnm nnmnn$n nnnnmnnnm nnnmmnmmm nooo9o7o%oo7ooEonn$o'oEoopooo>p@po@poYooYoooooGpoGpIpoIpncoooYooOpoOpooRpoRpUpoooUp^pooooooo}ooooyoonso^p`po`poyodpoo}odpoooooooooonpooooooonpopppqppponotpupnopooponooo"oo8oo%oo:ooooppoppoppoooooooqpoo po ppp ppoooopo popo pooooootpopop#oo p pppppo ppppppppupo>ooo'ppopppo p'poooppoppp,pppoo,poop%pop%pppppMoo]oozoo2ppp2pp5p4ppp5p/p-p3pop3pppo/pppp9pppTpppKp9p6pKpVpppWpYpppWppp8p)ppp7pp8pp0pqoppfpppCpRopxopopopop ppqfpTp6pFppypFp0psppypqfpqfp`opCpsppjpsp*pjppPpqqp]ppq]p?rfpqqQp1papQpp@rfpapspaqfpqPp*pSp|pqSpp|pp*pKrfpqp1p7pYpxp|pbppqqbpqepkp"qepLrfpqp"q#q#qrprpvp'qlp'qpp)q*q.qplpwpp|p.qp|p2qp)qp2q*qxp}pp6q}p6q7qoRpp{p7qppppp>qp>q?q?qp[ppp[pCqppCqpppJqpJqMqpppMqNqNqpppppUqpUqppppXqpp[qp[qpppp^qXqp^qpbqpbqdqpdqfqpfqppppkqpkqlqpppppppplqpuqpuqwqpwqppzqpzqppppppppppppppqpqqpqqppqppppqppqopppp qppqp qpqpqqpp qq qpqppqqppqqppqqpqpqpp4ppq-ppqp q qpqpqpqqqqqqqqqqpp1qq qqp!qq q6pppqVpp q1q!q1q%qp q%qqqqYppqpqp(q)ppspp|ppppqpq1qqpq8qq8qq(q1qqqqq1qPqAqqPqqqIqq/q=qq/qqIq1qqKqqKq1qiq1qcq1qOqqqZq]q1q;qqqZqOq3q;qqqiqq3qqq\qQqq\qqqcqq@qqqWqWq@qq]qqsqnqpqrsqrrrreqkpqvpqwpqpqqrq rqqKq r+q}q}q~qrhqhqmqr_qqmq+q{p.qp.q4qgqp.qp.qeqnq9q_qqiqoqxqq4qxq9q!roq!r"rqq%rq%rrsq"rqq*rq*r+r,r+rpqgq~q,rqpJqpJqpJqqq~qqq9rqRqqq|q9r|qRqqqqq=r=rq?r@rp[qqqp[qp[qErqqGrErqqaqGrqKrLrMrqqqqpqqMrqTrqTrqqXrqqqXrYrqqYrq]rq]rqq`rq`rbrqbrcrcrqerqqqqqqqqerqlrqlrmrnrqqmrqqrqrqsrtrsrqrqtrqrqqqpqqqpqWsqqqqqrquq%uqjuq}uquqruqrquqruqrqqqpq1qqqrnqq~qqqqrrnrqq rqqqrrqrqrrrqqqqrrrrrrrrrrqqqqrrrrrr rrqrrqqqqr(rrr(rqrrrqrqrr8r;rqrAqq r;r=qqrArrrrrrrrrr rr'r)rNrrr)rrFrrUrqr-rUrrr-rrrQqqAr8rrrVrrZrrrRrRrHrrrSrrrOrrPr^r/rdrrPrrrqrdrrVrZrr/rFr8rQrorrrvrprirrprrrQrIrr\rrr[rrrxrIrrWrWrorrxrrjrvrrrwr[rirSrZrOrZrjrirr_r_r\rwrvrq,rsarsq,rsrs3rrkr3rrrarirrrkrssrr$sr{rsss9sss%ts%tsls'tDsspsDssos'tssps.trIs.tsssOsssOs5t5ts8ts8t9tEts9tsrWssWssWs)tWsLtWsTtWsssssssEtbssHtsHtKtssbsKtssNtsNtRtsssssRtssssssss[tsssssss[t]ts]t^t_tbts_tsbtdtsdtsssssshthtsmtsssssmtssssssssrt^tsssrtsss{ts{tss}tsssstssststs}tssssstsrs.ss tsssZsststtttstttsttssst t tstssstt tssssssstt tttttss t(ttt(ttttts+t/tst)t&tst2t&tsst2t+t)ttts/t ts t ttttt tt-tst-t t)tt!ts t!t)tttu>utAutAuCutCuttttGutGuHuttsdtttttttttQutHutQuRuRutttttWuWutttwtttwt]utt]utttttttcuducutttdutttttjumutttmuputttputtruwutttrutttwuttzutzutt|u}ust|utttututtuutuuutuuuttututuuuuutt uttututtutut uutututuuutuuuuuu uuuu&uuuttututt)ut*uvutWutWu>viuuuuuu[uu[uu_uu`uJvuuu`uuJvKvKvu_uuuutjutjuuutjutmuUvuUvuutruuutuuutu\vu\vutu^v^vuuubvubvuudvt}uuudvutukvukvtuuuuuuurvurvsvuuuuuu uuuu)uutuuuuuuuuusvuuuvuvuuvuvuuuuuuuuvuuuvvvuvvvvvvuvvvuvvuuvvvvvuvuuuvuvuuuuvuuuvuuFuubuuuuuuuuuv+vvv+vvvu@vvvvvv%vvv6vvv!vvvvvv'vvv(vvvv,uuvvv"vvvvv@vvv'vvDvAvvDvvvvvvvvvBvvvv(v!vvAv6v%vv$vvvvVv?vvvVvvPvvvQvvv.vvCvFvvvCv@vav/vPvAvQvAv7v/vvavev/vvv7vvvBvvevvv8vivv8vvlvlvivqvivv.vAvvivvwqvwwvwwxvwwmvwxvivmvMv wwv wwyvwvnvyvovwwjvwjvRvwvwwvvvvvvivwwvwww_vvvvwvvw"wvvv"w&wvvlvvuv&w'w'wpv}vv,w}v,w-w~vtvLv~vvv_vvvLv3w4wpvuvYvvvv9wv9w4wvuUv>w|v3wv>wvvvvvYvvYvvvDwEw|vvvvIwvIwvvMwvvvMwNwNwvQwvQwukvTwvTwvvWwvWwZwvvvZwvv_wvDwv_w`wvvEwv`wvewvewfwvvvvvvfwvvvmwvmwnwvvvvvvAvvxwvFvvvvnwvvvxwvvvvvvvvvvwvwwvvvwuvwvwwvvvvvvvvwvwvwvvvvwwwvvuv%vv!vvvv"vvwvwwwvvvwwvwwvwww wwwwwvvv wwv wvvvw)w ww w)w(wvBvv$vvw(w?vvwwwwww wwwww*www/w/w*wwwww*www/vvivvvvvvuvvvvwwLwwwwwwOwwww@wwLw*ww)ww+wwwwVwFwwVwwPww:ww)ww*wOw*wMvwovwRvwnvw@w5w+w5wwPw5www:wRwwhwSwRww7wwSww!wywowJwhw{wwgww#wow7w{wxxGwxyw{wgwUwXw{wJw!w xzw xxXwUw#wxYwxxpwwtv-wv-wv-wv-w)w-w*w-wGw{wxpwzw{wxjwv3wxvwuwYw{wqw{w;wvw&xww;w&xww)xqw)x.xwwrwsw{ww{w.x~www0xwwKwKwsw0x~ww{ww{ww{wvQwvQwjwww{w=xw=x>x?x>xw?xwww]www]wExwwExwIxwIxcwwwcwwwMxMxwwwPxQxQxwPxwTxUxVxVxwTxw[xw[xUxwww_xw_x`x|wwwwwwwwwww|whxwhxwwkxwkxmxwmxnxnxwwwqxwwyxwwwqxwww`xwwwyx{xw{xvw}x~xwwwwwwwwwwww~xwwwxwxwwww}xwxwwwwxxxwxxxwwxwwxwxww xwwwwxwxwxwwxxxxxxxw x xwxxxwx+xwx1x+x xwx+xxxx xxxxxxwwx,xwx1x9x,xx5x+x5ww{wwwwww+xwrxwx+xx9xAx+xFwwWx+xRwwxxFx+xw1xwx@x!xNx+x!xwx@xxx5xxxxxxAxxxxFxxWxxxNxxOx2xxx7xxOx7xDxxKx+xxx7xx:xxx/xxaxRxxxKxxaxxwxixrx:xDxxixuwxxxYxYxBxx/xDxbxfxycxxybx|xGxx|xxrxXxcx y yx yXx yrw)xyyydx\xxySxSxrx-x\xxxx-xyxy4x]xxxdxrxx4x8xx]xrxx8x!y!yx$yx$ypxxCxxxxw?xHxpxxCxxsx0yxxrxxrx0y1ysxHxxx1yxxx7yx7y8y9yxx9yx?yx?yxZxxxxxxxGyxx^xGyexxgxxLyxxexLyxgxxxOyxxwkxOyxZxxTyUyxoxwnxUyxxxxx]yx]y_yx_yxxTyxxxw{xw{xoxxfyxxhyfyxxxxxxxxxxxxxhyxyxyxyxxxxxzyxzy|yx|yyxxxyyxyyxyyxxyxyxyyyyxyyxxyyyyyxyyyyxxxy yxxxy yyyyy yy yyyyxyxxyxxxyxx yxxyyxyx yyx#yyxxyyy&yyyy&yyyyyyxyyxyyyyyyyyyy"y;yxyyy(yyy*y;yy*yy2xxDxxyyyyDyIy(y"yyDyy&yyyFy)yx&yyyFyRxx=yyy=y%yyy&yyyy+yQyBxxy%yfxxGxxy+yy+yy.y5yy.yyyy@yQy4y6yy4yy@yyydycyVyycyxydyQyyy=yyy@yyWyy5yy}yjyzVyyzz}yzryzz~yWyQy~yQyXyy zzyzryQy zXyzzzwyzzyyYyytyydyzyzywyyuyyzx8yzx8yzuy$zy$z%zx?yyy)zy)zpyoy,zpy,zxyy%zy/zyy1z/zxyyy4zyyyy1zy9zy9zxTy{z>{zz[zzzzzzzzz[zy_zy_zzzK{zzzK{M{zM{zzzzmzzS{zzzS{zmzzzW{zW{X{Z{zZ{zz|zzywzX{zzzz|zzze{zze{zi{zi{l{zzzl{zzo{zo{zzzzzzzzzzzzw{zw{y{zy{{{z{{zzzzzzyz{z{{zz{{zz{zz{zzzzzz{z{zzzz{{{zzz{{{{{z{{{z{ {{{{{zz{{zz {{{ {{{z{ {{{{ {z{zz!{z{{{'{zz{/{z{/{5zz{{!{{z{{{2{z{'{{{{{ {%{{{ {5{z${5{{${{{4{z"{4{3{z{"{{,{{-{3{{-{{,{({z{:{z{*{+{:{{{H{{{{E{{E{{{BzzB{O{.{R{{+{7{R{{B{{{7{{{F{{F{Y{{.{H{3{{[{{{{d{{6{d{k{{{<{{{]{f{{\{{N{s{{{N{6{R{[{Y{{]{z{oz{{A{{^{@{{|}{g{0{}{<{R{m{G{{^{|||m{z#{z#{z#{z#{z#{|{\{R{A{s{b{{|b{|{{G{0{t{{|\{|t{||{|z{~{|z{|{{ |z;{{{%|{ |{%|'|j{'|)|x{)|*|{{{{I{{*|n{{I{3|{3|P{{{{{P{<|{{{T{{{{<|{T{{{a{{{{_{{E|{{{E|G|{G|{_{j{{x{{{a{OL||{{O|{O|n{{R|{R|zl{{{V|{V|W|{{{{Z|{{{{{{{{|{z{{{{{|{{|{W|{k|{l|{{{k|l|{{o|{o|p|t|{{{{{t|v|{v|{{{{z|{z|{{|| {{{{{{||{{{p|{{{Z|{|{ |{{{{|{{| ||||{|||{ |z{| |{||2{{|{{ |{|||{| || ||{|{||||{{||{||({{|{{| ||{{||{*{{|{|{ ||||||,||{{R{{{{{{{{O{{|+||||+||4||||Y{{4||{C||C|{C|,|C||:|C|8|C|2|C|5||k{{X|C||5|@|C|f{{s{{|,|@{{|:|||:||8||N|C|m|C|c|/||C||,||c||H|&||H||C||C|g{||C|||2|||?|>||X||C||?||C||C|\|;||\|>|||||C|;|||X||@|}N||C|}|C||C|d|J|~{|}d|{ |}Q|| }Q| } } }M|[||M||}{*|}[|}|}w||}w|}|i|}|}}}|}m|} } }|"}||$}%}$}n|%}|F||n||r|F|,}-}"}||r||s|{L|C|L||L|~}L|}L|~L|,}|-}|||;}|;}=}|=}|||Y|A}|A}B}||^|||^|b||B}||b|J}|J}M}|||M}O}|O}h|||h|||||V}|{l|V}||{p|Z}|Z}||\}\}|`}|Y||`}||b}e}|b}|e}||~|||~|||k}|k}||||||||||||y}|z}||| }|}|'}|y}z}}}|}|}}|||| }|4}|||||}|}}|}>}|P}|}|}}|} }}||}|||||}}}||}|}5}|Q}|}||||}2}|}|||D}|||||||||}|}}}}}}}}}'}}|}| }0}|}0}}|||}}|| }}}}|}}4}}}1}}}}}}3}/||}}}&||}>}}}<}<}#}|>}}}4}@}|}@}}}}}}P}}(}||}}C}C}(}}5}}}Q}}}G}G}R}}}9}9}a}}h}||K}J|}|}|}|}i|}:}h}}}:}L}[}}L}}}2}}}d} }]}c}}]}K}a}H}o} }H}}D}^}d}~^}o}}~I}~}~~I}!}}~}~}f}!}|"}~} ~}f}u}m}~u}~~ ~g}~}s|-}g}~}#~}i}}~7}r}~~_}_}}t}}8}t}~~i}}7}}}}8}#~j}s}E}}}~}?}j}p}?}~}}~}s}E}}~}}E}q}p}1~q}1~}}N}}}}|O}|O}}N}|O}}~}=~}=~?~}?~B~}}}B~D~}D~E~|`}G~r}}}}|e}E~}G~}R~}}}R~S~}}}}S~}}}}}Z~}Z~}}}}]~^~}}]~}^~}d~}|}}d~f~}f~}}}}}}l~}l~m~n~}}n~}m~}s~}s~t~}}}}}}~}t~}}}{~}}}}{~}~}~~~}}}}~}}}}}~}~~~}}}~}~~}~}~ ~~}}}~}}"~~~}~~}~}~}~}~~ ~~%~~}~~}~~1}}~3}}}~~~_~~}}}"~~"~#}}~~~~~~}5~}L~~~5~~8~~~~0~~0~~~~~~~R}}a}}~~[}}~%~~9~~*~~}~@~C~*~9~C~}~}}@~<~I~I~}~<~~$~~c}}}$~~7~7~&~&~}~`~J~~}_~J~}~`~~L~~~8~~e~.~~e~~~:~:~2~~;~c~~;~c~~~m} ~~6~~i~~}~A~~6~>~}~i~A~|~h~~~|~N~}~}~~N~h~ ~"~  p~~ b~b~~k~X~~y~~f~)~k~y~)~~~o~~o~~~~~~~u~~~g~!"$r~$}?~o~!~r~~,v~,F~~~~1~~F~1v~~~~~Q~~~Q~~~U~~}S~}S~.~w~~U~a~~~BCB~~~~~C~~~j~~~~~~N~NO~j~~~V~~~O~V}m~~p~}s~}s~~~^^~~~~~~~~e~~~~efg~~g~j~~j~~~no}~n~~~s~~~~s~~~x~~~~~~~~~~~~~x~~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~}~~ ~~~~~~~9~~~~#~~#~^  ~~*~~*~~;;9E))~E344~3.~~2~~/DQ>~~h~~~~G/)RQYWQGYPUbD)USbSk~ X~ ~ u~ g~ IRYLA>kSWYAyuyTrTr__~"p~"~"~"PYISpLSt  c#c#==-{?v?v{-.225566z::z@@BB~^EEHHLLNNPPTT~oZZ\\w``a~~ ~~~ppssvv~z{z {~   ~)YSt 9''%'%8~8€€Ā;Āŀ8ǀʀ 8ʀ8ŀ,ǀ,π1π8Ӏ<8ӀՀOՀ'8889SD7>u89888m8e887DAR>kR ׄ8 >;eAŅ8,e eCFm1e?mF?kCUkfU<eOeqhq~....fk2~k k #rk#%%y(y(rkkEGEG1144668989==XX̀X]]aa aaMMjˀˀ̀ЀjЀUUȀ΀XȀXY׀tỲрۀۀ``||tрs̀׀kklmـlƀmƀ̀΀sԀ΀ƀـۀxҀxҀ}~݀ր}Ԁ؀ڀڀր   ؀܀ek΀ À À -ހ  ɀ -SՀ$ɀȁހ:-ȁɁD:Ɂ@DӁӁ/>I>$@IVBVށBށZWA[Z\[GN/-2Gh\N72^7AW^?<<!?CpTnn&TRORC' wp!Z  rO&]'+rw]*a+_n*_c03bj00abc3%ennn n0e%zjnEzv++/vE/00yJJ77S;;==SۀYBBDGDGǁdhdhPṔˁSˁЁˁŚuˁus΁|΁Ձaׁa݀~Ձ|́ˁׁiiЁ߁n߁n܀ -WwwyyzźЁҁҁʁہہʁ فف؁܁܁؁$ .'3&(&12??4>݁@ ,Ȃ4݁@Ȃ,7nǁˁ> M56-MMۂނۂ-ނ.(1YAA5Y5QIQ5CbdbI6dC5u<uxRxRZoEoE}F}FU8UVmZxǂV[y0{!H{~^m8u!:%ff%B:~pJ1p^H1J|N|N99\5,H\]ÂGÂ]GJJʂLMLĂkĂkS͂SUU͂XXՂtՂ‚t\ԂM‚\ԂbzdłhǂbhiłdliplɂƂp˂z˂z{~~̂Ђɂ̂҂҂ӂӂ12߂'3߂{ς΂ ) ς΂5*ւ ق*ׂق,B ڂB'ڂ#'ȃ#ւȃH>>(/σ(σууӃ$Ӄ@@<T1uׂ5/AYATY;;]Q$T[mTnTgQgTm^rWZW^`T`j_  TNq+Nay2cay+c-n-m[2[e77e:k:!!kDO_rsD*Is*vIKʂJM44OOvKf??oXXDHDHNʃfNƂiRRTTW[ǃo[WǃabbЂ~~|k̓a̓ko|orփԃrփvvԃÃyƒyÃЃ׃Ѓ) ƃƃ" 1҃ )1҃Ӄ1,1]Ӄ61++#(„„#ރ)=ރ7=Ȅ7Ȅʄʄ̈́,"̈́τ6τCԄC1Ԅ_19.X1ۄ9ۄ;.߄;߄Z_rq`d`p1q1jXM1hO1e1chcpqMsIsOYAYAJ{Je${ L$Lgu~ug eluUUj2ju2f2|f | <~<i$&l&B@$i@B..ʃHKKu7789T9??[\\FFÄIÄIJJmQW˄omnW؄n؄˄؄vvv vvQ΄efel҄ф΄fф׃lmnnЄvЄvxxzބzӄɄ|ՄЄބĄ҄΄ՄɄ|ӄ   (!! ) )/ ׄ /ׄ+ׄ……+ąŅ(5(ȅ::0҅<ąd0><5>҅#ȅ'#օ"Cօ'"5C5,GG,^4^IS5Sa15@54[a[-hh-1ic@i}5cD\D\kt}tkKKwX  w  rq*r oYZYoZ*3{ud{d3y88$88΄8 w$uEpE/3/0~L34660~4y;;==>>CCF]FGKKɅQQׅɅЄmmL mZׅ˅ɅZ[\ĄxɄx\xx[˅dۅdɅhhjjlÅlÅnۅɅrڅnrvvz̅څzޅƅƅ]݅̅G Յ܅̆Ew xޅx5ŅXŅŅŅŅ݅''' '1Յ 1 ?††?:܅D:ɆD2:Ɇˆ2ˆ̆͆M͆M9 9Ԇ ԆՆP)P"PՆM݆)݆߆"߆B7^5WW`W5PgHq BP7P<`@<gu@uIeIJu^PJfSfp$L}q } ~~*y|*x|H`xmamLu#{#$%$%s+tqs+GɅGG'GGGtR66R99==>>CCEcyckdOOjR{φkRYY]؆؆Ά]҆Άw`d`dfƆfÆچƆ҆oÆچorrІȆwȆwFx||~~ņцņ  ӆӆІچن ц    ̆P̆`̆ŭq̆̆ن5'5(5܆'܆ކ:ȇ<Fކȇ<Fˇ(ˇч,,5:&5ч҇Ӈ҇&INIӇNڇ.ڇ7X܇܇7SV\V\5ZeZc.5[e[bcS_cbpc_S5_ZpAaAg  hm   nnm h+ami^c;^"q;"iq;??.qEEφE.t1t1JLJzLz8P>P>8jBGBGIIćkLƇOOjćkTƇTLYŇoYss\xxx5xcxmxƇ\LJއkއLJkƇmŇƇ·߇m·ԇׇwԇ߇wxׇ||݇ɇ݇ۇۇ͇ ևև  ͇ɇ #  $%̇̇ , ,!ƈXڇ @ƈLj! ˈLjˈ͈;͈ֈEE2&'e&2'ֈKNQN3N܈K܈Q))RF[Fg@@R3[c<=P=<;@ c0n 0nDgS@(DHAƇHZjaZV*_-pVgpMaSPa]j(`]-M*`i5_gi55q66q?%l?%lC)C--)1J1yȉJIUEUWWDDEHĈHJJnjMMNNȌQĈˆzʌψJXψXZ\mQxxx xzˆˆӈˆsӈsuuzňňz{Ոˆ{È؈#$ΈΈÈ ׈ و?%ۈՈ @NP ؈"Ȉ" Ȉ  Ј!Ј҈!҈ # ‰‰#ʼn=ʼn=$ȉʉ͉66F͉Ή҉Gʉ&&҉GIԉP(F'LOPԉ'Ag(?FOKCCZFΉ6?K8F>FZ8>kkFiFi<l<\FjFRh\jcf c R*Txqxjq*y1ˆ111iTfd  ##n++,,v/0/0U6|^|UӉWW։6^EEbbbljbMMQQSSTtӉTЉljwЉt]ՉՉ]wyy։cceeوiijjĉt̉׈̉ÉÉtˉwxĉۈ lj$xщщwˉ܉щ܉  ׉׉߉߉   ȉFȉȉȉȉȉIΉLΉ؉ $9$9؉;8Ċ;ĊŊŊɊɊˊˊ̊̊17@3Պ@713Պ֊֊FG4ييGK-ފKlފF1&h\\<&4_f_<P<P_HkHH=v=^dn_J f^kfmO[[Jmhv,Om\hl}5lo5>%go%'g'p>AAp..2266::<B<BDDFFGG;IMeMOOPPҊVWҊҊV[ÊҊxaӊҊabҊÊW[bƊӊƊŠŠmҊm݊ҊtҊtvvҊ݊ҊNJ݊ Ҋ ҊNJNҊ1Ҋ]Ҋ8܊ߊߊ܊     Ŋ 1ˊ4ˊ<ˊkˊmˊ$ $** -ي >3&Ƌ3Ƌ> ɋ-ɋ-&ˋ7J7ˋыыԋ0Jԋ؋/0؋&N+/K,+,v]SE]S1??LELeeXX\\8^HQ=^]k_kf}Q~_f~f]hf g ygRyo(ho(~5{j9{lfifffj5f!il9:!@:&&@))**,,uIҊIfII‹II7u7}UUT>}>@@TË‹DcËDcJËJċ‹‹NjQNjQpċ‹pnŋnYYҋҋŋ]]__ЋbЋbeϋϋeffʋjjl͋l͋ttʋȋȋ̋̋֋֋ۋ׋ۋ &7K׋ ՋՋ    $$""Ӌ%Ӌ  %++ًÌÌًƌ?ƌnjȌ?-oʌ44C#LBBӌ#ӌ،C8L=،H'[ߌ'ߌ([.[0R.(P1PRH[0nanm^ma\\ZHzz[KH I~ K[/~  `TT`/q[sI[^aq8s8##''(p*oE*-.oJE.-779}9{>{}>XX(_GGIIJMMNNTTˌˌXXYZYM\bŌaŌabٌČddٌggɌь-pɌprیr݌ttČyy{{|ՌՌ|̌݌֌یь֌݌ ܌ ܌̌݌+2),ʌ[ʌʌʌʌ1/53׌$$׌+č2čƍ)ƍɍ1Rɍʍύ31aZύEӍʍ/Ӎ4D4DWR0RۍWۍ8ލHލ6H8_O@<;]@,L]=}]j <;:QjQ0EK[6ES]_EL=?:EOE} Kw]u%w%p(uPSAs~UsU]~]v`vx9Bx"z"z`A+B+,,/n/07JMMˌM70h::ni@\\E\]\\\bČbьb݌bb@hiSSTZTZ܍Ǎccd܍fkǍfkdmsstvvwȍ~t~ȍ׍,׍5w  ߍ.....--. (Ž ŽÎĎߍÎ1 ʎ.ʎ12H?ώĎNώ2ӎKN.ӎK[َ?َORێ?.B.ێOr.B)*3)C.]D.GiPg.]3QiGQrC>DY>gYuzjUu j g^e ^ Pz4PyVhz,,yz{V4{4h"|g"$$%&nz|l**.z&n.zz33WuX%:;:WWXC;CDGDGƎIJKIJŎZm.mzm͎mƎmm͎KZ_www_wccd͎dƎ͎ڎqڎqttwΎΎwƎyzƎyݎݎǎ̎ЎƎ̎ǎiЎzݎގԎގԎ    Ȏ(ˎ ĎHĎȎˎ11'(Rَ(E6 *ˏEiL6ˏ̏͏̏L͏5!2ӏ!82ӏԏ֏8֏׏ڏT56ڏ׏))2ݏޏޏHTOԏ!\'-Oݏ-0PFQUeFHOg0O N9 A9A?POMr[j[M\gOlvN YNO ?O Yx|R+x+ /|/.W==((+~+.. 0$ŎJ5{5ސ;0;~cZʏdIIlmNʏdNPPTTVWϏՏVuϏՏut}؏`cߏ}c`؏ЏgЏgiijkkҏjяҏΏwwzߏz{{'ُяُ 62Orj L$  $#&#--&7%97 ŐŐCC DDːːΐLΐА9АQE:Ӑ4FӐEא4א&YFܐYܐXS %ߐߐX\:\/@f@v_d_/:6nbnR bO>l6dOH>lhqoo~ qh  ZUx''Zx{......~hpm ! p!$==)).rsGs./QJuN/uQGƐQJWWWW:WdWɐGGƐc̐NNOjRɐRv̐ΏjϐǐO|ϐѐʐ_ǐv_Ґdѐ|deِgeʐgԐoҐoqqsِsttՐڐ &%ڐՐ͐ې͐֐ؐ͐ې֐ؐݐ % Ő&&  FӐ2SӐ2' ‘‘(9 ސɑ( ɑf9L=0=MLYLHL%PLmLyLuLH0@J@JMYHS,SX;X3Ir7QLU 3 rPmL;,I7ymLQLyr$$͐$$%$u-x-vx1vw1w "f"$$%%''z**z--//f{36688:3{:=C=CDDHHcԐeőʑjʑcjSS }ёYtőˑő`ϑYˑ`ёő}cdđ̑fkϑőfđklmnqۑۑqrrvÑݐvxޑxyy|ߑ|ԑǑǑnNwÔ' Lő!ɑ,ӑ #ӑÑ,ޑ,#ȒcȒ,ߑ,GGYԑ,EGGG!Eؒؒے44+ےݒIݒEKG_)_),GVV E,E,h7hoBgEIE7oBogosipbKEVEbpZz]zZoos]Tu.woT}ou./~wa?j8(a}wt~o?to()*0*joD{o011){464996==@@BB’’G’GHMĒHÒ̑dfMNPْRn,nGnEnon’n’’Pْ’’Rْ’ՒÒ’ޒoɒɒޒoՒrrӒvӒvyw}}̒Ē’̒ʒǒʒǒВВ/  ", '. ./F"+ؒ,8aǓdǓI +2͓͓+F!D!D'ԓ73ؓٓړԓ#ؓ$#3ٓ8$57!5ړ:i:?C;CEE?VOVObKbadxxJIXXygU[W-LLQ%gySW%[S-YZ<Y\>4t]e\<ee>h=T,ss,--t44^N~_~;T>>?;Fh]^?F_HcJlcJHiilSXSXYYȓɓƓwwwӓwʓww}}ӓ}ӓkɓӓklғsғӓl̓ӓ̓ʓstvvzÓʓzȓӓtÓʓ ʓ ʓѓѓГՓߓ Փܓܓޓ Г##. Γ 2Ǔ.2$Γ28?ٓ;ړKٓ81Ô1< ǔǔ<ʔ7ʔ7͔̔̔=͔@єIє=AT*$T!B!+(ڔ+ڔB("Eߔ"ߔJQ@AUCD\0\^jCj^rbrZnZnIAGxG%wwuLy  [y%L[|~{V-e}/e}`/{m h Mo%m%((**+,3qh,qo3MRRP:+P:ƓYDDEEGGcLLlUUXXYtttߓt tՔ``ȔddfԔfhhiioҔoqٔqsӔsĔŔŔxyĔ{xޓԔՔyؔՔҔՔ֔ٔՔ{ӔՔؔ֔  $1    Ɣ$ ÔÔAÔ*ÔEÔƔ$1.14-ܔ-הݔ/7ה# /ܔ#22ݔ7Ǖ587ה40!D0744Ǖ4C48bZ95!ߕ[xߕ[9"r40ubU4QQH|n"74b;n<~VHFt`Flul Fgmg  ^ VV|\''|w}w^tce!eb!$t$==**+p~.+p4.L4v7v7::;>;>ՔYYY.YCDDHIȔ`MMhHЕITTUVrrЕrVd{dgʕgiikkʕoorΕrەttΕוzוz{{~ܕ~ޕĕޕؕؕەܕەەڕڕ Õ # Õ#ݕɕɕ--ѕ&ѕ5&5ݕŖ' 0 n ʖ'ʖ08N;t~?<8J((Ŗ?J1???1N?uLhLhm͘??n \ } ?)?\q\vqpqvxcxOymym} p%X X}%$bqbYj4jeeq <u<A usA(q(CsqKwwq1K5PP1UUەUĕU5@@FFHHdÖccΖÖ̖l̖PP–o–lWΖWÖt\\`іÖ|Ж`|ЖĖddeіhҖݖlҖƖÖlehƖԖݖqԖqߖݖtߖtȖȖǖ~~ۖǖӖ֖֖ۖӖՖזږږݖՖ! ŖqŖŖÖŖݖŖŖ  ,' 'ٖٖؖ)ؖŗ)ŗȗEE>ȗ+>ʗ6>͗+͗:>424Q>/C֗/C֗ؗ6ؗٗQ[>N>f>ٗ:R?R?8>[NO]<f8]c>>>bUb>Yc>>ʗEGJrpJGXp X S##OOrwSw**^igi959""9^r&&@**sv,DD,s1144T|VЗ|TV>V>Ė\HHIdOOkkUϗҗϗUWėWėuЗxu^xb^effpIbeprҗrsƗsזǗ}}Ǘӗڗ!,ӗ ї  > !8!! !ї ɗ  ɗ!2͗!  3՗ ՗55$8ۗ$Ę'Ę'ۗݗݗʘA!ʘ̘͘<(̘A8(PURPJ))ߘXRߘJX0N0NYGY99GZ[<@Z @[h< hG77ikSkgFEFKEuqKgx qL gjxjv*t{tx  ""$n$'x')**,-.II,vyzvy-z.{<<??BBEEFIIbLLŘFnPŘǘTTUPƗrUrǘ^Ƙ^__ȘbӘbǘe՘e՘ƘǘkȘǘkڗӘǘݘssݘuuΘyy{{|ҘҘ֘֘טИ ИИИؘטؘ Θ3|ʘ1˘͘G͘S͘ژ/!#.1˘/ƙI2!ژ4̡ƙ#== 4ʣҙAҙUՙ7ՙMSڙ9iڙۙVA=9&(22(+8+u 3Lx7={V=ۙ8g jgj3=cvc=zxv=>}z>}a%iGaR%R0Gy)))ǘ)))iw0w:f:f!;;!&&CC0022355773~9~?C?C`9`HHOOhSSUřUVZәhVșZ]]ݙaݙa||e֙e˙͙șәřu˙И= ϙ֙uwϙwǙЙЙ̙ΙΙ    P46$1љ1љ&ՙ4Ú- י-ÚĚי6%,%8AΚAΚКК8Ӛ#Ӛ>K֚>֚NRNTXۚTۚXޚYޚߚx\`ߚ\^*,:`\Ě6#,W@^: W__PP [=B[FjbBQjFjYRbrxrxQ  n   fcjoqzqozq cgnj9#gq#D~fj~q)s)EsDvEq..Hv{6{6889z;;9??ZZ͙ZdIJIdJǚTǚTUVVȚXU[[Ǚw__`aךɚƚX`ɚךa՚њ͚̙͚њŚȚuŚךuwwښ՚ךךښʚؚʚؚҚ,KR`@$ šҚ ' š ''ٚ Û$ٚÛěƛBƛǛ˛A*ě˛ǛЛ'ЛћқԛGԛћ%POPٛ=jqךқ%ٛOR'b bdNRR$bNbBbb\tQAbDssDb%bGbbz ]db\b ]Sd ( SZ,,YtbZ(]Qbzb9Y99{$${''|+|+-l-//4Jx4Wx88::?W^?cABA^Bƚ_cLLMMOQQRl\ś\]O]``}›}ițijklmțrjrtt›ڛݛzݛz{ޛ%i{ڛl̛mʛޛ̛ʛڛ  % ڛbJkqɛ ϛTuɛhx.ϛv.y%n.œ6 ߛ6CCߛɜ9 ɜD̜Ϝ9̜DϜ5EҜ5ҜӜPS&EӜPڜ&ڜۜ(G,Wۜ7W,(œ%bGb)J)0o2T67EoquhJs_shh^N ^ pN    UYYpxy#n#&&)v)++,|,ܜ244 }śOUA2|XA'HHULʜLMRYʜǜRTT@WXY9W{hǜǜhjjܜnnooԜ֜֜wwx{{x~~ޜМޜݜݜќќ֜֜ ÜƜ œEœGœ0œÜƜ'(SҜ:1ٜ:5ٜ<<5Ý?658*8Ý6?ΝΝ$;ND$ӝNӝDU2OٝOٝ  7ݝޝޝM@_e3e37 ` `> Sr B9`=S>BraݝUE[aP[EIl"IQ}QZM}"#.i  i}++ǜ++.VZVuCuk\k  ##$$|qAF*6\CvFKzv|*zKy677==??AABBĝƝGcĝcGƝTfȝȝfjԜj֜jМjTUWW֝Z֝Ztt]t]םUǝgםgmnn՝mǝʝyyz{՝{ʝߝߝ۝۝ ؝(z1*;%%) ɝ) %%0ɝ%0%؝%Ȟ%͞%ݞ% 4Þ4ÞĞ%Ğž%5 ʞ5ʞ%D;N;ўNў=PlZٞOٞ۞3۞&-ޞ&ޞ8^8OD<@JdJ2@:`2Y`Yd:3DCe>VCYEPeYQ~EbP q y   b<^>YQrh..cXVYrXaha9ck9jkFjp$$&)B)B.s&./pF11|/R7|R7>W>[@[[EE@ŞǞfǞfOOimmmmmWYȞYZi\Z͞W\͞`abaݞ}}}jjܞmܞmnnžɞŞƞvɞv̞~}}~ƞߞߞΞ`͞bݞ̞Ξ( '""# ĞDĞ^ĞYĞPĞĞ˞#3%˞ϞϞ*=%(+R5,-۞Ÿ2ş'şɟ3VJɟʟ͟=ʟ*͟ϟ+ϟFF4?Pԟ?ԟ՟P՟RŸ(ڟ5ڟ۟۟,ߟ2ߟVJcdS9~cKiSK9go:6:k[][poigi6ifiQNhQV Nhpks& q./.|A_|i]8fs8_ll;>sŞ>;iA,,.I121H4TUqTUǟAACEEFFHßeeNrßCNRSSRџ֟YY֟ܟr]x]ܟҟxݟҟbcgǟbݟcgiğll ٟHٟΟ؟wiğ{{ğğ؟w'  <@'4ϟ557;7<ààŠ@Š!:=ɠ!ɠ%0 I:d%РIDMӠӠDՠ&MР VMk]ՠ&>Q>UQU^MLM&88TMn?nMdkd^WMmMVoMMyMM|ML ppj  "" u*Zum*WZ44M444 4eBq#q#%o%'B'++HџHH2H25yJ5669|9::@@DDEGGHHLǠLiΟiEȠƠʠSˠSƠXXrˠ͠ҠҠra͠ JabԠ۠eԠeǠȠjbjkkmoopm ssvpvwwĠy{}{Πy̠}Ġ̠    Πݠ;   Ϡ*٠=Š0Š  ݠ*ϠáQՠTՠ?ՠkՠ٠ áơ33 ơɡ""ɡʡ̡͡͡$;AСʡС;ԡԡ$סUסMNڡMڡ<C<YNRORCY7ZA_]]7l_iljiPnP\FQeQq\UAr~TITxur fxf[ & %WWVVg01d0dg1 !t=!='')z)|EȠE-tʠE181 -|8:<=>A:ACCD<z۠bġ=DTġ>TȡΡȡ[֡ϡ[֡ۡ]]cc{{ϡǡΡmmۡǡv vܡܡѡ١ѡ١ݡҡӡݡߡӡߡơء(ơ(̡A̡N̡Z̡  . ޡ;030Oڡء ..3ޡ̢?̢΢ ΢+ +6آ6;.nآqF?.I~ߢIߢR5N_NId_.u[`Rd4W   . d q 5dnqn`nZG"Ze4deFPF"iYPqaq$i}$q})))aXX`d9{f9{f##&q&(~(,q~q,qq13341MMV^V??C]C^FFIIgĢjȢĢgSȢjSˢrŢŢsˢrs\\բwբwaעʢaעɢʢҡӢϢmӢmnqɢqߡââܢʢzzϢʢܢ͢nעТ͢Т  Ƣ¢!¢!Ƣ+'Ң΢Ѣ5.'ѢڢԢ0Ң0-.Ԣ-ڢ58 ݢ8ɣDݢDɣʣG=9G/MMA/)*)֣=أ٣֣*6 ٣92$أ6ߣ[H[AG YdY7^ߣ2g^t^YB^gd _jo: 7t_o:U^|^P^v"BZ^k^vxU |x"  P   Zhf;hf,<k]44ʢ4+44l~ ]<;E~i l((+irE+r.u.u22LL}L}Q9Q9??BBD`HD`NHṆp£ṣR£Rpqpۣsͣ{ͣ{ңdңdiۣƣimmoƣoѣףrѣrttwwy|Σyˣ|ˣܣΣԣ ԣ!!ʣ^ʣʣʣʣʣ#)'!#@!%$٣ä*H٣!ä=5Ƥ=Ƥɤ&ɤ̤::C̤Τ'ΤФ@ФѤ$Gڤ3Ѥ>$3>j*%ڤۤܤۤSߤ<ߤWWA/Y/-,ܤ-F040<,F4\c\ 7SGIaxzVGTx7cqI Vq}pGhGS  S{~O`O {.hpTz*n##%%E??)u+s-uEsss2s66):=:=>+>CD-CDLLNNOͤϤ2OͤĤVVX֤XףoZ\Ť\^ˤ^ŤˤcؤceehihiZ֤ݤܣpǤtpݤtw֤Ĥwx!¤GؤJkMB]`rs)%5&C{xԤ&ƥ,$,#,$8:$Ԥ<,ۤ<AۤYۤťƥ"̥"ť1@̥10caz}ԥ֥E֥٥;٥ۥ3ۥ3'//'J?5K?KQj88jk~ ` ԥ1  WGkWBE@Mq[q[s~{{ n%   Y*]m*v*Ym_vo`_r6oa!!==%&))*%-{-*s00LĤLLL5&ϤN99;;AͥACCbFbF5ffǥiǤiUǥUץǥYY[ץ[~¤xxxxǥ&x~ffڥǥjڥjlĥloopspstĥǥtݥǥݥǥ}ܥ}ӥ˥ܥӥޥեޥߥե˥ @ƥ;ƥƥͥߥ  6.6¦¦æ"æʦ"5QʦͦJJBͦ.ЦЦѦ,7Ѧ#17ۦ1ۦܦݦGܦ$ݦ8W\W>T>TN/NEa:EGQQuaIaVaGuuInaVna^  Pm P ^aia^~9ǥ99999&((&iq,D1,q~14D99:??4BŦD:DŦGϦrKGԦlB!rĦr`KĦz`Ǧzb5bȦ2ȦǦXjϦjFɦaoɦo\ttvvwyy{˦Ԧ{˦wΦԦަ  Φ !¦B¦¦ %--'.3.5</<# ħħ\ݦC ɧCɧҧ$/amҧ$ק25קا٧ۧXۧ [ާ ާ8>@A)0ا2>٧2F80kfkA@fa57;7\HEEHSlS~~~̧~~l W RnWRͧ~q]~qݧ~)[Ƨ~~$˧~~:ӧ~~~$~/BB!~(~3~*~/22JMJ~=T~]~=@@MBCFFGGBCiijSjSUX̧XZZ[U§§c[cԧ}}էԧllէoͧoprʧrʧpvݧvwަwƧ||} }˧ϧ ӧЧЧ %3ܧܧ'/# ç##ç,0,055!( [ۧè*è@ۧ183ɨ1ɨʨ<*&6<ʨ6ѨOѨ9&Ԩ9Ԩ֨֨ڨPP:ڨݨT;ݨߨHߨH%_R_>>E+-I+O<] nn Y eYea]IEin{a{J{i{{kLkJ{ V  h V~WW\{q"q"Ǩ{$%$xBB{{2\x%s8{2J{5u56h<Y{~6<@X§X@BFBFGGMuMOǨOPsPUXXpZZU`بۨ`רbhΨϧ}bبררhǨmŨmŨ ttШwШwxΨר~רx¨~̨Ө¨רӨ̨ ٨٨ &8è  &. :֨ %ݨRݨEݨ-ݨɩɩ̩44=̩ΩΩЩNЩѩөKө7K7֩שةѩ֩ةI#'ީ#ީ[/=Lש))/[WI/N=88agaJ>_>?Y?cu{uqpV!!qvV  v {{n{{{{n n{ {$$oi'o' ++,-.{G12,OרOOO O.>1>-AAۨXdGG2deʩeʩQQTTUWWکxaabfҩbfhhک˩˩mmoopr۩ruݩpuxyxyܩթթͩ .  ߩ۩ ݩ  =7/'W"!"ܩ թ ߩ 0  03 6 ٩V <<٩B ªêê348Z Ȫʪ?ʪȪ4̪̪HH?ЪLҪªҪժժ//5۪6g۪ܪЪ3ު_cVP@Y7@PYBZ7ܪ6pInI_:ު6kljlj_nz]S\c:ncq*Si$$knzn{q\(]ns*^9{=`Xi^s`t(cvvqt9Xwiqw=>C*C*|}D..2D|23377[}U UnUqUUUW[ҩbLLMPP~ŪSѪͪԪѪ^Ū^_˪bbc_~˪~ciiͩ!pͪprԪrtty֪֪yǪ~~ǪϪΪ Ϫ68' Ӫɪ48êêê!EI=Nɪ+LЪ5ЪӪ68'««ëū4ūƫȫ!ȫ˫Eƫ4˫̫̫ͫEЫIЫԫ=8ëԫ֫=֫׫?׫N۫?۫ͫE+[R['RgaXaX]adaqag]dq9Q9;OOa;aJaJzaaa"zske$sqe$k"/.afaq/  !##!fh)h)+n+/}nq/112}42vMSSaSSɫSS@4@vFFHHIǫɫҫLIǫΫɫWѫjlΫɫjҫlWѫLZ|֪tZwϫwϫɫګ|ɫӫګgΪgӫɫttuu{ɫիɫ٫ɫ{|}ݫɫɫޫɫ}|իݫܫɫի٫ޫܫثث*ī%""īʫ%*߫-ʫ5׫5,055h5Ȭ,-߫Ȭˬ5ˬJ5Ӭ55ӬXJ$9֬֬$X'5[5Q]]6r5`7'765^G֮5^3550QY Q[ :[:nnG;acfa~`J3Jco;GNo# N   hThj\j~i_v_~#v#i~''((,,//030w377<<==AACCKwKLOLOPTPTYYͬԬxͬڬ`ڬ`x|ee¬ghg¬۬mmĬĬsάsìxάìxݬz~Ѭzݬ~ƬѬŬެŬެϬجج۬[$&0JǬ$G~ϬǬ$& 1 Ҭ 9ӬҬ )1׬4!!׬í41H1íŭ*ŭ"ܬʭ)*"ʭ;-Э;21-Эܬ ӭӭY+1׭H׭ح٭ڭح2+DޭM1v1.DR11fQSڭMS٭.Q1NXNj111T :8ޭM:\ ??iuu{v[Uq  q% b%R Uw^w,vj""bq&&A))*AV2*2v99|ZVTԬTZCCFFGJJe۬hhŬhGhVVWW[[xbǭbƬ~eeȭhhllnnoqqwǭowxx̭~̭~ݭ1ݭۭͭͭ߭խ֭֭߭,,%  -  !3:-%8ޭ:5! Xޭ{ޭ63ˮ03ˮͮKͮ/3M7ЮѮ5ЮMѮ׮6׮خٮ#3Z3ٮ0i/خ6#H[K5Zm_H17 Zm_ ^ N3NPrPj8jrEDEddDItI`  L ] ggyLt.kYY.8\ky"a;\8|9ff;<"auu<&|&sBABAs`t002v2]tz5}Q}|Q5zXAXABCcvciȭeȮɮOȮOɮipƮӮƮҮ{ӮpWWY[wwwۭwBYޮۮ{eޮegghhlʮҮlmCʮmܮ"rssvϮխۮϮ߮ۮήή߮v̮̮Ԯ%3rԮڮ  57 ծ  '' ( ծ֮9..ݮ1˯;ݮ˯;D@E@ϯ:ϯD?֯֯:47ۯ4ۯܯܯ)DtyҮ?(a)7MNMPNPaai^i)aakIa#jLK_aLIakGjwna`aaM SK# ZuaaaaaaZaDaSw2jaZwQaXan""%%&w&u**++oHHwuw5w56ow6<<=??@ۮ[[ܮ[=@¯KKïOQQtOUWƯWr߮rr rtUe¯egllƯqڮquguwįwxȯxȯɯɯį(߯E߯9'' /00,77֯,°8° ' Bǰ ǰɰɰ4>4-BN>^(ӰӰ(ڰ187ڰ\ZGw\R//'-BASCS1BDSAMbMRZiFiCss[n|h|D|y~ yr  r }^  }^)+XXtjzztj##%%+EkGkE+..GIJïKJT;T;>CC>_HHIKddKUW˰Wn˰^հv{^հ`Uv{ҰΰݰΰiҰikݰkϰp۰İ۰tİtuwpw'7BZSްް ðð   !!//$2±7A2)װװ$7)±ññADƱƱȱɱF2"2ɱFϱ"ϱ&Bѱӱ4ӱԱ9ѱ&bȱAF E=9<߱=߱Ա L[h~V<E0R0Jm5VJRa4BLEa:r:mT[[Tro]'oMsbbMXs'hXvhYvfx?g{")x?"{>)yNGyzzGIIIN889|9~?~?AZfDAıΰ`KKOOjQUϰk˱UWWX_uuuu_αbb˱eegձgͱpDZDZpsͱstݱtбxxyر̱ʱαy̱ر2BEձαֱֱܱܱб      űDñұű 0.ٱ, ұ-۱-ٱ0ױ<۱ <òDz2ò Dzɲ4ɲ˲>˲̲̲:ϲFϲݲ..3:|,24>ݲ[5ױ[[[;[=[C[']]cEc]/[^l3[=[^Y@C[[;w[[lg$[GG   Y[V[C[V[:F['E@;&wY&~+~+ıD-.-0 w346688˱Q.XαXXݱXXXFFaa0ʲƲhʲOƲhOѲQU޲U3WXQZ4]Ѳ]^^c޲ʱxWcfXf۲Zn۲noouuww{  {||Ҳ߲Ӳ߲ٲٲҲҲԲԲ   9V~#  /,#3ϲ%%9  9>9"˳">9˳'Kͳγͳ'γHH9(9ӳճ(ճ9ٳٳ۳L۳1ݳݳMM1TL9T9ӳH\V,/\?::@?VidiLGDGVDP[~vbv~[V  mN b x)mPVY)ggY}}b~ee  h";="h))Cx~../22344y::<<=??AACkjljklUp³³pѳ׳ѳU^^`׳`ѳccfѳfӲijjjnֳnppq޳سܳuѳwóֳóܳ޳uسѳ/wdzȳȳԳdzѳڳѳڳq ƳųK&&&&Ƴų & 5&6 &߳#;6߳ǴǴ&;5;'@Դ'Դdִ;ٴHٴY+ܴYܴ7Qߴ7ߴ@@D-X-\E[[IkKIH5N kIִ;\QKlMlmNBmPEQrBr P v$vtto}/oy33gzg!}!>sii>='CѳC&C5CQCICOyJ22'sJ|55|O|xyV??BBC]aPijff]aP˴S˴Sδ´VδVXƴXZմZ_{״״ڴ_``۴ڴ{ش۴ѴشjjѴƴouݴԳoݴuwwɴɴ޴~~մȴҴҴӴӴ  ô#(ô ,, ȴ6#6- +ٴ(( ĵ-DߴXߴ((=( ĵ(е=ѵ(еѵյG:(J(յGLصFصMNܵKܵq(ߵ+ߵ.a(HEHi(cEcIeIllWW TzxFL TvyKLTevxdx+La{.L{ a )OY)}Y}7n"[;[hi77Oyih;"r>r>?CCCCCCn88´S:;;>Z>^`^õIõIJMMOO͵T͵TVVqȵqǵ޴u]ǵ]^ȵ^abӵbӵggiƵmmqqsٵsٵڵ޵{ڵ{ɵɵݵ  ׵׵Ŷ ƶ8#   ĵŵ  ŵ ʵ -ʵ-LѵEѵeѵyѵѵ<1<=*Ķ=ĶŶƶ?B1ʶʶж?ж!AӶ!ӶԶԶ׶׶U5SS577.A.AUAK@3@&d3{&eekKAnkADAZAdADlFLnCFlhANW$x$  ccouoyZ/dy4v/v}4}!::!:#Nh&&*r*#E-EJJJr5=O-W=@@AxAfaIIapfƵiɶTT\ɶpq޵qqqݵq\˶۶5a˶accdjضض߶¶߶d¶jklͶ߶klͶǶttuu̶xζǶ߶x̶ζ߶۶϶ ݶ۶ ݶ  1%*϶ƶAƶƶƶ۶ƶƶBʶ 383 8??ܶܶ74G4ηGηϷҷ7%ҷ96C9Ϸ"ڷ<ڷY>DLDhu<"Y>J:Jc:m2y222m22HpBemHBmenpOnm O[[qq $yP$|P | VVbzf5 5f~5 !"{o%C"vr)*oC--)v*sK34bK3Q!%@@]4Gɷ]Gc߶cccccȷȷȷȷ߷ȷɷȷ޷ȷȷ ȷAȷ[[Q?ȷ^Bȷ]'ȷ̷ܷ^iܷ,ȷ.ȷYȷZȷi\ȷӷ]ȷԷӷoroԷrtȷ|ȷ~ȷxȷ{ȷŸȷȷ|ȷ߸ȷȷȷ ȷ߷%3  ޷ &Ƿ ÷#÷ $#Ƿ$ͷ/ ͷ /6ҷ۷ ;;+۷øĸĸA&?ø˸ոB˸ 2ȷ Ż ո(ظ0ظٸ۸V۸'ٸ,.YN0(ND1:D2ZV1:2l5l\R9Rz~{IHIOEOyjyY6]a ]   Qr%7z]zs-k`k#ta67b#$%&$p>p&~,,2%>~vJv2PxJ~P7T{_ST7S_G̷^cJcŸLOʸOmGmUWWr[[ʸJU}}d߸dhhijj̸ܸܸmnoottvvLŸݸ~i߸~Ƹm߸ڸѸ ޸ƸڸѸ޸n߸!ȸ+54.kHb|zȸ!656'ʹȹ4Թ5ȹɹɹ4͹11+-5ӹ+ӹ:R:-9H͹4Ej;8;8ZRZ=>AB>=A.TlTkl HX@XQ @ b`be_eKK|uuY ^^}b crc\zw9|9##$|**++-//3-L355LS8S>S>?$8E?EHHJJQdpʹ̸iιQRS˹oSιpy˹_iݸvy_aadϹdgݹݹйgriٹ̹lٹl׹qRʹsqrsuww|ùù|uԹѹҹعѹҹع   ! 9 6 " C (   1 L '!G T {  o  ĺ  ͹R͹B͹ !%,%ֹ=ֹ Ժ ̺ &=ƺ9&ƺʺ6  ʺ˺ ϺC˺"Ϻк'KҺӺ ӺMҺ(MAк'1AF<<FIINN_:UU:LGY}\ TcP cPTr;GXw;Dn}BLn pp  $Yk.{ Y~t~k)T)TBX{t.`4x`44xb"b"$??+$?4{+-o-11O55O:˹S:ϹSWйSWZZDDFeĺIIKFemK̹im׹iVVWWs\\]]ԺںǺaںabb̺ffhhj޺j޺ͺغۺۺqغqպvպvzz{||׺׺ߺ# *8AQߺ@M gwtimº ,   { º!'κ#%%(KϺ(κѺ .Ѻ.'!»»Ļ)Ļ)/Ȼ*Ȼ̻̻ͻͻJ>,һ>Jһ?Gջ?ջ8Lٻ;ٻ;LCܻX8D}PCܻPATXTcUUcQZYZ@MYg[^w[t_B_ixdklkl xi es0e--0m4n`!!y}Ey$N(,oE(,po4n$p5N599::>>BCWBCDǺ]λŻGŻbrûŻϻŻԻŻͺhTGλDhTUUûr˻ŻŻ\ϻ\Ż_Ի_` ŻŻ Żۻۻ`Ի/ŻŻŻ0ŻƻŻAŻEŻsƻs˻{׻׻aŻmŻ{||OŻ~ŻӻӻŻѻлѻֻ !߻߻  ǻ/»   Ȼǻ,ȻGȻ. / 7ػػ¼¼7ݻ޻ݻ0ɼ8ɼ˼˼޻ͼͼHϼH1F48ԼQ?ϼԼFڼQڼ;^޼N޼N;X1BX#LI#LIAds2<2aE]m]JKM`}am ~JK  m%mOM%+c+ttac6wf6559wf@ ~l@l}@0-~-.}0.~577i8@Ҽ5+~׼@YYDDüǼ`IǼIJhüJʼhʼQkQXмkXuӼ]ּuּ]ҼҼۼۼܼf|fѼhлֻhѼnռntܼt׼vvxټռټxȼȼ.Ӽмؼ !2W߼ؼ    μ!G=a1˼4˼)μ?˼imy,)߼ ݼ, 4 н2ӽ4ݼ11ϽϽ<#ؽK2K#ؽ/C/ܽC߽ܽ++/߽WU:U6ZY623`\Y3`G=pgpa\AigAM|iR|RuuWq[q[$m^$_^j**_b(**(00b8888ľ8p8*mj@@++,JмJ3,3NyONOw99wc??deBC½kĽHHcd˽ɽeBCĽ̽lĽT˽T½kɽls̽ʽsZͽʽZͽx xxxxҽdd}}ƽiƽiٽnnٽνнtýtҽýǽǽѽȽԽԽȽѽӽս ڽս ޽޽&.DŽֽ۽I 1Ž׽&1!ֽ¾!׽¾ ۽7 7._:Z ;#L#ԾLԾ;<Sؾؾ<SMDQ%QAAE%EYFYF gIGugGI4 ff4kkuJcKjKcJPNPm"_mO]NM]"o$eoe$O[/V[V/0v0v~55`l~  l>r>@@CҽCνCr`..11Rz55zRyW>W>XCXCƾľþľbƾbLþLӾľվľ۾ľS&ľSpѾ[ɾǾqqѾpɾǾ[w__xӾȾxcdwľ޾cȾ ľoҾҾoϾϾپо ľоzڽ'ľz~~dӾ˾Aľ˾վӾ۾־׾ ׾   ̾&̾ξξξ%ھ !ھ߾%!8;8߾ ?;˿˿?п'пҿ6ҿ6)O)GٿٿGT߿DD""߿=9j*=MTO*Q44M Ab mbmWV9OWVlpljn#j||EN{(ew{qE#+}QO}RR((((w+01s0usy1ur!r!Nn@@((ep,,Kx@{KKL7x78/8:?%?@;CCEEGG޾dپdMMOƿQOyϿQVǿXNVX ϿǿyݿݿͿ־Ϳ׾zzF{տ׿տ޿ѿѿ޿οڿοοڿӿӿ     ֿ# Կ#пOпMпԿ-ֿ0-0212D43 3.T;.;BP"D41-NSN4n959[W[Wq4TP``YU"BUYtYtFquFRppv$||v b brr$uqZii/c//cZgg#:#Rq%@@@@,,o2sHHs2\]}6}ƿO6~;==@@AAH\~]HIMIMNQQmmVyVwwy׿{eeοYqrruuww~~     &3P< B4f: **&++S$1$153''B-B-PF<4.. O0aO50_cfc_7:/3dg4/7dYiniYn[sR"JPys j[iR" UJi%yi%So,Stjib?oz;;;;DlUz?/D-l-t/2b2NNiNNNNQo;==??;ABDAPPRRTTYYqq_B_`Dii`ooqttvqxv||x   ) ++!)66F5%"%" 55a848#4Q4#g)&$Q!'$&,',(700CgEgZMZ(474\E ssS:j:nOjn\McM} b  pz d0!!#r#$z($y(cDbDer5u5duJyzAABJBJKLMKULUWWYY]]__ccddffmmppqqwwxxz{z}{!4C. .8"8" @@06)6C<C)&MS&<T%X=,OX'O0O,i1%T1iaaVZZ>bb>uru`rsrnrr`QQ#shS =T/h~rtr vrn\/v\9t~y9!!%j|r%&y(+r+,r&|IIMMMMM~=(,=??WBC]^]OfBCOTTWWYYZ^^^Z}}}0}<}T}mmprprwzwz{~{~ $$  ))1-'2112//18H*K;*81J;V>r$H1D1JD`i1`[3[3V[SVl_PvdEdqfql[|_[\\j! P[cscv[ kinn,kbab |f ?xtu+,-+t-12,21T==>Y]x]EEGGe>eKQKQTTYprYZZ]^_zz]_^kkmmqqssuuvyvy}} 1-  A`&&z&8&&.&&K8.$[EfO:/S$&/O&:&WU;UJI6I464cXfflFsWSc6X6auAaga\\gi[i[JSPM` P w{Flw,,,zedeh$h$n(n().x).HH445QQQQQ5??AAFFGGIJIMJQMQRktVRtV_vt_vcceeoopqttq||}}&S6lg       "B #"#;%B%11*C>C*K/S'/6E&'\E6D9 29DM{2h1KSSs SNsN&S`HlZlH+XdxXx{x\STO`hTr+urZh,,u{ d"#v &Aw#~"w~11M55&7;v;==>^[[^FFIIJcOO7RRJTUpUppptb>Tbeejjllqquu{{}~ Shx~}     /2>/8 8!0!  %%0$ECE*C!*C3C3BKH?'9HOK(9'BC?B-\:-^nKC^(C:CGG@fmfCmCPd)_d _P&h&t)t``hr7$yyo$rp|Lp(Do(|DDM0vvL0M99;;<<@@YYEEFHHIINFNOjjjTOWWXYT\X__`Y\`~kkmmoqqo~~X  2 C$%%  2%.1.)%2717:  : -\G% @n3)3U%GU?L?L,%,d%ddVfVgfhfgG=b=44Zbh>f>pQfQpfMfM"s"U[s &n&cn [c/fa]/6]6a{{ A}#}{#uui+iA+--//0{xyy5x566RR;;?AACCEE JJKLKP?PkLXXYY[[^^zddeff%f{vv %-%.  .77D797BBIMID(79Z(282G]QSSQ]>`Z` T1,<T<, N1NZbbFG7\\:ZZZFWx>QWyhyh!HZV! uV u &wa&Zrogw_Hxy000000=rga@O'~=~@'(**(p.p./0/{37O3{7::<<>>HHQe7eZeeeeQTT0WWZZ\z\z||eeggoppozz||  1M ++81 ?BQ?==$J$;!:x_oSCSXUX@=@CYYCf;=4i4hDMsM!=hifCV^{^t~tDi}N%}N[%yNNNq*-*Vi[q-y9<<(<Er(9*r--xEK*Kvv9x9;;WBDWBD_G_kGMMOOkVVWXX__ddppssvv{{~~W=Ci{ !FE#J SBT'Jj'!i"" :> : > U?=?=EFHFHsL#LJ8P8]QQ]g<~N FJbbI cg< RtReaaeu|$uESCCKcIfYK$Nnfn&N&T)jw),`wZ,`Zm44!!;iq;)qB)j,,r.[.5x57x7::==XX[^^GKKGNhhNRoRoZ\\Z``ggllnnqquwuw||~~         + /++ > +((H 4+>; 4  E PIt|?a ?8$8F$FH<J;<J3L*H903*9;Yo0do d@ hEah@xAxHvmLJvzIy!ziQivr,UUrap&(+r&p+(0011P{P778{8==>>\CC\GIIqJGLLNPPQlkkqQZsswZmnNmnoorssr}}/   2  3 3439:@3 53943M3c3<3w3@~3K3?5A?5[33R3 MAA5D D3h3U'U MIyQ3c33c33' cBt<viBivw~X!OX!K O  [ Ruz+z--6u\1\6x8!x!#h#jk>Ej''qEqJ3JJJJ8JQ99TT{??^DD^``KLLOOKnyXXr\\]y]eeh{hmmppsst~~t2:&$; C@PMc&$;1 51 5  | [I(I8"8kC),"$+,t@)Pf=C+=f<-<-M`g `NjA YbNAYqBPcjAqBzd*zk#}####}SS*|0Z^0^22[i7c7>ki>''FrFE-rE-16L16x9x9:TT:BB]__HMHMollmott^t^__cdggjdjcnnqssuuvv~~q    !   (!""#8;8 8#<8"; #<=8==8 / gbF@>@SUSe(A(a(C(fIfdF/KIffelfKZAaaAfwCJwJff $m m2frf&f||.f/f\e68fSfufe`fcfp?t?r)\p-t$)PMxPOOx;T;TDDGGHHKKPPQQSUUWSv-__``eeggkkmmooWvvyyz{z{          ,/>,$<<.7U(L.L&&L$7L#TX?#LXL?'VTL'3b://a@r8[8[uO3VlOlEEw\JfbVf%J:VM@V}%M}j(]hi(rVhi\wuV0t|0c|jw]wp4p4c""=tw=~wAA,,A~//w88Y==??Y^^D_D__KKOOPPqxq[xd[dkk:lmms }}s    ''''6;9;G)VwG)''BQFQa 6'B96NTN3@]@]RYb'bR45465 h3Tn 7nh5e7epbWpWWAvAp~~  o%optpr(cp(Wqrqt:c8"u:%o"up<wpp?,,..<wH|tH8|O8::==>??>CC``LLMMl'lpllllYY]]^^b{b{hhnorrynyzzo-9F    **5 5 5Q5N5TYc5I5|5!{5  2!2E%E% QQJ#H0HJ#0f5vKag5KNcSi55SGPePeI|{tBBtfpdp}dqqu+u+g~ki7~7f:s@@,*C,*0066UUY@A@\\HHKKjjVAwVxYwxzbbceeYcjmmnnqqzj5Itz    "!  " $$+&&->-/.+.1/1   =BBa >3 E3G4)EI+4[C:C:'(__(M}LG[IGJCIMILIrtrGIkFs#`JIWiW PFI i#sa^`tafd|28d5f|56yg6y8%g%&Pt))}-}-./22st55778SSSS@@ADDAlKkKkjlVVYYuu__`abcdbakkloolxx!d+ # =# '" "'  +)+3003  'E 1EJ1 C6EUE6U?EZE*EqE?LERE{EEZ?*~EEEfeEfGG4^qCJ4LmOmERE{ {    &&,ss,/~nn:##$t$(t(++-.-0 { { {66=:.=??[CD[F`cccEcccdCDVFVZ}0Zu__ubb}nmmnqqssuuxxyy}}   !, " ")JK;<!.1&K!J&JBJIJeBLJ;ILsV,5,JGO*G*<e<1g15J277o^tltEEp>wz>p2ewvN{{$$W~WY^eYzprrcc  !f@fH&?@&|D,|HNpOKOQQ::;r<AZZACDDCIILLMMPRRPYnYZcZxxxxcdgdgllnqqwwyz{yz{nJep)   $$%% "# 4"'=>@=(4#> *5-g'# %5B%o*@l7v-BHWHJWJN)E)WNW~7B[`[QEWtt?afaehh+Ge! }}i   mQ`m\i+|.oo|~k <<<<< < k\FpF/p/G1KK55S::;SBB__j_LLrgjTTUVrsU]``]bddfiijjmnnsszz~bf~m%W  #( @)^QBX x 446  6CC7"E#EM=`0=?0f(#"7(%%X>W>NN<O?OgY?Y3egerhM7rPXWFGFhDG~Jl lHSJSck c u)x)wuwpxo\{\qp@;A;qA@++}.}.vKK4455Z::>V>Z^^E]EbJJfPPQmm mmmmX[[^^aa|~|jjoottuux~~    7W  <        ((7 6 6     'NBN31D1//F8*%P8%SDH*ko0R0OR_2T3_3I7IT7CUCV;kqkqV{pp{ODl!!|gl$g$|WWWv.}9<}h5 9h<$??m**GrG-vr-v5566c] XXXX[][bLbcLMS$SnWWnMxxbbhhnnuuvv     (.(=()'B).DU;{FS>(B(\(=?(9 9 A(  2O4OPTPt(VJo(V>J+<UU+e<eB2;2;W(\?DQ@Z@ZAQ]]jDjtoX{ q%Xm$$ [%$q[Tr11ir"i"%%&*&*,,w.2.w233x<SSS_<AA^^EG_MEMNNQGsVsyV|x]yQ|]o opqqp~~      $ 4T-+(-9+9(+##8 >> 8+'!)@!/55'+WW@/+D0D?R$R1^?6^1d^07c{g^X^F^ 67c dgX^FyydgS[y^:Sbw^br^^^4wgmh:$mh=${eBr){eB)++=w//1O1:OQ4y:BBGGIIjffjQQTUtTtU`bb`fffiikkmmooqqsvsv{{||$+)%%'! !&& 0 '^;w  ;#2HMJMJ=*K*.K.#;2;H;HM;*aW*;a;H3[O W; W3OewhwehV}D}XDXLW x  uZ Zauyjjr5pr4 5 Vw4y$'>'y>zx}z/$/22pe7Y~:U:Y?@?[[@GGJlJKfKQQRlWWoYZZ^^``cc|gfghfjnhtntzz|}R|Y} j 0 %   %,=% &SLP4pod&+u4+;II*CC8;+(*+(+,#SL#b<3<m5Lm5 rr=LPEAAii_Ep_ LMxqM  "ow"w{{)d)o#u~7777"77p#$$&>)*+&)>*J45~4R<~<=Z5Z= QQRnUWWs+?@BsfgeUTehhRllmnppttvvxxyymn   +"2"2,8,11%;;b%3K::KH>H0S0=L?NANL'A8-@8x f Mq]C BV ]VMCjDjgTYEEYDfZ{Zk[a_+kaddzwi5w='zg',{,.q./q|/}9}|X{9UXAAHHIeeINNPoPVoVYnYZ[vvZcc~hihijkl[pqkstps{{|lqtj~|>S"""""!"2"M"&0T"&m"X"'*?"*-JJ4!;;#U"<F4J<@C"@)2M[_zi2)\=\=T_D_>mB>XBU?ofCofrrQ$ ]Q  $nxu ]|,,nxv v $b$(b(**++5599:;:;CCGGIIKLLOOQUlUQKZwz__Zwz}h}hiimmnttn||0v,% %006#F, # @H#@H>@!)!>)D.@N@.N'Jdd.AY1'@J@d@A@YPu P@>=^v@=qaqvRRe   ~~e    ySy[[o`c`dfeef}epe"}"$$;BpuwwB+u+,z,L7zL799::\CC\FHFMHQiQTTWMWYY{]]b{beefghhfgooqqsstw{w{|@e 6t |  - ; &z `  P ;R ;  ! 4  =&!0 =0L 1^a -0 ? ^K` a 40n \^-0<E2E<DEL02D Vi \0nS o c pniVEpEA`AO`R`O~`kj"   kvu  O vR~``aa`x_999%%mx)m),,-00H4466889;<9AA<cGGLcLNNTTVVYYt^w^_`||zii_mmnnququwyy{{w0E`_&((&5*7K533CEIE$$J7/UKUQM&CDDM:1?1:/JFfR+juB\RFBQJX:=zjX=?zhh hjo   WojjWjSS---hpbv;;;(p;Av()k)k0017~~|1N7::<|<=b=DD```1`LLMMPiRUUnWXWX^w^wwbbddhhmm&IJwxw{{x*7   K "2*$2" C?$+f\?C#JJ#N*"NBJTKTjKBSJqJAAE_JiJJiFSEOkQOFpzG pVvQGqv l| l  e e_V+3ur+ur3``7  8#$#H$**tH00t2Y66RRR2RWYF8FGIIdNdNjjRGnnysRaysacceejjmssm~~     "J@w .""%%44.1//1@C@C@JAO+AkJ@Oz]3B+@]@3K@|[K[@PP@PL@bppbLMdwxMdxfzzf!k!Pkwyw&vw&w-y-525 v }w>>&'&'E}oEoDD/0I/{QTQT>?BB>EEheeehgPgPrUrUt]t]`affllnoorsswr{{wS!##"..! 9"" .7+7B*9*GDGCOC,$W<$.8FJXXHQFdid<WkHIqkq,O8OYVYQHMZLIONLKNMmvmT[T tu%|t|%ZRx^-[-pxp\{0y^:bc c: $$y&?z?+S~/}u&~+z66/}SAABCDCDeMaaeMggRRSnnXXZZs_B_{{{"{.{9{kknnoossuuyy||   + )D )) )OVR  W@J!!% ));iG,)9U9TUKN@)3);)v,iu@W2GiiTi8Y8\bNiczczW3i"}bWi2ib"  }i{i{T++jiid77"vd"%%(()EF~F)3v3PP8SPSSSeXXX~_EOe8ORRlWWwYsslwYaabbqqsvsvwwzz|}~)i#|}~    # #**%00  E224/7/++74+#GJGJ:5V:9YLE5LE\`\cHc6;;IN=N9VQ@QffI:G>oS6GSKK>j=@eeg h i X iXpkx{yp_{k!!B<<7\yB,,M4tM:4667;9t9IZMZ[[aKKqjljlXX[[\``ezehhiillppssttyy{ {GHIKg" ".#V`;)";-"-))ECE "/$%$+o"'"."1+%#"C1PB/CJ'Po]V]BPhoJP<U<UV^x_N^aLTLF&qFMq}Nakkz_zz&,_f5:75b77f:#n#+nk+../II446O6:;=O=H\\\\\bHILLMjjRR/jpXYXYv__{~~eveiijllmnjttwmyn~w")C%Py~  $$"" B ''B  7*7%(9%90K]aT0NN,QZ,E-E&<K*JTJM}OkAATCZQ-QOCUSS>V}o[}oVUu<Qu)|^|^)quq]vv";";$D${D.{./9IMMMMM*M/9W;;WBBEEGGIIMMPPpmpXXtZ^Z^aabggoboq{{}}+*+(  #1QTU[u1 &#040*k00DDCJCJ!YU!>YUHF-F[L3L>= >e 8e8hR[Hhr]rNNRvK v z$k&E&SzkS5:sHtt:?s?yB*y*,,/m|/18M166m|W<<BBBHHIMMdTdTUpqqqUqpbqbccggiioorrsswwzz{{~I~4#  2$#2$    .00.H)R-9. .3=7.9 7+X-55%+X% L84ZLjajK.XjZkak ppj}j}A`Aq nN-Xn  W 8Xtmp|,,4XWuxmu:fl!<:=f=qjv)!lE..//22I)v5y99U>|U>@|@FFGHKGNNKTTV[V[r^^wcdxcxdzz|    )$$**+#+070#+:7:33+=&A&I??,UU=+,EA+%`1-XI+ -gNutXEU%UPXh 1UgUxkUyhygPUJRRJLoUjjLu'ZuZUy.8k.i\;il_l5'g5 9 \8gBo_;&&B+@+,,HHH6KKK678{7{W?@B?@FFIIKKOQQRmTmO\R\]^T]a|+|U|||^ooa{{~~  (--(022:  1: 1 ' $".." 6PDP55!LL!GLG4N4L9L9E$:;J;|D[9SuASdDAuNLHqlEL[L f   pHuduUUqulufugpuy_g"z"$|$?VB_yBBBM..4M4M6zy8Q8>V>ZZGGaLaLOOPTPTVVYYZZ__aa{ee}}kkqq   :D 0   '**Luy11*A2A2IIC(N(JJ-  -R:`:?*JC/]/]HBHB5SQ-C5mRC?CQCmxIUxUrxs}sr#KM#\M  f pKW{fWWW#WW \666*6C6x6%>>%&on>uD*DoX2nu*255~|88~&YX[DDbbII[hPPkTTUvUZZvazzabddiijbjssvhvzz $$ ( N#= =/"/.?(`".+E?+EESHJEH7GE1W1J;+G;EfEFYFf}<EWE{<p OE{ OqtkKk|t{qEr|ru{um0Qn&&&&&(&m{{{Q0w{|5\\4g4w>g&>&((++{//0223}53}0x5<~<=A=ABBFFbbbMMOxOVV~ZZ\\__aabbeflflexxzz6]*46R   ! , ) 7W) !: " :. Y"7$$.7;;,!:NNR>GKK`8J8QcR>RDDUC9gUigNPspGRKRsC`RiUPpX cR QR(*y-SS*^-2ys222^  |#$s)#$|)*-u*{-.u.Tv5v568=T8=WWAADDdJJffdNffl{ooN\\]aa}}o~iio~ottxzzx !  ! RUs!%%b1+170+0(9<RJ3&(739K&K;P9;PR<(XU'?4?FTFbTb h^ :^:CX<CQ_U{'{4{h{O{v{h{{{O{S_lZl{>S2vQXde{.{{e2{66#d6{{#{Z>&=({{.&{.1(12{55{9,{90{{<==<AA]]]]]ccNNQQRS2RS[|[ww__|eehhijmjxmx||~~i{4L_,0>4/?4 43> ?3EM4EI4 4+474o4V4p4MI >X+7]4H4Cv44c4>UCBT44UTB7ok;KkfK;fstsVp]\q H\q  v WX`'`'Woc68^^n6n8!"=='u"'(Jz(uuz00J3{3{7799:;:??;[GGIIJe!Jillm\\]]`a`~a~~kkllooqquuyyzz/  5..)*,*<<2<L2=5EL)%LE%$L$=@H_[_Ht&p_H&/KD [DKQ _X cQcpdSdhU@LUhV_bb^_}e}    V_-rZreZ-"{t_f_>{_  ;"%>%'f'()*(.).2JJ246|99<<??YYgEEjigPPiNRjqqqqq,q]]bbddffijqijqrsvvxxzzrs   #&# +$$,@3@3-,/3K,-3;5K3+&;03=30&S=D^8Y8MYaagMD3HkYHY>pk>:l\{lLetL|t|   Z} hhw*{^:p{p|6666AZ}Fm~mmmAF..//~22^tOORRRR&R,R[?[?_]_KNKNjQoQnoYYZ^Z^zabccballnuuvv$  3Yp$e$$%)&%5)&99+I6Ig&T6+SJRS J\SO1OSddS;S;t}w@S@1 gnn_eki]e]PrBkBmqki P[k qgS[fjk|kkj | z#z#k&&((++--}p//}MMM{7{7::;;?B?BFFHHJLLJUUssttv``abajbjmmoopvvyyzzp  Sk!"0,6,06R5$$.5.11.<A<6AOOCC3_V2*2r*_33cVch_ch4cX9XYY9<DqDfstcc\\c  K_c &wp&sqnccccn8crdcc}d8r;&t&}KEEFGGF22NwNPP;;TT?]?]CeCJJNeNOQQOkupYYZ[uZkz{{f[fllqoquuozz}}!{" 6. # ++(c(]S(' (4'#@I(I9q5\9*9\"_"_5(*]1d1=d=] 3D44 DASAP<PjwwBBaGaIKcpcbr)bi|i|)jS3]yy^^{^s^^>k>%%k'){)*+--+sJ'445*{99U5U>>@`@EE``ggPPllllqZZ\\__bbffhhqqrrww}}  @,/,. /  ."1"<D<2D  ..12RRH<7NCNCM^M^Gp71KrF:H1O:F1OnAnjtj^.1tApypSII0~Q~Y]Y+Q0e{m{4!!"eSt&'"'GsGs11u4u4T::T>>B[B[EFHFbEHhhRRSTUU|vvS|cclqqluuzz}}~~*2pmBrT  pa}Mw-) )q- @?@?) 8$$25C5CDJ*D;8)J(*I=IV#3ZV3eLye8(;j7s7y77v7jf7]ssymv f os&&&&&&oss  $>$%(h(**-n-s003h3478nTTTT^8^4KKLLRRmmp%pYY[[__aa7~~)~#~Z~L~ppqtxtxy~y~ q .  )& &'+'.2;=) // .1@991@,C971W:W:C15W5<CJce<WcerWZ`fWloZlJ;frw==wWb=WbWg dgW vgb|dWi|$7giu$k'{u{*'n/n/1123Uz388zU>}>}E\\EFaFjNNOUjOUss__`yy`kkoogpqqtuut  +     4,? 4?55A;`o GAA6AG -A6-WAWP#,9P#,6=@a@Q9=AIAX[v gAa<TAQ!XJJrIDiVuW"DkVbb"r! g &Tj&njn*\c~0c02222\88""#;#v~;++,.z.RFv~zR,>>?AA?EEFF`IJLLIJsTTppAp~ppps||llmnntt{ {}}  ''-0/-90 /8484C<[ 9B4O4C2)Y4\42U3U3BOYdZidw4\Q@]Q54@;h;GhGNDDH~PzNh~h P  ^ ^wx[vxo[`|o`y<bb<=$=$+y+F113L6883>>@@C6CDDKKMMQQmm4mmmmZZ[]]__b{bccii[kkqqzz9s )2  2   Z?5hzP]P2ARB?R9HTARE,E,F=45F594BR=TR`v9Rvr`RvRHr|mRRHRRGwtRRRxGswsmts17\aa7\d6  d&xs}&'(+{D+s/D/'}{33(}Q::<<@@BBFFeKKeMPPkTTVVWW[[]]^^||llMrrsysy~~R)})!)H)--!))),))    H*")"*8LL8;C),-)Z4s;Z.YCZ5.5Z`5j\t4Z??o`Z_odjZ\Z_XQ  QtZxa  !"|<"|'g'(D(pDXop!4xg459a95<bD<DGGbbLLNNOPOPYY[v]_[v]ggkkmmns_svnvww||Zo /  - 8 A7A@ =Y@-/>)8/B)R\6 7=>0`0`eIeBi6Raahjih \l BjoloVbVb{}{EcdJJ}%HcpEdt%tW.W*q*u.ff^5555^::u?H}?(())q}x.116O6<.xUUU<u}AAxBDGGHIIDggSgSTyWrr\\Hy~~Whhllooqqttvvxyyx/7R,2 #z4 4    CC J5KI,2J5':'EK"E0"03K3$Z$Z]7-p Ve]e7- `8==n`K[=Xi{iX}}8K { VZ[n ~ ~iim^cg""gmi&k&'')kBB..334)4TTTTTT\E\E\K^KddNNTTrrpw\wx\addffiimmoossttzz{{}  # Kni++:! !  --- 5F5%$%*B=<=B*-UB,U<,U/B/HVHIkIVklBlhchOBXBORLcR X  ~~| nYnw_w]|j`j  ##g&g&p(??(p|GG33447;7;SSBBbJaaJabMNNmVVYYZZaa}}B}|}}}ikinknssvwzzv   F!!$ 6 969%9L9-"-$*$CG5GC?'?L%\Hc\5*:,:L'O9O]9<U<]`g`Y I9Su9_^S^]`gIuT[)T_P .R+y_&dyW+rWP)r.h4dR  x;{>>&u&{K.t.8tKhMMMMM8xVAVVABBefGKKGefSSYY[[^w^zzddehehininoottxxy9-y   "**$$-$    H-,*#-##U9-C1C1:9N!!NQHQH+)\)0,+]) \[0mI, mL ]LPI Ps{]``zj{j_sz_DDM   Mz'pRz'T R(l(T2ufuf26c6cpz!!=|=&&lz),,-//-KK8}U8zz<<=}UBB^=GG)KKNNOQRQVoVXX\\dxxORdffjjknnkquuzzk  "##%:"0%CJ)z9  J'L4I'4I5?5?a_C0a6WPTTP.UU.>>77 [ 6_Z l Y[YpZpESW_Ml|!MSZ  vtr3tS/rv`EZh3}h } r(r%%C2rBH0H01144^889OV49}n^bbMMmQQmVVqq[[\\``bb~z~~L_rrt~t~     0##' 9 '++F*3*553&H7,6,7NP+NFBKBGOG)C;S;)a]Ea-R`r&HRS-]E:D6H^D^IppZ:SIS%UTTU.vv.}}|9 !!s9| JLq--qJ4L4W8X8WZZYYXFGFGccdQdQRSRWWsZ[\Z``abb~a[qqttvv\}}S3H "  "**'P$K7/7OC$'/?.M/MU?//2;./>>TXV^V3T3^9;;YkmOm9^Y^k^2Uf~f x;UXU x_e(((heherrp:p:w##w=z=zy)*)y*uCu12]71|7SSS/SUS^S]DDFaaMMF;Ojjjss_sst_aabfbfnnrststrzz{{   ' ' ( ( &&0,0, 0  .6.?0T<;<%36 %?E++;3E=TT=S$S$:0:O/0~X[XK/-RLK-_LR>>Jc8cAew"QeAg@QB!gwJB!"P  P ~ ~^]^UU|222]4d9ld9""$$%%)v)GlvFG:OO0OJO@OO:>>@B@EEFMhFMPPhWWZZs^B^``aad}fdfmmnrruuwwzz'   #'&*&*'='=1+[1( HA+AH(--8 TJ''' B '^ ' '.44b?c5 e5 ?C6eCv}vJT!GkXkX!~LOt~O.TG}xxylyh8{8|9|{gg9h''()++DKD11KI(]\)W\]`HHiQiQjj^nnrrrIr^gghrrhv#v  " "Tb6}% % .9.2-2-*J6/6FM/Fc*9 J9E9E 3TMR,5k05,0T9Lkt B;  oR9N BKlo;\N\g9KxK!xp!ucyp u$yc$ 47 nn]   q [4 q]7e8# 8# ??) ) , , wDDw1 LL1 8 8 : : < < X? A B XA ? J J K K N N Q [Q tt[ [ c^ c c }}x l l p p s s x z z { } } ~  {    9 ~  ! D 0   M      *    T   5 F k       t g   `  n  $    $ f |         3   9        ! / ' / ' C    C D  2 2      0   M    * " - % "  &  & % T 6 E 6   E   5  H  O H R   O 7 R  F  7   T  G a  G S  U S   F  k  D  U  e      t  b Z   b  g  ( t  V d  Z (  V 3 ` ,   y w d .  y  w 3     n    e ; :  f  e ; |   )  B B ) * m  B / m *  / 1  1 3  3 5  5 7  7     ;  ;   A   W   W  A   ^ ^  ^ ` ^  ^ < ^ c c .  N    N   Q  Q   V      V W X W            a  a d    d g    g       k   o  o   t      t v  v     {   {   }   }    "    +  -  X      #   k                                                            !       !   ,   "  ,  6        4   -   4       0  +  6   C   - $ C  $  . . 8    #  G       I   % a   Z 9  Z   2 % ` 2 `  & : e    D b J    b =   ^  \   :   P I ` P [ & ` \ = ^ `  H ]   p  p ]   H >  f K  f   ( L H ` r `  ^ T (  `  * Y T D e  Y s  < s ~  h   q  3  3  3  3 | `  ` " ~ L q " K >  < ? h l   ? + l + - r - . .    3  3 5  5 6 8 | 8 :  : ; =  =  X 6     X ;      E   E    K  K   O    O n         n  o      o u  \  \   `   u ` a   a      k      k   m     p q       q  m  p    { | {  ~ |      *     ~                                      0           $                 8           G       *      <      9   e  J              1 ,   ,   P  9 N  < c < v < r <  9   [  Y < t < ( ]  >  ( P 1  0 L  0  U q  @    L  H @  H   W   _  o o V V    c  Z b  Z ^  e ^   F s  F > N   v U ]  e  T  W ]  T   r    Y    t   . /   c w / f w _ ] 2 f  2 g    d  : h  x   :  g ? h  ?   G  u G .  . / y   r  u / x R   R : y :    R   @    @ B  B C D D  i   `            i     C  T U U     q T    \  \   ^   }  z  b c  z  }  }  } b  i   v  ^      i              v c          ~  ~                      $                                                 !       1  N  ]     &    % 3  %  &       0     5 +  !   +       5 3         J  L x J  J N O      J  N   6 ;  J  6    J L J  R  7 b  0J 6J J  s   ] J J  J J L f    f _ V J 3J  L YJ ` f w f <J d          3  7 }  _  k o a f d f  k   ` R }   w   g   f   g  w j   j    d  a h f  8  ] }  4 4 e z   8 e  ! z ! & r  < r  < h &  n )  )    D , p  ,  0 p 0 {  3 { 3 4   8  8 W | 4    < <  A   W   A   D  D   G  G H |    l    O  O   Q H  S  l     Q  [  [ ]  ] S    `       `                  r r    v  v   x |      |                                                       0                         "   f             O    "        ;  }    V     /    @    * @      =  *   =   (   K  (  K  R +  R  U >  U  I 1 1   I   : J  :   o    M  6 5 M 2 7 g B g w g 5     6    { g  7  B    w  {     g  M i  g n & N - Z m  &  _ - i a Z a } a N g m _  3  ^ }  y     "$ $"y *  A  A  A *  ,,   /0/    L 5 56 ~ 9 9; ; ~ > >  A ABCD  FC D K F KN B N  Q QS S    q   q e            x  x  x  x / x     e  h hi  i           s   su uw wy y  {  {                        #! #(         (+   '  227   3>  3%  && %J  2  g  a    -  -%<<48W)W-%@++=)8VMVd^b^XUXljlO?JUG[EtOjt^ ?Ix@WdMGEIPL\P\Too 0~ 6 6 6 66 6m#m#|%%'Hnp*'RpHn|*T K366;R;<ZZYBQBDDEFHEQ hGFQWWHbbffkklql0qss2ww~ !~  '7  %4WMb  & & &,&&,-& ((1 &!&=1 I&K&-!jG&Ji&I!JY[K-Gm&Jg&xG9L|S9GS8A8iAmgrpLox"orZ"pM[Z T [^_^]Tt3L]yy!!"hB&BBB#B`BHH"55699:6:XX\CC\FFIIKffffKnnUWWUYY\\vvaeaennqq{{~~  #&(&(    =$ YG%G #H/#<H'#<  #O#**#O'>`]>])Mxt_Jf7+fLVJ`)7,AA`__MLb`dgN``dbh! N!h` oV+M,h^^ i$ i$&&RrFFF0r0224455R==AABBFFGIIJLJLSS\\vvaacciikklmnrlrmuuxx||n  $=!""'%% / ' % % E, HKHE6+O+1V6M1N#[_[g,P`Y`jNMdpo e>Wb7b`ed>poo^go)po3pPVqs X))o qZXZjYt3v{ !<)t!g vo)<2GGG GG%G244L99:<<>>D:DEGGcfRfERUUnwy[[\\^ywbbcc^hhiirrsxsx!  (YoK(*MV#_O"&&@@#=5=#C3;=C/=35;7W/8s8=HHY%K%K]MP0]PM?N_j?jdggdAB_NY=SguAaSIuFO}{JF!JOZa}Z{+t{k--tf`k`4lf}&l}>+&(~(~q}--0||}01212}8}8:T}TAA:^G^G^KKNNXmmWWXZZ[\_\_ddiinnt[txx(*" =0NdB  )3!B46!6BCC  >I>I;;9"9j+,)RIcSF}cV+g5,g]<mTFRg=T=w`MQ^Q^YVgeYqebq 5gfkkqfay]g by`w7pr78H<gmgMwylllo@@povvrzHz44N899>>@@DD___8LLNNOOSSWW[[]]__{ddeffhjjenoqvv hn{%o)"34*q%*&2/2gFwaq<+/<+S:-- E:/ /E/R/c/U/G/ERRcREU;/\/G\;l/sFssVsFEUcTg T  ar acVRUci~3l~93lp%%'p'){)++{/D/0is255O7xO=7=EFbbk^hkBLXE_X`F^o^jj}x||x&3$ (344, *  ;"?".6#.86I$(#TIZ,*?BCB8TZ CSbSgr\ZWZb \WttZsuauaQsfQfUgUg k  y   [kf-zyfd-[d2ix77777[fizfn@nhh@++--pJpJw3w34P77P4>>@@]c]cKKeeToToq[\q[\]^b]bccoorrvvwwy~~Zf y 5  ;""5,6,226A6A6B;;<6B66?D'C'D1NCDSS6<6?6ljdj1DNDSDlDdF==FttzqEqs_zlgzsGGeftx# #e x_-g4um{ npuz#$%&/ {mzzz0$#n/0%z4455|88|z==??AAB^^6^D^z^^&LOOPPRSRS\\^^_`e}}eklkmouuvwlzzvw    "'")(+,+)6',F  F!11I>F*7;I;3U!-.3-7QQUYU(EfYb[*2.[i2bhfh]]<T<9ndn:TcDc@CpjdNp NCm iUVX  VqX|s}GrqH D: 9frg<>m>p>X>>j@tG|tE{HEsLLLL{R::;ZaZ;x`Ga~GLNNkyWoWLuu_yxz~~_ss(||} 6  ((7Uf ,7, 889=9>] ><M<?0>H>P>q>>?>O)My>n>>O>)VEVA*A)EB`BT>TpD>>>pg}>FCxpRppDIxPF H  RHPvp UTr.pp.vrm22wmw@p""tk%t%@pk@++KppyKyJJ688S6S??[[DDGGIIKKNNffSTSzuTuu__z{{}}}mmqqz7=z{{   !(p=W(373 2=2557=* `@@>4,,I9W9JUCRW;URJ#;>=X)BXhBh::WdAiU4=d<rOlr`WClC`iAx$xnWEEL&nPML$  wu M& w Pa|/a/}g1\g1}\88v''*v*,,//0KKyQyV~Q|~V@@AADDFFGHGOOPRRTTVVss]]czcdd jjllpqpuuzz||! ! (1&1())&2#BB:+)6"<67O:E:4E7":2+2.Y.Ue:U<Nf nnf42u |   _ I_Ia<emvmkvvNeLJv Lae g[  giik0wvk``""$w$&&C{Co-{-H2v244PPPPV>>V^^DEDEhbbNhNhrVqqqrzyzV~~mmnrrtxtxzz~~&2e!  %%%%."  88?Y?1.%01%0BCB)C)UU9WFR@R%voF9J[6j6jCg@gW9s@s\\Xyay^T{T^Ydqd{{{OO_22[[k  !"#!"pl({{(p#u.002.u525;;<=>><ADD=GIIJOAOQQ\nnnnJ\Geffjjeoosusuzz;%C9@a k$?*))%+$'%1'&1 & ?BB*::-U7,U7*C[8K[CX4/{Yq_HnHb-g,g4/gb8En4gkbg6Elg^g_l####  W9VVl]g ^_6 l9$$AA))FqFq..//3~]3~8Q89Q<<9CCDGGDffgfff fmmott[u[bbjjllmmpzz||p +&  & &""##- ''-%%K  4 !Fn!*BS(0+0(J72J1*42467,+S5:1SVKV6SB4]5Wrc^cnO@yn@ky~w]S~ g $rSk^hd/4oaaa=os e a$d;$s=gw?x?exhw..1363618::<8B<BCCbIIJLLJRRSSXX]]__aahjjhrruuwwzz~~  4S^w ((!F ;-/0D;/'',:K0D9/&5&D59[ZWO+\WZ+Z7\[7eZeZZV9V=@?=?YAaZ'ZZZ$[T$xZ@ZAYTkoxy#k#$$&nBBB&0n101446688>yX>AACCFFaKKLLRRTTVV[[]]`w`aa~~g~gnnpttwwp}}!-!!'.. ) '),,' 377 5223'@ 5@=":9:9;";+\+\--<<SPP^ Sb __bOX^=fXOo?W?QXWooGG f  s  QsY   dh~   Z&dc z h    ji{    Z~ eBi" " # % % & # jBz~e~mFq{ q~& 5 |5 8 8 |; ; = = @ @ A A F F J J K M M S s K S kV V Y Y \  wb  i i b  \ r r  s v v w  w } ' }   $! G                               $ $         *       !    2 2 9   -   -     6 6  : 7   +    : =Xc~* {D C  B  P + 7 P E D       X E W O  X O  C ` Q  W  ` B 7   ,  Y  3 , N    a a Z 3 R [ <   T  T ]  [  g   f  h z  h  g Q y x f Q m    !y !! ! !p ^ o !^ o ' t ' k '  '  ' p o  t !!  k !! ! ! !_  { _   !  #! #!$! l &!&!  j *! *!+!1!  G +!  G   1!2!J   2!   ;! S S S ;!!! \ a! ~    c    @!  c O! O!    R!T! T!    Z! s s Z!s ^! s ^!j!   a!  R!    ~   h!h! j!  m! m!r!       r!  t!t!   {! z!   z!{!~!   ~!! !   !    ! !  !!!    ! ! *  !  ! 9  !    ! !!!! ! ! ! ! !  !!     ! !  7  C  Q  z  x      ! ! ! !!!!!!!!!!!4!!!!!4!!!!! !O  A!4!!A! !?!0!!?!" !F" !*# !!N  R  Z  <  ]  0! !4!B!4!!B!!!"!"!4!! D!!! P! =!!!!=!!D!4!5!4!3!4!:!4!F!4!Q!P!!Q!!C!!!5!}!4!!N!!!`!S!!`!!3!!!:!N!C!!!F!d!!s!d!!s!!!!|!{ !!}!|!y!k!![!k!""[! "v! "l $! " "j $!"W! "w!"" "U!e!-!-!!"p!!e!v!y!w!y!"!U!y!W!y!"8!!f!8!!f! " "! #(#&#K##>##&#####<####E#(##/##;##/###E##[#(#G#0##G###R#F#H#(#g#(##R##[###K##?#`##H### #g##l##S# ##?##l#S##T##C####@##X#;#K#T#y#<#K#"#"#C#y#X#y###}## $}##H# $ $'#_#@#y##j#.##j#'#"*#"*#"*# $\#\#y#n#.#q#n#$q#$##$$#"9#"9##9#(#9#y#9##9#$$&$#&$($v#($)$)$##x###.$#.$v##0$x#I###3$_#y#"O###3$#:$#:$;$;$#>$#>$####A$A$#D$#D$##G$#G$##c#####c#O$###O$##Q$Q$#S$T$##Y$###T$#Y$#t##u#########u##t####g$#g$####m$#####m$##########s$##u$##########s$#u$#####$#$###$#$$##$#$####$$$###$# $$$$#$ $ $#$#$###$##$$$#$$$$$$$$$$ $$6##$$#$$$$%$$%$##$$$#$K###$$##$$$#$@$$2$$$*$$#,$$$-$,$$-$#0##$$F##$$$$@$<$$F$$$H$$4$$_$$*$$#2$$$`###+$+$/$$E$$/$##<$$E$#$F$$1$B$B$#$1$$H$$$$_$$$$$a$$5$`$$\$$5$$a$`$$4$$K$$I$$$$]$K$`$\$`$o$l$$o$p$$$]$t$p$$$t$$%%%h$%R$%L$i$%L$%q$"$ % %%]$I$`$n$q$ %n$"$R$]$`$h$`$ %$#0$$z$#0$#0$#3$R$`$$`$6$$k$$$6$!%k$!%=$b$&%$$$$=$&%$$b$$J$w$,%$,%w$$$v${$$$J$U$$M${$$$v$M$5%6%5%$#S$#S$$S$`$S$$S$$S$$$$U$6%$^$$C%$$$^$c$$C%$f$$$$$$$$$$$c$$f$$$$$$j$$$j$$Y%$Y%\%$#u$\%^%$^%a%$$$a%b%$$d%b%$d%$j%$j%$$$$n%$n%$$r%$r%s%$$$$$$$$$$$$}%$}%$$%%$$$%$$%$%$%%%%$$%$$%$%$$$$$$$%$%$$$$$$%$%$$$%%$$%$%$%%%%%%%$%"%%%%$%%+% %"%$$+%-%#%#%$%-%%%%%$%% %%$%$.%%$.%0%%%0%%%)%%% %%$%%$%7% %?%% %%*%?%%*%)% %%%=%%%%%%/%=%?%$%%%E%3%$E%%%%$%8%%%8%l$$%K%% %U%Z%I%$ %K%3%%Z%%%R%%I%$%%4%%P%1%4%9%i$%%P%%%W%W%c%%z$ %%?%O%k%R%U%%O%e%k%i%k%%[%_%%&e%%[%/%?%&&i%&Q%g%&Q%&&|%&{%V% &{% & & &h%t%~%&&%&t%h%V%%l%&&&&&X%|%g%f%y%&m%&&&f%o%`% &%%%%&&%X%~%%%&&(&%(&)&%x%)&%-&%-&m%~% &o%1&%1&S%%%%%%%%%S%%%<&%<&=&%%=&%A&%A&B&D&%D&E&G&%G&%%%%K&%K&%%v%%%%%%R&%R&S&%%V&%V&_&%$s%$s%%s% %s%?%s%%%%v%_&S&%%%%%e&%e&%%E&%$%l&%l&n&%n&q&%$%q&r&r&%t&t&%%%x&%x&%%%%{&}&%}&{&%&%&&%%%%%&%%&%&$%%%&%&%%%%&%%%&&&%%%&&&%%&%&% &%%&&&%&&%&% &%%7%%&&&&&&&%&&&&&&&3&'&&% &&3&& && &3%%& &9%%%+&& &&&4&&&&4&&%@&5&U%%&&&;&&+& &&@&%!&,&%&1%%k%%g%%V%%~%%&@&c%%&F&;&5&F&,&>&7&&?&7&&>&_%%H&#&9&X&&9&&%H&X&%c&Y&&c&!&5&&&k&&Z&:&&&Z&C&o&&L&p&&L&&&?&&l%&&f&&y&f&&C&y%&M&J&'y&`%&%&x%&%&%&'W&& '&M&k&Y&&$& 'W&`&&*&`&&i&'&i&*&''s&.&'[&'d&''b&h&[&s&h&6& 'b& '"'&"'&u&$'d&s&$'&%B&%B&%B& &B&5&B&7&B&&z&f.'u&I&2'&z&I&2'3'3'&&|&&|&7'8'9'&T&&~&T&&9'&7'&&&&&&&&&%_&&&&&&&&&g&&O'&&&'&&g&O'P'&&&&&j&'&v&&X'&X'Y'Y'&^'&&&^'&v&'&a'a'&&&f'&f''&&&,'&8'&P'&%&%&j&&''&u'&&'&/'&u'z'&F'&<'&i'&z'&&&&&&&&'&&&'&&'&''&'&&'&'&&'&'&&&&'&&&&''&'&&&&'''' ''''''''' ''''' '&&'&&&''''''&'&''''''''','''!'#'*'!'&'#'''0'''' ''#&&Y&&:&&o&&'p&&D' ' ' '0'*''''&D''%'''''&'''5'''5'''''/''''&''F''T'J''T'''A''J&&';'1'('A'('%'*'J''+'';'+''1''<'''i''& ''F'g' 'M'g''M'Z''':'Z'Q'v'':'p'v''Q'''p''m'v''m''{'H''{'H'W''o'W'(o'( ( 'i' (q'(}'q'v'(}'v'V'S'4'V'(|&.'&.'v'.''.'(.'(.'h'_'_'4'(h'c''"(j'~&8'j'e'&8'='c'"(e'='~'v'B'~''v''v''B'''2(l'I'''B''v''v''I''v'l''2(N'x''N'5(''5(''':(':(;(''[''>('';(''['>('I('&a'&a'I(J(''''N('N(O(P(O('J('T('T([('r''x''P(''''r'[(\(\('^(''&z'''c('c(d(''''''d('k('''k(''''''''p(''&'^('''''p('''y(z(''y(''' ''''z('&'''''('(''(('('('(('((''''(' (r('('&']('_(''( ('*''f('('''('''('('((((( ''((( ('(( ( (3(( ((((('+(+(((.(('(0(('(((((@((((''(((1('/((((.('1('(/(@(',(7(L(,(@((7(L('(<(''K(G(<((G(K(@(('C(C(U(((Q('(X((M((S(M(Q((((R(R(=(((D(()(`(h((S(U((X(U((`()(U(D(V(F(4((A((r(S'((h(('((F(A(W(4((((a((a(E(()w((Z()))b((!(g(Z(Y(g(b(e(!((r(m(e( )m( ))(o()()](w(Y())()))())_()()((()(_(")x(?(()f(")';(j(?((i(l((x(j(B(())q(B(.)v((((q(.)(('J('I((t(v(())(((((:)('T(:);)((=)((@)(@)B)(B);)('^(((=)(I)('^(I)K)(K)N)(((N)((((t(l(S)(S)U)(U)}((u((((((((((^)((u(^)((((((m)((}((}(~(((((~(l)(((((l)m)n)p)(p)r)(r)t)(t)v)(v)n)(x)y)x)({))(((((((y)())()(()())())({)(()((()(((((()()( )'(3(()((()(()((0((@((U((W(()(*)(() )(+)()(>)()()())))0)))))0))) )(!) )())*))!)))))+)))>)#)<))))8))2)))?))#)=(()E)V((?)<))2)8)<))E))A)E)J)E)))1)1)F))%)F))%))0*E)B*E))C))*E)E((Y((*E)3)())_)*E)+E))())C)F)V)T))3))(*E))M))V)))o))o()+E))u)`))O)`))))()u)D)<*E)G)D)9+E))G)_)F))X)i())O)M)T) *}) *o)T)*e)X)s)*})s)Z))-)Z)i))*i)(.))-)***Y)*)**9))q)w)))*q)z)9)H))$*)$*%*(=)~)A)e)s))A)+*)+*-*)-*)z)|)H)0*1*)J))|)%*)(N))~)))Y))))))))?*)))1*)?*@*))B*@*)))I*)))))I*J*L*)L*M*))M*)Q*)Q*S*)S*))))V*X*)X*Z*)Z*[*[*)]*]*)))))b*)b*))J*)g*)g*h*k*)h*)k*n*)))n*V*)q*)q*s*)s*t*))))t*)z*)z*))))*)*))**))))*))*)***)*)**))****)*))*))***)*)**)))))))**))*)**))<))** **))******** **.*)))*))*,*/**)),**F))T)))) *)))* **:*****#*:*/*******C**;***;***9**)*)***#*/**2**/*C*/**D))2**3*4**s))***N***3*6*>***5*N*7*f*c**6**f***9*5*9**O*`**O****8*a*A*d*A**a****d***o***H**+p*++v*+w)**d*+o*e*P*U* + +P* +u* +r*}*++r*^*(*u*i**^*8*`*+*+)0*+)0*+)0*+_*H*e*p*e*v*e*!+l*!+"+w*<*_*{*m*j*"+m*)B*)B*)B*)B**B*/*B*l*{**w*R***|*7+*7+|*R*n9+**;+Y*****Y***D+*;+*)]*)[*D+**G+*G+**J+*J+L+*L+N+*N+P+*P+R+*R+******X+*X+)s*****]+*]+^+^+*a+*a+****e+*e+**g+g+*******l+**l+***p+q+r+q+*******p+*x+x+*r+***}+~++}+*+*~+***+++*******+**++*****+****+***.**+*+*9,*+*+*++,*++++*-*++*+*.***+*#+++#++++ ++++**+9***#+++++1+++1++++++++++++/++4**+++++7**>**c**&++++++I++&+++++I++?+++ +#+:+>+`**A**e**)++*0+/+I++:++*+#++)+++I++V+?+I+0+I+++#++V++?+V+I+Z+I+++++Z+>++U*+i*+}*++++8++++s++T++++f++Y++8+I+s+I+{*++Z+T+I+,Q+,f++,K+, ,y+j*!+ ,+V+[++ , ,[+,+i+Y++v++,v+,+,,m+,,++z+,,+,%,+*9+*9+*9+*9+*9+*9+++%,',+',(,Q++*D+*D+*D+*D+K++0,+0,(,+++3,8,+3,++M+m++8,9,++<,+<,?,+y++?,++A,++++++A,+I,+I,++*e+*e+P,+*e+*e+P,Q,M++Q,++++n+++++u++++n+++u+^,+^,a,+++a,b,c,*+++c,+++++++*+#++I++++++++++++b,+v,+++++v,x,+x,++++|,+|,++++++++++,+,,,++++,,+,,,+,+,,,,+++,+,+,+,+++++,,++++++,+,,,,++++,++,,&,&,+,,,,*,,,+,,,+,,+,,,,,+,,,++,,+,,,,++,, , ,+,,,+,6,:,,6,:,+,+,*,,!,,*,,,*,,J, ,,,J,,,*,,,@,K,4,,*,!,*,@,N,,K,,+M,,J,O,+),O,M,N,,,$,,),,,,,_,,.,,`,,.,-,$,N,,,i,,,B,7,,d,d,R,,=,_,N,,B,,i+,,Y,,w,C,z+,`,N,",w,L,u,-e,G,-L,i,R,-=,N,,o, -, -u,",Y,N,-e,h,,-h,-l,T,-l,--g,,,,z,,-g,,1,-,-,,,,m,,%-z,+9,+9,+9,+9,*,9,1,m,%-+?,(-,(-,,+-,+-,-,~,S,,,-,,,2-,2-,~,4-,},6-,,,{,,S,,~,,~,,,4-,},X,[,,{,[,C-,C-,\,E-X,,G-6-,,,+c,M-,G-,M-\,,,,R-,E-,R-U-,,,U-V-,,Y-,Y-,,\-,\-V-,,,,y,,,c-,y,,c-,,e-e-,i-,,,i-l-,,,l-o-,,,o-p-,,,,,,p-,+,z-,+,z-{-|-,,{-,-,,,,,|-,-,,,,,,,,,,-,,,- -,- -,,---,,-,--,-,,,,-,,-- --,, -,-$-,-,-,,$----,,-------,-&-- ,,N,,,,~,,,,-,4,,-&-- -.---,- -.-,7-9-@-'-,7--@----,-,,'-,,--9------D--R,,-8--H-K--H--7,,---,)-^-,D-9-,/-;-N---8-9-C,,G,,-;-o,,/-^-N-,--]---d-I---f--]-O--Q-a--f-I-Q-a--q--T,-S-X--,-)-9-d-O-q-O--S-T-O-.T-.P-O-g-O--P-.._-J--_-J-W-"- .--W- ."-g-.x-.,(-x-----.h-b-b---.y-.---0-,4-k--.h-.k-0-j-.!.-!.m-~-y--%.m-%.t--'.F--j----'.t--F-,G-,G-----4.---4.--Z--7.--7.-<.-<.,V->.-----Z-,\-,\----->.---K.-K.M.-M.P.---P.--n--U.--n-U.,o-s--,o--s---\.-\.].----i.-,{-].-------.-.-i.,.-&.-.-o.-.-o.s.-5.-.-s.w.-----w.----------------.-...---.-.,-9--O------E.-D.----..........-..--..-.-. ... ..-...-.-..-.--.-----..,....$......&.K--..--..-.".(..5.-.(.-."......9.....D...,. ./..-:.:.E.. .B.-.B.N.-J.-....@.N.L.E.X--.)..@..=.E.2.J..2.G.E...W.C.-.W.C.-*..L..;.a....;.. .^..=..G.k. .).B.F.k..U...F.H.?.c.p.*.J..V.d./V.z.p.^.E./.H..c./z./~-!. /Y. / /-!. / /X. /O.Y.p.O.{.x.{...x.[....[.0../.0..{.`../`.6..A../h.e.6./h.f..e.-<.+/.-<.f.A..{.q.{.X.p.+/,/,/q..y.Q..}.{.v.|.3/v.3/4/..-M.R..|.Q.4/}.~.R..T.T...~...A/.A/B/C/I/.B/.-].C/...I/g........Q/..g.Q/......V/.V/t.....t.r.....r...^/b/...^/.b/..d/..d/.-...k/k/.n/.n/p/.p/q/q/...t/..v/~/.t/...-...v/...~//.././//.//././///....../.;0//.//...// //.$.....// //.////.//......////////9../%//////..."// //.//////1/!/.1/&/!/ /.. /%/ //;/F/!/-/!// /;/7//../&//7/./F//.-/K/?// /.K/D/.@/!/?/.a../D/////@///'/T//'/?..p..{......)/T/d../)///5///c/Z///c/_/e///_//5/5/T/f/a///X////f//\/H/w//H//X/a////`/0j/w/u/w//w/o/w/`/i//j/M/L/#/M/ 0 0y/#/h/y/ 0h/0/ 0u/00o/y.,/00{/00]//w/{//00j/9//\/a/g/9/ 0]//%0|/l/g/%0E// 0l///.C////E/.0/030///.0/30//60/60.Q//0/:0z/:0;0///W/>0/Y/Y////>0/C0////z//J0/.b/J0N0/.b/|//N0O0T0/O0/////T0V0/V0.q/.q/.q/.q///^0/^0`0/`0W////c0//f0/f0h0/h0././ //!//a//w////./////////c0/w0/w0x0x0/|0/|0//0/C0///0/4/i5/./5/6/O5/0;6/87/97/I7/7/7/,8/W8/9/"//9/:/:/ ;//0//X;/:/;/00000000000000000000M00/10/70/D0/00P0//10000/100-000/4000/100040T//'080Z//80/e//0'00/010$0*00$008000000-0000000000?00?050/700/0<00/D0@0S00<00@0S0/L0/0)0/A0E00i//0A0G0L0L/00G00K0)00K000000P0m0j00g000D00R0j00=000m0W0Z0R0=00W0/0/0000D0U0z010g0Z001U0z00}0!00}0#00y0#0 1 1a0a0y01s01o0u01o011q0q0{00g011011p01101!0g0B00H00000i0%10%1/10i0B00B0/C0/C0/C0/C00C00H0/1000t0g00s0000p00/N0=10/N000000000=1@1000@10000D10D100000000/c0L10L1S10 10 101010>10S10l0;100000Y1310U1000V10K10W10Y10T1010100000101010l00000000t10t1u1v1x10x1000000~10u10~10000v1000101100101011010010/0001020302401000000000g400011010 111*001011111 1000011111100110101111+10 1500+12110919101!101!11111111A11E00111B111100B11111E11111>111E14111;111"1(111"1131P1F11P111U11#1R111#1111V1H1051H115161d11161i1<11V11i1110U1d11181u01<11N111{0181N11A11K11G1r122W12G12Q1k122Q12e12e1k11U1z1m1 2z1 22n12n1w1]1[1[1)1)1T1t0/171]10/1211^12212^17121p1 21 2"21"2#2y1q1?111?1#2y111+210D1+2,211I11s1I1M111s11M111,21111O1:21O11:2<21<2Z11>211111Z1>2111F21F2G2G211a11b111111111 21a11211121421!21@21X21`21e2111721U21b11S2111a21a21{1111111J21g21p21^21~2101{1111q2q21t2121u2v2v21u2111{21{2|211|21112121111112121222111221221221211112112122211011A112111122 221221211222222 221111122411222222221142162'21211 2(11622F11 2'222 2222?22R1112222*22222242222222422@22!22!22I222422A2222A2=2222222X22-2V2r1122`222-2k12m12M2522M2w1222e2222U222722S2K222f22@2f2K22N222H22@22X22J2l22H2N2o2l2p123o233g23q1"21"2%2p2Y2%2c2Y23c23333r2r2Z2\2b23\233^233y2332}2y2d23222!32!3"3&3t23p2"3~2&3B222i2i2B2+32+3-32-3.322.32222222[222283222222=383222h22=3222D32D32[2222222222222%322h23232V32132V3X32X3Y3Z3 321v21v2Z321v2@32632e32Y3222e3g32g3/32c32[32l32l322n3o32222o32n32222212x31222222222x322222222232322222232222232222322 223222 323 3332223323333333322232332232332%3?2232333233*2232 333 3I22=223%3323333%3333213333333 33'3C33V223'33@3333633235222/3*3Q3Q322322*3,3U33,333233W3U32#32 3#33 33/330323333i323033J32c33W3Q3J3i33/3?3 33@3:3?33Z233:33b23F3B33F3B33d23}232333R334R343[3h334]3h34]3 4I3 4 4 4S33Q34\34\344q3q3^32.342.3 3c34f334f343c34k3I334S33!4!4p33c3E33\33k33333333333E33333p3|33|3y33333354y35464333333A43643 43434343A42Y34333E4E433333L43L4"43O43O443Q4R4Q43U43U4V433R43_43$43333t333_4a43a4V433}333e4e4333t33333333n433}33n4333t43t433v4x43x4y433v43y43}443433433233343434334433 443344344}433333234333333344444444344343344444444"44#4 444#4C33444 444424*4244$43414247424;43%4;444*444%4.4?44.444144W424X4243743044+4[42443h424k424\424044+494434:4u424:43z424943s4243W4j42443444C43&4C4^4243X44&444[444h4=44w424b424424P4=444P44Y4>44W44k4444\4^344Y4>444u4F44D4F4]4453455D45c4|3434534c4]44k4 5z4 5(4s4r4(44r45455u4,4j4544i4i4,455555^45w48445b448444#54#54g4G44f44m44443E44G4444I4I4444353544|4=54{4G44{43R4Z44`44d44=544?5|4Z4C54?54C5E54E54`4I5444I54d4444f4l4444P54P5444l44m4~444f44444Z54Z5443t4443t4a54a5c54c54~444g54g544i5444444444434q54q5s54s5t534t54w5y54y5z5z54~54~5w54545444554555445444554454445 44445454544555545545444545444544545455544?4454 545 5555545545554)554545)55554"545"5555555555<5555555@555<5@55(555155755475A5G5G545A55545458555*5J55*55!55!5J55655565J5(5@5>5J55>55565M5J555255:5955M55:515@55V5f55V55<5525D55`555n55X5X5N5n5B5N555`5J5[5j56[5666b566F5]5x5b5H5 6]5 6 65 6 6 656m566Y56F5j5/5v5^5/5{5^565566{5;55X6556_565x55x5_5}5}5;5%6u5%6&6m5x5Y5x555,6565,6v5x5.6.65K555K555&655|5R555O55R5:65:6;6<6<65d5555555555555d5K65K6u5555R654i54i54i5R6U6555U6V6V6555[65[655^65^6`65`655b6f6555b65f6h65h655j655j65n65n65555q655s645q6555s65{65{65555555545556565565566555555565656666645665565565666645@55J55j55x555555656566"66666)666665"66"65568556 66"6666686666'65"65"66>66"66)6"6 6"66$66!6F66"66!66669556(667666"6D5586"6'6"66#6f55666G66*6>6"6B55a6S6(6F6$6"66666Q6*6F676F6#6F6G6F6H5666a66J6666a6_606C6m66_6 6C6N6 6L6N66L6Q6S6666r6M66W6M6p6c66p66W6J6S6X66565676|5676c676X6 76a676 7t67677|6t667r6m66Y677766i6767d6c67d65;65;6c6;66;66;666o66'7|66'7o6+76+7-76-7.766.7}6376663766776778797:766:765V65V666C76C7D766F766D76I7J766[76k665h65h65h65h6J76666k6X76F76}66X76666[7666666`76`7665{6d76d7e7f766f76k76k756"66F66S66066m66e76t76t766666666|76|766666676766667677677667766667 7766 767 766767677666766676766667766 76 77 766766 777"77777 7"7 77617$77177747777777 7 77;776 77777<747 77<777777(7777K7=777K77A7777%7%7)77777<77Z767(7<77*77Z7770777<7P7Y77P77A7<7727707>7/77577]7/77]7677<7Y677H7577H777u7i7*7<7~7i727Y77u7B77?7B777?7i678~788W78878 87W7i7 8 8 8 8\7c78\7888a78z78 877i78878a7788^7 87 8s7697697 86977i777%87%8}778g7(877*8(8}7,8M7n76I76I7 7I7<7I767I7Y7I7*877M7777Q7Q77n77;87;8<8776X76X76X7 87z7777^777777I87<87I8K87K8776f7O87O8Q87Q8g777777s77V8W8w77V8777777w7_87_877777777e87e877g8h877h87m87m8n87777n877777w8777w8y87y87777g87777777878887788777777777777787778878887788$77877777787877877;7788778778777 887 887788888+887878=7787&88878878)888)7787"88-87788788=8388A8C88=8>778A8+88-8"8&87)8"888898"8778888$8@888"8?8"88$88888898i77c777777778B8B8@8/88H8/88H888888Z8>88Z8Y858885888Y8:8P88k8`88?88:88k8`889o89o8P8L8j899L89z8j899z8i8M8 9S8M8 9{8#8 9i888887,87,8 9S87,87,87,888#88x8{899x8828|88288 9|8 9!988D8888!98'98'9(988(9p88D8-98-98G8~8}8G8~88829888J8p88J88;987Q82987W8;9887W88W8"8W8P8W8j8W8C98C988\888\8I9888I9b88888b8M988M9888l888l8887n8887n8[988888[98888_98_988a9a9888f9888f9h98h9i988l98l988i9888q98q988s98888s98x98x9{9888{9|9|989898888888899988888898888898889888988899999989889999988888898788388C88@88888888999888989889 999989 9898999 9)99 9899999)9999999:999:99>9499>999?9#9?9,9?999999#99999,99>88"9P999U999"99O9699.98O9\9@99\99@98Q9K98Q9909=989.909=999E9`9j99M8989898989999E9H9j99H99D9o99D9k9F99T9F99b99999k9T9b9d9]99J9:d9:n:W99X999}99X9U9P9.9P9}9S9:W9Y9S9:z9S9/99:}8-9:Y99/9:::}9:z9g99::g99999999999&:9J9o9&:998C9+:98C9+:8C98C9/:9/:0:0:999L99999L98:9998:::9::<:9<:V999V999A:9A:Z999Z9999999I:I:99999N:9N:8i999S:98i9S:U:9U:V:X:9X:998s98s9~99]:99_:99f:9]:99~9_:989f:g:h:g:9j:l:9l:999999s:9s:99x:999h:9x:V:999999999:::::9:9:999j:9:9:9::999:::9:::9:::::99::::::9::99999:9:9:::!:::99499?99P99o99]999!:::!::9:::$::::::: ::9,:9%::2:9%:2: :9: ::,:7:::699K9999:$:!:: ::::::: :7::::::*:`99:.:::::7: :!:9=:Q:9:7:>:Q::::>:9@:):9@:'::7:W:)::J:Y::W:B:H:Y::C:H:S9:9:9:9:!::7::.:7:*:7: :B::J:`: ::o:=:7::o:`::u:i::C::u:::a::;P:;O:n:9:P:L:;O:;; ; ;;Z:p:T: ;p::c:;;k:;:;Z:n:\:y:;\:;m:^::^:k:c:;;b:;;m:b::!;";&;:";d:a:i:&;(;:(;::/;::r:d:q:!;m:::/;0;1;0;:1;t:7;:t::7;9;:9;::;;[::::@;:;;:@;:[:::::D;::D;:I;:::I;J;M;:::M;Q;:::::Q;9j:::J;:U;V;V;:X;U;:::\;:\;];::_;:::{:_;:];:::::{::j;:j;l;:l;m;m;:p;:p;::s;:s;t;t;:w;:w;::::::::::::;::::::;;:::::::::::::::::;:;:;;:::;;; ;;:: ;::;: ;;:;;; ;;;; ;;:;;;;;;; ;:; ;: ;#; ;::;:;;;;#;; ;;;::;;;;;;,;:;;;;;;;2;2;:;=;;;;'::;+;H::i::L::n::L;=;:;; ;;>;A;=;;S;=;';:>;';N;);K;::N;B;K;;B;?;=;;:L;4;:E;4;W;=;;E;;y;=;;A;;;S;;;?;;;;W;g;Z;;g;;P;=;a;=;T: ;c: ;y: ;^: ;: ;: ;;O;`;;;W;;O;;W;;;;Y;;;y;R;;q;R;Y;C;<q;:;<<<P;<<q:!;^;u;r:&;:&;:&;:&;:&;<a;3;^;;;<;;W;<;3;6;;b;6;<;<!<{;<y;;b;!<"<"<c;&<;&<'<;u;)<{;u;,<;,<F;;;F;;H;c;u;;u;;u;;;z;;8<;H;z;:Q;8<[;;<<;;;<<'<;:X;:X;:X;:X;C<;C<;[;;;G<;G<;;;;J<M<;J<;M<;;P<;P<Q<:l;:l;)<;;;X<;Q<;X<Y<Z<Y<;;;]<;;]<;Z<;;;;;;;;;;;;;;;j<;;l<;;j<;;;;;l<;;; ;;=;;u;;;;;;;;;;;;;;;;;;~<;;;;~<;<;<<;;<;<;<v<;;;;<;;;<;;<;<<;<<;<;;<;<<;,;;<;<<<< <;< <<<;;<;+;;<;);;; <<<<<;<<<;<<<;<<<<<<4<<<<3<$<<3<<<2<<=<0<0<;<<<=<<.<;?<<;?<;;<<?<7<<<7<Z;;<<K<=K<M=K<C>K<z?K<?K<?K<@K<<S<<@K<S<<@K<`;;CK<CK<DK<C;;EK<<;<<?<BFK<FK<FK<FK<FK<FK<%HK<qHK<w<k<<?<IK<IK<<?<IK<ZIK<;JK<2<b<JK<JK<IK<4<?<JK<&KK<KJK<WJK<=w<wJK<\KK<KK<LK<MK<)MK<2MK<=NMK< =H<OMK<MK<MK<MK< =<q<%<<{<%<;<b<<{<==<==.<b<=<d<\<=r<\<=d<5<r<<5<6<<<<|<6<#=p<p<|<#=$=%=<<,=<<<$=<H<k<<q<,=;G<<<<<1=<1=;M<<v<;M<6=<6=<<:=<<<:=;=<<;=<<<;Y<;Y<<[<[<<<<G=<G=I=<I=J=J=<L=L=<%=<<<<<<<T=<<<<T=<u<<<<<u<]=<<<]=_=<_=a=<a=b=<<f=<b=<f=<<h=h=<k=<k=<<<<<<;<?<<b<<<<k<<q<<;<;<<<;<;<<<|=<|=<<~==<<=<=<~=<==<<<<<= <<===<<==<=<===<<<==<<=<=<==<<==<==<=<=<<$<<<<=<===<=='=<(=='=<<<<=<<<==(====== = =(==&==<== ===A======0===-=4===E=4=<-=&=(==N='==o==v==!=<=!= =(===A=(==P=4=<E=+=<K=+===K==P=======7==)=Q===)==?===m=l=O=l=<=l==O=?=4==m===W=r==<==C=c=\<=<=<========W=0=N=>C=>=N=>o=> >v= >R== > > >R= >==S=>=>n=U=>>n=>v<1=<1=<1=>=>>p=>>===#>=#>%>d=%>&>&>===)>==)>=,>.>=.>8>=<J=d==<J==M===p======8>====X==@>==X===@>B>=B>6C><_=,>===G>==i======G>=<f=N>=i=Q>=Q>T>===T><k=N>===X>Y>==\>=\>]>]>=`>=`>a>b>a>=b>=X>===g>==g>=j>k>k>=m>n>==r>=r>m>=x>=n>===Y>=x>y>======j>=y>=>=>>=====>>=>==============>===(==N==4==l==r========>=>=>>==*>====>>=>==>>==>(>>==>=>= >=>(>+>=>>=F>=->=>>>>*>>>>>>/>>'>=>'>><>= >>=/>>>=><>>>+>>>>F>7==>>>>Q==>0>=>H>=!>H>I>>->>0>>>!>I>;>I>O>I>>>;>3>I>>>>O>>c==1>I>>>>I>d>I>L>I>D>I>z>I>>3>p>I>>>>>>1>>d>>S= >J>I>>L>U= >>_>>>D>R>_>>>R>W>I>>z>>?p>??J>??U>I>>I>?W>?U>?P>l> ? ?P> ?=&>?>? ?U>>>?>?v>>?v>}>>?>>>u>?>>>??=8>|>~>>>!??{>{>u>$?s>q>&?!?|>=C>=C>=C>I>C>>C>>C>>>&?s>1?>1?3?>3?4?$?|>7?>7?>>4?}>V>>;?>V>;?>>>A?>>>A?B?B?>>>>>G?>G?I?>I?=b>o>>>>>>>>>>R?>R?Z?>>>>o>t>>>>Y?>Y?Z?>t>>>]?^?=y>`?c?>]?>c?d?f?>f?>>d?>^?>k?>k?m?>m?>>>>`?>>>>>s?u?>u?w?>w?x?>>z?>>>>s?>x?>>>>>?>??????>?>>>?>??>??>>??? ????>>??>?>>>?>>???????>>?>?>>>??>?>????? ? ?>??????>??>?>? ???5?>??????9?,??9?-?5??>-?? ?2??????6?2?>n???C??5?? ??E??6???C??E??8?>>??E?S?8??S??????T??D?.?+???:??.?U?(?D?T?>U?:?T?/?T?e?>??F???T???Q??K?l???=??t?F?T??????u>?~>?q>?>?g???K?Q?T??}?}?T??T?t?i? @? @ @ @?@W??T?W?T?@@@~?~?T?o?|?@o?@@@n?|?@n??|?@y?>7?@@? @!@j??!@? @j?(@??{?(@>B?y?|?>B??v?J???J???3@??3@?6@8@?8@9@6@???<@??>@?@???@?9@?>@???H@?H@??????N@?N@P@?P@R@?R@<@???>m?V@W@W@???????_@?V@?_@>z??z??z? ?z?5?z???h@?h@i@??i@?>???p@???p@????w@???>???w@>???@???????@??@@???@?@@@@?@@@??? @@???@?@@??@>?>?@??@@?@??@@????@@??,???@@@?@??@@?@??@?????T??|????????@?@@@?@@?,@? @,@@@@ @@/@+?? @:@@@@ @@$@:@@B@@@7@@7@@@;@D@@@$@@@;@C@@@@C@A@L@@@A@@@&@&@@@@)@l??i??c@#@z@#@}@#@)@'@y@#@~@#@@#@@#@@c@@@@c@B@/@Z@+@@Z@=@5@@@@@\@@`@@@c@I@j@K@^@@K@@=@\@E@'@@+@@G@@@c@j@@5@@`@G@@I@@Az@E@@A^@@"@v@a@@v@M@A{? @@"@ Af@l@"@ Av?(@b@l@AAAa@-@}@Ab@Ad@d@]@]@-@AAf@@Ay@A~@A@q@A@A@{@Az@?<@?<@?<@&A@&AF@@J@@-A@@@{@F@-A/Au@/A@J@@x@O@@@O@5A5A@@@8A8A@?R@?R@A@>A?A@@@@CA@CAe@@A BA@?A(BAIAlA(BA{AuA|A.BuAA{A.BAA0BAIA0BAAAA{AA{A8BA8B9B:B9BA:BA=B>B>BAABAABCBACBAAFBAFBA_AAAJBAJBjAAAAAA_AAAjAVBA@nA@nAVB@nAAAAA=BAAAAAvAA^BAvAAAAAAAAAAAhBA^BAhBAAAAAAmBAmBnBnBA@AAAsBAsBAAAAyBAAA@AyBAA}BA@A}BAABBABAABABAAA$AABAABAAABBBBBABABB@AB BBBBBABBBABBAABAABABABAAABBBBB BAABB#BBAABAA%BBB%BBABBBBBB1BAABB#B'BBBBBB'BB'BBBBBB*BBBBB*BABBB2BBBBBB'BA;BEB&B;B'B3AA{AAAAAABABAC%CCCCCC:C3BB:CCCCCC"C!C=C4BBC!CCC?CIBBC?CGCCCCPCTCCPCC@BBHBB6C4CKBBCC,C9CC6C C,C/C&CC/CCCCGCCcC`BCC7CC_C7C9CC_C.CCC]C@C&C CcC9CCCC"C=C.CCCICC]CECoCyCjCCECCyCCCUC^C DUCCBCfBCBCBCBCBCBC DICoC DC DC]CCsCDCDDsC*CbCCDbCD*CCDtCDDuCD DC`C DC"DC DCcC"DCC(DCBCjCCjCDC(DCCtCCCrCuCCCrCCrCCrCCrC3DC3D4D4DC6D7D7DC9D:D=DC:DC=D>D6DCBDCBDCDDDDDC9DCCDCaCCCaCBeCCCBeCBeCiCCCiCRDRDCUDCUD>DCCCCC\DC\DCwCCCCCwCC|CCC|CfDCfDgDiDCiDkDCkDBCBCCCCCCCCCCCsDgDCsDCCC}DCCCCC}D~D~DCCC&DCCCCCBCDCBCDCDDCDDCCDCCBCCC>CCDCCCDCCCDDC.DC5DCDC#DCcDCCCDDCCDD8DC;DC]DCCCDCD!DDDD=CCGCC4CCD&DDC!DDDDDDDDDDD2DDDDED>E?EAEDAE?EDDD_DDDDIEDD_DIELEDDDLEDDCiDCiDCiDDiDDiDDiDDDWEDWEDDZEDZE[E[EDDD_ED_E{DDDDD{DcEeEDeEDDcEDDDjEDjEkEmEDmEkEDqEDqEDDsEtEwEDsEDwExE|EDxEDDD|E}E}EDDDDDEDtEDDDDDEDDEDDDEDEEDDDEEDEDDEDDDDDDDDDDDDEDDD2DD DDDDDDEDDDEEDDEDEDDDED#EE!EEEE#EDDDE!EDDDE.EDD:E.E?DD&E.EEEE@DDFE.EQDD/E8EEE.EHE.EE/EEE3EEEE&EE:EEADDHZHQH9HH>HHrHhH9HHHQHHrHHHKHHHDHHEHzHaHHHEHIHaHIII_HIIIHIJHtG%HG%HG%HG%HG%HKHhHJHeHDHhHHhHfHcHIsHHG4H5HsH!I]HHHH5HIfH!I&IH]HHHhHHhH&I)IH_HzH)IyHHLHyH,I,IHHHGFH2IH2I5IHHLH5I6I6IH9IH9I;IH;IHH>IH>IAIHGYHAICIHCIHHEIHIHEIHHIIIIIHHHHHPIHHHPIHHSIHSIUIHUIGqHHqH-HqHhHqHHqHHqHGwHGwHHwHHHGwH HwHHHHHHHfIHfIhIHhIiIHHHHHHiIHHHHHHHrIrIHuIHuIHHwIwIHHHHHHHHHHHIHI HHIHIHHHHIHIIIIIIIIHHIHIHHIHIIHH I,HHIHIIHHHIHIIH&HHIJSJyIJJ>JJMJJJMJSJ[JUJJJ3JJ[JJJ7JJJpJ\IJJMJJJNJJ3JUJKhJKKXJJ7JUJqJJpJUJI JsI"JI"JRJZJJqJdJJJJZJTJXJKTJKdJKNJUJhJUJxJJKxJK)JZJ@JZJKuJKKKrJJJKJKI;JI;JI;JI;JJ;JJ;J&KjJnJ*KjJIDJ*KvJ}J.KvJIDJ.KJtJ2KJuJJ2KtJKJJKJJKJJJ8KJ8K~JJ;K~J;KON>OCONNYNNXNYNNCONNNNNNjNNJONgNNJO0ONNONNgNNOPONPORONRONNNjNVONVONNNoNMuNoNNMuN^ON^ONNNNbONbOdONdONNgONgOMNNNMNNNnONnOoONNNNsOvONsONvOyONNNyO NNNN|ONNNNNNNNONNNNNONNNNOOON O OO OONNONONNoOOONOO|OOOOOONNNNNOONOOPON OONNOO POOOPOPOROROJQO5RO8RO^QOQ8QQ)QQQQPQ=QQ>QQ=Q QQUPPQ8QQfPP:Q'Q2QQQQQ:QQRQQQ/QQQ/Q'QQRQQQWQYQR>RQQQjQQPZQCRQ^QQQPaQPaQPaQQQPaQNRQQQNRORORQQQTRQQQTRQQWRQWRQQZRQZRQQ]RQ]R^R_R`R_RQQQ~QQQQhRQ^RQQ~QhRQQPQQQlRQQQQrRQ`RQQQrRlRQtRQQxRQtRQxRQQQQ{R}RQ}R~R~RQQQQQRRQRQRQQRQRR%QQRQRRQQQQQQRRRQRRQQQQQQ QQ QQQQRQQQRRRQQQRRQRRRQRQRRQRRRRRRRRRQ'QQRQQYQQ\QQQQQRRQRQQRQR)R9R6R9RR)RRRR6RR9RRR,RdQQRRRRR#R2RR#RRRR4RR4R9RIRQRR"RQ.ReQQQRQRIRR.R R"R9RRPRRRR1RR RSRQ7RaRQSRaRPR9ROQRQRQRQRsQRgR RMRgRRMRRjRkRRjR1R9R7R9R?RRcRvRUR?RvRRScRRURSSLRSbRmRSSYRVRSYR'RbRS[RRPR-RR[RmRRmRSRVR'RSSdR-RRdRSRRRS:RuRRRSRLRkRARRRzRSRRSRQR,SRRmRzRAR,S-SHRwRRHRRRwRR3SR3S4SR|R6SuRR6SR4SRQTRQTR>SR|RXR>SRRRRR\RCSRCSR\RESFSGSQ_RRRRRReRRRGSRRfROSFSRRSRRSTSRTSpRRRpRRRRRRR]SR]S_SR_SQ{RgSRQ{RQ{RQ{RRRRRgSRRRRRRlSRlSRRoSRoSQRuSRRRRRuSwSRwSRRRR{SR{S|S|SRQRSSRSSSSSSRRRRSRRRSSRSSRSRSSSSSRSRRRRSSSSR SSRSS SSRSRRSRSS9RRkRRmRRRRRRS!SSRR,RRSSS SSSSSS SSRRS2RR!SS S SS!SSSRSSS RRSR"SRS#S#S"S1SRASSRSSAS S?S SR9S9SSSSHS SUU6U:U>UUUUUmUvUnUmUuUnUUUUwUbUUvUUwUUxUIUkUUUVIUWUcUkUUV VU V VOU V VUfUhURUU(UOUyUYUUVYUVV}UVVU(UhUVV7UcUVU VzU}UU V#VUUU#VUU?UUzUUUU*VUU?U*V+V+VUoUDUqUoU/V/VqUDUU2VUUUU5VUU9VU9V~UU5VUUU>V~U>V@VU@VFVU2VUUUUUUUFVUUUUKVUUUKVTeUUUTeUUUUUVUrUUUUVUUrUTsUTsUUUTsUTsU{UU`VU`VdVUU{UU{UdVU{UUUUUUUUUjVmVUjVUmVUUUUUUqVqVUUUUUUUUU|VUUU|V~VU~VUUVVUUUVUUUUUVUUVVUUUUUUUUUUUUUVUVVUVUUUVVUV,UUUU:UUUUV VUUVVVVUUV VUUUUU"VUU"VVVUUVVUUVUVVVVUVVV!V-VVVU!VV.VVVVaVVVVVV-VU$VUV0VVV8VVUV8V$VV'V\VVnVVQVVV_VVbVVV&VDVDVUyVVVVVVV&VV1VTVUVVVuUUbUUfUUyUUV.VV1VxUUVTVV'VV0V-VVaVVV\V;VV3V;VWW.WWW4WW W4W>WWW WMWW WWWWAWEWWPWFWWWAWWPWWWMWWSWWXX_WWWW XW.XWXXXWXX$XWW XXWXXXWX#X/XW#XX'XWXEWW'X(XFWWX6WWX.XX(XW0X;XXW0X6X2X1WWX6XX$XX2XWX"XXX"XX3XBXXX2WWkWWWWX3X`WWWWXX8XIXXPXUWWX8XXX&XIXXBXQXJXXXQXX>XX&XPXBX1XXXTX>X^XUXXX4XUXTX1XX4XXkX9X=XX9XXXpXX_XKXX_XxX`XXxXX=XXXnWXzWXKXXWXkX^X`XXXYXrXMXsXbXXMX)XrX YsX Y*XX YpX^XbX)XuX*XYvW-XW-XW-XW-XW-XW-XXXYX^XXuX YXYXYXX YX Y#YaXaXX#Y$Y$YXnXAXXnXXpXmXXXAX-YmX-YXX0YX0YXX3YX3Y4YXXWOX7Y~XX4YXZ^YY.YYLYY6YYZZZZ0Z1ZY8Z1ZZ4ZKZ0ZKZZ8Z>ZKZZ?ZZ?ZKZJZKZZJZMZKZgZKZCZKZZZMZZZKZZ\ZZ\ZUZZ]ZNZKZY>ZZbYZY4ZYYZZVZpZKZ|ZKZsZKZZKZZKZZZgZZZCZZZKZZKZZKZOZnZZOZqZZ^ZqZ[^ZZKZZKZ[[Z[ZKZsY#ZZKZxY#Z[NZY#Z]ZUZ[VZUZuZ'Z'ZZZYZcZuZ[[cZZ[Z[Z[ZiZ[[Z[~Z[~ZZ"[pZ"[oZZ@Z|Z%[Z@Z)[sZ%[oZ)[*[,[Z,[-[ZrZ-[ZPZZ*[sZ6[ZZwZwZPZ6[xZZ9[xZ9[:[:[ZYTZYTZZZA[ZA[B[B[ZE[ZE[H[ZZZH[I[K[ZK[I[ZZZN[Q[ZZZQ[ZZYlZZZN[ZW[ZW[Y[ZY[Z[ZZ\[YvZZZZ[ZY{ZKZ{ZZ{ZR[{Z[{Z[{Z\[Zg[g[Zi[l[Zi[Zl[m[n[ZZp[ZZn[Zm[Zv[Zv[w[y[Zy[{[Z{[YZ}[[ZZZ[ZZp[Z[ZZZ}[Z[ZZ ZZYZZZZZ ZZ[Z[Z[[ZZ[ [[[[[[Z[[[ZZZZZ [Z[[[[Z[Z[[[;[Zw[Z [ZZZZ[['[[ZZ[Z[[[ [.[[ [[[[[[0[[[[[[[ [1[$[[[1[[[[[[UZZZ;[[.[D[ [[/[[[ [Z[[&[Z[[D[Z[[J[5[?[[0[.[[$['[[[?[[Z[J[[;[nZZ[[V[V[R[[C[Z3[ZZ2[Z<[2[R[<[C[ [2[a[3[[a[O[R[[[_[M[ [[[YZ[[Z[[G[iZ[G[r[Z[T[R[_[M[@[`[[@[[O[r[[`[[\\O[z[R[\T[\\\z[ \s[ \ \ \~[[([s[R[t[([~[R[j[[\j[rZ,[\([[\X[\X[t[!\h[Z6["\h[[[h[[Z:[!\"\$\x[$\x[[[['\[[[[ZE[|[[ZE[ZE[ZE[1\|[1\'\[4\[4\7\[[[7\[[U[[[U[A\[[[[[][[ZZ[A\[][[[[[b[[[[[b[[[J\J\[L\[[N\[[P\[[U\[L\[N\[U\P\[X\[X\Y\[[Y\[[[_\b\[Z{[b\[{[Z{[.[{[h\[_\[h\[[[[[[[[[[[[p\[p\[[r\[[r\[v\[v\x\[x\y\[[[[\[y\[[[[[\\\[\[[[[\[[[\[\[[[\\\[[[[[\[[[[[\\\[\\\\\\[ \[\ \[[\[\\[\\\\$[[/[[\\\\\\[\\[\\\\#\#\[\\\\&[[5[[\\\\-\\\\\/\\\ \\\+\\ \%\0\\\\0\3\\\3\\\;\\[;\C\\\[\\[\\[\B\\[C\ \[D\[(\D\5\[\[(\)\5\B\\*\[\&\ \8\^\\+\%\<\^\]\^\[)\,\*\\&\\,\\8\\<\\/\-\\]\\\\a\\\H\\d\F\c\G\F\\a\^\\c\\d\\.\\\2\g\g\O\]i\i\Q\]]E\]E\\]\]\\\G\]\\I\k\\ ]k\ ]['\]f\]]e\q\]`\]]H\^\O\.\\\]\\Q\2\q\6\[4\]\!]\]e\!]"])]\$]w\\z\>\\j\\j\)]$]n\>\w\\\n\z\2]\2][L\\\6]\6]\{\f\\R\\\R\\\<]<]\>][Y\l\\`\\\\\\>]\F]\F]G]\\J]\J]\\G]\M]\\O]M]\O]\\l\\\U]\U]W]\W]\]\\\\\\\\]]]^]]]\\\d]\^]\[y\d]\\\\\~\\\\\k]\k]l]l]\[\[\[\\\\\~\\\\{]\{]|]\\\\\\\\\\]\\\]\\\\\\\\\\]\\\]][\\\[\\\]\]\\\]]\]]\-\\\\]\]]]%\\\\]]|]\](]\\(]] ]]] ]\\]&]^\\G\\\\]]\&]]]]]]]\8]8]']]]]]*]#]0]=].]*]\]=].]\\#]]\ ]]\%]]+] ]]\%]]7] ]]] ]\7]]]+]];]]P]\]\]9];]N]\@]4]]\4]]9]P]]]]C]]:]]]]]?]]E]],]I\]\]]/]H]]]g]g]H]]] ]h]j] ]D]j]]A]]]]D]]o]^u]\]@]N]h]B]]L]i]]^\]/]N]o]I]u]i]x]I]j\"]\"]]"]N]"]]"]]"]:]N]C]]\)]\)]{\)]\)]^x]?]]E]],]]A]]L]]^_]~]^]3]m]]^_]3]]]]]]#^]#^%^r]%^]]]]]],^m],^\G]\G]\G]\G]3^]3^S]]]]Q]]]]]Q]]S]]]?^]?^@^]]]]r]]F^]@^]F^]]I^]I^]]K^]]K^]n]]]]Q^T^]Q^]T^U^]]]n]]n]U^]v]]]v]]]w]]]w]\|]]]d^]d^\|]]]]]]]]]]]]]o^]]]o^s^]]]x^]s^]]]]v^]]x^]]z^v^]]]]]]]^]]z^]]]]]]]^]]]]]^]^]]]]]]\]]]]]]]]]^]^ ^]^ ^]]^^]]^]]^^^]']]0]]^^^^^^^^^^]]^] ^$^^ ^^^^^^ ^^$^ ^$^^]$^^]^^^^]9^^]^^5^^^^^]^^$^5^9^^(^ ^]^^&^&^ ^H^;^^H^^'^0^^^^^^^M^]'^M^B^^^G^B]]^G^L^^]N^D^^N^I]]~]]^E^)^]]^E^^O^J^^^V^^^^6^(^9^^W^^6^1^W^1^t^1^^O^p^a^~^1^^p^^^q^^j^Z^^j^^Y^X^[^X^^Y^^V^B^____t^_~^_Y^__[^_y^P^*^y^\^R^ _ _\^{^^R^*^_{^____-^^]^l^^-^^^c^4^q^a^4^^_]^^c^!_^_^!_"_A^^L_^^l^^^^A^"_^^l^g_^]F^n_^^u^S^^]K^y_^^^5_^^_^^^^^^^S^_~^5_^`^^_^_^>_^^^-`^.`^^^^^`^0`^^^K_^K_L_^^Q_^k`^w`^Q__^^^T_U_T_^^^U_^^^`^a^]s^`_^`_^^c_^c_^^e_e_^g_h_^^^^m_^m_n_h_^^^r_^r_^^u_^u_v_x_^x_y_^^^^^^v_^_^^_^^^^^_^__^^_^_^_]^$^^9^^1^^^^_^^__^_____^__^^^_^___^^__^^_^_^^;^^0^^B^^^^_ __^___^_^^^^_^^__^_,_______,___^:_^L^^D^^)^^J^^^__:_^^__^^_^ ___6__ __6__ __+_._^+_=_0__=__a^^Z^^_X^^0_^^ _1____1_V_E__^M__V_M_-_2_^_3_2__3_7_2__7__ _;__^_;_-_@_4_ _@_P^_4_ _8_ _^_j__j_ __F__F_8_l^_u^_^_f_]_s_]__f_p_a_`a__`p_`s_``i_`i_N_ `q_ `_{_ `_ ` ```O_``W_b__ `k_`b_`q_]_`_``___`k_{_`"`___"`#``l_o_>_W_{_*`_#`_*`+`t_z_-`.`_o_0`+`t_^L_^L_^L_^L_^L_O_{___:`_:`_{___l____X_____X_C`_C`E`_E`F`d__F`____d___^g_^g___R`__^n_^n_^n_w__R`___|__\`__\`_^y__w___d`_^y_d`_|_______i`i`_k`n`___n`____q`q`_____v`w`v`___^___^_ ____`_``_`____`__________`_`______ `__ `______`_``_``_^_``_``_`__``_``_`_``_``````.__`_`````_&`````&``__-__]__{______``E__(`_`(````B`!`_B````1`_```1`_``_H``_H``$`_W``,`$``W```,```G`G`Z``)``%`_`_J`=`%``=```9``K`_N_`_D`^```e`2`^``2``)`Z`J`Z`e`K``M```l``9`Z`D`Z`_`M`Z``J`l`Z``a`` `_`o``aI`'`o`aI`N`a{`` `aaa|`a`Z`ap`_`Z`{`Z`N`'`aa|`Z`a}`z_*`f``p`Z`}`Z`_0`_0```af`a``;``!a`;`_:```!a```)a`)a*a_E`````_E`_E```*a`8a`8a:a`:aa`>a````Ba`Ba`````b```````Ha`b`La`Ha`La_d`Oa`Oa``_k`_k`Va`````VaWa``]a`_q`Wa`]a``_w``aba`ba`a`da``ga`ga``ja`ja_```Z``````````da`ta`ta````ya`ya|a```|a``a```aa```aa```````aaa``a a```a`a aaa aaa`a a```a``aa!``aaa`a`aaaaa```aaa`aaa`aa"aa`a```a`aaaaaaa`a`aa-aaa.aaa.a-aaa+aaa`2aaa`"a2a6a a6a,a;aa`,a+a-aaaaJaaJaa agJagJahJahJa;a`a`aaaaDahJahJaa`3aKiJaDaEaiJaiJa\a`jJaZjJa`jJaa=a\aaeaea?aaa=a?aaa-aAaRa7aRaaAaiJaa3aEaa7ajJaaaaaaaaaTaaraTaaajJaPaaIaakJajJakJaNaIa`akJakJabNakJaaaaSaaSaaSaraPaaSaaSaaSaaababbca[abbabcaaiabbha}aa9abhaaa%ba`>a%b&baaawa&baa@a,ba,b.bxa.b9aaxawa3ba3b4b7ba4ba7b@aa9baa>baaUa9ba>b?b@bAbaa`]aAba`]aHbaHbIbJbaaIbaUaaJbaaaaaaaSbaSbUbaUbaaWbXbaaZb?baWbaZba`ya{aaXbaa{a@baaafbafbaahbaa`ambaaambnbnbaaarbarbsbaaubhbaaaubaaa{ba{baa`aaa"aa-aababaaaaaabaaaaaaaJa bk bq bw b b bц b҇ b b b b3 b b b bδ b b b b b b b b b b be ba b b b b b bM b^ bF b b b> b@ bj b b b bb" b b b bb b?  b  b* b b,) b- b1 b2 b3 bb bbT5 b> bE b6aaEaaRaaLbab"bsbKbb"bLb#baaKb$b#bb$bbb;baOb;bbObSaabahdaDeaeafabbFbbbaKbfab8bb\b-bbdb-bbdbb bPb=b b]b=bbb]bb[bbbaKbaKbbb[abiab}abGbCbaKbbibbKbbGbgbxbaKbcgbc'b}bebqb c cebwa&bqb'bcbccb)bpbbcpbcabKbbFbb8bb\bbPbb[bbibb}bbMbbbbbbcbbiba@ba@b)bba@ba@bbbbb`bbbbzbMbbbbbbzbbbcbGcbWcbXcbncbScbEcbaXbocb~cbcbcbcbcbEcb`bbbMcbcbdbcb>dbMc=dbLdbQcbQcjbbbjbanbbbVcVcbYcbYc[cb[c\c^cb^cbbbcbbbbcbbecbecbbbbbbiclcbicblcbbbbqcbbbqcrcscbb\cbbbbbbb{cb{cbbbbbbrcbbbcbccbcbbcbccbccccbcbbccscbccbcbcbcbbbcbbbbbbbbcccbbcccbccbcbccc ccbcb!cccbcccccccb-ccc#ccbc(c ccbc(ccccccccc c2ccbcbc2cb cb cb cccbc ccbc cccccGcbGcc,cbKc,ccKcbccbccHcHc,c#c-cbccCbbxbbc$c]cb$c@c;cc@cc*cac;cbcWccWcc*ccTcCccTcacccccXccGcCcccnccc7cc7ctcccjccucccSccdocddJcdd~cvccJcvccocd d&c~cNc&cycNc dycwc)c.c_cddpc`c.c_cwcfc0cd)c~czcwcdpc`cd0czcd~cuctcd}c}cfcdcjctcchc$dxcmc|cAc'd'dc)d)dc+d,dAcxc,dccccc2dc2dcLccc+d~c8dcc|c8d9dUcc;dcUccc9dc;dcccccBdBdcb^cLccFdFdcb^cJdcJdccgcccgcccQdc$dcQdckcccccccVdkccbscbsccccsccccsccc`dc`dadbdbdcfdcVdcfdadcccccjdccccmdccccccrdcrdccccxdcccxdcczd{dcc}d~dccccdczdcdccd dcccjdc!ccmdc{dc}ddd dcc~dddcdcdccdcd-ccdcdcccdcdddcddccddccdccddcddddddddcc d/ddd dd!dddddd3dddd3dddd3dddddd:ddddd>dddd!d/ddd]ccddCddd=dcCddddc?dcOdcd>ddOddRd?dcRd0dcdNd:ddtccd=ddNd0dcLdWdEddWdd4dd=d4dAdEdcddidhdAdddidSd-ddSdPd[dc=ddPdkdhddhddhdwdhddhdddhdddhd[dddkddhcdmcddhddhdcddvd.dkddhddhddhd"dddhddhddhdd"dededddhdc,dqd.dsdqdeeddhdehdehddhdehd ehdeesd@ddehdc9dc9ddidld@d(ed(edld,ewd,edDdddDddcJdcJdcJdcJddd6e6ed9ed9eTdd;edTddd;edZdddZdCedCeFedddFeHedHeJedJedddLedddnddyddddQeRednddndddddRedddYeQeddd]ed]edddydLedbedbeYedc~deehedddheiejekeoedjedkedoeeedddsedseteddtedzedzeddcdddededdiedddedcddd/ddddeedeeedeeeddddededeeeeeeddddddeeedddddeddeeeddedeeeeeede)ede)eeeeddeeede e ed eddeddddee7eed7eeeeeeeee ededededeeedeeee eeeeDefeDemeDe}eDe-ddeDeeeeeeeeeeweDe*e eee*e`eDeeDeueDeveDee%e^evdde%eeeVeeeeDee[e5ecee5eeeDeeeeefeleGeeeDeeDeeeEeEeZe@eeele_e@eeDeeDeefeeDeeDef_efde"eUede fUe fVe^e"eme'e}ee'eXeefXefd,e-eege-effwefnegepeae[e^ere3efef:e`eye:eeyefneere%fe%fAeeeAeee3epe,fe,f-f-fueee2fe2fNeveeNeee7fe7fSeeeSeeefe>f?f?feAfeeAfeFfeFfJfeeeqeeJfKfeedeeKfeTfedkedkexeeTf{eeeeeeeqe\fe~ee\f_feexe_feeeee{eeeeee~eeeeeeeee{feeeeeeeeeeeeesfesfeeeewfewfee fe(fe{f|f}fdeeeee&fe}fefe|feffeLfefeeeefefee.fe@feYfemfefefRfevfefMfeff ffefefefyfefeffeffefeffffee fe)fffeffffeeffefefe(ff!fef!fe*fef*ffff eef&fff=feffff+ff)fff=fe^eee fceeeff&feLf4feeLf/f4fff9ffGeef/ffffffYff@ff.ffZee9feVf[ffVffYf0fff6fff8ff1fBff1f0f8f6fZfBffZff fmfpf fffpffffffRfffvffgMfaefCf^ffCfggyf^ffggzf fNfzfggNf gf g g gg~ffgfg g~fffffgfe-f3ffghf3fifhfgifggyf gf gf gffDfffuf$g$gfffeAf(gffufDffffDfHfoffHfoff0gSff(gf fyfPfffffffffffPf0gffSfff?g?gf]ffffCgfff]fffffffffjffffCgffjfgfkfffkfSgffffSgfYgfYg[gf[g\g]gagf]gfffagffffdgdgfggfgghgffhgf\gfffngfngffefqgefffffffffqgfffff|gf|g}g}gfffgfgff ff)ffgfffggfffffgffgfgggggffffggffffggffgfgfgfggffgggfgfggf+ffgggggfgfgggfg#ggffggfggggggfggggg#g!ggggggggg g7g,gggg7g ggggg#g[ffgg4ggHggBggOgEggOggFggg8gggg4gg!ggggg,ggHggBggHggDgIgggDggPggLgNggLgg5gkgg5gggg,gggghhggg\hhhhghgh(hgh(hhh.hhhhh)hhhh$hh hh)h.hh'hhhh8hhh8hhg:hh:hhhhIggNggkggmggcgghghh$h.hUh,hhUhhh-h>h&hAhg&hg-hhLhLh0hh>hgh\hhpgg0hg h.hhch1hKhhWghKhhh`hh7h h1h2hjhhjh hh2hg h7hEh`g h~g hEhh`hphrhphhrh\hAhthphshwhchAhishwhhilh h hthkhphOhlh iOh i5hkhxhWhiixh6hhi}hig+hih}hehihzh;hh ihhoheh6hWh5hg9h iBhbhzh;h#i#ihbhhhphhvhvhBh{hhhphGh{hhGh/ihGh/ihhh4ih4i5i5i~hhh:ih:ihhXhhhXh@ih@iAiAihhhg^hhhg^h~hhJihJiKihhhhghhPihPihhghhWihhhhhWiuhhhhhhhuhhuhhuh|hhh|hdihdihhgihgihhhhhhhhhhhhghhhqihqihhghtitihvihhyihyihh{ihh{ihihiihiihihiihighhhhiiihihvihihiigh.hh'hhhh,hhihhiihihhihhiiiiihi iihii iihiih i iii ihhhhhhihih&i&ii ih"i*iiii"ii*ihiiii8i8i'ihiiAhhphhohhhhiiiiii7iEih7i ii$iHii!i=ii$ii iHihh!i+iQii+iiQihiii%iSiiLiSiiLiii%ii9iii0iIiii0ici,iiciiiiiMiMi-ii=ilikHjjkNjjkMkkkk/kkhjjkDk'kkkDkk%kk%kkk@kkk,k;kFkAkck2kkk7kk1kUkkFkkkkdklkkdkek:kkHkUkkekmjkikrkpkbk kiklpkl:kk!kkbk klksklksk!kYkqklYkllPkPkkllzkk[k3kkk[kl9kk]k3kkklklzk]kj6kk9kkk$lk$l%l&lIkk,lkknk%lmkkk,lkrkkkkIk5lkmkkkk&lk5lkLkkkMlkLkk?lkQlklklk?l@ljWk@lklkkkymkkkKlkjakokKlpkMlkkOlOlkQlSlkSlkkkktkkWlkkWlkktk]qkkkkxkkkxkkblkkkkkkflglglkjkblkjkjkjkkkqkkkflkkkvlkkylkylkkvlkjkkkkkkkkkkklklllklklklk lkkk llklklkkkkkkkklklklkk;kklk@kkMkkkklllklkklkkll lkllkkkkkklklklklk lll-lllkl-llllllll)l'kkkk5kklUkk2lllllll lll3lkl!lk2kkXkk)llAkkl3l*l!llll*ll;l7kkrkklqkkkkkk3l lZlBllkkpl l|l lNl llZll3llYll_lcll_l;lYllllUlldlUlil/llHlil7l/ll7lllHllllTll\lAll[kllJllJlAlllpll~ltlm~lmqlClTlilmqlm mjljlIldlclIl#l m m|l mnk&lk&lmNlk&lmmmml#lpl\lilmulllmullll2lmlxlel2lxlmlllllll$ml$m%mk@l%mllkl)m+ml+m)ml.ml.m/m0m0mlllkMlll;mlkQlkQlmlkSl lQl;mkSl/mlllll@m@mlllDmlDmFmlFmllllllJmKmJmlkglKmlOmRmlllRmllllVmlVmXmlXm[mlll[mOml]m^mllll]ml^mlemlemllllhmjmljmnmlhmlllnmrmlklllrmlltmtmlllwmllrym}mlllwml}mllllmlllmlmmmklllllllmll mlmllmllllmlmmmmmlllll mmlmlmllmmm mll mmmmlll llllllllllll llYllmmBllcllillmmm1mmmm1m'm1mm,m1m"m1m2m1m7m1mmm4m1mmmim1mm'mm'mmm1mmm,mmm"mmmmmmmCmmm2mCm3m-mSmm-mm1mmmmm1mmm2mm7mmmmGm#mTm#mmGmm1mtllCllm4mmmTmmm1mYmfmm1mmm1mmSmm1mmimmMmmYmm)nim*nimMmmmmn=nn>nan=nnnan6nnn^nqno^nooDnooLnLn|no$nnnyn o onVnnyn$nDnqnpm*noVnoooSnobnoooWnounooo[nonounnncn"on"o#o%otn%onin'o)on)onn#on-on-on|ntnnmGn2on2o3o'on3onbnnnnSnn:omUnpFpp>pLptpLpipFp"pipqfpopqfpbpopbp"p qtp qqrpqZp*p-pvprpp*pcpvpZpp-phppo1pqhpqqcppq^pAppppjpp^pp@pp#qjp#qIpgpJpmpmpkpp@p,qzpzpnppppAp,q~pp0q~pdp~p0qkpIpnpJpppMpppppMp8qp8qQpppQpoUpoUpoUpgppoUpppppDqpppDqFqpFqppepppdppepppppppPqpPqppSqpSqUqpUqWqpWqppYq\qpYqp\q]q`qppp`qppcqpcqdqopppppppdqppppppppppqqqpppqpqqpxqpppppxqpppppppp}qppppq}qpppqpqqqpqqpqqqqrqqp$rqqsq9sqqqpqqqqqqqqqqgsqsqpqsqrqqqsqppppKtqtq]uqqpsuquqqq%qqhvqppp*qqpquqvqqqvqvqqqbvqq&qp%qqq&qqqVwqWpppqwqwq xqq=qqq:qqqqpq)qIqp)qqBqIqpBqqqpq9q3qqq9q=q*q:q*qqp>qqq>qqq;q;qGqqqQqZqqqQqq1qq1qZqqEq[q'q q[qq/q/q-qq'qq?qiqq?q-q qiq qqEqZqqbqqqTqlq6qTq_qbq^qqlqq6qqqoqqqq~qoq^qr qeqeqJqqJqOq q~q^qqOq rq r rq rVqRqrrqqrVqrgqrqrrnqgqXqrrqp0qqrqrrqr rqqfq rjq{q"r"rjq]$r&rq&r'rqqqCqtqqpFqpFqqrqquq0rtq0r1r6rqquq'rqCqq6r8rq8r:rq:r;rpWqqq;rqBrq1rqqqBrqqp]qp]qp]qpdqmqqpdqqqnqqqqPrqPrqkqvqqqmqTrqqqq[rqwqqqqTrq[rqvqqqkqqqwqcrqcrdrdrqfrgrqqfrqkrqkrqqqqgrqqqqq*qqqq3qqqqqqqqqqqqqqqq|rq|rrqqqrrqrrqqqqqqqqqrqqrqrqrrqrrrqrrqrrqqrrrrqqqqqrrrrrqrrqrrqrrrrrqrrrrrrrrrrrqrrqrrrrrrrrrrrqrrqrrrrrqrrrrrrGqqrrr9rZqqr^qq7rGrIrGrq7rLr>r>rqrLr9rr#rGrrrIrrrr#rrKrrqRr!rEr_qqr!rrrErqr5rrrr2rrs>sUss#ss)s?sIs+sLss)sUsGsJssGsss?sjrsIsssYsssHsosdsossdssHssqs^ssqssssssYsJss(sPssbrsrsstsrsrstkssnstssosns{stsos tisks{s t*sls{s(sbs*sPsosZsbs3sZsr,slsssssss3strssr9sr9strsr9sr9sr9sisos&ts&tEssssusEs+tss-tss-tswsus+twsNszs8tssNsRss8tsRsss?tssVsrTszss?tVssssCtsCtssEtFtEtsJtsJtKtssrgssgsjsssjsssStsStssrmsXtsXtYtyssYtsss]t^tsysssat]ts^tssshtssssshtatsrsssrsrsFtsssqtsqtrtssrtsssssssss{tsss{tssssrsts sstsstststssstssssssttsss%ssss-ss6sssssssststssssss2ssss!t tt!ttt$tsstttt%ttt tttt.ttttttttsstttsttttt%t$tUssJssossssss t t,t tt.t)t tt ts.tt,tt1ttt1tts)tGtstOtOtGttttttts*t*tRtt.ttt/tRt'tLt^ssQtRtt'tLtst/tttQtt0titttett0ttttWttetittbttttstHtuttHtttWtitttttMttuuTtttutvt|tuutuuvttZtMtut ut us&ttetTtuttututuutbtituu_ttuctuuu_tttuwtstit$ut$ututtutxtt(u(uxt,uotctut,uttottsKtsKtsKtsKt tKt.tKt7ut7u9ut9utt;uvDvv>vv2v1vv1v;v#vvvv;v=v]vvFvFvevvxBxx>xnx;xx6x2xqx;x xhx2x xx6xxpw xxpxw xw xw xw=x?xxux?xxuxhxVxxynxyyqxqwxwxwxynw xx`xxxMxxjxMx yjx yyPxPxaxyy.xxxybxXx.xbxxpxVxxXx9xxw4xxkx!yxxxx~w4xkx9xx9x!yxx$yx$y&yx&y(yx(y)yxx)yx.yxxx.y/ywKx/yzxwKx5yxwKx5y9yxxOxxx9y:yzxxx|xxxwYxwYxwYx xYxxYx7xYxOxxxxxxxxxx|xcxxxcxxixx:yxxixxxRyRyxWyxxxWyYyxYysxxxsx^yxxx^yyxxxxxyxxxxxgyxgyxxxxjyxxxxnyxnyjyxxxryxxxxxxryxxxzyxx}yx}yyxzyxy$yyxxyxxxxxxxxxxxxxxxxxyxxxyxxxxyxxyxxyyyxyxyyyxyyxyyxxyyyyyxyyy*yyyxyy;xxxxxxxxxxyyyGxx0yy yyyyyyyyyyy*yyy0yyyx y8yx4y8yy4yVxxy yyyy yyxyyyyxyyyxyyy'y'yyxyyAyyQyy+yyyQyUyyyyyUyyyAyyyy+yZy;yyZyyNy_yyNyyy7yyzgz>zTz>zQzzz$z}z{gzSzRz{{fz~z{zz{fz{z{zNz}zQz {Rz$zzSzZzztzz {Tzzzty.z2zZz3zz_z2zz_znz3zhznz{{tz{zz%{z{hz{gzzz%{&{'{&{zzzzz'{zA{tzzzzzUzzzz5{5{zzz:{zzz:{zUz<{@{zyXz<{z@{A{K{zizzzzy`zy`zy`zy`zz`zzzK{L{O{zL{zO{zizR{zR{S{T{S{zzzW{zzzzW{zzz]{z]{^{^{z`{`{zzzd{zd{g{zzzg{j{zzzj{zzzzzzzzzzr{zr{zzu{zu{w{zw{zzz{zz{{{{{z~{z~{zz{zz{z{zz{T{z{{zzz{{yzzz{{Czz[zz{zz{z{zzzz{z{z{{zzz{{{zzz{z{z{{{{{zz{{{{zz{{zz{z{{z{zzz{{zz{zz{{z{{ {{zz-{ {{-{{{{;{,{{;{z{{z*{{0{ {B{z{{{{>{z*{B{{>{){B{=zz/{B{U{B{{){{{N{{>zzzzzzzzzzzzN{H{0{z{/{{U{{{{D{V{C{B{{D{~z{H{{z{{C{{{a{B{={B{{a{{={Z{{E{{P{Z{[{{i{[{{P{{i{{{ |\{_{B{"{_{Y{E{s{B{{Y{\{J{z{z{J{"{z{ |t{#{#{s{{t{+{{{U{b{+{|{|1{v{v{{c{1{2{e{|{2{h{{{b{|h{e{c{o{{ |o{ |!|y{{!|{$|{{&|zA{F{y{{l{$|{+|,|,|{l{F{0|{0|5|{{{{{{{5|{{&|{X{{{{+|{{{{{{X{{{{{B|{B|C|F|{C|{F|{{I|{I|L|{{{L|N|{N|{{Q|{Q|T|{{{T|p{{{{{p{X|Y|zr{{{X|{{{zw{b|{{{Y|{b|c|c|{|{{{|{{{{{j|{j|k|k|{{{{{{{r|{r|t|{t|w|{z{w|x|||{{{{{||}|{{x|{{{{{{{|{|{{}|{|{{{{{{|{|z{B{{{{{{{{|{{{|{{{|{|||||{{|||{|{||| {{#|{{|,{{|#|'|{||'||{|{|||{|{{|||{{||||||{"|"||{|*|{|{ |{9|*||9||||| |||||||V{{|G|{J|G||J|||.|||.||-|(||{||-||||H||>|||;|H|/|;|)|||{`|>|/|3|{|Z||2|Z|3|2|1|`|1|e||6|e|||6|m|i|<|i| |m||:|:|l|||l| |^|||<|=|^|v|||n||=|K|v||}[|||}f|V||K|[||}f|n|i|}||||M||{!| }}| }M|}}{||{+|||}{|W||}}W|}|}o|4|}|4|||o|}}}|!}|d|!}|d|?|%}+}|q||(}|p|~|p|+}(}q|-}|p|{F|3}~|3}{L|7}|{L|7}8}{T||||||U|||_||||A}-}|||8}|U|||||_|{c|||L}|A}|L}||N}P}|P}||||N}|T}||W}|W}[}|||{r|[}\}||_}|_}`}{||`}|T}|||f}|f}||h}o}|\}|||h}|||||o}||s}|||s}u}|u}v}||||z}|z}v}|}}|}}~}}|||}~}|}}|}}|}||}|}}}}}||}|}|}}}}}|}}||||}}|||||}|||}}}|}}}}|$}}||}}|||*})}}}*}||||||||}||}}}}$}}||)}||&}}#}|(||/||1|||&}i||"}#}}?})||?}:}}"}}}}}}}&}}} }}}}}:}| }2}G}2}}}}G}}} }U}H}}U}}}}}.}>}E}}|>}.}'}M}|Z}E}5}M}}Z}F}'}}5}V|}X}}}|}}<}<}X}}F}}}b}}}n}|}|}b}t}^}}}c}n}t}Y}}}k}r}t}}~r}k}Y}d}t}c}^}e}t}~~d}~~~e}p|%}|%}|%}}%} }%}2}%}]}t}|+}~]}~~~{}~}{}t}~~}}~}~x}}|7}9}x} ~=}y}}9}w}=}y}}'~} ~}'~+~}}w}}}+~}}I}}0~p}}I}0~}}|L}}t}R}}}O}}}}w}}R}p}}|T}|T}}}}}O}}}}H~}|\}}}|`}|`}H~g}}}}L~}L~}g}i}}~}}i}l}}}}}l}}}V~W~X~V~}W~}}}|v}|v}`~}X~}`~a~a~}}}}}}}}}j~}}}j~l~}l~m~}}o~r~}o~}r~|}t~u~v~}}v~}z~}z~{~}}}}~}|}{~}~~t~}u~}}}~}~}~~~}~~}~} ~}}}}m~} ~}}}~}~~} ~~}}~ ~}}}~}~}~~!~}}}}}~}!~~~~~~}}%~"~)~}}~"~%~~)~}~}}}*~2~}~.~*~}2~3~*~}}}}H}}4~*~,~}'}}t}}}}}}}}}}E}}~,~~.~~A~-~~A~~=~*~~1~P~~~~3~~~~~.~}=~~1~~4~h~*~~=~[~}#~[~T~/~}#~S~*~/~}N~*~~=~~T~~~~*~b~~R~b~ ~R~~E~E~I~~I~ ~ ~h~5~n~~5~n~ ~9~~>~9~~>~~~S~U~B~B~~~U~^~q~^~N~}~q~~}~$~~Y~~s~~&~Y~~$~s~~&~~~8~~~6~x~~~~~f~~~x~Z~~~~~~Z~8~f~6~~p~"~";~~~;~i~~|~?~?~i~(F~~~|~~F~G~~(~~~~G~4~~~~~455~77~~~:~~=~=>?~~~~~~~~:~?~>~~~~~~c~c~~g~~~g~~~T~TW~}m~WXYX~~~~~}u~~~~y~Y~y~~~~~~~~i~~~h~hij~~j~~~n~~n~~~~~s~~~~s~~~~~~~~~~~}~*~~~~~~~~ ~~~~~~~~~~~~~~~~~~~~ ~ ~~~~ ~~~~~~~~~*~~qwҀ~-~~ 2 P~~ 62008;8;6ʂ͂C<C,ڃ$1/1Z9[@I@9HK3^3HE^BBAl^ Em] D]F ,<l$< DmFN{Npp~|t|dz z  p{ quu..vv\~5~5~5~5 ~5 xdtGx&&(()*-})-G/qt}~/5566;~X~XD;D__IILLQQSSooYYZZww`dd`hhimmpipqvwy~~2vy~8<[IA!+!374"4Z:ÀÀ"ŀŀ,,^{tK'Kр'рҀJ3+JJPڀEڀ+E?\?\$O$OP7+ajFNjF<cf  <Mf: Mt\>@k>kazl rNz@zbT rb   |0~***** |/stz0Tzlz6==%%+|zszD+D-D/-U77VzUVZ[E[EGGIILƀLNNORRЀoooOqwwww+w/ЀЀggЀ߀Ѐkn߀knppӀƀӀЀЀzzˀȀˀȀЀǀǀЀՀЀՀ  :K&&","ҀzҀҀЀҀҀDҀ.׀AāA׀āŁʁ6 DŁ ʁˁ6Dˁ$JссҁcҁCՁՁ!؁Q؁T.,!1$DUQDUDBTB__DVf^f:=:VDF[9qFvCJ9llPH`H|a|K x K  }W vqX}hX~~o"o";m;m&&))*+..ƀIx~3*88::<+3]<]FbbLLNNQQUUXFXZZ]ǁ]_ȁ_`߁ہ߁cfہfǁ߁cȁmmӁ`ȁvӁ߁v݁ف߁݁߁~ف~ځց,  'Jˁ(1ˁ0ց 9‚‚(0900ɂ$0ɂʂ˂B͂$0^=[q˂B(4 ݂4݂S M SP`Ma/MdhWhW   ߁  0 hdr/rCAoAoCrqrq!xx!P P ,ygryjr,[q[krgjk a "?l"?'u'(u-arl-(s/0/0s7788VXVBBDDEJJEQQRTԂpRpT^_`^eӂeiӂ_`iځ΂llqq̂wǂǂ̂wy܂y{{ڂڂՂՂւ܂тт'ׂׂւÂÂ!!ʂ ͂r͂͂͂͂:͂;:;91ƒ9ƒŃŃȃFȃɃ˃3˃IK:F:Ƀ&&:WIP#Pك ڃ@C]3:ك#߃߃U@U)Z]Z[G[X2XMS>XG2Gs>HscLLaxaxSGN~MGd mm ObNOxbY/Yda7n$$&u&''*+E+*/x26n26::;;=ԂTWu=KWLքKLT΂i^EWTσqYY[[]ă]rʃσ{săjj΃zs΃PsR&ʃσ    փփ؃1)(.ƃƃ#,)K˃.#؃51)ڃGڃHڃaڃڃڃC߃-˄-)˄0"τ0τ1%I҄҄%IՄք!Nل!ل܄DՄ܄(,cX\XH~5,D7H\@4@ ?8?_h_GkFF|B`wkh`R R 3veeZca/c/B|Z3d#rw|Gh#&r&((v|--.7.σL΃LL(L,L7d=T=@@[CCEFF^ƄgÄgÄiPɄiɄUЄUVWssӄPV_ӄ_ۄabbDŽhԄDŽۄahiiڄmmȄĄppȄrsxЄƄxy|ʄ|yфф݄ބބԄۄ  ڄۄ݄ "I')%5,54,4Nք7ք \ք4ք߄ Ņ! ߄Ņƅ!  ,ƅ82%) ,ЅЅ҅*҅Ӆԅ8h|8,ӅTT>J>O02,ԅO$]c>$*,Jj/jn<ncA\`YAY`aSdfdLLXGfGXS\+g"QZ"&&eZQ+oTeolvqkkv779gfHut9qEƄEEH2t244NuN99::WۄW??WĄWDDEE…DžKK…lOPORVVWՅхsʄsWՅs݄sxzbbczcggۅik΅k΅хڅssх )i{څ{}}~~ׅ ׅ'х,>f  ÅÅ* %$$0Ӆ7օ557օÆ.Æ@ƆƆ]*. F/<&'('&,(؆,؆چ-چYU\%*UY-F`6`6)_)_[dd[]3 ]8JJ ;II 8\ <\Aq ;<ASSrvyyvGQQ N + ZX^ ZGrX+x/|x^/a""#%%h&'?'*N#0DžE|01LL*RхRRRR*R1eJaJeȆۅgOOQQSцSц҆n҆Նwn^Նw^φbφцbц̆߆Ɇiiц̆lццц߆׆wȆl††Ɇwц$ц||ІІ0ц?цjц  ۆۆކކdžņ @Fņdž66;8   ‡;‡@ 2ɇɇ??2(CZ3qr C܇(܇TZTFPPF+)K[Kd`+dcc7M M7DpnDxnxG}f}kek]]\U$$$&$&Ȇ&U.Gp_.gg_ha9ao9oh&&((qv/zEEqz/01{~1{778SSSS8?BBCDCFIFIrjjD҇׆la҇y҇XX҇rׇ\҇\`ч`adƇƇ؇defefʇlʇlهpهpw҇wxy҇҇xՏ҇ЇЇ4ِ҇҇ۇчׇ c҇o҇ އ؇؇ۇއ 8 !@   ;)22ˇ݇)5͈ӈˇ5߇5 ݇5ĈĈ99 H߇=H=)[`! шшG7pfeG W^bW]:5-]:^-66[b[c\ScS55;o@@_AR;RAiriZZ"h{L L" {*|&v&k~hjk~*sgs~007nq#t<%|jmt%mDD#nׇD<KKM:M:<<VYCCVFF؇aKaaKNNQQYvUUu׈uzvcΈ׈u׈ΈLjLjzycֈψֈhψhk͈knoppӈrЈn͈rӈyЈyzz|ÈňÈň|ӈƈ!Ոƈo͈҈֊)Ո҈5̉!(1)1.ۈ$ ۈAJD0  ɉ ɉ!.>L7|55e!do55_MHMrj)5H`L`O66lOlbV7Vajag{q{uIPId  _ d R*igqq*gWYW2s2seR_(()-FF-//11Siv88X;SX?C;CÉFFG?GʼnMMPPmˉmˉmrZZ\\]]̉މbʼnÉb̉̉w̉ʉmʉm؉ox̉o؉uuwxԉ׉݉ԉ~׉~‰݉‰܉܉̉ˉ͉͉  ()$.LƉ%Ɖ % !Љ.2ЉΉ 2=ŠΉ Š*ĊŊĊ߉߉ŊAʊˊΊJΊD"IIӊbU".7jYӊUuP0>W^WʊA_`_L656 7Np#N:t:$KˊAzSz|`eLE|p  t# |S$Kpv//eecac  d##@?É?0@?/BB/01yO7O799|{==>B>Bމ]iFFHKKffiHQ̊QRnUV֊̊֊R֊ϊ֊֊x1֊-֊:֊J֊Z֊E֊Un3֊s֊p֊VϊY֊֊֊x֊ϊxÊ֊Êيي֊֊֊֊ދ֊֊ϊ֊֊ ߊ ߊ=*''Ȋ& Ȋ )**͊͊Ҋ!6Ҋ464&‹-‹Ë"8ȋAA55ȋ"^,I΋I:΋,5??GڋGڋۋ݋Z݋EۋJ@@CCDETDT3fË-ELf3M[3[ W;Wwm LwaylNgM;gym$NsOSO p l$ (Ye.e(X.Xy1{1   p|&|>&'('{z//({1414]zP::;V;??AABbP]bIIKKƋBPPϋRRTċZċTZ\\Ћ^Ћaˋaˋfŋ^fӋjӋj֋Ջo֋opՋՋvvxxzz{p֋Nj{NjދŋЋՋ͋ҋ)͋!ҋ""8ËË)ʋÌ)))ʋ++ƌ)ό))A)@<))ČZ))><l)Č@@=))*=)،*)،ٌٌ>Q<ތQތ5VW5<)))VcWCD<DS_CtEc<99wFFLLM]r}]}%sMw  Et`%erwe`(,_tb,b6i46sw!i!""$Gg$A+k+qgGHqHƋK5wϋK5wXTЋTՋTTTXBE^EBHÌHkKfl͌KR͌RlUƌUWόWuȌΌɌ|`ΌȌu~`Ɍ|~ˌ~sڌˌjjڌŌrŌtrst||~~֌Ќ<twЌ ݌݌##֌̌%̌%&  &܌ 2܌č2č9C9-ʍ-ʍ'C(/͍ύ@ύЍ͍('/.Q֍.֍ISЍ@ڍIڍASލ,ލD,D0Zb)LbLiadiT dFff @Ch0DFM_GGM}_}gakgNTJkJN  *lZ*[hi!!##zOz&'(&--(11236O69X9<2>Xc<>RcJJōNōNǍP'RTTXэnnXttt&tCtQt3эÍ~Pэˍݍȍkˍk̍׍u׍uwÍwҍ|ҍ|ȍ̍΍ߍ΍ߍɍɍHgIV%%Ӎ")" 4ԍ Ӎ Ӎ 88ԍ??5:/ƎƎ:.ˎ.ˎ͎,͎юHH,7ю؎H@Ԏ;@;0؎َԎA=ZA0BU$YߎYS[[ߎ$َ=SgCaaBCDIGiGEED[tet]V]e} V}hzzhW *f fW #m(~ l(^*Fml^cb c6 !"<<Ǎ<''K{r-{~F-.001rK71799F!JݍX"_.E_EFIĎĎIJLMLjjMUUӎooӎYY\Ɏ\]^``]ڎ^eڎegghݎЎЎՎɎӎÎՎݎtzh܎ztÎގ6 # )4ݎ&ގ5/7ǎ$ǎǎ$ ǎ5 568ҎҎ#Z؎8U؎&464NҏAҏANiՏGGKۏKۏ:CCP+PO=O)3QSS3):QR+@b@bR=;W;kaka<>V>blfTlV<O (qZVqfX'(yyl Z0?i0~dB9mi&~?&dB)m)*HF*00H334M99:@ȏ@BBCDJccJݎeďQ܎eǏQǏjUȏjUЏCrr܏ruuߏЏbߏb؏܏D؏Џ:kknnrЏЏЏݏ{rُُݏ{}}ЏЏԏԏޏ ޏ   ÏÏ11яяڏՏOՏVՏՏՏՏ#ڏ!#ĐĐ!-ɐ-ɐAA̐E7"7̐<5<Ր5ՐL$ِWېې6L$ސ=6%I\(%I=%TXސ( 2Fe2e>e^e\ Z  FMZM?ee^>?[[G~i  j~js  TTslWY~elsW4Џ4444"4meqh#qe#&&K,pHmDpu,ďDH1133uK66799<<??EÐEHHJÐJMMOOƐRRTŐTŐ[[Ԑ^^``abcǐbǐ7ܐlܐlmaomqttzq{Ȑːz{֐Ǒ0ѐsӐӐӐ~: bߐnߐĕ Ȑ2Ȑ ȐEɐ//2 8'%ِeِِِِƑ8ƑǑ.">>"L.@ё@ёLӑӑCBQBCNQ0;ܑ0ܑޑߑF:Nߑ-G;FW*ޑW:*isYhZ-NDUdnD\gvgdvZNYY||\nKh SSh   ~ ~%Kne_%_ eAww}Px}7 rV< rA((uu-x-//0}yJyX8ƐO89P;==XVԐ[9FFIcI;PPppɑpXoːtՑX^^ΑɑΑ֐{ѐ{{ {iՑinnpprّrّˑԑڑґڑԑґˑ֑֑ؑؑ  'ÑϑǑNǑnǑǑǑ}ǑÑϑ+ۑ +$ ۑ$ݑĒ15ǒ1ǒ@ݑ24QĒ@''֒֒2U[%BB[Qaa3J&J`_`ghgbb6`!Aq:q45kY"j%Dk3)s&6hA~vG:!j~Y"v dD~ G)s~,S,Sy000 00d~l~!!l~=%%''~**H1H~1LL668z8z~?~?AACCceJcJoeQϒQϒuWoWtŒŒВ’tyΒuΒ’ƒybӒbӒƒeiڒeڒɒikÒkȒnonȒҒoҒsvݒݒԒv{ʒʒ̒ʒ{}̒}~Òɒђ˒˒ђ 5 2:2ē:ē@DǓ@Ǔȓȓ˓I˓MFIE_M3Փ+Փ+3~ВFEߓ==Eߓ--E>;ZGKP;K^ff7pq>EpGEHBqBu_d_LX zXx     zx Sx*Ld Y^Z||Hql%m((yuqSx.y.%lq335588:==??DDcHcJɒeeJHWWXXԒsړwړw`abœ˒EZqaÓ`lÓnp͓pr͓tw̓wrʓtʓlؓؓ̓ƓD!!Ɠ$2 ;6Ŕ !GŔƔS6Ɣ;/̔</̔<ҔPҔՔG7Ք֔ה>ה>"@ݔ7)0)ݔ"0-dxZ97@-@ZBBqSILYC֔GI}uSiiN gm% L}gN[[{coc{5:::o?u}C}*}*+}~JK3K9~}9@+X3@AACEECJœbJMMNNYnn}nӔnnY[[Ӕwwwwbccؔٔhbllnܔnhٔ۔rw”ؔӔr۔wzz{{͔͔ Ӕ$2ܔӔܔ  &  (,(,! !֔@֔9֔q֔ •ĕ•#Ǖȕ#-Ǖ<̕5̕ѕ)&<ȕ<ѕ5DՕ.)DՕB:וڕ/וBڕܕ8ܕTS/FTW8F &(N~WaSG2.DOVOGdUdPZgPgX|L| }L }   }Rfsm|Rfm!!s;vIvm+~;+~--IJJ334 |4??@BB@GGKKLcNەL͕n”nÕntntN\\__`a`ەd͕dÕiikkoΕoqruʕqu{ؕ{r~~Εʕ&(!aەؕޕޕ-'ĕDĕ:ĕFĕ'5''5ǖ::'ߕ9ߕ9ǖȖa2Ȗ Ζ<ΖЖ/ЖіӖӖі"זזږHVږ;Cܖ=UZXH$ '/bܖ;<'cL'bm g "bEmb Eb=bAgMOMA^}^}O% ZZ %p%PpP)y)tywjtw]]Ascb"#$">#B>z$K7z799;$>>AABBDDĖƖKĖKLLNONɖ͖Oʖɖ̖x̖oZ͖Z]֖ʖ]x;dݖ֖ݖdggi˖ҖmޖmޖҖi˖sؖst–|xϖԖؖ|ۖϖԖ–xٖٖۖߖߖtؖ    !% %&!'$ז&4Cז4-4 'ʗEʗ˗˗E -CCӗ՗S՗֗GӗG(֗8PS4P1F1F84T:T<[Jj<HJ(4R=M=jVnRVMew*ehIhuws)u$$$4$:$I*X)H[yXy22wwk?kl##%%Ul?.BƖB{n.v2233vO<Q{U<@Q@D\D^\^JKMMNOg̗͗OJY͗Y[—[\]]\ΗccdߗdŗNi—̗ŗn×nޗؗޗڗrrԗxԗΗ̗ڗx ̗̗iߗߗ̗Зї×̗їЗ ٗٗ ݗݗ    ƗƗϗ-))ϗ-/   /$Ƙ$Ƙ Fɘ ɘC̘C̘Q>[=nj՘Q՘טRטP0٘٘PܘWܘ"4"4W0wT`T_`_5 S::^^ ee69R>;;ALlwL5`}~}S`zWg%j9`gUwljUq33z~k3 k q""y$ym){m)EmGtE{tK̗K KK0K`K6G89:>6>8:9ʘHHIIMʘMNNRRooؗnn\\^ǘ^__͘aݘ˘Ș˘ǘfݘfĘØ˘ȘC˘ĘF˘Ϙpp͘ϘtØtvޘvy|јޘ|}И֘ј3˘yИ}a֘͘ԘۘԘߘߘ!# &FƘ#& >̘'%'&(™2™ę@ęƙBƙ!ə ə@?̙ ̙͙%&љ,*Lљԙ/͙*ԙՙՙO6&/=&ܙCܙAl~Uq(&2&,LB?F3`V` ? ?j  ]OLuju]V;h;wi~iqhwq m$$˘$V$w$$xU-x0c-c0b6bz4!!4zA~w)k)DoAkDE01Eo0QQQ1XAXAZZHHIJlIJUǙmǙlUmșst!t&t?tLtΙsdΙd[ef}ekϙfřkllooŚʚЙڙКۘ{Йř{ϙ RyҙZ`!07UVCntҙ$$˙ʙʙ˙=љ*7.*ƚ>ƚ"/ɚ"ɚ  Κ . Κњ:њӚFӚԚԚGؚ֚'ؚ>֚LGO:Fߚ8ߚ9_9LO'O>8O[m[QPOaOWmWPaRUșROPiiOOTOO|g|# }#} TZZij##$np$nj..H334848;;==??D\\DFFQeeOeeךeeQSSUڙoUך\ךך\Қwٚw`aךٚ`Ú˚fggaۚfÚoos՚su՚uw͚wzךz̚}̚}͚ښښϚ ךϚ 7"/ƚŚʚ"ʚ''Кܚ5ޚܚ66@_ߚ@ޚɛ1ɛ˛G˛̛̛(70( Q՛7՛):ٛ)ٛI9ܛIܛ ߛ*ߛR*0R<gddVC_15C^G55b i>hib>ktet^_cnpkhK{ K j/r/vrv4j4nc A xB%&pmBmBlAFF&p%x{~|8=8~=?AAҚ\Û?˚aۚaKÛKMMțQQRToΛoYΛYZTӛכ^ӛ^y`yݛeeff֛؛jnϛj؛nqққqrڛrڛޛ|ޛ|~ě~ěʛ֛͛ݛ͛ԛћћ50<V ś  ś   Л')'Л:՛9՛Ŝ))ŜƜ<C<ƜN<̜C̜М1_<М12DӜӜ2՜h՜NۜeۜS44SߜߜV0VUc(0]U](]{@i@GhW[B_s W GlG|IIs_B\ayw!XXwxxatt888uț8=)u)**//0Ov4O4v79<9<??AADכZDݛ`ϛ```fSSTU-Vœ֜_œaœ_bœabddʛ<Tmmԛr֜rssvvxڜxyݜyڜݜڜ͜͜ ! 5&" +newzlgp~! ɜ ̜ĝD̜ܝŝ ɜ! 5 :>ƝƝ:>ʝ&ʝ̝"̝͝͝+,;$֝J,iJ$֝h؝؝+[8Kݝ8ݝWHW!R6-6]`\]y@ QnQ@MBnMk[[kewlRKzuh 'l u n.gh'1go.0o=1(g77=?{&?(nCI&{CpI11O~O\89VVVŞVVGV8\E9EFGGJcfJfRRUU|FY_Y^˝c^_`˝Ý||ghghi`ĝkmܝmnoorrsnܝǝsŝyy}}~ǝȝםΝ~ȝiΝk$ם-:Hptz Н ϝ$ϝ;͝Н ҝ  K؝ҝ -؝`؝ =.ƞ=ƞHݝ@+@ -Ԟ-+,<,Ӟ<ӞԞ՞՞-מ؞ٞٞ:Bמ-ߞHߞ0/0؞-HHM\ MTT;]]A; HApqaqa||uHOKIQOKQtv! X!N NLXvxwzlx24l4 9 p2zp?**tP002246P49=6?=A9ÝYADDFŞŞŞKKÞFOOPPSSŞWܞŞWXʞŞϞŞŞXŞcܞŞŞcdŞŞhjŞh,ŞdʞpϞpŞ1ŞŞŞ@ŞŞGŞ<Ş}%Ş}ҞTŞ>ŞjʞϞҞ֞ў֞ڞ۞ڞ ޞўݞ.  ݞ ##,Ÿßß1ş/ǟ˟@Ÿş˟ϟǟ\ϟППGӟ<ӟ՟%՟TYJ"H"ޟYHޟߟ)ߟ>uIL)UwJ3--3!>?QiQ ?: 55:>>ixBCBxICM|MI!gsҟ|22gu8u8$$EsAA vEEȟEΟEvgsÞKR99RV @@V]]EEdȟfNNOkΟfkppp۞pw p֟Οwџ_{֟a_џן{ܟןaܟgOkҟklmnmrlҟrsttvwޞ̟zwz̟ɟğȟɟ؟vğ؟sn  !ԟ" "ԟ Ǡ UߟQߟǠɠ ɠK G >GРKFGРҠ>ҠF3P3JDP8G<GuGWG6J6[GdGLGxGGHD^G8HoGG<~GWGu[d<QMLGGQhS h %xS%%]]*\\^*xo""j=%y=A~A|y%|{.00.{445}:5}:<<=B=BICDEHDEHPPRRiΠiWΠWXXZ[֠ѠZ֠ѠŠ[eՠڠhՠhӠ jlljӠnqϠqeϠtvߠ۠v|۠|ߠà ܠʠݠ!ݠˠɠˠ1 3 $333ϡ33 333,33u31}3ã3ԡ83Ǥ3ԡաءF Gء3`3աJܡݡ*ҥ3ܡI¦3M3_!38G Si3iK#3K *>_>JGݡIS>FGgLgAsAIGysy`p#`j\#z\ z ~$r~r^-ua-u_w^w54d99&<<&'(CCCѠC C('}}x33x::<<>>?ŠZBBDDGG?POڠeOPQmUámUá\àv\tܠtQҡeefghjfˡm̡mj֡֡ʠgˡˡh̡ơӡס͡ӡڡ͡ơڡ١١G>Lsp)%)*#ϡI"*%" %Ģ 8F ʢ V ʢˢ͢͢Ģ"F+..ԢIԢ+=Iڢ=ڢݢVˢ"ݢ1%#%A1%A@1aNaNEaEZa_a[aZKaa_ad%[WxaWXT!KT!,X(ana],2YZ]2aaaaxȢaY##vrCn'v'BrC.G./wRw/t66tRQ==^AAҡ\^bHbHiOOikkWWYȢY̢Тy̢ܢТҢע{Ңעye̢բ{բcceܢТסjââ΢Тɢ¢ТТТjvvy΢ɢy||Т¢ӢӢۢۢޢޢ aТ298Ģ** --ˢ!2Ϣ!  Ϣ 0959ߢ508ߢ18ǣ@ǣ1̣ỊI9"3ӣ":9$9ӣգ<գ<7أEأڣڣFE4XUX;U?:$)4>)>F;ii9 _2@ B\_9CGB?\@CJMJMaqaPrmr%zzdb  b%lmlk,w...k{`f{f$n$~'~')t)-Pq-/w/xu1}1xnt678@86}w@7DDGGHHLLMNNSSMXX[ȣ[ϣ``aaۣye֣eۣϣܣԣܣjjkkԣɣ٣qɣqȣtѣtuƣģ֣ϣƣ||}ʣңݣʣݣңѣ٣  ޣޣ   ã+!3̣7̣4̣+ ", ",Ť ŤƤǤ5#̤5Ƥ̤K%ҤF>Ҥ9>F%դ0U.0դ9G&I.V ,ޤ3VUIޤ&qRV^VmR^cd3 :gCgC b__bOmx`ϣܣ٣OdxcVJ2sr(d$rpJf\f(:Vu/h/;wip26hsm=i;v=$$?\m?wP//v2QWMPQSW¤WAA¤EE2GHGJHͤlQQJlĤoĤʤɤʤoyģu\Τ^\`Τy}}}}}ͤ^ɤppӤˤӤwˤwϤz{ԤϤ{ѤѤФ !Ф٤٤, IzL#Ȥ#'ǤVǤȤ#Ť1K̤S+'פ  ,O֤C+֤,פ=u֤ ǥǥBʥʥ˥̥̥IΥK˥ΥLK%ե֥ե%٥1٥ڥ8>ߥ8ߥmͤڥSPRRP>TPMTMLOC=uVVNUO[֥LsFsv[Ubv b n]nj*j*aal]l##%%~)~)++x003355668<<AAB8K```ƥ``!`KBƥNQNQTͥTVVWWYƥ\ɥ\]ƥY]ܥ|ץƥԤ{|ȥץkȥkmmnϥƥɥƥݥťnϥyťyݥ{ѥϥܥƥ{ѥХ  Х  ۥۥ!(Bǥ 7ҥ!$ҥ7! !*$*¦?Ŧ. / ./?GЦŦЦ1ԦGԦצ;;@צ&C&ڦ,U"Xަ"ަUNH[FHڦ,^-=-2EE2Z=j2^:jZ_qr_rqooq wwq`z wz a I`I| fq4t~s)x)ta9~pq|4bb9cqqqf&&u))q--ɦq1p1LL6688ͥQd@C@CeHHIdLLeIPlPlvզWWZɦZΦѦ]Φ]_֦_զvۦئccۦefg֦ѦgݦѦfݦѦѦĦvĦvw٦ߦw٦ܦѦܦѦѦȦȦϦϦҦ Ҧe֦( ¦1¦@¦C¦X¦[¦$$((;9=ǧ9ǧȧȧ7ѧE2qѦ$=ѧ:7=$$E=;$A%TT%ABGBYGY,=,G>h>?hs bDuDbMX?GMXcuu[Qi[\i  S! \USxq Usxjz1j11llo"o"#JDv٧ר1KXJDLJ8K89N9PCCDFFئ_IIQitSӨS٨Чܨϩ٩]̧[_]Чߦv̧Ч˧ԧ{˧{ggiikkƧ֧pƧ pɧrrɧuاuvxxϧϧݧڧݧڧЧ§ا§ҧӧԧҧ ӧççѧGѧDѧQѧܧ2;٧0٧2;'٧$ܧ%$Ǩʨ7Ǩ%ʨ̨̨ͨ40ͨ4&ԨԨ֨ר&֨::'JN1NJ1R^RV7;LVNM ..MLN5 s5s;q @zsm\@NTNm|NVT\ |yN y O  O~WUzU{l  ~eW&e&zЧD֧DD0|I015K588::<<XAAԧ]DGGIIKMNMPQUUYY_vvvv_ШbШbddۨggijݨ˨ݨިߨިjsst¨ըĨҨըĨҨب¨ ΨبΨϨ  !ʨ/ѨѨ$+$ *+ӨNרר{רר*٨ĩ ĩ-ܨȩ-ȩʩBʩBΩ^Ωϩ"EөCR;#Cשө"t٩ܩ?Rܩݩީ`?'ݩ33'ש#L'O'W`ީLO W]Z]@a^aZ =^V[yfy%Fe\l@`J  Jf%  cm5  8<'k')q)+p+DD00K3355QQTQۨQTU>B>BDDF©FGHIJGƩJP˨iPSЩߨiSUUɩYɩrYZtttHƩarةaccZةhԩϨhߩ۩lߩlmIƩormrttuکu˩=[VF˩e\cѩ!թmk/qpo©%Ʃȩ/Eϩ;ϩʪ'٩٩;٩[٩g٩٩;;Щ;;/1ʪ̪ ̪Ϊ,ΪϪϪ71ة;ӪE&;תEתت;ڪ:ԩ;;%[%تO;:-1WdWd;ک;ѩ;;թ;;Ӫ7LgXg|g;bg/[;VKV[\g1[ڪL[TeT^L  X g~ []i,[ ]|g7[O[b\g66n"n"?j?&&j)),,../11334w48w8::@@_êEê_HHEJK۩hpǪUǪJU/XXpK[\ª\ª_ƪzƪzȪ}}iiȪŪߪŪĪܪrҪĪܪrɪtzҪztɪͪͪ֫ Ԫ  ۪۪.!'n,/;Q2=?'ЪI&Ӫ;Ъ5(;(ݪ'-ڪ ݪūAūA BȫȫB%?̫%̫*5ΫЫLЫLFΫ*MFի֫իMG O Q Kea ^GGNINI+S+Si W7~ W7aOGQ<v<bbv}D}vDjvev j f^fyy]vvvv9eҫv4v-eb˫vm9m9uCuʫv@vv|C|,,-.v.v2445699;;?A?5A[CI_Cߪ_I62NNPPQ«T«TVҫVWYYZZ׫tQa˫acʫcggͪ?5rԪrttuϫܫܫxuzxϫ|}zǫWҫ߫ǫ߫ ӫ ӫ|ث ث } )+1ѫ*HMΫO)+3ѫ3 ֫v֫֫֫ά֫>֫R:ɬ"*+[:ɬBB>Ϭ1ϬHLӬӬԬL׬M׬جڬOڬ۬/#ެ/ެ߬"[߬R7D>7۬O<@K^ ] جM\f==\S]vpwpԬHwyX<@y nK _Sf[0`v]0]n6  _;#%%`,hCC#,-h-{9Q~9;{;=~=׫YDDFFGHcJKHìOOKˬiiVˬVGJάάܬάάάά__ŬĬcŬcd}ܬd٬iiάĬ٬άάtty}y~}~.άǬά +ά  Ƭ'Ƭ'ͬ."ͬ"/Ѭ0/Ѭ0#۬íí >ǭ :>ǭȭȭ:ʭD2(ͭ@ʭͭ2>>1>ܭ1@ܭR>߭R߭AA>(663Bf?>XB?4X4 X<>T aTa?Z><|>Zsbs|PPzIM I  e`  eWhW-YuhYu"=%%&"++&{//01SìJ0{1S=[[B=EEFGLLBkGkQѭlѭFlQ­tĭvŭwĭ֭­ҭ­ڭŭfڭvǬfwi֭ikҭkmm̭Эp̭ptح­tح­vέ­vح׭­­­­έ׭ϭϭ   2-2,- ,-((-Ʈ$3߭Ʈ::->fϮ>ϮЮЮ))Hծ'ծ993ٮٮ3ܮ5ܮ$-'-5-44-b]]ezM_e_R`W  ­  - e RYjYjaYbab ``gn \g c\n drqwudw0.00qr  !cg%%'hhCsoICs22I66NN|S|S??ZZ^E^HIEIȮOxHzO{ʮЭmZԮԮˮZͮ]]^xzˮ{^Ӯ~֮~f֮ӮfnoʮȮۮuuxۮxo ݮ~~ݮ׮ѮҮخ׮ҮĮڮ®ڮѮ " Ů"®ƮHƮĮɮŮ ɮ#)#33ޮ&*ծ߮&(Ư7*ޮ߮ƯCF)ʯCʯ̯J̯JLίϯЯίL7(֯K֯Яϯ>R>L$ݯG+$<M_N9ݯ+8 \:M\5Nk @k@r u YqKLGRY8LzTz<RXPg`.SSp!:Lo'''Ȯ'ͮ''X`a.p,/tatg  ;""ry((y++--..0wv20w6677:vQ|=:?]FFIIKLLOOPQnn)n(nLnZZPQگǯ}گaxKa߯߯ү}߯߯߯خү߯ ߯߯߯߯ǯ߯v߯vѯɯyѯyz߯z~߯دٯɯد~ ߯߯ ߯<߯*߯1߯FƯ̯R֯_֯9֯<ð*ðޯ<8ޯ1ʰ8ʰ̰#̰ͰͰ95԰q9!T԰#TذEE)ذY'۰Y۰R4T)$'$T4R%P%TcTVTcV``T_TjTb;STTb_jUTTSdTr  gTkT|TTVU2d|22gk!|!##?߯?T????F12818<<?BܰB?GGKKLPְLPSİİ°SٰWW2Z[ɯvvٯv[ܰffgiְigmٰmooqqrrȰȰwZw}}~հհ~ڰްް  ڰ !̰ 4.6.R4ݰ6)ݰ'4 )E.ɱ ɱ.̱E̱ͱͱбAбӱJJ ӱ5;ױ5H4ױڱR;ڱݱOO@ݱ߱'߱A.HNUQN4Q/=/TV=CUFFTV:>:>vvC]X\XYx^l]T_"\blYjb*xa*"^+da+s`j_sx2| | !<d$%!B$kB%x0y0I445kx7y°P7c??LCCDMJñDtJcLMƱmQƱQTTDZX^αtXαα^Աeel%ƳlmñF)yyޱٱޱٱ۱۱ձ4Tx. ;:'(('-.>.ұ-ұֱ)/.)<ֱ".W.;<²;²@ڱ>1#Ȳ1#Ȳ   / :*:ϲBϲ*"P.v.GSBGO&O۲K۲&Vf.VS2K2W6aEl`UE6URYN  RssNPvfFr{rFw{wZo+p~up,h~+8coZu,c7!ch8!""@@tCHt--H[2M2òDZT]\==\[]Ա^`dd`NNPòPnmnmYx]Y]aƲxxa}ʲ}ffiܲiѲʲsƲszձzܲŲѲDzݲ̲.ܲݲ  ߲߲ܲŲDzIJ ̲ IJ˲%+%&˲+˲Ҳ(,Ҳ,ײ7)ײ³::)³ó޲ 1޲(&ó5&ʳʳ˳aY7&51˳3QֳQ &ֳ*@&*R#R߳#3&߳KALLA6cb6cT4O4OK@S<_hb@T@hS_joDUojkDHkjXV JUX W/e.JoWZ/[Z.[yye!l!$l$%mn??++uG}u2G6}2699P<<@@CCD``DKOKOggϳXϳXγwiγγ̳wxij̳ѳγxijdzγhdzhilȳȳl޳oor׳rttسyyس{|{|ѳͳڳͳųųڳճճ&@<oy""##ƳƳ˳#   &7.7;?´;´ô'ô ȴ/ȴ # ()J̴'&IMдIд̴)ӴHӴHQմN:մE۴N>:۴11P-YA:/#Y->HEQAe\Ve\SSn pspcuq=qvwjwm!Ln%%%%γ%%Lz}0}f0fk33Bun99%9cn%'')B,,F=v2244~99::~VVBBCDFGJDJĴi޳iCδ׳iiUFδUGδXƴXcδ\ϴδ\]εδ]Ѵ`Ĵڳ|cdδ`ܵδdҴѴδʹٵδδtҴƴĴtʹwwδ|}|ϴĴδδ״ش״ٴش0δ#Q:nvڴٴ  &.?( }!JȴMȴ6"3$$P۴"636ƵƵ6<!11̵̵εѵѵ<6!S׵S׵&E۵&s۵ܵEHNߵ**(ߵHIfjzkIefe55e^e^@e@xexvevRrRgeeruuY g   )))egzy8z{hie{8e$h:$e*C*,p,ĴG.G3.3p 88:;;: BBEEFFHcJʹcccHQQJVV͵YǵYZ\ʵ\]Z]ʵ͵͵͵}صmmصӵµӵڴs!6z͵sµzǵ͵|͵͵͵͵ϵҵյϵ޵͵ҵյ޵|''+ԵεѵԵٵ+1ö1öĶNܵ(e͵2<0<Ѷ0Ķ2<Ѷ%6Զ%Զն=9!Gٶ!ٶն=LKܶLKO>RܶO>?Raa&?gMgYM@NP4Pyi@b[beeCnWnlfIfpI$q_h(_/Sp(pql/5Shjj5D ` `r~##&h((orD&o//011353:5:UTZTIXwFFUILLNNRRʶWWX¶ 6``߶c߶ce(̶ɶemɶmoӶoӶƶǶ0uǶwu{ж{ֶ}жȶȶ}ֶҶҶ׶ ƶ)¶) + 6Ѷ9ѶGն7' 474 '4 ˷ )&˷̷ͷN̷*ͷO 4,Qӷӷ,4CݷWlQ]Q[ݷ߷]߷[<[*4<?O4?Q-dDh\Dd\-Q8SvS_8DJ$J~]J~~  ~Z$l·~lZ0q_vhk÷~޷~ h !!:%&&%,x,--Iķ~IʶI~qǷ~XXBXBDE`EIILŷL̶eNONOUUշWWx\\]wwwD]·ŷnnopp޷׶o÷ķxx{ {|~Ʒ~Ƿ۷۷Ʒ|  +  ~0X4QD v..61ַַ2620¸¸Ÿ3ŸȸAA"ȸɸ# ˸<$ɸ4ϸ<ϸӸ/4"˸#Ӹոո?7ڸ?'/Xڸ۸5X߸P۸5߸PX`KQQ(e`XCX30fXdXKaM>sea>uyukVzVcCfd J) *gMagh*h) ww[_cz[j _ !i!q%%j)),,.H.H}446S}T9TkշUSq]G9GIIĸĸrݸĸTkkT޸ĸYrYZ]]tZݸܸǸܸg̸̸øtg޸Ǹkĸøkqqxĸ ĸx͸ии͸ ׸׸ 1θ"Ÿ Ÿ$Ÿ θ0Ҹ'Ӹ7ӸҸ-0-¹=¹'= +8(asyzϹ+Ϲ;:'1 ׹;׹18:7H3*7߹OXO*L<@X߹3<ff2@2?>J  j  K> J K5?azAJAaLHi!$M$RR{_MzB\D{\zdd^Em6ĸ66H656z6##mzsr&&s(_B^DE..GM0vvvvQ~Q~QSS==[AA[EEGGùǹJùJKƹKPƹP̹йS̹Snnƹƹuu\\ع^عι}ι^ɹƹĹ}Ĺggʹijܹʹƹijܹpp˹rr˹ƹƹƹyy|ɹ|ƹƹƹ ƹ   ȹ))ȹ'1'ºº?Bƺ?ƺ""7/к-к754-4,غ5غٺٺ/ܺ,ܺݺݺ$1*$_3232TW8N[N <6V 8YVZ<ucukZluYck*_buvuuul6_r#wQT_W_wX(Xbv0ƹ00_0u0׺0f[_nm:m:n''CvFuoCotFztǹG3z3˺u77RйPR==BB`^ʹ^`HIHIúxúTTV˺VpѺ׺p\Ѻ\ۺκx_ߺa|_ۺ|h|ahjjlpϺpuĺ׺׺Ϻ׺uvw̺Ӻ~Ӻv~Һĺ׺ԺҺպպԺ w ûĻlP ż1B ȼ)-)..  6:6,û{Ļ޺+޺+ ʻʻ  UCJֻKKJֻڻUڻܻCܻL?߻L߻9MZZM4;>4>,:NSN9?;QS;?PdPRsc:sRdEEiftWO  W^o ^ ]YXqYexbxbe7##$k''B]oxx$qo11Q6688;Q;<@<@AACκ\ߺ\C»KKO˻O4Pɻ˻ŻVɻVYYaٻٻwwww:wa̻cdϻ̺~dλλƻnncȻӻͻƻxxȻǻ||ۻӻǻͻлѻػջۻлջػѻ- ĻĻ?ĻdĻcĻһ2&һ&¼EBļż¼ļEȼ9˼˼̼ͼ"Iϼм!7ҼӼҼ3̼ ؼFӼ%ؼ%NFNݼ*ݼ 9ͼ!*Nb]ϼ" bitм(hehsgOox»X (7e s37TTfwtwuSySk#M}^  }Q'Q`~W4~j4j::&ooi&HCŻC,ut,n00zHPƻP=PPVV=[̻V[F[FJJl;ϻdTYl3VmVμԼrԼɼrmμټɼ``ټüּdüּdռmmn׼prrtutڼp׼uڼܼܼѼʼѼڼ  ޼2B߼  9ȼ 7ȼNȼgȼIͼۼ ! 37#31." Ľ1Ľ޼ۼ]ݼʽ!߼ʽ7.4H9ҽHҽ49ֽ#ֽ"Iٽ2Iٽ2U5U 5_@ft_y-XBM^`86@ -ZXZBZ8l;lW;gWGzA$ziռ$YWZY)gZ[GZ)q)[y0:qk!k:!s<o<<s)),,oLv3Fv{L3{PyPRR<<=\=A]A\]HHILILNN˽nnZnn˽nӽn˽[[\\˽|˽ڽ|ڽfʼfϽϽӽoossǽvy߽vyz˽̽׽ǽӽ߽ӽ̽ݽݽнν˽ν ۽ܽ۽**ѽ "0+ "ѽ0 ؽ #ؽ..#;6ž;@6žƾƾ??>̾@+̾;Ѿ727CѾ6EC8C־־ؾEؾپپ1MS1B޾M޾߾K߾8-FK4/4A-5/XaXe9V9]GDJ]5FZhOZeaGODPWJQdq:d%Rq%PUQ}Rwxw}``U:"x}"`}}rt&&r(*(|{u*^L23662|::<T<?YE?E{^ǾiǾRiRUoZZUξ׾eξϿ׽zнzzzܽze޿iiʾmʾmqqrrȾվϾ}Ͼ\}Ӿɾ+6Ӿɾ׾ھȾ׾ վ׾ܾھܾþþ >ž##C;4;W;;};2Ѿ4$4۾ Bؾ 5۾SؾǿǿF˿B˿F8B78YFaVVPDhVٿٿXXW\Y߿\߿Pb^WbDCDC`[`.9a.];9aG;f_fpOSyySO~sus~t"j L u(ju+gc+hck{//z3L~l{3h6"lg~"k~?׾??? ?.xEEz~.1x~1Mt|M5v5v|~t~QQ@@AAEEGGdJdMd̿iMiJoѿ̿oͿ^Ϳ^__ڿ̿cѿcee̿п̿̿ܿڿȿ̿nnӿܿ ӿxxҿ̿ʿ~ʿ~пۿƿۿƿȿο̿ҿο5  $  !!Ŀ%Ŀ%7ǿ'Ͽ'&Ͽ6&6#=#޿=޿^߿LCL[FBO]GF_O<<HN~̿4C 4//NISQ IQPS>iPK``  >oaaoKV?VDRrWrpZ?ipq{k{mh$mU$+q{h+R+UyY2yY2k9d9%Wi%&&**+s+T//X6[=T6=??X[D\bDjbOܿemOjjjtutu__e effjjllm;p"(pxxyy   ",3CiZ{,BH-30-0@''.4@"A.$J$P1P17U7BK (>KCD>E8X2QUJ5T: 2BJ 5E X :989 FR{(JFG{k|Gk| Vdstt   n n}sV{+sYZZggq  ";''()).o.11NN66;;W=>W[=\F`>`[NNFQ^mmmQZZ\_^_zzdd "4xx{{~~ z ,- **H%AJQ4T3/3 $G3CB$J%3G3 3/3224B3R!W!Y]Y[#[`78I8a:Abrba3Y  } q :BLbAr7`L#`CPiCbP"io(((fy1Pbf&c===&=)u)+m+,-cuH3}}34OmO<<XAXAeCChHHJdehUUnss]n]`{j`jmmqqssuuzz}} 3`b!!      ..'4W]  '2 H626**(1IL(0"Q0BOD5OB"7P9PV\V07D1LoeMeoceeeMTZTeycZ[Rwe[ev^v_{e nr e _ neeg44cc$ec$&w&p??**xpFx|F|JJJJJJNNW<W<AABBFFIIJJNNPPSSUUVWVW[]]yy~g~ghhnnrrtt[%%e%'%"5D9\%  00'+(+%1 1'6 'E,E,%=K=KRCLL--%ZCRR6'^{r`ZCX`XDY\8D5 8^5uso \s^gvQxxQ!! HH uY y_y))_aw||z4{;zw|vo;4w{BaB,,--J115599U<<>>AABBGGHKKLPLPQSS}[[``bbf}fhhkkww{{j  (  _&*W*40$_$00%!0I0!I/0Yox07887y0!0l00/e0R2Rp0.2.}0aUauU |    titiuNCNCxdx  y(VVgg'(O'yOq|3q3jj l5 ""$e$&p&'D}'~mD~mHH33:QQQQ:<<>>@@AAFFIIKKMMhWWYYrwrwwddggjjkkss0( &4     % % %2(Ud(6B6!JJ=!(TNHNT=2C)CL42OLD-b-PmDbQ5lUt5QPql;|qzUpzp;vnnz  rvzS}_}{u\3?iSzrzzih?'{zuz',,zV~~y23\zzzR2yzVZZBBCC^^``RLYLkwYZZ3wbbd kkmmoopdpssww||       &B-=.5H))O-549G(.5-z5\Sm&<G5t4>9\5)\\>4EE6*(\^_ 5PSP6D<\DSq[^?q?rhxFM!!xNM N *\^\]]//3ll77t#%%#t'+'u+n.n.11u7v79{9;;>>@A@v__{_dAffQQRVRVWss^s^_aacddcqqwwyy||~~&U  //858*4??2-:0-03:35&"*5&=)T)[!Fr45XNee6eXDN!<"=%eDYejemi\emzzikxeekGGb  U{pUb ses {e}seee[t[s6 $ }$%BA++B..004488::;WYBBY____d;NNQQjUUrr[[\^^ccdedemmovo vwwz||~~z 5=T 2!**!  5<N57/7991GA/G12?M<2<*ixbp?a`#`>KK,aa>gaWaCTCaaaD6aVXtEtVaaRtaRhDEaix  %W i%%a3aX,Nah,Y[aHaWxga;lFl*Yx*x.FH5}.Hy}5x88;;U=@=@\\\\\\KKygPPnnVVWZZ\\]]cceeffjjlloouuyyzz~~  / A M!!44#T66A6,,0:#H:10""1Q#QIHIx><? n >_7n?_bMJJXbBMXh{h{h  q%Y%qv}r}v`2m2km 9k 9si$|$s'CC..2'236P6N;;WWWWWW[GGHKKPggPllllXX[[\_\_,h7>hkkl+Srx||~~l4D/Q_A**  &101//4< (4A9 9!(!A<C7MCDM#W"R"5BWRDE%Y)h%5YIen^IEDBenY JDr  AjDBJ`i|j`D` Qom opT'poz,fzfs3s]yyb7!&Qm!&>**+..HL3L388SSSVVX\\\\\\IIKKNNggqVqV\r\vvaaffkkllwwx}}/DmT&0<%,')/'/ #  =0=,%  )e )CM^CO-O-P1M9T91#H2M21W^> J^> #THTWT]s]q]qsgmbLPMY~gs Y JTb+i.ZZb~4ms:r:#jr'p#j'*tD*DuD|Ls0|0tui~66p;Q;XXBB\\GG_IeIknneXX[[xxx%x)xmmww~~,3   0 MTs~Z9>4898> 4 -+-+4.4M7.M  :7:<RL<O?PQ?=]LRe5=2l2ORYTHnH\t\e]SNCTSo  |QP5]hxxx,ho3@Ylj;%j%&i&@TlVpsWIIIIpz558z8sViWUUBBEEGGHIHfMIMfVWWV\\uubccbhhiikllkyy~ ~   ''-!-!RP]F<F (C(JDlNCo<$D/ZKJ$*nt/ZNX7,``U]1| ]NzU <oUm:PCJPYmLfpzoQ{UL{7Xz&&&pQ& &,X^[^n2q}n2^} 8$$ q'')*+sw-*r-s+T_77>dewT>@r@C\G_COeGdeOQllQUlYY])]__|U||i|ikknnqqwywyXU[<J*K ,  / (EF:/9(9M1F581:Yf ,MM1#B#[#f#:5M^K^MKMB[fMMMMM/M=0M3MD}MsqMmmSM=I I Ms[D*vcSpv22j7AjlhhA(l(Ep,~~,-E2-2LLOz99z@UUU@CC\\IKKIggRRUUVVYY[[xxaa||gghhknnxxzz}},0N\k  #e08%07/6/7%EM:M1&E!1O!NOS?S\_L_0=e\ =XeQ fQfNisesiZcyyeXveZvlb b jmtylemcjecee{{eee<<o&A))A+&owP1K34|P4~|31~C+[CD]]DLLddUUVWXrVX^rz z^hhnnoqovqWvyy{{}}~~  %6  9MY(I -%% &: <!<,?9*>*>L5E5E66B,!B9MZZ'0M9.0.Y(IT/Tctc7Yp:/[7pF[xFxsxxrxxMxx s xxxSw+xx3rx ;##;,xCxCC,-st-xx5t5xx99::\AA\DDE^EJJKLggKU UVow_VLu_wccdefeiifmppmrssuruxQ- udNR@ FYx!M$Ik$ `146;..';61%H%(8(642NR:7XT'X7@2HT'FY3\3/gg/<hS =jljGo<oZx[M=h I  &`&W k&W-n[ZYGlb!!:$$n&'&'-y-//0b08zL8;;^>>{^qyzOORRUUpqs4sssHs|{g|gkkmmnnqqst v|v~6*|~s  t  .1.58(9(6))*4,6<,<\hlZ4QGTGQ%*KP51+*cTQQ%Qc:SXaXjZjKQPQYbYVp+QSQAVAowwzz e{ e l lr}[i[2iu2y3xud ;d y+3x+,,112626;\AA\FF;LffLQQRTTRYYZZ^^aaggmmruvvur19&( 0( 3:$M!aZb(3$I (M"IU*p(#o{#Wd}]/]X*U/r Sqq<[iVizN%zOt[[X-Ot%{dW\-,S]~2{\2y ~ h=&n=n&((DD.s.Ps23w2wP3:yR:<}<??AACC__eK}KeTTUXUXYY\__`bb`ffiirrttuvwxyy{\uvw{(!U& x  0    7 ! ' "  7! 54W4=%5 =%DBG/#B#G'<V^$E$W$^6S6EWZN Zooaga>gzos>WsoooPOh     P |  |jjo]kzZ]m8"o}l"#z8}mo++--o/1133NN#}RR<<>>?B?BCHHC/MMRRSVSVpYZpY__aabZbffhhjjnoonxx|}}| D/$,$  $oTIS,IJJT@T@%Ul.0'0``'44DO%T i5 UT[5girgr.T[lrk\elyr\mrgk   l ytrmtrprsrrgrr""~rrp{(,Cr,s2rrr23M({7783~8<<>>AABBEELLPPhqZovqoZ^v^aaeeffkkllnonorturut ,  !) 1 565! )'rFvDJFJD$9$D.9F*/1;?ek:.FY+VIY0;FV@g*F/F?FwRwC|C|gvN:FT ONR+F@FOT"vQv    \ Q\vsvsGzx=x>{=&{+E+,G&/0,3466774==??AB^z^^AJOOPQP]rr rrrr]QB}g}gJmmqssww{}}{ 16.$.52825989@EH>>C@$C1H0EI1*:FF;R@*;:^^%^<R^ID ^LH^UU<N_^KDMq^r^LDIrD^KULGNMGS^f%^V%u%tft~V~u33333z vh"#"v#**++0J0226699:zR:@@DDGGHKKeelUqqqqq$q]l_dU]d||kkooqssuu{{     %-  % -5/88B3DS35;/;NNEE!B$!$BI)'<I)<'4>`eie4fPfff>fffPfifpZ&pvzv`QwZmwPTmh      ffQTz&,g||,ffgt11yt7y7&n:n:fff&AA*x*x,LH,HHL55::<<==@@W^^_L__WLMNMPNTTZqqqZ[[``Pdeedkkmmsswwyy}}    fa0(6CO0(  86b>8>!!?C?UXUO\^AV\Ab9c9fg^c3af 3hg 77BhqB q RBRzvzviaiYxY{J J a~%{l~oa%o,++r/Dr|aaan;/|&pj&;|EjDFtpEtnFGGuu44Q889QT==??[[CC9GGLLPPXmX^w^wccss{{}}     #  #)-).1.-/17;75XV0F$F:WFF<HMH>HYH:2<2jHFFMFF>OSlxOQFTHOF<hRhpH:F>F@FAfOFsFAQSjYFx x   p   g TgVm~mi~i|[|k@a  ##$a@''**C-..q225-5U::==UAABBFFGGqNNQQSSW]]__aadedgekkgttvwzwz{~~v{/50";"!H~[k/)/)!%38H3%01HSRI,1f,J0774@C!I4J@CLOKDRKD;9L6V O>q;oq>o`YyM}x`q}Mqcqb$$$$$Y++cZZ|q<hqE|?irq!<fPhqimmr?fEusq1u1!8bxP8TCTWWWqWWWC_FF___jljlSS^^_b_b~~i~~iqruuvq{{~~vr8  //5"56>&E69R'E'R.R.E6"2$&>2%;YZ;y %Yx>]L \\[]L Z 6GhJhG`UxKx KyjHNUJHs!!N my m  } }jkakaw $s $(tt(p++,--0033,t66O9:9=>=@cMcwMOiRRVVz|[\^_[z\^|_lloopps">E'!'A"E"J*$[H*!?A?#Ii.If#.&B7`)P7B)J;Pk1X1d2GdT&IG/L4L/X D24 kk<mHcmDTs`c];I`ZU~Z U p(ja8e8ezC:q%q%@((EC-EJ-JOOOOO<<>>AACCjGHJLMGJiMLsss||eefiillppqwqxwxyy~~!IXT  & &'*'878#  # //++!W1D19,I<]DH!9)])d)9h){) 797,]~dPP::KgN?g"dzKaN dttz?zVVO.d O"RR^YXY0^.X03h3rb66rb d !}!{;'}'Bj+j+Q3HEHM3SS<Q;{<Z@ZCC_\@JJffmSBf[SxxxBnnw w} }~/X.d|Z~ E_ \m[*7!  "&) 4&I 4B"0.-.-B=0=BDOODHBB8K"8LXXLM9Mh6h2T2l IilTIPZgZgPijNv|vex f  (koo((ji,ky,y1`1e|p`%vx|Ni fp%m'((++,'m,u11z33zuQURCVV>UQ>[CE_Eq_LROOQQLUUqWrr\\]]``Wccefg "eqssuu{fg{q      $ & 0!0HK  5$"96Ti| "/#MX)P#X.)TDT-dYD2VYRVh2bhJ?[b[Jd|}a}iSSippa   %|ntn*v* Zv4jjl47d|7KlCKk44Q==m@+ 5I,`6\p@^kmUUVVXsZ[[``a{ddffjjqqssxxzzXZa$&!5  !!+.1 .-M- P3&3-2<2+>/>R I5WHW?0B"0'L',_P_"B?;;AC6?AC\t DiY]YEk]k|MD|#pR$tgt vR#vlg$l% ^c7h%p9mch7m9=))00225599::}AZZABBeFGHdeH}Fquqq\]u]b\byGffhjjhlnryn}}lr    1 !!&   # <   > /#V   $HBL$k  p I 4C4C(;<Pa ;({ <z >iEM  X=X=V->-^i^iNDpD?kEN^KKEU`UO_Oy|_y|IoW o  c&&aTdY) dpTc28{222"{8~!~!"@zJ(q@(Lzq--MGJLM55889<<[[AGAGHJJK9sgUgUttss ccffK$Hkknqqn#||    ''$#% *%* >z>+6>6LM)3^?+&NLLM&,))I,^`I^FF^RWR^YBSW==lS^B^?W^pj?^MOsp^j^oRSdomaO^5s^ja:md@:g%h%(t@(ht,-,-w2w2445g5<<??AABEEHBHKKffSSTqTuvvu__cceefggklooxklxyzy   f ^3N '**'0$o7@U@6@M@[@/@8@o@67\@_@`@6dp~@l@@@{@MIMI d$0h i898ih9`[][`jp~ZZ dn NnNv"vq".Otm(Oq1.1m"^;r;"^==C+sC+rs.wJwLL5Jt5P=VPV@.@DDFFuaaLLM|Q{MQ}\u\]`z|{}]mm`0xx'    )2_)%%$$,2,2==&&-- 8/E??CEC 2GRGRj]82[_[aBBHg101g/2IfnqInlVlTooTy^!J'^JNaNa_!z z sU#'g_y_#sU^_hd4hp4b#<bgi<#%d%i())-(p-ut3u3{6{6S}SPS~}SP~AA]cFFeLLcekkQmQUvZZ]]^v^ddffililnnrrtt||   7557$;$;*BE* B ,;H0!fq,;!;+G>;>+RR;V==48;aea.8S.Scc;HC EH:_j;{;Ck_kV\hgVkM Mh  p  z t)))WWb9{j\kvm9""$u$%qmuovqp1s15%w577xUU;UUUUzw]D]sKDKfyfQQRURUX}ZXbxytZbdd}n npprtr~~  : E/0*!# G <?E<@40e(/*c:kg!#:(@+[[+E,&,-eAgA-hkhcIIqB^9Bflbf\9^jsjwa\^o"ai^iuows_4_1oxm4xo7uy"z"|%|%&&ymzo0033MMPRRPRR@@]BC]``CLMBvL{VVZZU[v^{l^lnnpprrttvxxv^o#?@  $$   !!  88 //&egDk >4156HqH>DEl,4D;,s;91D(6DYPePeEDddqf:fssNR9D]c:Rq#](DKFYDNcKTiF#"i#&&TSgqkkq""##&&((qu--G/GM66M8;;??[[[D[q[[^IIMMNNTTWWo[[\tx_`aee|jjannos|oszz}}~~) )%35%3A%3A3*'3CC3''*+L+3P2ZO$OVZcZ2PZbb]V2L3JJDUZ=:ZS!={^{g.qcPSgSqQUZ^!u&Xt0XZig.i0Z/Z8888#8#hu)h)*xBBux*1137M3788;;<<CCEE````3`MMOO&UkU%kYY(]]zcjcjn=nq>qv vwyy}}w   ++$$%&(4--$ZT&5]=> D&.T:.KK,//LG0LQGXJ,TX[T[Jfh fo bobxTtxzTziiT^R |  Z|^TZRTp |22  !r!$%%((**,,--12pOOOOOO21`$]]`aNaNSSt\\t^aaeeh^hikkmmizz{||   45  ""& &++;:#+0#+;+FE'4E34Q+FQX>'>hXAZA+V7V/H)Z/V)Hj]< l66kj6nd]po<p lnlodqJxrxJUqUgRg R  .O0O**..0.YY l88=$=}$}BMjB//33LL::;;[AA[CCbbrPPSSUUsrsvv``{ {+{7{H{lly y  :3 % +'+..88 >" "0&M6>p0<M1<&*1*^\T\9T2aa2=9b=^>VbVmpmW]?LWmd_dL?#u!_udcBcB!I#hI h   ,ZZXp[,p[55gppp&ge;p&p**,,-.pp22vzOvO8899;;??AAfEEiJJ-fMNiN.kVVWttxWxcceelloovvyy||%' !!" %D%(# 5 #B%H$#H1H$H>DH]jH>IX^:CCK1I:)DYHHXIHX e HjHH^IDD\Q[\@uHQjYxH/``d'Y n d'nP&ZP/Zz2qq  "$$'')),wwm,}//004u455x889zV<VV<"9KKLLSSllY]]aYddaoqqoxx{{||H?} ( 5#!B#%I%)K((>=>+?+M@MTIT@[66^@?2M?>\CQW2?E?UWE\?EUeZC?Q}GFGbHHe}bX $ m$}$$RyZ}}*Rc}_*}ss_kwkz99}mc%m%&((&Dp-p-//~1L1~L5zz8V:VAA]D]HHJ5H98*JqlVyw:DxIxX! Z   L=s''00##I= @=^C*2 3*<KC!FF!47<2K)4>\FX+y>IX+7K2Z)2L3@sfOfMySMnwRSyPnybp b dPyRy,jjy?ud,u/z55y555<5:j##'~?y'r+D+..//N|5|N5889=9=~DDFFIIMMSvSVVvvbbccffggmmqqxxy@27\y     ""%;%;< 6<6171$*$7Q0,0J33!J:-!O&B&NUN-*7BQ7Op>dKdKC>TCd@rPrOU@d\^^R n \P^~~r'TdYXYnX][e[]she888s%%&'&pt'p,,H00HM{8{89>>AACCEEGGkIJggggkUIUVWVWJccgghhkkmn nmyy{{~~2$($7,: 1!UdPR 2/3/1F?#?O<OF3(*;DHD;5+-)+)i)H-X<*<5@L@ZZ4B[hioloKBXKjjp N MesPst&QMlNeQqxu(`9999939Xlex`r()T*++v)x3vt35588TTUU@@CDCDFFIIJJNkzNwXX[[\w__\zg~gkklooppttyy}}(#$  $#<<)lpeuA==L#4$<PHf$=PE!E$A<`U`d=GRbB GbP qRB q  qdUss>MMKHf xcjrcxOTj  T at******z2z]2~~]55##&''&--za11336{677::;;CCMMNNPlllllPt^^``$<qqttuvuy|y|v1  )"+(E"?"+(!8!!UR>)<>< E?KHKBHYHJTHgHJS9DWU9SBKWDSOYTQHT >jZjghQh=@cpww@k ckHHH  z T  aarR}{3Rr[\  ;;'}r'Gnn{++{zpG2[5529P9\XAXACFFCKKNNQQTTUXUXZZ`vvv`ggiillnnttuvuv~~  H  8)>/")")S8U"#%8";#!::$H!"/3/HOLZ6<6;"=$"LOLD,DprW,WO;^am^O\aO[bY][=Y>>VmO{\O j jJ {x J&bOex&eP.cd_d.4cff4yywPx_xoh%%zwwoFF1zFFF122x5ww::|=|=>>@EEHHJJM5MPPkkUUVZZv}``}ii@uvuvy{{"Oxwo%**"3-<")3??3 G BCQ)F<=]V<BG#;#+FGLA LRD+;6;RAD 69pII;9KYQCNwNXNwhXYK m  mS S |s,s|t,t0d0d555!!##g@w@+ +//113x38x8:;:CVVZ;CGGIIbjjRRSTXTXZZ\\bybbffShjjhlmlmvvzz{{G;p - $))C4)&4999?&B$?B<M<6Y``UAN6MSYM@o@kt=NMsit[koNAU=oOg# O  so _]]aaqqwc  !'io;;!g'g++,..//669}w9,Z}_FFGIIGLLQjjQjUUWYxWYxyyggnrrvvwn~~ "$"#?(- Mo- == s?UO?*P*O$&&MPMR[%)H*%1`H0SVlZ;ZDDci<ic)qoo\cPX\Lv <c!Xq;UEJq!jbix  {d#E/DOEFSFLLMM`SSVVXXZcwwZ wwVc~ggiikklmmss{{}}$#( q' 0R1 0;c\0GRHRPP#TU@TjU]UfU@YdUYJ+Q+Q[J1[W1Wj:9:rvrlUUU\b\^^hU]fe"w"Ne N `_ja(U/ap/4(`dn4qpx7/l"oon''"t**F7qtx3u35z5778SS~8@@AAEEFFcJJLLOORRTmWWTy\\]__y}}z]iikkmmoovvU $j '   GH#$- -49;9# ..64%%MD:D$C$QUQ92V2v;Cb<$6hbfbej<we_CXgpspXClhx{hlxY{Yny`y u' `'q|c|//t1r=c~771rt=u(n{Aq{}(uJJ4}J4N8N<<Z8BBZE_HHEKLKwmmVVXXZZ[[w``iikkllpuuvwwp;# 6M:UV 'AA9 )f )9g=s''=$!%!"I{|ONnNOm_y"9I9m6:6F nxFxqqCGCaChCG#ha PPYY# #WQQWbr4r #c#%% s)++.|./)HL3bLL:/:;3|cDDKsKL;LiiiVVWWvvvvaaeeggiijjnnqqssuuwwzz{|}|{'9N  $%}(-*-0((10&2<2&1"8"8A$!_IF:IA<?CC(?!<'FZ'CQZFR,hlh,F$<YQFkmkEdPdYleBRF\BM\M~ xEm~v`vp`33p_"_">>o'o'))*+*r.4L+4 ~.<<@@rEEFFHOHOQQSSUUVWV[]^W]^[llppttzz|| (<Flm *(! #( ,9,(901!JIJ-7&7-&J\\I:_?I:NIPMI`IXI?x N_ sI \X`bhbyAysGGwwYw   Y  i +iwdwdqir4r ~d "k"j%j%qw'(wEE({'//22u6{6:~:;VVVFFHHkffOPTPTOWWXXtt]``e]efmmqfuuvvqzz}~ } $~#$&0&1+1*1 44! 55+CC<=?D>,=IDLL-,h?IA#-Ewu>IIga#I9EIjgIycBc@@MSMaI.RYR Z{  Z9 Y.w';;;I;;;j'))**yFFB6677wUD]DEGGJKLLKPPQQmrr]]|aa|eessuuvxxv{|{|* ! ,;< 9+ 4F9 0&1"("048:,%@8-% HHRM. FM;./B/S_\1-:_323=h>{ W>\ B N2S\WNF\=\ShwZ  wOZSO'iTTZiYYd""?kk??Xp-p-EJJJJJJQQd`XBBCCf`MfMOOPPjjWWY\Y\__abaffhhik\Zkwwxzz~~+4&(%)%:@ R+&+1;J  ** ?00F?F/FF6FXF.F/6;1X.==F7F0^F7jFZF^jZ799FvvFdFRF=lFFdqFRyF ql ,yS|Qe'Q,'|Sec{Xc  {c&&''mm11446677<WAACCG_GIIbMbMNNVik<VWZWZ\\xxxxhhkknnppsstutzz{u{)&1F+ +3 3  =>=?9DDJLJO,?>Q9>QRRT.%`%`X//X]X]fbb f;:OL;mmgPS,LTLqjP}qo_K_ .LUl)Uva~Y)aYwl}jwxoj@$$|B|@(yyBx~/(/1133466747<<@@^^ddLMLORMRTV\T\]^O]V^kkmmppxx|| >L   "" ;B !!  2  859582:  B+G;+??GNN==:g;Sjv)WEU)GADE-A>D>KY      G UH~H-`WC`C`a}`l}%acZyX}cZ%ylWX[YY}[} v7 dv&&nr)n)*},d}*z,262z}688RR>>??HHIJPIPJSSpp[[tt__{cdgcgjnnosjosuuww{{}} 29: $$  0DRy5>D0 C}5MD<M<D;7 ;7%3FQ1T%TDK3AFKAbOOEllQk1e  k9e9fvRf=Uv=bF!yiiVUV!Z'Zt'xr&/x/|hht  ""%?%p(**y(|JW55XpW??X\EE\OdddmddOTSSTWmWrrr\\waaddjjmmoorrvvx}x}  !c  .-!.-//!'8!4!!8'4))#!F!9E7$7F9+6+$#C0C#fcGMcfG:L:fL=M=BUBUgHHVRlPlnRnsgQh uu y2y((&iqgcsc;biQc&Yq2kgY!b!hc#k;w<(w(z**z{|<p.P/t1334p6.{4X~X1[6[dKKOddOPPSVVSZZ\xaxxa\ggiimmppttxxyy{{x   2$2-$-60BB?'&&?%'QQ%XDVX8D8Pb+b9;9RY= RT=55 cUU cT:zALzuLu FhGhFdG Mk rrN)Mt#|# (N)e)fef~/////7ss7<!!j<j@@>>**I~1~I1334WS::4[WZ][CDF]CJJPPQFXpXYQYbbggiikkD;Yttyy{{}}~~    &&'5/"+EHE((L':;LIK08++K/5Adk60@@6==,7RUR7cN7NU7;;Hchdhd|jnSn|h Son jhonplo%z$z$%hlDDD5DHD8DJJJJJ778:>>AA8G:GHHNNORRqrqrZZ[__accallnnp   "!(!I4 ,5,@#@?B#,C7hnD*B*DI9[b\pb b b b b=9 b b$ b? b- bA bJ bu b b= b bp b b b b bI b b b" bSE bF b b b b b b b b b b b3 b4 b: b> bG b dEm g<<>)*gE)*GGt3356zOUzU;5=>=[[[[EE>;HIJHJNNPPQRSQpppppp9 p6RS4@?CI\SrrmuuI{}}{  ( 5!  O!""%%@ 7 :z171+iK8+7TU9U#XK7#MG^87UVT7FLFZYO@:ZziMX|p  |GX_pd _  [[p  x t**xp^XVXjp    v p w! ! op~$ % % j$ ~* * , o, . s. spJvw5 5 6 6 ; < < A ; A B F B F J J K K Q Q T T Y Y ua   a c c ' } n " p v p n z z | ~ ~  | v                    #  79XLY  # &   '  &        "     4   4 9  9  " 7 9       C  7       D     G C 9  H   9 G 9   N H 9   E > -  >   E 9 / +  \  N 9  /  ]  L = \ I -   e 8  ] +  e I  8   L g _  g M    w  :    G  O d f O M  d : P P  S R  R    S ( y  }  ^ W 0 q  ^ V ( y U } V  q U 2 X  U 1  W 0 i 1 X i  2      6   j   < < < < < < j    Z  . 1  . r 1     r   { 7  { :  :   =  =   B   Z 7  B   E  E F     F  h   b  h N   N    V  V W W  Y   v v   v  v v     b  Y    h m      h  m     p p  t    t u v u  v                                                                                       )    D      /    )   /  # 4  #   -   n 2   2   +    0 =  @ D  @    - 4    0 C G   C  G _  f  H C  H     0  A    H  _  5   Z   b  5 C _ J U          4  Z O A C X ^ T ^  A  X   T  b J L n  L    K       ^    }   }      ^ l   l     q  3 r { 1  1  1 k 3 g k 6 g  6 K n c    c   # $ #   ?   (   * (  *  - . x s . x   2 3 2    q    :  3  : ; r  = ;  ? =  A  Y   `   `   H H  J M    M O  O P   R   P    V ?  R   t   ^   t   ^   a  a   c V      g h h    k     g  k    c  r t  t u y      y r      ~       ~                                                   C  J  ^            D                        %   %   , , !  !   % 9 >  9 6    O     6  >        & "   / / " 8  ' 8   @  '   D   W    5  n   0 & > 5 b  U  U b  _   S 1  _ b S 1  Y  i T     T  @ > D > W > F e  i  F 0 >  B  d    Z   I  z I x B e    j  (   s + s - +   -  -  - m s 4 m  [ p 4 Y b      d e " Z e   [ p  o  A z x j x o   n , - ,  -   J  J  J  J  J   X  :     | : ; >  | X >       C  C ;  E F J   a   J   l  P     h P R  R    l W  W  r Y     Y   u `   u ` c   { c       j  j k     n {    k      n                                                                 >  b  e  x       %   '    $  !   !   $     1 )  /  ( /  )  (        #   <   <    9 9     ?  =   = 0  K ?  A  K 1 ' L   G  A L S G  0  S  T   M O 3 M T  O   ] ] * &   D &  D . 7 @ 7  .      @   @ H B Q 8  Q 8   @  I   l h [  h  { U [   {  H  N B l I     N n "  _   V U  "  "        x   -  V  ~  X ^   x  ~   e  ^  !  ! $ o e  $ % o  % p u t p  * +  F  F  F  F  F * u   3 4   +  9  9 : =    = >   @     @  F  F }G J   ` J K K  N  N O    k O    T T  X  X     \  \ ^  ^ `  ` b  b                               '  #      z  z |  |                  %                                                         "        3  7      "          /  '        / '  ?    6 *  ?  ?        ? L 0   L     E B  U     6 S ?  S  8   )   ? ? 8 S P H  U  P  ? 6? ) S ; h _    o [   ; X      t    c [ _? ?  c   o A ] Z Y U S D C  D M   ] Y M   V V Q W  , W  {    { ,  _  f a } a  4   : !  ! ( B   >  > (t  _  3t  B  G  G  G  G  G   36  O 677 9; ;     X       D   DF FG    G   M M d OPR Rd  V O VW9 P ]   ] y y  W   be b e        k kll       "       2                   8          J            S  H  h  C   ' 0   +   % E  2" 1    15  5  E8 <&<JJA   0A#A# 0T:4 $0Z  `4`BcQ     T:Tm@cBfNmf$Tw} f aCawHCUX{X { Ug Z QQoh=Zgp  $ ;p=$oggi)K/ G/)1K55881<<YY??FFn e e e eeSSnWWXX^^__bbde edoqrqroyz{y{z'+%''E&  A>.4.A4>H#@NHHR#3CCT&"a"TaARkgg090GRk hLGmLRMMYYDmRnDnsRi   s N  N f f2hhtpl2ul5vp""uv~)~)FFFFFp2233677;;@@DDFFGII`G`SSVVXXr^^_`d`dgghhoRp}o}     &,#,3&9Cg*M*c*$#*r**\** *Q*5**L*'**#*N*{***$!*[*C(L*~**{***V**EZ1aEaiZKi1fWiKbiWOiefteLLjjHb Ok T  w Wwkci~iTmci:~i66666;i:x&x&((BB..J3J35z5zP{P;{;==X@@__IIlLMSLSlooYoY\\``bbcdhdhkkrrss||# &!i "0:0:)(22??>) A)C$>C$ QBJJ!<B<9>HHHeQ>Eljjq mF KFDE>O9>ml>mqODK}u}PNfPVVTvx/^x/6^6~#'mfq'v)G~RTqG)MMM;R;=A=ACCGccc>cqccGkkkk kkZZ\\__aaeeffiinnqqrsts}}"t   ,    A0( (- !8- 7J, 8e5:I47J5393MNM:uNIO41N11]]^D<<[]ON[]yH^uDuyuHup####gm**o`m`v]puvw;guou(ju(EjwEGxGG3344z99z<<>>AABBFFIIJJLNNiLTVrr]rrrrTV}}}kklnnlpspuuwxsw}} 0   x $$2'2 '?9K ? :%!  6%6KYRuwx5:!"Y"&5&C*`*S*RC `hWh5W \b\SDqDEqMvEMyaa jj  X Uyq__g`U4g!!<$$&~&',',..00qQNXNNQZ>>AAZFFHHJKKJlTTUp~pU\]x]h hklmoltkmtxxyoyq    #&56#?5*75**q;";55"b+"+-(V@"(V-)v5cd65?5)c@/ npXX j/dppBbYBMEZEZeuuend  R  W [|qjdYdqMd|iWr"i"[s&A)~&s,.~.)22,s6v677==@@\\\\GGvKKMVMDQV[[z__zaccehheknnqkquuxx57"da  //  -;-;HH>>((IN P X#X<+!bNI#P+F5F<I/5!B`BI`I   bI :ILI:brLO\RO~R~O y\& tUt||o7s$sd$&&dl**l//11oKw5QQQIQ~QQ\~Vy~^^gI^IKcgffSKSUUYY_xx_xxxddjjlloorr{{!  !    3')##((0" AF '3??)3QELEBMB+WM%+"3\LDWD[RFATGQAU  Q [W xLTpJVRWAkGWJpHVp]eHZ\&&]w&,x``^,755535A5L5^7""#kp#((+~~+,,ts0t033|55|S<<=>=B>BIIKKLhPhomPmZZ[[^^c{cdedqeqvvww?  0    *-*-%WpZ44?@F%G@A%AEMERWGRU171XUC\`FQeQ_ \D_ DaFTftTa;WFW}z f;O}VztO  V  h ii$s,,,,7X6gg69m9m""&&'$hppHuHuhzzLLFLaLzLLSS;;<<A[ABBbIIJbJOOWWXYY^^``acciijlljooppyayX $$1M5 4  CX` 51,1,88C1149Q!#9!b_V_7deP edVk SSkbQgn=ng=D{zqDz~7Qv| v r|p'''1'Q'P'rs|s  !!J#*}%&}mm*Bw&A}JJJJJJ~{7w79>>%9AFFaHLHLMOPOMUUXPX[[``bbeehhkkqqxxzz||~~  ''"-C"- #6; $6;$EVG(;5/5GVYW={|WY<;qg;<QQZ,,?44lnpQngTTiK;KoSio{{I]mjm###;#a##*****(V]amya"ya"$$AAAAAA-r-//}t16I1}677\>>BB\DGDGIIMMNQQVVru\\wbbueewssvvxxzz{||  6EV/& . ##2  9 2 88:;;<<:Z?lpC!&C0,%30%3=?HS=(FP+?PjShSlhthltYwEA``OERRKXW WUTK" 'UX']t/Yhjj77k7%%&&kwh++,,009]JNNNN9:J:AADDEHEHJJLLNNOORRppZsZQ[}__{{{{}9{.!,/$/)C=<(;)H +h-$I8-)8.IPAP. ;CO`V`FiMiTa=FV<g7g7bxUbaMpGUxnwn h  S ^Gxpx,\k}cl>l@oomu%u%+tm>@Ahx+0Q{K{z0^xrkxzK668<rQW<W8[[x[}[[[IIKKLMMtVVYYZqqZcceeghighiqqsswwxyy}}~x);""!21-:=2'12'=3V MB72B-2,O,HOH>N  DD#.]:2. w/^7F# S 3=>ONO/;X^;\F;\X`p`c\Gp`jjEEG z  |f{ P*fzp*`|444k Pp<' k'p*++*pQLLMQ::{UDUDFFHHIeeeIeeUU[[^^``h~~~]~hkkppuuyzK{!yz2=7O  /%,%,<7/<)&&;);pKKJ1=1GG=)"O_-M-OXZaLZ@?RW{ "M R@N >>NVvVd\d\PTTeiS]i(sefPQs]S'l(X_Qfjl.jb||.g}bgmL_qA}mB%*orAqn*rB%o~E2Yt2E~t66::UUcCYCIIcwMNOTNTOCVWWw{{={M{_{a{ttM{{~~%7##(';(J//+ 0 +118@8<"<55@44$.H?v]mW.XX,-SY&B&S-3ccf&YBe]e3kok=Z =; P;P[gA[Zn Yf<9 J q g  !^!!!!!!!O"P"b"##=#F#k##^#(q|*$d$*qS%9&':''7(::(VVVVBBCCFFHHJJMMNNYYZ^Z^_cc_eggej oo{7jwyy{|w| '@0"" "  $H,5050&dL74=4I=I]oZAKE=K=6\6A7X;A=PX@@f]]f1a1DdDtGE=tGOL[O [L  ~ [~` v v  hh}  UU|(P\((   [       bp   biup<<p) i) + + q. / . q/ rHrNNNNN9 > > @ @ D D E H H E J M M P P R R S U X U X Y Y \ b \ S b c z zc o o q v v x x z { z {                                          =\;f            , &    ,     2 ;  2    ? A   ?  F    !    ! 0 O  - O - a( :  (  0  T =  N =  T :  N ] =  a W  ]  a   <  ` < Z  Q  k e }  W   k  ^   f  f ^ s I  s    l  l I  n F A !!n | u V | !  !! !V  !} ![ ![ | !!w ! !w ~ . !!Q Z } ` ! `  u _ u !_ 9  h 9 9  h B  @ '!(! B   (!   J J J J J J '! 8! 8!  :!  !!5!!!3!!*!!!Q!K!e  6!K!]!K!!?! Q!7!K!9! !@!K!f!K!?!9! 6!-! !;!;!-!/!!!D!!J!K!D!/!!!]!` !!6!~ !u !!!!7!!@!!!f!!!!V!K!!V!!J!!!F!!h ! ! ! ! ! !!J!F!n!!Q! "h! " "T!h!n! "!%!"!|! (!%!!q!!v!!"q!"v!""!"""o!""!T!n!"{!" :! :!B!! :! :!!|!l!B!!|!!l!+"!+","!!0"!,"!0"2"!2"4"x!4"x!!!z!o!|!9"!9"{!|!!|!<"!!<"!@"!@"!!C"!C"D"D"!G"!G"I"!I"J"!!!!J"! d!O"P"!!R"S"R"!S"!!!X"X"!!!!!!!`"!!!`"!!b"!! !!! ! ! ! !!!!!!!!!!!!!q"!!t"!t"x"!!!!!x"y"q"!!!!! "!!!y"!"!"!""!""!!" !!!!!!!"!""!!"!"!"!!!!!!!" """"""!!""!*!!"" """!",!!""""! !!K!!n!!|!!!!!!!""""">!!""" """""!"""" """""""" "!*""3""!"'"">")"3""">"*"""":"'""""=""""""""-"F"$""F""?"%"""?"Q"."""Q"/"8"1"."Y".""/""""]"\"."]"d"""Y"=")"""1"""\"V".""c"6"""c"A";""A""V""";"""e""w""e"z"N"Z"#N"####{"K"g"K""K""Y"##{"#|"#g"|"f"##"#[""#["##"#!2"z!2"h"~"!2"w"z"""#!#a"!#"##h"$#)#"}"""#}"$#k")#/#"a"~"!G"!G"""/#1#"1#3#"3#4#4#"!P"!P"""!P"<#"<#=#""@#"@#k""B#B#"""dF#!b"!b""b")"b"."b"z"b"""""Q#""U#"Q#"U#""""""Z#[#""!x"!x"[#""x"c#"c#g#"""Z#"g#i#"i#""k#!"!"""q#"q#""""u#"u#""w#""""""""~#"w#"~##"!"""""!""""##"#""#"# #"# ##"###"#"#""##"##""# ##"""###""##"### #""# # # #"####""##"#:""#(#"# ###"##-""$""##%""###" ####"#:##%##8"":####-##(#"-####D#D###%#"##d""C###""C##L#A####A#6""P####Y###H###V#T##A#L###V####"P#Z""G#?#v####G#;#"K"#"#~"#"#"#"#h#;###h#f"##Y##`###X##`#X#x#>###H##v##x##\#r#I#b##$K#W##\#b##W###y#&#K##I#]#|# $y##j#m#$j#|#&#m#'#$$ $]#'#p#$$$$d#$$$p#$e#$!$#$o#p##n#l#d##!$$n#"=#J####'$$v#"@#${#"F#"F#"F#'$#$p#"F#e###J#o##5$#5$#M#M#z###:$#:$##"U#?$#{##?$@$A$E$###@$#E$a####A$##a#K$z####K$###"k#"k#"k###"k##k#s#######s#}####]$#]$^$^$########}#h$#####h$############q$#"#q$####v$###v$w$y$#y$##w$# ##$#$$$###$##$#$#$###########,$#$ $##$ $#####$###$$#$##$#$####$#$#### $## $##$$$$$$$,$####T####$$$$,$$#$$$$#6$$##$$#$$$$#9$#6$,$$$$$9$$$$#<$F$/$?##<$,$1$,$$F$$/$#$.$$$G$L$#6$$1$$G$$L$#$H$X$>##0$$I$($#H$$#$I$#0$($#$r##.$/$B$)$`$P$$`$$B$P$$$3$f$$3$$Y$$$=$b$Y$$b$$ $_$7$ $[$7$$[$a$$$>$=$f$$l#$u$r$$u$%>$a$M$x$V$i$x$$%$V$ %$%M$"$J$i$"$R$%$$R$ %W$$%W$%$$$*$$$*$$%2$}$%$_$f$m$s$%m$c$j$j$2$%t$g$;$c$"%t$s$;$"%$$%%z$%%J$r$C$$z$l$D$${$D$l$C$-%$-%$$$$N$$2%$2%${$$N$O$$$O$$Q$<%$$$$$Q$$<%$$>%@%$@%A%>%$$$#^$$$}$$$$H%H%$$$A%$$d$$d$$d$k$$$$$$R%S%$k$R%$#q$$$$$$p$p$$[%$$[%$$$a%$$$a%$$$$$$$$$$$$h%$$#$h%$m%$m%o%$o%p%$$r%s%p%$u%$$$$s%$}%$$$#$$$}%$$$$$$$$$$$$$$$$%$%%$$$$$r%$$$%$u%$$$%$$%%$$$$$$%%%$%$%$$$%$$$$ %$$$%$$$$%$%$$$%$$?%$N%$3%$%$%%$%%%%$%%$0%$%0%%X$$%%)$$f$$r$$$$g$$$$$$$ %%$%%%%$%?%%B%B%$%%%%N%%%$%$%%%$%%3%%%%I%I%%F%P%$F%C%E%+%P%E%$1%(%%1%%%+%%C%b%&%%%b%4%P%(%%%4%&%%%^%P%%P%%^%_%P%D%9%%%K%9%%{%%%D%$%K%J%%P%J%%v%%$N%M%v%&]%{%%P%%]%%P%&M%~%%T%~%$"%$"%&T%%P%&)%%c%d%d%)%&c%&&&V%&_%&V%%5%%%w%%\%!&%8%%w%5%\%8%!&=%%%i%i%=%&&%&&'&'&%G%%%%L%%,&,&|%|%%0&%0&%G%%L%%%6&%U%%6&@&%$S%$S%P%S%%S%%S%L&S%%%%U%@&B&%B&%%%%%%I&%%%I&e%%K&K&%%e%%%Q&%Q&R&R&%V&%V&%%Y&%Y&%%%%\&\&%_&%_&%%e&%%%%%%%e&%%%%j&%j&k&k&%m&%%m&%%%%%t&%%%t&u&x&%%%x&u&%z&%%z&%%%&%%%%%%%&&&%%%%%%&%%%&&%%&%%%%&%%%&%&%&&&&%%&%%&%%%&%&%&&&%%&%%%"&&%%%%%%%%%&%&%&"&%&&%+&&%+&-&&&-&&&%;&%%%&&&&&&&;&& &(&& &&&%&&&&;&&;&A&L&&A&&&%/&&"&&&A&&8&&;&#&%%1&&8&#&)&%5&%/&L&2&W&%.&.&)&U&5&1&L&W&%&U&&&&<&&2&b&3& &b&4& &&7&4&D&o&&&7&&D&<&L&&C&&q&&&n&%&M&q&&&{&&M&{&X&y&&S&y&'S&C&o&h&L&'%&T&O&%&[&O&n&o& 'T&X&*&h&r&*&'&&r&'a&^&:&a&%0& '[&&|&=&&'Z&Z&s&'''i&c&&c&^&9&s&=&|&:&'i&''&''(')'&p&('v&v&}&w&&F&&p&F&J&&&&&J&)'w&&&5'5'&8'&8'&~&(:';'%V&%V&%V&%V&;'&&&&&&&F'&&`&F'`&&H'&&&&&&d&&&d&&f&H'&&&&&&&U'&&U'&&&&&]'&]'&&`'&`'b'&b'&&&&&&f'&&&&f'&&&&&f&&&&&&r'&&&&&r'&&&&&& '&&&&&&&&&&&&&''&&&'&'&&&&'&'&&'&'''&&& ' '&''&' '&'&'''&&&& '&''&&&&&&''&''' ''''''&'''&&''(&&'&'&&&''&&''''''-''&-''&''''/'''/'&/''' '&&' '0''&0'&&&'<'''''*''''''3&&'9''o&&X&&''&'='&>''&V'*'<''<'V'=''>''&''''9'<''I''c''?'''?''W'Z''W'''B''<''J'C'C'''J'B'Z''?'<''I''P''P'Z''B''O'c'<'I'<'[''L'['(L'c&'}&'&'~&'((O'(T'"''T'"'\' (' (g'Y'(g'O'Z'(''('((d'((\'Z'(d'((d'('((&:'&:'&:'':'':'&('&('()(')('',(',(-(-(''s'''3('3(''5(('K7(5('''''''''?('?(''B('B('('D(J('D('d''''''J(L('L(h'''h'''''''R(R('T(U(''T(''''']('](^(_(_('''''e('''e(f(''n('''f('&'''''n(^('q('q(''t('t(''w('w(''z('z({(}('}(''''('{('('(U('((((('&'(' ('(((('(('(('( ((' ('' ((''((('' ('''<''Z''Y''''''((( ((((((('''''*((%(((%((((''(((''((((('((4('(9((((/(''((' (/(H((''' ((4( (((6([((' (' ((('6(((*(('(#(>(>(''#("(1(("((+(V((((1(''9((V('(9((C(E((C(F(N(((+((F(E(((H((([(N((((`((((`(8((:((9((K(A(<((A(((v(v(W(()d(d(S()))Y()|()m(i()m(i(() ) )( )\( ))P()(Y()(s'-()'-()())())))('7('7((7((7((7()7(K((:(('?((())|((/)((((())(/)0)((3)(3)(('L(Y((0)(:)(((:))(\((((P((?)@)@)(((?)('_(L)(((((((L)((((((Q)(Q)T)(((T)U)V)'q(V)(((((((_)(((_)((b)(b))(e)(e)((h)(h)(((((((('(o)(o)((((u)(((U)(u)v)(((((((((((((((((((()(((v)()(())(())())())(())()())))) ))'() )(()())()))))())))()(()))))) )),))))(),) )))( )())-,,),,))((.))-).))-)(()e,,)())))));)))))1)) ))P-,))1)))W-,))))8((2)R)E)K)8)R)<((W(((E)S((K)(W)((2)e-,)-,)7)W))7))-,))8)Y)]))f)))i)-,).,))Y)f)Z))i)R)%))q)r)=))r))l)<)])) )l))k)k)p)q)B)|)B))B))Z)))B)=))<))s)) *y)p) ))q)y)s) * *|) *S)%)j)S)%))***j)**[)x)*4))*[)t)`)*`)4)w)4)*t)(:)m)w)(:)#*%*)%*)q)*)#*m)+*)*)+*))))J)))))J)))(L))){))7*8*))7*{)(V)))*)(V)(V)))\)))\)8*)))))H*)H*g))M*))))g)M*))))))Q*R*))U*)U*R*)z))X*))))*)Q*))z)X*)))0*)*)h*)*)h*))()))o*)))o*))))()))v*)v*w*z*)))z*))~*)()~*))w*)))*)*))*)*))**)*))*))))()*)**)*();))1))R))*)***)**))))**)*)*)*))))* **)*))*)*) *)"***"********0****1*1**************,*4**,****)=***)*****-*4**=*4**4**/*5**/***F*4**f*4*5*)i*4*B))))4*)*)*)F+)9* **-**9**&*6**&*Z*4***-*O*4**F***f**0**4*S***[*[*S*)=****i*l*j**l***m*m*g**?*C**?***T*x)***Z**J*G*T*C*G***J**O*L**V*L*+ +* ++V*W** +n** +W*Y**{*k*++{**t*k*.*q**+*3*Y*.*n*t*3*+**+}*+)8*}*p*p*:*)8*:*q*'+*|**'+(+*u*E*|*x**u*E**E***(+***4+*4+y*P**y*P*x*:+*)R*:+**]**?+*?+@+*******]****_****b*@+***K+N+*K+*N+****r****U+***U+s**[+**r**s***[+_**)w*)w***b+*b+c+******c+***i+)*)*)*r+*b****i+*r+t+*t+u+****)*u+*******++*+*+******+**++*++*+***++ +**++* +* +*+ ++*++*+++****++**+++*+*++*+*+++++**+***+++*,+*+*&+,++*+&+ **++6**++*;+<+7+*+7++7++;+++*++++)+F+++)+++2+2+++\+F+++L+P++L+++7++j**+g**C**+E+1+!+F+*E+H+*6+F+h+F++!++)+~+F++\+R+F+_+H+++F++\++_++\++6++\++9+9+A+++F+M+8+* ++M+A++8++++h+X++^+X++^++O+++~++O+,,+,+F++R+j++,++,j+m+s+,m+,*++y+a+,y+a+*+,,l++0+l+d+0+,q+,,+q+d+,,,v+++v+e+",+",$,+$,++&,&,+,+*,+*,,,+,,-,.,.,+2,+2,+z+*N+*N+,~++z++z+W+++W+Z++>,+++Z+++++>,+++++++K,+++++K,N,+++N,++++k+++k+T,++++T,+Z,+Z,\,+\,*u+++++c,+++c,++f,+f,g,j,+g,+j,++m,+m,++p,+p,q,++q,+++++v,*+y,+y,v,+{,++++,+{,+,++++++++,+,+++++,++++++++,+,+,,,+,,+,,+,,+,,,,,++,,+,++,++++<++,+,,,,+,,,,+,!,,,++,,,,!,,, ,,+,6,,P+++,+6,+,8,<,,8,,C,, ,,1+++ ,,+<,+,C,,,,,,B,,+1,1,L,,,B,,0,+,G,L,,0,,G,,,, ,,@,%,,@,P,%,,O,',,,O,,P,?,%,,,,?,n,5,+_,/,d,/,,_,a,,H,a,+H,S,5,,S,,s+,,d,,,k,Q,u,,k,r,,Q,+,U,r,u,,h,r, ,U,],,e+,+,,r,-],+,, ,-M,,, , -W, -(,M,`,(,W,`,-h,z+-,+-,+-,,-,,-,L,-,--s,,-s,--,;,,-,,#-,--,#-,;,,,,w,w,A,-h,,-,A,,,---,,/-R,,/-,,,+N,+N,X,,6-,,6-x,,,V,z,z,,,R,x,,,X,,,,V,+\,b,,+\,G-,+\,G-,,K-,,b,K-,,O-,,e,O-P-,,R-+m,R-,U-U-,W-,,Z-,Z-,,,,]-]-,,,b-,b-c-,,.e-i-,,,,,i-+,,,,,s-,,,c-,s-,,,,,,,,,,,,,,|-|-,,,,,---,,,,,-,-,,-,,,,,,,-,,--,--,,,-,-,,---- -,,---,,-,,--,--,,,,, --,,---,-)--- --)---,, --,--3---&--,----.---8-8-0-, ---2-&- -%,,--'-'---2-0-',,---+-1--+-/,,r,,--,,-,,-?-Q--?---!--3---%----"-M-V--M---*----F----[--4--*-V---7-d-[-5---;--7--;-N-B-_--B-4-V---F-V--a-X---g--T-T-S-a-S-,-y--^-y-.,-!-Q-.%-Q-g-X- ..^- .w- ...f-."-Q-w--,--x--f--.x-.--.---.w-.o-9-9---o-#.-#.%.-%.p--(.p-(.q-n-H-q--r-,.r-H-,.---I--}-I-~-}-4.`--4.~-7.?.-,P-,P-7.{-,W-,W---?.--,W---,]-{---`-m--t--,e-,e- -e--e-Q-e-V-e- .-,i--m----m---.-.----t-.---b.-b.------f.f.-.---/---/-,-----z.-/-------/---<0-i/---z.--W0-~.-~..v1-.2-.-&2-----02-U1-.-..--.- ..-..--- .- --.--0----1--.-------....----...-..-..... .'.*....'.... . .---.-..-.....&...&.;....-...;.8...-..-..-;..8.-..5-- ...G.........A..d--N--.._--<.E.S--E.--<.>.I..>.-Q..I.-..F...)./.-)./...`.0.-.;..`.5..].5.l.0..].- ..e.- .- .- .G.;..Q.-..Q.A..l.C..e.C...k.k.x.F.A..x.m.x.K..!.P..x.P.K.L.!.{.L. / /{.}.T.T.$.$..1.}.n-(.-(./...///m..1.6../g.6..x./o.!/.o.g.!/#/.#/&/...&/.x.|..B.|..B.n..-/-/n..J...2/2/.5/.5/J.|...9/.9/:/..:/...>/..A/.A/C/.C/..>/.H/.H/I/..K/K/.I/.p.....h.h.....p.W/.W/[/.....[/]/.]/_/._/........d/....-.d/.m/...m/p/...p/....s/v/...v/w/s/.w/...}/...}/~/-.....~/.../......../....././/..//*....-.;../....A...././..:/.././..//////.//../..*/.'/*///'/b/"/%//"///+/)//.///+// // ////;/$/8/ /.//$/ /)///=/=/./////.(//.%/;/./0..x..........?/E///?//F///0>0/@0//C0/C0@0/._/._///I0I0/K0//K0///P0/P0/i//i///V0/V0mW0//Y0//Y0/////|////a0/a0///|/f0/f0//i0/i0//////////////t0/t0//v0w0w0/v0///////0/0/00.///././00//0/0/0/0/0/ 0/0/0 00%//)//.//8//@//00000(0///00;0/00000000000//////:0///E//0/0000&0/0&0000(00/00;0000:030/00300000\//00,//e//t//u//x//0D0D0?0G0*0P//0?0-0?000`0?0Q0?00G00q//\0?0k0?00-00h0?0M0?00`0u0?000Q0060000060000\0000E0?00k00h00^0?00M0000u0B0j00:0000E0/00B00^00111R0111x01T0_0m0 1_0h/#0/#0 1R000k01N011~01101x001e0111X0[0}01[011011^0T00$10/<0/<0/<0$1&10&1(10(1+1o0N00+1,1~00.1/1,10/I0/100051z051e0081081;1000;1/W0/W0?0W00W00W00W0.1000X000000000000/f0n00o0000R100W10R100n0W1X100z0000\100X100y0y00b10b1c100c1000/00000\10p10/000p1s1000s1u10u1v100x10000x10}10}100100010000101001011000001101/000 101 100110111/001110111 111011010/0011 11 10010101001 111*0010001100101111111111"111"1!1'11!11011)10911A11111911101%11A10111111:111<11)1<1T1j0011=1=1T1111>1>1T1171%1)11)111B1:1)11m01i121 1i161P171T1B1T1P1 1161?1T1111j1111t11V1y11?11l1}011V11l1C12]1H1^1I1*1]12^1222k1Q1q1 2Q1j1T1t1T1 22121q12d12I1*1k1T12|1222w12{1_1d1q12|1q1212#2e10812{1#2$211&2$212t1z1r11D1,2o11w1q1,2o10211D1z1e11521521M11182M1~18211U1111U111@211@21E21E2F2G2K21G211a1K211F21g111g1m11a1111111m1e212111110v10v11v1)1v1T1v1q1v111110}1~11e211212111j221111101j2111q231#31q21)3111+31H21431111121O2121111<31W21111111212#222112212 2212112 2221212221121111'1112212212212222222122"22"222122212 2*22112222221 22 222111212221%222'221%22'22>2I22>2222112 2L2.22L22(22.212C22V2M22V2122]2Q2C11y1122Y22]2 2*2212*2Y21(2I2222C2I22Q22H123222;2;2322U2^2f222^226222`222t2t2h222w2m222N2w2m22D2z2_1212N2h23D23i2}233i2!2y22!2n22 3 3n23r1&23k2X23{2g2/2{23k262f2c2/2102`2f2o2c23y2332923292222#32g2&3s2&33o2(3)3s2l2+31F22r2232(3u2u2p2r2H223y2z24322732732O222;32;3<32W2@3222@322D322Z2D32\2G32G3H32222L32L3M322M32Q32Q3S32S3Z22\221q2H321q2Y3Y32_32222222_3222x222x2232222222h322h323222p32p3222222*22I22x3222x3322232223232322222232232323222222231222 32323 42332222222332232323323322 3232323 33232 322223 32332333!333!33 223*33333323333*33 32M223 3333 3333333 333.333.3F333N3C33N33I3%33333I3f22h22z22J3A33T3333J33333333'333U33e32c3e32V33V33c3U3,333V3O3}233f3383n338333\3\3i3333K3X23g23K3R3f3O3W333Z3r333r343Z3W34[3 34l2#3 4 43p2#3 4g33]3[34g34]34/3343j3/343^3l333j34l32434S44443433:3:333k3v333k33k3E3v33k3u3E3243}3u32H314}32H31424`3|3|334353747435333;453?433X3?4@43333m33532_33`3@432_3X33L43L4N43N4O4;4333333m3U43U4X43O43X4Y433s333s33w3333y3w33y3333Y4333333333h43333 434343h43333333w4333w4y43y433|43|4~43~43333"4333333333444/434343K433 433334333333433343>4333b4344444 33433444444"4433 4 433443 43#44&4F334&43C33%33T33434"4#4444A33'334344/44443044/444,33O33J43n33i33R333484J448444K443044434C443C4,44443R434,44B4R44B4434<44>4434444434b4<444E4.44E44i4T44i4T44P4m44>4A46464 43 43 4 4P4^344A444z44$4_44s44_4D444k343444444444z44 5e4e44s4$4 5444v4(44v4(444p445455544^44455444545p444544"5454"544&5444&5'53@4*54*5444F4444G4/54F4G44u44/54'54Q4u4443N43O44Q444<54<5=53X4=54@5A5B5B54D5D5444c44F444c4J5K5M54M5J5444@5444n44444n4q444q4[5444[544]5_54_5444{43y444{44g54]54g5j5444j544l5s54A54K5444l5444s5t5w54t54w544|544444|5}5}54544444544444444445454444544545 4444445444444454 544544444544455455#544555445 54$55555 54 555455555555555555:55;5555515(5515455-54555505455555.44m4455N5555C5R55)5-545C50545>59555>55V55V5955555W55(5D44W5,5)5N5535,5`5,5535555`5565 5p5655W5 5F55`55p54 5;5:555^455T57T57T58T55I56528T56H:T5;T5P<T5;T5<T5 6f5<T5 6;T54"5X5^56X5;T5<T5>T5>T55W5,?T5F55I556556n5f556n55u5555x55q5h585q5585k55%6k5%6'6u5'6)65)64D5+6r5516r55555+6x5163653655568655658696;65;65S555b559655555S555555555b55555L655N6L65R65R6S6T6S65T65W6X6Y6Z6W65^654w5^6`65`6a6c65c6X65g65Y65g6h655j6j6545N65p65h65p64555w6555#55w6Z65z65z6|65|665a65655555555655555565556655$55555565455555555565656666:556566(55N55656565665 65,666M65666,6666676566656R559555 6 66"656"6665555 6!6666!6,555555]656575:6666:6656M6656#6.666#66E66E6O66576$65[656&6$6<6[626]66<65&6626=6]666=66\6]66\666B6666?666^5 6B6]66>6G6d6]66_66?6]6_6]66d6H6F666>66U667t676H6U6]6h566M6t6]6 7o6o6]6q6]6 77q6n6]6f6]66U677n67667676m677676]6667677f677n6#76#766&76&76666u66+76+7,7,7607u607173763766666766176V6667666>76>7b666V66666E76E7F7I766b6I7J766J76M75h6F7666R76R7M7666x6666\76i765p666\7c766666666x6j76c76666h76h7i7j766l7l7666666666s76s7t7t7666y76y7{76{7~7666~7766666666666676666666767777667777677777777777776777677777777767767777777767777677767777.66'777'77O66779777;77776877*777777 777 777*767977777277G77777777)7K787;777V7G667)7F66V7N77%7B77%77H767(7647(7H7777]7W7g77/77W7/7O77O777L77o7b77o777<7X77<767m67L7g7=7@777=7677k7a78k7847K77x7878 8n7 8]7K7 8Q7 8z778z788|7^7Y7-7u7Y7-7|788w78u7607607w7788778787:7!8m77#8:7m777v7?787?777v7,87,8!877p77p718718286I76M7586M7n7x7Q7x7587777S7<8A8777S7777A87777q77#877777777777776c7<87O87O86j76j777r77U87U87q77r7X8[876t7[877X876t7b87b8c8c87g87g8h877l87h87l8n87n8o8p8p87r8o87u87u87777x8x87z87787z8777r877787787887(87?87778878787888B878D87877777=8787)87777788;777788^878S8777`87R87888888888:87888@87G77277N87K77g777888(888888N77B778&888 8 8$888C88888888?88B8888.888D8.848789878898b77X77@77888888=88)888^88888S88`8a778x77778R8888:888:88@88w8M8888d8^787878p788S8d8M88w8E8s88E89m8m8Y89Y889N899P8"8t8q8Q8P8 9q8%8%8Q89}899v89 9t87,89899|89728728828 928L928928758~889~8}88{88/9|8(9{8v8888|887A8(988887A8y88-988/9298"8~829-9y8885988V88888859888?988V8?988C98C9F9888F9H98H98888M9888M97h88888S9S98W98W9X9888888\97u8\988888X988888f9888f9n98888888787888n9o9888888o98v98v9w9w988888888888888898988988988889999 998989888998988888888989998998 998998&88$88C889 98 99 999989 9 999"9 999%9488949999899!998999 9809999094989"998 989 99 9988979997999D9L998#9L9989D99899999#9M88s889399N9939L99"99^9;999O99^99:99,9+99,999Z9b999699Z99N9L99d9999K9999O9L9999]9]9<999Y9:9L9d9L989899:T9K9L9Y9L99K9:::T9L9: :h9L9a9L99L99Y9:h999:h9k9s9:199:h9:k9 :h9s919:829:99:h9:9:!:a9!:#:9#:$:%::h99{9$:9*:9*:8C9y9x98H98H9%:94:y94:5:99999:99:::99=:9=:8X9@:9@:B:9B:C:C:9F:9F:G:H:G:99999R:99999995:9R:S:T:S:9::99999T:9\:9\:9999a:9a:c:9c:999999i:9i:k:9k:m:9m:n:p:9p:9999v:9n:9v:w:w:9z:9z:|:9|:9999:::9:999:99999999:9999:999999999:9:999999::%99::9:!99-:99:::9:9::9::9:96:9:9::&:":9:;:9:::9:&::-:/:9:::::::6:::9:9:;:::::9/:':9:7::;997:'::: ::+99::3:9:699b99:::D: :I::)::::(:::J:(:I:::N:X::N:<99):I::8:X::_:::K:3:I:_:W::8::::::A:9 :D:I::8::I:M:d::O:::Y:J:I::O:X::M::U::;;[:;U:;9:Q:h:K:I:A:X:[:P:;U:;Q:{9%:x9%:;Y:X:;::;:;;U:X::]:>::g:]::`::]:;:;;g:;";:9::";`:>::::l:(;:(;+;{:{::+;,;9H:9H:9H:I:H:X:H::H:::,;:V:::;:::Z::9S::;:::V:e::::@;:@;A;:Z:::::F;:F;G;:::::::e:A;:G;:::::T;9n:\;:::::::T;:\;::`;:`;}:::::}:9|:e;f;f;:i;:i;j;::::::p;:::p;q;r;e;:::w;:::w;::y;q;:{;r;:};~;};:::::::::::;:;j;:::"::;:::;:;;y;:{;:;::;9:;:;;:;;:;;:~;:;::;:::;;;;::;$; ;;:;$;;;'; ;;:;';1;;:;;1;;:;; ; ; ;;; ;0; ;:;J; ;#;:;;;#;%; ;;<; ;W::n; ;a; ;;0;;:J;I;2;;2;:S; ;;I;;%;;b; ;!;;d:::';;!;;*;C;&;U;|; ;; ;; ;;;7;7;D;C;::&;;;<;P:;h:;;*;H;;>;H;;>;K;8;;K;;8;;;n;;;;a;;M;;S;;;R;;;b;]:;:;;; ;;;;;;M;R;;|;L;;<l:;:;:;<;;L; <V;N; < <V; << <;;;l;;;;<;;;<;<_;;<_;<<l;<<;<;5;"<d;5;;d;;"<$<s;$<;;(<;:A;(<z;;;B;B;z;t;;.<:G;0<;; <|;O;;.<t;0<;;O;;;;<;;;;<;;><;><;;A<;A<B<B<;;;;;G<;G<H<s;;H<;;;M<;M<;;O<P<;;R<V<;;;O<;V<u;;X<;;;;;u;;;;;X<;R<;;;d<;d<:~;g<;g<;;k<;;;k<;;n<;n<p<;p<;;r<r<;;;;;;;;;y<;y<z<;;;;;;;;z<;<;;;<;;;;;;<;<<<<<;<;;<;<<;;;<<<;<;;<;<<<;;;;<;;;;<<<<;;;;;;< <<;<<<%<<<;<;;;%<<<;<<<<<<<<;;U;;D;;<; <;<<<<<<!<<8<=<<8<<<<<<<;<<<<<&<<<<;&<<A<Q<;+<I<*<Q<<+<;?<<T<1<<T<<<<2<?<#<<*<W<#<<N<#<e<#<D<#<_<#<2<Y< <W<<'<'</<I<<@<<1<<<Y<<<S<S<@<N; <<N</< <<q<u<<q<<<e<s<<<C<s<<<?<<;<=_<=<C<<D<K<<)<K<=U<l< =h<<< =;$<t<<4<<l<)<h<[<=m<<=U<<<<<=t<=<<[<4<<<9<m<<9<;;<<e<v<<<<$=%=%=<;A<<<;A<;A<;A<$=v<<F<L<<<<2=F<<\<<<L<;P<<<;P<;P<;P<;V<<<;V<2=<<<=<<<<<<\<<<a<<<a<<<L=<L=<<Q=<j<<<j<Q=;k<<<V=<V=o<<<o<<<;r<w<<;r<<<^=^=<<w<b=<b=c=g=<<<c=<g=<<j=<j=;<;<<<<<;<r=r=<t=<<<<<<y=<y=;<<<<<!<<=<<t=<=<=<========<<==<===<<= ==< ==<====<=<==<<<==<==<<=<<<<=#==!=<=!==9===<==6== =<=======M==<#==<<<#<<<<=<=<=<><<='=7==W==='=7=<A==;==B===9=C==R====6=====<==I=I=<:=<<=)=4==)===+=4=<=+=:====?=X=u<<=?====M==W=>=[==>=[==P==G=O==G==0=P==0=S=e==O==e===S=K=Y==K===A====;=Y===B===W=>C=>>R=>N==>N=>>>= >= > > >k= >==>T=== >=>z=Z=>>z=k====>=>>p=>==== > >==<=D======<==q=D=l=q=->l===->/>=/>0>2>=2>==6>===6>0>=<Q=;>=;>T==\==>>p=====\=====>>==\=====<b===<b=h====P>=P>=h=<j=======m===m=<t=<t=]>===]> =t=<y=a>=a>===y=}===}=~===~===j>=j>k>========k>=====v>=v>x>=x>>=======~>=~>========>=>>>========>>=>>>>>=>=>>=>=>>>==>====>> >===>>==>==>==>'>=> >>>>'>>>>+>>==>>>= >=4>>>>>> >>>&>>==>+>&>>>>>%>%>>>>>X==>+>>>>4>>>B>>>>>1>3>>=>>><>>1>>.>M>>.><>>>>=>M>>=>>7>>>T>T>N>>Q>W>>>Q>=(>W>=_>O>>_>[>O>>>[>>c>O>>c>>>b>>>d>>5>d>R>Z>l>>Z=>=>>Z>>X>7>M>b>O>>>}>?o>R>>l>>X>O>Y>>}>O>?o>Y>n>r>>>(>M>>n> ?|> ?\>>|>>5>R>??p>U>?\>?m>?p>??>?>>??>y>`>&?>!?y>!?>>=;>%?>%?&??>s>>?>q>>*?*?q>,?/?>>>/?1?>1?>H>>>>>m>>>>9?>9?:?;?H>>s>>:?>r??>>>>;?>??>?>?>?>?> @>?>>>>>y@>?>@>@>@>@>Z?>@>A>@>@>A>Z?A>YB>a?>^B>B>=x>a?>>B>e?>e?f?>>B>C>f?>vC>>>=>o?>o?|C>C>>>>>=>w?>>C>w?>|?>|?D>E>>>>>?>?>>???>???>>?>?>>?>?>?>>????>?>???>???>?>>???>?>??>?>>>>'?>>>>>?'????B>>??????3>>?>?>>M>>O>>r>>>>>>????????2?N>>??+???I???????I??4?6??4??>???? ?6??>??7?????.?J?? ??.??"?+?2?>#?#?0??J?>?3????=?3?0?V?g??V?7?6???=?0?W??A?[??A??Q??@?????8?8?t??U>?D?t?{?t?C?B?@D?@?C?@{?@ @s?`>?>?@?g?Q?[? @ @Y?Y?u? @ @O??-?O??W?@?>,?W?-?@>,?x?}?>1?@x?@??@@?d?y?E?d?#@q?q??s?t?#@>??>??>??>??>??+@v?+@H?l??E?~?H?/@4@??~???/@?4@v??6@????6@???<@?<@?S?]???@S???????]??@?>a?????????h??O@?h?l???j?O@?T@?m?j??????m????T@?>w?_@?_@c@????z?c@f@???f@??????????>???6??"??0??g??z??u@?u@??x@?x@y@????}@?}@??????>?@?@@??@???@???@?@@@????@@~@>@'A'A@)A+A@+A,A@~@1A@@@@@1A@@@@5A@5A@@9Aw@)A@9A@@@@BAAAAA[AEBA>BAEBGBAGBAAA`AAAAAOBA`AAOBRBA@iARBUBAAAUBAAAAAAYBZBZBA]BA]B^BAAaBAaB@|AdBAdBAAAAAAAAkBAAAkBmBAmBnBAAAAAAtBAAAtB{BA@A@AnBA@AAA{B}BA}BBABAABBAAAAAAAAABAAAAABBABBAABABBBAAAAAABA@A7AAAABBABBBBBBABAABAB#BAAAABAABABBAA#BB"BBBA=AABBBB8AAB+BB9B8BB9BA#BBB4BBBBBBBBBBBB"B#BSAAB2BB3BB/AAhAAsAAAAAAAAA2BB3BB#BB#BBBAPAA'BFB+B#BB'BBBB$BPB1BBBPBBQBBB=BBBB[B[B_BBWBBgBKB$BFBBgBB@B?BBABlBBABQBFBB@BBBHBrBBBHBBBBBSBuBCSBC=BFBiBwBCWB_BCiBxBhBCCxBBsB CB CCoB`BB`BCBBB_BCCoBCCBCCCpBvBCCpBBB|BBCyB"C|B"CCByBvBqBjB&C'CCBBzBCB'C~BAEB&CqBBBAEB~BBBzB4C4CBBB7CARB;CB7CB;CCCC>CCCCKBB?BBC*CClBBC9CCCC)C9CCCC9CDC9CC6CCCCC^CuBBhBBsBB`BBC^CwBCCCaC*C9C^C9CCjCCiCHCCiCCCZCEC6C9CCCZCCcCCC8CxCICCxCCCvBCBCBCBCBCaC`CCCCjC`C CNCjB"CB"CB"CrC C[CrC D8C`C D[CDTCUCcC`CDCCC`CDTCDNC`CDCDCCCCDDDDkCfCC DDfCkCCDmC%DC%D&D'DCC'DC&DCCC.DC DmC.DCCCJCCCJCC5DCBMC5DCLCCCBSCBSCCCBSCXCCmCCCCCXCCCCDCDCJDCB_CLCCB_CB_CJDBbCMDCMDODCODlCCQDCCClCCCCCVDCCQDCVDC]DCBvC]D^D`DC`DgDCB|CB|CB|C^DCB|CgDiDCiDjDjDClDCCoDCoDCCqDlDCuDCqDCuDBCxDCxDBCzDBC|D~DC~DBC9CC`CCCCCCCCCCCD|DCBCCCCCCCCCCCzDCCCCCDCDCCCCCCCDCCCCCCDDCCDDDDCCDDCCDDDCDDDCDCDDD>CCDCCCCDDCDDDCCC)D2D#DD2DDDD7DDDDCCD3DCAD3DDDDAD/D7DDD/DDDD6DDDDDKDDDIDD(DIDBDHCCDECCDWD9DD4DDWD6D7DD(D7DD-D4DBDICCDDDHD-D*DDDDDKD7DDDNDLDXDTDDDNDDXDD:D D_D;D DDDpDpD;D8DPDUCDD8DDDhDbDDDhDCD:DLDDcDdDkDE!DdDE_DLDRD!DZDRDEZDC%DC%DC%DSDDEcDPDEDEESD0EEmDmD[DD[DEEyDyD}DEEhD=DwDaDD!EaDwDD!E)ErDD=DDD>DDrDnDPEmQEQESEQEE9FETSED^EVTEEEEEEEvTETElEETE{EETEqEEElEWFEWF]FEDsEUEUEUE]FaFEEEUEaFdFEEEdFfFEfFgFEEgFEEEkFnFEkFEnFqFEEEqFEEtFEtFuFuFEEEEE|FEEE|FEEEEEEFEEEFEEEEFEEEEEEFEEEFEFE FFEFFFEEEFEEFEEEFFFFFFFEEEEFFE1EE2EEEEFFEFFFF!F!F'F EEFEFFFF'FFFFFFFFF(FF(FEEEEEFFF FF FEF F/FFF1FFFF FFF3FFF)FF3F1F)F;FF+FIFF+FFFE@FFF@FFF;FVFFoFFGFEFGFF@F FEFFFEUF,FFFFUF FFFEFF,FFVFFAFKFEVFKFEFAF FVFFEFjF F=FjFF=FFFyEFlFGGGGG>GF?G,HGFEG,HFEGFEG0HG0H2H|G2HGG4H5H8HG4HG8H5HyGH&HGHWHG7H&HMHGHYHHYHMH6H&HH>HHH7HH/H.HH/HHOHHHJHJH9HHHHRHHHH6HRHOHSH9H[HwHiHwHHSHH[HHHiHHrHwHIrHIIrHIHJHIkHIG!HG!HTHH I ITHkHwHIdHIdHwHVHHIIIdHIsHHIVH`HHIsHII`HIIIH!IHHH!IGIHI8ICIH8ICIHHIIHI?III.HH?IIEINII-I9HHHEII0I6IIFII0II%I7II>IH%I)II-I>I6IH*IH9I*IIFI>III9III.I.I+IIKIKI+IIIDIHI@IgIIDI1I1IIYIgIHIIYII@IIIIgIHIuHIHIqHIHIfIBIJJfIIYI`IIIgI#I`IIgIZI#I JIIZI J J J[IJvIJ[IIJvIIJIJJoIJJ]I{IIJJ{III]II'JIIIH;IH;II;II;I>I;IIgI'J)JI)J,JIII,JHIIIrIoIIrIHIII4JI4J5J6J7JII=JIIIII5JI=J>JHWIHWI6JIBJII7JIIIHJI>JIHJBJIMJIHeIMJOJIOJIIQJRJQJIIIRJIIIpIIXJIpIIIHuIHuIIIHuIXJIbJIbJdJIdJgJIIIgJIIiJIIIIIIIIiJIIIIIIIvJIHIvJIIHIIIIIIIIIIIIIJIJIIJIJIIIIIIJIJ IIIIJIJIJJIIJIJIJIJJIIJJIIIIIIIIJIJJJJJJIIJIIJIJIIJIJJ%JJIIJ%JJJJJI JJJ JJIIJ/JNIIJIJJ JJJJIJIJ JJJ$J7IIJJ/JJJ JJJJJJJ@J?J+IIgIIIIJI_JIJIJ@JJI JJJ;J;JCJJJVJVJNJJJ"J&JJ"JBIIIIIIIIIIII(J_JJ&JIJ(JJAJJfJKJJfJJJJ`J2JSJAJ_JJ2JJJkJkJeJJJL6LCLZLL>LFL%LLLNL L*LLeLiLLeLLLLCLLlLLLELLmLdLLLmLL]LLLtLuKLLLOONM`NfNNNONMdNMdNNNNfNNOOOPOPONMmNMmNMmNUOMmNMmNOON\ON\O]O]ONNNaOaONUONeONeOhONNNhOiOjOiONjONNNNNNNNNqOqONNNNNvONvO{ONNNNNNN{ONNMN~OMNNNONO~ONNNONOONNONNNNNONNNOO O ONONNONOMNNNO OOOO ONMN;NN)NN*NNHNNYNNONOONO.NNONOOOON OOO OO#O.OO#OON1O)ONNNO)OOOO+O1OOO9OOOOOOOOOO@OOO!OOOOOO!OOO!OO!OOOO=OOOOIO+O.OO.OOOOO9OO9O@O.OOOOAOAOIOO O,OOO3OO OOOFO!O.OOO/O^O2O_O_OO3O.OO/OnOkOO2OFO.OOnOOMO8OOMOiN O6OYOO6OOrOHOnNONONOOrOoOsOOoOOOgOYOO`OOsOOyOkOTO`OPTOgOHOPfOKOwOtOKO"OOkOOkOOkO"OwOOkOPfOPOkO4ObOPPOPPcOPmO4OcOmOOxO?OyON>O$P}OOCO}OO?OzO?OOCOOOPnO$PO|OzObOtO1P2P4PO4P7PO1P|O7P8P8PO2PO;PPOOGPOBPOBPN]ON]ON]OOOGPOOJPOJPOO;PONPONPOPOPOOOlOOOOXPOOlOuOOOOXPYPOOOOOuOOOOO_PYPOOOOOOOOOgPOgPOO_POjPOOOOmPOOpPOpPOOOOjPOmPOwPOwPNO{PO PO{P|P}POO|PO}POPOOOOOOOPOPOOOOPOOOOPOPP PPOOPPPPPO POPOPPPPOOPPPPP9OOPPPPP PPOPPPPPOOOP POO POPPPP=OOP POPPPIOO PP,OOPO!PPPPP PP!PPPP PP!PP6PPPP P=PP PPP^OOPAPP@PEPO@PPO6PPPPAPPKPP9PP8OOHOOPKPtOOxOOPO9PUPOPPUPOPP+POVP+PPPVPPPDPPDPQPP,PPPRPPP/PPPaP,PQPPPPFPP9PPbPPPiPRPQP/PQPPaPQPPyPPkPoPSPPPkPQyP~PSPQQ~PQQ QWP Q'PsPQPTP'P QqPTPxPcPFPP(PxPtP(P QqPQuPQsPZPuPtPQePQQQlPQCPhPhPdPQPbPPO>PO>PP>PQP>PP>PP>PiPPPCP9QPPPOGPOGPyPP2QPOGP2QzPP7QPPP[PzP7QPP9Q:Q;QfPPWPPePPlPP:QPP[PPPPPPPPPP`PPP`PP;QPPPPfPOQPPPOQPQPPPPXQPnPPPnPPPPPXQPPPQP\QP\Q^QP^QPPPPaQO|PaQPfQPfQhQPhQjQPjQkQkQPmQpQPPPpQqQPPtQPtQqQPPPzQPzQ|QP|QQPPPPPPPQPPPPPPQPQQPPPOPQQPQQPPPPQPPQPPPQPPQPPQPPPPQPPQPPQPPQQQQPPQPQ!Q$QPPQ!QQQPQQP=PPQPPP*Q.QQ*QQQ0QQ3Q QQ3QEPPQQPQQPQ1QPQ+QPQQ_Q`QoPPcQ`QQ_QQbQ'QQbQAQQQ5QAQQ5QZP QQcQQQcP QQoQrQuQQQrQQ?QQQRLQRlQLQFQRwQFQQFQlQeQQFQdPQRPQoQ`Q RwQ R R[Q[QSQ RQUQRQ?Q`QRRQRRRRQYQQRRYQRsQQRsQRQQRQvQQQQyQQ$RQ$RQQGQyQCQvQ(R(RvQQCQQ}QQQQGQ1RQQQ1R2R~QxQQQQQ2R~Q:RQPPQ:RQQRQ]QQR9R3RQRRQRRR"RR%R,RR%R'QQRRGRRRRRHRQQ>R>RHRQR!RQ R!RR RRQ-RuQQ&RQR6RR6R&RRXRFQQQQQQmRQRQ'SQeQRRRNRRNR/RRRURRPRR?RPR0RSQ RRUQ R/RR-RmRXRmRURRRDRdRRQR?RmRfRmRRmRRDRoRmRpRmRWRVRS SfRSWR SSZRRmRZRRbRR}Q(RSxQ(RSbRSSRSxRvRSxRSSoRSSSpRSRRmRS SR SFRqR|RmRqRnRRR%S%SRQ@RRmRRmRRmR/S|RRmRRFR/S1SR1S2S9SRQRRQORR}RRRRQR9SRR@SRTRRRTRRRRR@SBSRBSRRDSDSRHSRQ`RHSIS2SRRRgRRRRRgRRgRQSRQSISRSSVSRSSRVSXSRXSZSRZSRRtRRRtRRR_S_SRRRRRQ~RRRRRRRRRRRRRlSRlSRRoSRoSRRRRRRsSsSRwSRwSRRySRRRRRRSRRRRRRRSRRSRySRSSRSRRRRRRRRRRRR5RRQRRRRRRRRRSRSRRSS SRRRS SSRSSSRRSSSSSRSRS'SSSSS'SSSRSS(S'S,RRSSSSSSS(SRRSRRSSRSR'SSJSS>SSS[SSSLShSSYSSLSaSAShSSR SSaS6S8SR?SES8SSSCSSASSKSqSvRSSKSSzS}SSSzSTT\S\SxSTMSTSSS~SnR SdSS$SdSuS$S{SuS T~SxSTeSeSxSTTcScSxST T{ST}R2SR2SR2SFSST|SSSTSTSfSSS!T!TSSjS&TpSOSS&TpSS)TS)TSS+TSFSMSqSRIS+TSSS1T1TS6TS|SxSSOS6T7T7TSSS;TS;T@TSSTSSTSSS@TSSETS]SSSSETSSS]SSSLTSLTMTSSSSSiSkSSRTSTSkSSSVTSTSYTSYTZTSSSSiSSSSMTSRTSSSSSSSdTZTSSSdTSSSSSSSSSSSmTnTSSmTSSSnTSSSSSSSvTxTSxTSSSS|TS|TTSSSTTTSSSSSSSTRSSSTSTTTTSSSSSTSSTSSSSSTSSS T TTTTTSTSSTTTTTSTSSSTT SS8SSSSSSSSTSTSTSSSSSSSSSTSTSTST,T3T,T5TS%T,T T5TT TTT3TSTTT=TTTTT%TTST>T'TTTTTTS>TT,TT-TTTTTUUuTUVyUVVUVVgTUEUjUmUJU VmU V V VvUaU}U*UaUU~UV~U*UVVUUVUVUUT/UvUUT/U=UjU>UjUzUUVUVUT;UUUUU&VzU&V(VU(V+VUyUjU+VUUUUHUUUHUSUUUuUUUVvUUUUU7VU7VuUSUTUUUTUUU=VTWU=VUAVUAVUUDVUDV`UUUUU`UU`UU`UUUUUUfUfUUUUUUSVUSVXVUUUpUUUpUXVUUUU^VUwUUUwU^VeVUUUU{UUUUU{UUeVfVfVUjVUjVlVUlVUUUUUUUUUUtVUUUtVuVvVUUUUyVTUUU}VU}VUUVUVVUUUUVUVvVUVUyVUVUUVuVUVUU VV VVVVVVUVV%UUVUVVUUVVVVV#UUVUVUUUVUVVVVVVVUUjUUUUUU VU;VUVU V VFUUVVVVVVU VV V-V;VVUV-VVV$VV VV$V VU VVVVVV8VV VVV VEV.VDUUVVVEVVV;VQVTV8V;VVQVVVJVVKVZVUKVIVU*VIVJV;VV*VVVHV#VVHV#VU3VVU[VJUVV-V[V0VgV3VV0VV0VV0VVgVV}U VVVVUVVVwVcwVkhwVWlwVnwVowVswVtwV!VdVHwVOV|VdV|VwVVOVMV!V؁wV]VMVwVqwVwVBwVhwVV[VwVwVwVwVYwVwV:wVwVwVW]VwV%wVwVwVwVwVWmVkVwVwVwVwVwV(WmV(WwV[wV$wV,W.WV.WVVwVDwVb wV wVwVwVwVVVYXVYVYVZVVVZVVVDWVZV[V,WVDW/[VIWV3\V\VIWF]VbWVk]VMWhVV{]VVhV]V`VMWV`V`V`VXaV~aVabVVVUvV]WVV]WVaWVaWbWiWVU}VbVbVbVUViWkWVkWVVbVaVoWbVVVoWVaVbVuWFcVwWzWVVVzWVVVVVVVVVVVVVVWVVVWVVWVWWVWWVWuWVWVVVVVWWwWVWVWWWVWWWWVWWWWWVWWWWVVWVWVVWWVVVVV VVWVWWVVVWWVWW.VVVVWTVVWVW5WWW5WW*W4WW*WWWWWW9W0WW6WW9WW4W6W4WZVVV WW0VVVV4WV[WVWVWV0WVVW#WV+W#W W4WW+WWWWW4WWW1WWWW|VVW-W7W[WkVV8W[WW8WW4W1W4WW7WW^WRWW8WW^WW\WW;W\WW;WWWWEWlWJWWWlW-W4W:W>WW:WWWgWWWAWAWpWW=WNWW=WWWvWWvWqWEW[WXXgW[WLWPWXLWXeWX XnWeW[W XnWOWXcWXWVWWWWWXXXXXWWX XXX&XX@XX XXpWWNWWqWW'XOX@X&X XEXXAXKXX]X.X X]X9X.XXAXPWXXDXOWXFXVXXFXKX XHXOXXXX9XiXqXVX XXiXXXXbXXXnXdXXEXOXNXdXY"XrXDXOXnXaXrXaXfXaXXIXYNXWX"XSXWXYSXIXOXbXOXY_XXX,XY,XfXYY_XYYjXjX`XYXX`XYYW4X"Y|XgXX"YXXYgXMXXXxX'Y'YX+YX+YLX|X.YX.YWJX|XXXX3YX3YxXMXXLXXX8YX8Y:YX:Y;YXX;Y}XWYXWYXXYX&XYXOXYXaXYXHYXXXGYXGYHYXXkXXWeXXX}XXPYXXXPYXXTYXXkXTYVYXVYvXXXXXXZYXXXvXXwXXXXXwXXZYXXXdYdYXgYXgYXXkYXkYWXXXoYoYXXXrYrYXXXXXXXXXXXXXXXXXXXYXYXXXXYXYXYXXYXYYXYYXYYXXXXXXYXXYYYYYYYXYYYYXXYY+XXYXXYXYXXXXYYYY>XXYXYXXYXYXXY YYYYY0Y1YYXYYXYY0YYY2YYYYXXXYYYX2YY,YYYY Y2Y YXY YY YYY*Y.XXYYLYY@YFYqXXY@YYY/YYYMYYY,Y2Y-YNY/YFYY-YY>YY Y2YY%YY>YNYYUYYaYeYYaYYYY[[A[[A[[[[.[Z[ [&[ [[A[ZF[D[.[[[[D[[[>[A[[[[[[[S[[8[[Z8[E[ [[Z [#[Y[Z9[Y[Z[#[[[[a[F[A[bZZ[9[a[][[[N[WZ[[[k[k[m[[[b[[A[S[A[b[m[[[9[A[N[A[[[`[[s[[[t[w[[J[p[[t[p[[[H[x[[z[K[![x[K[![([z[s[m[[J[_[[T[([\H[m[`[m[\_[\{[{[T[\[/[\~[[[/[\\[;[[Z7[[[Z7[[;["\"\[\~[[[[@['\ZC[ZC[ZC[ZC[ZC[ZC[[[@[[[[2\[2\3\O[[[['\[[O[U[[;\[;\[U[?\[?\[[[[[[D\[D\[[G\[G\[[J\[J\M\[[[M\[[[[[[R\[R\[[V\[V\[[[[Y\Y\[[\Zv[[[[\[Zv[b\[[[b\d\[d\[[i\[[[[[i\j\j\[[[m\q\[m\[Z[q\[[[[u\[u\[[w\w\[[[[[[[[[\[[[[[[[[\[\[[[\[\\\[[[[[\\[\\\[[[\[[[[\[\\\[\[[[[\[\\0[[\\\\\[[\\[\\ \\\ \\\\[[[[\[\\[\\\\*\\[$\\\$\5\6\\\\[*\[\6\\\E[[\\)\\\\\\[\\\\7\\\0\\\\\5\][[\0\#\\N\\)\5\\5\\N\\\!\\\5\L\W\7\5\\\\!\[L\X\[\\(\(\X\w[[+\\\[[\+\\\e\\\e\\\H\\\\U\\H\\\c\p\\Z\\c\\O\O\f\\_\<\\N\U\\\\f\\<\\\{\\\]\[\[\\_\]P\]]]]Q\Z\\\]\\\\\]g\{\\\Q\\]\]]]P\\\]\[3\[3\[3\\3\[3\5\3\g\\]\\\s\\\\\\[?\[?\-]\\\C\\\C\,]s\,]-].]2]\[J\.]\2]\\\\6]\6]7]7]\:]\:];];]\\~\A]\\\\\A]C]\C]\\E]F]E]\L]\[d\[d\[d\L][d\\\\\\\S]\S]V]\\\V]\\Z]\Z]]]\\\]]^]\\^]\a]a]\d]\d]\\\\h]\h]\\j]k]\\j]\\\o]p]\\o]\p]\\\y]\y]z]{]|]z]\~]]\\]|]\\\\\]]\\\]\\\\]\\\\\]\~]\]\]\\\]\]\\]]\\]]\] ]]] ]]\]\\]]]]]]]\\]]]\]\#\\\\\\\\\\\~\\\\]\]\P]\J]\W]\M]\W\\]]]]]]]]*]H]*]]]]]H]]]]]]]]]]P]]O]]O]]<]G]]1]\<]]]1]I]p\\\P]]]]J]]G]\]I]\]W]]]M]]]R][]]R]D]i]]]D]]]]M]8]>]\]X]9]]X]]8]]P]]]K]r]]N]\]b]]\]]]J]\]N]r]]K]b]]l]r]^l]^^^e] ^] ^ ^u] ^u]Y]e]r]^^^c]^]^^T]^^]^}]^c]]]]^^^t]t]]^"^]^]"^]]]r]^](^]]?](^)^?]]\F]\F]\F]\F]\F]\F]]]2^4^x]4^}]]7^]7^8^8^]]]\S]`]]=^=^]?^@^@^]C^]C^T]]]`]]]]]]]f]]]]L^]L^M^?^]]f]\k]\k])^]\k]2^]M^]]][^]v]][^]]]v]_^]_^\{]\{]b^\{]\{]]{]b^]]]k^]k^]]]]o^]o^q^]q^r^r^]t^]]t^]w^y^]y^w^]|^]|^~^]~^]]^]]]^]]]]]]^]\]]]^]]^^]\]^]^]^]1_]_]^]]^]]^]]]^$^]x]^]^]^]^]^]^]^]^]^]^ ^$^] ^#^]]^^#^^^^*]]]^^]]]^]^]]]]^^]]]^^^^^*^*^]]^]^1^!^]^]^^]^1^6^^^^6^!^]^^B^^g^^[]]i]]>]]f^^^A^x^^z^^9]]r]]Y]]]]]]]]^^^^B^^B^^^D^`^^^D^.^Z^^6^^.^^^g^Q^9^^Q^9^^^^5^U^:^ ^ ^5^^Y^^^f^Y^:^^^x^^s^H^H^^^s^^z^^__\^^ ^}^_\^}^^u^^K^ ^N^K^^^v^^&^N^^&^_^^^__z^__^_u^_^^__^^^^_v^#_^]8^^^^g^^^^^#_)_^^h^]@^_^^^)_*_*_^E^^p^E^{^p^^J^^^^^^^5_^5_6_^^9_^9_J^{^<_^<_>_^>_^^A_^A_B_B_^^^E_F_E_^]b^]b^6_^i^^^^^i^R_^R_S_S_^V_^V_^^Z_^Z_[_`_^^^]t^^^`_[_^]|^F_^^^g_^g_]^]^^^^^l_^^l_^^^r_^^^r_^^v_^^^v_x_^x_z_^z_^^|_^^_^|_^_^^_^_^^_^__^_^_^^___^____^ _^_^___^___^__]^_ __^__^^__^^_^^_______ __^_^_ __^"__^A^^__-_-_1____8_1__1____1__8__1___4_4_.__?_1_^_%_^_%___________?__Z^^`^^_@__@_1__D__D_1___U^^X_'___\_1__X___'____\_:_1__1__1__\__1__D__1__:___1__b___1__1__1__W_7_:_W_;_#`:_K_h__K_L_h_i_h_^_b__h^__^_`L_```i_`~_``_``q_`M_d_ ` ` `M_~_h_ `t_`_t_d_```_]___`o__`]_`o_`_h_`_`_7_`a___d_`a__d_#`^>_q_h_^B__k_)`)`_+`,`+`___w_{_2`w_2`__4`4`_6`8`_8`,`_<`_<`___U_?`__^[_^[_?`_U__I`_I`J`J`___N`_N`P`_P`Q`R`Q`_^l_^l___6`___R`__`_c`__`__a`a`_c`d`^_^_^_d`_k`___k`m`_m`______________x`___x`__{`_{`|``___`|`_____^_`_`__`_``_^_``_"__``__`_ `_`_````_` ``__``___`.____`_`__`_``````` ``_ ``/`_`_`_$``_``(`/`_$`_``'__``!`!`=````*``>`B``>`*` ````9````````L`M``;__h__`L`d_______U`0`_U`C`_-`C````-`.`V```%``1`G``3````.``1````O``Z````O`g``S`A``3`Z`5```o```q```S```i``T``i`t`f`}`h`t`X`y`a`i``O``t`}``"`f`y`"`k_#``t``O`aX`ah`aa`aa%`V`a`{_,`_,`o`g`q`g`u````7`u`a`a`7` a` a!aT`g`'a``t`_<`!a`'a```t`+a`+a`v`-a``-a``t`_I`5a`5a7a`7a_P`_P`````?a`?aBa```Ba``Da__`Da```Ia`Ia``j``_c```Oa`Oa`j`Ta`_k`Ta``VaVa`9XaYa``]a```]a``ca`caYa`_`ga`gaia`ia````oa```oapa``pa```va```va``xaya``xa```ya`````_`a`aa`a`a``aa`aaaaaaa aa```a(``=``````aaa`a`a aa`a`a`` a`>a` ``9````%a`M``` aB``a`a`aaa.aa`aaa0``a`a1a```*a``*aa1aaa.aaa`>a)a`V``G`````a)aaa%aaaaaaQaCag``t````````5``aQaA``GaMaa%aaGaaaaa,aaEaa4aaa$a$a(aaa2a4aZaaa,aMaha/aaha6aSaa[aEaMaSaa2aZaa6aaa_aa:aWaa:aaaaa@aaaAa`aaaa{anaa{aaba[aZabUafabbUabaabbba bPa bPaa_aZabsa`'av`'a`'abaaba@aZabsa^abjaeabb`aaabab"baana`aa"b$ba$baabjaaa*ba`Ba*b`Ba,b.bma.b0ba0b1bmaaaaaaa|a1badaa8baaa}a8balaa`Xa`XaMaXaZaXaaXaaXaaa`]aaaHba,baHb}adaaaqaaaaNbaNbaa`gaalaSbaSbraaaaaqataaXbaaataaraaaXba_ba_b`xaabaaaaa~aaaaaaaaaaaaaaaaa`aobaaobaaasbsbaaa aaaaaaaaaaaaaa}b}baaaaaaaaaaaaaaaaaaababbabaaaa baa baaababbab baaaaabaabbbb baaaabbbbbb babbbbb babbbbabbbbb b baCaabb%ba-bab%bbbb-bb+bbaabbbbbbb(aa5bbbbb5bbKb!bb5b/aabKbbbb+b3b bb3b'b bb'bbbbb?bbbWaa#baAaanaafaa/b?bQb#bbQbbb/b2bebbbAbb+bbObjbb7bbOb6bbb2b^a ba b7b6bea bba bbbObubgbRbjbbRbbubgbbbbvbGb&bvb(bbbGbcPbGbxbGbbdba"bYbWb cbcYb cdb&bWb(bcPbccAbebcxb|a1b`bba1ba1bc`bccbc cfb c#c~b~bb#c%c~b%cbb(cb(cbbbb-cb-c/cb/cbbbb4cb4cb|bTbbbb|bTbUbbbUbbb=c=cbAcbAcCcbCcDcEcnFcaabbbfbbaabbabDcbPcbPcRcbRcbbbbbbWcbWcXcbbZcbbEcbZcb_cb_cbcbbbbcccbbccbhcbhcbbkcbkclcbbbbbbbbbbscbsctcxcbbbbbxcbbtcbbb|ccb|cbbbcbbbbbccbcbcccbcbcbbbbbcabcbcccbcbcccbbab+bbbb!bb bb?bbcc*ccXcclccbcccccccccc&c)ccbc&cccc dcdc*dcLcc6dccbccneccb*c$cfcc*cc?cccbcc?cccfccfccc\fcccebbjbbc?gcegcc6cc6cc6cMcQccMcgcgccccccScScYcccHcjgccVhcHc"ccJc.cc>cGbbbbbbbbbbcJccdc[c0cc>c0ccdccc@cc crcrc7cnc cc@c[cIcncc\ccIcccycc}cwcdd}cdBcdBcUcdc~cdcdd]c d d\c[c^cc dcb(c]cUcyc[cd^cducicducddccddmccdczc`cdmcc8cjcc8czcKcjc)dccc)d*d+d{ccbFc+d{cbFccKccLc5dc5d6dccbPcTcc?dccTcccbXcbXc?dcVcbXcbXcbZcccccccccccLdcVccLdNdcNdccPdPdcblcclcblcWdcWdXdvcccccccvcccbxc_dXdcccbdccccccbcbdcidcidldcccldndcndodcccccccccc_dcccccccccdccc~ddcdodc dccc~dccc$cc dccc6ccdcddddcdccd)ccdc;dcdcddcddddddd ddcdd ddd dd dddddd dcdddd ddddddcd/dddd dd/dQccddddd&dd#ddd#ddd:ddd;d:ddYccd"cc[ccwccUcc~ccDdEddDd.ccdd&d/dcdddHddHdEdd9dddBddd.d7ccdBdd9dEdcFd'd$dd'dd.dEd$dcFdEdd(d(dEdIdEd]dd`d]dd`ded>e?edd?edddddddddIedddc_dIedddcdddddcddPedPeQeVedddddQedVeXedXe[eddd[edd^ed^e_edd_eddeddeddddddddkedkeddddneoeddddddddddddedoeded}ed}eddedeeeddddedddedeedecddd/ddedddededdedeededddde e ededddededdedee!eededded!eeddddee%eeeeeeeed%eeeeeeeee(e3ee(eedde eeeg5?gfffffff\fHgf>gfffHgJgfJgLgfLgffOgfOgRgfffRgTgfTgffWgfWgYgfYgffff]gf]gff`gf`gbgfbgdgfdgegffgghgngfggfffhgfffngffwgfffefffffffffwgffffffffffffffgffgfggefgf(ffff ffQffffffgffgfggfggfggfgeffgggggfgfffggggffgfgffgfggfgfgfggggffgffggggfgg0g%gf g%gf gfg*gfggg*gggff2ff_ffsff[ffffggfg(g gg(ggg0ggg@g0ggg gg g1gUffg7gggPg0g7g1ggggggGggg+gg@ggfPgAgSgFgfBgFgfAgSgfgffkgfGg+ggBgg.gkgg.ggigogIgUggIggigggmgjj,ji&jjj&jjjjjjj7iiiiiiiiiiji6j&j*jMji*j1ji+j1jjjjjjj+jNj jZj jjNj7ji?iiUjPj]iiiUjjMjBj7jjBjjjjZjjfjPjjjjfj.j9jmjj9jjjXjjj_jjjdjjWj[jjdj[jjjkojj>jj>joj]jj`jk`j\jXjmjkOjkkcjkkvjj kvj kkLjOj]jk^jLjj0jgjkcj]jpjejkj^j]jj0jej0jkj/jjj/jpjjfj!kj_jmjgjjWjmj!k$kji=j$k%k&ki=j(k&kj*kjjjqj(kjjjjujjuj4kj4kjj6k7k7kj:kj:k>kjjjjj>k?k6kjjjjjEkjEkjj?kjjjKkjjjKkjjMkNkMkjNkjRkjRkUkjjjUkWkjWkYkjYkZkjj]kj]kZkj_kakjakdkjjkjdkekjjjjjjekjjkjjpkjjjjjjjpk_kjtkjtkukvkjjvkjjj~kjijij~kkjukjkkjkkkkkkjij&jj$jjk>jjMjjjjjjkjjjkkkkjkkkkkkkkjkjj kjj kkkjkkjk kjjkjk'kk+k kkk+kkjkkk k k k-kkl?lkkokkjYkDlkDl>lkkk?lkkkIljdkKlKlkMlkkMlkkkkkRlkkbTlkokRlkkkykkkk[ljvkjvkjvkkyk[lkkkkkflflkilkilkkkkkkkknlplkplqlrlkktlnlktlkylkylkk{l{lklkkkljkkk kkjkkk-kkkkkllkkkkklkklllkklllklkkkklkklllklllllkkklk2kklkkllkllllll"ll&l ll&llll"llll/lll/ll(l*lllkll(lllll'llll+ll;lllBl;lkll=l;lSkkkBl%l ll%l lkll=llll9l@llkll9l'l*llClElklPllWlckkPlElBmWlCmWll^lWlwkkLmWlYl`lkkCl@l\mWllWlmWlmWl+l*llWllYlllNlmWllll@lHlolmWlmWllHllXllmWllJlllhllm|lmWl nWlmmnWl|llnWl)lxlmvlllk#lxlQlnWlvlSlSl)lwl_lmWlzldlNl`ldl,lmnWlmnWlJlolll,lwlXl`lmzlk8lllAlllelknnPnn$nRnn>nmn$nUnnnLnhn[nnhnnLn.nn^nnCn_n^m nm nm nm nm nm nnCnnnnn`n^n[nnsno{n;nGnoJnFn`n_nooxnoJnxngno#ninXn#nsn[nanXn oopn1nNn oanpnUno0nvnNn~n{n[nvn~nin[nUn1nn0nonnnon~nm9nomofo_op>omoopoKopolopopLojoppooXopopLo,oXo pxoTo pxo|ozop|opTo,oppco}opcopp`ooppbooppp`ogoopbo#p'popgooo'p)po)poo,po,p.po.p/poooo3po3p4po{o8poo{o8p4pooo;pqqpppppKqppppofpppQqpQqWqpppppoppoppWqZqpoppZq\qp\qppppppppcqpcqppgqpppgqppiqqpkq qpqppppqppqqqppppvqpvqxqpxqpp{qp{q~qppp~qppppppqpqqpqqppqqpqpiqppqkqp"qp*qppppppp qpppppq qq qqqqqqqppppppqpqpqqpp?pp7ppq q=ppqqpqqpqpqqpqqqqpqqqq"qqq*qqq,q5qqq,qq qqqqqqqqq&qqq5ppq$qq;qqq qqqqqq5qq=q q5qp1qq5qq?q&q5qVqp;q5q$q5qPqVqpPq q5qqDqqqTqippDqAqq_ppqAqp=q5q?q5q1q5qTq5qq7qqGq7q5qqGq5q@q2q2qqCq]qq;qqq?qfqHqqfqquq]qqCqquqq@qLq]qq|qqqLqpqJq|qrJqrjp qrrtq]qNqq rrtqq]q rNq[q]qYq]qq]qrtqp-qrqrrr[qrYqq]qq]qq]qr}qbqp9qp9q5q9q]q9qq9qq9q%r}q%r&r&rq(rqq(rq,rq,rqEqwqFqFqq0r1rqwq3r4r0rq3rq7rqq4rqqq7rqXqqqq>rqXq^qqqqCrqCrq^qqqIrqqq>rqIrqqMrqMrOrqOrQrqQrRrqqRrq1rqqlqpqqoqqqoqEqqpqq\rqq\rqqqzqqqzqqqlqqqqqqqqqqqqjrqqqqqqqqqqprqrqqqqqqvrqvrwrqqjrqwrq{rqqprqqqrrqrqrqqqq rq rqqrq{rqrqqqq rrqrqrrrqr rrpqrrqrrrrrrrrr rrrrrrqrrrr rrrr rrrrr'rqrr rr'r)rrqq*rrrrrrrq/rrrqqrrqr5rrq)rq*rq/rq+r8r5rqrrr+rrrrrrrr-rrErrGrrqBrrqrsrds7s(s>sDsrUs7sEsr8s7ss^sssPsQs/sPsCsss,ssQsPrsssdsrssIs;ssIsssUssZs7ss[s9s^sCss8ssZss[ss9sss s`s`sssrsrsyrsursrsMs]ssMsths]s sthsss#sbsVsssxsssSs#sbsstjstttjsSstVstxstcscssstttwstr5sr5sr5sr5sr5szsestzswsss%ts%t&t&tys)ts)tyss-t|s-t.t4tssssssss.ts4trLs6tss9ts9t:tsstptt>ttMt=ttYt@t2tRtesttYt+tRt|tt=tttMtst|ttstttztt tztWtft uft t\tjt uQtt uWtutttuQtuuuttultuqtuuuktAt`tutktts6tus:ttnt`tmt&uvt&untAt(u)ulttqttvttxttZtt)utsGtsLtsLtsLt(uxtsLttttttZtttt[t[ttttGuIutIuMutttGutMusitOuPuSutttSuttUuVusrtUutttZu`utsrttttttwt`uZutduttytdut}t}ttttttstststttttVutvtvtttvtwtzt2|tyut|tyutttt}ut}uutttuttutttututuuutu uuutt utustst5tt1ttutRttuuututt uuuuu ut ut uuuuttutu uu uuutu#uuu#ut uuuuuuuttuuutuuuuuuu$uuuu=u.uu u$uuu=uuuuuu2uu2u%u'uAuu^ttjttu'uptt*uuuu*u3u8uuu3uu+uu+uAuuu;uuuuuuuBu-uQuu@tt/uAucuDuu/uBu,uu.uucuu-uiuAuu4uhuujuluu4uu/uujuut ut ut ut ut uuiuuuEuuusuEuAusunumuAuuvRu~umtuvmu uRuupuvuv]u~upu u^u~uuu~uvu~uu~u0u]uuuu~uvuvv^uvuuvu0uvu{uuv{uvu~uuqu$vu$v&vuu&v'vuzuKuvutuou,vu,vu~uwuu'vtu5vwuzuKuu~uuKu5v7vu7vXuu:vu:vtVutVu uVuAuVu~uVuuVuuXuuu_uuuut`uu_uKvut`uKveuuPvuueuuuPvQvSvuSvUvuUvuuuuQvuuu[vu[vuu^vu^vuu`vbvubv`vuevuevuuhvuhvivivuuumvumvnvuunvuuuuusvuuuuwvuwvuuuu~vusvutuuu~vvuuvuvuuuuuvvvvvvvuuvuuuuuvuuuvvuuu vvvvuuvvuvvvvvuu.uu%uuuvvuvvvvvuvvvvvuv vvuuv)vuv8uuv)vv.vv(v.vuvv(vvv v vvvv;uuv0v0v.v,uuQuuDuuhuuluuvFvEvvFvv@vEvTvEvuvvGvLvuuvMvLvvv@vvMvvvvTvvvvvEvWvZvXvEvvWvvvvXv-v\vnuuv-vvvYvOvvVvvYvvvDv4v;vNvcv vNvcvv;v vv4vvVv\vvtvwwww-wgw-wkw-wIw-wnw-w]wwv>wlw-ww`wXw5ww wgwmw w6w w9w6w w9wMwmwwMwwavwwkwKwGw#wKwwNwLwwNwxIwxGwwxxIw_wjw&w_wLw#w xbww xbw xv'ww&wv'w{ww xnwx{wxwwxwxxawwxlw7waww7wxwwwwowwwwwwwwwwwwwwwwwwHwwwwwxowwwwwHw2xw2x3x7xwwwww7xwwTwwwwwTwwwwwxw$xwExwxwFxwExFx'xw>xw?xwJxLxwLx-xwNx[xwNxw8xwJxwcxw^xwx+xxxx+xw?xx xx"xxw xw"xxxxww-xw4xwx4xGxGxw#xwXx#xxXxxxx8xHx&xx9x]xx9xxHxxx^xxIxKxxxZxjwxZxKxxIxxxxlxx@xx@x:xw xxxw xxzzzz>z>zvz!{zz|z,{z,{.{z.{zzOzzzz {tzvzzyNzzOz7{z7{8{:{z:{zz>{z>{?{zzzz8{zzz?{zG{zG{I{zI{yczzzzzzfzQ{zjzzzjzQ{zzU{zzzU{W{zW{X{zz[{z[{zzX{za{zzzzza{zze{zfzze{f{zzzzzzzzzzf{zn{zn{p{zp{q{zzzzzzzzx{zy{zx{y{{{z{{zz~{z~{zzzzzz{z{zzzz{z{{{z{{ {{z{{{{z{{ {{{zq{zz{{{ zz{z{zz{{z,zz{{{z{z{{{9{{z{7zzz {6zzC{{-{{{z{({%{z({{/{{{{z{{R{{zz/{{z{0{z{{;{;{0{0zz]{{z{L{{@{z{z'{@{{{z'{<{{{{{<{{A{z{M{{{M{A{{C{gzz{-{{Azzzzzzzz{zV{zzR{{9{B{={{={z{]{D{{{{{g{{B{{L{z9{r{V{{r{i{V{{5{g{D{{5{s{s{{h{V{|{V{{i{hz{{Y{{j{V{z{}{{Y{}{{S{||{${h{ |{${N{{||{ |N{z{V{{V{u{V{|{V{z.{|j{|||z{||z{|||j{ |#|{{t{#|z>{E{{{k{,|{|z{w{{F{w{k{F{,|-|.|{E{0|.|u{2|0|{{v{P{{{{{{ |z{{P{T{{>|{{T{>|{{-|{C|{C|{{c{{{{{{{c{{{za{{{{{M|{{O|{{{l{{{{m{Z|{m{{M|{O|{{{l{{Z|{{_|{{{_|`|`|{{{{{z{{{{{{h|{h|k|{{{k|{{n|{n|p|{p|r|{r|u|{{{u|{{{{x|{{{{x|{{{|{||{{{{|{{{ {{%{{{{{{{{{{|{{{||{|||{{|{|{{|{|||||{|{|| || |{|{|||{|$|||||||{||{{||{||%||{+|+|{H|{|{I|{|'|T|{|'||"|{/|"||/|<|{|8|<||8|||{+||+||$|?||1|{{?|3|1|||D|K|%|$|(|||(||3|)|K||D||||J||)||*|!||b|F||b||*|S{{||G||||H|4|\|||I||||T||||c||4||||7|7|v|:|w||:||R|d|&|R|w||G|F|}U||I|U|j|}}}t{ |J|K|6|o||||]| }| }o|e|}m|||j|&|}}s||}9|||}q|v{2|{2|{2|{2|$|2|e|5|]|6|{|9|"}}|||a|"}@||}s|?}|y|@|P|~|c||~|y|||m||q||||||||}|{|||5}||P| }|}|||<}|<}}|5||?}}|I}|A}|||T}|j}|M}|g||{`|c}|||L}L}|b}||g|n}|q}|}|}|}|{r|{r|Z}|Z}{r|}|~|}| ~|}|||||d}g}|d}|g}i}|i}||||m}||m}|||||||||||v}|v}w}x}||x}||}||}||||}||}|w}|}}}}}|}}}}||}}|| }|}|}|}||}|||}|| }}||{|||~|~||u|}|||||}|}|1}||}||}||}|||||K||!||F||||}|}}}.}1}}}}.}}}|5}}}}}}}7}}4}&}}|}4}}}}} }}&}||}}@}}\|||I}}}}}@}|}K}}}}}}K}}A}}}^}#}}A}v||K}|d||}^}}}T}}H}-}}H}}D}6} }D}J}8}}J}} }j}/}_}}/}}8} }}_} }|5}W};}}}M}|}}W}}c}a|}}}b}}~n}~P}O}~P}~~o}~!}n}h}!}}!}o}h}}}N} ~ ~}}s}}(}s}}(}}}~~~q}r}e}~}e}2}}2}}2}~r}~f}e}~f}~}e}=}}k}}}=}|?}*~k}|?}2}q}|?}*~}}-~}-~}G}}}G}}}}3~}3~Q}}y}}6~}Q}U}}6~y}}U}<~}<~@~}}U}}}@~A~A~}}}}}`}}}}}`}}}J~K~J~}K~}O~}O~l}}}l}R~}}R~}p~}}}X~}X~Z~}Z~\~}\~|w}|w}b~}}}|w}b~c~d~d~}}}c~}}}j~}j~}}}}}}o~}o~p~}}}}s~s~}y~}}}}}}}y~|~}~}|~~~}~~}}~}}~}}}}}~}~~~~~~~~~}}~~~~}} ~~}}}~}}}}}~~~~ ~~}}~ ~~ ~~}~#~~}#~}~~~~}~}7}})~~}~~}~~~~~)~~~}~,~,~~~:~~B~~~~0~~G~~H~~T~~h~~~~{~~#}}~~~~~}B~~:~~~~ ~-}}6}}r~~~~~~~~~~~~~~C~}~~;}}~~~~~:~[~C~~Y~}[~F~}Y~F~~~0~~~G~O}~~~^~+~~H~N}~~^~~~~+~ ~~H~~T~~i~ ~G~i~f~f~~~H~k~~E~k~~E~~D~L~~T~L~~D~h~ ~h~U~ ~V~U~ V~ z~l~l~$~ z~ ~{~q~`~~q~]~}~1~$~h~`~~}~~ ~ {~1~{~>~~~>~~~~~}A~}A~}A~}A~}A~-~-/~/010r~~~1~566~~~:~:;;~@~5~@A~~~~G~A~G~~~~K~KLL~~~m~~Q~m~~~}p~Q~Y~YZZ~~u~]]~`~`~~}|~d~d~~}~i~ik~ku~~~~o~o~~t~~~~~tu~~u~~~}~~~~}~~~~~~~ ~~~~~~~~~C~~>~.~~J~~~~s~~~y~~ ~~~~~~~~~~~&& ~"~~~~ ~ ~22 ~~33 ~<<~ 4'4~CD8~~7#FF~~CD8#,U~,7~>U~B~!!B.*+*9fEHE.gjgJIM=f9]~~v=M{vx{sIHxm w~ wm  O(? ~1~1(Rh!Nyhz!$$O?~@~@P~@~@,,--11445NPzR|TXT5~X@@CC^^b~dbMMOl~klOVVZZ~uddhhiiqEqss~}"} :8<  ' .32/20"= ǀ"0/7ǀ+DH̀̀̀6πЀр̀E6jـ7/ـ #ހW=ހW#N;.:3.NπEЀE?\\рE:?8D=<o ro8>A> Ar%`PPuTg`T!uÀuQ%lQŀuˀuʀuuu|-lYg׀uuYu]u]g$$&y&un**nFy- u/5|Nu|FuCu58wF8<-w<==DZDEEjÀ/KKRjjRSTTXXYɀҀY_ɀ_ՀacĀcĀa΀Ԁiji΀݀ojŀoŀ./=wڀwҀSÀӀ|}|Ӏ}ˀʀȀրՀր׀ڀ݀؀؀   ۀ'!'!0܀336 ۀ܀;Ɂ6Ɂʁ "́242ʁ4́"ԁNԁՁ%LFՁ%>.>ہہ.ށCށ?Q?CUU970;:;fZ@f\ I\IZ:BGAGmH @BVxV7QmJ[[Mp  putlW`WlW////`Af""%hh%uxtx**++//1v12266OOҀSSSՀSԀSAA^^bJbJQ݀jQǁSSUXЁЁցXUZ[݁ӁZ_݁_bρvb؁eȀׁeׁ[klnn؁k߁ǁl߁zz{|ā|āƁŁρӁƁف ف܁0܁ځځ  &ȁ!ȁ́)́.с.$с7$78Lԁ84!,Ƃ Qށ)!Ƃ( Fɂ9̂0̂4:ɂ(0#FM!,!ׂMׂ5;ق#W9WJx9'F'ق5:F:M<T3cc3 j<W{q`qqqqqqHFFHqq qHqjNq q qq#q(qqÄqτqqq q8q>qPqmqnq|q}q(܆qqq(ot**oqqqqqs4s455ǁQ99ցQ<<==Ӂ[DDGGÂILILPĂÂĂPǂmǂnmpXZ[p؂X_`{!{F{Â{{Ł|_Z݂[o݂ołrsۂxۂsx{|rł܂|܂‚{Ȃ& т тȂʂ‚Ƃ;Ƃɂ&'&ʂ. 686/ƃ .'ƃȃ ȃ˃˃̓̓>Ѓ3ЃӃBTӃB+ /QU؃Q؃Nۃ"ۃ]H@H] /)@0)a0CEaEjjeY3>YefefJ8K?\J\KzwzwtbR  b%N^%Nt*^"Uq555k~!!k#$$y'(Ay+'}uuA}4u4+88S==@@؂[CCDG`GH``DʃɃŃɃRʃRYŃoSHYZՃɃZՃ__ƒcc҃҃jjÃmǃɃppmxσ̃Ãxzǃz}уڃ}̃' 8/уڃ փ σ*ȃ>ȃ+ȃUȃ* 7 ك„::--ك„Äń ń7 &;,ɄC˄Ʉ;˄<<)τׄ2Ne?R2ׄ%ڄNڄ.܄݄/I݄/%܄.ea[iV0[eb0iVabEbrbt rEaKq~SKbSbvbsbvs##Qu((Ƀ((((Qb1|X\X\1|beww>q"t'{>"t'())(,./0q/445858{,0DDGƒ_GIĄIJ̄LPL̄PQmQ[ȄĄȄ.[Ȅۄ΄_ۄ_`a`̈́c̈́Ȅem؄eփȄamoքo؄ȄqrքȄq߄߄ȄȄȄrJĄބȄcȄلȄȄȄللЄބ7 &Ä,Ä)Ä  τbττȄττ:τׄ:ׄIׄÅ9ÅąŅƅƅEą91ʅN<ʅ19:E:2: ӅN=:ӅԅFMԅF݅KK;;݅ޅ߅ޅ2߅2M>:=>36Ņ93O?@@dR?]i]Rs^shbu6OvxvUbUxt  h^ (ffS{7{ZZyAl7lg!!"wj$~B~"w$ygAB,,JJ3345458z;y;>B΄[BFFHcɅHɅOOP̅SST|х…لqTDž}…]ȅȅ]`ۅۅ҅`bׅb|˅}gՅgllmnͅppͅЄ؅΅؅υ{υDž̅{|V}օօׅ҅ څЅх̅څ #ƅ<ƅ( Mƅ#-( *-%* ܅†܅ĆņĆ'† ̆̆  ΆOņ&&G' I0ԆԆIdΆ)چ6چi܆//^uxt1[60C1UU.C[aca^KS   z G.j)GcjEeLjdELe^[$Wf W ~q_2qK[~fh2v8vh>i'>'>Bs--t1t12442̅P҅P˅PՅPAABCBJCJkOOQQkdžkdžn΅n\ZZ\_Ȇ_``Ѕ}} }G}0}ȆkÆkmmooƆֆÆsƆswwzՆzՆɆ߆}؆}Ɇކ؆ކ؆%$$58+8 ܆[܆iÇd܆< <VMdχMχ?(Ӈ?ӇHHVههڇ!.܇K܇!(V3cc3PRPK.f_dD VڇVRvDv dWuuW%S"SaidXX%]"s''V'Ça]o{|d}#~#jj@((Eq*E*77@+ 7A4bAȍލԏNNOaOVS··Vq·ֆo·····ʇ·b߆zbcz··cɇ ·y!··Ƈɇ%·ɇƇyȇȇ$·.··ч'·9·F·P·5+ ć!  Ç·ÇQÇÇ}ÇÇ桡҇%҇ % $..ڇ އ& ňƈƈň&ḦḦΈ'ΈЈ9Ј҈F҈ӈӈP)ֈCֈ),:CQ-1Q:,/-އ./;Q1;\E\Ei6imQ`QQQQmQ6mkqqkujujQˈQKȈQQQ+ sl seg0ezzRl+2`R0277$tm$&&@@,,m.t.575676|SS>>AʇVA^^EFˆEKˆKLMMOoQROoXˈÈQÈXɈ[Ɉ[FR{Ȉ__Lj{LjddffhhkчkLψ͈шuvψ|Ԉu|v؈'шB׈Ԉ׈89Ԉ;IJ؈<N@  ƈ'-ʈ-1ʈ1'ӈوو!ÉÉĉĉB ȉɉ8ȉ*2Ή*Ήω҉;ω9҉Ӊ2։I։׉׉J?ډC?ډC݉މމ<:J=YYKg:GɉB݉J=NS\r]PjӉ;NPS@r}tNj}o}y}]UTUl} %oVmm% Nyg} T+. Vp}`^p+`|7 l} &Hgn}}&AWw++,ʼn}3n,FH}34}~}Z4~a}=XwW=EZEFFʼnljaeljeNNi͈kTiTVVWWʉ[]ۉ]__bˉb[eegԉgiikkoىoˉԉttuىuՉۉʉՉ‰‰߉߉(߉߉)H ! ĉD. ( ؉!'܉!NJA܉GމANJ؉((-ъ77-ъCԊCԊՊ؊)\؊ՊۊHۊ܊/I/1K1KD*c*:BSBX\܊HXZ<^ZLhhL$~~w%YxJywaw:cZJ$x% Y 0ymaZwwm036d6`d`""@w+ww@+F//0r3r34~704QQʉWWW7GGfLƊɊLOɊfOPƊPVoVo[Êo[^Ȋ^`̊`b׊b݊̊ȊehÊhenߊ׊nop݊ߊ݊pvvΊيzΊz{|}~ʊ ʊ Ҋ ڊ.',ˊ,. . ˊъ##:֊:1Ë֊1ËI܊ȋȋ΋ 5T =c΋ϋS\Qϋ5ՋQՋ׋T׋<wKM݊ߋKߋ-'R\-f2ZZRM\MfMH2UU;SSM8;>8MHMg>MygWNr" N XRddy0]y]6699$%yy)%q.Xr./1$xyy6)1x/;;<=><_BȊ[Da_H6aD=O>jTToOXӋXoZ[BيvH_`ajeʊMyZӋҊeڊ[t_xڋx`{ы{}Ƌ}ӋڋɋыƋԋԋatދ  !! =ȋ&ϋЋ*Ћ&(*(::042ŒÌÌ3&Œ4ʌ'ʌ̌ČΌ-ΌCE32ь،2-8ь"8،?یPی܌݌9I"?W܌#E5Q݌95kbkrqhqNlPEynynRFF#E'R\j\| WL ,q)j'Y,|+. WYz@]]~L7Nhlh)z@)++,,mGHGm343<<=cdBC=BJacJKKČdƌŌPQCPƌČssQٌ\\ٌό``όbɋ}ffԌiҌҌippߌߌދww͌{{ӌӌ2EI ԌՌՌ  0!!nj nj ֌& &#֌֌#ÍōōÍ"ȍ Q"1$1$b/Ս/ՍhLDٍٍL8Fݍ8ݍލ::'6'h'6M'Fh:jMRj ?WXkjxRx?x~WxXx dkx    z *yc*+dxxzxc}044Ō44yxx0m}xkx(m(xx,,..OxɍxxxOx8Q8Q<<VVAABDDƍFbHFƍMHɍԌbMPiPQ͌iiQ׍r\ʍԍrʍ\B^^b׍bci؍c׍̍ip͍͍ЍpЍww׍}}ээ׍1֍ԍ؍܍܍"ȍDȍ0"/10:010S0Ž'ލxލލ0ލ{ލ͎ލ0Ž:O0G2ҎG$02ҎN0Ԏ؎I0ԎS؎3;ڎێڎ3ێ**T_0Oo0$NLL4=0U7NUI_JJVoK{=KtfRW{R{u{#tX#W Y uZzYX{Z{zaee{{""$|$&n&'')D)q--2q{25588;{;==]|n]̍cЍcccOORRSTUVWrVЎZ~STUЎ͎͎͎WЎ͎ގ~r܎ގj܎jkkݎ͎rŎ֍rttŎݎww{͎{}Ȏ}~͎Ȏ͎ZЎ~ӎӎ͎͎ՎՎю׎׎/  #ÎÎ !69*9;؎T؎!%>ď#ǏDǏ D6G6ď%ΏGΏN@4ҏNҏӏhԏ7׏H׏؏؏?H܏/܏3VFI?QIFJ44J3Xf<Y/QӏG3QCaXQE<QYQy+]  PCQyQEQQyfp][,fP^^+q,gqgbb`;'o'((++v2v`o2xO9x9;;==AACFFcCϏcՏllWWYϏYZ֏ŏsՏŏsZ֏``afяȅ̏efяُݏڏݏڏnz͏ю6ُn͏ۏz}}ЏЏޏ*>ɏ!!%ɏ%@ΏQ ԏQԏԏԏԏԏ͐ BwBBߐBǑBܑB9B#B4B͐7BPBOҐҐfBBőB,אOB&BEB&oBHpBqB^BB B2BאOʔB[pΔBהBB&BGB;BHdHBLBMB^dpNBpTBD,Dd~po~dodspUwU+pw2bbpsd!!##$''(A$w(..1144588V5VB[B[FFaۏaaޏaafORΐRϐTؐOTZؐZ[\^^z[\eeʐÐΐiʐikkmmttvvw|ݐݐ|~Ő~ːŐɐɐِ̐̐ѐѐ֐А֐ސސpϐːԐ͐d͐w͐͐͐͐Ԑ33%%  ߐ ƑǑƑ&̑D̑ԑDԑMGؑMؑ <ڑڑ ܑߑ,,NߑP-&]Q2]26hfhYh6fobo7ln`7YSnPNgdqSqghs-NjspQNd"ph"jUXa_Uacr:X_9}:u}"#r&*"u*.&./3/x34667;;=??B\ȑ\Ð\BȑKNKNPQxy͑ʑQX͑X[[wwِwwАww=yÑёÑfݑۑۑݑopoޑp‘ΑyΑy||ޑ‘đ ˑϑ >  &Ǒ+ őGǑˑϑ%+ב8<ؑ18Nܑ%:hܑ_ܑܑ+˒1%˒ΒD!ΒD@ב%ԒM@Ԓbl`ؒ-Oޒ>!:-ޒM:Ha9>9eH:`L\CL Chc hca:Fwc{FtؒMsEs^gg`ex####xSuS0wtbb047!d77!\e{t&&'B--/Etd/P'ʑP;ёP;==>>DDEFFIIJffflffJlVVXŒXvŒՒђvzՒzaaҒҒ~ْđ|~hhkǒknnopqsגstǒtȒגƒƒȒƒْђڒ:etڒ ڒ   ÒÒ))  ɒɒ ϒ 6ϒ6(1֒(1֒ OؒÓ Óœ$œ ɓ$,ɓʓ˓,˓9ѓʓѓ"Qӓ00RדUד#"R9,KTK+#ӓ+*`U*7^,`T878<]2<L]M\NOMuON^b^S[P\PSuWu[    ddc''}e W}Yrw__fre"we"'l??ilEђEE'112zZgyy~8989??B~ZBHjiHJJQgQvjƓ]Ɠƒq qq,qQqTqv]_bГГbdēdhēhiȓi_ȓԓwwԓyzyz~ߓ~̓ݓ֓  ߓݓ֓#ɓϓ)ϓ0)ғ0ғÔÔ&Ɣ&ƔȔ%Ȕ%ʔA@͔A͔ΔC!ДLՔДCՔ2ה\ڔKڔKb:Wޔߔޔ:$D[ߔ$(cRMR(D^3V^LVY e  L Ne{r{N[f[rs|ckjk   j  cv+!U+z222222a casr!%Uf%&)gB),g,|r0GJ0PxPSx::;S\\YYGGHddLMNlR̔RlTUUϔɔY̔Yϔ\]۔]˔b˔b̓z\ggєkllnoqӔqkєӔݔnҔzݔz|Ҕ|ɔ֔֔  #ؔؔ""$$'ĔĔĔ'@ʔ!Δ(Д*"tהWהDהMה*eה< ƕƕ<˕FF = ˕̕̕=I3#SIՕSՕ676@ڕ7ڕەܕ('ޕ.PrkvfohhĔhܕa.hc˖hhЖhԖh9hhhە@hhhޕaVhhWVNh t!jhlh &&)WhyyX_hhphf8{whf8#;%iAh*i*#,//J7@Jac7NTɔT;۔TT?@9@#]j]II%ANtNjRRxȕooq,ȕxcc~ϕ~ҕɕҕѕҕnϕ;npɕprѕrtӕtwwzǕz?ו~~וӕҕҕЕٕЕ  ҕ'ʕ$'ʕ$-ԕ1(ԕ(-'&1'C9Pޕ&'ǖCǖ:ʖʖ˖=ϖ=ϖЖHӖӖԖՖ ٖUՖ ٖU!<+ݖޖݖ<)\>]T]Tޖ)5D5-_>\oX o_SFSqAsAsqF{`v`VvV k k W },,bix3Wv eix` 3{##}v%{%mvGmu-e-yGbv2yN2PP|:|:X=XX[[=HHKMMNOjKOÖlȖÖXXȖt^Ǖt^_ߖҖߖkҖٕkoܖܖopqqזvw– vז||}~Ė}Ėɖ+ɖ@ɖ1ɖDɖ4ɖі~іؖؖ9:!Ɩ!+3ƖHЖԖ!Ԗ+Ԗږ+\Ԗ ږ—>—> ,  ȗ,;ȗC;˗C˗̗@D̗@Зїӗ1ӗ՗D՗ח4חٗPٗFۗܗߗۗYߗQ.SvЗ@/ Aї@PrcyaYrA.rSSr/rArycrrerr"m"ru#gmܗYƗrrɗr֗rc0g0rؗr``x6c6rrr6eEr3rPrxtArF5rwrzrtFVrr66zRRz==??[[F_FHHdƗdKKfʗSʗSUUpqYɗYZZ–wҗbbc|cɖrۙ~DԗpԗؖpfƗݗtut͗y|u֗|y͗~ϗǗǗϗؗޗ~ 3 ޗ++( , !#QܗŘ!ŘǘEǘ7*ʘ7ʘ3*ΘҘ3Θ""ҘD՘՘֘٘I٘Bܘ9ܘ$9$Pa֘3%T,%A55J1J1C;W 5 ClWlE\q\jqBIwGjGzxV    )eaa){--X2i2ei{!ww!Xr'r'?**+,+Иɘ, RR-ԘR0YҗYYYݗY&E3osușÙVVXԘX\\ۘu}ИbRbcȘۘ}hhiiژ͘mژmn˘͘pn˘pӘcИޘߘ̘zߘz ޘӘ͘Șɘט (,#˜ ˜Ϙ-ؘ&Ϙ Ϙ0 DҘ Iؘ֘ę.ݘ.1ݘę11Tʙʙ&&CCBҙ/ҙ/ٙU;UٙBOOEP]PS3YLYxS2o4d4TfT[Qk[k~WJrerQW  QfN} sNo og^g~fq6}6q""#j&&s*l*+#l-ts02u230t+}R3|=|=Z@Z@-__GHȘc͘c̘cGcvșHQ͙QV͙VWXYXÙv^^bvbddۙgƙgܙܙט RƙۙrߙљyߙۙrۙۙyzۙݙzWșYÙ ۙԙ)ۙә'ۙFۙәڙ%ۙ;ۙ[ۙڙhۙԙ      (9(ššÚǚ)Ú ǚ]'2AA͚ϚFϚLCҚ.͚՚Қd1Jfe$.J՚$454%D,1CkU5UDk;} [^ JChxnZxx~jo~n[~~fl f {m/o{~6T-Tm/]}~~o]6}6~̚~ؚ~>>h(Ksp(-ݚ~ ~-pKIIs ~~ ~~8::<'~~<8E^E_H``gљgݙgHR_RSTSVWɚWɚ[̚[ך]]_ۚTۚ˚_̚VКllКqqsؚstvݚvwƚywݚΚtؚΚƚy֚֚њښњښ ܚٚ Ӛܚ 9 Ӛ Ě Ě'CϚԚ33 @›Ԛ'1DǛ1Ǜ› ,oD1ӛ+ӛ+&=&cD#C#kDܛ=ܛD5DZDD*{DDD5C^l>DD*;^;m>mQQ;DoBpśDBțDc$kXdd$   X`r`x/z/za:a"#&#p, k,/&/012O0{2}1{}O~;"V;~@@ך[\D˚_D_Iě\ěgQIQSSgWWXXś\\ƚw^wٚw^ț|inio!џHOġ`V{ע{}}|śÛʛ Ûʛ ʛ ٛ@ٛ )ǛCǛ;ǛF!ZG4қ4%қ+.eYuŜ)o+%)Ŝǜ<ǜ<:$:̜̜$3ќEќ3֜֜؜F؜ٜڜٜ!ڜZݜ)GݜZp.VMVeBfB 8Yr 8lx g 99gUn'UzCzeu(o*LL|YN#N[C'|([*k5]]_1]k5!!##&&'@sr'sI4r4~P9P9:~>>?:?DDFGɜFKKLȜiiiۜiiHiWWXLXɜGۜ``bԜbӜdԜۜfdkۜkۜfԜޜۜssuuwwxܜz{}œ}xޜœʜۜzۜ˜ۜ ˜ۜ{ל ۜۜ  ל  Ŝ"  Eќ7--7Ý.ÝƝAƝ".HM͝J͝Н%ڝ%Н@Pf@lCTٝCnٝڝߝZAHJHTߝ%HZH[M[MNHN__eiHecH2gN2VVE_ic<QyQIy<H\vSOSaYZaYr00\r| lv ""#lno-oD#n-//qȜK~6R~67UqR7UDDFFGӜbGKKĝOOmkmUUVם֝ZםVZܜu۝`ԝԝܝ`bbcʜ{ȝcܝllnoq՝q۝՝xĝxӝ؝ӝѝѝɝɝ  ޝ؝ 7 1%ޝ' ŝŝҝ1ҝPН%30ž3ž<&<?ݝݝ(0  ?( ͞͞!2I!4,՞4g՞E8I.Hڞڞ.,[5H*J*:)[I֝۝ :8IkWkOMW|ee;J M5M;WP_|L|jL$j   Q N$NQPp_g++py/ug/u9yv]v  !]9$$*m((i*~GĝG0~011zS77<zS<=>?Y?YdIȝbIbdMɞMhʞƞh˞=oo&o2o)oWo]]ƞ֞xx֞ƞɞ>˞ʞǞpǞp۞rr۞vvÞ̞ΞÞ۞̞Ξܞ'ߞܞ۞۞ ߞ&ĞȞĞȞ+ &&ٞ+ٞß-ßğğ -ʟ. &.&ʟ%J̟̟%П@Пџ2Lӟ5A/Lӟ2ٟ"5BD"ٟABD/@&^2K63SKS38Hlo8lTfT[NaG^LNGE\zm!!۞!ߞ!!&!\ti((ztYqYY4XqX41`!`!"#"[fCC+j+j//11OssOPP8<8<>>UUDD_Ɵ_KK#ƟQQ͟V͟VԟXڟ[Xԟyڟy_ɟΟΟ{_ɟ[{ޟݟݟ۟q۟qҟҟޟxxzzܟϟ||ܟ~şڟ~՟ş֟՟ϟ    ,(Jʟ Lџ6џHџfџaџ  ,33   -56ɠ5(,ɠˠ-ˠ   2Ӡ ,ӠNנ6נoIݠ'@'@ݠߠGߠ:EtGZiT?WT?:ZYϟ ,ibZnZINhMhZcZkRrRr\}lj\jlZkMS&PS & Pbmnmcw w ""v%v%yAyA--..s11s77::;;??@AACCEGHGeeMOРRMEРZZ\͠\ΠtRΠ֠cc͠Р@֟~Рtoop֠РpϠϠՠ{{}}РҠҠޠŠޠՠŠ٠Ԡ٠ؠNZԠ##ؠ  2ˠ$$)ááġ<  9ϡ ʡ<ʡWM}ϡ*Fѡѡ*ӡӡDDQססSۡVQFۡISIޡߡJ&'Tޡ'KBT&ߡBJ hhkL4sq4 lkLsl>t>VFKFUkN!Uvyt! v   (N+|r_ry(W_+.ii22~~aa#x;#%%((XC-mm-Y|H44РOՠOOOOxX@@YWI`¡``I`¡NNСPPСҡSSҡU\VաԡZZUա֡ˡ]ء̡ݡˡe̡]֡eءh١ܡܡڡrڡh١r͡uvu͡yvݡy)ɡɡ      ġFġkġġġġ 9ʡ3. &ѡ 3/:/2¢&Tۡ¢ĢĢ'$6>$ 2.:>֢6֢ע<ۢ<qۢܢݢ0R0"Rݢ"=Y=QYTYQܢ<TlW?ObO\?\Wt?t;;m[K[AmA^sH slY   c_ gwg{cX _PaQS""&&ģѣ$BDZv77ԡSVˡVV VV]DD ]  sOOPQS͢nn͢x]v]x٢aaӢdӢdff٢٢jjlloǢǢo̢r̢rҢttڢyy{{Ԣ٢ȢȢϢԢϢޢ  ߢآآ`ߢ#'¢$#  +'+/--բעYע?עKע^עãբãģ45ǣ4ǣʣ990ʣ̣̣CEϣCϣѣ!ӣԣӣbITԣI)!ݣ)ݣUNߣߣU^<^6bb6VHHX;HVw;LG>{GpaLk`>ps`ks_ w  e xiizecxc_pg\}\88wp##$)qB|B)qu|-u-JJ4J4gz=S٢SSڢSԢS=@W@AmDWɣaANɣNңΣˣΣhmhˣoҢoYңYZƣͣͣvvƣУv{fޢ{Уfhأhڣkknأͣnppssuxxuͣ/ͣͣܣ ֣ ܣ$' 5ģ0ģ ģEģ%*!ѣNѣTӣ'( 77Ƥ(7<ߣƤ 7%77ʤˤˤ&ʤ+ФФѤҤդE&Iդ*7Ѥ?pcz,8`'7I?IJ8Ҥ?EI7,JilGli8+7OrjO9jrFo}vg_ gvm9r  Fr 4 U.bw{qU--bor./{w/q!!ty$%%$yDDL}/7/zLۤ7z:}:<<@@BBEEHHJJڣhɤPRRPnsԤ\\]x_aڤag_ڤפghۤͤͤhpp]ss֣uvɤṳ¤v̤7I8Grפä  ää&'8"#  ؤܤ#"8ؤܤť3ť&'ǥ*=ʥ*ʥ6>(639ѥǥ-9>;ѥ-.;.)UۥUM?ߥۥ)^ߥSSCL,c^?bm,_bNLU   #   dYxYTdCTFtctG tbx  ffi  jw(0rM jll0L1y1rr:yqqD*EDɤJ3*3|`7ԤR9ɥҥإԥ7פ_|`IIJLJOOϥkLk9ϥWW[ss[¤v__aݥaddfɥf˥ܥhih˥iɥmҥmݥޥӥstusޥåuإ~ץ~ԥץ٥tҥ٥'8#  =ǥæ#Z#U#M#æ Ʀ ƦȦȦ˦008˦=?#NYGiwԦ=Ԧ<)צ<צئ $ئ SHݦSݦR#FZUM>>NX`TXFTFb4bP]P?GvGMklelQeQxKx  { { R|kvj53j5y!!##((--//0y|04488O:;:;c[[ЦccܥfۦPPnWӥmnWYЦYzЦåt¦^¦^ަզզzbަbͦĦĦ}hͦ٥hkۦk֦}ЦҦr֦rsڦӦvsߦߦ٦vڦʦʦ ܦܦ A")æ8ȦȦ)Ȧ$ȦHȦ+.I.' ' S2§2§>ħŧ>*_ŧA N`4 ] ѧ=ԧ"ԧħק+ק٧I٧KۧۧSvQKѧAL,1L1J_J,M36M=6< Do| _D<U{UtZVVwt}u}w#  #O Oj{j{\0{{{a7a 7x x&&'{'{{{ɧ{{ 44ǧ{6y6;yڧ{;X??YXCCDDGGHKƧHKƧOOPҦk٦kPɧӦk֧Z֧Z\\]]ǧ`ڧ`dͧͧdͧاgjgاjkkçͧܦ{ͧܧȧͧçާާ||ҧҧ)ȧϧʧʧͧϧܧߧݧܧߧݧ*˧̧  ˧ ̧+,ЧЧ +--,K٧¨ ¨Ĩ9ĨǨ@@!Ǩ0%0%>3Ѩ>ѨӨ2Ө M9MM2MۨRoۨRM)#ߨ)ߨU8^ZuUMaf_:aBVe_ 8MeFB\hc^MV:MchQFMN[M iQMNM[[ ibnm..mb67o<lo<l~7Ũ++H00337P7;~Ԩը;XXWWBBHŨHƨdpƨLLOOQQèqȨȨWWpq]è]Ψyy˨c˨ceeffԨhihըiɨqqrssvvyy~Ϩ~rϨʨרʨרM* ̨ͨ !Ĩ*4*%-̨ͨ%4Ш"Ш "֨֨ *ũ#ۨ$* *A*ũJ*R*ȩɩU*1&1ȩ$*>ҩ>fҩ֩ w*֩۩P*ɩ$PK۩5[4II.5<`*F2FS.A\=M/ \n MJ/ VGVuTuTa?aNEEN_j<[_ U2[ wR0`{^0^{  g%%&*g&*DDH0011OO99<<==@@ABΨ]ɨ]AJBJʩMMNRiNR[[˩˩t^t`ǩܩeǩ`^egghЩhƩЩܩpƩprrsЩ}ʩΩ}ԩөԩϩϩ-ө!!!&ɩ$K֩[֩S֩ª)ª!ĪŪƪ>)>'>+>Ū+ƪ+Ī'Ԫ"$!!=Ԫ">/Uت/ت۪6G۪ܪ?j]X]ܪCSS(YaGOd6>dOabnb_ot:DC>YX^ʩܩЩoIFDuI#FvI_n:# t j~-j,u~,-ZZ11vlkl!?%!%?'?'˪Ϫתz6T֪R6T=Cݪ=CEcHcH$iEi WWsΩsssLy˪yժydժfϪȪdlȪϩlfpתp٪٪zz{{֪~~ݪǪ!>XGnǪڪ  ڪުݪݪު$ɪ ɪ"#ЪЪ& #UԪ 3"5&5354ȫȫ4̫(̫ͫ7D9ͫ7:8:K٫8٫RI«fRKcGc5PSP9;,,F] FZ BZB;emIe9DJIJ(tNALkM\OM[OtMz%%Nv\A(vu[u<g>n@(g<<>w<n@(+jT+jwQ113355xwQ9VVxTU@^@9_^H_U««iի«iPoH«īoPګī«2«:«]ګ]«aի8«ad«d7«jjlԫlnݫnsԫY«suuޫzz||}ƫ}߫߫ɫ֫֫˫˫ѫ׫ޫ5DS]mƫݫѫ׫  ʫʫ4,ث  4,ثì2ì  Ƭ Ƭ:<0ɬ Gɬ<άάЬЬ0Ҭ Ҭ86B׬۬"۬E׬6B$"$E'DJD7IN;-I:-N Y;XfXf \L t=tO=OL{{FQGQRTb\fVww!#R W^b#WW!T V>^yp!p!?#xk>k?#xKϬS./~.KM/yM~SZǬZDDLaaadddLggmTĬĬmTooϬŬrrrŬʬrޫuu¬``¬beԬԬʬeɫjbjoǬoլȬtլˬȬtܬ̬ˬ~~ͬܬެ߬ެ̬߬ͬ   ìӬѬ&֬&ѬЬ@Ӭج֬4Iج'۬ƭ48J۬ƭɭ@ɭ˭I˭BB'GGҭ1R1֭ҭJ֭Jۭ8ۭ$**$a(FGaKKf+C+^C^f>=>A?:A:lE<EZvrwrZfvf<wdfq q xf"dN"uN)uss)5c]xcfg]5m5!m!##fFn)n)O4pFp9ޯհ4 Of9<<=+@A@IiIOOOQQӳEW~WXZZ\\]=AܭXܭhԭܭh]íܭޭ­ԭpޭAܭpssuíuvvܭ{{ܭʭʭܭܭحܭحܭܭ$'--%'˭R˭ , $((>*>$îîĮĮ*('$ͮ&ͮή&>ծP=?lծ֮ή.$ٮۮSۮ֮+T5T5.>BR[_P>/[ٮ+8/+>S>8M`6B>otoM_ `gwDR>CrwCk!m 0g nknx1cg0y2yx12%9ܭ9$99>9_9%c=wy*rHqHq00U|*y5:|5:U@@\­\\IIL®LOOQQŮTTʮzXϮX]]_ܮ_ʮz®hǮ®®ܮ®Ǯ®ϮhijiӮѮjrѮrɮ®yӮ®y{{®׮׮ЮЮخޮޮ%ݮ,ݮ & ƮƮȮ&Ȯ̮̮1(1(߮$ 4į4߮&į ίίϯ'ϯC6֯C֯62 Kݯtݯ\ޯD® r7a$1SaS7oZK moJaP[V[RvRwJ`Fda`F!dM!fM fPZ uu"sUxa/x"daU/speaaȯawve88pp#$#@BBB,,08x02239LŮQ$x9:;:>>YY;EEƯů^^ƯJKJKȯOTjɮjOT¯XX¯3]]¯ïگۯ¯{eï¯eghɯgɯohۯخoq̯qǯׯsٯʯsǯٯyyz̯¯}}z˯ʯׯͯͯ˯ׯ Яկկׯ1'2 Яѯ  6ϯ&ѯ64 % -'aޯ¯ޯׯޯޯCޯ&C4C'%ϰ-ϰI7ZV԰հv(?԰7ڰ8(6CڰIC@8@)MBM)B<`c5`k5<jj=l=l_i_GFGnwn WWP . kcYS  YZSSSZa[at3{A$>$ů>AD{D1K1KNN7788VV??VCCگ]F°FGG°ǰJNJNQQSİS°UVʰUV\\`ͰͰְǰ`bӰbcİǰưаgưgǰjҰjmðmذqذqsstt۰ǰ{۰{|cӰӰǰ|ݰҰаްްްðаٰٰݰ   ȰȰ ,ɰ,(ܰɰ?հܰ;3ı/ı)<;c5α(.α<(/ձ.ձֱ=5ܱ<iPܱޱ ޱ ^)Fw'ֱ.)^D'hEkEXS  ǰ а   [Dh[ TzTtrOrPn]RnP R lnl[^&x&xa2a2]^uuXk""%n%((v*+0*v011559N9:}ʰV:}?ְVF__F?ȱKȱKMMiORSRڱSt[[]ڱ]ww|c~c~mmno±soررs±n}}ɱ߱߱ƱʱɱyݱѱݱƱʱ ױ^n 3!!,;,H<hkʲHʲ˲ͲͲββ-;˲<>ղֲղܲJ<ֲ// ܲ-<zJVO#^X#V\`\C.ii6N6N.`BC`LBIIt^VLQtPtWttQXV P (W+++tu5$k:::kt$trDr)D)//2t2tOOORO;;==>?@@?__>GƲGNòNPPpRqϲòƲpRqpϲsƲвƲyв̲yƲ̲eef²ƲŲѱ< V`ٲƲfŲױƲ}²}ٲڲݲƲѲڲѲѲ  ݲ%% IJ!"IJ !" >β&ײײ&³'*ijƳƳ³'(8+ij8.0ͳγѳMγѳAӳ6tƲͳ.MFQ#H#K#QKH-Z-g<YqrqV  r^V^<SBgZuOdO d $  $<ZYZ`SZ_BZ2`p  %%@((++,-_-L,L669?p9@?@AADDEHHMMQVгQVWWaZ[ZԳ[ų``aٳcгeųԳeֳ׳ֳcnnoԳorttvv׳{{}}~dz߳ɳ߳ɳ׳ճ سճrݳس  *(AF+Ƴ0Ƴ""ڳ #ӳZӳӳӳӳӳ 88ڳ&8'Ŵ'ŴǴ Ǵȴȴ#I#ʹFʹFJ&J58G:14B8Gٴ1:ٴڴ4*8ڴ&ߴ5ߴ*BKOL._P_ON7jLj7P>CK8C>RSs|kRN\XTwUTUdXSsY|d^-uY\f  f$p$'p'(EEٳEE׳EEw6(Muk6];ԳW@;@ADD]HKHKNNQQSY̴Sm̴Ym´]]_`aִxp۴dz_`̵a۴ִεxpߵRtƴt޴>|ܸݸ|ݳƴ޴˴˴8Nݴ+ݴ6B!Iȴϴ!ϴ/ /7: Ƶ7Ƶǵ˵.ǵC˵̵)ε,ѵ,ѵB=ԵBԵC:<9׵صZV׵< Z?#޵?޵ߵU&Uj&>&^\fص< \ELEJgT4# JL g 4T Ujrb>cOcz*rOzhy hdzbuzzzzy*}*^}^zzdu1Fzϵzq1u#q#$%AAA.A´AF$.%GµzĵzPPеzSz<<>>??CCɵ``e` `:`GkɵekȵSVϵSȵVoo͵oʵڵ]ڵ]__`dµ{`d͵jjlĵlеuu{ϵҵ|}ӵҵõõ|ӵ}յյٵٵ   ,  ֵ)ǵε=ε9εVε5 ֵ+۵+2۵*2ʶ*&ߵzߵߵUߵtߵߵʶ&J̶f̶&жжD6,6Dն8Kն85IXI޶YKY'޶9UJX9AZ/ZA)'i/)h[MiUatah\LzgzqQOH[UQHLtn!Rn!N-f-MUqtfm7e7re7NtRtt@r@F~F~0mt0Pvs3sPTv{x^xT3{ʵV??bC^ĶC^bdMĶbMŶkQQRƶŶkWƶWXwͶζXw`Ͷζ`afõ}}ζfhhakkt߶߶ζζtζܶܶζ˶˶ζζ)  J) Ѷ ϶Ѷ϶;ŷ'ŷA..̷A; ̷η:ηϷϷNѷ;';P/ַPַ\ ;:;4Zݷ4ݷ߷7߷g1N;1TOi>ѷNdg>diJ<bJ bG<gj Gj7;9mm[9gxvgx[\\v~g  ]e]gegln|n  !lg$$%%**+FoF+wLzLz6RζRR;RgRRo>6^^GGcIcط·IQQɷpɷӷUU!ӷp[ط[]u]·ub}h}hbmmnrʷn÷rttv˷v˷ķ÷ʷƷķȷͷͷ۷۷ ԷڷƷڷȷ  ܷ  ܷ "1Է 1/ѷZѷҷҷٷ//22ٷ43T߷5޷Ǹ޷4Ǹ7̸̸758,и3и8ԸԸ:(H9#Hٸڸٸ#ܸݸ[ڸ':@R'(@;.BM;AP1~AcDcEX`=<=`FoX|oBMPEFad f  duWVo* f-uw*V-yye{ { !)|>>>>>>)!+.s.0015156Q9=9=AA*B^i|^Ѹ iVVWZҸҸոZ[\[Ѹĸ}\Ѹd}deggk¸k¸߸߸޸ vvWeѸz}}ŸøzŸø"߸ָ׸׸޸ Ƹ*Ƹ,̸9̸(̸4Ӹ*Ӹ*4D424R4C4Rݸn4y4.ݸȹȹʹD͹<D$X͹$Y4;MN;4ܹMܹʹ*<N%H%2_]HaW_]b4R{4|44<NCnyeYn b ci c {s++|q-^-q 666 !!w$$-yB4BBϹBB4B-/o/w22353;o5;ոWAAEĸ\EHHJJKg޸ggָggϹKVɹVrιssι¹]^]¹b۹bgĹ^ù۹gعĹrɹɹϹعйttݹݹٹ~~ŹٹŹĹйڹڹùϹѹѹ    ߹߹*""ƹǹƹǹ*.074ҹҹ70ԹԹ.ĺĺ@*B74B)NNҺ)ҺӺԺO:@4Ӻ@ԺYYQ:nY=YYYMOYMCY/YCRKYR]Y>^Y>T`Z`i Qrr?^ULTLFUFYYoyoYy1&q_&YYYq[[1j_Yyjypy!!;;;&p&Dn-nD-IuuI22PP889:9:@@WDDWHHLOLOSźSv̺ºɺxºYYźǺƺɺvƺvx|Ǻú|ddȺͺͺújlljnppȺrrպֺպ̺ʺ}ֺ}ʺѺʺѺ˺˺ ׺  ׺$$."';Ϻ'Ϻ.ԺZԺ?ԺFԺ;>5ݺ><ݺĻĻA A<3 ʻʻ3(Kλϻλ(ϻC40=4CKػ0=ػ576?FݻF7XXKZݻ?UyͺcecEeEiVWBMqWBZKMUKw~wqT \T  m q [ \ieh{s{~qs{Ve!":v([q({mqIv,!H"hqHIN{{{N:,:=??AACCDIIaŻaPPRnnKnenqn{nRͻͻԻ[\uuԻһԻbԻԻhbhjһjkkֻrDrƻֻȻۻԻƻԻȻ [ͻԻԻ\ͻۻ"Իٻٻ  #5# ̻̻ϻ6ϻ& &ѻ$ѻ$#'ܻ.&ܻ ļ޻.E+&+޻ļ'ͼEͼ)& #%Լ3ԼռSU3%ۼSռ)ۼ#*U*^5B]`]7]FnOnY@O7`MF`^UY`@`MHKKz5UHHTz"MBUTalppaz44~ ~ !=Ի=#=&=U=`=!oqGosGs0ŻI0336lz699<<>>XXGGbJJżLiLiR¼Rм¼VVXXмӼѼ[\[Ӽ\ѼcؼؼѼcdeּټkeټdּknɼɼѼnürüܼѼʼyܼy{~{~ѼѼżrʼ"ѼѼ  "Ƽȼ˼Ƽ˼ȼ5..*%*5 , ݼ Ž ݼ%)ɽ$ɽ#-$5̽ͽŽϽMͽֽNN5̽#Ͻ$ֽK/Kٽڽ&ڽZݽHѼ5v )z&5ݽ7ٽ/Z57]==5DSCESCDvEv'F|^|(pqAqq!!!ż!м!Fv}pv^'UA(l}116`l;""zz((Uv+;l..sIslvv+6v68W8WYEYIEýJýccJNcNggʽRRnnνXʽZZX^_`ƽĽ^ӽg`ƽgmȽȽнѽ_m׽ܽoo׽ssuѽ޽y½޽~y½~ǽؽؽǽ۽Խuѽ߽ ߽ҽ۽  /  ),ҽ##))-ɽMɽ / ]ڽ*< Ⱦ*<Ⱦ@$@̾̾$L&LOѾO:MվѾվ:پ?پ۾4۾5Gݾݾ5?MYQY,3,AI0I`HnHA3 rSB SBxwjxbjbtTw4MTk  1}}z tw( {lp{Uw7U1lp1a7 7a "v"vk)kk)++,,rn/P225Pz9VνR]FVZĽZӽZ]нZ9FJ5JK˾RRܽmUU¾ξWW¾YZu\]^ɾ\~~Խ~ھYɾnھZɾnʾqqtt )yy{{~;þоҾ;о˾  ޾޾MG3<&A~-%Ӿ-0%Ӿ0ؾؾ66ܾA1ܾQݾ 1 (>(˿>˿GϿGϿп0MHnпMwk7Hۿ7ۿ!:X!X&*&[8[*;=8<pa`<az `pC=[ssb_Bd_eBNdN:HeQCbQO_VOVg//3v35?vo#x#$oxg?$}@}..4˾K@xξK4K6799==??@C@C^^H^[^b^fhƿfOƿOQQh6ʾnVVXXZZ\\^^eɿݿݿþ~Ҿ~eggݿ7ݿrrݿǿٿݿyy{ٿ{ݿ}̿}ݿѿֿֿ̿ѿԿݿԿ޿޿ݿ%ɿݿݿ%&n)*ӿӿEտ%%%&%) FE! FG G; !L5տ)I5L!ILBݿ%AAL:LUL:YLtLK1bLKhThUYtLbWLaLPLW[LfL ab +P`]]+`[fn q< &q&'(**+--0n04|4<::~SSi~+AZHA|H'(iUUsWǿrs[W[__adadeehhjjkknnttwwxxz}}~~z  L.G*#. ..5..$  33G>>X>G. .11T1TTXY/Y/.5.FGFCGC7G2Gm`.7$.5m2ooG^Z`DsDZG\IcIIfI^GI%bi"%i "b c66fg!""%%&!g&-{-u2{u23838==>[>EFFELLNNOOllXXr[[|r|bceefhbfh ww}}c# $#,',($( 0 +07#$ ;70'$))P ;P4A 4?A<:G:?@@Hs<P^BI$0PP^<ABCG dWPdRWHggvsvRsgC|y|yd*mQxZmQxZ*l_u---o-i~o{ l "#z"i#zI~+t+,,3tI357{7OSUSUCCEEIIJJOO5RSRUSWZZU\W__c\cksksxxyy + 1! ! 4$&6$9%/48%28)28)8T8/GGTVNV':N:6&DQD?Q?Q8D8=]=_>`8>H`llPB~B}|}pp|" q {^{Y+a-z^-Yn^;zmjamj;n@@++,tEq|{,tMOMMX;;W[@X\[H@HIg\I}g  vs$\svddffkkmmrrttww{{}     1 &9   #  3 3 #?'!3?)?9?!)94B]H4?V8?VAQA8$7P~:e|^$7Ke?`:7K?<sP`?<J|JMRMRxxbgg|bh  v~v^~^jjy!!yj~$%ul%u+DDPszI+IOzO8SSB8B__ccJLLfTJfToo[\tt``[\ll ?s|h ||  &"" BQ554*,*A'3K3'P<KP<5/)/M#M>)^]545>-^-WRCWI9c~    FX9FmwgKwGgGZYi(YIRl$$$$$x(.SSx_.mX22_C]dh$qh$&t&(}(qyu,o,y0o011}4s4tNN9T9=}@@=bFesbeNNFQSSnn[Q[]__bbijijnoonx]x &5,A3"*+!!2;##]RX2#66:=::5E:C:c:7 ~::: ^>:^5:5-GEC-Zm-i7G::$:?V<?k<kmHdlHls%q%Uqu((UWKW{{4""})})BB-Ts-K{K5GTUXA@@XB\B\IIJffPPQJjQXXZZw^^__~~efgheghf;w"*+   $-V$>EV  FF 55SS  .#.5T/T56KN60KGo8oUAGC?Ui?C:A`iY`jc} c  t {uV{kukYj~~Vkl:!!d$$%dl%++HwH2J255t}::>>?X?wIeKLOOhQhYLQIxYccffhhxqqKttzz||}} &  #/0N43  <E//GE68#VV?j}k VG'F4V'HFVVH VCeCb<VJ#VbJZiuiWZVMVPV{V{MP%%%(k%x(kV_Vx~,,V[~[8kg8!_g!##rw@rsjj@)s)++//Wu1L34143BBHHIKKffIQQUUVXXVt\a\aeeiijjttvvz~~z&3**00 6 <E FeT : 5A<* 9O22Z6CxEl;M;M6WLW TuL@7E@J :A7 [YJ8Y [9OZxGCsGs]]uulgN gw# ^,fw,wkq`_4n`k o_=q=?? hh**r,Pmm,Iy2|4^Pf2yQc4|X?AA?DELccDLiQQiUUW}vW}ggkkmmrruuwwxx||}}      5!!-#.5-  ./%%B8HK/HGKG"7"9KB.8180X9];X0]RR6-dP17NFPSYdK@C@ZcZ;6FKl_lnoNCc_N$T&TYSr*[\[[[[ [t$\:t::%%A&EEE.EKESEJ:L4466~J:~VV^:@a@I^`aIbb`nRnRqqV[[\b__{{}\iiooqqyy}}~~   #  5'tv&**&7 ' --5P3B  3'+P+ ',ce8B'oq8)V)VC7][}Cb7b Y A ;b;]mYmDpDnAnJrJr^usu^Zs Z  wS gS.gzW t wW.zvaj9j9=G=|E|((*EG*KNK33N77T9TX9X`\`JJhfhhfTTYY{xxb{bddiirrvv||5%% $-$-//&&880: :0 ##K<<,;;6>=>=pU6U?a.Gc?.mj212mS nInGfFAI`eFfM`MaAoq!q!++c@@k)D)kD00BwS9w%LC9SAXoXA\\DgDKKhgTlhlTUpUpxxx`z`ffznnssyy||((K3  3/: a /1J*jJIM+M..VB HENEH,%L:P6*+m_,P212 mN X4 X4COl[a[OQoZZ}SQ uWu -W}S}hhw}k-05wk]}]55}xxz}i}}}(i(}F+F+}33Y6{6;z}}{;^??Y\\b^HHbLLgPgPjjpWWp]]~aabb~~ghghyy*< T X/  0VMY}AAv16_--'E*',R,S7<SO:EO7lTa$$IX:)I)VFkF /Z 8Z8MUjUjYQeiQiJeJ }Y N[ N %\l+%}oo\.4l5v4=v5^^>m=%%m>B,,G.BvG..}`{_c>>dCC_{`pcdOOSSp]pq]q_||d_dggjppjwwx5~x    0& 1 1 -R& ?0?8@8-0Vk$$R/B/BE2EPZTZ6TA``Z3i3V3L36Z[ AikVDkD@P@F}LFJ Q JnnZQV4[[4||##$$o))+2+2557;7=@@=;HHJJLLOOhhqVqZVZvvttb~~~b@~kklmlmqqttuuyzzy%%3.3R2. > F 1>N>3>F18>*>N8Y>a>*Y~>|>h,o>}ah<SS><XQ G>> GnQ X>>K>{Knv{iv'Yo$$$$$aw'ssw~]0]a0| o ""#(|#}}r(++,,00II7MM79:WWA9ABBEE:IIKNNKQQSSUUVWXXquVcceeillqWqi~~ $  $&*)*)$&1//1..2?4?,nY.i;?2%?4;>.Z.%T33\'T\]`]Y>M d5-'?Z a_ M5< d^G^F_FGa<HLHP@vyCvCOz zP gpr" g ((-\[6{8|bb8|6s##$&'&'*,,t..t4456:5:;AX6;AEEGMGMNNQQTTUWYYU*bdbdfWfppqtqtuu    .^p?\)`)++  / -7(B(B8%%8V=-V=9RHLO1@y2\\H2hR<h@@O[<{gjrgOjaraeKls]lK ]$$ ^^__mXzvXo666666#oer#>>((CnCFnFJ33J5L?wvwL5K?jWiHHK;miRUYURY\\^xxx{{^hhjllpprrssu{ {/-u  7"$ $ , ,19,;; 2@12@@*NOr! !1 *T-+NT-T+6ATFAl<XFTOmQz<TXTQvOTQTd__Qd&`&vTV`V[55!a!""k|&|&(())GGKKK557y7R[;;==a@BBDD@KKLNNkjjyjLssddggkkmmno ovvwxyxnyw+"8 A1u T+#A86? E,OC/<?A/P1P661 A21EA2G1EGcS cU>Uq1e1> qe,AOAFsCAzFuzusjVpV tWp }Z }  )h|X|f;;;;Wutuu/rXhu~f~/ tr5588::;>>AADGDGIIJJMMPPRRTT[wwwaa[deedllmsstvvwxzwxz|8Oy4t#$ !!%%&$&1<* *1 11 ?.. 1S?L)<1<L((==S]161j\1u1b1O1<X2XS02h1]<Z \6NubN@hOcnc|n|q  Kn KVn ^n^nnkn/V3iyy3i;;;;;;Akr-r-1144{699<6{<WZWZEEFIFIJOJOjjmVmYtV\Y\``xggkllk yy{{|  1n    !3 "7 ):0?##@G@73=858X! >2@=>#X)i)j))])h;hA_:3q;in^initxt2mM&mxABvvR'ZZMB&&R'+j+4]Hss pr#*eeDp r*D#HN5zNz577}::?CC?GGbbMMPPul u``|eefhkfklG=lhwwyyz|z|   "3? %%))&51&m)j1 F> EFE'>.H'.H_B^=T=B>(($$T-M+-+1gb080g8 mdodo i;i;p[Lqnqpj[Ln{j{IIjjYYtt\,2\~,r2~]}7!x:!ru''(s*+,J,J+v*s55N(]}>>NEvuEHHxccNNOflTUZTUZ]``c]icinnssuxuxy{{}}    ./  . %b 2<-2 ) <) - 0K"W"61W0RKSKR6D_SD_3\F8@@d\32VoeVYqYfFKdohwhw[GC$PP^G^Xk8KC$eK(fql}+|X|5755[q7$$&v&lk(v,r,(223d4OOOO3~>ab>EEIbIagjgjTTUWWUZ\^^yyy/y%y\Z mmppssuxuzz~~      Kqk|%x%%%o%%%%%% %(%*%%A%1y%%%%%6%R%=%]%%8%%% A3%A67G68*A7C@7G@C)9)bbB:A[B :[nrr nD}oH}HFb:DRkkr&&&~&R1]1``]44444!!?<?**,,//0044|8|8VV<<<AABBIHHIMMNNRRSSY]Y]x``x~~hhiilloouu *{{}}    %  %$&1$C.@.C91&2E;+Q+Q@&2C=KFok';Cd_'3C=CdKCTW:_WLTC:pvZvrrZfC|CjCmp_acpke ka   fmZnn|00jtt  !xs#$#~AAAAAA$qH!xq~@A@ADDGGHJJKLLOOPKiPooH[[]]__bbdidinnorrxx||~~A & " """ "%"E"%%1"8"3'"V"%QI_Zcec"19"LQ8y"}"'T'1)()T&hMhV>>` c9?=eg?eku*zs kRq #  Rzppf q*/fj/j:y:#%}%)uA)*A,*t3,34664#yP<{<==@@AAt^_^__QTToV^oo{^VQl"lmpmpss||~~    I'<-'+77::(&M.C$ $.JHJEHE`I1ILWL=upg]Y/5/Y15DgD9]W8jPFj>BF?B?Pub9gu[X[M {M!{8g!%RR\(\0_0`qt_;q`iciGc;"Knx"x((@GNOKyONzy8T8zU@U@ACCDDLnLNNOOkkZsZ[[__aaddggloloqrqruvvyzzu-C +  H1 /g/>1))  W>9 20 E027*/7:GB>b:TBXPT$GTPT\5U X^4$T4 ^\Te5TewtVpUTFn!Qs]n!s]VwW{XT+Wf+pwfj{jm!|!"#FwmAAAAAA,Qw"}1#122565<,R<=>>|`H`hH}PghPTTVV\\]aya yydffggprsprsd~~/   *19E   ./ $ Tw{/ $ .A D:DA%%&0C0 &O*887'*(+'(;W;XY4+OC:Y4 @B9 UqUZtB9bZbqetM`M_`_yN-y zzQ  + ShcXWF heqQ-@Wn^^^^^Enc3^%(===%==()SE)F Dwviwopu<Pb<[[G]]]GKKjRjiRuWWXXu\\]{d{]d :C7sswwzz{,{.>LmYqv    $!$,""&A&AWq'`.E'1E1>.V7VL:/:S^S^+FF*D+D=Na=a.e4^    m  e4mQYQHOjOjqL~~f-cx# ##v))cx) )|-|2l29!t9t!?yy'?')),v#q,IlxIM}MM}7::Z==7CZ]CD]bbLLggSSTTDuu^^_`c_cggiill`oo{ss!{~~+;WE+X. Q//?P.j7Z%/*>  >@;AA @"R"RW<#H<XEQf5a?5b  p88bdYkYdkF|FGPpaI[[MG|jZe44  e&B&mBDD--.JJ23}3I|9}9:2UTU.FFHHI:LLMMqQQoUq[I[tzz{eefgjjgoopqpqvvftzz#'%@"/#47+]  ;  V(!(B')B)#"/4aY|7==XOX+]';;E^E V,M,__ 5m5??mJmNmm`mJN}d$WhWhm }m  d$ T*Tmc*ycy.m`38m8mimmr&D&rDm../GGM/P6MP6RRUUBBCDDbkbKKNNgjkUUVW]WCV]neeiinv_fv^yyz~~!z    + 3+* +*3282;+8OF))F;-@@^-MM+<50<0I5I=E=G%G%4`4AYOAHdYdOJh  LL7Th T:>:_XbZciXcZfP$t$[t \w [^wg1\g1?9qQq9x99&x?&')R')mSa|jl{|8m{8Q:;RS:BB]DFaHL;FkjlUUokopL]]uaabHggiikkmmnnuuwwyy{{}}+E`HJ  !$$$-"=" -$. .EG+G7>VE+ =!"WKVW.=/I^=,KbI,4e4PQSQf/EXf^XspspAojNoJjc  c dR dlRh77!$h$%%zl((|ol!txHM5M58::<<=8?@@t=z?bbb$b=bQ|QRRUUYZ[[^aa}YZ^ .      Ee. /1/10-4GHG996'S0T&6'&-T>4T#2JT3eN27T"\3JETHTJ;>Td#T\ToAoBETeff ;"   l ]x(+dT~+Bx~xf]l` fC=z='z'(/C`(/r33{55{RR>>BBCCaaQQSTTS\\^^__bbcchhikkmmuiwu wxx{{#$# $ 2%42 )%?)614176?K+K+RUURAAKEDEpKAg;DAAK;g7 ]KW`W]7` pYY<rjrzjKKzqZLXnLX ~qjK  ~|t yr////Zj/sayt"9njat9}."G}G.st113345VP::V[>5>CC[EEcPl4QQlmWXW]]Xcceeiiruur )!2 KR##+/+&'-' ))&/!8*82GAAD;D;GRGPRP<j|t6R_R),S,S6_H`aFasR`FHps9p9xxRq{|qZ|ZTRtPT t } ~ }~vz[z[bbf4 f ##$h$g)h)*-*-w/0/w2047799V24V]\H\HJJgPPVVWWu\uu\aeeaiijjmmuvu/-v7Y *+'+' !% =%!,,(B( DD5=;;ILISSLMMLT_{N.TLNfU_LUbORv QC xR OT[fQCr`r`xfL yn s y }gsn}dgnh4  n$q$k(q(hn+o+--0x0qo667::?WWk?CWCDHDHNNQQmVVXXevvv|+vv|ejjkkssvvwyyw~~    ##'B5  LRn8 8K5.bK=OSO.".PR,"!R=%_TUT>T_aT>hTUaId I9B@;&@BAExJJtEqcTq{nT)h GG  c nA&)zuzr/Y}/Y|\7777 7}FDDDDF00ruMM|::WBXXWBEEHHJJffikiTTXXY_`w_`bbeej~jnnppttx 'x   !5%P,# 2 .4S--;;Tu|(.2C,/C/529;xt{5UFUSVSF1K1''Z[=[?(;@c?\AAWcL]yIa\]I^@LMa )NMQ*Q)f*Nddf33<7<%&7>%**,Gmm0r0G5r5z8z89:<<==YYAY____L_e:LMMPPQQAYYZ]Z]xxx&>,9llxx{{ 2VK  # 4 ,##  ( ' ' //1)Z)@!=@;J\L + y^+WJ$FF$-4W$W4G3N-imid 3 k[RwRvzvG}_Fk}r[}_}yq^qyOr}2,\},\2`gg|99999 9:>''|>o,},}s}}}3s355}}TT}aXXDDGaGHKHKLhhjULjUVVZZuu``eeggkkoopuuxpxzz{}} {(!1( #!%%$}]!6( "-"  NCmE2E #28w6]z ]FI$C]Fa9O^l_l8][$]`pi=M>j=i>Ma]9][]jh| ht|  to' \|\^|y//^y/bb3s"n~"##qBs|B~|--n|//55q|RROOZGGIIKKLkLpZZ__aacdcdkkllssuuwwzz}}  -++$$!&!I>0@30_@PU,J=|``>`0`,UP`NOjJ`4?N`O`mj`C]M%vep4`R%eR  x?`m`x/1C` m1# 't'v)*+m+//7y]LL#L)7Mvyt*HHIdINNiilUUWWqq\\u||eexx&   (%( o-23-2;"<" %D;;1!L'qL<;9[Ma9[$Q$Q,&0&., M.:0:Op[O a>>8aPiPn8?nVR?iV[tt//g/g3!#w"a@*w*,,ur0uC0n455vv@!]4]`HH`LOLOQRQpVVsp[[y}}Rgg~kkppqq{s{|y|~%  3&&#++ #;8;>" AB8"A=>=NN"B"''("I(I-P-6@R6 a2<2]cjE < ]Ej cWZWCZl^UlrU^)nre`dJ%d!`%f J))se)r,. fi ai44.s7?#m#&o?&mo((*7n,,nuvtx1*v1xw55wRO~;~;<<?AAD?DFF__MLLMPhPhUU[['%fw9f:ii=]VI}pvtvwyy   '%02 2 0(P-33-@>>EE+7/7GR/G$ RE$+9TJQ)JT)O\QO:\= ]6c6c knk88SBaaBVq]qWI.zz  u&V4}t&X,,X.,{4{!!<@}$%$}))@,,.p.u003t3%}Y889P9^=Y[Z[^=dZdLLMggMVVrr\\``||eejjkkooqqssyy~~ * ?PQ1:^R-- & &/N*Sv?ztP77+Q1nS:^FEFRWEN/bgbapBXBGA@N@AHuuHSTmTrag OrO %l_GX_u.lWnpg$zvn$%'*ww*I|%tJ|IJ4't457<7U<UBB]5]NNVVXXxx (bEbk19knnr.3Cr{{}}    "") )++!+!//>- &#>E(&1,9gXA0APOPC,O8RZYZYm[;.[0JfJW 3  e8gIe\gLKL@@DWcW]c] T  'w Tw Tv2gyK2y5ii $th h$%,jBBjt,..Mx4M466::=V=@@BBCDFFJJMMPPCRRXXppaabbmmqqrsuurwxwsx # (-  "99"82(R77(;fID]N5')'N\G(H)5HUG;I//c_e_;c3j3 v    SSK28jVdod_pofpVK``f  %%Z%%ZYkx.YWt1ythgh!"v"y'L{DDDDDJJL6{z688<<??A\EAEGJGJMM\RRSSWW|[w[ww|ffmmooqrrxx{{}}~~("8 %UIeK 2/2##99  @D@ ++F$&$:H:F($C(NCN=;__ekW/>e>ptsZ`ZtgP=NUUuggvv!|;Nvz''''''"peR  8 V"[ljLI|2I 2jLLW\\DDGGcfkMMOOPRmPUVqqqqVUeeooxx%/&     D 00 H' N'e`33 ?E?BH8HCBE)C)F#dsFu_#P_;d;aaS|=<=< I6I>XXpr>pZ{J{ZrJL[l"""YuZ\uu[Y\viY4vs``4:hs:|z:Lrh&|&z((++,-.001N,NRR R RR R-V1EEFLFL.OOllSSVYY[^^__bbchchiivv{{||     E8**52/5A3); ;88SG!XTG46ru3X!%6%/33W%A3C]WCKBf6BM <M<jijPZUszslZ\lz K]nuou \a`oawnz  wd99p&&p)m)mE//0303xNN9x9G~g~V[[[[[GIIMbMgqUUqYY^^_}|}ddll_ppqqssvvzz{{}}3) 2=BJ4%]f7$T7C$=!F!F,N,BJ4XCN4"'X'"Z#PZU-D-z`u X#eD :V :K i; =iK];]d PePW ((jj++W1~uu1~!!$$%%))*EEG0*M07788<<??BBYEEFFKKLcOfLSSlkO]]|}g|gppssz}z}=H6ImqV(( --.,. ;,@G9G=HVHH+"'\+'1dA,;,_Hd36_AH1\T^TMImm`N`HM^|w |  ~ lnl/q*rtr~wt/e_5ua av#$$Jk5y?#vEE yxJ0xP{40{QP9Qeuyk9K.KMNFR4UUV2SVcvrso}}}b}"}}%'ppH5KpMz{{,@  !9)).'".\   3 ; NG..GF"J^R.N"2S7QQ7wn5b5cn^SnFvyxSyST_zzT r_OO%r s*W*s-Wee%v44o-s ro""#<BmBm**ECE/C/2P7M7PU2?U?BB#<``JJfOfEOqYZZYqaaddggkklnnrrs!s|}|}  l' !; !$ $8&J;(;1 +,+,..<%b8<'&@>P>^@P'xH II[[3\H3\ 56o6Hh~DKK)K~]]Lwj wp  xxL)qqe pzho  9y9f%f%'v'Bu.BF.001Fu1zRR9:?9?Z:B^Zi^B^LLgNiPPmmnYY\s\]Nh{yvh]mmttvvw[{`lk ( 1w$!$"& )>*6&)"*# 5, ,H5H#@ODO7(7E-oE(QZZQ[Db+b2[G[j`4G2I4I le  c_cXXAAll_/kdj<k3daF}a8} e~ e'qz;usj/1/F3u~8pgpkq<=z;o=xo)x)++,-..5,445PSS==>B>B-GGIILLNORNROUyr]rU]{wyd{dhihimmwwz|z|!"  6@D-/0/  0'6'+6  21"20"M9?9YFY<Mb<bCb0<C 3S@Q8Q: Z@bVZS:sMgV3bvbybbMb bbb vyb;~X.b~b` 5 vbb5 X;## v((.BAB}.//T7AL7R;T;<[<[AAEHEHfdfi`RRllVYYV{^^`a{ccajjmmqqrrz{z{ 0  %"5">"W"l"%%S"+1+1b"))%"?F5"="">G'G='5|"8""L""L"2%>""323f\f@_@gZZg[oW[D]kDkII]>`BlB]!SM!hM h$t$ bTt}(4T/d4d44<$<$&&n))N~JHHH3H3J~N8|8::QXQ?@X@DEE?HaiapiDRRiUUWurpu__{{W{eeggllpHvvwwp1#`Y=1qr  x!!--'' \_o >>9,,9;;1FJ**%.(.(#``1f/fYa2a=2<h<qXGGiXK"r+SqSIK{I"  n$s"dsdqx0^{+^0ccb5b5ty|!Cz~Aut|A!y~C++tL/22uzL/PP<<=A]A=]]jNNPPjUUVWW[[awwwabeehhbkkppquuvwxq||vwx  )$ $4F4;J%383;8;9> 9/-%-((>) ;%h"5Z*Z05i&0*&@X:X.5:G@G.ZRR";gBgzBzRZtDS#t\E\E# l nL'n^^'6ssmm,{fSz7`{,lc7?f6!!<cyy?ClzC..II~3~3MOO?P`zMWW?CCDDFGbbbbNNoSSFo\Gtq\xx;xZxzxxggmmnrnrt~~   - -;  ;(8(#0#EE)/)/H55H:9:T&T1UK>K1&D^%U%>2e^Ue2M4M7UZL 7p`ZUp`LI]ufu]IO_LUkOkzh z iW+i[_f+W[}}j!v!"$x$&&)"l)**qGGGxG3344j<S<@@BBEvEqIIJlJRRSSXXtttttaaffkkssttww~~    80''%%+59+,5Ufh,0F/40MNM6C C- pY[Y-.[FFO`/+FO7`6D7Dpnnmbmb>Tou.N>mVPTmUmu#cm#VoUdmm1c313mm:d:;;)mmmmI)22355W\;;W==\CCDDIIJ3JNPPNTTUVXtttmtttU{~XkkllVt{txxy||~~y    '#' N+  /!+/%++74748W8&&W[EG[[[M-Z-[PoO[6OoGfMf>E[[REi\ij[Rk[Y[HsQx[\[ H[ 6f,[t[gqg[[[>fq,Qf3nz:nfz:?'?'))D--././uJSuY::S==VY^^EJEJLLPPQTWQWZZ]T]{{{ggllyyz}~z}~  #!%(6(6( 4f!Z(4(+$D9D!(+R9A92X2RA,0101*s8<,987*95Vf75 VN >N>UGoGmv{F{vOFO{d{Sc{p"{^p^"Si__d{.`{ic&Ufq{mf&@q@++--.1{133447799T{B.BababIIaMhMhjTkTXYX]|yax|]aiinnqqrtr{{(9f{    $$$$$$  $$$$X  $$$F$"DD<5??5%6%"6,/,O:/0Z:oOZ(2(0*2*8cA@;E CEWdW`;<SdACeppeJSJ w j^'jw[o'=o|s^|csuvk>ukc='v>'**xy,q-z}yF1244,x6991z2}>6>AA\Y]- llI2^ot``]x|hhiimmpp\y|y|}}   $ "$  %; ;%) %:++_/"8<@"M\M@7:/@3((aM%.73\OM)%_?V_VTM?.[^eMcEcBMBXIoI\lMdod!ggz ax!z {x { OMTUUY----%-ejkj"~")<<lCnC)nDlD02206688::;>;>bEbEKffQQKpqZq]aag}Zg]vwwv !# !MD<#N(%(<$$GGNEXo53?35?[[&RDbDRTX%_CXWDhDTC_ b9 @@9YWkk\fofo`D\h~k`ny'nrlRr  M ^l'^e-Mc-11spi4i4pdjje;;';s'AA--t05t50889;;==??@@FFGmGLLQQ9mTVVYY\\T``||ffqq~~  %%  & >1 D>2!1! A:734:43D#2 #D"XCBEWE6yCeHc ADeW6B d"DlXDZ_lHhSZjH h izS$ija..[[a<Jg}t$}$(g<k(nx$l.n.xItJ23{P3P8:==>>:Y8`^JJMMmmXXo[[]``aaeegjgjpprruuvvx{|{    DBHk// 7611)DD)DD 6ND=DD5_D57P7LQLQpD,P5qD,|D4E Z4D_DDZ^Dz  D D5S + DY }DASAmmYc_\lr D_bl   bc^fsy fW9dy^}3{2d}<9#zk}k<~@@zF#~..FJJw557N7<<=UU@h]]]@aaLhnLTnTU[U[]]xp_h||| ||hnnpq{{|""$$-->33P^W}w1>8,DDE,0%G&G4242I;I9/;('9&\(b/s%0bgeJAeJEAgEKtKB\BFVF  Vfr f s ``s o ~o)~*SR R* v)Sv ya y 6w  wicc56% ==% ==( * * + , zM, z0 2 ML0 8 2 8 ( : X? X? A A __jN N jS S kkW W qZ Z xa xa |c e |}c : 0&r e z z                      1 #   & 8#        & 3   3           4          7     5  '/ ;  /   . . 6  L F AM F t\ M  H V  H      O 5 7  <   [ [ G    G 1 r b - 1  - b  P L 7 E @  4 =   b  b  E P = a i  g ` c  g   b   b |   h f  h |   n ) b   j  n f  < V o  + + + B o + C v v X  Y    [ b  t 9  L b  9 }   b > } j f %  %  ~ ~ > A )     X B Y C I        5   I   5 6 6    9 ;  ;   >  > @  @   D    D E F 9  d   d     E  O  F  O Q  Q     V    V ]  r r 4 r 7 r V r ] ^   z b  b         ^        l l      p     p    v  v w   w  {  { | |                                                                             * (  !      ;  6   /            (   :     O   !              7  @   `  <     M  <     7 K B K 0 K W K  B    0  Y     W    G G K  ( = N  =   X  L   H L  ? ? Z A n X K    7  t  I r   H  P  A  e C C   e  d  I       }   } J z  J P K  &  _ &  )  )  ) K )  ) t _  t     2 2  s  ~ 2 8 s k 8 o k ! o !  9   f ~ % % f     ) *   . u R  . /  F u    *    )  :   R S  :  S /   V > @  @  [    [ >      K    K L N  N     Q Q        X  X Z  Z x  \  w \     x   e  e h    h j  j m    m o  o p   p    t   v       t                                       *      /                          :  v                 $   $     2  M         2 +   8 8 + Y       B  ;  ;     N       (   ( - Z  n  r   B V   B  B M V   M ^ B  ^  0 B  0 d   = I  =  I   1 z  1 B  Y    A   Y B  w d  w  r   A A B r B ~   A  r D ~  D     O  W  O   ]     W  ,  ]   ,       u  q    q  4 {  4 z " { " # %  %  r ' .    z    # z '  .   :   L  L  L B L  L  L  Q     : <  <     ?   A B ?  A  u    B    J  J K   M  h K  R  R   M     o  o Y  Y       _    _      | e    e |  h  h j  j m    m o  o p     p  t   x    x   z   z  t                     -   B                                       +                     -    *          I   =  ^     @ S   *  *        I 3  X  C  n               + !  + = * d   I  ^ ] &  ]   @ * &   S -  P -  P    3   S  X     C  T T > E `  E   y  N g  N c  r c    ^  r H g   H    n  %  %  %  %  u u d  Z     Z \   \  n y `          !  ! " "  k  % % k D  *    * L s s v v D  G / w  { L ~ | =  / w  { [ ~  }  R  R | Q  R G  = > E  } [ >    Q    E G  G   J  J K L L  l     l  j  l W  W   b   t  t t t gt    z K  b           j    j       &    D  a  u  1  i  u     s    z  y  e                                            *                                                &           +  !   +  &   2       2   D ) $  <   D  < .    $     ) , .   ,     H >  `  g  d     R X  R   ? I  Y  ?    a   D  1   i ` P  `   s  d 8   P       d  n ] 8  n # z ' _ _ t  o Y X    " t #   s  y  c U 0 c ^ k o ' U - ^ - y k 0 m  3 e  3 m  |  !| !#r # > %' ' > r q *{  ,F  ,{  F   3 3454      5   % @ @  * Z   Z F Ff    J J   g  f P P l   STS T     [ g  [    _  _ c cde  d he m h ml    q qs s    w w  |     |                  (         "Y   )   Q+(/6H  X   I  \x < < &&. .-8  -"8 W WYQ)/]  +26M;k2kHKHLM`L`VKpapl;lUUZ$\f]Z0f q iOiyN1x9yr]$ * *:uuXN1O0o7 57xr9oX:=DD5577=x T T^@@'$^+ _Jg eg%JEjjIX mXYY\\]^=^]dd~j~jkkrrss{ {}} '  $( (," + ,"99#%#EG'GA*'AI)VK)a=K8B8C-CQ`VSQg`FSF_gag_anmMmgggqnvMgNcHH  Ocgt Zt | Z_g.b.gNvgx777gggqgOgqv*|*x11PRP7RT;z;Tzb7@A]]A]]IeIeOOPPU@UVWY[[sWYacceeakkppqqwwx{x{||V !!*--B-VC>N>Q>vNQRDRX+HZ+SX>Z>]H]TnTd9drgyorygmbobg_f  m'' f \h'vv3ttmiih`3ss`jjmu!_gl<}==l@@++<u-E!zE~M3M^P3~z}V?\?@[[^@PPSSTUWqW[[\\``TffhklUkuuxx >n9h )<.l %ECAi]Y Cs )D<S.2<2%JQQ)EM^M.^Ai545Y4]CsBocwcip~~m||n  Bov X-----"-irp]Xvzqzr} ptF,,t/q/q{5{5U>F}>CCDEEHHDddhOORRSSVyXYV^^yccddkdklXnlrrunu{{||Y  (%(&&G'1102 9J`Z[F @;v;@Q}o?3?wg3GI)I'_7)6.6_w.*+7M*M-mn`j2 Z-] j][BxBFvQ }s s  4\8oW//vw\4W8!g!y:q:%J:g*hw*/%yqL/htzLtJNzN8w8@TY@AJTAJKKNfkNfWWX`rX`~~ffoorryyz||}z}%09""&& "<" ""O"C"<2"c" +G"F6FD?D 4"l"?O'P"H"Y"s"x'+"C;C+2;77cI3I43GlPH[a[awqYw{us#{~#  ~t0s))5s]]0>d5d>&'>A&00K'KK99::>XAB>AghghQQSSTTo[[^^``|cffcooqq}}     *   *6""7;<<;##!!=G=)G,),#?EDN?;a6.Nqu.taDJ\J36DeU@U@CeCrFrRFvK v K  i& &&&iYY++__3\ht2h2jjyH~d""~Rrms&BBB&mBBdHM/4/{4|sMV;;V??[_EE`JJKfKSSTWWYYTbZbhih7;!ivv{|      6  1519 E7#67#F ) 9@@F)G2\GNL*2NLN*:-$(.Z.-N[_$N[c\H(NOcN8PAtyU\NP8OMHNUNM x x] ^` 0^`++V/////w0~w4~?((),),--J2}2y5QQ5S;<d;V<JbJddNNQ}QnnXXYY^^_| |N||||iiqqsstwxtwx5 & !  ''&  !+/ : A0FBZF _0AB1A1II==+ KA/ KL47d7g3f\]KAHLA38OHMhehO4Ar|c|rcRagdR ~u~` jU\fy28ded:vvu|:l@lkj|`|@,k,.y.Sy3344QQQSU|y??ZAb___ _AbmQQTTmzs[_[_zbddbggijivvyyzz j    Ad| ! !@@/&BB6 Mf6MM<9G9U<G& U:O/@\P\S55Sa7f7"h= :<=Vk`O<hfYkllWm{mn{YfX  |V"nZ]a]Zao1^c1}#^oe8#e%AAAA@A<AD-8%DN-cNrsX{}pqCCDMIIJMDtuXpqXYatrsuYaddggjljp |l|} p?>6(K}TJ9@Lotb   /& &$$/ ;;. .P ?>6f`W{:<:7<7!(=!='KT\J0\0Q8|]Qm]9mJGFG]AnL@A~h~o N  NkkqtUUb oByyc  !$$ErcBrBqE0!01MMM3MM MR1AYAY[[IILLNNSllSTulRuThhkknnppssuuxxyy~~    &&"3 3 34"43'2%93:,2:H3O37'8'G)G9<Fm3F37%Hn*<*h)P\P\M9Oq z3v3M;CBCiYi;m#FXcBX(zeRec#+vOjR(-j+lV-lV={{|>|=}>}++--.224.N>>Z4Z]G]GJKJKMMPPSpppSp]]_`e_`~egijginojnxxo  % 5 6 ,E 8 D 1"1  70Y ?7/7h ?/,0,53L6L3::QEQYO&(U(9&8O9 Z&UDDZTTF RFXWRYXhBdBqq[V!m^! y   \m[++cy^bup;pkl;Vd\bl,k,--2c2KKKu:P:==DarDfaHHJeeNvfNnTUVKWrYZ[rvrabcgdrefIg@hijl/mnoNp!qr|stuvwxyz{|}~"TUVWYZ[abcdefghijlmnopqrstuvwxyz{|}~Wdcoreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/dict/wordform.txt100777 0 0 40 11643565731 17663 0ak 47 > ak47 test 中文> fffff coreseek-4.1-beta/csft-4.1/cs_test/t_cjk_mmseg/README100777 0 0 1002 11643565731 15257 0测试中文分词法 - 使用 xmlpipe2 测试 - 测试事项 = 普通分词 = mmseg 的同义词 = sphinx 的同义词 = --rotate时，同时重新加载词库 * 需要增加新接口，在mmseg上 = 英文与符号的混合 = 中文英文与符号的混合 = 切分过程的调试输出 [ISSUE] - 当 charset_debug = 1 并且 wordforms 有规则时，控制台无输出 - 暂时不支持 --rotate 时，更新分词词库 [TIPS] - 使用wordforms 可以将多个 token 混合在一起 coreseek-4.1-beta/csft-4.1/cs_test/t_pysource/ 40777 0 0 0 11647303454 14214 5coreseek-4.1-beta/csft-4.1/cs_test/t_pysource/csft.conf100777 0 0 1415 11643565731 16127 0# # Minimal Sphinx configuration sample (clean, simple, functional) # python { path = ./src path = . } source src1 { type = python name = dummy.MainSource py_key1 = abc } index test_pysource { source = src1 path = ./idx/test1 docinfo = extern #charset_debug = 1 #charset_dictpath = .\dict min_prefix_len = 2 enable_star = 1 prefix_fields = context charset_type = utf-8 html_strip=1 index_sp = 1 } indexer { mem_limit = 32M } searchd { listen = 3312 #log = /var/log/searchd.log #query_log = /var/log/query.log read_timeout = 5 max_children = 30 pid_file = /searchd.pid max_matches = 1000 seamless_rotate = 1 preopen_indexes = 0 unlink_old = 1 } coreseek-4.1-beta/csft-4.1/cs_test/t_pysource/src/ 40777 0 0 0 11647303454 15003 5coreseek-4.1-beta/csft-4.1/cs_test/t_pysource/src/dummy/ 40777 0 0 0 11647303454 16136 5coreseek-4.1-beta/csft-4.1/cs_test/t_pysource/src/dummy/__init__.py100777 0 0 14553 11643565731 20403 0# -*- coding: utf-8 -*- g_cnt = 0 class MainSource(object): def __init__(self, conf): self.conf = conf self.data = [ {'id':1, 'Filename':'cm-05 test1', 'context':u'world c++ bbbb aaaaa zzzz hello world . zzzz Test phrase ', 'attr':1, 'tags':[2,4,5]}, {'id':2, 'Filename':'test2', 'context':'c# asp.net hello .net', 'attr':1, 'tags':[1,2,3]}, #{'id':3, 'Filename':'test2111', 'context':'world c# zzzz hello golf zzzz wwww', 'attr':3, 'tags':[5,6,7]}, {'id':4, 'Filename':'test21112', 'context':'中文 分 词算 法 222 我是最好的.', 'attr':3, 'tags':[9,8]}, #{'id':4, 'Filename':'test21112', 'context':'中文分词算法 222我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错. 今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错.我是最好的.今天天气不错. 测试结尾', 'attr':3, 'tags':[9,8]}, ] self.idx = 0 self.join_idx = 0 self.max_iter = 1 self.docfield_gen = None self.docmva = None def GetScheme(self): return [ ('id' , {'docid':True, } ), ('filename', { 'type':'string'} ), #wordpart can be whole, infix, prefix ('context', { 'type':'text'} ), ('attr', {'type':'integer'} ), ('tags', {'type':'list-query'} ), ] def GetKillList(self): return [3,1] def GetFieldOrder(self): ''' - can return a tuple - if return two tuple, the first used as traditional field fetch -> attribute; the second used as sql join like, can fetch context via GetDocField ''' #return [('Filename','context'),] return [('context',) , ()] #return [('Filename',), ('Filename', 'context'),] #return [('Filename',), ('context',),] def _DocFieldGen(self, fieldname): # 1 2 4 #print self.join_idx , self.max_iter while self.join_idx < 1: yield {'Filename':(self.join_idx*10 + 1, 'hello world', 20), 'context':(self.join_idx*10 + 1, 'hello cccc')} yield {'Filename':(self.join_idx*10 + 2, 'baal6tio12 gave rise to al o hole centres whereas no paramagnetic, centres corresponding to boron could be detected on b2o3 addition. Hello1 world.', 10), 'context':(self.join_idx*10 + 2, 'hello cccc world nz')} yield {'Filename':(self.join_idx*10 + 4, 'test', 10), 'context':(self.join_idx*10 + 4, 'hello cccc world nz')} self.join_idx += 1 #yield (2, 'test', 10) #yield (4, '123', 10) def GetDocField(self, fieldname, hitc): ''' return (docid, context_of_field, [ipos] ) return {'fieldname':(docid, context_of_field, [ipos] )} #used to return multi-fields. eg. a single joined table with multi field. ''' #print hitc.getFieldName(),'--------------' if self.docfield_gen == None: self.docfield_gen = self._DocFieldGen(fieldname) try: rs = self.docfield_gen.next() #print '====', rs return rs except StopIteration, e: print e return None pass def GetMVAValue(self, fieldname, hitc): ''' return (docid, value), return multi time for an attribute of a single document. return {'fieldname':(docid, value)} #used to return multi-value. ''' if self.docmva == None: self.docmva = 1 return (1, 3) if self.docmva == 1: self.docmva = 2 return (1, 4) def Connected(self): pass def NextDocument(self, hitc): hitc.pushWord('__2_1999', fieldindex = 0) if self.idx < len(self.data): item = self.data[self.idx] self.id = item['id']+self.max_iter*4 self.Filename = item['Filename'] self.filename = item['Filename'] self.context = item['context'] self.attr = item['attr'] self.tags = item['tags'] self.idx += 1 return True else: if self.max_iter: self.max_iter -= 1 self.idx = 0 return self.NextDocument(hitc); return False def BuildHits(self, hitc): ''' If you do NOT wanna to build hit by hand, must return false. ''' global g_cnt hitc.pushWord("coreseek", fieldindex = 4) #hitc.pushWord(None, 100, 10) #return True #print hitc.getFieldName() return False if "context" == hitc.getFieldName(): ctx = self.context toks = ctx.split() hitc.pushWord(None, 100, 10) for tok in toks: g_cnt += 1 print self.id, g_cnt, ctx hitc.pushWord(tok) if tok == "222": hitc.pushWord("coreseek", fieldindex = 4) pass #print tok return True return False #return False #pass coreseek-4.1-beta/csft-4.1/doc/ 40777 0 0 0 11647303455 11122 5coreseek-4.1-beta/csft-4.1/doc/html2txt.pl100777 0 0 6512 11643565731 13354 0# # $Id$ # use Text::Wrap; use Data::Dumper; $Text::Wrap::columns = 76; $Text::Wrap::unexpand = 0; $MAGIC_NBSP = "\xff"; sub unentity { my $html = shift; die ( "INTERNAL ERROR: magic nbsp code found in html" ) if ( $html =~ /$MAGIC_NBSP/ ); $html =~ s/ /$MAGIC_NBSP/g; $html =~ s/<//g; $html =~ s/“/<>/g; $html =~ s/©/(c)/g; $html =~ s/&/&/g; return $html; }; sub linify { my $text = shift; $text =~ s/\n/ /g; $text =~ s/\t/ /g; $text =~ s/\s{2,}/ /g; $text =~ s/^\s+//ms; $text =~ s/\s+$//ms; $text =~ s/\s+(\w)\s+/ \1$MAGIC_NBSP/g; # glue 1-letter words with nbsp's return $text; }; sub in { my ($a,$v) = @_; foreach my $e ( @$a ) { return 1 if $e eq $v; } return 0; }; ############### ## entry point ############### undef $/; $html = <>; $html =~ s/.*?//ms; $html =~ s/<\/body.*/\n--eof--\n/ms; $res = ""; $acc = ""; $hdr = ""; $left = 0; $red = ""; @lists = ""; $li = 0; $pre = 0; while ( $html =~ s/^(.*?)<([\/]*\w+)(\s+.*?)*>//ms ) { $text = $1; $tag = lc $2; $attrs = lc $3; $acc .= $text; next if ( in ( [ "a","/a","i","/i","p","code","/code","b","/b","span","/span", "strong","/strong","br","em","/em" ], $tag ) ); if ( in ( [ "div","/div","/h1","/h2","/h3","/h4","/h5","/p","hr","h5", "dl","ol","ul","dt","dd","/dl","/ol","/ul","/dt","/dd", "li","/li","pre","/pre" ], $tag ) ) { # fixme! handle userinput instead of literallayout if ( !$pre ) { $acc = linify(unentity($acc)); $acc = wrap ( (" " x $left).$red, " "x($left+length($red)), $acc ); die if ( $acc =~ /\t/ ); } else { my @lines = split ( /\n/, unentity($acc) ); $acc = ""; foreach $line ( @lines ) { next if ( !$acc && !$line ); $acc .= ( " " x $left ) . "| $line\n"; } $acc = "\n$acc\n"; } $red = " "x length($red); if ( $acc ) { if ( length($hdr) ) { $res .= "$acc\n" . $hdr x length($acc) . "\n\n"; $hdr = ""; } else { $res .= "$acc\n"; } } $acc = ""; $res .= "\n" if ( in ( [ "div","/div","/h1","/h2","/h3","/p","hr" ], $tag ) ); $res .= "\n" if ( $#lists<=2 && in ( ["/dl","/ol","/ul" ], $tag ) ); if ( $tag eq "hr" ) { $res .= "-" x $Text::Wrap::columns . "\n\n"; } if ( in ( [ "dd","ol","ul" ], $tag ) ) { $left += 3; $li = 1 if ( $tag eq "ol" ); # fixme! allow nested ol push ( @lists, $tag ); next; } if ( in ( [ "/dd","/ol","/ul" ], $tag ) ) { $left -= 3; pop @lists; $red = ""; # just in case $res .= "\n"; next; } if ( $tag eq "li" ) { my $list = $lists[$#lists]; if ( $list eq "ol" ) { $red = "$li. "; $li++; } elsif ( $list eq "ul" ) { $red = "* "; } else { print Dumper(@lists); die ( "INTERNAL ERROR: 'li' in unknown list '$list'" ); } next; } if ( $tag eq "pre" || ( $tag eq "div" && $attrs =~ /literallayout/ ) ) { $pre = 1; $left += 3; next; } if ( $pre && ( $tag eq "/pre" || $tag eq "/div" ) ) { $pre = 0; $left -= 3; next; } next; } if ( $tag eq "h1" ) { $hdr = "="; next; } if ( $tag eq "h2" ) { $hdr = "="; next; } if ( $tag eq "h3" ) { $hdr = "-"; next; } if ( $tag eq "h4" ) { $hdr = ""; next; } die ( "unknown tag='$tag' attrs='$attrs'\n" ); } $res .= "\n\n--eof--\n"; $res =~ s/^\n+//; $res =~ s/\n{3,}/\n\n/gms; $res =~ s/$MAGIC_NBSP/ /g; print $res; # # $Id$ # coreseek-4.1-beta/csft-4.1/doc/indexer.1100777 0 0 31460 11643565731 12771 0'\" t .\" Title: indexer .\" Author: [see the "Author" section] .\" Generator: DocBook XSL Stylesheets v1.75.2 .\" Date: 06/11/2011 .\" Manual: Sphinxsearch .\" Source: 2.0.2 .\" Language: English .\" .TH "INDEXER" "1" "06/11/2011" "2\&.0\&.2" "Sphinxsearch" .\" ----------------------------------------------------------------- .\" * Define some portability stuff .\" ----------------------------------------------------------------- .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .\" http://bugs.debian.org/507673 .\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" ----------------------------------------------------------------- .\" * set default formatting .\" ----------------------------------------------------------------- .\" disable hyphenation .nh .\" disable justification (adjust text to left margin only) .ad l .\" ----------------------------------------------------------------- .\" * MAIN CONTENT STARTS HERE * .\" ----------------------------------------------------------------- .SH "NAME" indexer \- Sphinxsearch fulltext index generator .SH "SYNOPSIS" .HP \w'\fBindexer\fR\ 'u \fBindexer\fR [\-\-config\ \fICONFIGFILE\fR] [\-\-rotate] [\-\-noprogress | \-\-quiet] [\-\-all | \fIINDEX\fR | \fI\&.\&.\&.\fR] .HP \w'\fBindexer\fR\ 'u \fBindexer\fR \-\-buildstops\ \fIOUTPUTFILE\fR \fICOUNT\fR [\-\-config\ \fICONFIGFILE\fR] [\-\-noprogress | \-\-quiet] [\-\-all | \fIINDEX\fR | \fI\&.\&.\&.\fR] .HP \w'\fBindexer\fR\ 'u \fBindexer\fR \-\-merge\ \fIMAIN_INDEX\fR \fIDELTA_INDEX\fR [\-\-config\ \fICONFIGFILE\fR] [\-\-rotate] [\-\-noprogress | \-\-quiet] .SH "DESCRIPTION" .PP Sphinx is a collection of programs that aim to provide high quality fulltext search\&. .PP \fBindexer\fR is the first of the two principle tools as part of Sphinx\&. Invoked from either the command line directly, or as part of a larger script, \fBindexer\fR is solely responsible for gathering the data that will be searchable\&. .PP The calling syntax for indexer is as follows: .sp .if n \{\ .RS 4 .\} .nf $ indexer [OPTIONS] [indexname1 [indexname2 [\&.\&.\&.]]] .fi .if n \{\ .RE .\} .PP Essentially you would list the different possible indexes (that you would later make available to search) in sphinx\&.conf, so when calling \fBindexer\fR, as a minimum you need to be telling it what index (or indexes) you want to index\&. .PP If sphinx\&.conf contained details on 2 indexes, \fImybigindex\fR and \fImysmallindex\fR, you could do the following: .sp .if n \{\ .RS 4 .\} .nf $ indexer mybigindex $ indexer mysmallindex mybigindex .fi .if n \{\ .RE .\} .PP As part of the configuration file, sphinx\&.conf, you specify one or more indexes for your data\&. You might call \fBindexer\fR to reindex one of them, ad\-hoc, or you can tell it to process all indexes \- you are not limited to calling just one, or all at once, you can always pick some combination of the available indexes\&. .SH "OPTIONS" .PP The majority of the options for \fBindexer\fR are given in the configuration file, however there are some options you might need to specify on the command line as well, as they can affect how the indexing operation is performed\&. These options are: .PP \fB\-\-all\fR .RS 4 Tells \fBindexer\fR to update every index listed in sphinx\&.conf, instead of listing individual indexes\&. This would be useful in small configurations, or cron\-type or maintenance jobs where the entire index set will get rebuilt each day, or week, or whatever period is best\&. .sp Example usage: .sp .if n \{\ .RS 4 .\} .nf $ indexer \-\-config /home/myuser/sphinx\&.conf \-\-all .fi .if n \{\ .RE .\} .RE .PP \fB\-\-buildstops\fR \fIoutfile\&.txt\fR \fINUM\fR .RS 4 Reviews the index source, as if it were indexing the data, and produces a list of the terms that are being indexed\&. In other words, it produces a list of all the searchable terms that are becoming part of the index\&. Note; it does not update the index in question, it simply processes the data \*(Aqas if\*(Aq it were indexing, including running queries defined with \fIsql_query_pre\fR or \fIsql_query_post\fR\&. outputfile\&.txt will contain the list of words, one per line, sorted by frequency with most frequent first, and \fINUM\fR specifies the maximum number of words that will be listed; if sufficiently large to encompass every word in the index, only that many words will be returned\&. Such a dictionary list could be used for client application features around "Did you mean\&.\&.\&." functionality, usually in conjunction with \fB\-\-buildfreqs\fR, below\&. .sp Example: .sp .if n \{\ .RS 4 .\} .nf $ indexer myindex \-\-buildstops word_freq\&.txt 1000 .fi .if n \{\ .RE .\} .sp This would produce a document in the current directory, word_freq\&.txt with the 1,000 most common words in \*(Aqmyindex\*(Aq, ordered by most common first\&. Note that the file will pertain to the last index indexed when specified with multiple indexes or \fB\-\-all\fR (i\&.e\&. the last one listed in the configuration file) .RE .PP \fB\-\-buildfreqs\fR .RS 4 Used in pair with \fB\-\-buildstops\fR (and is ignored if \fB\-\-buildstops\fR is not specified)\&. As \fB\-\-buildstops\fR provides the list of words used within the index, \fB\-\-buildfreqs\fR adds the quantity present in the index, which would be useful in establishing whether certain words should be considered stopwords if they are too prevalent\&. It will also help with developing "Did you mean\&.\&.\&." features where you can how much more common a given word compared to another, similar one\&. .sp Example: .sp .if n \{\ .RS 4 .\} .nf $ indexer myindex \-\-buildstops word_freq\&.txt 1000 \-\-buildfreqs .fi .if n \{\ .RE .\} .sp This would produce the word_freq\&.txt as above, however after each word would be the number of times it occurred in the index in question\&. .RE .PP \fB\-\-config\fR\ \&\fICONFIGRILE\fR, \fB\-c\fR\ \&\fICONFIGFILE\fR .RS 4 Use the given file as configuration\&. Normally, it will look for sphinx\&.conf in the installation directory (e\&.g\&./usr/local/sphinx/etc/sphinx\&.conf if installed into /usr/local/sphinx), followed by the current directory you are in when calling indexer from the shell\&. This is most of use in shared environments where the binary files are installed somewhere like /usr/local/sphinx/ but you want to provide users with the ability to make their own custom Sphinx set\-ups, or if you want to run multiple instances on a single server\&. In cases like those you could allow them to create their own sphinx\&.conf files and pass them to \fBindexer\fR with this option\&. .sp For example: .sp .if n \{\ .RS 4 .\} .nf $ indexer \-\-config /home/myuser/sphinx\&.conf myindex .fi .if n \{\ .RE .\} .RE .PP \fB\-\-dump\-rows\fR \fIFILE\fR .RS 4 Dumps rows fetched by SQL source(s) into the specified file, in a MySQL compatible syntax\&. Resulting dumps are the exact representation of data as received by indexer and help to repeat indexing\-time issues\&. .RE .PP \fB\-\-merge\fR \fIDST\-INDEX\fR \fISRC\-INDEX\fR .RS 4 Physically merge together two indexes\&. For example if you have a main+delta scheme, where the main index rarely changes, but the delta index is rebuilt frequently, and \fB\-\-merge\fR would be used to combine the two\&. The operation moves from right to left \- the contents of \fISRC\-INDEX\fR get examined and physically combined with the contents of \fIDST\-INDEX\fR and the result is left in \fIDST\-INDEX\fR\&. In pseudo\-code, it might be expressed as: \fIDST\-INDEX\fR += \fISRC\-INDEX\fR .sp An example: .sp .if n \{\ .RS 4 .\} .nf $ indexer \-\-merge main delta \-\-rotate .fi .if n \{\ .RE .\} .sp In the above example, where the main is the master, rarely modified index, and delta is the less frequently modified one, you might use the above to call \fBindexer\fR to combine the contents of the delta into the main index and rotate the indexes\&. .RE .PP \fB\-\-merge\-dst\-range\fR \fIATTR\fR \fIMIN\fR \fIMAX\fR .RS 4 Run the filter range given upon merging\&. Specifically, as the merge is applied to the destination index (as part of \fB\-\-merge\fR, and is ignored if \fB\-\-merge\fR is not specified), \fBindexer\fR will also filter the documents ending up in the destination index, and only documents will pass through the filter given will end up in the final index\&. This could be used for example, in an index where there is a \*(Aqdeleted\*(Aq attribute, where 0 means \*(Aqnot deleted\*(Aq\&. Such an index could be merged with: .sp .if n \{\ .RS 4 .\} .nf $ indexer \-\-merge main delta \-\-merge\-dst\-range deleted 0 0 .fi .if n \{\ .RE .\} .sp Any documents marked as deleted (value 1) would be removed from the newly\-merged destination index\&. It can be added several times to the command line, to add successive filters to the merge, all of which must be met in order for a document to become part of the final index\&. .RE .PP \fB\-\-merge\-killlists\fR, \fB\-\-merge\-klists\fR .RS 4 Used in pair with \fB\-\-merge\fR\&. Usually when merging \fBindexer\fR uses kill\-list of source index (i\&.e\&., the one which is merged into) as the filter to wipe out the matching docs from the destination index\&. At the same time the kill\-list of the destination itself isn\*(Aqt touched at all\&. When using \fB\-\-merge\-killlists\fR, (or it shorter form \fB\-\-merge\-klists\fR) the \fBindexer\fR will not filter the dst\-index docs with src\-index killlist, but it will merge their kill\-lists together, so the final result index will have the kill\-list containing the merged source kill\-lists\&. .RE .PP \fB\-\-noprogress\fR .RS 4 Don\*(Aqt display progress details as they occur; instead, the final status details (such as documents indexed, speed of indexing and so on are only reported at completion of indexing\&. In instances where the script is not being run on a console (or \*(Aqtty\*(Aq), this will be on by default\&. .sp Example usage: .sp .if n \{\ .RS 4 .\} .nf $ indexer \-\-rotate \-\-all \-\-noprogress .fi .if n \{\ .RE .\} .RE .PP \fB\-\-print\-queries\fR .RS 4 Prints out SQL queries that indexer sends to the database, along with SQL connection and disconnection events\&. That is useful to diagnose and fix problems with SQL sources\&. .RE .PP \fB\-\-quiet\fR .RS 4 Tells \fBindexer\fR not to output anything, unless there is an error\&. Again, most used for cron\-type, or other script jobs where the output is irrelevant or unnecessary, except in the event of some kind of error\&. .sp Example usage: .sp .if n \{\ .RS 4 .\} .nf $ indexer \-\-rotate \-\-all \-\-quiet .fi .if n \{\ .RE .\} .RE .PP \fB\-\-rotate\fR .RS 4 Used for rotating indexes\&. Unless you have the situation where you can take the search function offline without troubling users, you will almost certainly need to keep search running whilst indexing new documents\&. \fB\-\-rotate\fR creates a second index, parallel to the first (in the same place, simply including \&.new in the filenames)\&. Once complete, \fBindexer\fR notifies \fBsearchd\fR via sending the \fISIGHUP\fR signal, and \fBsearchd\fR will attempt to rename the indexes (renaming the existing ones to include \&.old and renaming the \&.new to replace them), and then start serving from the newer files\&. Depending on the setting of \fBseamless_rotate\fR, there may be a slight delay in being able to search the newer indexes\&. .sp Example usage: .sp .if n \{\ .RS 4 .\} .nf $ indexer \-\-rotate \-\-all .fi .if n \{\ .RE .\} .RE .PP \fB\-\-sighup\-each\fR .RS 4 is useful when you are rebuilding many big indexes, and want each one rotated into \fBsearchd\fR as soon as possible\&. With \fB\-\-sighup\-each\fR, \fBindexer\fR will send a \fISIGHUP\fR signal to \fBsearchd\fR after succesfully completing the work on each index\&. (The default behavior is to send a single \fISIGHUP\fR after all the indexes were built\&.) .RE .PP \fB\-\-verbose\fR .RS 4 Guarantees that every row that caused problems indexing (duplicate, zero, or missing document ID; or file field IO issues; etc) will be reported\&. By default, this option is off, and problem summaries may be reported instead\&. .RE .SH "AUTHOR" .PP Andrey Aksenoff (shodan@sphinxsearch\&.com)\&. This manual page is written by Alexey Vinogradov (klirichek@sphinxsearch\&.com), using the one written by Christian Hofstaedtler ch+debian\-packages@zeha\&.at for the \fBDebian\fR system (but may be used by others)\&. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU General Public License, Version 2 any later version published by the Free Software Foundation\&. .PP On Debian systems, the complete text of the GNU General Public License can be found in /usr/share/common\-licenses/GPL\&. .SH "SEE ALSO" .PP \fBsearchd\fR(1), \fBsearch\fR(1), \fBindextool\fR(1), \fBspelldump\fR(1) .PP Sphinx and it\*(Aqs programs are documented fully by the \fISphinx reference manual\fR available in /usr/share/doc/sphinxsearch\&. coreseek-4.1-beta/csft-4.1/doc/indextool.1100777 0 0 11035 11643565731 13334 0'\" t .\" Title: indextool .\" Author: [see the "Author" section] .\" Generator: DocBook XSL Stylesheets v1.75.2 .\" Date: 06/11/2011 .\" Manual: Sphinxsearch .\" Source: 2.0.2 .\" Language: English .\" .TH "INDEXTOOL" "1" "06/11/2011" "2\&.0\&.2" "Sphinxsearch" .\" ----------------------------------------------------------------- .\" * Define some portability stuff .\" ----------------------------------------------------------------- .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .\" http://bugs.debian.org/507673 .\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html .\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" ----------------------------------------------------------------- .\" * set default formatting .\" ----------------------------------------------------------------- .\" disable hyphenation .nh .\" disable justification (adjust text to left margin only) .ad l .\" ----------------------------------------------------------------- .\" * MAIN CONTENT STARTS HERE * .\" ----------------------------------------------------------------- .SH "NAME" indextool \- Sphinxsearch tool dump miscellaneous debug information about the physical index\&. .SH "SYNOPSIS" .HP \w'\fBindextool\fR\ 'u \fBindextool\fR {command} [options] .SH "DESCRIPTION" .PP Sphinx is a collection of programs that aim to provide high quality fulltext search\&. .PP \fBindextool\fR is one of the helper tools within the Sphinx package\&. It is used to dump miscellaneous debug information about the physical index\&. Apart ghe dumping \fBindextool\fR can perform index verification, hence the indextool name rather than just indexdump\&. .SH "COMMANDS" .PP The commands are as follows: .PP \fB\-\-dumpheader\fR \fIFILENAME\&.sph\fR .RS 4 quickly dumps the provided index header file without touching any other index files or even the configuration file\&. The report provides a breakdown of all the index settings, in particular the entire attribute and field list\&. Prior to 0\&.9\&.9\-rc2, this command was present in CLI search utility\&. .RE .PP \fB\-\-dumpconfig\fR \fIFILENAME\&.sph\fR .RS 4 dumps the index definition from the given index header file in (almost) compliant sphinx\&.conf file format\&. .RE .PP \fB\-\-dumpheader\fR \fIINDEXNAME\fR .RS 4 dumps index header by index name with looking up the header path in the configuration file\&. .RE .PP \fB\-\-dumpdocids\fR \fIINDEXNAME\fR .RS 4 dumps document IDs by index name\&. It takes the data from attribute (\&.spa) file and therefore requires \fBdocinfo=extern\fR to work\&. .RE .PP \fB\-\-dumphitlist\fR \fIINDEXNAME\fR \fIKEYWORD\fR .RS 4 dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as text\&. .RE .PP \fB\-\-dumphitlist\fR \fIINDEXNAME\fR \fB\-\-wordid\fR \fIID\fR .RS 4 dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as internal numeric ID\&. .RE .PP \fB\-\-htmlstrip\fR INDEXNAME .RS 4 filters stdin using HTML stripper settings for a given index, and prints the filtering results to stdout\&. Note that the settings will be taken from sphinx\&.conf, and not the index header\&. .RE .PP \fB\-\-check\fR \fIINDEXNAME\fR .RS 4 checks the index data files for consistency errors that might be introduced either by bugs in \fBindexer\fR and/or hardware faults\&. .RE .PP \fB\-\-strip\-path\fR .RS 4 strips the path names from all the file names referenced from the index (stopwords, wordforms, exceptions, etc)\&. This is useful for checking indexes built on another machine with possibly different path layouts\&. .RE .SH "OPTIONS" .PP The only currently available option applies to all commands and lets you specify the configuration file: .PP \fB\-\-config\fR\ \&\fICONFIGFILE\fR, \fB\-c\fR\ \&\fICONFIGFILE\fR .RS 4 overrides the built\-in config file names\&. .RE .SH "AUTHOR" .PP Andrey Aksenoff (shodan@sphinxsearch\&.com)\&. This manual page is written by Alexey Vinogradov (klirichek@sphinxsearch\&.com)\&. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU General Public License, Version 2 any later version published by the Free Software Foundation\&. .PP On Debian systems, the complete text of the GNU General Public License can be found in /usr/share/common\-licenses/GPL\&. .SH "SEE ALSO" .PP \fBindexer\fR(1), \fBsearchd\fR(1), \fBsearch\fR(1) .PP Sphinx and it\*(Aqs programs are documented fully by the \fISphinx reference manual\fR available in /usr/share/doc/sphinxsearch\&. coreseek-4.1-beta/csft-4.1/doc/internals-coding-standard.txt100777 0 0 7601 11643565731 17030 0Sphinx coding standard ======================= WARNING. This document is just an internal note. It might or might not be in sync with the actual code. Use it as an overview; refer to the source for precise details. General -------- This document describes C++ coding standard that MUST be used for Sphinx source code. It is not yet complete. Currently, we're not aiming for an exhaustive set of rules (that noone will read anyway). Rather, we're covering only those gray areas that are not immediately obvious from the source. However, you should also *first* refer to the source for general look and feel. Certain rules might change over time. However, the following rules are not going to be changed: - All source parts must look alike. - When in doubt, ask. If not answered, mimic. (And ask again.) 1. General formatting rules ---------------------------- - No duplicate spaces, use tabs. - Indent is 1 tab. - Tab size is 4. 2. Formatting C++ clauses -------------------------- 2.1. Enumeration ----------------- enum ESphExample { FIRST = mandatory_value, SECOND, THIRD, FOURTH }; 2.2. Switch statement ---------------------- switch ( tMyCondition ) { case FIRST: iShortStatement = 1; break; case SECOND: iAnotherShortStatement = 2; break; case THIRD: iLongerStatement = 3; DoSomething(); break; case FOURTH: { int iEvenLongerStatementWithLocals = 4; DoSomethingElse(); break; } } 2.3. Parentheses ----------------- - 1 space around opening '('. - 1 space before closing ')'. - Empty argument lists in function calls can omit spaces. - Short 1-argument lists can omit spaces too. TypicalCall ( iFirst, sSecond ); NullArglist(); ShortArglist(i); StillShortArglist(iIdx); LongEnoughArglist ( iFirst ); iVar = !( iCode & BOOLEAN_EXPRESSION ); if ( i==1 || ( j==2 && k==3 ) ) { ... } if ( i ) {... } 2.4. Class declaration layout ------------------------------ - Usually, variables go first, then functions. - Usually, public members go first, then protected, then private. - Repeat access specifier to highlight big blocks of members. - All the rules above are not mandatory, but generally suggested. class SampleClass { public: SampleClass (); ~SampleClass (); void DoThings (); protected: int m_iLocalState; bool m_bSomeFlag; protected: int m_iAnotherLogicalBlock; int m_iOfMemberVariables; protected: void Helper1(); void Helper2(); }; 3. Naming conventions ---------------------- - Camel case, and reasonable subset of Hungarian notation. - Identifiers are "MultiWordName", not "multi_word_name" (this is CamelCase). - "m_" prefix on data members is mandatory (this is Hungarian). - Single-char typeid prefix on variables is mandatory (this is Hungarian). - "i" means int - "u" means unsigned - "b" means boolean - "c" means char - "f" means float - "h" means hash, i.e. associative array (like std::map) - "p" means pointer - "pp" means pointer to pointer - "s" means string (both CSphString and char *) - "e" means enum - "d" means array (no idea why "d", maybe "data"?) - "t" means any other (complex) type - No special rules for public/protected/private member names. - Special rules for entities exposed in sphinx.h to libsphinx callers: - Enum names MUST start with "ESph" - Interface names MUST start with "ISph" - Class/struct names MUST start with "CSph" - Function names MUST start with "sph" - Internal entities can either use or omit these prefixes. class SampleInternalClass { int m_iSomething; // right, got both "m_" prefix and "i" typeid char iAnotherthing; // WRONG, bad typeid char, bad capitalization long m_AnotherField; // WRONG, missing typeid char char * m_lpszWtf; // WRONG, typeid must be single char (or "pp") ... /// right void SampleCall ( RuleType_e eRule, char cKey, bool bFlag, char * sArg ); }; - constants, either typed or defined, must be all caps: const bool FAIL_ON_NULL_SOURCE = false; #define READ_NO_SIZE_HINT 0 --eof-- coreseek-4.1-beta/csft-4.1/doc/internals-index-format.txt100777 0 0 21652 11643565731 16406 0Sphinx index format ==================== WARNING. This document is just an internal note. It might or might not be in sync with the actual code. Use it as an overview; refer to the source for precise details. General -------- Sphinx index consists of the following files: .sph, header file .spi, dictionary (aka wordlist) .spd, document lists (aka doclists) .spp, keyword positions lists (aka hitlists) .spa, attribute values .spm, MVA values .spk, kill list (aka klist) Also, indexer and searchd utilize a dummy .spl file to establish locks on the whole index. Compression ------------ Values that Sphinx internally stores can frequently be compressed well. For instance, an ascending sequence of document IDs can clearly be stored much more efficiently than at 4 or 8 bytes per ID. Two techniques we currently use are delta encoding, and variable length byte string (or VLB) compression. Delta encoding is used when the sequence of the values to store is monotonically non-decreasing. Each value is replaced with its difference (delta) from the previous value. Example: source-sequence = 3, 5, 7, 11, 13, 17, ... delta-encoded = 3, 2, 2, 4, 2, 4, ... The resulting deltas are smaller, and compress more efficiently. Lists of deltas are 0-terminated. So zero is a magic value, that marks the end of the encoded sequence. VLB compression encodes a fixed-length (32-bit or 64-bit) integer value to a variable-length byte string, depending on the value. 7 lower bits of every byte contain next 7 low bits of the compressed value; and 8-th bit signals whether the are more bytes following. Note that high bits come first! Hence, values that take 7 bits (0 to 127, inclusive) are stored using 1 byte, values that fit in 14 bits (128 to 16383) are stored using 2 bytes, etc. Examples: source-value = 0x37 encoded-value = 0x37 source-value = 0x12345 encoded-value = 0x84 0xC6 0x45 // 0x84 == ( ( 0x12345>>14 ) & 0x7F ) | 0x80 // 0xC6 == ( ( 0x12345>>7 ) & 0x7F ) | 0x80 // 0x45 == ( ( 0x12345>>0 ) & 0x7F ) For VLB implementation, refer to ZipInt() and UnzipInt() functions. Header ------- Header file (.sph) always contains index format version, index schema, index statistics, and misc other settings. Starting from 0.9.9, header now also contains the *complete* dictionary and tokenizer settings, except the external files contents. This was not the case in 0.9.8 and below, where these settings were always taken from config file, and thus could easily go out of sync. There are certain settings (stopwords, wordforms) that refer to external files that are possibly (even likely) shared between different indexes. For these, header in 0.9.9 stores the file name, modification time, and CRC32, but not the file contents. For specific data layout, refer to LoadHeader(), WriteHeader(), and DumpHeader() methods. Dictionary ----------- Dictionary file (.spi) lets us quickly map keywords to document lists. All keywords are internally replaced with their IDs, either CRC32 or FNV64 (depending on --enable-id64 configure time setting). Dictionary essentially is a huge list of per-keyword entries, sorted by keyword ID: dictionary-entry = keyword-id : wordid-type, delta-encoded doclist-offset : offset-type, delta-encoded keyword-docs : int32 keyword-hits : int32 wordid-type and offset-type might vary (ie. be either 32-bit or 64-bit) depending on compile-time settings. To avoid zero offsets into dictionary (zero is a magic value), a dummy byte is written at the very start of the file. To save space, these entries are stored in a compressed form. All fields are VLB compressed. Additionally, keyword-id and doclist-offset fields (that are guaranteed to grow) are delta-encoded before compression. To speedup lookups by an arbitrary keyword ID, delta encoding is restarted after every WORDLIST_CHECKPOINT entries. Zero delta marker, ie. a single value of 0 for delta (without any additional data) is injected into the stream at the point of every such checkpoint. Locations (offsets) and starting keyword IDs of these checkpoints are accumulated in RAM during indexing, and then written to disk at the end of the dictionary file. Almost all of dictionary writing happens in cidxHit() method. Document lists --------------- For every indexed keyword, a list of all matching document IDs is stored in document lists file (.spd). By construction, document lists are laid out in ascending keyword ID order. However, this is just a side effect, and not really a requirement. The entry format is as follows: doclist-entry = document-id : docid-type, delta-encoded [ inline-attrs ] hitlist-offset : offset-type, delta-encoded fields-mask : int32 hits-count : int32 Note that delta encoding of document IDs starts not from 0 but from infinum (decremented minimum) document ID stored in the header file. For instance, if indexed documents IDs were 3, 5, 11 then minimum ID will be 3, infinum ID stored in the header will be 2, and doclist decoder will be initialized with that value. Thus, for instance, if the very first delta value is 3, decoded doclist will start with document ID of 2+3=5, not 0+3=3. inline-attrs component is optional, its presence depends on docinfo setting. For indexes built with docinfo=extern (the default value), there's no such component. When docinfo=inline, it carries all the attribute values: inline-attrs = attr-rowitems : rowitem-type[], delta-encoded hitlist-offset points to a location in hit list file (see below) where the list of current keyword's occurences in current document is stored. fields-mask is a bit mask. Bit number N is set when there were keyword occurences in field number N; cleared otherwise. We precompute this mask based on hitlist data and store it in doclist to accelerate certain early rejection tests when searching. hits-count is just a total number of keyword occurrences within the current document, or term frequency (TF). It's precomputed from hitlist data too, also for performance reasons. To avoid zero offsets into document lists (zero is a magic value), a dummy byte is written at the very start of the file. Document lists are terminated by zero delta marker. Ie. when reading next document-id delta returns 0, it means there's no more data in this doclist. To save space, these entries are stored in a compressed form. All fields are VLB compressed. Additionally, document-id and hitlist-offset fields (that are guaranteed to grow) are delta-encoded before compression. All of doclist writing happens in cidxHit() method. Hit lists ---------- In Sphinx terms, hits are specific occurrences of a keyword at a given position within the document. When a keyword "hello" occurs 5 times in the document you index, that will result in 5 hits in that document. Hit lists file (.spp) stores all such in-document keyword positions, for every given document and keyword. These positions are used by certain search operators, such as phrase or proximity operator, to determine whether the document matches. They may also be used by the relevance ranking code to compute phrase proximity, if chosen ranker takes that factor into account. By construction, hit lists are laid out in ascending keyword ID order. However, this is just a side effect, and not really a requirement. The entry format is as follows: hitlist-entry = word-position : int32, delta-encoded word-position integer has the following bit fields: struct word-position { int field_id : 8; // bits 25-21 int is_last : 1; // bit 24 int word_position_in_field : 23; // bits 0-23 }; is_last indicates that this hit was the very last (!) hit in this field. This flag is required for "keyword$" searches (ie. with field end marker). Positions are counted in words, *not* bytes. Positions start from 1. Full-text field IDs start from 0. So, for example, when you index the following 2-field document: title = woodchuck chuck content = just how many wood would a woodchuck chuck, if a woodchuck could chuck wood? Then the resulting hitlist for "chuck" is going to be: raw-word-positions = 2, 16777224, 16777229 Because it occurs 3 times: in field number 0 position number 2, and in field number 1 positions 8 and 13. And (1<<24) is 16777216. For the sake of completeness, after delta encoding and adding a trailing zero (end marker) this hitlist would transform to the following sequence of integers: uncompressed-hitlist = 2, 16777222, 5, 0 And after VLB compression, the final byte stream would be: compressed-hitlist-bytes = 0x02, 0x88, 0x80, 0x80, 0x06, 0x05, 0x00 To avoid zero offsets into hitlists (zero is a magic value), a dummy byte is written at the very start of the file. Hitlists are terminated by zero delta marker. Ie. when reading next word-id delta returns 0, it means there's no more data in this hitlist. Note that we don't keep anything but the positions themselves here. That's because keyword and document IDs are already known by the time we read from hitlist, from the reffering dictionary and doclist entries. All of hitlist writing happens in cidxHit() method. --eof-- coreseek-4.1-beta/csft-4.1/doc/Makefile.am100777 0 0 2152 11643565731 13261 0man1_MANS = searchd.1 search.1 indexer.1 indextool.1 spelldump.1 # apt-get install docbook-xsl # apt-get install xsltproc # DOCBOOKXSL = /usr/share/xml/docbook/stylesheet/docbook-xsl XSLTARGSMAN = $(DOCBOOKXSL)/manpages/docbook.xsl all: @echo "All docs are already pre-built by developer." @echo "If you want to rebuild them, install docbook-xsl" @echo "and xsltproc and then run 'make docs' instead of simple 'make'." docs: sphinx.html sphinx.txt my_manpages my_manpages: manpages.xml xsltproc $(XSLTARGSMAN) manpages.xml sphinx.html: sphinx.xml sed -r 's///g;s/<\/b>/<\/emphasis>/g;s/(fixed|bug) #([0-9]+)/\1 \#\2<\/ulink>/g' sphinx.xml \ | xsltproc sphinx.xsl - \ | sed -r 's/\xA0/\ /g;s/\xA9/\©/g;s/((<\/(li|dt|dt|head|div)>)+)/\1\n/g;s/<\/a>//g;s/<\/head>/\n coreseek-4.1-beta/csft-4.1/doc/sphinx.html100777 0 0 2460216 11643565731 13517 0Sphinx 2.0.1-beta reference manual

Table of Contents

1. Introduction
1.1. About
1.2. Sphinx features
1.3. Where to get Sphinx
1.4. License
1.5. Credits
1.6. History
2. Installation
2.1. Supported systems
2.2. Required tools
2.3. Installing Sphinx on Linux
2.4. Installing Sphinx on Windows
2.5. Known installation issues
2.6. Quick Sphinx usage tour
3. Indexing
3.1. Data sources
3.2. Attributes
3.3. MVA (multi-valued attributes)
3.4. Indexes
3.5. Restrictions on the source data
3.6. Charsets, case folding, and translation tables
3.7. SQL data sources (MySQL, PostgreSQL)
3.8. xmlpipe data source
3.9. xmlpipe2 data source
3.10. Live index updates
3.11. Delta index updates
3.12. Index merging
4. Real-time indexes
4.1. RT indexes overview
4.2. Known caveats with RT indexes
4.3. RT index internals
4.4. Binary logging
5. Searching
5.1. Matching modes
5.2. Boolean query syntax
5.3. Extended query syntax
5.4. Weighting
5.5. Expressions, functions, and operators
5.5.1. Operators
5.5.2. Numeric functions
5.5.3. Date and time functions
5.5.4. Type conversion functions
5.5.5. Comparison functions
5.5.6. Miscellaneous functions
5.6. Sorting modes
5.7. Grouping (clustering) search results
5.8. Distributed searching
5.9. searchd query log formats
5.9.1. Plain log format
5.9.2. SphinxQL log format
5.10. MySQL protocol support and SphinxQL
5.11. Multi-queries
5.12. Collations
5.13. User-defined functions (UDF)
6. Command line tools reference
6.1. indexer command reference
6.2. searchd command reference
6.3. search command reference
6.4. spelldump command reference
6.5. indextool command reference
7. SphinxQL reference
7.1. SELECT syntax
7.2. SHOW META syntax
7.3. SHOW WARNINGS syntax
7.4. SHOW STATUS syntax
7.5. INSERT and REPLACE syntax
7.6. DELETE syntax
7.7. SET syntax
7.8. BEGIN, COMMIT, and ROLLBACK syntax
7.9. CALL SNIPPETS syntax
7.10. CALL KEYWORDS syntax
7.11. SHOW TABLES syntax
7.12. DESCRIBE syntax
7.13. CREATE FUNCTION syntax
7.14. DROP FUNCTION syntax
7.15. SHOW VARIABLES syntax
7.16. SHOW COLLATION syntax
7.17. UPDATE syntax
7.18. Multi-statement queries
7.19. Comment syntax
7.20. List of SphinxQL reserved keywords
7.21. SphinxQL upgrade notes, version 2.0.1-beta
8. API reference
8.1. General API functions
8.1.1. GetLastError
8.1.2. GetLastWarning
8.1.3. SetServer
8.1.4. SetRetries
8.1.5. SetConnectTimeout
8.1.6. SetArrayResult
8.1.7. IsConnectError
8.2. General query settings
8.2.1. SetLimits
8.2.2. SetMaxQueryTime
8.2.3. SetOverride
8.2.4. SetSelect
8.3. Full-text search query settings
8.3.1. SetMatchMode
8.3.2. SetRankingMode
8.3.3. SetSortMode
8.3.4. SetWeights
8.3.5. SetFieldWeights
8.3.6. SetIndexWeights
8.4. Result set filtering settings
8.4.1. SetIDRange
8.4.2. SetFilter
8.4.3. SetFilterRange
8.4.4. SetFilterFloatRange
8.4.5. SetGeoAnchor
8.5. GROUP BY settings
8.5.1. SetGroupBy
8.5.2. SetGroupDistinct
8.6. Querying
8.6.1. Query
8.6.2. AddQuery
8.6.3. RunQueries
8.6.4. ResetFilters
8.6.5. ResetGroupBy
8.7. Additional functionality
8.7.1. BuildExcerpts
8.7.2. UpdateAttributes
8.7.3. BuildKeywords
8.7.4. EscapeString
8.7.5. Status
8.7.6. FlushAttributes
8.8. Persistent connections
8.8.1. Open
8.8.2. Close
9. MySQL storage engine (SphinxSE)
9.1. SphinxSE overview
9.2. Installing SphinxSE
9.2.1. Compiling MySQL 5.0.x with SphinxSE
9.2.2. Compiling MySQL 5.1.x with SphinxSE
9.2.3. Checking SphinxSE installation
9.3. Using SphinxSE
9.4. Building snippets (excerpts) via MySQL
10. Reporting bugs
11. sphinx.conf options reference
11.1. Data source configuration options
11.1.1. type
11.1.2. sql_host
11.1.3. sql_port
11.1.4. sql_user
11.1.5. sql_pass
11.1.6. sql_db
11.1.7. sql_sock
11.1.8. mysql_connect_flags
11.1.9. mysql_ssl_cert, mysql_ssl_key, mysql_ssl_ca
11.1.10. odbc_dsn
11.1.11. sql_query_pre
11.1.12. sql_query
11.1.13. sql_joined_field
11.1.14. sql_query_range
11.1.15. sql_range_step
11.1.16. sql_query_killlist
11.1.17. sql_attr_uint
11.1.18. sql_attr_bool
11.1.19. sql_attr_bigint
11.1.20. sql_attr_timestamp
11.1.21. sql_attr_str2ordinal
11.1.22. sql_attr_float
11.1.23. sql_attr_multi
11.1.24. sql_attr_string
11.1.25. sql_attr_str2wordcount
11.1.26. sql_column_buffers
11.1.27. sql_field_string
11.1.28. sql_field_str2wordcount
11.1.29. sql_file_field
11.1.30. sql_query_post
11.1.31. sql_query_post_index
11.1.32. sql_ranged_throttle
11.1.33. sql_query_info
11.1.34. xmlpipe_command
11.1.35. xmlpipe_field
11.1.36. xmlpipe_field_string
11.1.37. xmlpipe_field_wordcount
11.1.38. xmlpipe_attr_uint
11.1.39. xmlpipe_attr_bool
11.1.40. xmlpipe_attr_timestamp
11.1.41. xmlpipe_attr_str2ordinal
11.1.42. xmlpipe_attr_float
11.1.43. xmlpipe_attr_multi
11.1.44. xmlpipe_attr_string
11.1.45. xmlpipe_fixup_utf8
11.1.46. mssql_winauth
11.1.47. mssql_unicode
11.1.48. unpack_zlib
11.1.49. unpack_mysqlcompress
11.1.50. unpack_mysqlcompress_maxsize
11.2. Index configuration options
11.2.1. type
11.2.2. source
11.2.3. path
11.2.4. docinfo
11.2.5. mlock
11.2.6. morphology
11.2.7. dict
11.2.8. index_sp
11.2.9. index_zones
11.2.10. min_stemming_len
11.2.11. stopwords
11.2.12. wordforms
11.2.13. exceptions
11.2.14. min_word_len
11.2.15. charset_type
11.2.16. charset_table
11.2.17. ignore_chars
11.2.18. min_prefix_len
11.2.19. min_infix_len
11.2.20. prefix_fields
11.2.21. infix_fields
11.2.22. enable_star
11.2.23. ngram_len
11.2.24. ngram_chars
11.2.25. phrase_boundary
11.2.26. phrase_boundary_step
11.2.27. html_strip
11.2.28. html_index_attrs
11.2.29. html_remove_elements
11.2.30. local
11.2.31. agent
11.2.32. agent_blackhole
11.2.33. agent_connect_timeout
11.2.34. agent_query_timeout
11.2.35. preopen
11.2.36. ondisk_dict
11.2.37. inplace_enable
11.2.38. inplace_hit_gap
11.2.39. inplace_docinfo_gap
11.2.40. inplace_reloc_factor
11.2.41. inplace_write_factor
11.2.42. index_exact_words
11.2.43. overshort_step
11.2.44. stopword_step
11.2.45. hitless_words
11.2.46. expand_keywords
11.2.47. blend_chars
11.2.48. blend_mode
11.2.49. rt_mem_limit
11.2.50. rt_field
11.2.51. rt_attr_uint
11.2.52. rt_attr_bigint
11.2.53. rt_attr_float
11.2.54. rt_attr_timestamp
11.2.55. rt_attr_string
11.3. indexer program configuration options
11.3.1. mem_limit
11.3.2. max_iops
11.3.3. max_iosize
11.3.4. max_xmlpipe2_field
11.3.5. write_buffer
11.3.6. max_file_field_buffer
11.4. searchd program configuration options
11.4.1. listen
11.4.2. address
11.4.3. port
11.4.4. log
11.4.5. query_log
11.4.6. query_log_format
11.4.7. read_timeout
11.4.8. client_timeout
11.4.9. max_children
11.4.10. pid_file
11.4.11. max_matches
11.4.12. seamless_rotate
11.4.13. preopen_indexes
11.4.14. unlink_old
11.4.15. attr_flush_period
11.4.16. ondisk_dict_default
11.4.17. max_packet_size
11.4.18. mva_updates_pool
11.4.19. crash_log_path
11.4.20. max_filters
11.4.21. max_filter_values
11.4.22. listen_backlog
11.4.23. read_buffer
11.4.24. read_unhinted
11.4.25. max_batch_queries
11.4.26. subtree_docs_cache
11.4.27. subtree_hits_cache
11.4.28. workers
11.4.29. dist_threads
11.4.30. binlog_path
11.4.31. binlog_flush
11.4.32. binlog_max_log_size
11.4.33. collation_server
11.4.34. collation_libc_locale
11.4.35. plugin_dir
11.4.36. mysql_version_string
11.4.37. rt_flush_period
11.4.38. thread_stack
11.4.39. expansion_limit
11.4.40. compat_sphinxql_magics
11.4.41. watchdog
A. Sphinx revision history
A.1. Version 2.0.1-beta, 22 apr 2011
A.2. Version 1.10-beta, 19 jul 2010
A.3. Version 0.9.9-release, 02 dec 2009
A.4. Version 0.9.9-rc2, 08 apr 2009
A.5. Version 0.9.9-rc1, 17 nov 2008
A.6. Version 0.9.8.1, 30 oct 2008
A.7. Version 0.9.8, 14 jul 2008
A.8. Version 0.9.7, 02 apr 2007
A.9. Version 0.9.7-rc2, 15 dec 2006
A.10. Version 0.9.7-rc1, 26 oct 2006
A.11. Version 0.9.6, 24 jul 2006
A.12. Version 0.9.6-rc1, 26 jun 2006

List of Examples

3.1. Ranged query usage example
3.2. XMLpipe document stream
3.3. xmlpipe2 document stream
3.4. Fully automated live updates
4.1. RT index declaration
5.1. Boolean query example
5.2. Extended matching mode: query example

Chapter 1. Introduction

Table of Contents

1.1. About
1.2. Sphinx features
1.3. Where to get Sphinx
1.4. License
1.5. Credits
1.6. History

1.1. About

Sphinx is a full-text search engine, publicly distributed under GPL version 2. Commercial licensing (eg. for embedded use) is available upon request.

Technically, Sphinx is a standalone software package provides fast and relevant full-text search functionality to client applications. It was specially designed to integrate well with SQL databases storing the data, and to be easily accessed scripting languages. However, Sphinx does not depend on nor require any specific database to function.

Applications can access Sphinx search daemon (searchd) using any of the three different access methods: a) via native search API (SphinxAPI), b) via Sphinx own implementation of MySQL network protocol (using a small SQL subset called SphinxQL), or c) via MySQL server with a pluggable storage engine (SphinxSE).

Official native SphinxAPI implementations for PHP, Perl, Ruby, and Java are included within the distribution package. API is very lightweight so porting it to a new language is known to take a few hours or days. Third party API ports and plugins exist for Perl, C#, Haskell, Ruby-on-Rails, and possibly other languages and frameworks.

Starting version 1.10-beta, Sphinx supports two different indexing backends: "disk" index backend, and "realtime" (RT) index backend. Disk indexes support online full-text index rebuilds, but online updates can only be done on non-text (attribute) data. RT indexes additionally allow for online full-text index updates. Previous versions only supported disk indexes.

Data can be loaded into disk indexes using a so-called data source. Built-in sources can fetch data directly from MySQL, PostgreSQL, ODBC compliant database (MS SQL, Oracle, etc), or a pipe in a custom XML format. Adding new data sources drivers (eg. to natively support other DBMSes) is designed to be as easy as possible. RT indexes, as of 1.10-beta, can only be populated using SphinxQL.

As for the name, Sphinx is an acronym which is officially decoded as SQL Phrase Index. Yes, I know about CMU's Sphinx project.

1.2. Sphinx features

Key Sphinx features are:

  • high indexing and searching performance;

  • advanced indexing and querying tools (flexible and feature-rich text tokenizer, querying language, several different ranking modes, etc);

  • advanced result set post-processing (SELECT with expressions, WHERE, ORDER BY, GROUP BY etc over text search results);

  • proven scalability up to billions of documents, terabytes of data, and thousands of queries per second;

  • easy integration with SQL and XML data sources, and SphinxAPI, SphinxQL, or SphinxSE search interfaces;

  • easy scaling with distributed searches.

To expand a bit, Sphinx:

  • has high indexing speed (upto 10-15 MB/sec per core on an internal benchmark);

  • has high search speed (upto 150-250 queries/sec per core against 1,000,000 documents, 1.2 GB of data on an internal benchmark);

  • has high scalability (biggest known cluster indexes over 3,000,000,000 documents, and busiest one peaks over 50,000,000 queries/day);

  • provides good relevance ranking through combination of phrase proximity ranking and statistical (BM25) ranking;

  • provides distributed searching capabilities;

  • provides document excerpts (snippets) generation;

  • provides searching from within application with SphinxAPI or SphinxQL interfaces, and from within MySQL with pluggable SphinxSE storage engine;

  • supports boolean, phrase, word proximity and other types of queries;

  • supports multiple full-text fields per document (upto 32 by default);

  • supports multiple additional attributes per document (ie. groups, timestamps, etc);

  • supports stopwords;

  • supports morphological word forms dictionaries;

  • supports tokenizing exceptions;

  • supports both single-byte encodings and UTF-8;

  • supports stemming (stemmers for English, Russian and Czech are built-in; and stemmers for French, Spanish, Portuguese, Italian, Romanian, German, Dutch, Swedish, Norwegian, Danish, Finnish, Hungarian, are available by building third party libstemmer library);

  • supports MySQL natively (all types of tables, including MyISAM, InnoDB, NDB, Archive, etc are supported);

  • supports PostgreSQL natively;

  • supports ODBC compliant databases (MS SQL, Oracle, etc) natively;

  • ...has 50+ other features not listed here, refer to API and configuration manual!

1.3. Where to get Sphinx

Sphinx is available through its official Web site at http://sphinxsearch.com/.

Currently, Sphinx distribution tarball includes the following software:

  • indexer: an utility which creates fulltext indexes;

  • search: a simple command-line (CLI) test utility which searches through fulltext indexes;

  • searchd: a daemon which enables external software (eg. Web applications) to search through fulltext indexes;

  • sphinxapi: a set of searchd client API libraries for popular Web scripting languages (PHP, Python, Perl, Ruby).

  • spelldump: a simple command-line tool to extract the items from an ispell or MySpell (as bundled with OpenOffice) format dictionary to help customize your index, for use with wordforms.

  • indextool: an utility to dump miscellaneous debug information about the index, added in version 0.9.9-rc2.

1.4. License

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. See COPYING file for details.

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, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

Non-GPL licensing (for OEM/ISV embedded use) can also be arranged, please contact us to discuss commercial licensing possibilities.

1.5. Credits

Author

Sphinx initial author (and a benevolent dictator ever since):

Team

Past and present employees of Sphinx Technologies Inc who should be noted on their work on Sphinx (in alphabetical order):

  • Alexander Klimenko

  • Alexey Dvoichenkov

  • Alexey Vinogradov

  • Ilya Kuznetsov

  • Stanislav Klinov

Contributors

People who contributed to Sphinx and their contributions (in no particular order):

  • Robert "coredev" Bengtsson (Sweden), initial version of PostgreSQL data source

  • Len Kranendonk, Perl API

  • Dmytro Shteflyuk, Ruby API

Many other people have contributed ideas, bug reports, fixes, etc. Thank you!

1.6. History

Sphinx development was started back in 2001, because I didn't manage to find an acceptable search solution (for a database driven Web site) which would meet my requirements. Actually, each and every important aspect was a problem:

  • search quality (ie. good relevance)

    • statistical ranking methods performed rather bad, especially on large collections of small documents (forums, blogs, etc)

  • search speed

    • especially if searching for phrases which contain stopwords, as in "to be or not to be"

  • moderate disk and CPU requirements when indexing

    • important in shared hosting enivronment, not to mention the indexing speed.

Despite the amount of time passed and numerous improvements made in the other solutions, there's still no solution which I personally would be eager to migrate to.

Considering that and a lot of positive feedback received from Sphinx users during last years, the obvious decision is to continue developing Sphinx (and, eventually, to take over the world).

Chapter 2. Installation

Table of Contents

2.1. Supported systems
2.2. Required tools
2.3. Installing Sphinx on Linux
2.4. Installing Sphinx on Windows
2.5. Known installation issues
2.6. Quick Sphinx usage tour

2.1. Supported systems

Most modern UNIX systems with a C++ compiler should be able to compile and run Sphinx without any modifications.

Currently known systems Sphinx has been successfully running on are:

  • Linux 2.4.x, 2.6.x (many various distributions)

  • Windows 2000, XP

  • FreeBSD 4.x, 5.x, 6.x, 7.x

  • NetBSD 1.6, 3.0

  • Solaris 9, 11

  • Mac OS X

CPU architectures known to work include X86, X86-64, SPARC64, ARM.

Chance are good that Sphinx should work on other Unix platforms as well; please report any platforms missing from this list that worked for you!

2.2. Required tools

On UNIX, you will need the following tools to build and install Sphinx:

  • a working C++ compiler. GNU gcc is known to work.

  • a good make program. GNU make is known to work.

On Windows, you will need Microsoft Visual C/C++ Studio .NET 2003 or 2005. Other compilers/environments will probably work as well, but for the time being, you will have to build makefile (or other environment specific project files) manually.

2.3. Installing Sphinx on Linux

  1. Extract everything from the distribution tarball (haven't you already?) and go to the sphinx subdirectory. (We are using version 2.0.1-beta here for the sake of example only; be sure to change this to a specific version you're using.)

    $ tar xzvf sphinx-2.0.1-beta.tar.gz
    $ cd sphinx

  2. Run the configuration program:

    $ ./configure

    There's a number of options to configure. The complete listing may be obtained by using --help switch. The most important ones are:

    • --prefix, which specifies where to install Sphinx; such as --prefix=/usr/local/sphinx (all of the examples use this prefix)

    • --with-mysql, which specifies where to look for MySQL include and library files, if auto-detection fails;

    • --with-pgsql, which specifies where to look for PostgreSQL include and library files.

  3. Build the binaries:

    $ make

  4. Install the binaries in the directory of your choice: (defaults to /usr/local/bin/ on *nix systems, but is overridden with configure --prefix)

    $ make install

2.4. Installing Sphinx on Windows

Installing Sphinx on a Windows server is often easier than installing on a Linux environment; unless you are preparing code patches, you can use the pre-compiled binary files from the Downloads area on the website.

  1. Extract everything from the .zip file you have downloaded - sphinx-2.0.1-beta-win32.zip, or sphinx-2.0.1-beta-win32-pgsql.zip if you need PostgresSQL support as well. (We are using version 2.0.1-beta here for the sake of example only; be sure to change this to a specific version you're using.) You can use Windows Explorer in Windows XP and up to extract the files, or a freeware package like 7Zip to open the archive.

    For the remainder of this guide, we will assume that the folders are unzipped into C:\Sphinx, such that searchd.exe can be found in C:\Sphinx\bin\searchd.exe. If you decide to use any different location for the folders or configuration file, please change it accordingly.

  2. Edit the contents of sphinx.conf.in - specifically entries relating to @CONFDIR@ - to paths suitable for your system.

  3. Install the searchd system as a Windows service:

    C:\Sphinx\bin> C:\Sphinx\bin\searchd --install --config
    C:\Sphinx\sphinx.conf.in --servicename SphinxSearch

  4. The searchd service will now be listed in the Services panel within the Management Console, available from Administrative Tools. It will not have been started, as you will need to configure it and build your indexes with indexer before starting the service. A guide to do this can be found under Quick tour.

    During the next steps of the install (which involve running indexer pretty much as you would on Linux) you may find that you get an error relating to libmysql.dll not being found. If you have MySQL installed, you should find a copy of this library in your Windows directory, or sometimes in Windows\System32, or failing that in the MySQL core directories. If you do receive an error please copy libmysql.dll into the bin directory.

2.5. Known installation issues

If configure fails to locate MySQL headers and/or libraries, try checking for and installing mysql-devel package. On some systems, it is not installed by default.

If make fails with a message which look like 

/bin/sh: g++: command not found
make[1]: *** [libsphinx_a-sphinx.o] Error 127

try checking for and installing gcc-c++ package.

If you are getting compile-time errors which look like 

sphinx.cpp:67: error: invalid application of `sizeof' to
    incomplete type `Private::SizeError<false>'

this means that some compile-time type size check failed. The most probable reason is that off_t type is less than 64-bit on your system. As a quick hack, you can edit sphinx.h and replace off_t with DWORD in a typedef for SphOffset_t, but note that this will prohibit you from using full-text indexes larger than 2 GB. Even if the hack helps, please report such issues, providing the exact error message and compiler/OS details, so I could properly fix them in next releases.

If you keep getting any other error, or the suggestions above do not seem to help you, please don't hesitate to contact me.

2.6. Quick Sphinx usage tour

All the example commands below assume that you installed Sphinx in /usr/local/sphinx, so searchd can be found in /usr/local/sphinx/bin/searchd.

To use Sphinx, you will need to:

  1. Create a configuration file.

    Default configuration file name is sphinx.conf. All Sphinx programs look for this file in current working directory by default.

    Sample configuration file, sphinx.conf.dist, which has all the options documented, is created by configure. Copy and edit that sample file to make your own configuration: (assuming Sphinx is installed into /usr/local/sphinx/)

    $ cd /usr/local/sphinx/etc
    $ cp sphinx.conf.dist sphinx.conf
    $ vi sphinx.conf

    Sample configuration file is setup to index documents table from MySQL database test; so there's example.sql sample data file to populate that table with a few documents for testing purposes:

    $ mysql -u test < /usr/local/sphinx/etc/example.sql

  2. Run the indexer to create full-text index from your data:

    $ cd /usr/local/sphinx/etc
    $ /usr/local/sphinx/bin/indexer --all

  3. Query your newly created index!

To query the index from command line, use search utility:

$ cd /usr/local/sphinx/etc
$ /usr/local/sphinx/bin/search test

To query the index from your PHP scripts, you need to:

  1. Run the search daemon which your script will talk to:

    $ cd /usr/local/sphinx/etc
    $ /usr/local/sphinx/bin/searchd

  2. Run the attached PHP API test script (to ensure that the daemon was succesfully started and is ready to serve the queries):

    $ cd sphinx/api
    $ php test.php test

  3. Include the API (it's located in api/sphinxapi.php) into your own scripts and use it.

Happy searching!

Chapter 3. Indexing

Table of Contents

3.1. Data sources
3.2. Attributes
3.3. MVA (multi-valued attributes)
3.4. Indexes
3.5. Restrictions on the source data
3.6. Charsets, case folding, and translation tables
3.7. SQL data sources (MySQL, PostgreSQL)
3.8. xmlpipe data source
3.9. xmlpipe2 data source
3.10. Live index updates
3.11. Delta index updates
3.12. Index merging

3.1. Data sources

The data to be indexed can generally come from very different sources: SQL databases, plain text files, HTML files, mailboxes, and so on. From Sphinx point of view, the data it indexes is a set of structured documents, each of which has the same set of fields. This is biased towards SQL, where each row correspond to a document, and each column to a field.

Depending on what source Sphinx should get the data from, different code is required to fetch the data and prepare it for indexing. This code is called data source driver (or simply driver or data source for brevity).

At the time of this writing, there are drivers for MySQL and PostgreSQL databases, which can connect to the database using its native C/C++ API, run queries and fetch the data. There's also a driver called xmlpipe, which runs a specified command and reads the data from its stdout. See Section 3.8, “xmlpipe data source” section for the format description.

There can be as many sources per index as necessary. They will be sequentially processed in the very same order which was specifed in index definition. All the documents coming from those sources will be merged as if they were coming from a single source.

3.2. Attributes

Attributes are additional values associated with each document that can be used to perform additional filtering and sorting during search.

It is often desired to additionally process full-text search results based not only on matching document ID and its rank, but on a number of other per-document values as well. For instance, one might need to sort news search results by date and then relevance, or search through products within specified price range, or limit blog search to posts made by selected users, or group results by month. To do that efficiently, Sphinx allows to attach a number of additional attributes to each document, and store their values in the full-text index. It's then possible to use stored values to filter, sort, or group full-text matches.

Attributes, unlike the fields, are not full-text indexed. They are stored in the index, but it is not possible to search them as full-text, and attempting to do so results in an error.

For example, it is impossible to use the extended matching mode expression @column 1 to match documents where column is 1, if column is an attribute, and this is still true even if the numeric digits are normally indexed.

Attributes can be used for filtering, though, to restrict returned rows, as well as sorting or result grouping; it is entirely possible to sort results purely based on attributes, and ignore the search relevance tools. Additionally, attributes are returned from the search daemon, while the indexed text is not.

A good example for attributes would be a forum posts table. Assume that only title and content fields need to be full-text searchable - but that sometimes it is also required to limit search to a certain author or a sub-forum (ie. search only those rows that have some specific values of author_id or forum_id columns in the SQL table); or to sort matches by post_date column; or to group matching posts by month of the post_date and calculate per-group match counts.

This can be achieved by specifying all the mentioned columns (excluding title and content, that are full-text fields) as attributes, indexing them, and then using API calls to setup filtering, sorting, and grouping. Here as an example.

Example sphinx.conf part:

...
sql_query = SELECT id, title, content, \
	author_id, forum_id, post_date FROM my_forum_posts
sql_attr_uint = author_id
sql_attr_uint = forum_id
sql_attr_timestamp = post_date
...

Example application code (in PHP):

// only search posts by author whose ID is 123
$cl->SetFilter ( "author_id", array ( 123 ) );

// only search posts in sub-forums 1, 3 and 7
$cl->SetFilter ( "forum_id", array ( 1,3,7 ) );

// sort found posts by posting date in descending order
$cl->SetSortMode ( SPH_SORT_ATTR_DESC, "post_date" );

Attributes are named. Attribute names are case insensitive. Attributes are not full-text indexed; they are stored in the index as is. Currently supported attribute types are:

  • unsigned integers (1-bit to 32-bit wide);

  • UNIX timestamps;

  • floating point values (32-bit, IEEE 754 single precision);

  • string ordinals (specially computed integers);

  • strings (since 1.10-beta);

  • MVA, multi-value attributes (variable-length lists of 32-bit unsigned integers).

The complete set of per-document attribute values is sometimes referred to as docinfo. Docinfos can either be

  • stored separately from the main full-text index data ("extern" storage, in .spa file), or

  • attached to each occurence of document ID in full-text index data ("inline" storage, in .spd file).

When using extern storage, a copy of .spa file (with all the attribute values for all the documents) is kept in RAM by searchd at all times. This is for performance reasons; random disk I/O would be too slow. On the contrary, inline storage does not require any additional RAM at all, but that comes at the cost of greatly inflating the index size: remember that it copies all attribute value every time when the document ID is mentioned, and that is exactly as many times as there are different keywords in the document. Inline may be the only viable option if you have only a few attributes and need to work with big datasets in limited RAM. However, in most cases extern storage makes both indexing and searching much more efficient.

Search-time memory requirements for extern storage are (1+number_of_attrs)*number_of_docs*4 bytes, ie. 10 million docs with 2 groups and 1 timestamp will take (1+2+1)*10M*4 = 160 MB of RAM. This is PER DAEMON, not per query. searchd will allocate 160 MB on startup, read the data and keep it shared between queries. The children will NOT allocate any additional copies of this data.

3.3. MVA (multi-valued attributes)

MVAs, or multi-valued attributes, are an important special type of per-document attributes in Sphinx. MVAs make it possible to attach lists of values to every document. They are useful for article tags, product categories, etc. Filtering and group-by (but not sorting) on MVA attributes is supported.

Currently, MVA list entries are limited to unsigned 32-bit integers. The list length is not limited, you can have an arbitrary number of values attached to each document as long as RAM permits (.spm file that contains the MVA values will be precached in RAM by searchd). The source data can be taken either from a separate query, or from a document field; see source type in sql_attr_multi. In the first case the query will have to return pairs of document ID and MVA values, in the second one the field will be parsed for integer values. There are absolutely no requirements as to incoming data order; the values will be automatically grouped by document ID (and internally sorted within the same ID) during indexing anyway.

When filtering, a document will match the filter on MVA attribute if any of the values satisfy the filtering condition. (Therefore, documents that pass through exclude filters will not contain any of the forbidden values.) When grouping by MVA attribute, a document will contribute to as many groups as there are different MVA values associated with that document. For instance, if the collection contains exactly 1 document having a 'tag' MVA with values 5, 7, and 11, grouping on 'tag' will produce 3 groups with '@count' equal to 1 and '@groupby' key values of 5, 7, and 11 respectively. Also note that grouping by MVA might lead to duplicate documents in the result set: because each document can participate in many groups, it can be chosen as the best one in in more than one group, leading to duplicate IDs. PHP API historically uses ordered hash on the document ID for the resulting rows; so you'll also need to use SetArrayResult() in order to employ group-by on MVA with PHP API.

3.4. Indexes

To be able to answer full-text search queries fast, Sphinx needs to build a special data structure optimized for such queries from your text data. This structure is called index; and the process of building index from text is called indexing.

Different index types are well suited for different tasks. For example, a disk-based tree-based index would be easy to update (ie. insert new documents to existing index), but rather slow to search. Therefore, Sphinx architecture allows for different index types to be implemented easily.

The only index type which is implemented in Sphinx at the moment is designed for maximum indexing and searching speed. This comes at a cost of updates being really slow; theoretically, it might be slower to update this type of index than than to reindex it from scratch. However, this very frequently could be worked around with muiltiple indexes, see Section 3.10, “Live index updates” for details.

It is planned to implement more index types, including the type which would be updateable in real time.

There can be as many indexes per configuration file as necessary. indexer utility can reindex either all of them (if --all option is specified), or a certain explicitly specified subset. searchd utility will serve all the specified indexes, and the clients can specify what indexes to search in run time.

3.5. Restrictions on the source data

There are a few different restrictions imposed on the source data which is going to be indexed by Sphinx, of which the single most important one is:

ALL DOCUMENT IDS MUST BE UNIQUE UNSIGNED NON-ZERO INTEGER NUMBERS (32-BIT OR 64-BIT, DEPENDING ON BUILD TIME SETTINGS).

If this requirement is not met, different bad things can happen. For instance, Sphinx can crash with an internal assertion while indexing; or produce strange results when searching due to conflicting IDs. Also, a 1000-pound gorilla might eventually come out of your display and start throwing barrels at you. You've been warned.

3.6. Charsets, case folding, and translation tables

When indexing some index, Sphinx fetches documents from the specified sources, splits the text into words, and does case folding so that "Abc", "ABC" and "abc" would be treated as the same word (or, to be pedantic, term).

To do that properly, Sphinx needs to know

  • what encoding is the source text in;

  • what characters are letters and what are not;

  • what letters should be folded to what letters.

This should be configured on a per-index basis using charset_type and charset_table options. charset_type specifies whether the document encoding is single-byte (SBCS) or UTF-8. charset_table specifies the table that maps letter characters to their case folded versions. The characters that are not in the table are considered to be non-letters and will be treated as word separators when indexing or searching through this index.

Note that while default tables do not include space character (ASCII code 0x20, Unicode U+0020) as a letter, it's in fact perfectly legal to do so. This can be useful, for instance, for indexing tag clouds, so that space-separated word sets would index as a single search query term.

Default tables currently include English and Russian characters. Please do submit your tables for other languages!

3.7. SQL data sources (MySQL, PostgreSQL)

With all the SQL drivers, indexing generally works as follows.

Most options, such as database user/host/password, are straightforward. However, there are a few subtle things, which are discussed in more detail here.

Ranged queries

Main query, which needs to fetch all the documents, can impose a read lock on the whole table and stall the concurrent queries (eg. INSERTs to MyISAM table), waste a lot of memory for result set, etc. To avoid this, Sphinx supports so-called ranged queries. With ranged queries, Sphinx first fetches min and max document IDs from the table, and then substitutes different ID intervals into main query text and runs the modified query to fetch another chunk of documents. Here's an example.

Example 3.1. Ranged query usage example

# in sphinx.conf

sql_query_range	= SELECT MIN(id),MAX(id) FROM documents
sql_range_step = 1000
sql_query = SELECT * FROM documents WHERE id>=$start AND id<=$end

If the table contains document IDs from 1 to, say, 2345, then sql_query would be run three times:

  1. with $start replaced with 1 and $end replaced with 1000;

  2. with $start replaced with 1001 and $end replaced with 2000;

  3. with $start replaced with 2000 and $end replaced with 2345.

Obviously, that's not much of a difference for 2000-row table, but when it comes to indexing 10-million-row MyISAM table, ranged queries might be of some help.

sql_post vs. sql_post_index

The difference between post-query and post-index query is in that post-query is run immediately when Sphinx received all the documents, but further indexing may still fail for some other reason. On the contrary, by the time the post-index query gets executed, it is guaranteed that the indexing was succesful. Database connection is dropped and re-established because sorting phase can be very lengthy and would just timeout otherwise.

3.8. xmlpipe data source

xmlpipe data source was designed to enable users to plug data into Sphinx without having to implement new data sources drivers themselves. It is limited to 2 fixed fields and 2 fixed attributes, and is deprecated in favor of Section 3.9, “xmlpipe2 data source” now. For new streams, use xmlpipe2.

To use xmlpipe, configure the data source in your configuration file as follows: 

source example_xmlpipe_source
{
    type = xmlpipe
    xmlpipe_command = perl /www/mysite.com/bin/sphinxpipe.pl
}

The indexer will run the command specified in xmlpipe_command, and then read, parse and index the data it prints to stdout. More formally, it opens a pipe to given command and then reads from that pipe.

indexer will expect one or more documents in custom XML format. Here's the example document stream, consisting of two documents:

Example 3.2. XMLpipe document stream

<document>
<id>123</id>
<group>45</group>
<timestamp>1132223498</timestamp>
<title>test title</title>
<body>
this is my document body
</body>
</document>

<document>
<id>124</id>
<group>46</group>
<timestamp>1132223498</timestamp>
<title>another test</title>
<body>
this is another document
</body>
</document>


Legacy xmlpipe legacy driver uses a builtin parser which is pretty fast but really strict and does not actually fully support XML. It requires that all the fields must be present, formatted exactly as in this example, and occur exactly in the same order. The only optional field is timestamp; it defaults to 1.

3.9. xmlpipe2 data source

xmlpipe2 lets you pass arbitrary full-text and attribute data to Sphinx in yet another custom XML format. It also allows to specify the schema (ie. the set of fields and attributes) either in the XML stream itself, or in the source settings.

When indexing xmlpipe2 source, indexer runs the given command, opens a pipe to its stdout, and expects well-formed XML stream. Here's sample stream data:

Example 3.3. xmlpipe2 document stream

<?xml version="1.0" encoding="utf-8"?>
<sphinx:docset>

<sphinx:schema>
<sphinx:field name="subject"/> 
<sphinx:field name="content"/>
<sphinx:attr name="published" type="timestamp"/>
<sphinx:attr name="author_id" type="int" bits="16" default="1"/>
</sphinx:schema>

<sphinx:document id="1234">
<content>this is the main content <![CDATA[[and this <cdata> entry
must be handled properly by xml parser lib]]></content>
<published>1012325463</published>
<subject>note how field/attr tags can be
in <b class="red">randomized</b> order</subject>
<misc>some undeclared element</misc>
</sphinx:document>

<sphinx:document id="1235">
<subject>another subject</subject>
<content>here comes another document, and i am given to understand,
that in-document field order must not matter, sir</content>
<published>1012325467</published>
</sphinx:document>

<!-- ... even more sphinx:document entries here ... -->

<sphinx:killlist>
<id>1234</id>
<id>4567</id>
</sphinx:killlist>

</sphinx:docset>


Arbitrary fields and attributes are allowed. They also can occur in the stream in arbitrary order within each document; the order is ignored. There is a restriction on maximum field length; fields longer than 2 MB will be truncated to 2 MB (this limit can be changed in the source).

The schema, ie. complete fields and attributes list, must be declared before any document could be parsed. This can be done either in the configuration file using xmlpipe_field and xmlpipe_attr_XXX settings, or right in the stream using <sphinx:schema> element. <sphinx:schema> is optional. It is only allowed to occur as the very first sub-element in <sphinx:docset>. If there is no in-stream schema definition, settings from the configuration file will be used. Otherwise, stream settings take precedence.

Unknown tags (which were not declared neither as fields nor as attributes) will be ignored with a warning. In the example above, <misc> will be ignored. All embedded tags and their attributes (such as <b> in <subject> in the example above) will be silently ignored.

Support for incoming stream encodings depends on whether iconv is installed on the system. xmlpipe2 is parsed using libexpat parser that understands US-ASCII, ISO-8859-1, UTF-8 and a few UTF-16 variants natively. Sphinx configure script will also check for libiconv presence, and utilize it to handle other encodings. libexpat also enforces the requirement to use UTF-8 charset on Sphinx side, because the parsed data it returns is always in UTF-8.

XML elements (tags) recognized by xmlpipe2 (and their attributes where applicable) are:

sphinx:docset

Mandatory top-level element, denotes and contains xmlpipe2 document set.

sphinx:schema

Optional element, must either occur as the very first child of sphinx:docset, or never occur at all. Declares the document schema. Contains field and attribute declarations. If present, overrides per-source settings from the configuration file.

sphinx:field

Optional element, child of sphinx:schema. Declares a full-text field. Known attributes are:

  • "name", specifies the XML element name that will be treated as a full-text field in the subsequent documents.

  • "attr", specifies whether to also index this field as a string or word count attribute. Possible values are "string" and "wordcount". Introduced in version 1.10-beta.

sphinx:attr

Optional element, child of sphinx:schema. Declares an attribute. Known attributes are:

  • "name", specifies the element name that should be treated as an attribute in the subsequent documents.

  • "type", specifies the attribute type. Possible values are "int", "timestamp", "str2ordinal", "bool", "float" and "multi".

  • "bits", specifies the bit size for "int" attribute type. Valid values are 1 to 32.

  • "default", specifies the default value for this attribute that should be used if the attribute's element is not present in the document.

sphinx:document

Mandatory element, must be a child of sphinx:docset. Contains arbitrary other elements with field and attribute values to be indexed, as declared either using sphinx:field and sphinx:attr elements or in the configuration file. The only known attribute is "id" that must contain the unique integer document ID.

sphinx:killlist

Optional element, child of sphinx:docset. Contains a number of "id" elements whose contents are document IDs to be put into a kill-list for this index.

3.10. Live index updates

There are two major approaches to maintaining the full-text index contents up to date. Note, however, that both these approaches deal with the task of full-text data updates, and not attribute updates. Instant attribute updates are supported since version 0.9.8. Refer to UpdateAttributes() API call description for details.

First, you can use disk-based indexes, partition them manually, and only rebuild the smaller partitions (so-called "deltas") frequently. By minimizing the rebuild size, you can reduce the average indexing lag to something as low as 30-60 seconds. This approach was the the only one available in versions 0.9.x. On huge collections it actually might be the most efficient one. Refer to Section 3.11, “Delta index updates” for details.

Second, versions 1.x (starting with 1.10-beta) add support for so-called real-time indexes (RT indexes for short) that on-the-fly updates of the full-text data. Updates on a RT index can appear in the search results in 1-2 milliseconds, ie. 0.001-0.002 seconds. However, RT index are less efficient for bulk indexing huge amounts of data. Refer to Chapter 4, Real-time indexes for details.

3.11. Delta index updates

There's a frequent situation when the total dataset is too big to be reindexed from scratch often, but the amount of new records is rather small. Example: a forum with a 1,000,000 archived posts, but only 1,000 new posts per day.

In this case, "live" (almost real time) index updates could be implemented using so called "main+delta" scheme.

The idea is to set up two sources and two indexes, with one "main" index for the data which only changes rarely (if ever), and one "delta" for the new documents. In the example above, 1,000,000 archived posts would go to the main index, and newly inserted 1,000 posts/day would go to the delta index. Delta index could then be reindexed very frequently, and the documents can be made available to search in a matter of minutes.

Specifying which documents should go to what index and reindexing main index could also be made fully automatical. One option would be to make a counter table which would track the ID which would split the documents, and update it whenever the main index is reindexed.

Example 3.4. Fully automated live updates

# in MySQL
CREATE TABLE sph_counter
(
    counter_id INTEGER PRIMARY KEY NOT NULL,
    max_doc_id INTEGER NOT NULL
);

# in sphinx.conf
source main
{
    # ...
    sql_query_pre = SET NAMES utf8
    sql_query_pre = REPLACE INTO sph_counter SELECT 1, MAX(id) FROM documents
    sql_query = SELECT id, title, body FROM documents \
        WHERE id<=( SELECT max_doc_id FROM sph_counter WHERE counter_id=1 )
}

source delta : main
{
    sql_query_pre = SET NAMES utf8
    sql_query = SELECT id, title, body FROM documents \
        WHERE id>( SELECT max_doc_id FROM sph_counter WHERE counter_id=1 )
}

index main
{
    source = main
    path = /path/to/main
    # ... all the other settings
}

# note how all other settings are copied from main,
# but source and path are overridden (they MUST be)
index delta : main
{
    source = delta
    path = /path/to/delta
}


Note how we're overriding sql_query_pre in the delta source. We need to explicitly have that override. Otherwise REPLACE query would be run when indexing delta source too, effectively nullifying it. However, when we issue the directive in the inherited source for the first time, it removes all inherited values, so the encoding setup is also lost. So sql_query_pre in the delta can not just be empty; and we need to issue the encoding setup query explicitly once again.

3.12. Index merging

Merging two existing indexes can be more efficient that indexing the data from scratch, and desired in some cases (such as merging 'main' and 'delta' indexes instead of simply reindexing 'main' in 'main+delta' partitioning scheme). So indexer has an option to do that. Merging the indexes is normally faster than reindexing but still not instant on huge indexes. Basically, it will need to read the contents of both indexes once and write the result once. Merging 100 GB and 1 GB index, for example, will result in 202 GB of IO (but that's still likely less than the indexing from scratch requires).

The basic command syntax is as follows:


indexer --merge DSTINDEX SRCINDEX [--rotate]

Only the DSTINDEX index will be affected: the contents of SRCINDEX will be merged into it. --rotate switch will be required if DSTINDEX is already being served by searchd. The initially devised usage pattern is to merge a smaller update from SRCINDEX into DSTINDEX. Thus, when merging the attributes, values from SRCINDEX will win if duplicate document IDs are encountered. Note, however, that the "old" keywords will not be automatically removed in such cases. For example, if there's a keyword "old" associated with document 123 in DSTINDEX, and a keyword "new" associated with it in SRCINDEX, document 123 will be found by both keywords after the merge. You can supply an explicit condition to remove documents from DSTINDEX to mitigate that; the relevant switch is --merge-dst-range:


indexer --merge main delta --merge-dst-range deleted 0 0

This switch lets you apply filters to the destination index along with merging. There can be several filters; all of their conditions must be met in order to include the document in the resulting mergid index. In the example above, the filter passes only those records where 'deleted' is 0, eliminating all records that were flagged as deleted (for instance, using UpdateAttributes() call).

Chapter 4. Real-time indexes

Table of Contents

4.1. RT indexes overview
4.2. Known caveats with RT indexes
4.3. RT index internals
4.4. Binary logging

Real-time indexes (or RT indexes for brevity) are a new backend that lets you insert, update, or delete documents (rows) on the fly. RT indexes were added in version 1.10-beta. While querying of RT indexes is possible using any of the SphinxAPI, SphinxQL, or SphinxSE, updating them is only possible via SphinxQL at the moment. Full SphinxQL reference is available in Chapter 7, SphinxQL reference.

4.1. RT indexes overview

RT indexes should be declared in sphinx.conf, just as every other index type. Notable differences from the regular, disk-based indexes are that a) data sources are not required and ignored, and b) you should explicitly enumerate all the text fields, not just attributes. Here's an example:

Example 4.1. RT index declaration

index rt
{
	type = rt
	path = /usr/local/sphinx/data/rt
	rt_field = title
	rt_field = content
	rt_attr_uint = gid
}

RT INDEXES ARE CURRENTLY (AS OF VERSION 1.10-beta) A WORK IN PROGRESS. Therefore, they might lack certain features: for instance, prefix/infix indexing, MVA attributes, etc are not supported yet. There also might be performance and stability issues. However, all the regular indexing features and most of the searching features are already in place, our internal testing passes, and last but not least a number of production instances are already using RT indexes with good results.

RT index can be accessed using MySQL protocol. INSERT, REPLACE, DELETE, and SELECT statements against RT index are supported. For instance, this is an example session with the sample index above:

$ mysql -h 127.0.0.1 -P 9306
Welcome to the MySQL monitor.  Commands end with ; or \g.
Your MySQL connection id is 1
Server version: 1.10-dev (r2153)

Type 'help;' or '\h' for help. Type '\c' to clear the buffer.

mysql> INSERT INTO rt VALUES ( 1, 'first record', 'test one', 123 );
Query OK, 1 row affected (0.05 sec)

mysql> INSERT INTO rt VALUES ( 2, 'second record', 'test two', 234 );
Query OK, 1 row affected (0.00 sec)

mysql> SELECT * FROM rt;
+------+--------+------+
| id   | weight | gid  |
+------+--------+------+
|    1 |      1 |  123 |
|    2 |      1 |  234 |
+------+--------+------+
2 rows in set (0.02 sec)

mysql> SELECT * FROM rt WHERE MATCH('test');
+------+--------+------+
| id   | weight | gid  |
+------+--------+------+
|    1 |   1643 |  123 |
|    2 |   1643 |  234 |
+------+--------+------+
2 rows in set (0.01 sec)

mysql> SELECT * FROM rt WHERE MATCH('@title test');
Empty set (0.00 sec)

Both partial and batch INSERT syntaxes are supported, ie. you can specify a subset of columns, and insert several rows at a time. Deletions are also possible using DELETE statement; the only currently supported syntax is DELETE FROM <index> WHERE id=<id>. REPLACE is also supported, enabling you to implement updates.

mysql> INSERT INTO rt ( id, title ) VALUES ( 3, 'third row' ), ( 4, 'fourth entry' );
Query OK, 2 rows affected (0.01 sec)

mysql> SELECT * FROM rt;
+------+--------+------+
| id   | weight | gid  |
+------+--------+------+
|    1 |      1 |  123 |
|    2 |      1 |  234 |
|    3 |      1 |    0 |
|    4 |      1 |    0 |
+------+--------+------+
4 rows in set (0.00 sec)

mysql> DELETE FROM rt WHERE id=2;
Query OK, 0 rows affected (0.00 sec)

mysql> SELECT * FROM rt WHERE MATCH('test');
+------+--------+------+
| id   | weight | gid  |
+------+--------+------+
|    1 |   1500 |  123 |
+------+--------+------+
1 row in set (0.00 sec)

mysql> INSERT INTO rt VALUES ( 1, 'first record on steroids', 'test one', 123 );
ERROR 1064 (42000): duplicate id '1'

mysql> REPLACE INTO rt VALUES ( 1, 'first record on steroids', 'test one', 123 );
Query OK, 1 row affected (0.01 sec)

mysql> SELECT * FROM rt WHERE MATCH('steroids');
+------+--------+------+
| id   | weight | gid  |
+------+--------+------+
|    1 |   1500 |  123 |
+------+--------+------+
1 row in set (0.01 sec)

Data stored in RT index should survive clean shutdown. When binary logging is enabled, it should also survive crash and/or dirty shutdown, and recover on subsequent startup.

4.2. Known caveats with RT indexes

As of 1.10-beta, RT indexes are a beta quality feature: while no major, showstopper-class issues are known, there still are a few known usage quirks. Those quirks are listed in this section.

  • Prefix and infix indexing are not supported yet.

  • MVAs are not supported yet.

  • Disk chunks optimization routine is not implemented yet.

  • On initial index creation, attributes are reordered by type, in the following order: uint, bigint, float, timestamp, string. So when using INSERT without an explicit column names list, specify all uint column values first, then bigint, etc.

  • Default conservative RAM chunk limit (rt_mem_limit) of 32M can lead to poor performance on bigger indexes, you should raise it to 256..1024M if you're planning to index gigabytes.

  • High DELETE/REPLACE rate can lead to kill-list fragmentation and impact searching performance.

  • No transaction size limits are currently imposed; too many concurrent INSERT/REPLACE transactions might therefore consume a lot of RAM.

  • In case of a damaged binlog, recovery will stop on the first damaged transaction, even though it's technically possible to keep looking further for subsequent undamaged transactions, and recover those. This mid-file damage case (due to flaky HDD/CDD/tape?) is supposed to be extremely rare, though.

  • Multiple INSERTs grouped in a single transaction perform better than equivalent single-row transactions and are recommended for batch loading of data.

4.3. RT index internals

RT index is internally chunked. It keeps a so-called RAM chunk that stores all the most recent changes. RAM chunk memory usage is rather strictly limited with per-index rt_mem_limit directive. Once RAM chunk grows over this limit, a new disk chunk is created from its data, and RAM chunk is reset. Thus, while most changes on the RT index will be performed in RAM only and complete instantly (in milliseconds), those changes that overflow the RAM chunk will stall for the duration of disk chunk creation (a few seconds).

Disk chunks are, in fact, just regular disk-based indexes. But they're a part of an RT index and automatically managed by it, so you need not configure nor manage them manually. Because a new disk chunk is created every time RT chunk overflows the limit, and because in-memory chunk format is close to on-disk format, the disk chunks will be approximately rt_mem_limit bytes in size each.

Generally, it is better to set the limit bigger, to minimize both the frequency of flushes, and the index fragmentation (number of disk chunks). For instance, on a dedicated search server that handles a big RT index, it can be advised to set rt_mem_limit to 1-2 GB. A global limit on all indexes is also planned, but not yet implemented yet as of 1.10-beta.

Disk chunk full-text index data can not be actually modified, so the full-text field changes (ie. row deletions and updates) suppress a previous row version from a disk chunk using a kill-list, but do not actually physically purge the data. Therefore, on workloads with high full-text updates ratio index might eventually get polluted by these previous row versions, and searching performance would degrade. Physical index purging that would improve the performance is planned, but not yet implemented as of 1.10-beta.

Data in RAM chunk gets saved to disk on clean daemon shutdown, and then loaded back on startup. However, on daemon or server crash, updates from RAM chunk might be lost. To prevent that, binary logging of transactions can be used; see Section 4.4, “Binary logging” for details.

Full-text changes in RT index are transactional. They are stored in a per-thread accumulator until COMMIT, then applied at once. Bigger batches per single COMMIT should result in faster indexing.

4.4. Binary logging

Binary logs are essentially a recovery mechanism. With binary logs enabled, searchd writes every given transaction to the binlog file, and uses that for recovery after an unclean shutdown. On clean shutdown, RAM chunks are saved to disk, and then all the binlog files are unlinked.

During normal operation, a new binlog file will be opened every time when binlog_max_log_size limit (which defaults to 128M) is reached. Older, already closed binlog files are kept until all of the transactions stored in them (from all indexes) are flushed as a disk chunk. Setting the limit to 0 pretty much prevents binlog from being unlinked at all while searchd is running; however, it will still be unlinked on clean shutdown.

There are 3 different binlog flushing strategies, controlled by binlog_flush directive which takes the values of 0, 1, or 2. 0 means to flush the log to OS and sync it to disk every second; 1 means flush and sync every transaction; and 2 (the default mode) means flush every transaction but sync every second. Sync is relatively slow because it has to perform physical disk writes, so mode 1 is the safest (every committed transaction is guaranteed to be written on disk) but the slowest. Flushing log to OS prevents from data loss on searchd crashes but not system crashes. Mode 2 is the default.

On recovery after an unclean shutdown, binlogs are replayed and all logged transactions since the last good on-disk state are restored. Transactions are checksummed so in case of binlog file corruption garbage data will not be replayed; such a broken transaction will be detected and, currently, will stop replay. Transactions also start with a magic marker and timestamped, so in case of binlog damage in the middle of the file, it's technically possible to skip broken transactions and keep replaying from the next good one, and/or it's possible to replay transactions until a given timestamp (point-in-time recovery), but none of that is implemented yet as of 1.10-beta.

One unwanted side effect of binlogs is that activel updating a small RT index that fully fits into a RAM chunk part will lead to an ever-growing binlog that can never be unlinked until clean shutdown. Binlogs are essentially append-only deltas against the last known good saved state on disk, and unless RAM chunk gets saved, they can not be unlinked. An ever-growing binlog is not very good for disk use and crash recovery time. Starting with 2.0.1-beta you can configure searchd to perform a periodic RAM chunk flush to fix that problem using a rt_flush_period directive. With periodic flushes enabled, searchd will keep a separate thread, checking whether RT indexes RAM chunks need to be written back to disk. Once that happens, the respective binlogs can be (and are) safely unlinked.

Note that rt_flush_period only controls the frequency at which the checks happen. There are no guarantees that the particular RAM chunk will get saved. For instance, it does not make sense to regularly re-save a huge RAM chunk that only gets a few rows worh of updates. The search daemon determine whether to actually perform the flush with a few heuristics.

Chapter 5. Searching

Table of Contents

5.1. Matching modes
5.2. Boolean query syntax
5.3. Extended query syntax
5.4. Weighting
5.5. Expressions, functions, and operators
5.5.1. Operators
5.5.2. Numeric functions
5.5.3. Date and time functions
5.5.4. Type conversion functions
5.5.5. Comparison functions
5.5.6. Miscellaneous functions
5.6. Sorting modes
5.7. Grouping (clustering) search results
5.8. Distributed searching
5.9. searchd query log formats
5.9.1. Plain log format
5.9.2. SphinxQL log format
5.10. MySQL protocol support and SphinxQL
5.11. Multi-queries
5.12. Collations
5.13. User-defined functions (UDF)

5.1. Matching modes

There are the following matching modes available:

  • SPH_MATCH_ALL, matches all query words (default mode);

  • SPH_MATCH_ANY, matches any of the query words;

  • SPH_MATCH_PHRASE, matches query as a phrase, requiring perfect match;

  • SPH_MATCH_BOOLEAN, matches query as a boolean expression (see Section 5.2, “Boolean query syntax”);

  • SPH_MATCH_EXTENDED, matches query as an expression in Sphinx internal query language (see Section 5.3, “Extended query syntax”). As of 0.9.9, this has been superceded by SPH_MATCH_EXTENDED2, providing additional functionality and better performance. The ident is retained for legacy application code that will continue to be compatible once Sphinx and its components, including the API, are upgraded.

  • SPH_MATCH_EXTENDED2, matches query using the second version of the Extended matching mode.

  • SPH_MATCH_FULLSCAN, matches query, forcibly using the "full scan" mode as below. NB, any query terms will be ignored, such that filters, filter-ranges and grouping will still be applied, but no text-matching.

The SPH_MATCH_FULLSCAN mode will be automatically activated in place of the specified matching mode when the following conditions are met:

  1. The query string is empty (ie. its length is zero).

  2. docinfo storage is set to extern.

In full scan mode, all the indexed documents will be considered as matching. Such queries will still apply filters, sorting, and group by, but will not perform any full-text searching. This can be useful to unify full-text and non-full-text searching code, or to offload SQL server (there are cases when Sphinx scans will perform better than analogous MySQL queries). An example of using the full scan mode might be to find posts in a forum. By selecting the forum's user ID via SetFilter() but not actually providing any search text, Sphinx will match every document (i.e. every post) where SetFilter() would match - in this case providing every post from that user. By default this will be ordered by relevancy, followed by Sphinx document ID in ascending order (earliest first).

5.2. Boolean query syntax

Boolean queries allow the following special operators to be used:

  • explicit operator AND: 

    hello & world

  • operator OR: 

    hello | world

  • operator NOT: 

    hello -world
hello !world

  • grouping: 

    ( hello world )

Here's an example query which uses all these operators:

Example 5.1. Boolean query example

( cat -dog ) | ( cat -mouse)


There always is implicit AND operator, so "hello world" query actually means "hello & world".

OR operator precedence is higher than AND, so "looking for cat | dog | mouse" means "looking for ( cat | dog | mouse )" and not "(looking for cat) | dog | mouse".

Queries like "-dog", which implicitly include all documents from the collection, can not be evaluated. This is both for technical and performance reasons. Technically, Sphinx does not always keep a list of all IDs. Performance-wise, when the collection is huge (ie. 10-100M documents), evaluating such queries could take very long.

5.3. Extended query syntax

The following special operators and modifiers can be used when using the extended matching mode:

  • operator OR: 

    hello | world

  • operator NOT: 

    hello -world
hello !world

  • field search operator: 

    @title hello @body world

  • field position limit modifier (introduced in version 0.9.9-rc1): 

    @body[50] hello

  • multiple-field search operator: 

    @(title,body) hello world

  • all-field search operator: 

    @* hello

  • phrase search operator: 

    "hello world"

  • proximity search operator: 

    "hello world"~10

  • quorum matching operator: 

    "the world is a wonderful place"/3

  • strict order operator (aka operator "before"): 

    aaa << bbb << ccc

  • exact form modifier (introduced in version 0.9.9-rc1): 

    raining =cats and =dogs

  • field-start and field-end modifier (introduced in version 0.9.9-rc2): 

    ^hello world$

  • NEAR, generalized proximity operator (introduced in version 2.0.1-beta): 

    hello NEAR/3 world NEAR/4 "my test"

  • SENTENCE operator (introduced in version 2.0.1-beta): 

    all SENTENCE words SENTENCE "in one sentence"

  • PARAGRAPH operator (introduced in version 2.0.1-beta): 

    "Bill Gates" PARAGRAPH "Steve Jobs"

  • zone limit operator: 

    ZONE:(h3,h4) only in these titles

Here's an example query that uses some of these operators:

Example 5.2. Extended matching mode: query example

"hello world" @title "example program"~5 @body python -(php|perl) @* code


The full meaning of this search is:

  • Find the words 'hello' and 'world' adjacently in any field in a document;

  • Additionally, the same document must also contain the words 'example' and 'program' in the title field, with up to, but not including, 10 words between the words in question; (E.g. "example PHP program" would be matched however "example script to introduce outside data into the correct context for your program" would not because two terms have 10 or more words between them)

  • Additionally, the same document must contain the word 'python' in the body field, but not contain either 'php' or 'perl';

  • Additionally, the same document must contain the word 'code' in any field.

There always is implicit AND operator, so "hello world" means that both "hello" and "world" must be present in matching document.

OR operator precedence is higher than AND, so "looking for cat | dog | mouse" means "looking for ( cat | dog | mouse )" and not "(looking for cat) | dog | mouse".

Field limit operator limits subsequent searching to a given field. Normally, query will fail with an error message if given field name does not exist in the searched index. However, that can be suppressed by specifying "@@relaxed" option at the very beginning of the query: 

@@relaxed @nosuchfield my query

This can be helpful when searching through heterogeneous indexes with different schemas.

Field position limit, introduced in version 0.9.9-rc1, additionaly restricts the searching to first N position within given field (or fields). For example, "@body[50] hello" will not match the documents where the keyword 'hello' occurs at position 51 and below in the body.

Proximity distance is specified in words, adjusted for word count, and applies to all words within quotes. For instance, "cat dog mouse"~5 query means that there must be less than 8-word span which contains all 3 words, ie. "CAT aaa bbb ccc DOG eee fff MOUSE" document will not match this query, because this span is exactly 8 words long.

Quorum matching operator introduces a kind of fuzzy matching. It will only match those documents that pass a given threshold of given words. The example above ("the world is a wonderful place"/3) will match all documents that have at least 3 of the 6 specified words.

Strict order operator (aka operator "before"), introduced in version 0.9.9-rc2, will match the document only if its argument keywords occur in the document exactly in the query order. For instance, "black << cat" query (without quotes) will match the document "black and white cat" but not the "that cat was black" document. Order operator has the lowest priority. It can be applied both to just keywords and more complex expressions, ie. this is a valid query: 

(bag of words) << "exact phrase" << red|green|blue

Exact form keyword modifier, introduced in version 0.9.9-rc1, will match the document only if the keyword occurred in exactly the specified form. The default behaviour is to match the document if the stemmed keyword matches. For instance, "runs" query will match both the document that contains "runs" and the document that contains "running", because both forms stem to just "run" - while "=runs" query will only match the first document. Exact form operator requires index_exact_words option to be enabled. This is a modifier that affects the keyword and thus can be used within operators such as phrase, proximity, and quorum operators.

Field-start and field-end keyword modifiers, introduced in version 0.9.9-rc2, will make the keyword match only if it occurred at the very start or the very end of a fulltext field, respectively. For instance, the query "^hello world$" (with quotes and thus combining phrase operator and start/end modifiers) will only match documents that contain at least one field that has exactly these two keywords.

Starting with 0.9.9-rc1, arbitrarily nested brackets and negations are allowed. However, the query must be possible to compute without involving an implicit list of all documents: 

// correct query
aaa -(bbb -(ccc ddd))

// queries that are non-computable
-aaa
aaa | -bbb

NEAR operator, added in 2.0.1-beta, is a generalized version of a proximity operator. The syntax is NEAR/N, it is case-sensitive, and no spaces are allowed beetwen the NEAR keyword, the slash sign, and the distance value.

The original proximity operator only worked on sets of keywords. NEAR is more generic and can accept arbitrary subexpressions as its two arguments, matching the document when both subexpressions are found within N words of each other, no matter in which order. NEAR is left associative and has the same (lowest) precedence as BEFORE.

You should also note how a (one NEAR/7 two NEAR/7 three) query using NEAR is not really equivalent to a ("one two three"~7) one using keyword proximity operator. The difference here is that the proximity operator allows for up to 6 non-matching words between all the 3 matching words, but the version with NEAR is less restrictive: it would allow for up to 6 words between 'one' and 'two' and then for up to 6 more between that two-word matching and a 'three' keyword.

SENTENCE and PARAGRAPH operators, added in 2.0.1-beta, matches the document when both its arguments are within the same sentence or the same paragraph of text, respectively. The arguments can be either keywords, or phrases, or the instances of the same operator. Here are a few examples: 

one SENTENCE two
one SENTENCE "two three"
one SENTENCE "two three" SENTENCE four

The order of the arguments within the sentence or paragraph does not matter. These operators only work on indexes built with index_sp (sentence and paragraph indexing feature) enabled, and revert to a mere AND otherwise. Refer to the index_sp directive documentation for the notes on what's considered a sentence and a paragraph.

ZONE limit operator, added in 2.0.1-beta, is quite similar to field limit operator, but restricts matching to a given in-field zone or a list of zones. Note that the subsequent subexpressions are not required to match in a single contiguous span of a given zone, and may match in multiple spans. For instance, (ZONE:th hello world) query will match this example document: 

<th>Table 1. Local awareness of Hello Kitty brand.</th>
.. some table data goes here ..
<th>Table 2. World-wide brand awareness.</th>

ZONE operator affects the query until the next field or ZONE limit operator, or the closing parenthesis. It only works on the indexes built with zones support (see Section 11.2.9, “index_zones”) and will be ignored otherwise.

5.4. Weighting

Specific weighting function (currently) depends on the search mode.

There are these major parts which are used in the weighting functions:

  1. phrase rank,

  2. statistical rank.

Phrase rank is based on a length of longest common subsequence (LCS) of search words between document body and query phrase. So if there's a perfect phrase match in some document then its phrase rank would be the highest possible, and equal to query words count.

Statistical rank is based on classic BM25 function which only takes word frequencies into account. If the word is rare in the whole database (ie. low frequency over document collection) or mentioned a lot in specific document (ie. high frequency over matching document), it receives more weight. Final BM25 weight is a floating point number between 0 and 1.

In all modes, per-field weighted phrase ranks are computed as a product of LCS multiplied by per-field weight speficifed by user. Per-field weights are integer, default to 1, and can not be set lower than 1.

In SPH_MATCH_BOOLEAN mode, no weighting is performed at all, every match weight is set to 1.

In SPH_MATCH_ALL and SPH_MATCH_PHRASE modes, final weight is a sum of weighted phrase ranks.

In SPH_MATCH_ANY mode, the idea is essentially the same, but it also adds a count of matching words in each field. Before that, weighted phrase ranks are additionally mutliplied by a value big enough to guarantee that higher phrase rank in any field will make the match ranked higher, even if it's field weight is low.

In SPH_MATCH_EXTENDED mode, final weight is a sum of weighted phrase ranks and BM25 weight, multiplied by 1000 and rounded to integer.

This is going to be changed, so that MATCH_ALL and MATCH_ANY modes use BM25 weights as well. This would improve search results in those match spans where phrase ranks are equal; this is especially useful for 1-word queries.

The key idea (in all modes, besides boolean) is that better subphrase matches are ranked higher, and perfect matches are pulled to the top. Author's experience is that this phrase proximity based ranking provides noticeably better search quality than any statistical scheme alone (such as BM25, which is commonly used in other search engines).

5.5. Expressions, functions, and operators

Sphinx lets you use arbitrary arithmetic expressions both via SphinxQL and SphinxAPI, involving attribute values, internal attributes (document ID and relevance weight), arithmetic operations, a number of built-in functions, and user-defined functions. This section documents the supported operators and functions. Here's the complete reference list for quick access.

5.5.1. Operators

Arithmetic operators: +, -, *, /, %, DIV, MOD

The standard arithmetic operators. Arithmetic calculations involving those can be performed in three different modes: (a) using single-precision, 32-bit IEEE 754 floating point values (the default), (b) using signed 32-bit integers, (c) using 64-bit signed integers. The expression parser will automatically switch to integer mode if there are no operations the result in a floating point value. Otherwise, it will use the default floating point mode. For instance, a+b will be computed using 32-bit integers if both arguments are 32-bit integers; or using 64-bit integers if both arguments are integers but one of them is 64-bit; or in floats otherwise. However, a/b or sqrt(a) will always be computed in floats, because these operations return a result of non-integer type. To avoid the first, you can either use IDIV(a,b) or a DIV b form. Also, a*b will not be automatically promoted to 64-bit when the arguments are 32-bit. To enforce 64-bit results, you can use BIGINT(). (But note that if there are non-integer operations, BIGINT() will simply be ignored.)

Comparison operators: <, > <=, >=, =, <>

Comparison operators (eg. = or <=) return 1.0 when the condition is true and 0.0 otherwise. For instance, (a=b)+3 will evaluate to 4 when attribute 'a' is equal to attribute 'b', and to 3 when 'a' is not. Unlike MySQL, the equality comparisons (ie. = and <> operators) introduce a small equality threshold (1e-6 by default). If the difference between compared values is within the threshold, they will be considered equal.

Boolean operators: AND, OR, NOT

Boolean operators (AND, OR, NOT) were introduced in 0.9.9-rc2 and behave as usual. They are left-associative and have the least priority compared to other operators. NOT has more priority than AND and OR but nevertheless less than any other operator. AND and OR have the same priority so brackets use is recommended to avoid confusion in complex expressions.

Bitwise operators: &, |

These operators perform bitwise AND and OR respectively. The operands must be of an integer types. Introduced in version 1.10-beta.

5.5.2. Numeric functions

ABS()

Returns the absolute value of the argument.

CEIL()

Returns the smallest integer value greater or equal to the argument.

COS()

Returns the cosine of the argument.

EXP()

Returns the exponent of the argument (e=2.718... to the power of the argument).

FLOOR()

Returns the largest integer value lesser or equal to the argument.

IDIV()

Returns the result of an integer division of the first argument by the second argument. Both arguments must be of an integer type.

LN()

Returns the natural logarithm of the argument (with the base of e=2.718...).

LOG10()

Returns the common logarithm of the argument (with the base of 10).

LOG2()

Returns the binary logarithm of the argument (with the base of 2).

MAX()

Returns the bigger of two arguments.

MIN()

Returns the smaller of two arguments.

POW()

Returns the first argument raised to the power of the second argument.

SIN()

Returns the sine of the argument.

SQRT()

Returns the square root of the argument.

5.5.3. Date and time functions

DAY()

Returns the integer day of month (in 1..31 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta.

MONTH()

Returns the integer month (in 1..12 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta.

NOW()

Returns the current timestamp as an INTEGER. Introduced in version 0.9.9-rc1.

YEAR()

Returns the integer year (in 1969..2038 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta.

YEARMONTH()

Returns the integer year and month code (in 196912..203801 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta.

YEARMONTHDAY()

Returns the integer year, month, and date code (in 19691231..20380119 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta.

5.5.4. Type conversion functions

BIGINT()

Forcibly promotes the integer argument to 64-bit type, and does nothing on floating point argument. It's intended to help enforce evaluation of certain expressions (such as a*b) in 64-bit mode even though all the arguments are 32-bit. Introduced in version 0.9.9-rc1.

SINT()

Forcibly reinterprets its 32-bit unsigned integer argument as signed, and also expands it to 64-bit type (because 32-bit type is unsigned). It's easily illustrated by the following example: 1-2 normally evaluates to 4294967295, but SINT(1-2) evaluates to -1. Introduced in version 1.10-beta.

5.5.5. Comparison functions

IF()

IF() behavior is slightly different that that of its MySQL counterpart. It takes 3 arguments, check whether the 1st argument is equal to 0.0, returns the 2nd argument if it is not zero, or the 3rd one when it is. Note that unlike comparison operators, IF() does not use a threshold! Therefore, it's safe to use comparison results as its 1st argument, but arithmetic operators might produce unexpected results. For instance, the following two calls will produce different results even though they are logically equivalent: 

IF ( sqrt(3)*sqrt(3)-3<>0, a, b )
IF ( sqrt(3)*sqrt(3)-3, a, b )

In the first case, the comparison operator <> will return 0.0 (false) because of a threshold, and IF() will always return 'b' as a result. In the second one, the same sqrt(3)*sqrt(3)-3 expression will be compared with zero without threshold by the IF() function itself. But its value will be slightly different from zero because of limited floating point calculations precision. Because of that, the comparison with 0.0 done by IF() will not pass, and the second variant will return 'a' as a result.

IN()

IN(expr,val1,val2,...), introduced in version 0.9.9-rc1, takes 2 or more arguments, and returns 1 if 1st argument (expr) is equal to any of the other arguments (val1..valN), or 0 otherwise. Currently, all the checked values (but not the expression itself!) are required to be constant. (Its technically possible to implement arbitrary expressions too, and that might be implemented in the future.) Constants are pre-sorted and then binary search is used, so IN() even against a big arbitrary list of constants will be very quick. Starting with 0.9.9-rc2, first argument can also be a MVA attribute. In that case, IN() will return 1 if any of the MVA values is equal to any of the other arguments. Starting with 2.0.1-beta, IN() also supports IN(expr,@uservar) syntax to check whether the value belongs to the list in the given global user variable.

INTERVAL()

INTERVAL(expr,point1,point2,point3,...), introduced in version 0.9.9-rc1, takes 2 or more arguments, and returns the index of the argument that is less than the first argument: it returns 0 if expr<point1, 1 if point1<=expr<point2, and so on. It is required that point1<point2<...<pointN for this function to work correctly.

5.5.6. Miscellaneous functions

CRC32()

Returns the CRC32 value of a string argument. Introduced in version 2.0.1-beta.

GEODIST()

GEODIST(lat1,long1,lat2,long2) function, introduced in version 0.9.9-rc2, computes geosphere distance between two given points specified by their coordinates. Note that both latitudes and longitudes must be in radians and the result will be in meters. You can use arbitrary expression as any of the four coordinates. An optimized path will be selected when one pair of the arguments refers directly to a pair attributes and the other one is constant.

5.6. Sorting modes

There are the following result sorting modes available:

  • SPH_SORT_RELEVANCE mode, that sorts by relevance in descending order (best matches first);

  • SPH_SORT_ATTR_DESC mode, that sorts by an attribute in descending order (bigger attribute values first);

  • SPH_SORT_ATTR_ASC mode, that sorts by an attribute in ascending order (smaller attribute values first);

  • SPH_SORT_TIME_SEGMENTS mode, that sorts by time segments (last hour/day/week/month) in descending order, and then by relevance in descending order;

  • SPH_SORT_EXTENDED mode, that sorts by SQL-like combination of columns in ASC/DESC order;

  • SPH_SORT_EXPR mode, that sorts by an arithmetic expression.

SPH_SORT_RELEVANCE ignores any additional parameters and always sorts matches by relevance rank. All other modes require an additional sorting clause, with the syntax depending on specific mode. SPH_SORT_ATTR_ASC, SPH_SORT_ATTR_DESC and SPH_SORT_TIME_SEGMENTS modes require simply an attribute name. SPH_SORT_RELEVANCE is equivalent to sorting by "@weight DESC, @id ASC" in extended sorting mode, SPH_SORT_ATTR_ASC is equivalent to "attribute ASC, @weight DESC, @id ASC", and SPH_SORT_ATTR_DESC to "attribute DESC, @weight DESC, @id ASC" respectively.

SPH_SORT_TIME_SEGMENTS mode

In SPH_SORT_TIME_SEGMENTS mode, attribute values are split into so-called time segments, and then sorted by time segment first, and by relevance second.

The segments are calculated according to the current timestamp at the time when the search is performed, so the results would change over time. The segments are as follows:

  • last hour,

  • last day,

  • last week,

  • last month,

  • last 3 months,

  • everything else.

These segments are hardcoded, but it is trivial to change them if necessary.

This mode was added to support searching through blogs, news headlines, etc. When using time segments, recent records would be ranked higher because of segment, but withing the same segment, more relevant records would be ranked higher - unlike sorting by just the timestamp attribute, which would not take relevance into account at all.

SPH_SORT_EXTENDED mode

In SPH_SORT_EXTENDED mode, you can specify an SQL-like sort expression with up to 5 attributes (including internal attributes), eg: 

@relevance DESC, price ASC, @id DESC

Both internal attributes (that are computed by the engine on the fly) and user attributes that were configured for this index are allowed. Internal attribute names must start with magic @-symbol; user attribute names can be used as is. In the example above, @relevance and @id are internal attributes and price is user-specified.

Known internal attributes are:

  • @id (match ID)

  • @weight (match weight)

  • @rank (match weight)

  • @relevance (match weight)

  • @random (return results in random order)

@rank and @relevance are just additional aliases to @weight.

SPH_SORT_EXPR mode

Expression sorting mode lets you sort the matches by an arbitrary arithmetic expression, involving attribute values, internal attributes (@id and @weight), arithmetic operations, and a number of built-in functions. Here's an example: 

$cl->SetSortMode ( SPH_SORT_EXPR,
	"@weight + ( user_karma + ln(pageviews) )*0.1" );

The operators and functions supported in the expressions are discussed in a separate section, Section 5.5, “Expressions, functions, and operators”.

5.7. Grouping (clustering) search results

Sometimes it could be useful to group (or in other terms, cluster) search results and/or count per-group match counts - for instance, to draw a nice graph of how much maching blog posts were there per each month; or to group Web search results by site; or to group matching forum posts by author; etc.

In theory, this could be performed by doing only the full-text search in Sphinx and then using found IDs to group on SQL server side. However, in practice doing this with a big result set (10K-10M matches) would typically kill performance.

To avoid that, Sphinx offers so-called grouping mode. It is enabled with SetGroupBy() API call. When grouping, all matches are assigned to different groups based on group-by value. This value is computed from specified attribute using one of the following built-in functions:

  • SPH_GROUPBY_DAY, extracts year, month and day in YYYYMMDD format from timestamp;

  • SPH_GROUPBY_WEEK, extracts year and first day of the week number (counting from year start) in YYYYNNN format from timestamp;

  • SPH_GROUPBY_MONTH, extracts month in YYYYMM format from timestamp;

  • SPH_GROUPBY_YEAR, extracts year in YYYY format from timestamp;

  • SPH_GROUPBY_ATTR, uses attribute value itself for grouping.

The final search result set then contains one best match per group. Grouping function value and per-group match count are returned along as "virtual" attributes named @group and @count respectively.

The result set is sorted by group-by sorting clause, with the syntax similar to SPH_SORT_EXTENDED sorting clause syntax. In addition to @id and @weight, group-by sorting clause may also include:

  • @group (groupby function value),

  • @count (amount of matches in group).

The default mode is to sort by groupby value in descending order, ie. by "@group desc".

On completion, total_found result parameter would contain total amount of matching groups over he whole index.

WARNING: grouping is done in fixed memory and thus its results are only approximate; so there might be more groups reported in total_found than actually present. @count might also be underestimated. To reduce inaccuracy, one should raise max_matches. If max_matches allows to store all found groups, results will be 100% correct.

For example, if sorting by relevance and grouping by "published" attribute with SPH_GROUPBY_DAY function, then the result set will contain

  • one most relevant match per each day when there were any matches published,

  • with day number and per-day match count attached,

  • sorted by day number in descending order (ie. recent days first).

Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported through SetSelect() API call when using GROUP BY.

5.8. Distributed searching

To scale well, Sphinx has distributed searching capabilities. Distributed searching is useful to improve query latency (ie. search time) and throughput (ie. max queries/sec) in multi-server, multi-CPU or multi-core environments. This is essential for applications which need to search through huge amounts data (ie. billions of records and terabytes of text).

The key idea is to horizontally partition (HP) searched data accross search nodes and then process it in parallel.

Partitioning is done manually. You should

  • setup several instances of Sphinx programs (indexer and searchd) on different servers;

  • make the instances index (and search) different parts of data;

  • configure a special distributed index on some of the searchd instances;

  • and query this index.

This index only contains references to other local and remote indexes - so it could not be directly reindexed, and you should reindex those indexes which it references instead.

When searchd receives a query against distributed index, it does the following:

  1. connects to configured remote agents;

  2. issues the query;

  3. sequentially searches configured local indexes (while the remote agents are searching);

  4. retrieves remote agents' search results;

  5. merges all the results together, removing the duplicates;

  6. sends the merged resuls to client.

From the application's point of view, there are no differences between searching through a regular index, or a distributed index at all. That is, distributed indexes are fully transparent to the application, and actually there's no way to tell whether the index you queried was distributed or local. (Even though as of 0.9.9 Sphinx does not allow to combine searching through distributed indexes with anything else, this constraint will be lifted in the future.)

Any searchd instance could serve both as a master (which aggregates the results) and a slave (which only does local searching) at the same time. This has a number of uses:

  1. every machine in a cluster could serve as a master which searches the whole cluster, and search requests could be balanced between masters to achieve a kind of HA (high availability) in case any of the nodes fails;

  2. if running within a single multi-CPU or multi-core machine, there would be only 1 searchd instance quering itself as an agent and thus utilizing all CPUs/core.

It is scheduled to implement better HA support which would allow to specify which agents mirror each other, do health checks, keep track of alive agents, load-balance requests, etc.

5.9. searchd query log formats

In version 2.0.1-beta and above two query log formats are supported. Previous versions only supported a custom plain text format. That format is still the default one. However, while it might be more convenient for manual monitoring and review, but hard to replay for benchmarks, it only logs search queries but not the other types of requests, does not always contain the complete search query data, etc. The default text format is also harder (and sometimes impossible) to replay for benchmarking purposes. The new sphinxql format alleviates that. It aims to be complete and automatable, even though at the cost of brevity and readability.

5.9.1. Plain log format

By default, searchd logs all succesfully executed search queries into a query log file. Here's an example: 

[Fri Jun 29 21:17:58 2007] 0.004 sec [all/0/rel 35254 (0,20)] [lj] test
[Fri Jun 29 21:20:34 2007] 0.024 sec [all/0/rel 19886 (0,20) @channel_id] [lj] test

This log format is as follows: 

[query-date] query-time [match-mode/filters-count/sort-mode
    total-matches (offset,limit) @groupby-attr] [index-name] query

Match mode can take one of the following values:

  • "all" for SPH_MATCH_ALL mode;

  • "any" for SPH_MATCH_ANY mode;

  • "phr" for SPH_MATCH_PHRASE mode;

  • "bool" for SPH_MATCH_BOOLEAN mode;

  • "ext" for SPH_MATCH_EXTENDED mode;

  • "ext2" for SPH_MATCH_EXTENDED2 mode;

  • "scan" if the full scan mode was used, either by being specified with SPH_MATCH_FULLSCAN, or if the query was empty (as documented under Matching Modes)

Sort mode can take one of the following values:

  • "rel" for SPH_SORT_RELEVANCE mode;

  • "attr-" for SPH_SORT_ATTR_DESC mode;

  • "attr+" for SPH_SORT_ATTR_ASC mode;

  • "tsegs" for SPH_SORT_TIME_SEGMENTS mode;

  • "ext" for SPH_SORT_EXTENDED mode.

Additionally, if searchd was started with --iostats, there will be a block of data after where the index(es) searched are listed.

A query log entry might take the form of:

[Fri Jun 29 21:17:58 2007] 0.004 sec [all/0/rel 35254 (0,20)] [lj]
   [ios=6 kb=111.1 ms=0.5] test

This additional block is information regarding I/O operations in performing the search: the number of file I/O operations carried out, the amount of data in kilobytes read from the index files and time spent on I/O operations (although there is a background processing component, the bulk of this time is the I/O operation time).

5.9.2. SphinxQL log format

This is a new log format introduced in 2.0.1-beta, with the goals begin logging everything and then some, and in a format easy to automate (for insance, automatically replay). New format can either be enabled via the query_log_format directive in the configuration file, or switched back and forth on the fly with the SET GLOBAL query_log_format=... statement via SphinxQL. In the new format, the example from the previous section would look as follows. (Wrapped below for readability, but with just one query per line in the actual log.) 

/* Fri Jun 29 21:17:58.609 2007 2011 conn 2 wall 0.004 found 35254 */
SELECT * FROM lj WHERE MATCH('test') OPTION ranker=proximity;

/* Fri Jun 29 21:20:34 2007.555 conn 3 wall 0.024 found 19886 */
SELECT * FROM lj WHERE MATCH('test') GROUP BY channel_id
OPTION ranker=proximity;

Note that all requests would be logged in this format, including those sent via SphinxAPI and SphinxSE, not just those sent via SphinxQL. Also note, that this kind of logging works only with plain log files and will not work if you use 'syslog' for logging.

The features of SphinxQL log format compared to the default text one are as follows.

  • All request types should be logged. (This is still work in progress.)

  • Full statement data will be logged where possible.

  • Errors and warnings are logged.

  • The log should be automatically replayable via SphinxQL.

  • Additional performance counters (currently, per-agent distributed query times) are logged.

Every request (including both SphinxAPI and SphinxQL) request must result in exactly one log line. All request types, including INSERT, CALL SNIPPETS, etc will eventually get logged, though as of time of this writing, that is a work in progress). Every log line must be a valid SphinxQL statement that reconstructs the full request, except if the logged request is too big and needs shortening for performance reasons. Additional messages, counters, etc can be logged in the comments section after the request.

5.10. MySQL protocol support and SphinxQL

Starting with version 0.9.9-rc2, Sphinx searchd daemon supports MySQL binary network protocol and can be accessed with regular MySQL API. For instance, 'mysql' CLI client program works well. Here's an example of querying Sphinx using MySQL client: 

$ mysql -P 9306
Welcome to the MySQL monitor.  Commands end with ; or \g.
Your MySQL connection id is 1
Server version: 0.9.9-dev (r1734)

Type 'help;' or '\h' for help. Type '\c' to clear the buffer.

mysql> SELECT * FROM test1 WHERE MATCH('test') 
    -> ORDER BY group_id ASC OPTION ranker=bm25;
+------+--------+----------+------------+
| id   | weight | group_id | date_added |
+------+--------+----------+------------+
|    4 |   1442 |        2 | 1231721236 |
|    2 |   2421 |      123 | 1231721236 |
|    1 |   2421 |      456 | 1231721236 |
+------+--------+----------+------------+
3 rows in set (0.00 sec)

Note that mysqld was not even running on the test machine. Everything was handled by searchd itself.

The new access method is supported in addition to native APIs which all still work perfectly well. In fact, both access methods can be used at the same time. Also, native API is still the default access method. MySQL protocol support needs to be additionally configured. This is a matter of 1-line config change, adding a new listener with mysql41 specified as a protocol: 

listen = localhost:9306:mysql41

Just supporting the protocol and not the SQL syntax would be useless so Sphinx now also supports a subset of SQL that we dubbed SphinxQL. It supports the standard querying all the index types with SELECT, modifying RT indexes with INSERT, REPLACE, and DELETE, and much more. Full SphinxQL reference is available in Chapter 7, SphinxQL reference.

5.11. Multi-queries

Multi-queries, or query batches, let you send multiple queries to Sphinx in one go (more formally, one network request).

Two API methods that implement multi-query mechanism are AddQuery() and RunQueries(). You can also run multiple queries with SphinxQL, see Section 7.18, “Multi-statement queries”. (In fact, regular Query() call is internally implemented as a single AddQuery() call immediately followed by RunQueries() call.) AddQuery() captures the current state of all the query settings set by previous API calls, and memorizes the query. RunQueries() actually sends all the memorized queries, and returns multiple result sets. There are no restrictions on the queries at all, except just a sanity check on a number of queries in a single batch (see Section 11.4.25, “max_batch_queries”).

Why use multi-queries? Generally, it all boils down to performance. First, by sending requests to searchd in a batch instead of one by one, you always save a bit by doing less network roundtrips. Second, and somewhat more important, sending queries in a batch enables searchd to perform certain internal optimizations. As new types of optimizations are being added over time, it generally makes sense to pack all the queries into batches where possible, so that simply upgrading Sphinx to a new version would automatically enable new optimizations. In the case when there aren't any possible batch optimizations to apply, queries will be processed one by one internally.

Why (or rather when) not use multi-queries? Multi-queries requires all the queries in a batch to be independent, and sometimes they aren't. That is, sometimes query B is based on query A results, and so can only be set up after executing query A. For instance, you might want to display results from a secondary index if and only if there were no results found in a primary index. Or maybe just specify offset into 2nd result set based on the amount of matches in the 1st result set. In that case, you will have to use separate queries (or separate batches).

As of 0.9.10, there are two major optimizations to be aware of: common query optimization (available since 0.9.8); and common subtree optimization (available since 0.9.10).

Common query optimization means that searchd will identify all those queries in a batch where only the sorting and group-by settings differ, and only perform searching once. For instance, if a batch consists of 3 queries, all of them are for "ipod nano", but 1st query requests top-10 results sorted by price, 2nd query groups by vendor ID and requests top-5 vendors sorted by rating, and 3rd query requests max price, full-text search for "ipod nano" will only be performed once, and its results will be reused to build 3 different result sets.

So-called faceted searching is a particularly important case that benefits from this optimization. Indeed, faceted searching can be implemented by running a number of queries, one to retrieve search results themselves, and a few other ones with same full-text query but different group-by settings to retrieve all the required groups of results (top-3 authors, top-5 vendors, etc). And as long as full-text query and filtering settings stay the same, common query optimization will trigger, and greatly improve performance.

Common subtree optimization is even more interesting. It lets searchd exploit similarities between batched full-text queries. It identifies common full-text query parts (subtress) in all queries, and caches them between queries. For instance, look at the following query batch: 

barack obama president
barack obama john mccain
barack obama speech

There's a common two-word part ("barack obama") that can be computed only once, then cached and shared across the queries. And common subtree optimization does just that. Per-query cache size is strictly controlled by subtree_docs_cache and subtree_hits_cache directives (so that caching all sxiteen gazillions of documents that match "i am" does not exhaust the RAM and instantly kill your server).

Here's a code sample (in PHP) that fire the same query in 3 different sorting modes: 

require ( "sphinxapi.php" );
$cl = new SphinxClient ();
$cl->SetMatchMode ( SPH_MATCH_EXTENDED2 );

$cl->SetSortMode ( SPH_SORT_RELEVANCE );
$cl->AddQuery ( "the", "lj" );
$cl->SetSortMode ( SPH_SORT_EXTENDED, "published desc" );
$cl->AddQuery ( "the", "lj" );
$cl->SetSortMode ( SPH_SORT_EXTENDED, "published asc" );
$cl->AddQuery ( "the", "lj" );
$res = $cl->RunQueries();

How to tell whether the queries in the batch were actually optimized? If they were, respective query log will have a "multiplier" field that specifies how many queries were processed together: 

[Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext2/0/rel 747541 (0,20)] [lj] the
[Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext2/0/ext 747541 (0,20)] [lj] the
[Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext2/0/ext 747541 (0,20)] [lj] the

Note the "x3" field. It means that this query was optimized and processed in a sub-batch of 3 queries. For reference, this is how the regular log would look like if the queries were not batched: 

[Sun Jul 12 15:18:17.062 2009] 0.059 sec [ext2/0/rel 747541 (0,20)] [lj] the
[Sun Jul 12 15:18:17.156 2009] 0.091 sec [ext2/0/ext 747541 (0,20)] [lj] the
[Sun Jul 12 15:18:17.250 2009] 0.092 sec [ext2/0/ext 747541 (0,20)] [lj] the

Note how per-query time in multi-query case was improved by a factor of 1.5x to 2.3x, depending on a particular sorting mode. In fact, for both common query and common subtree optimizations, there were reports of 3x and even more improvements, and that's from production instances, not just synthetic tests.

5.12. Collations

Introduced to Sphinx in version 2.0.1-beta to supplement string sorting, collations essentially affect the string attribute comparisons. They specify both the character set encoding and the strategy that Sphinx uses to compare strings when doing ORDER BY or GROUP BY with a string attribute involved.

String attributes are stored as is when indexing, and no character set or language information is attached to them. That's okay as long as Sphinx only needs to store and return the strings to the calling application verbatim. But when you ask Sphinx to sort by a string value, that request immediately becomes quite ambiguous.

First, single-byte (ASCII, or ISO-8859-1, or Windows-1251) strings need to be processed differently that the UTF-8 ones that may encode every character with a variable number of bytes. So we need to know what is the character set type to interepret the raw bytes as meaningful characters properly.

Second, we additionally need to know the language-specific string sorting rules. For instance, when sorting according to US rules in en_US locale, the accented character '' (small letter i with diaeresis) should be placed somewhere after 'z'. However, when sorting with French rules and fr_FR locale in mind, it should be placed between 'i' and 'j'. And some other set of rules might choose to ignore accents at all, allowing '' and 'i' to be mixed arbitrarily.

Third, but not least, we might need case-sensitive sorting in some scenarios and case-insensitive sorting in some others.

Collations combine all of the above: the character set, the lanugage rules, and the case sensitivity. Sphinx currently provides the following four collations.

  1. libc_ci

  2. libc_cs

  3. utf8_general_ci

  4. binary

The first two collations rely on several standard C library (libc) calls and can thus support any locale that is installed on your system. They provide case-insensitive (_ci) and case-sensitive (_cs) comparisons respectively. By default they will use C locale, effectively resorting to bytewise comparisons. To change that, you need to specify a different available locale using collation_libc_locale directive. The list of locales available on your system can usually be obtained with the locale command: 

$ locale -a
C
en_AG
en_AU.utf8
en_BW.utf8
en_CA.utf8
en_DK.utf8
en_GB.utf8
en_HK.utf8
en_IE.utf8
en_IN
en_NG
en_NZ.utf8
en_PH.utf8
en_SG.utf8
en_US.utf8
en_ZA.utf8
en_ZW.utf8
es_ES
fr_FR
POSIX
ru_RU.utf8
ru_UA.utf8

The specific list of the system locales may vary. Consult your OS documentation to install additional needed locales.

utf8_general_ci and binary locales are built-in into Sphinx. The first one is a generic collation for UTF-8 data (without any so-called language tailoring); it should behave similar to utf8_general_ci collation in MySQL. The second one is a simple bytewise comparison.

Collation can be overriden via SphinxQL on a per-session basis using SET collation_connection statement. All subsequent SphinxQL queries will use this collation. SphinxAPI and SphinxSE queries will use the server default collation, as specified in collation_server configuration directive. Sphinx currently defaults to libc_ci collation.

Collations should affect all string attribute comparisons, including those within ORDER BY and GROUP BY, so differently ordered or grouped results can be returned depending on the collation chosen.

5.13. User-defined functions (UDF)

Starting with 2.0.1-beta, Sphinx supports User-Defined Functions, or UDF for short. They can be loaded and unloaded dynamically into searchd without having to restart the daemon, and used in expressions when searching. UDF features at a glance are as follows.

  • Functions can take integer (both 32-bit and 64-bit), float, string, or MVA arguments.

  • Functions can return integer or float values.

  • Functions can check the argument number, types, and names and raise errors.

  • Only simple functions (that is, non-aggregate ones) are currently supported.

User-defined functions need your OS to support dynamically loadable libraries (aka shared objects). Most of the modern OSes are eligible, including Linux, Windows, MacOS, Solaris, BSD and others. (The internal testing has been done on Linux and Windows.) The UDF libraries must reside in a directory specified by plugin_dir directive, and the server must be configured to use workers = threads mode. Relative paths to the library files are not allowed. Once the library is succesfully built and copied to the trusted location, you can then dynamically install and deinstall the functions using CREATE FUNCTION and DROP FUNCTION statements respectively. A single library can contain multiple functions. A library gets loaded when you first install a function from it, and unloaded when you deinstall all the functions from that library.

The library functions that will implement a UDF visible to SQL statements need to follow C calling convention, and a simple naming convention. Sphinx source distribution provides a sample file, src/udfexample.c, that defines a few simple functions showing how to work with integer, string, and MVA arguments; you can use that one as a foundation for your new functions. It includes the UDF interface header file, src/sphinxudf.h, that defines the required types and structures. sphinxudf.h header is standalone, that is, does not require any other parts of Sphinx source to compile.

Every function that you intend to use in your SELECT statements requires at least two corresponding C/C++ functions: the initialization call, and the function call itself. You can also optionally define the deinitialization call if your function requires any post-query cleanup. (For instance, if you were allocating any memory in either the initialization call or the function calls.) Function names in SQL are case insensitive, C function names are not. They need to be all lower-case. Mistakes in function name prevent UDFs from loading. You also have to pay special attention to the calling convention used when compiling, the list and the types of arguments, and the return type of the main function call. Mistakes in either are likely to crash the server, or result in unexpected results in the best case. Last but not least, all functions need to be thread-safe.

Let's assume for the sake of example that your UDF name in SphinxQL will be MYFUNC. The initialization, main, and deinitialization functions would then need to be named as follows and take the following arguments: 

/// initialization function
/// called once during query initialization
/// returns 0 on success
/// returns non-zero and fills error_message buffer on failure
int myfunc_init ( SPH_UDF_INIT * init, SPH_UDF_ARGS * args,
                  char * error_message );

/// main call function
/// returns the computed value
/// writes non-zero value into error_flag to indicate errors
RETURN_TYPE myfunc ( SPH_UDF_INIT * init, SPH_UDF_ARGS * args,
                     char * error_flag );

/// optional deinitialization function
/// called once to cleanup once query processing is done
void myfunc_deinit ( SPH_UDF_INIT * init );

The two mentioned structures, SPH_UDF_INIT and SPH_UDF_ARGS, are defined in the src/sphinxudf.h interface header and documented there. RETURN_TYPE of the main function must be one of the following:

  • int for the functions that return INT.

  • sphinx_int64_t for the functions that return BIGINT.

  • float for the functions that return FLOAT.

The calling sequence is as follows. myfunc_init() is called once when initializing the query. It can return a non-zero code to indicate a failure; in that case query is not executed, and the error message from the error_message buffer is returned. Otherwise, myfunc() is be called for every row, and a myfunc_deinit() is then called when the query ends. myfunc() can indicate an error by writing a non-zero byte value to error_flag, in that case, it will no more be called for subsequent rows, and a default value of 0 will be substituted. Sphinx might or might not choose to terminate such queries early, neither behavior is currently guaranteed.

Chapter 6. Command line tools reference

Table of Contents

6.1. indexer command reference
6.2. searchd command reference
6.3. search command reference
6.4. spelldump command reference
6.5. indextool command reference

As mentioned elsewhere, Sphinx is not a single program called 'sphinx', but a collection of 4 separate programs which collectively form Sphinx. This section covers these tools and how to use them.

6.1. indexer command reference

indexer is the first of the two principle tools as part of Sphinx. Invoked from either the command line directly, or as part of a larger script, indexer is solely responsible for gathering the data that will be searchable.

The calling syntax for indexer is as follows:

indexer [OPTIONS] [indexname1 [indexname2 [...]]]

Essentially you would list the different possible indexes (that you would later make available to search) in sphinx.conf, so when calling indexer, as a minimum you need to be telling it what index (or indexes) you want to index.

If sphinx.conf contained details on 2 indexes, mybigindex and mysmallindex, you could do the following:

$ indexer mybigindex
$ indexer mysmallindex mybigindex

As part of the configuration file, sphinx.conf, you specify one or more indexes for your data. You might call indexer to reindex one of them, ad-hoc, or you can tell it to process all indexes - you are not limited to calling just one, or all at once, you can always pick some combination of the available indexes.

The majority of the options for indexer are given in the configuration file, however there are some options you might need to specify on the command line as well, as they can affect how the indexing operation is performed. These options are:

  • --config <file> (-c <file> for short) tells indexer to use the given file as its configuration. Normally, it will look for sphinx.conf in the installation directory (e.g. /usr/local/sphinx/etc/sphinx.conf if installed into /usr/local/sphinx), followed by the current directory you are in when calling indexer from the shell. This is most of use in shared environments where the binary files are installed somewhere like /usr/local/sphinx/ but you want to provide users with the ability to make their own custom Sphinx set-ups, or if you want to run multiple instances on a single server. In cases like those you could allow them to create their own sphinx.conf files and pass them to indexer with this option. For example: 

    $ indexer --config /home/myuser/sphinx.conf myindex

  • --all tells indexer to update every index listed in sphinx.conf, instead of listing individual indexes. This would be useful in small configurations, or cron-type or maintenance jobs where the entire index set will get rebuilt each day, or week, or whatever period is best. Example usage: 

    $ indexer --config /home/myuser/sphinx.conf --all

  • --rotate is used for rotating indexes. Unless you have the situation where you can take the search function offline without troubling users, you will almost certainly need to keep search running whilst indexing new documents. --rotate creates a second index, parallel to the first (in the same place, simply including .new in the filenames). Once complete, indexer notifies searchd via sending the SIGHUP signal, and searchd will attempt to rename the indexes (renaming the existing ones to include .old and renaming the .new to replace them), and then start serving from the newer files. Depending on the setting of seamless_rotate, there may be a slight delay in being able to search the newer indexes. Example usage: 

    $ indexer --rotate --all

  • --quiet tells indexer not to output anything, unless there is an error. Again, most used for cron-type, or other script jobs where the output is irrelevant or unnecessary, except in the event of some kind of error. Example usage: 

    $ indexer --rotate --all --quiet

  • --noprogress does not display progress details as they occur; instead, the final status details (such as documents indexed, speed of indexing and so on are only reported at completion of indexing. In instances where the script is not being run on a console (or 'tty'), this will be on by default. Example usage: 

    $ indexer --rotate --all --noprogress

  • --buildstops <outputfile.text> <N> reviews the index source, as if it were indexing the data, and produces a list of the terms that are being indexed. In other words, it produces a list of all the searchable terms that are becoming part of the index. Note; it does not update the index in question, it simply processes the data 'as if' it were indexing, including running queries defined with sql_query_pre or sql_query_post. outputfile.txt will contain the list of words, one per line, sorted by frequency with most frequent first, and N specifies the maximum number of words that will be listed; if sufficiently large to encompass every word in the index, only that many words will be returned. Such a dictionary list could be used for client application features around "Did you mean..." functionality, usually in conjunction with --buildfreqs, below. Example: 

    $ indexer myindex --buildstops word_freq.txt 1000

    This would produce a document in the current directory, word_freq.txt with the 1,000 most common words in 'myindex', ordered by most common first. Note that the file will pertain to the last index indexed when specified with multiple indexes or --all (i.e. the last one listed in the configuration file)

  • --buildfreqs works with --buildstops (and is ignored if --buildstops is not specified). As --buildstops provides the list of words used within the index, --buildfreqs adds the quantity present in the index, which would be useful in establishing whether certain words should be considered stopwords if they are too prevalent. It will also help with developing "Did you mean..." features where you can how much more common a given word compared to another, similar one. Example: 

    $ indexer myindex --buildstops word_freq.txt 1000 --buildfreqs

    This would produce the word_freq.txt as above, however after each word would be the number of times it occurred in the index in question.

  • --merge <dst-index> <src-index> is used for physically merging indexes together, for example if you have a main+delta scheme, where the main index rarely changes, but the delta index is rebuilt frequently, and --merge would be used to combine the two. The operation moves from right to left - the contents of src-index get examined and physically combined with the contents of dst-index and the result is left in dst-index. In pseudo-code, it might be expressed as: dst-index += src-index An example: 

    $ indexer --merge main delta --rotate

    In the above example, where the main is the master, rarely modified index, and delta is the less frequently modified one, you might use the above to call indexer to combine the contents of the delta into the main index and rotate the indexes.

  • --merge-dst-range <attr> <min> <max> runs the filter range given upon merging. Specifically, as the merge is applied to the destination index (as part of --merge, and is ignored if --merge is not specified), indexer will also filter the documents ending up in the destination index, and only documents will pass through the filter given will end up in the final index. This could be used for example, in an index where there is a 'deleted' attribute, where 0 means 'not deleted'. Such an index could be merged with: 

    $ indexer --merge main delta --merge-dst-range deleted 0 0

    Any documents marked as deleted (value 1) would be removed from the newly-merged destination index. It can be added several times to the command line, to add successive filters to the merge, all of which must be met in order for a document to become part of the final index.

  • --dump-rows <FILE> dumps rows fetched by SQL source(s) into the specified file, in a MySQL compatible syntax. Resulting dumps are the exact representation of data as received by indexer and help to repeat indexing-time issues.

  • --verbose guarantees that every row that caused problems indexing (duplicate, zero, or missing document ID; or file field IO issues; etc) will be reported. By default, this option is off, and problem summaries may be reported instead.

  • --sighup-each is useful when you are rebuilding many big indexes, and want each one rotated into searchd as soon as possible. With --sighup-each, indexer will send a SIGHUP signal to searchd after succesfully completing the work on each index. (The default behavior is to send a single SIGHUP after all the indexes were built.)

  • --print-queries prints out SQL queries that indexer sends to the database, along with SQL connection and disconnection events. That is useful to diagnose and fix problems with SQL sources.

6.2. searchd command reference

searchd is the second of the two principle tools as part of Sphinx. searchd is the part of the system which actually handles searches; it functions as a server and is responsible for receiving queries, processing them and returning a dataset back to the different APIs for client applications.

Unlike indexer, searchd is not designed to be run either from a regular script or command-line calling, but instead either as a daemon to be called from init.d (on Unix/Linux type systems) or to be called as a service (on Windows-type systems), so not all of the command line options will always apply, and so will be build-dependent.

Calling searchd is simply a case of:

$ searchd [OPTIONS]

The options available to searchd on all builds are:

  • --help (-h for short) lists all of the parameters that can be called in your particular build of searchd.

  • --config <file> (-c <file> for short) tells searchd to use the given file as its configuration, just as with indexer above.

  • --stop is used to asynchronously stop searchd, using the details of the PID file as specified in the sphinx.conf file, so you may also need to confirm to searchd which configuration file to use with the --config option. NB, calling --stop will also make sure any changes applied to the indexes with UpdateAttributes() will be applied to the index files themselves. Example: 

    $ searchd --config /home/myuser/sphinx.conf --stop

  • --stopwait is used to synchronously stop searchd. --stop essentially tells the running instance to exit (by sending it a SIGTERM) and then immediately returns. --stopwait will also attempt to wait until the running searchd instance actually finishes the shutdown (eg. saves all the pending attribute changes) and exits. Example: 

    $ searchd --config /home/myuser/sphinx.conf --stopwait

    Possible exit codes are as follows:

    • 0 on success;

    • 1 if connection to running searchd daemon failed;

    • 2 if daemon reported an error during shutdown;

    • 3 if daemon crashed during shutdown.

  • --status command is used to query running searchd instance status, using the connection details from the (optionally) provided configuration file. It will try to connect to the running instance using the first configured UNIX socket or TCP port. On success, it will query for a number of status and performance counter values and print them. You can use Status() API call to access the very same counters from your application. Examples: 

    $ searchd --status
$ searchd --config /home/myuser/sphinx.conf --status

  • --pidfile is used to explicitly state a PID file, where the process information is stored regarding searchd, used for inter-process communications (for example, indexer will need to know the PID to contact searchd for rotating indexes). Normally, searchd would use a PID if running in regular mode (i.e. not with --console), but it is possible that you will be running it in console mode whilst the index is being updated and rotated, for which a PID file will be needed. 

    $ searchd --config /home/myuser/sphinx.conf --pidfile /home/myuser/sphinx.pid

  • --console is used to force searchd into console mode; typically it will be running as a conventional server application, and will aim to dump information into the log files (as specified in sphinx.conf). Sometimes though, when debugging issues in the configuration or the daemon itself, or trying to diagnose hard-to-track-down problems, it may be easier to force it to dump information directly to the console/command line from which it is being called. Running in console mode also means that the process will not be forked (so searches are done in sequence) and logs will not be written to. (It should be noted that console mode is not the intended method for running searchd.) You can invoke it as such: 

    $ searchd --config /home/myuser/sphinx.conf --console

  • --logdebug enables additional debug output in the daemon log. Should only be needed rarely, to assist with debugging issues that could not be easily reproduced on request.

  • --iostats is used in conjuction with the logging options (the query_log will need to have been activated in sphinx.conf) to provide more detailed information on a per-query basis as to the input/output operations carried out in the course of that query, with a slight performance hit and of course bigger logs. Further details are available under the query log format section. You might start searchd thus: 

    $ searchd --config /home/myuser/sphinx.conf --iostats

  • --cpustats is used to provide actual CPU time report (in addition to wall time) in both query log file (for every given query) and status report (aggregated). It depends on clock_gettime() system call and might therefore be unavailable on certain systems. You might start searchd thus: 

    $ searchd --config /home/myuser/sphinx.conf --cpustats

  • --port portnumber (-p for short) is used to specify the port that searchd should listen on, usually for debugging purposes. This will usually default to 9312, but sometimes you need to run it on a different port. Specifying it on the command line will override anything specified in the configuration file. The valid range is 0 to 65535, but ports numbered 1024 and below usually require a privileged account in order to run. An example of usage: 

    $ searchd --port 9313

  • --listen ( address ":" port | port | path ) [ ":" protocol ] (or -l for short) Works as --port, but allow you to specify not only the port, but full path, as IP address and port, or Unix-domain socket path, that searchd will listen on. Otherwords, you can specify either an IP address (or hostname) and port number, or just a port number, or Unix socket path. If you specify port number but not the address, searchd will listen on all network interfaces. Unix path is identified by a leading slash. As the last param you can also specify a protocol handler (listener) to be used for connections on this socket. Supported protocol values are 'sphinx' (Sphinx 0.9.x API protocol) and 'mysql41' (MySQL protocol used since 4.1 upto at least 5.1).

  • --index <index> (or -i <index> for short) forces this instance of searchd only to serve the specified index. Like --port, above, this is usually for debugging purposes; more long-term changes would generally be applied to the configuration file itself. Example usage: 

    $ searchd --index myindex

  • --strip-path strips the path names from all the file names referenced from the index (stopwords, wordforms, exceptions, etc). This is useful for picking up indexes built on another machine with possibly different path layouts.

There are some options for searchd that are specific to Windows platforms, concerning handling as a service, are only be available on Windows binaries.

Note that on Windows searchd will default to --console mode, unless you install it as a service.

  • --install installs searchd as a service into the Microsoft Management Console (Control Panel / Administrative Tools / Services). Any other parameters specified on the command line, where --install is specified will also become part of the command line on future starts of the service. For example, as part of calling searchd, you will likely also need to specify the configuration file with --config, and you would do that as well as specifying --install. Once called, the usual start/stop facilities will become available via the management console, so any methods you could use for starting, stopping and restarting services would also apply to searchd. Example: 

    C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install
   --config C:\Sphinx\sphinx.conf

    If you wanted to have the I/O stats every time you started searchd, you would specify its option on the same line as the --install command thus: 

    C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install
   --config C:\Sphinx\sphinx.conf --iostats

  • --delete removes the service from the Microsoft Management Console and other places where services are registered, after previously installed with --install. Note, this does not uninstall the software or delete the indexes. It means the service will not be called from the services systems, and will not be started on the machine's next start. If currently running as a service, the current instance will not be terminated (until the next reboot, or searchd is called with --stop). If the service was installed with a custom name (with --servicename), the same name will need to be specified with --servicename when calling to uninstall. Example: 

    C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --delete

  • --servicename <name> applies the given name to searchd when installing or deleting the service, as would appear in the Management Console; this will default to searchd, but if being deployed on servers where multiple administrators may log into the system, or a system with multiple searchd instances, a more descriptive name may be applicable. Note that unless combined with --install or --delete, this option does not do anything. Example: 

    C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install
   --config C:\Sphinx\sphinx.conf --servicename SphinxSearch

  • --ntservice is the option that is passed by the Management Console to searchd to invoke it as a service on Windows platforms. It would not normally be necessary to call this directly; this would normally be called by Windows when the service would be started, although if you wanted to call this as a regular service from the command-line (as the complement to --console) you could do so in theory.

Last but not least, as every other daemon, searchd supports a number of signals.

SIGTERM

Initiates a clean shutdown. New queries will not be handled; but queries that are already started will not be forcibly interrupted.

SIGHUP

Initiates index rotation. Depending on the value of seamless_rotate setting, new queries might be shortly stalled; clients will receive temporary errors.

SIGUSR1

Forces reopen of searchd log and query log files, letting you implement log file rotation.

6.3. search command reference

search is one of the helper tools within the Sphinx package. Whereas searchd is responsible for searches in a server-type environment, search is aimed at testing the index from the command line, and testing the index quickly without building a framework to make the connection to the server and process its response.

Note: search is not intended to be deployed as part of a client application; it is strongly recommended you do not write an interface to search instead of searchd, and none of the bundled client APIs support this method. (In any event, search will reload files each time, whereas searchd will cache them in memory for performance.)

That said, many types of query that you could build in the APIs could also be made with search, however for very complex searches it may be easier to construct them using a small script and the corresponding API. Additionally, some newer features may be available in the searchd system that have not yet been brought into search.

The calling syntax for search is as follows:

search [OPTIONS] word1 [word2 [word3 [...]]]

When calling search, it is not necessary to have searchd running; simply make sure that the account running the search program has read access to the configuration file and the index files.

The default behaviour is to apply a search for word1 (AND word2 AND word3... as specified) to all fields in all indexes as given in the configuration file. If constructing the equivalent in the API, this would be the equivalent to passing SPH_MATCH_ALL to SetMatchMode, and specifying * as the indexes to query as part of Query.

There are many options available to search. Firstly, the general options:

  • --config <file> (-c <file> for short) tells search to use the given file as its configuration, just as with indexer above.

  • --index <index> (-i <index> for short) tells search to limit searching to the specified index only; normally it would attempt to search all of the physical indexes listed in sphinx.conf, not any distributed ones.

  • --stdin tells search to accept the query from the standard input, rather than the command line. This can be useful for testing purposes whereby you could feed input via pipes and from scripts.

Options for setting matches:

  • --any (-a for short) changes the matching mode to match any of the words as part of the query (word1 OR word2 OR word3). In the API this would be equivalent to passing SPH_MATCH_ANY to SetMatchMode.

  • --phrase (-p for short) changes the matching mode to match all of the words as part of the query, and do so in the phrase given (not including punctuation). In the API this would be equivalent to passing SPH_MATCH_PHRASE to SetMatchMode.

  • --boolean (-b for short) changes the matching mode to Boolean matching. Note if using Boolean syntax matching on the command line, you may need to escape the symbols (with a backslash) to avoid the shell/command line processor applying them, such as ampersands being escaped on a Unix/Linux system to avoid it forking to the search process, although this can be resolved by using --stdin, as below. In the API this would be equivalent to passing SPH_MATCH_BOOLEAN to SetMatchMode.

  • --ext (-e for short) changes the matching mode to Extended matching. In the API this would be equivalent to passing SPH_MATCH_EXTENDED to SetMatchMode, and it should be noted that use of this mode is being discouraged in favour of Extended2, below.

  • --ext2 (-e2 for short) changes the matching mode to Extended matching, version 2. In the API this would be equivalent to passing SPH_MATCH_EXTENDED2 to SetMatchMode, and it should be noted that use of this mode is being recommended in favour of Extended, due to being more efficient and providing other features.

  • --filter <attr> <v> (-f <attr> <v> for short) filters the results such that only documents where the attribute given (attr) matches the value given (v). For example, --filter deleted 0 only matches documents with an attribute called 'deleted' where its value is 0. You can also add multiple filters on the command line, by specifying multiple --filter multiple times, however if you apply a second filter to an attribute it will override the first defined filter.

Options for handling the results:

  • --limit <count> (-l count for short) limits the total number of matches back to the number given. If a 'group' is specified, this will be the number of grouped results. This defaults to 20 results if not specified (as do the APIs)

  • --offset <count> (-o <count> for short) offsets the result list by the number of places set by the count; this would be used for pagination through results, where if you have 20 results per 'page', the second page would begin at offset 20, the third page at offset 40, etc.

  • --group <attr> (-g <attr> for short) specifies that results should be grouped together based on the attribute specified. Like the GROUP BY clause in SQL, it will combine all results where the attribute given matches, and returns a set of results where each returned result is the best from each group. Unless otherwise specified, this will be the best match on relevance.

  • --groupsort <expr> (-gs <expr> for short) instructs that when results are grouped with --group, the expression given in <expr> shall determine the order of the groups. Note, this does not specify which is the best item within the group, only the order in which the groups themselves shall be returned.

  • --sortby <clause> (-s <clause> for short) specifies that results should be sorted in the order listed in <clause>. This allows you to specify the order you wish results to be presented in, ordering by different columns. For example, you could say --sortby "@weight DESC entrytime DESC" to sort entries first by weight (or relevance) and where two or more entries have the same weight, to then sort by the time with the highest time (newest) first. You will usually need to put the items in quotes (--sortby "@weight DESC") or use commas (--sortby @weight,DESC) to avoid the items being treated separately. Additionally, like the regular sorting modes, if --group (grouping) is being used, this will state how to establish the best match within each group.

  • --sortexpr expr (-S expr for short) specifies that the search results should be presented in an order determined by an arithmetic expression, stated in expr. For example: --sortexpr "@weight + ( user_karma + ln(pageviews) )*0.1" (again noting that this will have to be quoted to avoid the shell dealing with the asterisk). Extended sort mode is discussed in more detail under the SPH_SORT_EXTENDED entry under the Sorting modes section of the manual.

  • --sort=date specifies that the results should be sorted by descending (i.e. most recent first) date. This requires that there is an attribute in the index that is set as a timestamp.

  • --rsort=date specifies that the results should be sorted by ascending (i.e. oldest first) date. This requires that there is an attribute in the index that is set as a timestamp.

  • --sort=ts specifies that the results should be sorted by timestamp in groups; it will return all of the documents whose timestamp is within the last hour, then sorted within that bracket for relevance. After, it would return the documents from the last day, sorted by relevance, then the last week and then the last month. It is discussed in more detail under the SPH_SORT_TIME_SEGMENTS entry under the Sorting modes section of the manual.

Other options:

  • --noinfo (-q for short) instructs search not to look-up data in your SQL database. Specifically, for debugging with MySQL and search, you can provide it with a query to look up the full article based on the returned document ID. It is explained in more detail under the sql_query_info directive.

6.4. spelldump command reference

spelldump is one of the helper tools within the Sphinx package.

It is used to extract the contents of a dictionary file that uses ispell or MySpell format, which can help build word lists for wordforms - all of the possible forms are pre-built for you.

Its general usage is:

spelldump [options] <dictionary> <affix> [result] [locale-name]

The two main parameters are the dictionary's main file and its affix file; usually these are named as [language-prefix].dict and [language-prefix].aff and will be available with most common Linux distributions, as well as various places online.

[result] specifies where the dictionary data should be output to, and [locale-name] additionally specifies the locale details you wish to use.

There is an additional option, -c [file], which specifies a file for case conversion details.

Examples of its usage are:

spelldump en.dict en.aff
spelldump ru.dict ru.aff ru.txt ru_RU.CP1251
spelldump ru.dict ru.aff ru.txt .1251

The results file will contain a list of all the words in the dictionary in alphabetical order, output in the format of a wordforms file, which you can use to customise for your specific circumstances. An example of the result file:

zone > zone
zoned > zoned
zoning > zoning

6.5. indextool command reference

indextool is one of the helper tools within the Sphinx package, introduced in version 0.9.9-rc2. It is used to dump miscellaneous debug information about the physical index. (Additional functionality such as index verification is planned in the future, hence the indextool name rather than just indexdump.) Its general usage is:

indextool <command> [options]

The only currently available option applies to all commands and lets you specify the configuration file:

  • --config <file> (-c <file> for short) overrides the built-in config file names.

The commands are as follows:

  • --dumpheader FILENAME.sph quickly dumps the provided index header file without touching any other index files or even the configuration file. The report provides a breakdown of all the index settings, in particular the entire attribute and field list. Prior to 0.9.9-rc2, this command was present in CLI search utility.

  • --dumpconfig FILENAME.sph dumps the index definition from the given index header file in (almost) compliant sphinx.conf file format. Added in version 2.0.1-beta.

  • --dumpheader INDEXNAME dumps index header by index name with looking up the header path in the configuration file.

  • --dumpdocids INDEXNAME dumps document IDs by index name. It takes the data from attribute (.spa) file and therefore requires docinfo=extern to work.

  • --dumphitlist INDEXNAME KEYWORD dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as text.

  • --dumphitlist INDEXNAME --wordid ID dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as internal numeric ID.

  • --htmlstrip INDEXNAME filters stdin using HTML stripper settings for a given index, and prints the filtering results to stdout. Note that the settings will be taken from sphinx.conf, and not the index header.

  • --check INDEXNAME checks the index data files for consistency errors that might be introduced either by bugs in indexer and/or hardware faults.

  • --strip-path strips the path names from all the file names referenced from the index (stopwords, wordforms, exceptions, etc). This is useful for checking indexes built on another machine with possibly different path layouts.

Chapter 7. SphinxQL reference

Table of Contents

7.1. SELECT syntax
7.2. SHOW META syntax
7.3. SHOW WARNINGS syntax
7.4. SHOW STATUS syntax
7.5. INSERT and REPLACE syntax
7.6. DELETE syntax
7.7. SET syntax
7.8. BEGIN, COMMIT, and ROLLBACK syntax
7.9. CALL SNIPPETS syntax
7.10. CALL KEYWORDS syntax
7.11. SHOW TABLES syntax
7.12. DESCRIBE syntax
7.13. CREATE FUNCTION syntax
7.14. DROP FUNCTION syntax
7.15. SHOW VARIABLES syntax
7.16. SHOW COLLATION syntax
7.17. UPDATE syntax
7.18. Multi-statement queries
7.19. Comment syntax
7.20. List of SphinxQL reserved keywords
7.21. SphinxQL upgrade notes, version 2.0.1-beta

SphinxQL is our SQL dialect that exposes all of the search daemon functionality using a standard SQL syntax with a few Sphinx-specific extensions. Everything available via the SphinxAPI is also available SphinxQL but not vice versa; for instance, writes into RT indexes are only available via SphinxQL. This chapter documents supported SphinxQL statements syntax.

7.1. SELECT syntax

SELECT
    select_expr [, select_expr ...]
    FROM index [, index2 ...]
    [WHERE where_condition]
    [GROUP BY {col_name | expr_alias}]
    [ORDER BY {col_name | expr_alias} {ASC | DESC} [, ...]]
    [WITHIN GROUP ORDER BY {col_name | expr_alias} {ASC | DESC}]
    [LIMIT offset, row_count]
    [OPTION opt_name = opt_value [, ...]]

SELECT statement was introduced in version 0.9.9-rc2. It's syntax is based upon regular SQL but adds several Sphinx-specific extensions and has a few omissions (such as (currently) missing support for JOINs). Specifically,

  • Column list clause. Column names, arbitrary expressions, and star ('*') are all allowed (ie. SELECT @id, group_id*123+456 AS expr1 FROM test1 will work). Unlike in regular SQL, all computed expressions must be aliased with a valid identifier. Starting with version 2.0.1-beta, AS is optional. Special names such as @id and @weight should currently be used with leading at-sign. This at-sign requirement will be lifted in the future.

  • FROM clause. FROM clause should contain the list of indexes to search through. Unlike in regular SQL, comma means enumeration of full-text indexes as in Query() API call rather than JOIN.

  • WHERE clause. This clause will map both to fulltext query and filters. Comparison operators (=, !=, <, >, <=, >=), IN, AND, NOT, and BETWEEN are all supported and map directly to filters. OR is not supported yet but will be in the future. MATCH('query') is supported and maps to fulltext query. Query will be interpreted according to full-text query language rules. There must be at most one MATCH() in the clause. Starting with version 2.0.1-beta, {col_name | expr_alias} [NOT] IN @uservar condition syntax is supported. (Refer to Section 7.7, “SET syntax” for a discussion of global user variables.)

  • GROUP BY clause. Currently only supports grouping by a single column. The column however can be a computed expression: 

    SELECT *, group_id*1000+article_type AS gkey FROM example GROUP BY gkey

    Aggregate functions (AVG(), MIN(), MAX(), SUM()) in column list clause are supported. Arguments to aggregate functions can be either plain attributes or arbitrary expressions. COUNT(*) is implicitly supported as using GROUP BY will add @count column to result set. Explicit support might be added in the future. COUNT(DISTINCT attr) is supported. Currently there can be at most one COUNT(DISTINCT) per query and an argument needs to be an attribute. Both current restrictions on COUNT(DISTINCT) might be lifted in the future. 

    SELECT *, AVG(price) AS avgprice, COUNT(DISTINCT storeid)
FROM products
WHERE MATCH('ipod')
GROUP BY vendorid

    Starting with 2.0.1-beta, GROUP BY on a string attribute is supported, with respect for current collation (see Section 5.12, “Collations”).

  • WITHIN GROUP ORDER BY clause. This is a Sphinx specific extension that lets you control how the best row within a group will to be selected. The syntax matches that of regular ORDER BY clause: 

    SELECT *, INTERVAL(posted,NOW()-7*86400,NOW()-86400) AS timeseg
FROM example WHERE MATCH('my search query')
GROUP BY siteid
WITHIN GROUP ORDER BY @weight DESC
ORDER BY timeseg DESC, @weight DESC

    Starting with 2.0.1-beta, WITHIN GROUP ORDER BY on a string attribute is supported, with respect for current collation (see Section 5.12, “Collations”).

  • ORDER BY clause. Unlike in regular SQL, only column names (not expressions) are allowed and explicit ASC and DESC are required. The columns however can be computed expressions: 

    SELECT *, @weight*10+docboost AS skey FROM example ORDER BY skey

    Starting with 2.0.1-beta, ORDER BY on a string attribute is supported, with respect for current collation (see Section 5.12, “Collations”).

  • LIMIT clause. Both LIMIT N and LIMIT M,N forms are supported. Unlike in regular SQL (but like in Sphinx API), an implicit LIMIT 0,20 is present by default.

  • OPTION clause. This is a Sphinx specific extension that lets you control a number of per-query options. The syntax is: 

    OPTION <optionname>=<value> [ , ... ]

    Supported options and respectively allowed values are:

    • 'ranker' - any of 'proximity_bm25', 'bm25', 'none', 'wordcount', 'proximity', 'matchany', or 'fieldmask'

    • 'max_matches' - integer (per-query max matches value)

    • 'cutoff' - integer (max found matches threshold)

    • 'max_query_time' - integer (max search time threshold, msec)

    • 'retry_count' - integer (distributed retries count)

    • 'retry_delay' - integer (distributed retry delay, msec)

    • 'field_weights' - a named integer list (per-field user weights for ranking)

    • 'index_weights' - a named integer list (per-index user weights for ranking)

    • 'reverse_scan' - 0 or 1, lets you control the order in which full-scan query processes the rows

    Example: 

    SELECT * FROM test WHERE MATCH('@title hello @body world')
OPTION ranker=bm25, max_matches=3000,
    field_weights=(title=10, body=3)

7.2. SHOW META syntax

SHOW META

SHOW META shows additional meta-information about the latest query such as query time and keyword statistics: 

mysql> SELECT * FROM test1 WHERE MATCH('test|one|two');
+------+--------+----------+------------+
| id   | weight | group_id | date_added |
+------+--------+----------+------------+
|    1 |   3563 |      456 | 1231721236 |
|    2 |   2563 |      123 | 1231721236 |
|    4 |   1480 |        2 | 1231721236 |
+------+--------+----------+------------+
3 rows in set (0.01 sec)

mysql> SHOW META;
+---------------+-------+
| Variable_name | Value |
+---------------+-------+
| total         | 3     |
| total_found   | 3     |
| time          | 0.005 |
| keyword[0]    | test  |
| docs[0]       | 3     |
| hits[0]       | 5     |
| keyword[1]    | one   |
| docs[1]       | 1     |
| hits[1]       | 2     |
| keyword[2]    | two   |
| docs[2]       | 1     |
| hits[2]       | 2     |
+---------------+-------+
12 rows in set (0.00 sec)

7.3. SHOW WARNINGS syntax

SHOW WARNINGS

SHOW WARNINGS statement, introduced in version 0.9.9-rc2, can be used to retrieve the warning produced by the latest query. The error message will be returned along with the query itself: 

mysql> SELECT * FROM test1 WHERE MATCH('@@title hello') \G
ERROR 1064 (42000): index test1: syntax error, unexpected TOK_FIELDLIMIT
near '@title hello'

mysql> SELECT * FROM test1 WHERE MATCH('@title -hello') \G
ERROR 1064 (42000): index test1: query is non-computable (single NOT operator)

mysql> SELECT * FROM test1 WHERE MATCH('"test doc"/3') \G
*************************** 1. row ***************************
        id: 4
    weight: 2500
  group_id: 2
date_added: 1231721236
1 row in set, 1 warning (0.00 sec)

mysql> SHOW WARNINGS \G
*************************** 1. row ***************************
  Level: warning
   Code: 1000
Message: quorum threshold too high (words=2, thresh=3); replacing quorum operator
         with AND operator
1 row in set (0.00 sec)

7.4. SHOW STATUS syntax

SHOW STATUS, introduced in version 0.9.9-rc2, displays a number of useful performance counters. IO and CPU counters will only be available if searchd was started with --iostats and --cpustats switches respectively. 

mysql> SHOW STATUS;
+--------------------+-------+
| Variable_name      | Value |
+--------------------+-------+
| uptime             | 216   |
| connections        | 3     |
| maxed_out          | 0     |
| command_search     | 0     |
| command_excerpt    | 0     |
| command_update     | 0     |
| command_keywords   | 0     |
| command_persist    | 0     |
| command_status     | 0     |
| agent_connect      | 0     |
| agent_retry        | 0     |
| queries            | 10    |
| dist_queries       | 0     |
| query_wall         | 0.075 |
| query_cpu          | OFF   |
| dist_wall          | 0.000 |
| dist_local         | 0.000 |
| dist_wait          | 0.000 |
| query_reads        | OFF   |
| query_readkb       | OFF   |
| query_readtime     | OFF   |
| avg_query_wall     | 0.007 |
| avg_query_cpu      | OFF   |
| avg_dist_wall      | 0.000 |
| avg_dist_local     | 0.000 |
| avg_dist_wait      | 0.000 |
| avg_query_reads    | OFF   |
| avg_query_readkb   | OFF   |
| avg_query_readtime | OFF   |
+--------------------+-------+
29 rows in set (0.00 sec)

7.5. INSERT and REPLACE syntax

{INSERT | REPLACE} INTO index [(column, ...)]
	VALUES (value, ...)
	[, (...)]

INSERT statement, introduced in version 1.10-beta, is only supported for RT indexes. It inserts new rows (documents) into an existing index, with the provided column values.

ID column must be present in all cases. Rows with duplicate IDs will not be overwritten by INSERT; use REPLACE to do that.

index is the name of RT index into which the new row(s) should be inserted. The optional column names list lets you only explicitly specify values for some of the columns present in the index. All the other columns will be filled with their default values (0 for scalar types, empty string for text types).

Expressions are not currently supported in INSERT and values should be explicitly specified.

Multiple rows can be inserted using a single INSERT statement by providing several comma-separated, parens-enclosed lists of rows values.

7.6. DELETE syntax

DELETE FROM index WHERE {id = value | id IN (val1 [, val2 [, ...]])}

DELETE statement, introduced in version 1.10-beta, is only supported for RT indexes. It deletes existing rows (documents) from an existing index based on ID.

index is the name of RT index from which the row should be deleted. value is the row ID to be deleted. Support for batch id IN (2,3,5) syntax was added in version 2.0.1-beta.

Additional types of WHERE conditions (such as conditions on attributes, etc) are planned, but not supported yet as of 1.10-beta.

7.7. SET syntax

SET [GLOBAL] server_variable_name = value
SET GLOBAL @user_variable_name = (int_val1 [, int_val2, ...])

SET statement, introduced in version 1.10-beta, modifies a server variable value. The variable names are case-insensitive. No variable value changes survive server restart. There are the following classes of the variables:

  1. per-session server variable (1.10-beta and above)

  2. global server variable (2.0.1-beta and above)

  3. global user variable (2.0.1-beta and above)

Global user variables are shared between concurrent sessions. Currently, the only supported value type is the list of BIGINTs, and these variables can only be used along with IN() for filtering purpose. The intended usage scenario is uploading huge lists of values to searchd (once) and reusing them (many times) later, saving on network overheads. Example: 

// in session 1
mysql> SET GLOBAL @myfilter=(2,3,5,7,11,13);
Query OK, 0 rows affected (0.00 sec)

// later in session 2
mysql> SELECT * FROM test1 WHERE group_id IN @myfilter;
+------+--------+----------+------------+-----------------+------+
| id   | weight | group_id | date_added | title           | tag  |
+------+--------+----------+------------+-----------------+------+
|    3 |      1 |        2 | 1299338153 | another doc     | 15   |
|    4 |      1 |        2 | 1299338153 | doc number four | 7,40 |
+------+--------+----------+------------+-----------------+------+
2 rows in set (0.02 sec)

Per-session and global server variables affect certain server settings in the respective scope. Known per-session server variables are:

AUTOCOMMIT = {0 | 1}

Whether any data modification statement should be implicitly wrapped by BEGIN and COMMIT. Introduced in version 1.10-beta.

COLLATION_CONNECTION = collation_name

Selects the collation to be used for ORDER BY or GROUP BY on string values in the subsequent queries. Refer to Section 5.12, “Collations” for a list of known collation names. Introduced in version 2.0.1-beta.

CHARACTER_SET_RESULTS = charset_name

Does nothing; a placeholder to support frameworks, clients, and connectors that attempt to automatically enforce a charset when connecting to a Sphinx server. Introduced in version 2.0.1-beta.

Known global server variables are:

QUERY_LOG_FORMAT = {plain | sphinxql}

Changes the current log format. Introduced in version 2.0.1-beta.

LOG_LEVEL = {info | debug | debugv | debugvv}

Changes the current log verboseness level. Introduced in version 2.0.1-beta.

Examples: 

mysql> SET autocommit=0;
Query OK, 0 rows affected (0.00 sec)

mysql> SET GLOBAL query_log_format=sphinxql;
Query OK, 0 rows affected (0.00 sec)

7.8. BEGIN, COMMIT, and ROLLBACK syntax

START TRANSACTION | BEGIN
COMMIT
ROLLBACK
SET AUTOCOMMIT = {0 | 1}

BEGIN, COMMIT, and ROLLBACK statements were introduced in version 1.10-beta. BEGIN statement (or its START TRANSACTION alias) forcibly commits pending transaction, if any, and begins a new one. COMMIT statement commits the current transaction, making all its changes permanent. ROLLBACK statement rolls back the current transaction, canceling all its changes. SET AUTOCOMMIT controls the autocommit mode in the active session.

AUTOCOMMIT is set to 1 by default, meaning that every statement that perfoms any changes on any index is implicitly wrapped in BEGIN and COMMIT.

Transactions are limited to a single RT index, and also limited in size. They are atomic, consistent, overly isolated, and durable. Overly isolated means that the changes are not only invisible to the concurrent transactions but even to the current session itself.

7.9. CALL SNIPPETS syntax

CALL SNIPPETS(data, index, query[, opt_value AS opt_name[, ...]])

CALL SNIPPETS statement, introduced in version 1.10-beta, builds a snippet from provided data and query, using specified index settings.

data is the source data string to extract a snippet from. index is the name of the index from which to take the text processing settings. query is the full-text query to build snippets for. Additional options are documented in Section 8.7.1, “BuildExcerpts”. Usage example:

CALL SNIPPETS('this is my document text', 'test1', 'hello world',
    5 AS around, 200 AS limit)

7.10. CALL KEYWORDS syntax

CALL KEYWORDS(text, index, [hits])

CALL KEYWORDS statement, introduced in version 1.10-beta, splits text into particular keywords. It returns tokenized and normalized forms of the keywords, and, optionally, keyword statistics.

text is the text to break down to keywords. index is the name of the index from which to take the text processing settings. hits is an optional boolean parameter that specifies whether to return document and hit occurrence statistics.

7.11. SHOW TABLES syntax

SHOW TABLES

SHOW TABLES statement, introduced in version 2.0.1-beta, enumerates all currently active indexes along with their types. As of 2.0.1-beta, existing index types are local, distributed, and rt respectively. Example: 

mysql> SHOW TABLES;
+-------+-------------+
| Index | Type        |
+-------+-------------+
| dist1 | distributed |
| rt    | rt          |
| test1 | local       |
| test2 | local       |
+-------+-------------+
4 rows in set (0.00 sec)

7.12. DESCRIBE syntax

{DESC | DESCRIBE} index

DESCRIBE statement, introduced in version 2.0.1-beta, lists index columns and their associated types. Columns are document ID, full-text fields, and attributes. The order matches that in which fields and attributes are expected by INSERT and REPLACE statements. As of 2.0.1-beta, column types are field, integer, timestamp, ordinal, bool, float, bigint, string, and mva. ID column will be typed either integer or bigint based on whether the binaries were built with 32-bit or 64-bit document ID support. Example:

mysql> DESC rt;
+---------+---------+
| Field   | Type    |
+---------+---------+
| id      | integer |
| title   | field   |
| content | field   |
| gid     | integer |
+---------+---------+
4 rows in set (0.00 sec)

7.13. CREATE FUNCTION syntax

CREATE FUNCTION udf_name
	RETURNS {INT | BIGINT | FLOAT}
	SONAME 'udf_lib_file'

CREATE FUNCTION statement, introduced in version 2.0.1-beta, installs a user-defined function (UDF) with the given name and type from the given library file. The library file must reside in a trusted plugin_dir directory. On success, the function is available for use in all subsequent queries that the server receives. Example:

mysql> CREATE FUNCTION avgmva RETURNS INT SONAME 'udfexample.dll';
Query OK, 0 rows affected (0.03 sec)

mysql> SELECT *, AVGMVA(tag) AS q from test1;
+------+--------+---------+-----------+
| id   | weight | tag     | q         |
+------+--------+---------+-----------+
|    1 |      1 | 1,3,5,7 | 4.000000  |
|    2 |      1 | 2,4,6   | 4.000000  |
|    3 |      1 | 15      | 15.000000 |
|    4 |      1 | 7,40    | 23.500000 |
+------+--------+---------+-----------+

7.14. DROP FUNCTION syntax

DROP FUNCTION udf_name

DROP FUNCTION statement, introduced in version 2.0.1-beta, deinstalls a user-defined function (UDF) with the given name. On success, the function is no longer available for use in subsequent queries. Pending concurrent queries will not be affected and the library unload, if necessary, will be postponed until those queries complete. Example:

mysql> DROP FUNCTION avgmva;
Query OK, 0 rows affected (0.00 sec)

7.15. SHOW VARIABLES syntax

SHOW VARIABLES

Added in version 2.0.1-beta, this is currently a placeholder query that does nothing and reports success. That is in order to keep compatibility with frameworks and connectors that automatically execute this statement.

mysql> SHOW VARIABLES;
Query OK, 0 rows affected (0.00 sec)

7.16. SHOW COLLATION syntax

SHOW COLLATION

Added in version 2.0.1-beta, this is currently a placeholder query that does nothing and reports success. That is in order to keep compatibility with frameworks and connectors that automatically execute this statement.

mysql> SHOW COLLATION;
Query OK, 0 rows affected (0.00 sec)

7.17. UPDATE syntax

UPDATE index SET col1 = newval1 [, ...] WHERE ID = docid

UPDATE statement was added in version 2.0.1-beta. It can currently update 32-bit integer attributes only. Multiple attributes and values can be specified. Both RT and disk indexes are supported. Updates on other attribute types are also planned.

mysql> UPDATE myindex SET enabled=0 WHERE id=123;
Query OK, 1 rows affected (0.00 sec)

7.18. Multi-statement queries

Starting version 2.0.1-beta, SphinxQL supports multi-statement queries, or batches. Possible inter-statement optimizations described in Section 5.11, “Multi-queries” do apply to SphinxQL just as well. The batched queries should be separated by a semicolon. Your MySQL client library needs to support MySQL multi-query mechanism and multiple result set. For instance, mysqli interface in PHP and DBI/DBD libraries in Perl are known to work.

Here's a PHP sample showing how to utilize mysqli interface with Sphinx. 

<?php

$link = mysqli_connect ( "127.0.0.1", "root", "", "", 9306 );
if ( mysqli_connect_errno() )
    die ( "connect failed: " . mysqli_connect_error() );

$batch = "SELECT * FROM test1 ORDER BY group_id ASC;";
$batch .= "SELECT * FROM test1 ORDER BY group_id DESC";

if ( !mysqli_multi_query ( $link, $batch ) )
    die ( "query failed" );

do
{
    // fetch and print result set
    if ( $result = mysqli_store_result($link) )
    {
        while ( $row = mysqli_fetch_row($result) )
            printf ( "id=%s\n", $row[0] );
        mysqli_free_result($result);
    }

    // print divider
    if ( mysqli_more_results($link) )
        printf ( "------\n" );

} while ( mysqli_next_result($link) );

Its output with the sample test1 index included with Sphinx is as follows. 

$ php test_multi.php
id=1
id=2
id=3
id=4
------
id=3
id=4
id=1
id=2

The following statements can currently be used in a batch: SELECT, SHOW WARNINGS, SHOW STATUS, and SHOW META. Arbitrary sequence of these statements are allowed. The results sets returned should match those that would be returned if the batched queries were sent one by one.

7.19. Comment syntax

Since version 2.0.1-beta, SphinxQL supports C-style comment syntax. Everything from an opening /* sequence to a closing */ sequence is ignored. Comments can span multiple lines, can not nest, and should not get logged. MySQL specific /*! ... */ comments are also currently ignored. (As the comments support was rather added for better compatibility with mysqldump produced dumps, rather than improving generaly query interoperability between Sphinx and MySQL.) 

SELECT /*! SQL_CALC_FOUND_ROWS */ col1 FROM table1 WHERE ...

7.20. List of SphinxQL reserved keywords

A complete alphabetical list of keywords that are currently reserved in SphinxQL syntax (and therefore can not be used as identifiers). 

AND
AS
ASC
AVG
BEGIN
BETWEEN
BY
CALL
COLLATION
COMMIT
COUNT
DELETE
DESC
DESCRIBE
DISTINCT
FALSE
FROM
GLOBAL
GROUP
ID
IN
INSERT
INTO
LIMIT
MATCH
MAX
META
MIN
NOT
NULL
OPTION
OR
ORDER
REPLACE
ROLLBACK
SELECT
SET
SHOW
START
STATUS
SUM
TABLES
TRANSACTION
TRUE
UPDATE
VALUES
VARIABLES
WARNINGS
WEIGHT
WHERE
WITHIN

7.21. SphinxQL upgrade notes, version 2.0.1-beta

This section only applies to existing applications that use SphinxQL versions prior to 2.0.1-beta.

In previous versions, SphinxQL just wrapped around SphinxAPI and inherited its magic columns and column set quirks. Essentially, SphinxQL queries could return (slightly) different columns and in a (slightly) different order than it was explicitly requested in the query. Namely, weight magic column (which is not a real column in any index) was added at all times, and GROUP BY related @count, @group, and @distinct magic columns were conditionally added when grouping. Also, the order of columns (attributes) in the result set was actually taken from the index rather than the query. (So if you asked for columns C, B, A in your query but they were in the A, B, C order in the index, they would have been returned in the A, B, C order.)

In version 2.0.1-beta, we fixed that. SphinxQL is now more SQL compliant (and will be further brought in as much compliance with standard SQL syntax as possible). That is not yet a breaking change, because searchd now supports compat_sphinxql_magics directive that flips between the old "compatibility" mode and the new "compliance" mode. However, the compatibility mode support is going to be removed in future, so it's strongly advised to update SphinxQL applications and switch to the compliance mode.

The important changes are as follows:

  • @ID magic name is deprecated in favor of ID. Document ID is considered an attribute.

  • WEIGHT is no longer implicitly returned, because it is not actually a column (an index attribute), but rather an internal function computed per each row (a match). You have to explicitly ask for it, using the WEIGHT() function. (The requirement to alias the result will be lifted in the next release.) 

    SELECT id, WEIGHT() w FROM myindex WHERE MATCH('test')

  • You can now use quoted reserved keywords as aliases. The quote character is backtick ("`", ASCII code 96 decimal, 60 hex). One particularly useful example would be returning weight column like the old mode: 

    SELECT id, WEIGHT() `weight` FROM myindex WHERE MATCH('test')

  • The column order is now different and should now match the one expliclitly defined in the query. So if you are accessing columns based on their position in the result set rather than the name (for instance, by using mysql_fetch_row() rather than mysql_fetch_assoc() in PHP), check and fix the order of columns in your queries.

  • SELECT * return the columns in index order, as it used to, including the ID column. However, SELECT * does not automatically return WEIGHT(). To update such queries in case you access columns by names, simply add it to the query: 

    SELECT *, WEIGHT() `weight` FROM myindex WHERE MATCH('test')

    Otherwise, i.e., in case you rely on column order, select ID, weight, and then other columns: 

    SELECT id, *, WEIGHT() `weight` FROM myindex WHERE MATCH('test')

  • Magic @count and @distinct attributes are no longer implicitly returned. You now have to explicitly ask for them when using GROUP BY. (Also note that you currently have to alias them; that requirement will be lifted in the future.) 

    SELECT gid, COUNT(*) q FROM myindex WHERE MATCH('test')
GROUP BY gid ORDER BY q DESC

Chapter 8. API reference

Table of Contents

8.1. General API functions
8.1.1. GetLastError
8.1.2. GetLastWarning
8.1.3. SetServer
8.1.4. SetRetries
8.1.5. SetConnectTimeout
8.1.6. SetArrayResult
8.1.7. IsConnectError
8.2. General query settings
8.2.1. SetLimits
8.2.2. SetMaxQueryTime
8.2.3. SetOverride
8.2.4. SetSelect
8.3. Full-text search query settings
8.3.1. SetMatchMode
8.3.2. SetRankingMode
8.3.3. SetSortMode
8.3.4. SetWeights
8.3.5. SetFieldWeights
8.3.6. SetIndexWeights
8.4. Result set filtering settings
8.4.1. SetIDRange
8.4.2. SetFilter
8.4.3. SetFilterRange
8.4.4. SetFilterFloatRange
8.4.5. SetGeoAnchor
8.5. GROUP BY settings
8.5.1. SetGroupBy
8.5.2. SetGroupDistinct
8.6. Querying
8.6.1. Query
8.6.2. AddQuery
8.6.3. RunQueries
8.6.4. ResetFilters
8.6.5. ResetGroupBy
8.7. Additional functionality
8.7.1. BuildExcerpts
8.7.2. UpdateAttributes
8.7.3. BuildKeywords
8.7.4. EscapeString
8.7.5. Status
8.7.6. FlushAttributes
8.8. Persistent connections
8.8.1. Open
8.8.2. Close

There is a number of native searchd client API implementations for Sphinx. As of time of this writing, we officially support our own PHP, Python, and Java implementations. There also are third party free, open-source API implementations for Perl, Ruby, and C++.

The reference API implementation is in PHP, because (we believe) Sphinx is most widely used with PHP than any other language. This reference documentation is in turn based on reference PHP API, and all code samples in this section will be given in PHP.

However, all other APIs provide the same methods and implement the very same network protocol. Therefore the documentation does apply to them as well. There might be minor differences as to the method naming conventions or specific data structures used. But the provided functionality must not differ across languages.

8.1. General API functions

8.1.1. GetLastError

Prototype: function GetLastError()

Returns last error message, as a string, in human readable format. If there were no errors during the previous API call, empty string is returned.

You should call it when any other function (such as Query()) fails (typically, the failing function returns false). The returned string will contain the error description.

The error message is not reset by this call; so you can safely call it several times if needed.

8.1.2. GetLastWarning

Prototype: function GetLastWarning ()

Returns last warning message, as a string, in human readable format. If there were no warnings during the previous API call, empty string is returned.

You should call it to verify whether your request (such as Query()) was completed but with warnings. For instance, search query against a distributed index might complete succesfully even if several remote agents timed out. In that case, a warning message would be produced.

The warning message is not reset by this call; so you can safely call it several times if needed.

8.1.3. SetServer

Prototype: function SetServer ( $host, $port )

Sets searchd host name and TCP port. All subsequent requests will use the new host and port settings. Default host and port are 'localhost' and 9312, respectively.

8.1.4. SetRetries

Prototype: function SetRetries ( $count, $delay=0 )

Sets distributed retry count and delay.

On temporary failures searchd will attempt up to $count retries per agent. $delay is the delay between the retries, in milliseconds. Retries are disabled by default. Note that this call will not make the API itself retry on temporary failure; it only tells searchd to do so. Currently, the list of temporary failures includes all kinds of connect() failures and maxed out (too busy) remote agents.

8.1.5. SetConnectTimeout

Prototype: function SetConnectTimeout ( $timeout )

Sets the time allowed to spend connecting to the server before giving up.

Under some circumstances, the server can be delayed in responding, either due to network delays, or a query backlog. In either instance, this allows the client application programmer some degree of control over how their program interacts with searchd when not available, and can ensure that the client application does not fail due to exceeding the script execution limits (especially in PHP).

In the event of a failure to connect, an appropriate error code should be returned back to the application in order for application-level error handling to advise the user.

8.1.6. SetArrayResult

Prototype: function SetArrayResult ( $arrayresult )

PHP specific. Controls matches format in the search results set (whether matches should be returned as an array or a hash).

$arrayresult argument must be boolean. If $arrayresult is false (the default mode), matches will returned in PHP hash format with document IDs as keys, and other information (weight, attributes) as values. If $arrayresult is true, matches will be returned as a plain array with complete per-match information including document ID.

Introduced along with GROUP BY support on MVA attributes. Group-by-MVA result sets may contain duplicate document IDs. Thus they need to be returned as plain arrays, because hashes will only keep one entry per document ID.

8.1.7. IsConnectError

Prototype: function IsConnectError ()

Checks whether the last error was a network error on API side, or a remote error reported by searchd. Returns true if the last connection attempt to searchd failed on API side, false otherwise (if the error was remote, or there were no connection attempts at all). Introduced in version 0.9.9-rc1.

8.2. General query settings

8.2.1. SetLimits

Prototype: function SetLimits ( $offset, $limit, $max_matches=0, $cutoff=0 )

Sets offset into server-side result set ($offset) and amount of matches to return to client starting from that offset ($limit). Can additionally control maximum server-side result set size for current query ($max_matches) and the threshold amount of matches to stop searching at ($cutoff). All parameters must be non-negative integers.

First two parameters to SetLimits() are identical in behavior to MySQL LIMIT clause. They instruct searchd to return at most $limit matches starting from match number $offset. The default offset and limit settings are 0 and 20, that is, to return first 20 matches.

max_matches setting controls how much matches searchd will keep in RAM while searching. All matching documents will be normally processed, ranked, filtered, and sorted even if max_matches is set to 1. But only best N documents are stored in memory at any given moment for performance and RAM usage reasons, and this setting controls that N. Note that there are two places where max_matches limit is enforced. Per-query limit is controlled by this API call, but there also is per-server limit controlled by max_matches setting in the config file. To prevent RAM usage abuse, server will not allow to set per-query limit higher than the per-server limit.

You can't retrieve more than max_matches matches to the client application. The default limit is set to 1000. Normally, you must not have to go over this limit. One thousand records is enough to present to the end user. And if you're thinking about pulling the results to application for further sorting or filtering, that would be much more efficient if performed on Sphinx side.

$cutoff setting is intended for advanced performance control. It tells searchd to forcibly stop search query once $cutoff matches had been found and processed.

8.2.2. SetMaxQueryTime

Prototype: function SetMaxQueryTime ( $max_query_time )

Sets maximum search query time, in milliseconds. Parameter must be a non-negative integer. Default valus is 0 which means "do not limit".

Similar to $cutoff setting from SetLimits(), but limits elapsed query time instead of processed matches count. Local search queries will be stopped once that much time has elapsed. Note that if you're performing a search which queries several local indexes, this limit applies to each index separately.

8.2.3. SetOverride

Prototype: function SetOverride ( $attrname, $attrtype, $values )

Sets temporary (per-query) per-document attribute value overrides. Only supports scalar attributes. $values must be a hash that maps document IDs to overridden attribute values. Introduced in version 0.9.9-rc1.

Override feature lets you "temporary" update attribute values for some documents within a single query, leaving all other queries unaffected. This might be useful for personalized data. For example, assume you're implementing a personalized search function that wants to boost the posts that the user's friends recommend. Such data is not just dynamic, but also personal; so you can't simply put it in the index because you don't want everyone's searches affected. Overrides, on the other hand, are local to a single query and invisible to everyone else. So you can, say, setup a "friends_weight" value for every document, defaulting to 0, then temporary override it with 1 for documents 123, 456 and 789 (recommended by exactly the friends of current user), and use that value when ranking.

8.2.4. SetSelect

Prototype: function SetSelect ( $clause )

Sets the select clause, listing specific attributes to fetch, and expressions to compute and fetch. Clause syntax mimics SQL. Introduced in version 0.9.9-rc1.

SetSelect() is very similar to the part of a typical SQL query between SELECT and FROM. It lets you choose what attributes (columns) to fetch, and also what expressions over the columns to compute and fetch. A certain difference from SQL is that expressions must always be aliased to a correct identifier (consisting of letters and digits) using 'AS' keyword. SQL also lets you do that but does not require to. Sphinx enforces aliases so that the computation results can always be returned under a "normal" name in the result set, used in other clauses, etc.

Everything else is basically identical to SQL. Star ('*') is supported. Functions are supported. Arbitrary amount of expressions is supported. Computed expressions can be used for sorting, filtering, and grouping, just as the regular attributes.

Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported when using GROUP BY.

Expression sorting (Section 5.6, “SPH_SORT_EXPR mode”) and geodistance functions (Section 8.4.5, “SetGeoAnchor”) are now internally implemented using this computed expressions mechanism, using magic names '@expr' and '@geodist' respectively.

Example:

$cl->SetSelect ( "*, @weight+(user_karma+ln(pageviews))*0.1 AS myweight" );
$cl->SetSelect ( "exp_years, salary_gbp*{$gbp_usd_rate} AS salary_usd,
   IF(age>40,1,0) AS over40" );
$cl->SetSelect ( "*, AVG(price) AS avgprice" );

8.3. Full-text search query settings

8.3.1. SetMatchMode

Prototype: function SetMatchMode ( $mode )

Sets full-text query matching mode, as described in Section 5.1, “Matching modes”. Parameter must be a constant specifying one of the known modes.

WARNING: (PHP specific) you must not take the matching mode constant name in quotes, that syntax specifies a string and is incorrect: 

$cl->SetMatchMode ( "SPH_MATCH_ANY" ); // INCORRECT! will not work as expected
$cl->SetMatchMode ( SPH_MATCH_ANY ); // correct, works OK

8.3.2. SetRankingMode

Prototype: function SetRankingMode ( $ranker )

Sets ranking mode. Only available in SPH_MATCH_EXTENDED2 matching mode at the time of this writing. Parameter must be a constant specifying one of the known modes.

By default, Sphinx computes two factors which contribute to the final match weight. The major part is query phrase proximity to document text. The minor part is so-called BM25 statistical function, which varies from 0 to 1 depending on the keyword frequency within document (more occurrences yield higher weight) and within the whole index (more rare keywords yield higher weight).

However, in some cases you'd want to compute weight differently - or maybe avoid computing it at all for performance reasons because you're sorting the result set by something else anyway. This can be accomplished by setting the appropriate ranking mode.

Currently implemented modes are:

  • SPH_RANK_PROXIMITY_BM25, default ranking mode which uses and combines both phrase proximity and BM25 ranking.

  • SPH_RANK_BM25, statistical ranking mode which uses BM25 ranking only (similar to most other full-text engines). This mode is faster but may result in worse quality on queries which contain more than 1 keyword.

  • SPH_RANK_NONE, disabled ranking mode. This mode is the fastest. It is essentially equivalent to boolean searching. A weight of 1 is assigned to all matches.

  • SPH_RANK_WORDCOUNT, ranking by keyword occurrences count. This ranker computes the amount of per-field keyword occurrences, then multiplies the amounts by field weights, then sums the resulting values for the final result.

  • SPH_RANK_PROXIMITY, added in version 0.9.9-rc1, returns raw phrase proximity value as a result. This mode is internally used to emulate SPH_MATCH_ALL queries.

  • SPH_RANK_MATCHANY, added in version 0.9.9-rc1, returns rank as it was computed in SPH_MATCH_ANY mode ealier, and is internally used to emulate SPH_MATCH_ANY queries.

  • SPH_RANK_FIELDMASK, added in version 0.9.9-rc2, returns a 32-bit mask with N-th bit corresponding to N-th fulltext field, numbering from 0. The bit will only be set when the respective field has any keyword occurences satisfiying the query.

  • SPH_RANK_SPH04, added in version 1.10-beta, is generally based on the default SPH_RANK_PROXIMITY_BM25 ranker, but additionally boosts the matches when they occur in the very beginning or the very end of a text field. Thus, if a field equals the exact query, SPH04 should rank it higher than a field that contains the exact query but is not equal to it. (For instance, when the query is "Hyde Park", a document entitled "Hyde Park" should be ranked higher than a one entitled "Hyde Park, London" or "The Hyde Park Cafe".)

8.3.3. SetSortMode

Prototype: function SetSortMode ( $mode, $sortby="" )

Set matches sorting mode, as described in Section 5.6, “Sorting modes”. Parameter must be a constant specifying one of the known modes.

WARNING: (PHP specific) you must not take the matching mode constant name in quotes, that syntax specifies a string and is incorrect: 

$cl->SetSortMode ( "SPH_SORT_ATTR_DESC" ); // INCORRECT! will not work as expected
$cl->SetSortMode ( SPH_SORT_ATTR_ASC ); // correct, works OK

8.3.4. SetWeights

Prototype: function SetWeights ( $weights )

Binds per-field weights in the order of appearance in the index. DEPRECATED, use SetFieldWeights() instead.

8.3.5. SetFieldWeights

Prototype: function SetFieldWeights ( $weights )

Binds per-field weights by name. Parameter must be a hash (associative array) mapping string field names to integer weights.

Match ranking can be affected by per-field weights. For instance, see Section 5.4, “Weighting” for an explanation how phrase proximity ranking is affected. This call lets you specify what non-default weights to assign to different full-text fields.

The weights must be positive 32-bit integers. The final weight will be a 32-bit integer too. Default weight value is 1. Unknown field names will be silently ignored.

There is no enforced limit on the maximum weight value at the moment. However, beware that if you set it too high you can start hitting 32-bit wraparound issues. For instance, if you set a weight of 10,000,000 and search in extended mode, then maximum possible weight will be equal to 10 million (your weight) by 1 thousand (internal BM25 scaling factor, see Section 5.4, “Weighting”) by 1 or more (phrase proximity rank). The result is at least 10 billion that does not fit in 32 bits and will be wrapped around, producing unexpected results.

8.3.6. SetIndexWeights

Prototype: function SetIndexWeights ( $weights )

Sets per-index weights, and enables weighted summing of match weights across different indexes. Parameter must be a hash (associative array) mapping string index names to integer weights. Default is empty array that means to disable weighting summing.

When a match with the same document ID is found in several different local indexes, by default Sphinx simply chooses the match from the index specified last in the query. This is to support searching through partially overlapping index partitions.

However in some cases the indexes are not just partitions, and you might want to sum the weights across the indexes instead of picking one. SetIndexWeights() lets you do that. With summing enabled, final match weight in result set will be computed as a sum of match weight coming from the given index multiplied by respective per-index weight specified in this call. Ie. if the document 123 is found in index A with the weight of 2, and also in index B with the weight of 3, and you called SetIndexWeights ( array ( "A"=>100, "B"=>10 ) ), the final weight return to the client will be 2*100+3*10 = 230.

8.4. Result set filtering settings

8.4.1. SetIDRange

Prototype: function SetIDRange ( $min, $max )

Sets an accepted range of document IDs. Parameters must be integers. Defaults are 0 and 0; that combination means to not limit by range.

After this call, only those records that have document ID between $min and $max (including IDs exactly equal to $min or $max) will be matched.

8.4.2. SetFilter

Prototype: function SetFilter ( $attribute, $values, $exclude=false )

Adds new integer values set filter.

On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $values must be a plain array containing integer values. $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them.

Only those documents where $attribute column value stored in the index matches any of the values from $values array will be matched (or rejected, if $exclude is true).

8.4.3. SetFilterRange

Prototype: function SetFilterRange ( $attribute, $min, $max, $exclude=false )

Adds new integer range filter.

On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $min and $max must be integers that define the acceptable attribute values range (including the boundaries). $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them.

Only those documents where $attribute column value stored in the index is between $min and $max (including values that are exactly equal to $min or $max) will be matched (or rejected, if $exclude is true).

8.4.4. SetFilterFloatRange

Prototype: function SetFilterFloatRange ( $attribute, $min, $max, $exclude=false )

Adds new float range filter.

On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $min and $max must be floats that define the acceptable attribute values range (including the boundaries). $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them.

Only those documents where $attribute column value stored in the index is between $min and $max (including values that are exactly equal to $min or $max) will be matched (or rejected, if $exclude is true).

8.4.5. SetGeoAnchor

Prototype: function SetGeoAnchor ( $attrlat, $attrlong, $lat, $long )

Sets anchor point for and geosphere distance (geodistance) calculations, and enable them.

$attrlat and $attrlong must be strings that contain the names of latitude and longitude attributes, respectively. $lat and $long are floats that specify anchor point latitude and longitude, in radians.

Once an anchor point is set, you can use magic "@geodist" attribute name in your filters and/or sorting expressions. Sphinx will compute geosphere distance between the given anchor point and a point specified by latitude and lognitude attributes from each full-text match, and attach this value to the resulting match. The latitude and longitude values both in SetGeoAnchor and the index attribute data are expected to be in radians. The result will be returned in meters, so geodistance value of 1000.0 means 1 km. 1 mile is approximately 1609.344 meters.

8.5. GROUP BY settings

8.5.1. SetGroupBy

Prototype: function SetGroupBy ( $attribute, $func, $groupsort="@group desc" )

Sets grouping attribute, function, and groups sorting mode; and enables grouping (as described in Section 5.7, “Grouping (clustering) search results”).

$attribute is a string that contains group-by attribute name. $func is a constant that chooses a function applied to the attribute value in order to compute group-by key. $groupsort is a clause that controls how the groups will be sorted. Its syntax is similar to that described in Section 5.6, “SPH_SORT_EXTENDED mode”.

Grouping feature is very similar in nature to GROUP BY clause from SQL. Results produces by this function call are going to be the same as produced by the following pseudo code: 

SELECT ... GROUP BY $func($attribute) ORDER BY $groupsort

Note that it's $groupsort that affects the order of matches in the final result set. Sorting mode (see Section 8.3.3, “SetSortMode”) affect the ordering of matches within group, ie. what match will be selected as the best one from the group. So you can for instance order the groups by matches count and select the most relevant match within each group at the same time.

Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported through SetSelect() API call when using GROUP BY.

Starting with version 2.0.1-beta, grouping on string attributes is supported, with respect to current collation.

8.5.2. SetGroupDistinct

Prototype: function SetGroupDistinct ( $attribute )

Sets attribute name for per-group distinct values count calculations. Only available for grouping queries.

$attribute is a string that contains the attribute name. For each group, all values of this attribute will be stored (as RAM limits permit), then the amount of distinct values will be calculated and returned to the client. This feature is similar to COUNT(DISTINCT) clause in standard SQL; so these Sphinx calls: 

$cl->SetGroupBy ( "category", SPH_GROUPBY_ATTR, "@count desc" );
$cl->SetGroupDistinct ( "vendor" );

can be expressed using the following SQL clauses: 

SELECT id, weight, all-attributes,
	COUNT(DISTINCT vendor) AS @distinct,
	COUNT(*) AS @count
FROM products
GROUP BY category
ORDER BY @count DESC

In the sample pseudo code shown just above, SetGroupDistinct() call corresponds to COUNT(DISINCT vendor) clause only. GROUP BY, ORDER BY, and COUNT(*) clauses are all an equivalent of SetGroupBy() settings. Both queries will return one matching row for each category. In addition to indexed attributes, matches will also contain total per-category matches count, and the count of distinct vendor IDs within each category.

8.6. Querying

8.6.1. Query

Prototype: function Query ( $query, $index="*", $comment="" )

Connects to searchd server, runs given search query with current settings, obtains and returns the result set.

$query is a query string. $index is an index name (or names) string. Returns false and sets GetLastError() message on general error. Returns search result set on success. Additionally, the contents of $comment are sent to the query log, marked in square brackets, just before the search terms, which can be very useful for debugging. Currently, the comment is limited to 128 characters.

Default value for $index is "*" that means to query all local indexes. Characters allowed in index names include Latin letters (a-z), numbers (0-9), minus sign (-), and underscore (_); everything else is considered a separator. Therefore, all of the following samples calls are valid and will search the same two indexes: 

$cl->Query ( "test query", "main delta" );
$cl->Query ( "test query", "main;delta" );
$cl->Query ( "test query", "main, delta" );

Index specification order matters. If document with identical IDs are found in two or more indexes, weight and attribute values from the very last matching index will be used for sorting and returning to client (unless explicitly overridden with SetIndexWeights()). Therefore, in the example above, matches from "delta" index will always win over matches from "main".

On success, Query() returns a result set that contains some of the found matches (as requested by SetLimits()) and additional general per-query statistics. The result set is a hash (PHP specific; other languages might utilize other structures instead of hash) with the following keys and values:

"matches":

Hash which maps found document IDs to another small hash containing document weight and attribute values (or an array of the similar small hashes if SetArrayResult() was enabled).

"total":

Total amount of matches retrieved on server (ie. to the server side result set) by this query. You can retrieve up to this amount of matches from server for this query text with current query settings.

"total_found":

Total amount of matching documents in index (that were found and procesed on server).

"words":

Hash which maps query keywords (case-folded, stemmed, and otherwise processed) to a small hash with per-keyword statitics ("docs", "hits").

"error":

Query error message reported by searchd (string, human readable). Empty if there were no errors.

"warning":

Query warning message reported by searchd (string, human readable). Empty if there were no warnings.

It should be noted that Query() carries out the same actions as AddQuery() and RunQueries() without the intermediate steps; it is analoguous to a single AddQuery() call, followed by a corresponding RunQueries(), then returning the first array element of matches (from the first, and only, query.)

8.6.2. AddQuery

Prototype: function AddQuery ( $query, $index="*", $comment="" )

Adds additional query with current settings to multi-query batch. $query is a query string. $index is an index name (or names) string. Additionally if provided, the contents of $comment are sent to the query log, marked in square brackets, just before the search terms, which can be very useful for debugging. Currently, this is limited to 128 characters. Returns index to results array returned from RunQueries().

Batch queries (or multi-queries) enable searchd to perform internal optimizations if possible. They also reduce network connection overheads and search process creation overheads in all cases. They do not result in any additional overheads compared to simple queries. Thus, if you run several different queries from your web page, you should always consider using multi-queries.

For instance, running the same full-text query but with different sorting or group-by settings will enable searchd to perform expensive full-text search and ranking operation only once, but compute multiple group-by results from its output.

This can be a big saver when you need to display not just plain search results but also some per-category counts, such as the amount of products grouped by vendor. Without multi-query, you would have to run several queries which perform essentially the same search and retrieve the same matches, but create result sets differently. With multi-query, you simply pass all these querys in a single batch and Sphinx optimizes the redundant full-text search internally.

AddQuery() internally saves full current settings state along with the query, and you can safely change them afterwards for subsequent AddQuery() calls. Already added queries will not be affected; there's actually no way to change them at all. Here's an example: 

$cl->SetSortMode ( SPH_SORT_RELEVANCE );
$cl->AddQuery ( "hello world", "documents" );

$cl->SetSortMode ( SPH_SORT_ATTR_DESC, "price" );
$cl->AddQuery ( "ipod", "products" );

$cl->AddQuery ( "harry potter", "books" );

$results = $cl->RunQueries ();

With the code above, 1st query will search for "hello world" in "documents" index and sort results by relevance, 2nd query will search for "ipod" in "products" index and sort results by price, and 3rd query will search for "harry potter" in "books" index while still sorting by price. Note that 2nd SetSortMode() call does not affect the first query (because it's already added) but affects both other subsequent queries.

Additionally, any filters set up before an AddQuery() will fall through to subsequent queries. So, if SetFilter() is called before the first query, the same filter will be in place for the second (and subsequent) queries batched through AddQuery() unless you call ResetFilters() first. Alternatively, you can add additional filters as well.

This would also be true for grouping options and sorting options; no current sorting, filtering, and grouping settings are affected by this call; so subsequent queries will reuse current query settings.

AddQuery() returns an index into an array of results that will be returned from RunQueries() call. It is simply a sequentially increasing 0-based integer, ie. first call will return 0, second will return 1, and so on. Just a small helper so you won't have to track the indexes manualy if you need then.

8.6.3. RunQueries

Prototype: function RunQueries ()

Connect to searchd, runs a batch of all queries added using AddQuery(), obtains and returns the result sets. Returns false and sets GetLastError() message on general error (such as network I/O failure). Returns a plain array of result sets on success.

Each result set in the returned array is exactly the same as the result set returned from Query().

Note that the batch query request itself almost always succeds - unless there's a network error, blocking index rotation in progress, or another general failure which prevents the whole request from being processed.

However individual queries within the batch might very well fail. In this case their respective result sets will contain non-empty "error" message, but no matches or query statistics. In the extreme case all queries within the batch could fail. There still will be no general error reported, because API was able to succesfully connect to searchd, submit the batch, and receive the results - but every result set will have a specific error message.

8.6.4. ResetFilters

Prototype: function ResetFilters ()

Clears all currently set filters.

This call is only normally required when using multi-queries. You might want to set different filters for different queries in the batch. To do that, you should call ResetFilters() and add new filters using the respective calls.

8.6.5. ResetGroupBy

Prototype: function ResetGroupBy ()

Clears all currently group-by settings, and disables group-by.

This call is only normally required when using multi-queries. You can change individual group-by settings using SetGroupBy() and SetGroupDistinct() calls, but you can not disable group-by using those calls. ResetGroupBy() fully resets previous group-by settings and disables group-by mode in the current state, so that subsequent AddQuery() calls can perform non-grouping searches.

8.7. Additional functionality

8.7.1. BuildExcerpts

Prototype: function BuildExcerpts ( $docs, $index, $words, $opts=array() )

Excerpts (snippets) builder function. Connects to searchd, asks it to generate excerpts (snippets) from given documents, and returns the results.

$docs is a plain array of strings that carry the documents' contents. $index is an index name string. Different settings (such as charset, morphology, wordforms) from given index will be used. $words is a string that contains the keywords to highlight. They will be processed with respect to index settings. For instance, if English stemming is enabled in the index, "shoes" will be highlighted even if keyword is "shoe". Starting with version 0.9.9-rc1, keywords can contain wildcards, that work similarly to star-syntax available in queries. $opts is a hash which contains additional optional highlighting parameters:

"before_match":

A string to insert before a keyword match. Starting with version 1.10-beta, a %PASSAGE_ID% macro can be used in this string. The macro is replaced with an incrementing passage number within a current snippet. Numbering starts at 1 by default but can be overridden with "start_passage_id" option. In a multi-document call, %PASSAGE_ID% would restart at every given document. Default is "<b>".

"after_match":

A string to insert after a keyword match. Starting with version 1.10-beta, a %PASSAGE_ID% macro can be used in this string. Default is "</b>".

"chunk_separator":

A string to insert between snippet chunks (passages). Default is " ... ".

"limit":

Maximum snippet size, in symbols (codepoints). Integer, default is 256.

"around":

How much words to pick around each matching keywords block. Integer, default is 5.

"exact_phrase":

Whether to highlight exact query phrase matches only instead of individual keywords. Boolean, default is false.

"single_passage":

Whether to extract single best passage only. Boolean, default is false.

"use_boundaries":

Whether to additionaly break passages by phrase boundary characters, as configured in index settings with phrase_boundary directive. Boolean, default is false.

"weight_order":

Whether to sort the extracted passages in order of relevance (decreasing weight), or in order of appearance in the document (increasing position). Boolean, default is false.

"query_mode":

Added in version 1.10-beta. Whether to handle $words as a query in extended syntax, or as a bag of words (default behavior). For instance, in query mode ("one two" | "three four") will only highlight and include those occurrences "one two" or "three four" when the two words from each pair are adjacent to each other. In default mode, any single occurrence of "one", "two", "three", or "four" would be highlighted. Boolean, default is false.

"force_all_words":

Added in version 1.10-beta. Ignores the snippet length limit until it includes all the keywords. Boolean, default is false.

"limit_passages":

Added in version 1.10-beta. Limits the maximum number of passages that can be included into the snippet. Integer, default is 0 (no limit).

"limit_words":

Added in version 1.10-beta. Limits the maximum number of keywords that can be included into the snippet. Integer, default is 0 (no limit).

"start_passage_id":

Added in version 1.10-beta. Specifies the starting value of %PASSAGE_ID% macro (that gets detected and expanded in before_match, after_match strings). Integer, default is 1.

"load_files":

Added in version 1.10-beta. Whether to handle $docs as data to extract snippets from (default behavior), or to treat it as file names, and load data from specified files on the server side. Starting with version 2.0.1-beta, up to dist_threads worker threads per request will be created to parallelize the work when this flag is enabled. Boolean, default is false.

"html_strip_mode":

Added in version 1.10-beta. HTML stripping mode setting. Defaults to "index", which means that index settings will be used. The other values are "none" and "strip", that forcibly skip or apply stripping irregardless of index settings; and "retain", that retains HTML markup and protects it from highlighting. The "retain" mode can only be used when highlighting full documents and thus requires that no snippet size limits are set. String, allowed values are "none", "strip", "index", and "retain".

"allow_empty":

Added in version 1.10-beta. Allows empty string to be returned as highlighting result when a snippet could not be generated (no keywords match, or no passages fit the limit). By default, the beginning of original text would be returned instead of an empty string. Boolean, default is false.

"passage_boundary":

Added in version 2.0.1-beta. Ensures that passages do not cross a sentence, paragraph, or zone boundary (when used with an index that has the respective indexing settings enabled). String, allowed values are "sentence", "paragraph", and "zone".

"passage_boundary":

Added in version 2.0.1-beta. Ensures that passages do not cross a sentence, paragraph, or zone boundary (when used with an index that has the respective indexing settings enabled). String, allowed values are "sentence", "paragraph", and "zone".

"emit_zones":

Added in version 2.0.1-beta. Emits an HTML tag with an enclosing zone name before each passage. Boolean, default is false.

Snippets extraction algorithm currently favors better passages (with closer phrase matches), and then passages with keywords not yet in snippet. Generally, it will try to highlight the best match with the query, and it will also to highlight all the query keywords, as made possible by the limtis. In case the document does not match the query, beginning of the document trimmed down according to the limits will be return by default. Starting with 1.10-beta, you can also return an empty snippet instead case by setting "allow_empty" option to true.

Returns false on failure. Returns a plain array of strings with excerpts (snippets) on success.

8.7.2. UpdateAttributes

Prototype: function UpdateAttributes ( $index, $attrs, $values )

Instantly updates given attribute values in given documents. Returns number of actually updated documents (0 or more) on success, or -1 on failure.

$index is a name of the index (or indexes) to be updated. $attrs is a plain array with string attribute names, listing attributes that are updated. $values is a hash where key is document ID, and value is a plain array of new attribute values.

$index can be either a single index name or a list, like in Query(). Unlike Query(), wildcard is not allowed and all the indexes to update must be specified explicitly. The list of indexes can include distributed index names. Updates on distributed indexes will be pushed to all agents.

The updates only work with docinfo=extern storage strategy. They are very fast because they're working fully in RAM, but they can also be made persistent: updates are saved on disk on clean searchd shutdown initiated by SIGTERM signal. With additional restrictions, updates are also possible on MVA attributes; refer to mva_updates_pool directive for details.

Usage example: 

$cl->UpdateAttributes ( "test1", array("group_id"), array(1=>array(456)) );
$cl->UpdateAttributes ( "products", array ( "price", "amount_in_stock" ),
	array ( 1001=>array(123,5), 1002=>array(37,11), 1003=>(25,129) ) );

The first sample statement will update document 1 in index "test1", setting "group_id" to 456. The second one will update documents 1001, 1002 and 1003 in index "products". For document 1001, the new price will be set to 123 and the new amount in stock to 5; for document 1002, the new price will be 37 and the new amount will be 11; etc.

8.7.3. BuildKeywords

Prototype: function BuildKeywords ( $query, $index, $hits )

Extracts keywords from query using tokenizer settings for given index, optionally with per-keyword occurrence statistics. Returns an array of hashes with per-keyword information.

$query is a query to extract keywords from. $index is a name of the index to get tokenizing settings and keyword occurrence statistics from. $hits is a boolean flag that indicates whether keyword occurrence statistics are required.

Usage example:

$keywords = $cl->BuildKeywords ( "this.is.my query", "test1", false );

8.7.4. EscapeString

Prototype: function EscapeString ( $string )

Escapes characters that are treated as special operators by the query language parser. Returns an escaped string.

$string is a string to escape.

This function might seem redundant because it's trivial to implement in any calling application. However, as the set of special characters might change over time, it makes sense to have an API call that is guaranteed to escape all such characters at all times.

Usage example:

$escaped = $cl->EscapeString ( "escaping-sample@query/string" );

8.7.5. Status

Prototype: function Status ()

Queries searchd status, and returns an array of status variable name and value pairs.

Usage example:

$status = $cl->Status ();
foreach ( $status as $row )
	print join ( ": ", $row ) . "\n";

8.7.6. FlushAttributes

Prototype: function FlushAttributes ()

Forces searchd to flush pending attribute updates to disk, and blocks until completion. Returns a non-negative internal "flush tag" on success. Returns -1 and sets an error message on error. Introduced in version 1.10-beta.

Attribute values updated using UpdateAttributes() API call are only kept in RAM until a so-called flush (which writes the current, possibly updated attribute values back to disk). FlushAttributes() call lets you enforce a flush. The call will block until searchd finishes writing the data to disk, which might take seconds or even minutes depending on the total data size (.spa file size). All the currently updated indexes will be flushed.

Flush tag should be treated as an ever growing magic number that does not mean anything. It's guaranteed to be non-negative. It is guaranteed to grow over time, though not necessarily in a sequential fashion; for instance, two calls that return 10 and then 1000 respectively are a valid situation. If two calls to FlushAttrs() return the same tag, it means that there were no actual attribute updates in between them, and therefore current flushed state remained the same (for all indexes).

Usage example:

$status = $cl->FlushAttributes ();
if ( $status<0 )
	print "ERROR: " . $cl->GetLastError();

8.8. Persistent connections

Persistent connections allow to use single network connection to run multiple commands that would otherwise require reconnects.

8.8.1. Open

Prototype: function Open ()

Opens persistent connection to the server.

8.8.2. Close

Prototype: function Close ()

Closes previously opened persistent connection.

Chapter 9. MySQL storage engine (SphinxSE)

Table of Contents

9.1. SphinxSE overview
9.2. Installing SphinxSE
9.2.1. Compiling MySQL 5.0.x with SphinxSE
9.2.2. Compiling MySQL 5.1.x with SphinxSE
9.2.3. Checking SphinxSE installation
9.3. Using SphinxSE
9.4. Building snippets (excerpts) via MySQL

9.1. SphinxSE overview

SphinxSE is MySQL storage engine which can be compiled into MySQL server 5.x using its pluggable architecure. It is not available for MySQL 4.x series. It also requires MySQL 5.0.22 or higher in 5.0.x series, or MySQL 5.1.12 or higher in 5.1.x series.

Despite the name, SphinxSE does not actually store any data itself. It is actually a built-in client which allows MySQL server to talk to searchd, run search queries, and obtain search results. All indexing and searching happen outside MySQL.

Obvious SphinxSE applications include:

  • easier porting of MySQL FTS applications to Sphinx;

  • allowing Sphinx use with progamming languages for which native APIs are not available yet;

  • optimizations when additional Sphinx result set processing on MySQL side is required (eg. JOINs with original document tables, additional MySQL-side filtering, etc).

9.2. Installing SphinxSE

You will need to obtain a copy of MySQL sources, prepare those, and then recompile MySQL binary. MySQL sources (mysql-5.x.yy.tar.gz) could be obtained from dev.mysql.com Web site.

For some MySQL versions, there are delta tarballs with already prepared source versions available from Sphinx Web site. After unzipping those over original sources MySQL would be ready to be configured and built with Sphinx support.

If such tarball is not available, or does not work for you for any reason, you would have to prepare sources manually. You will need to GNU Autotools framework (autoconf, automake and libtool) installed to do that.

9.2.1. Compiling MySQL 5.0.x with SphinxSE

Skips steps 1-3 if using already prepared delta tarball.

  1. copy sphinx.5.0.yy.diff patch file into MySQL sources directory and run 

    patch -p1 < sphinx.5.0.yy.diff

    If there's no .diff file exactly for the specific version you need to build, try applying .diff with closest version numbers. It is important that the patch should apply with no rejects.

  2. in MySQL sources directory, run 

    sh BUILD/autorun.sh

  3. in MySQL sources directory, create sql/sphinx directory in and copy all files in mysqlse directory from Sphinx sources there. Example: 

    cp -R /root/builds/sphinx-0.9.7/mysqlse /root/builds/mysql-5.0.24/sql/sphinx

  4. configure MySQL and enable Sphinx engine: 

    ./configure --with-sphinx-storage-engine

  5. build and install MySQL: 

    make
make install

9.2.2. Compiling MySQL 5.1.x with SphinxSE

Skip steps 1-2 if using already prepared delta tarball.

  1. in MySQL sources directory, create storage/sphinx directory in and copy all files in mysqlse directory from Sphinx sources there. Example: 

    cp -R /root/builds/sphinx-0.9.7/mysqlse /root/builds/mysql-5.1.14/storage/sphinx

  2. in MySQL sources directory, run 

    sh BUILD/autorun.sh

  3. configure MySQL and enable Sphinx engine: 

    ./configure --with-plugins=sphinx

  4. build and install MySQL: 

    make
make install

9.2.3. Checking SphinxSE installation

To check whether SphinxSE has been succesfully compiled into MySQL, launch newly built servers, run mysql client and issue SHOW ENGINES query. You should see a list of all available engines. Sphinx should be present and "Support" column should contain "YES":

mysql> show engines;
+------------+----------+-------------------------------------------------------------+
| Engine     | Support  | Comment                                                     |
+------------+----------+-------------------------------------------------------------+
| MyISAM     | DEFAULT  | Default engine as of MySQL 3.23 with great performance      |
  ...
| SPHINX     | YES      | Sphinx storage engine                                       |
  ...
+------------+----------+-------------------------------------------------------------+
13 rows in set (0.00 sec)

9.3. Using SphinxSE

To search via SphinxSE, you would need to create special ENGINE=SPHINX "search table", and then SELECT from it with full text query put into WHERE clause for query column.

Let's begin with an example create statement and search query: 

CREATE TABLE t1
(
    id          INTEGER UNSIGNED NOT NULL,
    weight      INTEGER NOT NULL,
    query       VARCHAR(3072) NOT NULL,
    group_id    INTEGER,
    INDEX(query)
) ENGINE=SPHINX CONNECTION="sphinx://localhost:9312/test";

SELECT * FROM t1 WHERE query='test it;mode=any';

First 3 columns of search table must have a types of INTEGER UNSINGED or BIGINT for the 1st column (document id), INTEGER or BIGINT for the 2nd column (match weight), and VARCHAR or TEXT for the 3rd column (your query), respectively. This mapping is fixed; you can not omit any of these three required columns, or move them around, or change types. Also, query column must be indexed; all the others must be kept unindexed. Columns' names are ignored so you can use arbitrary ones.

Additional columns must be either INTEGER, TIMESTAMP, BIGINT, VARCHAR, or FLOAT. They will be bound to attributes provided in Sphinx result set by name, so their names must match attribute names specified in sphinx.conf. If there's no such attribute name in Sphinx search results, column will have NULL values.

Special "virtual" attributes names can also be bound to SphinxSE columns. _sph_ needs to be used instead of @ for that. For instance, to obtain the values of @groupby, @count, or @distinct virtual attributes, use _sph_groupby, _sph_count or _sph_distinct column names, respectively.

CONNECTION string parameter can be used to specify default searchd host, port and indexes for queries issued using this table. If no connection string is specified in CREATE TABLE, index name "*" (ie. search all indexes) and localhost:9312 are assumed. Connection string syntax is as follows: 

CONNECTION="sphinx://HOST:PORT/INDEXNAME"

You can change the default connection string later: 

ALTER TABLE t1 CONNECTION="sphinx://NEWHOST:NEWPORT/NEWINDEXNAME";

You can also override all these parameters per-query.

As seen in example, both query text and search options should be put into WHERE clause on search query column (ie. 3rd column); the options are separated by semicolons; and their names from values by equality sign. Any number of options can be specified. Available options are:

  • query - query text;

  • mode - matching mode. Must be one of "all", "any", "phrase", "boolean", "extended", or "extended2". Default is "all";

  • sort - match sorting mode. Must be one of "relevance", "attr_desc", "attr_asc", "time_segments", or "extended". In all modes besides "relevance" attribute name (or sorting clause for "extended") is also required after a colon: 

    ... WHERE query='test;sort=attr_asc:group_id';
... WHERE query='test;sort=extended:@weight desc, group_id asc';

  • offset - offset into result set, default is 0;

  • limit - amount of matches to retrieve from result set, default is 20;

  • index - names of the indexes to search: 

    ... WHERE query='test;index=test1;';
... WHERE query='test;index=test1,test2,test3;';

  • minid, maxid - min and max document ID to match;

  • weights - comma-separated list of weights to be assigned to Sphinx full-text fields: 

    ... WHERE query='test;weights=1,2,3;';

  • filter, !filter - comma-separated attribute name and a set of values to match: 

    # only include groups 1, 5 and 19
... WHERE query='test;filter=group_id,1,5,19;';

# exclude groups 3 and 11
... WHERE query='test;!filter=group_id,3,11;';

  • range, !range - comma-separated attribute name, min and max value to match: 

    # include groups from 3 to 7, inclusive
... WHERE query='test;range=group_id,3,7;';

# exclude groups from 5 to 25
... WHERE query='test;!range=group_id,5,25;';

  • maxmatches - per-query max matches value, as in max_matches parameter to SetLimits() API call: 

    ... WHERE query='test;maxmatches=2000;';

  • cutoff - maximum allowed matches, as in cutoff parameter to SetLimits() API call: 

    ... WHERE query='test;cutoff=10000;';

  • maxquerytme - maximum allowed query time (in milliseconds), as in SetMaxQueryTime() API call: 

    ... WHERE query='test;maxquerytime=1000;';

  • groupby - group-by function and attribute, corresponding to SetGroupBy() API call: 

    ... WHERE query='test;groupby=day:published_ts;';
... WHERE query='test;groupby=attr:group_id;';

  • groupsort - group-by sorting clause: 

    ... WHERE query='test;groupsort=@count desc;';

  • distinct - an attribute to compute COUNT(DISTINCT) for when doing group-by, as in SetGroupDistinct() API call: 

    ... WHERE query='test;groupby=attr:country_id;distinct=site_id';

  • indexweights - comma-separated list of index names and weights to use when searching through several indexes: 

    ... WHERE query='test;indexweights=idx_exact,2,idx_stemmed,1;';

  • comment - a string to mark this query in query log (mapping to $comment parameter in Query() API call): 

    ... WHERE query='test;comment=marker001;';

  • select - a string with expressions to compute (mapping to SetSelect() API call): 

    ... WHERE query='test;select=2*a+3*b as myexpr;';

  • host, port - remote searchd host name and TCP port, respectively: 

    ... WHERE query='test;host=sphinx-test.loc;port=7312;';

  • ranker - a ranking function to use when matching mode is extended2 (i.e. with query syntax), as in SetRankingMode() API call. Known values are "proximity_bm25", "bm25", "none", "wordcount", "proximity", "matchany", and "fieldmask". 

    ... WHERE query='test;mode=extended2;ranker=bm25;';

  • geoanchor - geodistance anchor, as in SetGeoAnchor() API call. Takes 4 parameters which are latitude and longiture attribute names, and anchor point coordinates respectively: 

    ... WHERE query='test;geoanchor=latattr,lonattr,0.123,0.456';

One very important note that it is much more efficient to allow Sphinx to perform sorting, filtering and slicing the result set than to raise max matches count and use WHERE, ORDER BY and LIMIT clauses on MySQL side. This is for two reasons. First, Sphinx does a number of optimizations and performs better than MySQL on these tasks. Second, less data would need to be packed by searchd, transferred and unpacked by SphinxSE.

Starting with version 0.9.9-rc1, additional query info besides result set could be retrieved with SHOW ENGINE SPHINX STATUS statement: 

mysql> SHOW ENGINE SPHINX STATUS;
+--------+-------+-------------------------------------------------+
| Type   | Name  | Status                                          |
+--------+-------+-------------------------------------------------+
| SPHINX | stats | total: 25, total found: 25, time: 126, words: 2 | 
| SPHINX | words | sphinx:591:1256 soft:11076:15945                | 
+--------+-------+-------------------------------------------------+
2 rows in set (0.00 sec)

This information can also be accessed through status variables. Note that this method does not require super-user privileges. 

mysql> SHOW STATUS LIKE 'sphinx_%';
+--------------------+----------------------------------+
| Variable_name      | Value                            |
+--------------------+----------------------------------+
| sphinx_total       | 25                               | 
| sphinx_total_found | 25                               | 
| sphinx_time        | 126                              | 
| sphinx_word_count  | 2                                | 
| sphinx_words       | sphinx:591:1256 soft:11076:15945 | 
+--------------------+----------------------------------+
5 rows in set (0.00 sec)

You could perform JOINs on SphinxSE search table and tables using other engines. Here's an example with "documents" from example.sql: 

mysql> SELECT content, date_added FROM test.documents docs
-> JOIN t1 ON (docs.id=t1.id) 
-> WHERE query="one document;mode=any";
+-------------------------------------+---------------------+
| content                             | docdate             |
+-------------------------------------+---------------------+
| this is my test document number two | 2006-06-17 14:04:28 | 
| this is my test document number one | 2006-06-17 14:04:28 | 
+-------------------------------------+---------------------+
2 rows in set (0.00 sec)

mysql> SHOW ENGINE SPHINX STATUS;
+--------+-------+---------------------------------------------+
| Type   | Name  | Status                                      |
+--------+-------+---------------------------------------------+
| SPHINX | stats | total: 2, total found: 2, time: 0, words: 2 | 
| SPHINX | words | one:1:2 document:2:2                        | 
+--------+-------+---------------------------------------------+
2 rows in set (0.00 sec)

9.4. Building snippets (excerpts) via MySQL

Starting with version 0.9.9-rc2, SphinxSE also includes a UDF function that lets you create snippets through MySQL. The functionality is fully similar to BuildExcerprts API call but accesible through MySQL+SphinxSE.

The binary that provides the UDF is named sphinx.so and should be automatically built and installed to proper location along with SphinxSE itself. If it does not get installed automatically for some reason, look for sphinx.so in the build directory and copy it to the plugins directory of your MySQL instance. After that, register the UDF using the following statement: 

CREATE FUNCTION sphinx_snippets RETURNS STRING SONAME 'sphinx.so';

Function name must be sphinx_snippets, you can not use an arbitrary name. Function arguments are as follows:

Prototype: function sphinx_snippets ( document, index, words, [options] );

Document and words arguments can be either strings or table columns. Options must be specified like this: 'value' AS option_name. For a list of supported options, refer to BuildExcerprts() API call. The only UDF-specific additional option is named 'sphinx' and lets you specify searchd location (host and port).

Usage examples: 

SELECT sphinx_snippets('hello world doc', 'main', 'world',
    'sphinx://192.168.1.1/' AS sphinx, true AS exact_phrase,
    '[b]' AS before_match, '[/b]' AS after_match)
FROM documents;

SELECT title, sphinx_snippets(text, 'index', 'mysql php') AS text
    FROM sphinx, documents
    WHERE query='mysql php' AND sphinx.id=documents.id;

Chapter 10. Reporting bugs

Unfortunately, Sphinx is not yet 100% bug free (even though I'm working hard towards that), so you might occasionally run into some issues.

Reporting as much as possible about each bug is very important - because to fix it, I need to be able either to reproduce and debug the bug, or to deduce what's causing it from the information that you provide. So here are some instructions on how to do that.

Build-time issues

If Sphinx fails to build for some reason, please do the following:

  1. check that headers and libraries for your DBMS are properly installed (for instance, check that mysql-devel package is present);

  2. report Sphinx version and config file (be sure to remove the passwords!), MySQL (or PostgreSQL) configuration info, gcc version, OS version and CPU type (ie. x86, x86-64, PowerPC, etc): 

    mysql_config
gcc --version
uname -a

  3. report the error message which is produced by configure or gcc (it should be to include error message itself only, not the whole build log).

Run-time issues

If Sphinx builds and runs, but there are any problems running it, please do the following:

  1. describe the bug (ie. both the expected behavior and actual behavior) and all the steps necessary to reproduce it;

  2. include Sphinx version and config file (be sure to remove the passwords!), MySQL (or PostgreSQL) version, gcc version, OS version and CPU type (ie. x86, x86-64, PowerPC, etc): 

    mysql --version
gcc --version
uname -a

  3. build, install and run debug versions of all Sphinx programs (this is to enable a lot of additional internal checks, so-called assertions): 

    make distclean
./configure --with-debug
make install
killall -TERM searchd

  4. reindex to check if any assertions are triggered (in this case, it's likely that the index is corrupted and causing problems);

  5. if the bug does not reproduce with debug versions, revert to non-debug and mention it in your report;

  6. if the bug could be easily reproduced with a small (1-100 record) part of your database, please provide a gzipped dump of that part;

  7. if the problem is related to searchd, include relevant entries from searchd.log and query.log in your bug report;

  8. if the problem is related to searchd, try running it in console mode and check if it dies with an assertion: 

    ./searchd --console

  9. if any program dies with an assertion, provide the assertion message.

Debugging assertions, crashes and hangups

If any program dies with an assertion, crashes without an assertion or hangs up, you would additionally need to generate a core dump and examine it.

  1. enable core dumps. On most Linux systems, this is done using ulimit: 

    ulimit -c 32768

  2. run the program and try to reproduce the bug;

  3. if the program crashes (either with or without an assertion), find the core file in current directory (it should typically print out "Segmentation fault (core dumped)" message);

  4. if the program hangs, use kill -SEGV from another console to force it to exit and dump core: 

    kill -SEGV HANGED-PROCESS-ID

  5. use gdb to examine the core file and obtain a backtrace: 

    gdb ./CRASHED-PROGRAM-FILE-NAME CORE-DUMP-FILE-NAME
(gdb) bt
(gdb) quit

Note that HANGED-PROCESS-ID, CRASHED-PROGRAM-FILE-NAME and CORE-DUMP-FILE-NAME must all be replaced with specific numbers and file names. For example, hanged searchd debugging session would look like: 

# kill -SEGV 12345
# ls *core*
core.12345
# gdb ./searchd core.12345
(gdb) bt
...
(gdb) quit

Note that ulimit is not server-wide and only affects current shell session. This means that you will not have to restore any server-wide limits - but if you relogin, you will have to set ulimit again.

Core dumps should be placed in current working directory (and Sphinx programs do not change it), so this is where you would look for them.

Please do not immediately remove the core file because there could be additional helpful information which could be retrieved from it. You do not need to send me this file (as the debug info there is closely tied to your system) but I might need to ask you a few additional questions about it.

Chapter 11. sphinx.conf options reference

Table of Contents

11.1. Data source configuration options
11.1.1. type
11.1.2. sql_host
11.1.3. sql_port
11.1.4. sql_user
11.1.5. sql_pass
11.1.6. sql_db
11.1.7. sql_sock
11.1.8. mysql_connect_flags
11.1.9. mysql_ssl_cert, mysql_ssl_key, mysql_ssl_ca
11.1.10. odbc_dsn
11.1.11. sql_query_pre
11.1.12. sql_query
11.1.13. sql_joined_field
11.1.14. sql_query_range
11.1.15. sql_range_step
11.1.16. sql_query_killlist
11.1.17. sql_attr_uint
11.1.18. sql_attr_bool
11.1.19. sql_attr_bigint
11.1.20. sql_attr_timestamp
11.1.21. sql_attr_str2ordinal
11.1.22. sql_attr_float
11.1.23. sql_attr_multi
11.1.24. sql_attr_string
11.1.25. sql_attr_str2wordcount
11.1.26. sql_column_buffers
11.1.27. sql_field_string
11.1.28. sql_field_str2wordcount
11.1.29. sql_file_field
11.1.30. sql_query_post
11.1.31. sql_query_post_index
11.1.32. sql_ranged_throttle
11.1.33. sql_query_info
11.1.34. xmlpipe_command
11.1.35. xmlpipe_field
11.1.36. xmlpipe_field_string
11.1.37. xmlpipe_field_wordcount
11.1.38. xmlpipe_attr_uint
11.1.39. xmlpipe_attr_bool
11.1.40. xmlpipe_attr_timestamp
11.1.41. xmlpipe_attr_str2ordinal
11.1.42. xmlpipe_attr_float
11.1.43. xmlpipe_attr_multi
11.1.44. xmlpipe_attr_string
11.1.45. xmlpipe_fixup_utf8
11.1.46. mssql_winauth
11.1.47. mssql_unicode
11.1.48. unpack_zlib
11.1.49. unpack_mysqlcompress
11.1.50. unpack_mysqlcompress_maxsize
11.2. Index configuration options
11.2.1. type
11.2.2. source
11.2.3. path
11.2.4. docinfo
11.2.5. mlock
11.2.6. morphology
11.2.7. dict
11.2.8. index_sp
11.2.9. index_zones
11.2.10. min_stemming_len
11.2.11. stopwords
11.2.12. wordforms
11.2.13. exceptions
11.2.14. min_word_len
11.2.15. charset_type
11.2.16. charset_table
11.2.17. ignore_chars
11.2.18. min_prefix_len
11.2.19. min_infix_len
11.2.20. prefix_fields
11.2.21. infix_fields
11.2.22. enable_star
11.2.23. ngram_len
11.2.24. ngram_chars
11.2.25. phrase_boundary
11.2.26. phrase_boundary_step
11.2.27. html_strip
11.2.28. html_index_attrs
11.2.29. html_remove_elements
11.2.30. local
11.2.31. agent
11.2.32. agent_blackhole
11.2.33. agent_connect_timeout
11.2.34. agent_query_timeout
11.2.35. preopen
11.2.36. ondisk_dict
11.2.37. inplace_enable
11.2.38. inplace_hit_gap
11.2.39. inplace_docinfo_gap
11.2.40. inplace_reloc_factor
11.2.41. inplace_write_factor
11.2.42. index_exact_words
11.2.43. overshort_step
11.2.44. stopword_step
11.2.45. hitless_words
11.2.46. expand_keywords
11.2.47. blend_chars
11.2.48. blend_mode
11.2.49. rt_mem_limit
11.2.50. rt_field
11.2.51. rt_attr_uint
11.2.52. rt_attr_bigint
11.2.53. rt_attr_float
11.2.54. rt_attr_timestamp
11.2.55. rt_attr_string
11.3. indexer program configuration options
11.3.1. mem_limit
11.3.2. max_iops
11.3.3. max_iosize
11.3.4. max_xmlpipe2_field
11.3.5. write_buffer
11.3.6. max_file_field_buffer
11.4. searchd program configuration options
11.4.1. listen
11.4.2. address
11.4.3. port
11.4.4. log
11.4.5. query_log
11.4.6. query_log_format
11.4.7. read_timeout
11.4.8. client_timeout
11.4.9. max_children
11.4.10. pid_file
11.4.11. max_matches
11.4.12. seamless_rotate
11.4.13. preopen_indexes
11.4.14. unlink_old
11.4.15. attr_flush_period
11.4.16. ondisk_dict_default
11.4.17. max_packet_size
11.4.18. mva_updates_pool
11.4.19. crash_log_path
11.4.20. max_filters
11.4.21. max_filter_values
11.4.22. listen_backlog
11.4.23. read_buffer
11.4.24. read_unhinted
11.4.25. max_batch_queries
11.4.26. subtree_docs_cache
11.4.27. subtree_hits_cache
11.4.28. workers
11.4.29. dist_threads
11.4.30. binlog_path
11.4.31. binlog_flush
11.4.32. binlog_max_log_size
11.4.33. collation_server
11.4.34. collation_libc_locale
11.4.35. plugin_dir
11.4.36. mysql_version_string
11.4.37. rt_flush_period
11.4.38. thread_stack
11.4.39. expansion_limit
11.4.40. compat_sphinxql_magics
11.4.41. watchdog

11.1. Data source configuration options

11.1.1. type

Data source type. Mandatory, no default value. Known types are mysql, pgsql, mssql, xmlpipe and xmlpipe2, and odbc.

All other per-source options depend on source type selected by this option. Names of the options used for SQL sources (ie. MySQL, PostgreSQL, MS SQL) start with "sql_"; names of the ones used for xmlpipe and xmlpipe2 start with "xmlpipe_". All source types except xmlpipe are conditional; they might or might not be supported depending on your build settings, installed client libraries, etc. mssql type is currently only available on Windows. odbc type is available both on Windows natively and on Linux through UnixODBC library.

Example:

type = mysql

11.1.2. sql_host

SQL server host to connect to. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only.

In the simplest case when Sphinx resides on the same host with your MySQL or PostgreSQL installation, you would simply specify "localhost". Note that MySQL client library chooses whether to connect over TCP/IP or over UNIX socket based on the host name. Specifically "localhost" will force it to use UNIX socket (this is the default and generally recommended mode) and "127.0.0.1" will force TCP/IP usage. Refer to MySQL manual for more details.

Example:

sql_host = localhost

11.1.3. sql_port

SQL server IP port to connect to. Optional, default is 3306 for mysql source type and 5432 for pgsql type. Applies to SQL source types (mysql, pgsql, mssql) only. Note that it depends on sql_host setting whether this value will actually be used.

Example:

sql_port = 3306

11.1.4. sql_user

SQL user to use when connecting to sql_host. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only.

Example:

sql_user = test

11.1.5. sql_pass

SQL user password to use when connecting to sql_host. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only.

Example:

sql_pass = mysecretpassword

11.1.6. sql_db

SQL database (in MySQL terms) to use after the connection and perform further queries within. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only.

Example:

sql_db = test

11.1.7. sql_sock

UNIX socket name to connect to for local SQL servers. Optional, default value is empty (use client library default settings). Applies to SQL source types (mysql, pgsql, mssql) only.

On Linux, it would typically be /var/lib/mysql/mysql.sock. On FreeBSD, it would typically be /tmp/mysql.sock. Note that it depends on sql_host setting whether this value will actually be used.

Example:

sql_sock = /tmp/mysql.sock

11.1.8. mysql_connect_flags

MySQL client connection flags. Optional, default value is 0 (do not set any flags). Applies to mysql source type only.

This option must contain an integer value with the sum of the flags. The value will be passed to mysql_real_connect() verbatim. The flags are enumerated in mysql_com.h include file. Flags that are especially interesting in regard to indexing, with their respective values, are as follows:

  • CLIENT_COMPRESS = 32; can use compression protocol

  • CLIENT_SSL = 2048; switch to SSL after handshake

  • CLIENT_SECURE_CONNECTION = 32768; new 4.1 authentication

For instance, you can specify 2080 (2048+32) to use both compression and SSL, or 32768 to use new authentication only. Initially, this option was introduced to be able to use compression when the indexer and mysqld are on different hosts. Compression on 1 Gbps links is most likely to hurt indexing time though it reduces network traffic, both in theory and in practice. However, enabling compression on 100 Mbps links may improve indexing time significantly (upto 20-30% of the total indexing time improvement was reported). Your mileage may vary.

Example:

mysql_connect_flags = 32 # enable compression

11.1.9. mysql_ssl_cert, mysql_ssl_key, mysql_ssl_ca

SSL certificate settings to use for connecting to MySQL server. Optional, default values are empty strings (do not use SSL). Applies to mysql source type only.

These directives let you set up secure SSL connection between indexer and MySQL. The details on creating the certificates and setting up MySQL server can be found in MySQL documentation.

Example:

mysql_ssl_cert = /etc/ssl/client-cert.pem
mysql_ssl_key = /etc/ssl/client-key.pem
mysql_ssl_ca = /etc/ssl/cacert.pem

11.1.10. odbc_dsn

ODBC DSN to connect to. Mandatory, no default value. Applies to odbc source type only.

ODBC DSN (Data Source Name) specifies the credentials (host, user, password, etc) to use when connecting to ODBC data source. The format depends on specific ODBC driver used.

Example:

odbc_dsn = Driver={Oracle ODBC Driver};Dbq=myDBName;Uid=myUsername;Pwd=myPassword

11.1.11. sql_query_pre

Pre-fetch query, or pre-query. Multi-value, optional, default is empty list of queries. Applies to SQL source types (mysql, pgsql, mssql) only.

Multi-value means that you can specify several pre-queries. They are executed before the main fetch query, and they will be exectued exactly in order of appeareance in the configuration file. Pre-query results are ignored.

Pre-queries are useful in a lot of ways. They are used to setup encoding, mark records that are going to be indexed, update internal counters, set various per-connection SQL server options and variables, and so on.

Perhaps the most frequent pre-query usage is to specify the encoding that the server will use for the rows it returnes. It must match the encoding that Sphinx expects (as specified by charset_type and charset_table options). Two MySQL specific examples of setting the encoding are: 

sql_query_pre = SET CHARACTER_SET_RESULTS=cp1251
sql_query_pre = SET NAMES utf8

Also specific to MySQL sources, it is useful to disable query cache (for indexer connection only) in pre-query, because indexing queries are not going to be re-run frequently anyway, and there's no sense in caching their results. That could be achieved with: 

sql_query_pre = SET SESSION query_cache_type=OFF

Example:

sql_query_pre = SET NAMES utf8
sql_query_pre = SET SESSION query_cache_type=OFF

11.1.12. sql_query

Main document fetch query. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only.

There can be only one main query. This is the query which is used to retrieve documents from SQL server. You can specify up to 32 full-text fields (formally, upto SPH_MAX_FIELDS from sphinx.h), and an arbitrary amount of attributes. All of the columns that are neither document ID (the first one) nor attributes will be full-text indexed.

Document ID MUST be the very first field, and it MUST BE UNIQUE UNSIGNED POSITIVE (NON-ZERO, NON-NEGATIVE) INTEGER NUMBER. It can be either 32-bit or 64-bit, depending on how you built Sphinx; by default it builds with 32-bit IDs support but --enable-id64 option to configure allows to build with 64-bit document and word IDs support.

Example:

sql_query = \
	SELECT id, group_id, UNIX_TIMESTAMP(date_added) AS date_added, \
		title, content \
	FROM documents

11.1.13. sql_joined_field

Joined/payload field fetch query. Multi-value, optional, default is empty list of queries. Applies to SQL source types (mysql, pgsql, mssql) only.

sql_joined_field lets you use two different features: joined fields, and payloads (payload fields). It's syntax is as follows: 

sql_joined_field = FIELD-NAME 'from'  ( 'query' | 'payload-query' ); \
    QUERY [ ; RANGE-QUERY ]

where

  • FIELD-NAME is a joined/payload field name;

  • QUERY is an SQL query that must fetch values to index.

  • RANGE-QUERY is an optional SQL query that fetches a range of values to index. (Added in version 2.0.1-beta.)

Joined fields let you avoid JOIN and/or GROUP_CONCAT statements in the main document fetch query (sql_query). This can be useful when SQL-side JOIN is slow, or needs to be offloaded on Sphinx side, or simply to emulate MySQL-specific GROUP_CONCAT funcionality in case your database server does not support it.

The query must return exactly 2 columns: document ID, and text to append to a joined field. Document IDs can be duplicate, but they must be in ascending order. All the text rows fetched for a given ID will be concatented together, and the concatenation result will be indexed as the entire contents of a joined field. Rows will be concatenated in the order returned from the query, and separating whitespace will be inserted between them. For instance, if joined field query returns the following rows: 

( 1, 'red' )
( 1, 'right' )
( 1, 'hand' )
( 2, 'mysql' )
( 2, 'sphinx' )

then the indexing results would be equivalent to that of adding a new text field with a value of 'red right hand' to document 1 and 'mysql sphinx' to document 2.

Joined fields are only indexed differently. There are no other differences between joined fields and regular text fields.

Starting with 2.0.1-beta, ranged queries can be used when a single query is not efficient enough or does not work because of the database driver limitations. It works similar to the ranged queries in the main indexing loop, see Section 3.7, “Ranged queries”. The range will be queried for and fetched upfront once, then multiple queries with different $start and $end substitutions will be run to fetch the actual data.

Payloads let you create a special field in which, instead of keyword positions, so-called user payloads are stored. Payloads are custom integer values attached to every keyword. They can then be used in search time to affect the ranking.

The payload query must return exactly 3 columns: document ID; keyword; and integer payload value. Document IDs can be duplicate, but they must be in ascending order. Payloads must be unsigned integers within 24-bit range, ie. from 0 to 16777215. For reference, payloads are currently internally stored as in-field keyword positions, but that is not guaranteed and might change in the future.

Currently, the only method to account for payloads is to use SPH_RANK_PROXIMITY_BM25 ranker. On indexes with payload fields, it will automatically switch to a variant that matches keywords in those fields, computes a sum of matched payloads multiplied by field wieghts, and adds that sum to the final rank.

Example:

sql_joined_field = \
	tagstext from query; \
	SELECT docid, CONCAT('tag',tagid) FROM tags ORDER BY docid ASC

11.1.14. sql_query_range

Range query setup. Optional, default is empty. Applies to SQL source types (mysql, pgsql, mssql) only.

Setting this option enables ranged document fetch queries (see Section 3.7, “Ranged queries”). Ranged queries are useful to avoid notorious MyISAM table locks when indexing lots of data. (They also help with other less notorious issues, such as reduced performance caused by big result sets, or additional resources consumed by InnoDB to serialize big read transactions.)

The query specified in this option must fetch min and max document IDs that will be used as range boundaries. It must return exactly two integer fields, min ID first and max ID second; the field names are ignored.

When ranged queries are enabled, sql_query will be required to contain $start and $end macros (because it obviously would be a mistake to index the whole table many times over). Note that the intervals specified by $start..$end will not overlap, so you should not remove document IDs that are exactly equal to $start or $end from your query. The example in Section 3.7, “Ranged queries”) illustrates that; note how it uses greater-or-equal and less-or-equal comparisons.

Example:

sql_query_range = SELECT MIN(id),MAX(id) FROM documents

11.1.15. sql_range_step

Range query step. Optional, default is 1024. Applies to SQL source types (mysql, pgsql, mssql) only.

Only used when ranged queries are enabled. The full document IDs interval fetched by sql_query_range will be walked in this big steps. For example, if min and max IDs fetched are 12 and 3456 respectively, and the step is 1000, indexer will call sql_query several times with the following substitutions:

  • $start=12, $end=1011

  • $start=1012, $end=2011

  • $start=2012, $end=3011

  • $start=3012, $end=3456

Example:

sql_range_step = 1000

11.1.16. sql_query_killlist

Kill-list query. Optional, default is empty (no query). Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 0.9.9-rc1.

This query is expected to return a number of 1-column rows, each containing just the document ID. The returned document IDs are stored within an index. Kill-list for a given index suppresses results from other indexes, depending on index order in the query. The intended use is to help implement deletions and updates on existing indexes without rebuilding (actually even touching them), and especially to fight phantom results problem.

Let us dissect an example. Assume we have two indexes, 'main' and 'delta'. Assume that documents 2, 3, and 5 were deleted since last reindex of 'main', and documents 7 and 11 were updated (ie. their text contents were changed). Assume that a keyword 'test' occurred in all these mentioned documents when we were indexing 'main'; still occurs in document 7 as we index 'delta'; but does not occur in document 11 any more. We now reindex delta and then search through both these indexes in proper (least to most recent) order: 

$res = $cl->Query ( "test", "main delta" );

First, we need to properly handle deletions. The result set should not contain documents 2, 3, or 5. Second, we also need to avoid phantom results. Unless we do something about it, document 11 will appear in search results! It will be found in 'main' (but not 'delta'). And it will make it to the final result set unless something stops it.

Kill-list, or K-list for short, is that something. Kill-list attached to 'delta' will suppress the specified rows from all the preceding indexes, in this case just 'main'. So to get the expected results, we should put all the updated and deleted document IDs into it.

Example:

sql_query_killlist = \
	SELECT id FROM documents WHERE updated_ts>=@last_reindex UNION \
	SELECT id FROM documents_deleted WHERE deleted_ts>=@last_reindex

11.1.17. sql_attr_uint

Unsigned integer attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only.

The column value should fit into 32-bit unsigned integer range. Values outside this range will be accepted but wrapped around. For instance, -1 will be wrapped around to 2^32-1 or 4,294,967,295.

You can specify bit count for integer attributes by appending ':BITCOUNT' to attribute name (see example below). Attributes with less than default 32-bit size, or bitfields, perform slower. But they require less RAM when using extern storage: such bitfields are packed together in 32-bit chunks in .spa attribute data file. Bit size settings are ignored if using inline storage.

Example:

sql_attr_uint = group_id
sql_attr_uint = forum_id:9 # 9 bits for forum_id

11.1.18. sql_attr_bool

Boolean attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Equivalent to sql_attr_uint declaration with a bit count of 1.

Example:

sql_attr_bool = is_deleted # will be packed to 1 bit

11.1.19. sql_attr_bigint

64-bit signed integer attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Note that unlike sql_attr_uint, these values are signed. Introduced in version 0.9.9-rc1.

Example:

sql_attr_bigint = my_bigint_id

11.1.20. sql_attr_timestamp

UNIX timestamp attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only.

Timestamps can store date and time in the range of Jan 01, 1970 to Jan 19, 2038 with a precision of one second. The expected column value should be a timestamp in UNIX format, ie. 32-bit unsigned integer number of seconds elapsed since midnight, January 01, 1970, GMT. Timestamps are internally stored and handled as integers everywhere. But in addition to working with timestamps as integers, it's also legal to use them along with different date-based functions, such as time segments sorting mode, or day/week/month/year extraction for GROUP BY.

Note that DATE or DATETIME column types in MySQL can not be directly used as timestamp attributes in Sphinx; you need to explicitly convert such columns using UNIX_TIMESTAMP function (if data is in range).

Note timestamps can not represent dates before January 01, 1970, and UNIX_TIMESTAMP() in MySQL will not return anything expected. If you only needs to work with dates, not times, consider TO_DAYS() function in MySQL instead.

Example:

sql_attr_timestamp = UNIX_TIMESTAMP(added_datetime) AS added_ts

11.1.21. sql_attr_str2ordinal

Ordinal string number attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only.

This attribute type (so-called ordinal, for brevity) is intended to allow sorting by string values, but without storing the strings themselves. When indexing ordinals, string values are fetched from database, temporarily stored, sorted, and then replaced by their respective ordinal numbers in the array of sorted strings. So, the ordinal number is an integer such that sorting by it produces the same result as if lexicographically sorting by original strings. by string values lexicographically.

Earlier versions could consume a lot of RAM for indexing ordinals. Starting with revision r1112, ordinals accumulation and sorting also runs in fixed memory (at the cost of using additional temporary disk space), and honors mem_limit settings.

Ideally the strings should be sorted differently, depending on the encoding and locale. For instance, if the strings are known to be Russian text in KOI8R encoding, sorting the bytes 0xE0, 0xE1, and 0xE2 should produce 0xE1, 0xE2 and 0xE0, because in KOI8R value 0xE0 encodes a character that is (noticeably) after characters encoded by 0xE1 and 0xE2. Unfortunately, Sphinx does not support that at the moment and will simply sort the strings bytewise.

Note that the ordinals are by construction local to each index, and it's therefore impossible to merge ordinals while retaining the proper order. The processed strings are replaced by their sequential number in the index they occurred in, but different indexes have different sets of strings. For instance, if 'main' index contains strings "aaa", "bbb", "ccc", and so on up to "zzz", they'll be assigned numbers 1, 2, 3, and so on up to 26, respectively. But then if 'delta' only contains "zzz" the assigned number will be 1. And after the merge, the order will be broken. Unfortunately, this is impossible to workaround without storing the original strings (and once Sphinx supports storing the original strings, ordinals will not be necessary any more).

Example:

sql_attr_str2ordinal = author_name

11.1.22. sql_attr_float

Floating point attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only.

The values will be stored in single precision, 32-bit IEEE 754 format. Represented range is approximately from 1e-38 to 1e+38. The amount of decimal digits that can be stored precisely is approximately 7. One important usage of the float attributes is storing latitude and longitude values (in radians), for further usage in query-time geosphere distance calculations.

Example:

sql_attr_float = lat_radians
sql_attr_float = long_radians

11.1.23. sql_attr_multi

Multi-valued attribute (MVA) declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only.

Plain attributes only allow to attach 1 value per each document. However, there are cases (such as tags or categories) when it is desired to attach multiple values of the same attribute and be able to apply filtering or grouping to value lists.

The declaration format is as follows (backslashes are for clarity only; everything can be declared in a single line as well): 

sql_attr_multi = ATTR-TYPE ATTR-NAME 'from' SOURCE-TYPE \
	[;QUERY] \
	[;RANGE-QUERY]

where

  • ATTR-TYPE is 'uint' or 'timestamp'

  • SOURCE-TYPE is 'field', 'query', or 'ranged-query'

  • QUERY is SQL query used to fetch all ( docid, attrvalue ) pairs

  • RANGE-QUERY is SQL query used to fetch min and max ID values, similar to 'sql_query_range'

Example:

sql_attr_multi = uint tag from query; SELECT id, tag FROM tags
sql_attr_multi = uint tag from ranged-query; \
	SELECT id, tag FROM tags WHERE id>=$start AND id<=$end; \
	SELECT MIN(id), MAX(id) FROM tags

11.1.24. sql_attr_string

String attribute declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta.

String attributes can store arbitrary strings attached to every document. There's a fixed size limit of 4 MB per value. Also, searchd will currently cache all the values in RAM, which is an additional implicit limit.

As of 1.10-beta, strings can only be used for storage and retrieval. They can not participate in expressions, be used for filtering, sorting, or grouping (ie. in WHERE, ORDER or GROUP clauses). Note that attributes declared using sql_attr_string will not be full-text indexed; you can use sql_field_string directive for that.

Example:

sql_attr_string = title # will be stored but will not be indexed

11.1.25. sql_attr_str2wordcount

Word-count attribute declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta.

Word-count attribute takes a string column, tokenizes it according to index settings, and stores the resulting number of tokens in an attribute. This number of tokens ("word count") is a normal integer that can be later used, for instance, in custom ranking expressions (boost shorter titles, help identify exact field matches, etc).

Example:

sql_attr_str2wordcount = title_wc

11.1.26. sql_column_buffers

Per-column buffer sizes. Optional, default is empty (deduce the sizes automatically). Applies to odbc, mssql source types only. Introduced in version 2.0.1-beta.

ODBC and MS SQL drivers sometimes can not return the maximum actual column size to be expected. For instance, NVARCHAR(MAX) columns always report their length as 2147483647 bytes to indexer even though the actually used length is likely considerably less. However, the receiving buffers still need to be allocated upfront, and their sizes have to be determined. When the driver does not report the column length at all, Sphinx allocates default 1 KB buffers for each non-char column, and 1 MB buffers for each char column. Driver-reported column length also gets clamped by an upper limie of 8 MB, so in case the driver reports (almost) a 2 GB column length, it will be clamped and a 8 MB buffer will be allocated instead for that column. These hard-coded limits can be overridden using the sql_column_buffers directive, either in order to save memory on actually shorter columns, or overcome the 8 MB limit on actually longer columns. The directive values must be a comma-separated lists of selected column names and sizes: 

sql_column_buffers = <colname>=<size>[K|M] [, ...]

Example:

sql_query = SELECT id, mytitle, mycontent FROM documents
sql_column_buffers = mytitle=64K, mycontent=10M

11.1.27. sql_field_string

Combined string attribute and full-text field declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta.

sql_attr_string only stores the column value but does not full-text index it. In some cases it might be desired to both full-text index the column and store it as attribute. sql_field_string lets you do exactly that. Both the field and the attribute will be named the same.

Example:

sql_field_string = title # will be both indexed and stored

11.1.28. sql_field_str2wordcount

Combined word-count attribute and full-text field declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta.

sql_attr_str2wordcount only stores the column word count but does not full-text index it. In some cases it might be desired to both full-text index the column and also have the count. sql_field_str2wordcount lets you do exactly that. Both the field and the attribute will be named the same.

Example:

sql_field_str2wordcount = title # will be indexed, and counted/stored

11.1.29. sql_file_field

File based field declaration. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta.

This directive makes indexer interpret field contents as a file name, and load and index the referred file. Files larger than max_file_field_buffer in size are skipped. Any errors during the file loading (IO errors, missed limits, etc) will be reported as indexing warnings and will not early terminate the indexing. No content will be indexed for such files.

Example:

sql_file_field = my_file_path # load and index files referred to by my_file_path

11.1.30. sql_query_post

Post-fetch query. Optional, default value is empty. Applies to SQL source types (mysql, pgsql, mssql) only.

This query is executed immediately after sql_query completes successfully. When post-fetch query produces errors, they are reported as warnings, but indexing is not terminated. It's result set is ignored. Note that indexing is not yet completed at the point when this query gets executed, and further indexing still may fail. Therefore, any permanent updates should not be done from here. For instance, updates on helper table that permanently change the last successfully indexed ID should not be run from post-fetch query; they should be run from post-index query instead.

Example:

sql_query_post = DROP TABLE my_tmp_table

11.1.31. sql_query_post_index

Post-index query. Optional, default value is empty. Applies to SQL source types (mysql, pgsql, mssql) only.

This query is executed when indexing is fully and succesfully completed. If this query produces errors, they are reported as warnings, but indexing is not terminated. It's result set is ignored. $maxid macro can be used in its text; it will be expanded to maximum document ID which was actually fetched from the database during indexing. If no documents were indexed, $maxid will be expanded to 0.

Example:

sql_query_post_index = REPLACE INTO counters ( id, val ) \
    VALUES ( 'max_indexed_id', $maxid )

11.1.32. sql_ranged_throttle

Ranged query throttling period, in milliseconds. Optional, default is 0 (no throttling). Applies to SQL source types (mysql, pgsql, mssql) only.

Throttling can be useful when indexer imposes too much load on the database server. It causes the indexer to sleep for given amount of milliseconds once per each ranged query step. This sleep is unconditional, and is performed before the fetch query.

Example:

sql_ranged_throttle = 1000 # sleep for 1 sec before each query step

11.1.33. sql_query_info

Document info query. Optional, default is empty. Applies to mysql source type only.

Only used by CLI search to fetch and display document information, only works with MySQL at the moment, and only intended for debugging purposes. This query fetches the row that will be displayed by CLI search utility for each document ID. It is required to contain $id macro that expands to the queried document ID.

Example:

sql_query_info = SELECT * FROM documents WHERE id=$id

11.1.34. xmlpipe_command

Shell command that invokes xmlpipe stream producer. Mandatory. Applies to xmlpipe and xmlpipe2 source types only.

Specifies a command that will be executed and which output will be parsed for documents. Refer to Section 3.8, “xmlpipe data source” or Section 3.9, “xmlpipe2 data source” for specific format description.

Example:

xmlpipe_command = cat /home/sphinx/test.xml

11.1.35. xmlpipe_field

xmlpipe field declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Refer to Section 3.9, “xmlpipe2 data source”.

Example:

xmlpipe_field = subject
xmlpipe_field = content

11.1.36. xmlpipe_field_string

xmlpipe field and string attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Refer to Section 3.9, “xmlpipe2 data source”. Introduced in version 1.10-beta.

Makes the specified XML element indexed as both a full-text field and a string attribute. Equivalent to <sphinx:field name="field" attr="string"/> declaration within the XML file.

Example:

xmlpipe_field_string = subject

11.1.37. xmlpipe_field_wordcount

xmlpipe field and word count attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Refer to Section 3.9, “xmlpipe2 data source”. Introduced in version 1.10-beta.

Makes the specified XML element indexed as both a full-text field and a word count attribute. Equivalent to <sphinx:field name="field" attr="wordcount"/> declaration within the XML file.

Example:

xmlpipe_field_wordcount = subject

11.1.38. xmlpipe_attr_uint

xmlpipe integer attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_uint.

Example:

xmlpipe_attr_uint = author

11.1.39. xmlpipe_attr_bool

xmlpipe boolean attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_bool.

Example:

xmlpipe_attr_bool = is_deleted # will be packed to 1 bit

11.1.40. xmlpipe_attr_timestamp

xmlpipe UNIX timestamp attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_timestamp.

Example:

xmlpipe_attr_timestamp = published

11.1.41. xmlpipe_attr_str2ordinal

xmlpipe string ordinal attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_str2ordinal.

Example:

xmlpipe_attr_str2ordinal = author_sort

11.1.42. xmlpipe_attr_float

xmlpipe floating point attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_float.

Example:

xmlpipe_attr_float = lat_radians
xmlpipe_attr_float = long_radians

11.1.43. xmlpipe_attr_multi

xmlpipe MVA attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only.

This setting declares an MVA attribute tag in xmlpipe2 stream. The contents of the specified tag will be parsed and a list of integers that will constitute the MVA will be extracted, similar to how sql_attr_multi parses SQL column contents when 'field' MVA source type is specified.

Example:

xmlpipe_attr_multi = taglist

11.1.44. xmlpipe_attr_string

xmlpipe string declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Introduced in version 1.10-beta.

This setting declares a string attribute tag in xmlpipe2 stream. The contents of the specified tag will be parsed and stored as a string value.

Example:

xmlpipe_attr_string = subject

11.1.45. xmlpipe_fixup_utf8

Perform Sphinx-side UTF-8 validation and filtering to prevent XML parser from choking on non-UTF-8 documents. Optional, default is 0. Applies to xmlpipe2 source type only.

Under certain occasions it might be hard or even impossible to guarantee that the incoming XMLpipe2 document bodies are in perfectly valid and conforming UTF-8 encoding. For instance, documents with national single-byte encodings could sneak into the stream. libexpat XML parser is fragile, meaning that it will stop processing in such cases. UTF8 fixup feature lets you avoid that. When fixup is enabled, Sphinx will preprocess the incoming stream before passing it to the XML parser and replace invalid UTF-8 sequences with spaces.

Example:

xmlpipe_fixup_utf8 = 1

11.1.46. mssql_winauth

MS SQL Windows authentication flag. Boolean, optional, default value is 0 (false). Applies to mssql source type only. Introduced in version 0.9.9-rc1.

Whether to use currently logged in Windows account credentials for authentication when connecting to MS SQL Server. Note that when running searchd as a service, account user can differ from the account you used to install the service.

Example:

mssql_winauth = 1

11.1.47. mssql_unicode

MS SQL encoding type flag. Boolean, optional, default value is 0 (false). Applies to mssql source type only. Introduced in version 0.9.9-rc1.

Whether to ask for Unicode or single-byte data when querying MS SQL Server. This flag must be in sync with charset_type directive; that is, to index Unicode data, you must set both charset_type in the index (to 'utf-8') and mssql_unicode in the source (to 1). For reference, MS SQL will actually return data in UCS-2 encoding instead of UTF-8, but Sphinx will automatically handle that.

Example:

mssql_unicode = 1

11.1.48. unpack_zlib

Columns to unpack using zlib (aka deflate, aka gunzip). Multi-value, optional, default value is empty list of columns. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 0.9.9-rc1.

Columns specified using this directive will be unpacked by indexer using standard zlib algorithm (called deflate and also implemented by gunzip). When indexing on a different box than the database, this lets you offload the database, and save on network traffic. The feature is only available if zlib and zlib-devel were both available during build time.

Example:

unpack_zlib = col1
unpack_zlib = col2

11.1.49. unpack_mysqlcompress

Columns to unpack using MySQL UNCOMPRESS() algorithm. Multi-value, optional, default value is empty list of columns. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 0.9.9-rc1.

Columns specified using this directive will be unpacked by indexer using modified zlib algorithm used by MySQL COMPRESS() and UNCOMPRESS() functions. When indexing on a different box than the database, this lets you offload the database, and save on network traffic. The feature is only available if zlib and zlib-devel were both available during build time.

Example:

unpack_mysqlcompress = body_compressed
unpack_mysqlcompress = description_compressed

11.1.50. unpack_mysqlcompress_maxsize

Buffer size for UNCOMPRESS()ed data. Optional, default value is 16M. Introduced in version 0.9.9-rc1.

When using unpack_mysqlcompress, due to implementation intrincacies it is not possible to deduce the required buffer size from the compressed data. So the buffer must be preallocated in advance, and unpacked data can not go over the buffer size. This option lets you control the buffer size, both to limit indexer memory use, and to enable unpacking of really long data fields if necessary.

Example:

unpack_mysqlcompress_maxsize = 1M

11.2. Index configuration options

11.2.1. type

Index type. Known values are 'plain', 'distributed', and 'rt'. Optional, default is 'plain' (plain local index).

Sphinx supports several different types of indexes. Versions 0.9.x supported two index types: plain local indexes that are stored and processed on the local machine; and distributed indexes, that involve not only local searching but querying remote searchd instances over the network as well (see Section 5.8, “Distributed searching”). Version 1.10-beta also adds support for so-called real-time indexes (or RT indexes for short) that are also stored and processed locally, but additionally allow for on-the-fly updates of the full-text index (see Chapter 4, Real-time indexes). Note that attributes can be updated on-the-fly using either plain local indexes or RT ones.

Index type setting lets you choose the needed type. By default, plain local index type will be assumed.

Example:

type = distributed

11.2.2. source

Adds document source to local index. Multi-value, mandatory.

Specifies document source to get documents from when the current index is indexed. There must be at least one source. There may be multiple sources, without any restrictions on the source types: ie. you can pull part of the data from MySQL server, part from PostgreSQL, part from the filesystem using xmlpipe2 wrapper.

However, there are some restrictions on the source data. First, document IDs must be globally unique across all sources. If that condition is not met, you might get unexpected search results. Second, source schemas must be the same in order to be stored within the same index.

No source ID is stored automatically. Therefore, in order to be able to tell what source the matched document came from, you will need to store some additional information yourself. Two typical approaches include:

  1. mangling document ID and encoding source ID in it: 

    source src1
{
	sql_query = SELECT id*10+1, ... FROM table1
	...
}

source src2
{
	sql_query = SELECT id*10+2, ... FROM table2
	...
}

  2. storing source ID simply as an attribute: 

    source src1
{
	sql_query = SELECT id, 1 AS source_id FROM table1
	sql_attr_uint = source_id
	...
}

source src2
{
	sql_query = SELECT id, 2 AS source_id FROM table2
	sql_attr_uint = source_id
	...
}

Example:

source = srcpart1
source = srcpart2
source = srcpart3

11.2.3. path

Index files path and file name (without extension). Mandatory.

Path specifies both directory and file name, but without extension. indexer will append different extensions to this path when generating final names for both permanent and temporary index files. Permanent data files have several different extensions starting with '.sp'; temporary files' extensions start with '.tmp'. It's safe to remove .tmp* files is if indexer fails to remove them automatically.

For reference, different index files store the following data:

  • .spa stores document attributes (used in extern docinfo storage mode only);

  • .spd stores matching document ID lists for each word ID;

  • .sph stores index header information;

  • .spi stores word lists (word IDs and pointers to .spd file);

  • .spk stores kill-lists;

  • .spm stores MVA data;

  • .spp stores hit (aka posting, aka word occurence) lists for each word ID;

  • .sps stores string attribute data.

Example:

path = /var/data/test1

11.2.4. docinfo

Document attribute values (docinfo) storage mode. Optional, default is 'extern'. Known values are 'none', 'extern' and 'inline'.

Docinfo storage mode defines how exactly docinfo will be physically stored on disk and RAM. "none" means that there will be no docinfo at all (ie. no attributes). Normally you need not to set "none" explicitly because Sphinx will automatically select "none" when there are no attributes configured. "inline" means that the docinfo will be stored in the .spd file, along with the document ID lists. "extern" means that the docinfo will be stored separately (externally) from document ID lists, in a special .spa file.

Basically, externally stored docinfo must be kept in RAM when querying. for performance reasons. So in some cases "inline" might be the only option. However, such cases are infrequent, and docinfo defaults to "extern". Refer to Section 3.2, “Attributes” for in-depth discussion and RAM usage estimates.

Example:

docinfo = inline

11.2.5. mlock

Memory locking for cached data. Optional, default is 0 (do not call mlock()).

For search performance, searchd preloads a copy of .spa and .spi files in RAM, and keeps that copy in RAM at all times. But if there are no searches on the index for some time, there are no accesses to that cached copy, and OS might decide to swap it out to disk. First queries to such "cooled down" index will cause swap-in and their latency will suffer.

Setting mlock option to 1 makes Sphinx lock physical RAM used for that cached data using mlock(2) system call, and that prevents swapping (see man 2 mlock for details). mlock(2) is a privileged call, so it will require searchd to be either run from root account, or be granted enough privileges otherwise. If mlock() fails, a warning is emitted, but index continues working.

Example:

mlock = 1

11.2.6. morphology

A list of morphology preprocessors to apply. Optional, default is empty (do not apply any preprocessor).

Morphology preprocessors can be applied to the words being indexed to replace different forms of the same word with the base, normalized form. For instance, English stemmer will normalize both "dogs" and "dog" to "dog", making search results for both searches the same.

Built-in preprocessors include English stemmer, Russian stemmer (that supports UTF-8 and Windows-1251 encodings), Soundex, and Metaphone. The latter two replace the words with special phonetic codes that are equal is words are phonetically close. Additional stemmers provided by Snowball project libstemmer library can be enabled at compile time using --with-libstemmer configure option. Built-in English and Russian stemmers should be faster than their libstemmer counterparts, but can produce slightly different results, because they are based on an older version. Metaphone implementation is based on Double Metaphone algorithm and indexes the primary code.

Built-in values that are available for use in morphology option are as follows:

  • none - do not perform any morphology processing;

  • stem_en - apply Porter's English stemmer;

  • stem_ru - apply Porter's Russian stemmer;

  • stem_enru - apply Porter's English and Russian stemmers;

  • stem_cz - apply Czech stemmer;

  • soundex - replace keywords with their SOUNDEX code;

  • metaphone - replace keywords with their METAPHONE code.

Additional values provided by libstemmer are in 'libstemmer_XXX' format, where XXX is libstemmer algorithm codename (refer to libstemmer_c/libstemmer/modules.txt for a complete list).

Several stemmers can be specified (comma-separated). They will be applied to incoming words in the order they are listed, and the processing will stop once one of the stemmers actually modifies the word. Also when wordforms feature is enabled the word will be looked up in word forms dictionary first, and if there is a matching entry in the dictionary, stemmers will not be applied at all. Or in other words, wordforms can be used to implement stemming exceptions.

Example:

morphology = stem_en, libstemmer_sv

11.2.7. dict

The keywords dictionary type. Known values are 'crc' and 'keywords'. Optional, default is 'crc'. Introduced in version 2.0.1-beta.

The default dictionary type in Sphinx, and the only one available until version 2.0.1-beta, is a so-called CRC dictionary which never stores the original keyword text in the index. Instead, keywords are replaced with their control sum value (either CRC32 or FNV64, depending whether Sphinx was built with --enable-id64) both when searching and indexing, and that value is used internally in the index.

That approach has two drawbacks. First, in CRC32 case there is a chance of control sum collision between several pairs of different keywords, growing quadratically with the number of unique keywords in the index. (FNV64 case is unaffected in practice, as a chance of a single FNV64 collision in a dictionary of 1 billion entries is approximately 1:16, or 6.25 percent. And most dictionaries will be much more compact that a billion keywords, as a typical spoken human language has in the region of 1 to 10 million word forms.) Second, and more importantly, substring searches are not directly possible with control sums. Sphinx alleviated that by pre-indexing all the possible substrings as separate keywords (see Section 11.2.18, “min_prefix_len”, Section 11.2.19, “min_infix_len” directives). That actually has an added benefit of matching substrings in the quickest way possible. But at the same time pre-indexing all substrings grows the index size a lot (factors of 3-10x and even more would not be unusual) and impacts the indexing time respectively, rendering substring searches on big indexes rather impractical.

Keywords dictionary, introduced in 2.0.1-beta, fixes both these drawbacks. It stores the keywords in the index and performs search-time wildcard expansion. For example, a search for a 'test*' prefix could internally expand to 'test|tests|testing' query based on the dictionary contents. That expansion is fully transparent to the application, except that the separate per-keyword statistics for all the actually matched keywords would now also be reported.

Indexing with keywords dictionary should be 1.1x to 1.3x slower compared to regular, non-substring indexing - but times faster compared to substring indexing (either prefix or infix). Index size should only be slightly bigger that than of the regular non-substring index, with a 1..10% percent total difference Regular keyword searching time must be very close or identical across all three discussed index kinds (CRC non-substring, CRC substring, keywords). Substring searching time can vary greatly depending on how many actual keywords match the given substring (in other words, into how many keywords does the search term expand). The maximum number of keywords matched is restricted by the expansion_limit directive.

Essentially, keywords and CRC dictionaries represent the two different trade-off substring searching decisions. You can choose to either sacrifice indexing time and index size in favor of top-speed worst-case searches (CRC dictionary), or only slightly impact indexing time but sacrifice worst-case searching time when the prefix expands into very many keywords (keywords dictionary).

Example:

dict = keywords

11.2.8. index_sp

Whether to detect and index sentence and paragraph boundaries. Optional, default is 0 (do not detect and index). Introduced in version 2.0.1-beta.

This directive enables sentence and paragraph boundary indexing. It's required for the SENTENCE and PARAGRAPH operators to work. Sentence boundary detection is based on plain text analysis, so you only need to set index_sp = 1 to enable it. Paragraph detection is however based on HTML markup, and happens in the HTML stripper. So to index paragraph locations you also need to enable the stripper by specifying html_strip = 1. Both types of boundaries are detected based on a few built-in rules enumerated just below.

Sentence boundary detection rules are as follows.

  • Question and excalamation signs (? and !) are always a sentence boundary.

  • Trailing dot (.) is a sentence boundary, except:

    • When followed by a letter. That's considered a part of an abbreviation (as in "S.T.A.L.K.E.R" or "Goldman Sachs S.p.A.").

    • When followed by a comma. That's considered an abbreviation followed by a comma (as in "Telecom Italia S.p.A., founded in 1994").

    • When followed by a space and a small letter. That's considered an abbreviation within a sentence (as in "News Corp. announced in Februrary").

    • When preceded by a space and a capital letter, and followed by a space. That's considered a middle initial (as in "John D. Doe").

Paragraph boundaries are inserted at every block-level HTML tag. Namely, those are (as taken from HTML 4 standard) ADDRESS, BLOCKQUOTE, CAPTION, CENTER, DD, DIV, DL, DT, H1, H2, H3, H4, H5, LI, MENU, OL, P, PRE, TABLE, TBODY, TD, TFOOT, TH, THEAD, TR, and UL.

Both sentences and paragraphs increment the keyword position counter by 1.

Example:

index_sp = 1

11.2.9. index_zones

A list of in-field HTML/XML zones to index. Optional, default is empty (do not index zones). Introduced in version 2.0.1-beta.

Zones can be formally defined as follows. Everything between an opening and a matching closing tag is called a span, and the aggregate of all spans corresponding sharing the same tag name is called a zone. For instance, everything between the occurrences of <H1> and </H1> in the document field belongs to H1 zone.

Zone indexing, enabled by index_zones directive, is an optional extension of the HTML stripper. So it will also require that the stripper is enabled (with html_strip = 1). The value of the index_zones should be a comma-separated list of those tag names and wildcards (ending with a star) that should be indexed as zones.

Zones can nest and overlap arbitrarily. The only requirement is that every opening tag has a matching tag. You can also have an arbitrary number of both zones (as in unique zone names, such as H1) and spans (all the occurrences of those H1 tags) in a document. Once indexed, zones can then be used for matching with the ZONE operator, see Section 5.3, “Extended query syntax”.

Example:

index_zones = h*, th, title

11.2.10. min_stemming_len

Minimum word length at which to enable stemming. Optional, default is 1 (stem everything). Introduced in version 0.9.9-rc1.

Stemmers are not perfect, and might sometimes produce undesired results. For instance, running "gps" keyword through Porter stemmer for English results in "gp", which is not really the intent. min_stemming_len feature lets you suppress stemming based on the source word length, ie. to avoid stemming too short words. Keywords that are shorter than the given threshold will not be stemmed. Note that keywords that are exactly as long as specified will be stemmed. So in order to avoid stemming 3-character keywords, you should specify 4 for the value. For more finely grained control, refer to wordforms feature.

Example:

min_stemming_len = 4

11.2.11. stopwords

Stopword files list (space separated). Optional, default is empty.

Stopwords are the words that will not be indexed. Typically you'd put most frequent words in the stopwords list because they do not add much value to search results but consume a lot of resources to process.

You can specify several file names, separated by spaces. All the files will be loaded. Stopwords file format is simple plain text. The encoding must match index encoding specified in charset_type. File data will be tokenized with respect to charset_table settings, so you can use the same separators as in the indexed data. The stemmers will also be applied when parsing stopwords file.

While stopwords are not indexed, they still do affect the keyword positions. For instance, assume that "the" is a stopword, that document 1 contains the line "in office", and that document 2 contains "in the office". Searching for "in office" as for exact phrase will only return the first document, as expected, even though "the" in the second one is stopped.

Example:

stopwords = /usr/local/sphinx/data/stopwords.txt
stopwords = stopwords-ru.txt stopwords-en.txt

11.2.12. wordforms

Word forms dictionary. Optional, default is empty.

Word forms are applied after tokenizing the incoming text by charset_table rules. They essentialy let you replace one word with another. Normally, that would be used to bring different word forms to a single normal form (eg. to normalize all the variants such as "walks", "walked", "walking" to the normal form "walk"). It can also be used to implement stemming exceptions, because stemming is not applied to words found in the forms list.

Dictionaries are used to normalize incoming words both during indexing and searching. Therefore, to pick up changes in wordforms file it's required to reindex and restart searchd.

Word forms support in Sphinx is designed to support big dictionaries well. They moderately affect indexing speed: for instance, a dictionary with 1 million entries slows down indexing about 1.5 times. Searching speed is not affected at all. Additional RAM impact is roughly equal to the dictionary file size, and dictionaries are shared across indexes: ie. if the very same 50 MB wordforms file is specified for 10 different indexes, additional searchd RAM usage will be about 50 MB.

Dictionary file should be in a simple plain text format. Each line should contain source and destination word forms, in exactly the same encoding as specified in charset_type, separated by "greater" sign. Rules from the charset_table will be applied when the file is loaded. So basically it's as case sensitive as your other full-text indexed data, ie. typically case insensitive. Here's the file contents sample: 

walks > walk
walked > walk
walking > walk

There is a bundled spelldump utility that helps you create a dictionary file in the format Sphinx can read from source .dict and .aff dictionary files in ispell or MySpell format (as bundled with OpenOffice).

Starting with version 0.9.9-rc1, you can map several source words to a single destination word. Because the work happens on tokens, not the source text, differences in whitespace and markup are ignored. 

core 2 duo > c2d
e6600 > c2d
core 2duo > c2d

Notice however that the destination wordforms are still always interpreted as a single keyword! Having a mapping like "St John > Saint John" will result in not matching "St John" when searching for "Saint" or "John", because the destination keyword will be "Saint John" with a space character in it (and it's barely possible to input a destination keyword with a space).

Example:

wordforms = /usr/local/sphinx/data/wordforms.txt

11.2.13. exceptions

Tokenizing exceptions file. Optional, default is empty.

Exceptions allow to map one or more tokens (including tokens with characters that would normally be excluded) to a single keyword. They are similar to wordforms in that they also perform mapping, but have a number of important differences.

Short summary of the differences is as follows:

  • exceptions are case sensitive, wordforms are not;

  • exceptions allow to detect sequences of tokens, wordforms work with single words only;

  • exceptions can use special characters that are not in charset_table, wordforms fully obey charset_table;

  • exceptions can underperform on huge dictionaries, wordforms handle millions of entries well.

The expected file format is also plain text, with one line per exception, and the line format is as follows: 

map-from-tokens => map-to-token

Example file: 

AT & T => AT&T
AT&T => AT&T
Standarten   Fuehrer => standartenfuhrer
Standarten Fuhrer => standartenfuhrer
MS Windows => ms windows
Microsoft Windows => ms windows
C++ => cplusplus
c++ => cplusplus
C plus plus => cplusplus

All tokens here are case sensitive: they will not be processed by charset_table rules. Thus, with the example exceptions file above, "At&t" text will be tokenized as two keywords "at" and "t", because of lowercase letters. On the other hand, "AT&T" will match exactly and produce single "AT&T" keyword.

Note that this map-to keyword is a) always interpereted as a single word, and b) is both case and space sensitive! In our sample, "ms windows" query will not match the document with "MS Windows" text. The query will be interpreted as a query for two keywords, "ms" and "windows". And what "MS Windows" gets mapped to is a single keyword "ms windows", with a space in the middle. On the other hand, "standartenfuhrer" will retrieve documents with "Standarten Fuhrer" or "Standarten Fuehrer" contents (capitalized exactly like this), or any capitalization variant of the keyword itself, eg. "staNdarTenfUhreR". (It won't catch "standarten fuhrer", however: this text does not match any of the listed exceptions because of case sensitivity, and gets indexed as two separate keywords.)

Whitespace in the map-from tokens list matters, but its amount does not. Any amount of the whitespace in the map-form list will match any other amount of whitespace in the indexed document or query. For instance, "AT & T" map-from token will match "AT    &  T" text, whatever the amount of space in both map-from part and the indexed text. Such text will therefore be indexed as a special "AT&T" keyword, thanks to the very first entry from the sample.

Exceptions also allow to capture special characters (that are exceptions from general charset_table rules; hence the name). Assume that you generally do not want to treat '+' as a valid character, but still want to be able search for some exceptions from this rule such as 'C++'. The sample above will do just that, totally independent of what characters are in the table and what are not.

Exceptions are applied to raw incoming document and query data during indexing and searching respectively. Therefore, to pick up changes in the file it's required to reindex and restart searchd.

Example:

exceptions = /usr/local/sphinx/data/exceptions.txt

11.2.14. min_word_len

Minimum indexed word length. Optional, default is 1 (index everything).

Only those words that are not shorter than this minimum will be indexed. For instance, if min_word_len is 4, then 'the' won't be indexed, but 'they' will be.

Example:

min_word_len = 4

11.2.15. charset_type

Character set encoding type. Optional, default is 'sbcs'. Known values are 'sbcs' and 'utf-8'.

Different encodings have different methods for mapping their internal characters codes into specific byte sequences. Two most common methods in use today are single-byte encoding and UTF-8. Their corresponding charset_type values are 'sbcs' (stands for Single Byte Character Set) and 'utf-8'. The selected encoding type will be used everywhere where the index is used: when indexing the data, when parsing the query against this index, when generating snippets, etc.

Note that while 'utf-8' implies that the decoded values must be treated as Unicode codepoint numbers, there's a family of 'sbcs' encodings that may in turn treat different byte values differently, and that should be properly reflected in your charset_table settings. For example, the same byte value of 224 (0xE0 hex) maps to different Russian letters depending on whether koi-8r or windows-1251 encoding is used.

Example:

charset_type = utf-8

11.2.16. charset_table

Accepted characters table, with case folding rules. Optional, default value depends on charset_type value.

charset_table is the main workhorse of Sphinx tokenizing process, ie. the process of extracting keywords from document text or query txet. It controls what characters are accepted as valid and what are not, and how the accepted characters should be transformed (eg. should the case be removed or not).

You can think of charset_table as of a big table that has a mapping for each and every of 100K+ characters in Unicode (or as of a small 256-character table if you're using SBCS). By default, every character maps to 0, which means that it does not occur within keywords and should be treated as a separator. Once mentioned in the table, character is mapped to some other character (most frequently, either to itself or to a lowercase letter), and is treated as a valid keyword part.

The expected value format is a commas-separated list of mappings. Two simplest mappings simply declare a character as valid, and map a single character to another single character, respectively. But specifying the whole table in such form would result in bloated and barely manageable specifications. So there are several syntax shortcuts that let you map ranges of characters at once. The complete list is as follows:

A->a

Single char mapping, declares source char 'A' as allowed to occur within keywords and maps it to destination char 'a' (but does not declare 'a' as allowed).

A..Z->a..z

Range mapping, declares all chars in source range as allowed and maps them to the destination range. Does not declare destination range as allowed. Also checks ranges' lengths (the lengths must be equal).

a

Stray char mapping, declares a character as allowed and maps it to itself. Equivalent to a->a single char mapping.

a..z

Stray range mapping, declares all characters in range as allowed and maps them to themselves. Equivalent to a..z->a..z range mapping.

A..Z/2

Checkerboard range map. Maps every pair of chars to the second char. More formally, declares odd characters in range as allowed and maps them to the even ones; also declares even characters as allowed and maps them to themselves. For instance, A..Z/2 is equivalent to A->B, B->B, C->D, D->D, ..., Y->Z, Z->Z. This mapping shortcut is helpful for a number of Unicode blocks where uppercase and lowercase letters go in such interleaved order instead of contiguous chunks.

Control characters with codes from 0 to 31 are always treated as separators. Characters with codes 32 to 127, ie. 7-bit ASCII characters, can be used in the mappings as is. To avoid configuration file encoding issues, 8-bit ASCII characters and Unicode characters must be specified in U+xxx form, where 'xxx' is hexadecimal codepoint number. This form can also be used for 7-bit ASCII characters to encode special ones: eg. use U+20 to encode space, U+2E to encode dot, U+2C to encode comma.

Example:

# 'sbcs' defaults for English and Russian
charset_table = 0..9, A..Z->a..z, _, a..z, \
	U+A8->U+B8, U+B8, U+C0..U+DF->U+E0..U+FF, U+E0..U+FF

# 'utf-8' defaults for English and Russian
charset_table = 0..9, A..Z->a..z, _, a..z, \
	U+410..U+42F->U+430..U+44F, U+430..U+44F

11.2.17. ignore_chars

Ignored characters list. Optional, default is empty.

Useful in the cases when some characters, such as soft hyphenation mark (U+00AD), should be not just treated as separators but rather fully ignored. For example, if '-' is simply not in the charset_table, "abc-def" text will be indexed as "abc" and "def" keywords. On the contrary, if '-' is added to ignore_chars list, the same text will be indexed as a single "abcdef" keyword.

The syntax is the same as for charset_table, but it's only allowed to declare characters, and not allowed to map them. Also, the ignored characters must not be present in charset_table.

Example:

ignore_chars = U+AD

11.2.18. min_prefix_len

Minimum word prefix length to index. Optional, default is 0 (do not index prefixes).

Prefix indexing allows to implement wildcard searching by 'wordstart*' wildcards (refer to enable_star option for details on wildcard syntax). When mininum prefix length is set to a positive number, indexer will index all the possible keyword prefixes (ie. word beginnings) in addition to the keywords themselves. Too short prefixes (below the minimum allowed length) will not be indexed.

For instance, indexing a keyword "example" with min_prefix_len=3 will result in indexing "exa", "exam", "examp", "exampl" prefixes along with the word itself. Searches against such index for "exam" will match documents that contain "example" word, even if they do not contain "exam" on itself. However, indexing prefixes will make the index grow significantly (because of many more indexed keywords), and will degrade both indexing and searching times.

There's no automatic way to rank perfect word matches higher in a prefix index, but there's a number of tricks to achieve that. First, you can setup two indexes, one with prefix indexing and one without it, search through both, and use SetIndexWeights() call to combine weights. Second, you can enable star-syntax and rewrite your extended-mode queries: 

# in sphinx.conf
enable_star = 1

// in query
$cl->Query ( "( keyword | keyword* ) other keywords" );

Example:

min_prefix_len = 3

11.2.19. min_infix_len

Minimum infix prefix length to index. Optional, default is 0 (do not index infixes).

Infix indexing allows to implement wildcard searching by 'start*', '*end', and '*middle*' wildcards (refer to enable_star option for details on wildcard syntax). When mininum infix length is set to a positive number, indexer will index all the possible keyword infixes (ie. substrings) in addition to the keywords themselves. Too short infixes (below the minimum allowed length) will not be indexed. For instance, indexing a keyword "test" with min_infix_len=2 will result in indexing "te", "es", "st", "tes", "est" infixes along with the word itself. Searches against such index for "es" will match documents that contain "test" word, even if they do not contain "es" on itself. However, indexing infixes will make the index grow significantly (because of many more indexed keywords), and will degrade both indexing and searching times.

There's no automatic way to rank perfect word matches higher in an infix index, but the same tricks as with prefix indexes can be applied.

Example:

min_infix_len = 3

11.2.20. prefix_fields

The list of full-text fields to limit prefix indexing to. Optional, default is empty (index all fields in prefix mode).

Because prefix indexing impacts both indexing and searching performance, it might be desired to limit it to specific full-text fields only: for instance, to provide prefix searching through URLs, but not through page contents. prefix_fields specifies what fields will be prefix-indexed; all other fields will be indexed in normal mode. The value format is a comma-separated list of field names.

Example:

prefix_fields = url, domain

11.2.21. infix_fields

The list of full-text fields to limit infix indexing to. Optional, default is empty (index all fields in infix mode).

Similar to prefix_fields, but lets you limit infix-indexing to given fields.

Example:

infix_fields = url, domain

11.2.22. enable_star

Enables star-syntax (or wildcard syntax) when searching through prefix/infix indexes. Optional, default is is 0 (do not use wildcard syntax), for compatibility with 0.9.7. Known values are 0 and 1.

This feature enables "star-syntax", or wildcard syntax, when searching through indexes which were created with prefix or infix indexing enabled. It only affects searching; so it can be changed without reindexing by simply restarting searchd.

The default value is 0, that means to disable star-syntax and treat all keywords as prefixes or infixes respectively, depending on indexing-time min_prefix_len and min_infix_len settings. The value of 1 means that star ('*') can be used at the start and/or the end of the keyword. The star will match zero or more characters.

For example, assume that the index was built with infixes and that enable_star is 1. Searching should work as follows:

  1. "abcdef" query will match only those documents that contain the exact "abcdef" word in them.

  2. "abc*" query will match those documents that contain any words starting with "abc" (including the documents which contain the exact "abc" word only);

  3. "*cde*" query will match those documents that contain any words which have "cde" characters in any part of the word (including the documents which contain the exact "cde" word only).

  4. "*def" query will match those documents that contain any words ending with "def" (including the documents that contain the exact "def" word only).

Example:

enable_star = 1

11.2.23. ngram_len

N-gram lengths for N-gram indexing. Optional, default is 0 (disable n-gram indexing). Known values are 0 and 1 (other lengths to be implemented).

N-grams provide basic CJK (Chinese, Japanese, Korean) support for unsegmented texts. The issue with CJK searching is that there could be no clear separators between the words. Ideally, the texts would be filtered through a special program called segmenter that would insert separators in proper locations. However, segmenters are slow and error prone, and it's common to index contiguous groups of N characters, or n-grams, instead.

When this feature is enabled, streams of CJK characters are indexed as N-grams. For example, if incoming text is "ABCDEF" (where A to F represent some CJK characters) and length is 1, in will be indexed as if it was "A B C D E F". (With length equal to 2, it would produce "AB BC CD DE EF"; but only 1 is supported at the moment.) Only those characters that are listed in ngram_chars table will be split this way; other ones will not be affected.

Note that if search query is segmented, ie. there are separators between individual words, then wrapping the words in quotes and using extended mode will resut in proper matches being found even if the text was not segmented. For instance, assume that the original query is BC DEF. After wrapping in quotes on the application side, it should look like "BC" "DEF" (with quotes). This query will be passed to Sphinx and internally split into 1-grams too, resulting in "B C" "D E F" query, still with quotes that are the phrase matching operator. And it will match the text even though there were no separators in the text.

Even if the search query is not segmented, Sphinx should still produce good results, thanks to phrase based ranking: it will pull closer phrase matches (which in case of N-gram CJK words can mean closer multi-character word matches) to the top.

Example:

ngram_len = 1

11.2.24. ngram_chars

N-gram characters list. Optional, default is empty.

To be used in conjunction with in ngram_len, this list defines characters, sequences of which are subject to N-gram extraction. Words comprised of other characters will not be affected by N-gram indexing feature. The value format is identical to charset_table.

Example:

ngram_chars = U+3000..U+2FA1F

11.2.25. phrase_boundary

Phrase boundary characters list. Optional, default is empty.

This list controls what characters will be treated as phrase boundaries, in order to adjust word positions and enable phrase-level search emulation through proximity search. The syntax is similar to charset_table. Mappings are not allowed and the boundary characters must not overlap with anything else.

On phrase boundary, additional word position increment (specified by phrase_boundary_step) will be added to current word position. This enables phrase-level searching through proximity queries: words in different phrases will be guaranteed to be more than phrase_boundary_step distance away from each other; so proximity search within that distance will be equivalent to phrase-level search.

Phrase boundary condition will be raised if and only if such character is followed by a separator; this is to avoid abbreviations such as S.T.A.L.K.E.R or URLs being treated as several phrases.

Example:

phrase_boundary = ., ?, !, U+2026 # horizontal ellipsis

11.2.26. phrase_boundary_step

Phrase boundary word position increment. Optional, default is 0.

On phrase boundary, current word position will be additionally incremented by this number. See phrase_boundary for details.

Example:

phrase_boundary_step = 100

11.2.27. html_strip

Whether to strip HTML markup from incoming full-text data. Optional, default is 0. Known values are 0 (disable stripping) and 1 (enable stripping).

Both HTML tags and entities and considered markup and get processed.

HTML tags are removed, their contents (i.e., everything between <P> and </P>) are left intact by default. You can choose to keep and index attributes of the tags (e.g., HREF attribute in an A tag, or ALT in an IMG one). Several well-known inline tags are completely removed, all other tags are treated as block level and replaced with whitespace. For example, 'te<B>st</B>' text will be indexed as a single keyword 'test', however, 'te<P>st</P>' will be indexed as two keywords 'te' and 'st'. Known inline tags are as follows: A, B, I, S, U, BASEFONT, BIG, EM, FONT, IMG, LABEL, SMALL, SPAN, STRIKE, STRONG, SUB, SUP, TT.

HTML entities get decoded and replaced with corresponding UTF-8 characters. Stripper supports both numeric forms (such as &#239;) and text forms (such as &oacute; or &nbsp;). All entities as specified by HTML4 standard are supported.

Stripping does not work with xmlpipe source type (it's suggested to upgrade to xmlpipe2 anyway). It should work with properly formed HTML and XHTML, but, just as most browsers, may produce unexpected results on malformed input (such as HTML with stray <'s or unclosed >'s).

Only the tags themselves, and also HTML comments, are stripped. To strip the contents of the tags too (eg. to strip embedded scripts), see html_remove_elements option. There are no restrictions on tag names; ie. everything that looks like a valid tag start, or end, or a comment will be stripped.

Example:

html_strip = 1

11.2.28. html_index_attrs

A list of markup attributes to index when stripping HTML. Optional, default is empty (do not index markup attributes).

Specifies HTML markup attributes whose contents should be retained and indexed even though other HTML markup is stripped. The format is per-tag enumeration of indexable attributes, as shown in the example below.

Example:

html_index_attrs = img=alt,title; a=title;

11.2.29. html_remove_elements

A list of HTML elements for which to strip contents along with the elements themselves. Optional, default is empty string (do not strip contents of any elements).

This feature allows to strip element contents, ie. everything that is between the opening and the closing tags. It is useful to remove embedded scripts, CSS, etc. Short tag form for empty elements (ie. <br />) is properly supported; ie. the text that follows such tag will not be removed.

The value is a comma-separated list of element (tag) names whose contents should be removed. Tag names are case insensitive.

Example:

html_remove_elements = style, script

11.2.30. local

Local index declaration in the distributed index. Multi-value, optional, default is empty.

This setting is used to declare local indexes that will be searched when given distributed index is searched. All local indexes will be searched sequentially, utilizing only 1 CPU or core; to parallelize processing, you can configure searchd to query itself (refer to Section 11.2.31, “agent” for the details). There might be several local indexes declared per each distributed index. Any local index can be mentioned several times in other distributed indexes.

Example:

local = chunk1
local = chunk2

11.2.31. agent

Remote agent declaration in the distributed index. Multi-value, optional, default is empty.

This setting is used to declare remote agents that will be searched when given distributed index is searched. The agents can be thought of as network pointers that specify host, port, and index names. In the basic case agents would correspond to remote physical machines. More formally, that is not always correct: you can point several agents to the same remote machine; or you can even point agents to the very same single instance of searchd (in order to utilize many CPUs or cores).

The value format is as follows: 

agent = specification:remote-indexes-list
specification = hostname ":" port | path

Where 'hostname' is remote host name; 'port' is remote TCP port; 'path' is Unix-domain socket path and 'remote-indexes-list' is a comma-separated list of remote index names.

All agents will be searched in parallel. However, all indexes specified for a given agent will be searched sequentially in this agent. This lets you fine-tune the configuration to the hardware. For instance, if two remote indexes are stored on the same physical HDD, it's better to configure one agent with several sequentially searched indexes to avoid HDD steping. If they are stored on different HDDs, having two agents will be advantageous, because the work will be fully parallelized. The same applies to CPUs; though CPU performance impact caused by two processes stepping on each other is somewhat smaller and frequently can be ignored at all.

On machines with many CPUs and/or HDDs, agents can be pointed to the same machine to utilize all of the hardware in parallel and reduce query latency. There is no need to setup several searchd instances for that; it's legal to configure the instance to contact itself. Here's an example setup, intended for a 4-CPU machine, that will use up to 4 CPUs in parallel to process each query: 

index dist
{
	type = distributed
	local = chunk1
	agent = localhost:9312:chunk2
	agent = localhost:9312:chunk3
	agent = localhost:9312:chunk4
}

Note how one of the chunks is searched locally and the same instance of searchd queries itself to launch searches through three other ones in parallel.

Example:

agent = localhost:9312:chunk2 # contact itself
agent = /var/run/searchd.s:chunk2
agent = searchbox2:9312:chunk3,chunk4 # search remote indexes

11.2.32. agent_blackhole

Remote blackhole agent declaration in the distributed index. Multi-value, optional, default is empty. Introduced in version 0.9.9-rc1.

agent_blackhole lets you fire-and-forget queries to remote agents. That is useful for debugging (or just testing) production clusters: you can setup a separate debugging/testing searchd instance, and forward the requests to this instance from your production master (aggregator) instance without interfering with production work. Master searchd will attempt to connect and query blackhole agent normally, but it will neither wait nor process any responses. Also, all network errors on blackhole agents will be ignored. The value format is completely identical to regular agent directive.

Example:

agent_blackhole = testbox:9312:testindex1,testindex2

11.2.33. agent_connect_timeout

Remote agent connection timeout, in milliseconds. Optional, default is 1000 (ie. 1 second).

When connecting to remote agents, searchd will wait at most this much time for connect() call to complete succesfully. If the timeout is reached but connect() does not complete, and retries are enabled, retry will be initiated.

Example:

agent_connect_timeout = 300

11.2.34. agent_query_timeout

Remote agent query timeout, in milliseconds. Optional, default is 3000 (ie. 3 seconds).

After connection, searchd will wait at most this much time for remote queries to complete. This timeout is fully separate from connection timeout; so the maximum possible delay caused by a remote agent equals to the sum of agent_connection_timeout and agent_query_timeout. Queries will not be retried if this timeout is reached; a warning will be produced instead.

Example:

agent_query_timeout = 10000 # our query can be long, allow up to 10 sec

11.2.35. preopen

Whether to pre-open all index files, or open them per each query. Optional, default is 0 (do not preopen).

This option tells searchd that it should pre-open all index files on startup (or rotation) and keep them open while it runs. Currently, the default mode is not to pre-open the files (this may change in the future). Preopened indexes take a few (currently 2) file descriptors per index. However, they save on per-query open() calls; and also they are invulnerable to subtle race conditions that may happen during index rotation under high load. On the other hand, when serving many indexes (100s to 1000s), it still might be desired to open the on per-query basis in order to save file descriptors.

This directive does not affect indexer in any way, it only affects searchd.

Example:

preopen = 1

11.2.36. ondisk_dict

Whether to keep the dictionary file (.spi) for this index on disk, or precache it in RAM. Optional, default is 0 (precache in RAM). Introduced in version 0.9.9-rc1.

The dictionary (.spi) can be either kept on RAM or on disk. The default is to fully cache it in RAM. That improves performance, but might cause too much RAM pressure, especially if prefixes or infixes were used. Enabling ondisk_dict results in 1 additional disk IO per keyword per query, but reduces memory footprint.

This directive does not affect indexer in any way, it only affects searchd.

Example:

ondisk_dict = 1

11.2.37. inplace_enable

Whether to enable in-place index inversion. Optional, default is 0 (use separate temporary files). Introduced in version 0.9.9-rc1.

inplace_enable greatly reduces indexing disk footprint, at a cost of slightly slower indexing (it uses around 2x less disk, but yields around 90-95% the original performance).

Indexing involves two major phases. The first phase collects, processes, and partially sorts documents by keyword, and writes the intermediate result to temporary files (.tmp*). The second phase fully sorts the documents, and creates the final index files. Thus, rebuilding a production index on the fly involves around 3x peak disk footprint: 1st copy for the intermediate temporary files, 2nd copy for newly constructed copy, and 3rd copy for the old index that will be serving production queries in the meantime. (Intermediate data is comparable in size to the final index.) That might be too much disk footprint for big data collections, and inplace_enable allows to reduce it. When enabled, it reuses the temporary files, outputs the final data back to them, and renames them on completion. However, this might require additional temporary data chunk relocation, which is where the performance impact comes from.

This directive does not affect searchd in any way, it only affects indexer.

Example:

inplace_enable = 1

11.2.38. inplace_hit_gap

In-place inversion fine-tuning option. Controls preallocated hitlist gap size. Optional, default is 0. Introduced in version 0.9.9-rc1.

This directive does not affect searchd in any way, it only affects indexer.

Example:

inplace_hit_gap = 1M

11.2.39. inplace_docinfo_gap

In-place inversion fine-tuning option. Controls preallocated docinfo gap size. Optional, default is 0. Introduced in version 0.9.9-rc1.

This directive does not affect searchd in any way, it only affects indexer.

Example:

inplace_docinfo_gap = 1M

11.2.40. inplace_reloc_factor

In-place inversion fine-tuning option. Controls relocation buffer size within indexing memory arena. Optional, default is 0.1. Introduced in version 0.9.9-rc1.

This directive does not affect searchd in any way, it only affects indexer.

Example:

inplace_reloc_factor = 0.1

11.2.41. inplace_write_factor

In-place inversion fine-tuning option. Controls in-place write buffer size within indexing memory arena. Optional, default is 0.1. Introduced in version 0.9.9-rc1.

This directive does not affect searchd in any way, it only affects indexer.

Example:

inplace_write_factor = 0.1

11.2.42. index_exact_words

Whether to index the original keywords along with the stemmed/remapped versions. Optional, default is 0 (do not index). Introduced in version 0.9.9-rc1.

When enabled, index_exact_words forces indexer to put the raw keywords in the index along with the stemmed versions. That, in turn, enables exact form operator in the query language to work. This impacts the index size and the indexing time. However, searching performance is not impacted at all.

Example:

index_exact_words = 1

11.2.43. overshort_step

Position increment on overshort (less that min_word_len) keywords. Optional, allowed values are 0 and 1, default is 1. Introduced in version 0.9.9-rc1.

This directive does not affect searchd in any way, it only affects indexer.

Example:

overshort_step = 1

11.2.44. stopword_step

Position increment on stopwords. Optional, allowed values are 0 and 1, default is 1. Introduced in version 0.9.9-rc1.

This directive does not affect searchd in any way, it only affects indexer.

Example:

stopword_step = 1

11.2.45. hitless_words

Hitless words list. Optional, allowed values are 'all', or a list file name. Introduced in version 1.10-beta.

By default, Sphinx full-text index stores not only a list of matching documents for every given keyword, but also a list of its in-document positions (aka hitlist). Hitlists enables phrase, proximity, strict order and other advanced types of searching, as well as phrase proximity ranking. However, hitlists for specific frequent keywords (that can not be stopped for some reason despite being frequent) can get huge and thus slow to process while querying. Also, in some cases we might only care about boolean keyword matching, and never need position-based searching operators (such as phrase matching) nor phrase ranking.

hitless_words lets you create indexes that either do not have positional information (hitlists) at all, or skip it for specific keywords.

Hitless index will generally use less space than the respective regular index (about 1.5x can be expected). Both indexing and searching should be faster, at a cost of missing positional query and ranking support. When searching, positional queries (eg. phrase queries) will be automatically converted to respective non-positional (document-level) or combined queries. For instance, if keywords "hello" and "world" are hitless, "hello world" phrase query will be converted to (hello & world) bag-of-words query, matching all documents that mention either of the keywords but not necessarily the exact phrase. And if, in addition, keywords "simon" and "says" are not hitless, "simon says hello world" will be converted to ("simon says" & hello & world) query, matching all documents that contain "hello" and "world" anywhere in the document, and also "simon says" as an exact phrase.

Example:

hitless_words = all

11.2.46. expand_keywords

Expand keywords with exact forms and/or stars when possible. Optional, default is 0 (do not expand keywords). Introduced in version 1.10-beta.

Queries against indexes with expand_keywords feature enabled are internally expanded as follows. If the index was built with prefix or infix indexing enabled, every keyword gets internally replaced with a disjunction of keyword itself and a respective prefix or infix (keyword with stars). If the index was built with both stemming and index_exact_words enabled, exact form is also added. Here's an example that shows how internal expansion works when all of the above (infixes, stemming, and exact words) are combined: 

running -> ( running | *running* | =running )

Expanded queries take naturally longer to complete, but can possibly improve the search quality, as the documents with exact form matches should be ranked generally higher than documents with stemmed or infix matches.

Note that the existing query syntax does not allowe to emulate this kind of expansion, because internal expansion works on keyword level and expands keywords within phrase or quorum operators too (which is not possible through the query syntax).

This directive does not affect indexer in any way, it only affects searchd.

Example:

expand_keywords = 1

11.2.47. blend_chars

Blended characters list. Optional, default is empty. Introduced in version 1.10-beta.

Blended characters are indexed both as separators and valid characters. For instance, assume that & is configured as blended and AT&T occurs in an indexed document. Three different keywords will get indexed, namely "at&t", treating blended characters as valid, plus "at" and "t", treating them as separators.

Positions for tokens obtained by replacing blended characters with whitespace are assigned as usual, so regular keywords will be indexed just as if there was no blend_chars specified at all. An additional token that mixes blended and non-blended characters will be put at the starting position. For instance, if the field contents are "AT&T company" occurs in the very beginning of the text field, "at" will be given position 1, "t" position 2, "company" positin 3, and "AT&T" will also be given position 1 ("blending" with the opening regular keyword). Thus, querying for either AT&T or just AT will match that document, and querying for "AT T" as a phrase also match it. Last but not least, phrase query for "AT&T company" will also match it, despite the position

Blended characters can overlap with special characters used in query syntax (think of T-Mobile or @twitter). Where possible, query parser will automatically handle blended character as blended. For instance, "hello @twitter" within quotes (a phrase operator) would handle @-sign as blended, because @-syntax for field operator is not allowed within phrases. Otherwise, the character would be handled as an operator. So you might want to escape the keywords.

Starting with version 2.0.1-beta, blended characters can be remapped, so that multiple different blended characters could be normalized into just one base form. This is useful when indexing multiple alternative Unicode codepoints with equivalent glyphs.

Example:

blend_chars = +, &, U+23
blend_chars = +, &->+ # 2.0.1 and above

11.2.48. blend_mode

Blended tokens indexing mode. Optional, default is trim_none. Introduced in version 2.0.1-beta.

By default, tokens that mix blended and non-blended characters get indexed in there entirety. For instance, when both at-sign and an exclamation are in blend_chars, "@dude!" will get result in two tokens indexed: "@dude!" (with all the blended characters) and "dude" (without any). Therefore "@dude" query will not match it.

blend_mode directive adds flexibility to this indexing behavior. It takes a comma-separated list of options. 

blend_mode = option [, option [, ...]]
option = trim_none | trim_head | trim_tail | trim_both | skip_pure

Options specify token indexing variants. If multiple options are specified, multiple variants of the same token will be indexed. Regular keywords (resulting from that token by replacing blended with whitespace) are always be indexed.

trim_none

Index the entire token.

trim_head

Trim heading blended characters, and index the resulting token.

trim_tail

Trim trailing blended characters, and index the resulting token.

trim_both

Trim both heading and trailing blended characters, and index the resulting token.

skip_pure

Do not index the token if it's purely blended, that is, consists of blended characters only.

Returning to the "@dude!" example above, setting blend_mode = trim_head, trim_tail will result in two tokens being indexed, "@dude" and "dude!". In this particular example, trim_both would have no effect, because trimming both blended characters results in "dude" which is already indexed as a regular keyword. Indexing "@U.S.A." with trim_both (and assuming that dot is blended two) would result in "U.S.A" being indexed. Last but not least, skip_pure enables you to fully ignore sequences of blended characters only. For example, "one @@@ two" would be indexed exactly as "one two", and match that as a phrase. That is not the case by default because a fully blended token gets indexed and offsets the second keyword position.

Default behavior is to index the entire token, equivalent to blend_mode = trim_none.

Example:

blend_mode = trim_tail, skip_pure

11.2.49. rt_mem_limit

RAM chunk size limit. Optional, default is empty. Introduced in version 1.10-beta.

RT index keeps some data in memory (so-called RAM chunk) and also maintains a number of on-disk indexes (so-called disk chunks). This directive lets you control the RAM chunk size. Once there's too much data to keep in RAM, RT index will flush it to disk, activate a newly created disk chunk, and reset the RAM chunk.

The limit is pretty strict; RT index should never allocate more memory than it's limited to. The memory is not preallocated either, hence, specifying 512 MB limit and only inserting 3 MB of data should result in allocating 3 MB, not 512 MB.

Example:

rt_mem_limit = 512M

11.2.50. rt_field

Full-text field declaration. Multi-value, mandatory Introduced in version 1.10-beta.

Full-text fields to be indexed are declared using rt_field directive. The names must be unique. The order is preserved; and so field values in INSERT statements without an explicit list of inserted columns will have to be in the same order as configured.

Example:

rt_field = author
rt_field = title
rt_field = content

11.2.51. rt_attr_uint

Unsigned integer attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares an unsigned 32-bit attribute. Introduced in version 1.10-beta.

Example:

rt_attr_uint = gid

11.2.52. rt_attr_bigint

BIGINT attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares a signed 64-bit attribute. Introduced in version 1.10-beta.

Example:

rt_attr_bigint = guid

11.2.53. rt_attr_float

Floating point attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares a single precision, 32-bit IEEE 754 format float attribute. Introduced in version 1.10-beta.

Example:

rt_attr_float = gpa

11.2.54. rt_attr_timestamp

Timestamp attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Introduced in version 1.10-beta.

Example:

rt_attr_timestamp = date_added

11.2.55. rt_attr_string

String attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Introduced in version 1.10-beta.

Example:

rt_attr_string = author

11.3. indexer program configuration options

11.3.1. mem_limit

Indexing RAM usage limit. Optional, default is 32M.

Enforced memory usage limit that the indexer will not go above. Can be specified in bytes, or kilobytes (using K postfix), or megabytes (using M postfix); see the example. This limit will be automatically raised if set to extremely low value causing I/O buffers to be less than 8 KB; the exact lower bound for that depends on the indexed data size. If the buffers are less than 256 KB, a warning will be produced.

Maximum possible limit is 2047M. Too low values can hurt indexing speed, but 256M to 1024M should be enough for most if not all datasets. Setting this value too high can cause SQL server timeouts. During the document collection phase, there will be periods when the memory buffer is partially sorted and no communication with the database is performed; and the database server can timeout. You can resolve that either by raising timeouts on SQL server side or by lowering mem_limit.

Example:

mem_limit = 256M
# mem_limit = 262144K # same, but in KB
# mem_limit = 268435456 # same, but in bytes

11.3.2. max_iops

Maximum I/O operations per second, for I/O throttling. Optional, default is 0 (unlimited).

I/O throttling related option. It limits maximum count of I/O operations (reads or writes) per any given second. A value of 0 means that no limit is imposed.

indexer can cause bursts of intensive disk I/O during indexing, and it might desired to limit its disk activity (and keep something for other programs running on the same machine, such as searchd). I/O throttling helps to do that. It works by enforcing a minimum guaranteed delay between subsequent disk I/O operations performed by indexer. Modern SATA HDDs are able to perform up to 70-100+ I/O operations per second (that's mostly limited by disk heads seek time). Limiting indexing I/O to a fraction of that can help reduce search performance dedgradation caused by indexing.

Example:

max_iops = 40

11.3.3. max_iosize

Maximum allowed I/O operation size, in bytes, for I/O throttling. Optional, default is 0 (unlimited).

I/O throttling related option. It limits maximum file I/O operation (read or write) size for all operations performed by indexer. A value of 0 means that no limit is imposed. Reads or writes that are bigger than the limit will be split in several smaller operations, and counted as several operation by max_iops setting. At the time of this writing, all I/O calls should be under 256 KB (default internal buffer size) anyway, so max_iosize values higher than 256 KB must not affect anything.

Example:

max_iosize = 1048576

11.3.4. max_xmlpipe2_field

Maximum allowed field size for XMLpipe2 source type, bytes. Optional, default is 2 MB.

Example:

max_xmlpipe2_field = 8M

11.3.5. write_buffer

Write buffer size, bytes. Optional, default is 1 MB.

Write buffers are used to write both temporary and final index files when indexing. Larger buffers reduce the number of required disk writes. Memory for the buffers is allocated in addition to mem_limit. Note that several (currently up to 4) buffers for different files will be allocated, proportionally increasing the RAM usage.

Example:

write_buffer = 4M

11.3.6. max_file_field_buffer

Maximum file field adaptive buffer size, bytes. Optional, default is 8 MB, minimum is 1 MB.

File field buffer is used to load files referred to from sql_file_field columns. This buffer is adaptive, starting at 1 MB at first allocation, and growing in 2x steps until either file contents can be loaded, or maximum buffer size, specified by max_file_field_buffer directive, is reached.

Thus, if there are no file fields are specified, no buffer is allocated at all. If all files loaded during indexing are under (for example) 2 MB in size, but max_file_field_buffer value is 128 MB, peak buffer usage would still be only 2 MB. However, files over 128 MB would be entirely skipped.

Example:

max_file_field_buffer = 128M

11.4. searchd program configuration options

11.4.1. listen

This setting lets you specify IP address and port, or Unix-domain socket path, that searchd will listen on. Introduced in version 0.9.9-rc1.

The informal grammar for listen setting is: 

listen = ( address ":" port | port | path ) [ ":" protocol ]

I.e. you can specify either an IP address (or hostname) and port number, or just a port number, or Unix socket path. If you specify port number but not the address, searchd will listen on all network interfaces. Unix path is identified by a leading slash.

Starting with version 0.9.9-rc2, you can also specify a protocol handler (listener) to be used for connections on this socket. Supported protocol values are 'sphinx' (Sphinx 0.9.x API protocol) and 'mysql41' (MySQL protocol used since 4.1 upto at least 5.1). More details on MySQL protocol support can be found in Section 5.10, “MySQL protocol support and SphinxQL” section.

Examples:

listen = localhost
listen = localhost:5000
listen = 192.168.0.1:5000
listen = /var/run/sphinx.s
listen = 9312
listen = localhost:9306:mysql41

There can be multiple listen directives, searchd will listen for client connections on all specified ports and sockets. If no listen directives are found then the server will listen on all available interfaces using the default SphinxAPI port 9312. Starting with 1.10-beta, it will also listen on default SphinxQL port 9306. Both port numbers are assigned by IANA (see http://www.iana.org/assignments/port-numbers for details) and should therefore be available.

Unix-domain sockets are not supported on Windows.

11.4.2. address

Interface IP address to bind on. Optional, default is 0.0.0.0 (ie. listen on all interfaces). DEPRECATED, use listen instead.

address setting lets you specify which network interface searchd will bind to, listen on, and accept incoming network connections on. The default value is 0.0.0.0 which means to listen on all interfaces. At the time, you can not specify multiple interfaces.

Example:

address = 192.168.0.1

11.4.3. port

searchd TCP port number. DEPRECATED, use listen instead. Used to be mandatory. Default port number is 9312.

Example:

port = 9312

11.4.4. log

Log file name. Optional, default is 'searchd.log'. All searchd run time events will be logged in this file.

Also you can use the 'syslog' as the file name. In this case the events will be sent to syslog daemon. To use the syslog option the sphinx must be configured '--with-syslog' on building.

Example:

log = /var/log/searchd.log

11.4.5. query_log

Query log file name. Optional, default is empty (do not log queries). All search queries will be logged in this file. The format is described in Section 5.9, “searchd query log formats”.

In case of 'plain' format, you can use the 'syslog' as the path to the log file. In this case all search queries will be sent to syslog daemon with LOG_INFO priority, prefixed with '[query]' instead of timestamp. To use the syslog option the sphinx must be configured '--with-syslog' on building.

Example:

query_log = /var/log/query.log

11.4.6. query_log_format

Query log format. Optional, allowed values are 'plain' and 'sphinxql', default is 'plain'. Introduced in version 2.0.1-beta.

Starting with version 2.0.1-beta, two different log formats are supported. The default one logs queries in a custom text format. The new one logs valid SphinxQL statements. This directive allows to switch between the two formats on search daemon startup. The log format can also be altered on the fly, using SET GLOBAL query_log_format=sphinxql syntax. Refer to Section 5.9, “searchd query log formats” for more discussion and format details.

Example:

query_log_format = sphinxql

11.4.7. read_timeout

Network client request read timeout, in seconds. Optional, default is 5 seconds. searchd will forcibly close the client connections which fail to send a query within this timeout.

Example:

read_timeout = 1

11.4.8. client_timeout

Maximum time to wait between requests (in seconds) when using persistent connections. Optional, default is five minutes.

Example:

client_timeout = 3600

11.4.9. max_children

Maximum amount of children to fork (or in other words, concurrent searches to run in parallel). Optional, default is 0 (unlimited).

Useful to control server load. There will be no more than this much concurrent searches running, at all times. When the limit is reached, additional incoming clients are dismissed with temporarily failure (SEARCHD_RETRY) status code and a message stating that the server is maxed out.

Example:

max_children = 10

11.4.10. pid_file

searchd process ID file name. Mandatory.

PID file will be re-created (and locked) on startup. It will contain head daemon process ID while the daemon is running, and it will be unlinked on daemon shutdown. It's mandatory because Sphinx uses it internally for a number of things: to check whether there already is a running instance of searchd; to stop searchd; to notify it that it should rotate the indexes. Can also be used for different external automation scripts.

Example:

pid_file = /var/run/searchd.pid

11.4.11. max_matches

Maximum amount of matches that the daemon keeps in RAM for each index and can return to the client. Optional, default is 1000.

Introduced in order to control and limit RAM usage, max_matches setting defines how much matches will be kept in RAM while searching each index. Every match found will still be processed; but only best N of them will be kept in memory and return to the client in the end. Assume that the index contains 2,000,000 matches for the query. You rarely (if ever) need to retrieve all of them. Rather, you need to scan all of them, but only choose "best" at most, say, 500 by some criteria (ie. sorted by relevance, or price, or anything else), and display those 500 matches to the end user in pages of 20 to 100 matches. And tracking only the best 500 matches is much more RAM and CPU efficient than keeping all 2,000,000 matches, sorting them, and then discarding everything but the first 20 needed to display the search results page. max_matches controls N in that "best N" amount.

This parameter noticeably affects per-query RAM and CPU usage. Values of 1,000 to 10,000 are generally fine, but higher limits must be used with care. Recklessly raising max_matches to 1,000,000 means that searchd will have to allocate and initialize 1-million-entry matches buffer for every query. That will obviously increase per-query RAM usage, and in some cases can also noticeably impact performance.

CAVEAT EMPTOR! Note that there also is another place where this limit is enforced. max_matches can be decreased on the fly through the corresponding API call, and the default value in the API is also set to 1,000. So in order to retrieve more than 1,000 matches to your application, you will have to change the configuration file, restart searchd, and set proper limit in SetLimits() call. Also note that you can not set the value in the API higher than the value in the .conf file. This is prohibited in order to have some protection against malicious and/or malformed requests.

Example:

max_matches = 10000

11.4.12. seamless_rotate

Prevents searchd stalls while rotating indexes with huge amounts of data to precache. Optional, default is 1 (enable seamless rotation).

Indexes may contain some data that needs to be precached in RAM. At the moment, .spa, .spi and .spm files are fully precached (they contain attribute data, MVA data, and keyword index, respectively.) Without seamless rotate, rotating an index tries to use as little RAM as possible and works as follows:

  1. new queries are temporarly rejected (with "retry" error code);

  2. searchd waits for all currently running queries to finish;

  3. old index is deallocated and its files are renamed;

  4. new index files are renamed and required RAM is allocated;

  5. new index attribute and dictionary data is preloaded to RAM;

  6. searchd resumes serving queries from new index.

However, if there's a lot of attribute or dictionary data, then preloading step could take noticeble time - up to several minutes in case of preloading 1-5+ GB files.

With seamless rotate enabled, rotation works as follows:

  1. new index RAM storage is allocated;

  2. new index attribute and dictionary data is asynchronously preloaded to RAM;

  3. on success, old index is deallocated and both indexes' files are renamed;

  4. on failure, new index is deallocated;

  5. at any given moment, queries are served either from old or new index copy.

Seamless rotate comes at the cost of higher peak memory usage during the rotation (because both old and new copies of .spa/.spi/.spm data need to be in RAM while preloading new copy). Average usage stays the same.

Example:

seamless_rotate = 1

11.4.13. preopen_indexes

Whether to forcibly preopen all indexes on startup. Optional, default is 1 (preopen everything).

Starting with 2.0.1-beta, the default value for this option is now 1 (foribly preopen all indexes). In prior versions, it used to be 0 (use per-index settings).

When set to 1, this directive overrides and enforces preopen on all indexes. They will be preopened, no matter what is the per-index preopen setting. When set to 0, per-index settings can take effect. (And they default to 0.)

Pre-opened indexes avoid races between search queries and rotations that can cause queries to fail occasionally. They also make searchd use more file handles. In most scenarios it's therefore preferred and recommended to preopen indexes.

Example:

preopen_indexes = 1

11.4.14. unlink_old

Whether to unlink .old index copies on succesful rotation. Optional, default is 1 (do unlink).

Example:

unlink_old = 0

11.4.15. attr_flush_period

When calling UpdateAttributes() to update document attributes in real-time, changes are first written to the in-memory copy of attributes (docinfo must be set to extern). Then, once searchd shuts down normally (via SIGTERM being sent), the changes are written to disk. Introduced in version 0.9.9-rc1.

Starting with 0.9.9-rc1, it is possible to tell searchd to periodically write these changes back to disk, to avoid them being lost. The time between those intervals is set with attr_flush_period, in seconds.

It defaults to 0, which disables the periodic flushing, but flushing will still occur at normal shut-down.

Example:

attr_flush_period = 900 # persist updates to disk every 15 minutes

11.4.16. ondisk_dict_default

Instance-wide defaults for ondisk_dict directive. Optional, default it 0 (precache dictionaries in RAM). Introduced in version 0.9.9-rc1.

This directive lets you specify the default value of ondisk_dict for all the indexes served by this copy of searchd. Per-index directive take precedence, and will overwrite this instance-wide default value, allowing for fine-grain control.

Example:

ondisk_dict_default = 1 # keep all dictionaries on disk

11.4.17. max_packet_size

Maximum allowed network packet size. Limits both query packets from clients, and response packets from remote agents in distributed environment. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 8M. Introduced in version 0.9.9-rc1.

Example:

max_packet_size = 32M

11.4.18. mva_updates_pool

Shared pool size for in-memory MVA updates storage. Optional, default size is 1M. Introduced in version 0.9.9-rc1.

This setting controls the size of the shared storage pool for updated MVA values. Specifying 0 for the size disable MVA updates at all. Once the pool size limit is hit, MVA update attempts will result in an error. However, updates on regular (scalar) attributes will still work. Due to internal technical difficulties, currently it is not possible to store (flush) any updates on indexes where MVA were updated; though this might be implemented in the future. In the meantime, MVA updates are intended to be used as a measure to quickly catchup with latest changes in the database until the next index rebuild; not as a persistent storage mechanism.

Example:

mva_updates_pool = 16M

11.4.19. crash_log_path

Deprecated debugging setting, path (formally prefix) for crash log files. Introduced in version 0.9.9-rc1. Deprecated in version 2.0.1-beta, as crash debugging information now gets logged into searchd.log in text form, and separate binary crash logs are no longer needed.

11.4.20. max_filters

Maximum allowed per-query filter count. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 256. Introduced in version 0.9.9-rc1.

Example:

max_filters = 1024

11.4.21. max_filter_values

Maximum allowed per-filter values count. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 4096. Introduced in version 0.9.9-rc1.

Example:

max_filter_values = 16384

11.4.22. listen_backlog

TCP listen backlog. Optional, default is 5.

Windows builds currently (as of 0.9.9) can only process the requests one by one. Concurrent requests will be enqueued by the TCP stack on OS level, and requests that can not be enqueued will immediately fail with "connection refused" message. listen_backlog directive controls the length of the connection queue. Non-Windows builds should work fine with the default value.

Example:

listen_backlog = 20

11.4.23. read_buffer

Per-keyword read buffer size. Optional, default is 256K.

For every keyword occurrence in every search query, there are two associated read buffers (one for document list and one for hit list). This setting lets you control their sizes, increasing per-query RAM use, but possibly decreasing IO time.

Example:

read_buffer = 1M

11.4.24. read_unhinted

Unhinted read size. Optional, default is 32K.

When querying, some reads know in advance exactly how much data is there to be read, but some currently do not. Most prominently, hit list size in not currently known in advance. This setting lest you control how much data to read in such cases. It will impact hit list IO time, reducing it for lists larger than unhinted read size, but raising it for smaller lists. It will not affect RAM use because read buffer will be already allocated. So it should be not greater than read_buffer.

Example:

read_unhinted = 32K

11.4.25. max_batch_queries

Limits the amount of queries per batch. Optional, default is 32.

Makes searchd perform a sanity check of the amount of the queries submitted in a single batch when using multi-queries. Set it to 0 to skip the check.

Example:

max_batch_queries = 256

11.4.26. subtree_docs_cache

Max common subtree document cache size, per-query. Optional, default is 0 (disabled).

Limits RAM usage of a common subtree optimizer (see Section 5.11, “Multi-queries”). At most this much RAM will be spent to cache document entries per each query. Setting the limit to 0 disables the optimizer.

Example:

subtree_docs_cache = 8M

11.4.27. subtree_hits_cache

Max common subtree hit cache size, per-query. Optional, default is 0 (disabled).

Limits RAM usage of a common subtree optimizer (see Section 5.11, “Multi-queries”). At most this much RAM will be spent to cache keyword occurrences (hits) per each query. Setting the limit to 0 disables the optimizer.

Example:

subtree_hits_cache = 16M

11.4.28. workers

Multi-processing mode (MPM). Optional; allowed values are none, fork, prefork, and threads. Default is fork on Unix based systems, and threads on Windows. Introduced in version 1.10-beta.

Lets you choose how searchd processes multiple concurrent requests. The possible values are:

none

All requests will be handled serially, one-by-one. Prior to 1.x, this was the only mode available on Windows.

fork

A new child process will be forked to handle every incoming request. Historically, this is the default mode.

prefork

On startup, searchd will pre-fork a number of worker processes, and pass the incoming requests to one of those children.

threads

A new thread will be created to handle every incoming request. This is the only mode compatible with RT indexing backend.

Historically, searchd used fork-based model, which generally performs OK but spends a noticeable amount of CPU in fork() system call when there's a high amount of (tiny) requests per second. Prefork mode was implemented to alleviate that; with prefork, worker processes are basically only created on startup and re-created on index rotation, somewhat reducing fork() call pressure.

Threads mode was implemented along with RT backend and is required to use RT indexes. (Regular disk-based indexes work in all the available modes.)

Example:

workers = threads

11.4.29. dist_threads

Max local worker threads to use for parallelizable requests (searching a distributed index; building a batch of snippets). Optional, default is 0, which means to disable in-request parallelism. Introduced in version 1.10-beta.

Distributed index can include several local indexes. dist_threads lets you easily utilize multiple CPUs/cores for that (previously existing alternative was to specify the indexes as remote agents, pointing searchd to itself and paying some network overheads).

When set to a value N greater than 1, this directive will create up to N threads for every query, and schedule the specific searches within these threads. For example, if there are 7 local indexes to search and dist_threads is set to 2, then 2 parallel threads would be created: one that sequentially searches 4 indexes, and another one that searches the other 3 indexes.

In case of CPU bound workload, setting dist_threads to 1x the number of cores is advised (creating more threads than cores will not improve query time). In case of mixed CPU/disk bound workload it might sometimes make sense to use more (so that all cores could be utilizes even when there are threads that wait for I/O completion).

Note that dist_threads does not require threads MPM. You can perfectly use it with fork or prefork MPMs too.

Starting with version 2.0.1-beta, building a batch of snippets with load_files flag enabled can also be parallelized. Up to dist_threads threads are be created to process those files. That speeds up snippet extraction when the total amount of document data to process is significant (hundreds of megabytes).

Example:

index dist_test
{
	type = distributed
	local = chunk1
	local = chunk2
	local = chunk3
	local = chunk4
}

# ...

dist_threads = 4

11.4.30. binlog_path

Binary log (aka transaction log) files path. Optional, default is build-time configured data directory. Introduced in version 1.10-beta.

Binary logs are used for crash recovery of RT index data that would otherwise only be stored in RAM. When logging is enabled, every transaction COMMIT-ted into RT index gets written into a log file. Logs are then automatically replayed on startup after an unclean shutdown, recovering the logged changes.

binlog_path directive specifies the binary log files location. It should contain just the path; searchd will create and unlink multiple binlog.* files in that path as necessary (binlog data, metadata, and lock files, etc).

Empty value disables binary logging. That improves performance, but puts RT index data at risk.

Example:

binlog_path = # disable logging
binlog_path = /var/data # /var/data/binlog.001 etc will be created

11.4.31. binlog_flush

Binary log transaction flush/sync mode. Optional, default is 2 (flush every transaction, sync every second). Introduced in version 1.10-beta.

This directive controls how frequently will binary log be flushed to OS and synced to disk. Three modes are supported:

  • 0, flush and sync every second. Best performance, but up to 1 second worth of committed transactions can be lost both on daemon crash, or OS/hardware crash.

  • 1, flush and sync every transaction. Worst performance, but every committed transaction data is guaranteed to be saved.

  • 2, flush every transaction, sync every second. Good performance, and every committed transaction is guaranteed to be saved in case of daemon crash. However, in case of OS/hardware crash up to 1 second worth of committed transactions can be lost.

For those familiar with MySQL and InnoDB, this directive is entirely similar to innodb_flush_log_at_trx_commit. In most cases, the default hybrid mode 2 provides a nice balance of speed and safety, with full RT index data protection against daemon crashes, and some protection against hardware ones.

Example:

binlog_flush = 1 # ultimate safety, low speed

11.4.32. binlog_max_log_size

Maximum binary log file size. Optional, default is 0 (do not reopen binlog file based on size). Introduced in version 1.10-beta.

A new binlog file will be forcibly opened once the current binlog file reaches this limit. This achieves a finer granularity of logs and can yield more efficient binlog disk usage under certain borderline workloads.

Example:

binlog_max_log_size = 16M

11.4.33. collation_server

Default server collation. Optional, default is libc_ci. Introduced in version 2.0.1-beta.

Specifies the default collation used for incoming requests. The collation can be overridden on a per-query basis. Refer to Section 5.12, “Collations” section for the list of available collations and other details.

Example:

collation_server = utf8_ci

11.4.34. collation_libc_locale

Server libc locale. Optional, default is C. Introduced in version 2.0.1-beta.

Specifies the libc locale, affecting the libc-based collations. Refer to Section 5.12, “Collations” section for the details.

Example:

collation_libc_locale = fr_FR

11.4.35. plugin_dir

Trusted location for the dynamic libraries (UDFs). Optional, default is empty (no location). Introduced in version 2.0.1-beta.

Specifies the trusted directory from which the UDF libraries can be loaded. Requires workers = thread to take effect.

Example:

workers = threads
plugin_dir = /usr/local/sphinx/lib

11.4.36. mysql_version_string

A server version string to return via MySQL protocol. Optional, default is empty (return Sphinx version). Introduced in version 2.0.1-beta.

Several picky MySQL client libraries depend on a particular version number format used by MySQL, and moreover, sometimes choose a different execution path based on the reported version number (rather than the indicated capabilities flags). For instance, Python MySQLdb 1.2.2 throws an exception when the version number is not in X.Y.ZZ format; MySQL .NET connector 6.3.x fails internally on version numbers 1.x along with a certain combination of flags, etc. To workaround that, you can use mysql_version_string directive and have searchd report a different version to clients connecting over MySQL protocol. (By default, it reports its own version.)

Example:

mysql_version_string = 5.0.37

11.4.37. rt_flush_period

RT indexes RAM chunk flush check period, in seconds. Optional, default is 0 (do not flush). Introduced in version 2.0.1-beta.

Actively updated RT indexes that however fully fit in RAM chunks can result in ever-growing binlogs, impacting disk use and crash recovery time. With this directive the search daemon performs periodic flush checks, and eligible RAM chunks can get saved, enabling consequential binlog cleanup. See Section 4.4, “Binary logging” for more details.

Example:

rt_flush_period = 3600

11.4.38. thread_stack

Per-thread stack size. Optional, default is 64K. Introduced in version 2.0.1-beta.

In the workers = threads mode, every request is processed with a separate thread that needs its own stack space. By default, 64K per thread are allocated for stack. However, extremely complex search requests might eventually exhaust the default stack and require more. For instance, a query that matches a few thousand keywords (either directly or through term expansion) can eventually run out of stack. Previously, that resulted in crashes. Starting with 2.0.1-beta, searchd attempts to estimate the expected stack use, and blocks the potentially dangerous queries. To process such queries, you can either the thread stack size by using the thread_stack directive (or switch to a different workers setting if that is possible).

A query with N levels of nesting is estimated to require approximately 30+0.12*N KB of stack, meaning that the default 64K is enough for queries with upto 300 levels, 150K for upto 1000 levels, etc. If the stack size limit is not met, searchd fails the query and reports the required stack size in the error message.

Example:

thread_stack = 256K

11.4.39. expansion_limit

The maximum number of expanded keywords for a single wildcard. Optional, default is 0 (no limit). Introduced in version 2.0.1-beta.

When doing substring searches against indexes built with dict = keywords enabled, a single wildcard may potentially result in thousands and even millions of matched keywords (think of matching 'a*' against the entire Oxford dictionary). This directive lets you limit the impact of such expansions. Setting expansion_limit = N restricts expansions to no more than N of the most frequent matching keywords (per each wildcard in the query).

Example:

expansion_limit = 16

11.4.40. compat_sphinxql_magics

Legacy SphinxQL quirks compatiblity mode. Optional, default is 1 (keep compatibility). Introduced in version 2.0.1-beta.

Starting with version 2.0.1-beta, we're bringing SphinxQL in closer compliance with standard SQL. However, existing applications must not get broken, and compat_sphinxql_magics lets you upgrade safely. It defauls to 1, which enables the compatibility mode. However, SphinxQL compatibility mode is now deprecated and will be removed once we complete bringing SphinxQL in line with standard SQL syntax. So it's advised to update the applications utilising SphinxQL and then switch the daemon to the new, more SQL compliant mode by setting compat_sphinxql_magics = 0. Please refer to Section 7.21, “SphinxQL upgrade notes, version 2.0.1-beta” for the details and update instruction.

Example:

compat_sphinxql_magics = 0 # the future is now

11.4.41. watchdog

Threaded server watchdog. Optional, default is 1 (watchdog enabled). Introduced in version 2.0.1-beta.

A crashed query in threads multi-processing mode (workers = threads) can take down the entire server. With watchdog feature enabled, searchd additionally keeps a separate lightweight process that monitors the main server process, and automatically restarts the latter in case of abnormal termination. Watchdog is enabled by default.

Example:

watchdog = 0 # disable watchdog

Appendix A. Sphinx revision history

Table of Contents

A.1. Version 2.0.1-beta, 22 apr 2011
A.2. Version 1.10-beta, 19 jul 2010
A.3. Version 0.9.9-release, 02 dec 2009
A.4. Version 0.9.9-rc2, 08 apr 2009
A.5. Version 0.9.9-rc1, 17 nov 2008
A.6. Version 0.9.8.1, 30 oct 2008
A.7. Version 0.9.8, 14 jul 2008
A.8. Version 0.9.7, 02 apr 2007
A.9. Version 0.9.7-rc2, 15 dec 2006
A.10. Version 0.9.7-rc1, 26 oct 2006
A.11. Version 0.9.6, 24 jul 2006
A.12. Version 0.9.6-rc1, 26 jun 2006

A.1. Version 2.0.1-beta, 22 apr 2011

New general features

New SphinxQL features

New command-line switches

  • added --print-queries switch to indexer that dumps SQL queries it runs

  • added --sighup-each switch to indexer that rotates indexes one by one

  • added --strip-path switch to searchd that skips file paths embedded in the index(-es)

  • added --dumpconfig switch to indextool that dumps an index header in sphinx.conf format

Major changes and optimizations

  • changed default preopen_indexes value to 1

  • optimized English stemmer (results in 1.3x faster snippets and indexing with morphology=stem_en)

  • optimized snippets, 1.6x general speedup

  • optimized const-list parsing in SphinxQL

  • optimized full-document highlighting CPU/RAM use

  • optimized binlog replay (improved performance on K-list update)

Bug fixes

  • fixed #767, joined fields vs ODBC sources

  • fixed #757, wordforms shared by indexes with different settings

  • fixed #733, loading of indexes in formats prior to v.14

  • fixed #763, occasional snippets failures

  • fixed #648, occasionally missed rotations on multiple SIGHUPs

  • fixed #750, an RT segment merge leading to false positives and/or crashes in some cases

  • fixed #755, zones in snippets output

  • fixed #754, stopwords counting at snippet passage generation

  • fixed #723, fork/prefork index rotation in children processes

  • fixed #696, freeze on zero threshold in quorum operator

  • fixed #732, query escaping in SphinxSE

  • fixed #739, occasional crashes in MT mode on result set send

  • fixed #746, crash with a named list in SphinxQL option

  • fixed #674, AVG vs group order

  • fixed #734, occasional crashes attempting to report NULL errors

  • fixed #829, tail hits within field position modifier

  • fixed #712, missing query_mode, force_all_words snippet option defaults in Java API

  • fixed #721, added dupe removal on RT batch INSERT/REPLACE

  • fixed #720, potential extraneous highlighting after a blended keyword

  • fixed #702, exceptions vs star search

  • fixed #666, ext2 query grouping vs exceptions

  • fixed #688, WITHIN GROUP ORDER BY related crash

  • fixed #660, multi-queue batches vs dist_threads

  • fixed #678, crash on dict=keywords vs xmlpipe vs min_prefix_len

  • fixed #596, ECHILD vs scripted configs

  • fixed #653, dependency in expression, sorting, grouping

  • fixed #661, concurrent distributed searches vs workers=threads

  • fixed #646, crash on status query via UNIX socket

  • fixed #589, libexpat.dll missing from some Win32 build types

  • fixed #574, quorum match order

  • fixed multiple documentation issues (#372, #483, #495, #601, #623, #632, #654)

  • fixed that ondisk_dict did not affect RT indexes

  • fixed that string attributes check in indextool --check was erroneously sensitive to string data order

  • fixed a rare crash when using BEFORE operator

  • fixed an issue with multiforms vs BuildKeywords()

  • fixed an edge case in OR operator (emitted wrong hits order sometimes)

  • fixed aliasing in docinfo accessors that lead to very rare crashes and/or missing results

  • fixed a syntax error on a short token at the end of a query

  • fixed id64 filtering and performance degradation with range filters

  • fixed missing rankers in libsphinxclient

  • fixed missing SPH04 ranker in SphinxSE

  • fixed column names in sql_attr_multi sample (works with example.sql now)

  • fixed an issue with distributed local+remote setup vs aggregate functions

  • fixed case sensitive columns names in RT indexes

  • fixed a crash vs strings from multiple indexes in result set

  • fixed blended keywords vs snippets

  • fixed secure_connection vs MySQL protocol vs MySQL.NET connector

  • fixed that Python API did not works with Python 2.3

  • fixed overshort_step vs snippets

  • fixed keyword staistics vs dist_threads searching

  • fixed multiforms vs query parsing (vs quorum)

  • fixed missed quorum words vs RT segments

  • fixed blended keywords occasionally skipping extra character when querying (eg "abc[]")

  • fixed Python API to handle int32 values

  • fixed prefix and infix indexing of joined fields

  • fixed MVA ranged query

  • fixed missing blended state reset on document boundary

  • fixed a crash on missing index while replaying binlog

  • fixed an error message on filter values overrun

  • fixed passage duplication in snippets in weight_order mode

  • fixed select clauses over 1K vs remote agents

  • fixed overshort accounting vs soft-whitespace tokens

  • fixed rotation vs workers=threads

  • fixed schema issues vs distributed indexes

  • fixed blended-escaped sequence parsing issue

  • fixed MySQL IN clause (values order etc)

  • fixed that post_index did not execute when 0 documents were succesfully indexed

  • fixed field position limit vs many hits

  • fixed that joined fields missed an end marker at field end

  • fixed that xxx_step settings were missing from .sph index header

  • fixed libsphinxclient missing request cleanup in sphinx_query() (eg after network errors)

  • fixed that index_weights were ignored when grouping

  • fixed multi wordforms vs blend_chars

  • fixed broken MVA output in SphinxQL

  • fixed a few RT leaks

  • fixed an issue with RT string storage going missing

  • fixed an issue with repeated queries vs dist_threads

  • fixed an issue with string attributes vs buffer overrun in SphinxQL

  • fixed unexpected character data warnings within ignored xmlpipe tags

  • fixed a crash in snippets with NEAR syntax query

  • fixed passage duplication in snippets

  • fixed libsphinxclient SIGPIPE handling

  • fixed libsphinxclient vs VS2003 compiler bug

A.2. Version 1.10-beta, 19 jul 2010

  • added RT indexes support (Chapter 4, Real-time indexes)

  • added prefork and threads support (workers directives)

  • added multi-threaded local searches in distributed indexes (dist_threads directive)

  • added common subquery cache (subtree_docs_cache, subtree_hits_cache directives)

  • added string attributes support (sql_attr_string, sql_field_string, xml_attr_string, xml_field_string directives)

  • added indexing-time word counter (sql_attr_str2wordcount, sql_field_str2wordcount directives)

  • added CALL SNIPPETS(), CALL KEYWORDS() SphinxQL statements

  • added field_weights, index_weights options to SphinxQL SELECT statement

  • added insert-only SphinxQL-talking tables to SphinxSE (connection='sphinxql://host[:port]/index')

  • added select option to SphinxSE queries

  • added backtrace on crash to searchd

  • added SQL+FS indexing, aka loading files by names fetched from SQL (sql_file_field directive)

  • added a watchdog in threads mode to searchd

  • added automatic row phantoms elimination to index merge

  • added hitless indexing support (hitless_words directive)

  • added --check, --strip-path, --htmlstrip, --dumphitlist ... --wordid switches to indextool

  • added --stopwait, --logdebug switches to searchd

  • added --dump-rows, --verbose switches to indexer

  • added "blended" characters indexing support (blend_chars directive)

  • added joined/payload field indexing (sql_joined_field directive)

  • added FlushAttributes() API call

  • added query_mode, force_all_words, limit_passages, limit_words, start_passage_id, load_files, html_strip_mode, allow_empty options, and %PASSAGE_ID% macro in before_match, after_match options to BuildExcerpts() API call

  • added @groupby/@count/@distinct columns support to SELECT (but not to expressions)

  • added query-time keyword expansion support (expand_keywords directive, SPH_RANK_SPH04 ranker)

  • added query batch size limit option (max_batch_queries directive; was hardcoded)

  • added SINT() function to expressions

  • improved SphinxQL syntax error reporting

  • improved expression optimizer (better constant handling)

  • improved dash handling within keywords (no longer treated as an operator)

  • improved snippets (better passage selection/trimming, around option now a hard limit)

  • optimized index format that yields ~20-30% smaller indexes

  • optimized sorting code (indexing time 1-5% faster on average; 100x faster in worst case)

  • optimized searchd startup time (moved .spa preindexing to indexer), added a progress bar

  • optimized queries against indexes with many attributes (eliminated redundant copying)

  • optimized 1-keyword queries (performace regression introduced in 0.9.9)

  • optimized SphinxQL protocol overheads, and performance on bigger result sets

  • optimized unbuffered attributes writes on index merge

  • changed attribute handling, duplicate names are strictly forbidden now

  • fixed that SphinxQL sessions could stall shutdown

  • fixed consts with leading minus in SphinxQL

  • fixed AND/OR precedence in expressions

  • fixed #334, AVG() on integers was not computed in floats

  • fixed #371, attribute flush vs 2+ GB files

  • fixed #373, segfault on distributed queries vs certain libc versions

  • fixed #398, stopwords not stopped in prefix/infix indexes

  • fixed #404, erroneous MVA failures in indextool --check

  • fixed #408, segfault on certain query batches (regular scan, plus a scan with MVA groupby)

  • fixed #431, occasional shutdown hangs in preforked workers

  • fixed #436, trunk checkout builds vs Solaris sh

  • fixed #440, escaping vs parentheses declared as valid in charset_table

  • fixed #442, occasional non-aligned free in MVA indexing

  • fixed #447, occasional crashes in MVA indexing

  • fixed #449, pconn busyloop on aborted clients on certain arches

  • fixed #465, build issue on Alpha

  • fixed #468, build issue in libsphinxclient

  • fixed #472, multiple stopword files failing to load

  • fixed #489, buffer overflow in query logging

  • fixed #493, Python API assertion after error returned from Query()

  • fixed #500, malformed MySQL packet when sending MVAs

  • fixed #504, SIGPIPE in libsphinxclient

  • fixed #506, better MySQL protocol commands support in SphinxQL (PING etc)

  • fixed #509, indexing ranged results from stored procedures

A.3. Version 0.9.9-release, 02 dec 2009

  • added Open, Close, Status calls to libsphinxclient (C API)

  • added automatic persistent connection reopening to PHP, Python APIs

  • added 64-bit value/range filters, fullscan mode support to SphinxSE

  • MAJOR CHANGE, our IANA assigned ports are 9312 and 9306 respectively (goodbye, trusty 3312)

  • MAJOR CHANGE, erroneous filters now fail with an error (were silently ignored before)

  • optimized unbuffered .spa writes on merge

  • optimized 1-keyword queries ranking in extended2 mode

  • fixed #441 (IO race in case of highly conccurent load on a preopened)

  • fixed #434 (distrubuted indexes were not searchable via MySQL protocol)

  • fixed #317 (indexer MVA progress counter)

  • fixed #398 (stopwords not removed from search query)

  • fixed #328 (broken cutoff)

  • fixed #250 (now quoting paths w/spaces when installing Windows service)

  • fixed #348 (K-list was not updated on merge)

  • fixed #357 (destination index were not K-list-filtered on merge)

  • fixed #369 (precaching .spi files over 2 GBs)

  • fixed #438 (missing boundary proximity matches)

  • fixed #371 (.spa flush in case of files over 2 GBs)

  • fixed #373 (crashes on distributed queries via mysql proto)

  • fixed critical bugs in hit merging code

  • fixed #424 (ordinals could be misplaced during indexing in case of bitfields etc)

  • fixed #426 (failing SE build on Solaris; thanks to Ben Beecher)

  • fixed #423 (typo in SE caused crash on SHOW STATUS)

  • fixed #363 (handling of read_timeout over 2147 seconds)

  • fixed #376 (minor error message mismatch)

  • fixed #413 (minus in SphinxQL)

  • fixed #417 (floats w/o leading digit in SphinxQL)

  • fixed #403 (typo in SetFieldWeights name in Java API)

  • fixed index rotation vs persistent connections

  • fixed backslash handling in SphinxQL parser

  • fixed uint unpacking vs. PHP 5.2.9 (possibly other versions)

  • fixed #325 (filter settings send from SphinxSE)

  • fixed #352 (removed mysql wrapper around close() in SphinxSE)

  • fixed #389 (display error messages through SphinxSE status variable)

  • fixed linking with port-installed iconv on OS X

  • fixed negative 64-bit unpacking in PHP API

  • fixed #349 (escaping backslash in query emulation mode)

  • fixed #320 (disabled multi-query route when select items differ)

  • fixed #353 (better quorum counts check)

  • fixed #341 (merging of trailing hits; maybe other ranking issues too)

  • fixed #368 (partially; @field "" caused crashes; now resets field limit)

  • fixed #365 (field mask was leaking on field-limited terms)

  • fixed #339 (updated debug query dumper)

  • fixed #361 (added SetConnectTimeout() to Java API)

  • fixed #338 (added missing fullscan to mode check in Java API)

  • fixed #323 (added floats support to SphinxQL)

  • fixed #340 (support listen=port:proto syntax too)

  • fixed #332 (\r is legal SphinxQL space now)

  • fixed xmlpipe2 K-lists

  • fixed #322 (safety gaps in mysql protocol row buffer)

  • fixed #313 (return keyword stats for empty indexes too)

  • fixed #344 (invalid checkpoints after merge)

  • fixed #326 (missing CLOCK_xxx on FreeBSD)

A.4. Version 0.9.9-rc2, 08 apr 2009

  • added IsConnectError(), Open(), Close() calls to Java API (bug #240)

  • added read_buffer, read_unhinted directives

  • added checks for build options returned by mysql_config (builds on Solaris now)

  • added fixed-RAM index merge (bug #169)

  • added logging chained queries count in case of (optimized) multi-queries

  • added GEODIST() function

  • added --status switch to searchd

  • added MySpell (OpenOffice) affix file support (bug #281)

  • added ODBC support (both Windows and UnixODBC)

  • added support for @id in IN() (bug #292)

  • added support for aggregate functions in GROUP BY (namely AVG, MAX, MIN, SUM)

  • added MySQL UDF that builds snippets using searchd

  • added write_buffer directive (defaults to 1M)

  • added xmlpipe_fixup_utf8 directive

  • added suggestions sample

  • added microsecond precision int64 timer (bug #282)

  • added listen_backlog directive

  • added max_xmlpipe2_field directive

  • added initial SphinxQL support to mysql41 handler, SELECT .../SHOW WARNINGS/STATUS/META are handled

  • added support for different network protocols, and mysql41 protocol

  • added fieldmask ranker, updated SphinxSE list of rankers

  • added mysql_ssl_xxx directives

  • added --cpustats (requires clock_gettime()) and --status switches to searchd

  • added performance counters, Status() API call

  • added overshort_step and stopword_step directives

  • added strict order operator (aka operator before, eg. "one << two << three")

  • added indextool utility, moved --dumpheader there, added --debugdocids, --dumphitlist options

  • added own RNG, reseeded on @random sort query (bug #183)

  • added field-start and field-end modifiers support (syntax is "^hello world$"; field-end requires reindex)

  • added MVA attribute support to IN() function

  • added AND, OR, and NOT support to expressions

  • improved logging of (optimized) multi-queries (now logging chained query count)

  • improved handshake error handling, fixed protocol version byte order (omg)

  • updated SphinxSE to protocol 1.22

  • allowed phrase_boundary_step=-1 (trick to emulate keyword expansion)

  • removed SPH_MAX_QUERY_WORDS limit

  • fixed CLI search vs documents missing from DB (bug #257)

  • fixed libsphinxclient results leak on subsequent sphinx_run_queries call (bug #256)

  • fixed libsphinxclient handling of zero max_matches and cutoff (bug #208)

  • fixed Java API over-64K string reads (eg. big snippets) in Java API (bug #181)

  • fixed Java API 2nd Query() after network error in 1st Query() call (bug #308)

  • fixed typo-class bugs in SetFilterFloatRange (bug #259), SetSortMode (bug #248)

  • fixed missing @@relaxed support (bug #276), fixed missing error on @nosuchfield queries, documented @@relaxed

  • fixed UNIX socket permissions to 0777 (bug #288)

  • fixed xmlpipe2 crash on schemas with no fields, added better document structure checks

  • fixed (and optimized) expr parser vs IN() with huge (10K+) args count

  • fixed double EarlyCalc() in fullscan mode (minor performance impact)

  • fixed phrase boundary handling in some cases (on buffer end, on trailing whitespace)

  • fixes in snippets (aka excerpts) generation

  • fixed inline attrs vs id64 index corruption

  • fixed head searchd crash on config re-parse failure

  • fixed handling of numeric keywords with leading zeroes such as "007" (bug #251)

  • fixed junk in SphinxSE status variables (bug #304)

  • fixed wordlist checkpoints serialization (bug #236)

  • fixed unaligned docinfo id access (bug #230)

  • fixed GetRawBytes() vs oversized blocks (headers with over 32K charset_table should now work, bug #300)

  • fixed buffer overflow caused by too long dest wordform, updated tests

  • fixed IF() return type (was always int, is deduced now)

  • fixed legacy queries vs. special chars vs. multiple indexes

  • fixed write-write-read socket access pattern vs Nagle vs delays vs FreeBSD (oh wow)

  • fixed exceptions vs query-parser issue

  • fixed late calc vs @weight in expressions (bug #285)

  • fixed early lookup/calc vs filters (bug #284)

  • fixed emulated MATCH_ANY queries (empty proximity and phrase queries are allowed now)

  • fixed MATCH_ANY ranker vs fields with no matches

  • fixed index file size vs inplace_enable (bug #245)

  • fixed that old logs were not closed on USR1 (bug #221)

  • fixed handling of '!' alias to NOT operator (bug #237)

  • fixed error handling vs query steps (step failure was not reported)

  • fixed querying vs inline attributes

  • fixed stupid bug in escaping code, fixed EscapeString() and made it static

  • fixed parser vs @field -keyword, foo|@field bar, "" queries (bug #310)

A.5. Version 0.9.9-rc1, 17 nov 2008

  • added min_stemming_len directive

  • added IsConnectError() API call (helps distingusih API vs remote errors)

  • added duplicate log messages filter to searchd

  • added --nodetach debugging switch to searchd

  • added blackhole agents support for debugging/testing (agent_blackhole directive)

  • added max_filters, max_filter_values directives (were hardcoded before)

  • added int64 expression evaluation path, automatic inference, and BIGINT() enforcer function

  • added crash handler for debugging (crash_log_path directive)

  • added MS SQL (aka SQL Server) source support (Windows only, mssql_winauth and mssql_unicode directives)

  • added indexer-side column unpacking feature (unpack_zlib, unpack_mysqlcompress directives)

  • added nested brackers and NOTs support to query language, rewritten query parser

  • added persistent connections support (Open() and Close() API calls)

  • added index_exact_words feature, and exact form operator to query language ("hello =world")

  • added status variables support to SphinxSE (SHOW STATUS LIKE 'sphinx_%')

  • added max_packet_size directive (was hardcoded at 8M before)

  • added UNIX socket support, and multi-interface support (listen directive)

  • added star-syntax support to BuildExcerpts() API call

  • added inplace inversion of .spa and .spp (inplace_enable directive, 1.5-2x less disk space for indexing)

  • added builtin Czech stemmer (morphology=stem_cz)

  • added IDIV(), NOW(), INTERVAL(), IN() functions to expressions

  • added index-level early-reject based on filters

  • added MVA updates feature (mva_updates_pool directive)

  • added select-list feature with computed expressions support (see SetSelect() API call, test.php --select switch), protocol 1.22

  • added integer expressions support (2x faster than float)

  • added multiforms support (multiple source words in wordforms file)

  • added legacy rankers (MATCH_ALL/MATCH_ANY/etc), removed legacy matching code (everything runs on V2 engine now)

  • added field position limit modifier to field operator (syntax: @title[50] hello world)

  • added killlist support (sql_query_killlist directive, --merge-killlists switch)

  • added on-disk SPI support (ondisk_dict directive)

  • added indexer IO stats

  • added periodic .spa flush (attr_flush_period directive)

  • added config reload on SIGHUP

  • added per-query attribute overrides feature (see SetOverride() API call); protocol 1.21

  • added signed 64bit attrs support (sql_attr_bigint directive)

  • improved HTML stripper to also skip PIs (<? ... ?>, such as <?php ... ?>)

  • improved excerpts speed (upto 50x faster on big documents)

  • fixed a short window of searchd inaccessibility on startup (started listen()ing too early before)

  • fixed .spa loading on systems where read() is 2GB capped

  • fixed infixes vs morphology issues

  • fixed backslash escaping, added backslash to EscapeString()

  • fixed handling of over-2GB dictionary files (.spi)

A.6. Version 0.9.8.1, 30 oct 2008

  • added configure script to libsphinxclient

  • changed proximity/quorum operator syntax to require whitespace after length

  • fixed potential head process crash on SIGPIPE during "maxed out" message

  • fixed handling of incomplete remote replies (caused over-degraded distributed results, in rare cases)

  • fixed sending of big remote requests (caused distributed requests to fail, in rare cases)

  • fixed FD_SET() overflow (caused searchd to crash on startup, in rare cases)

  • fixed MVA vs distributed indexes (caused loss of 1st MVA value in result set)

  • fixed tokenizing of exceptions terminated by specials (eg. "GPS AT&T" in extended mode)

  • fixed buffer overrun in stemmer on overlong tokens occasionally emitted by proximity/quorum operator parser (caused crashes on certain proximity/quorum queries)

  • fixed wordcount ranker (could be dropping hits)

  • fixed --merge feature (numerous different fixes, caused broken indexes)

  • fixed --merge-dst-range performance

  • fixed prefix/infix generation for stopwords

  • fixed ignore_chars vs specials

  • fixed misplaced F_SETLKW check (caused certain build types, eg. RPM build on FC8, to fail)

  • fixed dictionary-defined charsets support in spelldump, added \x-style wordchars support

  • fixed Java API to properly send long strings (over 64K; eg. long document bodies for excerpts)

  • fixed Python API to accept offset/limit of 'long' type

  • fixed default ID range (that filtered out all 64-bit values) in Java and Python APIs

A.7. Version 0.9.8, 14 jul 2008

Indexing

  • added support for 64-bit document and keyword IDs, --enable-id64 switch to configure

  • added support for floating point attributes

  • added support for bitfields in attributes, sql_attr_bool directive and bit-widths part in sql_attr_uint directive

  • added support for multi-valued attributes (MVA)

  • added metaphone preprocessor

  • added libstemmer library support, provides stemmers for a number of additional languages

  • added xmlpipe2 source type, that supports arbitrary fields and attributes

  • added word form dictionaries, wordforms directive (and spelldump utility)

  • added tokenizing exceptions, exceptions directive

  • added an option to fully remove element contents to HTML stripper, html_remove_elements directive

  • added HTML entities decoder (with full XHTML1 set support) to HTML stripper

  • added per-index HTML stripping settings, html_strip, html_index_attrs, and html_remove_elements directives

  • added IO load throttling, max_iops and max_iosize directives

  • added SQL load throttling, sql_ranged_throttle directive

  • added an option to index prefixes/infixes for given fields only, prefix_fields and infix_fields directives

  • added an option to ignore certain characters (instead of just treating them as whitespace), ignore_chars directive

  • added an option to increment word position on phrase boundary characters, phrase_boundary and phrase_boundary_step directives

  • added --merge-dst-range switch (and filters) to index merging feature (--merge switch)

  • added mysql_connect_flags directive (eg. to reduce indexing time MySQL network traffic and/or time)

  • improved ordinals sorting; now runs in fixed RAM

  • improved handling of documents with zero/NULL ids, now skipping them instead of aborting

Search daemon

  • added an option to unlink old index on succesful rotation, unlink_old directive

  • added an option to keep index files open at all times (fixes subtle races on rotation), preopen and preopen_indexes directives

  • added an option to profile searchd disk I/O, --iostats command-line option

  • added an option to rotate index seamlessly (fully avoids query stalls), seamless_rotate directive

  • added HTML stripping support to excerpts (uses per-index settings)

  • added 'exact_phrase', 'single_passage', 'use_boundaries', 'weight_order 'options to BuildExcerpts() API call

  • added distributed attribute updates propagation

  • added distributed retries on master node side

  • added log reopen on SIGUSR1

  • added --stop switch (sends SIGTERM to running instance)

  • added Windows service mode, and --servicename switch

  • added Windows --rotate support

  • improved log timestamping, now with millisecond precision

Querying

  • added extended engine V2 (faster, cleaner, better; SPH_MATCH_EXTENDED2 mode)

  • added ranking modes support (V2 engine only; SetRankingMode() API call)

  • added quorum searching support to query language (V2 engine only; example: "any three of all these words"/3)

  • added query escaping support to query language, and EscapeString() API call

  • added multi-field syntax support to query language (example: "@(field1,field2) something"), and @@relaxed field checks option

  • added optional star-syntax ('word*') support in keywords, enable_star directive (for prefix/infix indexes only)

  • added full-scan support (query must be fully empty; can perform block-reject optimization)

  • added COUNT(DISTINCT(attr)) calculation support, SetGroupDistinct() API call

  • added group-by on MVA support, SetArrayResult() PHP API call

  • added per-index weights feature, SetIndexWeights() API call

  • added geodistance support, SetGeoAnchor() API call

  • added result set sorting by arbitrary expressions in run time (eg. "@weight+log(price)*2.5"), SPH_SORT_EXPR mode

  • added result set sorting by @custom compile-time sorting function (see src/sphinxcustomsort.inl)

  • added result set sorting by @random value

  • added result set merging for indexes with different schemas

  • added query comments support (3rd arg to Query()/AddQuery() API calls, copied verbatim to query log)

  • added keyword extraction support, BuildKeywords() API call

  • added binding field weights by name, SetFieldWeights() API call

  • added optional limit on query time, SetMaxQueryTime() API call

  • added optional limit on found matches count (4rd arg to SetLimits() API call, so-called 'cutoff')

APIs and SphinxSE

  • added pure C API (libsphinxclient)

  • added Ruby API (thanks to Dmytro Shteflyuk)

  • added Java API

  • added SphinxSE support for MVAs (use varchar), floats (use float), 64bit docids (use bigint)

  • added SphinxSE options "floatrange", "geoanchor", "fieldweights", "indexweights", "maxquerytime", "comment", "host" and "port"; and support for "expr:CLAUSE"

  • improved SphinxSE max query size (using MySQL condition pushdown), upto 256K now

General

  • added scripting (shebang syntax) support to config files (example: #!/usr/bin/php in the first line)

  • added unified config handling and validation to all programs

  • added unified documentation

  • added .spec file for RPM builds

  • added automated testing suite

  • improved index locking, now fcntl()-based instead of buggy file-existence-based

  • fixed unaligned RAM accesses, now works on SPARC and ARM

Changes and fixes since 0.9.8-rc2

  • added pure C API (libsphinxclient)

  • added Ruby API

  • added SetConnectTimeout() PHP API call

  • added allowed type check to UpdateAttributes() handler (bug #174)

  • added defensive MVA checks on index preload (protection against broken indexes, bug #168)

  • added sphinx-min.conf sample file

  • added --without-iconv switch to configure

  • removed redundant -lz dependency in searchd

  • removed erroneous "xmlpipe2 deprecated" warning

  • fixed EINTR handling in piped read (bug #166)

  • fixup query time before logging and sending to client (bug #153)

  • fixed attribute updates vs full-scan early-reject index (bug #149)

  • fixed gcc warnings (bug #160)

  • fixed mysql connection attempt vs pgsql source type (bug #165)

  • fixed 32-bit wraparound when preloading over 2 GB files

  • fixed "out of memory" message vs over 2 GB allocs (bug #116)

  • fixed unaligned RAM access detection on ARM (where unaligned reads do not crash but produce wrong results)

  • fixed missing full scan results in some cases

  • fixed several bugs in --merge, --merge-dst-range

  • fixed @geodist vs MultiQuery and filters, @expr vs MultiQuery

  • fixed GetTokenEnd() vs 1-grams (was causing crash in excerpts)

  • fixed sql_query_range to handle empty strings in addition to NULL strings (Postgres specific)

  • fixed morphology=none vs infixes

  • fixed case sensitive attributes names in UpdateAttributes()

  • fixed ext2 ranking vs. stopwords (now using atompos from query parser)

  • fixed EscapeString() call

  • fixed escaped specials (now handled as whitespace if not in charset)

  • fixed schema minimizer (now handles type/size mismatches)

  • fixed word stats in extended2; stemmed form is now returned

  • fixed spelldump case folding vs dictionary-defined character sets

  • fixed Postgres BOOLEAN handling

  • fixed enforced "inline" docinfo on empty indexes (normally ok, but index merge was really confused)

  • fixed rare count(distinct) out-of-bounds issue (it occasionaly caused too high @distinct values)

  • fixed hangups on documents with id=DOCID_MAX in some cases

  • fixed rare crash in tokenizer (prefixed synonym vs. input stream eof)

  • fixed query parser vs "aaa (bbb ccc)|ddd" queries

  • fixed BuildExcerpts() request in Java API

  • fixed Postgres specific memory leak

  • fixed handling of overshort keywords (less than min_word_len)

  • fixed HTML stripper (now emits space after indexed attributes)

  • fixed 32-field case in query parser

  • fixed rare count(distinct) vs. querying multiple local indexes vs. reusable sorter issue

  • fixed sorting of negative floats in SPH_SORT_EXTENDED mode

A.8. Version 0.9.7, 02 apr 2007

  • added support for sql_str2ordinal_column

  • added support for upto 5 sort-by attrs (in extended sorting mode)

  • added support for separate groups sorting clause (in group-by mode)

  • added support for on-the-fly attribute updates (PRE-ALPHA; will change heavily; use for preliminary testing ONLY)

  • added support for zero/NULL attributes

  • added support for 0.9.7 features to SphinxSE

  • added support for n-grams (alpha, 1-grams only for now)

  • added support for warnings reported to client

  • added support for exclude-filters

  • added support for prefix and infix indexing (see max_prefix_len, max_infix_len)

  • added @* syntax to reset current field to query language

  • added removal of duplicate entries in query index order

  • added PHP API workarounds for PHP signed/unsigned braindamage

  • added locks to avoid two concurrent indexers working on same index

  • added check for existing attributes vs. docinfo=none case

  • improved groupby code a lot (better precision, and upto 25x times faster in extreme cases)

  • improved error handling and reporting

  • improved handling of broken indexes (reports error instead of hanging/crashing)

  • improved mmap() limits for attributes and wordlists (now able to map over 4 GB on x64 and over 2 GB on x32 where possible)

  • improved malloc() pressure in head daemon (search time should not degrade with time any more)

  • improved test.php command line options

  • improved error reporting (distributed query, broken index etc issues now reported to client)

  • changed default network packet size to be 8M, added extra checks

  • fixed division by zero in BM25 on 1-document collections (in extended matching mode)

  • fixed .spl files getting unlinked

  • fixed crash in schema compatibility test

  • fixed UTF-8 Russian stemmer

  • fixed requested matches count when querying distributed agents

  • fixed signed vs. unsigned issues everywhere (ranged queries, CLI search output, and obtaining docid)

  • fixed potential crashes vs. negative query offsets

  • fixed 0-match docs vs. extended mode vs. stats

  • fixed group/timestamp filters being ignored if querying from older clients

  • fixed docs to mention pgsql source type

  • fixed issues with explicit '&' in extended matching mode

  • fixed wrong assertion in SBCS encoder

  • fixed crashes with no-attribute indexes after rotate

A.9. Version 0.9.7-rc2, 15 dec 2006

  • added support for extended matching mode (query language)

  • added support for extended sorting mode (sorting clauses)

  • added support for SBCS excerpts

  • added mmap()ing for attributes and wordlist (improves search time, speeds up fork() greatly)

  • fixed attribute name handling to be case insensitive

  • fixed default compiler options to simplify post-mortem debugging (added -g, removed -fomit-frame-pointer)

  • fixed rare memory leak

  • fixed "hello hello" queries in "match phrase" mode

  • fixed issue with excerpts, texts and overlong queries

  • fixed logging multiple index name (no longer tokenized)

  • fixed trailing stopword not flushed from tokenizer

  • fixed boolean evaluation

  • fixed pidfile being wrongly unlink()ed on bind() failure

  • fixed --with-mysql-includes/libs (they conflicted with well-known paths)

  • fixes for 64-bit platforms

A.10. Version 0.9.7-rc1, 26 oct 2006

  • added alpha index merging code

  • added an option to decrease max_matches per-query

  • added an option to specify IP address for searchd to listen on

  • added support for unlimited amount of configured sources and indexes

  • added support for group-by queries

  • added support for /2 range modifier in charset_table

  • added support for arbitrary amount of document attributes

  • added logging filter count and index name

  • added --with-debug option to configure to compile in debug mode

  • added -DNDEBUG when compiling in default mode

  • improved search time (added doclist size hints, in-memory wordlist cache, and used VLB coding everywhere)

  • improved (refactored) SQL driver code (adding new drivers should be very easy now)

  • improved exceprts generation

  • fixed issue with empty sources and ranged queries

  • fixed querying purely remote distributed indexes

  • fixed suffix length check in English stemmer in some cases

  • fixed UTF-8 decoder for codes over U+20000 (for CJK)

  • fixed UTF-8 encoder for 3-byte sequences (for CJK)

  • fixed overshort (less than min_word_len) words prepended to next field

  • fixed source connection order (indexer does not connect to all sources at once now)

  • fixed line numbering in config parser

  • fixed some issues with index rotation

A.11. Version 0.9.6, 24 jul 2006

  • added support for empty indexes

  • added support for multiple sql_query_pre/post/post_index

  • fixed timestamp ranges filter in "match any" mode

  • fixed configure issues with --without-mysql and --with-pgsql options

  • fixed building on Solaris 9

A.12. Version 0.9.6-rc1, 26 jun 2006

  • added boolean queries support (experimental, beta version)

  • added simple file-based query cache (experimental, beta version)

  • added storage engine for MySQL 5.0 and 5.1 (experimental, beta version)

  • added GNU style configure script

  • added new searchd protocol (all binary, and should be backwards compatible)

  • added distributed searching support to searchd

  • added PostgreSQL driver

  • added excerpts generation

  • added min_word_len option to index

  • added max_matches option to searchd, removed hardcoded MAX_MATCHES limit

  • added initial documentation, and a working example.sql

  • added support for multiple sources per index

  • added soundex support

  • added group ID ranges support

  • added --stdin command-line option to search utility

  • added --noprogress option to indexer

  • added --index option to search

  • fixed UTF-8 decoder (3-byte codepoints did not work)

  • fixed PHP API to handle big result sets faster

  • fixed config parser to handle empty values properly

  • fixed redundant time(NULL) calls in time-segments mode

coreseek-4.1-beta/csft-4.1/doc/sphinx.txt100777 0 0 1455726 11643565731 13403 0Sphinx 2.0.1-beta reference manual ================================== Free open-source SQL full-text search engine ============================================ Copyright (c) 2001-2011 Andrew Aksyonoff Copyright (c) 2008-2011 Sphinx Technologies Inc, http://sphinxsearch.com ---------------------------------------------------------------------------- Table of Contents 1. Introduction 1.1. About 1.2. Sphinx features 1.3. Where to get Sphinx 1.4. License 1.5. Credits 1.6. History 2. Installation 2.1. Supported systems 2.2. Required tools 2.3. Installing Sphinx on Linux 2.4. Installing Sphinx on Windows 2.5. Known installation issues 2.6. Quick Sphinx usage tour 3. Indexing 3.1. Data sources 3.2. Attributes 3.3. MVA (multi-valued attributes) 3.4. Indexes 3.5. Restrictions on the source data 3.6. Charsets, case folding, and translation tables 3.7. SQL data sources (MySQL, PostgreSQL) 3.8. xmlpipe data source 3.9. xmlpipe2 data source 3.10. Live index updates 3.11. Delta index updates 3.12. Index merging 4. Real-time indexes 4.1. RT indexes overview 4.2. Known caveats with RT indexes 4.3. RT index internals 4.4. Binary logging 5. Searching 5.1. Matching modes 5.2. Boolean query syntax 5.3. Extended query syntax 5.4. Weighting 5.5. Expressions, functions, and operators 5.5.1. Operators 5.5.2. Numeric functions 5.5.3. Date and time functions 5.5.4. Type conversion functions 5.5.5. Comparison functions 5.5.6. Miscellaneous functions 5.6. Sorting modes 5.7. Grouping (clustering) search results 5.8. Distributed searching 5.9. searchd query log formats 5.9.1. Plain log format 5.9.2. SphinxQL log format 5.10. MySQL protocol support and SphinxQL 5.11. Multi-queries 5.12. Collations 5.13. User-defined functions (UDF) 6. Command line tools reference 6.1. indexer command reference 6.2. searchd command reference 6.3. search command reference 6.4. spelldump command reference 6.5. indextool command reference 7. SphinxQL reference 7.1. SELECT syntax 7.2. SHOW META syntax 7.3. SHOW WARNINGS syntax 7.4. SHOW STATUS syntax 7.5. INSERT and REPLACE syntax 7.6. DELETE syntax 7.7. SET syntax 7.8. BEGIN, COMMIT, and ROLLBACK syntax 7.9. CALL SNIPPETS syntax 7.10. CALL KEYWORDS syntax 7.11. SHOW TABLES syntax 7.12. DESCRIBE syntax 7.13. CREATE FUNCTION syntax 7.14. DROP FUNCTION syntax 7.15. SHOW VARIABLES syntax 7.16. SHOW COLLATION syntax 7.17. UPDATE syntax 7.18. Multi-statement queries 7.19. Comment syntax 7.20. List of SphinxQL reserved keywords 7.21. SphinxQL upgrade notes, version 2.0.1-beta 8. API reference 8.1. General API functions 8.1.1. GetLastError 8.1.2. GetLastWarning 8.1.3. SetServer 8.1.4. SetRetries 8.1.5. SetConnectTimeout 8.1.6. SetArrayResult 8.1.7. IsConnectError 8.2. General query settings 8.2.1. SetLimits 8.2.2. SetMaxQueryTime 8.2.3. SetOverride 8.2.4. SetSelect 8.3. Full-text search query settings 8.3.1. SetMatchMode 8.3.2. SetRankingMode 8.3.3. SetSortMode 8.3.4. SetWeights 8.3.5. SetFieldWeights 8.3.6. SetIndexWeights 8.4. Result set filtering settings 8.4.1. SetIDRange 8.4.2. SetFilter 8.4.3. SetFilterRange 8.4.4. SetFilterFloatRange 8.4.5. SetGeoAnchor 8.5. GROUP BY settings 8.5.1. SetGroupBy 8.5.2. SetGroupDistinct 8.6. Querying 8.6.1. Query 8.6.2. AddQuery 8.6.3. RunQueries 8.6.4. ResetFilters 8.6.5. ResetGroupBy 8.7. Additional functionality 8.7.1. BuildExcerpts 8.7.2. UpdateAttributes 8.7.3. BuildKeywords 8.7.4. EscapeString 8.7.5. Status 8.7.6. FlushAttributes 8.8. Persistent connections 8.8.1. Open 8.8.2. Close 9. MySQL storage engine (SphinxSE) 9.1. SphinxSE overview 9.2. Installing SphinxSE 9.2.1. Compiling MySQL 5.0.x with SphinxSE 9.2.2. Compiling MySQL 5.1.x with SphinxSE 9.2.3. Checking SphinxSE installation 9.3. Using SphinxSE 9.4. Building snippets (excerpts) via MySQL 10. Reporting bugs 11. sphinx.conf options reference 11.1. Data source configuration options 11.1.1. type 11.1.2. sql_host 11.1.3. sql_port 11.1.4. sql_user 11.1.5. sql_pass 11.1.6. sql_db 11.1.7. sql_sock 11.1.8. mysql_connect_flags 11.1.9. mysql_ssl_cert, mysql_ssl_key, mysql_ssl_ca 11.1.10. odbc_dsn 11.1.11. sql_query_pre 11.1.12. sql_query 11.1.13. sql_joined_field 11.1.14. sql_query_range 11.1.15. sql_range_step 11.1.16. sql_query_killlist 11.1.17. sql_attr_uint 11.1.18. sql_attr_bool 11.1.19. sql_attr_bigint 11.1.20. sql_attr_timestamp 11.1.21. sql_attr_str2ordinal 11.1.22. sql_attr_float 11.1.23. sql_attr_multi 11.1.24. sql_attr_string 11.1.25. sql_attr_str2wordcount 11.1.26. sql_column_buffers 11.1.27. sql_field_string 11.1.28. sql_field_str2wordcount 11.1.29. sql_file_field 11.1.30. sql_query_post 11.1.31. sql_query_post_index 11.1.32. sql_ranged_throttle 11.1.33. sql_query_info 11.1.34. xmlpipe_command 11.1.35. xmlpipe_field 11.1.36. xmlpipe_field_string 11.1.37. xmlpipe_field_wordcount 11.1.38. xmlpipe_attr_uint 11.1.39. xmlpipe_attr_bool 11.1.40. xmlpipe_attr_timestamp 11.1.41. xmlpipe_attr_str2ordinal 11.1.42. xmlpipe_attr_float 11.1.43. xmlpipe_attr_multi 11.1.44. xmlpipe_attr_string 11.1.45. xmlpipe_fixup_utf8 11.1.46. mssql_winauth 11.1.47. mssql_unicode 11.1.48. unpack_zlib 11.1.49. unpack_mysqlcompress 11.1.50. unpack_mysqlcompress_maxsize 11.2. Index configuration options 11.2.1. type 11.2.2. source 11.2.3. path 11.2.4. docinfo 11.2.5. mlock 11.2.6. morphology 11.2.7. dict 11.2.8. index_sp 11.2.9. index_zones 11.2.10. min_stemming_len 11.2.11. stopwords 11.2.12. wordforms 11.2.13. exceptions 11.2.14. min_word_len 11.2.15. charset_type 11.2.16. charset_table 11.2.17. ignore_chars 11.2.18. min_prefix_len 11.2.19. min_infix_len 11.2.20. prefix_fields 11.2.21. infix_fields 11.2.22. enable_star 11.2.23. ngram_len 11.2.24. ngram_chars 11.2.25. phrase_boundary 11.2.26. phrase_boundary_step 11.2.27. html_strip 11.2.28. html_index_attrs 11.2.29. html_remove_elements 11.2.30. local 11.2.31. agent 11.2.32. agent_blackhole 11.2.33. agent_connect_timeout 11.2.34. agent_query_timeout 11.2.35. preopen 11.2.36. ondisk_dict 11.2.37. inplace_enable 11.2.38. inplace_hit_gap 11.2.39. inplace_docinfo_gap 11.2.40. inplace_reloc_factor 11.2.41. inplace_write_factor 11.2.42. index_exact_words 11.2.43. overshort_step 11.2.44. stopword_step 11.2.45. hitless_words 11.2.46. expand_keywords 11.2.47. blend_chars 11.2.48. blend_mode 11.2.49. rt_mem_limit 11.2.50. rt_field 11.2.51. rt_attr_uint 11.2.52. rt_attr_bigint 11.2.53. rt_attr_float 11.2.54. rt_attr_timestamp 11.2.55. rt_attr_string 11.3. indexer program configuration options 11.3.1. mem_limit 11.3.2. max_iops 11.3.3. max_iosize 11.3.4. max_xmlpipe2_field 11.3.5. write_buffer 11.3.6. max_file_field_buffer 11.4. searchd program configuration options 11.4.1. listen 11.4.2. address 11.4.3. port 11.4.4. log 11.4.5. query_log 11.4.6. query_log_format 11.4.7. read_timeout 11.4.8. client_timeout 11.4.9. max_children 11.4.10. pid_file 11.4.11. max_matches 11.4.12. seamless_rotate 11.4.13. preopen_indexes 11.4.14. unlink_old 11.4.15. attr_flush_period 11.4.16. ondisk_dict_default 11.4.17. max_packet_size 11.4.18. mva_updates_pool 11.4.19. crash_log_path 11.4.20. max_filters 11.4.21. max_filter_values 11.4.22. listen_backlog 11.4.23. read_buffer 11.4.24. read_unhinted 11.4.25. max_batch_queries 11.4.26. subtree_docs_cache 11.4.27. subtree_hits_cache 11.4.28. workers 11.4.29. dist_threads 11.4.30. binlog_path 11.4.31. binlog_flush 11.4.32. binlog_max_log_size 11.4.33. collation_server 11.4.34. collation_libc_locale 11.4.35. plugin_dir 11.4.36. mysql_version_string 11.4.37. rt_flush_period 11.4.38. thread_stack 11.4.39. expansion_limit 11.4.40. compat_sphinxql_magics 11.4.41. watchdog A. Sphinx revision history A.1. Version 2.0.1-beta, 22 apr 2011 A.2. Version 1.10-beta, 19 jul 2010 A.3. Version 0.9.9-release, 02 dec 2009 A.4. Version 0.9.9-rc2, 08 apr 2009 A.5. Version 0.9.9-rc1, 17 nov 2008 A.6. Version 0.9.8.1, 30 oct 2008 A.7. Version 0.9.8, 14 jul 2008 A.8. Version 0.9.7, 02 apr 2007 A.9. Version 0.9.7-rc2, 15 dec 2006 A.10. Version 0.9.7-rc1, 26 oct 2006 A.11. Version 0.9.6, 24 jul 2006 A.12. Version 0.9.6-rc1, 26 jun 2006 List of Examples 3.1. Ranged query usage example 3.2. XMLpipe document stream 3.3. xmlpipe2 document stream 3.4. Fully automated live updates 4.1. RT index declaration 5.1. Boolean query example 5.2. Extended matching mode: query example Chapter 1. Introduction ======================= Table of Contents 1.1. About 1.2. Sphinx features 1.3. Where to get Sphinx 1.4. License 1.5. Credits 1.6. History 1.1. About ========== Sphinx is a full-text search engine, publicly distributed under GPL version 2. Commercial licensing (eg. for embedded use) is available upon request. Technically, Sphinx is a standalone software package provides fast and relevant full-text search functionality to client applications. It was specially designed to integrate well with SQL databases storing the data, and to be easily accessed scripting languages. However, Sphinx does not depend on nor require any specific database to function. Applications can access Sphinx search daemon (searchd) using any of the three different access methods: a) via native search API (SphinxAPI), b) via Sphinx own implementation of MySQL network protocol (using a small SQL subset called SphinxQL), or c) via MySQL server with a pluggable storage engine (SphinxSE). Official native SphinxAPI implementations for PHP, Perl, Ruby, and Java are included within the distribution package. API is very lightweight so porting it to a new language is known to take a few hours or days. Third party API ports and plugins exist for Perl, C#, Haskell, Ruby-on-Rails, and possibly other languages and frameworks. Starting version 1.10-beta, Sphinx supports two different indexing backends: "disk" index backend, and "realtime" (RT) index backend. Disk indexes support online full-text index rebuilds, but online updates can only be done on non-text (attribute) data. RT indexes additionally allow for online full-text index updates. Previous versions only supported disk indexes. Data can be loaded into disk indexes using a so-called data source. Built-in sources can fetch data directly from MySQL, PostgreSQL, ODBC compliant database (MS SQL, Oracle, etc), or a pipe in a custom XML format. Adding new data sources drivers (eg. to natively support other DBMSes) is designed to be as easy as possible. RT indexes, as of 1.10-beta, can only be populated using SphinxQL. As for the name, Sphinx is an acronym which is officially decoded as SQL Phrase Index. Yes, I know about CMU's Sphinx project. 1.2. Sphinx features ==================== Key Sphinx features are: * high indexing and searching performance; * advanced indexing and querying tools (flexible and feature-rich text tokenizer, querying language, several different ranking modes, etc); * advanced result set post-processing (SELECT with expressions, WHERE, ORDER BY, GROUP BY etc over text search results); * proven scalability up to billions of documents, terabytes of data, and thousands of queries per second; * easy integration with SQL and XML data sources, and SphinxAPI, SphinxQL, or SphinxSE search interfaces; * easy scaling with distributed searches. To expand a bit, Sphinx: * has high indexing speed (upto 10-15 MB/sec per core on an internal benchmark); * has high search speed (upto 150-250 queries/sec per core against 1,000,000 documents, 1.2 GB of data on an internal benchmark); * has high scalability (biggest known cluster indexes over 3,000,000,000 documents, and busiest one peaks over 50,000,000 queries/day); * provides good relevance ranking through combination of phrase proximity ranking and statistical (BM25) ranking; * provides distributed searching capabilities; * provides document excerpts (snippets) generation; * provides searching from within application with SphinxAPI or SphinxQL interfaces, and from within MySQL with pluggable SphinxSE storage engine; * supports boolean, phrase, word proximity and other types of queries; * supports multiple full-text fields per document (upto 32 by default); * supports multiple additional attributes per document (ie. groups, timestamps, etc); * supports stopwords; * supports morphological word forms dictionaries; * supports tokenizing exceptions; * supports both single-byte encodings and UTF-8; * supports stemming (stemmers for English, Russian and Czech are built-in; and stemmers for French, Spanish, Portuguese, Italian, Romanian, German, Dutch, Swedish, Norwegian, Danish, Finnish, Hungarian, are available by building third party libstemmer library); * supports MySQL natively (all types of tables, including MyISAM, InnoDB, NDB, Archive, etc are supported); * supports PostgreSQL natively; * supports ODBC compliant databases (MS SQL, Oracle, etc) natively; * ...has 50+ other features not listed here, refer to API and configuration manual! 1.3. Where to get Sphinx ======================== Sphinx is available through its official Web site at http://sphinxsearch.com/. Currently, Sphinx distribution tarball includes the following software: * indexer: an utility which creates fulltext indexes; * search: a simple command-line (CLI) test utility which searches through fulltext indexes; * searchd: a daemon which enables external software (eg. Web applications) to search through fulltext indexes; * sphinxapi: a set of searchd client API libraries for popular Web scripting languages (PHP, Python, Perl, Ruby). * spelldump: a simple command-line tool to extract the items from an ispell or MySpell (as bundled with OpenOffice) format dictionary to help customize your index, for use with wordforms. * indextool: an utility to dump miscellaneous debug information about the index, added in version 0.9.9-rc2. 1.4. License ============ 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. See COPYING file for details. 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, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Non-GPL licensing (for OEM/ISV embedded use) can also be arranged, please contact us to discuss commercial licensing possibilities. 1.5. Credits ============ Author ------ Sphinx initial author (and a benevolent dictator ever since): * Andrew Aksyonoff, http://shodan.ru Team ---- Past and present employees of Sphinx Technologies Inc who should be noted on their work on Sphinx (in alphabetical order): * Alexander Klimenko * Alexey Dvoichenkov * Alexey Vinogradov * Ilya Kuznetsov * Stanislav Klinov Contributors ------------ People who contributed to Sphinx and their contributions (in no particular order): * Robert "coredev" Bengtsson (Sweden), initial version of PostgreSQL data source * Len Kranendonk, Perl API * Dmytro Shteflyuk, Ruby API Many other people have contributed ideas, bug reports, fixes, etc. Thank you! 1.6. History ============ Sphinx development was started back in 2001, because I didn't manage to find an acceptable search solution (for a database driven Web site) which would meet my requirements. Actually, each and every important aspect was a problem: * search quality (ie. good relevance) * statistical ranking methods performed rather bad, especially on large collections of small documents (forums, blogs, etc) * search speed * especially if searching for phrases which contain stopwords, as in "to be or not to be" * moderate disk and CPU requirements when indexing * important in shared hosting enivronment, not to mention the indexing speed. Despite the amount of time passed and numerous improvements made in the other solutions, there's still no solution which I personally would be eager to migrate to. Considering that and a lot of positive feedback received from Sphinx users during last years, the obvious decision is to continue developing Sphinx (and, eventually, to take over the world). Chapter 2. Installation ======================= Table of Contents 2.1. Supported systems 2.2. Required tools 2.3. Installing Sphinx on Linux 2.4. Installing Sphinx on Windows 2.5. Known installation issues 2.6. Quick Sphinx usage tour 2.1. Supported systems ====================== Most modern UNIX systems with a C++ compiler should be able to compile and run Sphinx without any modifications. Currently known systems Sphinx has been successfully running on are: * Linux 2.4.x, 2.6.x (many various distributions) * Windows 2000, XP * FreeBSD 4.x, 5.x, 6.x, 7.x * NetBSD 1.6, 3.0 * Solaris 9, 11 * Mac OS X CPU architectures known to work include X86, X86-64, SPARC64, ARM. Chance are good that Sphinx should work on other Unix platforms as well; please report any platforms missing from this list that worked for you! 2.2. Required tools =================== On UNIX, you will need the following tools to build and install Sphinx: * a working C++ compiler. GNU gcc is known to work. * a good make program. GNU make is known to work. On Windows, you will need Microsoft Visual C/C++ Studio .NET 2003 or 2005. Other compilers/environments will probably work as well, but for the time being, you will have to build makefile (or other environment specific project files) manually. 2.3. Installing Sphinx on Linux =============================== 1. Extract everything from the distribution tarball (haven't you already?) and go to the sphinx subdirectory. (We are using version 2.0.1-beta here for the sake of example only; be sure to change this to a specific version you're using.) | $ tar xzvf sphinx-2.0.1-beta.tar.gz | $ cd sphinx 2. Run the configuration program: | $ ./configure There's a number of options to configure. The complete listing may be obtained by using --help switch. The most important ones are: * --prefix, which specifies where to install Sphinx; such as --prefix=/usr/local/sphinx (all of the examples use this prefix) * --with-mysql, which specifies where to look for MySQL include and library files, if auto-detection fails; * --with-pgsql, which specifies where to look for PostgreSQL include and library files. 3. Build the binaries: | $ make 4. Install the binaries in the directory of your choice: (defaults to /usr/local/bin/ on *nix systems, but is overridden with configure --prefix) | $ make install 2.4. Installing Sphinx on Windows ================================= Installing Sphinx on a Windows server is often easier than installing on a Linux environment; unless you are preparing code patches, you can use the pre-compiled binary files from the Downloads area on the website. 1. Extract everything from the .zip file you have downloaded - sphinx-2.0.1-beta-win32.zip, or sphinx-2.0.1-beta-win32-pgsql.zip if you need PostgresSQL support as well. (We are using version 2.0.1-beta here for the sake of example only; be sure to change this to a specific version you're using.) You can use Windows Explorer in Windows XP and up to extract the files, or a freeware package like 7Zip to open the archive. For the remainder of this guide, we will assume that the folders are unzipped into C:\Sphinx, such that searchd.exe can be found in C:\Sphinx\bin\searchd.exe. If you decide to use any different location for the folders or configuration file, please change it accordingly. 2. Edit the contents of sphinx.conf.in - specifically entries relating to @CONFDIR@ - to paths suitable for your system. 3. Install the searchd system as a Windows service: | C:\Sphinx\bin> C:\Sphinx\bin\searchd --install --config | C:\Sphinx\sphinx.conf.in --servicename SphinxSearch 4. The searchd service will now be listed in the Services panel within the Management Console, available from Administrative Tools. It will not have been started, as you will need to configure it and build your indexes with indexer before starting the service. A guide to do this can be found under Quick tour. During the next steps of the install (which involve running indexer pretty much as you would on Linux) you may find that you get an error relating to libmysql.dll not being found. If you have MySQL installed, you should find a copy of this library in your Windows directory, or sometimes in Windows\System32, or failing that in the MySQL core directories. If you do receive an error please copy libmysql.dll into the bin directory. 2.5. Known installation issues ============================== If configure fails to locate MySQL headers and/or libraries, try checking for and installing mysql-devel package. On some systems, it is not installed by default. If make fails with a message which look like | /bin/sh: g++: command not found | make[1]: *** [libsphinx_a-sphinx.o] Error 127 try checking for and installing gcc-c++ package. If you are getting compile-time errors which look like | sphinx.cpp:67: error: invalid application of `sizeof' to | incomplete type `Private::SizeError' this means that some compile-time type size check failed. The most probable reason is that off_t type is less than 64-bit on your system. As a quick hack, you can edit sphinx.h and replace off_t with DWORD in a typedef for SphOffset_t, but note that this will prohibit you from using full-text indexes larger than 2 GB. Even if the hack helps, please report such issues, providing the exact error message and compiler/OS details, so I could properly fix them in next releases. If you keep getting any other error, or the suggestions above do not seem to help you, please don't hesitate to contact me. 2.6. Quick Sphinx usage tour ============================ All the example commands below assume that you installed Sphinx in /usr/local/sphinx, so searchd can be found in /usr/local/sphinx/bin/searchd. To use Sphinx, you will need to: 1. Create a configuration file. Default configuration file name is sphinx.conf. All Sphinx programs look for this file in current working directory by default. Sample configuration file, sphinx.conf.dist, which has all the options documented, is created by configure. Copy and edit that sample file to make your own configuration: (assuming Sphinx is installed into /usr/local/sphinx/) | $ cd /usr/local/sphinx/etc | $ cp sphinx.conf.dist sphinx.conf | $ vi sphinx.conf Sample configuration file is setup to index documents table from MySQL database test; so there's example.sql sample data file to populate that table with a few documents for testing purposes: | $ mysql -u test < /usr/local/sphinx/etc/example.sql 2. Run the indexer to create full-text index from your data: | $ cd /usr/local/sphinx/etc | $ /usr/local/sphinx/bin/indexer --all 3. Query your newly created index! To query the index from command line, use search utility: | $ cd /usr/local/sphinx/etc | $ /usr/local/sphinx/bin/search test To query the index from your PHP scripts, you need to: 1. Run the search daemon which your script will talk to: | $ cd /usr/local/sphinx/etc | $ /usr/local/sphinx/bin/searchd 2. Run the attached PHP API test script (to ensure that the daemon was succesfully started and is ready to serve the queries): | $ cd sphinx/api | $ php test.php test 3. Include the API (it's located in api/sphinxapi.php) into your own scripts and use it. Happy searching! Chapter 3. Indexing =================== Table of Contents 3.1. Data sources 3.2. Attributes 3.3. MVA (multi-valued attributes) 3.4. Indexes 3.5. Restrictions on the source data 3.6. Charsets, case folding, and translation tables 3.7. SQL data sources (MySQL, PostgreSQL) 3.8. xmlpipe data source 3.9. xmlpipe2 data source 3.10. Live index updates 3.11. Delta index updates 3.12. Index merging 3.1. Data sources ================= The data to be indexed can generally come from very different sources: SQL databases, plain text files, HTML files, mailboxes, and so on. From Sphinx point of view, the data it indexes is a set of structured documents, each of which has the same set of fields. This is biased towards SQL, where each row correspond to a document, and each column to a field. Depending on what source Sphinx should get the data from, different code is required to fetch the data and prepare it for indexing. This code is called data source driver (or simply driver or data source for brevity). At the time of this writing, there are drivers for MySQL and PostgreSQL databases, which can connect to the database using its native C/C++ API, run queries and fetch the data. There's also a driver called xmlpipe, which runs a specified command and reads the data from its stdout. See Section 3.8, <> section for the format description. There can be as many sources per index as necessary. They will be sequentially processed in the very same order which was specifed in index definition. All the documents coming from those sources will be merged as if they were coming from a single source. 3.2. Attributes =============== Attributes are additional values associated with each document that can be used to perform additional filtering and sorting during search. It is often desired to additionally process full-text search results based not only on matching document ID and its rank, but on a number of other per-document values as well. For instance, one might need to sort news search results by date and then relevance, or search through products within specified price range, or limit blog search to posts made by selected users, or group results by month. To do that efficiently, Sphinx allows to attach a number of additional attributes to each document, and store their values in the full-text index. It's then possible to use stored values to filter, sort, or group full-text matches. Attributes, unlike the fields, are not full-text indexed. They are stored in the index, but it is not possible to search them as full-text, and attempting to do so results in an error. For example, it is impossible to use the extended matching mode expression @column 1 to match documents where column is 1, if column is an attribute, and this is still true even if the numeric digits are normally indexed. Attributes can be used for filtering, though, to restrict returned rows, as well as sorting or result grouping; it is entirely possible to sort results purely based on attributes, and ignore the search relevance tools. Additionally, attributes are returned from the search daemon, while the indexed text is not. A good example for attributes would be a forum posts table. Assume that only title and content fields need to be full-text searchable - but that sometimes it is also required to limit search to a certain author or a sub-forum (ie. search only those rows that have some specific values of author_id or forum_id columns in the SQL table); or to sort matches by post_date column; or to group matching posts by month of the post_date and calculate per-group match counts. This can be achieved by specifying all the mentioned columns (excluding title and content, that are full-text fields) as attributes, indexing them, and then using API calls to setup filtering, sorting, and grouping. Here as an example. Example sphinx.conf part: ------------------------- | ... | sql_query = SELECT id, title, content, \ | author_id, forum_id, post_date FROM my_forum_posts | sql_attr_uint = author_id | sql_attr_uint = forum_id | sql_attr_timestamp = post_date | ... Example application code (in PHP): ---------------------------------- | // only search posts by author whose ID is 123 | $cl->SetFilter ( "author_id", array ( 123 ) ); | | // only search posts in sub-forums 1, 3 and 7 | $cl->SetFilter ( "forum_id", array ( 1,3,7 ) ); | | // sort found posts by posting date in descending order | $cl->SetSortMode ( SPH_SORT_ATTR_DESC, "post_date" ); Attributes are named. Attribute names are case insensitive. Attributes are not full-text indexed; they are stored in the index as is. Currently supported attribute types are: * unsigned integers (1-bit to 32-bit wide); * UNIX timestamps; * floating point values (32-bit, IEEE 754 single precision); * string ordinals (specially computed integers); * strings (since 1.10-beta); * MVA, multi-value attributes (variable-length lists of 32-bit unsigned integers). The complete set of per-document attribute values is sometimes referred to as docinfo. Docinfos can either be * stored separately from the main full-text index data ("extern" storage, in .spa file), or * attached to each occurence of document ID in full-text index data ("inline" storage, in .spd file). When using extern storage, a copy of .spa file (with all the attribute values for all the documents) is kept in RAM by searchd at all times. This is for performance reasons; random disk I/O would be too slow. On the contrary, inline storage does not require any additional RAM at all, but that comes at the cost of greatly inflating the index size: remember that it copies all attribute value every time when the document ID is mentioned, and that is exactly as many times as there are different keywords in the document. Inline may be the only viable option if you have only a few attributes and need to work with big datasets in limited RAM. However, in most cases extern storage makes both indexing and searching much more efficient. Search-time memory requirements for extern storage are (1+number_of_attrs)*number_of_docs*4 bytes, ie. 10 million docs with 2 groups and 1 timestamp will take (1+2+1)*10M*4 = 160 MB of RAM. This is PER DAEMON, not per query. searchd will allocate 160 MB on startup, read the data and keep it shared between queries. The children will NOT allocate any additional copies of this data. 3.3. MVA (multi-valued attributes) ================================== MVAs, or multi-valued attributes, are an important special type of per-document attributes in Sphinx. MVAs make it possible to attach lists of values to every document. They are useful for article tags, product categories, etc. Filtering and group-by (but not sorting) on MVA attributes is supported. Currently, MVA list entries are limited to unsigned 32-bit integers. The list length is not limited, you can have an arbitrary number of values attached to each document as long as RAM permits (.spm file that contains the MVA values will be precached in RAM by searchd). The source data can be taken either from a separate query, or from a document field; see source type in sql_attr_multi. In the first case the query will have to return pairs of document ID and MVA values, in the second one the field will be parsed for integer values. There are absolutely no requirements as to incoming data order; the values will be automatically grouped by document ID (and internally sorted within the same ID) during indexing anyway. When filtering, a document will match the filter on MVA attribute if any of the values satisfy the filtering condition. (Therefore, documents that pass through exclude filters will not contain any of the forbidden values.) When grouping by MVA attribute, a document will contribute to as many groups as there are different MVA values associated with that document. For instance, if the collection contains exactly 1 document having a 'tag' MVA with values 5, 7, and 11, grouping on 'tag' will produce 3 groups with '@count' equal to 1 and '@groupby' key values of 5, 7, and 11 respectively. Also note that grouping by MVA might lead to duplicate documents in the result set: because each document can participate in many groups, it can be chosen as the best one in in more than one group, leading to duplicate IDs. PHP API historically uses ordered hash on the document ID for the resulting rows; so you'll also need to use SetArrayResult() in order to employ group-by on MVA with PHP API. 3.4. Indexes ============ To be able to answer full-text search queries fast, Sphinx needs to build a special data structure optimized for such queries from your text data. This structure is called index; and the process of building index from text is called indexing. Different index types are well suited for different tasks. For example, a disk-based tree-based index would be easy to update (ie. insert new documents to existing index), but rather slow to search. Therefore, Sphinx architecture allows for different index types to be implemented easily. The only index type which is implemented in Sphinx at the moment is designed for maximum indexing and searching speed. This comes at a cost of updates being really slow; theoretically, it might be slower to update this type of index than than to reindex it from scratch. However, this very frequently could be worked around with muiltiple indexes, see Section 3.10, <> for details. It is planned to implement more index types, including the type which would be updateable in real time. There can be as many indexes per configuration file as necessary. indexer utility can reindex either all of them (if --all option is specified), or a certain explicitly specified subset. searchd utility will serve all the specified indexes, and the clients can specify what indexes to search in run time. 3.5. Restrictions on the source data ==================================== There are a few different restrictions imposed on the source data which is going to be indexed by Sphinx, of which the single most important one is: ALL DOCUMENT IDS MUST BE UNIQUE UNSIGNED NON-ZERO INTEGER NUMBERS (32-BIT OR 64-BIT, DEPENDING ON BUILD TIME SETTINGS). If this requirement is not met, different bad things can happen. For instance, Sphinx can crash with an internal assertion while indexing; or produce strange results when searching due to conflicting IDs. Also, a 1000-pound gorilla might eventually come out of your display and start throwing barrels at you. You've been warned. 3.6. Charsets, case folding, and translation tables =================================================== When indexing some index, Sphinx fetches documents from the specified sources, splits the text into words, and does case folding so that "Abc", "ABC" and "abc" would be treated as the same word (or, to be pedantic, term). To do that properly, Sphinx needs to know * what encoding is the source text in; * what characters are letters and what are not; * what letters should be folded to what letters. This should be configured on a per-index basis using charset_type and charset_table options. charset_type specifies whether the document encoding is single-byte (SBCS) or UTF-8. charset_table specifies the table that maps letter characters to their case folded versions. The characters that are not in the table are considered to be non-letters and will be treated as word separators when indexing or searching through this index. Note that while default tables do not include space character (ASCII code 0x20, Unicode U+0020) as a letter, it's in fact perfectly legal to do so. This can be useful, for instance, for indexing tag clouds, so that space-separated word sets would index as a single search query term. Default tables currently include English and Russian characters. Please do submit your tables for other languages! 3.7. SQL data sources (MySQL, PostgreSQL) ========================================= With all the SQL drivers, indexing generally works as follows. * connection to the database is established; * pre-query (see Section 11.1.11, <>) is executed to perform any necessary initial setup, such as setting per-connection encoding with MySQL; * main query (see Section 11.1.12, <>) is executed and the rows it returns are indexed; * post-query (see Section 11.1.30, <>) is executed to perform any necessary cleanup; * connection to the database is closed; * indexer does the sorting phase (to be pedantic, index-type specific post-processing); * connection to the database is established again; * post-index query (see Section 11.1.31, <>) is executed to perform any necessary final cleanup; * connection to the database is closed again. Most options, such as database user/host/password, are straightforward. However, there are a few subtle things, which are discussed in more detail here. Ranged queries -------------- Main query, which needs to fetch all the documents, can impose a read lock on the whole table and stall the concurrent queries (eg. INSERTs to MyISAM table), waste a lot of memory for result set, etc. To avoid this, Sphinx supports so-called ranged queries. With ranged queries, Sphinx first fetches min and max document IDs from the table, and then substitutes different ID intervals into main query text and runs the modified query to fetch another chunk of documents. Here's an example. Example 3.1. Ranged query usage example | # in sphinx.conf | | sql_query_range = SELECT MIN(id),MAX(id) FROM documents | sql_range_step = 1000 | sql_query = SELECT * FROM documents WHERE id>=$start AND id<=$end If the table contains document IDs from 1 to, say, 2345, then sql_query would be run three times: 1. with $start replaced with 1 and $end replaced with 1000; 2. with $start replaced with 1001 and $end replaced with 2000; 3. with $start replaced with 2000 and $end replaced with 2345. Obviously, that's not much of a difference for 2000-row table, but when it comes to indexing 10-million-row MyISAM table, ranged queries might be of some help. sql_post vs. sql_post_index --------------------------- The difference between post-query and post-index query is in that post-query is run immediately when Sphinx received all the documents, but further indexing may still fail for some other reason. On the contrary, by the time the post-index query gets executed, it is guaranteed that the indexing was succesful. Database connection is dropped and re-established because sorting phase can be very lengthy and would just timeout otherwise. 3.8. xmlpipe data source ======================== xmlpipe data source was designed to enable users to plug data into Sphinx without having to implement new data sources drivers themselves. It is limited to 2 fixed fields and 2 fixed attributes, and is deprecated in favor of Section 3.9, <> now. For new streams, use xmlpipe2. To use xmlpipe, configure the data source in your configuration file as follows: | source example_xmlpipe_source | { | type = xmlpipe | xmlpipe_command = perl /www/mysite.com/bin/sphinxpipe.pl | } The indexer will run the command specified in xmlpipe_command, and then read, parse and index the data it prints to stdout. More formally, it opens a pipe to given command and then reads from that pipe. indexer will expect one or more documents in custom XML format. Here's the example document stream, consisting of two documents: Example 3.2. XMLpipe document stream | | 123 | 45 | 1132223498 | test title | | this is my document body | | | | | 124 | 46 | 1132223498 | another test | | this is another document | | Legacy xmlpipe legacy driver uses a builtin parser which is pretty fast but really strict and does not actually fully support XML. It requires that all the fields must be present, formatted exactly as in this example, and occur exactly in the same order. The only optional field is timestamp; it defaults to 1. 3.9. xmlpipe2 data source ========================= xmlpipe2 lets you pass arbitrary full-text and attribute data to Sphinx in yet another custom XML format. It also allows to specify the schema (ie. the set of fields and attributes) either in the XML stream itself, or in the source settings. When indexing xmlpipe2 source, indexer runs the given command, opens a pipe to its stdout, and expects well-formed XML stream. Here's sample stream data: Example 3.3. xmlpipe2 document stream | | | | | | | | | | | | this is the main content entry | must be handled properly by xml parser lib]]> | 1012325463 | note how field/attr tags can be | in randomized order | some undeclared element | | | | another subject | here comes another document, and i am given to understand, | that in-document field order must not matter, sir | 1012325467 | | | | | | 1234 | 4567 | | | Arbitrary fields and attributes are allowed. They also can occur in the stream in arbitrary order within each document; the order is ignored. There is a restriction on maximum field length; fields longer than 2 MB will be truncated to 2 MB (this limit can be changed in the source). The schema, ie. complete fields and attributes list, must be declared before any document could be parsed. This can be done either in the configuration file using xmlpipe_field and xmlpipe_attr_XXX settings, or right in the stream using element. is optional. It is only allowed to occur as the very first sub-element in . If there is no in-stream schema definition, settings from the configuration file will be used. Otherwise, stream settings take precedence. Unknown tags (which were not declared neither as fields nor as attributes) will be ignored with a warning. In the example above, will be ignored. All embedded tags and their attributes (such as in in the example above) will be silently ignored. Support for incoming stream encodings depends on whether iconv is installed on the system. xmlpipe2 is parsed using libexpat parser that understands US-ASCII, ISO-8859-1, UTF-8 and a few UTF-16 variants natively. Sphinx configure script will also check for libiconv presence, and utilize it to handle other encodings. libexpat also enforces the requirement to use UTF-8 charset on Sphinx side, because the parsed data it returns is always in UTF-8. XML elements (tags) recognized by xmlpipe2 (and their attributes where applicable) are: sphinx:docset Mandatory top-level element, denotes and contains xmlpipe2 document set. sphinx:schema Optional element, must either occur as the very first child of sphinx:docset, or never occur at all. Declares the document schema. Contains field and attribute declarations. If present, overrides per-source settings from the configuration file. sphinx:field Optional element, child of sphinx:schema. Declares a full-text field. Known attributes are: * "name", specifies the XML element name that will be treated as a full-text field in the subsequent documents. * "attr", specifies whether to also index this field as a string or word count attribute. Possible values are "string" and "wordcount". Introduced in version 1.10-beta. sphinx:attr Optional element, child of sphinx:schema. Declares an attribute. Known attributes are: * "name", specifies the element name that should be treated as an attribute in the subsequent documents. * "type", specifies the attribute type. Possible values are "int", "timestamp", "str2ordinal", "bool", "float" and "multi". * "bits", specifies the bit size for "int" attribute type. Valid values are 1 to 32. * "default", specifies the default value for this attribute that should be used if the attribute's element is not present in the document. sphinx:document Mandatory element, must be a child of sphinx:docset. Contains arbitrary other elements with field and attribute values to be indexed, as declared either using sphinx:field and sphinx:attr elements or in the configuration file. The only known attribute is "id" that must contain the unique integer document ID. sphinx:killlist Optional element, child of sphinx:docset. Contains a number of "id" elements whose contents are document IDs to be put into a kill-list for this index. 3.10. Live index updates ======================== There are two major approaches to maintaining the full-text index contents up to date. Note, however, that both these approaches deal with the task of full-text data updates, and not attribute updates. Instant attribute updates are supported since version 0.9.8. Refer to UpdateAttributes() API call description for details. First, you can use disk-based indexes, partition them manually, and only rebuild the smaller partitions (so-called "deltas") frequently. By minimizing the rebuild size, you can reduce the average indexing lag to something as low as 30-60 seconds. This approach was the the only one available in versions 0.9.x. On huge collections it actually might be the most efficient one. Refer to Section 3.11, <> for details. Second, versions 1.x (starting with 1.10-beta) add support for so-called real-time indexes (RT indexes for short) that on-the-fly updates of the full-text data. Updates on a RT index can appear in the search results in 1-2 milliseconds, ie. 0.001-0.002 seconds. However, RT index are less efficient for bulk indexing huge amounts of data. Refer to Chapter 4, Real-time indexes for details. 3.11. Delta index updates ========================= There's a frequent situation when the total dataset is too big to be reindexed from scratch often, but the amount of new records is rather small. Example: a forum with a 1,000,000 archived posts, but only 1,000 new posts per day. In this case, "live" (almost real time) index updates could be implemented using so called "main+delta" scheme. The idea is to set up two sources and two indexes, with one "main" index for the data which only changes rarely (if ever), and one "delta" for the new documents. In the example above, 1,000,000 archived posts would go to the main index, and newly inserted 1,000 posts/day would go to the delta index. Delta index could then be reindexed very frequently, and the documents can be made available to search in a matter of minutes. Specifying which documents should go to what index and reindexing main index could also be made fully automatical. One option would be to make a counter table which would track the ID which would split the documents, and update it whenever the main index is reindexed. Example 3.4. Fully automated live updates | # in MySQL | CREATE TABLE sph_counter | ( | counter_id INTEGER PRIMARY KEY NOT NULL, | max_doc_id INTEGER NOT NULL | ); | | # in sphinx.conf | source main | { | # ... | sql_query_pre = SET NAMES utf8 | sql_query_pre = REPLACE INTO sph_counter SELECT 1, MAX(id) FROM documents | sql_query = SELECT id, title, body FROM documents \ | WHERE id<=( SELECT max_doc_id FROM sph_counter WHERE counter_id=1 ) | } | | source delta : main | { | sql_query_pre = SET NAMES utf8 | sql_query = SELECT id, title, body FROM documents \ | WHERE id>( SELECT max_doc_id FROM sph_counter WHERE counter_id=1 ) | } | | index main | { | source = main | path = /path/to/main | # ... all the other settings | } | | # note how all other settings are copied from main, | # but source and path are overridden (they MUST be) | index delta : main | { | source = delta | path = /path/to/delta | } Note how we're overriding sql_query_pre in the delta source. We need to explicitly have that override. Otherwise REPLACE query would be run when indexing delta source too, effectively nullifying it. However, when we issue the directive in the inherited source for the first time, it removes all inherited values, so the encoding setup is also lost. So sql_query_pre in the delta can not just be empty; and we need to issue the encoding setup query explicitly once again. 3.12. Index merging =================== Merging two existing indexes can be more efficient that indexing the data from scratch, and desired in some cases (such as merging 'main' and 'delta' indexes instead of simply reindexing 'main' in 'main+delta' partitioning scheme). So indexer has an option to do that. Merging the indexes is normally faster than reindexing but still not instant on huge indexes. Basically, it will need to read the contents of both indexes once and write the result once. Merging 100 GB and 1 GB index, for example, will result in 202 GB of IO (but that's still likely less than the indexing from scratch requires). The basic command syntax is as follows: | indexer --merge DSTINDEX SRCINDEX [--rotate] Only the DSTINDEX index will be affected: the contents of SRCINDEX will be merged into it. --rotate switch will be required if DSTINDEX is already being served by searchd. The initially devised usage pattern is to merge a smaller update from SRCINDEX into DSTINDEX. Thus, when merging the attributes, values from SRCINDEX will win if duplicate document IDs are encountered. Note, however, that the "old" keywords will not be automatically removed in such cases. For example, if there's a keyword "old" associated with document 123 in DSTINDEX, and a keyword "new" associated with it in SRCINDEX, document 123 will be found by both keywords after the merge. You can supply an explicit condition to remove documents from DSTINDEX to mitigate that; the relevant switch is --merge-dst-range: | indexer --merge main delta --merge-dst-range deleted 0 0 This switch lets you apply filters to the destination index along with merging. There can be several filters; all of their conditions must be met in order to include the document in the resulting mergid index. In the example above, the filter passes only those records where 'deleted' is 0, eliminating all records that were flagged as deleted (for instance, using UpdateAttributes() call). Chapter 4. Real-time indexes ============================ Table of Contents 4.1. RT indexes overview 4.2. Known caveats with RT indexes 4.3. RT index internals 4.4. Binary logging Real-time indexes (or RT indexes for brevity) are a new backend that lets you insert, update, or delete documents (rows) on the fly. RT indexes were added in version 1.10-beta. While querying of RT indexes is possible using any of the SphinxAPI, SphinxQL, or SphinxSE, updating them is only possible via SphinxQL at the moment. Full SphinxQL reference is available in Chapter 7, SphinxQL reference. 4.1. RT indexes overview ======================== RT indexes should be declared in sphinx.conf, just as every other index type. Notable differences from the regular, disk-based indexes are that a) data sources are not required and ignored, and b) you should explicitly enumerate all the text fields, not just attributes. Here's an example: Example 4.1. RT index declaration | index rt | { | type = rt | path = /usr/local/sphinx/data/rt | rt_field = title | rt_field = content | rt_attr_uint = gid | } RT INDEXES ARE CURRENTLY (AS OF VERSION 1.10-beta) A WORK IN PROGRESS. Therefore, they might lack certain features: for instance, prefix/infix indexing, MVA attributes, etc are not supported yet. There also might be performance and stability issues. However, all the regular indexing features and most of the searching features are already in place, our internal testing passes, and last but not least a number of production instances are already using RT indexes with good results. RT index can be accessed using MySQL protocol. INSERT, REPLACE, DELETE, and SELECT statements against RT index are supported. For instance, this is an example session with the sample index above: | $ mysql -h 127.0.0.1 -P 9306 | Welcome to the MySQL monitor. Commands end with ; or \g. | Your MySQL connection id is 1 | Server version: 1.10-dev (r2153) | | Type 'help;' or '\h' for help. Type '\c' to clear the buffer. | | mysql> INSERT INTO rt VALUES ( 1, 'first record', 'test one', 123 ); | Query OK, 1 row affected (0.05 sec) | | mysql> INSERT INTO rt VALUES ( 2, 'second record', 'test two', 234 ); | Query OK, 1 row affected (0.00 sec) | | mysql> SELECT * FROM rt; | +------+--------+------+ | | id | weight | gid | | +------+--------+------+ | | 1 | 1 | 123 | | | 2 | 1 | 234 | | +------+--------+------+ | 2 rows in set (0.02 sec) | | mysql> SELECT * FROM rt WHERE MATCH('test'); | +------+--------+------+ | | id | weight | gid | | +------+--------+------+ | | 1 | 1643 | 123 | | | 2 | 1643 | 234 | | +------+--------+------+ | 2 rows in set (0.01 sec) | | mysql> SELECT * FROM rt WHERE MATCH('@title test'); | Empty set (0.00 sec) Both partial and batch INSERT syntaxes are supported, ie. you can specify a subset of columns, and insert several rows at a time. Deletions are also possible using DELETE statement; the only currently supported syntax is DELETE FROM WHERE id=. REPLACE is also supported, enabling you to implement updates. | mysql> INSERT INTO rt ( id, title ) VALUES ( 3, 'third row' ), ( 4, 'fourth entry' ); | Query OK, 2 rows affected (0.01 sec) | | mysql> SELECT * FROM rt; | +------+--------+------+ | | id | weight | gid | | +------+--------+------+ | | 1 | 1 | 123 | | | 2 | 1 | 234 | | | 3 | 1 | 0 | | | 4 | 1 | 0 | | +------+--------+------+ | 4 rows in set (0.00 sec) | | mysql> DELETE FROM rt WHERE id=2; | Query OK, 0 rows affected (0.00 sec) | | mysql> SELECT * FROM rt WHERE MATCH('test'); | +------+--------+------+ | | id | weight | gid | | +------+--------+------+ | | 1 | 1500 | 123 | | +------+--------+------+ | 1 row in set (0.00 sec) | | mysql> INSERT INTO rt VALUES ( 1, 'first record on steroids', 'test one', 123 ); | ERROR 1064 (42000): duplicate id '1' | | mysql> REPLACE INTO rt VALUES ( 1, 'first record on steroids', 'test one', 123 ); | Query OK, 1 row affected (0.01 sec) | | mysql> SELECT * FROM rt WHERE MATCH('steroids'); | +------+--------+------+ | | id | weight | gid | | +------+--------+------+ | | 1 | 1500 | 123 | | +------+--------+------+ | 1 row in set (0.01 sec) Data stored in RT index should survive clean shutdown. When binary logging is enabled, it should also survive crash and/or dirty shutdown, and recover on subsequent startup. 4.2. Known caveats with RT indexes ================================== As of 1.10-beta, RT indexes are a beta quality feature: while no major, showstopper-class issues are known, there still are a few known usage quirks. Those quirks are listed in this section. * Prefix and infix indexing are not supported yet. * MVAs are not supported yet. * Disk chunks optimization routine is not implemented yet. * On initial index creation, attributes are reordered by type, in the following order: uint, bigint, float, timestamp, string. So when using INSERT without an explicit column names list, specify all uint column values first, then bigint, etc. * Default conservative RAM chunk limit (rt_mem_limit) of 32M can lead to poor performance on bigger indexes, you should raise it to 256..1024M if you're planning to index gigabytes. * High DELETE/REPLACE rate can lead to kill-list fragmentation and impact searching performance. * No transaction size limits are currently imposed; too many concurrent INSERT/REPLACE transactions might therefore consume a lot of RAM. * In case of a damaged binlog, recovery will stop on the first damaged transaction, even though it's technically possible to keep looking further for subsequent undamaged transactions, and recover those. This mid-file damage case (due to flaky HDD/CDD/tape?) is supposed to be extremely rare, though. * Multiple INSERTs grouped in a single transaction perform better than equivalent single-row transactions and are recommended for batch loading of data. 4.3. RT index internals ======================= RT index is internally chunked. It keeps a so-called RAM chunk that stores all the most recent changes. RAM chunk memory usage is rather strictly limited with per-index rt_mem_limit directive. Once RAM chunk grows over this limit, a new disk chunk is created from its data, and RAM chunk is reset. Thus, while most changes on the RT index will be performed in RAM only and complete instantly (in milliseconds), those changes that overflow the RAM chunk will stall for the duration of disk chunk creation (a few seconds). Disk chunks are, in fact, just regular disk-based indexes. But they're a part of an RT index and automatically managed by it, so you need not configure nor manage them manually. Because a new disk chunk is created every time RT chunk overflows the limit, and because in-memory chunk format is close to on-disk format, the disk chunks will be approximately rt_mem_limit bytes in size each. Generally, it is better to set the limit bigger, to minimize both the frequency of flushes, and the index fragmentation (number of disk chunks). For instance, on a dedicated search server that handles a big RT index, it can be advised to set rt_mem_limit to 1-2 GB. A global limit on all indexes is also planned, but not yet implemented yet as of 1.10-beta. Disk chunk full-text index data can not be actually modified, so the full-text field changes (ie. row deletions and updates) suppress a previous row version from a disk chunk using a kill-list, but do not actually physically purge the data. Therefore, on workloads with high full-text updates ratio index might eventually get polluted by these previous row versions, and searching performance would degrade. Physical index purging that would improve the performance is planned, but not yet implemented as of 1.10-beta. Data in RAM chunk gets saved to disk on clean daemon shutdown, and then loaded back on startup. However, on daemon or server crash, updates from RAM chunk might be lost. To prevent that, binary logging of transactions can be used; see Section 4.4, <> for details. Full-text changes in RT index are transactional. They are stored in a per-thread accumulator until COMMIT, then applied at once. Bigger batches per single COMMIT should result in faster indexing. 4.4. Binary logging =================== Binary logs are essentially a recovery mechanism. With binary logs enabled, searchd writes every given transaction to the binlog file, and uses that for recovery after an unclean shutdown. On clean shutdown, RAM chunks are saved to disk, and then all the binlog files are unlinked. During normal operation, a new binlog file will be opened every time when binlog_max_log_size limit (which defaults to 128M) is reached. Older, already closed binlog files are kept until all of the transactions stored in them (from all indexes) are flushed as a disk chunk. Setting the limit to 0 pretty much prevents binlog from being unlinked at all while searchd is running; however, it will still be unlinked on clean shutdown. There are 3 different binlog flushing strategies, controlled by binlog_flush directive which takes the values of 0, 1, or 2. 0 means to flush the log to OS and sync it to disk every second; 1 means flush and sync every transaction; and 2 (the default mode) means flush every transaction but sync every second. Sync is relatively slow because it has to perform physical disk writes, so mode 1 is the safest (every committed transaction is guaranteed to be written on disk) but the slowest. Flushing log to OS prevents from data loss on searchd crashes but not system crashes. Mode 2 is the default. On recovery after an unclean shutdown, binlogs are replayed and all logged transactions since the last good on-disk state are restored. Transactions are checksummed so in case of binlog file corruption garbage data will not be replayed; such a broken transaction will be detected and, currently, will stop replay. Transactions also start with a magic marker and timestamped, so in case of binlog damage in the middle of the file, it's technically possible to skip broken transactions and keep replaying from the next good one, and/or it's possible to replay transactions until a given timestamp (point-in-time recovery), but none of that is implemented yet as of 1.10-beta. One unwanted side effect of binlogs is that activel updating a small RT index that fully fits into a RAM chunk part will lead to an ever-growing binlog that can never be unlinked until clean shutdown. Binlogs are essentially append-only deltas against the last known good saved state on disk, and unless RAM chunk gets saved, they can not be unlinked. An ever-growing binlog is not very good for disk use and crash recovery time. Starting with 2.0.1-beta you can configure searchd to perform a periodic RAM chunk flush to fix that problem using a rt_flush_period directive. With periodic flushes enabled, searchd will keep a separate thread, checking whether RT indexes RAM chunks need to be written back to disk. Once that happens, the respective binlogs can be (and are) safely unlinked. Note that rt_flush_period only controls the frequency at which the checks happen. There are no guarantees that the particular RAM chunk will get saved. For instance, it does not make sense to regularly re-save a huge RAM chunk that only gets a few rows worh of updates. The search daemon determine whether to actually perform the flush with a few heuristics. Chapter 5. Searching ==================== Table of Contents 5.1. Matching modes 5.2. Boolean query syntax 5.3. Extended query syntax 5.4. Weighting 5.5. Expressions, functions, and operators 5.5.1. Operators 5.5.2. Numeric functions 5.5.3. Date and time functions 5.5.4. Type conversion functions 5.5.5. Comparison functions 5.5.6. Miscellaneous functions 5.6. Sorting modes 5.7. Grouping (clustering) search results 5.8. Distributed searching 5.9. searchd query log formats 5.9.1. Plain log format 5.9.2. SphinxQL log format 5.10. MySQL protocol support and SphinxQL 5.11. Multi-queries 5.12. Collations 5.13. User-defined functions (UDF) 5.1. Matching modes =================== There are the following matching modes available: * SPH_MATCH_ALL, matches all query words (default mode); * SPH_MATCH_ANY, matches any of the query words; * SPH_MATCH_PHRASE, matches query as a phrase, requiring perfect match; * SPH_MATCH_BOOLEAN, matches query as a boolean expression (see Section 5.2, <>); * SPH_MATCH_EXTENDED, matches query as an expression in Sphinx internal query language (see Section 5.3, <>). As of 0.9.9, this has been superceded by SPH_MATCH_EXTENDED2, providing additional functionality and better performance. The ident is retained for legacy application code that will continue to be compatible once Sphinx and its components, including the API, are upgraded. * SPH_MATCH_EXTENDED2, matches query using the second version of the Extended matching mode. * SPH_MATCH_FULLSCAN, matches query, forcibly using the "full scan" mode as below. NB, any query terms will be ignored, such that filters, filter-ranges and grouping will still be applied, but no text-matching. The SPH_MATCH_FULLSCAN mode will be automatically activated in place of the specified matching mode when the following conditions are met: 1. The query string is empty (ie. its length is zero). 2. docinfo storage is set to extern. In full scan mode, all the indexed documents will be considered as matching. Such queries will still apply filters, sorting, and group by, but will not perform any full-text searching. This can be useful to unify full-text and non-full-text searching code, or to offload SQL server (there are cases when Sphinx scans will perform better than analogous MySQL queries). An example of using the full scan mode might be to find posts in a forum. By selecting the forum's user ID via SetFilter() but not actually providing any search text, Sphinx will match every document (i.e. every post) where SetFilter() would match - in this case providing every post from that user. By default this will be ordered by relevancy, followed by Sphinx document ID in ascending order (earliest first). 5.2. Boolean query syntax ========================= Boolean queries allow the following special operators to be used: * explicit operator AND: | hello & world * operator OR: | hello | world * operator NOT: | hello -world | hello !world * grouping: | ( hello world ) Here's an example query which uses all these operators: Example 5.1. Boolean query example | ( cat -dog ) | ( cat -mouse) There always is implicit AND operator, so "hello world" query actually means "hello & world". OR operator precedence is higher than AND, so "looking for cat | dog | mouse" means "looking for ( cat | dog | mouse )" and not "(looking for cat) | dog | mouse". Queries like "-dog", which implicitly include all documents from the collection, can not be evaluated. This is both for technical and performance reasons. Technically, Sphinx does not always keep a list of all IDs. Performance-wise, when the collection is huge (ie. 10-100M documents), evaluating such queries could take very long. 5.3. Extended query syntax ========================== The following special operators and modifiers can be used when using the extended matching mode: * operator OR: | hello | world * operator NOT: | hello -world | hello !world * field search operator: | @title hello @body world * field position limit modifier (introduced in version 0.9.9-rc1): | @body[50] hello * multiple-field search operator: | @(title,body) hello world * all-field search operator: | @* hello * phrase search operator: | "hello world" * proximity search operator: | "hello world"~10 * quorum matching operator: | "the world is a wonderful place"/3 * strict order operator (aka operator "before"): | aaa << bbb << ccc * exact form modifier (introduced in version 0.9.9-rc1): | raining =cats and =dogs * field-start and field-end modifier (introduced in version 0.9.9-rc2): | ^hello world$ * NEAR, generalized proximity operator (introduced in version 2.0.1-beta): | hello NEAR/3 world NEAR/4 "my test" * SENTENCE operator (introduced in version 2.0.1-beta): | all SENTENCE words SENTENCE "in one sentence" * PARAGRAPH operator (introduced in version 2.0.1-beta): | "Bill Gates" PARAGRAPH "Steve Jobs" * zone limit operator: | ZONE:(h3,h4) only in these titles Here's an example query that uses some of these operators: Example 5.2. Extended matching mode: query example | "hello world" @title "example program"~5 @body python -(php|perl) @* code The full meaning of this search is: * Find the words 'hello' and 'world' adjacently in any field in a document; * Additionally, the same document must also contain the words 'example' and 'program' in the title field, with up to, but not including, 10 words between the words in question; (E.g. "example PHP program" would be matched however "example script to introduce outside data into the correct context for your program" would not because two terms have 10 or more words between them) * Additionally, the same document must contain the word 'python' in the body field, but not contain either 'php' or 'perl'; * Additionally, the same document must contain the word 'code' in any field. There always is implicit AND operator, so "hello world" means that both "hello" and "world" must be present in matching document. OR operator precedence is higher than AND, so "looking for cat | dog | mouse" means "looking for ( cat | dog | mouse )" and not "(looking for cat) | dog | mouse". Field limit operator limits subsequent searching to a given field. Normally, query will fail with an error message if given field name does not exist in the searched index. However, that can be suppressed by specifying "@@relaxed" option at the very beginning of the query: | @@relaxed @nosuchfield my query This can be helpful when searching through heterogeneous indexes with different schemas. Field position limit, introduced in version 0.9.9-rc1, additionaly restricts the searching to first N position within given field (or fields). For example, "@body[50] hello" will not match the documents where the keyword 'hello' occurs at position 51 and below in the body. Proximity distance is specified in words, adjusted for word count, and applies to all words within quotes. For instance, "cat dog mouse"~5 query means that there must be less than 8-word span which contains all 3 words, ie. "CAT aaa bbb ccc DOG eee fff MOUSE" document will not match this query, because this span is exactly 8 words long. Quorum matching operator introduces a kind of fuzzy matching. It will only match those documents that pass a given threshold of given words. The example above ("the world is a wonderful place"/3) will match all documents that have at least 3 of the 6 specified words. Strict order operator (aka operator "before"), introduced in version 0.9.9-rc2, will match the document only if its argument keywords occur in the document exactly in the query order. For instance, "black << cat" query (without quotes) will match the document "black and white cat" but not the "that cat was black" document. Order operator has the lowest priority. It can be applied both to just keywords and more complex expressions, ie. this is a valid query: | (bag of words) << "exact phrase" << red|green|blue Exact form keyword modifier, introduced in version 0.9.9-rc1, will match the document only if the keyword occurred in exactly the specified form. The default behaviour is to match the document if the stemmed keyword matches. For instance, "runs" query will match both the document that contains "runs" and the document that contains "running", because both forms stem to just "run" - while "=runs" query will only match the first document. Exact form operator requires index_exact_words option to be enabled. This is a modifier that affects the keyword and thus can be used within operators such as phrase, proximity, and quorum operators. Field-start and field-end keyword modifiers, introduced in version 0.9.9-rc2, will make the keyword match only if it occurred at the very start or the very end of a fulltext field, respectively. For instance, the query "^hello world$" (with quotes and thus combining phrase operator and start/end modifiers) will only match documents that contain at least one field that has exactly these two keywords. Starting with 0.9.9-rc1, arbitrarily nested brackets and negations are allowed. However, the query must be possible to compute without involving an implicit list of all documents: | // correct query | aaa -(bbb -(ccc ddd)) | | // queries that are non-computable | -aaa | aaa | -bbb NEAR operator, added in 2.0.1-beta, is a generalized version of a proximity operator. The syntax is NEAR/N, it is case-sensitive, and no spaces are allowed beetwen the NEAR keyword, the slash sign, and the distance value. The original proximity operator only worked on sets of keywords. NEAR is more generic and can accept arbitrary subexpressions as its two arguments, matching the document when both subexpressions are found within N words of each other, no matter in which order. NEAR is left associative and has the same (lowest) precedence as BEFORE. You should also note how a (one NEAR/7 two NEAR/7 three) query using NEAR is not really equivalent to a ("one two three"~7) one using keyword proximity operator. The difference here is that the proximity operator allows for up to 6 non-matching words between all the 3 matching words, but the version with NEAR is less restrictive: it would allow for up to 6 words between 'one' and 'two' and then for up to 6 more between that two-word matching and a 'three' keyword. SENTENCE and PARAGRAPH operators, added in 2.0.1-beta, matches the document when both its arguments are within the same sentence or the same paragraph of text, respectively. The arguments can be either keywords, or phrases, or the instances of the same operator. Here are a few examples: | one SENTENCE two | one SENTENCE "two three" | one SENTENCE "two three" SENTENCE four The order of the arguments within the sentence or paragraph does not matter. These operators only work on indexes built with index_sp (sentence and paragraph indexing feature) enabled, and revert to a mere AND otherwise. Refer to the index_sp directive documentation for the notes on what's considered a sentence and a paragraph. ZONE limit operator, added in 2.0.1-beta, is quite similar to field limit operator, but restricts matching to a given in-field zone or a list of zones. Note that the subsequent subexpressions are not required to match in a single contiguous span of a given zone, and may match in multiple spans. For instance, (ZONE:th hello world) query will match this example document: | Table 1. Local awareness of Hello Kitty brand. | .. some table data goes here .. | Table 2. World-wide brand awareness. ZONE operator affects the query until the next field or ZONE limit operator, or the closing parenthesis. It only works on the indexes built with zones support (see Section 11.2.9, <>) and will be ignored otherwise. 5.4. Weighting ============== Specific weighting function (currently) depends on the search mode. There are these major parts which are used in the weighting functions: 1. phrase rank, 2. statistical rank. Phrase rank is based on a length of longest common subsequence (LCS) of search words between document body and query phrase. So if there's a perfect phrase match in some document then its phrase rank would be the highest possible, and equal to query words count. Statistical rank is based on classic BM25 function which only takes word frequencies into account. If the word is rare in the whole database (ie. low frequency over document collection) or mentioned a lot in specific document (ie. high frequency over matching document), it receives more weight. Final BM25 weight is a floating point number between 0 and 1. In all modes, per-field weighted phrase ranks are computed as a product of LCS multiplied by per-field weight speficifed by user. Per-field weights are integer, default to 1, and can not be set lower than 1. In SPH_MATCH_BOOLEAN mode, no weighting is performed at all, every match weight is set to 1. In SPH_MATCH_ALL and SPH_MATCH_PHRASE modes, final weight is a sum of weighted phrase ranks. In SPH_MATCH_ANY mode, the idea is essentially the same, but it also adds a count of matching words in each field. Before that, weighted phrase ranks are additionally mutliplied by a value big enough to guarantee that higher phrase rank in any field will make the match ranked higher, even if it's field weight is low. In SPH_MATCH_EXTENDED mode, final weight is a sum of weighted phrase ranks and BM25 weight, multiplied by 1000 and rounded to integer. This is going to be changed, so that MATCH_ALL and MATCH_ANY modes use BM25 weights as well. This would improve search results in those match spans where phrase ranks are equal; this is especially useful for 1-word queries. The key idea (in all modes, besides boolean) is that better subphrase matches are ranked higher, and perfect matches are pulled to the top. Author's experience is that this phrase proximity based ranking provides noticeably better search quality than any statistical scheme alone (such as BM25, which is commonly used in other search engines). 5.5. Expressions, functions, and operators ========================================== Sphinx lets you use arbitrary arithmetic expressions both via SphinxQL and SphinxAPI, involving attribute values, internal attributes (document ID and relevance weight), arithmetic operations, a number of built-in functions, and user-defined functions. This section documents the supported operators and functions. Here's the complete reference list for quick access. * Arithmetic operators: +, -, *, /, %, DIV, MOD * Comparison operators: <, > <=, >=, =, <> * Boolean operators: AND, OR, NOT * Bitwise operators: &, | * ABS() * BIGINT() * CEIL() * COS() * CRC32() * DAY() * EXP() * FLOOR() * GEODIST() * IDIV() * IF() * IN() * INTERVAL() * LN() * LOG10() * LOG2() * MAX() * MIN() * MONTH() * NOW() * POW() * SIN() * SINT() * SQRT() * YEAR() * YEARMONTH() * YEARMONTHDAY() 5.5.1. Operators ---------------- Arithmetic operators: +, -, *, /, %, DIV, MOD The standard arithmetic operators. Arithmetic calculations involving those can be performed in three different modes: (a) using single-precision, 32-bit IEEE 754 floating point values (the default), (b) using signed 32-bit integers, (c) using 64-bit signed integers. The expression parser will automatically switch to integer mode if there are no operations the result in a floating point value. Otherwise, it will use the default floating point mode. For instance, a+b will be computed using 32-bit integers if both arguments are 32-bit integers; or using 64-bit integers if both arguments are integers but one of them is 64-bit; or in floats otherwise. However, a/b or sqrt(a) will always be computed in floats, because these operations return a result of non-integer type. To avoid the first, you can either use IDIV(a,b) or a DIV b form. Also, a*b will not be automatically promoted to 64-bit when the arguments are 32-bit. To enforce 64-bit results, you can use BIGINT(). (But note that if there are non-integer operations, BIGINT() will simply be ignored.) Comparison operators: <, > <=, >=, =, <> Comparison operators (eg. = or <=) return 1.0 when the condition is true and 0.0 otherwise. For instance, (a=b)+3 will evaluate to 4 when attribute 'a' is equal to attribute 'b', and to 3 when 'a' is not. Unlike MySQL, the equality comparisons (ie. = and <> operators) introduce a small equality threshold (1e-6 by default). If the difference between compared values is within the threshold, they will be considered equal. Boolean operators: AND, OR, NOT Boolean operators (AND, OR, NOT) were introduced in 0.9.9-rc2 and behave as usual. They are left-associative and have the least priority compared to other operators. NOT has more priority than AND and OR but nevertheless less than any other operator. AND and OR have the same priority so brackets use is recommended to avoid confusion in complex expressions. Bitwise operators: &, | These operators perform bitwise AND and OR respectively. The operands must be of an integer types. Introduced in version 1.10-beta. 5.5.2. Numeric functions ------------------------ ABS() Returns the absolute value of the argument. CEIL() Returns the smallest integer value greater or equal to the argument. COS() Returns the cosine of the argument. EXP() Returns the exponent of the argument (e=2.718... to the power of the argument). FLOOR() Returns the largest integer value lesser or equal to the argument. IDIV() Returns the result of an integer division of the first argument by the second argument. Both arguments must be of an integer type. LN() Returns the natural logarithm of the argument (with the base of e=2.718...). LOG10() Returns the common logarithm of the argument (with the base of 10). LOG2() Returns the binary logarithm of the argument (with the base of 2). MAX() Returns the bigger of two arguments. MIN() Returns the smaller of two arguments. POW() Returns the first argument raised to the power of the second argument. SIN() Returns the sine of the argument. SQRT() Returns the square root of the argument. 5.5.3. Date and time functions ------------------------------ DAY() Returns the integer day of month (in 1..31 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. MONTH() Returns the integer month (in 1..12 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. NOW() Returns the current timestamp as an INTEGER. Introduced in version 0.9.9-rc1. YEAR() Returns the integer year (in 1969..2038 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. YEARMONTH() Returns the integer year and month code (in 196912..203801 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. YEARMONTHDAY() Returns the integer year, month, and date code (in 19691231..20380119 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. 5.5.4. Type conversion functions -------------------------------- BIGINT() Forcibly promotes the integer argument to 64-bit type, and does nothing on floating point argument. It's intended to help enforce evaluation of certain expressions (such as a*b) in 64-bit mode even though all the arguments are 32-bit. Introduced in version 0.9.9-rc1. SINT() Forcibly reinterprets its 32-bit unsigned integer argument as signed, and also expands it to 64-bit type (because 32-bit type is unsigned). It's easily illustrated by the following example: 1-2 normally evaluates to 4294967295, but SINT(1-2) evaluates to -1. Introduced in version 1.10-beta. 5.5.5. Comparison functions --------------------------- IF() IF() behavior is slightly different that that of its MySQL counterpart. It takes 3 arguments, check whether the 1st argument is equal to 0.0, returns the 2nd argument if it is not zero, or the 3rd one when it is. Note that unlike comparison operators, IF() does not use a threshold! Therefore, it's safe to use comparison results as its 1st argument, but arithmetic operators might produce unexpected results. For instance, the following two calls will produce different results even though they are logically equivalent: | IF ( sqrt(3)*sqrt(3)-3<>0, a, b ) | IF ( sqrt(3)*sqrt(3)-3, a, b ) In the first case, the comparison operator <> will return 0.0 (false) because of a threshold, and IF() will always return 'b' as a result. In the second one, the same sqrt(3)*sqrt(3)-3 expression will be compared with zero without threshold by the IF() function itself. But its value will be slightly different from zero because of limited floating point calculations precision. Because of that, the comparison with 0.0 done by IF() will not pass, and the second variant will return 'a' as a result. IN() IN(expr,val1,val2,...), introduced in version 0.9.9-rc1, takes 2 or more arguments, and returns 1 if 1st argument (expr) is equal to any of the other arguments (val1..valN), or 0 otherwise. Currently, all the checked values (but not the expression itself!) are required to be constant. (Its technically possible to implement arbitrary expressions too, and that might be implemented in the future.) Constants are pre-sorted and then binary search is used, so IN() even against a big arbitrary list of constants will be very quick. Starting with 0.9.9-rc2, first argument can also be a MVA attribute. In that case, IN() will return 1 if any of the MVA values is equal to any of the other arguments. Starting with 2.0.1-beta, IN() also supports IN(expr,@uservar) syntax to check whether the value belongs to the list in the given global user variable. INTERVAL() INTERVAL(expr,point1,point2,point3,...), introduced in version 0.9.9-rc1, takes 2 or more arguments, and returns the index of the argument that is less than the first argument: it returns 0 if exprSetSortMode ( SPH_SORT_EXPR, | "@weight + ( user_karma + ln(pageviews) )*0.1" ); The operators and functions supported in the expressions are discussed in a separate section, Section 5.5, <>. 5.7. Grouping (clustering) search results ========================================= Sometimes it could be useful to group (or in other terms, cluster) search results and/or count per-group match counts - for instance, to draw a nice graph of how much maching blog posts were there per each month; or to group Web search results by site; or to group matching forum posts by author; etc. In theory, this could be performed by doing only the full-text search in Sphinx and then using found IDs to group on SQL server side. However, in practice doing this with a big result set (10K-10M matches) would typically kill performance. To avoid that, Sphinx offers so-called grouping mode. It is enabled with SetGroupBy() API call. When grouping, all matches are assigned to different groups based on group-by value. This value is computed from specified attribute using one of the following built-in functions: * SPH_GROUPBY_DAY, extracts year, month and day in YYYYMMDD format from timestamp; * SPH_GROUPBY_WEEK, extracts year and first day of the week number (counting from year start) in YYYYNNN format from timestamp; * SPH_GROUPBY_MONTH, extracts month in YYYYMM format from timestamp; * SPH_GROUPBY_YEAR, extracts year in YYYY format from timestamp; * SPH_GROUPBY_ATTR, uses attribute value itself for grouping. The final search result set then contains one best match per group. Grouping function value and per-group match count are returned along as "virtual" attributes named @group and @count respectively. The result set is sorted by group-by sorting clause, with the syntax similar to SPH_SORT_EXTENDED sorting clause syntax. In addition to @id and @weight, group-by sorting clause may also include: * @group (groupby function value), * @count (amount of matches in group). The default mode is to sort by groupby value in descending order, ie. by "@group desc". On completion, total_found result parameter would contain total amount of matching groups over he whole index. WARNING: grouping is done in fixed memory and thus its results are only approximate; so there might be more groups reported in total_found than actually present. @count might also be underestimated. To reduce inaccuracy, one should raise max_matches. If max_matches allows to store all found groups, results will be 100% correct. For example, if sorting by relevance and grouping by "published" attribute with SPH_GROUPBY_DAY function, then the result set will contain * one most relevant match per each day when there were any matches published, * with day number and per-day match count attached, * sorted by day number in descending order (ie. recent days first). Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported through SetSelect() API call when using GROUP BY. 5.8. Distributed searching ========================== To scale well, Sphinx has distributed searching capabilities. Distributed searching is useful to improve query latency (ie. search time) and throughput (ie. max queries/sec) in multi-server, multi-CPU or multi-core environments. This is essential for applications which need to search through huge amounts data (ie. billions of records and terabytes of text). The key idea is to horizontally partition (HP) searched data accross search nodes and then process it in parallel. Partitioning is done manually. You should * setup several instances of Sphinx programs (indexer and searchd) on different servers; * make the instances index (and search) different parts of data; * configure a special distributed index on some of the searchd instances; * and query this index. This index only contains references to other local and remote indexes - so it could not be directly reindexed, and you should reindex those indexes which it references instead. When searchd receives a query against distributed index, it does the following: 1. connects to configured remote agents; 2. issues the query; 3. sequentially searches configured local indexes (while the remote agents are searching); 4. retrieves remote agents' search results; 5. merges all the results together, removing the duplicates; 6. sends the merged resuls to client. From the application's point of view, there are no differences between searching through a regular index, or a distributed index at all. That is, distributed indexes are fully transparent to the application, and actually there's no way to tell whether the index you queried was distributed or local. (Even though as of 0.9.9 Sphinx does not allow to combine searching through distributed indexes with anything else, this constraint will be lifted in the future.) Any searchd instance could serve both as a master (which aggregates the results) and a slave (which only does local searching) at the same time. This has a number of uses: 1. every machine in a cluster could serve as a master which searches the whole cluster, and search requests could be balanced between masters to achieve a kind of HA (high availability) in case any of the nodes fails; 2. if running within a single multi-CPU or multi-core machine, there would be only 1 searchd instance quering itself as an agent and thus utilizing all CPUs/core. It is scheduled to implement better HA support which would allow to specify which agents mirror each other, do health checks, keep track of alive agents, load-balance requests, etc. 5.9. searchd query log formats ============================== In version 2.0.1-beta and above two query log formats are supported. Previous versions only supported a custom plain text format. That format is still the default one. However, while it might be more convenient for manual monitoring and review, but hard to replay for benchmarks, it only logs search queries but not the other types of requests, does not always contain the complete search query data, etc. The default text format is also harder (and sometimes impossible) to replay for benchmarking purposes. The new sphinxql format alleviates that. It aims to be complete and automatable, even though at the cost of brevity and readability. 5.9.1. Plain log format ----------------------- By default, searchd logs all succesfully executed search queries into a query log file. Here's an example: | [Fri Jun 29 21:17:58 2007] 0.004 sec [all/0/rel 35254 (0,20)] [lj] test | [Fri Jun 29 21:20:34 2007] 0.024 sec [all/0/rel 19886 (0,20) @channel_id] [lj] test This log format is as follows: | [query-date] query-time [match-mode/filters-count/sort-mode | total-matches (offset,limit) @groupby-attr] [index-name] query Match mode can take one of the following values: * "all" for SPH_MATCH_ALL mode; * "any" for SPH_MATCH_ANY mode; * "phr" for SPH_MATCH_PHRASE mode; * "bool" for SPH_MATCH_BOOLEAN mode; * "ext" for SPH_MATCH_EXTENDED mode; * "ext2" for SPH_MATCH_EXTENDED2 mode; * "scan" if the full scan mode was used, either by being specified with SPH_MATCH_FULLSCAN, or if the query was empty (as documented under Matching Modes) Sort mode can take one of the following values: * "rel" for SPH_SORT_RELEVANCE mode; * "attr-" for SPH_SORT_ATTR_DESC mode; * "attr+" for SPH_SORT_ATTR_ASC mode; * "tsegs" for SPH_SORT_TIME_SEGMENTS mode; * "ext" for SPH_SORT_EXTENDED mode. Additionally, if searchd was started with --iostats, there will be a block of data after where the index(es) searched are listed. A query log entry might take the form of: | [Fri Jun 29 21:17:58 2007] 0.004 sec [all/0/rel 35254 (0,20)] [lj] | [ios=6 kb=111.1 ms=0.5] test This additional block is information regarding I/O operations in performing the search: the number of file I/O operations carried out, the amount of data in kilobytes read from the index files and time spent on I/O operations (although there is a background processing component, the bulk of this time is the I/O operation time). 5.9.2. SphinxQL log format -------------------------- This is a new log format introduced in 2.0.1-beta, with the goals begin logging everything and then some, and in a format easy to automate (for insance, automatically replay). New format can either be enabled via the query_log_format directive in the configuration file, or switched back and forth on the fly with the SET GLOBAL query_log_format=... statement via SphinxQL. In the new format, the example from the previous section would look as follows. (Wrapped below for readability, but with just one query per line in the actual log.) | /* Fri Jun 29 21:17:58.609 2007 2011 conn 2 wall 0.004 found 35254 */ | SELECT * FROM lj WHERE MATCH('test') OPTION ranker=proximity; | | /* Fri Jun 29 21:20:34 2007.555 conn 3 wall 0.024 found 19886 */ | SELECT * FROM lj WHERE MATCH('test') GROUP BY channel_id | OPTION ranker=proximity; Note that all requests would be logged in this format, including those sent via SphinxAPI and SphinxSE, not just those sent via SphinxQL. Also note, that this kind of logging works only with plain log files and will not work if you use 'syslog' for logging. The features of SphinxQL log format compared to the default text one are as follows. * All request types should be logged. (This is still work in progress.) * Full statement data will be logged where possible. * Errors and warnings are logged. * The log should be automatically replayable via SphinxQL. * Additional performance counters (currently, per-agent distributed query times) are logged. Every request (including both SphinxAPI and SphinxQL) request must result in exactly one log line. All request types, including INSERT, CALL SNIPPETS, etc will eventually get logged, though as of time of this writing, that is a work in progress). Every log line must be a valid SphinxQL statement that reconstructs the full request, except if the logged request is too big and needs shortening for performance reasons. Additional messages, counters, etc can be logged in the comments section after the request. 5.10. MySQL protocol support and SphinxQL ========================================= Starting with version 0.9.9-rc2, Sphinx searchd daemon supports MySQL binary network protocol and can be accessed with regular MySQL API. For instance, 'mysql' CLI client program works well. Here's an example of querying Sphinx using MySQL client: | $ mysql -P 9306 | Welcome to the MySQL monitor. Commands end with ; or \g. | Your MySQL connection id is 1 | Server version: 0.9.9-dev (r1734) | | Type 'help;' or '\h' for help. Type '\c' to clear the buffer. | | mysql> SELECT * FROM test1 WHERE MATCH('test') | -> ORDER BY group_id ASC OPTION ranker=bm25; | +------+--------+----------+------------+ | | id | weight | group_id | date_added | | +------+--------+----------+------------+ | | 4 | 1442 | 2 | 1231721236 | | | 2 | 2421 | 123 | 1231721236 | | | 1 | 2421 | 456 | 1231721236 | | +------+--------+----------+------------+ | 3 rows in set (0.00 sec) Note that mysqld was not even running on the test machine. Everything was handled by searchd itself. The new access method is supported in addition to native APIs which all still work perfectly well. In fact, both access methods can be used at the same time. Also, native API is still the default access method. MySQL protocol support needs to be additionally configured. This is a matter of 1-line config change, adding a new listener with mysql41 specified as a protocol: | listen = localhost:9306:mysql41 Just supporting the protocol and not the SQL syntax would be useless so Sphinx now also supports a subset of SQL that we dubbed SphinxQL. It supports the standard querying all the index types with SELECT, modifying RT indexes with INSERT, REPLACE, and DELETE, and much more. Full SphinxQL reference is available in Chapter 7, SphinxQL reference. 5.11. Multi-queries =================== Multi-queries, or query batches, let you send multiple queries to Sphinx in one go (more formally, one network request). Two API methods that implement multi-query mechanism are AddQuery() and RunQueries(). You can also run multiple queries with SphinxQL, see Section 7.18, <>. (In fact, regular Query() call is internally implemented as a single AddQuery() call immediately followed by RunQueries() call.) AddQuery() captures the current state of all the query settings set by previous API calls, and memorizes the query. RunQueries() actually sends all the memorized queries, and returns multiple result sets. There are no restrictions on the queries at all, except just a sanity check on a number of queries in a single batch (see Section 11.4.25, <>). Why use multi-queries? Generally, it all boils down to performance. First, by sending requests to searchd in a batch instead of one by one, you always save a bit by doing less network roundtrips. Second, and somewhat more important, sending queries in a batch enables searchd to perform certain internal optimizations. As new types of optimizations are being added over time, it generally makes sense to pack all the queries into batches where possible, so that simply upgrading Sphinx to a new version would automatically enable new optimizations. In the case when there aren't any possible batch optimizations to apply, queries will be processed one by one internally. Why (or rather when) not use multi-queries? Multi-queries requires all the queries in a batch to be independent, and sometimes they aren't. That is, sometimes query B is based on query A results, and so can only be set up after executing query A. For instance, you might want to display results from a secondary index if and only if there were no results found in a primary index. Or maybe just specify offset into 2nd result set based on the amount of matches in the 1st result set. In that case, you will have to use separate queries (or separate batches). As of 0.9.10, there are two major optimizations to be aware of: common query optimization (available since 0.9.8); and common subtree optimization (available since 0.9.10). Common query optimization means that searchd will identify all those queries in a batch where only the sorting and group-by settings differ, and only perform searching once. For instance, if a batch consists of 3 queries, all of them are for "ipod nano", but 1st query requests top-10 results sorted by price, 2nd query groups by vendor ID and requests top-5 vendors sorted by rating, and 3rd query requests max price, full-text search for "ipod nano" will only be performed once, and its results will be reused to build 3 different result sets. So-called faceted searching is a particularly important case that benefits from this optimization. Indeed, faceted searching can be implemented by running a number of queries, one to retrieve search results themselves, and a few other ones with same full-text query but different group-by settings to retrieve all the required groups of results (top-3 authors, top-5 vendors, etc). And as long as full-text query and filtering settings stay the same, common query optimization will trigger, and greatly improve performance. Common subtree optimization is even more interesting. It lets searchd exploit similarities between batched full-text queries. It identifies common full-text query parts (subtress) in all queries, and caches them between queries. For instance, look at the following query batch: | barack obama president | barack obama john mccain | barack obama speech There's a common two-word part ("barack obama") that can be computed only once, then cached and shared across the queries. And common subtree optimization does just that. Per-query cache size is strictly controlled by subtree_docs_cache and subtree_hits_cache directives (so that caching all sxiteen gazillions of documents that match "i am" does not exhaust the RAM and instantly kill your server). Here's a code sample (in PHP) that fire the same query in 3 different sorting modes: | require ( "sphinxapi.php" ); | $cl = new SphinxClient (); | $cl->SetMatchMode ( SPH_MATCH_EXTENDED2 ); | | $cl->SetSortMode ( SPH_SORT_RELEVANCE ); | $cl->AddQuery ( "the", "lj" ); | $cl->SetSortMode ( SPH_SORT_EXTENDED, "published desc" ); | $cl->AddQuery ( "the", "lj" ); | $cl->SetSortMode ( SPH_SORT_EXTENDED, "published asc" ); | $cl->AddQuery ( "the", "lj" ); | $res = $cl->RunQueries(); How to tell whether the queries in the batch were actually optimized? If they were, respective query log will have a "multiplier" field that specifies how many queries were processed together: | [Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext2/0/rel 747541 (0,20)] [lj] the | [Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext2/0/ext 747541 (0,20)] [lj] the | [Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext2/0/ext 747541 (0,20)] [lj] the Note the "x3" field. It means that this query was optimized and processed in a sub-batch of 3 queries. For reference, this is how the regular log would look like if the queries were not batched: | [Sun Jul 12 15:18:17.062 2009] 0.059 sec [ext2/0/rel 747541 (0,20)] [lj] the | [Sun Jul 12 15:18:17.156 2009] 0.091 sec [ext2/0/ext 747541 (0,20)] [lj] the | [Sun Jul 12 15:18:17.250 2009] 0.092 sec [ext2/0/ext 747541 (0,20)] [lj] the Note how per-query time in multi-query case was improved by a factor of 1.5x to 2.3x, depending on a particular sorting mode. In fact, for both common query and common subtree optimizations, there were reports of 3x and even more improvements, and that's from production instances, not just synthetic tests. 5.12. Collations ================ Introduced to Sphinx in version 2.0.1-beta to supplement string sorting, collations essentially affect the string attribute comparisons. They specify both the character set encoding and the strategy that Sphinx uses to compare strings when doing ORDER BY or GROUP BY with a string attribute involved. String attributes are stored as is when indexing, and no character set or language information is attached to them. That's okay as long as Sphinx only needs to store and return the strings to the calling application verbatim. But when you ask Sphinx to sort by a string value, that request immediately becomes quite ambiguous. First, single-byte (ASCII, or ISO-8859-1, or Windows-1251) strings need to be processed differently that the UTF-8 ones that may encode every character with a variable number of bytes. So we need to know what is the character set type to interepret the raw bytes as meaningful characters properly. Second, we additionally need to know the language-specific string sorting rules. For instance, when sorting according to US rules in en_US locale, the accented character '' (small letter i with diaeresis) should be placed somewhere after 'z'. However, when sorting with French rules and fr_FR locale in mind, it should be placed between 'i' and 'j'. And some other set of rules might choose to ignore accents at all, allowing '' and 'i' to be mixed arbitrarily. Third, but not least, we might need case-sensitive sorting in some scenarios and case-insensitive sorting in some others. Collations combine all of the above: the character set, the lanugage rules, and the case sensitivity. Sphinx currently provides the following four collations. 1. libc_ci 2. libc_cs 3. utf8_general_ci 4. binary The first two collations rely on several standard C library (libc) calls and can thus support any locale that is installed on your system. They provide case-insensitive (_ci) and case-sensitive (_cs) comparisons respectively. By default they will use C locale, effectively resorting to bytewise comparisons. To change that, you need to specify a different available locale using collation_libc_locale directive. The list of locales available on your system can usually be obtained with the locale command: | $ locale -a | C | en_AG | en_AU.utf8 | en_BW.utf8 | en_CA.utf8 | en_DK.utf8 | en_GB.utf8 | en_HK.utf8 | en_IE.utf8 | en_IN | en_NG | en_NZ.utf8 | en_PH.utf8 | en_SG.utf8 | en_US.utf8 | en_ZA.utf8 | en_ZW.utf8 | es_ES | fr_FR | POSIX | ru_RU.utf8 | ru_UA.utf8 The specific list of the system locales may vary. Consult your OS documentation to install additional needed locales. utf8_general_ci and binary locales are built-in into Sphinx. The first one is a generic collation for UTF-8 data (without any so-called language tailoring); it should behave similar to utf8_general_ci collation in MySQL. The second one is a simple bytewise comparison. Collation can be overriden via SphinxQL on a per-session basis using SET collation_connection statement. All subsequent SphinxQL queries will use this collation. SphinxAPI and SphinxSE queries will use the server default collation, as specified in collation_server configuration directive. Sphinx currently defaults to libc_ci collation. Collations should affect all string attribute comparisons, including those within ORDER BY and GROUP BY, so differently ordered or grouped results can be returned depending on the collation chosen. 5.13. User-defined functions (UDF) ================================== Starting with 2.0.1-beta, Sphinx supports User-Defined Functions, or UDF for short. They can be loaded and unloaded dynamically into searchd without having to restart the daemon, and used in expressions when searching. UDF features at a glance are as follows. * Functions can take integer (both 32-bit and 64-bit), float, string, or MVA arguments. * Functions can return integer or float values. * Functions can check the argument number, types, and names and raise errors. * Only simple functions (that is, non-aggregate ones) are currently supported. User-defined functions need your OS to support dynamically loadable libraries (aka shared objects). Most of the modern OSes are eligible, including Linux, Windows, MacOS, Solaris, BSD and others. (The internal testing has been done on Linux and Windows.) The UDF libraries must reside in a directory specified by plugin_dir directive, and the server must be configured to use workers = threads mode. Relative paths to the library files are not allowed. Once the library is succesfully built and copied to the trusted location, you can then dynamically install and deinstall the functions using CREATE FUNCTION and DROP FUNCTION statements respectively. A single library can contain multiple functions. A library gets loaded when you first install a function from it, and unloaded when you deinstall all the functions from that library. The library functions that will implement a UDF visible to SQL statements need to follow C calling convention, and a simple naming convention. Sphinx source distribution provides a sample file, src/udfexample.c, that defines a few simple functions showing how to work with integer, string, and MVA arguments; you can use that one as a foundation for your new functions. It includes the UDF interface header file, src/sphinxudf.h, that defines the required types and structures. sphinxudf.h header is standalone, that is, does not require any other parts of Sphinx source to compile. Every function that you intend to use in your SELECT statements requires at least two corresponding C/C++ functions: the initialization call, and the function call itself. You can also optionally define the deinitialization call if your function requires any post-query cleanup. (For instance, if you were allocating any memory in either the initialization call or the function calls.) Function names in SQL are case insensitive, C function names are not. They need to be all lower-case. Mistakes in function name prevent UDFs from loading. You also have to pay special attention to the calling convention used when compiling, the list and the types of arguments, and the return type of the main function call. Mistakes in either are likely to crash the server, or result in unexpected results in the best case. Last but not least, all functions need to be thread-safe. Let's assume for the sake of example that your UDF name in SphinxQL will be MYFUNC. The initialization, main, and deinitialization functions would then need to be named as follows and take the following arguments: | /// initialization function | /// called once during query initialization | /// returns 0 on success | /// returns non-zero and fills error_message buffer on failure | int myfunc_init ( SPH_UDF_INIT * init, SPH_UDF_ARGS * args, | char * error_message ); | | /// main call function | /// returns the computed value | /// writes non-zero value into error_flag to indicate errors | RETURN_TYPE myfunc ( SPH_UDF_INIT * init, SPH_UDF_ARGS * args, | char * error_flag ); | | /// optional deinitialization function | /// called once to cleanup once query processing is done | void myfunc_deinit ( SPH_UDF_INIT * init ); The two mentioned structures, SPH_UDF_INIT and SPH_UDF_ARGS, are defined in the src/sphinxudf.h interface header and documented there. RETURN_TYPE of the main function must be one of the following: * int for the functions that return INT. * sphinx_int64_t for the functions that return BIGINT. * float for the functions that return FLOAT. The calling sequence is as follows. myfunc_init() is called once when initializing the query. It can return a non-zero code to indicate a failure; in that case query is not executed, and the error message from the error_message buffer is returned. Otherwise, myfunc() is be called for every row, and a myfunc_deinit() is then called when the query ends. myfunc() can indicate an error by writing a non-zero byte value to error_flag, in that case, it will no more be called for subsequent rows, and a default value of 0 will be substituted. Sphinx might or might not choose to terminate such queries early, neither behavior is currently guaranteed. Chapter 6. Command line tools reference ======================================= Table of Contents 6.1. indexer command reference 6.2. searchd command reference 6.3. search command reference 6.4. spelldump command reference 6.5. indextool command reference As mentioned elsewhere, Sphinx is not a single program called 'sphinx', but a collection of 4 separate programs which collectively form Sphinx. This section covers these tools and how to use them. 6.1. indexer command reference ============================== indexer is the first of the two principle tools as part of Sphinx. Invoked from either the command line directly, or as part of a larger script, indexer is solely responsible for gathering the data that will be searchable. The calling syntax for indexer is as follows: | indexer [OPTIONS] [indexname1 [indexname2 [...]]] Essentially you would list the different possible indexes (that you would later make available to search) in sphinx.conf, so when calling indexer, as a minimum you need to be telling it what index (or indexes) you want to index. If sphinx.conf contained details on 2 indexes, mybigindex and mysmallindex, you could do the following: | $ indexer mybigindex | $ indexer mysmallindex mybigindex As part of the configuration file, sphinx.conf, you specify one or more indexes for your data. You might call indexer to reindex one of them, ad-hoc, or you can tell it to process all indexes - you are not limited to calling just one, or all at once, you can always pick some combination of the available indexes. The majority of the options for indexer are given in the configuration file, however there are some options you might need to specify on the command line as well, as they can affect how the indexing operation is performed. These options are: * --config (-c for short) tells indexer to use the given file as its configuration. Normally, it will look for sphinx.conf in the installation directory (e.g. /usr/local/sphinx/etc/sphinx.conf if installed into /usr/local/sphinx), followed by the current directory you are in when calling indexer from the shell. This is most of use in shared environments where the binary files are installed somewhere like /usr/local/sphinx/ but you want to provide users with the ability to make their own custom Sphinx set-ups, or if you want to run multiple instances on a single server. In cases like those you could allow them to create their own sphinx.conf files and pass them to indexer with this option. For example: | $ indexer --config /home/myuser/sphinx.conf myindex * --all tells indexer to update every index listed in sphinx.conf, instead of listing individual indexes. This would be useful in small configurations, or cron-type or maintenance jobs where the entire index set will get rebuilt each day, or week, or whatever period is best. Example usage: | $ indexer --config /home/myuser/sphinx.conf --all * --rotate is used for rotating indexes. Unless you have the situation where you can take the search function offline without troubling users, you will almost certainly need to keep search running whilst indexing new documents. --rotate creates a second index, parallel to the first (in the same place, simply including .new in the filenames). Once complete, indexer notifies searchd via sending the SIGHUP signal, and searchd will attempt to rename the indexes (renaming the existing ones to include .old and renaming the .new to replace them), and then start serving from the newer files. Depending on the setting of seamless_rotate, there may be a slight delay in being able to search the newer indexes. Example usage: | $ indexer --rotate --all * --quiet tells indexer not to output anything, unless there is an error. Again, most used for cron-type, or other script jobs where the output is irrelevant or unnecessary, except in the event of some kind of error. Example usage: | $ indexer --rotate --all --quiet * --noprogress does not display progress details as they occur; instead, the final status details (such as documents indexed, speed of indexing and so on are only reported at completion of indexing. In instances where the script is not being run on a console (or 'tty'), this will be on by default. Example usage: | $ indexer --rotate --all --noprogress * --buildstops reviews the index source, as if it were indexing the data, and produces a list of the terms that are being indexed. In other words, it produces a list of all the searchable terms that are becoming part of the index. Note; it does not update the index in question, it simply processes the data 'as if' it were indexing, including running queries defined with sql_query_pre or sql_query_post. outputfile.txt will contain the list of words, one per line, sorted by frequency with most frequent first, and N specifies the maximum number of words that will be listed; if sufficiently large to encompass every word in the index, only that many words will be returned. Such a dictionary list could be used for client application features around "Did you mean..." functionality, usually in conjunction with --buildfreqs, below. Example: | $ indexer myindex --buildstops word_freq.txt 1000 This would produce a document in the current directory, word_freq.txt with the 1,000 most common words in 'myindex', ordered by most common first. Note that the file will pertain to the last index indexed when specified with multiple indexes or --all (i.e. the last one listed in the configuration file) * --buildfreqs works with --buildstops (and is ignored if --buildstops is not specified). As --buildstops provides the list of words used within the index, --buildfreqs adds the quantity present in the index, which would be useful in establishing whether certain words should be considered stopwords if they are too prevalent. It will also help with developing "Did you mean..." features where you can how much more common a given word compared to another, similar one. Example: | $ indexer myindex --buildstops word_freq.txt 1000 --buildfreqs This would produce the word_freq.txt as above, however after each word would be the number of times it occurred in the index in question. * --merge is used for physically merging indexes together, for example if you have a main+delta scheme, where the main index rarely changes, but the delta index is rebuilt frequently, and --merge would be used to combine the two. The operation moves from right to left - the contents of src-index get examined and physically combined with the contents of dst-index and the result is left in dst-index. In pseudo-code, it might be expressed as: dst-index += src-index An example: | $ indexer --merge main delta --rotate In the above example, where the main is the master, rarely modified index, and delta is the less frequently modified one, you might use the above to call indexer to combine the contents of the delta into the main index and rotate the indexes. * --merge-dst-range runs the filter range given upon merging. Specifically, as the merge is applied to the destination index (as part of --merge, and is ignored if --merge is not specified), indexer will also filter the documents ending up in the destination index, and only documents will pass through the filter given will end up in the final index. This could be used for example, in an index where there is a 'deleted' attribute, where 0 means 'not deleted'. Such an index could be merged with: | $ indexer --merge main delta --merge-dst-range deleted 0 0 Any documents marked as deleted (value 1) would be removed from the newly-merged destination index. It can be added several times to the command line, to add successive filters to the merge, all of which must be met in order for a document to become part of the final index. * --dump-rows dumps rows fetched by SQL source(s) into the specified file, in a MySQL compatible syntax. Resulting dumps are the exact representation of data as received by indexer and help to repeat indexing-time issues. * --verbose guarantees that every row that caused problems indexing (duplicate, zero, or missing document ID; or file field IO issues; etc) will be reported. By default, this option is off, and problem summaries may be reported instead. * --sighup-each is useful when you are rebuilding many big indexes, and want each one rotated into searchd as soon as possible. With --sighup-each, indexer will send a SIGHUP signal to searchd after succesfully completing the work on each index. (The default behavior is to send a single SIGHUP after all the indexes were built.) * --print-queries prints out SQL queries that indexer sends to the database, along with SQL connection and disconnection events. That is useful to diagnose and fix problems with SQL sources. 6.2. searchd command reference ============================== searchd is the second of the two principle tools as part of Sphinx. searchd is the part of the system which actually handles searches; it functions as a server and is responsible for receiving queries, processing them and returning a dataset back to the different APIs for client applications. Unlike indexer, searchd is not designed to be run either from a regular script or command-line calling, but instead either as a daemon to be called from init.d (on Unix/Linux type systems) or to be called as a service (on Windows-type systems), so not all of the command line options will always apply, and so will be build-dependent. Calling searchd is simply a case of: | $ searchd [OPTIONS] The options available to searchd on all builds are: * --help (-h for short) lists all of the parameters that can be called in your particular build of searchd. * --config (-c for short) tells searchd to use the given file as its configuration, just as with indexer above. * --stop is used to asynchronously stop searchd, using the details of the PID file as specified in the sphinx.conf file, so you may also need to confirm to searchd which configuration file to use with the --config option. NB, calling --stop will also make sure any changes applied to the indexes with UpdateAttributes() will be applied to the index files themselves. Example: | $ searchd --config /home/myuser/sphinx.conf --stop * --stopwait is used to synchronously stop searchd. --stop essentially tells the running instance to exit (by sending it a SIGTERM) and then immediately returns. --stopwait will also attempt to wait until the running searchd instance actually finishes the shutdown (eg. saves all the pending attribute changes) and exits. Example: | $ searchd --config /home/myuser/sphinx.conf --stopwait Possible exit codes are as follows: * 0 on success; * 1 if connection to running searchd daemon failed; * 2 if daemon reported an error during shutdown; * 3 if daemon crashed during shutdown. * --status command is used to query running searchd instance status, using the connection details from the (optionally) provided configuration file. It will try to connect to the running instance using the first configured UNIX socket or TCP port. On success, it will query for a number of status and performance counter values and print them. You can use Status() API call to access the very same counters from your application. Examples: | $ searchd --status | $ searchd --config /home/myuser/sphinx.conf --status * --pidfile is used to explicitly state a PID file, where the process information is stored regarding searchd, used for inter-process communications (for example, indexer will need to know the PID to contact searchd for rotating indexes). Normally, searchd would use a PID if running in regular mode (i.e. not with --console), but it is possible that you will be running it in console mode whilst the index is being updated and rotated, for which a PID file will be needed. | $ searchd --config /home/myuser/sphinx.conf --pidfile /home/myuser/sphinx.pid * --console is used to force searchd into console mode; typically it will be running as a conventional server application, and will aim to dump information into the log files (as specified in sphinx.conf). Sometimes though, when debugging issues in the configuration or the daemon itself, or trying to diagnose hard-to-track-down problems, it may be easier to force it to dump information directly to the console/command line from which it is being called. Running in console mode also means that the process will not be forked (so searches are done in sequence) and logs will not be written to. (It should be noted that console mode is not the intended method for running searchd.) You can invoke it as such: | $ searchd --config /home/myuser/sphinx.conf --console * --logdebug enables additional debug output in the daemon log. Should only be needed rarely, to assist with debugging issues that could not be easily reproduced on request. * --iostats is used in conjuction with the logging options (the query_log will need to have been activated in sphinx.conf) to provide more detailed information on a per-query basis as to the input/output operations carried out in the course of that query, with a slight performance hit and of course bigger logs. Further details are available under the query log format section. You might start searchd thus: | $ searchd --config /home/myuser/sphinx.conf --iostats * --cpustats is used to provide actual CPU time report (in addition to wall time) in both query log file (for every given query) and status report (aggregated). It depends on clock_gettime() system call and might therefore be unavailable on certain systems. You might start searchd thus: | $ searchd --config /home/myuser/sphinx.conf --cpustats * --port portnumber (-p for short) is used to specify the port that searchd should listen on, usually for debugging purposes. This will usually default to 9312, but sometimes you need to run it on a different port. Specifying it on the command line will override anything specified in the configuration file. The valid range is 0 to 65535, but ports numbered 1024 and below usually require a privileged account in order to run. An example of usage: | $ searchd --port 9313 * --listen ( address ":" port | port | path ) [ ":" protocol ] (or -l for short) Works as --port, but allow you to specify not only the port, but full path, as IP address and port, or Unix-domain socket path, that searchd will listen on. Otherwords, you can specify either an IP address (or hostname) and port number, or just a port number, or Unix socket path. If you specify port number but not the address, searchd will listen on all network interfaces. Unix path is identified by a leading slash. As the last param you can also specify a protocol handler (listener) to be used for connections on this socket. Supported protocol values are 'sphinx' (Sphinx 0.9.x API protocol) and 'mysql41' (MySQL protocol used since 4.1 upto at least 5.1). * --index (or -i for short) forces this instance of searchd only to serve the specified index. Like --port, above, this is usually for debugging purposes; more long-term changes would generally be applied to the configuration file itself. Example usage: | $ searchd --index myindex * --strip-path strips the path names from all the file names referenced from the index (stopwords, wordforms, exceptions, etc). This is useful for picking up indexes built on another machine with possibly different path layouts. There are some options for searchd that are specific to Windows platforms, concerning handling as a service, are only be available on Windows binaries. Note that on Windows searchd will default to --console mode, unless you install it as a service. * --install installs searchd as a service into the Microsoft Management Console (Control Panel / Administrative Tools / Services). Any other parameters specified on the command line, where --install is specified will also become part of the command line on future starts of the service. For example, as part of calling searchd, you will likely also need to specify the configuration file with --config, and you would do that as well as specifying --install. Once called, the usual start/stop facilities will become available via the management console, so any methods you could use for starting, stopping and restarting services would also apply to searchd. Example: | C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install | --config C:\Sphinx\sphinx.conf If you wanted to have the I/O stats every time you started searchd, you would specify its option on the same line as the --install command thus: | C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install | --config C:\Sphinx\sphinx.conf --iostats * --delete removes the service from the Microsoft Management Console and other places where services are registered, after previously installed with --install. Note, this does not uninstall the software or delete the indexes. It means the service will not be called from the services systems, and will not be started on the machine's next start. If currently running as a service, the current instance will not be terminated (until the next reboot, or searchd is called with --stop). If the service was installed with a custom name (with --servicename), the same name will need to be specified with --servicename when calling to uninstall. Example: | C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --delete * --servicename applies the given name to searchd when installing or deleting the service, as would appear in the Management Console; this will default to searchd, but if being deployed on servers where multiple administrators may log into the system, or a system with multiple searchd instances, a more descriptive name may be applicable. Note that unless combined with --install or --delete, this option does not do anything. Example: | C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install | --config C:\Sphinx\sphinx.conf --servicename SphinxSearch * --ntservice is the option that is passed by the Management Console to searchd to invoke it as a service on Windows platforms. It would not normally be necessary to call this directly; this would normally be called by Windows when the service would be started, although if you wanted to call this as a regular service from the command-line (as the complement to --console) you could do so in theory. Last but not least, as every other daemon, searchd supports a number of signals. SIGTERM Initiates a clean shutdown. New queries will not be handled; but queries that are already started will not be forcibly interrupted. SIGHUP Initiates index rotation. Depending on the value of seamless_rotate setting, new queries might be shortly stalled; clients will receive temporary errors. SIGUSR1 Forces reopen of searchd log and query log files, letting you implement log file rotation. 6.3. search command reference ============================= search is one of the helper tools within the Sphinx package. Whereas searchd is responsible for searches in a server-type environment, search is aimed at testing the index from the command line, and testing the index quickly without building a framework to make the connection to the server and process its response. Note: search is not intended to be deployed as part of a client application; it is strongly recommended you do not write an interface to search instead of searchd, and none of the bundled client APIs support this method. (In any event, search will reload files each time, whereas searchd will cache them in memory for performance.) That said, many types of query that you could build in the APIs could also be made with search, however for very complex searches it may be easier to construct them using a small script and the corresponding API. Additionally, some newer features may be available in the searchd system that have not yet been brought into search. The calling syntax for search is as follows: | search [OPTIONS] word1 [word2 [word3 [...]]] When calling search, it is not necessary to have searchd running; simply make sure that the account running the search program has read access to the configuration file and the index files. The default behaviour is to apply a search for word1 (AND word2 AND word3... as specified) to all fields in all indexes as given in the configuration file. If constructing the equivalent in the API, this would be the equivalent to passing SPH_MATCH_ALL to SetMatchMode, and specifying * as the indexes to query as part of Query. There are many options available to search. Firstly, the general options: * --config (-c for short) tells search to use the given file as its configuration, just as with indexer above. * --index (-i for short) tells search to limit searching to the specified index only; normally it would attempt to search all of the physical indexes listed in sphinx.conf, not any distributed ones. * --stdin tells search to accept the query from the standard input, rather than the command line. This can be useful for testing purposes whereby you could feed input via pipes and from scripts. Options for setting matches: * --any (-a for short) changes the matching mode to match any of the words as part of the query (word1 OR word2 OR word3). In the API this would be equivalent to passing SPH_MATCH_ANY to SetMatchMode. * --phrase (-p for short) changes the matching mode to match all of the words as part of the query, and do so in the phrase given (not including punctuation). In the API this would be equivalent to passing SPH_MATCH_PHRASE to SetMatchMode. * --boolean (-b for short) changes the matching mode to Boolean matching. Note if using Boolean syntax matching on the command line, you may need to escape the symbols (with a backslash) to avoid the shell/command line processor applying them, such as ampersands being escaped on a Unix/Linux system to avoid it forking to the search process, although this can be resolved by using --stdin, as below. In the API this would be equivalent to passing SPH_MATCH_BOOLEAN to SetMatchMode. * --ext (-e for short) changes the matching mode to Extended matching. In the API this would be equivalent to passing SPH_MATCH_EXTENDED to SetMatchMode, and it should be noted that use of this mode is being discouraged in favour of Extended2, below. * --ext2 (-e2 for short) changes the matching mode to Extended matching, version 2. In the API this would be equivalent to passing SPH_MATCH_EXTENDED2 to SetMatchMode, and it should be noted that use of this mode is being recommended in favour of Extended, due to being more efficient and providing other features. * --filter (-f for short) filters the results such that only documents where the attribute given (attr) matches the value given (v). For example, --filter deleted 0 only matches documents with an attribute called 'deleted' where its value is 0. You can also add multiple filters on the command line, by specifying multiple --filter multiple times, however if you apply a second filter to an attribute it will override the first defined filter. Options for handling the results: * --limit (-l count for short) limits the total number of matches back to the number given. If a 'group' is specified, this will be the number of grouped results. This defaults to 20 results if not specified (as do the APIs) * --offset (-o for short) offsets the result list by the number of places set by the count; this would be used for pagination through results, where if you have 20 results per 'page', the second page would begin at offset 20, the third page at offset 40, etc. * --group (-g for short) specifies that results should be grouped together based on the attribute specified. Like the GROUP BY clause in SQL, it will combine all results where the attribute given matches, and returns a set of results where each returned result is the best from each group. Unless otherwise specified, this will be the best match on relevance. * --groupsort (-gs for short) instructs that when results are grouped with --group, the expression given in shall determine the order of the groups. Note, this does not specify which is the best item within the group, only the order in which the groups themselves shall be returned. * --sortby (-s for short) specifies that results should be sorted in the order listed in . This allows you to specify the order you wish results to be presented in, ordering by different columns. For example, you could say --sortby "@weight DESC entrytime DESC" to sort entries first by weight (or relevance) and where two or more entries have the same weight, to then sort by the time with the highest time (newest) first. You will usually need to put the items in quotes (--sortby "@weight DESC") or use commas (--sortby @weight,DESC) to avoid the items being treated separately. Additionally, like the regular sorting modes, if --group (grouping) is being used, this will state how to establish the best match within each group. * --sortexpr expr (-S expr for short) specifies that the search results should be presented in an order determined by an arithmetic expression, stated in expr. For example: --sortexpr "@weight + ( user_karma + ln(pageviews) )*0.1" (again noting that this will have to be quoted to avoid the shell dealing with the asterisk). Extended sort mode is discussed in more detail under the SPH_SORT_EXTENDED entry under the Sorting modes section of the manual. * --sort=date specifies that the results should be sorted by descending (i.e. most recent first) date. This requires that there is an attribute in the index that is set as a timestamp. * --rsort=date specifies that the results should be sorted by ascending (i.e. oldest first) date. This requires that there is an attribute in the index that is set as a timestamp. * --sort=ts specifies that the results should be sorted by timestamp in groups; it will return all of the documents whose timestamp is within the last hour, then sorted within that bracket for relevance. After, it would return the documents from the last day, sorted by relevance, then the last week and then the last month. It is discussed in more detail under the SPH_SORT_TIME_SEGMENTS entry under the Sorting modes section of the manual. Other options: * --noinfo (-q for short) instructs search not to look-up data in your SQL database. Specifically, for debugging with MySQL and search, you can provide it with a query to look up the full article based on the returned document ID. It is explained in more detail under the sql_query_info directive. 6.4. spelldump command reference ================================ spelldump is one of the helper tools within the Sphinx package. It is used to extract the contents of a dictionary file that uses ispell or MySpell format, which can help build word lists for wordforms - all of the possible forms are pre-built for you. Its general usage is: | spelldump [options] [result] [locale-name] The two main parameters are the dictionary's main file and its affix file; usually these are named as [language-prefix].dict and [language-prefix].aff and will be available with most common Linux distributions, as well as various places online. [result] specifies where the dictionary data should be output to, and [locale-name] additionally specifies the locale details you wish to use. There is an additional option, -c [file], which specifies a file for case conversion details. Examples of its usage are: | spelldump en.dict en.aff | spelldump ru.dict ru.aff ru.txt ru_RU.CP1251 | spelldump ru.dict ru.aff ru.txt .1251 The results file will contain a list of all the words in the dictionary in alphabetical order, output in the format of a wordforms file, which you can use to customise for your specific circumstances. An example of the result file: | zone > zone | zoned > zoned | zoning > zoning 6.5. indextool command reference ================================ indextool is one of the helper tools within the Sphinx package, introduced in version 0.9.9-rc2. It is used to dump miscellaneous debug information about the physical index. (Additional functionality such as index verification is planned in the future, hence the indextool name rather than just indexdump.) Its general usage is: | indextool [options] The only currently available option applies to all commands and lets you specify the configuration file: * --config (-c for short) overrides the built-in config file names. The commands are as follows: * --dumpheader FILENAME.sph quickly dumps the provided index header file without touching any other index files or even the configuration file. The report provides a breakdown of all the index settings, in particular the entire attribute and field list. Prior to 0.9.9-rc2, this command was present in CLI search utility. * --dumpconfig FILENAME.sph dumps the index definition from the given index header file in (almost) compliant sphinx.conf file format. Added in version 2.0.1-beta. * --dumpheader INDEXNAME dumps index header by index name with looking up the header path in the configuration file. * --dumpdocids INDEXNAME dumps document IDs by index name. It takes the data from attribute (.spa) file and therefore requires docinfo=extern to work. * --dumphitlist INDEXNAME KEYWORD dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as text. * --dumphitlist INDEXNAME --wordid ID dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as internal numeric ID. * --htmlstrip INDEXNAME filters stdin using HTML stripper settings for a given index, and prints the filtering results to stdout. Note that the settings will be taken from sphinx.conf, and not the index header. * --check INDEXNAME checks the index data files for consistency errors that might be introduced either by bugs in indexer and/or hardware faults. * --strip-path strips the path names from all the file names referenced from the index (stopwords, wordforms, exceptions, etc). This is useful for checking indexes built on another machine with possibly different path layouts. Chapter 7. SphinxQL reference ============================= Table of Contents 7.1. SELECT syntax 7.2. SHOW META syntax 7.3. SHOW WARNINGS syntax 7.4. SHOW STATUS syntax 7.5. INSERT and REPLACE syntax 7.6. DELETE syntax 7.7. SET syntax 7.8. BEGIN, COMMIT, and ROLLBACK syntax 7.9. CALL SNIPPETS syntax 7.10. CALL KEYWORDS syntax 7.11. SHOW TABLES syntax 7.12. DESCRIBE syntax 7.13. CREATE FUNCTION syntax 7.14. DROP FUNCTION syntax 7.15. SHOW VARIABLES syntax 7.16. SHOW COLLATION syntax 7.17. UPDATE syntax 7.18. Multi-statement queries 7.19. Comment syntax 7.20. List of SphinxQL reserved keywords 7.21. SphinxQL upgrade notes, version 2.0.1-beta SphinxQL is our SQL dialect that exposes all of the search daemon functionality using a standard SQL syntax with a few Sphinx-specific extensions. Everything available via the SphinxAPI is also available SphinxQL but not vice versa; for instance, writes into RT indexes are only available via SphinxQL. This chapter documents supported SphinxQL statements syntax. 7.1. SELECT syntax ================== | SELECT | select_expr [, select_expr ...] | FROM index [, index2 ...] | [WHERE where_condition] | [GROUP BY {col_name | expr_alias}] | [ORDER BY {col_name | expr_alias} {ASC | DESC} [, ...]] | [WITHIN GROUP ORDER BY {col_name | expr_alias} {ASC | DESC}] | [LIMIT offset, row_count] | [OPTION opt_name = opt_value [, ...]] SELECT statement was introduced in version 0.9.9-rc2. It's syntax is based upon regular SQL but adds several Sphinx-specific extensions and has a few omissions (such as (currently) missing support for JOINs). Specifically, * Column list clause. Column names, arbitrary expressions, and star ('*') are all allowed (ie. SELECT @id, group_id*123+456 AS expr1 FROM test1 will work). Unlike in regular SQL, all computed expressions must be aliased with a valid identifier. Starting with version 2.0.1-beta, AS is optional. Special names such as @id and @weight should currently be used with leading at-sign. This at-sign requirement will be lifted in the future. * FROM clause. FROM clause should contain the list of indexes to search through. Unlike in regular SQL, comma means enumeration of full-text indexes as in Query() API call rather than JOIN. * WHERE clause. This clause will map both to fulltext query and filters. Comparison operators (=, !=, <, >, <=, >=), IN, AND, NOT, and BETWEEN are all supported and map directly to filters. OR is not supported yet but will be in the future. MATCH('query') is supported and maps to fulltext query. Query will be interpreted according to full-text query language rules. There must be at most one MATCH() in the clause. Starting with version 2.0.1-beta, {col_name | expr_alias} [NOT] IN @uservar condition syntax is supported. (Refer to Section 7.7, <> for a discussion of global user variables.) * GROUP BY clause. Currently only supports grouping by a single column. The column however can be a computed expression: | SELECT *, group_id*1000+article_type AS gkey FROM example GROUP BY gkey Aggregate functions (AVG(), MIN(), MAX(), SUM()) in column list clause are supported. Arguments to aggregate functions can be either plain attributes or arbitrary expressions. COUNT(*) is implicitly supported as using GROUP BY will add @count column to result set. Explicit support might be added in the future. COUNT(DISTINCT attr) is supported. Currently there can be at most one COUNT(DISTINCT) per query and an argument needs to be an attribute. Both current restrictions on COUNT(DISTINCT) might be lifted in the future. | SELECT *, AVG(price) AS avgprice, COUNT(DISTINCT storeid) | FROM products | WHERE MATCH('ipod') | GROUP BY vendorid Starting with 2.0.1-beta, GROUP BY on a string attribute is supported, with respect for current collation (see Section 5.12, <>). * WITHIN GROUP ORDER BY clause. This is a Sphinx specific extension that lets you control how the best row within a group will to be selected. The syntax matches that of regular ORDER BY clause: | SELECT *, INTERVAL(posted,NOW()-7*86400,NOW()-86400) AS timeseg | FROM example WHERE MATCH('my search query') | GROUP BY siteid | WITHIN GROUP ORDER BY @weight DESC | ORDER BY timeseg DESC, @weight DESC Starting with 2.0.1-beta, WITHIN GROUP ORDER BY on a string attribute is supported, with respect for current collation (see Section 5.12, <>). * ORDER BY clause. Unlike in regular SQL, only column names (not expressions) are allowed and explicit ASC and DESC are required. The columns however can be computed expressions: | SELECT *, @weight*10+docboost AS skey FROM example ORDER BY skey Starting with 2.0.1-beta, ORDER BY on a string attribute is supported, with respect for current collation (see Section 5.12, <>). * LIMIT clause. Both LIMIT N and LIMIT M,N forms are supported. Unlike in regular SQL (but like in Sphinx API), an implicit LIMIT 0,20 is present by default. * OPTION clause. This is a Sphinx specific extension that lets you control a number of per-query options. The syntax is: | OPTION = [ , ... ] Supported options and respectively allowed values are: * 'ranker' - any of 'proximity_bm25', 'bm25', 'none', 'wordcount', 'proximity', 'matchany', or 'fieldmask' * 'max_matches' - integer (per-query max matches value) * 'cutoff' - integer (max found matches threshold) * 'max_query_time' - integer (max search time threshold, msec) * 'retry_count' - integer (distributed retries count) * 'retry_delay' - integer (distributed retry delay, msec) * 'field_weights' - a named integer list (per-field user weights for ranking) * 'index_weights' - a named integer list (per-index user weights for ranking) * 'reverse_scan' - 0 or 1, lets you control the order in which full-scan query processes the rows Example: | SELECT * FROM test WHERE MATCH('@title hello @body world') | OPTION ranker=bm25, max_matches=3000, | field_weights=(title=10, body=3) 7.2. SHOW META syntax ===================== | SHOW META SHOW META shows additional meta-information about the latest query such as query time and keyword statistics: | mysql> SELECT * FROM test1 WHERE MATCH('test|one|two'); | +------+--------+----------+------------+ | | id | weight | group_id | date_added | | +------+--------+----------+------------+ | | 1 | 3563 | 456 | 1231721236 | | | 2 | 2563 | 123 | 1231721236 | | | 4 | 1480 | 2 | 1231721236 | | +------+--------+----------+------------+ | 3 rows in set (0.01 sec) | | mysql> SHOW META; | +---------------+-------+ | | Variable_name | Value | | +---------------+-------+ | | total | 3 | | | total_found | 3 | | | time | 0.005 | | | keyword[0] | test | | | docs[0] | 3 | | | hits[0] | 5 | | | keyword[1] | one | | | docs[1] | 1 | | | hits[1] | 2 | | | keyword[2] | two | | | docs[2] | 1 | | | hits[2] | 2 | | +---------------+-------+ | 12 rows in set (0.00 sec) 7.3. SHOW WARNINGS syntax ========================= | SHOW WARNINGS SHOW WARNINGS statement, introduced in version 0.9.9-rc2, can be used to retrieve the warning produced by the latest query. The error message will be returned along with the query itself: | mysql> SELECT * FROM test1 WHERE MATCH('@@title hello') \G | ERROR 1064 (42000): index test1: syntax error, unexpected TOK_FIELDLIMIT | near '@title hello' | | mysql> SELECT * FROM test1 WHERE MATCH('@title -hello') \G | ERROR 1064 (42000): index test1: query is non-computable (single NOT operator) | | mysql> SELECT * FROM test1 WHERE MATCH('"test doc"/3') \G | *************************** 1. row *************************** | id: 4 | weight: 2500 | group_id: 2 | date_added: 1231721236 | 1 row in set, 1 warning (0.00 sec) | | mysql> SHOW WARNINGS \G | *************************** 1. row *************************** | Level: warning | Code: 1000 | Message: quorum threshold too high (words=2, thresh=3); replacing quorum operator | with AND operator | 1 row in set (0.00 sec) 7.4. SHOW STATUS syntax ======================= SHOW STATUS, introduced in version 0.9.9-rc2, displays a number of useful performance counters. IO and CPU counters will only be available if searchd was started with --iostats and --cpustats switches respectively. | mysql> SHOW STATUS; | +--------------------+-------+ | | Variable_name | Value | | +--------------------+-------+ | | uptime | 216 | | | connections | 3 | | | maxed_out | 0 | | | command_search | 0 | | | command_excerpt | 0 | | | command_update | 0 | | | command_keywords | 0 | | | command_persist | 0 | | | command_status | 0 | | | agent_connect | 0 | | | agent_retry | 0 | | | queries | 10 | | | dist_queries | 0 | | | query_wall | 0.075 | | | query_cpu | OFF | | | dist_wall | 0.000 | | | dist_local | 0.000 | | | dist_wait | 0.000 | | | query_reads | OFF | | | query_readkb | OFF | | | query_readtime | OFF | | | avg_query_wall | 0.007 | | | avg_query_cpu | OFF | | | avg_dist_wall | 0.000 | | | avg_dist_local | 0.000 | | | avg_dist_wait | 0.000 | | | avg_query_reads | OFF | | | avg_query_readkb | OFF | | | avg_query_readtime | OFF | | +--------------------+-------+ | 29 rows in set (0.00 sec) 7.5. INSERT and REPLACE syntax ============================== | {INSERT | REPLACE} INTO index [(column, ...)] | VALUES (value, ...) | [, (...)] INSERT statement, introduced in version 1.10-beta, is only supported for RT indexes. It inserts new rows (documents) into an existing index, with the provided column values. ID column must be present in all cases. Rows with duplicate IDs will not be overwritten by INSERT; use REPLACE to do that. index is the name of RT index into which the new row(s) should be inserted. The optional column names list lets you only explicitly specify values for some of the columns present in the index. All the other columns will be filled with their default values (0 for scalar types, empty string for text types). Expressions are not currently supported in INSERT and values should be explicitly specified. Multiple rows can be inserted using a single INSERT statement by providing several comma-separated, parens-enclosed lists of rows values. 7.6. DELETE syntax ================== | DELETE FROM index WHERE {id = value | id IN (val1 [, val2 [, ...]])} DELETE statement, introduced in version 1.10-beta, is only supported for RT indexes. It deletes existing rows (documents) from an existing index based on ID. index is the name of RT index from which the row should be deleted. value is the row ID to be deleted. Support for batch id IN (2,3,5) syntax was added in version 2.0.1-beta. Additional types of WHERE conditions (such as conditions on attributes, etc) are planned, but not supported yet as of 1.10-beta. 7.7. SET syntax =============== | SET [GLOBAL] server_variable_name = value | SET GLOBAL @user_variable_name = (int_val1 [, int_val2, ...]) SET statement, introduced in version 1.10-beta, modifies a server variable value. The variable names are case-insensitive. No variable value changes survive server restart. There are the following classes of the variables: 1. per-session server variable (1.10-beta and above) 2. global server variable (2.0.1-beta and above) 3. global user variable (2.0.1-beta and above) Global user variables are shared between concurrent sessions. Currently, the only supported value type is the list of BIGINTs, and these variables can only be used along with IN() for filtering purpose. The intended usage scenario is uploading huge lists of values to searchd (once) and reusing them (many times) later, saving on network overheads. Example: | // in session 1 | mysql> SET GLOBAL @myfilter=(2,3,5,7,11,13); | Query OK, 0 rows affected (0.00 sec) | | // later in session 2 | mysql> SELECT * FROM test1 WHERE group_id IN @myfilter; | +------+--------+----------+------------+-----------------+------+ | | id | weight | group_id | date_added | title | tag | | +------+--------+----------+------------+-----------------+------+ | | 3 | 1 | 2 | 1299338153 | another doc | 15 | | | 4 | 1 | 2 | 1299338153 | doc number four | 7,40 | | +------+--------+----------+------------+-----------------+------+ | 2 rows in set (0.02 sec) Per-session and global server variables affect certain server settings in the respective scope. Known per-session server variables are: AUTOCOMMIT = {0 | 1} Whether any data modification statement should be implicitly wrapped by BEGIN and COMMIT. Introduced in version 1.10-beta. COLLATION_CONNECTION = collation_name Selects the collation to be used for ORDER BY or GROUP BY on string values in the subsequent queries. Refer to Section 5.12, <> for a list of known collation names. Introduced in version 2.0.1-beta. CHARACTER_SET_RESULTS = charset_name Does nothing; a placeholder to support frameworks, clients, and connectors that attempt to automatically enforce a charset when connecting to a Sphinx server. Introduced in version 2.0.1-beta. Known global server variables are: QUERY_LOG_FORMAT = {plain | sphinxql} Changes the current log format. Introduced in version 2.0.1-beta. LOG_LEVEL = {info | debug | debugv | debugvv} Changes the current log verboseness level. Introduced in version 2.0.1-beta. Examples: | mysql> SET autocommit=0; | Query OK, 0 rows affected (0.00 sec) | | mysql> SET GLOBAL query_log_format=sphinxql; | Query OK, 0 rows affected (0.00 sec) 7.8. BEGIN, COMMIT, and ROLLBACK syntax ======================================= | START TRANSACTION | BEGIN | COMMIT | ROLLBACK | SET AUTOCOMMIT = {0 | 1} BEGIN, COMMIT, and ROLLBACK statements were introduced in version 1.10-beta. BEGIN statement (or its START TRANSACTION alias) forcibly commits pending transaction, if any, and begins a new one. COMMIT statement commits the current transaction, making all its changes permanent. ROLLBACK statement rolls back the current transaction, canceling all its changes. SET AUTOCOMMIT controls the autocommit mode in the active session. AUTOCOMMIT is set to 1 by default, meaning that every statement that perfoms any changes on any index is implicitly wrapped in BEGIN and COMMIT. Transactions are limited to a single RT index, and also limited in size. They are atomic, consistent, overly isolated, and durable. Overly isolated means that the changes are not only invisible to the concurrent transactions but even to the current session itself. 7.9. CALL SNIPPETS syntax ========================= | CALL SNIPPETS(data, index, query[, opt_value AS opt_name[, ...]]) CALL SNIPPETS statement, introduced in version 1.10-beta, builds a snippet from provided data and query, using specified index settings. data is the source data string to extract a snippet from. index is the name of the index from which to take the text processing settings. query is the full-text query to build snippets for. Additional options are documented in Section 8.7.1, <>. Usage example: | CALL SNIPPETS('this is my document text', 'test1', 'hello world', | 5 AS around, 200 AS limit) 7.10. CALL KEYWORDS syntax ========================== | CALL KEYWORDS(text, index, [hits]) CALL KEYWORDS statement, introduced in version 1.10-beta, splits text into particular keywords. It returns tokenized and normalized forms of the keywords, and, optionally, keyword statistics. text is the text to break down to keywords. index is the name of the index from which to take the text processing settings. hits is an optional boolean parameter that specifies whether to return document and hit occurrence statistics. 7.11. SHOW TABLES syntax ======================== | SHOW TABLES SHOW TABLES statement, introduced in version 2.0.1-beta, enumerates all currently active indexes along with their types. As of 2.0.1-beta, existing index types are local, distributed, and rt respectively. Example: | mysql> SHOW TABLES; | +-------+-------------+ | | Index | Type | | +-------+-------------+ | | dist1 | distributed | | | rt | rt | | | test1 | local | | | test2 | local | | +-------+-------------+ | 4 rows in set (0.00 sec) 7.12. DESCRIBE syntax ===================== | {DESC | DESCRIBE} index DESCRIBE statement, introduced in version 2.0.1-beta, lists index columns and their associated types. Columns are document ID, full-text fields, and attributes. The order matches that in which fields and attributes are expected by INSERT and REPLACE statements. As of 2.0.1-beta, column types are field, integer, timestamp, ordinal, bool, float, bigint, string, and mva. ID column will be typed either integer or bigint based on whether the binaries were built with 32-bit or 64-bit document ID support. Example: | mysql> DESC rt; | +---------+---------+ | | Field | Type | | +---------+---------+ | | id | integer | | | title | field | | | content | field | | | gid | integer | | +---------+---------+ | 4 rows in set (0.00 sec) 7.13. CREATE FUNCTION syntax ============================ | CREATE FUNCTION udf_name | RETURNS {INT | BIGINT | FLOAT} | SONAME 'udf_lib_file' CREATE FUNCTION statement, introduced in version 2.0.1-beta, installs a user-defined function (UDF) with the given name and type from the given library file. The library file must reside in a trusted plugin_dir directory. On success, the function is available for use in all subsequent queries that the server receives. Example: | mysql> CREATE FUNCTION avgmva RETURNS INT SONAME 'udfexample.dll'; | Query OK, 0 rows affected (0.03 sec) | | mysql> SELECT *, AVGMVA(tag) AS q from test1; | +------+--------+---------+-----------+ | | id | weight | tag | q | | +------+--------+---------+-----------+ | | 1 | 1 | 1,3,5,7 | 4.000000 | | | 2 | 1 | 2,4,6 | 4.000000 | | | 3 | 1 | 15 | 15.000000 | | | 4 | 1 | 7,40 | 23.500000 | | +------+--------+---------+-----------+ 7.14. DROP FUNCTION syntax ========================== | DROP FUNCTION udf_name DROP FUNCTION statement, introduced in version 2.0.1-beta, deinstalls a user-defined function (UDF) with the given name. On success, the function is no longer available for use in subsequent queries. Pending concurrent queries will not be affected and the library unload, if necessary, will be postponed until those queries complete. Example: | mysql> DROP FUNCTION avgmva; | Query OK, 0 rows affected (0.00 sec) 7.15. SHOW VARIABLES syntax =========================== | SHOW VARIABLES Added in version 2.0.1-beta, this is currently a placeholder query that does nothing and reports success. That is in order to keep compatibility with frameworks and connectors that automatically execute this statement. | mysql> SHOW VARIABLES; | Query OK, 0 rows affected (0.00 sec) 7.16. SHOW COLLATION syntax =========================== | SHOW COLLATION Added in version 2.0.1-beta, this is currently a placeholder query that does nothing and reports success. That is in order to keep compatibility with frameworks and connectors that automatically execute this statement. | mysql> SHOW COLLATION; | Query OK, 0 rows affected (0.00 sec) 7.17. UPDATE syntax =================== | UPDATE index SET col1 = newval1 [, ...] WHERE ID = docid UPDATE statement was added in version 2.0.1-beta. It can currently update 32-bit integer attributes only. Multiple attributes and values can be specified. Both RT and disk indexes are supported. Updates on other attribute types are also planned. | mysql> UPDATE myindex SET enabled=0 WHERE id=123; | Query OK, 1 rows affected (0.00 sec) 7.18. Multi-statement queries ============================= Starting version 2.0.1-beta, SphinxQL supports multi-statement queries, or batches. Possible inter-statement optimizations described in Section 5.11, <> do apply to SphinxQL just as well. The batched queries should be separated by a semicolon. Your MySQL client library needs to support MySQL multi-query mechanism and multiple result set. For instance, mysqli interface in PHP and DBI/DBD libraries in Perl are known to work. Here's a PHP sample showing how to utilize mysqli interface with Sphinx. | >) and geodistance functions (Section 8.4.5, <>) are now internally implemented using this computed expressions mechanism, using magic names '@expr' and '@geodist' respectively. Example: | $cl->SetSelect ( "*, @weight+(user_karma+ln(pageviews))*0.1 AS myweight" ); | $cl->SetSelect ( "exp_years, salary_gbp*{$gbp_usd_rate} AS salary_usd, | IF(age>40,1,0) AS over40" ); | $cl->SetSelect ( "*, AVG(price) AS avgprice" ); 8.3. Full-text search query settings ==================================== 8.3.1. SetMatchMode ------------------- Prototype: function SetMatchMode ( $mode ) Sets full-text query matching mode, as described in Section 5.1, <>. Parameter must be a constant specifying one of the known modes. WARNING: (PHP specific) you must not take the matching mode constant name in quotes, that syntax specifies a string and is incorrect: | $cl->SetMatchMode ( "SPH_MATCH_ANY" ); // INCORRECT! will not work as expected | $cl->SetMatchMode ( SPH_MATCH_ANY ); // correct, works OK 8.3.2. SetRankingMode --------------------- Prototype: function SetRankingMode ( $ranker ) Sets ranking mode. Only available in SPH_MATCH_EXTENDED2 matching mode at the time of this writing. Parameter must be a constant specifying one of the known modes. By default, Sphinx computes two factors which contribute to the final match weight. The major part is query phrase proximity to document text. The minor part is so-called BM25 statistical function, which varies from 0 to 1 depending on the keyword frequency within document (more occurrences yield higher weight) and within the whole index (more rare keywords yield higher weight). However, in some cases you'd want to compute weight differently - or maybe avoid computing it at all for performance reasons because you're sorting the result set by something else anyway. This can be accomplished by setting the appropriate ranking mode. Currently implemented modes are: * SPH_RANK_PROXIMITY_BM25, default ranking mode which uses and combines both phrase proximity and BM25 ranking. * SPH_RANK_BM25, statistical ranking mode which uses BM25 ranking only (similar to most other full-text engines). This mode is faster but may result in worse quality on queries which contain more than 1 keyword. * SPH_RANK_NONE, disabled ranking mode. This mode is the fastest. It is essentially equivalent to boolean searching. A weight of 1 is assigned to all matches. * SPH_RANK_WORDCOUNT, ranking by keyword occurrences count. This ranker computes the amount of per-field keyword occurrences, then multiplies the amounts by field weights, then sums the resulting values for the final result. * SPH_RANK_PROXIMITY, added in version 0.9.9-rc1, returns raw phrase proximity value as a result. This mode is internally used to emulate SPH_MATCH_ALL queries. * SPH_RANK_MATCHANY, added in version 0.9.9-rc1, returns rank as it was computed in SPH_MATCH_ANY mode ealier, and is internally used to emulate SPH_MATCH_ANY queries. * SPH_RANK_FIELDMASK, added in version 0.9.9-rc2, returns a 32-bit mask with N-th bit corresponding to N-th fulltext field, numbering from 0. The bit will only be set when the respective field has any keyword occurences satisfiying the query. * SPH_RANK_SPH04, added in version 1.10-beta, is generally based on the default SPH_RANK_PROXIMITY_BM25 ranker, but additionally boosts the matches when they occur in the very beginning or the very end of a text field. Thus, if a field equals the exact query, SPH04 should rank it higher than a field that contains the exact query but is not equal to it. (For instance, when the query is "Hyde Park", a document entitled "Hyde Park" should be ranked higher than a one entitled "Hyde Park, London" or "The Hyde Park Cafe".) 8.3.3. SetSortMode ------------------ Prototype: function SetSortMode ( $mode, $sortby="" ) Set matches sorting mode, as described in Section 5.6, <>. Parameter must be a constant specifying one of the known modes. WARNING: (PHP specific) you must not take the matching mode constant name in quotes, that syntax specifies a string and is incorrect: | $cl->SetSortMode ( "SPH_SORT_ATTR_DESC" ); // INCORRECT! will not work as expected | $cl->SetSortMode ( SPH_SORT_ATTR_ASC ); // correct, works OK 8.3.4. SetWeights ----------------- Prototype: function SetWeights ( $weights ) Binds per-field weights in the order of appearance in the index. DEPRECATED, use SetFieldWeights() instead. 8.3.5. SetFieldWeights ---------------------- Prototype: function SetFieldWeights ( $weights ) Binds per-field weights by name. Parameter must be a hash (associative array) mapping string field names to integer weights. Match ranking can be affected by per-field weights. For instance, see Section 5.4, <> for an explanation how phrase proximity ranking is affected. This call lets you specify what non-default weights to assign to different full-text fields. The weights must be positive 32-bit integers. The final weight will be a 32-bit integer too. Default weight value is 1. Unknown field names will be silently ignored. There is no enforced limit on the maximum weight value at the moment. However, beware that if you set it too high you can start hitting 32-bit wraparound issues. For instance, if you set a weight of 10,000,000 and search in extended mode, then maximum possible weight will be equal to 10 million (your weight) by 1 thousand (internal BM25 scaling factor, see Section 5.4, <>) by 1 or more (phrase proximity rank). The result is at least 10 billion that does not fit in 32 bits and will be wrapped around, producing unexpected results. 8.3.6. SetIndexWeights ---------------------- Prototype: function SetIndexWeights ( $weights ) Sets per-index weights, and enables weighted summing of match weights across different indexes. Parameter must be a hash (associative array) mapping string index names to integer weights. Default is empty array that means to disable weighting summing. When a match with the same document ID is found in several different local indexes, by default Sphinx simply chooses the match from the index specified last in the query. This is to support searching through partially overlapping index partitions. However in some cases the indexes are not just partitions, and you might want to sum the weights across the indexes instead of picking one. SetIndexWeights() lets you do that. With summing enabled, final match weight in result set will be computed as a sum of match weight coming from the given index multiplied by respective per-index weight specified in this call. Ie. if the document 123 is found in index A with the weight of 2, and also in index B with the weight of 3, and you called SetIndexWeights ( array ( "A"=>100, "B"=>10 ) ), the final weight return to the client will be 2*100+3*10 = 230. 8.4. Result set filtering settings ================================== 8.4.1. SetIDRange ----------------- Prototype: function SetIDRange ( $min, $max ) Sets an accepted range of document IDs. Parameters must be integers. Defaults are 0 and 0; that combination means to not limit by range. After this call, only those records that have document ID between $min and $max (including IDs exactly equal to $min or $max) will be matched. 8.4.2. SetFilter ---------------- Prototype: function SetFilter ( $attribute, $values, $exclude=false ) Adds new integer values set filter. On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $values must be a plain array containing integer values. $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them. Only those documents where $attribute column value stored in the index matches any of the values from $values array will be matched (or rejected, if $exclude is true). 8.4.3. SetFilterRange --------------------- Prototype: function SetFilterRange ( $attribute, $min, $max, $exclude=false ) Adds new integer range filter. On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $min and $max must be integers that define the acceptable attribute values range (including the boundaries). $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them. Only those documents where $attribute column value stored in the index is between $min and $max (including values that are exactly equal to $min or $max) will be matched (or rejected, if $exclude is true). 8.4.4. SetFilterFloatRange -------------------------- Prototype: function SetFilterFloatRange ( $attribute, $min, $max, $exclude=false ) Adds new float range filter. On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $min and $max must be floats that define the acceptable attribute values range (including the boundaries). $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them. Only those documents where $attribute column value stored in the index is between $min and $max (including values that are exactly equal to $min or $max) will be matched (or rejected, if $exclude is true). 8.4.5. SetGeoAnchor ------------------- Prototype: function SetGeoAnchor ( $attrlat, $attrlong, $lat, $long ) Sets anchor point for and geosphere distance (geodistance) calculations, and enable them. $attrlat and $attrlong must be strings that contain the names of latitude and longitude attributes, respectively. $lat and $long are floats that specify anchor point latitude and longitude, in radians. Once an anchor point is set, you can use magic "@geodist" attribute name in your filters and/or sorting expressions. Sphinx will compute geosphere distance between the given anchor point and a point specified by latitude and lognitude attributes from each full-text match, and attach this value to the resulting match. The latitude and longitude values both in SetGeoAnchor and the index attribute data are expected to be in radians. The result will be returned in meters, so geodistance value of 1000.0 means 1 km. 1 mile is approximately 1609.344 meters. 8.5. GROUP BY settings ====================== 8.5.1. SetGroupBy ----------------- Prototype: function SetGroupBy ( $attribute, $func, $groupsort="@group desc" ) Sets grouping attribute, function, and groups sorting mode; and enables grouping (as described in Section 5.7, <>). $attribute is a string that contains group-by attribute name. $func is a constant that chooses a function applied to the attribute value in order to compute group-by key. $groupsort is a clause that controls how the groups will be sorted. Its syntax is similar to that described in Section 5.6, <>. Grouping feature is very similar in nature to GROUP BY clause from SQL. Results produces by this function call are going to be the same as produced by the following pseudo code: | SELECT ... GROUP BY $func($attribute) ORDER BY $groupsort Note that it's $groupsort that affects the order of matches in the final result set. Sorting mode (see Section 8.3.3, <>) affect the ordering of matches within group, ie. what match will be selected as the best one from the group. So you can for instance order the groups by matches count and select the most relevant match within each group at the same time. Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported through SetSelect() API call when using GROUP BY. Starting with version 2.0.1-beta, grouping on string attributes is supported, with respect to current collation. 8.5.2. SetGroupDistinct ----------------------- Prototype: function SetGroupDistinct ( $attribute ) Sets attribute name for per-group distinct values count calculations. Only available for grouping queries. $attribute is a string that contains the attribute name. For each group, all values of this attribute will be stored (as RAM limits permit), then the amount of distinct values will be calculated and returned to the client. This feature is similar to COUNT(DISTINCT) clause in standard SQL; so these Sphinx calls: | $cl->SetGroupBy ( "category", SPH_GROUPBY_ATTR, "@count desc" ); | $cl->SetGroupDistinct ( "vendor" ); can be expressed using the following SQL clauses: | SELECT id, weight, all-attributes, | COUNT(DISTINCT vendor) AS @distinct, | COUNT(*) AS @count | FROM products | GROUP BY category | ORDER BY @count DESC In the sample pseudo code shown just above, SetGroupDistinct() call corresponds to COUNT(DISINCT vendor) clause only. GROUP BY, ORDER BY, and COUNT(*) clauses are all an equivalent of SetGroupBy() settings. Both queries will return one matching row for each category. In addition to indexed attributes, matches will also contain total per-category matches count, and the count of distinct vendor IDs within each category. 8.6. Querying ============= 8.6.1. Query ------------ Prototype: function Query ( $query, $index="*", $comment="" ) Connects to searchd server, runs given search query with current settings, obtains and returns the result set. $query is a query string. $index is an index name (or names) string. Returns false and sets GetLastError() message on general error. Returns search result set on success. Additionally, the contents of $comment are sent to the query log, marked in square brackets, just before the search terms, which can be very useful for debugging. Currently, the comment is limited to 128 characters. Default value for $index is "*" that means to query all local indexes. Characters allowed in index names include Latin letters (a-z), numbers (0-9), minus sign (-), and underscore (_); everything else is considered a separator. Therefore, all of the following samples calls are valid and will search the same two indexes: | $cl->Query ( "test query", "main delta" ); | $cl->Query ( "test query", "main;delta" ); | $cl->Query ( "test query", "main, delta" ); Index specification order matters. If document with identical IDs are found in two or more indexes, weight and attribute values from the very last matching index will be used for sorting and returning to client (unless explicitly overridden with SetIndexWeights()). Therefore, in the example above, matches from "delta" index will always win over matches from "main". On success, Query() returns a result set that contains some of the found matches (as requested by SetLimits()) and additional general per-query statistics. The result set is a hash (PHP specific; other languages might utilize other structures instead of hash) with the following keys and values: "matches": Hash which maps found document IDs to another small hash containing document weight and attribute values (or an array of the similar small hashes if SetArrayResult() was enabled). "total": Total amount of matches retrieved on server (ie. to the server side result set) by this query. You can retrieve up to this amount of matches from server for this query text with current query settings. "total_found": Total amount of matching documents in index (that were found and procesed on server). "words": Hash which maps query keywords (case-folded, stemmed, and otherwise processed) to a small hash with per-keyword statitics ("docs", "hits"). "error": Query error message reported by searchd (string, human readable). Empty if there were no errors. "warning": Query warning message reported by searchd (string, human readable). Empty if there were no warnings. It should be noted that Query() carries out the same actions as AddQuery() and RunQueries() without the intermediate steps; it is analoguous to a single AddQuery() call, followed by a corresponding RunQueries(), then returning the first array element of matches (from the first, and only, query.) 8.6.2. AddQuery --------------- Prototype: function AddQuery ( $query, $index="*", $comment="" ) Adds additional query with current settings to multi-query batch. $query is a query string. $index is an index name (or names) string. Additionally if provided, the contents of $comment are sent to the query log, marked in square brackets, just before the search terms, which can be very useful for debugging. Currently, this is limited to 128 characters. Returns index to results array returned from RunQueries(). Batch queries (or multi-queries) enable searchd to perform internal optimizations if possible. They also reduce network connection overheads and search process creation overheads in all cases. They do not result in any additional overheads compared to simple queries. Thus, if you run several different queries from your web page, you should always consider using multi-queries. For instance, running the same full-text query but with different sorting or group-by settings will enable searchd to perform expensive full-text search and ranking operation only once, but compute multiple group-by results from its output. This can be a big saver when you need to display not just plain search results but also some per-category counts, such as the amount of products grouped by vendor. Without multi-query, you would have to run several queries which perform essentially the same search and retrieve the same matches, but create result sets differently. With multi-query, you simply pass all these querys in a single batch and Sphinx optimizes the redundant full-text search internally. AddQuery() internally saves full current settings state along with the query, and you can safely change them afterwards for subsequent AddQuery() calls. Already added queries will not be affected; there's actually no way to change them at all. Here's an example: | $cl->SetSortMode ( SPH_SORT_RELEVANCE ); | $cl->AddQuery ( "hello world", "documents" ); | | $cl->SetSortMode ( SPH_SORT_ATTR_DESC, "price" ); | $cl->AddQuery ( "ipod", "products" ); | | $cl->AddQuery ( "harry potter", "books" ); | | $results = $cl->RunQueries (); With the code above, 1st query will search for "hello world" in "documents" index and sort results by relevance, 2nd query will search for "ipod" in "products" index and sort results by price, and 3rd query will search for "harry potter" in "books" index while still sorting by price. Note that 2nd SetSortMode() call does not affect the first query (because it's already added) but affects both other subsequent queries. Additionally, any filters set up before an AddQuery() will fall through to subsequent queries. So, if SetFilter() is called before the first query, the same filter will be in place for the second (and subsequent) queries batched through AddQuery() unless you call ResetFilters() first. Alternatively, you can add additional filters as well. This would also be true for grouping options and sorting options; no current sorting, filtering, and grouping settings are affected by this call; so subsequent queries will reuse current query settings. AddQuery() returns an index into an array of results that will be returned from RunQueries() call. It is simply a sequentially increasing 0-based integer, ie. first call will return 0, second will return 1, and so on. Just a small helper so you won't have to track the indexes manualy if you need then. 8.6.3. RunQueries ----------------- Prototype: function RunQueries () Connect to searchd, runs a batch of all queries added using AddQuery(), obtains and returns the result sets. Returns false and sets GetLastError() message on general error (such as network I/O failure). Returns a plain array of result sets on success. Each result set in the returned array is exactly the same as the result set returned from Query(). Note that the batch query request itself almost always succeds - unless there's a network error, blocking index rotation in progress, or another general failure which prevents the whole request from being processed. However individual queries within the batch might very well fail. In this case their respective result sets will contain non-empty "error" message, but no matches or query statistics. In the extreme case all queries within the batch could fail. There still will be no general error reported, because API was able to succesfully connect to searchd, submit the batch, and receive the results - but every result set will have a specific error message. 8.6.4. ResetFilters ------------------- Prototype: function ResetFilters () Clears all currently set filters. This call is only normally required when using multi-queries. You might want to set different filters for different queries in the batch. To do that, you should call ResetFilters() and add new filters using the respective calls. 8.6.5. ResetGroupBy ------------------- Prototype: function ResetGroupBy () Clears all currently group-by settings, and disables group-by. This call is only normally required when using multi-queries. You can change individual group-by settings using SetGroupBy() and SetGroupDistinct() calls, but you can not disable group-by using those calls. ResetGroupBy() fully resets previous group-by settings and disables group-by mode in the current state, so that subsequent AddQuery() calls can perform non-grouping searches. 8.7. Additional functionality ============================= 8.7.1. BuildExcerpts -------------------- Prototype: function BuildExcerpts ( $docs, $index, $words, $opts=array() ) Excerpts (snippets) builder function. Connects to searchd, asks it to generate excerpts (snippets) from given documents, and returns the results. $docs is a plain array of strings that carry the documents' contents. $index is an index name string. Different settings (such as charset, morphology, wordforms) from given index will be used. $words is a string that contains the keywords to highlight. They will be processed with respect to index settings. For instance, if English stemming is enabled in the index, "shoes" will be highlighted even if keyword is "shoe". Starting with version 0.9.9-rc1, keywords can contain wildcards, that work similarly to star-syntax available in queries. $opts is a hash which contains additional optional highlighting parameters: "before_match": A string to insert before a keyword match. Starting with version 1.10-beta, a %PASSAGE_ID% macro can be used in this string. The macro is replaced with an incrementing passage number within a current snippet. Numbering starts at 1 by default but can be overridden with "start_passage_id" option. In a multi-document call, %PASSAGE_ID% would restart at every given document. Default is "". "after_match": A string to insert after a keyword match. Starting with version 1.10-beta, a %PASSAGE_ID% macro can be used in this string. Default is "". "chunk_separator": A string to insert between snippet chunks (passages). Default is " ... ". "limit": Maximum snippet size, in symbols (codepoints). Integer, default is 256. "around": How much words to pick around each matching keywords block. Integer, default is 5. "exact_phrase": Whether to highlight exact query phrase matches only instead of individual keywords. Boolean, default is false. "single_passage": Whether to extract single best passage only. Boolean, default is false. "use_boundaries": Whether to additionaly break passages by phrase boundary characters, as configured in index settings with phrase_boundary directive. Boolean, default is false. "weight_order": Whether to sort the extracted passages in order of relevance (decreasing weight), or in order of appearance in the document (increasing position). Boolean, default is false. "query_mode": Added in version 1.10-beta. Whether to handle $words as a query in extended syntax, or as a bag of words (default behavior). For instance, in query mode ("one two" | "three four") will only highlight and include those occurrences "one two" or "three four" when the two words from each pair are adjacent to each other. In default mode, any single occurrence of "one", "two", "three", or "four" would be highlighted. Boolean, default is false. "force_all_words": Added in version 1.10-beta. Ignores the snippet length limit until it includes all the keywords. Boolean, default is false. "limit_passages": Added in version 1.10-beta. Limits the maximum number of passages that can be included into the snippet. Integer, default is 0 (no limit). "limit_words": Added in version 1.10-beta. Limits the maximum number of keywords that can be included into the snippet. Integer, default is 0 (no limit). "start_passage_id": Added in version 1.10-beta. Specifies the starting value of %PASSAGE_ID% macro (that gets detected and expanded in before_match, after_match strings). Integer, default is 1. "load_files": Added in version 1.10-beta. Whether to handle $docs as data to extract snippets from (default behavior), or to treat it as file names, and load data from specified files on the server side. Starting with version 2.0.1-beta, up to dist_threads worker threads per request will be created to parallelize the work when this flag is enabled. Boolean, default is false. "html_strip_mode": Added in version 1.10-beta. HTML stripping mode setting. Defaults to "index", which means that index settings will be used. The other values are "none" and "strip", that forcibly skip or apply stripping irregardless of index settings; and "retain", that retains HTML markup and protects it from highlighting. The "retain" mode can only be used when highlighting full documents and thus requires that no snippet size limits are set. String, allowed values are "none", "strip", "index", and "retain". "allow_empty": Added in version 1.10-beta. Allows empty string to be returned as highlighting result when a snippet could not be generated (no keywords match, or no passages fit the limit). By default, the beginning of original text would be returned instead of an empty string. Boolean, default is false. "passage_boundary": Added in version 2.0.1-beta. Ensures that passages do not cross a sentence, paragraph, or zone boundary (when used with an index that has the respective indexing settings enabled). String, allowed values are "sentence", "paragraph", and "zone". "passage_boundary": Added in version 2.0.1-beta. Ensures that passages do not cross a sentence, paragraph, or zone boundary (when used with an index that has the respective indexing settings enabled). String, allowed values are "sentence", "paragraph", and "zone". "emit_zones": Added in version 2.0.1-beta. Emits an HTML tag with an enclosing zone name before each passage. Boolean, default is false. Snippets extraction algorithm currently favors better passages (with closer phrase matches), and then passages with keywords not yet in snippet. Generally, it will try to highlight the best match with the query, and it will also to highlight all the query keywords, as made possible by the limtis. In case the document does not match the query, beginning of the document trimmed down according to the limits will be return by default. Starting with 1.10-beta, you can also return an empty snippet instead case by setting "allow_empty" option to true. Returns false on failure. Returns a plain array of strings with excerpts (snippets) on success. 8.7.2. UpdateAttributes ----------------------- Prototype: function UpdateAttributes ( $index, $attrs, $values ) Instantly updates given attribute values in given documents. Returns number of actually updated documents (0 or more) on success, or -1 on failure. $index is a name of the index (or indexes) to be updated. $attrs is a plain array with string attribute names, listing attributes that are updated. $values is a hash where key is document ID, and value is a plain array of new attribute values. $index can be either a single index name or a list, like in Query(). Unlike Query(), wildcard is not allowed and all the indexes to update must be specified explicitly. The list of indexes can include distributed index names. Updates on distributed indexes will be pushed to all agents. The updates only work with docinfo=extern storage strategy. They are very fast because they're working fully in RAM, but they can also be made persistent: updates are saved on disk on clean searchd shutdown initiated by SIGTERM signal. With additional restrictions, updates are also possible on MVA attributes; refer to mva_updates_pool directive for details. Usage example: | $cl->UpdateAttributes ( "test1", array("group_id"), array(1=>array(456)) ); | $cl->UpdateAttributes ( "products", array ( "price", "amount_in_stock" ), | array ( 1001=>array(123,5), 1002=>array(37,11), 1003=>(25,129) ) ); The first sample statement will update document 1 in index "test1", setting "group_id" to 456. The second one will update documents 1001, 1002 and 1003 in index "products". For document 1001, the new price will be set to 123 and the new amount in stock to 5; for document 1002, the new price will be 37 and the new amount will be 11; etc. 8.7.3. BuildKeywords -------------------- Prototype: function BuildKeywords ( $query, $index, $hits ) Extracts keywords from query using tokenizer settings for given index, optionally with per-keyword occurrence statistics. Returns an array of hashes with per-keyword information. $query is a query to extract keywords from. $index is a name of the index to get tokenizing settings and keyword occurrence statistics from. $hits is a boolean flag that indicates whether keyword occurrence statistics are required. Usage example: | $keywords = $cl->BuildKeywords ( "this.is.my query", "test1", false ); 8.7.4. EscapeString ------------------- Prototype: function EscapeString ( $string ) Escapes characters that are treated as special operators by the query language parser. Returns an escaped string. $string is a string to escape. This function might seem redundant because it's trivial to implement in any calling application. However, as the set of special characters might change over time, it makes sense to have an API call that is guaranteed to escape all such characters at all times. Usage example: | $escaped = $cl->EscapeString ( "escaping-sample@query/string" ); 8.7.5. Status ------------- Prototype: function Status () Queries searchd status, and returns an array of status variable name and value pairs. Usage example: | $status = $cl->Status (); | foreach ( $status as $row ) | print join ( ": ", $row ) . "\n"; 8.7.6. FlushAttributes ---------------------- Prototype: function FlushAttributes () Forces searchd to flush pending attribute updates to disk, and blocks until completion. Returns a non-negative internal "flush tag" on success. Returns -1 and sets an error message on error. Introduced in version 1.10-beta. Attribute values updated using UpdateAttributes() API call are only kept in RAM until a so-called flush (which writes the current, possibly updated attribute values back to disk). FlushAttributes() call lets you enforce a flush. The call will block until searchd finishes writing the data to disk, which might take seconds or even minutes depending on the total data size (.spa file size). All the currently updated indexes will be flushed. Flush tag should be treated as an ever growing magic number that does not mean anything. It's guaranteed to be non-negative. It is guaranteed to grow over time, though not necessarily in a sequential fashion; for instance, two calls that return 10 and then 1000 respectively are a valid situation. If two calls to FlushAttrs() return the same tag, it means that there were no actual attribute updates in between them, and therefore current flushed state remained the same (for all indexes). Usage example: | $status = $cl->FlushAttributes (); | if ( $status<0 ) | print "ERROR: " . $cl->GetLastError(); 8.8. Persistent connections =========================== Persistent connections allow to use single network connection to run multiple commands that would otherwise require reconnects. 8.8.1. Open ----------- Prototype: function Open () Opens persistent connection to the server. 8.8.2. Close ------------ Prototype: function Close () Closes previously opened persistent connection. Chapter 9. MySQL storage engine (SphinxSE) ========================================== Table of Contents 9.1. SphinxSE overview 9.2. Installing SphinxSE 9.2.1. Compiling MySQL 5.0.x with SphinxSE 9.2.2. Compiling MySQL 5.1.x with SphinxSE 9.2.3. Checking SphinxSE installation 9.3. Using SphinxSE 9.4. Building snippets (excerpts) via MySQL 9.1. SphinxSE overview ====================== SphinxSE is MySQL storage engine which can be compiled into MySQL server 5.x using its pluggable architecure. It is not available for MySQL 4.x series. It also requires MySQL 5.0.22 or higher in 5.0.x series, or MySQL 5.1.12 or higher in 5.1.x series. Despite the name, SphinxSE does not actually store any data itself. It is actually a built-in client which allows MySQL server to talk to searchd, run search queries, and obtain search results. All indexing and searching happen outside MySQL. Obvious SphinxSE applications include: * easier porting of MySQL FTS applications to Sphinx; * allowing Sphinx use with progamming languages for which native APIs are not available yet; * optimizations when additional Sphinx result set processing on MySQL side is required (eg. JOINs with original document tables, additional MySQL-side filtering, etc). 9.2. Installing SphinxSE ======================== You will need to obtain a copy of MySQL sources, prepare those, and then recompile MySQL binary. MySQL sources (mysql-5.x.yy.tar.gz) could be obtained from dev.mysql.com Web site. For some MySQL versions, there are delta tarballs with already prepared source versions available from Sphinx Web site. After unzipping those over original sources MySQL would be ready to be configured and built with Sphinx support. If such tarball is not available, or does not work for you for any reason, you would have to prepare sources manually. You will need to GNU Autotools framework (autoconf, automake and libtool) installed to do that. 9.2.1. Compiling MySQL 5.0.x with SphinxSE ------------------------------------------ Skips steps 1-3 if using already prepared delta tarball. 1. copy sphinx.5.0.yy.diff patch file into MySQL sources directory and run | patch -p1 < sphinx.5.0.yy.diff If there's no .diff file exactly for the specific version you need to build, try applying .diff with closest version numbers. It is important that the patch should apply with no rejects. 2. in MySQL sources directory, run | sh BUILD/autorun.sh 3. in MySQL sources directory, create sql/sphinx directory in and copy all files in mysqlse directory from Sphinx sources there. Example: | cp -R /root/builds/sphinx-0.9.7/mysqlse /root/builds/mysql-5.0.24/sql/sphinx 4. configure MySQL and enable Sphinx engine: | ./configure --with-sphinx-storage-engine 5. build and install MySQL: | make | make install 9.2.2. Compiling MySQL 5.1.x with SphinxSE ------------------------------------------ Skip steps 1-2 if using already prepared delta tarball. 1. in MySQL sources directory, create storage/sphinx directory in and copy all files in mysqlse directory from Sphinx sources there. Example: | cp -R /root/builds/sphinx-0.9.7/mysqlse /root/builds/mysql-5.1.14/storage/sphinx 2. in MySQL sources directory, run | sh BUILD/autorun.sh 3. configure MySQL and enable Sphinx engine: | ./configure --with-plugins=sphinx 4. build and install MySQL: | make | make install 9.2.3. Checking SphinxSE installation ------------------------------------- To check whether SphinxSE has been succesfully compiled into MySQL, launch newly built servers, run mysql client and issue SHOW ENGINES query. You should see a list of all available engines. Sphinx should be present and "Support" column should contain "YES": | mysql> show engines; | +------------+----------+-------------------------------------------------------------+ | | Engine | Support | Comment | | +------------+----------+-------------------------------------------------------------+ | | MyISAM | DEFAULT | Default engine as of MySQL 3.23 with great performance | | ... | | SPHINX | YES | Sphinx storage engine | | ... | +------------+----------+-------------------------------------------------------------+ | 13 rows in set (0.00 sec) 9.3. Using SphinxSE =================== To search via SphinxSE, you would need to create special ENGINE=SPHINX "search table", and then SELECT from it with full text query put into WHERE clause for query column. Let's begin with an example create statement and search query: | CREATE TABLE t1 | ( | id INTEGER UNSIGNED NOT NULL, | weight INTEGER NOT NULL, | query VARCHAR(3072) NOT NULL, | group_id INTEGER, | INDEX(query) | ) ENGINE=SPHINX CONNECTION="sphinx://localhost:9312/test"; | | SELECT * FROM t1 WHERE query='test it;mode=any'; First 3 columns of search table must have a types of INTEGER UNSINGED or BIGINT for the 1st column (document id), INTEGER or BIGINT for the 2nd column (match weight), and VARCHAR or TEXT for the 3rd column (your query), respectively. This mapping is fixed; you can not omit any of these three required columns, or move them around, or change types. Also, query column must be indexed; all the others must be kept unindexed. Columns' names are ignored so you can use arbitrary ones. Additional columns must be either INTEGER, TIMESTAMP, BIGINT, VARCHAR, or FLOAT. They will be bound to attributes provided in Sphinx result set by name, so their names must match attribute names specified in sphinx.conf. If there's no such attribute name in Sphinx search results, column will have NULL values. Special "virtual" attributes names can also be bound to SphinxSE columns. _sph_ needs to be used instead of @ for that. For instance, to obtain the values of @groupby, @count, or @distinct virtual attributes, use _sph_groupby, _sph_count or _sph_distinct column names, respectively. CONNECTION string parameter can be used to specify default searchd host, port and indexes for queries issued using this table. If no connection string is specified in CREATE TABLE, index name "*" (ie. search all indexes) and localhost:9312 are assumed. Connection string syntax is as follows: | CONNECTION="sphinx://HOST:PORT/INDEXNAME" You can change the default connection string later: | ALTER TABLE t1 CONNECTION="sphinx://NEWHOST:NEWPORT/NEWINDEXNAME"; You can also override all these parameters per-query. As seen in example, both query text and search options should be put into WHERE clause on search query column (ie. 3rd column); the options are separated by semicolons; and their names from values by equality sign. Any number of options can be specified. Available options are: * query - query text; * mode - matching mode. Must be one of "all", "any", "phrase", "boolean", "extended", or "extended2". Default is "all"; * sort - match sorting mode. Must be one of "relevance", "attr_desc", "attr_asc", "time_segments", or "extended". In all modes besides "relevance" attribute name (or sorting clause for "extended") is also required after a colon: | ... WHERE query='test;sort=attr_asc:group_id'; | ... WHERE query='test;sort=extended:@weight desc, group_id asc'; * offset - offset into result set, default is 0; * limit - amount of matches to retrieve from result set, default is 20; * index - names of the indexes to search: | ... WHERE query='test;index=test1;'; | ... WHERE query='test;index=test1,test2,test3;'; * minid, maxid - min and max document ID to match; * weights - comma-separated list of weights to be assigned to Sphinx full-text fields: | ... WHERE query='test;weights=1,2,3;'; * filter, !filter - comma-separated attribute name and a set of values to match: | # only include groups 1, 5 and 19 | ... WHERE query='test;filter=group_id,1,5,19;'; | | # exclude groups 3 and 11 | ... WHERE query='test;!filter=group_id,3,11;'; * range, !range - comma-separated attribute name, min and max value to match: | # include groups from 3 to 7, inclusive | ... WHERE query='test;range=group_id,3,7;'; | | # exclude groups from 5 to 25 | ... WHERE query='test;!range=group_id,5,25;'; * maxmatches - per-query max matches value, as in max_matches parameter to SetLimits() API call: | ... WHERE query='test;maxmatches=2000;'; * cutoff - maximum allowed matches, as in cutoff parameter to SetLimits() API call: | ... WHERE query='test;cutoff=10000;'; * maxquerytme - maximum allowed query time (in milliseconds), as in SetMaxQueryTime() API call: | ... WHERE query='test;maxquerytime=1000;'; * groupby - group-by function and attribute, corresponding to SetGroupBy() API call: | ... WHERE query='test;groupby=day:published_ts;'; | ... WHERE query='test;groupby=attr:group_id;'; * groupsort - group-by sorting clause: | ... WHERE query='test;groupsort=@count desc;'; * distinct - an attribute to compute COUNT(DISTINCT) for when doing group-by, as in SetGroupDistinct() API call: | ... WHERE query='test;groupby=attr:country_id;distinct=site_id'; * indexweights - comma-separated list of index names and weights to use when searching through several indexes: | ... WHERE query='test;indexweights=idx_exact,2,idx_stemmed,1;'; * comment - a string to mark this query in query log (mapping to $comment parameter in Query() API call): | ... WHERE query='test;comment=marker001;'; * select - a string with expressions to compute (mapping to SetSelect() API call): | ... WHERE query='test;select=2*a+3*b as myexpr;'; * host, port - remote searchd host name and TCP port, respectively: | ... WHERE query='test;host=sphinx-test.loc;port=7312;'; * ranker - a ranking function to use when matching mode is extended2 (i.e. with query syntax), as in SetRankingMode() API call. Known values are "proximity_bm25", "bm25", "none", "wordcount", "proximity", "matchany", and "fieldmask". | ... WHERE query='test;mode=extended2;ranker=bm25;'; * geoanchor - geodistance anchor, as in SetGeoAnchor() API call. Takes 4 parameters which are latitude and longiture attribute names, and anchor point coordinates respectively: | ... WHERE query='test;geoanchor=latattr,lonattr,0.123,0.456'; One very important note that it is much more efficient to allow Sphinx to perform sorting, filtering and slicing the result set than to raise max matches count and use WHERE, ORDER BY and LIMIT clauses on MySQL side. This is for two reasons. First, Sphinx does a number of optimizations and performs better than MySQL on these tasks. Second, less data would need to be packed by searchd, transferred and unpacked by SphinxSE. Starting with version 0.9.9-rc1, additional query info besides result set could be retrieved with SHOW ENGINE SPHINX STATUS statement: | mysql> SHOW ENGINE SPHINX STATUS; | +--------+-------+-------------------------------------------------+ | | Type | Name | Status | | +--------+-------+-------------------------------------------------+ | | SPHINX | stats | total: 25, total found: 25, time: 126, words: 2 | | | SPHINX | words | sphinx:591:1256 soft:11076:15945 | | +--------+-------+-------------------------------------------------+ | 2 rows in set (0.00 sec) This information can also be accessed through status variables. Note that this method does not require super-user privileges. | mysql> SHOW STATUS LIKE 'sphinx_%'; | +--------------------+----------------------------------+ | | Variable_name | Value | | +--------------------+----------------------------------+ | | sphinx_total | 25 | | | sphinx_total_found | 25 | | | sphinx_time | 126 | | | sphinx_word_count | 2 | | | sphinx_words | sphinx:591:1256 soft:11076:15945 | | +--------------------+----------------------------------+ | 5 rows in set (0.00 sec) You could perform JOINs on SphinxSE search table and tables using other engines. Here's an example with "documents" from example.sql: | mysql> SELECT content, date_added FROM test.documents docs | -> JOIN t1 ON (docs.id=t1.id) | -> WHERE query="one document;mode=any"; | +-------------------------------------+---------------------+ | | content | docdate | | +-------------------------------------+---------------------+ | | this is my test document number two | 2006-06-17 14:04:28 | | | this is my test document number one | 2006-06-17 14:04:28 | | +-------------------------------------+---------------------+ | 2 rows in set (0.00 sec) | | mysql> SHOW ENGINE SPHINX STATUS; | +--------+-------+---------------------------------------------+ | | Type | Name | Status | | +--------+-------+---------------------------------------------+ | | SPHINX | stats | total: 2, total found: 2, time: 0, words: 2 | | | SPHINX | words | one:1:2 document:2:2 | | +--------+-------+---------------------------------------------+ | 2 rows in set (0.00 sec) 9.4. Building snippets (excerpts) via MySQL =========================================== Starting with version 0.9.9-rc2, SphinxSE also includes a UDF function that lets you create snippets through MySQL. The functionality is fully similar to BuildExcerprts API call but accesible through MySQL+SphinxSE. The binary that provides the UDF is named sphinx.so and should be automatically built and installed to proper location along with SphinxSE itself. If it does not get installed automatically for some reason, look for sphinx.so in the build directory and copy it to the plugins directory of your MySQL instance. After that, register the UDF using the following statement: | CREATE FUNCTION sphinx_snippets RETURNS STRING SONAME 'sphinx.so'; Function name must be sphinx_snippets, you can not use an arbitrary name. Function arguments are as follows: Prototype: function sphinx_snippets ( document, index, words, [options] ); Document and words arguments can be either strings or table columns. Options must be specified like this: 'value' AS option_name. For a list of supported options, refer to BuildExcerprts() API call. The only UDF-specific additional option is named 'sphinx' and lets you specify searchd location (host and port). Usage examples: | SELECT sphinx_snippets('hello world doc', 'main', 'world', | 'sphinx://192.168.1.1/' AS sphinx, true AS exact_phrase, | '[b]' AS before_match, '[/b]' AS after_match) | FROM documents; | | SELECT title, sphinx_snippets(text, 'index', 'mysql php') AS text | FROM sphinx, documents | WHERE query='mysql php' AND sphinx.id=documents.id; Chapter 10. Reporting bugs ========================== Unfortunately, Sphinx is not yet 100% bug free (even though I'm working hard towards that), so you might occasionally run into some issues. Reporting as much as possible about each bug is very important - because to fix it, I need to be able either to reproduce and debug the bug, or to deduce what's causing it from the information that you provide. So here are some instructions on how to do that. Build-time issues ================= If Sphinx fails to build for some reason, please do the following: 1. check that headers and libraries for your DBMS are properly installed (for instance, check that mysql-devel package is present); 2. report Sphinx version and config file (be sure to remove the passwords!), MySQL (or PostgreSQL) configuration info, gcc version, OS version and CPU type (ie. x86, x86-64, PowerPC, etc): | mysql_config | gcc --version | uname -a 3. report the error message which is produced by configure or gcc (it should be to include error message itself only, not the whole build log). Run-time issues =============== If Sphinx builds and runs, but there are any problems running it, please do the following: 1. describe the bug (ie. both the expected behavior and actual behavior) and all the steps necessary to reproduce it; 2. include Sphinx version and config file (be sure to remove the passwords!), MySQL (or PostgreSQL) version, gcc version, OS version and CPU type (ie. x86, x86-64, PowerPC, etc): | mysql --version | gcc --version | uname -a 3. build, install and run debug versions of all Sphinx programs (this is to enable a lot of additional internal checks, so-called assertions): | make distclean | ./configure --with-debug | make install | killall -TERM searchd 4. reindex to check if any assertions are triggered (in this case, it's likely that the index is corrupted and causing problems); 5. if the bug does not reproduce with debug versions, revert to non-debug and mention it in your report; 6. if the bug could be easily reproduced with a small (1-100 record) part of your database, please provide a gzipped dump of that part; 7. if the problem is related to searchd, include relevant entries from searchd.log and query.log in your bug report; 8. if the problem is related to searchd, try running it in console mode and check if it dies with an assertion: | ./searchd --console 9. if any program dies with an assertion, provide the assertion message. Debugging assertions, crashes and hangups ========================================= If any program dies with an assertion, crashes without an assertion or hangs up, you would additionally need to generate a core dump and examine it. 1. enable core dumps. On most Linux systems, this is done using ulimit: | ulimit -c 32768 2. run the program and try to reproduce the bug; 3. if the program crashes (either with or without an assertion), find the core file in current directory (it should typically print out "Segmentation fault (core dumped)" message); 4. if the program hangs, use kill -SEGV from another console to force it to exit and dump core: | kill -SEGV HANGED-PROCESS-ID 5. use gdb to examine the core file and obtain a backtrace: | gdb ./CRASHED-PROGRAM-FILE-NAME CORE-DUMP-FILE-NAME | (gdb) bt | (gdb) quit Note that HANGED-PROCESS-ID, CRASHED-PROGRAM-FILE-NAME and CORE-DUMP-FILE-NAME must all be replaced with specific numbers and file names. For example, hanged searchd debugging session would look like: | # kill -SEGV 12345 | # ls *core* | core.12345 | # gdb ./searchd core.12345 | (gdb) bt | ... | (gdb) quit Note that ulimit is not server-wide and only affects current shell session. This means that you will not have to restore any server-wide limits - but if you relogin, you will have to set ulimit again. Core dumps should be placed in current working directory (and Sphinx programs do not change it), so this is where you would look for them. Please do not immediately remove the core file because there could be additional helpful information which could be retrieved from it. You do not need to send me this file (as the debug info there is closely tied to your system) but I might need to ask you a few additional questions about it. Chapter 11. sphinx.conf options reference ========================================= Table of Contents 11.1. Data source configuration options 11.1.1. type 11.1.2. sql_host 11.1.3. sql_port 11.1.4. sql_user 11.1.5. sql_pass 11.1.6. sql_db 11.1.7. sql_sock 11.1.8. mysql_connect_flags 11.1.9. mysql_ssl_cert, mysql_ssl_key, mysql_ssl_ca 11.1.10. odbc_dsn 11.1.11. sql_query_pre 11.1.12. sql_query 11.1.13. sql_joined_field 11.1.14. sql_query_range 11.1.15. sql_range_step 11.1.16. sql_query_killlist 11.1.17. sql_attr_uint 11.1.18. sql_attr_bool 11.1.19. sql_attr_bigint 11.1.20. sql_attr_timestamp 11.1.21. sql_attr_str2ordinal 11.1.22. sql_attr_float 11.1.23. sql_attr_multi 11.1.24. sql_attr_string 11.1.25. sql_attr_str2wordcount 11.1.26. sql_column_buffers 11.1.27. sql_field_string 11.1.28. sql_field_str2wordcount 11.1.29. sql_file_field 11.1.30. sql_query_post 11.1.31. sql_query_post_index 11.1.32. sql_ranged_throttle 11.1.33. sql_query_info 11.1.34. xmlpipe_command 11.1.35. xmlpipe_field 11.1.36. xmlpipe_field_string 11.1.37. xmlpipe_field_wordcount 11.1.38. xmlpipe_attr_uint 11.1.39. xmlpipe_attr_bool 11.1.40. xmlpipe_attr_timestamp 11.1.41. xmlpipe_attr_str2ordinal 11.1.42. xmlpipe_attr_float 11.1.43. xmlpipe_attr_multi 11.1.44. xmlpipe_attr_string 11.1.45. xmlpipe_fixup_utf8 11.1.46. mssql_winauth 11.1.47. mssql_unicode 11.1.48. unpack_zlib 11.1.49. unpack_mysqlcompress 11.1.50. unpack_mysqlcompress_maxsize 11.2. Index configuration options 11.2.1. type 11.2.2. source 11.2.3. path 11.2.4. docinfo 11.2.5. mlock 11.2.6. morphology 11.2.7. dict 11.2.8. index_sp 11.2.9. index_zones 11.2.10. min_stemming_len 11.2.11. stopwords 11.2.12. wordforms 11.2.13. exceptions 11.2.14. min_word_len 11.2.15. charset_type 11.2.16. charset_table 11.2.17. ignore_chars 11.2.18. min_prefix_len 11.2.19. min_infix_len 11.2.20. prefix_fields 11.2.21. infix_fields 11.2.22. enable_star 11.2.23. ngram_len 11.2.24. ngram_chars 11.2.25. phrase_boundary 11.2.26. phrase_boundary_step 11.2.27. html_strip 11.2.28. html_index_attrs 11.2.29. html_remove_elements 11.2.30. local 11.2.31. agent 11.2.32. agent_blackhole 11.2.33. agent_connect_timeout 11.2.34. agent_query_timeout 11.2.35. preopen 11.2.36. ondisk_dict 11.2.37. inplace_enable 11.2.38. inplace_hit_gap 11.2.39. inplace_docinfo_gap 11.2.40. inplace_reloc_factor 11.2.41. inplace_write_factor 11.2.42. index_exact_words 11.2.43. overshort_step 11.2.44. stopword_step 11.2.45. hitless_words 11.2.46. expand_keywords 11.2.47. blend_chars 11.2.48. blend_mode 11.2.49. rt_mem_limit 11.2.50. rt_field 11.2.51. rt_attr_uint 11.2.52. rt_attr_bigint 11.2.53. rt_attr_float 11.2.54. rt_attr_timestamp 11.2.55. rt_attr_string 11.3. indexer program configuration options 11.3.1. mem_limit 11.3.2. max_iops 11.3.3. max_iosize 11.3.4. max_xmlpipe2_field 11.3.5. write_buffer 11.3.6. max_file_field_buffer 11.4. searchd program configuration options 11.4.1. listen 11.4.2. address 11.4.3. port 11.4.4. log 11.4.5. query_log 11.4.6. query_log_format 11.4.7. read_timeout 11.4.8. client_timeout 11.4.9. max_children 11.4.10. pid_file 11.4.11. max_matches 11.4.12. seamless_rotate 11.4.13. preopen_indexes 11.4.14. unlink_old 11.4.15. attr_flush_period 11.4.16. ondisk_dict_default 11.4.17. max_packet_size 11.4.18. mva_updates_pool 11.4.19. crash_log_path 11.4.20. max_filters 11.4.21. max_filter_values 11.4.22. listen_backlog 11.4.23. read_buffer 11.4.24. read_unhinted 11.4.25. max_batch_queries 11.4.26. subtree_docs_cache 11.4.27. subtree_hits_cache 11.4.28. workers 11.4.29. dist_threads 11.4.30. binlog_path 11.4.31. binlog_flush 11.4.32. binlog_max_log_size 11.4.33. collation_server 11.4.34. collation_libc_locale 11.4.35. plugin_dir 11.4.36. mysql_version_string 11.4.37. rt_flush_period 11.4.38. thread_stack 11.4.39. expansion_limit 11.4.40. compat_sphinxql_magics 11.4.41. watchdog 11.1. Data source configuration options ======================================= 11.1.1. type ------------ Data source type. Mandatory, no default value. Known types are mysql, pgsql, mssql, xmlpipe and xmlpipe2, and odbc. All other per-source options depend on source type selected by this option. Names of the options used for SQL sources (ie. MySQL, PostgreSQL, MS SQL) start with "sql_"; names of the ones used for xmlpipe and xmlpipe2 start with "xmlpipe_". All source types except xmlpipe are conditional; they might or might not be supported depending on your build settings, installed client libraries, etc. mssql type is currently only available on Windows. odbc type is available both on Windows natively and on Linux through UnixODBC library. Example: | type = mysql 11.1.2. sql_host ---------------- SQL server host to connect to. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only. In the simplest case when Sphinx resides on the same host with your MySQL or PostgreSQL installation, you would simply specify "localhost". Note that MySQL client library chooses whether to connect over TCP/IP or over UNIX socket based on the host name. Specifically "localhost" will force it to use UNIX socket (this is the default and generally recommended mode) and "127.0.0.1" will force TCP/IP usage. Refer to MySQL manual for more details. Example: | sql_host = localhost 11.1.3. sql_port ---------------- SQL server IP port to connect to. Optional, default is 3306 for mysql source type and 5432 for pgsql type. Applies to SQL source types (mysql, pgsql, mssql) only. Note that it depends on sql_host setting whether this value will actually be used. Example: | sql_port = 3306 11.1.4. sql_user ---------------- SQL user to use when connecting to sql_host. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only. Example: | sql_user = test 11.1.5. sql_pass ---------------- SQL user password to use when connecting to sql_host. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only. Example: | sql_pass = mysecretpassword 11.1.6. sql_db -------------- SQL database (in MySQL terms) to use after the connection and perform further queries within. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only. Example: | sql_db = test 11.1.7. sql_sock ---------------- UNIX socket name to connect to for local SQL servers. Optional, default value is empty (use client library default settings). Applies to SQL source types (mysql, pgsql, mssql) only. On Linux, it would typically be /var/lib/mysql/mysql.sock. On FreeBSD, it would typically be /tmp/mysql.sock. Note that it depends on sql_host setting whether this value will actually be used. Example: | sql_sock = /tmp/mysql.sock 11.1.8. mysql_connect_flags --------------------------- MySQL client connection flags. Optional, default value is 0 (do not set any flags). Applies to mysql source type only. This option must contain an integer value with the sum of the flags. The value will be passed to mysql_real_connect() verbatim. The flags are enumerated in mysql_com.h include file. Flags that are especially interesting in regard to indexing, with their respective values, are as follows: * CLIENT_COMPRESS = 32; can use compression protocol * CLIENT_SSL = 2048; switch to SSL after handshake * CLIENT_SECURE_CONNECTION = 32768; new 4.1 authentication For instance, you can specify 2080 (2048+32) to use both compression and SSL, or 32768 to use new authentication only. Initially, this option was introduced to be able to use compression when the indexer and mysqld are on different hosts. Compression on 1 Gbps links is most likely to hurt indexing time though it reduces network traffic, both in theory and in practice. However, enabling compression on 100 Mbps links may improve indexing time significantly (upto 20-30% of the total indexing time improvement was reported). Your mileage may vary. Example: | mysql_connect_flags = 32 # enable compression 11.1.9. mysql_ssl_cert, mysql_ssl_key, mysql_ssl_ca --------------------------------------------------- SSL certificate settings to use for connecting to MySQL server. Optional, default values are empty strings (do not use SSL). Applies to mysql source type only. These directives let you set up secure SSL connection between indexer and MySQL. The details on creating the certificates and setting up MySQL server can be found in MySQL documentation. Example: | mysql_ssl_cert = /etc/ssl/client-cert.pem | mysql_ssl_key = /etc/ssl/client-key.pem | mysql_ssl_ca = /etc/ssl/cacert.pem 11.1.10. odbc_dsn ----------------- ODBC DSN to connect to. Mandatory, no default value. Applies to odbc source type only. ODBC DSN (Data Source Name) specifies the credentials (host, user, password, etc) to use when connecting to ODBC data source. The format depends on specific ODBC driver used. Example: | odbc_dsn = Driver={Oracle ODBC Driver};Dbq=myDBName;Uid=myUsername;Pwd=myPassword 11.1.11. sql_query_pre ---------------------- Pre-fetch query, or pre-query. Multi-value, optional, default is empty list of queries. Applies to SQL source types (mysql, pgsql, mssql) only. Multi-value means that you can specify several pre-queries. They are executed before the main fetch query, and they will be exectued exactly in order of appeareance in the configuration file. Pre-query results are ignored. Pre-queries are useful in a lot of ways. They are used to setup encoding, mark records that are going to be indexed, update internal counters, set various per-connection SQL server options and variables, and so on. Perhaps the most frequent pre-query usage is to specify the encoding that the server will use for the rows it returnes. It must match the encoding that Sphinx expects (as specified by charset_type and charset_table options). Two MySQL specific examples of setting the encoding are: | sql_query_pre = SET CHARACTER_SET_RESULTS=cp1251 | sql_query_pre = SET NAMES utf8 Also specific to MySQL sources, it is useful to disable query cache (for indexer connection only) in pre-query, because indexing queries are not going to be re-run frequently anyway, and there's no sense in caching their results. That could be achieved with: | sql_query_pre = SET SESSION query_cache_type=OFF Example: | sql_query_pre = SET NAMES utf8 | sql_query_pre = SET SESSION query_cache_type=OFF 11.1.12. sql_query ------------------ Main document fetch query. Mandatory, no default value. Applies to SQL source types (mysql, pgsql, mssql) only. There can be only one main query. This is the query which is used to retrieve documents from SQL server. You can specify up to 32 full-text fields (formally, upto SPH_MAX_FIELDS from sphinx.h), and an arbitrary amount of attributes. All of the columns that are neither document ID (the first one) nor attributes will be full-text indexed. Document ID MUST be the very first field, and it MUST BE UNIQUE UNSIGNED POSITIVE (NON-ZERO, NON-NEGATIVE) INTEGER NUMBER. It can be either 32-bit or 64-bit, depending on how you built Sphinx; by default it builds with 32-bit IDs support but --enable-id64 option to configure allows to build with 64-bit document and word IDs support. Example: | sql_query = \ | SELECT id, group_id, UNIX_TIMESTAMP(date_added) AS date_added, \ | title, content \ | FROM documents 11.1.13. sql_joined_field ------------------------- Joined/payload field fetch query. Multi-value, optional, default is empty list of queries. Applies to SQL source types (mysql, pgsql, mssql) only. sql_joined_field lets you use two different features: joined fields, and payloads (payload fields). It's syntax is as follows: | sql_joined_field = FIELD-NAME 'from' ( 'query' | 'payload-query' ); \ | QUERY [ ; RANGE-QUERY ] where * FIELD-NAME is a joined/payload field name; * QUERY is an SQL query that must fetch values to index. * RANGE-QUERY is an optional SQL query that fetches a range of values to index. (Added in version 2.0.1-beta.) Joined fields let you avoid JOIN and/or GROUP_CONCAT statements in the main document fetch query (sql_query). This can be useful when SQL-side JOIN is slow, or needs to be offloaded on Sphinx side, or simply to emulate MySQL-specific GROUP_CONCAT funcionality in case your database server does not support it. The query must return exactly 2 columns: document ID, and text to append to a joined field. Document IDs can be duplicate, but they must be in ascending order. All the text rows fetched for a given ID will be concatented together, and the concatenation result will be indexed as the entire contents of a joined field. Rows will be concatenated in the order returned from the query, and separating whitespace will be inserted between them. For instance, if joined field query returns the following rows: | ( 1, 'red' ) | ( 1, 'right' ) | ( 1, 'hand' ) | ( 2, 'mysql' ) | ( 2, 'sphinx' ) then the indexing results would be equivalent to that of adding a new text field with a value of 'red right hand' to document 1 and 'mysql sphinx' to document 2. Joined fields are only indexed differently. There are no other differences between joined fields and regular text fields. Starting with 2.0.1-beta, ranged queries can be used when a single query is not efficient enough or does not work because of the database driver limitations. It works similar to the ranged queries in the main indexing loop, see Section 3.7, <>. The range will be queried for and fetched upfront once, then multiple queries with different $start and $end substitutions will be run to fetch the actual data. Payloads let you create a special field in which, instead of keyword positions, so-called user payloads are stored. Payloads are custom integer values attached to every keyword. They can then be used in search time to affect the ranking. The payload query must return exactly 3 columns: document ID; keyword; and integer payload value. Document IDs can be duplicate, but they must be in ascending order. Payloads must be unsigned integers within 24-bit range, ie. from 0 to 16777215. For reference, payloads are currently internally stored as in-field keyword positions, but that is not guaranteed and might change in the future. Currently, the only method to account for payloads is to use SPH_RANK_PROXIMITY_BM25 ranker. On indexes with payload fields, it will automatically switch to a variant that matches keywords in those fields, computes a sum of matched payloads multiplied by field wieghts, and adds that sum to the final rank. Example: | sql_joined_field = \ | tagstext from query; \ | SELECT docid, CONCAT('tag',tagid) FROM tags ORDER BY docid ASC 11.1.14. sql_query_range ------------------------ Range query setup. Optional, default is empty. Applies to SQL source types (mysql, pgsql, mssql) only. Setting this option enables ranged document fetch queries (see Section 3.7, <>). Ranged queries are useful to avoid notorious MyISAM table locks when indexing lots of data. (They also help with other less notorious issues, such as reduced performance caused by big result sets, or additional resources consumed by InnoDB to serialize big read transactions.) The query specified in this option must fetch min and max document IDs that will be used as range boundaries. It must return exactly two integer fields, min ID first and max ID second; the field names are ignored. When ranged queries are enabled, sql_query will be required to contain $start and $end macros (because it obviously would be a mistake to index the whole table many times over). Note that the intervals specified by $start..$end will not overlap, so you should not remove document IDs that are exactly equal to $start or $end from your query. The example in Section 3.7, <>) illustrates that; note how it uses greater-or-equal and less-or-equal comparisons. Example: | sql_query_range = SELECT MIN(id),MAX(id) FROM documents 11.1.15. sql_range_step ----------------------- Range query step. Optional, default is 1024. Applies to SQL source types (mysql, pgsql, mssql) only. Only used when ranged queries are enabled. The full document IDs interval fetched by sql_query_range will be walked in this big steps. For example, if min and max IDs fetched are 12 and 3456 respectively, and the step is 1000, indexer will call sql_query several times with the following substitutions: * $start=12, $end=1011 * $start=1012, $end=2011 * $start=2012, $end=3011 * $start=3012, $end=3456 Example: | sql_range_step = 1000 11.1.16. sql_query_killlist --------------------------- Kill-list query. Optional, default is empty (no query). Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 0.9.9-rc1. This query is expected to return a number of 1-column rows, each containing just the document ID. The returned document IDs are stored within an index. Kill-list for a given index suppresses results from other indexes, depending on index order in the query. The intended use is to help implement deletions and updates on existing indexes without rebuilding (actually even touching them), and especially to fight phantom results problem. Let us dissect an example. Assume we have two indexes, 'main' and 'delta'. Assume that documents 2, 3, and 5 were deleted since last reindex of 'main', and documents 7 and 11 were updated (ie. their text contents were changed). Assume that a keyword 'test' occurred in all these mentioned documents when we were indexing 'main'; still occurs in document 7 as we index 'delta'; but does not occur in document 11 any more. We now reindex delta and then search through both these indexes in proper (least to most recent) order: | $res = $cl->Query ( "test", "main delta" ); First, we need to properly handle deletions. The result set should not contain documents 2, 3, or 5. Second, we also need to avoid phantom results. Unless we do something about it, document 11 will appear in search results! It will be found in 'main' (but not 'delta'). And it will make it to the final result set unless something stops it. Kill-list, or K-list for short, is that something. Kill-list attached to 'delta' will suppress the specified rows from all the preceding indexes, in this case just 'main'. So to get the expected results, we should put all the updated and deleted document IDs into it. Example: | sql_query_killlist = \ | SELECT id FROM documents WHERE updated_ts>=@last_reindex UNION \ | SELECT id FROM documents_deleted WHERE deleted_ts>=@last_reindex 11.1.17. sql_attr_uint ---------------------- Unsigned integer attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. The column value should fit into 32-bit unsigned integer range. Values outside this range will be accepted but wrapped around. For instance, -1 will be wrapped around to 2^32-1 or 4,294,967,295. You can specify bit count for integer attributes by appending ':BITCOUNT' to attribute name (see example below). Attributes with less than default 32-bit size, or bitfields, perform slower. But they require less RAM when using extern storage: such bitfields are packed together in 32-bit chunks in .spa attribute data file. Bit size settings are ignored if using inline storage. Example: | sql_attr_uint = group_id | sql_attr_uint = forum_id:9 # 9 bits for forum_id 11.1.18. sql_attr_bool ---------------------- Boolean attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Equivalent to sql_attr_uint declaration with a bit count of 1. Example: | sql_attr_bool = is_deleted # will be packed to 1 bit 11.1.19. sql_attr_bigint ------------------------ 64-bit signed integer attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Note that unlike sql_attr_uint, these values are signed. Introduced in version 0.9.9-rc1. Example: | sql_attr_bigint = my_bigint_id 11.1.20. sql_attr_timestamp --------------------------- UNIX timestamp attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Timestamps can store date and time in the range of Jan 01, 1970 to Jan 19, 2038 with a precision of one second. The expected column value should be a timestamp in UNIX format, ie. 32-bit unsigned integer number of seconds elapsed since midnight, January 01, 1970, GMT. Timestamps are internally stored and handled as integers everywhere. But in addition to working with timestamps as integers, it's also legal to use them along with different date-based functions, such as time segments sorting mode, or day/week/month/year extraction for GROUP BY. Note that DATE or DATETIME column types in MySQL can not be directly used as timestamp attributes in Sphinx; you need to explicitly convert such columns using UNIX_TIMESTAMP function (if data is in range). Note timestamps can not represent dates before January 01, 1970, and UNIX_TIMESTAMP() in MySQL will not return anything expected. If you only needs to work with dates, not times, consider TO_DAYS() function in MySQL instead. Example: | sql_attr_timestamp = UNIX_TIMESTAMP(added_datetime) AS added_ts 11.1.21. sql_attr_str2ordinal ----------------------------- Ordinal string number attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. This attribute type (so-called ordinal, for brevity) is intended to allow sorting by string values, but without storing the strings themselves. When indexing ordinals, string values are fetched from database, temporarily stored, sorted, and then replaced by their respective ordinal numbers in the array of sorted strings. So, the ordinal number is an integer such that sorting by it produces the same result as if lexicographically sorting by original strings. by string values lexicographically. Earlier versions could consume a lot of RAM for indexing ordinals. Starting with revision r1112, ordinals accumulation and sorting also runs in fixed memory (at the cost of using additional temporary disk space), and honors mem_limit settings. Ideally the strings should be sorted differently, depending on the encoding and locale. For instance, if the strings are known to be Russian text in KOI8R encoding, sorting the bytes 0xE0, 0xE1, and 0xE2 should produce 0xE1, 0xE2 and 0xE0, because in KOI8R value 0xE0 encodes a character that is (noticeably) after characters encoded by 0xE1 and 0xE2. Unfortunately, Sphinx does not support that at the moment and will simply sort the strings bytewise. Note that the ordinals are by construction local to each index, and it's therefore impossible to merge ordinals while retaining the proper order. The processed strings are replaced by their sequential number in the index they occurred in, but different indexes have different sets of strings. For instance, if 'main' index contains strings "aaa", "bbb", "ccc", and so on up to "zzz", they'll be assigned numbers 1, 2, 3, and so on up to 26, respectively. But then if 'delta' only contains "zzz" the assigned number will be 1. And after the merge, the order will be broken. Unfortunately, this is impossible to workaround without storing the original strings (and once Sphinx supports storing the original strings, ordinals will not be necessary any more). Example: | sql_attr_str2ordinal = author_name 11.1.22. sql_attr_float ----------------------- Floating point attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. The values will be stored in single precision, 32-bit IEEE 754 format. Represented range is approximately from 1e-38 to 1e+38. The amount of decimal digits that can be stored precisely is approximately 7. One important usage of the float attributes is storing latitude and longitude values (in radians), for further usage in query-time geosphere distance calculations. Example: | sql_attr_float = lat_radians | sql_attr_float = long_radians 11.1.23. sql_attr_multi ----------------------- Multi-valued attribute (MVA) declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Plain attributes only allow to attach 1 value per each document. However, there are cases (such as tags or categories) when it is desired to attach multiple values of the same attribute and be able to apply filtering or grouping to value lists. The declaration format is as follows (backslashes are for clarity only; everything can be declared in a single line as well): | sql_attr_multi = ATTR-TYPE ATTR-NAME 'from' SOURCE-TYPE \ | [;QUERY] \ | [;RANGE-QUERY] where * ATTR-TYPE is 'uint' or 'timestamp' * SOURCE-TYPE is 'field', 'query', or 'ranged-query' * QUERY is SQL query used to fetch all ( docid, attrvalue ) pairs * RANGE-QUERY is SQL query used to fetch min and max ID values, similar to 'sql_query_range' Example: | sql_attr_multi = uint tag from query; SELECT id, tag FROM tags | sql_attr_multi = uint tag from ranged-query; \ | SELECT id, tag FROM tags WHERE id>=$start AND id<=$end; \ | SELECT MIN(id), MAX(id) FROM tags 11.1.24. sql_attr_string ------------------------ String attribute declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta. String attributes can store arbitrary strings attached to every document. There's a fixed size limit of 4 MB per value. Also, searchd will currently cache all the values in RAM, which is an additional implicit limit. As of 1.10-beta, strings can only be used for storage and retrieval. They can not participate in expressions, be used for filtering, sorting, or grouping (ie. in WHERE, ORDER or GROUP clauses). Note that attributes declared using sql_attr_string will not be full-text indexed; you can use sql_field_string directive for that. Example: | sql_attr_string = title # will be stored but will not be indexed 11.1.25. sql_attr_str2wordcount ------------------------------- Word-count attribute declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta. Word-count attribute takes a string column, tokenizes it according to index settings, and stores the resulting number of tokens in an attribute. This number of tokens ("word count") is a normal integer that can be later used, for instance, in custom ranking expressions (boost shorter titles, help identify exact field matches, etc). Example: | sql_attr_str2wordcount = title_wc 11.1.26. sql_column_buffers --------------------------- Per-column buffer sizes. Optional, default is empty (deduce the sizes automatically). Applies to odbc, mssql source types only. Introduced in version 2.0.1-beta. ODBC and MS SQL drivers sometimes can not return the maximum actual column size to be expected. For instance, NVARCHAR(MAX) columns always report their length as 2147483647 bytes to indexer even though the actually used length is likely considerably less. However, the receiving buffers still need to be allocated upfront, and their sizes have to be determined. When the driver does not report the column length at all, Sphinx allocates default 1 KB buffers for each non-char column, and 1 MB buffers for each char column. Driver-reported column length also gets clamped by an upper limie of 8 MB, so in case the driver reports (almost) a 2 GB column length, it will be clamped and a 8 MB buffer will be allocated instead for that column. These hard-coded limits can be overridden using the sql_column_buffers directive, either in order to save memory on actually shorter columns, or overcome the 8 MB limit on actually longer columns. The directive values must be a comma-separated lists of selected column names and sizes: | sql_column_buffers = =[K|M] [, ...] Example: | sql_query = SELECT id, mytitle, mycontent FROM documents | sql_column_buffers = mytitle=64K, mycontent=10M 11.1.27. sql_field_string ------------------------- Combined string attribute and full-text field declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta. sql_attr_string only stores the column value but does not full-text index it. In some cases it might be desired to both full-text index the column and store it as attribute. sql_field_string lets you do exactly that. Both the field and the attribute will be named the same. Example: | sql_field_string = title # will be both indexed and stored 11.1.28. sql_field_str2wordcount -------------------------------- Combined word-count attribute and full-text field declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta. sql_attr_str2wordcount only stores the column word count but does not full-text index it. In some cases it might be desired to both full-text index the column and also have the count. sql_field_str2wordcount lets you do exactly that. Both the field and the attribute will be named the same. Example: | sql_field_str2wordcount = title # will be indexed, and counted/stored 11.1.29. sql_file_field ----------------------- File based field declaration. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 1.10-beta. This directive makes indexer interpret field contents as a file name, and load and index the referred file. Files larger than max_file_field_buffer in size are skipped. Any errors during the file loading (IO errors, missed limits, etc) will be reported as indexing warnings and will not early terminate the indexing. No content will be indexed for such files. Example: | sql_file_field = my_file_path # load and index files referred to by my_file_path 11.1.30. sql_query_post ----------------------- Post-fetch query. Optional, default value is empty. Applies to SQL source types (mysql, pgsql, mssql) only. This query is executed immediately after sql_query completes successfully. When post-fetch query produces errors, they are reported as warnings, but indexing is not terminated. It's result set is ignored. Note that indexing is not yet completed at the point when this query gets executed, and further indexing still may fail. Therefore, any permanent updates should not be done from here. For instance, updates on helper table that permanently change the last successfully indexed ID should not be run from post-fetch query; they should be run from post-index query instead. Example: | sql_query_post = DROP TABLE my_tmp_table 11.1.31. sql_query_post_index ----------------------------- Post-index query. Optional, default value is empty. Applies to SQL source types (mysql, pgsql, mssql) only. This query is executed when indexing is fully and succesfully completed. If this query produces errors, they are reported as warnings, but indexing is not terminated. It's result set is ignored. $maxid macro can be used in its text; it will be expanded to maximum document ID which was actually fetched from the database during indexing. If no documents were indexed, $maxid will be expanded to 0. Example: | sql_query_post_index = REPLACE INTO counters ( id, val ) \ | VALUES ( 'max_indexed_id', $maxid ) 11.1.32. sql_ranged_throttle ---------------------------- Ranged query throttling period, in milliseconds. Optional, default is 0 (no throttling). Applies to SQL source types (mysql, pgsql, mssql) only. Throttling can be useful when indexer imposes too much load on the database server. It causes the indexer to sleep for given amount of milliseconds once per each ranged query step. This sleep is unconditional, and is performed before the fetch query. Example: | sql_ranged_throttle = 1000 # sleep for 1 sec before each query step 11.1.33. sql_query_info ----------------------- Document info query. Optional, default is empty. Applies to mysql source type only. Only used by CLI search to fetch and display document information, only works with MySQL at the moment, and only intended for debugging purposes. This query fetches the row that will be displayed by CLI search utility for each document ID. It is required to contain $id macro that expands to the queried document ID. Example: | sql_query_info = SELECT * FROM documents WHERE id=$id 11.1.34. xmlpipe_command ------------------------ Shell command that invokes xmlpipe stream producer. Mandatory. Applies to xmlpipe and xmlpipe2 source types only. Specifies a command that will be executed and which output will be parsed for documents. Refer to Section 3.8, <> or Section 3.9, <> for specific format description. Example: | xmlpipe_command = cat /home/sphinx/test.xml 11.1.35. xmlpipe_field ---------------------- xmlpipe field declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Refer to Section 3.9, <>. Example: | xmlpipe_field = subject | xmlpipe_field = content 11.1.36. xmlpipe_field_string ----------------------------- xmlpipe field and string attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Refer to Section 3.9, <>. Introduced in version 1.10-beta. Makes the specified XML element indexed as both a full-text field and a string attribute. Equivalent to declaration within the XML file. Example: | xmlpipe_field_string = subject 11.1.37. xmlpipe_field_wordcount -------------------------------- xmlpipe field and word count attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Refer to Section 3.9, <>. Introduced in version 1.10-beta. Makes the specified XML element indexed as both a full-text field and a word count attribute. Equivalent to declaration within the XML file. Example: | xmlpipe_field_wordcount = subject 11.1.38. xmlpipe_attr_uint -------------------------- xmlpipe integer attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_uint. Example: | xmlpipe_attr_uint = author 11.1.39. xmlpipe_attr_bool -------------------------- xmlpipe boolean attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_bool. Example: | xmlpipe_attr_bool = is_deleted # will be packed to 1 bit 11.1.40. xmlpipe_attr_timestamp ------------------------------- xmlpipe UNIX timestamp attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_timestamp. Example: | xmlpipe_attr_timestamp = published 11.1.41. xmlpipe_attr_str2ordinal --------------------------------- xmlpipe string ordinal attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_str2ordinal. Example: | xmlpipe_attr_str2ordinal = author_sort 11.1.42. xmlpipe_attr_float --------------------------- xmlpipe floating point attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Syntax fully matches that of sql_attr_float. Example: | xmlpipe_attr_float = lat_radians | xmlpipe_attr_float = long_radians 11.1.43. xmlpipe_attr_multi --------------------------- xmlpipe MVA attribute declaration. Multi-value, optional. Applies to xmlpipe2 source type only. This setting declares an MVA attribute tag in xmlpipe2 stream. The contents of the specified tag will be parsed and a list of integers that will constitute the MVA will be extracted, similar to how sql_attr_multi parses SQL column contents when 'field' MVA source type is specified. Example: | xmlpipe_attr_multi = taglist 11.1.44. xmlpipe_attr_string ---------------------------- xmlpipe string declaration. Multi-value, optional. Applies to xmlpipe2 source type only. Introduced in version 1.10-beta. This setting declares a string attribute tag in xmlpipe2 stream. The contents of the specified tag will be parsed and stored as a string value. Example: | xmlpipe_attr_string = subject 11.1.45. xmlpipe_fixup_utf8 --------------------------- Perform Sphinx-side UTF-8 validation and filtering to prevent XML parser from choking on non-UTF-8 documents. Optional, default is 0. Applies to xmlpipe2 source type only. Under certain occasions it might be hard or even impossible to guarantee that the incoming XMLpipe2 document bodies are in perfectly valid and conforming UTF-8 encoding. For instance, documents with national single-byte encodings could sneak into the stream. libexpat XML parser is fragile, meaning that it will stop processing in such cases. UTF8 fixup feature lets you avoid that. When fixup is enabled, Sphinx will preprocess the incoming stream before passing it to the XML parser and replace invalid UTF-8 sequences with spaces. Example: | xmlpipe_fixup_utf8 = 1 11.1.46. mssql_winauth ---------------------- MS SQL Windows authentication flag. Boolean, optional, default value is 0 (false). Applies to mssql source type only. Introduced in version 0.9.9-rc1. Whether to use currently logged in Windows account credentials for authentication when connecting to MS SQL Server. Note that when running searchd as a service, account user can differ from the account you used to install the service. Example: | mssql_winauth = 1 11.1.47. mssql_unicode ---------------------- MS SQL encoding type flag. Boolean, optional, default value is 0 (false). Applies to mssql source type only. Introduced in version 0.9.9-rc1. Whether to ask for Unicode or single-byte data when querying MS SQL Server. This flag must be in sync with charset_type directive; that is, to index Unicode data, you must set both charset_type in the index (to 'utf-8') and mssql_unicode in the source (to 1). For reference, MS SQL will actually return data in UCS-2 encoding instead of UTF-8, but Sphinx will automatically handle that. Example: | mssql_unicode = 1 11.1.48. unpack_zlib -------------------- Columns to unpack using zlib (aka deflate, aka gunzip). Multi-value, optional, default value is empty list of columns. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 0.9.9-rc1. Columns specified using this directive will be unpacked by indexer using standard zlib algorithm (called deflate and also implemented by gunzip). When indexing on a different box than the database, this lets you offload the database, and save on network traffic. The feature is only available if zlib and zlib-devel were both available during build time. Example: | unpack_zlib = col1 | unpack_zlib = col2 11.1.49. unpack_mysqlcompress ----------------------------- Columns to unpack using MySQL UNCOMPRESS() algorithm. Multi-value, optional, default value is empty list of columns. Applies to SQL source types (mysql, pgsql, mssql) only. Introduced in version 0.9.9-rc1. Columns specified using this directive will be unpacked by indexer using modified zlib algorithm used by MySQL COMPRESS() and UNCOMPRESS() functions. When indexing on a different box than the database, this lets you offload the database, and save on network traffic. The feature is only available if zlib and zlib-devel were both available during build time. Example: | unpack_mysqlcompress = body_compressed | unpack_mysqlcompress = description_compressed 11.1.50. unpack_mysqlcompress_maxsize ------------------------------------- Buffer size for UNCOMPRESS()ed data. Optional, default value is 16M. Introduced in version 0.9.9-rc1. When using unpack_mysqlcompress, due to implementation intrincacies it is not possible to deduce the required buffer size from the compressed data. So the buffer must be preallocated in advance, and unpacked data can not go over the buffer size. This option lets you control the buffer size, both to limit indexer memory use, and to enable unpacking of really long data fields if necessary. Example: | unpack_mysqlcompress_maxsize = 1M 11.2. Index configuration options ================================= 11.2.1. type ------------ Index type. Known values are 'plain', 'distributed', and 'rt'. Optional, default is 'plain' (plain local index). Sphinx supports several different types of indexes. Versions 0.9.x supported two index types: plain local indexes that are stored and processed on the local machine; and distributed indexes, that involve not only local searching but querying remote searchd instances over the network as well (see Section 5.8, <>). Version 1.10-beta also adds support for so-called real-time indexes (or RT indexes for short) that are also stored and processed locally, but additionally allow for on-the-fly updates of the full-text index (see Chapter 4, Real-time indexes). Note that attributes can be updated on-the-fly using either plain local indexes or RT ones. Index type setting lets you choose the needed type. By default, plain local index type will be assumed. Example: | type = distributed 11.2.2. source -------------- Adds document source to local index. Multi-value, mandatory. Specifies document source to get documents from when the current index is indexed. There must be at least one source. There may be multiple sources, without any restrictions on the source types: ie. you can pull part of the data from MySQL server, part from PostgreSQL, part from the filesystem using xmlpipe2 wrapper. However, there are some restrictions on the source data. First, document IDs must be globally unique across all sources. If that condition is not met, you might get unexpected search results. Second, source schemas must be the same in order to be stored within the same index. No source ID is stored automatically. Therefore, in order to be able to tell what source the matched document came from, you will need to store some additional information yourself. Two typical approaches include: 1. mangling document ID and encoding source ID in it: | source src1 | { | sql_query = SELECT id*10+1, ... FROM table1 | ... | } | | source src2 | { | sql_query = SELECT id*10+2, ... FROM table2 | ... | } 2. storing source ID simply as an attribute: | source src1 | { | sql_query = SELECT id, 1 AS source_id FROM table1 | sql_attr_uint = source_id | ... | } | | source src2 | { | sql_query = SELECT id, 2 AS source_id FROM table2 | sql_attr_uint = source_id | ... | } Example: | source = srcpart1 | source = srcpart2 | source = srcpart3 11.2.3. path ------------ Index files path and file name (without extension). Mandatory. Path specifies both directory and file name, but without extension. indexer will append different extensions to this path when generating final names for both permanent and temporary index files. Permanent data files have several different extensions starting with '.sp'; temporary files' extensions start with '.tmp'. It's safe to remove .tmp* files is if indexer fails to remove them automatically. For reference, different index files store the following data: * .spa stores document attributes (used in extern docinfo storage mode only); * .spd stores matching document ID lists for each word ID; * .sph stores index header information; * .spi stores word lists (word IDs and pointers to .spd file); * .spk stores kill-lists; * .spm stores MVA data; * .spp stores hit (aka posting, aka word occurence) lists for each word ID; * .sps stores string attribute data. Example: | path = /var/data/test1 11.2.4. docinfo --------------- Document attribute values (docinfo) storage mode. Optional, default is 'extern'. Known values are 'none', 'extern' and 'inline'. Docinfo storage mode defines how exactly docinfo will be physically stored on disk and RAM. "none" means that there will be no docinfo at all (ie. no attributes). Normally you need not to set "none" explicitly because Sphinx will automatically select "none" when there are no attributes configured. "inline" means that the docinfo will be stored in the .spd file, along with the document ID lists. "extern" means that the docinfo will be stored separately (externally) from document ID lists, in a special .spa file. Basically, externally stored docinfo must be kept in RAM when querying. for performance reasons. So in some cases "inline" might be the only option. However, such cases are infrequent, and docinfo defaults to "extern". Refer to Section 3.2, <> for in-depth discussion and RAM usage estimates. Example: | docinfo = inline 11.2.5. mlock ------------- Memory locking for cached data. Optional, default is 0 (do not call mlock()). For search performance, searchd preloads a copy of .spa and .spi files in RAM, and keeps that copy in RAM at all times. But if there are no searches on the index for some time, there are no accesses to that cached copy, and OS might decide to swap it out to disk. First queries to such "cooled down" index will cause swap-in and their latency will suffer. Setting mlock option to 1 makes Sphinx lock physical RAM used for that cached data using mlock(2) system call, and that prevents swapping (see man 2 mlock for details). mlock(2) is a privileged call, so it will require searchd to be either run from root account, or be granted enough privileges otherwise. If mlock() fails, a warning is emitted, but index continues working. Example: | mlock = 1 11.2.6. morphology ------------------ A list of morphology preprocessors to apply. Optional, default is empty (do not apply any preprocessor). Morphology preprocessors can be applied to the words being indexed to replace different forms of the same word with the base, normalized form. For instance, English stemmer will normalize both "dogs" and "dog" to "dog", making search results for both searches the same. Built-in preprocessors include English stemmer, Russian stemmer (that supports UTF-8 and Windows-1251 encodings), Soundex, and Metaphone. The latter two replace the words with special phonetic codes that are equal is words are phonetically close. Additional stemmers provided by Snowball project libstemmer library can be enabled at compile time using --with-libstemmer configure option. Built-in English and Russian stemmers should be faster than their libstemmer counterparts, but can produce slightly different results, because they are based on an older version. Metaphone implementation is based on Double Metaphone algorithm and indexes the primary code. Built-in values that are available for use in morphology option are as follows: * none - do not perform any morphology processing; * stem_en - apply Porter's English stemmer; * stem_ru - apply Porter's Russian stemmer; * stem_enru - apply Porter's English and Russian stemmers; * stem_cz - apply Czech stemmer; * soundex - replace keywords with their SOUNDEX code; * metaphone - replace keywords with their METAPHONE code. Additional values provided by libstemmer are in 'libstemmer_XXX' format, where XXX is libstemmer algorithm codename (refer to libstemmer_c/libstemmer/modules.txt for a complete list). Several stemmers can be specified (comma-separated). They will be applied to incoming words in the order they are listed, and the processing will stop once one of the stemmers actually modifies the word. Also when wordforms feature is enabled the word will be looked up in word forms dictionary first, and if there is a matching entry in the dictionary, stemmers will not be applied at all. Or in other words, wordforms can be used to implement stemming exceptions. Example: | morphology = stem_en, libstemmer_sv 11.2.7. dict ------------ The keywords dictionary type. Known values are 'crc' and 'keywords'. Optional, default is 'crc'. Introduced in version 2.0.1-beta. The default dictionary type in Sphinx, and the only one available until version 2.0.1-beta, is a so-called CRC dictionary which never stores the original keyword text in the index. Instead, keywords are replaced with their control sum value (either CRC32 or FNV64, depending whether Sphinx was built with --enable-id64) both when searching and indexing, and that value is used internally in the index. That approach has two drawbacks. First, in CRC32 case there is a chance of control sum collision between several pairs of different keywords, growing quadratically with the number of unique keywords in the index. (FNV64 case is unaffected in practice, as a chance of a single FNV64 collision in a dictionary of 1 billion entries is approximately 1:16, or 6.25 percent. And most dictionaries will be much more compact that a billion keywords, as a typical spoken human language has in the region of 1 to 10 million word forms.) Second, and more importantly, substring searches are not directly possible with control sums. Sphinx alleviated that by pre-indexing all the possible substrings as separate keywords (see Section 11.2.18, <>, Section 11.2.19, <> directives). That actually has an added benefit of matching substrings in the quickest way possible. But at the same time pre-indexing all substrings grows the index size a lot (factors of 3-10x and even more would not be unusual) and impacts the indexing time respectively, rendering substring searches on big indexes rather impractical. Keywords dictionary, introduced in 2.0.1-beta, fixes both these drawbacks. It stores the keywords in the index and performs search-time wildcard expansion. For example, a search for a 'test*' prefix could internally expand to 'test|tests|testing' query based on the dictionary contents. That expansion is fully transparent to the application, except that the separate per-keyword statistics for all the actually matched keywords would now also be reported. Indexing with keywords dictionary should be 1.1x to 1.3x slower compared to regular, non-substring indexing - but times faster compared to substring indexing (either prefix or infix). Index size should only be slightly bigger that than of the regular non-substring index, with a 1..10% percent total difference Regular keyword searching time must be very close or identical across all three discussed index kinds (CRC non-substring, CRC substring, keywords). Substring searching time can vary greatly depending on how many actual keywords match the given substring (in other words, into how many keywords does the search term expand). The maximum number of keywords matched is restricted by the expansion_limit directive. Essentially, keywords and CRC dictionaries represent the two different trade-off substring searching decisions. You can choose to either sacrifice indexing time and index size in favor of top-speed worst-case searches (CRC dictionary), or only slightly impact indexing time but sacrifice worst-case searching time when the prefix expands into very many keywords (keywords dictionary). Example: | dict = keywords 11.2.8. index_sp ---------------- Whether to detect and index sentence and paragraph boundaries. Optional, default is 0 (do not detect and index). Introduced in version 2.0.1-beta. This directive enables sentence and paragraph boundary indexing. It's required for the SENTENCE and PARAGRAPH operators to work. Sentence boundary detection is based on plain text analysis, so you only need to set index_sp = 1 to enable it. Paragraph detection is however based on HTML markup, and happens in the HTML stripper. So to index paragraph locations you also need to enable the stripper by specifying html_strip = 1. Both types of boundaries are detected based on a few built-in rules enumerated just below. Sentence boundary detection rules are as follows. * Question and excalamation signs (? and !) are always a sentence boundary. * Trailing dot (.) is a sentence boundary, except: * When followed by a letter. That's considered a part of an abbreviation (as in "S.T.A.L.K.E.R" or "Goldman Sachs S.p.A."). * When followed by a comma. That's considered an abbreviation followed by a comma (as in "Telecom Italia S.p.A., founded in 1994"). * When followed by a space and a small letter. That's considered an abbreviation within a sentence (as in "News Corp. announced in Februrary"). * When preceded by a space and a capital letter, and followed by a space. That's considered a middle initial (as in "John D. Doe"). Paragraph boundaries are inserted at every block-level HTML tag. Namely, those are (as taken from HTML 4 standard) ADDRESS, BLOCKQUOTE, CAPTION, CENTER, DD, DIV, DL, DT, H1, H2, H3, H4, H5, LI, MENU, OL, P, PRE, TABLE, TBODY, TD, TFOOT, TH, THEAD, TR, and UL. Both sentences and paragraphs increment the keyword position counter by 1. Example: | index_sp = 1 11.2.9. index_zones ------------------- A list of in-field HTML/XML zones to index. Optional, default is empty (do not index zones). Introduced in version 2.0.1-beta. Zones can be formally defined as follows. Everything between an opening and a matching closing tag is called a span, and the aggregate of all spans corresponding sharing the same tag name is called a zone. For instance, everything between the occurrences of

and

in the document field belongs to H1 zone. Zone indexing, enabled by index_zones directive, is an optional extension of the HTML stripper. So it will also require that the stripper is enabled (with html_strip = 1). The value of the index_zones should be a comma-separated list of those tag names and wildcards (ending with a star) that should be indexed as zones. Zones can nest and overlap arbitrarily. The only requirement is that every opening tag has a matching tag. You can also have an arbitrary number of both zones (as in unique zone names, such as H1) and spans (all the occurrences of those H1 tags) in a document. Once indexed, zones can then be used for matching with the ZONE operator, see Section 5.3, <>. Example: | index_zones = h*, th, title 11.2.10. min_stemming_len ------------------------- Minimum word length at which to enable stemming. Optional, default is 1 (stem everything). Introduced in version 0.9.9-rc1. Stemmers are not perfect, and might sometimes produce undesired results. For instance, running "gps" keyword through Porter stemmer for English results in "gp", which is not really the intent. min_stemming_len feature lets you suppress stemming based on the source word length, ie. to avoid stemming too short words. Keywords that are shorter than the given threshold will not be stemmed. Note that keywords that are exactly as long as specified will be stemmed. So in order to avoid stemming 3-character keywords, you should specify 4 for the value. For more finely grained control, refer to wordforms feature. Example: | min_stemming_len = 4 11.2.11. stopwords ------------------ Stopword files list (space separated). Optional, default is empty. Stopwords are the words that will not be indexed. Typically you'd put most frequent words in the stopwords list because they do not add much value to search results but consume a lot of resources to process. You can specify several file names, separated by spaces. All the files will be loaded. Stopwords file format is simple plain text. The encoding must match index encoding specified in charset_type. File data will be tokenized with respect to charset_table settings, so you can use the same separators as in the indexed data. The stemmers will also be applied when parsing stopwords file. While stopwords are not indexed, they still do affect the keyword positions. For instance, assume that "the" is a stopword, that document 1 contains the line "in office", and that document 2 contains "in the office". Searching for "in office" as for exact phrase will only return the first document, as expected, even though "the" in the second one is stopped. Example: | stopwords = /usr/local/sphinx/data/stopwords.txt | stopwords = stopwords-ru.txt stopwords-en.txt 11.2.12. wordforms ------------------ Word forms dictionary. Optional, default is empty. Word forms are applied after tokenizing the incoming text by charset_table rules. They essentialy let you replace one word with another. Normally, that would be used to bring different word forms to a single normal form (eg. to normalize all the variants such as "walks", "walked", "walking" to the normal form "walk"). It can also be used to implement stemming exceptions, because stemming is not applied to words found in the forms list. Dictionaries are used to normalize incoming words both during indexing and searching. Therefore, to pick up changes in wordforms file it's required to reindex and restart searchd. Word forms support in Sphinx is designed to support big dictionaries well. They moderately affect indexing speed: for instance, a dictionary with 1 million entries slows down indexing about 1.5 times. Searching speed is not affected at all. Additional RAM impact is roughly equal to the dictionary file size, and dictionaries are shared across indexes: ie. if the very same 50 MB wordforms file is specified for 10 different indexes, additional searchd RAM usage will be about 50 MB. Dictionary file should be in a simple plain text format. Each line should contain source and destination word forms, in exactly the same encoding as specified in charset_type, separated by "greater" sign. Rules from the charset_table will be applied when the file is loaded. So basically it's as case sensitive as your other full-text indexed data, ie. typically case insensitive. Here's the file contents sample: | walks > walk | walked > walk | walking > walk There is a bundled spelldump utility that helps you create a dictionary file in the format Sphinx can read from source .dict and .aff dictionary files in ispell or MySpell format (as bundled with OpenOffice). Starting with version 0.9.9-rc1, you can map several source words to a single destination word. Because the work happens on tokens, not the source text, differences in whitespace and markup are ignored. | core 2 duo > c2d | e6600 > c2d | core 2duo > c2d Notice however that the destination wordforms are still always interpreted as a single keyword! Having a mapping like "St John > Saint John" will result in not matching "St John" when searching for "Saint" or "John", because the destination keyword will be "Saint John" with a space character in it (and it's barely possible to input a destination keyword with a space). Example: | wordforms = /usr/local/sphinx/data/wordforms.txt 11.2.13. exceptions ------------------- Tokenizing exceptions file. Optional, default is empty. Exceptions allow to map one or more tokens (including tokens with characters that would normally be excluded) to a single keyword. They are similar to wordforms in that they also perform mapping, but have a number of important differences. Short summary of the differences is as follows: * exceptions are case sensitive, wordforms are not; * exceptions allow to detect sequences of tokens, wordforms work with single words only; * exceptions can use special characters that are not in charset_table, wordforms fully obey charset_table; * exceptions can underperform on huge dictionaries, wordforms handle millions of entries well. The expected file format is also plain text, with one line per exception, and the line format is as follows: | map-from-tokens => map-to-token Example file: | AT & T => AT&T | AT&T => AT&T | Standarten Fuehrer => standartenfuhrer | Standarten Fuhrer => standartenfuhrer | MS Windows => ms windows | Microsoft Windows => ms windows | C++ => cplusplus | c++ => cplusplus | C plus plus => cplusplus All tokens here are case sensitive: they will not be processed by charset_table rules. Thus, with the example exceptions file above, "At&t" text will be tokenized as two keywords "at" and "t", because of lowercase letters. On the other hand, "AT&T" will match exactly and produce single "AT&T" keyword. Note that this map-to keyword is a) always interpereted as a single word, and b) is both case and space sensitive! In our sample, "ms windows" query will not match the document with "MS Windows" text. The query will be interpreted as a query for two keywords, "ms" and "windows". And what "MS Windows" gets mapped to is a single keyword "ms windows", with a space in the middle. On the other hand, "standartenfuhrer" will retrieve documents with "Standarten Fuhrer" or "Standarten Fuehrer" contents (capitalized exactly like this), or any capitalization variant of the keyword itself, eg. "staNdarTenfUhreR". (It won't catch "standarten fuhrer", however: this text does not match any of the listed exceptions because of case sensitivity, and gets indexed as two separate keywords.) Whitespace in the map-from tokens list matters, but its amount does not. Any amount of the whitespace in the map-form list will match any other amount of whitespace in the indexed document or query. For instance, "AT & T" map-from token will match "AT & T" text, whatever the amount of space in both map-from part and the indexed text. Such text will therefore be indexed as a special "AT&T" keyword, thanks to the very first entry from the sample. Exceptions also allow to capture special characters (that are exceptions from general charset_table rules; hence the name). Assume that you generally do not want to treat '+' as a valid character, but still want to be able search for some exceptions from this rule such as 'C++'. The sample above will do just that, totally independent of what characters are in the table and what are not. Exceptions are applied to raw incoming document and query data during indexing and searching respectively. Therefore, to pick up changes in the file it's required to reindex and restart searchd. Example: | exceptions = /usr/local/sphinx/data/exceptions.txt 11.2.14. min_word_len --------------------- Minimum indexed word length. Optional, default is 1 (index everything). Only those words that are not shorter than this minimum will be indexed. For instance, if min_word_len is 4, then 'the' won't be indexed, but 'they' will be. Example: | min_word_len = 4 11.2.15. charset_type --------------------- Character set encoding type. Optional, default is 'sbcs'. Known values are 'sbcs' and 'utf-8'. Different encodings have different methods for mapping their internal characters codes into specific byte sequences. Two most common methods in use today are single-byte encoding and UTF-8. Their corresponding charset_type values are 'sbcs' (stands for Single Byte Character Set) and 'utf-8'. The selected encoding type will be used everywhere where the index is used: when indexing the data, when parsing the query against this index, when generating snippets, etc. Note that while 'utf-8' implies that the decoded values must be treated as Unicode codepoint numbers, there's a family of 'sbcs' encodings that may in turn treat different byte values differently, and that should be properly reflected in your charset_table settings. For example, the same byte value of 224 (0xE0 hex) maps to different Russian letters depending on whether koi-8r or windows-1251 encoding is used. Example: | charset_type = utf-8 11.2.16. charset_table ---------------------- Accepted characters table, with case folding rules. Optional, default value depends on charset_type value. charset_table is the main workhorse of Sphinx tokenizing process, ie. the process of extracting keywords from document text or query txet. It controls what characters are accepted as valid and what are not, and how the accepted characters should be transformed (eg. should the case be removed or not). You can think of charset_table as of a big table that has a mapping for each and every of 100K+ characters in Unicode (or as of a small 256-character table if you're using SBCS). By default, every character maps to 0, which means that it does not occur within keywords and should be treated as a separator. Once mentioned in the table, character is mapped to some other character (most frequently, either to itself or to a lowercase letter), and is treated as a valid keyword part. The expected value format is a commas-separated list of mappings. Two simplest mappings simply declare a character as valid, and map a single character to another single character, respectively. But specifying the whole table in such form would result in bloated and barely manageable specifications. So there are several syntax shortcuts that let you map ranges of characters at once. The complete list is as follows: A->a Single char mapping, declares source char 'A' as allowed to occur within keywords and maps it to destination char 'a' (but does not declare 'a' as allowed). A..Z->a..z Range mapping, declares all chars in source range as allowed and maps them to the destination range. Does not declare destination range as allowed. Also checks ranges' lengths (the lengths must be equal). a Stray char mapping, declares a character as allowed and maps it to itself. Equivalent to a->a single char mapping. a..z Stray range mapping, declares all characters in range as allowed and maps them to themselves. Equivalent to a..z->a..z range mapping. A..Z/2 Checkerboard range map. Maps every pair of chars to the second char. More formally, declares odd characters in range as allowed and maps them to the even ones; also declares even characters as allowed and maps them to themselves. For instance, A..Z/2 is equivalent to A->B, B->B, C->D, D->D, ..., Y->Z, Z->Z. This mapping shortcut is helpful for a number of Unicode blocks where uppercase and lowercase letters go in such interleaved order instead of contiguous chunks. Control characters with codes from 0 to 31 are always treated as separators. Characters with codes 32 to 127, ie. 7-bit ASCII characters, can be used in the mappings as is. To avoid configuration file encoding issues, 8-bit ASCII characters and Unicode characters must be specified in U+xxx form, where 'xxx' is hexadecimal codepoint number. This form can also be used for 7-bit ASCII characters to encode special ones: eg. use U+20 to encode space, U+2E to encode dot, U+2C to encode comma. Example: | # 'sbcs' defaults for English and Russian | charset_table = 0..9, A..Z->a..z, _, a..z, \ | U+A8->U+B8, U+B8, U+C0..U+DF->U+E0..U+FF, U+E0..U+FF | | # 'utf-8' defaults for English and Russian | charset_table = 0..9, A..Z->a..z, _, a..z, \ | U+410..U+42F->U+430..U+44F, U+430..U+44F 11.2.17. ignore_chars --------------------- Ignored characters list. Optional, default is empty. Useful in the cases when some characters, such as soft hyphenation mark (U+00AD), should be not just treated as separators but rather fully ignored. For example, if '-' is simply not in the charset_table, "abc-def" text will be indexed as "abc" and "def" keywords. On the contrary, if '-' is added to ignore_chars list, the same text will be indexed as a single "abcdef" keyword. The syntax is the same as for charset_table, but it's only allowed to declare characters, and not allowed to map them. Also, the ignored characters must not be present in charset_table. Example: | ignore_chars = U+AD 11.2.18. min_prefix_len ----------------------- Minimum word prefix length to index. Optional, default is 0 (do not index prefixes). Prefix indexing allows to implement wildcard searching by 'wordstart*' wildcards (refer to enable_star option for details on wildcard syntax). When mininum prefix length is set to a positive number, indexer will index all the possible keyword prefixes (ie. word beginnings) in addition to the keywords themselves. Too short prefixes (below the minimum allowed length) will not be indexed. For instance, indexing a keyword "example" with min_prefix_len=3 will result in indexing "exa", "exam", "examp", "exampl" prefixes along with the word itself. Searches against such index for "exam" will match documents that contain "example" word, even if they do not contain "exam" on itself. However, indexing prefixes will make the index grow significantly (because of many more indexed keywords), and will degrade both indexing and searching times. There's no automatic way to rank perfect word matches higher in a prefix index, but there's a number of tricks to achieve that. First, you can setup two indexes, one with prefix indexing and one without it, search through both, and use SetIndexWeights() call to combine weights. Second, you can enable star-syntax and rewrite your extended-mode queries: | # in sphinx.conf | enable_star = 1 | | // in query | $cl->Query ( "( keyword | keyword* ) other keywords" ); Example: | min_prefix_len = 3 11.2.19. min_infix_len ---------------------- Minimum infix prefix length to index. Optional, default is 0 (do not index infixes). Infix indexing allows to implement wildcard searching by 'start*', '*end', and '*middle*' wildcards (refer to enable_star option for details on wildcard syntax). When mininum infix length is set to a positive number, indexer will index all the possible keyword infixes (ie. substrings) in addition to the keywords themselves. Too short infixes (below the minimum allowed length) will not be indexed. For instance, indexing a keyword "test" with min_infix_len=2 will result in indexing "te", "es", "st", "tes", "est" infixes along with the word itself. Searches against such index for "es" will match documents that contain "test" word, even if they do not contain "es" on itself. However, indexing infixes will make the index grow significantly (because of many more indexed keywords), and will degrade both indexing and searching times. There's no automatic way to rank perfect word matches higher in an infix index, but the same tricks as with prefix indexes can be applied. Example: | min_infix_len = 3 11.2.20. prefix_fields ---------------------- The list of full-text fields to limit prefix indexing to. Optional, default is empty (index all fields in prefix mode). Because prefix indexing impacts both indexing and searching performance, it might be desired to limit it to specific full-text fields only: for instance, to provide prefix searching through URLs, but not through page contents. prefix_fields specifies what fields will be prefix-indexed; all other fields will be indexed in normal mode. The value format is a comma-separated list of field names. Example: | prefix_fields = url, domain 11.2.21. infix_fields --------------------- The list of full-text fields to limit infix indexing to. Optional, default is empty (index all fields in infix mode). Similar to prefix_fields, but lets you limit infix-indexing to given fields. Example: | infix_fields = url, domain 11.2.22. enable_star -------------------- Enables star-syntax (or wildcard syntax) when searching through prefix/infix indexes. Optional, default is is 0 (do not use wildcard syntax), for compatibility with 0.9.7. Known values are 0 and 1. This feature enables "star-syntax", or wildcard syntax, when searching through indexes which were created with prefix or infix indexing enabled. It only affects searching; so it can be changed without reindexing by simply restarting searchd. The default value is 0, that means to disable star-syntax and treat all keywords as prefixes or infixes respectively, depending on indexing-time min_prefix_len and min_infix_len settings. The value of 1 means that star ('*') can be used at the start and/or the end of the keyword. The star will match zero or more characters. For example, assume that the index was built with infixes and that enable_star is 1. Searching should work as follows: 1. "abcdef" query will match only those documents that contain the exact "abcdef" word in them. 2. "abc*" query will match those documents that contain any words starting with "abc" (including the documents which contain the exact "abc" word only); 3. "*cde*" query will match those documents that contain any words which have "cde" characters in any part of the word (including the documents which contain the exact "cde" word only). 4. "*def" query will match those documents that contain any words ending with "def" (including the documents that contain the exact "def" word only). Example: | enable_star = 1 11.2.23. ngram_len ------------------ N-gram lengths for N-gram indexing. Optional, default is 0 (disable n-gram indexing). Known values are 0 and 1 (other lengths to be implemented). N-grams provide basic CJK (Chinese, Japanese, Korean) support for unsegmented texts. The issue with CJK searching is that there could be no clear separators between the words. Ideally, the texts would be filtered through a special program called segmenter that would insert separators in proper locations. However, segmenters are slow and error prone, and it's common to index contiguous groups of N characters, or n-grams, instead. When this feature is enabled, streams of CJK characters are indexed as N-grams. For example, if incoming text is "ABCDEF" (where A to F represent some CJK characters) and length is 1, in will be indexed as if it was "A B C D E F". (With length equal to 2, it would produce "AB BC CD DE EF"; but only 1 is supported at the moment.) Only those characters that are listed in ngram_chars table will be split this way; other ones will not be affected. Note that if search query is segmented, ie. there are separators between individual words, then wrapping the words in quotes and using extended mode will resut in proper matches being found even if the text was not segmented. For instance, assume that the original query is BC DEF. After wrapping in quotes on the application side, it should look like "BC" "DEF" (with quotes). This query will be passed to Sphinx and internally split into 1-grams too, resulting in "B C" "D E F" query, still with quotes that are the phrase matching operator. And it will match the text even though there were no separators in the text. Even if the search query is not segmented, Sphinx should still produce good results, thanks to phrase based ranking: it will pull closer phrase matches (which in case of N-gram CJK words can mean closer multi-character word matches) to the top. Example: | ngram_len = 1 11.2.24. ngram_chars -------------------- N-gram characters list. Optional, default is empty. To be used in conjunction with in ngram_len, this list defines characters, sequences of which are subject to N-gram extraction. Words comprised of other characters will not be affected by N-gram indexing feature. The value format is identical to charset_table. Example: | ngram_chars = U+3000..U+2FA1F 11.2.25. phrase_boundary ------------------------ Phrase boundary characters list. Optional, default is empty. This list controls what characters will be treated as phrase boundaries, in order to adjust word positions and enable phrase-level search emulation through proximity search. The syntax is similar to charset_table. Mappings are not allowed and the boundary characters must not overlap with anything else. On phrase boundary, additional word position increment (specified by phrase_boundary_step) will be added to current word position. This enables phrase-level searching through proximity queries: words in different phrases will be guaranteed to be more than phrase_boundary_step distance away from each other; so proximity search within that distance will be equivalent to phrase-level search. Phrase boundary condition will be raised if and only if such character is followed by a separator; this is to avoid abbreviations such as S.T.A.L.K.E.R or URLs being treated as several phrases. Example: | phrase_boundary = ., ?, !, U+2026 # horizontal ellipsis 11.2.26. phrase_boundary_step ----------------------------- Phrase boundary word position increment. Optional, default is 0. On phrase boundary, current word position will be additionally incremented by this number. See phrase_boundary for details. Example: | phrase_boundary_step = 100 11.2.27. html_strip ------------------- Whether to strip HTML markup from incoming full-text data. Optional, default is 0. Known values are 0 (disable stripping) and 1 (enable stripping). Both HTML tags and entities and considered markup and get processed. HTML tags are removed, their contents (i.e., everything between

and

) are left intact by default. You can choose to keep and index attributes of the tags (e.g., HREF attribute in an A tag, or ALT in an IMG one). Several well-known inline tags are completely removed, all other tags are treated as block level and replaced with whitespace. For example, 'test' text will be indexed as a single keyword 'test', however, 'te

st

' will be indexed as two keywords 'te' and 'st'. Known inline tags are as follows: A, B, I, S, U, BASEFONT, BIG, EM, FONT, IMG, LABEL, SMALL, SPAN, STRIKE, STRONG, SUB, SUP, TT. HTML entities get decoded and replaced with corresponding UTF-8 characters. Stripper supports both numeric forms (such as ï) and text forms (such as ó or  ). All entities as specified by HTML4 standard are supported. Stripping does not work with xmlpipe source type (it's suggested to upgrade to xmlpipe2 anyway). It should work with properly formed HTML and XHTML, but, just as most browsers, may produce unexpected results on malformed input (such as HTML with stray <'s or unclosed >'s). Only the tags themselves, and also HTML comments, are stripped. To strip the contents of the tags too (eg. to strip embedded scripts), see html_remove_elements option. There are no restrictions on tag names; ie. everything that looks like a valid tag start, or end, or a comment will be stripped. Example: | html_strip = 1 11.2.28. html_index_attrs ------------------------- A list of markup attributes to index when stripping HTML. Optional, default is empty (do not index markup attributes). Specifies HTML markup attributes whose contents should be retained and indexed even though other HTML markup is stripped. The format is per-tag enumeration of indexable attributes, as shown in the example below. Example: | html_index_attrs = img=alt,title; a=title; 11.2.29. html_remove_elements ----------------------------- A list of HTML elements for which to strip contents along with the elements themselves. Optional, default is empty string (do not strip contents of any elements). This feature allows to strip element contents, ie. everything that is between the opening and the closing tags. It is useful to remove embedded scripts, CSS, etc. Short tag form for empty elements (ie.
) is properly supported; ie. the text that follows such tag will not be removed. The value is a comma-separated list of element (tag) names whose contents should be removed. Tag names are case insensitive. Example: | html_remove_elements = style, script 11.2.30. local -------------- Local index declaration in the distributed index. Multi-value, optional, default is empty. This setting is used to declare local indexes that will be searched when given distributed index is searched. All local indexes will be searched sequentially, utilizing only 1 CPU or core; to parallelize processing, you can configure searchd to query itself (refer to Section 11.2.31, <> for the details). There might be several local indexes declared per each distributed index. Any local index can be mentioned several times in other distributed indexes. Example: | local = chunk1 | local = chunk2 11.2.31. agent -------------- Remote agent declaration in the distributed index. Multi-value, optional, default is empty. This setting is used to declare remote agents that will be searched when given distributed index is searched. The agents can be thought of as network pointers that specify host, port, and index names. In the basic case agents would correspond to remote physical machines. More formally, that is not always correct: you can point several agents to the same remote machine; or you can even point agents to the very same single instance of searchd (in order to utilize many CPUs or cores). The value format is as follows: | agent = specification:remote-indexes-list | specification = hostname ":" port | path Where 'hostname' is remote host name; 'port' is remote TCP port; 'path' is Unix-domain socket path and 'remote-indexes-list' is a comma-separated list of remote index names. All agents will be searched in parallel. However, all indexes specified for a given agent will be searched sequentially in this agent. This lets you fine-tune the configuration to the hardware. For instance, if two remote indexes are stored on the same physical HDD, it's better to configure one agent with several sequentially searched indexes to avoid HDD steping. If they are stored on different HDDs, having two agents will be advantageous, because the work will be fully parallelized. The same applies to CPUs; though CPU performance impact caused by two processes stepping on each other is somewhat smaller and frequently can be ignored at all. On machines with many CPUs and/or HDDs, agents can be pointed to the same machine to utilize all of the hardware in parallel and reduce query latency. There is no need to setup several searchd instances for that; it's legal to configure the instance to contact itself. Here's an example setup, intended for a 4-CPU machine, that will use up to 4 CPUs in parallel to process each query: | index dist | { | type = distributed | local = chunk1 | agent = localhost:9312:chunk2 | agent = localhost:9312:chunk3 | agent = localhost:9312:chunk4 | } Note how one of the chunks is searched locally and the same instance of searchd queries itself to launch searches through three other ones in parallel. Example: | agent = localhost:9312:chunk2 # contact itself | agent = /var/run/searchd.s:chunk2 | agent = searchbox2:9312:chunk3,chunk4 # search remote indexes 11.2.32. agent_blackhole ------------------------ Remote blackhole agent declaration in the distributed index. Multi-value, optional, default is empty. Introduced in version 0.9.9-rc1. agent_blackhole lets you fire-and-forget queries to remote agents. That is useful for debugging (or just testing) production clusters: you can setup a separate debugging/testing searchd instance, and forward the requests to this instance from your production master (aggregator) instance without interfering with production work. Master searchd will attempt to connect and query blackhole agent normally, but it will neither wait nor process any responses. Also, all network errors on blackhole agents will be ignored. The value format is completely identical to regular agent directive. Example: | agent_blackhole = testbox:9312:testindex1,testindex2 11.2.33. agent_connect_timeout ------------------------------ Remote agent connection timeout, in milliseconds. Optional, default is 1000 (ie. 1 second). When connecting to remote agents, searchd will wait at most this much time for connect() call to complete succesfully. If the timeout is reached but connect() does not complete, and retries are enabled, retry will be initiated. Example: | agent_connect_timeout = 300 11.2.34. agent_query_timeout ---------------------------- Remote agent query timeout, in milliseconds. Optional, default is 3000 (ie. 3 seconds). After connection, searchd will wait at most this much time for remote queries to complete. This timeout is fully separate from connection timeout; so the maximum possible delay caused by a remote agent equals to the sum of agent_connection_timeout and agent_query_timeout. Queries will not be retried if this timeout is reached; a warning will be produced instead. Example: | agent_query_timeout = 10000 # our query can be long, allow up to 10 sec 11.2.35. preopen ---------------- Whether to pre-open all index files, or open them per each query. Optional, default is 0 (do not preopen). This option tells searchd that it should pre-open all index files on startup (or rotation) and keep them open while it runs. Currently, the default mode is not to pre-open the files (this may change in the future). Preopened indexes take a few (currently 2) file descriptors per index. However, they save on per-query open() calls; and also they are invulnerable to subtle race conditions that may happen during index rotation under high load. On the other hand, when serving many indexes (100s to 1000s), it still might be desired to open the on per-query basis in order to save file descriptors. This directive does not affect indexer in any way, it only affects searchd. Example: | preopen = 1 11.2.36. ondisk_dict -------------------- Whether to keep the dictionary file (.spi) for this index on disk, or precache it in RAM. Optional, default is 0 (precache in RAM). Introduced in version 0.9.9-rc1. The dictionary (.spi) can be either kept on RAM or on disk. The default is to fully cache it in RAM. That improves performance, but might cause too much RAM pressure, especially if prefixes or infixes were used. Enabling ondisk_dict results in 1 additional disk IO per keyword per query, but reduces memory footprint. This directive does not affect indexer in any way, it only affects searchd. Example: | ondisk_dict = 1 11.2.37. inplace_enable ----------------------- Whether to enable in-place index inversion. Optional, default is 0 (use separate temporary files). Introduced in version 0.9.9-rc1. inplace_enable greatly reduces indexing disk footprint, at a cost of slightly slower indexing (it uses around 2x less disk, but yields around 90-95% the original performance). Indexing involves two major phases. The first phase collects, processes, and partially sorts documents by keyword, and writes the intermediate result to temporary files (.tmp*). The second phase fully sorts the documents, and creates the final index files. Thus, rebuilding a production index on the fly involves around 3x peak disk footprint: 1st copy for the intermediate temporary files, 2nd copy for newly constructed copy, and 3rd copy for the old index that will be serving production queries in the meantime. (Intermediate data is comparable in size to the final index.) That might be too much disk footprint for big data collections, and inplace_enable allows to reduce it. When enabled, it reuses the temporary files, outputs the final data back to them, and renames them on completion. However, this might require additional temporary data chunk relocation, which is where the performance impact comes from. This directive does not affect searchd in any way, it only affects indexer. Example: | inplace_enable = 1 11.2.38. inplace_hit_gap ------------------------ In-place inversion fine-tuning option. Controls preallocated hitlist gap size. Optional, default is 0. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: | inplace_hit_gap = 1M 11.2.39. inplace_docinfo_gap ---------------------------- In-place inversion fine-tuning option. Controls preallocated docinfo gap size. Optional, default is 0. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: | inplace_docinfo_gap = 1M 11.2.40. inplace_reloc_factor ----------------------------- In-place inversion fine-tuning option. Controls relocation buffer size within indexing memory arena. Optional, default is 0.1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: | inplace_reloc_factor = 0.1 11.2.41. inplace_write_factor ----------------------------- In-place inversion fine-tuning option. Controls in-place write buffer size within indexing memory arena. Optional, default is 0.1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: | inplace_write_factor = 0.1 11.2.42. index_exact_words -------------------------- Whether to index the original keywords along with the stemmed/remapped versions. Optional, default is 0 (do not index). Introduced in version 0.9.9-rc1. When enabled, index_exact_words forces indexer to put the raw keywords in the index along with the stemmed versions. That, in turn, enables exact form operator in the query language to work. This impacts the index size and the indexing time. However, searching performance is not impacted at all. Example: | index_exact_words = 1 11.2.43. overshort_step ----------------------- Position increment on overshort (less that min_word_len) keywords. Optional, allowed values are 0 and 1, default is 1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: | overshort_step = 1 11.2.44. stopword_step ---------------------- Position increment on stopwords. Optional, allowed values are 0 and 1, default is 1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: | stopword_step = 1 11.2.45. hitless_words ---------------------- Hitless words list. Optional, allowed values are 'all', or a list file name. Introduced in version 1.10-beta. By default, Sphinx full-text index stores not only a list of matching documents for every given keyword, but also a list of its in-document positions (aka hitlist). Hitlists enables phrase, proximity, strict order and other advanced types of searching, as well as phrase proximity ranking. However, hitlists for specific frequent keywords (that can not be stopped for some reason despite being frequent) can get huge and thus slow to process while querying. Also, in some cases we might only care about boolean keyword matching, and never need position-based searching operators (such as phrase matching) nor phrase ranking. hitless_words lets you create indexes that either do not have positional information (hitlists) at all, or skip it for specific keywords. Hitless index will generally use less space than the respective regular index (about 1.5x can be expected). Both indexing and searching should be faster, at a cost of missing positional query and ranking support. When searching, positional queries (eg. phrase queries) will be automatically converted to respective non-positional (document-level) or combined queries. For instance, if keywords "hello" and "world" are hitless, "hello world" phrase query will be converted to (hello & world) bag-of-words query, matching all documents that mention either of the keywords but not necessarily the exact phrase. And if, in addition, keywords "simon" and "says" are not hitless, "simon says hello world" will be converted to ("simon says" & hello & world) query, matching all documents that contain "hello" and "world" anywhere in the document, and also "simon says" as an exact phrase. Example: | hitless_words = all 11.2.46. expand_keywords ------------------------ Expand keywords with exact forms and/or stars when possible. Optional, default is 0 (do not expand keywords). Introduced in version 1.10-beta. Queries against indexes with expand_keywords feature enabled are internally expanded as follows. If the index was built with prefix or infix indexing enabled, every keyword gets internally replaced with a disjunction of keyword itself and a respective prefix or infix (keyword with stars). If the index was built with both stemming and index_exact_words enabled, exact form is also added. Here's an example that shows how internal expansion works when all of the above (infixes, stemming, and exact words) are combined: | running -> ( running | *running* | =running ) Expanded queries take naturally longer to complete, but can possibly improve the search quality, as the documents with exact form matches should be ranked generally higher than documents with stemmed or infix matches. Note that the existing query syntax does not allowe to emulate this kind of expansion, because internal expansion works on keyword level and expands keywords within phrase or quorum operators too (which is not possible through the query syntax). This directive does not affect indexer in any way, it only affects searchd. Example: | expand_keywords = 1 11.2.47. blend_chars -------------------- Blended characters list. Optional, default is empty. Introduced in version 1.10-beta. Blended characters are indexed both as separators and valid characters. For instance, assume that & is configured as blended and AT&T occurs in an indexed document. Three different keywords will get indexed, namely "at&t", treating blended characters as valid, plus "at" and "t", treating them as separators. Positions for tokens obtained by replacing blended characters with whitespace are assigned as usual, so regular keywords will be indexed just as if there was no blend_chars specified at all. An additional token that mixes blended and non-blended characters will be put at the starting position. For instance, if the field contents are "AT&T company" occurs in the very beginning of the text field, "at" will be given position 1, "t" position 2, "company" positin 3, and "AT&T" will also be given position 1 ("blending" with the opening regular keyword). Thus, querying for either AT&T or just AT will match that document, and querying for "AT T" as a phrase also match it. Last but not least, phrase query for "AT&T company" will also match it, despite the position Blended characters can overlap with special characters used in query syntax (think of T-Mobile or @twitter). Where possible, query parser will automatically handle blended character as blended. For instance, "hello @twitter" within quotes (a phrase operator) would handle @-sign as blended, because @-syntax for field operator is not allowed within phrases. Otherwise, the character would be handled as an operator. So you might want to escape the keywords. Starting with version 2.0.1-beta, blended characters can be remapped, so that multiple different blended characters could be normalized into just one base form. This is useful when indexing multiple alternative Unicode codepoints with equivalent glyphs. Example: | blend_chars = +, &, U+23 | blend_chars = +, &->+ # 2.0.1 and above 11.2.48. blend_mode ------------------- Blended tokens indexing mode. Optional, default is trim_none. Introduced in version 2.0.1-beta. By default, tokens that mix blended and non-blended characters get indexed in there entirety. For instance, when both at-sign and an exclamation are in blend_chars, "@dude!" will get result in two tokens indexed: "@dude!" (with all the blended characters) and "dude" (without any). Therefore "@dude" query will not match it. blend_mode directive adds flexibility to this indexing behavior. It takes a comma-separated list of options. | blend_mode = option [, option [, ...]] | option = trim_none | trim_head | trim_tail | trim_both | skip_pure Options specify token indexing variants. If multiple options are specified, multiple variants of the same token will be indexed. Regular keywords (resulting from that token by replacing blended with whitespace) are always be indexed. trim_none Index the entire token. trim_head Trim heading blended characters, and index the resulting token. trim_tail Trim trailing blended characters, and index the resulting token. trim_both Trim both heading and trailing blended characters, and index the resulting token. skip_pure Do not index the token if it's purely blended, that is, consists of blended characters only. Returning to the "@dude!" example above, setting blend_mode = trim_head, trim_tail will result in two tokens being indexed, "@dude" and "dude!". In this particular example, trim_both would have no effect, because trimming both blended characters results in "dude" which is already indexed as a regular keyword. Indexing "@U.S.A." with trim_both (and assuming that dot is blended two) would result in "U.S.A" being indexed. Last but not least, skip_pure enables you to fully ignore sequences of blended characters only. For example, "one @@@ two" would be indexed exactly as "one two", and match that as a phrase. That is not the case by default because a fully blended token gets indexed and offsets the second keyword position. Default behavior is to index the entire token, equivalent to blend_mode = trim_none. Example: | blend_mode = trim_tail, skip_pure 11.2.49. rt_mem_limit --------------------- RAM chunk size limit. Optional, default is empty. Introduced in version 1.10-beta. RT index keeps some data in memory (so-called RAM chunk) and also maintains a number of on-disk indexes (so-called disk chunks). This directive lets you control the RAM chunk size. Once there's too much data to keep in RAM, RT index will flush it to disk, activate a newly created disk chunk, and reset the RAM chunk. The limit is pretty strict; RT index should never allocate more memory than it's limited to. The memory is not preallocated either, hence, specifying 512 MB limit and only inserting 3 MB of data should result in allocating 3 MB, not 512 MB. Example: | rt_mem_limit = 512M 11.2.50. rt_field ----------------- Full-text field declaration. Multi-value, mandatory Introduced in version 1.10-beta. Full-text fields to be indexed are declared using rt_field directive. The names must be unique. The order is preserved; and so field values in INSERT statements without an explicit list of inserted columns will have to be in the same order as configured. Example: | rt_field = author | rt_field = title | rt_field = content 11.2.51. rt_attr_uint --------------------- Unsigned integer attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares an unsigned 32-bit attribute. Introduced in version 1.10-beta. Example: | rt_attr_uint = gid 11.2.52. rt_attr_bigint ----------------------- BIGINT attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares a signed 64-bit attribute. Introduced in version 1.10-beta. Example: | rt_attr_bigint = guid 11.2.53. rt_attr_float ---------------------- Floating point attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares a single precision, 32-bit IEEE 754 format float attribute. Introduced in version 1.10-beta. Example: | rt_attr_float = gpa 11.2.54. rt_attr_timestamp -------------------------- Timestamp attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Introduced in version 1.10-beta. Example: | rt_attr_timestamp = date_added 11.2.55. rt_attr_string ----------------------- String attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Introduced in version 1.10-beta. Example: | rt_attr_string = author 11.3. indexer program configuration options =========================================== 11.3.1. mem_limit ----------------- Indexing RAM usage limit. Optional, default is 32M. Enforced memory usage limit that the indexer will not go above. Can be specified in bytes, or kilobytes (using K postfix), or megabytes (using M postfix); see the example. This limit will be automatically raised if set to extremely low value causing I/O buffers to be less than 8 KB; the exact lower bound for that depends on the indexed data size. If the buffers are less than 256 KB, a warning will be produced. Maximum possible limit is 2047M. Too low values can hurt indexing speed, but 256M to 1024M should be enough for most if not all datasets. Setting this value too high can cause SQL server timeouts. During the document collection phase, there will be periods when the memory buffer is partially sorted and no communication with the database is performed; and the database server can timeout. You can resolve that either by raising timeouts on SQL server side or by lowering mem_limit. Example: | mem_limit = 256M | # mem_limit = 262144K # same, but in KB | # mem_limit = 268435456 # same, but in bytes 11.3.2. max_iops ---------------- Maximum I/O operations per second, for I/O throttling. Optional, default is 0 (unlimited). I/O throttling related option. It limits maximum count of I/O operations (reads or writes) per any given second. A value of 0 means that no limit is imposed. indexer can cause bursts of intensive disk I/O during indexing, and it might desired to limit its disk activity (and keep something for other programs running on the same machine, such as searchd). I/O throttling helps to do that. It works by enforcing a minimum guaranteed delay between subsequent disk I/O operations performed by indexer. Modern SATA HDDs are able to perform up to 70-100+ I/O operations per second (that's mostly limited by disk heads seek time). Limiting indexing I/O to a fraction of that can help reduce search performance dedgradation caused by indexing. Example: | max_iops = 40 11.3.3. max_iosize ------------------ Maximum allowed I/O operation size, in bytes, for I/O throttling. Optional, default is 0 (unlimited). I/O throttling related option. It limits maximum file I/O operation (read or write) size for all operations performed by indexer. A value of 0 means that no limit is imposed. Reads or writes that are bigger than the limit will be split in several smaller operations, and counted as several operation by max_iops setting. At the time of this writing, all I/O calls should be under 256 KB (default internal buffer size) anyway, so max_iosize values higher than 256 KB must not affect anything. Example: | max_iosize = 1048576 11.3.4. max_xmlpipe2_field -------------------------- Maximum allowed field size for XMLpipe2 source type, bytes. Optional, default is 2 MB. Example: | max_xmlpipe2_field = 8M 11.3.5. write_buffer -------------------- Write buffer size, bytes. Optional, default is 1 MB. Write buffers are used to write both temporary and final index files when indexing. Larger buffers reduce the number of required disk writes. Memory for the buffers is allocated in addition to mem_limit. Note that several (currently up to 4) buffers for different files will be allocated, proportionally increasing the RAM usage. Example: | write_buffer = 4M 11.3.6. max_file_field_buffer ----------------------------- Maximum file field adaptive buffer size, bytes. Optional, default is 8 MB, minimum is 1 MB. File field buffer is used to load files referred to from sql_file_field columns. This buffer is adaptive, starting at 1 MB at first allocation, and growing in 2x steps until either file contents can be loaded, or maximum buffer size, specified by max_file_field_buffer directive, is reached. Thus, if there are no file fields are specified, no buffer is allocated at all. If all files loaded during indexing are under (for example) 2 MB in size, but max_file_field_buffer value is 128 MB, peak buffer usage would still be only 2 MB. However, files over 128 MB would be entirely skipped. Example: | max_file_field_buffer = 128M 11.4. searchd program configuration options =========================================== 11.4.1. listen -------------- This setting lets you specify IP address and port, or Unix-domain socket path, that searchd will listen on. Introduced in version 0.9.9-rc1. The informal grammar for listen setting is: | listen = ( address ":" port | port | path ) [ ":" protocol ] I.e. you can specify either an IP address (or hostname) and port number, or just a port number, or Unix socket path. If you specify port number but not the address, searchd will listen on all network interfaces. Unix path is identified by a leading slash. Starting with version 0.9.9-rc2, you can also specify a protocol handler (listener) to be used for connections on this socket. Supported protocol values are 'sphinx' (Sphinx 0.9.x API protocol) and 'mysql41' (MySQL protocol used since 4.1 upto at least 5.1). More details on MySQL protocol support can be found in Section 5.10, <> section. Examples: | listen = localhost | listen = localhost:5000 | listen = 192.168.0.1:5000 | listen = /var/run/sphinx.s | listen = 9312 | listen = localhost:9306:mysql41 There can be multiple listen directives, searchd will listen for client connections on all specified ports and sockets. If no listen directives are found then the server will listen on all available interfaces using the default SphinxAPI port 9312. Starting with 1.10-beta, it will also listen on default SphinxQL port 9306. Both port numbers are assigned by IANA (see http://www.iana.org/assignments/port-numbers for details) and should therefore be available. Unix-domain sockets are not supported on Windows. 11.4.2. address --------------- Interface IP address to bind on. Optional, default is 0.0.0.0 (ie. listen on all interfaces). DEPRECATED, use listen instead. address setting lets you specify which network interface searchd will bind to, listen on, and accept incoming network connections on. The default value is 0.0.0.0 which means to listen on all interfaces. At the time, you can not specify multiple interfaces. Example: | address = 192.168.0.1 11.4.3. port ------------ searchd TCP port number. DEPRECATED, use listen instead. Used to be mandatory. Default port number is 9312. Example: | port = 9312 11.4.4. log ----------- Log file name. Optional, default is 'searchd.log'. All searchd run time events will be logged in this file. Also you can use the 'syslog' as the file name. In this case the events will be sent to syslog daemon. To use the syslog option the sphinx must be configured '--with-syslog' on building. Example: | log = /var/log/searchd.log 11.4.5. query_log ----------------- Query log file name. Optional, default is empty (do not log queries). All search queries will be logged in this file. The format is described in Section 5.9, <>. In case of 'plain' format, you can use the 'syslog' as the path to the log file. In this case all search queries will be sent to syslog daemon with LOG_INFO priority, prefixed with '[query]' instead of timestamp. To use the syslog option the sphinx must be configured '--with-syslog' on building. Example: | query_log = /var/log/query.log 11.4.6. query_log_format ------------------------ Query log format. Optional, allowed values are 'plain' and 'sphinxql', default is 'plain'. Introduced in version 2.0.1-beta. Starting with version 2.0.1-beta, two different log formats are supported. The default one logs queries in a custom text format. The new one logs valid SphinxQL statements. This directive allows to switch between the two formats on search daemon startup. The log format can also be altered on the fly, using SET GLOBAL query_log_format=sphinxql syntax. Refer to Section 5.9, <> for more discussion and format details. Example: | query_log_format = sphinxql 11.4.7. read_timeout -------------------- Network client request read timeout, in seconds. Optional, default is 5 seconds. searchd will forcibly close the client connections which fail to send a query within this timeout. Example: | read_timeout = 1 11.4.8. client_timeout ---------------------- Maximum time to wait between requests (in seconds) when using persistent connections. Optional, default is five minutes. Example: | client_timeout = 3600 11.4.9. max_children -------------------- Maximum amount of children to fork (or in other words, concurrent searches to run in parallel). Optional, default is 0 (unlimited). Useful to control server load. There will be no more than this much concurrent searches running, at all times. When the limit is reached, additional incoming clients are dismissed with temporarily failure (SEARCHD_RETRY) status code and a message stating that the server is maxed out. Example: | max_children = 10 11.4.10. pid_file ----------------- searchd process ID file name. Mandatory. PID file will be re-created (and locked) on startup. It will contain head daemon process ID while the daemon is running, and it will be unlinked on daemon shutdown. It's mandatory because Sphinx uses it internally for a number of things: to check whether there already is a running instance of searchd; to stop searchd; to notify it that it should rotate the indexes. Can also be used for different external automation scripts. Example: | pid_file = /var/run/searchd.pid 11.4.11. max_matches -------------------- Maximum amount of matches that the daemon keeps in RAM for each index and can return to the client. Optional, default is 1000. Introduced in order to control and limit RAM usage, max_matches setting defines how much matches will be kept in RAM while searching each index. Every match found will still be processed; but only best N of them will be kept in memory and return to the client in the end. Assume that the index contains 2,000,000 matches for the query. You rarely (if ever) need to retrieve all of them. Rather, you need to scan all of them, but only choose "best" at most, say, 500 by some criteria (ie. sorted by relevance, or price, or anything else), and display those 500 matches to the end user in pages of 20 to 100 matches. And tracking only the best 500 matches is much more RAM and CPU efficient than keeping all 2,000,000 matches, sorting them, and then discarding everything but the first 20 needed to display the search results page. max_matches controls N in that "best N" amount. This parameter noticeably affects per-query RAM and CPU usage. Values of 1,000 to 10,000 are generally fine, but higher limits must be used with care. Recklessly raising max_matches to 1,000,000 means that searchd will have to allocate and initialize 1-million-entry matches buffer for every query. That will obviously increase per-query RAM usage, and in some cases can also noticeably impact performance. CAVEAT EMPTOR! Note that there also is another place where this limit is enforced. max_matches can be decreased on the fly through the corresponding API call, and the default value in the API is also set to 1,000. So in order to retrieve more than 1,000 matches to your application, you will have to change the configuration file, restart searchd, and set proper limit in SetLimits() call. Also note that you can not set the value in the API higher than the value in the .conf file. This is prohibited in order to have some protection against malicious and/or malformed requests. Example: | max_matches = 10000 11.4.12. seamless_rotate ------------------------ Prevents searchd stalls while rotating indexes with huge amounts of data to precache. Optional, default is 1 (enable seamless rotation). Indexes may contain some data that needs to be precached in RAM. At the moment, .spa, .spi and .spm files are fully precached (they contain attribute data, MVA data, and keyword index, respectively.) Without seamless rotate, rotating an index tries to use as little RAM as possible and works as follows: 1. new queries are temporarly rejected (with "retry" error code); 2. searchd waits for all currently running queries to finish; 3. old index is deallocated and its files are renamed; 4. new index files are renamed and required RAM is allocated; 5. new index attribute and dictionary data is preloaded to RAM; 6. searchd resumes serving queries from new index. However, if there's a lot of attribute or dictionary data, then preloading step could take noticeble time - up to several minutes in case of preloading 1-5+ GB files. With seamless rotate enabled, rotation works as follows: 1. new index RAM storage is allocated; 2. new index attribute and dictionary data is asynchronously preloaded to RAM; 3. on success, old index is deallocated and both indexes' files are renamed; 4. on failure, new index is deallocated; 5. at any given moment, queries are served either from old or new index copy. Seamless rotate comes at the cost of higher peak memory usage during the rotation (because both old and new copies of .spa/.spi/.spm data need to be in RAM while preloading new copy). Average usage stays the same. Example: | seamless_rotate = 1 11.4.13. preopen_indexes ------------------------ Whether to forcibly preopen all indexes on startup. Optional, default is 1 (preopen everything). Starting with 2.0.1-beta, the default value for this option is now 1 (foribly preopen all indexes). In prior versions, it used to be 0 (use per-index settings). When set to 1, this directive overrides and enforces preopen on all indexes. They will be preopened, no matter what is the per-index preopen setting. When set to 0, per-index settings can take effect. (And they default to 0.) Pre-opened indexes avoid races between search queries and rotations that can cause queries to fail occasionally. They also make searchd use more file handles. In most scenarios it's therefore preferred and recommended to preopen indexes. Example: | preopen_indexes = 1 11.4.14. unlink_old ------------------- Whether to unlink .old index copies on succesful rotation. Optional, default is 1 (do unlink). Example: | unlink_old = 0 11.4.15. attr_flush_period -------------------------- When calling UpdateAttributes() to update document attributes in real-time, changes are first written to the in-memory copy of attributes (docinfo must be set to extern). Then, once searchd shuts down normally (via SIGTERM being sent), the changes are written to disk. Introduced in version 0.9.9-rc1. Starting with 0.9.9-rc1, it is possible to tell searchd to periodically write these changes back to disk, to avoid them being lost. The time between those intervals is set with attr_flush_period, in seconds. It defaults to 0, which disables the periodic flushing, but flushing will still occur at normal shut-down. Example: | attr_flush_period = 900 # persist updates to disk every 15 minutes 11.4.16. ondisk_dict_default ---------------------------- Instance-wide defaults for ondisk_dict directive. Optional, default it 0 (precache dictionaries in RAM). Introduced in version 0.9.9-rc1. This directive lets you specify the default value of ondisk_dict for all the indexes served by this copy of searchd. Per-index directive take precedence, and will overwrite this instance-wide default value, allowing for fine-grain control. Example: | ondisk_dict_default = 1 # keep all dictionaries on disk 11.4.17. max_packet_size ------------------------ Maximum allowed network packet size. Limits both query packets from clients, and response packets from remote agents in distributed environment. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 8M. Introduced in version 0.9.9-rc1. Example: | max_packet_size = 32M 11.4.18. mva_updates_pool ------------------------- Shared pool size for in-memory MVA updates storage. Optional, default size is 1M. Introduced in version 0.9.9-rc1. This setting controls the size of the shared storage pool for updated MVA values. Specifying 0 for the size disable MVA updates at all. Once the pool size limit is hit, MVA update attempts will result in an error. However, updates on regular (scalar) attributes will still work. Due to internal technical difficulties, currently it is not possible to store (flush) any updates on indexes where MVA were updated; though this might be implemented in the future. In the meantime, MVA updates are intended to be used as a measure to quickly catchup with latest changes in the database until the next index rebuild; not as a persistent storage mechanism. Example: | mva_updates_pool = 16M 11.4.19. crash_log_path ----------------------- Deprecated debugging setting, path (formally prefix) for crash log files. Introduced in version 0.9.9-rc1. Deprecated in version 2.0.1-beta, as crash debugging information now gets logged into searchd.log in text form, and separate binary crash logs are no longer needed. 11.4.20. max_filters -------------------- Maximum allowed per-query filter count. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 256. Introduced in version 0.9.9-rc1. Example: | max_filters = 1024 11.4.21. max_filter_values -------------------------- Maximum allowed per-filter values count. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 4096. Introduced in version 0.9.9-rc1. Example: | max_filter_values = 16384 11.4.22. listen_backlog ----------------------- TCP listen backlog. Optional, default is 5. Windows builds currently (as of 0.9.9) can only process the requests one by one. Concurrent requests will be enqueued by the TCP stack on OS level, and requests that can not be enqueued will immediately fail with "connection refused" message. listen_backlog directive controls the length of the connection queue. Non-Windows builds should work fine with the default value. Example: | listen_backlog = 20 11.4.23. read_buffer -------------------- Per-keyword read buffer size. Optional, default is 256K. For every keyword occurrence in every search query, there are two associated read buffers (one for document list and one for hit list). This setting lets you control their sizes, increasing per-query RAM use, but possibly decreasing IO time. Example: | read_buffer = 1M 11.4.24. read_unhinted ---------------------- Unhinted read size. Optional, default is 32K. When querying, some reads know in advance exactly how much data is there to be read, but some currently do not. Most prominently, hit list size in not currently known in advance. This setting lest you control how much data to read in such cases. It will impact hit list IO time, reducing it for lists larger than unhinted read size, but raising it for smaller lists. It will not affect RAM use because read buffer will be already allocated. So it should be not greater than read_buffer. Example: | read_unhinted = 32K 11.4.25. max_batch_queries -------------------------- Limits the amount of queries per batch. Optional, default is 32. Makes searchd perform a sanity check of the amount of the queries submitted in a single batch when using multi-queries. Set it to 0 to skip the check. Example: | max_batch_queries = 256 11.4.26. subtree_docs_cache --------------------------- Max common subtree document cache size, per-query. Optional, default is 0 (disabled). Limits RAM usage of a common subtree optimizer (see Section 5.11, <>). At most this much RAM will be spent to cache document entries per each query. Setting the limit to 0 disables the optimizer. Example: | subtree_docs_cache = 8M 11.4.27. subtree_hits_cache --------------------------- Max common subtree hit cache size, per-query. Optional, default is 0 (disabled). Limits RAM usage of a common subtree optimizer (see Section 5.11, <>). At most this much RAM will be spent to cache keyword occurrences (hits) per each query. Setting the limit to 0 disables the optimizer. Example: | subtree_hits_cache = 16M 11.4.28. workers ---------------- Multi-processing mode (MPM). Optional; allowed values are none, fork, prefork, and threads. Default is fork on Unix based systems, and threads on Windows. Introduced in version 1.10-beta. Lets you choose how searchd processes multiple concurrent requests. The possible values are: none All requests will be handled serially, one-by-one. Prior to 1.x, this was the only mode available on Windows. fork A new child process will be forked to handle every incoming request. Historically, this is the default mode. prefork On startup, searchd will pre-fork a number of worker processes, and pass the incoming requests to one of those children. threads A new thread will be created to handle every incoming request. This is the only mode compatible with RT indexing backend. Historically, searchd used fork-based model, which generally performs OK but spends a noticeable amount of CPU in fork() system call when there's a high amount of (tiny) requests per second. Prefork mode was implemented to alleviate that; with prefork, worker processes are basically only created on startup and re-created on index rotation, somewhat reducing fork() call pressure. Threads mode was implemented along with RT backend and is required to use RT indexes. (Regular disk-based indexes work in all the available modes.) Example: | workers = threads 11.4.29. dist_threads --------------------- Max local worker threads to use for parallelizable requests (searching a distributed index; building a batch of snippets). Optional, default is 0, which means to disable in-request parallelism. Introduced in version 1.10-beta. Distributed index can include several local indexes. dist_threads lets you easily utilize multiple CPUs/cores for that (previously existing alternative was to specify the indexes as remote agents, pointing searchd to itself and paying some network overheads). When set to a value N greater than 1, this directive will create up to N threads for every query, and schedule the specific searches within these threads. For example, if there are 7 local indexes to search and dist_threads is set to 2, then 2 parallel threads would be created: one that sequentially searches 4 indexes, and another one that searches the other 3 indexes. In case of CPU bound workload, setting dist_threads to 1x the number of cores is advised (creating more threads than cores will not improve query time). In case of mixed CPU/disk bound workload it might sometimes make sense to use more (so that all cores could be utilizes even when there are threads that wait for I/O completion). Note that dist_threads does not require threads MPM. You can perfectly use it with fork or prefork MPMs too. Starting with version 2.0.1-beta, building a batch of snippets with load_files flag enabled can also be parallelized. Up to dist_threads threads are be created to process those files. That speeds up snippet extraction when the total amount of document data to process is significant (hundreds of megabytes). Example: | index dist_test | { | type = distributed | local = chunk1 | local = chunk2 | local = chunk3 | local = chunk4 | } | | # ... | | dist_threads = 4 11.4.30. binlog_path -------------------- Binary log (aka transaction log) files path. Optional, default is build-time configured data directory. Introduced in version 1.10-beta. Binary logs are used for crash recovery of RT index data that would otherwise only be stored in RAM. When logging is enabled, every transaction COMMIT-ted into RT index gets written into a log file. Logs are then automatically replayed on startup after an unclean shutdown, recovering the logged changes. binlog_path directive specifies the binary log files location. It should contain just the path; searchd will create and unlink multiple binlog.* files in that path as necessary (binlog data, metadata, and lock files, etc). Empty value disables binary logging. That improves performance, but puts RT index data at risk. Example: | binlog_path = # disable logging | binlog_path = /var/data # /var/data/binlog.001 etc will be created 11.4.31. binlog_flush --------------------- Binary log transaction flush/sync mode. Optional, default is 2 (flush every transaction, sync every second). Introduced in version 1.10-beta. This directive controls how frequently will binary log be flushed to OS and synced to disk. Three modes are supported: * 0, flush and sync every second. Best performance, but up to 1 second worth of committed transactions can be lost both on daemon crash, or OS/hardware crash. * 1, flush and sync every transaction. Worst performance, but every committed transaction data is guaranteed to be saved. * 2, flush every transaction, sync every second. Good performance, and every committed transaction is guaranteed to be saved in case of daemon crash. However, in case of OS/hardware crash up to 1 second worth of committed transactions can be lost. For those familiar with MySQL and InnoDB, this directive is entirely similar to innodb_flush_log_at_trx_commit. In most cases, the default hybrid mode 2 provides a nice balance of speed and safety, with full RT index data protection against daemon crashes, and some protection against hardware ones. Example: | binlog_flush = 1 # ultimate safety, low speed 11.4.32. binlog_max_log_size ---------------------------- Maximum binary log file size. Optional, default is 0 (do not reopen binlog file based on size). Introduced in version 1.10-beta. A new binlog file will be forcibly opened once the current binlog file reaches this limit. This achieves a finer granularity of logs and can yield more efficient binlog disk usage under certain borderline workloads. Example: | binlog_max_log_size = 16M 11.4.33. collation_server ------------------------- Default server collation. Optional, default is libc_ci. Introduced in version 2.0.1-beta. Specifies the default collation used for incoming requests. The collation can be overridden on a per-query basis. Refer to Section 5.12, <> section for the list of available collations and other details. Example: | collation_server = utf8_ci 11.4.34. collation_libc_locale ------------------------------ Server libc locale. Optional, default is C. Introduced in version 2.0.1-beta. Specifies the libc locale, affecting the libc-based collations. Refer to Section 5.12, <> section for the details. Example: | collation_libc_locale = fr_FR 11.4.35. plugin_dir ------------------- Trusted location for the dynamic libraries (UDFs). Optional, default is empty (no location). Introduced in version 2.0.1-beta. Specifies the trusted directory from which the UDF libraries can be loaded. Requires workers = thread to take effect. Example: | workers = threads | plugin_dir = /usr/local/sphinx/lib 11.4.36. mysql_version_string ----------------------------- A server version string to return via MySQL protocol. Optional, default is empty (return Sphinx version). Introduced in version 2.0.1-beta. Several picky MySQL client libraries depend on a particular version number format used by MySQL, and moreover, sometimes choose a different execution path based on the reported version number (rather than the indicated capabilities flags). For instance, Python MySQLdb 1.2.2 throws an exception when the version number is not in X.Y.ZZ format; MySQL .NET connector 6.3.x fails internally on version numbers 1.x along with a certain combination of flags, etc. To workaround that, you can use mysql_version_string directive and have searchd report a different version to clients connecting over MySQL protocol. (By default, it reports its own version.) Example: | mysql_version_string = 5.0.37 11.4.37. rt_flush_period ------------------------ RT indexes RAM chunk flush check period, in seconds. Optional, default is 0 (do not flush). Introduced in version 2.0.1-beta. Actively updated RT indexes that however fully fit in RAM chunks can result in ever-growing binlogs, impacting disk use and crash recovery time. With this directive the search daemon performs periodic flush checks, and eligible RAM chunks can get saved, enabling consequential binlog cleanup. See Section 4.4, <> for more details. Example: | rt_flush_period = 3600 11.4.38. thread_stack --------------------- Per-thread stack size. Optional, default is 64K. Introduced in version 2.0.1-beta. In the workers = threads mode, every request is processed with a separate thread that needs its own stack space. By default, 64K per thread are allocated for stack. However, extremely complex search requests might eventually exhaust the default stack and require more. For instance, a query that matches a few thousand keywords (either directly or through term expansion) can eventually run out of stack. Previously, that resulted in crashes. Starting with 2.0.1-beta, searchd attempts to estimate the expected stack use, and blocks the potentially dangerous queries. To process such queries, you can either the thread stack size by using the thread_stack directive (or switch to a different workers setting if that is possible). A query with N levels of nesting is estimated to require approximately 30+0.12*N KB of stack, meaning that the default 64K is enough for queries with upto 300 levels, 150K for upto 1000 levels, etc. If the stack size limit is not met, searchd fails the query and reports the required stack size in the error message. Example: | thread_stack = 256K 11.4.39. expansion_limit ------------------------ The maximum number of expanded keywords for a single wildcard. Optional, default is 0 (no limit). Introduced in version 2.0.1-beta. When doing substring searches against indexes built with dict = keywords enabled, a single wildcard may potentially result in thousands and even millions of matched keywords (think of matching 'a*' against the entire Oxford dictionary). This directive lets you limit the impact of such expansions. Setting expansion_limit = N restricts expansions to no more than N of the most frequent matching keywords (per each wildcard in the query). Example: | expansion_limit = 16 11.4.40. compat_sphinxql_magics ------------------------------- Legacy SphinxQL quirks compatiblity mode. Optional, default is 1 (keep compatibility). Introduced in version 2.0.1-beta. Starting with version 2.0.1-beta, we're bringing SphinxQL in closer compliance with standard SQL. However, existing applications must not get broken, and compat_sphinxql_magics lets you upgrade safely. It defauls to 1, which enables the compatibility mode. However, SphinxQL compatibility mode is now deprecated and will be removed once we complete bringing SphinxQL in line with standard SQL syntax. So it's advised to update the applications utilising SphinxQL and then switch the daemon to the new, more SQL compliant mode by setting compat_sphinxql_magics = 0. Please refer to Section 7.21, <> for the details and update instruction. Example: | compat_sphinxql_magics = 0 # the future is now 11.4.41. watchdog ----------------- Threaded server watchdog. Optional, default is 1 (watchdog enabled). Introduced in version 2.0.1-beta. A crashed query in threads multi-processing mode (workers = threads) can take down the entire server. With watchdog feature enabled, searchd additionally keeps a separate lightweight process that monitors the main server process, and automatically restarts the latter in case of abnormal termination. Watchdog is enabled by default. Example: | watchdog = 0 # disable watchdog Appendix A. Sphinx revision history =================================== Table of Contents A.1. Version 2.0.1-beta, 22 apr 2011 A.2. Version 1.10-beta, 19 jul 2010 A.3. Version 0.9.9-release, 02 dec 2009 A.4. Version 0.9.9-rc2, 08 apr 2009 A.5. Version 0.9.9-rc1, 17 nov 2008 A.6. Version 0.9.8.1, 30 oct 2008 A.7. Version 0.9.8, 14 jul 2008 A.8. Version 0.9.7, 02 apr 2007 A.9. Version 0.9.7-rc2, 15 dec 2006 A.10. Version 0.9.7-rc1, 26 oct 2006 A.11. Version 0.9.6, 24 jul 2006 A.12. Version 0.9.6-rc1, 26 jun 2006 A.1. Version 2.0.1-beta, 22 apr 2011 ==================================== New general features -------------------- * added remapping support to blend_chars directive * added multi-threaded snippet batches support (requires a batch sent via API, dist_threads, and load_files) * added collations (collation_server, collation_libc_locale directives) * added support for sorting and grouping on string attributes (ORDER BY, GROUP BY, WITHING GROUP ORDER BY) * added UDF support (plugin_dir directive; CREATE FUNCTION, DROP FUNCTION statements) * added query_log_format directive, SET GLOBAL query_log_format | log_level = ... statements; and connection id tracking * added sql_column_buffers directive, fixed out-of-buffer column handling in ODBC/MS SQL sources * added blend_mode directive that enables indexing multiple variants of a blended sequence * added UNIX socket support to C, Ruby APIs * added ranged query support to sql_joined_field * added rt_flush_period directive * added thread_stack directive * added SENTENCE, PARAGRAPH, ZONE operators (and index_sp, index_zones directives) * added keywords dictionary support (and dict, expansion_limit directives) * added passage_boundary, emit_zones options to snippets * added a watchdog process in threaded mode * added persistent MVA updates * added crash dumps to searchd.log, deprecated crash_log_path directive * added id32 index support in id64 binaries (EXPERIMENTAL) * added SphinxSE support for DELETE and REPLACE on SphinxQL tables New SphinxQL features --------------------- * added new, more SQL compliant SphinxQL syntax; and a compat_sphinxql_magics directive * added CRC32(), DAY(), MONTH(), YEAR(), YEARMONTH(), YEARMONTHDAY() functions * added DIV, MOD, and % operators * added reverse_scan=(0|1) option to SELECT * added support for MySQL packets over 16M * added dummy SHOW VARIABLES, SHOW COLLATION, and SET character_set_results support (to support handshake with certain client libraries and frameworks) * added mysql_version_string directive (to workaround picky MySQL client libraries) * added support for global filter variables, SET GLOBAL @uservar=(int_list) * added DELETE ... IN (id_list) syntax support * added C-style comments syntax (for example, SELECT /*!40000 some comment*/ id FROM test) * added UPDATE ... WHERE id=X syntax support * added SphinxQL multi-query support * added DESCRIBE, SHOW TABLES statements New command-line switches ------------------------- * added --print-queries switch to indexer that dumps SQL queries it runs * added --sighup-each switch to indexer that rotates indexes one by one * added --strip-path switch to searchd that skips file paths embedded in the index(-es) * added --dumpconfig switch to indextool that dumps an index header in sphinx.conf format Major changes and optimizations ------------------------------- * changed default preopen_indexes value to 1 * optimized English stemmer (results in 1.3x faster snippets and indexing with morphology=stem_en) * optimized snippets, 1.6x general speedup * optimized const-list parsing in SphinxQL * optimized full-document highlighting CPU/RAM use * optimized binlog replay (improved performance on K-list update) Bug fixes --------- * fixed #767, joined fields vs ODBC sources * fixed #757, wordforms shared by indexes with different settings * fixed #733, loading of indexes in formats prior to v.14 * fixed #763, occasional snippets failures * fixed #648, occasionally missed rotations on multiple SIGHUPs * fixed #750, an RT segment merge leading to false positives and/or crashes in some cases * fixed #755, zones in snippets output * fixed #754, stopwords counting at snippet passage generation * fixed #723, fork/prefork index rotation in children processes * fixed #696, freeze on zero threshold in quorum operator * fixed #732, query escaping in SphinxSE * fixed #739, occasional crashes in MT mode on result set send * fixed #746, crash with a named list in SphinxQL option * fixed #674, AVG vs group order * fixed #734, occasional crashes attempting to report NULL errors * fixed #829, tail hits within field position modifier * fixed #712, missing query_mode, force_all_words snippet option defaults in Java API * fixed #721, added dupe removal on RT batch INSERT/REPLACE * fixed #720, potential extraneous highlighting after a blended keyword * fixed #702, exceptions vs star search * fixed #666, ext2 query grouping vs exceptions * fixed #688, WITHIN GROUP ORDER BY related crash * fixed #660, multi-queue batches vs dist_threads * fixed #678, crash on dict=keywords vs xmlpipe vs min_prefix_len * fixed #596, ECHILD vs scripted configs * fixed #653, dependency in expression, sorting, grouping * fixed #661, concurrent distributed searches vs workers=threads * fixed #646, crash on status query via UNIX socket * fixed #589, libexpat.dll missing from some Win32 build types * fixed #574, quorum match order * fixed multiple documentation issues (#372, #483, #495, #601, #623, #632, #654) * fixed that ondisk_dict did not affect RT indexes * fixed that string attributes check in indextool --check was erroneously sensitive to string data order * fixed a rare crash when using BEFORE operator * fixed an issue with multiforms vs BuildKeywords() * fixed an edge case in OR operator (emitted wrong hits order sometimes) * fixed aliasing in docinfo accessors that lead to very rare crashes and/or missing results * fixed a syntax error on a short token at the end of a query * fixed id64 filtering and performance degradation with range filters * fixed missing rankers in libsphinxclient * fixed missing SPH04 ranker in SphinxSE * fixed column names in sql_attr_multi sample (works with example.sql now) * fixed an issue with distributed local+remote setup vs aggregate functions * fixed case sensitive columns names in RT indexes * fixed a crash vs strings from multiple indexes in result set * fixed blended keywords vs snippets * fixed secure_connection vs MySQL protocol vs MySQL.NET connector * fixed that Python API did not works with Python 2.3 * fixed overshort_step vs snippets * fixed keyword staistics vs dist_threads searching * fixed multiforms vs query parsing (vs quorum) * fixed missed quorum words vs RT segments * fixed blended keywords occasionally skipping extra character when querying (eg "abc[]") * fixed Python API to handle int32 values * fixed prefix and infix indexing of joined fields * fixed MVA ranged query * fixed missing blended state reset on document boundary * fixed a crash on missing index while replaying binlog * fixed an error message on filter values overrun * fixed passage duplication in snippets in weight_order mode * fixed select clauses over 1K vs remote agents * fixed overshort accounting vs soft-whitespace tokens * fixed rotation vs workers=threads * fixed schema issues vs distributed indexes * fixed blended-escaped sequence parsing issue * fixed MySQL IN clause (values order etc) * fixed that post_index did not execute when 0 documents were succesfully indexed * fixed field position limit vs many hits * fixed that joined fields missed an end marker at field end * fixed that xxx_step settings were missing from .sph index header * fixed libsphinxclient missing request cleanup in sphinx_query() (eg after network errors) * fixed that index_weights were ignored when grouping * fixed multi wordforms vs blend_chars * fixed broken MVA output in SphinxQL * fixed a few RT leaks * fixed an issue with RT string storage going missing * fixed an issue with repeated queries vs dist_threads * fixed an issue with string attributes vs buffer overrun in SphinxQL * fixed unexpected character data warnings within ignored xmlpipe tags * fixed a crash in snippets with NEAR syntax query * fixed passage duplication in snippets * fixed libsphinxclient SIGPIPE handling * fixed libsphinxclient vs VS2003 compiler bug A.2. Version 1.10-beta, 19 jul 2010 =================================== * added RT indexes support (Chapter 4, Real-time indexes) * added prefork and threads support (workers directives) * added multi-threaded local searches in distributed indexes (dist_threads directive) * added common subquery cache (subtree_docs_cache, subtree_hits_cache directives) * added string attributes support (sql_attr_string, sql_field_string, xml_attr_string, xml_field_string directives) * added indexing-time word counter (sql_attr_str2wordcount, sql_field_str2wordcount directives) * added CALL SNIPPETS(), CALL KEYWORDS() SphinxQL statements * added field_weights, index_weights options to SphinxQL SELECT statement * added insert-only SphinxQL-talking tables to SphinxSE (connection='sphinxql://host[:port]/index') * added select option to SphinxSE queries * added backtrace on crash to searchd * added SQL+FS indexing, aka loading files by names fetched from SQL (sql_file_field directive) * added a watchdog in threads mode to searchd * added automatic row phantoms elimination to index merge * added hitless indexing support (hitless_words directive) * added --check, --strip-path, --htmlstrip, --dumphitlist ... --wordid switches to indextool * added --stopwait, --logdebug switches to searchd * added --dump-rows, --verbose switches to indexer * added "blended" characters indexing support (blend_chars directive) * added joined/payload field indexing (sql_joined_field directive) * added FlushAttributes() API call * added query_mode, force_all_words, limit_passages, limit_words, start_passage_id, load_files, html_strip_mode, allow_empty options, and %PASSAGE_ID% macro in before_match, after_match options to BuildExcerpts() API call * added @groupby/@count/@distinct columns support to SELECT (but not to expressions) * added query-time keyword expansion support (expand_keywords directive, SPH_RANK_SPH04 ranker) * added query batch size limit option (max_batch_queries directive; was hardcoded) * added SINT() function to expressions * improved SphinxQL syntax error reporting * improved expression optimizer (better constant handling) * improved dash handling within keywords (no longer treated as an operator) * improved snippets (better passage selection/trimming, around option now a hard limit) * optimized index format that yields ~20-30% smaller indexes * optimized sorting code (indexing time 1-5% faster on average; 100x faster in worst case) * optimized searchd startup time (moved .spa preindexing to indexer), added a progress bar * optimized queries against indexes with many attributes (eliminated redundant copying) * optimized 1-keyword queries (performace regression introduced in 0.9.9) * optimized SphinxQL protocol overheads, and performance on bigger result sets * optimized unbuffered attributes writes on index merge * changed attribute handling, duplicate names are strictly forbidden now * fixed that SphinxQL sessions could stall shutdown * fixed consts with leading minus in SphinxQL * fixed AND/OR precedence in expressions * fixed #334, AVG() on integers was not computed in floats * fixed #371, attribute flush vs 2+ GB files * fixed #373, segfault on distributed queries vs certain libc versions * fixed #398, stopwords not stopped in prefix/infix indexes * fixed #404, erroneous MVA failures in indextool --check * fixed #408, segfault on certain query batches (regular scan, plus a scan with MVA groupby) * fixed #431, occasional shutdown hangs in preforked workers * fixed #436, trunk checkout builds vs Solaris sh * fixed #440, escaping vs parentheses declared as valid in charset_table * fixed #442, occasional non-aligned free in MVA indexing * fixed #447, occasional crashes in MVA indexing * fixed #449, pconn busyloop on aborted clients on certain arches * fixed #465, build issue on Alpha * fixed #468, build issue in libsphinxclient * fixed #472, multiple stopword files failing to load * fixed #489, buffer overflow in query logging * fixed #493, Python API assertion after error returned from Query() * fixed #500, malformed MySQL packet when sending MVAs * fixed #504, SIGPIPE in libsphinxclient * fixed #506, better MySQL protocol commands support in SphinxQL (PING etc) * fixed #509, indexing ranged results from stored procedures A.3. Version 0.9.9-release, 02 dec 2009 ======================================= * added Open, Close, Status calls to libsphinxclient (C API) * added automatic persistent connection reopening to PHP, Python APIs * added 64-bit value/range filters, fullscan mode support to SphinxSE * MAJOR CHANGE, our IANA assigned ports are 9312 and 9306 respectively (goodbye, trusty 3312) * MAJOR CHANGE, erroneous filters now fail with an error (were silently ignored before) * optimized unbuffered .spa writes on merge * optimized 1-keyword queries ranking in extended2 mode * fixed #441 (IO race in case of highly conccurent load on a preopened) * fixed #434 (distrubuted indexes were not searchable via MySQL protocol) * fixed #317 (indexer MVA progress counter) * fixed #398 (stopwords not removed from search query) * fixed #328 (broken cutoff) * fixed #250 (now quoting paths w/spaces when installing Windows service) * fixed #348 (K-list was not updated on merge) * fixed #357 (destination index were not K-list-filtered on merge) * fixed #369 (precaching .spi files over 2 GBs) * fixed #438 (missing boundary proximity matches) * fixed #371 (.spa flush in case of files over 2 GBs) * fixed #373 (crashes on distributed queries via mysql proto) * fixed critical bugs in hit merging code * fixed #424 (ordinals could be misplaced during indexing in case of bitfields etc) * fixed #426 (failing SE build on Solaris; thanks to Ben Beecher) * fixed #423 (typo in SE caused crash on SHOW STATUS) * fixed #363 (handling of read_timeout over 2147 seconds) * fixed #376 (minor error message mismatch) * fixed #413 (minus in SphinxQL) * fixed #417 (floats w/o leading digit in SphinxQL) * fixed #403 (typo in SetFieldWeights name in Java API) * fixed index rotation vs persistent connections * fixed backslash handling in SphinxQL parser * fixed uint unpacking vs. PHP 5.2.9 (possibly other versions) * fixed #325 (filter settings send from SphinxSE) * fixed #352 (removed mysql wrapper around close() in SphinxSE) * fixed #389 (display error messages through SphinxSE status variable) * fixed linking with port-installed iconv on OS X * fixed negative 64-bit unpacking in PHP API * fixed #349 (escaping backslash in query emulation mode) * fixed #320 (disabled multi-query route when select items differ) * fixed #353 (better quorum counts check) * fixed #341 (merging of trailing hits; maybe other ranking issues too) * fixed #368 (partially; @field "" caused crashes; now resets field limit) * fixed #365 (field mask was leaking on field-limited terms) * fixed #339 (updated debug query dumper) * fixed #361 (added SetConnectTimeout() to Java API) * fixed #338 (added missing fullscan to mode check in Java API) * fixed #323 (added floats support to SphinxQL) * fixed #340 (support listen=port:proto syntax too) * fixed #332 (\r is legal SphinxQL space now) * fixed xmlpipe2 K-lists * fixed #322 (safety gaps in mysql protocol row buffer) * fixed #313 (return keyword stats for empty indexes too) * fixed #344 (invalid checkpoints after merge) * fixed #326 (missing CLOCK_xxx on FreeBSD) A.4. Version 0.9.9-rc2, 08 apr 2009 =================================== * added IsConnectError(), Open(), Close() calls to Java API (bug #240) * added read_buffer, read_unhinted directives * added checks for build options returned by mysql_config (builds on Solaris now) * added fixed-RAM index merge (bug #169) * added logging chained queries count in case of (optimized) multi-queries * added GEODIST() function * added --status switch to searchd * added MySpell (OpenOffice) affix file support (bug #281) * added ODBC support (both Windows and UnixODBC) * added support for @id in IN() (bug #292) * added support for aggregate functions in GROUP BY (namely AVG, MAX, MIN, SUM) * added MySQL UDF that builds snippets using searchd * added write_buffer directive (defaults to 1M) * added xmlpipe_fixup_utf8 directive * added suggestions sample * added microsecond precision int64 timer (bug #282) * added listen_backlog directive * added max_xmlpipe2_field directive * added initial SphinxQL support to mysql41 handler, SELECT .../SHOW WARNINGS/STATUS/META are handled * added support for different network protocols, and mysql41 protocol * added fieldmask ranker, updated SphinxSE list of rankers * added mysql_ssl_xxx directives * added --cpustats (requires clock_gettime()) and --status switches to searchd * added performance counters, Status() API call * added overshort_step and stopword_step directives * added strict order operator (aka operator before, eg. "one << two << three") * added indextool utility, moved --dumpheader there, added --debugdocids, --dumphitlist options * added own RNG, reseeded on @random sort query (bug #183) * added field-start and field-end modifiers support (syntax is "^hello world$"; field-end requires reindex) * added MVA attribute support to IN() function * added AND, OR, and NOT support to expressions * improved logging of (optimized) multi-queries (now logging chained query count) * improved handshake error handling, fixed protocol version byte order (omg) * updated SphinxSE to protocol 1.22 * allowed phrase_boundary_step=-1 (trick to emulate keyword expansion) * removed SPH_MAX_QUERY_WORDS limit * fixed CLI search vs documents missing from DB (bug #257) * fixed libsphinxclient results leak on subsequent sphinx_run_queries call (bug #256) * fixed libsphinxclient handling of zero max_matches and cutoff (bug #208) * fixed Java API over-64K string reads (eg. big snippets) in Java API (bug #181) * fixed Java API 2nd Query() after network error in 1st Query() call (bug #308) * fixed typo-class bugs in SetFilterFloatRange (bug #259), SetSortMode (bug #248) * fixed missing @@relaxed support (bug #276), fixed missing error on @nosuchfield queries, documented @@relaxed * fixed UNIX socket permissions to 0777 (bug #288) * fixed xmlpipe2 crash on schemas with no fields, added better document structure checks * fixed (and optimized) expr parser vs IN() with huge (10K+) args count * fixed double EarlyCalc() in fullscan mode (minor performance impact) * fixed phrase boundary handling in some cases (on buffer end, on trailing whitespace) * fixes in snippets (aka excerpts) generation * fixed inline attrs vs id64 index corruption * fixed head searchd crash on config re-parse failure * fixed handling of numeric keywords with leading zeroes such as "007" (bug #251) * fixed junk in SphinxSE status variables (bug #304) * fixed wordlist checkpoints serialization (bug #236) * fixed unaligned docinfo id access (bug #230) * fixed GetRawBytes() vs oversized blocks (headers with over 32K charset_table should now work, bug #300) * fixed buffer overflow caused by too long dest wordform, updated tests * fixed IF() return type (was always int, is deduced now) * fixed legacy queries vs. special chars vs. multiple indexes * fixed write-write-read socket access pattern vs Nagle vs delays vs FreeBSD (oh wow) * fixed exceptions vs query-parser issue * fixed late calc vs @weight in expressions (bug #285) * fixed early lookup/calc vs filters (bug #284) * fixed emulated MATCH_ANY queries (empty proximity and phrase queries are allowed now) * fixed MATCH_ANY ranker vs fields with no matches * fixed index file size vs inplace_enable (bug #245) * fixed that old logs were not closed on USR1 (bug #221) * fixed handling of '!' alias to NOT operator (bug #237) * fixed error handling vs query steps (step failure was not reported) * fixed querying vs inline attributes * fixed stupid bug in escaping code, fixed EscapeString() and made it static * fixed parser vs @field -keyword, foo|@field bar, "" queries (bug #310) A.5. Version 0.9.9-rc1, 17 nov 2008 =================================== * added min_stemming_len directive * added IsConnectError() API call (helps distingusih API vs remote errors) * added duplicate log messages filter to searchd * added --nodetach debugging switch to searchd * added blackhole agents support for debugging/testing (agent_blackhole directive) * added max_filters, max_filter_values directives (were hardcoded before) * added int64 expression evaluation path, automatic inference, and BIGINT() enforcer function * added crash handler for debugging (crash_log_path directive) * added MS SQL (aka SQL Server) source support (Windows only, mssql_winauth and mssql_unicode directives) * added indexer-side column unpacking feature (unpack_zlib, unpack_mysqlcompress directives) * added nested brackers and NOTs support to query language, rewritten query parser * added persistent connections support (Open() and Close() API calls) * added index_exact_words feature, and exact form operator to query language ("hello =world") * added status variables support to SphinxSE (SHOW STATUS LIKE 'sphinx_%') * added max_packet_size directive (was hardcoded at 8M before) * added UNIX socket support, and multi-interface support (listen directive) * added star-syntax support to BuildExcerpts() API call * added inplace inversion of .spa and .spp (inplace_enable directive, 1.5-2x less disk space for indexing) * added builtin Czech stemmer (morphology=stem_cz) * added IDIV(), NOW(), INTERVAL(), IN() functions to expressions * added index-level early-reject based on filters * added MVA updates feature (mva_updates_pool directive) * added select-list feature with computed expressions support (see SetSelect() API call, test.php --select switch), protocol 1.22 * added integer expressions support (2x faster than float) * added multiforms support (multiple source words in wordforms file) * added legacy rankers (MATCH_ALL/MATCH_ANY/etc), removed legacy matching code (everything runs on V2 engine now) * added field position limit modifier to field operator (syntax: @title[50] hello world) * added killlist support (sql_query_killlist directive, --merge-killlists switch) * added on-disk SPI support (ondisk_dict directive) * added indexer IO stats * added periodic .spa flush (attr_flush_period directive) * added config reload on SIGHUP * added per-query attribute overrides feature (see SetOverride() API call); protocol 1.21 * added signed 64bit attrs support (sql_attr_bigint directive) * improved HTML stripper to also skip PIs (, such as ) * improved excerpts speed (upto 50x faster on big documents) * fixed a short window of searchd inaccessibility on startup (started listen()ing too early before) * fixed .spa loading on systems where read() is 2GB capped * fixed infixes vs morphology issues * fixed backslash escaping, added backslash to EscapeString() * fixed handling of over-2GB dictionary files (.spi) A.6. Version 0.9.8.1, 30 oct 2008 ================================= * added configure script to libsphinxclient * changed proximity/quorum operator syntax to require whitespace after length * fixed potential head process crash on SIGPIPE during "maxed out" message * fixed handling of incomplete remote replies (caused over-degraded distributed results, in rare cases) * fixed sending of big remote requests (caused distributed requests to fail, in rare cases) * fixed FD_SET() overflow (caused searchd to crash on startup, in rare cases) * fixed MVA vs distributed indexes (caused loss of 1st MVA value in result set) * fixed tokenizing of exceptions terminated by specials (eg. "GPS AT&T" in extended mode) * fixed buffer overrun in stemmer on overlong tokens occasionally emitted by proximity/quorum operator parser (caused crashes on certain proximity/quorum queries) * fixed wordcount ranker (could be dropping hits) * fixed --merge feature (numerous different fixes, caused broken indexes) * fixed --merge-dst-range performance * fixed prefix/infix generation for stopwords * fixed ignore_chars vs specials * fixed misplaced F_SETLKW check (caused certain build types, eg. RPM build on FC8, to fail) * fixed dictionary-defined charsets support in spelldump, added \x-style wordchars support * fixed Java API to properly send long strings (over 64K; eg. long document bodies for excerpts) * fixed Python API to accept offset/limit of 'long' type * fixed default ID range (that filtered out all 64-bit values) in Java and Python APIs A.7. Version 0.9.8, 14 jul 2008 =============================== Indexing -------- * added support for 64-bit document and keyword IDs, --enable-id64 switch to configure * added support for floating point attributes * added support for bitfields in attributes, sql_attr_bool directive and bit-widths part in sql_attr_uint directive * added support for multi-valued attributes (MVA) * added metaphone preprocessor * added libstemmer library support, provides stemmers for a number of additional languages * added xmlpipe2 source type, that supports arbitrary fields and attributes * added word form dictionaries, wordforms directive (and spelldump utility) * added tokenizing exceptions, exceptions directive * added an option to fully remove element contents to HTML stripper, html_remove_elements directive * added HTML entities decoder (with full XHTML1 set support) to HTML stripper * added per-index HTML stripping settings, html_strip, html_index_attrs, and html_remove_elements directives * added IO load throttling, max_iops and max_iosize directives * added SQL load throttling, sql_ranged_throttle directive * added an option to index prefixes/infixes for given fields only, prefix_fields and infix_fields directives * added an option to ignore certain characters (instead of just treating them as whitespace), ignore_chars directive * added an option to increment word position on phrase boundary characters, phrase_boundary and phrase_boundary_step directives * added --merge-dst-range switch (and filters) to index merging feature (--merge switch) * added mysql_connect_flags directive (eg. to reduce indexing time MySQL network traffic and/or time) * improved ordinals sorting; now runs in fixed RAM * improved handling of documents with zero/NULL ids, now skipping them instead of aborting Search daemon ------------- * added an option to unlink old index on succesful rotation, unlink_old directive * added an option to keep index files open at all times (fixes subtle races on rotation), preopen and preopen_indexes directives * added an option to profile searchd disk I/O, --iostats command-line option * added an option to rotate index seamlessly (fully avoids query stalls), seamless_rotate directive * added HTML stripping support to excerpts (uses per-index settings) * added 'exact_phrase', 'single_passage', 'use_boundaries', 'weight_order 'options to BuildExcerpts() API call * added distributed attribute updates propagation * added distributed retries on master node side * added log reopen on SIGUSR1 * added --stop switch (sends SIGTERM to running instance) * added Windows service mode, and --servicename switch * added Windows --rotate support * improved log timestamping, now with millisecond precision Querying -------- * added extended engine V2 (faster, cleaner, better; SPH_MATCH_EXTENDED2 mode) * added ranking modes support (V2 engine only; SetRankingMode() API call) * added quorum searching support to query language (V2 engine only; example: "any three of all these words"/3) * added query escaping support to query language, and EscapeString() API call * added multi-field syntax support to query language (example: "@(field1,field2) something"), and @@relaxed field checks option * added optional star-syntax ('word*') support in keywords, enable_star directive (for prefix/infix indexes only) * added full-scan support (query must be fully empty; can perform block-reject optimization) * added COUNT(DISTINCT(attr)) calculation support, SetGroupDistinct() API call * added group-by on MVA support, SetArrayResult() PHP API call * added per-index weights feature, SetIndexWeights() API call * added geodistance support, SetGeoAnchor() API call * added result set sorting by arbitrary expressions in run time (eg. "@weight+log(price)*2.5"), SPH_SORT_EXPR mode * added result set sorting by @custom compile-time sorting function (see src/sphinxcustomsort.inl) * added result set sorting by @random value * added result set merging for indexes with different schemas * added query comments support (3rd arg to Query()/AddQuery() API calls, copied verbatim to query log) * added keyword extraction support, BuildKeywords() API call * added binding field weights by name, SetFieldWeights() API call * added optional limit on query time, SetMaxQueryTime() API call * added optional limit on found matches count (4rd arg to SetLimits() API call, so-called 'cutoff') APIs and SphinxSE ----------------- * added pure C API (libsphinxclient) * added Ruby API (thanks to Dmytro Shteflyuk) * added Java API * added SphinxSE support for MVAs (use varchar), floats (use float), 64bit docids (use bigint) * added SphinxSE options "floatrange", "geoanchor", "fieldweights", "indexweights", "maxquerytime", "comment", "host" and "port"; and support for "expr:CLAUSE" * improved SphinxSE max query size (using MySQL condition pushdown), upto 256K now General ------- * added scripting (shebang syntax) support to config files (example: #!/usr/bin/php in the first line) * added unified config handling and validation to all programs * added unified documentation * added .spec file for RPM builds * added automated testing suite * improved index locking, now fcntl()-based instead of buggy file-existence-based * fixed unaligned RAM accesses, now works on SPARC and ARM Changes and fixes since 0.9.8-rc2 --------------------------------- * added pure C API (libsphinxclient) * added Ruby API * added SetConnectTimeout() PHP API call * added allowed type check to UpdateAttributes() handler (bug #174) * added defensive MVA checks on index preload (protection against broken indexes, bug #168) * added sphinx-min.conf sample file * added --without-iconv switch to configure * removed redundant -lz dependency in searchd * removed erroneous "xmlpipe2 deprecated" warning * fixed EINTR handling in piped read (bug #166) * fixup query time before logging and sending to client (bug #153) * fixed attribute updates vs full-scan early-reject index (bug #149) * fixed gcc warnings (bug #160) * fixed mysql connection attempt vs pgsql source type (bug #165) * fixed 32-bit wraparound when preloading over 2 GB files * fixed "out of memory" message vs over 2 GB allocs (bug #116) * fixed unaligned RAM access detection on ARM (where unaligned reads do not crash but produce wrong results) * fixed missing full scan results in some cases * fixed several bugs in --merge, --merge-dst-range * fixed @geodist vs MultiQuery and filters, @expr vs MultiQuery * fixed GetTokenEnd() vs 1-grams (was causing crash in excerpts) * fixed sql_query_range to handle empty strings in addition to NULL strings (Postgres specific) * fixed morphology=none vs infixes * fixed case sensitive attributes names in UpdateAttributes() * fixed ext2 ranking vs. stopwords (now using atompos from query parser) * fixed EscapeString() call * fixed escaped specials (now handled as whitespace if not in charset) * fixed schema minimizer (now handles type/size mismatches) * fixed word stats in extended2; stemmed form is now returned * fixed spelldump case folding vs dictionary-defined character sets * fixed Postgres BOOLEAN handling * fixed enforced "inline" docinfo on empty indexes (normally ok, but index merge was really confused) * fixed rare count(distinct) out-of-bounds issue (it occasionaly caused too high @distinct values) * fixed hangups on documents with id=DOCID_MAX in some cases * fixed rare crash in tokenizer (prefixed synonym vs. input stream eof) * fixed query parser vs "aaa (bbb ccc)|ddd" queries * fixed BuildExcerpts() request in Java API * fixed Postgres specific memory leak * fixed handling of overshort keywords (less than min_word_len) * fixed HTML stripper (now emits space after indexed attributes) * fixed 32-field case in query parser * fixed rare count(distinct) vs. querying multiple local indexes vs. reusable sorter issue * fixed sorting of negative floats in SPH_SORT_EXTENDED mode A.8. Version 0.9.7, 02 apr 2007 =============================== * added support for sql_str2ordinal_column * added support for upto 5 sort-by attrs (in extended sorting mode) * added support for separate groups sorting clause (in group-by mode) * added support for on-the-fly attribute updates (PRE-ALPHA; will change heavily; use for preliminary testing ONLY) * added support for zero/NULL attributes * added support for 0.9.7 features to SphinxSE * added support for n-grams (alpha, 1-grams only for now) * added support for warnings reported to client * added support for exclude-filters * added support for prefix and infix indexing (see max_prefix_len, max_infix_len) * added @* syntax to reset current field to query language * added removal of duplicate entries in query index order * added PHP API workarounds for PHP signed/unsigned braindamage * added locks to avoid two concurrent indexers working on same index * added check for existing attributes vs. docinfo=none case * improved groupby code a lot (better precision, and upto 25x times faster in extreme cases) * improved error handling and reporting * improved handling of broken indexes (reports error instead of hanging/crashing) * improved mmap() limits for attributes and wordlists (now able to map over 4 GB on x64 and over 2 GB on x32 where possible) * improved malloc() pressure in head daemon (search time should not degrade with time any more) * improved test.php command line options * improved error reporting (distributed query, broken index etc issues now reported to client) * changed default network packet size to be 8M, added extra checks * fixed division by zero in BM25 on 1-document collections (in extended matching mode) * fixed .spl files getting unlinked * fixed crash in schema compatibility test * fixed UTF-8 Russian stemmer * fixed requested matches count when querying distributed agents * fixed signed vs. unsigned issues everywhere (ranged queries, CLI search output, and obtaining docid) * fixed potential crashes vs. negative query offsets * fixed 0-match docs vs. extended mode vs. stats * fixed group/timestamp filters being ignored if querying from older clients * fixed docs to mention pgsql source type * fixed issues with explicit '&' in extended matching mode * fixed wrong assertion in SBCS encoder * fixed crashes with no-attribute indexes after rotate A.9. Version 0.9.7-rc2, 15 dec 2006 =================================== * added support for extended matching mode (query language) * added support for extended sorting mode (sorting clauses) * added support for SBCS excerpts * added mmap()ing for attributes and wordlist (improves search time, speeds up fork() greatly) * fixed attribute name handling to be case insensitive * fixed default compiler options to simplify post-mortem debugging (added -g, removed -fomit-frame-pointer) * fixed rare memory leak * fixed "hello hello" queries in "match phrase" mode * fixed issue with excerpts, texts and overlong queries * fixed logging multiple index name (no longer tokenized) * fixed trailing stopword not flushed from tokenizer * fixed boolean evaluation * fixed pidfile being wrongly unlink()ed on bind() failure * fixed --with-mysql-includes/libs (they conflicted with well-known paths) * fixes for 64-bit platforms A.10. Version 0.9.7-rc1, 26 oct 2006 ==================================== * added alpha index merging code * added an option to decrease max_matches per-query * added an option to specify IP address for searchd to listen on * added support for unlimited amount of configured sources and indexes * added support for group-by queries * added support for /2 range modifier in charset_table * added support for arbitrary amount of document attributes * added logging filter count and index name * added --with-debug option to configure to compile in debug mode * added -DNDEBUG when compiling in default mode * improved search time (added doclist size hints, in-memory wordlist cache, and used VLB coding everywhere) * improved (refactored) SQL driver code (adding new drivers should be very easy now) * improved exceprts generation * fixed issue with empty sources and ranged queries * fixed querying purely remote distributed indexes * fixed suffix length check in English stemmer in some cases * fixed UTF-8 decoder for codes over U+20000 (for CJK) * fixed UTF-8 encoder for 3-byte sequences (for CJK) * fixed overshort (less than min_word_len) words prepended to next field * fixed source connection order (indexer does not connect to all sources at once now) * fixed line numbering in config parser * fixed some issues with index rotation A.11. Version 0.9.6, 24 jul 2006 ================================ * added support for empty indexes * added support for multiple sql_query_pre/post/post_index * fixed timestamp ranges filter in "match any" mode * fixed configure issues with --without-mysql and --with-pgsql options * fixed building on Solaris 9 A.12. Version 0.9.6-rc1, 26 jun 2006 ==================================== * added boolean queries support (experimental, beta version) * added simple file-based query cache (experimental, beta version) * added storage engine for MySQL 5.0 and 5.1 (experimental, beta version) * added GNU style configure script * added new searchd protocol (all binary, and should be backwards compatible) * added distributed searching support to searchd * added PostgreSQL driver * added excerpts generation * added min_word_len option to index * added max_matches option to searchd, removed hardcoded MAX_MATCHES limit * added initial documentation, and a working example.sql * added support for multiple sources per index * added soundex support * added group ID ranges support * added --stdin command-line option to search utility * added --noprogress option to indexer * added --index option to search * fixed UTF-8 decoder (3-byte codepoints did not work) * fixed PHP API to handle big result sets faster * fixed config parser to handle empty values properly * fixed redundant time(NULL) calls in time-segments mode --eof-- coreseek-4.1-beta/csft-4.1/doc/sphinx.xml100777 0 0 2003773 11643565731 13354 0 ]> Sphinx 2.0.1-beta reference manual Free open-source SQL full-text search engine 2001-2011 Andrew Aksyonoff 2008-2011 Sphinx Technologies Inc, http://sphinxsearch.com Introduction About Sphinx is a full-text search engine, publicly distributed under GPL version 2. Commercial licensing (eg. for embedded use) is available upon request. Technically, Sphinx is a standalone software package provides fast and relevant full-text search functionality to client applications. It was specially designed to integrate well with SQL databases storing the data, and to be easily accessed scripting languages. However, Sphinx does not depend on nor require any specific database to function. Applications can access Sphinx search daemon (searchd) using any of the three different access methods: a) via native search API (SphinxAPI), b) via Sphinx own implementation of MySQL network protocol (using a small SQL subset called SphinxQL), or c) via MySQL server with a pluggable storage engine (SphinxSE). Official native SphinxAPI implementations for PHP, Perl, Ruby, and Java are included within the distribution package. API is very lightweight so porting it to a new language is known to take a few hours or days. Third party API ports and plugins exist for Perl, C#, Haskell, Ruby-on-Rails, and possibly other languages and frameworks. Starting version 1.10-beta, Sphinx supports two different indexing backends: "disk" index backend, and "realtime" (RT) index backend. Disk indexes support online full-text index rebuilds, but online updates can only be done on non-text (attribute) data. RT indexes additionally allow for online full-text index updates. Previous versions only supported disk indexes. Data can be loaded into disk indexes using a so-called data source. Built-in sources can fetch data directly from MySQL, PostgreSQL, ODBC compliant database (MS SQL, Oracle, etc), or a pipe in a custom XML format. Adding new data sources drivers (eg. to natively support other DBMSes) is designed to be as easy as possible. RT indexes, as of 1.10-beta, can only be populated using SphinxQL. As for the name, Sphinx is an acronym which is officially decoded as SQL Phrase Index. Yes, I know about CMU's Sphinx project. Sphinx features Key Sphinx features are: high indexing and searching performance; advanced indexing and querying tools (flexible and feature-rich text tokenizer, querying language, several different ranking modes, etc); advanced result set post-processing (SELECT with expressions, WHERE, ORDER BY, GROUP BY etc over text search results); proven scalability up to billions of documents, terabytes of data, and thousands of queries per second; easy integration with SQL and XML data sources, and SphinxAPI, SphinxQL, or SphinxSE search interfaces; easy scaling with distributed searches. To expand a bit, Sphinx: has high indexing speed (upto 10-15 MB/sec per core on an internal benchmark); has high search speed (upto 150-250 queries/sec per core against 1,000,000 documents, 1.2 GB of data on an internal benchmark); has high scalability (biggest known cluster indexes over 3,000,000,000 documents, and busiest one peaks over 50,000,000 queries/day); provides good relevance ranking through combination of phrase proximity ranking and statistical (BM25) ranking; provides distributed searching capabilities; provides document excerpts (snippets) generation; provides searching from within application with SphinxAPI or SphinxQL interfaces, and from within MySQL with pluggable SphinxSE storage engine; supports boolean, phrase, word proximity and other types of queries; supports multiple full-text fields per document (upto 32 by default); supports multiple additional attributes per document (ie. groups, timestamps, etc); supports stopwords; supports morphological word forms dictionaries; supports tokenizing exceptions; supports both single-byte encodings and UTF-8; supports stemming (stemmers for English, Russian and Czech are built-in; and stemmers for French, Spanish, Portuguese, Italian, Romanian, German, Dutch, Swedish, Norwegian, Danish, Finnish, Hungarian, are available by building third party libstemmer library); supports MySQL natively (all types of tables, including MyISAM, InnoDB, NDB, Archive, etc are supported); supports PostgreSQL natively; supports ODBC compliant databases (MS SQL, Oracle, etc) natively; ...has 50+ other features not listed here, refer to API and configuration manual! Where to get Sphinx Sphinx is available through its official Web site at http://sphinxsearch.com/. Currently, Sphinx distribution tarball includes the following software: indexer: an utility which creates fulltext indexes; search: a simple command-line (CLI) test utility which searches through fulltext indexes; searchd: a daemon which enables external software (eg. Web applications) to search through fulltext indexes; sphinxapi: a set of searchd client API libraries for popular Web scripting languages (PHP, Python, Perl, Ruby). spelldump: a simple command-line tool to extract the items from an ispell or MySpell (as bundled with OpenOffice) format dictionary to help customize your index, for use with wordforms. indextool: an utility to dump miscellaneous debug information about the index, added in version 0.9.9-rc2. License 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. See COPYING file for details. 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, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Non-GPL licensing (for OEM/ISV embedded use) can also be arranged, please contact us to discuss commercial licensing possibilities. Credits Author Sphinx initial author (and a benevolent dictator ever since): Andrew Aksyonoff, http://shodan.ru Team Past and present employees of Sphinx Technologies Inc who should be noted on their work on Sphinx (in alphabetical order): Alexander Klimenko Alexey Dvoichenkov Alexey Vinogradov Ilya Kuznetsov Stanislav Klinov Contributors People who contributed to Sphinx and their contributions (in no particular order): Robert "coredev" Bengtsson (Sweden), initial version of PostgreSQL data source Len Kranendonk, Perl API Dmytro Shteflyuk, Ruby API Many other people have contributed ideas, bug reports, fixes, etc. Thank you! History Sphinx development was started back in 2001, because I didn't manage to find an acceptable search solution (for a database driven Web site) which would meet my requirements. Actually, each and every important aspect was a problem: search quality (ie. good relevance) statistical ranking methods performed rather bad, especially on large collections of small documents (forums, blogs, etc) search speed especially if searching for phrases which contain stopwords, as in "to be or not to be" moderate disk and CPU requirements when indexing important in shared hosting enivronment, not to mention the indexing speed. Despite the amount of time passed and numerous improvements made in the other solutions, there's still no solution which I personally would be eager to migrate to. Considering that and a lot of positive feedback received from Sphinx users during last years, the obvious decision is to continue developing Sphinx (and, eventually, to take over the world). Installation Supported systems Most modern UNIX systems with a C++ compiler should be able to compile and run Sphinx without any modifications. Currently known systems Sphinx has been successfully running on are: Linux 2.4.x, 2.6.x (many various distributions) Windows 2000, XP FreeBSD 4.x, 5.x, 6.x, 7.x NetBSD 1.6, 3.0 Solaris 9, 11 Mac OS X CPU architectures known to work include X86, X86-64, SPARC64, ARM. Chance are good that Sphinx should work on other Unix platforms as well; please report any platforms missing from this list that worked for you! Required tools On UNIX, you will need the following tools to build and install Sphinx: a working C++ compiler. GNU gcc is known to work. a good make program. GNU make is known to work. On Windows, you will need Microsoft Visual C/C++ Studio .NET 2003 or 2005. Other compilers/environments will probably work as well, but for the time being, you will have to build makefile (or other environment specific project files) manually. Installing Sphinx on Linux Extract everything from the distribution tarball (haven't you already?) and go to the sphinx subdirectory. (We are using version 2.0.1-beta here for the sake of example only; be sure to change this to a specific version you're using.) $ tar xzvf sphinx-2.0.1-beta.tar.gz $ cd sphinx Run the configuration program: $ ./configure There's a number of options to configure. The complete listing may be obtained by using switch. The most important ones are: , which specifies where to install Sphinx; such as (all of the examples use this prefix) , which specifies where to look for MySQL include and library files, if auto-detection fails; , which specifies where to look for PostgreSQL include and library files. Build the binaries: $ make Install the binaries in the directory of your choice: (defaults to /usr/local/bin/ on *nix systems, but is overridden with ) $ make install Installing Sphinx on Windows Installing Sphinx on a Windows server is often easier than installing on a Linux environment; unless you are preparing code patches, you can use the pre-compiled binary files from the Downloads area on the website. Extract everything from the .zip file you have downloaded - sphinx-2.0.1-beta-win32.zip, or sphinx-2.0.1-beta-win32-pgsql.zip if you need PostgresSQL support as well. (We are using version 2.0.1-beta here for the sake of example only; be sure to change this to a specific version you're using.) You can use Windows Explorer in Windows XP and up to extract the files, or a freeware package like 7Zip to open the archive. For the remainder of this guide, we will assume that the folders are unzipped into C:\Sphinx, such that searchd.exe can be found in C:\Sphinx\bin\searchd.exe. If you decide to use any different location for the folders or configuration file, please change it accordingly. Edit the contents of sphinx.conf.in - specifically entries relating to @CONFDIR@ - to paths suitable for your system. Install the searchd system as a Windows service: C:\Sphinx\bin> C:\Sphinx\bin\searchd --install --config C:\Sphinx\sphinx.conf.in --servicename SphinxSearch The searchd service will now be listed in the Services panel within the Management Console, available from Administrative Tools. It will not have been started, as you will need to configure it and build your indexes with indexer before starting the service. A guide to do this can be found under Quick tour. During the next steps of the install (which involve running indexer pretty much as you would on Linux) you may find that you get an error relating to libmysql.dll not being found. If you have MySQL installed, you should find a copy of this library in your Windows directory, or sometimes in Windows\System32, or failing that in the MySQL core directories. If you do receive an error please copy libmysql.dll into the bin directory. Known installation issues If configure fails to locate MySQL headers and/or libraries, try checking for and installing mysql-devel package. On some systems, it is not installed by default. If make fails with a message which look like /bin/sh: g++: command not found make[1]: *** [libsphinx_a-sphinx.o] Error 127 try checking for and installing gcc-c++ package. If you are getting compile-time errors which look like sphinx.cpp:67: error: invalid application of `sizeof' to incomplete type `Private::SizeError<false>' this means that some compile-time type size check failed. The most probable reason is that off_t type is less than 64-bit on your system. As a quick hack, you can edit sphinx.h and replace off_t with DWORD in a typedef for SphOffset_t, but note that this will prohibit you from using full-text indexes larger than 2 GB. Even if the hack helps, please report such issues, providing the exact error message and compiler/OS details, so I could properly fix them in next releases. If you keep getting any other error, or the suggestions above do not seem to help you, please don't hesitate to contact me. Quick Sphinx usage tour All the example commands below assume that you installed Sphinx in /usr/local/sphinx, so searchd can be found in /usr/local/sphinx/bin/searchd. To use Sphinx, you will need to: Create a configuration file. Default configuration file name is sphinx.conf. All Sphinx programs look for this file in current working directory by default. Sample configuration file, sphinx.conf.dist, which has all the options documented, is created by configure. Copy and edit that sample file to make your own configuration: (assuming Sphinx is installed into /usr/local/sphinx/) $ cd /usr/local/sphinx/etc $ cp sphinx.conf.dist sphinx.conf $ vi sphinx.conf Sample configuration file is setup to index documents table from MySQL database test; so there's example.sql sample data file to populate that table with a few documents for testing purposes: $ mysql -u test < /usr/local/sphinx/etc/example.sql Run the indexer to create full-text index from your data: $ cd /usr/local/sphinx/etc $ /usr/local/sphinx/bin/indexer --all Query your newly created index! To query the index from command line, use search utility: $ cd /usr/local/sphinx/etc $ /usr/local/sphinx/bin/search test To query the index from your PHP scripts, you need to: Run the search daemon which your script will talk to: $ cd /usr/local/sphinx/etc $ /usr/local/sphinx/bin/searchd Run the attached PHP API test script (to ensure that the daemon was succesfully started and is ready to serve the queries): $ cd sphinx/api $ php test.php test Include the API (it's located in api/sphinxapi.php) into your own scripts and use it. Happy searching! Indexing Data sources The data to be indexed can generally come from very different sources: SQL databases, plain text files, HTML files, mailboxes, and so on. From Sphinx point of view, the data it indexes is a set of structured documents, each of which has the same set of fields. This is biased towards SQL, where each row correspond to a document, and each column to a field. Depending on what source Sphinx should get the data from, different code is required to fetch the data and prepare it for indexing. This code is called data source driver (or simply driver or data source for brevity). At the time of this writing, there are drivers for MySQL and PostgreSQL databases, which can connect to the database using its native C/C++ API, run queries and fetch the data. There's also a driver called xmlpipe, which runs a specified command and reads the data from its stdout. See section for the format description. There can be as many sources per index as necessary. They will be sequentially processed in the very same order which was specifed in index definition. All the documents coming from those sources will be merged as if they were coming from a single source. Attributes Attributes are additional values associated with each document that can be used to perform additional filtering and sorting during search. It is often desired to additionally process full-text search results based not only on matching document ID and its rank, but on a number of other per-document values as well. For instance, one might need to sort news search results by date and then relevance, or search through products within specified price range, or limit blog search to posts made by selected users, or group results by month. To do that efficiently, Sphinx allows to attach a number of additional attributes to each document, and store their values in the full-text index. It's then possible to use stored values to filter, sort, or group full-text matches. Attributes, unlike the fields, are not full-text indexed. They are stored in the index, but it is not possible to search them as full-text, and attempting to do so results in an error. For example, it is impossible to use the extended matching mode expression to match documents where column is 1, if column is an attribute, and this is still true even if the numeric digits are normally indexed. Attributes can be used for filtering, though, to restrict returned rows, as well as sorting or result grouping; it is entirely possible to sort results purely based on attributes, and ignore the search relevance tools. Additionally, attributes are returned from the search daemon, while the indexed text is not. A good example for attributes would be a forum posts table. Assume that only title and content fields need to be full-text searchable - but that sometimes it is also required to limit search to a certain author or a sub-forum (ie. search only those rows that have some specific values of author_id or forum_id columns in the SQL table); or to sort matches by post_date column; or to group matching posts by month of the post_date and calculate per-group match counts. This can be achieved by specifying all the mentioned columns (excluding title and content, that are full-text fields) as attributes, indexing them, and then using API calls to setup filtering, sorting, and grouping. Here as an example. Example sphinx.conf part: ... sql_query = SELECT id, title, content, \ author_id, forum_id, post_date FROM my_forum_posts sql_attr_uint = author_id sql_attr_uint = forum_id sql_attr_timestamp = post_date ... Example application code (in PHP): // only search posts by author whose ID is 123 $cl->SetFilter ( "author_id", array ( 123 ) ); // only search posts in sub-forums 1, 3 and 7 $cl->SetFilter ( "forum_id", array ( 1,3,7 ) ); // sort found posts by posting date in descending order $cl->SetSortMode ( SPH_SORT_ATTR_DESC, "post_date" ); Attributes are named. Attribute names are case insensitive. Attributes are not full-text indexed; they are stored in the index as is. Currently supported attribute types are: unsigned integers (1-bit to 32-bit wide); UNIX timestamps; floating point values (32-bit, IEEE 754 single precision); string ordinals (specially computed integers); strings (since 1.10-beta); MVA, multi-value attributes (variable-length lists of 32-bit unsigned integers). The complete set of per-document attribute values is sometimes referred to as docinfo. Docinfos can either be stored separately from the main full-text index data ("extern" storage, in .spa file), or attached to each occurence of document ID in full-text index data ("inline" storage, in .spd file). When using extern storage, a copy of .spa file (with all the attribute values for all the documents) is kept in RAM by searchd at all times. This is for performance reasons; random disk I/O would be too slow. On the contrary, inline storage does not require any additional RAM at all, but that comes at the cost of greatly inflating the index size: remember that it copies all attribute value every time when the document ID is mentioned, and that is exactly as many times as there are different keywords in the document. Inline may be the only viable option if you have only a few attributes and need to work with big datasets in limited RAM. However, in most cases extern storage makes both indexing and searching much more efficient. Search-time memory requirements for extern storage are (1+number_of_attrs)*number_of_docs*4 bytes, ie. 10 million docs with 2 groups and 1 timestamp will take (1+2+1)*10M*4 = 160 MB of RAM. This is PER DAEMON, not per query. searchd will allocate 160 MB on startup, read the data and keep it shared between queries. The children will NOT allocate any additional copies of this data. MVA (multi-valued attributes) MVAs, or multi-valued attributes, are an important special type of per-document attributes in Sphinx. MVAs make it possible to attach lists of values to every document. They are useful for article tags, product categories, etc. Filtering and group-by (but not sorting) on MVA attributes is supported. Currently, MVA list entries are limited to unsigned 32-bit integers. The list length is not limited, you can have an arbitrary number of values attached to each document as long as RAM permits (.spm file that contains the MVA values will be precached in RAM by searchd). The source data can be taken either from a separate query, or from a document field; see source type in sql_attr_multi. In the first case the query will have to return pairs of document ID and MVA values, in the second one the field will be parsed for integer values. There are absolutely no requirements as to incoming data order; the values will be automatically grouped by document ID (and internally sorted within the same ID) during indexing anyway. When filtering, a document will match the filter on MVA attribute if any of the values satisfy the filtering condition. (Therefore, documents that pass through exclude filters will not contain any of the forbidden values.) When grouping by MVA attribute, a document will contribute to as many groups as there are different MVA values associated with that document. For instance, if the collection contains exactly 1 document having a 'tag' MVA with values 5, 7, and 11, grouping on 'tag' will produce 3 groups with '@count' equal to 1 and '@groupby' key values of 5, 7, and 11 respectively. Also note that grouping by MVA might lead to duplicate documents in the result set: because each document can participate in many groups, it can be chosen as the best one in in more than one group, leading to duplicate IDs. PHP API historically uses ordered hash on the document ID for the resulting rows; so you'll also need to use SetArrayResult() in order to employ group-by on MVA with PHP API. Indexes To be able to answer full-text search queries fast, Sphinx needs to build a special data structure optimized for such queries from your text data. This structure is called index; and the process of building index from text is called indexing. Different index types are well suited for different tasks. For example, a disk-based tree-based index would be easy to update (ie. insert new documents to existing index), but rather slow to search. Therefore, Sphinx architecture allows for different index types to be implemented easily. The only index type which is implemented in Sphinx at the moment is designed for maximum indexing and searching speed. This comes at a cost of updates being really slow; theoretically, it might be slower to update this type of index than than to reindex it from scratch. However, this very frequently could be worked around with muiltiple indexes, see for details. It is planned to implement more index types, including the type which would be updateable in real time. There can be as many indexes per configuration file as necessary. indexer utility can reindex either all of them (if option is specified), or a certain explicitly specified subset. searchd utility will serve all the specified indexes, and the clients can specify what indexes to search in run time. Restrictions on the source data There are a few different restrictions imposed on the source data which is going to be indexed by Sphinx, of which the single most important one is: ALL DOCUMENT IDS MUST BE UNIQUE UNSIGNED NON-ZERO INTEGER NUMBERS (32-BIT OR 64-BIT, DEPENDING ON BUILD TIME SETTINGS). If this requirement is not met, different bad things can happen. For instance, Sphinx can crash with an internal assertion while indexing; or produce strange results when searching due to conflicting IDs. Also, a 1000-pound gorilla might eventually come out of your display and start throwing barrels at you. You've been warned. Charsets, case folding, and translation tables When indexing some index, Sphinx fetches documents from the specified sources, splits the text into words, and does case folding so that "Abc", "ABC" and "abc" would be treated as the same word (or, to be pedantic, term). To do that properly, Sphinx needs to know what encoding is the source text in; what characters are letters and what are not; what letters should be folded to what letters. This should be configured on a per-index basis using and options. specifies whether the document encoding is single-byte (SBCS) or UTF-8. specifies the table that maps letter characters to their case folded versions. The characters that are not in the table are considered to be non-letters and will be treated as word separators when indexing or searching through this index. Note that while default tables do not include space character (ASCII code 0x20, Unicode U+0020) as a letter, it's in fact perfectly legal to do so. This can be useful, for instance, for indexing tag clouds, so that space-separated word sets would index as a single search query term. Default tables currently include English and Russian characters. Please do submit your tables for other languages! SQL data sources (MySQL, PostgreSQL) With all the SQL drivers, indexing generally works as follows. connection to the database is established; pre-query (see ) is executed to perform any necessary initial setup, such as setting per-connection encoding with MySQL; main query (see ) is executed and the rows it returns are indexed; post-query (see ) is executed to perform any necessary cleanup; connection to the database is closed; indexer does the sorting phase (to be pedantic, index-type specific post-processing); connection to the database is established again; post-index query (see ) is executed to perform any necessary final cleanup; connection to the database is closed again. Most options, such as database user/host/password, are straightforward. However, there are a few subtle things, which are discussed in more detail here. Ranged queries Main query, which needs to fetch all the documents, can impose a read lock on the whole table and stall the concurrent queries (eg. INSERTs to MyISAM table), waste a lot of memory for result set, etc. To avoid this, Sphinx supports so-called ranged queries. With ranged queries, Sphinx first fetches min and max document IDs from the table, and then substitutes different ID intervals into main query text and runs the modified query to fetch another chunk of documents. Here's an example. Ranged query usage example # in sphinx.conf sql_query_range = SELECT MIN(id),MAX(id) FROM documents sql_range_step = 1000 sql_query = SELECT * FROM documents WHERE id>=$start AND id<=$end If the table contains document IDs from 1 to, say, 2345, then sql_query would be run three times: with replaced with 1 and replaced with 1000; with replaced with 1001 and replaced with 2000; with replaced with 2000 and replaced with 2345. Obviously, that's not much of a difference for 2000-row table, but when it comes to indexing 10-million-row MyISAM table, ranged queries might be of some help. vs. The difference between post-query and post-index query is in that post-query is run immediately when Sphinx received all the documents, but further indexing may still fail for some other reason. On the contrary, by the time the post-index query gets executed, it is guaranteed that the indexing was succesful. Database connection is dropped and re-established because sorting phase can be very lengthy and would just timeout otherwise. xmlpipe data source xmlpipe data source was designed to enable users to plug data into Sphinx without having to implement new data sources drivers themselves. It is limited to 2 fixed fields and 2 fixed attributes, and is deprecated in favor of now. For new streams, use xmlpipe2. To use xmlpipe, configure the data source in your configuration file as follows: source example_xmlpipe_source { type = xmlpipe xmlpipe_command = perl /www/mysite.com/bin/sphinxpipe.pl } The indexer will run the command specified in , and then read, parse and index the data it prints to stdout. More formally, it opens a pipe to given command and then reads from that pipe. indexer will expect one or more documents in custom XML format. Here's the example document stream, consisting of two documents: XMLpipe document stream <document> <id>123</id> <group>45</group> <timestamp>1132223498</timestamp> <title>test title</title> <body> this is my document body </body> </document> <document> <id>124</id> <group>46</group> <timestamp>1132223498</timestamp> <title>another test</title> <body> this is another document </body> </document> Legacy xmlpipe legacy driver uses a builtin parser which is pretty fast but really strict and does not actually fully support XML. It requires that all the fields must be present, formatted exactly as in this example, and occur exactly in the same order. The only optional field is ; it defaults to 1. xmlpipe2 data source xmlpipe2 lets you pass arbitrary full-text and attribute data to Sphinx in yet another custom XML format. It also allows to specify the schema (ie. the set of fields and attributes) either in the XML stream itself, or in the source settings. When indexing xmlpipe2 source, indexer runs the given command, opens a pipe to its stdout, and expects well-formed XML stream. Here's sample stream data: xmlpipe2 document stream <?xml version="1.0" encoding="utf-8"?> <sphinx:docset> <sphinx:schema> <sphinx:field name="subject"/> <sphinx:field name="content"/> <sphinx:attr name="published" type="timestamp"/> <sphinx:attr name="author_id" type="int" bits="16" default="1"/> </sphinx:schema> <sphinx:document id="1234"> <content>this is the main content <![CDATA[[and this <cdata> entry must be handled properly by xml parser lib]]></content> <published>1012325463</published> <subject>note how field/attr tags can be in <b class="red">randomized</b> order</subject> <misc>some undeclared element</misc> </sphinx:document> <sphinx:document id="1235"> <subject>another subject</subject> <content>here comes another document, and i am given to understand, that in-document field order must not matter, sir</content> <published>1012325467</published> </sphinx:document> <!-- ... even more sphinx:document entries here ... --> <sphinx:killlist> <id>1234</id> <id>4567</id> </sphinx:killlist> </sphinx:docset> Arbitrary fields and attributes are allowed. They also can occur in the stream in arbitrary order within each document; the order is ignored. There is a restriction on maximum field length; fields longer than 2 MB will be truncated to 2 MB (this limit can be changed in the source). The schema, ie. complete fields and attributes list, must be declared before any document could be parsed. This can be done either in the configuration file using and settings, or right in the stream using <sphinx:schema> element. <sphinx:schema> is optional. It is only allowed to occur as the very first sub-element in <sphinx:docset>. If there is no in-stream schema definition, settings from the configuration file will be used. Otherwise, stream settings take precedence. Unknown tags (which were not declared neither as fields nor as attributes) will be ignored with a warning. In the example above, <misc> will be ignored. All embedded tags and their attributes (such as <b> in <subject> in the example above) will be silently ignored. Support for incoming stream encodings depends on whether iconv is installed on the system. xmlpipe2 is parsed using libexpat parser that understands US-ASCII, ISO-8859-1, UTF-8 and a few UTF-16 variants natively. Sphinx configure script will also check for libiconv presence, and utilize it to handle other encodings. libexpat also enforces the requirement to use UTF-8 charset on Sphinx side, because the parsed data it returns is always in UTF-8. XML elements (tags) recognized by xmlpipe2 (and their attributes where applicable) are: sphinx:docset Mandatory top-level element, denotes and contains xmlpipe2 document set. sphinx:schema Optional element, must either occur as the very first child of sphinx:docset, or never occur at all. Declares the document schema. Contains field and attribute declarations. If present, overrides per-source settings from the configuration file. sphinx:field Optional element, child of sphinx:schema. Declares a full-text field. Known attributes are: "name", specifies the XML element name that will be treated as a full-text field in the subsequent documents. "attr", specifies whether to also index this field as a string or word count attribute. Possible values are "string" and "wordcount". Introduced in version 1.10-beta. sphinx:attr Optional element, child of sphinx:schema. Declares an attribute. Known attributes are: "name", specifies the element name that should be treated as an attribute in the subsequent documents. "type", specifies the attribute type. Possible values are "int", "timestamp", "str2ordinal", "bool", "float" and "multi". "bits", specifies the bit size for "int" attribute type. Valid values are 1 to 32. "default", specifies the default value for this attribute that should be used if the attribute's element is not present in the document. sphinx:document Mandatory element, must be a child of sphinx:docset. Contains arbitrary other elements with field and attribute values to be indexed, as declared either using sphinx:field and sphinx:attr elements or in the configuration file. The only known attribute is "id" that must contain the unique integer document ID. sphinx:killlist Optional element, child of sphinx:docset. Contains a number of "id" elements whose contents are document IDs to be put into a kill-list for this index. Live index updates There are two major approaches to maintaining the full-text index contents up to date. Note, however, that both these approaches deal with the task of full-text data updates, and not attribute updates. Instant attribute updates are supported since version 0.9.8. Refer to UpdateAttributes() API call description for details. First, you can use disk-based indexes, partition them manually, and only rebuild the smaller partitions (so-called "deltas") frequently. By minimizing the rebuild size, you can reduce the average indexing lag to something as low as 30-60 seconds. This approach was the the only one available in versions 0.9.x. On huge collections it actually might be the most efficient one. Refer to for details. Second, versions 1.x (starting with 1.10-beta) add support for so-called real-time indexes (RT indexes for short) that on-the-fly updates of the full-text data. Updates on a RT index can appear in the search results in 1-2 milliseconds, ie. 0.001-0.002 seconds. However, RT index are less efficient for bulk indexing huge amounts of data. Refer to for details. Delta index updates There's a frequent situation when the total dataset is too big to be reindexed from scratch often, but the amount of new records is rather small. Example: a forum with a 1,000,000 archived posts, but only 1,000 new posts per day. In this case, "live" (almost real time) index updates could be implemented using so called "main+delta" scheme. The idea is to set up two sources and two indexes, with one "main" index for the data which only changes rarely (if ever), and one "delta" for the new documents. In the example above, 1,000,000 archived posts would go to the main index, and newly inserted 1,000 posts/day would go to the delta index. Delta index could then be reindexed very frequently, and the documents can be made available to search in a matter of minutes. Specifying which documents should go to what index and reindexing main index could also be made fully automatical. One option would be to make a counter table which would track the ID which would split the documents, and update it whenever the main index is reindexed. Fully automated live updates # in MySQL CREATE TABLE sph_counter ( counter_id INTEGER PRIMARY KEY NOT NULL, max_doc_id INTEGER NOT NULL ); # in sphinx.conf source main { # ... sql_query_pre = SET NAMES utf8 sql_query_pre = REPLACE INTO sph_counter SELECT 1, MAX(id) FROM documents sql_query = SELECT id, title, body FROM documents \ WHERE id<=( SELECT max_doc_id FROM sph_counter WHERE counter_id=1 ) } source delta : main { sql_query_pre = SET NAMES utf8 sql_query = SELECT id, title, body FROM documents \ WHERE id>( SELECT max_doc_id FROM sph_counter WHERE counter_id=1 ) } index main { source = main path = /path/to/main # ... all the other settings } # note how all other settings are copied from main, # but source and path are overridden (they MUST be) index delta : main { source = delta path = /path/to/delta } Note how we're overriding sql_query_pre in the delta source. We need to explicitly have that override. Otherwise REPLACE query would be run when indexing delta source too, effectively nullifying it. However, when we issue the directive in the inherited source for the first time, it removes all inherited values, so the encoding setup is also lost. So sql_query_pre in the delta can not just be empty; and we need to issue the encoding setup query explicitly once again. Index merging Merging two existing indexes can be more efficient that indexing the data from scratch, and desired in some cases (such as merging 'main' and 'delta' indexes instead of simply reindexing 'main' in 'main+delta' partitioning scheme). So indexer has an option to do that. Merging the indexes is normally faster than reindexing but still not instant on huge indexes. Basically, it will need to read the contents of both indexes once and write the result once. Merging 100 GB and 1 GB index, for example, will result in 202 GB of IO (but that's still likely less than the indexing from scratch requires). The basic command syntax is as follows: indexer --merge DSTINDEX SRCINDEX [--rotate] Only the DSTINDEX index will be affected: the contents of SRCINDEX will be merged into it. switch will be required if DSTINDEX is already being served by searchd. The initially devised usage pattern is to merge a smaller update from SRCINDEX into DSTINDEX. Thus, when merging the attributes, values from SRCINDEX will win if duplicate document IDs are encountered. Note, however, that the "old" keywords will not be automatically removed in such cases. For example, if there's a keyword "old" associated with document 123 in DSTINDEX, and a keyword "new" associated with it in SRCINDEX, document 123 will be found by both keywords after the merge. You can supply an explicit condition to remove documents from DSTINDEX to mitigate that; the relevant switch is : indexer --merge main delta --merge-dst-range deleted 0 0 This switch lets you apply filters to the destination index along with merging. There can be several filters; all of their conditions must be met in order to include the document in the resulting mergid index. In the example above, the filter passes only those records where 'deleted' is 0, eliminating all records that were flagged as deleted (for instance, using UpdateAttributes() call). Real-time indexes Real-time indexes (or RT indexes for brevity) are a new backend that lets you insert, update, or delete documents (rows) on the fly. RT indexes were added in version 1.10-beta. While querying of RT indexes is possible using any of the SphinxAPI, SphinxQL, or SphinxSE, updating them is only possible via SphinxQL at the moment. Full SphinxQL reference is available in . RT indexes overview RT indexes should be declared in sphinx.conf, just as every other index type. Notable differences from the regular, disk-based indexes are that a) data sources are not required and ignored, and b) you should explicitly enumerate all the text fields, not just attributes. Here's an example: RT index declaration index rt { type = rt path = /usr/local/sphinx/data/rt rt_field = title rt_field = content rt_attr_uint = gid } RT INDEXES ARE CURRENTLY (AS OF VERSION 1.10-beta) A WORK IN PROGRESS. Therefore, they might lack certain features: for instance, prefix/infix indexing, MVA attributes, etc are not supported yet. There also might be performance and stability issues. However, all the regular indexing features and most of the searching features are already in place, our internal testing passes, and last but not least a number of production instances are already using RT indexes with good results. RT index can be accessed using MySQL protocol. INSERT, REPLACE, DELETE, and SELECT statements against RT index are supported. For instance, this is an example session with the sample index above: $ mysql -h 127.0.0.1 -P 9306 Welcome to the MySQL monitor. Commands end with ; or \g. Your MySQL connection id is 1 Server version: 1.10-dev (r2153) Type 'help;' or '\h' for help. Type '\c' to clear the buffer. mysql> INSERT INTO rt VALUES ( 1, 'first record', 'test one', 123 ); Query OK, 1 row affected (0.05 sec) mysql> INSERT INTO rt VALUES ( 2, 'second record', 'test two', 234 ); Query OK, 1 row affected (0.00 sec) mysql> SELECT * FROM rt; +------+--------+------+ | id | weight | gid | +------+--------+------+ | 1 | 1 | 123 | | 2 | 1 | 234 | +------+--------+------+ 2 rows in set (0.02 sec) mysql> SELECT * FROM rt WHERE MATCH('test'); +------+--------+------+ | id | weight | gid | +------+--------+------+ | 1 | 1643 | 123 | | 2 | 1643 | 234 | +------+--------+------+ 2 rows in set (0.01 sec) mysql> SELECT * FROM rt WHERE MATCH('@title test'); Empty set (0.00 sec) Both partial and batch INSERT syntaxes are supported, ie. you can specify a subset of columns, and insert several rows at a time. Deletions are also possible using DELETE statement; the only currently supported syntax is DELETE FROM <index> WHERE id=<id>. REPLACE is also supported, enabling you to implement updates. mysql> INSERT INTO rt ( id, title ) VALUES ( 3, 'third row' ), ( 4, 'fourth entry' ); Query OK, 2 rows affected (0.01 sec) mysql> SELECT * FROM rt; +------+--------+------+ | id | weight | gid | +------+--------+------+ | 1 | 1 | 123 | | 2 | 1 | 234 | | 3 | 1 | 0 | | 4 | 1 | 0 | +------+--------+------+ 4 rows in set (0.00 sec) mysql> DELETE FROM rt WHERE id=2; Query OK, 0 rows affected (0.00 sec) mysql> SELECT * FROM rt WHERE MATCH('test'); +------+--------+------+ | id | weight | gid | +------+--------+------+ | 1 | 1500 | 123 | +------+--------+------+ 1 row in set (0.00 sec) mysql> INSERT INTO rt VALUES ( 1, 'first record on steroids', 'test one', 123 ); ERROR 1064 (42000): duplicate id '1' mysql> REPLACE INTO rt VALUES ( 1, 'first record on steroids', 'test one', 123 ); Query OK, 1 row affected (0.01 sec) mysql> SELECT * FROM rt WHERE MATCH('steroids'); +------+--------+------+ | id | weight | gid | +------+--------+------+ | 1 | 1500 | 123 | +------+--------+------+ 1 row in set (0.01 sec) Data stored in RT index should survive clean shutdown. When binary logging is enabled, it should also survive crash and/or dirty shutdown, and recover on subsequent startup. Known caveats with RT indexes As of 1.10-beta, RT indexes are a beta quality feature: while no major, showstopper-class issues are known, there still are a few known usage quirks. Those quirks are listed in this section. Prefix and infix indexing are not supported yet. MVAs are not supported yet. Disk chunks optimization routine is not implemented yet. On initial index creation, attributes are reordered by type, in the following order: uint, bigint, float, timestamp, string. So when using INSERT without an explicit column names list, specify all uint column values first, then bigint, etc. Default conservative RAM chunk limit () of 32M can lead to poor performance on bigger indexes, you should raise it to 256..1024M if you're planning to index gigabytes. High DELETE/REPLACE rate can lead to kill-list fragmentation and impact searching performance. No transaction size limits are currently imposed; too many concurrent INSERT/REPLACE transactions might therefore consume a lot of RAM. In case of a damaged binlog, recovery will stop on the first damaged transaction, even though it's technically possible to keep looking further for subsequent undamaged transactions, and recover those. This mid-file damage case (due to flaky HDD/CDD/tape?) is supposed to be extremely rare, though. Multiple INSERTs grouped in a single transaction perform better than equivalent single-row transactions and are recommended for batch loading of data. RT index internals RT index is internally chunked. It keeps a so-called RAM chunk that stores all the most recent changes. RAM chunk memory usage is rather strictly limited with per-index rt_mem_limit directive. Once RAM chunk grows over this limit, a new disk chunk is created from its data, and RAM chunk is reset. Thus, while most changes on the RT index will be performed in RAM only and complete instantly (in milliseconds), those changes that overflow the RAM chunk will stall for the duration of disk chunk creation (a few seconds). Disk chunks are, in fact, just regular disk-based indexes. But they're a part of an RT index and automatically managed by it, so you need not configure nor manage them manually. Because a new disk chunk is created every time RT chunk overflows the limit, and because in-memory chunk format is close to on-disk format, the disk chunks will be approximately bytes in size each. Generally, it is better to set the limit bigger, to minimize both the frequency of flushes, and the index fragmentation (number of disk chunks). For instance, on a dedicated search server that handles a big RT index, it can be advised to set to 1-2 GB. A global limit on all indexes is also planned, but not yet implemented yet as of 1.10-beta. Disk chunk full-text index data can not be actually modified, so the full-text field changes (ie. row deletions and updates) suppress a previous row version from a disk chunk using a kill-list, but do not actually physically purge the data. Therefore, on workloads with high full-text updates ratio index might eventually get polluted by these previous row versions, and searching performance would degrade. Physical index purging that would improve the performance is planned, but not yet implemented as of 1.10-beta. Data in RAM chunk gets saved to disk on clean daemon shutdown, and then loaded back on startup. However, on daemon or server crash, updates from RAM chunk might be lost. To prevent that, binary logging of transactions can be used; see for details. Full-text changes in RT index are transactional. They are stored in a per-thread accumulator until COMMIT, then applied at once. Bigger batches per single COMMIT should result in faster indexing. Binary logging Binary logs are essentially a recovery mechanism. With binary logs enabled, searchd writes every given transaction to the binlog file, and uses that for recovery after an unclean shutdown. On clean shutdown, RAM chunks are saved to disk, and then all the binlog files are unlinked. During normal operation, a new binlog file will be opened every time when limit (which defaults to 128M) is reached. Older, already closed binlog files are kept until all of the transactions stored in them (from all indexes) are flushed as a disk chunk. Setting the limit to 0 pretty much prevents binlog from being unlinked at all while searchd is running; however, it will still be unlinked on clean shutdown. There are 3 different binlog flushing strategies, controlled by binlog_flush directive which takes the values of 0, 1, or 2. 0 means to flush the log to OS and sync it to disk every second; 1 means flush and sync every transaction; and 2 (the default mode) means flush every transaction but sync every second. Sync is relatively slow because it has to perform physical disk writes, so mode 1 is the safest (every committed transaction is guaranteed to be written on disk) but the slowest. Flushing log to OS prevents from data loss on searchd crashes but not system crashes. Mode 2 is the default. On recovery after an unclean shutdown, binlogs are replayed and all logged transactions since the last good on-disk state are restored. Transactions are checksummed so in case of binlog file corruption garbage data will not be replayed; such a broken transaction will be detected and, currently, will stop replay. Transactions also start with a magic marker and timestamped, so in case of binlog damage in the middle of the file, it's technically possible to skip broken transactions and keep replaying from the next good one, and/or it's possible to replay transactions until a given timestamp (point-in-time recovery), but none of that is implemented yet as of 1.10-beta. One unwanted side effect of binlogs is that activel updating a small RT index that fully fits into a RAM chunk part will lead to an ever-growing binlog that can never be unlinked until clean shutdown. Binlogs are essentially append-only deltas against the last known good saved state on disk, and unless RAM chunk gets saved, they can not be unlinked. An ever-growing binlog is not very good for disk use and crash recovery time. Starting with 2.0.1-beta you can configure searchd to perform a periodic RAM chunk flush to fix that problem using a rt_flush_period directive. With periodic flushes enabled, searchd will keep a separate thread, checking whether RT indexes RAM chunks need to be written back to disk. Once that happens, the respective binlogs can be (and are) safely unlinked. Note that rt_flush_period only controls the frequency at which the checks happen. There are no guarantees that the particular RAM chunk will get saved. For instance, it does not make sense to regularly re-save a huge RAM chunk that only gets a few rows worh of updates. The search daemon determine whether to actually perform the flush with a few heuristics. Searching Matching modes So-called matching modes are a legacy feature that used to provide (very) limited query syntax and ranking support. Currently, they are deprecated in favor of full-text query language and so-called rankers. Starting with version 0.9.9-release, it is thus strongly recommended to use SPH_MATCH_EXTENDED and proper query syntax rather than any other legacy mode. All those other modes are actually internally converted to extended syntax anyway. SphinxAPI still defaults to SPH_MATCH_ALL but that is for compatibility reasons only. There are the following matching modes available: SPH_MATCH_ALL, matches all query words (default mode); SPH_MATCH_ANY, matches any of the query words; SPH_MATCH_PHRASE, matches query as a phrase, requiring perfect match; SPH_MATCH_BOOLEAN, matches query as a boolean expression (see ); SPH_MATCH_EXTENDED, matches query as an expression in Sphinx internal query language (see ); SPH_MATCH_EXTENDED2, an alias for SPH_MATCH_EXTENDED; SPH_MATCH_FULLSCAN, matches query, forcibly using the "full scan" mode as below. NB, any query terms will be ignored, such that filters, filter-ranges and grouping will still be applied, but no text-matching. SPH_MATCH_EXTENDED2 was used during 0.9.8 and 0.9.9 development cycle, when the internal matching engine was being rewritten (for the sake of additional functionality and better performance). By 0.9.9-release, the older version was removed, and SPH_MATCH_EXTENDED and SPH_MATCH_EXTENDED2 are now just aliases. The SPH_MATCH_FULLSCAN mode will be automatically activated in place of the specified matching mode when the following conditions are met: The query string is empty (ie. its length is zero). docinfo storage is set to extern. In full scan mode, all the indexed documents will be considered as matching. Such queries will still apply filters, sorting, and group by, but will not perform any full-text searching. This can be useful to unify full-text and non-full-text searching code, or to offload SQL server (there are cases when Sphinx scans will perform better than analogous MySQL queries). An example of using the full scan mode might be to find posts in a forum. By selecting the forum's user ID via SetFilter() but not actually providing any search text, Sphinx will match every document (i.e. every post) where SetFilter() would match - in this case providing every post from that user. By default this will be ordered by relevancy, followed by Sphinx document ID in ascending order (earliest first). Boolean query syntax Boolean queries allow the following special operators to be used: explicit operator AND: hello & world operator OR: hello | world operator NOT: hello -world hello !world grouping: ( hello world ) Here's an example query which uses all these operators: Boolean query example ( cat -dog ) | ( cat -mouse) There always is implicit AND operator, so "hello world" query actually means "hello & world". OR operator precedence is higher than AND, so "looking for cat | dog | mouse" means "looking for ( cat | dog | mouse )" and not "(looking for cat) | dog | mouse". Queries like "-dog", which implicitly include all documents from the collection, can not be evaluated. This is both for technical and performance reasons. Technically, Sphinx does not always keep a list of all IDs. Performance-wise, when the collection is huge (ie. 10-100M documents), evaluating such queries could take very long. Extended query syntax The following special operators and modifiers can be used when using the extended matching mode: operator OR: hello | world operator NOT: hello -world hello !world field search operator: @title hello @body world field position limit modifier (introduced in version 0.9.9-rc1): @body[50] hello multiple-field search operator: @(title,body) hello world all-field search operator: @* hello phrase search operator: "hello world" proximity search operator: "hello world"~10 quorum matching operator: "the world is a wonderful place"/3 strict order operator (aka operator "before"): aaa << bbb << ccc exact form modifier (introduced in version 0.9.9-rc1): raining =cats and =dogs field-start and field-end modifier (introduced in version 0.9.9-rc2): ^hello world$ NEAR, generalized proximity operator (introduced in version 2.0.1-beta): hello NEAR/3 world NEAR/4 "my test" SENTENCE operator (introduced in version 2.0.1-beta): all SENTENCE words SENTENCE "in one sentence" PARAGRAPH operator (introduced in version 2.0.1-beta): "Bill Gates" PARAGRAPH "Steve Jobs" zone limit operator: ZONE:(h3,h4) only in these titles Here's an example query that uses some of these operators: Extended matching mode: query example "hello world" @title "example program"~5 @body python -(php|perl) @* code The full meaning of this search is: Find the words 'hello' and 'world' adjacently in any field in a document; Additionally, the same document must also contain the words 'example' and 'program' in the title field, with up to, but not including, 10 words between the words in question; (E.g. "example PHP program" would be matched however "example script to introduce outside data into the correct context for your program" would not because two terms have 10 or more words between them) Additionally, the same document must contain the word 'python' in the body field, but not contain either 'php' or 'perl'; Additionally, the same document must contain the word 'code' in any field. There always is implicit AND operator, so "hello world" means that both "hello" and "world" must be present in matching document. OR operator precedence is higher than AND, so "looking for cat | dog | mouse" means "looking for ( cat | dog | mouse )" and not "(looking for cat) | dog | mouse". Field limit operator limits subsequent searching to a given field. Normally, query will fail with an error message if given field name does not exist in the searched index. However, that can be suppressed by specifying "@@relaxed" option at the very beginning of the query: @@relaxed @nosuchfield my query This can be helpful when searching through heterogeneous indexes with different schemas. Field position limit, introduced in version 0.9.9-rc1, additionaly restricts the searching to first N position within given field (or fields). For example, "@body[50] hello" will not match the documents where the keyword 'hello' occurs at position 51 and below in the body. Proximity distance is specified in words, adjusted for word count, and applies to all words within quotes. For instance, "cat dog mouse"~5 query means that there must be less than 8-word span which contains all 3 words, ie. "CAT aaa bbb ccc DOG eee fff MOUSE" document will not match this query, because this span is exactly 8 words long. Quorum matching operator introduces a kind of fuzzy matching. It will only match those documents that pass a given threshold of given words. The example above ("the world is a wonderful place"/3) will match all documents that have at least 3 of the 6 specified words. Strict order operator (aka operator "before"), introduced in version 0.9.9-rc2, will match the document only if its argument keywords occur in the document exactly in the query order. For instance, "black << cat" query (without quotes) will match the document "black and white cat" but not the "that cat was black" document. Order operator has the lowest priority. It can be applied both to just keywords and more complex expressions, ie. this is a valid query: (bag of words) << "exact phrase" << red|green|blue Exact form keyword modifier, introduced in version 0.9.9-rc1, will match the document only if the keyword occurred in exactly the specified form. The default behaviour is to match the document if the stemmed keyword matches. For instance, "runs" query will match both the document that contains "runs" and the document that contains "running", because both forms stem to just "run" - while "=runs" query will only match the first document. Exact form operator requires index_exact_words option to be enabled. This is a modifier that affects the keyword and thus can be used within operators such as phrase, proximity, and quorum operators. Field-start and field-end keyword modifiers, introduced in version 0.9.9-rc2, will make the keyword match only if it occurred at the very start or the very end of a fulltext field, respectively. For instance, the query "^hello world$" (with quotes and thus combining phrase operator and start/end modifiers) will only match documents that contain at least one field that has exactly these two keywords. Starting with 0.9.9-rc1, arbitrarily nested brackets and negations are allowed. However, the query must be possible to compute without involving an implicit list of all documents: // correct query aaa -(bbb -(ccc ddd)) // queries that are non-computable -aaa aaa | -bbb NEAR operator, added in 2.0.1-beta, is a generalized version of a proximity operator. The syntax is NEAR/N, it is case-sensitive, and no spaces are allowed beetwen the NEAR keyword, the slash sign, and the distance value. The original proximity operator only worked on sets of keywords. NEAR is more generic and can accept arbitrary subexpressions as its two arguments, matching the document when both subexpressions are found within N words of each other, no matter in which order. NEAR is left associative and has the same (lowest) precedence as BEFORE. You should also note how a (one NEAR/7 two NEAR/7 three) query using NEAR is not really equivalent to a ("one two three"~7) one using keyword proximity operator. The difference here is that the proximity operator allows for up to 6 non-matching words between all the 3 matching words, but the version with NEAR is less restrictive: it would allow for up to 6 words between 'one' and 'two' and then for up to 6 more between that two-word matching and a 'three' keyword. SENTENCE and PARAGRAPH operators, added in 2.0.1-beta, matches the document when both its arguments are within the same sentence or the same paragraph of text, respectively. The arguments can be either keywords, or phrases, or the instances of the same operator. Here are a few examples: one SENTENCE two one SENTENCE "two three" one SENTENCE "two three" SENTENCE four The order of the arguments within the sentence or paragraph does not matter. These operators only work on indexes built with index_sp (sentence and paragraph indexing feature) enabled, and revert to a mere AND otherwise. Refer to the index_sp directive documentation for the notes on what's considered a sentence and a paragraph. ZONE limit operator, added in 2.0.1-beta, is quite similar to field limit operator, but restricts matching to a given in-field zone or a list of zones. Note that the subsequent subexpressions are not required to match in a single contiguous span of a given zone, and may match in multiple spans. For instance, (ZONE:th hello world) query will match this example document: <th>Table 1. Local awareness of Hello Kitty brand.</th> .. some table data goes here .. <th>Table 2. World-wide brand awareness.</th> ZONE operator affects the query until the next field or ZONE limit operator, or the closing parenthesis. It only works on the indexes built with zones support (see ) and will be ignored otherwise. Search results ranking Ranking overview Ranking (aka weighting) of the search results can be defined as a process of computing a so-called relevance (aka weight) for every given matched document with regards to a given query that matched it. So relevance is in the end just a number attached to every document that estimates how relevant the document is to the query. Search results can then be sorted based on this number and/or some additional parameters, so that the most sought after results would come up higher on the results page. There is no single standard one-size-fits-all way to rank any document in any scenario. Moreover, there can not ever be such a way, because relevance is subjective. As in, what seems relevant to you might not seem relevant to me. Hence, in general case it's not just hard to compute, it's theoretically impossible. So ranking in Sphinx is configurable. It has a notion of a so-called ranker. A ranker can formally be defined as a function that takes document and query as its input and produces a relevance value as output. In layman's terms, a ranker controls exactly how (using which specific algorithm) will Sphinx assign weights to the document. Previously, this ranking function was rigidly bound to the matching mode. So in the legacy matching modes (that is, SPH_MATCH_ALL, SPH_MATCH_ANY, SPH_MATCH_PHRASE, and SPH_MATCH_BOOLEAN) you can not choose the ranker. You can only do that in the SPH_MATCH_EXTENDED mode. (Which is the only mode in SphinxQL and the suggested mode in SphinxAPI anyway.) To choose a non-default ranker you can either use SetRankingMode() with SphinxAPI, or OPTION ranker clause in SELECT statement when using SphinxQL. As a sidenote, legacy matching modes are internally implemented via the unified syntax anyway. When you use one of those modes, Sphinx just internally adjusts the query and sets the associated ranker, then executes the query using the very same unified code path. Available rankers Sphinx ships with a number of built-in rankers suited for different purposes. A number of them uses two factors, phrase proximity (aka LCS) and BM25. Phrase proximity works on the keyword positions, while BM25 works on the keyword frequencies. Basically, the better the degree of the phrase match between the document body and the query, the higher is the phrase proximity (it maxes out when the document contains the entire query as a verbatim quote). And BM25 is higher when the document containers more rare words. We'll save the detailed discussion for later. Currently implemented rankers are: SPH_RANK_PROXIMITY_BM25, the default ranking mode that uses and combines both phrase proximity and BM25 ranking. SPH_RANK_BM25, statistical ranking mode which uses BM25 ranking only (similar to most other full-text engines). This mode is faster but may result in worse quality on queries which contain more than 1 keyword. SPH_RANK_NONE, no ranking mode. This mode is obviously the fastest. A weight of 1 is assigned to all matches. This is sometimes called boolean searching that just matches the documents but does not rank them. SPH_RANK_WORDCOUNT, ranking by the keyword occurrences count. This ranker computes the per-field keyword occurrence counts, then multiplies them by field weights, and sums the resulting values. SPH_RANK_PROXIMITY, added in version 0.9.9-rc1, returns raw phrase proximity value as a result. This mode is internally used to emulate SPH_MATCH_ALL queries. SPH_RANK_MATCHANY, added in version 0.9.9-rc1, returns rank as it was computed in SPH_MATCH_ANY mode ealier, and is internally used to emulate SPH_MATCH_ANY queries. SPH_RANK_FIELDMASK, added in version 0.9.9-rc2, returns a 32-bit mask with N-th bit corresponding to N-th fulltext field, numbering from 0. The bit will only be set when the respective field has any keyword occurences satisfiying the query. SPH_RANK_SPH04, added in version 1.10-beta, is generally based on the default SPH_RANK_PROXIMITY_BM25 ranker, but additionally boosts the matches when they occur in the very beginning or the very end of a text field. Thus, if a field equals the exact query, SPH04 should rank it higher than a field that contains the exact query but is not equal to it. (For instance, when the query is "Hyde Park", a document entitled "Hyde Park" should be ranked higher than a one entitled "Hyde Park, London" or "The Hyde Park Cafe".) SPH_RANK_EXPR, added in version 2.0.2-beta, lets you specify the ranking formula in run time. It exposes a number of internal text factors and lets you defined how the final weight should be computed from those factors. You can find more details about its syntax and a reference available factors in a subsection below. You should specify the SPH_RANK_ prefix and use capital letters only when using the SetRankingMode() call from the SphinxAPI. The API ports expose these as global constants. Using SphinxQL syntax, the prefix should be omitted and the ranker name is case insensitive. Example: // SphinxAPI $client->SetRankingMode ( SPH_RANK_SPH04 ); // SphinxQL mysql_query ( "SELECT ... OPTION ranker=sph04" ); Legacy matching modes rankers Legacy matching modes automatically select a ranker as follows: SPH_MATCH_ALL uses SPH_RANK_PROXIMITY ranker; SPH_MATCH_ANY uses SPH_RANK_MATCHANY ranker; SPH_MATCH_PHRASE uses SPH_RANK_PROXIMITY ranker; SPH_MATCH_BOOLEAN uses SPH_RANK_NONE ranker. Expression based ranker (SPH_RANK_EXPR) Expression ranker, added in version 2.0.2-beta, lets you change the ranking formula on the fly, on a per-query basis. For a quick kickoff, this is how you emulate PROXIMITY_BM25 ranker using the expression based one: SELECT *, WEIGHT() FROM myindex WHERE MATCH('hello world') OPTION ranker=expr('sum(lcs*user_weight)*1000+bm25') The output of this query must not change if you omit the OPTION clause, because the default ranker (PROXIMITY_BM25) behaves exactly like specified in the ranker formula above. But the expression ranker is somewhat more flexible than just that and provides access to many more factors. The ranking formula is an arbitrary arithmetic expression that can use constants, document attributes, built-in functions and operators (described in ), and also a few ranking-specific things that are only accessible in a ranking formula. Namely, those are field aggregation functions, field-level, and document-level ranking factors. A document-level factor is a numeric value computed by the ranking engine for every matched document with regards to the current query. (So it differs from a plain document attribute in that the attribute do not depend on the full text query, while factors might.) Those factors can be used anywhere in the ranking expression. Currently implemented document-level factors are: bm25 (integer), a document-level BM25 estimate (computed without keyword occurrence filtering). max_lcs (integer), a query-level maximum possible value that the sum(lcs*user_weight) expression can ever take. This can be useful for weight boost scaling. For instance, MATCHANY ranker formula uses this to guarantee that a full phrase match in any field rankes higher than any combination of partial matches in all fields. field_mask (integer), a document-level 32-bit mask of matched fields. query_word_count (integer), the number of unique keywords in a query, adjusted for a number of excluded keywords. For instance, both (one one one one) and (one !two) queries should assign a value of 1 to this factor, because there is just one unique non-excluded keyword. doc_word_count (integer), the number of unique keywords matched in the entire document. A field-level factor is a numeric value computed by the ranking engine for every matched in-document text field with regards to the current query. As more than one field can be matched by a query, but the final weight needs to be a single integer value, these values need to be folded into a single one. To achieve that, field-level factors can only be used within a field aggregation function, they can not be used anywhere in the expression. For example, you can not use (lcs+bm25) as your ranking expression, as lcs takes multiple values (one in every matched field). You shoudl use (sum(lcs)+bm25) instead, that expression sums lcs over all matching fields, and then adds bm25 to that per-field sum. Currently implemented field-level factors are: lcs (integer), the length of a maximum verbatim match between the document and the query, coutned in words. LCS stands for Longest Common Subsequence (or Subset). Takes a minimum value of 1 when only stray keywords were matched in a field, and a maximum value of query keywords count when the entire query was matched in a field verbatim (in the exact query keywords order). For example, if the query is 'hello world' and the field contains these two words quoted from the query (that is, adjacent to each other, and exaclty in the query order), lcs will be 2. For example, if the query is 'hello world program' and the field contains 'hello world', lcs will be 2. Note that any subset of the query keyword works, not just a subset of adjacent keywords. For example, if the query is 'hello world program' and the field contains 'hello (test program)', lcs will be 2 just as well, because both 'hello' and 'program' matched in the same respective positions as they were in the query. Finally, if the query is 'hello world program' and the field contains 'hello world program', lcs will be 3. (Hopefully that is unsurpising at this point.) user_weight (integer), the user specified per-field weight (refer to SetFieldWeights() in SphinxAPI and OPTION field_weights in SphinxQL respectively). The weights default to 1 if not specified explicitly. hit_count (integer), the number of keyword occurrences that matched in the field. Note that a single keyword may occur multiple times. For example, if 'hello' occurs 3 times in a field and 'world' occurs 5 times, hit_count will be 8. word_count (integer), the number of unique keywords matched in the field. For example, if 'hello' and 'world' occur anywhere in a field, word_count will be 2, irregardless of how many times do both keywords occur. tf_idf (float), the sum of TF*IDF over all the keywords matched in the field. IDF is the Inverse Document Frequency, a floating point value between 0 and 1 that describes how frequent is the keywords (basically, 0 for a keyword that occurs in every document indexed, and 1 for a unique keyword that occurs in just a single document). TF is the Term Frequency, the number of matched keyword occurrences in the field. As a side note, tf_idf is actually computed by summing IDF over all matched occurences. That's by construction equivalent to summing TF*IDF over all matched keywords. min_hit_pos (integer), the position of the first matched keyword occurrence, counted in words. Indexing begins from position 1. min_best_span_pos (integer), the position of the first maximum LCS occurrences span. For example, assume that our query was 'hello world program' and 'hello world' subphrase was matched twice in the field, in positions 13 and 21. Assume that 'hello' and 'world' additionally occurred elsewhere in the field, but never next to each other and thus never as a subphrase match. In that case, min_best_span_pos will be 13. Note how for the single keyword queries min_best_span_pos will always equal min_hit_pos. exact_hit (boolean), whether a query was an exact match of the entire current field. Used in the SPH04 ranker. A field aggregation function is a single argument function that takes an expression with field-level factors, iterates it over all the matched fields, and computes the final results. Currently implemented field aggregation functions are: sum, sums the argument expression over all matched fields. For instance, sum(1) should return a number of matched fields. Expressions for the built-in rankers Most of the other rankers can actually be emulated with the expression based ranker. You just need to pass a proper expression. Such emulation is, of course, going to be slower than using the built-in, compiled ranker but still might be of interest if you want to fine-tune your ranking formula starting with one of the existing ones. Also, the formulas define the nitty gritty ranker details in a nicely readable fashion. SPH_RANK_PROXIMITY_BM25 = sum(lcs*user_weight)*1000+bm25 SPH_RANK_BM25 = bm25 SPH_RANK_NONE = 1 SPH_RANK_WORDCOUNT = sum(hit_count*user_weight) SPH_RANK_PROXIMITY = sum(lcs*user_weight) SPH_RANK_MATCHANY = sum((word_count+(lcs-1)*max_lcs)*user_weight) SPH_RANK_FIELDMASK = field_mask SPH_RANK_SPH04 = sum((4*lcs+2*(min_hit_pos==1)+exact_hit)*user_weight)*1000+bm25 Expressions, functions, and operators Sphinx lets you use arbitrary arithmetic expressions both via SphinxQL and SphinxAPI, involving attribute values, internal attributes (document ID and relevance weight), arithmetic operations, a number of built-in functions, and user-defined functions. This section documents the supported operators and functions. Here's the complete reference list for quick access. Arithmetic operators: +, -, *, /, %, DIV, MOD Comparison operators: <, > <=, >=, =, <> Boolean operators: AND, OR, NOT Bitwise operators: &, | ABS() BIGINT() CEIL() COS() CRC32() DAY() EXP() FLOOR() GEODIST() IDIV() IF() IN() INTERVAL() LN() LOG10() LOG2() MAX() MIN() MONTH() NOW() POW() SIN() SINT() SQRT() YEAR() YEARMONTH() YEARMONTHDAY() Operators Arithmetic operators: +, -, *, /, %, DIV, MOD The standard arithmetic operators. Arithmetic calculations involving those can be performed in three different modes: (a) using single-precision, 32-bit IEEE 754 floating point values (the default), (b) using signed 32-bit integers, (c) using 64-bit signed integers. The expression parser will automatically switch to integer mode if there are no operations the result in a floating point value. Otherwise, it will use the default floating point mode. For instance, a+b will be computed using 32-bit integers if both arguments are 32-bit integers; or using 64-bit integers if both arguments are integers but one of them is 64-bit; or in floats otherwise. However, a/b or sqrt(a) will always be computed in floats, because these operations return a result of non-integer type. To avoid the first, you can either use IDIV(a,b) or a DIV b form. Also, a*b will not be automatically promoted to 64-bit when the arguments are 32-bit. To enforce 64-bit results, you can use BIGINT(). (But note that if there are non-integer operations, BIGINT() will simply be ignored.) Comparison operators: <, > <=, >=, =, <> Comparison operators (eg. = or <=) return 1.0 when the condition is true and 0.0 otherwise. For instance, (a=b)+3 will evaluate to 4 when attribute 'a' is equal to attribute 'b', and to 3 when 'a' is not. Unlike MySQL, the equality comparisons (ie. = and <> operators) introduce a small equality threshold (1e-6 by default). If the difference between compared values is within the threshold, they will be considered equal. Boolean operators: AND, OR, NOT Boolean operators (AND, OR, NOT) were introduced in 0.9.9-rc2 and behave as usual. They are left-associative and have the least priority compared to other operators. NOT has more priority than AND and OR but nevertheless less than any other operator. AND and OR have the same priority so brackets use is recommended to avoid confusion in complex expressions. Bitwise operators: &, | These operators perform bitwise AND and OR respectively. The operands must be of an integer types. Introduced in version 1.10-beta. Numeric functions ABS() Returns the absolute value of the argument. CEIL() Returns the smallest integer value greater or equal to the argument. COS() Returns the cosine of the argument. EXP() Returns the exponent of the argument (e=2.718... to the power of the argument). FLOOR() Returns the largest integer value lesser or equal to the argument. IDIV() Returns the result of an integer division of the first argument by the second argument. Both arguments must be of an integer type. LN() Returns the natural logarithm of the argument (with the base of e=2.718...). LOG10() Returns the common logarithm of the argument (with the base of 10). LOG2() Returns the binary logarithm of the argument (with the base of 2). MAX() Returns the bigger of two arguments. MIN() Returns the smaller of two arguments. POW() Returns the first argument raised to the power of the second argument. SIN() Returns the sine of the argument. SQRT() Returns the square root of the argument. Date and time functions DAY() Returns the integer day of month (in 1..31 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. MONTH() Returns the integer month (in 1..12 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. NOW() Returns the current timestamp as an INTEGER. Introduced in version 0.9.9-rc1. YEAR() Returns the integer year (in 1969..2038 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. YEARMONTH() Returns the integer year and month code (in 196912..203801 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. YEARMONTHDAY() Returns the integer year, month, and date code (in 19691231..20380119 range) from a timestamp argument, according to the current timezone. Introduced in version 2.0.1-beta. Type conversion functions BIGINT() Forcibly promotes the integer argument to 64-bit type, and does nothing on floating point argument. It's intended to help enforce evaluation of certain expressions (such as a*b) in 64-bit mode even though all the arguments are 32-bit. Introduced in version 0.9.9-rc1. SINT() Forcibly reinterprets its 32-bit unsigned integer argument as signed, and also expands it to 64-bit type (because 32-bit type is unsigned). It's easily illustrated by the following example: 1-2 normally evaluates to 4294967295, but SINT(1-2) evaluates to -1. Introduced in version 1.10-beta. Comparison functions IF() IF() behavior is slightly different that that of its MySQL counterpart. It takes 3 arguments, check whether the 1st argument is equal to 0.0, returns the 2nd argument if it is not zero, or the 3rd one when it is. Note that unlike comparison operators, IF() does not use a threshold! Therefore, it's safe to use comparison results as its 1st argument, but arithmetic operators might produce unexpected results. For instance, the following two calls will produce different results even though they are logically equivalent: IF ( sqrt(3)*sqrt(3)-3<>0, a, b ) IF ( sqrt(3)*sqrt(3)-3, a, b ) In the first case, the comparison operator <> will return 0.0 (false) because of a threshold, and IF() will always return 'b' as a result. In the second one, the same sqrt(3)*sqrt(3)-3 expression will be compared with zero without threshold by the IF() function itself. But its value will be slightly different from zero because of limited floating point calculations precision. Because of that, the comparison with 0.0 done by IF() will not pass, and the second variant will return 'a' as a result. IN() IN(expr,val1,val2,...), introduced in version 0.9.9-rc1, takes 2 or more arguments, and returns 1 if 1st argument (expr) is equal to any of the other arguments (val1..valN), or 0 otherwise. Currently, all the checked values (but not the expression itself!) are required to be constant. (Its technically possible to implement arbitrary expressions too, and that might be implemented in the future.) Constants are pre-sorted and then binary search is used, so IN() even against a big arbitrary list of constants will be very quick. Starting with 0.9.9-rc2, first argument can also be a MVA attribute. In that case, IN() will return 1 if any of the MVA values is equal to any of the other arguments. Starting with 2.0.1-beta, IN() also supports IN(expr,@uservar) syntax to check whether the value belongs to the list in the given global user variable. INTERVAL() INTERVAL(expr,point1,point2,point3,...), introduced in version 0.9.9-rc1, takes 2 or more arguments, and returns the index of the argument that is less than the first argument: it returns 0 if expr<point1, 1 if point1<=expr<point2, and so on. It is required that point1<point2<...<pointN for this function to work correctly. Miscellaneous functions CRC32() Returns the CRC32 value of a string argument. Introduced in version 2.0.1-beta. GEODIST() GEODIST(lat1,long1,lat2,long2) function, introduced in version 0.9.9-rc2, computes geosphere distance between two given points specified by their coordinates. Note that both latitudes and longitudes must be in radians and the result will be in meters. You can use arbitrary expression as any of the four coordinates. An optimized path will be selected when one pair of the arguments refers directly to a pair attributes and the other one is constant. Sorting modes There are the following result sorting modes available: SPH_SORT_RELEVANCE mode, that sorts by relevance in descending order (best matches first); SPH_SORT_ATTR_DESC mode, that sorts by an attribute in descending order (bigger attribute values first); SPH_SORT_ATTR_ASC mode, that sorts by an attribute in ascending order (smaller attribute values first); SPH_SORT_TIME_SEGMENTS mode, that sorts by time segments (last hour/day/week/month) in descending order, and then by relevance in descending order; SPH_SORT_EXTENDED mode, that sorts by SQL-like combination of columns in ASC/DESC order; SPH_SORT_EXPR mode, that sorts by an arithmetic expression. SPH_SORT_RELEVANCE ignores any additional parameters and always sorts matches by relevance rank. All other modes require an additional sorting clause, with the syntax depending on specific mode. SPH_SORT_ATTR_ASC, SPH_SORT_ATTR_DESC and SPH_SORT_TIME_SEGMENTS modes require simply an attribute name. SPH_SORT_RELEVANCE is equivalent to sorting by "@weight DESC, @id ASC" in extended sorting mode, SPH_SORT_ATTR_ASC is equivalent to "attribute ASC, @weight DESC, @id ASC", and SPH_SORT_ATTR_DESC to "attribute DESC, @weight DESC, @id ASC" respectively. SPH_SORT_TIME_SEGMENTS mode In SPH_SORT_TIME_SEGMENTS mode, attribute values are split into so-called time segments, and then sorted by time segment first, and by relevance second. The segments are calculated according to the current timestamp at the time when the search is performed, so the results would change over time. The segments are as follows: last hour, last day, last week, last month, last 3 months, everything else. These segments are hardcoded, but it is trivial to change them if necessary. This mode was added to support searching through blogs, news headlines, etc. When using time segments, recent records would be ranked higher because of segment, but withing the same segment, more relevant records would be ranked higher - unlike sorting by just the timestamp attribute, which would not take relevance into account at all. SPH_SORT_EXTENDED mode In SPH_SORT_EXTENDED mode, you can specify an SQL-like sort expression with up to 5 attributes (including internal attributes), eg: @relevance DESC, price ASC, @id DESC Both internal attributes (that are computed by the engine on the fly) and user attributes that were configured for this index are allowed. Internal attribute names must start with magic @-symbol; user attribute names can be used as is. In the example above, and are internal attributes and is user-specified. Known internal attributes are: @id (match ID) @weight (match weight) @rank (match weight) @relevance (match weight) @random (return results in random order) and are just additional aliases to . SPH_SORT_EXPR mode Expression sorting mode lets you sort the matches by an arbitrary arithmetic expression, involving attribute values, internal attributes (@id and @weight), arithmetic operations, and a number of built-in functions. Here's an example: $cl->SetSortMode ( SPH_SORT_EXPR, "@weight + ( user_karma + ln(pageviews) )*0.1" ); The operators and functions supported in the expressions are discussed in a separate section, . Grouping (clustering) search results Sometimes it could be useful to group (or in other terms, cluster) search results and/or count per-group match counts - for instance, to draw a nice graph of how much maching blog posts were there per each month; or to group Web search results by site; or to group matching forum posts by author; etc. In theory, this could be performed by doing only the full-text search in Sphinx and then using found IDs to group on SQL server side. However, in practice doing this with a big result set (10K-10M matches) would typically kill performance. To avoid that, Sphinx offers so-called grouping mode. It is enabled with SetGroupBy() API call. When grouping, all matches are assigned to different groups based on group-by value. This value is computed from specified attribute using one of the following built-in functions: SPH_GROUPBY_DAY, extracts year, month and day in YYYYMMDD format from timestamp; SPH_GROUPBY_WEEK, extracts year and first day of the week number (counting from year start) in YYYYNNN format from timestamp; SPH_GROUPBY_MONTH, extracts month in YYYYMM format from timestamp; SPH_GROUPBY_YEAR, extracts year in YYYY format from timestamp; SPH_GROUPBY_ATTR, uses attribute value itself for grouping. The final search result set then contains one best match per group. Grouping function value and per-group match count are returned along as "virtual" attributes named @group and @count respectively. The result set is sorted by group-by sorting clause, with the syntax similar to sorting clause syntax. In addition to and , group-by sorting clause may also include: @group (groupby function value), @count (amount of matches in group). The default mode is to sort by groupby value in descending order, ie. by . On completion, result parameter would contain total amount of matching groups over he whole index. WARNING: grouping is done in fixed memory and thus its results are only approximate; so there might be more groups reported in than actually present. might also be underestimated. To reduce inaccuracy, one should raise . If allows to store all found groups, results will be 100% correct. For example, if sorting by relevance and grouping by "published" attribute with SPH_GROUPBY_DAY function, then the result set will contain one most relevant match per each day when there were any matches published, with day number and per-day match count attached, sorted by day number in descending order (ie. recent days first). Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported through SetSelect() API call when using GROUP BY. Distributed searching To scale well, Sphinx has distributed searching capabilities. Distributed searching is useful to improve query latency (ie. search time) and throughput (ie. max queries/sec) in multi-server, multi-CPU or multi-core environments. This is essential for applications which need to search through huge amounts data (ie. billions of records and terabytes of text). The key idea is to horizontally partition (HP) searched data accross search nodes and then process it in parallel. Partitioning is done manually. You should setup several instances of Sphinx programs (indexer and searchd) on different servers; make the instances index (and search) different parts of data; configure a special distributed index on some of the searchd instances; and query this index. This index only contains references to other local and remote indexes - so it could not be directly reindexed, and you should reindex those indexes which it references instead. When searchd receives a query against distributed index, it does the following: connects to configured remote agents; issues the query; sequentially searches configured local indexes (while the remote agents are searching); retrieves remote agents' search results; merges all the results together, removing the duplicates; sends the merged resuls to client. From the application's point of view, there are no differences between searching through a regular index, or a distributed index at all. That is, distributed indexes are fully transparent to the application, and actually there's no way to tell whether the index you queried was distributed or local. (Even though as of 0.9.9 Sphinx does not allow to combine searching through distributed indexes with anything else, this constraint will be lifted in the future.) Any searchd instance could serve both as a master (which aggregates the results) and a slave (which only does local searching) at the same time. This has a number of uses: every machine in a cluster could serve as a master which searches the whole cluster, and search requests could be balanced between masters to achieve a kind of HA (high availability) in case any of the nodes fails; if running within a single multi-CPU or multi-core machine, there would be only 1 searchd instance quering itself as an agent and thus utilizing all CPUs/core. It is scheduled to implement better HA support which would allow to specify which agents mirror each other, do health checks, keep track of alive agents, load-balance requests, etc. <filename>searchd</filename> query log formats In version 2.0.1-beta and above two query log formats are supported. Previous versions only supported a custom plain text format. That format is still the default one. However, while it might be more convenient for manual monitoring and review, but hard to replay for benchmarks, it only logs search queries but not the other types of requests, does not always contain the complete search query data, etc. The default text format is also harder (and sometimes impossible) to replay for benchmarking purposes. The new sphinxql format alleviates that. It aims to be complete and automatable, even though at the cost of brevity and readability. Plain log format By default, searchd logs all succesfully executed search queries into a query log file. Here's an example: [Fri Jun 29 21:17:58 2007] 0.004 sec [all/0/rel 35254 (0,20)] [lj] test [Fri Jun 29 21:20:34 2007] 0.024 sec [all/0/rel 19886 (0,20) @channel_id] [lj] test This log format is as follows: [query-date] query-time [match-mode/filters-count/sort-mode total-matches (offset,limit) @groupby-attr] [index-name] query Match mode can take one of the following values: "all" for SPH_MATCH_ALL mode; "any" for SPH_MATCH_ANY mode; "phr" for SPH_MATCH_PHRASE mode; "bool" for SPH_MATCH_BOOLEAN mode; "ext" for SPH_MATCH_EXTENDED mode; "scan" if the full scan mode was used, either by being specified with SPH_MATCH_FULLSCAN, or if the query was empty (as documented under Matching Modes) Sort mode can take one of the following values: "rel" for SPH_SORT_RELEVANCE mode; "attr-" for SPH_SORT_ATTR_DESC mode; "attr+" for SPH_SORT_ATTR_ASC mode; "tsegs" for SPH_SORT_TIME_SEGMENTS mode; "ext" for SPH_SORT_EXTENDED mode. Additionally, if searchd was started with , there will be a block of data after where the index(es) searched are listed. A query log entry might take the form of: [Fri Jun 29 21:17:58 2007] 0.004 sec [all/0/rel 35254 (0,20)] [lj] [ios=6 kb=111.1 ms=0.5] test This additional block is information regarding I/O operations in performing the search: the number of file I/O operations carried out, the amount of data in kilobytes read from the index files and time spent on I/O operations (although there is a background processing component, the bulk of this time is the I/O operation time). SphinxQL log format This is a new log format introduced in 2.0.1-beta, with the goals begin logging everything and then some, and in a format easy to automate (for insance, automatically replay). New format can either be enabled via the query_log_format directive in the configuration file, or switched back and forth on the fly with the SET GLOBAL query_log_format=... statement via SphinxQL. In the new format, the example from the previous section would look as follows. (Wrapped below for readability, but with just one query per line in the actual log.) /* Fri Jun 29 21:17:58.609 2007 2011 conn 2 wall 0.004 found 35254 */ SELECT * FROM lj WHERE MATCH('test') OPTION ranker=proximity; /* Fri Jun 29 21:20:34 2007.555 conn 3 wall 0.024 found 19886 */ SELECT * FROM lj WHERE MATCH('test') GROUP BY channel_id OPTION ranker=proximity; Note that all requests would be logged in this format, including those sent via SphinxAPI and SphinxSE, not just those sent via SphinxQL. Also note, that this kind of logging works only with plain log files and will not work if you use 'syslog' for logging. The features of SphinxQL log format compared to the default text one are as follows. All request types should be logged. (This is still work in progress.) Full statement data will be logged where possible. Errors and warnings are logged. The log should be automatically replayable via SphinxQL. Additional performance counters (currently, per-agent distributed query times) are logged. Every request (including both SphinxAPI and SphinxQL) request must result in exactly one log line. All request types, including INSERT, CALL SNIPPETS, etc will eventually get logged, though as of time of this writing, that is a work in progress). Every log line must be a valid SphinxQL statement that reconstructs the full request, except if the logged request is too big and needs shortening for performance reasons. Additional messages, counters, etc can be logged in the comments section after the request. MySQL protocol support and SphinxQL Starting with version 0.9.9-rc2, Sphinx searchd daemon supports MySQL binary network protocol and can be accessed with regular MySQL API. For instance, 'mysql' CLI client program works well. Here's an example of querying Sphinx using MySQL client: $ mysql -P 9306 Welcome to the MySQL monitor. Commands end with ; or \g. Your MySQL connection id is 1 Server version: 0.9.9-dev (r1734) Type 'help;' or '\h' for help. Type '\c' to clear the buffer. mysql> SELECT * FROM test1 WHERE MATCH('test') -> ORDER BY group_id ASC OPTION ranker=bm25; +------+--------+----------+------------+ | id | weight | group_id | date_added | +------+--------+----------+------------+ | 4 | 1442 | 2 | 1231721236 | | 2 | 2421 | 123 | 1231721236 | | 1 | 2421 | 456 | 1231721236 | +------+--------+----------+------------+ 3 rows in set (0.00 sec) Note that mysqld was not even running on the test machine. Everything was handled by searchd itself. The new access method is supported in addition to native APIs which all still work perfectly well. In fact, both access methods can be used at the same time. Also, native API is still the default access method. MySQL protocol support needs to be additionally configured. This is a matter of 1-line config change, adding a new listener with mysql41 specified as a protocol: listen = localhost:9306:mysql41 Just supporting the protocol and not the SQL syntax would be useless so Sphinx now also supports a subset of SQL that we dubbed SphinxQL. It supports the standard querying all the index types with SELECT, modifying RT indexes with INSERT, REPLACE, and DELETE, and much more. Full SphinxQL reference is available in . Multi-queries Multi-queries, or query batches, let you send multiple queries to Sphinx in one go (more formally, one network request). Two API methods that implement multi-query mechanism are AddQuery() and RunQueries(). You can also run multiple queries with SphinxQL, see . (In fact, regular Query() call is internally implemented as a single AddQuery() call immediately followed by RunQueries() call.) AddQuery() captures the current state of all the query settings set by previous API calls, and memorizes the query. RunQueries() actually sends all the memorized queries, and returns multiple result sets. There are no restrictions on the queries at all, except just a sanity check on a number of queries in a single batch (see ). Why use multi-queries? Generally, it all boils down to performance. First, by sending requests to searchd in a batch instead of one by one, you always save a bit by doing less network roundtrips. Second, and somewhat more important, sending queries in a batch enables searchd to perform certain internal optimizations. As new types of optimizations are being added over time, it generally makes sense to pack all the queries into batches where possible, so that simply upgrading Sphinx to a new version would automatically enable new optimizations. In the case when there aren't any possible batch optimizations to apply, queries will be processed one by one internally. Why (or rather when) not use multi-queries? Multi-queries requires all the queries in a batch to be independent, and sometimes they aren't. That is, sometimes query B is based on query A results, and so can only be set up after executing query A. For instance, you might want to display results from a secondary index if and only if there were no results found in a primary index. Or maybe just specify offset into 2nd result set based on the amount of matches in the 1st result set. In that case, you will have to use separate queries (or separate batches). As of 0.9.10, there are two major optimizations to be aware of: common query optimization (available since 0.9.8); and common subtree optimization (available since 0.9.10). Common query optimization means that searchd will identify all those queries in a batch where only the sorting and group-by settings differ, and only perform searching once. For instance, if a batch consists of 3 queries, all of them are for "ipod nano", but 1st query requests top-10 results sorted by price, 2nd query groups by vendor ID and requests top-5 vendors sorted by rating, and 3rd query requests max price, full-text search for "ipod nano" will only be performed once, and its results will be reused to build 3 different result sets. So-called faceted searching is a particularly important case that benefits from this optimization. Indeed, faceted searching can be implemented by running a number of queries, one to retrieve search results themselves, and a few other ones with same full-text query but different group-by settings to retrieve all the required groups of results (top-3 authors, top-5 vendors, etc). And as long as full-text query and filtering settings stay the same, common query optimization will trigger, and greatly improve performance. Common subtree optimization is even more interesting. It lets searchd exploit similarities between batched full-text queries. It identifies common full-text query parts (subtress) in all queries, and caches them between queries. For instance, look at the following query batch: barack obama president barack obama john mccain barack obama speech There's a common two-word part ("barack obama") that can be computed only once, then cached and shared across the queries. And common subtree optimization does just that. Per-query cache size is strictly controlled by subtree_docs_cache and subtree_hits_cache directives (so that caching all sxiteen gazillions of documents that match "i am" does not exhaust the RAM and instantly kill your server). Here's a code sample (in PHP) that fire the same query in 3 different sorting modes: require ( "sphinxapi.php" ); $cl = new SphinxClient (); $cl->SetMatchMode ( SPH_MATCH_EXTENDED ); $cl->SetSortMode ( SPH_SORT_RELEVANCE ); $cl->AddQuery ( "the", "lj" ); $cl->SetSortMode ( SPH_SORT_EXTENDED, "published desc" ); $cl->AddQuery ( "the", "lj" ); $cl->SetSortMode ( SPH_SORT_EXTENDED, "published asc" ); $cl->AddQuery ( "the", "lj" ); $res = $cl->RunQueries(); How to tell whether the queries in the batch were actually optimized? If they were, respective query log will have a "multiplier" field that specifies how many queries were processed together: [Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext/0/rel 747541 (0,20)] [lj] the [Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext/0/ext 747541 (0,20)] [lj] the [Sun Jul 12 15:18:17.000 2009] 0.040 sec x3 [ext/0/ext 747541 (0,20)] [lj] the Note the "x3" field. It means that this query was optimized and processed in a sub-batch of 3 queries. For reference, this is how the regular log would look like if the queries were not batched: [Sun Jul 12 15:18:17.062 2009] 0.059 sec [ext/0/rel 747541 (0,20)] [lj] the [Sun Jul 12 15:18:17.156 2009] 0.091 sec [ext/0/ext 747541 (0,20)] [lj] the [Sun Jul 12 15:18:17.250 2009] 0.092 sec [ext/0/ext 747541 (0,20)] [lj] the Note how per-query time in multi-query case was improved by a factor of 1.5x to 2.3x, depending on a particular sorting mode. In fact, for both common query and common subtree optimizations, there were reports of 3x and even more improvements, and that's from production instances, not just synthetic tests. Collations Introduced to Sphinx in version 2.0.1-beta to supplement string sorting, collations essentially affect the string attribute comparisons. They specify both the character set encoding and the strategy that Sphinx uses to compare strings when doing ORDER BY or GROUP BY with a string attribute involved. String attributes are stored as is when indexing, and no character set or language information is attached to them. That's okay as long as Sphinx only needs to store and return the strings to the calling application verbatim. But when you ask Sphinx to sort by a string value, that request immediately becomes quite ambiguous. First, single-byte (ASCII, or ISO-8859-1, or Windows-1251) strings need to be processed differently that the UTF-8 ones that may encode every character with a variable number of bytes. So we need to know what is the character set type to interepret the raw bytes as meaningful characters properly. Second, we additionally need to know the language-specific string sorting rules. For instance, when sorting according to US rules in en_US locale, the accented character 'ï' (small letter i with diaeresis) should be placed somewhere after 'z'. However, when sorting with French rules and fr_FR locale in mind, it should be placed between 'i' and 'j'. And some other set of rules might choose to ignore accents at all, allowing 'ï' and 'i' to be mixed arbitrarily. Third, but not least, we might need case-sensitive sorting in some scenarios and case-insensitive sorting in some others. Collations combine all of the above: the character set, the lanugage rules, and the case sensitivity. Sphinx currently provides the following four collations. The first two collations rely on several standard C library (libc) calls and can thus support any locale that is installed on your system. They provide case-insensitive (_ci) and case-sensitive (_cs) comparisons respectively. By default they will use C locale, effectively resorting to bytewise comparisons. To change that, you need to specify a different available locale using collation_libc_locale directive. The list of locales available on your system can usually be obtained with the locale command: $ locale -a C en_AG en_AU.utf8 en_BW.utf8 en_CA.utf8 en_DK.utf8 en_GB.utf8 en_HK.utf8 en_IE.utf8 en_IN en_NG en_NZ.utf8 en_PH.utf8 en_SG.utf8 en_US.utf8 en_ZA.utf8 en_ZW.utf8 es_ES fr_FR POSIX ru_RU.utf8 ru_UA.utf8 The specific list of the system locales may vary. Consult your OS documentation to install additional needed locales. and locales are built-in into Sphinx. The first one is a generic collation for UTF-8 data (without any so-called language tailoring); it should behave similar to collation in MySQL. The second one is a simple bytewise comparison. Collation can be overriden via SphinxQL on a per-session basis using SET collation_connection statement. All subsequent SphinxQL queries will use this collation. SphinxAPI and SphinxSE queries will use the server default collation, as specified in collation_server configuration directive. Sphinx currently defaults to collation. Collations should affect all string attribute comparisons, including those within ORDER BY and GROUP BY, so differently ordered or grouped results can be returned depending on the collation chosen. User-defined functions (UDF) Starting with 2.0.1-beta, Sphinx supports User-Defined Functions, or UDF for short. They can be loaded and unloaded dynamically into searchd without having to restart the daemon, and used in expressions when searching. UDF features at a glance are as follows. Functions can take integer (both 32-bit and 64-bit), float, string, or MVA arguments. Functions can return integer or float values. Functions can check the argument number, types, and names and raise errors. Only simple functions (that is, non-aggregate ones) are currently supported. User-defined functions need your OS to support dynamically loadable libraries (aka shared objects). Most of the modern OSes are eligible, including Linux, Windows, MacOS, Solaris, BSD and others. (The internal testing has been done on Linux and Windows.) The UDF libraries must reside in a directory specified by plugin_dir directive, and the server must be configured to use mode. Relative paths to the library files are not allowed. Once the library is succesfully built and copied to the trusted location, you can then dynamically install and deinstall the functions using CREATE FUNCTION and DROP FUNCTION statements respectively. A single library can contain multiple functions. A library gets loaded when you first install a function from it, and unloaded when you deinstall all the functions from that library. The library functions that will implement a UDF visible to SQL statements need to follow C calling convention, and a simple naming convention. Sphinx source distribution provides a sample file, src/udfexample.c, that defines a few simple functions showing how to work with integer, string, and MVA arguments; you can use that one as a foundation for your new functions. It includes the UDF interface header file, src/sphinxudf.h, that defines the required types and structures. sphinxudf.h header is standalone, that is, does not require any other parts of Sphinx source to compile. Every function that you intend to use in your SELECT statements requires at least two corresponding C/C++ functions: the initialization call, and the function call itself. You can also optionally define the deinitialization call if your function requires any post-query cleanup. (For instance, if you were allocating any memory in either the initialization call or the function calls.) Function names in SQL are case insensitive, C function names are not. They need to be all lower-case. Mistakes in function name prevent UDFs from loading. You also have to pay special attention to the calling convention used when compiling, the list and the types of arguments, and the return type of the main function call. Mistakes in either are likely to crash the server, or result in unexpected results in the best case. Last but not least, all functions need to be thread-safe. Let's assume for the sake of example that your UDF name in SphinxQL will be MYFUNC. The initialization, main, and deinitialization functions would then need to be named as follows and take the following arguments: /// initialization function /// called once during query initialization /// returns 0 on success /// returns non-zero and fills error_message buffer on failure int myfunc_init ( SPH_UDF_INIT * init, SPH_UDF_ARGS * args, char * error_message ); /// main call function /// returns the computed value /// writes non-zero value into error_flag to indicate errors RETURN_TYPE myfunc ( SPH_UDF_INIT * init, SPH_UDF_ARGS * args, char * error_flag ); /// optional deinitialization function /// called once to cleanup once query processing is done void myfunc_deinit ( SPH_UDF_INIT * init ); The two mentioned structures, SPH_UDF_INIT and SPH_UDF_ARGS, are defined in the src/sphinxudf.h interface header and documented there. RETURN_TYPE of the main function must be one of the following: int for the functions that return INT. sphinx_int64_t for the functions that return BIGINT. float for the functions that return FLOAT. The calling sequence is as follows. myfunc_init() is called once when initializing the query. It can return a non-zero code to indicate a failure; in that case query is not executed, and the error message from the error_message buffer is returned. Otherwise, myfunc() is be called for every row, and a myfunc_deinit() is then called when the query ends. myfunc() can indicate an error by writing a non-zero byte value to error_flag, in that case, it will no more be called for subsequent rows, and a default value of 0 will be substituted. Sphinx might or might not choose to terminate such queries early, neither behavior is currently guaranteed. Command line tools reference As mentioned elsewhere, Sphinx is not a single program called 'sphinx', but a collection of 4 separate programs which collectively form Sphinx. This section covers these tools and how to use them. <filename>indexer</filename> command reference indexer is the first of the two principle tools as part of Sphinx. Invoked from either the command line directly, or as part of a larger script, indexer is solely responsible for gathering the data that will be searchable. The calling syntax for indexer is as follows: indexer [OPTIONS] [indexname1 [indexname2 [...]]] Essentially you would list the different possible indexes (that you would later make available to search) in sphinx.conf, so when calling indexer, as a minimum you need to be telling it what index (or indexes) you want to index. If sphinx.conf contained details on 2 indexes, mybigindex and mysmallindex, you could do the following: $ indexer mybigindex $ indexer mysmallindex mybigindex As part of the configuration file, sphinx.conf, you specify one or more indexes for your data. You might call indexer to reindex one of them, ad-hoc, or you can tell it to process all indexes - you are not limited to calling just one, or all at once, you can always pick some combination of the available indexes. The majority of the options for indexer are given in the configuration file, however there are some options you might need to specify on the command line as well, as they can affect how the indexing operation is performed. These options are: ( for short) tells indexer to use the given file as its configuration. Normally, it will look for sphinx.conf in the installation directory (e.g. /usr/local/sphinx/etc/sphinx.conf if installed into /usr/local/sphinx), followed by the current directory you are in when calling indexer from the shell. This is most of use in shared environments where the binary files are installed somewhere like /usr/local/sphinx/ but you want to provide users with the ability to make their own custom Sphinx set-ups, or if you want to run multiple instances on a single server. In cases like those you could allow them to create their own sphinx.conf files and pass them to indexer with this option. For example: $ indexer --config /home/myuser/sphinx.conf myindex tells indexer to update every index listed in sphinx.conf, instead of listing individual indexes. This would be useful in small configurations, or cron-type or maintenance jobs where the entire index set will get rebuilt each day, or week, or whatever period is best. Example usage: $ indexer --config /home/myuser/sphinx.conf --all is used for rotating indexes. Unless you have the situation where you can take the search function offline without troubling users, you will almost certainly need to keep search running whilst indexing new documents. creates a second index, parallel to the first (in the same place, simply including .new in the filenames). Once complete, indexer notifies searchd via sending the signal, and searchd will attempt to rename the indexes (renaming the existing ones to include .old and renaming the .new to replace them), and then start serving from the newer files. Depending on the setting of seamless_rotate, there may be a slight delay in being able to search the newer indexes. Example usage: $ indexer --rotate --all tells indexer not to output anything, unless there is an error. Again, most used for cron-type, or other script jobs where the output is irrelevant or unnecessary, except in the event of some kind of error. Example usage: $ indexer --rotate --all --quiet does not display progress details as they occur; instead, the final status details (such as documents indexed, speed of indexing and so on are only reported at completion of indexing. In instances where the script is not being run on a console (or 'tty'), this will be on by default. Example usage: $ indexer --rotate --all --noprogress reviews the index source, as if it were indexing the data, and produces a list of the terms that are being indexed. In other words, it produces a list of all the searchable terms that are becoming part of the index. Note; it does not update the index in question, it simply processes the data 'as if' it were indexing, including running queries defined with or . outputfile.txt will contain the list of words, one per line, sorted by frequency with most frequent first, and N specifies the maximum number of words that will be listed; if sufficiently large to encompass every word in the index, only that many words will be returned. Such a dictionary list could be used for client application features around "Did you mean..." functionality, usually in conjunction with , below. Example: $ indexer myindex --buildstops word_freq.txt 1000 This would produce a document in the current directory, word_freq.txt with the 1,000 most common words in 'myindex', ordered by most common first. Note that the file will pertain to the last index indexed when specified with multiple indexes or (i.e. the last one listed in the configuration file) works with (and is ignored if is not specified). As provides the list of words used within the index, adds the quantity present in the index, which would be useful in establishing whether certain words should be considered stopwords if they are too prevalent. It will also help with developing "Did you mean..." features where you can how much more common a given word compared to another, similar one. Example: $ indexer myindex --buildstops word_freq.txt 1000 --buildfreqs This would produce the word_freq.txt as above, however after each word would be the number of times it occurred in the index in question. is used for physically merging indexes together, for example if you have a main+delta scheme, where the main index rarely changes, but the delta index is rebuilt frequently, and would be used to combine the two. The operation moves from right to left - the contents of src-index get examined and physically combined with the contents of dst-index and the result is left in dst-index. In pseudo-code, it might be expressed as: dst-index += src-index An example: $ indexer --merge main delta --rotate In the above example, where the main is the master, rarely modified index, and delta is the less frequently modified one, you might use the above to call indexer to combine the contents of the delta into the main index and rotate the indexes. runs the filter range given upon merging. Specifically, as the merge is applied to the destination index (as part of , and is ignored if is not specified), indexer will also filter the documents ending up in the destination index, and only documents will pass through the filter given will end up in the final index. This could be used for example, in an index where there is a 'deleted' attribute, where 0 means 'not deleted'. Such an index could be merged with: $ indexer --merge main delta --merge-dst-range deleted 0 0 Any documents marked as deleted (value 1) would be removed from the newly-merged destination index. It can be added several times to the command line, to add successive filters to the merge, all of which must be met in order for a document to become part of the final index. dumps rows fetched by SQL source(s) into the specified file, in a MySQL compatible syntax. Resulting dumps are the exact representation of data as received by indexer and help to repeat indexing-time issues. guarantees that every row that caused problems indexing (duplicate, zero, or missing document ID; or file field IO issues; etc) will be reported. By default, this option is off, and problem summaries may be reported instead. is useful when you are rebuilding many big indexes, and want each one rotated into searchd as soon as possible. With , indexer will send a SIGHUP signal to searchd after succesfully completing the work on each index. (The default behavior is to send a single SIGHUP after all the indexes were built.) prints out SQL queries that indexer sends to the database, along with SQL connection and disconnection events. That is useful to diagnose and fix problems with SQL sources. <filename>searchd</filename> command reference searchd is the second of the two principle tools as part of Sphinx. searchd is the part of the system which actually handles searches; it functions as a server and is responsible for receiving queries, processing them and returning a dataset back to the different APIs for client applications. Unlike indexer, searchd is not designed to be run either from a regular script or command-line calling, but instead either as a daemon to be called from init.d (on Unix/Linux type systems) or to be called as a service (on Windows-type systems), so not all of the command line options will always apply, and so will be build-dependent. Calling searchd is simply a case of: $ searchd [OPTIONS] The options available to searchd on all builds are: ( for short) lists all of the parameters that can be called in your particular build of searchd. ( for short) tells searchd to use the given file as its configuration, just as with indexer above. is used to asynchronously stop searchd, using the details of the PID file as specified in the sphinx.conf file, so you may also need to confirm to searchd which configuration file to use with the option. NB, calling will also make sure any changes applied to the indexes with UpdateAttributes() will be applied to the index files themselves. Example: $ searchd --config /home/myuser/sphinx.conf --stop is used to synchronously stop searchd. essentially tells the running instance to exit (by sending it a SIGTERM) and then immediately returns. will also attempt to wait until the running searchd instance actually finishes the shutdown (eg. saves all the pending attribute changes) and exits. Example: $ searchd --config /home/myuser/sphinx.conf --stopwait Possible exit codes are as follows: 0 on success; 1 if connection to running searchd daemon failed; 2 if daemon reported an error during shutdown; 3 if daemon crashed during shutdown. command is used to query running searchd instance status, using the connection details from the (optionally) provided configuration file. It will try to connect to the running instance using the first configured UNIX socket or TCP port. On success, it will query for a number of status and performance counter values and print them. You can use Status() API call to access the very same counters from your application. Examples: $ searchd --status $ searchd --config /home/myuser/sphinx.conf --status is used to explicitly state a PID file, where the process information is stored regarding searchd, used for inter-process communications (for example, indexer will need to know the PID to contact searchd for rotating indexes). Normally, searchd would use a PID if running in regular mode (i.e. not with ), but it is possible that you will be running it in console mode whilst the index is being updated and rotated, for which a PID file will be needed. $ searchd --config /home/myuser/sphinx.conf --pidfile /home/myuser/sphinx.pid is used to force searchd into console mode; typically it will be running as a conventional server application, and will aim to dump information into the log files (as specified in sphinx.conf). Sometimes though, when debugging issues in the configuration or the daemon itself, or trying to diagnose hard-to-track-down problems, it may be easier to force it to dump information directly to the console/command line from which it is being called. Running in console mode also means that the process will not be forked (so searches are done in sequence) and logs will not be written to. (It should be noted that console mode is not the intended method for running searchd.) You can invoke it as such: $ searchd --config /home/myuser/sphinx.conf --console enables additional debug output in the daemon log. Should only be needed rarely, to assist with debugging issues that could not be easily reproduced on request. is used in conjuction with the logging options (the will need to have been activated in sphinx.conf) to provide more detailed information on a per-query basis as to the input/output operations carried out in the course of that query, with a slight performance hit and of course bigger logs. Further details are available under the query log format section. You might start searchd thus: $ searchd --config /home/myuser/sphinx.conf --iostats is used to provide actual CPU time report (in addition to wall time) in both query log file (for every given query) and status report (aggregated). It depends on clock_gettime() system call and might therefore be unavailable on certain systems. You might start searchd thus: $ searchd --config /home/myuser/sphinx.conf --cpustats ( for short) is used to specify the port that searchd should listen on, usually for debugging purposes. This will usually default to 9312, but sometimes you need to run it on a different port. Specifying it on the command line will override anything specified in the configuration file. The valid range is 0 to 65535, but ports numbered 1024 and below usually require a privileged account in order to run. An example of usage: $ searchd --port 9313 (or for short) Works as , but allow you to specify not only the port, but full path, as IP address and port, or Unix-domain socket path, that searchd will listen on. Otherwords, you can specify either an IP address (or hostname) and port number, or just a port number, or Unix socket path. If you specify port number but not the address, searchd will listen on all network interfaces. Unix path is identified by a leading slash. As the last param you can also specify a protocol handler (listener) to be used for connections on this socket. Supported protocol values are 'sphinx' (Sphinx 0.9.x API protocol) and 'mysql41' (MySQL protocol used since 4.1 upto at least 5.1). (or for short) forces this instance of searchd only to serve the specified index. Like , above, this is usually for debugging purposes; more long-term changes would generally be applied to the configuration file itself. Example usage: $ searchd --index myindex strips the path names from all the file names referenced from the index (stopwords, wordforms, exceptions, etc). This is useful for picking up indexes built on another machine with possibly different path layouts. There are some options for searchd that are specific to Windows platforms, concerning handling as a service, are only be available on Windows binaries. Note that on Windows searchd will default to mode, unless you install it as a service. installs searchd as a service into the Microsoft Management Console (Control Panel / Administrative Tools / Services). Any other parameters specified on the command line, where is specified will also become part of the command line on future starts of the service. For example, as part of calling searchd, you will likely also need to specify the configuration file with , and you would do that as well as specifying . Once called, the usual start/stop facilities will become available via the management console, so any methods you could use for starting, stopping and restarting services would also apply to searchd. Example: C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install --config C:\Sphinx\sphinx.conf If you wanted to have the I/O stats every time you started searchd, you would specify its option on the same line as the command thus: C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install --config C:\Sphinx\sphinx.conf --iostats removes the service from the Microsoft Management Console and other places where services are registered, after previously installed with . Note, this does not uninstall the software or delete the indexes. It means the service will not be called from the services systems, and will not be started on the machine's next start. If currently running as a service, the current instance will not be terminated (until the next reboot, or searchd is called with ). If the service was installed with a custom name (with ), the same name will need to be specified with when calling to uninstall. Example: C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --delete applies the given name to searchd when installing or deleting the service, as would appear in the Management Console; this will default to searchd, but if being deployed on servers where multiple administrators may log into the system, or a system with multiple searchd instances, a more descriptive name may be applicable. Note that unless combined with or , this option does not do anything. Example: C:\WINDOWS\system32> C:\Sphinx\bin\searchd.exe --install --config C:\Sphinx\sphinx.conf --servicename SphinxSearch is the option that is passed by the Management Console to searchd to invoke it as a service on Windows platforms. It would not normally be necessary to call this directly; this would normally be called by Windows when the service would be started, although if you wanted to call this as a regular service from the command-line (as the complement to ) you could do so in theory. Last but not least, as every other daemon, searchd supports a number of signals. SIGTERM Initiates a clean shutdown. New queries will not be handled; but queries that are already started will not be forcibly interrupted. SIGHUP Initiates index rotation. Depending on the value of seamless_rotate setting, new queries might be shortly stalled; clients will receive temporary errors. SIGUSR1 Forces reopen of searchd log and query log files, letting you implement log file rotation. <filename>search</filename> command reference search is one of the helper tools within the Sphinx package. Whereas searchd is responsible for searches in a server-type environment, search is aimed at testing the index from the command line, and testing the index quickly without building a framework to make the connection to the server and process its response. Note: search is not intended to be deployed as part of a client application; it is strongly recommended you do not write an interface to search instead of searchd, and none of the bundled client APIs support this method. (In any event, search will reload files each time, whereas searchd will cache them in memory for performance.) That said, many types of query that you could build in the APIs could also be made with search, however for very complex searches it may be easier to construct them using a small script and the corresponding API. Additionally, some newer features may be available in the searchd system that have not yet been brought into search. The calling syntax for search is as follows: search [OPTIONS] word1 [word2 [word3 [...]]] When calling search, it is not necessary to have searchd running; simply make sure that the account running the search program has read access to the configuration file and the index files. The default behaviour is to apply a search for word1 (AND word2 AND word3... as specified) to all fields in all indexes as given in the configuration file. If constructing the equivalent in the API, this would be the equivalent to passing to SetMatchMode, and specifying as the indexes to query as part of Query. There are many options available to search. Firstly, the general options: ( for short) tells search to use the given file as its configuration, just as with indexer above. ( for short) tells search to limit searching to the specified index only; normally it would attempt to search all of the physical indexes listed in sphinx.conf, not any distributed ones. tells search to accept the query from the standard input, rather than the command line. This can be useful for testing purposes whereby you could feed input via pipes and from scripts. Options for setting matches: ( for short) changes the matching mode to match any of the words as part of the query (word1 OR word2 OR word3). In the API this would be equivalent to passing to SetMatchMode. ( for short) changes the matching mode to match all of the words as part of the query, and do so in the phrase given (not including punctuation). In the API this would be equivalent to passing to SetMatchMode. ( for short) changes the matching mode to Boolean matching. Note if using Boolean syntax matching on the command line, you may need to escape the symbols (with a backslash) to avoid the shell/command line processor applying them, such as ampersands being escaped on a Unix/Linux system to avoid it forking to the search process, although this can be resolved by using , as below. In the API this would be equivalent to passing to SetMatchMode. ( for short) changes the matching mode to extended matching which provides various text querying operators. In the API this would be equivalent to passing to SetMatchMode. ( for short) filters the results such that only documents where the attribute given (attr) matches the value given (v). For example, only matches documents with an attribute called 'deleted' where its value is 0. You can also add multiple filters on the command line, by specifying multiple multiple times, however if you apply a second filter to an attribute it will override the first defined filter. Options for handling the results: ( for short) limits the total number of matches back to the number given. If a 'group' is specified, this will be the number of grouped results. This defaults to 20 results if not specified (as do the APIs) ( for short) offsets the result list by the number of places set by the count; this would be used for pagination through results, where if you have 20 results per 'page', the second page would begin at offset 20, the third page at offset 40, etc. ( for short) specifies that results should be grouped together based on the attribute specified. Like the GROUP BY clause in SQL, it will combine all results where the attribute given matches, and returns a set of results where each returned result is the best from each group. Unless otherwise specified, this will be the best match on relevance. ( for short) instructs that when results are grouped with , the expression given in <expr> shall determine the order of the groups. Note, this does not specify which is the best item within the group, only the order in which the groups themselves shall be returned. ( for short) specifies that results should be sorted in the order listed in <clause>. This allows you to specify the order you wish results to be presented in, ordering by different columns. For example, you could say to sort entries first by weight (or relevance) and where two or more entries have the same weight, to then sort by the time with the highest time (newest) first. You will usually need to put the items in quotes () or use commas () to avoid the items being treated separately. Additionally, like the regular sorting modes, if (grouping) is being used, this will state how to establish the best match within each group. ( for short) specifies that the search results should be presented in an order determined by an arithmetic expression, stated in expr. For example: (again noting that this will have to be quoted to avoid the shell dealing with the asterisk). Extended sort mode is discussed in more detail under the entry under the Sorting modes section of the manual. specifies that the results should be sorted by descending (i.e. most recent first) date. This requires that there is an attribute in the index that is set as a timestamp. specifies that the results should be sorted by ascending (i.e. oldest first) date. This requires that there is an attribute in the index that is set as a timestamp. specifies that the results should be sorted by timestamp in groups; it will return all of the documents whose timestamp is within the last hour, then sorted within that bracket for relevance. After, it would return the documents from the last day, sorted by relevance, then the last week and then the last month. It is discussed in more detail under the entry under the Sorting modes section of the manual. Other options: ( for short) instructs search not to look-up data in your SQL database. Specifically, for debugging with MySQL and search, you can provide it with a query to look up the full article based on the returned document ID. It is explained in more detail under the sql_query_info directive. <filename>spelldump</filename> command reference spelldump is one of the helper tools within the Sphinx package. It is used to extract the contents of a dictionary file that uses ispell or MySpell format, which can help build word lists for wordforms - all of the possible forms are pre-built for you. Its general usage is: spelldump [options] <dictionary> <affix> [result] [locale-name] The two main parameters are the dictionary's main file and its affix file; usually these are named as [language-prefix].dict and [language-prefix].aff and will be available with most common Linux distributions, as well as various places online. specifies where the dictionary data should be output to, and additionally specifies the locale details you wish to use. There is an additional option, , which specifies a file for case conversion details. Examples of its usage are: spelldump en.dict en.aff spelldump ru.dict ru.aff ru.txt ru_RU.CP1251 spelldump ru.dict ru.aff ru.txt .1251 The results file will contain a list of all the words in the dictionary in alphabetical order, output in the format of a wordforms file, which you can use to customise for your specific circumstances. An example of the result file: zone > zone zoned > zoned zoning > zoning <filename>indextool</filename> command reference indextool is one of the helper tools within the Sphinx package, introduced in version 0.9.9-rc2. It is used to dump miscellaneous debug information about the physical index. (Additional functionality such as index verification is planned in the future, hence the indextool name rather than just indexdump.) Its general usage is: indextool <command> [options] The only currently available option applies to all commands and lets you specify the configuration file: ( for short) overrides the built-in config file names. The commands are as follows: quickly dumps the provided index header file without touching any other index files or even the configuration file. The report provides a breakdown of all the index settings, in particular the entire attribute and field list. Prior to 0.9.9-rc2, this command was present in CLI search utility. dumps the index definition from the given index header file in (almost) compliant sphinx.conf file format. Added in version 2.0.1-beta. dumps index header by index name with looking up the header path in the configuration file. dumps document IDs by index name. It takes the data from attribute (.spa) file and therefore requires docinfo=extern to work. dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as text. dumps all the hits (occurences) of a given keyword in a given index, with keyword specified as internal numeric ID. filters stdin using HTML stripper settings for a given index, and prints the filtering results to stdout. Note that the settings will be taken from sphinx.conf, and not the index header. checks the index data files for consistency errors that might be introduced either by bugs in indexer and/or hardware faults. strips the path names from all the file names referenced from the index (stopwords, wordforms, exceptions, etc). This is useful for checking indexes built on another machine with possibly different path layouts. SphinxQL reference SphinxQL is our SQL dialect that exposes all of the search daemon functionality using a standard SQL syntax with a few Sphinx-specific extensions. Everything available via the SphinxAPI is also available SphinxQL but not vice versa; for instance, writes into RT indexes are only available via SphinxQL. This chapter documents supported SphinxQL statements syntax. SELECT syntax SELECT select_expr [, select_expr ...] FROM index [, index2 ...] [WHERE where_condition] [GROUP BY {col_name | expr_alias}] [ORDER BY {col_name | expr_alias} {ASC | DESC} [, ...]] [WITHIN GROUP ORDER BY {col_name | expr_alias} {ASC | DESC}] [LIMIT offset, row_count] [OPTION opt_name = opt_value [, ...]] SELECT statement was introduced in version 0.9.9-rc2. It's syntax is based upon regular SQL but adds several Sphinx-specific extensions and has a few omissions (such as (currently) missing support for JOINs). Specifically, Column list clause. Column names, arbitrary expressions, and star ('*') are all allowed (ie. SELECT @id, group_id*123+456 AS expr1 FROM test1 will work). Unlike in regular SQL, all computed expressions must be aliased with a valid identifier. Starting with version 2.0.1-beta, AS is optional. Special names such as @id and @weight should currently be used with leading at-sign. This at-sign requirement will be lifted in the future. FROM clause. FROM clause should contain the list of indexes to search through. Unlike in regular SQL, comma means enumeration of full-text indexes as in Query() API call rather than JOIN. WHERE clause. This clause will map both to fulltext query and filters. Comparison operators (=, !=, <, >, <=, >=), IN, AND, NOT, and BETWEEN are all supported and map directly to filters. OR is not supported yet but will be in the future. MATCH('query') is supported and maps to fulltext query. Query will be interpreted according to full-text query language rules. There must be at most one MATCH() in the clause. Starting with version 2.0.1-beta, {col_name | expr_alias} [NOT] IN @uservar condition syntax is supported. (Refer to for a discussion of global user variables.) GROUP BY clause. Currently only supports grouping by a single column. The column however can be a computed expression: SELECT *, group_id*1000+article_type AS gkey FROM example GROUP BY gkey Aggregate functions (AVG(), MIN(), MAX(), SUM()) in column list clause are supported. Arguments to aggregate functions can be either plain attributes or arbitrary expressions. COUNT(*) is implicitly supported as using GROUP BY will add @count column to result set. Explicit support might be added in the future. COUNT(DISTINCT attr) is supported. Currently there can be at most one COUNT(DISTINCT) per query and an argument needs to be an attribute. Both current restrictions on COUNT(DISTINCT) might be lifted in the future. SELECT *, AVG(price) AS avgprice, COUNT(DISTINCT storeid) FROM products WHERE MATCH('ipod') GROUP BY vendorid Starting with 2.0.1-beta, GROUP BY on a string attribute is supported, with respect for current collation (see ). WITHIN GROUP ORDER BY clause. This is a Sphinx specific extension that lets you control how the best row within a group will to be selected. The syntax matches that of regular ORDER BY clause: SELECT *, INTERVAL(posted,NOW()-7*86400,NOW()-86400) AS timeseg FROM example WHERE MATCH('my search query') GROUP BY siteid WITHIN GROUP ORDER BY @weight DESC ORDER BY timeseg DESC, @weight DESC Starting with 2.0.1-beta, WITHIN GROUP ORDER BY on a string attribute is supported, with respect for current collation (see ). ORDER BY clause. Unlike in regular SQL, only column names (not expressions) are allowed and explicit ASC and DESC are required. The columns however can be computed expressions: SELECT *, @weight*10+docboost AS skey FROM example ORDER BY skey Starting with 2.0.1-beta, ORDER BY on a string attribute is supported, with respect for current collation (see ). LIMIT clause. Both LIMIT N and LIMIT M,N forms are supported. Unlike in regular SQL (but like in Sphinx API), an implicit LIMIT 0,20 is present by default. OPTION clause. This is a Sphinx specific extension that lets you control a number of per-query options. The syntax is: OPTION <optionname>=<value> [ , ... ] Supported options and respectively allowed values are: 'ranker' - any of 'proximity_bm25', 'bm25', 'none', 'wordcount', 'proximity', 'matchany', or 'fieldmask' 'max_matches' - integer (per-query max matches value) 'cutoff' - integer (max found matches threshold) 'max_query_time' - integer (max search time threshold, msec) 'retry_count' - integer (distributed retries count) 'retry_delay' - integer (distributed retry delay, msec) 'field_weights' - a named integer list (per-field user weights for ranking) 'index_weights' - a named integer list (per-index user weights for ranking) 'reverse_scan' - 0 or 1, lets you control the order in which full-scan query processes the rows Example: SELECT * FROM test WHERE MATCH('@title hello @body world') OPTION ranker=bm25, max_matches=3000, field_weights=(title=10, body=3) SHOW META syntax SHOW META SHOW META shows additional meta-information about the latest query such as query time and keyword statistics: mysql> SELECT * FROM test1 WHERE MATCH('test|one|two'); +------+--------+----------+------------+ | id | weight | group_id | date_added | +------+--------+----------+------------+ | 1 | 3563 | 456 | 1231721236 | | 2 | 2563 | 123 | 1231721236 | | 4 | 1480 | 2 | 1231721236 | +------+--------+----------+------------+ 3 rows in set (0.01 sec) mysql> SHOW META; +---------------+-------+ | Variable_name | Value | +---------------+-------+ | total | 3 | | total_found | 3 | | time | 0.005 | | keyword[0] | test | | docs[0] | 3 | | hits[0] | 5 | | keyword[1] | one | | docs[1] | 1 | | hits[1] | 2 | | keyword[2] | two | | docs[2] | 1 | | hits[2] | 2 | +---------------+-------+ 12 rows in set (0.00 sec) SHOW WARNINGS syntax SHOW WARNINGS SHOW WARNINGS statement, introduced in version 0.9.9-rc2, can be used to retrieve the warning produced by the latest query. The error message will be returned along with the query itself: mysql> SELECT * FROM test1 WHERE MATCH('@@title hello') \G ERROR 1064 (42000): index test1: syntax error, unexpected TOK_FIELDLIMIT near '@title hello' mysql> SELECT * FROM test1 WHERE MATCH('@title -hello') \G ERROR 1064 (42000): index test1: query is non-computable (single NOT operator) mysql> SELECT * FROM test1 WHERE MATCH('"test doc"/3') \G *************************** 1. row *************************** id: 4 weight: 2500 group_id: 2 date_added: 1231721236 1 row in set, 1 warning (0.00 sec) mysql> SHOW WARNINGS \G *************************** 1. row *************************** Level: warning Code: 1000 Message: quorum threshold too high (words=2, thresh=3); replacing quorum operator with AND operator 1 row in set (0.00 sec) SHOW STATUS syntax SHOW STATUS, introduced in version 0.9.9-rc2, displays a number of useful performance counters. IO and CPU counters will only be available if searchd was started with --iostats and --cpustats switches respectively. mysql> SHOW STATUS; +--------------------+-------+ | Variable_name | Value | +--------------------+-------+ | uptime | 216 | | connections | 3 | | maxed_out | 0 | | command_search | 0 | | command_excerpt | 0 | | command_update | 0 | | command_keywords | 0 | | command_persist | 0 | | command_status | 0 | | agent_connect | 0 | | agent_retry | 0 | | queries | 10 | | dist_queries | 0 | | query_wall | 0.075 | | query_cpu | OFF | | dist_wall | 0.000 | | dist_local | 0.000 | | dist_wait | 0.000 | | query_reads | OFF | | query_readkb | OFF | | query_readtime | OFF | | avg_query_wall | 0.007 | | avg_query_cpu | OFF | | avg_dist_wall | 0.000 | | avg_dist_local | 0.000 | | avg_dist_wait | 0.000 | | avg_query_reads | OFF | | avg_query_readkb | OFF | | avg_query_readtime | OFF | +--------------------+-------+ 29 rows in set (0.00 sec) INSERT and REPLACE syntax {INSERT | REPLACE} INTO index [(column, ...)] VALUES (value, ...) [, (...)] INSERT statement, introduced in version 1.10-beta, is only supported for RT indexes. It inserts new rows (documents) into an existing index, with the provided column values. ID column must be present in all cases. Rows with duplicate IDs will not be overwritten by INSERT; use REPLACE to do that. is the name of RT index into which the new row(s) should be inserted. The optional column names list lets you only explicitly specify values for some of the columns present in the index. All the other columns will be filled with their default values (0 for scalar types, empty string for text types). Expressions are not currently supported in INSERT and values should be explicitly specified. Multiple rows can be inserted using a single INSERT statement by providing several comma-separated, parens-enclosed lists of rows values. DELETE syntax DELETE FROM index WHERE {id = value | id IN (val1 [, val2 [, ...]])} DELETE statement, introduced in version 1.10-beta, is only supported for RT indexes. It deletes existing rows (documents) from an existing index based on ID. is the name of RT index from which the row should be deleted. is the row ID to be deleted. Support for batch id IN (2,3,5) syntax was added in version 2.0.1-beta. Additional types of WHERE conditions (such as conditions on attributes, etc) are planned, but not supported yet as of 1.10-beta. SET syntax SET [GLOBAL] server_variable_name = value SET GLOBAL @user_variable_name = (int_val1 [, int_val2, ...]) SET statement, introduced in version 1.10-beta, modifies a server variable value. The variable names are case-insensitive. No variable value changes survive server restart. There are the following classes of the variables: per-session server variable (1.10-beta and above) global server variable (2.0.1-beta and above) global user variable (2.0.1-beta and above) Global user variables are shared between concurrent sessions. Currently, the only supported value type is the list of BIGINTs, and these variables can only be used along with IN() for filtering purpose. The intended usage scenario is uploading huge lists of values to searchd (once) and reusing them (many times) later, saving on network overheads. Example: // in session 1 mysql> SET GLOBAL @myfilter=(2,3,5,7,11,13); Query OK, 0 rows affected (0.00 sec) // later in session 2 mysql> SELECT * FROM test1 WHERE group_id IN @myfilter; +------+--------+----------+------------+-----------------+------+ | id | weight | group_id | date_added | title | tag | +------+--------+----------+------------+-----------------+------+ | 3 | 1 | 2 | 1299338153 | another doc | 15 | | 4 | 1 | 2 | 1299338153 | doc number four | 7,40 | +------+--------+----------+------------+-----------------+------+ 2 rows in set (0.02 sec) Per-session and global server variables affect certain server settings in the respective scope. Known per-session server variables are: AUTOCOMMIT = {0 | 1} Whether any data modification statement should be implicitly wrapped by BEGIN and COMMIT. Introduced in version 1.10-beta. COLLATION_CONNECTION = collation_name Selects the collation to be used for ORDER BY or GROUP BY on string values in the subsequent queries. Refer to for a list of known collation names. Introduced in version 2.0.1-beta. CHARACTER_SET_RESULTS = charset_name Does nothing; a placeholder to support frameworks, clients, and connectors that attempt to automatically enforce a charset when connecting to a Sphinx server. Introduced in version 2.0.1-beta. Known global server variables are: QUERY_LOG_FORMAT = {plain | sphinxql} Changes the current log format. Introduced in version 2.0.1-beta. LOG_LEVEL = {info | debug | debugv | debugvv} Changes the current log verboseness level. Introduced in version 2.0.1-beta. Examples: mysql> SET autocommit=0; Query OK, 0 rows affected (0.00 sec) mysql> SET GLOBAL query_log_format=sphinxql; Query OK, 0 rows affected (0.00 sec) BEGIN, COMMIT, and ROLLBACK syntax START TRANSACTION | BEGIN COMMIT ROLLBACK SET AUTOCOMMIT = {0 | 1} BEGIN, COMMIT, and ROLLBACK statements were introduced in version 1.10-beta. BEGIN statement (or its START TRANSACTION alias) forcibly commits pending transaction, if any, and begins a new one. COMMIT statement commits the current transaction, making all its changes permanent. ROLLBACK statement rolls back the current transaction, canceling all its changes. SET AUTOCOMMIT controls the autocommit mode in the active session. AUTOCOMMIT is set to 1 by default, meaning that every statement that perfoms any changes on any index is implicitly wrapped in BEGIN and COMMIT. Transactions are limited to a single RT index, and also limited in size. They are atomic, consistent, overly isolated, and durable. Overly isolated means that the changes are not only invisible to the concurrent transactions but even to the current session itself. CALL SNIPPETS syntax CALL SNIPPETS(data, index, query[, opt_value AS opt_name[, ...]]) CALL SNIPPETS statement, introduced in version 1.10-beta, builds a snippet from provided data and query, using specified index settings. is the source data string to extract a snippet from. is the name of the index from which to take the text processing settings. is the full-text query to build snippets for. Additional options are documented in . Usage example: CALL SNIPPETS('this is my document text', 'test1', 'hello world', 5 AS around, 200 AS limit) CALL KEYWORDS syntax CALL KEYWORDS(text, index, [hits]) CALL KEYWORDS statement, introduced in version 1.10-beta, splits text into particular keywords. It returns tokenized and normalized forms of the keywords, and, optionally, keyword statistics. is the text to break down to keywords. is the name of the index from which to take the text processing settings. is an optional boolean parameter that specifies whether to return document and hit occurrence statistics. SHOW TABLES syntax SHOW TABLES SHOW TABLES statement, introduced in version 2.0.1-beta, enumerates all currently active indexes along with their types. As of 2.0.1-beta, existing index types are , , and respectively. Example: mysql> SHOW TABLES; +-------+-------------+ | Index | Type | +-------+-------------+ | dist1 | distributed | | rt | rt | | test1 | local | | test2 | local | +-------+-------------+ 4 rows in set (0.00 sec) DESCRIBE syntax {DESC | DESCRIBE} index DESCRIBE statement, introduced in version 2.0.1-beta, lists index columns and their associated types. Columns are document ID, full-text fields, and attributes. The order matches that in which fields and attributes are expected by INSERT and REPLACE statements. As of 2.0.1-beta, column types are , , , , , , , , and . ID column will be typed either or based on whether the binaries were built with 32-bit or 64-bit document ID support. Example: mysql> DESC rt; +---------+---------+ | Field | Type | +---------+---------+ | id | integer | | title | field | | content | field | | gid | integer | +---------+---------+ 4 rows in set (0.00 sec) CREATE FUNCTION syntax CREATE FUNCTION udf_name RETURNS {INT | BIGINT | FLOAT} SONAME 'udf_lib_file' CREATE FUNCTION statement, introduced in version 2.0.1-beta, installs a user-defined function (UDF) with the given name and type from the given library file. The library file must reside in a trusted plugin_dir directory. On success, the function is available for use in all subsequent queries that the server receives. Example: mysql> CREATE FUNCTION avgmva RETURNS INT SONAME 'udfexample.dll'; Query OK, 0 rows affected (0.03 sec) mysql> SELECT *, AVGMVA(tag) AS q from test1; +------+--------+---------+-----------+ | id | weight | tag | q | +------+--------+---------+-----------+ | 1 | 1 | 1,3,5,7 | 4.000000 | | 2 | 1 | 2,4,6 | 4.000000 | | 3 | 1 | 15 | 15.000000 | | 4 | 1 | 7,40 | 23.500000 | +------+--------+---------+-----------+ DROP FUNCTION syntax DROP FUNCTION udf_name DROP FUNCTION statement, introduced in version 2.0.1-beta, deinstalls a user-defined function (UDF) with the given name. On success, the function is no longer available for use in subsequent queries. Pending concurrent queries will not be affected and the library unload, if necessary, will be postponed until those queries complete. Example: mysql> DROP FUNCTION avgmva; Query OK, 0 rows affected (0.00 sec) SHOW VARIABLES syntax SHOW VARIABLES Added in version 2.0.1-beta, this is currently a placeholder query that does nothing and reports success. That is in order to keep compatibility with frameworks and connectors that automatically execute this statement. mysql> SHOW VARIABLES; Query OK, 0 rows affected (0.00 sec) SHOW COLLATION syntax SHOW COLLATION Added in version 2.0.1-beta, this is currently a placeholder query that does nothing and reports success. That is in order to keep compatibility with frameworks and connectors that automatically execute this statement. mysql> SHOW COLLATION; Query OK, 0 rows affected (0.00 sec) UPDATE syntax UPDATE index SET col1 = newval1 [, ...] WHERE ID = docid UPDATE statement was added in version 2.0.1-beta. It can currently update 32-bit integer attributes only. Multiple attributes and values can be specified. Both RT and disk indexes are supported. Updates on other attribute types are also planned. mysql> UPDATE myindex SET enabled=0 WHERE id=123; Query OK, 1 rows affected (0.00 sec) Multi-statement queries Starting version 2.0.1-beta, SphinxQL supports multi-statement queries, or batches. Possible inter-statement optimizations described in do apply to SphinxQL just as well. The batched queries should be separated by a semicolon. Your MySQL client library needs to support MySQL multi-query mechanism and multiple result set. For instance, mysqli interface in PHP and DBI/DBD libraries in Perl are known to work. Here's a PHP sample showing how to utilize mysqli interface with Sphinx. Its output with the sample test1 index included with Sphinx is as follows. $ php test_multi.php id=1 id=2 id=3 id=4 ------ id=3 id=4 id=1 id=2 The following statements can currently be used in a batch: SELECT, SHOW WARNINGS, SHOW STATUS, and SHOW META. Arbitrary sequence of these statements are allowed. The results sets returned should match those that would be returned if the batched queries were sent one by one. Comment syntax Since version 2.0.1-beta, SphinxQL supports C-style comment syntax. Everything from an opening /* sequence to a closing */ sequence is ignored. Comments can span multiple lines, can not nest, and should not get logged. MySQL specific /*! ... */ comments are also currently ignored. (As the comments support was rather added for better compatibility with mysqldump produced dumps, rather than improving generaly query interoperability between Sphinx and MySQL.) SELECT /*! SQL_CALC_FOUND_ROWS */ col1 FROM table1 WHERE ... List of SphinxQL reserved keywords A complete alphabetical list of keywords that are currently reserved in SphinxQL syntax (and therefore can not be used as identifiers). AND AS ASC AVG BEGIN BETWEEN BY CALL COLLATION COMMIT COUNT DELETE DESC DESCRIBE DISTINCT FALSE FROM GLOBAL GROUP ID IN INSERT INTO LIMIT MATCH MAX META MIN NOT NULL OPTION OR ORDER REPLACE ROLLBACK SELECT SET SHOW START STATUS SUM TABLES TRANSACTION TRUE UPDATE VALUES VARIABLES WARNINGS WEIGHT WHERE WITHIN SphinxQL upgrade notes, version 2.0.1-beta This section only applies to existing applications that use SphinxQL versions prior to 2.0.1-beta. In previous versions, SphinxQL just wrapped around SphinxAPI and inherited its magic columns and column set quirks. Essentially, SphinxQL queries could return (slightly) different columns and in a (slightly) different order than it was explicitly requested in the query. Namely, weight magic column (which is not a real column in any index) was added at all times, and GROUP BY related @count, @group, and @distinct magic columns were conditionally added when grouping. Also, the order of columns (attributes) in the result set was actually taken from the index rather than the query. (So if you asked for columns C, B, A in your query but they were in the A, B, C order in the index, they would have been returned in the A, B, C order.) In version 2.0.1-beta, we fixed that. SphinxQL is now more SQL compliant (and will be further brought in as much compliance with standard SQL syntax as possible). That is not yet a breaking change, because searchd now supports compat_sphinxql_magics directive that flips between the old "compatibility" mode and the new "compliance" mode. However, the compatibility mode support is going to be removed in future, so it's strongly advised to update SphinxQL applications and switch to the compliance mode. The important changes are as follows: @ID magic name is deprecated in favor of ID. Document ID is considered an attribute. WEIGHT is no longer implicitly returned, because it is not actually a column (an index attribute), but rather an internal function computed per each row (a match). You have to explicitly ask for it, using the WEIGHT() function. (The requirement to alias the result will be lifted in the next release.) SELECT id, WEIGHT() w FROM myindex WHERE MATCH('test') You can now use quoted reserved keywords as aliases. The quote character is backtick ("`", ASCII code 96 decimal, 60 hex). One particularly useful example would be returning weight column like the old mode: SELECT id, WEIGHT() `weight` FROM myindex WHERE MATCH('test') The column order is now different and should now match the one expliclitly defined in the query. So if you are accessing columns based on their position in the result set rather than the name (for instance, by using mysql_fetch_row() rather than mysql_fetch_assoc() in PHP), check and fix the order of columns in your queries. SELECT * return the columns in index order, as it used to, including the ID column. However, SELECT * does not automatically return WEIGHT(). To update such queries in case you access columns by names, simply add it to the query: SELECT *, WEIGHT() `weight` FROM myindex WHERE MATCH('test') Otherwise, i.e., in case you rely on column order, select ID, weight, and then other columns: SELECT id, *, WEIGHT() `weight` FROM myindex WHERE MATCH('test') Magic @count and @distinct attributes are no longer implicitly returned. You now have to explicitly ask for them when using GROUP BY. (Also note that you currently have to alias them; that requirement will be lifted in the future.) SELECT gid, COUNT(*) q FROM myindex WHERE MATCH('test') GROUP BY gid ORDER BY q DESC API reference There is a number of native searchd client API implementations for Sphinx. As of time of this writing, we officially support our own PHP, Python, and Java implementations. There also are third party free, open-source API implementations for Perl, Ruby, and C++. The reference API implementation is in PHP, because (we believe) Sphinx is most widely used with PHP than any other language. This reference documentation is in turn based on reference PHP API, and all code samples in this section will be given in PHP. However, all other APIs provide the same methods and implement the very same network protocol. Therefore the documentation does apply to them as well. There might be minor differences as to the method naming conventions or specific data structures used. But the provided functionality must not differ across languages. General API functions GetLastError Prototype: function GetLastError() Returns last error message, as a string, in human readable format. If there were no errors during the previous API call, empty string is returned. You should call it when any other function (such as Query()) fails (typically, the failing function returns false). The returned string will contain the error description. The error message is not reset by this call; so you can safely call it several times if needed. GetLastWarning Prototype: function GetLastWarning () Returns last warning message, as a string, in human readable format. If there were no warnings during the previous API call, empty string is returned. You should call it to verify whether your request (such as Query()) was completed but with warnings. For instance, search query against a distributed index might complete succesfully even if several remote agents timed out. In that case, a warning message would be produced. The warning message is not reset by this call; so you can safely call it several times if needed. SetServer Prototype: function SetServer ( $host, $port ) Sets searchd host name and TCP port. All subsequent requests will use the new host and port settings. Default host and port are 'localhost' and 9312, respectively. SetRetries Prototype: function SetRetries ( $count, $delay=0 ) Sets distributed retry count and delay. On temporary failures searchd will attempt up to $count retries per agent. $delay is the delay between the retries, in milliseconds. Retries are disabled by default. Note that this call will not make the API itself retry on temporary failure; it only tells searchd to do so. Currently, the list of temporary failures includes all kinds of connect() failures and maxed out (too busy) remote agents. SetConnectTimeout Prototype: function SetConnectTimeout ( $timeout ) Sets the time allowed to spend connecting to the server before giving up. Under some circumstances, the server can be delayed in responding, either due to network delays, or a query backlog. In either instance, this allows the client application programmer some degree of control over how their program interacts with searchd when not available, and can ensure that the client application does not fail due to exceeding the script execution limits (especially in PHP). In the event of a failure to connect, an appropriate error code should be returned back to the application in order for application-level error handling to advise the user. SetArrayResult Prototype: function SetArrayResult ( $arrayresult ) PHP specific. Controls matches format in the search results set (whether matches should be returned as an array or a hash). $arrayresult argument must be boolean. If $arrayresult is false (the default mode), matches will returned in PHP hash format with document IDs as keys, and other information (weight, attributes) as values. If $arrayresult is true, matches will be returned as a plain array with complete per-match information including document ID. Introduced along with GROUP BY support on MVA attributes. Group-by-MVA result sets may contain duplicate document IDs. Thus they need to be returned as plain arrays, because hashes will only keep one entry per document ID. IsConnectError Prototype: function IsConnectError () Checks whether the last error was a network error on API side, or a remote error reported by searchd. Returns true if the last connection attempt to searchd failed on API side, false otherwise (if the error was remote, or there were no connection attempts at all). Introduced in version 0.9.9-rc1. General query settings SetLimits Prototype: function SetLimits ( $offset, $limit, $max_matches=0, $cutoff=0 ) Sets offset into server-side result set ($offset) and amount of matches to return to client starting from that offset ($limit). Can additionally control maximum server-side result set size for current query ($max_matches) and the threshold amount of matches to stop searching at ($cutoff). All parameters must be non-negative integers. First two parameters to SetLimits() are identical in behavior to MySQL LIMIT clause. They instruct searchd to return at most $limit matches starting from match number $offset. The default offset and limit settings are 0 and 20, that is, to return first 20 matches. max_matches setting controls how much matches searchd will keep in RAM while searching. All matching documents will be normally processed, ranked, filtered, and sorted even if max_matches is set to 1. But only best N documents are stored in memory at any given moment for performance and RAM usage reasons, and this setting controls that N. Note that there are two places where max_matches limit is enforced. Per-query limit is controlled by this API call, but there also is per-server limit controlled by max_matches setting in the config file. To prevent RAM usage abuse, server will not allow to set per-query limit higher than the per-server limit. You can't retrieve more than max_matches matches to the client application. The default limit is set to 1000. Normally, you must not have to go over this limit. One thousand records is enough to present to the end user. And if you're thinking about pulling the results to application for further sorting or filtering, that would be much more efficient if performed on Sphinx side. $cutoff setting is intended for advanced performance control. It tells searchd to forcibly stop search query once $cutoff matches had been found and processed. SetMaxQueryTime Prototype: function SetMaxQueryTime ( $max_query_time ) Sets maximum search query time, in milliseconds. Parameter must be a non-negative integer. Default valus is 0 which means "do not limit". Similar to $cutoff setting from SetLimits(), but limits elapsed query time instead of processed matches count. Local search queries will be stopped once that much time has elapsed. Note that if you're performing a search which queries several local indexes, this limit applies to each index separately. SetOverride Prototype: function SetOverride ( $attrname, $attrtype, $values ) Sets temporary (per-query) per-document attribute value overrides. Only supports scalar attributes. $values must be a hash that maps document IDs to overridden attribute values. Introduced in version 0.9.9-rc1. Override feature lets you "temporary" update attribute values for some documents within a single query, leaving all other queries unaffected. This might be useful for personalized data. For example, assume you're implementing a personalized search function that wants to boost the posts that the user's friends recommend. Such data is not just dynamic, but also personal; so you can't simply put it in the index because you don't want everyone's searches affected. Overrides, on the other hand, are local to a single query and invisible to everyone else. So you can, say, setup a "friends_weight" value for every document, defaulting to 0, then temporary override it with 1 for documents 123, 456 and 789 (recommended by exactly the friends of current user), and use that value when ranking. SetSelect Prototype: function SetSelect ( $clause ) Sets the select clause, listing specific attributes to fetch, and expressions to compute and fetch. Clause syntax mimics SQL. Introduced in version 0.9.9-rc1. SetSelect() is very similar to the part of a typical SQL query between SELECT and FROM. It lets you choose what attributes (columns) to fetch, and also what expressions over the columns to compute and fetch. A certain difference from SQL is that expressions must always be aliased to a correct identifier (consisting of letters and digits) using 'AS' keyword. SQL also lets you do that but does not require to. Sphinx enforces aliases so that the computation results can always be returned under a "normal" name in the result set, used in other clauses, etc. Everything else is basically identical to SQL. Star ('*') is supported. Functions are supported. Arbitrary amount of expressions is supported. Computed expressions can be used for sorting, filtering, and grouping, just as the regular attributes. Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported when using GROUP BY. Expression sorting () and geodistance functions () are now internally implemented using this computed expressions mechanism, using magic names '@expr' and '@geodist' respectively. Example: $cl->SetSelect ( "*, @weight+(user_karma+ln(pageviews))*0.1 AS myweight" ); $cl->SetSelect ( "exp_years, salary_gbp*{$gbp_usd_rate} AS salary_usd, IF(age>40,1,0) AS over40" ); $cl->SetSelect ( "*, AVG(price) AS avgprice" ); Full-text search query settings SetMatchMode Prototype: function SetMatchMode ( $mode ) Sets full-text query matching mode, as described in . Parameter must be a constant specifying one of the known modes. WARNING: (PHP specific) you must not take the matching mode constant name in quotes, that syntax specifies a string and is incorrect: $cl->SetMatchMode ( "SPH_MATCH_ANY" ); // INCORRECT! will not work as expected $cl->SetMatchMode ( SPH_MATCH_ANY ); // correct, works OK SetRankingMode Prototype: function SetRankingMode ( $ranker ) Sets ranking mode (aka ranker). Only available in SPH_MATCH_EXTENDED matching mode. Parameter must be a constant specifying one of the known rankers. By default, in the EXTENDED matching mode Sphinx computes two factors which contribute to the final match weight. The major part is a phrase proximity value between the document text and the query. The minor part is so-called BM25 statistical function, which varies from 0 to 1 depending on the keyword frequency within document (more occurrences yield higher weight) and within the whole index (more rare keywords yield higher weight). However, in some cases you'd want to compute weight differently - or maybe avoid computing it at all for performance reasons because you're sorting the result set by something else anyway. This can be accomplished by setting the appropriate ranking mode. The list of the modes is available in . SetSortMode Prototype: function SetSortMode ( $mode, $sortby="" ) Set matches sorting mode, as described in . Parameter must be a constant specifying one of the known modes. WARNING: (PHP specific) you must not take the matching mode constant name in quotes, that syntax specifies a string and is incorrect: $cl->SetSortMode ( "SPH_SORT_ATTR_DESC" ); // INCORRECT! will not work as expected $cl->SetSortMode ( SPH_SORT_ATTR_ASC ); // correct, works OK SetWeights Prototype: function SetWeights ( $weights ) Binds per-field weights in the order of appearance in the index. DEPRECATED, use SetFieldWeights() instead. SetFieldWeights Prototype: function SetFieldWeights ( $weights ) Binds per-field weights by name. Parameter must be a hash (associative array) mapping string field names to integer weights. Match ranking can be affected by per-field weights. For instance, see for an explanation how phrase proximity ranking is affected. This call lets you specify what non-default weights to assign to different full-text fields. The weights must be positive 32-bit integers. The final weight will be a 32-bit integer too. Default weight value is 1. Unknown field names will be silently ignored. There is no enforced limit on the maximum weight value at the moment. However, beware that if you set it too high you can start hitting 32-bit wraparound issues. For instance, if you set a weight of 10,000,000 and search in extended mode, then maximum possible weight will be equal to 10 million (your weight) by 1 thousand (internal BM25 scaling factor, see ) by 1 or more (phrase proximity rank). The result is at least 10 billion that does not fit in 32 bits and will be wrapped around, producing unexpected results. SetIndexWeights Prototype: function SetIndexWeights ( $weights ) Sets per-index weights, and enables weighted summing of match weights across different indexes. Parameter must be a hash (associative array) mapping string index names to integer weights. Default is empty array that means to disable weighting summing. When a match with the same document ID is found in several different local indexes, by default Sphinx simply chooses the match from the index specified last in the query. This is to support searching through partially overlapping index partitions. However in some cases the indexes are not just partitions, and you might want to sum the weights across the indexes instead of picking one. SetIndexWeights() lets you do that. With summing enabled, final match weight in result set will be computed as a sum of match weight coming from the given index multiplied by respective per-index weight specified in this call. Ie. if the document 123 is found in index A with the weight of 2, and also in index B with the weight of 3, and you called SetIndexWeights ( array ( "A"=>100, "B"=>10 ) ), the final weight return to the client will be 2*100+3*10 = 230. Result set filtering settings SetIDRange Prototype: function SetIDRange ( $min, $max ) Sets an accepted range of document IDs. Parameters must be integers. Defaults are 0 and 0; that combination means to not limit by range. After this call, only those records that have document ID between $min and $max (including IDs exactly equal to $min or $max) will be matched. SetFilter Prototype: function SetFilter ( $attribute, $values, $exclude=false ) Adds new integer values set filter. On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $values must be a plain array containing integer values. $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them. Only those documents where $attribute column value stored in the index matches any of the values from $values array will be matched (or rejected, if $exclude is true). SetFilterRange Prototype: function SetFilterRange ( $attribute, $min, $max, $exclude=false ) Adds new integer range filter. On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $min and $max must be integers that define the acceptable attribute values range (including the boundaries). $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them. Only those documents where $attribute column value stored in the index is between $min and $max (including values that are exactly equal to $min or $max) will be matched (or rejected, if $exclude is true). SetFilterFloatRange Prototype: function SetFilterFloatRange ( $attribute, $min, $max, $exclude=false ) Adds new float range filter. On this call, additional new filter is added to the existing list of filters. $attribute must be a string with attribute name. $min and $max must be floats that define the acceptable attribute values range (including the boundaries). $exclude must be a boolean value; it controls whether to accept the matching documents (default mode, when $exclude is false) or reject them. Only those documents where $attribute column value stored in the index is between $min and $max (including values that are exactly equal to $min or $max) will be matched (or rejected, if $exclude is true). SetGeoAnchor Prototype: function SetGeoAnchor ( $attrlat, $attrlong, $lat, $long ) Sets anchor point for and geosphere distance (geodistance) calculations, and enable them. $attrlat and $attrlong must be strings that contain the names of latitude and longitude attributes, respectively. $lat and $long are floats that specify anchor point latitude and longitude, in radians. Once an anchor point is set, you can use magic "@geodist" attribute name in your filters and/or sorting expressions. Sphinx will compute geosphere distance between the given anchor point and a point specified by latitude and lognitude attributes from each full-text match, and attach this value to the resulting match. The latitude and longitude values both in SetGeoAnchor and the index attribute data are expected to be in radians. The result will be returned in meters, so geodistance value of 1000.0 means 1 km. 1 mile is approximately 1609.344 meters. GROUP BY settings SetGroupBy Prototype: function SetGroupBy ( $attribute, $func, $groupsort="@group desc" ) Sets grouping attribute, function, and groups sorting mode; and enables grouping (as described in ). $attribute is a string that contains group-by attribute name. $func is a constant that chooses a function applied to the attribute value in order to compute group-by key. $groupsort is a clause that controls how the groups will be sorted. Its syntax is similar to that described in . Grouping feature is very similar in nature to GROUP BY clause from SQL. Results produces by this function call are going to be the same as produced by the following pseudo code: SELECT ... GROUP BY $func($attribute) ORDER BY $groupsort Note that it's $groupsort that affects the order of matches in the final result set. Sorting mode (see ) affect the ordering of matches within group, ie. what match will be selected as the best one from the group. So you can for instance order the groups by matches count and select the most relevant match within each group at the same time. Starting with version 0.9.9-rc2, aggregate functions (AVG(), MIN(), MAX(), SUM()) are supported through SetSelect() API call when using GROUP BY. Starting with version 2.0.1-beta, grouping on string attributes is supported, with respect to current collation. SetGroupDistinct Prototype: function SetGroupDistinct ( $attribute ) Sets attribute name for per-group distinct values count calculations. Only available for grouping queries. $attribute is a string that contains the attribute name. For each group, all values of this attribute will be stored (as RAM limits permit), then the amount of distinct values will be calculated and returned to the client. This feature is similar to COUNT(DISTINCT) clause in standard SQL; so these Sphinx calls: $cl->SetGroupBy ( "category", SPH_GROUPBY_ATTR, "@count desc" ); $cl->SetGroupDistinct ( "vendor" ); can be expressed using the following SQL clauses: SELECT id, weight, all-attributes, COUNT(DISTINCT vendor) AS @distinct, COUNT(*) AS @count FROM products GROUP BY category ORDER BY @count DESC In the sample pseudo code shown just above, SetGroupDistinct() call corresponds to COUNT(DISINCT vendor) clause only. GROUP BY, ORDER BY, and COUNT(*) clauses are all an equivalent of SetGroupBy() settings. Both queries will return one matching row for each category. In addition to indexed attributes, matches will also contain total per-category matches count, and the count of distinct vendor IDs within each category. Querying Query Prototype: function Query ( $query, $index="*", $comment="" ) Connects to searchd server, runs given search query with current settings, obtains and returns the result set. $query is a query string. $index is an index name (or names) string. Returns false and sets GetLastError() message on general error. Returns search result set on success. Additionally, the contents of $comment are sent to the query log, marked in square brackets, just before the search terms, which can be very useful for debugging. Currently, the comment is limited to 128 characters. Default value for $index is "*" that means to query all local indexes. Characters allowed in index names include Latin letters (a-z), numbers (0-9), minus sign (-), and underscore (_); everything else is considered a separator. Therefore, all of the following samples calls are valid and will search the same two indexes: $cl->Query ( "test query", "main delta" ); $cl->Query ( "test query", "main;delta" ); $cl->Query ( "test query", "main, delta" ); Index specification order matters. If document with identical IDs are found in two or more indexes, weight and attribute values from the very last matching index will be used for sorting and returning to client (unless explicitly overridden with SetIndexWeights()). Therefore, in the example above, matches from "delta" index will always win over matches from "main". On success, Query() returns a result set that contains some of the found matches (as requested by SetLimits()) and additional general per-query statistics. The result set is a hash (PHP specific; other languages might utilize other structures instead of hash) with the following keys and values: "matches": Hash which maps found document IDs to another small hash containing document weight and attribute values (or an array of the similar small hashes if SetArrayResult() was enabled). "total": Total amount of matches retrieved on server (ie. to the server side result set) by this query. You can retrieve up to this amount of matches from server for this query text with current query settings. "total_found": Total amount of matching documents in index (that were found and procesed on server). "words": Hash which maps query keywords (case-folded, stemmed, and otherwise processed) to a small hash with per-keyword statitics ("docs", "hits"). "error": Query error message reported by searchd (string, human readable). Empty if there were no errors. "warning": Query warning message reported by searchd (string, human readable). Empty if there were no warnings. It should be noted that Query() carries out the same actions as AddQuery() and RunQueries() without the intermediate steps; it is analoguous to a single AddQuery() call, followed by a corresponding RunQueries(), then returning the first array element of matches (from the first, and only, query.) AddQuery Prototype: function AddQuery ( $query, $index="*", $comment="" ) Adds additional query with current settings to multi-query batch. $query is a query string. $index is an index name (or names) string. Additionally if provided, the contents of $comment are sent to the query log, marked in square brackets, just before the search terms, which can be very useful for debugging. Currently, this is limited to 128 characters. Returns index to results array returned from RunQueries(). Batch queries (or multi-queries) enable searchd to perform internal optimizations if possible. They also reduce network connection overheads and search process creation overheads in all cases. They do not result in any additional overheads compared to simple queries. Thus, if you run several different queries from your web page, you should always consider using multi-queries. For instance, running the same full-text query but with different sorting or group-by settings will enable searchd to perform expensive full-text search and ranking operation only once, but compute multiple group-by results from its output. This can be a big saver when you need to display not just plain search results but also some per-category counts, such as the amount of products grouped by vendor. Without multi-query, you would have to run several queries which perform essentially the same search and retrieve the same matches, but create result sets differently. With multi-query, you simply pass all these querys in a single batch and Sphinx optimizes the redundant full-text search internally. AddQuery() internally saves full current settings state along with the query, and you can safely change them afterwards for subsequent AddQuery() calls. Already added queries will not be affected; there's actually no way to change them at all. Here's an example: $cl->SetSortMode ( SPH_SORT_RELEVANCE ); $cl->AddQuery ( "hello world", "documents" ); $cl->SetSortMode ( SPH_SORT_ATTR_DESC, "price" ); $cl->AddQuery ( "ipod", "products" ); $cl->AddQuery ( "harry potter", "books" ); $results = $cl->RunQueries (); With the code above, 1st query will search for "hello world" in "documents" index and sort results by relevance, 2nd query will search for "ipod" in "products" index and sort results by price, and 3rd query will search for "harry potter" in "books" index while still sorting by price. Note that 2nd SetSortMode() call does not affect the first query (because it's already added) but affects both other subsequent queries. Additionally, any filters set up before an AddQuery() will fall through to subsequent queries. So, if SetFilter() is called before the first query, the same filter will be in place for the second (and subsequent) queries batched through AddQuery() unless you call ResetFilters() first. Alternatively, you can add additional filters as well. This would also be true for grouping options and sorting options; no current sorting, filtering, and grouping settings are affected by this call; so subsequent queries will reuse current query settings. AddQuery() returns an index into an array of results that will be returned from RunQueries() call. It is simply a sequentially increasing 0-based integer, ie. first call will return 0, second will return 1, and so on. Just a small helper so you won't have to track the indexes manualy if you need then. RunQueries Prototype: function RunQueries () Connect to searchd, runs a batch of all queries added using AddQuery(), obtains and returns the result sets. Returns false and sets GetLastError() message on general error (such as network I/O failure). Returns a plain array of result sets on success. Each result set in the returned array is exactly the same as the result set returned from Query(). Note that the batch query request itself almost always succeds - unless there's a network error, blocking index rotation in progress, or another general failure which prevents the whole request from being processed. However individual queries within the batch might very well fail. In this case their respective result sets will contain non-empty "error" message, but no matches or query statistics. In the extreme case all queries within the batch could fail. There still will be no general error reported, because API was able to succesfully connect to searchd, submit the batch, and receive the results - but every result set will have a specific error message. ResetFilters Prototype: function ResetFilters () Clears all currently set filters. This call is only normally required when using multi-queries. You might want to set different filters for different queries in the batch. To do that, you should call ResetFilters() and add new filters using the respective calls. ResetGroupBy Prototype: function ResetGroupBy () Clears all currently group-by settings, and disables group-by. This call is only normally required when using multi-queries. You can change individual group-by settings using SetGroupBy() and SetGroupDistinct() calls, but you can not disable group-by using those calls. ResetGroupBy() fully resets previous group-by settings and disables group-by mode in the current state, so that subsequent AddQuery() calls can perform non-grouping searches. Additional functionality BuildExcerpts Prototype: function BuildExcerpts ( $docs, $index, $words, $opts=array() ) Excerpts (snippets) builder function. Connects to searchd, asks it to generate excerpts (snippets) from given documents, and returns the results. $docs is a plain array of strings that carry the documents' contents. $index is an index name string. Different settings (such as charset, morphology, wordforms) from given index will be used. $words is a string that contains the keywords to highlight. They will be processed with respect to index settings. For instance, if English stemming is enabled in the index, "shoes" will be highlighted even if keyword is "shoe". Starting with version 0.9.9-rc1, keywords can contain wildcards, that work similarly to star-syntax available in queries. $opts is a hash which contains additional optional highlighting parameters: "before_match": A string to insert before a keyword match. Starting with version 1.10-beta, a %PASSAGE_ID% macro can be used in this string. The macro is replaced with an incrementing passage number within a current snippet. Numbering starts at 1 by default but can be overridden with "start_passage_id" option. In a multi-document call, %PASSAGE_ID% would restart at every given document. Default is "<b>". "after_match": A string to insert after a keyword match. Starting with version 1.10-beta, a %PASSAGE_ID% macro can be used in this string. Default is "</b>". "chunk_separator": A string to insert between snippet chunks (passages). Default is " ... ". "limit": Maximum snippet size, in symbols (codepoints). Integer, default is 256. "around": How much words to pick around each matching keywords block. Integer, default is 5. "exact_phrase": Whether to highlight exact query phrase matches only instead of individual keywords. Boolean, default is false. "single_passage": Whether to extract single best passage only. Boolean, default is false. "use_boundaries": Whether to additionaly break passages by phrase boundary characters, as configured in index settings with phrase_boundary directive. Boolean, default is false. "weight_order": Whether to sort the extracted passages in order of relevance (decreasing weight), or in order of appearance in the document (increasing position). Boolean, default is false. "query_mode": Added in version 1.10-beta. Whether to handle $words as a query in extended syntax, or as a bag of words (default behavior). For instance, in query mode ("one two" | "three four") will only highlight and include those occurrences "one two" or "three four" when the two words from each pair are adjacent to each other. In default mode, any single occurrence of "one", "two", "three", or "four" would be highlighted. Boolean, default is false. "force_all_words": Added in version 1.10-beta. Ignores the snippet length limit until it includes all the keywords. Boolean, default is false. "limit_passages": Added in version 1.10-beta. Limits the maximum number of passages that can be included into the snippet. Integer, default is 0 (no limit). "limit_words": Added in version 1.10-beta. Limits the maximum number of keywords that can be included into the snippet. Integer, default is 0 (no limit). "start_passage_id": Added in version 1.10-beta. Specifies the starting value of %PASSAGE_ID% macro (that gets detected and expanded in , strings). Integer, default is 1. "load_files": Added in version 1.10-beta. Whether to handle $docs as data to extract snippets from (default behavior), or to treat it as file names, and load data from specified files on the server side. Starting with version 2.0.1-beta, up to dist_threads worker threads per request will be created to parallelize the work when this flag is enabled. Boolean, default is false. "html_strip_mode": Added in version 1.10-beta. HTML stripping mode setting. Defaults to "index", which means that index settings will be used. The other values are "none" and "strip", that forcibly skip or apply stripping irregardless of index settings; and "retain", that retains HTML markup and protects it from highlighting. The "retain" mode can only be used when highlighting full documents and thus requires that no snippet size limits are set. String, allowed values are "none", "strip", "index", and "retain". "allow_empty": Added in version 1.10-beta. Allows empty string to be returned as highlighting result when a snippet could not be generated (no keywords match, or no passages fit the limit). By default, the beginning of original text would be returned instead of an empty string. Boolean, default is false. "passage_boundary": Added in version 2.0.1-beta. Ensures that passages do not cross a sentence, paragraph, or zone boundary (when used with an index that has the respective indexing settings enabled). String, allowed values are "sentence", "paragraph", and "zone". "emit_zones": Added in version 2.0.1-beta. Emits an HTML tag with an enclosing zone name before each passage. Boolean, default is false. Snippets extraction algorithm currently favors better passages (with closer phrase matches), and then passages with keywords not yet in snippet. Generally, it will try to highlight the best match with the query, and it will also to highlight all the query keywords, as made possible by the limtis. In case the document does not match the query, beginning of the document trimmed down according to the limits will be return by default. Starting with 1.10-beta, you can also return an empty snippet instead case by setting "allow_empty" option to true. Returns false on failure. Returns a plain array of strings with excerpts (snippets) on success. UpdateAttributes Prototype: function UpdateAttributes ( $index, $attrs, $values ) Instantly updates given attribute values in given documents. Returns number of actually updated documents (0 or more) on success, or -1 on failure. $index is a name of the index (or indexes) to be updated. $attrs is a plain array with string attribute names, listing attributes that are updated. $values is a hash where key is document ID, and value is a plain array of new attribute values. $index can be either a single index name or a list, like in Query(). Unlike Query(), wildcard is not allowed and all the indexes to update must be specified explicitly. The list of indexes can include distributed index names. Updates on distributed indexes will be pushed to all agents. The updates only work with docinfo=extern storage strategy. They are very fast because they're working fully in RAM, but they can also be made persistent: updates are saved on disk on clean searchd shutdown initiated by SIGTERM signal. With additional restrictions, updates are also possible on MVA attributes; refer to mva_updates_pool directive for details. Usage example: $cl->UpdateAttributes ( "test1", array("group_id"), array(1=>array(456)) ); $cl->UpdateAttributes ( "products", array ( "price", "amount_in_stock" ), array ( 1001=>array(123,5), 1002=>array(37,11), 1003=>(25,129) ) ); The first sample statement will update document 1 in index "test1", setting "group_id" to 456. The second one will update documents 1001, 1002 and 1003 in index "products". For document 1001, the new price will be set to 123 and the new amount in stock to 5; for document 1002, the new price will be 37 and the new amount will be 11; etc. BuildKeywords Prototype: function BuildKeywords ( $query, $index, $hits ) Extracts keywords from query using tokenizer settings for given index, optionally with per-keyword occurrence statistics. Returns an array of hashes with per-keyword information. $query is a query to extract keywords from. $index is a name of the index to get tokenizing settings and keyword occurrence statistics from. $hits is a boolean flag that indicates whether keyword occurrence statistics are required. Usage example: $keywords = $cl->BuildKeywords ( "this.is.my query", "test1", false ); EscapeString Prototype: function EscapeString ( $string ) Escapes characters that are treated as special operators by the query language parser. Returns an escaped string. $string is a string to escape. This function might seem redundant because it's trivial to implement in any calling application. However, as the set of special characters might change over time, it makes sense to have an API call that is guaranteed to escape all such characters at all times. Usage example: $escaped = $cl->EscapeString ( "escaping-sample@query/string" ); Status Prototype: function Status () Queries searchd status, and returns an array of status variable name and value pairs. Usage example: $status = $cl->Status (); foreach ( $status as $row ) print join ( ": ", $row ) . "\n"; FlushAttributes Prototype: function FlushAttributes () Forces searchd to flush pending attribute updates to disk, and blocks until completion. Returns a non-negative internal "flush tag" on success. Returns -1 and sets an error message on error. Introduced in version 1.10-beta. Attribute values updated using UpdateAttributes() API call are only kept in RAM until a so-called flush (which writes the current, possibly updated attribute values back to disk). FlushAttributes() call lets you enforce a flush. The call will block until searchd finishes writing the data to disk, which might take seconds or even minutes depending on the total data size (.spa file size). All the currently updated indexes will be flushed. Flush tag should be treated as an ever growing magic number that does not mean anything. It's guaranteed to be non-negative. It is guaranteed to grow over time, though not necessarily in a sequential fashion; for instance, two calls that return 10 and then 1000 respectively are a valid situation. If two calls to FlushAttrs() return the same tag, it means that there were no actual attribute updates in between them, and therefore current flushed state remained the same (for all indexes). Usage example: $status = $cl->FlushAttributes (); if ( $status<0 ) print "ERROR: " . $cl->GetLastError(); Persistent connections Persistent connections allow to use single network connection to run multiple commands that would otherwise require reconnects. Open Prototype: function Open () Opens persistent connection to the server. Close Prototype: function Close () Closes previously opened persistent connection. MySQL storage engine (SphinxSE) SphinxSE overview SphinxSE is MySQL storage engine which can be compiled into MySQL server 5.x using its pluggable architecure. It is not available for MySQL 4.x series. It also requires MySQL 5.0.22 or higher in 5.0.x series, or MySQL 5.1.12 or higher in 5.1.x series. Despite the name, SphinxSE does not actually store any data itself. It is actually a built-in client which allows MySQL server to talk to searchd, run search queries, and obtain search results. All indexing and searching happen outside MySQL. Obvious SphinxSE applications include: easier porting of MySQL FTS applications to Sphinx; allowing Sphinx use with progamming languages for which native APIs are not available yet; optimizations when additional Sphinx result set processing on MySQL side is required (eg. JOINs with original document tables, additional MySQL-side filtering, etc). Installing SphinxSE You will need to obtain a copy of MySQL sources, prepare those, and then recompile MySQL binary. MySQL sources (mysql-5.x.yy.tar.gz) could be obtained from dev.mysql.com Web site. For some MySQL versions, there are delta tarballs with already prepared source versions available from Sphinx Web site. After unzipping those over original sources MySQL would be ready to be configured and built with Sphinx support. If such tarball is not available, or does not work for you for any reason, you would have to prepare sources manually. You will need to GNU Autotools framework (autoconf, automake and libtool) installed to do that. Compiling MySQL 5.0.x with SphinxSE Skips steps 1-3 if using already prepared delta tarball. copy sphinx.5.0.yy.diff patch file into MySQL sources directory and run patch -p1 < sphinx.5.0.yy.diff If there's no .diff file exactly for the specific version you need to build, try applying .diff with closest version numbers. It is important that the patch should apply with no rejects. in MySQL sources directory, run sh BUILD/autorun.sh in MySQL sources directory, create sql/sphinx directory in and copy all files in mysqlse directory from Sphinx sources there. Example: cp -R /root/builds/sphinx-0.9.7/mysqlse /root/builds/mysql-5.0.24/sql/sphinx configure MySQL and enable Sphinx engine: ./configure --with-sphinx-storage-engine build and install MySQL: make make install Compiling MySQL 5.1.x with SphinxSE Skip steps 1-2 if using already prepared delta tarball. in MySQL sources directory, create storage/sphinx directory in and copy all files in mysqlse directory from Sphinx sources there. Example: cp -R /root/builds/sphinx-0.9.7/mysqlse /root/builds/mysql-5.1.14/storage/sphinx in MySQL sources directory, run sh BUILD/autorun.sh configure MySQL and enable Sphinx engine: ./configure --with-plugins=sphinx build and install MySQL: make make install Checking SphinxSE installation To check whether SphinxSE has been succesfully compiled into MySQL, launch newly built servers, run mysql client and issue SHOW ENGINES query. You should see a list of all available engines. Sphinx should be present and "Support" column should contain "YES": mysql> show engines; +------------+----------+-------------------------------------------------------------+ | Engine | Support | Comment | +------------+----------+-------------------------------------------------------------+ | MyISAM | DEFAULT | Default engine as of MySQL 3.23 with great performance | ... | SPHINX | YES | Sphinx storage engine | ... +------------+----------+-------------------------------------------------------------+ 13 rows in set (0.00 sec) Using SphinxSE To search via SphinxSE, you would need to create special ENGINE=SPHINX "search table", and then SELECT from it with full text query put into WHERE clause for query column. Let's begin with an example create statement and search query: CREATE TABLE t1 ( id INTEGER UNSIGNED NOT NULL, weight INTEGER NOT NULL, query VARCHAR(3072) NOT NULL, group_id INTEGER, INDEX(query) ) ENGINE=SPHINX CONNECTION="sphinx://localhost:9312/test"; SELECT * FROM t1 WHERE query='test it;mode=any'; First 3 columns of search table must have a types of INTEGER UNSINGED or BIGINT for the 1st column (document id), INTEGER or BIGINT for the 2nd column (match weight), and VARCHAR or TEXT for the 3rd column (your query), respectively. This mapping is fixed; you can not omit any of these three required columns, or move them around, or change types. Also, query column must be indexed; all the others must be kept unindexed. Columns' names are ignored so you can use arbitrary ones. Additional columns must be either INTEGER, TIMESTAMP, BIGINT, VARCHAR, or FLOAT. They will be bound to attributes provided in Sphinx result set by name, so their names must match attribute names specified in sphinx.conf. If there's no such attribute name in Sphinx search results, column will have NULL values. Special "virtual" attributes names can also be bound to SphinxSE columns. _sph_ needs to be used instead of @ for that. For instance, to obtain the values of @groupby, @count, or @distinct virtual attributes, use _sph_groupby, _sph_count or _sph_distinct column names, respectively. CONNECTION string parameter can be used to specify default searchd host, port and indexes for queries issued using this table. If no connection string is specified in CREATE TABLE, index name "*" (ie. search all indexes) and localhost:9312 are assumed. Connection string syntax is as follows: CONNECTION="sphinx://HOST:PORT/INDEXNAME" You can change the default connection string later: ALTER TABLE t1 CONNECTION="sphinx://NEWHOST:NEWPORT/NEWINDEXNAME"; You can also override all these parameters per-query. As seen in example, both query text and search options should be put into WHERE clause on search query column (ie. 3rd column); the options are separated by semicolons; and their names from values by equality sign. Any number of options can be specified. Available options are: query - query text; mode - matching mode. Must be one of "all", "any", "phrase", "boolean", or "extended". Default is "all"; sort - match sorting mode. Must be one of "relevance", "attr_desc", "attr_asc", "time_segments", or "extended". In all modes besides "relevance" attribute name (or sorting clause for "extended") is also required after a colon: ... WHERE query='test;sort=attr_asc:group_id'; ... WHERE query='test;sort=extended:@weight desc, group_id asc'; offset - offset into result set, default is 0; limit - amount of matches to retrieve from result set, default is 20; index - names of the indexes to search: ... WHERE query='test;index=test1;'; ... WHERE query='test;index=test1,test2,test3;'; minid, maxid - min and max document ID to match; weights - comma-separated list of weights to be assigned to Sphinx full-text fields: ... WHERE query='test;weights=1,2,3;'; filter, !filter - comma-separated attribute name and a set of values to match: # only include groups 1, 5 and 19 ... WHERE query='test;filter=group_id,1,5,19;'; # exclude groups 3 and 11 ... WHERE query='test;!filter=group_id,3,11;'; range, !range - comma-separated attribute name, min and max value to match: # include groups from 3 to 7, inclusive ... WHERE query='test;range=group_id,3,7;'; # exclude groups from 5 to 25 ... WHERE query='test;!range=group_id,5,25;'; maxmatches - per-query max matches value, as in max_matches parameter to SetLimits() API call: ... WHERE query='test;maxmatches=2000;'; cutoff - maximum allowed matches, as in cutoff parameter to SetLimits() API call: ... WHERE query='test;cutoff=10000;'; maxquerytme - maximum allowed query time (in milliseconds), as in SetMaxQueryTime() API call: ... WHERE query='test;maxquerytime=1000;'; groupby - group-by function and attribute, corresponding to SetGroupBy() API call: ... WHERE query='test;groupby=day:published_ts;'; ... WHERE query='test;groupby=attr:group_id;'; groupsort - group-by sorting clause: ... WHERE query='test;groupsort=@count desc;'; distinct - an attribute to compute COUNT(DISTINCT) for when doing group-by, as in SetGroupDistinct() API call: ... WHERE query='test;groupby=attr:country_id;distinct=site_id'; indexweights - comma-separated list of index names and weights to use when searching through several indexes: ... WHERE query='test;indexweights=idx_exact,2,idx_stemmed,1;'; comment - a string to mark this query in query log (mapping to $comment parameter in Query() API call): ... WHERE query='test;comment=marker001;'; select - a string with expressions to compute (mapping to SetSelect() API call): ... WHERE query='test;select=2*a+3*b as myexpr;'; host, port - remote searchd host name and TCP port, respectively: ... WHERE query='test;host=sphinx-test.loc;port=7312;'; ranker - a ranking function to use with "extended" matching mode, as in SetRankingMode() API call (the only mode that supports full query syntax). Known values are "proximity_bm25", "bm25", "none", "wordcount", "proximity", "matchany", and "fieldmask". ... WHERE query='test;mode=extended;ranker=bm25;'; geoanchor - geodistance anchor, as in SetGeoAnchor() API call. Takes 4 parameters which are latitude and longiture attribute names, and anchor point coordinates respectively: ... WHERE query='test;geoanchor=latattr,lonattr,0.123,0.456'; One very important note that it is much more efficient to allow Sphinx to perform sorting, filtering and slicing the result set than to raise max matches count and use WHERE, ORDER BY and LIMIT clauses on MySQL side. This is for two reasons. First, Sphinx does a number of optimizations and performs better than MySQL on these tasks. Second, less data would need to be packed by searchd, transferred and unpacked by SphinxSE. Starting with version 0.9.9-rc1, additional query info besides result set could be retrieved with SHOW ENGINE SPHINX STATUS statement: mysql> SHOW ENGINE SPHINX STATUS; +--------+-------+-------------------------------------------------+ | Type | Name | Status | +--------+-------+-------------------------------------------------+ | SPHINX | stats | total: 25, total found: 25, time: 126, words: 2 | | SPHINX | words | sphinx:591:1256 soft:11076:15945 | +--------+-------+-------------------------------------------------+ 2 rows in set (0.00 sec) This information can also be accessed through status variables. Note that this method does not require super-user privileges. mysql> SHOW STATUS LIKE 'sphinx_%'; +--------------------+----------------------------------+ | Variable_name | Value | +--------------------+----------------------------------+ | sphinx_total | 25 | | sphinx_total_found | 25 | | sphinx_time | 126 | | sphinx_word_count | 2 | | sphinx_words | sphinx:591:1256 soft:11076:15945 | +--------------------+----------------------------------+ 5 rows in set (0.00 sec) You could perform JOINs on SphinxSE search table and tables using other engines. Here's an example with "documents" from example.sql: mysql> SELECT content, date_added FROM test.documents docs -> JOIN t1 ON (docs.id=t1.id) -> WHERE query="one document;mode=any"; +-------------------------------------+---------------------+ | content | docdate | +-------------------------------------+---------------------+ | this is my test document number two | 2006-06-17 14:04:28 | | this is my test document number one | 2006-06-17 14:04:28 | +-------------------------------------+---------------------+ 2 rows in set (0.00 sec) mysql> SHOW ENGINE SPHINX STATUS; +--------+-------+---------------------------------------------+ | Type | Name | Status | +--------+-------+---------------------------------------------+ | SPHINX | stats | total: 2, total found: 2, time: 0, words: 2 | | SPHINX | words | one:1:2 document:2:2 | +--------+-------+---------------------------------------------+ 2 rows in set (0.00 sec) Building snippets (excerpts) via MySQL Starting with version 0.9.9-rc2, SphinxSE also includes a UDF function that lets you create snippets through MySQL. The functionality is fully similar to BuildExcerprts API call but accesible through MySQL+SphinxSE. The binary that provides the UDF is named sphinx.so and should be automatically built and installed to proper location along with SphinxSE itself. If it does not get installed automatically for some reason, look for sphinx.so in the build directory and copy it to the plugins directory of your MySQL instance. After that, register the UDF using the following statement: CREATE FUNCTION sphinx_snippets RETURNS STRING SONAME 'sphinx.so'; Function name must be sphinx_snippets, you can not use an arbitrary name. Function arguments are as follows: Prototype: function sphinx_snippets ( document, index, words, [options] ); Document and words arguments can be either strings or table columns. Options must be specified like this: 'value' AS option_name. For a list of supported options, refer to BuildExcerprts() API call. The only UDF-specific additional option is named 'sphinx' and lets you specify searchd location (host and port). Usage examples: SELECT sphinx_snippets('hello world doc', 'main', 'world', 'sphinx://192.168.1.1/' AS sphinx, true AS exact_phrase, '[b]' AS before_match, '[/b]' AS after_match) FROM documents; SELECT title, sphinx_snippets(text, 'index', 'mysql php') AS text FROM sphinx, documents WHERE query='mysql php' AND sphinx.id=documents.id; Reporting bugs Unfortunately, Sphinx is not yet 100% bug free (even though I'm working hard towards that), so you might occasionally run into some issues. Reporting as much as possible about each bug is very important - because to fix it, I need to be able either to reproduce and debug the bug, or to deduce what's causing it from the information that you provide. So here are some instructions on how to do that. Build-time issues If Sphinx fails to build for some reason, please do the following: check that headers and libraries for your DBMS are properly installed (for instance, check that mysql-devel package is present); report Sphinx version and config file (be sure to remove the passwords!), MySQL (or PostgreSQL) configuration info, gcc version, OS version and CPU type (ie. x86, x86-64, PowerPC, etc): mysql_config gcc --version uname -a report the error message which is produced by configure or gcc (it should be to include error message itself only, not the whole build log). Run-time issues If Sphinx builds and runs, but there are any problems running it, please do the following: describe the bug (ie. both the expected behavior and actual behavior) and all the steps necessary to reproduce it; include Sphinx version and config file (be sure to remove the passwords!), MySQL (or PostgreSQL) version, gcc version, OS version and CPU type (ie. x86, x86-64, PowerPC, etc): mysql --version gcc --version uname -a build, install and run debug versions of all Sphinx programs (this is to enable a lot of additional internal checks, so-called assertions): make distclean ./configure --with-debug make install killall -TERM searchd reindex to check if any assertions are triggered (in this case, it's likely that the index is corrupted and causing problems); if the bug does not reproduce with debug versions, revert to non-debug and mention it in your report; if the bug could be easily reproduced with a small (1-100 record) part of your database, please provide a gzipped dump of that part; if the problem is related to searchd, include relevant entries from searchd.log and query.log in your bug report; if the problem is related to searchd, try running it in console mode and check if it dies with an assertion: ./searchd --console if any program dies with an assertion, provide the assertion message. Debugging assertions, crashes and hangups If any program dies with an assertion, crashes without an assertion or hangs up, you would additionally need to generate a core dump and examine it. enable core dumps. On most Linux systems, this is done using ulimit: ulimit -c 32768 run the program and try to reproduce the bug; if the program crashes (either with or without an assertion), find the core file in current directory (it should typically print out "Segmentation fault (core dumped)" message); if the program hangs, use kill -SEGV from another console to force it to exit and dump core: kill -SEGV HANGED-PROCESS-ID use gdb to examine the core file and obtain a backtrace: gdb ./CRASHED-PROGRAM-FILE-NAME CORE-DUMP-FILE-NAME (gdb) bt (gdb) quit Note that HANGED-PROCESS-ID, CRASHED-PROGRAM-FILE-NAME and CORE-DUMP-FILE-NAME must all be replaced with specific numbers and file names. For example, hanged searchd debugging session would look like: # kill -SEGV 12345 # ls *core* core.12345 # gdb ./searchd core.12345 (gdb) bt ... (gdb) quit Note that ulimit is not server-wide and only affects current shell session. This means that you will not have to restore any server-wide limits - but if you relogin, you will have to set ulimit again. Core dumps should be placed in current working directory (and Sphinx programs do not change it), so this is where you would look for them. Please do not immediately remove the core file because there could be additional helpful information which could be retrieved from it. You do not need to send me this file (as the debug info there is closely tied to your system) but I might need to ask you a few additional questions about it. <filename>sphinx.conf</filename> options reference Data source configuration options type Data source type. Mandatory, no default value. Known types are , , , and , and . All other per-source options depend on source type selected by this option. Names of the options used for SQL sources (ie. MySQL, PostgreSQL, MS SQL) start with "sql_"; names of the ones used for xmlpipe and xmlpipe2 start with "xmlpipe_". All source types except are conditional; they might or might not be supported depending on your build settings, installed client libraries, etc. type is currently only available on Windows. type is available both on Windows natively and on Linux through UnixODBC library. Example: type = mysql sql_host SQL server host to connect to. Mandatory, no default value. Applies to SQL source types (, , ) only. In the simplest case when Sphinx resides on the same host with your MySQL or PostgreSQL installation, you would simply specify "localhost". Note that MySQL client library chooses whether to connect over TCP/IP or over UNIX socket based on the host name. Specifically "localhost" will force it to use UNIX socket (this is the default and generally recommended mode) and "127.0.0.1" will force TCP/IP usage. Refer to MySQL manual for more details. Example: sql_host = localhost sql_port SQL server IP port to connect to. Optional, default is 3306 for source type and 5432 for type. Applies to SQL source types (, , ) only. Note that it depends on sql_host setting whether this value will actually be used. Example: sql_port = 3306 sql_user SQL user to use when connecting to sql_host. Mandatory, no default value. Applies to SQL source types (, , ) only. Example: sql_user = test sql_pass SQL user password to use when connecting to sql_host. Mandatory, no default value. Applies to SQL source types (, , ) only. Example: sql_pass = mysecretpassword sql_db SQL database (in MySQL terms) to use after the connection and perform further queries within. Mandatory, no default value. Applies to SQL source types (, , ) only. Example: sql_db = test sql_sock UNIX socket name to connect to for local SQL servers. Optional, default value is empty (use client library default settings). Applies to SQL source types (, , ) only. On Linux, it would typically be /var/lib/mysql/mysql.sock. On FreeBSD, it would typically be /tmp/mysql.sock. Note that it depends on sql_host setting whether this value will actually be used. Example: sql_sock = /tmp/mysql.sock mysql_connect_flags MySQL client connection flags. Optional, default value is 0 (do not set any flags). Applies to source type only. This option must contain an integer value with the sum of the flags. The value will be passed to mysql_real_connect() verbatim. The flags are enumerated in mysql_com.h include file. Flags that are especially interesting in regard to indexing, with their respective values, are as follows: CLIENT_COMPRESS = 32; can use compression protocol CLIENT_SSL = 2048; switch to SSL after handshake CLIENT_SECURE_CONNECTION = 32768; new 4.1 authentication For instance, you can specify 2080 (2048+32) to use both compression and SSL, or 32768 to use new authentication only. Initially, this option was introduced to be able to use compression when the indexer and mysqld are on different hosts. Compression on 1 Gbps links is most likely to hurt indexing time though it reduces network traffic, both in theory and in practice. However, enabling compression on 100 Mbps links may improve indexing time significantly (upto 20-30% of the total indexing time improvement was reported). Your mileage may vary. Example: mysql_connect_flags = 32 # enable compression mysql_ssl_cert, mysql_ssl_key, mysql_ssl_ca SSL certificate settings to use for connecting to MySQL server. Optional, default values are empty strings (do not use SSL). Applies to source type only. These directives let you set up secure SSL connection between indexer and MySQL. The details on creating the certificates and setting up MySQL server can be found in MySQL documentation. Example: mysql_ssl_cert = /etc/ssl/client-cert.pem mysql_ssl_key = /etc/ssl/client-key.pem mysql_ssl_ca = /etc/ssl/cacert.pem odbc_dsn ODBC DSN to connect to. Mandatory, no default value. Applies to source type only. ODBC DSN (Data Source Name) specifies the credentials (host, user, password, etc) to use when connecting to ODBC data source. The format depends on specific ODBC driver used. Example: odbc_dsn = Driver={Oracle ODBC Driver};Dbq=myDBName;Uid=myUsername;Pwd=myPassword sql_query_pre Pre-fetch query, or pre-query. Multi-value, optional, default is empty list of queries. Applies to SQL source types (, , ) only. Multi-value means that you can specify several pre-queries. They are executed before the main fetch query, and they will be exectued exactly in order of appeareance in the configuration file. Pre-query results are ignored. Pre-queries are useful in a lot of ways. They are used to setup encoding, mark records that are going to be indexed, update internal counters, set various per-connection SQL server options and variables, and so on. Perhaps the most frequent pre-query usage is to specify the encoding that the server will use for the rows it returnes. It must match the encoding that Sphinx expects (as specified by charset_type and charset_table options). Two MySQL specific examples of setting the encoding are: sql_query_pre = SET CHARACTER_SET_RESULTS=cp1251 sql_query_pre = SET NAMES utf8 Also specific to MySQL sources, it is useful to disable query cache (for indexer connection only) in pre-query, because indexing queries are not going to be re-run frequently anyway, and there's no sense in caching their results. That could be achieved with: sql_query_pre = SET SESSION query_cache_type=OFF Example: sql_query_pre = SET NAMES utf8 sql_query_pre = SET SESSION query_cache_type=OFF sql_query Main document fetch query. Mandatory, no default value. Applies to SQL source types (, , ) only. There can be only one main query. This is the query which is used to retrieve documents from SQL server. You can specify up to 32 full-text fields (formally, upto SPH_MAX_FIELDS from sphinx.h), and an arbitrary amount of attributes. All of the columns that are neither document ID (the first one) nor attributes will be full-text indexed. Document ID MUST be the very first field, and it MUST BE UNIQUE UNSIGNED POSITIVE (NON-ZERO, NON-NEGATIVE) INTEGER NUMBER. It can be either 32-bit or 64-bit, depending on how you built Sphinx; by default it builds with 32-bit IDs support but option to configure allows to build with 64-bit document and word IDs support. Example: sql_query = \ SELECT id, group_id, UNIX_TIMESTAMP(date_added) AS date_added, \ title, content \ FROM documents sql_joined_field Joined/payload field fetch query. Multi-value, optional, default is empty list of queries. Applies to SQL source types (, , ) only. lets you use two different features: joined fields, and payloads (payload fields). It's syntax is as follows: sql_joined_field = FIELD-NAME 'from' ( 'query' | 'payload-query' ); \ QUERY [ ; RANGE-QUERY ] where FIELD-NAME is a joined/payload field name; QUERY is an SQL query that must fetch values to index. RANGE-QUERY is an optional SQL query that fetches a range of values to index. (Added in version 2.0.1-beta.) Joined fields let you avoid JOIN and/or GROUP_CONCAT statements in the main document fetch query (sql_query). This can be useful when SQL-side JOIN is slow, or needs to be offloaded on Sphinx side, or simply to emulate MySQL-specific GROUP_CONCAT funcionality in case your database server does not support it. The query must return exactly 2 columns: document ID, and text to append to a joined field. Document IDs can be duplicate, but they must be in ascending order. All the text rows fetched for a given ID will be concatented together, and the concatenation result will be indexed as the entire contents of a joined field. Rows will be concatenated in the order returned from the query, and separating whitespace will be inserted between them. For instance, if joined field query returns the following rows: ( 1, 'red' ) ( 1, 'right' ) ( 1, 'hand' ) ( 2, 'mysql' ) ( 2, 'sphinx' ) then the indexing results would be equivalent to that of adding a new text field with a value of 'red right hand' to document 1 and 'mysql sphinx' to document 2. Joined fields are only indexed differently. There are no other differences between joined fields and regular text fields. Starting with 2.0.1-beta, ranged queries can be used when a single query is not efficient enough or does not work because of the database driver limitations. It works similar to the ranged queries in the main indexing loop, see . The range will be queried for and fetched upfront once, then multiple queries with different $start and $end substitutions will be run to fetch the actual data. Payloads let you create a special field in which, instead of keyword positions, so-called user payloads are stored. Payloads are custom integer values attached to every keyword. They can then be used in search time to affect the ranking. The payload query must return exactly 3 columns: document ID; keyword; and integer payload value. Document IDs can be duplicate, but they must be in ascending order. Payloads must be unsigned integers within 24-bit range, ie. from 0 to 16777215. For reference, payloads are currently internally stored as in-field keyword positions, but that is not guaranteed and might change in the future. Currently, the only method to account for payloads is to use SPH_RANK_PROXIMITY_BM25 ranker. On indexes with payload fields, it will automatically switch to a variant that matches keywords in those fields, computes a sum of matched payloads multiplied by field wieghts, and adds that sum to the final rank. Example: sql_joined_field = \ tagstext from query; \ SELECT docid, CONCAT('tag',tagid) FROM tags ORDER BY docid ASC sql_query_range Range query setup. Optional, default is empty. Applies to SQL source types (, , ) only. Setting this option enables ranged document fetch queries (see ). Ranged queries are useful to avoid notorious MyISAM table locks when indexing lots of data. (They also help with other less notorious issues, such as reduced performance caused by big result sets, or additional resources consumed by InnoDB to serialize big read transactions.) The query specified in this option must fetch min and max document IDs that will be used as range boundaries. It must return exactly two integer fields, min ID first and max ID second; the field names are ignored. When ranged queries are enabled, sql_query will be required to contain and macros (because it obviously would be a mistake to index the whole table many times over). Note that the intervals specified by .. will not overlap, so you should not remove document IDs that are exactly equal to or from your query. The example in ) illustrates that; note how it uses greater-or-equal and less-or-equal comparisons. Example: sql_query_range = SELECT MIN(id),MAX(id) FROM documents sql_range_step Range query step. Optional, default is 1024. Applies to SQL source types (, , ) only. Only used when ranged queries are enabled. The full document IDs interval fetched by sql_query_range will be walked in this big steps. For example, if min and max IDs fetched are 12 and 3456 respectively, and the step is 1000, indexer will call sql_query several times with the following substitutions: $start=12, $end=1011 $start=1012, $end=2011 $start=2012, $end=3011 $start=3012, $end=3456 Example: sql_range_step = 1000 sql_query_killlist Kill-list query. Optional, default is empty (no query). Applies to SQL source types (, , ) only. Introduced in version 0.9.9-rc1. This query is expected to return a number of 1-column rows, each containing just the document ID. The returned document IDs are stored within an index. Kill-list for a given index suppresses results from other indexes, depending on index order in the query. The intended use is to help implement deletions and updates on existing indexes without rebuilding (actually even touching them), and especially to fight phantom results problem. Let us dissect an example. Assume we have two indexes, 'main' and 'delta'. Assume that documents 2, 3, and 5 were deleted since last reindex of 'main', and documents 7 and 11 were updated (ie. their text contents were changed). Assume that a keyword 'test' occurred in all these mentioned documents when we were indexing 'main'; still occurs in document 7 as we index 'delta'; but does not occur in document 11 any more. We now reindex delta and then search through both these indexes in proper (least to most recent) order: $res = $cl->Query ( "test", "main delta" ); First, we need to properly handle deletions. The result set should not contain documents 2, 3, or 5. Second, we also need to avoid phantom results. Unless we do something about it, document 11 will appear in search results! It will be found in 'main' (but not 'delta'). And it will make it to the final result set unless something stops it. Kill-list, or K-list for short, is that something. Kill-list attached to 'delta' will suppress the specified rows from all the preceding indexes, in this case just 'main'. So to get the expected results, we should put all the updated and deleted document IDs into it. Example: sql_query_killlist = \ SELECT id FROM documents WHERE updated_ts>=@last_reindex UNION \ SELECT id FROM documents_deleted WHERE deleted_ts>=@last_reindex sql_attr_uint Unsigned integer attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (, , ) only. The column value should fit into 32-bit unsigned integer range. Values outside this range will be accepted but wrapped around. For instance, -1 will be wrapped around to 2^32-1 or 4,294,967,295. You can specify bit count for integer attributes by appending ':BITCOUNT' to attribute name (see example below). Attributes with less than default 32-bit size, or bitfields, perform slower. But they require less RAM when using extern storage: such bitfields are packed together in 32-bit chunks in .spa attribute data file. Bit size settings are ignored if using inline storage. Example: sql_attr_uint = group_id sql_attr_uint = forum_id:9 # 9 bits for forum_id sql_attr_bool Boolean attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (, , ) only. Equivalent to sql_attr_uint declaration with a bit count of 1. Example: sql_attr_bool = is_deleted # will be packed to 1 bit sql_attr_bigint 64-bit signed integer attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (, , ) only. Note that unlike sql_attr_uint, these values are signed. Introduced in version 0.9.9-rc1. Example: sql_attr_bigint = my_bigint_id sql_attr_timestamp UNIX timestamp attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (, , ) only. Timestamps can store date and time in the range of Jan 01, 1970 to Jan 19, 2038 with a precision of one second. The expected column value should be a timestamp in UNIX format, ie. 32-bit unsigned integer number of seconds elapsed since midnight, January 01, 1970, GMT. Timestamps are internally stored and handled as integers everywhere. But in addition to working with timestamps as integers, it's also legal to use them along with different date-based functions, such as time segments sorting mode, or day/week/month/year extraction for GROUP BY. Note that DATE or DATETIME column types in MySQL can not be directly used as timestamp attributes in Sphinx; you need to explicitly convert such columns using UNIX_TIMESTAMP function (if data is in range). Note timestamps can not represent dates before January 01, 1970, and UNIX_TIMESTAMP() in MySQL will not return anything expected. If you only needs to work with dates, not times, consider TO_DAYS() function in MySQL instead. Example: sql_attr_timestamp = UNIX_TIMESTAMP(added_datetime) AS added_ts sql_attr_str2ordinal Ordinal string number attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (, , ) only. This attribute type (so-called ordinal, for brevity) is intended to allow sorting by string values, but without storing the strings themselves. When indexing ordinals, string values are fetched from database, temporarily stored, sorted, and then replaced by their respective ordinal numbers in the array of sorted strings. So, the ordinal number is an integer such that sorting by it produces the same result as if lexicographically sorting by original strings. by string values lexicographically. Earlier versions could consume a lot of RAM for indexing ordinals. Starting with revision r1112, ordinals accumulation and sorting also runs in fixed memory (at the cost of using additional temporary disk space), and honors mem_limit settings. Ideally the strings should be sorted differently, depending on the encoding and locale. For instance, if the strings are known to be Russian text in KOI8R encoding, sorting the bytes 0xE0, 0xE1, and 0xE2 should produce 0xE1, 0xE2 and 0xE0, because in KOI8R value 0xE0 encodes a character that is (noticeably) after characters encoded by 0xE1 and 0xE2. Unfortunately, Sphinx does not support that at the moment and will simply sort the strings bytewise. Note that the ordinals are by construction local to each index, and it's therefore impossible to merge ordinals while retaining the proper order. The processed strings are replaced by their sequential number in the index they occurred in, but different indexes have different sets of strings. For instance, if 'main' index contains strings "aaa", "bbb", "ccc", and so on up to "zzz", they'll be assigned numbers 1, 2, 3, and so on up to 26, respectively. But then if 'delta' only contains "zzz" the assigned number will be 1. And after the merge, the order will be broken. Unfortunately, this is impossible to workaround without storing the original strings (and once Sphinx supports storing the original strings, ordinals will not be necessary any more). Example: sql_attr_str2ordinal = author_name sql_attr_float Floating point attribute declaration. Multi-value (there might be multiple attributes declared), optional. Applies to SQL source types (, , ) only. The values will be stored in single precision, 32-bit IEEE 754 format. Represented range is approximately from 1e-38 to 1e+38. The amount of decimal digits that can be stored precisely is approximately 7. One important usage of the float attributes is storing latitude and longitude values (in radians), for further usage in query-time geosphere distance calculations. Example: sql_attr_float = lat_radians sql_attr_float = long_radians sql_attr_multi Multi-valued attribute (MVA) declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (, , ) only. Plain attributes only allow to attach 1 value per each document. However, there are cases (such as tags or categories) when it is desired to attach multiple values of the same attribute and be able to apply filtering or grouping to value lists. The declaration format is as follows (backslashes are for clarity only; everything can be declared in a single line as well): sql_attr_multi = ATTR-TYPE ATTR-NAME 'from' SOURCE-TYPE \ [;QUERY] \ [;RANGE-QUERY] where ATTR-TYPE is 'uint' or 'timestamp' SOURCE-TYPE is 'field', 'query', or 'ranged-query' QUERY is SQL query used to fetch all ( docid, attrvalue ) pairs RANGE-QUERY is SQL query used to fetch min and max ID values, similar to 'sql_query_range' Example: sql_attr_multi = uint tag from query; SELECT id, tag FROM tags sql_attr_multi = uint tag from ranged-query; \ SELECT id, tag FROM tags WHERE id>=$start AND id<=$end; \ SELECT MIN(id), MAX(id) FROM tags sql_attr_string String attribute declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (, , ) only. Introduced in version 1.10-beta. String attributes can store arbitrary strings attached to every document. There's a fixed size limit of 4 MB per value. Also, searchd will currently cache all the values in RAM, which is an additional implicit limit. As of 1.10-beta, strings can only be used for storage and retrieval. They can not participate in expressions, be used for filtering, sorting, or grouping (ie. in WHERE, ORDER or GROUP clauses). Note that attributes declared using will not be full-text indexed; you can use sql_field_string directive for that. Example: sql_attr_string = title # will be stored but will not be indexed sql_attr_str2wordcount Word-count attribute declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (, , ) only. Introduced in version 1.10-beta. Word-count attribute takes a string column, tokenizes it according to index settings, and stores the resulting number of tokens in an attribute. This number of tokens ("word count") is a normal integer that can be later used, for instance, in custom ranking expressions (boost shorter titles, help identify exact field matches, etc). Example: sql_attr_str2wordcount = title_wc sql_column_buffers Per-column buffer sizes. Optional, default is empty (deduce the sizes automatically). Applies to , source types only. Introduced in version 2.0.1-beta. ODBC and MS SQL drivers sometimes can not return the maximum actual column size to be expected. For instance, NVARCHAR(MAX) columns always report their length as 2147483647 bytes to indexer even though the actually used length is likely considerably less. However, the receiving buffers still need to be allocated upfront, and their sizes have to be determined. When the driver does not report the column length at all, Sphinx allocates default 1 KB buffers for each non-char column, and 1 MB buffers for each char column. Driver-reported column length also gets clamped by an upper limie of 8 MB, so in case the driver reports (almost) a 2 GB column length, it will be clamped and a 8 MB buffer will be allocated instead for that column. These hard-coded limits can be overridden using the sql_column_buffers directive, either in order to save memory on actually shorter columns, or overcome the 8 MB limit on actually longer columns. The directive values must be a comma-separated lists of selected column names and sizes: sql_column_buffers = <colname>=<size>[K|M] [, ...] Example: sql_query = SELECT id, mytitle, mycontent FROM documents sql_column_buffers = mytitle=64K, mycontent=10M sql_field_string Combined string attribute and full-text field declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (, , ) only. Introduced in version 1.10-beta. sql_attr_string only stores the column value but does not full-text index it. In some cases it might be desired to both full-text index the column and store it as attribute. lets you do exactly that. Both the field and the attribute will be named the same. Example: sql_field_string = title # will be both indexed and stored sql_field_str2wordcount Combined word-count attribute and full-text field declaration. Multi-value (ie. there may be more than one such attribute declared), optional. Applies to SQL source types (, , ) only. Introduced in version 1.10-beta. sql_attr_str2wordcount only stores the column word count but does not full-text index it. In some cases it might be desired to both full-text index the column and also have the count. lets you do exactly that. Both the field and the attribute will be named the same. Example: sql_field_str2wordcount = title # will be indexed, and counted/stored sql_file_field File based field declaration. Applies to SQL source types (, , ) only. Introduced in version 1.10-beta. This directive makes indexer interpret field contents as a file name, and load and index the referred file. Files larger than max_file_field_buffer in size are skipped. Any errors during the file loading (IO errors, missed limits, etc) will be reported as indexing warnings and will not early terminate the indexing. No content will be indexed for such files. Example: sql_file_field = my_file_path # load and index files referred to by my_file_path sql_query_post Post-fetch query. Optional, default value is empty. Applies to SQL source types (, , ) only. This query is executed immediately after sql_query completes successfully. When post-fetch query produces errors, they are reported as warnings, but indexing is not terminated. It's result set is ignored. Note that indexing is not yet completed at the point when this query gets executed, and further indexing still may fail. Therefore, any permanent updates should not be done from here. For instance, updates on helper table that permanently change the last successfully indexed ID should not be run from post-fetch query; they should be run from post-index query instead. Example: sql_query_post = DROP TABLE my_tmp_table sql_query_post_index Post-index query. Optional, default value is empty. Applies to SQL source types (, , ) only. This query is executed when indexing is fully and succesfully completed. If this query produces errors, they are reported as warnings, but indexing is not terminated. It's result set is ignored. $maxid macro can be used in its text; it will be expanded to maximum document ID which was actually fetched from the database during indexing. If no documents were indexed, $maxid will be expanded to 0. Example: sql_query_post_index = REPLACE INTO counters ( id, val ) \ VALUES ( 'max_indexed_id', $maxid ) sql_ranged_throttle Ranged query throttling period, in milliseconds. Optional, default is 0 (no throttling). Applies to SQL source types (, , ) only. Throttling can be useful when indexer imposes too much load on the database server. It causes the indexer to sleep for given amount of milliseconds once per each ranged query step. This sleep is unconditional, and is performed before the fetch query. Example: sql_ranged_throttle = 1000 # sleep for 1 sec before each query step sql_query_info Document info query. Optional, default is empty. Applies to source type only. Only used by CLI search to fetch and display document information, only works with MySQL at the moment, and only intended for debugging purposes. This query fetches the row that will be displayed by CLI search utility for each document ID. It is required to contain $id macro that expands to the queried document ID. Example: sql_query_info = SELECT * FROM documents WHERE id=$id xmlpipe_command Shell command that invokes xmlpipe stream producer. Mandatory. Applies to and source types only. Specifies a command that will be executed and which output will be parsed for documents. Refer to or for specific format description. Example: xmlpipe_command = cat /home/sphinx/test.xml xmlpipe_field xmlpipe field declaration. Multi-value, optional. Applies to source type only. Refer to . Example: xmlpipe_field = subject xmlpipe_field = content xmlpipe_field_string xmlpipe field and string attribute declaration. Multi-value, optional. Applies to source type only. Refer to . Introduced in version 1.10-beta. Makes the specified XML element indexed as both a full-text field and a string attribute. Equivalent to ]]> declaration within the XML file. Example: xmlpipe_field_string = subject xmlpipe_field_wordcount xmlpipe field and word count attribute declaration. Multi-value, optional. Applies to source type only. Refer to . Introduced in version 1.10-beta. Makes the specified XML element indexed as both a full-text field and a word count attribute. Equivalent to ]]> declaration within the XML file. Example: xmlpipe_field_wordcount = subject xmlpipe_attr_uint xmlpipe integer attribute declaration. Multi-value, optional. Applies to source type only. Syntax fully matches that of sql_attr_uint. Example: xmlpipe_attr_uint = author xmlpipe_attr_bool xmlpipe boolean attribute declaration. Multi-value, optional. Applies to source type only. Syntax fully matches that of sql_attr_bool. Example: xmlpipe_attr_bool = is_deleted # will be packed to 1 bit xmlpipe_attr_timestamp xmlpipe UNIX timestamp attribute declaration. Multi-value, optional. Applies to source type only. Syntax fully matches that of sql_attr_timestamp. Example: xmlpipe_attr_timestamp = published xmlpipe_attr_str2ordinal xmlpipe string ordinal attribute declaration. Multi-value, optional. Applies to source type only. Syntax fully matches that of sql_attr_str2ordinal. Example: xmlpipe_attr_str2ordinal = author_sort xmlpipe_attr_float xmlpipe floating point attribute declaration. Multi-value, optional. Applies to source type only. Syntax fully matches that of sql_attr_float. Example: xmlpipe_attr_float = lat_radians xmlpipe_attr_float = long_radians xmlpipe_attr_multi xmlpipe MVA attribute declaration. Multi-value, optional. Applies to source type only. This setting declares an MVA attribute tag in xmlpipe2 stream. The contents of the specified tag will be parsed and a list of integers that will constitute the MVA will be extracted, similar to how sql_attr_multi parses SQL column contents when 'field' MVA source type is specified. Example: xmlpipe_attr_multi = taglist xmlpipe_attr_string xmlpipe string declaration. Multi-value, optional. Applies to source type only. Introduced in version 1.10-beta. This setting declares a string attribute tag in xmlpipe2 stream. The contents of the specified tag will be parsed and stored as a string value. Example: xmlpipe_attr_string = subject xmlpipe_fixup_utf8 Perform Sphinx-side UTF-8 validation and filtering to prevent XML parser from choking on non-UTF-8 documents. Optional, default is 0. Applies to source type only. Under certain occasions it might be hard or even impossible to guarantee that the incoming XMLpipe2 document bodies are in perfectly valid and conforming UTF-8 encoding. For instance, documents with national single-byte encodings could sneak into the stream. libexpat XML parser is fragile, meaning that it will stop processing in such cases. UTF8 fixup feature lets you avoid that. When fixup is enabled, Sphinx will preprocess the incoming stream before passing it to the XML parser and replace invalid UTF-8 sequences with spaces. Example: xmlpipe_fixup_utf8 = 1 mssql_winauth MS SQL Windows authentication flag. Boolean, optional, default value is 0 (false). Applies to source type only. Introduced in version 0.9.9-rc1. Whether to use currently logged in Windows account credentials for authentication when connecting to MS SQL Server. Note that when running searchd as a service, account user can differ from the account you used to install the service. Example: mssql_winauth = 1 mssql_unicode MS SQL encoding type flag. Boolean, optional, default value is 0 (false). Applies to source type only. Introduced in version 0.9.9-rc1. Whether to ask for Unicode or single-byte data when querying MS SQL Server. This flag must be in sync with charset_type directive; that is, to index Unicode data, you must set both in the index (to 'utf-8') and in the source (to 1). For reference, MS SQL will actually return data in UCS-2 encoding instead of UTF-8, but Sphinx will automatically handle that. Example: mssql_unicode = 1 unpack_zlib Columns to unpack using zlib (aka deflate, aka gunzip). Multi-value, optional, default value is empty list of columns. Applies to SQL source types (, , ) only. Introduced in version 0.9.9-rc1. Columns specified using this directive will be unpacked by indexer using standard zlib algorithm (called deflate and also implemented by gunzip). When indexing on a different box than the database, this lets you offload the database, and save on network traffic. The feature is only available if zlib and zlib-devel were both available during build time. Example: unpack_zlib = col1 unpack_zlib = col2 unpack_mysqlcompress Columns to unpack using MySQL UNCOMPRESS() algorithm. Multi-value, optional, default value is empty list of columns. Applies to SQL source types (, , ) only. Introduced in version 0.9.9-rc1. Columns specified using this directive will be unpacked by indexer using modified zlib algorithm used by MySQL COMPRESS() and UNCOMPRESS() functions. When indexing on a different box than the database, this lets you offload the database, and save on network traffic. The feature is only available if zlib and zlib-devel were both available during build time. Example: unpack_mysqlcompress = body_compressed unpack_mysqlcompress = description_compressed unpack_mysqlcompress_maxsize Buffer size for UNCOMPRESS()ed data. Optional, default value is 16M. Introduced in version 0.9.9-rc1. When using unpack_mysqlcompress, due to implementation intrincacies it is not possible to deduce the required buffer size from the compressed data. So the buffer must be preallocated in advance, and unpacked data can not go over the buffer size. This option lets you control the buffer size, both to limit indexer memory use, and to enable unpacking of really long data fields if necessary. Example: unpack_mysqlcompress_maxsize = 1M Index configuration options type Index type. Known values are 'plain', 'distributed', and 'rt'. Optional, default is 'plain' (plain local index). Sphinx supports several different types of indexes. Versions 0.9.x supported two index types: plain local indexes that are stored and processed on the local machine; and distributed indexes, that involve not only local searching but querying remote searchd instances over the network as well (see ). Version 1.10-beta also adds support for so-called real-time indexes (or RT indexes for short) that are also stored and processed locally, but additionally allow for on-the-fly updates of the full-text index (see ). Note that attributes can be updated on-the-fly using either plain local indexes or RT ones. Index type setting lets you choose the needed type. By default, plain local index type will be assumed. Example: type = distributed source Adds document source to local index. Multi-value, mandatory. Specifies document source to get documents from when the current index is indexed. There must be at least one source. There may be multiple sources, without any restrictions on the source types: ie. you can pull part of the data from MySQL server, part from PostgreSQL, part from the filesystem using xmlpipe2 wrapper. However, there are some restrictions on the source data. First, document IDs must be globally unique across all sources. If that condition is not met, you might get unexpected search results. Second, source schemas must be the same in order to be stored within the same index. No source ID is stored automatically. Therefore, in order to be able to tell what source the matched document came from, you will need to store some additional information yourself. Two typical approaches include: mangling document ID and encoding source ID in it: source src1 { sql_query = SELECT id*10+1, ... FROM table1 ... } source src2 { sql_query = SELECT id*10+2, ... FROM table2 ... } storing source ID simply as an attribute: source src1 { sql_query = SELECT id, 1 AS source_id FROM table1 sql_attr_uint = source_id ... } source src2 { sql_query = SELECT id, 2 AS source_id FROM table2 sql_attr_uint = source_id ... } Example: source = srcpart1 source = srcpart2 source = srcpart3 path Index files path and file name (without extension). Mandatory. Path specifies both directory and file name, but without extension. indexer will append different extensions to this path when generating final names for both permanent and temporary index files. Permanent data files have several different extensions starting with '.sp'; temporary files' extensions start with '.tmp'. It's safe to remove .tmp* files is if indexer fails to remove them automatically. For reference, different index files store the following data: .spa stores document attributes (used in extern docinfo storage mode only); .spd stores matching document ID lists for each word ID; .sph stores index header information; .spi stores word lists (word IDs and pointers to .spd file); .spk stores kill-lists; .spm stores MVA data; .spp stores hit (aka posting, aka word occurence) lists for each word ID; .sps stores string attribute data. Example: path = /var/data/test1 docinfo Document attribute values (docinfo) storage mode. Optional, default is 'extern'. Known values are 'none', 'extern' and 'inline'. Docinfo storage mode defines how exactly docinfo will be physically stored on disk and RAM. "none" means that there will be no docinfo at all (ie. no attributes). Normally you need not to set "none" explicitly because Sphinx will automatically select "none" when there are no attributes configured. "inline" means that the docinfo will be stored in the .spd file, along with the document ID lists. "extern" means that the docinfo will be stored separately (externally) from document ID lists, in a special .spa file. Basically, externally stored docinfo must be kept in RAM when querying. for performance reasons. So in some cases "inline" might be the only option. However, such cases are infrequent, and docinfo defaults to "extern". Refer to for in-depth discussion and RAM usage estimates. Example: docinfo = inline mlock Memory locking for cached data. Optional, default is 0 (do not call mlock()). For search performance, searchd preloads a copy of .spa and .spi files in RAM, and keeps that copy in RAM at all times. But if there are no searches on the index for some time, there are no accesses to that cached copy, and OS might decide to swap it out to disk. First queries to such "cooled down" index will cause swap-in and their latency will suffer. Setting mlock option to 1 makes Sphinx lock physical RAM used for that cached data using mlock(2) system call, and that prevents swapping (see man 2 mlock for details). mlock(2) is a privileged call, so it will require searchd to be either run from root account, or be granted enough privileges otherwise. If mlock() fails, a warning is emitted, but index continues working. Example: mlock = 1 morphology A list of morphology preprocessors to apply. Optional, default is empty (do not apply any preprocessor). Morphology preprocessors can be applied to the words being indexed to replace different forms of the same word with the base, normalized form. For instance, English stemmer will normalize both "dogs" and "dog" to "dog", making search results for both searches the same. Built-in preprocessors include English stemmer, Russian stemmer (that supports UTF-8 and Windows-1251 encodings), Soundex, and Metaphone. The latter two replace the words with special phonetic codes that are equal is words are phonetically close. Additional stemmers provided by Snowball project libstemmer library can be enabled at compile time using configure option. Built-in English and Russian stemmers should be faster than their libstemmer counterparts, but can produce slightly different results, because they are based on an older version. Metaphone implementation is based on Double Metaphone algorithm and indexes the primary code. Built-in values that are available for use in option are as follows: none - do not perform any morphology processing; stem_en - apply Porter's English stemmer; stem_ru - apply Porter's Russian stemmer; stem_enru - apply Porter's English and Russian stemmers; stem_cz - apply Czech stemmer; soundex - replace keywords with their SOUNDEX code; metaphone - replace keywords with their METAPHONE code. Additional values provided by libstemmer are in 'libstemmer_XXX' format, where XXX is libstemmer algorithm codename (refer to libstemmer_c/libstemmer/modules.txt for a complete list). Several stemmers can be specified (comma-separated). They will be applied to incoming words in the order they are listed, and the processing will stop once one of the stemmers actually modifies the word. Also when wordforms feature is enabled the word will be looked up in word forms dictionary first, and if there is a matching entry in the dictionary, stemmers will not be applied at all. Or in other words, wordforms can be used to implement stemming exceptions. Example: morphology = stem_en, libstemmer_sv dict The keywords dictionary type. Known values are 'crc' and 'keywords'. Optional, default is 'crc'. Introduced in version 2.0.1-beta. The default dictionary type in Sphinx, and the only one available until version 2.0.1-beta, is a so-called CRC dictionary which never stores the original keyword text in the index. Instead, keywords are replaced with their control sum value (either CRC32 or FNV64, depending whether Sphinx was built with ) both when searching and indexing, and that value is used internally in the index. That approach has two drawbacks. First, in CRC32 case there is a chance of control sum collision between several pairs of different keywords, growing quadratically with the number of unique keywords in the index. (FNV64 case is unaffected in practice, as a chance of a single FNV64 collision in a dictionary of 1 billion entries is approximately 1:16, or 6.25 percent. And most dictionaries will be much more compact that a billion keywords, as a typical spoken human language has in the region of 1 to 10 million word forms.) Second, and more importantly, substring searches are not directly possible with control sums. Sphinx alleviated that by pre-indexing all the possible substrings as separate keywords (see , directives). That actually has an added benefit of matching substrings in the quickest way possible. But at the same time pre-indexing all substrings grows the index size a lot (factors of 3-10x and even more would not be unusual) and impacts the indexing time respectively, rendering substring searches on big indexes rather impractical. Keywords dictionary, introduced in 2.0.1-beta, fixes both these drawbacks. It stores the keywords in the index and performs search-time wildcard expansion. For example, a search for a 'test*' prefix could internally expand to 'test|tests|testing' query based on the dictionary contents. That expansion is fully transparent to the application, except that the separate per-keyword statistics for all the actually matched keywords would now also be reported. Indexing with keywords dictionary should be 1.1x to 1.3x slower compared to regular, non-substring indexing - but times faster compared to substring indexing (either prefix or infix). Index size should only be slightly bigger that than of the regular non-substring index, with a 1..10% percent total difference Regular keyword searching time must be very close or identical across all three discussed index kinds (CRC non-substring, CRC substring, keywords). Substring searching time can vary greatly depending on how many actual keywords match the given substring (in other words, into how many keywords does the search term expand). The maximum number of keywords matched is restricted by the expansion_limit directive. Essentially, keywords and CRC dictionaries represent the two different trade-off substring searching decisions. You can choose to either sacrifice indexing time and index size in favor of top-speed worst-case searches (CRC dictionary), or only slightly impact indexing time but sacrifice worst-case searching time when the prefix expands into very many keywords (keywords dictionary). Example: dict = keywords index_sp Whether to detect and index sentence and paragraph boundaries. Optional, default is 0 (do not detect and index). Introduced in version 2.0.1-beta. This directive enables sentence and paragraph boundary indexing. It's required for the SENTENCE and PARAGRAPH operators to work. Sentence boundary detection is based on plain text analysis, so you only need to set index_sp = 1 to enable it. Paragraph detection is however based on HTML markup, and happens in the HTML stripper. So to index paragraph locations you also need to enable the stripper by specifying html_strip = 1. Both types of boundaries are detected based on a few built-in rules enumerated just below. Sentence boundary detection rules are as follows. Question and excalamation signs (? and !) are always a sentence boundary. Trailing dot (.) is a sentence boundary, except: When followed by a letter. That's considered a part of an abbreviation (as in "S.T.A.L.K.E.R" or "Goldman Sachs S.p.A."). When followed by a comma. That's considered an abbreviation followed by a comma (as in "Telecom Italia S.p.A., founded in 1994"). When followed by a space and a small letter. That's considered an abbreviation within a sentence (as in "News Corp. announced in Februrary"). When preceded by a space and a capital letter, and followed by a space. That's considered a middle initial (as in "John D. Doe"). Paragraph boundaries are inserted at every block-level HTML tag. Namely, those are (as taken from HTML 4 standard) ADDRESS, BLOCKQUOTE, CAPTION, CENTER, DD, DIV, DL, DT, H1, H2, H3, H4, H5, LI, MENU, OL, P, PRE, TABLE, TBODY, TD, TFOOT, TH, THEAD, TR, and UL. Both sentences and paragraphs increment the keyword position counter by 1. Example: index_sp = 1 index_zones A list of in-field HTML/XML zones to index. Optional, default is empty (do not index zones). Introduced in version 2.0.1-beta. Zones can be formally defined as follows. Everything between an opening and a matching closing tag is called a span, and the aggregate of all spans corresponding sharing the same tag name is called a zone. For instance, everything between the occurrences of <H1> and </H1> in the document field belongs to H1 zone. Zone indexing, enabled by index_zones directive, is an optional extension of the HTML stripper. So it will also require that the stripper is enabled (with html_strip = 1). The value of the index_zones should be a comma-separated list of those tag names and wildcards (ending with a star) that should be indexed as zones. Zones can nest and overlap arbitrarily. The only requirement is that every opening tag has a matching tag. You can also have an arbitrary number of both zones (as in unique zone names, such as H1) and spans (all the occurrences of those H1 tags) in a document. Once indexed, zones can then be used for matching with the ZONE operator, see . Example: index_zones = h*, th, title min_stemming_len Minimum word length at which to enable stemming. Optional, default is 1 (stem everything). Introduced in version 0.9.9-rc1. Stemmers are not perfect, and might sometimes produce undesired results. For instance, running "gps" keyword through Porter stemmer for English results in "gp", which is not really the intent. feature lets you suppress stemming based on the source word length, ie. to avoid stemming too short words. Keywords that are shorter than the given threshold will not be stemmed. Note that keywords that are exactly as long as specified will be stemmed. So in order to avoid stemming 3-character keywords, you should specify 4 for the value. For more finely grained control, refer to wordforms feature. Example: min_stemming_len = 4 stopwords Stopword files list (space separated). Optional, default is empty. Stopwords are the words that will not be indexed. Typically you'd put most frequent words in the stopwords list because they do not add much value to search results but consume a lot of resources to process. You can specify several file names, separated by spaces. All the files will be loaded. Stopwords file format is simple plain text. The encoding must match index encoding specified in charset_type. File data will be tokenized with respect to charset_table settings, so you can use the same separators as in the indexed data. The stemmers will also be applied when parsing stopwords file. While stopwords are not indexed, they still do affect the keyword positions. For instance, assume that "the" is a stopword, that document 1 contains the line "in office", and that document 2 contains "in the office". Searching for "in office" as for exact phrase will only return the first document, as expected, even though "the" in the second one is stopped. Example: stopwords = /usr/local/sphinx/data/stopwords.txt stopwords = stopwords-ru.txt stopwords-en.txt wordforms Word forms dictionary. Optional, default is empty. Word forms are applied after tokenizing the incoming text by charset_table rules. They essentialy let you replace one word with another. Normally, that would be used to bring different word forms to a single normal form (eg. to normalize all the variants such as "walks", "walked", "walking" to the normal form "walk"). It can also be used to implement stemming exceptions, because stemming is not applied to words found in the forms list. Dictionaries are used to normalize incoming words both during indexing and searching. Therefore, to pick up changes in wordforms file it's required to reindex and restart searchd. Word forms support in Sphinx is designed to support big dictionaries well. They moderately affect indexing speed: for instance, a dictionary with 1 million entries slows down indexing about 1.5 times. Searching speed is not affected at all. Additional RAM impact is roughly equal to the dictionary file size, and dictionaries are shared across indexes: ie. if the very same 50 MB wordforms file is specified for 10 different indexes, additional searchd RAM usage will be about 50 MB. Dictionary file should be in a simple plain text format. Each line should contain source and destination word forms, in exactly the same encoding as specified in charset_type, separated by "greater" sign. Rules from the charset_table will be applied when the file is loaded. So basically it's as case sensitive as your other full-text indexed data, ie. typically case insensitive. Here's the file contents sample: walks > walk walked > walk walking > walk There is a bundled spelldump utility that helps you create a dictionary file in the format Sphinx can read from source .dict and .aff dictionary files in ispell or MySpell format (as bundled with OpenOffice). Starting with version 0.9.9-rc1, you can map several source words to a single destination word. Because the work happens on tokens, not the source text, differences in whitespace and markup are ignored. core 2 duo > c2d e6600 > c2d core 2duo > c2d Notice however that the destination wordforms are still always interpreted as a single keyword! Having a mapping like "St John > Saint John" will result in not matching "St John" when searching for "Saint" or "John", because the destination keyword will be "Saint John" with a space character in it (and it's barely possible to input a destination keyword with a space). Example: wordforms = /usr/local/sphinx/data/wordforms.txt exceptions Tokenizing exceptions file. Optional, default is empty. Exceptions allow to map one or more tokens (including tokens with characters that would normally be excluded) to a single keyword. They are similar to wordforms in that they also perform mapping, but have a number of important differences. Short summary of the differences is as follows: exceptions are case sensitive, wordforms are not; exceptions allow to detect sequences of tokens, wordforms work with single words only; exceptions can use special characters that are not in charset_table, wordforms fully obey charset_table; exceptions can underperform on huge dictionaries, wordforms handle millions of entries well. The expected file format is also plain text, with one line per exception, and the line format is as follows: map-from-tokens => map-to-token Example file: AT & T => AT&T AT&T => AT&T Standarten Fuehrer => standartenfuhrer Standarten Fuhrer => standartenfuhrer MS Windows => ms windows Microsoft Windows => ms windows C++ => cplusplus c++ => cplusplus C plus plus => cplusplus All tokens here are case sensitive: they will not be processed by charset_table rules. Thus, with the example exceptions file above, "At&t" text will be tokenized as two keywords "at" and "t", because of lowercase letters. On the other hand, "AT&T" will match exactly and produce single "AT&T" keyword. Note that this map-to keyword is a) always interpereted as a single word, and b) is both case and space sensitive! In our sample, "ms windows" query will not match the document with "MS Windows" text. The query will be interpreted as a query for two keywords, "ms" and "windows". And what "MS Windows" gets mapped to is a single keyword "ms windows", with a space in the middle. On the other hand, "standartenfuhrer" will retrieve documents with "Standarten Fuhrer" or "Standarten Fuehrer" contents (capitalized exactly like this), or any capitalization variant of the keyword itself, eg. "staNdarTenfUhreR". (It won't catch "standarten fuhrer", however: this text does not match any of the listed exceptions because of case sensitivity, and gets indexed as two separate keywords.) Whitespace in the map-from tokens list matters, but its amount does not. Any amount of the whitespace in the map-form list will match any other amount of whitespace in the indexed document or query. For instance, "AT & T" map-from token will match "AT    &  T" text, whatever the amount of space in both map-from part and the indexed text. Such text will therefore be indexed as a special "AT&T" keyword, thanks to the very first entry from the sample. Exceptions also allow to capture special characters (that are exceptions from general charset_table rules; hence the name). Assume that you generally do not want to treat '+' as a valid character, but still want to be able search for some exceptions from this rule such as 'C++'. The sample above will do just that, totally independent of what characters are in the table and what are not. Exceptions are applied to raw incoming document and query data during indexing and searching respectively. Therefore, to pick up changes in the file it's required to reindex and restart searchd. Example: exceptions = /usr/local/sphinx/data/exceptions.txt min_word_len Minimum indexed word length. Optional, default is 1 (index everything). Only those words that are not shorter than this minimum will be indexed. For instance, if min_word_len is 4, then 'the' won't be indexed, but 'they' will be. Example: min_word_len = 4 charset_type Character set encoding type. Optional, default is 'sbcs'. Known values are 'sbcs' and 'utf-8'. Different encodings have different methods for mapping their internal characters codes into specific byte sequences. Two most common methods in use today are single-byte encoding and UTF-8. Their corresponding charset_type values are 'sbcs' (stands for Single Byte Character Set) and 'utf-8'. The selected encoding type will be used everywhere where the index is used: when indexing the data, when parsing the query against this index, when generating snippets, etc. Note that while 'utf-8' implies that the decoded values must be treated as Unicode codepoint numbers, there's a family of 'sbcs' encodings that may in turn treat different byte values differently, and that should be properly reflected in your charset_table settings. For example, the same byte value of 224 (0xE0 hex) maps to different Russian letters depending on whether koi-8r or windows-1251 encoding is used. Example: charset_type = utf-8 charset_table Accepted characters table, with case folding rules. Optional, default value depends on charset_type value. charset_table is the main workhorse of Sphinx tokenizing process, ie. the process of extracting keywords from document text or query txet. It controls what characters are accepted as valid and what are not, and how the accepted characters should be transformed (eg. should the case be removed or not). You can think of charset_table as of a big table that has a mapping for each and every of 100K+ characters in Unicode (or as of a small 256-character table if you're using SBCS). By default, every character maps to 0, which means that it does not occur within keywords and should be treated as a separator. Once mentioned in the table, character is mapped to some other character (most frequently, either to itself or to a lowercase letter), and is treated as a valid keyword part. The expected value format is a commas-separated list of mappings. Two simplest mappings simply declare a character as valid, and map a single character to another single character, respectively. But specifying the whole table in such form would result in bloated and barely manageable specifications. So there are several syntax shortcuts that let you map ranges of characters at once. The complete list is as follows: A->a Single char mapping, declares source char 'A' as allowed to occur within keywords and maps it to destination char 'a' (but does not declare 'a' as allowed). A..Z->a..z Range mapping, declares all chars in source range as allowed and maps them to the destination range. Does not declare destination range as allowed. Also checks ranges' lengths (the lengths must be equal). a Stray char mapping, declares a character as allowed and maps it to itself. Equivalent to a->a single char mapping. a..z Stray range mapping, declares all characters in range as allowed and maps them to themselves. Equivalent to a..z->a..z range mapping. A..Z/2 Checkerboard range map. Maps every pair of chars to the second char. More formally, declares odd characters in range as allowed and maps them to the even ones; also declares even characters as allowed and maps them to themselves. For instance, A..Z/2 is equivalent to A->B, B->B, C->D, D->D, ..., Y->Z, Z->Z. This mapping shortcut is helpful for a number of Unicode blocks where uppercase and lowercase letters go in such interleaved order instead of contiguous chunks. Control characters with codes from 0 to 31 are always treated as separators. Characters with codes 32 to 127, ie. 7-bit ASCII characters, can be used in the mappings as is. To avoid configuration file encoding issues, 8-bit ASCII characters and Unicode characters must be specified in U+xxx form, where 'xxx' is hexadecimal codepoint number. This form can also be used for 7-bit ASCII characters to encode special ones: eg. use U+20 to encode space, U+2E to encode dot, U+2C to encode comma. Example: # 'sbcs' defaults for English and Russian charset_table = 0..9, A..Z->a..z, _, a..z, \ U+A8->U+B8, U+B8, U+C0..U+DF->U+E0..U+FF, U+E0..U+FF # 'utf-8' defaults for English and Russian charset_table = 0..9, A..Z->a..z, _, a..z, \ U+410..U+42F->U+430..U+44F, U+430..U+44F ignore_chars Ignored characters list. Optional, default is empty. Useful in the cases when some characters, such as soft hyphenation mark (U+00AD), should be not just treated as separators but rather fully ignored. For example, if '-' is simply not in the charset_table, "abc-def" text will be indexed as "abc" and "def" keywords. On the contrary, if '-' is added to ignore_chars list, the same text will be indexed as a single "abcdef" keyword. The syntax is the same as for charset_table, but it's only allowed to declare characters, and not allowed to map them. Also, the ignored characters must not be present in charset_table. Example: ignore_chars = U+AD min_prefix_len Minimum word prefix length to index. Optional, default is 0 (do not index prefixes). Prefix indexing allows to implement wildcard searching by 'wordstart*' wildcards (refer to enable_star option for details on wildcard syntax). When mininum prefix length is set to a positive number, indexer will index all the possible keyword prefixes (ie. word beginnings) in addition to the keywords themselves. Too short prefixes (below the minimum allowed length) will not be indexed. For instance, indexing a keyword "example" with min_prefix_len=3 will result in indexing "exa", "exam", "examp", "exampl" prefixes along with the word itself. Searches against such index for "exam" will match documents that contain "example" word, even if they do not contain "exam" on itself. However, indexing prefixes will make the index grow significantly (because of many more indexed keywords), and will degrade both indexing and searching times. There's no automatic way to rank perfect word matches higher in a prefix index, but there's a number of tricks to achieve that. First, you can setup two indexes, one with prefix indexing and one without it, search through both, and use SetIndexWeights() call to combine weights. Second, you can enable star-syntax and rewrite your extended-mode queries: # in sphinx.conf enable_star = 1 // in query $cl->Query ( "( keyword | keyword* ) other keywords" ); Example: min_prefix_len = 3 min_infix_len Minimum infix prefix length to index. Optional, default is 0 (do not index infixes). Infix indexing allows to implement wildcard searching by 'start*', '*end', and '*middle*' wildcards (refer to enable_star option for details on wildcard syntax). When mininum infix length is set to a positive number, indexer will index all the possible keyword infixes (ie. substrings) in addition to the keywords themselves. Too short infixes (below the minimum allowed length) will not be indexed. For instance, indexing a keyword "test" with min_infix_len=2 will result in indexing "te", "es", "st", "tes", "est" infixes along with the word itself. Searches against such index for "es" will match documents that contain "test" word, even if they do not contain "es" on itself. However, indexing infixes will make the index grow significantly (because of many more indexed keywords), and will degrade both indexing and searching times. There's no automatic way to rank perfect word matches higher in an infix index, but the same tricks as with prefix indexes can be applied. Example: min_infix_len = 3 prefix_fields The list of full-text fields to limit prefix indexing to. Optional, default is empty (index all fields in prefix mode). Because prefix indexing impacts both indexing and searching performance, it might be desired to limit it to specific full-text fields only: for instance, to provide prefix searching through URLs, but not through page contents. prefix_fields specifies what fields will be prefix-indexed; all other fields will be indexed in normal mode. The value format is a comma-separated list of field names. Example: prefix_fields = url, domain infix_fields The list of full-text fields to limit infix indexing to. Optional, default is empty (index all fields in infix mode). Similar to prefix_fields, but lets you limit infix-indexing to given fields. Example: infix_fields = url, domain enable_star Enables star-syntax (or wildcard syntax) when searching through prefix/infix indexes. Optional, default is is 0 (do not use wildcard syntax), for compatibility with 0.9.7. Known values are 0 and 1. This feature enables "star-syntax", or wildcard syntax, when searching through indexes which were created with prefix or infix indexing enabled. It only affects searching; so it can be changed without reindexing by simply restarting searchd. The default value is 0, that means to disable star-syntax and treat all keywords as prefixes or infixes respectively, depending on indexing-time min_prefix_len and min_infix_len settings. The value of 1 means that star ('*') can be used at the start and/or the end of the keyword. The star will match zero or more characters. For example, assume that the index was built with infixes and that enable_star is 1. Searching should work as follows: "abcdef" query will match only those documents that contain the exact "abcdef" word in them. "abc*" query will match those documents that contain any words starting with "abc" (including the documents which contain the exact "abc" word only); "*cde*" query will match those documents that contain any words which have "cde" characters in any part of the word (including the documents which contain the exact "cde" word only). "*def" query will match those documents that contain any words ending with "def" (including the documents that contain the exact "def" word only). Example: enable_star = 1 ngram_len N-gram lengths for N-gram indexing. Optional, default is 0 (disable n-gram indexing). Known values are 0 and 1 (other lengths to be implemented). N-grams provide basic CJK (Chinese, Japanese, Korean) support for unsegmented texts. The issue with CJK searching is that there could be no clear separators between the words. Ideally, the texts would be filtered through a special program called segmenter that would insert separators in proper locations. However, segmenters are slow and error prone, and it's common to index contiguous groups of N characters, or n-grams, instead. When this feature is enabled, streams of CJK characters are indexed as N-grams. For example, if incoming text is "ABCDEF" (where A to F represent some CJK characters) and length is 1, in will be indexed as if it was "A B C D E F". (With length equal to 2, it would produce "AB BC CD DE EF"; but only 1 is supported at the moment.) Only those characters that are listed in ngram_chars table will be split this way; other ones will not be affected. Note that if search query is segmented, ie. there are separators between individual words, then wrapping the words in quotes and using extended mode will resut in proper matches being found even if the text was not segmented. For instance, assume that the original query is BC DEF. After wrapping in quotes on the application side, it should look like "BC" "DEF" (with quotes). This query will be passed to Sphinx and internally split into 1-grams too, resulting in "B C" "D E F" query, still with quotes that are the phrase matching operator. And it will match the text even though there were no separators in the text. Even if the search query is not segmented, Sphinx should still produce good results, thanks to phrase based ranking: it will pull closer phrase matches (which in case of N-gram CJK words can mean closer multi-character word matches) to the top. Example: ngram_len = 1 ngram_chars N-gram characters list. Optional, default is empty. To be used in conjunction with in ngram_len, this list defines characters, sequences of which are subject to N-gram extraction. Words comprised of other characters will not be affected by N-gram indexing feature. The value format is identical to charset_table. Example: ngram_chars = U+3000..U+2FA1F phrase_boundary Phrase boundary characters list. Optional, default is empty. This list controls what characters will be treated as phrase boundaries, in order to adjust word positions and enable phrase-level search emulation through proximity search. The syntax is similar to charset_table. Mappings are not allowed and the boundary characters must not overlap with anything else. On phrase boundary, additional word position increment (specified by phrase_boundary_step) will be added to current word position. This enables phrase-level searching through proximity queries: words in different phrases will be guaranteed to be more than phrase_boundary_step distance away from each other; so proximity search within that distance will be equivalent to phrase-level search. Phrase boundary condition will be raised if and only if such character is followed by a separator; this is to avoid abbreviations such as S.T.A.L.K.E.R or URLs being treated as several phrases. Example: phrase_boundary = ., ?, !, U+2026 # horizontal ellipsis phrase_boundary_step Phrase boundary word position increment. Optional, default is 0. On phrase boundary, current word position will be additionally incremented by this number. See phrase_boundary for details. Example: phrase_boundary_step = 100 html_strip Whether to strip HTML markup from incoming full-text data. Optional, default is 0. Known values are 0 (disable stripping) and 1 (enable stripping). Both HTML tags and entities and considered markup and get processed. HTML tags are removed, their contents (i.e., everything between <P> and </P>) are left intact by default. You can choose to keep and index attributes of the tags (e.g., HREF attribute in an A tag, or ALT in an IMG one). Several well-known inline tags are completely removed, all other tags are treated as block level and replaced with whitespace. For example, 'te<B>st</B>' text will be indexed as a single keyword 'test', however, 'te<P>st</P>' will be indexed as two keywords 'te' and 'st'. Known inline tags are as follows: A, B, I, S, U, BASEFONT, BIG, EM, FONT, IMG, LABEL, SMALL, SPAN, STRIKE, STRONG, SUB, SUP, TT. HTML entities get decoded and replaced with corresponding UTF-8 characters. Stripper supports both numeric forms (such as &#239;) and text forms (such as &oacute; or &nbsp;). All entities as specified by HTML4 standard are supported. Stripping does not work with source type (it's suggested to upgrade to xmlpipe2 anyway). It should work with properly formed HTML and XHTML, but, just as most browsers, may produce unexpected results on malformed input (such as HTML with stray <'s or unclosed >'s). Only the tags themselves, and also HTML comments, are stripped. To strip the contents of the tags too (eg. to strip embedded scripts), see html_remove_elements option. There are no restrictions on tag names; ie. everything that looks like a valid tag start, or end, or a comment will be stripped. Example: html_strip = 1 html_index_attrs A list of markup attributes to index when stripping HTML. Optional, default is empty (do not index markup attributes). Specifies HTML markup attributes whose contents should be retained and indexed even though other HTML markup is stripped. The format is per-tag enumeration of indexable attributes, as shown in the example below. Example: html_index_attrs = img=alt,title; a=title; html_remove_elements A list of HTML elements for which to strip contents along with the elements themselves. Optional, default is empty string (do not strip contents of any elements). This feature allows to strip element contents, ie. everything that is between the opening and the closing tags. It is useful to remove embedded scripts, CSS, etc. Short tag form for empty elements (ie. <br />) is properly supported; ie. the text that follows such tag will not be removed. The value is a comma-separated list of element (tag) names whose contents should be removed. Tag names are case insensitive. Example: html_remove_elements = style, script local Local index declaration in the distributed index. Multi-value, optional, default is empty. This setting is used to declare local indexes that will be searched when given distributed index is searched. All local indexes will be searched sequentially, utilizing only 1 CPU or core; to parallelize processing, you can configure searchd to query itself (refer to for the details). There might be several local indexes declared per each distributed index. Any local index can be mentioned several times in other distributed indexes. Example: local = chunk1 local = chunk2 agent Remote agent declaration in the distributed index. Multi-value, optional, default is empty. This setting is used to declare remote agents that will be searched when given distributed index is searched. The agents can be thought of as network pointers that specify host, port, and index names. In the basic case agents would correspond to remote physical machines. More formally, that is not always correct: you can point several agents to the same remote machine; or you can even point agents to the very same single instance of searchd (in order to utilize many CPUs or cores). The value format is as follows: agent = specification:remote-indexes-list specification = hostname ":" port | path Where 'hostname' is remote host name; 'port' is remote TCP port; 'path' is Unix-domain socket path and 'remote-indexes-list' is a comma-separated list of remote index names. All agents will be searched in parallel. However, all indexes specified for a given agent will be searched sequentially in this agent. This lets you fine-tune the configuration to the hardware. For instance, if two remote indexes are stored on the same physical HDD, it's better to configure one agent with several sequentially searched indexes to avoid HDD steping. If they are stored on different HDDs, having two agents will be advantageous, because the work will be fully parallelized. The same applies to CPUs; though CPU performance impact caused by two processes stepping on each other is somewhat smaller and frequently can be ignored at all. On machines with many CPUs and/or HDDs, agents can be pointed to the same machine to utilize all of the hardware in parallel and reduce query latency. There is no need to setup several searchd instances for that; it's legal to configure the instance to contact itself. Here's an example setup, intended for a 4-CPU machine, that will use up to 4 CPUs in parallel to process each query: index dist { type = distributed local = chunk1 agent = localhost:9312:chunk2 agent = localhost:9312:chunk3 agent = localhost:9312:chunk4 } Note how one of the chunks is searched locally and the same instance of searchd queries itself to launch searches through three other ones in parallel. Example: agent = localhost:9312:chunk2 # contact itself agent = /var/run/searchd.s:chunk2 agent = searchbox2:9312:chunk3,chunk4 # search remote indexes agent_blackhole Remote blackhole agent declaration in the distributed index. Multi-value, optional, default is empty. Introduced in version 0.9.9-rc1. lets you fire-and-forget queries to remote agents. That is useful for debugging (or just testing) production clusters: you can setup a separate debugging/testing searchd instance, and forward the requests to this instance from your production master (aggregator) instance without interfering with production work. Master searchd will attempt to connect and query blackhole agent normally, but it will neither wait nor process any responses. Also, all network errors on blackhole agents will be ignored. The value format is completely identical to regular agent directive. Example: agent_blackhole = testbox:9312:testindex1,testindex2 agent_connect_timeout Remote agent connection timeout, in milliseconds. Optional, default is 1000 (ie. 1 second). When connecting to remote agents, searchd will wait at most this much time for connect() call to complete succesfully. If the timeout is reached but connect() does not complete, and retries are enabled, retry will be initiated. Example: agent_connect_timeout = 300 agent_query_timeout Remote agent query timeout, in milliseconds. Optional, default is 3000 (ie. 3 seconds). After connection, searchd will wait at most this much time for remote queries to complete. This timeout is fully separate from connection timeout; so the maximum possible delay caused by a remote agent equals to the sum of agent_connection_timeout and agent_query_timeout. Queries will not be retried if this timeout is reached; a warning will be produced instead. Example: agent_query_timeout = 10000 # our query can be long, allow up to 10 sec preopen Whether to pre-open all index files, or open them per each query. Optional, default is 0 (do not preopen). This option tells searchd that it should pre-open all index files on startup (or rotation) and keep them open while it runs. Currently, the default mode is not to pre-open the files (this may change in the future). Preopened indexes take a few (currently 2) file descriptors per index. However, they save on per-query open() calls; and also they are invulnerable to subtle race conditions that may happen during index rotation under high load. On the other hand, when serving many indexes (100s to 1000s), it still might be desired to open the on per-query basis in order to save file descriptors. This directive does not affect indexer in any way, it only affects searchd. Example: preopen = 1 ondisk_dict Whether to keep the dictionary file (.spi) for this index on disk, or precache it in RAM. Optional, default is 0 (precache in RAM). Introduced in version 0.9.9-rc1. The dictionary (.spi) can be either kept on RAM or on disk. The default is to fully cache it in RAM. That improves performance, but might cause too much RAM pressure, especially if prefixes or infixes were used. Enabling results in 1 additional disk IO per keyword per query, but reduces memory footprint. This directive does not affect indexer in any way, it only affects searchd. Example: ondisk_dict = 1 inplace_enable Whether to enable in-place index inversion. Optional, default is 0 (use separate temporary files). Introduced in version 0.9.9-rc1. greatly reduces indexing disk footprint, at a cost of slightly slower indexing (it uses around 2x less disk, but yields around 90-95% the original performance). Indexing involves two major phases. The first phase collects, processes, and partially sorts documents by keyword, and writes the intermediate result to temporary files (.tmp*). The second phase fully sorts the documents, and creates the final index files. Thus, rebuilding a production index on the fly involves around 3x peak disk footprint: 1st copy for the intermediate temporary files, 2nd copy for newly constructed copy, and 3rd copy for the old index that will be serving production queries in the meantime. (Intermediate data is comparable in size to the final index.) That might be too much disk footprint for big data collections, and allows to reduce it. When enabled, it reuses the temporary files, outputs the final data back to them, and renames them on completion. However, this might require additional temporary data chunk relocation, which is where the performance impact comes from. This directive does not affect searchd in any way, it only affects indexer. Example: inplace_enable = 1 inplace_hit_gap In-place inversion fine-tuning option. Controls preallocated hitlist gap size. Optional, default is 0. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: inplace_hit_gap = 1M inplace_docinfo_gap In-place inversion fine-tuning option. Controls preallocated docinfo gap size. Optional, default is 0. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: inplace_docinfo_gap = 1M inplace_reloc_factor In-place inversion fine-tuning option. Controls relocation buffer size within indexing memory arena. Optional, default is 0.1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: inplace_reloc_factor = 0.1 inplace_write_factor In-place inversion fine-tuning option. Controls in-place write buffer size within indexing memory arena. Optional, default is 0.1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: inplace_write_factor = 0.1 index_exact_words Whether to index the original keywords along with the stemmed/remapped versions. Optional, default is 0 (do not index). Introduced in version 0.9.9-rc1. When enabled, forces indexer to put the raw keywords in the index along with the stemmed versions. That, in turn, enables exact form operator in the query language to work. This impacts the index size and the indexing time. However, searching performance is not impacted at all. Example: index_exact_words = 1 overshort_step Position increment on overshort (less that min_word_len) keywords. Optional, allowed values are 0 and 1, default is 1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: overshort_step = 1 stopword_step Position increment on stopwords. Optional, allowed values are 0 and 1, default is 1. Introduced in version 0.9.9-rc1. This directive does not affect searchd in any way, it only affects indexer. Example: stopword_step = 1 hitless_words Hitless words list. Optional, allowed values are 'all', or a list file name. Introduced in version 1.10-beta. By default, Sphinx full-text index stores not only a list of matching documents for every given keyword, but also a list of its in-document positions (aka hitlist). Hitlists enables phrase, proximity, strict order and other advanced types of searching, as well as phrase proximity ranking. However, hitlists for specific frequent keywords (that can not be stopped for some reason despite being frequent) can get huge and thus slow to process while querying. Also, in some cases we might only care about boolean keyword matching, and never need position-based searching operators (such as phrase matching) nor phrase ranking. lets you create indexes that either do not have positional information (hitlists) at all, or skip it for specific keywords. Hitless index will generally use less space than the respective regular index (about 1.5x can be expected). Both indexing and searching should be faster, at a cost of missing positional query and ranking support. When searching, positional queries (eg. phrase queries) will be automatically converted to respective non-positional (document-level) or combined queries. For instance, if keywords "hello" and "world" are hitless, "hello world" phrase query will be converted to (hello & world) bag-of-words query, matching all documents that mention either of the keywords but not necessarily the exact phrase. And if, in addition, keywords "simon" and "says" are not hitless, "simon says hello world" will be converted to ("simon says" & hello & world) query, matching all documents that contain "hello" and "world" anywhere in the document, and also "simon says" as an exact phrase. Example: hitless_words = all expand_keywords Expand keywords with exact forms and/or stars when possible. Optional, default is 0 (do not expand keywords). Introduced in version 1.10-beta. Queries against indexes with feature enabled are internally expanded as follows. If the index was built with prefix or infix indexing enabled, every keyword gets internally replaced with a disjunction of keyword itself and a respective prefix or infix (keyword with stars). If the index was built with both stemming and index_exact_words enabled, exact form is also added. Here's an example that shows how internal expansion works when all of the above (infixes, stemming, and exact words) are combined: running -> ( running | *running* | =running ) Expanded queries take naturally longer to complete, but can possibly improve the search quality, as the documents with exact form matches should be ranked generally higher than documents with stemmed or infix matches. Note that the existing query syntax does not allowe to emulate this kind of expansion, because internal expansion works on keyword level and expands keywords within phrase or quorum operators too (which is not possible through the query syntax). This directive does not affect indexer in any way, it only affects searchd. Example: expand_keywords = 1 blend_chars Blended characters list. Optional, default is empty. Introduced in version 1.10-beta. Blended characters are indexed both as separators and valid characters. For instance, assume that & is configured as blended and AT&T occurs in an indexed document. Three different keywords will get indexed, namely "at&t", treating blended characters as valid, plus "at" and "t", treating them as separators. Positions for tokens obtained by replacing blended characters with whitespace are assigned as usual, so regular keywords will be indexed just as if there was no specified at all. An additional token that mixes blended and non-blended characters will be put at the starting position. For instance, if the field contents are "AT&T company" occurs in the very beginning of the text field, "at" will be given position 1, "t" position 2, "company" positin 3, and "AT&T" will also be given position 1 ("blending" with the opening regular keyword). Thus, querying for either AT&T or just AT will match that document, and querying for "AT T" as a phrase also match it. Last but not least, phrase query for "AT&T company" will also match it, despite the position Blended characters can overlap with special characters used in query syntax (think of T-Mobile or @twitter). Where possible, query parser will automatically handle blended character as blended. For instance, "hello @twitter" within quotes (a phrase operator) would handle @-sign as blended, because @-syntax for field operator is not allowed within phrases. Otherwise, the character would be handled as an operator. So you might want to escape the keywords. Starting with version 2.0.1-beta, blended characters can be remapped, so that multiple different blended characters could be normalized into just one base form. This is useful when indexing multiple alternative Unicode codepoints with equivalent glyphs. Example: blend_chars = +, &, U+23 blend_chars = +, &->+ # 2.0.1 and above blend_mode Blended tokens indexing mode. Optional, default is . Introduced in version 2.0.1-beta. By default, tokens that mix blended and non-blended characters get indexed in there entirety. For instance, when both at-sign and an exclamation are in , "@dude!" will get result in two tokens indexed: "@dude!" (with all the blended characters) and "dude" (without any). Therefore "@dude" query will not match it. directive adds flexibility to this indexing behavior. It takes a comma-separated list of options. blend_mode = option [, option [, ...]] option = trim_none | trim_head | trim_tail | trim_both | skip_pure Options specify token indexing variants. If multiple options are specified, multiple variants of the same token will be indexed. Regular keywords (resulting from that token by replacing blended with whitespace) are always be indexed. trim_none Index the entire token. trim_head Trim heading blended characters, and index the resulting token. trim_tail Trim trailing blended characters, and index the resulting token. trim_both Trim both heading and trailing blended characters, and index the resulting token. skip_pure Do not index the token if it's purely blended, that is, consists of blended characters only. Returning to the "@dude!" example above, setting will result in two tokens being indexed, "@dude" and "dude!". In this particular example, would have no effect, because trimming both blended characters results in "dude" which is already indexed as a regular keyword. Indexing "@U.S.A." with (and assuming that dot is blended two) would result in "U.S.A" being indexed. Last but not least, enables you to fully ignore sequences of blended characters only. For example, "one @@@ two" would be indexed exactly as "one two", and match that as a phrase. That is not the case by default because a fully blended token gets indexed and offsets the second keyword position. Default behavior is to index the entire token, equivalent to . Example: blend_mode = trim_tail, skip_pure rt_mem_limit RAM chunk size limit. Optional, default is empty. Introduced in version 1.10-beta. RT index keeps some data in memory (so-called RAM chunk) and also maintains a number of on-disk indexes (so-called disk chunks). This directive lets you control the RAM chunk size. Once there's too much data to keep in RAM, RT index will flush it to disk, activate a newly created disk chunk, and reset the RAM chunk. The limit is pretty strict; RT index should never allocate more memory than it's limited to. The memory is not preallocated either, hence, specifying 512 MB limit and only inserting 3 MB of data should result in allocating 3 MB, not 512 MB. Example: rt_mem_limit = 512M rt_field Full-text field declaration. Multi-value, mandatory Introduced in version 1.10-beta. Full-text fields to be indexed are declared using directive. The names must be unique. The order is preserved; and so field values in INSERT statements without an explicit list of inserted columns will have to be in the same order as configured. Example: rt_field = author rt_field = title rt_field = content rt_attr_uint Unsigned integer attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares an unsigned 32-bit attribute. Introduced in version 1.10-beta. Example: rt_attr_uint = gid rt_attr_bigint BIGINT attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares a signed 64-bit attribute. Introduced in version 1.10-beta. Example: rt_attr_bigint = guid rt_attr_float Floating point attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Declares a single precision, 32-bit IEEE 754 format float attribute. Introduced in version 1.10-beta. Example: rt_attr_float = gpa rt_attr_timestamp Timestamp attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Introduced in version 1.10-beta. Example: rt_attr_timestamp = date_added rt_attr_string String attribute declaration. Multi-value (an arbitrary number of attributes is allowed), optional. Introduced in version 1.10-beta. Example: rt_attr_string = author <filename>indexer</filename> program configuration options mem_limit Indexing RAM usage limit. Optional, default is 32M. Enforced memory usage limit that the indexer will not go above. Can be specified in bytes, or kilobytes (using K postfix), or megabytes (using M postfix); see the example. This limit will be automatically raised if set to extremely low value causing I/O buffers to be less than 8 KB; the exact lower bound for that depends on the indexed data size. If the buffers are less than 256 KB, a warning will be produced. Maximum possible limit is 2047M. Too low values can hurt indexing speed, but 256M to 1024M should be enough for most if not all datasets. Setting this value too high can cause SQL server timeouts. During the document collection phase, there will be periods when the memory buffer is partially sorted and no communication with the database is performed; and the database server can timeout. You can resolve that either by raising timeouts on SQL server side or by lowering mem_limit. Example: mem_limit = 256M # mem_limit = 262144K # same, but in KB # mem_limit = 268435456 # same, but in bytes max_iops Maximum I/O operations per second, for I/O throttling. Optional, default is 0 (unlimited). I/O throttling related option. It limits maximum count of I/O operations (reads or writes) per any given second. A value of 0 means that no limit is imposed. indexer can cause bursts of intensive disk I/O during indexing, and it might desired to limit its disk activity (and keep something for other programs running on the same machine, such as searchd). I/O throttling helps to do that. It works by enforcing a minimum guaranteed delay between subsequent disk I/O operations performed by indexer. Modern SATA HDDs are able to perform up to 70-100+ I/O operations per second (that's mostly limited by disk heads seek time). Limiting indexing I/O to a fraction of that can help reduce search performance dedgradation caused by indexing. Example: max_iops = 40 max_iosize Maximum allowed I/O operation size, in bytes, for I/O throttling. Optional, default is 0 (unlimited). I/O throttling related option. It limits maximum file I/O operation (read or write) size for all operations performed by indexer. A value of 0 means that no limit is imposed. Reads or writes that are bigger than the limit will be split in several smaller operations, and counted as several operation by max_iops setting. At the time of this writing, all I/O calls should be under 256 KB (default internal buffer size) anyway, so max_iosize values higher than 256 KB must not affect anything. Example: max_iosize = 1048576 max_xmlpipe2_field Maximum allowed field size for XMLpipe2 source type, bytes. Optional, default is 2 MB. Example: max_xmlpipe2_field = 8M write_buffer Write buffer size, bytes. Optional, default is 1 MB. Write buffers are used to write both temporary and final index files when indexing. Larger buffers reduce the number of required disk writes. Memory for the buffers is allocated in addition to mem_limit. Note that several (currently up to 4) buffers for different files will be allocated, proportionally increasing the RAM usage. Example: write_buffer = 4M max_file_field_buffer Maximum file field adaptive buffer size, bytes. Optional, default is 8 MB, minimum is 1 MB. File field buffer is used to load files referred to from sql_file_field columns. This buffer is adaptive, starting at 1 MB at first allocation, and growing in 2x steps until either file contents can be loaded, or maximum buffer size, specified by directive, is reached. Thus, if there are no file fields are specified, no buffer is allocated at all. If all files loaded during indexing are under (for example) 2 MB in size, but value is 128 MB, peak buffer usage would still be only 2 MB. However, files over 128 MB would be entirely skipped. Example: max_file_field_buffer = 128M on_file_field_error How to handle IO errors in file fields. Optional, default is ignore_field. Introduced in version 2.0.2-beta. When there is a problem indexing a file referenced by a file field (), indexer can either index the document, assuming empty content in this particular field, or skip the document, or fail indexing entirely. directive controls that behavior. The values it takes are: ignore_field, index the current document without field; skip_document, skip the current document but continue indexing; fail_index, fail indexing with an error message. The problems that can arise are: open error, size error (file too big), and data read error. Warning messages on any problem will be given at all times, irregardless of the phase and the on_file_field_error setting. Note that with documents will only be ignored if problems are detected during an early check phase, and not during the actual file parsing phase. indexer will open every referenced file and check its size before doing any work, and then open it again when doing actual parsing work. So in case a file goes away between these two open attempts, the document will still be indexed. Example: on_file_field_errors = skip_document <filename>searchd</filename> program configuration options listen This setting lets you specify IP address and port, or Unix-domain socket path, that searchd will listen on. Introduced in version 0.9.9-rc1. The informal grammar for listen setting is: listen = ( address ":" port | port | path ) [ ":" protocol ] I.e. you can specify either an IP address (or hostname) and port number, or just a port number, or Unix socket path. If you specify port number but not the address, searchd will listen on all network interfaces. Unix path is identified by a leading slash. Starting with version 0.9.9-rc2, you can also specify a protocol handler (listener) to be used for connections on this socket. Supported protocol values are 'sphinx' (Sphinx 0.9.x API protocol) and 'mysql41' (MySQL protocol used since 4.1 upto at least 5.1). More details on MySQL protocol support can be found in section. Examples: listen = localhost listen = localhost:5000 listen = 192.168.0.1:5000 listen = /var/run/sphinx.s listen = 9312 listen = localhost:9306:mysql41 There can be multiple listen directives, searchd will listen for client connections on all specified ports and sockets. If no listen directives are found then the server will listen on all available interfaces using the default SphinxAPI port 9312. Starting with 1.10-beta, it will also listen on default SphinxQL port 9306. Both port numbers are assigned by IANA (see http://www.iana.org/assignments/port-numbers for details) and should therefore be available. Unix-domain sockets are not supported on Windows. address Interface IP address to bind on. Optional, default is 0.0.0.0 (ie. listen on all interfaces). DEPRECATED, use listen instead. address setting lets you specify which network interface searchd will bind to, listen on, and accept incoming network connections on. The default value is 0.0.0.0 which means to listen on all interfaces. At the time, you can not specify multiple interfaces. Example: address = 192.168.0.1 port searchd TCP port number. DEPRECATED, use listen instead. Used to be mandatory. Default port number is 9312. Example: port = 9312 log Log file name. Optional, default is 'searchd.log'. All searchd run time events will be logged in this file. Also you can use the 'syslog' as the file name. In this case the events will be sent to syslog daemon. To use the syslog option the sphinx must be configured '--with-syslog' on building. Example: log = /var/log/searchd.log query_log Query log file name. Optional, default is empty (do not log queries). All search queries will be logged in this file. The format is described in . In case of 'plain' format, you can use the 'syslog' as the path to the log file. In this case all search queries will be sent to syslog daemon with LOG_INFO priority, prefixed with '[query]' instead of timestamp. To use the syslog option the sphinx must be configured '--with-syslog' on building. Example: query_log = /var/log/query.log query_log_format Query log format. Optional, allowed values are 'plain' and 'sphinxql', default is 'plain'. Introduced in version 2.0.1-beta. Starting with version 2.0.1-beta, two different log formats are supported. The default one logs queries in a custom text format. The new one logs valid SphinxQL statements. This directive allows to switch between the two formats on search daemon startup. The log format can also be altered on the fly, using SET GLOBAL query_log_format=sphinxql syntax. Refer to for more discussion and format details. Example: query_log_format = sphinxql read_timeout Network client request read timeout, in seconds. Optional, default is 5 seconds. searchd will forcibly close the client connections which fail to send a query within this timeout. Example: read_timeout = 1 client_timeout Maximum time to wait between requests (in seconds) when using persistent connections. Optional, default is five minutes. Example: client_timeout = 3600 max_children Maximum amount of children to fork (or in other words, concurrent searches to run in parallel). Optional, default is 0 (unlimited). Useful to control server load. There will be no more than this much concurrent searches running, at all times. When the limit is reached, additional incoming clients are dismissed with temporarily failure (SEARCHD_RETRY) status code and a message stating that the server is maxed out. Example: max_children = 10 pid_file searchd process ID file name. Mandatory. PID file will be re-created (and locked) on startup. It will contain head daemon process ID while the daemon is running, and it will be unlinked on daemon shutdown. It's mandatory because Sphinx uses it internally for a number of things: to check whether there already is a running instance of searchd; to stop searchd; to notify it that it should rotate the indexes. Can also be used for different external automation scripts. Example: pid_file = /var/run/searchd.pid max_matches Maximum amount of matches that the daemon keeps in RAM for each index and can return to the client. Optional, default is 1000. Introduced in order to control and limit RAM usage, max_matches setting defines how much matches will be kept in RAM while searching each index. Every match found will still be processed; but only best N of them will be kept in memory and return to the client in the end. Assume that the index contains 2,000,000 matches for the query. You rarely (if ever) need to retrieve all of them. Rather, you need to scan all of them, but only choose "best" at most, say, 500 by some criteria (ie. sorted by relevance, or price, or anything else), and display those 500 matches to the end user in pages of 20 to 100 matches. And tracking only the best 500 matches is much more RAM and CPU efficient than keeping all 2,000,000 matches, sorting them, and then discarding everything but the first 20 needed to display the search results page. max_matches controls N in that "best N" amount. This parameter noticeably affects per-query RAM and CPU usage. Values of 1,000 to 10,000 are generally fine, but higher limits must be used with care. Recklessly raising max_matches to 1,000,000 means that searchd will have to allocate and initialize 1-million-entry matches buffer for every query. That will obviously increase per-query RAM usage, and in some cases can also noticeably impact performance. CAVEAT EMPTOR! Note that there also is another place where this limit is enforced. max_matches can be decreased on the fly through the corresponding API call, and the default value in the API is also set to 1,000. So in order to retrieve more than 1,000 matches to your application, you will have to change the configuration file, restart searchd, and set proper limit in SetLimits() call. Also note that you can not set the value in the API higher than the value in the .conf file. This is prohibited in order to have some protection against malicious and/or malformed requests. Example: max_matches = 10000 seamless_rotate Prevents searchd stalls while rotating indexes with huge amounts of data to precache. Optional, default is 1 (enable seamless rotation). Indexes may contain some data that needs to be precached in RAM. At the moment, .spa, .spi and .spm files are fully precached (they contain attribute data, MVA data, and keyword index, respectively.) Without seamless rotate, rotating an index tries to use as little RAM as possible and works as follows: new queries are temporarly rejected (with "retry" error code); searchd waits for all currently running queries to finish; old index is deallocated and its files are renamed; new index files are renamed and required RAM is allocated; new index attribute and dictionary data is preloaded to RAM; searchd resumes serving queries from new index. However, if there's a lot of attribute or dictionary data, then preloading step could take noticeble time - up to several minutes in case of preloading 1-5+ GB files. With seamless rotate enabled, rotation works as follows: new index RAM storage is allocated; new index attribute and dictionary data is asynchronously preloaded to RAM; on success, old index is deallocated and both indexes' files are renamed; on failure, new index is deallocated; at any given moment, queries are served either from old or new index copy. Seamless rotate comes at the cost of higher peak memory usage during the rotation (because both old and new copies of .spa/.spi/.spm data need to be in RAM while preloading new copy). Average usage stays the same. Example: seamless_rotate = 1 preopen_indexes Whether to forcibly preopen all indexes on startup. Optional, default is 1 (preopen everything). Starting with 2.0.1-beta, the default value for this option is now 1 (foribly preopen all indexes). In prior versions, it used to be 0 (use per-index settings). When set to 1, this directive overrides and enforces preopen on all indexes. They will be preopened, no matter what is the per-index preopen setting. When set to 0, per-index settings can take effect. (And they default to 0.) Pre-opened indexes avoid races between search queries and rotations that can cause queries to fail occasionally. They also make searchd use more file handles. In most scenarios it's therefore preferred and recommended to preopen indexes. Example: preopen_indexes = 1 unlink_old Whether to unlink .old index copies on succesful rotation. Optional, default is 1 (do unlink). Example: unlink_old = 0 attr_flush_period When calling UpdateAttributes() to update document attributes in real-time, changes are first written to the in-memory copy of attributes ( must be set to ). Then, once searchd shuts down normally (via SIGTERM being sent), the changes are written to disk. Introduced in version 0.9.9-rc1. Starting with 0.9.9-rc1, it is possible to tell searchd to periodically write these changes back to disk, to avoid them being lost. The time between those intervals is set with , in seconds. It defaults to 0, which disables the periodic flushing, but flushing will still occur at normal shut-down. Example: attr_flush_period = 900 # persist updates to disk every 15 minutes ondisk_dict_default Instance-wide defaults for ondisk_dict directive. Optional, default it 0 (precache dictionaries in RAM). Introduced in version 0.9.9-rc1. This directive lets you specify the default value of ondisk_dict for all the indexes served by this copy of searchd. Per-index directive take precedence, and will overwrite this instance-wide default value, allowing for fine-grain control. Example: ondisk_dict_default = 1 # keep all dictionaries on disk max_packet_size Maximum allowed network packet size. Limits both query packets from clients, and response packets from remote agents in distributed environment. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 8M. Introduced in version 0.9.9-rc1. Example: max_packet_size = 32M mva_updates_pool Shared pool size for in-memory MVA updates storage. Optional, default size is 1M. Introduced in version 0.9.9-rc1. This setting controls the size of the shared storage pool for updated MVA values. Specifying 0 for the size disable MVA updates at all. Once the pool size limit is hit, MVA update attempts will result in an error. However, updates on regular (scalar) attributes will still work. Due to internal technical difficulties, currently it is not possible to store (flush) any updates on indexes where MVA were updated; though this might be implemented in the future. In the meantime, MVA updates are intended to be used as a measure to quickly catchup with latest changes in the database until the next index rebuild; not as a persistent storage mechanism. Example: mva_updates_pool = 16M crash_log_path Deprecated debugging setting, path (formally prefix) for crash log files. Introduced in version 0.9.9-rc1. Deprecated in version 2.0.1-beta, as crash debugging information now gets logged into searchd.log in text form, and separate binary crash logs are no longer needed. max_filters Maximum allowed per-query filter count. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 256. Introduced in version 0.9.9-rc1. Example: max_filters = 1024 max_filter_values Maximum allowed per-filter values count. Only used for internal sanity checks, does not directly affect RAM use or performance. Optional, default is 4096. Introduced in version 0.9.9-rc1. Example: max_filter_values = 16384 listen_backlog TCP listen backlog. Optional, default is 5. Windows builds currently (as of 0.9.9) can only process the requests one by one. Concurrent requests will be enqueued by the TCP stack on OS level, and requests that can not be enqueued will immediately fail with "connection refused" message. listen_backlog directive controls the length of the connection queue. Non-Windows builds should work fine with the default value. Example: listen_backlog = 20 read_buffer Per-keyword read buffer size. Optional, default is 256K. For every keyword occurrence in every search query, there are two associated read buffers (one for document list and one for hit list). This setting lets you control their sizes, increasing per-query RAM use, but possibly decreasing IO time. Example: read_buffer = 1M read_unhinted Unhinted read size. Optional, default is 32K. When querying, some reads know in advance exactly how much data is there to be read, but some currently do not. Most prominently, hit list size in not currently known in advance. This setting lest you control how much data to read in such cases. It will impact hit list IO time, reducing it for lists larger than unhinted read size, but raising it for smaller lists. It will not affect RAM use because read buffer will be already allocated. So it should be not greater than read_buffer. Example: read_unhinted = 32K max_batch_queries Limits the amount of queries per batch. Optional, default is 32. Makes searchd perform a sanity check of the amount of the queries submitted in a single batch when using multi-queries. Set it to 0 to skip the check. Example: max_batch_queries = 256 subtree_docs_cache Max common subtree document cache size, per-query. Optional, default is 0 (disabled). Limits RAM usage of a common subtree optimizer (see ). At most this much RAM will be spent to cache document entries per each query. Setting the limit to 0 disables the optimizer. Example: subtree_docs_cache = 8M subtree_hits_cache Max common subtree hit cache size, per-query. Optional, default is 0 (disabled). Limits RAM usage of a common subtree optimizer (see ). At most this much RAM will be spent to cache keyword occurrences (hits) per each query. Setting the limit to 0 disables the optimizer. Example: subtree_hits_cache = 16M workers Multi-processing mode (MPM). Optional; allowed values are none, fork, prefork, and threads. Default is fork on Unix based systems, and threads on Windows. Introduced in version 1.10-beta. Lets you choose how searchd processes multiple concurrent requests. The possible values are: none All requests will be handled serially, one-by-one. Prior to 1.x, this was the only mode available on Windows. fork A new child process will be forked to handle every incoming request. Historically, this is the default mode. prefork On startup, searchd will pre-fork a number of worker processes, and pass the incoming requests to one of those children. threads A new thread will be created to handle every incoming request. This is the only mode compatible with RT indexing backend. Historically, searchd used fork-based model, which generally performs OK but spends a noticeable amount of CPU in fork() system call when there's a high amount of (tiny) requests per second. Prefork mode was implemented to alleviate that; with prefork, worker processes are basically only created on startup and re-created on index rotation, somewhat reducing fork() call pressure. Threads mode was implemented along with RT backend and is required to use RT indexes. (Regular disk-based indexes work in all the available modes.) Example: workers = threads dist_threads Max local worker threads to use for parallelizable requests (searching a distributed index; building a batch of snippets). Optional, default is 0, which means to disable in-request parallelism. Introduced in version 1.10-beta. Distributed index can include several local indexes. lets you easily utilize multiple CPUs/cores for that (previously existing alternative was to specify the indexes as remote agents, pointing searchd to itself and paying some network overheads). When set to a value N greater than 1, this directive will create up to N threads for every query, and schedule the specific searches within these threads. For example, if there are 7 local indexes to search and dist_threads is set to 2, then 2 parallel threads would be created: one that sequentially searches 4 indexes, and another one that searches the other 3 indexes. In case of CPU bound workload, setting to 1x the number of cores is advised (creating more threads than cores will not improve query time). In case of mixed CPU/disk bound workload it might sometimes make sense to use more (so that all cores could be utilizes even when there are threads that wait for I/O completion). Note that does not require threads MPM. You can perfectly use it with fork or prefork MPMs too. Starting with version 2.0.1-beta, building a batch of snippets with flag enabled can also be parallelized. Up to threads are be created to process those files. That speeds up snippet extraction when the total amount of document data to process is significant (hundreds of megabytes). Example: index dist_test { type = distributed local = chunk1 local = chunk2 local = chunk3 local = chunk4 } # ... dist_threads = 4 binlog_path Binary log (aka transaction log) files path. Optional, default is build-time configured data directory. Introduced in version 1.10-beta. Binary logs are used for crash recovery of RT index data that would otherwise only be stored in RAM. When logging is enabled, every transaction COMMIT-ted into RT index gets written into a log file. Logs are then automatically replayed on startup after an unclean shutdown, recovering the logged changes. directive specifies the binary log files location. It should contain just the path; will create and unlink multiple binlog.* files in that path as necessary (binlog data, metadata, and lock files, etc). Empty value disables binary logging. That improves performance, but puts RT index data at risk. Example: binlog_path = # disable logging binlog_path = /var/data # /var/data/binlog.001 etc will be created binlog_flush Binary log transaction flush/sync mode. Optional, default is 2 (flush every transaction, sync every second). Introduced in version 1.10-beta. This directive controls how frequently will binary log be flushed to OS and synced to disk. Three modes are supported: 0, flush and sync every second. Best performance, but up to 1 second worth of committed transactions can be lost both on daemon crash, or OS/hardware crash. 1, flush and sync every transaction. Worst performance, but every committed transaction data is guaranteed to be saved. 2, flush every transaction, sync every second. Good performance, and every committed transaction is guaranteed to be saved in case of daemon crash. However, in case of OS/hardware crash up to 1 second worth of committed transactions can be lost. For those familiar with MySQL and InnoDB, this directive is entirely similar to . In most cases, the default hybrid mode 2 provides a nice balance of speed and safety, with full RT index data protection against daemon crashes, and some protection against hardware ones. Example: binlog_flush = 1 # ultimate safety, low speed binlog_max_log_size Maximum binary log file size. Optional, default is 0 (do not reopen binlog file based on size). Introduced in version 1.10-beta. A new binlog file will be forcibly opened once the current binlog file reaches this limit. This achieves a finer granularity of logs and can yield more efficient binlog disk usage under certain borderline workloads. Example: binlog_max_log_size = 16M collation_server Default server collation. Optional, default is libc_ci. Introduced in version 2.0.1-beta. Specifies the default collation used for incoming requests. The collation can be overridden on a per-query basis. Refer to section for the list of available collations and other details. Example: collation_server = utf8_ci collation_libc_locale Server libc locale. Optional, default is C. Introduced in version 2.0.1-beta. Specifies the libc locale, affecting the libc-based collations. Refer to section for the details. Example: collation_libc_locale = fr_FR plugin_dir Trusted location for the dynamic libraries (UDFs). Optional, default is empty (no location). Introduced in version 2.0.1-beta. Specifies the trusted directory from which the UDF libraries can be loaded. Requires workers = thread to take effect. Example: workers = threads plugin_dir = /usr/local/sphinx/lib mysql_version_string A server version string to return via MySQL protocol. Optional, default is empty (return Sphinx version). Introduced in version 2.0.1-beta. Several picky MySQL client libraries depend on a particular version number format used by MySQL, and moreover, sometimes choose a different execution path based on the reported version number (rather than the indicated capabilities flags). For instance, Python MySQLdb 1.2.2 throws an exception when the version number is not in X.Y.ZZ format; MySQL .NET connector 6.3.x fails internally on version numbers 1.x along with a certain combination of flags, etc. To workaround that, you can use directive and have searchd report a different version to clients connecting over MySQL protocol. (By default, it reports its own version.) Example: mysql_version_string = 5.0.37 rt_flush_period RT indexes RAM chunk flush check period, in seconds. Optional, default is 0 (do not flush). Introduced in version 2.0.1-beta. Actively updated RT indexes that however fully fit in RAM chunks can result in ever-growing binlogs, impacting disk use and crash recovery time. With this directive the search daemon performs periodic flush checks, and eligible RAM chunks can get saved, enabling consequential binlog cleanup. See for more details. Example: rt_flush_period = 3600 thread_stack Per-thread stack size. Optional, default is 64K. Introduced in version 2.0.1-beta. In the workers = threads mode, every request is processed with a separate thread that needs its own stack space. By default, 64K per thread are allocated for stack. However, extremely complex search requests might eventually exhaust the default stack and require more. For instance, a query that matches a few thousand keywords (either directly or through term expansion) can eventually run out of stack. Previously, that resulted in crashes. Starting with 2.0.1-beta, searchd attempts to estimate the expected stack use, and blocks the potentially dangerous queries. To process such queries, you can either the thread stack size by using the thread_stack directive (or switch to a different workers setting if that is possible). A query with N levels of nesting is estimated to require approximately 30+0.12*N KB of stack, meaning that the default 64K is enough for queries with upto 300 levels, 150K for upto 1000 levels, etc. If the stack size limit is not met, searchd fails the query and reports the required stack size in the error message. Example: thread_stack = 256K expansion_limit The maximum number of expanded keywords for a single wildcard. Optional, default is 0 (no limit). Introduced in version 2.0.1-beta. When doing substring searches against indexes built with dict = keywords enabled, a single wildcard may potentially result in thousands and even millions of matched keywords (think of matching 'a*' against the entire Oxford dictionary). This directive lets you limit the impact of such expansions. Setting expansion_limit = N restricts expansions to no more than N of the most frequent matching keywords (per each wildcard in the query). Example: expansion_limit = 16 compat_sphinxql_magics Legacy SphinxQL quirks compatiblity mode. Optional, default is 1 (keep compatibility). Introduced in version 2.0.1-beta. Starting with version 2.0.1-beta, we're bringing SphinxQL in closer compliance with standard SQL. However, existing applications must not get broken, and compat_sphinxql_magics lets you upgrade safely. It defauls to 1, which enables the compatibility mode. However, SphinxQL compatibility mode is now deprecated and will be removed once we complete bringing SphinxQL in line with standard SQL syntax. So it's advised to update the applications utilising SphinxQL and then switch the daemon to the new, more SQL compliant mode by setting compat_sphinxql_magics = 0. Please refer to for the details and update instruction. Example: compat_sphinxql_magics = 0 # the future is now watchdog Threaded server watchdog. Optional, default is 1 (watchdog enabled). Introduced in version 2.0.1-beta. A crashed query in threads multi-processing mode (workers = threads) can take down the entire server. With watchdog feature enabled, searchd additionally keeps a separate lightweight process that monitors the main server process, and automatically restarts the latter in case of abnormal termination. Watchdog is enabled by default. Example: watchdog = 0 # disable watchdog Sphinx revision history Version 2.0.1-beta, 22 apr 2011 New general features added remapping support to blend_chars directive added multi-threaded snippet batches support (requires a batch sent via API, dist_threads, and load_files) added collations (collation_server, collation_libc_locale directives) added support for sorting and grouping on string attributes (ORDER BY, GROUP BY, WITHING GROUP ORDER BY) added UDF support (plugin_dir directive; CREATE FUNCTION, DROP FUNCTION statements) added query_log_format directive, SET GLOBAL query_log_format | log_level = ... statements; and connection id tracking added sql_column_buffers directive, fixed out-of-buffer column handling in ODBC/MS SQL sources added blend_mode directive that enables indexing multiple variants of a blended sequence added UNIX socket support to C, Ruby APIs added ranged query support to sql_joined_field added rt_flush_period directive added thread_stack directive added SENTENCE, PARAGRAPH, ZONE operators (and index_sp, index_zones directives) added keywords dictionary support (and dict, expansion_limit directives) added passage_boundary, emit_zones options to snippets added a watchdog process in threaded mode added persistent MVA updates added crash dumps to searchd.log, deprecated crash_log_path directive added id32 index support in id64 binaries (EXPERIMENTAL) added SphinxSE support for DELETE and REPLACE on SphinxQL tables New SphinxQL features added new, more SQL compliant SphinxQL syntax; and a compat_sphinxql_magics directive added CRC32(), DAY(), MONTH(), YEAR(), YEARMONTH(), YEARMONTHDAY() functions added DIV, MOD, and % operators added reverse_scan=(0|1) option to SELECT added support for MySQL packets over 16M added dummy SHOW VARIABLES, SHOW COLLATION, and SET character_set_results support (to support handshake with certain client libraries and frameworks) added mysql_version_string directive (to workaround picky MySQL client libraries) added support for global filter variables, SET GLOBAL @uservar=(int_list) added DELETE ... IN (id_list) syntax support added C-style comments syntax (for example, SELECT /*!40000 some comment*/ id FROM test) added UPDATE ... WHERE id=X syntax support added SphinxQL multi-query support added DESCRIBE, SHOW TABLES statements New command-line switches added --print-queries switch to indexer that dumps SQL queries it runs added --sighup-each switch to indexer that rotates indexes one by one added --strip-path switch to searchd that skips file paths embedded in the index(-es) added --dumpconfig switch to indextool that dumps an index header in sphinx.conf format Major changes and optimizations changed default preopen_indexes value to 1 optimized English stemmer (results in 1.3x faster snippets and indexing with morphology=stem_en) optimized snippets, 1.6x general speedup optimized const-list parsing in SphinxQL optimized full-document highlighting CPU/RAM use optimized binlog replay (improved performance on K-list update) Bug fixes fixed #767, joined fields vs ODBC sources fixed #757, wordforms shared by indexes with different settings fixed #733, loading of indexes in formats prior to v.14 fixed #763, occasional snippets failures fixed #648, occasionally missed rotations on multiple SIGHUPs fixed #750, an RT segment merge leading to false positives and/or crashes in some cases fixed #755, zones in snippets output fixed #754, stopwords counting at snippet passage generation fixed #723, fork/prefork index rotation in children processes fixed #696, freeze on zero threshold in quorum operator fixed #732, query escaping in SphinxSE fixed #739, occasional crashes in MT mode on result set send fixed #746, crash with a named list in SphinxQL option fixed #674, AVG vs group order fixed #734, occasional crashes attempting to report NULL errors fixed #829, tail hits within field position modifier fixed #712, missing query_mode, force_all_words snippet option defaults in Java API fixed #721, added dupe removal on RT batch INSERT/REPLACE fixed #720, potential extraneous highlighting after a blended keyword fixed #702, exceptions vs star search fixed #666, ext2 query grouping vs exceptions fixed #688, WITHIN GROUP ORDER BY related crash fixed #660, multi-queue batches vs dist_threads fixed #678, crash on dict=keywords vs xmlpipe vs min_prefix_len fixed #596, ECHILD vs scripted configs fixed #653, dependency in expression, sorting, grouping fixed #661, concurrent distributed searches vs workers=threads fixed #646, crash on status query via UNIX socket fixed #589, libexpat.dll missing from some Win32 build types fixed #574, quorum match order fixed multiple documentation issues (#372, #483, #495, #601, #623, #632, #654) fixed that ondisk_dict did not affect RT indexes fixed that string attributes check in indextool --check was erroneously sensitive to string data order fixed a rare crash when using BEFORE operator fixed an issue with multiforms vs BuildKeywords() fixed an edge case in OR operator (emitted wrong hits order sometimes) fixed aliasing in docinfo accessors that lead to very rare crashes and/or missing results fixed a syntax error on a short token at the end of a query fixed id64 filtering and performance degradation with range filters fixed missing rankers in libsphinxclient fixed missing SPH04 ranker in SphinxSE fixed column names in sql_attr_multi sample (works with example.sql now) fixed an issue with distributed local+remote setup vs aggregate functions fixed case sensitive columns names in RT indexes fixed a crash vs strings from multiple indexes in result set fixed blended keywords vs snippets fixed secure_connection vs MySQL protocol vs MySQL.NET connector fixed that Python API did not works with Python 2.3 fixed overshort_step vs snippets fixed keyword staistics vs dist_threads searching fixed multiforms vs query parsing (vs quorum) fixed missed quorum words vs RT segments fixed blended keywords occasionally skipping extra character when querying (eg "abc[]") fixed Python API to handle int32 values fixed prefix and infix indexing of joined fields fixed MVA ranged query fixed missing blended state reset on document boundary fixed a crash on missing index while replaying binlog fixed an error message on filter values overrun fixed passage duplication in snippets in weight_order mode fixed select clauses over 1K vs remote agents fixed overshort accounting vs soft-whitespace tokens fixed rotation vs workers=threads fixed schema issues vs distributed indexes fixed blended-escaped sequence parsing issue fixed MySQL IN clause (values order etc) fixed that post_index did not execute when 0 documents were succesfully indexed fixed field position limit vs many hits fixed that joined fields missed an end marker at field end fixed that xxx_step settings were missing from .sph index header fixed libsphinxclient missing request cleanup in sphinx_query() (eg after network errors) fixed that index_weights were ignored when grouping fixed multi wordforms vs blend_chars fixed broken MVA output in SphinxQL fixed a few RT leaks fixed an issue with RT string storage going missing fixed an issue with repeated queries vs dist_threads fixed an issue with string attributes vs buffer overrun in SphinxQL fixed unexpected character data warnings within ignored xmlpipe tags fixed a crash in snippets with NEAR syntax query fixed passage duplication in snippets fixed libsphinxclient SIGPIPE handling fixed libsphinxclient vs VS2003 compiler bug Version 1.10-beta, 19 jul 2010 added RT indexes support () added prefork and threads support (workers directives) added multi-threaded local searches in distributed indexes (dist_threads directive) added common subquery cache (subtree_docs_cache, subtree_hits_cache directives) added string attributes support (sql_attr_string, sql_field_string, xml_attr_string, xml_field_string directives) added indexing-time word counter (sql_attr_str2wordcount, sql_field_str2wordcount directives) added CALL SNIPPETS(), CALL KEYWORDS() SphinxQL statements added , options to SphinxQL SELECT statement added insert-only SphinxQL-talking tables to SphinxSE (connection='sphinxql://host[:port]/index') added option to SphinxSE queries added backtrace on crash to searchd added SQL+FS indexing, aka loading files by names fetched from SQL (sql_file_field directive) added a watchdog in threads mode to searchd added automatic row phantoms elimination to index merge added hitless indexing support (hitless_words directive) added --check, --strip-path, --htmlstrip, --dumphitlist ... --wordid switches to indextool added --stopwait, --logdebug switches to searchd added --dump-rows, --verbose switches to indexer added "blended" characters indexing support (blend_chars directive) added joined/payload field indexing (sql_joined_field directive) added FlushAttributes() API call added query_mode, force_all_words, limit_passages, limit_words, start_passage_id, load_files, html_strip_mode, allow_empty options, and %PASSAGE_ID% macro in before_match, after_match options to BuildExcerpts() API call added @groupby/@count/@distinct columns support to SELECT (but not to expressions) added query-time keyword expansion support (expand_keywords directive, SPH_RANK_SPH04 ranker) added query batch size limit option (max_batch_queries directive; was hardcoded) added SINT() function to expressions improved SphinxQL syntax error reporting improved expression optimizer (better constant handling) improved dash handling within keywords (no longer treated as an operator) improved snippets (better passage selection/trimming, around option now a hard limit) optimized index format that yields ~20-30% smaller indexes optimized sorting code (indexing time 1-5% faster on average; 100x faster in worst case) optimized searchd startup time (moved .spa preindexing to indexer), added a progress bar optimized queries against indexes with many attributes (eliminated redundant copying) optimized 1-keyword queries (performace regression introduced in 0.9.9) optimized SphinxQL protocol overheads, and performance on bigger result sets optimized unbuffered attributes writes on index merge changed attribute handling, duplicate names are strictly forbidden now fixed that SphinxQL sessions could stall shutdown fixed consts with leading minus in SphinxQL fixed AND/OR precedence in expressions fixed #334, AVG() on integers was not computed in floats fixed #371, attribute flush vs 2+ GB files fixed #373, segfault on distributed queries vs certain libc versions fixed #398, stopwords not stopped in prefix/infix indexes fixed #404, erroneous MVA failures in indextool --check fixed #408, segfault on certain query batches (regular scan, plus a scan with MVA groupby) fixed #431, occasional shutdown hangs in preforked workers fixed #436, trunk checkout builds vs Solaris sh fixed #440, escaping vs parentheses declared as valid in charset_table fixed #442, occasional non-aligned free in MVA indexing fixed #447, occasional crashes in MVA indexing fixed #449, pconn busyloop on aborted clients on certain arches fixed #465, build issue on Alpha fixed #468, build issue in libsphinxclient fixed #472, multiple stopword files failing to load fixed #489, buffer overflow in query logging fixed #493, Python API assertion after error returned from Query() fixed #500, malformed MySQL packet when sending MVAs fixed #504, SIGPIPE in libsphinxclient fixed #506, better MySQL protocol commands support in SphinxQL (PING etc) fixed #509, indexing ranged results from stored procedures Version 0.9.9-release, 02 dec 2009 added Open, Close, Status calls to libsphinxclient (C API) added automatic persistent connection reopening to PHP, Python APIs added 64-bit value/range filters, fullscan mode support to SphinxSE MAJOR CHANGE, our IANA assigned ports are 9312 and 9306 respectively (goodbye, trusty 3312) MAJOR CHANGE, erroneous filters now fail with an error (were silently ignored before) optimized unbuffered .spa writes on merge optimized 1-keyword queries ranking in extended2 mode fixed #441 (IO race in case of highly conccurent load on a preopened) fixed #434 (distrubuted indexes were not searchable via MySQL protocol) fixed #317 (indexer MVA progress counter) fixed #398 (stopwords not removed from search query) fixed #328 (broken cutoff) fixed #250 (now quoting paths w/spaces when installing Windows service) fixed #348 (K-list was not updated on merge) fixed #357 (destination index were not K-list-filtered on merge) fixed #369 (precaching .spi files over 2 GBs) fixed #438 (missing boundary proximity matches) fixed #371 (.spa flush in case of files over 2 GBs) fixed #373 (crashes on distributed queries via mysql proto) fixed critical bugs in hit merging code fixed #424 (ordinals could be misplaced during indexing in case of bitfields etc) fixed #426 (failing SE build on Solaris; thanks to Ben Beecher) fixed #423 (typo in SE caused crash on SHOW STATUS) fixed #363 (handling of read_timeout over 2147 seconds) fixed #376 (minor error message mismatch) fixed #413 (minus in SphinxQL) fixed #417 (floats w/o leading digit in SphinxQL) fixed #403 (typo in SetFieldWeights name in Java API) fixed index rotation vs persistent connections fixed backslash handling in SphinxQL parser fixed uint unpacking vs. PHP 5.2.9 (possibly other versions) fixed #325 (filter settings send from SphinxSE) fixed #352 (removed mysql wrapper around close() in SphinxSE) fixed #389 (display error messages through SphinxSE status variable) fixed linking with port-installed iconv on OS X fixed negative 64-bit unpacking in PHP API fixed #349 (escaping backslash in query emulation mode) fixed #320 (disabled multi-query route when select items differ) fixed #353 (better quorum counts check) fixed #341 (merging of trailing hits; maybe other ranking issues too) fixed #368 (partially; @field "" caused crashes; now resets field limit) fixed #365 (field mask was leaking on field-limited terms) fixed #339 (updated debug query dumper) fixed #361 (added SetConnectTimeout() to Java API) fixed #338 (added missing fullscan to mode check in Java API) fixed #323 (added floats support to SphinxQL) fixed #340 (support listen=port:proto syntax too) fixed #332 (\r is legal SphinxQL space now) fixed xmlpipe2 K-lists fixed #322 (safety gaps in mysql protocol row buffer) fixed #313 (return keyword stats for empty indexes too) fixed #344 (invalid checkpoints after merge) fixed #326 (missing CLOCK_xxx on FreeBSD) Version 0.9.9-rc2, 08 apr 2009 added IsConnectError(), Open(), Close() calls to Java API (bug #240) added read_buffer, read_unhinted directives added checks for build options returned by mysql_config (builds on Solaris now) added fixed-RAM index merge (bug #169) added logging chained queries count in case of (optimized) multi-queries added GEODIST() function added --status switch to searchd added MySpell (OpenOffice) affix file support (bug #281) added ODBC support (both Windows and UnixODBC) added support for @id in IN() (bug #292) added support for aggregate functions in GROUP BY (namely AVG, MAX, MIN, SUM) added MySQL UDF that builds snippets using searchd added write_buffer directive (defaults to 1M) added xmlpipe_fixup_utf8 directive added suggestions sample added microsecond precision int64 timer (bug #282) added listen_backlog directive added max_xmlpipe2_field directive added initial SphinxQL support to mysql41 handler, SELECT .../SHOW WARNINGS/STATUS/META are handled added support for different network protocols, and mysql41 protocol added fieldmask ranker, updated SphinxSE list of rankers added mysql_ssl_xxx directives added --cpustats (requires clock_gettime()) and --status switches to searchd added performance counters, Status() API call added overshort_step and stopword_step directives added strict order operator (aka operator before, eg. "one << two << three") added indextool utility, moved --dumpheader there, added --debugdocids, --dumphitlist options added own RNG, reseeded on @random sort query (bug #183) added field-start and field-end modifiers support (syntax is "^hello world$"; field-end requires reindex) added MVA attribute support to IN() function added AND, OR, and NOT support to expressions improved logging of (optimized) multi-queries (now logging chained query count) improved handshake error handling, fixed protocol version byte order (omg) updated SphinxSE to protocol 1.22 allowed phrase_boundary_step=-1 (trick to emulate keyword expansion) removed SPH_MAX_QUERY_WORDS limit fixed CLI search vs documents missing from DB (bug #257) fixed libsphinxclient results leak on subsequent sphinx_run_queries call (bug #256) fixed libsphinxclient handling of zero max_matches and cutoff (bug #208) fixed Java API over-64K string reads (eg. big snippets) in Java API (bug #181) fixed Java API 2nd Query() after network error in 1st Query() call (bug #308) fixed typo-class bugs in SetFilterFloatRange (bug #259), SetSortMode (bug #248) fixed missing @@relaxed support (bug #276), fixed missing error on @nosuchfield queries, documented @@relaxed fixed UNIX socket permissions to 0777 (bug #288) fixed xmlpipe2 crash on schemas with no fields, added better document structure checks fixed (and optimized) expr parser vs IN() with huge (10K+) args count fixed double EarlyCalc() in fullscan mode (minor performance impact) fixed phrase boundary handling in some cases (on buffer end, on trailing whitespace) fixes in snippets (aka excerpts) generation fixed inline attrs vs id64 index corruption fixed head searchd crash on config re-parse failure fixed handling of numeric keywords with leading zeroes such as "007" (bug #251) fixed junk in SphinxSE status variables (bug #304) fixed wordlist checkpoints serialization (bug #236) fixed unaligned docinfo id access (bug #230) fixed GetRawBytes() vs oversized blocks (headers with over 32K charset_table should now work, bug #300) fixed buffer overflow caused by too long dest wordform, updated tests fixed IF() return type (was always int, is deduced now) fixed legacy queries vs. special chars vs. multiple indexes fixed write-write-read socket access pattern vs Nagle vs delays vs FreeBSD (oh wow) fixed exceptions vs query-parser issue fixed late calc vs @weight in expressions (bug #285) fixed early lookup/calc vs filters (bug #284) fixed emulated MATCH_ANY queries (empty proximity and phrase queries are allowed now) fixed MATCH_ANY ranker vs fields with no matches fixed index file size vs inplace_enable (bug #245) fixed that old logs were not closed on USR1 (bug #221) fixed handling of '!' alias to NOT operator (bug #237) fixed error handling vs query steps (step failure was not reported) fixed querying vs inline attributes fixed stupid bug in escaping code, fixed EscapeString() and made it static fixed parser vs @field -keyword, foo|@field bar, "" queries (bug #310) Version 0.9.9-rc1, 17 nov 2008 added min_stemming_len directive added IsConnectError() API call (helps distingusih API vs remote errors) added duplicate log messages filter to searchd added --nodetach debugging switch to searchd added blackhole agents support for debugging/testing (agent_blackhole directive) added max_filters, max_filter_values directives (were hardcoded before) added int64 expression evaluation path, automatic inference, and BIGINT() enforcer function added crash handler for debugging (crash_log_path directive) added MS SQL (aka SQL Server) source support (Windows only, mssql_winauth and mssql_unicode directives) added indexer-side column unpacking feature (unpack_zlib, unpack_mysqlcompress directives) added nested brackers and NOTs support to query language, rewritten query parser added persistent connections support (Open() and Close() API calls) added index_exact_words feature, and exact form operator to query language ("hello =world") added status variables support to SphinxSE (SHOW STATUS LIKE 'sphinx_%') added max_packet_size directive (was hardcoded at 8M before) added UNIX socket support, and multi-interface support (listen directive) added star-syntax support to BuildExcerpts() API call added inplace inversion of .spa and .spp (inplace_enable directive, 1.5-2x less disk space for indexing) added builtin Czech stemmer (morphology=stem_cz) added IDIV(), NOW(), INTERVAL(), IN() functions to expressions added index-level early-reject based on filters added MVA updates feature (mva_updates_pool directive) added select-list feature with computed expressions support (see SetSelect() API call, test.php --select switch), protocol 1.22 added integer expressions support (2x faster than float) added multiforms support (multiple source words in wordforms file) added legacy rankers (MATCH_ALL/MATCH_ANY/etc), removed legacy matching code (everything runs on V2 engine now) added field position limit modifier to field operator (syntax: @title[50] hello world) added killlist support (sql_query_killlist directive, --merge-killlists switch) added on-disk SPI support (ondisk_dict directive) added indexer IO stats added periodic .spa flush (attr_flush_period directive) added config reload on SIGHUP added per-query attribute overrides feature (see SetOverride() API call); protocol 1.21 added signed 64bit attrs support (sql_attr_bigint directive) improved HTML stripper to also skip PIs (<? ... ?>, such as <?php ... ?>) improved excerpts speed (upto 50x faster on big documents) fixed a short window of searchd inaccessibility on startup (started listen()ing too early before) fixed .spa loading on systems where read() is 2GB capped fixed infixes vs morphology issues fixed backslash escaping, added backslash to EscapeString() fixed handling of over-2GB dictionary files (.spi) Version 0.9.8.1, 30 oct 2008 added configure script to libsphinxclient changed proximity/quorum operator syntax to require whitespace after length fixed potential head process crash on SIGPIPE during "maxed out" message fixed handling of incomplete remote replies (caused over-degraded distributed results, in rare cases) fixed sending of big remote requests (caused distributed requests to fail, in rare cases) fixed FD_SET() overflow (caused searchd to crash on startup, in rare cases) fixed MVA vs distributed indexes (caused loss of 1st MVA value in result set) fixed tokenizing of exceptions terminated by specials (eg. "GPS AT&T" in extended mode) fixed buffer overrun in stemmer on overlong tokens occasionally emitted by proximity/quorum operator parser (caused crashes on certain proximity/quorum queries) fixed wordcount ranker (could be dropping hits) fixed --merge feature (numerous different fixes, caused broken indexes) fixed --merge-dst-range performance fixed prefix/infix generation for stopwords fixed ignore_chars vs specials fixed misplaced F_SETLKW check (caused certain build types, eg. RPM build on FC8, to fail) fixed dictionary-defined charsets support in spelldump, added \x-style wordchars support fixed Java API to properly send long strings (over 64K; eg. long document bodies for excerpts) fixed Python API to accept offset/limit of 'long' type fixed default ID range (that filtered out all 64-bit values) in Java and Python APIs Version 0.9.8, 14 jul 2008 Indexing added support for 64-bit document and keyword IDs, --enable-id64 switch to configure added support for floating point attributes added support for bitfields in attributes, sql_attr_bool directive and bit-widths part in sql_attr_uint directive added support for multi-valued attributes (MVA) added metaphone preprocessor added libstemmer library support, provides stemmers for a number of additional languages added xmlpipe2 source type, that supports arbitrary fields and attributes added word form dictionaries, wordforms directive (and spelldump utility) added tokenizing exceptions, exceptions directive added an option to fully remove element contents to HTML stripper, html_remove_elements directive added HTML entities decoder (with full XHTML1 set support) to HTML stripper added per-index HTML stripping settings, html_strip, html_index_attrs, and html_remove_elements directives added IO load throttling, max_iops and max_iosize directives added SQL load throttling, sql_ranged_throttle directive added an option to index prefixes/infixes for given fields only, prefix_fields and infix_fields directives added an option to ignore certain characters (instead of just treating them as whitespace), ignore_chars directive added an option to increment word position on phrase boundary characters, phrase_boundary and phrase_boundary_step directives added --merge-dst-range switch (and filters) to index merging feature (--merge switch) added mysql_connect_flags directive (eg. to reduce indexing time MySQL network traffic and/or time) improved ordinals sorting; now runs in fixed RAM improved handling of documents with zero/NULL ids, now skipping them instead of aborting Search daemon added an option to unlink old index on succesful rotation, unlink_old directive added an option to keep index files open at all times (fixes subtle races on rotation), preopen and preopen_indexes directives added an option to profile searchd disk I/O, --iostats command-line option added an option to rotate index seamlessly (fully avoids query stalls), seamless_rotate directive added HTML stripping support to excerpts (uses per-index settings) added 'exact_phrase', 'single_passage', 'use_boundaries', 'weight_order 'options to BuildExcerpts() API call added distributed attribute updates propagation added distributed retries on master node side added log reopen on SIGUSR1 added --stop switch (sends SIGTERM to running instance) added Windows service mode, and --servicename switch added Windows --rotate support improved log timestamping, now with millisecond precision Querying added extended engine V2 (faster, cleaner, better; SPH_MATCH_EXTENDED2 mode) added ranking modes support (V2 engine only; SetRankingMode() API call) added quorum searching support to query language (V2 engine only; example: "any three of all these words"/3) added query escaping support to query language, and EscapeString() API call added multi-field syntax support to query language (example: "@(field1,field2) something"), and @@relaxed field checks option added optional star-syntax ('word*') support in keywords, enable_star directive (for prefix/infix indexes only) added full-scan support (query must be fully empty; can perform block-reject optimization) added COUNT(DISTINCT(attr)) calculation support, SetGroupDistinct() API call added group-by on MVA support, SetArrayResult() PHP API call added per-index weights feature, SetIndexWeights() API call added geodistance support, SetGeoAnchor() API call added result set sorting by arbitrary expressions in run time (eg. "@weight+log(price)*2.5"), SPH_SORT_EXPR mode added result set sorting by @custom compile-time sorting function (see src/sphinxcustomsort.inl) added result set sorting by @random value added result set merging for indexes with different schemas added query comments support (3rd arg to Query()/AddQuery() API calls, copied verbatim to query log) added keyword extraction support, BuildKeywords() API call added binding field weights by name, SetFieldWeights() API call added optional limit on query time, SetMaxQueryTime() API call added optional limit on found matches count (4rd arg to SetLimits() API call, so-called 'cutoff') APIs and SphinxSE added pure C API (libsphinxclient) added Ruby API (thanks to Dmytro Shteflyuk) added Java API added SphinxSE support for MVAs (use varchar), floats (use float), 64bit docids (use bigint) added SphinxSE options "floatrange", "geoanchor", "fieldweights", "indexweights", "maxquerytime", "comment", "host" and "port"; and support for "expr:CLAUSE" improved SphinxSE max query size (using MySQL condition pushdown), upto 256K now General added scripting (shebang syntax) support to config files (example: #!/usr/bin/php in the first line) added unified config handling and validation to all programs added unified documentation added .spec file for RPM builds added automated testing suite improved index locking, now fcntl()-based instead of buggy file-existence-based fixed unaligned RAM accesses, now works on SPARC and ARM Changes and fixes since 0.9.8-rc2 added pure C API (libsphinxclient) added Ruby API added SetConnectTimeout() PHP API call added allowed type check to UpdateAttributes() handler (bug #174) added defensive MVA checks on index preload (protection against broken indexes, bug #168) added sphinx-min.conf sample file added --without-iconv switch to configure removed redundant -lz dependency in searchd removed erroneous "xmlpipe2 deprecated" warning fixed EINTR handling in piped read (bug #166) fixup query time before logging and sending to client (bug #153) fixed attribute updates vs full-scan early-reject index (bug #149) fixed gcc warnings (bug #160) fixed mysql connection attempt vs pgsql source type (bug #165) fixed 32-bit wraparound when preloading over 2 GB files fixed "out of memory" message vs over 2 GB allocs (bug #116) fixed unaligned RAM access detection on ARM (where unaligned reads do not crash but produce wrong results) fixed missing full scan results in some cases fixed several bugs in --merge, --merge-dst-range fixed @geodist vs MultiQuery and filters, @expr vs MultiQuery fixed GetTokenEnd() vs 1-grams (was causing crash in excerpts) fixed sql_query_range to handle empty strings in addition to NULL strings (Postgres specific) fixed morphology=none vs infixes fixed case sensitive attributes names in UpdateAttributes() fixed ext2 ranking vs. stopwords (now using atompos from query parser) fixed EscapeString() call fixed escaped specials (now handled as whitespace if not in charset) fixed schema minimizer (now handles type/size mismatches) fixed word stats in extended2; stemmed form is now returned fixed spelldump case folding vs dictionary-defined character sets fixed Postgres BOOLEAN handling fixed enforced "inline" docinfo on empty indexes (normally ok, but index merge was really confused) fixed rare count(distinct) out-of-bounds issue (it occasionaly caused too high @distinct values) fixed hangups on documents with id=DOCID_MAX in some cases fixed rare crash in tokenizer (prefixed synonym vs. input stream eof) fixed query parser vs "aaa (bbb ccc)|ddd" queries fixed BuildExcerpts() request in Java API fixed Postgres specific memory leak fixed handling of overshort keywords (less than min_word_len) fixed HTML stripper (now emits space after indexed attributes) fixed 32-field case in query parser fixed rare count(distinct) vs. querying multiple local indexes vs. reusable sorter issue fixed sorting of negative floats in SPH_SORT_EXTENDED mode Version 0.9.7, 02 apr 2007 added support for added support for upto 5 sort-by attrs (in extended sorting mode) added support for separate groups sorting clause (in group-by mode) added support for on-the-fly attribute updates (PRE-ALPHA; will change heavily; use for preliminary testing ONLY) added support for zero/NULL attributes added support for 0.9.7 features to SphinxSE added support for n-grams (alpha, 1-grams only for now) added support for warnings reported to client added support for exclude-filters added support for prefix and infix indexing (see , ) added syntax to reset current field to query language added removal of duplicate entries in query index order added PHP API workarounds for PHP signed/unsigned braindamage added locks to avoid two concurrent indexers working on same index added check for existing attributes vs. case improved groupby code a lot (better precision, and upto 25x times faster in extreme cases) improved error handling and reporting improved handling of broken indexes (reports error instead of hanging/crashing) improved limits for attributes and wordlists (now able to map over 4 GB on x64 and over 2 GB on x32 where possible) improved pressure in head daemon (search time should not degrade with time any more) improved test.php command line options improved error reporting (distributed query, broken index etc issues now reported to client) changed default network packet size to be 8M, added extra checks fixed division by zero in BM25 on 1-document collections (in extended matching mode) fixed .spl files getting unlinked fixed crash in schema compatibility test fixed UTF-8 Russian stemmer fixed requested matches count when querying distributed agents fixed signed vs. unsigned issues everywhere (ranged queries, CLI search output, and obtaining docid) fixed potential crashes vs. negative query offsets fixed 0-match docs vs. extended mode vs. stats fixed group/timestamp filters being ignored if querying from older clients fixed docs to mention source type fixed issues with explicit '&' in extended matching mode fixed wrong assertion in SBCS encoder fixed crashes with no-attribute indexes after rotate Version 0.9.7-rc2, 15 dec 2006 added support for extended matching mode (query language) added support for extended sorting mode (sorting clauses) added support for SBCS excerpts added for attributes and wordlist (improves search time, speeds up greatly) fixed attribute name handling to be case insensitive fixed default compiler options to simplify post-mortem debugging (added , removed ) fixed rare memory leak fixed "hello hello" queries in "match phrase" mode fixed issue with excerpts, texts and overlong queries fixed logging multiple index name (no longer tokenized) fixed trailing stopword not flushed from tokenizer fixed boolean evaluation fixed pidfile being wrongly on failure fixed (they conflicted with well-known paths) fixes for 64-bit platforms Version 0.9.7-rc1, 26 oct 2006 added alpha index merging code added an option to decrease per-query added an option to specify IP address for searchd to listen on added support for unlimited amount of configured sources and indexes added support for group-by queries added support for /2 range modifier in charset_table added support for arbitrary amount of document attributes added logging filter count and index name added option to configure to compile in debug mode added when compiling in default mode improved search time (added doclist size hints, in-memory wordlist cache, and used VLB coding everywhere) improved (refactored) SQL driver code (adding new drivers should be very easy now) improved exceprts generation fixed issue with empty sources and ranged queries fixed querying purely remote distributed indexes fixed suffix length check in English stemmer in some cases fixed UTF-8 decoder for codes over U+20000 (for CJK) fixed UTF-8 encoder for 3-byte sequences (for CJK) fixed overshort (less than ) words prepended to next field fixed source connection order (indexer does not connect to all sources at once now) fixed line numbering in config parser fixed some issues with index rotation Version 0.9.6, 24 jul 2006 added support for empty indexes added support for multiple sql_query_pre/post/post_index fixed timestamp ranges filter in "match any" mode fixed configure issues with --without-mysql and --with-pgsql options fixed building on Solaris 9 Version 0.9.6-rc1, 26 jun 2006 added boolean queries support (experimental, beta version) added simple file-based query cache (experimental, beta version) added storage engine for MySQL 5.0 and 5.1 (experimental, beta version) added GNU style configure script added new searchd protocol (all binary, and should be backwards compatible) added distributed searching support to searchd added PostgreSQL driver added excerpts generation added option to index added option to searchd, removed hardcoded MAX_MATCHES limit added initial documentation, and a working example.sql added support for multiple sources per index added soundex support added group ID ranges support added command-line option to search utility added option to indexer added option to search fixed UTF-8 decoder (3-byte codepoints did not work) fixed PHP API to handle big result sets faster fixed config parser to handle empty values properly fixed redundant time(NULL) calls in time-segments mode coreseek-4.1-beta/csft-4.1/doc/sphinx.xsl100777 0 0 607 11643565731 13251 0 coreseek-4.1-beta/csft-4.1/example.sql100777 0 0 1607 11643565731 12640 0DROP TABLE IF EXISTS test.documents; CREATE TABLE test.documents ( id INTEGER PRIMARY KEY NOT NULL AUTO_INCREMENT, group_id INTEGER NOT NULL, group_id2 INTEGER NOT NULL, date_added DATETIME NOT NULL, title VARCHAR(255) NOT NULL, content TEXT NOT NULL ); REPLACE INTO test.documents ( id, group_id, group_id2, date_added, title, content ) VALUES ( 1, 1, 5, NOW(), 'test one', 'this is my test document number one. also checking search within phrases.' ), ( 2, 1, 6, NOW(), 'test two', 'this is my test document number two' ), ( 3, 2, 7, NOW(), 'another doc', 'this is another group' ), ( 4, 2, 8, NOW(), 'doc number four', 'this is to test groups' ); DROP TABLE IF EXISTS test.tags; CREATE TABLE test.tags ( docid INTEGER NOT NULL, tagid INTEGER NOT NULL, UNIQUE(docid,tagid) ); INSERT INTO test.tags VALUES (1,1), (1,3), (1,5), (1,7), (2,6), (2,4), (2,2), (3,15), (4,7), (4,40); coreseek-4.1-beta/csft-4.1/INSTALL100777 0 0 117 11643565730 11467 0Please refer to <> section in doc/sphinx.txt or doc/sphinx.html. coreseek-4.1-beta/csft-4.1/libexpat/ 40777 0 0 0 11647303463 12164 5coreseek-4.1-beta/csft-4.1/libexpat/libexpat.sln100777 0 0 1530 11643565731 14615 0Microsoft Visual Studio Solution File, Format Version 9.00 # Visual Studio 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libexpat", "libexpat.vcproj", "{7010C937-28B3-46A2-903C-BEBA2F5EAE4D}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {7010C937-28B3-46A2-903C-BEBA2F5EAE4D}.Debug|Win32.ActiveCfg = Debug|Win32 {7010C937-28B3-46A2-903C-BEBA2F5EAE4D}.Debug|Win32.Build.0 = Debug|Win32 {7010C937-28B3-46A2-903C-BEBA2F5EAE4D}.Release|Win32.ActiveCfg = Release|Win32 {7010C937-28B3-46A2-903C-BEBA2F5EAE4D}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal coreseek-4.1-beta/csft-4.1/libexpat/libexpat.vcproj100777 0 0 7156 11643565731 15336 0 coreseek-4.1-beta/csft-4.1/libstemmer_c/ 40777 0 0 0 11647303464 13022 5coreseek-4.1-beta/csft-4.1/libstemmer_c/libstemmer_c.sln100777 0 0 1540 11643565731 16310 0Microsoft Visual Studio Solution File, Format Version 9.00 # Visual Studio 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libstemmer_c", "libstemmer_c.vcproj", "{0F64D11C-6E40-4F63-8B7F-E5B615D38301}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {0F64D11C-6E40-4F63-8B7F-E5B615D38301}.Debug|Win32.ActiveCfg = Debug|Win32 {0F64D11C-6E40-4F63-8B7F-E5B615D38301}.Debug|Win32.Build.0 = Debug|Win32 {0F64D11C-6E40-4F63-8B7F-E5B615D38301}.Release|Win32.ActiveCfg = Release|Win32 {0F64D11C-6E40-4F63-8B7F-E5B615D38301}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal coreseek-4.1-beta/csft-4.1/libstemmer_c/libstemmer_c.vcproj100777 0 0 13724 11643565731 17046 0 coreseek-4.1-beta/csft-4.1/libstemmer_c/Makefile.am100777 0 0 244 11643565731 15141 0if USE_LIBSTEMMER noinst_LIBRARIES = libstemmer.a include $(srcdir)/mkinc.mak noinst_HEADERS = $(snowball_headers) libstemmer_a_SOURCES = $(snowball_sources) endif coreseek-4.1-beta/csft-4.1/libstemmer_c/mkinc.mak100777 0 0 5067 11643565731 14730 0# libstemmer/mkinc.mak: List of stemming module source files # # This file is generated by mkmodules.pl from a list of module names. # Do not edit manually. # # Modules included by this file are: danish, dutch, english, finnish, french, # german, hungarian, italian, norwegian, porter, portuguese, romanian, # russian, spanish, swedish, turkish snowball_sources= \ src_c/stem_ISO_8859_1_danish.c \ src_c/stem_UTF_8_danish.c \ src_c/stem_ISO_8859_1_dutch.c \ src_c/stem_UTF_8_dutch.c \ src_c/stem_ISO_8859_1_english.c \ src_c/stem_UTF_8_english.c \ src_c/stem_ISO_8859_1_finnish.c \ src_c/stem_UTF_8_finnish.c \ src_c/stem_ISO_8859_1_french.c \ src_c/stem_UTF_8_french.c \ src_c/stem_ISO_8859_1_german.c \ src_c/stem_UTF_8_german.c \ src_c/stem_ISO_8859_1_hungarian.c \ src_c/stem_UTF_8_hungarian.c \ src_c/stem_ISO_8859_1_italian.c \ src_c/stem_UTF_8_italian.c \ src_c/stem_ISO_8859_1_norwegian.c \ src_c/stem_UTF_8_norwegian.c \ src_c/stem_ISO_8859_1_porter.c \ src_c/stem_UTF_8_porter.c \ src_c/stem_ISO_8859_1_portuguese.c \ src_c/stem_UTF_8_portuguese.c \ src_c/stem_ISO_8859_2_romanian.c \ src_c/stem_UTF_8_romanian.c \ src_c/stem_KOI8_R_russian.c \ src_c/stem_UTF_8_russian.c \ src_c/stem_ISO_8859_1_spanish.c \ src_c/stem_UTF_8_spanish.c \ src_c/stem_ISO_8859_1_swedish.c \ src_c/stem_UTF_8_swedish.c \ src_c/stem_UTF_8_turkish.c \ runtime/api.c \ runtime/utilities.c \ libstemmer/libstemmer.c snowball_headers= \ src_c/stem_ISO_8859_1_danish.h \ src_c/stem_UTF_8_danish.h \ src_c/stem_ISO_8859_1_dutch.h \ src_c/stem_UTF_8_dutch.h \ src_c/stem_ISO_8859_1_english.h \ src_c/stem_UTF_8_english.h \ src_c/stem_ISO_8859_1_finnish.h \ src_c/stem_UTF_8_finnish.h \ src_c/stem_ISO_8859_1_french.h \ src_c/stem_UTF_8_french.h \ src_c/stem_ISO_8859_1_german.h \ src_c/stem_UTF_8_german.h \ src_c/stem_ISO_8859_1_hungarian.h \ src_c/stem_UTF_8_hungarian.h \ src_c/stem_ISO_8859_1_italian.h \ src_c/stem_UTF_8_italian.h \ src_c/stem_ISO_8859_1_norwegian.h \ src_c/stem_UTF_8_norwegian.h \ src_c/stem_ISO_8859_1_porter.h \ src_c/stem_UTF_8_porter.h \ src_c/stem_ISO_8859_1_portuguese.h \ src_c/stem_UTF_8_portuguese.h \ src_c/stem_ISO_8859_2_romanian.h \ src_c/stem_UTF_8_romanian.h \ src_c/stem_KOI8_R_russian.h \ src_c/stem_UTF_8_russian.h \ src_c/stem_ISO_8859_1_spanish.h \ src_c/stem_UTF_8_spanish.h \ src_c/stem_ISO_8859_1_swedish.h \ src_c/stem_UTF_8_swedish.h \ src_c/stem_UTF_8_turkish.h \ include/libstemmer.h \ libstemmer/modules.h \ runtime/api.h \ runtime/header.h coreseek-4.1-beta/csft-4.1/libstemmer_c/README100777 0 0 262 11643565731 13765 0Dummy file for automake. Should be overwritten after libstemmer_c.tgz is properly extracted. The latest should be available at http://snowball.tartarus.org/dist/libstemmer_c.tgz coreseek-4.1-beta/csft-4.1/Makefile.am100777 0 0 512 11643565730 12471 0if USE_LIBSTEMMER SUBDIRS = libstemmer_c src test doc else SUBDIRS = src test doc endif EXTRA_DIST = api storage sphinx.conf.in sphinx-min.conf.in example.sql sysconf_DATA = sphinx.conf.dist sphinx-min.conf.dist example.sql install-data-hook: mkdir -p $(DESTDIR)$(localstatedir)/data && mkdir -p $(DESTDIR)$(localstatedir)/log coreseek-4.1-beta/csft-4.1/misc/ 40777 0 0 0 11647303464 11310 5coreseek-4.1-beta/csft-4.1/misc/build.cmd100777 0 0 10216 11643565731 13217 0@echo off set URL=http://sphinxsearch.googlecode.com/svn/trunk set REL=1.11 set PATH=C:\Program Files\Microsoft Visual Studio 8\Common7\IDE;%PATH%; set ICONVROOT=C:\Bin\Iconv set EXPATROOT=C:\Bin\Expat set MYSQLROOT=C:\Program Files\MySQL\MySQL Server 5.0 set PGSQLROOT=C:\Program Files\PostgreSQL\8.3 if "%1" EQU "" ( echo *** FATAL: specify build tag as 1st argument (eg. build.cmd rc2 or build.cmd r2345^). exit ) else ( set TAG=-%1 ) rmdir /s /q sphinxbuild 2>nul mkdir sphinxbuild cd sphinxbuild if %ERRORLEVEL% NEQ 0 ( echo *** FATAL: failed to create build directory. exit ) svn co %URL% checkout if %ERRORLEVEL% NEQ 0 ( echo *** FATAL: checkout error. exit ) call checkout\src\svnxrev.cmd checkout echo #define SPHINX_TAG "%TAG%" >> checkout\src\sphinxversion.h perl -i.bak -p -e "s/(_TAGREV \").*(r\d+\")/\1\2/g;" checkout\src\sphinxversion.h rmdir /s /q checkout\.svn @rem strip "release" tag from zip names if "%1" EQU "release" ( set TAG= ) @rem ========================================== @rem === regular build and common packaging === @rem ========================================== cd checkout devenv sphinx05.sln /Rebuild Release if %ERRORLEVEL% NEQ 0 ( echo *** FATAL: build error. exit ) del /q bin\release\test*.* cd .. mkdir common for %%i in (api doc contrib) do ( svn export checkout\%%i common\%%i ) for %%i in (COPYING INSTALL sphinx.conf.in sphinx-min.conf.in example.sql) do ( copy checkout\%%i common\%%i ) set BASE=sphinx-%REL%%TAG%-win32 mkdir %BASE% mkdir %BASE%\bin copy checkout\bin\release\*.exe %BASE%\bin copy "%ICONVROOT%\bin\iconv.dll" %BASE%\bin copy "%EXPATROOT%\libs\libexpat.dll" %BASE%\bin copy "%MYSQLROOT%\bin\libmysql.dll" %BASE%\bin xcopy /q /s common\* %BASE% pkzip25 -add %BASE%.zip -dir %BASE%\* move %BASE%.zip .. set PDBS=sphinx-%REL%%TAG%-win32-debug mkdir %PDBS% mkdir %PDBS%\regular copy checkout\bin\release\*.pdb %PDBS%\regular @rem =================== @rem === pgsql build === @rem =================== cd checkout perl -i.bak -p -e "s/USE_PGSQL\s+\d/USE_PGSQL 1/g;" src\sphinx.h devenv sphinx05.sln /Rebuild Release if %ERRORLEVEL% NEQ 0 ( echo *** FATAL: build error. exit ) del /q bin\release\test*.* cd .. set BASE=sphinx-%REL%%TAG%-win32-pgsql mkdir %BASE% mkdir %BASE%\bin copy checkout\bin\release\*.exe %BASE%\bin for %%i in (comerr32.dll gssapi32.dll iconv.dll k5sprt32.dll krb5_32.dll libeay32.dll libiconv2.dll libintl3.dll libpq.dll ssleay32.dll) do ( copy "%PGSQLROOT%\bin\%%i" %BASE%\bin ) copy "%EXPATROOT%\libs\libexpat.dll" %BASE%\bin copy "%MYSQLROOT%\bin\libmysql.dll" %BASE%\bin xcopy /q /s common\* %BASE% pkzip25 -add %BASE%.zip -dir %BASE%\* move %BASE%.zip .. mkdir %PDBS%\pgsql copy checkout\bin\release\*.pdb %PDBS%\pgsql @rem ======================= @rem === id64-full build === @rem ======================= cd checkout perl -i.bak -p -e "s/USE_LIBSTEMMER\s+\d/USE_LIBSTEMMER 1/g;" src\sphinx.h perl -i.bak -p -e "s/USE_64BIT\s+\d/USE_64BIT 1/g;" src\sphinx.h wget http://snowball.tartarus.org/dist/libstemmer_c.tgz gunzip libstemmer_c.tgz tar xvf libstemmer_c.tar cd libstemmer_c devenv libstemmer_c.sln /Rebuild Release if %ERRORLEVEL% NEQ 0 ( echo *** FATAL: build error. exit ) cd .. devenv sphinx05.sln /Rebuild Release if %ERRORLEVEL% NEQ 0 ( echo *** FATAL: build error. exit ) del /q bin\release\test*.* cd .. set BASE=sphinx-%REL%%TAG%-win32-id64-full mkdir %BASE% mkdir %BASE%\bin copy checkout\bin\release\*.exe %BASE%\bin for %%i in (comerr32.dll gssapi32.dll iconv.dll k5sprt32.dll krb5_32.dll libeay32.dll libiconv2.dll libintl3.dll libpq.dll ssleay32.dll) do ( copy "%PGSQLROOT%\bin\%%i" %BASE%\bin ) copy "%EXPATROOT%\libs\libexpat.dll" %BASE%\bin copy "%MYSQLROOT%\bin\libmysql.dll" %BASE%\bin xcopy /q /s common\* %BASE% pkzip25 -add %BASE%.zip -dir %BASE%\* move %BASE%.zip .. mkdir %PDBS%\id64full copy checkout\bin\release\*.pdb %PDBS%\id64full @rem ============================= @rem === debug symbols archive === @rem ============================== pkzip25 -add %PDBS%.zip -dir %PDBS%\* move %PDBS%.zip .. coreseek-4.1-beta/csft-4.1/misc/resolve.py100777 0 0 2037 11643565731 13446 0# # $Id$ # import sys, re if len(sys.argv)!=3: print 'Usage: python resolve.py BACKTRACE SYMBOLS' sys.exit(0) def myopen(name): if name == '-': return sys.stdin fh = open(name, 'r') if not fh: print 'FATAL: failed to open %s' % name sys.exit(1) return fh syms = [] fp = myopen(sys.argv[2]) for line in fp.readlines(): line = line.rstrip() match = re.match('([0-9a-fA-F]+) \w ', line) if match: addr = int(match.group(1), 16) name = line[len(match.group(0)):] syms.append([addr, name]) fp.close() fp = myopen(sys.argv[1]) for line in fp.readlines(): line = line.rstrip() # skip plain boring log entries if re.search('^\[\w+\s+\w+\s+\d+\s+\d+:\d+:\d+\.\d+ \d+\] \[\d+\] \S', line): continue # resolve symbols, if any match = re.search('\[0x([0-9a-fA-F]+)\]', line) if match: addr = int(match.group(1), 16) resolved = '???' for i in range(len(syms)-1): if syms[i][0]<=addr and addr dict.sql mysql -u root test < dict.sql indexer --config suggest.conf --all searchd --config suggest.conf php suggest.php --query sphynx --eof-- coreseek-4.1-beta/csft-4.1/misc/suggest/suggest.conf100777 0 0 1267 11643565731 15432 0source suggest { type = mysql sql_host = localhost sql_user = root sql_pass = sql_db = test sql_query_pre = SET NAMES utf8 sql_query = SELECT id, trigrams, freq, LENGTH(keyword) AS len, keyword FROM suggest sql_attr_uint = freq sql_attr_uint = len sql_attr_string = keyword } index suggest { source = suggest path = suggest docinfo = extern charset_type = utf-8 } indexer { mem_limit = 32M } searchd { port = 9312 log = searchd.log query_log = query.log read_timeout = 5 max_children = 30 pid_file = searchd.pid max_matches = 1000 seamless_rotate = 1 preopen_indexes = 0 unlink_old = 1 } coreseek-4.1-beta/csft-4.1/misc/suggest/suggest.php100777 0 0 6706 11643565732 15300 0SetMatchMode ( SPH_MATCH_EXTENDED2 ); $cl->SetRankingMode ( SPH_RANK_WORDCOUNT ); $cl->SetFilterRange ( "len", $len-$delta, $len+$delta ); $cl->SetSelect ( "*, @weight+$delta-abs(len-$len) AS myrank" ); $cl->SetSortMode ( SPH_SORT_EXTENDED, "myrank DESC, freq DESC" ); $cl->SetArrayResult ( true ); // pull top-N best trigram matches and run them through Levenshtein $res = $cl->Query ( $query, "suggest", 0, TOP_COUNT ); if ( !$res || !$res["matches"] ) return false; if ( SUGGEST_DEBUG ) { print "--- DEBUG START ---\n"; foreach ( $res["matches"] as $match ) { $w = $match["keyword"]; $myrank = @$match["attrs"]["myrank"]; if ( $myrank ) $myrank = ", myrank=$myrank"; $levdist = levenshtein ( $keyword, $w ); print "id=$match[id], weight=$match[weight], freq={$match[attrs][freq]}{$myrank}, word=$w, levdist=$levdist\n"; } print "--- DEBUG END ---\n"; } // further restrict trigram matches with a sane Levenshtein distance limit foreach ( $res["matches"] as $match ) { $suggested = $match["attrs"]["keyword"]; if ( levenshtein ( $keyword, $suggested )<=LEVENSHTEIN_THRESHOLD ) return $suggested; } return $keyword; } /// main if ( $_SERVER["argc"]<2 ) { die ( "usage:\n" . "php suggest.php --builddict\treads stopwords from stdin, prints SQL dump of the dictionary to stdout\n" . "php suggest.php --query WORD\tqueries Sphinx, prints suggestion\n" ); } if ( $_SERVER["argv"][1]=="--builddict" ) { $in = fopen ( "php://stdin", "r" ); $out = fopen ( "php://stdout", "w+" ); BuildDictionarySQL ( $out, $in ); } if ( $_SERVER["argv"][1]=="--query" ) { mysql_connect ( "localhost", "root", "" ) or die ( "mysql_connect() failed: ".mysql_error() ); mysql_select_db ( "test" ) or die ( "mysql_select_db() failed: ".mysql_error() ); $keyword = $_SERVER["argv"][2]; printf ( "keyword: %s\nsuggestion: %s\n", $keyword, MakeSuggestion($keyword) ); } coreseek-4.1-beta/csft-4.1/mysqlse/ 40777 0 0 0 11647303464 12052 5coreseek-4.1-beta/csft-4.1/mysqlse/CMakeLists.txt100777 0 0 1171 11643565732 14716 0SET(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} -DSAFEMALLOC -DSAFE_MUTEX") SET(CMAKE_C_FLAGS_DEBUG "${CMAKE_C_FLAGS_DEBUG} -DSAFEMALLOC -DSAFE_MUTEX") ADD_DEFINITIONS(-DMYSQL_SERVER) INCLUDE_DIRECTORIES(${CMAKE_SOURCE_DIR}/include ${CMAKE_SOURCE_DIR}/sql ${CMAKE_SOURCE_DIR}/extra/yassl/include ${CMAKE_SOURCE_DIR}/regex) SET(SPHINX_SOURCES ha_sphinx.cc) IF(MYSQL_VERSION_ID LESS 50515) ADD_LIBRARY(sphinx ha_sphinx.cc) ELSE() SET(SPHINX_PLUGIN_DYNAMIC "ha_sphinx") MYSQL_ADD_PLUGIN(sphinx ${SPHINX_SOURCES} STORAGE_ENGINE MODULE_ONLY LINK_LIBRARIES mysys) ENDIF() coreseek-4.1-beta/csft-4.1/mysqlse/gen_data.php100777 0 0 1322 11643565732 14427 0 coreseek-4.1-beta/csft-4.1/mysqlse/ha_sphinx.cc100777 0 0 260534 11643565732 14520 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #ifdef USE_PRAGMA_IMPLEMENTATION #pragma implementation // gcc: Class implementation #endif #if _MSC_VER>=1400 #define _CRT_SECURE_NO_DEPRECATE 1 #define _CRT_NONSTDC_NO_DEPRECATE 1 #endif #include #if MYSQL_VERSION_ID>=50515 #include "sql_class.h" #include "sql_array.h" #elif MYSQL_VERSION_ID>50100 #include "mysql_priv.h" #include #else #include "../mysql_priv.h" #endif #include #include #include // include client for INSERT table (sort of redoing federated..) #ifndef __WIN__ // UNIX-specific #include #include #include #define RECV_FLAGS MSG_WAITALL #define sphSockClose(_sock) ::close(_sock) #else // Windows-specific #include #define strcasecmp stricmp #define snprintf _snprintf #define RECV_FLAGS 0 #define sphSockClose(_sock) ::closesocket(_sock) #endif #include #include "ha_sphinx.h" #ifndef MSG_WAITALL #define MSG_WAITALL 0 #endif #if _MSC_VER>=1400 #pragma warning(push,4) #endif ///////////////////////////////////////////////////////////////////////////// /// there might be issues with min() on different platforms (eg. Gentoo, they say) #define Min(a,b) ((a)<(b)?(a):(b)) /// unaligned RAM accesses are forbidden on SPARC #if defined(sparc) || defined(__sparc__) #define UNALIGNED_RAM_ACCESS 0 #else #define UNALIGNED_RAM_ACCESS 1 #endif #if UNALIGNED_RAM_ACCESS /// pass-through wrapper template < typename T > inline T sphUnalignedRead ( const T & tRef ) { return tRef; } /// pass-through wrapper template < typename T > void sphUnalignedWrite ( void * pPtr, const T & tVal ) { *(T*)pPtr = tVal; } #else /// unaligned read wrapper for some architectures (eg. SPARC) template < typename T > inline T sphUnalignedRead ( const T & tRef ) { T uTmp; byte * pSrc = (byte *) &tRef; byte * pDst = (byte *) &uTmp; for ( int i=0; i<(int)sizeof(T); i++ ) *pDst++ = *pSrc++; return uTmp; } /// unaligned write wrapper for some architectures (eg. SPARC) template < typename T > void sphUnalignedWrite ( void * pPtr, const T & tVal ) { byte * pDst = (byte *) pPtr; byte * pSrc = (byte *) &tVal; for ( int i=0; i<(int)sizeof(T); i++ ) *pDst++ = *pSrc++; } #endif #if MYSQL_VERSION_ID>=50515 #define sphinx_hash_init my_hash_init #define sphinx_hash_free my_hash_free #define sphinx_hash_search my_hash_search #define sphinx_hash_delete my_hash_delete #else #define sphinx_hash_init hash_init #define sphinx_hash_free hash_free #define sphinx_hash_search hash_search #define sphinx_hash_delete hash_delete #endif ///////////////////////////////////////////////////////////////////////////// // FIXME! make this all dynamic #define SPHINXSE_MAX_FILTERS 32 #define SPHINXAPI_DEFAULT_HOST "127.0.0.1" #define SPHINXAPI_DEFAULT_PORT 9312 #define SPHINXAPI_DEFAULT_INDEX "*" #define SPHINXQL_DEFAULT_PORT 9306 #define SPHINXSE_SYSTEM_COLUMNS 3 #define SPHINXSE_MAX_ALLOC (16*1024*1024) #define SPHINXSE_MAX_KEYWORDSTATS 4096 #define SPHINXSE_VERSION "2.0.2-dev ($Revision: 2917)" // FIXME? the following is cut-n-paste from sphinx.h and searchd.cpp // cut-n-paste is somewhat simpler that adding dependencies however.. enum { SPHINX_SEARCHD_PROTO = 1, SEARCHD_COMMAND_SEARCH = 0, VER_COMMAND_SEARCH = 0x119, }; /// search query sorting orders enum ESphSortOrder { SPH_SORT_RELEVANCE = 0, ///< sort by document relevance desc, then by date SPH_SORT_ATTR_DESC = 1, ///< sort by document date desc, then by relevance desc SPH_SORT_ATTR_ASC = 2, ///< sort by document date asc, then by relevance desc SPH_SORT_TIME_SEGMENTS = 3, ///< sort by time segments (hour/day/week/etc) desc, then by relevance desc SPH_SORT_EXTENDED = 4, ///< sort by SQL-like expression (eg. "@relevance DESC, price ASC, @id DESC") SPH_SORT_EXPR = 5, ///< sort by expression SPH_SORT_TOTAL }; /// search query matching mode enum ESphMatchMode { SPH_MATCH_ALL = 0, ///< match all query words SPH_MATCH_ANY, ///< match any query word SPH_MATCH_PHRASE, ///< match this exact phrase SPH_MATCH_BOOLEAN, ///< match this boolean query SPH_MATCH_EXTENDED, ///< match this extended query SPH_MATCH_FULLSCAN, ///< match all document IDs w/o fulltext query, apply filters SPH_MATCH_EXTENDED2, ///< extended engine V2 SPH_MATCH_TOTAL }; /// search query relevance ranking mode enum ESphRankMode { SPH_RANK_PROXIMITY_BM25 = 0, ///< default mode, phrase proximity major factor and BM25 minor one SPH_RANK_BM25 = 1, ///< statistical mode, BM25 ranking only (faster but worse quality) SPH_RANK_NONE = 2, ///< no ranking, all matches get a weight of 1 SPH_RANK_WORDCOUNT = 3, ///< simple word-count weighting, rank is a weighted sum of per-field keyword occurence counts SPH_RANK_PROXIMITY = 4, ///< phrase proximity SPH_RANK_MATCHANY = 5, ///< emulate old match-any weighting SPH_RANK_FIELDMASK = 6, ///< sets bits where there were matches SPH_RANK_SPH04 = 7, ///< codename SPH04, phrase proximity + bm25 + head/exact boost SPH_RANK_TOTAL, SPH_RANK_DEFAULT = SPH_RANK_PROXIMITY_BM25 }; /// search query grouping mode enum ESphGroupBy { SPH_GROUPBY_DAY = 0, ///< group by day SPH_GROUPBY_WEEK = 1, ///< group by week SPH_GROUPBY_MONTH = 2, ///< group by month SPH_GROUPBY_YEAR = 3, ///< group by year SPH_GROUPBY_ATTR = 4 ///< group by attribute value }; /// known attribute types enum { SPH_ATTR_NONE = 0, ///< not an attribute at all SPH_ATTR_INTEGER = 1, ///< this attr is just an integer SPH_ATTR_TIMESTAMP = 2, ///< this attr is a timestamp SPH_ATTR_ORDINAL = 3, ///< this attr is an ordinal string number (integer at search time, specially handled at indexing time) SPH_ATTR_BOOL = 4, ///< this attr is a boolean bit field SPH_ATTR_FLOAT = 5, SPH_ATTR_BIGINT = 6, SPH_ATTR_STRING = 7, ///< string (binary; in-memory) SPH_ATTR_UINT32SET = 0x40000001UL, ///< this attr is multiple int32 values (0 or more) SPH_ATTR_UINT64SET = 0x40000002UL ///< this attr is multiple int64 values (0 or more) }; /// known answers enum { SEARCHD_OK = 0, ///< general success, command-specific reply follows SEARCHD_ERROR = 1, ///< general failure, error message follows SEARCHD_RETRY = 2, ///< temporary failure, error message follows, client should retry later SEARCHD_WARNING = 3 ///< general success, warning message and command-specific reply follow }; ////////////////////////////////////////////////////////////////////////////// #define SPHINX_DEBUG_OUTPUT 0 #define SPHINX_DEBUG_CALLS 0 #include #if SPHINX_DEBUG_OUTPUT inline void SPH_DEBUG ( const char * format, ... ) { va_list ap; va_start ( ap, format ); fprintf ( stderr, "SphinxSE: " ); vfprintf ( stderr, format, ap ); fprintf ( stderr, "\n" ); va_end ( ap ); } #else inline void SPH_DEBUG ( const char *, ... ) {} #endif #if SPHINX_DEBUG_CALLS #define SPH_ENTER_FUNC() { SPH_DEBUG ( "enter %s", __FUNCTION__ ); } #define SPH_ENTER_METHOD() { SPH_DEBUG ( "enter %s(this=%08x)", __FUNCTION__, this ); } #define SPH_RET(_arg) { SPH_DEBUG ( "leave %s", __FUNCTION__ ); return _arg; } #define SPH_VOID_RET() { SPH_DEBUG ( "leave %s", __FUNCTION__ ); return; } #else #define SPH_ENTER_FUNC() #define SPH_ENTER_METHOD() #define SPH_RET(_arg) { return(_arg); } #define SPH_VOID_RET() { return; } #endif #define SafeDelete(_arg) { if ( _arg ) delete ( _arg ); (_arg) = NULL; } #define SafeDeleteArray(_arg) { if ( _arg ) delete [] ( _arg ); (_arg) = NULL; } ////////////////////////////////////////////////////////////////////////////// /// per-table structure that will be shared among all open Sphinx SE handlers struct CSphSEShare { pthread_mutex_t m_tMutex; THR_LOCK m_tLock; char * m_sTable; char * m_sScheme; ///< our connection string char * m_sHost; ///< points into m_sScheme buffer, DO NOT FREE EXPLICITLY char * m_sSocket; ///< points into m_sScheme buffer, DO NOT FREE EXPLICITLY char * m_sIndex; ///< points into m_sScheme buffer, DO NOT FREE EXPLICITLY ushort m_iPort; bool m_bSphinxQL; ///< is this read-only SphinxAPI table, or write-only SphinxQL table? uint m_iTableNameLen; uint m_iUseCount; CHARSET_INFO * m_pTableQueryCharset; int m_iTableFields; char ** m_sTableField; enum_field_types * m_eTableFieldType; CSphSEShare () : m_sTable ( NULL ) , m_sScheme ( NULL ) , m_sHost ( NULL ) , m_sSocket ( NULL ) , m_sIndex ( NULL ) , m_iPort ( 0 ) , m_bSphinxQL ( false ) , m_iTableNameLen ( 0 ) , m_iUseCount ( 1 ) , m_pTableQueryCharset ( NULL ) , m_iTableFields ( 0 ) , m_sTableField ( NULL ) , m_eTableFieldType ( NULL ) { thr_lock_init ( &m_tLock ); pthread_mutex_init ( &m_tMutex, MY_MUTEX_INIT_FAST ); } ~CSphSEShare () { pthread_mutex_destroy ( &m_tMutex ); thr_lock_delete ( &m_tLock ); SafeDeleteArray ( m_sTable ); SafeDeleteArray ( m_sScheme ); ResetTable (); } void ResetTable () { for ( int i=0; i m_dIds; Dynamic_array m_dValues; }; Dynamic_array m_dOverrides; public: char m_sParseError[256]; public: CSphSEQuery ( const char * sQuery, int iLength, const char * sIndex ); ~CSphSEQuery (); bool Parse (); int BuildRequest ( char ** ppBuffer ); protected: char * m_pBuf; char * m_pCur; int m_iBufLeft; bool m_bBufOverrun; template < typename T > int ParseArray ( T ** ppValues, const char * sValue ); bool ParseField ( char * sField ); void SendBytes ( const void * pBytes, int iBytes ); void SendWord ( short int v ) { v = ntohs(v); SendBytes ( &v, sizeof(v) ); } void SendInt ( int v ) { v = ntohl(v); SendBytes ( &v, sizeof(v) ); } void SendDword ( uint v ) { v = ntohl(v) ;SendBytes ( &v, sizeof(v) ); } void SendUint64 ( ulonglong v ) { SendDword ( (uint)(v>>32) ); SendDword ( (uint)(v&0xFFFFFFFFUL) ); } void SendString ( const char * v ) { int iLen = strlen(v); SendDword(iLen); SendBytes ( v, iLen ); } void SendFloat ( float v ) { SendDword ( sphF2DW(v) ); } }; template int CSphSEQuery::ParseArray ( uint32 **, const char * ); template int CSphSEQuery::ParseArray ( longlong **, const char * ); ////////////////////////////////////////////////////////////////////////////// #if MYSQL_VERSION_ID>50100 #if MYSQL_VERSION_ID<50114 #error Sphinx SE requires MySQL 5.1.14 or higher if compiling for 5.1.x series! #endif static handler * sphinx_create_handler ( handlerton * hton, TABLE_SHARE * table, MEM_ROOT * mem_root ); static int sphinx_init_func ( void * p ); static int sphinx_close_connection ( handlerton * hton, THD * thd ); static int sphinx_panic ( handlerton * hton, enum ha_panic_function flag ); static bool sphinx_show_status ( handlerton * hton, THD * thd, stat_print_fn * stat_print, enum ha_stat_type stat_type ); #else static bool sphinx_init_func_for_handlerton (); static int sphinx_close_connection ( THD * thd ); bool sphinx_show_status ( THD * thd ); #endif // >50100 ////////////////////////////////////////////////////////////////////////////// static const char sphinx_hton_name[] = "SPHINX"; static const char sphinx_hton_comment[] = "Sphinx storage engine " SPHINXSE_VERSION; #if MYSQL_VERSION_ID<50100 handlerton sphinx_hton = { #ifdef MYSQL_HANDLERTON_INTERFACE_VERSION MYSQL_HANDLERTON_INTERFACE_VERSION, #endif sphinx_hton_name, SHOW_OPTION_YES, sphinx_hton_comment, DB_TYPE_SPHINX_DB, sphinx_init_func_for_handlerton, 0, // slot 0, // savepoint size sphinx_close_connection, // close_connection NULL, // savepoint NULL, // rollback to savepoint NULL, // release savepoint NULL, // commit NULL, // rollback NULL, // prepare NULL, // recover NULL, // commit_by_xid NULL, // rollback_by_xid NULL, // create_cursor_read_view NULL, // set_cursor_read_view NULL, // close_cursor_read_view HTON_CAN_RECREATE }; #else static handlerton * sphinx_hton_ptr = NULL; #endif ////////////////////////////////////////////////////////////////////////////// // variables for Sphinx shared methods pthread_mutex_t sphinx_mutex; // mutex to init the hash static int sphinx_init = 0; // flag whether the hash was initialized static HASH sphinx_open_tables; // hash used to track open tables ////////////////////////////////////////////////////////////////////////////// // INITIALIZATION AND SHUTDOWN ////////////////////////////////////////////////////////////////////////////// // hashing function #if MYSQL_VERSION_ID>=50120 typedef size_t GetKeyLength_t; #else typedef uint GetKeyLength_t; #endif static byte * sphinx_get_key ( const byte * pSharePtr, GetKeyLength_t * pLength, my_bool ) { CSphSEShare * pShare = (CSphSEShare *) pSharePtr; *pLength = (size_t) pShare->m_iTableNameLen; return (byte*) pShare->m_sTable; } #if MYSQL_VERSION_ID<50100 static int sphinx_init_func ( void * ) // to avoid unused arg warning #else static int sphinx_init_func ( void * p ) #endif { SPH_ENTER_FUNC(); if ( !sphinx_init ) { sphinx_init = 1; void ( pthread_mutex_init ( &sphinx_mutex, MY_MUTEX_INIT_FAST ) ); sphinx_hash_init ( &sphinx_open_tables, system_charset_info, 32, 0, 0, sphinx_get_key, 0, 0 ); #if MYSQL_VERSION_ID > 50100 handlerton * hton = (handlerton*) p; hton->state = SHOW_OPTION_YES; hton->db_type = DB_TYPE_FIRST_DYNAMIC; hton->create = sphinx_create_handler; hton->close_connection = sphinx_close_connection; hton->show_status = sphinx_show_status; hton->panic = sphinx_panic; hton->flags = HTON_CAN_RECREATE; #endif } SPH_RET(0); } #if MYSQL_VERSION_ID<50100 static bool sphinx_init_func_for_handlerton () { return sphinx_init_func ( &sphinx_hton ); } #endif #if MYSQL_VERSION_ID>50100 static int sphinx_close_connection ( handlerton * hton, THD * thd ) { // deallocate common handler data SPH_ENTER_FUNC(); void ** tmp = thd_ha_data ( thd, hton ); CSphSEThreadData * pTls = (CSphSEThreadData*) (*tmp); SafeDelete ( pTls ); *tmp = NULL; SPH_RET(0); } static int sphinx_done_func ( void * ) { SPH_ENTER_FUNC(); int error = 0; if ( sphinx_init ) { sphinx_init = 0; if ( sphinx_open_tables.records ) error = 1; sphinx_hash_free ( &sphinx_open_tables ); pthread_mutex_destroy ( &sphinx_mutex ); } SPH_RET(0); } static int sphinx_panic ( handlerton * hton, enum ha_panic_function ) { return sphinx_done_func ( hton ); } #else static int sphinx_close_connection ( THD * thd ) { // deallocate common handler data SPH_ENTER_FUNC(); CSphSEThreadData * pTls = (CSphSEThreadData*) thd->ha_data[sphinx_hton.slot]; SafeDelete ( pTls ); thd->ha_data[sphinx_hton.slot] = NULL; SPH_RET(0); } #endif // >50100 ////////////////////////////////////////////////////////////////////////////// // SHOW STATUS ////////////////////////////////////////////////////////////////////////////// #if MYSQL_VERSION_ID>50100 static bool sphinx_show_status ( handlerton * hton, THD * thd, stat_print_fn * stat_print, enum ha_stat_type ) #else bool sphinx_show_status ( THD * thd ) #endif { SPH_ENTER_FUNC(); #if MYSQL_VERSION_ID<50100 Protocol * protocol = thd->protocol; List field_list; #endif char buf1[IO_SIZE]; uint buf1len; char buf2[IO_SIZE]; uint buf2len = 0; String words; buf1[0] = '\0'; buf2[0] = '\0'; #if MYSQL_VERSION_ID>50100 // 5.1.x style stats CSphSEThreadData * pTls = (CSphSEThreadData*) ( *thd_ha_data ( thd, hton ) ); #define LOC_STATS(_key,_keylen,_val,_vallen) \ stat_print ( thd, sphinx_hton_name, strlen(sphinx_hton_name), _key, _keylen, _val, _vallen ); #else // 5.0.x style stats if ( have_sphinx_db!=SHOW_OPTION_YES ) { my_message ( ER_NOT_SUPPORTED_YET, "failed to call SHOW SPHINX STATUS: --skip-sphinx was specified", MYF(0) ); SPH_RET(TRUE); } CSphSEThreadData * pTls = (CSphSEThreadData*) thd->ha_data[sphinx_hton.slot]; field_list.push_back ( new Item_empty_string ( "Type", 10 ) ); field_list.push_back ( new Item_empty_string ( "Name", FN_REFLEN ) ); field_list.push_back ( new Item_empty_string ( "Status", 10 ) ); if ( protocol->send_fields ( &field_list, Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF ) ) SPH_RET(TRUE); #define LOC_STATS(_key,_keylen,_val,_vallen) \ protocol->prepare_for_resend (); \ protocol->store ( "SPHINX", 6, system_charset_info ); \ protocol->store ( _key, _keylen, system_charset_info ); \ protocol->store ( _val, _vallen, system_charset_info ); \ if ( protocol->write() ) \ SPH_RET(TRUE); #endif // show query stats if ( pTls && pTls->m_bStats ) { const CSphSEStats * pStats = &pTls->m_tStats; buf1len = my_snprintf ( buf1, sizeof(buf1), "total: %d, total found: %d, time: %d, words: %d", pStats->m_iMatchesTotal, pStats->m_iMatchesFound, pStats->m_iQueryMsec, pStats->m_iWords ); LOC_STATS ( "stats", 5, buf1, buf1len ); if ( pStats->m_iWords ) { for ( int i=0; im_iWords; i++ ) { CSphSEWordStats & tWord = pStats->m_dWords[i]; buf2len = my_snprintf ( buf2, sizeof(buf2), "%s%s:%d:%d ", buf2, tWord.m_sWord, tWord.m_iDocs, tWord.m_iHits ); } // convert it if we can const char * sWord = buf2; int iWord = buf2len; String sBuf3; if ( pTls->m_pQueryCharset ) { uint iErrors; sBuf3.copy ( buf2, buf2len, pTls->m_pQueryCharset, system_charset_info, &iErrors ); sWord = sBuf3.c_ptr(); iWord = sBuf3.length(); } LOC_STATS ( "words", 5, sWord, iWord ); } } // show last error or warning (either in addition to stats, or on their own) if ( pTls && pTls->m_tStats.m_sLastMessage && pTls->m_tStats.m_sLastMessage[0] ) { const char * sMessageType = pTls->m_tStats.m_bLastError ? "error" : "warning"; LOC_STATS ( sMessageType, strlen ( sMessageType ), pTls->m_tStats.m_sLastMessage, strlen ( pTls->m_tStats.m_sLastMessage ) ); } else { // well, nothing to show just yet #if MYSQL_VERSION_ID < 50100 LOC_STATS ( "stats", 5, "no query has been executed yet", sizeof("no query has been executed yet")-1 ); #endif } #if MYSQL_VERSION_ID < 50100 send_eof(thd); #endif SPH_RET(FALSE); } ////////////////////////////////////////////////////////////////////////////// // HELPERS ////////////////////////////////////////////////////////////////////////////// static char * sphDup ( const char * sSrc, int iLen=-1 ) { if ( !sSrc ) return NULL; if ( iLen<0 ) iLen = strlen(sSrc); char * sRes = new char [ 1+iLen ]; memcpy ( sRes, sSrc, iLen ); sRes[iLen] = '\0'; return sRes; } static void sphLogError ( const char * sFmt, ... ) { // emit timestamp #ifdef __WIN__ SYSTEMTIME t; GetLocalTime ( &t ); fprintf ( stderr, "%02d%02d%02d %2d:%02d:%02d SphinxSE: internal error: ", (int)t.wYear % 100, (int)t.wMonth, (int)t.wDay, (int)t.wHour, (int)t.wMinute, (int)t.wSecond ); #else // Unix version time_t tStamp; time ( &tStamp ); struct tm * pParsed; #ifdef HAVE_LOCALTIME_R struct tm tParsed; localtime_r ( &tStamp, &tParsed ); pParsed = &tParsed; #else pParsed = localtime ( &tStamp ); #endif // HAVE_LOCALTIME_R fprintf ( stderr, "%02d%02d%02d %2d:%02d:%02d SphinxSE: internal error: ", pParsed->tm_year % 100, pParsed->tm_mon + 1, pParsed->tm_mday, pParsed->tm_hour, pParsed->tm_min, pParsed->tm_sec); #endif // __WIN__ // emit message va_list ap; va_start ( ap, sFmt ); vfprintf ( stderr, sFmt, ap ); va_end ( ap ); // emit newline fprintf ( stderr, "\n" ); } // the following scheme variants are recognized // // sphinx://host[:port]/index // sphinxql://host[:port]/index // unix://unix/domain/socket[:index] static bool ParseUrl ( CSphSEShare * share, TABLE * table, bool bCreate ) { SPH_ENTER_FUNC(); if ( share ) { // check incoming stuff if ( !table ) { sphLogError ( "table==NULL in ParseUrl()" ); return false; } if ( !table->s ) { sphLogError ( "(table->s)==NULL in ParseUrl()" ); return false; } // free old stuff share->ResetTable (); // fill new stuff share->m_iTableFields = table->s->fields; if ( share->m_iTableFields ) { share->m_sTableField = new char * [ share->m_iTableFields ]; share->m_eTableFieldType = new enum_field_types [ share->m_iTableFields ]; for ( int i=0; im_iTableFields; i++ ) { share->m_sTableField[i] = sphDup ( table->field[i]->field_name ); share->m_eTableFieldType[i] = table->field[i]->type(); } } } // defaults bool bOk = true; bool bQL = false; char * sScheme = NULL; char * sHost = SPHINXAPI_DEFAULT_HOST; char * sIndex = SPHINXAPI_DEFAULT_INDEX; int iPort = SPHINXAPI_DEFAULT_PORT; // parse connection string, if any while ( table->s->connect_string.length!=0 ) { sScheme = sphDup ( table->s->connect_string.str, table->s->connect_string.length ); sHost = strstr ( sScheme, "://" ); if ( !sHost ) { bOk = false; break; } sHost[0] = '\0'; sHost += 3; ///////////////////////////// // sphinxapi via unix socket ///////////////////////////// if ( !strcmp ( sScheme, "unix" ) ) { sHost--; // reuse last slash iPort = 0; if (!( sIndex = strrchr ( sHost, ':' ) )) sIndex = SPHINXAPI_DEFAULT_INDEX; else { *sIndex++ = '\0'; if ( !*sIndex ) sIndex = SPHINXAPI_DEFAULT_INDEX; } bOk = true; break; } ///////////////////// // sphinxapi via tcp ///////////////////// if ( !strcmp ( sScheme, "sphinx" ) ) { char * sPort = strchr ( sHost, ':' ); if ( sPort ) { *sPort++ = '\0'; if ( *sPort ) { sIndex = strchr ( sPort, '/' ); if ( sIndex ) *sIndex++ = '\0'; else sIndex = SPHINXAPI_DEFAULT_INDEX; iPort = atoi(sPort); if ( !iPort ) iPort = SPHINXAPI_DEFAULT_PORT; } } else { sIndex = strchr ( sHost, '/' ); if ( sIndex ) *sIndex++ = '\0'; else sIndex = SPHINXAPI_DEFAULT_INDEX; } bOk = true; break; } //////////// // sphinxql //////////// if ( !strcmp ( sScheme, "sphinxql" ) ) { bQL = true; iPort = SPHINXQL_DEFAULT_PORT; // handle port char * sPort = strchr ( sHost, ':' ); sIndex = sHost; // starting point for index name search if ( sPort ) { *sPort++ = '\0'; sIndex = sPort; iPort = atoi(sPort); if ( !iPort ) { bOk = false; // invalid port; can report ER_FOREIGN_DATA_STRING_INVALID break; } } // find index sIndex = strchr ( sIndex, '/' ); if ( sIndex ) *sIndex++ = '\0'; // final checks // host and index names are required bOk = ( sHost && *sHost && sIndex && *sIndex ); break; } // unknown case bOk = false; break; } if ( !bOk ) { my_error ( bCreate ? ER_FOREIGN_DATA_STRING_INVALID_CANT_CREATE : ER_FOREIGN_DATA_STRING_INVALID, MYF(0), table->s->connect_string ); } else { if ( share ) { SafeDeleteArray ( share->m_sScheme ); share->m_sScheme = sScheme; share->m_sHost = sHost; share->m_sIndex = sIndex; share->m_iPort = (ushort)iPort; share->m_bSphinxQL = bQL; } } if ( !bOk && !share ) SafeDeleteArray ( sScheme ); SPH_RET(bOk); } // Example of simple lock controls. The "share" it creates is structure we will // pass to each sphinx handler. Do you have to have one of these? Well, you have // pieces that are used for locking, and they are needed to function. static CSphSEShare * get_share ( const char * table_name, TABLE * table ) { SPH_ENTER_FUNC(); pthread_mutex_lock ( &sphinx_mutex ); CSphSEShare * pShare = NULL; for ( ;; ) { // check if we already have this share #if MYSQL_VERSION_ID>=50120 pShare = (CSphSEShare*) sphinx_hash_search ( &sphinx_open_tables, (const uchar *) table_name, strlen(table_name) ); #else #ifdef __WIN__ pShare = (CSphSEShare*) sphinx_hash_search ( &sphinx_open_tables, (const byte *) table_name, strlen(table_name) ); #else pShare = (CSphSEShare*) sphinx_hash_search ( &sphinx_open_tables, table_name, strlen(table_name) ); #endif // win #endif // pre-5.1.20 if ( pShare ) { pShare->m_iUseCount++; break; } // try to allocate new share pShare = new CSphSEShare (); if ( !pShare ) break; // try to setup it if ( !ParseUrl ( pShare, table, false ) ) { SafeDelete ( pShare ); break; } if ( !pShare->m_bSphinxQL ) pShare->m_pTableQueryCharset = table->field[2]->charset(); // try to hash it pShare->m_iTableNameLen = strlen(table_name); pShare->m_sTable = sphDup ( table_name ); if ( my_hash_insert ( &sphinx_open_tables, (const byte *)pShare ) ) { SafeDelete ( pShare ); break; } // all seems fine break; } pthread_mutex_unlock ( &sphinx_mutex ); SPH_RET(pShare); } // Free lock controls. We call this whenever we close a table. If the table had // the last reference to the share then we free memory associated with it. static int free_share ( CSphSEShare * pShare ) { SPH_ENTER_FUNC(); pthread_mutex_lock ( &sphinx_mutex ); if ( !--pShare->m_iUseCount ) { sphinx_hash_delete ( &sphinx_open_tables, (byte *)pShare ); SafeDelete ( pShare ); } pthread_mutex_unlock ( &sphinx_mutex ); SPH_RET(0); } #if MYSQL_VERSION_ID>50100 static handler * sphinx_create_handler ( handlerton * hton, TABLE_SHARE * table, MEM_ROOT * mem_root ) { sphinx_hton_ptr = hton; return new ( mem_root ) ha_sphinx ( hton, table ); } #endif ////////////////////////////////////////////////////////////////////////////// // CLIENT-SIDE REQUEST STUFF ////////////////////////////////////////////////////////////////////////////// CSphSEQuery::CSphSEQuery ( const char * sQuery, int iLength, const char * sIndex ) : m_sHost ( "" ) , m_iPort ( 0 ) , m_sIndex ( sIndex ? sIndex : "*" ) , m_iOffset ( 0 ) , m_iLimit ( 20 ) , m_bQuery ( false ) , m_sQuery ( "" ) , m_pWeights ( NULL ) , m_iWeights ( 0 ) , m_eMode ( SPH_MATCH_ALL ) , m_eRanker ( SPH_RANK_PROXIMITY_BM25 ) , m_eSort ( SPH_SORT_RELEVANCE ) , m_sSortBy ( "" ) , m_iMaxMatches ( 1000 ) , m_iMaxQueryTime ( 0 ) , m_iMinID ( 0 ) , m_iMaxID ( 0 ) , m_iFilters ( 0 ) , m_eGroupFunc ( SPH_GROUPBY_DAY ) , m_sGroupBy ( "" ) , m_sGroupSortBy ( "@group desc" ) , m_iCutoff ( 0 ) , m_iRetryCount ( 0 ) , m_iRetryDelay ( 0 ) , m_sGroupDistinct ( "" ) , m_iIndexWeights ( 0 ) , m_iFieldWeights ( 0 ) , m_bGeoAnchor ( false ) , m_sGeoLatAttr ( "" ) , m_sGeoLongAttr ( "" ) , m_fGeoLatitude ( 0.0f ) , m_fGeoLongitude ( 0.0f ) , m_sComment ( "" ) , m_sSelect ( "" ) , m_pBuf ( NULL ) , m_pCur ( NULL ) , m_iBufLeft ( 0 ) , m_bBufOverrun ( false ) { m_sQueryBuffer = new char [ iLength+2 ]; memcpy ( m_sQueryBuffer, sQuery, iLength ); m_sQueryBuffer[iLength] = ';'; m_sQueryBuffer[iLength+1] = '\0'; } CSphSEQuery::~CSphSEQuery () { SPH_ENTER_METHOD(); SafeDeleteArray ( m_sQueryBuffer ); SafeDeleteArray ( m_pWeights ); SafeDeleteArray ( m_pBuf ); for ( int i=0; i int CSphSEQuery::ParseArray ( T ** ppValues, const char * sValue ) { SPH_ENTER_METHOD(); assert ( ppValues ); assert ( !(*ppValues) ); const char * pValue; bool bPrevDigit = false; int iValues = 0; // count the values for ( pValue=sValue; *pValue; pValue++ ) { bool bDigit = (*pValue)>='0' && (*pValue)<='9'; if ( bDigit && !bPrevDigit ) iValues++; bPrevDigit = bDigit; } if ( !iValues ) SPH_RET(0); // extract the values T * pValues = new T [ iValues ]; *ppValues = pValues; int iIndex = 0, iSign = 1; T uValue = 0; bPrevDigit = false; for ( pValue=sValue ;; pValue++ ) { bool bDigit = (*pValue)>='0' && (*pValue)<='9'; if ( bDigit ) { if ( !bPrevDigit ) uValue = 0; uValue = uValue*10 + ( (*pValue)-'0' ); } else if ( bPrevDigit ) { assert ( iIndexs && isspace ( p[-1] ) ) p--; *p = '\0'; return s; } static bool myisattr ( char c ) { return ( c>='0' && c<='9' ) || ( c>='a' && c<='z' ) || ( c>='A' && c<='Z' ) || c=='_'; } bool CSphSEQuery::ParseField ( char * sField ) { SPH_ENTER_METHOD(); // look for option name/value separator char * sValue = strchr ( sField, '=' ); if ( !sValue || sValue==sField || sValue[-1]=='\\' ) { // by default let's assume it's just query if ( sField[0] ) { if ( m_bQuery ) { snprintf ( m_sParseError, sizeof(m_sParseError), "search query already specified; '%s' is redundant", sField ); SPH_RET(false); } else { m_sQuery = sField; m_bQuery = true; // unescape only 1st one char *s = sField, *d = sField; int iSlashes = 0; while ( *s ) { iSlashes = ( *s=='\\' ) ? iSlashes+1 : 0; if ( ( iSlashes%2 )==0 ) *d++ = *s; s++; } *d = '\0'; } } SPH_RET(true); } // split *sValue++ = '\0'; sValue = chop ( sValue ); int iValue = atoi ( sValue ); // handle options char * sName = chop ( sField ); if ( !strcmp ( sName, "query" ) ) m_sQuery = sValue; else if ( !strcmp ( sName, "host" ) ) m_sHost = sValue; else if ( !strcmp ( sName, "port" ) ) m_iPort = iValue; else if ( !strcmp ( sName, "index" ) ) m_sIndex = sValue; else if ( !strcmp ( sName, "offset" ) ) m_iOffset = iValue; else if ( !strcmp ( sName, "limit" ) ) m_iLimit = iValue; else if ( !strcmp ( sName, "weights" ) ) m_iWeights = ParseArray ( &m_pWeights, sValue ); else if ( !strcmp ( sName, "minid" ) ) m_iMinID = iValue; else if ( !strcmp ( sName, "maxid" ) ) m_iMaxID = iValue; else if ( !strcmp ( sName, "maxmatches" ) ) m_iMaxMatches = iValue; else if ( !strcmp ( sName, "maxquerytime" ) ) m_iMaxQueryTime = iValue; else if ( !strcmp ( sName, "groupsort" ) ) m_sGroupSortBy = sValue; else if ( !strcmp ( sName, "distinct" ) ) m_sGroupDistinct = sValue; else if ( !strcmp ( sName, "cutoff" ) ) m_iCutoff = iValue; else if ( !strcmp ( sName, "comment" ) ) m_sComment = sValue; else if ( !strcmp ( sName, "select" ) ) m_sSelect = sValue; else if ( !strcmp ( sName, "mode" ) ) { m_eMode = SPH_MATCH_ALL; if ( !strcmp ( sValue, "any" ) ) m_eMode = SPH_MATCH_ANY; else if ( !strcmp ( sValue, "phrase" ) ) m_eMode = SPH_MATCH_PHRASE; else if ( !strcmp ( sValue, "boolean" ) ) m_eMode = SPH_MATCH_BOOLEAN; else if ( !strcmp ( sValue, "ext" ) ) m_eMode = SPH_MATCH_EXTENDED; else if ( !strcmp ( sValue, "extended" ) ) m_eMode = SPH_MATCH_EXTENDED; else if ( !strcmp ( sValue, "ext2" ) ) m_eMode = SPH_MATCH_EXTENDED2; else if ( !strcmp ( sValue, "extended2" ) ) m_eMode = SPH_MATCH_EXTENDED2; else if ( !strcmp ( sValue, "all" ) ) m_eMode = SPH_MATCH_ALL; else if ( !strcmp ( sValue, "fullscan" ) ) m_eMode = SPH_MATCH_FULLSCAN; else { snprintf ( m_sParseError, sizeof(m_sParseError), "unknown matching mode '%s'", sValue ); SPH_RET(false); } } else if ( !strcmp ( sName, "ranker" ) ) { m_eRanker = SPH_RANK_PROXIMITY_BM25; if ( !strcmp ( sValue, "proximity_bm25" ) ) m_eRanker = SPH_RANK_PROXIMITY_BM25; else if ( !strcmp ( sValue, "bm25" ) ) m_eRanker = SPH_RANK_BM25; else if ( !strcmp ( sValue, "none" ) ) m_eRanker = SPH_RANK_NONE; else if ( !strcmp ( sValue, "wordcount" ) ) m_eRanker = SPH_RANK_WORDCOUNT; else if ( !strcmp ( sValue, "proximity" ) ) m_eRanker = SPH_RANK_PROXIMITY; else if ( !strcmp ( sValue, "matchany" ) ) m_eRanker = SPH_RANK_MATCHANY; else if ( !strcmp ( sValue, "fieldmask" ) ) m_eRanker = SPH_RANK_FIELDMASK; else if ( !strcmp ( sValue, "sph04" ) ) m_eRanker = SPH_RANK_SPH04; else { snprintf ( m_sParseError, sizeof(m_sParseError), "unknown ranking mode '%s'", sValue ); SPH_RET(false); } } else if ( !strcmp ( sName, "sort" ) ) { static const struct { const char * m_sName; ESphSortOrder m_eSort; } dSortModes[] = { { "relevance", SPH_SORT_RELEVANCE }, { "attr_desc:", SPH_SORT_ATTR_DESC }, { "attr_asc:", SPH_SORT_ATTR_ASC }, { "time_segments:", SPH_SORT_TIME_SEGMENTS }, { "extended:", SPH_SORT_EXTENDED }, { "expr:", SPH_SORT_EXPR } }; int i; const int nModes = sizeof(dSortModes)/sizeof(dSortModes[0]); for ( i=0; i ( &tFilter.m_pValues, sValue ); if ( !tFilter.m_iValues ) { assert ( !tFilter.m_pValues ); break; } // all ok m_iFilters++; break; } } else if ( !strcmp ( sName, "indexweights" ) || !strcmp ( sName, "fieldweights" ) ) { bool bIndex = !strcmp ( sName, "indexweights" ); int * pCount = bIndex ? &m_iIndexWeights : &m_iFieldWeights; char ** pNames = bIndex ? &m_sIndexWeight[0] : &m_sFieldWeight[0]; int * pWeights = bIndex ? &m_iIndexWeight[0] : &m_iFieldWeight[0]; *pCount = 0; char * p = sValue; while ( *p && *pCountm_sName = chop(sName); pOverride->m_iType = iType; m_dOverrides.append ( pOverride ); } ulonglong uId = strtoull ( sId, NULL, 10 ); CSphSEQuery::Override_t::Value_t tValue; if ( iType==SPH_ATTR_FLOAT ) tValue.m_fValue = (float)atof(sValue); else if ( iType==SPH_ATTR_BIGINT ) tValue.m_iValue64 = strtoll ( sValue, NULL, 10 ); else tValue.m_uValue = (uint32)strtoul ( sValue, NULL, 10 ); pOverride->m_dIds.append ( uId ); pOverride->m_dValues.append ( tValue ); } if ( !pOverride ) { snprintf ( m_sParseError, sizeof(m_sParseError), "override: id:value mapping expected" ); SPH_RET(false); } SPH_RET(true); } else { snprintf ( m_sParseError, sizeof(m_sParseError), "unknown parameter '%s'", sName ); SPH_RET(false); } // !COMMIT handle syntax errors SPH_RET(true); } bool CSphSEQuery::Parse () { SPH_ENTER_METHOD(); SPH_DEBUG ( "query [[ %s ]]", m_sQueryBuffer ); m_bQuery = false; char * pCur = m_sQueryBuffer; char * pNext = pCur; while ( ( pNext = strchr ( pNext, ';' ) )!=NULL ) { // handle escaped semicolons if ( pNext>m_sQueryBuffer && pNext[-1]=='\\' && pNext[1]!='\0' ) { pNext++; continue; } // handle semicolon-separated clauses *pNext++ = '\0'; if ( !ParseField ( pCur ) ) SPH_RET(false); pCur = pNext; } SPH_DEBUG ( "q [[ %s ]]", m_sQuery ); SPH_RET(true); } void CSphSEQuery::SendBytes ( const void * pBytes, int iBytes ) { SPH_ENTER_METHOD(); if ( m_iBufLeftm_iType==SPH_ATTR_BIGINT ? 16 : 12; // id64 + value iReqSize += strlen ( pOverride->m_sName ) + 12 + uSize*pOverride->m_dIds.elements(); } // select iReqSize += 4; m_iBufLeft = 0; SafeDeleteArray ( m_pBuf ); m_pBuf = new char [ iReqSize ]; if ( !m_pBuf ) SPH_RET(-1); m_pCur = m_pBuf; m_iBufLeft = iReqSize; m_bBufOverrun = false; (*ppBuffer) = m_pBuf; // build request SendWord ( SEARCHD_COMMAND_SEARCH ); // command id SendWord ( VER_COMMAND_SEARCH ); // command version SendInt ( iReqSize-8 ); // packet body length SendInt ( 0 ); // its a client SendInt ( 1 ); // number of queries SendInt ( m_iOffset ); SendInt ( m_iLimit ); SendInt ( m_eMode ); SendInt ( m_eRanker ); // 1.16+ SendInt ( m_eSort ); SendString ( m_sSortBy ); // sort attr SendString ( m_sQuery ); // query SendInt ( m_iWeights ); for ( int j=0; jm_sName ); SendDword ( pOverride->m_iType ); SendInt ( pOverride->m_dIds.elements() ); for ( int j=0; jm_dIds.elements(); j++ ) { SendUint64 ( pOverride->m_dIds.at(j) ); if ( pOverride->m_iType==SPH_ATTR_FLOAT ) SendFloat ( pOverride->m_dValues.at(j).m_fValue ); else if ( pOverride->m_iType==SPH_ATTR_BIGINT ) SendUint64 ( pOverride->m_dValues.at(j).m_iValue64 ); else SendDword ( pOverride->m_dValues.at(j).m_uValue ); } } // select SendString ( m_sSelect ); // detect buffer overruns and underruns, and report internal error if ( m_bBufOverrun || m_iBufLeft!=0 || m_pCur-m_pBuf!=iReqSize ) SPH_RET(-1); // all fine SPH_RET ( iReqSize ); } ////////////////////////////////////////////////////////////////////////////// // SPHINX HANDLER ////////////////////////////////////////////////////////////////////////////// static const char * ha_sphinx_exts[] = { NullS }; #if MYSQL_VERSION_ID<50100 ha_sphinx::ha_sphinx ( TABLE_ARG * table ) : handler ( &sphinx_hton, table ) #else ha_sphinx::ha_sphinx ( handlerton * hton, TABLE_ARG * table ) : handler ( hton, table ) #endif , m_pShare ( NULL ) , m_iMatchesTotal ( 0 ) , m_iCurrentPos ( 0 ) , m_pCurrentKey ( NULL ) , m_iCurrentKeyLen ( 0 ) , m_pResponse ( NULL ) , m_pResponseEnd ( NULL ) , m_pCur ( NULL ) , m_bUnpackError ( false ) , m_iFields ( 0 ) , m_dFields ( NULL ) , m_iAttrs ( 0 ) , m_dAttrs ( NULL ) , m_bId64 ( 0 ) , m_dUnboundFields ( NULL ) { SPH_ENTER_METHOD(); if ( current_thd ) current_thd->variables.engine_condition_pushdown = true; SPH_VOID_RET(); } // If frm_error() is called then we will use this to to find out what file extentions // exist for the storage engine. This is also used by the default rename_table and // delete_table method in handler.cc. const char ** ha_sphinx::bas_ext() const { return ha_sphinx_exts; } // Used for opening tables. The name will be the name of the file. // A table is opened when it needs to be opened. For instance // when a request comes in for a select on the table (tables are not // open and closed for each request, they are cached). // // Called from handler.cc by handler::ha_open(). The server opens all tables by // calling ha_open() which then calls the handler specific open(). int ha_sphinx::open ( const char * name, int, uint ) { SPH_ENTER_METHOD(); m_pShare = get_share ( name, table ); if ( !m_pShare ) SPH_RET(1); thr_lock_data_init ( &m_pShare->m_tLock, &m_tLock, NULL ); #if MYSQL_VERSION_ID>50100 *thd_ha_data ( table->in_use, ht ) = NULL; #else table->in_use->ha_data [ sphinx_hton.slot ] = NULL; #endif SPH_RET(0); } int ha_sphinx::Connect ( const char * sHost, ushort uPort ) { struct sockaddr_in sin; #ifndef __WIN__ struct sockaddr_un saun; #endif int iDomain = 0; int iSockaddrSize = 0; struct sockaddr * pSockaddr = NULL; in_addr_t ip_addr; if ( uPort ) { iDomain = AF_INET; iSockaddrSize = sizeof(sin); pSockaddr = (struct sockaddr *) &sin; memset ( &sin, 0, sizeof(sin) ); sin.sin_family = AF_INET; sin.sin_port = htons(uPort); // prepare host address if ( (int)( ip_addr = inet_addr(sHost) )!=(int)INADDR_NONE ) { memcpy ( &sin.sin_addr, &ip_addr, sizeof(ip_addr) ); } else { int tmp_errno; bool bError = false; #if MYSQL_VERSION_ID>=50515 struct addrinfo tmp_hostent, *hp; tmp_errno = getaddrinfo ( sHost, NULL, &tmp_hostent, &hp ); if ( !tmp_errno ) { freeaddrinfo ( hp ); bError = true; } #else struct hostent tmp_hostent, *hp; char buff2 [ GETHOSTBYNAME_BUFF_SIZE ]; hp = my_gethostbyname_r ( sHost, &tmp_hostent, buff2, sizeof(buff2), &tmp_errno ); if ( !hp ) { my_gethostbyname_r_free(); bError = true; } #endif if ( bError ) { char sError[256]; my_snprintf ( sError, sizeof(sError), "failed to resolve searchd host (name=%s)", sHost ); my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), sError ); SPH_RET(-1); } #if MYSQL_VERSION_ID>=50515 memcpy ( &sin.sin_addr, hp->ai_addr, Min ( sizeof(sin.sin_addr), (size_t)hp->ai_addrlen ) ); freeaddrinfo ( hp ); #else memcpy ( &sin.sin_addr, hp->h_addr, Min ( sizeof(sin.sin_addr), (size_t)hp->h_length ) ); my_gethostbyname_r_free(); #endif } } else { #ifndef __WIN__ iDomain = AF_UNIX; iSockaddrSize = sizeof(saun); pSockaddr = (struct sockaddr *) &saun; memset ( &saun, 0, sizeof(saun) ); saun.sun_family = AF_UNIX; strncpy ( saun.sun_path, sHost, sizeof(saun.sun_path)-1 ); #else my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), "UNIX sockets are not supported on Windows" ); SPH_RET(-1); #endif } char sError[512]; int iSocket = socket ( iDomain, SOCK_STREAM, 0 ); if ( iSocket<0 ) { my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), "failed to create client socket" ); SPH_RET(-1); } if ( connect ( iSocket, pSockaddr, iSockaddrSize )<0 ) { sphSockClose ( iSocket ); my_snprintf ( sError, sizeof(sError), "failed to connect to searchd (host=%s, errno=%d, port=%d)", sHost, errno, (int)uPort ); my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), sError ); SPH_RET(-1); } return iSocket; } int ha_sphinx::ConnectAPI ( const char * sQueryHost, int iQueryPort ) { SPH_ENTER_METHOD(); const char * sHost = ( sQueryHost && *sQueryHost ) ? sQueryHost : m_pShare->m_sHost; ushort uPort = iQueryPort ? (ushort)iQueryPort : m_pShare->m_iPort; int iSocket = Connect ( sHost, uPort ); if ( iSocket<0 ) SPH_RET ( iSocket ); char sError[512]; int version; if ( ::recv ( iSocket, (char *)&version, sizeof(version), 0 )!=sizeof(version) ) { sphSockClose ( iSocket ); my_snprintf ( sError, sizeof(sError), "failed to receive searchd version (host=%s, port=%d)", sHost, (int)uPort ); my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), sError ); SPH_RET(-1); } uint uClientVersion = htonl ( SPHINX_SEARCHD_PROTO ); if ( ::send ( iSocket, (char*)&uClientVersion, sizeof(uClientVersion), 0 )!=sizeof(uClientVersion) ) { sphSockClose ( iSocket ); my_snprintf ( sError, sizeof(sError), "failed to send client version (host=%s, port=%d)", sHost, (int)uPort ); my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), sError ); SPH_RET(-1); } SPH_RET ( iSocket ); } // Closes a table. We call the free_share() function to free any resources // that we have allocated in the "shared" structure. // // Called from sql_base.cc, sql_select.cc, and table.cc. // In sql_select.cc it is only used to close up temporary tables or during // the process where a temporary table is converted over to being a // myisam table. // For sql_base.cc look at close_data_tables(). int ha_sphinx::close() { SPH_ENTER_METHOD(); SPH_RET ( free_share ( m_pShare ) ); } int ha_sphinx::HandleMysqlError ( MYSQL * pConn, int iErrCode ) { CSphSEThreadData * pTls = GetTls (); if ( pTls ) { strncpy ( pTls->m_tStats.m_sLastMessage, mysql_error ( pConn ), sizeof ( pTls->m_tStats.m_sLastMessage ) ); pTls->m_tStats.m_bLastError = true; } mysql_close ( pConn ); my_error ( iErrCode, MYF(0), pTls->m_tStats.m_sLastMessage ); return -1; } int ha_sphinx::extra ( enum ha_extra_function op ) { CSphSEThreadData * pTls = GetTls(); if ( pTls ) { if ( op==HA_EXTRA_WRITE_CAN_REPLACE ) pTls->m_bReplace = true; else if ( op==HA_EXTRA_WRITE_CANNOT_REPLACE ) pTls->m_bReplace = false; } return 0; } int ha_sphinx::write_row ( byte * ) { SPH_ENTER_METHOD(); if ( !m_pShare || !m_pShare->m_bSphinxQL ) SPH_RET ( HA_ERR_WRONG_COMMAND ); // SphinxQL inserts only, pretty much similar to abandoned federated char sQueryBuf[1024]; char sValueBuf[1024]; String sQuery ( sQueryBuf, sizeof(sQueryBuf), &my_charset_bin ); String sValue ( sValueBuf, sizeof(sQueryBuf), &my_charset_bin ); sQuery.length ( 0 ); sValue.length ( 0 ); CSphSEThreadData * pTls = GetTls (); sQuery.append ( pTls && pTls->m_bReplace ? "REPLACE INTO " : "INSERT INTO " ); sQuery.append ( m_pShare->m_sIndex ); sQuery.append ( " (" ); for ( Field ** ppField = table->field; *ppField; ppField++ ) { sQuery.append ( (*ppField)->field_name ); if ( ppField[1] ) sQuery.append ( ", " ); } sQuery.append ( ") VALUES (" ); for ( Field ** ppField = table->field; *ppField; ppField++ ) { if ( (*ppField)->is_null() ) { sQuery.append ( "''" ); } else { if ( (*ppField)->type()==MYSQL_TYPE_TIMESTAMP ) { Item_field * pWrap = new Item_field ( *ppField ); // autofreed by query arena, I assume Item_func_unix_timestamp * pConv = new Item_func_unix_timestamp ( pWrap ); pConv->quick_fix_field(); unsigned int uTs = (unsigned int) pConv->val_int(); snprintf ( sValueBuf, sizeof(sValueBuf), "'%u'", uTs ); sQuery.append ( sValueBuf ); } else { (*ppField)->val_str ( &sValue ); sQuery.append ( "'" ); sValue.print ( &sQuery ); sQuery.append ( "'" ); sValue.length(0); } } if ( ppField[1] ) sQuery.append ( ", " ); } sQuery.append ( ")" ); // FIXME? pretty inefficient to reconnect every time under high load, // but this was intentionally written for a low load scenario.. MYSQL * pConn = mysql_init ( NULL ); if ( !pConn ) SPH_RET ( ER_OUT_OF_RESOURCES ); unsigned int uTimeout = 1; mysql_options ( pConn, MYSQL_OPT_CONNECT_TIMEOUT, (const char*)&uTimeout ); if ( !mysql_real_connect ( pConn, m_pShare->m_sHost, "root", "", "", m_pShare->m_iPort, m_pShare->m_sSocket, 0 ) ) SPH_RET ( HandleMysqlError ( pConn, ER_CONNECT_TO_FOREIGN_DATA_SOURCE ) ); if ( mysql_real_query ( pConn, sQuery.ptr(), sQuery.length() ) ) SPH_RET ( HandleMysqlError ( pConn, ER_QUERY_ON_FOREIGN_DATA_SOURCE ) ); // all ok! mysql_close ( pConn ); SPH_RET(0); } static inline bool IsIntegerFieldType ( enum_field_types eType ) { return eType==MYSQL_TYPE_LONG || eType==MYSQL_TYPE_LONGLONG; } static inline bool IsIDField ( Field * pField ) { enum_field_types eType = pField->type(); if ( eType==MYSQL_TYPE_LONGLONG ) return true; if ( eType==MYSQL_TYPE_LONG && ((Field_num*)pField)->unsigned_flag ) return true; return false; } int ha_sphinx::delete_row ( const byte * ) { SPH_ENTER_METHOD(); if ( !m_pShare || !m_pShare->m_bSphinxQL ) SPH_RET ( HA_ERR_WRONG_COMMAND ); char sQueryBuf[1024]; String sQuery ( sQueryBuf, sizeof(sQueryBuf), &my_charset_bin ); sQuery.length ( 0 ); sQuery.append ( "DELETE FROM " ); sQuery.append ( m_pShare->m_sIndex ); sQuery.append ( " WHERE id=" ); char sValue[32]; snprintf ( sValue, sizeof(sValue), "%lld", table->field[0]->val_int() ); sQuery.append ( sValue ); // FIXME? pretty inefficient to reconnect every time under high load, // but this was intentionally written for a low load scenario.. MYSQL * pConn = mysql_init ( NULL ); if ( !pConn ) SPH_RET ( ER_OUT_OF_RESOURCES ); unsigned int uTimeout = 1; mysql_options ( pConn, MYSQL_OPT_CONNECT_TIMEOUT, (const char*)&uTimeout ); if ( !mysql_real_connect ( pConn, m_pShare->m_sHost, "root", "", "", m_pShare->m_iPort, m_pShare->m_sSocket, 0 ) ) SPH_RET ( HandleMysqlError ( pConn, ER_CONNECT_TO_FOREIGN_DATA_SOURCE ) ); if ( mysql_real_query ( pConn, sQuery.ptr(), sQuery.length() ) ) SPH_RET ( HandleMysqlError ( pConn, ER_QUERY_ON_FOREIGN_DATA_SOURCE ) ); // all ok! mysql_close ( pConn ); SPH_RET(0); } int ha_sphinx::update_row ( const byte *, byte * ) { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_WRONG_COMMAND ); } // keynr is key (index) number // sorted is 1 if result MUST be sorted according to index int ha_sphinx::index_init ( uint keynr, bool ) { SPH_ENTER_METHOD(); active_index = keynr; CSphSEThreadData * pTls = GetTls(); if ( pTls ) pTls->m_bCondDone = false; SPH_RET(0); } int ha_sphinx::index_end() { SPH_ENTER_METHOD(); SPH_RET(0); } bool ha_sphinx::CheckResponcePtr ( int iLen ) { if ( m_pCur+iLen>m_pResponseEnd ) { m_pCur = m_pResponseEnd; m_bUnpackError = true; return false; } return true; } uint32 ha_sphinx::UnpackDword () { if ( !CheckResponcePtr ( sizeof(uint32) ) ) // NOLINT { return 0; } uint32 uRes = ntohl ( sphUnalignedRead ( *(uint32*)m_pCur ) ); m_pCur += sizeof(uint32); // NOLINT return uRes; } char * ha_sphinx::UnpackString () { uint32 iLen = UnpackDword (); if ( !iLen ) return NULL; if ( !CheckResponcePtr ( iLen ) ) { return NULL; } char * sRes = new char [ 1+iLen ]; memcpy ( sRes, m_pCur, iLen ); sRes[iLen] = '\0'; m_pCur += iLen; return sRes; } static inline const char * FixNull ( const char * s ) { return s ? s : "(null)"; } bool ha_sphinx::UnpackSchema () { SPH_ENTER_METHOD(); // cleanup if ( m_dFields ) for ( int i=0; i<(int)m_iFields; i++ ) SafeDeleteArray ( m_dFields[i] ); SafeDeleteArray ( m_dFields ); // unpack network packet uint32 uStatus = UnpackDword (); char * sMessage = NULL; if ( uStatus!=SEARCHD_OK ) { sMessage = UnpackString (); CSphSEThreadData * pTls = GetTls (); if ( pTls ) { strncpy ( pTls->m_tStats.m_sLastMessage, sMessage, sizeof(pTls->m_tStats.m_sLastMessage) ); pTls->m_tStats.m_bLastError = ( uStatus==SEARCHD_ERROR ); } if ( uStatus==SEARCHD_ERROR ) { char sError[1024]; my_snprintf ( sError, sizeof(sError), "searchd error: %s", sMessage ); my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), sError ); SafeDeleteArray ( sMessage ); SPH_RET ( false ); } } m_iFields = UnpackDword (); m_dFields = new char * [ m_iFields ]; if ( !m_dFields ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: UnpackSchema() failed (fields alloc error)" ); SPH_RET(false); } for ( uint32 i=0; im_iTableFields; j++ ) { const char * sTableField = m_pShare->m_sTableField[j]; const char * sAttrField = m_dAttrs[i].m_sName; if ( m_dAttrs[i].m_sName[0]=='@' ) { const char * sAtPrefix = "_sph_"; if ( strncmp ( sTableField, sAtPrefix, strlen(sAtPrefix) ) ) continue; sTableField += strlen(sAtPrefix); sAttrField++; } if ( !strcasecmp ( sAttrField, sTableField ) ) { // we're almost good, but // let's enforce that timestamp columns can only receive timestamp attributes if ( m_pShare->m_eTableFieldType[j]!=MYSQL_TYPE_TIMESTAMP || m_dAttrs[i].m_uType==SPH_ATTR_TIMESTAMP ) m_dAttrs[i].m_iField = j; break; } } } m_iMatchesTotal = UnpackDword (); m_bId64 = UnpackDword (); if ( m_bId64 && m_pShare->m_eTableFieldType[0]!=MYSQL_TYPE_LONGLONG ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: 1st column must be bigint to accept 64-bit DOCIDs" ); SPH_RET(false); } // network packet unpacked; build unbound fields map SafeDeleteArray ( m_dUnboundFields ); m_dUnboundFields = new int [ m_pShare->m_iTableFields ]; for ( int i=0; im_iTableFields; i++ ) { if ( im_eTableFieldType[i]==MYSQL_TYPE_TIMESTAMP ) m_dUnboundFields[i] = SPH_ATTR_TIMESTAMP; else m_dUnboundFields[i] = SPH_ATTR_INTEGER; } for ( uint32 i=0; i=0 ) m_dUnboundFields [ m_dAttrs[i].m_iField ] = SPH_ATTR_NONE; if ( m_bUnpackError ) my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: UnpackSchema() failed (unpack error)" ); SPH_RET ( !m_bUnpackError ); } bool ha_sphinx::UnpackStats ( CSphSEStats * pStats ) { assert ( pStats ); char * pCurSave = m_pCur; for ( uint i=0; im_iMatchesTotal = UnpackDword (); pStats->m_iMatchesFound = UnpackDword (); pStats->m_iQueryMsec = UnpackDword (); pStats->m_iWords = UnpackDword (); if ( m_bUnpackError ) return false; SafeDeleteArray ( pStats->m_dWords ); if ( pStats->m_iWords<0 || pStats->m_iWords>=SPHINXSE_MAX_KEYWORDSTATS ) return false; pStats->m_dWords = new CSphSEWordStats [ pStats->m_iWords ]; if ( !pStats->m_dWords ) return false; for ( int i=0; im_iWords; i++ ) { CSphSEWordStats & tWord = pStats->m_dWords[i]; tWord.m_sWord = UnpackString (); tWord.m_iDocs = UnpackDword (); tWord.m_iHits = UnpackDword (); } if ( m_bUnpackError ) return false; m_pCur = pCurSave; return true; } /// condition pushdown implementation, to properly intercept WHERE clauses on my columns const COND * ha_sphinx::cond_push ( const COND * cond ) { // catch the simplest case: query_column="some text" for ( ;; ) { if ( cond->type()!=COND::FUNC_ITEM ) break; Item_func * condf = (Item_func *)cond; if ( condf->functype()!=Item_func::EQ_FUNC || condf->argument_count()!=2 ) break; // get my tls CSphSEThreadData * pTls = GetTls (); if ( !pTls ) break; Item ** args = condf->arguments(); if ( !m_pShare->m_bSphinxQL ) { // on non-QL tables, intercept query=value condition for SELECT if (!( args[0]->type()==COND::FIELD_ITEM && args[1]->type()==COND::STRING_ITEM )) break; Item_field * pField = (Item_field *) args[0]; if ( pField->field->field_index!=2 ) // FIXME! magic key index break; // copy the query, and let know that we intercepted this condition Item_string * pString = (Item_string *) args[1]; pTls->m_bQuery = true; strncpy ( pTls->m_sQuery, pString->str_value.c_ptr(), sizeof(pTls->m_sQuery) ); pTls->m_sQuery[sizeof(pTls->m_sQuery)-1] = '\0'; pTls->m_pQueryCharset = pString->str_value.charset(); } else { if (!( args[0]->type()==COND::FIELD_ITEM && args[1]->type()==COND::INT_ITEM )) break; // on QL tables, intercept id=value condition for DELETE Item_field * pField = (Item_field *) args[0]; if ( pField->field->field_index!=0 ) // FIXME! magic key index break; Item_int * pVal = (Item_int *) args[1]; pTls->m_iCondId = pVal->val_int(); pTls->m_bCondId = true; } // we intercepted this condition return NULL; } // don't change anything return cond; } /// condition popup void ha_sphinx::cond_pop () { CSphSEThreadData * pTls = GetTls (); if ( pTls ) pTls->m_bQuery = false; } /// get TLS (maybe allocate it, too) CSphSEThreadData * ha_sphinx::GetTls() { // where do we store that pointer in today's version? CSphSEThreadData ** ppTls; #if MYSQL_VERSION_ID>50100 ppTls = (CSphSEThreadData**) thd_ha_data ( table->in_use, ht ); #else ppTls = (CSphSEThreadData**) ¤t_thd->ha_data[sphinx_hton.slot]; #endif // >50100 // allocate if needed if ( !*ppTls ) *ppTls = new CSphSEThreadData (); // errors will be handled by caller return *ppTls; } // Positions an index cursor to the index specified in the handle. Fetches the // row if available. If the key value is null, begin at the first key of the // index. int ha_sphinx::index_read ( byte * buf, const byte * key, uint key_len, enum ha_rkey_function ) { SPH_ENTER_METHOD(); char sError[256]; // set new data for thd->ha_data, it is used in show_status CSphSEThreadData * pTls = GetTls(); if ( !pTls ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: TLS malloc() failed" ); SPH_RET ( HA_ERR_END_OF_FILE ); } pTls->m_tStats.Reset (); // sphinxql table, just return the key once if ( m_pShare->m_bSphinxQL ) { // over and out if ( pTls->m_bCondDone ) SPH_RET ( HA_ERR_END_OF_FILE ); // return a value from pushdown, if any if ( pTls->m_bCondId ) { table->field[0]->store ( pTls->m_iCondId, 1 ); pTls->m_bCondDone = true; SPH_RET(0); } // return a value from key longlong iRef = 0; if ( key_len==4 ) iRef = uint4korr ( key ); else if ( key_len==8 ) iRef = uint8korr ( key ); else { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: unexpected key length" ); SPH_RET ( HA_ERR_END_OF_FILE ); } table->field[0]->store ( iRef, 1 ); pTls->m_bCondDone = true; SPH_RET(0); } // parse query if ( pTls->m_bQuery ) { // we have a query from condition pushdown m_pCurrentKey = (const byte *) pTls->m_sQuery; m_iCurrentKeyLen = strlen(pTls->m_sQuery); } else { // just use the key (might be truncated) m_pCurrentKey = key+HA_KEY_BLOB_LENGTH; m_iCurrentKeyLen = uint2korr(key); // or maybe key_len? pTls->m_pQueryCharset = m_pShare ? m_pShare->m_pTableQueryCharset : NULL; } CSphSEQuery q ( (const char*)m_pCurrentKey, m_iCurrentKeyLen, m_pShare->m_sIndex ); if ( !q.Parse () ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), q.m_sParseError ); SPH_RET ( HA_ERR_END_OF_FILE ); } // do connect int iSocket = ConnectAPI ( q.m_sHost, q.m_iPort ); if ( iSocket<0 ) SPH_RET ( HA_ERR_END_OF_FILE ); // my buffer char * pBuffer; // will be free by CSphSEQuery dtor; do NOT free manually int iReqLen = q.BuildRequest ( &pBuffer ); if ( iReqLen<=0 ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: q.BuildRequest() failed" ); SPH_RET ( HA_ERR_END_OF_FILE ); } // send request ::send ( iSocket, pBuffer, iReqLen, 0 ); // receive reply char sHeader[8]; int iGot = ::recv ( iSocket, sHeader, sizeof(sHeader), RECV_FLAGS ); if ( iGot!=sizeof(sHeader) ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "failed to receive response header (searchd went away?)" ); SPH_RET ( HA_ERR_END_OF_FILE ); } short int uRespStatus = ntohs ( sphUnalignedRead ( *(short int*)( &sHeader[0] ) ) ); short int uRespVersion = ntohs ( sphUnalignedRead ( *(short int*)( &sHeader[2] ) ) ); uint uRespLength = ntohl ( sphUnalignedRead ( *(uint *)( &sHeader[4] ) ) ); SPH_DEBUG ( "got response header (status=%d version=%d length=%d)", uRespStatus, uRespVersion, uRespLength ); SafeDeleteArray ( m_pResponse ); if ( uRespLength<=SPHINXSE_MAX_ALLOC ) m_pResponse = new char [ uRespLength+1 ]; if ( !m_pResponse ) { my_snprintf ( sError, sizeof(sError), "bad searchd response length (length=%u)", uRespLength ); my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), sError ); SPH_RET ( HA_ERR_END_OF_FILE ); } int iRecvLength = 0; while ( iRecvLength<(int)uRespLength ) { int iRecv = ::recv ( iSocket, m_pResponse+iRecvLength, uRespLength-iRecvLength, RECV_FLAGS ); if ( iRecv<0 ) break; iRecvLength += iRecv; } ::closesocket ( iSocket ); iSocket = -1; if ( iRecvLength!=(int)uRespLength ) { my_snprintf ( sError, sizeof(sError), "net read error (expected=%d, got=%d)", uRespLength, iRecvLength ); my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), sError ); SPH_RET ( HA_ERR_END_OF_FILE ); } // we'll have a message, at least pTls->m_bStats = true; // parse reply m_iCurrentPos = 0; m_pCur = m_pResponse; m_pResponseEnd = m_pResponse + uRespLength; m_bUnpackError = false; if ( uRespStatus!=SEARCHD_OK ) { char * sMessage = UnpackString (); if ( !sMessage ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "no valid response from searchd (status=%d, resplen=%d)", uRespStatus, uRespLength ); SPH_RET ( HA_ERR_END_OF_FILE ); } strncpy ( pTls->m_tStats.m_sLastMessage, sMessage, sizeof(pTls->m_tStats.m_sLastMessage) ); SafeDeleteArray ( sMessage ); if ( uRespStatus!=SEARCHD_WARNING ) { my_snprintf ( sError, sizeof(sError), "searchd error: %s", pTls->m_tStats.m_sLastMessage ); my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), sError ); pTls->m_tStats.m_bLastError = true; SPH_RET ( HA_ERR_END_OF_FILE ); } } if ( !UnpackSchema () ) SPH_RET ( HA_ERR_END_OF_FILE ); if ( !UnpackStats ( &pTls->m_tStats ) ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: UnpackStats() failed" ); SPH_RET ( HA_ERR_END_OF_FILE ); } SPH_RET ( get_rec ( buf, key, key_len ) ); } // Positions an index cursor to the index specified in key. Fetches the // row if any. This is only used to read whole keys. int ha_sphinx::index_read_idx ( byte *, uint, const byte *, uint, enum ha_rkey_function ) { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_WRONG_COMMAND ); } // Used to read forward through the index. int ha_sphinx::index_next ( byte * buf ) { SPH_ENTER_METHOD(); SPH_RET ( get_rec ( buf, m_pCurrentKey, m_iCurrentKeyLen ) ); } int ha_sphinx::index_next_same ( byte * buf, const byte * key, uint keylen ) { SPH_ENTER_METHOD(); SPH_RET ( get_rec ( buf, key, keylen ) ); } int ha_sphinx::get_rec ( byte * buf, const byte *, uint ) { SPH_ENTER_METHOD(); if ( m_iCurrentPos>=m_iMatchesTotal ) { SafeDeleteArray ( m_pResponse ); SPH_RET ( HA_ERR_END_OF_FILE ); } #if MYSQL_VERSION_ID>50100 my_bitmap_map * org_bitmap = dbug_tmp_use_all_columns ( table, table->write_set ); #endif Field ** field = table->field; // unpack and return the match longlong uMatchID = UnpackDword (); if ( m_bId64 ) uMatchID = ( uMatchID<<32 ) + UnpackDword(); uint32 uMatchWeight = UnpackDword (); field[0]->store ( uMatchID, 1 ); field[1]->store ( uMatchWeight, 1 ); field[2]->store ( (const char*)m_pCurrentKey, m_iCurrentKeyLen, &my_charset_bin ); for ( uint32 i=0; i0 && !m_bUnpackError; uValue-- ) UnpackDword(); continue; } Field * af = field [ m_dAttrs[i].m_iField ]; switch ( m_dAttrs[i].m_uType ) { case SPH_ATTR_INTEGER: case SPH_ATTR_ORDINAL: case SPH_ATTR_BOOL: af->store ( uValue, 1 ); break; case SPH_ATTR_FLOAT: af->store ( sphDW2F(uValue) ); break; case SPH_ATTR_TIMESTAMP: if ( af->type()==MYSQL_TYPE_TIMESTAMP ) longstore ( af->ptr, uValue ); // because store() does not accept timestamps else af->store ( uValue, 1 ); break; case SPH_ATTR_BIGINT: af->store ( iValue64, 0 ); break; case SPH_ATTR_STRING: if ( !uValue ) af->store ( "", 0, &my_charset_bin ); else if ( CheckResponcePtr ( uValue ) ) { af->store ( m_pCur, uValue, &my_charset_bin ); m_pCur += uValue; } break; case SPH_ATTR_UINT64SET: case SPH_ATTR_UINT32SET : if ( uValue<=0 ) { // shortcut, empty MVA set af->store ( "", 0, &my_charset_bin ); } else { // convert MVA set to comma-separated string char sBuf[1024]; // FIXME! magic size char * pCur = sBuf; if ( m_dAttrs[i].m_uType==SPH_ATTR_UINT32SET ) { for ( ; uValue>0 && !m_bUnpackError; uValue-- ) { uint32 uEntry = UnpackDword (); if ( pCur < sBuf+sizeof(sBuf)-16 ) // 10 chars per 32bit value plus some safety bytes { snprintf ( pCur, sBuf+sizeof(sBuf)-pCur, "%u", uEntry ); while ( *pCur ) *pCur++; if ( uValue>1 ) *pCur++ = ','; // non-trailing commas } } } else { for ( ; uValue>0 && !m_bUnpackError; uValue-=2 ) { uint64 uEntry = UnpackDword (); uEntry = ( uEntry<<32 ) | UnpackDword(); if ( pCur < sBuf+sizeof(sBuf)-24 ) // 20 chars per 64bit value plus some safety bytes { snprintf ( pCur, sBuf+sizeof(sBuf)-pCur, "%llu", uEntry ); while ( *pCur ) *pCur++; if ( uValue>2 ) *pCur++ = ','; // non-trailing commas } } } af->store ( sBuf, pCur-sBuf, &my_charset_bin ); } break; default: my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: unhandled attr type" ); SafeDeleteArray ( m_pResponse ); SPH_RET ( HA_ERR_END_OF_FILE ); } } if ( m_bUnpackError ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: response unpacker failed" ); SafeDeleteArray ( m_pResponse ); SPH_RET ( HA_ERR_END_OF_FILE ); } // zero out unmapped fields for ( int i=SPHINXSE_SYSTEM_COLUMNS; i<(int)table->s->fields; i++ ) if ( m_dUnboundFields[i]!=SPH_ATTR_NONE ) switch ( m_dUnboundFields[i] ) { case SPH_ATTR_INTEGER: table->field[i]->store ( 0, 1 ); break; case SPH_ATTR_TIMESTAMP: longstore ( table->field[i]->ptr, 0 ); break; default: my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: unhandled unbound field type %d", m_dUnboundFields[i] ); SafeDeleteArray ( m_pResponse ); SPH_RET ( HA_ERR_END_OF_FILE ); } memset ( buf, 0, table->s->null_bytes ); m_iCurrentPos++; #if MYSQL_VERSION_ID > 50100 dbug_tmp_restore_column_map ( table->write_set, org_bitmap ); #endif SPH_RET(0); } // Used to read backwards through the index. int ha_sphinx::index_prev ( byte * ) { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_WRONG_COMMAND ); } // index_first() asks for the first key in the index. // // Called from opt_range.cc, opt_sum.cc, sql_handler.cc, // and sql_select.cc. int ha_sphinx::index_first ( byte * ) { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_END_OF_FILE ); } // index_last() asks for the last key in the index. // // Called from opt_range.cc, opt_sum.cc, sql_handler.cc, // and sql_select.cc. int ha_sphinx::index_last ( byte * ) { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_WRONG_COMMAND ); } int ha_sphinx::rnd_init ( bool ) { SPH_ENTER_METHOD(); SPH_RET(0); } int ha_sphinx::rnd_end() { SPH_ENTER_METHOD(); SPH_RET(0); } int ha_sphinx::rnd_next ( byte * ) { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_END_OF_FILE ); } void ha_sphinx::position ( const byte * ) { SPH_ENTER_METHOD(); SPH_VOID_RET(); } // This is like rnd_next, but you are given a position to use // to determine the row. The position will be of the type that you stored in // ref. You can use ha_get_ptr(pos,ref_length) to retrieve whatever key // or position you saved when position() was called. // Called from filesort.cc records.cc sql_insert.cc sql_select.cc sql_update.cc. int ha_sphinx::rnd_pos ( byte *, byte * ) { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_WRONG_COMMAND ); } #if MYSQL_VERSION_ID>=50030 int ha_sphinx::info ( uint ) #else void ha_sphinx::info ( uint ) #endif { SPH_ENTER_METHOD(); if ( table->s->keys>0 ) table->key_info[0].rec_per_key[0] = 1; #if MYSQL_VERSION_ID>50100 stats.records = 20; #else records = 20; #endif #if MYSQL_VERSION_ID>=50030 SPH_RET(0); #else SPH_VOID_RET(); #endif } int ha_sphinx::reset () { SPH_ENTER_METHOD(); CSphSEThreadData * pTls = GetTls (); if ( pTls ) pTls->m_bQuery = false; SPH_RET(0); } int ha_sphinx::delete_all_rows() { SPH_ENTER_METHOD(); SPH_RET ( HA_ERR_WRONG_COMMAND ); } // First you should go read the section "locking functions for mysql" in // lock.cc to understand this. // This create a lock on the table. If you are implementing a storage engine // that can handle transacations look at ha_berkely.cc to see how you will // want to go about doing this. Otherwise you should consider calling flock() // here. // // Called from lock.cc by lock_external() and unlock_external(). Also called // from sql_table.cc by copy_data_between_tables(). int ha_sphinx::external_lock ( THD *, int ) { SPH_ENTER_METHOD(); SPH_RET(0); } THR_LOCK_DATA ** ha_sphinx::store_lock ( THD *, THR_LOCK_DATA ** to, enum thr_lock_type lock_type ) { SPH_ENTER_METHOD(); if ( lock_type!=TL_IGNORE && m_tLock.type==TL_UNLOCK ) m_tLock.type = lock_type; *to++ = &m_tLock; SPH_RET(to); } int ha_sphinx::delete_table ( const char * ) { SPH_ENTER_METHOD(); SPH_RET(0); } // Renames a table from one name to another from alter table call. // // If you do not implement this, the default rename_table() is called from // handler.cc and it will delete all files with the file extentions returned // by bas_ext(). // // Called from sql_table.cc by mysql_rename_table(). int ha_sphinx::rename_table ( const char *, const char * ) { SPH_ENTER_METHOD(); SPH_RET(0); } // Given a starting key, and an ending key estimate the number of rows that // will exist between the two. end_key may be empty which in case determine // if start_key matches any rows. // // Called from opt_range.cc by check_quick_keys(). ha_rows ha_sphinx::records_in_range ( uint, key_range *, key_range * ) { SPH_ENTER_METHOD(); SPH_RET(3); // low number to force index usage } // create() is called to create a database. The variable name will have the name // of the table. When create() is called you do not need to worry about opening // the table. Also, the FRM file will have already been created so adjusting // create_info will not do you any good. You can overwrite the frm file at this // point if you wish to change the table definition, but there are no methods // currently provided for doing that. // // Called from handle.cc by ha_create_table(). int ha_sphinx::create ( const char * name, TABLE * table, HA_CREATE_INFO * ) { SPH_ENTER_METHOD(); char sError[256]; CSphSEShare tInfo; if ( !ParseUrl ( &tInfo, table, true ) ) SPH_RET(-1); // check SphinxAPI table for ( ; !tInfo.m_bSphinxQL; ) { // check system fields (count and types) if ( table->s->fieldsfield[0] ) ) { my_snprintf ( sError, sizeof(sError), "%s: 1st column (docid) MUST be unsigned integer or bigint", name ); break; } if ( !IsIntegerFieldType ( table->field[1]->type() ) ) { my_snprintf ( sError, sizeof(sError), "%s: 2nd column (weight) MUST be integer or bigint", name ); break; } enum_field_types f2 = table->field[2]->type(); if ( f2!=MYSQL_TYPE_VARCHAR && f2!=MYSQL_TYPE_BLOB && f2!=MYSQL_TYPE_MEDIUM_BLOB && f2!=MYSQL_TYPE_LONG_BLOB && f2!=MYSQL_TYPE_TINY_BLOB ) { my_snprintf ( sError, sizeof(sError), "%s: 3rd column (search query) MUST be varchar or text", name ); break; } // check attributes int i; for ( i=3; i<(int)table->s->fields; i++ ) { enum_field_types eType = table->field[i]->type(); if ( eType!=MYSQL_TYPE_TIMESTAMP && !IsIntegerFieldType(eType) && eType!=MYSQL_TYPE_VARCHAR && eType!=MYSQL_TYPE_FLOAT ) { my_snprintf ( sError, sizeof(sError), "%s: %dth column (attribute %s) MUST be integer, bigint, timestamp, varchar, or float", name, i+1, table->field[i]->field_name ); break; } } if ( i!=(int)table->s->fields ) break; // check index if ( table->s->keys!=1 || table->key_info[0].key_parts!=1 || strcasecmp ( table->key_info[0].key_part[0].field->field_name, table->field[2]->field_name ) ) { my_snprintf ( sError, sizeof(sError), "%s: there must be an index on '%s' column", name, table->field[2]->field_name ); break; } // all good sError[0] = '\0'; break; } // check SphinxQL table for ( ; tInfo.m_bSphinxQL; ) { sError[0] = '\0'; // check that 1st column is id, is of int type, and has an index if ( strcmp ( table->field[0]->field_name, "id" ) ) { my_snprintf ( sError, sizeof(sError), "%s: 1st column must be called 'id'", name ); break; } if ( !IsIDField ( table->field[0] ) ) { my_snprintf ( sError, sizeof(sError), "%s: 'id' column must be INT UNSIGNED or BIGINT", name ); break; } // check index if ( table->s->keys!=1 || table->key_info[0].key_parts!=1 || strcasecmp ( table->key_info[0].key_part[0].field->field_name, "id" ) ) { my_snprintf ( sError, sizeof(sError), "%s: 'id' column must be indexed", name ); break; } // check column types for ( int i=1; i<(int)table->s->fields; i++ ) { enum_field_types eType = table->field[i]->type(); if ( eType!=MYSQL_TYPE_TIMESTAMP && !IsIntegerFieldType(eType) && eType!=MYSQL_TYPE_VARCHAR && eType!=MYSQL_TYPE_FLOAT ) { my_snprintf ( sError, sizeof(sError), "%s: column %s is of unsupported type (use int/bigint/timestamp/varchar/float)", name, i+1, table->field[i]->field_name ); break; } } if ( sError[0] ) break; // all good break; } // report and bail if ( sError[0] ) { my_error ( ER_CANT_CREATE_TABLE, MYF(0), sError, -1 ); SPH_RET(-1); } SPH_RET(0); } // show functions #if MYSQL_VERSION_ID<50100 #define SHOW_VAR_FUNC_BUFF_SIZE 1024 #endif CSphSEStats * sphinx_get_stats ( THD * thd, SHOW_VAR * out ) { #if MYSQL_VERSION_ID>50100 if ( sphinx_hton_ptr ) { CSphSEThreadData *pTls = (CSphSEThreadData *) *thd_ha_data ( thd, sphinx_hton_ptr ); if ( pTls && pTls->m_bStats ) return &pTls->m_tStats; } #else CSphSEThreadData *pTls = (CSphSEThreadData *) thd->ha_data[sphinx_hton.slot]; if ( pTls && pTls->m_bStats ) return &pTls->m_tStats; #endif out->type = SHOW_CHAR; out->value = ""; return 0; } int sphinx_showfunc_total ( THD * thd, SHOW_VAR * out, char * ) { CSphSEStats * pStats = sphinx_get_stats ( thd, out ); if ( pStats ) { out->type = SHOW_INT; out->value = (char *) &pStats->m_iMatchesTotal; } return 0; } int sphinx_showfunc_total_found ( THD * thd, SHOW_VAR * out, char * ) { CSphSEStats * pStats = sphinx_get_stats ( thd, out ); if ( pStats ) { out->type = SHOW_INT; out->value = (char *) &pStats->m_iMatchesFound; } return 0; } int sphinx_showfunc_time ( THD * thd, SHOW_VAR * out, char * ) { CSphSEStats * pStats = sphinx_get_stats ( thd, out ); if ( pStats ) { out->type = SHOW_INT; out->value = (char *) &pStats->m_iQueryMsec; } return 0; } int sphinx_showfunc_word_count ( THD * thd, SHOW_VAR * out, char * ) { CSphSEStats * pStats = sphinx_get_stats ( thd, out ); if ( pStats ) { out->type = SHOW_INT; out->value = (char *) &pStats->m_iWords; } return 0; } int sphinx_showfunc_words ( THD * thd, SHOW_VAR * out, char * sBuffer ) { #if MYSQL_VERSION_ID>50100 if ( sphinx_hton_ptr ) { CSphSEThreadData * pTls = (CSphSEThreadData *) *thd_ha_data ( thd, sphinx_hton_ptr ); #else { CSphSEThreadData * pTls = (CSphSEThreadData *) thd->ha_data[sphinx_hton.slot]; #endif if ( pTls && pTls->m_bStats ) { CSphSEStats * pStats = &pTls->m_tStats; if ( pStats && pStats->m_iWords ) { uint uBuffLen = 0; out->type = SHOW_CHAR; out->value = sBuffer; // the following is partially based on code in sphinx_show_status() sBuffer[0] = 0; for ( int i=0; im_iWords; i++ ) { CSphSEWordStats & tWord = pStats->m_dWords[i]; uBuffLen = my_snprintf ( sBuffer, SHOW_VAR_FUNC_BUFF_SIZE, "%s%s:%d:%d ", sBuffer, tWord.m_sWord, tWord.m_iDocs, tWord.m_iHits ); } if ( uBuffLen > 0 ) { // trim last space sBuffer [ --uBuffLen ] = 0; if ( pTls->m_pQueryCharset ) { // String::c_ptr() will nul-terminate the buffer. // // NOTE: It's not entirely clear whether this conversion is necessary at all. String sConvert; uint iErrors; sConvert.copy ( sBuffer, uBuffLen, pTls->m_pQueryCharset, system_charset_info, &iErrors ); memcpy ( sBuffer, sConvert.c_ptr(), sConvert.length() + 1 ); } } return 0; } } } out->type = SHOW_CHAR; out->value = ""; return 0; } int sphinx_showfunc_error ( THD * thd, SHOW_VAR * out, char * ) { CSphSEStats * pStats = sphinx_get_stats ( thd, out ); if ( pStats && pStats->m_bLastError ) { out->type = SHOW_CHAR; out->value = pStats->m_sLastMessage; } return 0; } #if MYSQL_VERSION_ID>50100 struct st_mysql_storage_engine sphinx_storage_engine = { MYSQL_HANDLERTON_INTERFACE_VERSION }; struct st_mysql_show_var sphinx_status_vars[] = { {"sphinx_total", (char *)sphinx_showfunc_total, SHOW_FUNC}, {"sphinx_total_found", (char *)sphinx_showfunc_total_found, SHOW_FUNC}, {"sphinx_time", (char *)sphinx_showfunc_time, SHOW_FUNC}, {"sphinx_word_count", (char *)sphinx_showfunc_word_count, SHOW_FUNC}, {"sphinx_words", (char *)sphinx_showfunc_words, SHOW_FUNC}, {"sphinx_error", (char *)sphinx_showfunc_error, SHOW_FUNC}, {0, 0, (enum_mysql_show_type)0} }; mysql_declare_plugin(sphinx) { MYSQL_STORAGE_ENGINE_PLUGIN, &sphinx_storage_engine, sphinx_hton_name, "Sphinx developers", sphinx_hton_comment, PLUGIN_LICENSE_GPL, sphinx_init_func, // Plugin Init sphinx_done_func, // Plugin Deinit 0x0001, // 0.1 sphinx_status_vars, NULL, NULL } mysql_declare_plugin_end; #endif // >50100 // // $Id$ // coreseek-4.1-beta/csft-4.1/mysqlse/ha_sphinx.h100777 0 0 12322 11643565732 14330 0// // $Id$ // #ifdef USE_PRAGMA_INTERFACE #pragma interface // gcc class implementation #endif #if MYSQL_VERSION_ID>=50515 #define TABLE_ARG TABLE_SHARE #elif MYSQL_VERSION_ID>50100 #define TABLE_ARG st_table_share #else #define TABLE_ARG st_table #endif #if MYSQL_VERSION_ID>=50120 typedef uchar byte; #endif /// forward decls class THD; struct CSphReqQuery; struct CSphSEShare; struct CSphSEAttr; struct CSphSEStats; struct CSphSEThreadData; /// Sphinx SE handler class class ha_sphinx : public handler { protected: THR_LOCK_DATA m_tLock; ///< MySQL lock CSphSEShare * m_pShare; ///< shared lock info uint m_iMatchesTotal; uint m_iCurrentPos; const byte * m_pCurrentKey; uint m_iCurrentKeyLen; char * m_pResponse; ///< searchd response storage char * m_pResponseEnd; ///< searchd response storage end (points to wilderness!) char * m_pCur; ///< current position into response bool m_bUnpackError; ///< any errors while unpacking response public: #if MYSQL_VERSION_ID<50100 ha_sphinx ( TABLE_ARG * table_arg ); // NOLINT #else ha_sphinx ( handlerton * hton, TABLE_ARG * table_arg ); #endif ~ha_sphinx () {} const char * table_type () const { return "SPHINX"; } ///< SE name for display purposes const char * index_type ( uint ) { return "HASH"; } ///< index type name for display purposes const char ** bas_ext () const; ///< my file extensions #if MYSQL_VERSION_ID>50100 ulonglong table_flags () const { return HA_CAN_INDEX_BLOBS; } ///< bitmap of implemented flags (see handler.h for more info) #else ulong table_flags () const { return HA_CAN_INDEX_BLOBS; } ///< bitmap of implemented flags (see handler.h for more info) #endif ulong index_flags ( uint, uint, bool ) const { return 0; } ///< bitmap of flags that says how SE implements indexes uint max_supported_record_length () const { return HA_MAX_REC_LENGTH; } uint max_supported_keys () const { return 1; } uint max_supported_key_parts () const { return 1; } uint max_supported_key_length () const { return MAX_KEY_LENGTH; } uint max_supported_key_part_length () const { return MAX_KEY_LENGTH; } #if MYSQL_VERSION_ID>50100 virtual double scan_time () { return (double)( stats.records+stats.deleted )/20.0 + 10; } ///< called in test_quick_select to determine if indexes should be used #else virtual double scan_time () { return (double)( records+deleted )/20.0 + 10; } ///< called in test_quick_select to determine if indexes should be used #endif virtual double read_time ( ha_rows rows ) { return (double)rows/20.0 + 1; } ///< index read time estimate public: int open ( const char * name, int mode, uint test_if_locked ); int close (); int write_row ( byte * buf ); int update_row ( const byte * old_data, byte * new_data ); int delete_row ( const byte * buf ); int extra ( enum ha_extra_function op ); int index_init ( uint keynr, bool sorted ); // 5.1.x int index_init ( uint keynr ) { return index_init ( keynr, false ); } // 5.0.x int index_end (); int index_read ( byte * buf, const byte * key, uint key_len, enum ha_rkey_function find_flag ); int index_read_idx ( byte * buf, uint idx, const byte * key, uint key_len, enum ha_rkey_function find_flag ); int index_next ( byte * buf ); int index_next_same ( byte * buf, const byte * key, uint keylen ); int index_prev ( byte * buf ); int index_first ( byte * buf ); int index_last ( byte * buf ); int get_rec ( byte * buf, const byte * key, uint keylen ); int rnd_init ( bool scan ); int rnd_end (); int rnd_next ( byte * buf ); int rnd_pos ( byte * buf, byte * pos ); void position ( const byte * record ); #if MYSQL_VERSION_ID>=50030 int info ( uint ); #else void info ( uint ); #endif int reset(); int external_lock ( THD * thd, int lock_type ); int delete_all_rows (); ha_rows records_in_range ( uint inx, key_range * min_key, key_range * max_key ); int delete_table ( const char * from ); int rename_table ( const char * from, const char * to ); int create ( const char * name, TABLE * form, HA_CREATE_INFO * create_info ); THR_LOCK_DATA ** store_lock ( THD * thd, THR_LOCK_DATA ** to, enum thr_lock_type lock_type ); public: virtual const COND * cond_push ( const COND *cond ); virtual void cond_pop (); private: uint32 m_iFields; char ** m_dFields; uint32 m_iAttrs; CSphSEAttr * m_dAttrs; int m_bId64; int * m_dUnboundFields; private: int Connect ( const char * sQueryHost, ushort uPort ); int ConnectAPI ( const char * sQueryHost, int iQueryPort ); int HandleMysqlError ( struct st_mysql * pConn, int iErrCode ); uint32 UnpackDword (); char * UnpackString (); bool UnpackSchema (); bool UnpackStats ( CSphSEStats * pStats ); bool CheckResponcePtr ( int iLen ); CSphSEThreadData * GetTls (); }; #if MYSQL_VERSION_ID < 50100 bool sphinx_show_status ( THD * thd ); #endif int sphinx_showfunc_total_found ( THD *, SHOW_VAR *, char * ); int sphinx_showfunc_total ( THD *, SHOW_VAR *, char * ); int sphinx_showfunc_time ( THD *, SHOW_VAR *, char * ); int sphinx_showfunc_word_count ( THD *, SHOW_VAR *, char * ); int sphinx_showfunc_words ( THD *, SHOW_VAR *, char * ); // // $Id$ // coreseek-4.1-beta/csft-4.1/mysqlse/INSTALL100777 0 0 1613 11643565732 13210 0Building MySQL with SphinxSE ============================= Note: BUILD/autorun.sh step on Linux might malfunction with some versions of automake; autorun.sh will not fail but the build will. automake 1.9.6 is known to work. MySQL 5.0.x on Linux --------------------- tar zxvf mysql-5.0.91.tar.gz cp -R mysqlse mysql-5.0.91/sql/sphinx cd mysql-5.0.91 patch -p1 -i sql/sphinx/sphinx.5.0.91.diff sh BUILD/autorun.sh ./configure --with-sphinx-storage-engine make MySQL 5.1.x on Linux --------------------- tar zxvf mysql-5.1.47.tar.gz cp -R -p mysqlse mysql-5.1.47/storage/sphinx cd mysql-5.1.47 sh BUILD/autorun.sh ./configure --with-plugins=sphinx make MySQL 5.0.x on Windows ----------------------- tar zxvf mysql-5.0.91.tar.gz cp -R mysqlse mysql-5.0.91/sql/sphinx cd mysql-5.0.91 patch -p1 -i sql/sphinx/sphinx.5.0.91.diff win/configure.js WITH_SPHINX_STORAGE_ENGINE win/build-vs8 --eof-- coreseek-4.1-beta/csft-4.1/mysqlse/make-patch.sh100777 0 0 763 11643565732 14512 0#!/bin/sh OUT=$1 ORIG=$2 NEW=$3 if [ ! \( "$1" -a "$2" -a "$3" \) ]; then echo "$0 " exit 1 fi FILES=' /config/ac-macros/ha_sphinx.m4 /configure.in /libmysqld/Makefile.am /sql/handler.cc /sql/handler.h /sql/Makefile.am /sql/mysqld.cc /sql/mysql_priv.h /sql/set_var.cc /sql/sql_lex.h /sql/sql_parse.cc /sql/sql_yacc.yy /sql/structs.h /sql/sql_show.cc ' rm -f $OUT if [ -e $OUT ]; then exit 1 fi for name in $FILES; do diff -BNru "$ORIG$name" "$NEW$name" >> $OUT done coreseek-4.1-beta/csft-4.1/mysqlse/Makefile.am100777 0 0 4124 11643565732 14213 0# Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB # # 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, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA #called from the top level Makefile MYSQLDATAdir = $(localstatedir) MYSQLSHAREdir = $(pkgdatadir) MYSQLBASEdir= $(prefix) MYSQLLIBdir= $(pkglibdir) pkgplugindir = $(pkglibdir)/plugin INCLUDES = -I$(top_srcdir)/include -I$(top_builddir)/include \ -I$(top_srcdir)/regex \ -I$(top_srcdir)/sql \ -I$(srcdir) SUBDIRS = ../../include ../../mysys ../../strings ../../dbug ../../extra WRAPLIBS= LDADD = DEFS= @DEFS@ \ -D_REENTRANT -D_PTHREADS -DENGINE -DSTORAGE_ENGINE -DMYSQL_SERVER noinst_HEADERS = ha_sphinx.h EXTRA_LTLIBRARIES = ha_sphinx.la pkgplugin_LTLIBRARIES = @plugin_sphinx_shared_target@ sphinx.la ha_sphinx_la_LDFLAGS = -module -rpath $(MYSQLLIBdir) ha_sphinx_la_CXXFLAGS= $(AM_CFLAGS) -DMYSQL_DYNAMIC_PLUGIN ha_sphinx_la_CFLAGS = $(AM_CFLAGS) -DMYSQL_DYNAMIC_PLUGIN ha_sphinx_la_SOURCES = ha_sphinx.cc sphinx_la_LDFLAGS = -module sphinx_la_CXXFLAGS = $(AM_CFLAGS) -DMYSQL_DYNAMIC_PLUGIN sphinx_la_CFLAGS = $(AM_CFLAGS) -DMYSQL_DYNAMIC_PLUGIN sphinx_la_SOURCES = snippets_udf.cc EXTRA_LIBRARIES = libsphinx.a noinst_LIBRARIES = @plugin_sphinx_static_target@ libsphinx_a_CXXFLAGS = $(AM_CFLAGS) libsphinx_a_CFLAGS = $(AM_CFLAGS) libsphinx_a_SOURCES= ha_sphinx.cc EXTRA_DIST = cmakelists.txt # Don't update the files from bitkeeper %::SCCS/s.% coreseek-4.1-beta/csft-4.1/mysqlse/plug.in100777 0 0 372 11643565732 13437 0MYSQL_STORAGE_ENGINE(sphinx,, [Sphinx Storage Engine], [Sphinx Storage Engines], [max,max-no-ndb]) MYSQL_PLUGIN_DIRECTORY(sphinx, [storage/sphinx]) MYSQL_PLUGIN_STATIC(sphinx, [libsphinx.a]) MYSQL_PLUGIN_DYNAMIC(sphinx, [ha_sphinx.la]) coreseek-4.1-beta/csft-4.1/mysqlse/snippets_udf.cc100777 0 0 44313 11643565732 15215 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include #include #include #include #include #include #if MYSQL_VERSION_ID>50100 #include "mysql_priv.h" #include #else #include "../mysql_priv.h" #endif #include #include #if MYSQL_VERSION_ID>=50120 typedef uchar byte; #endif /// partially copy-pasted stuff that should be moved elsewhere #if UNALIGNED_RAM_ACCESS /// pass-through wrapper template < typename T > inline T sphUnalignedRead ( const T & tRef ) { return tRef; } /// pass-through wrapper template < typename T > void sphUnalignedWrite ( void * pPtr, const T & tVal ) { *(T*)pPtr = tVal; } #else /// unaligned read wrapper for some architectures (eg. SPARC) template < typename T > inline T sphUnalignedRead ( const T & tRef ) { T uTmp; byte * pSrc = (byte *) &tRef; byte * pDst = (byte *) &uTmp; for ( int i=0; i<(int)sizeof(T); i++ ) *pDst++ = *pSrc++; return uTmp; } /// unaligned write wrapper for some architectures (eg. SPARC) template < typename T > void sphUnalignedWrite ( void * pPtr, const T & tVal ) { byte * pDst = (byte *) pPtr; byte * pSrc = (byte *) &tVal; for ( int i=0; i<(int)sizeof(T); i++ ) *pDst++ = *pSrc++; } #endif #define SPHINXSE_MAX_ALLOC (16*1024*1024) #define SafeDelete(_arg) { if ( _arg ) delete ( _arg ); (_arg) = NULL; } #define SafeDeleteArray(_arg) { if ( _arg ) delete [] ( _arg ); (_arg) = NULL; } #define Min(a,b) ((a)<(b)?(a):(b)) typedef unsigned int DWORD; inline DWORD sphF2DW ( float f ) { union { float f; uint32 d; } u; u.f = f; return u.d; } static char * sphDup ( const char * sSrc, int iLen=-1 ) { if ( !sSrc ) return NULL; if ( iLen<0 ) iLen = strlen(sSrc); char * sRes = new char [ 1+iLen ]; memcpy ( sRes, sSrc, iLen ); sRes[iLen] = '\0'; return sRes; } static inline void sphShowErrno ( const char * sCall ) { char sError[256]; snprintf ( sError, sizeof(sError), "%s() failed: [%d] %s", sCall, errno, strerror(errno) ); my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), sError ); } static const bool sphReportErrors = true; static bool sphSend ( int iFd, const char * pBuffer, int iSize, bool bReportErrors = false ) { assert ( pBuffer ); assert ( iSize > 0 ); const int iResult = send ( iFd, pBuffer, iSize, 0 ); if ( iResult!=iSize ) { if ( bReportErrors ) sphShowErrno("send"); return false; } return true; } static bool sphRecv ( int iFd, char * pBuffer, int iSize, bool bReportErrors = false ) { assert ( pBuffer ); assert ( iSize > 0 ); while ( iSize ) { const int iResult = recv ( iFd, pBuffer, iSize, 0 ); if ( iResult > 0 ) { iSize -= iResult; pBuffer += iSize; } else if ( iResult==0 ) { if ( bReportErrors ) my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), "recv() failed: disconnected" ); return false; } else { if ( bReportErrors ) sphShowErrno("recv"); return false; } } return true; } enum { SPHINX_SEARCHD_PROTO = 1, SEARCHD_COMMAND_EXCERPT = 1, VER_COMMAND_EXCERPT = 0x103, }; /// known answers enum { SEARCHD_OK = 0, ///< general success, command-specific reply follows SEARCHD_ERROR = 1, ///< general failure, error message follows SEARCHD_RETRY = 2, ///< temporary failure, error message follows, client should retry later SEARCHD_WARNING = 3 ///< general success, warning message and command-specific reply follow }; #define SPHINXSE_DEFAULT_SCHEME "sphinx" #define SPHINXSE_DEFAULT_HOST "127.0.0.1" #define SPHINXSE_DEFAULT_PORT 9312 #define SPHINXSE_DEFAULT_INDEX "*" class CSphBuffer { private: bool m_bOverrun; int m_iSize; int m_iLeft; char * m_pBuffer; char * m_pCurrent; public: explicit CSphBuffer ( const int iSize ) : m_bOverrun ( false ) , m_iSize ( iSize ) , m_iLeft ( iSize ) { assert ( iSize > 0 ); m_pBuffer = new char[iSize]; m_pCurrent = m_pBuffer; } ~CSphBuffer () { SafeDeleteArray ( m_pBuffer ); } const char * Ptr() const { return m_pBuffer; } bool Finalize() { return !( m_bOverrun || m_iLeft!=0 || ( m_pCurrent - m_pBuffer )!=m_iSize ); } void SendBytes ( const void * pBytes, int iBytes ); void SendWord ( short int v ) { v = ntohs(v); SendBytes ( &v, sizeof(v) ); } // NOLINT void SendInt ( int v ) { v = ntohl(v); SendBytes ( &v, sizeof(v) ); } void SendDword ( DWORD v ) { v = ntohl(v) ;SendBytes ( &v, sizeof(v) ); } void SendUint64 ( ulonglong v ) { SendDword ( uint ( v>>32 ) ); SendDword ( uint ( v&0xFFFFFFFFUL ) ); } void SendString ( const char * v ) { SendString ( v, strlen(v) ); } void SendString ( const char * v, int iLen ) { SendDword(iLen); SendBytes ( v, iLen ); } void SendFloat ( float v ) { SendDword ( sphF2DW(v) ); } }; void CSphBuffer::SendBytes ( const void * pBytes, int iBytes ) { if ( m_iLeft < iBytes ) { m_bOverrun = true; return; } memcpy ( m_pCurrent, pBytes, iBytes ); m_pCurrent += iBytes; m_iLeft -= iBytes; } struct CSphUrl { char * m_sBuffer; char * m_sFormatted; char * m_sScheme; char * m_sHost; char * m_sIndex; int m_iPort; CSphUrl() : m_sBuffer ( NULL ) , m_sFormatted ( NULL ) , m_sScheme ( SPHINXSE_DEFAULT_SCHEME ) , m_sHost ( SPHINXSE_DEFAULT_HOST ) , m_sIndex ( SPHINXSE_DEFAULT_INDEX ) , m_iPort ( SPHINXSE_DEFAULT_PORT ) {} ~CSphUrl() { SafeDeleteArray ( m_sFormatted ); SafeDeleteArray ( m_sBuffer ); } bool Parse ( const char * sUrl, int iLen ); int Connect(); const char * Format(); }; const char * CSphUrl::Format() { if ( !m_sFormatted ) { int iSize = 15 + strlen(m_sHost) + strlen(m_sIndex); m_sFormatted = new char [ iSize ]; if ( m_iPort ) snprintf ( m_sFormatted, iSize, "inet://%s:%d/%s", m_sHost, m_iPort, m_sIndex ); else snprintf ( m_sFormatted, iSize, "unix://%s/%s", m_sHost, m_sIndex ); } return m_sFormatted; } // the following scheme variants are recognized // // inet://host/index // inet://host:port/index // unix://unix/domain/socket:index // unix://unix/domain/socket bool CSphUrl::Parse ( const char * sUrl, int iLen ) { bool bOk = true; while ( iLen ) { bOk = false; m_sBuffer = sphDup ( sUrl, iLen ); m_sScheme = m_sBuffer; m_sHost = strstr ( m_sBuffer, "://" ); if ( !m_sHost ) break; m_sHost[0] = '\0'; m_sHost += 2; if ( !strcmp ( m_sScheme, "unix" ) ) { // unix-domain socket m_iPort = 0; if (!( m_sIndex = strrchr ( m_sHost, ':' ) )) m_sIndex = SPHINXSE_DEFAULT_INDEX; else { *m_sIndex++ = '\0'; if ( !*m_sIndex ) m_sIndex = SPHINXSE_DEFAULT_INDEX; } bOk = true; break; } if ( strcmp ( m_sScheme, "sphinx" )!=0 && strcmp ( m_sScheme, "inet" )!=0 ) break; // inet m_sHost++; char * sPort = strchr ( m_sHost, ':' ); if ( sPort ) { *sPort++ = '\0'; if ( *sPort ) { m_sIndex = strchr ( sPort, '/' ); if ( m_sIndex ) *m_sIndex++ = '\0'; else m_sIndex = SPHINXSE_DEFAULT_INDEX; m_iPort = atoi(sPort); if ( !m_iPort ) m_iPort = SPHINXSE_DEFAULT_PORT; } } else { m_sIndex = strchr ( m_sHost, '/' ); if ( m_sIndex ) *m_sIndex++ = '\0'; else m_sIndex = SPHINXSE_DEFAULT_INDEX; } bOk = true; break; } return bOk; } int CSphUrl::Connect() { struct sockaddr_in sin; #ifndef __WIN__ struct sockaddr_un saun; #endif int iDomain = 0; int iSockaddrSize = 0; struct sockaddr * pSockaddr = NULL; in_addr_t ip_addr; if ( m_iPort ) { iDomain = AF_INET; iSockaddrSize = sizeof(sin); pSockaddr = (struct sockaddr *) &sin; memset ( &sin, 0, sizeof(sin) ); sin.sin_family = AF_INET; sin.sin_port = htons ( m_iPort ); // resolve address if ( (int)( ip_addr = inet_addr ( m_sHost ) )!=(int)INADDR_NONE ) memcpy ( &sin.sin_addr, &ip_addr, sizeof(ip_addr) ); else { int tmp_errno; struct hostent tmp_hostent, *hp; char buff2 [ GETHOSTBYNAME_BUFF_SIZE ]; hp = my_gethostbyname_r ( m_sHost, &tmp_hostent, buff2, sizeof(buff2), &tmp_errno ); if ( !hp ) { my_gethostbyname_r_free(); char sError[256]; snprintf ( sError, sizeof(sError), "failed to resolve searchd host (name=%s)", m_sHost ); my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), sError ); return -1; } memcpy ( &sin.sin_addr, hp->h_addr, Min ( sizeof(sin.sin_addr), (size_t)hp->h_length ) ); my_gethostbyname_r_free(); } } else { #ifndef __WIN__ iDomain = AF_UNIX; iSockaddrSize = sizeof(saun); pSockaddr = (struct sockaddr *) &saun; memset ( &saun, 0, sizeof(saun) ); saun.sun_family = AF_UNIX; strncpy ( saun.sun_path, m_sHost, sizeof(saun.sun_path)-1 ); #else my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), "Unix-domain sockets are not supported on Windows" ); return -1; #endif } // connect to searchd and exchange versions uint uServerVersion; uint uClientVersion = htonl ( SPHINX_SEARCHD_PROTO ); int iSocket = -1; char * pError = NULL; do { iSocket = socket ( iDomain, SOCK_STREAM, 0 ); if ( iSocket==-1 ) { pError = "Failed to create client socket"; break; } if ( connect ( iSocket, pSockaddr, iSockaddrSize )==-1 ) { pError = "Failed to connect to searchd"; break; } if ( !sphRecv ( iSocket, (char *)&uServerVersion, sizeof(uServerVersion) ) ) { pError = "Failed to receive searchd version"; break; } if ( !sphSend ( iSocket, (char *)&uClientVersion, sizeof(uClientVersion) ) ) { pError = "Failed to send client version"; break; } } while(0); // fixme: compare versions? if ( pError ) { char sError[1024]; snprintf ( sError, sizeof(sError), "%s [%d] %s", Format(), errno, strerror(errno) ); my_error ( ER_CONNECT_TO_FOREIGN_DATA_SOURCE, MYF(0), sError ); if ( iSocket!=-1 ) close ( iSocket ); return -1; } return iSocket; } struct CSphResponse { char * m_pBuffer; char * m_pBody; CSphResponse () : m_pBuffer ( NULL ) , m_pBody ( NULL ) {} explicit CSphResponse ( DWORD uSize ) : m_pBody ( NULL ) { m_pBuffer = new char[uSize]; } ~CSphResponse () { SafeDeleteArray ( m_pBuffer ); } static CSphResponse * Read ( int iSocket, int iClientVersion ); }; CSphResponse * CSphResponse::Read ( int iSocket, int iClientVersion ) { char sHeader[8]; if ( !sphRecv ( iSocket, sHeader, sizeof(sHeader) ) ) return NULL; int iStatus = ntohs ( sphUnalignedRead ( *(short int *) &sHeader[0] ) ); int iVersion = ntohs ( sphUnalignedRead ( *(short int *) &sHeader[2] ) ); DWORD uLength = ntohl ( sphUnalignedRead ( *(DWORD *) &sHeader[4] ) ); if ( iVersionm_pBuffer, uLength ) ) { SafeDelete ( pResponse ); return NULL; } pResponse->m_pBody = pResponse->m_pBuffer; if ( iStatus!=SEARCHD_OK ) { DWORD uSize = ntohl ( *(DWORD *)pResponse->m_pBuffer ); if ( iStatus==SEARCHD_WARNING ) { pResponse->m_pBody += uSize; // fixme: report the warning somehow } else { char * sMessage = sphDup ( pResponse->m_pBuffer + sizeof(DWORD), uSize ); my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), sMessage ); SafeDeleteArray ( sMessage ); SafeDelete ( pResponse ); return NULL; } } return pResponse; } return NULL; } /// udf extern "C" { my_bool sphinx_snippets_init ( UDF_INIT * pUDF, UDF_ARGS * pArgs, char * sMessage ); void sphinx_snippets_deinit ( UDF_INIT * pUDF ); char * sphinx_snippets ( UDF_INIT * pUDF, UDF_ARGS * pArgs, char * sResult, unsigned long * pLength, char * pIsNull, char * sError ); }; #define MAX_MESSAGE_LENGTH 255 #define MAX_RESULT_LENGTH 255 struct CSphSnippets { CSphUrl m_tUrl; CSphResponse * m_pResponse; int m_iBeforeMatch; int m_iAfterMatch; int m_iChunkSeparator; int m_iStripMode; int m_iPassageBoundary; int m_iLimit; int m_iLimitWords; int m_iLimitPassages; int m_iAround; int m_iPassageId; int m_iFlags; CSphSnippets() : m_pResponse(NULL) , m_iBeforeMatch(0) , m_iAfterMatch(0) , m_iChunkSeparator(0) , m_iStripMode(0) , m_iPassageBoundary(0) // defaults , m_iLimit(256) , m_iLimitWords(0) , m_iLimitPassages(0) , m_iAround(5) , m_iPassageId(1) , m_iFlags(1) { } ~CSphSnippets() { SafeDelete ( m_pResponse ); } }; #define KEYWORD(NAME) else if ( strncmp ( NAME, pArgs->attributes[i], pArgs->attribute_lengths[i] )==0 ) #define CHECK_TYPE(TYPE) \ if ( pArgs->arg_type[i]!=TYPE ) \ { \ snprintf ( sMessage, MAX_MESSAGE_LENGTH, \ "%.*s argument must be a string", \ (int)pArgs->attribute_lengths[i], \ pArgs->attributes[i] ); \ bFail = true; \ break; \ } \ if ( TYPE==STRING_RESULT && !pArgs->args[i] ) \ { \ snprintf ( sMessage, MAX_MESSAGE_LENGTH, \ "%.*s argument must be constant (and not NULL)", \ (int)pArgs->attribute_lengths[i], \ pArgs->attributes[i] ); \ bFail = true; \ break; \ } #define STRING CHECK_TYPE(STRING_RESULT) #define INT CHECK_TYPE(INT_RESULT); int iValue = *(long long *)pArgs->args[i] my_bool sphinx_snippets_init ( UDF_INIT * pUDF, UDF_ARGS * pArgs, char * sMessage ) { if ( pArgs->arg_count < 3 ) { strncpy ( sMessage, "insufficient arguments", MAX_MESSAGE_LENGTH ); return 1; } bool bFail = false; CSphSnippets * pOpts = new CSphSnippets; for ( uint i = 0; i < pArgs->arg_count; i++ ) { if ( i < 3 ) { if ( pArgs->arg_type[i]!=STRING_RESULT ) { strncpy ( sMessage, "first three arguments must be of string type", MAX_MESSAGE_LENGTH ); bFail = true; break; } } KEYWORD("sphinx") { STRING; if ( !pOpts->m_tUrl.Parse ( pArgs->args[i], pArgs->lengths[i] ) ) { strncpy ( sMessage, "failed to parse connection string", MAX_MESSAGE_LENGTH ); bFail = true; break; } } KEYWORD("before_match") { STRING; pOpts->m_iBeforeMatch = i; } KEYWORD("after_match") { STRING; pOpts->m_iAfterMatch = i; } KEYWORD("chunk_separator") { STRING; pOpts->m_iChunkSeparator = i; } KEYWORD("html_strip_mode") { STRING; pOpts->m_iStripMode = i; } KEYWORD("passage_boundary") { STRING; pOpts->m_iPassageBoundary = i; } KEYWORD("limit") { INT; pOpts->m_iLimit = iValue; } KEYWORD("limit_words") { INT; pOpts->m_iLimitWords = iValue; } KEYWORD("limit_passages") { INT; pOpts->m_iLimitPassages = iValue; } KEYWORD("around") { INT; pOpts->m_iAround = iValue; } KEYWORD("start_passage_id") { INT; pOpts->m_iPassageId = iValue; } KEYWORD("exact_phrase") { INT; if ( iValue ) pOpts->m_iFlags |= 2; } KEYWORD("single_passage") { INT; if ( iValue ) pOpts->m_iFlags |= 4; } KEYWORD("use_boundaries") { INT; if ( iValue ) pOpts->m_iFlags |= 8; } KEYWORD("weight_order") { INT; if ( iValue ) pOpts->m_iFlags |= 16; } KEYWORD("query_mode") { INT; if ( iValue ) pOpts->m_iFlags |= 32; } KEYWORD("force_all_words") { INT; if ( iValue ) pOpts->m_iFlags |= 64; } KEYWORD("load_files") { INT; if ( iValue ) pOpts->m_iFlags |= 128; } KEYWORD("allow_empty") { INT; if ( iValue ) pOpts->m_iFlags |= 256; } KEYWORD("emit_zones") { INT; if ( iValue ) pOpts->m_iFlags |= 512; } else { snprintf ( sMessage, MAX_MESSAGE_LENGTH, "unrecognized argument: %.*s", (int)pArgs->attribute_lengths[i], pArgs->attributes[i] ); bFail = true; break; } } if ( bFail ) { SafeDelete ( pOpts ); return 1; } pUDF->ptr = (char *)pOpts; return 0; } #undef STRING #undef INT #undef KEYWORD #undef CHECK_TYPE #define ARG(i) pArgs->args[i], pArgs->lengths[i] #define ARG_LEN(VAR, LEN) ( VAR ? pArgs->lengths[VAR] : LEN ) #define SEND_STRING(INDEX, DEFAULT) \ if ( INDEX ) \ tBuffer.SendString ( ARG(INDEX) ); \ else \ tBuffer.SendString ( DEFAULT, sizeof(DEFAULT) - 1 ); char * sphinx_snippets ( UDF_INIT * pUDF, UDF_ARGS * pArgs, char * sResult, unsigned long * pLength, char * pIsNull, char * pError ) { CSphSnippets * pOpts = (CSphSnippets *)pUDF->ptr; assert ( pOpts ); if ( !pArgs->args[0] || !pArgs->args[1] || !pArgs->args[2] ) { *pIsNull = 1; return sResult; } const int iSize = 68 + pArgs->lengths[1] + // index pArgs->lengths[2] + // words ARG_LEN ( pOpts->m_iBeforeMatch, 3 ) + ARG_LEN ( pOpts->m_iAfterMatch, 4 ) + ARG_LEN ( pOpts->m_iChunkSeparator, 5 ) + ARG_LEN ( pOpts->m_iStripMode, 5 ) + ARG_LEN ( pOpts->m_iPassageBoundary, 0 ) + 4 + pArgs->lengths[0]; // document CSphBuffer tBuffer(iSize); tBuffer.SendWord ( SEARCHD_COMMAND_EXCERPT ); tBuffer.SendWord ( VER_COMMAND_EXCERPT ); tBuffer.SendDword ( iSize - 8 ); tBuffer.SendDword ( 0 ); tBuffer.SendDword ( pOpts->m_iFlags ); tBuffer.SendString ( ARG(1) ); // index tBuffer.SendString ( ARG(2) ); // words SEND_STRING ( pOpts->m_iBeforeMatch, "" ); SEND_STRING ( pOpts->m_iAfterMatch, "" ); SEND_STRING ( pOpts->m_iChunkSeparator, " ... " ); tBuffer.SendInt ( pOpts->m_iLimit ); tBuffer.SendInt ( pOpts->m_iAround ); tBuffer.SendInt ( pOpts->m_iLimitPassages ); tBuffer.SendInt ( pOpts->m_iLimitWords ); tBuffer.SendInt ( pOpts->m_iPassageId ); SEND_STRING ( pOpts->m_iStripMode, "index" ); SEND_STRING ( pOpts->m_iPassageBoundary, "" ); // single document tBuffer.SendInt ( 1 ); tBuffer.SendString ( ARG(0) ); int iSocket = -1; do { if ( !tBuffer.Finalize() ) { my_error ( ER_QUERY_ON_FOREIGN_DATA_SOURCE, MYF(0), "INTERNAL ERROR: failed to build request" ); break; } iSocket = pOpts->m_tUrl.Connect(); if ( iSocket==-1 ) break; if ( !sphSend ( iSocket, tBuffer.Ptr(), iSize, sphReportErrors ) ) break; CSphResponse * pResponse = CSphResponse::Read ( iSocket, VER_COMMAND_EXCERPT ); if ( !pResponse ) break; close ( iSocket ); pOpts->m_pResponse = pResponse; *pLength = ntohl ( *(DWORD *)pResponse->m_pBody ); return pResponse->m_pBody + sizeof(DWORD); } while(0); if ( iSocket!=-1 ) close ( iSocket ); *pError = 1; return sResult; } #undef SEND_STRING #undef ARG_LEN #undef ARG void sphinx_snippets_deinit ( UDF_INIT * pUDF ) { CSphSnippets * pOpts = (CSphSnippets *)pUDF->ptr; SafeDelete ( pOpts ); } // // $Id$ // coreseek-4.1-beta/csft-4.1/mysqlse/sphinx.5.0.22.diff100777 0 0 24672 11643565732 15077 0diff -B -N -r -u mysql-5.0.22/config/ac-macros/ha_sphinx.m4 mysql-5.0.22.sx/config/ac-macros/ha_sphinx.m4 --- mysql-5.0.22/config/ac-macros/ha_sphinx.m4 1970-01-01 01:00:00.000000000 +0100 +++ mysql-5.0.22.sx/config/ac-macros/ha_sphinx.m4 2006-06-06 19:49:38.000000000 +0200 @@ -0,0 +1,30 @@ +dnl --------------------------------------------------------------------------- +dnl Macro: MYSQL_CHECK_EXAMPLEDB +dnl Sets HAVE_SPHINX_DB if --with-sphinx-storage-engine is used +dnl --------------------------------------------------------------------------- +AC_DEFUN([MYSQL_CHECK_SPHINXDB], [ + AC_ARG_WITH([sphinx-storage-engine], + [ + --with-sphinx-storage-engine + Enable the Sphinx Storage Engine], + [sphinxdb="$withval"], + [sphinxdb=no]) + AC_MSG_CHECKING([for example storage engine]) + + case "$sphinxdb" in + yes ) + AC_DEFINE([HAVE_SPHINX_DB], [1], [Builds Sphinx Engine]) + AC_MSG_RESULT([yes]) + [sphinxdb=yes] + ;; + * ) + AC_MSG_RESULT([no]) + [sphinxdb=no] + ;; + esac + +]) +dnl --------------------------------------------------------------------------- +dnl END OF MYSQL_CHECK_EXAMPLE SECTION +dnl --------------------------------------------------------------------------- + diff -B -N -r -u mysql-5.0.22/configure.in mysql-5.0.22.sx/configure.in --- mysql-5.0.22/configure.in 2006-05-25 10:56:45.000000000 +0200 +++ mysql-5.0.22.sx/configure.in 2006-06-06 19:49:38.000000000 +0200 @@ -41,6 +41,7 @@ sinclude(config/ac-macros/ha_berkeley.m4) sinclude(config/ac-macros/ha_blackhole.m4) sinclude(config/ac-macros/ha_example.m4) +sinclude(config/ac-macros/ha_sphinx.m4) sinclude(config/ac-macros/ha_federated.m4) sinclude(config/ac-macros/ha_innodb.m4) sinclude(config/ac-macros/ha_ndbcluster.m4) @@ -2450,6 +2451,7 @@ MYSQL_CHECK_BDB MYSQL_CHECK_INNODB MYSQL_CHECK_EXAMPLEDB +MYSQL_CHECK_SPHINXDB MYSQL_CHECK_ARCHIVEDB MYSQL_CHECK_CSVDB MYSQL_CHECK_BLACKHOLEDB diff -B -N -r -u mysql-5.0.22/libmysqld/Makefile.am mysql-5.0.22.sx/libmysqld/Makefile.am --- mysql-5.0.22/libmysqld/Makefile.am 2006-05-25 10:56:55.000000000 +0200 +++ mysql-5.0.22.sx/libmysqld/Makefile.am 2006-06-06 19:49:38.000000000 +0200 @@ -27,7 +27,7 @@ -DSHAREDIR="\"$(MYSQLSHAREdir)\"" INCLUDES= @bdb_includes@ \ -I$(top_builddir)/include -I$(top_srcdir)/include \ - -I$(top_srcdir)/sql -I$(top_srcdir)/sql/examples \ + -I$(top_srcdir)/sql -I$(top_srcdir)/sql/examples -I$(top_srcdir)/sql/sphinx \ -I$(top_srcdir)/regex \ $(openssl_includes) $(yassl_includes) @ZLIB_INCLUDES@ @@ -38,6 +38,7 @@ libmysqlsources = errmsg.c get_password.c libmysql.c client.c pack.c \ my_time.c sqlexamplessources = ha_example.cc ha_tina.cc +sqlsphinxsources = ha_sphinx.cc noinst_HEADERS = embedded_priv.h emb_qcache.h @@ -65,7 +66,7 @@ parse_file.cc sql_view.cc sql_trigger.cc my_decimal.cc \ ha_blackhole.cc ha_archive.cc my_user.c -libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) +libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) $(sqlsphinxsources) libmysqld_a_SOURCES= # automake misses these @@ -133,12 +134,16 @@ rm -f $$f; \ @LN_CP_F@ $(top_srcdir)/sql/examples/$$f $$f; \ done; \ + for f in $(sqlsphinxsources); do \ + rm -f $$f; \ + @LN_CP_F@ $(top_srcdir)/sql/sphinx/$$f $$f; \ + done; \ rm -f client_settings.h; \ @LN_CP_F@ $(top_srcdir)/libmysql/client_settings.h client_settings.h clean-local: - rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) | sed "s;\.lo;.c;g"` \ + rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) $(sqlsphinxsources) | sed "s;\.lo;.c;g"` \ $(top_srcdir)/linked_libmysqld_sources; \ rm -f client_settings.h diff -B -N -r -u mysql-5.0.22/sql/handler.cc mysql-5.0.22.sx/sql/handler.cc --- mysql-5.0.22/sql/handler.cc 2006-05-25 10:56:42.000000000 +0200 +++ mysql-5.0.22.sx/sql/handler.cc 2006-06-06 19:49:38.000000000 +0200 @@ -78,6 +78,15 @@ NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, HTON_NO_FLAGS }; #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +extern handlerton sphinx_hton; +#else +handlerton sphinx_hton = { "SPHINX", SHOW_OPTION_NO, "SPHINX storage engine", + DB_TYPE_SPHINX_DB, NULL, 0, 0, NULL, NULL, + NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, + HTON_NO_FLAGS }; +#endif #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" extern handlerton innobase_hton; @@ -147,6 +156,7 @@ &example_hton, &archive_hton, &tina_hton, + &sphinx_hton, &ndbcluster_hton, &federated_hton, &myisammrg_hton, @@ -345,6 +355,12 @@ return new (alloc) ha_tina(table); return NULL; #endif +#ifdef HAVE_SPHINX_DB + case DB_TYPE_SPHINX_DB: + if (have_sphinx_db == SHOW_OPTION_YES) + return new (alloc) ha_sphinx(table); + return NULL; +#endif #ifdef HAVE_NDBCLUSTER_DB case DB_TYPE_NDBCLUSTER: if (have_ndbcluster == SHOW_OPTION_YES) diff -B -N -r -u mysql-5.0.22/sql/handler.h mysql-5.0.22.sx/sql/handler.h --- mysql-5.0.22/sql/handler.h 2006-05-25 10:56:55.000000000 +0200 +++ mysql-5.0.22.sx/sql/handler.h 2006-06-06 19:49:38.000000000 +0200 @@ -183,8 +183,9 @@ DB_TYPE_BERKELEY_DB, DB_TYPE_INNODB, DB_TYPE_GEMINI, DB_TYPE_NDBCLUSTER, DB_TYPE_EXAMPLE_DB, DB_TYPE_ARCHIVE_DB, DB_TYPE_CSV_DB, - DB_TYPE_FEDERATED_DB, + DB_TYPE_FEDERATED_DB, DB_TYPE_BLACKHOLE_DB, + DB_TYPE_SPHINX_DB, DB_TYPE_DEFAULT // Must be last }; diff -B -N -r -u mysql-5.0.22/sql/Makefile.am mysql-5.0.22.sx/sql/Makefile.am --- mysql-5.0.22/sql/Makefile.am 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/Makefile.am 2006-06-06 19:49:38.000000000 +0200 @@ -66,6 +66,7 @@ sql_array.h sql_cursor.h \ examples/ha_example.h ha_archive.h \ examples/ha_tina.h ha_blackhole.h \ + sphinx/ha_sphinx.h \ ha_federated.h mysqld_SOURCES = sql_lex.cc sql_handler.cc \ item.cc item_sum.cc item_buff.cc item_func.cc \ @@ -102,6 +103,7 @@ sp_cache.cc parse_file.cc sql_trigger.cc \ examples/ha_example.cc ha_archive.cc \ examples/ha_tina.cc ha_blackhole.cc \ + sphinx/ha_sphinx.cc \ ha_federated.cc gen_lex_hash_SOURCES = gen_lex_hash.cc diff -B -N -r -u mysql-5.0.22/sql/mysqld.cc mysql-5.0.22.sx/sql/mysqld.cc --- mysql-5.0.22/sql/mysqld.cc 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/mysqld.cc 2006-06-06 19:49:38.000000000 +0200 @@ -6420,6 +6420,11 @@ #else have_csv_db= SHOW_OPTION_NO; #endif +#ifdef HAVE_SPHINX_DB + have_sphinx_db= SHOW_OPTION_YES; +#else + have_sphinx_db= SHOW_OPTION_NO; +#endif #ifdef HAVE_NDBCLUSTER_DB have_ndbcluster=SHOW_OPTION_DISABLED; #else @@ -7457,6 +7462,7 @@ #undef have_example_db #undef have_archive_db #undef have_csv_db +#undef have_sphinx_db #undef have_federated_db #undef have_partition_db #undef have_blackhole_db @@ -7467,6 +7473,7 @@ SHOW_COMP_OPTION have_example_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_archive_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_csv_db= SHOW_OPTION_NO; +SHOW_COMP_OPTION have_sphinx_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_federated_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_partition_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_blackhole_db= SHOW_OPTION_NO; diff -B -N -r -u mysql-5.0.22/sql/mysql_priv.h mysql-5.0.22.sx/sql/mysql_priv.h --- mysql-5.0.22/sql/mysql_priv.h 2006-05-25 10:56:43.000000000 +0200 +++ mysql-5.0.22.sx/sql/mysql_priv.h 2006-06-06 19:49:38.000000000 +0200 @@ -1279,6 +1279,12 @@ #else extern SHOW_COMP_OPTION have_csv_db; #endif +#ifdef HAVE_SPHINX_DB +extern handlerton sphinx_hton; +#define have_sphinx_db sphinx_hton.state +#else +extern SHOW_COMP_OPTION have_sphinx_db; +#endif #ifdef HAVE_FEDERATED_DB extern handlerton federated_hton; #define have_federated_db federated_hton.state diff -B -N -r -u mysql-5.0.22/sql/set_var.cc mysql-5.0.22.sx/sql/set_var.cc --- mysql-5.0.22/sql/set_var.cc 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/set_var.cc 2006-06-06 19:49:38.000000000 +0200 @@ -809,6 +809,7 @@ {"have_compress", (char*) &have_compress, SHOW_HAVE}, {"have_crypt", (char*) &have_crypt, SHOW_HAVE}, {"have_csv", (char*) &have_csv_db, SHOW_HAVE}, + {"have_sphinx", (char*) &have_sphinx_db, SHOW_HAVE}, {"have_example_engine", (char*) &have_example_db, SHOW_HAVE}, {"have_federated_engine", (char*) &have_federated_db, SHOW_HAVE}, {"have_geometry", (char*) &have_geometry, SHOW_HAVE}, diff -B -N -r -u mysql-5.0.22/sql/sql_lex.h mysql-5.0.22.sx/sql/sql_lex.h --- mysql-5.0.22/sql/sql_lex.h 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/sql_lex.h 2006-06-06 19:49:38.000000000 +0200 @@ -58,6 +58,7 @@ SQLCOM_SHOW_DATABASES, SQLCOM_SHOW_TABLES, SQLCOM_SHOW_FIELDS, SQLCOM_SHOW_KEYS, SQLCOM_SHOW_VARIABLES, SQLCOM_SHOW_LOGS, SQLCOM_SHOW_STATUS, SQLCOM_SHOW_INNODB_STATUS, SQLCOM_SHOW_NDBCLUSTER_STATUS, SQLCOM_SHOW_MUTEX_STATUS, + SQLCOM_SHOW_SPHINX_STATUS, SQLCOM_SHOW_PROCESSLIST, SQLCOM_SHOW_MASTER_STAT, SQLCOM_SHOW_SLAVE_STAT, SQLCOM_SHOW_GRANTS, SQLCOM_SHOW_CREATE, SQLCOM_SHOW_CHARSETS, SQLCOM_SHOW_COLLATIONS, SQLCOM_SHOW_CREATE_DB, SQLCOM_SHOW_TABLE_STATUS, diff -B -N -r -u mysql-5.0.22/sql/sql_parse.cc mysql-5.0.22.sx/sql/sql_parse.cc --- mysql-5.0.22/sql/sql_parse.cc 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/sql_parse.cc 2006-06-06 19:49:38.000000000 +0200 @@ -25,6 +25,9 @@ #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +#endif #ifdef HAVE_NDBCLUSTER_DB #include "ha_ndbcluster.h" @@ -2722,6 +2725,15 @@ break; } #endif +#ifdef HAVE_SPHINX_DB + case SQLCOM_SHOW_SPHINX_STATUS: + { + if (check_global_access(thd, SUPER_ACL)) + goto error; + res = sphinx_show_status(thd); + break; + } +#endif #ifdef HAVE_REPLICATION case SQLCOM_LOAD_MASTER_TABLE: { diff -B -N -r -u mysql-5.0.22/sql/sql_yacc.yy mysql-5.0.22.sx/sql/sql_yacc.yy --- mysql-5.0.22/sql/sql_yacc.yy 2006-05-25 10:56:43.000000000 +0200 +++ mysql-5.0.22.sx/sql/sql_yacc.yy 2006-06-06 19:49:38.000000000 +0200 @@ -6584,6 +6584,9 @@ case DB_TYPE_INNODB: Lex->sql_command = SQLCOM_SHOW_INNODB_STATUS; break; + case DB_TYPE_SPHINX_DB: + Lex->sql_command = SQLCOM_SHOW_SPHINX_STATUS; + break; default: my_error(ER_NOT_SUPPORTED_YET, MYF(0), "STATUS"); YYABORT; coreseek-4.1-beta/csft-4.1/mysqlse/sphinx.5.0.27.diff100777 0 0 24675 11643565732 15107 0diff -B -N -r -u mysql-5.0.22/config/ac-macros/ha_sphinx.m4 mysql-5.0.22.sx/config/ac-macros/ha_sphinx.m4 --- mysql-5.0.22/config/ac-macros/ha_sphinx.m4 1970-01-01 01:00:00.000000000 +0100 +++ mysql-5.0.22.sx/config/ac-macros/ha_sphinx.m4 2006-06-06 19:49:38.000000000 +0200 @@ -0,0 +1,30 @@ +dnl --------------------------------------------------------------------------- +dnl Macro: MYSQL_CHECK_EXAMPLEDB +dnl Sets HAVE_SPHINX_DB if --with-sphinx-storage-engine is used +dnl --------------------------------------------------------------------------- +AC_DEFUN([MYSQL_CHECK_SPHINXDB], [ + AC_ARG_WITH([sphinx-storage-engine], + [ + --with-sphinx-storage-engine + Enable the Sphinx Storage Engine], + [sphinxdb="$withval"], + [sphinxdb=no]) + AC_MSG_CHECKING([for example storage engine]) + + case "$sphinxdb" in + yes ) + AC_DEFINE([HAVE_SPHINX_DB], [1], [Builds Sphinx Engine]) + AC_MSG_RESULT([yes]) + [sphinxdb=yes] + ;; + * ) + AC_MSG_RESULT([no]) + [sphinxdb=no] + ;; + esac + +]) +dnl --------------------------------------------------------------------------- +dnl END OF MYSQL_CHECK_EXAMPLE SECTION +dnl --------------------------------------------------------------------------- + diff -B -N -r -u mysql-5.0.22/configure.in mysql-5.0.22.sx/configure.in --- mysql-5.0.22/configure.in 2006-05-25 10:56:45.000000000 +0200 +++ mysql-5.0.22.sx/configure.in 2006-06-06 19:49:38.000000000 +0200 @@ -41,6 +41,7 @@ sinclude(config/ac-macros/ha_berkeley.m4) sinclude(config/ac-macros/ha_blackhole.m4) sinclude(config/ac-macros/ha_example.m4) +sinclude(config/ac-macros/ha_sphinx.m4) sinclude(config/ac-macros/ha_federated.m4) sinclude(config/ac-macros/ha_innodb.m4) sinclude(config/ac-macros/ha_ndbcluster.m4) @@ -2450,6 +2451,7 @@ MYSQL_CHECK_BDB MYSQL_CHECK_INNODB MYSQL_CHECK_EXAMPLEDB +MYSQL_CHECK_SPHINXDB MYSQL_CHECK_ARCHIVEDB MYSQL_CHECK_CSVDB MYSQL_CHECK_BLACKHOLEDB diff -B -N -r -u mysql-5.0.22/libmysqld/Makefile.am mysql-5.0.22.sx/libmysqld/Makefile.am --- mysql-5.0.22/libmysqld/Makefile.am 2006-05-25 10:56:55.000000000 +0200 +++ mysql-5.0.22.sx/libmysqld/Makefile.am 2006-06-06 19:49:38.000000000 +0200 @@ -27,7 +27,7 @@ -DSHAREDIR="\"$(MYSQLSHAREdir)\"" INCLUDES= @bdb_includes@ \ -I$(top_builddir)/include -I$(top_srcdir)/include \ - -I$(top_srcdir)/sql -I$(top_srcdir)/sql/examples \ + -I$(top_srcdir)/sql -I$(top_srcdir)/sql/examples -I$(top_srcdir)/sql/sphinx \ -I$(top_srcdir)/regex \ $(openssl_includes) $(yassl_includes) @ZLIB_INCLUDES@ @@ -38,6 +38,7 @@ libmysqlsources = errmsg.c get_password.c libmysql.c client.c pack.c \ my_time.c sqlexamplessources = ha_example.cc ha_tina.cc +sqlsphinxsources = ha_sphinx.cc noinst_HEADERS = embedded_priv.h emb_qcache.h @@ -65,7 +66,7 @@ parse_file.cc sql_view.cc sql_trigger.cc my_decimal.cc \ ha_blackhole.cc ha_archive.cc my_user.c -libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) +libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) $(sqlsphinxsources) libmysqld_a_SOURCES= # automake misses these @@ -133,12 +134,16 @@ rm -f $$f; \ @LN_CP_F@ $(top_srcdir)/sql/examples/$$f $$f; \ done; \ + for f in $(sqlsphinxsources); do \ + rm -f $$f; \ + @LN_CP_F@ $(top_srcdir)/sql/sphinx/$$f $$f; \ + done; \ rm -f client_settings.h; \ @LN_CP_F@ $(top_srcdir)/libmysql/client_settings.h client_settings.h clean-local: - rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) | sed "s;\.lo;.c;g"` \ + rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) $(sqlsphinxsources) | sed "s;\.lo;.c;g"` \ $(top_srcdir)/linked_libmysqld_sources; \ rm -f client_settings.h diff -B -N -r -u mysql-5.0.22/sql/handler.cc mysql-5.0.22.sx/sql/handler.cc --- mysql-5.0.22/sql/handler.cc 2006-05-25 10:56:42.000000000 +0200 +++ mysql-5.0.22.sx/sql/handler.cc 2006-06-06 19:49:38.000000000 +0200 @@ -78,6 +78,15 @@ NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, HTON_NO_FLAGS }; #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +extern handlerton sphinx_hton; +#else +handlerton sphinx_hton = { "SPHINX", SHOW_OPTION_NO, "SPHINX storage engine", + DB_TYPE_SPHINX_DB, NULL, 0, 0, NULL, NULL, + NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, + HTON_NO_FLAGS }; +#endif #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" extern handlerton innobase_hton; @@ -147,6 +156,7 @@ &example_hton, &archive_hton, &tina_hton, + &sphinx_hton, &ndbcluster_hton, &federated_hton, &myisammrg_hton, @@ -345,6 +355,12 @@ return new (alloc) ha_tina(table); return NULL; #endif +#ifdef HAVE_SPHINX_DB + case DB_TYPE_SPHINX_DB: + if (have_sphinx_db == SHOW_OPTION_YES) + return new (alloc) ha_sphinx(table); + return NULL; +#endif #ifdef HAVE_NDBCLUSTER_DB case DB_TYPE_NDBCLUSTER: if (have_ndbcluster == SHOW_OPTION_YES) diff -B -N -r -u mysql-5.0.22/sql/handler.h mysql-5.0.22.sx/sql/handler.h --- mysql-5.0.22/sql/handler.h 2006-05-25 10:56:55.000000000 +0200 +++ mysql-5.0.22.sx/sql/handler.h 2006-06-06 19:49:38.000000000 +0200 @@ -183,8 +183,9 @@ DB_TYPE_BERKELEY_DB, DB_TYPE_INNODB, DB_TYPE_GEMINI, DB_TYPE_NDBCLUSTER, DB_TYPE_EXAMPLE_DB, DB_TYPE_ARCHIVE_DB, DB_TYPE_CSV_DB, - DB_TYPE_FEDERATED_DB, + DB_TYPE_FEDERATED_DB, DB_TYPE_BLACKHOLE_DB, + DB_TYPE_SPHINX_DB, DB_TYPE_DEFAULT // Must be last }; diff -B -N -r -u mysql-5.0.22/sql/Makefile.am mysql-5.0.22.sx/sql/Makefile.am --- mysql-5.0.22/sql/Makefile.am 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/Makefile.am 2006-06-06 19:49:38.000000000 +0200 @@ -66,6 +66,7 @@ sql_array.h sql_cursor.h \ examples/ha_example.h ha_archive.h \ examples/ha_tina.h ha_blackhole.h \ + sphinx/ha_sphinx.h \ ha_federated.h mysqld_SOURCES = sql_lex.cc sql_handler.cc \ item.cc item_sum.cc item_buff.cc item_func.cc \ @@ -102,6 +103,7 @@ sp_cache.cc parse_file.cc sql_trigger.cc \ examples/ha_example.cc ha_archive.cc \ examples/ha_tina.cc ha_blackhole.cc \ + sphinx/ha_sphinx.cc \ ha_federated.cc gen_lex_hash_SOURCES = gen_lex_hash.cc diff -B -N -r -u mysql-5.0.22/sql/mysqld.cc mysql-5.0.22.sx/sql/mysqld.cc --- mysql-5.0.22/sql/mysqld.cc 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/mysqld.cc 2006-06-06 19:49:38.000000000 +0200 @@ -6420,6 +6420,11 @@ #else have_csv_db= SHOW_OPTION_NO; #endif +#ifdef HAVE_SPHINX_DB + have_sphinx_db= SHOW_OPTION_YES; +#else + have_sphinx_db= SHOW_OPTION_NO; +#endif #ifdef HAVE_NDBCLUSTER_DB have_ndbcluster=SHOW_OPTION_DISABLED; #else @@ -7457,6 +7462,7 @@ #undef have_example_db #undef have_archive_db #undef have_csv_db +#undef have_sphinx_db #undef have_federated_db #undef have_partition_db #undef have_blackhole_db @@ -7467,6 +7473,7 @@ SHOW_COMP_OPTION have_example_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_archive_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_csv_db= SHOW_OPTION_NO; +SHOW_COMP_OPTION have_sphinx_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_federated_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_partition_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_blackhole_db= SHOW_OPTION_NO; diff -B -N -r -u mysql-5.0.22/sql/mysql_priv.h mysql-5.0.22.sx/sql/mysql_priv.h --- mysql-5.0.22/sql/mysql_priv.h 2006-05-25 10:56:43.000000000 +0200 +++ mysql-5.0.22.sx/sql/mysql_priv.h 2006-06-06 19:49:38.000000000 +0200 @@ -1279,6 +1279,12 @@ #else extern SHOW_COMP_OPTION have_csv_db; #endif +#ifdef HAVE_SPHINX_DB +extern handlerton sphinx_hton; +#define have_sphinx_db sphinx_hton.state +#else +extern SHOW_COMP_OPTION have_sphinx_db; +#endif #ifdef HAVE_FEDERATED_DB extern handlerton federated_hton; #define have_federated_db federated_hton.state diff -B -N -r -u mysql-5.0.22/sql/set_var.cc mysql-5.0.22.sx/sql/set_var.cc --- mysql-5.0.22/sql/set_var.cc 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/set_var.cc 2006-06-06 19:49:38.000000000 +0200 @@ -864,6 +864,7 @@ {"have_compress", (char*) &have_compress, SHOW_HAVE}, {"have_crypt", (char*) &have_crypt, SHOW_HAVE}, {"have_csv", (char*) &have_csv_db, SHOW_HAVE}, + {"have_sphinx", (char*) &have_sphinx_db, SHOW_HAVE}, {"have_dynamic_loading", (char*) &have_dlopen, SHOW_HAVE}, {"have_example_engine", (char*) &have_example_db, SHOW_HAVE}, {"have_federated_engine", (char*) &have_federated_db, SHOW_HAVE}, diff -B -N -r -u mysql-5.0.22/sql/sql_lex.h mysql-5.0.22.sx/sql/sql_lex.h --- mysql-5.0.22/sql/sql_lex.h 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/sql_lex.h 2006-06-06 19:49:38.000000000 +0200 @@ -58,6 +58,7 @@ SQLCOM_SHOW_DATABASES, SQLCOM_SHOW_TABLES, SQLCOM_SHOW_FIELDS, SQLCOM_SHOW_KEYS, SQLCOM_SHOW_VARIABLES, SQLCOM_SHOW_LOGS, SQLCOM_SHOW_STATUS, SQLCOM_SHOW_INNODB_STATUS, SQLCOM_SHOW_NDBCLUSTER_STATUS, SQLCOM_SHOW_MUTEX_STATUS, + SQLCOM_SHOW_SPHINX_STATUS, SQLCOM_SHOW_PROCESSLIST, SQLCOM_SHOW_MASTER_STAT, SQLCOM_SHOW_SLAVE_STAT, SQLCOM_SHOW_GRANTS, SQLCOM_SHOW_CREATE, SQLCOM_SHOW_CHARSETS, SQLCOM_SHOW_COLLATIONS, SQLCOM_SHOW_CREATE_DB, SQLCOM_SHOW_TABLE_STATUS, diff -B -N -r -u mysql-5.0.22/sql/sql_parse.cc mysql-5.0.22.sx/sql/sql_parse.cc --- mysql-5.0.22/sql/sql_parse.cc 2006-05-25 10:56:41.000000000 +0200 +++ mysql-5.0.22.sx/sql/sql_parse.cc 2006-06-06 19:49:38.000000000 +0200 @@ -25,6 +25,9 @@ #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +#endif #ifdef HAVE_NDBCLUSTER_DB #include "ha_ndbcluster.h" @@ -2722,6 +2725,15 @@ break; } #endif +#ifdef HAVE_SPHINX_DB + case SQLCOM_SHOW_SPHINX_STATUS: + { + if (check_global_access(thd, SUPER_ACL)) + goto error; + res = sphinx_show_status(thd); + break; + } +#endif #ifdef HAVE_REPLICATION case SQLCOM_LOAD_MASTER_TABLE: { diff -B -N -r -u mysql-5.0.22/sql/sql_yacc.yy mysql-5.0.22.sx/sql/sql_yacc.yy --- mysql-5.0.22/sql/sql_yacc.yy 2006-05-25 10:56:43.000000000 +0200 +++ mysql-5.0.22.sx/sql/sql_yacc.yy 2006-06-06 19:49:38.000000000 +0200 @@ -6584,6 +6584,9 @@ case DB_TYPE_INNODB: Lex->sql_command = SQLCOM_SHOW_INNODB_STATUS; break; + case DB_TYPE_SPHINX_DB: + Lex->sql_command = SQLCOM_SHOW_SPHINX_STATUS; + break; default: my_error(ER_NOT_SUPPORTED_YET, MYF(0), "STATUS"); YYABORT; coreseek-4.1-beta/csft-4.1/mysqlse/sphinx.5.0.37.diff100777 0 0 27342 11643565732 15102 0--- mysql-5.0.67/config/ac-macros/ha_sphinx.m4 1970-01-01 10:00:00.000000000 +1000 +++ mysql-5.0.67-sphinx/config/ac-macros/ha_sphinx.m4 2009-02-14 09:15:48.000000000 +1000 @@ -0,0 +1,30 @@ +dnl --------------------------------------------------------------------------- +dnl Macro: MYSQL_CHECK_EXAMPLEDB +dnl Sets HAVE_SPHINX_DB if --with-sphinx-storage-engine is used +dnl --------------------------------------------------------------------------- +AC_DEFUN([MYSQL_CHECK_SPHINXDB], [ + AC_ARG_WITH([sphinx-storage-engine], + [ + --with-sphinx-storage-engine + Enable the Sphinx Storage Engine], + [sphinxdb="$withval"], + [sphinxdb=no]) + AC_MSG_CHECKING([for example storage engine]) + + case "$sphinxdb" in + yes ) + AC_DEFINE([HAVE_SPHINX_DB], [1], [Builds Sphinx Engine]) + AC_MSG_RESULT([yes]) + [sphinxdb=yes] + ;; + * ) + AC_MSG_RESULT([no]) + [sphinxdb=no] + ;; + esac + +]) +dnl --------------------------------------------------------------------------- +dnl END OF MYSQL_CHECK_EXAMPLE SECTION +dnl --------------------------------------------------------------------------- + --- mysql-5.0.67/configure.in 2008-08-04 23:19:07.000000000 +1100 +++ mysql-5.0.67-sphinx/configure.in 2009-02-14 09:15:48.000000000 +1000 @@ -58,6 +58,7 @@ sinclude(config/ac-macros/ha_berkeley.m4) sinclude(config/ac-macros/ha_blackhole.m4) sinclude(config/ac-macros/ha_example.m4) +sinclude(config/ac-macros/ha_sphinx.m4) sinclude(config/ac-macros/ha_federated.m4) sinclude(config/ac-macros/ha_innodb.m4) sinclude(config/ac-macros/ha_ndbcluster.m4) @@ -2625,6 +2626,7 @@ MYSQL_CHECK_BDB MYSQL_CHECK_INNODB MYSQL_CHECK_EXAMPLEDB +MYSQL_CHECK_SPHINXDB MYSQL_CHECK_ARCHIVEDB MYSQL_CHECK_CSVDB MYSQL_CHECK_BLACKHOLEDB --- mysql-5.0.67/libmysqld/Makefile.am 2008-08-04 23:19:18.000000000 +1100 +++ mysql-5.0.67-sphinx/libmysqld/Makefile.am 2009-02-14 09:15:48.000000000 +1000 @@ -29,6 +29,7 @@ -I$(top_builddir)/include -I$(top_srcdir)/include \ -I$(top_builddir)/sql -I$(top_srcdir)/sql \ -I$(top_srcdir)/sql/examples \ + -I$(top_srcdir)/sql/sphinx \ -I$(top_srcdir)/regex \ $(openssl_includes) @ZLIB_INCLUDES@ @@ -39,6 +40,7 @@ libmysqlsources = errmsg.c get_password.c libmysql.c client.c pack.c \ my_time.c sqlexamplessources = ha_example.cc ha_tina.cc +sqlsphinxsources = ha_sphinx.cc noinst_HEADERS = embedded_priv.h emb_qcache.h @@ -67,7 +69,7 @@ parse_file.cc sql_view.cc sql_trigger.cc my_decimal.cc \ ha_blackhole.cc ha_archive.cc my_user.c -libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) +libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) $(sqlsphinxsources) libmysqld_a_SOURCES= # automake misses these @@ -147,12 +149,16 @@ rm -f $$f; \ @LN_CP_F@ $(top_srcdir)/sql/examples/$$f $$f; \ done; \ + for f in $(sqlsphinxsources); do \ + rm -f $$f; \ + @LN_CP_F@ $(top_srcdir)/sql/sphinx/$$f $$f; \ + done; \ rm -f client_settings.h; \ @LN_CP_F@ $(top_srcdir)/libmysql/client_settings.h client_settings.h clean-local: - rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) | sed "s;\.lo;.c;g"` \ + rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) $(sqlsphinxsources) | sed "s;\.lo;.c;g"` \ $(top_srcdir)/linked_libmysqld_sources; \ rm -f client_settings.h --- mysql-5.0.67/sql/handler.cc 2008-08-04 23:20:04.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/handler.cc 2009-02-14 09:15:48.000000000 +1000 @@ -77,6 +77,15 @@ NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, HTON_NO_FLAGS }; #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +extern handlerton sphinx_hton; +#else +handlerton sphinx_hton = { "SPHINX", SHOW_OPTION_NO, "SPHINX storage engine", + DB_TYPE_SPHINX_DB, NULL, 0, 0, NULL, NULL, + NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, + HTON_NO_FLAGS }; +#endif #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" extern handlerton innobase_hton; @@ -141,6 +150,7 @@ &example_hton, &archive_hton, &tina_hton, + &sphinx_hton, &ndbcluster_hton, &federated_hton, &myisammrg_hton, @@ -341,6 +351,12 @@ return new (alloc) ha_tina(table); return NULL; #endif +#ifdef HAVE_SPHINX_DB + case DB_TYPE_SPHINX_DB: + if (have_sphinx_db == SHOW_OPTION_YES) + return new (alloc) ha_sphinx(table); + return NULL; +#endif #ifdef HAVE_NDBCLUSTER_DB case DB_TYPE_NDBCLUSTER: if (have_ndbcluster == SHOW_OPTION_YES) --- mysql-5.0.67/sql/handler.h 2008-08-04 23:20:04.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/handler.h 2009-02-14 09:15:48.000000000 +1000 @@ -186,8 +186,9 @@ DB_TYPE_BERKELEY_DB, DB_TYPE_INNODB, DB_TYPE_GEMINI, DB_TYPE_NDBCLUSTER, DB_TYPE_EXAMPLE_DB, DB_TYPE_ARCHIVE_DB, DB_TYPE_CSV_DB, - DB_TYPE_FEDERATED_DB, + DB_TYPE_FEDERATED_DB, DB_TYPE_BLACKHOLE_DB, + DB_TYPE_SPHINX_DB, DB_TYPE_DEFAULT // Must be last }; --- mysql-5.0.67/sql/Makefile.am 2008-08-04 23:20:02.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/Makefile.am 2009-02-14 09:23:28.000000000 +1000 @@ -68,6 +68,7 @@ sql_array.h sql_cursor.h \ examples/ha_example.h ha_archive.h \ examples/ha_tina.h ha_blackhole.h \ + sphinx/ha_sphinx.h \ ha_federated.h mysqld_SOURCES = sql_lex.cc sql_handler.cc \ item.cc item_sum.cc item_buff.cc item_func.cc \ @@ -105,6 +106,7 @@ sp_cache.cc parse_file.cc sql_trigger.cc \ examples/ha_example.cc ha_archive.cc \ examples/ha_tina.cc ha_blackhole.cc \ + sphinx/ha_sphinx.cc \ ha_federated.cc gen_lex_hash_SOURCES = gen_lex_hash.cc @@ -174,6 +176,10 @@ udf_example_la_SOURCES= udf_example.c udf_example_la_LDFLAGS= -module -rpath $(pkglibdir) +pkglib_LTLIBRARIES = sphinx/sphinx.la +sphinx_sphinx_la_SOURCES = sphinx/snippets_udf.cc +sphinx_sphinx_la_LDFLAGS = -module + # Don't update the files from bitkeeper %::SCCS/s.% --- mysql-5.0.67/sql/mysqld.cc 2008-08-04 23:20:07.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/mysqld.cc 2009-02-14 09:15:48.000000000 +1000 @@ -36,6 +36,10 @@ #include #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +#endif + #ifdef HAVE_INNOBASE_DB #define OPT_INNODB_DEFAULT 1 #else @@ -6633,6 +6637,13 @@ {"Threads_running", (char*) &thread_running, SHOW_INT_CONST}, {"Uptime", (char*) 0, SHOW_STARTTIME}, {"Uptime_since_flush_status",(char*) 0, SHOW_FLUSHTIME}, +#ifdef HAVE_SPHINX_DB + {"sphinx_total", (char *)sphinx_showfunc_total, SHOW_SPHINX_FUNC}, + {"sphinx_total_found", (char *)sphinx_showfunc_total_found, SHOW_SPHINX_FUNC}, + {"sphinx_time", (char *)sphinx_showfunc_time, SHOW_SPHINX_FUNC}, + {"sphinx_word_count", (char *)sphinx_showfunc_word_count, SHOW_SPHINX_FUNC}, + {"sphinx_words", (char *)sphinx_showfunc_words, SHOW_SPHINX_FUNC}, +#endif {NullS, NullS, SHOW_LONG} }; @@ -6875,6 +6886,11 @@ #else have_csv_db= SHOW_OPTION_NO; #endif +#ifdef HAVE_SPHINX_DB + have_sphinx_db= SHOW_OPTION_YES; +#else + have_sphinx_db= SHOW_OPTION_NO; +#endif #ifdef HAVE_NDBCLUSTER_DB have_ndbcluster=SHOW_OPTION_DISABLED; #else @@ -7983,6 +7999,7 @@ #undef have_example_db #undef have_archive_db #undef have_csv_db +#undef have_sphinx_db #undef have_federated_db #undef have_partition_db #undef have_blackhole_db @@ -7993,6 +8010,7 @@ SHOW_COMP_OPTION have_example_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_archive_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_csv_db= SHOW_OPTION_NO; +SHOW_COMP_OPTION have_sphinx_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_federated_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_partition_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_blackhole_db= SHOW_OPTION_NO; --- mysql-5.0.67/sql/mysql_priv.h 2008-08-04 23:20:07.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/mysql_priv.h 2009-02-14 09:15:48.000000000 +1000 @@ -1439,6 +1439,12 @@ #else extern SHOW_COMP_OPTION have_csv_db; #endif +#ifdef HAVE_SPHINX_DB +extern handlerton sphinx_hton; +#define have_sphinx_db sphinx_hton.state +#else +extern SHOW_COMP_OPTION have_sphinx_db; +#endif #ifdef HAVE_FEDERATED_DB extern handlerton federated_hton; #define have_federated_db federated_hton.state --- mysql-5.0.67/sql/set_var.cc 2008-08-04 23:20:08.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/set_var.cc 2009-02-14 09:15:48.000000000 +1000 @@ -888,6 +888,7 @@ {"have_compress", (char*) &have_compress, SHOW_HAVE}, {"have_crypt", (char*) &have_crypt, SHOW_HAVE}, {"have_csv", (char*) &have_csv_db, SHOW_HAVE}, + {"have_sphinx", (char*) &have_sphinx_db, SHOW_HAVE}, {"have_dynamic_loading", (char*) &have_dlopen, SHOW_HAVE}, {"have_example_engine", (char*) &have_example_db, SHOW_HAVE}, {"have_federated_engine", (char*) &have_federated_db, SHOW_HAVE}, --- mysql-5.0.67/sql/sql_lex.h 2008-08-04 23:20:10.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/sql_lex.h 2009-02-14 09:15:48.000000000 +1000 @@ -57,6 +57,7 @@ SQLCOM_SHOW_DATABASES, SQLCOM_SHOW_TABLES, SQLCOM_SHOW_FIELDS, SQLCOM_SHOW_KEYS, SQLCOM_SHOW_VARIABLES, SQLCOM_SHOW_LOGS, SQLCOM_SHOW_STATUS, SQLCOM_SHOW_INNODB_STATUS, SQLCOM_SHOW_NDBCLUSTER_STATUS, SQLCOM_SHOW_MUTEX_STATUS, + SQLCOM_SHOW_SPHINX_STATUS, SQLCOM_SHOW_PROCESSLIST, SQLCOM_SHOW_MASTER_STAT, SQLCOM_SHOW_SLAVE_STAT, SQLCOM_SHOW_GRANTS, SQLCOM_SHOW_CREATE, SQLCOM_SHOW_CHARSETS, SQLCOM_SHOW_COLLATIONS, SQLCOM_SHOW_CREATE_DB, SQLCOM_SHOW_TABLE_STATUS, --- mysql-5.0.67/sql/sql_parse.cc 2008-08-04 23:20:10.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/sql_parse.cc 2009-02-14 09:15:48.000000000 +1000 @@ -24,6 +24,9 @@ #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +#endif #ifdef HAVE_NDBCLUSTER_DB #include "ha_ndbcluster.h" @@ -3006,6 +3009,15 @@ break; } #endif +#ifdef HAVE_SPHINX_DB + case SQLCOM_SHOW_SPHINX_STATUS: + { + if (check_global_access(thd, SUPER_ACL)) + goto error; + res = sphinx_show_status(thd); + break; + } +#endif #ifdef HAVE_REPLICATION case SQLCOM_LOAD_MASTER_TABLE: { --- mysql-5.0.67/sql/sql_yacc.yy 2008-08-04 23:20:12.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/sql_yacc.yy 2009-02-14 09:15:48.000000000 +1000 @@ -7393,6 +7393,9 @@ case DB_TYPE_INNODB: Lex->sql_command = SQLCOM_SHOW_INNODB_STATUS; break; + case DB_TYPE_SPHINX_DB: + Lex->sql_command = SQLCOM_SHOW_SPHINX_STATUS; + break; default: my_error(ER_NOT_SUPPORTED_YET, MYF(0), "STATUS"); MYSQL_YYABORT; --- mysql-5.0.67/sql/structs.h 2008-08-04 23:20:12.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/structs.h 2009-02-14 09:15:48.000000000 +1000 @@ -188,6 +188,9 @@ SHOW_SSL_CTX_SESS_TIMEOUTS, SHOW_SSL_CTX_SESS_CACHE_FULL, SHOW_SSL_GET_CIPHER_LIST, #endif /* HAVE_OPENSSL */ +#ifdef HAVE_SPHINX_DB + SHOW_SPHINX_FUNC, +#endif SHOW_NET_COMPRESSION, SHOW_RPL_STATUS, SHOW_SLAVE_RUNNING, SHOW_SLAVE_RETRIED_TRANS, SHOW_KEY_CACHE_LONG, SHOW_KEY_CACHE_CONST_LONG, SHOW_KEY_CACHE_LONGLONG, --- mysql-5.0.67/sql/sql_show.cc 2008-08-04 23:20:11.000000000 +1100 +++ mysql-5.0.67-sphinx/sql/sql_show.cc 2009-02-14 09:15:48.000000000 +1000 @@ -1473,6 +1473,16 @@ value= (char*) ((sys_var*) value)->value_ptr(thd, value_type, &null_lex_str); } + #ifdef HAVE_SPHINX_DB + else if (show_type == SHOW_SPHINX_FUNC) + { + SHOW_VAR var; + ((int (*)(THD *, SHOW_VAR *, char *))value)(thd, &var, buff); + + value = var.value; + show_type = var.type; + } + #endif /* HAVE_SPHINX_DB */ pos= end= buff; switch (show_type) { coreseek-4.1-beta/csft-4.1/mysqlse/sphinx.5.0.91.diff100777 0 0 33117 11643565732 15077 0diff -r 319c65835581 CMakeLists.txt --- a/CMakeLists.txt Sun Jun 20 15:15:01 2010 +0400 +++ b/CMakeLists.txt Sun Jun 20 15:59:31 2010 +0400 @@ -70,6 +70,10 @@ ADD_DEFINITIONS(-DHAVE_INNOBASE_DB) ENDIF(WITH_INNOBASE_STORAGE_ENGINE) +IF(WITH_SPHINX_STORAGE_ENGINE) + ADD_DEFINITIONS(-DHAVE_SPHINX_DB) +ENDIF(WITH_SPHINX_STORAGE_ENGINE) + SET(localstatedir "C:\\mysql\\data") CONFIGURE_FILE(${CMAKE_SOURCE_DIR}/support-files/my-huge.cnf.sh ${CMAKE_SOURCE_DIR}/support-files/my-huge.ini @ONLY) diff -r 319c65835581 configure.in --- a/configure.in Sun Jun 20 15:15:01 2010 +0400 +++ b/configure.in Sun Jun 20 15:59:31 2010 +0400 @@ -60,6 +60,7 @@ sinclude(config/ac-macros/ha_berkeley.m4) sinclude(config/ac-macros/ha_blackhole.m4) sinclude(config/ac-macros/ha_example.m4) +sinclude(config/ac-macros/ha_sphinx.m4) sinclude(config/ac-macros/ha_federated.m4) sinclude(config/ac-macros/ha_innodb.m4) sinclude(config/ac-macros/ha_ndbcluster.m4) @@ -2696,6 +2697,7 @@ MYSQL_CHECK_BDB MYSQL_CHECK_INNODB MYSQL_CHECK_EXAMPLEDB +MYSQL_CHECK_SPHINXDB MYSQL_CHECK_ARCHIVEDB MYSQL_CHECK_CSVDB MYSQL_CHECK_BLACKHOLEDB diff -r 319c65835581 libmysqld/Makefile.am --- a/libmysqld/Makefile.am Sun Jun 20 15:15:01 2010 +0400 +++ b/libmysqld/Makefile.am Sun Jun 20 15:59:31 2010 +0400 @@ -29,6 +29,7 @@ -I$(top_builddir)/include -I$(top_srcdir)/include \ -I$(top_builddir)/sql -I$(top_srcdir)/sql \ -I$(top_srcdir)/sql/examples \ + -I$(top_srcdir)/sql/sphinx \ -I$(top_srcdir)/regex \ $(openssl_includes) @ZLIB_INCLUDES@ @@ -39,6 +40,7 @@ libmysqlsources = errmsg.c get_password.c libmysql.c client.c pack.c \ my_time.c sqlexamplessources = ha_example.cc ha_tina.cc +sqlsphinxsources = ha_sphinx.cc noinst_HEADERS = embedded_priv.h emb_qcache.h @@ -67,7 +69,7 @@ parse_file.cc sql_view.cc sql_trigger.cc my_decimal.cc \ ha_blackhole.cc ha_archive.cc my_user.c -libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) +libmysqld_int_a_SOURCES= $(libmysqld_sources) $(libmysqlsources) $(sqlsources) $(sqlexamplessources) $(sqlsphinxsources) libmysqld_a_SOURCES= # automake misses these @@ -147,12 +149,16 @@ rm -f $$f; \ @LN_CP_F@ $(top_srcdir)/sql/examples/$$f $$f; \ done; \ + for f in $(sqlsphinxsources); do \ + rm -f $$f; \ + @LN_CP_F@ $(top_srcdir)/sql/sphinx/$$f $$f; \ + done; \ rm -f client_settings.h; \ @LN_CP_F@ $(top_srcdir)/libmysql/client_settings.h client_settings.h clean-local: - rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) | sed "s;\.lo;.c;g"` \ + rm -f `echo $(sqlsources) $(libmysqlsources) $(sqlexamplessources) $(sqlsphinxsources) | sed "s;\.lo;.c;g"` \ $(top_srcdir)/linked_libmysqld_sources; \ rm -f client_settings.h diff -r 319c65835581 sql/CMakeLists.txt --- a/sql/CMakeLists.txt Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/CMakeLists.txt Sun Jun 20 15:59:31 2010 +0400 @@ -50,6 +50,7 @@ filesort.cc gstream.cc ha_blackhole.cc ha_archive.cc ha_heap.cc ha_myisam.cc ha_myisammrg.cc ha_innodb.cc ha_federated.cc ha_berkeley.cc + sphinx/ha_sphinx.cc handler.cc hash_filo.cc hash_filo.h hostname.cc init.cc item.cc item_buff.cc item_cmpfunc.cc item_create.cc item_func.cc item_geofunc.cc item_row.cc diff -r 319c65835581 sql/Makefile.am --- a/sql/Makefile.am Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/Makefile.am Sun Jun 20 15:59:31 2010 +0400 @@ -68,6 +68,7 @@ sql_array.h sql_cursor.h \ examples/ha_example.h ha_archive.h \ examples/ha_tina.h ha_blackhole.h \ + sphinx/ha_sphinx.h \ ha_federated.h mysqld_SOURCES = sql_lex.cc sql_handler.cc \ item.cc item_sum.cc item_buff.cc item_func.cc \ @@ -105,6 +106,7 @@ sp_cache.cc parse_file.cc sql_trigger.cc \ examples/ha_example.cc ha_archive.cc \ examples/ha_tina.cc ha_blackhole.cc \ + sphinx/ha_sphinx.cc \ ha_federated.cc gen_lex_hash_SOURCES = gen_lex_hash.cc @@ -175,6 +177,10 @@ udf_example_la_SOURCES= udf_example.c udf_example_la_LDFLAGS= -module -rpath $(pkglibdir) +pkglib_LTLIBRARIES = sphinx/sphinx.la +sphinx_sphinx_la_SOURCES = sphinx/snippets_udf.cc +sphinx_sphinx_la_LDFLAGS = -module + # Don't update the files from bitkeeper %::SCCS/s.% diff -r 319c65835581 sql/handler.cc --- a/sql/handler.cc Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/handler.cc Sun Jun 20 15:59:31 2010 +0400 @@ -77,6 +77,15 @@ NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, HTON_NO_FLAGS }; #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +extern handlerton sphinx_hton; +#else +handlerton sphinx_hton = { "SPHINX", SHOW_OPTION_NO, "SPHINX storage engine", + DB_TYPE_SPHINX_DB, NULL, 0, 0, NULL, NULL, + NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, + HTON_NO_FLAGS }; +#endif #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" extern handlerton innobase_hton; @@ -141,6 +150,7 @@ &example_hton, &archive_hton, &tina_hton, + &sphinx_hton, &ndbcluster_hton, &federated_hton, &myisammrg_hton, @@ -342,6 +352,12 @@ return new (alloc) ha_tina(table); return NULL; #endif +#ifdef HAVE_SPHINX_DB + case DB_TYPE_SPHINX_DB: + if (have_sphinx_db == SHOW_OPTION_YES) + return new (alloc) ha_sphinx(table); + return NULL; +#endif #ifdef HAVE_NDBCLUSTER_DB case DB_TYPE_NDBCLUSTER: if (have_ndbcluster == SHOW_OPTION_YES) diff -r 319c65835581 sql/handler.h --- a/sql/handler.h Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/handler.h Sun Jun 20 15:59:31 2010 +0400 @@ -186,8 +186,9 @@ DB_TYPE_BERKELEY_DB, DB_TYPE_INNODB, DB_TYPE_GEMINI, DB_TYPE_NDBCLUSTER, DB_TYPE_EXAMPLE_DB, DB_TYPE_ARCHIVE_DB, DB_TYPE_CSV_DB, - DB_TYPE_FEDERATED_DB, + DB_TYPE_FEDERATED_DB, DB_TYPE_BLACKHOLE_DB, + DB_TYPE_SPHINX_DB, DB_TYPE_DEFAULT // Must be last }; diff -r 319c65835581 sql/mysql_priv.h --- a/sql/mysql_priv.h Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/mysql_priv.h Sun Jun 20 15:59:31 2010 +0400 @@ -1462,6 +1462,12 @@ #else extern SHOW_COMP_OPTION have_csv_db; #endif +#ifdef HAVE_SPHINX_DB +extern handlerton sphinx_hton; +#define have_sphinx_db sphinx_hton.state +#else +extern SHOW_COMP_OPTION have_sphinx_db; +#endif #ifdef HAVE_FEDERATED_DB extern handlerton federated_hton; #define have_federated_db federated_hton.state diff -r 319c65835581 sql/mysqld.cc --- a/sql/mysqld.cc Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/mysqld.cc Sun Jun 20 15:59:31 2010 +0400 @@ -36,6 +36,10 @@ #include #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +#endif + #ifdef HAVE_INNOBASE_DB #define OPT_INNODB_DEFAULT 1 #else @@ -6721,6 +6725,13 @@ #ifdef COMMUNITY_SERVER {"Uptime_since_flush_status",(char*) 0, SHOW_FLUSHTIME}, #endif +#ifdef HAVE_SPHINX_DB + {"sphinx_total", (char *)sphinx_showfunc_total, SHOW_SPHINX_FUNC}, + {"sphinx_total_found", (char *)sphinx_showfunc_total_found, SHOW_SPHINX_FUNC}, + {"sphinx_time", (char *)sphinx_showfunc_time, SHOW_SPHINX_FUNC}, + {"sphinx_word_count", (char *)sphinx_showfunc_word_count, SHOW_SPHINX_FUNC}, + {"sphinx_words", (char *)sphinx_showfunc_words, SHOW_SPHINX_FUNC}, +#endif {NullS, NullS, SHOW_LONG} }; @@ -6964,6 +6975,11 @@ #else have_csv_db= SHOW_OPTION_NO; #endif +#ifdef HAVE_SPHINX_DB + have_sphinx_db= SHOW_OPTION_YES; +#else + have_sphinx_db= SHOW_OPTION_NO; +#endif #ifdef HAVE_NDBCLUSTER_DB have_ndbcluster=SHOW_OPTION_DISABLED; #else @@ -8087,6 +8103,7 @@ #undef have_example_db #undef have_archive_db #undef have_csv_db +#undef have_sphinx_db #undef have_federated_db #undef have_partition_db #undef have_blackhole_db @@ -8097,6 +8114,7 @@ SHOW_COMP_OPTION have_example_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_archive_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_csv_db= SHOW_OPTION_NO; +SHOW_COMP_OPTION have_sphinx_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_federated_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_partition_db= SHOW_OPTION_NO; SHOW_COMP_OPTION have_blackhole_db= SHOW_OPTION_NO; diff -r 319c65835581 sql/set_var.cc --- a/sql/set_var.cc Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/set_var.cc Sun Jun 20 15:59:31 2010 +0400 @@ -913,6 +913,7 @@ {"have_profiling", (char*) &have_profiling, SHOW_HAVE}, {"have_crypt", (char*) &have_crypt, SHOW_HAVE}, {"have_csv", (char*) &have_csv_db, SHOW_HAVE}, + {"have_sphinx", (char*) &have_sphinx_db, SHOW_HAVE}, {"have_dynamic_loading", (char*) &have_dlopen, SHOW_HAVE}, {"have_example_engine", (char*) &have_example_db, SHOW_HAVE}, {"have_federated_engine", (char*) &have_federated_db, SHOW_HAVE}, diff -r 319c65835581 sql/sql_lex.h --- a/sql/sql_lex.h Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/sql_lex.h Sun Jun 20 15:59:31 2010 +0400 @@ -57,6 +57,7 @@ SQLCOM_SHOW_DATABASES, SQLCOM_SHOW_TABLES, SQLCOM_SHOW_FIELDS, SQLCOM_SHOW_KEYS, SQLCOM_SHOW_VARIABLES, SQLCOM_SHOW_LOGS, SQLCOM_SHOW_STATUS, SQLCOM_SHOW_INNODB_STATUS, SQLCOM_SHOW_NDBCLUSTER_STATUS, SQLCOM_SHOW_MUTEX_STATUS, + SQLCOM_SHOW_SPHINX_STATUS, SQLCOM_SHOW_PROCESSLIST, SQLCOM_SHOW_MASTER_STAT, SQLCOM_SHOW_SLAVE_STAT, SQLCOM_SHOW_GRANTS, SQLCOM_SHOW_CREATE, SQLCOM_SHOW_CHARSETS, SQLCOM_SHOW_COLLATIONS, SQLCOM_SHOW_CREATE_DB, SQLCOM_SHOW_TABLE_STATUS, diff -r 319c65835581 sql/sql_parse.cc --- a/sql/sql_parse.cc Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/sql_parse.cc Sun Jun 20 15:59:31 2010 +0400 @@ -24,6 +24,9 @@ #ifdef HAVE_INNOBASE_DB #include "ha_innodb.h" #endif +#ifdef HAVE_SPHINX_DB +#include "sphinx/ha_sphinx.h" +#endif #ifdef HAVE_NDBCLUSTER_DB #include "ha_ndbcluster.h" @@ -3166,6 +3169,15 @@ break; } #endif +#ifdef HAVE_SPHINX_DB + case SQLCOM_SHOW_SPHINX_STATUS: + { + if (check_global_access(thd, SUPER_ACL)) + goto error; + res = sphinx_show_status(thd); + break; + } +#endif #ifdef HAVE_REPLICATION case SQLCOM_LOAD_MASTER_TABLE: { diff -r 319c65835581 sql/sql_show.cc --- a/sql/sql_show.cc Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/sql_show.cc Sun Jun 20 15:59:31 2010 +0400 @@ -1500,6 +1500,16 @@ value= (char*) var->value_ptr(thd, value_type, &null_lex_str); charset= var->charset(thd); } + #ifdef HAVE_SPHINX_DB + else if (show_type == SHOW_SPHINX_FUNC) + { + SHOW_VAR var; + ((int (*)(THD *, SHOW_VAR *, char *))value)(thd, &var, buff); + + value = var.value; + show_type = var.type; + } + #endif /* HAVE_SPHINX_DB */ pos= end= buff; switch (show_type) { diff -r 319c65835581 sql/sql_yacc.yy --- a/sql/sql_yacc.yy Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/sql_yacc.yy Sun Jun 20 15:59:31 2010 +0400 @@ -8342,6 +8342,9 @@ case DB_TYPE_INNODB: Lex->sql_command = SQLCOM_SHOW_INNODB_STATUS; break; + case DB_TYPE_SPHINX_DB: + Lex->sql_command = SQLCOM_SHOW_SPHINX_STATUS; + break; default: my_error(ER_NOT_SUPPORTED_YET, MYF(0), "STATUS"); MYSQL_YYABORT; diff -r 319c65835581 sql/sql_yacc.cc --- a/sql/sql_yacc.cc Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/sql_yacc.cc Sun Jun 20 15:59:31 2010 +0400 @@ -27003,6 +27003,9 @@ case DB_TYPE_INNODB: Lex->sql_command = SQLCOM_SHOW_INNODB_STATUS; break; + case DB_TYPE_SPHINX_DB: + Lex->sql_command = SQLCOM_SHOW_SPHINX_STATUS; + break; default: my_error(ER_NOT_SUPPORTED_YET, MYF(0), "STATUS"); MYSQL_YYABORT; diff -r 319c65835581 sql/structs.h --- a/sql/structs.h Sun Jun 20 15:15:01 2010 +0400 +++ b/sql/structs.h Sun Jun 20 15:59:31 2010 +0400 @@ -194,6 +194,9 @@ SHOW_SSL_CTX_SESS_TIMEOUTS, SHOW_SSL_CTX_SESS_CACHE_FULL, SHOW_SSL_GET_CIPHER_LIST, #endif /* HAVE_OPENSSL */ +#ifdef HAVE_SPHINX_DB + SHOW_SPHINX_FUNC, +#endif SHOW_NET_COMPRESSION, SHOW_RPL_STATUS, SHOW_SLAVE_RUNNING, SHOW_SLAVE_RETRIED_TRANS, SHOW_KEY_CACHE_LONG, SHOW_KEY_CACHE_CONST_LONG, SHOW_KEY_CACHE_LONGLONG, diff -r 319c65835581 win/configure.js --- a/win/configure.js Sun Jun 20 15:15:01 2010 +0400 +++ b/win/configure.js Sun Jun 20 15:59:31 2010 +0400 @@ -45,6 +45,7 @@ case "WITH_EXAMPLE_STORAGE_ENGINE": case "WITH_FEDERATED_STORAGE_ENGINE": case "WITH_INNOBASE_STORAGE_ENGINE": + case "WITH_SPHINX_STORAGE_ENGINE": case "__NT__": case "DISABLE_GRANT_OPTIONS": case "EMBED_MANIFESTS": --- mysql-5.0.67/config/ac-macros/ha_sphinx.m4 1970-01-01 10:00:00.000000000 +1000 +++ mysql-5.0.67-sphinx/config/ac-macros/ha_sphinx.m4 2009-02-14 09:15:48.000000000 +1000 @@ -0,0 +1,30 @@ +dnl --------------------------------------------------------------------------- +dnl Macro: MYSQL_CHECK_EXAMPLEDB +dnl Sets HAVE_SPHINX_DB if --with-sphinx-storage-engine is used +dnl --------------------------------------------------------------------------- +AC_DEFUN([MYSQL_CHECK_SPHINXDB], [ + AC_ARG_WITH([sphinx-storage-engine], + [ + --with-sphinx-storage-engine + Enable the Sphinx Storage Engine], + [sphinxdb="$withval"], + [sphinxdb=no]) + AC_MSG_CHECKING([for example storage engine]) + + case "$sphinxdb" in + yes ) + AC_DEFINE([HAVE_SPHINX_DB], [1], [Builds Sphinx Engine]) + AC_MSG_RESULT([yes]) + [sphinxdb=yes] + ;; + * ) + AC_MSG_RESULT([no]) + [sphinxdb=no] + ;; + esac + +]) +dnl --------------------------------------------------------------------------- +dnl END OF MYSQL_CHECK_EXAMPLE SECTION +dnl --------------------------------------------------------------------------- + coreseek-4.1-beta/csft-4.1/python.m4100777 0 0 4420 11643565732 12244 0dnl prog-ensure.m4 -- Require that a program be found in the PATH. dnl $Id: prog-ensure.m4 6544 2003-12-26 03:23:31Z rra $ dnl dnl This is a version of AC_PATH_PROG that requires that the program being dnl searched for is found in the user's PATH. AC_DEFUN([INN_PATH_PROG_ENSURE], [AC_PATH_PROG([$1], [$2]) if test x"${$1}" = x ; then AC_MSG_ERROR([$2 was not found in path and is required]) fi]) dnl python.m4 -- Probe for the details needed to embed Python. dnl $Id: python.m4 6544 2003-12-26 03:23:31Z rra $ dnl dnl Defines INN_ARG_PYTHON, which sets up the --with-python command line dnl argument and also sets various flags needed for embedded Python if it is dnl requested. AC_DEFUN([INN_ARG_PYTHON], [AC_ARG_VAR([PYTHON], [Location of Python interpretor]) AC_ARG_WITH([python], [AC_HELP_STRING([--with-python], [Embedded Python datasource support [no]])], [case $withval in yes) USE_PYTHON=DO AC_DEFINE(USE_PYTHON, 1, [Define to compile in Python datasource support.]) ;; no) USE_PYTHON=DONT ;; *) AC_MSG_ERROR([invalid argument to --with-python]) ;; esac], USE_PYTHON=DONT) dnl A better way of doing this rather than grepping through the Makefile would dnl be to use distutils.sysconfig, but this module isn't available in older dnl versions of Python. if test x"$USE_PYTHON" = xDO ; then INN_PATH_PROG_ENSURE([PYTHON], [python]) AC_MSG_CHECKING([for Python linkage]) py_prefix=`$PYTHON -c 'import sys; print sys.prefix'` py_ver=`$PYTHON -c 'import sys; print sys.version[[:3]]'` py_libdir="$py_prefix/lib/python$py_ver" PYTHON_CPPFLAGS="-I$py_prefix/include/python$py_ver" py_linkage="" for py_linkpart in LIBS LIBC LIBM LOCALMODLIBS BASEMODLIBS \ LINKFORSHARED LDFLAGS ; do py_linkage="$py_linkage "`grep "^${py_linkpart}=" \ $py_libdir/config/Makefile \ | sed -e 's/^.*=//'` done dnl PYTHON_LIBS="-L$py_libdir/config -lpython$py_ver $py_linkage" PYTHON_LIBS="-L$py_libdir/config -lpython$py_ver " PYTHON_LIBS=`echo $PYTHON_LIBS | sed -e 's/[ \\t]*/ /g'` AC_MSG_RESULT([$py_libdir]) else PYTHON_CPPFLAGS= PYTHON_LIBS= fi AC_SUBST([PYTHON_CPPFLAGS]) AC_SUBST([PYTHON_LIBS])]) coreseek-4.1-beta/csft-4.1/smoke.sh100777 0 0 2224 11643565732 12133 0#!/bin/sh jobs=$(grep -c processor /proc/cpuinfo) FAILLOG="/tmp/faillog" LINE="-------------------------------\n" if [ q"1" = q"$jobs" ] ; then jobs="" else jobs="-j$jobs" fi die() { cat $FAILLOG echo $LINE [ ! "z$2" = "z" ] && { eval $2; echo "$LINE"; } echo "$1" [ -e "$FAILLOG" ] && rm $FAILLOG exit 1 } cmd1 () { echo "Executing: $2\n">$FAILLOG eval $2 1>>$1 2>&1 || die "$3" "$4" } cmd () { cmd1 "$FAILLOG" "$1" "$2" "$3" } cmd "mysql -u root test < example.sql" "Documents setup failed" for CONFARGS in "--with-debug" "--with-debug --enable-id64"; do BANNER="testing $CONFARGS build" cmd "./configure $CONFARGS" "$BANNER: configure failed" cmd "make clean" "$BANNER: make clean failed" cmd "make $jobs" "$BANNER: make failed" cmd1 "/dev/null" "cd ./test; php ubertest.php t -u test --strict-verbose --no-demo" "$BANNER: regression suite failed" "cat report.txt; rm report.txt" cd .. cmd "cd ./src; ./tests" "$BANNER: unit tests failed" cd .. cmd "cd ./api/libsphinxclient; ./smoke_test.sh" "$BANNER: C API tests failed" cd ../../ done make clean 1>/dev/null 2>&1 [ -e "$FAILLOG" ] && rm "$FAILLOG" echo "all ok\n" exit 0 coreseek-4.1-beta/csft-4.1/sphinx-min.conf.in100777 0 0 2105 11643565732 14025 0# # Minimal Sphinx configuration sample (clean, simple, functional) # source src1 { type = mysql sql_host = localhost sql_user = test sql_pass = sql_db = test sql_port = 3306 # optional, default is 3306 sql_query = \ SELECT id, group_id, UNIX_TIMESTAMP(date_added) AS date_added, title, content \ FROM documents sql_attr_uint = group_id sql_attr_timestamp = date_added sql_query_info = SELECT * FROM documents WHERE id=$id } index test1 { source = src1 path = @CONFDIR@/data/test1 docinfo = extern charset_type = sbcs } index testrt { type = rt rt_mem_limit = 32M path = @CONFDIR@/data/testrt charset_type = utf-8 rt_field = title rt_field = content rt_attr_uint = gid } indexer { mem_limit = 32M } searchd { listen = 9312 listen = 9306:mysql41 log = @CONFDIR@/log/searchd.log query_log = @CONFDIR@/log/query.log read_timeout = 5 max_children = 30 pid_file = @CONFDIR@/log/searchd.pid max_matches = 1000 seamless_rotate = 1 preopen_indexes = 1 unlink_old = 1 workers = threads # for RT to work } coreseek-4.1-beta/csft-4.1/sphinx.conf.in100777 0 0 62173 11643565732 13277 0# # Sphinx configuration file sample # # WARNING! While this sample file mentions all available options, # it contains (very) short helper descriptions only. Please refer to # doc/sphinx.html for details. # ############################################################################# ## data source definition ############################################################################# source src1 { # data source type. mandatory, no default value # known types are mysql, pgsql, mssql, xmlpipe, xmlpipe2, odbc type = mysql ##################################################################### ## SQL settings (for 'mysql' and 'pgsql' types) ##################################################################### # some straightforward parameters for SQL source types sql_host = localhost sql_user = test sql_pass = sql_db = test sql_port = 3306 # optional, default is 3306 # UNIX socket name # optional, default is empty (reuse client library defaults) # usually '/var/lib/mysql/mysql.sock' on Linux # usually '/tmp/mysql.sock' on FreeBSD # # sql_sock = /tmp/mysql.sock # MySQL specific client connection flags # optional, default is 0 # # mysql_connect_flags = 32 # enable compression # MySQL specific SSL certificate settings # optional, defaults are empty # # mysql_ssl_cert = /etc/ssl/client-cert.pem # mysql_ssl_key = /etc/ssl/client-key.pem # mysql_ssl_ca = /etc/ssl/cacert.pem # MS SQL specific Windows authentication mode flag # MUST be in sync with charset_type index-level setting # optional, default is 0 # # mssql_winauth = 1 # use currently logged on user credentials # MS SQL specific Unicode indexing flag # optional, default is 0 (request SBCS data) # # mssql_unicode = 1 # request Unicode data from server # ODBC specific DSN (data source name) # mandatory for odbc source type, no default value # # odbc_dsn = DBQ=C:\data;DefaultDir=C:\data;Driver={Microsoft Text Driver (*.txt; *.csv)}; # sql_query = SELECT id, data FROM documents.csv # ODBC and MS SQL specific, per-column buffer sizes # optional, default is auto-detect # # sql_column_buffers = content=12M, comments=1M # pre-query, executed before the main fetch query # multi-value, optional, default is empty list of queries # # sql_query_pre = SET NAMES utf8 # sql_query_pre = SET SESSION query_cache_type=OFF # main document fetch query # mandatory, integer document ID field MUST be the first selected column sql_query = \ SELECT id, group_id, UNIX_TIMESTAMP(date_added) AS date_added, title, content \ FROM documents # joined/payload field fetch query # joined fields let you avoid (slow) JOIN and GROUP_CONCAT # payload fields let you attach custom per-keyword values (eg. for ranking) # # syntax is FIELD-NAME 'from' ( 'query' | 'payload-query' ); QUERY # joined field QUERY should return 2 columns (docid, text) # payload field QUERY should return 3 columns (docid, keyword, weight) # # REQUIRES that query results are in ascending document ID order! # multi-value, optional, default is empty list of queries # # sql_joined_field = tags from query; SELECT docid, CONCAT('tag',tagid) FROM tags ORDER BY docid ASC # sql_joined_field = wtags from payload-query; SELECT docid, tag, tagweight FROM tags ORDER BY docid ASC # file based field declaration # # content of this field is treated as a file name # and the file gets loaded and indexed in place of a field # # max file size is limited by max_file_field_buffer indexer setting # file IO errors are non-fatal and get reported as warnings # # sql_file_field = content_file_path # range query setup, query that must return min and max ID values # optional, default is empty # # sql_query will need to reference $start and $end boundaries # if using ranged query: # # sql_query = \ # SELECT doc.id, doc.id AS group, doc.title, doc.data \ # FROM documents doc \ # WHERE id>=$start AND id<=$end # # sql_query_range = SELECT MIN(id),MAX(id) FROM documents # range query step # optional, default is 1024 # # sql_range_step = 1000 # unsigned integer attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # optional bit size can be specified, default is 32 # # sql_attr_uint = author_id # sql_attr_uint = forum_id:9 # 9 bits for forum_id sql_attr_uint = group_id # boolean attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # equivalent to sql_attr_uint with 1-bit size # # sql_attr_bool = is_deleted # bigint attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # declares a signed (unlike uint!) 64-bit attribute # # sql_attr_bigint = my_bigint_id # UNIX timestamp attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # similar to integer, but can also be used in date functions # # sql_attr_timestamp = posted_ts # sql_attr_timestamp = last_edited_ts sql_attr_timestamp = date_added # string ordinal attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # sorts strings (bytewise), and stores their indexes in the sorted list # sorting by this attr is equivalent to sorting by the original strings # # sql_attr_str2ordinal = author_name # floating point attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # values are stored in single precision, 32-bit IEEE 754 format # # sql_attr_float = lat_radians # sql_attr_float = long_radians # multi-valued attribute (MVA) attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # MVA values are variable length lists of unsigned 32-bit integers # # syntax is ATTR-TYPE ATTR-NAME 'from' SOURCE-TYPE [;QUERY] [;RANGE-QUERY] # ATTR-TYPE is 'uint' or 'timestamp' # SOURCE-TYPE is 'field', 'query', or 'ranged-query' # QUERY is SQL query used to fetch all ( docid, attrvalue ) pairs # RANGE-QUERY is SQL query used to fetch min and max ID values, similar to 'sql_query_range' # # sql_attr_multi = uint tag from query; SELECT docid, tagid FROM tags # sql_attr_multi = uint tag from ranged-query; \ # SELECT docid, tagid FROM tags WHERE id>=$start AND id<=$end; \ # SELECT MIN(docid), MAX(docid) FROM tags # string attribute declaration # multi-value (an arbitrary number of these is allowed), optional # lets you store and retrieve strings # # sql_attr_string = stitle # wordcount attribute declaration # multi-value (an arbitrary number of these is allowed), optional # lets you count the words at indexing time # # sql_attr_str2wordcount = stitle # combined field plus attribute declaration (from a single column) # stores column as an attribute, but also indexes it as a full-text field # # sql_field_string = author # sql_field_str2wordcount = title # post-query, executed on sql_query completion # optional, default is empty # # sql_query_post = # post-index-query, executed on successful indexing completion # optional, default is empty # $maxid expands to max document ID actually fetched from DB # # sql_query_post_index = REPLACE INTO counters ( id, val ) \ # VALUES ( 'max_indexed_id', $maxid ) # ranged query throttling, in milliseconds # optional, default is 0 which means no delay # enforces given delay before each query step sql_ranged_throttle = 0 # document info query, ONLY for CLI search (ie. testing and debugging) # optional, default is empty # must contain $id macro and must fetch the document by that id sql_query_info = SELECT * FROM documents WHERE id=$id # kill-list query, fetches the document IDs for kill-list # k-list will suppress matches from preceding indexes in the same query # optional, default is empty # # sql_query_killlist = SELECT id FROM documents WHERE edited>=@last_reindex # columns to unpack on indexer side when indexing # multi-value, optional, default is empty list # # unpack_zlib = zlib_column # unpack_mysqlcompress = compressed_column # unpack_mysqlcompress = compressed_column_2 # maximum unpacked length allowed in MySQL COMPRESS() unpacker # optional, default is 16M # # unpack_mysqlcompress_maxsize = 16M ##################################################################### ## xmlpipe2 settings ##################################################################### # type = xmlpipe # shell command to invoke xmlpipe stream producer # mandatory # # xmlpipe_command = cat @CONFDIR@/test.xml # xmlpipe2 field declaration # multi-value, optional, default is empty # # xmlpipe_field = subject # xmlpipe_field = content # xmlpipe2 attribute declaration # multi-value, optional, default is empty # all xmlpipe_attr_XXX options are fully similar to sql_attr_XXX # # xmlpipe_attr_timestamp = published # xmlpipe_attr_uint = author_id # perform UTF-8 validation, and filter out incorrect codes # avoids XML parser choking on non-UTF-8 documents # optional, default is 0 # # xmlpipe_fixup_utf8 = 1 } # inherited source example # # all the parameters are copied from the parent source, # and may then be overridden in this source definition source src1throttled : src1 { sql_ranged_throttle = 100 } ############################################################################# ## index definition ############################################################################# # local index example # # this is an index which is stored locally in the filesystem # # all indexing-time options (such as morphology and charsets) # are configured per local index index test1 { # index type # optional, default is 'plain' # known values are 'plain', 'distributed', and 'rt' (see samples below) # type = plain # document source(s) to index # multi-value, mandatory # document IDs must be globally unique across all sources source = src1 # index files path and file name, without extension # mandatory, path must be writable, extensions will be auto-appended path = @CONFDIR@/data/test1 # document attribute values (docinfo) storage mode # optional, default is 'extern' # known values are 'none', 'extern' and 'inline' docinfo = extern # memory locking for cached data (.spa and .spi), to prevent swapping # optional, default is 0 (do not mlock) # requires searchd to be run from root mlock = 0 # a list of morphology preprocessors to apply # optional, default is empty # # builtin preprocessors are 'none', 'stem_en', 'stem_ru', 'stem_enru', # 'soundex', and 'metaphone'; additional preprocessors available from # libstemmer are 'libstemmer_XXX', where XXX is algorithm code # (see libstemmer_c/libstemmer/modules.txt) # # morphology = stem_en, stem_ru, soundex # morphology = libstemmer_german # morphology = libstemmer_sv morphology = none # minimum word length at which to enable stemming # optional, default is 1 (stem everything) # # min_stemming_len = 1 # stopword files list (space separated) # optional, default is empty # contents are plain text, charset_table and stemming are both applied # # stopwords = @CONFDIR@/data/stopwords.txt # wordforms file, in "mapfrom > mapto" plain text format # optional, default is empty # # wordforms = @CONFDIR@/data/wordforms.txt # tokenizing exceptions file # optional, default is empty # # plain text, case sensitive, space insensitive in map-from part # one "Map Several Words => ToASingleOne" entry per line # # exceptions = @CONFDIR@/data/exceptions.txt # minimum indexed word length # default is 1 (index everything) min_word_len = 1 # charset encoding type # optional, default is 'sbcs' # known types are 'sbcs' (Single Byte CharSet) and 'utf-8' charset_type = sbcs # charset definition and case folding rules "table" # optional, default value depends on charset_type # # defaults are configured to include English and Russian characters only # you need to change the table to include additional ones # this behavior MAY change in future versions # # 'sbcs' default value is # charset_table = 0..9, A..Z->a..z, _, a..z, U+A8->U+B8, U+B8, U+C0..U+DF->U+E0..U+FF, U+E0..U+FF # # 'utf-8' default value is # charset_table = 0..9, A..Z->a..z, _, a..z, U+410..U+42F->U+430..U+44F, U+430..U+44F # ignored characters list # optional, default value is empty # # ignore_chars = U+00AD # minimum word prefix length to index # optional, default is 0 (do not index prefixes) # # min_prefix_len = 0 # minimum word infix length to index # optional, default is 0 (do not index infixes) # # min_infix_len = 0 # list of fields to limit prefix/infix indexing to # optional, default value is empty (index all fields in prefix/infix mode) # # prefix_fields = filename # infix_fields = url, domain # enable star-syntax (wildcards) when searching prefix/infix indexes # search-time only, does not affect indexing, can be 0 or 1 # optional, default is 0 (do not use wildcard syntax) # # enable_star = 1 # expand keywords with exact forms and/or stars when searching fit indexes # search-time only, does not affect indexing, can be 0 or 1 # optional, default is 0 (do not expand keywords) # # expand_keywords = 1 # n-gram length to index, for CJK indexing # only supports 0 and 1 for now, other lengths to be implemented # optional, default is 0 (disable n-grams) # # ngram_len = 1 # n-gram characters list, for CJK indexing # optional, default is empty # # ngram_chars = U+3000..U+2FA1F # phrase boundary characters list # optional, default is empty # # phrase_boundary = ., ?, !, U+2026 # horizontal ellipsis # phrase boundary word position increment # optional, default is 0 # # phrase_boundary_step = 100 # blended characters list # blended chars are indexed both as separators and valid characters # for instance, AT&T will results in 3 tokens ("at", "t", and "at&t") # optional, default is empty # # blend_chars = +, &, U+23 # blended token indexing mode # a comma separated list of blended token indexing variants # known variants are trim_none, trim_head, trim_tail, trim_both, skip_pure # optional, default is trim_none # # blend_mode = trim_tail, skip_pure # whether to strip HTML tags from incoming documents # known values are 0 (do not strip) and 1 (do strip) # optional, default is 0 html_strip = 0 # what HTML attributes to index if stripping HTML # optional, default is empty (do not index anything) # # html_index_attrs = img=alt,title; a=title; # what HTML elements contents to strip # optional, default is empty (do not strip element contents) # # html_remove_elements = style, script # whether to preopen index data files on startup # optional, default is 0 (do not preopen), searchd-only # # preopen = 1 # whether to keep dictionary (.spi) on disk, or cache it in RAM # optional, default is 0 (cache in RAM), searchd-only # # ondisk_dict = 1 # whether to enable in-place inversion (2x less disk, 90-95% speed) # optional, default is 0 (use separate temporary files), indexer-only # # inplace_enable = 1 # in-place fine-tuning options # optional, defaults are listed below # # inplace_hit_gap = 0 # preallocated hitlist gap size # inplace_docinfo_gap = 0 # preallocated docinfo gap size # inplace_reloc_factor = 0.1 # relocation buffer size within arena # inplace_write_factor = 0.1 # write buffer size within arena # whether to index original keywords along with stemmed versions # enables "=exactform" operator to work # optional, default is 0 # # index_exact_words = 1 # position increment on overshort (less that min_word_len) words # optional, allowed values are 0 and 1, default is 1 # # overshort_step = 1 # position increment on stopword # optional, allowed values are 0 and 1, default is 1 # # stopword_step = 1 # hitless words list # positions for these keywords will not be stored in the index # optional, allowed values are 'all', or a list file name # # hitless_words = all # hitless_words = hitless.txt # detect and index sentence and paragraph boundaries # required for the SENTENCE and PARAGRAPH operators to work # optional, allowed values are 0 and 1, default is 0 # # index_sp = 1 # index zones, delimited by HTML/XML tags # a comma separated list of tags and wildcards # required for the ZONE operator to work # optional, default is empty string (do not index zones) # # index_zones = title, h*, th } # inherited index example # # all the parameters are copied from the parent index, # and may then be overridden in this index definition index test1stemmed : test1 { path = @CONFDIR@/data/test1stemmed morphology = stem_en } # distributed index example # # this is a virtual index which can NOT be directly indexed, # and only contains references to other local and/or remote indexes index dist1 { # 'distributed' index type MUST be specified type = distributed # local index to be searched # there can be many local indexes configured local = test1 local = test1stemmed # remote agent # multiple remote agents may be specified # syntax for TCP connections is 'hostname:port:index1,[index2[,...]]' # syntax for local UNIX connections is '/path/to/socket:index1,[index2[,...]]' agent = localhost:9313:remote1 agent = localhost:9314:remote2,remote3 # agent = /var/run/searchd.sock:remote4 # blackhole remote agent, for debugging/testing # network errors and search results will be ignored # # agent_blackhole = testbox:9312:testindex1,testindex2 # remote agent connection timeout, milliseconds # optional, default is 1000 ms, ie. 1 sec agent_connect_timeout = 1000 # remote agent query timeout, milliseconds # optional, default is 3000 ms, ie. 3 sec agent_query_timeout = 3000 } # realtime index example # # you can run INSERT, REPLACE, and DELETE on this index on the fly # using MySQL protocol (see 'listen' directive below) index rt { # 'rt' index type must be specified to use RT index type = rt # index files path and file name, without extension # mandatory, path must be writable, extensions will be auto-appended path = @CONFDIR@/data/rt # RAM chunk size limit # RT index will keep at most this much data in RAM, then flush to disk # optional, default is 32M # # rt_mem_limit = 512M # full-text field declaration # multi-value, mandatory rt_field = title rt_field = content # unsigned integer attribute declaration # multi-value (an arbitrary number of attributes is allowed), optional # declares an unsigned 32-bit attribute rt_attr_uint = gid # RT indexes currently support the following attribute types: # uint, bigint, float, timestamp, string # # rt_attr_bigint = guid # rt_attr_float = gpa # rt_attr_timestamp = ts_added # rt_attr_string = author } ############################################################################# ## indexer settings ############################################################################# indexer { # memory limit, in bytes, kiloytes (16384K) or megabytes (256M) # optional, default is 32M, max is 2047M, recommended is 256M to 1024M mem_limit = 32M # maximum IO calls per second (for I/O throttling) # optional, default is 0 (unlimited) # # max_iops = 40 # maximum IO call size, bytes (for I/O throttling) # optional, default is 0 (unlimited) # # max_iosize = 1048576 # maximum xmlpipe2 field length, bytes # optional, default is 2M # # max_xmlpipe2_field = 4M # write buffer size, bytes # several (currently up to 4) buffers will be allocated # write buffers are allocated in addition to mem_limit # optional, default is 1M # # write_buffer = 1M # maximum file field adaptive buffer size # optional, default is 8M, minimum is 1M # # max_file_field_buffer = 32M } ############################################################################# ## searchd settings ############################################################################# searchd { # [hostname:]port[:protocol], or /unix/socket/path to listen on # known protocols are 'sphinx' (SphinxAPI) and 'mysql41' (SphinxQL) # # multi-value, multiple listen points are allowed # optional, defaults are 9312:sphinx and 9306:mysql41, as below # # listen = 127.0.0.1 # listen = 192.168.0.1:9312 # listen = 9312 # listen = /var/run/searchd.sock listen = 9312 listen = 9306:mysql41 # log file, searchd run info is logged here # optional, default is 'searchd.log' log = @CONFDIR@/log/searchd.log # query log file, all search queries are logged here # optional, default is empty (do not log queries) query_log = @CONFDIR@/log/query.log # client read timeout, seconds # optional, default is 5 read_timeout = 5 # request timeout, seconds # optional, default is 5 minutes client_timeout = 300 # maximum amount of children to fork (concurrent searches to run) # optional, default is 0 (unlimited) max_children = 30 # PID file, searchd process ID file name # mandatory pid_file = @CONFDIR@/log/searchd.pid # max amount of matches the daemon ever keeps in RAM, per-index # WARNING, THERE'S ALSO PER-QUERY LIMIT, SEE SetLimits() API CALL # default is 1000 (just like Google) max_matches = 1000 # seamless rotate, prevents rotate stalls if precaching huge datasets # optional, default is 1 seamless_rotate = 1 # whether to forcibly preopen all indexes on startup # optional, default is 1 (preopen everything) preopen_indexes = 1 # whether to unlink .old index copies on succesful rotation. # optional, default is 1 (do unlink) unlink_old = 1 # attribute updates periodic flush timeout, seconds # updates will be automatically dumped to disk this frequently # optional, default is 0 (disable periodic flush) # # attr_flush_period = 900 # instance-wide ondisk_dict defaults (per-index value take precedence) # optional, default is 0 (precache all dictionaries in RAM) # # ondisk_dict_default = 1 # MVA updates pool size # shared between all instances of searchd, disables attr flushes! # optional, default size is 1M mva_updates_pool = 1M # max allowed network packet size # limits both query packets from clients, and responses from agents # optional, default size is 8M max_packet_size = 8M # crash log path # searchd will (try to) log crashed query to 'crash_log_path.PID' file # optional, default is empty (do not create crash logs) # # crash_log_path = @CONFDIR@/log/crash # max allowed per-query filter count # optional, default is 256 max_filters = 256 # max allowed per-filter values count # optional, default is 4096 max_filter_values = 4096 # socket listen queue length # optional, default is 5 # # listen_backlog = 5 # per-keyword read buffer size # optional, default is 256K # # read_buffer = 256K # unhinted read size (currently used when reading hits) # optional, default is 32K # # read_unhinted = 32K # max allowed per-batch query count (aka multi-query count) # optional, default is 32 max_batch_queries = 32 # max common subtree document cache size, per-query # optional, default is 0 (disable subtree optimization) # # subtree_docs_cache = 4M # max common subtree hit cache size, per-query # optional, default is 0 (disable subtree optimization) # # subtree_hits_cache = 8M # multi-processing mode (MPM) # known values are none, fork, prefork, and threads # optional, default is fork # workers = threads # for RT to work # max threads to create for searching local parts of a distributed index # optional, default is 0, which means disable multi-threaded searching # should work with all MPMs (ie. does NOT require workers=threads) # # dist_threads = 4 # binlog files path; use empty string to disable binlog # optional, default is build-time configured data directory # # binlog_path = # disable logging # binlog_path = @CONFDIR@/data # binlog.001 etc will be created there # binlog flush/sync mode # 0 means flush and sync every second # 1 means flush and sync every transaction # 2 means flush every transaction, sync every second # optional, default is 2 # # binlog_flush = 2 # binlog per-file size limit # optional, default is 128M, 0 means no limit # # binlog_max_log_size = 256M # per-thread stack size, only affects workers=threads mode # optional, default is 64K # # thread_stack = 128K # per-keyword expansion limit (for dict=keywords prefix searches) # optional, default is 0 (no limit) # # expansion_limit = 1000 # RT RAM chunks flush period # optional, default is 0 (no periodic flush) # # rt_flush_period = 900 # query log file format # optional, known values are plain and sphinxql, default is plain # # query_log_format = sphinxql # version string returned to MySQL network protocol clients # optional, default is empty (use Sphinx version) # # mysql_version_string = 5.0.37 # trusted plugin directory # optional, default is empty (disable UDFs) # # plugin_dir = /usr/local/sphinx/lib # default server-wide collation # optional, default is libc_ci # # collation_server = utf8_general_ci # server-wide locale for libc based collations # optional, default is C # # collation_libc_locale = ru_RU.UTF-8 # threaded server watchdog (only used in workers=threads mode) # optional, values are 0 and 1, default is 1 (watchdog on) # # watchdog = 1 # SphinxQL compatibility mode (legacy columns and their names) # optional, default is 0 (SQL compliant syntax and result sets) # # compat_sphinxql_magics = 1 } # --eof-- coreseek-4.1-beta/csft-4.1/sphinx.spec100777 0 0 1507 11643565732 12651 0Summary: Sphinx full-text search engine Name: sphinx Version: 0.9.9 Release: r1207 License: GPL Group: Development BuildRoot: /tmp/sphinx-%{version}-svn-%{release} Source: http://sphinxsearch.com/downloads/sphinx-%{version}-svn-%{release}.tar.gz URL: http://sphinxsearch.com/ BuildRequires: mysql-devel Requires: mysql %description Sphinx is a free, open-source full-text search engine, designed with indexing database content in mind. %prep %setup -n sphinx-%{version}-svn-%{release} %build CPPFLAGS="-D_FILE_OFFSET_BITS=64" export CPPFLAGS %configure make %install mkdir -p $RPM_BUILD_ROOT make DESTDIR=$RPM_BUILD_ROOT install mkdir -p $RPM_BUILD_ROOT/%{_libdir}/sphinx cp -R -p api $RPM_BUILD_ROOT/%{_libdir}/sphinx %files /usr/bin/* %{_libdir}/sphinx %config /etc/* %doc INSTALL doc/sphinx.* %clean rm -rf $RPM_BUILD_ROOT coreseek-4.1-beta/csft-4.1/sphinx.workspace100777 0 0 1766 11643565732 13724 0 coreseek-4.1-beta/csft-4.1/sphinx05.sln100777 0 0 11735 11643565732 12704 0Microsoft Visual Studio Solution File, Format Version 9.00 # Visual Studio 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "indexer", "win\indexer05.vcproj", "{405619C7-CC22-4FB8-9237-B196CB897355}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libsphinx", "win\libsphinx05.vcproj", "{6A1685DE-0265-4243-965F-96CB53EBBCA6}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "search", "win\search05.vcproj", "{571DC41A-2665-476C-ABED-3899324E19AB}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "searchd", "win\searchd05.vcproj", "{0BBD34CB-5891-477F-B665-3D7C9FC22A02}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "tests", "win\tests05.vcproj", "{B47166A1-4827-4D80-97E3-743BDE61146F}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spelldump", "win\spelldump05.vcproj", "{AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "indextool", "win\indextool05.vcproj", "{6A78A67D-A743-4594-858A-A4F1C536A8C1}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "testrt", "win\testrt05.vcproj", "{651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {405619C7-CC22-4FB8-9237-B196CB897355}.Debug|Win32.ActiveCfg = Debug|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Debug|Win32.Build.0 = Debug|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Release|Win32.ActiveCfg = Release|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Release|Win32.Build.0 = Release|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Debug|Win32.ActiveCfg = Debug|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Debug|Win32.Build.0 = Debug|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Release|Win32.ActiveCfg = Release|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Release|Win32.Build.0 = Release|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Debug|Win32.ActiveCfg = Debug|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Debug|Win32.Build.0 = Debug|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Release|Win32.ActiveCfg = Release|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Release|Win32.Build.0 = Release|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Debug|Win32.ActiveCfg = Debug|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Debug|Win32.Build.0 = Debug|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Release|Win32.ActiveCfg = Release|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Release|Win32.Build.0 = Release|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Debug|Win32.ActiveCfg = Debug|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Debug|Win32.Build.0 = Debug|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Release|Win32.ActiveCfg = Release|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Release|Win32.Build.0 = Release|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Debug|Win32.ActiveCfg = Debug|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Debug|Win32.Build.0 = Debug|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Release|Win32.ActiveCfg = Release|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Release|Win32.Build.0 = Release|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Debug|Win32.ActiveCfg = Debug|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Debug|Win32.Build.0 = Debug|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Release|Win32.ActiveCfg = Release|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Release|Win32.Build.0 = Release|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Debug|Win32.ActiveCfg = Debug|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Debug|Win32.Build.0 = Debug|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Release|Win32.ActiveCfg = Release|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal coreseek-4.1-beta/csft-4.1/sphinx08.sln100777 0 0 16033 11643565732 12703 0Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "indexer", "win\indexer08.vcproj", "{405619C7-CC22-4FB8-9237-B196CB897355}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libsphinx", "win\libsphinx08.vcproj", "{6A1685DE-0265-4243-965F-96CB53EBBCA6}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "search", "win\search08.vcproj", "{571DC41A-2665-476C-ABED-3899324E19AB}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "searchd", "win\searchd08.vcproj", "{0BBD34CB-5891-477F-B665-3D7C9FC22A02}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spelldump", "win\spelldump08.vcproj", "{AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "indextool", "win\indextool08.vcproj", "{6A78A67D-A743-4594-858A-A4F1C536A8C1}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "testrt", "win\testrt08.vcproj", "{651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "tests", "win\tests08.vcproj", "{B47166A1-4827-4D80-97E3-743BDE61146F}" ProjectSection(ProjectDependencies) = postProject {6A1685DE-0265-4243-965F-96CB53EBBCA6} = {6A1685DE-0265-4243-965F-96CB53EBBCA6} EndProjectSection EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {405619C7-CC22-4FB8-9237-B196CB897355}.Debug|Win32.ActiveCfg = Debug|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Debug|Win32.Build.0 = Debug|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Debug|x64.ActiveCfg = Debug|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Release|Win32.ActiveCfg = Release|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Release|Win32.Build.0 = Release|Win32 {405619C7-CC22-4FB8-9237-B196CB897355}.Release|x64.ActiveCfg = Release|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Debug|Win32.ActiveCfg = Debug|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Debug|Win32.Build.0 = Debug|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Debug|x64.ActiveCfg = Debug|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Release|Win32.ActiveCfg = Release|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Release|Win32.Build.0 = Release|Win32 {6A1685DE-0265-4243-965F-96CB53EBBCA6}.Release|x64.ActiveCfg = Release|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Debug|Win32.ActiveCfg = Debug|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Debug|Win32.Build.0 = Debug|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Debug|x64.ActiveCfg = Debug|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Release|Win32.ActiveCfg = Release|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Release|Win32.Build.0 = Release|Win32 {571DC41A-2665-476C-ABED-3899324E19AB}.Release|x64.ActiveCfg = Release|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Debug|Win32.ActiveCfg = Debug|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Debug|Win32.Build.0 = Debug|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Debug|x64.ActiveCfg = Debug|x64 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Debug|x64.Build.0 = Debug|x64 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Release|Win32.ActiveCfg = Release|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Release|Win32.Build.0 = Release|Win32 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Release|x64.ActiveCfg = Release|x64 {0BBD34CB-5891-477F-B665-3D7C9FC22A02}.Release|x64.Build.0 = Release|x64 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Debug|Win32.ActiveCfg = Debug|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Debug|Win32.Build.0 = Debug|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Debug|x64.ActiveCfg = Debug|x64 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Debug|x64.Build.0 = Debug|x64 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Release|Win32.ActiveCfg = Release|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Release|Win32.Build.0 = Release|Win32 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Release|x64.ActiveCfg = Release|x64 {AE5236EB-62AC-4AD9-81A3-F4BDC85D3876}.Release|x64.Build.0 = Release|x64 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Debug|Win32.ActiveCfg = Debug|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Debug|Win32.Build.0 = Debug|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Debug|x64.ActiveCfg = Debug|x64 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Debug|x64.Build.0 = Debug|x64 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Release|Win32.ActiveCfg = Release|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Release|Win32.Build.0 = Release|Win32 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Release|x64.ActiveCfg = Release|x64 {6A78A67D-A743-4594-858A-A4F1C536A8C1}.Release|x64.Build.0 = Release|x64 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Debug|Win32.ActiveCfg = Debug|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Debug|Win32.Build.0 = Debug|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Debug|x64.ActiveCfg = Debug|x64 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Debug|x64.Build.0 = Debug|x64 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Release|Win32.ActiveCfg = Release|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Release|Win32.Build.0 = Release|Win32 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Release|x64.ActiveCfg = Release|x64 {651CEFE5-9BDB-4003-9D35-8D05FA2C06D7}.Release|x64.Build.0 = Release|x64 {B47166A1-4827-4D80-97E3-743BDE61146F}.Debug|Win32.ActiveCfg = Debug|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Debug|Win32.Build.0 = Debug|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Debug|x64.ActiveCfg = Debug|x64 {B47166A1-4827-4D80-97E3-743BDE61146F}.Debug|x64.Build.0 = Debug|x64 {B47166A1-4827-4D80-97E3-743BDE61146F}.Release|Win32.ActiveCfg = Release|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Release|Win32.Build.0 = Release|Win32 {B47166A1-4827-4D80-97E3-743BDE61146F}.Release|x64.ActiveCfg = Release|x64 {B47166A1-4827-4D80-97E3-743BDE61146F}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal coreseek-4.1-beta/csft-4.1/src/ 40777 0 0 0 11647303567 11150 5coreseek-4.1-beta/csft-4.1/src/indexer.cpp100777 0 0 146574 11643565732 13473 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxint.h" #include "sphinxutils.h" #include #include #include #include #include #include "py_layer.h" #if USE_WINDOWS #define snprintf _snprintf #include #include #else #include #endif ///////////////////////////////////////////////////////////////////////////// bool g_bQuiet = false; bool g_bProgress = true; bool g_bPrintQueries = false; const char * g_sBuildStops = NULL; int g_iTopStops = 100; bool g_bRotate = false; bool g_bRotateEach = false; bool g_bBuildFreqs = false; int g_iMemLimit = 0; int g_iMaxXmlpipe2Field = 0; int g_iWriteBuffer = 0; int g_iMaxFileFieldBuffer = 1024*1024; ESphOnFileFieldError g_eOnFileFieldError = FFE_IGNORE_FIELD; const int EXT_COUNT = 8; const char * g_dExt[EXT_COUNT] = { "sph", "spa", "spi", "spd", "spp", "spm", "spk", "sps" }; char g_sMinidump[256]; #define ROTATE_MIN_INTERVAL 100000 // rotate interval 100 ms ///////////////////////////////////////////////////////////////////////////// /* // -- this block moved to sphinxutils.h -coreseek -pysource template < typename T > struct CSphMTFHashEntry { CSphString m_sKey; CSphMTFHashEntry * m_pNext; int m_iSlot; T m_tValue; }; template < typename T, int SIZE, class HASHFUNC > class CSphMTFHash { public: /// ctor CSphMTFHash () { m_pData = new CSphMTFHashEntry * [ SIZE ]; for ( int i=0; i * pHead = m_pData[i]; while ( pHead ) { CSphMTFHashEntry * pNext = pHead->m_pNext; SafeDelete ( pHead ); pHead = pNext; } } } /// add record to hash /// OPTIMIZE: should pass T not by reference for simple types T & Add ( const char * sKey, int iKeyLen, T & tValue ) { DWORD uHash = HASHFUNC::Hash ( sKey ) % SIZE; // find matching entry CSphMTFHashEntry * pEntry = m_pData [ uHash ]; CSphMTFHashEntry * pPrev = NULL; while ( pEntry && strcmp ( sKey, pEntry->m_sKey.cstr() ) ) { pPrev = pEntry; pEntry = pEntry->m_pNext; } if ( !pEntry ) { // not found, add it, but don't MTF pEntry = new CSphMTFHashEntry; if ( iKeyLen ) pEntry->m_sKey.SetBinary ( sKey, iKeyLen ); else pEntry->m_sKey = sKey; pEntry->m_pNext = NULL; pEntry->m_iSlot = (int)uHash; pEntry->m_tValue = tValue; if ( !pPrev ) m_pData [ uHash ] = pEntry; else pPrev->m_pNext = pEntry; } else { // MTF on access if ( pPrev ) { pPrev->m_pNext = pEntry->m_pNext; pEntry->m_pNext = m_pData [ uHash ]; m_pData [ uHash ] = pEntry; } } return pEntry->m_tValue; } /// find first non-empty entry const CSphMTFHashEntry * FindFirst () { for ( int i=0; i * FindNext ( const CSphMTFHashEntry * pEntry ) { assert ( pEntry ); if ( pEntry->m_pNext ) return pEntry->m_pNext; for ( int i=1+pEntry->m_iSlot; i ** m_pData; }; #define HASH_FOREACH(_it,_hash) \ for ( _it=_hash.FindFirst(); _it; _it=_hash.FindNext(_it) ) */ ///////////////////////////////////////////////////////////////////////////// struct Word_t { const char * m_sWord; int m_iCount; }; inline bool operator < ( const Word_t & a, const Word_t & b) { return a.m_iCount < b.m_iCount; }; class CSphStopwordBuilderDict : public CSphDict { public: CSphStopwordBuilderDict () {} void Save ( const char * sOutput, int iTop, bool bFreqs ); public: virtual SphWordID_t GetWordID ( BYTE * pWord ); virtual SphWordID_t GetWordID ( const BYTE * pWord, int iLen, bool ); virtual void LoadStopwords ( const char *, ISphTokenizer * ) {} virtual bool LoadWordforms ( const char *, ISphTokenizer *, const char * ) { return true; } virtual bool SetMorphology ( const char *, bool, CSphString & ) { return true; } virtual void Setup ( const CSphDictSettings & tSettings ) { m_tSettings = tSettings; } virtual const CSphDictSettings & GetSettings () const { return m_tSettings; } virtual const CSphVector & GetStopwordsFileInfos () { return m_dSWFileInfos; } virtual const CSphSavedFile & GetWordformsFileInfo () { return m_tWFFileInfo; } virtual const CSphMultiformContainer * GetMultiWordforms () const { return NULL; } virtual bool IsStopWord ( const BYTE * ) const { return false; } protected: struct HashFunc_t { static inline DWORD Hash ( const char * sKey ) { return sphCRC32 ( (const BYTE*)sKey ); } }; protected: CSphMTFHash < int, 1048576, HashFunc_t > m_hWords; // fake setttings CSphDictSettings m_tSettings; CSphVector m_dSWFileInfos; CSphSavedFile m_tWFFileInfo; }; void CSphStopwordBuilderDict::Save ( const char * sOutput, int iTop, bool bFreqs ) { FILE * fp = fopen ( sOutput, "w+" ); if ( !fp ) return; CSphVector dTop; dTop.Reserve ( 1024 ); const CSphMTFHashEntry * it; HASH_FOREACH ( it, m_hWords ) { Word_t t; t.m_sWord = it->m_sKey.cstr(); t.m_iCount = it->m_tValue; dTop.Add ( t ); } dTop.RSort (); ARRAY_FOREACH ( i, dTop ) { if ( i>=iTop ) break; if ( bFreqs ) fprintf ( fp, "%s %d\n", dTop[i].m_sWord, dTop[i].m_iCount ); else fprintf ( fp, "%s\n", dTop[i].m_sWord ); } fclose ( fp ); } SphWordID_t CSphStopwordBuilderDict::GetWordID ( BYTE * pWord ) { int iZero = 0; m_hWords.Add ( (const char *)pWord, 0, iZero )++; return 1; } SphWordID_t CSphStopwordBuilderDict::GetWordID ( const BYTE * pWord, int iLen, bool ) { int iZero = 0; m_hWords.Add ( (const char *)pWord, iLen, iZero )++; return 1; } ///////////////////////////////////////////////////////////////////////////// void ShowProgress ( const CSphIndexProgress * pProgress, bool bPhaseEnd ) { // if in quiet mode, do not show anything at all // if in no-progress mode, only show phase ends if ( g_bQuiet || ( !g_bProgress && !bPhaseEnd ) ) return; fprintf ( stdout, "%s%c", pProgress->BuildMessage(), bPhaseEnd ? '\n' : '\r' ); fflush ( stdout ); } static void Logger ( ESphLogLevel eLevel, const char * sFmt, va_list ap ) { if ( eLevel>=SPH_LOG_DEBUG ) return; switch ( eLevel ) { case SPH_LOG_FATAL: fprintf ( stdout, "FATAL: " ); break; case SPH_LOG_WARNING: fprintf ( stdout, "WARNING: " ); break; case SPH_LOG_INFO: fprintf ( stdout, "WARNING: " ); break; case SPH_LOG_DEBUG: // yes, I know that this branch will never execute because of the condition above. case SPH_LOG_VERBOSE_DEBUG: case SPH_LOG_VERY_VERBOSE_DEBUG: fprintf ( stdout, "DEBUG: " ); break; } vfprintf ( stdout, sFmt, ap ); fprintf ( stdout, "\n" ); } ///////////////////////////////////////////////////////////////////////////// /// parse multi-valued attr definition bool ParseMultiAttr ( const char * sBuf, CSphColumnInfo & tAttr, const char * sSourceName ) { // format is as follows: // // multi-valued-attr := ATTR-TYPE ATTR-NAME 'from' SOURCE-TYPE [;QUERY] [;RANGE-QUERY] // ATTR-TYPE := 'uint' | 'timestamp' | 'bigint' // SOURCE-TYPE := 'field' | 'query' | 'ranged-query' const char * sTok = NULL; int iTokLen = -1; #define LOC_ERR(_arg,_pos) \ { \ if ( !*(_pos) ) \ fprintf ( stdout, "ERROR: source '%s': unexpected end of line in sql_attr_multi.\n", sSourceName ); \ else \ fprintf ( stdout, "ERROR: source '%s': expected " _arg " in sql_attr_multi, got '%s'.\n", sSourceName, _pos ); \ return false; \ } #define LOC_SPACE0() { while ( isspace(*sBuf) ) sBuf++; } #define LOC_SPACE1() { if ( !isspace(*sBuf) ) LOC_ERR ( "token", sBuf ) ; LOC_SPACE0(); } #define LOC_TOK() { sTok = sBuf; while ( sphIsAlpha(*sBuf) ) sBuf++; iTokLen = sBuf-sTok; } #define LOC_TOKEQ(_arg) ( iTokLen==(int)strlen(_arg) && strncasecmp ( sTok, _arg, iTokLen )==0 ) #define LOC_TEXT() { if ( *sBuf!=';') LOC_ERR ( "';'", sBuf ); sTok = ++sBuf; while ( *sBuf && *sBuf!=';' ) sBuf++; iTokLen = sBuf-sTok; } // handle ATTR-TYPE LOC_SPACE0(); LOC_TOK(); if ( LOC_TOKEQ("uint") ) tAttr.m_eAttrType = SPH_ATTR_UINT32SET; else if ( LOC_TOKEQ("timestamp") ) tAttr.m_eAttrType = SPH_ATTR_UINT32SET; else if ( LOC_TOKEQ("bigint") ) tAttr.m_eAttrType = SPH_ATTR_UINT64SET; else LOC_ERR ( "attr type ('uint' or 'timestamp' or 'bigint')", sTok ); // handle ATTR-NAME LOC_SPACE1(); LOC_TOK (); if ( iTokLen ) tAttr.m_sName.SetBinary ( sTok, iTokLen ); else LOC_ERR ( "attr name", sTok ); // handle 'from' LOC_SPACE1(); LOC_TOK(); if ( !LOC_TOKEQ("from") ) LOC_ERR ( "'from' keyword", sTok ); // handle SOURCE-TYPE LOC_SPACE1(); LOC_TOK(); LOC_SPACE0(); if ( LOC_TOKEQ("field") ) tAttr.m_eSrc = SPH_ATTRSRC_FIELD; else if ( LOC_TOKEQ("query") ) tAttr.m_eSrc = SPH_ATTRSRC_QUERY; else if ( LOC_TOKEQ("ranged-query") ) tAttr.m_eSrc = SPH_ATTRSRC_RANGEDQUERY; else LOC_ERR ( "value source type ('field', or 'query', or 'ranged-query')", sTok ); if ( tAttr.m_eSrc==SPH_ATTRSRC_FIELD ) return true; // handle QUERY LOC_TEXT(); if ( iTokLen ) tAttr.m_sQuery.SetBinary ( sTok, iTokLen ); else LOC_ERR ( "query", sTok ); if ( tAttr.m_eSrc==SPH_ATTRSRC_QUERY ) return true; // handle RANGE-QUERY LOC_TEXT(); if ( iTokLen ) tAttr.m_sQueryRange.SetBinary ( sTok, iTokLen ); else LOC_ERR ( "range query", sTok ); #undef LOC_ERR #undef LOC_SPACE0 #undef LOC_SPACE1 #undef LOC_TOK #undef LOC_TOKEQ #undef LOC_TEXT return true; } #define LOC_CHECK(_hash,_key,_msg,_add) \ if (!( _hash.Exists ( _key ) )) \ { \ fprintf ( stdout, "ERROR: key '%s' not found " _msg "\n", _key, _add ); \ return false; \ } // get string #define LOC_GETS(_arg,_key) \ if ( hSource.Exists(_key) ) \ _arg = hSource[_key]; // get int #define LOC_GETI(_arg,_key) \ if ( hSource.Exists(_key) && hSource[_key].intval() ) \ _arg = hSource[_key].intval(); // get bool #define LOC_GETB(_arg,_key) \ if ( hSource.Exists(_key) ) \ _arg = ( hSource[_key].intval()!=0 ); // get array of strings #define LOC_GETA(_arg,_key) \ for ( CSphVariant * pVal = hSource(_key); pVal; pVal = pVal->m_pNext ) \ _arg.Add ( pVal->cstr() ); void SqlAttrsConfigure ( CSphSourceParams_SQL & tParams, const CSphVariant * pHead, ESphAttr eAttrType, const char * sSourceName, bool bIndexedAttr=false ) { for ( const CSphVariant * pCur = pHead; pCur; pCur= pCur->m_pNext ) { CSphColumnInfo tCol ( pCur->cstr(), eAttrType ); char * pColon = strchr ( const_cast ( tCol.m_sName.cstr() ), ':' ); if ( pColon ) { *pColon = '\0'; if ( eAttrType==SPH_ATTR_INTEGER ) { int iBits = strtol ( pColon+1, NULL, 10 ); if ( iBits<=0 || iBits>ROWITEM_BITS ) { fprintf ( stdout, "WARNING: source '%s': attribute '%s': invalid bitcount=%d (bitcount ignored)\n", sSourceName, tCol.m_sName.cstr(), iBits ); iBits = -1; } tCol.m_tLocator.m_iBitCount = iBits; } else { fprintf ( stdout, "WARNING: source '%s': attribute '%s': bitcount is only supported for integer types\n", sSourceName, tCol.m_sName.cstr() ); } } tParams.m_dAttrs.Add ( tCol ); if ( bIndexedAttr ) tParams.m_dAttrs.Last().m_bIndexed = true; } } #if USE_ZLIB bool ConfigureUnpack ( CSphVariant * pHead, ESphUnpackFormat eFormat, CSphSourceParams_SQL & tParams, const char * sSourceName ) { for ( CSphVariant * pVal = pHead; pVal; pVal = pVal->m_pNext ) { CSphUnpackInfo & tUnpack = tParams.m_dUnpack.Add(); tUnpack.m_sName = CSphString ( pVal->cstr() ); tUnpack.m_eFormat = eFormat; } return true; } #else bool ConfigureUnpack ( CSphVariant * pHead, ESphUnpackFormat, CSphSourceParams_SQL &, const char * sSourceName ) { if ( pHead ) { fprintf ( stdout, "ERROR: source '%s': unpack is not supported, rebuild with zlib\n", sSourceName ); return false; } return true; } #endif // USE_ZLIB bool ParseJoinedField ( const char * sBuf, CSphJoinedField * pField, const char * sSourceName ) { // sanity checks assert ( pField ); if ( !sBuf || !sBuf[0] ) { fprintf ( stdout, "ERROR: source '%s': sql_joined_field must not be empty.\n", sSourceName ); return false; } #define LOC_ERR(_exp) \ { \ fprintf ( stdout, "ERROR: source '%s': expected " _exp " in sql_joined_field, got '%s'.\n", sSourceName, sBuf ); \ return false; \ } #define LOC_TEXT() { if ( *sBuf!=';') LOC_ERR ( "';'" ); sTmp = ++sBuf; while ( *sBuf && *sBuf!=';' ) sBuf++; iTokLen = sBuf-sTmp; } // parse field name while ( isspace(*sBuf) ) sBuf++; const char * sName = sBuf; while ( sphIsAlpha(*sBuf) ) sBuf++; if ( sBuf==sName ) LOC_ERR ( "field name" ); pField->m_sName.SetBinary ( sName, sBuf-sName ); if ( !isspace(*sBuf) ) LOC_ERR ( "space" ); while ( isspace(*sBuf) ) sBuf++; // parse 'from' if ( strncasecmp ( sBuf, "from", 4 ) ) LOC_ERR ( "'from'" ); sBuf += 4; if ( !isspace(*sBuf) ) LOC_ERR ( "space" ); while ( isspace(*sBuf) ) sBuf++; bool bGotRanged = false; pField->m_bPayload = false; // parse 'query' if ( strncasecmp ( sBuf, "payload-query", 13 )==0 ) { pField->m_bPayload = true; sBuf += 13; } else if ( strncasecmp ( sBuf, "query", 5 )==0 ) { sBuf += 5; } else if ( strncasecmp ( sBuf, "ranged-query", 12 )==0 ) { bGotRanged = true; sBuf += 12; } else LOC_ERR ( "'query'" ); // parse ';' while ( isspace(*sBuf) && *sBuf!=';' ) sBuf++; if ( *sBuf!=';' ) LOC_ERR ( "';'" ); // handle QUERY const char * sTmp = sBuf; int iTokLen = 0; LOC_TEXT(); if ( iTokLen ) pField->m_sQuery.SetBinary ( sTmp, iTokLen ); else LOC_ERR ( "query" ); if ( !bGotRanged ) return true; // handle RANGE-QUERY LOC_TEXT(); if ( iTokLen ) pField->m_sRanged.SetBinary ( sTmp, iTokLen ); else LOC_ERR ( "range query" ); #undef LOC_ERR #undef LOC_TEXT return true; } bool SqlParamsConfigure ( CSphSourceParams_SQL & tParams, const CSphConfigSection & hSource, const char * sSourceName ) { if ( !hSource.Exists("odbc_dsn") ) // in case of odbc source, the host, user, pass and db are not mandatory, since they may be already defined in dsn string. { LOC_CHECK ( hSource, "sql_host", "in source '%s'", sSourceName ); LOC_CHECK ( hSource, "sql_user", "in source '%s'", sSourceName ); LOC_CHECK ( hSource, "sql_pass", "in source '%s'", sSourceName ); LOC_CHECK ( hSource, "sql_db", "in source '%s'", sSourceName ); } LOC_CHECK ( hSource, "sql_query", "in source '%s'", sSourceName ); LOC_GETS ( tParams.m_sHost, "sql_host" ); LOC_GETS ( tParams.m_sUser, "sql_user" ); LOC_GETS ( tParams.m_sPass, "sql_pass" ); LOC_GETS ( tParams.m_sDB, "sql_db" ); LOC_GETI ( tParams.m_iPort, "sql_port" ); LOC_GETS ( tParams.m_sQuery, "sql_query" ); LOC_GETA ( tParams.m_dQueryPre, "sql_query_pre" ); LOC_GETA ( tParams.m_dQueryPost, "sql_query_post" ); LOC_GETS ( tParams.m_sQueryRange, "sql_query_range" ); LOC_GETA ( tParams.m_dQueryPostIndex, "sql_query_post_index" ); LOC_GETI ( tParams.m_iRangeStep, "sql_range_step" ); LOC_GETS ( tParams.m_sQueryKilllist, "sql_query_killlist" ); LOC_GETI ( tParams.m_iRangedThrottle, "sql_ranged_throttle" ); SqlAttrsConfigure ( tParams, hSource("sql_group_column"), SPH_ATTR_INTEGER, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_date_column"), SPH_ATTR_TIMESTAMP, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_str2ordinal_column"), SPH_ATTR_ORDINAL, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_uint"), SPH_ATTR_INTEGER, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_timestamp"), SPH_ATTR_TIMESTAMP, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_str2ordinal"), SPH_ATTR_ORDINAL, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_bool"), SPH_ATTR_BOOL, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_float"), SPH_ATTR_FLOAT, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_bigint"), SPH_ATTR_BIGINT, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_string"), SPH_ATTR_STRING, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_attr_str2wordcount"), SPH_ATTR_WORDCOUNT, sSourceName ); SqlAttrsConfigure ( tParams, hSource("sql_field_string"), SPH_ATTR_STRING, sSourceName, true ); SqlAttrsConfigure ( tParams, hSource("sql_field_str2wordcount"), SPH_ATTR_STRING, sSourceName, true ); LOC_GETA ( tParams.m_dFileFields, "sql_file_field" ); tParams.m_iMaxFileBufferSize = g_iMaxFileFieldBuffer; tParams.m_iRefRangeStep = tParams.m_iRangeStep; tParams.m_eOnFileFieldError = g_eOnFileFieldError; // unpack if ( !ConfigureUnpack ( hSource("unpack_zlib"), SPH_UNPACK_ZLIB, tParams, sSourceName ) ) return false; if ( !ConfigureUnpack ( hSource("unpack_mysqlcompress"), SPH_UNPACK_MYSQL_COMPRESS, tParams, sSourceName ) ) return false; tParams.m_uUnpackMemoryLimit = hSource.GetSize ( "unpack_mysqlcompress_maxsize", 16777216 ); // parse multi-attrs for ( CSphVariant * pVal = hSource("sql_attr_multi"); pVal; pVal = pVal->m_pNext ) { CSphColumnInfo tAttr; if ( !ParseMultiAttr ( pVal->cstr(), tAttr, sSourceName ) ) return false; tParams.m_dAttrs.Add ( tAttr ); } // parse joined fields for ( CSphVariant * pVal = hSource("sql_joined_field"); pVal; pVal = pVal->m_pNext ) if ( !ParseJoinedField ( pVal->cstr(), &tParams.m_dJoinedFields.Add(), sSourceName ) ) return false; // make sure attr names are unique ARRAY_FOREACH ( i, tParams.m_dAttrs ) for ( int j = i + 1; j < tParams.m_dAttrs.GetLength(); j++ ) { const CSphString & sName = tParams.m_dAttrs[i].m_sName; if ( sName==tParams.m_dAttrs[j].m_sName ) { fprintf ( stdout, "ERROR: duplicate attribute name: %s\n", sName.cstr() ); return false; } } // additional checks if ( tParams.m_iRangedThrottle<0 ) { fprintf ( stdout, "WARNING: sql_ranged_throttle must not be negative; throttling disabled\n" ); tParams.m_iRangedThrottle = 0; } // debug printer if ( g_bPrintQueries ) tParams.m_bPrintQueries = true; return true; } #if USE_PGSQL CSphSource * SpawnSourcePgSQL ( const CSphConfigSection & hSource, const char * sSourceName ) { assert ( hSource["type"]=="pgsql" ); CSphSourceParams_PgSQL tParams; if ( !SqlParamsConfigure ( tParams, hSource, sSourceName ) ) return NULL; LOC_GETS ( tParams.m_sClientEncoding, "sql_client_encoding" ); CSphSource_PgSQL * pSrcPgSQL = new CSphSource_PgSQL ( sSourceName ); if ( !pSrcPgSQL->Setup ( tParams ) ) SafeDelete ( pSrcPgSQL ); return pSrcPgSQL; } #endif // USE_PGSQL #if USE_MYSQL CSphSource * SpawnSourceMySQL ( const CSphConfigSection & hSource, const char * sSourceName ) { assert ( hSource["type"]=="mysql" ); CSphSourceParams_MySQL tParams; if ( !SqlParamsConfigure ( tParams, hSource, sSourceName ) ) return NULL; LOC_GETS ( tParams.m_sUsock, "sql_sock" ); LOC_GETI ( tParams.m_iFlags, "mysql_connect_flags" ); LOC_GETS ( tParams.m_sSslKey, "mysql_ssl_key" ); LOC_GETS ( tParams.m_sSslCert, "mysql_ssl_cert" ); LOC_GETS ( tParams.m_sSslCA, "mysql_ssl_ca" ); CSphSource_MySQL * pSrcMySQL = new CSphSource_MySQL ( sSourceName ); if ( !pSrcMySQL->Setup ( tParams ) ) SafeDelete ( pSrcMySQL ); return pSrcMySQL; } #endif // USE_MYSQL #if USE_ODBC CSphSource * SpawnSourceODBC ( const CSphConfigSection & hSource, const char * sSourceName ) { assert ( hSource["type"]=="odbc" ); CSphSourceParams_ODBC tParams; if ( !SqlParamsConfigure ( tParams, hSource, sSourceName ) ) return NULL; LOC_GETS ( tParams.m_sOdbcDSN, "odbc_dsn" ); LOC_GETS ( tParams.m_sColBuffers, "sql_column_buffers" ); CSphSource_ODBC * pSrc = new CSphSource_ODBC ( sSourceName ); if ( !pSrc->Setup ( tParams ) ) SafeDelete ( pSrc ); return pSrc; } CSphSource * SpawnSourceMSSQL ( const CSphConfigSection & hSource, const char * sSourceName ) { assert ( hSource["type"]=="mssql" ); CSphSourceParams_ODBC tParams; if ( !SqlParamsConfigure ( tParams, hSource, sSourceName ) ) return NULL; LOC_GETB ( tParams.m_bWinAuth, "mssql_winauth" ); LOC_GETB ( tParams.m_bUnicode, "mssql_unicode" ); LOC_GETS ( tParams.m_sColBuffers, "sql_column_buffers" ); CSphSource_MSSQL * pSrc = new CSphSource_MSSQL ( sSourceName ); if ( !pSrc->Setup ( tParams ) ) SafeDelete ( pSrc ); return pSrc; } #endif // USE_ODBC CSphSource * SpawnSourceXMLPipe ( const CSphConfigSection & hSource, const char * sSourceName, bool bUTF8 ) { assert ( hSource["type"]=="xmlpipe" || hSource["type"]=="xmlpipe2" ); LOC_CHECK ( hSource, "xmlpipe_command", "in source '%s'.", sSourceName ); CSphSource * pSrcXML = NULL; CSphString sCommand = hSource["xmlpipe_command"]; const int MAX_BUF_SIZE = 1024; BYTE dBuffer [MAX_BUF_SIZE]; int iBufSize = 0; bool bUsePipe2 = true; FILE * pPipe = sphDetectXMLPipe ( sCommand.cstr (), dBuffer, iBufSize, MAX_BUF_SIZE, bUsePipe2 ); if ( !pPipe ) { fprintf ( stdout, "ERROR: xmlpipe: failed to popen '%s'", sCommand.cstr() ); return NULL; } if ( bUsePipe2 ) { #if USE_LIBEXPAT || USE_LIBXML pSrcXML = sphCreateSourceXmlpipe2 ( &hSource, pPipe, dBuffer, iBufSize, sSourceName, g_iMaxXmlpipe2Field ); if ( !bUTF8 ) { SafeDelete ( pSrcXML ); fprintf ( stdout, "ERROR: source '%s': xmlpipe2 should only be used with charset_type=utf-8\n", sSourceName ); } #else fprintf ( stdout, "WARNING: source '%s': xmlpipe2 support NOT compiled in. To use xmlpipe2, install missing XML libraries, reconfigure, and rebuild Sphinx\n", sSourceName ); #endif } else { CSphSource_XMLPipe * pXmlPipe = new CSphSource_XMLPipe ( dBuffer, iBufSize, sSourceName ); if ( !pXmlPipe->Setup ( pPipe, sCommand.cstr () ) ) SafeDelete ( pXmlPipe ); pSrcXML = pXmlPipe; } return pSrcXML; } CSphSource * SpawnSource ( const CSphConfigSection & hSource, const char * sSourceName, bool bUTF8, bool bWordDict ) { if ( !hSource.Exists ( "type" ) ) { fprintf ( stdout, "ERROR: source '%s': type not found; skipping.\n", sSourceName ); return NULL; } #if USE_PGSQL if ( hSource["type"]=="pgsql" ) return SpawnSourcePgSQL ( hSource, sSourceName ); #endif #if USE_MYSQL if ( hSource["type"]=="mysql" ) return SpawnSourceMySQL ( hSource, sSourceName ); #endif #if USE_PYTHON if ( hSource["type"]=="python") return SpawnSourcePython ( hSource, sSourceName ); #endif #if USE_ODBC if ( hSource["type"]=="odbc" ) return SpawnSourceODBC ( hSource, sSourceName ); if ( hSource["type"]=="mssql" ) return SpawnSourceMSSQL ( hSource, sSourceName ); #endif if ( hSource["type"]=="xmlpipe" && bWordDict ) { fprintf ( stdout, "ERROR: source '%s': type xmlpipe incompatible with dict=keywords option use xmlpipe2 instead; skipping.\n", sSourceName ); return NULL; } if ( hSource["type"]=="xmlpipe" || hSource["type"]=="xmlpipe2" ) return SpawnSourceXMLPipe ( hSource, sSourceName, bUTF8 ); fprintf ( stdout, "ERROR: source '%s': unknown type '%s'; skipping.\n", sSourceName, hSource["type"].cstr() ); return NULL; } #undef LOC_CHECK #undef LOC_GETS #undef LOC_GETI #undef LOC_GETA ////////////////////////////////////////////////////////////////////////// // INDEXING ////////////////////////////////////////////////////////////////////////// bool DoIndex ( const CSphConfigSection & hIndex, const char * sIndexName, const CSphConfigType & hSources, bool bVerbose, FILE * fpDumpRows ) { // check index type bool bPlain = true; if ( hIndex("type") ) { const CSphString & sType = hIndex["type"]; bPlain = ( sType=="plain" ); if ( sType!="plain" && sType!="distributed" && sType!="rt" ) { fprintf ( stdout, "ERROR: index '%s': unknown type '%s'; fix your config file.\n", sIndexName, sType.cstr() ); fflush ( stdout ); return false; } } if ( !bPlain ) { if ( !g_bQuiet ) { fprintf ( stdout, "skipping non-plain index '%s'...\n", sIndexName ); fflush ( stdout ); } return false; } // progress bar if ( !g_bQuiet ) { fprintf ( stdout, "indexing index '%s'...\n", sIndexName ); fflush ( stdout ); } // check config if ( !hIndex("path") ) { fprintf ( stdout, "ERROR: index '%s': key 'path' not found.\n", sIndexName ); return false; } bool bInfix = hIndex.GetInt ( "min_infix_len", 0 ) > 0; if ( ( hIndex.GetInt ( "min_prefix_len", 0 ) > 0 || bInfix ) && hIndex.GetInt ( "enable_star" )==0 ) { const char * szMorph = hIndex.GetStr ( "morphology", "" ); if ( szMorph && *szMorph && strcmp ( szMorph, "none" ) ) { fprintf ( stdout, "ERROR: index '%s': infixes and morphology are enabled, enable_star=0\n", sIndexName ); return false; } } /////////////////// // spawn tokenizer /////////////////// CSphString sError; CSphTokenizerSettings tTokSettings; if ( !sphConfTokenizer ( hIndex, tTokSettings, sError ) ) sphDie ( "index '%s': %s", sIndexName, sError.cstr() ); ISphTokenizer * pTokenizer = ISphTokenizer::Create ( tTokSettings, sError ); if ( !pTokenizer ) sphDie ( "index '%s': %s", sIndexName, sError.cstr() ); // enable sentence indexing on tokenizer // (not in Create() because search time tokenizer does not care) bool bIndexSP = ( hIndex.GetInt ( "index_sp" )!=0 ); if ( bIndexSP ) if ( !pTokenizer->EnableSentenceIndexing ( sError ) ) sphDie ( "index '%s': %s", sIndexName, sError.cstr() ); if ( hIndex("index_zones") ) if ( !pTokenizer->EnableZoneIndexing ( sError ) ) sphDie ( "index '%s': %s", sIndexName, sError.cstr() ); CSphDict * pDict = NULL; CSphDictSettings tDictSettings; if ( !g_sBuildStops ) { ISphTokenizer * pTokenFilter = NULL; sphConfDictionary ( hIndex, tDictSettings ); // FIXME! no support for infixes in keywords dict yet if ( tDictSettings.m_bWordDict && bInfix ) { tDictSettings.m_bWordDict = false; fprintf ( stdout, "WARNING: min_infix_len is not supported yet with dict=keywords; using dict=crc\n" ); } pDict = tDictSettings.m_bWordDict ? sphCreateDictionaryKeywords ( tDictSettings, pTokenizer, sError, sIndexName ) : sphCreateDictionaryCRC ( tDictSettings, pTokenizer, sError, sIndexName ); if ( !pDict ) sphDie ( "index '%s': %s", sIndexName, sError.cstr() ); if ( !sError.IsEmpty () ) fprintf ( stdout, "WARNING: index '%s': %s\n", sIndexName, sError.cstr() ); pTokenFilter = ISphTokenizer::CreateTokenFilter ( pTokenizer, pDict->GetMultiWordforms () ); pTokenizer = pTokenFilter ? pTokenFilter : pTokenizer; } // boundary bool bInplaceEnable = hIndex.GetInt ( "inplace_enable", 0 )!=0; int iHitGap = hIndex.GetSize ( "inplace_hit_gap", 0 ); int iDocinfoGap = hIndex.GetSize ( "inplace_docinfo_gap", 0 ); float fRelocFactor = hIndex.GetFloat ( "inplace_reloc_factor", 0.1f ); float fWriteFactor = hIndex.GetFloat ( "inplace_write_factor", 0.1f ); if ( bInplaceEnable ) { if ( fRelocFactor < 0.01f || fRelocFactor > 0.9f ) { fprintf ( stdout, "WARNING: inplace_reloc_factor must be 0.01 to 0.9, clamped\n" ); fRelocFactor = Min ( Max ( fRelocFactor, 0.01f ), 0.9f ); } if ( fWriteFactor < 0.01f || fWriteFactor > 0.9f ) { fprintf ( stdout, "WARNING: inplace_write_factor must be 0.01 to 0.9, clamped\n" ); fWriteFactor = Min ( Max ( fWriteFactor, 0.01f ), 0.9f ); } if ( fWriteFactor+fRelocFactor > 1.0f ) { fprintf ( stdout, "WARNING: inplace_write_factor+inplace_reloc_factor must be less than 0.9, scaled\n" ); float fScale = 0.9f/(fWriteFactor+fRelocFactor); fRelocFactor *= fScale; fWriteFactor *= fScale; } } ///////////////////// // spawn datasources ///////////////////// // check for per-index HTML stipping override bool bStripOverride = false; bool bHtmlStrip = false; CSphString sHtmlIndexAttrs, sHtmlRemoveElements; if ( hIndex("html_strip") ) { bStripOverride = true; bHtmlStrip = hIndex.GetInt ( "html_strip" )!=0; sHtmlIndexAttrs = hIndex.GetStr ( "html_index_attrs" ); sHtmlRemoveElements = hIndex.GetStr ( "html_remove_elements" ); } else { if ( bIndexSP ) sphWarning ( "index '%s': index_sp=1 requires html_strip=1 to index paragraphs", sIndexName ); if ( hIndex("index_zones") ) sphDie ( "index '%s': index_zones requires html_strip=1", sIndexName ); } // parse all sources CSphVector dSources; bool bGotAttrs = false; bool bGotJoinedFields = false; bool bSpawnFailed = false; for ( CSphVariant * pSourceName = hIndex("source"); pSourceName; pSourceName = pSourceName->m_pNext ) { if ( !hSources ( pSourceName->cstr() ) ) { fprintf ( stdout, "ERROR: index '%s': source '%s' not found.\n", sIndexName, pSourceName->cstr() ); continue; } const CSphConfigSection & hSource = hSources [ pSourceName->cstr() ]; CSphSource * pSource = SpawnSource ( hSource, pSourceName->cstr(), pTokenizer->IsUtf8 (), tDictSettings.m_bWordDict ); if ( !pSource ) { bSpawnFailed = true; continue; } if ( pSource->HasAttrsConfigured() ) bGotAttrs = true; if ( pSource->HasJoinedFields() ) bGotJoinedFields = true; // strip_html, index_html_attrs CSphString sError; if ( bStripOverride ) { // apply per-index overrides if ( bHtmlStrip ) { if ( !pSource->SetStripHTML ( sHtmlIndexAttrs.cstr(), sHtmlRemoveElements.cstr(), bIndexSP, hIndex.GetStr("index_zones"), sError ) ) { fprintf ( stdout, "ERROR: source '%s': %s.\n", pSourceName->cstr(), sError.cstr() ); return false; } } } else if ( hSource.GetInt ( "strip_html" ) ) { // apply deprecated per-source settings if there are no overrides if ( !pSource->SetStripHTML ( hSource.GetStr ( "index_html_attrs" ), "", false, NULL, sError ) ) { fprintf ( stdout, "ERROR: source '%s': %s.\n", pSourceName->cstr(), sError.cstr() ); return false; } } pSource->SetTokenizer ( pTokenizer ); pSource->SetDumpRows ( fpDumpRows ); dSources.Add ( pSource ); } if ( bSpawnFailed ) { fprintf ( stdout, "ERROR: index '%s': failed to configure some of the sources, will not index.\n", sIndexName ); return false; } if ( !dSources.GetLength() ) { fprintf ( stdout, "ERROR: index '%s': no valid sources configured; skipping.\n", sIndexName ); return false; } /////////// // do work /////////// int64_t tmTime = sphMicroTimer(); bool bOK = false; if ( g_sBuildStops ) { /////////////////// // build stopwords /////////////////// if ( !g_bQuiet ) { fprintf ( stdout, "building stopwords list...\n" ); fflush ( stdout ); } CSphStopwordBuilderDict tDict; ARRAY_FOREACH ( i, dSources ) { CSphString sError; dSources[i]->SetDict ( &tDict ); if ( !dSources[i]->Connect ( sError ) || !dSources[i]->IterateStart ( sError ) ) { if ( !sError.IsEmpty() ) fprintf ( stdout, "ERROR: index '%s': %s\n", sIndexName, sError.cstr() ); continue; } while ( dSources[i]->IterateDocument ( sError ) && dSources[i]->m_tDocInfo.m_iDocID ) while ( dSources[i]->IterateHits ( sError ) ) { } } tDict.Save ( g_sBuildStops, g_iTopStops, g_bBuildFreqs ); SafeDelete ( pTokenizer ); } else { ////////// // index! ////////// // if searchd is running, we want to reindex to .tmp files CSphString sIndexPath; sIndexPath.SetSprintf ( g_bRotate ? "%s.tmp" : "%s", hIndex["path"].cstr() ); // do index CSphIndex * pIndex = sphCreateIndexPhrase ( sIndexName, sIndexPath.cstr() ); assert ( pIndex ); // check lock file if ( !pIndex->Lock() ) { fprintf ( stdout, "FATAL: %s, will not index. Try --rotate option.\n", pIndex->GetLastError().cstr() ); exit ( 1 ); } CSphString sError; CSphIndexSettings tSettings; if ( !sphConfIndex ( hIndex, tSettings, sError ) ) sphDie ( "index '%s': %s.", sIndexName, sError.cstr() ); tSettings.m_bVerbose = bVerbose; if ( tSettings.m_bIndexExactWords && !pDict->HasMorphology () ) { tSettings.m_bIndexExactWords = false; fprintf ( stdout, "WARNING: index '%s': no morphology, index_exact_words=1 has no effect, ignoring\n", sIndexName ); } if ( tDictSettings.m_bWordDict && pDict->HasMorphology() && tSettings.m_iMinPrefixLen && !tSettings.m_bIndexExactWords ) { tSettings.m_bIndexExactWords = true; fprintf ( stdout, "WARNING: index '%s': dict=keywords and prefixes and morphology enabled, forcing index_exact_words=1\n", sIndexName ); } if ( bGotAttrs && tSettings.m_eDocinfo==SPH_DOCINFO_NONE ) { fprintf ( stdout, "FATAL: index '%s': got attributes, but docinfo is 'none' (fix your config file).\n", sIndexName ); exit ( 1 ); } if ( bGotJoinedFields && tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) { fprintf ( stdout, "FATAL: index '%s': got joined fields, but docinfo is 'inline' (fix your config file).\n", sIndexName ); exit ( 1 ); } pIndex->SetProgressCallback ( ShowProgress ); if ( bInplaceEnable ) pIndex->SetInplaceSettings ( iHitGap, iDocinfoGap, fRelocFactor, fWriteFactor ); pIndex->SetTokenizer ( pTokenizer ); pIndex->SetDictionary ( pDict ); pIndex->Setup ( tSettings ); bOK = pIndex->Build ( dSources, g_iMemLimit, g_iWriteBuffer )!=0; if ( bOK && g_bRotate ) { sIndexPath.SetSprintf ( "%s.new", hIndex["path"].cstr() ); bOK = pIndex->Rename ( sIndexPath.cstr() ); } if ( !bOK ) fprintf ( stdout, "ERROR: index '%s': %s.\n", sIndexName, pIndex->GetLastError().cstr() ); if ( !pIndex->GetLastWarning().IsEmpty() ) fprintf ( stdout, "WARNING: index '%s': %s.\n", sIndexName, pIndex->GetLastWarning().cstr() ); pIndex->Unlock (); SafeDelete ( pIndex ); } // trip report tmTime = sphMicroTimer() - tmTime; if ( !g_bQuiet ) { tmTime = Max ( tmTime, 1 ); int64_t iTotalDocs = 0; int64_t iTotalBytes = 0; ARRAY_FOREACH ( i, dSources ) { const CSphSourceStats & tSource = dSources[i]->GetStats(); iTotalDocs += tSource.m_iTotalDocuments; iTotalBytes += tSource.m_iTotalBytes; } fprintf ( stdout, "total %d docs, "INT64_FMT" bytes\n", (int)iTotalDocs, iTotalBytes ); fprintf ( stdout, "total %d.%03d sec, %d bytes/sec, %d.%02d docs/sec\n", (int)(tmTime/1000000), (int)(tmTime%1000000)/1000, // sec (int)(iTotalBytes*1000000/tmTime), // bytes/sec (int)(iTotalDocs*1000000/tmTime), (int)(iTotalDocs*1000000*100/tmTime)%100 ); // docs/sec } // cleanup and go on ARRAY_FOREACH ( i, dSources ) SafeDelete ( dSources[i] ); return bOK; } ////////////////////////////////////////////////////////////////////////// // MERGING ////////////////////////////////////////////////////////////////////////// bool DoMerge ( const CSphConfigSection & hDst, const char * sDst, const CSphConfigSection & hSrc, const char * sSrc, CSphVector & tPurge, bool bRotate, bool bMergeKillLists ) { // check config if ( !hDst("path") ) { fprintf ( stdout, "ERROR: index '%s': key 'path' not found.\n", sDst ); return false; } if ( !hSrc("path") ) { fprintf ( stdout, "ERROR: index '%s': key 'path' not found.\n", sSrc ); return false; } // do the merge CSphIndex * pSrc = sphCreateIndexPhrase ( NULL, hSrc["path"].cstr() ); CSphIndex * pDst = sphCreateIndexPhrase ( NULL, hDst["path"].cstr() ); assert ( pSrc ); assert ( pDst ); CSphString sError; if ( !sphFixupIndexSettings ( pSrc, hSrc, sError ) ) { fprintf ( stdout, "ERROR: index '%s': %s\n", sSrc, sError.cstr () ); return false; } if ( !sphFixupIndexSettings ( pDst, hDst, sError ) ) { fprintf ( stdout, "ERROR: index '%s': %s\n", sDst, sError.cstr () ); return false; } pSrc->SetWordlistPreload ( hSrc.GetInt ( "ondisk_dict" )==0 ); pDst->SetWordlistPreload ( hDst.GetInt ( "ondisk_dict" )==0 ); if ( !pSrc->Lock() && !bRotate ) { fprintf ( stdout, "ERROR: index '%s' is already locked; lock: %s\n", sSrc, pSrc->GetLastError().cstr() ); return false; } if ( !pDst->Lock() && !bRotate ) { fprintf ( stdout, "ERROR: index '%s' is already locked; lock: %s\n", sDst, pDst->GetLastError().cstr() ); return false; } pDst->SetProgressCallback ( ShowProgress ); int64_t tmMergeTime = sphMicroTimer(); if ( !pDst->Merge ( pSrc, tPurge, bMergeKillLists ) ) sphDie ( "failed to merge index '%s' into index '%s': %s", sSrc, sDst, pDst->GetLastError().cstr() ); if ( !pDst->GetLastWarning().IsEmpty() ) fprintf ( stdout, "WARNING: index '%s': %s\n", sDst, pDst->GetLastWarning().cstr() ); tmMergeTime = sphMicroTimer() - tmMergeTime; if ( !g_bQuiet ) printf ( "merged in %d.%03d sec\n", (int)(tmMergeTime/1000000), (int)(tmMergeTime%1000000)/1000 ); // pick up merge result const char * sPath = hDst["path"].cstr(); char sFrom [ SPH_MAX_FILENAME_LEN ]; char sTo [ SPH_MAX_FILENAME_LEN ]; struct stat tFileInfo; int iExt; for ( iExt=0; iExtUnlock(); pDst->Unlock(); } SafeDelete ( pSrc ); SafeDelete ( pDst ); // all good? return ( iExt==EXT_COUNT ); } ////////////////////////////////////////////////////////////////////////// // ENTRY ////////////////////////////////////////////////////////////////////////// void ReportIOStats ( const char * sType, int iReads, int64_t iReadTime, int64_t iReadBytes ) { if ( iReads==0 ) { fprintf ( stdout, "total %d %s, %d.%03d sec, 0.0 kb/call avg, 0.0 msec/call avg\n", iReads, sType, (int)(iReadTime/1000000), (int)(iReadTime%1000000)/1000 ); } else { iReadBytes /= iReads; fprintf ( stdout, "total %d %s, %d.%03d sec, %d.%d kb/call avg, %d.%d msec/call avg\n", iReads, sType, (int)(iReadTime/1000000), (int)(iReadTime%1000000)/1000, (int)(iReadBytes/1024), (int)(iReadBytes%1024)*10/1024, (int)(iReadTime/iReads/1000), (int)(iReadTime/iReads/100)%10 ); } } extern int64_t g_iIndexerCurrentDocID; extern int64_t g_iIndexerCurrentHits; extern int64_t g_iIndexerCurrentRangeMin; extern int64_t g_iIndexerCurrentRangeMax; extern int64_t g_iIndexerPoolStartDocID; extern int64_t g_iIndexerPoolStartHit; #if !USE_WINDOWS void sigsegv ( int sig ) { sphSafeInfo ( STDERR_FILENO, "*** Oops, indexer crashed! Please send the following report to developers." ); sphSafeInfo ( STDERR_FILENO, "Sphinx " SPHINX_VERSION ); sphSafeInfo ( STDERR_FILENO, "-------------- report begins here ---------------" ); sphSafeInfo ( STDERR_FILENO, "Current document: docid=%l, hits=%l", g_iIndexerCurrentDocID, g_iIndexerCurrentHits ); sphSafeInfo ( STDERR_FILENO, "Current batch: minid=%l, maxid=%l", g_iIndexerCurrentRangeMin, g_iIndexerCurrentRangeMax ); sphSafeInfo ( STDERR_FILENO, "Hit pool start: docid=%l, hit=%l", g_iIndexerPoolStartDocID, g_iIndexerPoolStartHit ); sphBacktrace ( STDERR_FILENO ); CRASH_EXIT; } void SetSignalHandlers () { struct sigaction sa; sigfillset ( &sa.sa_mask ); bool bSignalsSet = false; for ( ;; ) { sa.sa_flags = SA_NOCLDSTOP; sa.sa_handler = SIG_IGN; if ( sigaction ( SIGCHLD, &sa, NULL )!=0 ) break; sa.sa_flags |= SA_RESETHAND; sa.sa_handler = sigsegv; if ( sigaction ( SIGSEGV, &sa, NULL )!=0 ) break; sa.sa_handler = sigsegv; if ( sigaction ( SIGBUS, &sa, NULL )!=0 ) break; sa.sa_handler = sigsegv; if ( sigaction ( SIGABRT, &sa, NULL )!=0 ) break; sa.sa_handler = sigsegv; if ( sigaction ( SIGILL, &sa, NULL )!=0 ) break; sa.sa_handler = sigsegv; if ( sigaction ( SIGFPE, &sa, NULL )!=0 ) break; bSignalsSet = true; break; } if ( !bSignalsSet ) { fprintf ( stderr, "sigaction(): %s", strerror(errno) ); exit ( 1 ); } } #else // if USE_WINDOWS LONG WINAPI sigsegv ( EXCEPTION_POINTERS * pExc ) { const char * sFail1 = "*** Oops, indexer crashed! Please send "; const char * sFail2 = " minidump file to developers.\n"; const char * sFailVer = "Sphinx " SPHINX_VERSION "\n"; sphBacktrace ( pExc, g_sMinidump ); ::write ( STDERR_FILENO, sFail1, strlen(sFail1) ); ::write ( STDERR_FILENO, g_sMinidump, strlen(g_sMinidump) ); ::write ( STDERR_FILENO, sFail2, strlen(sFail2) ); ::write ( STDERR_FILENO, sFailVer, strlen(sFailVer) ); CRASH_EXIT; } void SetSignalHandlers () { snprintf ( g_sMinidump, sizeof(g_sMinidump), "indexer.%d.mdmp", GetCurrentProcessId() ); SetUnhandledExceptionFilter ( sigsegv ); } #endif // USE_WINDOWS bool SendRotate ( int iPID, bool bForce ) { if ( iPID<0 ) return false; if ( !( g_bRotate && ( g_bRotateEach || bForce ) ) ) return false; #if USE_WINDOWS char szPipeName[64]; snprintf ( szPipeName, sizeof(szPipeName), "\\\\.\\pipe\\searchd_%d", iPID ); HANDLE hPipe = INVALID_HANDLE_VALUE; while ( hPipe==INVALID_HANDLE_VALUE ) { hPipe = CreateFile ( szPipeName, GENERIC_WRITE, 0, NULL, OPEN_EXISTING, 0, NULL ); if ( hPipe==INVALID_HANDLE_VALUE ) { if ( GetLastError()!=ERROR_PIPE_BUSY ) { fprintf ( stdout, "WARNING: could not open pipe (GetLastError()=%d)\n", GetLastError () ); return false; } if ( !WaitNamedPipe ( szPipeName, 1000 ) ) { fprintf ( stdout, "WARNING: could not open pipe (GetLastError()=%d)\n", GetLastError () ); return false; } } } if ( hPipe!=INVALID_HANDLE_VALUE ) { DWORD uWritten = 0; BYTE uWrite = 0; BOOL bResult = WriteFile ( hPipe, &uWrite, 1, &uWritten, NULL ); if ( bResult ) fprintf ( stdout, "rotating indices: succesfully sent SIGHUP to searchd (pid=%d).\n", iPID ); else fprintf ( stdout, "WARNING: failed to send SIGHUP to searchd (pid=%d, GetLastError()=%d)\n", iPID, GetLastError () ); CloseHandle ( hPipe ); } #else // signal int iErr = kill ( iPID, SIGHUP ); if ( iErr==0 ) { if ( !g_bQuiet ) fprintf ( stdout, "rotating indices: succesfully sent SIGHUP to searchd (pid=%d).\n", iPID ); } else { switch ( errno ) { case ESRCH: fprintf ( stdout, "WARNING: no process found by PID %d.\n", iPID ); break; case EPERM: fprintf ( stdout, "WARNING: access denied to PID %d.\n", iPID ); break; default: fprintf ( stdout, "WARNING: kill() error: %s.\n", strerror(errno) ); break; } return false; } #endif // all ok return true; } int main ( int argc, char ** argv ) { sphSetLogger ( Logger ); const char * sOptConfig = NULL; bool bMerge = false; CSphVector dMergeDstFilters; CSphVector dIndexes; bool bIndexAll = false; bool bMergeKillLists = false; bool bVerbose = false; CSphString sDumpRows; int i; for ( i=1; i='a' && argv[i][0]<='z' ) || ( argv[i][0]>='A' && argv[i][0]<='Z' ) ) { dIndexes.Add ( argv[i] ); } else if ( strcasecmp ( argv[i], "--dump-rows" )==0 && (i+1)1 ) { fprintf ( stdout, "ERROR: malformed or unknown option near '%s'.\n", argv[i] ); } else { fprintf ( stdout, "Usage: indexer [OPTIONS] [indexname1 [indexname2 [...]]]\n" "\n" "Options are:\n" "--config \t\tread configuration from specified file\n" "\t\t\t(default is csft.conf)\n" "--all\t\t\treindex all configured indexes\n" "--quiet\t\t\tbe quiet, only print errors\n" "--verbose\t\tverbose indexing issues report\n" "--noprogress\t\tdo not display progress\n" "\t\t\t(automatically on if output is not to a tty)\n" "--rotate\t\tsend SIGHUP to searchd when indexing is over\n" "\t\t\tto rotate updated indexes automatically\n" "--sighup-each\t\tsend SIGHUP to searchd after each index\n" "\t\t\t(used with --rotate only)\n" "--buildstops \n" "\t\t\tbuild top N stopwords and write them to given file\n" "--buildfreqs\t\tstore words frequencies to output.txt\n" "\t\t\t(used with --buildstops only)\n" "--merge \n" "\t\t\tmerge 'src-index' into 'dst-index'\n" "\t\t\t'dst-index' will receive merge result\n" "\t\t\t'src-index' will not be modified\n" "--merge-dst-range \n" "\t\t\tfilter 'dst-index' on merge, keep only those documents\n" "\t\t\twhere 'attr' is between 'min' and 'max' (inclusive)\n" "--merge-klists\n" "--merge-killlists\tmerge src and dst kill-lists (default is to\n" "\t\t\tapply src kill-list to dst index)\n" "--dump-rows \tdump indexed rows into FILE\n" "--print-queries\t\tprint SQL queries (for debugging)\n" "\n" "Examples:\n" "indexer --quiet myidx1\treindex 'myidx1' defined in 'csft.conf'\n" "indexer --all\t\treindex all indexes defined in 'csft.conf'\n" ); } return 1; } if ( !bMerge && !bIndexAll && !dIndexes.GetLength() ) { fprintf ( stdout, "ERROR: nothing to do.\n" ); return 1; } SetSignalHandlers(); /////////////// // load config /////////////// CSphConfigParser cp; CSphConfig & hConf = cp.m_tConf; sOptConfig = sphLoadConfig ( sOptConfig, g_bQuiet, cp ); if ( !hConf ( "source" ) ) sphDie ( "no indexes found in config file '%s'", sOptConfig ); g_iMemLimit = 0; if ( hConf("indexer") && hConf["indexer"]("indexer") ) { CSphConfigSection & hIndexer = hConf["indexer"]["indexer"]; g_iMemLimit = hIndexer.GetSize ( "mem_limit", 0 ); g_iMaxXmlpipe2Field = hIndexer.GetSize ( "max_xmlpipe2_field", 2*1024*1024 ); g_iWriteBuffer = hIndexer.GetSize ( "write_buffer", 1024*1024 ); g_iMaxFileFieldBuffer = Max ( 1024*1024, hIndexer.GetSize ( "max_file_field_buffer", 8*1024*1024 ) ); if ( hIndexer("on_file_field_error") ) { const CSphString & sVal = hIndexer["on_file_field_error"]; if ( sVal=="ignore_field" ) g_eOnFileFieldError = FFE_IGNORE_FIELD; else if ( sVal=="skip_document" ) g_eOnFileFieldError = FFE_SKIP_DOCUMENT; else if ( sVal=="fail_index" ) g_eOnFileFieldError = FFE_FAIL_INDEX; else sphDie ( "unknown on_field_field_error value (must be one of ignore_field, skip_document, fail_index)" ); } sphSetThrottling ( hIndexer.GetInt ( "max_iops", 0 ), hIndexer.GetSize ( "max_iosize", 0 ) ); } int iPID = -1; while ( g_bRotate ) { // load config if ( !hConf.Exists ( "searchd" ) ) { fprintf ( stdout, "WARNING: 'searchd' section not found in config file.\n" ); break; } const CSphConfigSection & hSearchd = hConf["searchd"]["searchd"]; if ( !hSearchd.Exists ( "pid_file" ) ) { fprintf ( stdout, "WARNING: 'pid_file' parameter not found in 'searchd' config section.\n" ); break; } // read in PID FILE * fp = fopen ( hSearchd["pid_file"].cstr(), "r" ); if ( !fp ) { fprintf ( stdout, "WARNING: failed to open pid_file '%s'.\n", hSearchd["pid_file"].cstr() ); break; } if ( fscanf ( fp, "%d", &iPID )!=1 || iPID<=0 ) { fprintf ( stdout, "WARNING: failed to scanf pid from pid_file '%s'.\n", hSearchd["pid_file"].cstr() ); break; } fclose ( fp ); break; } ///////////////////// // init python layer //////////////////// if ( hConf("python") && hConf["python"]("python") ) { #if USE_PYTHON CSphConfigSection & hPython = hConf["python"]["python"]; if(!cftInitialize(hPython)) sphDie ( "Python layer's initiation failed."); #else sphDie ( "Python layer defined, but indexer does Not supports python. used --with-python to recompile."); #endif } ///////////////////// // index each index //////////////////// FILE * fpDumpRows = NULL; if ( !bMerge && !sDumpRows.IsEmpty() ) { fpDumpRows = fopen ( sDumpRows.cstr(), "wb+" ); if ( !fpDumpRows ) sphDie ( "failed to open %s: %s", sDumpRows.cstr(), strerror(errno) ); } sphStartIOStats (); bool bIndexedOk = false; // if any of the indexes are ok if ( bMerge ) { if ( dIndexes.GetLength()!=2 ) sphDie ( "there must be 2 indexes to merge specified" ); if ( !hConf["index"](dIndexes[0]) ) sphDie ( "no merge destination index '%s'", dIndexes[0] ); if ( !hConf["index"](dIndexes[1]) ) sphDie ( "no merge source index '%s'", dIndexes[1] ); bIndexedOk = DoMerge ( hConf["index"][dIndexes[0]], dIndexes[0], hConf["index"][dIndexes[1]], dIndexes[1], dMergeDstFilters, g_bRotate, bMergeKillLists ); } else if ( bIndexAll ) { uint64_t tmRotated = sphMicroTimer(); hConf["index"].IterateStart (); while ( hConf["index"].IterateNext() ) { bool bLastOk = DoIndex ( hConf["index"].IterateGet (), hConf["index"].IterateGetKey().cstr(), hConf["source"], bVerbose, fpDumpRows ); bIndexedOk |= bLastOk; if ( bLastOk && ( sphMicroTimer() - tmRotated > ROTATE_MIN_INTERVAL ) && SendRotate ( iPID, false ) ) tmRotated = sphMicroTimer(); } } else { uint64_t tmRotated = sphMicroTimer(); ARRAY_FOREACH ( i, dIndexes ) { if ( !hConf["index"](dIndexes[i]) ) fprintf ( stdout, "WARNING: no such index '%s', skipping.\n", dIndexes[i] ); else { bool bLastOk = DoIndex ( hConf["index"][dIndexes[i]], dIndexes[i], hConf["source"], bVerbose, fpDumpRows ); bIndexedOk |= bLastOk; if ( bLastOk && ( sphMicroTimer() - tmRotated > ROTATE_MIN_INTERVAL ) && SendRotate ( iPID, false ) ) tmRotated = sphMicroTimer(); } } } sphShutdownWordforms (); const CSphIOStats & tStats = sphStopIOStats (); if ( !g_bQuiet ) { ReportIOStats ( "reads", tStats.m_iReadOps, tStats.m_iReadTime, tStats.m_iReadBytes ); ReportIOStats ( "writes", tStats.m_iWriteOps, tStats.m_iWriteTime, tStats.m_iWriteBytes ); } //////////////////////////// // rotating searchd indices //////////////////////////// if ( bIndexedOk && g_bRotate ) { if ( !SendRotate ( iPID, true ) ) fprintf ( stdout, "WARNING: indices NOT rotated.\n" ); } #if SPH_DEBUG_LEAKS sphAllocsStats (); #endif #if USE_PYTHON cftShutdown(); //clean up #endif return bIndexedOk ? 0 : 1; } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/indextool.cpp100777 0 0 35520 11643565732 14006 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxutils.h" #include "sphinxint.h" #include "sphinxrt.h" #include void StripStdin ( const char * sIndexAttrs, const char * sRemoveElements ) { CSphString sError; CSphHTMLStripper tStripper ( true ); if ( !tStripper.SetIndexedAttrs ( sIndexAttrs, sError ) || !tStripper.SetRemovedElements ( sRemoveElements, sError ) ) sphDie ( "failed to configure stripper: %s", sError.cstr() ); CSphVector dBuffer; while ( !feof(stdin) ) { char sBuffer[1024]; int iLen = fread ( sBuffer, 1, sizeof(sBuffer), stdin ); if ( !iLen ) break; int iPos = dBuffer.GetLength(); dBuffer.Resize ( iPos+iLen ); memcpy ( &dBuffer[iPos], sBuffer, iLen ); } dBuffer.Add ( 0 ); tStripper.Strip ( &dBuffer[0] ); fprintf ( stdout, "dumping stripped results...\n%s\n", &dBuffer[0] ); } void DoOptimization ( const CSphString & sIndex, const CSphConfig & hConfig ); int main ( int argc, char ** argv ) { fprintf ( stdout, SPHINX_BANNER ); if ( argc<=1 ) { fprintf ( stdout, "Usage: indextool [OPTIONS]\n" "\n" "Commands are:\n" "--dumpheader \tdump index header by file name\n" "--dumpconfig \tdump index header in config format by file name\n" "--dumpheader \tdump index header by index name\n" "--dumpdocids \tdump docids by index name\n" "--dumphitlist \n" "--dumphitlist --wordid \n" "\t\t\t\tdump hits for given keyword\n" "--check \t\tperform index consistency check\n" "--htmlstrip \t\tfilter stdin usng HTML stripper settings\n" "\t\t\t\tfor a given index (taken from csft.conf)\n" "--optimize-rt-klists \n" "\t\t\t\tperform kill list opimization in rt's disk chunks\n" "\t\t\t\tfor a given index (taken from csft.conf) or --all\n" "\n" "Options are:\n" "-c, --config \t\tuse given config file instead of defaults\n" "--strip-path\t\t\tstrip path from filenames referenced by index\n" "\t\t\t\t(eg. stopwords, exceptions, etc)\n" ); exit ( 0 ); } ////////////////////// // parse command line ////////////////////// #define OPT(_a1,_a2) else if ( !strcmp(argv[i],_a1) || !strcmp(argv[i],_a2) ) #define OPT1(_a1) else if ( !strcmp(argv[i],_a1) ) const char * sOptConfig = NULL; CSphString sDumpHeader, sIndex, sKeyword; bool bWordid = false; bool bStripPath = false; enum { CMD_NOTHING, CMD_DUMPHEADER, CMD_DUMPCONFIG, CMD_DUMPDOCIDS, CMD_DUMPHITLIST, CMD_CHECK, CMD_STRIP, CMD_OPTIMIZE } eCommand = CMD_NOTHING; int i; for ( i=1; i=argc ) break; OPT ( "-c", "--config" ) sOptConfig = argv[++i]; OPT1 ( "--dumpheader" ) { eCommand = CMD_DUMPHEADER; sDumpHeader = argv[++i]; } OPT1 ( "--dumpconfig" ) { eCommand = CMD_DUMPCONFIG; sDumpHeader = argv[++i]; } OPT1 ( "--dumpdocids" ) { eCommand = CMD_DUMPDOCIDS; sIndex = argv[++i]; } OPT1 ( "--check" ) { eCommand = CMD_CHECK; sIndex = argv[++i]; } OPT1 ( "--htmlstrip" ) { eCommand = CMD_STRIP; sIndex = argv[++i]; } OPT1 ( "--strip-path" ) { bStripPath = true; } OPT1 ( "--optimize-rt-klists" ) { eCommand = CMD_OPTIMIZE; sIndex = argv[++i]; if ( sIndex=="--all" ) sIndex = ""; } // options with 2 args else if ( (i+2)>=argc ) // NOLINT { // not enough args break; } else if ( !strcmp ( argv[i], "--dumphitlist" ) ) { eCommand = CMD_DUMPHITLIST; sIndex = argv[++i]; if ( !strcmp ( argv[i+1], "--wordid" ) ) { if ( (i+3)SetWordlistPreload ( false ); CSphString sWarn; if ( !pIndex->Prealloc ( false, bStripPath, sWarn ) ) sphDie ( "index '%s': prealloc failed: %s\n", sIndex.cstr(), pIndex->GetLastError().cstr() ); if ( !pIndex->Preread() ) sphDie ( "index '%s': preread failed: %s\n", sIndex.cstr(), pIndex->GetLastError().cstr() ); break; } // do the dew switch ( eCommand ) { case CMD_NOTHING: sphDie ( "nothing to do; specify a command (run indextool w/o switches for help)" ); case CMD_DUMPHEADER: case CMD_DUMPCONFIG: { if ( hConf("index") && hConf["index"](sDumpHeader) ) { fprintf ( stdout, "dumping header for index '%s'...\n", sDumpHeader.cstr() ); if ( !hConf["index"][sDumpHeader]("path") ) sphDie ( "missing 'path' for index '%s'\n", sDumpHeader.cstr() ); sDumpHeader.SetSprintf ( "%s.sph", hConf["index"][sDumpHeader]["path"].cstr() ); } fprintf ( stdout, "dumping header file '%s'...\n", sDumpHeader.cstr() ); CSphIndex * pIndex = sphCreateIndexPhrase ( NULL, "" ); pIndex->DebugDumpHeader ( stdout, sDumpHeader.cstr(), eCommand==CMD_DUMPCONFIG ); break; } case CMD_DUMPDOCIDS: fprintf ( stdout, "dumping docids for index '%s'...\n", sIndex.cstr() ); pIndex->DebugDumpDocids ( stdout ); break; case CMD_DUMPHITLIST: fprintf ( stdout, "dumping hitlist for index '%s' keyword '%s'...\n", sIndex.cstr(), sKeyword.cstr() ); pIndex->DebugDumpHitlist ( stdout, sKeyword.cstr(), bWordid ); break; case CMD_CHECK: fprintf ( stdout, "checking index '%s'...\n", sIndex.cstr() ); return pIndex->DebugCheck ( stdout ); case CMD_STRIP: { const CSphConfigSection & hIndex = hConf["index"][sIndex]; if ( hIndex.GetInt ( "html_strip" )==0 ) sphDie ( "HTML stripping is not enabled in index '%s'", sIndex.cstr() ); StripStdin ( hIndex.GetStr ( "html_index_attrs" ), hIndex.GetStr ( "html_remove_elements" ) ); } break; case CMD_OPTIMIZE: DoOptimization ( sIndex, hConf ); break; default: sphDie ( "INTERNAL ERROR: unhandled command (id=%d)", (int)eCommand ); } return 0; } #if USE_WINDOWS #include // for open() #define sphSeek _lseeki64 #else #define sphSeek lseek #endif bool FixupFiles ( const CSphVector & dFiles, CSphString & sError ) { ARRAY_FOREACH ( i, dFiles ) { const CSphString & sPath = dFiles[i]; CSphString sKlistOld, sKlistNew, sHeader; sKlistOld.SetSprintf ( "%s.spk", sPath.cstr() ); sKlistNew.SetSprintf ( "%s.new.spk", sPath.cstr() ); sHeader.SetSprintf ( "%s.sph", sPath.cstr() ); DWORD iCount = 0; { CSphAutoreader rdHeader, rdKlistNew, rdKlistOld; if ( !rdHeader.Open ( sHeader, sError ) || !rdKlistNew.Open ( sKlistNew, sError ) || !rdKlistOld.Open ( sKlistOld, sError ) ) return false; const SphOffset_t iSize = rdKlistNew.GetFilesize(); iCount = (DWORD)( iSize / sizeof(SphAttr_t) ); } if ( ::unlink ( sKlistOld.cstr() )!=0 ) { sError.SetSprintf ( "file: '%s', error: '%s'", sKlistOld.cstr(), strerror(errno) ); return false; } if ( ::rename ( sKlistNew.cstr(), sKlistOld.cstr() )!=0 ) { sError.SetSprintf ( "files: '%s'->'%s', error: '%s'", sKlistNew.cstr(), sKlistOld.cstr(), strerror(errno) ); return false; } int iFD = ::open ( sHeader.cstr(), SPH_O_BINARY | O_RDWR, 0644 ); if ( iFD<0 ) { sError.SetSprintf ( "file: '%s', error: '%s'", sHeader.cstr(), strerror(errno) ); return false; } if ( sphSeek ( iFD, -4, SEEK_END )==-1L ) { sError.SetSprintf ( "file: '%s', error: '%s'", sHeader.cstr(), strerror(errno) ); SafeClose ( iFD ); return false; } if ( ::write ( iFD, &iCount, 4 )==-1 ) { sError.SetSprintf ( "file: '%s', error: '%s'", sHeader.cstr(), strerror(errno) ); SafeClose ( iFD ); return false; } SafeClose ( iFD ); } return true; } bool DoKlistsOptimization ( int iRowSize, const char * sPath, int iChunkCount, CSphVector & dFiles ) { CSphTightVector dLiveID; CSphString sError; for ( int iChunk=0; iChunk dKlist; if ( dLiveID.GetLength()>0 ) { assert ( rdKList.GetFilesize()0 ) ARRAY_FOREACH ( i, dLiveID ) if ( dLiveID[i]==0 ) dLiveID.RemoveFast ( i-- ); assert ( dLiveID.GetLength()+dKlist.GetLength()==iWasLive ); dLiveID.Sort(); } // 3d step write new k-list if ( dKlist.GetLength()>0 ) wrNew.PutBytes ( dKlist.Begin(), dKlist.GetLength()*sizeof(SphAttr_t) ); dKlist.Reset(); wrNew.CloseFile(); // 4th step merge ID from this segment into live ids if ( iChunk!=iChunkCount-1 ) { const int iWasLive = Max ( dLiveID.GetLength()-1, 0 ); const int iRowCount = (int)( rdAttr.GetFilesize() / ( (DOCINFO_IDSIZE+iRowSize)*4 ) ); for ( int i=0; i dFiles; hConf["index"].IterateStart (); while ( hConf["index"].IterateNext () ) { CSphString sError; const CSphConfigSection & hIndex = hConf["index"].IterateGet (); const char * sIndexName = hConf["index"].IterateGetKey().cstr(); if ( !hIndex("type") || hIndex["type"]!="rt" ) continue; if ( !sIndex.IsEmpty() && sIndex!=sIndexName ) continue; if ( !hIndex.Exists ( "path" ) ) { fprintf ( stdout, "key 'path' not found in index '%s' - skiped\n", sIndexName ); continue; } const int64_t tmIndexStart = sphMicroTimer(); CSphSchema tSchema ( sIndexName ); CSphColumnInfo tCol; // fields for ( CSphVariant * v=hIndex("rt_field"); v; v=v->m_pNext ) { tCol.m_sName = v->cstr(); tSchema.m_dFields.Add ( tCol ); } if ( !tSchema.m_dFields.GetLength() ) { fprintf ( stdout, "index '%s': no fields configured (use rt_field directive) - skiped\n", sIndexName ); continue; } // attrs const int iNumTypes = 5; const char * sTypes[iNumTypes] = { "rt_attr_uint", "rt_attr_bigint", "rt_attr_float", "rt_attr_timestamp", "rt_attr_string" }; const ESphAttr iTypes[iNumTypes] = { SPH_ATTR_INTEGER, SPH_ATTR_BIGINT, SPH_ATTR_FLOAT, SPH_ATTR_TIMESTAMP, SPH_ATTR_STRING }; for ( int iType=0; iTypem_pNext ) { tCol.m_sName = v->cstr(); tCol.m_eAttrType = iTypes[iType]; tSchema.AddAttr ( tCol, false ); } } const char * sPath = hIndex["path"].cstr(); CSphString sMeta; sMeta.SetSprintf ( "%s.meta", sPath ); CSphAutoreader rdMeta; if ( !rdMeta.Open ( sMeta.cstr(), sError ) ) { fprintf ( stdout, "%s\n", sError.cstr() ); continue; } rdMeta.SeekTo ( 8, 4 ); const int iDiskCunkCount = rdMeta.GetDword(); if ( !DoKlistsOptimization ( tSchema.GetRowSize(), sPath, iDiskCunkCount, dFiles ) ) sphDie ( "can't cook k-list '%s'", sPath ); const int64_t tmIndexDone = sphMicroTimer(); fprintf ( stdout, "\nindex '%s' done in %.3f sec\n", sIndexName, float(tmIndexDone-tmIndexStart )/1000000.0f ); iDone++; } const int64_t tmIndexesDone = sphMicroTimer(); fprintf ( stdout, "\ntotal processed=%d in %.3f sec\n", iDone, float(tmIndexesDone-tmStart )/1000000.0f ); CSphString sError("none"); if ( !FixupFiles ( dFiles, sError ) ) fprintf ( stdout, "error during files fixup: %s\n", sError.cstr() ); const int64_t tmDone = sphMicroTimer(); fprintf ( stdout, "\nfinished in %.3f sec\n", float(tmDone-tmStart )/1000000.0f ); } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/llsphinxql.c100777 0 0 223464 11643565732 13665 0#line 2 "llsphinxql.c" #line 4 "llsphinxql.c" #define YY_INT_ALIGNED short int /* A lexical scanner generated by flex */ #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 5 #define YY_FLEX_SUBMINOR_VERSION 35 #if YY_FLEX_SUBMINOR_VERSION > 0 #define FLEX_BETA #endif /* First, we deal with platform-specific or compiler-specific issues. */ /* begin standard C headers. */ #include #include #include #include /* end standard C headers. */ /* flex integer type definitions */ #ifndef FLEXINT_H #define FLEXINT_H /* C99 systems have . Non-C99 systems may or may not. */ #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, * if you want the limit (max/min) macros for int types. */ #ifndef __STDC_LIMIT_MACROS #define __STDC_LIMIT_MACROS 1 #endif #include typedef int8_t flex_int8_t; typedef uint8_t flex_uint8_t; typedef int16_t flex_int16_t; typedef uint16_t flex_uint16_t; typedef int32_t flex_int32_t; typedef uint32_t flex_uint32_t; #else typedef signed char flex_int8_t; typedef short int flex_int16_t; typedef int flex_int32_t; typedef unsigned char flex_uint8_t; typedef unsigned short int flex_uint16_t; typedef unsigned int flex_uint32_t; #endif /* ! C99 */ /* Limits of integral types. */ #ifndef INT8_MIN #define INT8_MIN (-128) #endif #ifndef INT16_MIN #define INT16_MIN (-32767-1) #endif #ifndef INT32_MIN #define INT32_MIN (-2147483647-1) #endif #ifndef INT8_MAX #define INT8_MAX (127) #endif #ifndef INT16_MAX #define INT16_MAX (32767) #endif #ifndef INT32_MAX #define INT32_MAX (2147483647) #endif #ifndef UINT8_MAX #define UINT8_MAX (255U) #endif #ifndef UINT16_MAX #define UINT16_MAX (65535U) #endif #ifndef UINT32_MAX #define UINT32_MAX (4294967295U) #endif #endif /* ! FLEXINT_H */ #ifdef __cplusplus /* The "const" storage-class-modifier is valid. */ #define YY_USE_CONST #else /* ! __cplusplus */ /* C99 requires __STDC__ to be defined as 1. */ #if defined (__STDC__) #define YY_USE_CONST #endif /* defined (__STDC__) */ #endif /* ! __cplusplus */ #ifdef YY_USE_CONST #define yyconst const #else #define yyconst #endif /* Returned upon end-of-file. */ #define YY_NULL 0 /* Promotes a possibly negative, possibly signed char to an unsigned * integer for use as an array index. If the signed char is negative, * we want to instead treat it as an 8-bit unsigned char, hence the * double cast. */ #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) /* An opaque pointer. */ #ifndef YY_TYPEDEF_YY_SCANNER_T #define YY_TYPEDEF_YY_SCANNER_T typedef void* yyscan_t; #endif /* For convenience, these vars (plus the bison vars far below) are macros in the reentrant scanner. */ #define yyin yyg->yyin_r #define yyout yyg->yyout_r #define yyextra yyg->yyextra_r #define yyleng yyg->yyleng_r #define yytext yyg->yytext_r #define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno) #define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column) #define yy_flex_debug yyg->yy_flex_debug_r /* Enter a start condition. This macro really ought to take a parameter, * but we do it the disgusting crufty way forced on us by the ()-less * definition of BEGIN. */ #define BEGIN yyg->yy_start = 1 + 2 * /* Translate the current start state into a value that can be later handed * to BEGIN to return to the state. The YYSTATE alias is for lex * compatibility. */ #define YY_START ((yyg->yy_start - 1) / 2) #define YYSTATE YY_START /* Action number for EOF rule of a given start state. */ #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) /* Special action meaning "start processing a new file". */ #define YY_NEW_FILE yyrestart(yyin ,yyscanner ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #ifndef YY_BUF_SIZE #define YY_BUF_SIZE 16384 #endif /* The state buf must be large enough to hold one state per character in the main buffer. */ #define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) #ifndef YY_TYPEDEF_YY_BUFFER_STATE #define YY_TYPEDEF_YY_BUFFER_STATE typedef struct yy_buffer_state *YY_BUFFER_STATE; #endif #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 #define YY_LESS_LINENO(n) /* Return all but the first "n" matched characters back to the input stream. */ #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ int yyless_macro_arg = (n); \ YY_LESS_LINENO(yyless_macro_arg);\ *yy_cp = yyg->yy_hold_char; \ YY_RESTORE_YY_MORE_OFFSET \ yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ YY_DO_BEFORE_ACTION; /* set up yytext again */ \ } \ while ( 0 ) #define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner ) #ifndef YY_TYPEDEF_YY_SIZE_T #define YY_TYPEDEF_YY_SIZE_T typedef size_t yy_size_t; #endif #ifndef YY_STRUCT_YY_BUFFER_STATE #define YY_STRUCT_YY_BUFFER_STATE struct yy_buffer_state { FILE *yy_input_file; char *yy_ch_buf; /* input buffer */ char *yy_buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ yy_size_t yy_buf_size; /* Number of characters read into yy_ch_buf, not including EOB * characters. */ int yy_n_chars; /* Whether we "own" the buffer - i.e., we know we created it, * and can realloc() it to grow it, and should free() it to * delete it. */ int yy_is_our_buffer; /* Whether this is an "interactive" input source; if so, and * if we're using stdio for input, then we want to use getc() * instead of fread(), to make sure we stop fetching input after * each newline. */ int yy_is_interactive; /* Whether we're considered to be at the beginning of a line. * If so, '^' rules will be active on the next match, otherwise * not. */ int yy_at_bol; int yy_bs_lineno; /**< The line count. */ int yy_bs_column; /**< The column count. */ /* Whether to try to fill the input buffer when we reach the * end of it. */ int yy_fill_buffer; int yy_buffer_status; #define YY_BUFFER_NEW 0 #define YY_BUFFER_NORMAL 1 /* When an EOF's been seen but there's still some text to process * then we mark the buffer as YY_EOF_PENDING, to indicate that we * shouldn't try reading from the input source any more. We might * still have a bunch of tokens to match, though, because of * possible backing-up. * * When we actually see the EOF, we change the status to "new" * (via yyrestart()), so that the user can continue scanning by * just pointing yyin at a new input file. */ #define YY_BUFFER_EOF_PENDING 2 }; #endif /* !YY_STRUCT_YY_BUFFER_STATE */ /* We provide macros for accessing buffer states in case in the * future we want to put the buffer states in a more general * "scanner state". * * Returns the top of the stack, or NULL. */ #define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \ ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \ : NULL) /* Same as previous macro, but useful when we know that the buffer stack is not * NULL or when we need an lvalue. For internal use only. */ #define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] void yyrestart (FILE *input_file ,yyscan_t yyscanner ); void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner ); void yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); void yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); void yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); void yypop_buffer_state (yyscan_t yyscanner ); static void yyensure_buffer_stack (yyscan_t yyscanner ); static void yy_load_buffer_state (yyscan_t yyscanner ); static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner ); #define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ,yyscanner) YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner ); YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner ); YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner ); void *yyalloc (yy_size_t ,yyscan_t yyscanner ); void *yyrealloc (void *,yy_size_t ,yyscan_t yyscanner ); void yyfree (void * ,yyscan_t yyscanner ); #define yy_new_buffer yy_create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! YY_CURRENT_BUFFER ){ \ yyensure_buffer_stack (yyscanner); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! YY_CURRENT_BUFFER ){\ yyensure_buffer_stack (yyscanner); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) /* Begin user sect3 */ #define yywrap(n) 1 #define YY_SKIP_YYWRAP typedef unsigned char YY_CHAR; typedef int yy_state_type; #define yytext_ptr yytext_r static yy_state_type yy_get_previous_state (yyscan_t yyscanner ); static yy_state_type yy_try_NUL_trans (yy_state_type current_state ,yyscan_t yyscanner); static int yy_get_next_buffer (yyscan_t yyscanner ); static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner ); /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ yyg->yytext_ptr = yy_bp; \ yyleng = (size_t) (yy_cp - yy_bp); \ yyg->yy_hold_char = *yy_cp; \ *yy_cp = '\0'; \ yyg->yy_c_buf_p = yy_cp; #define YY_NUM_RULES 84 #define YY_END_OF_BUFFER 85 /* This struct is not used in this scanner, but its presence is necessary. */ struct yy_trans_info { flex_int32_t yy_verify; flex_int32_t yy_nxt; }; static yyconst flex_int16_t yy_accept[312] = { 0, 0, 0, 0, 0, 85, 83, 82, 82, 83, 83, 73, 83, 74, 83, 83, 83, 83, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 83, 2, 84, 2, 82, 67, 0, 72, 0, 73, 1, 73, 74, 71, 69, 68, 70, 0, 79, 79, 79, 79, 78, 78, 5, 78, 78, 10, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 28, 29, 78, 78, 78, 78, 78, 78, 78, 78, 78, 43, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 0, 3, 0, 80, 79, 79, 75, 79, 4, 6, 7, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 20, 78, 78, 78, 78, 78, 78, 78, 78, 31, 78, 78, 35, 78, 37, 38, 78, 40, 78, 78, 78, 78, 78, 78, 78, 78, 78, 50, 78, 78, 78, 56, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 0, 81, 80, 79, 79, 78, 78, 11, 78, 78, 78, 78, 78, 17, 78, 21, 78, 78, 24, 78, 78, 78, 78, 32, 78, 78, 36, 78, 41, 78, 78, 45, 78, 78, 78, 78, 78, 52, 78, 78, 78, 78, 78, 59, 78, 78, 78, 78, 78, 78, 78, 79, 79, 8, 78, 78, 78, 14, 78, 78, 78, 78, 22, 23, 78, 78, 27, 78, 33, 34, 39, 78, 44, 78, 78, 78, 78, 78, 78, 54, 78, 78, 78, 78, 78, 78, 78, 78, 65, 78, 77, 79, 78, 78, 13, 15, 16, 78, 78, 78, 26, 30, 42, 78, 78, 78, 49, 78, 53, 55, 57, 78, 60, 61, 78, 78, 64, 66, 76, 9, 78, 78, 78, 78, 46, 47, 78, 51, 78, 78, 78, 78, 18, 19, 25, 48, 78, 78, 63, 12, 78, 62, 78, 58, 0 } ; static yyconst flex_int32_t yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 1, 1, 1, 5, 1, 1, 6, 1, 1, 1, 7, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 1, 11, 12, 13, 1, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 24, 31, 32, 33, 34, 35, 36, 37, 38, 24, 1, 39, 1, 1, 24, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 24, 50, 51, 52, 53, 54, 55, 24, 56, 57, 58, 59, 60, 61, 62, 63, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 } ; static yyconst flex_int32_t yy_meta[64] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 } ; static yyconst flex_int16_t yy_base[321] = { 0, 0, 0, 61, 62, 437, 636, 67, 69, 338, 61, 331, 244, 66, 233, 64, 181, 65, 46, 64, 76, 66, 0, 97, 90, 66, 64, 110, 120, 112, 121, 161, 129, 63, 83, 169, 0, 636, 636, 179, 93, 636, 81, 636, 134, 160, 636, 156, 83, 636, 636, 636, 636, 0, 0, 118, 127, 133, 0, 145, 159, 156, 165, 0, 131, 170, 162, 173, 176, 171, 175, 184, 187, 199, 199, 202, 0, 202, 205, 206, 204, 212, 226, 215, 213, 221, 215, 231, 223, 225, 228, 252, 232, 235, 251, 242, 258, 267, 263, 264, 246, 264, 272, 256, 118, 636, 288, 0, 0, 262, 0, 274, 0, 0, 0, 275, 268, 279, 280, 284, 284, 284, 297, 301, 289, 0, 298, 300, 304, 306, 317, 319, 304, 320, 312, 320, 329, 0, 333, 0, 0, 330, 0, 325, 329, 335, 337, 333, 328, 338, 337, 335, 0, 332, 355, 346, 0, 347, 355, 352, 370, 354, 363, 362, 370, 363, 373, 94, 636, 0, 371, 379, 375, 382, 0, 390, 383, 376, 377, 381, 385, 384, 0, 399, 387, 0, 389, 408, 395, 398, 0, 397, 414, 0, 406, 0, 411, 411, 0, 428, 415, 432, 434, 429, 0, 429, 424, 424, 434, 427, 0, 427, 442, 449, 443, 446, 451, 449, 442, 451, 0, 457, 447, 453, 0, 469, 470, 468, 465, 0, 0, 472, 471, 0, 468, 0, 0, 0, 475, 0, 487, 478, 492, 476, 481, 493, 0, 484, 487, 498, 501, 491, 508, 499, 496, 0, 504, 0, 503, 509, 502, 0, 0, 0, 524, 525, 516, 0, 0, 0, 524, 515, 532, 0, 525, 0, 0, 0, 538, 0, 0, 532, 535, 0, 0, 0, 0, 530, 541, 530, 536, 0, 0, 540, 0, 534, 552, 541, 546, 0, 0, 0, 0, 553, 547, 0, 0, 551, 0, 557, 0, 636, 610, 615, 618, 621, 100, 76, 624, 627, 631 } ; static yyconst flex_int16_t yy_def[321] = { 0, 311, 1, 312, 312, 311, 311, 311, 311, 311, 313, 311, 311, 311, 311, 311, 311, 314, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 316, 311, 311, 311, 311, 311, 313, 311, 313, 311, 311, 311, 311, 311, 311, 311, 311, 317, 318, 318, 318, 318, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 319, 311, 313, 320, 318, 318, 318, 318, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 319, 311, 320, 318, 318, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 318, 318, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 318, 318, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 318, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 315, 0, 311, 311, 311, 311, 311, 311, 311, 311, 311 } ; static yyconst flex_int16_t yy_nxt[700] = { 0, 6, 7, 8, 9, 10, 6, 11, 12, 13, 14, 15, 6, 16, 17, 18, 19, 20, 21, 22, 23, 24, 22, 25, 22, 22, 26, 27, 28, 29, 22, 30, 31, 32, 33, 34, 35, 22, 22, 6, 36, 18, 19, 20, 21, 22, 23, 24, 22, 25, 22, 26, 27, 28, 29, 22, 30, 31, 32, 33, 34, 35, 22, 22, 38, 38, 43, 39, 39, 40, 40, 40, 40, 47, 59, 48, 50, 51, 60, 53, 107, 61, 55, 62, 76, 67, 43, 78, 56, 68, 47, 64, 48, 98, 77, 40, 40, 69, 99, 59, 44, 57, 63, 60, 104, 65, 61, 66, 55, 62, 76, 67, 70, 78, 56, 68, 74, 64, 98, 77, 44, 75, 69, 71, 99, 79, 57, 63, 72, 80, 65, 73, 66, 81, 168, 83, 88, 311, 70, 82, 89, 74, 86, 87, 96, 110, 75, 109, 71, 84, 90, 79, 111, 72, 85, 80, 73, 117, 168, 81, 97, 83, 88, 112, 82, 45, 89, 86, 87, 45, 96, 110, 109, 106, 84, 90, 113, 114, 111, 85, 91, 121, 117, 92, 100, 97, 115, 105, 101, 112, 93, 102, 103, 52, 94, 95, 118, 119, 116, 122, 126, 127, 113, 114, 120, 123, 91, 121, 124, 92, 100, 125, 115, 128, 101, 93, 129, 102, 103, 94, 95, 118, 119, 116, 122, 126, 127, 130, 131, 120, 123, 132, 135, 124, 133, 134, 125, 138, 128, 136, 139, 129, 141, 137, 140, 49, 142, 143, 144, 145, 46, 146, 130, 131, 149, 147, 132, 135, 148, 133, 134, 153, 138, 154, 136, 139, 155, 141, 137, 156, 140, 142, 143, 144, 157, 145, 146, 163, 150, 149, 147, 160, 158, 148, 151, 152, 153, 164, 154, 166, 161, 165, 155, 43, 156, 162, 170, 171, 172, 178, 157, 159, 163, 150, 173, 174, 175, 160, 158, 151, 152, 176, 177, 164, 166, 161, 179, 165, 180, 184, 162, 170, 181, 171, 172, 178, 159, 44, 182, 173, 174, 175, 183, 185, 186, 187, 176, 177, 188, 189, 45, 190, 179, 191, 180, 184, 192, 181, 193, 194, 41, 195, 196, 182, 197, 198, 202, 183, 185, 199, 186, 187, 200, 188, 201, 189, 190, 203, 204, 191, 205, 210, 192, 208, 193, 194, 195, 206, 196, 207, 197, 198, 202, 209, 199, 211, 213, 200, 212, 201, 214, 215, 203, 204, 216, 217, 205, 210, 208, 218, 219, 221, 206, 220, 207, 222, 223, 228, 209, 224, 225, 211, 213, 212, 226, 214, 227, 215, 229, 216, 230, 217, 231, 232, 218, 233, 219, 221, 220, 234, 235, 222, 223, 228, 224, 225, 236, 311, 237, 226, 238, 227, 239, 240, 229, 230, 241, 231, 242, 232, 233, 243, 244, 248, 234, 235, 245, 246, 247, 249, 250, 251, 236, 237, 252, 238, 253, 239, 254, 240, 255, 241, 256, 258, 242, 257, 259, 243, 244, 248, 260, 245, 246, 247, 249, 250, 261, 251, 262, 263, 252, 264, 253, 265, 254, 266, 255, 267, 256, 258, 257, 268, 259, 269, 270, 260, 271, 272, 311, 273, 274, 261, 275, 278, 262, 263, 276, 264, 265, 277, 279, 266, 267, 280, 281, 287, 268, 282, 269, 283, 270, 271, 284, 272, 273, 274, 285, 286, 275, 278, 288, 276, 289, 291, 277, 290, 279, 292, 280, 293, 281, 287, 282, 294, 283, 295, 297, 284, 296, 298, 299, 285, 286, 300, 301, 302, 288, 303, 289, 291, 290, 304, 292, 305, 306, 293, 307, 311, 294, 308, 309, 295, 297, 296, 298, 310, 299, 311, 300, 301, 302, 311, 303, 311, 311, 311, 311, 304, 305, 306, 311, 311, 307, 311, 308, 309, 311, 311, 311, 311, 310, 37, 37, 37, 37, 37, 42, 42, 42, 42, 42, 54, 54, 58, 311, 58, 108, 311, 108, 167, 311, 167, 167, 169, 311, 169, 5, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311 } ; static yyconst flex_int16_t yy_chk[700] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 4, 10, 3, 4, 7, 7, 8, 8, 13, 18, 13, 15, 15, 18, 17, 317, 18, 17, 19, 25, 21, 42, 26, 17, 21, 48, 20, 48, 33, 25, 40, 40, 21, 34, 18, 10, 17, 19, 18, 316, 20, 18, 20, 17, 19, 25, 21, 23, 26, 17, 21, 24, 20, 33, 25, 42, 24, 21, 23, 34, 27, 17, 19, 23, 27, 20, 23, 20, 27, 167, 28, 30, 44, 23, 27, 30, 24, 29, 29, 32, 56, 24, 55, 23, 28, 30, 27, 57, 23, 28, 27, 23, 64, 104, 27, 32, 28, 30, 59, 27, 47, 30, 29, 29, 45, 32, 56, 55, 44, 28, 30, 60, 61, 57, 28, 31, 66, 64, 31, 35, 32, 62, 39, 35, 59, 31, 35, 35, 16, 31, 31, 65, 65, 62, 67, 69, 70, 60, 61, 65, 67, 31, 66, 68, 31, 35, 68, 62, 71, 35, 31, 72, 35, 35, 31, 31, 65, 65, 62, 67, 69, 70, 73, 74, 65, 67, 75, 78, 68, 77, 77, 68, 80, 71, 79, 81, 72, 83, 79, 82, 14, 84, 85, 86, 87, 12, 88, 73, 74, 90, 89, 75, 78, 89, 77, 77, 92, 80, 93, 79, 81, 94, 83, 79, 95, 82, 84, 85, 86, 96, 87, 88, 100, 91, 90, 89, 98, 97, 89, 91, 91, 92, 101, 93, 103, 99, 102, 94, 106, 95, 99, 109, 111, 115, 121, 96, 97, 100, 91, 116, 117, 118, 98, 97, 91, 91, 119, 120, 101, 103, 99, 122, 102, 123, 128, 99, 109, 124, 111, 115, 121, 97, 106, 126, 116, 117, 118, 127, 129, 130, 131, 119, 120, 132, 133, 11, 134, 122, 135, 123, 128, 136, 124, 138, 141, 9, 143, 144, 126, 145, 146, 150, 127, 129, 147, 130, 131, 148, 132, 149, 133, 134, 151, 153, 135, 154, 159, 136, 157, 138, 141, 143, 155, 144, 155, 145, 146, 150, 158, 147, 160, 162, 148, 161, 149, 163, 164, 151, 153, 165, 166, 154, 159, 157, 170, 171, 173, 155, 172, 155, 175, 176, 181, 158, 177, 178, 160, 162, 161, 179, 163, 180, 164, 183, 165, 184, 166, 186, 187, 170, 188, 171, 173, 172, 189, 191, 175, 176, 181, 177, 178, 192, 5, 194, 179, 196, 180, 197, 199, 183, 184, 200, 186, 201, 187, 188, 202, 203, 208, 189, 191, 205, 206, 207, 209, 211, 212, 192, 194, 213, 196, 214, 197, 215, 199, 216, 200, 217, 219, 201, 218, 221, 202, 203, 208, 222, 205, 206, 207, 209, 211, 223, 212, 225, 226, 213, 227, 214, 228, 215, 231, 216, 232, 217, 219, 218, 234, 221, 238, 240, 222, 241, 242, 0, 243, 244, 223, 245, 249, 225, 226, 247, 227, 228, 248, 250, 231, 232, 251, 252, 260, 234, 253, 238, 254, 240, 241, 256, 242, 243, 244, 258, 259, 245, 249, 264, 247, 265, 270, 248, 266, 250, 271, 251, 272, 252, 260, 253, 274, 254, 278, 282, 256, 281, 287, 288, 258, 259, 289, 290, 293, 264, 295, 265, 270, 266, 296, 271, 297, 298, 272, 303, 0, 274, 304, 307, 278, 282, 281, 287, 309, 288, 0, 289, 290, 293, 0, 295, 0, 0, 0, 0, 296, 297, 298, 0, 0, 303, 0, 304, 307, 0, 0, 0, 0, 309, 312, 312, 312, 312, 312, 313, 313, 313, 313, 313, 314, 314, 315, 0, 315, 318, 0, 318, 319, 0, 319, 319, 320, 0, 320, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311, 311 } ; /* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */ #define REJECT reject_used_but_not_detected #define yymore() yymore_used_but_not_detected #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET #line 1 "sphinxql.l" #line 2 "sphinxql.l" #include "yysphinxql.h" #if USE_WINDOWS #pragma warning(push,1) #endif // warning, lexer generator dependent! // this macro relies on that in flex yytext points to the actual location in the buffer #define YYSTOREBOUNDS \ { \ lvalp->m_iStart = yytext - pParser->m_pBuf; \ lvalp->m_iEnd = lvalp->m_iStart + yyleng; \ pParser->m_pLastTokenStart = yytext; \ } #line 709 "llsphinxql.c" #define INITIAL 0 #define ccomment 1 #ifndef YY_NO_UNISTD_H /* Special case for "unistd.h", since it is non-ANSI. We include it way * down here because we want the user's section 1 to have been scanned first. * The user has a chance to override it with an option. */ #if !USE_WINDOWS #include #endif #endif #ifndef YY_EXTRA_TYPE #define YY_EXTRA_TYPE void * #endif /* Holds the entire state of the reentrant scanner. */ struct yyguts_t { /* User-defined. Not touched by flex. */ YY_EXTRA_TYPE yyextra_r; /* The rest are the same as the globals declared in the non-reentrant scanner. */ FILE *yyin_r, *yyout_r; size_t yy_buffer_stack_top; /**< index of top of stack. */ size_t yy_buffer_stack_max; /**< capacity of stack. */ YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */ char yy_hold_char; int yy_n_chars; int yyleng_r; char *yy_c_buf_p; int yy_init; int yy_start; int yy_did_buffer_switch_on_eof; int yy_start_stack_ptr; int yy_start_stack_depth; int *yy_start_stack; yy_state_type yy_last_accepting_state; char* yy_last_accepting_cpos; int yylineno_r; int yy_flex_debug_r; char *yytext_r; int yy_more_flag; int yy_more_len; }; /* end struct yyguts_t */ static int yy_init_globals (yyscan_t yyscanner ); int yylex_init (yyscan_t* scanner); int yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner); /* Accessor methods to globals. These are made visible to non-reentrant scanners for convenience. */ int yylex_destroy (yyscan_t yyscanner ); int yyget_debug (yyscan_t yyscanner ); void yyset_debug (int debug_flag ,yyscan_t yyscanner ); YY_EXTRA_TYPE yyget_extra (yyscan_t yyscanner ); void yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner ); FILE *yyget_in (yyscan_t yyscanner ); void yyset_in (FILE * in_str ,yyscan_t yyscanner ); FILE *yyget_out (yyscan_t yyscanner ); void yyset_out (FILE * out_str ,yyscan_t yyscanner ); int yyget_leng (yyscan_t yyscanner ); char *yyget_text (yyscan_t yyscanner ); int yyget_lineno (yyscan_t yyscanner ); void yyset_lineno (int line_number ,yyscan_t yyscanner ); /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int yywrap (yyscan_t yyscanner ); #else extern int yywrap (yyscan_t yyscanner ); #endif #endif #ifndef yytext_ptr static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner); #endif #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput (yyscan_t yyscanner ); #else static int input (yyscan_t yyscanner ); #endif #endif /* Amount of stuff to slurp up with each read. */ #ifndef YY_READ_BUF_SIZE #define YY_READ_BUF_SIZE 8192 #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef ECHO /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO fwrite( yytext, yyleng, 1, yyout ) #endif /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, * is returned in "result". */ #ifndef YY_INPUT #define YY_INPUT(buf,result,max_size) \ if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ { \ int c = '*'; \ int n; \ for ( n = 0; n < max_size && \ (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else \ { \ errno=0; \ while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ { \ if( errno != EINTR) \ { \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ break; \ } \ errno=0; \ clearerr(yyin); \ } \ }\ \ #endif /* No semi-colon after return; correct usage is to write "yyterminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */ #ifndef yyterminate #define yyterminate() return YY_NULL #endif /* Number of entries by which start-condition stack grows. */ #ifndef YY_START_STACK_INCR #define YY_START_STACK_INCR 25 #endif /* Report a fatal error. */ #ifndef YY_FATAL_ERROR #define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner) #endif /* end tables serialization structures and prototypes */ /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef YY_DECL #define YY_DECL_IS_OURS 1 extern int yylex (yyscan_t yyscanner); #define YY_DECL int yylex (yyscan_t yyscanner) #endif /* !YY_DECL */ /* Code executed at the beginning of each rule, after yytext and yyleng * have been set up. */ #ifndef YY_USER_ACTION #define YY_USER_ACTION #endif /* Code executed at the end of each rule. */ #ifndef YY_BREAK #define YY_BREAK break; #endif #define YY_RULE_SETUP \ YY_USER_ACTION /** The main scanner function which does all the work. */ YY_DECL { register yy_state_type yy_current_state; register char *yy_cp, *yy_bp; register int yy_act; struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; #line 29 "sphinxql.l" #line 932 "llsphinxql.c" if ( !yyg->yy_init ) { yyg->yy_init = 1; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! yyg->yy_start ) yyg->yy_start = 1; /* first start state */ if ( ! yyin ) yyin = stdin; if ( ! yyout ) yyout = stdout; if ( ! YY_CURRENT_BUFFER ) { yyensure_buffer_stack (yyscanner); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); } yy_load_buffer_state(yyscanner ); } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = yyg->yy_c_buf_p; /* Support of yytext. */ *yy_cp = yyg->yy_hold_char; /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; yy_current_state = yyg->yy_start; yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; if ( yy_accept[yy_current_state] ) { yyg->yy_last_accepting_state = yy_current_state; yyg->yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 312 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; ++yy_cp; } while ( yy_base[yy_current_state] != 636 ); yy_find_action: yy_act = yy_accept[yy_current_state]; if ( yy_act == 0 ) { /* have to back up */ yy_cp = yyg->yy_last_accepting_cpos; yy_current_state = yyg->yy_last_accepting_state; yy_act = yy_accept[yy_current_state]; } YY_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( yy_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = yyg->yy_hold_char; yy_cp = yyg->yy_last_accepting_cpos; yy_current_state = yyg->yy_last_accepting_state; goto yy_find_action; case 1: YY_RULE_SETUP #line 31 "sphinxql.l" { BEGIN(ccomment); } YY_BREAK case 2: YY_RULE_SETUP #line 32 "sphinxql.l" { } YY_BREAK case 3: YY_RULE_SETUP #line 33 "sphinxql.l" { BEGIN(INITIAL); } YY_BREAK case 4: YY_RULE_SETUP #line 35 "sphinxql.l" { YYSTOREBOUNDS; return TOK_AND; } YY_BREAK case 5: YY_RULE_SETUP #line 36 "sphinxql.l" { YYSTOREBOUNDS; return TOK_AS; } YY_BREAK case 6: YY_RULE_SETUP #line 37 "sphinxql.l" { YYSTOREBOUNDS; return TOK_ASC; } YY_BREAK case 7: YY_RULE_SETUP #line 38 "sphinxql.l" { YYSTOREBOUNDS; return TOK_AVG; } YY_BREAK case 8: YY_RULE_SETUP #line 39 "sphinxql.l" { YYSTOREBOUNDS; return TOK_BEGIN; } YY_BREAK case 9: YY_RULE_SETUP #line 40 "sphinxql.l" { YYSTOREBOUNDS; return TOK_BETWEEN; } YY_BREAK case 10: YY_RULE_SETUP #line 41 "sphinxql.l" { YYSTOREBOUNDS; return TOK_BY; } YY_BREAK case 11: YY_RULE_SETUP #line 42 "sphinxql.l" { YYSTOREBOUNDS; return TOK_CALL; } YY_BREAK case 12: YY_RULE_SETUP #line 43 "sphinxql.l" { YYSTOREBOUNDS; return TOK_COLLATION; } YY_BREAK case 13: YY_RULE_SETUP #line 44 "sphinxql.l" { YYSTOREBOUNDS; return TOK_COMMIT; } YY_BREAK case 14: YY_RULE_SETUP #line 45 "sphinxql.l" { YYSTOREBOUNDS; return TOK_COUNT; } YY_BREAK case 15: YY_RULE_SETUP #line 46 "sphinxql.l" { YYSTOREBOUNDS; return TOK_CREATE; } YY_BREAK case 16: YY_RULE_SETUP #line 47 "sphinxql.l" { YYSTOREBOUNDS; return TOK_DELETE; } YY_BREAK case 17: YY_RULE_SETUP #line 48 "sphinxql.l" { YYSTOREBOUNDS; return TOK_DESC; } YY_BREAK case 18: YY_RULE_SETUP #line 49 "sphinxql.l" { YYSTOREBOUNDS; return TOK_DESCRIBE; } YY_BREAK case 19: YY_RULE_SETUP #line 50 "sphinxql.l" { YYSTOREBOUNDS; return TOK_DISTINCT; } YY_BREAK case 20: YY_RULE_SETUP #line 51 "sphinxql.l" { YYSTOREBOUNDS; return TOK_DIV; } YY_BREAK case 21: YY_RULE_SETUP #line 52 "sphinxql.l" { YYSTOREBOUNDS; return TOK_DROP; } YY_BREAK case 22: YY_RULE_SETUP #line 53 "sphinxql.l" { YYSTOREBOUNDS; return TOK_FALSE; } YY_BREAK case 23: YY_RULE_SETUP #line 54 "sphinxql.l" { YYSTOREBOUNDS; return TOK_FLOAT; } YY_BREAK case 24: YY_RULE_SETUP #line 55 "sphinxql.l" { YYSTOREBOUNDS; return TOK_FROM; } YY_BREAK case 25: YY_RULE_SETUP #line 56 "sphinxql.l" { YYSTOREBOUNDS; return TOK_FUNCTION; } YY_BREAK case 26: YY_RULE_SETUP #line 57 "sphinxql.l" { YYSTOREBOUNDS; return TOK_GLOBAL; } YY_BREAK case 27: YY_RULE_SETUP #line 58 "sphinxql.l" { YYSTOREBOUNDS; return TOK_GROUP; } YY_BREAK case 28: YY_RULE_SETUP #line 59 "sphinxql.l" { YYSTOREBOUNDS; return TOK_ID; } YY_BREAK case 29: YY_RULE_SETUP #line 60 "sphinxql.l" { YYSTOREBOUNDS; return TOK_IN; } YY_BREAK case 30: YY_RULE_SETUP #line 61 "sphinxql.l" { YYSTOREBOUNDS; return TOK_INSERT; } YY_BREAK case 31: YY_RULE_SETUP #line 62 "sphinxql.l" { YYSTOREBOUNDS; return TOK_INT; } YY_BREAK case 32: YY_RULE_SETUP #line 63 "sphinxql.l" { YYSTOREBOUNDS; return TOK_INTO; } YY_BREAK case 33: YY_RULE_SETUP #line 64 "sphinxql.l" { YYSTOREBOUNDS; return TOK_LIMIT; } YY_BREAK case 34: YY_RULE_SETUP #line 65 "sphinxql.l" { YYSTOREBOUNDS; return TOK_MATCH; } YY_BREAK case 35: YY_RULE_SETUP #line 66 "sphinxql.l" { YYSTOREBOUNDS; return TOK_MAX; } YY_BREAK case 36: YY_RULE_SETUP #line 67 "sphinxql.l" { YYSTOREBOUNDS; return TOK_META; } YY_BREAK case 37: YY_RULE_SETUP #line 68 "sphinxql.l" { YYSTOREBOUNDS; return TOK_MIN; } YY_BREAK case 38: YY_RULE_SETUP #line 69 "sphinxql.l" { YYSTOREBOUNDS; return TOK_MOD; } YY_BREAK case 39: YY_RULE_SETUP #line 70 "sphinxql.l" { YYSTOREBOUNDS; return TOK_NAMES; } YY_BREAK case 40: YY_RULE_SETUP #line 71 "sphinxql.l" { YYSTOREBOUNDS; return TOK_NOT; } YY_BREAK case 41: YY_RULE_SETUP #line 72 "sphinxql.l" { YYSTOREBOUNDS; return TOK_NULL; } YY_BREAK case 42: YY_RULE_SETUP #line 73 "sphinxql.l" { YYSTOREBOUNDS; return TOK_OPTION; } YY_BREAK case 43: YY_RULE_SETUP #line 74 "sphinxql.l" { YYSTOREBOUNDS; return TOK_OR; } YY_BREAK case 44: YY_RULE_SETUP #line 75 "sphinxql.l" { YYSTOREBOUNDS; return TOK_ORDER; } YY_BREAK case 45: YY_RULE_SETUP #line 76 "sphinxql.l" { YYSTOREBOUNDS; return TOK_RAND; } YY_BREAK case 46: YY_RULE_SETUP #line 77 "sphinxql.l" { YYSTOREBOUNDS; return TOK_REPLACE; } YY_BREAK case 47: YY_RULE_SETUP #line 78 "sphinxql.l" { YYSTOREBOUNDS; return TOK_RETURNS; } YY_BREAK case 48: YY_RULE_SETUP #line 79 "sphinxql.l" { YYSTOREBOUNDS; return TOK_ROLLBACK; } YY_BREAK case 49: YY_RULE_SETUP #line 80 "sphinxql.l" { YYSTOREBOUNDS; return TOK_SELECT; } YY_BREAK case 50: YY_RULE_SETUP #line 81 "sphinxql.l" { YYSTOREBOUNDS; return TOK_SET; } YY_BREAK case 51: YY_RULE_SETUP #line 82 "sphinxql.l" { YYSTOREBOUNDS; return TOK_SESSION; } YY_BREAK case 52: YY_RULE_SETUP #line 83 "sphinxql.l" { YYSTOREBOUNDS; return TOK_SHOW; } YY_BREAK case 53: YY_RULE_SETUP #line 84 "sphinxql.l" { YYSTOREBOUNDS; return TOK_SONAME; } YY_BREAK case 54: YY_RULE_SETUP #line 85 "sphinxql.l" { YYSTOREBOUNDS; return TOK_START; } YY_BREAK case 55: YY_RULE_SETUP #line 86 "sphinxql.l" { YYSTOREBOUNDS; return TOK_STATUS; } YY_BREAK case 56: YY_RULE_SETUP #line 87 "sphinxql.l" { YYSTOREBOUNDS; return TOK_SUM; } YY_BREAK case 57: YY_RULE_SETUP #line 88 "sphinxql.l" { YYSTOREBOUNDS; return TOK_TABLES; } YY_BREAK case 58: YY_RULE_SETUP #line 89 "sphinxql.l" { YYSTOREBOUNDS; return TOK_TRANSACTION; } YY_BREAK case 59: YY_RULE_SETUP #line 90 "sphinxql.l" { YYSTOREBOUNDS; return TOK_TRUE; } YY_BREAK case 60: YY_RULE_SETUP #line 91 "sphinxql.l" { YYSTOREBOUNDS; return TOK_UPDATE; } YY_BREAK case 61: YY_RULE_SETUP #line 92 "sphinxql.l" { YYSTOREBOUNDS; return TOK_VALUES; } YY_BREAK case 62: YY_RULE_SETUP #line 93 "sphinxql.l" { YYSTOREBOUNDS; return TOK_VARIABLES; } YY_BREAK case 63: YY_RULE_SETUP #line 94 "sphinxql.l" { YYSTOREBOUNDS; return TOK_WARNINGS; } YY_BREAK case 64: YY_RULE_SETUP #line 95 "sphinxql.l" { YYSTOREBOUNDS; return TOK_WEIGHT; } YY_BREAK case 65: YY_RULE_SETUP #line 96 "sphinxql.l" { YYSTOREBOUNDS; return TOK_WHERE; } YY_BREAK case 66: YY_RULE_SETUP #line 97 "sphinxql.l" { YYSTOREBOUNDS; return TOK_WITHIN; } YY_BREAK case 67: YY_RULE_SETUP #line 99 "sphinxql.l" { YYSTOREBOUNDS; return TOK_NE; } YY_BREAK case 68: YY_RULE_SETUP #line 100 "sphinxql.l" { YYSTOREBOUNDS; return TOK_NE; } YY_BREAK case 69: YY_RULE_SETUP #line 101 "sphinxql.l" { YYSTOREBOUNDS; return TOK_LTE; } YY_BREAK case 70: YY_RULE_SETUP #line 102 "sphinxql.l" { YYSTOREBOUNDS; return TOK_GTE; } YY_BREAK case 71: YY_RULE_SETUP #line 103 "sphinxql.l" { YYSTOREBOUNDS; return '='; } YY_BREAK case 72: /* rule 72 can match eol */ YY_RULE_SETUP #line 105 "sphinxql.l" { YYSTOREBOUNDS; SqlUnescape ( lvalp->m_sValue, yytext, yyleng ); return TOK_QUOTED_STRING; } YY_BREAK case 73: YY_RULE_SETUP #line 107 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; lvalp->m_fValue = (float)strtod ( yytext, NULL ); return TOK_CONST_FLOAT; } YY_BREAK case 74: YY_RULE_SETUP #line 108 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; lvalp->m_iValue = strtoll ( yytext, NULL, 10 ); return TOK_CONST_INT; } YY_BREAK case 75: YY_RULE_SETUP #line 110 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_ATIDENT; } YY_BREAK case 76: YY_RULE_SETUP #line 111 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_ATIDENT; } YY_BREAK case 77: YY_RULE_SETUP #line 112 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_ATIDENT; } YY_BREAK case 78: YY_RULE_SETUP #line 113 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_IDENT; } YY_BREAK case 79: YY_RULE_SETUP #line 114 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_USERVAR; } YY_BREAK case 80: YY_RULE_SETUP #line 115 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_SYSVAR; } YY_BREAK case 81: YY_RULE_SETUP #line 116 "sphinxql.l" { YYSTOREBOUNDS; lvalp->m_iStart++; lvalp->m_iEnd--; lvalp->m_sValue.SetBinary ( yytext+1, strlen(yytext)-2 ); return TOK_IDENT; } YY_BREAK case 82: /* rule 82 can match eol */ YY_RULE_SETUP #line 118 "sphinxql.l" { ; } YY_BREAK case 83: YY_RULE_SETUP #line 119 "sphinxql.l" { YYSTOREBOUNDS; return yytext[0]; } YY_BREAK case 84: YY_RULE_SETUP #line 121 "sphinxql.l" ECHO; YY_BREAK #line 1437 "llsphinxql.c" case YY_STATE_EOF(INITIAL): case YY_STATE_EOF(ccomment): yyterminate(); case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *yy_cp = yyg->yy_hold_char; YY_RESTORE_YY_MORE_OFFSET if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) { /* We're scanning a new file or input source. It's * possible that this happened because the user * just pointed yyin at a new source and called * yylex(). If so, then we have to assure * consistency between YY_CURRENT_BUFFER and our * globals. Here is the right place to do so, because * this is the first action (other than possibly a * back-up) that will match for the new input source. */ yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; } /* Note that here we test for yy_c_buf_p "<=" to the position * of the first EOB in the buffer, since yy_c_buf_p will * already have been incremented past the NUL character * (since all states make transitions on EOB to the * end-of-buffer state). Contrast this with the test * in input(). */ if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] ) { /* This was really a NUL. */ yy_state_type yy_next_state; yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( yyscanner ); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * yy_get_previous_state() go ahead and do it * for us because it doesn't know how to deal * with the possibility of jamming (and we don't * want to build jamming into it because then it * will run more slowly). */ yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner); yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++yyg->yy_c_buf_p; yy_current_state = yy_next_state; goto yy_match; } else { yy_cp = yyg->yy_c_buf_p; goto yy_find_action; } } else switch ( yy_get_next_buffer( yyscanner ) ) { case EOB_ACT_END_OF_FILE: { yyg->yy_did_buffer_switch_on_eof = 0; if ( yywrap(yyscanner ) ) { /* Note: because we've taken care in * yy_get_next_buffer() to have set up * yytext, we can now set up * yy_c_buf_p so that if some total * hoser (like flex itself) wants to * call the scanner after we return the * YY_NULL, it'll still work - another * YY_NULL will get returned. */ yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! yyg->yy_did_buffer_switch_on_eof ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( yyscanner ); yy_cp = yyg->yy_c_buf_p; yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: yyg->yy_c_buf_p = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars]; yy_current_state = yy_get_previous_state( yyscanner ); yy_cp = yyg->yy_c_buf_p; yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; goto yy_find_action; } break; } default: YY_FATAL_ERROR( "fatal flex scanner internal error--no action found" ); } /* end of action switch */ } /* end of scanning one token */ } /* end of yylex */ /* yy_get_next_buffer - try to read in a new buffer * * Returns a code representing an action: * EOB_ACT_LAST_MATCH - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position * EOB_ACT_END_OF_FILE - end of file */ static int yy_get_next_buffer (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; register char *source = yyg->yytext_ptr; register int number_to_move, i; int ret_val; if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] ) YY_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) { /* Don't try to fill the buffer, so this is an EOF. */ if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 ) { /* We matched a single character, the EOB, so * treat this as a final EOF. */ return EOB_ACT_END_OF_FILE; } else { /* We matched some text prior to the EOB, first * process it. */ return EOB_ACT_LAST_MATCH; } } /* Try to read more data. */ /* First move last chars to start of buffer. */ number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1; for ( i = 0; i < number_to_move; ++i ) *(dest++) = *(source++); if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) /* don't do the read, it's not guaranteed to return an EOF, * just force an EOF */ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0; else { int num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; while ( num_to_read <= 0 ) { /* Not enough room in the buffer - grow it. */ /* just a shorter name for the current buffer */ YY_BUFFER_STATE b = YY_CURRENT_BUFFER; int yy_c_buf_p_offset = (int) (yyg->yy_c_buf_p - b->yy_ch_buf); if ( b->yy_is_our_buffer ) { int new_size = b->yy_buf_size * 2; if ( new_size <= 0 ) b->yy_buf_size += b->yy_buf_size / 8; else b->yy_buf_size *= 2; b->yy_ch_buf = (char *) /* Include room in for 2 EOB chars. */ yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner ); } else /* Can't grow it, we don't own it. */ b->yy_ch_buf = 0; if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; } if ( num_to_read > YY_READ_BUF_SIZE ) num_to_read = YY_READ_BUF_SIZE; /* Read in more data. */ YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), yyg->yy_n_chars, num_to_read ); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; } if ( yyg->yy_n_chars == 0 ) { if ( number_to_move == YY_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; yyrestart(yyin ,yyscanner); } else { ret_val = EOB_ACT_LAST_MATCH; YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { /* Extend the array by 50%, plus the number we really need. */ yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1); YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner ); if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); } yyg->yy_n_chars += number_to_move; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; return ret_val; } /* yy_get_previous_state - get the state just before the EOB char was reached */ static yy_state_type yy_get_previous_state (yyscan_t yyscanner) { register yy_state_type yy_current_state; register char *yy_cp; struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; yy_current_state = yyg->yy_start; for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp ) { register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); if ( yy_accept[yy_current_state] ) { yyg->yy_last_accepting_state = yy_current_state; yyg->yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 312 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; } return yy_current_state; } /* yy_try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = yy_try_NUL_trans( current_state ); */ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state , yyscan_t yyscanner) { register int yy_is_jam; struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */ register char *yy_cp = yyg->yy_c_buf_p; register YY_CHAR yy_c = 1; if ( yy_accept[yy_current_state] ) { yyg->yy_last_accepting_state = yy_current_state; yyg->yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 312 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; yy_is_jam = (yy_current_state == 311); return yy_is_jam ? 0 : yy_current_state; } #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput (yyscan_t yyscanner) #else static int input (yyscan_t yyscanner) #endif { int c; struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; *yyg->yy_c_buf_p = yyg->yy_hold_char; if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) { /* yy_c_buf_p now points to the character we want to return. * If this occurs *before* the EOB characters, then it's a * valid NUL; if not, then we've hit the end of the buffer. */ if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] ) /* This was really a NUL. */ *yyg->yy_c_buf_p = '\0'; else { /* need more input */ int offset = yyg->yy_c_buf_p - yyg->yytext_ptr; ++yyg->yy_c_buf_p; switch ( yy_get_next_buffer( yyscanner ) ) { case EOB_ACT_LAST_MATCH: /* This happens because yy_g_n_b() * sees that we've accumulated a * token and flags that we need to * try matching the token before * proceeding. But for input(), * there's no matching to consider. * So convert the EOB_ACT_LAST_MATCH * to EOB_ACT_END_OF_FILE. */ /* Reset buffer status. */ yyrestart(yyin ,yyscanner); /*FALLTHROUGH*/ case EOB_ACT_END_OF_FILE: { if ( yywrap(yyscanner ) ) return EOF; if ( ! yyg->yy_did_buffer_switch_on_eof ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(yyscanner); #else return input(yyscanner); #endif } case EOB_ACT_CONTINUE_SCAN: yyg->yy_c_buf_p = yyg->yytext_ptr + offset; break; } } } c = *(unsigned char *) yyg->yy_c_buf_p; /* cast for 8-bit char's */ *yyg->yy_c_buf_p = '\0'; /* preserve yytext */ yyg->yy_hold_char = *++yyg->yy_c_buf_p; return c; } #endif /* ifndef YY_NO_INPUT */ /** Immediately switch to a different input stream. * @param input_file A readable stream. * @param yyscanner The scanner object. * @note This function does not reset the start condition to @c INITIAL . */ void yyrestart (FILE * input_file , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if ( ! YY_CURRENT_BUFFER ){ yyensure_buffer_stack (yyscanner); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); } yy_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner); yy_load_buffer_state(yyscanner ); } /** Switch to a different input buffer. * @param new_buffer The new input buffer. * @param yyscanner The scanner object. */ void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* TODO. We should be able to replace this entire function body * with * yypop_buffer_state(); * yypush_buffer_state(new_buffer); */ yyensure_buffer_stack (yyscanner); if ( YY_CURRENT_BUFFER == new_buffer ) return; if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *yyg->yy_c_buf_p = yyg->yy_hold_char; YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; } YY_CURRENT_BUFFER_LVALUE = new_buffer; yy_load_buffer_state(yyscanner ); /* We don't actually know whether we did this switch during * EOF (yywrap()) processing, but the only time this flag * is looked at is after yywrap() is called, so it's safe * to go ahead and always set it. */ yyg->yy_did_buffer_switch_on_eof = 1; } static void yy_load_buffer_state (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; yyg->yy_hold_char = *yyg->yy_c_buf_p; } /** Allocate and initialize an input buffer state. * @param file A readable stream. * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. * @param yyscanner The scanner object. * @return the allocated buffer state. */ YY_BUFFER_STATE yy_create_buffer (FILE * file, int size , yyscan_t yyscanner) { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_buf_size = size; /* yy_ch_buf has to be 2 characters longer than the size given because * we need to put in 2 end-of-buffer characters. */ b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 ,yyscanner ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_is_our_buffer = 1; yy_init_buffer(b,file ,yyscanner); return b; } /** Destroy the buffer. * @param b a buffer created with yy_create_buffer() * @param yyscanner The scanner object. */ void yy_delete_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if ( ! b ) return; if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; if ( b->yy_is_our_buffer ) yyfree((void *) b->yy_ch_buf ,yyscanner ); yyfree((void *) b ,yyscanner ); } #ifndef __cplusplus extern int isatty (int ); #endif /* __cplusplus */ /* Initializes or reinitializes a buffer. * This function is sometimes called more than once on the same buffer, * such as during a yyrestart() or at EOF. */ static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file , yyscan_t yyscanner) { int oerrno = errno; struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; yy_flush_buffer(b ,yyscanner); b->yy_input_file = file; b->yy_fill_buffer = 1; /* If b is the current buffer, then yy_init_buffer was _probably_ * called from yyrestart() or through yy_get_next_buffer. * In that case, we don't want to reset the lineno or column. */ if (b != YY_CURRENT_BUFFER){ b->yy_bs_lineno = 1; b->yy_bs_column = 0; } b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; errno = oerrno; } /** Discard all buffered characters. On the next scan, YY_INPUT will be called. * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. * @param yyscanner The scanner object. */ void yy_flush_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if ( ! b ) return; b->yy_n_chars = 0; /* We always need two end-of-buffer characters. The first causes * a transition to the end-of-buffer state. The second causes * a jam in that state. */ b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; b->yy_buf_pos = &b->yy_ch_buf[0]; b->yy_at_bol = 1; b->yy_buffer_status = YY_BUFFER_NEW; if ( b == YY_CURRENT_BUFFER ) yy_load_buffer_state(yyscanner ); } /** Pushes the new state onto the stack. The new state becomes * the current state. This function will allocate the stack * if necessary. * @param new_buffer The new state. * @param yyscanner The scanner object. */ void yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if (new_buffer == NULL) return; yyensure_buffer_stack(yyscanner); /* This block is copied from yy_switch_to_buffer. */ if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *yyg->yy_c_buf_p = yyg->yy_hold_char; YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; } /* Only push if top exists. Otherwise, replace top. */ if (YY_CURRENT_BUFFER) yyg->yy_buffer_stack_top++; YY_CURRENT_BUFFER_LVALUE = new_buffer; /* copied from yy_switch_to_buffer. */ yy_load_buffer_state(yyscanner ); yyg->yy_did_buffer_switch_on_eof = 1; } /** Removes and deletes the top of the stack, if present. * The next element becomes the new top. * @param yyscanner The scanner object. */ void yypop_buffer_state (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if (!YY_CURRENT_BUFFER) return; yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner); YY_CURRENT_BUFFER_LVALUE = NULL; if (yyg->yy_buffer_stack_top > 0) --yyg->yy_buffer_stack_top; if (YY_CURRENT_BUFFER) { yy_load_buffer_state(yyscanner ); yyg->yy_did_buffer_switch_on_eof = 1; } } /* Allocates the stack if it does not exist. * Guarantees space for at least one push. */ static void yyensure_buffer_stack (yyscan_t yyscanner) { int num_to_alloc; struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if (!yyg->yy_buffer_stack) { /* First allocation is just for 2 elements, since we don't know if this * scanner will even need a stack. We use 2 instead of 1 to avoid an * immediate realloc on the next call. */ num_to_alloc = 1; yyg->yy_buffer_stack = (struct yy_buffer_state**)yyalloc (num_to_alloc * sizeof(struct yy_buffer_state*) , yyscanner); if ( ! yyg->yy_buffer_stack ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*)); yyg->yy_buffer_stack_max = num_to_alloc; yyg->yy_buffer_stack_top = 0; return; } if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){ /* Increase the buffer to prepare for a possible push. */ int grow_size = 8 /* arbitrary grow size */; num_to_alloc = yyg->yy_buffer_stack_max + grow_size; yyg->yy_buffer_stack = (struct yy_buffer_state**)yyrealloc (yyg->yy_buffer_stack, num_to_alloc * sizeof(struct yy_buffer_state*) , yyscanner); if ( ! yyg->yy_buffer_stack ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); /* zero only the new slots.*/ memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*)); yyg->yy_buffer_stack_max = num_to_alloc; } } /** Setup the input buffer state to scan directly from a user-specified character buffer. * @param base the character buffer * @param size the size in bytes of the character buffer * @param yyscanner The scanner object. * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size , yyscan_t yyscanner) { YY_BUFFER_STATE b; if ( size < 2 || base[size-2] != YY_END_OF_BUFFER_CHAR || base[size-1] != YY_END_OF_BUFFER_CHAR ) /* They forgot to leave room for the EOB's. */ return 0; b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ b->yy_buf_pos = b->yy_ch_buf = base; b->yy_is_our_buffer = 0; b->yy_input_file = 0; b->yy_n_chars = b->yy_buf_size; b->yy_is_interactive = 0; b->yy_at_bol = 1; b->yy_fill_buffer = 0; b->yy_buffer_status = YY_BUFFER_NEW; yy_switch_to_buffer(b ,yyscanner ); return b; } /** Setup the input buffer state to scan a string. The next call to yylex() will * scan from a @e copy of @a str. * @param yystr a NUL-terminated string to scan * @param yyscanner The scanner object. * @return the newly allocated buffer state object. * @note If you want to scan bytes that may contain NUL values, then use * yy_scan_bytes() instead. */ YY_BUFFER_STATE yy_scan_string (yyconst char * yystr , yyscan_t yyscanner) { return yy_scan_bytes(yystr,strlen(yystr) ,yyscanner); } /** Setup the input buffer state to scan the given bytes. The next call to yylex() will * scan from a @e copy of @a bytes. * @param bytes the byte buffer to scan * @param len the number of bytes in the buffer pointed to by @a bytes. * @param yyscanner The scanner object. * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, int _yybytes_len , yyscan_t yyscanner) { YY_BUFFER_STATE b; char *buf; yy_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = _yybytes_len + 2; buf = (char *) yyalloc(n ,yyscanner ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); for ( i = 0; i < _yybytes_len; ++i ) buf[i] = yybytes[i]; buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; b = yy_scan_buffer(buf,n ,yyscanner); if ( ! b ) YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->yy_is_our_buffer = 1; return b; } #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner) { (void) fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* Redefine yyless() so it works in section 3 code. */ #undef yyless #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ int yyless_macro_arg = (n); \ YY_LESS_LINENO(yyless_macro_arg);\ yytext[yyleng] = yyg->yy_hold_char; \ yyg->yy_c_buf_p = yytext + yyless_macro_arg; \ yyg->yy_hold_char = *yyg->yy_c_buf_p; \ *yyg->yy_c_buf_p = '\0'; \ yyleng = yyless_macro_arg; \ } \ while ( 0 ) /* Accessor methods (get/set functions) to struct members. */ /** Get the user-defined data for this scanner. * @param yyscanner The scanner object. */ YY_EXTRA_TYPE yyget_extra (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; return yyextra; } /** Get the current line number. * @param yyscanner The scanner object. */ int yyget_lineno (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if (! YY_CURRENT_BUFFER) return 0; return yylineno; } /** Get the current column number. * @param yyscanner The scanner object. */ int yyget_column (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if (! YY_CURRENT_BUFFER) return 0; return yycolumn; } /** Get the input stream. * @param yyscanner The scanner object. */ FILE *yyget_in (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; return yyin; } /** Get the output stream. * @param yyscanner The scanner object. */ FILE *yyget_out (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; return yyout; } /** Get the length of the current token. * @param yyscanner The scanner object. */ int yyget_leng (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; return yyleng; } /** Get the current token. * @param yyscanner The scanner object. */ char *yyget_text (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; return yytext; } /** Set the user-defined data. This data is never touched by the scanner. * @param user_defined The data to be associated with this scanner. * @param yyscanner The scanner object. */ void yyset_extra (YY_EXTRA_TYPE user_defined , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; yyextra = user_defined ; } /** Set the current line number. * @param line_number * @param yyscanner The scanner object. */ void yyset_lineno (int line_number , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* lineno is only valid if an input buffer exists. */ if (! YY_CURRENT_BUFFER ) yy_fatal_error( "yyset_lineno called with no buffer" , yyscanner); yylineno = line_number; } /** Set the current column. * @param line_number * @param yyscanner The scanner object. */ void yyset_column (int column_no , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* column is only valid if an input buffer exists. */ if (! YY_CURRENT_BUFFER ) yy_fatal_error( "yyset_column called with no buffer" , yyscanner); yycolumn = column_no; } /** Set the input stream. This does not discard the current * input buffer. * @param in_str A readable stream. * @param yyscanner The scanner object. * @see yy_switch_to_buffer */ void yyset_in (FILE * in_str , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; yyin = in_str ; } void yyset_out (FILE * out_str , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; yyout = out_str ; } int yyget_debug (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; return yy_flex_debug; } void yyset_debug (int bdebug , yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; yy_flex_debug = bdebug ; } /* Accessor methods for yylval and yylloc */ /* User-visible API */ /* yylex_init is special because it creates the scanner itself, so it is * the ONLY reentrant function that doesn't take the scanner as the last argument. * That's why we explicitly handle the declaration, instead of using our macros. */ int yylex_init(yyscan_t* ptr_yy_globals) { if (ptr_yy_globals == NULL){ errno = EINVAL; return 1; } *ptr_yy_globals = (yyscan_t) yyalloc ( sizeof( struct yyguts_t ), NULL ); if (*ptr_yy_globals == NULL){ errno = ENOMEM; return 1; } /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */ memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t)); return yy_init_globals ( *ptr_yy_globals ); } /* yylex_init_extra has the same functionality as yylex_init, but follows the * convention of taking the scanner as the last argument. Note however, that * this is a *pointer* to a scanner, as it will be allocated by this call (and * is the reason, too, why this function also must handle its own declaration). * The user defined value in the first argument will be available to yyalloc in * the yyextra field. */ int yylex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals ) { struct yyguts_t dummy_yyguts; yyset_extra (yy_user_defined, &dummy_yyguts); if (ptr_yy_globals == NULL){ errno = EINVAL; return 1; } *ptr_yy_globals = (yyscan_t) yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts ); if (*ptr_yy_globals == NULL){ errno = ENOMEM; return 1; } /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */ memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t)); yyset_extra (yy_user_defined, *ptr_yy_globals); return yy_init_globals ( *ptr_yy_globals ); } static int yy_init_globals (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* Initialization is the same as for the non-reentrant scanner. * This function is called from yylex_destroy(), so don't allocate here. */ yyg->yy_buffer_stack = 0; yyg->yy_buffer_stack_top = 0; yyg->yy_buffer_stack_max = 0; yyg->yy_c_buf_p = (char *) 0; yyg->yy_init = 0; yyg->yy_start = 0; yyg->yy_start_stack_ptr = 0; yyg->yy_start_stack_depth = 0; yyg->yy_start_stack = NULL; /* Defined in main.c */ #ifdef YY_STDINIT yyin = stdin; yyout = stdout; #else yyin = (FILE *) 0; yyout = (FILE *) 0; #endif /* For future reference: Set errno on error, since we are called by * yylex_init() */ return 0; } /* yylex_destroy is for both reentrant and non-reentrant scanners. */ int yylex_destroy (yyscan_t yyscanner) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* Pop the buffer stack, destroying each element. */ while(YY_CURRENT_BUFFER){ yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner ); YY_CURRENT_BUFFER_LVALUE = NULL; yypop_buffer_state(yyscanner); } /* Destroy the stack itself. */ yyfree(yyg->yy_buffer_stack ,yyscanner); yyg->yy_buffer_stack = NULL; /* Destroy the start condition stack. */ yyfree(yyg->yy_start_stack ,yyscanner ); yyg->yy_start_stack = NULL; /* Reset the globals. This is important in a non-reentrant scanner so the next time * yylex() is called, initialization will occur. */ yy_init_globals( yyscanner); /* Destroy the main struct (reentrant only). */ yyfree ( yyscanner , yyscanner ); yyscanner = NULL; return 0; } /* * Internal utility routines. */ #ifndef yytext_ptr static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner) { register int i; for ( i = 0; i < n; ++i ) s1[i] = s2[i]; } #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner) { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif void *yyalloc (yy_size_t size , yyscan_t yyscanner) { return (void *) malloc( size ); } void *yyrealloc (void * ptr, yy_size_t size , yyscan_t yyscanner) { /* The cast to (char *) in the following accommodates both * implementations that use char* generic pointers, and those * that use void* generic pointers. It works with the latter * because both ANSI C and C++ allow castless assignment from * any pointer type to void*, and deal with argument conversions * as though doing an assignment. */ return (void *) realloc( (char *) ptr, size ); } void yyfree (void * ptr , yyscan_t yyscanner) { free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ } #define YYTABLES_NAME "yytables" #line 121 "sphinxql.l" // warning, lexer generator dependent! // flex inserts trailing zero as needed into the buffer when lexing // but we need that rolled back when doing error reporting from yyerror void yylex_unhold ( yyscan_t yyscanner ) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if ( YY_CURRENT_BUFFER ) { *yyg->yy_c_buf_p = yyg->yy_hold_char; YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; } } #if USE_WINDOWS #pragma warning(pop) #endif coreseek-4.1-beta/csft-4.1/src/Makefile.am100777 0 0 2412 11643565732 13303 0SRC_SPHINX = sphinx.cpp sphinxexcerpt.cpp sphinxquery.cpp \ sphinxsoundex.cpp sphinxmetaphone.cpp sphinxstemen.cpp sphinxstemru.cpp sphinxstemcz.cpp \ sphinxutils.cpp md5.cpp sphinxstd.cpp sphinxsort.cpp sphinxexpr.cpp sphinxfilter.cpp \ sphinxsearch.cpp sphinxrt.cpp if USE_MMSEG SRC_MMSEG = tokenizer_zhcn.cpp endif if USE_PYTHON SRC_PYTHONLAYER = py_helper.cpp py_layer.cpp py_source.cpp endif noinst_LIBRARIES = libsphinx.a libsphinx_a_SOURCES = $(SRC_SPHINX) $(SRC_PYTHONLAYER) $(SRC_MMSEG) bin_PROGRAMS = indexer searchd search spelldump indextool noinst_PROGRAMS = tests indexer_SOURCES = indexer.cpp searchd_SOURCES = searchd.cpp search_SOURCES = search.cpp spelldump_SOURCES = spelldump.cpp indextool_SOURCES = indextool.cpp tests_SOURCES = tests.cpp BUILT_SOURCES = extract-version .PHONY: extract-version extract-version: /bin/sh svnxrev.sh .. if USE_LIBSTEMMER LIBSTEMMER_LIBS = $(top_srcdir)/libstemmer_c/libstemmer.a AM_CPPFLAGS = -I$(top_srcdir)/libstemmer_c/include -DSYSCONFDIR="\"$(sysconfdir)\"" -DDATADIR="\"$(localstatedir)/data\"" else LIBSTEMMER_LIBS = AM_CPPFLAGS = -DSYSCONFDIR="\"$(sysconfdir)\"" -DDATADIR="\"$(localstatedir)/data\"" endif COMMON_LIBS = libsphinx.a $(LIBSTEMMER_LIBS) $(MYSQL_LIBS) $(PGSQL_LIBS) $(MMSEG_LIBS) LDADD = $(COMMON_LIBS) coreseek-4.1-beta/csft-4.1/src/md5.cpp100777 0 0 30150 11643565732 12460 0/* Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved. This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. L. Peter Deutsch ghost@aladdin.com */ /* $Id$ */ /* Independent implementation of MD5 (RFC 1321). This code implements the MD5 Algorithm defined in RFC 1321, whose text is available at http://www.ietf.org/rfc/rfc1321.txt The code is derived from the text of the RFC, including the test suite (section A.5) but excluding the rest of Appendix A. It does not include any code or documentation that is identified in the RFC as being copyrighted. The original and principal author of md5.c is L. Peter Deutsch . Other authors are noted in the change history that follows (in reverse chronological order): 2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order either statically or dynamically; added missing #include in library. 2002-03-11 lpd Corrected argument list for main(), and added int return type, in test program and T value program. 2002-02-21 lpd Added missing #include in test program. 2000-07-03 lpd Patched to eliminate warnings about "constant is unsigned in ANSI C, signed in traditional"; made test program self-checking. 1999-11-04 lpd Edited comments slightly for automatic TOC extraction. 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5). 1999-05-03 lpd Original version. */ #include "md5.h" #include #undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */ #ifdef ARCH_IS_BIG_ENDIAN # define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1) #else # define BYTE_ORDER 0 #endif #define T_MASK ((md5_word_t)~0) #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87) #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9) #define T3 0x242070db #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111) #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050) #define T6 0x4787c62a #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec) #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe) #define T9 0x698098d8 #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850) #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e) #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841) #define T13 0x6b901122 #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c) #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71) #define T16 0x49b40821 #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d) #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf) #define T19 0x265e5a51 #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855) #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2) #define T22 0x02441453 #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e) #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437) #define T25 0x21e1cde6 #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829) #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278) #define T28 0x455a14ed #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa) #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07) #define T31 0x676f02d9 #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375) #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd) #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e) #define T35 0x6d9d6122 #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3) #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb) #define T38 0x4bdecfa9 #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f) #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f) #define T41 0x289b7ec6 #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805) #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a) #define T44 0x04881d05 #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6) #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a) #define T47 0x1fa27cf8 #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a) #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb) #define T50 0x432aff97 #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58) #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6) #define T53 0x655b59c3 #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d) #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82) #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e) #define T57 0x6fa87e4f #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f) #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb) #define T60 0x4e0811a1 #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d) #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca) #define T63 0x2ad7d2bb #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e) static void md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/) { md5_word_t a = pms->abcd[0], b = pms->abcd[1], c = pms->abcd[2], d = pms->abcd[3]; md5_word_t t; #if BYTE_ORDER > 0 /* Define storage only for big-endian CPUs. */ md5_word_t X[16]; #else /* Define storage for little-endian or both types of CPUs. */ md5_word_t xbuf[16]; const md5_word_t *X; #endif { #if BYTE_ORDER == 0 /* * Determine dynamically whether this is a big-endian or * little-endian machine, since we can use a more efficient * algorithm on the latter. */ static const int w = 1; if (*((const md5_byte_t *)&w)) /* dynamic little-endian */ #endif #if BYTE_ORDER <= 0 /* little-endian */ { /* * On little-endian machines, we can process properly aligned * data without copying it. */ if (!((data - (const md5_byte_t *)0) & 3)) { /* data are properly aligned */ X = (const md5_word_t *)data; } else { /* not aligned */ memcpy(xbuf, data, 64); X = xbuf; } } #endif #if BYTE_ORDER == 0 else /* dynamic big-endian */ #endif #if BYTE_ORDER >= 0 /* big-endian */ { /* * On big-endian machines, we must arrange the bytes in the * right order. */ const md5_byte_t *xp = data; int i; # if BYTE_ORDER == 0 X = xbuf; /* (dynamic only) */ # else # define xbuf X /* (static only) */ # endif for (i = 0; i < 16; ++i, xp += 4) xbuf[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24); } #endif } #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n)))) /* Round 1. */ /* Let [abcd k s i] denote the operation a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */ #define F(x, y, z) (((x) & (y)) | (~(x) & (z))) #define SET(a, b, c, d, k, s, Ti)\ t = a + F(b,c,d) + X[k] + Ti;\ a = ROTATE_LEFT(t, s) + b /* Do the following 16 operations. */ SET(a, b, c, d, 0, 7, T1); SET(d, a, b, c, 1, 12, T2); SET(c, d, a, b, 2, 17, T3); SET(b, c, d, a, 3, 22, T4); SET(a, b, c, d, 4, 7, T5); SET(d, a, b, c, 5, 12, T6); SET(c, d, a, b, 6, 17, T7); SET(b, c, d, a, 7, 22, T8); SET(a, b, c, d, 8, 7, T9); SET(d, a, b, c, 9, 12, T10); SET(c, d, a, b, 10, 17, T11); SET(b, c, d, a, 11, 22, T12); SET(a, b, c, d, 12, 7, T13); SET(d, a, b, c, 13, 12, T14); SET(c, d, a, b, 14, 17, T15); SET(b, c, d, a, 15, 22, T16); #undef SET /* Round 2. */ /* Let [abcd k s i] denote the operation a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */ #define G(x, y, z) (((x) & (z)) | ((y) & ~(z))) #define SET(a, b, c, d, k, s, Ti)\ t = a + G(b,c,d) + X[k] + Ti;\ a = ROTATE_LEFT(t, s) + b /* Do the following 16 operations. */ SET(a, b, c, d, 1, 5, T17); SET(d, a, b, c, 6, 9, T18); SET(c, d, a, b, 11, 14, T19); SET(b, c, d, a, 0, 20, T20); SET(a, b, c, d, 5, 5, T21); SET(d, a, b, c, 10, 9, T22); SET(c, d, a, b, 15, 14, T23); SET(b, c, d, a, 4, 20, T24); SET(a, b, c, d, 9, 5, T25); SET(d, a, b, c, 14, 9, T26); SET(c, d, a, b, 3, 14, T27); SET(b, c, d, a, 8, 20, T28); SET(a, b, c, d, 13, 5, T29); SET(d, a, b, c, 2, 9, T30); SET(c, d, a, b, 7, 14, T31); SET(b, c, d, a, 12, 20, T32); #undef SET /* Round 3. */ /* Let [abcd k s t] denote the operation a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */ #define H(x, y, z) ((x) ^ (y) ^ (z)) #define SET(a, b, c, d, k, s, Ti)\ t = a + H(b,c,d) + X[k] + Ti;\ a = ROTATE_LEFT(t, s) + b /* Do the following 16 operations. */ SET(a, b, c, d, 5, 4, T33); SET(d, a, b, c, 8, 11, T34); SET(c, d, a, b, 11, 16, T35); SET(b, c, d, a, 14, 23, T36); SET(a, b, c, d, 1, 4, T37); SET(d, a, b, c, 4, 11, T38); SET(c, d, a, b, 7, 16, T39); SET(b, c, d, a, 10, 23, T40); SET(a, b, c, d, 13, 4, T41); SET(d, a, b, c, 0, 11, T42); SET(c, d, a, b, 3, 16, T43); SET(b, c, d, a, 6, 23, T44); SET(a, b, c, d, 9, 4, T45); SET(d, a, b, c, 12, 11, T46); SET(c, d, a, b, 15, 16, T47); SET(b, c, d, a, 2, 23, T48); #undef SET /* Round 4. */ /* Let [abcd k s t] denote the operation a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */ #define I(x, y, z) ((y) ^ ((x) | ~(z))) #define SET(a, b, c, d, k, s, Ti)\ t = a + I(b,c,d) + X[k] + Ti;\ a = ROTATE_LEFT(t, s) + b /* Do the following 16 operations. */ SET(a, b, c, d, 0, 6, T49); SET(d, a, b, c, 7, 10, T50); SET(c, d, a, b, 14, 15, T51); SET(b, c, d, a, 5, 21, T52); SET(a, b, c, d, 12, 6, T53); SET(d, a, b, c, 3, 10, T54); SET(c, d, a, b, 10, 15, T55); SET(b, c, d, a, 1, 21, T56); SET(a, b, c, d, 8, 6, T57); SET(d, a, b, c, 15, 10, T58); SET(c, d, a, b, 6, 15, T59); SET(b, c, d, a, 13, 21, T60); SET(a, b, c, d, 4, 6, T61); SET(d, a, b, c, 11, 10, T62); SET(c, d, a, b, 2, 15, T63); SET(b, c, d, a, 9, 21, T64); #undef SET /* Then perform the following additions. (That is increment each of the four registers by the value it had before this block was started.) */ pms->abcd[0] += a; pms->abcd[1] += b; pms->abcd[2] += c; pms->abcd[3] += d; } void md5_init(md5_state_t *pms) { pms->count[0] = pms->count[1] = 0; pms->abcd[0] = 0x67452301; pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476; pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301; pms->abcd[3] = 0x10325476; } void md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes) { const md5_byte_t *p = data; int left = nbytes; int offset = (pms->count[0] >> 3) & 63; md5_word_t nbits = (md5_word_t)(nbytes << 3); if (nbytes <= 0) return; /* Update the message length. */ pms->count[1] += nbytes >> 29; pms->count[0] += nbits; if (pms->count[0] < nbits) pms->count[1]++; /* Process an initial partial block. */ if (offset) { int copy = (offset + nbytes > 64 ? 64 - offset : nbytes); memcpy(pms->buf + offset, p, copy); if (offset + copy < 64) return; p += copy; left -= copy; md5_process(pms, pms->buf); } /* Process full blocks. */ for (; left >= 64; p += 64, left -= 64) md5_process(pms, p); /* Process a final partial block. */ if (left) memcpy(pms->buf, p, left); } void md5_finish(md5_state_t *pms, md5_byte_t digest[16]) { static const md5_byte_t pad[64] = { 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; md5_byte_t data[8]; int i; /* Save the length before padding. */ for (i = 0; i < 8; ++i) data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3)); /* Pad to 56 bytes mod 64. */ md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1); /* Append the length. */ md5_append(pms, data, 8); for (i = 0; i < 16; ++i) digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3)); } coreseek-4.1-beta/csft-4.1/src/md5.h100777 0 0 6426 11643565732 12116 0/* Copyright (C) 1999, 2002 Aladdin Enterprises. All rights reserved. This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. L. Peter Deutsch ghost@aladdin.com */ /* $Id$ */ /* Independent implementation of MD5 (RFC 1321). This code implements the MD5 Algorithm defined in RFC 1321, whose text is available at http://www.ietf.org/rfc/rfc1321.txt The code is derived from the text of the RFC, including the test suite (section A.5) but excluding the rest of Appendix A. It does not include any code or documentation that is identified in the RFC as being copyrighted. The original and principal author of md5.h is L. Peter Deutsch . Other authors are noted in the change history that follows (in reverse chronological order): 2002-04-13 lpd Removed support for non-ANSI compilers; removed references to Ghostscript; clarified derivation from RFC 1321; now handles byte order either statically or dynamically. 1999-11-04 lpd Edited comments slightly for automatic TOC extraction. 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5); added conditionalization for C++ compilation from Martin Purschke . 1999-05-03 lpd Original version. */ #ifndef md5_INCLUDED # define md5_INCLUDED /* * This package supports both compile-time and run-time determination of CPU * byte order. If ARCH_IS_BIG_ENDIAN is defined as 0, the code will be * compiled to run only on little-endian CPUs; if ARCH_IS_BIG_ENDIAN is * defined as non-zero, the code will be compiled to run only on big-endian * CPUs; if ARCH_IS_BIG_ENDIAN is not defined, the code will be compiled to * run on either big- or little-endian CPUs, but will run slightly less * efficiently on either one than if ARCH_IS_BIG_ENDIAN is defined. */ typedef unsigned char md5_byte_t; /* 8-bit byte */ typedef unsigned int md5_word_t; /* 32-bit word */ /* Define the state of the MD5 Algorithm. */ typedef struct md5_state_s { md5_word_t count[2]; /* message length in bits, lsw first */ md5_word_t abcd[4]; /* digest buffer */ md5_byte_t buf[64]; /* accumulate block */ } md5_state_t; #ifdef __cplusplus extern "C" { #endif /* Initialize the algorithm. */ void md5_init(md5_state_t *pms); /* Append a string to the message. */ void md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes); /* Finish the message and return the digest. */ void md5_finish(md5_state_t *pms, md5_byte_t digest[16]); #ifdef __cplusplus } /* end extern "C" */ #endif #endif /* md5_INCLUDED */ coreseek-4.1-beta/csft-4.1/src/py_helper.cpp100777 0 0 43106 11643565732 13767 0#ifdef _WIN32 #pragma warning(disable:4996) #endif #include "sphinx.h" #include "sphinxutils.h" //#include "sphinx_internal.h" #include "sphinxsearch.h" #include "py_layer.h" #include "sphinxquery.h" #include "sphinxint.h" #include "py_helper.h" #include "py_source.h" //py-layer HITMAN, -> change it if sphinx.cpp changed. typedef Hitman_c<8> HITMAN; #if USE_PYTHON #define RET_PYNONE { Py_INCREF(Py_None); return Py_None; } PyObject * PyLowercaser_Helper_ToLower(PyObject *, PyObject* args) ; int Lowercaser_Helper::ToLower(int iCode) { if(m_lower) { return m_lower->ToLower(iCode); } return 0; } static PyMethodDef Helper_methods[] = { //{"Numbers", Example_new_Numbers, METH_VARARGS}, {"toLower", PyLowercaser_Helper_ToLower, METH_VARARGS}, {NULL, NULL} }; typedef struct { PyObject_HEAD /* Type-specific fields go here. */ CSphLowercaser* m_Lower; } csfHelper_ToLowerObject; static PyTypeObject csfHelper_ToLowerType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "csfHelper.ToLower", /*tp_name*/ sizeof(csfHelper_ToLowerObject), /*tp_basicsize*/ 0, /*tp_itemsize*/ 0, /*tp_dealloc*/ 0, /*tp_print*/ 0, /*tp_getattr*/ 0, /*tp_setattr*/ 0, /*tp_compare*/ 0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ 0, /*tp_hash */ 0, /*tp_call*/ 0, /*tp_str*/ 0, /*tp_getattro*/ 0, /*tp_setattro*/ 0, /*tp_as_buffer*/ Py_TPFLAGS_DEFAULT, /*tp_flags*/ "ToLower Helper", /* tp_doc */ 0, /*tp_traverse*/ 0, /*tp_clear*/ 0, /*tp_richcompare*/ 0, /*tp_weaklistoffset*/ 0, /*tp_iter*/ 0, /*tp_iternext*/ Helper_methods, /*tp_methods*/ 0, /*tp_members*/ 0, /*tp_getset*/ 0, /*tp_base*/ 0, /*tp_dict*/ 0, /*tp_descr_get*/ 0, /*tp_descr_set*/ 0, /*tp_dictoffset*/ 0, /*tp_init*/ 0, /*tp_alloc*/ 0, /*tp_new*/ 0, /*tp_free*/ 0, /*tp_is_gc*/ 0, /*tp_bases*/ 0, /*tp_mro*/ 0, /*tp_cache*/ 0, /*tp_subclasses*/ 0, /*tp_weaklist*/ }; //PyObject *PyNewLowercaser_Helper(PyObject *, PyObject* args) PyObject *PyNewLowercaser_Helper(CSphLowercaser* aLower) { if(!aLower) return NULL; csfHelper_ToLowerObject *self; self = (csfHelper_ToLowerObject *)PyType_GenericNew(&csfHelper_ToLowerType, NULL, NULL); self->m_Lower = aLower; return (PyObject*)self; } PyObject * PyLowercaser_Helper_ToLower(PyObject * self, PyObject* args) { int arg1; int ok = PyArg_ParseTuple( args, "i", &arg1); if(!ok) { if(PyErr_Occurred()) { PyErr_Print(); PyErr_Clear(); } RET_PYNONE; } csfHelper_ToLowerObject *self2 = (csfHelper_ToLowerObject *)self; //PyObject* instance = PyObject_GetAttrString(self, "__c_lower"); if(self2) { int result = self2->m_Lower->ToLower(arg1); return Py_BuildValue("i",result); } return Py_BuildValue("i",0); } ////////////////////////////////////////////////////////////////////////// typedef struct { PyObject_HEAD /* Type-specific fields go here. */ CSphSource_Python* m_Document; //only PySource is supported for the leak support of setField in other documents } csfHelper_DocumentObject; PyObject * PyDocument_Helper_SetAttr(PyObject * self, PyObject* args) { char* key = NULL; PyObject* pV = NULL; int ok = PyArg_ParseTuple( args, "sO", &key, &pV); //not inc the value refer if(!ok) return NULL; csfHelper_DocumentObject *self2 = (csfHelper_DocumentObject *)self; if(self2) { int nRet = self2->m_Document->SetAttr(key, pV); return Py_BuildValue("i",nRet); } return NULL; } PyObject * PyDocument_Helper_GetAttr(PyObject * self, PyObject* args) { char* key = NULL; int ok = PyArg_ParseTuple( args, "s", &key); if(!ok) return NULL; csfHelper_DocumentObject *self2 = (csfHelper_DocumentObject *)self; if(self2) { return self2->m_Document->GetAttr(key); } return NULL; } static PyMethodDef PyDocument_Helper_methods[] = { //{"Numbers", Example_new_Numbers, METH_VARARGS}, {"SetAttr", PyDocument_Helper_SetAttr, METH_VARARGS}, {"GetAttr", PyDocument_Helper_GetAttr, METH_VARARGS}, {NULL, NULL} }; static PyTypeObject csfHelper_DocumentType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "csfHelper.Document", /*tp_name*/ sizeof(csfHelper_DocumentObject), /*tp_basicsize*/ 0, /*tp_itemsize*/ 0, /*tp_dealloc*/ 0, /*tp_print*/ 0, /*tp_getattr*/ 0, /*tp_setattr*/ 0, /*tp_compare*/ 0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ 0, /*tp_hash */ 0, /*tp_call*/ 0, /*tp_str*/ 0, /*tp_getattro*/ 0, /*tp_setattro*/ 0, /*tp_as_buffer*/ Py_TPFLAGS_DEFAULT, /*tp_flags*/ "Document Helper", /* tp_doc */ 0, /*tp_traverse*/ 0, /*tp_clear*/ 0, /*tp_richcompare*/ 0, /*tp_weaklistoffset*/ 0, /*tp_iter*/ 0, /*tp_iternext*/ PyDocument_Helper_methods, /*tp_methods*/ 0, /*tp_members*/ 0, /*tp_getset*/ 0, /*tp_base*/ 0, /*tp_dict*/ 0, /*tp_descr_get*/ 0, /*tp_descr_set*/ 0, /*tp_dictoffset*/ 0, /*tp_init*/ 0, /*tp_alloc*/ 0, /*tp_new*/ 0, /*tp_free*/ 0, /*tp_is_gc*/ 0, /*tp_bases*/ 0, /*tp_mro*/ 0, /*tp_cache*/ 0, /*tp_subclasses*/ 0, /*tp_weaklist*/ }; PyObject *PyNewDocument_Helper( CSphSource* pSource) { if(!pSource) return NULL; CSphSource_Python* pPySource = dynamic_cast(pSource); if(!pPySource) return NULL; csfHelper_DocumentObject *self; self = (csfHelper_DocumentObject *)PyType_GenericNew(&csfHelper_DocumentType, NULL, NULL); self->m_Document = pPySource; return (PyObject*)self; } PyObject * PyHit_Push(PyObject * pSelf, PyObject* args, PyObject* kwargs); PyObject * PyHit_PushWord(PyObject * pSelf, PyObject* args, PyObject* kwargs); PyObject * PyHit_GetWordID(PyObject * pSelf, PyObject* args, PyObject* kwargs); PyObject * PyHit_GetFieldName(PyObject *, PyObject* args); PyObject * PyHit_GetFieldID(PyObject *, PyObject* args); PyObject * PyHit_GetCurPos(PyObject *, PyObject* args); PyObject * PyHit_GetCurPhraseID(PyObject *, PyObject* args); static PyMethodDef HitCollector_methods[] = { {"getFieldName", PyHit_GetFieldName, METH_VARARGS}, {"getFieldID", PyHit_GetFieldID, METH_VARARGS}, {"getCurrentPos", PyHit_GetCurPos, METH_VARARGS}, {"getCurrentPhraseID", PyHit_GetCurPhraseID, METH_VARARGS}, {"push", (PyCFunction)PyHit_Push, METH_VARARGS|METH_KEYWORDS}, {"pushWord", (PyCFunction)PyHit_PushWord, METH_VARARGS|METH_KEYWORDS}, {"wordID", (PyCFunction)PyHit_GetWordID, METH_VARARGS|METH_KEYWORDS}, {NULL, NULL} }; static void PyHit_dealloc(csfHelper_HitCollectorObject* self); static PyObject * PyHit_new(PyTypeObject *type, PyObject *args, PyObject *kwds); static int PyHit_clear(csfHelper_HitCollectorObject *self); static int PyHit_traverse(csfHelper_HitCollectorObject *self, visitproc visit, void *arg); static PyTypeObject csfHelper_HitCollectorType = { PyObject_HEAD_INIT(NULL) 0, /*ob_size*/ "csfHelper.HitCollector", /*tp_name*/ sizeof(csfHelper_HitCollectorObject), /*tp_basicsize*/ 0, /*tp_itemsize*/ (destructor)PyHit_dealloc, /*tp_dealloc*/ 0, /*tp_print*/ 0, /*tp_getattr*/ 0, /*tp_setattr*/ 0, /*tp_compare*/ 0, /*tp_repr*/ 0, /*tp_as_number*/ 0, /*tp_as_sequence*/ 0, /*tp_as_mapping*/ 0, /*tp_hash */ 0, /*tp_call*/ 0, /*tp_str*/ 0, /*tp_getattro*/ 0, /*tp_setattro*/ 0, /*tp_as_buffer*/ Py_TPFLAGS_DEFAULT, // | Py_TPFLAGS_HAVE_GC, /*tp_flags*/ "Hits Collector", /* tp_doc */ (traverseproc)PyHit_traverse, /*tp_traverse*/ (inquiry)PyHit_clear, /*tp_clear*/ 0, /*tp_richcompare*/ 0, /*tp_weaklistoffset*/ 0, /*tp_iter*/ 0, /*tp_iternext*/ HitCollector_methods, /*tp_methods*/ 0, /*tp_members*/ 0, /*tp_getset*/ 0, /*tp_base*/ 0, /*tp_dict*/ 0, /*tp_descr_get*/ 0, /*tp_descr_set*/ 0, /*tp_dictoffset*/ 0, /*tp_init*/ 0, /*tp_alloc*/ 0, //(newfunc)PyHit_new, /*tp_new*/ 0, /*tp_free*/ 0, /*tp_is_gc*/ 0, /*tp_bases*/ 0, /*tp_mro*/ 0, /*tp_cache*/ 0, /*tp_subclasses*/ 0, /*tp_weaklist*/ }; ////////////////////////////////////////////////////////////////////////// static PyObject * PyHit_new(PyTypeObject *type, PyObject *args, PyObject *kwds) { csfHelper_HitCollectorObject *x; x = (csfHelper_HitCollectorObject *)PyType_GenericNew(type, args, kwds); if (x == NULL) return NULL; //x->p_status = UNSAVED; //x->p_serial = Integer_FromLong(0L); //if (x->p_serial == NULL) // return NULL; //x->p_connection = Py_None; //Py_INCREF(x->p_connection); //x->p_oid = Py_None; //Py_INCREF(x->p_oid); return (PyObject *)x; } void AddHit(csfHelper_HitCollectorObject *self, SphWordID_t iWordID, int iPos, int iPhrase) { // copy from AddHitFor. // TODO: append iPhrase here? if ( !iWordID ) return; self->m_pSource->AddHit( self->m_pSource->m_tDocInfo.m_iDocID, iWordID, iPos); } // static void PyHit_dealloc(csfHelper_HitCollectorObject* self) static void PyHit_dealloc(csfHelper_HitCollectorObject *self) { /* PyObject_GC_UnTrack(self); Py_TRASHCAN_SAFE_BEGIN(self); //Py_XDECREF(self->p_connection); //Py_XDECREF(self->p_oid); //Py_XDECREF(self->p_serial); PyObject_GC_Del(self); Py_TRASHCAN_SAFE_END(self); */ if(self->m_FieldName) { delete self->m_FieldName; self->m_FieldName = NULL; } if(self->m_tSchema) delete self->m_tSchema; self->m_tSchema = NULL; // i've no source. self->ob_type->tp_free((PyObject *)self); } static int PyHit_traverse(csfHelper_HitCollectorObject *self, visitproc visit, void *arg) { //Py_VISIT(self->p_connection); //Py_VISIT(self->p_oid); //Py_VISIT(self->p_serial); return 0; } static int PyHit_clear(csfHelper_HitCollectorObject *self) { //Py_CLEAR(self->p_connection); //Py_CLEAR(self->p_oid); //Py_CLEAR(self->p_serial); return 0; } PyObject * PyHit_Push(PyObject * pSelf, PyObject* args, PyObject* kwargs) { //int iPos = HIT_PACK ( iField, iStartPos ); csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)pSelf; static char *kwlist[] = {"wordid", "pos", "phrase", "fieldindex", NULL}; SphWordID_t iWord; int iPos = -1; int iPhrase = -1; int iField = -1; #if USE_64BIT int ok = PyArg_ParseTupleAndKeywords( args, kwargs, "K|iii", kwlist, &iWord, #else int ok = PyArg_ParseTupleAndKeywords( args, kwargs, "k|iii", kwlist, &iWord, #endif &iPos , &iPhrase, &iField ); //not inc the value refer if(!ok) { if(PyErr_Occurred()) { PyErr_Print(); //PyErr_Clear(); } return NULL; } if(iPos < 1 ) iPos = -1; // 0 and < is invalid. if(iPhrase <1) iPhrase = -1; // fast setting if(!iWord) { if(iPos != -1) self->iPos = iPos; if(iPhrase == -1) self->iPhrase = iPhrase; //refresh iPos RET_PYNONE; } // push hit if(iPos == -1) iPos = self->iPos; else { if(iField == -1) self->iPos = iPos; //refresh iPos } // no more than 24, if greater than 24, just leave field as current. if(iField > SPH_MAX_FIELDS || iField < 0) iField = -1; if(iPhrase == -1) iPhrase = self->iPhrase; else { if(iField == -1) self->iPhrase = iPhrase; //refresh iPos } if(iField == -1) iField = self->iField; //NO, NO, u can NOT change field via a filled parameters' pushWord call... { iPos = HITMAN::Create(iField, iPos); AddHit(self, iWord, iPos, iPhrase); self->iPos++ ; } RET_PYNONE; } PyObject * PyHit_PushWord(PyObject * pSelf, PyObject* args, PyObject* kwargs) { /* = You can change the iPos & iPhrase setting without add a real hit by push a Empty word(""). @param: - pos: - phrase: */ csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)pSelf; static char *kwlist[] = {"word", "pos", "phrase", "fieldindex", NULL}; const char* sWord = NULL; int iPos = -1; int iPhrase = -1; int iField = -1; int ok = PyArg_ParseTupleAndKeywords( args, kwargs, "z|iii", kwlist, &sWord, &iPos , &iPhrase, &iField ); //not inc the value refer if(!ok) { if(PyErr_Occurred()) { PyErr_Print(); PyErr_Clear(); } return NULL; } if(iPos < 1 ) iPos = -1; // 0 and < is invalid. if(iPhrase <1) iPhrase = -1; //fast setting if(!sWord) { if(iPos != -1) self->iPos = iPos; if(iPhrase == -1) self->iPhrase = iPhrase; //refresh iPos RET_PYNONE; } if(iPos == -1) iPos = self->iPos; else { if(iField == -1) self->iPos = iPos; //refresh iPos } // no more than 24, if greater than 24, just leave field as current. if(iField > SPH_MAX_FIELDS || iField < 0) iField = -1; if(iPhrase == -1) iPhrase = self->iPhrase; else { if(iField == -1) self->iPhrase = iPhrase; //refresh iPos } if(iField == -1) iField = self->iField; //NO, NO, u can NOT change field via a filled parameters' pushWord call... { CSphSource_Python* pPySource = dynamic_cast(self->m_pSource); BYTE sBuf [ 16+3*SPH_MAX_WORD_LEN + 1024 ]; if(pPySource){ CSphDict* pDict = pPySource->GetDict(); bool bWordDict = pDict->GetSettings().m_bWordDict; bool bGlobalPartialMatch = !bWordDict && ( pPySource->m_iMinPrefixLen > 0 || pPySource->m_iMinInfixLen > 0 ); { SphWordID_t iWord = pDict->GetWordID ((BYTE*) sWord ); iPos = HITMAN::Create(iField, iPos); AddHit(self, iWord, iPos, iPhrase); } if ( bGlobalPartialMatch ) { int iBytes = strlen ( (const char*)sWord ); memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD; sBuf[iBytes+1] = '\0'; AddHit(self, pDict->GetWordIDWithMarkers ( sBuf ), iPos, iPhrase); } if ( pPySource->m_bIndexExactWords ) { int iBytes = strlen ( (const char*)sWord ); memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD_NONSTEMMED; sBuf[iBytes+1] = '\0'; AddHit(self, pDict->GetWordIDNonStemmed ( sBuf ), iPos, iPhrase); } self->iPos++ ; } } RET_PYNONE; } PyObject * PyHit_GetFieldID(PyObject * pSelf, PyObject* args) { csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)pSelf; const char* key = NULL; int ok = PyArg_ParseTuple( args, "s", &key); if(!ok) { return NULL; } int idx = self->m_tSchema->GetFieldIndex(key); return PyInt_FromLong(idx); } PyObject * PyHit_GetWordID(PyObject * pSelf, PyObject* args, PyObject* kwargs) { /* @param: - Exact: - Steam: - ID with Marker: */ csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)pSelf; static char *kwlist[] = {"word", "exact", "steam", "idmarker", NULL }; char* sWord = NULL; unsigned char bExact = 1; unsigned char bSteam = 0; unsigned char bIdMarker = 0; int ok = PyArg_ParseTupleAndKeywords( args, kwargs, "s|BBB", kwlist, &sWord, &bExact , &bSteam, &bIdMarker ); //not inc the value refer if(!ok) { if(PyErr_Occurred()) { PyErr_Print(); PyErr_Clear(); } return NULL; } { CSphSource_Python* pPySource = dynamic_cast(self->m_pSource); CSphDict* pDict = pPySource->GetDict(); SphWordID_t iWord = 0; BYTE sBuf [ 16+3*SPH_MAX_WORD_LEN + 1024 ]; //user's input term might be very long.... size_t iBytes = strlen ( (const char*)sWord ); if ( bExact ) { size_t iBytes = strlen ( (const char*)sWord ); memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD_NONSTEMMED; sBuf[iBytes+1] = '\0'; iWord = pDict->GetWordIDNonStemmed ( sBuf ); } else if (bIdMarker) { memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD; sBuf[iBytes+1] = '\0'; iWord = pDict->GetWordIDWithMarkers ( sBuf ) ; } else { iWord = pDict->GetWordID ((BYTE*) sWord ); } if(!iWord) RET_PYNONE; #if USE_64BIT return PyLong_FromUnsignedLongLong(iWord); #else return PyLong_FromUnsignedLong(iWord); #endif } } PyObject * PyHit_GetFieldName(PyObject * pSelf, PyObject* ) { csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)pSelf; return PyString_FromString(self->m_FieldName->cstr()); } PyObject * PyHit_GetCurPos(PyObject * pSelf, PyObject* ) { csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)pSelf; return PyInt_FromLong(self->iPos); } PyObject * PyHit_GetCurPhraseID(PyObject * pSelf, PyObject* ) { csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)pSelf; return PyInt_FromLong(self->iPhrase); } ////////////////////////////////////////////////////////////////////////// PyObject *PyNewHitCollector(CSphSource* pSource, const CSphString & aFieldName, int iField) { if(!pSource) RET_PYNONE; CSphSource_Python* pPySource = dynamic_cast(pSource); if(!pPySource) RET_PYNONE; csfHelper_HitCollectorObject *self; self = (csfHelper_HitCollectorObject *)PyType_GenericNew(&csfHelper_HitCollectorType, NULL, NULL); //self = PyObject_New(csfHelper_HitCollectorObject, &csfHelper_HitCollectorType); self->m_tSchema = new CSphSchema(); self->m_FieldName = new CSphString(); self->iPhrase = 1; self->iPos = 1; //all pos started with 1. *(self->m_FieldName) = aFieldName; self->m_pSource = pPySource; CSphString sError; pPySource->UpdateSchema(self->m_tSchema, sError); self->iField = iField; return (PyObject*)self; } PyMODINIT_FUNC initCsfHelper (void) { int nRet = 0; /* csfHelper_ToLowerType.tp_new = PyType_GenericNew; if (PyType_Ready(&csfHelper_ToLowerType) < 0) return; csfHelper_DocumentType.tp_new = PyType_GenericNew; if (PyType_Ready(&csfHelper_DocumentType) < 0) return; */ csfHelper_HitCollectorType.tp_new = PyType_GenericNew; if (PyType_Ready(&csfHelper_HitCollectorType) < 0) return; Py_INCREF(&csfHelper_HitCollectorType); PyObject* m = Py_InitModule("csfHelper", Helper_methods); //nRet = PyModule_AddObject(m, "ToLower", (PyObject *)&csfHelper_ToLowerType); //nRet = PyModule_AddObject(m, "Document", (PyObject *)&csfHelper_DocumentType); nRet = PyModule_AddObject(m, "HitCollector", (PyObject *)&csfHelper_HitCollectorType); } PyMODINIT_FUNC initCsfHelperWithModule (PyObject* m) { csfHelper_HitCollectorType.tp_new = PyType_GenericNew; if (PyType_Ready(&csfHelper_HitCollectorType) < 0) return; Py_INCREF(&csfHelper_HitCollectorType); int nRet = 0; nRet = PyModule_AddObject(m, "HitCollector", (PyObject *)&csfHelper_HitCollectorType); } #endif //USE_PYTHON coreseek-4.1-beta/csft-4.1/src/py_helper.h100777 0 0 1271 11643565732 13411 0#ifndef _PY_HELPER_H_ #define _PY_HELPER_H_ #include "sphinx.h" #include "py_layer.h" #if USE_PYTHON ////////////////////////////////////////////////////////////////////////// class Lowercaser_Helper { public: Lowercaser_Helper() :m_lower(NULL) {} int ToLower ( int iCode ); //FIXME: append other functions here. protected: CSphLowercaser* m_lower; }; PyObject *PyNewLowercaser_Helper(CSphLowercaser* aLower); PyObject *PyNewDocument_Helper( CSphSource* pSource); PyObject *PyNewHitCollector(CSphSource* pSource, const CSphString & aFieldName, int iField); PyMODINIT_FUNC initCsfHelper (void); PyMODINIT_FUNC initCsfHelperWithModule (PyObject* m); #endif //USE_PYTHON #endif coreseek-4.1-beta/csft-4.1/src/py_layer.cpp100777 0 0 6720 11643565732 13605 0#ifdef _WIN32 #pragma warning(disable:4996) #pragma warning(disable:4127) #endif #include "sphinx.h" #include "sphinxutils.h" #include "py_layer.h" #include "py_source.h" #include "py_helper.h" #if USE_PYTHON #define LOC_CHECK(_hash,_key,_msg,_add) \ if (!( _hash.Exists ( _key ) )) \ { \ fprintf ( stdout, "ERROR: key '%s' not found " _msg "\n", _key, _add ); \ return false; \ } CSphSource * SpawnSourcePython ( const CSphConfigSection & hSource, const char * sSourceName) { assert ( hSource["type"]=="python" ); LOC_CHECK ( hSource, "name", "in source '%s'.", sSourceName ); CSphSource * pSrcPython = NULL; CSphSource_Python * pPySource = new CSphSource_Python ( sSourceName ); if ( !pPySource->Setup ( hSource ) ) { if(pPySource->m_sError.Length()) fprintf ( stdout, "ERROR: %s\n", pPySource->m_sError.cstr()); SafeDelete ( pPySource ); } pSrcPython = pPySource; return pSrcPython; } ////////////////////////////////////////////////////////////////////////// // get array of strings #define LOC_GETAS(_sec, _arg,_key) \ for ( CSphVariant * pVal = _sec(_key); pVal; pVal = pVal->m_pNext ) \ _arg.Add ( pVal->cstr() ); // helper functions #if USE_PYTHON int init_python_layer_helpers() { int nRet = 0; nRet = PyRun_SimpleString("import sys\nimport os\n"); if(nRet) return nRet; //helper function to append path to env. nRet = PyRun_SimpleString("\n\ def __coreseek_set_python_path(sPath):\n\ sPaths = [x.lower() for x in sys.path]\n\ sPath = os.path.abspath(sPath)\n\ if sPath not in sPaths:\n\ sys.path.append(sPath)\n\ #print sPaths\n\ \n"); if(nRet) return nRet; // helper function to find data source nRet = PyRun_SimpleString("\n\ def __coreseek_find_pysource(sName): \n\ pos = sName.find('.') \n\ module_name = sName[:pos]\n\ try:\n\ exec ('%s=__import__(\"%s\")' % (module_name, module_name))\n\ return eval(sName)\n\ except ImportError, e:\n\ print e\n\ return None\n\ \n"); return nRet; } #endif bool cftInitialize( const CSphConfigSection & hPython) { #if USE_PYTHON if (!Py_IsInitialized()) { Py_Initialize(); //PyEval_InitThreads(); if (!Py_IsInitialized()) { return false; } int nRet = init_python_layer_helpers(); if(nRet != 0) { PyErr_Print(); PyErr_Clear(); return false; } } //init paths PyObject * main_module = NULL; //try //to disable -GX { CSphVector m_dPyPaths; LOC_GETAS(hPython, m_dPyPaths, "path"); ///XXX: append system pre-defined path here. { main_module = PyImport_AddModule("__main__"); //+1 //init paths PyObject* pFunc = PyObject_GetAttrString(main_module, "__coreseek_set_python_path"); if(pFunc && PyCallable_Check(pFunc)){ ARRAY_FOREACH ( i, m_dPyPaths ) { PyObject* pArgsKey = Py_BuildValue("(s)",m_dPyPaths[i].cstr() ); PyObject* pResult = PyEval_CallObject(pFunc, pArgsKey); Py_XDECREF(pArgsKey); Py_XDECREF(pResult); } } // end if if (pFunc) Py_XDECREF(pFunc); //Py_XDECREF(main_module); //no needs to decrease refer to __main__ module, else will got a crash! } }/* catch (...) { PyErr_Print(); PyErr_Clear(); //is function can be undefined Py_XDECREF(main_module); return false; }*/ ///XXX: hook the ext interface here. initCsfHelper(); //the Csf return true; #endif } void cftShutdown() { #if USE_PYTHON //FIXME: avoid the debug warning. if (Py_IsInitialized()) { //to avoid crash in release mode. Py_Finalize(); } #endif } #endif //USE_PYTHON coreseek-4.1-beta/csft-4.1/src/py_layer.h100777 0 0 1455 11643565732 13252 0#ifndef _PY_LAYER_H_ #define _PY_LAYER_H_ #include "sphinx.h" #if USE_PYTHON #if USE_PYTHON_DEBUG #include #else #ifdef _DEBUG #define D_E_B_U_G #undef _DEBUG #endif #include #ifdef D_E_B_U_G #undef D_E_B_U_G #define _DEBUG #endif #endif //USE_PYTHON_DEBUG ////////////////////////////////////////////////////////////////////////// bool cftInitialize( const CSphConfigSection & hPython); void cftShutdown(); CSphSource * SpawnSourcePython ( const CSphConfigSection & hSource, const char * sSourceName); typedef struct { PyObject_HEAD /* Type-specific fields go here. */ CSphSource* m_pSource; CSphSchema* m_tSchema; CSphString* m_FieldName; int iPos; int iPhrase; int iField; } csfHelper_HitCollectorObject; #endif //USE_PYTHON #endif coreseek-4.1-beta/csft-4.1/src/py_source.cpp100777 0 0 154136 11643565732 14036 0#ifdef _WIN32 #pragma warning(disable:4996) #pragma warning(disable:4127) #endif #include "sphinx.h" #include "sphinxutils.h" //#include "sphinx_internal.h" #include "py_helper.h" #include "py_source.h" #include "sphinxsearch.h" //py-layer HITMAN, -> change it if sphinx.cpp changed. typedef Hitman_c<8> HITMAN; //just copy from sphinx.cpp #define SPH_INTERNAL_PROFILER 0 #if SPH_INTERNAL_PROFILER enum ESphTimer { TIMER_root = 0, #define DECLARE_TIMER(_arg) TIMER_##_arg, #include "sphinxtimers.h" #undef DECLARE_TIMER TIMERS_TOTAL }; static const char * const g_dTimerNames [ TIMERS_TOTAL ] = { "root", #define DECLARE_TIMER(_arg) #_arg, #include "sphinxtimers.h" #undef DECLARE_TIMER }; struct CSphTimer { int64_t m_iMicroSec; ESphTimer m_eTimer; int m_iParent; int m_iChild; int m_iNext; int m_iPrev; int m_iCalls; CSphTimer () { Alloc ( TIMER_root, -1 ); } void Alloc ( ESphTimer eTimer, int iParent ) { m_iParent = iParent; m_iChild = -1; m_iNext = -1; m_iPrev = -1; m_eTimer = eTimer; m_iMicroSec = 0; m_iCalls = 0; } void Start () { m_iMicroSec -= sphMicroTimer (); m_iCalls++; } void Stop () { m_iMicroSec += sphMicroTimer (); } }; static const int SPH_MAX_TIMERS = 128; static int g_iTimer = -1; static int g_iTimers = 0; static CSphTimer g_dTimers [ SPH_MAX_TIMERS ]; void sphProfilerInit () { assert ( g_iTimers==0 ); assert ( g_iTimer==-1 ); // start root timer g_iTimers = 1; g_iTimer = 0; g_dTimers[g_iTimer].Alloc ( TIMER_root, -1 ); g_dTimers[g_iTimer].Start (); } void sphProfilerPush ( ESphTimer eTimer ) { assert ( g_iTimer>=0 && g_iTimer0; iTimer=g_dTimers[iTimer].m_iNext ) { if ( g_dTimers[iTimer].m_eTimer==eTimer ) break; } // not found? let's alloc if ( iTimer<0 ) { assert ( g_iTimers=0 ) g_dTimers [ g_dTimers[g_iTimer].m_iChild ].m_iPrev = iTimer; g_dTimers[g_iTimer].m_iChild = iTimer; } // make it new current one assert ( iTimer>0 ); g_dTimers[iTimer].Start (); g_iTimer = iTimer; } void sphProfilerPop ( ESphTimer eTimer ) { assert ( g_iTimer>0 && g_iTimer=0 && g_iTimer0 ); assert ( g_iTimer==0 ); // stop root timer g_iTimers = 0; g_iTimer = -1; g_dTimers[0].Stop (); } void sphProfilerShow ( int iTimer=0, int iLevel=0 ) { assert ( g_iTimers==0 ); assert ( g_iTimer==-1 ); if ( iTimer==0 ) fprintf ( stdout, "--- PROFILE ---\n" ); CSphTimer & tTimer = g_dTimers[iTimer]; int iChild; // calc me int iChildren = 0; int64_t tmSelf = tTimer.m_iMicroSec; for ( iChild=tTimer.m_iChild; iChild>0; iChild=g_dTimers[iChild].m_iNext, iChildren++ ) tmSelf -= g_dTimers[iChild].m_iMicroSec; // dump me if ( tTimer.m_iMicroSec<50 ) return; char sName[32]; for ( int i=0; i0 && g_dTimers[iChild].m_iNext>0 ) iChild = g_dTimers[iChild].m_iNext; while ( iChild>0 ) { sphProfilerShow ( iChild, 1+iLevel ); iChild = g_dTimers[iChild].m_iPrev; } if ( iTimer==0 ) fprintf ( stdout, "---------------\n" ); } class CSphEasyTimer { public: CSphEasyTimer ( ESphTimer eTimer ) : m_eTimer ( eTimer ) { if ( g_iTimer>=0 ) sphProfilerPush ( m_eTimer ); } ~CSphEasyTimer () { if ( g_iTimer>=0 ) sphProfilerPop ( m_eTimer ); } protected: ESphTimer m_eTimer; }; #define PROFILER_INIT() sphProfilerInit() #define PROFILER_DONE() sphProfilerDone() #define PROFILE_BEGIN(_arg) sphProfilerPush(TIMER_##_arg) #define PROFILE_END(_arg) sphProfilerPop(TIMER_##_arg) #define PROFILE_SHOW() sphProfilerShow() #define PROFILE(_arg) CSphEasyTimer __t_##_arg ( TIMER_##_arg ); #else #define PROFILER_INIT() #define PROFILER_DONE() #define PROFILE_BEGIN(_arg) #define PROFILE_END(_arg) #define PROFILE_SHOW() #define PROFILE(_arg) #endif // SPH_INTERNAL_PROFILER #if USE_PYTHON #define LOC_ERROR2(_msg,_arg,_arg2) { sError.SetSprintf ( _msg, _arg, _arg2 ); return false; } PyObject* GetObjectAttr(PyObject *pInst, char* name); CSphSource_Python::CSphSource_Python ( const char * sName ) : CSphSource_Document ( sName ),m_uMaxFetchedID(0), m_sError() , m_iKillListSize( 0 ) , m_iKillListPos( 0 ) , m_iJoinedHitID( 0 ) , m_iJoinedHitField( 0 ) , m_JoinFieldsResultPos( 0 ) { //sName the data source's name main_module = NULL; builtin_module = NULL; m_pInstance = NULL; m_pInstance_BuildHit = NULL; m_pInstance_NextDocument = NULL; m_pInstance_GetDocField = NULL; m_pInstance_GetMVAValue = NULL; m_bHaveCheckBuildHit = false; m_Hit_collector = NULL; m_JoinFieldsResult = NULL; for(int i = 0; i< SPH_MAX_FIELDS; i++){ m_dFields[i] = NULL; m_iJoinedHitPositions[i] = 0; } m_pKillList = NULL; } CSphSource_Python::~CSphSource_Python (){ Disconnect (); if(m_pInstance_BuildHit) { Py_XDECREF(m_pInstance_BuildHit); m_pInstance_BuildHit = NULL; } if(m_pInstance_NextDocument){ Py_XDECREF(m_pInstance_BuildHit); m_pInstance_BuildHit = NULL; } if(m_Hit_collector) { Py_XDECREF(m_Hit_collector); m_Hit_collector = NULL; } if(m_pInstance_GetDocField){ Py_XDECREF(m_pInstance_GetDocField); m_pInstance_GetDocField = NULL; } if(m_pInstance_GetMVAValue){ Py_XDECREF(m_pInstance_GetMVAValue); m_pInstance_GetMVAValue = NULL; } if(m_JoinFieldsResult){ Py_XDECREF(m_JoinFieldsResult); m_JoinFieldsResult = NULL; } //can not be in Disconnect for OnIndexFinished still needs this. if(m_pInstance) { Py_XDECREF(m_pInstance); m_pInstance = NULL; } } // get string #define LOC_GETS(_arg,_key) \ if ( hSource.Exists(_key) ) \ _arg = hSource[_key]; // get array of strings #define LOC_GETAS(_arg,_key) \ for ( CSphVariant * pVal = hSource(_key); pVal; pVal = pVal->m_pNext ) \ _arg.Add ( pVal->cstr() ); bool CSphSource_Python::Setup ( const CSphConfigSection & hSource){ //check have python_name? CSphString PySourceName; LOC_GETS(PySourceName, "name"); if(PySourceName.Length() == 0) { Error ( "field 'name' must be assigned."); return false; } //Shame on me!! __main__ __builtin__ time no Refcnt +1 main_module = PyImport_AddModule("__main__"); builtin_module = PyImport_AddModule("__builtin__"); //do schema read, ready to used. if (!main_module) { goto DONE; } if (!builtin_module) { //Py_XDECREF(main_module); goto DONE; } if(InitDataSchema(hSource, PySourceName.cstr())!=0) return false; return true; DONE: return false; } ////////////////////////////////////////////////////////////////////////// // Helper Functions ////////////////////////////////////////////////////////////////////////// bool CheckResult(PyObject * pResult) { if(!pResult) //no return default true return true; if(PyBool_Check(pResult)){ if(Py_False == pResult) return false; } if(PyInt_Check(pResult)) { if(PyInt_AsLong(pResult) == 0) return false; } return true; } int CSphSource_Python::UpdatePySchema( PyObject * pList, CSphSchema * pInfo, CSphString & docid, CSphString & sError ) { /* - Update pInfo via pList. - Most copy from pysource, for no pysource needed in pyExt mode. @return 0, ok @return <0, error happend. */ assert(pInfo); pInfo->Reset(); char* doc_id_col = NULL; //used to save docid. // if(!pList || !PyList_Check(pList)) { sError = "Feed list object to schema."; return -1; } int size = (int)PyList_Size(pList); for(int i = 0; i < size; i++) { PyObject* item = PyList_GetItem(pList,i); // item -> tuple ( name, {props} ) if(!PyTuple_Check(item)){ sError = "The schema list must be build by tuples."; return -2; } if(PyTuple_GET_SIZE(item) < 2) { // name, props return -3; } PyObject* key = PyTuple_GetItem(item, 0); PyObject* props = PyTuple_GetItem(item, 1); //check type if(PyString_Check(key) && PyDict_Check(props)) { char* strkey = PyString_AsString(key); CSphString skey(strkey); // Currently support case-sensive column while indexing //check key #if USE_PYTHON_CASE_SENSIVE_ATTR #else { CSphString skey_low = skey; skey_low.ToLower(); if(skey_low != skey) { sError.SetSprintf("The schema column name must be in lower case [%s]", skey.cstr()); return -3; } } #endif //check docid PyObject * propValue = NULL; PyObject * sizeValue = NULL; PyObject * wordPartValue = NULL; PyObject * delayCollectionValue = NULL; int iBitCount = -1; propValue = PyDict_GetItemString(props, "docid"); //+0 if(propValue && CheckResult(propValue)){ doc_id_col = strkey; continue; } propValue = PyDict_GetItemString(props, "type"); if (propValue && !PyString_Check(propValue)) { sError.SetSprintf( "Attribute %s's type is not a string value", strkey); continue; } // set tCol.m_tLocator.m_iBitCount, to make index smaller sizeValue = PyDict_GetItemString(props, "size"); if(sizeValue && (PyInt_Check(sizeValue))) { //PyErr_Print(); iBitCount = PyInt_AsLong(sizeValue); } if(sizeValue && (PyLong_Check(sizeValue))) { //PyErr_Print(); iBitCount = (int)PyLong_AsLongLong(sizeValue); } wordPartValue = PyDict_GetItemString(props, "wordpart"); //+0 if (wordPartValue){ if (PyString_Check(wordPartValue)) { CSphString szFieldName(strkey); char* strval = PyString_AsString(wordPartValue); if(strcmp(strval,"prefix") == 0) { if(!m_dPrefixFields.Contains ( strkey )) m_dPrefixFields.AddUnique(strkey); } if(strcmp(strval,"infix") == 0 ) { if(!m_dInfixFields.Contains ( strkey )) m_dInfixFields.AddUnique(strkey); } }else { sError.SetSprintf( "Attribute %s's type is not a string value, skip", "wordpart"); wordPartValue = NULL; } } delayCollectionValue = PyDict_GetItemString(props, "delay"); //+0 if(delayCollectionValue && CheckResult(delayCollectionValue)){ //doc_id_col = strkey; //continue; } // assign types if(strcmp(PyString_AsString(propValue) , "float") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_FLOAT ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? tCol.m_tLocator.m_iBitCount = iBitCount; pInfo->AddAttr ( tCol, true); }else if(strcmp(PyString_AsString(propValue) , "integer") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_INTEGER ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? tCol.m_tLocator.m_iBitCount = iBitCount; pInfo->AddAttr ( tCol, true); }else if(strcmp(PyString_AsString(propValue) , "long") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_BIGINT ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? tCol.m_tLocator.m_iBitCount = iBitCount; pInfo->AddAttr ( tCol, true); }else if(strcmp(PyString_AsString(propValue) , "list") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_INTEGER ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? tCol.m_eAttrType = SPH_ATTR_UINT32SET; tCol.m_eSrc = SPH_ATTRSRC_FIELD; // tCol.m_tLocator.m_iBitCount = iBitCount; //XXX: ???? pInfo->AddAttr ( tCol, true); }else if(strcmp(PyString_AsString(propValue) , "list-query") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_INTEGER ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? tCol.m_eAttrType = SPH_ATTR_UINT32SET; tCol.m_eSrc = SPH_ATTRSRC_QUERY; // tCol.m_tLocator.m_iBitCount = iBitCount; //XXX: ???? pInfo->AddAttr ( tCol, true); }else if(strcmp(PyString_AsString(propValue) , "bool") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_BOOL ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? pInfo->AddAttr ( tCol, true ); }else if(strcmp(PyString_AsString(propValue) , "str2ord") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_ORDINAL ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? pInfo->AddAttr ( tCol, true ); }else if(strcmp(PyString_AsString(propValue) , "timestamp") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_TIMESTAMP ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? pInfo->AddAttr ( tCol, true ); }else if(strcmp(PyString_AsString(propValue) , "string") == 0){ CSphColumnInfo tCol ( strkey, SPH_ATTR_STRING ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? pInfo->AddAttr ( tCol , true); }else //if(propValue == csft_string_fulltext) { //-> to support sql_field_string "string_text" if(strcmp(PyString_AsString(propValue) , "string_text") == 0){ //append strings CSphColumnInfo tCol ( strkey, SPH_ATTR_STRING ); tCol.m_iIndex = i; //m_tSchema.GetAttrsCount (); //should be i in pList? pInfo->AddAttr ( tCol , true); }else if(strcmp(PyString_AsString(propValue) , "text") != 0){ sError.SetSprintf("Type %s is invalid, treated as full-text", PyString_AsString(propValue)); } //default fulltext field // AddFieldToSchema(skey.cstr(), i); { CSphColumnInfo tCol ( strkey ); // TODO: setup prefix, infix //this used to set SPH_WORDPART_PREFIX | SPH_WORDPART_INFIX, in push hit mode, no needs at all. SetupFieldMatch ( tCol ); tCol.m_iIndex = i; pInfo->m_dFields.Add ( tCol ); } } }else{ ///XXX? report error | continue; } } // for if(!doc_id_col) { if(PyErr_Occurred()) PyErr_Print(); sError.SetSprintf("Must set docid = True attribute in DataSource Scheme to declare document unique id"); PyErr_Clear(); return -1; } docid = doc_id_col; return 0; } ////////////////////////////////////////////////////////////////////////// int CSphSource_Python::InitDataSchema_Python( CSphString & sError ) { if (!m_pInstance) { PyErr_Print(); m_sError.SetSprintf ( "Can no create source object"); return -1; } //all condition meets m_tSchema.m_dFields.Reset (); //enum all attrs PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pFunc = PyObject_GetAttrString(m_pInstance, "GetScheme"); // +1 if (!pFunc) { sError = ("Method SourceObj->GetScheme():{dict of attributes} missing."); //fprintf(stderr,m_sError.cstr()); return -2; //Next Document must exist } if(!pFunc||!PyCallable_Check(pFunc)){ Py_XDECREF(pFunc); sError = ("Method SourceObj->GetScheme():{dict of attributes} missing."); //fprintf(stderr,m_sError.cstr()); return -2; } pArgs = Py_BuildValue("()"); pResult = PyEval_CallObject(pFunc, pArgs); Py_XDECREF(pArgs); Py_XDECREF(pFunc); if(PyErr_Occurred()) PyErr_Print(); { int nRet = UpdatePySchema(pResult, &m_tSchema, m_Doc_id_col, sError); if(nRet) return nRet; } Py_XDECREF(pResult); /* char sBuf [ 1024 ]; snprintf ( sBuf, sizeof(sBuf), "pysource(%s)", m_sCommand.cstr() ); m_tSchema.m_sName = sBuf; */ m_tDocInfo.Reset ( m_tSchema.GetRowSize() ); m_dStrAttrs.Resize ( m_tSchema.GetAttrsCount() ); // check it if ( m_tSchema.m_dFields.GetLength()>SPH_MAX_FIELDS ) LOC_ERROR2 ( "too many fields (fields=%d, max=%d); raise SPH_MAX_FIELDS in sphinx.h and rebuild", m_tSchema.m_dFields.GetLength(), SPH_MAX_FIELDS ); return 0; } /// connect to the source (eg. to the database) /// connection settings are specific for each source type and as such /// are implemented in specific descendants bool CSphSource_Python::Connect ( CSphString & sError ){ //init the schema if (!m_pInstance) { PyErr_Print(); sError.SetSprintf ( "Can no create source object"); return false; } m_tHits.m_dData.Reserve ( m_iMaxHits ); //try to do connect { if (!m_pInstance) { if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); return false; }else{ PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pFunc = PyObject_GetAttrString(m_pInstance, "Connected"); if (!pFunc){ sError = ("'SourceObj->Connected():None' missing.\n"); PyErr_Clear(); //return false; }else{ if(!PyCallable_Check(pFunc)){ Py_XDECREF(pFunc); return false; } pArgs = Py_BuildValue("()"); pResult = PyEval_CallObject(pFunc, pArgs); Py_XDECREF(pArgs); Py_XDECREF(pFunc); //check result if(PyErr_Occurred()) PyErr_Print(); if(!CheckResult(pResult)) { Py_XDECREF(pResult); return false; } Py_XDECREF(pResult); } // init data-schema when connect if(InitDataSchema_Python(sError) != 0) return false; // build the cache. m_tSchema.BuildFieldIndexCache(); } } return true; } bool CSphSource_Python::CheckResult(PyObject * pResult) { if(!pResult) //no return default true return true; if(PyBool_Check(pResult)){ if(Py_False == pResult) return false; } if(PyInt_Check(pResult)) { if(PyInt_AsLong(pResult) == 0) return false; } return true; } /// disconnect from the source void CSphSource_Python::Disconnect (){ m_tSchema.Reset (); m_tHits.m_dData.Reset(); } /// check if there are any attributes configured /// note that there might be NO actual attributes in the case if configured /// ones do not match those actually returned by the source bool CSphSource_Python::HasAttrsConfigured () { return true; } void CSphSource_Python::PostIndex () { if (!m_pInstance) { PyErr_Print(); goto DONE; }else{ PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pFunc = PyObject_GetAttrString(m_pInstance, "OnIndexFinished"); if (!pFunc) PyErr_Clear(); //is function can be undefined if(!pFunc || pFunc == Py_None ||!PyCallable_Check(pFunc)){ Py_XDECREF(pFunc); goto DONE; } pArgs = Py_BuildValue("()"); pResult = PyEval_CallObject(pFunc, pArgs); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); Py_XDECREF(pArgs); Py_XDECREF(pFunc); Py_XDECREF(pResult); } DONE: return ; } /// begin iterating document hits /// to be implemented by descendants bool CSphSource_Python::IterateStart ( CSphString & sError ){ int iFieldMVA = 0; ///TODO: call on_before_index function if (!m_pInstance) { PyErr_Print(); goto DONE; }else{ PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pFunc = PyObject_GetAttrString(m_pInstance, "OnBeforeIndex"); if (!pFunc) PyErr_Clear(); //is function can be undefined if(!pFunc || pFunc == Py_None ||!PyCallable_Check(pFunc)){ Py_XDECREF(pFunc); goto DONE; } pArgs = Py_BuildValue("()"); pResult = PyEval_CallObject(pFunc, pArgs); Py_XDECREF(pArgs); Py_XDECREF(pFunc); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); if(!CheckResult(pResult)) { Py_XDECREF(pResult); return false; } Py_XDECREF(pResult); } DONE: //process GetFieldOrder { PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pFunc = PyObject_GetAttrString(m_pInstance, "GetFieldOrder"); if (!pFunc) PyErr_Clear(); //is function can be undefined if(!pFunc||!PyCallable_Check(pFunc)){ Py_XDECREF(pFunc); //goto DONE; } pArgs = Py_BuildValue("()"); pResult = PyEval_CallObject(pFunc, pArgs); Py_XDECREF(pArgs); Py_XDECREF(pFunc); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); //this is list -> list is supported by python source level-3 if (PyList_Check(pResult)) { int iSize = (int)PyList_Size(pResult); if(iSize>=1) { //must have at least one element PyObject* pResult2 = PyList_GetItem(pResult,0); //borrow m_tSchema.m_iBaseFields = 0; if (PyTuple_Check(pResult2)) { m_tSchema.m_iBaseFields = (int)PyTuple_Size(pResult2); //the base fields. #if HAVE_SSIZE_T for(Py_ssize_t iField = 0; iField< PyTuple_Size(pResult2); iField++) #else for(int iField = 0; iField< PyTuple_Size(pResult2); iField++) #endif { PyObject* pItem = PyTuple_GetItem(pResult2, iField); if(PyString_Check(pItem)){ //int j = this->m_tSchema.GetFieldIndex (PyString_AsString(pItem)); this->m_baseFields.Add(PyString_AsString(pItem)); } } }//end PyTuple_Check else //might be string only if(PyString_Check(pResult2)){ this->m_baseFields.Add(PyString_AsString(pResult2)); } else{ sError.SetSprintf ( "Must have at least one field as a first order field" ); return 0; } }//end if iSize >= 1 if(iSize==2) { //have joined fields PyObject* pResult2 = PyList_GetItem(pResult,1); //borrow if (PyTuple_Check(pResult2)) { #if HAVE_SSIZE_T for(Py_ssize_t iField = 0; iField< PyTuple_Size(pResult2); iField++) #else for(int iField = 0; iField< PyTuple_Size(pResult2); iField++) #endif { PyObject* pItem = PyTuple_GetItem(pResult2, iField); if(PyString_Check(pItem)){ //int j = this->m_tSchema.GetFieldIndex (PyString_AsString(pItem)); this->m_joinFields.Add(PyString_AsString(pItem)); } } }//end PyTuple_Check if(PyString_Check(pResult2)){ this->m_joinFields.Add(PyString_AsString(pResult2)); } } }else { sError = ("Method SourceObj->GetFieldOrder():[list of fields tuple]). Only list is acceptable."); Py_XDECREF(pResult); return false; } Py_XDECREF(pResult); } //end of get field order // process of prefetch GetDocField, DocField can be NULL, if no delay collection field. { if(m_pInstance_GetDocField == NULL) { //PyObject* pFunc = NULL; if (m_pInstance) { m_pInstance_GetDocField = PyObject_GetAttrString(m_pInstance, "GetDocField"); } if(!m_pInstance_GetDocField){ // GetDocField CAN '404 Not found.' if(PyErr_Occurred()) PyErr_Clear(); // just pass it. } } } // process MVA checking. m_iFieldMVA = 0; m_iFieldMVAIterator = 0; m_dAttrToFieldMVA.Resize ( 0 ); for ( int i = 0; i < m_tSchema.GetAttrsCount (); i++ ) { const CSphColumnInfo & tCol = m_tSchema.GetAttr ( i ); if ( ( tCol.m_eAttrType == SPH_ATTR_UINT32SET ) && tCol.m_eSrc == SPH_ATTRSRC_FIELD ) m_dAttrToFieldMVA.Add ( iFieldMVA++ ); else m_dAttrToFieldMVA.Add ( -1 ); } m_dFieldMVAs.Resize ( iFieldMVA ); ARRAY_FOREACH ( i, m_dFieldMVAs ) m_dFieldMVAs [i].Reserve ( 16 ); return true; } /// begin iterating values of out-of-document multi-valued attribute iAttr /// will fail if iAttr is out of range, or is not multi-valued /// can also fail if configured settings are invalid (eg. SQL query can not be executed) bool CSphSource_Python::IterateMultivaluedStart ( int iAttr, CSphString & sError ) { if ( iAttr<0 || iAttr>=m_tSchema.GetAttrsCount() ) return false; m_iMultiAttr = iAttr; const CSphColumnInfo & tAttr = m_tSchema.GetAttr(iAttr); if ( !(tAttr.m_eAttrType == SPH_ATTR_UINT32SET) ) return false; switch ( tAttr.m_eSrc ) { case SPH_ATTRSRC_FIELD: return false; case SPH_ATTRSRC_QUERY: { if(m_pInstance_GetMVAValue == NULL) { //PyObject* pFunc = NULL; if (m_pInstance) { m_pInstance_GetMVAValue = PyObject_GetAttrString(m_pInstance, "GetMVAValue"); } if(!m_pInstance_GetMVAValue){ // GetDocField CAN '404 Not found.' if(PyErr_Occurred()) PyErr_Clear(); sError = ("Method SourceObj->GetMVAValue():(docid, [list of values]) missing."); return false; } } if(m_pInstance_GetMVAValue) return true; } default: sError.SetSprintf ( "INTERNAL ERROR: unknown multi-valued attr source type %d", tAttr.m_eSrc ); return false; } // end of switch //return true; } /// get next multi-valued (id,attr-value) tuple to m_tDocInfo bool CSphSource_Python::IterateMultivaluedNext () { const CSphColumnInfo & tAttr = m_tSchema.GetAttr ( m_iMultiAttr ); assert ( tAttr.m_eAttrType == SPH_ATTR_UINT32SET ); //m_iMultiAttr if(m_pInstance_GetMVAValue) { //call GetMVA { PyObject* pArgs = NULL; PyObject* pResult = NULL; //create hit_c if(m_Hit_collector == NULL) m_Hit_collector = PyNewHitCollector(this, tAttr.m_sName, m_iJoinedHitField); else{ csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)m_Hit_collector; self->iField = m_iJoinedHitField; *(self->m_FieldName) = tAttr.m_sName; } #if USE_PYTHON_CASE_SENSIVE_ATTR pArgs = Py_BuildValue("(sO)", tAttr.m_sNameExactly.cstr(), m_Hit_collector); #else pArgs = Py_BuildValue("(sO)", tAttr.m_sName.cstr(), m_Hit_collector); #endif pResult = PyEval_CallObject(m_pInstance_GetMVAValue, pArgs); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); Py_XDECREF(pArgs); if(Py_None == pResult || pResult == NULL) { return false; } if(!PyTuple_Check(pResult)){ Py_XDECREF(pResult); //sError.SetSprintf("SourceObj->GetMVAValue():(id, [list]) missing, Can not continue"); return false; } if(PyTuple_GET_SIZE(pResult) == 2) { const CSphAttrLocator & tLoc = m_tSchema.GetAttr ( m_iMultiAttr ).m_tLocator; // (docid, text) PyObject* pDocId = PyTuple_GetItem(pResult, 0); PyObject* py_var = PyTuple_GetItem(pResult, 1); // convert docid if(pDocId && PyLong_Check(pDocId)) { #if USE_64BIT m_tDocInfo.m_iDocID = PyLong_AsLongLong(pDocId); #else m_tDocInfo.m_iDocID = (SphDocID_t)(PyLong_AsLong(pDocId)); #endif }else if(pDocId && PyInt_Check(pDocId)) m_tDocInfo.m_iDocID = PyInt_AsLong(pDocId); /* if(PyList_Check(py_varlist)) { int size = (int)PyList_Size(py_varlist); for(int i = 0; i < size; i++) { PyObject* item = PyList_GetItem(py_varlist,i); DWORD dVal = (DWORD)(PyInt_AsLong(item)); m_tDocInfo.SetAttr ( tLoc, dVal ); } } // end of if list check */ if(PyInt_Check(py_var)) { DWORD dVal = (DWORD)(PyInt_AsUnsignedLongMask(py_var)); m_tDocInfo.SetAttr ( tLoc, dVal ); } if(PyLong_Check(py_var)) { /* #if USE_64BIT SphAttr_t dVal = (SphAttr_t)(PyLong_AsLongLong(py_var)); #else */ SphAttr_t dVal = (SphAttr_t)(PyInt_AsUnsignedLongLongMask(py_var)); //#endif m_tDocInfo.SetAttr ( tLoc, dVal ); } } Py_XDECREF(pResult); } } // return that tuple return true; } /// begin iterating values of multi-valued attribute iAttr stored in a field /// will fail if iAttr is out of range, or is not multi-valued bool CSphSource_Python::IterateFieldMVAStart ( int iAttr, CSphString & /* sError */ ){ if ( iAttr<0 || iAttr>=m_tSchema.GetAttrsCount() ) return false; if ( m_dAttrToFieldMVA [iAttr] == -1 ) return false; m_iFieldMVA = iAttr; m_iFieldMVAIterator = 0; return true; } /// get next multi-valued (id,attr-value) tuple to m_tDocInfo bool CSphSource_Python::IterateFieldMVANext (){ int iFieldMVA = m_dAttrToFieldMVA [m_iFieldMVA]; if ( m_iFieldMVAIterator >= m_dFieldMVAs [iFieldMVA].GetLength () ) return false; const CSphColumnInfo & tAttr = m_tSchema.GetAttr ( m_iFieldMVA ); m_tDocInfo.SetAttr ( tAttr.m_tLocator, m_dFieldMVAs [iFieldMVA][m_iFieldMVAIterator] ); ++m_iFieldMVAIterator; return true; } BYTE* CSphSource_Python::GetField ( int iFieldIndex) { assert(iFieldIndex < m_tSchema.m_dFields.GetLength()); //int iEndField = m_tSchema.m_iBaseFields; //check cache if(m_dFields[iFieldIndex]) return m_dFields[iFieldIndex]; //pysource is case sensitive #if USE_PYTHON_CASE_SENSIVE_ATTR char* ptr_Name = (char*)m_tSchema.m_dFields[iFieldIndex].m_sNameExactly.cstr(); #else char* ptr_Name = (char*)m_tSchema.m_dFields[iFieldIndex].m_sName.cstr(); #endif PyObject* item = PyObject_GetAttrString(m_pInstance,ptr_Name); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); //PyList_GetItem(pList,m_tSchema.m_dFields[i].m_iIndex); //check as string? BYTE* ptr = NULL; if(item && Py_None!=item && PyString_Check(item)) { char* data = PyString_AsString(item); //m_dFields[i] = (BYTE*)PyString_AsString(item); //error!!! this pointer might be move later. ptr = (BYTE*)strdup(data); } //check is unicode? if(ptr == NULL && item && Py_None!=item && PyUnicode_Check(item)) { PyObject* utf8str = PyUnicode_EncodeUTF8(PyUnicode_AS_UNICODE(item), PyUnicode_GET_SIZE(item), "ignore"); //ignore all error unicode char. if(utf8str) { //if convert successfully. char* data = PyString_AsString(utf8str); ptr = (BYTE*)strdup(data); Py_XDECREF(utf8str); } } //check is integer & long if(ptr == NULL && item && Py_None!=item && PyLong_Check(item)) { // convert long & integer to string. char buf[128]; memset(buf,0,sizeof(buf)); PY_LONG_LONG dVal = PyLong_AsLongLong(item); #ifdef _WIN32 snprintf(buf,sizeof(buf), "%I64u\0", dVal); #else snprintf(buf,sizeof(buf), "%llu\0", dVal); #endif ptr = (BYTE*)strdup(buf); } if(ptr == NULL && item && Py_None!=item && PyInt_Check(item)) { // convert long & integer to string. long dVal = PyInt_AsLong(item); char buf[128]; memset(buf,0,sizeof(buf)); snprintf(buf,sizeof(buf), "%d\0", dVal); ptr = (BYTE*)strdup(buf); } Py_XDECREF(item); m_dFields[iFieldIndex] = ptr; return ptr; } void CSphSource_Python::BuildHits ( CSphString & sError, bool bSkipEndMarker) { //fixme: restore buildhit call later. assert ( m_pTokenizer ); PROFILE ( src_document ); if (!m_pInstance) { PyErr_Print(); }else{ if(m_baseFields.GetLength() !=0) { ARRAY_FOREACH ( i, m_baseFields ) { int j = this->m_tSchema.GetFieldIndex (m_baseFields[i].cstr()); if(j == -1) { //must die, else might cause infinit loop sphDie( "Can Not found field named %s.\n" , m_baseFields[i].cstr()); } else{ m_tState.m_iField = j; m_tState.m_iEndField = j+1; BuildHits_Python( sError, bSkipEndMarker); } } } } m_tState.m_bDocumentDone = !m_tState.m_bProcessingHits; } void CSphSource_Python::BuildHits_Python ( CSphString & sError, bool bSkipEndMarker ) { //check have python layer? if(m_bHaveCheckBuildHit && (m_pInstance_BuildHit == NULL || m_pInstance_BuildHit == Py_None) ) { return CSphSource_Document::BuildHits( sError, bSkipEndMarker); } if(m_pInstance_BuildHit == NULL) { //PyObject* pFunc = NULL; if (m_pInstance) { m_pInstance_BuildHit = PyObject_GetAttrString(m_pInstance, "BuildHits"); // +1 } m_bHaveCheckBuildHit = true; if(!m_pInstance_BuildHit || m_pInstance_BuildHit == Py_None){ // BuildHits CAN '404 Not found.' if(PyErr_Occurred()) PyErr_Clear(); return CSphSource_Document::BuildHits(sError, bSkipEndMarker); } } if(!m_pInstance_BuildHit) return; //do nothing if(m_Hit_collector == NULL){ #if USE_PYTHON_CASE_SENSIVE_ATTR m_Hit_collector = PyNewHitCollector(this, m_tSchema.m_dFields[m_tState.m_iField].m_sNameExactly, m_tState.m_iField); #else m_Hit_collector = PyNewHitCollector(this, m_tSchema.m_dFields[m_tState.m_iField].m_sName, m_tState.m_iField); #endif }else{ //re-init the collector csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)m_Hit_collector; self->iField = m_tState.m_iField; #if USE_PYTHON_CASE_SENSIVE_ATTR *(self->m_FieldName) = m_tSchema.m_dFields[m_tState.m_iField].m_sNameExactly; #else *(self->m_FieldName) = m_tSchema.m_dFields[m_tState.m_iField].m_sName; #endif //as we are in buildhit reset the position. self->iPhrase = 1; self->iPos = 1; //all pos started with 1. } PyObject* pargs = Py_BuildValue("(O)", m_Hit_collector); //+1 PyObject* pResult = Py_None; pResult = PyEval_CallObject(m_pInstance_BuildHit, pargs); // check result. if(!pResult && PyErr_Occurred()) { PyErr_Print(); //report the error. Py_XDECREF(pargs); } // check result value, if false, call default index if(!CheckResult(pResult)) { CSphSource_Document::BuildHits(sError, bSkipEndMarker); }else{ if ( !bSkipEndMarker && !m_tState.m_bProcessingHits && m_tHits.Length() ) { CSphWordHit * pHit = const_cast < CSphWordHit * > ( m_tHits.Last() ); HITMAN::SetEndMarker ( &pHit->m_iWordPos ); } } Py_XDECREF(pResult); Py_XDECREF(pargs); } BYTE ** CSphSource_Python::NextDocument ( CSphString & sError ){ //1st call document to load the data into pyobject. //call on_nextdocument function in py side. //call get_docId function to get the DocID attr's name // __getattr__ not work with PyObject_GetAttrString //clean the m_dFields 's data unsigned int iPrevHitPos = 0; ARRAY_FOREACH ( i, m_tSchema.m_dFields ) { if(m_dFields[i]) free(m_dFields[i]); m_dFields[i] = NULL; } if(m_Doc_id_col.IsEmpty()) return NULL; //no init yet! if(m_pInstance_NextDocument == NULL) { //PyObject* pFunc = NULL; if (m_pInstance) { m_pInstance_NextDocument = PyObject_GetAttrString(m_pInstance, "NextDocument"); } if(!m_pInstance_NextDocument){ // BuildHits CAN '404 Not found.' if(PyErr_Occurred()) PyErr_Clear(); sError.SetSprintf("SourceObj->NextDocument():Bool missing, Can not continue"); return NULL; //Next Document must exist } } if(!m_pInstance_NextDocument) return NULL; { //call next_document if (!m_pInstance) { PyErr_Print(); return NULL; }else{ PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pFunc = m_pInstance_NextDocument; //mark the hit position m_tHits.m_dData.Resize( 0 ); iPrevHitPos = m_tHits.m_dData.GetLength(); //we do NOT care the Field if(m_Hit_collector == NULL) m_Hit_collector = PyNewHitCollector(this, m_tSchema.m_dFields[0].m_sName, 0); pArgs = Py_BuildValue("(O)", m_Hit_collector); pResult = PyEval_CallObject(pFunc, pArgs); Py_XDECREF(pArgs); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); if(!pResult) { sError.SetSprintf("Exception happens in python source"); m_tDocInfo.m_iDocID = 0; goto CHECK_TO_CALL_AFTER_INDEX; } if(!CheckResult(pResult)) { Py_XDECREF(pResult); m_tDocInfo.m_iDocID = 0; goto CHECK_TO_CALL_AFTER_INDEX; //return NULL; //if return false , the source finished } Py_XDECREF(pResult); //We do NOT care about doc_id, but doc_id must be > 0 } } { PyObject* pDocId = GetObjectAttr(m_pInstance, (char*)m_Doc_id_col.cstr()); if(pDocId && PyLong_Check(pDocId)) { #if USE_64BIT m_tDocInfo.m_iDocID = PyLong_AsLongLong(pDocId); #else m_tDocInfo.m_iDocID = (SphDocID_t)(PyLong_AsLong(pDocId)); #endif }else if(pDocId && PyInt_Check(pDocId)) m_tDocInfo.m_iDocID = PyInt_AsLong(pDocId); Py_XDECREF(pDocId); m_uMaxFetchedID = Max ( m_uMaxFetchedID, m_tDocInfo.m_iDocID ); //re-set docid, user might push hit while in nextdocument for(; iPrevHitPos < m_tHits.m_dData.GetLength(); iPrevHitPos++) { m_tHits.m_dData[iPrevHitPos].m_iDocID = m_tDocInfo.m_iDocID; } } CHECK_TO_CALL_AFTER_INDEX: //check doc_id if(m_tDocInfo.m_iDocID <= 0) { //call sql_query_post PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pFunc = PyObject_GetAttrString(m_pInstance, "OnAfterIndex"); if (!pFunc) PyErr_Clear(); //is function can be undefined if(!pFunc || pFunc == Py_None ||!PyCallable_Check(pFunc)){ Py_XDECREF(pFunc); goto DONE; } pArgs = Py_BuildValue("()"); pResult = PyEval_CallObject(pFunc, pArgs); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); Py_XDECREF(pArgs); Py_XDECREF(pFunc); Py_XDECREF(pResult); //we do not care about the result. DONE: return NULL; } int iFieldMVA = 0; for ( int i=0; i(tAttr); tAttr2.m_iMVAIndex = iFieldMVA; //assign the index. iFieldMVA++; Py_XDECREF(pList); } continue; } //deal other attributes #if USE_PYTHON_CASE_SENSIVE_ATTR PyObject* item = PyObject_GetAttrString(m_pInstance, (char*)tAttr.m_sNameExactly.cstr()); //+1 #else PyObject* item = PyObject_GetAttrString(m_pInstance, (char*)tAttr.m_sName.cstr()); //+1 #endif if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); SetAttr(i, item); //Py_XDECREF(item); } return m_dFields; } ISphHits * CSphSource_Python::IterateJoinedHits ( CSphString & sError){ // - join field. m_tHits.m_dData.Resize ( 0 ); // eof check if ( m_iJoinedHitField >= m_joinFields.GetLength() ) { m_tDocInfo.m_iDocID = 0; return &m_tHits; } /* NOTE; A bit complicated still, for a joint field might be very large. Needs some mechanism to break the loop. Or, total memory might be run out. */ // check GetDocField's existence if(m_pInstance_GetDocField == NULL) { sError.SetSprintf("SourceObj->GetDocField():(id, string) missing, Can not continue"); return false; } /* - m_iJoinedHitPos: mark current field's indexing pos. ->should be an array., - m_iJoinedHitField */ if(m_joinFields.GetLength() !=0) { while(m_iJoinedHitField < m_joinFields.GetLength()) { //the position in schema field. int iJoinedHitField = m_tSchema.GetFieldIndex (m_joinFields[m_iJoinedHitField].cstr()); if(iJoinedHitField == -1) { fprintf(stderr, "Can Not found field named %s, skipping\n" , m_joinFields[m_iJoinedHitField].cstr()); m_iJoinedHitField ++; continue; } // join: call GetDocField, -> return (docid, text) while (true) { if(m_tState.m_bProcessingHits) { // if still in processing, continue the job. CSphSource_Document::BuildHits ( sError, true ); // update current position if ( !m_tSchema.m_dFields[m_iJoinedHitField].m_bPayload && !m_tState.m_bProcessingHits && m_tHits.Length() ) m_iJoinedHitPositions[iJoinedHitField] = HITMAN::GetPos ( m_tHits.Last()->m_iWordPos ); if(m_tState.m_bProcessingHits) break; //too large in one pass. // check and free ptr -> strdup created. if(m_dFields[0] && !m_tState.m_bProcessingHits) { free(m_dFields[0]); m_dFields[0] = NULL; } } PyObject* pArgs = NULL; PyObject* pResult = NULL; PyObject* pResultItem = NULL; PyObject* pResultKeys = NULL; #if HAVE_SSIZE_T Py_ssize_t key_count = 0; Py_ssize_t i = 0; #else int key_count = 0; int i = 0; #endif //create hit_c if(m_Hit_collector == NULL) m_Hit_collector = PyNewHitCollector(this, m_joinFields[m_iJoinedHitField], m_iJoinedHitField); else{ csfHelper_HitCollectorObject *self = (csfHelper_HitCollectorObject *)m_Hit_collector; self->iField = m_iJoinedHitField; *(self->m_FieldName) = m_joinFields[m_iJoinedHitField]; self->iPhrase = 1; self->iPos = 1; //all pos started with 1. } pArgs = Py_BuildValue("(sO)", m_joinFields[m_iJoinedHitField].cstr(), m_Hit_collector); //Ѿֵ򲻼 if(!m_JoinFieldsResult) pResult = PyEval_CallObject(m_pInstance_GetDocField, pArgs); else pResult = m_JoinFieldsResult; if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); Py_XDECREF(pArgs); if(Py_None == pResult || pResult == NULL) { //no more data, in this field!(all document). m_iJoinedHitID = 0; m_iJoinedHitField ++ ; memset(m_iJoinedHitPositions,0,sizeof(m_iJoinedHitPositions)); break; //this field is over, next. } /* * ֵ Dict Tuple */ if(!PyDict_Check(pResult)) pResultItem = pResult; //is the tuple. else{ pResultKeys = PyDict_Keys(pResult); //+1 key_count = PyList_GET_SIZE(pResultKeys); if(pResult == m_JoinFieldsResult) i = m_JoinFieldsResultPos; else i = 0; } while(true) { if(pResultKeys && i>= key_count) break; //stop the while loop if(pResultKeys) { PyObject* pItemKey = PyList_GET_ITEM(pResultKeys, i); //+0 if (! PyString_Check(pItemKey)) { i++; continue; //if return a hash table, field name must be string } pResultItem = PyDict_GetItem(pResult, pItemKey); iJoinedHitField = m_tSchema.GetFieldIndex (PyString_AsString(pItemKey)); if(iJoinedHitField == -1) { //The Column PySource Given not found. fprintf(stderr, "[Error in PySource] Can Not found field named %s, skipping\n" ,PyString_AsString(pItemKey)); i++; continue;; } } // check the result. if(!PyTuple_Check(pResultItem)){ sError.SetSprintf("SourceObj->GetDocField():(id, string) missing, Can not continue"); return false; } if(PyTuple_GET_SIZE(pResultItem) >= 2) { // (docid, text) PyObject* pDocId = PyTuple_GetItem(pResultItem, 0); PyObject* py_text = PyTuple_GetItem(pResultItem, 1); // convert docid if(pDocId && PyLong_Check(pDocId)) { #if USE_64BIT m_tDocInfo.m_iDocID = PyLong_AsLongLong(pDocId); #else m_tDocInfo.m_iDocID = (SphDocID_t)(PyLong_AsLong(pDocId)); #endif }else if(pDocId && PyInt_Check(pDocId)) m_tDocInfo.m_iDocID = PyInt_AsLong(pDocId); if ( !m_iJoinedHitID ) m_iJoinedHitID = m_tDocInfo.m_iDocID; // docid asc requirement violated? report an error if ( m_iJoinedHitID>m_tDocInfo.m_iDocID ) { sError.SetSprintf ( "joined field '%s': query MUST return document IDs in ASC order", m_joinFields[m_iJoinedHitField].cstr() ); return false; } // next document? update tracker, reset position if ( m_iJoinedHitID avoid read from pysource. // build those hits if(PyTuple_GET_SIZE(pResultItem) == 3) { PyObject* py_ipos = PyTuple_GetItem(pResultItem, 2); #if USE_64BIT DWORD uPosition = PyLong_AsLong(py_ipos); //use long as the doc it. #else DWORD uPosition = (DWORD)(PyInt_AsLong(py_ipos)); #endif m_tState.m_iStartPos = uPosition; } { m_tState.m_iField = iJoinedHitField; m_tState.m_iStartField = iJoinedHitField; m_tState.m_iEndField = iJoinedHitField+1; } CSphSource_Document::BuildHits ( sError, true ); // update current position if ( !m_tSchema.m_dFields[m_iJoinedHitField].m_bPayload && !m_tState.m_bProcessingHits && m_tHits.Length() ) m_iJoinedHitPositions[iJoinedHitField] = HITMAN::GetPos ( m_tHits.Last()->m_iWordPos ); }//end if ptr // check and free ptr -> strdup created. if(ptr && !m_tState.m_bProcessingHits) { m_dFields[0] = NULL; free(ptr); } } //end process pResultItem if(pResultKeys == NULL) break; i ++; //Why I increase i, for the tokenizer have stored the current fields context. if ( m_tState.m_bProcessingHits ) break; //break if m_tState is full. } //end while Py_XDECREF(pResultKeys); if ( m_tState.m_bProcessingHits ) //break { m_JoinFieldsResult = pResult; //save the result m_JoinFieldsResultPos = i; break; }else { // clear the continue if(m_JoinFieldsResult) { if(pResult == m_JoinFieldsResult) pResult = NULL; Py_XDECREF(m_JoinFieldsResult); m_JoinFieldsResult = NULL; } } Py_XDECREF(pResult); //we do not care about the result. } //end while if ( m_tState.m_bProcessingHits ) //break break; } //end for //reset all. m_iJoinedHitID = 0; //TODO? how about continuous build memset(m_iJoinedHitPositions,0,sizeof(m_iJoinedHitPositions)); } // no more fields //m_tDocInfo.m_iDocID = 0; // pretend that's an eof return &m_tHits; } ////////////////////////////////////////////////////////////////////////// PyObject* CSphSource_Python::GetAttr(char* key) { int iIndex = m_tSchema.GetAttrIndex(key); if(iIndex < 0){ iIndex = m_tSchema.GetFieldIndex(key); if(iIndex < 0) return NULL; PyObject* item = PyObject_GetAttrString(m_pInstance, key); return item; //new refer, might leak memory? almost NOT } return PyObject_GetAttrString(m_pInstance, key); } int CSphSource_Python::SetAttr(char* key, PyObject* v) { int iIndex = m_tSchema.GetAttrIndex(key); if(iIndex >= 0) { int nRet = SetAttr(iIndex, v); PyObject_SetAttrString(m_pInstance, key, v); //set to the py document for easy getter code. return nRet; } iIndex = m_tSchema.GetFieldIndex(key); if(iIndex < 0) return -1; //set field values, for set on the python object is what we needs later return PyObject_SetAttrString(m_pInstance, key, v); } int CSphSource_Python::SetAttr( int iIndex, PyObject* v) { const CSphColumnInfo & tAttr = m_tSchema.GetAttr(iIndex); // shortcut if ( tAttr.m_eAttrType == SPH_ATTR_UINT32SET ){ PyObject* pList = v; int iFieldMVA = tAttr.m_iMVAIndex; size_t size = PyList_Size(pList); m_dFieldMVAs [iFieldMVA].Resize ( 0 ); for(size_t j = 0; j < size; j++) { //PyList_GetItem just a borrowed reference PyObject* item = PyList_GetItem(pList,j); PY_LONG_LONG dVal = 0; if(item && (PyInt_Check(item))) dVal = PyInt_AsLong(item); if(item && (PyLong_Check(item))) dVal = PyLong_AsLongLong(item); m_dFieldMVAs [iFieldMVA].Add ( (DWORD)dVal); } Py_XDECREF(pList); } PyObject* item = v; //normal attribute switch(tAttr.m_eAttrType){ case SPH_ATTR_FLOAT: { double dVal = 0.0; if(item && PyFloat_Check(item)) dVal = PyFloat_AsDouble(item); m_tDocInfo.SetAttrFloat ( tAttr.m_tLocator, (float)dVal); Py_XDECREF(item); } break; case SPH_ATTR_INTEGER: case SPH_ATTR_BIGINT:{ PY_LONG_LONG dVal = 0; if(item && PyInt_Check(item)) { dVal = PyInt_AsLong(item); m_tDocInfo.SetAttr ( tAttr.m_tLocator,(DWORD)dVal); } if(item && PyLong_Check(item)) { dVal = PyLong_AsLongLong(item); m_tDocInfo.SetAttr ( tAttr.m_tLocator,dVal); } Py_XDECREF(item); } break; case SPH_ATTR_BOOL: { long dVal = (item == Py_True)?1:0; m_tDocInfo.SetAttr ( tAttr.m_tLocator,(DWORD)dVal); Py_XDECREF(item); } break; case SPH_ATTR_TIMESTAMP: { //time stamp can be float and long PY_LONG_LONG dVal = 0; if(item && PyLong_Check(item)) dVal = PyLong_AsLongLong(item); if(item && PyFloat_Check(item)) dVal = (long)PyFloat_AsDouble(item); m_tDocInfo.SetAttr (tAttr.m_tLocator,dVal); Py_XDECREF(item); } break; case SPH_ATTR_STRING: case SPH_ATTR_ORDINAL: { //check as string? if(item && Py_None!=item && PyString_Check(item)) { char* data = PyString_AsString(item); //if(m_dStrAttrs[iIndex].IsEmpty()) // m_dStrAttrs[iIndex].; //clear prev setting. m_dStrAttrs[iIndex] = data; //strdup(data); //same no needs to dup }else if( item && Py_None!=item && PyUnicode_Check(item)) { PyObject* utf8str = PyUnicode_EncodeUTF8(PyUnicode_AS_UNICODE(item), PyUnicode_GET_SIZE(item), "ignore"); //ignore all error unicode char. if(utf8str) { //if convert successfully. char* data = PyString_AsString(utf8str); m_dStrAttrs[iIndex] = data; //CSphString will clone the data //ptr = (BYTE*)strdup(data); Py_XDECREF(utf8str); } } Py_XDECREF(item); } break; default: return -1; break; } return 0; } void CSphSource_Python::AddHit ( SphDocID_t uDocid, SphWordID_t uWordid, Hitpos_t uPos ) { m_tHits.AddHit ( uDocid, uWordid , uPos ); } ////////////////////////////////////////////////////////////////////////// // helper functions void CSphSource_Python::SetupFieldMatch ( CSphColumnInfo & tCol ) { const bool bWordDict = m_pDict->GetSettings().m_bWordDict; tCol.m_eWordpart = GetWordpart ( tCol.m_sName.cstr(), bWordDict ); } void CSphSource_Python::AddFieldToSchema ( const char * szName , int iIndex) { CSphColumnInfo tCol ( szName ); SetupFieldMatch ( tCol ); tCol.m_iIndex = iIndex; m_tSchema.m_dFields.Add ( tCol ); } int CSphSource_Python::InitDataSchema(const CSphConfigSection & hSource,const char* dsName) { PyObject* pFunc = PyObject_GetAttrString(main_module, "__coreseek_find_pysource"); PyObject* m_pTypeObj = NULL; if(pFunc && PyCallable_Check(pFunc)){ PyObject* pArgsKey = Py_BuildValue("(s)", dsName); m_pTypeObj = PyEval_CallObject(pFunc, pArgsKey); Py_XDECREF(pArgsKey); } // end if if (pFunc) Py_XDECREF(pFunc); if (m_pTypeObj == NULL || m_pTypeObj == Py_None) { Error("Can NOT found data source %s.\n", dsName); return 0; } if (!PyClass_Check(m_pTypeObj) && !PyType_Check(m_pTypeObj)) { Py_XDECREF(m_pTypeObj); Error("%s is NOT a Python class.\n", dsName); return -1; //not a valid type file } if(!m_pTypeObj||!PyCallable_Check(m_pTypeObj)){ Py_XDECREF(m_pTypeObj); return -2; }else{ PyObject* pConf = PyDict_New(); // +1 hSource.IterateStart (); while ( hSource.IterateNext() ){ //Add ( hSource.IterateGet(), hSource.IterateGetKey() ); const char* key = hSource.IterateGetKey().cstr(); CSphVector values; LOC_GETAS(values, key); if(values.GetLength() >1) { PyObject* pVals = PyList_New(0); // +1 ARRAY_FOREACH ( i, values ) { PyList_Append(pVals, PyString_FromString(values[i].cstr())); } PyDict_SetItem(pConf, PyString_FromString(key), pVals); //0 ok ; -1 error Py_XDECREF(pVals); }else{ const char* val = hSource.IterateGet().cstr(); //hSource.IterateGet(); PyDict_SetItemString(pConf, key, PyString_FromString(val)); } } PyObject* pargs = Py_BuildValue("O", pConf); //+1 PyObject* pArg = PyTuple_New(1); //+1 PyTuple_SetItem(pArg, 0, pargs); //steal one reference m_pInstance = PyEval_CallObject(m_pTypeObj, pArg); if(!m_pInstance){ PyErr_Print(); Py_XDECREF(pArg); Py_XDECREF(m_pTypeObj); return -3; //source file error. } Py_XDECREF(pArg); Py_XDECREF(pConf); } Py_XDECREF(m_pTypeObj); return 0; } ////////////////////////////////////////////////////////////////////////// bool CSphSource_Python::IterateKillListStart ( CSphString & ) { if (!m_pInstance) return false; Py_XDECREF(m_pKillList); PyObject* pArgs = NULL; PyObject* pFunc = PyObject_GetAttrString(m_pInstance, "GetKillList"); if (!pFunc || pFunc == Py_None ||!PyCallable_Check(pFunc)) { PyErr_Clear(); //GetKillList is a optional feature. return false; } m_pKillList = PyEval_CallObject(pFunc, pArgs); Py_XDECREF(pArgs); Py_XDECREF(pFunc); if(PyErr_Occurred()) PyErr_Print(); PyErr_Clear(); if(!m_pKillList) { this->m_sError = ("Exception happens in python source.(GetKillList)\n"); return false; } if(!PyList_Check(m_pKillList)) { this->m_sError = "Feed list object to schema."; return false; } m_iKillListSize = (int)PyList_Size(m_pKillList); m_iKillListPos = 0; return true; } bool CSphSource_Python::IterateKillListNext ( SphDocID_t & aID) { if( !m_pKillList ) return false; if( m_iKillListPos >= m_iKillListSize ) return false; PyObject* item = PyList_GetItem(m_pKillList,m_iKillListPos); if(PyInt_Check(item)) { aID = PyInt_AsLong(item); } if(PyLong_Check(item)){ #if USE_64BIT aID = PyLong_AsLongLong(item); #else aID = (SphDocID_t)(PyLong_AsLong(item)); #endif } m_iKillListPos ++; //move next return true; } ////////////////////////////////////////////////////////////////////////// void CSphSource_Python::Error ( const char * sTemplate, ... ) { if ( !m_sError.IsEmpty() ) return; va_list ap; va_start ( ap, sTemplate ); m_sError.SetSprintf( sTemplate, ap ); va_end ( ap ); } PyObject* GetObjectAttr(PyObject *pInst, char* name) //+1 { PyObject* item = PyObject_GetAttrString(pInst, name); if(item) return item; PyObject* pFunc = PyObject_GetAttrString(pInst, "__getattr__"); if(!pFunc) return NULL; PyObject* pArgsKey = Py_BuildValue("(s)",name); PyObject* pResult = PyEval_CallObject(pFunc, pArgsKey); Py_XDECREF(pArgsKey); Py_XDECREF(pFunc); return pResult; } #endif coreseek-4.1-beta/csft-4.1/src/py_source.h100777 0 0 10652 11643565732 13455 0#ifndef _PY_SOURCE_H_ #define _PY_SOURCE_H_ #include "sphinx.h" #include "py_layer.h" #if USE_PYTHON BYTE* GetStringValueWithMalloc(PyObject* item); class CSphSource_Python : public CSphSource_Document { public: CSphSource_Python ( const char * sName ); ~CSphSource_Python (); bool Setup ( const CSphConfigSection & hSource); public: /// connect to the source (eg. to the database) /// connection settings are specific for each source type and as such /// are implemented in specific descendants virtual bool Connect ( CSphString & sError ); /// disconnect from the source virtual void Disconnect (); /// check if there are any attributes configured /// note that there might be NO actual attributes in the case if configured /// ones do not match those actually returned by the source virtual bool HasAttrsConfigured (); /// begin iterating document hits /// to be implemented by descendants virtual bool IterateStart ( CSphString & sError ); virtual void BuildHits ( CSphString & sError, bool bSkipEndMarker ); virtual void BuildHits_Python ( CSphString & sError, bool bSkipEndMarker ); //bool BuildHits ( BYTE ** dFields, int iFieldIndex, int iStartPos, CSphString & sError , bool bIgnoreFieldIndex ); /// begin iterating values of out-of-document multi-valued attribute iAttr /// will fail if iAttr is out of range, or is not multi-valued /// can also fail if configured settings are invalid (eg. SQL query can not be executed) virtual bool IterateMultivaluedStart ( int iAttr, CSphString & sError ); /// get next multi-valued (id,attr-value) tuple to m_tDocInfo virtual bool IterateMultivaluedNext (); /// begin iterating values of multi-valued attribute iAttr stored in a field /// will fail if iAttr is out of range, or is not multi-valued virtual bool IterateFieldMVAStart ( int iAttr, CSphString & sError ); /// get next multi-valued (id,attr-value) tuple to m_tDocInfo virtual bool IterateFieldMVANext (); /// helper function for prefix & infix void AppendPrefix(CSphString & ); void AppendInfix (CSphString & ); /// append to support joined field. virtual ISphHits * IterateJoinedHits ( CSphString & ); virtual bool HasJoinedFields () { return m_tSchema.m_iBaseFields!=m_tSchema.m_dFields.GetLength(); } virtual bool IterateKillListStart ( CSphString & ); virtual bool IterateKillListNext ( SphDocID_t & ); virtual BYTE* GetField ( int iFieldIndex); virtual BYTE ** NextDocument ( CSphString & sError ); virtual void PostIndex (); void Error ( const char * sTemplate, ... ); public: virtual PyObject* GetAttr(char* key); virtual int SetAttr(char* key, PyObject* v); virtual int SetAttr( int iIndex, PyObject* v); CSphDict * GetDict() { return m_pDict; } //used by py layer (hit collector) public: virtual void AddHit ( SphDocID_t uDocid, SphWordID_t uWordid, Hitpos_t uPos ); //used to push hit by hand. protected: int InitDataSchema_Python(CSphString & sError ); int InitDataSchema(const CSphConfigSection & hSource,const char* dsName); int UpdatePySchema( PyObject * pList, CSphSchema * pInfo, CSphString & docid, CSphString & sError ); void SetupFieldMatch ( CSphColumnInfo & tCol ); void AddFieldToSchema ( const char * szName, int iIndex ); bool CheckResult(PyObject * pResult); protected: PyObject * main_module; PyObject * builtin_module; PyObject * m_pInstance; PyObject * m_pInstance_BuildHit; PyObject * m_pInstance_NextDocument; PyObject * m_pInstance_GetDocField; PyObject * m_pInstance_GetMVAValue; bool m_bHaveCheckBuildHit; PyObject* m_Hit_collector; PyObject* m_JoinFieldsResult; ///<- used to store GetDocField int m_JoinFieldsResultPos; CSphString m_Doc_id_col; protected: BYTE * m_dFields [ SPH_MAX_FIELDS ]; SphDocID_t m_uMaxFetchedID;///< max actually fetched ID CSphVector < CSphVector > m_dFieldMVAs; CSphVector < int > m_dAttrToFieldMVA; int m_iFieldMVA ; int m_iFieldMVAIterator; //handle sql_join. SphDocID_t m_iJoinedHitID; ///< last document id int m_iJoinedHitPositions[ SPH_MAX_FIELDS ]; ///< last hit position int m_iMultiAttr; ///< multi-valued attr being currently fetched public: CSphString m_sError; protected: int m_iKillListSize; int m_iKillListPos; PyObject* m_pKillList; protected: CSphVector m_baseFields; CSphVector m_joinFields; int m_iJoinedHitField; //the index of m_joinFields }; #endif //USE_PYTHON #endif coreseek-4.1-beta/csft-4.1/src/search.cpp100777 0 0 34650 11643607466 13252 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxutils.h" #include "sphinxint.h" #include #include "py_layer.h" #define CONF_CHECK(_hash,_key,_msg,_add) \ if (!( _hash.Exists ( _key ) )) \ { \ fprintf ( stdout, "ERROR: key '%s' not found " _msg, _key, _add ); \ continue; \ } const char * myctime ( DWORD uStamp ) { static char sBuf[256]; time_t tStamp = uStamp; // for 64-bit strncpy ( sBuf, ctime ( &tStamp ), sizeof(sBuf) ); char * p = sBuf; while ( (*p) && (*p)!='\n' && (*p)!='\r' ) p++; *p = '\0'; return sBuf; } int main ( int argc, char ** argv ) { fprintf ( stdout, SPHINX_BANNER ); if ( argc<=1 ) { fprintf ( stdout, "Usage: search [OPTIONS] \n" "\n" "Options are:\n" "-c, --config \tuse given config file instead of defaults\n" "-i, --index \tsearch given index only (default: all indexes)\n" "-a, --any\t\tmatch any query word (default: match all words)\n" "-b, --boolean\t\tmatch in boolean mode\n" "-p, --phrase\t\tmatch exact phrase\n" "-e, --extended\t\tmatch in extended mode\n" "-f, --filter \tonly match if attribute attr value is v\n" "-s, --sortby \tsort matches by 'CLAUSE' in sort_extended mode\n" "-S, --sortexpr \tsort matches by 'EXPR' DESC in sort_expr mode\n" "-o, --offset \tprint matches starting from this offset (default: 0)\n" "-l, --limit \tprint this many matches (default: 20)\n" "-q, --noinfo\t\tdon't print document info from SQL database\n" "-g, --group \tgroup by attribute named attr\n" "-gs,--groupsort \tsort groups by \n" "--sort=date\t\tsort by date, descending\n" "--rsort=date\t\tsort by date, ascending\n" "--sort=ts\t\tsort by time segments\n" "--stdin\t\t\tread query from stdin\n" "\n" "This program (CLI search) is for testing and debugging purposes only;\n" "it is NOT intended for production use.\n" ); exit ( 0 ); } /////////////////////////////////////////// // get query and other commandline options /////////////////////////////////////////// CSphQuery tQuery; char sQuery [ 1024 ]; sQuery[0] = '\0'; const char * sOptConfig = NULL; const char * sIndex = NULL; bool bNoInfo = false; bool bStdin = false; int iStart = 0; int iLimit = 20; #define OPT(_a1,_a2) else if ( !strcmp(argv[i],_a1) || !strcmp(argv[i],_a2) ) #define OPT1(_a1) else if ( !strcmp(argv[i],_a1) ) int i; for ( i=1; i=argc ) break; OPT ( "-o", "--offset" ) iStart = atoi ( argv[++i] ); OPT ( "-l", "--limit" ) iLimit = atoi ( argv[++i] ); OPT ( "-c", "--config" ) sOptConfig = argv[++i]; OPT ( "-i", "--index" ) sIndex = argv[++i]; OPT ( "-g", "--group" ) { tQuery.m_eGroupFunc = SPH_GROUPBY_ATTR; tQuery.m_sGroupBy = argv[++i]; } OPT ( "-gs","--groupsort" ) { tQuery.m_sGroupSortBy = argv[++i]; } // NOLINT OPT ( "-s", "--sortby" ) { tQuery.m_eSort = SPH_SORT_EXTENDED; tQuery.m_sSortBy = argv[++i]; } OPT ( "-S", "--sortexpr" ) { tQuery.m_eSort = SPH_SORT_EXPR; tQuery.m_sSortBy = argv[++i]; } else if ( (i+2)>=argc ) break; OPT ( "-f", "--filter" ) { DWORD uVal = strtoul ( argv[i+2], NULL, 10 ); tQuery.m_dFilters.Reset (); tQuery.m_dFilters.Resize ( 1 ); tQuery.m_dFilters[0].m_eType = SPH_FILTER_VALUES; tQuery.m_dFilters[0].m_dValues.Reset (); tQuery.m_dFilters[0].m_dValues.Add ( uVal ); tQuery.m_dFilters[0].m_sAttrName = argv[i+1]; i += 2; } else break; // unknown option } else if ( strlen(sQuery) + strlen(argv[i]) + 1 < sizeof(sQuery) ) { // this is a search term strcat ( sQuery, argv[i] ); // NOLINT strcat ( sQuery, " " ); // NOLINT } } iStart = Max ( iStart, 0 ); iLimit = Max ( iLimit, 0 ); if ( i!=argc ) { fprintf ( stdout, "ERROR: malformed or unknown option near '%s'.\n", argv[i] ); return 1; } #undef OPT if ( bStdin ) { int iPos = 0, iLeft = sizeof(sQuery)-1; char sThrowaway [ 256 ]; while ( !feof(stdin) ) { if ( iLeft>0 ) { int iLen = fread ( sQuery, 1, iLeft, stdin ); iPos += iLen; iLeft -= iLen; } else { int iDummy; // to avoid gcc unused result warning iDummy = fread ( sThrowaway, 1, sizeof(sThrowaway), stdin ); } } assert ( iPos<(int)sizeof(sQuery) ); sQuery[iPos] = '\0'; } ///////////// // configure ///////////// tQuery.m_iMaxMatches = Max ( 1000, iStart + iLimit ); CSphConfigParser cp; CSphConfig & hConf = cp.m_tConf; sphLoadConfig ( sOptConfig, false, cp ); ///////////////////// // init python layer //////////////////// if ( hConf("python") && hConf["python"]("python") ) { CSphConfigSection & hPython = hConf["python"]["python"]; #if USE_PYTHON if(!cftInitialize(hPython)) sphDie ( "Python layer's initiation failed."); #else sphDie ( "Python layer defined, but search does Not supports python. used --with-python to recompile."); #endif } ///////////////////// // search each index ///////////////////// hConf["index"].IterateStart (); while ( hConf["index"].IterateNext () ) { const CSphConfigSection & hIndex = hConf["index"].IterateGet (); const char * sIndexName = hConf["index"].IterateGetKey().cstr(); if ( sIndex && strcmp ( sIndex, sIndexName ) ) continue; if ( hIndex("type") && hIndex["type"]=="distributed" ) continue; if ( !hIndex.Exists ( "path" ) ) sphDie ( "key 'path' not found in index '%s'", sIndexName ); CSphString sError; // do we want to show document info from database? #if USE_MYSQL MYSQL tSqlDriver; const char * sQueryInfo = NULL; const char * sQueryInfoPre = NULL; //for set names while ( !bNoInfo ) { if ( !hIndex("source") || !hConf("source") || !hConf["source"]( hIndex["source"] ) ) break; const CSphConfigSection & hSource = hConf["source"][ hIndex["source"] ]; if ( !hSource("type") || hSource["type"]!="mysql" || !hSource("sql_host") || !hSource("sql_user") || !hSource("sql_db") || !hSource("sql_pass") || !hSource("sql_query_info") ) { break; } if (hSource("sql_query_info_pre")) { sQueryInfoPre = hSource["sql_query_info_pre"].cstr(); } sQueryInfo = hSource["sql_query_info"].cstr(); if ( !strstr ( sQueryInfo, "$id" ) ) sphDie ( "'sql_query_info' value must contain '$id'" ); int iPort = 3306; if ( hSource.Exists ( "sql_port" ) && hSource["sql_port"].intval() ) iPort = hSource["sql_port"].intval(); mysql_init ( &tSqlDriver ); if ( !mysql_real_connect ( &tSqlDriver, hSource["sql_host"].cstr(), hSource["sql_user"].cstr(), hSource["sql_pass"].cstr(), hSource["sql_db"].cstr(), iPort, hSource.Exists ( "sql_sock" ) ? hSource["sql_sock"].cstr() : NULL, 0 ) ) { sphDie ( "failed to connect to MySQL (error=%s)", mysql_error ( &tSqlDriver ) ); } // all good break; } #endif ////////// // search ////////// tQuery.m_sQuery = sQuery; CSphQueryResult * pResult = NULL; CSphIndex * pIndex = sphCreateIndexPhrase ( NULL, hIndex["path"].cstr() ); pIndex->m_bEnableStar = ( hIndex.GetInt("enable_star")!=0 ); pIndex->SetWordlistPreload ( hIndex.GetInt("ondisk_dict")==0 ); CSphString sWarning; sError = "could not create index (check that files exist)"; for ( ; pIndex; ) { if ( !pIndex->Prealloc ( false, false, sWarning ) || !pIndex->Preread() ) { sError = pIndex->GetLastError (); break; } const CSphSchema * pSchema = &pIndex->GetMatchSchema(); if ( !sWarning.IsEmpty () ) fprintf ( stdout, "WARNING: index '%s': %s\n", sIndexName, sWarning.cstr () ); // handle older index versions (<9) if ( !sphFixupIndexSettings ( pIndex, hIndex, sError ) ) sphDie ( "index '%s': %s", sIndexName, sError.cstr() ); // lookup first timestamp if needed // FIXME! remove this? if ( tQuery.m_eSort!=SPH_SORT_RELEVANCE && tQuery.m_eSort!=SPH_SORT_EXTENDED && tQuery.m_eSort!=SPH_SORT_EXPR ) { int iTS = -1; for ( int i=0; iGetAttrsCount(); i++ ) if ( pSchema->GetAttr(i).m_eAttrType==SPH_ATTR_TIMESTAMP ) { tQuery.m_sSortBy = pSchema->GetAttr(i).m_sName; iTS = i; break; } if ( iTS<0 ) { fprintf ( stdout, "index '%s': no timestamp attributes found, sorting by relevance.\n", sIndexName ); tQuery.m_eSort = SPH_SORT_RELEVANCE; } } // do querying ISphMatchSorter * pTop = sphCreateQueue ( &tQuery, pIndex->GetMatchSchema(), sError ); if ( !pTop ) { sError.SetSprintf ( "failed to create sorting queue: %s", sError.cstr() ); break; } pResult = new CSphQueryResult(); if ( !pIndex->MultiQuery ( &tQuery, pResult, 1, &pTop, NULL ) ) { // failure; pull that error message sError = pIndex->GetLastError(); SafeDelete ( pResult ); } else { // success; fold them matches pResult->m_dMatches.Reset (); pResult->m_iTotalMatches += pTop->GetTotalCount(); pResult->m_tSchema = pTop->GetSchema(); sphFlattenQueue ( pTop, pResult, 0 ); } SafeDelete ( pTop ); break; } ///////// // print ///////// if ( !pResult ) { fprintf ( stdout, "index '%s': search error: %s.\n", sIndexName, sError.cstr() ); return 1; } fprintf ( stdout, "index '%s': query '%s': returned %d matches of %d total in %d.%03d sec\n", sIndexName, sQuery, pResult->m_dMatches.GetLength(), pResult->m_iTotalMatches, pResult->m_iQueryTime/1000, pResult->m_iQueryTime%1000 ); if ( !pResult->m_sWarning.IsEmpty() ) fprintf ( stdout, "WARNING: %s\n", pResult->m_sWarning.cstr() ); if ( pResult->m_dMatches.GetLength() ) { fprintf ( stdout, "\ndisplaying matches:\n" ); int iMaxIndex = Min ( iStart+iLimit, pResult->m_dMatches.GetLength() ); for ( int i=iStart; im_dMatches[i]; fprintf ( stdout, "%d. document=" DOCID_FMT ", weight=%d", 1+i, tMatch.m_iDocID, tMatch.m_iWeight ); for ( int j=0; jm_tSchema.GetAttrsCount(); j++ ) { const CSphColumnInfo & tAttr = pResult->m_tSchema.GetAttr(j); fprintf ( stdout, ", %s=", tAttr.m_sName.cstr() ); if ( tAttr.m_eAttrType==SPH_ATTR_UINT32SET || tAttr.m_eAttrType==SPH_ATTR_UINT64SET ) { fprintf ( stdout, "(" ); SphAttr_t iIndex = tMatch.GetAttr ( tAttr.m_tLocator ); if ( iIndex ) { const DWORD * pValues = pResult->m_pMva + iIndex; int iValues = *pValues++; if ( tAttr.m_eAttrType==SPH_ATTR_UINT64SET ) { assert ( ( iValues%2 )==0 ); for ( int k=0; km_pStrings + tMatch.GetAttr ( tAttr.m_tLocator ), &pStr ); fwrite ( pStr, 1, iLen, stdout ); break; } default: fprintf ( stdout, "(unknown-type-%d)", tAttr.m_eAttrType ); } } fprintf ( stdout, "\n" ); #if USE_MYSQL if ( sQueryInfo ) { char * sQuery = sphStrMacro ( sQueryInfo, "$id", tMatch.m_iDocID ); const char * sError = NULL; #define LOC_MYSQL_ERROR(_arg) { sError = _arg; break; } if (sQueryInfoPre) { if(mysql_query ( &tSqlDriver, sQueryInfoPre )) LOC_MYSQL_ERROR ( "mysql_query" ); } for ( ;; ) { if ( mysql_query ( &tSqlDriver, sQuery ) ) LOC_MYSQL_ERROR ( "mysql_query" ); MYSQL_RES * pSqlResult = mysql_use_result ( &tSqlDriver ); if ( !pSqlResult ) LOC_MYSQL_ERROR ( "mysql_use_result" ); MYSQL_ROW tRow = mysql_fetch_row ( pSqlResult ); if ( !tRow ) { fprintf ( stdout, "\t(document not found in db)\n" ); break; } for ( int iField=0; iField<(int)pSqlResult->field_count; iField++ ) fprintf ( stdout, "\t%s=%s\n", ( pSqlResult->fields && pSqlResult->fields[iField].name ) ? pSqlResult->fields[iField].name : "(NULL)", tRow[iField] ? tRow[iField] : "(NULL)" ); mysql_free_result ( pSqlResult ); break; } if ( sError ) sphDie ( "sql_query_info: %s: %s", sError, mysql_error ( &tSqlDriver ) ); delete [] sQuery; } #endif } } fprintf ( stdout, "\nwords:\n" ); pResult->m_hWordStats.IterateStart(); int iWord = 1; while ( pResult->m_hWordStats.IterateNext() ) { const CSphQueryResultMeta::WordStat_t & tStat = pResult->m_hWordStats.IterateGet(); fprintf ( stdout, "%d. '%s': %d documents, %d hits\n", iWord, pResult->m_hWordStats.IterateGetKey().cstr(), tStat.m_iDocs, tStat.m_iHits ); iWord++; } fprintf ( stdout, "\n" ); /////////// // cleanup /////////// SafeDelete ( pIndex ); } sphShutdownWordforms (); #if USE_PYTHON cftShutdown(); //clean up #endif } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/searchd.cpp100777 0 0 1447332 11643565732 13463 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxutils.h" #include "sphinxexcerpt.h" #include "sphinxrt.h" #include "sphinxint.h" #include #include #include #include #include #include #include #include #include #include #include #include "py_layer.h" #define SEARCHD_BACKLOG 5 #define SPHINXAPI_PORT 9312 #define SPHINXQL_PORT 9306 #define SPH_ADDRESS_SIZE sizeof("000.000.000.000") #define SPH_ADDRPORT_SIZE sizeof("000.000.000.000:00000") #define MVA_UPDATES_POOL 1048576 // don't shutdown on SIGKILL (debug purposes) // 1 - SIGKILL will shut down the whole daemon; 0 - watchdog will reincarnate the daemon #define WATCHDOG_SIGKILL 1 ///////////////////////////////////////////////////////////////////////////// #if USE_WINDOWS // Win-specific headers and calls #include #include #include #define sphSockRecv(_sock,_buf,_len) ::recv(_sock,_buf,_len,0) #define sphSockSend(_sock,_buf,_len) ::send(_sock,_buf,_len,0) #define sphSockClose(_sock) ::closesocket(_sock) #define stat _stat #else // UNIX-specific headers and calls #include #include #include #include #include #include #include #include // there's no MSG_NOSIGNAL on OS X #ifndef MSG_NOSIGNAL #define MSG_NOSIGNAL 0 #endif #define sphSockRecv(_sock,_buf,_len) ::recv(_sock,_buf,_len,MSG_NOSIGNAL) #define sphSockSend(_sock,_buf,_len) ::send(_sock,_buf,_len,MSG_NOSIGNAL) #define sphSockClose(_sock) ::close(_sock) #endif #if USE_SYSLOG #include #endif ///////////////////////////////////////////////////////////////////////////// // MISC GLOBALS ///////////////////////////////////////////////////////////////////////////// struct ServedIndex_t { CSphIndex * m_pIndex; CSphString m_sIndexPath; bool m_bEnabled; ///< to disable index in cases when rotation fails bool m_bMlock; bool m_bPreopen; bool m_bOnDiskDict; bool m_bStar; bool m_bExpand; bool m_bToDelete; bool m_bOnlyNew; bool m_bRT; public: ServedIndex_t (); ~ServedIndex_t (); void Reset (); void ReadLock () const; void WriteLock () const; void Unlock () const; private: mutable CSphRwlock m_tLock; }; ///////////////////////////////////////////////////////////////////////////// enum ESphAddIndex { ADD_ERROR = 0, ADD_LOCAL = 1, ADD_DISTR = 2, ADD_RT = 3 }; enum ProtocolType_e { PROTO_SPHINX = 0, PROTO_MYSQL41, PROTO_TOTAL }; const char * g_dProtoNames[PROTO_TOTAL] = { "sphinxapi", "sphinxql" }; static bool g_bService = false; #if USE_WINDOWS static bool g_bServiceStop = false; static const char * g_sServiceName = "searchd"; HANDLE g_hPipe = INVALID_HANDLE_VALUE; #endif static CSphVector g_dArgs; static bool g_bHeadDaemon = false; static bool g_bLogStdout = true; class SphCrashLogger_c { public: SphCrashLogger_c (); static void Init (); static void Done (); #if !USE_WINDOWS static void HandleCrash ( int ); #else static LONG WINAPI HandleCrash ( EXCEPTION_POINTERS * pExc ); #endif static void SetLastQuery ( const BYTE * pQuery, int iSize, bool bMySQL, int uCmd=0, int uVer=0 ); static void SetupTimePID (); void SetupTLS (); private: const BYTE * m_pQuery; // last query int m_iSize; // last query size WORD m_uCMD; // last command (header) WORD m_uVer; // last command's version (header) bool m_bMySQL; // is query from MySQL or API static SphCrashLogger_c m_tLastQuery; // non threaded mode last query static SphThreadKey_t m_tLastQueryTLS; // threaded mode last query }; enum LogFormat_e { LOG_FORMAT_PLAIN, LOG_FORMAT_SPHINXQL }; static ESphLogLevel g_eLogLevel = SPH_LOG_INFO; static int g_iLogFile = STDOUT_FILENO; // log file descriptor static bool g_bLogSyslog = false; static bool g_bQuerySyslog = false; static CSphString g_sLogFile; // log file name static bool g_bLogTty = false; // cached isatty(g_iLogFile) static LogFormat_e g_eLogFormat = LOG_FORMAT_PLAIN; static int g_iReadTimeout = 5; // sec static int g_iWriteTimeout = 5; static int g_iClientTimeout = 300; static int g_iMaxChildren = 0; #if !USE_WINDOWS static bool g_bPreopenIndexes = true; #else static bool g_bPreopenIndexes = false; #endif static bool g_bOnDiskDicts = false; static bool g_bUnlinkOld = true; static bool g_bWatchdog = true; static int g_iExpansionLimit = 0; static bool g_bCompatResults = true; struct Listener_t { int m_iSock; ProtocolType_e m_eProto; }; static CSphVector g_dListeners; static int g_iQueryLogFile = -1; static CSphString g_sQueryLogFile; static const char * g_sPidFile = NULL; static int g_iPidFD = -1; static int g_iMaxMatches = 1000; static int g_iMaxCachedDocs = 0; // in bytes static int g_iMaxCachedHits = 0; // in bytes static int g_iAttrFlushPeriod = 0; // in seconds; 0 means "do not flush" static int g_iMaxPacketSize = 8*1024*1024; // in bytes; for both query packets from clients and response packets from agents static int g_iMaxFilters = 256; static int g_iMaxFilterValues = 4096; static int g_iMaxBatchQueries = 32; static ESphCollation g_eCollation = SPH_COLLATION_DEFAULT; #if !USE_WINDOWS static CSphProcessSharedVariable g_tHaveTTY ( true ); #endif enum Mpm_e { MPM_NONE, ///< process queries in a loop one by one (eg. in --console) MPM_FORK, ///< fork a worker process for each query MPM_PREFORK, ///< keep a number of pre-forked processes MPM_THREADS ///< create a worker thread for each query }; static Mpm_e g_eWorkers = USE_WINDOWS ? MPM_THREADS : MPM_FORK; static int g_iPreforkChildren = 10; // how much workers to keep static CSphVector g_dChildren; static volatile bool g_bAcceptUnlocked = true; // whether this preforked child is guaranteed to be *not* holding a lock around accept static int g_iClientFD = -1; static int g_iDistThreads = 0; enum ThdState_e { THD_HANDSHAKE, THD_NET_READ, THD_NET_WRITE, THD_QUERY, THD_STATE_TOTAL }; const char * g_dThdStates[THD_STATE_TOTAL] = { "handshake", "net_read", "net_write", "query" }; struct ThdDesc_t { SphThread_t m_tThd; ProtocolType_e m_eProto; int m_iClientSock; CSphString m_sClientName; ThdState_e m_eThdState; const char * m_sCommand; int m_iConnID; ///< current conn-id for this thread ThdDesc_t () : m_iClientSock ( 0 ) , m_sCommand ( NULL ) , m_iConnID ( -1 ) {} }; static CSphStaticMutex g_tThdMutex; static CSphVector g_dThd; ///< existing threads table static int g_iConnID = 0; ///< global conn-id in none/fork/threads; current conn-id in prefork static SphThreadKey_t g_tConnKey; ///< current conn-id TLS in threads static int * g_pConnID = NULL; ///< global conn-id ptr in prefork static CSphSharedBuffer g_dConnID; ///< global conn-id storage in prefork (protected by accept mutex) // handshake static char g_sMysqlHandshake[128]; static int g_iMysqlHandshake = 0; ////////////////////////////////////////////////////////////////////////// static CSphString g_sConfigFile; static DWORD g_uCfgCRC32 = 0; static struct stat g_tCfgStat; static CSphConfigParser * g_pCfg = NULL; #if USE_WINDOWS static bool g_bSeamlessRotate = false; #else static bool g_bSeamlessRotate = true; #endif static bool g_bIOStats = false; static bool g_bCpuStats = false; static bool g_bOptNoDetach = false; static bool g_bOptNoLock = false; static bool g_bSafeTrace = false; static bool g_bStripPath = false; static volatile bool g_bDoDelete = false; // do we need to delete any indexes? static volatile int g_iRotateCount = 0; // flag that we are rotating now; set from SIGHUP; cleared on rotation success static volatile sig_atomic_t g_bGotSighup = 0; // we just received SIGHUP; need to log static volatile sig_atomic_t g_bGotSigterm = 0; // we just received SIGTERM; need to shutdown static volatile sig_atomic_t g_bGotSigchld = 0; // we just received SIGCHLD; need to count dead children static volatile sig_atomic_t g_bGotSigusr1 = 0; // we just received SIGUSR1; need to reopen logs static CSphVector g_dTermChildren; // children to send term signal on rotation is done static int64_t g_tmRotateChildren = 0; // pause to next children term signal after rotation is done static int g_iRotationThrottle = 0; // pause between children term signals after rotation is done /// global index hash /// used in both non-threaded and multi-threaded modes /// /// hash entry is a CSphIndex pointer, rwlock, and a few flags (see ServedIndex_t) /// rlock on entry guarantees it won't change, eg. that index pointer will stay alive /// wlock on entry allows to change (delete/replace) the index pointer /// /// note that entry locks are held outside the hash /// and Delete() honours that by acquiring wlock on an entry first class IndexHash_c : protected SmallStringHash_T { friend class IndexHashIterator_c; typedef SmallStringHash_T BASE; public: explicit IndexHash_c (); virtual ~IndexHash_c (); int GetLength () const { return BASE::GetLength(); } void Reset () { BASE::Reset(); } bool Add ( const ServedIndex_t & tValue, const CSphString & tKey ); bool Delete ( const CSphString & tKey ); const ServedIndex_t * GetRlockedEntry ( const CSphString & tKey ) const; ServedIndex_t * GetWlockedEntry ( const CSphString & tKey ) const; ServedIndex_t & GetUnlockedEntry ( const CSphString & tKey ) const; bool Exists ( const CSphString & tKey ) const; protected: void Rlock () const; void Wlock () const; void Unlock () const; private: mutable CSphRwlock m_tLock; }; /// multi-threaded hash iterator class IndexHashIterator_c : public ISphNoncopyable { public: explicit IndexHashIterator_c ( const IndexHash_c * pHash, bool bWrite=false ); ~IndexHashIterator_c (); bool Next (); ServedIndex_t & Get (); const CSphString & GetKey (); private: const IndexHash_c * m_pHash; IndexHash_c::HashEntry_t * m_pIterator; }; static IndexHash_c * g_pIndexes = NULL; // served indexes hash static CSphVector g_dRotating; // names of indexes to be rotated this time static const char * g_sPrereading = NULL; // name of index currently being preread static CSphIndex * g_pPrereading = NULL; // rotation "buffer" static CSphMutex g_tRotateQueueMutex; static CSphVector g_dRotateQueue; // FIXME? maybe replace it with lockless ring buffer static CSphMutex g_tRotateConfigMutex; static SphThread_t g_tRotateThread; static volatile bool g_bRotateShutdown = false; /// flush parameters of rt indexes static SphThread_t g_tRtFlushThread; static volatile bool g_bRtFlushShutdown = false; struct DistributedMutex_t { void Init (); void Done (); void Lock (); void Unlock (); private: CSphMutex m_tLock; }; static DistributedMutex_t g_tDistLock; enum { SPH_PIPE_PREREAD }; struct PipeInfo_t { int m_iFD; ///< read-pipe to child int m_iHandler; ///< who's my handler (SPH_PIPE_xxx) PipeInfo_t () : m_iFD ( -1 ), m_iHandler ( -1 ) {} }; static CSphVector g_dPipes; ///< currently open read-pipes to children processes struct PoolPtrs_t { const DWORD * m_pMva; const BYTE * m_pStrings; PoolPtrs_t () : m_pMva ( NULL ) , m_pStrings ( NULL ) {} }; ///////////////////////////////////////////////////////////////////////////// /// known commands enum SearchdCommand_e { SEARCHD_COMMAND_SEARCH = 0, SEARCHD_COMMAND_EXCERPT = 1, SEARCHD_COMMAND_UPDATE = 2, SEARCHD_COMMAND_KEYWORDS = 3, SEARCHD_COMMAND_PERSIST = 4, SEARCHD_COMMAND_STATUS = 5, SEARCHD_COMMAND_FLUSHATTRS = 7, SEARCHD_COMMAND_TOTAL }; /// known command versions enum { VER_COMMAND_SEARCH = 0x119, VER_COMMAND_EXCERPT = 0x103, VER_COMMAND_UPDATE = 0x102, VER_COMMAND_KEYWORDS = 0x100, VER_COMMAND_STATUS = 0x100, VER_COMMAND_FLUSHATTRS = 0x100 }; /// known status return codes enum SearchdStatus_e { SEARCHD_OK = 0, ///< general success, command-specific reply follows SEARCHD_ERROR = 1, ///< general failure, error message follows SEARCHD_RETRY = 2, ///< temporary failure, error message follows, client should retry later SEARCHD_WARNING = 3 ///< general success, warning message and command-specific reply follow }; enum { VER_MASTER = 1 }; /// command names const char * g_dApiCommands[SEARCHD_COMMAND_TOTAL] = { "search", "excerpt", "update", "keywords", "persist", "status", "query", "flushattrs" }; const int MAX_RETRY_COUNT = 8; const int MAX_RETRY_DELAY = 1000; ////////////////////////////////////////////////////////////////////////// const int STATS_MAX_AGENTS = 1024; ///< we'll track stats for this much remote agents /// per-agent query stats struct AgentStats_t { int64_t m_iTimeoutsQuery; ///< number of time-outed queries int64_t m_iTimeoutsConnect; ///< number of time-outed connections int64_t m_iConnectFailures; ///< failed to connect int64_t m_iNetworkErrors; ///< network error int64_t m_iWrongReplies; ///< incomplete reply int64_t m_iUnexpectedClose; ///< agent closed the connection }; struct SearchdStats_t { DWORD m_uStarted; int64_t m_iConnections; int64_t m_iMaxedOut; int64_t m_iCommandCount[SEARCHD_COMMAND_TOTAL]; int64_t m_iAgentConnect; int64_t m_iAgentRetry; int64_t m_iQueries; ///< search queries count (differs from search commands count because of multi-queries) int64_t m_iQueryTime; ///< wall time spent (including network wait time) int64_t m_iQueryCpuTime; ///< CPU time spent int64_t m_iDistQueries; ///< distributed queries count int64_t m_iDistWallTime; ///< wall time spent on distributed queries int64_t m_iDistLocalTime; ///< wall time spent searching local indexes in distributed queries int64_t m_iDistWaitTime; ///< time spent waiting for remote agents in distributed queries int64_t m_iDiskReads; ///< total read IO calls (fired by search queries) int64_t m_iDiskReadBytes; ///< total read IO traffic int64_t m_iDiskReadTime; ///< total read IO time DWORD m_bmAgentStats[STATS_MAX_AGENTS/32]; ///< per-agent storage usage bitmap AgentStats_t m_dAgentStats[STATS_MAX_AGENTS]; ///< per-agent storage }; static SearchdStats_t * g_pStats = NULL; static CSphSharedBuffer g_tStatsBuffer; static CSphProcessSharedMutex g_tStatsMutex; ////////////////////////////////////////////////////////////////////////// struct FlushState_t { int m_bFlushing; ///< update flushing in progress int m_iFlushTag; ///< last flushed tag bool m_bForceCheck; ///< forced check/flush flag }; static volatile FlushState_t * g_pFlush = NULL; static CSphSharedBuffer g_tFlushBuffer; static CSphMutex g_tFlushMutex; ////////////////////////////////////////////////////////////////////////// enum Uservar_e { USERVAR_INT_SET }; struct Uservar_t { Uservar_e m_eType; CSphVector * m_pVal; }; static CSphStaticMutex g_tUservarsMutex; static SmallStringHash_T g_hUservars; ///////////////////////////////////////////////////////////////////////////// // MACHINE-DEPENDENT STUFF ///////////////////////////////////////////////////////////////////////////// #if USE_WINDOWS // Windows hacks #undef EINTR #define LOCK_EX 0 #define LOCK_UN 1 #define STDIN_FILENO fileno(stdin) #define STDOUT_FILENO fileno(stdout) #define STDERR_FILENO fileno(stderr) #define ETIMEDOUT WSAETIMEDOUT #define EWOULDBLOCK WSAEWOULDBLOCK #define EINPROGRESS WSAEINPROGRESS #define EINTR WSAEINTR #define ECONNRESET WSAECONNRESET #define ECONNABORTED WSAECONNABORTED #define socklen_t int #define ftruncate _chsize #define getpid GetCurrentProcessId #endif // USE_WINDOWS const int EXT_COUNT = 8; const int EXT_MVP = 8; const char * g_dNewExts[EXT_COUNT] = { ".new.sph", ".new.spa", ".new.spi", ".new.spd", ".new.spp", ".new.spm", ".new.spk", ".new.sps" }; const char * g_dOldExts[] = { ".old.sph", ".old.spa", ".old.spi", ".old.spd", ".old.spp", ".old.spm", ".old.spk", ".old.sps", ".old.mvp" }; const char * g_dCurExts[] = { ".sph", ".spa", ".spi", ".spd", ".spp", ".spm", ".spk", ".sps", ".mvp" }; ///////////////////////////////////////////////////////////////////////////// // MISC ///////////////////////////////////////////////////////////////////////////// void ReleaseTTYFlag() { #if !USE_WINDOWS g_tHaveTTY.WriteValue(false); #endif } ServedIndex_t::ServedIndex_t () { Reset (); } void ServedIndex_t::Reset () { m_pIndex = NULL; m_bEnabled = true; m_bMlock = false; m_bPreopen = false; m_bOnDiskDict = false; m_bStar = false; m_bExpand = false; m_bToDelete = false; m_bOnlyNew = false; m_bRT = false; m_tLock = CSphRwlock(); if ( g_eWorkers==MPM_THREADS ) m_tLock.Init(); } ServedIndex_t::~ServedIndex_t () { SafeDelete ( m_pIndex ); if ( g_eWorkers==MPM_THREADS ) Verify ( m_tLock.Done() ); } void ServedIndex_t::ReadLock () const { if ( g_eWorkers==MPM_THREADS ) { if ( m_tLock.ReadLock() ) sphLogDebugvv ( "ReadLock %p", this ); else { sphLogDebug ( "ReadLock %p failed", this ); assert ( false ); } } } void ServedIndex_t::WriteLock () const { if ( g_eWorkers==MPM_THREADS ) { if ( m_tLock.WriteLock() ) sphLogDebugvv ( "WriteLock %p", this ); else { sphLogDebug ( "WriteLock %p failed", this ); assert ( false ); } } } void ServedIndex_t::Unlock () const { if ( g_eWorkers==MPM_THREADS ) { if ( m_tLock.Unlock() ) sphLogDebugvv ( "Unlock %p", this ); else { sphLogDebug ( "Unlock %p failed", this ); assert ( false ); } } } ////////////////////////////////////////////////////////////////////////// IndexHashIterator_c::IndexHashIterator_c ( const IndexHash_c * pHash, bool bWrite ) : m_pHash ( pHash ) , m_pIterator ( NULL ) { if ( !bWrite ) m_pHash->Rlock(); else m_pHash->Wlock(); } IndexHashIterator_c::~IndexHashIterator_c () { m_pHash->Unlock(); } bool IndexHashIterator_c::Next () { m_pIterator = m_pIterator ? m_pIterator->m_pNextByOrder : m_pHash->m_pFirstByOrder; return m_pIterator!=NULL; } ServedIndex_t & IndexHashIterator_c::Get () { assert ( m_pIterator ); return m_pIterator->m_tValue; } const CSphString & IndexHashIterator_c::GetKey () { assert ( m_pIterator ); return m_pIterator->m_tKey; } ////////////////////////////////////////////////////////////////////////// IndexHash_c::IndexHash_c () { if ( g_eWorkers==MPM_THREADS ) if ( !m_tLock.Init() ) sphDie ( "failed to init hash indexes rwlock" ); } IndexHash_c::~IndexHash_c() { if ( g_eWorkers==MPM_THREADS ) Verify ( m_tLock.Done() ); } void IndexHash_c::Rlock () const { if ( g_eWorkers==MPM_THREADS ) Verify ( m_tLock.ReadLock() ); } void IndexHash_c::Wlock () const { if ( g_eWorkers==MPM_THREADS ) Verify ( m_tLock.WriteLock() ); } void IndexHash_c::Unlock () const { if ( g_eWorkers==MPM_THREADS ) Verify ( m_tLock.Unlock() ); } bool IndexHash_c::Add ( const ServedIndex_t & tValue, const CSphString & tKey ) { Wlock(); bool bRes = BASE::Add ( tValue, tKey ); Unlock(); return bRes; } bool IndexHash_c::Delete ( const CSphString & tKey ) { // tricky part // hash itself might be unlocked, but entry (!) might still be locked // hence, we also need to acquire a lock on entry, and an exclusive one Wlock(); bool bRes = false; ServedIndex_t * pEntry = GetWlockedEntry ( tKey ); if ( pEntry ) { pEntry->Unlock(); bRes = BASE::Delete ( tKey ); } Unlock(); return bRes; } const ServedIndex_t * IndexHash_c::GetRlockedEntry ( const CSphString & tKey ) const { Rlock(); ServedIndex_t * pEntry = BASE::operator() ( tKey ); if ( pEntry ) pEntry->ReadLock(); Unlock(); return pEntry; } ServedIndex_t * IndexHash_c::GetWlockedEntry ( const CSphString & tKey ) const { Rlock(); ServedIndex_t * pEntry = BASE::operator() ( tKey ); if ( pEntry ) pEntry->WriteLock(); Unlock(); return pEntry; } ServedIndex_t & IndexHash_c::GetUnlockedEntry ( const CSphString & tKey ) const { return BASE::operator[] ( tKey ); } bool IndexHash_c::Exists ( const CSphString & tKey ) const { Rlock(); bool bRes = BASE::Exists ( tKey ); Unlock(); return bRes; } ////////////////////////////////////////////////////////////////////////// void DistributedMutex_t::Init () { if ( g_eWorkers==MPM_THREADS ) m_tLock.Init(); } void DistributedMutex_t::Done () { if ( g_eWorkers==MPM_THREADS ) m_tLock.Done(); } void DistributedMutex_t::Lock () { if ( g_eWorkers==MPM_THREADS ) m_tLock.Lock(); } void DistributedMutex_t::Unlock() { if ( g_eWorkers==MPM_THREADS ) m_tLock.Unlock(); } ///////////////////////////////////////////////////////////////////////////// // LOGGING ///////////////////////////////////////////////////////////////////////////// void Shutdown (); // forward ref for sphFatal() /// format current timestamp for logging int sphFormatCurrentTime ( char * sTimeBuf, int iBufLen ) { int64_t iNow = sphMicroTimer (); time_t ts = (time_t) ( iNow/1000000 ); // on some systems (eg. FreeBSD 6.2), tv.tv_sec has another type and we can't just pass it #if !USE_WINDOWS struct tm tmp; localtime_r ( &ts, &tmp ); #else struct tm tmp; tmp = *localtime ( &ts ); #endif static const char * sWeekday[7] = { "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" }; static const char * sMonth[12] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" }; return snprintf ( sTimeBuf, iBufLen, "%.3s %.3s%3d %.2d:%.2d:%.2d.%.3d %d", sWeekday [ tmp.tm_wday ], sMonth [ tmp.tm_mon ], tmp.tm_mday, tmp.tm_hour, tmp.tm_min, tmp.tm_sec, (int)((iNow%1000000)/1000), 1900+tmp.tm_year ); } /// physically emit log entry /// buffer must have 1 extra byte for linefeed void sphLogEntry ( ESphLogLevel eLevel, char * sBuf, char * sTtyBuf ) { #if USE_WINDOWS if ( g_bService && g_iLogFile==STDOUT_FILENO ) { HANDLE hEventSource; LPCTSTR lpszStrings[2]; hEventSource = RegisterEventSource ( NULL, g_sServiceName ); if ( hEventSource ) { lpszStrings[0] = g_sServiceName; lpszStrings[1] = sBuf; WORD eType = EVENTLOG_INFORMATION_TYPE; switch ( eLevel ) { case SPH_LOG_FATAL: eType = EVENTLOG_ERROR_TYPE; break; case SPH_LOG_WARNING: eType = EVENTLOG_WARNING_TYPE; break; case SPH_LOG_INFO: eType = EVENTLOG_INFORMATION_TYPE; break; } ReportEvent ( hEventSource, // event log handle eType, // event type 0, // event category 0, // event identifier NULL, // no security identifier 2, // size of lpszStrings array 0, // no binary data lpszStrings, // array of strings NULL ); // no binary data DeregisterEventSource ( hEventSource ); } } else #endif { strcat ( sBuf, "\n" ); // NOLINT lseek ( g_iLogFile, 0, SEEK_END ); if ( g_bLogTty ) sphWrite ( g_iLogFile, sTtyBuf, strlen(sTtyBuf) ); else sphWrite ( g_iLogFile, sBuf, strlen(sBuf) ); if ( g_bLogStdout && g_iLogFile!=STDOUT_FILENO ) sphWrite ( STDOUT_FILENO, sTtyBuf, strlen(sTtyBuf) ); } } /// log entry (with log levels, dupe catching, etc) /// call with NULL format for dupe flushing void sphLog ( ESphLogLevel eLevel, const char * sFmt, va_list ap ) { // dupe catcher state static const int FLUSH_THRESH_TIME = 1000000; // in microseconds static const int FLUSH_THRESH_COUNT = 100; static ESphLogLevel eLastLevel = SPH_LOG_INFO; static DWORD uLastEntry = 0; static int64_t tmLastStamp = -1000000-FLUSH_THRESH_TIME; static int iLastRepeats = 0; // only if we can if ( sFmt && eLevel>g_eLogLevel ) return; #if USE_SYSLOG if ( g_bLogSyslog && sFmt ) { const int levels[] = { LOG_EMERG, LOG_WARNING, LOG_INFO, LOG_DEBUG, LOG_DEBUG, LOG_DEBUG }; vsyslog ( levels[eLevel], sFmt, ap ); } #endif if ( g_iLogFile<0 && !g_bService ) return; // format the banner char sTimeBuf[128]; sphFormatCurrentTime ( sTimeBuf, sizeof(sTimeBuf) ); const char * sBanner = ""; if ( sFmt==NULL ) eLevel = eLastLevel; if ( eLevel==SPH_LOG_FATAL ) sBanner = "FATAL: "; if ( eLevel==SPH_LOG_WARNING ) sBanner = "WARNING: "; if ( eLevel>=SPH_LOG_DEBUG ) sBanner = "DEBUG: "; char sBuf [ 1024 ]; snprintf ( sBuf, sizeof(sBuf)-1, "[%s] [%5d] ", sTimeBuf, (int)getpid() ); char * sTtyBuf = sBuf + strlen(sBuf); strncpy ( sTtyBuf, sBanner, 32 ); // 32 is arbitrary; just something that is enough and keeps lint happy int iLen = strlen(sBuf); // format the message if ( sFmt ) vsnprintf ( sBuf+iLen, sizeof(sBuf)-iLen-1, sFmt, ap ); // catch dupes DWORD uEntry = sFmt ? sphCRC32 ( (const BYTE*)( sBuf+iLen ) ) : 0; int64_t tmNow = sphMicroTimer(); // accumulate while possible if ( sFmt && eLevel==eLastLevel && uEntry==uLastEntry && iLastRepeats=tmLastStamp+FLUSH_THRESH_TIME ) ) { // flush if we actually have something to flush, and // case 1: got a message we can't accumulate // case 2: got a periodic flush and been otherwise idle for a thresh period char sLast[256]; strncpy ( sLast, sBuf, iLen ); snprintf ( sLast+iLen, sizeof(sLast)-iLen, "last message repeated %d times", iLastRepeats ); sphLogEntry ( eLastLevel, sLast, sLast + ( sTtyBuf-sBuf ) ); tmLastStamp = tmNow; iLastRepeats = 0; eLastLevel = SPH_LOG_INFO; uLastEntry = 0; } // was that a flush-only call? if ( !sFmt ) return; tmLastStamp = tmNow; iLastRepeats = 0; eLastLevel = eLevel; uLastEntry = uEntry; // do the logging sphLogEntry ( eLevel, sBuf, sTtyBuf ); } void sphFatal ( const char * sFmt, ... ) __attribute__ ( ( format ( printf, 1, 2 ) ) ); void sphFatal ( const char * sFmt, ... ) { va_list ap; va_start ( ap, sFmt ); sphLog ( SPH_LOG_FATAL, sFmt, ap ); va_end ( ap ); Shutdown (); exit ( 1 ); } #if !USE_WINDOWS static CSphString GetNamedPipeName ( int iPid ) { CSphString sRes; sRes.SetSprintf ( "/tmp/searchd_%d", iPid ); return sRes; } #endif void LogWarning ( const char * sWarning ) { sphWarning ( "%s", sWarning ); } ///////////////////////////////////////////////////////////////////////////// struct StrBuf_t { protected: char m_sBuf [ 2048 ]; char * m_pBuf; int m_iLeft; public: StrBuf_t () { memset ( m_sBuf, 0, sizeof(m_sBuf) ); m_iLeft = sizeof(m_sBuf)-1; m_pBuf = m_sBuf; } const char * cstr () { return m_sBuf; } int GetLength () { return sizeof(m_sBuf)-1-m_iLeft; } bool Append ( const char * s, bool bWhole ) { if ( !s ) return false; int iLen = strlen(s); if ( bWhole && m_iLeft m_dLog; public: void Submit ( const char * sIndex, const char * sError ) { SearchFailure_t & tEntry = m_dLog.Add (); tEntry.m_sIndex = sIndex; tEntry.m_sError = sError; } void SubmitEx ( const char * sIndex, const char * sTemplate, ... ) __attribute__ ( ( format ( printf, 3, 4 ) ) ) { SearchFailure_t & tEntry = m_dLog.Add (); va_list ap; va_start ( ap, sTemplate ); tEntry.m_sIndex = sIndex; tEntry.m_sError.SetSprintfVa ( sTemplate, ap ); va_end ( ap ); } public: bool IsEmpty () { return m_dLog.GetLength()==0; } void BuildReport ( StrBuf_t & sReport ) { if ( IsEmpty() ) return; // collapse same messages m_dLog.Uniq (); int iSpanStart = 0; for ( int i=1; i<=m_dLog.GetLength(); i++ ) { // keep scanning while error text is the same if ( i!=m_dLog.GetLength() ) if ( m_dLog[i].m_sError==m_dLog[i-1].m_sError ) continue; // build current span StrBuf_t sSpan; if ( iSpanStart ) sSpan += "; "; sSpan += "index "; for ( int j=iSpanStart; j & dChildren ) { ARRAY_FOREACH ( i, dChildren ) { int iPID = dChildren[i]; int iStatus = 0; if ( iPID>0 && waitpid ( iPID, &iStatus, WNOHANG )==iPID && ( WIFEXITED ( iStatus ) || WIFSIGNALED ( iStatus ) ) ) iPID = 0; if ( iPID<=0 ) dChildren.RemoveFast ( i-- ); } } #endif void Shutdown () { bool bAttrsSaveOk = true; // some head-only shutdown procedures if ( g_bHeadDaemon ) { const int iShutWaitPeriod = 3000000; if ( g_eWorkers==MPM_THREADS ) { // tell flush-rt thread to shutdown, and wait until it does g_bRtFlushShutdown = true; sphThreadJoin ( &g_tRtFlushThread ); // tell rotation thread to shutdown, and wait until it does g_bRotateShutdown = true; sphThreadJoin ( &g_tRotateThread ); g_tRotateQueueMutex.Done(); g_tRotateConfigMutex.Done(); int64_t tmShutStarted = sphMicroTimer(); // stop search threads; up to 3 seconds long while ( g_dThd.GetLength() > 0 && ( sphMicroTimer()-tmShutStarted )0 && ( sphMicroTimer()-tmShutStarted )SaveAttributes() ) { sphWarning ( "index %s: attrs save failed: %s", it.GetKey().cstr(), tServed.m_pIndex->GetLastError().cstr() ); bAttrsSaveOk = false; } } // unlock indexes and release locks if needed for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) it.Get().m_pIndex->Unlock(); g_pIndexes->Reset(); // clear shut down of rt indexes + binlog g_tDistLock.Done(); SafeDelete ( g_pIndexes ); sphRTDone(); SphCrashLogger_c::Done(); sphShutdownWordforms (); #if USE_PYTHON cftShutdown(); //clean up #endif } ARRAY_FOREACH ( i, g_dListeners ) if ( g_dListeners[i].m_iSock>=0 ) sphSockClose ( g_dListeners[i].m_iSock ); #if USE_WINDOWS CloseHandle ( g_hPipe ); #else if ( g_bHeadDaemon ) { const CSphString sPipeName = GetNamedPipeName ( getpid() ); const int hFile = ::open ( sPipeName.cstr(), O_WRONLY | O_NONBLOCK ); if ( hFile!=-1 ) { DWORD uStatus = bAttrsSaveOk; int iDummy; // to avoid gcc unused result warning iDummy = ::write ( hFile, &uStatus, sizeof(DWORD) ); ::close ( hFile ); } } #endif // remove pid if ( g_bHeadDaemon && g_sPidFile ) { ::close ( g_iPidFD ); ::unlink ( g_sPidFile ); } if ( g_bHeadDaemon ) sphInfo ( "shutdown complete" ); if ( g_bHeadDaemon ) sphThreadDone ( g_iLogFile ); } #if !USE_WINDOWS void sighup ( int ) { g_bGotSighup = 1; } void sigterm ( int ) { // tricky bit // we can't call exit() here because malloc()/free() are not re-entrant // we could call _exit() but let's try to die gracefully on TERM // and let signal sender wait and send KILL as needed g_bGotSigterm = 1; sphInterruptNow(); } void sigchld ( int ) { g_bGotSigchld = 1; } void sigusr1 ( int ) { g_bGotSigusr1 = 1; } #endif // !USE_WINDOWS struct QueryCopyState_t { BYTE * m_pDst; BYTE * m_pDstEnd; const BYTE * m_pSrc; const BYTE * m_pSrcEnd; }; // crash query handler static const int g_iQueryLineLen = 80; static const char g_dEncodeBase64[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; bool sphCopyEncodedBase64 ( QueryCopyState_t & tEnc ) { BYTE * pDst = tEnc.m_pDst; const BYTE * pDstBase = tEnc.m_pDst; const BYTE * pSrc = tEnc.m_pSrc; const BYTE * pDstEnd = tEnc.m_pDstEnd-5; const BYTE * pSrcEnd = tEnc.m_pSrcEnd-3; while ( pDst<=pDstEnd && pSrc<=pSrcEnd ) { // put line delimiter at max line length if ( ( ( pDst-pDstBase ) % g_iQueryLineLen )>( ( pDst-pDstBase+4 ) % g_iQueryLineLen ) ) *pDst++ = '\n'; // Convert to big endian DWORD uSrc = ( pSrc[0] << 16 ) | ( pSrc[1] << 8 ) | ( pSrc[2] ); pSrc += 3; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x00FC0000 ) >> 18 ]; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x0003F000 ) >> 12 ]; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x00000FC0 ) >> 6 ]; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x0000003F ) ]; } // there is a tail in source data and a room for it at destination buffer if ( pSrc> 18 ]; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x0003F000 ) >> 12 ]; *pDst++ = '='; *pDst++ = '='; } else if ( iLeft==2 ) { DWORD uSrc = ( pSrc[0]<<16 ) | ( pSrc[1] << 8 ); pSrc += 2; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x00FC0000 ) >> 18 ]; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x0003F000 ) >> 12 ]; *pDst++ = g_dEncodeBase64 [ ( uSrc & 0x00000FC0 ) >> 6 ]; *pDst++ = '='; } } tEnc.m_pDst = pDst; tEnc.m_pSrc = pSrc; return ( tEnc.m_pSrcpNextLine && pDst+1>8 ) & 0xff ), (BYTE)( tQuery.m_uCMD & 0xff ), (BYTE)( ( tQuery.m_uVer>>8 ) & 0xff ), (BYTE)( tQuery.m_uVer & 0xff ), (BYTE)( ( tQuery.m_iSize>>24 ) & 0xff ), (BYTE)( ( tQuery.m_iSize>>16 ) & 0xff ), (BYTE)( ( tQuery.m_iSize>>8 ) & 0xff ), (BYTE)( tQuery.m_iSize & 0xff ), *tQuery.m_pQuery }; QueryCopyState_t tHeaderState; tHeaderState.m_pDst = g_dCrashQueryBuff; tHeaderState.m_pDstEnd = g_dCrashQueryBuff + sizeof(g_dCrashQueryBuff); tHeaderState.m_pSrc = dHeader; tHeaderState.m_pSrcEnd = dHeader + sizeof(dHeader); pfnCopy ( tHeaderState ); assert ( tHeaderState.m_pSrc==tHeaderState.m_pSrcEnd ); tCopyState.m_pDst = tHeaderState.m_pDst; tCopyState.m_pSrc++; } else { pfnCopy = &sphCopySphinxQL; } while ( pfnCopy ( tCopyState ) ) { sphWrite ( g_iLogFile, g_dCrashQueryBuff, tCopyState.m_pDst-g_dCrashQueryBuff ); tCopyState.m_pDst = g_dCrashQueryBuff; // reset the destination buffer } assert ( tCopyState.m_pSrc==tCopyState.m_pSrcEnd ); int iLeft = tCopyState.m_pDst-g_dCrashQueryBuff; if ( iLeft>0 ) { sphWrite ( g_iLogFile, g_dCrashQueryBuff, iLeft ); } } // tail sphWrite ( g_iLogFile, g_sCrashedBannerTail, sizeof(g_sCrashedBannerTail)-1 ); sphSafeInfo ( g_iLogFile, "Sphinx " SPHINX_VERSION ); #if USE_WINDOWS // mini-dump reference int iMiniDumpLen = snprintf ( (char *)g_dCrashQueryBuff, sizeof(g_dCrashQueryBuff), "%s %s.%p.mdmp\n", g_sMinidumpBanner, g_sMinidump, tQuery.m_pQuery ); sphWrite ( g_iLogFile, g_dCrashQueryBuff, iMiniDumpLen ); snprintf ( (char *)g_dCrashQueryBuff, sizeof(g_dCrashQueryBuff), "%s.%p.mdmp", g_sMinidump, tQuery.m_pQuery ); #endif // log trace #if !USE_WINDOWS sphBacktrace ( g_iLogFile, g_bSafeTrace ); #else sphBacktrace ( pExc, (char *)g_dCrashQueryBuff ); #endif // threads table if ( g_eWorkers==MPM_THREADS ) { // FIXME? should we try to lock threads table somehow? sphSafeInfo ( g_iLogFile, "--- %d active threads ---", g_dThd.GetLength() ); ARRAY_FOREACH ( iThd, g_dThd ) { ThdDesc_t * pThd = g_dThd[iThd]; sphSafeInfo ( g_iLogFile, "thd %d, proto %s, state %s, command %s", iThd, g_dProtoNames[pThd->m_eProto], g_dThdStates[pThd->m_eThdState], pThd->m_sCommand ? pThd->m_sCommand : "-" ); } } // memory info #if SPH_ALLOCS_PROFILER sphWrite ( g_iLogFile, g_sMemoryStatBanner, sizeof ( g_sMemoryStatBanner )-1 ); sphMemStatDump ( g_iLogFile ); #endif sphSafeInfo ( g_iLogFile, "------- CRASH DUMP END -------" ); CRASH_EXIT; } void SphCrashLogger_c::SetLastQuery ( const BYTE * pQuery, int iSize, bool bMySQL, int uCmd, int uVer ) { SphCrashLogger_c * pLastQuery = &m_tLastQuery; if ( g_eWorkers==MPM_THREADS ) pLastQuery = (SphCrashLogger_c *)sphThreadGet ( m_tLastQueryTLS ); pLastQuery->m_pQuery = pQuery; pLastQuery->m_iSize = iSize; pLastQuery->m_uCMD = (WORD)uCmd; pLastQuery->m_uVer = (WORD)uVer; pLastQuery->m_bMySQL = bMySQL; } void SphCrashLogger_c::SetupTimePID () { char sTimeBuf[SPH_TIME_PID_MAX_SIZE]; sphFormatCurrentTime ( sTimeBuf, sizeof(sTimeBuf) ); g_iCrashInfoLen = snprintf ( g_sCrashInfo, SPH_TIME_PID_MAX_SIZE-1, "------- FATAL: CRASH DUMP -------\n[%s] [%5d]\n", sTimeBuf, (int)getpid() ); } void SphCrashLogger_c::SetupTLS () { if ( g_eWorkers!=MPM_THREADS ) return; Verify ( sphThreadSet ( m_tLastQueryTLS, this ) ); } void SetSignalHandlers () { SphCrashLogger_c::Init(); #if !USE_WINDOWS struct sigaction sa; sigfillset ( &sa.sa_mask ); sa.sa_flags = SA_NOCLDSTOP; bool bSignalsSet = false; for ( ;; ) { sa.sa_handler = sigterm; if ( sigaction ( SIGTERM, &sa, NULL )!=0 ) break; sa.sa_handler = sigterm; if ( sigaction ( SIGINT, &sa, NULL )!=0 ) break; sa.sa_handler = sighup; if ( sigaction ( SIGHUP, &sa, NULL )!=0 ) break; sa.sa_handler = sigusr1; if ( sigaction ( SIGUSR1, &sa, NULL )!=0 ) break; sa.sa_handler = sigchld; if ( sigaction ( SIGCHLD, &sa, NULL )!=0 ) break; sa.sa_handler = SIG_IGN; if ( sigaction ( SIGPIPE, &sa, NULL )!=0 ) break; sa.sa_flags |= SA_RESETHAND; sa.sa_handler = SphCrashLogger_c::HandleCrash; if ( sigaction ( SIGSEGV, &sa, NULL )!=0 ) break; sa.sa_handler = SphCrashLogger_c::HandleCrash; if ( sigaction ( SIGBUS, &sa, NULL )!=0 ) break; sa.sa_handler = SphCrashLogger_c::HandleCrash; if ( sigaction ( SIGABRT, &sa, NULL )!=0 ) break; sa.sa_handler = SphCrashLogger_c::HandleCrash; if ( sigaction ( SIGILL, &sa, NULL )!=0 ) break; sa.sa_handler = SphCrashLogger_c::HandleCrash; if ( sigaction ( SIGFPE, &sa, NULL )!=0 ) break; bSignalsSet = true; break; } if ( !bSignalsSet ) sphFatal ( "sigaction(): %s", strerror(errno) ); #else snprintf ( g_sMinidump, SPH_TIME_PID_MAX_SIZE-1, "%s.%d", g_sPidFile ? g_sPidFile : "", (int)getpid() ); SetUnhandledExceptionFilter ( SphCrashLogger_c::HandleCrash ); #endif } ///////////////////////////////////////////////////////////////////////////// // NETWORK STUFF ///////////////////////////////////////////////////////////////////////////// const int WIN32_PIPE_BUFSIZE = 32; #if USE_WINDOWS /// on Windows, the wrapper just prevents the warnings void sphFDSet ( int fd, fd_set * fdset ) { #pragma warning(disable:4127) // conditional expr is const #pragma warning(disable:4389) // signed/unsigned mismatch FD_SET ( fd, fdset ); #pragma warning(default:4127) // conditional expr is const #pragma warning(default:4389) // signed/unsigned mismatch } #else // !USE_WINDOWS #define SPH_FDSET_OVERFLOW(_fd) ( (_fd)<0 || (_fd)>=(int)FD_SETSIZE ) /// on UNIX, we also check that the descript won't corrupt the stack void sphFDSet ( int fd, fd_set * set ) { if ( SPH_FDSET_OVERFLOW(fd) ) sphFatal ( "sphFDSet() failed fd=%d, FD_SETSIZE=%d", fd, FD_SETSIZE ); else FD_SET ( fd, set ); } #endif // USE_WINDOWS const char * sphSockError ( int iErr=0 ) { #if USE_WINDOWS if ( iErr==0 ) iErr = WSAGetLastError (); static char sBuf [ 256 ]; _snprintf ( sBuf, sizeof(sBuf), "WSA error %d", iErr ); return sBuf; #else return strerror ( errno ); #endif } int sphSockGetErrno () { #if USE_WINDOWS return WSAGetLastError(); #else return errno; #endif } void sphSockSetErrno ( int iErr ) { #if USE_WINDOWS WSASetLastError ( iErr ); #else errno = iErr; #endif } int sphSockPeekErrno () { int iRes = sphSockGetErrno(); sphSockSetErrno ( iRes ); return iRes; } /// formats IP address given in network byte order into sBuffer /// returns the buffer char * sphFormatIP ( char * sBuffer, int iBufferSize, DWORD uAddress ) { const BYTE *a = (const BYTE *)&uAddress; snprintf ( sBuffer, iBufferSize, "%u.%u.%u.%u", a[0], a[1], a[2], a[3] ); return sBuffer; } static const bool GETADDR_STRICT = true; ///< strict check, will die with sphFatal() on failure DWORD sphGetAddress ( const char * sHost, bool bFatal=false ) { struct hostent * pHost = gethostbyname ( sHost ); if ( pHost==NULL || pHost->h_addrtype!=AF_INET ) { if ( bFatal ) sphFatal ( "no AF_INET address found for: %s", sHost ); return 0; } struct in_addr ** ppAddrs = (struct in_addr **)pHost->h_addr_list; assert ( ppAddrs[0] ); assert ( sizeof(DWORD)==pHost->h_length ); DWORD uAddr; memcpy ( &uAddr, ppAddrs[0], sizeof(DWORD) ); if ( ppAddrs[1] ) { char sBuf [ SPH_ADDRESS_SIZE ]; sphWarning ( "multiple addresses found for '%s', using the first one (ip=%s)", sHost, sphFormatIP ( sBuf, sizeof(sBuf), uAddr ) ); } return uAddr; } #if !USE_WINDOWS int sphCreateUnixSocket ( const char * sPath ) { static struct sockaddr_un uaddr; size_t len = strlen ( sPath ); if ( len + 1 > sizeof( uaddr.sun_path ) ) sphFatal ( "UNIX socket path is too long (len=%d)", (int)len ); sphInfo ( "listening on UNIX socket %s", sPath ); memset ( &uaddr, 0, sizeof(uaddr) ); uaddr.sun_family = AF_UNIX; memcpy ( uaddr.sun_path, sPath, len + 1 ); int iSock = socket ( AF_UNIX, SOCK_STREAM, 0 ); if ( iSock==-1 ) sphFatal ( "failed to create UNIX socket: %s", sphSockError() ); if ( unlink ( sPath )==-1 ) { if ( errno!=ENOENT ) sphFatal ( "unlink() on UNIX socket file failed: %s", sphSockError() ); } int iMask = umask ( 0 ); if ( bind ( iSock, (struct sockaddr *)&uaddr, sizeof(uaddr) )!=0 ) sphFatal ( "bind() on UNIX socket failed: %s", sphSockError() ); umask ( iMask ); return iSock; } #endif // !USE_WINDOWS int sphCreateInetSocket ( DWORD uAddr, int iPort ) { char sAddress[SPH_ADDRESS_SIZE]; sphFormatIP ( sAddress, SPH_ADDRESS_SIZE, uAddr ); if ( uAddr==htonl ( INADDR_ANY ) ) sphInfo ( "listening on all interfaces, port=%d", iPort ); else sphInfo ( "listening on %s:%d", sAddress, iPort ); static struct sockaddr_in iaddr; memset ( &iaddr, 0, sizeof(iaddr) ); iaddr.sin_family = AF_INET; iaddr.sin_addr.s_addr = uAddr; iaddr.sin_port = htons ( (short)iPort ); int iSock = socket ( AF_INET, SOCK_STREAM, 0 ); if ( iSock==-1 ) sphFatal ( "failed to create TCP socket: %s", sphSockError() ); int iOn = 1; if ( setsockopt ( iSock, SOL_SOCKET, SO_REUSEADDR, (char*)&iOn, sizeof(iOn) ) ) sphFatal ( "setsockopt() failed: %s", sphSockError() ); int iTries = 12; int iRes; do { iRes = bind ( iSock, (struct sockaddr *)&iaddr, sizeof(iaddr) ); if ( iRes==0 ) break; sphInfo ( "bind() failed on %s, retrying...", sAddress ); sphSleepMsec ( 3000 ); } while ( --iTries>0 ); if ( iRes ) sphFatal ( "bind() failed on %s: %s", sAddress, sphSockError() ); return iSock; } inline bool IsPortInRange ( int iPort ) { return ( iPort>0 ) && ( iPort<=0xFFFF ); } void CheckPort ( int iPort ) { if ( !IsPortInRange(iPort) ) sphFatal ( "port %d is out of range", iPort ); } ProtocolType_e ProtoByName ( const CSphString & sProto ) { if ( sProto=="sphinx" ) return PROTO_SPHINX; else if ( sProto=="mysql41" ) return PROTO_MYSQL41; sphFatal ( "unknown listen protocol type '%s'", sProto.cstr() ? sProto.cstr() : "(NULL)" ); // funny magic // MSVC -O2 whines about unreachable code // everyone else whines about missing return value #if !(USE_WINDOWS && defined(NDEBUG)) return PROTO_SPHINX; #endif } struct ListenerDesc_t { ProtocolType_e m_eProto; CSphString m_sUnix; DWORD m_uIP; int m_iPort; }; ListenerDesc_t ParseListener ( const char * sSpec ) { ListenerDesc_t tRes; tRes.m_eProto = PROTO_SPHINX; tRes.m_sUnix = ""; tRes.m_uIP = htonl ( INADDR_ANY ); tRes.m_iPort = SPHINXAPI_PORT; // split by colon int iParts = 0; CSphString sParts[3]; const char * sPart = sSpec; for ( const char * p = sSpec; ; p++ ) if ( *p=='\0' || *p==':' ) { if ( iParts==3 ) sphFatal ( "invalid listen format (too many fields)" ); sParts[iParts++].SetBinary ( sPart, p-sPart ); if ( !*p ) break; // bail out on zero sPart = p+1; } assert ( iParts>=1 && iParts<=3 ); // handle UNIX socket case // might be either name on itself (1 part), or name+protocol (2 parts) sPart = sParts[0].cstr(); if ( sPart[0]=='/' ) { if ( iParts>2 ) sphFatal ( "invalid listen format (too many fields)" ); if ( iParts==2 ) tRes.m_eProto = ProtoByName ( sParts[1] ); #if USE_WINDOWS sphFatal ( "UNIX sockets are not supported on Windows" ); #else tRes.m_sUnix = sPart; return tRes; #endif } // check if it all starts with a valid port number sPart = sParts[0].cstr(); int iLen = strlen(sPart); bool bAllDigits = true; for ( int i=0; i0 ); int64_t tmMaxTimer = sphMicroTimer() + I64C(1000000)*Max ( 1, iReadTimeout ); // in microseconds int iLeftBytes = iLen; // bytes to read left char * pBuf = (char*) buf; int iRes = -1, iErr = 0; while ( iLeftBytes>0 ) { int64_t tmMicroLeft = tmMaxTimer - sphMicroTimer(); if ( tmMicroLeft<=0 ) break; // timed out fd_set fdRead; FD_ZERO ( &fdRead ); sphFDSet ( iSock, &fdRead ); fd_set fdExcept; FD_ZERO ( &fdExcept ); sphFDSet ( iSock, &fdExcept ); #if USE_WINDOWS // Windows EINTR emulation // Ctrl-C will not interrupt select on Windows, so let's handle that manually // forcibly limit select() to 100 ms, and check flag afterwards if ( bIntr ) tmMicroLeft = Min ( tmMicroLeft, 100000 ); #endif struct timeval tv; tv.tv_sec = (int)( tmMicroLeft / 1000000 ); tv.tv_usec = (int)( tmMicroLeft % 1000000 ); iRes = ::select ( iSock+1, &fdRead, NULL, &fdExcept, &tv ); // if there was EINTR, retry // if any other error, bail if ( iRes==-1 ) { // only let SIGTERM (of all them) to interrupt, and only if explicitly allowed iErr = sphSockGetErrno(); if ( iErr==EINTR && !( g_bGotSigterm && bIntr )) continue; if ( iErr==EINTR ) sphLogDebug ( "sphSockRead: select got SIGTERM, exit -1" ); sphSockSetErrno ( iErr ); return -1; } // if there was a timeout, report it as an error if ( iRes==0 ) { #if USE_WINDOWS // Windows EINTR emulation if ( bIntr ) { // got that SIGTERM if ( g_bGotSigterm ) { sphLogDebug ( "sphSockRead: got SIGTERM emulation on Windows, exit -1" ); sphSockSetErrno ( EINTR ); return -1; } // timeout might not be fully over just yet, so re-loop continue; } #endif sphSockSetErrno ( ETIMEDOUT ); return -1; } // try to receive next chunk iRes = sphSockRecv ( iSock, pBuf, iLeftBytes ); // if there was eof, we're done if ( iRes==0 ) { sphSockSetErrno ( ECONNRESET ); return -1; } // if there was EINTR, retry // if any other error, bail if ( iRes==-1 ) { // only let SIGTERM (of all them) to interrupt, and only if explicitly allowed iErr = sphSockGetErrno(); if ( iErr==EINTR && !( g_bGotSigterm && bIntr )) continue; if ( iErr==EINTR ) sphLogDebug ( "sphSockRead: select got SIGTERM, exit -1" ); sphSockSetErrno ( iErr ); return -1; } // update pBuf += iRes; iLeftBytes -= iRes; // avoid partial buffer loss in case of signal during the 2nd (!) read bIntr = false; } // if there was a timeout, report it as an error if ( iLeftBytes!=0 ) { sphSockSetErrno ( ETIMEDOUT ); return -1; } return iLen; } ///////////////////////////////////////////////////////////////////////////// // NETWORK BUFFERS ///////////////////////////////////////////////////////////////////////////// /// fixed-memory response buffer /// tracks usage, and flushes to network when necessary class NetOutputBuffer_c { public: explicit NetOutputBuffer_c ( int iSock ); bool SendInt ( int iValue ) { return SendT ( htonl ( iValue ) ); } bool SendDword ( DWORD iValue ) { return SendT ( htonl ( iValue ) ); } bool SendLSBDword ( DWORD v ) { SendByte ( (BYTE)( v&0xff ) ); SendByte ( (BYTE)( (v>>8)&0xff ) ); SendByte ( (BYTE)( (v>>16)&0xff ) ); return SendByte ( (BYTE)( (v>>24)&0xff) ); } bool SendWord ( WORD iValue ) { return SendT ( htons ( iValue ) ); } bool SendUint64 ( uint64_t iValue ) { SendT ( htonl ( (DWORD)(iValue>>32) ) ); return SendT ( htonl ( (DWORD)(iValue&0xffffffffUL) ) ); } bool SendFloat ( float fValue ) { return SendT ( htonl ( sphF2DW ( fValue ) ) ); } bool SendByte ( BYTE uValue ) { return SendT ( uValue ); } #if USE_64BIT bool SendDocid ( SphDocID_t iValue ) { return SendUint64 ( iValue ); } #else bool SendDocid ( SphDocID_t iValue ) { return SendDword ( iValue ); } #endif bool SendString ( const char * sStr ); bool SendMysqlString ( const char * sStr ); bool Flush (); bool GetError () { return m_bError; } int GetSentCount () { return m_iSent; } protected: BYTE m_dBuffer[8192]; ///< my buffer BYTE * m_pBuffer; ///< my current buffer position int m_iSock; ///< my socket bool m_bError; ///< if there were any write errors int m_iSent; protected: bool SetError ( bool bValue ); ///< set error flag bool FlushIf ( int iToAdd ); ///< flush if there's not enough free space to add iToAdd bytes public: bool SendBytes ( const void * pBuf, int iLen ); ///< (was) protected to avoid network-vs-host order bugs template < typename T > bool SendT ( T tValue ); ///< (was) protected to avoid network-vs-host order bugs }; /// generic request buffer class InputBuffer_c { public: InputBuffer_c ( const BYTE * pBuf, int iLen ); virtual ~InputBuffer_c () {} int GetInt () { return ntohl ( GetT () ); } WORD GetWord () { return ntohs ( GetT () ); } DWORD GetDword () { return ntohl ( GetT () ); } DWORD GetLSBDword () { return GetByte() + ( GetByte()<<8 ) + ( GetByte()<<16 ) + ( GetByte()<<24 ); } uint64_t GetUint64() { uint64_t uRes = GetDword(); return (uRes<<32)+GetDword(); } BYTE GetByte () { return GetT (); } float GetFloat () { return sphDW2F ( ntohl ( GetT () ) ); } CSphString GetString (); CSphString GetRawString ( int iLen ); int GetDwords ( DWORD ** pBuffer, int iMax, const char * sErrorTemplate ); bool GetError () { return m_bError; } template < typename T > bool GetDwords ( CSphVector & dBuffer, int iMax, const char * sErrorTemplate ); template < typename T > bool GetQwords ( CSphVector & dBuffer, int iMax, const char * sErrorTemplate ); virtual void SendErrorReply ( const char *, ... ) __attribute__ ( ( format ( printf, 2, 3 ) ) ) = 0; protected: const BYTE * m_pBuf; const BYTE * m_pCur; bool m_bError; int m_iLen; protected: void SetError ( bool bError ) { m_bError = bError; } bool GetBytes ( void * pBuf, int iLen ); template < typename T > T GetT (); }; /// simple memory request buffer class MemInputBuffer_c : public InputBuffer_c { public: MemInputBuffer_c ( const BYTE * pBuf, int iLen ) : InputBuffer_c ( pBuf, iLen ) {} virtual void SendErrorReply ( const char *, ... ) __attribute__ ( ( format ( printf, 2, 3 ) ) ) {} }; /// simple network request buffer class NetInputBuffer_c : public InputBuffer_c { public: explicit NetInputBuffer_c ( int iSock ); virtual ~NetInputBuffer_c (); bool ReadFrom ( int iLen, int iTimeout, bool bIntr=false, bool bAppend=false ); bool ReadFrom ( int iLen ) { return ReadFrom ( iLen, g_iReadTimeout ); } virtual void SendErrorReply ( const char *, ... ) __attribute__ ( ( format ( printf, 2, 3 ) ) ); const BYTE * GetBufferPtr () const { return m_pBuf; } bool IsIntr () const { return m_bIntr; } protected: static const int NET_MINIBUFFER_SIZE = 4096; int m_iSock; bool m_bIntr; BYTE m_dMinibufer[NET_MINIBUFFER_SIZE]; int m_iMaxibuffer; BYTE * m_pMaxibuffer; }; ///////////////////////////////////////////////////////////////////////////// NetOutputBuffer_c::NetOutputBuffer_c ( int iSock ) : m_pBuffer ( m_dBuffer ) , m_iSock ( iSock ) , m_bError ( false ) , m_iSent ( 0 ) { assert ( m_iSock>0 ); } template < typename T > bool NetOutputBuffer_c::SendT ( T tValue ) { if ( m_bError ) return false; FlushIf ( sizeof(T) ); sphUnalignedWrite ( m_pBuffer, tValue ); m_pBuffer += sizeof(T); assert ( m_pBuffer>8 ); return (void*)pOutput; } if ( iValue<=0xFFFFFF ) { *pOutput++ = '\xFD'; *pOutput++ = (char)iValue; *pOutput++ = (char)( iValue>>8 ); *pOutput++ = (char)( iValue>>16 ); return (void *) pOutput; } *pOutput++ = '\xFE'; *pOutput++ = (char)iValue; *pOutput++ = (char)( iValue>>8 ); *pOutput++ = (char)( iValue>>16 ); *pOutput++ = (char)( iValue>>24 ); *pOutput++ = 0; *pOutput++ = 0; *pOutput++ = 0; *pOutput++ = 0; return (void*)pOutput; } bool NetOutputBuffer_c::SendMysqlString ( const char * sStr ) { if ( m_bError ) return false; int iLen = strlen(sStr); BYTE dBuf[12]; BYTE * pBuf = (BYTE*) MysqlPack ( dBuf, iLen ); SendBytes ( dBuf, (int)( pBuf-dBuf ) ); return SendBytes ( sStr, iLen ); } bool NetOutputBuffer_c::SendBytes ( const void * pBuf, int iLen ) { BYTE * pMy = (BYTE*)pBuf; while ( iLen>0 && !m_bError ) { int iLeft = sizeof(m_dBuffer) - ( m_pBuffer - m_dBuffer ); if ( iLen<=iLeft ) { memcpy ( m_pBuffer, pMy, iLen ); m_pBuffer += iLen; break; } memcpy ( m_pBuffer, pMy, iLeft ); m_pBuffer += iLeft; Flush (); pMy += iLeft; iLen -= iLeft; } return !m_bError; } bool NetOutputBuffer_c::Flush () { if ( m_bError ) return false; int iLen = m_pBuffer-m_dBuffer; if ( iLen==0 ) return true; if ( g_bGotSigterm ) sphLogDebug ( "SIGTERM in NetOutputBuffer::Flush" ); assert ( iLen>0 ); assert ( iLen<=(int)sizeof(m_dBuffer) ); char * pBuffer = (char *)&m_dBuffer[0]; const int64_t tmMaxTimer = sphMicroTimer() + g_iWriteTimeout*1000000; // in microseconds while ( !m_bError ) { int iRes = sphSockSend ( m_iSock, pBuffer, iLen ); if ( iRes < 0 ) { int iErrno = sphSockGetErrno(); if ( iErrno==EINTR ) // interrupted before any data was sent; just loop continue; if ( iErrno!=EAGAIN ) { sphWarning ( "send() failed: %d: %s", iErrno, sphSockError(iErrno) ); m_bError = true; break; } } else { m_iSent += iRes; pBuffer += iRes; iLen -= iRes; if ( iLen==0 ) break; } int64_t tmMicroLeft = tmMaxTimer - sphMicroTimer(); if ( tmMicroLeft>0 ) { fd_set fdWrite; FD_ZERO ( &fdWrite ); sphFDSet ( m_iSock, &fdWrite ); struct timeval tvTimeout; tvTimeout.tv_sec = (int)( tmMicroLeft / 1000000 ); tvTimeout.tv_usec = (int)( tmMicroLeft % 1000000 ); iRes = select ( m_iSock+1, NULL, &fdWrite, NULL, &tvTimeout ); } else iRes = 0; switch ( iRes ) { case 1: // ready for writing break; case 0: // timed out { sphWarning ( "timed out while trying to flush network buffers" ); m_bError = true; break; } case -1: // error { int iErrno = sphSockGetErrno(); if ( iErrno==EINTR ) break; sphWarning ( "select() failed: %d: %s", iErrno, sphSockError(iErrno) ); m_bError = true; break; } } } m_pBuffer = m_dBuffer; return !m_bError; } bool NetOutputBuffer_c::FlushIf ( int iToAdd ) { if ( ( m_pBuffer+iToAdd )>=( m_dBuffer+sizeof(m_dBuffer) ) ) return Flush (); return !m_bError; } ///////////////////////////////////////////////////////////////////////////// InputBuffer_c::InputBuffer_c ( const BYTE * pBuf, int iLen ) : m_pBuf ( pBuf ) , m_pCur ( pBuf ) , m_bError ( !pBuf || iLen<0 ) , m_iLen ( iLen ) {} template < typename T > T InputBuffer_c::GetT () { if ( m_bError || ( m_pCur+sizeof(T) > m_pBuf+m_iLen ) ) { SetError ( true ); return 0; } T iRes = sphUnalignedRead ( *(T*)m_pCur ); m_pCur += sizeof(T); return iRes; } CSphString InputBuffer_c::GetString () { CSphString sRes; int iLen = GetInt (); if ( m_bError || iLen<0 || iLen>g_iMaxPacketSize || ( m_pCur+iLen > m_pBuf+m_iLen ) ) { SetError ( true ); return sRes; } sRes.SetBinary ( (char*)m_pCur, iLen ); m_pCur += iLen; return sRes; } CSphString InputBuffer_c::GetRawString ( int iLen ) { CSphString sRes; if ( m_bError || iLen<0 || iLen>g_iMaxPacketSize || ( m_pCur+iLen > m_pBuf+m_iLen ) ) { SetError ( true ); return sRes; } sRes.SetBinary ( (char*)m_pCur, iLen ); m_pCur += iLen; return sRes; } bool InputBuffer_c::GetBytes ( void * pBuf, int iLen ) { assert ( pBuf ); assert ( iLen>0 && iLen<=g_iMaxPacketSize ); if ( m_bError || ( m_pCur+iLen > m_pBuf+m_iLen ) ) { SetError ( true ); return false; } memcpy ( pBuf, m_pCur, iLen ); m_pCur += iLen; return true; } int InputBuffer_c::GetDwords ( DWORD ** ppBuffer, int iMax, const char * sErrorTemplate ) { assert ( ppBuffer ); assert ( !(*ppBuffer) ); int iCount = GetInt (); if ( iCount<0 || iCount>iMax ) { SendErrorReply ( sErrorTemplate, iCount, iMax ); SetError ( true ); return -1; } if ( iCount ) { assert ( !(*ppBuffer) ); // potential leak (*ppBuffer) = new DWORD [ iCount ]; if ( !GetBytes ( (*ppBuffer), sizeof(DWORD)*iCount ) ) { SafeDeleteArray ( (*ppBuffer) ); return -1; } for ( int i=0; i bool InputBuffer_c::GetDwords ( CSphVector & dBuffer, int iMax, const char * sErrorTemplate ) { int iCount = GetInt (); if ( iCount<0 || iCount>iMax ) { SendErrorReply ( sErrorTemplate, iCount, iMax ); SetError ( true ); return false; } dBuffer.Resize ( iCount ); ARRAY_FOREACH ( i, dBuffer ) dBuffer[i] = GetDword (); if ( m_bError ) dBuffer.Reset (); return !m_bError; } template < typename T > bool InputBuffer_c::GetQwords ( CSphVector & dBuffer, int iMax, const char * sErrorTemplate ) { int iCount = GetInt (); if ( iCount<0 || iCount>iMax ) { SendErrorReply ( sErrorTemplate, iCount, iMax ); SetError ( true ); return false; } dBuffer.Resize ( iCount ); ARRAY_FOREACH ( i, dBuffer ) dBuffer[i] = GetUint64 (); if ( m_bError ) dBuffer.Reset (); return !m_bError; } ///////////////////////////////////////////////////////////////////////////// NetInputBuffer_c::NetInputBuffer_c ( int iSock ) : InputBuffer_c ( m_dMinibufer, sizeof(m_dMinibufer) ) , m_iSock ( iSock ) , m_bIntr ( false ) , m_iMaxibuffer ( 0 ) , m_pMaxibuffer ( NULL ) {} NetInputBuffer_c::~NetInputBuffer_c () { SafeDeleteArray ( m_pMaxibuffer ); } bool NetInputBuffer_c::ReadFrom ( int iLen, int iTimeout, bool bIntr, bool bAppend ) { assert (!( bAppend && m_pCur!=m_pBuf && m_pBuf!=m_pMaxibuffer )); // only allow appends to untouched maxi-buffers int iCur = bAppend ? m_iLen : 0; m_bIntr = false; if ( iLen<=0 || iLen>g_iMaxPacketSize || m_iSock<0 ) return false; BYTE * pBuf = m_dMinibufer + iCur; if ( ( iCur+iLen )>NET_MINIBUFFER_SIZE ) { if ( ( iCur+iLen )>m_iMaxibuffer ) { if ( iCur ) { BYTE * pNew = new BYTE [ iCur+iLen ]; memcpy ( pNew, m_pCur, iCur ); SafeDeleteArray ( m_pMaxibuffer ); m_pMaxibuffer = pNew; m_iMaxibuffer = iCur+iLen; } else { SafeDeleteArray ( m_pMaxibuffer ); m_pMaxibuffer = new BYTE [ iLen ]; m_iMaxibuffer = iLen; } } pBuf = m_pMaxibuffer; } m_pCur = m_pBuf = pBuf; int iGot = sphSockRead ( m_iSock, pBuf + iCur, iLen, iTimeout, bIntr ); if ( g_bGotSigterm ) { sphLogDebug ( "NetInputBuffer_c::ReadFrom: got SIGTERM, return false" ); m_bError = true; m_bIntr = true; return false; } m_bError = ( iGot!=iLen ); m_bIntr = m_bError && ( sphSockPeekErrno()==EINTR ); m_iLen = m_bError ? 0 : iCur+iLen; return !m_bError; } void NetInputBuffer_c::SendErrorReply ( const char * sTemplate, ... ) { char dBuf [ 2048 ]; const int iHeaderLen = 12; const int iMaxStrLen = sizeof(dBuf) - iHeaderLen - 1; // fill header WORD * p0 = (WORD*)&dBuf[0]; p0[0] = htons ( SEARCHD_ERROR ); // error code p0[1] = 0; // version doesn't matter // fill error string char * sBuf = dBuf + iHeaderLen; va_list ap; va_start ( ap, sTemplate ); vsnprintf ( sBuf, iMaxStrLen, sTemplate, ap ); va_end ( ap ); sBuf[iMaxStrLen] = '\0'; int iStrLen = strlen(sBuf); // fixup lengths DWORD * p4 = (DWORD*)&dBuf[4]; p4[0] = htonl ( 4+iStrLen ); p4[1] = htonl ( iStrLen ); // send! sphSockSend ( m_iSock, dBuf, iHeaderLen+iStrLen ); // --console logging if ( g_bOptNoDetach && g_eLogFormat!=LOG_FORMAT_SPHINXQL ) sphInfo ( "query error: %s", sBuf ); } // fix MSVC 2005 fuckup #if USE_WINDOWS #pragma conform(forScope,on) #endif ///////////////////////////////////////////////////////////////////////////// // DISTRIBUTED QUERIES ///////////////////////////////////////////////////////////////////////////// /// remote agent descriptor (stored in a global hash) struct AgentDesc_t { CSphString m_sHost; ///< remote searchd host int m_iPort; ///< remote searchd port, 0 if local CSphString m_sPath; ///< local searchd UNIX socket path CSphString m_sIndexes; ///< remote index names to query bool m_bBlackhole; ///< blackhole agent flag int m_iFamily; ///< TCP or UNIX socket DWORD m_uAddr; ///< IP address int m_iStatsIndex; ///< index into global searchd stats array public: AgentDesc_t () : m_iPort ( -1 ) , m_bBlackhole ( false ) , m_iFamily ( AF_INET ) , m_uAddr ( 0 ) , m_iStatsIndex ( -1 ) {} }; /// remote agent state enum AgentState_e { AGENT_UNUSED, ///< agent is unused for this request AGENT_CONNECT, ///< connecting to agent AGENT_HELLO, ///< waiting for "VER x" hello AGENT_QUERY, ///< query sent, waiting for reply AGENT_PREREPLY, ///< query sent, activity detected, need to read reply AGENT_REPLY, ///< reading reply AGENT_RETRY ///< should retry }; /// remote agent connection (local per-query state) struct AgentConn_t : public AgentDesc_t { int m_iSock; ///< socket number, -1 if not connected AgentState_e m_eState; ///< current state bool m_bSuccess; ///< whether last request was succesful (ie. there are available results) CSphString m_sFailure; ///< failure message int m_iReplyStatus; ///< reply status code int m_iReplySize; ///< how many reply bytes are there int m_iReplyRead; ///< how many reply bytes are alredy received BYTE * m_pReplyBuf; ///< reply buffer CSphVector m_dResults; ///< multi-query results int64_t m_iWall; ///< wall time spent vs this agent public: AgentConn_t () : m_iSock ( -1 ) , m_eState ( AGENT_UNUSED ) , m_bSuccess ( false ) , m_iReplyStatus ( -1 ) , m_iReplySize ( 0 ) , m_iReplyRead ( 0 ) , m_pReplyBuf ( NULL ) , m_iWall ( 0 ) {} ~AgentConn_t () { Close (); } void Close () { SafeDeleteArray ( m_pReplyBuf ); if ( m_iSock>0 ) { sphSockClose ( m_iSock ); m_iSock = -1; if ( m_eState!=AGENT_RETRY ) m_eState = AGENT_UNUSED; } m_iWall += sphMicroTimer (); } CSphString GetName() const { CSphString sName; switch ( m_iFamily ) { case AF_INET: sName.SetSprintf ( "%s:%u", m_sHost.cstr(), m_iPort ); break; case AF_UNIX: sName = m_sPath; break; } return sName; } AgentConn_t & operator = ( const AgentDesc_t & rhs ) { m_sHost = rhs.m_sHost; m_iPort = rhs.m_iPort; m_sPath = rhs.m_sPath; m_sIndexes = rhs.m_sIndexes; m_bBlackhole = rhs.m_bBlackhole; m_iFamily = rhs.m_iFamily; m_uAddr = rhs.m_uAddr; m_iStatsIndex = rhs.m_iStatsIndex; return *this; } }; /// distributed index struct DistributedIndex_t { CSphVector m_dAgents; ///< remote agents CSphVector m_dLocal; ///< local indexes int m_iAgentConnectTimeout; ///< in msec int m_iAgentQueryTimeout; ///< in msec bool m_bToDelete; ///< should be deleted public: DistributedIndex_t () : m_iAgentConnectTimeout ( 1000 ) , m_iAgentQueryTimeout ( 3000 ) , m_bToDelete ( false ) {} }; /// global distributed index definitions hash static SmallStringHash_T < DistributedIndex_t > g_hDistIndexes; ///////////////////////////////////////////////////////////////////////////// struct IRequestBuilder_t : public ISphNoncopyable { virtual ~IRequestBuilder_t () {} // to avoid gcc4 warns virtual void BuildRequest ( const char * sIndexes, NetOutputBuffer_c & tOut, int iAgent ) const = 0; }; struct IReplyParser_t { virtual ~IReplyParser_t () {} // to avoid gcc4 warns virtual bool ParseReply ( MemInputBuffer_c & tReq, AgentConn_t & tAgent, int iAgent ) const = 0; }; #define AGENT_STATS_INC(_agent,_counter) \ if ( g_pStats && _agent.m_iStatsIndex>=0 && _agent.m_iStatsIndexm_dAgentStats [ _agent.m_iStatsIndex ]._counter++; \ g_tStatsMutex.Unlock (); \ } void ConnectToRemoteAgents ( CSphVector & dAgents, bool bRetryOnly ) { ARRAY_FOREACH ( iAgent, dAgents ) { AgentConn_t & tAgent = dAgents[iAgent]; if ( bRetryOnly && ( tAgent.m_eState!=AGENT_RETRY ) ) continue; tAgent.m_eState = AGENT_UNUSED; tAgent.m_bSuccess = false; socklen_t len = 0; struct sockaddr_storage ss; memset ( &ss, 0, sizeof(ss) ); ss.ss_family = (short)tAgent.m_iFamily; if ( ss.ss_family==AF_INET ) { struct sockaddr_in *in = (struct sockaddr_in *)&ss; in->sin_port = htons ( (unsigned short)tAgent.m_iPort ); in->sin_addr.s_addr = tAgent.m_uAddr; len = sizeof(*in); } #if !USE_WINDOWS else if ( ss.ss_family==AF_UNIX ) { struct sockaddr_un *un = (struct sockaddr_un *)&ss; snprintf ( un->sun_path, sizeof(un->sun_path), "%s", tAgent.m_sPath.cstr() ); len = sizeof(*un); } #endif tAgent.m_iSock = socket ( tAgent.m_iFamily, SOCK_STREAM, 0 ); if ( tAgent.m_iSock<0 ) { tAgent.m_sFailure.SetSprintf ( "socket() failed: %s", sphSockError() ); return; } if ( sphSetSockNB ( tAgent.m_iSock )<0 ) { tAgent.m_sFailure.SetSprintf ( "sphSetSockNB() failed: %s", sphSockError() ); return; } // count connects if ( g_pStats ) { g_tStatsMutex.Lock(); g_pStats->m_iAgentConnect++; if ( bRetryOnly ) g_pStats->m_iAgentRetry++; g_tStatsMutex.Unlock(); } if ( !bRetryOnly ) tAgent.m_iWall = 0; tAgent.m_iWall -= sphMicroTimer(); if ( connect ( tAgent.m_iSock, (struct sockaddr*)&ss, len )<0 ) { int iErr = sphSockGetErrno(); if ( iErr!=EINPROGRESS && iErr!=EINTR && iErr!=EWOULDBLOCK ) // check for EWOULDBLOCK is for winsock only { tAgent.Close (); tAgent.m_sFailure.SetSprintf ( "connect() failed: %s", sphSockError(iErr) ); tAgent.m_eState = AGENT_RETRY; // do retry on connect() failures AGENT_STATS_INC ( tAgent, m_iConnectFailures ); return; } else { // connection in progress tAgent.m_eState = AGENT_CONNECT; } } else { // socket connected, ready to read hello message tAgent.m_eState = AGENT_HELLO; } } } int QueryRemoteAgents ( CSphVector & dAgents, int iTimeout, const IRequestBuilder_t & tBuilder, int64_t * pWaited ) { int iAgents = 0; assert ( iTimeout>=0 ); int64_t tmMaxTimer = sphMicroTimer() + iTimeout*1000; // in microseconds for ( ;; ) { fd_set fdsRead, fdsWrite; FD_ZERO ( &fdsRead ); FD_ZERO ( &fdsWrite ); int iMax = 0; bool bDone = true; ARRAY_FOREACH ( i, dAgents ) { const AgentConn_t & tAgent = dAgents[i]; if ( tAgent.m_eState==AGENT_CONNECT || tAgent.m_eState==AGENT_HELLO || tAgent.m_eState==AGENT_QUERY ) { assert ( !tAgent.m_sPath.IsEmpty() || tAgent.m_iPort>0 ); assert ( tAgent.m_iSock>0 ); sphFDSet ( tAgent.m_iSock, ( tAgent.m_eState==AGENT_CONNECT ) ? &fdsWrite : &fdsRead ); iMax = Max ( iMax, tAgent.m_iSock ); if ( tAgent.m_eState!=AGENT_QUERY ) bDone = false; } } if ( bDone ) break; int64_t tmSelect = sphMicroTimer(); int64_t tmMicroLeft = tmMaxTimer - tmSelect; if ( tmMicroLeft<=0 ) break; // FIXME? what about iTimeout==0 case? struct timeval tvTimeout; tvTimeout.tv_sec = (int)( tmMicroLeft/ 1000000 ); // full seconds tvTimeout.tv_usec = (int)( tmMicroLeft % 1000000 ); // microseconds // we don't care about exceptfds; they're for OOB only int iSelected = select ( 1+iMax, &fdsRead, &fdsWrite, NULL, &tvTimeout ); if ( pWaited ) *pWaited += sphMicroTimer() - tmSelect; if ( iSelected<=0 ) continue; ARRAY_FOREACH ( i, dAgents ) { AgentConn_t & tAgent = dAgents[i]; // check if connection completed // tricky part, we MUST use write-set ONLY here at this check // even though we can't tell connect() success from just OS send buffer availability // but any check involving read-set just never ever completes, so... if ( tAgent.m_eState==AGENT_CONNECT && FD_ISSET ( tAgent.m_iSock, &fdsWrite ) ) { int iErr = 0; socklen_t iErrLen = sizeof(iErr); getsockopt ( tAgent.m_iSock, SOL_SOCKET, SO_ERROR, (char*)&iErr, &iErrLen ); if ( iErr ) { // connect() failure tAgent.m_sFailure.SetSprintf ( "connect() failed: %s", sphSockError(iErr) ); tAgent.Close (); AGENT_STATS_INC ( tAgent, m_iConnectFailures ); } else { // connect() success tAgent.m_eState = AGENT_HELLO; } continue; } // check if hello was received if ( tAgent.m_eState==AGENT_HELLO && FD_ISSET ( tAgent.m_iSock, &fdsRead ) ) { // read reply int iRemoteVer; int iRes = sphSockRecv ( tAgent.m_iSock, (char*)&iRemoteVer, sizeof(iRemoteVer) ); if ( iRes!=sizeof(iRemoteVer) ) { tAgent.Close (); if ( iRes<0 ) { // network error int iErr = sphSockGetErrno(); tAgent.m_sFailure.SetSprintf ( "handshake failure (errno=%d, msg=%s)", iErr, sphSockError(iErr) ); AGENT_STATS_INC ( tAgent, m_iNetworkErrors ); } else if ( iRes>0 ) { // incomplete reply tAgent.m_sFailure.SetSprintf ( "handshake failure (exp=%d, recv=%d)", (int)sizeof(iRemoteVer), iRes ); AGENT_STATS_INC ( tAgent, m_iWrongReplies ); } else { // agent closed the connection // this might happen in out-of-sync connect-accept case; so let's retry tAgent.m_sFailure = "handshake failure (connection was closed)"; tAgent.m_eState = AGENT_RETRY; AGENT_STATS_INC ( tAgent, m_iUnexpectedClose ); } continue; } iRemoteVer = ntohl ( iRemoteVer ); if (!( iRemoteVer==SPHINX_SEARCHD_PROTO || iRemoteVer==0x01000000UL ) ) // workaround for all the revisions that sent it in host order... { tAgent.m_sFailure.SetSprintf ( "handshake failure (unexpected protocol version=%d)", iRemoteVer ); AGENT_STATS_INC ( tAgent, m_iWrongReplies ); tAgent.Close (); continue; } // send request NetOutputBuffer_c tOut ( tAgent.m_iSock ); tBuilder.BuildRequest ( tAgent.m_sIndexes.cstr(), tOut, i ); tOut.Flush (); // FIXME! handle flush failure? tAgent.m_eState = AGENT_QUERY; iAgents++; continue; } // check if queried agent replied while we were querying others if ( tAgent.m_eState==AGENT_QUERY && FD_ISSET ( tAgent.m_iSock, &fdsRead ) ) { // do not account agent wall time from here; agent is probably ready tAgent.m_iWall += sphMicroTimer(); tAgent.m_eState = AGENT_PREREPLY; continue; } } } ARRAY_FOREACH ( i, dAgents ) { // check if connection timed out AgentConn_t & tAgent = dAgents[i]; if ( tAgent.m_eState!=AGENT_QUERY && tAgent.m_eState!=AGENT_UNUSED && tAgent.m_eState!=AGENT_RETRY && tAgent.m_eState!=AGENT_PREREPLY ) { // technically, we can end up here via two different routes // a) connect() never finishes in given time frame // b) agent actually accept()s the connection but keeps silence // however, there's no way to tell the two from each other // so we just account both cases as connect() failure tAgent.Close (); tAgent.m_sFailure.SetSprintf ( "connect() timed out" ); tAgent.m_eState = AGENT_RETRY; // do retry on connect() failures AGENT_STATS_INC ( tAgent, m_iTimeoutsConnect ); } } return iAgents; } int WaitForRemoteAgents ( CSphVector & dAgents, int iTimeout, IReplyParser_t & tParser, int64_t * pWaited ) { assert ( iTimeout>=0 ); int iAgents = 0; int64_t tmMaxTimer = sphMicroTimer() + iTimeout*1000; // in microseconds for ( ;; ) { fd_set fdsRead; FD_ZERO ( &fdsRead ); int iMax = 0; bool bDone = true; ARRAY_FOREACH ( iAgent, dAgents ) { AgentConn_t & tAgent = dAgents[iAgent]; if ( tAgent.m_bBlackhole ) continue; if ( tAgent.m_eState==AGENT_QUERY || tAgent.m_eState==AGENT_REPLY || tAgent.m_eState==AGENT_PREREPLY ) { assert ( !tAgent.m_sPath.IsEmpty() || tAgent.m_iPort>0 ); assert ( tAgent.m_iSock>0 ); sphFDSet ( tAgent.m_iSock, &fdsRead ); iMax = Max ( iMax, tAgent.m_iSock ); bDone = false; } } if ( bDone ) break; int64_t tmSelect = sphMicroTimer(); int64_t tmMicroLeft = tmMaxTimer - tmSelect; if ( tmMicroLeft<=0 ) // FIXME? what about iTimeout==0 case? break; struct timeval tvTimeout; tvTimeout.tv_sec = (int)( tmMicroLeft / 1000000 ); // full seconds tvTimeout.tv_usec = (int)( tmMicroLeft % 1000000 ); // microseconds int iSelected = select ( 1+iMax, &fdsRead, NULL, NULL, &tvTimeout ); if ( pWaited ) *pWaited += sphMicroTimer() - tmSelect; if ( iSelected<=0 ) continue; ARRAY_FOREACH ( iAgent, dAgents ) { AgentConn_t & tAgent = dAgents[iAgent]; if ( tAgent.m_bBlackhole ) continue; if (!( tAgent.m_eState==AGENT_QUERY || tAgent.m_eState==AGENT_REPLY || tAgent.m_eState==AGENT_PREREPLY )) continue; if ( !FD_ISSET ( tAgent.m_iSock, &fdsRead ) ) continue; // if there was no reply yet, read reply header bool bFailure = true; for ( ;; ) { if ( tAgent.m_eState==AGENT_QUERY || tAgent.m_eState==AGENT_PREREPLY ) { if ( tAgent.m_eState==AGENT_PREREPLY ) { tAgent.m_iWall -= sphMicroTimer(); tAgent.m_eState = AGENT_QUERY; } // try to read struct { WORD m_iStatus; WORD m_iVer; int m_iLength; } tReplyHeader; STATIC_SIZE_ASSERT ( tReplyHeader, 8 ); if ( sphSockRecv ( tAgent.m_iSock, (char*)&tReplyHeader, sizeof(tReplyHeader) )!=sizeof(tReplyHeader) ) { // bail out if failed tAgent.m_sFailure.SetSprintf ( "failed to receive reply header" ); AGENT_STATS_INC ( tAgent, m_iNetworkErrors ); break; } tReplyHeader.m_iStatus = ntohs ( tReplyHeader.m_iStatus ); tReplyHeader.m_iVer = ntohs ( tReplyHeader.m_iVer ); tReplyHeader.m_iLength = ntohl ( tReplyHeader.m_iLength ); // check the packet if ( tReplyHeader.m_iLength<0 || tReplyHeader.m_iLength>g_iMaxPacketSize ) // FIXME! add reasonable max packet len too { tAgent.m_sFailure.SetSprintf ( "invalid packet size (status=%d, len=%d, max_packet_size=%d)", tReplyHeader.m_iStatus, tReplyHeader.m_iLength, g_iMaxPacketSize ); AGENT_STATS_INC ( tAgent, m_iWrongReplies ); break; } // header received, switch the status assert ( tAgent.m_pReplyBuf==NULL ); tAgent.m_eState = AGENT_REPLY; tAgent.m_pReplyBuf = new BYTE [ tReplyHeader.m_iLength ]; tAgent.m_iReplySize = tReplyHeader.m_iLength; tAgent.m_iReplyRead = 0; tAgent.m_iReplyStatus = tReplyHeader.m_iStatus; if ( !tAgent.m_pReplyBuf ) { // bail out if failed tAgent.m_sFailure.SetSprintf ( "failed to alloc %d bytes for reply buffer", tAgent.m_iReplySize ); break; } } // if we are reading reply, read another chunk if ( tAgent.m_eState==AGENT_REPLY ) { // do read assert ( tAgent.m_iReplyRead0 ); assert ( tAgent.m_iReplyRead+iRes<=tAgent.m_iReplySize ); tAgent.m_iReplyRead += iRes; } // if reply was fully received, parse it if ( tAgent.m_eState==AGENT_REPLY && tAgent.m_iReplyRead==tAgent.m_iReplySize ) { MemInputBuffer_c tReq ( tAgent.m_pReplyBuf, tAgent.m_iReplySize ); // absolve thy former sins tAgent.m_sFailure = ""; // check for general errors/warnings first if ( tAgent.m_iReplyStatus==SEARCHD_WARNING ) { CSphString sAgentWarning = tReq.GetString (); tAgent.m_sFailure.SetSprintf ( "remote warning: %s", sAgentWarning.cstr() ); } else if ( tAgent.m_iReplyStatus==SEARCHD_RETRY ) { tAgent.m_eState = AGENT_RETRY; break; } else if ( tAgent.m_iReplyStatus!=SEARCHD_OK ) { CSphString sAgentError = tReq.GetString (); tAgent.m_sFailure.SetSprintf ( "remote error: %s", sAgentError.cstr() ); break; } // call parser if ( !tParser.ParseReply ( tReq, tAgent, iAgent ) ) break; // check if there was enough data if ( tReq.GetError() ) { tAgent.m_sFailure.SetSprintf ( "incomplete reply" ); AGENT_STATS_INC ( tAgent, m_iWrongReplies ); break; } // all is well iAgents++; tAgent.Close (); tAgent.m_bSuccess = true; } bFailure = false; break; } if ( bFailure ) { tAgent.Close (); tAgent.m_dResults.Reset (); } } } // close timed-out agents ARRAY_FOREACH ( iAgent, dAgents ) { AgentConn_t & tAgent = dAgents[iAgent]; if ( tAgent.m_bBlackhole ) tAgent.Close (); else if ( tAgent.m_eState==AGENT_QUERY || tAgent.m_eState==AGENT_PREREPLY ) { assert ( !tAgent.m_dResults.GetLength() ); assert ( !tAgent.m_bSuccess ); tAgent.Close (); tAgent.m_sFailure.SetSprintf ( "query timed out" ); AGENT_STATS_INC ( tAgent, m_iTimeoutsQuery ); } } return iAgents; } ///////////////////////////////////////////////////////////////////////////// // SEARCH HANDLER ///////////////////////////////////////////////////////////////////////////// struct SearchRequestBuilder_t : public IRequestBuilder_t { SearchRequestBuilder_t ( const CSphVector & dQueries, int iStart, int iEnd ) : m_dQueries ( dQueries ), m_iStart ( iStart ), m_iEnd ( iEnd ) {} virtual void BuildRequest ( const char * sIndexes, NetOutputBuffer_c & tOut, int ) const; protected: int CalcQueryLen ( const char * sIndexes, const CSphQuery & q ) const; void SendQuery ( const char * sIndexes, NetOutputBuffer_c & tOut, const CSphQuery & q ) const; protected: const CSphVector & m_dQueries; int m_iStart; int m_iEnd; }; struct SearchReplyParser_t : public IReplyParser_t, public ISphNoncopyable { SearchReplyParser_t ( int iStart, int iEnd, CSphVector & dMvaStorage, CSphVector & dStringsStorage ) : m_iStart ( iStart ) , m_iEnd ( iEnd ) , m_dMvaStorage ( dMvaStorage ) , m_dStringsStorage ( dStringsStorage ) {} virtual bool ParseReply ( MemInputBuffer_c & tReq, AgentConn_t & tAgent, int iAgent ) const; protected: int m_iStart; int m_iEnd; CSphVector & m_dMvaStorage; CSphVector & m_dStringsStorage; }; ///////////////////////////////////////////////////////////////////////////// int SearchRequestBuilder_t::CalcQueryLen ( const char * sIndexes, const CSphQuery & q ) const { int iReqSize = 108 + 2*sizeof(SphDocID_t) + 4*q.m_iWeights + q.m_sSortBy.Length() + strlen ( sIndexes ) + q.m_sGroupBy.Length() + q.m_sGroupSortBy.Length() + q.m_sGroupDistinct.Length() + q.m_sComment.Length() + q.m_sSelect.Length(); if ( !q.m_bAgent ) // send the magic to agent ("*,*," + real query) iReqSize += q.m_sSelect.IsEmpty() ? 3 : 4; iReqSize += q.m_sRawQuery.IsEmpty() ? q.m_sQuery.Length() : q.m_sRawQuery.Length(); ARRAY_FOREACH ( j, q.m_dFilters ) { const CSphFilterSettings & tFilter = q.m_dFilters[j]; iReqSize += 12 + tFilter.m_sAttrName.Length(); // string attr-name; int type; int exclude-flag switch ( tFilter.m_eType ) { case SPH_FILTER_VALUES: iReqSize += 4 + 8*tFilter.GetNumValues (); break; // int values-count; uint64[] values case SPH_FILTER_RANGE: iReqSize += 16; break; // uint64 min-val, max-val case SPH_FILTER_FLOATRANGE: iReqSize += 8; break; // int/float min-val,max-val } } if ( q.m_bGeoAnchor ) iReqSize += 16 + q.m_sGeoLatAttr.Length() + q.m_sGeoLongAttr.Length(); // string lat-attr, long-attr; float lat, long ARRAY_FOREACH ( i, q.m_dIndexWeights ) iReqSize += 8 + q.m_dIndexWeights[i].m_sName.Length(); // string index-name; int index-weight ARRAY_FOREACH ( i, q.m_dFieldWeights ) iReqSize += 8 + q.m_dFieldWeights[i].m_sName.Length(); // string field-name; int field-weight ARRAY_FOREACH ( i, q.m_dOverrides ) iReqSize += 12 + q.m_dOverrides[i].m_sAttr.Length() + // string attr-name; int type; int values-count ( q.m_dOverrides[i].m_eAttrType==SPH_ATTR_BIGINT ? 16 : 12 )*q.m_dOverrides[i].m_dValues.GetLength(); // ( bigint id; int/float/bigint value )[] values return iReqSize; } void SearchRequestBuilder_t::SendQuery ( const char * sIndexes, NetOutputBuffer_c & tOut, const CSphQuery & q ) const { tOut.SendInt ( 0 ); // offset is 0 tOut.SendInt ( q.m_iMaxMatches ); // limit is MAX_MATCHES tOut.SendInt ( (DWORD)q.m_eMode ); // match mode tOut.SendInt ( (DWORD)q.m_eRanker ); // ranking mode tOut.SendInt ( q.m_eSort ); // sort mode tOut.SendString ( q.m_sSortBy.cstr() ); // sort attr if ( q.m_sRawQuery.IsEmpty() ) tOut.SendString ( q.m_sQuery.cstr() ); else tOut.SendString ( q.m_sRawQuery.cstr() ); // query tOut.SendInt ( q.m_iWeights ); for ( int j=0; j0 ); tAgent.m_dResults.Resize ( iResults ); for ( int iRes=0; iResg_iMaxMatches ) { tAgent.m_sFailure.SetSprintf ( "invalid match count received (count=%d)", iMatches ); return false; } int bAgent64 = tReq.GetInt (); #if !USE_64BIT if ( bAgent64 ) tAgent.m_sFailure.SetSprintf ( "id64 agent, id32 master, docids might be wrapped" ); #endif assert ( !tRes.m_dMatches.GetLength() ); if ( iMatches ) { tRes.m_dMatches.Resize ( iMatches ); ARRAY_FOREACH ( i, tRes.m_dMatches ) { CSphMatch & tMatch = tRes.m_dMatches[i]; tMatch.Reset ( tSchema.GetRowSize() ); tMatch.m_iDocID = bAgent64 ? (SphDocID_t)tReq.GetUint64() : tReq.GetDword(); tMatch.m_iWeight = tReq.GetInt (); for ( int j=0; j>32 ) ); } } } else if ( tAttr.m_eAttrType==SPH_ATTR_FLOAT ) { float fRes = tReq.GetFloat(); tMatch.SetAttr ( tAttr.m_tLocator, sphF2DW(fRes) ); } else if ( tAttr.m_eAttrType==SPH_ATTR_BIGINT ) { tMatch.SetAttr ( tAttr.m_tLocator, tReq.GetUint64() ); } else if ( tAttr.m_eAttrType==SPH_ATTR_STRING ) { CSphString sValue = tReq.GetString(); int iLen = sValue.Length(); int iOff = m_dStringsStorage.GetLength(); tMatch.SetAttr ( tAttr.m_tLocator, iOff ); m_dStringsStorage.Resize ( iOff+3+iLen ); BYTE * pBuf = &m_dStringsStorage[iOff]; pBuf += sphPackStrlen ( pBuf, iLen ); memcpy ( pBuf, sValue.cstr(), iLen ); } else { tMatch.SetAttr ( tAttr.m_tLocator, tReq.GetDword() ); } } } } // read totals (retrieved count, total count, query time, word count) int iRetrieved = tReq.GetInt (); tRes.m_iTotalMatches = tReq.GetInt (); tRes.m_iQueryTime = tReq.GetInt (); const int iWordsCount = tReq.GetInt (); // FIXME! sanity check? if ( iRetrieved!=iMatches ) { tAgent.m_sFailure.SetSprintf ( "expected %d retrieved documents, got %d", iMatches, iRetrieved ); return false; } // read per-word stats for ( int i=0; i dDst; for ( int i=0; i=0 ) { const CSphColumnInfo & tSrcAttr = tSrc.GetAttr ( iSrcIdx ); if ( tSrcAttr.m_eAttrType!=dDst[i].m_eAttrType ) { // different types? remove the attr iSrcIdx = -1; bEqual = false; } else if ( tSrcAttr.m_tLocator.m_iBitCount!=dDst[i].m_tLocator.m_iBitCount ) { // different bit sizes? choose the max one dDst[i].m_tLocator.m_iBitCount = Max ( dDst[i].m_tLocator.m_iBitCount, tSrcAttr.m_tLocator.m_iBitCount ); bEqual = false; } if ( tSrcAttr.m_tLocator.m_iBitOffset!=dDst[i].m_tLocator.m_iBitOffset ) { // different offsets? have to force target dynamic then, since we can't use one locator for all matches bEqual = false; } if ( tSrcAttr.m_tLocator.m_bDynamic!=dDst[i].m_tLocator.m_bDynamic ) { // different location? have to force target dynamic then bEqual = false; } } // check for presence if ( iSrcIdx<0 ) { dDst.Remove ( i ); i--; } } tDst.ResetAttrs (); ARRAY_FOREACH ( i, dDst ) tDst.AddAttr ( dDst[i], dDst[i].m_tLocator.m_bDynamic | !bEqual ); // force dynamic attrs on inequality return bEqual; } bool FixupQuery ( CSphQuery * pQuery, const CSphSchema * pSchema, const char * sIndexName, CSphString & sError ) { // already? if ( !pQuery->m_iOldVersion ) return true; if ( pQuery->m_iOldGroups>0 || pQuery->m_iOldMinGID!=0 || pQuery->m_iOldMaxGID!=UINT_MAX ) { int iAttr = -1; for ( int i=0; iGetAttrsCount(); i++ ) if ( pSchema->GetAttr(i).m_eAttrType==SPH_ATTR_INTEGER ) { iAttr = i; break; } if ( iAttr<0 ) { sError.SetSprintf ( "index '%s': no group attribute found", sIndexName ); return false; } CSphFilterSettings tFilter; tFilter.m_sAttrName = pSchema->GetAttr(iAttr).m_sName; tFilter.m_dValues.Resize ( pQuery->m_iOldGroups ); ARRAY_FOREACH ( i, tFilter.m_dValues ) tFilter.m_dValues[i] = pQuery->m_pOldGroups[i]; tFilter.m_uMinValue = pQuery->m_iOldMinGID; tFilter.m_uMaxValue = pQuery->m_iOldMaxGID; pQuery->m_dFilters.Add ( tFilter ); } if ( pQuery->m_iOldMinTS!=0 || pQuery->m_iOldMaxTS!=UINT_MAX ) { int iAttr = -1; for ( int i=0; iGetAttrsCount(); i++ ) if ( pSchema->GetAttr(i).m_eAttrType==SPH_ATTR_TIMESTAMP ) { iAttr = i; break; } if ( iAttr<0 ) { sError.SetSprintf ( "index '%s': no timestamp attribute found", sIndexName ); return false; } CSphFilterSettings tFilter; tFilter.m_sAttrName = pSchema->GetAttr(iAttr).m_sName; tFilter.m_uMinValue = pQuery->m_iOldMinTS; tFilter.m_uMaxValue = pQuery->m_iOldMaxTS; pQuery->m_dFilters.Add ( tFilter ); } pQuery->m_iOldVersion = 0; return true; } void ParseIndexList ( const CSphString & sIndexes, CSphVector & dOut ) { CSphString sSplit = sIndexes; char * p = (char*)sSplit.cstr(); while ( *p ) { // skip non-alphas while ( (*p) && !sphIsAlpha(*p) ) p++; if ( !(*p) ) break; // this is my next index name const char * sNext = p; while ( sphIsAlpha(*p) ) p++; assert ( sNext!=p ); if ( *p ) *p++ = '\0'; // if it was not the end yet, we'll continue from next char dOut.Add().m_sName = sNext; } } void CheckQuery ( const CSphQuery & tQuery, CSphString & sError ) { sError = NULL; if ( tQuery.m_eMode<0 || tQuery.m_eMode>SPH_MATCH_TOTAL ) { sError.SetSprintf ( "invalid match mode %d", tQuery.m_eMode ); return; } if ( tQuery.m_eRanker<0 || tQuery.m_eRanker>SPH_RANK_TOTAL ) { sError.SetSprintf ( "invalid ranking mode %d", tQuery.m_eRanker ); return; } if ( tQuery.m_iMaxMatches<1 || tQuery.m_iMaxMatches>g_iMaxMatches ) { sError.SetSprintf ( "per-query max_matches=%d out of bounds (per-server max_matches=%d)", tQuery.m_iMaxMatches, g_iMaxMatches ); return; } if ( tQuery.m_iOffset<0 || tQuery.m_iOffset>=tQuery.m_iMaxMatches ) { sError.SetSprintf ( "offset out of bounds (offset=%d, max_matches=%d)", tQuery.m_iOffset, tQuery.m_iMaxMatches ); return; } if ( tQuery.m_iLimit<0 ) { sError.SetSprintf ( "limit out of bounds (limit=%d)", tQuery.m_iLimit ); return; } if ( tQuery.m_iCutoff<0 ) { sError.SetSprintf ( "cutoff out of bounds (cutoff=%d)", tQuery.m_iCutoff ); return; } if ( tQuery.m_iRetryCount<0 || tQuery.m_iRetryCount>MAX_RETRY_COUNT ) { sError.SetSprintf ( "retry count out of bounds (count=%d)", tQuery.m_iRetryCount ); return; } if ( tQuery.m_iRetryDelay<0 || tQuery.m_iRetryDelay>MAX_RETRY_DELAY ) { sError.SetSprintf ( "retry delay out of bounds (delay=%d)", tQuery.m_iRetryDelay ); return; } } void PrepareQueryEmulation ( CSphQuery * pQuery ) { // sort filters ARRAY_FOREACH ( i, pQuery->m_dFilters ) pQuery->m_dFilters[i].m_dValues.Sort(); // sort overrides ARRAY_FOREACH ( i, pQuery->m_dOverrides ) pQuery->m_dOverrides[i].m_dValues.Sort (); // fixup query pQuery->m_sQuery = pQuery->m_sRawQuery; if ( pQuery->m_eMode==SPH_MATCH_BOOLEAN ) pQuery->m_eRanker = SPH_RANK_NONE; if ( pQuery->m_eMode!=SPH_MATCH_ALL && pQuery->m_eMode!=SPH_MATCH_ANY && pQuery->m_eMode!=SPH_MATCH_PHRASE ) return; const char * szQuery = pQuery->m_sRawQuery.cstr (); int iQueryLen = szQuery ? strlen(szQuery) : 0; pQuery->m_sQuery.Reserve ( iQueryLen*2+8 ); char * szRes = (char*) pQuery->m_sQuery.cstr (); char c; if ( pQuery->m_eMode==SPH_MATCH_ANY || pQuery->m_eMode==SPH_MATCH_PHRASE ) *szRes++ = '\"'; while ( ( c = *szQuery++ )!=0 ) { // must be in sync with EscapeString (php api) if ( c=='(' || c==')' || c=='|' || c=='-' || c=='!' || c=='@' || c=='~' || c=='\"' || c=='&' || c=='/' || c=='<' || c=='\\' ) *szRes++ = '\\'; *szRes++ = c; } switch ( pQuery->m_eMode ) { case SPH_MATCH_ALL: pQuery->m_eRanker = SPH_RANK_PROXIMITY; *szRes = '\0'; break; case SPH_MATCH_ANY: pQuery->m_eRanker = SPH_RANK_MATCHANY; strncpy ( szRes, "\"/1", 8 ); break; case SPH_MATCH_PHRASE: pQuery->m_eRanker = SPH_RANK_PROXIMITY; *szRes++ = '\"'; *szRes = '\0'; break; default: return; } } bool ParseSearchQuery ( InputBuffer_c & tReq, CSphQuery & tQuery, int iVer, int iMasterVer ) { tQuery.m_iOldVersion = iVer; // v.1.0. mode, limits, weights, ID/TS ranges tQuery.m_iOffset = tReq.GetInt (); tQuery.m_iLimit = tReq.GetInt (); tQuery.m_eMode = (ESphMatchMode) tReq.GetInt (); if ( iVer>=0x110 ) { tQuery.m_eRanker = (ESphRankMode) tReq.GetInt (); if ( tQuery.m_eRanker==SPH_RANK_EXPR ) tQuery.m_sRankerExpr = tReq.GetString(); } tQuery.m_eSort = (ESphSortOrder) tReq.GetInt (); if ( iVer<=0x101 ) tQuery.m_iOldGroups = tReq.GetDwords ( &tQuery.m_pOldGroups, g_iMaxFilterValues, "invalid group count %d (should be in 0..%d range)" ); if ( iVer>=0x102 ) { tQuery.m_sSortBy = tReq.GetString (); tQuery.m_sSortBy.ToLower (); } tQuery.m_sRawQuery = tReq.GetString (); tQuery.m_iWeights = tReq.GetDwords ( (DWORD**)&tQuery.m_pWeights, SPH_MAX_FIELDS, "invalid weight count %d (should be in 0..%d range)" ); tQuery.m_sIndexes = tReq.GetString (); bool bIdrange64 = false; if ( iVer>=0x108 ) bIdrange64 = ( tReq.GetInt()!=0 ); SphDocID_t uMinID = 0; SphDocID_t uMaxID = DOCID_MAX; if ( bIdrange64 ) { uMinID = (SphDocID_t)tReq.GetUint64 (); uMaxID = (SphDocID_t)tReq.GetUint64 (); // FIXME? could report clamp here if I'm id32 and client passed id64 range, // but frequently this won't affect anything at all } else { uMinID = tReq.GetDword (); uMaxID = tReq.GetDword (); } if ( iVer<0x108 && uMaxID==0xffffffffUL ) uMaxID = 0; // fixup older clients which send 32-bit UINT_MAX by default if ( uMaxID==0 ) uMaxID = DOCID_MAX; // v.1.0, v.1.1 if ( iVer<=0x101 ) { tQuery.m_iOldMinTS = tReq.GetDword (); tQuery.m_iOldMaxTS = tReq.GetDword (); } // v.1.1 specific if ( iVer==0x101 ) { tQuery.m_iOldMinGID = tReq.GetDword (); tQuery.m_iOldMaxGID = tReq.GetDword (); } // v.1.2 if ( iVer>=0x102 ) { int iAttrFilters = tReq.GetInt (); if ( iAttrFilters>g_iMaxFilters ) { tReq.SendErrorReply ( "too much attribute filters (req=%d, max=%d)", iAttrFilters, g_iMaxFilters ); return false; } const int MAX_ERROR_SET_BUFFER = 128; char sSetError[MAX_ERROR_SET_BUFFER]; tQuery.m_dFilters.Resize ( iAttrFilters ); ARRAY_FOREACH ( iFilter, tQuery.m_dFilters ) { CSphFilterSettings & tFilter = tQuery.m_dFilters[iFilter]; tFilter.m_sAttrName = tReq.GetString (); tFilter.m_sAttrName.ToLower (); snprintf ( sSetError, MAX_ERROR_SET_BUFFER , "invalid attribute '%s'(%d) set length %s (should be in 0..%s range)", tFilter.m_sAttrName.cstr(), iFilter, "%d", "%d" ); if ( iVer>=0x10E ) { // v.1.14+ tFilter.m_eType = (ESphFilter) tReq.GetDword (); switch ( tFilter.m_eType ) { case SPH_FILTER_RANGE: tFilter.m_uMinValue = ( iVer>=0x114 ) ? tReq.GetUint64() : tReq.GetDword (); tFilter.m_uMaxValue = ( iVer>=0x114 ) ? tReq.GetUint64() : tReq.GetDword (); break; case SPH_FILTER_FLOATRANGE: tFilter.m_fMinValue = tReq.GetFloat (); tFilter.m_fMaxValue = tReq.GetFloat (); break; case SPH_FILTER_VALUES: { bool bRes = ( iVer>=0x114 ) ? tReq.GetQwords ( tFilter.m_dValues, g_iMaxFilterValues, sSetError ) : tReq.GetDwords ( tFilter.m_dValues, g_iMaxFilterValues, sSetError ); if ( !bRes ) return false; } break; default: tReq.SendErrorReply ( "unknown filter type (type-id=%d)", tFilter.m_eType ); return false; } } else { // pre-1.14 if ( !tReq.GetDwords ( tFilter.m_dValues, g_iMaxFilterValues, sSetError ) ) return false; if ( !tFilter.m_dValues.GetLength() ) { // 0 length means this is range, not set tFilter.m_uMinValue = tReq.GetDword (); tFilter.m_uMaxValue = tReq.GetDword (); } tFilter.m_eType = tFilter.m_dValues.GetLength() ? SPH_FILTER_VALUES : SPH_FILTER_RANGE; } if ( iVer>=0x106 ) tFilter.m_bExclude = !!tReq.GetDword (); } } // now add id range filter if ( uMinID!=0 || uMaxID!=DOCID_MAX ) { CSphFilterSettings & tFilter = tQuery.m_dFilters.Add(); tFilter.m_sAttrName = "@id"; tFilter.m_eType = SPH_FILTER_RANGE; tFilter.m_uMinValue = uMinID; tFilter.m_uMaxValue = uMaxID; } // v.1.3 if ( iVer>=0x103 ) { tQuery.m_eGroupFunc = (ESphGroupBy) tReq.GetDword (); tQuery.m_sGroupBy = tReq.GetString (); tQuery.m_sGroupBy.ToLower (); } // v.1.4 tQuery.m_iMaxMatches = g_iMaxMatches; if ( iVer>=0x104 ) tQuery.m_iMaxMatches = tReq.GetInt (); // v.1.5, v.1.7 if ( iVer>=0x107 ) { tQuery.m_sGroupSortBy = tReq.GetString (); } else if ( iVer>=0x105 ) { bool bSortByGroup = ( tReq.GetInt()!=0 ); if ( !bSortByGroup ) { char sBuf[256]; switch ( tQuery.m_eSort ) { case SPH_SORT_RELEVANCE: tQuery.m_sGroupSortBy = "@weight desc"; break; case SPH_SORT_ATTR_DESC: case SPH_SORT_ATTR_ASC: snprintf ( sBuf, sizeof(sBuf), "%s %s", tQuery.m_sSortBy.cstr(), tQuery.m_eSort==SPH_SORT_ATTR_ASC ? "asc" : "desc" ); tQuery.m_sGroupSortBy = sBuf; break; case SPH_SORT_EXTENDED: tQuery.m_sGroupSortBy = tQuery.m_sSortBy; break; default: tReq.SendErrorReply ( "INTERNAL ERROR: unsupported sort mode %d in groupby sort fixup", tQuery.m_eSort ); return false; } } } // v.1.9 if ( iVer>=0x109 ) tQuery.m_iCutoff = tReq.GetInt(); // v.1.10 if ( iVer>=0x10A ) { tQuery.m_iRetryCount = tReq.GetInt (); tQuery.m_iRetryDelay = tReq.GetInt (); } // v.1.11 if ( iVer>=0x10B ) tQuery.m_sGroupDistinct = tReq.GetString (); // v.1.14 if ( iVer>=0x10E ) { tQuery.m_bGeoAnchor = ( tReq.GetInt()!=0 ); if ( tQuery.m_bGeoAnchor ) { tQuery.m_sGeoLatAttr = tReq.GetString (); tQuery.m_sGeoLongAttr = tReq.GetString (); tQuery.m_fGeoLatitude = tReq.GetFloat (); tQuery.m_fGeoLongitude = tReq.GetFloat (); } } // v.1.15 if ( iVer>=0x10F ) { tQuery.m_dIndexWeights.Resize ( tReq.GetInt() ); // FIXME! add sanity check ARRAY_FOREACH ( i, tQuery.m_dIndexWeights ) { tQuery.m_dIndexWeights[i].m_sName = tReq.GetString (); tQuery.m_dIndexWeights[i].m_iValue = tReq.GetInt (); } } // v.1.17 if ( iVer>=0x111 ) tQuery.m_uMaxQueryMsec = tReq.GetDword (); // v.1.18 if ( iVer>=0x112 ) { tQuery.m_dFieldWeights.Resize ( tReq.GetInt() ); // FIXME! add sanity check ARRAY_FOREACH ( i, tQuery.m_dFieldWeights ) { tQuery.m_dFieldWeights[i].m_sName = tReq.GetString (); tQuery.m_dFieldWeights[i].m_iValue = tReq.GetInt (); } } // v.1.19 if ( iVer>=0x113 ) tQuery.m_sComment = tReq.GetString (); // v.1.21 if ( iVer>=0x115 ) { tQuery.m_dOverrides.Resize ( tReq.GetInt() ); // FIXME! add sanity check ARRAY_FOREACH ( i, tQuery.m_dOverrides ) { CSphAttrOverride & tOverride = tQuery.m_dOverrides[i]; tOverride.m_sAttr = tReq.GetString (); tOverride.m_eAttrType = (ESphAttr) tReq.GetDword (); tOverride.m_dValues.Resize ( tReq.GetInt() ); // FIXME! add sanity check ARRAY_FOREACH ( iVal, tOverride.m_dValues ) { CSphAttrOverride::IdValuePair_t & tEntry = tOverride.m_dValues[iVal]; tEntry.m_uDocID = (SphDocID_t) tReq.GetUint64 (); if ( tOverride.m_eAttrType==SPH_ATTR_FLOAT ) tEntry.m_fValue = tReq.GetFloat (); else if ( tOverride.m_eAttrType==SPH_ATTR_BIGINT ) tEntry.m_uValue = tReq.GetUint64 (); else tEntry.m_uValue = tReq.GetDword (); } } } // v.1.22 if ( iVer>=0x116 ) { CSphString sRawSelect = tReq.GetString (); CSphString sSelect = ""; CSphString sError; bool bAgent = false; if ( sRawSelect.Begins ( "*,*" ) ) // this is the mark of agent. { bAgent = true; if ( sRawSelect.Length()>3 ) sSelect = sRawSelect.SubString ( 4, sRawSelect.Length()-4 ); } tQuery.m_sSelect = bAgent?sSelect:sRawSelect; if ( !tQuery.ParseSelectList ( sError ) ) { tReq.SendErrorReply ( "select: %s", sError.cstr() ); return false; } if ( bAgent ) { tQuery.m_sSelect = sRawSelect; tQuery.m_bAgent = true; } } // master v.1.0 tQuery.m_eCollation = g_eCollation; if ( iMasterVer>=0x001 ) { tQuery.m_eCollation = (ESphCollation)tReq.GetDword(); } ///////////////////// // additional checks ///////////////////// if ( tReq.GetError() ) { tReq.SendErrorReply ( "invalid or truncated request" ); return false; } CSphString sError; CheckQuery ( tQuery, sError ); if ( !sError.IsEmpty() ) { tReq.SendErrorReply ( "%s", sError.cstr() ); return false; } // now prepare it for the engine PrepareQueryEmulation ( &tQuery ); // all ok return true; } ////////////////////////////////////////////////////////////////////////// void LogQueryPlain ( const CSphQuery & tQuery, const CSphQueryResult & tRes ) { assert ( g_eLogFormat==LOG_FORMAT_PLAIN ); if ( ( !g_bQuerySyslog && g_iQueryLogFile<0 ) || !tRes.m_sError.IsEmpty() ) return; char sBuf[2048]; char * p = sBuf; char * pMax = sBuf+sizeof(sBuf)-4; // [time] #if USE_SYSLOG if ( !g_bQuerySyslog ) { #endif *p++ = '['; p += sphFormatCurrentTime ( p, pMax-p ); *p++ = ']'; #if USE_SYSLOG } else p += snprintf ( p, pMax-p, "[query]" ); #endif // querytime sec int iQueryTime = Max ( tRes.m_iQueryTime, 0 ); p += snprintf ( p, pMax-p, " %d.%03d sec", iQueryTime/1000, iQueryTime%1000 ); // optional multi-query multiplier if ( tRes.m_iMultiplier>1 ) p += snprintf ( p, pMax-p, " x%d", tRes.m_iMultiplier ); // [matchmode/numfilters/sortmode matches (offset,limit) static const char * sModes [ SPH_MATCH_TOTAL ] = { "all", "any", "phr", "bool", "ext", "scan", "ext2" }; static const char * sSort [ SPH_SORT_TOTAL ] = { "rel", "attr-", "attr+", "tsegs", "ext", "expr" }; p += snprintf ( p, pMax-p, " [%s/%d/%s %d (%d,%d)", sModes [ tQuery.m_eMode ], tQuery.m_dFilters.GetLength(), sSort [ tQuery.m_eSort ], tRes.m_iTotalMatches, tQuery.m_iOffset, tQuery.m_iLimit ); // optional groupby info if ( !tQuery.m_sGroupBy.IsEmpty() ) p += snprintf ( p, pMax-p, " @%s", tQuery.m_sGroupBy.cstr() ); // ] [indexes] p += snprintf ( p, pMax-p, "] [%s]", tQuery.m_sIndexes.cstr() ); // optional performance counters if ( g_bIOStats || g_bCpuStats ) { const CSphIOStats & IOStats = sphStopIOStats (); *p++ = ' '; char * pBracket = p; // can't fill yet, will be overwritten by sprintfs if ( g_bIOStats ) p += snprintf ( p, pMax-p, " ios=%d kb=%d.%d ioms=%d.%d", IOStats.m_iReadOps, (int)( IOStats.m_iReadBytes/1024 ), (int)( IOStats.m_iReadBytes%1024 )*10/1024, (int)( IOStats.m_iReadTime/1000 ), (int)( IOStats.m_iReadTime%1000 )/100 ); if ( g_bCpuStats ) p += snprintf ( p, pMax-p, " cpums=%d.%d", (int)( tRes.m_iCpuTime/1000 ), (int)( tRes.m_iCpuTime%1000 )/100 ); *pBracket = '['; if ( p0 ) { va_list ap; va_start ( ap, sFormat ); iLen = vsnprintf ( m_pCur, Left(), sFormat, ap ); va_end ( ap ); } if ( iLen!=-1 && Length()+iLen<=m_iSize ) { m_pCur += iLen; break; } else { Grow(); } } } void AppendEscapedFixupSpace ( const char * sText ) { if ( !sText || !*sText ) return; const char * pBuf = sText; int iEsc = 0; for ( ; *pBuf; ) { char s = *pBuf++; iEsc = ( s=='\\' || s=='\'' ) ? ( iEsc+1 ) : iEsc; } int iLen = pBuf-sText; if ( Left()( m_iSize*2 ) ) iNewLen = m_iSize+iAdd; int iUsed = Length(); char * pDynamic = new char [iNewLen]; memcpy ( pDynamic, m_pDynamic ? m_pDynamic : m_sStatic, iUsed ); SafeDeleteArray ( m_pDynamic ); m_pDynamic = pDynamic; m_pCur = pDynamic + iUsed; m_iSize = iNewLen; } }; void FormatOrderBy ( StringBuffer_c * pBuf, const char * sPrefix, ESphSortOrder eSort, const CSphString & sSort ) { assert ( pBuf ); if ( eSort==SPH_SORT_EXTENDED && sSort=="@weight desc" ) return; switch ( eSort ) { case SPH_SORT_ATTR_DESC: pBuf->Append ( " %s %s DESC", sPrefix, sSort.cstr() ); break; case SPH_SORT_ATTR_ASC: pBuf->Append ( " %s %s ASC", sPrefix, sSort.cstr() ); break; case SPH_SORT_TIME_SEGMENTS: pBuf->Append ( " %s TIME_SEGMENT(%s)", sPrefix, sSort.cstr() ); break; case SPH_SORT_EXTENDED: pBuf->Append ( " %s %s", sPrefix, sSort.cstr() ); break; case SPH_SORT_EXPR: pBuf->Append ( " %s BUILTIN_EXPR()", sPrefix ); break; default: pBuf->Append ( " %s mode-%d", sPrefix, (int)eSort ); break; } } void LogQuerySphinxql ( const CSphQuery & q, const CSphQueryResult & tRes, const CSphVector & dAgentTimes ) { assert ( g_eLogFormat==LOG_FORMAT_SPHINXQL ); if ( g_iQueryLogFile<0 ) return; StringBuffer_c tBuf; // get connection id int iCid = ( g_eWorkers!=MPM_THREADS ) ? g_iConnID : *(int*) sphThreadGet ( g_tConnKey ); // time, conn id, wall, found int iQueryTime = Max ( tRes.m_iQueryTime, 0 ); tBuf.Append ( "/""* " ); tBuf.AppendCurrentTime(); if ( tRes.m_iMultiplier>1 ) tBuf.Append ( " conn %d wall %d.%03d x%d found %d *""/ ", iCid, iQueryTime/1000, iQueryTime%1000, tRes.m_iMultiplier, tRes.m_iTotalMatches ); else tBuf.Append ( " conn %d wall %d.%03d found %d *""/ ", iCid, iQueryTime/1000, iQueryTime%1000, tRes.m_iTotalMatches ); /////////////////////////////////// // format request as SELECT query /////////////////////////////////// tBuf.Append ( "SELECT %s FROM %s", q.m_sSelect.cstr(), q.m_sIndexes.cstr() ); // WHERE clause // (m_sRawQuery is empty when using MySQL handler) const CSphString & sQuery = q.m_sQuery; if ( !sQuery.IsEmpty() || q.m_dFilters.GetLength() ) { bool bDeflowered = false; tBuf.Append ( " WHERE" ); if ( !sQuery.IsEmpty() ) { tBuf.Append ( " MATCH('" ); tBuf.AppendEscapedFixupSpace ( sQuery.cstr() ); tBuf.Append ( "')" ); bDeflowered = true; } ARRAY_FOREACH ( i, q.m_dFilters ) { if ( bDeflowered ) tBuf.Append ( " AND" ); const CSphFilterSettings & f = q.m_dFilters[i]; switch ( f.m_eType ) { case SPH_FILTER_VALUES: if ( f.m_dValues.GetLength()==1 ) { if ( f.m_bExclude ) tBuf.Append ( " %s!="INT64_FMT, f.m_sAttrName.cstr(), (int64_t)f.m_dValues[0] ); else tBuf.Append ( " %s="INT64_FMT, f.m_sAttrName.cstr(), (int64_t)f.m_dValues[0] ); } else { if ( f.m_bExclude ) tBuf.Append ( " %s NOT IN (", f.m_sAttrName.cstr() ); else tBuf.Append ( " %s IN (", f.m_sAttrName.cstr() ); ARRAY_FOREACH ( j, f.m_dValues ) { if ( j ) tBuf.Append ( ","INT64_FMT, (int64_t)f.m_dValues[j] ); else tBuf.Append ( INT64_FMT, (int64_t)f.m_dValues[j] ); } tBuf.Append ( ")" ); } break; case SPH_FILTER_RANGE: if ( f.m_bExclude ) tBuf.Append ( " %s NOT BETWEEN "INT64_FMT" AND "INT64_FMT, f.m_sAttrName.cstr(), (int64_t)f.m_uMinValue, (int64_t)f.m_uMaxValue ); else tBuf.Append ( " %s BETWEEN "INT64_FMT" AND "INT64_FMT, f.m_sAttrName.cstr(), (int64_t)f.m_uMinValue, (int64_t)f.m_uMaxValue ); break; case SPH_FILTER_FLOATRANGE: if ( f.m_bExclude ) tBuf.Append ( " %s NOT BETWEEN %f AND %f", f.m_sAttrName.cstr(), f.m_fMinValue, f.m_fMaxValue ); else tBuf.Append ( " %s BETWEEN %f AND %f", f.m_sAttrName.cstr(), f.m_fMinValue, f.m_fMaxValue ); break; default: tBuf.Append ( " 1 /""* oops, unknown filter type *""/" ); break; } } } // ORDER BY and/or GROUP BY clause if ( q.m_sGroupBy.IsEmpty() ) { if ( !q.m_sSortBy.IsEmpty() ) // case API SPH_MATCH_EXTENDED2 - SPH_SORT_RELEVANCE tBuf.Append ( " ORDER BY %s", q.m_sSortBy.cstr() ); } else { tBuf.Append ( " GROUP BY %s", q.m_sGroupBy.cstr() ); FormatOrderBy ( &tBuf, "WITHIN GROUP ORDER BY", q.m_eSort, q.m_sSortBy ); if ( q.m_sGroupSortBy!="@group desc" ) FormatOrderBy ( &tBuf, "ORDER BY", SPH_SORT_EXTENDED, q.m_sGroupSortBy ); } // LIMIT clause if ( q.m_iOffset!=0 || q.m_iLimit!=20 ) tBuf.Append ( " LIMIT %d,%d", q.m_iOffset, q.m_iLimit ); // OPTION clause int iOpts = 0; if ( q.m_iMaxMatches!=1000 ) { tBuf.Append ( iOpts++ ? ", " : " OPTION " ); tBuf.Append ( "max_matches=%d", q.m_iMaxMatches ); } if ( !q.m_sComment.IsEmpty() ) { tBuf.Append ( iOpts++ ? ", " : " OPTION " ); tBuf.Append ( "comment='%s'", q.m_sComment.cstr() ); // FIXME! escape, replace newlines.. } if ( q.m_eRanker!=SPH_RANK_DEFAULT ) { const char * sRanker = "proximity_bm25"; switch ( q.m_eRanker ) { case SPH_RANK_BM25: sRanker = "bm25"; break; case SPH_RANK_NONE: sRanker = "none"; break; case SPH_RANK_WORDCOUNT: sRanker = "wordcount"; break; case SPH_RANK_PROXIMITY: sRanker = "proximity"; break; case SPH_RANK_MATCHANY: sRanker = "matchany"; break; case SPH_RANK_FIELDMASK: sRanker = "fieldmask"; break; case SPH_RANK_SPH04: sRanker = "sph04"; break; case SPH_RANK_EXPR: sRanker = "expr"; break; default: break; } tBuf.Append ( iOpts++ ? ", " : " OPTION " ); tBuf.Append ( "ranker=%s", sRanker ); } // finish SQL statement tBuf.Append ( ";" ); /////////////// // query stats /////////////// if ( !tRes.m_sError.IsEmpty() ) { // all we have is an error tBuf.Append ( " # error=%s", tRes.m_sError.cstr() ); } else if ( g_bIOStats || g_bCpuStats || dAgentTimes.GetLength() || !tRes.m_sWarning.IsEmpty() ) { // got some extra data, add a comment tBuf.Append ( " #" ); // performance counters if ( g_bIOStats || g_bCpuStats ) { const CSphIOStats & IOStats = sphStopIOStats (); if ( g_bIOStats ) tBuf.Append ( " ios=%d kb=%d.%d ioms=%d.%d", IOStats.m_iReadOps, (int)( IOStats.m_iReadBytes/1024 ), (int)( IOStats.m_iReadBytes%1024 )*10/1024, (int)( IOStats.m_iReadTime/1000 ), (int)( IOStats.m_iReadTime%1000 )/100 ); if ( g_bCpuStats ) tBuf.Append ( " cpums=%d.%d", (int)( tRes.m_iCpuTime/1000 ), (int)( tRes.m_iCpuTime%1000 )/100 ); } // per-agent times if ( dAgentTimes.GetLength() ) { tBuf.Append ( " agents=(" ); ARRAY_FOREACH ( i, dAgentTimes ) tBuf.Append ( i ? ", %d.%03d" : "%d.%03d", (int)(dAgentTimes[i]/1000000), (int)((dAgentTimes[i]/1000)%1000) ); tBuf.Append ( ")" ); } // warning if ( !tRes.m_sWarning.IsEmpty() ) tBuf.Append ( " warning=%s", tRes.m_sWarning.cstr() ); } // line feed tBuf.Append ( "\n" ); lseek ( g_iQueryLogFile, 0, SEEK_END ); sphWrite ( g_iQueryLogFile, tBuf.cstr(), tBuf.Length() ); } void LogQuery ( const CSphQuery & q, const CSphQueryResult & tRes, const CSphVector & dAgentTimes ) { switch ( g_eLogFormat ) { case LOG_FORMAT_PLAIN: LogQueryPlain ( q, tRes ); break; case LOG_FORMAT_SPHINXQL: LogQuerySphinxql ( q, tRes, dAgentTimes ); break; } } ////////////////////////////////////////////////////////////////////////// int CalcResultLength ( int iVer, const CSphQueryResult * pRes, const CSphVector & dTag2Pools, bool bExtendedStat ) { int iRespLen = 0; // query status if ( iVer>=0x10D ) { // multi-query status iRespLen += 4; // status code if ( !pRes->m_sError.IsEmpty() ) return iRespLen + 4 +strlen ( pRes->m_sError.cstr() ); if ( !pRes->m_sWarning.IsEmpty() ) iRespLen += 4+strlen ( pRes->m_sWarning.cstr() ); } else if ( iVer>=0x106 ) { // warning message if ( !pRes->m_sWarning.IsEmpty() ) iRespLen += 4 + strlen ( pRes->m_sWarning.cstr() ); } // query stats iRespLen += 20; // schema if ( iVer>=0x102 ) { iRespLen += 8; // 4 for field count, 4 for attr count ARRAY_FOREACH ( i, pRes->m_tSchema.m_dFields ) iRespLen += 4 + strlen ( pRes->m_tSchema.m_dFields[i].m_sName.cstr() ); // namelen, name for ( int i=0; im_tSchema.GetAttrsCount(); i++ ) iRespLen += 8 + strlen ( pRes->m_tSchema.GetAttr(i).m_sName.cstr() ); // namelen, name, type } // matches if ( iVer<0x102 ) iRespLen += 16*pRes->m_iCount; // matches else if ( iVer<0x108 ) iRespLen += ( 8+4*pRes->m_tSchema.GetAttrsCount() )*pRes->m_iCount; // matches else iRespLen += 4 + ( 8+4*USE_64BIT+4*pRes->m_tSchema.GetAttrsCount() )*pRes->m_iCount; // id64 tag and matches if ( iVer>=0x114 ) { // 64bit matches int iWideAttrs = 0; for ( int i=0; im_tSchema.GetAttrsCount(); i++ ) if ( pRes->m_tSchema.GetAttr(i).m_eAttrType==SPH_ATTR_BIGINT ) iWideAttrs++; iRespLen += 4*pRes->m_iCount*iWideAttrs; // extra 4 bytes per attr per match } // agents send additional flag from words statistics if ( bExtendedStat ) iRespLen += pRes->m_hWordStats.GetLength(); pRes->m_hWordStats.IterateStart(); while ( pRes->m_hWordStats.IterateNext() ) // per-word stats iRespLen += 12 + strlen ( pRes->m_hWordStats.IterateGetKey().cstr() ); // wordlen, word, docs, hits // MVA and string values CSphVector dMvaItems; CSphVector dStringItems; for ( int i=0; im_tSchema.GetAttrsCount(); i++ ) { const CSphColumnInfo & tCol = pRes->m_tSchema.GetAttr(i); if ( tCol.m_eAttrType==SPH_ATTR_UINT32SET || tCol.m_eAttrType==SPH_ATTR_UINT64SET ) dMvaItems.Add ( tCol.m_tLocator ); if ( tCol.m_eAttrType==SPH_ATTR_STRING ) dStringItems.Add ( tCol.m_tLocator ); } if ( iVer>=0x10C && dMvaItems.GetLength() ) { for ( int i=0; im_iCount; i++ ) { const CSphMatch & tMatch = pRes->m_dMatches [ pRes->m_iOffset+i ]; const DWORD * pMvaPool = dTag2Pools [ tMatch.m_iTag ].m_pMva; ARRAY_FOREACH ( j, dMvaItems ) { assert ( tMatch.GetAttr ( dMvaItems[j] )==0 || pMvaPool ); const DWORD * pMva = tMatch.GetAttrMVA ( dMvaItems[j], pMvaPool ); if ( pMva ) iRespLen += pMva[0]*4; // FIXME? maybe add some sanity check here } } } if ( iVer>=0x117 && dStringItems.GetLength() ) { for ( int i=0; im_iCount; i++ ) { const CSphMatch & tMatch = pRes->m_dMatches [ pRes->m_iOffset+i ]; const BYTE * pStrings = dTag2Pools [ tMatch.m_iTag ].m_pStrings; ARRAY_FOREACH ( j, dStringItems ) { DWORD uOffset = (DWORD) tMatch.GetAttr ( dStringItems[j] ); assert ( !uOffset || pStrings ); if ( uOffset ) // magic zero iRespLen += sphUnpackStr ( pStrings+uOffset, NULL ); } } } return iRespLen; } void SendResult ( int iVer, NetOutputBuffer_c & tOut, const CSphQueryResult * pRes, const CSphVector & dTag2Pools, bool bExtendedStat ) { // status if ( iVer>=0x10D ) { // multi-query status bool bError = !pRes->m_sError.IsEmpty(); bool bWarning = !bError && !pRes->m_sWarning.IsEmpty(); if ( bError ) { tOut.SendInt ( SEARCHD_ERROR ); tOut.SendString ( pRes->m_sError.cstr() ); if ( g_bOptNoDetach && g_eLogFormat!=LOG_FORMAT_SPHINXQL ) sphInfo ( "query error: %s", pRes->m_sError.cstr() ); return; } else if ( bWarning ) { tOut.SendInt ( SEARCHD_WARNING ); tOut.SendString ( pRes->m_sWarning.cstr() ); if ( g_bOptNoDetach && g_eLogFormat!=LOG_FORMAT_SPHINXQL ) sphInfo ( "query warning: %s", pRes->m_sWarning.cstr() ); } else { tOut.SendInt ( SEARCHD_OK ); } } else { // single-query warning if ( iVer>=0x106 && !pRes->m_sWarning.IsEmpty() ) tOut.SendString ( pRes->m_sWarning.cstr() ); } // send schema if ( iVer>=0x102 ) { tOut.SendInt ( pRes->m_tSchema.m_dFields.GetLength() ); ARRAY_FOREACH ( i, pRes->m_tSchema.m_dFields ) tOut.SendString ( pRes->m_tSchema.m_dFields[i].m_sName.cstr() ); tOut.SendInt ( pRes->m_tSchema.GetAttrsCount() ); for ( int i=0; im_tSchema.GetAttrsCount(); i++ ) { const CSphColumnInfo & tCol = pRes->m_tSchema.GetAttr(i); tOut.SendString ( tCol.m_sName.cstr() ); tOut.SendDword ( (DWORD)tCol.m_eAttrType ); } } // send matches CSphAttrLocator iGIDLoc, iTSLoc; if ( iVer<=0x101 ) { for ( int i=0; im_tSchema.GetAttrsCount(); i++ ) { const CSphColumnInfo & tAttr = pRes->m_tSchema.GetAttr(i); if ( iTSLoc.m_iBitOffset<0 && tAttr.m_eAttrType==SPH_ATTR_TIMESTAMP ) iTSLoc = tAttr.m_tLocator; if ( iGIDLoc.m_iBitOffset<0 && tAttr.m_eAttrType==SPH_ATTR_INTEGER ) iGIDLoc = tAttr.m_tLocator; } } tOut.SendInt ( pRes->m_iCount ); if ( iVer>=0x108 ) tOut.SendInt ( USE_64BIT ); for ( int i=0; im_iCount; i++ ) { const CSphMatch & tMatch = pRes->m_dMatches [ pRes->m_iOffset+i ]; #if USE_64BIT if ( iVer>=0x108 ) tOut.SendUint64 ( tMatch.m_iDocID ); else #endif tOut.SendDword ( (DWORD)tMatch.m_iDocID ); if ( iVer<=0x101 ) { tOut.SendDword ( iGIDLoc.m_iBitOffset>=0 ? (DWORD) tMatch.GetAttr ( iGIDLoc ) : 1 ); tOut.SendDword ( iTSLoc.m_iBitOffset>=0 ? (DWORD) tMatch.GetAttr ( iTSLoc ) : 1 ); tOut.SendInt ( tMatch.m_iWeight ); } else { tOut.SendInt ( tMatch.m_iWeight ); const DWORD * pMvaPool = dTag2Pools [ tMatch.m_iTag ].m_pMva; const BYTE * pStrings = dTag2Pools [ tMatch.m_iTag ].m_pStrings; assert ( tMatch.m_pStatic || !pRes->m_tSchema.GetStaticSize() ); #if 0 // not correct any more because of internal attrs (such as string sorting ptrs) assert ( tMatch.m_pDynamic || !pRes->m_tSchema.GetDynamicSize() ); assert ( !tMatch.m_pDynamic || (int)tMatch.m_pDynamic[-1]==pRes->m_tSchema.GetDynamicSize() ); #endif for ( int j=0; jm_tSchema.GetAttrsCount(); j++ ) { const CSphColumnInfo & tAttr = pRes->m_tSchema.GetAttr(j); if ( tAttr.m_eAttrType==SPH_ATTR_UINT32SET || tAttr.m_eAttrType==SPH_ATTR_UINT64SET ) { assert ( tMatch.GetAttr ( tAttr.m_tLocator )==0 || pMvaPool ); const DWORD * pValues = tMatch.GetAttrMVA ( tAttr.m_tLocator, pMvaPool ); if ( iVer<0x10C || !pValues ) { // for older clients, fixups column value to 0 // for newer clients, means that there are 0 values tOut.SendDword ( 0 ); } else { // send MVA values int iValues = *pValues++; tOut.SendDword ( iValues ); if ( tAttr.m_eAttrType==SPH_ATTR_UINT64SET ) { assert ( ( iValues%2 )==0 ); while ( iValues ) { uint64_t uVal = MVA_UPSIZE ( pValues ); tOut.SendUint64 ( uVal ); pValues += 2; iValues -= 2; } } else { while ( iValues-- ) tOut.SendDword ( *pValues++ ); } } } else if ( tAttr.m_eAttrType==SPH_ATTR_STRING ) { // send string attr if ( iVer<0x117 ) { // for older clients, just send int value of 0 tOut.SendDword ( 0 ); } else { // for newer clients, send binary string DWORD uOffset = (DWORD) tMatch.GetAttr ( tAttr.m_tLocator ); if ( !uOffset ) // magic zero { tOut.SendDword ( 0 ); // null string } else { const BYTE * pStr; assert ( pStrings ); int iLen = sphUnpackStr ( pStrings+uOffset, &pStr ); tOut.SendDword ( iLen ); tOut.SendBytes ( pStr, iLen ); } } } else { // send plain attr if ( tAttr.m_eAttrType==SPH_ATTR_FLOAT ) tOut.SendFloat ( tMatch.GetAttrFloat ( tAttr.m_tLocator ) ); else if ( iVer>=0x114 && tAttr.m_eAttrType==SPH_ATTR_BIGINT ) tOut.SendUint64 ( tMatch.GetAttr ( tAttr.m_tLocator ) ); else tOut.SendDword ( (DWORD)tMatch.GetAttr ( tAttr.m_tLocator ) ); } } } } tOut.SendInt ( pRes->m_dMatches.GetLength() ); tOut.SendInt ( pRes->m_iTotalMatches ); tOut.SendInt ( Max ( pRes->m_iQueryTime, 0 ) ); tOut.SendInt ( pRes->m_hWordStats.GetLength() ); pRes->m_hWordStats.IterateStart(); while ( pRes->m_hWordStats.IterateNext() ) { const CSphQueryResultMeta::WordStat_t & tStat = pRes->m_hWordStats.IterateGet(); tOut.SendString ( pRes->m_hWordStats.IterateGetKey().cstr() ); tOut.SendInt ( tStat.m_iDocs ); tOut.SendInt ( tStat.m_iHits ); if ( bExtendedStat ) tOut.SendByte ( tStat.m_bExpanded ); } } ///////////////////////////////////////////////////////////////////////////// struct AggrResult_t : CSphQueryResult { int m_iTag; ///< current tag CSphVector m_dSchemas; ///< aggregated resultsets schemas (for schema minimization) CSphVector m_dMatchCounts; ///< aggregated resultsets lengths (for schema minimization) CSphVector m_dLockedAttrs; ///< indexes which are hold in the memory untill sending result CSphVector m_dTag2Pools; ///< tag to MVA and strings storage pools mapping }; struct TaggedMatchSorter_fn : public SphAccessor_T { void CopyKey ( CSphMatch * pMed, CSphMatch * pVal ) const { pMed->m_iDocID = pVal->m_iDocID; pMed->m_iTag = pVal->m_iTag; } bool IsLess ( const CSphMatch & a, const CSphMatch & b ) const { return ( a.m_iDocID < b.m_iDocID ) || ( a.m_iDocID==b.m_iDocID && a.m_iTag > b.m_iTag ); } // inherited swap does not work on gcc void Swap ( CSphMatch * a, CSphMatch * b ) const { ::Swap ( *a, *b ); } }; // just to avoid the const_cast of the schema (i.e, return writable columns) // also to make possible several members refer to one and same locator. class CVirtualSchema : public CSphSchema { public: inline CSphColumnInfo & LastColumn() { return m_dAttrs.Last(); } inline CSphColumnInfo & GetWAttr ( int iIndex ) { return m_dAttrs[iIndex]; } inline CSphVector & GetWAttrs () { return m_dAttrs; } inline void AlignSizes ( const CSphSchema& tProof ) { m_dDynamicUsed.Resize ( tProof.GetDynamicSize() ); m_iStaticSize = tProof.GetStaticSize(); } }; void MkIdAttribute ( CSphColumnInfo * pId ) { pId->m_tLocator.m_bDynamic = true; pId->m_sName = "id"; pId->m_eAttrType = USE_64BIT ? SPH_ATTR_BIGINT : SPH_ATTR_INTEGER; pId->m_tLocator.m_iBitOffset = -8*(int)sizeof(SphDocID_t); pId->m_tLocator.m_iBitCount = 8*sizeof(SphDocID_t); } void AddIDAttribute ( CVirtualSchema * pSchema ) { assert ( pSchema ); if ( pSchema->GetAttrIndex("id")>=0 ) return; CSphColumnInfo tId; MkIdAttribute ( &tId ); pSchema->GetWAttrs().Insert ( 0, tId ); } inline bool IsIDAttribute ( const CSphColumnInfo & tTarget ) { return tTarget.m_tLocator.IsID(); } // swap the schema into the new one void AdoptSchema ( AggrResult_t * pRes, CSphSchema * pSchema ) { pSchema->m_dFields = pRes->m_tSchema.m_dFields; pRes->m_tSchema = *pSchema; } void AdoptAliasedSchema ( AggrResult_t & tRes, CVirtualSchema * pSchema ) { pSchema->AlignSizes ( tRes.m_tSchema ); AdoptSchema ( &tRes, pSchema ); } void RemapResult ( CSphSchema * pTarget, AggrResult_t * pRes, bool bMultiSchema=true ) { int iCur = 0; int * dMapFrom = NULL; if ( pTarget->GetAttrsCount() ) dMapFrom = new int [ pTarget->GetAttrsCount() ]; ARRAY_FOREACH ( iSchema, pRes->m_dSchemas ) { CSphSchema& dSchema = bMultiSchema?pRes->m_dSchemas[iSchema]:pRes->m_tSchema; for ( int i=0; iGetAttrsCount(); i++ ) { dMapFrom[i] = dSchema.GetAttrIndex ( pTarget->GetAttr(i).m_sName.cstr() ); assert ( dMapFrom[i]>=0 || IsIDAttribute ( pTarget->GetAttr(i) ) || sphIsSortStringInternal ( pTarget->GetAttr(i).m_sName.cstr() ) ); } int iLimit = bMultiSchema ? ( iCur + pRes->m_dMatchCounts[iSchema] ) : pRes->m_iTotalMatches; iLimit = Min ( iLimit, pRes->m_dMatches.GetLength() ); for ( int i=iCur;im_dMatches[i]; // create new and shiny (and properly sized) match CSphMatch tRow; tRow.Reset ( pTarget->GetDynamicSize() ); tRow.m_iDocID = tMatch.m_iDocID; tRow.m_iWeight = tMatch.m_iWeight; tRow.m_iTag = tMatch.m_iTag; // remap attrs for ( int j=0; jGetAttrsCount(); j++ ) { const CSphColumnInfo & tDst = pTarget->GetAttr(j); // we could keep some of the rows static // and so, avoid the duplication of the data. if ( !tDst.m_tLocator.m_bDynamic ) { assert ( dMapFrom[j]<0 || !dSchema.GetAttr ( dMapFrom[j] ).m_tLocator.m_bDynamic ); tRow.m_pStatic = tMatch.m_pStatic; } else if ( dMapFrom[j]>=0 ) { const CSphColumnInfo & tSrc = dSchema.GetAttr ( dMapFrom[j] ); tRow.SetAttr ( tDst.m_tLocator, tMatch.GetAttr ( tSrc.m_tLocator ) ); } } // swap out old (most likely wrong sized) match Swap ( tMatch, tRow ); } if ( !bMultiSchema ) break; iCur = iLimit; } if ( bMultiSchema ) assert ( iCur==pRes->m_dMatches.GetLength() ); SafeDeleteArray ( dMapFrom ); if ( &pRes->m_tSchema!=pTarget ) AdoptSchema ( pRes, pTarget ); } // rebuild the results itemlist expanding stars const CSphVector * ExpandAsterisk ( const CSphSchema & tSchema, const CSphVector & tItems, CSphVector * pExpanded, bool bNoID=false ) { // the result schema usually is the index schema + calculated items + @-items // we need to extract the index schema only - so, look at the items // and cutoff from calculated or @. int iSchemaBound = tSchema.GetAttrsCount(); bool bStar = false; ARRAY_FOREACH ( i, tItems ) { const CSphQueryItem & tItem = tItems[i]; if ( tItem.m_sAlias.cstr() ) { int j = tSchema.GetAttrIndex ( tItem.m_sAlias.cstr() ); if ( j>=0 ) iSchemaBound = Min ( iSchemaBound, j ); } bStar = bStar || tItem.m_sExpr=="*"; } // no stars? Nothing to do. if ( !bStar ) return & tItems; while ( iSchemaBound && tSchema.GetAttr ( iSchemaBound-1 ).m_sName.cstr()[0]=='@' ) iSchemaBound--; ARRAY_FOREACH ( i, tItems ) { if ( tItems[i].m_sExpr=="*" ) { // asterisk expands to 'id' + all the items from the schema if ( tSchema.GetAttrIndex ( "id" )<0 && !bNoID ) { CSphQueryItem& tItem = pExpanded->Add(); tItem.m_sExpr = "id"; } for ( int j=0; jAdd(); tItem.m_sExpr = tSchema.GetAttr ( j ).m_sName; } } else pExpanded->Add ( tItems[i] ); } return pExpanded; } static void RemapStrings ( ISphMatchSorter * pSorter, AggrResult_t & tRes ) { // do match ptr pre-calc if its "order by string" case CSphVector dRemapAttr; if ( pSorter && pSorter->UsesAttrs() && sphSortGetStringRemap ( pSorter->GetSchema(), tRes.m_tSchema, dRemapAttr ) ) { int iCur = 0; ARRAY_FOREACH ( iSchema, tRes.m_dSchemas ) { for ( int i=iCur; iIsGroupby () ) { // groupby sorter does that automagically pSorter->SetMVAPool ( NULL ); // because we must be able to group on @groupby anyway pSorter->SetStringPool ( NULL ); ARRAY_FOREACH ( i, tRes.m_dMatches ) { CSphMatch & tMatch = tRes.m_dMatches[i]; if ( !pSorter->PushGrouped ( tMatch ) ) iDupes++; } } else { // normal sorter needs massasging // sort by docid and then by tag to guarantee the replacement order TaggedMatchSorter_fn fnSort; sphSort ( tRes.m_dMatches.Begin(), tRes.m_dMatches.GetLength(), fnSort, fnSort ); // fold them matches if ( tQuery.m_dIndexWeights.GetLength() ) { // if there were per-index weights, compute weighted ranks sum int iCur = 0; int iMax = tRes.m_dMatches.GetLength(); while ( iCurPush ( tMatch ); } } else { // by default, simply remove dupes (select first by tag) ARRAY_FOREACH ( i, tRes.m_dMatches ) { if ( i==0 || tRes.m_dMatches[i].m_iDocID!=tRes.m_dMatches[i-1].m_iDocID ) pSorter->Push ( tRes.m_dMatches[i] ); else iDupes++; } } } tRes.m_dMatches.Reset (); sphFlattenQueue ( pSorter, &tRes, -1 ); SafeDelete ( pSorter ); return iDupes; } static void RecoverAggregateFunctions ( const CSphQuery & tQuery, const AggrResult_t & tRes ) { ARRAY_FOREACH ( i, tQuery.m_dItems ) { const CSphQueryItem & tItem = tQuery.m_dItems[i]; if ( tItem.m_eAggrFunc==SPH_AGGR_NONE ) continue; for ( int j=0; j ( tRes.m_tSchema.GetAttr(j) ); if ( tCol.m_sName==tItem.m_sAlias ) { assert ( tCol.m_eAggrFunc==SPH_AGGR_NONE ); tCol.m_eAggrFunc = tItem.m_eAggrFunc; } } } } bool MinimizeAggrResult ( AggrResult_t & tRes, const CSphQuery & tQuery, bool bHadLocalIndexes, CSphSchema* pExtraSchema, bool bFromSphinxql=false ) { // sanity check int iExpected = 0; ARRAY_FOREACH ( i, tRes.m_dMatchCounts ) iExpected += tRes.m_dMatchCounts[i]; if ( iExpected!=tRes.m_dMatches.GetLength() ) { tRes.m_sError.SetSprintf ( "INTERNAL ERROR: expected %d matches in combined result set, got %d", iExpected, tRes.m_dMatches.GetLength() ); tRes.m_iSuccesses = 0; return false; } if ( !( bFromSphinxql || tRes.m_dMatches.GetLength() ) ) return true; // build minimal schema if ( !tRes.m_dSchemas.GetLength() && bFromSphinxql ) { AddIDAttribute ( (CVirtualSchema*) &tRes.m_tSchema ); return true; } tRes.m_tSchema = tRes.m_dSchemas[0]; bool bAllEqual = true; bool bAgent = tQuery.m_bAgent; bool bUsualApi = !( bAgent || bFromSphinxql ); for ( int i=1; i tExtItems; const CSphVector * pSelectItems = ExpandAsterisk ( tRes.m_tSchema, tQuery.m_dItems, &tExtItems, bUsualApi ); if ( !bUsualApi ) { AddIDAttribute ( (CVirtualSchema*) &tRes.m_tSchema ); ARRAY_FOREACH ( i, tRes.m_dSchemas ) AddIDAttribute ( (CVirtualSchema*) &tRes.m_dSchemas[i] ); } // the final result schema - for collections, etc // we can't construct the random final schema right now, since // the final sorter needs the schema fields in specific order: // shortcuts CSphString sCount("@count"); CSphString sWeight("@weight"); // truly virtual schema which contains unique necessary fields. CVirtualSchema tInternalSchema; // truly virtual schema for final result returning CVirtualSchema tFrontendSchema; tFrontendSchema.GetWAttrs().Resize ( pSelectItems->GetLength() ); CSphVector dKnownItems; int iKnownItems = 0; if ( pSelectItems->GetLength() ) { for ( int i=0; iGetAttrsCount() ) { for ( int j=0; jGetAttrsCount(); j++ ) if ( pExtraSchema->GetAttr(j).m_sName==tCol.m_sName ) bAdd = true; // the extra schema is not null, but empty - and we have no local agents // so, the schema of result is already aligned to the extra, just add it } else if ( !bHadLocalIndexes ) bAdd = true; } if ( !bAdd && bUsualApi && *tCol.m_sName.cstr()=='@' ) bAdd = true; if ( !bAdd ) continue; } // if before all schemas were proved as equal, and the tCol taken from current schema is static - // this is no reason now to make it dynamic. bool bDynamic = bAllEqual?tCol.m_tLocator.m_bDynamic:true; tInternalSchema.AddAttr ( tCol, bDynamic ); if ( !bDynamic ) { // all schemas are equal, so all offsets and bitcounts also equal. // If we Add the static attribute which already exists in result, we need // not to corrupt it's locator. So, in this case let us force the locator // to the old data. CSphColumnInfo & tNewCol = tInternalSchema.LastColumn(); assert ( !tNewCol.m_tLocator.m_bDynamic ); tNewCol.m_tLocator = tCol.m_tLocator; } } bAllEqual &= tRes.m_tSchema.GetAttrsCount()==tInternalSchema.GetAttrsCount(); } // check if we actually have all required columns already if ( iKnownItemsGetLength() ) { tRes.m_iSuccesses = 0; dKnownItems.Sort(); ARRAY_FOREACH ( j, dKnownItems ) if ( j!=dKnownItems[j] ) { tRes.m_sError.SetSprintf ( "INTERNAL ERROR: the column '%s/%s' does not present in result set schema", (*pSelectItems)[j].m_sExpr.cstr(), (*pSelectItems)[j].m_sAlias.cstr() ); return false; } if ( dKnownItems.GetLength()==pSelectItems->GetLength()-1 ) { tRes.m_sError.SetSprintf ( "INTERNAL ERROR: the column '%s/%s' does not present in result set schema", pSelectItems->Last().m_sExpr.cstr(), pSelectItems->Last().m_sAlias.cstr() ); return false; } tRes.m_sError = "INTERNAL ERROR: some columns does not present in result set schema"; return false; } // finalize the tFrontendSchema - switch back m_iIndex field // and set up the locators for the fields if ( !bAgent ) { ARRAY_FOREACH ( i, tFrontendSchema.GetWAttrs() ) { CSphColumnInfo & tCol = tFrontendSchema.GetWAttr(i); const CSphColumnInfo & tSource = tInternalSchema.GetAttr ( tCol.m_iIndex ); tCol.m_tLocator = tSource.m_tLocator; tCol.m_eAttrType = tSource.m_eAttrType; tCol.m_iIndex = -1; } } // tricky bit // in purely distributed case, all schemas are received from the wire, and miss aggregate functions info // thus, we need to re-assign that info if ( !bHadLocalIndexes ) RecoverAggregateFunctions ( tQuery, tRes ); // we do not need to re-sort if there's exactly one result set if ( tRes.m_iSuccesses==1 ) { // convert all matches to minimal schema if ( !bAllEqual ) RemapResult ( &tInternalSchema, &tRes ); if ( !bAgent ) AdoptAliasedSchema ( tRes, &tFrontendSchema ); return true; } // if there's more than one result set, we need to re-sort the matches // so we need to bring matches to the schema that the *sorter* wants // so we need to create the sorter before conversion // // create queue // at this point, we do not need to compute anything; it all must be here ISphMatchSorter * pSorter = sphCreateQueue ( &tQuery, tRes.m_tSchema, tRes.m_sError, false ); if ( !pSorter ) return false; // reset bAllEqual flag if sorter makes new attributes if ( bAllEqual ) { // at first we count already existed internal attributes // then check if sorter makes more CSphVector dRemapAttr; sphSortGetStringRemap ( tRes.m_tSchema, tRes.m_tSchema, dRemapAttr ); int iRemapCount = dRemapAttr.GetLength(); sphSortGetStringRemap ( pSorter->GetSchema(), tRes.m_tSchema, dRemapAttr ); bAllEqual = ( dRemapAttr.GetLength()<=iRemapCount ); } // sorter expects this tRes.m_tSchema = pSorter->GetSchema(); // convert all matches to sorter schema - at least to manage all static to dynamic if ( !bAllEqual ) RemapResult ( &tRes.m_tSchema, &tRes ); RemapStrings ( pSorter, tRes ); tRes.m_iTotalMatches -= KillAllDupes ( pSorter, tRes, tQuery ); if ( !bAllEqual ) RemapResult ( &tInternalSchema, &tRes, false ); if ( !bAgent ) AdoptAliasedSchema ( tRes, &tFrontendSchema ); return true; } bool MinimizeAggrResultCompat ( AggrResult_t & tRes, const CSphQuery & tQuery, bool bHadLocalIndexes ) { // sanity check int iExpected = 0; ARRAY_FOREACH ( i, tRes.m_dMatchCounts ) iExpected += tRes.m_dMatchCounts[i]; if ( iExpected!=tRes.m_dMatches.GetLength() ) { tRes.m_sError.SetSprintf ( "INTERNAL ERROR: expected %d matches in combined result set, got %d", iExpected, tRes.m_dMatches.GetLength() ); return false; } if ( !tRes.m_dMatches.GetLength() ) return true; // build minimal schema bool bAllEqual = true; tRes.m_tSchema = tRes.m_dSchemas[0]; for ( int i=1; iGetWAttrs().Remove(iStar); } if ( !bStar && tQuery.m_dItems.GetLength() ) { CSphSchema tItems; for ( int i=0; i dRemapAttr; sphSortGetStringRemap ( tRes.m_tSchema, tRes.m_tSchema, dRemapAttr ); int iRemapCount = dRemapAttr.GetLength(); sphSortGetStringRemap ( pSorter->GetSchema(), tRes.m_tSchema, dRemapAttr ); bAllEqual = ( dRemapAttr.GetLength()<=iRemapCount ); } // sorter expects this tRes.m_tSchema = pSorter->GetSchema(); } // convert all matches to minimal schema if ( !bAllEqual ) { int iCur = 0; CSphVector dMapFrom ( tRes.m_tSchema.GetAttrsCount() ); ARRAY_FOREACH ( iSchema, tRes.m_dSchemas ) { dMapFrom.Resize ( 0 ); for ( int i=0; i=0 || sphIsSortStringInternal ( tRes.m_tSchema.GetAttr(i).m_sName.cstr() ) ); } for ( int i=iCur; iInit(); } ~CSphSchemaMT() { if ( m_pLock ) Verify ( m_pLock->Done() ); SafeDelete ( m_pLock ) } // get wlocked entry, only if it is not yet touched inline CSphSchemaMT * GetVirgin () { if ( !m_pLock ) return this; if ( m_pLock->WriteLock() ) { if ( m_dAttrs.GetLength()!=0 ) // not already a virgin { m_pLock->Unlock(); return NULL; } return this; } else { sphLogDebug ( "WriteLock %p failed", this ); assert ( false ); } return NULL; } inline CSphSchemaMT * RLock() { if ( !m_pLock ) return this; if ( !m_pLock->ReadLock() ) { sphLogDebug ( "ReadLock %p failed", this ); assert ( false ); } return this; } inline void UnLock() const { if ( m_pLock ) m_pLock->Unlock(); } private: mutable CSphRwlock * m_pLock; }; class UnlockOnDestroy { public: explicit UnlockOnDestroy ( const CSphSchemaMT * lock ) : m_pLock ( lock ) {} inline ~UnlockOnDestroy() { if ( m_pLock ) m_pLock->UnLock(); } private: const CSphSchemaMT * m_pLock; }; class SearchHandler_c { friend void LocalSearchThreadFunc ( void * pArg ); public: explicit SearchHandler_c ( int iQueries, bool bSphinxql=false ); ~SearchHandler_c(); void RunQueries (); ///< run all queries, get all results public: CSphVector m_dQueries; ///< queries which i need to search CSphVector m_dResults; ///< results which i obtained CSphVector m_dFailuresSet; ///< failure logs for each query CSphVector < CSphVector > m_dAgentTimes; ///< per-agent time stats protected: void RunSubset ( int iStart, int iEnd ); ///< run queries against index(es) from first query in the subset void RunLocalSearches ( ISphMatchSorter * pLocalSorter, const char * sDistName ); void RunLocalSearchesMT (); bool RunLocalSearch ( int iLocal, ISphMatchSorter ** ppSorters, CSphQueryResult ** pResults ) const; CSphVector m_dMvaStorage; CSphVector m_dStringsStorage; int m_iStart; ///< subset start int m_iEnd; ///< subset end bool m_bMultiQueue; ///< whether current subset is subject to multi-queue optimization mutable CSphVector m_dLocal; ///< local indexes for the current subset mutable CSphVector m_dExtraSchemas; ///< the extra fields for agents mutable CSphMutex m_tLock; bool m_bSphinxql; ///< if the query get from sphinxql - to avoid applying sphinxql magick for others const ServedIndex_t * UseIndex ( int iLocal ) const; void ReleaseIndex ( int iLocal ) const; }; SearchHandler_c::SearchHandler_c ( int iQueries, bool bSphinxql ) { m_dQueries.Resize ( iQueries ); m_dResults.Resize ( iQueries ); m_dFailuresSet.Resize ( iQueries ); m_dExtraSchemas.Resize ( iQueries ); m_dAgentTimes.Resize ( iQueries ); m_tLock.Init(); m_bSphinxql = bSphinxql; ARRAY_FOREACH ( i, m_dResults ) { m_dResults[i].m_iTag = 1; // first avail tag for local storage ptrs m_dResults[i].m_dTag2Pools.Add (); // reserved index 0 for remote mva storage ptr; we'll fix this up later } } SearchHandler_c::~SearchHandler_c () { m_tLock.Done(); ARRAY_FOREACH ( i, m_dLocal ) { if ( m_dLocal[i].m_iValue>0 ) g_pIndexes->GetUnlockedEntry ( m_dLocal[i].m_sName ).Unlock(); } } const ServedIndex_t * SearchHandler_c::UseIndex ( int iLocal ) const { assert ( iLocal>=0 && iLocalGetRlockedEntry ( m_dLocal[iLocal].m_sName ); m_tLock.Lock(); int iUseCount = m_dLocal[iLocal].m_iValue; const ServedIndex_t * pServed = NULL; if ( iUseCount ) pServed = &g_pIndexes->GetUnlockedEntry ( m_dLocal[iLocal].m_sName ); else pServed = g_pIndexes->GetRlockedEntry ( m_dLocal[iLocal].m_sName ); m_dLocal[iLocal].m_iValue = iUseCount + (pServed!=NULL); m_tLock.Unlock(); return pServed; } void SearchHandler_c::ReleaseIndex ( int iLocal ) const { assert ( iLocal>=0 && iLocal=0 ); m_dLocal[iLocal].m_iValue = iUseCount; if ( !iUseCount ) g_pIndexes->GetUnlockedEntry ( m_dLocal[iLocal].m_sName ).Unlock(); m_tLock.Unlock(); } void SearchHandler_c::RunQueries () { /////////////////////////////// // choose path and run queries /////////////////////////////// m_dMvaStorage.Reserve ( 1024 ); m_dMvaStorage.Resize ( 0 ); m_dMvaStorage.Add ( 0 ); // dummy value m_dStringsStorage.Reserve ( 1024 ); m_dStringsStorage.Resize ( 0 ); m_dStringsStorage.Add ( 0 ); // check if all queries are to the same index bool bSameIndex = false; if ( m_dQueries.GetLength()>1 ) { bSameIndex = true; ARRAY_FOREACH ( i, m_dQueries ) if ( m_dQueries[i].m_sIndexes!=m_dQueries[0].m_sIndexes ) { bSameIndex = false; break; } } if ( bSameIndex ) { /////////////////////////////// // batch queries to same index /////////////////////////////// RunSubset ( 0, m_dQueries.GetLength()-1 ); ARRAY_FOREACH ( i, m_dQueries ) LogQuery ( m_dQueries[i], m_dResults[i], m_dAgentTimes[i] ); } else { ///////////////////////////////////////////// // fallback; just work each query separately ///////////////////////////////////////////// ARRAY_FOREACH ( i, m_dQueries ) { RunSubset ( i, i ); LogQuery ( m_dQueries[i], m_dResults[i], m_dAgentTimes[i] ); } } // final fixup ARRAY_FOREACH ( i, m_dResults ) { m_dResults[i].m_dTag2Pools[0].m_pMva = m_dMvaStorage.Begin(); m_dResults[i].m_dTag2Pools[0].m_pStrings = m_dStringsStorage.Begin(); m_dResults[i].m_iMatches = m_dResults[i].m_dMatches.GetLength(); } } /// return cpu time, in microseconds int64_t sphCpuTimer () { #ifdef HAVE_CLOCK_GETTIME if ( !g_bCpuStats ) return 0; #if defined(CLOCK_PROCESS_CPUTIME_ID) // CPU time (user+sys), Linux style #define LOC_CLOCK CLOCK_PROCESS_CPUTIME_ID #elif defined(CLOCK_PROF) // CPU time (user+sys), FreeBSD style #define LOC_CLOCK CLOCK_PROF #else // POSIX fallback (wall time) #define LOC_CLOCK CLOCK_REALTIME #endif struct timespec tp; if ( clock_gettime ( LOC_CLOCK, &tp ) ) return 0; return tp.tv_sec*1000000 + tp.tv_nsec/1000; #else return 0; #endif } struct LocalSearch_t { int m_iLocal; ISphMatchSorter ** m_ppSorters; CSphQueryResult ** m_ppResults; bool m_bResult; }; struct LocalSearchThreadContext_t { SphThread_t m_tThd; SearchHandler_c * m_pHandler; CSphVector m_pSearches; }; void LocalSearchThreadFunc ( void * pArg ) { LocalSearchThreadContext_t * pContext = (LocalSearchThreadContext_t*) pArg; ARRAY_FOREACH ( i, pContext->m_pSearches ) { LocalSearch_t * pCall = pContext->m_pSearches[i]; pCall->m_bResult = pContext->m_pHandler->RunLocalSearch ( pCall->m_iLocal, pCall->m_ppSorters, pCall->m_ppResults ); } } static void MergeWordStats ( CSphQueryResultMeta & tDstResult, const SmallStringHash_T & hSrc, SearchFailuresLog_c * pLog, const char * sIndex ) { assert ( pLog ); if ( !tDstResult.m_hWordStats.GetLength() ) { // nothing has been set yet; just copy tDstResult.m_hWordStats = hSrc; return; } hSrc.IterateStart(); while ( hSrc.IterateNext() ) { const CSphQueryResultMeta::WordStat_t * pDstStat = tDstResult.m_hWordStats ( hSrc.IterateGetKey() ); const CSphQueryResultMeta::WordStat_t & tSrcStat = hSrc.IterateGet(); // all indexes should produce same words from the query if ( !pDstStat && !tSrcStat.m_bExpanded ) { pLog->SubmitEx ( sIndex, "query words mismatch '%s'", hSrc.IterateGetKey().cstr() ); } tDstResult.AddStat ( hSrc.IterateGetKey(), tSrcStat.m_iDocs, tSrcStat.m_iHits, tSrcStat.m_bExpanded ); } } static void FlattenToRes ( ISphMatchSorter * pSorter, AggrResult_t & tRes ) { assert ( pSorter ); if ( pSorter->GetLength() ) { tRes.m_dMatchCounts.Add ( pSorter->GetLength() ); tRes.m_dSchemas.Add ( tRes.m_tSchema ); PoolPtrs_t & tPoolPtrs = tRes.m_dTag2Pools.Add (); tPoolPtrs.m_pMva = tRes.m_pMva; tPoolPtrs.m_pStrings = tRes.m_pStrings; sphFlattenQueue ( pSorter, &tRes, tRes.m_iTag++ ); // clean up for next index search tRes.m_pMva = NULL; tRes.m_pStrings = NULL; } } void SearchHandler_c::RunLocalSearchesMT () { int64_t tmLocal = sphMicroTimer(); // setup local searches const int iQueries = m_iEnd-m_iStart+1; CSphVector dLocals ( m_dLocal.GetLength() ); CSphVector dResults ( m_dLocal.GetLength()*iQueries ); CSphVector pSorters ( m_dLocal.GetLength()*iQueries ); CSphVector pResults ( m_dLocal.GetLength()*iQueries ); ARRAY_FOREACH ( i, pResults ) pResults[i] = &dResults[i]; ARRAY_FOREACH ( i, m_dLocal ) { dLocals[i].m_iLocal = i; dLocals[i].m_ppSorters = &pSorters [ i*iQueries ]; dLocals[i].m_ppResults = &pResults [ i*iQueries ]; } // setup threads // FIXME! implement better than naive index:thread mapping // FIXME! maybe implement a thread-shared jobs queue CSphVector dThreads ( Min ( g_iDistThreads, dLocals.GetLength() ) ); int iCurThread = 0; ARRAY_FOREACH ( i, dLocals ) { dThreads[iCurThread].m_pSearches.Add ( &dLocals[i] ); iCurThread = ( iCurThread+1 ) % g_iDistThreads; } // prepare for multithread extra schema processing for ( int iQuery=m_iStart; iQuery<=m_iEnd; iQuery++ ) m_dExtraSchemas[iQuery].AwareMT(); // fire searcher threads ARRAY_FOREACH ( i, dThreads ) { dThreads[i].m_pHandler = this; sphThreadCreate ( &dThreads[i].m_tThd, LocalSearchThreadFunc, (void*)&dThreads[i] ); // FIXME! check result } // wait for them to complete ARRAY_FOREACH ( i, dThreads ) sphThreadJoin ( &dThreads[i].m_tThd ); // now merge the results ARRAY_FOREACH ( iLocal, dLocals ) { bool bResult = dLocals[iLocal].m_bResult; const char * sLocal = m_dLocal[iLocal].m_sName.cstr(); if ( !bResult ) { // failed for ( int iQuery=m_iStart; iQuery<=m_iEnd; iQuery++ ) { int iResultIndex = iLocal*iQueries; if ( !m_bMultiQueue ) iResultIndex += iQuery - m_iStart; m_dFailuresSet[iQuery].Submit ( sLocal, dResults[iResultIndex].m_sError.cstr() ); } continue; } // multi-query succeeded for ( int iQuery=m_iStart; iQuery<=m_iEnd; iQuery++ ) { // base result set index // in multi-queue case, the only (!) result set actually filled with meta info // in non-multi-queue case, just a first index, we fix it below int iResultIndex = iLocal*iQueries; // current sorter ALWAYS resides at this index, in all cases // (current as in sorter for iQuery-th query against iLocal-th index) int iSorterIndex = iLocal*iQueries + iQuery - m_iStart; if ( !m_bMultiQueue ) { // non-multi-queue case // means that we have mere 1:1 mapping between results and sorters // so let's adjust result set index iResultIndex = iSorterIndex; } else if ( dResults[iResultIndex].m_iMultiplier==-1 ) { // multi-queue case // need to additionally check per-query failures of MultiQueryEx // those are reported through multiplier // note that iSorterIndex just below is NOT a typo // separate errors still go into separate result sets // even though regular meta does not m_dFailuresSet[iQuery].Submit ( sLocal, dResults[iSorterIndex].m_sError.cstr() ); continue; } // no sorter, no fun ISphMatchSorter * pSorter = pSorters[iSorterIndex]; if ( !pSorter ) continue; // this one seems OK AggrResult_t & tRes = m_dResults[iQuery]; CSphQueryResult & tRaw = dResults[iResultIndex]; tRes.m_iSuccesses++; tRes.m_tSchema = pSorter->GetSchema(); tRes.m_iTotalMatches += pSorter->GetTotalCount(); tRes.m_pMva = tRaw.m_pMva; tRes.m_pStrings = tRaw.m_pStrings; MergeWordStats ( tRes, tRaw.m_hWordStats, &m_dFailuresSet[iQuery], sLocal ); // move external attributes storage from tRaw to actual result tRaw.LeakStorages ( tRes ); tRes.m_iMultiplier = m_bMultiQueue ? iQueries : 1; tRes.m_iCpuTime += tRaw.m_iCpuTime / tRes.m_iMultiplier; // extract matches from sorter FlattenToRes ( pSorter, tRes ); } } ARRAY_FOREACH ( i, pSorters ) SafeDelete ( pSorters[i] ); // update our wall time for every result set tmLocal = sphMicroTimer() - tmLocal; for ( int iQuery=m_iStart; iQuery<=m_iEnd; iQuery++ ) m_dResults[iQuery].m_iQueryTime += (int)( tmLocal/1000 ); } // invoked from MT searches. So, must be MT-aware! bool SearchHandler_c::RunLocalSearch ( int iLocal, ISphMatchSorter ** ppSorters, CSphQueryResult ** ppResults ) const { const int iQueries = m_iEnd-m_iStart+1; const ServedIndex_t * pServed = UseIndex ( iLocal ); if ( !pServed ) { // FIXME! submit a failure? return false; } assert ( pServed->m_pIndex ); assert ( pServed->m_bEnabled ); // create sorters int iValidSorters = 0; for ( int i=0; im_sError; const CSphQuery & tQuery = m_dQueries[i+m_iStart]; CSphSchemaMT * pExtraSchemaMT = tQuery.m_bAgent?m_dExtraSchemas[i+m_iStart].GetVirgin():NULL; UnlockOnDestroy dSchemaLock ( pExtraSchemaMT ); assert ( !tQuery.m_iOldVersion || tQuery.m_iOldVersion>=0x102 ); ppSorters[i] = sphCreateQueue ( &tQuery, pServed->m_pIndex->GetMatchSchema(), sError, true, pExtraSchemaMT ); if ( ppSorters[i] ) iValidSorters++; } if ( !iValidSorters ) { ReleaseIndex ( iLocal ); return false; } CSphVector dLocked; // setup kill-lists CSphVector dKlists; for ( int i=iLocal+1; im_pIndex->GetKillListSize() ) { SetupKillListFilter ( dKlists.Add(), pKlistIndex->m_pIndex->GetKillList(), pKlistIndex->m_pIndex->GetKillListSize() ); dLocked.Add ( i ); } else { ReleaseIndex ( i ); } } // do the query bool bResult = false; pServed->m_pIndex->SetCacheSize ( g_iMaxCachedDocs, g_iMaxCachedHits ); if ( m_bMultiQueue ) { bResult = pServed->m_pIndex->MultiQuery ( &m_dQueries[m_iStart], ppResults[0], iQueries, ppSorters, &dKlists ); } else { bResult = pServed->m_pIndex->MultiQueryEx ( iQueries, &m_dQueries[m_iStart], ppResults, ppSorters, &dKlists ); } ARRAY_FOREACH ( i, dLocked ) ReleaseIndex ( dLocked[i] ); return bResult; } void SearchHandler_c::RunLocalSearches ( ISphMatchSorter * pLocalSorter, const char * sDistName ) { if ( g_iDistThreads>1 && m_dLocal.GetLength()>1 ) { RunLocalSearchesMT(); return; } CSphVector dLocked; ARRAY_FOREACH ( iLocal, m_dLocal ) { const char * sLocal = m_dLocal[iLocal].m_sName.cstr(); const ServedIndex_t * pServed = UseIndex ( iLocal ); if ( !pServed ) { if ( sDistName ) for ( int i=m_iStart; i<=m_iEnd; i++ ) m_dFailuresSet[i].SubmitEx ( sDistName, "local index %s missing", sLocal ); continue; } assert ( pServed->m_pIndex ); assert ( pServed->m_bEnabled ); // create sorters CSphVector dSorters ( m_iEnd-m_iStart+1 ); ARRAY_FOREACH ( i, dSorters ) dSorters[i] = NULL; int iValidSorters = 0; for ( int iQuery=m_iStart; iQuery<=m_iEnd; iQuery++ ) { CSphString sError; CSphQuery & tQuery = m_dQueries[iQuery]; CSphSchemaMT * pExtraSchema = tQuery.m_bAgent?m_dExtraSchemas[iQuery].GetVirgin():NULL; UnlockOnDestroy dSchemaLock ( pExtraSchema ); // create sorter, if needed ISphMatchSorter * pSorter = pLocalSorter; if ( !pLocalSorter ) { // fixup old queries if ( !FixupQuery ( &tQuery, &pServed->m_pIndex->GetMatchSchema(), sLocal, sError ) ) { m_dFailuresSet[iQuery].Submit ( sLocal, sError.cstr() ); continue; } // create queue pSorter = sphCreateQueue ( &tQuery, pServed->m_pIndex->GetMatchSchema(), sError, true, pExtraSchema ); if ( !pSorter ) { m_dFailuresSet[iQuery].Submit ( sLocal, sError.cstr() ); continue; } if ( !sError.IsEmpty() ) m_dFailuresSet[iQuery].Submit ( sLocal, sError.cstr() ); if ( !sError.IsEmpty() ) m_dFailuresSet[iQuery].Submit ( sLocal, sError.cstr() ); } dSorters[iQuery-m_iStart] = pSorter; iValidSorters++; } if ( !iValidSorters ) { ReleaseIndex ( iLocal ); continue; } // me shortcuts AggrResult_t tStats; CSphQuery * pQuery = &m_dQueries[m_iStart]; // set kill-list int iNumFilters = pQuery->m_dFilters.GetLength (); for ( int i=iLocal+1; im_pIndex->GetKillListSize () ) { CSphFilterSettings tKillListFilter; SetupKillListFilter ( tKillListFilter, pServed->m_pIndex->GetKillList (), pServed->m_pIndex->GetKillListSize () ); pQuery->m_dFilters.Add ( tKillListFilter ); dLocked.Add ( i ); } else { ReleaseIndex ( i ); } } // do the query bool bResult = false; pServed->m_pIndex->SetCacheSize ( g_iMaxCachedDocs, g_iMaxCachedHits ); if ( m_bMultiQueue ) { bResult = pServed->m_pIndex->MultiQuery ( &m_dQueries[m_iStart], &tStats, dSorters.GetLength(), &dSorters[0], NULL ); } else { CSphVector dResults ( m_dResults.GetLength() ); ARRAY_FOREACH ( i, m_dResults ) dResults[i] = &m_dResults[i]; bResult = pServed->m_pIndex->MultiQueryEx ( dSorters.GetLength(), &m_dQueries[m_iStart], &dResults[m_iStart], &dSorters[0], NULL ); } // handle results if ( !bResult ) { // failed for ( int iQuery=m_iStart; iQuery<=m_iEnd; iQuery++ ) m_dFailuresSet[iQuery].Submit ( sLocal, m_dResults [ m_bMultiQueue ? m_iStart : iQuery ].m_sError.cstr() ); } else { // multi-query succeeded for ( int iQuery=m_iStart; iQuery<=m_iEnd; iQuery++ ) { // but some of the sorters could had failed at "create sorter" stage ISphMatchSorter * pSorter = dSorters [ iQuery-m_iStart ]; if ( !pSorter ) continue; // this one seems OK AggrResult_t & tRes = m_dResults[iQuery]; // multi-queue only returned one result set meta, so we need to replicate it if ( m_bMultiQueue ) { // these times will be overridden below, but let's be clean tRes.m_iQueryTime += tStats.m_iQueryTime / ( m_iEnd-m_iStart+1 ); tRes.m_iCpuTime += tStats.m_iCpuTime / ( m_iEnd-m_iStart+1 ); tRes.m_pMva = tStats.m_pMva; tRes.m_pStrings = tStats.m_pStrings; MergeWordStats ( tRes, tStats.m_hWordStats, &m_dFailuresSet[iQuery], sLocal ); tRes.m_iMultiplier = m_iEnd-m_iStart+1; } else if ( tRes.m_iMultiplier==-1 ) { m_dFailuresSet[iQuery].Submit ( sLocal, tRes.m_sError.cstr() ); continue; } tRes.m_iSuccesses++; tRes.m_tSchema = pSorter->GetSchema(); tRes.m_iTotalMatches += pSorter->GetTotalCount(); // extract matches from sorter FlattenToRes ( pSorter, tRes ); // move external attributes storage from tStats to actual result tStats.LeakStorages ( tRes ); } } // cleanup kill-list pQuery->m_dFilters.Resize ( iNumFilters ); ARRAY_FOREACH ( i, dLocked ) ReleaseIndex ( dLocked[i] ); // cleanup sorters if ( !pLocalSorter ) ARRAY_FOREACH ( i, dSorters ) SafeDelete ( dSorters[i] ); } } // check expressions into a query to make sure that it's ready for multi query optimization static bool HasExpresions ( const CSphQuery & tQuery, const CSphVector& m_dIndices ) { ARRAY_FOREACH ( i, m_dIndices ) { const ServedIndex_t * pServedIndex = g_pIndexes->GetRlockedEntry ( m_dIndices[i].m_sName ); // check that it exists if ( !pServedIndex ) return false; bool bHasExpression = false; if ( pServedIndex->m_bEnabled ) bHasExpression = sphHasExpressions ( tQuery, pServedIndex->m_pIndex->GetMatchSchema() ); pServedIndex->Unlock(); if ( bHasExpression ) return true; } return false; } void SearchHandler_c::RunSubset ( int iStart, int iEnd ) { m_iStart = iStart; m_iEnd = iEnd; m_dLocal.Reset (); // all my stats int64_t tmSubset = sphMicroTimer(); int64_t tmLocal = 0; int64_t tmWait = 0; int64_t tmCpu = sphCpuTimer (); if ( g_bIOStats ) sphStartIOStats (); // prepare for descent CSphQuery & tFirst = m_dQueries[iStart]; for ( int iRes=iStart; iRes<=iEnd; iRes++ ) m_dResults[iRes].m_iSuccesses = 0; //////////////////////////////////////////////////////////////// // check for single-query, multi-queue optimization possibility //////////////////////////////////////////////////////////////// m_bMultiQueue = ( iStart dAgents; CSphVector dDistLocal; bool bDist = false; int iAgentConnectTimeout = 0, iAgentQueryTimeout = 0; { g_tDistLock.Lock(); DistributedIndex_t * pDist = g_hDistIndexes ( tFirst.m_sIndexes ); if ( pDist ) { bDist = true; iAgentConnectTimeout = pDist->m_iAgentConnectTimeout; iAgentQueryTimeout = pDist->m_iAgentQueryTimeout; dDistLocal = pDist->m_dLocal; dAgents.Resize ( pDist->m_dAgents.GetLength() ); ARRAY_FOREACH ( i, pDist->m_dAgents ) dAgents[i] = pDist->m_dAgents[i]; } g_tDistLock.Unlock(); } if ( !bDist ) { // they're all local, build the list if ( tFirst.m_sIndexes=="*" ) { // search through all local indexes for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) if ( it.Get ().m_bEnabled ) m_dLocal.Add().m_sName = it.GetKey(); } else { // search through specified local indexes ParseIndexList ( tFirst.m_sIndexes, m_dLocal ); //CSphVector m_dLocal; ///< local indexes for the current subset // there should be no distributed indexes in multi-index query int iDistFound = -1; g_tDistLock.Lock(); ARRAY_FOREACH ( i, m_dLocal ) // if ( g_hDistIndexes.Exists ( m_dLocal[i].m_sName ) ) { iDistFound = i; break; } g_tDistLock.Unlock(); if ( iDistFound!=-1 ) { for ( int iRes=iStart; iRes<=iEnd; iRes++ ) m_dResults[iRes].m_sError.SetSprintf ( "distributed index '%s' in multi-index query found", m_dLocal[iDistFound].m_sName.cstr() ); return; } ARRAY_FOREACH ( i, m_dLocal ) { const ServedIndex_t * pServedIndex = g_pIndexes->GetRlockedEntry ( m_dLocal[i].m_sName ); // check that it exists if ( !pServedIndex ) { for ( int iRes=iStart; iRes<=iEnd; iRes++ ) m_dResults[iRes].m_sError.SetSprintf ( "unknown local index '%s' in search request", m_dLocal[i].m_sName.cstr() ); return; } // if it exists but is not enabled, remove it from the list and force recheck if ( !pServedIndex->m_bEnabled ) m_dLocal.Remove ( i-- ); pServedIndex->Unlock(); } } // sanity check if ( !m_dLocal.GetLength() ) { for ( int iRes=iStart; iRes<=iEnd; iRes++ ) m_dResults[iRes].m_sError.SetSprintf ( "no enabled local indexes to search" ); return; } } else { // copy local indexes list from distributed definition, but filter out disabled ones ARRAY_FOREACH ( i, dDistLocal ) { const ServedIndex_t * pServedIndex = g_pIndexes->GetRlockedEntry ( dDistLocal[i] ); if ( pServedIndex ) { if ( pServedIndex->m_bEnabled ) m_dLocal.Add().m_sName = dDistLocal[i]; pServedIndex->Unlock(); } } } ///////////////////////////////////////////////////// // optimize single-query, same-schema local searches ///////////////////////////////////////////////////// ISphMatchSorter * pLocalSorter = NULL; while ( iStart==iEnd && m_dLocal.GetLength()>1 ) { CSphString sError; // check if all schemas are equal bool bAllEqual = true; const ServedIndex_t * pFirstIndex = g_pIndexes->GetRlockedEntry ( m_dLocal[0].m_sName ); if ( !pFirstIndex ) break; const CSphSchema & tFirstSchema = pFirstIndex->m_pIndex->GetMatchSchema(); for ( int i=1; iGetRlockedEntry ( m_dLocal[i].m_sName ); if ( !pNextIndex ) { bAllEqual = false; break; } if ( !tFirstSchema.CompareTo ( pNextIndex->m_pIndex->GetMatchSchema(), sError ) ) bAllEqual = false; pNextIndex->Unlock(); } // we can reuse the very same sorter if ( bAllEqual && FixupQuery ( &m_dQueries[iStart], &tFirstSchema, "local-sorter", sError ) ) { CSphSchemaMT * pExtraSchemaMT = m_dQueries[iStart].m_bAgent?m_dExtraSchemas[iStart].GetVirgin():NULL; UnlockOnDestroy ExtraLocker ( pExtraSchemaMT ); pLocalSorter = sphCreateQueue ( &m_dQueries[iStart], tFirstSchema, sError, true, pExtraSchemaMT ); } pFirstIndex->Unlock (); break; } // select lists must have no expressions for ( int iCheck=iStart; iCheck<=iEnd && m_bMultiQueue; iCheck++ ) { m_bMultiQueue = !HasExpresions ( m_dQueries[iCheck], m_dLocal ); } // these are mutual exclusive assert ( !( m_bMultiQueue && pLocalSorter ) ); /////////////////////////////////////////////////////////// // main query loop (with multiple retries for distributed) /////////////////////////////////////////////////////////// tFirst.m_iRetryCount = Min ( Max ( tFirst.m_iRetryCount, 0 ), MAX_RETRY_COUNT ); // paranoid clamp if ( !bDist ) tFirst.m_iRetryCount = 0; for ( int iRetry=0; iRetry<=tFirst.m_iRetryCount; iRetry++ ) { //////////////////////// // issue remote queries //////////////////////// // delay between retries if ( iRetry>0 ) sphSleepMsec ( tFirst.m_iRetryDelay ); // connect to remote agents and query them, if required int iRemote = 0; if ( bDist ) { ConnectToRemoteAgents ( dAgents, iRetry!=0 ); SearchRequestBuilder_t tReqBuilder ( m_dQueries, iStart, iEnd ); iRemote = QueryRemoteAgents ( dAgents, iAgentConnectTimeout, tReqBuilder, &tmWait ); } ///////////////////// // run local queries ////////////////////// // while the remote queries are running, do local searches // FIXME! what if the remote agents finish early, could they timeout? if ( iRetry==0 ) { if ( bDist && !iRemote && !m_dLocal.GetLength() ) { for ( int iRes=iStart; iRes<=iEnd; iRes++ ) m_dResults[iRes].m_sError = "all remote agents unreachable and no available local indexes found"; SafeDelete ( pLocalSorter ); return; } tmLocal = -sphMicroTimer(); RunLocalSearches ( pLocalSorter, bDist ? tFirst.m_sIndexes.cstr() : NULL ); tmLocal += sphMicroTimer(); } /////////////////////// // poll remote queries /////////////////////// // wait for remote queries to complete if ( iRemote ) { SearchReplyParser_t tParser ( iStart, iEnd, m_dMvaStorage, m_dStringsStorage ); int iMsecLeft = iAgentQueryTimeout - (int)( tmLocal/1000 ); int iReplys = WaitForRemoteAgents ( dAgents, Max ( iMsecLeft, 0 ), tParser, &tmWait ); // check if there were valid (though might be 0-matches) replys, and merge them if ( iReplys ) ARRAY_FOREACH ( iAgent, dAgents ) { AgentConn_t & tAgent = dAgents[iAgent]; if ( !tAgent.m_bSuccess ) continue; // merge this agent's results for ( int iRes=iStart; iRes<=iEnd; iRes++ ) { const CSphQueryResult & tRemoteResult = tAgent.m_dResults[iRes-iStart]; // copy errors or warnings if ( !tRemoteResult.m_sError.IsEmpty() ) m_dFailuresSet[iRes].SubmitEx ( tFirst.m_sIndexes.cstr(), "agent %s: remote query error: %s", tAgent.GetName().cstr(), tRemoteResult.m_sError.cstr() ); if ( !tRemoteResult.m_sWarning.IsEmpty() ) m_dFailuresSet[iRes].SubmitEx ( tFirst.m_sIndexes.cstr(), "agent %s: remote query warning: %s", tAgent.GetName().cstr(), tRemoteResult.m_sWarning.cstr() ); if ( tRemoteResult.m_iSuccesses<=0 ) continue; AggrResult_t & tRes = m_dResults[iRes]; tRes.m_iSuccesses++; ARRAY_FOREACH ( i, tRemoteResult.m_dMatches ) { tRes.m_dMatches.Add(); tRes.m_dMatches.Last().Clone ( tRemoteResult.m_dMatches[i], tRemoteResult.m_tSchema.GetRowSize() ); tRes.m_dMatches.Last().m_iTag = 0; // all remote MVA values go to special pool which is at index 0 } tRes.m_dMatchCounts.Add ( tRemoteResult.m_dMatches.GetLength() ); tRes.m_dSchemas.Add ( tRemoteResult.m_tSchema ); // note how we do NOT add per-index weight here; remote agents are all tagged 0 (which contains weight 1) // merge this agent's stats tRes.m_iTotalMatches += tRemoteResult.m_iTotalMatches; tRes.m_iQueryTime += tRemoteResult.m_iQueryTime; // merge this agent's words MergeWordStats ( tRes, tRemoteResult.m_hWordStats, &m_dFailuresSet[iRes], tFirst.m_sIndexes.cstr() ); } // dismissed tAgent.m_dResults.Reset (); tAgent.m_bSuccess = false; tAgent.m_sFailure = ""; } } // check if we need to retry again int iToRetry = 0; if ( bDist ) ARRAY_FOREACH ( i, dAgents ) if ( dAgents[i].m_eState==AGENT_RETRY ) iToRetry++; if ( !iToRetry ) break; } // submit failures from failed agents // copy timings from all agents if ( bDist ) { ARRAY_FOREACH ( i, dAgents ) { const AgentConn_t & tAgent = dAgents[i]; for ( int j=iStart; j<=iEnd; j++ ) m_dAgentTimes[j].Add ( tAgent.m_iWall / ( iEnd-iStart+1 ) ); if ( !tAgent.m_bSuccess && !tAgent.m_sFailure.IsEmpty() ) for ( int j=iStart; j<=iEnd; j++ ) m_dFailuresSet[j].SubmitEx ( tFirst.m_sIndexes.cstr(), tAgent.m_bBlackhole ? "blackhole %s: %s" : "agent %s: %s", tAgent.GetName().cstr(), tAgent.m_sFailure.cstr() ); } } ARRAY_FOREACH ( i, m_dResults ) assert ( m_dResults[i].m_iTag==m_dResults[i].m_dTag2Pools.GetLength() ); // cleanup bool bWasLocalSorter = pLocalSorter!=NULL; SafeDelete ( pLocalSorter ); ///////////////////// // merge all results ///////////////////// for ( int iRes=iStart; iRes<=iEnd; iRes++ ) { AggrResult_t & tRes = m_dResults[iRes]; CSphQuery & tQuery = m_dQueries[iRes]; CSphSchemaMT * pExtraSchema = tQuery.m_bAgent?&m_dExtraSchemas[bWasLocalSorter?0:iRes]:NULL; // minimize sorters needs these pointers tRes.m_dTag2Pools[0].m_pMva = m_dMvaStorage.Begin(); tRes.m_dTag2Pools[0].m_pStrings = m_dStringsStorage.Begin(); // if there were no succesful searches at all, this is an error if ( !tRes.m_iSuccesses ) { StrBuf_t sFailures; m_dFailuresSet[iRes].BuildReport ( sFailures ); tRes.m_sError = sFailures.cstr(); continue; } // minimize schema and remove dupes if ( tRes.m_dSchemas.GetLength() ) tRes.m_tSchema = tRes.m_dSchemas[0]; if ( tRes.m_iSuccesses>1 || tQuery.m_dItems.GetLength() ) { if ( g_bCompatResults ) { if ( !MinimizeAggrResultCompat ( tRes, tQuery, m_dLocal.GetLength()!=0 ) ) return; } else { if ( pExtraSchema ) pExtraSchema->RLock(); UnlockOnDestroy SchemaLocker ( pExtraSchema ); if ( !MinimizeAggrResult ( tRes, tQuery, m_dLocal.GetLength()!=0, pExtraSchema, m_bSphinxql ) ) return; } } if ( !m_dFailuresSet[iRes].IsEmpty() ) { StrBuf_t sFailures; m_dFailuresSet[iRes].BuildReport ( sFailures ); tRes.m_sWarning = sFailures.cstr(); } //////////// // finalize //////////// tRes.m_iOffset = tQuery.m_iOffset; tRes.m_iCount = Max ( Min ( tQuery.m_iLimit, tRes.m_dMatches.GetLength()-tQuery.m_iOffset ), 0 ); } // remove internal attributes from result schema ARRAY_FOREACH ( i, m_dResults ) sphSortRemoveInternalAttrs ( m_dResults[i].m_tSchema ); // stats tmSubset = sphMicroTimer() - tmSubset; tmCpu = sphCpuTimer() - tmCpu; // in multi-queue case (1 actual call per N queries), just divide overall query time evenly // otherwise (N calls per N queries), divide common query time overheads evenly const int iQueries = iEnd-iStart+1; if ( m_bMultiQueue ) { for ( int iRes=iStart; iRes<=iEnd; iRes++ ) { m_dResults[iRes].m_iQueryTime = (int)( tmSubset/1000/iQueries ); m_dResults[iRes].m_iCpuTime = tmCpu/iQueries; } } else { int64_t tmAccountedWall = 0; int64_t tmAccountedCpu = 0; for ( int iRes=iStart; iRes<=iEnd; iRes++ ) { tmAccountedWall += m_dResults[iRes].m_iQueryTime*1000; tmAccountedCpu += m_dResults[iRes].m_iCpuTime; } int64_t tmDeltaWall = ( tmSubset - tmAccountedWall ) / iQueries; int64_t tmDeltaCpu = ( tmCpu - tmAccountedCpu ) / iQueries; for ( int iRes=iStart; iRes<=iEnd; iRes++ ) { m_dResults[iRes].m_iQueryTime += (int)(tmDeltaWall/1000); m_dResults[iRes].m_iCpuTime += tmDeltaCpu; } } const CSphIOStats & tIO = sphStopIOStats (); if ( g_pStats ) { g_tStatsMutex.Lock(); g_pStats->m_iQueries += iQueries; g_pStats->m_iQueryTime += tmSubset; g_pStats->m_iQueryCpuTime += tmCpu; if ( bDist && dAgents.GetLength() ) { // do *not* count queries to dist indexes w/o actual remote agents g_pStats->m_iDistQueries++; g_pStats->m_iDistWallTime += tmSubset; g_pStats->m_iDistLocalTime += tmLocal; g_pStats->m_iDistWaitTime += tmWait; } g_pStats->m_iDiskReads += tIO.m_iReadOps; g_pStats->m_iDiskReadTime += tIO.m_iReadTime; g_pStats->m_iDiskReadBytes += tIO.m_iReadBytes; g_tStatsMutex.Unlock(); } } bool CheckCommandVersion ( int iVer, int iDaemonVersion, InputBuffer_c & tReq ) { if ( (iVer>>8)!=(iDaemonVersion>>8) ) { tReq.SendErrorReply ( "major command version mismatch (expected v.%d.x, got v.%d.%d)", iDaemonVersion>>8, iVer>>8, iVer&0xff ); return false; } if ( iVer>iDaemonVersion ) { tReq.SendErrorReply ( "client version is higher than daemon version (client is v.%d.%d, daemon is v.%d.%d)", iVer>>8, iVer&0xff, iDaemonVersion>>8, iDaemonVersion&0xff ); return false; } return true; } void SendSearchResponse ( SearchHandler_c & tHandler, InputBuffer_c & tReq, int iSock, int iVer, int iMasterVer ) { // serve the response NetOutputBuffer_c tOut ( iSock ); int iReplyLen = 0; bool bExtendedStat = ( iMasterVer>0 ); if ( iVer<=0x10C ) { assert ( tHandler.m_dQueries.GetLength()==1 ); assert ( tHandler.m_dResults.GetLength()==1 ); const AggrResult_t & tRes = tHandler.m_dResults[0]; if ( !tRes.m_sError.IsEmpty() ) { tReq.SendErrorReply ( "%s", tRes.m_sError.cstr() ); return; } iReplyLen = CalcResultLength ( iVer, &tRes, tRes.m_dTag2Pools, bExtendedStat ); bool bWarning = ( iVer>=0x106 && !tRes.m_sWarning.IsEmpty() ); // send it tOut.SendWord ( (WORD)( bWarning ? SEARCHD_WARNING : SEARCHD_OK ) ); tOut.SendWord ( VER_COMMAND_SEARCH ); tOut.SendInt ( iReplyLen ); SendResult ( iVer, tOut, &tRes, tRes.m_dTag2Pools, bExtendedStat ); } else { ARRAY_FOREACH ( i, tHandler.m_dQueries ) iReplyLen += CalcResultLength ( iVer, &tHandler.m_dResults[i], tHandler.m_dResults[i].m_dTag2Pools, bExtendedStat ); // send it tOut.SendWord ( (WORD)SEARCHD_OK ); tOut.SendWord ( VER_COMMAND_SEARCH ); tOut.SendInt ( iReplyLen ); ARRAY_FOREACH ( i, tHandler.m_dQueries ) SendResult ( iVer, tOut, &tHandler.m_dResults[i], tHandler.m_dResults[i].m_dTag2Pools, bExtendedStat ); } tOut.Flush (); assert ( tOut.GetError()==true || tOut.GetSentCount()==iReplyLen+8 ); // clean up ARRAY_FOREACH ( i, tHandler.m_dQueries ) SafeDeleteArray ( tHandler.m_dQueries[i].m_pWeights ); } void HandleCommandSearch ( int iSock, int iVer, InputBuffer_c & tReq ) { MEMORY ( SPH_MEM_SEARCH_NONSQL ); if ( !CheckCommandVersion ( iVer, VER_COMMAND_SEARCH, tReq ) ) return; int iMasterVer = 0; if ( iVer>=0x118 ) iMasterVer = tReq.GetInt(); // parse request int iQueries = 1; if ( iVer>=0x10D ) iQueries = tReq.GetDword (); if ( g_iMaxBatchQueries>0 && ( iQueries<=0 || iQueries>g_iMaxBatchQueries ) ) { tReq.SendErrorReply ( "bad multi-query count %d (must be in 1..%d range)", iQueries, g_iMaxBatchQueries ); return; } SearchHandler_c tHandler ( iQueries ); ARRAY_FOREACH ( i, tHandler.m_dQueries ) if ( !ParseSearchQuery ( tReq, tHandler.m_dQueries[i], iVer, iMasterVer ) ) return; // run queries, send response tHandler.RunQueries (); SendSearchResponse ( tHandler, tReq, iSock, iVer, iMasterVer ); } ////////////////////////////////////////////////////////////////////////// // SQL PARSER ////////////////////////////////////////////////////////////////////////// enum SqlStmt_e { STMT_PARSE_ERROR = 0, STMT_DUMMY, STMT_SELECT, STMT_INSERT, STMT_REPLACE, STMT_DELETE, STMT_SHOW_WARNINGS, STMT_SHOW_STATUS, STMT_SHOW_META, STMT_SET, STMT_BEGIN, STMT_COMMIT, STMT_ROLLBACK, STMT_CALL, STMT_DESC, STMT_SHOW_TABLES, STMT_UPDATE, STMT_CREATE_FUNC, STMT_DROP_FUNC, STMT_TOTAL }; const char * g_dSqlStmts[STMT_TOTAL] = { "parse_error", "select", "insert", "replace", "delete", "show_warnings", "show_status", "show_meta", "set", "begin", "commit", "rollback", "call", "desc", "show_tables", "update" }; /// refcounted vector template < typename T > class RefcountedVector_c : public CSphVector, public ISphRefcounted { }; typedef CSphRefcountedPtr < RefcountedVector_c > AttrValues_p; /// insert value struct SqlInsert_t { int m_iType; CSphString m_sVal; // OPTIMIZE? use char* and point to node? int64_t m_iVal; float m_fVal; AttrValues_p m_pVals; SqlInsert_t () : m_pVals ( NULL ) {} }; /// parser view on a generic node /// CAUTION, nodes get copied in the parser all the time, must keep assignment slim struct SqlNode_t { int m_iStart; int m_iEnd; CSphString m_sValue; int64_t m_iValue; float m_fValue; int m_iInstype; // REMOVE? should not we know this somehow else? AttrValues_p m_pValues; // FIXME? replace with numeric handles into parser state? SqlNode_t() : m_iValue ( 0 ) , m_pValues ( NULL ) {} }; #define YYSTYPE SqlNode_t enum SqlSet_e { SET_LOCAL, SET_GLOBAL_UVAR, SET_GLOBAL_SVAR }; /// parsing result /// one day, we will start subclassing this struct SqlStmt_t { SqlStmt_e m_eStmt; int m_iRowsAffected; // SELECT specific CSphQuery m_tQuery; // used by INSERT, DELETE, CALL, DESC CSphString m_sIndex; // INSERT (and CALL) specific CSphVector m_dInsertValues; // reused by CALL CSphVector m_dInsertSchema; int m_iSchemaSz; // DELETE specific CSphVector m_dDeleteIds; // SET specific CSphString m_sSetName; SqlSet_e m_eSet; int m_iSetValue; CSphString m_sSetValue; CSphVector m_dSetValues; bool m_bSetNull; // CALL specific CSphString m_sCallProc; CSphVector m_dCallOptNames; CSphVector m_dCallOptValues; // UPDATE specific CSphAttrUpdate m_tUpdate; // CREATE/DROP FUNCTION specific CSphString m_sUdfName; CSphString m_sUdfLib; ESphAttr m_eUdfType; SqlStmt_t () : m_eStmt ( STMT_PARSE_ERROR ) , m_iRowsAffected ( 0 ) , m_iSchemaSz ( 0 ) , m_eSet ( SET_LOCAL ) , m_iSetValue ( 0 ) , m_bSetNull ( false ) { m_tQuery.m_eMode = SPH_MATCH_EXTENDED2; // only new and shiny matching and sorting m_tQuery.m_eSort = SPH_SORT_EXTENDED; m_tQuery.m_sSortBy = "@weight desc"; // default order m_tQuery.m_sOrderBy = "@weight desc"; } bool AddSchemaItem ( const char * psName ) { m_dInsertSchema.Add ( psName ); m_dInsertSchema.Last().ToLower(); m_iSchemaSz = m_dInsertSchema.GetLength(); return true; // stub; check if the given field actually exists in the schema } // check if the number of fields which would be inserted is in accordance to the given schema bool CheckInsertIntegrity() { // cheat: if no schema assigned, assume the size of schema as the size of the first row. // (if it is wrong, it will be revealed later) if ( !m_iSchemaSz ) m_iSchemaSz = m_dInsertValues.GetLength(); m_iRowsAffected++; return m_dInsertValues.GetLength()==m_iRowsAffected*m_iSchemaSz; } }; struct SqlParser_c : ISphNoncopyable { public: void * m_pScanner; const char * m_pBuf; const char * m_pLastTokenStart; CSphString * m_pParseError; CSphQuery * m_pQuery; bool m_bGotQuery; SqlStmt_t * m_pStmt; CSphVector & m_dStmt; ESphCollation m_eCollation; BYTE m_uSyntaxFlags; public: explicit SqlParser_c ( CSphVector & dStmt, ESphCollation eCollation ); void PushQuery (); bool AddOption ( const SqlNode_t & tIdent, const SqlNode_t & tValue ); bool AddOption ( const SqlNode_t & tIdent, const SqlNode_t & tValue, const CSphString & sArg ); bool AddOption ( const SqlNode_t & tIdent, CSphVector & dNamed ); void AddItem ( SqlNode_t * pExpr, ESphAggrFunc eFunc=SPH_AGGR_NONE, SqlNode_t * pStart=NULL, SqlNode_t * pEnd=NULL ); bool AddItem ( const char * pToken, SqlNode_t * pStart=NULL, SqlNode_t * pEnd=NULL ); void AliasLastItem ( SqlNode_t * pAlias ); void SetSelect ( SqlNode_t * pStart, SqlNode_t * pEnd=NULL ) { if ( m_pQuery ) { if ( pStart && ( m_pQuery->m_iSQLSelectStart<0 || m_pQuery->m_iSQLSelectStart>pStart->m_iStart ) ) m_pQuery->m_iSQLSelectStart = pStart->m_iStart; if ( !pEnd ) pEnd = pStart; if ( pEnd && ( m_pQuery->m_iSQLSelectEnd<0 || m_pQuery->m_iSQLSelectEndm_iEnd ) ) m_pQuery->m_iSQLSelectEnd = pEnd->m_iEnd; } } bool AddSchemaItem ( SqlNode_t * pNode ); void SetValue ( const char * sName, const SqlNode_t& tValue ); bool SetMatch ( const SqlNode_t& tValue ); void AddConst ( int iList, const SqlNode_t& tValue ); void SetStatement ( const SqlNode_t& tName, SqlSet_e eSet ); bool AddFloatRangeFilter ( const CSphString & sAttr, float fMin, float fMax ); bool AddUintRangeFilter ( const CSphString & sAttr, DWORD uMin, DWORD uMax ); bool AddUservarFilter ( const CSphString & sCol, const CSphString & sVar, bool bExclude ); bool AddDistinct ( SqlNode_t * pNewExpr, SqlNode_t * pStart, SqlNode_t * pEnd ); CSphFilterSettings * AddFilter ( const CSphString & sCol, ESphFilter eType ); inline CSphFilterSettings * AddValuesFilter ( const SqlNode_t& sCol ) { return AddFilter ( sCol.m_sValue, SPH_FILTER_VALUES ); } inline bool SetOldSyntax() { m_uSyntaxFlags |= 1; return IsGoodSyntax (); } inline bool SetNewSyntax() { m_uSyntaxFlags |= 2; return IsGoodSyntax (); } bool IsGoodSyntax (); inline bool IsDeprecatedSyntax () const { return m_uSyntaxFlags & 1; } int AllocNamedVec (); CSphVector & GetNamedVec ( int iIndex ); void FreeNamedVec ( int iIndex ); private: void AutoAlias ( CSphQueryItem & tItem, SqlNode_t * pStart, SqlNode_t * pEnd ); protected: bool m_bNamedVecBusy; CSphVector m_dNamedVec; }; static void AddInsval ( CSphVector & dVec, const SqlNode_t & tNode ) { SqlInsert_t & tIns = dVec.Add(); tIns.m_iType = tNode.m_iInstype; tIns.m_iVal = tNode.m_iValue; // OPTIMIZE? copy conditionally based on type? tIns.m_fVal = tNode.m_fValue; tIns.m_sVal = tNode.m_sValue; tIns.m_pVals = tNode.m_pValues; } ////////////////////////////////////////////////////////////////////////// // unused parameter, simply to avoid type clash between all my yylex() functions #define YYLEX_PARAM pParser->m_pScanner, pParser #ifdef NDEBUG #define YY_DECL int yylex ( YYSTYPE * lvalp, void * yyscanner, SqlParser_c * pParser ) #else #define YY_DECL int yylexd ( YYSTYPE * lvalp, void * yyscanner, SqlParser_c * pParser ) #endif #include "llsphinxql.c" void yyerror ( SqlParser_c * pParser, const char * sMessage ) { // flex put a zero at last token boundary; make it undo that yylex_unhold ( pParser->m_pScanner ); // create our error message pParser->m_pParseError->SetSprintf ( "sphinxql: %s near '%s'", sMessage, pParser->m_pLastTokenStart ? pParser->m_pLastTokenStart : "(null)" ); // fixup TOK_xxx thingies char * s = const_cast ( pParser->m_pParseError->cstr() ); char * d = s; while ( *s ) { if ( strncmp ( s, "TOK_", 4 )==0 ) s += 4; else *d++ = *s++; } *d = '\0'; } #ifndef NDEBUG // using a proxy to be possible to debug inside yylex int yylex ( YYSTYPE * lvalp, void * yyscanner, SqlParser_c * pParser ) { int res = yylexd ( lvalp, yyscanner, pParser ); return res; } #endif #include "yysphinxql.c" ////////////////////////////////////////////////////////////////////////// class CSphMatchVariant : public CSphMatch { public: inline static SphAttr_t ToInt ( const SqlInsert_t & tVal ) { switch ( tVal.m_iType ) { case TOK_QUOTED_STRING : return strtoul ( tVal.m_sVal.cstr(), NULL, 10 ); // FIXME? report conversion error? case TOK_CONST_INT: return int(tVal.m_iVal); case TOK_CONST_FLOAT: return int(tVal.m_fVal); // FIXME? report conversion error } return 0; } inline static SphAttr_t ToBigInt ( const SqlInsert_t & tVal ) { switch ( tVal.m_iType ) { case TOK_QUOTED_STRING : return strtoll ( tVal.m_sVal.cstr(), NULL, 10 ); // FIXME? report conversion error? case TOK_CONST_INT: return tVal.m_iVal; case TOK_CONST_FLOAT: return int(tVal.m_fVal); // FIXME? report conversion error? } return 0; } #if USE_64BIT #define ToDocid ToBigInt #else #define ToDocid ToInt #endif // USE_64BIT bool SetAttr ( const CSphAttrLocator & tLoc, const SqlInsert_t & tVal, ESphAttr eTargetType ) { switch ( eTargetType ) { case SPH_ATTR_INTEGER: case SPH_ATTR_TIMESTAMP: CSphMatch::SetAttr ( tLoc, ToInt(tVal) ); break; case SPH_ATTR_BIGINT: CSphMatch::SetAttr ( tLoc, ToBigInt(tVal) ); break; case SPH_ATTR_FLOAT: if ( tVal.m_iType==TOK_QUOTED_STRING ) SetAttrFloat ( tLoc, (float)strtod ( tVal.m_sVal.cstr(), NULL ) ); // FIXME? report conversion error? else if ( tVal.m_iType==TOK_CONST_INT ) SetAttrFloat ( tLoc, float(tVal.m_iVal) ); // FIXME? report conversion error? else if ( tVal.m_iType==TOK_CONST_FLOAT ) SetAttrFloat ( tLoc, tVal.m_fVal ); break; case SPH_ATTR_STRING: case SPH_ATTR_UINT32SET: case SPH_ATTR_UINT64SET: CSphMatch::SetAttr ( tLoc, 0 ); break; default: return false; }; return true; } inline bool SetDefaultAttr ( const CSphAttrLocator & tLoc, ESphAttr eTargetType ) { SqlInsert_t tVal; tVal.m_iType = TOK_CONST_INT; tVal.m_iVal = 0; return SetAttr ( tLoc, tVal, eTargetType ); } }; SqlParser_c::SqlParser_c ( CSphVector & dStmt, ESphCollation eCollation ) : m_pQuery ( NULL ) , m_pStmt ( NULL ) , m_dStmt ( dStmt ) , m_eCollation ( eCollation ) , m_uSyntaxFlags ( 0 ) , m_bNamedVecBusy ( false ) { assert ( !m_dStmt.GetLength() ); PushQuery (); } void SqlParser_c::PushQuery () { assert ( m_dStmt.GetLength() || ( !m_pQuery && !m_pStmt ) ); // post set proper result-set order if ( m_dStmt.GetLength() ) { if ( m_pQuery->m_sGroupBy.IsEmpty() ) m_pQuery->m_sSortBy = m_pQuery->m_sOrderBy; else m_pQuery->m_sGroupSortBy = m_pQuery->m_sOrderBy; } // add new m_dStmt.Add ( SqlStmt_t() ); m_pStmt = &m_dStmt.Last(); m_pQuery = &m_pStmt->m_tQuery; m_pQuery->m_eCollation = m_eCollation; m_bGotQuery = false; } bool SqlParser_c::AddOption ( const SqlNode_t& tIdent, const SqlNode_t& tValue ) { CSphString sOpt = tIdent.m_sValue; CSphString sVal = tValue.m_sValue; sOpt.ToLower (); sVal.ToLower (); if ( sOpt=="ranker" ) { if ( sVal=="proximity_bm25" ) m_pQuery->m_eRanker = SPH_RANK_PROXIMITY_BM25; else if ( sVal=="bm25" ) m_pQuery->m_eRanker = SPH_RANK_BM25; else if ( sVal=="none" ) m_pQuery->m_eRanker = SPH_RANK_NONE; else if ( sVal=="wordcount" ) m_pQuery->m_eRanker = SPH_RANK_WORDCOUNT; else if ( sVal=="proximity" ) m_pQuery->m_eRanker = SPH_RANK_PROXIMITY; else if ( sVal=="matchany" ) m_pQuery->m_eRanker = SPH_RANK_MATCHANY; else if ( sVal=="fieldmask" ) m_pQuery->m_eRanker = SPH_RANK_FIELDMASK; else if ( sVal=="sph04" ) m_pQuery->m_eRanker = SPH_RANK_SPH04; else if ( sVal=="expr" ) { m_pParseError->SetSprintf ( "missing ranker expression (use OPTION ranker=expr('1+2') for example)" ); return false; } else { m_pParseError->SetSprintf ( "unknown ranker '%s'", sVal.cstr() ); return false; } } else if ( sOpt=="max_matches" ) { m_pQuery->m_iMaxMatches = (int)tValue.m_iValue; } else if ( sOpt=="cutoff" ) { m_pQuery->m_iCutoff = (int)tValue.m_iValue; } else if ( sOpt=="max_query_time" ) { m_pQuery->m_uMaxQueryMsec = (int)tValue.m_iValue; } else if ( sOpt=="retry_count" ) { m_pQuery->m_iRetryCount = (int)tValue.m_iValue; } else if ( sOpt=="retry_delay" ) { m_pQuery->m_iRetryDelay = (int)tValue.m_iValue; } else if ( sOpt=="reverse_scan" ) { m_pQuery->m_bReverseScan = ( tValue.m_iValue!=0 ); } else { m_pParseError->SetSprintf ( "unknown option '%s' (or bad argument type)", tIdent.m_sValue.cstr() ); return false; } return true; } bool SqlParser_c::AddOption ( const SqlNode_t & tIdent, const SqlNode_t & tValue, const CSphString & sArg ) { CSphString sOpt = tIdent.m_sValue; CSphString sVal = tValue.m_sValue; sOpt.ToLower (); sVal.ToLower (); if ( sOpt=="ranker" && sVal=="expr" ) { m_pQuery->m_eRanker = SPH_RANK_EXPR; m_pQuery->m_sRankerExpr = sArg; return true; } else { m_pParseError->SetSprintf ( "unknown option or extra argument to '%s=%s'", tIdent.m_sValue.cstr(), tValue.m_sValue.cstr() ); return false; } } bool SqlParser_c::AddOption ( const SqlNode_t & tIdent, CSphVector & dNamed ) { CSphString sOpt = tIdent.m_sValue; sOpt.ToLower (); if ( sOpt=="field_weights" ) { m_pQuery->m_dFieldWeights.SwapData ( dNamed ); } else if ( sOpt=="index_weights" ) { m_pQuery->m_dIndexWeights.SwapData ( dNamed ); } else { m_pParseError->SetSprintf ( "unknown option '%s' (or bad argument type)", tIdent.m_sValue.cstr() ); return false; } return true; } void SqlParser_c::AliasLastItem ( SqlNode_t * pAlias ) { if ( pAlias ) { CSphQueryItem & tItem = m_pQuery->m_dItems.Last(); tItem.m_sAlias.SetBinary ( m_pBuf + pAlias->m_iStart, pAlias->m_iEnd - pAlias->m_iStart ); tItem.m_sAlias.ToLower(); SetSelect ( pAlias ); } } void SqlParser_c::AutoAlias ( CSphQueryItem & tItem, SqlNode_t * pStart, SqlNode_t * pEnd ) { if ( pStart && pEnd ) { tItem.m_sAlias.SetBinary ( m_pBuf + pStart->m_iStart, pEnd->m_iEnd - pStart->m_iStart ); tItem.m_sAlias.ToLower(); } else tItem.m_sAlias = tItem.m_sExpr; SetSelect ( pStart, pEnd ); } void SqlParser_c::AddItem ( SqlNode_t * pExpr, ESphAggrFunc eAggrFunc, SqlNode_t * pStart, SqlNode_t * pEnd ) { CSphQueryItem & tItem = m_pQuery->m_dItems.Add(); tItem.m_sExpr.SetBinary ( m_pBuf + pExpr->m_iStart, pExpr->m_iEnd - pExpr->m_iStart ); tItem.m_sExpr.ToLower(); tItem.m_eAggrFunc = eAggrFunc; AutoAlias ( tItem, pStart?pStart:pExpr, pEnd?pEnd:pExpr ); } bool SqlParser_c::AddItem ( const char * pToken, SqlNode_t * pStart, SqlNode_t * pEnd ) { CSphQueryItem & tItem = m_pQuery->m_dItems.Add(); tItem.m_sExpr = pToken; tItem.m_eAggrFunc = SPH_AGGR_NONE; tItem.m_sExpr.ToLower(); AutoAlias ( tItem, pStart, pEnd ); return SetNewSyntax(); } bool SqlParser_c::AddDistinct ( SqlNode_t * pNewExpr, SqlNode_t * pStart, SqlNode_t * pEnd ) { if ( !m_pQuery->m_sGroupDistinct.IsEmpty() ) { yyerror ( this, "too many COUNT(DISTINCT) clauses" ); return false; } m_pQuery->m_sGroupDistinct = pNewExpr->m_sValue; return AddItem ( "@distinct", pStart, pEnd ); } bool SqlParser_c::AddSchemaItem ( YYSTYPE * pNode ) { assert ( m_pStmt ); CSphString sItem; sItem.SetBinary ( m_pBuf + pNode->m_iStart, pNode->m_iEnd - pNode->m_iStart ); return m_pStmt->AddSchemaItem ( sItem.cstr() ); } bool SqlParser_c::SetMatch ( const YYSTYPE& tValue ) { if ( m_bGotQuery ) { yyerror ( this, "too many MATCH() clauses" ); return false; }; m_pQuery->m_sQuery = tValue.m_sValue; m_pQuery->m_sRawQuery = tValue.m_sValue; return m_bGotQuery = true; } void SqlParser_c::AddConst ( int iList, const YYSTYPE& tValue ) { CSphVector & dVec = GetNamedVec ( iList ); dVec.Add(); dVec.Last().m_sName = tValue.m_sValue; dVec.Last().m_sName.ToLower(); dVec.Last().m_iValue = tValue.m_iValue; } void SqlParser_c::SetStatement ( const YYSTYPE& tName, SqlSet_e eSet ) { m_pStmt->m_eStmt = STMT_SET; m_pStmt->m_eSet = eSet; m_pStmt->m_sSetName = tName.m_sValue; } CSphFilterSettings * SqlParser_c::AddFilter ( const CSphString & sCol, ESphFilter eType ) { if ( sCol=="@weight" || sCol=="@count" || sCol=="count(*)" || sCol=="weight()" ) { yyerror ( this, "Aggregates in 'where' clause prohibited" ); return NULL; } CSphFilterSettings * pFilter = &m_pQuery->m_dFilters.Add(); pFilter->m_sAttrName = sCol; pFilter->m_eType = eType; pFilter->m_sAttrName.ToLower(); return pFilter; } bool SqlParser_c::AddFloatRangeFilter ( const CSphString & sAttr, float fMin, float fMax ) { CSphFilterSettings * pFilter = AddFilter ( sAttr, SPH_FILTER_FLOATRANGE ); if ( !pFilter ) return false; pFilter->m_fMinValue = fMin; pFilter->m_fMaxValue = fMax; return true; } bool SqlParser_c::AddUintRangeFilter ( const CSphString & sAttr, DWORD uMin, DWORD uMax ) { CSphFilterSettings * pFilter = AddFilter ( sAttr, SPH_FILTER_RANGE ); if ( !pFilter ) return false; pFilter->m_uMinValue = uMin; pFilter->m_uMaxValue = uMax; return true; } bool SqlParser_c::AddUservarFilter ( const CSphString & sCol, const CSphString & sVar, bool bExclude ) { g_tUservarsMutex.Lock(); Uservar_t * pVar = g_hUservars ( sVar ); if ( !pVar ) { g_tUservarsMutex.Unlock(); yyerror ( this, "undefined global variable in IN clause" ); return false; } assert ( pVar->m_eType==USERVAR_INT_SET ); CSphFilterSettings * pFilter = AddFilter ( sCol, SPH_FILTER_VALUES ); if ( !pFilter ) return false; pFilter->m_bExclude = bExclude; // INT_SET uservars must get sorted on SET once // FIXME? maybe we should do a readlock instead of copying? pFilter->m_dValues = *pVar->m_pVal; g_tUservarsMutex.Unlock(); return true; } bool SqlParser_c::IsGoodSyntax () { if ( ( m_uSyntaxFlags & 3 )!=3 ) return true; yyerror ( this, "Mixing the old-fashion internal vars (@id, @count, @weight) with new acronyms like count(*), weight() is prohibited" ); return false; } int SqlParser_c::AllocNamedVec () { // we only allow one such vector at a time, right now assert ( !m_bNamedVecBusy ); m_bNamedVecBusy = true; m_dNamedVec.Resize ( 0 ); return 0; } #ifndef NDEBUG CSphVector & SqlParser_c::GetNamedVec ( int iIndex ) #else CSphVector & SqlParser_c::GetNamedVec ( int ) #endif { assert ( m_bNamedVecBusy && iIndex==0 ); return m_dNamedVec; } #ifndef NDEBUG void SqlParser_c::FreeNamedVec ( int iIndex ) #else void SqlParser_c::FreeNamedVec ( int ) #endif { assert ( m_bNamedVecBusy && iIndex==0 ); m_bNamedVecBusy = false; m_dNamedVec.Resize ( 0 ); } bool ParseSqlQuery ( const CSphString & sQuery, CSphVector & dStmt, CSphString & sError, ESphCollation eCollation ) { SqlParser_c tParser ( dStmt, eCollation ); tParser.m_pBuf = sQuery.cstr(); tParser.m_pLastTokenStart = NULL; tParser.m_pParseError = &sError; tParser.m_eCollation = eCollation; int iLen = strlen ( sQuery.cstr() ); char * sEnd = (char*)sQuery.cstr() + iLen; sEnd[0] = 0; // prepare for yy_scan_buffer sEnd[1] = 0; // this is ok because string allocates a small gap yylex_init ( &tParser.m_pScanner ); YY_BUFFER_STATE tLexerBuffer = yy_scan_buffer ( (char*)sQuery.cstr(), iLen+2, tParser.m_pScanner ); if ( !tLexerBuffer ) { sError = "internal error: yy_scan_buffer() failed"; return false; } int iRes = yyparse ( &tParser ); yy_delete_buffer ( tLexerBuffer, tParser.m_pScanner ); yylex_destroy ( tParser.m_pScanner ); dStmt.Pop(); // last query is always dummy ARRAY_FOREACH ( i, dStmt ) { CSphQuery & tQuery = dStmt[i].m_tQuery; if ( tQuery.m_iSQLSelectStart>=0 ) { tQuery.m_sSelect.SetBinary ( tParser.m_pBuf + tQuery.m_iSQLSelectStart, tQuery.m_iSQLSelectEnd - tQuery.m_iSQLSelectStart ); // finally check for agent magic if ( tQuery.m_sSelect.Begins ( "*,*" ) ) // this is the mark of agent. { tQuery.m_dItems.Remove(0); tQuery.m_dItems.Remove(0); tQuery.m_bAgent = true; } } } if ( iRes!=0 || !dStmt.GetLength() ) return false; if ( tParser.IsDeprecatedSyntax() ) sError = "Using the old-fashion @variables (@count, @weight, etc.) is deprecated"; return true; } ///////////////////////////////////////////////////////////////////////////// int sphGetPassageBoundary ( const CSphString & sPassageBoundaryMode ) { if ( sPassageBoundaryMode.IsEmpty() ) return 0; int iMode = 0; if ( sPassageBoundaryMode=="sentence" ) iMode = MAGIC_CODE_SENTENCE; else if ( sPassageBoundaryMode=="paragraph" ) iMode = MAGIC_CODE_PARAGRAPH; else if ( sPassageBoundaryMode=="zone" ) iMode = MAGIC_CODE_ZONE; return iMode; } bool sphCheckOptionsSPZ ( const ExcerptQuery_t & q, const CSphString & sPassageBoundaryMode, CSphString & sError ) { if ( q.m_iPassageBoundary ) { if ( q.m_iAround==0 ) { sError.SetSprintf ( "invalid combination of passage_boundary=%s and around=%d", sPassageBoundaryMode.cstr(), q.m_iAround ); return false; } else if ( q.m_bUseBoundaries ) { sError.SetSprintf ( "invalid combination of passage_boundary=%s and use_boundaries", sPassageBoundaryMode.cstr() ); return false; } } if ( q.m_bEmitZones ) { if ( q.m_iPassageBoundary!=MAGIC_CODE_ZONE ) { sError.SetSprintf ( "invalid combination of passage_boundary=%s and emit_zones", sPassageBoundaryMode.cstr() ); return false; } if ( !( q.m_sStripMode=="strip" || q.m_sStripMode=="index" ) ) { sError.SetSprintf ( "invalid combination of strip=%s and emit_zones", q.m_sStripMode.cstr() ); return false; } } return true; } ///////////////////////////////////////////////////////////////////////////// // EXCERPTS HANDLER ///////////////////////////////////////////////////////////////////////////// enum eExcerpt_Flags { EXCERPT_FLAG_REMOVESPACES = 1, EXCERPT_FLAG_EXACTPHRASE = 2, EXCERPT_FLAG_SINGLEPASSAGE = 4, EXCERPT_FLAG_USEBOUNDARIES = 8, EXCERPT_FLAG_WEIGHTORDER = 16, EXCERPT_FLAG_QUERY = 32, EXCERPT_FLAG_FORCE_ALL_WORDS = 64, EXCERPT_FLAG_LOAD_FILES = 128, EXCERPT_FLAG_ALLOW_EMPTY = 256, EXCERPT_FLAG_EMIT_ZONES = 512 }; struct SnippetWorker_t { int64_t m_iTotal; int m_iHead; bool m_bLocal; SnippetWorker_t() : m_iTotal ( 0 ) , m_iHead ( -1 ) , m_bLocal ( false ) {} }; struct SnippetsRemote_t : ISphNoncopyable { CSphVector m_dAgents; CSphVector m_dWorkers; CSphVector & m_dQueries; int m_iAgentConnectTimeout; int m_iAgentQueryTimeout; explicit SnippetsRemote_t ( CSphVector & dQueries ) : m_dQueries ( dQueries ) , m_iAgentConnectTimeout ( 0 ) , m_iAgentQueryTimeout ( 0 ) {} }; struct SnippetThread_t { SphThread_t m_tThd; CSphMutex * m_pLock; int m_iQueries; ExcerptQuery_t * m_pQueries; volatile int * m_pCurQuery; CSphIndex * m_pIndex; SnippetThread_t() : m_pLock ( NULL ) , m_iQueries ( 0 ) , m_pQueries ( NULL ) , m_pCurQuery ( NULL ) , m_pIndex ( NULL ) {} }; struct SnippetRequestBuilder_t : public IRequestBuilder_t { explicit SnippetRequestBuilder_t ( const SnippetsRemote_t * pWorker ) : m_pWorker ( pWorker ) , m_iLastAgent ( -1 ) , m_iLastWorker ( -1 ) {} virtual void BuildRequest ( const char * sIndexes, NetOutputBuffer_c & tOut, int iNumAgent ) const; private: const SnippetsRemote_t * m_pWorker; mutable int m_iLastAgent; ///< just a helper to optimize consequental linear search mutable int m_iLastWorker; ///< just a helper to optimize consequental linear search }; struct SnippetReplyParser_t : public IReplyParser_t { explicit SnippetReplyParser_t ( SnippetsRemote_t * pWorker ) : m_pWorker ( pWorker ) , m_iLastAgent ( -1 ) , m_iLastWorker ( -1 ) {} virtual bool ParseReply ( MemInputBuffer_c & tReq, AgentConn_t &, int iNumAgent ) const; private: SnippetsRemote_t * m_pWorker; mutable int m_iLastAgent; ///< just a helper to optimize consequental linear search mutable int m_iLastWorker; ///< just a helper to optimize consequental linear search }; static int SnippetGetCurrentWorker ( const int iNumAgent, const int m_iLastAgent, const int m_iLastWorker, const SnippetsRemote_t * m_pWorker ) { int iCurrentWorker = 0; if ( iNumAgent==m_iLastAgent+1 ) { for ( int i=m_iLastWorker+1; im_dWorkers.GetLength(); i++ ) if ( !m_pWorker->m_dWorkers[i].m_bLocal ) { iCurrentWorker = i; break; } } else { int j = iNumAgent; ARRAY_FOREACH ( i, m_pWorker->m_dWorkers ) if ( !m_pWorker->m_dWorkers[i].m_bLocal ) { if ( j-- ) continue; iCurrentWorker = i; break; } } return iCurrentWorker; } void SnippetRequestBuilder_t::BuildRequest ( const char * sIndex, NetOutputBuffer_c & tOut, int iNumAgent ) const { m_iLastWorker = SnippetGetCurrentWorker ( iNumAgent, m_iLastAgent, m_iLastWorker, m_pWorker ); m_iLastAgent = iNumAgent; const CSphVector & dQueries = m_pWorker->m_dQueries; const ExcerptQuery_t & q = dQueries[0]; const SnippetWorker_t & tWorker = m_pWorker->m_dWorkers[m_iLastWorker]; int iLen = 60 // 15 ints/dwords - params, strlens, etc. + strlen ( sIndex ) + q.m_sWords.Length() + q.m_sBeforeMatch.Length() + q.m_sAfterMatch.Length() + q.m_sChunkSeparator.Length() + q.m_sStripMode.Length() + q.m_sRawPassageBoundary.Length(); int iNumDocs = 0; for ( int iDoc = tWorker.m_iHead; iDoc!=-1; iDoc=dQueries[iDoc].m_iNext ) { ++iNumDocs; iLen += 4 + dQueries[iDoc].m_sSource.Length(); } tOut.SendDword ( SPHINX_SEARCHD_PROTO ); tOut.SendWord ( SEARCHD_COMMAND_EXCERPT ); tOut.SendWord ( VER_COMMAND_EXCERPT ); tOut.SendInt ( iLen ); tOut.SendInt ( 0 ); tOut.SendInt ( q.m_iRawFlags ); tOut.SendString ( sIndex ); tOut.SendString ( q.m_sWords.cstr() ); tOut.SendString ( q.m_sBeforeMatch.cstr() ); tOut.SendString ( q.m_sAfterMatch.cstr() ); tOut.SendString ( q.m_sChunkSeparator.cstr() ); tOut.SendInt ( q.m_iLimit ); tOut.SendInt ( q.m_iAround ); tOut.SendInt ( q.m_iLimitPassages ); tOut.SendInt ( q.m_iLimitWords ); tOut.SendInt ( q.m_iPassageId ); tOut.SendString ( q.m_sStripMode.cstr() ); tOut.SendString ( q.m_sRawPassageBoundary.cstr() ); tOut.SendInt ( iNumDocs ); for ( int iDoc = tWorker.m_iHead; iDoc!=-1; iDoc=dQueries[iDoc].m_iNext ) tOut.SendString ( dQueries[iDoc].m_sSource.cstr() ); } bool SnippetReplyParser_t::ParseReply ( MemInputBuffer_c & tReq, AgentConn_t &, int iNumAgent ) const { m_iLastWorker = SnippetGetCurrentWorker ( iNumAgent, m_iLastAgent, m_iLastWorker, m_pWorker ); m_iLastAgent = iNumAgent; CSphVector & dQueries = m_pWorker->m_dQueries; const SnippetWorker_t & tWorker = m_pWorker->m_dWorkers[m_iLastWorker]; int iDoc = tWorker.m_iHead; while ( iDoc!=-1 ) { dQueries[iDoc].m_sRes = tReq.GetString().Leak(); int iNext = dQueries[iDoc].m_iNext; dQueries[iDoc].m_iNext = -1; // mark as processed iDoc = iNext; } return true; } static bool SnippetTransformPassageMacros ( CSphString & sSrc, CSphString & sPost ) { const char sPassageMacro[] = "%PASSAGE_ID%"; const char * sPass = NULL; if ( !sSrc.IsEmpty() ) sPass = strstr ( sSrc.cstr(), sPassageMacro ); if ( !sPass ) return false; int iSrcLen = sSrc.Length(); int iPassLen = sizeof ( sPassageMacro ) - 1; int iTailLen = iSrcLen - iPassLen - ( sPass - sSrc.cstr() ); // copy tail if ( iTailLen ) sPost.SetBinary ( sPass+iPassLen, iTailLen ); CSphString sPre; sPre.SetBinary ( sSrc.cstr(), sPass - sSrc.cstr() ); sSrc.Swap ( sPre ); return true; } static bool IsSPZEnabled ( const ExcerptQuery_t & q ) { return ( q.m_iPassageBoundary || ( q.m_sStripMode=="retain" && q.m_bHighlightQuery ) ); } static bool SetupStripperSPZ ( const CSphIndexSettings & tSettings, const ExcerptQuery_t & q, CSphScopedPtr & tStripper, ISphTokenizer * pTokenizer, CSphString & sError ) { bool bSetupSPZ = IsSPZEnabled ( q ); if ( bSetupSPZ && ( !pTokenizer->EnableSentenceIndexing ( sError ) || !pTokenizer->EnableZoneIndexing ( sError ) ) ) { return false; } if ( q.m_sStripMode=="strip" || q.m_sStripMode=="retain" || ( q.m_sStripMode=="index" && tSettings.m_bHtmlStrip ) ) { // don't strip HTML markup in 'retain' mode - proceed zones only tStripper = new CSphHTMLStripper ( q.m_sStripMode!="retain" ); if ( q.m_sStripMode=="index" ) { if ( !tStripper->SetIndexedAttrs ( tSettings.m_sHtmlIndexAttrs.cstr (), sError ) || !tStripper->SetRemovedElements ( tSettings.m_sHtmlRemoveElements.cstr (), sError ) ) { sError.SetSprintf ( "HTML stripper config error: %s", sError.cstr() ); return false; } } if ( bSetupSPZ ) { tStripper->EnableParagraphs(); } // handle zone(s) in special mode only when passage_boundary enabled if ( bSetupSPZ && !tStripper->SetZones ( tSettings.m_sZones.cstr (), sError ) ) { sError.SetSprintf ( "HTML stripper config error: %s", sError.cstr() ); return false; } } return true; } static CSphDict * SetupExactDict ( const CSphIndexSettings & tSettings, const ExcerptQuery_t & q, CSphScopedPtr & tExact, CSphDict * pDict, ISphTokenizer * pTokenizer ) { // handle index_exact_words if ( !( q.m_bHighlightQuery && tSettings.m_bIndexExactWords ) ) return pDict; CSphRemapRange tEq ( '=', '=', '=' ); // FIXME? check and warn if star was already there pTokenizer->AddCaseFolding ( tEq ); tExact = new CSphDictExact ( pDict ); return tExact.Ptr(); } class SnippetContext_t : ISphNoncopyable { private: CSphScopedPtr m_tDictCloned; CSphScopedPtr m_tExactDict; CSphScopedPtr m_tQueryTokenizer; public: CSphDict * m_pDict; CSphScopedPtr m_tTokenizer; CSphScopedPtr m_tStripper; ISphTokenizer * m_pQueryTokenizer; SnippetContext_t() : m_tDictCloned ( NULL ) , m_tExactDict ( NULL ) , m_tQueryTokenizer ( NULL ) , m_pDict ( NULL ) , m_tTokenizer ( NULL ) , m_tStripper ( NULL ) , m_pQueryTokenizer ( NULL ) { } bool Setup ( CSphIndex * pIndex, const ExcerptQuery_t & tQuery, CSphString & sError ) { CSphScopedPtr tDictCloned ( NULL ); m_pDict = pIndex->GetDictionary(); if ( m_pDict->HasState() ) { m_tDictCloned = m_pDict = m_pDict->Clone(); } m_tTokenizer = pIndex->GetTokenizer()->Clone ( true ); m_pQueryTokenizer = m_tTokenizer.Ptr(); if ( !SetupStripperSPZ ( pIndex->GetSettings(), tQuery, m_tStripper, m_tTokenizer.Ptr(), sError ) ) return false; if ( IsSPZEnabled ( tQuery ) ) { m_tQueryTokenizer = pIndex->GetTokenizer()->Clone ( true ); m_pQueryTokenizer = m_tQueryTokenizer.Ptr(); } //////////////////////////// // setup exact dictionary if needed //////////////////////////// m_pDict = SetupExactDict ( pIndex->GetSettings(), tQuery, m_tExactDict, m_pDict, m_tTokenizer.Ptr() ); return true; } }; void SnippetThreadFunc ( void * pArg ) { SnippetThread_t * pDesc = (SnippetThread_t*) pArg; SnippetContext_t tCtx; tCtx.Setup ( pDesc->m_pIndex, *pDesc->m_pQueries, pDesc->m_pQueries->m_sError ); for ( ;; ) { pDesc->m_pLock->Lock(); if ( *pDesc->m_pCurQuery==pDesc->m_iQueries ) { pDesc->m_pLock->Unlock(); return; } ExcerptQuery_t * pQuery = pDesc->m_pQueries + (*pDesc->m_pCurQuery); (*pDesc->m_pCurQuery)++; bool bDone = ( *pDesc->m_pCurQuery==pDesc->m_iQueries ); pDesc->m_pLock->Unlock(); if ( pQuery->m_iNext>=0 ) continue; pQuery->m_sRes = sphBuildExcerpt ( *pQuery, tCtx.m_pDict, tCtx.m_tTokenizer.Ptr(), &pDesc->m_pIndex->GetMatchSchema(), pDesc->m_pIndex, pQuery->m_sError, tCtx.m_tStripper.Ptr(), tCtx.m_pQueryTokenizer ); if ( bDone ) return; } } void HandleCommandExcerpt ( int iSock, int iVer, InputBuffer_c & tReq ) { if ( !CheckCommandVersion ( iVer, VER_COMMAND_EXCERPT, tReq ) ) return; ///////////////////////////// // parse and process request ///////////////////////////// const int EXCERPT_MAX_ENTRIES = 1024; // v.1.1 ExcerptQuery_t q; tReq.GetInt (); // mode field is for now reserved and ignored int iFlags = tReq.GetInt (); q.m_iRawFlags = iFlags; CSphString sIndex = tReq.GetString (); q.m_sWords = tReq.GetString (); q.m_sBeforeMatch = tReq.GetString (); q.m_sAfterMatch = tReq.GetString (); q.m_sChunkSeparator = tReq.GetString (); q.m_iLimit = tReq.GetInt (); q.m_iAround = tReq.GetInt (); if ( iVer>=0x102 ) { q.m_iLimitPassages = tReq.GetInt(); q.m_iLimitWords = tReq.GetInt(); q.m_iPassageId = tReq.GetInt(); q.m_sStripMode = tReq.GetString(); if ( q.m_sStripMode!="none" && q.m_sStripMode!="index" && q.m_sStripMode!="strip" && q.m_sStripMode!="retain" ) { tReq.SendErrorReply ( "unknown html_strip_mode=%s", q.m_sStripMode.cstr() ); return; } } q.m_bHasBeforePassageMacro = SnippetTransformPassageMacros ( q.m_sBeforeMatch, q.m_sBeforeMatchPassage ); q.m_bHasAfterPassageMacro = SnippetTransformPassageMacros ( q.m_sAfterMatch, q.m_sAfterMatchPassage ); CSphString sPassageBoundaryMode; if ( iVer>=0x103 ) q.m_sRawPassageBoundary = tReq.GetString(); q.m_bRemoveSpaces = ( iFlags & EXCERPT_FLAG_REMOVESPACES )!=0; q.m_bExactPhrase = ( iFlags & EXCERPT_FLAG_EXACTPHRASE )!=0; q.m_bUseBoundaries = ( iFlags & EXCERPT_FLAG_USEBOUNDARIES )!=0; q.m_bWeightOrder = ( iFlags & EXCERPT_FLAG_WEIGHTORDER )!=0; q.m_bHighlightQuery = ( iFlags & EXCERPT_FLAG_QUERY )!=0; q.m_bForceAllWords = ( iFlags & EXCERPT_FLAG_FORCE_ALL_WORDS )!=0; if ( iFlags & EXCERPT_FLAG_SINGLEPASSAGE ) q.m_iLimitPassages = 1; q.m_bLoadFiles = ( iFlags & EXCERPT_FLAG_LOAD_FILES )!=0; q.m_bAllowEmpty = ( iFlags & EXCERPT_FLAG_ALLOW_EMPTY )!=0; q.m_bEmitZones = ( iFlags & EXCERPT_FLAG_EMIT_ZONES )!=0; int iCount = tReq.GetInt (); if ( iCount<0 || iCount>EXCERPT_MAX_ENTRIES ) { tReq.SendErrorReply ( "invalid entries count %d", iCount ); return; } q.m_iPassageBoundary = sphGetPassageBoundary ( q.m_sRawPassageBoundary ); CSphString sError; if ( !sphCheckOptionsSPZ ( q, q.m_sRawPassageBoundary, sError ) ) { tReq.SendErrorReply ( "%s", sError.cstr() ); return; } CSphVector dQueries ( iCount ); SnippetsRemote_t dRemoteSnippets ( dQueries ); CSphVector dDistLocal; bool bRemote = false; g_tDistLock.Lock(); DistributedIndex_t * pDist = g_hDistIndexes ( sIndex ); if ( pDist ) { bRemote = true; dRemoteSnippets.m_iAgentConnectTimeout = pDist->m_iAgentConnectTimeout; dRemoteSnippets.m_iAgentQueryTimeout = pDist->m_iAgentQueryTimeout; dDistLocal = pDist->m_dLocal; dRemoteSnippets.m_dAgents.Resize ( pDist->m_dAgents.GetLength() ); ARRAY_FOREACH ( i, pDist->m_dAgents ) dRemoteSnippets.m_dAgents[i] = pDist->m_dAgents[i]; } g_tDistLock.Unlock(); if ( bRemote ) { if ( dDistLocal.GetLength()!=1 ) { tReq.SendErrorReply ( "%s", "The distributed index for snippets must have exactly one local agent" ); return; } if ( !q.m_bLoadFiles ) { tReq.SendErrorReply ( "%s", "The distributed index for snippets available only when using external files" ); return; } sIndex = dDistLocal[0]; // no remote - roll back to simple local query if ( dRemoteSnippets.m_dAgents.GetLength()==0 ) bRemote = false; } const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( sIndex ); if ( !pServed || !pServed->m_bEnabled ) { tReq.SendErrorReply ( "unknown local index '%s' in search request", sIndex.cstr() ); if ( pServed ) pServed->Unlock(); return; } ARRAY_FOREACH ( i, dQueries ) { dQueries[i] = q; // copy settings dQueries[i].m_sSource = tReq.GetString (); // fetch data if ( tReq.GetError() ) { tReq.SendErrorReply ( "invalid or truncated request" ); pServed->Unlock(); return; } } CSphIndex * pIndex = pServed->m_pIndex; SnippetContext_t tCtx; if ( !tCtx.Setup ( pIndex, q, sError ) ) // same path for single - threaded snippets, bail out here on error { tReq.SendErrorReply ( "%s", sError.cstr() ); pServed->Unlock(); return; } /////////////////// // do highlighting /////////////////// if ( g_iDistThreads<=1 || dQueries.GetLength()<2 ) { // boring single threaded loop ARRAY_FOREACH ( i, dQueries ) { dQueries[i].m_sRes = sphBuildExcerpt ( dQueries[i], tCtx.m_pDict, tCtx.m_tTokenizer.Ptr(), &pIndex->GetMatchSchema(), pIndex, dQueries[i].m_sError, tCtx.m_tStripper.Ptr(), tCtx.m_pQueryTokenizer ); if ( !dQueries[i].m_sRes ) break; } } else { // get file sizes ARRAY_FOREACH ( i, dQueries ) { if ( dQueries[i].m_bLoadFiles ) { struct stat st; if ( ::stat ( dQueries[i].m_sSource.cstr(), &st )<0 ) { tReq.SendErrorReply ( "failed to stat %s: %s", dQueries[i].m_sSource.cstr(), strerror(errno) ); pServed->Unlock(); return; } dQueries[i].m_iSize = -st.st_size; // so that sort would put bigger ones first } else { dQueries[i].m_iSize = -dQueries[i].m_sSource.Length(); } dQueries[i].m_iSeq = i; dQueries[i].m_iNext = -1; } // tough jobs first dQueries.Sort ( bind ( &ExcerptQuery_t::m_iSize ) ); if ( bRemote ) { // schedule jobs across workers (the worker is either local thread or instance, either remote agent). // simple LPT (Least Processing Time) scheduling for now // might add dynamic programming or something later if needed int iLocalPart = 1; // one instance = one worker. Or set to = g_iDistThreads, one local thread = one worker. int iRemoteAgents = dRemoteSnippets.m_dAgents.GetLength(); dRemoteSnippets.m_dWorkers.Resize ( iLocalPart + iRemoteAgents ); for ( int i=0; i dThreads ( g_iDistThreads ); for ( int i=0; iUnlock(); //////////////// // serve result //////////////// int iRespLen = 0; ARRAY_FOREACH ( i, dQueries ) { // handle errors if ( !dQueries[i].m_sRes ) { tReq.SendErrorReply ( "highlighting failed: %s", dQueries[i].m_sError.cstr() ); ARRAY_FOREACH ( j, dQueries ) SafeDeleteArray ( dQueries[j].m_sRes ); return; } // count packet size iRespLen += 4 + strlen ( dQueries[i].m_sRes ); } NetOutputBuffer_c tOut ( iSock ); tOut.SendWord ( SEARCHD_OK ); tOut.SendWord ( VER_COMMAND_EXCERPT ); tOut.SendInt ( iRespLen ); ARRAY_FOREACH ( i, dQueries ) { tOut.SendString ( dQueries[i].m_sRes ); SafeDeleteArray ( dQueries[i].m_sRes ); } tOut.Flush (); assert ( tOut.GetError()==true || tOut.GetSentCount()==iRespLen+8 ); } ///////////////////////////////////////////////////////////////////////////// // KEYWORDS HANDLER ///////////////////////////////////////////////////////////////////////////// void HandleCommandKeywords ( int iSock, int iVer, InputBuffer_c & tReq ) { if ( !CheckCommandVersion ( iVer, VER_COMMAND_KEYWORDS, tReq ) ) return; CSphString sQuery = tReq.GetString (); CSphString sIndex = tReq.GetString (); bool bGetStats = !!tReq.GetInt (); const ServedIndex_t * pIndex = g_pIndexes->GetRlockedEntry ( sIndex ); if ( !pIndex ) { tReq.SendErrorReply ( "unknown local index '%s' in search request", sIndex.cstr() ); return; } CSphString sError; CSphVector < CSphKeywordInfo > dKeywords; if ( !pIndex->m_pIndex->GetKeywords ( dKeywords, sQuery.cstr (), bGetStats, sError ) ) { tReq.SendErrorReply ( "error generating keywords: %s", sError.cstr () ); pIndex->Unlock(); return; } pIndex->Unlock(); int iRespLen = 4; ARRAY_FOREACH ( i, dKeywords ) { iRespLen += 4 + strlen ( dKeywords[i].m_sTokenized.cstr () ); iRespLen += 4 + strlen ( dKeywords[i].m_sNormalized.cstr () ); if ( bGetStats ) iRespLen += 8; } NetOutputBuffer_c tOut ( iSock ); tOut.SendWord ( SEARCHD_OK ); tOut.SendWord ( VER_COMMAND_KEYWORDS ); tOut.SendInt ( iRespLen ); tOut.SendInt ( dKeywords.GetLength () ); ARRAY_FOREACH ( i, dKeywords ) { tOut.SendString ( dKeywords[i].m_sTokenized.cstr () ); tOut.SendString ( dKeywords[i].m_sNormalized.cstr () ); if ( bGetStats ) { tOut.SendInt ( dKeywords[i].m_iDocs ); tOut.SendInt ( dKeywords[i].m_iHits ); } } tOut.Flush (); assert ( tOut.GetError()==true || tOut.GetSentCount()==iRespLen+8 ); } ///////////////////////////////////////////////////////////////////////////// // UPDATES HANDLER ///////////////////////////////////////////////////////////////////////////// struct UpdateRequestBuilder_t : public IRequestBuilder_t { explicit UpdateRequestBuilder_t ( const CSphAttrUpdate & pUpd ) : m_tUpd ( pUpd ) {} virtual void BuildRequest ( const char * sIndexes, NetOutputBuffer_c & tOut, int ) const; protected: const CSphAttrUpdate & m_tUpd; }; struct UpdateReplyParser_t : public IReplyParser_t { explicit UpdateReplyParser_t ( int * pUpd ) : m_pUpdated ( pUpd ) {} virtual bool ParseReply ( MemInputBuffer_c & tReq, AgentConn_t &, int ) const { *m_pUpdated += tReq.GetDword (); return true; } protected: int * m_pUpdated; }; void UpdateRequestBuilder_t::BuildRequest ( const char * sIndexes, NetOutputBuffer_c & tOut, int ) const { int iReqSize = 4+strlen(sIndexes); // indexes string iReqSize += 4; // attrs array len, data ARRAY_FOREACH ( i, m_tUpd.m_dAttrs ) iReqSize += 8 + strlen ( m_tUpd.m_dAttrs[i].m_sName.cstr() ); iReqSize += 4; // number of updates iReqSize += 8*m_tUpd.m_dDocids.GetLength() + 4*m_tUpd.m_dPool.GetLength(); // 64bit ids, 32bit values // header tOut.SendDword ( SPHINX_SEARCHD_PROTO ); tOut.SendWord ( SEARCHD_COMMAND_UPDATE ); tOut.SendWord ( VER_COMMAND_UPDATE ); tOut.SendInt ( iReqSize ); tOut.SendString ( sIndexes ); tOut.SendInt ( m_tUpd.m_dAttrs.GetLength() ); ARRAY_FOREACH ( i, m_tUpd.m_dAttrs ) { tOut.SendString ( m_tUpd.m_dAttrs[i].m_sName.cstr() ); tOut.SendInt ( ( m_tUpd.m_dAttrs[i].m_eAttrType==SPH_ATTR_UINT32SET || m_tUpd.m_dAttrs[i].m_eAttrType==SPH_ATTR_UINT64SET ) ? 1 : 0 ); } tOut.SendInt ( m_tUpd.m_dDocids.GetLength() ); ARRAY_FOREACH ( i, m_tUpd.m_dDocids ) { int iHead = m_tUpd.m_dRowOffset[i]; int iTail = ( (i+1)m_pIndex ) { dFails.Submit ( sIndex, "index not available" ); return; } CSphString sError; int iUpd = pServed->m_pIndex->UpdateAttributes ( tUpd, -1, sError ); if ( iUpd<0 ) { dFails.Submit ( sIndex, sError.cstr() ); } else { iUpdated += iUpd; iSuccesses++; } } void HandleCommandUpdate ( int iSock, int iVer, InputBuffer_c & tReq ) { if ( !CheckCommandVersion ( iVer, VER_COMMAND_UPDATE, tReq ) ) return; // parse request CSphString sIndexes = tReq.GetString (); CSphAttrUpdate tUpd; CSphVector dMva; tUpd.m_dAttrs.Resize ( tReq.GetDword() ); // FIXME! check this ARRAY_FOREACH ( i, tUpd.m_dAttrs ) { tUpd.m_dAttrs[i].m_sName = tReq.GetString (); tUpd.m_dAttrs[i].m_sName.ToLower (); tUpd.m_dAttrs[i].m_eAttrType = SPH_ATTR_INTEGER; if ( iVer>=0x102 ) if ( tReq.GetDword() ) tUpd.m_dAttrs[i].m_eAttrType = SPH_ATTR_UINT32SET; } int iNumUpdates = tReq.GetInt (); // FIXME! check this tUpd.m_dDocids.Reserve ( iNumUpdates ); tUpd.m_dRowOffset.Reserve ( iNumUpdates ); for ( int i=0; i=0x101 ) ? tReq.GetUint64 () : tReq.GetDword (); tUpd.m_dDocids.Add ( (SphDocID_t)uDocid ); // FIXME! check this tUpd.m_dRowOffset.Add ( tUpd.m_dPool.GetLength() ); ARRAY_FOREACH ( iAttr, tUpd.m_dAttrs ) { if ( tUpd.m_dAttrs[iAttr].m_eAttrType==SPH_ATTR_UINT32SET ) { DWORD uCount = tReq.GetDword (); if ( !uCount ) { tUpd.m_dPool.Add ( 0 ); continue; } dMva.Resize ( uCount ); for ( DWORD j=0; j mva64 } } else { tUpd.m_dPool.Add ( tReq.GetDword() ); } } } if ( tReq.GetError() ) { tReq.SendErrorReply ( "invalid or truncated request" ); return; } // check index names CSphVector dIndexNames; ParseIndexList ( sIndexes, dIndexNames ); if ( !dIndexNames.GetLength() ) { tReq.SendErrorReply ( "no valid indexes in update request" ); return; } CSphVector dDistributed ( dIndexNames.GetLength() ); // lock safe storage for distributed indexes ARRAY_FOREACH ( i, dIndexNames ) { if ( !g_pIndexes->Exists ( dIndexNames[i].m_sName ) ) { // search amongst distributed and copy for further processing g_tDistLock.Lock(); const DistributedIndex_t * pDistIndex = g_hDistIndexes ( dIndexNames[i].m_sName ); if ( pDistIndex ) { dDistributed[i] = *pDistIndex; dDistributed[i].m_bToDelete = true; // our presence flag } g_tDistLock.Unlock(); if ( pDistIndex ) continue; else { tReq.SendErrorReply ( "unknown index '%s' in update request", dIndexNames[i].m_sName.cstr() ); return; } } } // do update SearchFailuresLog_c dFails; int iSuccesses = 0; int iUpdated = 0; ARRAY_FOREACH ( iIdx, dIndexNames ) { const char * sReqIndex = dIndexNames[iIdx].m_sName.cstr(); const ServedIndex_t * pLocked = g_pIndexes->GetRlockedEntry ( sReqIndex ); if ( pLocked ) { DoCommandUpdate ( sReqIndex, tUpd, iSuccesses, iUpdated, dFails, pLocked ); pLocked->Unlock(); } else { assert ( dDistributed[iIdx].m_bToDelete ); CSphVector& dLocal = dDistributed[iIdx].m_dLocal; ARRAY_FOREACH ( i, dLocal ) { const char * sLocal = dLocal[i].cstr(); const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( sLocal ); DoCommandUpdate ( sLocal, tUpd, iSuccesses, iUpdated, dFails, pServed ); if ( pServed ) pServed->Unlock(); } } // update remote agents if ( dDistributed[iIdx].m_bToDelete ) { DistributedIndex_t & tDist = dDistributed[iIdx]; CSphVector dAgents ( tDist.m_dAgents.GetLength() ); ARRAY_FOREACH ( i, dAgents ) dAgents[i] = tDist.m_dAgents[i]; // connect to remote agents and query them ConnectToRemoteAgents ( dAgents, false ); UpdateRequestBuilder_t tReqBuilder ( tUpd ); int iRemote = QueryRemoteAgents ( dAgents, tDist.m_iAgentConnectTimeout, tReqBuilder, NULL ); // FIXME? profile update time too? if ( iRemote ) { UpdateReplyParser_t tParser ( &iUpdated ); iSuccesses += WaitForRemoteAgents ( dAgents, tDist.m_iAgentQueryTimeout, tParser, NULL ); // FIXME? profile update time too? } } } // serve reply to client StrBuf_t sReport; dFails.BuildReport ( sReport ); if ( !iSuccesses ) { tReq.SendErrorReply ( "%s", sReport.cstr() ); return; } NetOutputBuffer_c tOut ( iSock ); if ( dFails.IsEmpty() ) { tOut.SendWord ( SEARCHD_OK ); tOut.SendWord ( VER_COMMAND_UPDATE ); tOut.SendInt ( 4 ); } else { tOut.SendWord ( SEARCHD_WARNING ); tOut.SendWord ( VER_COMMAND_UPDATE ); tOut.SendInt ( 8 + strlen ( sReport.cstr() ) ); tOut.SendString ( sReport.cstr() ); } tOut.SendInt ( iUpdated ); tOut.Flush (); } ////////////////////////////////////////////////////////////////////////// // STATUS HANDLER ////////////////////////////////////////////////////////////////////////// static inline void FormatMsec ( CSphString & sOut, int64_t tmTime ) { sOut.SetSprintf ( "%d.%03d", (int)( tmTime/1000000 ), (int)( (tmTime%1000000)/1000 ) ); } void BuildStatus ( CSphVector & dStatus ) { assert ( g_pStats ); const char * FMT64 = INT64_FMT; const char * OFF = "OFF"; const int64_t iQueriesDiv = Max ( g_pStats->m_iQueries, 1 ); const int64_t iDistQueriesDiv = Max ( g_pStats->m_iDistQueries, 1 ); // FIXME? non-transactional!!! dStatus.Add ( "uptime" ); dStatus.Add().SetSprintf ( "%u", (DWORD)time(NULL)-g_pStats->m_uStarted ); dStatus.Add ( "connections" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iConnections ); dStatus.Add ( "maxed_out" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iMaxedOut ); dStatus.Add ( "command_search" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iCommandCount[SEARCHD_COMMAND_SEARCH] ); dStatus.Add ( "command_excerpt" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iCommandCount[SEARCHD_COMMAND_EXCERPT] ); dStatus.Add ( "command_update" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iCommandCount[SEARCHD_COMMAND_UPDATE] ); dStatus.Add ( "command_keywords" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iCommandCount[SEARCHD_COMMAND_KEYWORDS] ); dStatus.Add ( "command_persist" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iCommandCount[SEARCHD_COMMAND_PERSIST] ); dStatus.Add ( "command_status" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iCommandCount[SEARCHD_COMMAND_STATUS] ); dStatus.Add ( "command_flushattrs" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iCommandCount[SEARCHD_COMMAND_FLUSHATTRS] ); dStatus.Add ( "agent_connect" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iAgentConnect ); dStatus.Add ( "agent_retry" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iAgentRetry ); dStatus.Add ( "queries" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iQueries ); dStatus.Add ( "dist_queries" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iDistQueries ); g_tDistLock.Lock(); g_hDistIndexes.IterateStart(); while ( g_hDistIndexes.IterateNext() ) { const char * sIdx = g_hDistIndexes.IterateGetKey().cstr(); CSphVector & dAgents = g_hDistIndexes.IterateGet().m_dAgents; ARRAY_FOREACH ( i, dAgents ) { int iIndex = dAgents[i].m_iStatsIndex; if ( iIndex<0 || iIndex>=STATS_MAX_AGENTS ) continue; AgentStats_t & tStats = g_pStats->m_dAgentStats[iIndex]; dStatus.Add().SetSprintf ( "ag_%s_%d_query_timeouts", sIdx, i ); dStatus.Add().SetSprintf ( FMT64, tStats.m_iTimeoutsQuery ); dStatus.Add().SetSprintf ( "ag_%s_%d_connect_timeouts", sIdx, i ); dStatus.Add().SetSprintf ( FMT64, tStats.m_iTimeoutsConnect ); dStatus.Add().SetSprintf ( "ag_%s_%d_connect_failures", sIdx, i ); dStatus.Add().SetSprintf ( FMT64, tStats.m_iConnectFailures ); dStatus.Add().SetSprintf ( "ag_%s_%d_network_errors", sIdx, i ); dStatus.Add().SetSprintf ( FMT64, tStats.m_iNetworkErrors ); dStatus.Add().SetSprintf ( "ag_%s_%d_wrong_replies", sIdx, i ); dStatus.Add().SetSprintf ( FMT64, tStats.m_iWrongReplies ); dStatus.Add().SetSprintf ( "ag_%s_%d_unexpected_closings", sIdx, i ); dStatus.Add().SetSprintf ( FMT64, tStats.m_iUnexpectedClose ); } } g_tDistLock.Unlock(); dStatus.Add ( "query_wall" ); FormatMsec ( dStatus.Add(), g_pStats->m_iQueryTime ); dStatus.Add ( "query_cpu" ); if ( g_bCpuStats ) FormatMsec ( dStatus.Add(), g_pStats->m_iQueryCpuTime ); else dStatus.Add() = OFF; dStatus.Add ( "dist_wall" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDistWallTime ); dStatus.Add ( "dist_local" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDistLocalTime ); dStatus.Add ( "dist_wait" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDistWaitTime ); if ( g_bIOStats ) { dStatus.Add ( "query_reads" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iDiskReads ); dStatus.Add ( "query_readkb" ); dStatus.Add().SetSprintf ( FMT64, g_pStats->m_iDiskReadBytes/1024 ); dStatus.Add ( "query_readtime" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDiskReadTime ); } else { dStatus.Add ( "query_reads" ); dStatus.Add() = OFF; dStatus.Add ( "query_readkb" ); dStatus.Add() = OFF; dStatus.Add ( "query_readtime" ); dStatus.Add() = OFF; } dStatus.Add ( "avg_query_wall" ); FormatMsec ( dStatus.Add(), g_pStats->m_iQueryTime / iQueriesDiv ); dStatus.Add ( "avg_query_cpu" ); if ( g_bCpuStats ) FormatMsec ( dStatus.Add(), g_pStats->m_iQueryCpuTime / iQueriesDiv ); else dStatus.Add ( OFF ); dStatus.Add ( "avg_dist_wall" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDistWallTime / iDistQueriesDiv ); dStatus.Add ( "avg_dist_local" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDistLocalTime / iDistQueriesDiv ); dStatus.Add ( "avg_dist_wait" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDistWaitTime / iDistQueriesDiv ); if ( g_bIOStats ) { dStatus.Add ( "avg_query_reads" ); dStatus.Add().SetSprintf ( "%.1f", (float)( g_pStats->m_iDiskReads*10/iQueriesDiv )/10.0f ); dStatus.Add ( "avg_query_readkb" ); dStatus.Add().SetSprintf ( "%.1f", (float)( g_pStats->m_iDiskReadBytes/iQueriesDiv )/1024.0f ); dStatus.Add ( "avg_query_readtime" ); FormatMsec ( dStatus.Add(), g_pStats->m_iDiskReadTime/iQueriesDiv ); } else { dStatus.Add ( "avg_query_reads" ); dStatus.Add() = OFF; dStatus.Add ( "avg_query_readkb" ); dStatus.Add() = OFF; dStatus.Add ( "avg_query_readtime" ); dStatus.Add() = OFF; } } void BuildMeta ( CSphVector & dStatus, const CSphQueryResultMeta & tMeta ) { if ( !tMeta.m_sError.IsEmpty() ) { dStatus.Add ( "error" ); dStatus.Add ( tMeta.m_sError ); } if ( !tMeta.m_sWarning.IsEmpty() ) { dStatus.Add ( "warning" ); dStatus.Add ( tMeta.m_sWarning ); } dStatus.Add ( "total" ); dStatus.Add().SetSprintf ( "%d", tMeta.m_iMatches ); dStatus.Add ( "total_found" ); dStatus.Add().SetSprintf ( "%d", tMeta.m_iTotalMatches ); dStatus.Add ( "time" ); dStatus.Add().SetSprintf ( "%d.%03d", tMeta.m_iQueryTime/1000, tMeta.m_iQueryTime%1000 ); int iWord = 0; tMeta.m_hWordStats.IterateStart(); while ( tMeta.m_hWordStats.IterateNext() ) { const CSphQueryResultMeta::WordStat_t & tStat = tMeta.m_hWordStats.IterateGet(); dStatus.Add().SetSprintf ( "keyword[%d]", iWord ); dStatus.Add ( tMeta.m_hWordStats.IterateGetKey() ); dStatus.Add().SetSprintf ( "docs[%d]", iWord ); dStatus.Add().SetSprintf ( "%d", tStat.m_iDocs ); dStatus.Add().SetSprintf ( "hits[%d]", iWord ); dStatus.Add().SetSprintf ( "%d", tStat.m_iHits ); iWord++; } } void HandleCommandStatus ( int iSock, int iVer, InputBuffer_c & tReq ) { if ( !CheckCommandVersion ( iVer, VER_COMMAND_STATUS, tReq ) ) return; if ( !g_pStats ) { tReq.SendErrorReply ( "performance counters disabled" ); return; } CSphVector dStatus; BuildStatus ( dStatus ); int iRespLen = 8; // int rows, int cols ARRAY_FOREACH ( i, dStatus ) iRespLen += 4 + strlen ( dStatus[i].cstr() ); NetOutputBuffer_c tOut ( iSock ); tOut.SendWord ( SEARCHD_OK ); tOut.SendWord ( VER_COMMAND_STATUS ); tOut.SendInt ( iRespLen ); tOut.SendInt ( dStatus.GetLength()/2 ); // rows tOut.SendInt ( 2 ); // cols ARRAY_FOREACH ( i, dStatus ) tOut.SendString ( dStatus[i].cstr() ); tOut.Flush (); assert ( tOut.GetError()==true || tOut.GetSentCount()==8+iRespLen ); } ////////////////////////////////////////////////////////////////////////// // FLUSH HANDLER ////////////////////////////////////////////////////////////////////////// void HandleCommandFlush ( int iSock, int iVer, InputBuffer_c & tReq ) { if ( !CheckCommandVersion ( iVer, VER_COMMAND_FLUSHATTRS, tReq ) ) return; // only if flushes are enabled if ( g_iAttrFlushPeriod<=0 ) { // flushes are disabled sphLogDebug ( "attrflush: attr_flush_period<=0, command ignored" ); } else if ( g_eWorkers==MPM_NONE ) { // --console mode, no async thread/process to handle the check sphLogDebug ( "attrflush: --console mode, command ignored" ); } else { // force a check in head process, and wait it until completes // FIXME! semi active wait.. sphLogDebug ( "attrflush: forcing check, tag=%d", g_pFlush->m_iFlushTag ); g_pFlush->m_bForceCheck = true; while ( g_pFlush->m_bForceCheck ) sphSleepMsec ( 1 ); // if we are flushing now, wait until flush completes while ( g_pFlush->m_bFlushing ) sphSleepMsec ( 10 ); sphLogDebug ( "attrflush: check finished, tag=%d", g_pFlush->m_iFlushTag ); } // return last flush tag, just for the fun of it NetOutputBuffer_c tOut ( iSock ); tOut.SendWord ( SEARCHD_OK ); tOut.SendWord ( VER_COMMAND_FLUSHATTRS ); tOut.SendInt ( 4 ); // resplen, 1 dword tOut.SendInt ( g_pFlush->m_iFlushTag ); tOut.Flush (); assert ( tOut.GetError()==true || tOut.GetSentCount()==12 ); // 8+resplen } ///////////////////////////////////////////////////////////////////////////// // GENERAL HANDLER ///////////////////////////////////////////////////////////////////////////// #define THD_STATE(_state) { if ( pThd ) pThd->m_eThdState = _state; } void HandleClientSphinx ( int iSock, const char * sClientIP, ThdDesc_t * pThd ) { MEMORY ( SPH_MEM_HANDLE_NONSQL ); THD_STATE ( THD_HANDSHAKE ); bool bPersist = false; int iTimeout = g_iReadTimeout; // wait 5 sec until first command NetInputBuffer_c tBuf ( iSock ); // send my version DWORD uServer = htonl ( SPHINX_SEARCHD_PROTO ); if ( sphSockSend ( iSock, (char*)&uServer, sizeof(DWORD) )!=sizeof(DWORD) ) { sphWarning ( "failed to send server version (client=%s)", sClientIP ); return; } // get client version and request tBuf.ReadFrom ( 4 ); // FIXME! magic int iMagic = tBuf.GetInt (); // client version is for now unused sphLogDebugv ( "conn %s: got handshake, major v.%d, err %d", sClientIP, iMagic, (int)tBuf.GetError() ); if ( tBuf.GetError() ) { sphLogDebugv ( "conn %s: exiting on handshake error", sClientIP ); return; } int iPconnIdle = 0; do { // in "persistent connection" mode, we want interruptible waits // so that the worker child could be forcibly restarted // // currently, the only signal allowed to interrupt this read is SIGTERM // letting SIGHUP interrupt causes trouble under query/rotation pressure // see sphSockRead() and ReadFrom() for details THD_STATE ( THD_NET_READ ); bool bCommand = tBuf.ReadFrom ( 8, iTimeout, bPersist ); // on SIGTERM, bail unconditionally and immediately, at all times if ( !bCommand && g_bGotSigterm ) { sphLogDebugv ( "conn %s: bailing on SIGTERM", sClientIP ); break; } // on SIGHUP vs pconn, bail if a pconn was idle for 1 sec if ( bPersist && !bCommand && g_bGotSighup && sphSockPeekErrno()==ETIMEDOUT ) { sphLogDebugv ( "conn %s: bailing idle pconn on SIGHUP", sClientIP ); break; } // on pconn that was idle for 300 sec (client_timeout), bail if ( bPersist && !bCommand && sphSockPeekErrno()==ETIMEDOUT ) { iPconnIdle += iTimeout; if ( iPconnIdle>=g_iClientTimeout ) { sphLogDebugv ( "conn %s: bailing idle pconn on client_timeout", sClientIP ); break; } continue; } else iPconnIdle = 0; // on any other signals vs pconn, ignore and keep looping // (redundant for now, as the only allowed interruption is SIGTERM, but.. let's keep it) if ( bPersist && !bCommand && tBuf.IsIntr() ) continue; // okay, signal related mess should be over, try to parse the command // (but some other socket error still might had happened, so beware) int iCommand = tBuf.GetWord (); int iCommandVer = tBuf.GetWord (); int iLength = tBuf.GetInt (); if ( tBuf.GetError() ) { // under high load, there can be pretty frequent accept() vs connect() timeouts // lets avoid agent log flood // // sphWarning ( "failed to receive client version and request (client=%s, error=%s)", sClientIP, sphSockError() ); sphLogDebugv ( "conn %s: bailing on failed request header (sockerr=%s)", sClientIP, sphSockError() ); return; } // check request if ( iCommand<0 || iCommand>=SEARCHD_COMMAND_TOTAL || iLength<0 || iLength>g_iMaxPacketSize ) { // unknown command, default response header tBuf.SendErrorReply ( "unknown command (code=%d)", iCommand ); // if request length is insane, low level comm is broken, so we bail out if ( iLength<0 || iLength>g_iMaxPacketSize ) { sphWarning ( "ill-formed client request (length=%d out of bounds)", iLength ); return; } } // count commands if ( g_pStats && iCommand>=0 && iCommandm_iCommandCount[iCommand]++; g_tStatsMutex.Unlock(); } // get request body assert ( iLength>=0 && iLength<=g_iMaxPacketSize ); if ( iLength && !tBuf.ReadFrom ( iLength ) ) { sphWarning ( "failed to receive client request body (client=%s, exp=%d)", sClientIP, iLength ); return; } // set on query guard SphCrashLogger_c::SetLastQuery ( tBuf.GetBufferPtr(), iLength, false, iCommand, iCommandVer ); // handle known commands assert ( iCommand>=0 && iCommandm_sCommand = g_dApiCommands[iCommand]; THD_STATE ( THD_QUERY ); sphLogDebugv ( "conn %s: got command %d, handling", sClientIP, iCommand ); switch ( iCommand ) { case SEARCHD_COMMAND_SEARCH: HandleCommandSearch ( iSock, iCommandVer, tBuf ); break; case SEARCHD_COMMAND_EXCERPT: HandleCommandExcerpt ( iSock, iCommandVer, tBuf ); break; case SEARCHD_COMMAND_KEYWORDS: HandleCommandKeywords ( iSock, iCommandVer, tBuf ); break; case SEARCHD_COMMAND_UPDATE: HandleCommandUpdate ( iSock, iCommandVer, tBuf ); break; case SEARCHD_COMMAND_PERSIST: bPersist = ( tBuf.GetInt()!=0 ); iTimeout = 1; sphLogDebugv ( "conn %s: pconn is now %s", sClientIP, bPersist ? "on" : "off" ); break; case SEARCHD_COMMAND_STATUS: HandleCommandStatus ( iSock, iCommandVer, tBuf ); break; case SEARCHD_COMMAND_FLUSHATTRS:HandleCommandFlush ( iSock, iCommandVer, tBuf ); break; default: assert ( 0 && "INTERNAL ERROR: unhandled command" ); break; } // set off query guard SphCrashLogger_c::SetLastQuery ( NULL, 0, false ); } while ( bPersist ); sphLogDebugv ( "conn %s: exiting", sClientIP ); } ////////////////////////////////////////////////////////////////////////// // MYSQLD PRETENDER ////////////////////////////////////////////////////////////////////////// // our copy of enum_field_types // we can't rely on mysql_com.h because it might be unavailable // // MYSQL_TYPE_DECIMAL = 0 // MYSQL_TYPE_TINY = 1 // MYSQL_TYPE_SHORT = 2 // MYSQL_TYPE_LONG = 3 // MYSQL_TYPE_FLOAT = 4 // MYSQL_TYPE_DOUBLE = 5 // MYSQL_TYPE_NULL = 6 // MYSQL_TYPE_TIMESTAMP = 7 // MYSQL_TYPE_LONGLONG = 8 // MYSQL_TYPE_INT24 = 9 // MYSQL_TYPE_DATE = 10 // MYSQL_TYPE_TIME = 11 // MYSQL_TYPE_DATETIME = 12 // MYSQL_TYPE_YEAR = 13 // MYSQL_TYPE_NEWDATE = 14 // MYSQL_TYPE_VARCHAR = 15 // MYSQL_TYPE_BIT = 16 // MYSQL_TYPE_NEWDECIMAL = 246 // MYSQL_TYPE_ENUM = 247 // MYSQL_TYPE_SET = 248 // MYSQL_TYPE_TINY_BLOB = 249 // MYSQL_TYPE_MEDIUM_BLOB = 250 // MYSQL_TYPE_LONG_BLOB = 251 // MYSQL_TYPE_BLOB = 252 // MYSQL_TYPE_VAR_STRING = 253 // MYSQL_TYPE_STRING = 254 // MYSQL_TYPE_GEOMETRY = 255 enum MysqlColumnType_e { MYSQL_COL_DECIMAL = 0, MYSQL_COL_LONG = 3, MYSQL_COL_LONGLONG = 8, MYSQL_COL_STRING = 254 }; void SendMysqlFieldPacket ( NetOutputBuffer_c & tOut, BYTE uPacketID, const char * sCol, MysqlColumnType_e eType ) { const char * sDB = ""; const char * sTable = ""; int iLen = 17 + MysqlPackedLen(sDB) + 2*( MysqlPackedLen(sTable) + MysqlPackedLen(sCol) ); int iColLen = 0; switch ( eType ) { case MYSQL_COL_DECIMAL: iColLen = 20; break; case MYSQL_COL_LONG: iColLen = 11; break; case MYSQL_COL_LONGLONG: iColLen = 20; break; case MYSQL_COL_STRING: iColLen = 255; break; } tOut.SendLSBDword ( (uPacketID<<24) + iLen ); tOut.SendMysqlString ( "def" ); // catalog tOut.SendMysqlString ( sDB ); // db tOut.SendMysqlString ( sTable ); // table tOut.SendMysqlString ( sTable ); // org_table tOut.SendMysqlString ( sCol ); // name tOut.SendMysqlString ( sCol ); // org_name tOut.SendByte ( 12 ); // filler, must be 12 (following pseudo-string length) tOut.SendByte ( 8 ); // charset_nr, 8 is latin1 tOut.SendByte ( 0 ); // charset_nr tOut.SendLSBDword ( iColLen ); // length tOut.SendByte ( BYTE(eType) ); // type (0=decimal) tOut.SendWord ( 0 ); // flags tOut.SendByte ( 0 ); // decimals tOut.SendWord ( 0 ); // filler } // from mysqld_error.h enum MysqlErrors_e { MYSQL_ERR_UNKNOWN_COM_ERROR = 1047, MYSQL_ERR_SERVER_SHUTDOWN = 1053, MYSQL_ERR_PARSE_ERROR = 1064, MYSQL_ERR_FIELD_SPECIFIED_TWICE = 1110, MYSQL_ERR_NO_SUCH_TABLE = 1146 }; void SendMysqlErrorPacket ( NetOutputBuffer_c & tOut, BYTE uPacketID, const char * sError, MysqlErrors_e iErr=MYSQL_ERR_PARSE_ERROR ) { if ( sError==NULL ) sError = "(null)"; int iErrorLen = strlen(sError)+1; // including the trailing zero int iLen = 9 + iErrorLen; int iError = iErr; // pretend to be mysql syntax error for now // send packet header tOut.SendLSBDword ( (uPacketID<<24) + iLen ); tOut.SendByte ( 0xff ); // field count, always 0xff for error packet tOut.SendByte ( (BYTE)( iError & 0xff ) ); tOut.SendByte ( (BYTE)( iError>>8 ) ); // send sqlstate (1 byte marker, 5 byte state) switch ( iErr ) { case MYSQL_ERR_SERVER_SHUTDOWN: case MYSQL_ERR_UNKNOWN_COM_ERROR: tOut.SendBytes ( "#08S01", 6 ); break; case MYSQL_ERR_NO_SUCH_TABLE: tOut.SendBytes ( "#42S02", 6 ); break; default: tOut.SendBytes ( "#42000", 6 ); break; } // send error message tOut.SendBytes ( sError, iErrorLen ); } void SendMysqlEofPacket ( NetOutputBuffer_c & tOut, BYTE uPacketID, int iWarns, bool bMoreResults=false ) { if ( iWarns<0 ) iWarns = 0; if ( iWarns>65535 ) iWarns = 65535; if ( bMoreResults ) #if USE_MYSQL iWarns |= ( SERVER_MORE_RESULTS_EXISTS<<16 ); #else iWarns = iWarns; #endif tOut.SendLSBDword ( (uPacketID<<24) + 5 ); tOut.SendByte ( 0xfe ); tOut.SendLSBDword ( iWarns ); // N warnings, 0 status } void SendMysqlOkPacket ( NetOutputBuffer_c & tOut, BYTE uPacketID, int iAffectedRows=0, int iWarns=0, const char * sMessage=NULL ) { DWORD iInsert_id = 0; char sVarLen[20] = {0}; // max 18 for packed number, +1 more just for fun void * pBuf = sVarLen; pBuf = MysqlPack ( pBuf, iAffectedRows ); pBuf = MysqlPack ( pBuf, iInsert_id ); int iLen = (char *) pBuf - sVarLen; int iMsgLen = 0; if ( sMessage ) iMsgLen = strlen(sMessage) + 1; // FIXME! does or doesn't the trailing zero necessary in Ok packet? tOut.SendLSBDword ( (uPacketID<<24) + iLen + iMsgLen + 5); tOut.SendByte ( 0 ); // ok packet tOut.SendBytes ( sVarLen, iLen ); // packed affected rows & insert_id if ( iWarns<0 ) iWarns = 0; if ( iWarns>65535 ) iWarns = 65535; tOut.SendLSBDword ( iWarns ); // N warnings, 0 status if ( iMsgLen > 0 ) tOut.SendBytes ( sMessage, iMsgLen ); } struct CmpColumns_fn { inline bool IsLess ( const CSphString & a, const CSphString & b ) const { return CmpString ( a, b )<0; } }; void HandleMysqlInsert ( const SqlStmt_t & tStmt, NetOutputBuffer_c & tOut, BYTE uPacketID, bool bReplace, bool bCommit ) { MEMORY ( SPH_MEM_INSERT_SQL ); CSphString sError; // get that index const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( tStmt.m_sIndex ); if ( !pServed ) { sError.SetSprintf ( "no such index '%s'", tStmt.m_sIndex.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } if ( !pServed->m_bRT || !pServed->m_bEnabled ) { pServed->Unlock(); sError.SetSprintf ( "index '%s' does not support INSERT (enabled=%d)", tStmt.m_sIndex.cstr(), pServed->m_bEnabled ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } ISphRtIndex * pIndex = dynamic_cast ( pServed->m_pIndex ); // FIXME? remove dynamic_cast? assert ( pIndex ); // get schema, check values count const CSphSchema & tSchema = pIndex->GetInternalSchema(); int iSchemaSz = tSchema.GetAttrsCount() + tSchema.m_dFields.GetLength() + 1; int iExp = tStmt.m_iSchemaSz; int iGot = tStmt.m_dInsertValues.GetLength(); if ( !tStmt.m_dInsertSchema.GetLength() && ( iSchemaSz!=tStmt.m_iSchemaSz ) ) { pServed->Unlock(); sError.SetSprintf ( "column count does not match schema (expected %d, got %d)", iSchemaSz, iGot ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } if ( ( iGot % iExp )!=0 ) { pServed->Unlock(); sError.SetSprintf ( "column count does not match value count (expected %d, got %d)", iExp, iGot ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } CSphVector dAttrSchema ( tSchema.GetAttrsCount() ); CSphVector dFieldSchema ( tSchema.m_dFields.GetLength() ); int iIdIndex = 0; if ( !tStmt.m_dInsertSchema.GetLength() ) { // no columns list, use index schema ARRAY_FOREACH ( i, dFieldSchema ) dFieldSchema[i] = i+1; int iFields = dFieldSchema.GetLength(); ARRAY_FOREACH ( j, dAttrSchema ) dAttrSchema[j] = j+iFields+1; } else { // got a list of columns, check for 1) existance, 2) dupes CSphVector dCheck = tStmt.m_dInsertSchema; ARRAY_FOREACH ( i, dCheck ) // OPTIMIZE! GetAttrIndex and GetFieldIndex use the linear searching. M.b. hash instead? if ( dCheck[i]!="id" && tSchema.GetAttrIndex ( dCheck[i].cstr() )==-1 && tSchema.GetFieldIndex ( dCheck[i].cstr() )==-1 ) { pServed->Unlock(); sError.SetSprintf ( "unknown column: '%s'", dCheck[i].cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr(), MYSQL_ERR_PARSE_ERROR ); return; } dCheck.Sort ( CmpColumns_fn() ); ARRAY_FOREACH ( i, dCheck ) if ( i>0 && dCheck[i-1]==dCheck[i] ) { pServed->Unlock(); sError.SetSprintf ( "column '%s' specified twice", dCheck[i].cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr(), MYSQL_ERR_FIELD_SPECIFIED_TWICE ); return; } // hash column list // OPTIMIZE! hash index columns once (!) instead SmallStringHash_T dInsertSchema; ARRAY_FOREACH ( i, tStmt.m_dInsertSchema ) dInsertSchema.Add ( i, tStmt.m_dInsertSchema[i] ); // get id index if ( !dInsertSchema.Exists("id") ) { pServed->Unlock(); SendMysqlErrorPacket ( tOut, uPacketID, "column list must contain an 'id' column" ); return; } iIdIndex = dInsertSchema["id"]; // map fields bool bIdDupe = false; ARRAY_FOREACH ( i, dFieldSchema ) { if ( dInsertSchema.Exists ( tSchema.m_dFields[i].m_sName ) ) { int iField = dInsertSchema[tSchema.m_dFields[i].m_sName]; if ( iField==iIdIndex ) { bIdDupe = true; break; } dFieldSchema[i] = iField; } else dFieldSchema[i] = -1; } if ( bIdDupe ) { pServed->Unlock(); SendMysqlErrorPacket ( tOut, uPacketID, "fields must never be named 'id' (fix your config)" ); return; } // map attrs ARRAY_FOREACH ( j, dAttrSchema ) { if ( dInsertSchema.Exists ( tSchema.GetAttr(j).m_sName ) ) { int iField = dInsertSchema[tSchema.GetAttr(j).m_sName]; if ( iField==iIdIndex ) { bIdDupe = true; break; } dAttrSchema[j] = iField; } else dAttrSchema[j] = -1; } if ( bIdDupe ) { pServed->Unlock(); sError.SetSprintf ( "attributes must never be named 'id' (fix your config)" ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } } CSphVector dStrings; CSphVector dMvas; // convert attrs for ( int c=0; cUniq(); int iLen = tVal.m_pVals->GetLength(); if ( tCol.m_eAttrType==SPH_ATTR_UINT64SET ) { dMvas.Add ( iLen*2 ); for ( int j=0; j>32 ); dMvas.Add ( uLow ); dMvas.Add ( uHi ); } } else { dMvas.Add ( iLen ); for ( int j=0; j dFields; ARRAY_FOREACH ( i, tSchema.m_dFields ) { int iQuerySchemaIdx = dFieldSchema[i]; if ( iQuerySchemaIdx < 0 ) dFields.Add ( "" ); // default value else { if ( tStmt.m_dInsertValues [ iQuerySchemaIdx + c * iExp ].m_iType!=TOK_QUOTED_STRING ) { sError.SetSprintf ( "row %d, column %d: string expected", 1+c, 1+iQuerySchemaIdx ); // 1 for human base break; } dFields.Add ( tStmt.m_dInsertValues[ iQuerySchemaIdx + c * iExp ].m_sVal.cstr() ); } } if ( !sError.IsEmpty() ) break; // do add pIndex->AddDocument ( dFields.GetLength(), dFields.Begin(), tDoc, bReplace, dStrings.Begin(), dMvas, sError ); if ( !sError.IsEmpty() ) break; } // fire exit if ( !sError.IsEmpty() ) { pServed->Unlock(); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } // no errors so far if ( bCommit ) pIndex->Commit (); pServed->Unlock(); // my OK packet SendMysqlOkPacket ( tOut, uPacketID, tStmt.m_iRowsAffected ); } // our copy of enum_server_command // we can't rely on mysql_com.h because it might be unavailable // // MYSQL_COM_SLEEP = 0 // MYSQL_COM_QUIT = 1 // MYSQL_COM_INIT_DB = 2 // MYSQL_COM_QUERY = 3 // MYSQL_COM_FIELD_LIST = 4 // MYSQL_COM_CREATE_DB = 5 // MYSQL_COM_DROP_DB = 6 // MYSQL_COM_REFRESH = 7 // MYSQL_COM_SHUTDOWN = 8 // MYSQL_COM_STATISTICS = 9 // MYSQL_COM_PROCESS_INFO = 10 // MYSQL_COM_CONNECT = 11 // MYSQL_COM_PROCESS_KILL = 12 // MYSQL_COM_DEBUG = 13 // MYSQL_COM_PING = 14 // MYSQL_COM_TIME = 15 // MYSQL_COM_DELAYED_INSERT = 16 // MYSQL_COM_CHANGE_USER = 17 // MYSQL_COM_BINLOG_DUMP = 18 // MYSQL_COM_TABLE_DUMP = 19 // MYSQL_COM_CONNECT_OUT = 20 // MYSQL_COM_REGISTER_SLAVE = 21 // MYSQL_COM_STMT_PREPARE = 22 // MYSQL_COM_STMT_EXECUTE = 23 // MYSQL_COM_STMT_SEND_LONG_DATA = 24 // MYSQL_COM_STMT_CLOSE = 25 // MYSQL_COM_STMT_RESET = 26 // MYSQL_COM_SET_OPTION = 27 // MYSQL_COM_STMT_FETCH = 28 enum { MYSQL_COM_QUIT = 1, MYSQL_COM_INIT_DB = 2, MYSQL_COM_QUERY = 3, MYSQL_COM_PING = 14, MYSQL_COM_SET_OPTION = 27 }; void HandleMysqlCallSnippets ( NetOutputBuffer_c & tOut, BYTE uPacketID, SqlStmt_t & tStmt ) { CSphString sError; // string data, string index, string query, [named opts] if ( tStmt.m_dInsertValues.GetLength()!=3 || tStmt.m_dInsertValues[0].m_iType!=TOK_QUOTED_STRING || tStmt.m_dInsertValues[1].m_iType!=TOK_QUOTED_STRING || tStmt.m_dInsertValues[2].m_iType!=TOK_QUOTED_STRING ) { SendMysqlErrorPacket ( tOut, uPacketID, "bad argument count or types in SNIPPETS() call" ); return; } const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( tStmt.m_dInsertValues[1].m_sVal ); if ( !pServed || !pServed->m_bEnabled || !pServed->m_pIndex ) { sError.SetSprintf ( "no such index %s", tStmt.m_dInsertValues[1].m_sVal.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } ExcerptQuery_t q; q.m_sSource = tStmt.m_dInsertValues[0].m_sVal; // OPTIMIZE? q.m_sWords = tStmt.m_dInsertValues[2].m_sVal; ARRAY_FOREACH ( i, tStmt.m_dCallOptNames ) { CSphString & sOpt = tStmt.m_dCallOptNames[i]; const SqlInsert_t & v = tStmt.m_dCallOptValues[i]; sOpt.ToLower(); int iExpType = -1; if ( sOpt=="before_match" ) { q.m_sBeforeMatch = v.m_sVal; iExpType = TOK_QUOTED_STRING; } else if ( sOpt=="after_match" ) { q.m_sAfterMatch = v.m_sVal; iExpType = TOK_QUOTED_STRING; } else if ( sOpt=="chunk_separator" ) { q.m_sChunkSeparator = v.m_sVal; iExpType = TOK_QUOTED_STRING; } else if ( sOpt=="html_strip_mode" ) { q.m_sStripMode = v.m_sVal; iExpType = TOK_QUOTED_STRING; } else if ( sOpt=="passage_boundary" ) { q.m_sRawPassageBoundary = v.m_sVal; iExpType = TOK_QUOTED_STRING; } else if ( sOpt=="limit" ) { q.m_iLimit = (int)v.m_iVal; iExpType = TOK_CONST_INT; } else if ( sOpt=="limit_words" ) { q.m_iLimitWords = (int)v.m_iVal; iExpType = TOK_CONST_INT; } else if ( sOpt=="limit_passages" ) { q.m_iLimitPassages = (int)v.m_iVal; iExpType = TOK_CONST_INT; } else if ( sOpt=="around" ) { q.m_iAround = (int)v.m_iVal; iExpType = TOK_CONST_INT; } else if ( sOpt=="start_passage_id" ) { q.m_iPassageId = (int)v.m_iVal; iExpType = TOK_CONST_INT; } else if ( sOpt=="exact_phrase" ) { q.m_bExactPhrase = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else if ( sOpt=="use_boundaries" ) { q.m_bUseBoundaries = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else if ( sOpt=="weight_order" ) { q.m_bWeightOrder = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else if ( sOpt=="query_mode" ) { q.m_bHighlightQuery = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else if ( sOpt=="force_all_words" ) { q.m_bForceAllWords = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else if ( sOpt=="load_files" ) { q.m_bLoadFiles = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else if ( sOpt=="allow_empty" ) { q.m_bAllowEmpty = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else if ( sOpt=="emit_zones" ) { q.m_bEmitZones = ( v.m_iVal!=0 ); iExpType = TOK_CONST_INT; } else { sError.SetSprintf ( "unknown option %s", sOpt.cstr() ); break; } // post-conf type check if ( iExpType!=v.m_iType ) { sError.SetSprintf ( "unexpected option %s type", sOpt.cstr() ); break; } } if ( !sError.IsEmpty() ) { SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); pServed->Unlock(); return; } q.m_iPassageBoundary = sphGetPassageBoundary ( q.m_sRawPassageBoundary ); if ( !sphCheckOptionsSPZ ( q, q.m_sRawPassageBoundary, sError ) ) { SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); pServed->Unlock(); return; } q.m_bHasBeforePassageMacro = SnippetTransformPassageMacros ( q.m_sBeforeMatch, q.m_sBeforeMatchPassage ); q.m_bHasAfterPassageMacro = SnippetTransformPassageMacros ( q.m_sAfterMatch, q.m_sAfterMatchPassage ); CSphIndex * pIndex = pServed->m_pIndex; SnippetContext_t tCtx; if ( !tCtx.Setup ( pIndex, q, sError ) ) { SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); pServed->Unlock(); return; } char * sResult = sphBuildExcerpt ( q, tCtx.m_pDict, tCtx.m_tTokenizer.Ptr(), &pIndex->GetMatchSchema(), pIndex, sError, tCtx.m_tStripper.Ptr(), tCtx.m_pQueryTokenizer ); if ( !sResult ) { sError.SetSprintf ( "highlighting failed: %s", sError.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); pServed->Unlock(); return; } // all ok, ship it pServed->Unlock (); // result set header packet tOut.SendLSBDword ( ((uPacketID++)<<24) + 2 ); tOut.SendByte ( 1 ); // field count (snippet) tOut.SendByte ( 0 ); // extra // fields SendMysqlFieldPacket ( tOut, uPacketID++, "snippet", MYSQL_COL_STRING ); SendMysqlEofPacket ( tOut, uPacketID++, 0 ); // data tOut.SendLSBDword ( ((uPacketID++)<<24) + MysqlPackedLen ( sResult ) ); tOut.SendMysqlString ( sResult ); SendMysqlEofPacket ( tOut, uPacketID++, 0 ); SafeDeleteArray ( sResult ); } void HandleMysqlCallKeywords ( NetOutputBuffer_c & tOut, BYTE uPacketID, SqlStmt_t & tStmt ) { CSphString sError; // string query, string index, [bool hits] int iArgs = tStmt.m_dInsertValues.GetLength(); if ( iArgs<2 || iArgs>3 || tStmt.m_dInsertValues[0].m_iType!=TOK_QUOTED_STRING || tStmt.m_dInsertValues[1].m_iType!=TOK_QUOTED_STRING || ( iArgs==3 && tStmt.m_dInsertValues[2].m_iType!=TOK_CONST_INT ) ) { SendMysqlErrorPacket ( tOut, uPacketID, "bad argument count or types in KEYWORDS() call" ); return; } const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( tStmt.m_dInsertValues[1].m_sVal ); if ( !pServed || !pServed->m_bEnabled || !pServed->m_pIndex ) { sError.SetSprintf ( "no such index %s", tStmt.m_dInsertValues[1].m_sVal.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } CSphVector dKeywords; bool bStats = ( iArgs==3 && tStmt.m_dInsertValues[2].m_iVal!=0 ); bool bRes = pServed->m_pIndex->GetKeywords ( dKeywords, tStmt.m_dInsertValues[0].m_sVal.cstr(), bStats, sError ); pServed->Unlock (); if ( !bRes ) { sError.SetSprintf ( "keyword extraction failed: %s", sError.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } // result set header packet tOut.SendLSBDword ( ((uPacketID++)<<24) + 2 ); tOut.SendByte ( 2 + ( bStats ? 2 : 0 ) ); // field count (tokenized, normalized, docs, hits) tOut.SendByte ( 0 ); // extra // fields SendMysqlFieldPacket ( tOut, uPacketID++, "tokenized", MYSQL_COL_STRING ); SendMysqlFieldPacket ( tOut, uPacketID++, "normalized", MYSQL_COL_STRING ); if ( bStats ) { SendMysqlFieldPacket ( tOut, uPacketID++, "docs", MYSQL_COL_STRING ); SendMysqlFieldPacket ( tOut, uPacketID++, "hits", MYSQL_COL_STRING ); } SendMysqlEofPacket ( tOut, uPacketID++, 0 ); // data ARRAY_FOREACH ( i, dKeywords ) { char sDocs[16], sHits[16]; snprintf ( sDocs, sizeof(sDocs), "%d", dKeywords[i].m_iDocs ); snprintf ( sHits, sizeof(sHits), "%d", dKeywords[i].m_iHits ); int iPacketLen = MysqlPackedLen ( dKeywords[i].m_sTokenized.cstr() ) + MysqlPackedLen ( dKeywords[i].m_sNormalized.cstr() ); if ( bStats ) iPacketLen += MysqlPackedLen ( sDocs ) + MysqlPackedLen ( sHits ); tOut.SendLSBDword ( ((uPacketID++)<<24) + iPacketLen ); tOut.SendMysqlString ( dKeywords[i].m_sTokenized.cstr() ); tOut.SendMysqlString ( dKeywords[i].m_sNormalized.cstr() ); if ( bStats ) { tOut.SendMysqlString ( sDocs ); tOut.SendMysqlString ( sHits ); } } SendMysqlEofPacket ( tOut, uPacketID++, 0 ); } void HandleMysqlDescribe ( NetOutputBuffer_c & tOut, BYTE uPacketID, SqlStmt_t & tStmt ) { const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( tStmt.m_sIndex ); if ( !pServed || !pServed->m_bEnabled || !pServed->m_pIndex ) { CSphString sError; sError.SetSprintf ( "no such index '%s'", tStmt.m_sIndex.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr(), MYSQL_ERR_NO_SUCH_TABLE ); return; } // result set header packet tOut.SendLSBDword ( ((uPacketID++)<<24) + 2 ); tOut.SendByte ( 2 ); // field count (field, type) tOut.SendByte ( 0 ); // extra // fields SendMysqlFieldPacket ( tOut, uPacketID++, "Field", MYSQL_COL_STRING ); SendMysqlFieldPacket ( tOut, uPacketID++, "Type", MYSQL_COL_STRING ); SendMysqlEofPacket ( tOut, uPacketID++, 0 ); // data const char * sIdType = USE_64BIT ? "bigint" : "integer"; tOut.SendLSBDword ( ((uPacketID++)<<24) + 3 + MysqlPackedLen ( sIdType ) ); tOut.SendMysqlString ( "id" ); tOut.SendMysqlString ( sIdType ); const CSphSchema & tSchema = pServed->m_pIndex->GetMatchSchema(); ARRAY_FOREACH ( i, tSchema.m_dFields ) { const CSphColumnInfo & tCol = tSchema.m_dFields[i]; tOut.SendLSBDword ( ((uPacketID++)<<24) + MysqlPackedLen ( tCol.m_sName.cstr() ) + 6 ); tOut.SendMysqlString ( tCol.m_sName.cstr() ); tOut.SendMysqlString ( "field" ); } for ( int i=0; iUnlock(); SendMysqlEofPacket ( tOut, uPacketID++, 0 ); } struct IndexNameLess_fn { inline bool IsLess ( const CSphNamedInt & a, const CSphNamedInt & b ) const { return strcasecmp ( a.m_sName.cstr(), b.m_sName.cstr() )<0; } }; void HandleMysqlShowTables ( NetOutputBuffer_c & tOut, BYTE uPacketID ) { // result set header packet tOut.SendLSBDword ( ((uPacketID++)<<24) + 2 ); tOut.SendByte ( 2 ); // field count (index, type) tOut.SendByte ( 0 ); // extra // fields SendMysqlFieldPacket ( tOut, uPacketID++, "Index", MYSQL_COL_STRING ); SendMysqlFieldPacket ( tOut, uPacketID++, "Type", MYSQL_COL_STRING ); SendMysqlEofPacket ( tOut, uPacketID++, 0 ); // all the indexes // 0 local, 1 distributed, 2 rt CSphVector dIndexes; for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) if ( it.Get().m_bEnabled ) { CSphNamedInt & tIdx = dIndexes.Add(); tIdx.m_sName = it.GetKey(); tIdx.m_iValue = it.Get().m_bRT ? 2 : 0; } g_tDistLock.Lock(); g_hDistIndexes.IterateStart(); while ( g_hDistIndexes.IterateNext() ) { CSphNamedInt & tIdx = dIndexes.Add(); tIdx.m_sName = g_hDistIndexes.IterateGetKey(); tIdx.m_iValue = 1; } g_tDistLock.Unlock(); dIndexes.Sort ( IndexNameLess_fn() ); ARRAY_FOREACH ( i, dIndexes ) { const char * sType = "?"; switch ( dIndexes[i].m_iValue ) { case 0: sType = "local"; break; case 1: sType = "distributed"; break; case 2: sType = "rt"; break; } tOut.SendLSBDword ( ((uPacketID++)<<24) + MysqlPackedLen ( dIndexes[i].m_sName.cstr() ) + MysqlPackedLen ( sType ) ); tOut.SendMysqlString ( dIndexes[i].m_sName.cstr() ); tOut.SendMysqlString ( sType ); } SendMysqlEofPacket ( tOut, uPacketID++, 0 ); } ////////////////////////////////////////////////////////////////////////// void HandleMysqlUpdate ( NetOutputBuffer_c & tOut, BYTE uPacketID, const SqlStmt_t & tStmt, bool bCommit ) { CSphString sError; const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( tStmt.m_sIndex ); if ( !pServed ) { sError.SetSprintf ( "no such index '%s'", tStmt.m_sIndex.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } if ( !pServed->m_bEnabled ) { pServed->Unlock(); sError.SetSprintf ( "index '%s' does not support Update (enabled=%d)", tStmt.m_sIndex.cstr(), pServed->m_bEnabled ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } int iAffected = pServed->m_pIndex->UpdateAttributes ( tStmt.m_tUpdate, -1, sError ); if ( iAffected<0 ) { pServed->Unlock(); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } if ( bCommit && pServed->m_bRT ) { ISphRtIndex * pIndex = static_cast ( pServed->m_pIndex ); pIndex->Commit (); } pServed->Unlock(); SendMysqlOkPacket ( tOut, uPacketID, iAffected ); } ////////////////////////////////////////////////////////////////////////// #define SPH_MAX_NUMERIC_STR 64 class SqlRowBuffer_c { public: SqlRowBuffer_c () : m_pBuf ( NULL ) , m_iLen ( 0 ) , m_iLimit ( sizeof ( m_dBuf ) ) { } ~SqlRowBuffer_c () { SafeDeleteArray ( m_pBuf ); } char * Reserve ( int iLen ) { int iNewSize = m_iLen+iLen; if ( iNewSize<=m_iLimit ) return Get(); int iNewLimit = Max ( m_iLimit*2, iNewSize ); char * pBuf = new char [iNewLimit]; memcpy ( pBuf, m_pBuf ? m_pBuf : m_dBuf, m_iLen ); SafeDeleteArray ( m_pBuf ); m_pBuf = pBuf; m_iLimit = iNewLimit; return Get(); } char * Get () { return m_pBuf ? m_pBuf+m_iLen : m_dBuf+m_iLen; } char * Off ( int iOff ) { assert ( iOff void PutNumeric ( const char * sFormat, T tVal ) { Reserve ( SPH_MAX_NUMERIC_STR ); int iLen = snprintf ( Get()+1, SPH_MAX_NUMERIC_STR-1, sFormat, tVal ); *Get() = BYTE(iLen); IncPtr ( 1+iLen ); } void PutString ( const char * sMsg ) { int iLen = sMsg ? strlen ( sMsg ) : 0; Reserve ( 1+iLen ); char * pBegin = Get(); char * pStr = (char *)MysqlPack ( pBegin, iLen ); if ( pStr>pBegin ) { memcpy ( pStr, sMsg, iLen ); IncPtr ( ( pStr-pBegin )+iLen ); } } private: char m_dBuf[4096]; char * m_pBuf; int m_iLen; int m_iLimit; }; bool HandleMysqlSelect ( NetOutputBuffer_c & tOut, BYTE & uPacketID, SearchHandler_c & tHandler ) { // lets check all query for errors CSphString sError; ARRAY_FOREACH ( i, tHandler.m_dQueries ) { CheckQuery ( tHandler.m_dQueries[i], tHandler.m_dResults[i].m_sError ); if ( !tHandler.m_dResults[i].m_sError.IsEmpty() ) sError.SetSprintf ( "%squery %d error: %s ; ", sError.cstr(), i, tHandler.m_dResults[i].m_sError.cstr() ); } if ( sError.Length() ) { SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return false; } // actual searching tHandler.RunQueries (); if ( g_bGotSigterm ) { sphLogDebug ( "HandleClientMySQL: got SIGTERM, sending the packet MYSQL_ERR_SERVER_SHUTDOWN" ); SendMysqlErrorPacket ( tOut, uPacketID, "Server shutdown in progress", MYSQL_ERR_SERVER_SHUTDOWN ); return false; } return true; } void SendMysqlSelectResult ( NetOutputBuffer_c & tOut, BYTE & uPacketID, SqlRowBuffer_c & dRows, const AggrResult_t & tRes, bool bMoreResultsFollow ) { if ( !tRes.m_iSuccesses ) { SendMysqlErrorPacket ( tOut, uPacketID++, tRes.m_sError.cstr() ); return; } // result set header packet tOut.SendLSBDword ( ((uPacketID++)<<24) + 2 ); if ( g_bCompatResults ) tOut.SendByte ( BYTE ( 2+tRes.m_tSchema.GetAttrsCount() ) ); else tOut.SendByte ( BYTE ( tRes.m_tSchema.GetAttrsCount() ) ); tOut.SendByte ( 0 ); // extra // field packets if ( g_bCompatResults ) { SendMysqlFieldPacket ( tOut, uPacketID++, "id", USE_64BIT ? MYSQL_COL_LONGLONG : MYSQL_COL_LONG ); SendMysqlFieldPacket ( tOut, uPacketID++, "weight", MYSQL_COL_LONG ); } for ( int i=0; i ( DOCID_FMT, tMatch.m_iDocID ); dRows.PutNumeric ( "%u", tMatch.m_iWeight ); } const CSphSchema & tSchema = tRes.m_tSchema; for ( int i=0; i ( INT64_FMT, tMatch.GetAttr(tLoc) ); else dRows.PutNumeric ( "%u", (DWORD)tMatch.GetAttr(tLoc) ); break; case SPH_ATTR_FLOAT: dRows.PutNumeric ( "%f", tMatch.GetAttrFloat(tLoc) ); break; case SPH_ATTR_UINT64SET: case SPH_ATTR_UINT32SET: { int iLenOff = dRows.Length(); dRows.Reserve ( 4 ); dRows.IncPtr ( 4 ); assert ( tMatch.GetAttr ( tLoc )==0 || tRes.m_dTag2Pools [ tMatch.m_iTag ].m_pMva ); const DWORD * pValues = tMatch.GetAttrMVA ( tLoc, tRes.m_dTag2Pools [ tMatch.m_iTag ].m_pMva ); if ( pValues ) { DWORD nValues = *pValues++; assert ( eAttrType==SPH_ATTR_UINT32SET || ( nValues%2 )==0 ); if ( eAttrType==SPH_ATTR_UINT32SET ) { while ( nValues-- ) { dRows.Reserve ( SPH_MAX_NUMERIC_STR ); int iLen = snprintf ( dRows.Get(), SPH_MAX_NUMERIC_STR, nValues>0 ? "%u," : "%u", *pValues++ ); dRows.IncPtr ( iLen ); } } else { for ( ; nValues; nValues-=2, pValues+=2 ) { uint64_t uVal = MVA_UPSIZE ( pValues ); dRows.Reserve ( SPH_MAX_NUMERIC_STR ); int iLen = snprintf ( dRows.Get(), SPH_MAX_NUMERIC_STR, nValues>2 ? UINT64_FMT"," : UINT64_FMT, uVal ); dRows.IncPtr ( iLen ); } } } // manually pack length, forcibly into exactly 3 bytes int iLen = dRows.Length()-iLenOff-4; char * pLen = dRows.Off ( iLenOff ); pLen[0] = (BYTE)0xfd; pLen[1] = (BYTE)( iLen & 0xff ); pLen[2] = (BYTE)( ( iLen>>8 ) & 0xff ); pLen[3] = (BYTE)( ( iLen>>16 ) & 0xff ); break; } case SPH_ATTR_STRING: { const BYTE * pStrings = tRes.m_dTag2Pools [ tMatch.m_iTag ].m_pStrings; // get that string const BYTE * pStr = NULL; int iLen = 0; DWORD uOffset = (DWORD) tMatch.GetAttr ( tLoc ); if ( uOffset ) { assert ( pStrings ); iLen = sphUnpackStr ( pStrings+uOffset, &pStr ); } // send length dRows.Reserve ( iLen+4 ); char * pOutStr = (char*)MysqlPack ( dRows.Get(), iLen ); // send string data if ( iLen ) memcpy ( pOutStr, pStr, iLen ); dRows.IncPtr ( pOutStr-dRows.Get()+iLen ); break; } default: char * pDef = dRows.Reserve ( 2 ); pDef[0] = 1; pDef[1] = '-'; dRows.IncPtr ( 2 ); break; } } tOut.SendLSBDword ( ((uPacketID++)<<24) + ( dRows.Length() ) ); tOut.SendBytes ( dRows.Off ( 0 ), dRows.Length() ); dRows.Reset(); } // eof packet SendMysqlEofPacket ( tOut, uPacketID++, iWarns, bMoreResultsFollow ); } void HandleMysqlWarning ( NetOutputBuffer_c & tOut, BYTE & uPacketID, const CSphQueryResultMeta & tLastMeta, SqlRowBuffer_c & dRows, bool bMoreResultsFollow ) { // can't send simple ok if there are more results to send // as it breaks order of multi-result output if ( tLastMeta.m_sWarning.IsEmpty() && !bMoreResultsFollow ) { SendMysqlOkPacket ( tOut, uPacketID ); return; } // result set header packet tOut.SendLSBDword ( ((uPacketID++)<<24) + 2 ); tOut.SendByte ( 3 ); // field count (level+code+message) tOut.SendByte ( 0 ); // extra // field packets SendMysqlFieldPacket ( tOut, uPacketID++, "Level", MYSQL_COL_STRING ); SendMysqlFieldPacket ( tOut, uPacketID++, "Code", MYSQL_COL_DECIMAL ); SendMysqlFieldPacket ( tOut, uPacketID++, "Message", MYSQL_COL_STRING ); SendMysqlEofPacket ( tOut, uPacketID++, 0, bMoreResultsFollow ); // row dRows.Reset(); dRows.PutString ( "warning" ); dRows.PutString ( "1000" ); dRows.PutString ( tLastMeta.m_sWarning.cstr() ); tOut.SendLSBDword ( ((uPacketID++)<<24) + ( dRows.Length() ) ); tOut.SendBytes ( dRows.Off ( 0 ), dRows.Length() ); dRows.Reset(); // cleanup SendMysqlEofPacket ( tOut, uPacketID++, 0, bMoreResultsFollow ); } void HandleMysqlMeta ( NetOutputBuffer_c & tOut, BYTE & uPacketID, const CSphQueryResultMeta & tLastMeta, SqlRowBuffer_c & dRows, bool bStatus, bool bMoreResultsFollow ) { CSphVector dStatus; if ( bStatus ) BuildStatus ( dStatus ); else BuildMeta ( dStatus, tLastMeta ); // result set header packet tOut.SendLSBDword ( ((uPacketID++)<<24) + 2 ); tOut.SendByte ( 2 ); // field count (level+code+message) tOut.SendByte ( 0 ); // extra // field packets SendMysqlFieldPacket ( tOut, uPacketID++, "Variable_name", MYSQL_COL_STRING ); SendMysqlFieldPacket ( tOut, uPacketID++, "Value", MYSQL_COL_STRING ); SendMysqlEofPacket ( tOut, uPacketID++, 0, bMoreResultsFollow ); // send rows dRows.Reset(); for ( int iRow=0; iRowGetRlockedEntry ( tStmt.m_sIndex ); if ( !pServed ) { sError.SetSprintf ( "no such index '%s'", tStmt.m_sIndex.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } if ( !pServed->m_bRT || !pServed->m_bEnabled ) { pServed->Unlock(); sError.SetSprintf ( "index '%s' does not support DELETE (enabled=%d)", tStmt.m_sIndex.cstr(), pServed->m_bEnabled ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } ISphRtIndex * pIndex = static_cast ( pServed->m_pIndex ); if ( !pIndex->DeleteDocument ( tStmt.m_dDeleteIds.Begin(), tStmt.m_dDeleteIds.GetLength(), sError ) ) { pServed->Unlock(); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } if ( bCommit ) pIndex->Commit (); pServed->Unlock(); SendMysqlOkPacket ( tOut, uPacketID ); // FIXME? affected rows } void HandleMysqlMultiStmt ( NetOutputBuffer_c & tOut, BYTE uPacketID, const CSphVector & dStmt, CSphQueryResultMeta & tLastMeta, SqlRowBuffer_c & dRows, ThdDesc_t * pThd, const CSphString& sWarning ) { // select count int iSelect = 0; ARRAY_FOREACH ( i, dStmt ) if ( dStmt[i].m_eStmt==STMT_SELECT ) iSelect++; if ( !iSelect ) { tLastMeta = CSphQueryResultMeta(); return; } if ( pThd ) pThd->m_sCommand = g_dSqlStmts[STMT_SELECT]; // setup query for searching SearchHandler_c tHandler ( iSelect, true ); iSelect = 0; ARRAY_FOREACH ( i, dStmt ) { if ( dStmt[i].m_eStmt==STMT_SELECT ) tHandler.m_dQueries[iSelect++] = dStmt[i].m_tQuery; } // do search bool bSearchOK = HandleMysqlSelect ( tOut, uPacketID, tHandler ); // save meta for SHOW * CSphQueryResultMeta tPrevMeta = tLastMeta; tLastMeta = tHandler.m_dResults.Last(); if ( !bSearchOK ) return; // send multi-result set iSelect = 0; ARRAY_FOREACH ( i, dStmt ) { SqlStmt_e eStmt = dStmt[i].m_eStmt; THD_STATE ( THD_QUERY ); if ( pThd ) pThd->m_sCommand = g_dSqlStmts[eStmt]; const CSphQueryResultMeta & tMeta = iSelect-1>=0 ? tHandler.m_dResults[iSelect-1] : tPrevMeta; bool bMoreResultsFollow = (i+1)SetSprintf ( "Unknown collation: '%s'", sName.cstr() ); return SPH_COLLATION_DEFAULT; } void HandleMysqlSet ( NetOutputBuffer_c & tOut, BYTE & uPacketID, SqlStmt_t & tStmt, SessionVars_t & tVars ) { MEMORY ( SPH_MEM_COMMIT_SET_SQL ); CSphString sError; tStmt.m_sSetName.ToLower(); if ( tStmt.m_eSet==SET_LOCAL && tStmt.m_sSetName=="autocommit" ) { // per-session AUTOCOMMIT tVars.m_bAutoCommit = ( tStmt.m_iSetValue!=0 ); tVars.m_bInTransaction = false; // commit all pending changes if ( tVars.m_bAutoCommit ) { ISphRtIndex * pIndex = sphGetCurrentIndexRT(); if ( pIndex ) pIndex->Commit(); } } else if ( tStmt.m_eSet==SET_LOCAL && tStmt.m_sSetName=="collation_connection" ) { // per-session COLLATION_CONNECTION CSphString & sVal = tStmt.m_sSetValue; sVal.ToLower(); tVars.m_eCollation = sphCollationFromName ( sVal, &sError ); if ( !sError.IsEmpty() ) { SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } } else if ( tStmt.m_eSet==SET_LOCAL && ( tStmt.m_sSetName=="character_set_results" || tStmt.m_sSetName=="sql_auto_is_null" ) ) { // per-session CHARACTER_SET_RESULTS; just ignore for now } else if ( tStmt.m_eSet==SET_GLOBAL_UVAR ) { // global user variable if ( g_eWorkers!=MPM_THREADS ) { SendMysqlErrorPacket ( tOut, uPacketID, "SET GLOBAL currently requires workers=threads" ); return; } g_tUservarsMutex.Lock(); Uservar_t * pVar = g_hUservars ( tStmt.m_sSetName ); if ( pVar ) { assert ( pVar->m_eType==USERVAR_INT_SET ); pVar->m_pVal->SwapData ( tStmt.m_dSetValues ); } else { Uservar_t tVar; tVar.m_eType = USERVAR_INT_SET; tVar.m_pVal = new CSphVector; tVar.m_pVal->SwapData ( tStmt.m_dSetValues ); tVar.m_pVal->Sort(); g_hUservars.Add ( tVar, tStmt.m_sSetName ); // FIXME? free those on shutdown? } g_tUservarsMutex.Unlock(); } else if ( tStmt.m_eSet==SET_GLOBAL_SVAR ) { // global server variable if ( g_eWorkers!=MPM_THREADS ) { SendMysqlErrorPacket ( tOut, uPacketID, "SET GLOBAL currently requires workers=threads" ); return; } if ( tStmt.m_sSetName=="query_log_format" ) { if ( tStmt.m_sSetValue=="plain" ) g_eLogFormat = LOG_FORMAT_PLAIN; else if ( tStmt.m_sSetValue=="sphinxql" ) g_eLogFormat = LOG_FORMAT_SPHINXQL; else { SendMysqlErrorPacket ( tOut, uPacketID, "Unknown query_log_format value (must be plain or sphinxql)" ); return; } } else if ( tStmt.m_sSetName=="log_level" ) { if ( tStmt.m_sSetValue=="info" ) g_eLogLevel = SPH_LOG_INFO; else if ( tStmt.m_sSetValue=="debug" ) g_eLogLevel = SPH_LOG_DEBUG; else if ( tStmt.m_sSetValue=="debugv" ) g_eLogLevel = SPH_LOG_VERBOSE_DEBUG; else if ( tStmt.m_sSetValue=="debugvv" ) g_eLogLevel = SPH_LOG_VERY_VERBOSE_DEBUG; else { SendMysqlErrorPacket ( tOut, uPacketID, "Unknown log_level value (must be one of info, debug, debugv, debugvv)" ); return; } } else { sError.SetSprintf ( "Unknown system variable '%s'", tStmt.m_sSetName.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } } else { // unknown case, return error sError.SetSprintf ( "Unknown session variable '%s' in SET statement", tStmt.m_sSetName.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); return; } // it went ok SendMysqlOkPacket ( tOut, uPacketID ); } void HandleClientMySQL ( int iSock, const char * sClientIP, ThdDesc_t * pThd ) { MEMORY ( SPH_MEM_HANDLE_SQL ); THD_STATE ( THD_HANDSHAKE ); const int INTERACTIVE_TIMEOUT = 900; NetInputBuffer_c tIn ( iSock ); NetOutputBuffer_c tOut ( iSock ); // OPTIMIZE? looks like buffer size matters a lot.. if ( sphSockSend ( iSock, g_sMysqlHandshake, g_iMysqlHandshake )!=g_iMysqlHandshake ) { sphWarning ( "failed to send server version (client=%s)", sClientIP ); return; } SessionVars_t tVars; // session variables and state bool bAuthed = false; BYTE uPacketID = 1; CSphQueryResultMeta tLastMeta; CSphString sQuery; // to keep data alive for SphCrashQuery_c for ( ;; ) { // set off query guard SphCrashLogger_c::SetLastQuery ( NULL, 0, true ); CSphString sError; // send the packet formed on the previous cycle THD_STATE ( THD_NET_WRITE ); if ( !tOut.Flush() ) break; // get next packet // we want interruptible calls here, so that shutdowns could be honoured THD_STATE ( THD_NET_READ ); if ( !tIn.ReadFrom ( 4, INTERACTIVE_TIMEOUT, true ) ) break; const int MAX_PACKET_LEN = 0xffffffL; // 16777215 bytes, max low level packet size DWORD uPacketHeader = tIn.GetLSBDword (); int iPacketLen = ( uPacketHeader & MAX_PACKET_LEN ); if ( !tIn.ReadFrom ( iPacketLen, INTERACTIVE_TIMEOUT, true ) ) break; // handle it! uPacketID = 1 + (BYTE)( uPacketHeader>>24 ); // client will expect this id // handle big packets if ( iPacketLen==MAX_PACKET_LEN ) { NetInputBuffer_c tIn2 ( iSock ); int iAddonLen = -1; do { if ( !tIn2.ReadFrom ( 4, INTERACTIVE_TIMEOUT, true ) ) break; DWORD uAddon = tIn2.GetLSBDword(); uPacketID = 1 + (BYTE)( uAddon>>24 ); iAddonLen = ( uAddon & MAX_PACKET_LEN ); if ( !tIn.ReadFrom ( iAddonLen, INTERACTIVE_TIMEOUT, true, true ) ) { iAddonLen = -1; break; } iPacketLen += iAddonLen; } while ( iAddonLen==MAX_PACKET_LEN ); if ( iAddonLen<0 ) break; } // handle auth packet if ( !bAuthed ) { bAuthed = true; SendMysqlOkPacket ( tOut, uPacketID ); continue; } // get command, handle special packets const BYTE uMysqlCmd = tIn.GetByte (); if ( uMysqlCmd==MYSQL_COM_QUIT ) { // client is done break; } else if ( uMysqlCmd==MYSQL_COM_PING || uMysqlCmd==MYSQL_COM_INIT_DB ) { // client wants a pong SendMysqlOkPacket ( tOut, uPacketID ); continue; } else if ( uMysqlCmd==MYSQL_COM_SET_OPTION ) { // bMulti = ( tIn.GetWord()==MYSQL_OPTION_MULTI_STATEMENTS_ON ); // that's how we could double check and validate multi query SendMysqlOkPacket ( tOut, uPacketID ); continue; } else if ( uMysqlCmd!=MYSQL_COM_QUERY ) { // default case, unknown command // (and query is handled just below) sError.SetSprintf ( "unknown command (code=%d)", uMysqlCmd ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr(), MYSQL_ERR_UNKNOWN_COM_ERROR ); continue; } // handle query packet assert ( uMysqlCmd==MYSQL_COM_QUERY ); sQuery = tIn.GetRawString ( iPacketLen-1 ); // set on query guard SphCrashLogger_c::SetLastQuery ( (const BYTE *)sQuery.cstr(), sQuery.Length(), true ); // parse SQL query CSphVector dStmt; bool bParsedOK = ParseSqlQuery ( sQuery, dStmt, sError, tVars.m_eCollation ); SqlStmt_e eStmt = bParsedOK ? dStmt.Begin()->m_eStmt : STMT_PARSE_ERROR; SqlStmt_t * pStmt = dStmt.Begin(); assert ( !bParsedOK || pStmt ); if ( pThd ) pThd->m_sCommand = g_dSqlStmts[eStmt]; THD_STATE ( THD_QUERY ); SqlRowBuffer_c dRows; // handle multi SQL query if ( bParsedOK && dStmt.GetLength()>1 ) { HandleMysqlMultiStmt ( tOut, uPacketID, dStmt, tLastMeta, dRows, pThd, sError ); continue; } // handle SQL query switch ( eStmt ) { case STMT_PARSE_ERROR: tLastMeta = CSphQueryResultMeta(); tLastMeta.m_sError = sError; SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); break; case STMT_SELECT: { MEMORY ( SPH_MEM_SELECT_SQL ); SearchHandler_c tHandler ( 1, true ); tHandler.m_dQueries[0] = dStmt.Begin()->m_tQuery; if ( HandleMysqlSelect ( tOut, uPacketID, tHandler ) ) { AggrResult_t & tLast = tHandler.m_dResults.Last(); if ( !sError.IsEmpty() ) tLast.m_sWarning = sError; SendMysqlSelectResult ( tOut, uPacketID, dRows, tLast, false ); } // save meta for SHOW META tLastMeta = tHandler.m_dResults.Last(); break; } case STMT_SHOW_WARNINGS: HandleMysqlWarning ( tOut, uPacketID, tLastMeta, dRows, false ); break; case STMT_SHOW_STATUS: case STMT_SHOW_META: HandleMysqlMeta ( tOut, uPacketID, tLastMeta, dRows, eStmt==STMT_SHOW_STATUS, false ); break; case STMT_INSERT: case STMT_REPLACE: HandleMysqlInsert ( *pStmt, tOut, uPacketID, eStmt==STMT_REPLACE, tVars.m_bAutoCommit && !tVars.m_bInTransaction ); continue; case STMT_DELETE: HandleMysqlDelete ( tOut, uPacketID, *pStmt, tVars.m_bAutoCommit && !tVars.m_bInTransaction ); continue; case STMT_SET: HandleMysqlSet ( tOut, uPacketID, *pStmt, tVars ); continue; case STMT_BEGIN: { MEMORY ( SPH_MEM_COMMIT_BEGIN_SQL ); tVars.m_bInTransaction = true; ISphRtIndex * pIndex = sphGetCurrentIndexRT(); if ( pIndex ) pIndex->Commit(); SendMysqlOkPacket ( tOut, uPacketID ); continue; } case STMT_COMMIT: case STMT_ROLLBACK: { MEMORY ( SPH_MEM_COMMIT_SQL ); tVars.m_bInTransaction = false; ISphRtIndex * pIndex = sphGetCurrentIndexRT(); if ( pIndex ) { if ( eStmt==STMT_COMMIT ) pIndex->Commit(); else pIndex->RollBack(); } SendMysqlOkPacket ( tOut, uPacketID ); continue; } case STMT_CALL: pStmt->m_sCallProc.ToUpper(); if ( pStmt->m_sCallProc=="SNIPPETS" ) HandleMysqlCallSnippets ( tOut, uPacketID, *pStmt ); else if ( pStmt->m_sCallProc=="KEYWORDS" ) HandleMysqlCallKeywords ( tOut, uPacketID, *pStmt ); else { sError.SetSprintf ( "no such builtin procedure %s", pStmt->m_sCallProc.cstr() ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); } continue; case STMT_DESC: HandleMysqlDescribe ( tOut, uPacketID, *pStmt ); continue; case STMT_SHOW_TABLES: HandleMysqlShowTables ( tOut, uPacketID ); continue; case STMT_UPDATE: HandleMysqlUpdate ( tOut, uPacketID, *pStmt, tVars.m_bAutoCommit && !tVars.m_bInTransaction ); continue; case STMT_DUMMY: SendMysqlOkPacket ( tOut, uPacketID ); continue; case STMT_CREATE_FUNC: if ( !sphUDFCreate ( pStmt->m_sUdfLib.cstr(), pStmt->m_sUdfName.cstr(), pStmt->m_eUdfType, sError ) ) SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); else SendMysqlOkPacket ( tOut, uPacketID ); continue; case STMT_DROP_FUNC: if ( !sphUDFDrop ( pStmt->m_sUdfName.cstr(), sError ) ) SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); else SendMysqlOkPacket ( tOut, uPacketID ); continue; default: sError.SetSprintf ( "internal error: unhandled statement type (value=%d)", eStmt ); SendMysqlErrorPacket ( tOut, uPacketID, sError.cstr() ); break; } // switch } // for ( ;; ) // set off query guard SphCrashLogger_c::SetLastQuery ( NULL, 0, true ); } ////////////////////////////////////////////////////////////////////////// // HANDLE-BY-LISTENER ////////////////////////////////////////////////////////////////////////// void HandleClient ( ProtocolType_e eProto, int iSock, const char * sClientIP, ThdDesc_t * pThd ) { switch ( eProto ) { case PROTO_SPHINX: HandleClientSphinx ( iSock, sClientIP, pThd ); break; case PROTO_MYSQL41: HandleClientMySQL ( iSock, sClientIP, pThd ); break; default: assert ( 0 && "unhandled protocol type" ); break; } } ///////////////////////////////////////////////////////////////////////////// // INDEX ROTATION ///////////////////////////////////////////////////////////////////////////// bool TryRename ( const char * sIndex, const char * sPrefix, const char * sFromPostfix, const char * sToPostfix, bool bFatal ) { char sFrom [ SPH_MAX_FILENAME_LEN ]; char sTo [ SPH_MAX_FILENAME_LEN ]; snprintf ( sFrom, sizeof(sFrom), "%s%s", sPrefix, sFromPostfix ); snprintf ( sTo, sizeof(sTo), "%s%s", sPrefix, sToPostfix ); #if USE_WINDOWS ::unlink ( sTo ); #endif if ( rename ( sFrom, sTo ) ) { if ( bFatal ) { sphFatal ( "rotating index '%s': rollback rename '%s' to '%s' failed: %s", sIndex, sFrom, sTo, strerror(errno) ); } else { sphWarning ( "rotating index '%s': rename '%s' to '%s' failed: %s", sIndex, sFrom, sTo, strerror(errno) ); } return false; } return true; } bool HasFiles ( const ServedIndex_t & tIndex, const char ** dExts ) { char sFile [ SPH_MAX_FILENAME_LEN ]; const char * sPath = tIndex.m_sIndexPath.cstr(); for ( int i=0; i0 ) { if ( tIndex.m_bOnlyNew ) sphWarning ( "rotating index '%s': '%s' unreadable: %s; NOT SERVING", sIndex, sFile, strerror(errno) ); else sphWarning ( "rotating index '%s': '%s' unreadable: %s; using old index", sIndex, sFile, strerror(errno) ); } return false; } } sphLogDebug ( "RotateIndexGreedy: new index is readable" ); if ( !tIndex.m_bOnlyNew ) { // rename current to old for ( int i=0; iLeakTokenizer (); // FIXME! disable support of that old indexes and remove this bullshit CSphDict * pDictionary = tIndex.m_pIndex->LeakDictionary (); if ( !tIndex.m_pIndex->Prealloc ( tIndex.m_bMlock, g_bStripPath, sWarning ) || !tIndex.m_pIndex->Preread() ) { if ( tIndex.m_bOnlyNew ) { sphWarning ( "rotating index '%s': .new preload failed: %s; NOT SERVING", sIndex, tIndex.m_pIndex->GetLastError().cstr() ); return false; } else { sphWarning ( "rotating index '%s': .new preload failed: %s", sIndex, tIndex.m_pIndex->GetLastError().cstr() ); // try to recover for ( int j=0; jPrealloc ( tIndex.m_bMlock, g_bStripPath, sWarning ) || !tIndex.m_pIndex->Preread() ) { sphWarning ( "rotating index '%s': .new preload failed; ROLLBACK FAILED; INDEX UNUSABLE", sIndex ); tIndex.m_bEnabled = false; } else { tIndex.m_bEnabled = true; bPreread = true; sphWarning ( "rotating index '%s': .new preload failed; using old index", sIndex ); } if ( !sWarning.IsEmpty() ) sphWarning ( "rotating index '%s': %s", sIndex, sWarning.cstr() ); if ( !tIndex.m_pIndex->GetTokenizer () ) tIndex.m_pIndex->SetTokenizer ( pTokenizer ); else SafeDelete ( pTokenizer ); if ( !tIndex.m_pIndex->GetDictionary () ) tIndex.m_pIndex->SetDictionary ( pDictionary ); else SafeDelete ( pDictionary ); } return bPreread; } else { bPreread = true; if ( !sWarning.IsEmpty() ) sphWarning ( "rotating index '%s': %s", sIndex, sWarning.cstr() ); } if ( !tIndex.m_pIndex->GetTokenizer () ) tIndex.m_pIndex->SetTokenizer ( pTokenizer ); else SafeDelete ( pTokenizer ); if ( !tIndex.m_pIndex->GetDictionary () ) tIndex.m_pIndex->SetDictionary ( pDictionary ); else SafeDelete ( pDictionary ); // unlink .old if ( g_bUnlinkOld && !tIndex.m_bOnlyNew ) { for ( int i=0; i0 && tmLastLog+iAllocLogPeriodGetSettings (); if ( ( tSettings.m_iMinPrefixLen>0 || tSettings.m_iMinInfixLen>0 ) && !pIndex->m_bEnableStar ) { CSphDict * pDict = pIndex->GetDictionary (); assert ( pDict ); if ( pDict->HasMorphology () ) { sError = "infixes and morphology are enabled, enable_star=0"; return false; } } return true; } static bool CheckServedEntry ( const ServedIndex_t * pEntry, const char * sIndex ) { if ( !pEntry ) { sphWarning ( "rotating index '%s': INTERNAL ERROR, index went AWOL", sIndex ); return false; } if ( pEntry->m_bToDelete || !pEntry->m_pIndex ) { if ( pEntry->m_bToDelete ) sphWarning ( "rotating index '%s': INTERNAL ERROR, entry marked for deletion", sIndex ); if ( !pEntry->m_pIndex ) sphWarning ( "rotating index '%s': INTERNAL ERROR, entry does not have an index", sIndex ); return false; } return true; } #define SPH_RT_AUTO_FLUSH_CHECK_PERIOD ( 5000000 ) static void RtFlushThreadFunc ( void * ) { int64_t tmNextCheck = sphMicroTimer() + SPH_RT_AUTO_FLUSH_CHECK_PERIOD; while ( !g_bRtFlushShutdown ) { // stand still till save time if ( tmNextCheck>sphMicroTimer() ) { sphSleepMsec ( 50 ); continue; } // collecting available rt indexes at save time CSphVector dRtIndexes; for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) if ( it.Get().m_bRT ) dRtIndexes.Add ( it.GetKey() ); // do check+save ARRAY_FOREACH_COND ( i, dRtIndexes, !g_bRtFlushShutdown ) { const ServedIndex_t * pServed = g_pIndexes->GetRlockedEntry ( dRtIndexes[i] ); if ( !pServed ) continue; if ( !pServed->m_bEnabled ) { pServed->Unlock(); continue; } ISphRtIndex * pRT = (ISphRtIndex *)pServed->m_pIndex; pRT->CheckRamFlush(); pServed->Unlock(); } tmNextCheck = sphMicroTimer() + SPH_RT_AUTO_FLUSH_CHECK_PERIOD; } } static void RotateIndexMT ( const CSphString & sIndex ) { assert ( g_eWorkers==MPM_THREADS ); ////////////////// // load new index ////////////////// // create new index, copy some settings from existing one const ServedIndex_t * pRotating = g_pIndexes->GetRlockedEntry ( sIndex ); if ( !CheckServedEntry ( pRotating, sIndex.cstr() ) ) { if ( pRotating ) pRotating->Unlock(); return; } sphInfo ( "rotating index '%s': started", sIndex.cstr() ); ServedIndex_t tNewIndex; tNewIndex.m_bOnlyNew = pRotating->m_bOnlyNew; tNewIndex.m_pIndex = sphCreateIndexPhrase ( NULL, NULL ); // FIXME! check if it's ok tNewIndex.m_pIndex->m_bEnableStar = pRotating->m_bStar; tNewIndex.m_pIndex->m_bExpandKeywords = pRotating->m_bExpand; tNewIndex.m_pIndex->SetPreopen ( pRotating->m_bPreopen || g_bPreopenIndexes ); tNewIndex.m_pIndex->SetWordlistPreload ( !pRotating->m_bOnDiskDict && !g_bOnDiskDicts ); // rebase new index char sNewPath [ SPH_MAX_FILENAME_LEN ]; snprintf ( sNewPath, sizeof(sNewPath), "%s.new", pRotating->m_sIndexPath.cstr() ); tNewIndex.m_pIndex->SetBase ( sNewPath ); // don't need to hold the existing index any more now pRotating->Unlock(); pRotating = NULL; // prealloc enough RAM and lock new index sphLogDebug ( "prealloc enough RAM and lock new index" ); CSphString sWarn, sError; if ( !tNewIndex.m_pIndex->Prealloc ( tNewIndex.m_bMlock, g_bStripPath, sWarn ) ) { sphWarning ( "rotating index '%s': prealloc: %s; using old index", sIndex.cstr(), tNewIndex.m_pIndex->GetLastError().cstr() ); return; } if ( !tNewIndex.m_pIndex->Lock() ) { sphWarning ( "rotating index '%s': lock: %s; using old index", sIndex.cstr (), tNewIndex.m_pIndex->GetLastError().cstr() ); return; } // fixup settings if needed sphLogDebug ( "fixup settings if needed" ); g_tRotateConfigMutex.Lock (); if ( tNewIndex.m_bOnlyNew && g_pCfg && g_pCfg->m_tConf ( "index" ) && g_pCfg->m_tConf["index"]( sIndex.cstr() ) ) { if ( !sphFixupIndexSettings ( tNewIndex.m_pIndex, g_pCfg->m_tConf["index"][sIndex.cstr()], sError ) ) { sphWarning ( "rotating index '%s': fixup: %s; using old index", sIndex.cstr(), sError.cstr() ); g_tRotateConfigMutex.Unlock (); return; } } g_tRotateConfigMutex.Unlock(); if ( !CheckIndex ( tNewIndex.m_pIndex, sError ) ) { sphWarning ( "rotating index '%s': check: %s; using old index", sIndex.cstr(), sError.cstr() ); return; } if ( !tNewIndex.m_pIndex->Preread() ) { sphWarning ( "rotating index '%s': preread failed: %s; using old index", sIndex.cstr(), tNewIndex.m_pIndex->GetLastError().cstr() ); return; } ////////////////////// // activate new index ////////////////////// sphLogDebug ( "activate new index" ); ServedIndex_t * pServed = g_pIndexes->GetWlockedEntry ( sIndex ); if ( !CheckServedEntry ( pServed, sIndex.cstr() ) ) { if ( pServed ) pServed->Unlock(); return; } CSphIndex * pOld = pServed->m_pIndex; CSphIndex * pNew = tNewIndex.m_pIndex; // rename files // FIXME! factor out a common function w/ non-threaded rotation code char sOld [ SPH_MAX_FILENAME_LEN ]; snprintf ( sOld, sizeof(sOld), "%s.old", pServed->m_sIndexPath.cstr() ); if ( !pServed->m_bOnlyNew && !pOld->Rename ( sOld ) ) { // FIXME! rollback inside Rename() call potentially fail sphWarning ( "rotating index '%s': cur to old rename failed: %s", sIndex.cstr(), pOld->GetLastError().cstr() ); } else { // FIXME! at this point there's no cur lock file; ie. potential race sphLogDebug ( "no cur lock file; ie. potential race" ); if ( !pNew->Rename ( pServed->m_sIndexPath.cstr() ) ) { sphWarning ( "rotating index '%s': new to cur rename failed: %s", sIndex.cstr(), pNew->GetLastError().cstr() ); if ( !pServed->m_bOnlyNew && !pOld->Rename ( pServed->m_sIndexPath.cstr() ) ) { sphWarning ( "rotating index '%s': old to cur rename failed: %s; INDEX UNUSABLE", sIndex.cstr(), pOld->GetLastError().cstr() ); pServed->m_bEnabled = false; } } else { // all went fine; swap them sphLogDebug ( "all went fine; swap them" ); if ( !tNewIndex.m_pIndex->GetTokenizer() ) tNewIndex.m_pIndex->SetTokenizer ( pServed->m_pIndex->LeakTokenizer() ); if ( !tNewIndex.m_pIndex->GetDictionary() ) tNewIndex.m_pIndex->SetDictionary ( pServed->m_pIndex->LeakDictionary() ); Swap ( pServed->m_pIndex, tNewIndex.m_pIndex ); pServed->m_bEnabled = true; // unlink .old sphLogDebug ( "unlink .old" ); if ( g_bUnlinkOld && !pServed->m_bOnlyNew ) { char sFile [ SPH_MAX_FILENAME_LEN ]; for ( int i=0; im_bOnlyNew = false; sphInfo ( "rotating index '%s': success", sIndex.cstr() ); } } pServed->Unlock(); } void RotationThreadFunc ( void * ) { assert ( g_eWorkers==MPM_THREADS ); while ( !g_bRotateShutdown ) { // check if we have work to do if ( !g_iRotateCount ) { sphSleepMsec ( 50 ); continue; } g_tRotateQueueMutex.Lock(); if ( !g_dRotateQueue.GetLength() ) { g_tRotateQueueMutex.Unlock(); sphSleepMsec ( 50 ); continue; } CSphString sIndex = g_dRotateQueue.Pop(); g_sPrereading = sIndex.cstr(); g_tRotateQueueMutex.Unlock(); RotateIndexMT ( sIndex ); g_tRotateQueueMutex.Lock(); if ( !g_dRotateQueue.GetLength() ) { g_iRotateCount = Max ( 0, g_iRotateCount-1 ); sphInfo ( "rotating index: all indexes done" ); } g_sPrereading = NULL; g_tRotateQueueMutex.Unlock(); } } void IndexRotationDone () { #if !USE_WINDOWS if ( g_iRotationThrottle && g_eWorkers==MPM_PREFORK ) { ARRAY_FOREACH ( i, g_dChildren ) g_dTermChildren.Add ( g_dChildren[i] ); } else { // forcibly restart children serving persistent connections and/or preforked ones // FIXME! check how both signals are handled in both cases int iSignal = ( g_eWorkers==MPM_PREFORK ) ? SIGTERM : SIGHUP; ARRAY_FOREACH ( i, g_dChildren ) kill ( g_dChildren[i], iSignal ); } #endif g_iRotateCount = Max ( 0, g_iRotateCount-1 ); sphInfo ( "rotating finished" ); } void SeamlessTryToForkPrereader () { sphLogDebug ( "Invoked SeamlessTryToForkPrereader" ); // next in line const char * sPrereading = g_dRotating.Pop (); if ( !sPrereading || !g_pIndexes->Exists ( sPrereading ) ) { sphWarning ( "INTERNAL ERROR: preread attempt on unknown index '%s'", sPrereading ? sPrereading : "(NULL)" ); return; } const ServedIndex_t & tServed = g_pIndexes->GetUnlockedEntry ( sPrereading ); // alloc buffer index (once per run) if ( !g_pPrereading ) g_pPrereading = sphCreateIndexPhrase ( NULL, NULL ); // FIXME! check if it's ok g_pPrereading->m_bEnableStar = tServed.m_bStar; g_pPrereading->m_bExpandKeywords = tServed.m_bExpand; g_pPrereading->SetPreopen ( tServed.m_bPreopen || g_bPreopenIndexes ); g_pPrereading->SetWordlistPreload ( !tServed.m_bOnDiskDict && !g_bOnDiskDicts ); // rebase buffer index char sNewPath [ SPH_MAX_FILENAME_LEN ]; snprintf ( sNewPath, sizeof(sNewPath), "%s.new", tServed.m_sIndexPath.cstr() ); g_pPrereading->SetBase ( sNewPath ); // prealloc enough RAM and lock new index sphLogDebug ( "prealloc enough RAM and lock new index" ); CSphString sWarn, sError; if ( !g_pPrereading->Prealloc ( tServed.m_bMlock, g_bStripPath, sWarn ) ) { sphWarning ( "rotating index '%s': prealloc: %s; using old index", sPrereading, g_pPrereading->GetLastError().cstr() ); if ( !sWarn.IsEmpty() ) sphWarning ( "rotating index: %s", sWarn.cstr() ); return; } if ( !sWarn.IsEmpty() ) sphWarning ( "rotating index: %s: %s", sPrereading, sWarn.cstr() ); if ( !g_pPrereading->Lock() ) { sphWarning ( "rotating index '%s': lock: %s; using old index", sPrereading, g_pPrereading->GetLastError().cstr() ); g_pPrereading->Dealloc (); return; } if ( tServed.m_bOnlyNew && g_pCfg && g_pCfg->m_tConf.Exists ( "index" ) && g_pCfg->m_tConf["index"].Exists ( sPrereading ) ) if ( !sphFixupIndexSettings ( g_pPrereading, g_pCfg->m_tConf["index"][sPrereading], sError ) ) { sphWarning ( "rotating index '%s': fixup: %s; using old index", sPrereading, sError.cstr() ); return; } if ( !CheckIndex ( g_pPrereading, sError ) ) { sphWarning ( "rotating index '%s': check: %s; using old index", sPrereading, sError.cstr() ); return; } // fork async reader sphLogDebug ( "fork async reader" ); g_sPrereading = sPrereading; int iPipeFD = PipeAndFork ( true, SPH_PIPE_PREREAD ); // in parent, wait for prereader process to finish if ( g_bHeadDaemon ) return; // in child, do preread bool bRes = g_pPrereading->Preread (); if ( !bRes ) sphWarning ( "rotating index '%s': preread failed: %s; using old index", g_sPrereading, g_pPrereading->GetLastError().cstr() ); // report and exit DWORD uTmp = SPH_PIPE_PREREAD; sphWrite ( iPipeFD, &uTmp, sizeof(DWORD) ); // FIXME? add buffering/checks? uTmp = bRes; sphWrite ( iPipeFD, &uTmp, sizeof(DWORD) ); ::close ( iPipeFD ); sphLogDebug ( "SeamlessTryToForkPrereader: finishing the fork and invoking exit ( 0 )" ); exit ( 0 ); } void SeamlessForkPrereader () { sphLogDebug ( "Invoked SeamlessForkPrereader" ); // sanity checks if ( g_sPrereading ) { sphWarning ( "INTERNAL ERROR: preread attempt before previous completion" ); return; } // try candidates one by one while ( g_dRotating.GetLength() && !g_sPrereading ) SeamlessTryToForkPrereader (); // if there's no more candidates, and nothing in the works, we're done if ( !g_sPrereading && !g_dRotating.GetLength() ) IndexRotationDone (); } /// simple wrapper to simplify reading from pipes struct PipeReader_t { explicit PipeReader_t ( int iFD ) : m_iFD ( iFD ) , m_bError ( false ) { #if !USE_WINDOWS if ( fcntl ( iFD, F_SETFL, 0 )<0 ) sphWarning ( "fcntl(0) on pipe failed (error=%s)", strerror(errno) ); #endif } ~PipeReader_t () { SafeClose ( m_iFD ); } int GetFD () const { return m_iFD; } bool IsError () const { return m_bError; } int GetInt () { int iTmp; if ( !GetBytes ( &iTmp, sizeof(iTmp) ) ) iTmp = 0; return iTmp; } CSphString GetString () { int iLen = GetInt (); CSphString sRes; sRes.Reserve ( iLen ); if ( !GetBytes ( const_cast ( sRes.cstr() ), iLen ) ) sRes = ""; return sRes; } protected: bool GetBytes ( void * pBuf, int iCount ) { if ( m_bError ) return false; if ( m_iFD<0 ) { m_bError = true; sphWarning ( "invalid pipe fd" ); return false; } for ( ;; ) { int iRes = ::read ( m_iFD, pBuf, iCount ); if ( iRes<0 && errno==EINTR ) continue; if ( iRes!=iCount ) { m_bError = true; sphWarning ( "pipe read failed (exp=%d, res=%d, error=%s)", iCount, iRes, iRes>0 ? "(none)" : strerror(errno) ); return false; } return true; } } protected: int m_iFD; bool m_bError; }; /// handle pipe notifications from prereading void HandlePipePreread ( PipeReader_t & tPipe, bool bFailure ) { if ( bFailure ) { // clean up previous one and launch next one g_sPrereading = NULL; // in any case, buffer index should now be deallocated g_pPrereading->Dealloc (); g_pPrereading->Unlock (); // work next one SeamlessForkPrereader (); return; } assert ( g_iRotateCount && g_bSeamlessRotate && g_sPrereading ); // whatever the outcome, we will be done with this one const char * sPrereading = g_sPrereading; g_sPrereading = NULL; // notice that this will block! int iRes = tPipe.GetInt(); if ( !tPipe.IsError() && iRes ) { // if preread was succesful, exchange served index and prereader buffer index ServedIndex_t & tServed = g_pIndexes->GetUnlockedEntry ( sPrereading ); CSphIndex * pOld = tServed.m_pIndex; CSphIndex * pNew = g_pPrereading; char sOld [ SPH_MAX_FILENAME_LEN ]; snprintf ( sOld, sizeof(sOld), "%s.old", tServed.m_sIndexPath.cstr() ); if ( !tServed.m_bOnlyNew && !pOld->Rename ( sOld ) ) { // FIXME! rollback inside Rename() call potentially fail sphWarning ( "rotating index '%s': cur to old rename failed: %s", sPrereading, pOld->GetLastError().cstr() ); } else { // FIXME! at this point there's no cur lock file; ie. potential race if ( !pNew->Rename ( tServed.m_sIndexPath.cstr() ) ) { sphWarning ( "rotating index '%s': new to cur rename failed: %s", sPrereading, pNew->GetLastError().cstr() ); if ( !tServed.m_bOnlyNew && !pOld->Rename ( tServed.m_sIndexPath.cstr() ) ) { sphWarning ( "rotating index '%s': old to cur rename failed: %s; INDEX UNUSABLE", sPrereading, pOld->GetLastError().cstr() ); tServed.m_bEnabled = false; } } else { // all went fine; swap them if ( !g_pPrereading->GetTokenizer () ) g_pPrereading->SetTokenizer ( tServed.m_pIndex->LeakTokenizer () ); if ( !g_pPrereading->GetDictionary () ) g_pPrereading->SetDictionary ( tServed.m_pIndex->LeakDictionary () ); Swap ( tServed.m_pIndex, g_pPrereading ); tServed.m_bEnabled = true; // unlink .old if ( g_bUnlinkOld && !tServed.m_bOnlyNew ) { char sFile [ SPH_MAX_FILENAME_LEN ]; for ( int i=0; iDealloc (); g_pPrereading->Unlock (); // work next one SeamlessForkPrereader (); } /// check if there are any notifications from the children and handle them void CheckPipes () { ARRAY_FOREACH ( i, g_dPipes ) { // try to get status code DWORD uStatus; int iRes = ::read ( g_dPipes[i].m_iFD, &uStatus, sizeof(DWORD) ); // no data yet? if ( iRes==-1 && errno==EAGAIN ) continue; // either if there's eof, or error, or valid data - this pipe is over PipeReader_t tPipe ( g_dPipes[i].m_iFD ); int iHandler = g_dPipes[i].m_iHandler; g_dPipes.Remove ( i-- ); // check for eof/error bool bFailure = false; if ( iRes!=sizeof(DWORD) ) { bFailure = true; if ( iHandler<0 ) continue; // no handler; we're not expecting anything if ( iRes!=0 || iHandler>=0 ) sphWarning ( "pipe status read failed (handler=%d)", iHandler ); } // check for handler/status mismatch if ( !bFailure && ( iHandler>=0 && (int)uStatus!=iHandler ) ) { bFailure = true; sphWarning ( "INTERNAL ERROR: pipe status mismatch (handler=%d, status=%d)", iHandler, uStatus ); } // check for handler promotion (ie: we did not expect anything particular, but something happened anyway) if ( !bFailure && iHandler<0 ) iHandler = (int)uStatus; // run the proper handler switch ( iHandler ) { case SPH_PIPE_PREREAD: HandlePipePreread ( tPipe, bFailure ); break; default: if ( !bFailure ) sphWarning ( "INTERNAL ERROR: unknown pipe handler (handler=%d, status=%d)", iHandler, uStatus ); break; } } } void ConfigureIndex ( ServedIndex_t & tIdx, const CSphConfigSection & hIndex ) { tIdx.m_bMlock = ( hIndex.GetInt ( "mlock", 0 )!=0 ) && !g_bOptNoLock; tIdx.m_bStar = ( hIndex.GetInt ( "enable_star", 0 )!=0 ); tIdx.m_bExpand = ( hIndex.GetInt ( "expand_keywords", 0 )!=0 ); tIdx.m_bPreopen = ( hIndex.GetInt ( "preopen", 0 )!=0 ); tIdx.m_bOnDiskDict = ( hIndex.GetInt ( "ondisk_dict", 0 )!=0 ); } bool PrereadNewIndex ( ServedIndex_t & tIdx, const CSphConfigSection & hIndex, const char * szIndexName ) { CSphString sWarning; if ( !tIdx.m_pIndex->Prealloc ( tIdx.m_bMlock, g_bStripPath, sWarning ) || !tIdx.m_pIndex->Preread() ) { sphWarning ( "index '%s': preload: %s; NOT SERVING", szIndexName, tIdx.m_pIndex->GetLastError().cstr() ); return false; } if ( !sWarning.IsEmpty() ) sphWarning ( "index '%s': %s", szIndexName, sWarning.cstr() ); CSphString sError; if ( !sphFixupIndexSettings ( tIdx.m_pIndex, hIndex, sError ) ) { sphWarning ( "index '%s': %s - NOT SERVING", szIndexName, sError.cstr() ); return false; } // try to lock it if ( !g_bOptNoLock && !tIdx.m_pIndex->Lock() ) { sphWarning ( "index '%s': lock: %s; NOT SERVING", szIndexName, tIdx.m_pIndex->GetLastError().cstr() ); return false; } return true; } bool ConfigureAgent ( AgentDesc_t & tAgent, const CSphVariant * pAgent, const char * szIndexName, bool bBlackhole ) { // extract host name or path const char * p = pAgent->cstr(); while ( sphIsAlpha(*p) || *p=='.' || *p=='-' || *p=='/' ) p++; if ( p==pAgent->cstr() ) { sphWarning ( "index '%s': agent '%s': host name or path expected - SKIPPING AGENT", szIndexName, pAgent->cstr() ); return false; } if ( *p++!=':' ) { sphWarning ( "index '%s': agent '%s': colon expected near '%s' - SKIPPING AGENT", szIndexName, pAgent->cstr(), p ); return false; } CSphString sSub = pAgent->SubString ( 0, p-1-pAgent->cstr() ); if ( sSub.cstr()[0]=='/' ) { #if USE_WINDOWS sphWarning ( "index '%s': agent '%s': UNIX sockets are not supported on Windows - SKIPPING AGENT", szIndexName, pAgent->cstr() ); return false; #else if ( strlen ( sSub.cstr() ) + 1 > sizeof(((struct sockaddr_un *)0)->sun_path) ) { sphWarning ( "index '%s': agent '%s': UNIX socket path is too long - SKIPPING AGENT", szIndexName, pAgent->cstr() ); return false; } tAgent.m_iFamily = AF_UNIX; tAgent.m_sPath = sSub; p--; #endif } else { tAgent.m_iFamily = AF_INET; tAgent.m_sHost = sSub; // extract port if ( !isdigit(*p) ) { sphWarning ( "index '%s': agent '%s': port number expected near '%s' - SKIPPING AGENT", szIndexName, pAgent->cstr(), p ); return false; } tAgent.m_iPort = atoi(p); if ( !IsPortInRange ( tAgent.m_iPort ) ) { sphWarning ( "index '%s': agent '%s': invalid port number near '%s' - SKIPPING AGENT", szIndexName, pAgent->cstr(), p ); return false; } while ( isdigit(*p) ) p++; } // extract index list if ( *p++!=':' ) { sphWarning ( "index '%s': agent '%s': colon expected near '%s' - SKIPPING AGENT", szIndexName, pAgent->cstr(), p ); return false; } while ( isspace(*p) ) p++; const char * sIndexList = p; while ( sphIsAlpha(*p) || isspace(*p) || *p==',' ) p++; if ( *p ) { sphWarning ( "index '%s': agent '%s': index list expected near '%s' - SKIPPING AGENT", szIndexName, pAgent->cstr(), p ); return false; } tAgent.m_sIndexes = sIndexList; // lookup address (if needed) if ( tAgent.m_iFamily==AF_INET ) { tAgent.m_uAddr = sphGetAddress ( tAgent.m_sHost.cstr() ); if ( tAgent.m_uAddr==0 ) { sphWarning ( "index '%s': agent '%s': failed to lookup host name '%s' (error=%s) - SKIPPING AGENT", szIndexName, pAgent->cstr(), tAgent.m_sHost.cstr(), sphSockError() ); return false; } } tAgent.m_bBlackhole = bBlackhole; // allocate stats slot if ( g_pStats ) { g_tStatsMutex.Lock(); for ( int i=0; im_bmAgentStats[i]!=0xffffffffUL ) { int j = FindBit ( g_pStats->m_bmAgentStats[i] ); g_pStats->m_bmAgentStats[i] |= ( 1<m_dAgentStats[tAgent.m_iStatsIndex], 0, sizeof(AgentStats_t) ); break; } g_tStatsMutex.Unlock(); } return true; } static DistributedIndex_t ConfigureDistributedIndex ( const char * szIndexName, const CSphConfigSection & hIndex ) { assert ( hIndex("type") && hIndex["type"]=="distributed" ); DistributedIndex_t tIdx; // add local agents for ( CSphVariant * pLocal = hIndex("local"); pLocal; pLocal = pLocal->m_pNext ) { if ( !g_pIndexes->Exists ( pLocal->cstr() ) ) { sphWarning ( "index '%s': no such local index '%s' - SKIPPING LOCAL INDEX", szIndexName, pLocal->cstr() ); continue; } tIdx.m_dLocal.Add ( pLocal->cstr() ); } // add remote agents for ( CSphVariant * pAgent = hIndex("agent"); pAgent; pAgent = pAgent->m_pNext ) { AgentDesc_t tAgent; if ( ConfigureAgent ( tAgent, pAgent, szIndexName, false ) ) tIdx.m_dAgents.Add ( tAgent ); } for ( CSphVariant * pAgent = hIndex("agent_blackhole"); pAgent; pAgent = pAgent->m_pNext ) { AgentDesc_t tAgent; if ( ConfigureAgent ( tAgent, pAgent, szIndexName, true ) ) tIdx.m_dAgents.Add ( tAgent ); } // configure options if ( hIndex("agent_connect_timeout") ) { if ( hIndex["agent_connect_timeout"].intval()<=0 ) sphWarning ( "index '%s': connect_timeout must be positive, ignored", szIndexName ); else tIdx.m_iAgentConnectTimeout = hIndex["agent_connect_timeout"].intval(); } if ( hIndex("agent_query_timeout") ) { if ( hIndex["agent_query_timeout"].intval()<=0 ) sphWarning ( "index '%s': query_timeout must be positive, ignored", szIndexName ); else tIdx.m_iAgentQueryTimeout = hIndex["agent_query_timeout"].intval(); } return tIdx; } void FreeAgentStats ( DistributedIndex_t & tIndex ) { if ( !g_pStats ) return; g_tStatsMutex.Lock(); ARRAY_FOREACH ( i, tIndex.m_dAgents ) { int iIndex = tIndex.m_dAgents[i].m_iStatsIndex; if ( iIndex<0 || iIndex>=STATS_MAX_AGENTS ) continue; assert ( g_pStats->m_bmAgentStats[iIndex>>5] & ( 1UL<<( iIndex & 31 ) ) ); g_pStats->m_bmAgentStats[iIndex>>5] &= ~( 1UL<<( iIndex & 31 ) ); } g_tStatsMutex.Unlock(); } ESphAddIndex AddIndex ( const char * szIndexName, const CSphConfigSection & hIndex ) { if ( hIndex("type") && hIndex["type"]=="distributed" ) { /////////////////////////////// // configure distributed index /////////////////////////////// DistributedIndex_t tIdx = ConfigureDistributedIndex ( szIndexName, hIndex ); // finally, check and add distributed index to global table if ( tIdx.m_dAgents.GetLength()==0 && tIdx.m_dLocal.GetLength()==0 ) { FreeAgentStats ( tIdx ); sphWarning ( "index '%s': no valid local/remote indexes in distributed index - NOT SERVING", szIndexName ); return ADD_ERROR; } else { g_tDistLock.Lock (); if ( !g_hDistIndexes.Add ( tIdx, szIndexName ) ) { g_tDistLock.Unlock (); FreeAgentStats ( tIdx ); sphWarning ( "index '%s': duplicate name - NOT SERVING", szIndexName ); return ADD_ERROR; } g_tDistLock.Unlock (); } return ADD_DISTR; } else if ( hIndex("type") && hIndex["type"]=="rt" ) { //////////////////////////// // configure realtime index //////////////////////////// if ( g_eWorkers!=MPM_THREADS ) { sphWarning ( "index '%s': RT index requires workers=threads - NOT SERVING", szIndexName ); return ADD_ERROR; } CSphString sError; CSphSchema tSchema ( szIndexName ); if ( !sphRTSchemaConfigure ( hIndex, &tSchema, &sError ) ) { sphWarning ( "index '%s': %s - NOT SERVING", szIndexName, sError.cstr() ); return ADD_ERROR; } // path if ( !hIndex("path") ) { sphWarning ( "index '%s': path must be specified - NOT SERVING", szIndexName ); return ADD_ERROR; } // RAM chunk size DWORD uRamSize = hIndex.GetSize ( "rt_mem_limit", 32*1024*1024 ); if ( uRamSize<128*1024 ) { sphWarning ( "index '%s': rt_mem_limit extremely low, using 128K instead", szIndexName ); uRamSize = 128*1024; } else if ( uRamSize<8*1024*1024 ) sphWarning ( "index '%s': rt_mem_limit very low (under 8 MB)", szIndexName ); // index ServedIndex_t tIdx; tIdx.m_pIndex = sphCreateIndexRT ( tSchema, szIndexName, uRamSize, hIndex["path"].cstr() ); tIdx.m_bEnabled = false; tIdx.m_sIndexPath = hIndex["path"]; tIdx.m_bRT = true; tIdx.m_pIndex->SetWordlistPreload ( !hIndex.GetInt("ondisk_dict") && !g_bOnDiskDicts ); // pick config settings // they should be overriden later by Preload() if needed CSphIndexSettings tSettings; if ( !sphConfIndex ( hIndex, tSettings, sError ) ) { sphWarning ( "ERROR: index '%s': %s - NOT SERVING", szIndexName, sError.cstr() ); return ADD_ERROR; } tIdx.m_pIndex->Setup ( tSettings ); // hash it if ( !g_pIndexes->Add ( tIdx, szIndexName ) ) { sphWarning ( "INTERNAL ERROR: index '%s': hash add failed - NOT SERVING", szIndexName ); return ADD_ERROR; } tIdx.Reset (); // so that the dtor wouln't delete everything return ADD_RT; } else if ( !hIndex("type") || hIndex["type"]=="plain" ) { ///////////////////////// // configure local index ///////////////////////// ServedIndex_t tIdx; // check path if ( !hIndex.Exists ( "path" ) ) { sphWarning ( "index '%s': key 'path' not found - NOT SERVING", szIndexName ); return ADD_ERROR; } // check name if ( g_pIndexes->Exists ( szIndexName ) ) { sphWarning ( "index '%s': duplicate name - NOT SERVING", szIndexName ); return ADD_ERROR; } // configure memlocking, star ConfigureIndex ( tIdx, hIndex ); // try to create index CSphString sWarning; tIdx.m_pIndex = sphCreateIndexPhrase ( szIndexName, hIndex["path"].cstr() ); tIdx.m_pIndex->m_bEnableStar = tIdx.m_bStar; tIdx.m_pIndex->m_bExpandKeywords = tIdx.m_bExpand; tIdx.m_pIndex->m_iExpansionLimit = g_iExpansionLimit; tIdx.m_pIndex->SetPreopen ( tIdx.m_bPreopen || g_bPreopenIndexes ); tIdx.m_pIndex->SetWordlistPreload ( !tIdx.m_bOnDiskDict && !g_bOnDiskDicts ); tIdx.m_bEnabled = false; // done tIdx.m_sIndexPath = hIndex["path"]; if ( !g_pIndexes->Add ( tIdx, szIndexName ) ) { sphWarning ( "INTERNAL ERROR: index '%s': hash add failed - NOT SERVING", szIndexName ); return ADD_ERROR; } tIdx.Reset (); // so that the dtor wouldn't delete everything return ADD_LOCAL; } else { // unknown type sphWarning ( "index '%s': unknown type '%s' - NOT SERVING", szIndexName, hIndex["type"].cstr() ); return ADD_ERROR; } } bool CheckConfigChanges () { struct stat tStat; memset ( &tStat, 0, sizeof ( tStat ) ); if ( stat ( g_sConfigFile.cstr (), &tStat ) < 0 ) memset ( &tStat, 0, sizeof ( tStat ) ); DWORD uCRC32 = 0; sphCalcFileCRC32 ( g_sConfigFile.cstr (), uCRC32 ); if ( g_uCfgCRC32==uCRC32 && tStat.st_mtime==g_tCfgStat.st_mtime && tStat.st_ctime==g_tCfgStat.st_ctime && tStat.st_size==g_tCfgStat.st_size ) return false; g_uCfgCRC32 = uCRC32; g_tCfgStat = tStat; return true; } void ReloadIndexSettings ( CSphConfigParser * pCP ) { assert ( pCP ); if ( !pCP->Parse ( g_sConfigFile.cstr () ) ) { sphWarning ( "failed to parse config file '%s'; using previous settings", g_sConfigFile.cstr () ); return; } g_bDoDelete = false; for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) it.Get().m_bToDelete = true; ///< FIXME! What about write lock before doing this? g_hDistIndexes.IterateStart (); while ( g_hDistIndexes.IterateNext () ) g_hDistIndexes.IterateGet().m_bToDelete = true; int nTotalIndexes = g_pIndexes->GetLength () + g_hDistIndexes.GetLength (); int nChecked = 0; const CSphConfig & hConf = pCP->m_tConf; hConf["index"].IterateStart (); while ( hConf["index"].IterateNext() ) { const CSphConfigSection & hIndex = hConf["index"].IterateGet(); const char * sIndexName = hConf["index"].IterateGetKey().cstr(); ServedIndex_t * pServedIndex = g_pIndexes->GetWlockedEntry ( sIndexName ); if ( pServedIndex ) { ConfigureIndex ( *pServedIndex, hIndex ); pServedIndex->m_bToDelete = false; nChecked++; pServedIndex->Unlock(); } else if ( g_hDistIndexes.Exists ( sIndexName ) && hIndex.Exists("type") && hIndex["type"]=="distributed" ) { DistributedIndex_t tIdx = ConfigureDistributedIndex ( sIndexName, hIndex ); // finally, check and add distributed index to global table if ( tIdx.m_dAgents.GetLength()==0 && tIdx.m_dLocal.GetLength()==0 ) { FreeAgentStats ( tIdx ); sphWarning ( "index '%s': no valid local/remote indexes in distributed index; using last valid definition", sIndexName ); g_hDistIndexes[sIndexName].m_bToDelete = false; } else { g_tDistLock.Lock(); FreeAgentStats ( g_hDistIndexes[sIndexName] ); g_hDistIndexes[sIndexName] = tIdx; g_tDistLock.Unlock(); } nChecked++; } else if ( AddIndex ( sIndexName, hIndex )==ADD_LOCAL ) { ServedIndex_t * pIndex = g_pIndexes->GetWlockedEntry ( sIndexName ); if ( pIndex ) { pIndex->m_bOnlyNew = true; pIndex->Unlock(); } } } if ( nChecked < nTotalIndexes ) g_bDoDelete = true; } void CheckDelete () { if ( !g_bDoDelete ) return; if ( g_dChildren.GetLength() ) return; CSphVector dToDelete; CSphVector dDistToDelete; dToDelete.Reserve ( 8 ); dDistToDelete.Reserve ( 8 ); for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) { ServedIndex_t & tIndex = it.Get(); if ( tIndex.m_bToDelete ) dToDelete.Add ( &it.GetKey() ); } g_hDistIndexes.IterateStart (); while ( g_hDistIndexes.IterateNext () ) { DistributedIndex_t & tIndex = g_hDistIndexes.IterateGet (); if ( tIndex.m_bToDelete ) dDistToDelete.Add ( &g_hDistIndexes.IterateGetKey () ); } ARRAY_FOREACH ( i, dToDelete ) g_pIndexes->Delete ( *dToDelete[i] ); // should result in automatic CSphIndex::Unlock() via dtor call g_tDistLock.Lock(); ARRAY_FOREACH ( i, dDistToDelete ) { FreeAgentStats ( g_hDistIndexes [ *dDistToDelete[i] ] ); g_hDistIndexes.Delete ( *dDistToDelete[i] ); } g_tDistLock.Unlock(); g_bDoDelete = false; } void CheckRotate () { // do we need to rotate now? if ( !g_iRotateCount ) return; sphLogDebug ( "CheckRotate invoked" ); ///////////////////// // RAM-greedy rotate ///////////////////// if ( !g_bSeamlessRotate || g_eWorkers==MPM_PREFORK ) { // wait until there's no running queries if ( g_dChildren.GetLength() && g_eWorkers!=MPM_PREFORK ) return; CSphConfigParser * pCP = NULL; if ( CheckConfigChanges () ) { pCP = new CSphConfigParser; ReloadIndexSettings ( pCP ); } for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) { ServedIndex_t & tIndex = it.Get(); tIndex.WriteLock(); const char * sIndex = it.GetKey().cstr(); assert ( tIndex.m_pIndex ); bool bWasAdded = tIndex.m_bOnlyNew; RotateIndexGreedy ( tIndex, sIndex ); if ( bWasAdded && tIndex.m_bEnabled ) { const CSphConfigType & hConf = pCP->m_tConf ["index"]; if ( hConf.Exists ( sIndex ) ) { CSphString sError; if ( !sphFixupIndexSettings ( tIndex.m_pIndex, hConf [sIndex], sError ) ) { sphWarning ( "index '%s': %s - NOT SERVING", sIndex, sError.cstr() ); tIndex.m_bEnabled = false; } if ( tIndex.m_bEnabled && !CheckIndex ( tIndex.m_pIndex, sError ) ) { sphWarning ( "index '%s': %s - NOT SERVING", sIndex, sError.cstr() ); tIndex.m_bEnabled = false; } } } tIndex.Unlock(); } SafeDelete ( pCP ); IndexRotationDone (); return; } /////////////////// // seamless rotate /////////////////// if ( g_dRotating.GetLength() || g_dRotateQueue.GetLength() || g_sPrereading ) return; // rotate in progress already; will be handled in CheckPipes() g_tRotateConfigMutex.Lock(); SafeDelete ( g_pCfg ); if ( CheckConfigChanges() ) { g_pCfg = new CSphConfigParser; ReloadIndexSettings ( g_pCfg ); } g_tRotateConfigMutex.Unlock(); int iRotIndexes = 0; // check what indexes need to be rotated for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) { const ServedIndex_t & tIndex = it.Get(); const CSphString & sIndex = it.GetKey(); assert ( tIndex.m_pIndex ); CSphString sNewPath; sNewPath.SetSprintf ( "%s.new", tIndex.m_sIndexPath.cstr() ); // check if there's a .new index incoming // FIXME? move this code to index, and also check for exists-but-not-readable CSphString sTmp; sTmp.SetSprintf ( "%s.sph", sNewPath.cstr() ); if ( !sphIsReadable ( sTmp.cstr() ) ) { sphLogDebug ( "%s.sph is not readable. Skipping", sNewPath.cstr() ); continue; } if ( g_eWorkers==MPM_THREADS ) { g_tRotateQueueMutex.Lock(); g_dRotateQueue.Add ( sIndex ); g_tRotateQueueMutex.Unlock(); } else { g_dRotating.Add ( sIndex.cstr() ); if ( !( tIndex.m_bPreopen || g_bPreopenIndexes ) ) sphWarning ( "rotating index '%s' without preopen option; use per-index propen=1 or searchd preopen_indexes=1", sIndex.cstr() ); } iRotIndexes++; } if ( !iRotIndexes ) { sphWarning ( "INTERNAL ERROR: nothing to rotate after SIGHUP" ); g_iRotateCount = Max ( 0, g_iRotateCount-1 ); } if ( g_eWorkers!=MPM_THREADS && iRotIndexes ) SeamlessForkPrereader (); } void CheckReopen () { if ( !g_bGotSigusr1 ) return; // reopen searchd log if ( g_iLogFile>=0 && !g_bLogTty ) { int iFD = ::open ( g_sLogFile.cstr(), O_CREAT | O_RDWR | O_APPEND, S_IREAD | S_IWRITE ); if ( iFD<0 ) { sphWarning ( "failed to reopen log file '%s': %s", g_sLogFile.cstr(), strerror(errno) ); } else { ::close ( g_iLogFile ); g_iLogFile = iFD; g_bLogTty = ( isatty ( g_iLogFile )!=0 ); sphInfo ( "log reopened" ); } } // reopen query log if ( !g_bQuerySyslog && g_iQueryLogFile!=g_iLogFile && g_iQueryLogFile>=0 && !isatty ( g_iQueryLogFile ) ) { int iFD = ::open ( g_sQueryLogFile.cstr(), O_CREAT | O_RDWR | O_APPEND, S_IREAD | S_IWRITE ); if ( iFD<0 ) { sphWarning ( "failed to reopen query log file '%s': %s", g_sQueryLogFile.cstr(), strerror(errno) ); } else { ::close ( g_iQueryLogFile ); g_iQueryLogFile = iFD; sphInfo ( "query log reopened" ); } } g_bGotSigusr1 = 0; } static void SaveIndexes () { for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) { const ServedIndex_t & tServed = it.Get(); tServed.ReadLock(); if ( tServed.m_bEnabled ) { if ( !tServed.m_pIndex->SaveAttributes () ) sphWarning ( "index %s: attrs save failed: %s", it.GetKey().cstr(), tServed.m_pIndex->GetLastError().cstr() ); } tServed.Unlock(); } } static void ThdSaveIndexes ( void * ) { SaveIndexes (); // we're no more flushing g_tFlushMutex.Lock(); g_pFlush->m_bFlushing = false; g_tFlushMutex.Unlock(); } #if !USE_WINDOWS int PreforkChild (); #endif void CheckFlush () { if ( g_iAttrFlushPeriod<=0 || g_pFlush->m_bFlushing ) return; // do a periodic check, unless we have a forced check if ( !g_pFlush->m_bForceCheck ) { static int64_t tmLastCheck = -1000; int64_t tmNow = sphMicroTimer(); if ( ( tmLastCheck + int64_t(g_iAttrFlushPeriod)*I64C(1000000) )>=tmNow ) return; tmLastCheck = tmNow; sphLogDebug ( "attrflush: doing periodic check" ); } else { sphLogDebug ( "attrflush: doing forced check" ); } // check if there are dirty indexes bool bDirty = false; for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) { const ServedIndex_t & tServed = it.Get(); if ( tServed.m_bEnabled && tServed.m_pIndex->GetAttributeStatus() ) { bDirty = true; break; } } // need to set this before clearing check flag if ( bDirty ) g_pFlush->m_bFlushing = true; // if there was a forced check in progress, it no longer is if ( g_pFlush->m_bForceCheck ) g_pFlush->m_bForceCheck = false; // nothing to do, no indexes were updated if ( !bDirty ) { sphLogDebug ( "attrflush: no dirty indexes found" ); return; } // launch the flush! g_pFlush->m_iFlushTag++; sphLogDebug ( "attrflush: starting writer, tag ( %d )", g_pFlush->m_iFlushTag ); #if !USE_WINDOWS if ( g_eWorkers==MPM_FORK || g_eWorkers==MPM_PREFORK ) { PreforkChild(); // FIXME! gracefully handle fork() failures, Windows, etc if ( g_bHeadDaemon ) { return; } // child process, do the work SaveIndexes (); g_pFlush->m_bFlushing = false; exit ( 0 ); } else #endif { ThdDesc_t tThd; if ( !sphThreadCreate ( &tThd.m_tThd, ThdSaveIndexes, NULL, true ) ) sphWarning ( "failed to create attribute save thread, error[%d] %s", errno, strerror(errno) ); } } #if !USE_WINDOWS #define WINAPI #else SERVICE_STATUS g_ss; SERVICE_STATUS_HANDLE g_ssHandle; void MySetServiceStatus ( DWORD dwCurrentState, DWORD dwWin32ExitCode, DWORD dwWaitHint ) { static DWORD dwCheckPoint = 1; if ( dwCurrentState==SERVICE_START_PENDING ) g_ss.dwControlsAccepted = 0; else g_ss.dwControlsAccepted = SERVICE_ACCEPT_STOP; g_ss.dwCurrentState = dwCurrentState; g_ss.dwWin32ExitCode = dwWin32ExitCode; g_ss.dwWaitHint = dwWaitHint; if ( dwCurrentState==SERVICE_RUNNING || dwCurrentState==SERVICE_STOPPED ) g_ss.dwCheckPoint = 0; else g_ss.dwCheckPoint = dwCheckPoint++; SetServiceStatus ( g_ssHandle, &g_ss ); } void WINAPI ServiceControl ( DWORD dwControlCode ) { switch ( dwControlCode ) { case SERVICE_CONTROL_STOP: MySetServiceStatus ( SERVICE_STOP_PENDING, NO_ERROR, 0 ); g_bServiceStop = true; break; default: MySetServiceStatus ( g_ss.dwCurrentState, NO_ERROR, 0 ); break; } } // warning! static buffer, non-reentrable const char * WinErrorInfo () { static char sBuf[1024]; DWORD uErr = ::GetLastError (); snprintf ( sBuf, sizeof(sBuf), "code=%d, error=", uErr ); int iLen = strlen(sBuf); if ( !FormatMessage ( FORMAT_MESSAGE_FROM_SYSTEM, NULL, uErr, 0, sBuf+iLen, sizeof(sBuf)-iLen, NULL ) ) // FIXME? force US-english langid? snprintf ( sBuf+iLen, sizeof(sBuf)-iLen, "(no message)" ); return sBuf; } SC_HANDLE ServiceOpenManager () { SC_HANDLE hSCM = OpenSCManager ( NULL, // local computer NULL, // ServicesActive database SC_MANAGER_ALL_ACCESS ); // full access rights if ( hSCM==NULL ) sphFatal ( "OpenSCManager() failed: %s", WinErrorInfo() ); return hSCM; } void AppendArg ( char * sBuf, int iBufLimit, const char * sArg ) { char * sBufMax = sBuf + iBufLimit - 2; // reserve place for opening space and trailing zero sBuf += strlen(sBuf); if ( sBuf>=sBufMax ) return; int iArgLen = strlen(sArg); bool bQuote = false; for ( int i=0; i=sBufMax ) return; *sBuf++ = '"'; while ( sBuf\tread configuration from specified file\n" "\t\t\t(default is csft.conf)\n" "--stop\t\t\tsend SIGTERM to currently running searchd\n" "--stopwait\t\tsend SIGTERM and wait until actual exit\n" "--status\t\tget ant print status variables\n" "\t\t\t(PID is taken from pid_file specified in config file)\n" "--iostats\t\tlog per-query io stats\n" #ifdef HAVE_CLOCK_GETTIME "--cpustats\t\tlog per-query cpu stats\n" #endif #if USE_WINDOWS "--install\t\tinstall as Windows service\n" "--delete\t\tdelete Windows service\n" "--servicename \tuse given service name (default is 'searchd')\n" #endif "\n" "Debugging options are:\n" "--console\t\trun in console mode (do not fork, do not log to files)\n" "-p, --port \tlisten on given port (overrides config setting)\n" "-l, --listen \tlisten on given address, port or path (overrides\n" "\t\t\tconfig settings)\n" "-i, --index \tonly serve one given index\n" "--logdebug\t\tenable additional debug information logging\n" #if !USE_WINDOWS "--nodetach\t\tdo not detach into background\n" #endif "\n" "Examples:\n" "searchd --config /usr/local/sphinx/etc/csft.conf\n" #if USE_WINDOWS "searchd --install --config c:\\sphinx\\csft.conf\n" #endif ); } #if USE_WINDOWS BOOL WINAPI CtrlHandler ( DWORD ) { if ( !g_bService ) { g_bGotSigterm = 1; sphInterruptNow(); } return TRUE; } #endif #if !USE_WINDOWS int PreforkChild () { // next one int iRes = fork(); if ( iRes==-1 ) sphFatal ( "fork() failed during prefork (error=%s)", strerror(errno) ); // child process if ( iRes==0 ) { g_bHeadDaemon = false; sphSetProcessInfo ( false ); return iRes; } // parent process g_dChildren.Add ( iRes ); return iRes; } // returns 'true' only once - at the very start, to show it beatiful way. bool SetWatchDog ( int iDevNull ) { // Fork #1 - detach from controlling terminal switch ( fork() ) { case -1: // error Shutdown (); sphFatal ( "fork() failed (reason: %s)", strerror ( errno ) ); exit ( 1 ); case 0: // daemonized child - or new and free watchdog :) break; default: // tty-controlled parent while ( g_tHaveTTY.ReadValue() ) sphSleepMsec ( 100 ); sphSetProcessInfo ( false ); exit ( 0 ); } // became the session leader if ( setsid()==-1 ) { Shutdown (); sphFatal ( "setsid() failed (reason: %s)", strerror ( errno ) ); exit ( 1 ); } // Fork #2 - detach from session leadership (may be not necessary, however) switch ( fork() ) { case -1: // error Shutdown (); sphFatal ( "fork() failed (reason: %s)", strerror ( errno ) ); exit ( 1 ); case 0: // daemonized child - or new and free watchdog :) break; default: // tty-controlled parent sphSetProcessInfo ( false ); exit ( 0 ); } // now we are the watchdog. Let us fork the actual process int iReincarnate = 1; bool bShutdown = false; bool bStreamsActive = true; int iRes = 0; for ( ;; ) { if ( iReincarnate!=0 ) iRes = fork(); if ( iRes==-1 ) { Shutdown (); sphFatal ( "fork() failed during watchdog setup (error=%s)", strerror(errno) ); } // child process; return true to show that we have to reload everything if ( iRes==0 ) { atexit ( &ReleaseTTYFlag ); return bStreamsActive; } // parent process, watchdog // close the io files if ( bStreamsActive ) { close ( STDIN_FILENO ); close ( STDOUT_FILENO ); close ( STDERR_FILENO ); dup2 ( iDevNull, STDIN_FILENO ); dup2 ( iDevNull, STDOUT_FILENO ); dup2 ( iDevNull, STDERR_FILENO ); bStreamsActive = false; } sphInfo ( "Child process %d has been forked", iRes ); SetSignalHandlers(); iReincarnate = 0; int iPid, iStatus; while ( ( iPid = wait ( &iStatus ) )>0 ) { assert ( iPid==iRes ); if ( WIFEXITED ( iStatus ) ) { int iExit = WEXITSTATUS ( iStatus ); if ( iExit==2 ) // really crash { sphInfo ( "Child process %d has been finished by CRASH_EXIT (exit code 2), will be restarted", iPid ); iReincarnate = -1; } else { sphInfo ( "Child process %d has been finished, exit code %d. Watchdog finishes also. Good bye!", iPid, iExit ); bShutdown = true; } } else if ( WIFSIGNALED ( iStatus ) ) { if ( WTERMSIG ( iStatus )==SIGINT || WTERMSIG ( iStatus )==SIGTERM #if WATCHDOG_SIGKILL || WTERMSIG ( iStatus )==SIGKILL #endif ) { sphInfo ( "Child process %d has been killed with kill or sigterm (%i). Watchdog finishes also. Good bye!", iPid, WTERMSIG ( iStatus ) ); bShutdown = true; } else { if ( WCOREDUMP ( iStatus ) ) sphInfo ( "Child process %i has been killed with signal %i, core dumped, will be restarted", iPid, WTERMSIG ( iStatus ) ); else sphInfo ( "Child process %i has been killed with signal %i, will be restarted", iPid, WTERMSIG ( iStatus ) ); iReincarnate = -1; } } else if ( WIFSTOPPED ( iStatus ) ) sphInfo ( "Child %i stopped with signal %i", iPid, WSTOPSIG ( iStatus ) ); #ifdef WIFCONTINUED else if ( WIFCONTINUED ( iStatus ) ) sphInfo ( "Child %i resumed", iPid ); #endif } if ( bShutdown || g_bGotSigterm ) { Shutdown(); exit ( 0 ); } } } #endif // !USE_WINDOWS /// check for incoming signals, and react on them void CheckSignals () { #if USE_WINDOWS if ( g_bService && g_bServiceStop ) { Shutdown (); MySetServiceStatus ( SERVICE_STOPPED, NO_ERROR, 0 ); exit ( 0 ); } #endif if ( g_bGotSighup ) { g_tRotateQueueMutex.Lock(); g_iRotateCount++; g_tRotateQueueMutex.Unlock(); sphInfo ( "rotating indices (seamless=%d)", (int)g_bSeamlessRotate ); // this might hang if performed from SIGHUP g_bGotSighup = 0; } if ( g_bGotSigterm ) { assert ( g_bHeadDaemon ); sphInfo ( "caught SIGTERM, shutting down" ); Shutdown (); exit ( 0 ); } #if !USE_WINDOWS if ( g_bGotSigchld ) { // handle gone children for ( ;; ) { int iChildPid = waitpid ( -1, NULL, WNOHANG ); sphLogDebugvv ( "gone child %d ( %d )", iChildPid, g_dChildren.GetLength() ); // !COMMIT if ( iChildPid<=0 ) break; g_dChildren.RemoveValue ( iChildPid ); // FIXME! OPTIMIZE! can be slow } g_bGotSigchld = 0; // prefork more children, if needed if ( g_eWorkers==MPM_PREFORK ) while ( g_dChildren.GetLength() < g_iPreforkChildren ) if ( PreforkChild()==0 ) // child process? break from here, go work return; } #endif #if USE_WINDOWS BYTE dPipeInBuf [ WIN32_PIPE_BUFSIZE ]; DWORD nBytesRead = 0; BOOL bSuccess = ReadFile ( g_hPipe, dPipeInBuf, WIN32_PIPE_BUFSIZE, &nBytesRead, NULL ); if ( nBytesRead > 0 && bSuccess ) { for ( DWORD i=0; im_pNext ) { ListenerDesc_t tDesc = ParseListener ( v->cstr() ); if ( tDesc.m_eProto!=PROTO_SPHINX ) continue; int iSock = -1; #if !USE_WINDOWS if ( !tDesc.m_sUnix.IsEmpty() ) { // UNIX connection struct sockaddr_un uaddr; size_t len = strlen ( tDesc.m_sUnix.cstr() ); if ( len+1 > sizeof(uaddr.sun_path ) ) sphFatal ( "UNIX socket path is too long (len=%d)", (int)len ); memset ( &uaddr, 0, sizeof(uaddr) ); uaddr.sun_family = AF_UNIX; memcpy ( uaddr.sun_path, tDesc.m_sUnix.cstr(), len+1 ); iSock = socket ( AF_UNIX, SOCK_STREAM, 0 ); if ( iSock<0 ) sphFatal ( "failed to create UNIX socket: %s", sphSockError() ); if ( connect ( iSock, (struct sockaddr*)&uaddr, sizeof(uaddr) )<0 ) { sphWarning ( "failed to connect to unix://%s: %s\n", tDesc.m_sUnix.cstr(), sphSockError() ); continue; } } else #endif { // TCP connection struct sockaddr_in sin; memset ( &sin, 0, sizeof(sin) ); sin.sin_family = AF_INET; sin.sin_addr.s_addr = ( tDesc.m_uIP==htonl ( INADDR_ANY ) ) ? htonl ( INADDR_LOOPBACK ) : tDesc.m_uIP; sin.sin_port = htons ( (short)tDesc.m_iPort ); iSock = socket ( AF_INET, SOCK_STREAM, 0 ); if ( iSock<0 ) sphFatal ( "failed to create TCP socket: %s", sphSockError() ); if ( connect ( iSock, (struct sockaddr*)&sin, sizeof(sin) )<0 ) { sphWarning ( "failed to connect to %s:%d: %s\n", sphFormatIP ( sBuf, sizeof(sBuf), tDesc.m_uIP ), tDesc.m_iPort, sphSockError() ); continue; } } // send request NetOutputBuffer_c tOut ( iSock ); tOut.SendDword ( SPHINX_SEARCHD_PROTO ); tOut.SendWord ( SEARCHD_COMMAND_STATUS ); tOut.SendWord ( VER_COMMAND_STATUS ); tOut.SendInt ( 4 ); // request body length tOut.SendInt ( 1 ); // dummy body tOut.Flush (); // get reply NetInputBuffer_c tIn ( iSock ); if ( !tIn.ReadFrom ( 12, 5 ) ) // magic_header_size=12, magic_timeout=5 sphFatal ( "handshake failure (no response)" ); DWORD uVer = tIn.GetDword(); if ( uVer!=SPHINX_SEARCHD_PROTO && uVer!=0x01000000UL ) // workaround for all the revisions that sent it in host order... sphFatal ( "handshake failure (unexpected protocol version=%d)", uVer ); if ( tIn.GetWord()!=SEARCHD_OK ) sphFatal ( "status command failed" ); if ( tIn.GetWord()!=VER_COMMAND_STATUS ) sphFatal ( "status command version mismatch" ); if ( !tIn.ReadFrom ( tIn.GetDword(), 5 ) ) // magic_timeout=5 sphFatal ( "failed to read status reply" ); fprintf ( stdout, "\nsearchd status\n--------------\n" ); int iRows = tIn.GetDword(); int iCols = tIn.GetDword(); for ( int i=0; iBuildMessage() ); } fflush ( stdout ); } Listener_t * DoAccept ( int * pClientSock, char * sClientName ) { int iMaxFD = 0; fd_set fdsAccept; FD_ZERO ( &fdsAccept ); ARRAY_FOREACH ( i, g_dListeners ) { sphFDSet ( g_dListeners[i].m_iSock, &fdsAccept ); iMaxFD = Max ( iMaxFD, g_dListeners[i].m_iSock ); } iMaxFD++; struct timeval tvTimeout; tvTimeout.tv_sec = USE_WINDOWS ? 0 : 1; tvTimeout.tv_usec = USE_WINDOWS ? 50000 : 0; int iRes = select ( iMaxFD, &fdsAccept, NULL, NULL, &tvTimeout ); if ( iRes==0 ) return NULL; if ( iRes<0 ) { int iErrno = sphSockGetErrno(); if ( iErrno==EINTR || iErrno==EAGAIN || iErrno==EWOULDBLOCK ) return NULL; static int iLastErrno = -1; if ( iLastErrno!=iErrno ) sphWarning ( "select() failed: %s", sphSockError(iErrno) ); iLastErrno = iErrno; return NULL; } ARRAY_FOREACH ( i, g_dListeners ) { if ( !FD_ISSET ( g_dListeners[i].m_iSock, &fdsAccept ) ) continue; // accept struct sockaddr_storage saStorage; socklen_t uLength = sizeof(saStorage); int iClientSock = accept ( g_dListeners[i].m_iSock, (struct sockaddr *)&saStorage, &uLength ); // handle failures if ( iClientSock<0 ) { const int iErrno = sphSockGetErrno(); if ( iErrno==EINTR || iErrno==ECONNABORTED || iErrno==EAGAIN || iErrno==EWOULDBLOCK ) return NULL; sphFatal ( "accept() failed: %s", sphSockError(iErrno) ); } if ( g_pStats ) { g_tStatsMutex.Lock(); g_pStats->m_iConnections++; g_tStatsMutex.Unlock(); } if ( g_eWorkers==MPM_PREFORK ) { // protected by accept mutex if ( ++*g_pConnID<0 ) *g_pConnID = 0; g_iConnID = *g_pConnID; } else { if ( ++g_iConnID<0 ) g_iConnID = 0; } // format client address if ( sClientName ) { sClientName[0] = '\0'; if ( saStorage.ss_family==AF_INET ) { struct sockaddr_in * pSa = ((struct sockaddr_in *)&saStorage); sphFormatIP ( sClientName, SPH_ADDRESS_SIZE, pSa->sin_addr.s_addr ); char * d = sClientName; while ( *d ) d++; snprintf ( d, 7, ":%d", (int)ntohs ( pSa->sin_port ) ); } if ( saStorage.ss_family==AF_UNIX ) strncpy ( sClientName, "(local)", SPH_ADDRESS_SIZE ); } // accepted! #if !USE_WINDOWS if ( SPH_FDSET_OVERFLOW ( iClientSock ) ) iClientSock = dup2 ( iClientSock, g_iClientFD ); #endif *pClientSock = iClientSock; return &g_dListeners[i]; } return NULL; } void TickPreforked ( CSphProcessSharedMutex * pAcceptMutex ) { assert ( !g_bHeadDaemon ); assert ( pAcceptMutex ); if ( g_bGotSigterm ) exit ( 0 ); int iClientSock = -1; char sClientIP[SPH_ADDRPORT_SIZE]; Listener_t * pListener = NULL; for ( ; !g_bGotSigterm && !pListener; ) { if ( pAcceptMutex->TimedLock ( 100 ) ) { if ( !g_bGotSigterm ) pListener = DoAccept ( &iClientSock, sClientIP ); pAcceptMutex->Unlock(); } } if ( g_bGotSigterm ) exit ( 0 ); // clean shutdown (after mutex unlock) if ( pListener ) { HandleClient ( pListener->m_eProto, iClientSock, sClientIP, NULL ); sphSockClose ( iClientSock ); } } void FailClient ( int iSock, SearchdStatus_e eStatus, const char * sMessage ) { assert ( eStatus==SEARCHD_RETRY || eStatus==SEARCHD_ERROR ); int iRespLen = 4 + strlen(sMessage); NetOutputBuffer_c tOut ( iSock ); tOut.SendInt ( SPHINX_SEARCHD_PROTO ); tOut.SendWord ( (WORD)eStatus ); tOut.SendWord ( 0 ); // version doesn't matter tOut.SendInt ( iRespLen ); tOut.SendString ( sMessage ); tOut.Flush (); // FIXME? without some wait, client fails to receive the response on windows sphSockClose ( iSock ); } void HandlerThread ( void * pArg ) { // setup query guard for threaded mode SphCrashLogger_c tQueryTLS; tQueryTLS.SetupTLS (); // handle that client ThdDesc_t * pThd = (ThdDesc_t*) pArg; sphThreadSet ( g_tConnKey, &pThd->m_iConnID ); HandleClient ( pThd->m_eProto, pThd->m_iClientSock, pThd->m_sClientName.cstr(), pThd ); sphSockClose ( pThd->m_iClientSock ); // done; remove myself from the table g_tThdMutex.Lock (); ARRAY_FOREACH ( i, g_dThd ) if ( g_dThd[i]==pThd ) { #if USE_WINDOWS // FIXME? this is sort of automatic on UNIX (pthread_exit() gets implicitly called on return) CloseHandle ( pThd->m_tThd ); #endif SafeDelete ( pThd ); g_dThd.RemoveFast(i); break; } g_tThdMutex.Unlock (); // something went wrong while removing; report if ( pThd ) { sphWarning ( "thread missing from thread table" ); #if USE_WINDOWS // FIXME? this is sort of automatic on UNIX (pthread_exit() gets implicitly called on return) CloseHandle ( pThd->m_tThd ); #endif SafeDelete ( pThd ); } } static void CheckChildrenTerm () { #if !USE_WINDOWS if ( g_eWorkers!=MPM_PREFORK || !g_dTermChildren.GetLength() || g_tmRotateChildren>sphMicroTimer() ) return; sphLogDebugvv ( "killing child %d ( %d )", g_dTermChildren.Last(), g_dTermChildren.GetLength() ); kill ( g_dTermChildren.Last(), SIGTERM ); g_dTermChildren.Resize ( g_dTermChildren.GetLength()-1 ); g_tmRotateChildren = sphMicroTimer() + g_iRotationThrottle*1000; #endif } void TickHead ( CSphProcessSharedMutex * pAcceptMutex ) { CheckSignals (); if ( !g_bHeadDaemon ) return; CheckLeaks (); CheckReopen (); CheckPipes (); CheckDelete (); CheckRotate (); CheckFlush (); CheckChildrenTerm(); sphInfo ( NULL ); // flush dupes if ( pAcceptMutex ) { // FIXME! what if all children are busy; we might want to accept here and temp fork more sphSleepMsec ( 1000 ); return; } int iClientSock; char sClientName[SPH_ADDRPORT_SIZE]; Listener_t * pListener = DoAccept ( &iClientSock, sClientName ); if ( !pListener ) return; if ( ( g_iMaxChildren && g_dChildren.GetLength()>=g_iMaxChildren ) || ( g_iRotateCount && !g_bSeamlessRotate ) ) { FailClient ( iClientSock, SEARCHD_RETRY, "server maxed out, retry in a second" ); sphWarning ( "maxed out, dismissing client" ); if ( g_pStats ) g_pStats->m_iMaxedOut++; return; } // handle the client if ( g_eWorkers==MPM_NONE ) { HandleClient ( pListener->m_eProto, iClientSock, sClientName, NULL ); sphSockClose ( iClientSock ); return; } #if !USE_WINDOWS if ( g_eWorkers==MPM_FORK ) { sphLogDebugv ( "conn %s: accepted, socket %d", sClientName, iClientSock ); int iChildPipe = PipeAndFork ( false, -1 ); SafeClose ( iChildPipe ); if ( !g_bHeadDaemon ) { // child process, handle client sphLogDebugv ( "conn %s: forked handler, socket %d", sClientName, iClientSock ); HandleClient ( pListener->m_eProto, iClientSock, sClientName, NULL ); sphSockClose ( iClientSock ); exit ( 0 ); } else { // parent process, continue accept()ing sphSockClose ( iClientSock ); } } #endif // !USE_WINDOWS if ( g_eWorkers==MPM_THREADS ) { ThdDesc_t * pThd = new ThdDesc_t (); pThd->m_eProto = pListener->m_eProto; pThd->m_iClientSock = iClientSock; pThd->m_sClientName = sClientName; pThd->m_iConnID = g_iConnID; g_tThdMutex.Lock (); g_dThd.Add ( pThd ); if ( !sphThreadCreate ( &pThd->m_tThd, HandlerThread, pThd, true ) ) { g_dThd.Pop(); SafeDelete ( pThd ); FailClient ( iClientSock, SEARCHD_RETRY, "failed to create worker thread" ); sphWarning ( "failed to create worker thread, threads(%d), error[%d] %s", g_dThd.GetLength(), errno, strerror(errno) ); } g_tThdMutex.Unlock (); return; } // default (should not happen) sphSockClose ( iClientSock ); } template T * InitSharedBuffer ( CSphSharedBuffer & tBuffer, int iLen ) { CSphString sError, sWarning; if ( !tBuffer.Alloc ( iLen, sError, sWarning ) ) sphDie ( "failed to allocate shared buffer (msg=%s)", sError.cstr() ); T * pRes = tBuffer.GetWritePtr(); memset ( pRes, 0, iLen*sizeof(T) ); // reset return pRes; } void ConfigureSearchd ( const CSphConfig & hConf, bool bOptPIDFile ) { if ( !hConf.Exists ( "searchd" ) || !hConf["searchd"].Exists ( "searchd" ) ) sphFatal ( "'searchd' config section not found in '%s'", g_sConfigFile.cstr () ); const CSphConfigSection & hSearchd = hConf["searchd"]["searchd"]; if ( !hConf.Exists ( "index" ) ) sphFatal ( "no indexes found in '%s'", g_sConfigFile.cstr () ); if ( bOptPIDFile ) if ( !hSearchd ( "pid_file" ) ) sphFatal ( "mandatory option 'pid_file' not found in 'searchd' section" ); if ( hSearchd.Exists ( "read_timeout" ) && hSearchd["read_timeout"].intval()>=0 ) g_iReadTimeout = hSearchd["read_timeout"].intval(); if ( hSearchd.Exists ( "client_timeout" ) && hSearchd["client_timeout"].intval()>=0 ) g_iClientTimeout = hSearchd["client_timeout"].intval(); if ( hSearchd.Exists ( "max_children" ) && hSearchd["max_children"].intval()>=0 ) g_iMaxChildren = hSearchd["max_children"].intval(); g_bPreopenIndexes = hSearchd.GetInt ( "preopen_indexes", (int)g_bPreopenIndexes )!=0; g_bOnDiskDicts = hSearchd.GetInt ( "ondisk_dict_default", (int)g_bOnDiskDicts )!=0; g_bUnlinkOld = hSearchd.GetInt ( "unlink_old", (int)g_bUnlinkOld )!=0; g_iExpansionLimit = hSearchd.GetInt ( "expansion_limit", 0 ); g_bCompatResults = hSearchd.GetInt ( "compat_sphinxql_magics", (int)g_bCompatResults )!=0; if ( g_bCompatResults ) sphWarning ( "compat_sphinxql_magics=1 is deprecated; please update your application and config" ); if ( hSearchd("max_matches") ) { int iMax = hSearchd["max_matches"].intval(); if ( iMax<0 || iMax>10000000 ) { sphWarning ( "max_matches=%d out of bounds; using default 1000", iMax ); } else { g_iMaxMatches = iMax; } } if ( hSearchd("subtree_docs_cache") ) g_iMaxCachedDocs = hSearchd.GetSize ( "subtree_docs_cache", g_iMaxCachedDocs ); if ( hSearchd("subtree_hits_cache") ) g_iMaxCachedHits = hSearchd.GetSize ( "subtree_hits_cache", g_iMaxCachedHits ); if ( hSearchd("seamless_rotate") ) g_bSeamlessRotate = ( hSearchd["seamless_rotate"].intval()!=0 ); if ( !g_bSeamlessRotate && g_bPreopenIndexes ) sphWarning ( "preopen_indexes=1 has no effect with seamless_rotate=0" ); g_iAttrFlushPeriod = hSearchd.GetInt ( "attr_flush_period", g_iAttrFlushPeriod ); g_iMaxPacketSize = hSearchd.GetSize ( "max_packet_size", g_iMaxPacketSize ); g_iMaxFilters = hSearchd.GetInt ( "max_filters", g_iMaxFilters ); g_iMaxFilterValues = hSearchd.GetInt ( "max_filter_values", g_iMaxFilterValues ); g_iMaxBatchQueries = hSearchd.GetInt ( "max_batch_queries", g_iMaxBatchQueries ); g_iDistThreads = hSearchd.GetInt ( "dist_threads", g_iDistThreads ); g_iPreforkChildren = hSearchd.GetInt ( "prefork", g_iPreforkChildren ); if ( hSearchd ( "collation_libc_locale" ) ) { const char * sLocale = hSearchd.GetStr ( "collation_libc_locale" ); if ( !setlocale ( LC_COLLATE, sLocale ) ) sphWarning ( "setlocale failed (locale='%s')", sLocale ); } if ( hSearchd ( "collation_server" ) ) { CSphString sCollation = hSearchd.GetStr ( "collation_server" ); CSphString sError; g_eCollation = sphCollationFromName ( sCollation, &sError ); if ( !sError.IsEmpty() ) sphWarning ( "%s", sError.cstr() ); } if ( hSearchd("thread_stack") ) { int iThreadStackSizeMin = 65536; int iThreadStackSizeMax = 2*1024*1024; int iStackSize = hSearchd.GetSize ( "thread_stack", iThreadStackSizeMin ); if ( iStackSizeiThreadStackSizeMax ) sphWarning ( "thread_stack is %d will be clamped to range ( 65k to 2M )", iStackSize ); iStackSize = Min ( iStackSize, iThreadStackSizeMax ); iStackSize = Max ( iStackSize, iThreadStackSizeMin ); sphSetMyStackSize ( iStackSize ); } char sHandshake1[] = "\x00\x00\x00" // packet length "\x00" // packet id "\x0A"; // protocol version; v.10 char sHandshake2[] = "\x01\x00\x00\x00" // thread id "\x01\x02\x03\x04\x05\x06\x07\x08" // scramble buffer (for auth) "\x00" // filler "\x08\x82" // server capabilities; CLIENT_PROTOCOL_41 | CLIENT_CONNECT_WITH_DB | SECURE_CONNECTION "\x00" // server language "\x02\x00" // server status "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" // filler "\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d"; // scramble buffer2 (for auth, 4.1+) const char * sVersion = hSearchd.GetStr ( "mysql_version_string", SPHINX_VERSION ); int iLen = strlen ( sVersion ); g_iMysqlHandshake = sizeof(sHandshake1) + strlen(sVersion) + sizeof(sHandshake2) - 1; if ( g_iMysqlHandshake>=(int)sizeof(g_sMysqlHandshake) ) { sphWarning ( "mysql_version_string too long; using default (version=%s)", SPHINX_VERSION ); g_iMysqlHandshake = sizeof(sHandshake1) + strlen(SPHINX_VERSION) + sizeof(sHandshake2) - 1; assert ( g_iMysqlHandshake < (int)sizeof(g_sMysqlHandshake) ); } char * p = g_sMysqlHandshake; memcpy ( p, sHandshake1, sizeof(sHandshake1)-1 ); memcpy ( p+sizeof(sHandshake1)-1, sVersion, iLen+1 ); memcpy ( p+sizeof(sHandshake1)+iLen, sHandshake2, sizeof(sHandshake2)-1 ); g_sMysqlHandshake[0] = (char)(g_iMysqlHandshake-4); // safe, as long as buffer size is 128 } void ConfigureAndPreload ( const CSphConfig & hConf, const char * sOptIndex ) { int iCounter = 1; int iValidIndexes = 0; int64_t tmLoad = -sphMicroTimer(); hConf["index"].IterateStart (); while ( hConf["index"].IterateNext() ) { const CSphConfigSection & hIndex = hConf["index"].IterateGet(); const char * sIndexName = hConf["index"].IterateGetKey().cstr(); if ( g_bOptNoDetach && sOptIndex && strcasecmp ( sIndexName, sOptIndex )!=0 ) continue; ESphAddIndex eAdd = AddIndex ( sIndexName, hIndex ); if ( eAdd==ADD_LOCAL || eAdd==ADD_RT ) { ServedIndex_t & tIndex = g_pIndexes->GetUnlockedEntry ( sIndexName ); iCounter++; fprintf ( stdout, "precaching index '%s'\n", sIndexName ); fflush ( stdout ); tIndex.m_pIndex->SetProgressCallback ( ShowProgress ); if ( HasFiles ( tIndex, g_dNewExts ) ) { tIndex.m_bOnlyNew = !HasFiles ( tIndex, g_dCurExts ); if ( RotateIndexGreedy ( tIndex, sIndexName ) ) { CSphString sError; if ( !sphFixupIndexSettings ( tIndex.m_pIndex, hIndex, sError ) ) { sphWarning ( "index '%s': %s - NOT SERVING", sIndexName, sError.cstr() ); tIndex.m_bEnabled = false; } } else { if ( PrereadNewIndex ( tIndex, hIndex, sIndexName ) ) tIndex.m_bEnabled = true; } } else { tIndex.m_bOnlyNew = false; if ( PrereadNewIndex ( tIndex, hIndex, sIndexName ) ) tIndex.m_bEnabled = true; } CSphString sError; if ( tIndex.m_bEnabled && !CheckIndex ( tIndex.m_pIndex, sError ) ) { sphWarning ( "index '%s': %s - NOT SERVING", sIndexName, sError.cstr() ); tIndex.m_bEnabled = false; } if ( !tIndex.m_bEnabled ) continue; } if ( eAdd!=ADD_ERROR ) iValidIndexes++; } tmLoad += sphMicroTimer(); if ( !iValidIndexes ) sphFatal ( "no valid indexes to serve" ); else fprintf ( stdout, "precached %d indexes in %0.3f sec\n", iCounter-1, float(tmLoad)/1000000 ); } void OpenDaemonLog ( const CSphConfigSection & hSearchd ) { // create log const char * sLog = "searchd.log"; if ( hSearchd.Exists ( "log" ) ) { if ( hSearchd["log"]=="syslog" ) { #if !USE_SYSLOG if ( g_iLogFile<0 ) { g_iLogFile = STDOUT_FILENO; sphWarning ( "failed to use syslog for logging. You have to reconfigure --with-syslog and rebuild the daemon!" ); sphInfo ( "will use default file 'searchd.log' for logging." ); } #else g_bLogSyslog = true; #endif } else { sLog = hSearchd["log"].cstr(); } } umask ( 066 ); if ( !g_bLogSyslog ) { g_iLogFile = open ( sLog, O_CREAT | O_RDWR | O_APPEND, S_IREAD | S_IWRITE ); if ( g_iLogFile<0 ) { g_iLogFile = STDOUT_FILENO; sphFatal ( "failed to open log file '%s': %s", sLog, strerror(errno) ); } } g_sLogFile = sLog; g_bLogTty = isatty ( g_iLogFile )!=0; } int WINAPI ServiceMain ( int argc, char **argv ) { g_bLogTty = isatty ( g_iLogFile )!=0; #if USE_WINDOWS CSphVector dArgs; if ( g_bService ) { g_ssHandle = RegisterServiceCtrlHandler ( g_sServiceName, ServiceControl ); if ( !g_ssHandle ) sphFatal ( "failed to start service: RegisterServiceCtrlHandler() failed: %s", WinErrorInfo() ); g_ss.dwServiceType = SERVICE_WIN32_OWN_PROCESS; MySetServiceStatus ( SERVICE_START_PENDING, NO_ERROR, 4000 ); if ( argc<=1 ) { dArgs.Resize ( g_dArgs.GetLength() ); ARRAY_FOREACH ( i, g_dArgs ) dArgs[i] = (char*) g_dArgs[i].cstr(); argc = g_dArgs.GetLength(); argv = &dArgs[0]; } } char szPipeName[64]; snprintf ( szPipeName, sizeof(szPipeName), "\\\\.\\pipe\\searchd_%d", getpid() ); g_hPipe = CreateNamedPipe ( szPipeName, PIPE_ACCESS_INBOUND, PIPE_TYPE_BYTE | PIPE_READMODE_BYTE | PIPE_NOWAIT, PIPE_UNLIMITED_INSTANCES, 0, WIN32_PIPE_BUFSIZE, NMPWAIT_NOWAIT, NULL ); ConnectNamedPipe ( g_hPipe, NULL ); #endif if ( !g_bService ) fprintf ( stdout, SPHINX_BANNER ); ////////////////////// // parse command line ////////////////////// CSphConfig conf; bool bOptStop = false; bool bOptStopWait = false; bool bOptStatus = false; bool bOptPIDFile = false; const char * sOptIndex = NULL; int iOptPort = 0; bool bOptPort = false; CSphString sOptListen; bool bOptListen = false; bool bTestMode = false; #define OPT(_a1,_a2) else if ( !strcmp(argv[i],_a1) || !strcmp(argv[i],_a2) ) #define OPT1(_a1) else if ( !strcmp(argv[i],_a1) ) int i; for ( i=1; i=argc ) break; OPT ( "-c", "--config" ) g_sConfigFile = argv[++i]; OPT ( "-p", "--port" ) { bOptPort = true; iOptPort = atoi ( argv[++i] ); } OPT ( "-l", "--listen" ) { bOptListen = true; sOptListen = argv[++i]; } OPT ( "-i", "--index" ) sOptIndex = argv[++i]; #if USE_WINDOWS OPT1 ( "--servicename" ) ++i; // it's valid but handled elsewhere #endif // handle unknown options else break; } if ( i!=argc ) sphFatal ( "malformed or unknown option near '%s'; use '-h' or '--help' to see available options.", argv[i] ); #if USE_WINDOWS // init WSA on Windows // we need to do it this early because otherwise gethostbyname() from config parser could fail WSADATA tWSAData; int iStartupErr = WSAStartup ( WINSOCK_VERSION, &tWSAData ); if ( iStartupErr ) sphFatal ( "failed to initialize WinSock2: %s", sphSockError ( iStartupErr ) ); #ifndef NDEBUG // i want my windows debugging sessions to log onto stdout g_bOptNoDetach = true; #endif #endif if ( !bOptPIDFile ) bOptPIDFile = !g_bOptNoLock; // check port and listen arguments early if ( !g_bOptNoDetach && ( bOptPort || bOptListen ) ) { sphWarning ( "--listen and --port are only allowed in --console debug mode; switch ignored" ); bOptPort = bOptListen = false; } if ( bOptPort ) { if ( bOptListen ) sphFatal ( "please specify either --port or --listen, not both" ); CheckPort ( iOptPort ); } ///////////////////// // parse config file ///////////////////// // fallback to defaults if there was no explicit config specified while ( !g_sConfigFile.cstr() ) { #ifdef SYSCONFDIR g_sConfigFile = SYSCONFDIR "/csft.conf"; if ( sphIsReadable ( g_sConfigFile.cstr () ) ) break; #endif g_sConfigFile = "./csft.conf"; if ( sphIsReadable ( g_sConfigFile.cstr () ) ) break; g_sConfigFile = NULL; break; } if ( !g_sConfigFile.cstr () ) sphFatal ( "no readable config file (looked in " #ifdef SYSCONFDIR SYSCONFDIR "/csft.conf, " #endif "./csft.conf)." ); sphInfo ( "using config file '%s'...", g_sConfigFile.cstr () ); CheckConfigChanges (); // do parse CSphConfigParser cp; if ( !cp.Parse ( g_sConfigFile.cstr () ) ) sphFatal ( "failed to parse config file '%s'", g_sConfigFile.cstr () ); const CSphConfig & hConf = cp.m_tConf; if ( !hConf.Exists ( "searchd" ) || !hConf["searchd"].Exists ( "searchd" ) ) sphFatal ( "'searchd' config section not found in '%s'", g_sConfigFile.cstr () ); const CSphConfigSection & hSearchdpre = hConf["searchd"]["searchd"]; ///////////////////// // init python layer //////////////////// if ( hConf("python") && hConf["python"]("python") ) { CSphConfigSection & hPython = hConf["python"]["python"]; #if USE_PYTHON if(!cftInitialize(hPython)) sphDie ( "Python layer's initiation failed."); #else sphDie ( "Python layer defined, but search does Not supports python. used --with-python to recompile."); #endif } //////////////////////// // stop running searchd //////////////////////// if ( bOptStop ) { if ( !hSearchdpre("pid_file") ) sphFatal ( "stop: option 'pid_file' not found in '%s' section 'searchd'", g_sConfigFile.cstr () ); const char * sPid = hSearchdpre["pid_file"].cstr(); // shortcut FILE * fp = fopen ( sPid, "r" ); if ( !fp ) sphFatal ( "stop: pid file '%s' does not exist or is not readable", sPid ); char sBuf[16]; int iLen = (int) fread ( sBuf, 1, sizeof(sBuf)-1, fp ); sBuf[iLen] = '\0'; fclose ( fp ); int iPid = atoi(sBuf); if ( iPid<=0 ) sphFatal ( "stop: failed to read valid pid from '%s'", sPid ); #if USE_WINDOWS bool bTerminatedOk = false; char szPipeName[64]; snprintf ( szPipeName, sizeof(szPipeName), "\\\\.\\pipe\\searchd_%d", iPid ); HANDLE hPipe = INVALID_HANDLE_VALUE; while ( hPipe==INVALID_HANDLE_VALUE ) { hPipe = CreateFile ( szPipeName, GENERIC_WRITE, 0, NULL, OPEN_EXISTING, 0, NULL ); if ( hPipe==INVALID_HANDLE_VALUE ) { if ( GetLastError()!=ERROR_PIPE_BUSY ) { fprintf ( stdout, "WARNING: could not open pipe (GetLastError()=%d)\n", GetLastError () ); break; } if ( !WaitNamedPipe ( szPipeName, 1000 ) ) { fprintf ( stdout, "WARNING: could not open pipe (GetLastError()=%d)\n", GetLastError () ); break; } } } if ( hPipe!=INVALID_HANDLE_VALUE ) { DWORD uWritten = 0; BYTE uWrite = 1; BOOL bResult = WriteFile ( hPipe, &uWrite, 1, &uWritten, NULL ); if ( !bResult ) fprintf ( stdout, "WARNING: failed to send SIGHTERM to searchd (pid=%d, GetLastError()=%d)\n", iPid, GetLastError () ); bTerminatedOk = !!bResult; CloseHandle ( hPipe ); } if ( bTerminatedOk ) { sphInfo ( "stop: succesfully terminated pid %d", iPid ); exit ( 0 ); } else sphFatal ( "stop: error terminating pid %d", iPid ); #else CSphString sPipeName; int iPipeCreated = -1; int hPipe = -1; if ( bOptStopWait ) { sPipeName = GetNamedPipeName ( iPid ); iPipeCreated = mkfifo ( sPipeName.cstr(), 0666 ); if ( iPipeCreated!=-1 ) hPipe = ::open ( sPipeName.cstr(), O_RDONLY | O_NONBLOCK ); if ( iPipeCreated==-1 ) sphWarning ( "mkfifo failed (path=%s, err=%d, msg=%s); will NOT wait", sPipeName.cstr(), errno, strerror(errno) ); else if ( hPipe==-1 ) sphWarning ( "open failed (path=%s, err=%d, msg=%s); will NOT wait", sPipeName.cstr(), errno, strerror(errno) ); } if ( kill ( iPid, SIGTERM ) ) sphFatal ( "stop: kill() on pid %d failed: %s", iPid, strerror(errno) ); else sphInfo ( "stop: successfully sent SIGTERM to pid %d", iPid ); int iExitCode = ( bOptStopWait && ( iPipeCreated==-1 || hPipe==-1 ) ) ? 1 : 0; if ( bOptStopWait && hPipe!=-1 ) { while ( sphIsReadable ( sPid, NULL ) ) sphSleepMsec ( 5 ); DWORD uStatus = 0; if ( ::read ( hPipe, &uStatus, sizeof(DWORD) )!=sizeof(DWORD) ) iExitCode = 3; // stopped demon crashed during stop else iExitCode = uStatus==1 ? 0 : 2; // uStatus == 1 - AttributeSave - ok, other values - error } if ( hPipe!=-1 ) ::close ( hPipe ); if ( iPipeCreated!=-1 ) ::unlink ( sPipeName.cstr() ); exit ( iExitCode ); #endif } //////////////////////////////// // query running searchd status //////////////////////////////// if ( bOptStatus ) { QueryStatus ( hSearchdpre("listen") ); exit ( 0 ); } ///////////////////// // configure searchd ///////////////////// ConfigureSearchd ( hConf, bOptPIDFile ); g_bWatchdog = hSearchdpre.GetInt ( "watchdog", g_bWatchdog )!=0; if ( hSearchdpre("workers") ) { if ( hSearchdpre["workers"]=="none" ) g_eWorkers = MPM_NONE; else if ( hSearchdpre["workers"]=="fork" ) g_eWorkers = MPM_FORK; else if ( hSearchdpre["workers"]=="prefork" ) g_eWorkers = MPM_PREFORK; else if ( hSearchdpre["workers"]=="threads" ) g_eWorkers = MPM_THREADS; else sphFatal ( "unknown workers=%s value", hSearchdpre["workers"].cstr() ); } #if USE_WINDOWS if ( g_eWorkers==MPM_FORK || g_eWorkers==MPM_PREFORK ) sphFatal ( "workers=fork and workers=prefork are not supported on Windows" ); #endif if ( g_iMaxPacketSize<128*1024 || g_iMaxPacketSize>128*1024*1024 ) sphFatal ( "max_packet_size out of bounds (128K..128M)" ); if ( g_iMaxFilters<1 || g_iMaxFilters>10240 ) sphFatal ( "max_filters out of bounds (1..10240)" ); if ( g_iMaxFilterValues<1 || g_iMaxFilterValues>10485760 ) sphFatal ( "max_filter_values out of bounds (1..10485760)" ); bool bVisualLoad = true; bool bWatched = false; #if !USE_WINDOWS // Let us start watchdog right now, on foreground first. int iDevNull = open ( "/dev/null", O_RDWR ); if ( g_bWatchdog && g_eWorkers==MPM_THREADS && !g_bOptNoDetach ) { bWatched = true; if ( !g_bOptNoLock ) OpenDaemonLog ( hConf["searchd"]["searchd"] ); bVisualLoad = SetWatchDog ( iDevNull ); } #endif // create the pid if ( bOptPIDFile ) { g_sPidFile = hSearchdpre["pid_file"].cstr(); g_iPidFD = ::open ( g_sPidFile, O_CREAT | O_WRONLY, S_IREAD | S_IWRITE ); if ( g_iPidFD<0 ) sphFatal ( "failed to create pid file '%s': %s", g_sPidFile, strerror(errno) ); } if ( bOptPIDFile && !sphLockEx ( g_iPidFD, false ) ) sphFatal ( "failed to lock pid file '%s': %s (searchd already running?)", g_sPidFile, strerror(errno) ); if ( bWatched && !bVisualLoad && CheckConfigChanges() ) { // reparse the config file sphInfo ( "Reloading the config" ); if ( !cp.ReParse ( g_sConfigFile.cstr () ) ) sphFatal ( "failed to parse config file '%s'", g_sConfigFile.cstr () ); sphInfo ( "Reconfigure the daemon" ); ConfigureSearchd ( hConf, bOptPIDFile ); // reinit the arena const CSphConfigSection & hSearchd = hConf["searchd"]["searchd"]; sphInfo ( "Reload the indexes" ); sphArenaInit ( hSearchd.GetSize ( "mva_updates_pool", MVA_UPDATES_POOL ) ); // reload all the indexes ConfigureAndPreload ( hConf, sOptIndex ); } // hSearchdpre might be dead if we reloaded the config. const CSphConfigSection & hSearchd = hConf["searchd"]["searchd"]; ////////////////////////////////////////////////// // shared stuff (perf counters, flushing) startup ////////////////////////////////////////////////// g_pStats = InitSharedBuffer ( g_tStatsBuffer, 1 ); g_pFlush = InitSharedBuffer ( g_tFlushBuffer, 1 ); g_pStats->m_uStarted = (DWORD)time(NULL); if ( g_eWorkers==MPM_PREFORK ) g_pConnID = (int*) InitSharedBuffer ( g_dConnID, sizeof(g_iConnID) ); if ( g_eWorkers==MPM_THREADS ) { if ( !sphThreadKeyCreate ( &g_tConnKey ) ) sphFatal ( "failed to create TLS for connection ID" ); // for simplicity, UDFs are going to be available in threaded mode only for now sphUDFInit ( hSearchd.GetStr ( "plugin_dir" ) ); } //////////////////// // network startup //////////////////// Listener_t tListener; tListener.m_eProto = PROTO_SPHINX; // command line arguments override config (but only in --console) if ( bOptListen ) { AddListener ( sOptListen ); } else if ( bOptPort ) { tListener.m_iSock = sphCreateInetSocket ( htonl ( INADDR_ANY ), iOptPort ); g_dListeners.Add ( tListener ); } else { // listen directives in configuration file for ( CSphVariant * v = hSearchd("listen"); v; v = v->m_pNext ) AddListener ( *v ); // handle deprecated directives if ( hSearchd("port") ) { DWORD uAddr = hSearchd.Exists("address") ? sphGetAddress ( hSearchd["address"].cstr(), GETADDR_STRICT ) : htonl ( INADDR_ANY ); int iPort = hSearchd["port"].intval(); CheckPort(iPort); tListener.m_iSock = sphCreateInetSocket ( uAddr, iPort ); g_dListeners.Add ( tListener ); } // still nothing? default is to listen on our two ports if ( !g_dListeners.GetLength() ) { tListener.m_iSock = sphCreateInetSocket ( htonl ( INADDR_ANY ), SPHINXAPI_PORT ); tListener.m_eProto = PROTO_SPHINX; g_dListeners.Add ( tListener ); tListener.m_iSock = sphCreateInetSocket ( htonl ( INADDR_ANY ), SPHINXQL_PORT ); tListener.m_eProto = PROTO_MYSQL41; g_dListeners.Add ( tListener ); } } #if !USE_WINDOWS // reserve an fd for clients g_iClientFD = dup ( iDevNull ); #endif g_pIndexes = new IndexHash_c(); ////////////////////// // build indexes hash ////////////////////// // setup mva updates arena here, since we could have saved persistent mva updates sphArenaInit ( hSearchd.GetSize ( "mva_updates_pool", MVA_UPDATES_POOL ) ); // configure and preload ConfigureAndPreload ( hConf, sOptIndex ); /////////// // startup /////////// if ( g_eWorkers==MPM_THREADS ) sphRTInit(); // handle my signals SetSignalHandlers (); // create logs if ( !g_bOptNoLock ) { // create log const char * sLog = "searchd.log"; if ( hSearchd.Exists ( "log" ) ) { if ( hSearchd["log"]=="syslog" ) { #if !USE_SYSLOG if ( g_iLogFile<0 ) { g_iLogFile = STDOUT_FILENO; sphWarning ( "failed to use syslog for logging. You have to reconfigure --with-syslog and rebuild the daemon!" ); sphInfo ( "will use default file 'searchd.log' for logging." ); } #else g_bLogSyslog = true; #endif } else { sLog = hSearchd["log"].cstr(); } } umask ( 066 ); if ( g_iLogFile!=STDOUT_FILENO ) { close ( g_iLogFile ); g_iLogFile = STDOUT_FILENO; } if ( !g_bLogSyslog ) { g_iLogFile = open ( sLog, O_CREAT | O_RDWR | O_APPEND, S_IREAD | S_IWRITE ); if ( g_iLogFile<0 ) { g_iLogFile = STDOUT_FILENO; sphFatal ( "failed to open log file '%s': %s", sLog, strerror(errno) ); } } g_sLogFile = sLog; g_bLogTty = isatty ( g_iLogFile )!=0; // create query log if required if ( hSearchd.Exists ( "query_log" ) ) { if ( hSearchd["query_log"]=="syslog" ) g_bQuerySyslog = true; else { g_iQueryLogFile = open ( hSearchd["query_log"].cstr(), O_CREAT | O_RDWR | O_APPEND, S_IREAD | S_IWRITE ); if ( g_iQueryLogFile<0 ) sphFatal ( "failed to open query log file '%s': %s", hSearchd["query_log"].cstr(), strerror(errno) ); } g_sQueryLogFile = hSearchd["query_log"].cstr(); } } if ( !strcmp ( hSearchd.GetStr ( "query_log_format", "plain" ), "sphinxql" ) ) g_eLogFormat = LOG_FORMAT_SPHINXQL; // almost ready, time to start listening int iBacklog = hSearchd.GetInt ( "listen_backlog", SEARCHD_BACKLOG ); ARRAY_FOREACH ( i, g_dListeners ) if ( listen ( g_dListeners[i].m_iSock, iBacklog )==-1 ) sphFatal ( "listen() failed: %s", sphSockError() ); // prepare to detach if ( !g_bOptNoDetach ) { #if !USE_WINDOWS if ( !bWatched || bVisualLoad ) { close ( STDIN_FILENO ); close ( STDOUT_FILENO ); close ( STDERR_FILENO ); dup2 ( iDevNull, STDIN_FILENO ); dup2 ( iDevNull, STDOUT_FILENO ); dup2 ( iDevNull, STDERR_FILENO ); } #endif ReleaseTTYFlag(); // explicitly unlock everything in parent immediately before fork // // there's a race in case another instance is started before // child re-acquires all locks; but let's hope that's rare if ( !bWatched ) { for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) { ServedIndex_t & tServed = it.Get(); if ( tServed.m_bEnabled ) tServed.m_pIndex->Unlock(); } } } if ( bOptPIDFile && !bWatched ) sphLockUn ( g_iPidFD ); #if !USE_WINDOWS if ( !g_bOptNoDetach && !bWatched ) { switch ( fork() ) { case -1: // error Shutdown (); sphFatal ( "fork() failed (reason: %s)", strerror ( errno ) ); exit ( 1 ); case 0: // daemonized child break; default: // tty-controlled parent sphSetProcessInfo ( false ); exit ( 0 ); } } #endif if ( g_eWorkers==MPM_THREADS ) sphRTConfigure ( hSearchd, bTestMode ); if ( bOptPIDFile ) { #if !USE_WINDOWS // re-lock pid // FIXME! there's a potential race here if ( !sphLockEx ( g_iPidFD, true ) ) sphFatal ( "failed to re-lock pid file '%s': %s", g_sPidFile, strerror(errno) ); #endif char sPid[16]; snprintf ( sPid, sizeof(sPid), "%d\n", (int)getpid() ); int iPidLen = strlen(sPid); lseek ( g_iPidFD, 0, SEEK_SET ); if ( !sphWrite ( g_iPidFD, sPid, iPidLen ) ) sphFatal ( "failed to write to pid file '%s' (errno=%d, msg=%s)", g_sPidFile, errno, strerror(errno) ); if ( ::ftruncate ( g_iPidFD, iPidLen ) ) sphFatal ( "failed to truncate pid file '%s' (errno=%d, msg=%s)", g_sPidFile, errno, strerror(errno) ); } #if USE_WINDOWS SetConsoleCtrlHandler ( CtrlHandler, TRUE ); #endif if ( !g_bOptNoDetach && !bWatched ) { // re-lock indexes for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) { ServedIndex_t & tServed = it.Get(); if ( !tServed.m_bEnabled ) continue; // obtain exclusive lock if ( !tServed.m_pIndex->Lock() ) { sphWarning ( "index '%s': lock: %s; INDEX UNUSABLE", it.GetKey().cstr(), tServed.m_pIndex->GetLastError().cstr() ); tServed.m_bEnabled = false; continue; } // try to mlock again because mlock does not survive over fork if ( !tServed.m_pIndex->Mlock() ) { sphWarning ( "index '%s': %s", it.GetKey().cstr(), tServed.m_pIndex->GetLastError().cstr() ); } } } // if we're running in console mode, dump queries to tty as well if ( g_bOptNoLock && hSearchd ( "query_log" ) ) { g_bQuerySyslog = false; g_bLogSyslog = false; g_iQueryLogFile = g_iLogFile; } #if USE_SYSLOG if ( g_bLogSyslog || g_bQuerySyslog ) { openlog ( "searchd", LOG_PID, LOG_DAEMON ); } #else if ( g_bQuerySyslog ) sphFatal ( "Wrong query_log file! You have to reconfigure --with-syslog and rebuild daemon if you want to use syslog there." ); #endif ///////////////// // serve clients ///////////////// g_bHeadDaemon = true; #if USE_WINDOWS if ( g_bService ) MySetServiceStatus ( SERVICE_RUNNING, NO_ERROR, 0 ); #endif sphSetReadBuffers ( hSearchd.GetSize ( "read_buffer", 0 ), hSearchd.GetSize ( "read_unhinted", 0 ) ); CSphProcessSharedMutex * pAcceptMutex = NULL; #if !USE_WINDOWS if ( g_eWorkers==MPM_PREFORK ) { pAcceptMutex = new CSphProcessSharedMutex(); if ( !pAcceptMutex ) sphFatal ( "failed to create process-shared mutex" ); while ( g_dChildren.GetLength() < g_iPreforkChildren ) { if ( PreforkChild()==0 ) // child process? break from here, go work break; } g_iRotationThrottle = hSearchd.GetInt ( "prefork_rotation_throttle", 0 ); } #endif // in threaded mode, create a dedicated rotation thread if ( g_eWorkers==MPM_THREADS ) { if ( !g_tThdMutex.Init() || !g_tRotateQueueMutex.Init() || !g_tRotateConfigMutex.Init() ) sphDie ( "failed to init mutex" ); if ( g_bSeamlessRotate && !sphThreadCreate ( &g_tRotateThread, RotationThreadFunc , 0 ) ) sphDie ( "failed to create rotation thread" ); // reserving max to keep memory consumption constant between frames g_dThd.Reserve ( g_iMaxChildren*2 ); g_tDistLock.Init(); g_tFlushMutex.Init(); } // replay last binlog SmallStringHash_T hIndexes; for ( IndexHashIterator_c it ( g_pIndexes ); it.Next(); ) if ( it.Get().m_bEnabled ) hIndexes.Add ( it.Get().m_pIndex, it.GetKey() ); if ( g_eWorkers==MPM_THREADS ) sphReplayBinlog ( hIndexes, DumpMemStat ); if ( !g_bOptNoDetach ) g_bLogStdout = false; // create flush-rt thread if ( g_eWorkers==MPM_THREADS && !sphThreadCreate ( &g_tRtFlushThread, RtFlushThreadFunc, 0 ) ) sphDie ( "failed to create rt-flush thread" ); sphInfo ( "accepting connections" ); for ( ;; ) { SphCrashLogger_c::SetupTimePID(); if ( !g_bHeadDaemon && pAcceptMutex ) TickPreforked ( pAcceptMutex ); else TickHead ( pAcceptMutex ); } } // NOLINT function length bool DieCallback ( const char * sMessage ) { sphLogFatal ( "%s", sMessage ); return false; // caller should not log } extern bool ( *g_pUservarsHook )( const CSphString & sUservar, CSphVector & dVals ); bool UservarsHook ( const CSphString & sUservar, CSphVector & dVals ) { g_tUservarsMutex.Lock(); Uservar_t * pVar = g_hUservars ( sUservar ); if ( pVar ) { assert ( pVar->m_eType==USERVAR_INT_SET ); dVals = *pVar->m_pVal; } g_tUservarsMutex.Unlock(); return ( pVar!=NULL ); } int main ( int argc, char **argv ) { // threads should be initialized before memory allocations char cTopOfMainStack; sphThreadInit(); MemorizeStack ( &cTopOfMainStack ); sphSetDieCallback ( DieCallback ); sphSetLogger ( sphLog ); g_pUservarsHook = UservarsHook; sphCollationInit (); #if USE_WINDOWS int iNameIndex = -1; for ( int i=1; i=0 ) g_sServiceName = g_dArgs[iNameIndex].cstr (); SERVICE_TABLE_ENTRY dDispatcherTable[] = { { (LPSTR) g_sServiceName, (LPSERVICE_MAIN_FUNCTION)ServiceMain }, { NULL, NULL } }; if ( !StartServiceCtrlDispatcher ( dDispatcherTable ) ) sphFatal ( "StartServiceCtrlDispatcher() failed: %s", WinErrorInfo() ); } else #endif return ServiceMain ( argc, argv ); } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/spelldump.cpp100777 0 0 63624 11643565732 14014 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxutils.h" #include const int MAX_STR_LENGTH = 512; ////////////////////////////////////////////////////////////////////////// BYTE GetWordchar ( const char * & szSet ) { if ( *szSet=='\\' ) { if ( !szSet[1] || !szSet[2] || !szSet[3] ) return 0; char szBuf[3]; memcpy ( szBuf, szSet+2, 2 ); szBuf[2] = 0; char * szStop = NULL; int iRes = strtol ( szBuf, &szStop, 16 ); if ( szStop!=szBuf+2 || iRes<0 || iRes>255 ) return 0; szSet += 4; return (BYTE) iRes; } return *szSet++; } bool IsInSet ( BYTE uLetter, const char * szSet ) { if ( !szSet ) return false; bool bInvert = ( *szSet=='^' ); if ( bInvert ) ++szSet; const char * szSep = strchr ( szSet, '-' ); bool bRange = ( szSep!=NULL ); if ( bRange ) { BYTE uRange1 = GetWordchar ( szSet ); szSep++; BYTE uRange2 = GetWordchar ( szSep ); if ( uLetter>=Min ( uRange1, uRange2 ) && uLetter<=Max ( uRange1, uRange2 ) ) return !bInvert; } else { BYTE uChar = 0; while ( ( uChar = GetWordchar ( szSet ) )!=0 ) if ( uChar==uLetter ) break; bool bEnd = !uChar; if ( bInvert && bEnd ) return true; if ( !bInvert && !bEnd ) return true; } return false; } bool GetSetMinMax ( const char * szSet, BYTE & uMin, BYTE & uMax ) { if ( !szSet || !*szSet ) return false; uMin = GetWordchar ( szSet ); uMax = uMin; BYTE uChar; while ( ( uChar = GetWordchar ( szSet ) )!=0 ) if ( uChar!='-' ) { uMin = Min ( uMin, uChar ); uMax = Max ( uMax, uChar ); } if ( !uMin || !uMax ) return false; return true; } ////////////////////////////////////////////////////////////////////////// class CISpellDict { public: struct CISpellDictWord { CSphString m_sWord; CSphString m_sFlags; }; bool Load ( const char * szFilename ); void IterateStart (); const CISpellDictWord * IterateNext (); private: CSphVector < CISpellDictWord > m_dEntries; int m_iIterator; }; bool CISpellDict::Load ( const char * szFilename ) { if ( !szFilename ) return false; m_dEntries.Reset (); m_dEntries.Reserve ( 131072 ); FILE * pFile = fopen ( szFilename, "rt" ); if ( !pFile ) return false; char szWordBuffer [MAX_STR_LENGTH]; while ( !feof ( pFile ) ) { char * szResult = fgets ( szWordBuffer, MAX_STR_LENGTH, pFile ); if ( !szResult ) break; int iPos = strlen ( szWordBuffer ) - 1; while ( iPos>=0 && isspace ( (unsigned char)szWordBuffer[iPos] ) ) szWordBuffer [iPos--] = '\0'; CISpellDictWord Word; char * szPosition = strchr ( szWordBuffer, '/' ); if ( !szPosition ) { szPosition = szWordBuffer; while ( *szPosition && !isspace ( (unsigned char)*szPosition ) ) ++szPosition; *szPosition = '\0'; Word.m_sWord = szWordBuffer; } else { *szPosition = '\0'; Word.m_sWord = szWordBuffer; ++szPosition; char * szFlags = szPosition; while ( *szPosition && !isspace ( (unsigned char)*szPosition ) ) ++szPosition; *szPosition = '\0'; Word.m_sFlags = szFlags; } m_dEntries.Add ( Word ); } fclose ( pFile ); return true; } void CISpellDict::IterateStart () { m_iIterator = 0; } const CISpellDict::CISpellDictWord * CISpellDict::IterateNext () { if ( m_iIterator>=m_dEntries.GetLength() ) return NULL; return &m_dEntries [m_iIterator++]; } ////////////////////////////////////////////////////////////////////////// enum RuleType_e { RULE_NONE, RULE_PREFIXES, RULE_SUFFIXES }; class CISpellAffixRule { public: CISpellAffixRule () {} CISpellAffixRule ( RuleType_e eRule, char cFlag, bool bCrossProduct, char * szCondition, char * szStrip, char * szAppend ); bool Apply ( CSphString & sWord ); char Flag () const; bool IsCrossProduct () const; bool IsPrefix () const; private: RuleType_e m_eRule; char m_cFlag; bool m_bCrossProduct; CSphString m_sCondition; CSphString m_sStrip; CSphString m_sAppend; int m_iWordLen; int m_iCondLen; int m_iStripLen; int m_iAppendLen; bool CheckSuffix ( const CSphString & sWord ) const; bool CheckPrefix ( const CSphString & sWord ) const; bool StripAppendSuffix ( CSphString & sWord ) const; bool StripAppendPrefix ( CSphString & sWord ) const; }; CISpellAffixRule::CISpellAffixRule ( RuleType_e eRule, char cFlag, bool bCrossProduct, char * szCondition, char * szStrip, char * szAppend ) : m_eRule ( eRule ) , m_cFlag ( cFlag ) , m_bCrossProduct ( bCrossProduct ) , m_sCondition ( szCondition ) , m_sStrip ( szStrip ) , m_sAppend ( szAppend ) , m_iWordLen ( 0 ) { m_iCondLen = szCondition ? strlen ( szCondition ) : 0; m_iStripLen = szStrip ? strlen ( szStrip ) : 0; m_iAppendLen = szAppend ? strlen ( szAppend ) : 0; } bool CISpellAffixRule::Apply ( CSphString & sWord ) { if ( m_sCondition.IsEmpty () ) return true; if ( sWord.IsEmpty () ) return false; m_iWordLen = strlen ( sWord.cstr () ); bool bDotCond = ( m_sCondition=="." ); if ( m_eRule==RULE_SUFFIXES ) { if ( !bDotCond && !CheckSuffix ( sWord ) ) return false; if ( !StripAppendSuffix ( sWord ) ) return false; } else { if ( !bDotCond && !CheckPrefix ( sWord ) ) return false; if ( !StripAppendPrefix ( sWord ) ) return false; } return true; } bool CISpellAffixRule::CheckSuffix ( const CSphString & sWord ) const { int iCondI = m_iCondLen-1; for ( int i=m_iWordLen-1; iCondI>=0 && i>=0; --i ) { if ( m_sCondition.cstr()[iCondI]!=']' ) { if ( m_sCondition.cstr()[iCondI]!=sWord.cstr()[i] ) return false; --iCondI; } else { int iRangeStart = -1; for ( int j=iCondI; j>=0 && iRangeStart==-1; --j ) if ( m_sCondition.cstr()[j]=='[' ) iRangeStart = j; if ( iRangeStart==-1 ) return false; else { if ( !IsInSet ( sWord.cstr () [i], m_sCondition.SubString ( iRangeStart + 1, iCondI - iRangeStart - 1 ).cstr () ) ) return false; iCondI = iRangeStart - 1; } } } return true; } bool CISpellAffixRule::StripAppendSuffix ( CSphString & sWord ) const { static char szTmp [ MAX_STR_LENGTH]; if ( !m_sStrip.IsEmpty () ) { if ( m_iWordLen < m_iStripLen ) return false; if ( strncmp ( sWord.cstr () + m_iWordLen - m_iStripLen, m_sStrip.cstr (), m_iStripLen ) ) return false; } strncpy ( szTmp, sWord.cstr (), m_iWordLen - m_iStripLen ); szTmp [m_iWordLen - m_iStripLen] = '\0'; if ( !m_sAppend.IsEmpty () ) strcat ( szTmp, m_sAppend.cstr () ); // NOLINT sWord = szTmp; return true; } bool CISpellAffixRule::CheckPrefix ( const CSphString & sWord ) const { int iCondI = 0; for ( int i = 0; iCondI < m_iCondLen && i < m_iWordLen; ++i ) { if ( m_sCondition.cstr()[iCondI]!='[' ) { if ( m_sCondition.cstr()[iCondI]!=sWord.cstr()[i] ) return false; ++iCondI; } else { int iRangeEnd = -1; for ( int j=iCondI; j m_dRules; char m_dCharset [256]; bool m_bFirstCaseConv; CSphString m_sLocale; CSphString m_sCharsetFile; bool m_bCheckCrosses; CSphLowercaser m_LowerCaser; bool m_bUseLowerCaser; bool m_bUseDictConversion; bool AddToCharset ( char * szRangeL, char * szRangeU ); void AddCharPair ( BYTE uCharL, BYTE uCharU ); void Strip ( char * szText ); char ToLowerCase ( char cChar ); void LoadLocale (); AffixFormat_e DetectFormat ( FILE * ); bool LoadISpell ( FILE * ); bool LoadMySpell ( FILE * ); }; CISpellAffix::CISpellAffix ( const char * szLocale, const char * szCharsetFile ) : m_bFirstCaseConv ( true ) , m_sLocale ( szLocale ) , m_sCharsetFile ( szCharsetFile ) , m_bCheckCrosses ( false ) , m_bUseLowerCaser ( false ) , m_bUseDictConversion ( false ) { } AffixFormat_e CISpellAffix::DetectFormat ( FILE * pFile ) { char sBuffer [MAX_STR_LENGTH]; while ( !feof ( pFile ) ) { char * sLine = fgets ( sBuffer, MAX_STR_LENGTH, pFile ); if ( !sLine ) break; if ( !strncmp ( sLine, "SFX", 3 ) ) return AFFIX_FORMAT_MYSPELL; if ( !strncmp ( sLine, "PFX", 3 ) ) return AFFIX_FORMAT_MYSPELL; if ( !strncmp ( sLine, "REP", 3 ) ) return AFFIX_FORMAT_MYSPELL; if ( !strncasecmp ( sLine, "prefixes", 8 ) ) return AFFIX_FORMAT_ISPELL; if ( !strncasecmp ( sLine, "suffixes", 8 ) ) return AFFIX_FORMAT_ISPELL; if ( !strncasecmp ( sLine, "flag", 4 ) ) return AFFIX_FORMAT_ISPELL; } return AFFIX_FORMAT_UNKNOWN; } bool CISpellAffix::Load ( const char * szFilename ) { if ( !szFilename ) return false; m_dRules.Reset (); memset ( m_dCharset, 0, sizeof ( m_dCharset ) ); m_bFirstCaseConv = true; m_bUseLowerCaser = false; m_bUseDictConversion = false; m_LowerCaser.Reset (); FILE * pFile = fopen ( szFilename, "rt" ); if ( !pFile ) return false; bool bResult = false; AffixFormat_e eFormat = DetectFormat ( pFile ); if ( eFormat==AFFIX_FORMAT_UNKNOWN ) printf ( "Failed to detect affix file format\n" ); else { fseek ( pFile, SEEK_SET, 0 ); printf ( "Using %s affix file format\n", AffixFormatName[eFormat] ); switch ( eFormat ) { case AFFIX_FORMAT_MYSPELL: bResult = LoadMySpell ( pFile ); break; case AFFIX_FORMAT_ISPELL: bResult = LoadISpell ( pFile ); break; case AFFIX_FORMAT_UNKNOWN: break; } } fclose ( pFile ); bool bHaveCrossPrefix = false; for ( int i = 0; i < m_dRules.GetLength () && !bHaveCrossPrefix; i++ ) if ( m_dRules[i].IsPrefix() && m_dRules[i].IsCrossProduct() ) bHaveCrossPrefix = true; bool bHaveCrossSuffix = false; for ( int i = 0; i < m_dRules.GetLength () && !bHaveCrossSuffix; i++ ) if ( !m_dRules[i].IsPrefix() && m_dRules[i].IsCrossProduct() ) bHaveCrossSuffix = true; m_bCheckCrosses = bHaveCrossPrefix && bHaveCrossSuffix; return bResult; } bool CISpellAffix::LoadISpell ( FILE * pFile ) { char szBuffer [ MAX_STR_LENGTH ]; char szCondition [ MAX_STR_LENGTH ]; char szStrip [ MAX_STR_LENGTH ]; char szAppend [ MAX_STR_LENGTH ]; RuleType_e eRule = RULE_NONE; char cFlag = '\0'; bool bCrossProduct = false; int iLine = 0; // TODO: parse all .aff character replacement commands while ( !feof ( pFile ) ) { char * szResult = fgets ( szBuffer, MAX_STR_LENGTH, pFile ); if ( !szResult ) break; iLine++; if ( !strncasecmp ( szBuffer, "prefixes", 8 ) ) { eRule = RULE_PREFIXES; continue; } if ( !strncasecmp ( szBuffer, "suffixes", 8 ) ) { eRule = RULE_SUFFIXES; continue; } if ( !strncasecmp ( szBuffer, "wordchars", 9 ) ) { char * szStart = szBuffer + 9; while ( *szStart && isspace ( (unsigned char) *szStart ) ) ++szStart; char * szRangeL = szStart; while ( *szStart && !isspace ( (unsigned char) *szStart ) ) ++szStart; if ( !*szStart ) { printf ( "WARNING: Line %d: invalid 'wordchars' statement\n", iLine ); continue; } *szStart = '\0'; ++szStart; while ( *szStart && isspace ( (unsigned char) *szStart ) ) ++szStart; char * szRangeU = szStart; while ( *szStart && !isspace ( (unsigned char) *szStart ) ) ++szStart; *szStart = '\0'; if ( !AddToCharset ( szRangeL, szRangeU ) ) printf ( "WARNING: Line %d: cannot add to charset: '%s' '%s'\n", iLine, szRangeL, szRangeU ); continue; } if ( !strncasecmp ( szBuffer, "flag", 4 ) ) { if ( eRule==RULE_NONE ) { printf ( "WARNING: Line %d: 'flag' appears before preffixes or suffixes\n", iLine ); continue; } char * szStart = szBuffer + 4; while ( *szStart && isspace ( (unsigned char) *szStart ) ) ++szStart; bCrossProduct = ( *szStart=='*' ); cFlag = bCrossProduct ? *(szStart + 1) : *(szStart); continue; } if ( eRule==RULE_NONE ) continue; char * szComment = strchr ( szBuffer, '#' ); if ( szComment ) *szComment = '\0'; if ( !* szBuffer ) continue; szCondition[0] = '\0'; szStrip[0] = '\0'; szAppend[0] = '\0'; int nFields = sscanf ( szBuffer, "%[^>\n]>%[^,\n],%[^\n]", szCondition, szStrip, szAppend ); // NOLINT Strip ( szCondition ); Strip ( szStrip ); Strip ( szAppend ); switch ( nFields ) { case 2: // no optional strip-string strcpy ( szAppend, szStrip ); // NOLINT szStrip[0] = '\0'; break; case 3: // all read break; default: // invalid repl continue; } CISpellAffixRule Rule ( eRule, cFlag, bCrossProduct, szCondition, szStrip, szAppend ); m_dRules.Add ( Rule ); } return true; } bool CISpellAffix::LoadMySpell ( FILE * pFile ) { char sBuffer [MAX_STR_LENGTH]; char sCondition [MAX_STR_LENGTH]; char sRemove [MAX_STR_LENGTH]; char sAppend [MAX_STR_LENGTH]; RuleType_e eRule = RULE_NONE; BYTE cFlag = 0; BYTE cCombine = 0; int iCount = 0, iLine = 0; const char * sMode = 0; while ( !feof ( pFile ) ) { char * sLine = fgets ( sBuffer, MAX_STR_LENGTH, pFile ); if ( !sLine ) break; ++iLine; // prefix and suffix rules RuleType_e eNewRule = RULE_NONE; if ( !strncmp ( sLine, "PFX", 3 ) ) { eNewRule = RULE_PREFIXES; sMode = "prefix"; } else if ( !strncmp ( sLine, "SFX", 3 ) ) { eNewRule = RULE_SUFFIXES; sMode = "suffix"; } if ( eNewRule!=RULE_NONE ) { sLine += 3; while ( *sLine && isspace ( (unsigned char) *sLine ) ) ++sLine; if ( eNewRule!=eRule ) // new rule header { if ( iCount ) printf ( "WARNING: Line %d: Premature end of entries.\n", iLine ); if ( sscanf ( sLine, "%c %c %d", &cFlag, &cCombine, &iCount )!=3 ) // NOLINT printf ( "WARNING; Line %d: Malformed %s header\n", iLine, sMode ); eRule = eNewRule; } else // current rule continued { *sRemove = *sAppend = 0; char cNewFlag; if ( sscanf ( sLine, "%c %s %s %s", &cNewFlag, sRemove, sAppend, sCondition )==4 ) // NOLINT { if ( cNewFlag!=cFlag ) printf ( "WARNING: Line %d: Flag character mismatch\n", iLine ); if ( *sRemove=='0' && *(sRemove + 1)==0 ) *sRemove = 0; if ( *sAppend=='0' && *(sAppend + 1)==0 ) *sAppend = 0; CISpellAffixRule Rule ( eRule, cFlag, cCombine=='Y', sCondition, sRemove, sAppend ); m_dRules.Add ( Rule ); } else printf ( "WARNING: Line %d: Malformed %s rule\n", iLine, sMode ); if ( !--iCount ) eRule = RULE_NONE; } continue; } } return true; } CISpellAffixRule * CISpellAffix::GetRule ( int iRule ) { return &m_dRules [iRule]; } int CISpellAffix::GetNumRules () const { return m_dRules.GetLength (); } bool CISpellAffix::CheckCrosses () const { return m_bCheckCrosses; } bool CISpellAffix::AddToCharset ( char * szRangeL, char * szRangeU ) { if ( !szRangeL || !szRangeU ) return false; int iLengthL = strlen ( szRangeL ); int iLengthU = strlen ( szRangeU ); bool bSetL = ( iLengthL>0 && szRangeL[0]=='[' && szRangeL[iLengthL-1]==']' ); bool bSetR = ( iLengthU>0 && szRangeU[0]=='[' && szRangeU[iLengthU-1]==']' ); if ( bSetL!=bSetR ) return false; if ( bSetL ) { szRangeL [iLengthL - 1] = '\0'; szRangeL = szRangeL + 1; szRangeU [iLengthU - 1] = '\0'; szRangeU = szRangeU + 1; BYTE uMinL, uMaxL; if ( !GetSetMinMax ( szRangeL, uMinL, uMaxL ) ) return false; BYTE uMinU, uMaxU; if ( !GetSetMinMax ( szRangeU, uMinU, uMaxU ) ) return false; if ( ( uMaxU - uMinU )!=( uMaxL - uMinL ) ) return false; for ( BYTE i=0; i<=( uMaxL - uMinL ); ++i ) if ( IsInSet ( uMinL + i, szRangeL ) && IsInSet ( uMinU + i, szRangeU ) ) AddCharPair ( uMinL + i, uMinU + i ); } else { if ( iLengthL > 4 || iLengthU > 4 ) return false; const char * szL = szRangeL; const char * szU = szRangeU; AddCharPair ( GetWordchar(szL), GetWordchar(szU) ); } m_bUseDictConversion = true; return true; } void CISpellAffix::AddCharPair ( BYTE uCharL, BYTE uCharU ) { m_dCharset [uCharU] = uCharL; } void CISpellAffix::Strip ( char * szText ) { char * szIterator1 = szText; char * szIterator2 = szText; while ( *szIterator1 ) { if ( !isspace ( (unsigned char) *szIterator1 ) && *szIterator1!='-' ) { *szIterator2 = *szIterator1; ++szIterator2; } ++szIterator1; } *szIterator2 = '\0'; while ( *szText ) { *szText = ToLowerCase ( *szText ); ++szText; } } char CISpellAffix::ToLowerCase ( char cChar ) { if ( m_bFirstCaseConv ) { LoadLocale (); m_bFirstCaseConv = false; } // dictionary conversion if ( m_bUseDictConversion ) return m_dCharset [(BYTE) cChar] ? m_dCharset [(BYTE) cChar] : cChar; // user-defined character mapping if ( m_bUseLowerCaser ) { char cResult = (char)m_LowerCaser.ToLower ( (BYTE) cChar ); return cResult ? cResult : cChar; } // user-specified code page conversion return (char)tolower ( (BYTE)cChar ); // workaround for systems (eg. FreeBSD) which default to signed char. marvelous! } void CISpellAffix::LoadLocale () { if ( m_bUseDictConversion ) printf ( "Using dictionary-defined character set\n" ); else if ( !m_sCharsetFile.IsEmpty () ) { FILE * pFile = fopen ( m_sCharsetFile.cstr (), "rt" ); if ( pFile ) { printf ( "Using charater set from '%s'\n", m_sCharsetFile.cstr () ); const int MAX_CHARSET_LENGTH = 4096; char szBuffer [MAX_CHARSET_LENGTH]; char * szResult = fgets ( szBuffer, MAX_CHARSET_LENGTH, pFile ); if ( szResult ) { CSphVector dRemaps; if ( sphParseCharset ( szBuffer, dRemaps ) ) { m_bUseLowerCaser = true; m_LowerCaser.AddRemaps ( dRemaps, 0 ); } else { printf ( "Failed to parse charset from '%s'\n", m_sCharsetFile.cstr() ); } } else { printf ( "Failed to read charset from '%s'\n", m_sCharsetFile.cstr() ); } fclose ( pFile ); } else { printf ( "Failed to open '%s'\n", m_sCharsetFile.cstr() ); } } else { if ( !m_sLocale.IsEmpty () ) { char dLocaleC[256], dLocaleUser[256]; setlocale ( LC_ALL, "C" ); for ( int i=0; i<256; i++ ) dLocaleC[i] = (char) tolower(i); char * szLocale = setlocale ( LC_CTYPE, m_sLocale.cstr() ); if ( szLocale ) { printf ( "Using user-defined locale (locale=%s)\n", m_sLocale.cstr() ); for ( int i=0; i<256; i++ ) dLocaleUser[i] = (char) tolower(i); if ( !memcmp ( dLocaleC, dLocaleUser, 256 ) ) printf ( "WARNING: user-defined locale provides the same case conversion as the default \"C\" locale\n" ); } else printf ( "WARNING: could not set user-defined locale for case conversions (locale=%s)\n", m_sLocale.cstr() ); } else printf ( "WARNING: no character set specified\n" ); } } ////////////////////////////////////////////////////////////////////////// enum OutputMode_e { M_DEBUG, M_DUPLICATES, M_LAST, M_EXACT_OR_LONGEST, M_DEFAULT = M_EXACT_OR_LONGEST }; const char * dModeName[] = { "debug", "duplicates", "last" }; struct MapInfo_t { CSphString m_sWord; char m_sRules[3]; }; struct WordLess { inline bool IsLess ( const char * a, const char * b ) const { return strcoll ( a, b ) < 0; } }; typedef CSphOrderedHash < CSphVector, CSphString, CSphStrHashFunc, 100000, 13 > WordMap_t; static void EmitResult ( WordMap_t & tMap , const CSphString & sFrom, const CSphString & sTo, char cRuleA = 0, char cRuleB = 0 ) { if ( !tMap.Exists(sFrom) ) tMap.Add ( CSphVector(), sFrom ); MapInfo_t tInfo; tInfo.m_sWord = sTo; tInfo.m_sRules[0] = cRuleA; tInfo.m_sRules[1] = cRuleB; tInfo.m_sRules[2] = 0; tMap[sFrom].Add ( tInfo ); } int main ( int iArgs, char ** dArgs ) { OutputMode_e eMode = M_DEFAULT; bool bUseCustomCharset = false; CSphString sDict, sAffix, sLocale, sCharsetFile, sResult = "result.txt"; printf ( "spelldump, an ispell dictionary dumper\n\n" ); int i = 1; for ( ; i < iArgs; i++ ) { if ( !strcmp ( dArgs[i], "-c" ) ) { if ( ++i==iArgs ) break; bUseCustomCharset = true; sCharsetFile = dArgs[i]; } else if ( !strcmp ( dArgs[i], "-m" ) ) { if ( ++i==iArgs ) break; char * sMode = dArgs[i]; if ( !strcmp ( sMode, "debug" ) ) { eMode = M_DEBUG; continue; } if ( !strcmp ( sMode, "duplicates" ) ) { eMode = M_DUPLICATES; continue; } if ( !strcmp ( sMode, "last" ) ) { eMode = M_LAST; continue; } if ( !strcmp ( sMode, "default" ) ) { eMode = M_DEFAULT; continue; } printf ( "Unrecognized mode: %s\n", sMode ); return 1; } else break; } switch ( iArgs - i ) { case 4: sLocale = dArgs[i + 3]; case 3: sResult = dArgs[i + 2]; case 2: sAffix = dArgs[i + 1]; sDict = dArgs[i]; break; default: printf ( "Usage: spelldump [options] [result] [locale-name]\n\n" "Options:\n" "-c \tuse case convertion defined in \n" "-m \toutput (conflict resolution) mode:\n" "\t\tdefault - try to guess the best way to resolve a conflict\n" "\t\tlast - choose last entry\n" "\t\tdebug - dump all mappings (with rules)\n" "\t\tduplicates - dump duplicate mappings only (with rules)\n" ); if ( iArgs>1 ) { printf ( "\n" "Examples:\n" "spelldump en.dict en.aff\n" "spelldump ru.dict ru.aff ru.txt ru_RU.CP1251\n" "spelldump ru.dict ru.aff ru.txt .1251\n" ); } return 1; } printf ( "Loading dictionary...\n" ); CISpellDict Dict; if ( !Dict.Load ( sDict.cstr () ) ) sphDie ( "Error loading dictionary file '%s'\n", sDict.IsEmpty () ? "" : sDict.cstr () ); printf ( "Loading affix file...\n" ); CISpellAffix Affix ( sLocale.cstr (), bUseCustomCharset ? sCharsetFile.cstr () : NULL ); if ( !Affix.Load ( sAffix.cstr () ) ) sphDie ( "Error loading affix file '%s'\n", sAffix.IsEmpty () ? "" : sAffix.cstr () ); if ( sResult.IsEmpty () ) sphDie ( "No result file specified\n" ); FILE * pFile = fopen ( sResult.cstr (), "wt" ); if ( !pFile ) sphDie ( "Unable to open '%s' for writing\n", sResult.cstr () ); if ( eMode!=M_DEFAULT ) printf ( "Output mode: %s\n", dModeName[eMode] ); Dict.IterateStart (); WordMap_t tWordMap; const CISpellDict::CISpellDictWord * pWord = NULL; int nDone = 0; while ( ( pWord = Dict.IterateNext () )!=NULL ) { EmitResult ( tWordMap, pWord->m_sWord, pWord->m_sWord ); if ( ( ++nDone % 10 )==0 ) { printf ( "\rDictionary words processed: %d", nDone ); fflush ( stdout ); } if ( pWord->m_sFlags.IsEmpty() ) continue; CSphString sWord, sWordForCross; int iFlagLen = strlen ( pWord->m_sFlags.cstr () ); for ( int iFlag1 = 0; iFlag1 < iFlagLen; ++iFlag1 ) for ( int iRule1 = 0; iRule1 < Affix.GetNumRules (); ++iRule1 ) { CISpellAffixRule * pRule1 = Affix.GetRule ( iRule1 ); if ( pRule1->Flag()!=pWord->m_sFlags.cstr()[iFlag1] ) continue; sWord = pWord->m_sWord; if ( !pRule1->Apply ( sWord ) ) continue; EmitResult ( tWordMap, sWord, pWord->m_sWord, pRule1->Flag() ); // apply other rules if ( !Affix.CheckCrosses() ) continue; if ( !pRule1->IsCrossProduct() ) continue; for ( int iFlag2 = iFlag1 + 1; iFlag2 < iFlagLen; ++iFlag2 ) for ( int iRule2 = 0; iRule2 < Affix.GetNumRules (); ++iRule2 ) { CISpellAffixRule * pRule2 = Affix.GetRule ( iRule2 ); if ( !pRule2->IsCrossProduct () || pRule2->Flag()!=pWord->m_sFlags.cstr()[iFlag2] || pRule2->IsPrefix()==pRule1->IsPrefix() ) continue; sWordForCross = sWord; if ( pRule2->Apply ( sWordForCross ) ) EmitResult ( tWordMap, sWordForCross, pWord->m_sWord, pRule1->Flag(), pRule2->Flag() ); } } } printf ( "\rDictionary words processed: %d\n", nDone ); // output CSphVector dKeys; tWordMap.IterateStart(); while ( tWordMap.IterateNext() ) dKeys.Add ( tWordMap.IterateGetKey().cstr() ); dKeys.Sort ( WordLess() ); ARRAY_FOREACH ( iKey, dKeys ) { const CSphVector & dWords = tWordMap[dKeys[iKey]]; const char * sKey = dKeys[iKey]; switch ( eMode ) { case M_LAST: fprintf ( pFile, "%s > %s\n", sKey, dWords.Last().m_sWord.cstr() ); break; case M_EXACT_OR_LONGEST: { int iMatch = 0; int iLength = 0; ARRAY_FOREACH ( i, dWords ) { if ( dWords[i].m_sWord==sKey ) { iMatch = i; break; } int iWordLength = strlen ( dWords[i].m_sWord.cstr() ); if ( iWordLength>iLength ) { iLength = iWordLength; iMatch = i; } } fprintf ( pFile, "%s > %s\n", sKey, dWords[iMatch].m_sWord.cstr() ); break; } case M_DUPLICATES: if ( dWords.GetLength()==1 ) break; case M_DEBUG: ARRAY_FOREACH ( i, dWords ) fprintf ( pFile, "%s > %s %s/%d\n", sKey, dWords[i].m_sWord.cstr(), dWords[i].m_sRules, dWords.GetLength() ); break; } } fclose ( pFile ); return 0; } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinx.cpp100777 0 0 2355633 11643565732 13366 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxstem.h" #include "sphinxquery.h" #include "sphinxutils.h" #include "sphinxexpr.h" #include "sphinxfilter.h" #include "sphinxint.h" #include "sphinxsearch.h" #include #include #include #include #include #include #include #include #include #include #include #define SPH_UNPACK_BUFFER_SIZE 4096 #define SPH_READ_PROGRESS_CHUNK (8192*1024) #define SPH_READ_NOPROGRESS_CHUNK (32768*1024) #if USE_LIBSTEMMER #include "libstemmer.h" #endif #if USE_LIBEXPAT #define XMLIMPORT #include "expat.h" // workaround for expat versions prior to 1.95.7 #ifndef XMLCALL #define XMLCALL #endif #endif #if USE_LIBXML #include #endif #if USE_LIBICONV #include "iconv.h" #endif #if USE_ZLIB #include #endif #if USE_ODBC #include #endif #if USE_WINDOWS #include // for open() // workaround Windows quirks #define popen _popen #define pclose _pclose #define snprintf _snprintf #define sphSeek _lseeki64 #define stat _stat64 #define fstat _fstat64 #if _MSC_VER<1400 #define struct_stat __stat64 #else #define struct_stat struct _stat64 #endif #define ICONV_INBUF_CONST 1 #else #include #include #define sphSeek lseek #define struct_stat struct stat #endif #if ( USE_WINDOWS && USE_MYSQL ) #pragma comment(linker, "/defaultlib:libmysql.lib") #pragma message("Automatically linking with libmysql.lib") #endif #if ( USE_WINDOWS && USE_PGSQL ) #pragma comment(linker, "/defaultlib:libpq.lib") #pragma message("Automatically linking with libpq.lib") #endif #if ( USE_WINDOWS && USE_LIBSTEMMER ) #pragma comment(linker, "/defaultlib:libstemmer_c.lib") #pragma message("Automatically linking with libstemmer_c.lib") #endif #if ( USE_WINDOWS && USE_LIBEXPAT ) #pragma comment(linker, "/defaultlib:libexpat.lib") #pragma message("Automatically linking with libexpat.lib") #endif #if ( USE_WINDOWS && USE_LIBICONV ) #pragma comment(linker, "/defaultlib:iconv.lib") #pragma message("Automatically linking with iconv.lib") #endif #if ( USE_WINDOWS && USE_LIBXML ) #pragma comment(linker, "/defaultlib:libxml.lib") #pragma message("Automatically linking with libxml.lib") #endif #if ( USE_WINDOWS && USE_MMSEG ) #pragma comment(linker, "/defaultlib:libcss.lib") #pragma message("Automatically linking with libcss.lib") #endif ///////////////////////////////////////////////////////////////////////////// typedef Hitman_c<8> HITMAN; // logf() is not there sometimes (eg. Solaris 9) #if !USE_WINDOWS && !HAVE_LOGF static inline float logf ( float v ) { return (float) log ( v ); } #endif // forward decl void sphWarn ( const char * sTemplate, ... ) __attribute__ ( ( format ( printf, 1, 2 ) ) ); size_t sphReadThrottled ( int iFD, void * pBuf, size_t iCount ); static bool sphTruncate ( int iFD ); ///////////////////////////////////////////////////////////////////////////// // GLOBALS ///////////////////////////////////////////////////////////////////////////// const char * SPHINX_DEFAULT_SBCS_TABLE = "0..9, A..Z->a..z, _, a..z, U+A8->U+B8, U+B8, U+C0..U+DF->U+E0..U+FF, U+E0..U+FF"; const char * SPHINX_DEFAULT_UTF8_TABLE = "0..9, A..Z->a..z, _, a..z, U+410..U+42F->U+430..U+44F, U+430..U+44F"; const char * MAGIC_WORD_SENTENCE = "\3sentence"; // emitted from source on sentence boundary, stored in dictionary const char * MAGIC_WORD_PARAGRAPH = "\3paragraph"; // emitted from source on paragraph boundary, stored in dictionary static const int DEFAULT_READ_BUFFER = 262144; static const int DEFAULT_READ_UNHINTED = 32768; static const int MIN_READ_BUFFER = 8192; static const int MIN_READ_UNHINTED = 1024; static bool g_bSphQuiet = false; static int g_iReadBuffer = DEFAULT_READ_BUFFER; static int g_iReadUnhinted = DEFAULT_READ_UNHINTED; // quick hack for indexer crash reporting // one day, these might turn into a callback or something int64_t g_iIndexerCurrentDocID = 0; int64_t g_iIndexerCurrentHits = 0; int64_t g_iIndexerCurrentRangeMin = 0; int64_t g_iIndexerCurrentRangeMax = 0; int64_t g_iIndexerPoolStartDocID = 0; int64_t g_iIndexerPoolStartHit = 0; ///////////////////////////////////////////////////////////////////////////// // COMPILE-TIME CHECKS ///////////////////////////////////////////////////////////////////////////// STATIC_SIZE_ASSERT ( SphOffset_t, 8 ); ///////////////////////////////////////////////////////////////////////////// // INTERNAL PROFILER ///////////////////////////////////////////////////////////////////////////// #define SPH_INTERNAL_PROFILER 0 #if SPH_INTERNAL_PROFILER enum ESphTimer { TIMER_root = 0, #define DECLARE_TIMER(_arg) TIMER_##_arg, #include "sphinxtimers.h" #undef DECLARE_TIMER TIMERS_TOTAL }; static const char * const g_dTimerNames [ TIMERS_TOTAL ] = { "root", #define DECLARE_TIMER(_arg) #_arg, #include "sphinxtimers.h" // NOLINT #undef DECLARE_TIMER }; struct CSphTimer { int64_t m_iMicroSec; ///< time as clocked raw int m_iCalls; ///< number of times this timer was called int m_iChildrenCalls; ///< number of times all subtimers (children, grandchildren etc) of this timer were called int64_t m_iMicroSecAdj; ///< guessed (!) time after timer costs adjustment, including subtimer costs int64_t m_iMicroSecSelf; ///< guessed (!) self time ESphTimer m_eTimer; int m_iParent; int m_iChild; int m_iNext; int m_iPrev; CSphTimer () { Alloc ( TIMER_root, -1 ); } void Alloc ( ESphTimer eTimer, int iParent ) { m_iParent = iParent; m_iChild = -1; m_iNext = -1; m_iPrev = -1; m_eTimer = eTimer; m_iMicroSec = 0; m_iMicroSecAdj = 0; m_iCalls = 0; m_iChildrenCalls = 0; } void Start () { m_iMicroSec -= sphMicroTimer (); m_iCalls++; } void Stop () { m_iMicroSec += sphMicroTimer (); } }; static const int SPH_MAX_TIMERS = 128; static const int SPH_TIMER_TRIALS = 16384; static int g_iTimer = -1; static int g_iTimers = 0; static CSphTimer g_dTimers [ SPH_MAX_TIMERS ]; static int64_t g_iTimerTrialsWall = 0; void sphProfilerInit () { assert ( g_iTimers==0 ); assert ( g_iTimer==-1 ); // start root timer g_iTimers = 1; g_iTimer = 0; g_dTimers[g_iTimer].Alloc ( TIMER_root, -1 ); g_dTimers[g_iTimer].Start (); } void sphProfilerPush ( ESphTimer eTimer ) { assert ( g_iTimer>=0 && g_iTimer0; iTimer=g_dTimers[iTimer].m_iNext ) { if ( g_dTimers[iTimer].m_eTimer==eTimer ) break; } // not found? let's alloc if ( iTimer<0 ) { assert ( g_iTimers=0 ) g_dTimers [ g_dTimers[g_iTimer].m_iChild ].m_iPrev = iTimer; g_dTimers[g_iTimer].m_iChild = iTimer; } // make it new current one assert ( iTimer>0 ); g_dTimers[iTimer].Start (); g_iTimer = iTimer; } void sphProfilerPop ( ESphTimer eTimer ) { assert ( g_iTimer>0 && g_iTimer=0 && g_iTimer0; iChild=g_dTimers[iChild].m_iNext ) { sphProfilerAdjust ( iChild ); tTimer.m_iChildrenCalls += g_dTimers[iChild].m_iCalls + g_dTimers[iChild].m_iChildrenCalls; } // adjust my raw time, remove all the timer costs from it // my own costs are 1x sphMicroTimer() call per start/stop cycle // subtimer costs are 2x sphMicroTimer() calls per start/stop cycle tTimer.m_iMicroSecAdj = tTimer.m_iMicroSec - ( ( tTimer.m_iCalls + 2*tTimer.m_iChildrenCalls )*g_iTimerTrialsWall / SPH_TIMER_TRIALS ); // now calculate self time // as adjusted time (all subtimer costs removed) minus all subtimer self time tTimer.m_iMicroSecSelf = tTimer.m_iMicroSecAdj; for ( int iChild=tTimer.m_iChild; iChild>0; iChild=g_dTimers[iChild].m_iNext ) tTimer.m_iMicroSecSelf -= g_dTimers[iChild].m_iMicroSecSelf; } void sphProfilerDone () { assert ( g_iTimers>0 ); assert ( g_iTimer==0 ); // stop root timer g_iTimers = 0; g_iTimer = -1; g_dTimers[0].Stop (); // bench adjustments for ( int iRun=0; iRun<3; iRun++ ) { int64_t iTrial = sphMicroTimer(); for ( int i=0; i0 && g_dTimers[iChild].m_iNext>0 ) iChild = g_dTimers[iChild].m_iNext; while ( iChild>0 ) { sphProfilerShow ( iChild, 1+iLevel ); iChild = g_dTimers[iChild].m_iPrev; } if ( iTimer==0 ) fprintf ( stdout, "---------------\n" ); } class CSphEasyTimer { public: explicit CSphEasyTimer ( ESphTimer eTimer ) : m_eTimer ( eTimer ) { if ( g_iTimer>=0 ) sphProfilerPush ( m_eTimer ); } ~CSphEasyTimer () { if ( g_iTimer>=0 ) sphProfilerPop ( m_eTimer ); } protected: ESphTimer m_eTimer; }; #define PROFILER_INIT() sphProfilerInit() #define PROFILER_DONE() sphProfilerDone() #define PROFILE_BEGIN(_arg) sphProfilerPush(TIMER_##_arg) #define PROFILE_END(_arg) sphProfilerPop(TIMER_##_arg) #define PROFILE_SHOW() sphProfilerShow() #define PROFILE(_arg) CSphEasyTimer __t_##_arg ( TIMER_##_arg ); #else #define PROFILER_INIT() #define PROFILER_DONE() #define PROFILE_BEGIN(_arg) #define PROFILE_END(_arg) #define PROFILE_SHOW() #define PROFILE(_arg) #endif // SPH_INTERNAL_PROFILER ///////////////////////////////////////////////////////////////////////////// #if !USE_WINDOWS bool g_bHeadProcess = true; void sphSetProcessInfo ( bool bHead ) { g_bHeadProcess = bHead; } #endif // USE_WINDOWS static bool g_bIOStats = false; static CSphIOStats g_IOStats; void sphStartIOStats () { g_bIOStats = true; memset ( &g_IOStats, 0, sizeof ( g_IOStats ) ); } const CSphIOStats & sphStopIOStats () { g_bIOStats = false; return g_IOStats; } static size_t sphRead ( int iFD, void * pBuf, size_t iCount ) { int64_t tmStart = 0; if ( g_bIOStats ) tmStart = sphMicroTimer(); size_t uRead = (size_t) ::read ( iFD, pBuf, iCount ); if ( g_bIOStats ) { g_IOStats.m_iReadTime += sphMicroTimer() - tmStart; g_IOStats.m_iReadOps++; g_IOStats.m_iReadBytes += iCount; } return uRead; } static void GetFileStats ( const char * szFilename, CSphSavedFile & tInfo ); ///////////////////////////////////////////////////////////////////////////// // INTERNAL SPHINX CLASSES DECLARATIONS ///////////////////////////////////////////////////////////////////////////// CSphAutofile::CSphAutofile () : m_iFD ( -1 ) , m_bTemporary ( false ) , m_pProgress ( NULL ) , m_pStat ( NULL ) { } CSphAutofile::CSphAutofile ( const CSphString & sName, int iMode, CSphString & sError, bool bTemp ) : m_iFD ( -1 ) , m_bTemporary ( false ) , m_pProgress ( NULL ) , m_pStat ( NULL ) { Open ( sName, iMode, sError, bTemp ); } CSphAutofile::~CSphAutofile () { Close (); } int CSphAutofile::Open ( const CSphString & sName, int iMode, CSphString & sError, bool bTemp ) { assert ( m_iFD==-1 && m_sFilename.IsEmpty () ); assert ( !sName.IsEmpty() ); m_iFD = ::open ( sName.cstr(), iMode, 0644 ); m_sFilename = sName; // not exactly sure why is this uncoditional. for error reporting later, i suppose if ( m_iFD<0 ) sError.SetSprintf ( "failed to open %s: %s", sName.cstr(), strerror(errno) ); else m_bTemporary = bTemp; // only if we managed to actually open it return m_iFD; } void CSphAutofile::Close () { if ( m_iFD>=0 ) { ::close ( m_iFD ); if ( m_bTemporary ) ::unlink ( m_sFilename.cstr() ); } m_iFD = -1; m_sFilename = ""; m_bTemporary = false; } const char * CSphAutofile::GetFilename () const { assert ( m_sFilename.cstr() ); return m_sFilename.cstr(); } SphOffset_t CSphAutofile::GetSize ( SphOffset_t iMinSize, bool bCheckSizeT, CSphString & sError ) { struct_stat st; if ( stat ( GetFilename(), &st )<0 ) { sError.SetSprintf ( "failed to stat %s: %s", GetFilename(), strerror(errno) ); return -1; } if ( st.st_size0 ) { int64_t iToReadOnce = ( m_pProgress && m_pStat ) ? Min ( SPH_READ_PROGRESS_CHUNK, iToRead ) : Min ( SPH_READ_NOPROGRESS_CHUNK, iToRead ); int64_t iGot = (int64_t) sphRead ( GetFD(), pCur, (size_t)iToReadOnce ); if ( iGot<=0 ) break; iToRead -= iGot; pCur += iGot; if ( m_pProgress && m_pStat ) { m_pStat->m_iBytes += iGot; m_pProgress ( m_pStat, false ); } } if ( iToRead!=0 ) { sError.SetSprintf ( "read error in %s; "INT64_FMT" of "INT64_FMT" bytes read", GetFilename(), iCount-iToRead, iCount ); return false; } return true; } void CSphAutofile::SetProgressCallback ( CSphIndex::ProgressCallback_t * pfnProgress, CSphIndexProgress * pStat ) { m_pProgress = pfnProgress; m_pStat = pStat; } ///////////////////////////////////////////////////////////////////////////// /// array pointer which self-destructs when going out of scope, or on demand template < typename T > class CSphAutoArray { protected: T * m_pData; #ifndef NDEBUG size_t m_iLength; // for pretty-printers to work #endif public: explicit CSphAutoArray ( int iCount ) #ifndef NDEBUG : m_iLength ( iCount ) #endif { m_pData = ( iCount>0 ) ? new T [ iCount ] : NULL; } ~CSphAutoArray () { Reset (); } void Reset () { SafeDeleteArray ( m_pData ); } const CSphAutoArray & operator = ( const CSphAutoArray & ) { assert(0); return *this; } operator T * () { return m_pData; } }; ///////////////////////////////////////////////////////////////////////////// /// generic stateless priority queue template < typename T, typename COMP > class CSphQueue { protected: T * m_pData; int m_iUsed; int m_iSize; public: /// ctor explicit CSphQueue ( int iSize ) : m_iUsed ( 0 ) , m_iSize ( iSize ) { assert ( iSize>0 ); m_pData = new T [ iSize ]; assert ( m_pData ); } /// dtor virtual ~CSphQueue () { SafeDeleteArray ( m_pData ); } /// add entry to the queue virtual bool Push ( const T & tEntry ) { if ( m_iUsed==m_iSize ) { // if it's worse that current min, reject it, else pop off current min if ( COMP::IsLess ( tEntry, m_pData[0] ) ) return true; else Pop (); } // do add m_pData [ m_iUsed ] = tEntry; int iEntry = m_iUsed++; // sift up if needed, so that worst (lesser) ones float to the top while ( iEntry ) { int iParent = ( iEntry-1 ) >> 1; if ( !COMP::IsLess ( m_pData[iEntry], m_pData[iParent] ) ) break; // entry is less than parent, should float to the top Swap ( m_pData[iEntry], m_pData[iParent] ); iEntry = iParent; } return true; } /// remove root (ie. top priority) entry virtual void Pop () { assert ( m_iUsed ); if ( !(--m_iUsed) ) // empty queue? just return return; // make the last entry my new root m_pData[0] = m_pData[m_iUsed]; // sift down if needed int iEntry = 0; for ( ;; ) { // select child int iChild = (iEntry<<1) + 1; if ( iChild>=m_iUsed ) break; // select smallest child if ( iChild+10 ) m_pDictBuf = new BYTE [iDictBufSize]; } virtual ~DiskIndexQwordSetup_c() { SafeDeleteArray ( m_pDictBuf ); } virtual ISphQword * QwordSpawn ( const XQKeyword_t & tWord ) const; virtual bool QwordSetup ( ISphQword * ) const; protected: template < class T > bool Setup ( ISphQword * ) const; }; #if USE_WINDOWS #pragma warning(disable:4127) // conditional expr is const for MSVC #endif /// query word from the searcher's point of view class DiskIndexQwordTraits_c : public ISphQword { static const int MINIBUFFER_LEN = 1024; public: SphOffset_t m_uHitPosition; Hitpos_t m_uInlinedHit; DWORD m_uHitState; bool m_bDupe; ///< whether the word occurs only once in current query CSphMatch m_tDoc; ///< current match (partial) Hitpos_t m_iHitPos; ///< current hit postition, from hitlist BYTE m_dDoclistBuf [ MINIBUFFER_LEN ]; BYTE m_dHitlistBuf [ MINIBUFFER_LEN ]; CSphReader m_rdDoclist; ///< my doclist reader CSphReader m_rdHitlist; ///< my hitlist reader SphDocID_t m_iMinID; ///< min ID to fixup int m_iInlineAttrs; ///< inline attributes count CSphRowitem * m_pInlineFixup; ///< inline attributes fixup (POINTER TO EXTERNAL DATA, NOT MANAGED BY THIS CLASS!) #ifndef NDEBUG bool m_bHitlistOver; #endif public: explicit DiskIndexQwordTraits_c ( bool bUseMini, bool bExcluded ) : m_uHitPosition ( 0 ) , m_uHitState ( 0 ) , m_bDupe ( false ) , m_iHitPos () , m_rdDoclist ( bUseMini ? m_dDoclistBuf : NULL, bUseMini ? MINIBUFFER_LEN : 0 ) , m_rdHitlist ( bUseMini ? m_dHitlistBuf : NULL, bUseMini ? MINIBUFFER_LEN : 0 ) , m_iMinID ( 0 ) , m_iInlineAttrs ( 0 ) , m_pInlineFixup ( NULL ) #ifndef NDEBUG , m_bHitlistOver ( true ) #endif { m_iHitPos = EMPTY_HIT; m_bExcluded = bExcluded; } }; /// query word from the searcher's point of view template < bool INLINE_HITS, bool INLINE_DOCINFO, bool DISABLE_HITLIST_SEEK > class DiskIndexQword_c : public DiskIndexQwordTraits_c { public: explicit DiskIndexQword_c ( bool bUseMinibuffer, bool bExcluded ) : DiskIndexQwordTraits_c ( bUseMinibuffer, bExcluded ) { } virtual void Reset () { m_uHitPosition = 0; m_uHitState = 0; m_rdDoclist.Reset (); m_rdHitlist.Reset (); ISphQword::Reset(); m_iHitPos = EMPTY_HIT; m_iInlineAttrs = 0; } void GetHitlistEntry () { assert ( !m_bHitlistOver ); DWORD iDelta = m_rdHitlist.UnzipInt (); if ( iDelta ) { m_iHitPos += iDelta; } else { m_iHitPos = EMPTY_HIT; #ifndef NDEBUG m_bHitlistOver = true; #endif } } virtual void CollectHitMask() { SeekHitlist ( m_iHitlistPos ); for ( Hitpos_t uHit = GetNextHit(); uHit!=EMPTY_HIT; uHit = GetNextHit() ) m_dFields.Set ( HITMAN::GetField ( uHit ) ); m_bAllFieldsKnown = true; } virtual const CSphMatch & GetNextDoc ( DWORD * pDocinfo ) { SphDocID_t iDelta = m_rdDoclist.UnzipDocid(); if ( iDelta ) { m_bAllFieldsKnown = false; m_tDoc.m_iDocID += iDelta; if ( INLINE_DOCINFO ) { assert ( pDocinfo ); for ( int i=0; i> 1 ); m_bAllFieldsKnown = true; } else { m_dFields.Assign32 ( uFirst ); m_uHitPosition += m_rdDoclist.UnzipOffset(); m_iHitlistPos = m_uHitPosition; } } else { SphOffset_t iDeltaPos = m_rdDoclist.UnzipOffset(); assert ( iDeltaPos>=0 ); m_iHitlistPos += iDeltaPos; m_dFields.Assign32 ( m_rdDoclist.UnzipInt() ); m_uMatchHits = m_rdDoclist.UnzipInt(); } } else { m_tDoc.m_iDocID = 0; } return m_tDoc; } virtual void SeekHitlist ( SphOffset_t uOff ) { if ( uOff >> 63 ) { m_uHitState = 1; m_uInlinedHit = (DWORD)uOff; // truncate high dword } else { m_uHitState = 0; m_iHitPos = EMPTY_HIT; if ( DISABLE_HITLIST_SEEK ) assert ( m_rdHitlist.GetPos()==uOff ); // make sure we're where caller thinks we are. else m_rdHitlist.SeekTo ( uOff, READ_NO_SIZE_HINT ); } #ifndef NDEBUG m_bHitlistOver = false; #endif } virtual Hitpos_t GetNextHit () { assert ( m_bHasHitlist ); switch ( m_uHitState ) { case 0: // read hit from hitlist GetHitlistEntry (); return m_iHitPos; case 1: // return inlined hit m_uHitState = 2; return m_uInlinedHit; case 2: // return end-of-hitlist marker after inlined hit #ifndef NDEBUG m_bHitlistOver = true; #endif m_uHitState = 0; return EMPTY_HIT; } sphDie ( "INTERNAL ERROR: impossible hit emitter state" ); return EMPTY_HIT; } }; #if USE_WINDOWS #pragma warning(default:4127) // conditional expr is const for MSVC #endif ////////////////////////////////////////////////////////////////////////////// #define WITH_QWORD(INDEX, NO_SEEK, NAME, ACTION) \ { \ CSphIndex_VLN * pIndex = (CSphIndex_VLN *)INDEX; \ DWORD uInlineHits = pIndex->m_tSettings.m_eHitFormat==SPH_HIT_FORMAT_INLINE; \ DWORD uInlineDocinfo = pIndex->m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE; \ \ switch ( ( uInlineHits<<1 ) | uInlineDocinfo ) \ { \ case 0: { typedef DiskIndexQword_c < false, false, NO_SEEK > NAME; ACTION; break; } \ case 1: { typedef DiskIndexQword_c < false, true, NO_SEEK > NAME; ACTION; break; } \ case 2: { typedef DiskIndexQword_c < true, false, NO_SEEK > NAME; ACTION; break; } \ case 3: { typedef DiskIndexQword_c < true, true, NO_SEEK > NAME; ACTION; break; } \ default: \ sphDie ( "INTERNAL ERROR: impossible qword settings" ); \ } \ } ///////////////////////////////////////////////////////////////////////////// struct CSphWordlistCheckpoint { union { SphWordID_t m_iWordID; const char * m_sWord; }; SphOffset_t m_iWordlistOffset; int Cmp ( const char * sWord, int iLen, SphWordID_t iWordID, bool bWordDict ) const; int CmpStrictly ( const char * sWord, int iLen, SphWordID_t iWordID, bool bWordDict ) const; }; // pre-v11 wordlist checkpoint struct CSphWordlistCheckpoint_v10 { SphWordID_t m_iWordID; DWORD m_iWordlistOffset; }; ///////////////////////////////////////////////////////////////////////////// /// ordinals accumulation and sorting struct Ordinal_t { SphDocID_t m_uDocID; ///< doc id CSphString m_sValue; ///< string value }; struct OrdinalEntry_t : public Ordinal_t { int m_iTag; }; struct OrdinalId_t { SphDocID_t m_uDocID; DWORD m_uId; }; struct OrdinalIdEntry_t : public OrdinalId_t { int m_iTag; }; void Swap ( Ordinal_t & a, Ordinal_t & b ) { Swap ( a.m_uDocID, b.m_uDocID ); Swap ( a.m_sValue, b.m_sValue ); } void Swap ( OrdinalEntry_t & a, OrdinalEntry_t & b ) { Swap ( a.m_uDocID, b.m_uDocID ); Swap ( a.m_sValue, b.m_sValue ); Swap ( a.m_iTag, b.m_iTag ); } ////////////////////////////////////////////////////////////////////////// static void ReadFileInfo ( CSphReader & tReader, const char * szFilename, CSphString & sWarning ) { SphOffset_t uSize = tReader.GetOffset (); SphOffset_t uCTime = tReader.GetOffset (); SphOffset_t uMTime = tReader.GetOffset (); DWORD uCRC32 = tReader.GetDword (); if ( szFilename && *szFilename ) { struct_stat tFileInfo; if ( stat ( szFilename, &tFileInfo ) < 0 ) sWarning.SetSprintf ( "failed to stat %s: %s", szFilename, strerror(errno) ); else { DWORD uMyCRC32 = 0; if ( !sphCalcFileCRC32 ( szFilename, uMyCRC32 ) ) sWarning.SetSprintf ( "failed to calculate CRC32 for %s", szFilename ); else if ( uMyCRC32!=uCRC32 || tFileInfo.st_size!=uSize || tFileInfo.st_ctime!=uCTime || tFileInfo.st_mtime!=uMTime ) sWarning.SetSprintf ( "'%s' differs from the original", szFilename ); } } } static void WriteFileInfo ( CSphWriter & tWriter, const CSphSavedFile & tInfo ) { tWriter.PutOffset ( tInfo.m_uSize ); tWriter.PutOffset ( tInfo.m_uCTime ); tWriter.PutOffset ( tInfo.m_uMTime ); tWriter.PutDword ( tInfo.m_uCRC32 ); } static ISphBinlog * g_pBinlog; struct WordDictInfo_t { CSphString m_sWord; SphOffset_t m_uOff; int m_iDocs; int m_iHits; int m_iDoclistHint; WordDictInfo_t (); }; struct WordReaderContext_t { BYTE m_sWord [ MAX_KEYWORD_BYTES ]; int m_iLen; WordReaderContext_t(); }; // !COMMIT eliminate this, move it to proper dict impls class CWordlist { public: int64_t m_iCheckpointsPos; ///< checkpoints offset CSphFixedVector m_dCheckpoints; ///< checkpoint offsets CSphAutofile m_tFile; ///< file int64_t m_iSize; ///< file size CSphSharedBuffer m_pBuf; ///< my cache int m_iMaxChunk; ///< max size of entry between checkpoints BYTE * m_pWords; ///< arena for checkpoint's words public: CWordlist (); ~CWordlist (); void Reset (); bool ReadCP ( CSphAutofile & tFile, DWORD uVer, bool bWordDict, CSphString & sError ); const CSphWordlistCheckpoint * FindCheckpoint ( const char * sWord, int iWordLen, SphWordID_t iWordID, bool bStarMode ) const; const BYTE * GetWord ( const BYTE * pBuf, const char * pStr, int iLen, WordDictInfo_t & tWord, bool bStarMode, WordReaderContext_t & tCtx ) const; bool GetWord ( const BYTE * pBuf, SphWordID_t iWordID, WordDictInfo_t & tWord ) const; const BYTE * AcquireDict ( const CSphWordlistCheckpoint * pCheckpoint, int iFD, BYTE * pDictBuf ) const; void GetPrefixedWords ( const char * sWord, int iWordLen, CSphVector & dPrefixedWords, BYTE * pDictBuf, int iFD ) const; private: bool m_bWordDict; }; const int WORDLIST_CHECKPOINT = 64; ///< wordlist checkpoints frequency /// this is my actual VLN-compressed phrase index implementation class CSphIndex_VLN : public ISphIndex_VLN { friend class DiskIndexQwordSetup_c; friend class CSphMerger; friend class AttrIndexBuilder_t; public: explicit CSphIndex_VLN ( const char* sIndexName, const char * sFilename ); ~CSphIndex_VLN (); virtual int Build ( const CSphVector & dSources, int iMemoryLimit, int iWriteBuffer ); virtual bool LoadHeader ( const char * sHeaderName, bool bStripPath, CSphString & sWarning ); virtual bool WriteHeader ( CSphWriter & fdInfo, SphOffset_t iCheckpointsPos, DWORD iCheckpointCount ); virtual void DebugDumpHeader ( FILE * fp, const char * sHeaderName, bool bConfig ); virtual void DebugDumpDocids ( FILE * fp ); virtual void DebugDumpHitlist ( FILE * fp, const char * sKeyword, bool bID ); virtual int DebugCheck ( FILE * fp ); template void DumpHitlist ( FILE * fp, const char * sKeyword, bool bID ); virtual bool Prealloc ( bool bMlock, bool bStripPath, CSphString & sWarning ); virtual bool Mlock (); virtual void Dealloc (); virtual bool Preread (); template bool PrereadSharedBuffer ( CSphSharedBuffer & pBuffer, const char * sExt, size_t uExpected=0, DWORD uOffset=0 ); virtual void SetBase ( const char * sNewBase ); virtual bool Rename ( const char * sNewBase ); virtual bool Lock (); virtual void Unlock (); virtual void PostSetup() {} virtual bool MultiQuery ( const CSphQuery * pQuery, CSphQueryResult * pResult, int iSorters, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag ) const; virtual bool MultiQueryEx ( int iQueries, const CSphQuery * pQueries, CSphQueryResult ** ppResults, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag ) const; virtual bool GetKeywords ( CSphVector & dKeywords, const char * szQuery, bool bGetStats, CSphString & sError ) const; template bool DoGetKeywords ( CSphVector & dKeywords, const char * szQuery, bool bGetStats, CSphString & sError ) const; virtual bool Merge ( CSphIndex * pSource, CSphVector & dFilters, bool bMergeKillLists ); template bool MergeWords ( CSphIndex_VLN * pSrcIndex, ISphFilter * pFilter ); virtual int UpdateAttributes ( const CSphAttrUpdate & tUpd, int iIndex, CSphString & sError ); virtual bool SaveAttributes (); virtual DWORD GetAttributeStatus () const; bool EarlyReject ( CSphQueryContext * pCtx, CSphMatch & tMatch ) const; virtual SphAttr_t * GetKillList () const; virtual int GetKillListSize () const { return m_iKillListSize; } virtual bool HasDocid ( SphDocID_t uDocid ) const; virtual const CSphSourceStats & GetStats () const { return m_tStats; } virtual void SetDynamize ( const CSphVector & dDynamize ); private: static const int MIN_WRITE_BUFFER = 262144; ///< min write buffer size static const int DEFAULT_WRITE_BUFFER = 1048576; ///< default write buffer size static const DWORD INDEX_MAGIC_HEADER = 0x58485053; ///< my magic 'SPHX' header static const DWORD INDEX_FORMAT_VERSION = 26; ///< my format version private: // common stuff CSphString m_sFilename; int m_iLockFD; CSphMatch * m_pMin; ///< min attribute values tracker CSphSourceStats m_tStats; ///< my stats SphDocID_t m_iMergeInfinum; ///< minimal docid-1 for merging private: // indexing-only BYTE * m_pWriteBuffer; ///< my write buffer (for temp files) int m_iWriteBuffer; ///< my write buffer size bool m_bWordDict; bool m_bMerging; CSphAggregateHit m_tLastHit; ///< hitlist entry BYTE m_sLastKeyword [ MAX_KEYWORD_BYTES ]; SphOffset_t m_iLastHitlistPos; ///< doclist entry SphOffset_t m_iLastHitlistDelta; ///< doclist entry CSphSmallBitvec m_dLastDocFields; ///< doclist entry DWORD m_uLastDocHits; ///< doclist entry SphOffset_t m_iLastWordDoclist; ///< wordlist entry int m_iLastWordDocs; ///< wordlist entry int m_iLastWordHits; ///< wordlist entry CSphWriter m_wrDoclist; ///< wordlist writer CSphWriter m_wrHitlist; ///< hitlist writer CSphIndexProgress m_tProgress; CSphVector m_dHitlessWords; bool LoadHitlessWords (); private: // searching-only, per-index static const int DOCINFO_HASH_BITS = 18; // FIXME! make this configurable CSphSharedBuffer m_pDocinfo; ///< my docinfo cache DWORD m_uDocinfo; ///< my docinfo cache size CSphSharedBuffer m_pDocinfoHash; ///< hashed ids, to accelerate lookups DWORD m_uDocinfoIndex; ///< docinfo "index" entries count (each entry is 2x docinfo rows, for min/max) DWORD * m_pDocinfoIndex; ///< docinfo "index", to accelerate filtering during full-scan (2x rows for each block, and 2x rows for the whole index, 1+m_uDocinfoIndex entries) CSphSharedBuffer m_pMva; ///< my multi-valued attrs cache CSphSharedBuffer m_pStrings; ///< my in-RAM strings cache CWordlist m_tWordlist; ///< my wordlist CSphSharedBuffer m_pKillList; ///< killlist DWORD m_iKillListSize; ///< killlist size (in elements) DWORD m_uMinMaxIndex; ///< stored min/max cache offset (counted in DWORDs) CSphAutofile m_tDoclistFile; ///< doclist file CSphAutofile m_tHitlistFile; ///< hitlist file #define SPH_SHARED_VARS_COUNT 2 DWORD * m_pPreread; DWORD * m_pAttrsStatus; CSphSharedBuffer m_dShared; ///< are we ready to search bool m_bPreallocated; ///< are we ready to preread DWORD m_uVersion; ///< data files version bool m_bUse64; ///< whether the header is id64 int m_iIndexTag; ///< my ids for MVA updates pool static int m_iIndexTagSeq; ///< static ids sequence int64_t m_iTID; ///< number of times when SaveAttributes called. bool m_bIsEmpty; ///< do we have actually indexed documents (m_iTotalDocuments is just fetched documents, not indexed!) CSphVector m_dDynamize; ///< string attributes that my parent RT index wants dynamized private: CSphString GetIndexFileName ( const char * sExt ) const; int cidxWriteRawVLB ( int fd, CSphWordHit * pHit, int iHits, DWORD * pDocinfo, int Docinfos, int iStride ); void cidxFinishDoclistEntry ( Hitpos_t uLastPos ); void cidxHit ( CSphAggregateHit * pHit, CSphRowitem * pDocinfos ); bool cidxDone ( const char * sHeaderExtension, int iMemLimit ); void WriteSchemaColumn ( CSphWriter & fdInfo, const CSphColumnInfo & tCol ); void ReadSchemaColumn ( CSphReader & rdInfo, CSphColumnInfo & tCol ); bool ParsedMultiQuery ( const CSphQuery * pQuery, CSphQueryResult * pResult, int iSorters, ISphMatchSorter ** ppSorters, const XQQuery_t & tXQ, CSphDict * pDict, const CSphVector * pExtraFilters, CSphQueryNodeCache * pNodeCache, int iTag ) const; bool MultiScan ( const CSphQuery * pQuery, CSphQueryResult * pResult, int iSorters, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag ) const; bool MatchExtended ( CSphQueryContext * pCtx, const CSphQuery * pQuery, int iSorters, ISphMatchSorter ** ppSorters, ISphRanker * pRanker, int iTag ) const; const DWORD * FindDocinfo ( SphDocID_t uDocID ) const; void CopyDocinfo ( CSphQueryContext * pCtx, CSphMatch & tMatch, const DWORD * pFound ) const; bool BuildMVA ( const CSphVector & dSources, CSphAutoArray & dHits, int iArenaSize, int iFieldFD, int nFieldMVAs, int iFieldMVAInPool ); CSphDict * SetupStarDict ( CSphScopedPtr & tContainer, CSphDict * pPrevDict, ISphTokenizer & tTokenizer ) const; CSphDict * SetupExactDict ( CSphScopedPtr & tContainer, CSphDict * pPrevDict, ISphTokenizer & tTokenizer ) const; void LoadSettings ( CSphReader & tReader ); void SaveSettings ( CSphWriter & tWriter ); bool RelocateBlock ( int iFile, BYTE * pBuffer, int iRelocationSize, SphOffset_t * pFileSize, CSphBin * pMinBin, SphOffset_t * pSharedOffset ); bool PrecomputeMinMax(); private: static const int MAX_ORDINAL_STR_LEN = 4096; ///< maximum ordinal string length in bytes static const int ORDINAL_READ_SIZE = 262144; ///< sorted ordinal id read buffer size in bytes ESphBinRead ReadOrdinal ( CSphBin & Reader, Ordinal_t & Ordinal ); SphOffset_t DumpOrdinals ( CSphWriter & Writer, CSphVector & dOrdinals ); bool SortOrdinals ( const char * szToFile, int iFromFD, int iArenaSize, int iOrdinalsInPool, CSphVector< CSphVector > & dOrdBlockSize, bool bWarnOfMem ); bool SortOrdinalIds ( const char * szToFile, int iFromFD, int iArenaSize, CSphVector < CSphVector < SphOffset_t > > & dOrdBlockSize, bool bWarnOfMem ); const DWORD * GetMVAPool () const { return m_pMva.GetWritePtr(); } bool LoadPersistentMVA ( CSphString & sError ); bool JuggleFile ( const char* szExt, bool bNeedOrigin=true ); XQNode_t * DoExpansion ( XQNode_t * pNode, BYTE * pBuff, int iFD, CSphQueryResultMeta * pResult ) const; XQNode_t * ExpandPrefix ( XQNode_t * pNode, CSphString & sError, CSphQueryResultMeta * pResult ) const; }; int CSphIndex_VLN::m_iIndexTagSeq = 0; ///////////////////////////////////////////////////////////////////////////// // UTILITY FUNCTIONS ///////////////////////////////////////////////////////////////////////////// /// indexer warning void sphWarn ( const char * sTemplate, ... ) { va_list ap; va_start ( ap, sTemplate ); fprintf ( stdout, "WARNING: " ); vfprintf ( stdout, sTemplate, ap ); fprintf ( stdout, "\n" ); va_end ( ap ); } ////////////////////////////////////////////////////////////////////////// /// microsecond precision timestamp int64_t sphMicroTimer() { #if USE_WINDOWS // Windows time query static int64_t iBase = 0; static int64_t iStart = 0; static int64_t iFreq = 0; LARGE_INTEGER iLarge; if ( !iBase ) { // get start QPC value QueryPerformanceFrequency ( &iLarge ); iFreq = iLarge.QuadPart; QueryPerformanceCounter ( &iLarge ); iStart = iLarge.QuadPart; // get start UTC timestamp // assuming it's still approximately the same moment as iStart, give or take a msec or three FILETIME ft; GetSystemTimeAsFileTime ( &ft ); iBase = ( int64_t(ft.dwHighDateTime)<<32 ) + int64_t(ft.dwLowDateTime); iBase = ( iBase - 116444736000000000ULL ) / 10; // rebase from 01 Jan 1601 to 01 Jan 1970, and rescale to 1 usec from 100 ns } // we can't easily drag iBase into parens because iBase*iFreq/1000000 overflows 64bit int! QueryPerformanceCounter ( &iLarge ); return iBase + ( iLarge.QuadPart - iStart )*1000000/iFreq; #else // UNIX time query struct timeval tv; gettimeofday ( &tv, NULL ); return int64_t(tv.tv_sec)*int64_t(1000000) + int64_t(tv.tv_usec); #endif // USE_WINDOWS } ////////////////////////////////////////////////////////////////////////// static int g_iMaxIOps = 0; static int g_iMaxIOSize = 0; static int64_t g_tmLastIOTime = 0; void sphSetThrottling ( int iMaxIOps, int iMaxIOSize ) { g_iMaxIOps = iMaxIOps; g_iMaxIOSize = iMaxIOSize; } static inline void sphThrottleSleep () { if ( g_iMaxIOps>0 ) { int64_t tmTimer = sphMicroTimer(); int64_t tmSleep = Max ( 0, g_tmLastIOTime + 1000000/g_iMaxIOps - tmTimer ); sphSleepMsec ( (int)(tmSleep/1000) ); g_tmLastIOTime = tmTimer + tmSleep; } } bool sphWriteThrottled ( int iFD, const void * pBuf, int64_t iCount, const char * sName, CSphString & sError ) { if ( iCount<=0 ) return true; // by default, slice ios by at most 1 GB int iChunkSize = ( 1UL<<30 ); // when there's a sane max_iosize (4K to 1GB), use it if ( g_iMaxIOSize>=4096 ) iChunkSize = Min ( iChunkSize, g_iMaxIOSize ); // while there's data, write it chunk by chunk const BYTE * p = (const BYTE*) pBuf; while ( iCount>0 ) { // wait for a timely occasion sphThrottleSleep (); // write (and maybe time) int64_t tmTimer = 0; if ( g_bIOStats ) tmTimer = sphMicroTimer(); int iToWrite = iChunkSize; if ( iCount g_iMaxIOSize ) { size_t nChunks = iCount / g_iMaxIOSize; size_t nBytesLeft = iCount % g_iMaxIOSize; size_t nBytesRead = 0; size_t iRead = 0; for ( size_t i=0; i 0 ) { iRead = sphReadThrottled ( iFD, (char *)pBuf + nChunks*g_iMaxIOSize, nBytesLeft ); nBytesRead += iRead; if ( iRead!=nBytesLeft ) return nBytesRead; } return nBytesRead; } sphThrottleSleep (); return sphRead ( iFD, pBuf, iCount ); } void SafeClose ( int & iFD ) { if ( iFD>=0 ) ::close ( iFD ); iFD = -1; } ////////////////////////////////////////////////////////////////////////// #if !USE_WINDOWS char * strlwr ( char * s ) { while ( *s ) { *s = tolower ( *s ); s++; } return s; } #endif char * sphStrMacro ( const char * sTemplate, const char * sMacro, SphDocID_t uValue ) { // expand macro char sExp[32]; snprintf ( sExp, sizeof(sExp), DOCID_FMT, uValue ); // calc lengths int iExp = strlen ( sExp ); int iMacro = strlen ( sMacro ); int iDelta = iExp-iMacro; // calc result length int iRes = strlen ( sTemplate ); const char * sCur = sTemplate; while ( ( sCur = strstr ( sCur, sMacro ) )!=NULL ) { iRes += iDelta; sCur++; } // build result char * sRes = new char [ iRes+1 ]; char * sOut = sRes; const char * sLast = sTemplate; sCur = sTemplate; while ( ( sCur = strstr ( sCur, sMacro ) )!=NULL ) { strncpy ( sOut, sLast, sCur-sLast ); sOut += sCur-sLast; strcpy ( sOut, sExp ); sOut += iExp; // NOLINT sCur += iMacro; sLast = sCur; } if ( *sLast ) strcpy ( sOut, sLast ); // NOLINT assert ( (int)strlen(sRes)==iRes ); return sRes; } float sphToFloat ( const char * s ) { if ( !s ) return 0.0f; return (float)strtod ( s, NULL ); } DWORD sphToDword ( const char * s ) { if ( !s ) return 0; return strtoul ( s, NULL, 10 ); } uint64_t sphToUint64 ( const char * s ) { if ( !s ) return 0; return strtoull ( s, NULL, 10 ); } int64_t sphToInt64 ( const char * s ) { if ( !s ) return 0; return strtoll ( s, NULL, 10 ); } #if USE_64BIT #define sphToDocid sphToUint64 #else #define sphToDocid sphToDword #endif #if USE_WINDOWS bool sphLockEx ( int iFile, bool bWait ) { HANDLE hHandle = (HANDLE) _get_osfhandle ( iFile ); if ( hHandle!=INVALID_HANDLE_VALUE ) { OVERLAPPED tOverlapped; memset ( &tOverlapped, 0, sizeof ( tOverlapped ) ); return !!LockFileEx ( hHandle, LOCKFILE_EXCLUSIVE_LOCK | ( bWait ? 0 : LOCKFILE_FAIL_IMMEDIATELY ), 0, 1, 0, &tOverlapped ); } return false; } void sphLockUn ( int iFile ) { HANDLE hHandle = (HANDLE) _get_osfhandle ( iFile ); if ( hHandle!=INVALID_HANDLE_VALUE ) { OVERLAPPED tOverlapped; memset ( &tOverlapped, 0, sizeof ( tOverlapped ) ); UnlockFileEx ( hHandle, 0, 1, 0, &tOverlapped ); } } #else bool sphLockEx ( int iFile, bool bWait ) { struct flock tLock; tLock.l_type = F_WRLCK; tLock.l_whence = SEEK_SET; tLock.l_start = 0; tLock.l_len = 0; int iCmd = bWait ? F_SETLKW : F_SETLK; // FIXME! check for HAVE_F_SETLKW? return ( fcntl ( iFile, iCmd, &tLock )!=-1 ); } void sphLockUn ( int iFile ) { struct flock tLock; tLock.l_type = F_UNLCK; tLock.l_whence = SEEK_SET; tLock.l_start = 0; tLock.l_len = 0; fcntl ( iFile, F_SETLK, &tLock ); } #endif void sphSleepMsec ( int iMsec ) { if ( iMsec<=0 ) return; #if USE_WINDOWS Sleep ( iMsec ); #else struct timeval tvTimeout; tvTimeout.tv_sec = iMsec / 1000; // full seconds tvTimeout.tv_usec = ( iMsec % 1000 ) * 1000; // remainder is msec, so *1000 for usec select ( 0, NULL, NULL, NULL, &tvTimeout ); // FIXME? could handle EINTR #endif } bool sphIsReadable ( const char * sPath, CSphString * pError ) { int iFD = ::open ( sPath, O_RDONLY ); if ( iFD<0 ) { if ( pError ) pError->SetSprintf ( "%s unreadable: %s", sPath, strerror(errno) ); return false; } close ( iFD ); return true; } void sphSetReadBuffers ( int iReadBuffer, int iReadUnhinted ) { if ( iReadBuffer<=0 ) iReadBuffer = DEFAULT_READ_BUFFER; g_iReadBuffer = Max ( iReadBuffer, MIN_READ_BUFFER ); if ( iReadUnhinted<=0 ) iReadUnhinted = DEFAULT_READ_UNHINTED; g_iReadUnhinted = Max ( iReadUnhinted, MIN_READ_UNHINTED ); } ////////////////////////////////////////////////////////////////////////// // DOCINFO ////////////////////////////////////////////////////////////////////////// static DWORD * g_pMvaArena = NULL; ///< initialized by sphArenaInit() // OPTIMIZE! try to inline or otherwise simplify maybe const DWORD * CSphMatch::GetAttrMVA ( const CSphAttrLocator & tLoc, const DWORD * pPool ) const { DWORD uIndex = MVA_DOWNSIZE ( GetAttr ( tLoc ) ); if ( !uIndex ) return NULL; if ( uIndex & MVA_ARENA_FLAG ) return g_pMvaArena + ( uIndex & MVA_OFFSET_MASK ); assert ( pPool ); return pPool + uIndex; } ///////////////////////////////////////////////////////////////////////////// // TOKENIZERS ///////////////////////////////////////////////////////////////////////////// #if USE_WINDOWS #pragma warning(disable:4127) // conditional expr is const for MSVC #pragma warning(disable:4530) // for ugly mmseg #endif inline int sphUTF8Decode ( BYTE * & pBuf ); // forward ref for GCC inline int sphUTF8Encode ( BYTE * pBuf, int iCode ); // forward ref for GCC #if USE_MMSEG /// create UTF-8 tokenizer with Chinese Segment support ISphTokenizer * sphCreateUTF8ChineseTokenizer ( const char* dict_path ); #endif /// synonym list entry struct CSphSynonym { CSphString m_sFrom; ///< specially packed list of map-from tokens CSphString m_sTo; ///< map-to string int m_iFromLen; ///< cached m_sFrom length int m_iToLen; ///< cached m_sTo length inline bool operator < ( const CSphSynonym & rhs ) const { return strcmp ( m_sFrom.cstr(), rhs.m_sFrom.cstr() ) < 0; } }; /// tokenizer implementation traits template < bool IS_UTF8 > class CSphTokenizerTraits : public ISphTokenizer { public: CSphTokenizerTraits (); virtual bool SetCaseFolding ( const char * sConfig, CSphString & sError ); virtual bool LoadSynonyms ( const char * sFilename, CSphString & sError ); virtual void CloneBase ( const CSphTokenizerTraits * pFrom, bool bEscaped ); virtual const char * GetTokenStart () const { return (const char *) m_pTokenStart; } virtual const char * GetTokenEnd () const { return (const char *) m_pTokenEnd; } virtual const char * GetBufferPtr () const { return (const char *) m_pCur; } virtual const char * GetBufferEnd () const { return (const char *) m_pBufferMax; } virtual void SetBufferPtr ( const char * sNewPtr ); virtual int SkipBlended (); protected: virtual bool IsSegment(const BYTE * ) { return true; } //mmseg: use to sep CJK characters BYTE * GetTokenSyn (); bool BlendAdjust ( BYTE * pPosition ); BYTE * GetBlendedVariant (); int CodepointArbitration ( int iCodepoint, bool bWasEscaped, bool bSpaceAhead ); protected: /// get codepoint inline int GetCodepoint () { if ( IS_UTF8 ) { while ( m_pCur=0 ) return iCode; // succesful decode } return -1; // eof } else { return m_pCur>=m_pBufferMax ? -1 : int ( *m_pCur++ ); } } /// accum codepoint inline void AccumCodepoint ( int iCode ) { assert ( iCode>0 ); assert ( m_iAccum>=0 ); // throw away everything which is over the token size if ( m_iAccum=m_sAccum && m_pAccum m_dSynonyms; ///< active synonyms CSphVector m_dSynStart; ///< map 1st byte to candidate range start CSphVector m_dSynEnd; ///< map 1st byte to candidate range end BYTE * m_pBlendStart; BYTE * m_pBlendEnd; }; /// single-byte charset tokenizer class CSphTokenizer_SBCS : public CSphTokenizerTraits { public: CSphTokenizer_SBCS (); virtual void SetBuffer ( BYTE * sBuffer, int iLength ); virtual BYTE * GetToken (); virtual ISphTokenizer * Clone ( bool bEscaped ) const; virtual bool IsUtf8 () const { return false; } virtual int GetCodepointLength ( int ) const { return 1; } }; /// UTF-8 tokenizer class CSphTokenizer_UTF8 : public CSphTokenizerTraits { public: CSphTokenizer_UTF8 (); virtual void SetBuffer ( BYTE * sBuffer, int iLength ); virtual BYTE * GetToken (); virtual ISphTokenizer * Clone ( bool bEscaped ) const; virtual bool IsUtf8 () const { return true; } virtual int GetCodepointLength ( int iCode ) const; protected: void FlushAccum (); }; /// UTF-8 tokenizer with n-grams class CSphTokenizer_UTF8Ngram : public CSphTokenizer_UTF8 { public: CSphTokenizer_UTF8Ngram () : m_iNgramLen ( 1 ) {} public: virtual bool SetNgramChars ( const char * sConfig, CSphString & sError ); virtual void SetNgramLen ( int iLen ); virtual BYTE * GetToken (); protected: int m_iNgramLen; CSphString m_sNgramCharsStr; }; struct CSphMultiform { CSphString m_sNormalForm; int m_iNormalTokenLen; CSphVector m_dTokens; }; struct CSphMultiforms { int m_iMinTokens; int m_iMaxTokens; CSphVector m_dWordforms; }; struct CSphMultiformContainer { CSphMultiformContainer () : m_iMaxTokens ( 0 ) {} int m_iMaxTokens; typedef CSphOrderedHash < CSphMultiforms *, CSphString, CSphStrHashFunc, 131072, 117 > CSphMultiformHash; CSphMultiformHash m_Hash; }; /// Token filter class CSphTokenizer_Filter : public ISphTokenizer { public: CSphTokenizer_Filter ( ISphTokenizer * pTokenizer, const CSphMultiformContainer * pContainer ); ~CSphTokenizer_Filter (); virtual bool SetCaseFolding ( const char * sConfig, CSphString & sError ) { return m_pTokenizer->SetCaseFolding ( sConfig, sError ); } virtual void AddCaseFolding ( CSphRemapRange & tRange ) { m_pTokenizer->AddCaseFolding ( tRange ); } virtual void AddSpecials ( const char * sSpecials ) { m_pTokenizer->AddSpecials ( sSpecials ); } virtual bool SetIgnoreChars ( const char * sIgnored, CSphString & sError ) { return m_pTokenizer->SetIgnoreChars ( sIgnored, sError ); } virtual bool SetNgramChars ( const char * sConfig, CSphString & sError ) { return m_pTokenizer->SetNgramChars ( sConfig, sError ); } virtual void SetNgramLen ( int iLen ) { m_pTokenizer->SetNgramLen ( iLen ); } virtual bool LoadSynonyms ( const char * sFilename, CSphString & sError ) { return m_pTokenizer->LoadSynonyms ( sFilename, sError ); } virtual bool SetBoundary ( const char * sConfig, CSphString & sError ) { return m_pTokenizer->SetBoundary ( sConfig, sError ); } virtual void Setup ( const CSphTokenizerSettings & tSettings ) { m_pTokenizer->Setup ( tSettings ); } virtual const CSphTokenizerSettings & GetSettings () const { return m_pTokenizer->GetSettings (); } virtual const CSphSavedFile & GetSynFileInfo () const { return m_pTokenizer->GetSynFileInfo (); } virtual bool EnableSentenceIndexing ( CSphString & sError ) { return m_pTokenizer->EnableSentenceIndexing ( sError ); } virtual bool EnableZoneIndexing ( CSphString & sError ) { return m_pTokenizer->EnableZoneIndexing ( sError ); } public: virtual void SetBuffer ( BYTE * sBuffer, int iLength ); virtual BYTE * GetToken (); virtual int GetCodepointLength ( int iCode ) const { return m_pTokenizer->GetCodepointLength ( iCode ); } virtual void EnableQueryParserMode ( bool bEnable ) { m_pTokenizer->EnableQueryParserMode ( bEnable ); } virtual void EnableTokenizedMultiformTracking () { m_bBuildMultiform = true; } virtual int GetLastTokenLen () const { return m_pLastToken->m_iTokenLen; } virtual bool GetBoundary () { return m_pLastToken->m_bBoundary; } virtual bool WasTokenSpecial () { return m_pLastToken->m_bSpecial; } virtual int GetOvershortCount () { return m_pLastToken->m_iOvershortCount; } virtual BYTE * GetTokenizedMultiform () { return m_sTokenizedMultiform[0] ? m_sTokenizedMultiform : NULL; } public: virtual ISphTokenizer * Clone ( bool bEscaped ) const; virtual bool IsUtf8 () const { return m_pTokenizer->IsUtf8 (); } virtual const char * GetTokenStart () const { return m_pLastToken->m_szTokenStart; } virtual const char * GetTokenEnd () const { return m_pLastToken->m_szTokenEnd; } virtual const char * GetBufferPtr () const { return m_pLastToken ? m_pLastToken->m_pBufferPtr : m_pTokenizer->GetBufferPtr(); } virtual const char * GetBufferEnd () const { return m_pTokenizer->GetBufferEnd (); } virtual void SetBufferPtr ( const char * sNewPtr ); private: ISphTokenizer * m_pTokenizer; const CSphMultiformContainer * m_pMultiWordforms; int m_iStoredStart; int m_iStoredLen; bool m_bBuildMultiform; BYTE m_sTokenizedMultiform [ 3*SPH_MAX_WORD_LEN+4 ]; BYTE m_sOutMultiform [ 3*SPH_MAX_WORD_LEN+4 ]; struct StoredToken_t { BYTE m_sToken [3*SPH_MAX_WORD_LEN+4]; int m_iTokenLen; bool m_bBoundary; bool m_bSpecial; int m_iOvershortCount; const char * m_szTokenStart; const char * m_szTokenEnd; const char * m_pBufferPtr; }; CSphVector m_dStoredTokens; StoredToken_t m_tLastToken; StoredToken_t * m_pLastToken; void FillTokenInfo ( StoredToken_t * pToken ); }; ///////////////////////////////////////////////////////////////////////////// #if USE_MMSEG #include "tokenizer_zhcn.h" class CSphTokenizer_UTF8MMSeg : public CSphTokenizer_UTF8 { public: CSphTokenizer_UTF8MMSeg (); ~CSphTokenizer_UTF8MMSeg () { if(d_) delete d_; } virtual void SetBuffer ( BYTE * sBuffer, int iLength ); virtual BYTE * GetToken (); virtual ISphTokenizer * Clone ( bool bEscaped ) const; void setDictPath(const char* path) { m_dictpath = path; } public: virtual const BYTE* GetThesaurus(BYTE * sBuffer, int iLength ); virtual const char * GetBufferPtr () const { return (const char *) m_pCur; } virtual const char * GetTokenStart () const { return m_segToken; } virtual int GetLastTokenLen () const { return m_iLastTokenLenMMSeg; } protected: char* m_segToken; protected: virtual bool IsSegment(const BYTE * pCur); CSphString m_dictpath; BYTE m_sAccumSeg [ 3*SPH_MAX_WORD_LEN+3 ]; ///< folded token accumulator BYTE * m_pAccumSeg; ///< current accumulator position protected: CSphTokenizer_zh_CN_UTF8_Private* d_; size_t m_segoffset; int m_iLastTokenLenMMSeg; ///< last token length, in codepoints }; #endif #if USE_WINDOWS #pragma warning(default:4127) // conditional expr is const #endif ///////////////////////////////////////////////////////////////////////////// ISphTokenizer * sphCreateSBCSTokenizer () { return new CSphTokenizer_SBCS (); } ISphTokenizer * sphCreateUTF8Tokenizer () { return new CSphTokenizer_UTF8 (); } ISphTokenizer * sphCreateUTF8NgramTokenizer () { return new CSphTokenizer_UTF8Ngram (); } #if USE_MMSEG ISphTokenizer * sphCreateUTF8ChineseTokenizer ( const char* dict_path ) { CSphTokenizer_UTF8MMSeg* tokenizer = new CSphTokenizer_UTF8MMSeg (); tokenizer->setDictPath(dict_path); return tokenizer; } #endif ///////////////////////////////////////////////////////////////////////////// enum { MASK_CODEPOINT = 0x00ffffffUL, // mask off codepoint flags MASK_FLAGS = 0xff000000UL, // mask off codepoint value FLAG_CODEPOINT_SPECIAL = 0x01000000UL, // this codepoint is special FLAG_CODEPOINT_DUAL = 0x02000000UL, // this codepoint is special but also a valid word part FLAG_CODEPOINT_NGRAM = 0x04000000UL, // this codepoint is n-gram indexed FLAG_CODEPOINT_SYNONYM = 0x08000000UL, // this codepoint is used in synonym tokens only FLAG_CODEPOINT_BOUNDARY = 0x10000000UL, // this codepoint is phrase boundary FLAG_CODEPOINT_IGNORE = 0x20000000UL, // this codepoint is ignored FLAG_CODEPOINT_BLEND = 0x40000000UL // this codepoint is "blended" (indexed both as a character, and as a separator) }; CSphLowercaser::CSphLowercaser () : m_pData ( NULL ) { } void CSphLowercaser::Reset() { m_iChunks = 0; for ( int i=0; im_iChunks; m_pData = new int [ m_iChunks*CHUNK_SIZE ]; memcpy ( m_pData, pLC->m_pData, sizeof(int)*m_iChunks*CHUNK_SIZE ); // NOLINT sizeof(int) for ( int i=0; im_pChunk[i] ? pLC->m_pChunk[i] - pLC->m_pData + m_pData : NULL; } void CSphLowercaser::AddRemaps ( const CSphVector & dRemaps, DWORD uFlags ) { if ( !dRemaps.GetLength() ) return; // build new chunks map // 0 means "was unused" // 1 means "was used" // 2 means "is used now" int dUsed [ CHUNK_COUNT ]; for ( int i=0; i=0 && (_a)> CHUNK_BITS ); iChunk<=( tRemap.m_iEnd >> CHUNK_BITS ); iChunk++ ) if ( dUsed[iChunk]==0 ) { dUsed[iChunk] = 2; iNewChunks++; } } // alloc new tables and copy, if necessary if ( iNewChunks>m_iChunks ) { int * pData = new int [ iNewChunks*CHUNK_SIZE ]; memset ( pData, 0, sizeof(int)*iNewChunks*CHUNK_SIZE ); // NOLINT sizeof(int) int * pChunk = pData; for ( int i=0; i> CHUNK_BITS ] ); int & iCodepoint = m_pChunk [ j >> CHUNK_BITS ] [ j & CHUNK_MASK ]; bool bWordPart = ( iCodepoint & MASK_CODEPOINT ) && !( iCodepoint & FLAG_CODEPOINT_SYNONYM ); int iNew = iRemapped | uFlags | ( iCodepoint & MASK_FLAGS ); iCodepoint = bWordPart ? ( iNew | FLAG_CODEPOINT_DUAL ) : iNew; // new code-point flag removes SYNONYM if ( ( iCodepoint & FLAG_CODEPOINT_SYNONYM ) && uFlags==0 && iRemapped!=0 ) iCodepoint &= ~FLAG_CODEPOINT_SYNONYM; } } } void CSphLowercaser::AddSpecials ( const char * sSpecials ) { assert ( sSpecials ); int iSpecials = strlen(sSpecials); CSphVector dRemaps; dRemaps.Resize ( iSpecials ); ARRAY_FOREACH ( i, dRemaps ) dRemaps[i].m_iStart = dRemaps[i].m_iEnd = dRemaps[i].m_iRemapStart = sSpecials[i]; AddRemaps ( dRemaps, FLAG_CODEPOINT_SPECIAL ); } const CSphLowercaser & CSphLowercaser::operator = ( const CSphLowercaser & rhs ) { SetRemap ( &rhs ); return * this; } uint64_t CSphLowercaser::GetFNV () const { int iLen = ( sizeof(int) * m_iChunks * CHUNK_SIZE ) / sizeof(BYTE); // NOLINT return sphFNV64 ( (BYTE *)m_pData, iLen ); } ///////////////////////////////////////////////////////////////////////////// /// parser to build lowercaser from textual config class CSphCharsetDefinitionParser { public: CSphCharsetDefinitionParser () : m_bError ( false ) {} bool Parse ( const char * sConfig, CSphVector & dRanges ); const char * GetLastError (); protected: bool m_bError; char m_sError [ 1024 ]; const char * m_pCurrent; bool Error ( const char * sMessage ); void SkipSpaces (); bool IsEof (); bool CheckEof (); int HexDigit ( int c ); int ParseCharsetCode (); }; const char * CSphCharsetDefinitionParser::GetLastError () { return m_bError ? m_sError : NULL; } bool CSphCharsetDefinitionParser::IsEof () { return ( *m_pCurrent )==0; } bool CSphCharsetDefinitionParser::CheckEof () { if ( IsEof() ) { Error ( "unexpected end of line" ); return true; } else { return false; } } bool CSphCharsetDefinitionParser::Error ( const char * sMessage ) { char sErrorBuffer[32]; strncpy ( sErrorBuffer, m_pCurrent, sizeof(sErrorBuffer) ); sErrorBuffer [ sizeof(sErrorBuffer)-1 ] = '\0'; snprintf ( m_sError, sizeof(m_sError), "%s near '%s'", sMessage, sErrorBuffer ); m_sError [ sizeof(m_sError)-1 ] = '\0'; m_bError = true; return false; } int CSphCharsetDefinitionParser::HexDigit ( int c ) { if ( c>='0' && c<='9' ) return c-'0'; if ( c>='a' && c<='f' ) return c-'a'+10; if ( c>='A' && c<='F' ) return c-'A'+10; return 0; } void CSphCharsetDefinitionParser::SkipSpaces () { while ( ( *m_pCurrent ) && isspace ( (BYTE)*m_pCurrent ) ) m_pCurrent++; } int CSphCharsetDefinitionParser::ParseCharsetCode () { const char * p = m_pCurrent; int iCode = 0; if ( p[0]=='U' && p[1]=='+' ) { p += 2; while ( isxdigit(*p) ) { iCode = iCode*16 + HexDigit ( *p++ ); } while ( isspace(*p) ) p++; } else { if ( (*(BYTE*)p)<32 || (*(BYTE*)p)>127 ) { Error ( "non-ASCII characters not allowed, use 'U+00AB' syntax" ); return -1; } iCode = *p++; while ( isspace(*p) ) p++; } m_pCurrent = p; return iCode; } bool CSphCharsetDefinitionParser::Parse ( const char * sConfig, CSphVector & dRanges ) { m_pCurrent = sConfig; dRanges.Reset (); // do parse while ( *m_pCurrent ) { SkipSpaces (); if ( IsEof () ) break; // check for stray comma if ( *m_pCurrent==',' ) return Error ( "stray ',' not allowed, use 'U+002C' instead" ); // parse char code const char * pStart = m_pCurrent; int iStart = ParseCharsetCode(); if ( iStart<0 ) return false; // stray char? if ( !*m_pCurrent || *m_pCurrent==',' ) { // stray char dRanges.Add ( CSphRemapRange ( iStart, iStart, iStart ) ); if ( IsEof () ) break; m_pCurrent++; continue; } // stray remap? if ( m_pCurrent[0]=='-' && m_pCurrent[1]=='>' ) { // parse and add m_pCurrent += 2; int iDest = ParseCharsetCode (); if ( iDest<0 ) return false; dRanges.Add ( CSphRemapRange ( iStart, iStart, iDest ) ); // it's either end of line now, or must be followed by comma if ( *m_pCurrent ) if ( *m_pCurrent++!=',' ) return Error ( "syntax error" ); continue; } // range start? if (!( m_pCurrent[0]=='.' && m_pCurrent[1]=='.' )) return Error ( "syntax error" ); m_pCurrent += 2; SkipSpaces (); if ( CheckEof () ) return false; // parse range end char code int iEnd = ParseCharsetCode (); if ( iEnd<0 ) return false; if ( iStart>iEnd ) { m_pCurrent = pStart; return Error ( "range end less than range start" ); } // stray range? if ( !*m_pCurrent || *m_pCurrent==',' ) { dRanges.Add ( CSphRemapRange ( iStart, iEnd, iStart ) ); if ( IsEof () ) break; m_pCurrent++; continue; } // "checkerboard" range? if ( m_pCurrent[0]=='/' && m_pCurrent[1]=='2' ) { for ( int i=iStart; i' )) return Error ( "expected end of line, ',' or '->'" ); m_pCurrent += 2; SkipSpaces (); if ( CheckEof () ) return false; // parse dest start const char * pRemapStart = m_pCurrent; int iRemapStart = ParseCharsetCode (); if ( iRemapStart<0 ) return false; // expect '..' if ( CheckEof () ) return false; if (!( m_pCurrent[0]=='.' && m_pCurrent[1]=='.' )) return Error ( "expected '..'" ); m_pCurrent += 2; // parse dest end int iRemapEnd = ParseCharsetCode (); if ( iRemapEnd<0 ) return false; // check dest range if ( iRemapStart>iRemapEnd ) { m_pCurrent = pRemapStart; return Error ( "dest range end less than dest range start" ); } // check for length mismatch if ( ( iRemapEnd-iRemapStart )!=( iEnd-iStart ) ) { m_pCurrent = pStart; return Error ( "dest range length must match src range length" ); } // remapped ok dRanges.Add ( CSphRemapRange ( iStart, iEnd, iRemapStart ) ); if ( IsEof () ) break; if ( *m_pCurrent!=',' ) return Error ( "expected ','" ); m_pCurrent++; } dRanges.Sort (); for ( int i=0; i=dRanges[i+1].m_iStart ) { // FIXME! add an ambiguity check dRanges[i].m_iEnd = Max ( dRanges[i].m_iEnd, dRanges[i+1].m_iEnd ); dRanges.Remove ( i+1 ); i--; } } return true; } ////////////////////////////////////////////////////////////////////////// bool sphParseCharset ( const char * sCharset, CSphVector & dRemaps ) { CSphCharsetDefinitionParser tParser; return tParser.Parse ( sCharset, dRemaps ); } ///////////////////////////////////////////////////////////////////////////// CSphSavedFile::CSphSavedFile () : m_uSize ( 0 ) , m_uCTime ( 0 ) , m_uMTime ( 0 ) , m_uCRC32 ( 0 ) { } CSphTokenizerSettings::CSphTokenizerSettings () : m_iType ( TOKENIZER_SBCS ) , m_iMinWordLen ( 1 ) , m_iNgramLen ( 0 ) , m_iDebug ( 0 ) { } static void LoadTokenizerSettings ( CSphReader & tReader, CSphTokenizerSettings & tSettings, DWORD uVersion, CSphString & sWarning ) { if ( uVersion<9 ) return; tSettings.m_iType = tReader.GetByte (); tSettings.m_sCaseFolding = tReader.GetString (); tSettings.m_iMinWordLen = tReader.GetDword (); tSettings.m_sSynonymsFile = tReader.GetString (); ReadFileInfo ( tReader, tSettings.m_sSynonymsFile.cstr (), sWarning ); tSettings.m_sBoundary = tReader.GetString (); tSettings.m_sIgnoreChars = tReader.GetString (); tSettings.m_iNgramLen = tReader.GetDword (); tSettings.m_sNgramChars = tReader.GetString (); tSettings.m_sDictPath = tReader.GetString (); //mmseg if ( uVersion>=15 ) tSettings.m_sBlendChars = tReader.GetString (); if ( uVersion>=24 ) tSettings.m_sBlendMode = tReader.GetString(); } static void SaveTokenizerSettings ( CSphWriter & tWriter, ISphTokenizer * pTokenizer ) { assert ( pTokenizer ); const CSphTokenizerSettings & tSettings = pTokenizer->GetSettings (); tWriter.PutByte ( tSettings.m_iType ); tWriter.PutString ( tSettings.m_sCaseFolding.cstr () ); tWriter.PutDword ( tSettings.m_iMinWordLen ); tWriter.PutString ( tSettings.m_sSynonymsFile.cstr () ); WriteFileInfo ( tWriter, pTokenizer->GetSynFileInfo () ); tWriter.PutString ( tSettings.m_sBoundary.cstr () ); tWriter.PutString ( tSettings.m_sIgnoreChars.cstr () ); tWriter.PutDword ( tSettings.m_iNgramLen ); tWriter.PutString ( tSettings.m_sNgramChars.cstr () ); tWriter.PutString ( tSettings.m_sDictPath.cstr() ); //mmseg tWriter.PutString ( tSettings.m_sBlendChars.cstr () ); tWriter.PutString ( tSettings.m_sBlendMode.cstr () ); } void LoadDictionarySettings ( CSphReader & tReader, CSphDictSettings & tSettings, DWORD uVersion, CSphString & sWarning ) { if ( uVersion<9 ) return; tSettings.m_sMorphology = tReader.GetString (); tSettings.m_sStopwords = tReader.GetString (); int nFiles = tReader.GetDword (); CSphString sFile; for ( int i = 0; i < nFiles; i++ ) { sFile = tReader.GetString (); ReadFileInfo ( tReader, sFile.cstr (), sWarning ); } tSettings.m_sWordforms = tReader.GetString (); ReadFileInfo ( tReader, tSettings.m_sWordforms.cstr (), sWarning ); if ( uVersion>=13 ) tSettings.m_iMinStemmingLen = tReader.GetDword (); tSettings.m_bWordDict = false; // default to crc for old indexes if ( uVersion>=21 ) tSettings.m_bWordDict = ( tReader.GetByte()!=0 ); } void SaveDictionarySettings ( CSphWriter & tWriter, CSphDict * pDict ) { const CSphDictSettings & tSettings = pDict->GetSettings (); tWriter.PutString ( tSettings.m_sMorphology.cstr () ); tWriter.PutString ( tSettings.m_sStopwords.cstr () ); const CSphVector & dSWFileInfos = pDict->GetStopwordsFileInfos (); tWriter.PutDword ( dSWFileInfos.GetLength () ); ARRAY_FOREACH ( i, dSWFileInfos ) { tWriter.PutString ( dSWFileInfos[i].m_sFilename.cstr () ); WriteFileInfo ( tWriter, dSWFileInfos[i] ); } const CSphSavedFile & tWFFileInfo = pDict->GetWordformsFileInfo (); tWriter.PutString ( tSettings.m_sWordforms.cstr () ); WriteFileInfo ( tWriter, tWFFileInfo ); tWriter.PutDword ( tSettings.m_iMinStemmingLen ); tWriter.PutByte ( tSettings.m_bWordDict ); } static inline bool ShortTokenFilter ( BYTE * pToken, int iLen ) { return pToken[0]=='*' || ( iLen > 0 && pToken[iLen-1]=='*' ); } ///////////////////////////////////////////////////////////////////////////// ISphTokenizer::ISphTokenizer () : m_iLastTokenLen ( 0 ) , m_bTokenBoundary ( false ) , m_bBoundary ( false ) , m_bWasSpecial ( false ) , m_bEscaped ( false ) , m_iOvershortCount ( 0 ) , m_bBlended ( false ) , m_bNonBlended ( true ) , m_bBlendedPart ( false ) , m_bBlendAdd ( false ) , m_uBlendVariants ( BLEND_TRIM_NONE ) , m_uBlendVariantsPending ( 0 ) , m_bBlendSkipPure ( false ) , m_bShortTokenFilter ( false ) , m_bQueryMode ( false ) , m_bDetectSentences ( false ) , m_bPhrase ( false ) {} bool ISphTokenizer::SetCaseFolding ( const char * sConfig, CSphString & sError ) { CSphVector dRemaps; CSphCharsetDefinitionParser tParser; if ( !tParser.Parse ( sConfig, dRemaps ) ) { sError = tParser.GetLastError(); return false; } m_tLC.Reset (); m_tLC.AddRemaps ( dRemaps, 0 ); return true; } void ISphTokenizer::AddCaseFolding ( CSphRemapRange & tRange ) { CSphVector dTmp; dTmp.Add ( tRange ); m_tLC.AddRemaps ( dTmp, 0 ); } void ISphTokenizer::AddSpecials ( const char * sSpecials ) { m_tLC.AddSpecials ( sSpecials ); } static int TokenizeOnWhitespace ( CSphVector & dTokens, BYTE * sFrom, bool bUtf8 ) { BYTE sAccum [ 3*SPH_MAX_WORD_LEN+16 ]; BYTE * pAccum = sAccum; int iAccum = 0; for ( ;; ) { int iCode = bUtf8 ? sphUTF8Decode(sFrom) : *sFrom++; // eof or whitespace? if ( !iCode || sphIsSpace(iCode) ) { // flush accum if ( iAccum ) { *pAccum = '\0'; dTokens.Add ( (char*)sAccum ); pAccum = sAccum; iAccum = 0; } // break on eof if ( !iCode ) break; } else { // accumulate everything else if ( iAccums && sphIsSpace(*sEnd) ) sEnd--; *++sEnd = '\0'; return s; } void ISphTokenizer::Setup ( const CSphTokenizerSettings & tSettings ) { m_tSettings = tSettings; m_tSettings.m_iMinWordLen = Max ( tSettings.m_iMinWordLen, 1 ); } ISphTokenizer * ISphTokenizer::Create ( const CSphTokenizerSettings & tSettings, CSphString & sError ) { CSphScopedPtr pTokenizer ( NULL ); switch ( tSettings.m_iType ) { case TOKENIZER_SBCS: pTokenizer = sphCreateSBCSTokenizer (); break; case TOKENIZER_UTF8: pTokenizer = sphCreateUTF8Tokenizer (); break; case TOKENIZER_NGRAM: pTokenizer = sphCreateUTF8NgramTokenizer (); break; #if USE_MMSEG case TOKENIZER_ZHCN_UTF8: pTokenizer = sphCreateUTF8ChineseTokenizer (tSettings.m_sDictPath.cstr()); break; #endif default: sError.SetSprintf ( "failed to create tokenizer (unknown charset type '%d')", tSettings.m_iType ); return NULL; } pTokenizer->Setup ( tSettings ); if ( !tSettings.m_sCaseFolding.IsEmpty () && !pTokenizer->SetCaseFolding ( tSettings.m_sCaseFolding.cstr (), sError ) ) { sError.SetSprintf ( "'charset_table': %s", sError.cstr() ); return NULL; } if ( !tSettings.m_sSynonymsFile.IsEmpty () && !pTokenizer->LoadSynonyms ( tSettings.m_sSynonymsFile.cstr (), sError ) ) { sError.SetSprintf ( "'synonyms': %s", sError.cstr() ); return NULL; } if ( !tSettings.m_sBoundary.IsEmpty () && !pTokenizer->SetBoundary ( tSettings.m_sBoundary.cstr (), sError ) ) { sError.SetSprintf ( "'phrase_boundary': %s", sError.cstr() ); return NULL; } if ( !tSettings.m_sIgnoreChars.IsEmpty () && !pTokenizer->SetIgnoreChars ( tSettings.m_sIgnoreChars.cstr (), sError ) ) { sError.SetSprintf ( "'ignore_chars': %s", sError.cstr() ); return NULL; } if ( !tSettings.m_sBlendChars.IsEmpty () && !pTokenizer->SetBlendChars ( tSettings.m_sBlendChars.cstr (), sError ) ) { sError.SetSprintf ( "'blend_chars': %s", sError.cstr() ); return NULL; } if ( !pTokenizer->SetBlendMode ( tSettings.m_sBlendMode.cstr (), sError ) ) { sError.SetSprintf ( "'blend_mode': %s", sError.cstr() ); return NULL; } pTokenizer->SetNgramLen ( tSettings.m_iNgramLen ); if ( !tSettings.m_sNgramChars.IsEmpty () && !pTokenizer->SetNgramChars ( tSettings.m_sNgramChars.cstr (), sError ) ) { sError.SetSprintf ( "'ngram_chars': %s", sError.cstr() ); return NULL; } return pTokenizer.LeakPtr (); } ISphTokenizer * ISphTokenizer::CreateTokenFilter ( ISphTokenizer * pTokenizer, const CSphMultiformContainer * pContainer ) { if ( !pContainer ) return NULL; return new CSphTokenizer_Filter ( pTokenizer, pContainer ); } bool ISphTokenizer::AddSpecialsSPZ ( const char * sSpecials, const char * sDirective, CSphString & sError ) { for ( int i=0; sSpecials[i]; i++ ) { int iCode = m_tLC.ToLower ( sSpecials[i] ); if ( iCode & ( FLAG_CODEPOINT_NGRAM | FLAG_CODEPOINT_BOUNDARY | FLAG_CODEPOINT_IGNORE ) ) { sError.SetSprintf ( "%s requires that character '%c' is not in ngram_chars, phrase_boundary, or ignore_chars", sDirective, sSpecials[i] ); return false; } } AddSpecials ( sSpecials ); return true; } bool ISphTokenizer::EnableSentenceIndexing ( CSphString & sError ) { const char sSpecials[] = { '.', '?', '!', MAGIC_CODE_PARAGRAPH, 0 }; if ( !AddSpecialsSPZ ( sSpecials, "index_sp", sError ) ) return false; m_bDetectSentences = true; return true; } bool ISphTokenizer::EnableZoneIndexing ( CSphString & sError ) { const char sSpecials[] = { MAGIC_CODE_ZONE, 0 }; return AddSpecialsSPZ ( sSpecials, "index_zones", sError ); } ////////////////////////////////////////////////////////////////////////// template < bool IS_UTF8 > CSphTokenizerTraits::CSphTokenizerTraits () : m_pBuffer ( NULL ) , m_pBufferMax ( NULL ) , m_pCur ( NULL ) , m_pTokenStart ( NULL ) , m_pTokenEnd ( NULL ) , m_iAccum ( 0 ) , m_pBlendStart ( NULL ) , m_pBlendEnd ( NULL ) { m_pAccum = m_sAccum; } template < bool IS_UTF8 > bool CSphTokenizerTraits::SetCaseFolding ( const char * sConfig, CSphString & sError ) { if ( m_dSynonyms.GetLength() ) { sError = "SetCaseFolding() must not be called after LoadSynonyms()"; return false; } return ISphTokenizer::SetCaseFolding ( sConfig, sError ); } template < bool IS_UTF8 > bool CSphTokenizerTraits::LoadSynonyms ( const char * sFilename, CSphString & sError ) { m_dSynonyms.Reset (); if ( !sFilename || !*sFilename ) return true; GetFileStats ( sFilename, m_tSynFileInfo ); FILE * fp = fopen ( sFilename, "r" ); if ( !fp ) { sError.SetSprintf ( "failed to open '%s'", sFilename ); return false; } int iLine = 0; char sBuffer[1024]; CSphOrderedHash < int, int, IdentityHash_fn, 4096, 117 > hSynonymOnly; CSphVector dFrom; bool bOK = false; for ( ;; ) { char * sGot = fgets ( sBuffer, sizeof(sBuffer), fp ); if ( !sGot ) { if ( feof(fp) ) bOK = true; break; } iLine++; dFrom.Resize ( 0 ); // extract map-from and map-to parts char * sSplit = strstr ( sBuffer, "=>" ); if ( !sSplit ) { sError.SetSprintf ( "%s line %d: mapping token (=>) not found", sFilename, iLine ); break; } BYTE * sFrom = (BYTE *) sBuffer; BYTE * sTo = (BYTE *)( sSplit + strlen ( "=>" ) ); *sSplit = '\0'; // tokenize map-from if ( !TokenizeOnWhitespace ( dFrom, sFrom, IsUtf8() ) ) { sError.SetSprintf ( "%s line %d: empty map-from part", sFilename, iLine ); break; } // trim map-to sTo = sphTrim ( sTo ); if ( !*sTo ) { sError.SetSprintf ( "%s line %d: empty map-to part", sFilename, iLine ); break; } // check lengths ARRAY_FOREACH ( i, dFrom ) { int iFromLen = IsUtf8() ? sphUTF8Len ( dFrom[i].cstr() ) : strlen ( dFrom[i].cstr() ); if ( iFromLen>SPH_MAX_WORD_LEN ) { sError.SetSprintf ( "%s line %d: map-from token too long (over %d bytes)", sFilename, iLine, SPH_MAX_WORD_LEN ); break; } } int iToLen = IsUtf8() ? sphUTF8Len ( (const char*)sTo ) : strlen ( (const char*)sTo ); if ( iToLen>SPH_MAX_WORD_LEN ) { sError.SetSprintf ( "%s line %d: map-to token too long (over %d bytes)", sFilename, iLine, SPH_MAX_WORD_LEN ); break; } // pack and store it int iFromLen = 1; ARRAY_FOREACH ( i, dFrom ) iFromLen += strlen ( dFrom[i].cstr() ) + 1; if ( iFromLen>MAX_SYNONYM_LEN ) { sError.SetSprintf ( "%s line %d: map-from part too long (over %d bytes)", sFilename, iLine, MAX_SYNONYM_LEN ); break; } CSphSynonym & tSyn = m_dSynonyms.Add (); tSyn.m_sFrom.Reserve ( iFromLen ); tSyn.m_iFromLen = iFromLen; tSyn.m_sTo = (char*)sTo; tSyn.m_iToLen = iToLen; char * sCur = const_cast ( tSyn.m_sFrom.cstr() ); ARRAY_FOREACH ( i, dFrom ) { int iLen = strlen ( dFrom[i].cstr() ); memcpy ( sCur, dFrom[i].cstr(), iLen ); sCur[iLen] = MAGIC_SYNONYM_WHITESPACE; sCur += iLen+1; } *sCur++ = '\0'; assert ( sCur-tSyn.m_sFrom.cstr()==iFromLen ); // track synonym-only codepoints in map-from for ( ;; ) { int iCode = IsUtf8() ? sphUTF8Decode(sFrom) : *sFrom++; if ( !iCode ) break; if ( iCode>0 && !sphIsSpace(iCode) && !m_tLC.ToLower(iCode) ) hSynonymOnly.Add ( 1, iCode ); } } fclose ( fp ); if ( !bOK ) { m_dSynonyms.Reset (); return false; } // sort the list m_dSynonyms.Sort (); // build simple lookup table m_dSynStart.Resize ( 256 ); m_dSynEnd.Resize ( 256 ); for ( int i=0; i<256; i++ ) { m_dSynStart[i] = INT_MAX; m_dSynEnd[i] = -INT_MAX; } ARRAY_FOREACH ( i, m_dSynonyms ) { int iCh = *(BYTE*)( m_dSynonyms[i].m_sFrom.cstr() ); m_dSynStart[iCh] = Min ( m_dSynStart[iCh], i ); m_dSynEnd[iCh] = Max ( m_dSynEnd[iCh], i ); } // add synonym-only remaps CSphVector dRemaps; dRemaps.Reserve ( hSynonymOnly.GetLength() ); hSynonymOnly.IterateStart (); while ( hSynonymOnly.IterateNext() ) { CSphRemapRange & tRange = dRemaps.Add (); tRange.m_iStart = tRange.m_iEnd = tRange.m_iRemapStart = hSynonymOnly.IterateGetKey(); } m_tLC.AddRemaps ( dRemaps, FLAG_CODEPOINT_SYNONYM ); return true; } template < bool IS_UTF8 > void CSphTokenizerTraits::CloneBase ( const CSphTokenizerTraits * pFrom, bool bEscaped ) { m_tLC = pFrom->m_tLC; m_dSynonyms = pFrom->m_dSynonyms; m_dSynStart = pFrom->m_dSynStart; m_dSynEnd = pFrom->m_dSynEnd; m_tSettings = pFrom->m_tSettings; m_bEscaped = bEscaped; m_uBlendVariants = pFrom->m_uBlendVariants; m_bBlendSkipPure = pFrom->m_bBlendSkipPure; if ( bEscaped ) { CSphVector dRemaps; CSphRemapRange Range; Range.m_iStart = Range.m_iEnd = Range.m_iRemapStart = '\\'; dRemaps.Add ( Range ); m_tLC.AddRemaps ( dRemaps, FLAG_CODEPOINT_SPECIAL ); } } template < bool IS_UTF8 > void CSphTokenizerTraits::SetBufferPtr ( const char * sNewPtr ) { assert ( (BYTE*)sNewPtr>=m_pBuffer && (BYTE*)sNewPtr<=m_pBufferMax ); m_pCur = Min ( m_pBufferMax, Max ( m_pBuffer, (BYTE*)sNewPtr ) ); m_iAccum = 0; m_pAccum = m_sAccum; } template < bool IS_UTF8 > int CSphTokenizerTraits::SkipBlended() { if ( !m_pBlendEnd ) return 0; bool bQuery = m_bQueryMode; BYTE * pMax = m_pBufferMax; m_bQueryMode = false; m_pBufferMax = m_pBlendEnd; int iBlended = 0; while ( GetToken() ) iBlended++; m_bQueryMode = bQuery; m_pBufferMax = pMax; return iBlended; } /// adjusts blending magic when we're about to return a token (any token) /// returns false if current token should be skipped, true otherwise template < bool IS_UTF8 > bool CSphTokenizerTraits::BlendAdjust ( BYTE * pCur ) { // check if all we got is a bunch of blended characters (pure-blended case) if ( m_bBlended && !m_bNonBlended ) { // we either skip this token, or pretend it was normal // in both cases, clear the flag m_bBlended = false; // do we need to skip it? if ( m_bBlendSkipPure ) { m_pBlendStart = NULL; return false; } } m_bNonBlended = false; // adjust buffer pointers if ( m_bBlended && m_pBlendStart ) { // called once per blended token, on processing start // at this point, full blended token is in the accumulator // and we're about to return it m_pCur = m_pBlendStart; m_pBlendEnd = pCur; m_pBlendStart = NULL; m_bBlendedPart = true; } else if ( pCur>=m_pBlendEnd ) { // tricky bit, as at this point, token we're about to return // can either be a blended subtoken, or the next one m_bBlendedPart = ( m_pTokenStart!=NULL ) && ( m_pTokenStart0 && *pSrc ) *pDst++ = *pSrc++; *pDst++ = '\0'; } template < bool IS_UTF8 > BYTE * CSphTokenizerTraits::GetBlendedVariant () { // we can get called on several occasions // case 1, a new blended token was just accumulated if ( m_bBlended && !m_bBlendAdd ) { // fast path for the default case (trim_none) if ( m_uBlendVariants==BLEND_TRIM_NONE ) return m_sAccum; // analyze the full token, find non-blended bounds m_iBlendNormalStart = -1; m_iBlendNormalEnd = -1; // OPTIMIZE? we can skip this based on non-blended flag from adjust BYTE * p = m_sAccum; while ( *p ) { int iLast = (int)( p-m_sAccum ); int iCode = IS_UTF8 ? sphUTF8Decode ( p ) : *p++; if (!( m_tLC.ToLower ( iCode ) & FLAG_CODEPOINT_BLEND )) { m_iBlendNormalEnd = (int)( p-m_sAccum ); if ( m_iBlendNormalStart<0 ) m_iBlendNormalStart = iLast; } } // build todo mask // check and revert a few degenerate cases m_uBlendVariantsPending = m_uBlendVariants; if ( m_uBlendVariantsPending & BLEND_TRIM_BOTH ) { if ( m_iBlendNormalStart<0 ) { // no heading blended; revert BOTH to TAIL m_uBlendVariantsPending &= ~BLEND_TRIM_BOTH; m_uBlendVariantsPending |= BLEND_TRIM_TAIL; } else if ( m_iBlendNormalEnd<0 ) { // no trailing blended; revert BOTH to HEAD m_uBlendVariantsPending &= ~BLEND_TRIM_BOTH; m_uBlendVariantsPending |= BLEND_TRIM_HEAD; } } if ( m_uBlendVariantsPending & BLEND_TRIM_HEAD ) { // either no heading blended, or pure blended; revert HEAD to NONE if ( m_iBlendNormalStart<=0 ) { m_uBlendVariantsPending &= ~BLEND_TRIM_HEAD; m_uBlendVariantsPending |= BLEND_TRIM_NONE; } } if ( m_uBlendVariantsPending & BLEND_TRIM_TAIL ) { // either no trailing blended, or pure blended; revert TAIL to NONE if ( m_iBlendNormalEnd<=0 || m_sAccum[m_iBlendNormalEnd]==0 ) { m_uBlendVariantsPending &= ~BLEND_TRIM_TAIL; m_uBlendVariantsPending |= BLEND_TRIM_NONE; } } // ok, we are going to return a few variants after all, flag that // OPTIMIZE? add fast path for "single" variants? m_bBlendAdd = true; assert ( m_uBlendVariantsPending ); // we also have to stash the original blended token // because accumulator contents may get trashed by caller (say, when stemming) strncpy ( (char*)m_sAccumBlend, (char*)m_sAccum, sizeof(m_sAccumBlend) ); } // case 2, caller is checking for pending variants, have we even got any? if ( !m_bBlendAdd ) return false; // handle trim_none // this MUST be the first handler, so that we could avoid copying below, and just return the original accumulator if ( m_uBlendVariantsPending & BLEND_TRIM_NONE ) { m_uBlendVariantsPending &= ~BLEND_TRIM_NONE; m_bBlended = true; return m_sAccum; } // handle trim_both if ( m_uBlendVariantsPending & BLEND_TRIM_BOTH ) { m_uBlendVariantsPending &= ~BLEND_TRIM_BOTH; if ( m_iBlendNormalStart<0 ) m_uBlendVariantsPending |= BLEND_TRIM_TAIL; // no heading blended; revert BOTH to TAIL else if ( m_iBlendNormalEnd<0 ) m_uBlendVariantsPending |= BLEND_TRIM_HEAD; // no trailing blended; revert BOTH to HEAD else { assert ( m_iBlendNormalStart=0 ) { // FIXME! need we check for overshorts? CopySubstring ( m_sAccum, m_sAccumBlend+m_iBlendNormalStart, sizeof(m_sAccum) ); m_bBlended = true; return m_sAccum; } } // handle TRIM_TAIL if ( m_uBlendVariantsPending & BLEND_TRIM_TAIL ) { m_uBlendVariantsPending &= ~BLEND_TRIM_TAIL; if ( m_iBlendNormalEnd>0 ) { // FIXME! need we check for overshorts? CopySubstring ( m_sAccum, m_sAccumBlend, m_iBlendNormalEnd ); m_bBlended = true; return m_sAccum; } } // all clear, no more variants to go m_bBlendAdd = false; return NULL; } static inline bool IsModifier ( int iSymbol ) { return iSymbol=='^' || iSymbol=='$' || iSymbol=='=' || iSymbol=='*'; } static inline bool IsCapital ( int iCh ) { return iCh>='A' && iCh<='Z'; } template < bool IS_UTF8 > int CSphTokenizerTraits::CodepointArbitration ( int iCode, bool bWasEscaped, bool bSpaceAhead ) { ///////////////////////////// // indexing time arbitration ///////////////////////////// if ( !m_bQueryMode ) { int iSymbol = iCode & MASK_CODEPOINT; // detect sentence boundaries // FIXME! should use charset_table (or add a new directive) and support languages other than English if ( m_bDetectSentences ) { if ( iSymbol=='?' || iSymbol=='!' ) { // definitely a sentence boundary return MAGIC_CODE_SENTENCE | FLAG_CODEPOINT_SPECIAL; } if ( iSymbol=='.' ) { // inline dot ("in the U.K and"), not a boundary bool bInwordDot = ( sphIsAlpha ( m_pCur[0] ) || m_pCur[0]==',' ); // followed by a small letter or an opening paren, not a boundary // FIXME? might want to scan for more than one space // Yoyodine Inc. exists ... // Yoyodine Inc. (the company) .. bool bInphraseDot = ( sphIsSpace ( m_pCur[0] ) && ( ( 'a'<=m_pCur[1] && m_pCur[1]<='z' ) || ( m_pCur[1]=='(' && 'a'<=m_pCur[2] && m_pCur[2]<='z' ) ) ); // preceded by something that looks like a middle name, opening first name, salutation bool bMiddleName = false; switch ( m_iAccum ) { case 1: // 1-char capital letter // example: J. R. R. Tolkien, who wrote Hobbit ... // example: John D. Doe ... bMiddleName = IsCapital ( m_pCur[-2] ); break; case 2: // 2-char token starting with a capital if ( IsCapital ( m_pCur[-3] ) ) { // capital+small // example: Known as Mr. Doe ... if ( !IsCapital ( m_pCur[-2] ) ) bMiddleName = true; // known capital+capital (MR, DR, MS) if ( ( m_pCur[-3]=='M' && m_pCur[-2]=='R' ) || ( m_pCur[-3]=='M' && m_pCur[-2]=='S' ) || ( m_pCur[-3]=='D' && m_pCur[-2]=='R' ) ) bMiddleName = true; } break; case 3: // preceded by a known 3-byte token (MRS, DRS) // example: Survived by Mrs. Doe ... if ( ( m_sAccum[0]=='m' || m_sAccum[0]=='d' ) && m_sAccum[1]=='r' && m_sAccum[2]=='s' ) bMiddleName = true; break; } if ( !bInwordDot && !bInphraseDot && !bMiddleName ) { // sentence boundary return MAGIC_CODE_SENTENCE | FLAG_CODEPOINT_SPECIAL; } else { // just a character if ( ( iCode & MASK_FLAGS )==FLAG_CODEPOINT_SPECIAL ) return 0; // special only, not dual? then in this context, it is a separator else return iCode & ~( FLAG_CODEPOINT_SPECIAL | FLAG_CODEPOINT_DUAL ); // perhaps it was blended, so return the original code } } } // pass-through return iCode; } ////////////////////////// // query time arbitration ////////////////////////// if ( iCode & FLAG_CODEPOINT_NGRAM ) return iCode; // ngrams are handled elsewhere int iSymbol = iCode & MASK_CODEPOINT; // codepoints can't be blended and special at the same time if ( ( iCode & FLAG_CODEPOINT_BLEND ) && ( iCode & FLAG_CODEPOINT_SPECIAL ) ) { bool bBlend = bWasEscaped || // escaped characters should always act as blended ( m_bPhrase && !IsModifier ( iSymbol ) ) || // non-modifier special inside phrase ( m_iAccum && ( iSymbol=='@' || iSymbol=='/' || iSymbol=='-' ) ); // some specials in the middle of a token // clear special or blend flags iCode &= bBlend ? ~( FLAG_CODEPOINT_DUAL | FLAG_CODEPOINT_SPECIAL ) : ~( FLAG_CODEPOINT_DUAL | FLAG_CODEPOINT_BLEND ); } // escaped specials are not special // dash and dollar inside the word are not special // non-modifier specials within phrase are not special bool bDashInside = ( m_iAccum && iSymbol=='-' ); if ( iCode & FLAG_CODEPOINT_SPECIAL ) if ( bWasEscaped || bDashInside || ( m_iAccum && iSymbol=='$' && !bSpaceAhead ) || ( m_bPhrase && iSymbol!='"' && !IsModifier ( iSymbol ) ) ) { if ( iCode & FLAG_CODEPOINT_DUAL ) iCode &= ~( FLAG_CODEPOINT_SPECIAL | FLAG_CODEPOINT_DUAL ); else if ( bDashInside ) // if we return zero here, we will break the tokens like 'Ms-Dos' iCode &= ~( FLAG_CODEPOINT_SPECIAL ); else iCode = 0; } // if we didn't remove special by now, it must win if ( iCode & FLAG_CODEPOINT_DUAL ) { assert ( iCode & FLAG_CODEPOINT_SPECIAL ); iCode = iSymbol | FLAG_CODEPOINT_SPECIAL; } // ideally, all conflicts must be resolved here // well, at least most assert ( sphBitCount ( iCode & MASK_FLAGS )<=1 || ( iCode & FLAG_CODEPOINT_SYNONYM ) ); return iCode; } enum SynCheck_e { SYNCHECK_LESS, SYNCHECK_PARTIAL, SYNCHECK_EXACT, SYNCHECK_GREATER }; static inline SynCheck_e SynCheckPrefix ( const CSphSynonym & tCandidate, int iOff, const BYTE * sCur, int iBytes, bool bMaybeSeparator ) { const BYTE * sCand = ( (const BYTE*)tCandidate.m_sFrom.cstr() ) + iOff; while ( iBytes-->0 ) { if ( *sCand!=*sCur ) { // incoming synonym-only char vs. ending sequence (eg. 2nd slash in "OS/2/3"); we actually have a match if ( bMaybeSeparator && sCand[0]==MAGIC_SYNONYM_WHITESPACE && sCand[1]=='\0' ) return SYNCHECK_EXACT; // otherwise, it is a mismatch return ( *sCand<*sCur ) ? SYNCHECK_LESS : SYNCHECK_GREATER; } sCand++; sCur++; } // full match after a full separator if ( sCand[0]=='\0' ) return SYNCHECK_EXACT; // full match after my last synonym-only char if ( bMaybeSeparator && sCand[0]==MAGIC_SYNONYM_WHITESPACE && sCand[1]=='\0' ) return SYNCHECK_EXACT; // otherwise, partial match so far return SYNCHECK_PARTIAL; } static inline bool IsSeparator ( int iFolded, bool bFirst ) { // eternal separator if ( iFolded<0 || ( iFolded & MASK_CODEPOINT )==0 ) return true; // just a codepoint if (!( iFolded & MASK_FLAGS )) return false; // any magic flag, besides dual if (!( iFolded & FLAG_CODEPOINT_DUAL )) return true; // FIXME? n-grams currently also set dual if ( iFolded & FLAG_CODEPOINT_NGRAM ) return true; // dual depends on position return bFirst; } // handles escaped specials that are not in the character set // returns true if the codepoint should be processed as a simple codepoint, // returns false if it should be processed as a whitespace // for example: aaa\!bbb => aaa bbb static inline bool Special2Simple ( int & iCodepoint ) { if ( ( iCodepoint & FLAG_CODEPOINT_DUAL ) || !( iCodepoint & FLAG_CODEPOINT_SPECIAL ) ) { iCodepoint &= ~( FLAG_CODEPOINT_SPECIAL | FLAG_CODEPOINT_DUAL ); return true; } return false; } static inline bool IsWhitespace ( BYTE c ) { return ( c=='\0' || c==' ' || c=='\t' || c=='\r' || c=='\n' ); } static inline bool IsWhitespace ( int c ) { return ( c=='\0' || c==' ' || c=='\t' || c=='\r' || c=='\n' ); } template < bool IS_UTF8 > BYTE * CSphTokenizerTraits::GetTokenSyn () { assert ( m_dSynonyms.GetLength() ); bool bEscaped = m_bEscaped; BYTE * pCur; m_bTokenBoundary = false; for ( ;; ) { // initialize accumulators and range BYTE * pFirstSeparator = NULL; m_iAccum = 0; m_pAccum = m_sAccum; int iSynStart = 0; int iSynEnd = m_dSynonyms.GetLength()-1; int iSynOff = 0; int iLastCodepoint = 0; int iLastFolded = 0; BYTE * pRescan = NULL; int iExact = -1; BYTE * pExact = NULL; // main refinement loop for ( ;; ) { // store current position (to be able to restart from it on folded boundary) pCur = m_pCur; // get next codepoint int iCode = GetCodepoint(); // handle early-out if ( iCode<0 ) { // eof at token start? we're done if ( iSynOff==0 ) return NULL; // eof after whitespace? we already checked the candidate last time, so break if ( iLastFolded==0 ) break; } // fold codepoint (and lookup flags!) int iFolded = m_tLC.ToLower ( iCode ); // handle boundaries if ( m_bBoundary && ( iFolded==0 ) ) m_bTokenBoundary = true; m_bBoundary = ( iFolded & FLAG_CODEPOINT_BOUNDARY )!=0; // skip continuous whitespace if ( iLastFolded==0 && iFolded==0 ) continue; if ( bEscaped ) { if ( iCode=='\\' && iLastCodepoint!='\\' ) { iLastCodepoint = iCode; continue; } else if ( iLastCodepoint=='\\' && !Special2Simple ( iFolded ) ) { iLastCodepoint = 0; continue; } iLastCodepoint = iCode; } iFolded = CodepointArbitration ( iFolded, false, IsWhitespace ( *m_pCur ) ); iLastFolded = iFolded; // handle specials at the very word start if ( ( iFolded & FLAG_CODEPOINT_SPECIAL ) && m_iAccum==0 ) { m_bWasSpecial = !( iFolded & FLAG_CODEPOINT_NGRAM ); AccumCodepoint ( iFolded & MASK_CODEPOINT ); *m_pAccum = '\0'; m_iLastTokenLen = 1; m_iLastTokenBufferLen = m_pAccum-m_sAccum; //mmseg m_pTokenStart = pCur; m_pTokenEnd = m_pCur; return m_sAccum; } // handle specials bool bJustSpecial = ( iFolded & FLAG_CODEPOINT_SPECIAL ) && !( iFolded & FLAG_CODEPOINT_DUAL ) // OPTIMIZE? && !( iFolded & FLAG_CODEPOINT_SYNONYM ); // OPTIMIZE? // if candidate starts with something special, and turns out to be not a synonym, // we will need to rescan from current position later if ( iSynOff==0 ) pRescan = IsSeparator ( iFolded, true ) ? m_pCur : NULL; // accumulate folded token if ( !pFirstSeparator ) { if ( IsSeparator ( iFolded, m_iAccum==0 ) ) { if ( m_iAccum ) pFirstSeparator = pCur; } else { if ( m_iAccum==0 ) m_pTokenStart = pCur; AccumCodepoint ( iFolded & MASK_CODEPOINT ); } } // accumulate next raw synonym symbol to refine // note that we need a special check for whitespace here, to avoid "MS*DOS" being treated as "MS DOS" synonym BYTE sTest[4]; int iTest; int iMasked = ( iCode & MASK_CODEPOINT ); if ( iFolded<=0 || bJustSpecial ) { sTest[0] = MAGIC_SYNONYM_WHITESPACE; iTest = 1; if (!( iMasked==' ' || iMasked=='\t' )) { sTest[1] = '\0'; iTest = 2; } } else { if ( IsUtf8() ) { iTest = sphUTF8Encode ( sTest, iMasked ); } else { iTest = 1; sTest[0] = BYTE(iMasked); } } // refine synonyms range #define LOC_RETURN_SYNONYM(_idx) \ { \ m_pTokenEnd = pCur; \ if ( bJustSpecial || ( iFolded & FLAG_CODEPOINT_SPECIAL )!=0 ) m_pCur = pCur; \ strncpy ( (char*)m_sAccum, m_dSynonyms[_idx].m_sTo.cstr(), sizeof(m_sAccum) ); \ m_iLastTokenLen = m_dSynonyms[_idx].m_iToLen; \ m_iLastTokenBufferLen = m_dSynonyms[_idx].m_sTo.Length(); /* mmseg */ \ return m_sAccum; \ } #define LOC_REFINE_BREAK() \ { \ if ( iExact>=0 ) { m_pCur = pCur = pExact; LOC_RETURN_SYNONYM ( iExact ); } \ break; \ } // if this is the first symbol, use prebuilt lookup table to speedup initial range search if ( iSynOff==0 ) { iSynStart = m_dSynStart[sTest[0]]; iSynEnd = m_dSynEnd[sTest[0]]; if ( iSynStart>iSynEnd ) break; } // this is to catch intermediate separators (eg. "OS/2/3") bool bMaybeSeparator = ( iFolded & FLAG_CODEPOINT_SYNONYM )!=0 || ( iFolded<0 ); SynCheck_e eStart = SynCheckPrefix ( m_dSynonyms[iSynStart], iSynOff, sTest, iTest, bMaybeSeparator ); if ( eStart==SYNCHECK_EXACT ) { if ( iSynStart==iSynEnd ) LOC_RETURN_SYNONYM ( iSynStart ); iExact = iSynStart; pExact = pCur; } if ( eStart==SYNCHECK_GREATER || ( iSynStart==iSynEnd && eStart!=SYNCHECK_PARTIAL ) ) LOC_REFINE_BREAK(); SynCheck_e eEnd = SynCheckPrefix ( m_dSynonyms[iSynEnd], iSynOff, sTest, iTest, bMaybeSeparator ); if ( eEnd==SYNCHECK_LESS ) LOC_REFINE_BREAK(); if ( eEnd==SYNCHECK_EXACT ) { iExact = iSynEnd; pExact = pCur; } // refine left boundary if ( eStart!=SYNCHECK_PARTIAL && eStart!=SYNCHECK_EXACT ) { assert ( eStart==SYNCHECK_LESS ); int iL = iSynStart; int iR = iSynEnd; SynCheck_e eL = eStart; SynCheck_e eR = eEnd; while ( iR-iL>1 ) { int iM = iL + (iR-iL)/2; SynCheck_e eMid = SynCheckPrefix ( m_dSynonyms[iM], iSynOff, sTest, iTest, bMaybeSeparator ); if ( eMid==SYNCHECK_LESS ) { iL = iM; eL = eMid; } else { iR = iM; eR = eMid; } } assert ( eL==SYNCHECK_LESS ); assert ( eR!=SYNCHECK_LESS ); assert ( iR-iL==1 ); if ( eR==SYNCHECK_GREATER ) LOC_REFINE_BREAK(); if ( eR==SYNCHECK_EXACT && iR==iSynEnd ) LOC_RETURN_SYNONYM ( iR ); assert ( eR==SYNCHECK_PARTIAL || eR==SYNCHECK_EXACT ); iSynStart = iR; eStart = eR; } // refine right boundary if ( eEnd!=SYNCHECK_PARTIAL && eEnd!=SYNCHECK_EXACT ) { assert ( eEnd==SYNCHECK_GREATER ); int iL = iSynStart; int iR = iSynEnd; SynCheck_e eL = eStart; SynCheck_e eR = eEnd; while ( iR-iL>1 ) { int iM = iL + (iR-iL)/2; SynCheck_e eMid = SynCheckPrefix ( m_dSynonyms[iM], iSynOff, sTest, iTest, bMaybeSeparator ); if ( eMid==SYNCHECK_GREATER ) { iR = iM; eR = eMid; } else { iL = iM; eL = eMid; } } assert ( eR==SYNCHECK_GREATER ); assert ( eL!=SYNCHECK_GREATER ); assert ( iR-iL==1 ); if ( eL==SYNCHECK_LESS ) LOC_REFINE_BREAK(); if ( eL==SYNCHECK_EXACT && iL==iSynStart ) LOC_RETURN_SYNONYM ( iL ); assert ( eL==SYNCHECK_PARTIAL || eL==SYNCHECK_EXACT ); iSynEnd = iL; eEnd = eL; } // handle eof if ( iCode<0 ) break; // we still have a partial synonym match, continue; iSynOff += iTest; } // at this point, that was not a synonym if ( pRescan ) { m_pCur = pRescan; continue; } // at this point, it also started with a valid char assert ( m_iAccum>0 ); // find the proper separator if ( !pFirstSeparator ) { int iLast = 0; // if there was none, scan until found for ( ;; ) { pCur = m_pCur; int iCode = *pCur; int iFolded = m_tLC.ToLower ( GetCodepoint() ); if ( iFolded<0 ) break; // eof if ( bEscaped ) { if ( iCode=='\\' && iLast!='\\' ) { iLast = iCode; continue; } if ( iLast=='\\' && !Special2Simple ( iFolded ) ) break; iLast = iCode; } iFolded = CodepointArbitration ( iFolded, false, IsWhitespace ( *m_pCur ) ); if ( IsSeparator ( iFolded, false ) ) { if ( iFolded!=0 ) m_pCur = pCur; // force rescan break; } AccumCodepoint ( iFolded & MASK_CODEPOINT ); } } else { // if there was, token is ready but we should restart from that separator m_pCur = pFirstSeparator; pCur = m_pCur; } // return accumulated token if ( m_iAccum dRemaps; CSphCharsetDefinitionParser tParser; if ( !tParser.Parse ( sConfig, dRemaps ) ) { sError = tParser.GetLastError(); return false; } // check ARRAY_FOREACH ( i, dRemaps ) { const CSphRemapRange & r = dRemaps[i]; if ( !bCanRemap && r.m_iStart!=r.m_iRemapStart ) { sError.SetSprintf ( "%s characters must not be remapped (map-from=U+%x, map-to=U+%x)", sSource, r.m_iStart, r.m_iRemapStart ); return false; } for ( int j=r.m_iStart; j<=r.m_iEnd; j++ ) if ( m_tLC.ToLower(j) ) { sError.SetSprintf ( "%s characters must not be referenced anywhere else (code=U+%x)", sSource, j ); return false; } if ( bCanRemap ) for ( int j=r.m_iRemapStart; j<=r.m_iRemapStart + r.m_iEnd - r.m_iStart; j++ ) if ( m_tLC.ToLower(j) ) { sError.SetSprintf ( "%s characters must not be referenced anywhere else (code=U+%x)", sSource, j ); return false; } } // add mapping m_tLC.AddRemaps ( dRemaps, uFlags ); return true; } bool ISphTokenizer::SetBoundary ( const char * sConfig, CSphString & sError ) { return RemapCharacters ( sConfig, FLAG_CODEPOINT_BOUNDARY, "phrase boundary", false, sError ); } bool ISphTokenizer::SetIgnoreChars ( const char * sConfig, CSphString & sError ) { return RemapCharacters ( sConfig, FLAG_CODEPOINT_IGNORE, "ignored", false, sError ); } bool ISphTokenizer::SetBlendChars ( const char * sConfig, CSphString & sError ) { return RemapCharacters ( sConfig, FLAG_CODEPOINT_BLEND, "blend", true, sError ); } static bool sphStrncmp ( const char * sCheck, int iCheck, const char * sRef ) { return ( iCheck==(int)strlen(sRef) && memcmp ( sCheck, sRef, iCheck )==0 ); } bool ISphTokenizer::SetBlendMode ( const char * sMode, CSphString & sError ) { if ( !sMode || !*sMode ) { m_uBlendVariants = BLEND_TRIM_NONE; m_bBlendSkipPure = false; return true; } m_uBlendVariants = 0; const char * p = sMode; while ( *p ) { while ( !sphIsAlpha(*p) ) p++; if ( !*p ) break; const char * sTok = p; while ( sphIsAlpha(*p) ) p++; if ( sphStrncmp ( sTok, p-sTok, "trim_none" ) ) m_uBlendVariants |= BLEND_TRIM_NONE; else if ( sphStrncmp ( sTok, p-sTok, "trim_head" ) ) m_uBlendVariants |= BLEND_TRIM_HEAD; else if ( sphStrncmp ( sTok, p-sTok, "trim_tail" ) ) m_uBlendVariants |= BLEND_TRIM_TAIL; else if ( sphStrncmp ( sTok, p-sTok, "trim_both" ) ) m_uBlendVariants |= BLEND_TRIM_BOTH; else if ( sphStrncmp ( sTok, p-sTok, "skip_pure" ) ) m_bBlendSkipPure = true; else { sError.SetSprintf ( "unknown blend_mode option near '%s'", sTok ); return false; } } if ( !m_uBlendVariants ) { sError.SetSprintf ( "blend_mode must define at least one variant to index" ); m_uBlendVariants = BLEND_TRIM_NONE; m_bBlendSkipPure = false; return false; } return true; } ///////////////////////////////////////////////////////////////////////////// CSphTokenizer_SBCS::CSphTokenizer_SBCS () { CSphString sTmp; SetCaseFolding ( SPHINX_DEFAULT_SBCS_TABLE, sTmp ); } void CSphTokenizer_SBCS::SetBuffer ( BYTE * sBuffer, int iLength ) { // check that old one is over and that new length is sane assert ( iLength>=0 ); // set buffer m_pBuffer = sBuffer; m_pBufferMax = sBuffer + iLength; m_pCur = sBuffer; m_iOvershortCount = 0; m_bBoundary = m_bTokenBoundary = false; } BYTE * CSphTokenizer_SBCS::GetToken () { m_bWasSpecial = false; m_bBlended = false; m_iOvershortCount = 0; m_bTokenBoundary = false; if ( m_dSynonyms.GetLength() ) return GetTokenSyn (); // return pending blending variants BYTE * pVar = GetBlendedVariant (); if ( pVar ) return pVar; m_bBlendedPart = ( m_pBlendEnd!=NULL ); const bool bUseEscape = m_bEscaped; for ( ;; ) { // memorize buffer start BYTE * pCur = m_pCur; // get next codepoint, real or virtual int iCodepoint = 0; int iCode = 0; bool bWasEscaped = false; // whether current char was escaped if ( m_pCur=m_pBufferMax ? m_pCur : pCur; if ( !BlendAdjust ( pCur ) ) continue; if ( m_bBlended ) return GetBlendedVariant(); return m_sAccum; } // handle specials bool bSpecial = ( iCode & FLAG_CODEPOINT_SPECIAL )!=0; bool bNoBlend = !( iCode & FLAG_CODEPOINT_BLEND ); iCode &= MASK_CODEPOINT; if ( bSpecial ) { // skip short words if ( m_iAccum0 ); if ( m_iAccumCloneBase ( this, bEscaped ); return pClone; } ///////////////////////////////////////////////////////////////////////////// CSphTokenizer_UTF8::CSphTokenizer_UTF8 () { CSphString sTmp; SetCaseFolding ( SPHINX_DEFAULT_UTF8_TABLE, sTmp ); } void CSphTokenizer_UTF8::SetBuffer ( BYTE * sBuffer, int iLength ) { // check that old one is over and that new length is sane assert ( iLength>=0 ); // set buffer m_pBuffer = sBuffer; m_pBufferMax = sBuffer + iLength; m_pCur = sBuffer; // fixup embedded zeroes with spaces for ( BYTE * p = m_pBuffer; p < m_pBufferMax; p++ ) if ( !*p ) *p = ' '; m_iOvershortCount = 0; m_bBoundary = m_bTokenBoundary = false; } BYTE * CSphTokenizer_UTF8::GetToken () { m_bWasSpecial = false; m_bBlended = false; m_iOvershortCount = 0; m_bTokenBoundary = false; if ( m_dSynonyms.GetLength() ) return GetTokenSyn (); // return pending blending variants BYTE * pVar = GetBlendedVariant (); if ( pVar ) return pVar; m_bBlendedPart = ( m_pBlendEnd!=NULL ); // whether this tokenizer supports escaping const bool bUseEscape = m_bEscaped; // in query mode, lets capture (soft-whitespace hard-whitespace) sequences and adjust overshort counter // sample queries would be (one NEAR $$$) or (one | $$$ two) where $ is not a valid character bool bGotNonToken = ( !m_bQueryMode || m_bPhrase ); // only do this in query mode, never in indexing mode, never within phrases bool bGotSoft = false; // hey Beavis he said soft huh huhhuh for ( ;; ) { // get next codepoint BYTE * pCur = m_pCur; // to redo special char, if there's a token already int iCodePoint = GetCodepoint(); // advances m_pCur int iCode = m_tLC.ToLower ( iCodePoint ); // handle escaping bool bWasEscaped = ( bUseEscape && iCodePoint=='\\' ); // whether current codepoint was escaped if ( bWasEscaped ) { iCodePoint = GetCodepoint(); iCode = m_tLC.ToLower ( iCodePoint ); if ( !Special2Simple ( iCode ) ) iCode = 0; } // handle eof if ( iCode<0 ) { // skip trailing short word FlushAccum (); if ( m_iLastTokenLenCloneBase ( this, bEscaped ); return pClone; } int CSphTokenizer_UTF8::GetCodepointLength ( int iCode ) const { if ( iCode<128 ) return 1; int iBytes = 0; while ( iCode & 0x80 ) { iBytes++; iCode <<= 1; } assert ( iBytes>=2 && iBytes<=4 ); return iBytes; } ///////////////////////////////////////////////////////////////////////////// bool CSphTokenizer_UTF8Ngram::SetNgramChars ( const char * sConfig, CSphString & sError ) { CSphVector dRemaps; CSphCharsetDefinitionParser tParser; if ( !tParser.Parse ( sConfig, dRemaps ) ) { sError = tParser.GetLastError(); return false; } m_tLC.AddRemaps ( dRemaps, FLAG_CODEPOINT_NGRAM | FLAG_CODEPOINT_SPECIAL ); // !COMMIT support other n-gram lengths than 1 m_sNgramCharsStr = sConfig; return true; } void CSphTokenizer_UTF8Ngram::SetNgramLen ( int iLen ) { assert ( iLen>0 ); m_iNgramLen = iLen; } BYTE * CSphTokenizer_UTF8Ngram::GetToken () { // !COMMIT support other n-gram lengths than 1 assert ( m_iNgramLen==1 ); return CSphTokenizer_UTF8::GetToken (); } #if USE_MMSEG ////////////////////////////////////////////////////////////////////////// CSphTokenizer_UTF8MMSeg::CSphTokenizer_UTF8MMSeg () :CSphTokenizer_UTF8(), m_segoffset(0) { m_dictpath = NULL; d_ = new CSphTokenizer_zh_CN_UTF8_Private(); //FIXCJK CSphVector dRemaps; /* */ dRemaps.Add ( CSphRemapRange ( 0x4e00, 0x9fff, 0x4e00 ) ); dRemaps.Add ( CSphRemapRange ( 0xFF00, 0xFFFF, 0xFF00 ) ); dRemaps.Add ( CSphRemapRange ( 0x3000, 0x303F, 0x3000 ) ); m_tLC.AddRemaps ( dRemaps, FLAG_CODEPOINT_NGRAM | FLAG_CODEPOINT_SPECIAL ); // !COMMIT support other n-gram lengths than 1 //ENDCJK this->m_pAccumSeg = m_sAccumSeg; m_iLastTokenBufferLen = 0; m_iLastTokenLenMMSeg = 0; } void CSphTokenizer_UTF8MMSeg::SetBuffer ( BYTE * sBuffer, int iLength ) { CSphTokenizer_UTF8::SetBuffer(sBuffer, iLength); css::Segmenter* seg = d_->GetSegmenter(m_dictpath.cstr()); if(seg) seg->setBuffer((u1*)m_pBuffer, iLength); else sphDie ( " Tokenizer initialization failure. " ); m_segoffset = 0; m_segToken = (char*)m_pCur; } bool CSphTokenizer_UTF8MMSeg::IsSegment(const BYTE * pCur) { size_t offset = pCur - m_pBuffer; //if(offset == 0) return false; css::Segmenter* seg = d_->GetSegmenter(m_dictpath.cstr()); //TODO fill blank here if(seg){ u2 len = 0, symlen = 0; const char* tok = NULL; while(m_segoffset < offset) { tok = (const char*)seg->peekToken(len, symlen); seg->popToken(len); m_segoffset += len; if(tok == NULL || len==0){ //break? break; } } return (m_segoffset == offset); } //end if seg return true; } BYTE * CSphTokenizer_UTF8MMSeg::GetToken () { m_iLastTokenLenMMSeg = 0; //BYTE* tok = CSphTokenizer_UTF8::GetToken(); while(!IsSegment(m_pCur) || m_pAccumSeg == m_sAccumSeg) { BYTE* tok = CSphTokenizer_UTF8::GetToken(); if(!tok){ m_iLastTokenLenMMSeg = 0; return NULL; } if(m_pAccumSeg == m_sAccumSeg) m_segToken = (char*)m_pTokenStart; if ( (m_pAccumSeg - m_sAccumSeg)CloneBase ( this, bEscaped ); pClone->m_dictpath = m_dictpath; return pClone; } const BYTE* CSphTokenizer_UTF8MMSeg::GetThesaurus(BYTE * sBuffer, int iLength ) { css::Segmenter* seg = d_->GetSegmenter(m_dictpath.cstr()); if(seg) return (const BYTE*)seg->thesaurus((const char*)sBuffer, iLength); return NULL; } #endif ////////////////////////////////////////////////////////////////////////// CSphTokenizer_Filter::CSphTokenizer_Filter ( ISphTokenizer * pTokenizer, const CSphMultiformContainer * pContainer ) : m_pTokenizer ( pTokenizer ) , m_pMultiWordforms ( pContainer ) , m_iStoredStart ( 0 ) , m_iStoredLen ( 0 ) , m_bBuildMultiform ( false ) , m_pLastToken ( NULL ) { assert ( pTokenizer && pContainer ); m_dStoredTokens.Resize ( pContainer->m_iMaxTokens + 1 ); m_sTokenizedMultiform[0] = '\0'; } CSphTokenizer_Filter::~CSphTokenizer_Filter () { SafeDelete ( m_pTokenizer ); } void CSphTokenizer_Filter::FillTokenInfo ( StoredToken_t * pToken ) { pToken->m_bBoundary = m_pTokenizer->GetBoundary (); pToken->m_bSpecial = m_pTokenizer->WasTokenSpecial (); pToken->m_iOvershortCount = m_pTokenizer->GetOvershortCount (); pToken->m_iTokenLen = m_pTokenizer->GetLastTokenLen (); pToken->m_szTokenStart = m_pTokenizer->GetTokenStart (); pToken->m_szTokenEnd = m_pTokenizer->GetTokenEnd (); pToken->m_pBufferPtr = m_pTokenizer->GetBufferPtr (); } BYTE * CSphTokenizer_Filter::GetToken () { m_sTokenizedMultiform[0] = '\0'; BYTE * pToken = ( m_iStoredLen>0 ) ? m_dStoredTokens [m_iStoredStart].m_sToken : m_pTokenizer->GetToken (); if ( !pToken ) { memset ( &m_tLastToken, 0, sizeof ( m_tLastToken ) ); m_pLastToken = &m_tLastToken; return NULL; } int iSize = m_dStoredTokens.GetLength (); CSphMultiforms ** pWordforms = m_pMultiWordforms->m_Hash ( (const char *)pToken ); if ( !pWordforms ) { if ( m_iStoredLen ) { m_pLastToken = &(m_dStoredTokens[m_iStoredStart]); m_iStoredLen--; m_iStoredStart = (m_iStoredStart + 1) % iSize; } else { FillTokenInfo ( &m_tLastToken ); m_pLastToken = &m_tLastToken; bool bBlended = m_pTokenizer->TokenIsBlended(); m_bBlended = bBlended; m_bNonBlended = !bBlended; } return pToken; } if ( !m_iStoredLen ) { FillTokenInfo ( &m_dStoredTokens[m_iStoredStart] ); strcpy ( (char *)m_dStoredTokens[m_iStoredStart].m_sToken, (const char *)pToken ); // NOLINT m_iStoredLen++; } int iTokensNeeded = (*pWordforms)->m_iMaxTokens - m_iStoredLen + 1; for ( int i = 0; i < iTokensNeeded; i++ ) { pToken = m_pTokenizer->GetToken (); if ( !pToken ) break; int iIndex = (m_iStoredStart+m_iStoredLen) % iSize; FillTokenInfo ( &(m_dStoredTokens[iIndex]) ); strcpy ( (char *)m_dStoredTokens[iIndex].m_sToken, (const char *)pToken ); // NOLINT m_iStoredLen++; } if ( !m_iStoredLen ) return NULL; if ( m_iStoredLen<=(*pWordforms)->m_iMinTokens ) { m_pLastToken = &(m_dStoredTokens [m_iStoredStart]); m_iStoredLen--; m_iStoredStart = (m_iStoredStart + 1) % iSize; return m_pLastToken->m_sToken; } ARRAY_FOREACH ( i, (*pWordforms)->m_dWordforms ) { CSphMultiform * pCurForm = (*pWordforms)->m_dWordforms[i]; if ( m_iStoredLen<=pCurForm->m_dTokens.GetLength () ) continue; bool bFound = true; for ( int j = 0; j < pCurForm->m_dTokens.GetLength (); j++ ) { int iIndex = ( m_iStoredStart + j + 1 ) % iSize; const char * szStored = (const char*)m_dStoredTokens[iIndex].m_sToken; const char * szNormal = pCurForm->m_dTokens[j].cstr (); if ( *szNormal!=*szStored || strcasecmp ( szNormal, szStored ) ) { bFound = false; break; } } if ( bFound ) { int iTokensPerForm = 1+pCurForm->m_dTokens.GetLength(); m_tLastToken.m_bBoundary = false; m_tLastToken.m_bSpecial = false; m_tLastToken.m_iOvershortCount = m_dStoredTokens[m_iStoredStart].m_iOvershortCount; m_tLastToken.m_iTokenLen = pCurForm->m_iNormalTokenLen; m_tLastToken.m_szTokenStart = m_dStoredTokens[m_iStoredStart].m_szTokenStart; m_tLastToken.m_szTokenEnd = m_dStoredTokens[ ( m_iStoredStart+iTokensPerForm-1 ) % iSize ].m_szTokenEnd; m_tLastToken.m_pBufferPtr = m_dStoredTokens[ ( m_iStoredStart+iTokensPerForm-1 ) % iSize ].m_pBufferPtr; m_pLastToken = &m_tLastToken; if ( m_bBuildMultiform ) { BYTE * pOut = m_sTokenizedMultiform; BYTE * pMax = pOut + sizeof(m_sTokenizedMultiform); for ( int i=0; i=0 ); strcpy ( (char *)m_sOutMultiform, pCurForm->m_sNormalForm.cstr () ); // NOLINT return m_sOutMultiform; } } pToken = m_dStoredTokens[m_iStoredStart].m_sToken; m_pLastToken = &(m_dStoredTokens[m_iStoredStart]); m_iStoredStart = (m_iStoredStart + 1) % iSize; m_iStoredLen--; return pToken; } ISphTokenizer * CSphTokenizer_Filter::Clone ( bool bEscaped ) const { ISphTokenizer * pClone = m_pTokenizer->Clone ( bEscaped ); return CreateTokenFilter ( pClone, m_pMultiWordforms ); } void CSphTokenizer_Filter::SetBufferPtr ( const char * sNewPtr ) { m_pLastToken = NULL; m_iStoredLen = 0; m_iStoredStart = 0; m_pTokenizer->SetBufferPtr ( sNewPtr ); } void CSphTokenizer_Filter::SetBuffer ( BYTE * sBuffer, int iLength ) { m_pTokenizer->SetBuffer ( sBuffer, iLength ); SetBufferPtr ( (const char *)sBuffer ); } ///////////////////////////////////////////////////////////////////////////// // FILTER ///////////////////////////////////////////////////////////////////////////// CSphFilterSettings::CSphFilterSettings () : m_sAttrName ( "" ) , m_bExclude ( false ) , m_uMinValue ( 0 ) , m_uMaxValue ( UINT_MAX ) , m_pValues ( NULL ) , m_nValues ( 0 ) {} CSphFilterSettings::CSphFilterSettings ( const CSphFilterSettings & rhs ) { assert ( 0 ); (*this) = rhs; } void CSphFilterSettings::SetExternalValues ( const SphAttr_t * pValues, int nValues ) { m_pValues = pValues; m_nValues = nValues; } bool CSphFilterSettings::operator == ( const CSphFilterSettings & rhs ) const { // check name, mode, type if ( m_sAttrName!=rhs.m_sAttrName || m_bExclude!=rhs.m_bExclude || m_eType!=rhs.m_eType ) return false; switch ( m_eType ) { case SPH_FILTER_RANGE: return m_uMinValue==rhs.m_uMinValue && m_uMaxValue==rhs.m_uMaxValue; case SPH_FILTER_VALUES: if ( m_dValues.GetLength()!=rhs.m_dValues.GetLength() ) return false; ARRAY_FOREACH ( i, m_dValues ) if ( m_dValues[i]!=rhs.m_dValues[i] ) return false; return true; default: assert ( 0 && "internal error: unhandled filter type in comparison" ); return false; } } ///////////////////////////////////////////////////////////////////////////// // QUERY ///////////////////////////////////////////////////////////////////////////// CSphQuery::CSphQuery () : m_sIndexes ( "*" ) , m_sQuery ( "" ) , m_sRawQuery ( "" ) , m_iOffset ( 0 ) , m_iLimit ( 20 ) , m_pWeights ( NULL ) , m_iWeights ( 0 ) , m_eMode ( SPH_MATCH_ALL ) , m_eRanker ( SPH_RANK_DEFAULT ) , m_eSort ( SPH_SORT_RELEVANCE ) , m_iMaxMatches ( 1000 ) , m_eGroupFunc ( SPH_GROUPBY_ATTR ) , m_sGroupSortBy ( "@groupby desc" ) , m_sGroupDistinct ( "" ) , m_iCutoff ( 0 ) , m_iRetryCount ( 0 ) , m_iRetryDelay ( 0 ) , m_bGeoAnchor ( false ) , m_fGeoLatitude ( 0.0f ) , m_fGeoLongitude ( 0.0f ) , m_uMaxQueryMsec ( 0 ) , m_sComment ( "" ) , m_sSelect ( "" ) , m_bReverseScan ( false ) , m_iSQLSelectStart ( -1 ) , m_iSQLSelectEnd ( -1 ) , m_iOldVersion ( 0 ) , m_iOldGroups ( 0 ) , m_pOldGroups ( NULL ) , m_iOldMinTS ( 0 ) , m_iOldMaxTS ( UINT_MAX ) , m_iOldMinGID ( 0 ) , m_iOldMaxGID ( UINT_MAX ) , m_eCollation ( SPH_COLLATION_DEFAULT ) , m_bAgent ( false ) {} CSphQuery::~CSphQuery () { } int CSphQuery::GetIndexWeight ( const char * sName ) const { ARRAY_FOREACH ( i, m_dIndexWeights ) if ( m_dIndexWeights[i].m_sName==sName ) return m_dIndexWeights[i].m_iValue; return 1; } ////////////////////////////////////////////////////////////////////////// struct SelectBounds_t { int m_iStart; int m_iEnd; }; #define YYSTYPE SelectBounds_t #include "yysphinxselect.h" class SelectParser_t { public: int GetToken ( YYSTYPE * lvalp ); void AddItem ( YYSTYPE * pExpr, ESphAggrFunc eAggrFunc=SPH_AGGR_NONE, YYSTYPE * pStart=NULL, YYSTYPE * pEnd=NULL ); void AddItem ( const char * pToken, YYSTYPE * pStart=NULL, YYSTYPE * pEnd=NULL ); void AliasLastItem ( YYSTYPE * pAlias ); private: void AutoAlias ( CSphQueryItem & tItem, YYSTYPE * pStart, YYSTYPE * pEnd ); public: CSphString m_sParserError; const char * m_pLastTokenStart; const char * m_pStart; const char * m_pCur; CSphQuery * m_pQuery; }; int yylex ( YYSTYPE * lvalp, SelectParser_t * pParser ) { return pParser->GetToken ( lvalp );} void yyerror ( SelectParser_t * pParser, const char * sMessage ) { pParser->m_sParserError.SetSprintf ( "%s near '%s'", sMessage, pParser->m_pLastTokenStart ); } #include "yysphinxselect.c" int SelectParser_t::GetToken ( YYSTYPE * lvalp ) { // skip whitespace, check eof while ( isspace ( *m_pCur ) ) m_pCur++; if ( !*m_pCur ) return 0; m_pLastTokenStart = m_pCur; lvalp->m_iStart = m_pCur-m_pStart; // check for constant if ( isdigit ( *m_pCur ) ) { char * pEnd = NULL; double fDummy; // to avoid gcc unused result warning fDummy = strtod ( m_pCur, &pEnd ); m_pCur = pEnd; lvalp->m_iEnd = m_pCur-m_pStart; return SEL_TOKEN; } // check for token if ( sphIsAttr ( m_pCur[0] ) || ( m_pCur[0]=='@' && sphIsAttr ( m_pCur[1] ) && !isdigit ( m_pCur[1] ) ) ) { m_pCur++; while ( sphIsAttr ( *m_pCur ) ) m_pCur++; lvalp->m_iEnd = m_pCur-m_pStart; #define LOC_CHECK(_str,_len,_ret) \ if ( lvalp->m_iEnd==_len+lvalp->m_iStart && strncasecmp ( m_pStart+lvalp->m_iStart, _str, _len )==0 ) return _ret; LOC_CHECK ( "ID", 2, SEL_ID ); LOC_CHECK ( "AS", 2, SEL_AS ); LOC_CHECK ( "OR", 2, TOK_OR ); LOC_CHECK ( "AND", 3, TOK_AND ); LOC_CHECK ( "NOT", 3, TOK_NOT ); LOC_CHECK ( "AVG", 3, SEL_AVG ); LOC_CHECK ( "MIN", 3, SEL_MIN ); LOC_CHECK ( "MAX", 3, SEL_MAX ); LOC_CHECK ( "SUM", 3, SEL_SUM ); LOC_CHECK ( "COUNT", 5, SEL_COUNT ); LOC_CHECK ( "DISTINCT", 8, SEL_DISTINCT ); LOC_CHECK ( "WEIGHT", 6, SEL_WEIGHT ); #undef LOC_CHECK return SEL_TOKEN; } // check for equality checks lvalp->m_iEnd = 1+lvalp->m_iStart; switch ( *m_pCur ) { case '<': m_pCur++; if ( *m_pCur=='>' ) { m_pCur++; lvalp->m_iEnd++; return TOK_NE; } if ( *m_pCur=='=' ) { m_pCur++; lvalp->m_iEnd++; return TOK_LTE; } return '<'; case '>': m_pCur++; if ( *m_pCur=='=' ) { m_pCur++; lvalp->m_iEnd++; return TOK_GTE; } return '>'; case '=': m_pCur++; if ( *m_pCur=='=' ) { m_pCur++; lvalp->m_iEnd++; } return TOK_EQ; } // return char as a token return *m_pCur++; } void SelectParser_t::AutoAlias ( CSphQueryItem & tItem, YYSTYPE * pStart, YYSTYPE * pEnd ) { if ( pStart && pEnd ) { tItem.m_sAlias.SetBinary ( m_pStart + pStart->m_iStart, pEnd->m_iEnd - pStart->m_iStart ); tItem.m_sAlias.ToLower(); } else tItem.m_sAlias = tItem.m_sExpr; } void SelectParser_t::AddItem ( YYSTYPE * pExpr, ESphAggrFunc eAggrFunc, YYSTYPE * pStart, YYSTYPE * pEnd ) { CSphQueryItem & tItem = m_pQuery->m_dItems.Add(); tItem.m_sExpr.SetBinary ( m_pStart + pExpr->m_iStart, pExpr->m_iEnd - pExpr->m_iStart ); tItem.m_sExpr.ToLower(); tItem.m_eAggrFunc = eAggrFunc; AutoAlias ( tItem, pStart, pEnd ); } void SelectParser_t::AddItem ( const char * pToken, YYSTYPE * pStart, YYSTYPE * pEnd ) { CSphQueryItem & tItem = m_pQuery->m_dItems.Add(); tItem.m_sExpr = pToken; tItem.m_eAggrFunc = SPH_AGGR_NONE; tItem.m_sExpr.ToLower(); AutoAlias ( tItem, pStart, pEnd ); } void SelectParser_t::AliasLastItem ( YYSTYPE * pAlias ) { if ( pAlias ) { CSphQueryItem & tItem = m_pQuery->m_dItems.Last(); tItem.m_sAlias.SetBinary ( m_pStart + pAlias->m_iStart, pAlias->m_iEnd - pAlias->m_iStart ); tItem.m_sAlias.ToLower(); } } bool CSphQuery::ParseSelectList ( CSphString & sError ) { m_dItems.Reset (); if ( m_sSelect.IsEmpty() ) return true; // empty is ok; will just return everything SelectParser_t tParser; tParser.m_pStart = m_sSelect.cstr(); tParser.m_pCur = m_sSelect.cstr(); tParser.m_pQuery = this; yyparse ( &tParser ); sError = tParser.m_sParserError; return sError.IsEmpty (); } ///////////////////////////////////////////////////////////////////////////// // SCHEMA ///////////////////////////////////////////////////////////////////////////// static CSphString sphDumpAttr ( const CSphColumnInfo & tAttr ) { CSphString sRes; sRes.SetSprintf ( "%s %s:%d@%d", sphTypeName ( tAttr.m_eAttrType ), tAttr.m_sName.cstr(), tAttr.m_tLocator.m_iBitCount, tAttr.m_tLocator.m_iBitOffset ); return sRes; } bool CSphSchema::CompareTo ( const CSphSchema & rhs, CSphString & sError ) const { // check attr count if ( GetAttrsCount()!=rhs.GetAttrsCount() ) { sError.SetSprintf ( "attribute count mismatch (me=%s, in=%s, myattrs=%d, inattrs=%d)", m_sName.cstr(), rhs.m_sName.cstr(), GetAttrsCount(), rhs.GetAttrsCount() ); return false; } // check attrs ARRAY_FOREACH ( i, m_dAttrs ) if (!( rhs.m_dAttrs[i]==m_dAttrs[i] )) { sError.SetSprintf ( "attribute mismatch (me=%s, in=%s, idx=%d, myattr=%s, inattr=%s)", m_sName.cstr(), rhs.m_sName.cstr(), i, sphDumpAttr ( m_dAttrs[i] ).cstr(), sphDumpAttr ( rhs.m_dAttrs[i] ).cstr() ); return false; } // check field count if ( rhs.m_dFields.GetLength()!=m_dFields.GetLength() ) { sError.SetSprintf ( "fulltext fields count mismatch (me=%s, in=%s, myfields=%d, infields=%d)", m_sName.cstr(), rhs.m_sName.cstr(), m_dFields.GetLength(), rhs.m_dFields.GetLength() ); return false; } // check fulltext field names ARRAY_FOREACH ( i, rhs.m_dFields ) if ( rhs.m_dFields[i].m_sName!=m_dFields[i].m_sName ) { sError.SetSprintf ( "fulltext field mismatch (me=%s, myfield=%s, idx=%d, in=%s, infield=%s)", m_sName.cstr(), rhs.m_sName.cstr(), i, m_dFields[i].m_sName.cstr(), rhs.m_dFields[i].m_sName.cstr() ); return false; } return true; } class SchemaRecord { public: CSphString key; int idx; }; bool Cmp(const SchemaRecord &p1, const SchemaRecord &p2) { char i = 0; while(1) { unsigned char pu1 = p1.key.cstr()[i]; unsigned char pu2 = p2.key.cstr()[i]; if(pu1 == pu2) { if(pu1 == 0) break; i++; }else{ return pu1 < pu2; } } return true; } int CSphSchema::BuildFieldIndexCache() { int iRet = 0; //m_field_cache.clear(); if(!m_pfield_cache) m_pfield_cache = new SphDarts::DoubleArray(); if(m_pfield_cache->array() == NULL) { std::vector< SchemaRecord > items; ARRAY_FOREACH ( i, m_dFields ) { SchemaRecord sr; sr.key = m_dFields[i].m_sName; sr.idx = i; items.push_back(sr); #if USE_PYTHON_CASE_SENSIVE_ATTR SchemaRecord srE; if(m_dFields[i].m_sNameExactly != m_dFields[i].m_sName) { srE.key = m_dFields[i].m_sNameExactly; srE.idx = i; items.push_back(srE); } #endif } std::sort(items.begin(), items.end(), Cmp); std::vector key; std::vector value; for( std::vector::iterator it = items.begin(); it != items.end(); it++) { char* ptr = (char*)it->key.cstr(); key.push_back(ptr); value.push_back(it->idx); } iRet = m_pfield_cache->build(key.size(), &key[0], 0, &value[0] ) ; } return iRet; } int CSphSchema::GetFieldIndex ( const char * sName ) const { if ( !sName ) return -1; //check in cache. if(m_pfield_cache && m_pfield_cache->array() != NULL) { //needs to build? SphDarts::DoubleArray::result_pair_type rs; m_pfield_cache->exactMatchSearch(sName,rs); if(rs.pos) { //printf("cache hit! [%s]:%d.", sName, rs.value); return rs.value; } } ARRAY_FOREACH ( i, m_dFields ) { if ( strcasecmp ( m_dFields[i].m_sName.cstr(), sName )==0 ) return i; #if USE_PYTHON_CASE_SENSIVE_ATTR if ( strcasecmp ( m_dFields[i].m_sNameExactly.cstr(), sName )==0 ) return i; #endif } return -1; } int CSphSchema::GetAttrIndex ( const char * sName ) const { if ( !sName ) return -1; ARRAY_FOREACH ( i, m_dAttrs ) { if ( m_dAttrs[i].m_sName==sName ) return i; #if USE_PYTHON_CASE_SENSIVE_ATTR if ( m_dAttrs[i].m_sNameExactly==sName ) return i; #endif } return -1; } const CSphColumnInfo * CSphSchema::GetAttr ( const char * sName ) const { int iIndex = GetAttrIndex ( sName ); if ( iIndex>=0 ) return &m_dAttrs[iIndex]; return NULL; } void CSphSchema::Reset () { if(m_pfield_cache) m_pfield_cache->clear(); m_dFields.Reset(); ResetAttrs (); } void CSphSchema::ResetAttrs () { m_dAttrs.Reset(); m_dStaticUsed.Reset(); m_dDynamicUsed.Reset(); m_iStaticSize = 0; } void CSphSchema::AddAttr ( const CSphColumnInfo & tCol, bool bDynamic ) { assert ( tCol.m_eAttrType!=SPH_ATTR_NONE ); if ( tCol.m_eAttrType==SPH_ATTR_NONE ) return; m_dAttrs.Add ( tCol ); CSphAttrLocator & tLoc = m_dAttrs.Last().m_tLocator; if ( tLoc.IsID() ) return; int iBits = ROWITEM_BITS; if ( tCol.m_tLocator.m_iBitCount>0 ) iBits = tCol.m_tLocator.m_iBitCount; if ( tCol.m_eAttrType==SPH_ATTR_BOOL ) iBits = 1; if ( tCol.m_eAttrType==SPH_ATTR_BIGINT ) iBits = 64; tLoc.m_iBitCount = iBits; tLoc.m_bDynamic = bDynamic; CSphVector & dUsed = bDynamic ? m_dDynamicUsed : m_dStaticUsed; if ( iBits>=ROWITEM_BITS ) { tLoc.m_iBitOffset = dUsed.GetLength()*ROWITEM_BITS; int iItems = (iBits+ROWITEM_BITS-1) / ROWITEM_BITS; for ( int i=0; i=ROWITEM_BITS ) { for ( int i=0; i=0 ); if ( m_dStaticUsed[iItem]<=0 ) m_iStaticSize--; } // do remove m_dAttrs.Remove ( iIndex ); } /////////////////////////////////////////////////////////////////////////////// // BIT-ENCODED FILE OUTPUT /////////////////////////////////////////////////////////////////////////////// CSphWriter::CSphWriter () : m_sName ( "" ) , m_iPos ( -1 ) , m_iWritten ( 0 ) , m_iFD ( -1 ) , m_iPoolUsed ( 0 ) , m_pBuffer ( NULL ) , m_pPool ( NULL ) , m_bOwnFile ( false ) , m_pSharedOffset ( NULL ) , m_iBufferSize ( 262144 ) , m_bError ( false ) , m_pError ( NULL ) { } void CSphWriter::SetBufferSize ( int iBufferSize ) { if ( iBufferSize!=m_iBufferSize ) { m_iBufferSize = Max ( iBufferSize, 262144 ); if ( m_pBuffer ) SafeDeleteArray ( m_pBuffer ); } } bool CSphWriter::OpenFile ( const CSphString & sName, CSphString & sErrorBuffer ) { assert ( !sName.IsEmpty() ); assert ( m_iFD<0 && "already open" ); m_bOwnFile = true; m_sName = sName; m_pError = &sErrorBuffer; if ( !m_pBuffer ) m_pBuffer = new BYTE [ m_iBufferSize ]; m_iFD = ::open ( m_sName.cstr(), SPH_O_NEW, 0644 ); m_pPool = m_pBuffer; m_iPoolUsed = 0; m_iPos = 0; m_iWritten = 0; m_bError = ( m_iFD<0 ); if ( m_bError ) m_pError->SetSprintf ( "failed to create %s: %s" , sName.cstr(), strerror(errno) ); return !m_bError; } void CSphWriter::SetFile ( int iFD, SphOffset_t * pSharedOffset ) { assert ( m_iFD<0 && "already open" ); m_bOwnFile = false; if ( !m_pBuffer ) m_pBuffer = new BYTE [ m_iBufferSize ]; m_iFD = iFD; m_pPool = m_pBuffer; m_iPoolUsed = 0; m_iPos = 0; m_iWritten = 0; m_pSharedOffset = pSharedOffset; } CSphWriter::~CSphWriter () { CloseFile (); SafeDeleteArray ( m_pBuffer ); } void CSphWriter::CloseFile ( bool bTruncate ) { if ( m_iFD>=0 ) { Flush (); if ( bTruncate ) sphTruncate ( m_iFD ); if ( m_bOwnFile ) ::close ( m_iFD ); m_iFD = -1; } } void CSphWriter::PutByte ( int data ) { if ( m_iPoolUsed==m_iBufferSize ) Flush (); *m_pPool++ = BYTE ( data & 0xff ); m_iPoolUsed++; m_iPos++; } void CSphWriter::PutBytes ( const void * pData, int iSize ) { const BYTE * pBuf = (const BYTE *) pData; while ( iSize>0 ) { int iPut = Min ( iSize, m_iBufferSize ); if ( m_iPoolUsed+iPut>m_iBufferSize ) Flush (); assert ( m_iPoolUsed+iPut<=m_iBufferSize ); memcpy ( m_pPool, pBuf, iPut ); m_pPool += iPut; m_iPoolUsed += iPut; m_iPos += iPut; pBuf += iPut; iSize -= iPut; } } void CSphWriter::ZipInt ( DWORD uValue ) { int iBytes = 1; DWORD u = ( uValue>>7 ); while ( u ) { u >>= 7; iBytes++; } while ( iBytes-- ) PutByte ( ( 0x7f & ( uValue >> (7*iBytes) ) ) | ( iBytes ? 0x80 : 0 ) ); } void CSphWriter::ZipOffset ( SphOffset_t uValue ) { int iBytes = 1; uint64_t u = ((uint64_t)uValue)>>7; while ( u ) { u >>= 7; iBytes++; } while ( iBytes-- ) PutByte ( ( 0x7f & (DWORD)( uValue >> (7*iBytes) ) ) | ( iBytes ? 0x80 : 0 ) ); } void CSphWriter::ZipOffsets ( CSphVector * pData ) { assert ( pData ); SphOffset_t * pValue = &((*pData)[0]); int n = pData->GetLength (); while ( n-->0 ) { SphOffset_t uValue = *pValue++; int iBytes = 1; uint64_t u = ((uint64_t)uValue)>>7; while ( u ) { u >>= 7; iBytes++; } while ( iBytes-- ) PutByte ( ( 0x7f & (DWORD)( uValue >> (7*iBytes) ) ) | ( iBytes ? 0x80 : 0 ) ); } } void CSphWriter::Flush () { PROFILE ( write_hits ); if ( m_pSharedOffset && *m_pSharedOffset!=m_iWritten ) sphSeek ( m_iFD, m_iWritten, SEEK_SET ); if ( !sphWriteThrottled ( m_iFD, m_pBuffer, m_iPoolUsed, m_sName.cstr(), *m_pError ) ) m_bError = true; m_iWritten += m_iPoolUsed; m_iPoolUsed = 0; m_pPool = m_pBuffer; if ( m_pSharedOffset ) *m_pSharedOffset = m_iWritten; } void CSphWriter::PutString ( const char * szString ) { int iLen = szString ? strlen ( szString ) : 0; PutDword ( iLen ); if ( iLen ) PutBytes ( szString, iLen ); } void CSphWriter::PutString ( const CSphString & sString ) { int iLen = sString.Length(); PutDword ( iLen ); if ( iLen ) PutBytes ( sString.cstr(), iLen ); } void CSphWriter::SeekTo ( SphOffset_t iPos ) { assert ( iPos>=0 ); if ( iPos>=m_iWritten && iPos<=( m_iWritten + m_iPoolUsed ) ) { // seeking inside the buffer m_iPoolUsed = (int)( iPos - m_iWritten ); m_pPool = m_pBuffer + m_iPoolUsed; } else { assert ( iPos0 ); } CSphReader::~CSphReader () { if ( m_bBufOwned ) SafeDeleteArray ( m_pBuff ); } void CSphReader::SetBuffers ( int iReadBuffer, int iReadUnhinted ) { if ( !m_pBuff ) m_iBufSize = iReadBuffer; m_iReadUnhinted = iReadUnhinted; } void CSphReader::SetFile ( int iFD, const char * sFilename ) { m_iFD = iFD; m_iPos = 0; m_iBuffPos = 0; m_iBuffUsed = 0; m_sFilename = sFilename; } void CSphReader::SetFile ( const CSphAutofile & tFile ) { SetFile ( tFile.GetFD(), tFile.GetFilename() ); } void CSphReader::Reset () { SetFile ( -1, "" ); } void CSphReader::SeekTo ( SphOffset_t iPos, int iSizeHint ) { assert ( iPos>=0 ); #ifndef NDEBUG #if PARANOID struct_stat tStat; fstat ( m_iFD, &tStat ); if ( iPos > tStat.st_size ) sphDie ( "INTERNAL ERROR: seeking past the end of file" ); #endif #endif if ( iPos>=m_iPos && iPos>32 ); DWORD uRes; if ( !ReadFile ( hFile, pBuf, iBytes, &uRes, &tOverlapped ) ) { DWORD uErr = GetLastError(); if ( uErr==ERROR_HANDLE_EOF ) return 0; errno = uErr; // FIXME! should remap from Win to POSIX return -1; } if ( g_bIOStats ) { g_IOStats.m_iReadTime += sphMicroTimer() - tmStart; g_IOStats.m_iReadOps++; g_IOStats.m_iReadBytes += iBytes; } return uRes; } #else #if HAVE_PREAD // atomic seek+read for non-Windows systems with pread() call int sphPread ( int iFD, void * pBuf, int iBytes, SphOffset_t iOffset ) { if ( !g_bIOStats ) return ::pread ( iFD, pBuf, iBytes, iOffset ); int64_t tmStart = sphMicroTimer(); int iRes = (int) ::pread ( iFD, pBuf, iBytes, iOffset ); g_IOStats.m_iReadTime += sphMicroTimer() - tmStart; g_IOStats.m_iReadOps++; g_IOStats.m_iReadBytes += iBytes; return iRes; } #else // generic fallback; prone to races between seek and read int sphPread ( int iFD, void * pBuf, int iBytes, SphOffset_t iOffset ) { if ( sphSeek ( iFD, iOffset, SEEK_SET )==-1 ) return -1; return sphReadThrottled ( iFD, pBuf, iBytes ); } #endif // HAVE_PREAD #endif // USE_WINDOWS void CSphReader::UpdateCache () { PROFILE ( read_hits ); assert ( m_iFD>=0 ); // alloc buf on first actual read if ( !m_pBuff ) { if ( m_iBufSize<=0 ) m_iBufSize = DEFAULT_READ_BUFFER; m_bBufOwned = true; m_pBuff = new BYTE [ m_iBufSize ]; } // stream position could be changed externally // so let's just hope that the OS optimizes redundant seeks SphOffset_t iNewPos = m_iPos + Min ( m_iBuffPos, m_iBuffUsed ); if ( m_iSizeHint<=0 ) m_iSizeHint = ( m_iReadUnhinted>0 ) ? m_iReadUnhinted : DEFAULT_READ_UNHINTED; int iReadLen = Min ( m_iSizeHint, m_iBufSize ); m_iBuffPos = 0; m_iBuffUsed = sphPread ( m_iFD, m_pBuff, iReadLen, iNewPos ); // FIXME! what about throttling? if ( m_iBuffUsed<0 ) { m_iBuffUsed = m_iBuffPos = 0; m_bError = true; m_sError.SetSprintf ( "pread error in %s: pos="INT64_FMT", len=%d, code=%d, msg=%s", m_sFilename.cstr(), (int64_t)iNewPos, iReadLen, errno, strerror(errno) ); return; } // all fine, adjust offset and hint m_iSizeHint -= m_iBuffUsed; m_iPos = iNewPos; } int CSphReader::GetByte () { if ( m_iBuffPos>=m_iBuffUsed ) { UpdateCache (); if ( m_iBuffPos>=m_iBuffUsed ) return 0; // unexpected io failure } assert ( m_iBuffPosm_iBufSize ) { int iLen = m_iBuffUsed - m_iBuffPos; assert ( iLen<=m_iBufSize ); memcpy ( pOut, m_pBuff+m_iBuffPos, iLen ); m_iBuffPos += iLen; pOut += iLen; iSize -= iLen; m_iSizeHint = iSize; // FIXME! if ( iSize>0 ) { UpdateCache (); if ( !m_iBuffUsed ) return; // unexpected io failure } } if ( m_iBuffPos+iSize>m_iBuffUsed ) { // move old buffer tail to buffer head to avoid losing the data const int iLen = m_iBuffUsed - m_iBuffPos; if ( iLen>0 ) { memcpy ( pOut, m_pBuff+m_iBuffPos, iLen ); m_iBuffPos += iLen; pOut += iLen; iSize -= iLen; } m_iSizeHint = iSize - m_iBuffUsed + m_iBuffPos; // FIXME! UpdateCache (); if ( m_iBuffPos+iSize>m_iBuffUsed ) { memset ( pOut, 0, iSize ); // unexpected io failure return; } } assert ( (m_iBuffPos+iSize)<=m_iBuffUsed ); memcpy ( pOut, m_pBuff+m_iBuffPos, iSize ); m_iBuffPos += iSize; } int CSphReader::GetBytesZerocopy ( const BYTE ** ppData, int iMax ) { if ( m_iBuffPos>=m_iBuffUsed ) { UpdateCache (); if ( m_iBuffPos>=m_iBuffUsed ) return 0; // unexpected io failure } int iChunk = Min ( m_iBuffUsed-m_iBuffPos, iMax ); *ppData = m_pBuff + m_iBuffPos; m_iBuffPos += iChunk; return iChunk; } int CSphReader::GetLine ( char * sBuffer, int iMaxLen ) { int iOutPos = 0; iMaxLen--; // reserve space for trailing '\0' // grab as many chars as we can while ( iOutPos=m_iBuffUsed ) { UpdateCache (); if ( m_iBuffPos>=m_iBuffUsed ) { if ( iOutPos==0 ) return -1; // current line is empty; indicate eof break; // return current line; will return eof next time } } // break on CR or LF if ( m_pBuff[m_iBuffPos]=='\r' || m_pBuff[m_iBuffPos]=='\n' ) break; // one more valid char sBuffer[iOutPos++] = m_pBuff[m_iBuffPos++]; } // skip everything until the newline or eof for ( ;; ) { // read next chunk if necessary if ( m_iBuffPos>=m_iBuffUsed ) UpdateCache (); // eof? if ( m_iBuffPos>=m_iBuffUsed ) break; // newline? if ( m_pBuff[m_iBuffPos++]=='\n' ) break; } // finalize sBuffer[iOutPos] = '\0'; return iOutPos; } ///////////////////////////////////////////////////////////////////////////// #if PARANOID #define SPH_UNZIP_IMPL(_type,_getexpr) \ register DWORD b = 0; \ register _type v = 0; \ int it = 0; \ do { b = _getexpr; v = ( v<<7 ) + ( b&0x7f ); it++; } while ( b&0x80 ); \ assert ( (it-1)*7<=sizeof(_type)*8 ); \ return v; #else #define SPH_UNZIP_IMPL(_type,_getexpr) \ register DWORD b = 0; \ register _type v = 0; \ do { b = _getexpr; v = ( v<<7 ) + ( b&0x7f ); } while ( b&0x80 ); \ return v; #endif // PARANOID DWORD sphUnzipInt ( const BYTE * & pBuf ) { SPH_UNZIP_IMPL ( DWORD, *pBuf++ ); } SphOffset_t sphUnzipOffset ( const BYTE * & pBuf ) { SPH_UNZIP_IMPL ( SphOffset_t, *pBuf++ ); } DWORD CSphReader::UnzipInt () { SPH_UNZIP_IMPL ( DWORD, GetByte() ); } SphOffset_t CSphReader::UnzipOffset () { SPH_UNZIP_IMPL ( SphOffset_t, GetByte() ); } #if USE_64BIT #define sphUnzipWordid sphUnzipOffset #else #define sphUnzipWordid sphUnzipInt #endif ///////////////////////////////////////////////////////////////////////////// const CSphReader & CSphReader::operator = ( const CSphReader & rhs ) { SetFile ( rhs.m_iFD, rhs.m_sFilename.cstr() ); SeekTo ( rhs.m_iPos + rhs.m_iBuffPos, rhs.m_iSizeHint ); return *this; } DWORD CSphReader::GetDword () { DWORD uRes; GetBytes ( &uRes, sizeof(DWORD) ); return uRes; } SphOffset_t CSphReader::GetOffset () { SphOffset_t uRes; GetBytes ( &uRes, sizeof(SphOffset_t) ); return uRes; } CSphString CSphReader::GetString () { CSphString sRes; DWORD iLen = GetDword (); if ( iLen ) { char * sBuf = new char [ iLen ]; GetBytes ( sBuf, iLen ); sRes.SetBinary ( sBuf, iLen ); SafeDeleteArray ( sBuf ); } return sRes; } ////////////////////////////////////////////////////////////////////////// CSphAutoreader::~CSphAutoreader () { Close (); } bool CSphAutoreader::Open ( const CSphString & sFilename, CSphString & sError ) { assert ( m_iFD<0 ); assert ( !sFilename.IsEmpty() ); m_iFD = ::open ( sFilename.cstr(), SPH_O_READ, 0644 ); m_iPos = 0; m_iBuffPos = 0; m_iBuffUsed = 0; m_sFilename = sFilename; if ( m_iFD<0 ) sError.SetSprintf ( "failed to open %s: %s", sFilename.cstr(), strerror(errno) ); return ( m_iFD>=0 ); } void CSphAutoreader::Close () { if ( m_iFD>=0 ) ::close ( m_iFD ); m_iFD = -1; } SphOffset_t CSphAutoreader::GetFilesize () { assert ( m_iFD>=0 ); struct_stat st; if ( m_iFD<0 || fstat ( m_iFD, &st )<0 ) return -1; return st.st_size; } ///////////////////////////////////////////////////////////////////////////// // QUERY RESULT ///////////////////////////////////////////////////////////////////////////// CSphQueryResult::CSphQueryResult () : m_tSchema ( "query_result" ) { m_iQueryTime = 0; m_iCpuTime = 0; m_iMultiplier = 1; m_iTotalMatches = 0; m_pMva = NULL; m_pStrings = NULL; m_iOffset = 0; m_iCount = 0; m_iSuccesses = 0; } CSphQueryResult::~CSphQueryResult () { ARRAY_FOREACH ( i, m_dStorage2Free ) { SafeDeleteArray ( m_dStorage2Free[i] ); } } void CSphQueryResult::LeakStorages ( CSphQueryResult & tDst ) { ARRAY_FOREACH ( i, m_dStorage2Free ) tDst.m_dStorage2Free.Add ( m_dStorage2Free[i] ); m_dStorage2Free.Reset(); } ///////////////////////////////////////////////////////////////////////////// // CHUNK READER ///////////////////////////////////////////////////////////////////////////// CSphBin::CSphBin ( ESphHitless eMode, bool bWordDict ) : m_eMode ( eMode ) , m_dBuffer ( NULL ) , m_pCurrent ( NULL ) , m_iLeft ( 0 ) , m_iDone ( 0 ) , m_eState ( BIN_POS ) , m_bWordDict ( bWordDict ) , m_bError ( false ) , m_iFile ( -1 ) , m_pFilePos ( NULL ) , m_iFilePos ( 0 ) , m_iFileLeft ( 0 ) { m_tHit.m_sKeyword = bWordDict ? m_sKeyword : NULL; m_sKeyword[0] = '\0'; #ifndef NDEBUG m_iLastWordID = 0; m_sLastKeyword[0] = '\0'; #endif } int CSphBin::CalcBinSize ( int iMemoryLimit, int iBlocks, const char * sPhase, bool bWarn ) { if ( iBlocks<=0 ) return CSphBin::MIN_SIZE; int iBinSize = ( ( iMemoryLimit/iBlocks + 2048 ) >> 12 ) << 12; // round to 4k if ( iBinSize=MIN_SIZE ); assert ( pSharedOffset ); m_iFile = iFD; m_pFilePos = pSharedOffset; m_iSize = iBinSize; m_dBuffer = new BYTE [ iBinSize ]; m_pCurrent = m_dBuffer; m_tHit.m_iDocID = 0; m_tHit.m_iWordID = 0; m_tHit.m_iWordPos = EMPTY_HIT; m_tHit.m_dFieldMask.Unset(); m_bError = false; } CSphBin::~CSphBin () { SafeDeleteArray ( m_dBuffer ); } int CSphBin::ReadByte () { BYTE r; if ( !m_iLeft ) { PROFILE ( read_hits ); if ( *m_pFilePos!=m_iFilePos ) { sphSeek ( m_iFile, m_iFilePos, SEEK_SET ); *m_pFilePos = m_iFilePos; } int n = m_iFileLeft > m_iSize ? m_iSize : (int)m_iFileLeft; if ( n==0 ) { m_iDone = 1; m_iLeft = 1; } else { assert ( m_dBuffer ); if ( sphReadThrottled ( m_iFile, m_dBuffer, n )!=(size_t)n ) { m_bError = true; return -2; } m_iLeft = n; m_iFilePos += n; m_iFileLeft -= n; m_pCurrent = m_dBuffer; *m_pFilePos += n; } } if ( m_iDone ) { m_bError = true; // unexpected (!) eof return -1; } m_iLeft--; r = *(m_pCurrent); m_pCurrent++; return r; } ESphBinRead CSphBin::ReadBytes ( void * pDest, int iBytes ) { assert ( iBytes>0 ); assert ( iBytes<=m_iSize ); if ( m_iDone ) return BIN_READ_EOF; if ( m_iLeft=iBytes ); m_iLeft -= iBytes; memcpy ( pDest, m_pCurrent, iBytes ); m_pCurrent += iBytes; return BIN_READ_OK; } SphWordID_t CSphBin::ReadVLB () { SphWordID_t uValue = 0; int iByte, iOffset = 0; do { if ( ( iByte = ReadByte() )<0 ) return 0; uValue += ( ( SphWordID_t ( iByte & 0x7f ) ) << iOffset ); iOffset += 7; } while ( iByte & 0x80 ); return uValue; } DWORD CSphBin::UnzipInt () { register int b = 0; register DWORD v = 0; do { b = ReadByte(); if ( b<0 ) b = 0; v = ( v<<7 ) + ( b & 0x7f ); } while ( b & 0x80 ); return v; } SphOffset_t CSphBin::UnzipOffset () { register int b = 0; register SphOffset_t v = 0; do { b = ReadByte(); if ( b<0 ) b = 0; v = ( v<<7 ) + ( b & 0x7f ); } while ( b & 0x80 ); return v; } int CSphBin::ReadHit ( CSphAggregateHit * pOut, int iRowitems, CSphRowitem * pRowitems ) { // expected EOB if ( m_iDone ) { pOut->m_iWordID = 0; return 1; } CSphAggregateHit & tHit = m_tHit; // shortcut for ( ;; ) { // SPH_MAX_WORD_LEN is now 42 only to keep ReadVLB() below // technically, we can just use different functions on different paths, if ever needed STATIC_ASSERT ( SPH_MAX_WORD_LEN*3<=127, KEYWORD_TOO_LONG ); SphWordID_t uDelta = ReadVLB(); if ( uDelta ) { switch ( m_eState ) { case BIN_WORD: if ( m_bWordDict ) { #ifdef NDEBUG // FIXME?! move this under PARANOID or something? // or just introduce an assert() checked release build? if ( uDelta>=sizeof(m_sKeyword) ) sphDie ( "INTERNAL ERROR: corrupted keyword length (len="UINT64_FMT", deltapos="UINT64_FMT")", (uint64_t)uDelta, (uint64_t)(m_iFilePos-m_iLeft) ); #else assert ( uDelta>0 && uDelta>= 1; } tHit.m_iWordPos += (DWORD)uDelta; *pOut = tHit; return 1; default: sphDie ( "INTERNAL ERROR: unknown bin state (state=%d)", m_eState ); } } else { switch ( m_eState ) { case BIN_POS: m_eState = BIN_DOC; break; case BIN_DOC: m_eState = BIN_WORD; break; case BIN_WORD: m_iDone = 1; pOut->m_iWordID = 0; return 1; default: sphDie ( "INTERNAL ERROR: unknown bin state (state=%d)", m_eState ); } } } } bool CSphBin::IsEOF () const { return m_iDone!=0 || m_iFileLeft<=0; } bool CSphBin::IsDone () const { return m_iDone!=0 || ( m_iFileLeft<=0 && m_iLeft<=0 ); } ESphBinRead CSphBin::Precache () { if ( m_iFileLeft > m_iSize-m_iLeft ) { m_bError = true; return BIN_PRECACHE_ERROR; } if ( !m_iFileLeft ) return BIN_PRECACHE_OK; if ( *m_pFilePos!=m_iFilePos ) { sphSeek ( m_iFile, m_iFilePos, SEEK_SET ); *m_pFilePos = m_iFilePos; } assert ( m_dBuffer ); memmove ( m_dBuffer, m_pCurrent, m_iLeft ); if ( sphReadThrottled ( m_iFile, m_dBuffer+m_iLeft, m_iFileLeft )!=(size_t)m_iFileLeft ) { m_bError = true; return BIN_READ_ERROR; } m_iLeft += m_iFileLeft; m_iFilePos += m_iFileLeft; m_iFileLeft -= m_iFileLeft; m_pCurrent = m_dBuffer; *m_pFilePos += m_iFileLeft; return BIN_PRECACHE_OK; } ////////////////////////////////////////////////////////////////////////// // INDEX SETTINGS ////////////////////////////////////////////////////////////////////////// CSphIndexSettings::CSphIndexSettings () : m_eDocinfo ( SPH_DOCINFO_NONE ) , m_eHitFormat ( SPH_HIT_FORMAT_PLAIN ) , m_bHtmlStrip ( false ) , m_eHitless ( SPH_HITLESS_NONE ) { } ////////////////////////////////////////////////////////////////////////// // PROCESS-SHARED MUTEX ////////////////////////////////////////////////////////////////////////// /// scoped mutex lock class CSphScopedMutexLock : ISphNoncopyable { public: /// lock on creation explicit CSphScopedMutexLock ( CSphProcessSharedMutex & tMutex ) : m_tMutexRef ( tMutex ) { m_tMutexRef.Lock(); } /// unlock on going out of scope ~CSphScopedMutexLock () { m_tMutexRef.Unlock (); } protected: CSphProcessSharedMutex & m_tMutexRef; }; ////////////////////////////////////////////////////////////////////////// // GLOBAL MVA STORAGE ARENA ////////////////////////////////////////////////////////////////////////// class tTester : public ISphNoncopyable { public: virtual void Reset() = 0; virtual void TestData ( int iData ) = 0; virtual ~tTester() {} }; /// shared-memory arena allocator /// manages small tagged dword strings, upto 4096 bytes in size class CSphArena { public: CSphArena (); ~CSphArena (); bool Init ( int uMaxBytes ); bool ReInit ( int uMaxBytes ); DWORD * GetBasePtr () const { return m_pBasePtr; } int TaggedAlloc ( int iTag, int iBytes ); void TaggedFreeIndex ( int iTag, int iIndex ); void TaggedFreeTag ( int iTag ); void ExamineTag ( tTester* pTest, int iTag ); protected: static const int MIN_BITS = 4; static const int MAX_BITS = 12; static const int NUM_SIZES = MAX_BITS-MIN_BITS+2; ///< one for 0 (empty pages), and one for each size from min to max static const int PAGE_SIZE = 1< m_pArena; ///< arena that stores everything (all other pointers point here) PageDesc_t * m_pPages; ///< page descriptors int * m_pFreelistHeads; ///< free-list heads int * m_pTagCount; TagDesc_t * m_pTags; DWORD * m_pBasePtr; ///< base data storage pointer #if ARENADEBUG protected: int * m_pTotalAllocs; int * m_pTotalBytes; public: void CheckFreelists (); #else inline void CheckFreelists () {} #endif // ARENADEBUG }; class tDocCollector : public tTester { CSphVector * m_dCollection; public: explicit tDocCollector ( CSphVector & dCollection ) : m_dCollection ( &dCollection ) {} virtual void Reset() { m_dCollection->Reset(); } virtual void TestData ( int iData ) { if ( !g_pMvaArena ) return; m_dCollection->Add ( *(SphDocID_t*)(g_pMvaArena + iData) ); } }; ////////////////////////////////////////////////////////////////////////// CSphArena::CSphArena () : m_iPages ( 0 ) { } CSphArena::~CSphArena () { // notify callers that arena no longer exists g_pMvaArena = NULL; } bool CSphArena::ReInit ( int uMaxBytes ) { if ( m_iPages!=0 ) { m_pArena.Reset(); m_iPages = 0; } return Init ( uMaxBytes ); } bool CSphArena::Init ( int uMaxBytes ) { m_iPages = ( uMaxBytes+PAGE_SIZE-1 ) / PAGE_SIZE; int iData = m_iPages*PAGE_SIZE; // data size, bytes int iMyTaglist = sizeof(int) + MAX_TAGS*sizeof(TagDesc_t); // int length, TagDesc_t[] tags; NOLINT int iMy = m_iPages*sizeof(PageDesc_t) + NUM_SIZES*sizeof(int) + iMyTaglist; // my internal structures size, bytes; NOLINT #if ARENADEBUG iMy += 2*sizeof(int); // debugging counters; NOLINT #endif assert ( iData%sizeof(DWORD)==0 ); assert ( iMy%sizeof(DWORD)==0 ); CSphString sError, sWarning; if ( !m_pArena.Alloc ( (iData+iMy)/sizeof(DWORD), sError, sWarning ) ) { m_iPages = 0; return false; } // setup internal pointers DWORD * pCur = m_pArena.GetWritePtr(); m_pPages = (PageDesc_t*) pCur; pCur += sizeof(PageDesc_t)*m_iPages/sizeof(DWORD); m_pFreelistHeads = (int*) pCur; pCur += NUM_SIZES; // one for each size, and one extra for zero m_pTagCount = (int*) pCur++; m_pTags = (TagDesc_t*) pCur; pCur += sizeof(TagDesc_t)*MAX_TAGS/sizeof(DWORD); #if ARENADEBUG m_pTotalAllocs = (int*) pCur++; m_pTotalBytes = (int*) pCur++; *m_pTotalAllocs = 0; *m_pTotalBytes = 0; #endif m_pBasePtr = m_pArena.GetWritePtr() + iMy/sizeof(DWORD); assert ( m_pBasePtr==pCur ); // setup initial state for ( int i=0; i0 ) ? i-1 : -1; m_pPages[i].m_iNext = ( i( ( 1 << MAX_BITS ) - (int)sizeof(int) ) ) return -1; int iSizeBits = sphLog2 ( iBytes+sizeof(int)-1 ); // always reserve sizeof(int) for the tag; NOLINT iSizeBits = Max ( iSizeBits, MIN_BITS ); assert ( iSizeBits>=MIN_BITS && iSizeBits<=MAX_BITS ); int iSizeSlot = iSizeBits-MIN_BITS+1; assert ( iSizeSlot>=1 && iSizeSlot=0 ) { // got something in the free-list pPage = m_pPages + m_pFreelistHeads[iSizeSlot]; } else { // nothing in free-list, alloc next empty one if ( m_pFreelistHeads[0]<0 ) return -1; // out of memory // update the page pPage = m_pPages + m_pFreelistHeads[0]; assert ( pPage->m_iPrev==-1 ); m_pFreelistHeads[iSizeSlot] = m_pFreelistHeads[0]; m_pFreelistHeads[0] = pPage->m_iNext; if ( pPage->m_iNext>=0 ) m_pPages[pPage->m_iNext].m_iPrev = -1; pPage->m_iSizeBits = iSizeBits; pPage->m_iUsed = 0; pPage->m_iNext = -1; CheckFreelists (); // setup bitmap int iUsedBits = ( 1<<(MAX_BITS-iSizeBits) ); // max-used-bits = page-size/alloc-size = ( 1<0 && iUsedBits<=(PAGE_BITMAP<<5) ); for ( int i=0; im_uBitmap[i] = ( ( i<<5 )>=iUsedBits ) ? 0xffffffffUL : 0; if ( iUsedBits<32 ) pPage->m_uBitmap[0] = ( 0xffffffffUL<m_iSizeBits==iSizeBits ); for ( int i=0; im_uBitmap[i]==0xffffffffUL ) continue; int iFree = FindBit ( pPage->m_uBitmap[i] ); pPage->m_uBitmap[i] |= ( 1<m_iUsed++; if ( pPage->m_iUsed==( PAGE_SIZE >> pPage->m_iSizeBits ) ) { // this page is full now, unchain from the free-list assert ( m_pFreelistHeads[iSizeSlot]==pPage-m_pPages ); m_pFreelistHeads[iSizeSlot] = pPage->m_iNext; if ( pPage->m_iNext>=0 ) { assert ( m_pPages[pPage->m_iNext].m_iPrev==pPage-m_pPages ); m_pPages[pPage->m_iNext].m_iPrev = -1; } pPage->m_iNext = -1; } #if ARENADEBUG (*m_pTotalAllocs)++; (*m_pTotalBytes) += ( 1<m_iPages ) { assert ( 0 && "internal error, freed index out of arena" ); return; } PageDesc_t * pPage = m_pPages + iPage; int iBit = ( iOffset % PAGE_SIZE ) >> pPage->m_iSizeBits; assert ( ( iOffset % PAGE_SIZE )==( iBit << pPage->m_iSizeBits ) && "internal error, freed offset is unaligned" ); if (!( pPage->m_uBitmap[iBit>>5] & ( 1UL<<(iBit & 31) ) )) { assert ( 0 && "internal error, freed index already freed" ); return; } pPage->m_uBitmap[iBit>>5] &= ~( 1UL << ( iBit & 31 ) ); pPage->m_iUsed--; #if ARENADEBUG (*m_pTotalAllocs)--; (*m_pTotalBytes) -= ( 1<m_iSizeBits ); #endif CheckFreelists (); int iSizeSlot = pPage->m_iSizeBits-MIN_BITS+1; if ( pPage->m_iUsed==( PAGE_SIZE >> pPage->m_iSizeBits )-1 ) { // this page was full, but it's semi-free now // chain to free-list assert ( pPage->m_iPrev==-1 ); // full pages must not be in any list assert ( pPage->m_iNext==-1 ); pPage->m_iNext = m_pFreelistHeads[iSizeSlot]; if ( pPage->m_iNext>=0 ) { assert ( m_pPages[pPage->m_iNext].m_iPrev==-1 ); assert ( m_pPages[pPage->m_iNext].m_iSizeBits==pPage->m_iSizeBits ); m_pPages[pPage->m_iNext].m_iPrev = iPage; } m_pFreelistHeads[iSizeSlot] = iPage; } if ( pPage->m_iUsed==0 ) { // this page is empty now // unchain from free-list if ( pPage->m_iPrev>=0 ) { // non-head page assert ( m_pPages[pPage->m_iPrev].m_iNext==iPage ); m_pPages[pPage->m_iPrev].m_iNext = pPage->m_iNext; if ( pPage->m_iNext>=0 ) { assert ( m_pPages[pPage->m_iNext].m_iPrev==iPage ); m_pPages[pPage->m_iNext].m_iPrev = pPage->m_iPrev; } } else { // head page assert ( m_pFreelistHeads[iSizeSlot]==iPage ); assert ( pPage->m_iPrev==-1 ); if ( pPage->m_iNext>=0 ) { assert ( m_pPages[pPage->m_iNext].m_iPrev==iPage ); m_pPages[pPage->m_iNext].m_iPrev = -1; } m_pFreelistHeads[iSizeSlot] = pPage->m_iNext; } pPage->m_iSizeBits = 0; pPage->m_iPrev = -1; pPage->m_iNext = m_pFreelistHeads[0]; if ( pPage->m_iNext>=0 ) { assert ( m_pPages[pPage->m_iNext].m_iPrev==-1 ); assert ( m_pPages[pPage->m_iNext].m_iSizeBits==0 ); m_pPages[pPage->m_iNext].m_iPrev = iPage; } m_pFreelistHeads[0] = iPage; } CheckFreelists (); } int CSphArena::TaggedAlloc ( int iTag, int iBytes ) { if ( !m_iPages ) return -1; // uninitialized assert ( iTag>=0 ); CSphScopedMutexLock tLock ( m_tMutex ); // find that tag first TagDesc_t * pTag = sphBinarySearch ( m_pTags, m_pTags+(*m_pTagCount)-1, bind ( &TagDesc_t::m_iTag ), iTag ); if ( !pTag ) { if ( *m_pTagCount==MAX_TAGS ) return -1; // out of tags int iLogHead = RawAlloc ( sizeof(AllocsLogEntry_t) ); if ( iLogHead<0 ) return -1; // out of memory AllocsLogEntry_t * pLog = (AllocsLogEntry_t*) ( m_pBasePtr + iLogHead ); pLog->m_iUsed = 0; pLog->m_iNext = -1; // add new tag pTag = m_pTags + (*m_pTagCount)++; pTag->m_iTag = iTag; pTag->m_iAllocs = 0; pTag->m_iLogHead = iLogHead; // re-sort // OPTIMIZE! full-blown sort is overkill here sphSort ( m_pTags, *m_pTagCount, sphMemberLess ( &TagDesc_t::m_iTag ) ); // we must be able to find it now pTag = sphBinarySearch ( m_pTags, m_pTags+(*m_pTagCount)-1, bind ( &TagDesc_t::m_iTag ), iTag ); assert ( pTag && "internal error, fresh tag not found in TaggedAlloc()" ); if ( !pTag ) return -1; // internal error } // grow the log if needed AllocsLogEntry_t * pLog = (AllocsLogEntry_t*) ( m_pBasePtr + pTag->m_iLogHead ); if ( pLog->m_iUsed==MAX_LOGENTRIES ) { int iNewEntry = RawAlloc ( sizeof(AllocsLogEntry_t) ); if ( iNewEntry<0 ) return -1; // out of memory AllocsLogEntry_t * pNew = (AllocsLogEntry_t*) ( m_pBasePtr + iNewEntry ); pNew->m_iUsed = 0; pNew->m_iNext = pTag->m_iLogHead; pTag->m_iLogHead = iNewEntry; pLog = pNew; } // do the alloc itself int iIndex = RawAlloc ( iBytes ); if ( iIndex<0 ) return -1; // out of memory // tag it m_pBasePtr[iIndex-1] = iTag; // log it assert ( pLog->m_iUsedm_dEntries [ pLog->m_iUsed++ ] = iIndex; pTag->m_iAllocs++; // and we're done return iIndex; } void CSphArena::TaggedFreeIndex ( int iTag, int iIndex ) { if ( !m_iPages ) return; // uninitialized assert ( iTag>=0 ); CSphScopedMutexLock tLock ( m_tMutex ); // find that tag TagDesc_t * pTag = sphBinarySearch ( m_pTags, m_pTags+(*m_pTagCount)-1, bind ( &TagDesc_t::m_iTag ), iTag ); assert ( pTag && "internal error, unknown tag in TaggedFreeIndex()" ); assert ( m_pBasePtr[iIndex-1]==DWORD(iTag) && "internal error, tag mismatch in TaggedFreeIndex()" ); // defence against internal errors if ( !pTag ) return; // untag it m_pBasePtr[iIndex-1] = DWORD(-1); // free it RawFree ( iIndex ); // update the tag decsriptor pTag->m_iAllocs--; assert ( pTag->m_iAllocs>=0 ); // remove the descriptor if its empty now if ( pTag->m_iAllocs==0 ) RemoveTag ( pTag ); } void CSphArena::TaggedFreeTag ( int iTag ) { if ( !m_iPages ) return; // uninitialized assert ( iTag>=0 ); CSphScopedMutexLock tLock ( m_tMutex ); // find that tag TagDesc_t * pTag = sphBinarySearch ( m_pTags, m_pTags+(*m_pTagCount)-1, bind ( &TagDesc_t::m_iTag ), iTag ); if ( !pTag ) return; // walk the log and free it int iLog = pTag->m_iLogHead; while ( iLog>=0 ) { AllocsLogEntry_t * pLog = (AllocsLogEntry_t*) ( m_pBasePtr + iLog ); iLog = pLog->m_iNext; // free each alloc if tag still matches for ( int i=0; im_iUsed; i++ ) { int iIndex = pLog->m_dEntries[i]; if ( m_pBasePtr[iIndex-1]==DWORD(iTag) ) { m_pBasePtr[iIndex-1] = DWORD(-1); // avoid double free RawFree ( iIndex ); pTag->m_iAllocs--; } } } // check for mismatches assert ( pTag->m_iAllocs==0 ); // remove the descriptor RemoveTag ( pTag ); } void CSphArena::ExamineTag ( tTester* pTest, int iTag ) { if ( !pTest ) return; pTest->Reset(); if ( !m_iPages ) return; // uninitialized assert ( iTag>=0 ); CSphScopedMutexLock tLock ( m_tMutex ); // find that tag TagDesc_t * pTag = sphBinarySearch ( m_pTags, m_pTags+(*m_pTagCount)-1, bind ( &TagDesc_t::m_iTag ), iTag ); if ( !pTag ) return; // walk the log and tick it's chunks int iLog = pTag->m_iLogHead; while ( iLog>=0 ) { AllocsLogEntry_t * pLog = (AllocsLogEntry_t*) ( m_pBasePtr + iLog ); iLog = pLog->m_iNext; // tick each alloc for ( int i=0; im_iUsed; i++ ) pTest->TestData ( pLog->m_dEntries[i] ); } } void CSphArena::RemoveTag ( TagDesc_t * pTag ) { assert ( pTag ); assert ( pTag->m_iAllocs==0 ); // dealloc log chain int iLog = pTag->m_iLogHead; while ( iLog>=0 ) { AllocsLogEntry_t * pLog = (AllocsLogEntry_t*) ( m_pBasePtr + iLog ); int iNext = pLog->m_iNext; RawFree ( iLog ); iLog = iNext; } // remove tag from the list int iTail = m_pTags + (*m_pTagCount) - pTag - 1; memmove ( pTag, pTag+1, iTail*sizeof(TagDesc_t) ); (*m_pTagCount)--; } #if ARENADEBUG void CSphArena::CheckFreelists () { assert ( m_pFreelistHeads[0]==-1 || m_pPages[m_pFreelistHeads[0]].m_iSizeBits==0 ); for ( int iSizeSlot=1; iSizeSlot=0 && g_pMvaArena ) #else if ( m_iIndexTag>=0 && g_bHeadProcess && g_pMvaArena ) #endif g_MvaArena.TaggedFreeTag ( m_iIndexTag ); #if !USE_WINDOWS if ( g_bHeadProcess ) #endif Unlock(); } ///////////////////////////////////////////////////////////////////////////// int CSphIndex_VLN::UpdateAttributes ( const CSphAttrUpdate & tUpd, int iIndex, CSphString & sError ) { // check if we can if ( m_tSettings.m_eDocinfo!=SPH_DOCINFO_EXTERN ) { sError.SetSprintf ( "docinfo=extern required for updates" ); return -1; } // check if we have to assert ( tUpd.m_dDocids.GetLength()==tUpd.m_dRowOffset.GetLength() ); if ( !m_uDocinfo || !tUpd.m_dDocids.GetLength() ) return 0; if ( g_pBinlog ) g_pBinlog->BinlogUpdateAttributes ( m_sIndexName.cstr(), ++m_iTID, tUpd ); // remap update schema to index schema CSphVector dLocators; uint64_t uDst64 = 0; ARRAY_FOREACH ( i, tUpd.m_dAttrs ) { int iIndex = m_tSchema.GetAttrIndex ( tUpd.m_dAttrs[i].m_sName.cstr() ); if ( iIndex<0 ) { sError.SetSprintf ( "attribute '%s' not found", tUpd.m_dAttrs[i].m_sName.cstr() ); return -1; } // forbid updates on non-int columns const CSphColumnInfo & tCol = m_tSchema.GetAttr(iIndex); if (!( tCol.m_eAttrType==SPH_ATTR_BOOL || tCol.m_eAttrType==SPH_ATTR_INTEGER || tCol.m_eAttrType==SPH_ATTR_TIMESTAMP || tCol.m_eAttrType==SPH_ATTR_UINT32SET || tCol.m_eAttrType==SPH_ATTR_UINT64SET )) { sError.SetSprintf ( "attribute '%s' can not be updated (must be boolean, integer, timestamp, or MVA)", tUpd.m_dAttrs[i].m_sName.cstr() ); return -1; } // forbid updates on MVA columns if there's no arena if ( ( tCol.m_eAttrType==SPH_ATTR_UINT32SET || tCol.m_eAttrType==SPH_ATTR_UINT64SET ) && !g_pMvaArena ) { sError.SetSprintf ( "MVA attribute '%s' can not be updated (MVA arena not initialized)", tCol.m_sName.cstr() ); return -1; } bool bSrcMva = ( tCol.m_eAttrType==SPH_ATTR_UINT32SET || tCol.m_eAttrType==SPH_ATTR_UINT64SET ); bool bDstMva = ( tUpd.m_dAttrs[i].m_eAttrType==SPH_ATTR_UINT32SET || tUpd.m_dAttrs[i].m_eAttrType==SPH_ATTR_UINT64SET ); if ( bSrcMva!=bDstMva ) { sError.SetSprintf ( "attribute '%s' MVA flag mismatch", tUpd.m_dAttrs[i].m_sName.cstr() ); return -1; } if ( tCol.m_eAttrType==SPH_ATTR_UINT32SET && tUpd.m_dAttrs[i].m_eAttrType==SPH_ATTR_UINT64SET ) { sError.SetSprintf ( "attribute '%s' MVA bits (dst=%d, src=%d) mismatch", tUpd.m_dAttrs[i].m_sName.cstr(), tCol.m_eAttrType, tUpd.m_dAttrs[i].m_eAttrType ); return -1; } if ( tCol.m_eAttrType==SPH_ATTR_UINT64SET ) uDst64 |= ( U64C(1)< dRowPtrs; CSphVector dMvaPtrs; dRowPtrs.Resize ( tUpd.m_dDocids.GetLength() ); dMvaPtrs.Resize ( tUpd.m_dDocids.GetLength()*iNumMVA ); dMvaPtrs.Fill ( -1 ); // preallocate bool bFailed = false; for ( int iUpd=iFirst; iUpd ( FindDocinfo ( tUpd.m_dDocids[iUpd] ) ); if ( !dRowPtrs[iUpd] ) continue; // no such id int iPoolPos = tUpd.m_dRowOffset[iUpd]; int iMvaPtr = iUpd*iNumMVA; ARRAY_FOREACH_COND ( iCol, tUpd.m_dAttrs, !bFailed ) { bool bSrcMva32 = ( tUpd.m_dAttrs[iCol].m_eAttrType==SPH_ATTR_UINT32SET ); bool bSrcMva64 = ( tUpd.m_dAttrs[iCol].m_eAttrType==SPH_ATTR_UINT64SET ); if (!( bSrcMva32 || bSrcMva64 )) // FIXME! optimize using a prebuilt dword mask? { iPoolPos++; continue; } // get the requested new count int iNewCount = (int)tUpd.m_dPool[iPoolPos++]; iPoolPos += iNewCount; // try to alloc int iAlloc = -1; if ( iNewCount ) { bool bDst64 = ( uDst64 & ( U64C(1) << iCol ) )!=0; assert ( (iNewCount%2)==0 ); int iLen = ( bDst64 ? iNewCount : iNewCount/2 ); iAlloc = g_MvaArena.TaggedAlloc ( m_iIndexTag, (1+iLen)*sizeof(DWORD)+sizeof(SphDocID_t) ); if ( iAlloc<0 ) bFailed = true; } // whatever the outcome, move the pointer dMvaPtrs[iMvaPtr++] = iAlloc; } } // if there were any allocation failures, rollback everything if ( bFailed ) { ARRAY_FOREACH ( i, dMvaPtrs ) if ( dMvaPtrs[i]>=0 ) g_MvaArena.TaggedFreeIndex ( m_iIndexTag, dMvaPtrs[i] ); sError.SetSprintf ( "out of pool memory on MVA update" ); return -1; } // preallocation went OK; do the actual update int iRowStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); int iUpdated = 0; DWORD uUpdateMask = 0; for ( int iUpd=iFirst; iUpd ( &m_pDocinfoIndex[2*iBlock*iRowStride] ); DWORD * pIndexRanges = const_cast < DWORD * > ( &m_pDocinfoIndex[2*m_uDocinfoIndex*iRowStride] ); assert ( iBlock>=0 && iBlock<(int)m_uDocinfoIndex ); assert ( DOCINFO2ID(pEntry)==tUpd.m_dDocids[iUpd] ); pEntry = DOCINFO2ATTRS(pEntry); int iPos = tUpd.m_dRowOffset[iUpd]; int iMvaPtr = iUpd*iNumMVA; ARRAY_FOREACH ( iCol, tUpd.m_dAttrs ) { bool bSrcMva32 = ( tUpd.m_dAttrs[iCol].m_eAttrType==SPH_ATTR_UINT32SET ); bool bSrcMva64 = ( tUpd.m_dAttrs[iCol].m_eAttrType==SPH_ATTR_UINT64SET ); if (!( bSrcMva32 || bSrcMva64 )) // FIXME! optimize using a prebuilt dword mask? { // plain update SphAttr_t uValue = tUpd.m_dPool[iPos]; sphSetRowAttr ( pEntry, dLocators[iCol], uValue ); // update block and index ranges for ( int i=0; i<2; i++ ) { DWORD * pBlock = i ? pBlockRanges : pIndexRanges; SphAttr_t uMin = sphGetRowAttr ( DOCINFO2ATTRS ( pBlock ), dLocators[iCol] ); SphAttr_t uMax = sphGetRowAttr ( DOCINFO2ATTRS ( pBlock+iRowStride ) , dLocators[iCol] ); if ( uValueuMax ) { sphSetRowAttr ( DOCINFO2ATTRS ( pBlock ), dLocators[iCol], Min ( uMin, uValue ) ); sphSetRowAttr ( DOCINFO2ATTRS ( pBlock+iRowStride ), dLocators[iCol], Max ( uMax, uValue ) ); } } iPos++; uUpdateMask |= ATTRS_UPDATED; continue; } // MVA update DWORD uOldIndex = MVA_DOWNSIZE ( sphGetRowAttr ( pEntry, dLocators[iCol] ) ); // get new count, store new data if needed DWORD uNew = tUpd.m_dPool[iPos++]; uint64_t uNewMin = LLONG_MAX, uNewMax = 0; int iNewIndex = dMvaPtrs[iMvaPtr++]; SphDocID_t* pDocid = (SphDocID_t*)(g_pMvaArena + iNewIndex); *pDocid++ = tUpd.m_dDocids[iUpd]; iNewIndex = (DWORD*)pDocid - g_pMvaArena; if ( uNew ) { assert ( iNewIndex>=0 ); DWORD * pDst = g_pMvaArena + iNewIndex; const DWORD * pSrc = tUpd.m_dPool.Begin() + iPos; iPos += uNew; bool bDst64 = ( uDst64 & ( U64C(1) << iCol ) )!=0; assert ( ( uNew%2 )==0 ); int iLen = ( bDst64 ? uNew : uNew/2 ); // setup new value (flagged index) to store within row uNew = DWORD(iNewIndex) | MVA_ARENA_FLAG; // MVA values counter first *pDst++ = iLen; if ( bDst64 ) { while ( iLen ) { uint64_t uValue = MVA_UPSIZE ( pSrc ); uNewMin = Min ( uNewMin, uValue ); uNewMax = Max ( uNewMax, uValue ); *pDst++ = *pSrc++; *pDst++ = *pSrc++; iLen -= 2; } } else { while ( iLen-- ) { DWORD uValue = *pSrc; pSrc += 2; *pDst++ = uValue; uNewMin = Min ( uNewMin, uValue ); uNewMax = Max ( uNewMax, uValue ); } } } // store new value sphSetRowAttr ( pEntry, dLocators[iCol], uNew ); // update block and index ranges if ( uNew ) for ( int i=0; i<2; i++ ) { DWORD * pBlock = i ? pBlockRanges : pIndexRanges; uint64_t uMin = sphGetRowAttr ( DOCINFO2ATTRS ( pBlock ), dLocators[iCol] ); uint64_t uMax = sphGetRowAttr ( DOCINFO2ATTRS ( pBlock+iRowStride ), dLocators[iCol] ); if ( uNewMinuMax ) { sphSetRowAttr ( DOCINFO2ATTRS ( pBlock ), dLocators[iCol], Min ( uMin, uNewMin ) ); sphSetRowAttr ( DOCINFO2ATTRS ( pBlock+iRowStride ), dLocators[iCol], Max ( uMax, uNewMax ) ); } } // free old storage if needed if ( uOldIndex & MVA_ARENA_FLAG ) { uOldIndex = ((DWORD*)((SphDocID_t*)(g_pMvaArena + (uOldIndex & MVA_OFFSET_MASK))-1))-g_pMvaArena; g_MvaArena.TaggedFreeIndex ( m_iIndexTag, uOldIndex ); } uUpdateMask |= ATTRS_MVA_UPDATED; } iUpdated++; } *m_pAttrsStatus |= uUpdateMask; // FIXME! add lock/atomic? return iUpdated; } bool CSphIndex_VLN::LoadPersistentMVA ( CSphString & sError ) { // prepare the file to load CSphAutoreader fdReader; if ( !fdReader.Open ( GetIndexFileName("mvp"), m_sLastError ) ) { // no mvp means no saved attributes. m_sLastError = ""; return true; } // check if we can if ( m_tSettings.m_eDocinfo!=SPH_DOCINFO_EXTERN ) { sError.SetSprintf ( "docinfo=extern required for updates" ); return false; } DWORD uDocs = fdReader.GetDword(); // if we have docs to update if ( !uDocs ) return false; CSphVector dAffected ( uDocs ); fdReader.GetBytes ( &dAffected[0], uDocs*sizeof(SphDocID_t) ); // collect the indexes of MVA schema attributes CSphVector dMvaLocators; for ( int i=0; i dRowPtrs ( uDocs ); CSphVector dAllocs; dAllocs.Reserve ( uDocs ); // prealloc values (and also preload) bool bFailed = false; ARRAY_FOREACH ( i, dAffected ) { DWORD* pDocinfo = const_cast ( FindDocinfo ( dAffected[i] ) ); assert ( pDocinfo ); pDocinfo = DOCINFO2ATTRS ( pDocinfo ); ARRAY_FOREACH_COND ( j, dMvaLocators, !bFailed ) { // if this MVA was updated if ( MVA_DOWNSIZE ( sphGetRowAttr ( pDocinfo, dMvaLocators[j] ) ) & MVA_ARENA_FLAG ) { DWORD uCount = fdReader.GetDword(); if ( uCount ) { assert ( j dMvaLocators; for ( int i=0; i dAffected; { tDocCollector dCollect ( dAffected ); g_MvaArena.ExamineTag ( &dCollect, m_iIndexTag ); } dAffected.Uniq(); if ( !dAffected.GetLength() ) break; // prepare the file to save into; CSphWriter fdFlushMVA; fdFlushMVA.OpenFile ( GetIndexFileName("mvp.tmpnew"), m_sLastError ); if ( fdFlushMVA.IsError() ) return false; // save the vector of affected docids DWORD uPos = dAffected.GetLength(); fdFlushMVA.PutDword ( uPos ); fdFlushMVA.PutBytes ( &dAffected[0], uPos*sizeof(SphDocID_t) ); // save the updated MVA vectors ARRAY_FOREACH ( i, dAffected ) { DWORD* pDocinfo = const_cast ( FindDocinfo ( dAffected[i] ) ); assert ( pDocinfo ); pDocinfo = DOCINFO2ATTRS ( pDocinfo ); ARRAY_FOREACH ( j, dMvaLocators ) { DWORD uOldIndex = MVA_DOWNSIZE ( sphGetRowAttr ( pDocinfo, dMvaLocators[j] ) ); // if this MVA was updated if ( uOldIndex & MVA_ARENA_FLAG ) { DWORD * pMva = g_pMvaArena + ( uOldIndex & MVA_OFFSET_MASK ); DWORD uCount = *pMva; assert ( j=20 ) uSize += 2*(1+m_uDocinfoIndex)*uStride*sizeof(CSphRowitem); if ( !sphWriteThrottled ( fdTmpnew.GetFD(), m_pDocinfo.GetWritePtr(), uSize, "docinfo", m_sLastError ) ) return false; fdTmpnew.Close (); if ( !JuggleFile("spa") ) return false; if ( g_pBinlog ) g_pBinlog->NotifyIndexFlush ( m_sIndexName.cstr(), m_iTID, false ); if ( *m_pAttrsStatus==uAttrStatus ) *m_pAttrsStatus = 0; sphLogDebugvv ( "index '%s' attrs (%d) saved", m_sIndexName.cstr(), *m_pAttrsStatus ); return true; } DWORD CSphIndex_VLN::GetAttributeStatus () const { assert ( m_pAttrsStatus ); return *m_pAttrsStatus; } ///////////////////////////////////////////////////////////////////////////// #define SPH_CMPHIT_LESS(a,b) \ ( a.m_iWordID> 23 ); m_iLastHitlistPos -= m_iLastHitlistDelta; assert ( m_iLastHitlistPos>=0 ); } else { m_wrDoclist.ZipInt ( m_dLastDocFields.GetMask32() ); m_wrDoclist.ZipOffset ( m_iLastHitlistDelta ); } } else // plain format - finish doclist entry { assert ( m_tSettings.m_eHitFormat==SPH_HIT_FORMAT_PLAIN ); m_wrDoclist.ZipOffset ( m_iLastHitlistDelta ); m_wrDoclist.ZipInt ( m_dLastDocFields.GetMask32() ); m_wrDoclist.ZipInt ( m_uLastDocHits ); } m_dLastDocFields.Unset(); m_uLastDocHits = 0; } void CSphIndex_VLN::cidxHit ( CSphAggregateHit * hit, CSphRowitem * pAttrs ) { assert ( ( hit->m_iWordID!=0 && hit->m_iWordPos!=EMPTY_HIT && hit->m_iDocID!=0 ) || // it's either ok hit ( hit->m_iWordID==0 && hit->m_iWordPos==EMPTY_HIT ) ); // or "flush-hit" ///////////// // next word ///////////// bool bNextWord = ( m_tLastHit.m_iWordID!=hit->m_iWordID || ( m_bWordDict && strcmp ( (char*)m_tLastHit.m_sKeyword, (char*)hit->m_sKeyword ) ) ); // OPTIMIZE? bool bNextDoc = bNextWord || ( m_tLastHit.m_iDocID!=hit->m_iDocID ); if ( bNextDoc ) { // finish hitlist, if any Hitpos_t uLastPos = m_tLastHit.m_iWordPos; if ( m_tLastHit.m_iWordPos!=EMPTY_HIT ) { m_wrHitlist.ZipInt ( 0 ); m_tLastHit.m_iWordPos = EMPTY_HIT; } // finish doclist entry, if any if ( m_tLastHit.m_iDocID ) cidxFinishDoclistEntry ( uLastPos ); } if ( bNextWord ) { // finish doclist, if any if ( m_tLastHit.m_iDocID ) { // emit end-of-doclist marker m_wrDoclist.ZipInt ( 0 ); // emit dict entry m_pDict->DictEntry ( m_tLastHit.m_iWordID, m_tLastHit.m_sKeyword, m_iLastWordDocs, m_iLastWordHits, m_iLastWordDoclist, m_wrDoclist.GetPos()-m_iLastWordDoclist ); // reset trackers m_iLastWordDocs = 0; m_iLastWordHits = 0; m_tLastHit.m_iDocID = 0; m_iLastHitlistPos = 0; } // flush wordlist, if this is the end if ( hit->m_iWordPos==EMPTY_HIT ) { m_pDict->DictEndEntries ( m_wrDoclist.GetPos() ); return; } assert ( hit->m_iWordID > m_tLastHit.m_iWordID || ( m_bWordDict && hit->m_iWordID==m_tLastHit.m_iWordID && strcmp ( (char*)hit->m_sKeyword, (char*)m_tLastHit.m_sKeyword )>0 ) || m_bMerging ); m_iLastWordDoclist = m_wrDoclist.GetPos(); m_tLastHit.m_iWordID = hit->m_iWordID; if ( m_bWordDict ) { assert ( strlen ( (char *)hit->m_sKeyword )m_sKeyword, sizeof(m_sLastKeyword) ); // OPTIMIZE? } } if ( bNextDoc ) { // begin new doclist entry for new doc id assert ( hit->m_iDocID>m_tLastHit.m_iDocID ); assert ( m_wrHitlist.GetPos()>=m_iLastHitlistPos ); m_wrDoclist.ZipOffset ( hit->m_iDocID - m_tLastHit.m_iDocID ); if ( pAttrs ) { for ( int i=0; im_pDynamic[i] ); } m_iLastHitlistDelta = m_wrHitlist.GetPos() - m_iLastHitlistPos; m_tLastHit.m_iDocID = hit->m_iDocID; m_iLastHitlistPos = m_wrHitlist.GetPos(); // update per-word stats m_iLastWordDocs++; } /////////// // the hit /////////// if ( !hit->m_dFieldMask.TestAll(false) ) // merge aggregate hits into the current hit { int iHitCount = hit->GetAggrCount(); assert ( m_tSettings.m_eHitless ); assert ( iHitCount ); assert ( !hit->m_dFieldMask.TestAll(false) ); m_uLastDocHits += iHitCount; m_dLastDocFields |= hit->m_dFieldMask; m_iLastWordHits += iHitCount; if ( m_tSettings.m_eHitless==SPH_HITLESS_SOME ) m_iLastWordDocs |= 0x80000000; } else // handle normal hits { // add hit delta if ( hit->m_iWordPos==m_tLastHit.m_iWordPos ) return; assert ( m_tLastHit.m_iWordPos < hit->m_iWordPos ); m_wrHitlist.ZipInt ( hit->m_iWordPos - m_tLastHit.m_iWordPos ); m_tLastHit.m_iWordPos = hit->m_iWordPos; m_iLastWordHits++; // update matched fields mask m_dLastDocFields.Set ( HITMAN::GetField ( hit->m_iWordPos ) ); m_uLastDocHits++; } } void CSphIndex_VLN::WriteSchemaColumn ( CSphWriter & fdInfo, const CSphColumnInfo & tCol ) { int iLen = strlen ( tCol.m_sName.cstr() ); fdInfo.PutDword ( iLen ); fdInfo.PutBytes ( tCol.m_sName.cstr(), iLen ); #if USE_PYTHON_CASE_SENSIVE_ATTR //coreseek python source only, used to make py source case sentive if(tCol.m_sNameExactly.IsEmpty()) { // if not have m_sNameExactly, write m_sName as m_sNameExactly iLen = strlen ( tCol.m_sName.cstr() ); fdInfo.PutDword ( iLen ); fdInfo.PutBytes ( tCol.m_sName.cstr(), iLen ); }else{ iLen = strlen ( tCol.m_sNameExactly.cstr() ); fdInfo.PutDword ( iLen ); fdInfo.PutBytes ( tCol.m_sNameExactly.cstr(), iLen ); } #endif ESphAttr eAttrType = tCol.m_eAttrType; if ( eAttrType==SPH_ATTR_WORDCOUNT ) eAttrType = SPH_ATTR_INTEGER; fdInfo.PutDword ( eAttrType ); fdInfo.PutDword ( tCol.m_tLocator.CalcRowitem() ); // for backwards compatibility fdInfo.PutDword ( tCol.m_tLocator.m_iBitOffset ); fdInfo.PutDword ( tCol.m_tLocator.m_iBitCount ); fdInfo.PutByte ( tCol.m_bPayload ); } void CSphIndex_VLN::ReadSchemaColumn ( CSphReader & rdInfo, CSphColumnInfo & tCol ) { tCol.m_sName = rdInfo.GetString (); if ( tCol.m_sName.IsEmpty () ) tCol.m_sName = "@emptyname"; tCol.m_sName.ToLower (); #if USE_PYTHON_CASE_SENSIVE_ATTR tCol.m_sNameExactly = rdInfo.GetString (); if ( tCol.m_sNameExactly.IsEmpty () ) tCol.m_sNameExactly = "@emptyname"; #endif tCol.m_eAttrType = (ESphAttr) rdInfo.GetDword (); // FIXME? check/fixup? if ( m_uVersion>=5 ) { rdInfo.GetDword (); // ignore rowitem tCol.m_tLocator.m_iBitOffset = rdInfo.GetDword (); tCol.m_tLocator.m_iBitCount = rdInfo.GetDword (); } else { tCol.m_tLocator.m_iBitOffset = -1; tCol.m_tLocator.m_iBitCount = -1; } if ( m_uVersion>=16 ) tCol.m_bPayload = ( rdInfo.GetByte()!=0 ); } bool CSphIndex_VLN::WriteHeader ( CSphWriter & fdInfo, SphOffset_t iCheckpointsPos, DWORD iCheckpointCount ) { // version fdInfo.PutDword ( INDEX_MAGIC_HEADER ); fdInfo.PutDword ( INDEX_FORMAT_VERSION ); // bits fdInfo.PutDword ( USE_64BIT ); // docinfo fdInfo.PutDword ( m_tSettings.m_eDocinfo ); // schema fdInfo.PutDword ( m_tSchema.m_dFields.GetLength() ); ARRAY_FOREACH ( i, m_tSchema.m_dFields ) WriteSchemaColumn ( fdInfo, m_tSchema.m_dFields[i] ); fdInfo.PutDword ( m_tSchema.GetAttrsCount() ); for ( int i=0; im_iDocID ); // was dword in v.1 if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) fdInfo.PutBytes ( m_pMin->m_pDynamic, m_tSchema.GetRowSize()*sizeof(CSphRowitem) ); // wordlist checkpoints fdInfo.PutOffset ( iCheckpointsPos ); fdInfo.PutDword ( iCheckpointCount ); // index stats fdInfo.PutDword ( m_tStats.m_iTotalDocuments ); fdInfo.PutOffset ( m_tStats.m_iTotalBytes ); // index settings SaveSettings ( fdInfo ); // tokenizer info assert ( m_pTokenizer ); SaveTokenizerSettings ( fdInfo, m_pTokenizer ); // dictionary info assert ( m_pDict ); SaveDictionarySettings ( fdInfo, m_pDict ); fdInfo.PutDword ( m_iKillListSize ); fdInfo.PutDword ( m_uMinMaxIndex ); return true; } bool CSphIndex_VLN::cidxDone ( const char * sHeaderExtension, int iMemLimit ) { // flush wordlist checkpoints SphOffset_t iCheckpointsPos; int iCheckpointsCount; if ( !m_pDict->DictEnd ( &iCheckpointsPos, &iCheckpointsCount, iMemLimit, m_sLastError ) ) return false; ///////////////// // create header ///////////////// CSphWriter fdInfo; fdInfo.OpenFile ( GetIndexFileName ( sHeaderExtension ), m_sLastError ); if ( fdInfo.IsError() ) return false; if ( !WriteHeader ( fdInfo, iCheckpointsPos, iCheckpointsCount ) ) return false; //////////////////////// // close all data files //////////////////////// fdInfo.CloseFile (); m_wrDoclist.CloseFile (); m_wrHitlist.CloseFile ( true ); if ( fdInfo.IsError() || m_pDict->DictIsError() || m_wrDoclist.IsError() || m_wrHitlist.IsError() ) return false; return true; } inline int encodeVLB ( BYTE * buf, DWORD v ) { register BYTE b; register int n = 0; do { b = (BYTE)(v & 0x7f); v >>= 7; if ( v ) b |= 0x80; *buf++ = b; n++; } while ( v ); return n; } inline int encodeVLB8 ( BYTE * buf, uint64_t v ) { register BYTE b; register int n = 0; do { b = (BYTE)(v & 0x7f); v >>= 7; if ( v ) b |= 0x80; *buf++ = b; n++; } while ( v ); return n; } inline int encodeKeyword ( BYTE * pBuf, const char * pKeyword ) { int iLen = strlen ( pKeyword ); // OPTIMIZE! remove this and memcpy and check if thats faster assert ( iLen>0 && iLen<128 ); // so that ReadVLB() *pBuf = (BYTE) iLen; memcpy ( pBuf+1, pKeyword, iLen ); return 1+iLen; } int CSphIndex_VLN::cidxWriteRawVLB ( int fd, CSphWordHit * pHit, int iHits, DWORD * pDocinfo, int iDocinfos, int iStride ) { PROFILE ( write_hits ); assert ( pHit ); assert ( iHits>0 ); ///////////////////////////// // do simple bitwise hashing ///////////////////////////// static const int HBITS = 11; static const int HSIZE = ( 1 << HBITS ); SphDocID_t iStartID = 0; int dHash [ HSIZE+1 ]; int iShift = 0; if ( pDocinfo ) { iStartID = DOCINFO2ID ( pDocinfo ); int iBits = sphLog2 ( DOCINFO2ID ( pDocinfo + (iDocinfos-1)*iStride ) - iStartID ); iShift = ( iBits> iShift ); assert ( iHash>=0 && iHashiHashed ) { dHash [ iHashed+1 ] = i-1; // right boundary for prev hash value dHash [ iHash ] = i; // left boundary for next hash value iHashed = iHash; } } dHash [ iHashed+1 ] = iDocinfos-1; // right boundary for last hash value } /////////////////////////////////////// // encode through a small write buffer /////////////////////////////////////// BYTE *pBuf, *maxP; int n = 0, w; SphWordID_t d1, l1 = 0; SphDocID_t d2, l2 = 0; DWORD d3, l3 = 0; // !COMMIT must be wide enough bool bWordDict = m_pDict->GetSettings().m_bWordDict; int iGap = Max ( 128, 16*sizeof(DWORD) + iStride*sizeof(DWORD) + ( bWordDict ? MAX_KEYWORD_BYTES : 0 ) ); pBuf = m_pWriteBuffer; maxP = m_pWriteBuffer + m_iWriteBuffer - iGap; SphDocID_t iAttrID = 0; // current doc id DWORD * pAttrs = NULL; // current doc attrs // hit aggregation state DWORD uHitCount = 0; DWORD uHitFieldMask = 0; const int iPositionShift = m_tSettings.m_eHitless==SPH_HITLESS_SOME ? 1 : 0; while ( iHits-- ) { // find attributes by id if ( pDocinfo && iAttrID!=pHit->m_iDocID ) { int iHash = (int)( ( pHit->m_iDocID - iStartID ) >> iShift ); assert ( iHash>=0 && iHashm_iDocID==DOCINFO2ID ( pDocinfo + iStart*iStride ) ) { pAttrs = DOCINFO2ATTRS ( pDocinfo + iStart*iStride ); } else if ( pHit->m_iDocID==DOCINFO2ID ( pDocinfo + iEnd*iStride ) ) { pAttrs = DOCINFO2ATTRS ( pDocinfo + iEnd*iStride ); } else { pAttrs = NULL; while ( iEnd-iStart>1 ) { // check if nothing found if ( pHit->m_iDocID < DOCINFO2ID ( pDocinfo + iStart*iStride ) || pHit->m_iDocID > DOCINFO2ID ( pDocinfo + iEnd*iStride ) ) break; assert ( pHit->m_iDocID > DOCINFO2ID ( pDocinfo + iStart*iStride ) ); assert ( pHit->m_iDocID < DOCINFO2ID ( pDocinfo + iEnd*iStride ) ); int iMid = iStart + (iEnd-iStart)/2; if ( pHit->m_iDocID==DOCINFO2ID ( pDocinfo + iMid*iStride ) ) { pAttrs = DOCINFO2ATTRS ( pDocinfo + iMid*iStride ); break; } if ( pHit->m_iDocIDm_iDocID ); iAttrID = pHit->m_iDocID; } // calc deltas d1 = pHit->m_iWordID - l1; d2 = pHit->m_iDocID - l2; d3 = pHit->m_iWordPos - l3; // ignore duplicate hits if ( d1==0 && d2==0 && d3==0 ) // OPTIMIZE? check if ( 0==(d1|d2|d3) ) is faster { pHit++; continue; } // non-zero delta restarts all the fields after it // because their deltas might now be negative if ( d1 ) d2 = pHit->m_iDocID; if ( d2 ) d3 = pHit->m_iWordPos; // when we moved to the next word or document bool bFlushed = false; if ( d1 || d2 ) { // flush previous aggregate hit if ( uHitCount ) { // we either skip all hits or the high bit must be available for marking // failing that, we can't produce a consistent index assert ( m_tSettings.m_eHitless!=SPH_HITLESS_NONE ); assert ( m_tSettings.m_eHitless==SPH_HITLESS_ALL || !( uHitCount & 0x80000000UL ) ); if ( m_tSettings.m_eHitless!=SPH_HITLESS_ALL ) uHitCount = ( uHitCount << 1 ) | 1; pBuf += encodeVLB ( pBuf, uHitCount ); pBuf += encodeVLB ( pBuf, uHitFieldMask ); assert ( pBufm_iWordID ) ) ) { uHitCount = 1; uHitFieldMask |= 1 << HITMAN::GetField ( pHit->m_iWordPos ); } } else if ( uHitCount ) // next hit for the same word/doc pair, update state if we need it { uHitCount++; uHitFieldMask |= 1 << HITMAN::GetField ( pHit->m_iWordPos ); } // encode enough restart markers if ( d1 ) pBuf += encodeVLB ( pBuf, 0 ); if ( d2 && !bFlushed ) pBuf += encodeVLB ( pBuf, 0 ); assert ( pBufHitblockGetKeyword ( pHit->m_iWordID ) ); // keyword itself in case of keywords dict else pBuf += LOC_ENCODE ( pBuf, d1 ); // delta in case of CRC dict assert ( pBufm_iWordID; l2 = pHit->m_iDocID; l3 = pHit->m_iWordPos; pHit++; if ( pBuf>maxP ) { w = (int)(pBuf - m_pWriteBuffer); assert ( w b.m_iWordID ) return false; if ( a.m_sKeyword ) { int iCmp = strcmp ( (char*)a.m_sKeyword, (char*)b.m_sKeyword ); // OPTIMIZE? if ( iCmp!=0 ) return ( iCmp<0 ); } return ( a.m_iDocID < b.m_iDocID ) || ( a.m_iDocID==b.m_iDocID && a.m_iWordPos0 ); m_iSize = iSize; m_iUsed = 0; m_pData = new CSphHitQueueEntry [ iSize ]; } /// destroy queue ~CSphHitQueue () { SafeDeleteArray ( m_pData ); } /// add entry to the queue void Push ( CSphAggregateHit & tHit, int iBin ) { // check for overflow and do add assert ( m_iUsed> 1; if ( SPH_CMPAGGRHIT_LESS ( m_pData[iEntry], m_pData[iParent] ) ) { // entry is less than parent, should float to the top Swap ( m_pData[iEntry], m_pData[iParent] ); iEntry = iParent; } else { break; } } } /// remove root (ie. top priority) entry void Pop () { assert ( m_iUsed ); if ( !(--m_iUsed) ) // empty queue? just return return; // make the last entry my new root m_pData[0] = m_pData[m_iUsed]; // sift down if needed int iEntry = 0; for ( ;; ) { // select child int iChild = (iEntry<<1) + 1; if ( iChild>=m_iUsed ) break; // select smallest child if ( iChild+1 & dSources, CSphAutoArray & dHits, int iArenaSize, int iFieldFD, int nFieldMVAs, int iFieldMVAInPool ) { // initialize writer (data file must always exist) CSphWriter wrMva; if ( !wrMva.OpenFile ( GetIndexFileName("spm"), m_sLastError ) ) return false; // calcs and checks bool bOnlyFieldMVAs = true; CSphVector dMvaIndexes; for ( int i=0; i dBlockLens; dBlockLens.Reserve ( 1024 ); m_tProgress.m_ePhase = CSphIndexProgress::PHASE_COLLECT_MVA; if ( !bOnlyFieldMVAs ) { ARRAY_FOREACH ( iSource, dSources ) { CSphSource * pSource = dSources[iSource]; if ( !pSource->Connect ( m_sLastError ) ) return false; ARRAY_FOREACH ( i, dMvaIndexes ) { int iAttr = dMvaIndexes[i]; const CSphColumnInfo & tAttr = m_tSchema.GetAttr(iAttr); if ( tAttr.m_eSrc==SPH_ATTRSRC_FIELD ) continue; if ( !pSource->IterateMultivaluedStart ( iAttr, m_sLastError ) ) return false; while ( pSource->IterateMultivaluedNext () ) { pMva->m_uDocID = pSource->m_tDocInfo.m_iDocID; pMva->m_iAttr = i; pMva->m_uValue = pSource->m_tDocInfo.GetAttr ( tAttr.m_tLocator ); if ( ++pMva>=pMvaMax ) { sphSort ( pMvaPool, pMva-pMvaPool ); if ( !sphWriteThrottled ( fdTmpMva.GetFD(), pMvaPool, (pMva-pMvaPool)*sizeof(MvaEntry_t), "temp_mva", m_sLastError ) ) return false; dBlockLens.Add ( pMva-pMvaPool ); m_tProgress.m_iAttrs += pMva-pMvaPool; pMva = pMvaPool; if ( m_pProgress ) m_pProgress ( &m_tProgress, false ); } } } pSource->Disconnect (); } if ( pMva>pMvaPool ) { sphSort ( pMvaPool, pMva-pMvaPool ); if ( !sphWriteThrottled ( fdTmpMva.GetFD(), pMvaPool, (pMva-pMvaPool)*sizeof(MvaEntry_t), "temp_mva", m_sLastError ) ) return false; dBlockLens.Add ( pMva-pMvaPool ); m_tProgress.m_iAttrs += pMva-pMvaPool; pMva = pMvaPool; } } if ( m_pProgress ) m_pProgress ( &m_tProgress, true ); /////////////////////////// // free memory for sorting /////////////////////////// dHits.Reset (); ////////////// // fully sort ////////////// if ( m_pProgress ) { m_tProgress.m_ePhase = CSphIndexProgress::PHASE_SORT_MVA; m_tProgress.m_iAttrs = m_tProgress.m_iAttrs + nFieldMVAs; m_tProgress.m_iAttrsTotal = m_tProgress.m_iAttrs; m_pProgress ( &m_tProgress, false ); } int nLastBlockFieldMVAs = iFieldMVAInPool ? ( nFieldMVAs % iFieldMVAInPool ) : 0; int nFieldBlocks = iFieldMVAInPool ? ( nFieldMVAs / iFieldMVAInPool + ( nLastBlockFieldMVAs ? 1 : 0 ) ) : 0; // initialize readers CSphVector dBins; dBins.Reserve ( dBlockLens.GetLength() + nFieldBlocks ); int iBinSize = CSphBin::CalcBinSize ( iArenaSize, dBlockLens.GetLength() + nFieldBlocks, "sort_mva" ); SphOffset_t iSharedOffset = -1; ARRAY_FOREACH ( i, dBlockLens ) { dBins.Add ( new CSphBin() ); dBins[i]->m_iFileLeft = dBlockLens[i]*sizeof(MvaEntry_t); dBins[i]->m_iFilePos = ( i==0 ) ? 0 : dBins[i-1]->m_iFilePos + dBins[i-1]->m_iFileLeft; dBins[i]->Init ( fdTmpMva.GetFD(), &iSharedOffset, iBinSize ); } SphOffset_t iSharedFieldOffset = -1; SphOffset_t uStart = 0; for ( int i = 0; i < nFieldBlocks; i++ ) { dBins.Add ( new CSphBin() ); int iBin = dBins.GetLength () - 1; dBins[iBin]->m_iFileLeft = ( i==nFieldBlocks-1 ? ( nLastBlockFieldMVAs ? nLastBlockFieldMVAs : iFieldMVAInPool ): iFieldMVAInPool ) * sizeof(MvaEntry_t); dBins[iBin]->m_iFilePos = uStart; dBins[iBin]->Init ( iFieldFD, &iSharedFieldOffset, iBinSize ); uStart += dBins [iBin]->m_iFileLeft; } // do the sort CSphQueue < MvaEntryTag_t, MvaEntryCmp_fn > qMva ( Max ( 1, dBins.GetLength() ) ); ARRAY_FOREACH ( i, dBins ) { MvaEntryTag_t tEntry; if ( dBins[i]->ReadBytes ( (MvaEntry_t*) &tEntry, sizeof(MvaEntry_t) )!=BIN_READ_OK ) { m_sLastError.SetSprintf ( "sort_mva: warmup failed (io error?)" ); return false; } tEntry.m_iTag = i; qMva.Push ( tEntry ); } // spm-file := info-list [ 0+ ] // info-list := docid, values-list [ index.schema.mva-count ] // values-list := values-count, value [ values-count ] // note that mva32 come first then mva64 SphDocID_t uCurID = 0; CSphVector < CSphVector > dCurInfo; dCurInfo.Resize ( dMvaIndexes.GetLength() ); for ( ;; ) { // flush previous per-document info-list if ( !qMva.GetLength() || qMva.Root().m_uDocID!=uCurID ) { if ( uCurID ) { wrMva.PutDocid ( uCurID ); ARRAY_FOREACH ( i, dCurInfo ) { int iLen = dCurInfo[i].GetLength(); if ( i>=iMva64 ) { wrMva.PutDword ( iLen*2 ); wrMva.PutBytes ( dCurInfo[i].Begin(), sizeof(uint64_t)*iLen ); } else { wrMva.PutDword ( iLen ); ARRAY_FOREACH ( iVal, dCurInfo[i] ) { wrMva.PutDword ( (DWORD)dCurInfo[i][iVal] ); } } } } if ( !qMva.GetLength() ) break; uCurID = qMva.Root().m_uDocID; ARRAY_FOREACH ( i, dCurInfo ) dCurInfo[i].Resize ( 0 ); } // accumulate this entry #if PARANOID assert ( dCurInfo [ qMva.Root().m_iAttr ].GetLength()==0 || dCurInfo [ qMva.Root().m_iAttr ].Last()<=qMva.Root().m_uValue ); #endif dCurInfo [ qMva.Root().m_iAttr ].AddUnique ( qMva.Root().m_uValue ); // get next entry int iBin = qMva.Root().m_iTag; qMva.Pop (); MvaEntryTag_t tEntry; ESphBinRead iRes = dBins[iBin]->ReadBytes ( (MvaEntry_t*)&tEntry, sizeof(MvaEntry_t) ); tEntry.m_iTag = iBin; if ( iRes==BIN_READ_OK ) qMva.Push ( tEntry ); if ( iRes==BIN_READ_ERROR ) { m_sLastError.SetSprintf ( "sort_mva: read error" ); return false; } } // clean up readers ARRAY_FOREACH ( i, dBins ) SafeDelete ( dBins[i] ); wrMva.CloseFile (); if ( wrMva.IsError() ) return false; if ( m_pProgress ) m_pProgress ( &m_tProgress, true ); return true; } struct CmpOrdinalsValue_fn { inline bool IsLess ( const Ordinal_t & a, const Ordinal_t & b ) const { return strcmp ( a.m_sValue.cstr(), b.m_sValue.cstr() )<0; } }; struct CmpOrdinalsEntry_fn { static inline bool IsLess ( const OrdinalEntry_t & a, const OrdinalEntry_t & b ) { return strcmp ( a.m_sValue.cstr(), b.m_sValue.cstr() )<0; } }; struct CmpOrdinalsDocid_fn { inline bool IsLess ( const OrdinalId_t & a, const OrdinalId_t & b ) const { return a.m_uDocID < b.m_uDocID; } }; struct CmpMvaEntries_fn { inline bool IsLess ( const MvaEntry_t & a, const MvaEntry_t & b ) const { return a & dOrdinals ) { SphOffset_t uSize = ( sizeof ( SphDocID_t ) + sizeof ( DWORD ) ) * dOrdinals.GetLength (); ARRAY_FOREACH ( i, dOrdinals ) { Ordinal_t & Ord = dOrdinals[i]; DWORD uValueLen = Ord.m_sValue.cstr () ? strlen ( Ord.m_sValue.cstr () ) : 0; Writer.PutBytes ( &(Ord.m_uDocID), sizeof ( Ord.m_uDocID ) ); Writer.PutBytes ( &uValueLen, sizeof ( uValueLen ) ); Writer.PutBytes ( Ord.m_sValue.cstr (), uValueLen ); uSize += uValueLen; if ( Writer.IsError () ) return 0; } return uSize; } ESphBinRead CSphIndex_VLN::ReadOrdinal ( CSphBin & Reader, Ordinal_t & Ordinal ) { ESphBinRead eRes = Reader.ReadBytes ( &Ordinal.m_uDocID, sizeof ( Ordinal.m_uDocID ) ); if ( eRes!=BIN_READ_OK ) return eRes; DWORD uStrLen; eRes = Reader.ReadBytes ( &uStrLen, sizeof ( DWORD ) ); if ( eRes!=BIN_READ_OK ) return eRes; if ( uStrLen>=(DWORD)MAX_ORDINAL_STR_LEN ) return BIN_READ_ERROR; char dBuffer [MAX_ORDINAL_STR_LEN]; if ( uStrLen > 0 ) { eRes = Reader.ReadBytes ( dBuffer, uStrLen ); if ( eRes!=BIN_READ_OK ) return eRes; } dBuffer [uStrLen] = '\0'; Ordinal.m_sValue = dBuffer; return BIN_READ_OK; } bool CSphIndex_VLN::SortOrdinals ( const char * szToFile, int iFromFD, int iArenaSize, int iOrdinalsInPool, CSphVector < CSphVector < SphOffset_t > > & dOrdBlockSize, bool bWarnOfMem ) { int nAttrs = dOrdBlockSize.GetLength (); int nBlocks = dOrdBlockSize[0].GetLength (); CSphWriter Writer; if ( !Writer.OpenFile ( szToFile, m_sLastError ) ) return false; int iBinSize = CSphBin::CalcBinSize ( iArenaSize, nBlocks, "ordinals", bWarnOfMem ); SphOffset_t iSharedOffset = -1; CSphQueue < OrdinalEntry_t, CmpOrdinalsEntry_fn > qOrdinals ( Max ( 1, nBlocks ) ); OrdinalEntry_t tOrdinalEntry; DWORD uOrdinalId = 0; CSphVector < OrdinalId_t > dOrdinalIdPool; dOrdinalIdPool.Reserve ( nBlocks ); CSphVector < CSphVector < SphOffset_t > > dStarts; dStarts.Resize ( nAttrs ); ARRAY_FOREACH ( i, dStarts ) dStarts[i].Resize ( nBlocks ); SphOffset_t uStart = 0; for ( int iBlock = 0; iBlock < nBlocks; iBlock++ ) for ( int iAttr = 0; iAttr < nAttrs; iAttr++ ) { dStarts [iAttr][iBlock] = uStart; uStart += dOrdBlockSize [iAttr][iBlock]; } for ( int iAttr = 0; iAttr < nAttrs; iAttr++ ) { CSphVector < CSphBin > dBins; dBins.Resize ( nBlocks ); ARRAY_FOREACH ( i, dBins ) { dBins[i].m_iFileLeft = (int)dOrdBlockSize[iAttr][i]; dBins[i].m_iFilePos = dStarts[iAttr][i]; dBins[i].Init ( iFromFD, &iSharedOffset, iBinSize ); } dOrdBlockSize [iAttr].Resize ( 0 ); for ( int iBlock = 0; iBlock < nBlocks; iBlock++ ) { if ( ReadOrdinal ( dBins [iBlock], tOrdinalEntry )!=BIN_READ_OK ) { m_sLastError = "sort_ordinals: warmup failed (io error?)"; return false; } tOrdinalEntry.m_iTag = iBlock; qOrdinals.Push ( tOrdinalEntry ); } SphDocID_t uCurID = 0; CSphString sLastOrdValue; int iMyBlock = 0; for ( ;; ) { if ( !qOrdinals.GetLength () || qOrdinals.Root ().m_uDocID!=uCurID ) { if ( uCurID ) { OrdinalId_t tId; tId.m_uDocID = uCurID; tId.m_uId = uOrdinalId; dOrdinalIdPool.Add ( tId ); if ( qOrdinals.GetLength () > 0 ) { if ( sLastOrdValue.cstr()[0]!=qOrdinals.Root ().m_sValue.cstr()[0] ) uOrdinalId++; else if ( strcmp ( sLastOrdValue.cstr (), qOrdinals.Root ().m_sValue.cstr () ) ) uOrdinalId++; } if ( dOrdinalIdPool.GetLength()==iOrdinalsInPool ) { dOrdinalIdPool.Sort ( CmpOrdinalsDocid_fn () ); Writer.PutBytes ( &dOrdinalIdPool[0], sizeof(OrdinalId_t)*dOrdinalIdPool.GetLength() ); if ( Writer.IsError () ) { m_sLastError = "sort_ordinals: io error"; return false; } dOrdBlockSize [iAttr].Add ( dOrdinalIdPool.GetLength () * sizeof ( OrdinalId_t ) ); dOrdinalIdPool.Resize ( 0 ); } } if ( !qOrdinals.GetLength () ) break; uCurID = qOrdinals.Root().m_uDocID; const_cast < CSphString & > ( qOrdinals.Root ().m_sValue ).Swap ( sLastOrdValue ); } // get next entry iMyBlock = qOrdinals.Root().m_iTag; qOrdinals.Pop (); ESphBinRead eRes = ReadOrdinal ( dBins [iMyBlock], tOrdinalEntry ); tOrdinalEntry.m_iTag = iMyBlock; if ( eRes==BIN_READ_OK ) qOrdinals.Push ( tOrdinalEntry ); if ( eRes==BIN_READ_ERROR ) { m_sLastError = "sort_ordinals: read error"; return false; } } // flush last ordinal ids if ( dOrdinalIdPool.GetLength () ) { dOrdinalIdPool.Sort ( CmpOrdinalsDocid_fn () ); Writer.PutBytes ( &dOrdinalIdPool[0], sizeof(OrdinalId_t)*dOrdinalIdPool.GetLength () ); if ( Writer.IsError () ) { m_sLastError = "sort_ordinals: io error"; return false; } dOrdBlockSize [iAttr].Add ( dOrdinalIdPool.GetLength()*sizeof(OrdinalId_t) ); dOrdinalIdPool.Resize ( 0 ); } } Writer.CloseFile (); if ( Writer.IsError () ) return false; return true; } bool CSphIndex_VLN::SortOrdinalIds ( const char * szToFile, int iFromFD, int iArenaSize, CSphVector < CSphVector < SphOffset_t > > & dOrdBlockSize, bool bWarnOfMem ) { int nAttrs = dOrdBlockSize.GetLength (); int nMaxBlocks = 0; ARRAY_FOREACH ( i, dOrdBlockSize ) if ( dOrdBlockSize[i].GetLength () > nMaxBlocks ) nMaxBlocks = dOrdBlockSize[i].GetLength (); CSphWriter Writer; if ( !Writer.OpenFile ( szToFile, m_sLastError ) ) return false; int iBinSize = CSphBin::CalcBinSize ( iArenaSize, nMaxBlocks, "ordinals", bWarnOfMem ); SphOffset_t uStart = 0; OrdinalIdEntry_t tOrdinalIdEntry; OrdinalId_t tOrdinalId; for ( int iAttr = 0; iAttr < nAttrs; ++iAttr ) { int nBlocks = dOrdBlockSize [iAttr].GetLength (); CSphQueue < OrdinalIdEntry_t, CmpOrdinalIdEntry_fn > qOrdinalIds ( Max ( 1, nBlocks ) ); CSphVector < CSphBin > dBins; dBins.Resize ( nBlocks ); SphOffset_t iSharedOffset = -1; ARRAY_FOREACH ( i, dBins ) { dBins[i].m_iFileLeft = (int)dOrdBlockSize [iAttr][i]; dBins[i].m_iFilePos = uStart; dBins[i].Init ( iFromFD, &iSharedOffset, iBinSize ); uStart += dBins[i].m_iFileLeft; } for ( int iBlock = 0; iBlock < nBlocks; iBlock++ ) { if ( dBins[iBlock].ReadBytes ( &tOrdinalId, sizeof ( tOrdinalId ) )!=BIN_READ_OK ) { m_sLastError = "sort_ordinals: warmup failed (io error?)"; return false; } tOrdinalIdEntry.m_uDocID = tOrdinalId.m_uDocID; tOrdinalIdEntry.m_uId = tOrdinalId.m_uId; tOrdinalIdEntry.m_iTag = iBlock; qOrdinalIds.Push ( tOrdinalIdEntry ); } OrdinalId_t tCachedId; tCachedId.m_uDocID = 0; SphOffset_t uResultSize = 0; for ( ;; ) { if ( !qOrdinalIds.GetLength () || qOrdinalIds.Root ().m_uDocID!=tCachedId.m_uDocID ) { if ( tCachedId.m_uDocID ) { uResultSize += sizeof ( OrdinalId_t ); Writer.PutBytes ( &tCachedId, sizeof ( OrdinalId_t ) ); if ( Writer.IsError () ) { m_sLastError = "sort_ordinals: io error"; return false; } } if ( !qOrdinalIds.GetLength () ) break; tCachedId.m_uDocID = qOrdinalIds.Root().m_uDocID; tCachedId.m_uId = qOrdinalIds.Root ().m_uId; } // get next entry int iBlock = qOrdinalIds.Root().m_iTag; qOrdinalIds.Pop (); ESphBinRead eRes = dBins [iBlock].ReadBytes ( &tOrdinalId, sizeof ( tOrdinalId ) ); tOrdinalIdEntry.m_uDocID = tOrdinalId.m_uDocID; tOrdinalIdEntry.m_uId = tOrdinalId.m_uId; tOrdinalIdEntry.m_iTag = iBlock; if ( eRes==BIN_READ_OK ) qOrdinalIds.Push ( tOrdinalIdEntry ); if ( eRes==BIN_READ_ERROR ) { m_sLastError = "sort_ordinals: read error"; return false; } } dOrdBlockSize [iAttr].Resize ( 0 ); dOrdBlockSize [iAttr].Add ( uResultSize ); } return true; } struct FieldMVARedirect_t { int m_iAttr; int m_iMVAAttr; CSphAttrLocator m_tLocator; }; bool CSphIndex_VLN::RelocateBlock ( int iFile, BYTE * pBuffer, int iRelocationSize, SphOffset_t * pFileSize, CSphBin * pMinBin, SphOffset_t * pSharedOffset ) { assert ( pBuffer && pFileSize && pMinBin && pSharedOffset ); SphOffset_t iBlockStart = pMinBin->m_iFilePos; SphOffset_t iBlockLeft = pMinBin->m_iFileLeft; ESphBinRead eRes = pMinBin->Precache (); switch ( eRes ) { case BIN_PRECACHE_OK: return true; case BIN_READ_ERROR: m_sLastError = "block relocation: preread error"; return false; default: break; } int nTransfers = (int)( ( iBlockLeft+iRelocationSize-1) / iRelocationSize ); SphOffset_t uTotalRead = 0; SphOffset_t uNewBlockStart = *pFileSize; for ( int i = 0; i < nTransfers; i++ ) { sphSeek ( iFile, iBlockStart + uTotalRead, SEEK_SET ); int iToRead = i==nTransfers-1 ? (int)( iBlockLeft % iRelocationSize ) : iRelocationSize; size_t iRead = sphReadThrottled ( iFile, pBuffer, iToRead ); if ( iRead!=size_t(iToRead) ) { m_sLastError.SetSprintf ( "block relocation: read error (%d of %d bytes read): %s", (int)iRead, iToRead, strerror(errno) ); return false; } sphSeek ( iFile, *pFileSize, SEEK_SET ); uTotalRead += iToRead; if ( !sphWriteThrottled ( iFile, pBuffer, iToRead, "block relocation", m_sLastError ) ) return false; *pFileSize += iToRead; } assert ( uTotalRead==iBlockLeft ); // update block pointers pMinBin->m_iFilePos = uNewBlockStart; *pSharedOffset = *pFileSize; return true; } static int CountWords ( const CSphString & sData, ISphTokenizer * pTokenizer ) { BYTE * sField = (BYTE*) sData.cstr(); if ( !sField ) return 0; int iCount = 0; pTokenizer->SetBuffer ( sField, (int)strlen ( (char*)sField ) ); while ( pTokenizer->GetToken() ) iCount++; return iCount; } bool CSphIndex_VLN::LoadHitlessWords () { assert ( m_dHitlessWords.GetLength()==0 ); if ( m_tSettings.m_sHitlessFile.IsEmpty() ) return true; CSphAutofile tFile ( m_tSettings.m_sHitlessFile.cstr(), SPH_O_READ, m_sLastError ); if ( tFile.GetFD()==-1 ) return false; CSphVector dBuffer ( (int)tFile.GetSize() ); if ( !tFile.Read ( &dBuffer[0], dBuffer.GetLength(), m_sLastError ) ) return false; m_pTokenizer->SetBuffer ( &dBuffer[0], dBuffer.GetLength() ); while ( BYTE * sToken = m_pTokenizer->GetToken() ) m_dHitlessWords.Add ( m_pDict->GetWordID ( sToken ) ); m_dHitlessWords.Sort(); return true; } static bool sphTruncate ( int iFD ) { #if USE_WINDOWS return SetEndOfFile ( (HANDLE) _get_osfhandle(iFD) )!=0; #else return ::ftruncate ( iFD, ::lseek ( iFD, 0, SEEK_CUR ) )==0; #endif } int CSphIndex_VLN::Build ( const CSphVector & dSources, int iMemoryLimit, int iWriteBuffer ) { PROFILER_INIT (); assert ( dSources.GetLength() ); if ( !LoadHitlessWords() ) return 0; m_iWriteBuffer = ( iWriteBuffer>0 ) ? Max ( iWriteBuffer, MIN_WRITE_BUFFER ) : DEFAULT_WRITE_BUFFER; if ( !m_pWriteBuffer ) m_pWriteBuffer = new BYTE [ m_iWriteBuffer ]; m_bWordDict = m_pDict->GetSettings().m_bWordDict; // vars shared between phases CSphVector dBins; SphOffset_t iSharedOffset = -1; m_pDict->HitblockBegin(); // setup sources ARRAY_FOREACH ( iSource, dSources ) { CSphSource * pSource = dSources[iSource]; assert ( pSource ); pSource->SetDict ( m_pDict ); pSource->Setup ( m_tSettings ); } // connect 1st source and fetch its schema if ( !dSources[0]->Connect ( m_sLastError ) || !dSources[0]->IterateStart ( m_sLastError ) || !dSources[0]->UpdateSchema ( &m_tSchema, m_sLastError ) ) { return 0; } // check docinfo if ( m_tSchema.GetAttrsCount()==0 && m_tSettings.m_eDocinfo!=SPH_DOCINFO_NONE ) { sphWarning ( "Attribute count is 0: switching to none docinfo" ); m_tSettings.m_eDocinfo = SPH_DOCINFO_NONE; } if ( m_tSchema.GetAttrsCount()>0 && m_tSettings.m_eDocinfo==SPH_DOCINFO_NONE ) { m_sLastError.SetSprintf ( "got attributes, but docinfo is 'none' (fix your config file)" ); return 0; } bool bHaveFieldMVAs = false; CSphVector dMvaIndexes; CSphVector dMvaLocators; // ordinals and strings storage CSphVector dOrdinalAttrs; CSphVector dStringAttrs; CSphVector dWordcountAttrs; for ( int i=0; i 0 ); if ( bHaveOrdinals && m_tSettings.m_eDocinfo!=SPH_DOCINFO_EXTERN ) { m_sLastError.SetSprintf ( "ordinal string attributes require docinfo=extern (fix your config file)" ); return 0; } if ( dStringAttrs.GetLength() && m_tSettings.m_eDocinfo!=SPH_DOCINFO_EXTERN ) { m_sLastError.SetSprintf ( "string attributes require docinfo=extern (fix your config file)" ); return 0; } //////////////////////////////////////////////// // collect and partially sort hits and docinfos //////////////////////////////////////////////// // killlist storage CSphVector dKillList; // adjust memory requirements int iOldLimit = iMemoryLimit; // book memory to store at least 64K attribute rows const int iDocinfoStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); int iDocinfoMax = Max ( 65536, iMemoryLimit/16/iDocinfoStride/sizeof(DWORD) ); if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_NONE ) iDocinfoMax = 1; // book at least 32 KB for ordinals, if needed int iOrdinalPoolSize = Max ( 32768, iMemoryLimit/8 ); if ( !bHaveOrdinals ) iOrdinalPoolSize = 0; // book at least 32 KB for field MVAs, if needed int iFieldMVAPoolSize = Max ( 32768, iMemoryLimit/16 ); if ( bHaveFieldMVAs==0 ) iFieldMVAPoolSize = 0; // book at least 2 MB for keywords dict, if needed int iDictSize = 0; if ( m_bWordDict ) iDictSize = Max ( MIN_KEYWORDS_DICT, iMemoryLimit/8 ); // do we have enough left for hits? int iHitsMax = 1048576; iMemoryLimit -= iDocinfoMax*iDocinfoStride*sizeof(DWORD) + iOrdinalPoolSize + iFieldMVAPoolSize + iDictSize; if ( iMemoryLimit < iHitsMax*(int)sizeof(CSphWordHit) ) { iMemoryLimit = iOldLimit + iHitsMax*sizeof(CSphWordHit) - iMemoryLimit; sphWarn ( "collect_hits: mem_limit=%d kb too low, increasing to %d kb", iOldLimit/1024, iMemoryLimit/1024 ); } else { iHitsMax = iMemoryLimit / sizeof(CSphWordHit); } // allocate raw hits block CSphAutoArray dHits ( iHitsMax + MAX_SOURCE_HITS ); CSphWordHit * pHits = dHits; CSphWordHit * pHitsMax = dHits + iHitsMax; // allocate docinfos buffer CSphAutoArray dDocinfos ( iDocinfoMax*iDocinfoStride ); DWORD * pDocinfo = dDocinfos; const DWORD * pDocinfoMax = dDocinfos + iDocinfoMax*iDocinfoStride; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_NONE ) { pDocinfo = NULL; pDocinfoMax = NULL; } int nOrdinals = 0; SphOffset_t uMaxOrdinalAttrBlockSize = 0; int iCurrentBlockSize = 0; CSphVector < CSphVector < Ordinal_t > > dOrdinals; dOrdinals.Resize ( dOrdinalAttrs.GetLength() ); ARRAY_FOREACH ( i, dOrdinals ) dOrdinals[i].Reserve ( 65536 ); CSphVector < CSphVector > dOrdBlockSize; dOrdBlockSize.Resize ( dOrdinalAttrs.GetLength () ); ARRAY_FOREACH ( i, dOrdBlockSize ) dOrdBlockSize[i].Reserve ( 8192 ); int iMaxOrdLen = 0; CSphVector < MvaEntry_t > dFieldMVAs; dFieldMVAs.Reserve ( 16384 ); CSphVector < SphOffset_t > dFieldMVABlocks; dFieldMVABlocks.Reserve ( 4096 ); CSphVector < FieldMVARedirect_t > dFieldMvaIndexes; if ( bHaveFieldMVAs ) dFieldMvaIndexes.Reserve ( 8 ); int iMaxPoolFieldMVAs = iFieldMVAPoolSize / sizeof ( MvaEntry_t ); int nFieldMVAs = 0; // create temp files CSphAutofile fdLock ( GetIndexFileName("tmp0"), SPH_O_NEW, m_sLastError, true ); CSphAutofile fdHits ( GetIndexFileName ( m_bInplaceSettings ? "spp" : "tmp1" ), SPH_O_NEW, m_sLastError, !m_bInplaceSettings ); CSphAutofile fdDocinfos ( GetIndexFileName ( m_bInplaceSettings ? "spa" : "tmp2" ), SPH_O_NEW, m_sLastError, !m_bInplaceSettings ); CSphAutofile fdTmpFieldMVAs ( GetIndexFileName("tmp7"), SPH_O_NEW, m_sLastError, true ); CSphWriter tOrdWriter; CSphWriter tStrWriter; CSphString sRawOrdinalsFile = GetIndexFileName("tmp4"); if ( bHaveOrdinals && !tOrdWriter.OpenFile ( sRawOrdinalsFile.cstr (), m_sLastError ) ) return 0; if ( !tStrWriter.OpenFile ( GetIndexFileName("sps"), m_sLastError ) ) return 0; tStrWriter.PutByte ( 0 ); // dummy byte, to reserve magic zero offset if ( fdLock.GetFD()<0 || fdHits.GetFD()<0 || fdDocinfos.GetFD()<0 || fdTmpFieldMVAs.GetFD ()<0 ) return 0; SphOffset_t iHitsGap = 0; SphOffset_t iDocinfosGap = 0; if ( m_bInplaceSettings ) { const int HIT_SIZE_AVG = 4; const float HIT_BLOCK_FACTOR = 1.0f; const float DOCINFO_BLOCK_FACTOR = 1.0f; if ( m_iHitGap ) iHitsGap = (SphOffset_t) m_iHitGap; else iHitsGap = (SphOffset_t)( iHitsMax*HIT_BLOCK_FACTOR*HIT_SIZE_AVG ); iHitsGap = Max ( iHitsGap, 1 ); sphSeek ( fdHits.GetFD (), iHitsGap, SEEK_SET ); if ( m_iDocinfoGap ) iDocinfosGap = (SphOffset_t) m_iDocinfoGap; else iDocinfosGap = (SphOffset_t)( iDocinfoMax*DOCINFO_BLOCK_FACTOR*iDocinfoStride*sizeof(DWORD) ); iDocinfosGap = Max ( iDocinfosGap, 1 ); sphSeek ( fdDocinfos.GetFD (), iDocinfosGap, SEEK_SET ); } if ( !sphLockEx ( fdLock.GetFD(), false ) ) { m_sLastError.SetSprintf ( "failed to lock '%s': another indexer running?", fdLock.GetFilename() ); return 0; } // setup accumulating docinfo IDs range m_pMin->Reset ( m_tSchema.GetRowSize() ); for ( int i=0; im_pDynamic[i] = ROWITEM_MAX; m_pMin->m_iDocID = DOCID_MAX; // build raw log PROFILE_BEGIN ( collect_hits ); m_tStats.Reset (); m_tProgress.m_ePhase = CSphIndexProgress::PHASE_COLLECT; m_tProgress.m_iAttrs = 0; CSphVector dHitBlocks; dHitBlocks.Reserve ( 1024 ); int iDocinfoBlocks = 0; ARRAY_FOREACH ( iSource, dSources ) { // connect and check schema, if it's not the first one CSphSource * pSource = dSources[iSource]; if ( iSource ) if ( !pSource->Connect ( m_sLastError ) || !pSource->IterateStart ( m_sLastError ) || !pSource->UpdateSchema ( &m_tSchema, m_sLastError ) ) { return 0; } dFieldMvaIndexes.Resize ( 0 ); ARRAY_FOREACH ( i, dMvaIndexes ) { int iAttr = dMvaIndexes[i]; if ( m_tSchema.GetAttr(iAttr).m_eSrc==SPH_ATTRSRC_FIELD ) { FieldMVARedirect_t & tRedirect = dFieldMvaIndexes.Add(); tRedirect.m_iAttr = iAttr; tRedirect.m_iMVAAttr = i; tRedirect.m_tLocator = m_tSchema.GetAttr ( iAttr ).m_tLocator; } } // joined filter bool bGotJoined = ( m_tSettings.m_eDocinfo!=SPH_DOCINFO_INLINE ) && pSource->HasJoinedFields(); CSphVector dAllIds; // FIXME! unlimited RAM use.. // fetch documents for ( ;; ) { // get next doc, and handle errors bool bGotDoc = pSource->IterateDocument ( m_sLastError ); if ( !bGotDoc ) return 0; // ensure docid is sane if ( pSource->m_tDocInfo.m_iDocID==DOCID_MAX ) { m_sLastError.SetSprintf ( "docid[%d]==DOCID_MAX (source broken?)",pSource->m_tDocInfo.m_iDocID ); return 0; } // check for eof if ( !pSource->m_tDocInfo.m_iDocID ) break; if ( bGotJoined ) dAllIds.Add ( pSource->m_tDocInfo.m_iDocID ); // show progress bar if ( m_pProgress && ( ( pSource->GetStats().m_iTotalDocuments % 1000 )==0 ) ) { m_tProgress.m_iDocuments = m_tStats.m_iTotalDocuments + pSource->GetStats().m_iTotalDocuments; m_tProgress.m_iBytes = m_tStats.m_iTotalBytes + pSource->GetStats().m_iTotalBytes; m_pProgress ( &m_tProgress, false ); } // update crashdump g_iIndexerCurrentDocID = pSource->m_tDocInfo.m_iDocID; g_iIndexerCurrentHits = pHits-dHits; // store field MVAs if ( bHaveFieldMVAs ) { ARRAY_FOREACH ( i, dFieldMvaIndexes ) { int iAttr = dFieldMvaIndexes[i].m_iAttr; int iMVA = dFieldMvaIndexes[i].m_iMVAAttr; CSphAttrLocator tLoc = dFieldMvaIndexes[i].m_tLocator; // store per-document MVAs if ( pSource->IterateFieldMVAStart ( iAttr, m_sLastError ) ) while ( pSource->IterateFieldMVANext () ) { MvaEntry_t & tMva = dFieldMVAs.Add(); tMva.m_uDocID = pSource->m_tDocInfo.m_iDocID; tMva.m_iAttr = iMVA; tMva.m_uValue = pSource->m_tDocInfo.GetAttr ( tLoc ); m_tProgress.m_iAttrs++; int iLength = dFieldMVAs.GetLength (); if ( iLength==iMaxPoolFieldMVAs ) { dFieldMVAs.Sort ( CmpMvaEntries_fn () ); if ( !sphWriteThrottled ( fdTmpFieldMVAs.GetFD (), &dFieldMVAs[0], iLength*sizeof(MvaEntry_t), "temp_field_mva", m_sLastError ) ) return 0; dFieldMVAs.Resize ( 0 ); nFieldMVAs += iMaxPoolFieldMVAs; } } } } // store ordinals iCurrentBlockSize += ( sizeof ( SphOffset_t ) + sizeof ( DWORD ) ) * dOrdinalAttrs.GetLength (); ARRAY_FOREACH ( i, dOrdinalAttrs ) { CSphVector & dCol = dOrdinals[i]; dCol.Add(); Ordinal_t & tLastOrd = dCol.Last(); tLastOrd.m_uDocID = pSource->m_tDocInfo.m_iDocID; Swap ( tLastOrd.m_sValue, pSource->m_dStrAttrs[dOrdinalAttrs[i]] ); int iOrdStrLen = strlen ( tLastOrd.m_sValue.cstr () ); if ( iOrdStrLen > MAX_ORDINAL_STR_LEN ) { iMaxOrdLen = iOrdStrLen; // truncate iOrdStrLen = MAX_ORDINAL_STR_LEN; tLastOrd.m_sValue = tLastOrd.m_sValue.SubString ( 0, iOrdStrLen - 1 ); } iCurrentBlockSize += iOrdStrLen; } if ( bHaveOrdinals ) { if ( iCurrentBlockSize>=iOrdinalPoolSize ) { iCurrentBlockSize = 0; nOrdinals += dOrdinals[0].GetLength (); ARRAY_FOREACH ( i, dOrdinalAttrs ) { CSphVector & dCol = dOrdinals[i]; dCol.Sort ( CmpOrdinalsValue_fn() ); SphOffset_t uSize = DumpOrdinals ( tOrdWriter, dCol ); if ( !uSize ) { m_sLastError = "dump ordinals: io error"; return 0; } if ( uSize > uMaxOrdinalAttrBlockSize ) uMaxOrdinalAttrBlockSize = uSize; dOrdBlockSize[i].Add ( uSize ); dCol.Resize ( 0 ); } } } // store strings ARRAY_FOREACH ( i, dStringAttrs ) { // FIXME! optimize locators etc? // FIXME! support binary strings w/embedded zeroes? // get data, calc length const char * sData = pSource->m_dStrAttrs[dStringAttrs[i]].cstr(); int iLen = sData ? strlen ( sData ) : 0; if ( iLen ) { // calc offset, do sanity checks SphOffset_t uOff = tStrWriter.GetPos(); if ( uint64_t(uOff)>>32 ) { m_sLastError.SetSprintf ( "too many string attributes (current index format allows up to 4 GB)" ); return 0; } pSource->m_tDocInfo.SetAttr ( m_tSchema.GetAttr ( dStringAttrs[i] ).m_tLocator, DWORD(uOff) ); // pack length, emit it, emit data BYTE dPackedLen[4]; int iLenLen = sphPackStrlen ( dPackedLen, iLen ); tStrWriter.PutBytes ( &dPackedLen, iLenLen ); tStrWriter.PutBytes ( sData, iLen ); } else { // no data pSource->m_tDocInfo.SetAttr ( m_tSchema.GetAttr ( dStringAttrs[i] ).m_tLocator, 0 ); } } // count words ARRAY_FOREACH ( i, dWordcountAttrs ) { int iAttr = dWordcountAttrs[i]; int iNumWords = CountWords ( pSource->m_dStrAttrs[iAttr], m_pTokenizer ); pSource->m_tDocInfo.SetAttr ( m_tSchema.GetAttr(iAttr).m_tLocator, iNumWords ); } // update min docinfo assert ( pSource->m_tDocInfo.m_iDocID ); m_pMin->m_iDocID = Min ( m_pMin->m_iDocID, pSource->m_tDocInfo.m_iDocID ); if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) for ( int i=0; im_pDynamic[i] = Min ( m_pMin->m_pDynamic[i], pSource->m_tDocInfo.m_pDynamic[i] ); // store docinfo if ( m_tSettings.m_eDocinfo!=SPH_DOCINFO_NONE ) { // store next entry DOCINFOSETID ( pDocinfo, pSource->m_tDocInfo.m_iDocID ); memcpy ( DOCINFO2ATTRS ( pDocinfo ), pSource->m_tDocInfo.m_pDynamic, sizeof(CSphRowitem)*m_tSchema.GetRowSize() ); pDocinfo += iDocinfoStride; // if not inlining, flush buffer if it's full // (if inlining, it will flushed later, along with the hits) if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && pDocinfo>=pDocinfoMax ) { assert ( pDocinfo==pDocinfoMax ); int iLen = iDocinfoMax*iDocinfoStride*sizeof(DWORD); sphSortDocinfos ( dDocinfos, iDocinfoMax, iDocinfoStride ); if ( !sphWriteThrottled ( fdDocinfos.GetFD(), dDocinfos, iLen, "raw_docinfos", m_sLastError ) ) return 0; pDocinfo = dDocinfos; iDocinfoBlocks++; } } // store hits while ( const ISphHits * pDocHits = pSource->IterateHits ( m_sLastWarning ) ) { int iDocHits = pDocHits->Length(); #if PARANOID for ( int i=0; im_dData[i].m_iDocID==pSource->m_tDocInfo.m_iDocID ); assert ( pDocHits->m_dData[i].m_iWordID ); assert ( pDocHits->m_dData[i].m_iWordPos ); } #endif assert ( ( pHits+iDocHits )<=( pHitsMax+MAX_SOURCE_HITS ) ); memcpy ( pHits, pDocHits->First(), iDocHits*sizeof(CSphWordHit) ); pHits += iDocHits; // check if we need to flush if ( pHits=pDocinfoMax ) && !( iDictSize && m_pDict->HitblockGetMemUse() > iDictSize ) ) { continue; } // update crashdump g_iIndexerPoolStartDocID = pSource->m_tDocInfo.m_iDocID; g_iIndexerPoolStartHit = pHits-dHits; // sort hits int iHits = pHits - dHits; { PROFILE ( sort_hits ); sphSort ( &dHits[0], iHits, CmpHit_fn() ); m_pDict->HitblockPatch ( &dHits[0], iHits ); } pHits = dHits; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) { // we're inlining, so let's flush both hits and docs int iDocs = ( pDocinfo - dDocinfos ) / iDocinfoStride; pDocinfo = dDocinfos; sphSortDocinfos ( pDocinfo, iDocs, iDocinfoStride ); dHitBlocks.Add ( cidxWriteRawVLB ( fdHits.GetFD(), dHits, iHits, dDocinfos, iDocs, iDocinfoStride ) ); // we are inlining, so if there are more hits in this document, // we'll need to know it's info next flush if ( iDocHits ) { DOCINFOSETID ( pDocinfo, pSource->m_tDocInfo.m_iDocID ); memcpy ( DOCINFO2ATTRS ( pDocinfo ), pSource->m_tDocInfo.m_pDynamic, sizeof(CSphRowitem)*m_tSchema.GetRowSize() ); pDocinfo += iDocinfoStride; } } else { // we're not inlining, so only flush hits, docs are flushed independently dHitBlocks.Add ( cidxWriteRawVLB ( fdHits.GetFD(), dHits, iHits, NULL, 0, 0 ) ); } m_pDict->HitblockReset (); if ( dHitBlocks.Last()<0 ) return 0; // progress bar m_tProgress.m_iHitsTotal += iHits; if ( m_pProgress ) { m_tProgress.m_iDocuments = m_tStats.m_iTotalDocuments + pSource->GetStats().m_iTotalDocuments; m_tProgress.m_iBytes = m_tStats.m_iTotalBytes + pSource->GetStats().m_iTotalBytes; m_pProgress ( &m_tProgress, false ); } } } // FIXME! uncontrolled memory usage; add checks and/or diskbased sort in the future? if ( pSource->IterateKillListStart ( m_sLastError ) ) { SphDocID_t tDocId; while ( pSource->IterateKillListNext ( tDocId ) ) dKillList.Add ( tDocId ); } // fetch joined fields if ( bGotJoined ) { dAllIds.Uniq(); SphDocID_t uLastID = 0; bool bLastFound = 0; for ( ;; ) { // get next doc, and handle errors ISphHits * pJoinedHits = pSource->IterateJoinedHits ( m_sLastError ); if ( !pJoinedHits ) return 0; // ensure docid is sane if ( pSource->m_tDocInfo.m_iDocID==DOCID_MAX ) { m_sLastError.SetSprintf ( "joined_docid==DOCID_MAX (source broken?)" ); return 0; } // check for eof if ( !pSource->m_tDocInfo.m_iDocID ) break; // filter and store hits for ( const CSphWordHit * pHit = pJoinedHits->First(); pHit<=pJoinedHits->Last(); pHit++ ) { // flush if needed if ( pHits>=pHitsMax ) { // sort hits int iHits = pHits - dHits; { PROFILE ( sort_hits ); sphSort ( &dHits[0], iHits, CmpHit_fn() ); m_pDict->HitblockPatch ( &dHits[0], iHits ); } pHits = dHits; // we're not inlining, so only flush hits, docs are flushed independently dHitBlocks.Add ( cidxWriteRawVLB ( fdHits.GetFD(), dHits, iHits, NULL, 0, 0 ) ); m_pDict->HitblockReset (); if ( dHitBlocks.Last()<0 ) return 0; } // filter SphDocID_t uHitID = pHit->m_iDocID; if ( uHitID!=uLastID ) { uLastID = uHitID; bLastFound = ( dAllIds.BinarySearch ( uHitID )!=NULL ); } // copy next hit if ( bLastFound ) *pHits++ = *pHit; } }//end for loop } // this source is over, disconnect and update stats pSource->Disconnect (); m_tStats.m_iTotalDocuments += pSource->GetStats().m_iTotalDocuments; m_tStats.m_iTotalBytes += pSource->GetStats().m_iTotalBytes; } // flush last docinfo block int iDocinfoLastBlockSize = 0; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && pDocinfo>dDocinfos ) { iDocinfoLastBlockSize = ( pDocinfo - dDocinfos ) / iDocinfoStride; assert ( pDocinfo==( dDocinfos + iDocinfoLastBlockSize*iDocinfoStride ) ); int iLen = iDocinfoLastBlockSize*iDocinfoStride*sizeof(DWORD); sphSortDocinfos ( dDocinfos, iDocinfoLastBlockSize, iDocinfoStride ); if ( !sphWriteThrottled ( fdDocinfos.GetFD(), dDocinfos, iLen, "raw_docinfos", m_sLastError ) ) return 0; iDocinfoBlocks++; } // flush last hit block if ( pHits>dHits ) { int iHits = pHits - dHits; { PROFILE ( sort_hits ); sphSort ( &dHits[0], iHits, CmpHit_fn() ); m_pDict->HitblockPatch ( &dHits[0], iHits ); } m_tProgress.m_iHitsTotal += iHits; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) { int iDocs = ( pDocinfo - dDocinfos ) / iDocinfoStride; sphSortDocinfos ( dDocinfos, iDocs, iDocinfoStride ); dHitBlocks.Add ( cidxWriteRawVLB ( fdHits.GetFD(), dHits, iHits, dDocinfos, iDocs, iDocinfoStride ) ); } else { dHitBlocks.Add ( cidxWriteRawVLB ( fdHits.GetFD(), dHits, iHits, NULL, 0, 0 ) ); } m_pDict->HitblockReset (); if ( dHitBlocks.Last()<0 ) return 0; } // flush last field MVA block if ( bHaveFieldMVAs && dFieldMVAs.GetLength () ) { int iLength = dFieldMVAs.GetLength (); nFieldMVAs += iLength; dFieldMVAs.Sort ( CmpMvaEntries_fn () ); if ( !sphWriteThrottled ( fdTmpFieldMVAs.GetFD (), &dFieldMVAs[0], iLength*sizeof(MvaEntry_t), "temp_field_mva", m_sLastError ) ) return 0; dFieldMVAs.Reset (); } // flush last ordinals block if ( bHaveOrdinals && dOrdinals[0].GetLength () ) { nOrdinals += dOrdinals[0].GetLength (); ARRAY_FOREACH ( i, dOrdinalAttrs ) { CSphVector & dCol = dOrdinals[i]; dCol.Sort ( CmpOrdinalsValue_fn() ); SphOffset_t uSize = DumpOrdinals ( tOrdWriter, dCol ); if ( !uSize ) { m_sLastError = "dump ordinals: io error"; return 0; } if ( uSize > uMaxOrdinalAttrBlockSize ) uMaxOrdinalAttrBlockSize = uSize; dOrdBlockSize[i].Add ( uSize ); dCol.Reset (); } } if ( m_pProgress ) { m_tProgress.m_iDocuments = m_tStats.m_iTotalDocuments; m_tProgress.m_iBytes = m_tStats.m_iTotalBytes; m_pProgress ( &m_tProgress, true ); } PROFILE_END ( collect_hits ); /////////////////////////////////////// // collect and sort multi-valued attrs /////////////////////////////////////// if ( !BuildMVA ( dSources, dHits, iHitsMax*sizeof(CSphWordHit), fdTmpFieldMVAs.GetFD (), nFieldMVAs, iMaxPoolFieldMVAs ) ) return 0; // reset persistent mva update pool ::unlink ( GetIndexFileName("mvp").cstr() ); // reset hits pool dHits.Reset (); CSphString sFieldMVAFile = fdTmpFieldMVAs.GetFilename (); fdTmpFieldMVAs.Close (); ::unlink ( sFieldMVAFile.cstr () ); ///////////////// // sort docinfos ///////////////// tOrdWriter.CloseFile (); if ( tOrdWriter.IsError () ) return 0; CSphString sSortedOrdinalIdFile = GetIndexFileName("tmp6"); // sort ordinals if ( bHaveOrdinals && !dOrdBlockSize[0].GetLength () ) { bHaveOrdinals = false; ::unlink ( sRawOrdinalsFile.cstr () ); } if ( bHaveOrdinals ) { if ( iMaxOrdLen > MAX_ORDINAL_STR_LEN ) sphWarn ( "some ordinal attributes are too long (len=%d,max=%d)", iMaxOrdLen, MAX_ORDINAL_STR_LEN ); CSphString sUnsortedIdFile = GetIndexFileName("tmp5"); CSphAutofile fdRawOrdinals ( sRawOrdinalsFile.cstr (), SPH_O_READ, m_sLastError, true ); if ( fdRawOrdinals.GetFD () < 0 ) return 0; const float ARENA_PERCENT = 0.5f; int nBlocks = dOrdBlockSize[0].GetLength (); SphOffset_t uMemNeededForReaders = SphOffset_t ( nBlocks ) * uMaxOrdinalAttrBlockSize; SphOffset_t uMemNeededForSorting = sizeof ( OrdinalId_t ) * nOrdinals; int iArenaSize = (int) Min ( SphOffset_t ( iMemoryLimit * ARENA_PERCENT ), uMemNeededForReaders ); iArenaSize = Max ( CSphBin::MIN_SIZE * nBlocks, iArenaSize ); int iOrdinalsInPool = (int) Min ( SphOffset_t ( iMemoryLimit * ( 1.0f - ARENA_PERCENT ) ), uMemNeededForSorting ) / sizeof ( OrdinalId_t ); if ( !SortOrdinals ( sUnsortedIdFile.cstr (), fdRawOrdinals.GetFD (), iArenaSize, iOrdinalsInPool, dOrdBlockSize, iArenaSize < uMemNeededForReaders ) ) return 0; CSphAutofile fdUnsortedId ( sUnsortedIdFile.cstr (), SPH_O_READ, m_sLastError, true ); if ( fdUnsortedId.GetFD () < 0 ) return 0; iArenaSize = Min ( iMemoryLimit, (int)uMemNeededForSorting ); iArenaSize = Max ( CSphBin::MIN_SIZE * ( nOrdinals / iOrdinalsInPool + 1 ), iArenaSize ); if ( !SortOrdinalIds ( sSortedOrdinalIdFile.cstr (), fdUnsortedId.GetFD (), iArenaSize, dOrdBlockSize, iArenaSize < uMemNeededForSorting ) ) return 0; } // initialize MVA reader CSphAutoreader rdMva; if ( !rdMva.Open ( GetIndexFileName("spm"), m_sLastError ) ) return false; SphDocID_t uMvaID = rdMva.GetDocid(); // initialize writer int iDocinfoFD = -1; SphOffset_t iDocinfoWritePos = 0; CSphScopedPtr pfdDocinfoFinal ( NULL ); if ( m_bInplaceSettings ) iDocinfoFD = fdDocinfos.GetFD (); else { pfdDocinfoFinal = new CSphAutofile ( GetIndexFileName("spa"), SPH_O_NEW, m_sLastError ); iDocinfoFD = pfdDocinfoFinal->GetFD(); if ( iDocinfoFD < 0 ) return 0; } int iDupes = 0; int iMinBlock = -1; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && dHitBlocks.GetLength() ) { // initialize readers assert ( dBins.GetLength()==0 ); dBins.Reserve ( iDocinfoBlocks ); float fReadFactor = 1.0f; float fRelocFactor = 0.0f; if ( m_bInplaceSettings ) { assert ( m_fRelocFactor > 0.005f && m_fRelocFactor < 0.95f ); fRelocFactor = m_fRelocFactor; fReadFactor -= fRelocFactor; } int iBinSize = CSphBin::CalcBinSize ( int ( iMemoryLimit * fReadFactor ), iDocinfoBlocks, "sort_docinfos" ); int iRelocationSize = m_bInplaceSettings ? int ( iMemoryLimit * fRelocFactor ) : 0; CSphAutoArray pRelocationBuffer ( iRelocationSize ); iSharedOffset = -1; for ( int i=0; im_iFileLeft = ( ( i==iDocinfoBlocks-1 ) ? iDocinfoLastBlockSize : iDocinfoMax )*iDocinfoStride*sizeof(DWORD); dBins[i]->m_iFilePos = ( i==0 ) ? iDocinfosGap : dBins[i-1]->m_iFilePos + dBins[i-1]->m_iFileLeft; dBins[i]->Init ( fdDocinfos.GetFD(), &iSharedOffset, iBinSize ); } SphOffset_t iDocinfoFileSize = 0; if ( iDocinfoBlocks ) iDocinfoFileSize = dBins [iDocinfoBlocks-1]->m_iFilePos + dBins [iDocinfoBlocks-1]->m_iFileLeft; // docinfo queue CSphAutoArray dDocinfoQueue ( iDocinfoBlocks*iDocinfoStride ); CSphQueue < int, CmpQueuedDocinfo_fn > qDocinfo ( iDocinfoBlocks ); CmpQueuedDocinfo_fn::m_pStorage = dDocinfoQueue; CmpQueuedDocinfo_fn::m_iStride = iDocinfoStride; pDocinfo = dDocinfoQueue; for ( int i=0; iReadBytes ( pDocinfo, iDocinfoStride*sizeof(DWORD) )!=BIN_READ_OK ) { m_sLastError.SetSprintf ( "sort_docinfos: warmup failed (io error?)" ); return 0; } pDocinfo += iDocinfoStride; qDocinfo.Push ( i ); } CSphVector < CSphBin > dOrdReaders; SphOffset_t iSharedOrdOffset = -1; CSphAutofile fdTmpSortedIds ( sSortedOrdinalIdFile.cstr (), SPH_O_READ, m_sLastError, true ); if ( bHaveOrdinals ) { if ( fdTmpSortedIds.GetFD () < 0 ) return 0; dOrdReaders.Resize ( dOrdinalAttrs.GetLength () ); SphOffset_t uStart = 0; ARRAY_FOREACH ( i, dOrdReaders ) { dOrdReaders[i].m_iFileLeft = (int)dOrdBlockSize [i][0]; dOrdReaders[i].m_iFilePos = uStart; dOrdReaders[i].Init ( fdTmpSortedIds.GetFD(), &iSharedOrdOffset, ORDINAL_READ_SIZE ); uStart += dOrdReaders[i].m_iFileLeft; } } // while the queue has data for us int iOrd = 0; pDocinfo = dDocinfos; SphDocID_t uLastId = 0; m_uMinMaxIndex = 0; // prepare the collector for min/max of attributes AttrIndexBuilder_c tMinMax ( m_tSchema ); CSphVector dMinMaxBuffer ( tMinMax.GetExpectedSize ( m_tStats.m_iTotalDocuments ) ); CSphDocMVA tCurInfo ( dMvaIndexes.GetLength() ); tMinMax.Prepare ( dMinMaxBuffer.Begin(), dMinMaxBuffer.Begin() + dMinMaxBuffer.GetLength() ); SphDocID_t uLastDupe = 0; while ( qDocinfo.GetLength() ) { // obtain bin index and next entry int iBin = qDocinfo.Root(); DWORD * pEntry = dDocinfoQueue + iBin*iDocinfoStride; if ( DOCINFO2ID ( pEntry )=DOCINFO2ID(pEntry) ); if ( uMvaID==DOCINFO2ID(pEntry) ) { ARRAY_FOREACH ( i, dMvaIndexes ) { sphSetRowAttr ( DOCINFO2ATTRS(pEntry), dMvaLocators[i], SphAttr_t(rdMva.GetPos()/sizeof(DWORD)) ); // intentional clamp; we'll check for 32bit overflow later DWORD iMvaCount = rdMva.GetDword(); tCurInfo.m_dMVA[i].Reserve ( iMvaCount ); while ( iMvaCount-- ) { tCurInfo.m_dMVA[i].Add ( rdMva.GetDword() ); } } uMvaID = rdMva.GetDocid(); if ( !uMvaID ) uMvaID = DOCID_MAX; } } tMinMax.Collect ( pEntry, tCurInfo ); ARRAY_FOREACH ( i, tCurInfo.m_dMVA ) tCurInfo.m_dMVA[i].Resize ( 0 ); // emit it memcpy ( pDocinfo, pEntry, iDocinfoStride*sizeof(DWORD) ); pDocinfo += iDocinfoStride; uLastId = DOCINFO2ID(pEntry); if ( pDocinfo>=pDocinfoMax ) { int iLen = iDocinfoMax*iDocinfoStride*sizeof(DWORD); if ( m_bInplaceSettings ) { if ( iMinBlock==-1 || dBins[iMinBlock]->IsEOF () ) { iMinBlock = -1; ARRAY_FOREACH ( i, dBins ) if ( !dBins[i]->IsEOF () && ( iMinBlock==-1 || dBins [i]->m_iFilePosm_iFilePos ) ) iMinBlock = i; } if ( iMinBlock!=-1 && ( iDocinfoWritePos + iLen ) > dBins[iMinBlock]->m_iFilePos ) { if ( !RelocateBlock ( iDocinfoFD, (BYTE*)pRelocationBuffer, iRelocationSize, &iDocinfoFileSize, dBins[iMinBlock], &iSharedOffset ) ) return 0; iMinBlock = (iMinBlock+1) % dBins.GetLength (); } sphSeek ( iDocinfoFD, iDocinfoWritePos, SEEK_SET ); iSharedOffset = iDocinfoWritePos; } if ( !sphWriteThrottled ( iDocinfoFD, dDocinfos, iLen, "sort_docinfo", m_sLastError ) ) return 0; iDocinfoWritePos += iLen; pDocinfo = dDocinfos; } } // pop its index, update it, push its index again qDocinfo.Pop (); ESphBinRead eRes = dBins[iBin]->ReadBytes ( pEntry, iDocinfoStride*sizeof(DWORD) ); if ( eRes==BIN_READ_ERROR ) { m_sLastError.SetSprintf ( "sort_docinfo: failed to read entry" ); return 0; } if ( eRes==BIN_READ_OK ) qDocinfo.Push ( iBin ); } if ( pDocinfo>dDocinfos ) { assert ( 0==( pDocinfo-dDocinfos ) % iDocinfoStride ); int iLen = ( pDocinfo - dDocinfos )*sizeof(DWORD); if ( m_bInplaceSettings ) sphSeek ( iDocinfoFD, iDocinfoWritePos, SEEK_SET ); if ( !sphWriteThrottled ( iDocinfoFD, dDocinfos, iLen, "sort_docinfo", m_sLastError ) ) return 0; if ( m_bInplaceSettings ) if ( !sphTruncate ( iDocinfoFD ) ) sphWarn ( "failed to truncate %s", fdDocinfos.GetFilename() ); } tMinMax.FinishCollect(); sphWriteThrottled ( iDocinfoFD, &dMinMaxBuffer[0], sizeof(DWORD) * tMinMax.GetActualSize(), "minmax_docinfo", m_sLastError ); // clean up readers ARRAY_FOREACH ( i, dBins ) SafeDelete ( dBins[i] ); dBins.Reset (); } dDocinfos.Reset (); pDocinfo = NULL; // it might be zero-length, but it must exist if ( m_bInplaceSettings ) fdDocinfos.Close (); else { assert ( pfdDocinfoFinal.Ptr () ); pfdDocinfoFinal->Close (); } // dump killlist CSphAutofile fdKillList ( GetIndexFileName("spk"), SPH_O_NEW, m_sLastError ); if ( fdKillList.GetFD()<0 ) return 0; if ( dKillList.GetLength () ) { dKillList.Uniq (); m_iKillListSize = dKillList.GetLength (); if ( !sphWriteThrottled ( fdKillList.GetFD (), &dKillList[0], m_iKillListSize*sizeof(SphAttr_t), "kill list", m_sLastError ) ) return 0; } fdKillList.Close (); /////////////////////////////////// // sort and write compressed index /////////////////////////////////// PROFILE_BEGIN ( invert_hits ); // initialize readers assert ( dBins.GetLength()==0 ); dBins.Reserve ( dHitBlocks.GetLength() ); iSharedOffset = -1; float fReadFactor = 1.0f; int iRelocationSize = 0; iWriteBuffer = m_iWriteBuffer; if ( m_bInplaceSettings ) { assert ( m_fRelocFactor > 0.005f && m_fRelocFactor < 0.95f ); assert ( m_fWriteFactor > 0.005f && m_fWriteFactor < 0.95f ); assert ( m_fWriteFactor+m_fRelocFactor < 1.0f ); fReadFactor -= m_fRelocFactor + m_fWriteFactor; iRelocationSize = int ( iMemoryLimit * m_fRelocFactor ); iWriteBuffer = int ( iMemoryLimit * m_fWriteFactor ); } int iBinSize = CSphBin::CalcBinSize ( int ( iMemoryLimit * fReadFactor ), dHitBlocks.GetLength() + m_bWordDict, "sort_hits" ); CSphAutoArray pRelocationBuffer ( iRelocationSize ); iSharedOffset = -1; ARRAY_FOREACH ( i, dHitBlocks ) { dBins.Add ( new CSphBin ( m_tSettings.m_eHitless, m_pDict->GetSettings().m_bWordDict ) ); dBins[i]->m_iFileLeft = dHitBlocks[i]; dBins[i]->m_iFilePos = ( i==0 ) ? iHitsGap : dBins[i-1]->m_iFilePos + dBins[i-1]->m_iFileLeft; dBins[i]->Init ( fdHits.GetFD(), &iSharedOffset, iBinSize ); } // if there were no hits, create zero-length index files int iRawBlocks = dBins.GetLength(); ////////////////////////////// // create new index files set ////////////////////////////// // doclist and hitlist files m_wrDoclist.CloseFile (); m_wrHitlist.CloseFile (); m_wrDoclist.SetBufferSize ( m_iWriteBuffer ); m_wrHitlist.SetBufferSize ( m_bInplaceSettings ? iWriteBuffer : m_iWriteBuffer ); if ( !m_wrDoclist.OpenFile ( GetIndexFileName("spd"), m_sLastError ) ) return 0; if ( m_bInplaceSettings ) { sphSeek ( fdHits.GetFD(), 0, SEEK_SET ); m_wrHitlist.SetFile ( fdHits.GetFD(), &iSharedOffset ); } else if ( !m_wrHitlist.OpenFile ( GetIndexFileName("spp"), m_sLastError ) ) return 0; // put dummy byte (otherwise offset would start from 0, first delta would be 0 // and VLB encoding of offsets would fuckup) BYTE bDummy = 1; m_wrDoclist.PutBytes ( &bDummy, 1 ); m_wrHitlist.PutBytes ( &bDummy, 1 ); // dict files CSphAutofile fdTmpDict ( GetIndexFileName("tmp8"), SPH_O_NEW, m_sLastError, true ); CSphAutofile fdDict ( GetIndexFileName("spi"), SPH_O_NEW, m_sLastError, false ); if ( fdTmpDict.GetFD()<0 || fdDict.GetFD()<0 ) return 0; m_pDict->DictBegin ( fdTmpDict.GetFD(), fdDict.GetFD(), iBinSize ); // adjust min IDs, and fill header assert ( m_pMin->m_iDocID>0 ); m_pMin->m_iDocID--; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) for ( int i=0; im_pDynamic[i]--; ////////////// // final sort ////////////// if ( iRawBlocks ) { int iLastBin = dBins.GetLength () - 1; SphOffset_t iHitFileSize = dBins[iLastBin]->m_iFilePos + dBins [iLastBin]->m_iFileLeft; CSphHitQueue tQueue ( iRawBlocks ); CSphAggregateHit tHit; // initialize hitlist encoder state m_tLastHit.m_iDocID = 0; m_tLastHit.m_iWordID = 0; m_tLastHit.m_iWordPos = EMPTY_HIT; m_tLastHit.m_sKeyword = m_sLastKeyword; // initial fill int iRowitems = ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) ? m_tSchema.GetRowSize() : 0; CSphAutoArray dInlineAttrs ( iRawBlocks*iRowitems ); int * bActive = new int [ iRawBlocks ]; for ( int i=0; iReadHit ( &tHit, iRowitems, dInlineAttrs+i*iRowitems ) ) { m_sLastError.SetSprintf ( "sort_hits: warmup failed (io error?)" ); return 0; } bActive[i] = ( tHit.m_iWordID!=0 ); if ( bActive[i] ) tQueue.Push ( tHit, i ); } // init progress meter m_tProgress.m_ePhase = CSphIndexProgress::PHASE_SORT; m_tProgress.m_iHits = 0; // while the queue has data for us // FIXME! analyze binsRead return code int iHitsSorted = 0; iMinBlock = -1; while ( tQueue.m_iUsed ) { int iBin = tQueue.m_pData->m_iBin; // pack and emit queue root tQueue.m_pData->m_iDocID -= m_pMin->m_iDocID; if ( m_bInplaceSettings ) { if ( iMinBlock==-1 || dBins[iMinBlock]->IsEOF () || !bActive[iMinBlock] ) { iMinBlock = -1; ARRAY_FOREACH ( i, dBins ) if ( !dBins[i]->IsEOF () && bActive[i] && ( iMinBlock==-1 || dBins[i]->m_iFilePos < dBins[iMinBlock]->m_iFilePos ) ) iMinBlock = i; } int iToWriteMax = 3*sizeof(DWORD); if ( iMinBlock!=-1 && ( m_wrHitlist.GetPos () + iToWriteMax ) > dBins[iMinBlock]->m_iFilePos ) { if ( !RelocateBlock ( fdHits.GetFD (), (BYTE*)pRelocationBuffer, iRelocationSize, &iHitFileSize, dBins[iMinBlock], &iSharedOffset ) ) return 0; iMinBlock = (iMinBlock+1) % dBins.GetLength (); } } cidxHit ( tQueue.m_pData, iRowitems ? dInlineAttrs+iBin*iRowitems : NULL ); if ( m_pDict->DictIsError() || m_wrDoclist.IsError() || m_wrHitlist.IsError() ) return 0; // pop queue root and push next hit from popped bin tQueue.Pop (); if ( bActive[iBin] ) { dBins[iBin]->ReadHit ( &tHit, iRowitems, dInlineAttrs+iBin*iRowitems ); bActive[iBin] = ( tHit.m_iWordID!=0 ); if ( bActive[iBin] ) tQueue.Push ( tHit, iBin ); } // progress if ( m_pProgress && ++iHitsSorted==1000000 ) { m_tProgress.m_iHits += iHitsSorted; m_pProgress ( &m_tProgress, false ); iHitsSorted = 0; } } if ( m_pProgress ) { m_tProgress.m_iHits = m_tProgress.m_iHitsTotal; // sum might be less than total because of dupes! m_pProgress ( &m_tProgress, true ); } // cleanup SafeDeleteArray ( bActive ); ARRAY_FOREACH ( i, dBins ) SafeDelete ( dBins[i] ); dBins.Reset (); CSphAggregateHit tFlush; tFlush.m_iDocID = 0; tFlush.m_iWordID = 0; tFlush.m_sKeyword = NULL; tFlush.m_iWordPos = EMPTY_HIT; tFlush.m_dFieldMask.Unset(); cidxHit ( &tFlush, NULL ); if ( m_bInplaceSettings ) { m_wrHitlist.CloseFile (); if ( !sphTruncate ( fdHits.GetFD () ) ) sphWarn ( "failed to truncate %s", fdHits.GetFilename() ); } } if ( iDupes ) sphWarn ( "%d duplicate document id pairs found", iDupes ); PROFILE_END ( invert_hits ); // we're done if ( !cidxDone ( "sph", iMemoryLimit ) ) return 0; // when the party's over.. ARRAY_FOREACH ( i, dSources ) dSources[i]->PostIndex (); PROFILER_DONE (); PROFILE_SHOW (); return 1; } // NOLINT function length static bool CopyFile ( const char * sSrc, const char * sDst, CSphString & sErrStr ) { assert ( sSrc ); assert ( sDst ); const DWORD iMaxBufSize = 1024 * 1024; CSphAutofile tSrcFile ( sSrc, SPH_O_READ, sErrStr ); CSphAutofile tDstFile ( sDst, SPH_O_NEW, sErrStr ); if ( tSrcFile.GetFD()<0 || tDstFile.GetFD()<0 ) return false; SphOffset_t iFileSize = tSrcFile.GetSize(); DWORD iBufSize = (DWORD) Min ( iFileSize, (SphOffset_t)iMaxBufSize ); if ( iFileSize ) { BYTE * pData = new BYTE[iBufSize]; if ( !pData ) { sErrStr.SetSprintf ( "memory allocation error" ); return false; } bool bError = true; while ( iFileSize > 0 ) { DWORD iSize = (DWORD) Min ( iFileSize, (SphOffset_t)iBufSize ); if ( !tSrcFile.Read ( pData, iSize, sErrStr ) ) break; if ( !sphWriteThrottled ( tDstFile.GetFD(), pData, iSize, "CopyFile", sErrStr ) ) break; iFileSize -= iSize; if ( !iFileSize ) bError = false; } SafeDeleteArray ( pData ); return ( bError==false ); } return true; } SphAttr_t CopyStringAttr ( CSphWriter & wrTo, CSphReader & rdFrom, SphAttr_t uOffset ) { // magic offset? do nothing if ( !uOffset ) return 0; // aim rdFrom.SeekTo ( uOffset, 0 ); // read and decode length // MUST be in sync with sphUnpackStr int iLen = rdFrom.GetByte (); if ( iLen & 0x80 ) { if ( iLen & 0x40 ) { iLen = ( (int)( iLen & 0x3f )<<16 ) + ( rdFrom.GetByte()<<8 ); iLen += rdFrom.GetByte(); // MUST be separate statement; cf. sequence point } else { iLen = ( (int)( iLen & 0x3f )<<8 ) + rdFrom.GetByte(); } } // no data? do nothing if ( !iLen ) return 0; // copy bytes uOffset = (SphAttr_t) wrTo.GetPos(); // FIXME! check bounds? BYTE dLen[4]; wrTo.PutBytes ( dLen, sphPackStrlen ( dLen, iLen ) ); while ( iLen>0 ) { const BYTE * pBuf = NULL; int iChunk = rdFrom.GetBytesZerocopy ( &pBuf, iLen ); wrTo.PutBytes ( pBuf, iChunk ); iLen -= iChunk; } return uOffset; } static const int DOCLIST_HINT_THRESH = 256; static int DoclistHintUnpack ( int iDocs, BYTE uHint ) { if ( iDocs=m_iMaxPos ) return false; // get leading value SphWordID_t iWord0 = m_pDict ? m_tReader.GetByte() : m_tReader.UnzipWordid(); if ( !iWord0 ) { // handle checkpoint m_tReader.UnzipOffset(); m_iWordID = 0; m_iDoclistOffset = 0; m_sWord[0] = '\0'; if ( m_tReader.GetPos()>=m_iMaxPos ) return false; iWord0 = m_pDict ? m_tReader.GetByte() : m_tReader.UnzipWordid(); // get next word } if ( !iWord0 ) return false; // some failure // get word entry if ( m_pDict ) { // unpack next word // must be in sync with DictEnd()! assert ( iWord0<=255 ); BYTE uPack = (BYTE) iWord0; int iMatch, iDelta; if ( uPack & 0x80 ) { iDelta = ( ( uPack>>4 ) & 7 ) + 1; iMatch = uPack & 15; } else { iDelta = uPack & 127; iMatch = m_tReader.GetByte(); } assert ( iMatch+iDelta<(int)sizeof(m_sWord)-1 ); assert ( iMatch<=(int)strlen(m_sWord) ); m_tReader.GetBytes ( m_sWord + iMatch, iDelta ); m_sWord [ iMatch+iDelta ] = '\0'; m_iDoclistOffset = m_tReader.UnzipOffset(); m_iDocs = m_tReader.UnzipInt(); m_iHits = m_tReader.UnzipInt(); m_iHint = 0; if ( m_iDocs>=DOCLIST_HINT_THRESH ) m_iHint = m_tReader.GetByte(); DoclistHintUnpack ( m_iDocs, (BYTE) m_iHint ); m_iWordID = (SphWordID_t) sphCRC32 ( GetWord() ); // set wordID for indexing } else { m_iWordID += iWord0; m_iDoclistOffset += m_tReader.UnzipOffset(); m_iDocs = m_tReader.UnzipInt(); m_iHits = m_tReader.UnzipInt(); } m_bHasHitlist = ( m_eHitless==SPH_HITLESS_NONE ) || ( m_eHitless==SPH_HITLESS_SOME && !( m_iDocs & 0x80000000 ) ); m_iDocs = m_eHitless==SPH_HITLESS_SOME ? ( m_iDocs & 0x7FFFFFFF ) : m_iDocs; return true; // FIXME? errorflag? } int CmpWord ( const CSphDictReader & tOther ) const { if ( m_pDict ) return strcmp ( m_sWord, tOther.m_sWord ); int iRes = 0; iRes = m_iWordIDtOther.m_iWordID ? 1 : iRes; return iRes; } BYTE * GetWord () const { return (BYTE *)m_sWord; } }; static ISphFilter * CreateMergeFilters ( CSphVector & dSettings, const CSphSchema & tSchema, const DWORD * pMvaPool ) { CSphString sError; ISphFilter * pResult = NULL; ARRAY_FOREACH ( i, dSettings ) { ISphFilter * pFilter = sphCreateFilter ( dSettings[i], tSchema, pMvaPool, sError ); if ( pFilter ) pResult = sphJoinFilters ( pResult, pFilter ); } return pResult; } class CSphMerger { private: CSphIndex_VLN * m_pOutputIndex; public: explicit CSphMerger ( CSphIndex_VLN * pOutputIndex ) : m_pOutputIndex ( pOutputIndex ) {} template < typename QWORD > static inline void PrepareQword ( QWORD & tQword, const CSphDictReader & tReader, int iDynamic, SphDocID_t iMinID, bool bWordDict ) //NOLINT { tQword.m_tDoc.Reset ( iDynamic ); tQword.m_iMinID = iMinID; tQword.m_tDoc.m_iDocID = iMinID; tQword.m_iDocs = tReader.m_iDocs; tQword.m_iHits = tReader.m_iHits; tQword.m_bHasHitlist = tReader.m_bHasHitlist; tQword.m_uHitPosition = 0; tQword.m_iHitlistPos = 0; if ( bWordDict ) tQword.m_rdDoclist.SeekTo ( tReader.m_iDoclistOffset, tReader.m_iHint ); } template < typename QWORD > static inline bool NextDocument ( QWORD & tQword, CSphIndex_VLN * pSourceIndex, CSphRowitem * pInline, ISphFilter * pFilter ) { for ( ;; ) { tQword.GetNextDoc ( pInline ); if ( tQword.m_tDoc.m_iDocID ) { tQword.SeekHitlist ( tQword.m_iHitlistPos ); if ( pFilter ) { CSphMatch tMatch; tMatch.m_iDocID = tQword.m_tDoc.m_iDocID; if ( pFilter->UsesAttrs() ) { if ( pInline ) tMatch.m_pDynamic = pInline; else { const DWORD * pInfo = pSourceIndex->FindDocinfo ( tQword.m_tDoc.m_iDocID ); tMatch.m_pStatic = pInfo?DOCINFO2ATTRS ( pInfo ):NULL; } } bool bResult = pFilter->Eval ( tMatch ); tMatch.m_pDynamic = NULL; if ( !bResult ) { while ( tQword.m_bHasHitlist && tQword.GetNextHit()!=EMPTY_HIT ); continue; } } return true; } else return false; } } template < typename QWORD > inline void TransferData ( QWORD & tQword, SphWordID_t iWordID, BYTE * sWord, CSphIndex_VLN * pSourceIndex, CSphRowitem * pInline, ISphFilter * pFilter ) { CSphAggregateHit tHit; tHit.m_iWordID = iWordID; tHit.m_sKeyword = sWord; tHit.m_dFieldMask.Unset(); while ( CSphMerger::NextDocument ( tQword, pSourceIndex, pInline, pFilter ) ) { if ( tQword.m_bHasHitlist ) TransferHits ( tQword, pInline, tHit ); else { // convert to aggregate if there is no hit-list tHit.m_iDocID = tQword.m_tDoc.m_iDocID - m_pOutputIndex->m_pMin->m_iDocID; tHit.m_dFieldMask = tQword.m_dFields; tHit.SetAggrCount ( tQword.m_uMatchHits ); m_pOutputIndex->cidxHit ( &tHit, pInline ); } } } template < typename QWORD > inline void TransferHits ( QWORD & tQword, CSphRowitem * pInline, CSphAggregateHit & tHit ) { assert ( tQword.m_bHasHitlist ); tHit.m_iDocID = tQword.m_tDoc.m_iDocID - m_pOutputIndex->m_pMin->m_iDocID; for ( Hitpos_t uHit = tQword.GetNextHit(); uHit!=EMPTY_HIT; uHit = tQword.GetNextHit() ) { tHit.m_iWordPos = uHit; m_pOutputIndex->cidxHit ( &tHit, pInline ); } } template < typename QWORD > static inline void ConfigureQword ( QWORD & tQword, CSphAutofile & tHits, CSphAutofile & tDocs, CSphIndex_VLN * pIndex ) { bool bInline = pIndex->m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE; tQword.m_iInlineAttrs = bInline ? pIndex->m_tSchema.GetAttrsCount() : 0; tQword.m_pInlineFixup = bInline ? pIndex->m_pMin->m_pDynamic : NULL; tQword.m_rdHitlist.SetFile ( tHits ); tQword.m_rdHitlist.GetByte(); tQword.m_rdDoclist.SetFile ( tDocs ); tQword.m_rdDoclist.GetByte(); } }; template < typename QWORDDST, typename QWORDSRC > bool CSphIndex_VLN::MergeWords ( CSphIndex_VLN * pSrcIndex, ISphFilter * pFilter ) { assert ( m_pDict->GetSettings().m_bWordDict==pSrcIndex->m_pDict->GetSettings().m_bWordDict ); // setup writers m_wrDoclist.OpenFile ( GetIndexFileName("spd.tmp"), m_sLastError ); m_wrHitlist.OpenFile ( GetIndexFileName("spp.tmp"), m_sLastError ); BYTE bDummy = 1; m_wrDoclist.PutBytes ( &bDummy, 1 ); m_wrHitlist.PutBytes ( &bDummy, 1 ); m_pDict->HitblockBegin(); CSphDictReader tDstReader; CSphDictReader tSrcReader; const bool bWordDict = m_pDict->GetSettings().m_bWordDict; tDstReader.Setup ( GetIndexFileName("spi"), m_tWordlist.m_iCheckpointsPos, m_tSettings.m_eHitless, m_sLastError, ( bWordDict ? m_pDict : NULL ) ); tSrcReader.Setup ( pSrcIndex->GetIndexFileName("spi"), pSrcIndex->m_tWordlist.m_iCheckpointsPos, pSrcIndex->m_tSettings.m_eHitless, m_sLastError, ( bWordDict ? m_pDict : NULL ) ); if ( !m_sLastError.IsEmpty() ) return false; /// prepare for indexing m_tLastHit.m_iDocID = 0; m_tLastHit.m_iWordID = 0; m_tLastHit.m_sKeyword = m_sLastKeyword; m_tLastHit.m_iWordPos = EMPTY_HIT; const SphDocID_t iDstMinID = m_pMin->m_iDocID; const SphDocID_t iSrcMinID = pSrcIndex->m_pMin->m_iDocID; // correct infinum might be already set during spa merging. if ( !m_iMergeInfinum ) m_pMin->m_iDocID = Min ( iDstMinID, iSrcMinID ); else m_pMin->m_iDocID = m_iMergeInfinum; m_tWordlist.m_dCheckpoints.Reset ( 0 ); const int iDstDynamic = m_tSchema.GetDynamicSize(); const int iSrcDynamic = pSrcIndex->m_tSchema.GetDynamicSize(); /// setup qwords QWORDDST tDstQword ( false, false ); QWORDSRC tSrcQword ( false, false ); CSphAutofile fSrcDocs, fSrcHits; fSrcDocs.Open ( pSrcIndex->GetIndexFileName("spd"), SPH_O_READ, m_sLastError ); fSrcHits.Open ( pSrcIndex->GetIndexFileName("spp"), SPH_O_READ, m_sLastError ); CSphAutofile fDstDocs, fDstHits; fDstDocs.Open ( GetIndexFileName("spd"), SPH_O_READ, m_sLastError ); fDstHits.Open ( GetIndexFileName("spp"), SPH_O_READ, m_sLastError ); if ( !m_sLastError.IsEmpty() ) return false; CSphMerger::ConfigureQword ( tDstQword, fDstHits, fDstDocs, this ); CSphMerger::ConfigureQword ( tSrcQword, fSrcHits, fSrcDocs, pSrcIndex ); int iDstInlineSize = m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ? m_tSchema.GetRowSize() : 0; int iSrcInlineSize = pSrcIndex->m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ? pSrcIndex->m_tSchema.GetRowSize() : 0; CSphAutoArray dDstInline ( iDstInlineSize ); CSphAutoArray dSrcInline ( iSrcInlineSize ); /// merge CSphMerger tMerge(this); bool bDstWord = tDstReader.Read(); bool bSrcWord = tSrcReader.Read(); if ( m_pProgress ) { m_tProgress.m_ePhase = CSphIndexProgress::PHASE_MERGE; m_pProgress ( &m_tProgress, false ); } int iWords = 0; int iHitlistsDiscarded = 0; while ( bDstWord || bSrcWord ) { if ( iWords==1000 ) { m_tProgress.m_iWords += 1000; iWords = 0; m_pProgress ( &m_tProgress, false ); } const int iCmp = tDstReader.CmpWord ( tSrcReader ); if ( !bSrcWord || ( bDstWord && iCmp<0 ) ) { // transfer documents and hits from destination CSphMerger::PrepareQword ( tDstQword, tDstReader, iDstDynamic, iDstMinID, bWordDict ); tMerge.TransferData ( tDstQword, tDstReader.m_iWordID, tDstReader.GetWord(), this, dDstInline, pFilter ); iWords++; bDstWord = tDstReader.Read(); } else if ( !bDstWord || ( bSrcWord && iCmp>0 ) ) { // transfer documents and hits from source CSphMerger::PrepareQword ( tSrcQword, tSrcReader, iSrcDynamic, iSrcMinID, bWordDict ); tMerge.TransferData ( tSrcQword, tSrcReader.m_iWordID, tSrcReader.GetWord(), pSrcIndex, dSrcInline, NULL ); iWords++; bSrcWord = tSrcReader.Read(); } else // merge documents and hits inside the word { assert ( iCmp==0 ); bool bHitless = !tDstReader.m_bHasHitlist; if ( tDstReader.m_bHasHitlist!=tSrcReader.m_bHasHitlist ) { iHitlistsDiscarded++; bHitless = true; } CSphMerger::PrepareQword ( tDstQword, tDstReader, iDstDynamic, iDstMinID, bWordDict ); CSphMerger::PrepareQword ( tSrcQword, tSrcReader, iSrcDynamic, iSrcMinID, bWordDict ); CSphAggregateHit tHit; tHit.m_iWordID = tDstReader.m_iWordID; // !COMMIT m_sKeyword anyone? tHit.m_sKeyword = tDstReader.GetWord(); tHit.m_dFieldMask.Unset(); bool bDstDocs = CSphMerger::NextDocument ( tDstQword, this, dDstInline, pFilter ); bool bSrcDocs = true; tSrcQword.GetNextDoc ( dSrcInline ); tSrcQword.SeekHitlist ( tSrcQword.m_iHitlistPos ); while ( bDstDocs || bSrcDocs ) { if ( !bSrcDocs || ( bDstDocs && tDstQword.m_tDoc.m_iDocID < tSrcQword.m_tDoc.m_iDocID ) ) { // transfer hits from destination if ( bHitless ) { while ( tDstQword.m_bHasHitlist && tDstQword.GetNextHit()!=EMPTY_HIT ); tHit.m_iDocID = tDstQword.m_tDoc.m_iDocID - m_pMin->m_iDocID; tHit.m_dFieldMask = tDstQword.m_dFields; tHit.SetAggrCount ( tDstQword.m_uMatchHits ); cidxHit ( &tHit, dSrcInline ); } else tMerge.TransferHits ( tDstQword, dDstInline, tHit ); bDstDocs = CSphMerger::NextDocument ( tDstQword, this, dDstInline, pFilter ); } else if ( !bDstDocs || ( bSrcDocs && tDstQword.m_tDoc.m_iDocID > tSrcQword.m_tDoc.m_iDocID ) ) { // transfer hits from source if ( bHitless ) { while ( tSrcQword.m_bHasHitlist && tSrcQword.GetNextHit()!=EMPTY_HIT ); tHit.m_iDocID = tSrcQword.m_tDoc.m_iDocID - m_pMin->m_iDocID; tHit.m_dFieldMask = tSrcQword.m_dFields; tHit.SetAggrCount ( tSrcQword.m_uMatchHits ); cidxHit ( &tHit, dSrcInline ); } else tMerge.TransferHits ( tSrcQword, dSrcInline, tHit ); bSrcDocs = CSphMerger::NextDocument ( tSrcQword, pSrcIndex, dSrcInline, NULL ); } else { // merge hits inside the document assert ( bDstDocs ); assert ( bSrcDocs ); assert ( tDstQword.m_tDoc.m_iDocID==tSrcQword.m_tDoc.m_iDocID ); tHit.m_iDocID = tDstQword.m_tDoc.m_iDocID - m_pMin->m_iDocID; if ( bHitless ) { while ( tDstQword.m_bHasHitlist && tDstQword.GetNextHit()!=EMPTY_HIT ); while ( tSrcQword.m_bHasHitlist && tSrcQword.GetNextHit()!=EMPTY_HIT ); tHit.m_dFieldMask = tDstQword.m_dFields | tSrcQword.m_dFields; tHit.SetAggrCount ( tDstQword.m_uMatchHits + tSrcQword.m_uMatchHits ); cidxHit ( &tHit, dSrcInline ); } else { Hitpos_t uDstHit = tDstQword.GetNextHit(); Hitpos_t uSrcHit = tSrcQword.GetNextHit(); while ( uDstHit!=EMPTY_HIT || uSrcHit!=EMPTY_HIT ) { if ( uSrcHit==EMPTY_HIT || ( uDstHit!=EMPTY_HIT && uDstHitm_tStats.m_iTotalDocuments; m_tStats.m_iTotalBytes += pSrcIndex->m_tStats.m_iTotalBytes; m_tProgress.m_iWords += iWords; m_pProgress ( &m_tProgress, false ); if ( iHitlistsDiscarded ) m_sLastWarning.SetSprintf ( "discarded hitlists for %u words", iHitlistsDiscarded ); return true; } bool CSphIndex_VLN::Merge ( CSphIndex * pSource, CSphVector & dFilters, bool bMergeKillLists ) { assert ( pSource ); CSphIndex_VLN * pSrcIndex = dynamic_cast< CSphIndex_VLN * >( pSource ); assert ( pSrcIndex ); CSphString sWarning; if ( !Prealloc ( false, false, sWarning ) || !Preread() ) return false; if ( !pSrcIndex->Prealloc ( false, false, sWarning ) || !pSrcIndex->Preread() ) { m_sLastError.SetSprintf ( "source index preload failed: %s", pSrcIndex->GetLastError().cstr() ); return false; } const CSphSchema & tDstSchema = m_tSchema; const CSphSchema & tSrcSchema = pSrcIndex->m_tSchema; if ( !tDstSchema.CompareTo ( tSrcSchema, m_sLastError ) ) return false; if ( m_tSettings.m_eHitless!=pSrcIndex->m_tSettings.m_eHitless ) { m_sLastError = "hitless settings must be the same on merged indices"; return false; } // FIXME! if ( m_tSettings.m_eDocinfo!=pSrcIndex->m_tSettings.m_eDocinfo && !( m_bIsEmpty || pSrcIndex->m_bIsEmpty ) ) { m_sLastError.SetSprintf ( "docinfo storage on non-empty indexes must be the same (dst docinfo %d, empty %d, src docinfo %d, empty %d", m_tSettings.m_eDocinfo, m_bIsEmpty, pSrcIndex->m_tSettings.m_eDocinfo, pSrcIndex->m_bIsEmpty ); return false; } if ( m_pDict->GetSettings().m_bWordDict!=pSrcIndex->m_pDict->GetSettings().m_bWordDict ) { m_sLastError.SetSprintf ( "dictionary types must be the same (dst dict=%s, src dict=%s )", m_pDict->GetSettings().m_bWordDict ? "keywords" : "crc", pSrcIndex->m_pDict->GetSettings().m_bWordDict ? "keywords" : "crc" ); return false; } m_bWordDict = m_pDict->GetSettings().m_bWordDict; m_bMerging = true; int iStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); // create filters ISphFilter * pFilter = CreateMergeFilters ( dFilters, m_tSchema, GetMVAPool() ); DWORD nKillListSize = pSrcIndex->GetKillListSize (); if ( nKillListSize ) { CSphFilterSettings tKillListFilter; SphAttr_t * pKillList = pSrcIndex->GetKillList (); tKillListFilter.m_bExclude = true; tKillListFilter.m_eType = SPH_FILTER_VALUES; tKillListFilter.m_uMinValue = pKillList[0]; tKillListFilter.m_uMaxValue = pKillList[nKillListSize -1]; tKillListFilter.m_sAttrName = "@id"; tKillListFilter.SetExternalValues ( pKillList, nKillListSize ); ISphFilter * pKillListFilter = sphCreateFilter ( tKillListFilter, m_tSchema, GetMVAPool(), m_sLastError ); pFilter = sphJoinFilters ( pFilter, pKillListFilter ); } ///////////////////////////////////////// // merging attributes (.spa, .spm, .sps) ///////////////////////////////////////// CSphAutoreader tDstSPM, tSrcSPM, tDstSPS, tSrcSPS; if ( !tDstSPM.Open ( GetIndexFileName("spm"), m_sLastError ) || !tSrcSPM.Open ( pSrcIndex->GetIndexFileName("spm"), m_sLastError ) || !tDstSPS.Open ( GetIndexFileName("sps"), m_sLastError ) || !tSrcSPS.Open ( pSrcIndex->GetIndexFileName("sps"), m_sLastError ) ) { return false; } CSphWriter tSPMWriter, tSPSWriter; if ( !tSPMWriter.OpenFile ( GetIndexFileName("spm.tmp"), m_sLastError ) || !tSPSWriter.OpenFile ( GetIndexFileName("sps.tmp"), m_sLastError ) ) { return false; } tSPSWriter.PutByte ( 0 ); // dummy byte, to reserve magic zero offset /// merging CSphVector dMvaLocators; CSphVector dStringLocators; for ( int i=0; i dPhantomKiller; int iTotalDocuments = 0; bool bNeedInfinum = true; m_iMergeInfinum = 0; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && pSrcIndex->m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN ) { CSphWriter wrRows; if ( !wrRows.OpenFile ( GetIndexFileName("spa.tmp"), m_sLastError ) ) return false; AttrIndexBuilder_c tMinMax ( m_tSchema ); CSphVector dMinMaxBuffer ( tMinMax.GetExpectedSize ( m_tStats.m_iTotalDocuments + pSrcIndex->GetStats().m_iTotalDocuments ) ); tMinMax.Prepare ( dMinMaxBuffer.Begin(), dMinMaxBuffer.Begin() + dMinMaxBuffer.GetLength() ); m_uMinMaxIndex = 0; DWORD * pSrcRow = pSrcIndex->m_pDocinfo.GetWritePtr(); // they *can* be null if the respective index is empty DWORD * pDstRow = m_pDocinfo.GetWritePtr(); DWORD iSrcCount = 0; DWORD iDstCount = 0; tDstMVA.Read ( tDstSPM ); tSrcMVA.Read ( tSrcSPM ); CSphMatch tMatch; while ( iSrcCount < pSrcIndex->m_uDocinfo || iDstCount < m_uDocinfo ) { SphDocID_t iDstDocID, iSrcDocID; if ( iDstCount < m_uDocinfo ) { iDstDocID = DOCINFO2ID ( pDstRow ); if ( pFilter ) { tMatch.m_iDocID = iDstDocID; tMatch.m_pStatic = reinterpret_cast ( DOCINFO2ATTRS ( pDstRow ) ); tMatch.m_pDynamic = NULL; if ( !pFilter->Eval ( tMatch ) ) { pDstRow += iStride; iDstCount++; continue; } } } else iDstDocID = 0; if ( iSrcCount < pSrcIndex->m_uDocinfo ) iSrcDocID = DOCINFO2ID ( pSrcRow ); else iSrcDocID = 0; if ( ( iDstDocID && iDstDocID < iSrcDocID ) || ( iDstDocID && !iSrcDocID ) ) { while ( tDstMVA.m_iDocID && tDstMVA.m_iDocIDm_bIsEmpty ) { // one of the indexes has no documents; copy the .spa file from the other one CSphString sSrc = !m_bIsEmpty ? GetIndexFileName("spa") : pSrcIndex->GetIndexFileName("spa"); CSphString sDst = GetIndexFileName("spa.tmp"); if ( !CopyFile ( sSrc.cstr(), sDst.cstr(), m_sLastError ) ) return false; } else { // storage is not extern; create dummy .spa file CSphAutofile fdSpa ( GetIndexFileName("spa.tmp"), SPH_O_NEW, m_sLastError ); fdSpa.Close(); } // create phantom killlist filter if ( dPhantomKiller.GetLength() ) { CSphFilterSettings tKLF; tKLF.m_bExclude = true; tKLF.m_eType = SPH_FILTER_VALUES; tKLF.m_uMinValue = dPhantomKiller[0]; tKLF.m_uMaxValue = dPhantomKiller.Last(); tKLF.m_sAttrName = "@id"; tKLF.SetExternalValues ( &dPhantomKiller[0], dPhantomKiller.GetLength() ); ISphFilter * pSpaFilter = sphCreateFilter ( tKLF, m_tSchema, GetMVAPool(), m_sLastError ); pFilter = sphJoinFilters ( pFilter, pSpaFilter ); } CSphScopedPtr pScopedFilter ( pFilter ); CSphAutofile fdTmpDict ( GetIndexFileName("spi.tmp8"), SPH_O_NEW, m_sLastError, true ); CSphAutofile fdDict ( GetIndexFileName("spi.tmp"), SPH_O_NEW, m_sLastError ); if ( !m_sLastError.IsEmpty() || fdTmpDict.GetFD()<0 || fdDict.GetFD()<0 ) return false; m_pDict->DictBegin ( fdTmpDict.GetFD(), fdDict.GetFD(), 8*1024*1024 ); // FIXME? is this magic dict block constant any good?.. // merge dictionaries, doclists and hitlists if ( m_pDict->GetSettings().m_bWordDict ) { WITH_QWORD ( this, false, QwordDst, WITH_QWORD ( pSrcIndex, false, QwordSrc, { if ( !MergeWords < QwordDst, QwordSrc > ( pSrcIndex, pFilter ) ) return false; } ) ); } else { WITH_QWORD ( this, true, QwordDst, WITH_QWORD ( pSrcIndex, true, QwordSrc, { if ( !MergeWords < QwordDst, QwordSrc > ( pSrcIndex, pFilter ) ) return false; } ) ); } if ( iTotalDocuments ) m_tStats.m_iTotalDocuments = iTotalDocuments; // merge kill-lists CSphAutofile fdKillList ( GetIndexFileName("spk.tmp"), SPH_O_NEW, m_sLastError ); if ( fdKillList.GetFD () < 0 ) return false; if ( bMergeKillLists ) { // merge spk CSphVector dKillList; dKillList.Reserve ( GetKillListSize() + pSrcIndex->GetKillListSize() ); for ( int i = 0; i < pSrcIndex->GetKillListSize (); i++ ) dKillList.Add ( pSrcIndex->GetKillList () [i] ); for ( int i = 0; i < GetKillListSize (); i++ ) dKillList.Add ( GetKillList () [i] ); dKillList.Uniq (); m_iKillListSize = dKillList.GetLength (); if ( dKillList.GetLength() ) { if ( !sphWriteThrottled ( fdKillList.GetFD(), &dKillList[0], dKillList.GetLength()*sizeof(SphAttr_t), "kill_list", m_sLastError ) ) return false; } } else { m_iKillListSize = 0; } fdKillList.Close (); // finalize CSphAggregateHit tFlush; tFlush.m_iDocID = 0; tFlush.m_iWordID = 0; tFlush.m_sKeyword = (BYTE*)""; // tricky: assertion in cidxHit calls strcmp on this in case of empty index! tFlush.m_iWordPos = EMPTY_HIT; tFlush.m_dFieldMask.Unset(); cidxHit ( &tFlush, NULL ); cidxDone ( "sph.tmp", 8*1024*1024 ); // FIXME? is this magic dict block constant any good?.. // we're done if ( m_pProgress ) m_pProgress ( &m_tProgress, true ); return true; } ///////////////////////////////////////////////////////////////////////////// // THE SEARCHER ///////////////////////////////////////////////////////////////////////////// SphWordID_t CSphDictStar::GetWordID ( BYTE * pWord ) { char sBuf [ 16+3*SPH_MAX_WORD_LEN ]; assert ( strlen ( (const char*)pWord ) < 16+3*SPH_MAX_WORD_LEN ); m_pDict->ApplyStemmers ( pWord ); int iLen = strlen ( (const char*)pWord ); assert ( iLen < 16+3*SPH_MAX_WORD_LEN - 1 ); memcpy ( sBuf, pWord, iLen+1 ); if ( iLen ) { if ( sBuf[iLen-1]=='*' ) { sBuf[iLen-1] = '\0'; } else { sBuf[iLen] = MAGIC_WORD_TAIL; sBuf[iLen+1] = '\0'; } } return m_pDict->GetWordID ( (BYTE*)sBuf ); } SphWordID_t CSphDictStar::GetWordIDNonStemmed ( BYTE * pWord ) { return m_pDict->GetWordIDNonStemmed ( pWord ); } ////////////////////////////////////////////////////////////////////////// CSphDictStarV8::CSphDictStarV8 ( CSphDict * pDict, bool bPrefixes, bool bInfixes ) : CSphDictStar ( pDict ) , m_bPrefixes ( bPrefixes ) , m_bInfixes ( bInfixes ) { } SphWordID_t CSphDictStarV8::GetWordID ( BYTE * pWord ) { char sBuf [ 16+3*SPH_MAX_WORD_LEN ]; int iLen = strlen ( (const char*)pWord ); iLen = Min ( iLen, 16+3*SPH_MAX_WORD_LEN - 1 ); if ( !iLen ) return 0; bool bHeadStar = ( pWord[0]=='*' ); bool bTailStar = ( pWord[iLen-1]=='*' ) && ( iLen>1 ); if ( !bHeadStar && !bTailStar ) { m_pDict->ApplyStemmers ( pWord ); if ( IsStopWord ( pWord ) ) return 0; } iLen = strlen ( (const char*)pWord ); assert ( iLen < 16+3*SPH_MAX_WORD_LEN - 2 ); if ( !iLen || ( bHeadStar && iLen==1 ) ) return 0; if ( m_bInfixes ) { //////////////////////////////////// // infix or mixed infix+prefix mode //////////////////////////////////// // handle head star if ( bHeadStar ) { memcpy ( sBuf, pWord+1, iLen-- ); // chops star, copies trailing zero, updates iLen } else { sBuf[0] = MAGIC_WORD_HEAD; memcpy ( sBuf+1, pWord, ++iLen ); // copies everything incl trailing zero, updates iLen } // handle tail star if ( bTailStar ) { sBuf[--iLen] = '\0'; // got star, just chop it away } else { sBuf[iLen] = MAGIC_WORD_TAIL; // no star, add tail marker sBuf[++iLen] = '\0'; } } else { //////////////////// // prefix-only mode //////////////////// assert ( m_bPrefixes ); // always ignore head star in prefix mode if ( bHeadStar ) { pWord++; iLen--; } // handle tail star if ( !bTailStar ) { // exact word search request, always (ie. both in infix/prefix mode) mangles to "\1word\1" in v.8+ sBuf[0] = MAGIC_WORD_HEAD; memcpy ( sBuf+1, pWord, iLen ); sBuf[iLen+1] = MAGIC_WORD_TAIL; sBuf[iLen+2] = '\0'; iLen += 2; } else { // prefix search request, mangles to word itself (just chop away the star) memcpy ( sBuf, pWord, iLen ); sBuf[--iLen] = '\0'; } } // calc id for mangled word return m_pDict->GetWordID ( (BYTE*)sBuf, iLen, !bHeadStar && !bTailStar ); } ////////////////////////////////////////////////////////////////////////// SphWordID_t CSphDictExact::GetWordID ( BYTE * pWord ) { int iLen = strlen ( (const char*)pWord ); iLen = Min ( iLen, 16+3*SPH_MAX_WORD_LEN - 1 ); if ( !iLen ) return 0; if ( pWord[0]=='=' ) pWord[0] = MAGIC_WORD_HEAD_NONSTEMMED; if ( pWord[0]<' ' ) return m_pDict->GetWordIDNonStemmed ( pWord ); return m_pDict->GetWordID ( pWord ); } ///////////////////////////////////////////////////////////////////////////// inline bool sphGroupMatch ( SphAttr_t iGroup, const SphAttr_t * pGroups, int iGroups ) { if ( !pGroups ) return true; const SphAttr_t * pA = pGroups; const SphAttr_t * pB = pGroups+iGroups-1; if ( iGroup==*pA || iGroup==*pB ) return true; if ( iGroup<(*pA) || iGroup>(*pB) ) return false; while ( pB-pA>1 ) { const SphAttr_t * pM = pA + ((pB-pA)/2); if ( iGroup==(*pM) ) return true; if ( iGroup<(*pM) ) pB = pM; else pA = pM; } return false; } bool CSphIndex_VLN::EarlyReject ( CSphQueryContext * pCtx, CSphMatch & tMatch ) const { // might be needed even when we do not have a filter if ( pCtx->m_bLookupFilter ) CopyDocinfo ( pCtx, tMatch, FindDocinfo ( tMatch.m_iDocID ) ); pCtx->CalcFilter ( tMatch ); return pCtx->m_pFilter ? !pCtx->m_pFilter->Eval ( tMatch ) : false; } SphAttr_t * CSphIndex_VLN::GetKillList () const { return m_pKillList.GetWritePtr (); } bool CSphIndex_VLN::HasDocid ( SphDocID_t uDocid ) const { return FindDocinfo ( uDocid )!=NULL; } const DWORD * CSphIndex_VLN::FindDocinfo ( SphDocID_t uDocID ) const { if ( m_uDocinfo<=0 ) return NULL; assert ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN ); assert ( !m_pDocinfo.IsEmpty() ); assert ( m_tSchema.GetAttrsCount() ); int iStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); int iStart = 0; int iEnd = m_uDocinfo-1; if ( m_pDocinfoHash.GetLength() ) { SphDocID_t uFirst = DOCINFO2ID ( &m_pDocinfo[0] ); SphDocID_t uLast = DOCINFO2ID ( &m_pDocinfo[(m_uDocinfo-1)*iStride] ); if ( uDocIDuLast ) return NULL; DWORD uHash = (DWORD)( ( uDocID - uFirst ) >> m_pDocinfoHash[0] ); if ( uHash > ( 1 << DOCINFO_HASH_BITS ) ) // possible in case of broken data, for instance return NULL; iStart = m_pDocinfoHash [ uHash+1 ]; iEnd = m_pDocinfoHash [ uHash+2 ] - 1; } const DWORD * pFound = NULL; if ( uDocID==DOCINFO2ID ( &m_pDocinfo [ iStart*iStride ] ) ) { pFound = &m_pDocinfo [ iStart*iStride ]; } else if ( uDocID==DOCINFO2ID ( &m_pDocinfo [ iEnd*iStride ] ) ) { pFound = &m_pDocinfo [ iEnd*iStride ]; } else { while ( iEnd-iStart>1 ) { // check if nothing found if ( uDocID < DOCINFO2ID ( &m_pDocinfo [ iStart*iStride ] ) || uDocID > DOCINFO2ID ( &m_pDocinfo [ iEnd*iStride ] ) ) break; assert ( uDocID > DOCINFO2ID ( &m_pDocinfo [ iStart*iStride ] ) ); assert ( uDocID < DOCINFO2ID ( &m_pDocinfo [ iEnd*iStride ] ) ); int iMid = iStart + (iEnd-iStart)/2; if ( uDocID==DOCINFO2ID ( &m_pDocinfo [ iMid*iStride ] ) ) { pFound = &m_pDocinfo [ iMid*iStride ]; break; } if ( uDocIDm_pOverrides ) ARRAY_FOREACH ( i, (*pCtx->m_pOverrides) ) { const CSphAttrOverride & tOverride = (*pCtx->m_pOverrides)[i]; // shortcut const CSphAttrOverride::IdValuePair_t * pEntry = tOverride.m_dValues.BinarySearch ( bind ( &CSphAttrOverride::IdValuePair_t::m_uDocID ), tMatch.m_iDocID ); tMatch.SetAttr ( pCtx->m_dOverrideOut[i], pEntry ? pEntry->m_uValue : sphGetRowAttr ( tMatch.m_pStatic, pCtx->m_dOverrideIn[i] ) ); } // dynamize if necessary ARRAY_FOREACH ( j, m_dDynamize ) tMatch.SetAttr ( m_dDynamize[j].m_tTo, tMatch.GetAttr ( m_dDynamize[j].m_tFrom ) ); } void CSphIndex_VLN::SetDynamize ( const CSphVector & dDynamize ) { m_dDynamize = dDynamize; } static inline void CalcContextItems ( CSphMatch & tMatch, const CSphVector & dItems ) { ARRAY_FOREACH ( i, dItems ) { const CSphQueryContext::CalcItem_t & tCalc = dItems[i]; if ( tCalc.m_eType==SPH_ATTR_INTEGER ) tMatch.SetAttr ( tCalc.m_tLoc, tCalc.m_pExpr->IntEval(tMatch) ); else if ( tCalc.m_eType==SPH_ATTR_BIGINT ) tMatch.SetAttr ( tCalc.m_tLoc, tCalc.m_pExpr->Int64Eval(tMatch) ); else tMatch.SetAttrFloat ( tCalc.m_tLoc, tCalc.m_pExpr->Eval(tMatch) ); } } void CSphQueryContext::CalcFilter ( CSphMatch & tMatch ) const { CalcContextItems ( tMatch, m_dCalcFilter ); } void CSphQueryContext::CalcSort ( CSphMatch & tMatch ) const { CalcContextItems ( tMatch, m_dCalcSort ); } void CSphQueryContext::CalcFinal ( CSphMatch & tMatch ) const { CalcContextItems ( tMatch, m_dCalcFinal ); } void CSphQueryContext::SetStringPool ( const BYTE * pStrings ) { ARRAY_FOREACH ( i, m_dCalcFilter ) m_dCalcFilter[i].m_pExpr->SetStringPool ( pStrings ); ARRAY_FOREACH ( i, m_dCalcSort ) m_dCalcSort[i].m_pExpr->SetStringPool ( pStrings ); ARRAY_FOREACH ( i, m_dCalcFinal ) m_dCalcFinal[i].m_pExpr->SetStringPool ( pStrings ); } void CSphQueryContext::SetMVAPool ( const DWORD * pMva ) { ARRAY_FOREACH ( i, m_dCalcFilter ) m_dCalcFilter[i].m_pExpr->SetMVAPool ( pMva ); ARRAY_FOREACH ( i, m_dCalcSort ) m_dCalcSort[i].m_pExpr->SetMVAPool ( pMva ); ARRAY_FOREACH ( i, m_dCalcFinal ) m_dCalcFinal[i].m_pExpr->SetMVAPool ( pMva ); if ( m_pFilter ) m_pFilter->SetMVAStorage ( pMva ); if ( m_pWeightFilter ) m_pWeightFilter->SetMVAStorage ( pMva ); } bool CSphIndex_VLN::MatchExtended ( CSphQueryContext * pCtx, const CSphQuery * pQuery, int iSorters, ISphMatchSorter ** ppSorters, ISphRanker * pRanker, int iTag ) const { int iCutoff = pQuery->m_iCutoff; if ( iCutoff<=0 ) iCutoff = -1; // do searching CSphMatch * pMatch = pRanker->GetMatchesBuffer(); for ( ;; ) { int iMatches = pRanker->GetMatches(); if ( iMatches<=0 ) break; for ( int i=0; im_bLookupSort ) CopyDocinfo ( pCtx, pMatch[i], FindDocinfo ( pMatch[i].m_iDocID ) ); pCtx->CalcSort ( pMatch[i] ); if ( pCtx->m_pWeightFilter && !pCtx->m_pWeightFilter->Eval ( pMatch[i] ) ) continue; pMatch[i].m_iTag = iTag; bool bRand = false; bool bNewMatch = false; for ( int iSorter=0; iSorterm_bRandomize ) { bRand = true; pMatch[i].m_iWeight = ( sphRand() & 0xffff ); if ( pCtx->m_pWeightFilter && !pCtx->m_pWeightFilter->Eval ( pMatch[i] ) ) break; } bNewMatch |= ppSorters[iSorter]->Push ( pMatch[i] ); } if ( bNewMatch ) if ( --iCutoff==0 ) break; } if ( iCutoff==0 ) break; } return true; } ////////////////////////////////////////////////////////////////////////// bool CSphIndex_VLN::MultiScan ( const CSphQuery * pQuery, CSphQueryResult * pResult, int iSorters, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag ) const { assert ( pQuery->m_sQuery.IsEmpty() ); assert ( iTag>=0 ); // check if index is ready if ( !m_pPreread || !*m_pPreread ) { pResult->m_sError = "index not preread"; return false; } // check if index supports scans if ( m_tSettings.m_eDocinfo!=SPH_DOCINFO_EXTERN || !m_tSchema.GetAttrsCount() ) { pResult->m_sError = "fullscan requires extern docinfo"; return false; } // check if index has data if ( m_bIsEmpty || m_uDocinfo<=0 || m_pDocinfo.IsEmpty() ) return true; // start counting int64_t tmQueryStart = sphMicroTimer(); // select the sorter with max schema int iMaxSchemaSize = -1; int iMaxSchemaIndex = -1; for ( int i=0; iGetSchema().GetRowSize() > iMaxSchemaSize ) { iMaxSchemaSize = ppSorters[i]->GetSchema().GetRowSize(); iMaxSchemaIndex = i; } // setup calculations and result schema CSphQueryContext tCtx; if ( !tCtx.SetupCalc ( pResult, ppSorters[iMaxSchemaIndex]->GetSchema(), m_tSchema, GetMVAPool() ) ) return false; // set string pool for string on_sort expression fix up tCtx.SetStringPool ( m_pStrings.GetWritePtr() ); // setup filters if ( !tCtx.CreateFilters ( true, &pQuery->m_dFilters, pResult->m_tSchema, GetMVAPool(), pResult->m_sError ) ) return false; if ( !tCtx.CreateFilters ( true, pExtraFilters, pResult->m_tSchema, GetMVAPool(), pResult->m_sError ) ) return false; // check if we can early reject the whole index if ( tCtx.m_pFilter && m_uDocinfoIndex ) { DWORD uStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); DWORD * pMinEntry = const_cast ( &m_pDocinfoIndex [ 2*m_uDocinfoIndex*uStride ] ); DWORD * pMaxEntry = pMinEntry + uStride; if ( !tCtx.m_pFilter->EvalBlock ( pMinEntry, pMaxEntry ) ) { pResult->m_iQueryTime += (int)( ( sphMicroTimer()-tmQueryStart )/1000 ); return true; } } // setup lookup tCtx.m_bLookupFilter = false; tCtx.m_bLookupSort = true; // setup sorters vs. MVA for ( int i=0; iSetMVAPool ( m_pMva.GetWritePtr() ); (ppSorters[i])->SetStringPool ( m_pStrings.GetWritePtr() ); } // setup overrides if ( !tCtx.SetupOverrides ( pQuery, pResult, m_tSchema ) ) return false; // do scan bool bRandomize = ppSorters[0]->m_bRandomize; int iCutoff = pQuery->m_iCutoff; if ( iCutoff<=0 ) iCutoff = -1; CSphMatch tMatch; tMatch.Reset ( pResult->m_tSchema.GetDynamicSize() ); tMatch.m_iWeight = pQuery->GetIndexWeight ( m_sIndexName.cstr() ); DWORD uStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); DWORD uStart = pQuery->m_bReverseScan ? ( m_uDocinfoIndex-1 ) : 0; int iStep = pQuery->m_bReverseScan ? -1 : 1; int iMyTag = tCtx.m_dCalcFinal.GetLength() ? -1 : iTag; for ( DWORD uIndexEntry=uStart; uIndexEntryEvalBlock ( pMin, pMax ) ) continue; /////////////////////// // row-level filtering /////////////////////// const DWORD * pBlockStart = &m_pDocinfo [ uStride*uIndexEntry*DOCINFO_INDEX_FREQ ]; const DWORD * pBlockEnd = &m_pDocinfo [ uStride*( Min ( (uIndexEntry+1)*DOCINFO_INDEX_FREQ, m_uDocinfo ) - 1 ) ]; for ( const DWORD * pDocinfo=pBlockStart; pDocinfo<=pBlockEnd; pDocinfo+=uStride ) { tMatch.m_iDocID = DOCINFO2ID ( pDocinfo ); CopyDocinfo ( &tCtx, tMatch, pDocinfo ); // early filter only (no late filters in full-scan because of no @weight) tCtx.CalcFilter ( tMatch ); if ( tCtx.m_pFilter && !tCtx.m_pFilter->Eval ( tMatch ) ) continue; // submit match to sorters tCtx.CalcSort ( tMatch ); if ( bRandomize ) tMatch.m_iWeight = ( sphRand() & 0xffff ); tMatch.m_iTag = iMyTag; bool bNewMatch = false; for ( int iSorter=0; iSorterPush ( tMatch ); // handle cutoff if ( bNewMatch ) if ( --iCutoff==0 ) { uIndexEntry = m_uDocinfoIndex; // outer break break; } } if ( iCutoff==0 ) break; } // do final expression calculations if ( tCtx.m_dCalcFinal.GetLength() ) for ( int iSorter=0; iSorterGetLength (); if ( !iCount ) continue; CSphMatch * const pHead = pTop->First(); CSphMatch * const pTail = pHead + iCount; for ( CSphMatch * pCur=pHead; pCurm_iTag<0 ) { tCtx.CalcFinal ( *pCur ); pCur->m_iTag = iTag; } } } // done pResult->m_pMva = m_pMva.GetWritePtr(); pResult->m_pStrings = m_pStrings.GetWritePtr(); pResult->m_iQueryTime += (int)( ( sphMicroTimer()-tmQueryStart )/1000 ); return true; } ////////////////////////////////////////////////////////////////////////////// ISphQword * DiskIndexQwordSetup_c::QwordSpawn ( const XQKeyword_t & tWord ) const { WITH_QWORD ( m_pIndex, false, Qword, return new Qword ( tWord.m_bExpanded, tWord.m_bExcluded ) ); return NULL; } bool DiskIndexQwordSetup_c::QwordSetup ( ISphQword * pWord ) const { WITH_QWORD ( m_pIndex, false, Qword, return Setup ( pWord ) ); return false; } template < class Qword > bool DiskIndexQwordSetup_c::Setup ( ISphQword * pWord ) const { Qword * pMyWord = dynamic_cast ( pWord ); if ( !pMyWord ) return false; Qword & tWord = *pMyWord; // setup attrs tWord.m_tDoc.Reset ( m_iDynamicRowitems ); tWord.m_iMinID = m_tMin.m_iDocID; tWord.m_tDoc.m_iDocID = m_tMin.m_iDocID; if ( m_eDocinfo==SPH_DOCINFO_INLINE ) { tWord.m_iInlineAttrs = m_iInlineRowitems; tWord.m_pInlineFixup = m_tMin.m_pDynamic; } else { tWord.m_iInlineAttrs = 0; tWord.m_pInlineFixup = NULL; } // setup stats tWord.m_iDocs = 0; tWord.m_iHits = 0; CSphIndex_VLN * pIndex = (CSphIndex_VLN *)m_pIndex; // binary search through checkpoints for a one whose range matches word ID assert ( pIndex->m_pPreread && *pIndex->m_pPreread ); assert ( !pIndex->m_bPreloadWordlist || !pIndex->m_tWordlist.m_pBuf.IsEmpty() ); // empty index? if ( !pIndex->m_tWordlist.m_dCheckpoints.GetLength() ) return false; const char * sWord = tWord.m_sDictWord.cstr(); const bool bWordDict = pIndex->m_pDict->GetSettings().m_bWordDict; int iWordLen = sWord ? strlen ( sWord ) : 0; if ( pIndex->m_bEnableStar && bWordDict && tWord.m_sWord.Ends("*") ) iWordLen = Max ( iWordLen-1, 0 ); // leading special symbols trimming if ( tWord.m_sDictWord.Begins("*") ) { sWord++; iWordLen = Max ( iWordLen-1, 0 ); } const CSphWordlistCheckpoint * pCheckpoint = pIndex->m_tWordlist.FindCheckpoint ( sWord, iWordLen, tWord.m_iWordID, false ); if ( !pCheckpoint ) return false; // decode wordlist chunk const BYTE * pBuf = pIndex->m_tWordlist.AcquireDict ( pCheckpoint, m_tWordlist.GetFD(), m_pDictBuf ); assert ( pBuf ); WordDictInfo_t tResWord; WordReaderContext_t tReaderCtx; const bool bWordFound = bWordDict ? pIndex->m_tWordlist.GetWord ( pBuf, sWord, iWordLen, tResWord, false, tReaderCtx )!=NULL : pIndex->m_tWordlist.GetWord ( pBuf, tWord.m_iWordID, tResWord ); if ( bWordFound ) { const ESphHitless eMode = pIndex->m_tSettings.m_eHitless; tWord.m_iDocs = eMode==SPH_HITLESS_SOME ? ( tResWord.m_iDocs & 0x7FFFFFFF ) : tResWord.m_iDocs; tWord.m_iHits = tResWord.m_iHits; tWord.m_bHasHitlist = ( eMode==SPH_HITLESS_NONE ) || ( eMode==SPH_HITLESS_SOME && !( tResWord.m_iDocs & 0x80000000 ) ); if ( m_bSetupReaders ) { tWord.m_rdDoclist.SetBuffers ( g_iReadBuffer, g_iReadUnhinted ); tWord.m_rdDoclist.SetFile ( m_tDoclist ); tWord.m_rdDoclist.SeekTo ( tResWord.m_uOff, tResWord.m_iDoclistHint ); tWord.m_rdHitlist.SetBuffers ( g_iReadBuffer, g_iReadUnhinted ); tWord.m_rdHitlist.SetFile ( m_tHitlist ); } } return bWordFound; } ////////////////////////////////////////////////////////////////////////////// bool CSphIndex_VLN::Lock () { CSphString sName = GetIndexFileName("spl"); sphLogDebug ( "Locking the index via file %s", sName.cstr() ); if ( m_iLockFD<0 ) { m_iLockFD = ::open ( sName.cstr(), SPH_O_NEW, 0644 ); if ( m_iLockFD<0 ) { m_sLastError.SetSprintf ( "failed to open %s: %s", sName.cstr(), strerror(errno) ); sphLogDebug ( "failed to open %s: %s", sName.cstr(), strerror(errno) ); return false; } } if ( !sphLockEx ( m_iLockFD, false ) ) { m_sLastError.SetSprintf ( "failed to lock %s: %s", sName.cstr(), strerror(errno) ); ::close ( m_iLockFD ); m_iLockFD = -1; return false; } sphLogDebug ( "lock %s success", sName.cstr() ); return true; } void CSphIndex_VLN::Unlock() { CSphString sName = GetIndexFileName("spl"); sphLogDebug ( "Unlocking the index (lock %s)", sName.cstr() ); if ( m_iLockFD>=0 ) { sphLogDebug ( "File ID ok, closing lock FD %d, unlinking %s", m_iLockFD, sName.cstr() ); ::close ( m_iLockFD ); ::unlink ( sName.cstr() ); m_iLockFD = -1; } } bool CSphIndex_VLN::Mlock () { bool bRes = true; bRes &= m_pDocinfo.Mlock ( "docinfo", m_sLastError ); if ( m_bPreloadWordlist ) bRes &= m_tWordlist.m_pBuf.Mlock ( "wordlist", m_sLastError ); bRes &= m_pMva.Mlock ( "mva", m_sLastError ); bRes &= m_pStrings.Mlock ( "strings", m_sLastError ); return bRes; } void CSphIndex_VLN::Dealloc () { if ( !m_bPreallocated ) return; m_tDoclistFile.Close (); m_tHitlistFile.Close (); m_pDocinfo.Reset (); m_pDocinfoHash.Reset (); m_pMva.Reset (); m_pStrings.Reset (); m_pKillList.Reset (); m_tWordlist.Reset (); m_uDocinfo = 0; m_uMinMaxIndex = 0; m_tSettings.m_eDocinfo = SPH_DOCINFO_NONE; m_bPreallocated = false; SafeDelete ( m_pTokenizer ); SafeDelete ( m_pDict ); if ( m_iIndexTag>=0 && g_pMvaArena ) g_MvaArena.TaggedFreeTag ( m_iIndexTag ); m_iIndexTag = -1; m_pPreread = NULL; m_pAttrsStatus = NULL; #ifndef NDEBUG m_dShared.Reset (); #endif } static void StripPath ( CSphString & sPath ) { if ( sPath.IsEmpty() ) return; const char * s = sPath.cstr(); if ( *s!='/' ) return; const char * sLastSlash = s; for ( ; *s; s++ ) if ( *s=='/' ) sLastSlash = s; int iPos = (int)( sLastSlash - sPath.cstr() + 1 ); int iLen = (int)( s - sPath.cstr() ); sPath = sPath.SubString ( iPos, iLen - iPos ); } bool CSphIndex_VLN::LoadHeader ( const char * sHeaderName, bool bStripPath, CSphString & sWarning ) { const int MAX_HEADER_SIZE = 32768; CSphAutoArray dCacheInfo ( MAX_HEADER_SIZE ); CSphAutoreader rdInfo ( dCacheInfo, MAX_HEADER_SIZE ); // to avoid mallocs if ( !rdInfo.Open ( sHeaderName, m_sLastError ) ) return false; // version DWORD uHeader = rdInfo.GetDword (); if ( uHeader!=INDEX_MAGIC_HEADER ) { m_sLastError.SetSprintf ( "%s is invalid header file (too old index version?)", sHeaderName ); return false; } m_uVersion = rdInfo.GetDword(); if ( m_uVersion==0 || m_uVersion>INDEX_FORMAT_VERSION ) { m_sLastError.SetSprintf ( "%s is v.%d, binary is v.%d", sHeaderName, m_uVersion, INDEX_FORMAT_VERSION ); return false; } // bits m_bUse64 = false; if ( m_uVersion>=2 ) m_bUse64 = ( rdInfo.GetDword ()!=0 ); if ( m_bUse64!=USE_64BIT ) { #if USE_64BIT // TODO: may be do this param conditional and push it into the config? m_bId32to64 = true; #else m_sLastError.SetSprintf ( "'%s' is id%d, and this binary is id%d", GetIndexFileName("sph").cstr(), m_bUse64 ? 64 : 32, USE_64BIT ? 64 : 32 ); return false; #endif } // docinfo m_tSettings.m_eDocinfo = (ESphDocinfo) rdInfo.GetDword(); // schema m_tSchema.Reset (); m_tSchema.m_dFields.Resize ( rdInfo.GetDword() ); ARRAY_FOREACH ( i, m_tSchema.m_dFields ) ReadSchemaColumn ( rdInfo, m_tSchema.m_dFields[i] ); int iNumAttrs = rdInfo.GetDword(); bool bDynamic = ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ); // inline attributes need be dynamic in searching time too for ( int i=0; iReset ( m_tSchema.GetRowSize() ); if ( m_uVersion>=2 ) m_pMin->m_iDocID = (SphDocID_t) rdInfo.GetOffset (); // v2+; losing high bits when !USE_64 is intentional, check is performed on bUse64 above else m_pMin->m_iDocID = rdInfo.GetDword(); // v1 if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) rdInfo.GetBytes ( m_pMin->m_pDynamic, sizeof(CSphRowitem)*m_tSchema.GetRowSize() ); // wordlist checkpoints m_tWordlist.m_iCheckpointsPos = rdInfo.GetOffset(); m_tWordlist.m_dCheckpoints.Reset ( rdInfo.GetDword() ); // index stats m_tStats.m_iTotalDocuments = rdInfo.GetDword (); m_tStats.m_iTotalBytes = rdInfo.GetOffset (); LoadSettings ( rdInfo ); if ( m_uVersion>=9 ) { // tokenizer stuff CSphTokenizerSettings tSettings; LoadTokenizerSettings ( rdInfo, tSettings, m_uVersion, sWarning ); if ( bStripPath ) StripPath ( tSettings.m_sSynonymsFile ); ISphTokenizer * pTokenizer = ISphTokenizer::Create ( tSettings, m_sLastError ); if ( !pTokenizer ) return false; // dictionary stuff CSphDictSettings tDictSettings; LoadDictionarySettings ( rdInfo, tDictSettings, m_uVersion, sWarning ); if ( m_bId32to64 ) tDictSettings.m_bCrc32 = true; if ( bStripPath ) { StripPath ( tDictSettings.m_sStopwords ); StripPath ( tDictSettings.m_sWordforms ); } CSphDict * pDict = tDictSettings.m_bWordDict ? sphCreateDictionaryKeywords ( tDictSettings, pTokenizer, m_sLastError, m_sIndexName.cstr() ) : sphCreateDictionaryCRC ( tDictSettings, pTokenizer, m_sLastError, m_sIndexName.cstr() ); if ( !pDict ) return false; SetDictionary ( pDict ); ISphTokenizer * pTokenFilter = ISphTokenizer::CreateTokenFilter ( pTokenizer, pDict->GetMultiWordforms () ); SetTokenizer ( pTokenFilter ? pTokenFilter : pTokenizer ); } else { if ( m_bId32to64 ) { m_sLastError.SetSprintf ( "too old id32 index; can not be loaded by this id64 binary" ); return false; } } if ( m_uVersion>=10 ) m_iKillListSize = rdInfo.GetDword (); if ( m_uVersion>=20 ) m_uMinMaxIndex = rdInfo.GetDword (); if ( rdInfo.GetErrorFlag() ) m_sLastError.SetSprintf ( "%s: failed to parse header (unexpected eof)", sHeaderName ); return !rdInfo.GetErrorFlag(); } void CSphIndex_VLN::DebugDumpHeader ( FILE * fp, const char * sHeaderName, bool bConfig ) { CSphString sWarning; if ( !LoadHeader ( sHeaderName, false, sWarning ) ) { fprintf ( fp, "FATAL: failed to load header: %s.\n", m_sLastError.cstr() ); return; } if ( !sWarning.IsEmpty () ) fprintf ( fp, "WARNING: %s\n", sWarning.cstr () ); /////////////////////////////////////////////// // print header in index config section format /////////////////////////////////////////////// if ( bConfig ) { fprintf ( fp, "\nsource $dump\n{\n" ); fprintf ( fp, "\tsql_query = SELECT id \\\n" ); ARRAY_FOREACH ( i, m_tSchema.m_dFields ) fprintf ( fp, "\t, %s \\\n", m_tSchema.m_dFields[i].m_sName.cstr() ); for ( int i=0; iGetSettings (); fprintf ( fp, "\tcharset_type = %s\n", tSettings.m_iType==TOKENIZER_SBCS ? "sbcs" : "utf-8" ); fprintf ( fp, "\tcharset_table = %s\n", tSettings.m_sCaseFolding.cstr () ); if ( tSettings.m_iMinWordLen>1 ) fprintf ( fp, "\tmin_word_len = %d\n", tSettings.m_iMinWordLen ); if ( tSettings.m_iNgramLen && !tSettings.m_sNgramChars.IsEmpty() ) fprintf ( fp, "\tngram_len = %d\nngram_chars = %s\n", tSettings.m_iNgramLen, tSettings.m_sNgramChars.cstr () ); if ( !tSettings.m_sSynonymsFile.IsEmpty() ) fprintf ( fp, "\texceptions = %s\n", tSettings.m_sSynonymsFile.cstr () ); if ( !tSettings.m_sBoundary.IsEmpty() ) fprintf ( fp, "\tphrase_boundary = %s\n", tSettings.m_sBoundary.cstr () ); if ( !tSettings.m_sIgnoreChars.IsEmpty() ) fprintf ( fp, "\tignore_chars = %s\n", tSettings.m_sIgnoreChars.cstr () ); if ( !tSettings.m_sBlendChars.IsEmpty() ) fprintf ( fp, "\tblend_chars = %s\n", tSettings.m_sBlendChars.cstr () ); if ( !tSettings.m_sBlendMode.IsEmpty() ) fprintf ( fp, "\tblend_mode = %s\n", tSettings.m_sBlendMode.cstr () ); } if ( m_pDict ) { const CSphDictSettings & tSettings = m_pDict->GetSettings (); if ( tSettings.m_bWordDict ) fprintf ( fp, "\tdict = keywords\n" ); if ( !tSettings.m_sMorphology.IsEmpty() ) fprintf ( fp, "\tmorphology = %s\n", tSettings.m_sMorphology.cstr () ); if ( !tSettings.m_sStopwords.IsEmpty() ) fprintf ( fp, "\tstopwords = %s\n", tSettings.m_sStopwords.cstr () ); if ( !tSettings.m_sWordforms.IsEmpty() ) fprintf ( fp, "\twordforms: %s\n", tSettings.m_sWordforms.cstr () ); if ( tSettings.m_iMinStemmingLen>1 ) fprintf ( fp, "\tmin_stemming_len = %d\n", tSettings.m_iMinStemmingLen ); } fprintf ( fp, "}\n" ); return; } /////////////////////////////////////////////// // print header and stats in "readable" format /////////////////////////////////////////////// fprintf ( fp, "version: %d\n", m_uVersion ); fprintf ( fp, "idbits: %d\n", m_bUse64 ? 64 : 32 ); fprintf ( fp, "docinfo: " ); switch ( m_tSettings.m_eDocinfo ) { case SPH_DOCINFO_NONE: fprintf ( fp, "none\n" ); break; case SPH_DOCINFO_INLINE: fprintf ( fp, "inline\n" ); break; case SPH_DOCINFO_EXTERN: fprintf ( fp, "extern\n" ); break; default: fprintf ( fp, "unknown (value=%d)\n", m_tSettings.m_eDocinfo ); break; } fprintf ( fp, "fields: %d\n", m_tSchema.m_dFields.GetLength() ); ARRAY_FOREACH ( i, m_tSchema.m_dFields ) fprintf ( fp, " field %d: %s\n", i, m_tSchema.m_dFields[i].m_sName.cstr() ); fprintf ( fp, "attrs: %d\n", m_tSchema.GetAttrsCount() ); for ( int i=0; iGetSettings (); fprintf ( fp, "tokenizer-type: %d\n", tSettings.m_iType ); fprintf ( fp, "tokenizer-case-folding: %s\n", tSettings.m_sCaseFolding.cstr () ); fprintf ( fp, "tokenizer-min-word-len: %d\n", tSettings.m_iMinWordLen ); fprintf ( fp, "tokenizer-ngram-chars: %s\n", tSettings.m_sNgramChars.cstr () ); fprintf ( fp, "tokenizer-ngram-len: %d\n", tSettings.m_iNgramLen ); fprintf ( fp, "tokenizer-exceptions: %s\n", tSettings.m_sSynonymsFile.cstr () ); fprintf ( fp, "tokenizer-phrase-boundary: %s\n", tSettings.m_sBoundary.cstr () ); fprintf ( fp, "tokenizer-ignore-chars: %s\n", tSettings.m_sIgnoreChars.cstr () ); fprintf ( fp, "tokenizer-blend-chars: %s\n", tSettings.m_sBlendChars.cstr () ); fprintf ( fp, "tokenizer-blend-mode: %s\n", tSettings.m_sBlendMode.cstr () ); } if ( m_pDict ) { const CSphDictSettings & tSettings = m_pDict->GetSettings (); fprintf ( fp, "dictionary-morphology: %s\n", tSettings.m_sMorphology.cstr () ); fprintf ( fp, "dictionary-stopwords: %s\n", tSettings.m_sStopwords.cstr () ); fprintf ( fp, "dictionary-wordforms: %s\n", tSettings.m_sWordforms.cstr () ); fprintf ( fp, "min-stemming-len: %d\n", tSettings.m_iMinStemmingLen ); } fprintf ( fp, "killlist-size: %d\n", m_iKillListSize ); } void CSphIndex_VLN::DebugDumpDocids ( FILE * fp ) { if ( m_tSettings.m_eDocinfo!=SPH_DOCINFO_EXTERN ) { fprintf ( fp, "FATAL: docids dump only supported for docinfo=extern\n" ); return; } const int iRowStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); const DWORD uNumMinMaxRow = ( m_uVersion>=20 ) ? ( 2*(1+m_uDocinfoIndex)*iRowStride ) : 0; const int64_t uNumRows = (m_pDocinfo.GetNumEntries()-uNumMinMaxRow) / iRowStride; // all 32bit, as we don't expect 2 billion documents per single physical index const uint64_t uDocinfoSize = iRowStride*size_t(m_uDocinfo)*sizeof(DWORD); const uint64_t uMinmaxSize = uNumMinMaxRow*sizeof(CSphRowitem); fprintf ( fp, "docinfo-bytes: docinfo="UINT64_FMT", min-max="UINT64_FMT", total="UINT64_FMT"\n" , uDocinfoSize, uMinmaxSize, (uint64_t)m_pDocinfo.GetLength() ); fprintf ( fp, "docinfo-stride: %d\n", (int)(iRowStride*sizeof(DWORD)) ); fprintf ( fp, "docinfo-rows: "INT64_FMT"\n", uNumRows ); if ( !m_pDocinfo.GetNumEntries() ) return; DWORD * pDocinfo = m_pDocinfo.GetWritePtr(); for ( DWORD uRow=0; uRow ( fp, sKeyword, bID ) ); } template < class Qword > void CSphIndex_VLN::DumpHitlist ( FILE * fp, const char * sKeyword, bool bID ) { // get keyword id SphWordID_t uWordID = 0; BYTE * sTok = NULL; if ( !bID ) { CSphString sBuf ( sKeyword ); m_pTokenizer->SetBuffer ( (BYTE*)sBuf.cstr(), strlen ( sBuf.cstr() ) ); sTok = m_pTokenizer->GetToken(); if ( !sTok ) sphDie ( "keyword=%s, no token (too short?)", sKeyword ); uWordID = m_pDict->GetWordID ( sTok ); if ( !uWordID ) sphDie ( "keyword=%s, tok=%s, no wordid (stopped?)", sKeyword, sTok ); fprintf ( fp, "keyword=%s, tok=%s, wordid="UINT64_FMT"\n", sKeyword, sTok, uint64_t(uWordID) ); } else { uWordID = (SphWordID_t) strtoull ( sKeyword, NULL, 10 ); if ( !uWordID ) sphDie ( "failed to convert keyword=%s to id (must be integer)", sKeyword ); fprintf ( fp, "wordid="UINT64_FMT"\n", uint64_t(uWordID) ); } // open files CSphAutofile tDoclist, tHitlist, tWordlist; if ( tDoclist.Open ( GetIndexFileName("spd"), SPH_O_READ, m_sLastError ) < 0 ) sphDie ( "failed to open doclist: %s", m_sLastError.cstr() ); if ( tHitlist.Open ( GetIndexFileName ( m_uVersion>=3 ? "spp" : "spd" ), SPH_O_READ, m_sLastError ) < 0 ) sphDie ( "failed to open hitlist: %s", m_sLastError.cstr() ); if ( tWordlist.Open ( GetIndexFileName ( "spi" ), SPH_O_READ, m_sLastError ) < 0 ) sphDie ( "failed to open wordlist: %s", m_sLastError.cstr() ); // aim DiskIndexQwordSetup_c tTermSetup ( tDoclist, tHitlist, tWordlist, m_bPreloadWordlist ? 0 : m_tWordlist.m_iMaxChunk ); tTermSetup.m_pDict = m_pDict; tTermSetup.m_pIndex = this; tTermSetup.m_eDocinfo = m_tSettings.m_eDocinfo; tTermSetup.m_tMin.Clone ( *m_pMin, m_tSchema.GetRowSize() ); tTermSetup.m_bSetupReaders = true; Qword tKeyword ( false, false ); tKeyword.m_tDoc.m_iDocID = m_pMin->m_iDocID; tKeyword.m_iWordID = uWordID; tKeyword.m_sWord = sKeyword; tKeyword.m_sDictWord = (const char *)sTok; if ( !tTermSetup.QwordSetup ( &tKeyword ) ) sphDie ( "failed to setup keyword" ); int iSize = m_tSchema.GetRowSize(); CSphVector dAttrs ( iSize ); // press play on tape for ( ;; ) { tKeyword.GetNextDoc ( iSize ? &dAttrs[0] : NULL ); if ( !tKeyword.m_tDoc.m_iDocID ) break; tKeyword.SeekHitlist ( tKeyword.m_iHitlistPos ); int iHits = 0; if ( tKeyword.m_bHasHitlist ) for ( Hitpos_t uHit = tKeyword.GetNextHit(); uHit!=EMPTY_HIT; uHit = tKeyword.GetNextHit() ) { fprintf ( fp, "doc="DOCID_FMT", hit=0x%08x\n", tKeyword.m_tDoc.m_iDocID, uHit ); // FIXME? iHits++; } if ( !iHits ) { uint64_t uOff = tKeyword.m_iHitlistPos; fprintf ( fp, "doc="DOCID_FMT", NO HITS, inline=%d, off="UINT64_FMT"\n", tKeyword.m_tDoc.m_iDocID, (int)(uOff>>63), (uOff<<1)>>1 ); } } } bool CSphIndex_VLN::Prealloc ( bool bMlock, bool bStripPath, CSphString & sWarning ) { MEMORY ( SPH_MEM_IDX_DISK ); // reset Dealloc (); // always keep shared variables flag if ( m_dShared.IsEmpty() ) { if ( !m_dShared.Alloc ( SPH_SHARED_VARS_COUNT, m_sLastError, sWarning ) ) return false; } memset ( m_dShared.GetWritePtr(), 0, m_dShared.GetLength() ); m_pPreread = m_dShared.GetWritePtr()+0; m_pAttrsStatus = m_dShared.GetWritePtr()+1; // set new locking flag m_pDocinfo.SetMlock ( bMlock ); m_tWordlist.m_pBuf.SetMlock ( bMlock ); m_pMva.SetMlock ( bMlock ); m_pStrings.SetMlock ( bMlock ); m_pKillList.SetMlock ( bMlock ); // preload schema if ( !LoadHeader ( GetIndexFileName("sph").cstr(), bStripPath, sWarning ) ) return false; // verify that data files are readable if ( !sphIsReadable ( GetIndexFileName("spd").cstr(), &m_sLastError ) ) return false; if ( m_uVersion>=3 && !sphIsReadable ( GetIndexFileName("spp").cstr(), &m_sLastError ) ) return false; ///////////////////// // prealloc wordlist ///////////////////// // try to open wordlist file in all cases CSphAutofile tWordlist ( GetIndexFileName("spi"), SPH_O_READ, m_sLastError ); if ( tWordlist.GetFD()<0 ) return false; m_tWordlist.m_iSize = tWordlist.GetSize ( 1, true, m_sLastError ); if ( m_tWordlist.m_iSize<0 ) return false; m_bIsEmpty = ( m_tWordlist.m_iSize<=1 ); if ( m_bIsEmpty!=( m_tWordlist.m_dCheckpoints.GetLength()==0 ) ) sphWarning ( "wordlist size mismatch (size="INT64_FMT", checkpoints=%d)", m_tWordlist.m_iSize, m_tWordlist.m_dCheckpoints.GetLength() ); // make sure checkpoints are loadable // pre-11 indices use different offset type (this is fixed up later during the loading) assert ( m_tWordlist.m_iCheckpointsPos>0 ); // prealloc wordlist only !!! no need to load checkpoints here to if ( m_bPreloadWordlist ) if ( !m_tWordlist.m_pBuf.Alloc ( m_tWordlist.m_iCheckpointsPos, m_sLastError, sWarning ) ) return false; // preopen if ( m_bKeepFilesOpen ) { if ( m_tDoclistFile.Open ( GetIndexFileName("spd"), SPH_O_READ, m_sLastError ) < 0 ) return false; if ( m_tHitlistFile.Open ( GetIndexFileName ( m_uVersion>=3 ? "spp" : "spd" ), SPH_O_READ, m_sLastError ) < 0 ) return false; if ( !m_bPreloadWordlist && m_tWordlist.m_tFile.Open ( GetIndexFileName("spi"), SPH_O_READ, m_sLastError ) < 0 ) return false; } ///////////////////// // prealloc docinfos ///////////////////// if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && !m_bIsEmpty ) { ///////////// // attr data ///////////// int iStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); int iStride2 = iStride-1; // id64 - 1 DWORD = id32 int iEntrySize = sizeof(DWORD)*iStride; CSphAutofile tDocinfo ( GetIndexFileName("spa"), SPH_O_READ, m_sLastError ); if ( tDocinfo.GetFD()<0 ) return false; DWORD iDocinfoSize = DWORD ( tDocinfo.GetSize ( iEntrySize, true, m_sLastError ) / sizeof(DWORD) ); if ( iDocinfoSize<0 ) return false; DWORD iRealDocinfoSize = m_uMinMaxIndex ? m_uMinMaxIndex : iDocinfoSize; // intentionally losing data; we don't support more than 4B documents per instance yet m_uDocinfo = (DWORD)( iRealDocinfoSize / iStride ); if ( iRealDocinfoSize!=m_uDocinfo*iStride && !m_bId32to64 ) { m_sLastError.SetSprintf ( "docinfo size check mismatch (4B document limit hit?)" ); return false; } if ( m_bId32to64 ) { // check also the case of id32 here, and correct m_uDocinfo for it m_uDocinfo = (DWORD)( iRealDocinfoSize / iStride2 ); if ( iRealDocinfoSize!=m_uDocinfo*iStride2 ) { m_sLastError.SetSprintf ( "docinfo size check mismatch (4B document limit hit?)" ); return false; } m_uMinMaxIndex = m_uMinMaxIndex / iStride2 * iStride; } if ( m_uVersion < 20 ) { if ( m_bId32to64 ) iDocinfoSize = iDocinfoSize / iStride2 * iStride; m_uDocinfoIndex = ( m_uDocinfo+DOCINFO_INDEX_FREQ-1 ) / DOCINFO_INDEX_FREQ; // prealloc docinfo if ( !m_pDocinfo.Alloc ( iDocinfoSize + 2*(1+m_uDocinfoIndex)*iStride + ( m_bId32to64 ? m_uDocinfo : 0 ), m_sLastError, sWarning ) ) return false; m_pDocinfoIndex = m_pDocinfo.GetWritePtr()+iDocinfoSize; } else { if ( iDocinfoSize < iRealDocinfoSize ) { m_sLastError.SetSprintf ( "precomputed chunk size check mismatch" ); return false; } m_uDocinfoIndex = ( ( iDocinfoSize - iRealDocinfoSize ) / (m_bId32to64?iStride2:iStride) / 2 ) - 1; // prealloc docinfo if ( !m_pDocinfo.Alloc ( iDocinfoSize + ( m_bId32to64 ? ( 2 + m_uDocinfo + 2*m_uDocinfoIndex ) : 0 ), m_sLastError, sWarning ) ) return false; #if PARANOID DWORD uDocinfoIndex = ( m_uDocinfo+DOCINFO_INDEX_FREQ-1 ) / DOCINFO_INDEX_FREQ; assert ( uDocinfoIndex==m_uDocinfoIndex ); #endif m_pDocinfoIndex = m_pDocinfo.GetWritePtr()+m_uMinMaxIndex; } // prealloc docinfo hash but only if docinfo is big enough (in other words if hash is 8x+ less in size) if ( m_pDocinfoHash.IsEmpty() && m_pDocinfo.GetLength() > ( 32 << DOCINFO_HASH_BITS ) ) if ( !m_pDocinfoHash.Alloc ( ( 1 << DOCINFO_HASH_BITS )+4, m_sLastError, sWarning ) ) return false; //////////// // MVA data //////////// if ( m_uVersion>=4 ) { // if index is v4, .spm must always exist, even though length could be 0 CSphAutofile fdMva ( GetIndexFileName("spm"), SPH_O_READ, m_sLastError ); if ( fdMva.GetFD()<0 ) return false; SphOffset_t iMvaSize = fdMva.GetSize ( 0, true, m_sLastError ); if ( iMvaSize<0 ) return false; // prealloc if ( iMvaSize>0 ) if ( !m_pMva.Alloc ( DWORD(iMvaSize/sizeof(DWORD)), m_sLastError, sWarning ) ) return false; } /////////////// // string data /////////////// if ( m_uVersion>=17 ) { CSphAutofile fdStrings ( GetIndexFileName("sps"), SPH_O_READ, m_sLastError ); if ( fdStrings.GetFD()<0 ) return false; SphOffset_t iStringsSize = fdStrings.GetSize ( 0, true, m_sLastError ); if ( iStringsSize<0 ) return false; // prealloc if ( iStringsSize>0 ) if ( !m_pStrings.Alloc ( DWORD(iStringsSize), m_sLastError, sWarning ) ) return false; } } else if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && m_bIsEmpty ) { CSphAutofile tDocinfo ( GetIndexFileName("spa"), SPH_O_READ, m_sLastError ); if ( tDocinfo.GetFD()>0 ) { SphOffset_t iDocinfoSize = tDocinfo.GetSize ( 0, false, m_sLastError ); if ( iDocinfoSize ) sphWarning ( "IsEmpty != attribute size ("INT64_FMT")", iDocinfoSize ); } } // prealloc killlist if ( m_uVersion>=10 ) { CSphAutofile fdKillList ( GetIndexFileName("spk"), SPH_O_READ, m_sLastError ); if ( fdKillList.GetFD()<0 ) return false; SphOffset_t iSize = fdKillList.GetSize ( 0, true, m_sLastError ); if ( iSize<0 ) return false; if ( iSize!=(SphOffset_t)( m_iKillListSize*sizeof(SphAttr_t) ) ) { m_sLastError.SetSprintf ( "header k-list size does not match .spk size (klist=" INT64_FMT ", spk=" INT64_FMT ")", (int64_t)( m_iKillListSize*sizeof(SphAttr_t) ), (int64_t) iSize ); return false; } // prealloc if ( iSize>0 && !m_pKillList.Alloc ( m_iKillListSize, m_sLastError, sWarning ) ) return false; } bool bWordDict = false; if ( m_pDict ) bWordDict = m_pDict->GetSettings().m_bWordDict; // preload checkpoints (must be done here as they are not shared) if ( !m_tWordlist.ReadCP ( tWordlist, m_uVersion, bWordDict, m_sLastError ) ) { m_sLastError.SetSprintf ( "failed to read %s: %s", GetIndexFileName("spi").cstr(), m_sLastError.cstr () ); return false; } // all done m_bPreallocated = true; m_iIndexTag = ++m_iIndexTagSeq; return true; } template < typename T > bool CSphIndex_VLN::PrereadSharedBuffer ( CSphSharedBuffer & pBuffer, const char * sExt, size_t uExpected, DWORD uOffset ) { if ( !pBuffer.GetLength() ) return true; CSphAutofile fdBuf ( GetIndexFileName(sExt), SPH_O_READ, m_sLastError ); if ( fdBuf.GetFD()<0 ) return false; fdBuf.SetProgressCallback ( m_pProgress, &m_tProgress ); if ( uExpected==0 ) uExpected = size_t ( pBuffer.GetLength() ) - uOffset*sizeof(T); return fdBuf.Read ( pBuffer.GetWritePtr() + uOffset, uExpected, m_sLastError ); } bool CSphIndex_VLN::Preread () { MEMORY ( SPH_MEM_IDX_DISK ); sphLogDebug ( "CSphIndex_VLN::Preread invoked" ); if ( !m_bPreallocated ) { m_sLastError = "INTERNAL ERROR: not preallocated"; return false; } if ( !m_pPreread || *m_pPreread ) { m_sLastError = "INTERNAL ERROR: already preread"; return false; } /////////////////// // read everything /////////////////// m_tProgress.m_ePhase = CSphIndexProgress::PHASE_PREREAD; m_tProgress.m_iBytes = 0; m_tProgress.m_iBytesTotal = m_pDocinfo.GetLength() + m_pMva.GetLength() + m_pStrings.GetLength() + m_pKillList.GetLength(); if ( m_bPreloadWordlist ) m_tProgress.m_iBytesTotal += m_tWordlist.m_pBuf.GetLength(); sphLogDebug ( "Prereading .spa" ); if ( !PrereadSharedBuffer ( m_pDocinfo, "spa", ( m_uVersion<20 )? m_uDocinfo * ( ( m_bId32to64 ? 1 : DOCINFO_IDSIZE ) + m_tSchema.GetRowSize() ) * sizeof(DWORD) : 0 , m_bId32to64 ? ( 2 + m_uDocinfo + 2 * m_uDocinfoIndex ) : 0 ) ) return false; sphLogDebug ( "Prereading .spm" ); if ( !PrereadSharedBuffer ( m_pMva, "spm" ) ) return false; sphLogDebug ( "Prereading .sps" ); if ( !PrereadSharedBuffer ( m_pStrings, "sps" ) ) return false; sphLogDebug ( "Prereading .spk" ); if ( !PrereadSharedBuffer ( m_pKillList, "spk" ) ) return false; #if PARANOID for ( int i = 1; i < (int)m_iKillListSize; i++ ) assert ( m_pKillList[i-1] < m_pKillList[i] ); #endif // preload wordlist // FIXME! OPTIMIZE! can skip checkpoints if ( m_bPreloadWordlist ) { sphLogDebug ( "Prereading .spi" ); if ( !PrereadSharedBuffer ( m_tWordlist.m_pBuf, "spi" ) ) return false; } if ( m_pProgress ) m_pProgress ( &m_tProgress, true ); sphLogDebug ( "Prereading .mvp" ); if ( !LoadPersistentMVA ( m_sLastError ) ) return false; ////////////////////// // precalc everything ////////////////////// // convert id32 to id64 if ( m_pDocinfo.GetLength() && m_bId32to64 ) { DWORD *pTarget = m_pDocinfo.GetWritePtr(); DWORD *pSource = pTarget + 2 + m_uDocinfo + 2 * m_uDocinfoIndex; int iStride = m_tSchema.GetRowSize(); SphDocID_t uDoc; DWORD uLimit = m_uDocinfo + ( ( m_uVersion < 20 ) ? 0 : 2 + 2 * m_uDocinfoIndex ); for ( DWORD u=0; u=( 1 << DOCINFO_HASH_BITS ) ) { iShift++; uRange >>= 1; } DWORD * pHash = m_pDocinfoHash.GetWritePtr(); *pHash++ = iShift; *pHash = 0; DWORD uLastHash = 0; for ( DWORD i=1; iuFirst && DOCINFO2ID ( &m_pDocinfo[(i-1)*iStride] ) < DOCINFO2ID ( &m_pDocinfo[i*iStride] ) && "descending document ID found" ); DWORD uHash = (DWORD)( ( DOCINFO2ID ( &m_pDocinfo[i*iStride] ) - uFirst ) >> iShift ); if ( uHash==uLastHash ) continue; while ( uLastHash dMvaRowitem; for ( int i=0; i=0 ) { ::close ( m_iLockFD ); ::unlink ( GetIndexFileName("spl").cstr() ); sphLogDebug ( "lock %s unlinked, file with ID %d closed", GetIndexFileName("spl").cstr(), m_iLockFD ); m_iLockFD = -1; } continue; } #endif snprintf ( sFrom, sizeof(sFrom), "%s.%s", m_sFilename.cstr(), sExt ); snprintf ( sTo, sizeof(sTo), "%s.%s", sNewBase, sExt ); #if USE_WINDOWS ::unlink ( sTo ); sphLogDebug ( "%s unlinked", sTo ); #endif if ( ::rename ( sFrom, sTo ) ) { m_sLastError.SetSprintf ( "rename %s to %s failed: %s", sFrom, sTo, strerror(errno) ); // this is no reason to fail if spl is missing, since it is only lock and no data. if ( strcmp ( sExt, "spl" ) ) break; } uMask |= ( 1UL << iExt ); } // are we good? if ( iExt==EXT_COUNT ) { SetBase ( sNewBase ); sphLogDebug ( "Base set to %s", sNewBase ); return true; } // if there were errors, rollback for ( iExt=0; iExtm_dFieldWeights.GetLength() ) { ARRAY_FOREACH ( i, pQuery->m_dFieldWeights ) { int j = tSchema.GetFieldIndex ( pQuery->m_dFieldWeights[i].m_sName.cstr() ); if ( j>=0 && jm_dFieldWeights[i].m_iValue ) * iIndexWeight; } return; } // order-bound weights if ( pQuery->m_pWeights ) { for ( int i=0; im_iWeights ); i++ ) m_dWeights[i] = Max ( MIN_WEIGHT, (int)pQuery->m_pWeights[i] ) * iIndexWeight; } } bool CSphQueryContext::SetupCalc ( CSphQueryResult * pResult, const CSphSchema & tInSchema, const CSphSchema & tSchema, const DWORD * pMvaPool ) { m_dCalcFilter.Resize ( 0 ); m_dCalcSort.Resize ( 0 ); m_dCalcFinal.Resize ( 0 ); // quickly verify that all my real attributes can be stashed there if ( tInSchema.GetAttrsCount() < tSchema.GetAttrsCount() ) { pResult->m_sError.SetSprintf ( "INTERNAL ERROR: incoming-schema mismatch (incount=%d, mycount=%d)", tInSchema.GetAttrsCount(), tSchema.GetAttrsCount() ); return false; } // now match everyone for ( int iIn=0; iInm_sError.SetSprintf ( "INTERNAL ERROR: incoming-schema attr missing from index-schema (in=%s)", sphDumpAttr(tIn).cstr() ); return false; } if ( tIn.m_eStage==SPH_EVAL_OVERRIDE ) { // override; check for type/size match and dynamic part if ( tIn.m_eAttrType!=pMy->m_eAttrType || tIn.m_tLocator.m_iBitCount!=pMy->m_tLocator.m_iBitCount || !tIn.m_tLocator.m_bDynamic ) { pResult->m_sError.SetSprintf ( "INTERNAL ERROR: incoming-schema override mismatch (in=%s, my=%s)", sphDumpAttr(tIn).cstr(), sphDumpAttr(*pMy).cstr() ); return false; } } else { // static; check for full match if (!( tIn==*pMy )) { pResult->m_sError.SetSprintf ( "INTERNAL ERROR: incoming-schema mismatch (in=%s, my=%s)", sphDumpAttr(tIn).cstr(), sphDumpAttr(*pMy).cstr() ); return false; } } break; } case SPH_EVAL_PREFILTER: case SPH_EVAL_PRESORT: case SPH_EVAL_FINAL: { ISphExpr * pExpr = tIn.m_pExpr.Ptr(); if ( !pExpr ) pExpr = sphSortSetupExpr ( tIn.m_sName, tSchema ); if ( !pExpr ) { pResult->m_sError.SetSprintf ( "INTERNAL ERROR: incoming-schema expression missing evaluator (stage=%d, in=%s)", (int)tIn.m_eStage, sphDumpAttr(tIn).cstr() ); return false; } // an expression that index/searcher should compute CalcItem_t tCalc; tCalc.m_eType = tIn.m_eAttrType; tCalc.m_tLoc = tIn.m_tLocator; tCalc.m_pExpr = pExpr; tCalc.m_pExpr->SetMVAPool ( pMvaPool ); switch ( tIn.m_eStage ) { case SPH_EVAL_PREFILTER: m_dCalcFilter.Add ( tCalc ); break; case SPH_EVAL_PRESORT: m_dCalcSort.Add ( tCalc ); break; case SPH_EVAL_FINAL: m_dCalcFinal.Add ( tCalc ); break; default: break; } break; } case SPH_EVAL_SORTER: // sorter tells it will compute itself; so just skip it break; default: pResult->m_sError.SetSprintf ( "INTERNAL ERROR: unhandled eval stage=%d", (int)tIn.m_eStage ); return false; } } // ok, we can emit matches in this schema (incoming for sorter, outgoing for index/searcher) pResult->m_tSchema = tInSchema; return true; } CSphDict * CSphIndex_VLN::SetupStarDict ( CSphScopedPtr & tContainer, CSphDict * pPrevDict, ISphTokenizer & tTokenizer ) const { // setup proper dict bool bUseStarDict = false; if ( ( m_uVersion>=7 && ( m_tSettings.m_iMinPrefixLen>0 || m_tSettings.m_iMinInfixLen>0 ) && m_bEnableStar ) || // v.7 added mangling to infixes ( m_uVersion==6 && ( m_tSettings.m_iMinPrefixLen>0 ) && m_bEnableStar ) ) // v.6 added mangling to prefixes { bUseStarDict = true; } // no star? just return the original one if ( !bUseStarDict ) return pPrevDict; // spawn wrapper, and put it in the box // wrapper type depends on version; v.8 introduced new mangling rules if ( m_uVersion>=8 ) tContainer = new CSphDictStarV8 ( pPrevDict, m_tSettings.m_iMinPrefixLen>0, m_tSettings.m_iMinInfixLen>0 ); else tContainer = new CSphDictStar ( pPrevDict ); CSphRemapRange tStar ( '*', '*', '*' ); // FIXME? check and warn if star was already there tTokenizer.AddCaseFolding ( tStar ); return tContainer.Ptr(); } CSphDict * CSphIndex_VLN::SetupExactDict ( CSphScopedPtr & tContainer, CSphDict * pPrevDict, ISphTokenizer & tTokenizer ) const { if ( m_uVersion<12 || !m_tSettings.m_bIndexExactWords ) return pPrevDict; tContainer = new CSphDictExact ( pPrevDict ); CSphRemapRange tStar ( '=', '=', '=' ); // FIXME? check and warn if star was already there tTokenizer.AddCaseFolding ( tStar ); return tContainer.Ptr(); } void CSphIndex_VLN::LoadSettings ( CSphReader & tReader ) { if ( m_uVersion>=8 ) { m_tSettings.m_iMinPrefixLen = tReader.GetDword (); m_tSettings.m_iMinInfixLen = tReader.GetDword (); } else if ( m_uVersion>=6 ) { bool bPrefixesOnly = ( tReader.GetByte ()!=0 ); m_tSettings.m_iMinPrefixLen = tReader.GetDword (); m_tSettings.m_iMinInfixLen = 0; if ( !bPrefixesOnly ) Swap ( m_tSettings.m_iMinPrefixLen, m_tSettings.m_iMinInfixLen ); } if ( m_uVersion>=9 ) { m_tSettings.m_bHtmlStrip = !!tReader.GetByte (); m_tSettings.m_sHtmlIndexAttrs = tReader.GetString (); m_tSettings.m_sHtmlRemoveElements = tReader.GetString (); } else m_bStripperInited = false; if ( m_uVersion>=12 ) m_tSettings.m_bIndexExactWords = !!tReader.GetByte (); if ( m_uVersion>=18 ) m_tSettings.m_eHitless = (ESphHitless)tReader.GetDword(); if ( m_uVersion>=19 ) m_tSettings.m_eHitFormat = (ESphHitFormat)tReader.GetDword(); else // force plain format for old indices m_tSettings.m_eHitFormat = SPH_HIT_FORMAT_PLAIN; if ( m_uVersion>=21 ) m_tSettings.m_bIndexSP = !!tReader.GetByte(); if ( m_uVersion>=22 ) { m_tSettings.m_sZones = tReader.GetString(); if ( m_uVersion<25 && !m_tSettings.m_sZones.IsEmpty() ) m_tSettings.m_sZones.SetSprintf ( "%s*", m_tSettings.m_sZones.cstr() ); } if ( m_uVersion>=23 ) { m_tSettings.m_iBoundaryStep = (int)tReader.GetDword(); m_tSettings.m_iStopwordStep = (int)tReader.GetDword(); } } void CSphIndex_VLN::SaveSettings ( CSphWriter & tWriter ) { tWriter.PutDword ( m_tSettings.m_iMinPrefixLen ); tWriter.PutDword ( m_tSettings.m_iMinInfixLen ); tWriter.PutByte ( m_tSettings.m_bHtmlStrip ? 1 : 0 ); tWriter.PutString ( m_tSettings.m_sHtmlIndexAttrs.cstr () ); tWriter.PutString ( m_tSettings.m_sHtmlRemoveElements.cstr () ); tWriter.PutByte ( m_tSettings.m_bIndexExactWords ? 1 : 0 ); tWriter.PutDword ( m_tSettings.m_eHitless ); tWriter.PutDword ( m_tSettings.m_eHitFormat ); tWriter.PutByte ( m_tSettings.m_bIndexSP ); tWriter.PutString ( m_tSettings.m_sZones ); tWriter.PutDword ( m_tSettings.m_iBoundaryStep ); tWriter.PutDword ( m_tSettings.m_iStopwordStep ); } bool CSphIndex_VLN::GetKeywords ( CSphVector & dKeywords, const char * szQuery, bool bGetStats, CSphString & sError ) const { WITH_QWORD ( this, false, Qword, return DoGetKeywords ( dKeywords, szQuery, bGetStats, sError ) ); return false; } template < class Qword > bool CSphIndex_VLN::DoGetKeywords ( CSphVector & dKeywords, const char * szQuery, bool bGetStats, CSphString & sError ) const { if ( !m_pPreread || !*m_pPreread ) { sError = "index not preread"; return false; } CSphScopedPtr pDoclist ( NULL ); CSphScopedPtr pHitlist ( NULL ); CSphScopedPtr pTokenizer ( m_pTokenizer->Clone ( false ) ); // avoid race pTokenizer->EnableTokenizedMultiformTracking (); CSphScopedPtr tDictCloned ( NULL ); CSphDict * pDictBase = m_pDict; if ( pDictBase->HasState() ) { tDictCloned = pDictBase = pDictBase->Clone(); } CSphScopedPtr tDict ( NULL ); CSphDict * pDict = SetupStarDict ( tDict, pDictBase, *pTokenizer.Ptr() ); CSphScopedPtr tDict2 ( NULL ); pDict = SetupExactDict ( tDict2, pDict, *pTokenizer.Ptr() ); // prepare for setup CSphAutofile tDummy1, tDummy2, tDummy3, tWordlist; if ( !m_bKeepFilesOpen ) if ( tWordlist.Open ( GetIndexFileName ( "spi" ), SPH_O_READ, sError ) < 0 ) return false; DiskIndexQwordSetup_c tTermSetup ( tDummy1, tDummy2 , m_bPreloadWordlist ? tDummy3 : ( m_bKeepFilesOpen ? m_tWordlist.m_tFile : tWordlist ) , m_bPreloadWordlist ? 0 : m_tWordlist.m_iMaxChunk ); tTermSetup.m_pDict = pDict; tTermSetup.m_pIndex = this; tTermSetup.m_eDocinfo = m_tSettings.m_eDocinfo; dKeywords.Resize ( 0 ); Qword QueryWord ( false, false ); CSphString sTokenized; BYTE * sWord; int nWords = 0; CSphString sQbuf ( szQuery ); pTokenizer->SetBuffer ( (BYTE*)sQbuf.cstr(), strlen(szQuery) ); while ( ( sWord = pTokenizer->GetToken() )!=NULL ) { BYTE * sMultiform = pTokenizer->GetTokenizedMultiform(); if ( sMultiform ) sTokenized = (const char*)sMultiform; else sTokenized = (const char*)sWord; SphWordID_t iWord = pDict->GetWordID ( sWord ); if ( iWord ) { if ( bGetStats ) { QueryWord.Reset (); QueryWord.m_sWord = (const char*)sWord; QueryWord.m_sDictWord = (const char*)sWord; QueryWord.m_iWordID = iWord; tTermSetup.QwordSetup ( &QueryWord ); } CSphKeywordInfo & tInfo = dKeywords.Add(); Swap ( tInfo.m_sTokenized, sTokenized ); tInfo.m_sNormalized = (const char*)sWord; tInfo.m_iDocs = bGetStats ? QueryWord.m_iDocs : 0; tInfo.m_iHits = bGetStats ? QueryWord.m_iHits : 0; ++nWords; } } return true; } // fix MSVC 2005 fuckup, template DoGetKeywords() just above somehow resets forScope #if USE_WINDOWS #pragma conform(forScope,on) #endif bool CSphQueryContext::CreateFilters ( bool bFullscan, const CSphVector * pdFilters, const CSphSchema & tSchema, const DWORD * pMvaPool, CSphString & sError ) { if ( !pdFilters ) return true; ARRAY_FOREACH ( i, (*pdFilters) ) { const CSphFilterSettings & tFilter = (*pdFilters)[i]; if ( tFilter.m_sAttrName.IsEmpty() ) continue; if ( bFullscan && tFilter.m_sAttrName=="@weight" ) continue; // @weight is not avaiable in fullscan mode ISphFilter * pFilter = sphCreateFilter ( tFilter, tSchema, pMvaPool, sError ); if ( !pFilter ) return false; ISphFilter ** pGroup = tFilter.m_sAttrName=="@weight" ? &m_pWeightFilter : &m_pFilter; *pGroup = sphJoinFilters ( *pGroup, pFilter ); } return true; } bool CSphQueryContext::SetupOverrides ( const CSphQuery * pQuery, CSphQueryResult * pResult, const CSphSchema & tIndexSchema ) { m_pOverrides = NULL; m_dOverrideIn.Resize ( pQuery->m_dOverrides.GetLength() ); m_dOverrideOut.Resize ( pQuery->m_dOverrides.GetLength() ); ARRAY_FOREACH ( i, pQuery->m_dOverrides ) { const char * sAttr = pQuery->m_dOverrides[i].m_sAttr.cstr(); // shortcut const CSphColumnInfo * pCol = tIndexSchema.GetAttr ( sAttr ); if ( !pCol ) { pResult->m_sError.SetSprintf ( "attribute override: unknown attribute name '%s'", sAttr ); return false; } if ( pCol->m_eAttrType!=pQuery->m_dOverrides[i].m_eAttrType ) { pResult->m_sError.SetSprintf ( "attribute override: attribute '%s' type mismatch (index=%d, query=%d)", sAttr, pCol->m_eAttrType, pQuery->m_dOverrides[i].m_eAttrType ); return false; } const CSphColumnInfo * pOutCol = pResult->m_tSchema.GetAttr ( pQuery->m_dOverrides[i].m_sAttr.cstr() ); if ( !pOutCol ) { pResult->m_sError.SetSprintf ( "attribute override: unknown attribute name '%s' in outgoing schema", sAttr ); return false; } m_dOverrideIn[i] = pCol->m_tLocator; m_dOverrideOut[i] = pOutCol->m_tLocator; #ifndef NDEBUG // check that the values are actually sorted const CSphVector & dValues = pQuery->m_dOverrides[i].m_dValues; for ( int j=1; jm_dOverrides.GetLength() ) m_pOverrides = &pQuery->m_dOverrides; return true; } static int sphQueryHeightCalc ( const XQNode_t * pNode ) { if ( !pNode->m_dChildren.GetLength() ) return pNode->m_dWords.GetLength(); if ( pNode->GetOp()==SPH_QUERY_BEFORE ) return 1; int iMaxChild = 0; int iHeight = 0; ARRAY_FOREACH ( i, pNode->m_dChildren ) { int iBottom = sphQueryHeightCalc ( pNode->m_dChildren[i] ); int iTop = pNode->m_dChildren.GetLength()-i-1; if ( iBottom+iTop>=iMaxChild+iHeight ) { iMaxChild = iBottom; iHeight = iTop; } } return iMaxChild+iHeight; } #define SPH_DAEMON_STACK_HEIGHT 30*1024 #define SPH_EXTNODE_STACK_SIZE 120 bool sphCheckQueryHeight ( const XQNode_t * pRoot, CSphString & sError ) { int iHeight = 0; if ( pRoot ) iHeight = sphQueryHeightCalc ( pRoot ); int iQueryStack = iHeight*SPH_EXTNODE_STACK_SIZE+SPH_DAEMON_STACK_HEIGHT; bool bValid = ( sphMyStackSize()>=iQueryStack ); if ( !bValid ) sError.SetSprintf ( "query too complex, not enough stack (thread_stack_size=%dK or higher required)", ( ( iQueryStack+1024-( iQueryStack%1024 ) ) / 1024 ) ); return bValid; } static XQNode_t * CloneKeyword ( const XQNode_t * pNode ) { assert ( pNode ); XQNode_t * pRes = new XQNode_t; pRes->m_bFieldSpec = pNode->m_bFieldSpec; pRes->m_dFieldMask = pNode->m_dFieldMask; pRes->m_iFieldMaxPos = pNode->m_iFieldMaxPos; pRes->m_dWords = pNode->m_dWords; return pRes; } static XQNode_t * ExpandKeyword ( XQNode_t * pNode, const CSphIndexSettings & tSettings ) { XQNode_t * pExpand = new XQNode_t; pExpand->SetOp ( SPH_QUERY_OR, pNode ); if ( tSettings.m_iMinInfixLen>0 ) { assert ( pNode->m_dChildren.GetLength()==0 ); assert ( pNode->m_dWords.GetLength()==1 ); XQNode_t * pInfix = CloneKeyword ( pNode ); pInfix->m_dWords[0].m_sWord.SetSprintf ( "*%s*", pNode->m_dWords[0].m_sWord.cstr() ); pInfix->m_dWords[0].m_uStarPosition = STAR_BOTH; pExpand->m_dChildren.Add ( pInfix ); } if ( tSettings.m_bIndexExactWords ) { assert ( pNode->m_dChildren.GetLength()==0 ); assert ( pNode->m_dWords.GetLength()==1 ); XQNode_t * pExact = CloneKeyword ( pNode ); pExact->m_dWords[0].m_sWord.SetSprintf ( "=%s", pNode->m_dWords[0].m_sWord.cstr() ); pExpand->m_dChildren.Add ( pExact ); } return pExpand; } static XQNode_t * ExpandKeywords ( XQNode_t * pNode, const CSphIndexSettings & tSettings ) { // only if expansion makes sense at all if ( tSettings.m_iMinInfixLen<=0 && !tSettings.m_bIndexExactWords ) return pNode; // process children for composite nodes if ( pNode->m_dChildren.GetLength() ) { ARRAY_FOREACH ( i, pNode->m_dChildren ) pNode->m_dChildren[i] = ExpandKeywords ( pNode->m_dChildren[i], tSettings ); return pNode; } // if that's a phrase/proximity node, create a very special, magic phrase/proximity node if ( pNode->GetOp()==SPH_QUERY_PHRASE || pNode->GetOp()==SPH_QUERY_PROXIMITY || pNode->GetOp()==SPH_QUERY_QUORUM ) { assert ( pNode->m_dWords.GetLength()>1 ); ARRAY_FOREACH ( i, pNode->m_dWords ) { XQNode_t * pWord = new XQNode_t; pWord->m_dWords.Add ( pNode->m_dWords[i] ); pNode->m_dChildren.Add ( ExpandKeyword ( pWord, tSettings ) ); pNode->m_dChildren.Last()->m_iAtomPos = pNode->m_dWords[i].m_iAtomPos; } pNode->m_dWords.Reset(); pNode->m_bVirtuallyPlain = true; return pNode; } // skip empty plain nodes if ( pNode->m_dWords.GetLength()<=0 ) return pNode; // process keywords for plain nodes assert ( pNode->m_dWords.GetLength()==1 ); XQKeyword_t & tKeyword = pNode->m_dWords[0]; if ( tKeyword.m_uStarPosition!=STAR_NONE || tKeyword.m_sWord.Begins("=") || tKeyword.m_sWord.Begins("*") || tKeyword.m_sWord.Ends("*") ) { return pNode; } // do the expansion return ExpandKeyword ( pNode, tSettings ); } // transform the "one two three"/1 quorum into one|two|three (~40% faster) static void TransformQuorum ( XQNode_t ** ppNode ) { XQNode_t *& pNode = *ppNode; if ( pNode->GetOp()!=SPH_QUERY_QUORUM || pNode->m_iOpArg!=1 ) return; assert ( pNode->m_dChildren.GetLength()==0 ); CSphVector dArgs; ARRAY_FOREACH ( i, pNode->m_dWords ) { XQNode_t * pAnd = new XQNode_t(); pAnd->m_dWords.Add ( pNode->m_dWords[i] ); dArgs.Add ( pAnd ); } pNode->m_dWords.Reset(); pNode->SetOp ( SPH_QUERY_OR, dArgs ); } struct BinaryNode_t { int m_iLo; int m_iHi; }; static void BuildExpandedTree ( const XQKeyword_t & tRootWord, CSphVector & dWordSrc, XQNode_t * pRoot ) { assert ( dWordSrc.GetLength() ); pRoot->m_dWords.Reset(); CSphVector dNodes; dNodes.Reserve ( dWordSrc.GetLength() ); XQNode_t * pCur = pRoot; dNodes.Add(); dNodes.Last().m_iLo = 0; dNodes.Last().m_iHi = ( dWordSrc.GetLength()-1 ); while ( dNodes.GetLength() ) { BinaryNode_t tNode = dNodes.Pop(); if ( tNode.m_iHim_pParent; continue; } int iMid = ( tNode.m_iLo+tNode.m_iHi ) / 2; dNodes.Add (); dNodes.Last().m_iLo = tNode.m_iLo; dNodes.Last().m_iHi = iMid-1; dNodes.Add (); dNodes.Last().m_iLo = iMid+1; dNodes.Last().m_iHi = tNode.m_iHi; if ( pCur->m_dWords.GetLength() ) { assert ( pCur->m_dWords.GetLength()==1 ); XQNode_t * pTerm = CloneKeyword ( pRoot ); Swap ( pTerm->m_dWords, pCur->m_dWords ); pCur->m_dChildren.Add ( pTerm ); } XQNode_t * pChild = CloneKeyword ( pRoot ); pChild->m_dWords.Add ( tRootWord ); pChild->m_dWords.Last().m_sWord.Swap ( dWordSrc[iMid].m_sName ); pChild->m_dWords.Last().m_bExpanded = true; pChild->m_bNotWeighted = ( dWordSrc[iMid].m_iValue==0 ); pChild->m_pParent = pCur; pCur->m_dChildren.Add ( pChild ); pCur->SetOp ( SPH_QUERY_OR ); pCur = pChild; } } void Swap ( CSphNamedInt & a, CSphNamedInt & b ) { a.m_sName.Swap ( b.m_sName ); Swap ( a.m_iValue, b.m_iValue ); } struct WordDocsGreaterOp_t { inline bool IsLess ( const CSphNamedInt & a, const CSphNamedInt & b ) { return a.m_iValue > b.m_iValue; } }; XQNode_t * CSphIndex_VLN::DoExpansion ( XQNode_t * pNode, BYTE * pBuff, int iFD, CSphQueryResultMeta * pResult ) const { assert ( pNode ); assert ( pResult ); // process children for composite nodes if ( pNode->m_dChildren.GetLength() ) { ARRAY_FOREACH ( i, pNode->m_dChildren ) pNode->m_dChildren[i] = DoExpansion ( pNode->m_dChildren[i], pBuff, iFD, pResult ); return pNode; } // if that's a phrase/proximity node, create a very special, magic phrase/proximity node if ( pNode->GetOp()==SPH_QUERY_PHRASE || pNode->GetOp()==SPH_QUERY_PROXIMITY || pNode->GetOp()==SPH_QUERY_QUORUM ) { assert ( pNode->m_dWords.GetLength()>1 ); ARRAY_FOREACH ( i, pNode->m_dWords ) { XQNode_t * pWord = new XQNode_t; pWord->m_dWords.Add ( pNode->m_dWords[i] ); pNode->m_dChildren.Add ( DoExpansion ( pWord, pBuff, iFD, pResult ) ); pNode->m_dChildren.Last()->m_iAtomPos = pNode->m_dWords[i].m_iAtomPos; // tricky part // current node may have field/zone limits attached // normally those get pushed down during query parsing // but here we create nodes manually and have to push down limits too pWord->CopySpecs ( pNode ); } pNode->m_dWords.Reset(); pNode->m_bVirtuallyPlain = true; return pNode; } // skip empty plain nodes if ( pNode->m_dWords.GetLength()<=0 ) return pNode; // process keywords for plain nodes assert ( pNode->m_dChildren.GetLength()==0 ); assert ( pNode->m_dWords.GetLength()==1 ); if ( ( m_bEnableStar && !pNode->m_dWords[0].m_sWord.Ends("*") ) ) return pNode; const CSphString & sFullWord = pNode->m_dWords[0].m_sWord; const char * sAdjustedWord = sFullWord.cstr(); int iWordLen = sFullWord.Length(); if ( m_bEnableStar ) iWordLen = Max ( iWordLen-1, 0 ); // leading special symbols trimming if ( sFullWord.Begins("=") || sFullWord.Begins("*") ) { sAdjustedWord++; iWordLen = Max ( iWordLen-1, 0 ); } // we refuse to search query less then min-prefix-len if ( iWordLenHasMorphology(); // prefix expansion looking only into non stemmed words CSphString sFixed; if ( bMorphEnabled ) { sFixed = pNode->m_dWords[0].m_sWord.SubString ( sAdjustedWord-sFullWord.cstr(), iWordLen ); sFixed.SetSprintf ( "%c%s", MAGIC_WORD_HEAD_NONSTEMMED, sFixed.cstr() ); sAdjustedWord = sFixed.cstr(); iWordLen++; } CSphVector dPrefixedWords; m_tWordlist.GetPrefixedWords ( sAdjustedWord, iWordLen, dPrefixedWords, pBuff, iFD ); if ( !dPrefixedWords.GetLength() ) { // mark source word as expanded to prevent warning on terms mismatch in statistics pNode->m_dWords.Begin()->m_bExpanded = true; return pNode; } // sort word's to leftmost max documents, rightmost least documents dPrefixedWords.Sort ( WordDocsGreaterOp_t() ); // clip words with the lowest doc frequency as rare words are misspelling if ( m_iExpansionLimit && m_iExpansionLimitAddStat ( dPrefixedWords[i].m_sName, 0, 0, true ); } // replace MAGIC_WORD_HEAD_NONSTEMMED symbol to '=' if ( bMorphEnabled ) { ARRAY_FOREACH ( i, dPrefixedWords ) { ( (char *)dPrefixedWords[i].m_sName.cstr() )[0] = '='; } } const XQKeyword_t tPrefixingWord = pNode->m_dWords[0]; BuildExpandedTree ( tPrefixingWord, dPrefixedWords, pNode ); return pNode; } XQNode_t * CSphIndex_VLN::ExpandPrefix ( XQNode_t * pNode, CSphString & sError, CSphQueryResultMeta * pResult ) const { if ( !pNode || !( m_pDict->GetSettings().m_bWordDict && m_tSettings.m_iMinPrefixLen>0 ) ) return pNode; // thread safe outer storage for dictionaries chunks and file BYTE * pBuf = NULL; int iFD = -1; CSphAutofile rdWordlist; if ( !m_bPreloadWordlist ) { if ( m_bKeepFilesOpen ) iFD = m_tWordlist.m_tFile.GetFD(); else { iFD = rdWordlist.Open ( GetIndexFileName ( "spi" ), SPH_O_READ, sError ); if ( iFD<0 ) return NULL; } if ( m_tWordlist.m_iMaxChunk>0 ) pBuf = new BYTE [ m_tWordlist.m_iMaxChunk ]; } assert ( m_pPreread && *m_pPreread ); assert ( !m_bPreloadWordlist || !m_tWordlist.m_pBuf.IsEmpty() ); pNode = DoExpansion ( pNode, pBuf, iFD, pResult ); SafeDeleteArray ( pBuf ); return pNode; } // transform the (A B) NEAR C into A NEAR B NEAR C static void TransformNear ( XQNode_t ** ppNode ) { XQNode_t *& pNode = *ppNode; if ( pNode->GetOp()==SPH_QUERY_NEAR ) { assert ( pNode->m_dWords.GetLength()==0 ); CSphVector dArgs; int iStartFrom; // transform all (A B C) NEAR D into A NEAR B NEAR C NEAR D do { dArgs.Reset(); iStartFrom = 0; ARRAY_FOREACH ( i, pNode->m_dChildren ) { XQNode_t * pChild = pNode->m_dChildren[i]; ///< shortcut if ( pChild->GetOp()==SPH_QUERY_AND && pChild->m_dChildren.GetLength()>0 ) { ARRAY_FOREACH ( j, pChild->m_dChildren ) if ( j==0 && iStartFrom==0 ) { // we will remove the node anyway, so just replace it with 1-st child instead pNode->m_dChildren[i] = pChild->m_dChildren[j]; iStartFrom = i+1; } else dArgs.Add ( pChild->m_dChildren[j] ); pChild->m_dChildren.Reset(); SafeDelete ( pChild ); } else if ( iStartFrom!=0 ) dArgs.Add ( pChild ); } if ( iStartFrom!=0 ) { pNode->m_dChildren.Resize ( iStartFrom + dArgs.GetLength() ); ARRAY_FOREACH ( i, dArgs ) pNode->m_dChildren [ i + iStartFrom ] = dArgs[i]; } } while ( iStartFrom!=0 ); } ARRAY_FOREACH ( i, pNode->m_dChildren ) TransformNear ( &pNode->m_dChildren[i] ); } /// tag excluded keywords (rvals to operator NOT) static void TagExcluded ( XQNode_t * pNode, bool bNot ) { if ( pNode->GetOp()==SPH_QUERY_ANDNOT ) { assert ( pNode->m_dChildren.GetLength()==2 ); assert ( pNode->m_dWords.GetLength()==0 ); TagExcluded ( pNode->m_dChildren[0], bNot ); TagExcluded ( pNode->m_dChildren[1], !bNot ); } else if ( pNode->m_dChildren.GetLength() ) { // FIXME? check if this works okay with "virtually plain" stuff? ARRAY_FOREACH ( i, pNode->m_dChildren ) TagExcluded ( pNode->m_dChildren[i], bNot ); } else { // tricky bit // no assert on length here and that is intended // we have fully empty nodes (0 children, 0 words) sometimes! ARRAY_FOREACH ( i, pNode->m_dWords ) pNode->m_dWords[i].m_bExcluded = bNot; } } void sphTransformExtendedQuery ( XQNode_t ** ppNode ) { TransformQuorum ( ppNode ); TransformNear ( ppNode ); TagExcluded ( *ppNode, false ); } struct CmpPSortersByRandom_fn { inline bool IsLess ( const ISphMatchSorter * a, const ISphMatchSorter * b ) const { assert ( a ); assert ( b ); return a->m_bRandomize < b->m_bRandomize; } }; /// one regular query vs many sorters bool CSphIndex_VLN::MultiQuery ( const CSphQuery * pQuery, CSphQueryResult * pResult, int iSorters, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag ) const { assert ( pQuery ); MEMORY ( SPH_MEM_IDX_DISK_MULTY_QUERY ); // to avoid the checking of a ppSorters's element for NULL on every next step, just filter out all nulls right here CSphVector dSorters; dSorters.Reserve ( iSorters ); for ( int i=0; im_sQuery.IsEmpty() ) return MultiScan ( pQuery, pResult, iSorters, &dSorters[0], pExtraFilters, iTag ); CSphScopedPtr pTokenizer ( m_pTokenizer->Clone ( false ) ); CSphScopedPtr tDictCloned ( NULL ); CSphDict * pDictBase = m_pDict; if ( pDictBase->HasState() ) { tDictCloned = pDictBase = pDictBase->Clone(); } CSphScopedPtr tDict ( NULL ); CSphDict * pDict = SetupStarDict ( tDict, pDictBase, *pTokenizer.Ptr() ); CSphScopedPtr tDict2 ( NULL ); pDict = SetupExactDict ( tDict2, pDict, *pTokenizer.Ptr() ); // parse query XQQuery_t tParsed; if ( !sphParseExtendedQuery ( tParsed, pQuery->m_sQuery.cstr(), pTokenizer.Ptr(), &m_tSchema, pDict, m_tSettings.m_iStopwordStep ) ) { pResult->m_sError = tParsed.m_sParseError; return false; } // transform query if needed (quorum transform, keyword expansion, etc.) sphTransformExtendedQuery ( &tParsed.m_pRoot ); // expanding prefix in word dictionary case XQNode_t * pPrefixed = ExpandPrefix ( tParsed.m_pRoot, pResult->m_sError, pResult ); if ( !pPrefixed ) return false; tParsed.m_pRoot = pPrefixed; if ( m_bExpandKeywords ) tParsed.m_pRoot = ExpandKeywords ( tParsed.m_pRoot, m_tSettings ); if ( !sphCheckQueryHeight ( tParsed.m_pRoot, pResult->m_sError ) ) return false; // flag common subtrees int iCommonSubtrees = 0; if ( m_iMaxCachedDocs && m_iMaxCachedHits ) iCommonSubtrees = sphMarkCommonSubtrees ( 1, &tParsed ); CSphQueryNodeCache tNodeCache ( iCommonSubtrees, m_iMaxCachedDocs, m_iMaxCachedHits ); bool bResult = ParsedMultiQuery ( pQuery, pResult, iSorters, &dSorters[0], tParsed, pDict, pExtraFilters, &tNodeCache, iTag ); return bResult; } /// many regular queries with one sorter attached to each query. /// returns true if at least one query succeeded. The failed queries indicated with pResult->m_iMultiplier==-1 bool CSphIndex_VLN::MultiQueryEx ( int iQueries, const CSphQuery * pQueries, CSphQueryResult ** ppResults, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag ) const { // ensure we have multiple queries if ( iQueries==1 ) return MultiQuery ( pQueries, ppResults[0], 1, ppSorters, pExtraFilters, iTag ); MEMORY ( SPH_MEM_IDX_DISK_MULTY_QUERY_EX ); assert ( pQueries ); assert ( ppResults ); assert ( ppSorters ); ISphTokenizer * pTokenizer = m_pTokenizer->Clone ( false ); CSphScopedPtr tDictCloned ( NULL ); CSphDict * pDictBase = m_pDict; if ( pDictBase->HasState() ) { tDictCloned = pDictBase = pDictBase->Clone(); } CSphScopedPtr tDict ( NULL ); CSphDict * pDict = SetupStarDict ( tDict, pDictBase, *pTokenizer ); CSphScopedPtr tDict2 ( NULL ); pDict = SetupExactDict ( tDict2, pDict, *pTokenizer ); CSphFixedVector dXQ ( iQueries ); bool bResult = false; bool bResultScan = false; for ( int i=0; im_iMultiplier = -1; ///< show that this particular query failed continue; } // fast path for scans if ( pQueries[i].m_sQuery.IsEmpty() ) { if ( MultiScan ( pQueries + i, ppResults[i], 1, &ppSorters[i], pExtraFilters, iTag ) ) bResultScan = true; else ppResults[i]->m_iMultiplier = -1; ///< show that this particular query failed continue; } // parse query if ( sphParseExtendedQuery ( dXQ[i], pQueries[i].m_sQuery.cstr(), pTokenizer, &m_tSchema, pDict, m_tSettings.m_iStopwordStep ) ) { // transform query if needed (quorum transform, keyword expansion, etc.) sphTransformExtendedQuery ( &dXQ[i].m_pRoot ); // expanding prefix in word dictionary case XQNode_t * pPrefixed = ExpandPrefix ( dXQ[i].m_pRoot, ppResults[i]->m_sError, ppResults[i] ); if ( pPrefixed ) { dXQ[i].m_pRoot = pPrefixed; if ( m_bExpandKeywords ) dXQ[i].m_pRoot = ExpandKeywords ( dXQ[i].m_pRoot, m_tSettings ); if ( sphCheckQueryHeight ( dXQ[i].m_pRoot, ppResults[i]->m_sError ) ) { bResult = true; } else { ppResults[i]->m_iMultiplier = -1; SafeDelete ( dXQ[i].m_pRoot ); } } else { ppResults[i]->m_iMultiplier = -1; SafeDelete ( dXQ[i].m_pRoot ); } } else { ppResults[i]->m_sError = dXQ[i].m_sParseError; ppResults[i]->m_iMultiplier = -1; } } // continue only if we have at least one non-failed if ( bResult ) { int iCommonSubtrees = 0; if ( m_iMaxCachedDocs && m_iMaxCachedHits ) iCommonSubtrees = sphMarkCommonSubtrees ( iQueries, &dXQ[0] ); CSphQueryNodeCache tNodeCache ( iCommonSubtrees, m_iMaxCachedDocs, m_iMaxCachedHits ); bResult = false; for ( int j=0; jm_iMultiplier = iCommonSubtrees ? iQueries : 1; } else ppResults[j]->m_iMultiplier = -1; } SafeDelete ( pTokenizer ); return bResult | bResultScan; } bool CSphIndex_VLN::ParsedMultiQuery ( const CSphQuery * pQuery, CSphQueryResult * pResult, int iSorters, ISphMatchSorter ** ppSorters, const XQQuery_t & tXQ, CSphDict * pDict, const CSphVector * pExtraFilters, CSphQueryNodeCache * pNodeCache, int iTag ) const { assert ( pQuery ); assert ( pResult ); assert ( ppSorters ); assert ( !pQuery->m_sQuery.IsEmpty() && pQuery->m_eMode!=SPH_MATCH_FULLSCAN ); // scans must go through MultiScan() assert ( iTag>=0 ); // start counting int64_t tmQueryStart = sphMicroTimer(); /////////////////// // setup searching /////////////////// PROFILER_INIT (); PROFILE_BEGIN ( query_init ); // non-ready index, empty response! if ( !m_pPreread || !*m_pPreread ) { pResult->m_sError = "index not preread"; return false; } // select the sorter with max schema int iMaxSchemaSize = -1; int iMaxSchemaIndex = -1; for ( int i=0; iGetSchema().GetRowSize() > iMaxSchemaSize ) { iMaxSchemaSize = ppSorters[i]->GetSchema().GetRowSize(); iMaxSchemaIndex = i; } // setup calculations and result schema CSphQueryContext tCtx; if ( !tCtx.SetupCalc ( pResult, ppSorters[iMaxSchemaIndex]->GetSchema(), m_tSchema, GetMVAPool() ) ) return false; // set string pool for string on_sort expression fix up tCtx.SetStringPool ( m_pStrings.GetWritePtr() ); // open files CSphAutofile tDoclist, tHitlist, tWordlist, tDummy; if ( !m_bKeepFilesOpen ) { if ( tDoclist.Open ( GetIndexFileName("spd"), SPH_O_READ, pResult->m_sError ) < 0 ) return false; if ( tHitlist.Open ( GetIndexFileName ( m_uVersion>=3 ? "spp" : "spd" ), SPH_O_READ, pResult->m_sError ) < 0 ) return false; if ( tWordlist.Open ( GetIndexFileName ( "spi" ), SPH_O_READ, pResult->m_sError ) < 0 ) return false; } // setup search terms DiskIndexQwordSetup_c tTermSetup ( m_bKeepFilesOpen ? m_tDoclistFile : tDoclist, m_bKeepFilesOpen ? m_tHitlistFile : tHitlist, m_bPreloadWordlist ? tDummy : ( m_bKeepFilesOpen ? m_tWordlist.m_tFile : tWordlist ), m_bPreloadWordlist ? 0 : m_tWordlist.m_iMaxChunk ); tTermSetup.m_pDict = pDict; tTermSetup.m_pIndex = this; tTermSetup.m_eDocinfo = m_tSettings.m_eDocinfo; tTermSetup.m_tMin.m_iDocID = m_pMin->m_iDocID; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) { tTermSetup.m_tMin.Clone ( *m_pMin, m_tSchema.GetRowSize() ); tTermSetup.m_iInlineRowitems = m_tSchema.GetRowSize(); } tTermSetup.m_iDynamicRowitems = pResult->m_tSchema.GetDynamicSize(); if ( pQuery->m_uMaxQueryMsec>0 ) tTermSetup.m_iMaxTimer = sphMicroTimer() + pQuery->m_uMaxQueryMsec*1000; // max_query_time tTermSetup.m_pWarning = &pResult->m_sWarning; tTermSetup.m_bSetupReaders = true; tTermSetup.m_pCtx = &tCtx; tTermSetup.m_pNodeCache = pNodeCache; int iIndexWeight = pQuery->GetIndexWeight ( m_sIndexName.cstr() ); // bind weights tCtx.BindWeights ( pQuery, m_tSchema, iIndexWeight ); // setup query // must happen before index-level reject, in order to build proper keyword stats CSphScopedPtr pRanker ( sphCreateRanker ( tXQ, pQuery, pResult, tTermSetup, tCtx ) ); if ( !pRanker.Ptr() ) return false; // empty index, empty response! if ( m_bIsEmpty ) return true; assert ( m_tSettings.m_eDocinfo!=SPH_DOCINFO_EXTERN || !m_pDocinfo.IsEmpty() ); // check that docinfo is preloaded // setup filters if ( !tCtx.CreateFilters ( pQuery->m_sQuery.IsEmpty(), &pQuery->m_dFilters, pResult->m_tSchema, GetMVAPool(), pResult->m_sError ) ) return false; if ( !tCtx.CreateFilters ( pQuery->m_sQuery.IsEmpty(), pExtraFilters, pResult->m_tSchema, GetMVAPool(), pResult->m_sError ) ) return false; // check if we can early reject the whole index if ( tCtx.m_pFilter && m_uDocinfoIndex ) { DWORD uStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); DWORD * pMinEntry = const_cast ( &m_pDocinfoIndex [ 2*m_uDocinfoIndex*uStride ] ); DWORD * pMaxEntry = pMinEntry + uStride; if ( !tCtx.m_pFilter->EvalBlock ( pMinEntry, pMaxEntry ) ) return true; } // setup lookup tCtx.m_bLookupFilter = ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN ) && pQuery->m_dFilters.GetLength(); if ( tCtx.m_dCalcFilter.GetLength() || pQuery->m_eRanker==SPH_RANK_EXPR ) tCtx.m_bLookupFilter = true; // suboptimal in case of attr-independent expressions, but we don't care tCtx.m_bLookupSort = false; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && !tCtx.m_bLookupFilter ) for ( int iSorter=0; iSorterUsesAttrs() ) tCtx.m_bLookupSort = true; if ( tCtx.m_dCalcSort.GetLength() ) tCtx.m_bLookupSort = true; // suboptimal in case of attr-independent expressions, but we don't care // setup sorters vs. MVA for ( int i=0; iSetMVAPool ( m_pMva.GetWritePtr() ); (ppSorters[i])->SetStringPool ( m_pStrings.GetWritePtr() ); } // setup overrides if ( !tCtx.SetupOverrides ( pQuery, pResult, m_tSchema ) ) return false; PROFILE_END ( query_init ); ////////////////////////////////////// // find and weight matching documents ////////////////////////////////////// bool bFinalLookup = !tCtx.m_bLookupFilter && !tCtx.m_bLookupSort; bool bFinalPass = bFinalLookup || tCtx.m_dCalcFinal.GetLength(); int iMyTag = bFinalPass ? -1 : iTag; PROFILE_BEGIN ( query_match ); switch ( pQuery->m_eMode ) { case SPH_MATCH_ALL: case SPH_MATCH_PHRASE: case SPH_MATCH_ANY: case SPH_MATCH_EXTENDED: case SPH_MATCH_EXTENDED2: case SPH_MATCH_BOOLEAN: if ( !MatchExtended ( &tCtx, pQuery, iSorters, ppSorters, pRanker.Ptr(), iMyTag ) ) return false; break; default: sphDie ( "INTERNAL ERROR: unknown matching mode (mode=%d)", pQuery->m_eMode ); } PROFILE_END ( query_match ); //////////////////// // cook result sets //////////////////// // adjust result sets for ( int iSorter=0; iSorterGetLength() && bFinalPass ) { const int iCount = pTop->GetLength (); CSphMatch * const pHead = pTop->First(); CSphMatch * const pTail = pHead + iCount; for ( CSphMatch * pCur=pHead; pCurm_iTag<0 ) { if ( bFinalLookup ) CopyDocinfo ( &tCtx, *pCur, FindDocinfo ( pCur->m_iDocID ) ); tCtx.CalcFinal ( *pCur ); pCur->m_iTag = iTag; } } // mva and string pools ptrs pResult->m_pMva = m_pMva.GetWritePtr(); pResult->m_pStrings = m_pStrings.GetWritePtr(); } PROFILER_DONE (); PROFILE_SHOW (); // query timer pResult->m_iQueryTime += (int)( ( sphMicroTimer()-tmQueryStart )/1000 ); return true; } ////////////////////////////////////////////////////////////////////////// // INDEX CHECKING ////////////////////////////////////////////////////////////////////////// #define LOC_FAIL(_args) \ if ( ++iFails<=FAILS_THRESH ) \ { \ fprintf ( fp, "FAILED, " ); \ fprintf _args; \ fprintf ( fp, "\n" ); \ iFailsPrinted++; \ \ if ( iFails==FAILS_THRESH ) \ fprintf ( fp, "(threshold reached; suppressing further output)\n" ); \ } static int DictCmpStrictly ( const char * pStr1, int iLen1, const char * pStr2, int iLen2 ); int CSphIndex_VLN::DebugCheck ( FILE * fp ) { int64_t tmCheck = sphMicroTimer(); int iFails = 0; int iFailsPrinted = 0; const int FAILS_THRESH = 100; // check if index is ready if ( m_dShared.GetNumEntries()!=SPH_SHARED_VARS_COUNT || !m_pPreread || !*m_pPreread ) LOC_FAIL(( fp, "index not preread" )); bool bProgress = isatty ( fileno ( fp ) )!=0; ////////////// // open files ////////////// CSphString sError; CSphAutoreader rdDict, rdDocs, rdHits; if ( !rdDict.Open ( GetIndexFileName("spi"), sError ) ) LOC_FAIL(( fp, "unable to open dictionary: %s", sError.cstr() )); if ( !rdDocs.Open ( GetIndexFileName("spd"), sError ) ) LOC_FAIL(( fp, "unable to open doclist: %s", sError.cstr() )); if ( !rdHits.Open ( GetIndexFileName("spp"), sError ) ) LOC_FAIL(( fp, "unable to open hitlist: %s", sError.cstr() )); //////////////////// // check dictionary //////////////////// fprintf ( fp, "checking dictionary...\n" ); SphWordID_t uWordid = 0; int64_t iDoclistOffset = 0; int iWordsTotal = 0; char sWord[MAX_KEYWORD_BYTES], sLastWord[MAX_KEYWORD_BYTES]; memset ( sLastWord, 0, sizeof(sLastWord) ); const int iWordPerCP = m_uVersion>=21 ? WORDLIST_CHECKPOINT : 1024; const bool bWordDict = m_pDict->GetSettings().m_bWordDict; CSphVector dCheckpoints; if ( bWordDict && m_uVersion<21 ) LOC_FAIL(( fp, "dictionary needed index version not less then 21 (readed=%d)" , m_uVersion )); rdDict.SeekTo ( 1, READ_NO_SIZE_HINT ); for ( ; rdDict.GetPos()!=m_tWordlist.m_iCheckpointsPos && !m_bIsEmpty; ) { // sanity checks if ( rdDict.GetPos()>=m_tWordlist.m_iCheckpointsPos ) { LOC_FAIL(( fp, "reading past checkpoints" )); break; } // store current entry pos (for checkpointing later), read next delta const int64_t iDictPos = rdDict.GetPos(); const SphWordID_t iDeltaWord = bWordDict ? rdDict.GetByte() : rdDict.UnzipWordid(); // checkpoint encountered, handle it if ( !iDeltaWord ) { rdDict.UnzipOffset(); if ( ( iWordsTotal%iWordPerCP )!=0 && rdDict.GetPos()!=m_tWordlist.m_iCheckpointsPos ) LOC_FAIL(( fp, "unexpected checkpoint (pos="INT64_FMT", word=%d, words=%d, expected=%d)", iDictPos, iWordsTotal, ( iWordsTotal%iWordPerCP ), iWordPerCP )); uWordid = 0; iDoclistOffset = 0; continue; } SphWordID_t uNewWordid = 0; SphOffset_t iNewDoclistOffset = 0; int iDocs = 0; int iHits = 0; if ( bWordDict ) { // unpack next word // must be in sync with DictEnd()! BYTE uPack = (BYTE)iDeltaWord; int iMatch, iDelta; if ( uPack & 0x80 ) { iDelta = ( ( uPack>>4 ) & 7 ) + 1; iMatch = uPack & 15; } else { iDelta = uPack & 127; iMatch = rdDict.GetByte(); } const int iLastWordLen = strlen(sLastWord); if ( iMatch+iDelta>=(int)sizeof(sLastWord)-1 || iMatch>iLastWordLen ) { LOC_FAIL(( fp, "wrong word-delta (pos="INT64_FMT", word=%s, len=%d, begin=%d, delta=%d)", iDictPos, sLastWord, iLastWordLen, iMatch, iDelta )); rdDict.SkipBytes ( iDelta ); } else { rdDict.GetBytes ( sWord + iMatch, iDelta ); sWord [ iMatch+iDelta ] = '\0'; } iNewDoclistOffset = rdDict.UnzipOffset(); iDocs = rdDict.UnzipInt(); iHits = rdDict.UnzipInt(); int iHint = ( iDocs>=DOCLIST_HINT_THRESH ) ? rdDict.GetByte() : 0; iHint = DoclistHintUnpack ( iDocs, (BYTE)iHint ); const int iNewWordLen = strlen(sWord); if ( iNewWordLen==0 ) LOC_FAIL(( fp, "empty word in dictionary (pos="INT64_FMT")", iDictPos )); if ( iLastWordLen && iNewWordLen ) if ( DictCmpStrictly ( sWord, iNewWordLen, sLastWord, iLastWordLen )<=0 ) LOC_FAIL(( fp, "word order decreased (pos="INT64_FMT", word=%s, prev=%s)", iDictPos, sLastWord, sWord )); if ( iHint<0 ) LOC_FAIL(( fp, "invalid word hint (pos="INT64_FMT", word=%s, hint=%d)", iDictPos, sWord, iHint )); if ( iDocs<=0 || iHits<=0 || iHits>4 ) & 7 ) + 1; iMatch = uPack & 15; } else { iDelta = uPack & 127; iMatch = rdDict.GetByte(); } const int iLastWordLen = strlen(sLastWord); if ( iMatch+iDelta>=(int)sizeof(sLastWord)-1 || iMatch>iLastWordLen ) rdDict.SkipBytes ( iDelta ); else { rdDict.GetBytes ( sWord + iMatch, iDelta ); sWord [ iMatch+iDelta ] = '\0'; } iDoclistOffset = rdDict.UnzipOffset(); iDictDocs = rdDict.UnzipInt(); iDictHits = rdDict.UnzipInt(); int iHint = ( iDictDocs>=DOCLIST_HINT_THRESH ) ? rdDict.GetByte() : 0; iHint = DoclistHintUnpack ( iDictDocs, (BYTE)iHint ); } else { // finish reading the entire entry uWordid = uWordid + iDeltaWord; iDoclistOffset = iDoclistOffset + rdDict.UnzipOffset(); iDictDocs = rdDict.UnzipInt(); iDictHits = rdDict.UnzipInt(); } // check whether the offset is as expected if ( iDoclistOffset!=rdDocs.GetPos() ) { if ( !bWordDict ) LOC_FAIL(( fp, "unexpected doclist offset (wordid="UINT64_FMT"(%s)(%d), dictpos="INT64_FMT", doclistpos="INT64_FMT")", (uint64_t)uWordid, sWord, iWordsChecked, iDoclistOffset, (int64_t)rdDocs.GetPos() )); if ( iDoclistOffset>=iDocsSize ) { LOC_FAIL(( fp, "unexpected doclist offset, off the file (wordid="UINT64_FMT"(%s)(%d), dictpos="INT64_FMT", doclistsize="INT64_FMT")", (uint64_t)uWordid, sWord, iWordsChecked, iDoclistOffset, iDocsSize )); iWordsChecked++; continue; } else rdDocs.SeekTo ( iDoclistOffset, READ_NO_SIZE_HINT ); } // create and manually setup doclist reader DiskIndexQwordTraits_c * pQword = NULL; WITH_QWORD ( this, false, T, pQword = new T ( false, false ) ); pQword->m_tDoc.Reset ( m_tSchema.GetDynamicSize() ); pQword->m_iMinID = m_pMin->m_iDocID; pQword->m_tDoc.m_iDocID = m_pMin->m_iDocID; if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_INLINE ) { pQword->m_iInlineAttrs = m_tSchema.GetDynamicSize(); pQword->m_pInlineFixup = m_pMin->m_pDynamic; } else { pQword->m_iInlineAttrs = 0; pQword->m_pInlineFixup = NULL; } pQword->m_iDocs = 0; pQword->m_iHits = 0; pQword->m_rdDoclist.SetFile ( rdDocs.GetFD(), rdDocs.GetFilename().cstr() ); pQword->m_rdDoclist.SeekTo ( rdDocs.GetPos(), READ_NO_SIZE_HINT ); pQword->m_rdHitlist.SetFile ( rdHits.GetFD(), rdHits.GetFilename().cstr() ); pQword->m_rdHitlist.SeekTo ( rdHits.GetPos(), READ_NO_SIZE_HINT ); CSphRowitem * pInlineStorage = NULL; if ( pQword->m_iInlineAttrs ) pInlineStorage = new CSphRowitem [ pQword->m_iInlineAttrs ]; // loop the doclist SphDocID_t uLastDocid = 0; int iDoclistDocs = 0; int iDoclistHits = 0; int iHitlistHits = 0; for ( ;; ) { const CSphMatch & tDoc = pQword->GetNextDoc ( pInlineStorage ); if ( !tDoc.m_iDocID ) break; // checks! if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN ) { const CSphRowitem * pFound = FindDocinfo ( tDoc.m_iDocID ); if ( !pFound ) LOC_FAIL(( fp, "row not found (wordid="UINT64_FMT"(%s), docid="DOCID_FMT")", uint64_t(uWordid), sWord, tDoc.m_iDocID )); if ( pFound ) if ( tDoc.m_iDocID!=DOCINFO2ID(pFound) ) LOC_FAIL(( fp, "row found but id mismatches (wordid="UINT64_FMT"(%s), docid="DOCID_FMT", found="DOCID_FMT")", uint64_t(uWordid), sWord, tDoc.m_iDocID, DOCINFO2ID(pFound) )); } if ( tDoc.m_iDocID<=uLastDocid ) LOC_FAIL(( fp, "docid decreased (wordid="UINT64_FMT"(%s), docid="DOCID_FMT", lastid="DOCID_FMT")", uint64_t(uWordid), sWord, tDoc.m_iDocID, uLastDocid )); uLastDocid = tDoc.m_iDocID; iDoclistDocs++; iDoclistHits += pQword->m_uMatchHits; // check position in case of regular (not-inline) hit if (!( pQword->m_iHitlistPos>>63 )) { if ( !bWordDict && pQword->m_iHitlistPos!=pQword->m_rdHitlist.GetPos() ) LOC_FAIL(( fp, "unexpected hitlist offset (wordid="UINT64_FMT"(%s), docid="DOCID_FMT", expected="INT64_FMT", actual="INT64_FMT")", (uint64_t)uWordid, sWord, pQword->m_tDoc.m_iDocID, (int64_t)pQword->m_iHitlistPos, (int64_t)pQword->m_rdHitlist.GetPos() )); } // aim pQword->SeekHitlist ( pQword->m_iHitlistPos ); // loop the hitlist int iDocHits = 0; CSphSmallBitvec dFieldMask; dFieldMask.Unset(); Hitpos_t uLastHit = EMPTY_HIT; for ( ;; ) { Hitpos_t uHit = pQword->GetNextHit(); if ( uHit==EMPTY_HIT ) break; if (!( uLastHitm_tDoc.m_iDocID, uHit, uLastHit )); uLastHit = uHit; int iField = HITMAN::GetField ( uHit ); if ( iField<0 || iField>=SPH_MAX_FIELDS ) { LOC_FAIL(( fp, "hit field out of bounds (wordid="UINT64_FMT"(%s), docid="DOCID_FMT", field=%d)", (uint64_t)uWordid, sWord, pQword->m_tDoc.m_iDocID, iField )); } else if ( iField>=m_tSchema.m_dFields.GetLength() ) { LOC_FAIL(( fp, "hit field out of schema (wordid="UINT64_FMT"(%s), docid="DOCID_FMT", field=%d)", (uint64_t)uWordid, sWord, pQword->m_tDoc.m_iDocID, iField )); } dFieldMask.Set(iField); iDocHits++; // to check doclist entry iHitlistHits++; // to check dictionary entry } // check hit count if ( iDocHits!=(int)pQword->m_uMatchHits ) LOC_FAIL(( fp, "doc hit count mismatch (wordid="UINT64_FMT"(%s), docid="DOCID_FMT", doclist=%d, hitlist=%d)", (uint64_t)uWordid, sWord, pQword->m_tDoc.m_iDocID, pQword->m_uMatchHits, iDocHits )); // check the mask if ( dFieldMask!=pQword->m_dFields ) LOC_FAIL(( fp, "field mask mismatch (wordid="UINT64_FMT"(%s), docid="DOCID_FMT")", (uint64_t)uWordid, sWord, pQword->m_tDoc.m_iDocID )); // update my hitlist reader rdHits.SeekTo ( pQword->m_rdHitlist.GetPos(), READ_NO_SIZE_HINT ); } // do checks if ( iDictDocs!=iDoclistDocs ) LOC_FAIL(( fp, "doc count mismatch (wordid="UINT64_FMT"(%s), dict=%d, doclist=%d)", uint64_t(uWordid), sWord, iDictDocs, iDoclistDocs )); if ( iDictHits!=iDoclistHits || iDictHits!=iHitlistHits ) LOC_FAIL(( fp, "hit count mismatch (wordid="UINT64_FMT"(%s), dict=%d, doclist=%d, hitlist=%d)", uint64_t(uWordid), sWord, iDictHits, iDoclistHits, iHitlistHits )); // move my reader instance forward too rdDocs.SeekTo ( pQword->m_rdDoclist.GetPos(), READ_NO_SIZE_HINT ); // cleanup SafeDelete ( pInlineStorage ); SafeDelete ( pQword ); // progress bar if ( (++iWordsChecked)%1000==0 && bProgress ) { fprintf ( fp, "%d/%d\r", iWordsChecked, iWordsTotal ); fflush ( fp ); } } /////////////////////////// // check rows (attributes) /////////////////////////// if ( m_tSettings.m_eDocinfo==SPH_DOCINFO_EXTERN && !m_pDocinfo.IsEmpty() ) { fprintf ( fp, "checking rows...\n" ); // sizes and counts DWORD uRowsTotal = m_uDocinfo; DWORD uStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); DWORD uAllRowsTotal = uRowsTotal; uAllRowsTotal += 2*(1+m_uDocinfoIndex); // should had been fixed up to v.20 by the loader if ( uAllRowsTotal*uStride!=m_pDocinfo.GetNumEntries() ) LOC_FAIL(( fp, "rowitems count mismatch (expected=%u, loaded="INT64_FMT")", uAllRowsTotal*uStride, (int64_t)m_pDocinfo.GetNumEntries() )); // extract rowitem indexes for MVAs etc // (ie. attr types that we can and will run additional checks on) CSphVector dMvaItems; CSphVector dFloatItems; CSphVector dStrItems; for ( int i=0; i dStringOffsets; if ( m_pStrings.GetNumEntries()>1 ) { const BYTE * pBase = m_pStrings.GetWritePtr(); const BYTE * pCur = pBase + 1; const BYTE * pMax = pBase + m_pStrings.GetNumEntries(); while ( pCurpMax || pStrpCur+4 ) { LOC_FAIL(( fp, "string length out of bounds (offset=%u, len=%d)", (DWORD)(pCur-pBase), iLen )); break; } dStringOffsets.Add ( (DWORD)(pCur-pBase) ); pCur = pStr + iLen; } } // loop the rows const CSphRowitem * pRow = m_pDocinfo.GetWritePtr(); const DWORD * pMvaBase = m_pMva.GetWritePtr(); const DWORD * pMvaMax = pMvaBase + m_pMva.GetNumEntries(); const DWORD * pMva = pMvaBase; int iOrphan = 0; SphDocID_t uLastID = 0; for ( DWORD uRow=0; uRow=pMvaMax ) { bIsSpaValid = false; LOC_FAIL(( fp, "MVA index out of bounds (row=%u, mvaattr=%d, docid="DOCID_FMT", index=%u)", uRow, iItem, uLastID, uOffset )); } if ( uOffset && pMvaBase+uOffset=pMvaMax ) { LOC_FAIL(( fp, "MVA index out of bounds (row=%u, mvaattr=%d, docid expected="DOCID_FMT", got="DOCID_FMT", index=%u)", uRow, iItem, uLastID, uMvaID, (DWORD)(pMva-pMvaBase) )); bIsMvaCorrect = false; continue; } // check values DWORD uValues = *pMva++; if ( pMva+uValues-1>=pMvaMax ) { LOC_FAIL(( fp, "MVA count out of bounds (row=%u, mvaattr=%d, docid expected="DOCID_FMT", got="DOCID_FMT", count=%u)", uRow, iItem, uLastID, uMvaID, uValues )); pMva += uValues; bIsMvaCorrect = false; continue; } // check that values are ascending for ( DWORD uVal=(iItem>=iMva64 ? 2 : 1); uVal=iMva64 ) { uPrev = MVA_UPSIZE ( pMva+uVal-2 ); uCur = MVA_UPSIZE ( pMva+uVal ); uVal += 2; } else { uPrev = pMva[uVal-1]; uCur = pMva[uVal]; uVal++; } if ( uCur<=uPrev ) { LOC_FAIL(( fp, "unsorted MVA values (row=%u, mvaattr=%d, docid expected="DOCID_FMT", got="DOCID_FMT", val[%u]=%u, val[%u]=%u)", uRow, iItem, uLastID, uMvaID, ( iItem>=iMva64 ? uVal-2 : uVal-1 ), uPrev, uVal, uCur )); bIsMvaCorrect = false; } uVal += ( iItem>=iMva64 ? 2 : 1 ); } pMva += uValues; } if ( !bIsMvaCorrect ) break; // orphan only ON no errors && ( not matched ids || ids matched multiply times ) if ( bIsMvaCorrect && ( uMvaID!=uLastID || ( uMvaID==uLastID && bLastIDChecked ) ) ) iOrphan++; bLastIDChecked |= uLastID==uMvaID; } if ( !bLastIDChecked && bHasValues ) LOC_FAIL(( fp, "missed or damaged MVA (row=%u, docid expected="DOCID_FMT")", uRow, uLastID )); } /////////////////////////// // check floats /////////////////////////// ARRAY_FOREACH ( iItem, dFloatItems ) { const CSphRowitem * pAttrs = DOCINFO2ATTRS(pRow); const DWORD uValue = (DWORD)sphGetRowAttr ( pAttrs, dFloatItems[ iItem ] ); const DWORD uExp = ( uValue >> 23 ) & 0xff; const DWORD uMantissa = uValue & 0x003fffff; // check normalized if ( uExp==0 && uMantissa!=0 ) LOC_FAIL(( fp, "float attribute value is unnormalized (row=%u, attr=%d, id="DOCID_FMT", raw=0x%x, value=%f)", uRow, iItem, uLastID, uValue, sphDW2F ( uValue ) )); // check +-inf if ( uExp==0xff && uMantissa==0 ) LOC_FAIL(( fp, "float attribute is infinity (row=%u, attr=%d, id="DOCID_FMT", raw=0x%x, value=%f)", uRow, iItem, uLastID, uValue, sphDW2F ( uValue ) )); } ///////////////// // check strings ///////////////// ARRAY_FOREACH ( iItem, dStrItems ) { const CSphRowitem * pAttrs = DOCINFO2ATTRS(pRow); const DWORD uOffset = (DWORD)sphGetRowAttr ( pAttrs, dStrItems[ iItem ] ); if ( uOffset>=m_pStrings.GetNumEntries() ) { LOC_FAIL(( fp, "string offset out of bounds (row=%u, stringattr=%d, docid="DOCID_FMT", index=%u)", uRow, iItem, uLastID, uOffset )); continue; } if ( !uOffset ) continue; const BYTE * pStr = NULL; const int iLen = sphUnpackStr ( m_pStrings.GetWritePtr() + uOffset, &pStr ); // check that length is sane if ( pStr+iLen-1>=m_pStrings.GetWritePtr()+m_pStrings.GetLength() ) { LOC_FAIL(( fp, "string length out of bounds (row=%u, stringattr=%d, docid="DOCID_FMT", index=%u)", uRow, iItem, uLastID, (unsigned int)( pStr-m_pStrings.GetWritePtr()+iLen-1 ) )); continue; } // check that offset is one of the good ones // (that is, that we don't point in the middle of some other data) if ( !dStringOffsets.BinarySearch ( uOffset ) ) { LOC_FAIL(( fp, "string offset is not a string start (row=%u, stringattr=%d, docid="DOCID_FMT", offset=%u)", uRow, iItem, uLastID, uOffset )); } } // progress bar if ( uRow%1000==0 && bProgress ) { fprintf ( fp, "%d/%d\r", uRow, uRowsTotal ); fflush ( fp ); } } if ( iOrphan ) fprintf ( fp, "WARNING: %d orphaned MVA entries were found\n", iOrphan ); /////////////////////////// // check blocks index /////////////////////////// fprintf ( fp, "checking attribute blocks index...\n" ); // check size const DWORD uTempDocinfoIndex = ( m_uDocinfo+DOCINFO_INDEX_FREQ-1 ) / DOCINFO_INDEX_FREQ; if ( uTempDocinfoIndex!=m_uDocinfoIndex ) LOC_FAIL(( fp, "block count differs (expected=%d, got=%d)", uTempDocinfoIndex, m_uDocinfoIndex )); const DWORD uMinMaxStride = DOCINFO_IDSIZE + m_tSchema.GetRowSize(); const DWORD * pDocinfoIndexMax = m_pDocinfoIndex + 2*( 1+m_uDocinfoIndex )*uMinMaxStride; for ( DWORD uIndexEntry=0; uIndexEntry pDocinfoIndexMax ) LOC_FAIL(( fp, "unexpected block index end (row=%u, docid="DOCID_FMT", block=%d, max=%u, cur=%u)", uIndexEntry, uDocID, uBlock, (DWORD)(pDocinfoIndexMax-m_pDocinfoIndex), (DWORD)(pMaxEntry+uMinMaxStride-m_pDocinfoIndex) )); // check attribute location vs global range if ( pMaxAttrs+uMinMaxStride > pDocinfoIndexMax ) LOC_FAIL(( fp, "attribute position out of blocks index (row=%u, docid="DOCID_FMT", block=%u, expected<%u, got=%u)", uIndexEntry, uDocID, uBlock, (DWORD)(pDocinfoIndexMax-m_pDocinfoIndex), (DWORD)(pMaxAttrs+uMinMaxStride-m_pDocinfoIndex) )); const SphDocID_t uMinDocID = *(SphDocID_t*)pMinEntry; const SphDocID_t uMaxDocID = *(SphDocID_t*)pMaxEntry; // checks is docid min max range valid if ( uMinDocID > uMaxDocID && bIsBordersCheckTime ) LOC_FAIL(( fp, "invalid docid range (row=%u, block=%d, min="DOCID_FMT", max="DOCID_FMT")", uIndexEntry, uBlock, uMinDocID, uMaxDocID )); // checks docid vs blocks range if ( uDocID < uMinDocID || uDocID > uMaxDocID ) LOC_FAIL(( fp, "unexpected docid range (row=%u, docid="DOCID_FMT", block=%d, min="DOCID_FMT", max="DOCID_FMT")", uIndexEntry, uDocID, uBlock, uMinDocID, uMaxDocID )); bool bIsFirstMva = true; // check values vs blocks range const DWORD * pSpaRow = DOCINFO2ATTRS(pAttr); for ( int iItem=0; iItem uMax && bIsBordersCheckTime ) LOC_FAIL(( fp, "invalid attribute range (row=%u, block=%d, min="INT64_FMT", max="INT64_FMT")", uIndexEntry, uBlock, uMin, uMax )); if ( uVal < uMin || uVal > uMax ) LOC_FAIL(( fp, "unexpected attribute value (row=%u, attr=%u, docid="DOCID_FMT", block=%d, value=0x%x, min=0x%x, max=0x%x)", uIndexEntry, iItem, uDocID, uBlock, (DWORD)uVal, (DWORD)uMin, (DWORD)uMax )); } break; case SPH_ATTR_FLOAT: { const float fVal = sphDW2F ( (DWORD)sphGetRowAttr ( pSpaRow, tCol.m_tLocator ) ); const float fMin = sphDW2F ( (DWORD)sphGetRowAttr ( pMinAttrs, tCol.m_tLocator ) ); const float fMax = sphDW2F ( (DWORD)sphGetRowAttr ( pMaxAttrs, tCol.m_tLocator ) ); // checks is attribute min max range valid if ( fMin > fMax && bIsBordersCheckTime ) LOC_FAIL(( fp, "invalid attribute range (row=%u, block=%d, min=%f, max=%f)", uIndexEntry, uBlock, fMin, fMax )); if ( fVal < fMin || fVal > fMax ) LOC_FAIL(( fp, "unexpected attribute value (row=%u, attr=%u, docid="DOCID_FMT", block=%d, value=%f, min=%f, max=%f)", uIndexEntry, iItem, uDocID, uBlock, fVal, fMin, fMax )); } break; case SPH_ATTR_UINT32SET: { const DWORD uMin = (DWORD)sphGetRowAttr ( pMinAttrs, tCol.m_tLocator ); const DWORD uMax = (DWORD)sphGetRowAttr ( pMaxAttrs, tCol.m_tLocator ); // checks is MVA attribute min max range valid if ( uMin > uMax && bIsBordersCheckTime && uMin!=0xffffffff && uMax!=0 ) LOC_FAIL(( fp, "invalid MVA range (row=%u, block=%d, min=0x%x, max=0x%x)", uIndexEntry, uBlock, uMin, uMax )); SphAttr_t uOff = sphGetRowAttr ( pSpaRow, tCol.m_tLocator ); if ( !uOff ) break; const DWORD * pMva = m_pMva.GetWritePtr() + uOff; const DWORD * pMvaDocID = bIsFirstMva ? ( pMva - sizeof(SphDocID_t) / sizeof(DWORD) ) : NULL; bIsFirstMva = false; if ( uOff>=(SphAttr_t)m_pMva.GetNumEntries() ) break; if ( pMvaDocID && DOCINFO2ID ( pMvaDocID )!=uDocID ) { LOC_FAIL(( fp, "unexpected MVA docid (row=%u, mvaattr=%d, expected="DOCID_FMT", got="DOCID_FMT", block=%d, index=%u)", uIndexEntry, iItem, uDocID, DOCINFO2ID ( pMvaDocID ), uBlock, (DWORD)uOff )); break; } // check values const DWORD uValues = *pMva++; if ( uOff+uValues>(SphAttr_t)m_pMva.GetNumEntries() ) break; for ( DWORD iVal=0; iVal uMax ) LOC_FAIL(( fp, "unexpected MVA value (row=%u, attr=%u, docid="DOCID_FMT", block=%d, index=%u, value=0x%x, min=0x%x, max=0x%x)", uIndexEntry, iItem, uDocID, uBlock, iVal, (DWORD)uVal, (DWORD)uMin, (DWORD)uMax )); } } break; default: break; } } // progress bar if ( uIndexEntry%1000==0 && bProgress ) { fprintf ( fp, "%d/%d\r", uIndexEntry, m_uDocinfo ); fflush ( fp ); } } } /////////////////////////// // check kill-list /////////////////////////// fprintf ( fp, "checking kill-list...\n" ); // check size if ( m_pKillList.GetNumEntries()!=m_iKillListSize ) LOC_FAIL(( fp, "kill-list size differs (expected=%d, got="INT64_FMT")", m_iKillListSize, (int64_t)m_pKillList.GetNumEntries() )); // check that ids are ascending for ( DWORD uID=1; uID m_dNormalForms; CSphMultiformContainer * m_pMultiWordforms; CSphOrderedHash < int, CSphString, CSphStrHashFunc, 1048576, 117 > m_dHash; WordformContainer_t (); ~WordformContainer_t (); bool IsEqual ( const char * szFile, DWORD uCRC32 ); }; /// common CRC32/64 dictionary stuff struct CSphDictCRCTraits : CSphDict { CSphDictCRCTraits (); virtual ~CSphDictCRCTraits (); virtual void LoadStopwords ( const char * sFiles, ISphTokenizer * pTokenizer ); virtual bool LoadWordforms ( const char * szFile, ISphTokenizer * pTokenizer, const char * sIndex ); virtual bool SetMorphology ( const char * szMorph, bool bUseUTF8, CSphString & sError ); virtual bool HasMorphology() const; virtual void ApplyStemmers ( BYTE * pWord ); virtual void Setup ( const CSphDictSettings & tSettings ) { m_tSettings = tSettings; } virtual const CSphDictSettings & GetSettings () const { return m_tSettings; } virtual const CSphVector & GetStopwordsFileInfos () { return m_dSWFileInfos; } virtual const CSphSavedFile & GetWordformsFileInfo () { return m_tWFFileInfo; } virtual const CSphMultiformContainer * GetMultiWordforms () const { return m_pWordforms ? m_pWordforms->m_pMultiWordforms : NULL; } static void SweepWordformContainers ( const char * szFile, DWORD uCRC32 ); virtual void DictBegin ( int iTmpDictFD, int iDictFD, int iDictLimit ); virtual void DictEntry ( SphWordID_t uWordID, BYTE * sKeyword, int iDocs, int iHits, SphOffset_t iDoclistOffset, SphOffset_t iDoclistLength ); virtual void DictEndEntries ( SphOffset_t iDoclistOffset ); virtual bool DictEnd ( SphOffset_t * pCheckpointsPos, int * pCheckpointsCount, int iMemLimit, CSphString & sError ); virtual bool DictIsError () const { return m_wrDict.IsError(); } protected: CSphVector < int > m_dMorph; #if USE_LIBSTEMMER CSphVector < sb_stemmer * > m_dStemmers; struct DescStemmer_t { CSphString m_sAlgo; CSphString m_sEnc; }; CSphVector m_dDescStemmers; #endif int m_iStopwords; ///< stopwords count SphWordID_t * m_pStopwords; ///< stopwords ID list CSphFixedVector m_dStopwordContainer; protected: bool ToNormalForm ( BYTE * pWord ); bool ParseMorphology ( const char * szMorph, bool bUseUTF8, CSphString & sError ); SphWordID_t FilterStopword ( SphWordID_t uID ) const; ///< filter ID against stopwords list CSphDict * CloneBase ( CSphDictCRCTraits * pDict ) const; virtual bool HasState () const; CSphWriter m_wrDict; ///< final dict file writer CSphTightVector m_dCheckpoints; ///< checkpoint offsets int m_iEntries; ///< dictionary entries stored SphOffset_t m_iLastDoclistPos; SphWordID_t m_iLastWordID; private: WordformContainer_t * m_pWordforms; CSphVector m_dSWFileInfos; CSphSavedFile m_tWFFileInfo; CSphDictSettings m_tSettings; static CSphVector m_dWordformContainers; static WordformContainer_t * GetWordformContainer ( const char * szFile, DWORD uCRC32, const ISphTokenizer * pTokenizer, const char * sIndex ); static WordformContainer_t * LoadWordformContainer ( const char * szFile, DWORD uCRC32, const ISphTokenizer * pTokenizer, const char * sIndex ); bool InitMorph ( const char * szMorph, int iLength, bool bUseUTF8, CSphString & sError ); bool AddMorph ( int iMorph ); bool StemById ( BYTE * pWord, int iStemmer ); }; CSphVector < WordformContainer_t * > CSphDictCRCTraits::m_dWordformContainers; /// specialized CRC32/64 implementations template < bool CRC32DICT > struct CSphDictCRC : public CSphDictCRCTraits { inline SphWordID_t DoCrc ( const BYTE * pWord ) const; inline SphWordID_t DoCrc ( const BYTE * pWord, int iLen ) const; virtual SphWordID_t GetWordID ( BYTE * pWord ); virtual SphWordID_t GetWordID ( const BYTE * pWord, int iLen, bool bFilterStops ); virtual SphWordID_t GetWordIDWithMarkers ( BYTE * pWord ); virtual SphWordID_t GetWordIDNonStemmed ( BYTE * pWord ); virtual bool IsStopWord ( const BYTE * pWord ) const; virtual CSphDict * Clone () const { return CloneBase ( new CSphDictCRC() ); } }; ///////////////////////////////////////////////////////////////////////////// DWORD g_dSphinxCRC32 [ 256 ] = { 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f, 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988, 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7, 0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172, 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59, 0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924, 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106, 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433, 0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e, 0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65, 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0, 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f, 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a, 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1, 0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc, 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b, 0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236, 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d, 0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38, 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777, 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2, 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9, 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693, 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94, 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d, }; DWORD sphCRC32 ( const BYTE * pString ) { // calc CRC DWORD crc = ~((DWORD)0); for ( const BYTE * p=pString; *p; p++ ) crc = (crc >> 8) ^ g_dSphinxCRC32 [ (crc ^ (*p)) & 0xff ]; return ~crc; } DWORD sphCRC32 ( const BYTE * pString, int iLen ) { // calc CRC DWORD crc = ~((DWORD)0); for ( int i=0; i> 8) ^ g_dSphinxCRC32 [ (crc ^ pString[i]) & 0xff ]; return ~crc; } DWORD sphCRC32 ( const BYTE * pString, int iLen, DWORD uPrevCRC ) { // calc CRC DWORD crc = ~((DWORD)uPrevCRC); for ( int i=0; i> 8) ^ g_dSphinxCRC32 [ (crc ^ pString[i]) & 0xff ]; return ~crc; } ///////////////////////////////////////////////////////////////////////////// uint64_t sphFNV64 ( const BYTE * s ) { uint64_t hval = 0xcbf29ce484222325ULL; while ( *s ) { // xor the bottom with the current octet hval ^= (uint64_t)*s++; // multiply by the 64 bit FNV magic prime mod 2^64 hval += (hval << 1) + (hval << 4) + (hval << 5) + (hval << 7) + (hval << 8) + (hval << 40); // gcc optimization } return hval; } uint64_t sphFNV64 ( const BYTE * s, int iLen, uint64_t uPrev ) { uint64_t hval = uPrev; for ( ; iLen>0; iLen-- ) { // xor the bottom with the current octet hval ^= (uint64_t)*s++; // multiply by the 64 bit FNV magic prime mod 2^64 hval += (hval << 1) + (hval << 4) + (hval << 5) + (hval << 7) + (hval << 8) + (hval << 40); // gcc optimization } return hval; } ///////////////////////////////////////////////////////////////////////////// bool sphCalcFileCRC32 ( const char * szFilename, DWORD & uCRC32 ) { uCRC32 = 0; if ( !szFilename ) return false; FILE * pFile = fopen ( szFilename, "rb" ); if ( !pFile ) return false; DWORD crc = ~((DWORD)0); const int BUFFER_SIZE = 131072; static BYTE * pBuffer = NULL; if ( !pBuffer ) pBuffer = new BYTE [ BUFFER_SIZE ]; int iBytesRead; while ( ( iBytesRead = fread ( pBuffer, 1, BUFFER_SIZE, pFile ) )!=0 ) { for ( int i=0; i> 8) ^ g_dSphinxCRC32 [ (crc ^ pBuffer[i]) & 0xff ]; } fclose ( pFile ); uCRC32 = ~crc; return true; } static void GetFileStats ( const char * szFilename, CSphSavedFile & tInfo ) { if ( !szFilename ) { memset ( &tInfo, 0, sizeof ( tInfo ) ); return; } tInfo.m_sFilename = szFilename; struct_stat tStat; memset ( &tStat, 0, sizeof ( tStat ) ); if ( stat ( szFilename, &tStat ) < 0 ) memset ( &tStat, 0, sizeof ( tStat ) ); tInfo.m_uSize = tStat.st_size; tInfo.m_uCTime = tStat.st_ctime; tInfo.m_uMTime = tStat.st_mtime; DWORD uCRC32 = 0; sphCalcFileCRC32 ( szFilename, uCRC32 ); tInfo.m_uCRC32 = uCRC32; } ///////////////////////////////////////////////////////////////////////////// WordformContainer_t::WordformContainer_t () : m_iRefCount ( 0 ) , m_uTokenizerFNV ( 0 ) , m_pMultiWordforms ( NULL ) { } WordformContainer_t::~WordformContainer_t () { if ( m_pMultiWordforms ) { m_pMultiWordforms->m_Hash.IterateStart (); while ( m_pMultiWordforms->m_Hash.IterateNext () ) { CSphMultiforms * pWordforms = m_pMultiWordforms->m_Hash.IterateGet (); ARRAY_FOREACH ( i, pWordforms->m_dWordforms ) SafeDelete ( pWordforms->m_dWordforms[i] ); SafeDelete ( pWordforms ); } SafeDelete ( m_pMultiWordforms ); } } bool WordformContainer_t::IsEqual ( const char * szFile, DWORD uCRC32 ) { if ( !szFile ) return false; struct_stat FileStat; if ( stat ( szFile, &FileStat ) < 0 ) return false; return m_sFilename==szFile && m_tStat.st_ctime==FileStat.st_ctime && m_tStat.st_mtime==FileStat.st_mtime && m_tStat.st_size==FileStat.st_size && m_uCRC32==uCRC32; } ///////////////////////////////////////////////////////////////////////////// CSphDictCRCTraits::CSphDictCRCTraits () : m_iStopwords ( 0 ) , m_pStopwords ( NULL ) , m_dStopwordContainer ( 0 ) , m_iEntries ( 0 ) , m_iLastDoclistPos ( 0 ) , m_iLastWordID ( 0 ) , m_pWordforms ( NULL ) { } CSphDictCRCTraits::~CSphDictCRCTraits () { #if USE_LIBSTEMMER ARRAY_FOREACH ( i, m_dStemmers ) sb_stemmer_delete ( m_dStemmers[i] ); #endif if ( m_pWordforms ) --m_pWordforms->m_iRefCount; } SphWordID_t CSphDictCRCTraits::FilterStopword ( SphWordID_t uID ) const { if ( !m_iStopwords ) return uID; // OPTIMIZE: binary search is not too good, could do some hashing instead SphWordID_t * pStart = m_pStopwords; SphWordID_t * pEnd = m_pStopwords + m_iStopwords - 1; do { if ( uID==*pStart || uID==*pEnd ) return 0; if ( uID<*pStart || uID>*pEnd ) return uID; SphWordID_t * pMid = pStart + (pEnd-pStart)/2; if ( uID==*pMid ) return 0; if ( uID<*pMid ) pEnd = pMid; else pStart = pMid; } while ( pEnd-pStart>1 ); return uID; } bool CSphDictCRCTraits::ToNormalForm ( BYTE * pWord ) { if ( !m_pWordforms ) return false; int * pIndex = m_pWordforms->m_dHash ( (char *)pWord ); if ( !pIndex ) return false; if ( *pIndex<0 || *pIndex>=m_pWordforms->m_dNormalForms.GetLength () ) return false; if ( m_pWordforms->m_dNormalForms [*pIndex].IsEmpty () ) return false; strcpy ( (char *)pWord, m_pWordforms->m_dNormalForms[*pIndex].cstr() ); // NOLINT return true; } bool CSphDictCRCTraits::ParseMorphology ( const char * szMorph, bool bUseUTF8, CSphString & sError ) { const char * szStart = szMorph; while ( *szStart ) { while ( *szStart && ( sphIsSpace ( *szStart ) || *szStart==',' ) ) ++szStart; if ( !*szStart ) break; const char * szWordStart = szStart; while ( *szStart && !sphIsSpace ( *szStart ) && *szStart!=',' ) ++szStart; if ( szStart - szWordStart > 0 ) { if ( !InitMorph ( szWordStart, szStart - szWordStart, bUseUTF8, sError ) ) return false; } } return true; } bool CSphDictCRCTraits::InitMorph ( const char * szMorph, int iLength, bool bUseUTF8, CSphString & sError ) { if ( iLength==0 ) return true; if ( iLength==4 && !strncmp ( szMorph, "none", iLength ) ) return true; if ( iLength==7 && !strncmp ( szMorph, "stem_en", iLength ) ) { stem_en_init (); return AddMorph ( SPH_MORPH_STEM_EN ); } if ( iLength==7 && !strncmp ( szMorph, "stem_ru", iLength ) ) { stem_ru_init (); return AddMorph ( bUseUTF8 ? SPH_MORPH_STEM_RU_UTF8 : SPH_MORPH_STEM_RU_CP1251 ); } if ( iLength==7 && !strncmp ( szMorph, "stem_cz", iLength ) ) { stem_cz_init (); return AddMorph ( SPH_MORPH_STEM_CZ ); } if ( iLength==9 && !strncmp ( szMorph, "stem_enru", iLength ) ) { stem_en_init (); stem_ru_init (); if ( !AddMorph ( SPH_MORPH_STEM_EN ) ) return false; return AddMorph ( bUseUTF8 ? SPH_MORPH_STEM_RU_UTF8 : SPH_MORPH_STEM_RU_CP1251 ); } if ( iLength==7 && !strncmp ( szMorph, "soundex", iLength ) ) return AddMorph ( SPH_MORPH_SOUNDEX ); if ( iLength==9 && !strncmp ( szMorph, "metaphone", iLength ) ) return AddMorph ( bUseUTF8 ? SPH_MORPH_METAPHONE_UTF8 : SPH_MORPH_METAPHONE_SBCS ); sError = ""; #if USE_LIBSTEMMER const int LIBSTEMMER_LEN = 11; const int MAX_ALGO_LENGTH = 64; if ( iLength > LIBSTEMMER_LEN && iLength - LIBSTEMMER_LEN < MAX_ALGO_LENGTH && !strncmp ( szMorph, "libstemmer_", LIBSTEMMER_LEN ) ) { CSphString sAlgo; CSphString sEnc; sAlgo.SetBinary ( szMorph+LIBSTEMMER_LEN, iLength - LIBSTEMMER_LEN ); sb_stemmer * pStemmer = NULL; if ( bUseUTF8 ) { sEnc = "UTF_8"; pStemmer = sb_stemmer_new ( sAlgo.cstr(), sEnc.cstr() ); } else { sEnc = "ISO_8859_1"; pStemmer = sb_stemmer_new ( sAlgo.cstr(), sEnc.cstr() ); if ( !pStemmer ) { sEnc = "ISO_8859_2"; pStemmer = sb_stemmer_new ( sAlgo.cstr(), sEnc.cstr() ); } if ( !pStemmer ) { sEnc = "KOI8_R"; pStemmer = sb_stemmer_new ( sAlgo.cstr(), sEnc.cstr() ); } } if ( !pStemmer ) { sError.SetSprintf ( "libstemmer morphology algorithm '%s' not available for %s encoding - IGNORED", sAlgo.cstr(), bUseUTF8 ? "UTF-8" : "SBCS" ); return false; } AddMorph ( SPH_MORPH_LIBSTEMMER_FIRST + m_dStemmers.GetLength () ); ARRAY_FOREACH ( i, m_dStemmers ) { if ( m_dStemmers[i]==pStemmer ) { sb_stemmer_delete ( pStemmer ); return false; } } m_dStemmers.Add ( pStemmer ); DescStemmer_t & tDesc = m_dDescStemmers.Add(); tDesc.m_sAlgo.Swap ( sAlgo ); tDesc.m_sEnc.Swap ( sEnc ); return true; } #endif return false; } bool CSphDictCRCTraits::AddMorph ( int iMorph ) { ARRAY_FOREACH ( i, m_dMorph ) if ( m_dMorph[i]==iMorph ) return false; m_dMorph.Add ( iMorph ); return true; } void CSphDictCRCTraits::ApplyStemmers ( BYTE * pWord ) { // try wordforms if ( ToNormalForm ( pWord ) ) return; // check length if ( m_tSettings.m_iMinStemmingLen>1 ) if ( sphUTF8Len ( (const char*)pWord )m_iStopwords = m_iStopwords; pDict->m_pStopwords = m_pStopwords; pDict->m_pWordforms = m_pWordforms; if ( m_pWordforms ) m_pWordforms->m_iRefCount++; pDict->m_dMorph = m_dMorph; #if USE_LIBSTEMMER assert ( m_dDescStemmers.GetLength()==m_dStemmers.GetLength() ); pDict->m_dDescStemmers = m_dDescStemmers; ARRAY_FOREACH ( i, m_dDescStemmers ) { pDict->m_dStemmers.Add ( sb_stemmer_new ( m_dDescStemmers[i].m_sAlgo.cstr(), m_dDescStemmers[i].m_sEnc.cstr() ) ); assert ( pDict->m_dStemmers.Last() ); } #endif return pDict; } bool CSphDictCRCTraits::HasState() const { #if !USE_LIBSTEMMER return false; #else return ( m_dDescStemmers.GetLength()>0 ); #endif } ///////////////////////////////////////////////////////////////////////////// template<> SphWordID_t CSphDictCRC::DoCrc ( const BYTE * pWord ) const { return sphCRC32 ( pWord ); } template<> SphWordID_t CSphDictCRC::DoCrc ( const BYTE * pWord ) const { return (SphWordID_t) sphFNV64 ( pWord ); } template<> SphWordID_t CSphDictCRC::DoCrc ( const BYTE * pWord, int iLen ) const { return sphCRC32 ( pWord, iLen ); } template<> SphWordID_t CSphDictCRC::DoCrc ( const BYTE * pWord, int iLen ) const { return (SphWordID_t) sphFNV64 ( pWord, iLen ); } template < bool CRC32DICT > SphWordID_t CSphDictCRC::GetWordID ( BYTE * pWord ) { // skip stemmers for magic words if ( pWord[0]>=0x20 ) ApplyStemmers ( pWord ); return FilterStopword ( DoCrc ( pWord ) ); } template < bool CRC32DICT > SphWordID_t CSphDictCRC::GetWordID ( const BYTE * pWord, int iLen, bool bFilterStops ) { SphWordID_t uId = DoCrc ( pWord, iLen ); return bFilterStops ? FilterStopword ( uId ) : uId; } template < bool CRC32DICT > SphWordID_t CSphDictCRC::GetWordIDWithMarkers ( BYTE * pWord ) { ApplyStemmers ( pWord + 1 ); SphWordID_t uWordId = DoCrc ( pWord + 1 ); int iLength = strlen ( (const char *)(pWord + 1) ); pWord [iLength + 1] = MAGIC_WORD_TAIL; pWord [iLength + 2] = '\0'; return FilterStopword ( uWordId ) ? DoCrc ( pWord ) : 0; } template < bool CRC32DICT > SphWordID_t CSphDictCRC::GetWordIDNonStemmed ( BYTE * pWord ) { SphWordID_t uWordId = DoCrc ( pWord + 1 ); if ( !FilterStopword ( uWordId ) ) return 0; return DoCrc ( pWord ); } template < bool CRC32DICT > bool CSphDictCRC::IsStopWord ( const BYTE * pWord ) const { return FilterStopword ( DoCrc ( pWord ) )==0; } ////////////////////////////////////////////////////////////////////////// void CSphDictCRCTraits::LoadStopwords ( const char * sFiles, ISphTokenizer * pTokenizer ) { assert ( !m_pStopwords ); assert ( !m_iStopwords ); // tokenize file list if ( !sFiles || !*sFiles ) return; m_dSWFileInfos.Resize ( 0 ); char * sList = new char [ 1+strlen(sFiles) ]; strcpy ( sList, sFiles ); // NOLINT char * pCur = sList; char * sName = NULL; CSphVector dStop; for ( ;; ) { // find next name start while ( *pCur && isspace(*pCur) ) pCur++; if ( !*pCur ) break; sName = pCur; // find next name end while ( *pCur && !isspace(*pCur) ) pCur++; if ( *pCur ) *pCur++ = '\0'; BYTE * pBuffer = NULL; CSphSavedFile tInfo; tInfo.m_sFilename = sName; GetFileStats ( sName, tInfo ); m_dSWFileInfos.Add ( tInfo ); // open file struct_stat st; if ( stat ( sName, &st )==0 ) pBuffer = new BYTE [(size_t)st.st_size]; else { sphWarn ( "stopwords: failed to get file size for '%s'", sName ); continue; } FILE * fp = fopen ( sName, "rb" ); if ( !fp ) { sphWarn ( "failed to load stopwords from '%s'", sName ); SafeDeleteArray ( pBuffer ); continue; } // tokenize file int iLength = (int)fread ( pBuffer, 1, (size_t)st.st_size, fp ); BYTE * pToken; pTokenizer->SetBuffer ( pBuffer, iLength ); while ( ( pToken = pTokenizer->GetToken() )!=NULL ) dStop.Add ( GetWordID ( pToken ) ); // close file fclose ( fp ); SafeDeleteArray ( pBuffer ); } SafeDeleteArray ( sList ); // sort stopwords dStop.Uniq(); // store IDs if ( dStop.GetLength() ) { m_dStopwordContainer.Reset ( dStop.GetLength() ); ARRAY_FOREACH ( i, dStop ) m_dStopwordContainer[i] = dStop[i]; m_iStopwords = m_dStopwordContainer.GetLength (); m_pStopwords = m_dStopwordContainer.Begin(); } } void CSphDictCRCTraits::SweepWordformContainers ( const char * szFile, DWORD uCRC32 ) { for ( int i = 0; i < m_dWordformContainers.GetLength (); ) { WordformContainer_t * WC = m_dWordformContainers[i]; if ( WC->m_iRefCount==0 && !WC->IsEqual ( szFile, uCRC32 ) ) { delete WC; m_dWordformContainers.Remove ( i ); } else ++i; } } WordformContainer_t * CSphDictCRCTraits::GetWordformContainer ( const char * szFile, DWORD uCRC32, const ISphTokenizer * pTokenizer, const char * sIndex ) { ARRAY_FOREACH ( i, m_dWordformContainers ) if ( m_dWordformContainers[i]->IsEqual ( szFile, uCRC32 ) ) { WordformContainer_t * pContainer = m_dWordformContainers[i]; if ( pTokenizer->GetSettingsFNV()==pContainer->m_uTokenizerFNV ) return pContainer; sphWarning ( "index %s: wordforms file %s is shared with index %s, but tokenizer settings are different; IGNORING wordforms", sIndex, szFile, pContainer->m_sIndexName.cstr() ); return NULL; } WordformContainer_t * pContainer = LoadWordformContainer ( szFile, uCRC32, pTokenizer, sIndex ); if ( pContainer ) m_dWordformContainers.Add ( pContainer ); return pContainer; } WordformContainer_t * CSphDictCRCTraits::LoadWordformContainer ( const char * szFile, DWORD uCRC32, const ISphTokenizer * pTokenizer, const char * sIndex ) { // stat it; we'll store stats for later checks struct_stat FileStat; if ( !szFile || !*szFile || stat ( szFile, &FileStat )<0 ) return NULL; // allocate it WordformContainer_t * pContainer = new WordformContainer_t; if ( !pContainer ) return NULL; pContainer->m_sFilename = szFile; pContainer->m_tStat = FileStat; pContainer->m_uCRC32 = uCRC32; pContainer->m_uTokenizerFNV = pTokenizer->GetSettingsFNV(); pContainer->m_sIndexName = sIndex; // open it CSphString sError; CSphAutoreader rdWordforms; if ( !rdWordforms.Open ( szFile, sError ) ) return NULL; // my tokenizer CSphScopedPtr pMyTokenizer ( pTokenizer->Clone ( false ) ); pMyTokenizer->AddSpecials ( ">" ); // scan it line by line char sBuffer [ 6*SPH_MAX_WORD_LEN + 512 ]; // enough to hold 2 UTF-8 words, plus some whitespace overhead int iLen; bool bSeparatorFound = false; CSphString sFrom; while ( ( iLen = rdWordforms.GetLine ( sBuffer, sizeof(sBuffer) ) )>=0 ) { // parse the line pMyTokenizer->SetBuffer ( (BYTE*)sBuffer, iLen ); CSphScopedPtr tMultiWordform ( NULL ); CSphString sKey; BYTE * pFrom = NULL; while ( ( pFrom = pMyTokenizer->GetToken () )!=NULL ) { const BYTE * pCur = (const BYTE *) pMyTokenizer->GetBufferPtr (); while ( isspace(*pCur) ) pCur++; if ( *pCur=='>' ) { sFrom = (const char*)pFrom; bSeparatorFound = true; pMyTokenizer->SetBufferPtr ( (const char*) pCur+1 ); break; } else { if ( !tMultiWordform.Ptr() ) { tMultiWordform = new CSphMultiform; sKey = (const char*)pFrom; } else tMultiWordform->m_dTokens.Add ( (const char*)pFrom ); } } if ( !pFrom ) continue; // FIXME! report parsing error if ( !bSeparatorFound ) continue; // FIXME! report parsing error BYTE * pTo = pMyTokenizer->GetToken (); if ( !pTo ) continue; // FIXME! report parsing error CSphString sTo ( (const char *)pTo ); const CSphString & sSourceWordform = tMultiWordform.Ptr() ? sTo : sFrom; // check wordform that source token is a new token or has same destination token int * pRefTo = pContainer->m_dHash ( sSourceWordform ); assert ( !pRefTo || ( *pRefTo>=0 && *pRefTom_dNormalForms.GetLength() ) ); if ( !tMultiWordform.Ptr() && pRefTo && pContainer->m_dNormalForms[*pRefTo]!=sTo ) { const CSphString & sRefTo = pContainer->m_dNormalForms[*pRefTo]; sphWarning ( "duplicate wordform found - skipped ( current='%s > %s', stored='%s > %s' ). Fix your wordforms file '%s'.", sSourceWordform.cstr(), sTo.cstr(), sSourceWordform.cstr(), sRefTo.cstr(), szFile ); } if ( pRefTo && !tMultiWordform.Ptr() ) continue; if ( !pRefTo ) { pContainer->m_dNormalForms.AddUnique ( sTo ); pContainer->m_dHash.Add ( pContainer->m_dNormalForms.GetLength()-1, sSourceWordform ); } if ( tMultiWordform.Ptr() ) { CSphMultiform * pMultiWordform = tMultiWordform.LeakPtr(); pMultiWordform->m_sNormalForm = sTo; pMultiWordform->m_iNormalTokenLen = pMyTokenizer->GetLastTokenLen (); pMultiWordform->m_dTokens.Add ( sFrom ); if ( !pContainer->m_pMultiWordforms ) pContainer->m_pMultiWordforms = new CSphMultiformContainer; CSphMultiforms ** pWordforms = pContainer->m_pMultiWordforms->m_Hash ( sKey ); if ( pWordforms ) { (*pWordforms)->m_dWordforms.Add ( pMultiWordform ); (*pWordforms)->m_iMinTokens = Min ( (*pWordforms)->m_iMinTokens, pMultiWordform->m_dTokens.GetLength () ); (*pWordforms)->m_iMaxTokens = Max ( (*pWordforms)->m_iMaxTokens, pMultiWordform->m_dTokens.GetLength () ); pContainer->m_pMultiWordforms->m_iMaxTokens = Max ( pContainer->m_pMultiWordforms->m_iMaxTokens, (*pWordforms)->m_iMaxTokens ); } else { CSphMultiforms * pNewWordforms = new CSphMultiforms; pNewWordforms->m_dWordforms.Add ( pMultiWordform ); pNewWordforms->m_iMinTokens = pMultiWordform->m_dTokens.GetLength (); pNewWordforms->m_iMaxTokens = pMultiWordform->m_dTokens.GetLength (); pContainer->m_pMultiWordforms->m_iMaxTokens = Max ( pContainer->m_pMultiWordforms->m_iMaxTokens, pNewWordforms->m_iMaxTokens ); pContainer->m_pMultiWordforms->m_Hash.Add ( pNewWordforms, sKey ); } } } return pContainer; } bool CSphDictCRCTraits::LoadWordforms ( const char * szFile, ISphTokenizer * pTokenizer, const char * sIndex ) { GetFileStats ( szFile, m_tWFFileInfo ); DWORD uCRC32 = m_tWFFileInfo.m_uCRC32; SweepWordformContainers ( szFile, uCRC32 ); m_pWordforms = GetWordformContainer ( szFile, uCRC32, pTokenizer, sIndex ); if ( m_pWordforms ) m_pWordforms->m_iRefCount++; return !!m_pWordforms; } bool CSphDictCRCTraits::SetMorphology ( const char * szMorph, bool bUseUTF8, CSphString & sError ) { m_dMorph.Reset (); #if USE_LIBSTEMMER ARRAY_FOREACH ( i, m_dStemmers ) sb_stemmer_delete ( m_dStemmers[i] ); m_dStemmers.Reset (); #endif if ( !szMorph ) return true; CSphString sOption = szMorph; sOption.ToLower (); sError = ""; if ( !ParseMorphology ( sOption.cstr (), bUseUTF8, sError ) ) { m_dMorph.Reset (); if ( sError.IsEmpty () ) sError.SetSprintf ( "invalid morphology option '%s' - IGNORED", sOption.cstr() ); return false; } return true; } bool CSphDictCRCTraits::HasMorphology() const { return ( m_dMorph.GetLength()>0 ); } /// common id-based stemmer bool CSphDictCRCTraits::StemById ( BYTE * pWord, int iStemmer ) { char szBuf [ MAX_KEYWORD_BYTES ]; // safe quick strncpy without (!) padding and with a side of strlen char * p = szBuf; char * pMax = szBuf + sizeof(szBuf) - 1; BYTE * pLastSBS = NULL; while ( *pWord && p=iLen ) break; // stem only UTF8 tail if ( !pLastSBS ) { stem_ru_utf8 ( (WORD*)pWord ); } else { stem_ru_utf8 ( (WORD *)( pLastSBS+1 ) ); } break; case SPH_MORPH_STEM_CZ: stem_cz ( pWord ); break; case SPH_MORPH_SOUNDEX: stem_soundex ( pWord ); break; case SPH_MORPH_METAPHONE_SBCS: stem_dmetaphone ( pWord, false ); break; case SPH_MORPH_METAPHONE_UTF8: stem_dmetaphone ( pWord, true ); break; default: #if USE_LIBSTEMMER if ( iStemmer>=SPH_MORPH_LIBSTEMMER_FIRST && iStemmer m_iLastDoclistPos ); m_wrDict.ZipInt ( 0 ); // indicate checkpoint m_wrDict.ZipOffset ( iDoclistOffset - m_iLastDoclistPos ); // store last length } // restart delta coding, once per WORDLIST_CHECKPOINT entries m_iLastWordID = 0; m_iLastDoclistPos = 0; // begin new wordlist entry assert ( m_wrDict.GetPos()<=UINT_MAX ); CSphWordlistCheckpoint & tCheckpoint = m_dCheckpoints.Add(); tCheckpoint.m_iWordID = uWordID; tCheckpoint.m_iWordlistOffset = m_wrDict.GetPos(); } assert ( iDoclistOffset > m_iLastDoclistPos ); m_wrDict.ZipOffset ( uWordID - m_iLastWordID ); // FIXME! slow with 32bit wordids m_wrDict.ZipOffset ( iDoclistOffset - m_iLastDoclistPos ); m_iLastWordID = uWordID; m_iLastDoclistPos = iDoclistOffset; assert ( iDocs ); assert ( iHits ); m_wrDict.ZipInt ( iDocs ); m_wrDict.ZipInt ( iHits ); m_iEntries++; } void CSphDictCRCTraits::DictEndEntries ( SphOffset_t iDoclistOffset ) { assert ( iDoclistOffset>=m_iLastDoclistPos ); m_wrDict.ZipInt ( 0 ); // indicate checkpoint m_wrDict.ZipOffset ( iDoclistOffset - m_iLastDoclistPos ); // store last doclist length } ////////////////////////////////////////////////////////////////////////// // KEYWORDS STORING DICTIONARY ////////////////////////////////////////////////////////////////////////// class CSphDictKeywords : public CSphDictCRC { private: static const int SLOTS = 65536; static const int ENTRY_CHUNK = 65536; static const int KEYWORD_CHUNK = 1048576; static const int DICT_CHUNK = 65536; public: // OPTIMIZE? change pointers to 8:24 locators to save RAM on x64 gear? struct HitblockKeyword_t { SphWordID_t m_uWordid; // locally unique word id (crc value, adjusted in case of collsion) HitblockKeyword_t * m_pNextHash; // next hashed entry char * m_pKeyword; // keyword }; struct HitblockException_t { HitblockKeyword_t * m_pEntry; // hash entry SphWordID_t m_uCRC; // original unadjusted crc bool operator < ( const HitblockException_t & rhs ) const { return m_pEntry->m_uWordid < rhs.m_pEntry->m_uWordid; } }; struct DictKeyword_t { char * m_sKeyword; SphOffset_t m_uOff; int m_iDocs; int m_iHits; BYTE m_uHint; }; struct DictBlock_t { SphOffset_t m_iPos; int m_iLen; }; private: HitblockKeyword_t * m_dHash [ SLOTS ]; ///< hash by wordid (!) CSphVector m_dExceptions; bool m_bHitblock; ///< should we store words on GetWordID or not int m_iMemUse; ///< current memory use by all the chunks int m_iDictLimit; ///< allowed memory limit for dict block collection CSphVector m_dEntryChunks; ///< hash chunks, only used when indexing hitblocks HitblockKeyword_t * m_pEntryChunk; int m_iEntryChunkFree; CSphVector m_dKeywordChunks; ///< keyword storage BYTE * m_pKeywordChunk; int m_iKeywordChunkFree; CSphVector m_dDictChunks; ///< dict entry chunks, only used when sorting final dict DictKeyword_t * m_pDictChunk; int m_iDictChunkFree; int m_iTmpFD; ///< temp dict file descriptor CSphWriter m_wrTmpDict; ///< temp dict writer CSphVector m_dDictBlocks; ///< on-disk locations of dict entry blocks char m_sClippedWord[MAX_KEYWORD_BYTES]; ///< keyword storage for cliiped word private: SphWordID_t HitblockGetID ( const char * pWord, int iLen, SphWordID_t uCRC ); HitblockKeyword_t * HitblockAddKeyword ( DWORD uHash, const char * pWord, int iLen, SphWordID_t uID ); public: explicit CSphDictKeywords (); virtual ~CSphDictKeywords (); virtual void HitblockBegin () { m_bHitblock = true; } virtual void HitblockPatch ( CSphWordHit * pHits, int iHits ); virtual const char * HitblockGetKeyword ( SphWordID_t uWordID ); virtual int HitblockGetMemUse () { return m_iMemUse; } virtual void HitblockReset (); virtual void DictBegin ( int iTmpDictFD, int iDictFD, int iDictLimit ); virtual void DictEntry ( SphWordID_t uWordID, BYTE * sKeyword, int iDocs, int iHits, SphOffset_t iDoclistOffset, SphOffset_t iDoclistLength ); virtual void DictEndEntries ( SphOffset_t ) {} virtual bool DictEnd ( SphOffset_t * pCheckpointsPos, int * pCheckpointsCount, int iMemLimit, CSphString & sError ); virtual SphWordID_t GetWordID ( BYTE * pWord ); virtual SphWordID_t GetWordIDWithMarkers ( BYTE * pWord ); virtual SphWordID_t GetWordIDNonStemmed ( BYTE * pWord ); virtual SphWordID_t GetWordID ( const BYTE * pWord, int iLen, bool bFilterStops ); private: void DictFlush (); }; ////////////////////////////////////////////////////////////////////////// CSphDictKeywords::CSphDictKeywords () : m_bHitblock ( false ) , m_iMemUse ( 0 ) , m_iDictLimit ( 0 ) , m_pEntryChunk ( NULL ) , m_iEntryChunkFree ( 0 ) , m_pKeywordChunk ( NULL ) , m_iKeywordChunkFree ( 0 ) , m_pDictChunk ( NULL ) , m_iDictChunkFree ( 0 ) { memset ( m_dHash, 0, sizeof(m_dHash) ); } CSphDictKeywords::~CSphDictKeywords () { HitblockReset(); } void CSphDictKeywords::HitblockReset() { m_dExceptions.Resize ( 0 ); ARRAY_FOREACH ( i, m_dEntryChunks ) SafeDeleteArray ( m_dEntryChunks[i] ); m_dEntryChunks.Resize ( 0 ); m_pEntryChunk = NULL; m_iEntryChunkFree = 0; ARRAY_FOREACH ( i, m_dKeywordChunks ) SafeDeleteArray ( m_dKeywordChunks[i] ); m_dKeywordChunks.Resize ( 0 ); m_pKeywordChunk = NULL; m_iKeywordChunkFree = 0; m_iMemUse = 0; memset ( m_dHash, 0, sizeof(m_dHash) ); } CSphDictKeywords::HitblockKeyword_t * CSphDictKeywords::HitblockAddKeyword ( DWORD uHash, const char * sWord, int iLen, SphWordID_t uID ) { assert ( iLenm_pKeyword = (char*)m_pKeywordChunk; pEntry->m_uWordid = uID; m_pKeywordChunk += iLen; m_iKeywordChunkFree -= iLen; // mtf it pEntry->m_pNextHash = m_dHash [ uHash ]; m_dHash [ uHash ] = pEntry; return pEntry; } SphWordID_t CSphDictKeywords::HitblockGetID ( const char * sWord, int iLen, SphWordID_t uCRC ) { if ( iLen>=MAX_KEYWORD_BYTES-4 ) // fix of very long word (zones) { memcpy ( m_sClippedWord, sWord, MAX_KEYWORD_BYTES-4 ); memset ( m_sClippedWord+MAX_KEYWORD_BYTES-4, 0, 4 ); CSphString sOrig; sOrig.SetBinary ( sWord, iLen ); sphWarn ( "word overrun buffer, clipped!!!\nclipped (len=%d, word='%s')\noriginal (len=%d, word='%s')", MAX_KEYWORD_BYTES-4, m_sClippedWord, iLen, sOrig.cstr() ); sWord = m_sClippedWord; iLen = MAX_KEYWORD_BYTES-4; uCRC = sphCRC32 ( (const BYTE *)m_sClippedWord, MAX_KEYWORD_BYTES-4 ); } // is this a known one? find it // OPTIMIZE? in theory we could use something faster than crc32; but quick lookup3 test did not show any improvements const DWORD uHash = (DWORD)( uCRC % SLOTS ); HitblockKeyword_t * pEntry = m_dHash [ uHash ]; HitblockKeyword_t ** ppEntry = &m_dHash [ uHash ]; while ( pEntry ) { // check crc if ( pEntry->m_uWordid!=uCRC ) { // crc mismatch, try next entry ppEntry = &pEntry->m_pNextHash; pEntry = pEntry->m_pNextHash; continue; } // crc matches, check keyword register int iWordLen = iLen; register const char * a = pEntry->m_pKeyword; register const char * b = sWord; while ( *a==*b && iWordLen-- ) { if ( !*a || !iWordLen ) { // known word, mtf it, and return id (*ppEntry) = pEntry->m_pNextHash; pEntry->m_pNextHash = m_dHash [ uHash ]; m_dHash [ uHash ] = pEntry; return pEntry->m_uWordid; } a++; b++; } // collision detected! // our crc is taken as a wordid, but keyword does not match // welcome to the land of very tricky magic // // pEntry might either be a known exception, or a regular keyword // sWord might either be a known exception, or a new one // if they are not known, they needed to be added as exceptions now // // in case sWord is new, we need to assign a new unique wordid // for that, we keep incrementing the crc until it is unique // a starting point for wordid search loop would be handy // // let's scan the exceptions vector and work on all this // // NOTE, beware of the order, it is wordid asc, which does NOT guarantee crc asc // example, assume crc(w1)==X, crc(w2)==X+1, crc(w3)==X (collides with w1) // wordids will be X, X+1, X+2 but crcs will be X, X+1, X // // OPTIMIZE, might make sense to use binary search // OPTIMIZE, add early out somehow SphWordID_t uWordid = uCRC + 1; const int iExcLen = m_dExceptions.GetLength(); int iExc = m_dExceptions.GetLength(); ARRAY_FOREACH ( i, m_dExceptions ) { const HitblockKeyword_t * pExcWord = m_dExceptions[i].m_pEntry; // incoming word is a known exception? just return the pre-assigned wordid if ( m_dExceptions[i].m_uCRC==uCRC && strncmp ( pExcWord->m_pKeyword, sWord, iLen )==0 ) return pExcWord->m_uWordid; // incoming word collided into a known exception? clear the matched entry; no need to re-add it (see below) if ( pExcWord==pEntry ) pEntry = NULL; // find first exception with wordid greater or equal to our candidate if ( pExcWord->m_uWordid>=uWordid && iExc==iExcLen ) iExc = i; } // okay, this is a new collision // if entry was a regular word, we have to add it if ( pEntry ) { m_dExceptions.Add(); m_dExceptions.Last().m_pEntry = pEntry; m_dExceptions.Last().m_uCRC = uCRC; } // need to assign a new unique wordid now // keep scanning both exceptions and keywords for collisions for ( ;; ) { // iExc must be either the first exception greater or equal to current candidate, or out of bounds assert ( iExc==iExcLen || m_dExceptions[iExc].m_pEntry->m_uWordid>=uWordid ); assert ( iExc==0 || m_dExceptions[iExc-1].m_pEntry->m_uWordidm_uWordid==uWordid ) { uWordid++; while ( iExcm_uWordidm_uWordid==uWordid ) break; pCheck = pCheck->m_pNextHash; } // no collisions; we've found our unique wordid! if ( !pCheck ) break; // got a collision; add it HitblockException_t & tColl = m_dExceptions.Add(); tColl.m_pEntry = pCheck; tColl.m_uCRC = pCheck->m_uWordid; // not a known exception; hence, wordid must equal crc // and keep looking uWordid++; continue; } // and finally, we have that precious new wordid // so hash our new unique under its new unique adjusted wordid pEntry = HitblockAddKeyword ( (DWORD)( uWordid % SLOTS ), sWord, iLen, uWordid ); // add it as a collision too m_dExceptions.Add(); m_dExceptions.Last().m_pEntry = pEntry; m_dExceptions.Last().m_uCRC = uCRC; // keep exceptions list sorted by wordid m_dExceptions.Sort(); return pEntry->m_uWordid; } // new keyword with unique crc pEntry = HitblockAddKeyword ( uHash, sWord, iLen, uCRC ); return pEntry->m_uWordid; } struct DictKeywordTagged_t : public CSphDictKeywords::DictKeyword_t { int m_iBlock; }; struct DictKeywordTaggedCmp_fn { static inline bool IsLess ( const DictKeywordTagged_t & a, const DictKeywordTagged_t & b ) { return strcmp ( a.m_sKeyword, b.m_sKeyword ) < 0; } }; static void DictReadEntry ( CSphBin * pBin, DictKeywordTagged_t & tEntry, BYTE * pKeyword ) { int iKeywordLen = pBin->ReadByte (); if ( iKeywordLen<0 ) { // early eof or read error; flag must be raised assert ( pBin->IsError() ); return; } assert ( iKeywordLen>0 && iKeywordLenReadBytes ( pKeyword, iKeywordLen )<0 ) { assert ( pBin->IsError() ); return; } pKeyword[iKeywordLen] = '\0'; tEntry.m_sKeyword = (char*)pKeyword; tEntry.m_uOff = pBin->UnzipOffset(); tEntry.m_iDocs = pBin->UnzipInt(); tEntry.m_iHits = pBin->UnzipInt(); tEntry.m_uHint = (BYTE) pBin->ReadByte(); } void CSphDictKeywords::DictBegin ( int iTmpDictFD, int iDictFD, int iDictLimit ) { m_iTmpFD = iTmpDictFD; m_wrTmpDict.CloseFile (); m_wrTmpDict.SetFile ( iTmpDictFD, NULL ); m_wrDict.CloseFile (); m_wrDict.SetFile ( iDictFD, NULL ); m_wrDict.PutByte ( 1 ); m_iDictLimit = Max ( iDictLimit, KEYWORD_CHUNK + DICT_CHUNK*(int)sizeof(DictKeyword_t) ); // can't use less than 1 chunk } bool CSphDictKeywords::DictEnd ( SphOffset_t * pCheckpointsPos, int * pCheckpointsCount, int iMemLimit, CSphString & sError ) { DictFlush (); m_wrTmpDict.CloseFile (); // tricky: file is not owned, so it won't get closed, and iTmpFD won't get invalidated if ( !m_dDictBlocks.GetLength() ) m_wrDict.CloseFile(); if ( m_wrTmpDict.IsError() || m_wrDict.IsError() ) { sError.SetSprintf ( "dictionary write error (out of space?)" ); return false; } if ( !m_dDictBlocks.GetLength() ) { *pCheckpointsPos = m_wrDict.GetPos (); *pCheckpointsCount = 0; return true; } // initialize readers CSphVector dBins ( m_dDictBlocks.GetLength() ); int iMaxBlock = 0; ARRAY_FOREACH ( i, m_dDictBlocks ) iMaxBlock = Max ( iMaxBlock, m_dDictBlocks[i].m_iLen ); iMemLimit = Max ( iMemLimit, iMaxBlock*m_dDictBlocks.GetLength() ); int iBinSize = CSphBin::CalcBinSize ( iMemLimit, m_dDictBlocks.GetLength(), "sort_dict" ); SphOffset_t iSharedOffset = -1; ARRAY_FOREACH ( i, m_dDictBlocks ) { dBins[i] = new CSphBin(); dBins[i]->m_iFileLeft = m_dDictBlocks[i].m_iLen; dBins[i]->m_iFilePos = m_dDictBlocks[i].m_iPos; dBins[i]->Init ( m_iTmpFD, &iSharedOffset, iBinSize ); } // keywords storage BYTE * pKeywords = new BYTE [ MAX_KEYWORD_BYTES*dBins.GetLength() ]; #define LOC_CLEANUP() \ { \ ARRAY_FOREACH ( i, dBins ) \ SafeDelete ( dBins[i] ); \ SafeDeleteArray ( pKeywords ); \ } // do the sort CSphQueue < DictKeywordTagged_t, DictKeywordTaggedCmp_fn > qWords ( dBins.GetLength() ); DictKeywordTagged_t tEntry; ARRAY_FOREACH ( i, dBins ) { DictReadEntry ( dBins[i], tEntry, pKeywords + i*MAX_KEYWORD_BYTES ); if ( dBins[i]->IsError() ) { sError.SetSprintf ( "entry read error in dictionary sort (bin %d of %d)", i, dBins.GetLength() ); LOC_CLEANUP(); return false; } tEntry.m_iBlock = i; qWords.Push ( tEntry ); } char sLastKeyword [ MAX_KEYWORD_BYTES ]; sLastKeyword[0] = '\0'; int iWords = 0; while ( qWords.GetLength() ) { const DictKeywordTagged_t & tWord = qWords.Root(); const int iLen = strlen ( tWord.m_sKeyword ); // OPTIMIZE? // store checkpoints as needed if ( ( iWords % WORDLIST_CHECKPOINT )==0 ) { // emit a checkpoint, unless we're at the very dict beginning if ( iWords ) { m_wrDict.ZipInt ( 0 ); m_wrDict.ZipInt ( 0 ); } BYTE * sClone = new BYTE [ iLen+1 ]; // OPTIMIZE? pool these? memcpy ( sClone, tWord.m_sKeyword, iLen+1 ); sClone[iLen] = '\0'; CSphWordlistCheckpoint & tCheckpoint = m_dCheckpoints.Add (); tCheckpoint.m_sWord = (char*) sClone; tCheckpoint.m_iWordlistOffset = m_wrDict.GetPos(); sLastKeyword[0] = '\0'; } iWords++; // how many bytes of a previous keyword can we reuse? int iMatch = 0; while ( sLastKeyword[iMatch] && sLastKeyword[iMatch]==tWord.m_sKeyword[iMatch] ) iMatch++; int iDelta = iLen - iMatch; assert ( iDelta>0 ); memcpy ( sLastKeyword, tWord.m_sKeyword, iLen+1 ); sLastKeyword[iLen] = '\0'; // write final dict entry assert ( iLen ); assert ( tWord.m_uOff ); assert ( tWord.m_iDocs ); assert ( tWord.m_iHits ); assert ( iMatch+iDelta<(int)sizeof(sLastKeyword) ); // match and delta are usually tiny, pack them together in 1 byte // tricky bit, this byte leads the entry so it must never be 0 (aka eof mark)! if ( iDelta<=8 && iMatch<=15 ) { m_wrDict.PutByte ( 0x80 + ( (iDelta-1)<<4 ) + iMatch ); } else { m_wrDict.PutByte ( iDelta ); // always greater than 0 m_wrDict.PutByte ( iMatch ); } m_wrDict.PutBytes ( tWord.m_sKeyword + iMatch, iDelta ); m_wrDict.ZipOffset ( tWord.m_uOff ); m_wrDict.ZipInt ( tWord.m_iDocs ); m_wrDict.ZipInt ( tWord.m_iHits ); if ( tWord.m_iDocs>=DOCLIST_HINT_THRESH ) m_wrDict.PutByte ( tWord.m_uHint ); // next int iBin = tWord.m_iBlock; qWords.Pop (); if ( !dBins[iBin]->IsDone() ) { DictReadEntry ( dBins[iBin], tEntry, pKeywords + iBin*MAX_KEYWORD_BYTES ); if ( dBins[iBin]->IsError() ) { sError.SetSprintf ( "entry read error in dictionary sort (bin %d of %d)", iBin, dBins.GetLength() ); LOC_CLEANUP(); return false; } tEntry.m_iBlock = iBin; qWords.Push ( tEntry ); } } // end of dictionary block m_wrDict.ZipInt ( 0 ); m_wrDict.ZipInt ( 0 ); LOC_CLEANUP(); #undef LOC_CLEANUP // flush wordlist checkpoints *pCheckpointsPos = m_wrDict.GetPos(); *pCheckpointsCount = m_dCheckpoints.GetLength(); ARRAY_FOREACH ( i, m_dCheckpoints ) { const int iLen = strlen ( m_dCheckpoints[i].m_sWord ); assert ( m_dCheckpoints[i].m_iWordlistOffset>0 ); assert ( iLen>0 && iLenm_sKeyword, b->m_sKeyword ) < 0; } }; void CSphDictKeywords::DictFlush () { if ( !m_dDictChunks.GetLength() ) return; assert ( m_dDictChunks.GetLength() && m_dKeywordChunks.GetLength() ); // sort em int iTotalWords = m_dDictChunks.GetLength()*DICT_CHUNK - m_iDictChunkFree; CSphVector dWords ( iTotalWords ); int iIdx = 0; ARRAY_FOREACH ( i, m_dDictChunks ) { int iWords = DICT_CHUNK; if ( i==m_dDictChunks.GetLength()-1 ) iWords -= m_iDictChunkFree; DictKeyword_t * pWord = m_dDictChunks[i]; for ( int j=0; jm_sKeyword ); m_wrTmpDict.PutByte ( iLen ); m_wrTmpDict.PutBytes ( pWord->m_sKeyword, iLen ); m_wrTmpDict.ZipOffset ( pWord->m_uOff ); m_wrTmpDict.ZipInt ( pWord->m_iDocs ); m_wrTmpDict.ZipInt ( pWord->m_iHits ); m_wrTmpDict.PutByte ( pWord->m_uHint ); } tBlock.m_iLen = (int)( m_wrTmpDict.GetPos() - tBlock.m_iPos ); // clean up buffers ARRAY_FOREACH ( i, m_dDictChunks ) SafeDeleteArray ( m_dDictChunks[i] ); m_dDictChunks.Resize ( 0 ); m_pDictChunk = NULL; m_iDictChunkFree = 0; ARRAY_FOREACH ( i, m_dKeywordChunks ) SafeDeleteArray ( m_dKeywordChunks[i] ); m_dKeywordChunks.Resize ( 0 ); m_pKeywordChunk = NULL; m_iKeywordChunkFree = 0; m_iMemUse = 0; } void CSphDictKeywords::DictEntry ( SphWordID_t, BYTE * sKeyword, int iDocs, int iHits, SphOffset_t iDoclistOffset, SphOffset_t iDoclistLength ) { // they say, this might just happen during merge // FIXME! can we make merge avoid sending such keywords to dict and assert here? if ( !iDocs ) return; assert ( iHits ); assert ( iDoclistLength>0 ); DictKeyword_t * pWord = NULL; int iLen = strlen ( (char*)sKeyword ) + 1; for ( ;; ) { // alloc dict entry if ( !m_iDictChunkFree ) { if ( m_iDictLimit && ( m_iMemUse + (int)sizeof(DictKeyword_t)*DICT_CHUNK )>m_iDictLimit ) DictFlush (); m_pDictChunk = new DictKeyword_t [ DICT_CHUNK ]; m_iDictChunkFree = DICT_CHUNK; m_dDictChunks.Add ( m_pDictChunk ); m_iMemUse += sizeof(DictKeyword_t)*DICT_CHUNK; } // alloc keyword if ( m_iKeywordChunkFree < iLen ) { if ( m_iDictLimit && ( m_iMemUse + KEYWORD_CHUNK )>m_iDictLimit ) { DictFlush (); continue; // because we just flushed pWord } m_pKeywordChunk = new BYTE [ KEYWORD_CHUNK ]; m_iKeywordChunkFree = KEYWORD_CHUNK; m_dKeywordChunks.Add ( m_pKeywordChunk ); m_iMemUse += KEYWORD_CHUNK; } // aw kay break; } pWord = m_pDictChunk++; m_iDictChunkFree--; pWord->m_sKeyword = (char*)m_pKeywordChunk; memcpy ( m_pKeywordChunk, sKeyword, iLen ); m_pKeywordChunk[iLen-1] = '\0'; m_pKeywordChunk += iLen; m_iKeywordChunkFree -= iLen; pWord->m_uOff = iDoclistOffset; pWord->m_iDocs = iDocs; pWord->m_iHits = iHits; pWord->m_uHint = DoclistHintPack ( iDocs, iDoclistLength ); } SphWordID_t CSphDictKeywords::GetWordID ( BYTE * pWord ) { SphWordID_t uCRC = CSphDictCRC::GetWordID ( pWord ); if ( !uCRC || !m_bHitblock ) return uCRC; int iLen = strlen ( (const char *)pWord ); return HitblockGetID ( (const char *)pWord, iLen, uCRC ); } SphWordID_t CSphDictKeywords::GetWordIDWithMarkers ( BYTE * pWord ) { SphWordID_t uCRC = CSphDictCRC::GetWordIDWithMarkers ( pWord ); if ( !uCRC || !m_bHitblock ) return uCRC; int iLen = strlen ( (const char *)pWord ); return HitblockGetID ( (const char *)pWord, iLen, uCRC ); } SphWordID_t CSphDictKeywords::GetWordIDNonStemmed ( BYTE * pWord ) { SphWordID_t uCRC = CSphDictCRC::GetWordIDNonStemmed ( pWord ); if ( !uCRC || !m_bHitblock ) return uCRC; int iLen = strlen ( (const char *)pWord ); return HitblockGetID ( (const char *)pWord, iLen, uCRC ); } SphWordID_t CSphDictKeywords::GetWordID ( const BYTE * pWord, int iLen, bool bFilterStops ) { SphWordID_t uCRC = CSphDictCRC::GetWordID ( pWord, iLen, bFilterStops ); if ( !uCRC || !m_bHitblock ) return uCRC; return HitblockGetID ( (const char *)pWord, iLen, uCRC ); // !COMMIT would break, we kind of strcmp inside; but must never get called? } /// binary search for the first hit with wordid greater than or equal to reference static CSphWordHit * FindFirstGte ( CSphWordHit * pHits, int iHits, SphWordID_t uID ) { if ( pHits->m_iWordID==uID ) return pHits; CSphWordHit * pL = pHits; CSphWordHit * pR = pHits + iHits - 1; if ( pL->m_iWordID > uID || pR->m_iWordID < uID ) return NULL; while ( pR-pL!=1 ) { CSphWordHit * pM = pL + ( pR-pL )/2; if ( pM->m_iWordID < uID ) pL = pM; else pR = pM; } assert ( pR-pL==1 ); assert ( pL->m_iWordIDm_iWordID>=uID ); return pR; } /// full crc and keyword check static inline bool FullIsLess ( const CSphDictKeywords::HitblockException_t & a, const CSphDictKeywords::HitblockException_t & b ) { if ( a.m_uCRC!=b.m_uCRC ) return a.m_uCRC < b.m_uCRC; return strcmp ( a.m_pEntry->m_pKeyword, b.m_pEntry->m_pKeyword ) < 0; } /// sort functor to compute collided hits reordering struct HitblockPatchSort_fn { const CSphDictKeywords::HitblockException_t * m_pExc; explicit HitblockPatchSort_fn ( const CSphDictKeywords::HitblockException_t * pExc ) : m_pExc ( pExc ) {} bool IsLess ( int a, int b ) const { return FullIsLess ( m_pExc[a], m_pExc[b] ); } }; /// do hit block patching magic void CSphDictKeywords::HitblockPatch ( CSphWordHit * pHits, int iHits ) { if ( !pHits || iHits<=0 ) return; const CSphVector & dExc = m_dExceptions; // shortcut CSphVector dChunk; // reorder hit chunks for exceptions (aka crc collisions) for ( int iFirst = 0; iFirst < dExc.GetLength()-1; ) { // find next span of collisions, iFirst inclusive, iMax exclusive ie. [iFirst,iMax) // (note that exceptions array is always sorted) SphWordID_t uFirstWordid = dExc[iFirst].m_pEntry->m_uWordid; assert ( dExc[iFirst].m_uCRC==uFirstWordid ); int iMax = iFirst+1; SphWordID_t uSpan = uFirstWordid+1; while ( iMax < dExc.GetLength() && dExc[iMax].m_pEntry->m_uWordid==uSpan ) { iMax++; uSpan++; } // check whether they are in proper order already bool bSorted = true; for ( int i=iFirst; im_iWordID==uFirstWordid ); // find the chunk starts for ( int i=1; im_iWordID==uFirstWordid+i ); } CSphWordHit * pTemp; if ( iMax-iFirst==2 ) { // most frequent case, just two collisions // OPTIMIZE? allocate buffer for the smaller chunk, not just first chunk pTemp = new CSphWordHit [ dChunk[1]-dChunk[0] ]; memcpy ( pTemp, dChunk[0], ( dChunk[1]-dChunk[0] )*sizeof(CSphWordHit) ); memmove ( dChunk[0], dChunk[1], ( dChunk[2]-dChunk[1] )*sizeof(CSphWordHit) ); memcpy ( dChunk[0] + ( dChunk[2]-dChunk[1] ), pTemp, ( dChunk[1]-dChunk[0] )*sizeof(CSphWordHit) ); } else { // generic case, more than two CSphVector dReorder ( iMax-iFirst ); ARRAY_FOREACH ( i, dReorder ) dReorder[i] = i; HitblockPatchSort_fn fnSort ( &dExc[iFirst] ); dReorder.Sort ( fnSort ); // OPTIMIZE? could skip heading and trailing blocks that are already in position pTemp = new CSphWordHit [ dChunk.Last()-dChunk[0] ]; CSphWordHit * pOut = pTemp; ARRAY_FOREACH ( i, dReorder ) { int iChunk = dReorder[i]; int iHits = dChunk[iChunk+1] - dChunk[iChunk]; memcpy ( pOut, dChunk[iChunk], iHits*sizeof(CSphWordHit) ); pOut += iHits; } assert ( ( pOut-pTemp )==( dChunk.Last()-dChunk[0] ) ); memcpy ( dChunk[0], pTemp, ( dChunk.Last()-dChunk[0] )*sizeof(CSphWordHit) ); } // patching done SafeDeleteArray ( pTemp ); iFirst = iMax; } } const char * CSphDictKeywords::HitblockGetKeyword ( SphWordID_t uWordID ) { const DWORD uHash = (DWORD)( uWordID % SLOTS ); HitblockKeyword_t * pEntry = m_dHash [ uHash ]; while ( pEntry ) { // check crc if ( pEntry->m_uWordid!=uWordID ) { // crc mismatch, try next entry pEntry = pEntry->m_pNextHash; continue; } return pEntry->m_pKeyword; } ARRAY_FOREACH ( i, m_dExceptions ) if ( m_dExceptions[i].m_pEntry->m_uWordid==uWordID ) return m_dExceptions[i].m_pEntry->m_pKeyword; assert ( "hash missing value in operator []" ); return "\31oops"; } ////////////////////////////////////////////////////////////////////////// // DICTIONARY FACTORIES ////////////////////////////////////////////////////////////////////////// static CSphDict * SetupDictionary ( CSphDict * pDict, const CSphDictSettings & tSettings, ISphTokenizer * pTokenizer, CSphString & sError, const char * sIndex ) { assert ( pTokenizer ); assert ( pDict ); pDict->Setup ( tSettings ); if ( pDict->SetMorphology ( tSettings.m_sMorphology.cstr (), pTokenizer->IsUtf8(), sError ) ) sError = ""; pDict->LoadStopwords ( tSettings.m_sStopwords.cstr (), pTokenizer ); pDict->LoadWordforms ( tSettings.m_sWordforms.cstr (), pTokenizer, sIndex ); return pDict; } CSphDict * sphCreateDictionaryCRC ( const CSphDictSettings & tSettings, ISphTokenizer * pTokenizer, CSphString & sError, const char * sIndex ) { CSphDict * pDict = NULL; if ( tSettings.m_bCrc32 ) pDict = new CSphDictCRC (); else pDict = new CSphDictCRC (); if ( !pDict ) return NULL; return SetupDictionary ( pDict, tSettings, pTokenizer, sError, sIndex ); } CSphDict * sphCreateDictionaryKeywords ( const CSphDictSettings & tSettings, ISphTokenizer * pTokenizer, CSphString & sError, const char * sIndex ) { CSphDict * pDict = new CSphDictKeywords(); return SetupDictionary ( pDict, tSettings, pTokenizer, sError, sIndex ); } void sphShutdownWordforms () { CSphDictCRCTraits::SweepWordformContainers ( NULL, 0 ); } ///////////////////////////////////////////////////////////////////////////// // HTML STRIPPER ///////////////////////////////////////////////////////////////////////////// static inline int sphIsTag ( int c ) { return sphIsAlpha(c) || c=='.' || c==':'; } static inline int sphIsTagStart ( int c ) { return ( c>='a' && c<='z' ) || ( c>='A' && c<='Z' ) || c=='_' || c=='.' || c==':'; } CSphHTMLStripper::CSphHTMLStripper ( bool bDefaultTags ) { if ( bDefaultTags ) { // known inline tags const char * dKnown[] = { "a", "b", "i", "s", "u", "basefont", "big", "em", "font", "img", "label", "small", "span", "strike", "strong", "sub\0", "sup\0", // fix gcc 3.4.3 on solaris10 compiler bug "tt" }; m_dTags.Resize ( sizeof(dKnown)/sizeof(dKnown[0]) ); ARRAY_FOREACH ( i, m_dTags ) { m_dTags[i].m_sTag = dKnown[i]; m_dTags[i].m_iTagLen = strlen ( dKnown[i] ); m_dTags[i].m_bInline = true; } } UpdateTags (); } int CSphHTMLStripper::GetCharIndex ( int iCh ) const { if ( iCh>='a' && iCh<='z' ) return iCh-'a'; if ( iCh>='A' && iCh<='Z' ) return iCh-'A'; if ( iCh=='_' ) return 26; if ( iCh==':' ) return 27; return -1; } void CSphHTMLStripper::UpdateTags () { m_dTags.Sort (); for ( int i=0; i=(int)sizeof(sTag) ) LOC_ERROR ( "tag name too long", s ); strncpy ( sTag, s, p-s ); sTag[p-s] = '\0'; // skip spaces while ( *p && isspace(*p) ) p++; if ( *p++!='=' ) LOC_ERROR ( "'=' expected", p-1 ); // add indexed tag entry, if not there yet strlwr ( sTag ); int iIndexTag = -1; ARRAY_FOREACH ( i, m_dTags ) if ( m_dTags[i].m_sTag==sTag ) { iIndexTag = i; break; } if ( iIndexTag<0 ) { m_dTags.Add(); m_dTags.Last().m_sTag = sTag; m_dTags.Last().m_iTagLen = strlen ( sTag ); iIndexTag = m_dTags.GetLength()-1; } m_dTags[iIndexTag].m_bIndexAttrs = true; CSphVector & dAttrs = m_dTags[iIndexTag].m_dAttrs; // scan attributes while ( *p ) { // skip spaces while ( *p && isspace(*p) ) p++; if ( !*p ) break; // check attr name s = p; while ( sphIsTag(*p) ) p++; if ( s==p ) LOC_ERROR ( "invalid character in attribute name", s ); // get attr name if ( p-s>=(int)sizeof(sAttr) ) LOC_ERROR ( "attribute name too long", s ); strncpy ( sAttr, s, p-s ); sAttr[p-s] = '\0'; // add attr, if not there yet int iAttr; for ( iAttr=0; iAttr' || *p=='\r' ) pProbEnd = p; p++; } if ( *p==cEnd ) return p+1; if ( pProbEnd ) return pProbEnd; return p; } struct HtmlEntity_t { const char * m_sName; int m_iCode; }; static inline DWORD HtmlEntityHash ( const BYTE * str, int len ) { static const unsigned short asso_values[] = { 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 4, 6, 22, 1, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 170, 48, 0, 5, 44, 0, 10, 10, 86, 421, 7, 0, 1, 42, 93, 41, 421, 0, 5, 8, 14, 421, 421, 5, 11, 8, 421, 421, 421, 421, 421, 421, 1, 25, 27, 9, 2, 113, 82, 14, 3, 179, 1, 81, 91, 12, 0, 1, 180, 56, 17, 5, 31, 60, 7, 3, 161, 2, 3, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421, 421 }; register int hval = len; switch ( hval ) { default: hval += asso_values [ str[4] ]; case 4: case 3: hval += asso_values [ str[2] ]; case 2: hval += asso_values [ str[1]+1 ]; case 1: hval += asso_values [ str[0] ]; break; } return hval + asso_values [ str[len-1] ]; } static inline int HtmlEntityLookup ( const BYTE * str, int len ) { static const unsigned char lengthtable[] = { 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 3, 4, 3, 3, 5, 3, 6, 5, 5, 3, 4, 4, 5, 3, 4, 4, 0, 5, 4, 5, 6, 5, 6, 4, 5, 3, 3, 5, 0, 0, 0, 0, 6, 0, 5, 5, 0, 5, 6, 6, 3, 0, 3, 5, 3, 0, 6, 0, 4, 3, 6, 3, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 6, 4, 0, 6, 3, 3, 3, 0, 4, 5, 4, 4, 4, 3, 7, 4, 3, 6, 2, 3, 6, 4, 3, 6, 5, 6, 5, 5, 4, 2, 0, 0, 4, 6, 8, 0, 0, 0, 5, 5, 0, 6, 6, 2, 2, 4, 4, 6, 6, 4, 4, 5, 6, 2, 3, 4, 6, 5, 0, 2, 0, 0, 6, 6, 6, 6, 6, 4, 6, 5, 0, 6, 4, 5, 4, 6, 6, 0, 0, 4, 6, 5, 6, 0, 6, 4, 5, 6, 5, 6, 4, 0, 3, 6, 0, 4, 4, 4, 5, 4, 6, 0, 4, 4, 6, 5, 6, 7, 2, 2, 6, 2, 5, 2, 5, 0, 0, 0, 4, 4, 2, 4, 2, 2, 4, 0, 4, 4, 4, 5, 5, 0, 3, 7, 5, 0, 5, 6, 5, 0, 6, 0, 6, 0, 4, 6, 4, 6, 6, 2, 6, 0, 5, 5, 4, 6, 6, 0, 5, 6, 4, 4, 4, 4, 0, 5, 0, 5, 0, 4, 5, 4, 0, 4, 4, 4, 0, 0, 0, 4, 0, 0, 0, 5, 6, 5, 3, 0, 0, 6, 5, 4, 5, 5, 5, 5, 0, 5, 5, 0, 5, 0, 0, 0, 4, 6, 0, 3, 0, 5, 5, 0, 0, 3, 6, 5, 0, 4, 0, 0, 0, 0, 5, 7, 5, 3, 5, 3, 0, 0, 6, 0, 6, 0, 0, 7, 0, 0, 5, 0, 5, 0, 0, 0, 0, 5, 4, 0, 0, 0, 0, 0, 7, 4, 0, 0, 3, 0, 0, 0, 3, 0, 6, 0, 0, 7, 5, 5, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 5, 5, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 6, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5 }; static const struct HtmlEntity_t wordlist[] = { {""}, {""}, {""}, {""}, {""}, {""}, {"Rho", 929}, {""}, {""}, {""}, {""}, {""}, {"Chi", 935}, {"phi", 966}, {"iota", 953}, {"psi", 968}, {"int", 8747}, {"theta", 952}, {"amp", 38}, {"there4", 8756}, {"Theta", 920}, {"omega", 969}, {"and", 8743}, {"prop", 8733}, {"ensp", 8194}, {"image", 8465}, {"not", 172}, {"isin", 8712}, {"sdot", 8901}, {""}, {"prime", 8242}, {"prod", 8719}, {"trade", 8482}, {"Scaron", 352}, {"kappa", 954}, {"thinsp", 8201}, {"emsp", 8195}, {"thorn", 254}, {"eta", 951}, {"chi", 967}, {"Kappa", 922}, {""}, {""}, {""}, {""}, {"scaron", 353}, {""}, {"notin", 8713}, {"ndash", 8211}, {""}, {"acute", 180}, {"otilde", 245}, {"atilde", 227}, {"Phi", 934}, {""}, {"Psi", 936}, {"pound", 163}, {"cap", 8745}, {""}, {"otimes", 8855}, {""}, {"nbsp", 32}, {"rho", 961}, {"ntilde", 241}, {"eth", 240}, {"oacute", 243}, {"aacute", 225}, {"eacute", 233}, {"iacute", 237}, {"nabla", 8711}, {"Prime", 8243}, {"ocirc", 244}, {"acirc", 226}, {"ecirc", 234}, {"icirc", 238}, {"or", 8744}, {"Yacute", 221}, {"nsub", 8836}, {""}, {"Uacute", 218}, {"Eta", 919}, {"ETH", 208}, {"sup", 8835}, {""}, {"supe", 8839}, {"Ucirc", 219}, {"sup1", 185}, {"para", 182}, {"sup2", 178}, {"loz", 9674}, {"omicron", 959}, {"part", 8706}, {"cup", 8746}, {"Ntilde", 209}, {"Mu", 924}, {"tau", 964}, {"uacute", 250}, {"Iota", 921}, {"Tau", 932}, {"rsaquo", 8250}, {"alpha", 945}, {"Ccedil", 199}, {"ucirc", 251}, {"oline", 8254}, {"sup3", 179}, {"nu", 957}, {""}, {""}, {"sube", 8838}, {"Eacute", 201}, {"thetasym", 977}, {""}, {""}, {""}, {"Omega", 937}, {"Ecirc", 202}, {""}, {"lowast", 8727}, {"iquest", 191}, {"lt", 60}, {"gt", 62}, {"ordm", 186}, {"euro", 8364}, {"oslash", 248}, {"lsaquo", 8249}, {"zeta", 950}, {"cong", 8773}, {"mdash", 8212}, {"ccedil", 231}, {"ne", 8800}, {"sub", 8834}, {"Zeta", 918}, {"Lambda", 923}, {"Gamma", 915}, {""}, {"Nu", 925}, {""}, {""}, {"ograve", 242}, {"agrave", 224}, {"egrave", 232}, {"igrave", 236}, {"frac14", 188}, {"ordf", 170}, {"Otilde", 213}, {"infin", 8734}, {""}, {"frac12", 189}, {"beta", 946}, {"radic", 8730}, {"darr", 8595}, {"Iacute", 205}, {"Ugrave", 217}, {""}, {""}, {"harr", 8596}, {"hearts", 9829}, {"Icirc", 206}, {"Oacute", 211}, {""}, {"frac34", 190}, {"cent", 162}, {"crarr", 8629}, {"curren", 164}, {"Ocirc", 212}, {"brvbar", 166}, {"sect", 167}, {""}, {"ang", 8736}, {"ugrave", 249}, {""}, {"Beta", 914}, {"uarr", 8593}, {"dArr", 8659}, {"asymp", 8776}, {"perp", 8869}, {"Dagger", 8225}, {""}, {"hArr", 8660}, {"rang", 9002}, {"dagger", 8224}, {"exist", 8707}, {"Egrave", 200}, {"Omicron", 927}, {"mu", 956}, {"pi", 960}, {"weierp", 8472}, {"xi", 958}, {"clubs", 9827}, {"Xi", 926}, {"aring", 229}, {""}, {""}, {""}, {"copy", 169}, {"uArr", 8657}, {"ni", 8715}, {"rarr", 8594}, {"le", 8804}, {"ge", 8805}, {"zwnj", 8204}, {""}, {"apos", 39}, {"macr", 175}, {"lang", 9001}, {"gamma", 947}, {"Delta", 916}, {""}, {"uml", 168}, {"alefsym", 8501}, {"delta", 948}, {""}, {"bdquo", 8222}, {"lambda", 955}, {"equiv", 8801}, {""}, {"Oslash", 216}, {""}, {"hellip", 8230}, {""}, {"rArr", 8658}, {"Atilde", 195}, {"larr", 8592}, {"spades", 9824}, {"Igrave", 204}, {"Pi", 928}, {"yacute", 253}, {""}, {"diams", 9830}, {"sbquo", 8218}, {"fnof", 402}, {"Ograve", 210}, {"plusmn", 177}, {""}, {"rceil", 8969}, {"Aacute", 193}, {"ouml", 246}, {"auml", 228}, {"euml", 235}, {"iuml", 239}, {""}, {"Acirc", 194}, {""}, {"rdquo", 8221}, {""}, {"lArr", 8656}, {"rsquo", 8217}, {"Yuml", 376}, {""}, {"quot", 34}, {"Uuml", 220}, {"bull", 8226}, {""}, {""}, {""}, {"real", 8476}, {""}, {""}, {""}, {"lceil", 8968}, {"permil", 8240}, {"upsih", 978}, {"sum", 8721}, {""}, {""}, {"divide", 247}, {"raquo", 187}, {"uuml", 252}, {"ldquo", 8220}, {"Alpha", 913}, {"szlig", 223}, {"lsquo", 8216}, {""}, {"Sigma", 931}, {"tilde", 732}, {""}, {"THORN", 222}, {""}, {""}, {""}, {"Euml", 203}, {"rfloor", 8971}, {""}, {"lrm", 8206}, {""}, {"sigma", 963}, {"iexcl", 161}, {""}, {""}, {"deg", 176}, {"middot", 183}, {"laquo", 171}, {""}, {"circ", 710}, {""}, {""}, {""}, {""}, {"frasl", 8260}, {"epsilon", 949}, {"oplus", 8853}, {"yen", 165}, {"micro", 181}, {"piv", 982}, {""}, {""}, {"lfloor", 8970}, {""}, {"Agrave", 192}, {""}, {""}, {"Upsilon", 933}, {""}, {""}, {"times", 215}, {""}, {"cedil", 184}, {""}, {""}, {""}, {""}, {"minus", 8722}, {"Iuml", 207}, {""}, {""}, {""}, {""}, {""}, {"upsilon", 965}, {"Ouml", 214}, {""}, {""}, {"rlm", 8207}, {""}, {""}, {""}, {"reg", 174}, {""}, {"forall", 8704}, {""}, {""}, {"Epsilon", 917}, {"empty", 8709}, {"OElig", 338}, {""}, {"shy", 173}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {"Aring", 197}, {""}, {""}, {""}, {"oelig", 339}, {"aelig", 230}, {""}, {"zwj", 8205}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {"sim", 8764}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {"yuml", 255}, {"sigmaf", 962}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {"Auml", 196}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {""}, {"AElig", 198} }; const int MIN_WORD_LENGTH = 2; const int MAX_WORD_LENGTH = 8; const int MAX_HASH_VALUE = 420; if ( len<=MAX_WORD_LENGTH && len>=MIN_WORD_LENGTH ) { register int key = HtmlEntityHash ( str, len ); if ( key<=MAX_HASH_VALUE && key>=0 ) if ( len==lengthtable[key] ) { register const char * s = wordlist[key].m_sName; if ( *str==*s && !memcmp ( str+1, s+1, len-1 ) ) return wordlist[key].m_iCode; } } return 0; } void CSphHTMLStripper::Strip ( BYTE * sData ) const { const BYTE * s = sData; BYTE * d = sData; for ( ;; ) { ///////////////////////////////////// // scan until eof, or tag, or entity ///////////////////////////////////// while ( *s && *s!='<' && *s!='&' ) { if ( *s>=0x20 ) *d++ = *s; else *d++ = ' '; s++; } if ( !*s ) break; ///////////////// // handle entity ///////////////// if ( *s=='&' ) { if ( s[1]=='#' ) { // handle "&#number;" form int iCode = 0; s += 2; while ( isdigit(*s) ) iCode = iCode*10 + (*s++) - '0'; if ( ( iCode>=0 && iCode<=0x1f ) || *s!=';' ) // 0-31 are reserved codes continue; d += sphUTF8Encode ( d, iCode ); s++; } else { // skip until ';' or max length if ( ( s[1]>='a' && s[1]<='z' ) || ( s[1]>='A' && s[1]<='Z' ) ) { const int MAX_ENTITY_LEN = 8; const BYTE * sStart = s+1; while ( *s && *s!=';' && s-sStart<=MAX_ENTITY_LEN ) s++; if ( *s==';' ) { int iCode = HtmlEntityLookup ( sStart, (int)(s-sStart) ); if ( iCode>0 ) { // this is a known entity; encode it d += sphUTF8Encode ( d, iCode ); s++; continue; } } // rollback s = sStart-1; } // if we're here, it's not an entity; pass the leading ampersand and rescan *d++ = *s++; } continue; } ////////////// // handle tag ////////////// assert ( *s=='<' ); if ( GetCharIndex(s[1])<0 ) { if ( s[1]=='/' ) { // check if it's valid closing tag if ( GetCharIndex(s[2])<0 ) { *d++ = *s++; continue; } } else if ( s[1]=='!' ) { if ( s[2]=='-' && s[3]=='-' ) { // it's valid comment; scan until comment end s += 4; // skip opening '' continue; } else if ( isalpha(s[2]) ) { // it's style PI; scan until PI end s += 2; while ( *s && *s!='>' ) { if ( *s=='\'' || *s=='"' ) { s = SkipQuoted ( s ); while ( isspace(*s) ) s++; } else { s++; } } if ( *s=='>' ) s++; continue; } else { // it's something malformed; just ignore *d++ = *s++; continue; } } else if ( s[1]=='?' ) { // scan until PI end s += 2; // skip opening '' ) break; s++; } if ( !*s ) break; s += 2; // skip closing '?>' continue; } else { // simply malformed *d++ = *s++; continue; } } s++; // skip '<' ////////////////////////////////////// // lookup this tag in known tags list ////////////////////////////////////// const StripperTag_t * pTag = NULL; int iZoneNameLen = 0; const BYTE * sZoneName = NULL; s = FindTag ( s, &pTag, &sZoneName, &iZoneNameLen ); ///////////////////////////////////// // process tag contents // index attributes if needed // gracefully handle malformed stuff ///////////////////////////////////// #define LOC_SKIP_SPACES() { while ( sphIsSpace(*s) ) s++; if ( !*s || *s=='>' ) break; } bool bIndexAttrs = ( pTag && pTag->m_bIndexAttrs ); while ( *s && *s!='>' ) { LOC_SKIP_SPACES(); if ( sphIsTagStart(*s) ) { // skip attribute name while it's valid const BYTE * sAttr = s; while ( sphIsTag(*s) ) s++; // blanks or a value after a valid attribute name? if ( sphIsSpace(*s) || *s=='=' ) { const int iAttrLen = (int)( s - sAttr ); LOC_SKIP_SPACES(); // a valid name but w/o a value; keep scanning if ( *s!='=' ) continue; // got value! s++; LOC_SKIP_SPACES(); // check attribute name // OPTIMIZE! remove linear search int iAttr = -1; if ( bIndexAttrs ) { for ( iAttr=0; iAttrm_dAttrs.GetLength(); iAttr++ ) { int iLen = strlen ( pTag->m_dAttrs[iAttr].cstr() ); if ( iLen==iAttrLen && !strncasecmp ( pTag->m_dAttrs[iAttr].cstr(), (const char*)sAttr, iLen ) ) break; } if ( iAttr==pTag->m_dAttrs.GetLength() ) iAttr = -1; } // process the value const BYTE * sVal = s; if ( *s=='\'' || *s=='"' ) { // skip quoted value until a matching quote s = SkipQuoted ( s ); } else { // skip unquoted value until tag end or whitespace while ( *s && *s!='>' && !sphIsSpace(*s) ) s++; } // if this one is to be indexed, copy it if ( iAttr>=0 ) { const BYTE * sMax = s; if ( *sVal=='\'' || *sVal=='"' ) { if ( sMax[-1]==sVal[0] ) sMax--; sVal++; } while ( sValm_bZone ) { // should be at tag's end assert ( s[0]=='\0' || s[-1]=='>' ); // emit secret codes *d++ = MAGIC_CODE_ZONE; for ( int i=0; im_bPara ) { *d++ = MAGIC_CODE_PARAGRAPH; continue; } // in all cases, the tag must be fully processed at this point // not a remove-tag? we're done if ( !pTag->m_bRemove ) { if ( !pTag->m_bInline ) *d++ = ' '; continue; } // sudden eof? bail out if ( !*s ) break; // must be a proper remove-tag end, then assert ( pTag->m_bRemove && s[-1]=='>' ); // short-form? we're done if ( s[-2]=='/' ) continue; // skip everything until the closing tag // FIXME! should we handle insane cases with quoted closing tag within tag? for ( ;; ) { while ( *s && ( s[0]!='<' || s[1]!='/' ) ) s++; if ( !*s ) break; s += 2; // skip m_sTag.cstr(), (const char*)s, pTag->m_iTagLen )!=0 ) continue; if ( !sphIsTag ( s[pTag->m_iTagLen] ) ) { s += pTag->m_iTagLen; // skip tag if ( *s=='>' ) s++; break; } } if ( !pTag->m_bInline ) *d++ = ' '; } *d++ = '\0'; // space, paragraph sequences elimination pass s = sData; d = sData; bool bSpaceOut = false; bool bParaOut = false; bool bZoneOut = false; while ( const char c = *s++ ) { assert ( d<=s-1 ); // handle different character classes if ( sphIsSpace(c) ) { // handle whitespace, skip dupes if ( !bSpaceOut ) *d++ = ' '; bSpaceOut = true; continue; } else if ( c==MAGIC_CODE_PARAGRAPH ) { // handle paragraph marker, skip dupes if ( !bParaOut && !bZoneOut ) { *d++ = c; bParaOut = true; } bSpaceOut = true; continue; } else if ( c==MAGIC_CODE_ZONE ) { // zone marker // rewind preceding paragraph, if any, it is redundant if ( bParaOut ) { assert ( d>sData && d[-1]==MAGIC_CODE_PARAGRAPH ); d--; } // copy \4zoneid\4 *d++ = c; while ( *s && *s!=MAGIC_CODE_ZONE ) *d++ = *s++; if ( *s ) *d++ = *s++; // update state // no spaces paragraphs allowed bSpaceOut = bZoneOut = true; bParaOut = false; continue; } else { *d++ = c; bSpaceOut = bParaOut = bZoneOut = false; } } *d++ = '\0'; } const BYTE * CSphHTMLStripper::FindTag ( const BYTE * sSrc, const StripperTag_t ** ppTag, const BYTE ** ppZoneName, int * pZoneNameLen ) const { assert ( sSrc && ppTag && ppZoneName && pZoneNameLen ); assert ( sSrc[0]!='/' || sSrc[1]!='\0' ); const BYTE * sTagName = ( sSrc[0]=='/' ) ? sSrc+1 : sSrc; *ppZoneName = sSrc; *pZoneNameLen = 0; int iIdx = GetCharIndex ( sTagName[0] ); assert ( iIdx>=0 && iIdx=0 ) { int iStart = m_dStart[iIdx]; int iEnd = m_dEnd[iIdx]; for ( int i=iStart; i<=iEnd; i++ ) { int iLen = m_dTags[i].m_iTagLen; int iCmp = strncasecmp ( m_dTags[i].m_sTag.cstr(), (const char*)sTagName, iLen ); // the tags are sorted; so if current candidate is already greater, rest can be skipped if ( iCmp>0 ) break; // do we have a match? if ( iCmp==0 ) { // got exact match? if ( !sphIsTag ( sTagName[iLen] ) ) { *ppTag = m_dTags.Begin() + i; sSrc = sTagName + iLen; // skip tag name if ( m_dTags[i].m_bZone ) *pZoneNameLen = sSrc - *ppZoneName; break; } // got wildcard match? if ( m_dTags[i].m_bZonePrefix ) { *ppTag = m_dTags.Begin() + i; sSrc = sTagName + iLen; while ( sphIsTag(*sSrc) ) sSrc++; *pZoneNameLen = sSrc - *ppZoneName; break; } } } } return sSrc; } bool CSphHTMLStripper::IsValidTagStart ( int iCh ) const { int i = GetCharIndex ( iCh ); return ( i>=0 && i0 ) && ( m_dPrefixFields.GetLength()==0 || m_dPrefixFields.Contains ( sField ) ); bool bInfix = ( m_iMinInfixLen>0 ) && ( m_dInfixFields.GetLength()==0 || m_dInfixFields.Contains ( sField ) ); assert ( !( bPrefix && bInfix ) ); // no field must be marked both prefix and infix if ( bPrefix ) return SPH_WORDPART_PREFIX; if ( bInfix ) return SPH_WORDPART_INFIX; return SPH_WORDPART_WHOLE; } ////////////////////////////////////////////////////////////////////////// CSphSource::CSphSource ( const char * sName ) : m_pTokenizer ( NULL ) , m_pDict ( NULL ) , m_tSchema ( sName ) , m_bStripHTML ( false ) , m_iNullIds ( 0 ) , m_iMaxIds ( 0 ) { m_pStripper = new CSphHTMLStripper ( true ); } CSphSource::~CSphSource() { delete m_pStripper; } void CSphSource::SetDict ( CSphDict * pDict ) { assert ( pDict ); m_pDict = pDict; } const CSphSourceStats & CSphSource::GetStats () { return m_tStats; } bool CSphSource::SetStripHTML ( const char * sExtractAttrs, const char * sRemoveElements, bool bDetectParagraphs, const char * sZones, CSphString & sError ) { m_bStripHTML = ( sExtractAttrs!=NULL ); if ( !m_bStripHTML ) return false; if ( !m_pStripper->SetIndexedAttrs ( sExtractAttrs, sError ) ) return false; if ( !m_pStripper->SetRemovedElements ( sRemoveElements, sError ) ) return false; if ( bDetectParagraphs ) m_pStripper->EnableParagraphs (); if ( !m_pStripper->SetZones ( sZones, sError ) ) return false; return true; } void CSphSource::SetTokenizer ( ISphTokenizer * pTokenizer ) { assert ( pTokenizer ); m_pTokenizer = pTokenizer; } bool CSphSource::UpdateSchema ( CSphSchema * pInfo, CSphString & sError ) { assert ( pInfo ); // fill it if ( pInfo->m_dFields.GetLength()==0 && pInfo->GetAttrsCount()==0 ) { *pInfo = m_tSchema; return true; } // check it return m_tSchema.CompareTo ( *pInfo, sError ); } void CSphSource::Setup ( const CSphSourceSettings & tSettings ) { m_iMinPrefixLen = Max ( tSettings.m_iMinPrefixLen, 0 ); m_iMinInfixLen = Max ( tSettings.m_iMinInfixLen, 0 ); m_iBoundaryStep = Max ( tSettings.m_iBoundaryStep, -1 ); m_bIndexExactWords = tSettings.m_bIndexExactWords; m_iOvershortStep = Min ( Max ( tSettings.m_iOvershortStep, 0 ), 1 ); m_iStopwordStep = Min ( Max ( tSettings.m_iStopwordStep, 0 ), 1 ); m_bDebugDump = tSettings.m_bDebugDump; //coreseek: assign debug charset setting m_bIndexSP = tSettings.m_bIndexSP; m_dPrefixFields = tSettings.m_dPrefixFields; m_dInfixFields = tSettings.m_dInfixFields; } SphDocID_t CSphSource::VerifyID ( SphDocID_t uID ) { if ( uID==0 ) { m_iNullIds++; return 0; } if ( uID==DOCID_MAX ) { m_iMaxIds++; return 0; } return uID; } ISphHits * CSphSource::IterateJoinedHits ( CSphString & ) { static ISphHits dDummy; m_tDocInfo.m_iDocID = 0; // pretend that's an eof return &dDummy; } ///////////////////////////////////////////////////////////////////////////// // DOCUMENT SOURCE ///////////////////////////////////////////////////////////////////////////// static void FormatEscaped ( FILE * fp, const char * sLine ) { // handle empty lines if ( !sLine || !*sLine ) { fprintf ( fp, "''" ); return; } // pass one, count the needed buffer size int iLen = strlen(sLine); int iOut = 0; for ( int i=0; i(int)sizeof(sMinibuffer) ) { sMaxibuffer = new char [ iOut+4 ]; // 4 is just my safety gap sBuffer = sMaxibuffer; } // pass two, escape it char * sOut = sBuffer; *sOut++ = '\''; for ( int i=0; im_iDocID != m_tDocInfo.m_iDocID) m_tHits.m_dData.Resize ( 0 ); }else m_tHits.m_dData.Resize ( 0 ); BuildHits ( sError, false ); return &m_tHits; } bool CSphSource_Document::CheckFileField ( const BYTE * sField ) { CSphAutofile tFileSource; CSphString sError; if ( tFileSource.Open ( (const char *)sField, SPH_O_READ, sError )==-1 ) { sphWarning ( "docid=" DOCID_FMT ": %s", m_tDocInfo.m_iDocID, sError.cstr() ); return false; } int64_t iFileSize = tFileSource.GetSize(); if ( iFileSize+16 > m_iMaxFileBufferSize ) { sphWarning ( "docid=" DOCID_FMT ": file '%s' too big for a field (size="INT64_FMT", max_file_field_buffer=%d)", m_tDocInfo.m_iDocID, (const char *)sField, iFileSize, m_iMaxFileBufferSize ); return false; } return true; } /// returns file size on success, and replaces *ppField with a pointer to data /// returns -1 on failure (and emits a warning) int CSphSource_Document::LoadFileField ( BYTE ** ppField, CSphString & sError ) { CSphAutofile tFileSource; BYTE * sField = *ppField; if ( tFileSource.Open ( (const char *)sField, SPH_O_READ, sError )==-1 ) { sphWarning ( "docid=" DOCID_FMT ": %s", m_tDocInfo.m_iDocID, sError.cstr() ); return -1; } int64_t iFileSize = tFileSource.GetSize(); if ( iFileSize+16 > m_iMaxFileBufferSize ) { sphWarning ( "docid=" DOCID_FMT ": file '%s' too big for a field (size="INT64_FMT", max_file_field_buffer=%d)", m_tDocInfo.m_iDocID, (const char *)sField, iFileSize, m_iMaxFileBufferSize ); return -1; } int iFieldBytes = (int)iFileSize; if ( !iFieldBytes ) return 0; int iBufSize = Max ( m_iReadFileBufferSize, 1 << sphLog2 ( iFieldBytes+15 ) ); if ( m_iReadFileBufferSize < iBufSize ) SafeDeleteArray ( m_pReadFileBuffer ); if ( !m_pReadFileBuffer ) { m_pReadFileBuffer = new char [ iBufSize ]; m_iReadFileBufferSize = iBufSize; } if ( !tFileSource.Read ( m_pReadFileBuffer, iFieldBytes, sError ) ) { sphWarning ( "docid=" DOCID_FMT ": read failed: %s", m_tDocInfo.m_iDocID, sError.cstr() ); return -1; } m_pReadFileBuffer[iFieldBytes] = '\0'; *ppField = (BYTE*)m_pReadFileBuffer; return iFieldBytes; } #define BUILD_SUBSTRING_HITS_COUNT 4 void CSphSource_Document::BuildSubstringHits ( SphDocID_t uDocid, bool bPayload, ESphWordpart eWordpart, bool bSkipEndMarker ) { bool bPrefixField = ( eWordpart==SPH_WORDPART_PREFIX ); bool bInfixMode = m_iMinInfixLen > 0; int iMinInfixLen = bPrefixField ? m_iMinPrefixLen : m_iMinInfixLen; if ( !m_tState.m_bProcessingHits ) m_tState.m_iBuildLastStep = 1; BYTE * sWord = NULL; BYTE sBuf [ 16+3*SPH_MAX_WORD_LEN ]; int iIterHitCount = BUILD_SUBSTRING_HITS_COUNT; if ( bPrefixField ) iIterHitCount += SPH_MAX_WORD_LEN - m_iMinPrefixLen; else iIterHitCount += ( ( m_iMinInfixLen+SPH_MAX_WORD_LEN ) * ( SPH_MAX_WORD_LEN-m_iMinInfixLen ) / 2 ); // index all infixes while ( ( m_iMaxHits==0 || m_tHits.m_dData.GetLength()+iIterHitCountGetToken() )!=NULL ) { if ( !bPayload ) { HITMAN::AddPos ( &m_tState.m_iHitPos, m_tState.m_iBuildLastStep + m_pTokenizer->GetOvershortCount()*m_iOvershortStep ); if ( m_pTokenizer->GetBoundary() ) HITMAN::AddPos ( &m_tState.m_iHitPos, m_iBoundaryStep ); m_tState.m_iBuildLastStep = 1; } int iLen = m_pTokenizer->GetLastTokenLen (); // always index full word (with magic head/tail marker(s)) int iBytes = strlen ( (const char*)sWord ); if ( m_bIndexExactWords ) { int iBytes = strlen ( (const char*)sWord ); memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD_NONSTEMMED; sBuf[iBytes+1] = '\0'; m_tHits.AddHit ( uDocid, m_pDict->GetWordIDNonStemmed ( sBuf ), m_tState.m_iHitPos ); } memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD; sBuf[iBytes+1] = '\0'; // stemmed word w/markers SphWordID_t iWord = m_pDict->GetWordIDWithMarkers ( sBuf ); if ( iWord ) m_tHits.AddHit ( uDocid, iWord, m_tState.m_iHitPos ); else { m_tState.m_iBuildLastStep = m_iStopwordStep; continue; } // restore stemmed word int iStemmedLen = strlen ( ( const char *)sBuf ); sBuf [iStemmedLen - 1] = '\0'; // stemmed word w/o markers if ( strcmp ( (const char *)sBuf + 1, (const char *)sWord ) ) m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( sBuf + 1, iStemmedLen - 2, true ), m_tState.m_iHitPos ); // restore word memcpy ( sBuf + 1, sWord, iBytes ); sBuf[iBytes+1] = MAGIC_WORD_TAIL; sBuf[iBytes+2] = '\0'; // if there are no infixes, that's it if ( iMinInfixLen > iLen ) { // index full word m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( sWord ), m_tState.m_iHitPos ); continue; } // process all infixes int iMaxStart = bPrefixField ? 0 : ( iLen - iMinInfixLen ); BYTE * sInfix = sBuf + 1; for ( int iStart=0; iStart<=iMaxStart; iStart++ ) { BYTE * sInfixEnd = sInfix; for ( int i = 0; i < iMinInfixLen; i++ ) sInfixEnd += m_pTokenizer->GetCodepointLength ( *sInfixEnd ); for ( int i=iMinInfixLen; i<=iLen-iStart; i++ ) { m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( sInfix, sInfixEnd-sInfix, false ), m_tState.m_iHitPos ); // word start: add magic head if ( bInfixMode && iStart==0 ) m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( sInfix - 1, sInfixEnd-sInfix + 1, false ), m_tState.m_iHitPos ); // word end: add magic tail if ( bInfixMode && i==iLen-iStart ) m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( sInfix, sInfixEnd-sInfix+1, false ), m_tState.m_iHitPos ); sInfixEnd += m_pTokenizer->GetCodepointLength ( *sInfixEnd ); } sInfix += m_pTokenizer->GetCodepointLength ( *sInfix ); } } m_tState.m_bProcessingHits = ( sWord!=NULL ); // mark trailing hits if ( !bSkipEndMarker && !m_tState.m_bProcessingHits && m_tHits.Length() ) { CSphWordHit * pHit = const_cast < CSphWordHit * > ( m_tHits.Last() ); Hitpos_t uRefPos = pHit->m_iWordPos; for ( ; pHit>=m_tHits.First() && pHit->m_iWordPos==uRefPos; pHit-- ) HITMAN::SetEndMarker ( &pHit->m_iWordPos ); } } #define BUILD_REGULAR_HITS_COUNT 6 void CSphSource_Document::BuildRegularHits ( SphDocID_t uDocid, bool bPayload, bool bSkipEndMarker ) { bool bWordDict = m_pDict->GetSettings().m_bWordDict; bool bGlobalPartialMatch = !bWordDict && ( m_iMinPrefixLen > 0 || m_iMinInfixLen > 0 ); if ( !m_tState.m_bProcessingHits ) m_tState.m_iBuildLastStep = 1; BYTE * sWord = NULL; BYTE sBuf [ 16+3*SPH_MAX_WORD_LEN ]; // index words only while ( ( m_iMaxHits==0 || m_tHits.m_dData.GetLength()+BUILD_REGULAR_HITS_COUNTGetToken() )!=NULL ) { //debug dump if(m_pTokenizer->DumpToken()) { printf("%s/x ", sWord); } if ( !bPayload ) { HITMAN::AddPos ( &m_tState.m_iHitPos, m_tState.m_iBuildLastStep + m_pTokenizer->GetOvershortCount()*m_iOvershortStep ); if ( m_pTokenizer->GetBoundary() ) HITMAN::AddPos ( &m_tState.m_iHitPos, m_iBoundaryStep ); } if ( *sWord==MAGIC_CODE_SENTENCE || *sWord==MAGIC_CODE_PARAGRAPH || *sWord==MAGIC_CODE_ZONE ) { m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( (BYTE*)MAGIC_WORD_SENTENCE ), m_tState.m_iHitPos ); if ( *sWord==MAGIC_CODE_PARAGRAPH || *sWord==MAGIC_CODE_ZONE ) m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( (BYTE*)MAGIC_WORD_PARAGRAPH ), m_tState.m_iHitPos ); if ( *sWord==MAGIC_CODE_ZONE ) { BYTE * pZone = (BYTE*) m_pTokenizer->GetBufferPtr(); BYTE * pEnd = pZone; while ( *pEnd!=MAGIC_CODE_ZONE ) pEnd++; *pEnd = '\0'; m_tHits.AddHit ( uDocid, m_pDict->GetWordID ( pZone-1 ), m_tState.m_iHitPos ); m_pTokenizer->SetBufferPtr ( (const char*) pEnd+1 ); } m_tState.m_iBuildLastStep = 1; continue; } if ( bGlobalPartialMatch ) { int iBytes = strlen ( (const char*)sWord ); memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD; sBuf[iBytes+1] = '\0'; m_tHits.AddHit ( uDocid, m_pDict->GetWordIDWithMarkers ( sBuf ), m_tState.m_iHitPos ); } if ( m_bIndexExactWords ) { int iBytes = strlen ( (const char*)sWord ); memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD_NONSTEMMED; sBuf[iBytes+1] = '\0'; m_tHits.AddHit ( uDocid, m_pDict->GetWordIDNonStemmed ( sBuf ), m_tState.m_iHitPos ); } SphWordID_t iWord = m_pDict->GetWordID ( sWord ); if ( iWord ) { m_tHits.AddHit ( uDocid, iWord, m_tState.m_iHitPos ); m_tState.m_iBuildLastStep = m_pTokenizer->TokenIsBlended() ? 0 : 1; } else m_tState.m_iBuildLastStep = m_iStopwordStep; // temporary append --mmseg // zh_cn only GetThesaurus { int iBytes = strlen ( (const char*)sWord ); const BYTE* tbuf_ptr = m_pTokenizer->GetThesaurus(sWord, iBytes); if(tbuf_ptr) { while(*tbuf_ptr) { size_t len = strlen((const char*)tbuf_ptr); SphWordID_t iWord = m_pDict->GetWordID ( tbuf_ptr ,len , true); if ( iWord ) { m_tHits.AddHit ( uDocid, iWord, m_tState.m_iHitPos ); // mmseg; do not inc step for we are in 'one' hit. //m_tState.m_iBuildLastStep = m_pTokenizer->TokenIsBlended() ? 0 : 1; } tbuf_ptr += len + 1; //move next } } //end if buf }//end GetThesaurus } m_tState.m_bProcessingHits = ( sWord!=NULL ); // mark trailing hit if ( !bSkipEndMarker && !m_tState.m_bProcessingHits && m_tHits.Length() ) { CSphWordHit * pHit = const_cast < CSphWordHit * > ( m_tHits.Last() ); HITMAN::SetEndMarker ( &pHit->m_iWordPos ); } } void CSphSource_Document::BuildHits ( CSphString & sError, bool bSkipEndMarker ) { SphDocID_t uDocid = m_tDocInfo.m_iDocID; for ( ; m_tState.m_iFieldStrip ( sField ); iFieldBytes = (int) strlen ( (char*)sField ); } // tokenize and build hits m_tStats.m_iTotalBytes += iFieldBytes; m_pTokenizer->SetBuffer ( sField, iFieldBytes ); m_tState.m_iHitPos = HITMAN::Create ( m_tState.m_iField, m_tState.m_iStartPos ); } const CSphColumnInfo & tField = m_tSchema.m_dFields[m_tState.m_iField]; if ( tField.m_eWordpart!=SPH_WORDPART_WHOLE ) BuildSubstringHits ( uDocid, tField.m_bPayload, tField.m_eWordpart, bSkipEndMarker ); else BuildRegularHits ( uDocid, tField.m_bPayload, bSkipEndMarker ); if ( m_tState.m_bProcessingHits ) break; } m_tState.m_bDocumentDone = !m_tState.m_bProcessingHits; } // -coreseek -pysource BYTE* CSphSource_Document::GetField ( int iFieldIndex) { //use dFields for compatible reason, keep this. return m_tState.m_dFields[iFieldIndex]; } void CSphSource_Document::ParseFieldMVA ( CSphVector < CSphVector < DWORD > > & dFieldMVAs, int iFieldMVA, const char * szValue ) { dFieldMVAs [iFieldMVA].Resize ( 0 ); if ( !szValue ) return; const char * pPtr = szValue; const char * pDigit = NULL; const int MAX_NUMBER_LEN = 64; char szBuf [MAX_NUMBER_LEN]; while ( *pPtr ) { if ( *pPtr>='0' && *pPtr<='9' ) { if ( !pDigit ) pDigit = pPtr; } else { if ( pDigit ) { if ( pPtr - pDigit < MAX_NUMBER_LEN ) { strncpy ( szBuf, pDigit, pPtr - pDigit ); szBuf [pPtr - pDigit] = '\0'; dFieldMVAs [iFieldMVA].Add ( sphToDword ( szBuf ) ); } pDigit = NULL; } } pPtr++; } if ( pDigit ) dFieldMVAs [iFieldMVA].Add ( sphToDword ( pDigit ) ); } ///////////////////////////////////////////////////////////////////////////// // GENERIC SQL SOURCE ///////////////////////////////////////////////////////////////////////////// CSphSourceParams_SQL::CSphSourceParams_SQL () : m_iRangeStep ( 1024 ) , m_iRefRangeStep ( 1024 ) , m_bPrintQueries ( false ) , m_iRangedThrottle ( 0 ) , m_iMaxFileBufferSize ( 0 ) , m_eOnFileFieldError ( FFE_IGNORE_FIELD ) , m_iPort ( 0 ) { } const char * const CSphSource_SQL::MACRO_VALUES [ CSphSource_SQL::MACRO_COUNT ] = { "$start", "$end" }; CSphSource_SQL::CSphSource_SQL ( const char * sName ) : CSphSource_Document ( sName ) , m_bSqlConnected ( false ) , m_uMinID ( 0 ) , m_uMaxID ( 0 ) , m_uCurrentID ( 0 ) , m_uMaxFetchedID ( 0 ) , m_iMultiAttr ( -1 ) , m_iSqlFields ( 0 ) , m_iFieldMVA ( 0 ) , m_iFieldMVAIterator ( 0 ) , m_bCanUnpack ( false ) , m_bUnpackFailed ( false ) , m_bUnpackOverflow ( false ) , m_iJoinedHitField ( -1 ) , m_iJoinedHitID ( 0 ) , m_iJoinedHitPos ( 0 ) { } bool CSphSource_SQL::Setup ( const CSphSourceParams_SQL & tParams ) { // checks assert ( !tParams.m_sQuery.IsEmpty() ); m_tParams = tParams; // defaults #define LOC_FIX_NULL(_arg) if ( !m_tParams._arg.cstr() ) m_tParams._arg = ""; LOC_FIX_NULL ( m_sHost ); LOC_FIX_NULL ( m_sUser ); LOC_FIX_NULL ( m_sPass ); LOC_FIX_NULL ( m_sDB ); #undef LOC_FIX_NULL #define LOC_FIX_QARRAY(_arg) \ ARRAY_FOREACH ( i, m_tParams._arg ) \ if ( m_tParams._arg[i].IsEmpty() ) \ m_tParams._arg.Remove ( i-- ); LOC_FIX_QARRAY ( m_dQueryPre ); LOC_FIX_QARRAY ( m_dQueryPost ); LOC_FIX_QARRAY ( m_dQueryPostIndex ); #undef LOC_FIX_QARRAY // build and store default DSN for error reporting char sBuf [ 1024 ]; snprintf ( sBuf, sizeof(sBuf), "sql://%s:***@%s:%d/%s", m_tParams.m_sUser.cstr(), m_tParams.m_sHost.cstr(), m_tParams.m_iPort, m_tParams.m_sDB.cstr() ); m_sSqlDSN = sBuf; if ( m_tParams.m_iMaxFileBufferSize > 0 ) m_iMaxFileBufferSize = m_tParams.m_iMaxFileBufferSize; m_eOnFileFieldError = m_tParams.m_eOnFileFieldError; return true; } bool CSphSource_SQL::RunQueryStep ( const char * sQuery, CSphString & sError ) { sError = ""; if ( m_tParams.m_iRangeStep<=0 ) return false; if ( m_uCurrentID>m_uMaxID ) return false; static const int iBufSize = 32; char * sRes = NULL; sphSleepMsec ( m_tParams.m_iRangedThrottle ); ////////////////////////////////////////////// // range query with $start/$end interpolation ////////////////////////////////////////////// assert ( m_uMinID>0 ); assert ( m_uMaxID>0 ); assert ( m_uMinID<=m_uMaxID ); assert ( sQuery ); char sValues [ MACRO_COUNT ] [ iBufSize ]; SphDocID_t uNextID = Min ( m_uCurrentID + m_tParams.m_iRangeStep - 1, m_uMaxID ); snprintf ( sValues[0], iBufSize, DOCID_FMT, m_uCurrentID ); snprintf ( sValues[1], iBufSize, DOCID_FMT, uNextID ); g_iIndexerCurrentRangeMin = m_uCurrentID; g_iIndexerCurrentRangeMax = uNextID; m_uCurrentID = 1 + uNextID; // OPTIMIZE? things can be precalculated const char * sCur = sQuery; int iLen = 0; while ( *sCur ) { if ( *sCur=='$' ) { int i; for ( i=0; im_uMaxID ) LOC_ERROR2 ( "sql_query_range: min_id='%s', max_id='%s': min_id must be less than max_id", sCol0, sCol1 ); } SqlDismissResult (); return true; } /// issue main rows fetch query bool CSphSource_SQL::IterateStart ( CSphString & sError ) { assert ( m_bSqlConnected ); m_iNullIds = false; m_iMaxIds = false; // run pre-queries ARRAY_FOREACH ( i, m_tParams.m_dQueryPre ) { if ( !SqlQuery ( m_tParams.m_dQueryPre[i].cstr() ) ) { sError.SetSprintf ( "sql_query_pre[%d]: %s (DSN=%s)", i, SqlError(), m_sSqlDSN.cstr() ); SqlDisconnect (); return false; } SqlDismissResult (); } for ( ;; ) { m_tParams.m_iRangeStep = 0; // issue first fetch query if ( !m_tParams.m_sQueryRange.IsEmpty() ) { m_tParams.m_iRangeStep = m_tParams.m_iRefRangeStep; // run range-query; setup ranges if ( !SetupRanges ( m_tParams.m_sQueryRange.cstr(), m_tParams.m_sQuery.cstr(), "sql_query_range: ", sError ) ) return false; // issue query m_uCurrentID = m_uMinID; if ( !RunQueryStep ( m_tParams.m_sQuery.cstr(), sError ) ) return false; } else { // normal query; just issue if ( !SqlQuery ( m_tParams.m_sQuery.cstr() ) ) { sError.SetSprintf ( "sql_query: %s (DSN=%s)", SqlError(), m_sSqlDSN.cstr() ); return false; } } break; } // some post-query setup m_tSchema.Reset(); for ( int i=0; i dFound; dFound.Resize ( m_tParams.m_dAttrs.GetLength() ); ARRAY_FOREACH ( i, dFound ) dFound[i] = false; const bool bWordDict = m_pDict->GetSettings().m_bWordDict; // map plain attrs from SQL for ( int i=0; iSPH_MAX_FIELDS ) LOC_ERROR2 ( "too many fields (fields=%d, max=%d)", m_tSchema.m_dFields.GetLength(), SPH_MAX_FIELDS ); // log it if ( m_fpDumpRows ) { const char * sTable = m_tSchema.m_sName.cstr(); time_t iNow = time ( NULL ); fprintf ( m_fpDumpRows, "#\n# === source %s ts %d\n# %s#\n", sTable, (int)iNow, ctime ( &iNow ) ); ARRAY_FOREACH ( i, m_tSchema.m_dFields ) fprintf ( m_fpDumpRows, "# field %d: %s\n", i, m_tSchema.m_dFields[i].m_sName.cstr() ); for ( int i=0; i=m_tSchema.GetAttrsCount() ) return false; m_iMultiAttr = iAttr; const CSphColumnInfo & tAttr = m_tSchema.GetAttr(iAttr); if ( !(tAttr.m_eAttrType==SPH_ATTR_UINT32SET || tAttr.m_eAttrType==SPH_ATTR_UINT64SET ) ) return false; CSphString sPrefix; switch ( tAttr.m_eSrc ) { case SPH_ATTRSRC_FIELD: return false; case SPH_ATTRSRC_QUERY: // run simple query if ( !SqlQuery ( tAttr.m_sQuery.cstr() ) ) { sError.SetSprintf ( "multi-valued attr '%s' query failed: %s", tAttr.m_sName.cstr(), SqlError() ); return false; } break; case SPH_ATTRSRC_RANGEDQUERY: m_tParams.m_iRangeStep = m_tParams.m_iRefRangeStep; // setup ranges sPrefix.SetSprintf ( "multi-valued attr '%s' ranged query: ", tAttr.m_sName.cstr() ); if ( !SetupRanges ( tAttr.m_sQueryRange.cstr(), tAttr.m_sQuery.cstr(), sPrefix.cstr(), sError ) ) return false; // run first step (in order to report errors) m_uCurrentID = m_uMinID; if ( !RunQueryStep ( tAttr.m_sQuery.cstr(), sError ) ) return false; break; default: sError.SetSprintf ( "INTERNAL ERROR: unknown multi-valued attr source type %d", tAttr.m_eSrc ); return false; } // check fields count if ( SqlNumFields()!=2 ) { sError.SetSprintf ( "multi-valued attr '%s' query returned %d fields (expected 2)", tAttr.m_sName.cstr(), SqlNumFields() ); SqlDismissResult (); return false; } return true; } bool CSphSource_SQL::IterateMultivaluedNext () { const CSphColumnInfo & tAttr = m_tSchema.GetAttr ( m_iMultiAttr ); assert ( m_bSqlConnected ); assert ( tAttr.m_eAttrType==SPH_ATTR_UINT32SET || tAttr.m_eAttrType==SPH_ATTR_UINT64SET ); // fetch next row bool bGotRow = SqlFetchRow (); while ( !bGotRow ) { if ( SqlIsError() ) sphDie ( "sql_fetch_row: %s", SqlError() ); // FIXME! this should be reported if ( tAttr.m_eSrc!=SPH_ATTRSRC_RANGEDQUERY ) return false; CSphString sTmp; if ( !RunQueryStep ( tAttr.m_sQuery.cstr(), sTmp ) ) // FIXME! this should be reported return false; bGotRow = SqlFetchRow (); continue; } // return that tuple const CSphAttrLocator & tLoc = m_tSchema.GetAttr ( m_iMultiAttr ).m_tLocator; m_tDocInfo.m_iDocID = sphToDocid ( SqlColumn(0) ); if ( tAttr.m_eAttrType==SPH_ATTR_UINT32SET ) m_tDocInfo.SetAttr ( tLoc, sphToDword ( SqlColumn(1) ) ); else m_tDocInfo.SetAttr ( tLoc, sphToUint64 ( SqlColumn(1) ) ); return true; } bool CSphSource_SQL::IterateFieldMVAStart ( int iAttr, CSphString & ) { if ( iAttr<0 || iAttr>=m_tSchema.GetAttrsCount() ) return false; if ( m_dAttrToFieldMVA[iAttr]==-1 ) return false; m_iFieldMVA = iAttr; m_iFieldMVAIterator = 0; return true; } bool CSphSource_SQL::IterateFieldMVANext () { int iFieldMVA = m_dAttrToFieldMVA [m_iFieldMVA]; if ( m_iFieldMVAIterator>=m_dFieldMVAs[iFieldMVA].GetLength() ) return false; const CSphColumnInfo & tAttr = m_tSchema.GetAttr ( m_iFieldMVA ); m_tDocInfo.SetAttr ( tAttr.m_tLocator, m_dFieldMVAs[iFieldMVA][m_iFieldMVAIterator] ); ++m_iFieldMVAIterator; return true; } bool CSphSource_SQL::IterateKillListStart ( CSphString & sError ) { if ( m_tParams.m_sQueryKilllist.IsEmpty () ) return false; if ( !SqlQuery ( m_tParams.m_sQueryKilllist.cstr () ) ) { sError.SetSprintf ( "killlist query failed: %s", SqlError() ); return false; } return true; } bool CSphSource_SQL::IterateKillListNext ( SphDocID_t & tDocId ) { if ( SqlFetchRow () ) tDocId = sphToDocid ( SqlColumn(0) ); else { if ( SqlIsError() ) sphDie ( "sql_query_killlist: %s", SqlError() ); // FIXME! this should be reported else { SqlDismissResult (); return false; } } return true; } void CSphSource_SQL::ReportUnpackError ( int iIndex, int iError ) { if ( !m_bUnpackFailed ) { m_bUnpackFailed = true; sphWarn ( "failed to unpack column '%s', error=%d, docid=" DOCID_FMT, SqlFieldName(iIndex), iError, m_tDocInfo.m_iDocID ); } } #if !USE_ZLIB const char * CSphSource_SQL::SqlUnpackColumn ( int iFieldIndex, ESphUnpackFormat ) { return SqlColumn ( m_tSchema.m_dFields[iFieldIndex].m_iIndex ); } #else const char * CSphSource_SQL::SqlUnpackColumn ( int iFieldIndex, ESphUnpackFormat eFormat ) { int iIndex = m_tSchema.m_dFields[iFieldIndex].m_iIndex; const char * pData = SqlColumn(iIndex); if ( pData==NULL || pData[0]==0 ) return pData; CSphVector & tBuffer = m_dUnpackBuffers[iFieldIndex]; switch ( eFormat ) { case SPH_UNPACK_MYSQL_COMPRESS: { unsigned long uSize = 0; for ( int i=0; i<4; i++ ) uSize += (unsigned long)pData[i] << ( 8*i ); uSize &= 0x3FFFFFFF; if ( uSize > m_tParams.m_uUnpackMemoryLimit ) { if ( !m_bUnpackOverflow ) { m_bUnpackOverflow = true; sphWarn ( "failed to unpack '%s', column size limit exceeded (size=%d)", SqlFieldName(iIndex), (int)uSize ); } return NULL; } int iResult; tBuffer.Resize ( uSize + 1 ); iResult = uncompress ( (Bytef *)&tBuffer[0], &uSize, (Bytef *)pData + 4, SqlColumnLength(iIndex) ); if ( iResult==Z_OK ) { tBuffer[uSize] = 0; return &tBuffer[0]; } else ReportUnpackError ( iIndex, iResult ); return NULL; } case SPH_UNPACK_ZLIB: { char * sResult = 0; int iBufferOffset = 0; int iResult; z_stream tStream; tStream.zalloc = Z_NULL; tStream.zfree = Z_NULL; tStream.opaque = Z_NULL; tStream.avail_in = SqlColumnLength(iIndex); tStream.next_in = (Bytef *)SqlColumn(iIndex); iResult = inflateInit ( &tStream ); if ( iResult!=Z_OK ) return NULL; for ( ;; ) { tStream.next_out = (Bytef *)&tBuffer[iBufferOffset]; tStream.avail_out = tBuffer.GetLength() - iBufferOffset - 1; iResult = inflate ( &tStream, Z_NO_FLUSH ); if ( iResult==Z_STREAM_END ) { tBuffer [ tStream.total_out ] = 0; sResult = &tBuffer[0]; break; } else if ( iResult==Z_OK ) { assert ( tStream.avail_out==0 ); tBuffer.Resize ( tBuffer.GetLength()*2 ); iBufferOffset = tStream.total_out; } else { ReportUnpackError ( iIndex, iResult ); break; } } inflateEnd ( &tStream ); return sResult; } case SPH_UNPACK_NONE: return pData; } return NULL; } #endif // USE_ZLIB ISphHits * CSphSource_SQL::IterateJoinedHits ( CSphString & sError ) { m_tHits.m_dData.Resize ( 0 ); // eof check if ( m_iJoinedHitField>=m_tSchema.m_dFields.GetLength() ) { m_tDocInfo.m_iDocID = 0; return &m_tHits; } bool bProcessingRanged = true; // my fetch loop while ( m_iJoinedHitFieldm_tDocInfo.m_iDocID ) { sError.SetSprintf ( "joined field '%s': query MUST return document IDs in ASC order", m_tSchema.m_dFields[m_iJoinedHitField].m_sName.cstr() ); return NULL; } // next document? update tracker, reset position if ( m_iJoinedHitIDm_iWordPos ); if ( m_tState.m_bProcessingHits ) break; } else if ( SqlIsError() ) { // error while fetching row sError = SqlError(); return NULL; } else { int iLastField = m_iJoinedHitField; bool bRanged = ( m_iJoinedHitField>=m_tSchema.m_iBaseFields && m_iJoinedHitField=m_tSchema.m_dFields.GetLength() ) { m_tDocInfo.m_iDocID = ( m_tHits.Length() ? 1 : 0 ); // to eof or not to eof return &m_tHits; } SqlDismissResult (); bProcessingRanged = false; bool bCheckNumFields = true; CSphColumnInfo & tJoined = m_tSchema.m_dFields[m_iJoinedHitField]; // start fetching next field if ( tJoined.m_eSrc!=SPH_ATTRSRC_RANGEDQUERY ) { if ( !SqlQuery ( tJoined.m_sQuery.cstr() ) ) { sError = SqlError(); return NULL; } } else { m_tParams.m_iRangeStep = m_tParams.m_iRefRangeStep; // setup ranges for next field if ( iLastField!=m_iJoinedHitField ) { CSphString sPrefix; sPrefix.SetSprintf ( "joined field '%s' ranged query: ", tJoined.m_sName.cstr() ); if ( !SetupRanges ( tJoined.m_sQueryRange.cstr(), tJoined.m_sQuery.cstr(), sPrefix.cstr(), sError ) ) return NULL; m_uCurrentID = m_uMinID; } // run first step (in order to report errors) bool bRes = RunQueryStep ( tJoined.m_sQuery.cstr(), sError ); bProcessingRanged = bRes; // select next documents in range or loop once to process next field bCheckNumFields = bRes; if ( !sError.IsEmpty() ) return NULL; } const int iExpected = m_tSchema.m_dFields[m_iJoinedHitField].m_bPayload ? 3 : 2; if ( bCheckNumFields && SqlNumFields()!=iExpected ) { const char * sName = m_tSchema.m_dFields[m_iJoinedHitField].m_sName.cstr(); sError.SetSprintf ( "joined field '%s': query MUST return exactly %d columns, got %d", sName, iExpected, SqlNumFields() ); return NULL; } m_iJoinedHitID = 0; m_iJoinedHitPos = 0; } } return &m_tHits; } ///////////////////////////////////////////////////////////////////////////// // MYSQL SOURCE ///////////////////////////////////////////////////////////////////////////// #if USE_MYSQL CSphSourceParams_MySQL::CSphSourceParams_MySQL () : m_iFlags ( 0 ) { m_iPort = 3306; } CSphSource_MySQL::CSphSource_MySQL ( const char * sName ) : CSphSource_SQL ( sName ) , m_pMysqlResult ( NULL ) , m_pMysqlFields ( NULL ) , m_tMysqlRow ( NULL ) , m_pMysqlLengths ( NULL ) { m_bCanUnpack = true; } void CSphSource_MySQL::SqlDismissResult () { if ( !m_pMysqlResult ) return; while ( m_pMysqlResult ) { mysql_free_result ( m_pMysqlResult ); m_pMysqlResult = NULL; // stored procedures might return multiple result sets // FIXME? we might want to index all of them // but for now, let's simply dismiss additional result sets if ( mysql_next_result ( &m_tMysqlDriver )==0 ) { m_pMysqlResult = mysql_use_result ( &m_tMysqlDriver ); static bool bOnce = false; if ( !bOnce && m_pMysqlResult && mysql_num_rows ( m_pMysqlResult ) ) { sphWarn ( "indexing of multiple result sets is not supported yet; some results sets were dismissed!" ); bOnce = true; } } } m_pMysqlFields = NULL; m_pMysqlLengths = NULL; } bool CSphSource_MySQL::SqlQuery ( const char * sQuery ) { if ( mysql_query ( &m_tMysqlDriver, sQuery ) ) { if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-QUERY: %s: FAIL\n", sQuery ); return false; } if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-QUERY: %s: ok\n", sQuery ); m_pMysqlResult = mysql_use_result ( &m_tMysqlDriver ); m_pMysqlFields = NULL; return true; } bool CSphSource_MySQL::SqlIsError () { return mysql_errno ( &m_tMysqlDriver )!=0; } const char * CSphSource_MySQL::SqlError () { return mysql_error ( &m_tMysqlDriver ); } bool CSphSource_MySQL::SqlConnect () { mysql_init ( &m_tMysqlDriver ); if ( !m_sSslKey.IsEmpty() || !m_sSslCert.IsEmpty() || !m_sSslCA.IsEmpty() ) mysql_ssl_set ( &m_tMysqlDriver, m_sSslKey.cstr(), m_sSslCert.cstr(), m_sSslCA.cstr(), NULL, NULL ); m_iMysqlConnectFlags |= CLIENT_MULTI_RESULTS; // we now know how to handle this bool bRes = ( NULL!=mysql_real_connect ( &m_tMysqlDriver, m_tParams.m_sHost.cstr(), m_tParams.m_sUser.cstr(), m_tParams.m_sPass.cstr(), m_tParams.m_sDB.cstr(), m_tParams.m_iPort, m_sMysqlUsock.cstr(), m_iMysqlConnectFlags ) ); if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, bRes ? "SQL-CONNECT: ok\n" : "SQL-CONNECT: FAIL\n" ); return bRes; } void CSphSource_MySQL::SqlDisconnect () { if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-DISCONNECT\n" ); mysql_close ( &m_tMysqlDriver ); } int CSphSource_MySQL::SqlNumFields () { if ( !m_pMysqlResult ) return -1; return mysql_num_fields ( m_pMysqlResult ); } bool CSphSource_MySQL::SqlFetchRow () { if ( !m_pMysqlResult ) return false; m_tMysqlRow = mysql_fetch_row ( m_pMysqlResult ); return m_tMysqlRow!=NULL; } const char * CSphSource_MySQL::SqlColumn ( int iIndex ) { if ( !m_pMysqlResult ) return NULL; return m_tMysqlRow[iIndex]; } const char * CSphSource_MySQL::SqlFieldName ( int iIndex ) { if ( !m_pMysqlResult ) return NULL; if ( !m_pMysqlFields ) m_pMysqlFields = mysql_fetch_fields ( m_pMysqlResult ); return m_pMysqlFields[iIndex].name; } DWORD CSphSource_MySQL::SqlColumnLength ( int iIndex ) { if ( !m_pMysqlResult ) return 0; if ( !m_pMysqlLengths ) m_pMysqlLengths = mysql_fetch_lengths ( m_pMysqlResult ); return m_pMysqlLengths[iIndex]; } bool CSphSource_MySQL::Setup ( const CSphSourceParams_MySQL & tParams ) { if ( !CSphSource_SQL::Setup ( tParams ) ) return false; m_sMysqlUsock = tParams.m_sUsock; m_iMysqlConnectFlags = tParams.m_iFlags; m_sSslKey = tParams.m_sSslKey; m_sSslCert = tParams.m_sSslCert; m_sSslCA = tParams.m_sSslCA; // build and store DSN for error reporting char sBuf [ 1024 ]; snprintf ( sBuf, sizeof(sBuf), "mysql%s", m_sSqlDSN.cstr()+3 ); m_sSqlDSN = sBuf; return true; } #endif // USE_MYSQL ///////////////////////////////////////////////////////////////////////////// // PGSQL SOURCE ///////////////////////////////////////////////////////////////////////////// #if USE_PGSQL CSphSourceParams_PgSQL::CSphSourceParams_PgSQL () { m_iRangeStep = 1024; m_iPort = 5432; } CSphSource_PgSQL::CSphSource_PgSQL ( const char * sName ) : CSphSource_SQL ( sName ) , m_pPgResult ( NULL ) , m_iPgRows ( 0 ) , m_iPgRow ( 0 ) { } bool CSphSource_PgSQL::SqlIsError () { return ( m_iPgRow iBufLen ); m_pTag = NULL; m_iTagLength = 0; m_pPipe = NULL; m_pBuffer = NULL; m_pBufferEnd = NULL; m_sBuffer = new BYTE [m_iBufferSize]; if ( iBufLen ) memcpy ( m_sBuffer, dInitialBuf, iBufLen ); } CSphSource_XMLPipe::~CSphSource_XMLPipe () { Disconnect (); SafeDeleteArray ( m_sBuffer ); } void CSphSource_XMLPipe::Disconnect () { m_iInitialBufLen = 0; m_tHits.m_dData.Reset(); m_tSchema.Reset (); if ( m_pPipe ) { pclose ( m_pPipe ); m_pPipe = NULL; } } bool CSphSource_XMLPipe::Setup ( FILE * pPipe, const char * sCommand ) { assert ( sCommand ); m_pPipe = pPipe; m_sCommand = sCommand; return true; } bool CSphSource_XMLPipe::Connect ( CSphString & ) { m_bEOF = false; m_bWarned = false; m_tSchema.m_dFields.Reset (); m_tSchema.m_dFields.Add ( CSphColumnInfo ( "title" ) ); m_tSchema.m_dFields.Add ( CSphColumnInfo ( "body" ) ); CSphColumnInfo tGid ( "gid", SPH_ATTR_INTEGER ); CSphColumnInfo tTs ( "ts", SPH_ATTR_TIMESTAMP ); m_tSchema.AddAttr ( tGid, true ); // all attributes are dynamic at indexing time m_tSchema.AddAttr ( tTs, true ); // all attributes are dynamic at indexing time m_tDocInfo.Reset ( m_tSchema.GetRowSize() ); m_pBuffer = m_iInitialBufLen > 0 ? m_sBuffer : NULL; m_pBufferEnd = m_pBuffer ? m_pBuffer + m_iInitialBufLen : NULL; char sBuf [ 1024 ]; snprintf ( sBuf, sizeof(sBuf), "xmlpipe(%s)", m_sCommand.cstr() ); m_tSchema.m_sName = sBuf; m_tHits.m_dData.Reserve ( MAX_SOURCE_HITS ); return true; } bool CSphSource_XMLPipe::IterateDocument ( CSphString & sError ) { PROFILE ( src_xmlpipe ); char sTitle [ 1024 ]; // FIXME? assert ( m_pPipe ); assert ( m_pTokenizer ); m_tHits.m_dData.Resize ( 0 ); m_bHitsReady = false; ///////////////////////// // parse document header ///////////////////////// // check for eof if ( !SkipWhitespace() ) { m_tDocInfo.m_iDocID = 0; return true; } // look for opening '' tag SetTag ( "document" ); if ( !SkipTag ( true, sError ) ) return false; if ( !ScanInt ( "id", &m_tDocInfo.m_iDocID, sError ) ) return false; m_tStats.m_iTotalDocuments++; SphAttr_t uVal; if ( !ScanInt ( "group", &uVal, sError ) ) uVal = 1; m_tDocInfo.SetAttr ( m_tSchema.GetAttr(0).m_tLocator, uVal ); if ( !ScanInt ( "timestamp", &uVal, sError ) ) uVal = 1; m_tDocInfo.SetAttr ( m_tSchema.GetAttr(1).m_tLocator, uVal ); if ( !ScanStr ( "title", sTitle, sizeof(sTitle), sError ) ) return false; // index title { int iLen = (int)strlen ( sTitle ); Hitpos_t iPos = HITMAN::Create ( 0, 1 ); BYTE * sWord; m_pTokenizer->SetBuffer ( (BYTE*)sTitle, iLen ); while ( ( sWord = m_pTokenizer->GetToken() )!=NULL && m_tHits.Length()GetWordID ( sWord ), iPos ); HITMAN::AddPos ( &iPos, 1 ); } } CheckHitsCount ( "title" ); SetTag ( "body" ); if ( !SkipTag ( true, sError ) ) return false; m_iWordPos = 0; ///////////////////////////// // parse body chunk by chunk ///////////////////////////// // check for body tag end in this buffer const char * szBodyEnd = ""; bool bFirstPass = true; bool bBodyEnd = false; BYTE * p = m_pBuffer; while ( !bBodyEnd ) { p = m_pBuffer; while ( pSetBuffer ( m_pBuffer, p-m_pBuffer ); // tokenize BYTE * sWord; while ( ( sWord = m_pTokenizer->GetToken () )!=NULL && m_tHits.Length()GetWordID ( sWord ), HITMAN::Create ( 1, ++m_iWordPos ) ); CheckHitsCount ( "body" ); m_pBuffer = p; SetTag ( "body" ); // some tag was found if ( bBodyEnd ) { // let's check if it's '' which is the only allowed tag at this point if ( !SkipTag ( false, sError ) ) return false; } else { // search for '' tag bool bFound = false; while ( !bFound ) { while ( m_pBuffer < m_pBufferEnd && *m_pBuffer!='<' ) ++m_pBuffer; BYTE * pBufferTmp = m_pBuffer; if ( m_pBuffer < m_pBufferEnd ) { if ( !SkipTag ( false, sError ) ) { if ( m_bEOF ) return false; else { if ( m_pBuffer==pBufferTmp ) m_pBuffer = pBufferTmp + 1; } } else bFound = true; } else if ( !UpdateBuffer () ) return false; } } // let's check if it's '' which is the only allowed tag at this point SetTag ( "document" ); if ( !SkipTag ( false, sError ) ) return false; // if it was all correct, we have to flush our hits m_bHitsReady = m_tHits.Length()>0; return true; } ISphHits * CSphSource_XMLPipe::IterateHits ( CSphString & ) { if ( !m_bHitsReady ) return NULL; m_bHitsReady = false; return &m_tHits; } void CSphSource_XMLPipe::SetTag ( const char * sTag ) { m_pTag = sTag; m_iTagLength = (int)strlen ( sTag ); } bool CSphSource_XMLPipe::UpdateBuffer () { assert ( m_pBuffer!=m_sBuffer ); int iLeft = Max ( m_pBufferEnd-m_pBuffer, 0 ); if ( iLeft>0 ) memmove ( m_sBuffer, m_pBuffer, iLeft ); size_t iLen = fread ( &m_sBuffer [ iLeft ], 1, m_iBufferSize-iLeft, m_pPipe ); m_tStats.m_iTotalBytes += iLen; m_pBuffer = m_sBuffer; m_pBufferEnd = m_pBuffer+iLeft+iLen; return ( iLen!=0 ); } bool CSphSource_XMLPipe::SkipWhitespace () { for ( ;; ) { // suck in some data if needed if ( m_pBuffer>=m_pBufferEnd ) if ( !UpdateBuffer() ) return false; // skip whitespace while ( (m_pBuffer', got EOF", bOpen ? "" : "/", m_pTag ); return false; } // check tag bool bOk = bOpen ? ( ( m_pBuffer[0]=='<' ) && ( m_pBuffer[m_iTagLength+1]=='>' ) && strncmp ( (char*)(m_pBuffer+1), m_pTag, m_iTagLength )==0 ) : ( ( m_pBuffer[0]=='<' ) && ( m_pBuffer[1]=='/' ) && ( m_pBuffer[m_iTagLength+2]=='>' ) && strncmp ( (char*)(m_pBuffer+2), m_pTag, m_iTagLength )==0 ); if ( !bOk ) { char sGot[64]; int iCopy = Min ( m_pBufferEnd-m_pBuffer, (int)sizeof(sGot)-1 ); strncpy ( sGot, (char*)m_pBuffer, iCopy ); sGot [ iCopy ] = '\0'; sError.SetSprintf ( "xmlpipe: expected '<%s%s>', got '%s'", bOpen ? "" : "/", m_pTag, sGot ); return false; } // got tag m_pBuffer += iAdd+m_iTagLength; assert ( m_pBuffer<=m_pBufferEnd ); return true; } bool CSphSource_XMLPipe::SkipTag ( bool bOpen, CSphString & sError ) { if ( !SkipWhitespace() ) { m_bEOF = true; sError.SetSprintf ( "xmlpipe: expected '<%s%s>', got EOF", bOpen ? "" : "/", m_pTag ); return false; } return CheckTag ( bOpen, sError ); } bool CSphSource_XMLPipe::ScanInt ( const char * sTag, DWORD * pRes, CSphString & sError ) { uint64_t uRes; if ( !ScanInt ( sTag, &uRes, sError ) ) return false; (*pRes) = (DWORD)uRes; return true; } bool CSphSource_XMLPipe::ScanInt ( const char * sTag, uint64_t * pRes, CSphString & sError ) { assert ( sTag ); assert ( pRes ); // scan for SetTag ( sTag ); if ( !SkipTag ( true, sError ) ) return false; if ( !SkipWhitespace() ) { sError.SetSprintf ( "xmlpipe: expected <%s> data, got EOF", m_pTag ); return false; } *pRes = 0; while ( m_pBuffer if ( !SkipTag ( false, sError ) ) return false; return true; } bool CSphSource_XMLPipe::ScanStr ( const char * sTag, char * pRes, int iMaxLength, CSphString & sError ) { assert ( sTag ); assert ( pRes ); char * pEnd = pRes+iMaxLength-1; // scan for SetTag ( sTag ); if ( !SkipTag ( true, sError ) ) return false; if ( !SkipWhitespace() ) { sError.SetSprintf ( "xmlpipe: expected <%s> data, got EOF", m_pTag ); return false; } while ( m_pBuffer if ( !SkipTag ( false, sError ) ) return false; return true; } void CSphSource_XMLPipe::CheckHitsCount ( const char * sField ) { if ( m_tHits.Length()>=MAX_SOURCE_HITS && m_pTokenizer->GetTokenEnd()!=m_pTokenizer->GetBufferEnd() ) sphWarn ( "xmlpipe: collected hits larger than %d(MAX_SOURCE_HITS) while scanning docid=" DOCID_FMT " %s - clipped!!!", MAX_SOURCE_HITS, m_tDocInfo.m_iDocID, sField ); } ///////////////////////////////////////////////////////////////////////////// // XMLPIPE (v2) ///////////////////////////////////////////////////////////////////////////// #if USE_LIBEXPAT || USE_LIBXML /// XML pipe source implementation (v2) class CSphSource_XMLPipe2 : public CSphSource_Document { public: CSphSource_XMLPipe2 ( BYTE * dInitialBuf, int iBufLen, const char * sName, int iFieldBufferMax, bool bFixupUTF8 ); ~CSphSource_XMLPipe2 (); bool Setup ( FILE * pPipe, const CSphConfigSection & hSource ); ///< memorize the command virtual bool Connect ( CSphString & sError ); ///< run the command and open the pipe virtual void Disconnect (); ///< close the pipe virtual bool IterateStart ( CSphString & ) { return true; } ///< Connect() starts getting documents automatically, so this one is empty virtual BYTE ** NextDocument ( CSphString & sError ); ///< parse incoming chunk and emit some hits virtual bool HasAttrsConfigured () { return true; } ///< xmlpipe always has some attrs for now virtual bool IterateMultivaluedStart ( int, CSphString & ) { return false; } virtual bool IterateMultivaluedNext () { return false; } virtual bool IterateFieldMVAStart ( int iAttr, CSphString & sError ); virtual bool IterateFieldMVANext (); virtual bool IterateKillListStart ( CSphString & ); virtual bool IterateKillListNext ( SphDocID_t & tDocId ); void StartElement ( const char * szName, const char ** pAttrs ); void EndElement ( const char * pName ); void Characters ( const char * pCharacters, int iLen ); #if USE_LIBXML int ReadBuffer ( BYTE * pBuffer, int iLen ); void ProcessNode ( xmlTextReaderPtr pReader ); #endif void Error ( const char * sTemplate, ... ) __attribute__ ( ( format ( printf, 2, 3 ) ) ); private: struct Document_t { SphDocID_t m_iDocID; CSphVector m_dFields; CSphVector m_dAttrs; }; Document_t * m_pCurDocument; CSphVector m_dParsedDocuments; FILE * m_pPipe; ///< incoming stream CSphString m_sCommand; ///< my command CSphString m_sError; CSphVector m_dDefaultAttrs; CSphVector m_dInvalid; CSphVector m_dWarned; int m_iElementDepth; BYTE * m_pBuffer; int m_iBufferSize; CSphVectorm_dFieldPtrs; bool m_bRemoveParsed; bool m_bInDocset; bool m_bInSchema; bool m_bInDocument; bool m_bInKillList; bool m_bInId; bool m_bInIgnoredTag; bool m_bFirstTagAfterDocset; int m_iKillListIterator; CSphVector < SphDocID_t > m_dKillList; int m_iMVA; int m_iMVAIterator; CSphVector < CSphVector > m_dFieldMVAs; CSphVector < int > m_dAttrToMVA; int m_iCurField; int m_iCurAttr; #if USE_LIBEXPAT XML_Parser m_pParser; #endif #if USE_LIBXML xmlTextReaderPtr m_pParser; BYTE * m_pBufferPtr; BYTE * m_pBufferEnd; bool m_bPassedBufferEnd; CSphVector m_dAttrs; #endif int m_iInitialBufSize; int m_iFieldBufferMax; BYTE * m_pFieldBuffer; int m_iFieldBufferLen; bool m_bFixupUTF8; ///< whether to replace invalid utf-8 codepoints with spaces int m_iReparseStart; ///< utf-8 fixerupper might need to postpone a few bytes, starting at this offset int m_iReparseLen; ///< and this much bytes (under 4) const char * DecorateMessage ( const char * sTemplate, ... ) __attribute__ ( ( format ( printf, 2, 3 ) ) ); const char * DecorateMessageVA ( const char * sTemplate, va_list ap ); void ConfigureAttrs ( const CSphVariant * pHead, ESphAttr eAttrType ); void ConfigureFields ( const CSphVariant * pHead ); void AddFieldToSchema ( const char * szName ); void UnexpectedCharaters ( const char * pCharacters, int iLen, const char * szComment ); #if USE_LIBEXPAT bool ParseNextChunk ( int iBufferLen, CSphString & sError ); #endif #if USE_LIBXML int ParseNextChunk ( CSphString & sError ); #endif void DocumentError ( const char * sWhere ) { Error ( "malformed source, found inside %s", sWhere ); // Ideally I'd like to display a notice on the next line that // would say where exactly it's allowed. E.g.: // // must be contained in } }; #if USE_LIBEXPAT // callbacks static void XMLCALL xmlStartElement ( void * user_data, const XML_Char * name, const XML_Char ** attrs ) { CSphSource_XMLPipe2 * pSource = (CSphSource_XMLPipe2 *) user_data; pSource->StartElement ( name, attrs ); } static void XMLCALL xmlEndElement ( void * user_data, const XML_Char * name ) { CSphSource_XMLPipe2 * pSource = (CSphSource_XMLPipe2 *) user_data; pSource->EndElement ( name ); } static void XMLCALL xmlCharacters ( void * user_data, const XML_Char * ch, int len ) { CSphSource_XMLPipe2 * pSource = (CSphSource_XMLPipe2 *) user_data; pSource->Characters ( ch, len ); } #if USE_LIBICONV static int XMLCALL xmlUnknownEncoding ( void *, const XML_Char * name, XML_Encoding * info ) { iconv_t pDesc = iconv_open ( "UTF-16", name ); if ( !pDesc ) return XML_STATUS_ERROR; for ( size_t i = 0; i < 256; i++ ) { char cIn = (char) i; char dOut[4]; memset ( dOut, 0, sizeof ( dOut ) ); #if ICONV_INBUF_CONST const char * pInbuf = &cIn; #else char * pInbuf = &cIn; #endif char * pOutbuf = dOut; size_t iInBytesLeft = 1; size_t iOutBytesLeft = 4; if ( iconv ( pDesc, &pInbuf, &iInBytesLeft, &pOutbuf, &iOutBytesLeft )!=size_t(-1) ) info->map[i] = int ( BYTE ( dOut[0] ) ) << 8 | int ( BYTE ( dOut[1] ) ); else info->map[i] = 0; } iconv_close ( pDesc ); return XML_STATUS_OK; } #endif #endif #if USE_LIBXML int xmlReadBuffers ( void * context, char * buffer, int len ) { CSphSource_XMLPipe2 * pSource = (CSphSource_XMLPipe2 *) context; return pSource->ReadBuffer ( (BYTE*)buffer, len ); } void xmlErrorHandler ( void * arg, const char * msg, xmlParserSeverities severity, xmlTextReaderLocatorPtr locator ) { if ( severity==XML_PARSER_SEVERITY_ERROR ) { int iLine = xmlTextReaderLocatorLineNumber ( locator ); CSphSource_XMLPipe2 * pSource = (CSphSource_XMLPipe2 *) arg; pSource->Error ( "%s (line=%d)", msg, iLine ); } } #endif CSphSource_XMLPipe2::CSphSource_XMLPipe2 ( BYTE * dInitialBuf, int iBufLen, const char * sName, int iFieldBufferMax, bool bFixupUTF8 ) : CSphSource_Document ( sName ) , m_pCurDocument ( NULL ) , m_pPipe ( NULL ) , m_iElementDepth ( 0 ) , m_iBufferSize ( 1048576 ) , m_bRemoveParsed ( false ) , m_bInDocset ( false ) , m_bInSchema ( false ) , m_bInDocument ( false ) , m_bInKillList ( false ) , m_bInId ( false ) , m_bInIgnoredTag ( false ) , m_bFirstTagAfterDocset ( false ) , m_iKillListIterator ( 0 ) , m_iMVA ( 0 ) , m_iMVAIterator ( 0 ) , m_iCurField ( -1 ) , m_iCurAttr ( -1 ) , m_pParser ( NULL ) #if USE_LIBXML , m_pBufferPtr ( NULL ) , m_pBufferEnd ( NULL ) , m_bPassedBufferEnd ( false ) #endif , m_iInitialBufSize ( iBufLen ) , m_iFieldBufferLen ( 0 ) , m_bFixupUTF8 ( bFixupUTF8 ) , m_iReparseStart ( 0 ) , m_iReparseLen ( 0 ) { assert ( m_iBufferSize > iBufLen ); m_pBuffer = new BYTE [m_iBufferSize]; m_iFieldBufferMax = Max ( iFieldBufferMax, 65536 ); m_pFieldBuffer = new BYTE [ m_iFieldBufferMax ]; if ( iBufLen ) memcpy ( m_pBuffer, dInitialBuf, iBufLen ); m_iInitialBufSize = iBufLen; } CSphSource_XMLPipe2::~CSphSource_XMLPipe2 () { Disconnect (); SafeDeleteArray ( m_pBuffer ); SafeDeleteArray ( m_pFieldBuffer ); ARRAY_FOREACH ( i, m_dParsedDocuments ) SafeDelete ( m_dParsedDocuments[i] ); } void CSphSource_XMLPipe2::Disconnect () { if ( m_pPipe ) { pclose ( m_pPipe ); m_pPipe = NULL; } #if USE_LIBEXPAT if ( m_pParser ) { XML_ParserFree ( m_pParser ); m_pParser = NULL; } #endif #if USE_LIBXML if ( m_pParser ) { xmlFreeTextReader ( m_pParser ); m_pParser = NULL; } #endif m_tHits.m_dData.Reset(); m_iInitialBufSize = 0; } void CSphSource_XMLPipe2::Error ( const char * sTemplate, ... ) { if ( !m_sError.IsEmpty() ) return; va_list ap; va_start ( ap, sTemplate ); m_sError = DecorateMessageVA ( sTemplate, ap ); va_end ( ap ); } const char * CSphSource_XMLPipe2::DecorateMessage ( const char * sTemplate, ... ) { va_list ap; va_start ( ap, sTemplate ); const char * sRes = DecorateMessageVA ( sTemplate, ap ); va_end ( ap ); return sRes; } const char * CSphSource_XMLPipe2::DecorateMessageVA ( const char * sTemplate, va_list ap ) { static char sBuf[1024]; snprintf ( sBuf, sizeof(sBuf), "source '%s': ", m_tSchema.m_sName.cstr() ); int iBufLen = strlen ( sBuf ); int iLeft = sizeof(sBuf) - iBufLen; char * szBufStart = sBuf + iBufLen; vsnprintf ( szBufStart, iLeft, sTemplate, ap ); iBufLen = strlen ( sBuf ); iLeft = sizeof(sBuf) - iBufLen; szBufStart = sBuf + iBufLen; #if USE_LIBEXPAT if ( m_pParser ) { SphDocID_t uFailedID = 0; if ( m_dParsedDocuments.GetLength() ) uFailedID = m_dParsedDocuments.Last()->m_iDocID; snprintf ( szBufStart, iLeft, " (line=%d, pos=%d, docid=" DOCID_FMT ")", (int)XML_GetCurrentLineNumber ( m_pParser ), (int)XML_GetCurrentColumnNumber ( m_pParser ), uFailedID ); } #endif #if USE_LIBXML if ( m_pParser ) { SphDocID_t uFailedID = 0; if ( m_dParsedDocuments.GetLength() ) uFailedID = m_dParsedDocuments.Last()->m_iDocID; snprintf ( szBufStart, iLeft, " (docid=" DOCID_FMT ")", uFailedID ); } #endif return sBuf; } void CSphSource_XMLPipe2::AddFieldToSchema ( const char * szName ) { CSphColumnInfo tCol ( szName ); tCol.m_eWordpart = GetWordpart ( tCol.m_sName.cstr(), m_pDict && m_pDict->GetSettings().m_bWordDict ); m_tSchema.m_dFields.Add ( tCol ); } void CSphSource_XMLPipe2::ConfigureAttrs ( const CSphVariant * pHead, ESphAttr eAttrType ) { for ( const CSphVariant * pCur = pHead; pCur; pCur= pCur->m_pNext ) { CSphColumnInfo tCol ( pCur->cstr(), eAttrType ); char * pColon = strchr ( const_cast ( tCol.m_sName.cstr() ), ':' ); if ( pColon ) { *pColon = '\0'; if ( eAttrType==SPH_ATTR_INTEGER ) { int iBits = strtol ( pColon+1, NULL, 10 ); if ( iBits<=0 || iBits>ROWITEM_BITS ) { sphWarn ( "%s", DecorateMessage ( "attribute '%s': invalid bitcount=%d (bitcount ignored)", tCol.m_sName.cstr(), iBits ) ); iBits = -1; } tCol.m_tLocator.m_iBitCount = iBits; } else sphWarn ( "%s", DecorateMessage ( "attribute '%s': bitcount is only supported for integer types", tCol.m_sName.cstr() ) ); } tCol.m_iIndex = m_tSchema.GetAttrsCount (); if ( eAttrType==SPH_ATTR_UINT32SET || eAttrType==SPH_ATTR_UINT64SET ) { tCol.m_eAttrType = eAttrType; tCol.m_eSrc = SPH_ATTRSRC_FIELD; } m_tSchema.AddAttr ( tCol, true ); // all attributes are dynamic at indexing time } } void CSphSource_XMLPipe2::ConfigureFields ( const CSphVariant * pHead ) { for ( const CSphVariant * pCur = pHead; pCur; pCur= pCur->m_pNext ) { CSphString sFieldName = pCur->cstr (); bool bFound = false; for ( int i = 0; i < m_tSchema.m_dFields.GetLength () && !bFound; i++ ) bFound = m_tSchema.m_dFields[i].m_sName==sFieldName; if ( bFound ) sphWarn ( "%s", DecorateMessage ( "duplicate field '%s'", sFieldName.cstr () ) ); else AddFieldToSchema ( sFieldName.cstr () ); } } bool CSphSource_XMLPipe2::Setup ( FILE * pPipe, const CSphConfigSection & hSource ) { m_pPipe = pPipe; m_tSchema.Reset (); m_sCommand = hSource["xmlpipe_command"].cstr (); ConfigureAttrs ( hSource("xmlpipe_attr_uint"), SPH_ATTR_INTEGER ); ConfigureAttrs ( hSource("xmlpipe_attr_timestamp"), SPH_ATTR_TIMESTAMP ); ConfigureAttrs ( hSource("xmlpipe_attr_str2ordinal"), SPH_ATTR_ORDINAL ); ConfigureAttrs ( hSource("xmlpipe_attr_bool"), SPH_ATTR_BOOL ); ConfigureAttrs ( hSource("xmlpipe_attr_float"), SPH_ATTR_FLOAT ); ConfigureAttrs ( hSource("xmlpipe_attr_bigint"), SPH_ATTR_BIGINT ); ConfigureAttrs ( hSource("xmlpipe_attr_multi"), SPH_ATTR_UINT32SET ); ConfigureAttrs ( hSource("xmlpipe_attr_multi_64"), SPH_ATTR_UINT64SET ); ConfigureAttrs ( hSource("xmlpipe_attr_string"), SPH_ATTR_STRING ); ConfigureAttrs ( hSource("xmlpipe_attr_wordcount"), SPH_ATTR_WORDCOUNT ); ConfigureAttrs ( hSource("xmlpipe_field_string"), SPH_ATTR_STRING ); ConfigureAttrs ( hSource("xmlpipe_field_wordcount"), SPH_ATTR_WORDCOUNT ); m_tDocInfo.Reset ( m_tSchema.GetRowSize () ); ConfigureFields ( hSource("xmlpipe_field") ); ConfigureFields ( hSource("xmlpipe_field_string") ); ConfigureFields ( hSource("xmlpipe_field_wordcount") ); m_dStrAttrs.Resize ( m_tSchema.GetAttrsCount() ); return true; } bool CSphSource_XMLPipe2::Connect ( CSphString & sError ) { ARRAY_FOREACH ( i, m_tSchema.m_dFields ) { CSphColumnInfo & tCol = m_tSchema.m_dFields[i]; tCol.m_eWordpart = GetWordpart ( tCol.m_sName.cstr(), m_pDict && m_pDict->GetSettings().m_bWordDict ); } #if USE_LIBEXPAT m_pParser = XML_ParserCreate(NULL); if ( !m_pParser ) { sError.SetSprintf ( "xmlpipe: failed to create XML parser" ); return false; } XML_SetUserData ( m_pParser, this ); XML_SetElementHandler ( m_pParser, xmlStartElement, xmlEndElement ); XML_SetCharacterDataHandler ( m_pParser, xmlCharacters ); #if USE_LIBICONV XML_SetUnknownEncodingHandler ( m_pParser, xmlUnknownEncoding, NULL ); #endif #endif #if USE_LIBXML m_pBufferPtr = m_pBuffer; m_pBufferEnd = m_pBuffer + m_iInitialBufSize; m_bPassedBufferEnd = false; m_dAttrs.Reserve ( 16 ); m_dAttrs.Resize ( 0 ); m_pParser = xmlReaderForIO ( (xmlInputReadCallback)xmlReadBuffers, NULL, this, NULL, NULL, 0 ); if ( !m_pParser ) { sError.SetSprintf ( "xmlpipe: failed to create XML parser" ); return false; } xmlTextReaderSetErrorHandler ( m_pParser, xmlErrorHandler, this ); #endif m_dKillList.Reserve ( 1024 ); m_dKillList.Resize ( 0 ); m_bRemoveParsed = false; m_bInDocset = false; m_bInSchema = false; m_bInDocument = false; m_bInKillList = false; m_bInId = false; m_bFirstTagAfterDocset = false; m_iCurField = -1; m_iCurAttr = -1; m_iElementDepth = 0; m_dParsedDocuments.Reset (); m_dDefaultAttrs.Reset (); m_dInvalid.Reset (); m_dWarned.Reset (); m_dParsedDocuments.Reserve ( 1024 ); m_dParsedDocuments.Resize ( 0 ); m_iKillListIterator = 0; m_iMVA = 0; m_iMVAIterator = 0; m_sError = ""; #if USE_LIBEXPAT int iBytesRead = m_iInitialBufSize; iBytesRead += fread ( m_pBuffer + m_iInitialBufSize, 1, m_iBufferSize - m_iInitialBufSize, m_pPipe ); if ( !ParseNextChunk ( iBytesRead, sError ) ) return false; #endif #if USE_LIBXML if ( ParseNextChunk ( sError )==-1 ) return false; #endif m_dAttrToMVA.Resize ( 0 ); int iFieldMVA = 0; for ( int i = 0; i < m_tSchema.GetAttrsCount (); i++ ) { const CSphColumnInfo & tCol = m_tSchema.GetAttr ( i ); if ( ( tCol.m_eAttrType==SPH_ATTR_UINT32SET || tCol.m_eAttrType==SPH_ATTR_UINT64SET ) && tCol.m_eSrc==SPH_ATTRSRC_FIELD ) m_dAttrToMVA.Add ( iFieldMVA++ ); else m_dAttrToMVA.Add ( -1 ); } m_dFieldMVAs.Resize ( iFieldMVA ); ARRAY_FOREACH ( i, m_dFieldMVAs ) m_dFieldMVAs[i].Reserve ( 16 ); m_tHits.m_dData.Reserve ( m_iMaxHits ); return true; } #if USE_LIBXML int CSphSource_XMLPipe2::ParseNextChunk ( CSphString & sError ) { int iRet = xmlTextReaderRead ( m_pParser ); while ( iRet==1 ) { ProcessNode ( m_pParser ); if ( !m_sError.IsEmpty () ) { sError = m_sError; m_tDocInfo.m_iDocID = 1; return false; } if ( m_bPassedBufferEnd ) break; iRet = xmlTextReaderRead ( m_pParser ); } m_bPassedBufferEnd = false; if ( !m_sError.IsEmpty () || iRet==-1 ) { sError = m_sError; m_tDocInfo.m_iDocID = 1; return -1; } return iRet; } #endif #if USE_LIBEXPAT bool CSphSource_XMLPipe2::ParseNextChunk ( int iBufferLen, CSphString & sError ) { if ( !iBufferLen ) return true; bool bLast = ( iBufferLen!=m_iBufferSize ); m_iReparseLen = 0; if ( m_bFixupUTF8 ) { BYTE * p = m_pBuffer; BYTE * pMax = m_pBuffer + iBufferLen; while ( p3 ) { *p++ = ' '; continue; } // if we're on a boundary, save these few bytes for the future if ( p+iBytes>pMax ) { m_iReparseStart = (int)(p-m_pBuffer); m_iReparseLen = (int)(pMax-p); iBufferLen -= m_iReparseLen; break; } // otherwise (not a boundary), check them all int i = 1; int iVal = ( v >> iBytes ); for ( ; i=0xd800 && iVal<=0xdfff ) // and utf-16 surrogate pairs || ( iBytes==3 && iVal<0x800 ) // and overlong 3-byte codes || ( iVal>=0xfff0 && iVal<=0xffff ) ) // and kinda-valid specials expat chokes on anyway { for ( i=0; im_iDocID; sError.SetSprintf ( "source '%s': XML parse error: %s (line=%d, pos=%d, docid=" DOCID_FMT ")", m_tSchema.m_sName.cstr(), XML_ErrorString ( XML_GetErrorCode ( m_pParser ) ), (int)XML_GetCurrentLineNumber ( m_pParser ), (int)XML_GetCurrentColumnNumber ( m_pParser ), uFailedID ); m_tDocInfo.m_iDocID = 1; return false; } if ( !m_sError.IsEmpty () ) { sError = m_sError; m_tDocInfo.m_iDocID = 1; return false; } return true; } #endif BYTE ** CSphSource_XMLPipe2::NextDocument ( CSphString & sError ) { if ( m_bRemoveParsed ) { SafeDelete ( m_dParsedDocuments[0] ); m_dParsedDocuments.RemoveFast ( 0 ); m_bRemoveParsed = false; } int iReadResult = 0; #if USE_LIBEXPAT while ( m_dParsedDocuments.GetLength()==0 ) { // saved bytes to the front! if ( m_iReparseLen ) memmove ( m_pBuffer, m_pBuffer+m_iReparseStart, m_iReparseLen ); // read more data iReadResult = fread ( m_pBuffer+m_iReparseLen, 1, m_iBufferSize-m_iReparseLen, m_pPipe ); if ( iReadResult==0 ) break; // and parse it if ( !ParseNextChunk ( iReadResult+m_iReparseLen, sError ) ) return NULL; } #endif #if USE_LIBXML while ( m_dParsedDocuments.GetLength()==0 && ( iReadResult = ParseNextChunk ( sError ) )==1 ); #endif while ( m_dParsedDocuments.GetLength()!=0 ) { Document_t * pDocument = m_dParsedDocuments[0]; int nAttrs = m_tSchema.GetAttrsCount (); // docid m_tDocInfo.m_iDocID = VerifyID ( pDocument->m_iDocID ); if ( m_tDocInfo.m_iDocID==0 ) { SafeDelete ( m_dParsedDocuments[0] ); m_dParsedDocuments.RemoveFast ( 0 ); continue; } // attributes int iFieldMVA = 0; for ( int i = 0; i < nAttrs; i++ ) { const CSphString & sAttrValue = pDocument->m_dAttrs[i].IsEmpty () && m_dDefaultAttrs.GetLength () ? m_dDefaultAttrs[i] : pDocument->m_dAttrs[i]; const CSphColumnInfo & tAttr = m_tSchema.GetAttr ( i ); if ( tAttr.m_eAttrType==SPH_ATTR_UINT32SET || tAttr.m_eAttrType==SPH_ATTR_UINT64SET ) { m_tDocInfo.SetAttr ( tAttr.m_tLocator, 0 ); ParseFieldMVA ( m_dFieldMVAs, iFieldMVA++, sAttrValue.cstr () ); continue; } switch ( tAttr.m_eAttrType ) { case SPH_ATTR_ORDINAL: case SPH_ATTR_STRING: case SPH_ATTR_WORDCOUNT: m_dStrAttrs[i] = sAttrValue.cstr (); if ( !m_dStrAttrs[i].cstr() ) m_dStrAttrs[i] = ""; m_tDocInfo.SetAttr ( tAttr.m_tLocator, 0 ); break; case SPH_ATTR_FLOAT: m_tDocInfo.SetAttrFloat ( tAttr.m_tLocator, sphToFloat ( sAttrValue.cstr () ) ); break; case SPH_ATTR_BIGINT: m_tDocInfo.SetAttr ( tAttr.m_tLocator, sphToInt64 ( sAttrValue.cstr () ) ); break; default: m_tDocInfo.SetAttr ( tAttr.m_tLocator, sphToDword ( sAttrValue.cstr () ) ); break; } } m_bRemoveParsed = true; int nFields = m_tSchema.m_dFields.GetLength (); if ( !nFields ) { m_tDocInfo.m_iDocID = 0; return NULL; } m_dFieldPtrs.Resize ( nFields ); for ( int i = 0; i < nFields; ++i ) m_dFieldPtrs[i] = (BYTE*)( pDocument->m_dFields [i].cstr() ); return (BYTE **)&( m_dFieldPtrs[0] ); } if ( !iReadResult ) m_tDocInfo.m_iDocID = 0; return NULL; } bool CSphSource_XMLPipe2::IterateFieldMVAStart ( int iAttr, CSphString & ) { if ( iAttr<0 || iAttr>=m_tSchema.GetAttrsCount() ) return false; if ( m_dAttrToMVA[iAttr]==-1 ) return false; m_iMVA = iAttr; m_iMVAIterator = 0; return true; } bool CSphSource_XMLPipe2::IterateFieldMVANext () { int iFieldMVA = m_dAttrToMVA [m_iMVA]; if ( m_iMVAIterator>=m_dFieldMVAs[iFieldMVA].GetLength() ) return false; const CSphColumnInfo & tAttr = m_tSchema.GetAttr ( m_iMVA ); m_tDocInfo.SetAttr ( tAttr.m_tLocator, m_dFieldMVAs [iFieldMVA][m_iMVAIterator] ); ++m_iMVAIterator; return true; } bool CSphSource_XMLPipe2::IterateKillListStart ( CSphString & ) { m_iKillListIterator = 0; return true; } bool CSphSource_XMLPipe2::IterateKillListNext ( SphDocID_t & tDocId ) { if ( m_iKillListIterator>=m_dKillList.GetLength () ) return false; tDocId = m_dKillList [ m_iKillListIterator++ ]; return true; } void CSphSource_XMLPipe2::StartElement ( const char * szName, const char ** pAttrs ) { if ( !strcmp ( szName, "sphinx:docset" ) ) { m_bInDocset = true; m_bFirstTagAfterDocset = true; return; } if ( !strcmp ( szName, "sphinx:schema" ) ) { if ( !m_bInDocset || !m_bFirstTagAfterDocset ) { Error ( " is allowed immediately after only" ); return; } if ( m_tSchema.m_dFields.GetLength () > 0 || m_tSchema.GetAttrsCount () > 0 ) { sphWarn ( "%s", DecorateMessage ( "both embedded and configured schemas found; using embedded" ) ); m_tSchema.Reset (); } m_bFirstTagAfterDocset = false; m_bInSchema = true; return; } if ( !strcmp ( szName, "sphinx:field" ) ) { if ( !m_bInDocset || !m_bInSchema ) { Error ( " is allowed inside only" ); return; } const char ** dAttrs = pAttrs; CSphColumnInfo Info; CSphString sDefault; bool bIsAttr = false; while ( dAttrs[0] && dAttrs[1] && dAttrs[0][0] && dAttrs[1][0] ) { if ( !strcmp ( *dAttrs, "name" ) ) { AddFieldToSchema ( dAttrs[1] ); Info.m_sName = dAttrs[1]; } else if ( !strcmp ( *dAttrs, "attr" ) ) { bIsAttr = true; if ( !strcmp ( dAttrs[1], "string" ) ) Info.m_eAttrType = SPH_ATTR_STRING; else if ( !strcmp ( dAttrs[1], "wordcount" ) ) Info.m_eAttrType = SPH_ATTR_WORDCOUNT; } else if ( !strcmp ( *dAttrs, "default" ) ) sDefault = dAttrs[1]; dAttrs += 2; } if ( bIsAttr ) { Info.m_iIndex = m_tSchema.GetAttrsCount (); m_tSchema.AddAttr ( Info, true ); // all attributes are dynamic at indexing time m_dDefaultAttrs.Add ( sDefault ); } return; } if ( !strcmp ( szName, "sphinx:attr" ) ) { if ( !m_bInDocset || !m_bInSchema ) { Error ( " is allowed inside only" ); return; } bool bError = false; CSphString sDefault; CSphColumnInfo Info; Info.m_eAttrType = SPH_ATTR_INTEGER; const char ** dAttrs = pAttrs; while ( dAttrs[0] && dAttrs[1] && dAttrs[0][0] && dAttrs[1][0] && !bError ) { if ( !strcmp ( *dAttrs, "name" ) ) Info.m_sName = dAttrs[1]; else if ( !strcmp ( *dAttrs, "bits" ) ) Info.m_tLocator.m_iBitCount = strtol ( dAttrs[1], NULL, 10 ); else if ( !strcmp ( *dAttrs, "default" ) ) sDefault = dAttrs[1]; else if ( !strcmp ( *dAttrs, "type" ) ) { const char * szType = dAttrs[1]; if ( !strcmp ( szType, "int" ) ) Info.m_eAttrType = SPH_ATTR_INTEGER; else if ( !strcmp ( szType, "timestamp" ) ) Info.m_eAttrType = SPH_ATTR_TIMESTAMP; else if ( !strcmp ( szType, "str2ordinal" ) ) Info.m_eAttrType = SPH_ATTR_ORDINAL; else if ( !strcmp ( szType, "bool" ) ) Info.m_eAttrType = SPH_ATTR_BOOL; else if ( !strcmp ( szType, "float" ) ) Info.m_eAttrType = SPH_ATTR_FLOAT; else if ( !strcmp ( szType, "bigint" ) ) Info.m_eAttrType = SPH_ATTR_BIGINT; else if ( !strcmp ( szType, "string" ) ) Info.m_eAttrType = SPH_ATTR_STRING; else if ( !strcmp ( szType, "wordcount" ) ) Info.m_eAttrType = SPH_ATTR_WORDCOUNT; else if ( !strcmp ( szType, "multi" ) ) { Info.m_eAttrType = SPH_ATTR_UINT32SET; Info.m_eSrc = SPH_ATTRSRC_FIELD; } else if ( !strcmp ( szType, "multi_64" ) ) { Info.m_eAttrType = SPH_ATTR_UINT64SET; Info.m_eSrc = SPH_ATTRSRC_FIELD; } else { Error ( "unknown column type '%s'", szType ); bError = true; } } dAttrs += 2; } if ( !bError ) { Info.m_iIndex = m_tSchema.GetAttrsCount (); m_tSchema.AddAttr ( Info, true ); // all attributes are dynamic at indexing time m_dDefaultAttrs.Add ( sDefault ); } return; } if ( !strcmp ( szName, "sphinx:document" ) ) { if ( !m_bInDocset || m_bInSchema ) return DocumentError ( "" ); if ( m_bInKillList ) return DocumentError ( "" ); if ( m_bInDocument ) return DocumentError ( "" ); if ( m_tSchema.m_dFields.GetLength()==0 && m_tSchema.GetAttrsCount()==0 ) { Error ( "no schema configured, and no embedded schema found" ); return; } m_bInDocument = true; assert ( !m_pCurDocument ); m_pCurDocument = new Document_t; m_pCurDocument->m_iDocID = 0; m_pCurDocument->m_dFields.Resize ( m_tSchema.m_dFields.GetLength () ); m_pCurDocument->m_dAttrs.Resize ( m_tSchema.GetAttrsCount () ); if ( pAttrs[0] && pAttrs[1] && pAttrs[0][0] && pAttrs[1][0] ) if ( !strcmp ( pAttrs[0], "id" ) ) m_pCurDocument->m_iDocID = sphToDocid ( pAttrs[1] ); if ( m_pCurDocument->m_iDocID==0 ) Error ( "attribute 'id' required in " ); return; } if ( !strcmp ( szName, "sphinx:killlist" ) ) { if ( !m_bInDocset || m_bInDocument || m_bInSchema ) { Error ( " is not allowed inside or " ); return; } m_bInKillList = true; return; } if ( m_bInKillList ) { if ( !m_bInId ) { if ( strcmp ( szName, "id" ) ) { Error ( "only 'id' is allowed inside " ); return; } m_bInId = true; } else ++m_iElementDepth; } if ( m_bInDocument ) { if ( m_iCurField==-1 && m_iCurAttr==-1 ) { for ( int i = 0; i < m_tSchema.m_dFields.GetLength () && m_iCurField==-1; i++ ) if ( m_tSchema.m_dFields[i].m_sName==szName ) m_iCurField = i; for ( int i = 0; i < m_tSchema.GetAttrsCount () && m_iCurAttr==-1; i++ ) if ( m_tSchema.GetAttr(i).m_sName==szName ) m_iCurAttr = i; if ( m_iCurAttr==-1 && m_iCurField==-1 ) { m_bInIgnoredTag = true; bool bInvalidFound = false; for ( int i = 0; i < m_dInvalid.GetLength () && !bInvalidFound; i++ ) bInvalidFound = m_dInvalid[i]==szName; if ( !bInvalidFound ) { sphWarn ( "%s", DecorateMessage ( "unknown field/attribute '%s'; ignored", szName ) ); m_dInvalid.Add ( szName ); } } } else m_iElementDepth++; } } void CSphSource_XMLPipe2::EndElement ( const char * szName ) { m_bInIgnoredTag = false; if ( !strcmp ( szName, "sphinx:docset" ) ) m_bInDocset = false; else if ( !strcmp ( szName, "sphinx:schema" ) ) { m_bInSchema = false; m_tDocInfo.Reset ( m_tSchema.GetRowSize () ); m_dStrAttrs.Resize ( m_tSchema.GetAttrsCount() ); } else if ( !strcmp ( szName, "sphinx:document" ) ) { m_bInDocument = false; if ( m_pCurDocument ) m_dParsedDocuments.Add ( m_pCurDocument ); m_pCurDocument = NULL; } else if ( !strcmp ( szName, "sphinx:killlist" ) ) { m_bInKillList = false; } else if ( m_bInKillList ) { if ( m_iElementDepth==0 ) { if ( m_bInId ) { m_pFieldBuffer [ Min ( m_iFieldBufferLen, m_iFieldBufferMax-1 ) ] = '\0'; m_dKillList.Add ( sphToDocid ( (const char *)m_pFieldBuffer ) ); m_iFieldBufferLen = 0; m_bInId = false; } } else m_iElementDepth--; } else if ( m_bInDocument && ( m_iCurAttr!=-1 || m_iCurField!=-1 ) ) { if ( m_iElementDepth==0 ) { if ( m_iCurField!=-1 ) { assert ( m_pCurDocument ); m_pCurDocument->m_dFields [m_iCurField].SetBinary ( (char*)m_pFieldBuffer, m_iFieldBufferLen ); } if ( m_iCurAttr!=-1 ) { assert ( m_pCurDocument ); m_pCurDocument->m_dAttrs [m_iCurAttr].SetBinary ( (char*)m_pFieldBuffer, m_iFieldBufferLen ); } m_iFieldBufferLen = 0; m_iCurAttr = -1; m_iCurField = -1; } else m_iElementDepth--; } } void CSphSource_XMLPipe2::UnexpectedCharaters ( const char * pCharacters, int iLen, const char * szComment ) { const int MAX_WARNING_LENGTH = 64; bool bSpaces = true; for ( int i = 0; i < iLen && bSpaces; i++ ) if ( !sphIsSpace ( pCharacters[i] ) ) bSpaces = false; if ( !bSpaces ) { CSphString sWarning; #if USE_LIBEXPAT sWarning.SetBinary ( pCharacters, Min ( iLen, MAX_WARNING_LENGTH ) ); sphWarn ( "source '%s': unexpected string '%s' (line=%d, pos=%d) %s", m_tSchema.m_sName.cstr(), sWarning.cstr (), (int)XML_GetCurrentLineNumber ( m_pParser ), (int)XML_GetCurrentColumnNumber ( m_pParser ), szComment ); #endif #if USE_LIBXML int i = 0; for ( i=0; i=0 && sphIsSpace ( sWarning.cstr()[i] ); i-- ); if ( i>=0 ) ( (char *)sWarning.cstr() )[i+1] = '\0'; sphWarn ( "source '%s': unexpected string '%s' %s", m_tSchema.m_sName.cstr(), sWarning.cstr(), szComment ); #endif } } void CSphSource_XMLPipe2::Characters ( const char * pCharacters, int iLen ) { if ( m_bInIgnoredTag ) return; if ( !m_bInDocset ) { UnexpectedCharaters ( pCharacters, iLen, "outside of " ); return; } if ( !m_bInSchema && !m_bInDocument && !m_bInKillList ) { UnexpectedCharaters ( pCharacters, iLen, "outside of and " ); return; } if ( m_iCurAttr==-1 && m_iCurField==-1 && !m_bInKillList ) { UnexpectedCharaters ( pCharacters, iLen, m_bInDocument ? "inside " : ( m_bInSchema ? "inside " : "" ) ); return; } if ( iLen + m_iFieldBufferLen < m_iFieldBufferMax ) { memcpy ( m_pFieldBuffer + m_iFieldBufferLen, pCharacters, iLen ); m_iFieldBufferLen += iLen; } else { const CSphString & sName = ( m_iCurField!=-1 ) ? m_tSchema.m_dFields[m_iCurField].m_sName : m_tSchema.GetAttr ( m_iCurAttr ).m_sName; bool bWarned = false; for ( int i = 0; i < m_dWarned.GetLength () && !bWarned; i++ ) bWarned = m_dWarned[i]==sName; if ( !bWarned ) { #if USE_LIBEXPAT sphWarn ( "source '%s': field/attribute '%s' length exceeds max length (line=%d, pos=%d, docid=" DOCID_FMT ")", m_tSchema.m_sName.cstr(), sName.cstr(), (int)XML_GetCurrentLineNumber ( m_pParser ), (int)XML_GetCurrentColumnNumber ( m_pParser ), m_pCurDocument->m_iDocID ); #endif #if USE_LIBXML sphWarn ( "source '%s': field/attribute '%s' length exceeds max length (docid=" DOCID_FMT ")", m_tSchema.m_sName.cstr(), sName.cstr(), m_pCurDocument->m_iDocID ); #endif m_dWarned.Add ( sName ); } } } #if USE_LIBXML int CSphSource_XMLPipe2::ReadBuffer ( BYTE * pBuffer, int iLen ) { int iLeft = Max ( m_pBufferEnd - m_pBufferPtr, 0 ); if ( iLeft < iLen ) { memmove ( m_pBuffer, m_pBufferPtr, iLeft ); size_t iRead = fread ( m_pBuffer + iLeft, 1, m_iBufferSize - iLeft, m_pPipe ); m_bPassedBufferEnd = ( ( m_iBufferSize - iLeft )==int(iRead) ); m_pBufferPtr = m_pBuffer; m_pBufferEnd = m_pBuffer + iLeft + iRead; iLeft = Max ( m_pBufferEnd - m_pBuffer, 0 ); } int iToCopy = Min ( iLen, iLeft ); memcpy ( pBuffer, m_pBufferPtr, iToCopy ); m_pBufferPtr += iToCopy; return iToCopy; } void CSphSource_XMLPipe2::ProcessNode ( xmlTextReaderPtr pReader ) { int iType = xmlTextReaderNodeType ( pReader ); switch ( iType ) { case XML_READER_TYPE_ELEMENT: { const char * szName = (char*)xmlTextReaderName ( pReader ); m_dAttrs.Resize ( 0 ); if ( xmlTextReaderHasAttributes ( pReader ) ) { if ( xmlTextReaderMoveToFirstAttribute ( pReader )!=1 ) return; do { int iLen = m_dAttrs.GetLength (); m_dAttrs.Resize ( iLen + 2 ); m_dAttrs[iLen] = (char*)xmlTextReaderName ( pReader ); m_dAttrs[iLen+1] = (char*)xmlTextReaderValue ( pReader ); } while ( xmlTextReaderMoveToNextAttribute ( pReader )==1 ); } int iLen = m_dAttrs.GetLength (); m_dAttrs.Resize ( iLen + 2 ); m_dAttrs[iLen] = NULL; m_dAttrs[iLen+1] = NULL; StartElement ( szName, &m_dAttrs[0] ); } break; case XML_READER_TYPE_END_ELEMENT: EndElement ( (char*)xmlTextReaderName ( pReader ) ); break; case XML_TEXT_NODE: { const char * szText = (char*)xmlTextReaderValue ( pReader ); Characters ( szText, strlen ( szText ) ); } break; } } #endif CSphSource * sphCreateSourceXmlpipe2 ( const CSphConfigSection * pSource, FILE * pPipe, BYTE * dInitialBuf, int iBufLen, const char * szSourceName, int iMaxFieldLen ) { CSphSource_XMLPipe2 * pXMLPipe = new CSphSource_XMLPipe2 ( dInitialBuf, iBufLen, szSourceName, iMaxFieldLen, pSource->GetInt ( "xmlpipe_fixup_utf8", 0 )!=0 ); if ( !pXMLPipe->Setup ( pPipe, *pSource ) ) SafeDelete ( pXMLPipe ); return pXMLPipe; } #endif FILE * sphDetectXMLPipe ( const char * szCommand, BYTE * dBuf, int & iBufSize, int iMaxBufSize, bool & bUsePipe2 ) { bUsePipe2 = true; // default is xmlpipe2 FILE * pPipe = popen ( szCommand, "r" ); if ( !pPipe ) return NULL; BYTE * pStart = dBuf; iBufSize = (int)fread ( dBuf, 1, iMaxBufSize, pPipe ); BYTE * pEnd = pStart + iBufSize; // BOM if ( iBufSize>=3 ) if ( !strncmp ( (char*)pStart, "\xEF\xBB\xBF", 3 ) ) pStart += 3; while ( isspace ( *pStart ) && pStart < pEnd ) pStart++; if ( ( pEnd - pStart)>=5 ) bUsePipe2 = !strncasecmp ( (char *)pStart, "WARN_ROW_SIZE ) sphWarn ( "row buffer is over %d bytes; consider revising sql_column_buffers", iTotalBuffer ); return true; } bool CSphSource_ODBC::SqlIsError () { return !m_sError.IsEmpty (); } const char * CSphSource_ODBC::SqlError () { return m_sError.cstr(); } bool CSphSource_ODBC::SqlConnect () { if ( SQLAllocHandle ( SQL_HANDLE_ENV, NULL, &m_hEnv )==SQL_ERROR ) { if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-CONNECT: FAIL\n" ); return false; } SQLSetEnvAttr ( m_hEnv, SQL_ATTR_ODBC_VERSION, (void*) SQL_OV_ODBC3, SQL_IS_INTEGER ); if ( SQLAllocHandle ( SQL_HANDLE_DBC, m_hEnv, &m_hDBC )==SQL_ERROR ) { if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-CONNECT: FAIL\n" ); return false; } OdbcPostConnect (); char szOutConn [2048]; SQLSMALLINT iOutConn = 0; if ( SQLDriverConnect ( m_hDBC, NULL, (SQLTCHAR*) m_sOdbcDSN.cstr(), SQL_NTS, (SQLCHAR*)szOutConn, sizeof(szOutConn), &iOutConn, SQL_DRIVER_NOPROMPT )==SQL_ERROR ) { GetSqlError ( SQL_HANDLE_DBC, m_hDBC ); if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-CONNECT: FAIL\n" ); return false; } if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-CONNECT: ok\n" ); return true; } void CSphSource_ODBC::SqlDisconnect () { if ( m_tParams.m_bPrintQueries ) fprintf ( stdout, "SQL-DISCONNECT\n" ); if ( m_hStmt!=NULL ) SQLFreeHandle ( SQL_HANDLE_STMT, m_hStmt ); if ( m_hDBC ) { SQLDisconnect ( m_hDBC ); SQLFreeHandle ( SQL_HANDLE_DBC, m_hDBC ); } if ( m_hEnv ) SQLFreeHandle ( SQL_HANDLE_ENV, m_hEnv ); } int CSphSource_ODBC::SqlNumFields () { if ( !m_hStmt ) return -1; return m_nResultCols; } bool CSphSource_ODBC::SqlFetchRow () { if ( !m_hStmt ) return false; SQLRETURN iRet = SQLFetch ( m_hStmt ); if ( iRet==SQL_ERROR || iRet==SQL_INVALID_HANDLE ) { GetSqlError ( SQL_HANDLE_STMT, m_hStmt ); return false; } ARRAY_FOREACH ( i, m_dColumns ) { QueryColumn_t & tCol = m_dColumns[i]; switch ( tCol.m_iInd ) { case SQL_NO_DATA: case SQL_NULL_DATA: tCol.m_dContents[0] = '\0'; tCol.m_dContents[0] = '\0'; break; default: #if USE_WINDOWS // FIXME! support UCS-2 columns on Unix too if ( tCol.m_bUnicode ) { // WideCharToMultiByte should get NULL terminated string for ( int i=0; i=0 && tCol.m_iInd=tCol.m_iBufferSize && !tCol.m_bTruncated ) { // out of buffer; warn about that (once) tCol.m_bTruncated = true; sphWarn ( "'%s' column truncated (buffer=%d, got=%d); consider revising sql_column_buffers", tCol.m_sName.cstr(), tCol.m_iBufferSize-1, (int) tCol.m_iInd ); } } break; } } return iRet!=SQL_NO_DATA; } const char * CSphSource_ODBC::SqlColumn ( int iIndex ) { if ( !m_hStmt ) return NULL; return &(m_dColumns [iIndex].m_dContents[0]); } const char * CSphSource_ODBC::SqlFieldName ( int iIndex ) { return m_dColumns[iIndex].m_sName.cstr(); } DWORD CSphSource_ODBC::SqlColumnLength ( int ) { return 0; } bool CSphSource_ODBC::Setup ( const CSphSourceParams_ODBC & tParams ) { if ( !CSphSource_SQL::Setup ( tParams ) ) return false; // parse column buffers spec, if any if ( !tParams.m_sColBuffers.IsEmpty() ) { const char * p = tParams.m_sColBuffers.cstr(); while ( *p ) { // skip space while ( sphIsSpace(*p) ) p++; // expect eof or ident if ( !*p ) break; if ( !sphIsAlpha(*p) ) { m_sError.SetSprintf ( "identifier expected in sql_column_buffers near '%s'", p ); return false; } // get ident CSphString sCol; const char * pIdent = p; while ( sphIsAlpha(*p) ) p++; sCol.SetBinary ( pIdent, p-pIdent ); // skip space while ( sphIsSpace(*p) ) p++; // expect assignment if ( *p!='=' ) { m_sError.SetSprintf ( "'=' expected in sql_column_buffers near '%s'", p ); return false; } p++; // skip space while ( sphIsSpace(*p) ) p++; // expect number if (!( *p>='0' && *p<='9' )) { m_sError.SetSprintf ( "number expected in sql_column_buffers near '%s'", p ); return false; } // get value int iSize = 0; while ( *p>='0' && *p<='9' ) { iSize = 10*iSize + ( *p-'0' ); p++; } if ( *p=='K' ) { iSize *= 1024; p++; } else if ( *p=='M' ) { iSize *= 1048576; p++; } // hash value sCol.ToLower(); m_hColBuffers.Add ( iSize, sCol ); // skip space while ( sphIsSpace(*p) ) p++; // expect eof or comma if ( !*p ) break; if ( *p!=',' ) { m_sError.SetSprintf ( "comma expected in sql_column_buffers near '%s'", p ); return false; } p++; } } // ODBC specific params m_sOdbcDSN = tParams.m_sOdbcDSN; m_bWinAuth = tParams.m_bWinAuth; m_bUnicode = tParams.m_bUnicode; // build and store DSN for error reporting char sBuf [ 1024 ]; snprintf ( sBuf, sizeof(sBuf), "odbc%s", m_sSqlDSN.cstr()+3 ); m_sSqlDSN = sBuf; return true; } void CSphSource_ODBC::GetSqlError ( SQLSMALLINT iHandleType, SQLHANDLE hHandle ) { if ( !hHandle ) { m_sError.SetSprintf ( "invalid handle" ); return; } char szState[16]; char szMessageText[1024]; SQLINTEGER iError; SQLSMALLINT iLen; SQLGetDiagRec ( iHandleType, hHandle, 1, (SQLCHAR*)szState, &iError, (SQLCHAR*)szMessageText, 1024, &iLen ); m_sError = szMessageText; } ////////////////////////////////////////////////////////////////////////// void CSphSource_MSSQL::OdbcPostConnect () { const int MAX_LEN = 1024; char szDriver[MAX_LEN]; char szDriverAttrs[MAX_LEN]; SQLSMALLINT iDescLen = 0; SQLSMALLINT iAttrLen = 0; SQLSMALLINT iDir = SQL_FETCH_FIRST; CSphString sDriver; for ( ;; ) { SQLRETURN iRet = SQLDrivers ( m_hEnv, iDir, (SQLCHAR*)szDriver, MAX_LEN, &iDescLen, (SQLCHAR*)szDriverAttrs, MAX_LEN, &iAttrLen ); if ( iRet==SQL_NO_DATA ) break; iDir = SQL_FETCH_NEXT; if ( !strcmp ( szDriver, "SQL Native Client" ) || !strncmp ( szDriver, "SQL Server Native Client", strlen("SQL Server Native Client") ) ) { sDriver = szDriver; break; } } if ( sDriver.IsEmpty() ) sDriver = "SQL Server"; if ( m_bWinAuth && m_tParams.m_sUser.IsEmpty () ) { m_sOdbcDSN.SetSprintf ( "DRIVER={%s};SERVER={%s};Database={%s};Trusted_Connection=yes", sDriver.cstr (), m_tParams.m_sHost.cstr (), m_tParams.m_sDB.cstr () ); } else if ( m_bWinAuth ) { m_sOdbcDSN.SetSprintf ( "DRIVER={%s};SERVER={%s};UID={%s};PWD={%s};Database={%s};Trusted_Connection=yes", sDriver.cstr (), m_tParams.m_sHost.cstr (), m_tParams.m_sUser.cstr (), m_tParams.m_sPass.cstr (), m_tParams.m_sDB.cstr () ); } else { m_sOdbcDSN.SetSprintf ( "DRIVER={%s};SERVER={%s};UID={%s};PWD={%s};Database={%s}", sDriver.cstr (), m_tParams.m_sHost.cstr (), m_tParams.m_sUser.cstr (), m_tParams.m_sPass.cstr (), m_tParams.m_sDB.cstr () ); } } #endif ///////////////////////////////////////////////////////////////////////////// // MERGER HELPERS ///////////////////////////////////////////////////////////////////////////// void CSphDocMVA::Read ( CSphReader & tReader ) { m_iDocID = tReader.GetDocid(); if ( m_iDocID ) { ARRAY_FOREACH ( i, m_dMVA ) { DWORD iValues = tReader.GetDword(); m_dMVA[i].Resize ( iValues ); if ( iValues ) tReader.GetBytes ( m_dMVA[i].Begin(), iValues*sizeof(DWORD) ); } } } void CSphDocMVA::Write ( CSphWriter & tWriter ) { tWriter.PutDocid ( m_iDocID ); ARRAY_FOREACH ( i, m_dMVA ) { m_dOffsets[i] = ( DWORD )tWriter.GetPos() / sizeof( DWORD ); int iValues = m_dMVA[i].GetLength(); tWriter.PutDword ( iValues ); if ( iValues ) tWriter.PutBytes ( m_dMVA[i].Begin(), iValues*sizeof(DWORD) ); } } ///////////////////////////////////////////////////////////////////////////// void sphSetQuiet ( bool bQuiet ) { g_bSphQuiet = bQuiet; } static inline float GetPercent ( int64_t a, int64_t b ) { if ( b==0 ) return 100.0f; int64_t r = a*100000/b; return float(r)/1000; } const char * CSphIndexProgress::BuildMessage() const { static char sBuf[256]; switch ( m_ePhase ) { case PHASE_COLLECT: snprintf ( sBuf, sizeof(sBuf), "collected %d docs, %.1f MB", m_iDocuments, float(m_iBytes)/1000000.0f ); break; case PHASE_SORT: snprintf ( sBuf, sizeof(sBuf), "sorted %.1f Mhits, %.1f%% done", float(m_iHits)/1000000, GetPercent ( m_iHits, m_iHitsTotal ) ); break; case PHASE_COLLECT_MVA: snprintf ( sBuf, sizeof(sBuf), "collected "INT64_FMT" attr values", m_iAttrs ); break; case PHASE_SORT_MVA: snprintf ( sBuf, sizeof(sBuf), "sorted %.1f Mvalues, %.1f%% done", float(m_iAttrs)/1000000, GetPercent ( m_iAttrs, m_iAttrsTotal ) ); break; case PHASE_MERGE: snprintf ( sBuf, sizeof(sBuf), "merged %.1f Kwords", float(m_iWords)/1000 ); break; case PHASE_PREREAD: snprintf ( sBuf, sizeof(sBuf), "read %.1f of %.1f MB, %.1f%% done", float(m_iBytes)/1000000.0f, float(m_iBytesTotal)/1000000.0f, GetPercent ( m_iBytes, m_iBytesTotal ) ); break; case PHASE_PRECOMPUTE: snprintf ( sBuf, sizeof(sBuf), "indexing attributes, %d.%d%% done", m_iDone/10, m_iDone%10 ); break; default: assert ( 0 && "internal error: unhandled progress phase" ); snprintf ( sBuf, sizeof(sBuf), "(progress-phase-%d)", m_ePhase ); break; } sBuf[sizeof(sBuf)-1] = '\0'; return sBuf; } ///////////////////////////////////////////////////////////////////////////// static int DictCmp ( const char * pStr1, int iLen1, const char * pStr2, int iLen2 ) { assert ( pStr1 && pStr2 ); assert ( iLen1 && iLen2 ); const int iCmpLen = Min ( iLen1, iLen2 ); return strncmp ( pStr1, pStr2, iCmpLen ); } static int DictCmpStrictly ( const char * pStr1, int iLen1, const char * pStr2, int iLen2 ) { assert ( pStr1 && pStr2 ); assert ( iLen1 && iLen2 ); const int iCmpLen = Min ( iLen1, iLen2 ); const int iCmpRes = strncmp ( pStr1, pStr2, iCmpLen ); return iCmpRes==0 ? iLen1-iLen2 : iCmpRes; } int CSphWordlistCheckpoint::Cmp ( const char * sWord, int iLen, SphWordID_t iWordID, bool bWordDict ) const { if ( bWordDict ) return DictCmp ( sWord, iLen, m_sWord, strlen ( m_sWord ) ); int iRes = 0; iRes = iWordIDm_iWordID ? 1 : iRes; return iRes; } int CSphWordlistCheckpoint::CmpStrictly ( const char * sWord, int iLen, SphWordID_t iWordID, bool bWordDict ) const { if ( bWordDict ) return DictCmpStrictly ( sWord, iLen, m_sWord, strlen ( m_sWord ) ); int iRes = 0; iRes = iWordIDm_iWordID ? 1 : iRes; return iRes; } WordDictInfo_t::WordDictInfo_t () { m_uOff = 0; m_iDocs = 0; m_iHits = 0; m_iDoclistHint = 0; } WordReaderContext_t::WordReaderContext_t() { m_sWord[0] = '\0'; m_iLen = 0; } CWordlist::CWordlist () : m_dCheckpoints ( 0 ) { m_iCheckpointsPos = 0; m_iSize = 0; m_iMaxChunk = 0; m_bWordDict = false; m_pWords = NULL; } CWordlist::~CWordlist () { Reset(); } void CWordlist::Reset () { m_tFile.Close (); m_pBuf.Reset (); m_dCheckpoints.Reset ( 0 ); SafeDeleteArray ( m_pWords ); } bool CWordlist::ReadCP ( CSphAutofile & tFile, DWORD uVer, bool bWordDict, CSphString & sError ) { assert ( ( uVer>=21 && bWordDict ) || !bWordDict ); assert ( m_iCheckpointsPos>0 ); assert ( m_iSize-m_iCheckpointsPos=0 ); m_pWords = new BYTE[iArenaSize]; assert ( m_pWords ); BYTE * pWord = m_pWords; ARRAY_FOREACH ( i, m_dCheckpoints ) { m_dCheckpoints[i].m_sWord = (char *)pWord; const int iLen = tReader.GetDword(); assert ( iLen>0 ); assert ( iLen+1+(pWord-m_pWords)<=iArenaSize ); tReader.GetBytes ( pWord, iLen ); pWord[iLen] = '\0'; pWord += iLen+1; m_dCheckpoints[i].m_iWordlistOffset = tReader.GetOffset(); } } else if ( uVer>=11 ) { // read v.14 checkpoints ARRAY_FOREACH ( i, m_dCheckpoints ) { m_dCheckpoints[i].m_iWordID = (SphWordID_t)tReader.GetOffset(); m_dCheckpoints[i].m_iWordlistOffset = tReader.GetOffset(); } } else { // convert v.10 checkpoints ARRAY_FOREACH ( i, m_dCheckpoints ) { #if USE_64BIT m_dCheckpoints[i].m_iWordID = tReader.GetOffset(); #else m_dCheckpoints[i].m_iWordID = tReader.GetDword(); #endif m_dCheckpoints[i].m_iWordlistOffset = tReader.GetDword(); } } SphOffset_t uMaxChunk = 0; ARRAY_FOREACH ( i, m_dCheckpoints ) { SphOffset_t uNextOffset = ( i+1 )==m_dCheckpoints.GetLength() ? m_iSize : m_dCheckpoints[i+1].m_iWordlistOffset; uMaxChunk = Max ( uMaxChunk, uNextOffset - m_dCheckpoints[i].m_iWordlistOffset ); } assert ( uMaxChunk0 ); const CSphWordlistCheckpoint * pStart = m_dCheckpoints.Begin(); const CSphWordlistCheckpoint * pEnd = &m_dCheckpoints.Last(); if ( bStarMode && pStart->Cmp ( sWord, iWordLen, iWordID, m_bWordDict )<0 ) return NULL; if ( !bStarMode && pStart->CmpStrictly ( sWord, iWordLen, iWordID, m_bWordDict )<0 ) return NULL; if ( pEnd->CmpStrictly ( sWord, iWordLen, iWordID, m_bWordDict )>=0 ) pStart = pEnd; else { while ( pEnd-pStart>1 ) { const CSphWordlistCheckpoint * pMid = pStart + (pEnd-pStart)/2; const int iCmpRes = pMid->CmpStrictly ( sWord, iWordLen, iWordID, m_bWordDict ); if ( iCmpRes==0 ) { pStart = pMid; break; } else if ( iCmpRes<0 ) pEnd = pMid; else pStart = pMid; } assert ( pStart>=m_dCheckpoints.Begin() ); assert ( pStart<=&m_dCheckpoints.Last() ); assert ( pStart->Cmp ( sWord, iWordLen, iWordID, m_bWordDict )>=0 && pEnd->CmpStrictly ( sWord, iWordLen, iWordID, m_bWordDict )<0 ); } return pStart; } const BYTE * CWordlist::GetWord ( const BYTE * pBuf, const char * pStr, int iLen, WordDictInfo_t & tWord, bool bStarMode, WordReaderContext_t & tCtx ) const { assert ( pBuf ); assert ( pStr && iLen>0 ); for ( ;; ) { // unpack next word // must be in sync with DictEnd()! BYTE uPack = *pBuf++; if ( !uPack ) return NULL; // wordlist chunk is over int iMatch, iDelta; if ( uPack & 0x80 ) { iDelta = ( ( uPack>>4 ) & 7 ) + 1; iMatch = uPack & 15; } else { iDelta = uPack & 127; iMatch = *pBuf++; } assert ( iMatch+iDelta<(int)sizeof(tCtx.m_sWord)-1 ); assert ( iMatch<=(int)strlen ( (char *)tCtx.m_sWord ) ); memcpy ( tCtx.m_sWord + iMatch, pBuf, iDelta ); pBuf += iDelta; tCtx.m_iLen = iMatch + iDelta; tCtx.m_sWord[tCtx.m_iLen] = '\0'; // list is sorted, so if there was no match, there's no such word int iCmpRes = bStarMode ? DictCmp ( pStr, iLen, (char*)tCtx.m_sWord, tCtx.m_iLen ) : DictCmpStrictly ( pStr, iLen, (char*)tCtx.m_sWord, tCtx.m_iLen ); if ( iCmpRes<0 ) return NULL; const SphOffset_t uOff = sphUnzipOffset ( pBuf ); const int iDocs = sphUnzipInt ( pBuf ); const int iHits = sphUnzipInt ( pBuf ); BYTE uHint = ( iDocs>=DOCLIST_HINT_THRESH ) ? *pBuf++ : 0; // it matches?! if ( iCmpRes==0 && ( !bStarMode || iLen<=tCtx.m_iLen ) ) { tWord.m_sWord = (char*)tCtx.m_sWord; tWord.m_uOff = uOff; tWord.m_iDocs = iDocs; tWord.m_iHits = iHits; tWord.m_iDoclistHint = DoclistHintUnpack ( iDocs, uHint ); return pBuf; } } } bool CWordlist::GetWord ( const BYTE * pBuf, SphWordID_t iWordID, WordDictInfo_t & tWord ) const { SphWordID_t iLastID = 0; SphOffset_t uLastOff = 0; for ( ;; ) { // unpack next word ID const SphWordID_t iDeltaWord = sphUnzipWordid ( pBuf ); // FIXME! slow with 32bit wordids if ( iDeltaWord==0 ) // wordlist chunk is over return false; iLastID += iDeltaWord; // list is sorted, so if there was no match, there's no such word if ( iLastID>iWordID ) return false; // unpack next offset const SphOffset_t iDeltaOffset = sphUnzipOffset ( pBuf ); uLastOff += iDeltaOffset; // unpack doc/hit count const int iDocs = sphUnzipInt ( pBuf ); const int iHits = sphUnzipInt ( pBuf ); assert ( iDeltaOffset ); assert ( iDocs ); assert ( iHits ); // it matches?! if ( iLastID==iWordID ) { sphUnzipWordid ( pBuf ); // might be 0 at checkpoint const SphOffset_t iDoclistLen = sphUnzipOffset ( pBuf ); tWord.m_uOff = uLastOff; tWord.m_iDocs = iDocs; tWord.m_iHits = iHits; tWord.m_iDoclistHint = (int)iDoclistLen; return true; } } } const BYTE * CWordlist::AcquireDict ( const CSphWordlistCheckpoint * pCheckpoint, int iFD, BYTE * pDictBuf ) const { assert ( pCheckpoint ); assert ( m_dCheckpoints.GetLength() ); assert ( pCheckpoint>=m_dCheckpoints.Begin() && pCheckpoint<=&m_dCheckpoints.Last() ); assert ( pCheckpoint->m_iWordlistOffset>0 && pCheckpoint->m_iWordlistOffset<=m_iSize ); assert ( m_pBuf.IsEmpty() || pCheckpoint->m_iWordlistOffset<(int64_t)m_pBuf.GetLength() ); const BYTE * pBuf = NULL; if ( !m_pBuf.IsEmpty() ) pBuf = m_pBuf.GetWritePtr()+pCheckpoint->m_iWordlistOffset; else { assert ( pDictBuf ); SphOffset_t iChunkLength = 0; // not the end? if ( pCheckpoint < &m_dCheckpoints.Last() ) iChunkLength = pCheckpoint[1].m_iWordlistOffset - pCheckpoint->m_iWordlistOffset; else iChunkLength = m_iSize - pCheckpoint->m_iWordlistOffset; if ( (int)sphPread ( iFD, pDictBuf, (size_t)iChunkLength, pCheckpoint->m_iWordlistOffset )==iChunkLength ) pBuf = pDictBuf; } return pBuf; } void CWordlist::GetPrefixedWords ( const char * sWord, int iWordLen, CSphVector & dPrefixedWords, BYTE * pDictBuf, int iFD ) const { assert ( iWordLen>0 ); // empty index? if ( !m_dCheckpoints.GetLength() ) return; const CSphWordlistCheckpoint * pCheckpoint = FindCheckpoint ( sWord, iWordLen, 0, true ); while ( pCheckpoint ) { // decode wordlist chunk const BYTE * pBuf = AcquireDict ( pCheckpoint, iFD, pDictBuf ); assert ( pBuf ); WordReaderContext_t tReaderCtx; while ( pBuf ) { WordDictInfo_t tResWord; pBuf = GetWord ( pBuf, sWord, iWordLen, tResWord, true, tReaderCtx ); if ( pBuf ) { assert ( !tResWord.m_sWord.IsEmpty() ); CSphNamedInt & tPrefixed = dPrefixedWords.Add(); tPrefixed.m_sName = tResWord.m_sWord; // OPTIMIZE? swap mb? tPrefixed.m_iValue = tResWord.m_iDocs; } } pCheckpoint++; if ( pCheckpoint > &m_dCheckpoints.Last() ) break; if ( DictCmp ( sWord, iWordLen, pCheckpoint->m_sWord, strlen ( pCheckpoint->m_sWord ) )<0 ) break; } } int CSphStrHashFunc::Hash ( const CSphString & sKey ) { return sKey.IsEmpty() ? 0 : sphCRC32 ( (const BYTE *)sKey.cstr() ); } ////////////////////////////////////////////////////////////////////////// // CSphQueryResultMeta ////////////////////////////////////////////////////////////////////////// CSphQueryResultMeta::CSphQueryResultMeta () : m_iQueryTime ( 0 ) , m_iCpuTime ( 0 ) , m_iMultiplier ( 1 ) , m_iMatches ( 0 ) , m_iTotalMatches ( 0 ) { } void CSphQueryResultMeta::AddStat ( const CSphString & sWord, int iDocs, int iHits, bool bExpanded ) { CSphString sFixed; const CSphString * pFixed = &sWord; if ( sWord.cstr()[0]==MAGIC_WORD_HEAD ) { sFixed = sWord; *(char *)( sFixed.cstr() ) = '*'; pFixed = &sFixed; } else if ( sWord.cstr()[0]==MAGIC_WORD_HEAD_NONSTEMMED ) { if ( !bExpanded ) { sFixed = sWord; *(char *)( sFixed.cstr() ) = '='; pFixed = &sFixed; } else { sFixed = sWord.SubString ( 1, sWord.Length()-1 ); pFixed = &sFixed; } } WordStat_t * pStats = m_hWordStats ( *pFixed ); if ( !pStats ) { CSphQueryResultMeta::WordStat_t tStats; tStats.m_iDocs = iDocs; tStats.m_iHits = iHits; tStats.m_bExpanded = bExpanded; m_hWordStats.Add ( tStats, *pFixed ); } else { pStats->m_iDocs += iDocs; pStats->m_iHits += iHits; pStats->m_bExpanded |= bExpanded; } } CSphQueryResultMeta::CSphQueryResultMeta ( const CSphQueryResultMeta & tMeta ) { *this = tMeta; } CSphQueryResultMeta & CSphQueryResultMeta::operator= ( const CSphQueryResultMeta & tMeta ) { m_iQueryTime = tMeta.m_iQueryTime; m_iCpuTime = tMeta.m_iCpuTime; m_iMultiplier = tMeta.m_iMultiplier; m_iMatches = tMeta.m_iMatches; m_iTotalMatches = tMeta.m_iTotalMatches; m_sError = tMeta.m_sError; m_sWarning = tMeta.m_sWarning; m_hWordStats = tMeta.m_hWordStats; return *this; } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinx.h100777 0 0 253666 11647303546 13011 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #ifndef _sphinx_ #define _sphinx_ ///////////////////////////////////////////////////////////////////////////// #ifdef _WIN32 #define USE_MYSQL 1 /// whether to compile MySQL support #define USE_PGSQL 0 /// whether to compile PgSQL support #define USE_ODBC 0 /// whether to compile ODBC support #define USE_LIBEXPAT 1 /// whether to compile libexpat support #define USE_LIBICONV 0 /// whether to compile iconv support #define USE_LIBXML 0 /// whether to compile libxml support #define USE_LIBSTEMMER 0 /// whether to compile libstemmber support #define USE_WINDOWS 1 /// whether to compile for Windows #define USE_MMSEG 1 /// enable mmseg #define USE_SYSLOG 0 /// whether to use syslog for logging #define UNALIGNED_RAM_ACCESS 1 #define USE_LITTLE_ENDIAN 1 #define USE_PYTHON 1 /// whether to compile Python support, NOTE:Coreseek Fork, this option must be on! #define USE_PYTHON_DEBUG 0 ///link to _d.lib or not #define USE_PYTHON_CASE_SENSIVE_ATTR 0 ///column case senstive @python #else #define USE_WINDOWS 0 /// whether to compile for Windows #define USE_PYTHON_CASE_SENSIVE_ATTR 1 ///column case senstive @python #endif ///////////////////////////////////////////////////////////////////////////// #include "sphinxstd.h" #include "sphinxexpr.h" // to remove? #include #include #include #include #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "sph_darts.h" #include #if USE_PGSQL #include #endif #if USE_WINDOWS #include #else #include #include #endif #if USE_MYSQL #include #endif #if USE_WINDOWS typedef __int64 SphOffset_t; #define STDOUT_FILENO fileno(stdout) #define STDERR_FILENO fileno(stderr) #else typedef off_t SphOffset_t; #endif #if USE_ODBC #include #endif ///////////////////////////////////////////////////////////////////////////// #ifndef USE_64BIT #define USE_64BIT 0 #endif #if USE_64BIT // use 64-bit unsigned integers to store document and word IDs #define SPHINX_BITS_TAG "-id64" typedef uint64_t SphWordID_t; typedef uint64_t SphDocID_t; #define DOCID_MAX U64C(0xffffffffffffffff) #define DOCID_FMT UINT64_FMT #define DOCINFO_IDSIZE 2 STATIC_SIZE_ASSERT ( SphWordID_t, 8 ); STATIC_SIZE_ASSERT ( SphDocID_t, 8 ); #else // use 32-bit unsigned integers to store document and word IDs #define SPHINX_BITS_TAG "" typedef DWORD SphWordID_t; typedef DWORD SphDocID_t; #define DOCID_MAX 0xffffffffUL #define DOCID_FMT "%u" #define DOCINFO_IDSIZE 1 STATIC_SIZE_ASSERT ( SphWordID_t, 4 ); STATIC_SIZE_ASSERT ( SphDocID_t, 4 ); #endif // USE_64BIT #define DWSIZEOF(a) ( sizeof(a) / sizeof(DWORD) ) ////////////////////////////////////////////////////////////////////////// /// row entry (storage only, does not necessarily map 1:1 to attributes) typedef DWORD CSphRowitem; /// widest integer type that can be be stored as an attribute (ideally, fully decoupled from rowitem size!) typedef int64_t SphAttr_t; const CSphRowitem ROWITEM_MAX = UINT_MAX; const int ROWITEM_BITS = 8*sizeof(CSphRowitem); const int ROWITEM_SHIFT = 5; STATIC_ASSERT ( ( 1 << ROWITEM_SHIFT )==ROWITEM_BITS, INVALID_ROWITEM_SHIFT ); #ifndef USE_LITTLE_ENDIAN #error Please define endianness #endif template < typename DOCID > inline DOCID DOCINFO2ID_T ( const DWORD * pDocinfo ); template<> inline DWORD DOCINFO2ID_T ( const DWORD * pDocinfo ) { return pDocinfo[0]; } template<> inline uint64_t DOCINFO2ID_T ( const DWORD * pDocinfo ) { #if USE_LITTLE_ENDIAN return uint64_t(pDocinfo[0]) + (uint64_t(pDocinfo[1])<<32); #else return uint64_t(pDocinfo[1]) + (uint64_t(pDocinfo[0])<<32); #endif } inline void DOCINFOSETID ( DWORD * pDocinfo, DWORD uValue ) { *pDocinfo = uValue; } inline void DOCINFOSETID ( DWORD * pDocinfo, uint64_t uValue ) { #if USE_LITTLE_ENDIAN pDocinfo[0] = (DWORD)uValue; pDocinfo[1] = (DWORD)(uValue>>32); #else pDocinfo[0] = (DWORD)(uValue>>32); pDocinfo[1] = (DWORD)uValue; #endif } inline SphDocID_t DOCINFO2ID ( const DWORD * pDocinfo ) { return DOCINFO2ID_T ( pDocinfo ); } #if PARANOID template < typename DOCID > inline DWORD * DOCINFO2ATTRS_T ( DWORD * pDocinfo ) { assert ( pDocinfo ); return pDocinfo+DWSIZEOF(DOCID); } template < typename DOCID > inline const DWORD * DOCINFO2ATTRS_T ( const DWORD * pDocinfo ) { assert ( pDocinfo ); return pDocinfo+DWSIZEOF(DOCID); } #else template < typename DOCID > inline DWORD * DOCINFO2ATTRS_T ( DWORD * pDocinfo ) { return pDocinfo + DWSIZEOF(DOCID); } template < typename DOCID > inline const DWORD * DOCINFO2ATTRS_T ( const DWORD * pDocinfo ) { return pDocinfo + DWSIZEOF(DOCID); } #endif inline DWORD * DOCINFO2ATTRS ( DWORD * pDocinfo ) { return DOCINFO2ATTRS_T(pDocinfo); } inline const DWORD * DOCINFO2ATTRS ( const DWORD * pDocinfo ) { return DOCINFO2ATTRS_T(pDocinfo); } ///////////////////////////////////////////////////////////////////////////// #include "sphinxversion.h" #ifndef SPHINX_TAG #define SPHINX_TAG "-dev" #endif #define SPHINX_VERSION "2.0.2" SPHINX_BITS_TAG SPHINX_TAG " (" SPH_SVN_TAGREV ")" #define SPHINX_BANNER "Sphinx " SPHINX_VERSION "\nCopyright (c) 2001-2011, Andrew Aksyonoff\nCopyright (c) 2008-2011, Sphinx Technologies Inc (http://sphinxsearch.com)\n\n" #define SPHINX_SEARCHD_PROTO 1 #define SPH_MAX_WORD_LEN 42 // so that any UTF-8 word fits 127 bytes #define SPH_MAX_FILENAME_LEN 512 #define SPH_MAX_FIELDS 256 #define CORESEEK_VERSION "4.1 [ Sphinx " SPHINX_VERSION "]" #define CORESEEK_BANNER "Coreseek Fulltext " CORESEEK_VERSION "\nCopyright (c) 2007-2011,\nBeijing Choice Software Technologies Inc (http://www.coreseek.com)\n\n " #define REBANDING 1 #if REBANDING #undef SPHINX_BANNER #define SPHINX_BANNER CORESEEK_BANNER #endif ///////////////////////////////////////////////////////////////////////////// /// microsecond precision timestamp /// current UNIX timestamp in seconds multiplied by 1000000, plus microseconds since the beginning of current second int64_t sphMicroTimer (); /// Sphinx CRC32 implementation DWORD sphCRC32 ( const BYTE * pString ); DWORD sphCRC32 ( const BYTE * pString, int iLen ); DWORD sphCRC32 ( const BYTE * pString, int iLen, DWORD uPrevCRC ); /// Sphinx FNV64 implementation const uint64_t SPH_FNV64_SEED = 0xcbf29ce484222325ULL; uint64_t sphFNV64 ( const BYTE * pString ); uint64_t sphFNV64 ( const BYTE * s, int iLen, uint64_t uPrev = SPH_FNV64_SEED ); /// calculate file crc32 bool sphCalcFileCRC32 ( const char * szFilename, DWORD & uCRC32 ); /// replaces all occurences of sMacro in sTemplate with textual representation of uValue char * sphStrMacro ( const char * sTemplate, const char * sMacro, SphDocID_t uValue ); /// try to obtain an exclusive lock on specified file /// bWait specifies whether to wait bool sphLockEx ( int iFile, bool bWait ); /// remove existing locks void sphLockUn ( int iFile ); /// millisecond-precision sleep void sphSleepMsec ( int iMsec ); /// check if file exists and is a readable file bool sphIsReadable ( const char * sFilename, CSphString * pError=NULL ); /// set throttling options void sphSetThrottling ( int iMaxIOps, int iMaxIOSize ); /// immediately interrupt current query void sphInterruptNow(); #if !USE_WINDOWS /// set process info void sphSetProcessInfo ( bool bHead ); #endif struct CSphIOStats { int64_t m_iReadTime; DWORD m_iReadOps; int64_t m_iReadBytes; int64_t m_iWriteTime; DWORD m_iWriteOps; int64_t m_iWriteBytes; }; /// clear stats, starts collecting void sphStartIOStats (); /// stops collecting stats, returns results const CSphIOStats & sphStopIOStats (); /// startup mva updates arena DWORD * sphArenaInit ( int iMaxBytes ); ////////////////////////////////////////////////////////////////////////// #if UNALIGNED_RAM_ACCESS /// pass-through wrapper template < typename T > inline T sphUnalignedRead ( const T & tRef ) { return tRef; } /// pass-through wrapper template < typename T > void sphUnalignedWrite ( void * pPtr, const T & tVal ) { *(T*)pPtr = tVal; } #else /// unaligned read wrapper for some architectures (eg. SPARC) template < typename T > inline T sphUnalignedRead ( const T & tRef ) { T uTmp; BYTE * pSrc = (BYTE *) &tRef; BYTE * pDst = (BYTE *) &uTmp; for ( int i=0; i<(int)sizeof(T); i++ ) *pDst++ = *pSrc++; return uTmp; } /// unaligned write wrapper for some architectures (eg. SPARC) template < typename T > void sphUnalignedWrite ( void * pPtr, const T & tVal ) { BYTE * pDst = (BYTE *) pPtr; BYTE * pSrc = (BYTE *) &tVal; for ( int i=0; i<(int)sizeof(T); i++ ) *pDst++ = *pSrc++; } #endif int sphUTF8Len ( const char * pStr ); /// check for valid attribute name char inline int sphIsAttr ( int c ) { // different from sphIsAlpha() in that we don't allow minus return ( c>='0' && c<='9' ) || ( c>='a' && c<='z' ) || ( c>='A' && c<='Z' ) || c=='_'; } ///////////////////////////////////////////////////////////////////////////// // TOKENIZERS ///////////////////////////////////////////////////////////////////////////// extern const char * SPHINX_DEFAULT_SBCS_TABLE; extern const char * SPHINX_DEFAULT_UTF8_TABLE; ///////////////////////////////////////////////////////////////////////////// /// lowercaser remap range struct CSphRemapRange { int m_iStart; int m_iEnd; int m_iRemapStart; CSphRemapRange () : m_iStart ( -1 ) , m_iEnd ( -1 ) , m_iRemapStart ( -1 ) {} CSphRemapRange ( int iStart, int iEnd, int iRemapStart ) : m_iStart ( iStart ) , m_iEnd ( iEnd ) , m_iRemapStart ( iRemapStart ) {} }; inline bool operator < ( const CSphRemapRange & a, const CSphRemapRange & b ) { return a.m_iStart < b.m_iStart; } /// lowercaser class CSphLowercaser { public: CSphLowercaser (); ~CSphLowercaser (); void Reset (); void SetRemap ( const CSphLowercaser * pLC ); void AddRemaps ( const CSphVector & dRemaps, DWORD uFlags ); void AddSpecials ( const char * sSpecials ); uint64_t GetFNV () const; public: const CSphLowercaser & operator = ( const CSphLowercaser & rhs ); public: inline int ToLower ( int iCode ) const { if ( iCode<0 || iCode>=MAX_CODE ) return iCode; register int * pChunk = m_pChunk [ iCode >> CHUNK_BITS ]; if ( pChunk ) return pChunk [ iCode & CHUNK_MASK ]; return 0; } protected: static const int CHUNK_COUNT = 0x300; static const int CHUNK_BITS = 8; static const int CHUNK_SIZE = 1 << CHUNK_BITS; static const int CHUNK_MASK = CHUNK_SIZE - 1; static const int MAX_CODE = CHUNK_COUNT * CHUNK_SIZE; int m_iChunks; ///< how much chunks are actually allocated int * m_pData; ///< chunks themselves int * m_pChunk [ CHUNK_COUNT ]; ///< pointers to non-empty chunks }; ///////////////////////////////////////////////////////////////////////////// struct CSphSavedFile { CSphString m_sFilename; SphOffset_t m_uSize; SphOffset_t m_uCTime; SphOffset_t m_uMTime; DWORD m_uCRC32; CSphSavedFile (); }; struct CSphTokenizerSettings { int m_iType; CSphString m_sCaseFolding; int m_iMinWordLen; CSphString m_sSynonymsFile; CSphString m_sBoundary; CSphString m_sIgnoreChars; int m_iNgramLen; CSphString m_sNgramChars; CSphString m_sBlendChars; CSphString m_sBlendMode; //mmseg int m_iDebug; //coreseek: used to mark is debug output tokens CSphString m_sDictPath; //coreseek: where to find segmentor's dict. CSphTokenizerSettings (); }; struct CSphMultiformContainer; /// generic tokenizer class ISphTokenizer { public: /// trivial ctor ISphTokenizer(); /// trivial dtor virtual ~ISphTokenizer () {} public: /// set new translation table /// returns true on success, false on failure virtual bool SetCaseFolding ( const char * sConfig, CSphString & sError ); /// add additional range to translation table virtual void AddCaseFolding ( CSphRemapRange & tRange ); /// add special chars to translation table (SBCS only, for now) /// updates lowercaser so that these remap to -1 virtual void AddSpecials ( const char * sSpecials ); /// set ignored characters virtual bool SetIgnoreChars ( const char * sIgnored, CSphString & sError ); /// set n-gram characters (for CJK n-gram indexing) virtual bool SetNgramChars ( const char *, CSphString & ) { return true; } /// set n-gram length (for CJK n-gram indexing) virtual void SetNgramLen ( int ) {} /// load synonyms list virtual bool LoadSynonyms ( const char * sFilename, CSphString & sError ) = 0; /// set phrase boundary chars virtual bool SetBoundary ( const char * sConfig, CSphString & sError ); /// set blended characters virtual bool SetBlendChars ( const char * sConfig, CSphString & sError ); /// set blended tokens processing mode virtual bool SetBlendMode ( const char * sMode, CSphString & sError ); /// setup tokenizer using given settings virtual void Setup ( const CSphTokenizerSettings & tSettings ); /// create a tokenizer using the given settings static ISphTokenizer * Create ( const CSphTokenizerSettings & tSettings, CSphString & sError ); /// create a token filter static ISphTokenizer * CreateTokenFilter ( ISphTokenizer * pTokenizer, const CSphMultiformContainer * pContainer ); /// save tokenizer settings to a stream virtual const CSphTokenizerSettings & GetSettings () const { return m_tSettings; } /// get synonym file info virtual const CSphSavedFile & GetSynFileInfo () const { return m_tSynFileInfo; } /// mark as debug tokenizer's output --coreseek -mmseg virtual int DumpToken () { return m_tSettings.m_iDebug; } public: /// pass next buffer virtual void SetBuffer ( BYTE * sBuffer, int iLength ) = 0; /// get next token virtual BYTE * GetToken () = 0; /// calc codepoint length virtual int GetCodepointLength ( int iCode ) const = 0; /// handle tokens less than min_word_len if they match filter virtual void EnableQueryParserMode ( bool bEnable ) { m_bQueryMode = bEnable; m_bShortTokenFilter = bEnable; m_uBlendVariants = BLEND_TRIM_NONE; } /// enable indexing-time sentence boundary detection, and paragraph indexing virtual bool EnableSentenceIndexing ( CSphString & sError ); /// enable zone indexing virtual bool EnableZoneIndexing ( CSphString & sError ); /// enable tokenized multiform tracking virtual void EnableTokenizedMultiformTracking () {} /// get last token length, in codepoints virtual int GetLastTokenLen () const { return m_iLastTokenLen; } /// get last token boundary flag (true if there was a boundary before the token) virtual bool GetBoundary () { return m_bTokenBoundary; } /// get byte offset of the last boundary character virtual int GetBoundaryOffset () { return m_iBoundaryOffset; } /// was last token a special one? virtual bool WasTokenSpecial () { return m_bWasSpecial; } /// get amount of overshort keywords skipped before this token virtual int GetOvershortCount () { return m_iOvershortCount; } /// get original tokenized multiform (if any); NULL means there was none virtual BYTE * GetTokenizedMultiform () { return NULL; } virtual bool TokenIsBlended () { return m_bBlended; } virtual bool TokenIsBlendedPart () { return m_bBlendedPart; } virtual int SkipBlended () { return 0; } public: /// spawn a clone of my own virtual ISphTokenizer * Clone ( bool bEscaped ) const = 0; /// SBCS or UTF-8? virtual bool IsUtf8 () const = 0; /// start buffer point of last token virtual const char * GetTokenStart () const = 0; /// end buffer point of last token (exclusive, ie. *GetTokenEnd() is already NOT part of a token!) virtual const char * GetTokenEnd () const = 0; /// current buffer ptr virtual const char * GetBufferPtr () const = 0; /// buffer end virtual const char * GetBufferEnd () const = 0; /// set new buffer ptr (must be within current bounds) virtual void SetBufferPtr ( const char * sNewPtr ) = 0; public: //mmseg virtual const BYTE* GetThesaurus(BYTE * , int ) { return NULL; } // get settings hash uint64_t GetSettingsFNV () const { return m_tLC.GetFNV(); } protected: virtual bool RemapCharacters ( const char * sConfig, DWORD uFlags, const char * sSource, bool bCanRemap, CSphString & sError ); virtual bool AddSpecialsSPZ ( const char * sSpecials, const char * sDirective, CSphString & sError ); protected: static const int MAX_SYNONYM_LEN = 1024; ///< max synonyms map-from length, bytes static const BYTE BLEND_TRIM_NONE = 1; static const BYTE BLEND_TRIM_HEAD = 2; static const BYTE BLEND_TRIM_TAIL = 4; static const BYTE BLEND_TRIM_BOTH = 8; CSphLowercaser m_tLC; ///< my lowercaser int m_iLastTokenLen; ///< last token length, in codepoints int m_iLastTokenBufferLen; ///< the buffer length -- coreseek; use in mmseg patch. bool m_bTokenBoundary; ///< last token boundary flag (true after boundary codepoint followed by separator) bool m_bBoundary; ///< boundary flag (true immediately after boundary codepoint) int m_iBoundaryOffset; ///< boundary character offset (in bytes) bool m_bWasSpecial; ///< special token flag bool m_bEscaped; ///< backslash handling flag int m_iOvershortCount; ///< skipped overshort tokens count bool m_bBlended; ///< whether last token (as in just returned from GetToken()) was blended bool m_bNonBlended; ///< internal, whether there were any normal chars in that blended token bool m_bBlendedPart; ///< whether last token is a normal subtoken of a blended token bool m_bBlendAdd; ///< whether we have more pending blended variants (of current accumulator) to return BYTE m_uBlendVariants; ///< mask of blended variants as requested by blend_mode (see BLEND_TRIM_xxx flags) BYTE m_uBlendVariantsPending; ///< mask of pending blended variants (we clear bits as we return variants) bool m_bBlendSkipPure; ///< skip purely blended tokens bool m_bShortTokenFilter; ///< short token filter flag bool m_bQueryMode; ///< is this indexing time or searching time? bool m_bDetectSentences; ///< should we detect sentence boundaries? CSphTokenizerSettings m_tSettings; ///< tokenizer settings CSphSavedFile m_tSynFileInfo; ///< synonyms file info public: bool m_bPhrase; }; /// parse charset table bool sphParseCharset ( const char * sCharset, CSphVector & dRemaps ); /// create SBCS tokenizer ISphTokenizer * sphCreateSBCSTokenizer (); /// create UTF-8 tokenizer ISphTokenizer * sphCreateUTF8Tokenizer (); /// create UTF-8 tokenizer with n-grams support (for CJK n-gram indexing) ISphTokenizer * sphCreateUTF8NgramTokenizer (); ///////////////////////////////////////////////////////////////////////////// // DICTIONARIES ///////////////////////////////////////////////////////////////////////////// struct CSphDictSettings { CSphString m_sMorphology; CSphString m_sStopwords; CSphString m_sWordforms; int m_iMinStemmingLen; bool m_bWordDict; bool m_bCrc32; CSphDictSettings () : m_iMinStemmingLen ( 1 ) , m_bWordDict ( false ) , m_bCrc32 ( !USE_64BIT ) {} }; /// abstract word dictionary interface struct CSphWordHit; struct CSphDict { /// virtualizing dtor virtual ~CSphDict () {} /// get word ID by word, "text" version /// may apply stemming and modify word inplace /// returns 0 for stopwords virtual SphWordID_t GetWordID ( BYTE * pWord ) = 0; /// get word ID by word, "text" version /// may apply stemming and modify word inplace /// accepts words with already prepended MAGIC_WORD_HEAD /// appends MAGIC_WORD_TAIL /// returns 0 for stopwords virtual SphWordID_t GetWordIDWithMarkers ( BYTE * pWord ) { return GetWordID ( pWord ); } /// get word ID by word, "text" version /// does NOT apply stemming /// accepts words with already prepended MAGIC_WORD_HEAD_NONSTEMMED /// returns 0 for stopwords virtual SphWordID_t GetWordIDNonStemmed ( BYTE * pWord ) { return GetWordID ( pWord ); } /// get word ID by word, "binary" version /// only used with prefix/infix indexing /// must not apply stemming and modify anything /// filters stopwords on request virtual SphWordID_t GetWordID ( const BYTE * pWord, int iLen, bool bFilterStops ) = 0; /// apply stemmers to the given word virtual void ApplyStemmers ( BYTE * ) {} /// load stopwords from given files virtual void LoadStopwords ( const char * sFiles, ISphTokenizer * pTokenizer ) = 0; /// load wordforms from a given file virtual bool LoadWordforms ( const char * sFile, ISphTokenizer * pTokenizer, const char * sIndex ) = 0; /// set morphology virtual bool SetMorphology ( const char * szMorph, bool bUseUTF8, CSphString & sError ) = 0; virtual bool HasMorphology () const { return false; } /// setup dictionary using settings virtual void Setup ( const CSphDictSettings & tSettings ) = 0; /// get dictionary settings virtual const CSphDictSettings & GetSettings () const = 0; /// stopwords file infos virtual const CSphVector & GetStopwordsFileInfos () = 0; /// wordforms file infos virtual const CSphSavedFile & GetWordformsFileInfo () = 0; /// get multiwordforms virtual const CSphMultiformContainer * GetMultiWordforms () const = 0; /// check what given word is stopword virtual bool IsStopWord ( const BYTE * pWord ) const = 0; public: /// enable actually collecting keywords (needed for stopwords/wordforms loading) virtual void HitblockBegin () {} /// callback to let dictionary do hit block post-processing virtual void HitblockPatch ( CSphWordHit *, int ) {} /// resolve temporary hit block wide wordid (!) back to keyword virtual const char * HitblockGetKeyword ( SphWordID_t ) { return NULL; } /// check current memory usage virtual int HitblockGetMemUse () { return 0; } /// hit block dismissed virtual void HitblockReset () {} public: /// begin creating dictionary file, setup any needed internal structures virtual void DictBegin ( int iTmpDictFD, int iDictFD, int iDictLimit ); /// add next keyword entry to final dict virtual void DictEntry ( SphWordID_t uWordID, BYTE * sKeyword, int iDocs, int iHits, SphOffset_t iDoclistOffset, SphOffset_t iDoclistLength ); /// flush last entry virtual void DictEndEntries ( SphOffset_t iDoclistOffset ); /// end indexing, store dictionary and checkpoints virtual bool DictEnd ( SphOffset_t * pCheckpointsPos, int * pCheckpointsCount, int iMemLimit, CSphString & sError ); /// check whether there were any errors during indexing virtual bool DictIsError () const; /// make clone virtual CSphDict * Clone () const { return NULL; } virtual bool HasState () const { return false; } }; /// CRC32/FNV64 dictionary factory CSphDict * sphCreateDictionaryCRC ( const CSphDictSettings & tSettings, ISphTokenizer * pTokenizer, CSphString & sError, const char * sIndex ); /// keyword-storing dictionary factory CSphDict * sphCreateDictionaryKeywords ( const CSphDictSettings & tSettings, ISphTokenizer * pTokenizer, CSphString & sError, const char * sIndex ); /// clear wordform cache void sphShutdownWordforms (); ///////////////////////////////////////////////////////////////////////////// // DATASOURCES ///////////////////////////////////////////////////////////////////////////// /// hit position storage type typedef DWORD Hitpos_t; /// empty hit value #define EMPTY_HIT 0 /// hit processing tools /// (because we now allow multiple actual formats within a single storage type!) template < int FIELD_BITS > class Hitman_c { protected: enum { POS_BITS = 31 - FIELD_BITS, FIELD_OFF = 32 - FIELD_BITS, FIELDEND_OFF = 31 - FIELD_BITS, FIELDEND_MASK = (1UL << POS_BITS), POS_MASK = (1UL << POS_BITS) - 1, }; public: static Hitpos_t Create ( int iField, int iPos ) { return ( iField << FIELD_OFF ) + ( iPos & POS_MASK ); } static Hitpos_t Create ( int iField, int iPos, bool bEnd ) { return ( iField << FIELD_OFF ) + ( ((int)bEnd) << FIELDEND_OFF ) + ( iPos & POS_MASK ); } static inline int GetField ( Hitpos_t uHitpos ) { return uHitpos >> FIELD_OFF; } static inline int GetPos ( Hitpos_t uHitpos ) { return uHitpos & POS_MASK; } static inline bool IsEnd ( Hitpos_t uHitpos ) { return ( uHitpos & FIELDEND_MASK )!=0; } static inline DWORD GetLCS ( Hitpos_t uHitpos ) { return uHitpos & ~FIELDEND_MASK; } static void AddPos ( Hitpos_t * pHitpos, int iAdd ) { // FIXME! add range checks (eg. so that 0:0-1 does not overflow) *pHitpos += iAdd; } static Hitpos_t CreateSum ( Hitpos_t uHitpos, int iAdd ) { // FIXME! add range checks (eg. so that 0:0-1 does not overflow) return ( uHitpos+iAdd ) & ~FIELDEND_MASK; } static void SetEndMarker ( Hitpos_t * pHitpos ) { *pHitpos |= FIELDEND_MASK; } }; /// hit info struct CSphWordHit { SphDocID_t m_iDocID; ///< document ID SphWordID_t m_iWordID; ///< word ID in current dictionary Hitpos_t m_iWordPos; ///< word position in current document }; /// attribute locator within the row struct CSphAttrLocator { // OPTIMIZE? try packing these int m_iBitOffset; int m_iBitCount; bool m_bDynamic; CSphAttrLocator () : m_iBitOffset ( -1 ) , m_iBitCount ( -1 ) , m_bDynamic ( false ) {} inline bool IsBitfield () const { return ( m_iBitCount> ROWITEM_SHIFT; if ( tLoc.m_iBitCount==ROWITEM_BITS ) return pRow[iItem]; if ( tLoc.m_iBitCount==2*ROWITEM_BITS ) // FIXME? write a generalized version, perhaps return SphAttr_t ( pRow[iItem] ) + ( SphAttr_t ( pRow[iItem+1] ) << ROWITEM_BITS ); int iShift = tLoc.m_iBitOffset & ( ( 1 << ROWITEM_SHIFT )-1 ); return ( pRow[iItem] >> iShift ) & ( ( 1UL << tLoc.m_iBitCount )-1 ); } /// setter inline void sphSetRowAttr ( CSphRowitem * pRow, const CSphAttrLocator & tLoc, SphAttr_t uValue ) { assert(pRow); int iItem = tLoc.m_iBitOffset >> ROWITEM_SHIFT; if ( tLoc.m_iBitCount==2*ROWITEM_BITS ) { // FIXME? write a generalized version, perhaps pRow[iItem] = CSphRowitem ( uValue & ( ( SphAttr_t(1) << ROWITEM_BITS )-1 ) ); pRow[iItem+1] = CSphRowitem ( uValue >> ROWITEM_BITS ); } else if ( tLoc.m_iBitCount==ROWITEM_BITS ) { pRow[iItem] = CSphRowitem ( uValue ); } else { int iShift = tLoc.m_iBitOffset & ( ( 1 << ROWITEM_SHIFT )-1); CSphRowitem uMask = ( ( 1UL << tLoc.m_iBitCount )-1 ) << iShift; pRow[iItem] &= ~uMask; pRow[iItem] |= ( uMask & ( uValue << iShift ) ); } } /// pack length into row storage (22 bits max) /// returns number of bytes used inline int sphPackStrlen ( BYTE * pRow, int iLen ) { assert ( iLen>=0 && iLen<0x400000 ); if ( iLen<0x80 ) { pRow[0] = BYTE(iLen); return 1; } else if ( iLen<0x4000 ) { pRow[0] = BYTE ( ( iLen>>8 ) | 0x80 ); pRow[1] = BYTE ( iLen ); return 2; } else { pRow[0] = BYTE ( ( iLen>>16 ) | 0xc0 ); pRow[1] = BYTE ( iLen>>8 ); pRow[2] = BYTE ( iLen ); return 3; } } /// unpack string attr from row storage (22 bits length max) /// returns unpacked length; stores pointer to string data if required inline int sphUnpackStr ( const BYTE * pRow, const BYTE ** ppStr ) { int v = *pRow++; if ( v & 0x80 ) { if ( v & 0x40 ) { v = ( int ( v & 0x3f )<<16 ) + ( int ( *pRow++ )<<8 ); v += ( *pRow++ ); // MUST be separate statement; cf. sequence point } else { v = ( int ( v & 0x3f )<<8 ) + ( *pRow++ ); } } if ( ppStr ) *ppStr = pRow; return v; } /// search query match (document info plus weight/tag) class CSphMatch { public: SphDocID_t m_iDocID; ///< document ID const CSphRowitem * m_pStatic; ///< static part (stored in and owned by the index) CSphRowitem * m_pDynamic; ///< dynamic part (computed per query; owned by the match) int m_iWeight; ///< my computed weight int m_iTag; ///< my index tag public: /// ctor. clears everything CSphMatch () : m_iDocID ( 0 ) , m_pStatic ( NULL ) , m_pDynamic ( NULL ) , m_iWeight ( 0 ) , m_iTag ( 0 ) { } /// copy ctor. just in case CSphMatch ( const CSphMatch & rhs ) : m_pStatic ( 0 ) , m_pDynamic ( NULL ) { *this = rhs; } /// dtor. frees everything ~CSphMatch () { #ifndef NDEBUG if ( m_pDynamic ) m_pDynamic--; #endif SafeDeleteArray ( m_pDynamic ); } /// reset void Reset ( int iDynamic ) { // check that we're either initializing a new one, or NOT changing the current size assert ( iDynamic>=0 ); assert ( !m_pDynamic || iDynamic==(int)m_pDynamic[-1] ); m_iDocID = 0; if ( !m_pDynamic && iDynamic ) { #ifndef NDEBUG m_pDynamic = new CSphRowitem [ iDynamic+1 ]; *m_pDynamic++ = iDynamic; #else m_pDynamic = new CSphRowitem [ iDynamic ]; #endif } } public: /// assignment void Clone ( const CSphMatch & rhs, int iDynamic ) { // check that we're either initializing a new one, or NOT changing the current size assert ( iDynamic>=0 ); assert ( !m_pDynamic || iDynamic==(int)m_pDynamic[-1] ); m_iDocID = rhs.m_iDocID; m_iWeight = rhs.m_iWeight; m_pStatic = rhs.m_pStatic; m_iTag = rhs.m_iTag; if ( iDynamic ) { if ( !m_pDynamic ) { #ifndef NDEBUG m_pDynamic = new CSphRowitem [ iDynamic+1 ]; *m_pDynamic++ = iDynamic; #else m_pDynamic = new CSphRowitem [ iDynamic ]; #endif } assert ( rhs.m_pDynamic ); assert ( m_pDynamic[-1]==rhs.m_pDynamic[-1] ); // ensure we're not changing X to Y memcpy ( m_pDynamic, rhs.m_pDynamic, iDynamic*sizeof(CSphRowitem) ); } } public: /// integer getter SphAttr_t GetAttr ( const CSphAttrLocator & tLoc ) const { // m_pRowpart[tLoc.m_bDynamic] is 30% faster on MSVC 2005 // same time on gcc 4.x though, ~1 msec per 1M calls, so lets avoid the hassle for now if ( tLoc.m_iBitOffset>=0 ) return sphGetRowAttr ( tLoc.m_bDynamic ? m_pDynamic : m_pStatic, tLoc ); if ( tLoc.IsID() ) return m_iDocID; assert ( false && "Unknown negative-bitoffset locator" ); return 0; } /// float getter float GetAttrFloat ( const CSphAttrLocator & tLoc ) const { return sphDW2F ( (DWORD)sphGetRowAttr ( tLoc.m_bDynamic ? m_pDynamic : m_pStatic, tLoc ) ); }; /// integer setter void SetAttr ( const CSphAttrLocator & tLoc, SphAttr_t uValue ) { if ( tLoc.IsID() ) { // m_iDocID = uValue; return; } assert ( tLoc.m_bDynamic ); assert ( tLoc.GetMaxRowitem() < (int)m_pDynamic[-1] ); sphSetRowAttr ( m_pDynamic, tLoc, uValue ); } /// float setter void SetAttrFloat ( const CSphAttrLocator & tLoc, float fValue ) { assert ( tLoc.m_bDynamic ); assert ( tLoc.GetMaxRowitem() < (int)m_pDynamic[-1] ); sphSetRowAttr ( m_pDynamic, tLoc, sphF2DW ( fValue ) ); } /// MVA getter const DWORD * GetAttrMVA ( const CSphAttrLocator & tLoc, const DWORD * pPool ) const; private: /// "manually" prevent copying const CSphMatch & operator = ( const CSphMatch & ) { assert ( 0 && "internal error (CSphMatch::operator= called)" ); return *this; } }; /// specialized swapper inline void Swap ( CSphMatch & a, CSphMatch & b ) { Swap ( a.m_iDocID, b.m_iDocID ); Swap ( a.m_pStatic, b.m_pStatic ); Swap ( a.m_pDynamic, b.m_pDynamic ); Swap ( a.m_iWeight, b.m_iWeight ); Swap ( a.m_iTag, b.m_iTag ); } /// source statistics struct CSphSourceStats { int m_iTotalDocuments; ///< how much documents int64_t m_iTotalBytes; ///< how much bytes /// ctor CSphSourceStats () { Reset (); } /// reset void Reset () { m_iTotalDocuments = 0; m_iTotalBytes = 0; } }; /// known multi-valued attr sources enum ESphAttrSrc { SPH_ATTRSRC_NONE = 0, ///< not multi-valued SPH_ATTRSRC_FIELD = 1, ///< get attr values from text field SPH_ATTRSRC_QUERY = 2, ///< get attr values from SQL query SPH_ATTRSRC_RANGEDQUERY = 3 ///< get attr values from ranged SQL query }; /// wordpart processing type enum ESphWordpart { SPH_WORDPART_WHOLE = 0, ///< whole-word SPH_WORDPART_PREFIX = 1, ///< prefix SPH_WORDPART_INFIX = 2 ///< infix }; /// column unpack format enum ESphUnpackFormat { SPH_UNPACK_NONE = 0, SPH_UNPACK_ZLIB = 1, SPH_UNPACK_MYSQL_COMPRESS = 2 }; /// aggregate function to apply enum ESphAggrFunc { SPH_AGGR_NONE, SPH_AGGR_AVG, SPH_AGGR_MIN, SPH_AGGR_MAX, SPH_AGGR_SUM }; /// column evaluation stage enum ESphEvalStage { SPH_EVAL_STATIC = 0, ///< static data, no real evaluation needed SPH_EVAL_OVERRIDE, ///< static but possibly overridden SPH_EVAL_PREFILTER, ///< expression needed for full-text candidate matches filtering SPH_EVAL_PRESORT, ///< expression needed for final matches sorting SPH_EVAL_SORTER, ///< expression evaluated by sorter object SPH_EVAL_FINAL ///< expression not (!) used in filters/sorting; can be postponed until final result set cooking }; /// source column info struct CSphColumnInfo { CSphString m_sName; ///< column name #if USE_PYTHON_CASE_SENSIVE_ATTR CSphString m_sNameExactly; ///< column name --by coreseek, the exactly name #endif ESphAttr m_eAttrType; ///< attribute type ESphWordpart m_eWordpart; ///< wordpart processing type bool m_bIndexed; ///< whether to index this column as fulltext field too int m_iIndex; ///< index into source result set (-1 for joined fields) int m_iMVAIndex; ///< index the mva indexer, for faster reassign values. -pysource CSphAttrLocator m_tLocator; ///< attribute locator in the row ESphAttrSrc m_eSrc; ///< attr source (for multi-valued attrs only) CSphString m_sQuery; ///< query to retrieve values (for multi-valued attrs only) CSphString m_sQueryRange; ///< query to retrieve range (for multi-valued attrs only) CSphRefcountedPtr m_pExpr; ///< evaluator for expression items ESphAggrFunc m_eAggrFunc; ///< aggregate function on top of expression (for GROUP BY) ESphEvalStage m_eStage; ///< column evaluation stage (who and how computes this column) bool m_bPayload; bool m_bFilename; ///< column is a file name /// handy ctor CSphColumnInfo ( const char * sName=NULL, ESphAttr eType=SPH_ATTR_NONE ) : m_sName ( sName ) #if USE_PYTHON_CASE_SENSIVE_ATTR , m_sNameExactly ( sName ) #endif , m_eAttrType ( eType ) , m_eWordpart ( SPH_WORDPART_WHOLE ) , m_bIndexed ( false ) , m_iIndex ( -1 ) , m_iMVAIndex( -1 ) , m_eSrc ( SPH_ATTRSRC_NONE ) , m_pExpr ( NULL ) , m_eAggrFunc ( SPH_AGGR_NONE ) , m_eStage ( SPH_EVAL_STATIC ) , m_bPayload ( false ) , m_bFilename ( false ) { #if USE_PYTHON_CASE_SENSIVE_ATTR m_sNameExactly = m_sName; #endif m_sName.ToLower (); } /// equality comparison checks name, type, and locator bool operator == ( const CSphColumnInfo & rhs ) const { return m_sName==rhs.m_sName && m_eAttrType==rhs.m_eAttrType && m_tLocator.m_iBitCount==rhs.m_tLocator.m_iBitCount && m_tLocator.m_iBitOffset==rhs.m_tLocator.m_iBitOffset && m_tLocator.m_bDynamic==rhs.m_tLocator.m_bDynamic; } }; /// source schema struct CSphSchema { public: typedef SphDarts::DoubleArray::result_pair_type result_pair_type; CSphString m_sName; ///< my human-readable name CSphVector m_dFields; ///< my fulltext-searchable fields int m_iBaseFields; ///< how much fields are base, how much are additional (only affects indexer) SphDarts::DoubleArray* m_pfield_cache; ///< the field cache. void* m_pfield_cache_owner; public: /// ctor explicit CSphSchema ( const char * sName="(nameless)" ) : m_sName ( sName ), m_iBaseFields ( 0 ), m_iStaticSize ( 0 ) { m_pfield_cache = NULL; m_pfield_cache_owner = this; //avoid multi release when assign. } ~CSphSchema() { if(m_pfield_cache && m_pfield_cache_owner == this) { delete m_pfield_cache; m_pfield_cache = NULL; } } /// build the access cache int BuildFieldIndexCache(); /// get field index by name /// returns -1 if not found int GetFieldIndex ( const char * sName ) const; /// get attribute index by name /// returns -1 if not found int GetAttrIndex ( const char * sName ) const; /// checks if two schemas fully match (ie. fields names, attr names, types and locators are the same) /// describe mismatch (if any) to sError bool CompareTo ( const CSphSchema & rhs, CSphString & sError ) const; /// reset fields and attrs void Reset (); /// reset attrs only void ResetAttrs (); /// get row size (static+dynamic combined) int GetRowSize () const { return m_iStaticSize + m_dDynamicUsed.GetLength(); } /// get static row part size int GetStaticSize () const { return m_iStaticSize; } /// get dynamic row part size int GetDynamicSize () const { return m_dDynamicUsed.GetLength(); } /// get attrs count int GetAttrsCount () const { return m_dAttrs.GetLength(); } /// get attr by index const CSphColumnInfo & GetAttr ( int iIndex ) const { return m_dAttrs[iIndex]; } /// get attr by name const CSphColumnInfo * GetAttr ( const char * sName ) const; /// add attr void AddAttr ( const CSphColumnInfo & tAttr, bool bDynamic ); /// remove static attr (but do NOT recompute locations; for overrides) /// WARNING, THIS IS A HACK THAT WILL LIKELY BREAK THE SCHEMA, DO NOT USE THIS UNLESS ABSOLUTELY SURE! void RemoveAttr ( int iIndex ); protected: CSphVector m_dAttrs; ///< all my attributes CSphVector m_dStaticUsed; ///< static row part map (amount of used bits in each rowitem) CSphVector m_dDynamicUsed; ///< dynamic row part map int m_iStaticSize; ///< static row size (can be different from m_dStaticUsed.GetLength() because of gaps) }; /// HTML stripper class CSphHTMLStripper { public: explicit CSphHTMLStripper ( bool bDefaultTags ); bool SetIndexedAttrs ( const char * sConfig, CSphString & sError ); bool SetRemovedElements ( const char * sConfig, CSphString & sError ); bool SetZones ( const char * sZones, CSphString & sError ); void EnableParagraphs (); void Strip ( BYTE * sData ) const; public: struct StripperTag_t { CSphString m_sTag; ///< tag name int m_iTagLen; ///< tag name length bool m_bInline; ///< whether this tag is inline bool m_bIndexAttrs; ///< whether to index attrs bool m_bRemove; ///< whether to remove contents bool m_bPara; ///< whether to mark a paragraph boundary bool m_bZone; ///< whether to mark a zone boundary bool m_bZonePrefix; ///< whether the zone name is a full name or a prefix CSphVector m_dAttrs; ///< attr names to index StripperTag_t () : m_iTagLen ( 0 ) , m_bInline ( false ) , m_bIndexAttrs ( false ) , m_bRemove ( false ) , m_bPara ( false ) , m_bZone ( false ) , m_bZonePrefix ( false ) {} inline bool operator < ( const StripperTag_t & rhs ) const { return strcmp ( m_sTag.cstr(), rhs.m_sTag.cstr() )<0; } }; /// finds appropriate tag and zone name ( tags zone name could be prefix only ) /// advances source to the end of the tag const BYTE * FindTag ( const BYTE * sSrc, const StripperTag_t ** ppTag, const BYTE ** ppZoneName, int * pZoneNameLen ) const; bool IsValidTagStart ( int iCh ) const; protected: static const int MAX_CHAR_INDEX = 28; ///< max valid char index (a-z, underscore, colon) CSphVector m_dTags; ///< known tags to index attrs and/or to remove contents int m_dStart[MAX_CHAR_INDEX]; ///< maps index of the first tag name char to start offset in m_dTags int m_dEnd[MAX_CHAR_INDEX]; ///< maps index of the first tag name char to end offset in m_dTags protected: int GetCharIndex ( int iCh ) const; ///< calcs index by raw char void UpdateTags (); ///< sorts tags, updates internal helpers }; /// indexing-related source settings /// NOTE, newly added fields should be synced with CSphSource::Setup() struct CSphSourceSettings { int m_iMinPrefixLen; ///< min indexable prefix (0 means don't index prefixes) int m_iMinInfixLen; ///< min indexable infix length (0 means don't index infixes) int m_iBoundaryStep; ///< additional boundary word position increment bool m_bIndexExactWords; ///< exact (non-stemmed) word indexing flag int m_iOvershortStep; ///< position step on overshort token (default is 1) int m_iStopwordStep; ///< position step on stopword token (default is 1) bool m_bIndexSP; ///< whether to index sentence and paragraph delimiters int m_bDebugDump; ///< mmseg charset debug output feature CSphVector m_dPrefixFields; ///< list of prefix fields CSphVector m_dInfixFields; ///< list of infix fields explicit CSphSourceSettings (); ESphWordpart GetWordpart ( const char * sField, bool bWordDict ); }; /// hit vector interface /// because specific position type might vary (dword, qword, etc) /// but we don't want to template and instantiate everything because of that class ISphHits { public: int Length () const { return m_dData.GetLength(); } const CSphWordHit * First () const { return m_dData.Begin(); } const CSphWordHit * Last () const { return &m_dData.Last(); } void AddHit ( SphDocID_t uDocid, SphWordID_t uWordid, Hitpos_t uPos ) { if ( uWordid ) { CSphWordHit & tHit = m_dData.Add(); tHit.m_iDocID = uDocid; tHit.m_iWordID = uWordid; tHit.m_iWordPos = uPos; } } public: CSphVector m_dData; }; /// generic data source class CSphSource : public CSphSourceSettings { public: CSphMatch m_tDocInfo; ///< current document info CSphVector m_dStrAttrs; ///< current document string attrs public: /// ctor explicit CSphSource ( const char * sName ); /// dtor virtual ~CSphSource (); /// set dictionary void SetDict ( CSphDict * dict ); /// set HTML stripping mode /// /// sExtractAttrs defines what attributes to store. format is "img=alt; a=alt,title". /// empty string means to strip all tags; NULL means to disable stripping. /// /// sRemoveElements defines what elements to cleanup. format is "style, script" /// /// on failure, returns false and fills sError bool SetStripHTML ( const char * sExtractAttrs, const char * sRemoveElements, bool bDetectParagraphs, const char * sZones, CSphString & sError ); /// set tokenizer void SetTokenizer ( ISphTokenizer * pTokenizer ); /// set rows dump file virtual void SetDumpRows ( FILE * ) {} /// get stats virtual const CSphSourceStats & GetStats (); /// updates schema fields and attributes /// updates pInfo if it's empty; checks for match if it's not /// must be called after IterateStart(); will always fail otherwise virtual bool UpdateSchema ( CSphSchema * pInfo, CSphString & sError ); /// setup misc indexing settings (prefix/infix/exact-word indexing, position steps) void Setup ( const CSphSourceSettings & tSettings ); public: /// connect to the source (eg. to the database) /// connection settings are specific for each source type and as such /// are implemented in specific descendants virtual bool Connect ( CSphString & sError ) = 0; /// disconnect from the source virtual void Disconnect () = 0; /// check if there are any attributes configured /// note that there might be NO actual attributes in the case if configured /// ones do not match those actually returned by the source virtual bool HasAttrsConfigured () = 0; /// check if there are any joined fields virtual bool HasJoinedFields () { return false; } /// begin indexing this source /// to be implemented by descendants virtual bool IterateStart ( CSphString & sError ) = 0; /// get next document /// to be implemented by descendants /// returns false on error /// returns true and fills m_tDocInfo on success /// returns true and sets m_tDocInfo.m_iDocID to 0 on eof virtual bool IterateDocument ( CSphString & sError ) = 0; /// get next hits chunk for current document /// to be implemented by descendants /// returns NULL when there are no more hits /// returns pointer to hit vector (with at most MAX_SOURCE_HITS) on success /// fills out-string with error message on failure virtual ISphHits * IterateHits ( CSphString & sError ) = 0; /// get joined hits from joined fields (w/o attached docinfos) /// returns false and fills out-string with error message on failure /// returns true and sets m_tDocInfo.m_uDocID to 0 on eof /// returns true and sets m_tDocInfo.m_uDocID to non-0 on success virtual ISphHits * IterateJoinedHits ( CSphString & sError ); /// begin iterating values of out-of-document multi-valued attribute iAttr /// will fail if iAttr is out of range, or is not multi-valued /// can also fail if configured settings are invalid (eg. SQL query can not be executed) virtual bool IterateMultivaluedStart ( int iAttr, CSphString & sError ) = 0; /// get next multi-valued (id,attr-value) tuple to m_tDocInfo virtual bool IterateMultivaluedNext () = 0; /// begin iterating values of multi-valued attribute iAttr stored in a field /// will fail if iAttr is out of range, or is not multi-valued virtual bool IterateFieldMVAStart ( int iAttr, CSphString & sError ) = 0; /// get next multi-valued (id,attr-value) tuple to m_tDocInfo virtual bool IterateFieldMVANext () = 0; /// begin iterating kill list virtual bool IterateKillListStart ( CSphString & sError ) = 0; /// get next kill list doc id virtual bool IterateKillListNext ( SphDocID_t & tDocId ) = 0; /// post-index callback /// gets called when the indexing is succesfully (!) over virtual void PostIndex () {} public: //append by -coreseek for -pysource. no NOT use this out side of pysource virtual void AddHit ( SphDocID_t , SphWordID_t , Hitpos_t ) {} protected: ISphTokenizer * m_pTokenizer; ///< my tokenizer CSphDict * m_pDict; ///< my dict CSphSourceStats m_tStats; ///< my stats CSphSchema m_tSchema; ///< my schema bool m_bStripHTML; ///< whether to strip HTML CSphHTMLStripper * m_pStripper; ///< my HTML stripper int m_iNullIds; int m_iMaxIds; SphDocID_t VerifyID ( SphDocID_t uID ); }; /// how to handle IO errors in file fields enum ESphOnFileFieldError { FFE_IGNORE_FIELD, FFE_SKIP_DOCUMENT, FFE_FAIL_INDEX }; /// generic document source /// provides multi-field support and generic tokenizer class CSphSource_Document : public CSphSource { public: /// ctor explicit CSphSource_Document ( const char * sName ); /// dtor virtual ~CSphSource_Document () { SafeDeleteArray ( m_pReadFileBuffer ); } /// my generic tokenizer virtual bool IterateDocument ( CSphString & sError ); virtual ISphHits * IterateHits ( CSphString & sError ); virtual void BuildHits ( CSphString & sError, bool bSkipEndMarker ); //change to virtual -> pysource. virtual BYTE* GetField ( int iFieldIndex); // reused by -pysource /// field data getter /// to be implemented by descendants virtual BYTE ** NextDocument ( CSphString & sError ) = 0; virtual void SetDumpRows ( FILE * fpDumpRows ) { m_fpDumpRows = fpDumpRows; } protected: void ParseFieldMVA ( CSphVector < CSphVector < DWORD > > & dFieldMVAs, int iFieldMVA, const char * szValue ); bool CheckFileField ( const BYTE * sField ); int LoadFileField ( BYTE ** ppField, CSphString & sError ); void BuildSubstringHits ( SphDocID_t uDocid, bool bPayload, ESphWordpart eWordpart, bool bSkipEndMarker ); void BuildRegularHits ( SphDocID_t uDocid, bool bPayload, bool bSkipEndMarker ); protected: ISphHits m_tHits; ///< my hitvector protected: char * m_pReadFileBuffer; int m_iReadFileBufferSize; ///< size of read buffer for the 'sql_file_field' fields int m_iMaxFileBufferSize; ///< max size of read buffer for the 'sql_file_field' fields ESphOnFileFieldError m_eOnFileFieldError; FILE * m_fpDumpRows; protected: struct CSphBuildHitsState_t { bool m_bProcessingHits; bool m_bDocumentDone; BYTE ** m_dFields; int m_iStartPos; Hitpos_t m_iHitPos; int m_iField; int m_iStartField; int m_iEndField; int m_iBuildLastStep; CSphBuildHitsState_t (); }; CSphBuildHitsState_t m_tState; int m_iMaxHits; }; struct CSphUnpackInfo { ESphUnpackFormat m_eFormat; CSphString m_sName; }; struct CSphJoinedField { CSphString m_sName; CSphString m_sQuery; CSphString m_sRanged; bool m_bPayload; }; /// generic SQL source params struct CSphSourceParams_SQL { // query params CSphString m_sQuery; CSphString m_sQueryRange; CSphString m_sQueryKilllist; int m_iRangeStep; int m_iRefRangeStep; bool m_bPrintQueries; CSphVector m_dQueryPre; CSphVector m_dQueryPost; CSphVector m_dQueryPostIndex; CSphVector m_dAttrs; CSphVector m_dFileFields; int m_iRangedThrottle; int m_iMaxFileBufferSize; ESphOnFileFieldError m_eOnFileFieldError; CSphVector m_dUnpack; DWORD m_uUnpackMemoryLimit; CSphVector m_dJoinedFields; // connection params CSphString m_sHost; CSphString m_sUser; CSphString m_sPass; CSphString m_sDB; int m_iPort; CSphSourceParams_SQL (); }; /// generic SQL source /// multi-field plain-text documents fetched from given query struct CSphSource_SQL : CSphSource_Document { explicit CSphSource_SQL ( const char * sName ); virtual ~CSphSource_SQL () {} bool Setup ( const CSphSourceParams_SQL & pParams ); virtual bool Connect ( CSphString & sError ); virtual void Disconnect (); virtual bool IterateStart ( CSphString & sError ); virtual BYTE ** NextDocument ( CSphString & sError ); virtual void PostIndex (); virtual bool HasAttrsConfigured () { return m_tParams.m_dAttrs.GetLength()!=0; } virtual bool HasJoinedFields () { return m_tSchema.m_iBaseFields!=m_tSchema.m_dFields.GetLength(); } virtual ISphHits * IterateJoinedHits ( CSphString & sError ); virtual bool IterateMultivaluedStart ( int iAttr, CSphString & sError ); virtual bool IterateMultivaluedNext (); virtual bool IterateFieldMVAStart ( int iAttr, CSphString & sError ); virtual bool IterateFieldMVANext (); virtual bool IterateKillListStart ( CSphString & sError ); virtual bool IterateKillListNext ( SphDocID_t & tDocId ); private: bool m_bSqlConnected; ///< am i connected? protected: CSphString m_sSqlDSN; BYTE * m_dFields [ SPH_MAX_FIELDS ]; ESphUnpackFormat m_dUnpack [ SPH_MAX_FIELDS ]; SphDocID_t m_uMinID; ///< grand min ID SphDocID_t m_uMaxID; ///< grand max ID SphDocID_t m_uCurrentID; ///< current min ID SphDocID_t m_uMaxFetchedID; ///< max actually fetched ID int m_iMultiAttr; ///< multi-valued attr being currently fetched int m_iSqlFields; ///< field count (for row dumper) int m_iFieldMVA; int m_iFieldMVAIterator; CSphVector < CSphVector > m_dFieldMVAs; CSphVector < int > m_dAttrToFieldMVA; CSphSourceParams_SQL m_tParams; bool m_bCanUnpack; bool m_bUnpackFailed; bool m_bUnpackOverflow; CSphVector m_dUnpackBuffers [ SPH_MAX_FIELDS ]; int m_iJoinedHitField; ///< currently pulling joined hits from this field (index into schema; -1 if not pulling) SphDocID_t m_iJoinedHitID; ///< last document id int m_iJoinedHitPos; ///< last hit position static const int MACRO_COUNT = 2; static const char * const MACRO_VALUES [ MACRO_COUNT ]; protected: bool SetupRanges ( const char * sRangeQuery, const char * sQuery, const char * sPrefix, CSphString & sError ); bool RunQueryStep ( const char * sQuery, CSphString & sError ); protected: virtual void SqlDismissResult () = 0; virtual bool SqlQuery ( const char * sQuery ) = 0; virtual bool SqlIsError () = 0; virtual const char * SqlError () = 0; virtual bool SqlConnect () = 0; virtual void SqlDisconnect () = 0; virtual int SqlNumFields() = 0; virtual bool SqlFetchRow() = 0; virtual DWORD SqlColumnLength ( int iIndex ) = 0; virtual const char * SqlColumn ( int iIndex ) = 0; virtual const char * SqlFieldName ( int iIndex ) = 0; const char * SqlUnpackColumn ( int iIndex, ESphUnpackFormat eFormat ); void ReportUnpackError ( int iIndex, int iError ); }; #if USE_MYSQL /// MySQL source params struct CSphSourceParams_MySQL : CSphSourceParams_SQL { CSphString m_sUsock; ///< UNIX socket int m_iFlags; ///< connection flags CSphString m_sSslKey; CSphString m_sSslCert; CSphString m_sSslCA; CSphSourceParams_MySQL (); ///< ctor. sets defaults }; /// MySQL source implementation /// multi-field plain-text documents fetched from given query struct CSphSource_MySQL : CSphSource_SQL { explicit CSphSource_MySQL ( const char * sName ); bool Setup ( const CSphSourceParams_MySQL & tParams ); protected: MYSQL_RES * m_pMysqlResult; MYSQL_FIELD * m_pMysqlFields; MYSQL_ROW m_tMysqlRow; MYSQL m_tMysqlDriver; unsigned long * m_pMysqlLengths; CSphString m_sMysqlUsock; int m_iMysqlConnectFlags; CSphString m_sSslKey; CSphString m_sSslCert; CSphString m_sSslCA; protected: virtual void SqlDismissResult (); virtual bool SqlQuery ( const char * sQuery ); virtual bool SqlIsError (); virtual const char * SqlError (); virtual bool SqlConnect (); virtual void SqlDisconnect (); virtual int SqlNumFields(); virtual bool SqlFetchRow(); virtual DWORD SqlColumnLength ( int iIndex ); virtual const char * SqlColumn ( int iIndex ); virtual const char * SqlFieldName ( int iIndex ); }; #endif // USE_MYSQL #if USE_PGSQL /// PgSQL specific source params struct CSphSourceParams_PgSQL : CSphSourceParams_SQL { CSphString m_sClientEncoding; CSphSourceParams_PgSQL (); }; /// PgSQL source implementation /// multi-field plain-text documents fetched from given query struct CSphSource_PgSQL : CSphSource_SQL { explicit CSphSource_PgSQL ( const char * sName ); bool Setup ( const CSphSourceParams_PgSQL & pParams ); virtual bool IterateStart ( CSphString & sError ); protected: PGresult * m_pPgResult; ///< postgresql execution restult context PGconn * m_tPgDriver; ///< postgresql connection context int m_iPgRows; ///< how much rows last step returned int m_iPgRow; ///< current row (0 based, as in PQgetvalue) CSphString m_sPgClientEncoding; CSphVector m_dIsColumnBool; protected: virtual void SqlDismissResult (); virtual bool SqlQuery ( const char * sQuery ); virtual bool SqlIsError (); virtual const char * SqlError (); virtual bool SqlConnect (); virtual void SqlDisconnect (); virtual int SqlNumFields(); virtual bool SqlFetchRow(); virtual DWORD SqlColumnLength ( int iIndex ); virtual const char * SqlColumn ( int iIndex ); virtual const char * SqlFieldName ( int iIndex ); }; #endif // USE_PGSQL #if USE_ODBC struct CSphSourceParams_ODBC: CSphSourceParams_SQL { CSphString m_sOdbcDSN; ///< ODBC DSN CSphString m_sColBuffers; ///< column buffer sizes (eg "col1=2M, col2=4M") bool m_bWinAuth; ///< auth type (MS SQL only) bool m_bUnicode; ///< whether to ask for Unicode or SBCS (C char) data (MS SQL only) CSphSourceParams_ODBC (); }; /// ODBC source implementation struct CSphSource_ODBC : CSphSource_SQL { explicit CSphSource_ODBC ( const char * sName ); bool Setup ( const CSphSourceParams_ODBC & tParams ); protected: virtual void SqlDismissResult (); virtual bool SqlQuery ( const char * sQuery ); virtual bool SqlIsError (); virtual const char * SqlError (); virtual bool SqlConnect (); virtual void SqlDisconnect (); virtual int SqlNumFields(); virtual bool SqlFetchRow(); virtual const char * SqlColumn ( int iIndex ); virtual const char * SqlFieldName ( int iIndex ); virtual DWORD SqlColumnLength ( int iIndex ); virtual void OdbcPostConnect () {} protected: CSphString m_sOdbcDSN; bool m_bWinAuth; bool m_bUnicode; SQLHENV m_hEnv; SQLHDBC m_hDBC; SQLHANDLE m_hStmt; int m_nResultCols; CSphString m_sError; struct QueryColumn_t { CSphVector m_dContents; CSphVector m_dRaw; CSphString m_sName; SQLLEN m_iInd; int m_iBufferSize; ///< size of m_dContents and m_dRaw buffers, in bytes bool m_bUnicode; ///< whether this column needs UCS-2 to UTF-8 translation bool m_bTruncated; ///< whether data was truncated when fetching rows }; static const int DEFAULT_COL_SIZE = 1024; ///< default column buffer size static const int VARCHAR_COL_SIZE = 1048576; ///< default column buffer size for VARCHAR columns static const int MAX_COL_SIZE = 8*1048576; ///< hard limit on column buffer size static const int WARN_ROW_SIZE = 32*1048576; ///< warning thresh (NOT a hard limit) on row buffer size CSphVector m_dColumns; SmallStringHash_T m_hColBuffers; void GetSqlError ( SQLSMALLINT iHandleType, SQLHANDLE hHandle ); }; /// MS SQL source implemenation struct CSphSource_MSSQL : public CSphSource_ODBC { explicit CSphSource_MSSQL ( const char * sName ) : CSphSource_ODBC ( sName ) {} virtual void OdbcPostConnect (); }; #endif // USE_ODBC /// XML pipe source implementation class CSphSource_XMLPipe : public CSphSource { public: CSphSource_XMLPipe ( BYTE * dInitialBuf, int iBufLen, const char * sName ); ///< ctor ~CSphSource_XMLPipe (); ///< dtor bool Setup ( FILE * pPipe, const char * sCommand ); ///< memorize the command virtual bool Connect ( CSphString & sError ); ///< run the command and open the pipe virtual void Disconnect (); ///< close the pipe virtual bool IterateStart ( CSphString & ) { return true; } ///< Connect() starts getting documents automatically, so this one is empty virtual bool IterateDocument ( CSphString & sError ); ///< parse incoming chunk and emit document virtual ISphHits * IterateHits ( CSphString & sError ); ///< parse incoming chunk and emit some hits virtual bool HasAttrsConfigured () { return true; } ///< xmlpipe always has some attrs for now virtual bool IterateMultivaluedStart ( int, CSphString & ) { return false; } ///< xmlpipe does not support multi-valued attrs for now virtual bool IterateMultivaluedNext () { return false; } ///< xmlpipe does not support multi-valued attrs for now virtual bool IterateFieldMVAStart ( int, CSphString & ) { return false; } virtual bool IterateFieldMVANext () { return false; } virtual bool IterateKillListStart ( CSphString & ) { return false; } virtual bool IterateKillListNext ( SphDocID_t & ) { return false; } private: enum Tag_e { TAG_DOCUMENT = 0, TAG_ID, TAG_GROUP, TAG_TITLE, TAG_BODY }; private: CSphString m_sCommand; ///< my command Tag_e m_eTag; ///< what's our current tag const char * m_pTag; ///< tag name int m_iTagLength; ///< tag name length int m_iBufferSize; ///< buffer size bool m_bEOF; ///< EOF encountered bool m_bWarned; ///< warned of buffer size already int m_iInitialBufLen; ///< initial buffer len FILE * m_pPipe; ///< incoming stream BYTE * m_sBuffer; ///< buffer BYTE * m_pBuffer; ///< current buffer pos BYTE * m_pBufferEnd; ///< buffered end pos int m_iWordPos; ///< current word position ISphHits m_tHits; ///< my hitvector bool m_bHitsReady; private: /// set current tag void SetTag ( const char * sTag ); /// read in some more data /// moves everything from current ptr (m_pBuffer) to the beginng /// reads in as much data as possible to the end /// returns false on EOF bool UpdateBuffer (); /// skips whitespace /// does buffer updates /// returns false on EOF bool SkipWhitespace (); /// check if what's at current pos is either opening/closing current tag (m_pTag) /// return false on failure bool CheckTag ( bool bOpen, CSphString & sError ); /// skips whitespace and opening/closing current tag (m_pTag) /// returns false on failure bool SkipTag ( bool bOpen, CSphString & sError ); /// scan for tag with integer value bool ScanInt ( const char * sTag, DWORD * pRes, CSphString & sError ); /// scan for tag with integer value bool ScanInt ( const char * sTag, uint64_t * pRes, CSphString & sError ); /// scan for tag with integer value bool ScanInt ( const char * sTag, int64_t * pRes, CSphString & sError ) { return ScanInt ( sTag, (uint64_t*)pRes, sError ); } /// scan for tag with string value bool ScanStr ( const char * sTag, char * pRes, int iMaxLength, CSphString & sError ); /// check for hits overun hits buffer void CheckHitsCount ( const char * sField ); }; #if USE_LIBEXPAT || USE_LIBXML class CSphConfigSection; CSphSource * sphCreateSourceXmlpipe2 ( const CSphConfigSection * pSource, FILE * pPipe, BYTE * dInitialBuf, int iBufLen, const char * szSourceName, int iMaxFieldLen ); #endif FILE * sphDetectXMLPipe ( const char * szCommand, BYTE * dBuf, int & iBufSize, int iMaxBufSize, bool & bUsePipe2 ); ///////////////////////////////////////////////////////////////////////////// // SEARCH QUERIES ///////////////////////////////////////////////////////////////////////////// /// search query sorting orders enum ESphSortOrder { SPH_SORT_RELEVANCE = 0, ///< sort by document relevance desc, then by date SPH_SORT_ATTR_DESC = 1, ///< sort by document date desc, then by relevance desc SPH_SORT_ATTR_ASC = 2, ///< sort by document date asc, then by relevance desc SPH_SORT_TIME_SEGMENTS = 3, ///< sort by time segments (hour/day/week/etc) desc, then by relevance desc SPH_SORT_EXTENDED = 4, ///< sort by SQL-like expression (eg. "@relevance DESC, price ASC, @id DESC") SPH_SORT_EXPR = 5, ///< sort by arithmetic expression in descending order (eg. "@id + max(@weight,1000)*boost + log(price)") SPH_SORT_TOTAL }; /// search query matching mode enum ESphMatchMode { SPH_MATCH_ALL = 0, ///< match all query words SPH_MATCH_ANY, ///< match any query word SPH_MATCH_PHRASE, ///< match this exact phrase SPH_MATCH_BOOLEAN, ///< match this boolean query SPH_MATCH_EXTENDED, ///< match this extended query SPH_MATCH_FULLSCAN, ///< match all document IDs w/o fulltext query, apply filters SPH_MATCH_EXTENDED2, ///< extended engine V2 (TEMPORARY, WILL BE REMOVED IN 0.9.8-RELEASE) SPH_MATCH_TOTAL }; /// search query relevance ranking mode enum ESphRankMode { SPH_RANK_PROXIMITY_BM25 = 0, ///< default mode, phrase proximity major factor and BM25 minor one (aka SPH03) SPH_RANK_BM25 = 1, ///< statistical mode, BM25 ranking only (faster but worse quality) SPH_RANK_NONE = 2, ///< no ranking, all matches get a weight of 1 SPH_RANK_WORDCOUNT = 3, ///< simple word-count weighting, rank is a weighted sum of per-field keyword occurence counts SPH_RANK_PROXIMITY = 4, ///< phrase proximity (aka SPH01) SPH_RANK_MATCHANY = 5, ///< emulate old match-any weighting (aka SPH02) SPH_RANK_FIELDMASK = 6, ///< sets bits where there were matches SPH_RANK_SPH04 = 7, ///< codename SPH04, phrase proximity + bm25 + head/exact boost SPH_RANK_EXPR = 8, ///< rank by user expression (eg. "sum(lcs*user_weight)*1000+bm25") SPH_RANK_TOTAL, SPH_RANK_DEFAULT = SPH_RANK_PROXIMITY_BM25 }; /// search query grouping mode enum ESphGroupBy { SPH_GROUPBY_DAY = 0, ///< group by day SPH_GROUPBY_WEEK = 1, ///< group by week SPH_GROUPBY_MONTH = 2, ///< group by month SPH_GROUPBY_YEAR = 3, ///< group by year SPH_GROUPBY_ATTR = 4, ///< group by attribute value SPH_GROUPBY_ATTRPAIR= 5 ///< group by sequential attrs pair (rendered redundant by 64bit attrs support; removed) }; /// search query filter types enum ESphFilter { SPH_FILTER_VALUES = 0, ///< filter by integer values set SPH_FILTER_RANGE = 1, ///< filter by integer range SPH_FILTER_FLOATRANGE = 2 ///< filter by float range }; /// search query filter class CSphFilterSettings { public: CSphString m_sAttrName; ///< filtered attribute name bool m_bExclude; ///< whether this is "include" or "exclude" filter (default is "include") ESphFilter m_eType; ///< filter type union { SphAttr_t m_uMinValue; ///< range min float m_fMinValue; ///< range min }; union { SphAttr_t m_uMaxValue; ///< range max float m_fMaxValue; ///< range max }; CSphVector m_dValues; ///< integer values set public: CSphFilterSettings (); void SetExternalValues ( const SphAttr_t * pValues, int nValues ); SphAttr_t GetValue ( int iIdx ) const { assert ( iIdx m_dValues; ///< id-value overrides }; /// query selection item struct CSphQueryItem { CSphString m_sExpr; ///< expression to compute CSphString m_sAlias; ///< alias to return ESphAggrFunc m_eAggrFunc; CSphQueryItem() : m_eAggrFunc ( SPH_AGGR_NONE ) {} }; /// known collations enum ESphCollation { SPH_COLLATION_LIBC_CI, SPH_COLLATION_LIBC_CS, SPH_COLLATION_UTF8_GENERAL_CI, SPH_COLLATION_BINARY, SPH_COLLATION_DEFAULT = SPH_COLLATION_LIBC_CI }; /// search query class CSphQuery { public: CSphString m_sIndexes; ///< indexes to search CSphString m_sQuery; ///< cooked query string for the engine (possibly transformed during legacy matching modes fixup) CSphString m_sRawQuery; ///< raw query string from the client for searchd log, agents, etc int m_iOffset; ///< offset into result set (as X in MySQL LIMIT X,Y clause) int m_iLimit; ///< limit into result set (as Y in MySQL LIMIT X,Y clause) DWORD * m_pWeights; ///< user-supplied per-field weights. may be NULL. default is NULL. NOT OWNED, WILL NOT BE FREED in dtor. int m_iWeights; ///< number of user-supplied weights. missing fields will be assigned weight 1. default is 0 ESphMatchMode m_eMode; ///< match mode. default is "match all" ESphRankMode m_eRanker; ///< ranking mode, default is proximity+BM25 CSphString m_sRankerExpr; ///< ranking expression for SPH_RANK_EXPR ESphSortOrder m_eSort; ///< sort mode CSphString m_sSortBy; ///< attribute to sort by int m_iMaxMatches; ///< max matches to retrieve, default is 1000. more matches use more memory and CPU time to hold and sort them CSphVector m_dFilters; ///< filters CSphString m_sGroupBy; ///< group-by attribute name ESphGroupBy m_eGroupFunc; ///< function to pre-process group-by attribute value with CSphString m_sGroupSortBy; ///< sorting clause for groups in group-by mode CSphString m_sGroupDistinct; ///< count distinct values for this attribute int m_iCutoff; ///< matches count threshold to stop searching at (default is 0; means to search until all matches are found) int m_iRetryCount; ///< retry count, for distributed queries int m_iRetryDelay; ///< retry delay, for distributed queries bool m_bGeoAnchor; ///< do we have an anchor CSphString m_sGeoLatAttr; ///< latitude attr name CSphString m_sGeoLongAttr; ///< longitude attr name float m_fGeoLatitude; ///< anchor latitude float m_fGeoLongitude; ///< anchor longitude CSphVector m_dIndexWeights; ///< per-index weights CSphVector m_dFieldWeights; ///< per-field weights DWORD m_uMaxQueryMsec; ///< max local index search time, in milliseconds (default is 0; means no limit) CSphString m_sComment; ///< comment to pass verbatim in the log file CSphVector m_dOverrides; ///< per-query attribute value overrides CSphString m_sSelect; ///< select-list (attributes and/or expressions) CSphString m_sOrderBy; ///< order-by clause bool m_bReverseScan; ///< perform scan in reverse order int m_iSQLSelectStart; ///< SQL parser helper int m_iSQLSelectEnd; ///< SQL parser helper public: int m_iOldVersion; ///< version, to fixup old queries int m_iOldGroups; ///< 0.9.6 group filter values count DWORD * m_pOldGroups; ///< 0.9.6 group filter values DWORD m_iOldMinTS; ///< 0.9.6 min timestamp DWORD m_iOldMaxTS; ///< 0.9.6 max timestamp DWORD m_iOldMinGID; ///< 0.9.6 min group id DWORD m_iOldMaxGID; ///< 0.9.6 max group id public: CSphVector m_dItems; ///< parsed select-list ESphCollation m_eCollation; ///< ORDER BY collation bool m_bAgent; ///< agent mode (may need extra cols on output) public: CSphQuery (); ///< ctor, fills defaults ~CSphQuery (); ///< dtor, frees owned stuff /// return index weight from m_dIndexWeights; or 1 by default int GetIndexWeight ( const char * sName ) const; /// parse select list string into items bool ParseSelectList ( CSphString & sError ); }; /// search query meta-info class CSphQueryResultMeta { public: int m_iQueryTime; ///< query time, milliseconds int64_t m_iCpuTime; ///< user time, microseconds int m_iMultiplier; ///< multi-query multiplier, -1 to indicate error struct WordStat_t { int m_iDocs; ///< document count for this term int m_iHits; ///< hit count for this term bool m_bExpanded; ///< is this term from query itself or was expanded WordStat_t() : m_iDocs ( 0 ) , m_iHits ( 0 ) , m_bExpanded ( false ) {} }; SmallStringHash_T m_hWordStats; ///< hash of i-th search term (normalized word form) int m_iMatches; ///< total matches returned (upto MAX_MATCHES) int m_iTotalMatches; ///< total matches found (unlimited) CSphString m_sError; ///< error message CSphString m_sWarning; ///< warning message CSphQueryResultMeta (); ///< ctor virtual ~CSphQueryResultMeta () {} ///< dtor void AddStat ( const CSphString & sWord, int iDocs, int iHits, bool bExpanded ); CSphQueryResultMeta ( const CSphQueryResultMeta & tMeta ); ///< copy ctor CSphQueryResultMeta & operator= ( const CSphQueryResultMeta & tMeta ); ///< copy }; /// search query result (meta-info plus actual matches) class CSphQueryResult : public CSphQueryResultMeta { public: CSphSwapVector m_dMatches; ///< top matching documents, no more than MAX_MATCHES CSphSchema m_tSchema; ///< result schema const DWORD * m_pMva; ///< pointer to MVA storage const BYTE * m_pStrings; ///< pointer to strings storage CSphVector m_dStorage2Free; /// < aggregated external storage from rt indexes int m_iOffset; ///< requested offset into matches array int m_iCount; ///< count which will be actually served (computed from total, offset and limit) int m_iSuccesses; public: CSphQueryResult (); ///< ctor virtual ~CSphQueryResult (); ///< dtor, which releases all owned stuff void LeakStorages ( CSphQueryResult & tDst ); }; ///////////////////////////////////////////////////////////////////////////// // ATTRIBUTE UPDATE QUERY ///////////////////////////////////////////////////////////////////////////// struct CSphAttrUpdate { CSphVector m_dAttrs; ///< update schema (ie. what attrs to update) CSphVector m_dPool; ///< update values pool CSphVector m_dDocids; ///< document IDs vector CSphVector m_dRowOffset; ///< document row offsets in the pool }; ///////////////////////////////////////////////////////////////////////////// // FULLTEXT INDICES ///////////////////////////////////////////////////////////////////////////// /// progress info struct CSphIndexProgress { enum Phase_e { PHASE_COLLECT, ///< document collection phase PHASE_SORT, ///< final sorting phase PHASE_COLLECT_MVA, ///< multi-valued attributes collection phase PHASE_SORT_MVA, ///< multi-valued attributes collection phase PHASE_MERGE, ///< index merging PHASE_PREREAD, ///< searchd startup, prereading data PHASE_PRECOMPUTE ///< searchd startup, indexing attributes }; Phase_e m_ePhase; ///< current indexing phase int m_iDocuments; ///< PHASE_COLLECT: documents collected so far int64_t m_iBytes; ///< PHASE_COLLECT: bytes collected so far; ///< PHASE_PREREAD: bytes read so far; int64_t m_iBytesTotal; ///< PHASE_PREREAD: total bytes to read; int64_t m_iAttrs; ///< PHASE_COLLECT_MVA, PHASE_SORT_MVA: attrs processed so far int64_t m_iAttrsTotal; ///< PHASE_SORT_MVA: attrs total SphOffset_t m_iHits; ///< PHASE_SORT: hits sorted so far SphOffset_t m_iHitsTotal; ///< PHASE_SORT: hits total int m_iWords; ///< PHASE_MERGE: words merged so far int m_iDone; ///< generic percent, 0..1000 range CSphIndexProgress () : m_ePhase ( PHASE_COLLECT ) , m_iDocuments ( 0 ) , m_iBytes ( 0 ) , m_iBytesTotal ( 0 ) , m_iAttrs ( 0 ) , m_iAttrsTotal ( 0 ) , m_iHits ( 0 ) , m_iHitsTotal ( 0 ) , m_iWords ( 0 ) {} /// builds a message to print /// WARNING, STATIC BUFFER, NON-REENTRANT const char * BuildMessage() const; }; /// sorting key part types enum ESphSortKeyPart { SPH_KEYPART_ID, SPH_KEYPART_WEIGHT, SPH_KEYPART_INT, SPH_KEYPART_FLOAT, SPH_KEYPART_STRING }; typedef int ( *SphStringCmp_fn )( const BYTE * pStr1, const BYTE * pStr2 ); /// match comparator state struct CSphMatchComparatorState { static const int MAX_ATTRS = 5; ESphSortKeyPart m_eKeypart[MAX_ATTRS]; ///< sort-by key part type CSphAttrLocator m_tLocator[MAX_ATTRS]; ///< sort-by attr locator DWORD m_uAttrDesc; ///< sort order mask (if i-th bit is set, i-th attr order is DESC) DWORD m_iNow; ///< timestamp (for timesegments sorting mode) SphStringCmp_fn m_fnStrCmp; ///< string comparator /// create default empty state CSphMatchComparatorState () : m_uAttrDesc ( 0 ) , m_iNow ( 0 ) , m_fnStrCmp ( NULL ) { for ( int i=0; i=0 && iAttr & dSources, int iMemoryLimit, int iWriteBuffer ) = 0; /// build index by mering current index with given index virtual bool Merge ( CSphIndex * pSource, CSphVector & dFilters, bool bMergeKillLists ) = 0; public: /// check all data files, preload schema, and preallocate enough shared RAM to load memory-cached data virtual bool Prealloc ( bool bMlock, bool bStripPath, CSphString & sWarning ) = 0; /// deallocate all previously preallocated shared data virtual void Dealloc () = 0; /// precache everything which needs to be precached // WARNING, WILL BE CALLED FROM DIFFERENT PROCESS, MUST ONLY MODIFY SHARED MEMORY virtual bool Preread () = 0; /// set new index base path virtual void SetBase ( const char * sNewBase ) = 0; /// set new index base path, and physically rename index files too virtual bool Rename ( const char * sNewBase ) = 0; /// obtain exclusive lock on this index virtual bool Lock () = 0; /// dismiss exclusive lock and unlink lock file virtual void Unlock () = 0; /// relock shared RAM (only on daemonization) virtual bool Mlock () = 0; /// called when index is loaded and prepared to work virtual void PostSetup() = 0; public: virtual bool EarlyReject ( CSphQueryContext * pCtx, CSphMatch & tMatch ) const = 0; virtual const CSphSourceStats & GetStats () const = 0; void SetCacheSize ( int iMaxCachedDocs, int iMaxCachedHits ); virtual bool MultiQuery ( const CSphQuery * pQuery, CSphQueryResult * pResult, int iSorters, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag=0 ) const = 0; virtual bool MultiQueryEx ( int iQueries, const CSphQuery * ppQueries, CSphQueryResult ** ppResults, ISphMatchSorter ** ppSorters, const CSphVector * pExtraFilters, int iTag=0 ) const = 0; virtual bool GetKeywords ( CSphVector & dKeywords, const char * szQuery, bool bGetStats, CSphString & sError ) const = 0; public: /// updates memory-cached attributes in real time /// returns non-negative amount of actually found and updated records on success /// on failure, -1 is returned and GetLastError() contains error message virtual int UpdateAttributes ( const CSphAttrUpdate & tUpd, int iIndex, CSphString & sError ) = 0; /// saves memory-cached attributes, if there were any updates to them /// on failure, false is returned and GetLastError() contains error message virtual bool SaveAttributes () = 0; virtual DWORD GetAttributeStatus () const = 0; public: /// internal debugging hook, DO NOT USE virtual void DebugDumpHeader ( FILE * fp, const char * sHeaderName, bool bConfig ) = 0; /// internal debugging hook, DO NOT USE virtual void DebugDumpDocids ( FILE * fp ) = 0; /// internal debugging hook, DO NOT USE virtual void DebugDumpHitlist ( FILE * fp, const char * sKeyword, bool bID ) = 0; /// internal debugging hook, DO NOT USE virtual int DebugCheck ( FILE * fp ) = 0; /// getter for name const char * GetName () { return m_sIndexName.cstr(); } public: int64_t m_iTID; bool m_bEnableStar; ///< enable star-syntax bool m_bExpandKeywords; ///< enable automatic query-time keyword expansion (to "( word | =word | *word* )") int m_iExpansionLimit; protected: ProgressCallback_t * m_pProgress; CSphSchema m_tSchema; CSphString m_sLastError; CSphString m_sLastWarning; bool m_bInplaceSettings; int m_iHitGap; int m_iDocinfoGap; float m_fRelocFactor; float m_fWriteFactor; bool m_bKeepFilesOpen; ///< keep files open to avoid race on seamless rotation bool m_bPreloadWordlist; ///< preload wordlists or keep them on disk bool m_bStripperInited; ///< was stripper initialized (old index version (<9) handling) public: bool m_bId32to64; ///< did we convert id32 to id64 on startup protected: CSphIndexSettings m_tSettings; ISphTokenizer * m_pTokenizer; CSphDict * m_pDict; int m_iMaxCachedDocs; int m_iMaxCachedHits; CSphString m_sIndexName; }; ///////////////////////////////////////////////////////////////////////////// /// create phrase fulltext index implemntation CSphIndex * sphCreateIndexPhrase ( const char* szIndexName, const char * sFilename ); /// tell libsphinx to be quiet or not (logs and loglevels to come later) void sphSetQuiet ( bool bQuiet ); /// creates proper queue for given query /// may return NULL on error; in this case, error message is placed in sError ISphMatchSorter * sphCreateQueue ( const CSphQuery * pQuery, const CSphSchema & tSchema, CSphString & sError, bool bComputeItems=true, CSphSchema * pExtra=NULL ); /// convert queue to sorted array, and add its entries to result's matches array void sphFlattenQueue ( ISphMatchSorter * pQueue, CSphQueryResult * pResult, int iTag ); /// setup per-keyword read buffer sizes void sphSetReadBuffers ( int iReadBuffer, int iReadUnhinted ); /// check query for expressions bool sphHasExpressions ( const CSphQuery & tQuery, const CSphSchema & tSchema ); /// initialize collation tables void sphCollationInit (); ///////////////////////////////////////////////////////////////////////////// // workaround to suppress C4511/C4512 warnings (copy ctor and assignment operator) in VS 2003 #if _MSC_VER>=1300 && _MSC_VER<1400 #pragma warning(disable:4511) #pragma warning(disable:4512) #endif // suppress C4201 (nameless struct/union is a nonstandard extension) because even min-spec gcc 3.4.6 works ok #if defined(_MSC_VER) #pragma warning(disable:4201) #endif #endif // _sphinx_ // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxcustomsort.inl100777 0 0 1271 11643565732 15431 0// // $Id$ // // in this file, one can declare a custom sorting function // which will be used when sorting by "@custom" in extended sorting mode // first, declare which attributes will be used in the function // // they will be then accessible in the function using MATCH_ATTR(number) // macro, where "number" is assigned in the order of declaration MATCH_DECLARE_ATTR ( "group_id" ) MATCH_DECLARE_ATTR ( "date_added" ) // second, define the function itself // // in this example, the matches will be sorted by // @weight + group_id*0.3 - log ( NOW() - date_added ) // in descending order MATCH_FUNCTION = MATCH_WEIGHT + MATCH_ATTR(0)*0.3f - log ( MATCH_NOW - MATCH_ATTR(1) ) // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxexcerpt.cpp100777 0 0 254346 11643565732 14736 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxexcerpt.h" #include "sphinxutils.h" #include "sphinxsearch.h" #include "sphinxquery.h" #include "sphinxint.h" #include ///////////////////////////////////////////////////////////////////////////// // THE EXCERPTS GENERATOR ///////////////////////////////////////////////////////////////////////////// static const int MAX_HIGHLIGHT_WORDS = 256; #define UINT32_MASK 0xffffffffUL #define UINT16_MASK 0xffff typedef uint64_t ZonePacked_t; class ExcerptGen_c { friend class SnippetsQwordSetup; public: explicit ExcerptGen_c ( bool bUtf8 ); ~ExcerptGen_c () {} char * BuildExcerpt ( const ExcerptQuery_t & tQuery ); void TokenizeQuery ( const ExcerptQuery_t &, CSphDict * pDict, ISphTokenizer * pTokenizer, const CSphIndexSettings & tSettings ); void TokenizeDocument ( char * pData, int iDataLen, CSphDict * pDict, ISphTokenizer * pTokenizer, bool bFillMasks, const ExcerptQuery_t & q, const CSphIndexSettings & tSettings ); void SetMarker ( CSphHitMarker * pMarker ) { m_pMarker = pMarker; } void SetExactPhrase ( const ExcerptQuery_t & tQuery ); public: enum Token_e { TOK_NONE = 0, ///< unspecified type, also used as the end marker TOK_WORD, ///< just a word TOK_SPACE, ///< whitespace chars seq TOK_BREAK, ///< non-word chars seq which delimit a phrase part or boundary TOK_SPZ ///< SENTENCE, PARAGRAPH, ZONE }; struct Token_t { Token_e m_eType; ///< token type int m_iStart; ///< token start (index in codepoints array) int m_iLengthCP; ///< token length (in codepoints) int m_iLengthBytes; ///< token length (in bytes) int m_iWeight; ///< token weight DWORD m_uWords; ///< matching query words mask SphWordID_t m_iWordID; ///< token word ID from dictionary SphWordID_t m_iBlendID; ///< blended word ID (eg. "T-mobile" would not tokenize itself, but still shadow "T" and "mobile") DWORD m_uPosition; ///< hit position in document void Reset () { m_eType = TOK_NONE; m_iStart = 0; m_iLengthCP = 0; m_iLengthBytes = 0; m_iWeight = 0; m_uWords = 0; m_iWordID = 0; m_iBlendID = 0; m_uPosition = 0; } }; struct TokenSpan_t { int m_iStart; ///< start index, inclusive int m_iEnd; ///< end index, inclusive int m_iWords; ///< number of TOK_WORDS tokens int m_iQwords; ///< number of words matching query void Reset () { m_iStart = -1; m_iEnd = -2; m_iWords = 0; m_iQwords = 0; } void Add ( int i, bool bQword ) { assert ( m_iStart & GetZones () const { return m_dZones; } const SmallStringHash_T & GetZonesName () const { return m_hZones; } protected: CSphVector m_dTokens; ///< source text tokens CSphVector m_dWords; ///< query words tokens int m_iDocumentWords; int m_iPassageId; CSphString m_sBuffer; // FIXME!!! REMOVE!!! ME!!! CSphVector m_dResult; ///< result holder int m_iResultLen; ///< result codepoints count CSphVector m_dPassages; ///< extracted passages bool m_bExactPhrase; DWORD m_uFoundWords; ///< found words mask int m_iQwordCount; int m_iLastWord; CSphHitMarker * m_pMarker; CSphVector m_dKeywordsBuffer; CSphVector m_dKeywords; CSphVector m_dZones; ///< zones for current document SmallStringHash_T m_hZones; ///< zones names CSphVector m_dZonePos; ///< zones positions (in characters) CSphVector m_dZoneParent; ///< zones parent type bool m_bUtf8; int m_iTotalCP; protected: void CalcPassageWeight ( Passage_t & tPass, const TokenSpan_t & tSpan, int iMaxWords, int iWordCountCoeff ); void UpdateGaps ( Passage_t & tPass, const TokenSpan_t & tSpan, int iMaxWords ); bool ExtractPassages ( const ExcerptQuery_t & q ); bool ExtractPhrases ( const ExcerptQuery_t & q ); void HighlightPhrase ( const ExcerptQuery_t & q, int iTok, int iEnd ); void HighlightAll ( const ExcerptQuery_t & q ); void HighlightStart ( const ExcerptQuery_t & q ); bool HighlightBestPassages ( const ExcerptQuery_t & q ); void ResultEmit ( const char * sLine, bool bHasMacro=false, int iPassageId=0, const char * sPostPassage=NULL ); void ResultEmit ( const Token_t & sTok ); void AddJunk ( int iStart, int iLength, int iBoundary ); void AddBoundary (); void MarkHits (); bool SetupWindow ( TokenSpan_t & tSpan, Passage_t & tPass, int iFrom, int iCpLimit, const ExcerptQuery_t & q ); bool FlushPassage ( const Passage_t & tPass, int iLCSThresh ); }; // find string sFind in first iLimit characters of sBuffer static BYTE * FindString ( BYTE * sBuffer, BYTE * sFind, int iLimit ) { assert ( iLimit > 0 ); assert ( sBuffer ); assert ( sFind ); iLimit++; do { while ( *sBuffer!=*sFind ) if ( !*++sBuffer || !--iLimit ) return NULL; int iSubLimit = iLimit; BYTE * sSubFind = sFind; BYTE * sSubBuffer = sBuffer; while ( *sSubFind && *sSubBuffer && *sSubFind==*sSubBuffer++ ) { sSubFind++; if ( !--iSubLimit ) return NULL; } if ( !*sSubFind ) return sBuffer; } while ( *++sBuffer ); return NULL; } /// hitman used here in snippets typedef Hitman_c<8> HITMAN; /// snippets query words for different cases class ISnippetsQword : public ISphQword { public: CSphString * m_sBuffer; CSphVector * m_dTokens; ISphTokenizer * m_pTokenizer; DWORD * m_uFoundWords; // word information, filled during query word setup int m_iWordLength; int m_iLastIndex; DWORD m_uWordMask; // iterator state CSphMatch m_tMatch; int m_iToken; int m_iChunk; typedef ExcerptGen_c::Token_t Token_t; ISnippetsQword() : m_iToken ( 0 ) , m_iChunk ( 0 ) {} virtual void SeekHitlist ( SphOffset_t ) {} virtual const CSphMatch & GetNextDoc ( DWORD * ) { m_dFields.Set(); if ( ( m_iChunk++ )==0 ) { if ( GetNextHit()!=EMPTY_HIT ) { m_tMatch.m_iDocID = 1; m_iToken--; } else m_tMatch.m_iDocID = 0; } else m_tMatch.m_iDocID = 0; return m_tMatch; } virtual void OnSetup ( CSphDict * ) {} }; /// simple keyword match on id struct SnippetsQword_Exact_c: public ISnippetsQword { virtual Hitpos_t GetNextHit () { while ( m_iToken < m_dTokens->GetLength() ) { Token_t & tToken = (*m_dTokens)[m_iToken++]; if ( tToken.m_eType!=ExcerptGen_c::TOK_WORD ) continue; if ( tToken.m_iWordID==m_iWordID || tToken.m_iBlendID==m_iWordID ) { tToken.m_uWords |= m_uWordMask; *m_uFoundWords |= m_uWordMask; return HITMAN::Create ( 0, tToken.m_uPosition, ( m_iToken-1 )==m_iLastIndex ); } } return EMPTY_HIT; } }; /// partial matches template < typename COMPARE > struct SnippetsQword_c: public ISnippetsQword { virtual Hitpos_t GetNextHit () { while ( m_iToken < m_dTokens->GetLength() ) { Token_t & tToken = (*m_dTokens)[m_iToken++]; if ( tToken.m_eType!=ExcerptGen_c::TOK_WORD ) continue; m_pTokenizer->SetBuffer ( (BYTE *) &m_sBuffer->cstr() [ tToken.m_iStart ], tToken.m_iLengthBytes ); BYTE * sToken = m_pTokenizer->GetToken(); // OPTIMIZE? token can be memoized and shared between qwords if ( (*(COMPARE *)this).Match ( tToken, sToken ) ) { tToken.m_uWords |= m_uWordMask; *m_uFoundWords |= m_uWordMask; return HITMAN::Create ( 0, tToken.m_uPosition, ( m_iToken-1 )==m_iLastIndex ); } } return EMPTY_HIT; } }; struct SnippetsQword_StarFront_c : public SnippetsQword_c { inline bool Match ( const Token_t & tToken, BYTE * sToken ) { int iOffset = tToken.m_iLengthBytes - m_iWordLength; return iOffset>=0 && memcmp ( m_sDictWord.cstr(), sToken + iOffset, m_iWordLength )==0; } }; struct SnippetsQword_StarBack_c : public SnippetsQword_c { inline bool Match ( const Token_t & tToken, BYTE * sToken ) { return ( tToken.m_iLengthBytes>=m_iWordLength ) && memcmp ( m_sDictWord.cstr(), sToken, m_iWordLength )==0; } }; struct SnippetsQword_StarBoth_c : public SnippetsQword_c { inline bool Match ( const Token_t & tToken, BYTE * sToken ) { return FindString ( sToken, (BYTE *)m_sDictWord.cstr(), tToken.m_iLengthBytes )!=NULL; } }; struct SnippetsQword_ExactForm_c : public SnippetsQword_c { inline bool Match ( const Token_t & tToken, BYTE * sToken ) { return tToken.m_iBlendID==m_iWordID || ( memcmp ( sToken, m_sDictWord.cstr()+1, m_iWordLength )==0 ); } virtual void OnSetup ( CSphDict * pDict ) { // FIXME!!! to match with blended parts it recalculates wordID for word without head '=' part int iLen = m_sWord.Length()-1; BYTE sTmp [ 3*SPH_MAX_WORD_LEN + 16 ]; assert ( iLen>0 && iLen ( pQword ); if ( !pWord ) assert ( "query word setup failed" && 0 ); pWord->m_iLastIndex = m_pGenerator->m_iLastWord; pWord->m_uWordMask = 1 << (m_pGenerator->m_iQwordCount++); pWord->m_iWordLength = strlen ( pWord->m_sDictWord.cstr() ); pWord->m_dTokens = &(m_pGenerator->m_dTokens); pWord->m_sBuffer = &(m_pGenerator->m_sBuffer); pWord->m_pTokenizer = m_pTokenizer; pWord->m_uFoundWords = &m_pGenerator->m_uFoundWords; pWord->m_iDocs = 1; pWord->m_iHits = 1; pWord->m_bHasHitlist = true; pWord->OnSetup ( m_pDict ); // add dummy word, used for passage weighting const char * sWord = pWord->m_sDictWord.cstr(); const int iLength = m_pTokenizer->IsUtf8() ? sphUTF8Len ( sWord ) : strlen ( sWord ); m_pGenerator->m_dWords.Add().m_iLengthCP = iLength; m_pGenerator->m_dKeywords.Add().m_iLength = iLength; return true; } ///////////////////////////////////////////////////////////////////////////// inline bool operator < ( const ExcerptGen_c::Token_t & a, const ExcerptGen_c::Token_t & b ) { if ( a.m_iLengthCP==b.m_iLengthCP ) return a.m_iStart > b.m_iStart; return a.m_iLengthCP < b.m_iLengthCP; } inline bool operator < ( const ExcerptGen_c::Passage_t & a, const ExcerptGen_c::Passage_t & b ) { if ( a.GetWeight()==b.GetWeight() ) return a.m_iCodes < b.m_iCodes; return a.GetWeight() < b.GetWeight(); } ExcerptGen_c::ExcerptGen_c ( bool bUtf8 ) { m_iQwordCount = 0; m_bExactPhrase = false; m_pMarker = NULL; m_uFoundWords = 0; m_bUtf8 = bUtf8; m_iTotalCP = 0; } void ExcerptGen_c::AddBoundary() { Token_t & tLast = m_dTokens.Add(); tLast.Reset(); tLast.m_eType = TOK_BREAK; } void ExcerptGen_c::AddJunk ( int iStart, int iLength, int iBoundary ) { assert ( iLength>0 ); #ifdef PARANOID assert ( iLength<=m_sBuffer.Length() ); assert ( iStart+iLength<=m_sBuffer.Length() ); #endif int iChunkStart = iStart; int iSaved = 0; for ( int i = iStart; i < iStart+iLength; i++ ) if ( sphIsSpace ( m_sBuffer.cstr () [i] )!=sphIsSpace ( m_sBuffer.cstr () [iChunkStart] ) ) { Token_t & tLast = m_dTokens.Add(); tLast.Reset(); tLast.m_eType = TOK_SPACE; tLast.m_iStart = iChunkStart; tLast.m_iLengthBytes = tLast.m_iLengthCP = i - iChunkStart; if ( m_bUtf8 ) tLast.m_iLengthCP = sphUTF8Len ( m_sBuffer.cstr() + tLast.m_iStart, tLast.m_iLengthBytes ); m_iTotalCP += tLast.m_iLengthCP; iChunkStart = i; iSaved += tLast.m_iLengthBytes; if ( iBoundary!=-1 && iSaved > ( iBoundary-iStart ) ) { AddBoundary(); iBoundary = -1; } } Token_t & tLast = m_dTokens.Add(); tLast.Reset(); tLast.m_eType = TOK_SPACE; tLast.m_iStart = iChunkStart; tLast.m_iLengthBytes = tLast.m_iLengthCP = iStart + iLength - iChunkStart; if ( m_bUtf8 ) tLast.m_iLengthCP = sphUTF8Len ( m_sBuffer.cstr() + tLast.m_iStart, tLast.m_iLengthBytes ); m_iTotalCP += tLast.m_iLengthCP; if ( iBoundary!=-1 ) AddBoundary(); } void ExcerptGen_c::TokenizeQuery ( const ExcerptQuery_t & tQuery, CSphDict * pDict, ISphTokenizer * pTokenizer, const CSphIndexSettings & tSettings ) { // tokenize query words int iWordsLength = strlen ( tQuery.m_sWords.cstr() ); m_dKeywords.Reserve ( MAX_HIGHLIGHT_WORDS ); BYTE * sWord; int iKwIndex = 0; int uPosition = 0; pTokenizer->SetBuffer ( (BYTE *)tQuery.m_sWords.cstr(), iWordsLength ); while ( ( sWord = pTokenizer->GetToken() )!=NULL ) { SphWordID_t iWord = pDict->GetWordID ( sWord ); bool bIsStopWord = false; if ( !iWord ) bIsStopWord = pDict->IsStopWord ( sWord ); if ( !pTokenizer->TokenIsBlended() ) { uPosition += pTokenizer->GetOvershortCount(); if ( pTokenizer->GetBoundary() ) uPosition += tSettings.m_iBoundaryStep; if ( iWord || bIsStopWord ) uPosition = bIsStopWord ? uPosition+tSettings.m_iStopwordStep : uPosition+1; } if ( iWord ) { Token_t & tLast = m_dWords.Add(); tLast.m_eType = TOK_WORD; tLast.m_iWordID = iWord; tLast.m_iLengthBytes = tLast.m_iLengthCP = strlen ( (const char *)sWord ); if ( m_bUtf8 ) tLast.m_iLengthCP = sphUTF8Len ( (const char *)sWord ); m_iTotalCP += tLast.m_iLengthCP; tLast.m_uPosition = uPosition; // store keyword Keyword_t & kwLast = m_dKeywords.Add(); kwLast.m_iLength = tLast.m_iLengthCP; // find stars bool bStarBack = ( *pTokenizer->GetTokenEnd()=='*' ); bool bStarFront = ( pTokenizer->GetTokenStart()!=pTokenizer->GetBufferPtr() ) && ( pTokenizer->GetTokenStart()[-1]=='*' ); kwLast.m_uStar = ( bStarFront ? STAR_FRONT : 0 ) | ( bStarBack ? STAR_BACK : 0 ); // store token const int iEndIndex = iKwIndex + tLast.m_iLengthBytes + 1; m_dKeywordsBuffer.Resize ( iEndIndex ); kwLast.m_iWord = iKwIndex; strcpy ( &m_dKeywordsBuffer [ iKwIndex ], (const char *)sWord ); // NOLINT iKwIndex = iEndIndex; if ( m_dWords.GetLength()==MAX_HIGHLIGHT_WORDS ) break; } } } static int FindTagEnd ( const char * sData ) { assert ( *sData=='<' ); const char * s = sData+1; // we just scan until EOLN or tag end while ( *s && *s!='>' ) { // exit on duplicate if ( *s=='<' ) return -1; if ( *s=='\'' || *s=='"' ) s = (const char *)SkipQuoted ( (const BYTE *)s ); else s++; } if ( !*s ) return -1; return s-sData; } uint64_t sphPackZone ( DWORD uPosition, int iSiblingIndex, int iZoneType ) { assert ( iSiblingIndex>=0 && iSiblingIndex=0 && iZoneType & hZones ) { CSphString sZone; sZone.SetBinary ( sZoneName, iZoneNameLen ); int * pZoneIndex = hZones ( sZone ); if ( pZoneIndex ) return *pZoneIndex; int iZone = hZones.GetLength(); hZones.Add ( iZone, sZone ); return iZone; } // FIXME! unify with global static void TokenizeDocument somehow, lots of common code void ExcerptGen_c::TokenizeDocument ( char * pData, int iDataLen, CSphDict * pDict, ISphTokenizer * pTokenizer, bool bFillMasks, const ExcerptQuery_t & q, const CSphIndexSettings & tSettings ) { assert ( q.m_sStripMode!="retain" ); bool bQueryMode = q.m_bHighlightQuery; int iSPZ = q.m_iPassageBoundary; m_iTotalCP = 0; m_iDocumentWords = 0; m_dTokens.Reserve ( Max ( iDataLen/4, 256 ) ); // len/tok ratio ranged 2.8 to 3.2 on my testing data m_sBuffer = pData; pTokenizer->SetBuffer ( (BYTE*)pData, iDataLen ); const char * pStartPtr = pTokenizer->GetBufferPtr (); const char * pLastTokenEnd = pStartPtr; assert ( pStartPtr && pLastTokenEnd ); CSphVector dZoneStack; CSphVector dExactPhrase; if ( m_bExactPhrase ) dExactPhrase.Reserve ( m_dWords.GetLength() ); BYTE * sWord; DWORD uPosition = 0; // hit position in document SphWordID_t iBlendID = 0; const char * pBlendedEnd = NULL; while ( ( sWord = pTokenizer->GetToken() )!=NULL ) { if ( pTokenizer->TokenIsBlended() ) { if ( pBlendedEndGetTokenEnd() ) { iBlendID = pDict->GetWordID ( sWord ); pBlendedEnd = pTokenizer->GetTokenEnd(); } continue; } uPosition += pTokenizer->GetOvershortCount(); const char * pTokenStart = pTokenizer->GetTokenStart (); if ( pTokenStart!=pStartPtr && pTokenStart>pLastTokenEnd ) { AddJunk ( pLastTokenEnd - pStartPtr, pTokenStart - pLastTokenEnd, pTokenizer->GetBoundary() ? pTokenizer->GetBoundaryOffset() : -1 ); pLastTokenEnd = pTokenStart; } // handle SPZ tokens GE then needed // add SENTENCE, PARAGRAPH, ZONE token, do junks and tokenizer and pLastTokenEnd fix up // FIXME!!! it heavily depends on such this attitude MAGIC_CODE_SENTENCE < MAGIC_CODE_PARAGRAPH < MAGIC_CODE_ZONE if ( *sWord==MAGIC_CODE_SENTENCE || *sWord==MAGIC_CODE_PARAGRAPH || *sWord==MAGIC_CODE_ZONE ) { // SPZ token has position and could be last token too uPosition += ( iSPZ && *sWord>=iSPZ ); if ( iSPZ && *sWord>=iSPZ && ( m_dTokens.GetLength()==0 || m_dTokens.Last().m_eType!=TOK_SPZ ) ) { Token_t & tLast = m_dTokens.Add(); tLast.Reset(); tLast.m_eType = TOK_SPZ; if ( *sWord==MAGIC_CODE_SENTENCE ) { tLast.m_iStart = pTokenStart-pStartPtr; tLast.m_iLengthBytes = tLast.m_iLengthCP = 1; m_iTotalCP++; } // SPZ token has position and could be last token too m_iLastWord = m_dTokens.GetLength(); pLastTokenEnd = pTokenizer->GetTokenEnd(); // fix it up to prevent adding last chunk on exit } if ( *sWord==MAGIC_CODE_ZONE ) { const char * pEnd = pTokenizer->GetBufferPtr(); const char * pTagStart = pEnd; while ( *pEnd && *pEnd!=MAGIC_CODE_ZONE ) pEnd++; pEnd++; // skip zone token too pTokenizer->SetBufferPtr ( pEnd ); pLastTokenEnd = pEnd; // fix it up to prevent adding last chunk on exit // span's management if ( *pTagStart!='/' ) // open zone { // zone stack management int iSelf = m_dZones.GetLength(); dZoneStack.Add ( iSelf ); // add zone itself int iZone = FindAddZone ( pTagStart, pEnd-pTagStart-1, m_hZones ); m_dZones.Add ( sphPackZone ( uPosition, iSelf, iZone ) ); // zone position in characters m_dZonePos.Add ( pTagStart-pStartPtr ); // for open zone the parent is the zone itself m_dZoneParent.Add ( iZone ); } else // close zone { #ifndef NDEBUG // lets check open - close tags match assert ( dZoneStack.GetLength() && dZoneStack.Last()>32 ) & UINT32_MASK ); assert ( iZone==(int)( uOpenPacked & UINT16_MASK ) ); // check for zone's types match; m_dZones[iOpen] = sphPackZone ( uOpenPos, iClose, iZone ); m_dZones.Add ( sphPackZone ( uPosition, iOpen, iZone ) ); // zone position in characters m_dZonePos.Add ( pTagStart-pStartPtr ); // for close zone the parent is the previous zone on stack int iParentZone = dZoneStack.GetLength()>2 ? dZoneStack[dZoneStack.GetLength()-2] : 0; uint64_t uParentPacked = m_dZones.GetLength() && iParentZoneGetTokenEnd (); SphWordID_t iExactID = 0; if ( bQueryMode && tSettings.m_bIndexExactWords ) { BYTE sBuf [ 3*SPH_MAX_WORD_LEN+4 ]; int iBytes = pLastTokenEnd - pTokenStart; if ( iBytes+2>sizeof(sBuf) ) iBytes = sizeof(sBuf)-2; memcpy ( sBuf + 1, sWord, iBytes ); sBuf[0] = MAGIC_WORD_HEAD_NONSTEMMED; sBuf[iBytes+1] = '\0'; iExactID = pDict->GetWordIDNonStemmed ( sBuf ); } SphWordID_t iWord = pDict->GetWordID ( sWord ); if ( pTokenizer->GetBoundary() ) uPosition += tSettings.m_iBoundaryStep; bool bIsStopWord = false; if ( !iWord ) bIsStopWord = pDict->IsStopWord ( sWord ); if ( iWord || bIsStopWord ) uPosition = bIsStopWord ? uPosition+tSettings.m_iStopwordStep : uPosition+1; if ( !pTokenizer->TokenIsBlendedPart() ) iBlendID = 0; Token_t & tLast = m_dTokens.Add(); tLast.m_eType = ( iWord || bIsStopWord ) ? TOK_WORD : TOK_SPACE; tLast.m_uPosition = ( iWord || bIsStopWord ) ? uPosition : 0; tLast.m_iStart = pTokenStart - pStartPtr; tLast.m_iLengthBytes = tLast.m_iLengthCP = pLastTokenEnd - pTokenStart; if ( m_bUtf8 && ( iWord || bIsStopWord ) ) tLast.m_iLengthCP = sphUTF8Len ( pTokenStart, tLast.m_iLengthBytes ); m_iTotalCP += tLast.m_iLengthCP; tLast.m_iWordID = iWord; tLast.m_iBlendID = iBlendID; tLast.m_uWords = 0; if ( iWord || bIsStopWord ) m_iDocumentWords++; m_iLastWord = iWord ? m_dTokens.GetLength() - 1 : m_iLastWord; // fill word mask tLast.m_uWords = 0; if ( bFillMasks && iWord ) { bool bMatch = false; int iOffset; ARRAY_FOREACH ( nWord, m_dWords ) { const char * sKeyword = &m_dKeywordsBuffer [ m_dKeywords[nWord].m_iWord ]; const Token_t & tToken = m_dWords[nWord]; switch ( m_dKeywords[nWord].m_uStar ) { case STAR_NONE: bMatch = ( iWord==tToken.m_iWordID || iExactID==tToken.m_iWordID ); break; case STAR_FRONT: iOffset = tLast.m_iLengthBytes - tToken.m_iLengthBytes; bMatch = ( iOffset>=0 ) && ( memcmp ( sKeyword, sWord + iOffset, tToken.m_iLengthBytes )==0 ); break; case STAR_BACK: bMatch = ( tLast.m_iLengthBytes>=tToken.m_iLengthBytes ) && ( memcmp ( sKeyword, sWord, tToken.m_iLengthBytes )==0 ); break; case STAR_BOTH: bMatch = strstr ( (const char *)sWord, sKeyword )!=NULL; break; } if ( bMatch ) { tLast.m_uWords |= 1UL<GetBufferEnd() ) { int iOffset = pTokenizer->GetBoundary() ? pTokenizer->GetBoundaryOffset() : -1; AddJunk ( pLastTokenEnd - pStartPtr, pTokenizer->GetBufferEnd () - pLastTokenEnd, iOffset ); } Token_t & tLast = m_dTokens.Add(); tLast.Reset(); } void ExcerptGen_c::MarkHits () { assert ( m_pMarker ); // mark CSphVector dMarked; dMarked.Reserve ( m_dTokens.GetLength() ); m_pMarker->Mark ( dMarked ); // fix-up word masks int iMarked = dMarked.GetLength(); int iTokens = m_dTokens.GetLength(); int i = 0, k = 0; while ( i < iTokens ) { // sync while ( k < iMarked && m_dTokens[i].m_uPosition > dMarked[k].m_uPosition ) k++; if ( k==iMarked ) // no more marked hits, clear tail { for ( ; i < iTokens; i++ ) m_dTokens[i].m_uWords = 0; break; } // clear false matches while ( dMarked[k].m_uPosition > m_dTokens[i].m_uPosition ) { m_dTokens[i++].m_uWords = 0; assert ( i=1 ); while ( dMarked[k].m_uSpan-- ) { i++; while ( i < iTokens && !m_dTokens[i].m_uPosition ) i++; } } } void ExcerptGen_c::SetExactPhrase ( const ExcerptQuery_t & tQuery ) { m_bExactPhrase = tQuery.m_bExactPhrase && ( m_dWords.GetLength()>1 ); } char * ExcerptGen_c::BuildExcerpt ( const ExcerptQuery_t & tQuery ) { m_iPassageId = tQuery.m_iPassageId; if ( tQuery.m_bHighlightQuery ) MarkHits(); // assign word weights ARRAY_FOREACH ( i, m_dWords ) m_dWords[i].m_iWeight = m_dWords[i].m_iLengthCP; // FIXME! should obtain freqs from dict // reset result m_dResult.Reserve ( 16384 ); m_dResult.Resize ( 0 ); m_iResultLen = 0; // do highlighting if ( ( tQuery.m_iLimit<=0 || tQuery.m_iLimit>m_iTotalCP ) && ( tQuery.m_iLimitWords<=0 || tQuery.m_iLimitWords>m_iDocumentWords ) ) { HighlightAll ( tQuery ); } else { if ( !( ExtractPassages ( tQuery ) && HighlightBestPassages ( tQuery ) ) ) { if ( tQuery.m_bAllowEmpty ) HighlightStart ( tQuery ); } } // alloc, fill and return the result m_dResult.Add ( 0 ); char * pRes = new char [ m_dResult.GetLength() ]; memcpy ( pRes, &m_dResult[0], m_dResult.GetLength() ); m_dResult.Reset (); return pRes; } void ExcerptGen_c::HighlightPhrase ( const ExcerptQuery_t & q, int iTok, int iEnd ) { int iPhrase = 0; for ( ; iTok<=iEnd; iTok++ ) { bool bQWord = m_dTokens[iTok].m_uWords!=0; if ( bQWord && iPhrase==0 ) ResultEmit ( q.m_sBeforeMatch.cstr(), q.m_bHasBeforePassageMacro, m_iPassageId, q.m_sBeforeMatchPassage.cstr() ); ResultEmit ( m_dTokens[iTok] ); iPhrase += bQWord ? 1 : 0; if ( bQWord && iPhrase==m_dWords.GetLength() ) { ResultEmit ( q.m_sAfterMatch.cstr(), q.m_bHasAfterPassageMacro, m_iPassageId++, q.m_sAfterMatchPassage.cstr() ); iPhrase = 0; } } } void ExcerptGen_c::HighlightAll ( const ExcerptQuery_t & q ) { bool bOpen = false; const int iMaxTok = m_dTokens.GetLength()-1; // skip last one, it's TOK_NONE if ( m_bExactPhrase ) { HighlightPhrase ( q, 0, iMaxTok ); } else { // bag of words for ( int iTok=0; iTok=m_dTokens.GetLength() ) break; } ResultEmit ( q.m_sChunkSeparator.cstr() ); } void ExcerptGen_c::ResultEmit ( const char * sLine, bool bHasMacro, int iPassageId, const char * sPostPassage ) { // plain old emit while ( sLine && *sLine ) { assert ( (*(BYTE*)sLine)<128 ); m_dResult.Add ( *sLine++ ); m_iResultLen++; } if ( !bHasMacro ) return; char sBuf[16]; int iPassLen = snprintf ( sBuf, sizeof(sBuf), "%d", iPassageId ); for ( int i=0; i=0 ); assert ( tSpan.m_iWords==iWord+1 ); // calc final weight tPass.m_iQwordsWeight = 0; tPass.m_iQwordCount = 0; DWORD uWords = tPass.m_uQwords; for ( int iWord=0; uWords; uWords >>= 1, iWord++ ) if ( uWords & 1 ) { tPass.m_iQwordsWeight += m_dWords[iWord].m_iWeight; tPass.m_iQwordCount++; } tPass.m_iMaxLCS *= iMaxWords; tPass.m_iQwordCount *= iWordCountCoeff; } void ExcerptGen_c::UpdateGaps ( Passage_t & tPass, const TokenSpan_t & tSpan, int iMaxWords ) { tPass.m_iMinGap = iMaxWords-1; tPass.m_iAroundBefore = tPass.m_iAroundAfter = 0; DWORD uQwords = 0; int iWord = -1; for ( int iTok=tSpan.m_iStart; iTok<=tSpan.m_iEnd; iTok++ ) { Token_t & tTok = m_dTokens[iTok]; if ( tTok.m_eType!=TOK_WORD ) continue; iWord++; if ( tTok.m_uWords ) { tPass.m_iMinGap = Min ( tPass.m_iMinGap, iWord ); tPass.m_iMinGap = Min ( tPass.m_iMinGap, tSpan.m_iWords-1-iWord ); } uQwords |= tTok.m_uWords; tPass.m_iAroundBefore += ( uQwords==0 ); tPass.m_iAroundAfter = ( tTok.m_uWords ? 0 : tPass.m_iAroundAfter+1 ); } assert ( tPass.m_iMinGap>=0 ); } static int GetWordsLimit ( const ExcerptQuery_t & q, int iQwords ) { int iSoftLimit = 2*q.m_iAround + iQwords; if ( q.m_iLimitWords ) return Min ( iSoftLimit, q.m_iLimitWords ); return iSoftLimit; } bool ExcerptGen_c::SetupWindow ( TokenSpan_t & tSpan, Passage_t & tPass, int i, int iCpLimit, const ExcerptQuery_t & q ) { assert ( i>=0 && i iCpLimit ) || tSpan.m_iWords>=GetWordsLimit ( q, tSpan.m_iQwords ) || tToken.m_eType==TOK_SPZ ) { tPass.m_iTokens += ( tToken.m_eType==TOK_SPZ && tToken.m_iLengthBytes>0 ); // only MAGIC_CODE_SENTENCE has length return ( tToken.m_eType==TOK_SPZ ); } // got token, update passage tPass.m_iTokens++; tPass.m_iCodes += tToken.m_iLengthCP; if ( tToken.m_eType==TOK_WORD ) tSpan.Add ( i, m_dTokens[i].m_uWords!=0 ); } return false; } bool ExcerptGen_c::FlushPassage ( const Passage_t & tPass, int iLCSThresh ) { if (!( tPass.m_uQwords && tPass.m_iMaxLCS>=iLCSThresh )) return false; // if it's the very first one, do add if ( !m_dPassages.GetLength() ) { m_dPassages.Add ( tPass ); return true; } // check if it's new or better Passage_t & tLast = m_dPassages.Last(); if ( ( tPass.m_iStartLimit<=tLast.m_iStartLimit && tLast.m_iEndLimit<=tPass.m_iEndLimit ) || ( tLast.m_iStartLimit<=tPass.m_iStartLimit && tPass.m_iEndLimit<=tLast.m_iEndLimit ) ) { int iPassPre = tPass.m_iStartLimit - tPass.m_iStart + 1; int iPassPost = tPass.m_iStart + tPass.m_iTokens - tPass.m_iEndLimit + 1; float fPassGap = (float)Max ( iPassPre, iPassPost ) / (float)Min ( iPassPre, iPassPost ); int iLastPre = tLast.m_iStartLimit - tLast.m_iStart + 1; int iLastPost = tLast.m_iStart + tLast.m_iTokens - tLast.m_iEndLimit + 1; float fLastGap = (float)Max ( iLastPre, iLastPost ) / (float)Min ( iLastPre, iLastPost ); // centered snippet wins last passage if ( tLast.GetWeight() iCpLimit || tSpan.m_iWords > GetWordsLimit ( q, tSpan.m_iQwords ) ) && tPass.m_iTokens!=1 ) { if ( m_dTokens[tPass.m_iStart].m_eType==TOK_WORD ) { // remove heading word from wordspan assert ( m_dTokens[tSpan.m_iStart].m_eType==TOK_WORD ); if ( m_dTokens[tSpan.m_iStart].m_uWords ) { tSpan.m_iQwords--; bQwordsChanged = true; } tSpan.m_iStart++; if ( tSpan.m_iStart > tSpan.m_iEnd ) { tSpan.Reset(); } else { tSpan.m_iWords--; while ( m_dTokens[tSpan.m_iStart].m_eType!=TOK_WORD ) tSpan.m_iStart++; } } tPass.m_iCodes -= m_dTokens[tPass.m_iStart].m_iLengthCP; tPass.m_iTokens--; tPass.m_iStart++; } } return m_dPassages.GetLength()!=0; } bool ExcerptGen_c::ExtractPhrases ( const ExcerptQuery_t & ) { int iMaxWords = 100; int iLCSThresh = m_bExactPhrase ? m_dWords.GetLength()*iMaxWords : 0; int iStart = 0; DWORD uWords = 0; ARRAY_FOREACH ( iTok, m_dTokens ) { // phrase boundary found, go flush if ( m_dTokens[iTok].m_eType==TOK_BREAK || m_dTokens[iTok].m_eType==TOK_NONE ) { int iEnd = iTok - 1; // emit non-empty phrases with matching words as passages if ( iStart=iLCSThresh ) { tPass.m_iWords = tSpan.m_iWords; m_dPassages.Add ( tPass ); } } if ( m_dTokens[iTok].m_eType==TOK_NONE ) break; iStart = iTok + 1; uWords = 0; } // just an incoming token if ( m_dTokens[iTok].m_eType==TOK_WORD ) uWords |= m_dTokens[iTok].m_uWords; } return m_dPassages.GetLength()!=0; } struct PassageOrder_fn { inline bool IsLess ( const ExcerptGen_c::Passage_t & a, const ExcerptGen_c::Passage_t & b ) const { return a.m_iStart < b.m_iStart; } }; bool ExcerptGen_c::HighlightBestPassages ( const ExcerptQuery_t & tQuery ) { assert ( m_dPassages.GetLength() ); // needed for "slightly outta limit" check below int iKeywordsLength = 0; ARRAY_FOREACH ( i, m_dKeywords ) iKeywordsLength += m_dKeywords[i].m_iLength; // our limits int iMaxPassages = tQuery.m_iLimitPassages ? Min ( m_dPassages.GetLength(), tQuery.m_iLimitPassages ) : m_dPassages.GetLength(); int iMaxWords = tQuery.m_iLimitWords ? tQuery.m_iLimitWords : INT_MAX; int iMaxCp = tQuery.m_iLimit ? tQuery.m_iLimit : INT_MAX; // our best passages CSphVector dShow; DWORD uWords = 0; // mask of words in dShow so far int iTotalCodes = 0; int iTotalWords = 0; bool bAroundComply = true; CSphVector dWeights ( m_dPassages.GetLength() ); ARRAY_FOREACH ( i, m_dPassages ) dWeights[i] = m_dPassages[i].m_iQwordsWeight; // collect enough best passages to show all keywords and max out the limits // don't care much if we're going over limits in this loop, it will be tightened below bool bAll = false; while ( dShow.GetLength() < iMaxPassages ) { // get next best passage int iBest = -1; ARRAY_FOREACH ( i, m_dPassages ) { if ( m_dPassages[i].m_iCodes && ( iBest==-1 || m_dPassages[iBest] < m_dPassages[i] ) ) iBest = i; } if ( iBest<0 ) break; Passage_t & tBest = m_dPassages[iBest]; // does this passage fit the limits? bool bFits = ( iTotalCodes + tBest.m_iCodes<=iMaxCp ) && ( iTotalWords + tBest.m_iWords<=iMaxWords ); bAroundComply &= ( Max ( tBest.m_iAroundBefore, tBest.m_iAroundAfter )<=tQuery.m_iAround ); // all words will be shown and we're outta limit if ( uWords==m_uFoundWords && !bFits ) { // there might be just enough space to partially display this passage if ( ( iTotalCodes + iKeywordsLength )<=tQuery.m_iLimit ) dShow.Add ( tBest ); break; } // save it, despite limits or whatever, we'll tighten everything in the loop below dShow.Add ( tBest ); uWords |= tBest.m_uQwords; iTotalWords += tBest.m_iWords; iTotalCodes += tBest.m_iCodes; tBest.m_iCodes = 0; // no longer needed here, abusing to mark displayed passages // we just managed to show all words? do one final re-weighting run if ( !bAll && uWords==m_uFoundWords ) { bAll = true; ARRAY_FOREACH ( i, m_dPassages ) m_dPassages[i].m_iQwordsWeight = dWeights[i]; } // if we're already showing all words, re-weighting is not needed any more if ( bAll ) continue; // re-weight passages, adjust for new mask of shown words ARRAY_FOREACH ( i, m_dPassages ) { if ( !m_dPassages[i].m_iCodes ) continue; DWORD uMask = tBest.m_uQwords; for ( int iWord=0; uMask; iWord++, uMask >>= 1 ) if ( ( uMask & 1 ) && ( m_dPassages[i].m_uQwords & ( 1UL< iMaxCp || iTotalWords > iMaxWords ) && !tQuery.m_bUseBoundaries ) { // trim passages bool bFirst = true; bool bDone = false; int iCodes = iTotalCodes; while ( !bDone ) { // drop one token from each passage starting from the least relevant for ( int i=dShow.GetLength(); i > 0; i-- ) { Passage_t & tPassage = dShow[i-1]; int iFirst = tPassage.m_iStart; int iLast = tPassage.m_iStart + tPassage.m_iTokens - 1; if ( iFirst!=tPassage.m_iStartLimit && ( bFirst || iLast==tPassage.m_iEndLimit ) ) { // drop first if ( ( tQuery.m_bForceAllWords && m_dTokens[tPassage.m_iStart].m_uWords==0 ) || !tQuery.m_bForceAllWords ) tPassage.m_iStart++; tPassage.m_iTokens--; tPassage.m_iCodes -= m_dTokens[iFirst].m_iLengthCP; iTotalCodes -= m_dTokens[iFirst].m_iLengthCP; iTotalWords -= ( m_dTokens[iFirst].m_eType==TOK_WORD ); } else if ( iLast!=tPassage.m_iEndLimit ) { // drop last if ( ( tQuery.m_bForceAllWords && m_dTokens[tPassage.m_iStart+tPassage.m_iTokens-1].m_uWords==0 ) || !tQuery.m_bForceAllWords ) tPassage.m_iTokens--; tPassage.m_iCodes -= m_dTokens[iLast].m_iLengthCP; iTotalCodes -= m_dTokens[iLast].m_iLengthCP; iTotalWords -= ( m_dTokens[iLast].m_eType==TOK_WORD ); } if ( iTotalCodes<=iMaxCp && iTotalWords<=iMaxWords ) { bDone = true; break; } } if ( iTotalCodes==iCodes ) break; // couldn't reduce anything iCodes = iTotalCodes; bFirst = !bFirst; } } // if passages still don't fit start dropping least significant ones, limit is sacred. while ( ( iTotalCodes > iMaxCp || iTotalWords > iMaxWords ) && !tQuery.m_bForceAllWords ) { iTotalCodes -= dShow.Last().m_iCodes; iTotalWords -= dShow.Last().m_iWords; dShow.RemoveFast ( dShow.GetLength()-1 ); } if ( !dShow.GetLength() ) return false; // sort passages in the document order if ( !tQuery.m_bWeightOrder ) dShow.Sort ( PassageOrder_fn() ); /// show int iLast = -1; bool bEmitZones = tQuery.m_bEmitZones && m_dZones.GetLength(); ARRAY_FOREACH ( i, dShow ) { int iTok = dShow[i].m_iStart; int iEnd = iTok + dShow[i].m_iTokens - 1; if ( ( iLast>=0 && iLast1+iLast || tQuery.m_bWeightOrder ) { ResultEmit ( tQuery.m_sChunkSeparator.cstr() ); // find and emit most enclosing zone if ( bEmitZones ) { int iHighlightStart = m_dTokens[iTok].m_iStart; int iZone = FindSpan ( m_dZonePos, iHighlightStart ); if ( iZone!=-1 ) { int iParent = m_dZoneParent[iZone]; m_hZones.IterateStart(); while ( m_hZones.IterateNext() ) { if ( m_hZones.IterateGet()!=iParent ) continue; ResultEmit ( "<" ); ResultEmit ( m_hZones.IterateGetKey().cstr() ); ResultEmit ( ">" ); break; } } } } if ( m_bExactPhrase ) HighlightPhrase ( tQuery, iTok, iEnd ); else { while ( iTok<=iEnd ) { if ( iTok>iLast || tQuery.m_bWeightOrder ) { if ( m_dTokens[iTok].m_uWords ) { ResultEmit ( tQuery.m_sBeforeMatch.cstr(), tQuery.m_bHasBeforePassageMacro, m_iPassageId, tQuery.m_sBeforeMatchPassage.cstr() ); ResultEmit ( m_dTokens[iTok] ); ResultEmit ( tQuery.m_sAfterMatch.cstr(), tQuery.m_bHasAfterPassageMacro, m_iPassageId++, tQuery.m_sAfterMatchPassage.cstr() ); } else ResultEmit ( m_dTokens[iTok] ); } iTok++; } } iLast = tQuery.m_bWeightOrder ? iEnd : Max ( iLast, iEnd ); } if ( m_dTokens[iLast].m_eType!=TOK_NONE && m_dTokens[iLast+1].m_eType!=TOK_NONE ) ResultEmit ( tQuery.m_sChunkSeparator.cstr() ); return true; } ////////////////////////////////////////////////////////////////////////// // FAST PATH FOR FULL DOCUMENT HIGHLIGHTING ////////////////////////////////////////////////////////////////////////// struct DocQueryZonePair_t { int m_iDoc; int m_iQuery; bool operator<( const DocQueryZonePair_t & b ) const { return m_iDoc( const DocQueryZonePair_t & b ) const { return m_iDoc>b.m_iDoc; } bool operator==( const DocQueryZonePair_t & b ) const { return m_iDoc==b.m_iDoc; } }; /// hit-in-zone check implementation for the matching engine class SnippetZoneChecker_c : public ISphZoneCheck { private: struct ZoneHits_t { CSphVector m_dOpen; CSphVector m_dClose; }; CSphVector m_dZones; public: SnippetZoneChecker_c ( const CSphVector & dDocZones, const SmallStringHash_T & hDocNames, const CSphVector & dQueryZones ) { if ( !dQueryZones.GetLength() ) return; CSphVector dCheckedZones; ARRAY_FOREACH ( i, dQueryZones ) { int * pZone = hDocNames ( dQueryZones[i] ); if ( pZone ) { DocQueryZonePair_t & tPair = dCheckedZones.Add (); tPair.m_iDoc = *pZone; tPair.m_iQuery = i; } } dCheckedZones.Sort(); m_dZones.Resize ( dQueryZones.GetLength() ); ARRAY_FOREACH ( i, dDocZones ) { uint64_t uZonePacked = dDocZones[i]; DWORD uPos = (DWORD)( ( uZonePacked >>32 ) & UINT32_MASK ); int iSibling = (int)( ( uZonePacked>>16 ) & UINT16_MASK ); int iZone = (int)( uZonePacked & UINT16_MASK ); assert ( iSibling>=0 && iSibling close zone position // + zone type not in query zones if ( iSibling<=i || uPos>=( ( dDocZones[iSibling]>>32 ) & UINT32_MASK ) ) continue; DocQueryZonePair_t tRefZone; tRefZone.m_iDoc = iZone; const DocQueryZonePair_t * pPair = dCheckedZones.BinarySearch ( tRefZone ); if ( !pPair ) continue; uint64_t uClosePacked = dDocZones[iSibling]; DWORD uClosePos = ( (int)( uClosePacked>>32 ) & UINT32_MASK ); ZoneHits_t & tZone = m_dZones[pPair->m_iQuery]; tZone.m_dOpen.Add ( uPos ); tZone.m_dClose.Add ( uClosePos ); } #ifndef NDEBUG ARRAY_FOREACH ( i, m_dZones ) { const ZoneHits_t & tZone = m_dZones[i]; assert ( tZone.m_dOpen.GetLength()==tZone.m_dClose.GetLength() ); const Hitpos_t * pHit = tZone.m_dOpen.Begin()+1; const Hitpos_t * pMax = tZone.m_dOpen.Begin()+tZone.m_dOpen.GetLength(); for ( ; pHitm_uHitpos ); int iOpen = FindSpan ( m_dZones[iZone].m_dOpen, uPos ); return ( iOpen>=0 && uPos<=m_dZones[iZone].m_dClose[iOpen] ) ? SPH_ZONE_FOUND : SPH_ZONE_NO_SPAN; } }; ////////////////////////////////////////////////////////////////////////// /// mini-index for a single document /// keeps query words /// keeps hit lists for every query keyword class SnippetsDocIndex_c : public ISphNoncopyable { public: // document related DWORD m_uLastPos; CSphVector< CSphVector > m_dDocHits; // query parsing result XQQuery_t m_tQuery; protected: // query keywords and parsing stuff CSphVector m_dQueryWords; CSphVector m_dStarWords; CSphVector m_dStarBuffer; bool m_bQueryMode; bool m_bSentence; bool m_bParagraph; BYTE m_sTmpWord [ 3*SPH_MAX_WORD_LEN + 16 ]; public: explicit SnippetsDocIndex_c ( bool bQueryMode ); void SetupHits (); int FindWord ( SphWordID_t iWordID, const BYTE * sWord, int iWordLen ) const; void AddHits ( SphWordID_t iWordID, const BYTE * sWord, int iWordLen, DWORD uPosition ); bool Parse ( const char * sQuery, ISphTokenizer * pTokenizer, CSphDict * pDict, const CSphSchema * pSchema, CSphString & sError, int iStopwordStep ); protected: bool MatchStar ( const ExcerptGen_c::Keyword_t & tTok, const BYTE * sWord, int iWordLen ) const; void AddWord ( SphWordID_t iWordID ); void AddWord ( const char * sWord, int iStarPosition ); void ExtractWords ( XQNode_t * pNode, CSphDict * pDict ); }; SnippetsDocIndex_c::SnippetsDocIndex_c ( bool bQueryMode ) : m_uLastPos ( 0 ) , m_bQueryMode ( bQueryMode ) , m_bSentence ( false ) , m_bParagraph ( false ) {} void SnippetsDocIndex_c::SetupHits () { m_dDocHits.Resize ( m_dQueryWords.GetLength() + m_dStarWords.GetLength() ); m_uLastPos = 0; } bool SnippetsDocIndex_c::MatchStar ( const ExcerptGen_c::Keyword_t & tTok, const BYTE * sWord, int iWordLen ) const { assert ( tTok.m_uStar!=STAR_NONE ); const BYTE * sKeyword = m_dStarBuffer.Begin() + tTok.m_iWord; switch ( tTok.m_uStar ) { case STAR_FRONT: { int iOffset = iWordLen - tTok.m_iLength; return ( iOffset>=0 ) && ( memcmp ( sKeyword, sWord + iOffset, tTok.m_iLength )==0 ); } case STAR_BACK: return ( iWordLen>=tTok.m_iLength ) && ( memcmp ( sKeyword, sWord, tTok.m_iLength )==0 ); case STAR_BOTH: return strstr ( (const char *)sWord, (const char *)sKeyword )!=NULL; } return false; } int SnippetsDocIndex_c::FindWord ( SphWordID_t iWordID, const BYTE * sWord, int iWordLen ) const { const SphWordID_t * pQueryID = iWordID ? m_dQueryWords.BinarySearch ( iWordID ) : NULL; if ( pQueryID ) return pQueryID - m_dQueryWords.Begin(); if ( sWord && iWordLen ) ARRAY_FOREACH ( i, m_dStarWords ) if ( MatchStar ( m_dStarWords[i], sWord, iWordLen ) ) return i + m_dQueryWords.GetLength(); return -1; } void SnippetsDocIndex_c::AddHits ( SphWordID_t iWordID, const BYTE * sWord, int iWordLen, DWORD uPosition ) { assert ( m_dDocHits.GetLength()==m_dQueryWords.GetLength()+m_dStarWords.GetLength() ); const SphWordID_t * pQueryWord = ( iWordID ? m_dQueryWords.BinarySearch ( iWordID ) : NULL ); if ( pQueryWord ) { m_dDocHits [ pQueryWord - m_dQueryWords.Begin() ].Add ( uPosition ); return; } if ( sWord && iWordLen ) ARRAY_FOREACH ( i, m_dStarWords ) if ( MatchStar ( m_dStarWords[i], sWord, iWordLen ) ) m_dDocHits [ m_dQueryWords.GetLength() + i ].Add ( uPosition ); } bool SnippetsDocIndex_c::Parse ( const char * sQuery, ISphTokenizer * pTokenizer, CSphDict * pDict, const CSphSchema * pSchema, CSphString & sError, int iStopwordStep ) { if ( !m_bQueryMode ) { // parse bag-of-words query int iQueryLen = strlen ( sQuery ); // FIXME!!! get length as argument pTokenizer->SetBuffer ( (BYTE *)sQuery, iQueryLen ); BYTE * sWord = NULL; // FIXME!!! add warning on query words overflow while ( ( sWord = pTokenizer->GetToken() )!=NULL && ( m_dQueryWords.GetLength() + m_dStarWords.GetLength() )GetWordID ( sWord ); if ( !uWordID ) continue; bool bStarBack = ( *pTokenizer->GetTokenEnd()=='*' ); bool bStarFront = ( pTokenizer->GetTokenStart()!=pTokenizer->GetBufferPtr() ) && ( pTokenizer->GetTokenStart()[-1]=='*' ); int uStar = ( bStarFront ? STAR_FRONT : 0 ) | ( bStarBack ? STAR_BACK : 0 ); if ( uStar ) AddWord ( (const char *)sWord, uStar ); else AddWord ( uWordID ); } } else { // parse extended query if ( !sphParseExtendedQuery ( m_tQuery, sQuery, pTokenizer, pSchema, pDict, iStopwordStep ) ) { sError = m_tQuery.m_sParseError; return false; } m_tQuery.m_pRoot->ClearFieldMask(); ExtractWords ( m_tQuery.m_pRoot, pDict ); if ( m_bSentence ) { strncpy ( (char *)m_sTmpWord, MAGIC_WORD_SENTENCE, sizeof(m_sTmpWord) ); AddWord ( pDict->GetWordID ( m_sTmpWord ) ); } if ( m_bParagraph ) { strncpy ( (char *)m_sTmpWord, MAGIC_WORD_PARAGRAPH, sizeof(m_sTmpWord) ); AddWord ( pDict->GetWordID ( m_sTmpWord ) ); } // should be in sync with ExtRanker_c constructor ARRAY_FOREACH ( i, m_tQuery.m_dZones ) { snprintf ( (char *)m_sTmpWord, sizeof(m_sTmpWord), "%c%s", MAGIC_CODE_ZONE, m_tQuery.m_dZones[i].cstr() ); AddWord ( pDict->GetWordID ( m_sTmpWord ) ); } } // all ok, remove dupes, and return m_dQueryWords.Uniq(); assert ( !m_dStarWords.GetLength() || m_dStarBuffer.GetLength() ); return true; } void SnippetsDocIndex_c::AddWord ( SphWordID_t iWordID ) { assert ( iWordID ); m_dQueryWords.Add ( iWordID ); } void SnippetsDocIndex_c::AddWord ( const char * sWord, int iStarPosition ) { int iLen = strlen ( sWord ); int iOff = m_dStarBuffer.GetLength(); m_dStarBuffer.Resize ( iOff+iLen+1 ); // reserve space for word + trailing zero memcpy ( &m_dStarBuffer[iOff], sWord, iLen ); m_dStarBuffer[iOff+iLen] = 0; ExcerptGen_c::Keyword_t & tTok = m_dStarWords.Add(); tTok.m_iWord = iOff; tTok.m_iLength = iLen; tTok.m_uStar = iStarPosition; } void SnippetsDocIndex_c::ExtractWords ( XQNode_t * pNode, CSphDict * pDict ) { m_bSentence |= ( pNode->GetOp()==SPH_QUERY_SENTENCE ); m_bParagraph |= ( pNode->GetOp()==SPH_QUERY_PARAGRAPH ); ARRAY_FOREACH ( i, pNode->m_dWords ) { const XQKeyword_t & tWord = pNode->m_dWords[i]; if ( tWord.m_uStarPosition ) { AddWord ( tWord.m_sWord.cstr(), tWord.m_uStarPosition ); } else { strncpy ( (char *)m_sTmpWord, tWord.m_sWord.cstr(), sizeof(m_sTmpWord) ); SphWordID_t iWordID = pDict->GetWordID ( m_sTmpWord ); if ( iWordID ) AddWord ( iWordID ); } } ARRAY_FOREACH ( i, pNode->m_dChildren ) ExtractWords ( pNode->m_dChildren[i], pDict ); } ////////////////////////////////////////////////////////////////////////// /// document token processor functor traits class TokenFunctorTraits_c : public ISphNoncopyable, public ExcerptQuery_t { public: CSphVector m_dZones; SmallStringHash_T m_hZones; CSphVector m_dResult; SnippetsDocIndex_c & m_tContainer; ISphTokenizer * m_pTokenizer; CSphDict * m_pDict; const char * m_pDoc; int m_iBoundaryStep; int m_iStopwordStep; bool m_bIndexExactWords; int m_iDocLen; explicit TokenFunctorTraits_c ( SnippetsDocIndex_c & tContainer, ISphTokenizer * pTokenizer, CSphDict * pDict, const ExcerptQuery_t & tQuery, const CSphIndexSettings & tSettingsIndex, const char * sDoc, int iDocLen ) : m_tContainer ( tContainer ) , m_pTokenizer ( pTokenizer ) , m_pDict ( pDict ) , m_pDoc ( NULL ) , m_iBoundaryStep ( tSettingsIndex.m_iBoundaryStep ) , m_iStopwordStep ( tSettingsIndex.m_iStopwordStep ) , m_bIndexExactWords ( tSettingsIndex.m_bIndexExactWords ) , m_iDocLen ( iDocLen ) { assert ( m_pTokenizer && m_pDict ); ExcerptQuery_t::operator = ( tQuery ); m_pTokenizer->SetBuffer ( (BYTE*)sDoc, m_iDocLen ); m_pDoc = m_pTokenizer->GetBufferPtr(); } void ResultEmit ( const char * pSrc, int iLen, bool bHasPassageMacro=false, int iPassageId=0, const char * pPost=NULL, int iPostLen=0 ) { if ( iLen>0 ) { int iOutLen = m_dResult.GetLength(); m_dResult.Resize ( iOutLen+iLen ); memcpy ( &m_dResult[iOutLen], pSrc, iLen ); } if ( !bHasPassageMacro ) return; char sBuf[16]; int iPassLen = snprintf ( sBuf, sizeof(sBuf), "%d", iPassageId ); int iOutLen = m_dResult.GetLength(); m_dResult.Resize ( iOutLen + iPassLen + iPostLen ); if ( iPassLen ) memcpy ( m_dResult.Begin()+iOutLen, sBuf, iPassLen ); if ( iPostLen ) memcpy ( m_dResult.Begin()+iOutLen+iPassLen, pPost, iPostLen ); } virtual void OnOverlap ( int iStart, int iLen ) = 0; virtual void OnSkipHtml ( int iStart, int iLen ) = 0; virtual void OnToken ( int iStart, int iLen, const BYTE * sWord, DWORD uPosition, const CSphVector & dWordids ) = 0; virtual void OnSPZ ( BYTE iSPZ, DWORD uPosition, char * sZoneName ) = 0; virtual void OnTail ( int iStart, int iLen ) = 0; virtual void OnFinish () = 0; virtual const CSphVector * GetHitlist ( const XQKeyword_t & tWord ) const = 0; }; /// functor that processes tokens and collects matching keyword hits into mini-index class HitCollector_c : public TokenFunctorTraits_c { public: mutable BYTE m_sTmpWord [ 3*SPH_MAX_WORD_LEN + 16 ]; SphWordID_t m_uSentenceID; SphWordID_t m_uParagraphID; public: explicit HitCollector_c ( SnippetsDocIndex_c & tContainer, ISphTokenizer * pTokenizer, CSphDict * pDict, const ExcerptQuery_t & tQuery, const CSphIndexSettings & tSettingsIndex, const char * sDoc, int iDocLen ) : TokenFunctorTraits_c ( tContainer, pTokenizer, pDict, tQuery, tSettingsIndex, sDoc, iDocLen ) { strncpy ( (char *)m_sTmpWord, MAGIC_WORD_SENTENCE, sizeof(m_sTmpWord) ); m_uSentenceID = pDict->GetWordID ( m_sTmpWord ); strncpy ( (char *)m_sTmpWord, MAGIC_WORD_PARAGRAPH, sizeof(m_sTmpWord) ); m_uParagraphID = pDict->GetWordID ( m_sTmpWord ); m_tContainer.SetupHits(); } virtual ~HitCollector_c () {} virtual void OnToken ( int, int iLen, const BYTE * sWord, DWORD uPosition, const CSphVector & dWordids ) { bool bReal = false; ARRAY_FOREACH ( i, dWordids ) if ( dWordids[i] ) { m_tContainer.AddHits ( dWordids[i], sWord, iLen, uPosition ); bReal = true; } m_tContainer.m_uLastPos = bReal ? uPosition : m_tContainer.m_uLastPos; } virtual void OnSPZ ( BYTE iSPZ, DWORD uPosition, char * sZoneName ) { switch ( iSPZ ) { case MAGIC_CODE_SENTENCE: m_tContainer.AddHits ( m_uSentenceID, NULL, 0, uPosition ); break; case MAGIC_CODE_PARAGRAPH: m_tContainer.AddHits ( m_uParagraphID, NULL, 0, uPosition ); break; case MAGIC_CODE_ZONE: assert ( m_dZones.GetLength() ); assert ( ( ( m_dZones.Last()>>32 ) & UINT32_MASK )==uPosition ); assert ( sZoneName ); m_tContainer.AddHits ( m_pDict->GetWordID ( (BYTE *)sZoneName ), NULL, 0, uPosition ); break; default: assert ( 0 && "impossible SPZ" ); } m_tContainer.m_uLastPos = uPosition; } virtual const CSphVector * GetHitlist ( const XQKeyword_t & tWord ) const { int iWord = -1; if ( tWord.m_uStarPosition ) { iWord = m_tContainer.FindWord ( 0, (const BYTE *)tWord.m_sWord.cstr(), tWord.m_sWord.Length() ); } else { strncpy ( (char *)m_sTmpWord, tWord.m_sWord.cstr(), sizeof(m_sTmpWord) ); SphWordID_t iWordID = m_pDict->GetWordID ( m_sTmpWord ); if ( iWordID ) iWord = m_tContainer.FindWord ( iWordID, NULL, 0 ); } if ( iWord!=-1 ) return m_tContainer.m_dDocHits.Begin()+iWord; else return NULL; } virtual void OnOverlap ( int, int ) {} virtual void OnSkipHtml ( int, int ) {} virtual void OnTail ( int, int ) {} virtual void OnFinish () {} }; /// functor that matches tokens against query words from mini-index and highlights them class HighlightPlain_c : public TokenFunctorTraits_c { protected: int m_iBeforeLen; int m_iAfterLen; int m_iBeforePostLen; int m_iAfterPostLen; public: HighlightPlain_c ( SnippetsDocIndex_c & tContainer, ISphTokenizer * pTokenizer, CSphDict * pDict, const ExcerptQuery_t & tQuery, const CSphIndexSettings & tSettingsIndex, const char * sDoc, int iDocLen ) : TokenFunctorTraits_c ( tContainer, pTokenizer, pDict, tQuery, tSettingsIndex, sDoc, iDocLen ) , m_iBeforeLen ( tQuery.m_sBeforeMatch.Length() ) , m_iAfterLen ( tQuery.m_sAfterMatch.Length() ) , m_iBeforePostLen ( tQuery.m_sBeforeMatchPassage.Length() ) , m_iAfterPostLen ( tQuery.m_sAfterMatchPassage.Length() ) { m_dResult.Reserve ( m_iDocLen ); } virtual ~HighlightPlain_c () {} virtual void OnOverlap ( int iStart, int iLen ) { assert ( m_pDoc ); assert ( iStart>=0 && m_pDoc+iStart+iLen<=m_pTokenizer->GetBufferEnd() ); ResultEmit ( m_pDoc+iStart, iLen ); } virtual void OnSkipHtml ( int iStart, int iLen ) { assert ( m_pDoc ); assert ( iStart>=0 && m_pDoc+iStart+iLen<=m_pTokenizer->GetBufferEnd() ); ResultEmit ( m_pDoc+iStart, iLen ); } virtual void OnToken ( int iStart, int iLen, const BYTE * sWord, DWORD, const CSphVector & dWordids ) { assert ( m_pDoc ); assert ( iStart>=0 && m_pDoc+iStart+iLen<=m_pTokenizer->GetBufferEnd() ); bool bMatch = m_tContainer.FindWord ( dWordids[0], sWord , iLen )!=-1; // the primary one; need this for star matching for ( int i=1; i=0 && m_pDoc+iStart+iLen<=m_pTokenizer->GetBufferEnd() ); ResultEmit ( m_pDoc+iStart, iLen ); } virtual void OnFinish () {} virtual const CSphVector * GetHitlist ( const XQKeyword_t & ) const { return NULL; } }; /// functor that matches tokens against hit positions from mini-index and highlights them class HighlightQuery_c : public HighlightPlain_c { public: const SphHitMark_t * m_pHit; const SphHitMark_t * m_pHitEnd; public: HighlightQuery_c ( SnippetsDocIndex_c & tContainer, ISphTokenizer * pTokenizer, CSphDict * pDict, const ExcerptQuery_t & tQuery, const CSphIndexSettings & tSettingsIndex, const char * sDoc, int iDocLen, const CSphVector & dHits ) : HighlightPlain_c ( tContainer, pTokenizer, pDict, tQuery, tSettingsIndex, sDoc, iDocLen ) , m_pHit ( dHits.Begin() ) , m_pHitEnd ( dHits.Begin()+dHits.GetLength() ) {} virtual ~HighlightQuery_c () {} virtual void OnToken ( int iStart, int iLen, const BYTE *, DWORD uPosition, const CSphVector & ) { assert ( m_pDoc ); assert ( iStart>=0 && m_pDoc+iStart+iLen<=m_pTokenizer->GetBufferEnd() ); // fast forward until next potentially matching hit (hits are sorted by position) while ( m_pHitm_uPosition+m_pHit->m_uSpan<=uPosition ) m_pHit++; // marker folding, emit "before" marker at span start only if ( m_pHitm_uPosition ) ResultEmit ( m_sBeforeMatch.cstr(), m_iBeforeLen, m_bHasBeforePassageMacro, m_iPassageId, m_sBeforeMatchPassage.cstr(), m_iBeforePostLen ); // emit token itself ResultEmit ( m_pDoc+iStart, iLen ); // marker folding, emit "after" marker at span end only if ( m_pHitm_uPosition+m_pHit->m_uSpan-1 ) ResultEmit ( m_sAfterMatch.cstr(), m_iAfterLen, m_bHasAfterPassageMacro, m_iPassageId++, m_sAfterMatchPassage.cstr(), m_iAfterPostLen ); } }; // make zone name lowercase static void CopyZoneName ( CSphVector & dName, const char * sZone, int iLen ) { dName.Resize ( iLen+1 ); char * pDst = dName.Begin(); const char * pEnd = sZone + iLen; while ( sZone & dZoneStack, CSphVector & dZoneName #ifndef NDEBUG , const char * pBuf , CSphVector & dZonePos #endif ) { CSphVector & dZones = tFunctor.m_dZones; SmallStringHash_T & hZones = tFunctor.m_hZones; // span's management if ( *pStart!='/' ) // open zone { #ifndef NDEBUG // zone position in characters dZonePos.Add ( pStart-pBuf ); #endif // zone stack management int iSelf = dZones.GetLength(); dZoneStack.Add ( iSelf ); // add zone itself int iZoneNameLen = pEnd-pStart-1; CopyZoneName ( dZoneName, pStart, iZoneNameLen ); int iZone = FindAddZone ( dZoneName.Begin(), iZoneNameLen, hZones ); dZones.Add ( sphPackZone ( uPosition, iSelf, iZone ) ); } else // close zone { #ifndef NDEBUG // lets check open - close tags match assert ( dZoneStack.GetLength() && dZoneStack.Last()>32 ) & UINT32_MASK ); assert ( iZone==(int)( uOpenPacked & UINT16_MASK ) ); // check for zone's types match; dZones[iOpen] = sphPackZone ( uOpenPos, iClose, iZone ); dZones.Add ( sphPackZone ( uPosition, iOpen, iZone ) ); #ifndef NDEBUG // zone position in characters dZonePos.Add ( pStart-pBuf ); #endif // pop up current zone from zone's stack dZoneStack.Resize ( dZoneStack.GetLength()-1 ); } } /// tokenize document using a given functor static void TokenizeDocument ( TokenFunctorTraits_c & tFunctor, const CSphHTMLStripper * pStripper ) { ISphTokenizer * pTokenizer = tFunctor.m_pTokenizer; CSphDict * pDict = tFunctor.m_pDict; const char * pStartPtr = pTokenizer->GetBufferPtr (); const char * pLastTokenEnd = pStartPtr; const char * pBufferEnd = pTokenizer->GetBufferEnd(); assert ( pStartPtr && pLastTokenEnd ); bool bRetainHtml = tFunctor.m_sStripMode=="retain"; int iSPZ = tFunctor.m_iPassageBoundary; int uPosition = 0; BYTE * sWord = NULL; SphWordID_t iBlendID = 0; SphWordID_t iBlendedExactID = 0; const char * pBlendedEnd = NULL; CSphVector dZoneStack; CSphVector dZoneName ( 16+3*SPH_MAX_WORD_LEN ); BYTE sExactBuf [ 3*SPH_MAX_WORD_LEN+4 ]; BYTE sNonStemmed [ 3*SPH_MAX_WORD_LEN+3]; // FIXME!!! replace by query SPZ extraction pass if ( !iSPZ && ( bRetainHtml && tFunctor.m_bHighlightQuery ) ) iSPZ = MAGIC_CODE_ZONE; #ifndef NDEBUG CSphVector dZonePos; #endif const bool bUtf8 = pTokenizer->IsUtf8(); while ( ( sWord = pTokenizer->GetToken() )!=NULL ) { if ( pTokenizer->TokenIsBlended() ) { if ( pBlendedEndGetTokenEnd() ) { iBlendID = pDict->GetWordID ( sWord ); iBlendedExactID = 0; pBlendedEnd = pTokenizer->GetTokenEnd(); if ( tFunctor.m_bHighlightQuery && tFunctor.m_bIndexExactWords ) { int iLen = strlen ( (const char *)sWord ); if ( iLen+2>sizeof(sExactBuf) ) iLen = sizeof(sExactBuf)-2; memcpy ( sExactBuf + 1, sWord, iLen ); sExactBuf[0] = MAGIC_WORD_HEAD_NONSTEMMED; sExactBuf[iLen+1] = '\0'; iBlendedExactID = pDict->GetWordIDNonStemmed ( sExactBuf ); } } continue; } uPosition += pTokenizer->GetOvershortCount(); const char * pTokenStart = pTokenizer->GetTokenStart (); if ( pTokenStart>pLastTokenEnd ) { tFunctor.OnOverlap ( pLastTokenEnd-pStartPtr, pTokenStart - pLastTokenEnd ); pLastTokenEnd = pTokenStart; } if ( bRetainHtml && *pTokenStart=='<' ) { const CSphHTMLStripper::StripperTag_t * pTag = NULL; const BYTE * sZoneName = NULL; const char * pEndSPZ = NULL; int iZoneNameLen = 0; if ( iSPZ && pStripper && pTokenStart+2IsValidTagStart ( *(pTokenStart+1) ) || pTokenStart[1]=='/') ) { pEndSPZ = (const char *)pStripper->FindTag ( (const BYTE *)pTokenStart+1, &pTag, &sZoneName, &iZoneNameLen ); } // regular HTML markup - keep it int iTagEnd = FindTagEnd ( pTokenStart ); if ( iTagEnd!=-1 ) { assert ( pTokenStart+iTagEndGetBufferEnd() ); tFunctor.OnSkipHtml ( pTokenStart-pStartPtr, iTagEnd+1 ); pTokenizer->SetBufferPtr ( pTokenStart+iTagEnd+1 ); pLastTokenEnd = pTokenStart+iTagEnd+1; // fix it up to prevent adding last chunk on exit } if ( pTag ) // (!S)PZ fix-up { pEndSPZ += ( pEndSPZ+1<=pBufferEnd && ( *pEndSPZ )!='\0' ); // skip closing angle bracket, if any assert ( pTag->m_bPara || pTag->m_bZone ); assert ( pTag->m_bPara || pEndSPZ[0]=='\0' || pEndSPZ[-1]=='>' ); // should be at tag's end assert ( pEndSPZ && pEndSPZ<=pBufferEnd ); uPosition++; // handle paragraph boundaries if ( pTag->m_bPara ) { tFunctor.OnSPZ ( MAGIC_CODE_PARAGRAPH, uPosition, NULL ); } else if ( pTag->m_bZone ) // handle zones { #ifndef NDEBUG AddZone ( pTokenStart+1, pTokenStart+2+iZoneNameLen, uPosition, tFunctor, dZoneStack, dZoneName, pStartPtr, dZonePos ); #else AddZone ( pTokenStart+1, pTokenStart+2+iZoneNameLen, uPosition, tFunctor, dZoneStack, dZoneName ); #endif tFunctor.OnSPZ ( MAGIC_CODE_ZONE, uPosition, dZoneName.Begin() ); } } if ( iTagEnd ) continue; } // handle SPZ tokens GE then needed // add SENTENCE, PARAGRAPH, ZONE token, do junks and tokenizer and pLastTokenEnd fix up // FIXME!!! it heavily depends on such attitude MAGIC_CODE_SENTENCE < MAGIC_CODE_PARAGRAPH < MAGIC_CODE_ZONE if ( *sWord==MAGIC_CODE_SENTENCE || *sWord==MAGIC_CODE_PARAGRAPH || *sWord==MAGIC_CODE_ZONE ) { // SPZ token has position and could be last token too uPosition += ( iSPZ && *sWord>=iSPZ ); if ( *sWord==MAGIC_CODE_ZONE ) { const char * pZoneEnd = pTokenizer->GetBufferPtr(); const char * pZoneStart = pZoneEnd; while ( *pZoneEnd && *pZoneEnd!=MAGIC_CODE_ZONE ) pZoneEnd++; pZoneEnd++; // skip zone token too pTokenizer->SetBufferPtr ( pZoneEnd ); pLastTokenEnd = pZoneEnd; // fix it up to prevent adding last chunk on exit #ifndef NDEBUG AddZone ( pZoneStart, pZoneEnd, uPosition, tFunctor, dZoneStack, dZoneName, pStartPtr, dZonePos ); #else AddZone ( pZoneStart, pZoneEnd, uPosition, tFunctor, dZoneStack, dZoneName ); #endif } if ( iSPZ && *sWord>=iSPZ ) { tFunctor.OnSPZ ( *sWord, uPosition, dZoneName.Begin() ); } continue; } pLastTokenEnd = pTokenizer->GetTokenEnd (); int iWordLen = pLastTokenEnd - pTokenStart; // build wordids vector // (exact form, blended, substrings all yield multiple ids) // TODO! only doing exact currently; add everything else (blended/star) here too CSphVector dWordids; dWordids.Add ( 0 ); // will be fixed up later with "primary" wordid if ( tFunctor.m_bHighlightQuery && tFunctor.m_bIndexExactWords ) { int iBytes = iWordLen; if ( iBytes+2>sizeof(sExactBuf) ) iBytes = sizeof(sExactBuf)-2; memcpy ( sExactBuf + 1, sWord, iBytes ); sExactBuf[0] = MAGIC_WORD_HEAD_NONSTEMMED; sExactBuf[iBytes+1] = '\0'; dWordids.Add ( pDict->GetWordIDNonStemmed ( sExactBuf ) ); } int iNonStemmedLen = iWordLen; if ( iNonStemmedLen+1>sizeof(sNonStemmed) ) iNonStemmedLen = sizeof(sNonStemmed)-1; memcpy ( sNonStemmed, sWord, iNonStemmedLen ); sNonStemmed[iNonStemmedLen] = '\0'; // must be last because it can change (stem) sWord SphWordID_t iWord = pDict->GetWordID ( sWord ); dWordids[0] = iWord; // compute position if ( pTokenizer->GetBoundary() ) uPosition += tFunctor.m_iBoundaryStep; bool bIsStopWord = false; if ( !iWord ) bIsStopWord = pDict->IsStopWord ( sWord ); if ( iWord || bIsStopWord ) uPosition += bIsStopWord ? tFunctor.m_iStopwordStep : 1; ExcerptGen_c::Token_t tDocTok; tDocTok.m_eType = ( iWord || bIsStopWord ) ? ExcerptGen_c::TOK_WORD : ExcerptGen_c::TOK_SPACE; tDocTok.m_uPosition = ( iWord || bIsStopWord ) ? uPosition : 0; tDocTok.m_iStart = pTokenStart - pStartPtr; tDocTok.m_iLengthBytes = tDocTok.m_iLengthCP = iWordLen; if ( bUtf8 && ( iWord || bIsStopWord ) ) tDocTok.m_iLengthCP = sphUTF8Len ( pTokenStart, tDocTok.m_iLengthBytes ); if ( !pTokenizer->TokenIsBlendedPart() ) { iBlendID = 0; iBlendedExactID = 0; } else { dWordids.Add ( iBlendID ); if ( iBlendedExactID ) dWordids.Add ( iBlendedExactID ); } // match & emit // star match needs non-stemmed word tFunctor.OnToken ( tDocTok.m_iStart, tDocTok.m_iLengthBytes, sNonStemmed, tDocTok.m_uPosition, dWordids ); } // last space if any if ( pLastTokenEnd!=pTokenizer->GetBufferEnd() ) tFunctor.OnTail ( pLastTokenEnd-pStartPtr, pTokenizer->GetBufferEnd() - pLastTokenEnd ); tFunctor.OnFinish(); } /// snippets query words for different cases class SnippetsFastQword_c : public ISphQword { public: const CSphVector * m_pHits; CSphMatch m_tMatch; DWORD m_uLastPos; public: explicit SnippetsFastQword_c ( const CSphVector * pHits ) : m_pHits ( pHits ) , m_uLastPos ( 0 ) {} virtual ~SnippetsFastQword_c () {} void Setup ( DWORD uLastPos ) { m_iDocs = 0; m_iHits = 0; m_uLastPos = uLastPos; if ( m_pHits ) { m_iDocs = 1; m_iHits = m_pHits->GetLength(); m_uMatchHits = 0; m_bHasHitlist = true; } } bool HasHits () const { return m_pHits && m_uMatchHits<(DWORD)m_pHits->GetLength(); } virtual const CSphMatch & GetNextDoc ( DWORD * ) { m_dFields.Set(); m_tMatch.m_iDocID = !m_tMatch.m_iDocID && HasHits() ? 1 : 0; return m_tMatch; } virtual Hitpos_t GetNextHit () { if ( !HasHits() ) return EMPTY_HIT; int iPosition = *( m_pHits->Begin() + m_uMatchHits++ ); return HITMAN::Create ( 0, iPosition, (m_uLastPos==(DWORD)iPosition) ); } virtual void SeekHitlist ( SphOffset_t ) {} }; /// snippets query word setup class SnippetsFastQwordSetup_c : public ISphQwordSetup { public: const HitCollector_c * m_pHiglighter; public: explicit SnippetsFastQwordSetup_c ( const HitCollector_c * pHiglighter ) { m_pHiglighter = pHiglighter; } virtual ~SnippetsFastQwordSetup_c () {} virtual ISphQword * QwordSpawn ( const XQKeyword_t & tWord ) const { return new SnippetsFastQword_c ( m_pHiglighter->GetHitlist ( tWord ) ); } virtual bool QwordSetup ( ISphQword * pQword ) const { SnippetsFastQword_c * pWord = dynamic_cast ( pQword ); assert ( pWord ); pWord->Setup ( m_pHiglighter->m_tContainer.m_uLastPos ); return true; } }; inline bool operator < ( const SphHitMark_t & a, const SphHitMark_t & b ) { return a.m_uPosition < b.m_uPosition; } static char * HighlightAllFastpath ( const ExcerptQuery_t & tQuerySettings, const CSphIndexSettings & tIndexSettings, const char * sDoc, int iDocLen, CSphDict * pDict, ISphTokenizer * pTokenizer, const CSphHTMLStripper * pStripper, const CSphSchema * pSchema, CSphString & sError, ISphTokenizer * pQueryTokenizer ) { ExcerptQuery_t tFixedSettings ( tQuerySettings ); // exact_phrase is replaced by query_mode=1 + "query words" if ( tQuerySettings.m_bExactPhrase ) { if ( !tQuerySettings.m_bHighlightQuery && tQuerySettings.m_sWords.Length() && strchr ( tQuerySettings.m_sWords.cstr(), 0x22 )==NULL ) tFixedSettings.m_sWords.SetSprintf ( "\"%s\"", tQuerySettings.m_sWords.cstr() ); tFixedSettings.m_bHighlightQuery = true; } bool bRetainHtml = ( tFixedSettings.m_sStripMode=="retain" ); // adjust tokenizer for markup-retaining mode if ( bRetainHtml ) pTokenizer->AddSpecials ( "<" ); // create query and hit lists container, parse query SnippetsDocIndex_c tContainer ( tFixedSettings.m_bHighlightQuery ); if ( !tContainer.Parse ( tFixedSettings.m_sWords.cstr(), pQueryTokenizer, pDict, pSchema, sError, tIndexSettings.m_iStopwordStep ) ) return NULL; // do highlighting if ( !tFixedSettings.m_bHighlightQuery ) { // simple bag of words query // do just one tokenization pass over the document, matching and highlighting keywords HighlightPlain_c tHighlighter ( tContainer, pTokenizer, pDict, tFixedSettings, tIndexSettings, sDoc, iDocLen ); TokenizeDocument ( tHighlighter, NULL ); // add trailing zero, and return tHighlighter.m_dResult.Add ( 0 ); return (char*) tHighlighter.m_dResult.LeakData(); } else { // query with syntax // do two passes over document // 1st pass will tokenize document, match keywords, and store positions into docindex // 2nd pass will highlight matching positions only (with some matching engine aid) // do the 1st pass HitCollector_c tHitCollector ( tContainer, pTokenizer, pDict, tFixedSettings, tIndexSettings, sDoc, iDocLen ); TokenizeDocument ( tHitCollector, pStripper ); // prepare for the 2nd pass (that is, extract matching hits) SnippetZoneChecker_c tZoneChecker ( tHitCollector.m_dZones, tHitCollector.m_hZones, tContainer.m_tQuery.m_dZones ); SnippetsFastQwordSetup_c tQwordSetup ( &tHitCollector ); tQwordSetup.m_pDict = pDict; tQwordSetup.m_eDocinfo = SPH_DOCINFO_EXTERN; tQwordSetup.m_pWarning = &sError; tQwordSetup.m_pZoneChecker = &tZoneChecker; CSphScopedPtr pMarker ( CSphHitMarker::Create ( tContainer.m_tQuery.m_pRoot, tQwordSetup ) ); if ( !pMarker.Ptr() ) return NULL; CSphVector dMarked; pMarker->Mark ( dMarked ); // we just collected matching spans into dMarked, but! // certain spans might not match all words within the span // for instance, (one NEAR/3 two) could return a 5-word span // but we do have full matching keywords list in tContainer // so let's post-process and break down such spans // FIXME! what about phrase spans vs stopwords? they will be split now if ( !tQuerySettings.m_bExactPhrase ) ARRAY_FOREACH ( i, dMarked ) { if ( dMarked[i].m_uSpan==1 ) continue; CSphVector dMatched; for ( int j=0; j<(int)dMarked[i].m_uSpan; j++ ) { // OPTIMZE? we can premerge all dochits vectors once const int iPos = dMarked[i].m_uPosition + j; ARRAY_FOREACH ( k, tContainer.m_dDocHits ) if ( tContainer.m_dDocHits[k].BinarySearch ( iPos ) ) { dMatched.Add ( iPos ); break; } } // this is something that must never happen // we got a span out of the matching engine that does not match any keywords?! assert ( dMatched.GetLength() ); if ( !dMatched.GetLength() ) { dMarked.RemoveFast ( i-- ); // remove, rescan continue; } // append all matching keywords as 1-long spans ARRAY_FOREACH ( j, dMatched ) { SphHitMark_t & tMarked = dMarked.Add(); tMarked.m_uPosition = dMatched[j]; tMarked.m_uSpan = 1; } // this swaps current span with the last 1-long span we added // which is by definition okay; so we need not rescan it dMarked.RemoveFast ( i ); } dMarked.Uniq(); // we just exploded spans into actual matching hits // now lets fold marked and matched hits back into contiguous spans // so that we could highlight such spans instead of every individual word SphHitMark_t * pOut = dMarked.Begin(); // last emitted folded token SphHitMark_t * pIn = dMarked.Begin() + 1; // next token to process SphHitMark_t * pMax = dMarked.Begin() + dMarked.GetLength(); while ( pInm_uPosition==( pOut->m_uPosition + pOut->m_uSpan ) ) { pOut->m_uSpan += pIn->m_uSpan; pIn++; } else { *++pOut = *pIn++; } } if ( dMarked.GetLength()>1 ) dMarked.Resize ( pOut - dMarked.Begin() + 1 ); // 2nd pass HighlightQuery_c tHighlighter ( tContainer, pTokenizer, pDict, tFixedSettings, tIndexSettings, sDoc, iDocLen, dMarked ); TokenizeDocument ( tHighlighter, pStripper ); // add trailing zero, and return tHighlighter.m_dResult.Add ( 0 ); return (char*) tHighlighter.m_dResult.LeakData(); } } ///////////////////////////////////////////////////////////////////////////// ExcerptQuery_t::ExcerptQuery_t () : m_sBeforeMatch ( "" ) , m_sAfterMatch ( "" ) , m_sChunkSeparator ( " ... " ) , m_sStripMode ( "index" ) , m_iLimit ( 256 ) , m_iLimitWords ( 0 ) , m_iLimitPassages ( 0 ) , m_iAround ( 5 ) , m_iPassageId ( 1 ) , m_iPassageBoundary ( 0 ) , m_bRemoveSpaces ( false ) , m_bExactPhrase ( false ) , m_bUseBoundaries ( false ) , m_bWeightOrder ( false ) , m_bHighlightQuery ( false ) , m_bForceAllWords ( false ) , m_bLoadFiles ( false ) , m_bAllowEmpty ( false ) , m_bEmitZones ( false ) , m_iRawFlags ( 0 ) , m_iSize ( 0 ) , m_iSeq ( 0 ) , m_iNext ( -1 ) , m_sRes ( NULL ) , m_bHasBeforePassageMacro ( false ) , m_bHasAfterPassageMacro ( false ) { } ///////////////////////////////////////////////////////////////////////////// char * sphBuildExcerpt ( ExcerptQuery_t & tOptions, CSphDict * pDict, ISphTokenizer * pTokenizer, const CSphSchema * pSchema, CSphIndex * pIndex, CSphString & sError, const CSphHTMLStripper * pStripper, ISphTokenizer * pQueryTokenizer ) { if ( tOptions.m_sStripMode=="retain" && !( tOptions.m_iLimit==0 && tOptions.m_iLimitPassages==0 && tOptions.m_iLimitWords==0 ) ) { sError = "html_strip_mode=retain requires that all limits are zero"; return NULL; } if ( !tOptions.m_sWords.cstr()[0] ) tOptions.m_bHighlightQuery = false; char * pData = const_cast ( tOptions.m_sSource.cstr() ); CSphFixedVector pBuffer ( 0 ); int iDataLen = tOptions.m_sSource.Length(); if ( tOptions.m_bLoadFiles ) { CSphAutofile tFile; if ( tFile.Open ( tOptions.m_sSource.cstr(), SPH_O_READ, sError )<0 ) return NULL; // will this ever trigger? time will tell; email me if it does! if ( tFile.GetSize()+1>=(SphOffset_t)INT_MAX ) { sError.SetSprintf ( "%s too big for snippet (over 2 GB)", pData ); return NULL; } int iFileSize = (int)tFile.GetSize(); if ( iFileSize<=0 ) { static char sEmpty[] = ""; return sEmpty; } iDataLen = iFileSize+1; pBuffer.Reset ( iDataLen ); if ( !tFile.Read ( pBuffer.Begin(), iFileSize, sError ) ) return NULL; pBuffer[iFileSize] = 0; pData = pBuffer.Begin(); } // strip if we have to if ( pStripper && ( tOptions.m_sStripMode=="strip" || tOptions.m_sStripMode=="index" ) ) pStripper->Strip ( (BYTE*)pData ); if ( tOptions.m_sStripMode!="retain" ) pStripper = NULL; // FIXME!!! check on real data (~100 Mb) as stripper changes len iDataLen = strlen ( pData ); // fast path that highlights entire document if (!( tOptions.m_iLimitPassages || ( tOptions.m_iLimitWords && tOptions.m_iLimitWordsGetSettings(), pData, iDataLen, pDict, pTokenizer, pStripper, pSchema, sError, pQueryTokenizer ); } if ( !tOptions.m_bHighlightQuery ) { // legacy highlighting ExcerptGen_c tGenerator ( pTokenizer->IsUtf8() ); tGenerator.TokenizeQuery ( tOptions, pDict, pTokenizer, pIndex->GetSettings() ); tGenerator.SetExactPhrase ( tOptions ); tGenerator.TokenizeDocument ( pData, iDataLen, pDict, pTokenizer, true, tOptions, pIndex->GetSettings() ); return tGenerator.BuildExcerpt ( tOptions ); } XQQuery_t tQuery; if ( !sphParseExtendedQuery ( tQuery, tOptions.m_sWords.cstr(), pQueryTokenizer, pSchema, pDict, pIndex->GetSettings().m_iStopwordStep ) ) { sError = tQuery.m_sParseError; return NULL; } tQuery.m_pRoot->ClearFieldMask(); ExcerptGen_c tGenerator ( pTokenizer->IsUtf8() ); tGenerator.TokenizeDocument ( pData, iDataLen, pDict, pTokenizer, false, tOptions, pIndex->GetSettings() ); CSphScopedPtr pZoneChecker ( new SnippetZoneChecker_c ( tGenerator.GetZones(), tGenerator.GetZonesName(), tQuery.m_dZones ) ); SnippetsQwordSetup tSetup ( &tGenerator, pTokenizer ); CSphString sWarning; tSetup.m_pDict = pDict; tSetup.m_pIndex = pIndex; tSetup.m_eDocinfo = SPH_DOCINFO_EXTERN; tSetup.m_pWarning = &sWarning; tSetup.m_pZoneChecker = pZoneChecker.Ptr(); CSphScopedPtr pMarker ( CSphHitMarker::Create ( tQuery.m_pRoot, tSetup ) ); if ( !pMarker.Ptr() ) { sError = sWarning; return NULL; } tGenerator.SetMarker ( pMarker.Ptr() ); return tGenerator.BuildExcerpt ( tOptions ); } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxexcerpt.h100777 0 0 6224 11643565732 14331 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #ifndef _sphinxexcerpt_ #define _sphinxexcerpt_ #include "sphinx.h" /// a query to generate an excerpt /// everything string is expected to be UTF-8 struct ExcerptQuery_t { public: CSphString m_sSource; ///< source text (or file name, see m_bLoadFiles) CSphString m_sWords; ///< words themselves CSphString m_sBeforeMatch; ///< string to insert before each match CSphString m_sAfterMatch; ///< string to insert after each match CSphString m_sChunkSeparator; ///< string to insert between matching chunks (in limited mode only) CSphString m_sStripMode; ///< strip mode int m_iLimit; ///< max chars in snippet (0 if unlimited) int m_iLimitWords; ///< max words in snippet int m_iLimitPassages; ///< max passages in snippet int m_iAround; ///< how much words to highlight around each match int m_iPassageId; ///< current %PASSAGE_ID% counter value (must start at 1) int m_iPassageBoundary; ///< passage boundary mode bool m_bRemoveSpaces; ///< whether to collapse whitespace bool m_bExactPhrase; ///< whether to highlight exact phrase matches only bool m_bUseBoundaries; ///< whether to extract passages by phrase boundaries setup in tokenizer bool m_bWeightOrder; ///< whether to order best passages in document (default) or weight order bool m_bHighlightQuery; ///< whether try to highlight the whole query, or always word-by-word bool m_bForceAllWords; ///< whether to ignore limit until all needed keywords are highlighted (#448) bool m_bLoadFiles; ///< whether to interpret source as text or file name bool m_bAllowEmpty; ///< whether to allow empty snippets (by default, return something from the start) bool m_bEmitZones; ///< whether to emit zone for passage int m_iRawFlags; ///< flags as they received from proto (to avoid coding/decoding to agents) CSphString m_sRawPassageBoundary; ///< boundary as it received from proto (to avoid coding/decoding to agents) public: int64_t m_iSize; ///< file size, to sort to work-queue order int m_iSeq; ///< request order, to sort back to request order int m_iNext; ///< the next one in one-link list for batch processing char * m_sRes; ///< snippet result holder (NOT owned) CSphString m_sError; ///< snippet error message bool m_bHasBeforePassageMacro; bool m_bHasAfterPassageMacro; CSphString m_sBeforeMatchPassage; CSphString m_sAfterMatchPassage; public: ExcerptQuery_t (); }; /// an excerpt generator /// returns a newly allocated string in encoding specified by tokenizer on success /// returns NULL on failure char * sphBuildExcerpt ( ExcerptQuery_t &, CSphDict *, ISphTokenizer *, const CSphSchema *, CSphIndex *, CSphString & sError, const CSphHTMLStripper *, ISphTokenizer * ); #endif // _sphinxexcerpt_ // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxexpr.cpp100777 0 0 266713 11643565732 14243 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxexpr.h" #include "sphinxudf.h" #include "sphinxutils.h" #include "sphinxint.h" #include #include #if !USE_WINDOWS #include #include #ifdef HAVE_DLOPEN #include #endif // HAVE_DLOPEN #endif // !USE_WINDOWS ////////////////////////////////////////////////////////////////////////// #ifndef M_LOG2E #define M_LOG2E 1.44269504088896340736 #endif #ifndef M_LOG10E #define M_LOG10E 0.434294481903251827651 #endif #if !USE_WINDOWS #ifndef HAVE_DLERROR #define dlerror() "" #endif // HAVE_DLERROR #endif // !USE_WINDOWS typedef int ( *UdfInit_fn ) ( SPH_UDF_INIT * init, SPH_UDF_ARGS * args, char * error ); typedef void ( *UdfDeinit_fn ) ( SPH_UDF_INIT * init ); /// loaded UDF library struct UdfLib_t { void * m_pHandle; ///< handle from dlopen() int m_iFuncs; ///< number of registered functions from this library }; /// registered UDF function struct UdfFunc_t { UdfLib_t * m_pLib; ///< library descriptor (pointer to library hash value) const CSphString * m_pLibName; ///< library name (pointer to library hash key) ESphAttr m_eRetType; ///< function type, currently FLOAT or INT UdfInit_fn m_fnInit; ///< per-query init function, mandatory UdfDeinit_fn m_fnDeinit; ///< per-query deinit function, optional void * m_fnFunc; ///< per-row worker function, mandatory int m_iUserCount; ///< number of active users currently working this function bool m_bToDrop; ///< scheduled for DROP; do not use }; /// UDF call site struct UdfCall_t { UdfFunc_t * m_pUdf; SPH_UDF_INIT m_tInit; SPH_UDF_ARGS m_tArgs; UdfCall_t(); ~UdfCall_t(); }; ////////////////////////////////////////////////////////////////////////// // GLOBALS ////////////////////////////////////////////////////////////////////////// // hack hack hack bool ( *g_pUservarsHook )( const CSphString & sUservar, CSphVector & dVals ) = NULL; static bool g_bUdfEnabled = false; static CSphString g_sUdfDir; static CSphStaticMutex g_tUdfMutex; static SmallStringHash_T g_hUdfLibs; static SmallStringHash_T g_hUdfFuncs; ////////////////////////////////////////////////////////////////////////// // UDF CALL SITE ////////////////////////////////////////////////////////////////////////// UdfCall_t::UdfCall_t () { m_pUdf = NULL; m_tInit.func_data = NULL; m_tInit.is_const = false; m_tArgs.arg_count = 0; m_tArgs.arg_types = NULL; m_tArgs.arg_values = NULL; m_tArgs.arg_names = NULL; m_tArgs.str_lengths = NULL; } UdfCall_t::~UdfCall_t () { if ( m_pUdf ) { g_tUdfMutex.Lock (); m_pUdf->m_iUserCount--; g_tUdfMutex.Unlock (); } SafeDeleteArray ( m_tArgs.arg_types ); SafeDeleteArray ( m_tArgs.arg_values ); SafeDeleteArray ( m_tArgs.arg_names ); SafeDeleteArray ( m_tArgs.str_lengths ); } ////////////////////////////////////////////////////////////////////////// // EVALUATION ENGINE ////////////////////////////////////////////////////////////////////////// struct ExprLocatorTraits_t : public ISphExpr { CSphAttrLocator m_tLocator; int m_iLocator; ExprLocatorTraits_t ( const CSphAttrLocator & tLocator, int iLocator ) : m_tLocator ( tLocator ), m_iLocator ( iLocator ) {} virtual void GetDependencyColumns ( CSphVector & dColumns ) const { dColumns.Add ( m_iLocator ); } }; struct Expr_GetInt_c : public ExprLocatorTraits_t { Expr_GetInt_c ( const CSphAttrLocator & tLocator, int iLocator ) : ExprLocatorTraits_t ( tLocator, iLocator ) {} virtual float Eval ( const CSphMatch & tMatch ) const { return (float) tMatch.GetAttr ( m_tLocator ); } // FIXME! OPTIMIZE!!! we can go the short route here virtual int IntEval ( const CSphMatch & tMatch ) const { return (int)tMatch.GetAttr ( m_tLocator ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return (int64_t)tMatch.GetAttr ( m_tLocator ); } }; struct Expr_GetBits_c : public ExprLocatorTraits_t { Expr_GetBits_c ( const CSphAttrLocator & tLocator, int iLocator ) : ExprLocatorTraits_t ( tLocator, iLocator ) {} virtual float Eval ( const CSphMatch & tMatch ) const { return (float) tMatch.GetAttr ( m_tLocator ); } virtual int IntEval ( const CSphMatch & tMatch ) const { return (int)tMatch.GetAttr ( m_tLocator ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return (int64_t)tMatch.GetAttr ( m_tLocator ); } }; struct Expr_GetSint_c : public ExprLocatorTraits_t { Expr_GetSint_c ( const CSphAttrLocator & tLocator, int iLocator ) : ExprLocatorTraits_t ( tLocator, iLocator ) {} virtual float Eval ( const CSphMatch & tMatch ) const { return (float)(int)tMatch.GetAttr ( m_tLocator ); } virtual int IntEval ( const CSphMatch & tMatch ) const { return (int)tMatch.GetAttr ( m_tLocator ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return (int)tMatch.GetAttr ( m_tLocator ); } }; struct Expr_GetFloat_c : public ExprLocatorTraits_t { Expr_GetFloat_c ( const CSphAttrLocator & tLocator, int iLocator ) : ExprLocatorTraits_t ( tLocator, iLocator ) {} virtual float Eval ( const CSphMatch & tMatch ) const { return tMatch.GetAttrFloat ( m_tLocator ); } }; struct Expr_GetString_c : public ExprLocatorTraits_t { const BYTE * m_pStrings; Expr_GetString_c ( const CSphAttrLocator & tLocator, int iLocator ) : ExprLocatorTraits_t ( tLocator, iLocator ) {} virtual float Eval ( const CSphMatch & ) const { assert ( 0 ); return 0; } virtual void SetStringPool ( const BYTE * pStrings ) { m_pStrings = pStrings; } virtual int StringEval ( const CSphMatch & tMatch, const BYTE ** ppStr ) const { SphAttr_t iOff = tMatch.GetAttr ( m_tLocator ); if ( iOff>0 ) return sphUnpackStr ( m_pStrings + iOff, ppStr ); *ppStr = NULL; return 0; } }; struct Expr_GetMva_c : public ExprLocatorTraits_t { const DWORD * m_pMva; Expr_GetMva_c ( const CSphAttrLocator & tLocator, int iLocator ) : ExprLocatorTraits_t ( tLocator, iLocator ) {} virtual float Eval ( const CSphMatch & ) const { assert ( 0 ); return 0; } virtual void SetMVAPool ( const DWORD * pMva ) { m_pMva = pMva; } virtual const DWORD * MvaEval ( const CSphMatch & tMatch ) const { return tMatch.GetAttrMVA ( m_tLocator, m_pMva ); } }; struct Expr_GetConst_c : public ISphExpr { float m_fValue; explicit Expr_GetConst_c ( float fValue ) : m_fValue ( fValue ) {} virtual float Eval ( const CSphMatch & ) const { return m_fValue; } }; struct Expr_GetIntConst_c : public ISphExpr { int m_iValue; explicit Expr_GetIntConst_c ( int iValue ) : m_iValue ( iValue ) {} virtual float Eval ( const CSphMatch & ) const { return (float) m_iValue; } // no assert() here cause generic float Eval() needs to work even on int-evaluator tree virtual int IntEval ( const CSphMatch & ) const { return m_iValue; } virtual int64_t Int64Eval ( const CSphMatch & ) const { return m_iValue; } }; struct Expr_GetInt64Const_c : public ISphExpr { int64_t m_iValue; explicit Expr_GetInt64Const_c ( int64_t iValue ) : m_iValue ( iValue ) {} virtual float Eval ( const CSphMatch & ) const { return (float) m_iValue; } // no assert() here cause generic float Eval() needs to work even on int-evaluator tree virtual int IntEval ( const CSphMatch & ) const { assert ( 0 ); return (int)m_iValue; } virtual int64_t Int64Eval ( const CSphMatch & ) const { return m_iValue; } }; struct Expr_GetStrConst_c : public ISphExpr { CSphString m_sVal; int m_iLen; explicit Expr_GetStrConst_c ( const char * sVal, int iLen ) { if ( iLen>0 ) SqlUnescape ( m_sVal, sVal, iLen ); m_iLen = m_sVal.Length(); } virtual int StringEval ( const CSphMatch &, const BYTE ** ppStr ) const { *ppStr = (const BYTE*) m_sVal.cstr(); return m_iLen; } virtual float Eval ( const CSphMatch & ) const { assert ( 0 ); return 0; } virtual int IntEval ( const CSphMatch & ) const { assert ( 0 ); return 0; } virtual int64_t Int64Eval ( const CSphMatch & ) const { assert ( 0 ); return 0; } }; struct Expr_GetId_c : public ISphExpr { virtual float Eval ( const CSphMatch & tMatch ) const { return (float)tMatch.m_iDocID; } virtual int IntEval ( const CSphMatch & tMatch ) const { return (int)tMatch.m_iDocID; } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return (int64_t)tMatch.m_iDocID; } }; struct Expr_GetWeight_c : public ISphExpr { virtual float Eval ( const CSphMatch & tMatch ) const { return (float)tMatch.m_iWeight; } virtual int IntEval ( const CSphMatch & tMatch ) const { return (int)tMatch.m_iWeight; } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return (int64_t)tMatch.m_iWeight; } }; ////////////////////////////////////////////////////////////////////////// struct Expr_Arglist_c : public ISphExpr { CSphVector m_dArgs; Expr_Arglist_c ( ISphExpr * pLeft, ISphExpr * pRight ) { AddArgs ( pLeft ); AddArgs ( pRight ); } ~Expr_Arglist_c () { ARRAY_FOREACH ( i, m_dArgs ) SafeRelease ( m_dArgs[i] ); } void AddArgs ( ISphExpr * pExpr ) { // not an arglist? just add it if ( !pExpr->IsArglist() ) { m_dArgs.Add ( pExpr ); return; } // arglist? take ownership of its args, and dismiss it Expr_Arglist_c * pArgs = (Expr_Arglist_c *) pExpr; ARRAY_FOREACH ( i, pArgs->m_dArgs ) { m_dArgs.Add ( pArgs->m_dArgs[i] ); pArgs->m_dArgs[i] = NULL; } SafeRelease ( pExpr ); } virtual bool IsArglist () const { return true; } virtual float Eval ( const CSphMatch & ) const { assert ( 0 && "internal error: Eval() must not be explicitly called on arglist" ); return 0.0f; } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { ARRAY_FOREACH ( i, m_dArgs ) m_dArgs[i]->GetDependencyColumns ( dColumns ); } }; ////////////////////////////////////////////////////////////////////////// struct Expr_Crc32_c : public ISphExpr { ISphExpr * m_pFirst; explicit Expr_Crc32_c ( ISphExpr * pFirst ) : m_pFirst ( pFirst ) {} ~Expr_Crc32_c () { SafeRelease ( m_pFirst ); } virtual void SetMVAPool ( const DWORD * pMvaPool ) { m_pFirst->SetMVAPool ( pMvaPool ); } virtual void SetStringPool ( const BYTE * pStrings ) { m_pFirst->SetStringPool ( pStrings ); } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { m_pFirst->GetDependencyColumns ( dColumns ); } virtual float Eval ( const CSphMatch & tMatch ) const { return (float)IntEval ( tMatch ); } virtual int IntEval ( const CSphMatch & tMatch ) const { const BYTE * pStr; return sphCRC32 ( pStr, m_pFirst->StringEval ( tMatch, &pStr ) ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return IntEval ( tMatch ); } }; ////////////////////////////////////////////////////////////////////////// #define FIRST m_pFirst->Eval(tMatch) #define SECOND m_pSecond->Eval(tMatch) #define THIRD m_pThird->Eval(tMatch) #define INTFIRST m_pFirst->IntEval(tMatch) #define INTSECOND m_pSecond->IntEval(tMatch) #define INTTHIRD m_pThird->IntEval(tMatch) #define INT64FIRST m_pFirst->Int64Eval(tMatch) #define INT64SECOND m_pSecond->Int64Eval(tMatch) #define INT64THIRD m_pThird->Int64Eval(tMatch) #define DECLARE_UNARY_TRAITS(_classname,_expr) \ struct _classname : public ISphExpr \ { \ ISphExpr * m_pFirst; \ explicit _classname ( ISphExpr * pFirst ) : m_pFirst ( pFirst ) {}; \ ~_classname () { SafeRelease ( m_pFirst ); } \ virtual void SetMVAPool ( const DWORD * pMvaPool ) { m_pFirst->SetMVAPool ( pMvaPool ); } \ virtual void SetStringPool ( const BYTE * pStrings ) { m_pFirst->SetStringPool ( pStrings ); } \ virtual float Eval ( const CSphMatch & tMatch ) const { return _expr; } \ virtual void GetDependencyColumns ( CSphVector & dColumns ) const { m_pFirst->GetDependencyColumns ( dColumns ); } \ #define DECLARE_UNARY_FLT(_classname,_expr) \ DECLARE_UNARY_TRAITS ( _classname, _expr ) \ }; #define DECLARE_UNARY_INT(_classname,_expr,_expr2,_expr3) \ DECLARE_UNARY_TRAITS ( _classname, _expr ) \ virtual int IntEval ( const CSphMatch & tMatch ) const { return _expr2; } \ virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return _expr3; } \ }; #define IABS(_arg) ( (_arg)>0 ? (_arg) : (-_arg) ) DECLARE_UNARY_INT ( Expr_Neg_c, -FIRST, -INTFIRST, -INT64FIRST ) DECLARE_UNARY_INT ( Expr_Abs_c, fabs(FIRST), IABS(INTFIRST), IABS(INT64FIRST) ) DECLARE_UNARY_FLT ( Expr_Ceil_c, float(ceil(FIRST)) ) DECLARE_UNARY_FLT ( Expr_Floor_c, float(floor(FIRST)) ) DECLARE_UNARY_FLT ( Expr_Sin_c, float(sin(FIRST)) ) DECLARE_UNARY_FLT ( Expr_Cos_c, float(cos(FIRST)) ) DECLARE_UNARY_FLT ( Expr_Ln_c, float(log(FIRST)) ) DECLARE_UNARY_FLT ( Expr_Log2_c, float(log(FIRST)*M_LOG2E) ) DECLARE_UNARY_FLT ( Expr_Log10_c, float(log(FIRST)*M_LOG10E) ) DECLARE_UNARY_FLT ( Expr_Exp_c, float(exp(FIRST)) ) DECLARE_UNARY_FLT ( Expr_Sqrt_c, float(sqrt(FIRST)) ) DECLARE_UNARY_INT ( Expr_NotInt_c, (float)(INTFIRST?0:1), INTFIRST?0:1, INTFIRST?0:1 ); DECLARE_UNARY_INT ( Expr_NotInt64_c, (float)(INT64FIRST?0:1), INT64FIRST?0:1, INT64FIRST?0:1 ); DECLARE_UNARY_INT ( Expr_Sint_c, (float)(INTFIRST), INTFIRST, INTFIRST ) ////////////////////////////////////////////////////////////////////////// #define DECLARE_BINARY_TRAITS(_classname,_expr) \ struct _classname : public ISphExpr \ { \ ISphExpr * m_pFirst; \ ISphExpr * m_pSecond; \ _classname ( ISphExpr * pFirst, ISphExpr * pSecond ) : m_pFirst ( pFirst ), m_pSecond ( pSecond ) {} \ ~_classname () { SafeRelease ( m_pFirst ); SafeRelease ( m_pSecond ); } \ virtual void SetMVAPool ( const DWORD * pMvaPool ) { m_pFirst->SetMVAPool ( pMvaPool ); m_pSecond->SetMVAPool ( pMvaPool ); } \ virtual void SetStringPool ( const BYTE * pStrings ) { m_pFirst->SetStringPool ( pStrings ); m_pSecond->SetStringPool ( pStrings ); } \ virtual float Eval ( const CSphMatch & tMatch ) const { return _expr; } \ virtual void GetDependencyColumns ( CSphVector & dColumns ) const \ { \ m_pFirst->GetDependencyColumns ( dColumns ); \ m_pSecond->GetDependencyColumns ( dColumns ); \ } \ #define DECLARE_BINARY_FLT(_classname,_expr) \ DECLARE_BINARY_TRAITS ( _classname, _expr ) \ }; #define DECLARE_BINARY_INT(_classname,_expr,_expr2,_expr3) \ DECLARE_BINARY_TRAITS ( _classname, _expr ) \ virtual int IntEval ( const CSphMatch & tMatch ) const { return _expr2; } \ virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return _expr3; } \ }; #define DECLARE_BINARY_POLY(_classname,_expr,_expr2,_expr3) \ DECLARE_BINARY_INT ( _classname##Float_c, _expr, (int)Eval(tMatch), (int64_t)Eval(tMatch ) ) \ DECLARE_BINARY_INT ( _classname##Int_c, (float)IntEval(tMatch), _expr2, (int64_t)IntEval(tMatch) ) \ DECLARE_BINARY_INT ( _classname##Int64_c, (float)Int64Eval(tMatch), (int)Int64Eval(tMatch), _expr3 ) #define IFFLT(_expr) ( (_expr) ? 1.0f : 0.0f ) #define IFINT(_expr) ( (_expr) ? 1 : 0 ) DECLARE_BINARY_INT ( Expr_Add_c, FIRST + SECOND, INTFIRST + INTSECOND, INT64FIRST + INT64SECOND ) DECLARE_BINARY_INT ( Expr_Sub_c, FIRST - SECOND, INTFIRST - INTSECOND, INT64FIRST - INT64SECOND ) DECLARE_BINARY_INT ( Expr_Mul_c, FIRST * SECOND, INTFIRST * INTSECOND, INT64FIRST * INT64SECOND ) DECLARE_BINARY_FLT ( Expr_Div_c, FIRST / SECOND ) DECLARE_BINARY_INT ( Expr_Idiv_c, (float)(int(FIRST)/int(SECOND)), INTFIRST / INTSECOND, INT64FIRST / INT64SECOND ) DECLARE_BINARY_INT ( Expr_BitAnd_c, (float)(int(FIRST)&int(SECOND)), INTFIRST & INTSECOND, INT64FIRST & INT64SECOND ) DECLARE_BINARY_INT ( Expr_BitOr_c, (float)(int(FIRST)|int(SECOND)), INTFIRST | INTSECOND, INT64FIRST | INT64SECOND ) DECLARE_BINARY_INT ( Expr_Mod_c, (float)(int(FIRST)%int(SECOND)), INTFIRST % INTSECOND, INT64FIRST % INT64SECOND ) DECLARE_BINARY_POLY ( Expr_Lt, IFFLT ( FIRSTSECOND ), IFINT ( INTFIRST>INTSECOND ), IFINT ( INT64FIRST>INT64SECOND ) ) DECLARE_BINARY_POLY ( Expr_Lte, IFFLT ( FIRST<=SECOND ), IFINT ( INTFIRST<=INTSECOND ), IFINT ( INT64FIRST<=INT64SECOND ) ) DECLARE_BINARY_POLY ( Expr_Gte, IFFLT ( FIRST>=SECOND ), IFINT ( INTFIRST>=INTSECOND ), IFINT ( INT64FIRST>=INT64SECOND ) ) DECLARE_BINARY_POLY ( Expr_Eq, IFFLT ( fabs ( FIRST-SECOND )<=1e-6 ), IFINT ( INTFIRST==INTSECOND ), IFINT ( INT64FIRST==INT64SECOND ) ) DECLARE_BINARY_POLY ( Expr_Ne, IFFLT ( fabs ( FIRST-SECOND )>1e-6 ), IFINT ( INTFIRST!=INTSECOND ), IFINT ( INT64FIRST!=INT64SECOND ) ) DECLARE_BINARY_INT ( Expr_Min_c, Min ( FIRST, SECOND ), Min ( INTFIRST, INTSECOND ), Min ( INT64FIRST, INT64SECOND ) ) DECLARE_BINARY_INT ( Expr_Max_c, Max ( FIRST, SECOND ), Max ( INTFIRST, INTSECOND ), Max ( INT64FIRST, INT64SECOND ) ) DECLARE_BINARY_FLT ( Expr_Pow_c, float ( pow ( FIRST, SECOND ) ) ) DECLARE_BINARY_POLY ( Expr_And, FIRST!=0.0f && SECOND!=0.0f, IFINT ( INTFIRST && INTSECOND ), IFINT ( INT64FIRST && INT64SECOND ) ) DECLARE_BINARY_POLY ( Expr_Or, FIRST!=0.0f || SECOND!=0.0f, IFINT ( INTFIRST || INTSECOND ), IFINT ( INT64FIRST || INT64SECOND ) ) ////////////////////////////////////////////////////////////////////////// #define DECLARE_TERNARY(_classname,_expr,_expr2,_expr3) \ struct _classname : public ISphExpr \ { \ ISphExpr * m_pFirst; \ ISphExpr * m_pSecond; \ ISphExpr * m_pThird; \ _classname ( ISphExpr * pFirst, ISphExpr * pSecond, ISphExpr * pThird ) : m_pFirst ( pFirst ), m_pSecond ( pSecond ), m_pThird ( pThird ) {} \ ~_classname () { SafeRelease ( m_pFirst ); SafeRelease ( m_pSecond ); SafeRelease ( m_pThird ); } \ virtual void SetMVAPool ( const DWORD * pMvaPool ) { m_pFirst->SetMVAPool ( pMvaPool ); m_pSecond->SetMVAPool ( pMvaPool ); m_pThird->SetMVAPool ( pMvaPool ); } \ virtual void SetStringPool ( const BYTE * pStrings ) { m_pFirst->SetStringPool ( pStrings ); m_pSecond->SetStringPool ( pStrings ); m_pThird->SetStringPool ( pStrings ); } \ virtual float Eval ( const CSphMatch & tMatch ) const { return _expr; } \ virtual int IntEval ( const CSphMatch & tMatch ) const { return _expr2; } \ virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return _expr3; } \ virtual void GetDependencyColumns ( CSphVector & dColumns ) const \ { \ m_pFirst->GetDependencyColumns ( dColumns ); \ m_pSecond->GetDependencyColumns ( dColumns ); \ m_pThird->GetDependencyColumns ( dColumns ); \ } \ }; DECLARE_TERNARY ( Expr_If_c, ( FIRST!=0.0f ) ? SECOND : THIRD, INTFIRST ? INTSECOND : INTTHIRD, INT64FIRST ? INT64SECOND : INT64THIRD ) DECLARE_TERNARY ( Expr_Madd_c, FIRST*SECOND+THIRD, INTFIRST*INTSECOND + INTTHIRD, INT64FIRST*INT64SECOND + INT64THIRD ) DECLARE_TERNARY ( Expr_Mul3_c, FIRST*SECOND*THIRD, INTFIRST*INTSECOND*INTTHIRD, INT64FIRST*INT64SECOND*INT64THIRD ) ////////////////////////////////////////////////////////////////////////// #if USE_WINDOWS void localtime_r ( const time_t * clock, struct tm * res ) { *res = *localtime ( clock ); // FIXME?! } #endif #define DECLARE_TIMESTAMP(_classname,_expr) \ DECLARE_UNARY_TRAITS ( _classname, (float)IntEval(tMatch) ) \ virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return IntEval(tMatch); } \ virtual int IntEval ( const CSphMatch & tMatch ) const \ { \ time_t ts = (time_t)FIRST; \ struct tm s; \ localtime_r ( &ts, &s ); \ return _expr; \ } \ }; DECLARE_TIMESTAMP ( Expr_Day_c, s.tm_mday ); DECLARE_TIMESTAMP ( Expr_Month_c, s.tm_mon+1 ); DECLARE_TIMESTAMP ( Expr_Year_c, s.tm_year+1900 ); DECLARE_TIMESTAMP ( Expr_YearMonth_c, (s.tm_year+1900)*100+s.tm_mon+1 ); DECLARE_TIMESTAMP ( Expr_YearMonthDay_c, (s.tm_year+1900)*10000+(s.tm_mon+1)*100+s.tm_mday ); ////////////////////////////////////////////////////////////////////////// // PARSER INTERNALS ////////////////////////////////////////////////////////////////////////// #include "yysphinxexpr.h" /// known functions enum Func_e { FUNC_NOW, FUNC_ABS, FUNC_CEIL, FUNC_FLOOR, FUNC_SIN, FUNC_COS, FUNC_LN, FUNC_LOG2, FUNC_LOG10, FUNC_EXP, FUNC_SQRT, FUNC_BIGINT, FUNC_SINT, FUNC_CRC32, FUNC_DAY, FUNC_MONTH, FUNC_YEAR, FUNC_YEARMONTH, FUNC_YEARMONTHDAY, FUNC_MIN, FUNC_MAX, FUNC_POW, FUNC_IDIV, FUNC_IF, FUNC_MADD, FUNC_MUL3, FUNC_INTERVAL, FUNC_IN, FUNC_BITDOT, FUNC_GEODIST }; struct FuncDesc_t { const char * m_sName; int m_iArgs; Func_e m_eFunc; ESphAttr m_eRet; }; static FuncDesc_t g_dFuncs[] = { { "now", 0, FUNC_NOW, SPH_ATTR_INTEGER }, { "abs", 1, FUNC_ABS, SPH_ATTR_NONE }, { "ceil", 1, FUNC_CEIL, SPH_ATTR_FLOAT }, { "floor", 1, FUNC_FLOOR, SPH_ATTR_FLOAT }, { "sin", 1, FUNC_SIN, SPH_ATTR_FLOAT }, { "cos", 1, FUNC_COS, SPH_ATTR_FLOAT }, { "ln", 1, FUNC_LN, SPH_ATTR_FLOAT }, { "log2", 1, FUNC_LOG2, SPH_ATTR_FLOAT }, { "log10", 1, FUNC_LOG10, SPH_ATTR_FLOAT }, { "exp", 1, FUNC_EXP, SPH_ATTR_FLOAT }, { "sqrt", 1, FUNC_SQRT, SPH_ATTR_FLOAT }, { "bigint", 1, FUNC_BIGINT, SPH_ATTR_BIGINT }, // type-enforcer special as-if-function { "sint", 1, FUNC_SINT, SPH_ATTR_BIGINT }, // type-enforcer special as-if-function { "crc32", 1, FUNC_CRC32, SPH_ATTR_INTEGER }, { "day", 1, FUNC_DAY, SPH_ATTR_INTEGER }, { "month", 1, FUNC_MONTH, SPH_ATTR_INTEGER }, { "year", 1, FUNC_YEAR, SPH_ATTR_INTEGER }, { "yearmonth", 1, FUNC_YEARMONTH, SPH_ATTR_INTEGER }, { "yearmonthday", 1, FUNC_YEARMONTHDAY, SPH_ATTR_INTEGER }, { "min", 2, FUNC_MIN, SPH_ATTR_NONE }, { "max", 2, FUNC_MAX, SPH_ATTR_NONE }, { "pow", 2, FUNC_POW, SPH_ATTR_FLOAT }, { "idiv", 2, FUNC_IDIV, SPH_ATTR_NONE }, { "if", 3, FUNC_IF, SPH_ATTR_NONE }, { "madd", 3, FUNC_MADD, SPH_ATTR_NONE }, { "mul3", 3, FUNC_MUL3, SPH_ATTR_NONE }, { "interval", -2, FUNC_INTERVAL, SPH_ATTR_INTEGER }, { "in", -1, FUNC_IN, SPH_ATTR_INTEGER }, { "bitdot", -1, FUNC_BITDOT, SPH_ATTR_NONE }, { "geodist", 4, FUNC_GEODIST, SPH_ATTR_FLOAT } }; ////////////////////////////////////////////////////////////////////////// /// check for type based on int value static inline ESphAttr GetIntType ( int64_t iValue ) { return ( iValue>=(int64_t)INT_MIN && iValue<=(int64_t)INT_MAX ) ? SPH_ATTR_INTEGER : SPH_ATTR_BIGINT; } /// list of constants class ConstList_c { public: CSphVector m_dInts; ///< dword/int64 storage CSphVector m_dFloats; ///< float storage ESphAttr m_eRetType; ///< SPH_ATTR_INTEGER, SPH_ATTR_BIGINT, or SPH_ATTR_FLOAT public: ConstList_c () : m_eRetType ( SPH_ATTR_INTEGER ) {} void Add ( int64_t iValue ) { if ( m_eRetType!=SPH_ATTR_FLOAT ) { m_eRetType = GetIntType ( iValue ); m_dInts.Add ( iValue ); } else { m_dFloats.Add ( (float)iValue ); } } void Add ( float fValue ) { if ( m_eRetType!=SPH_ATTR_FLOAT ) { assert ( m_dFloats.GetLength()==0 ); ARRAY_FOREACH ( i, m_dInts ) m_dFloats.Add ( (float)m_dInts[i] ); m_dInts.Reset (); m_eRetType = SPH_ATTR_FLOAT; } m_dFloats.Add ( fValue ); } }; /// expression tree node struct ExprNode_t { int m_iToken; ///< token type, including operators ESphAttr m_eRetType; ///< result type ESphAttr m_eArgType; ///< args type CSphAttrLocator m_tLocator; ///< attribute locator, for TOK_ATTR type int m_iLocator; ///< index of attribute locator in schema union { int64_t m_iConst; ///< constant value, for TOK_CONST_INT type float m_fConst; ///< constant value, for TOK_CONST_FLOAT type int m_iFunc; ///< built-in function id, for TOK_FUNC type int m_iArgs; ///< args count, for arglist (token==',') type ConstList_c * m_pConsts; ///< constants list, for TOK_CONST_LIST type }; int m_iLeft; int m_iRight; ExprNode_t () : m_iToken ( 0 ), m_eRetType ( SPH_ATTR_NONE ), m_eArgType ( SPH_ATTR_NONE ), m_iLocator ( -1 ), m_iLeft ( -1 ), m_iRight ( -1 ) {} float FloatVal() { assert ( m_iToken==TOK_CONST_INT || m_iToken==TOK_CONST_FLOAT ); return ( m_iToken==TOK_CONST_INT ) ? (float)m_iConst : m_fConst; } }; /// expression parser class ExprParser_t { friend int yylex ( YYSTYPE * lvalp, ExprParser_t * pParser ); friend int yyparse ( ExprParser_t * pParser ); friend void yyerror ( ExprParser_t * pParser, const char * sMessage ); public: ExprParser_t ( CSphSchema * pExtra, ISphExprHook * pHook ) : m_pExtra ( pExtra ) , m_pHook ( pHook ) {} ~ExprParser_t (); ISphExpr * Parse ( const char * sExpr, const CSphSchema & tSchema, ESphAttr * pAttrType, bool * pUsesWeight, CSphString & sError ); protected: int m_iParsed; ///< filled by yyparse() at the very end CSphString m_sLexerError; CSphString m_sParserError; CSphString m_sCreateError; ISphExprHook * m_pHook; protected: ESphAttr GetWidestRet ( int iLeft, int iRight ); int AddNodeInt ( int64_t iValue ); int AddNodeFloat ( float fValue ); int AddNodeString ( int64_t iValue ); int AddNodeAttr ( int iTokenType, uint64_t uAttrLocator ); int AddNodeID (); int AddNodeWeight (); int AddNodeOp ( int iOp, int iLeft, int iRight ); int AddNodeFunc ( int iFunc, int iLeft, int iRight=-1 ); int AddNodeUdf ( int iCall, int iArg ); int AddNodeConstlist ( int64_t iValue ); int AddNodeConstlist ( float iValue ); void AppendToConstlist ( int iNode, int64_t iValue ); void AppendToConstlist ( int iNode, float iValue ); int ConstlistFromUservar ( int iUservar ); int AddNodeHookIdent ( int iID ); int AddNodeHookFunc ( int iID, int iLeft ); private: const char * m_sExpr; const char * m_pCur; const char * m_pLastTokenStart; const CSphSchema * m_pSchema; CSphVector m_dNodes; CSphVector m_dUservars; CSphVector m_dUdfCalls; CSphSchema * m_pExtra; int m_iConstNow; private: int GetToken ( YYSTYPE * lvalp ); void GatherArgTypes ( int iNode, CSphVector & dTypes ); void GatherArgNodes ( int iNode, CSphVector & dNodes ); bool CheckForConstSet ( int iArgsNode, int iSkip ); int ParseAttr ( int iAttr, const char* sTok, YYSTYPE * lvalp ); template < typename T > void WalkTree ( int iRoot, T & FUNCTOR ); void Optimize ( int iNode ); void Dump ( int iNode ); ISphExpr * CreateTree ( int iNode ); ISphExpr * CreateIntervalNode ( int iArgsNode, CSphVector & dArgs ); ISphExpr * CreateInNode ( int iNode ); ISphExpr * CreateGeodistNode ( int iArgs ); ISphExpr * CreateBitdotNode ( int iArgsNode, CSphVector & dArgs ); ISphExpr * CreateUdfNode ( int iCall, ISphExpr * pLeft ); }; ////////////////////////////////////////////////////////////////////////// /// parse that numeric constant static int ParseNumeric ( YYSTYPE * lvalp, const char ** ppStr ) { assert ( lvalp && ppStr && *ppStr ); // try float route char * pEnd = NULL; float fRes = (float) strtod ( *ppStr, &pEnd ); // try int route int64_t iRes = 0; bool bInt = true; for ( const char * p=(*ppStr); piConst = iRes; return TOK_CONST_INT; } else { lvalp->fConst = fRes; return TOK_CONST_FLOAT; } } static uint64_t sphPackAttrLocator ( const CSphAttrLocator & tLoc, int iLocator ) { assert ( iLocator>=0 && iLocator<=0xff ); uint64_t uIndex = 0; uIndex = ( tLoc.m_iBitOffset<<16 ) + tLoc.m_iBitCount + ( (uint64_t)iLocator<<32 ); if ( tLoc.m_bDynamic ) uIndex |= ( U64C(1)<<63 ); return uIndex; } static void sphUnpackAttrLocator ( uint64_t uIndex, ExprNode_t * pNode ) { assert ( pNode ); pNode->m_tLocator.m_iBitOffset = (int)( ( uIndex>>16 ) & 0xffff ); pNode->m_tLocator.m_iBitCount = (int)( uIndex & 0xffff ); pNode->m_tLocator.m_bDynamic = ( ( uIndex & ( U64C(1)<<63 ) )!=0 ); pNode->m_iLocator = (int)( ( uIndex>>32 ) & 0xff ); } int ExprParser_t::ParseAttr ( int iAttr, const char* sTok, YYSTYPE * lvalp ) { // check attribute type and width const CSphColumnInfo & tCol = m_pSchema->GetAttr ( iAttr ); int iRes = -1; switch ( tCol.m_eAttrType ) { case SPH_ATTR_FLOAT: iRes = TOK_ATTR_FLOAT; break; case SPH_ATTR_UINT32SET: iRes = TOK_ATTR_MVA32; break; case SPH_ATTR_UINT64SET: iRes = TOK_ATTR_MVA64; break; case SPH_ATTR_STRING: iRes = TOK_ATTR_STRING; break; case SPH_ATTR_INTEGER: case SPH_ATTR_TIMESTAMP: case SPH_ATTR_BOOL: case SPH_ATTR_BIGINT: case SPH_ATTR_WORDCOUNT: iRes = tCol.m_tLocator.IsBitfield() ? TOK_ATTR_BITS : TOK_ATTR_INT; break; default: m_sLexerError.SetSprintf ( "attribute '%s' is of unsupported type (type=%d)", sTok, tCol.m_eAttrType ); return -1; } if ( m_pExtra ) m_pExtra->AddAttr ( tCol, true ); lvalp->iAttrLocator = sphPackAttrLocator ( tCol.m_tLocator, iAttr ); return iRes; } /// a lexer of my own /// returns token id and fills lvalp on success /// returns -1 and fills sError on failure int ExprParser_t::GetToken ( YYSTYPE * lvalp ) { // skip whitespace, check eof while ( isspace ( *m_pCur ) ) m_pCur++; m_pLastTokenStart = m_pCur; if ( !*m_pCur ) return 0; // check for constant if ( isdigit ( *m_pCur ) ) return ParseNumeric ( lvalp, &m_pCur ); // check for field, function, or magic name if ( sphIsAttr ( m_pCur[0] ) || ( m_pCur[0]=='@' && sphIsAttr ( m_pCur[1] ) && !isdigit ( m_pCur[1] ) ) ) { // get token const char * pStart = m_pCur++; while ( sphIsAttr ( *m_pCur ) ) m_pCur++; CSphString sTok; sTok.SetBinary ( pStart, m_pCur-pStart ); sTok.ToLower (); // check for magic name if ( sTok=="@id" ) return TOK_ATID; if ( sTok=="@weight" ) return TOK_ATWEIGHT; if ( sTok=="id" ) return TOK_ID; if ( sTok=="weight" ) return TOK_WEIGHT; if ( sTok=="distinct" ) return TOK_DISTINCT; if ( sTok=="@geodist" ) { int iGeodist = m_pSchema->GetAttrIndex("@geodist"); if ( iGeodist==-1 ) { m_sLexerError = "geoanchor is not set, @geodist expression unavailable"; return -1; } const CSphAttrLocator & tLoc = m_pSchema->GetAttr ( iGeodist ).m_tLocator; lvalp->iAttrLocator = sphPackAttrLocator ( tLoc, iGeodist ); return TOK_ATTR_FLOAT; } // check for uservar if ( pStart[0]=='@' ) { lvalp->iNode = m_dUservars.GetLength(); m_dUservars.Add ( sTok ); return TOK_USERVAR; } // check for keyword if ( sTok=="and" ) { return TOK_AND; } if ( sTok=="or" ) { return TOK_OR; } if ( sTok=="not" ) { return TOK_NOT; } if ( sTok=="div" ) { return TOK_DIV; } if ( sTok=="mod" ) { return TOK_MOD; } if ( sTok=="count" ) { int iAttr = m_pSchema->GetAttrIndex ( "count" ); if ( iAttr>=0 ) ParseAttr ( iAttr, sTok.cstr(), lvalp ); return TOK_COUNT; } // check for attribute int iAttr = m_pSchema->GetAttrIndex ( sTok.cstr() ); if ( iAttr>=0 ) return ParseAttr ( iAttr, sTok.cstr(), lvalp ); // check for function sTok.ToLower(); for ( int i=0; iiFunc = i; return g_dFuncs[i].m_eFunc==FUNC_IN ? TOK_FUNC_IN : TOK_FUNC; } // ask hook if ( m_pHook ) { int iID = m_pHook->IsKnownIdent ( sTok.cstr() ); if ( iID>=0 ) { lvalp->iNode = iID; return TOK_HOOK_IDENT; } iID = m_pHook->IsKnownFunc ( sTok.cstr() ); if ( iID>=0 ) { lvalp->iNode = iID; return TOK_HOOK_FUNC; } } // check for UDF if ( g_bUdfEnabled ) { g_tUdfMutex.Lock(); UdfFunc_t * pUdf = g_hUdfFuncs ( sTok ); if ( pUdf ) { if ( pUdf->m_bToDrop ) pUdf = NULL; // DROP in progress, can not use else pUdf->m_iUserCount++; // protection against concurrent DROP (decrements in ~UdfCall_t()) g_tUdfMutex.Unlock(); lvalp->iNode = m_dUdfCalls.GetLength(); m_dUdfCalls.Add ( new UdfCall_t() ); m_dUdfCalls.Last()->m_pUdf = pUdf; return TOK_UDF; } g_tUdfMutex.Unlock(); } m_sLexerError.SetSprintf ( "unknown identifier '%s' (not an attribute, not a function)", sTok.cstr() ); return -1; } // check for known operators, then switch ( *m_pCur ) { case '+': case '-': case '*': case '/': case '(': case ')': case ',': case '&': case '|': case '%': return *m_pCur++; case '<': m_pCur++; if ( *m_pCur=='>' ) { m_pCur++; return TOK_NE; } if ( *m_pCur=='=' ) { m_pCur++; return TOK_LTE; } return '<'; case '>': m_pCur++; if ( *m_pCur=='=' ) { m_pCur++; return TOK_GTE; } return '>'; case '=': m_pCur++; if ( *m_pCur=='=' ) m_pCur++; return TOK_EQ; // special case for float values without leading zero case '.': { char * pEnd = NULL; lvalp->fConst = (float) strtod ( m_pCur, &pEnd ); if ( pEnd ) { m_pCur = pEnd; return TOK_CONST_FLOAT; } break; } case '\'': case '"': { const char cEnd = *m_pCur; for ( const char * s = m_pCur+1; *s; s++ ) { if ( *s==cEnd ) { int iBeg = (int)( m_pCur-m_sExpr ); int iLen = (int)( s-m_sExpr ) - iBeg + 1; lvalp->iConst = ( int64_t(iBeg)<<32 ) + iLen; m_pCur = s+1; return TOK_CONST_STRING; } else if ( *s=='\\' ) { s++; if ( !*s ) break; } } m_sLexerError.SetSprintf ( "unterminated string constant near '%s'", m_pCur ); return -1; } } m_sLexerError.SetSprintf ( "unknown operator '%c' near '%s'", *m_pCur, m_pCur ); return -1; } /// is add/sub? static inline bool IsAddSub ( const ExprNode_t * pNode ) { return pNode->m_iToken=='+' || pNode->m_iToken=='-'; } /// is arithmetic? static inline bool IsAri ( const ExprNode_t * pNode ) { int iTok = pNode->m_iToken; return iTok=='+' || iTok=='-' || iTok=='*' || iTok=='/'; } /// is constant? static inline bool IsConst ( const ExprNode_t * pNode ) { return pNode->m_iToken==TOK_CONST_INT || pNode->m_iToken==TOK_CONST_FLOAT; } /// float value of a constant static inline float FloatVal ( const ExprNode_t * pNode ) { assert ( IsConst(pNode) ); return pNode->m_iToken==TOK_CONST_INT ? (float)pNode->m_iConst : pNode->m_fConst; } /// optimize subtree void ExprParser_t::Optimize ( int iNode ) { if ( iNode<0 ) return; Optimize ( m_dNodes[iNode].m_iLeft ); Optimize ( m_dNodes[iNode].m_iRight ); ExprNode_t * pRoot = &m_dNodes[iNode]; ExprNode_t * pLeft = ( pRoot->m_iLeft>=0 ) ? &m_dNodes[pRoot->m_iLeft] : NULL; ExprNode_t * pRight = ( pRoot->m_iRight>=0 ) ? &m_dNodes[pRoot->m_iRight] : NULL; // arithmetic expression with constants if ( IsAri(pRoot) ) { // optimize fully-constant expressions if ( IsConst(pLeft) && IsConst(pRight) ) { if ( pLeft->m_iToken==TOK_CONST_INT && pRight->m_iToken==TOK_CONST_INT && pRoot->m_iToken!='/' ) { switch ( pRoot->m_iToken ) { case '+': pRoot->m_iConst = pLeft->m_iConst + pRight->m_iConst; break; case '-': pRoot->m_iConst = pLeft->m_iConst - pRight->m_iConst; break; case '*': pRoot->m_iConst = pLeft->m_iConst * pRight->m_iConst; break; default: assert ( 0 && "internal error: unhandled arithmetic token during const-int optimization" ); } pRoot->m_iToken = TOK_CONST_INT; } else { float fLeft = FloatVal(pLeft); float fRight = FloatVal(pRight); switch ( pRoot->m_iToken ) { case '+': pRoot->m_fConst = fLeft + fRight; break; case '-': pRoot->m_fConst = fLeft - fRight; break; case '*': pRoot->m_fConst = fLeft * fRight; break; case '/': pRoot->m_fConst = fLeft / fRight; break; default: assert ( 0 && "internal error: unhandled arithmetic token during const-float optimization" ); } pRoot->m_iToken = TOK_CONST_FLOAT; } return; } // canonize (expr op const), move const to the left if ( IsConst(pRight) ) { assert ( !IsConst(pLeft) ); Swap ( pRoot->m_iLeft, pRoot->m_iRight ); Swap ( pLeft, pRight ); // fixup (expr-const) to ((-const)+expr) if ( pRoot->m_iToken=='-' ) { pRoot->m_iToken = '+'; if ( pLeft->m_iToken==TOK_CONST_INT ) pLeft->m_iConst *= -1; else pLeft->m_fConst *= -1; } // fixup (expr/const) to ((1/const)*expr) if ( pRoot->m_iToken=='/' ) { pRoot->m_iToken = '*'; pLeft->m_fConst = 1.0f / FloatVal(pLeft); pLeft->m_iToken = TOK_CONST_FLOAT; } } // optimize compatible operations with constants if ( IsConst(pLeft) && IsAri(pRight) && IsAddSub(pRoot)==IsAddSub(pRight) && IsConst ( &m_dNodes[pRight->m_iLeft] ) ) { ExprNode_t * pConst = &m_dNodes[pRight->m_iLeft]; ExprNode_t * pExpr = &m_dNodes[pRight->m_iRight]; assert ( !IsConst(pExpr) ); // must had been optimized // optimize (left op (const op2 expr)) to ((left op const) op*op2 expr) if ( IsAddSub(pRoot) ) { // fold consts int iSign = ( ( pRoot->m_iToken=='+' ) ? 1 : -1 ); if ( pLeft->m_iToken==TOK_CONST_INT && pConst->m_iToken==TOK_CONST_INT ) { pLeft->m_iConst += iSign*pConst->m_iConst; } else { pLeft->m_fConst = FloatVal(pLeft) + iSign*FloatVal(pConst); pLeft->m_iToken = TOK_CONST_FLOAT; } // fold ops pRoot->m_iToken = ( pRoot->m_iToken==pRight->m_iToken ) ? '+' : '-'; } else { // fols consts if ( pRoot->m_iToken=='*' && pLeft->m_iToken==TOK_CONST_INT && pConst->m_iToken==TOK_CONST_INT ) { pLeft->m_iConst *= pConst->m_iConst; } else { if ( pRoot->m_iToken=='*' ) pLeft->m_fConst = FloatVal(pLeft) * FloatVal(pConst); else pLeft->m_fConst = FloatVal(pLeft) / FloatVal(pConst); pLeft->m_iToken = TOK_CONST_FLOAT; } // fold ops pRoot->m_iToken = ( pRoot->m_iToken==pRight->m_iToken ) ? '*' : '/'; } // promote expr arg pRoot->m_iRight = pRight->m_iRight; pRight = pExpr; } // promote children constants if ( IsAri(pLeft) && IsAddSub(pLeft)==IsAddSub(pRoot) && IsConst ( &m_dNodes[pLeft->m_iLeft] ) ) { // ((const op lr) op2 right) gets replaced with (const op (lr op2/op right)) // constant gets promoted one level up int iConst = pLeft->m_iLeft; pLeft->m_iLeft = pLeft->m_iRight; pLeft->m_iRight = pRoot->m_iRight; // (c op lr) -> (lr ... r) switch ( pLeft->m_iToken ) { case '+': case '*': // (c + lr) op r -> c + (lr op r) // (c * lr) op r -> c * (lr op r) Swap ( pLeft->m_iToken, pRoot->m_iToken ); break; case '-': // (c - lr) + r -> c - (lr - r) // (c - lr) - r -> c - (lr + r) pLeft->m_iToken = ( pRoot->m_iToken=='+' ? '-' : '+' ); pRoot->m_iToken = '-'; break; case '/': // (c / lr) * r -> c * (r / lr) // (c / lr) / r -> c / (r * lr) Swap ( pLeft->m_iLeft, pLeft->m_iRight ); pLeft->m_iToken = ( pRoot->m_iToken=='*' ) ? '/' : '*'; break; default: assert ( 0 && "internal error: unhandled op in left-const promotion" ); } pRoot->m_iRight = pRoot->m_iLeft; pRoot->m_iLeft = iConst; pLeft = &m_dNodes[pRoot->m_iLeft]; pRight = &m_dNodes[pRoot->m_iRight]; } } // madd, mul3 // FIXME! separate pass for these? otherwise (2+(a*b))+3 won't get const folding if ( ( pRoot->m_iToken=='+' || pRoot->m_iToken=='*' ) && ( pLeft->m_iToken=='*' || pRight->m_iToken=='*' ) ) { if ( pLeft->m_iToken!='*' ) { Swap ( pRoot->m_iLeft, pRoot->m_iRight ); Swap ( pLeft, pRight ); } pLeft->m_iToken = ','; int iLeft = pRoot->m_iLeft; int iRight = pRoot->m_iRight; pRoot->m_iFunc = ( pRoot->m_iToken=='+' ) ? FUNC_MADD : FUNC_MUL3; pRoot->m_iToken = TOK_FUNC; pRoot->m_iLeft = m_dNodes.GetLength(); pRoot->m_iRight = -1; assert ( g_dFuncs[pRoot->m_iFunc].m_eFunc==pRoot->m_iFunc ); ExprNode_t & tArgs = m_dNodes.Add(); // invalidates all pointers! tArgs.m_iToken = ','; tArgs.m_iLeft = iLeft; tArgs.m_iRight = iRight; return; } // division by a constant (replace with multiplication by inverse) if ( pRoot->m_iToken=='/' && pRight->m_iToken==TOK_CONST_FLOAT ) { pRight->m_fConst = 1.0f / pRight->m_fConst; pRoot->m_iToken = '*'; return; } // unary function from a constant if ( pRoot->m_iToken==TOK_FUNC && g_dFuncs[pRoot->m_iFunc].m_iArgs==1 && IsConst(pLeft) ) { float fArg = pLeft->m_iToken==TOK_CONST_FLOAT ? pLeft->m_fConst : float(pLeft->m_iConst); switch ( g_dFuncs[pRoot->m_iFunc].m_eFunc ) { case FUNC_ABS: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = fabs(fArg); break; case FUNC_CEIL: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(ceil(fArg)); break; case FUNC_FLOOR: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(floor(fArg)); break; case FUNC_SIN: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(sin(fArg)); break; case FUNC_COS: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(cos(fArg)); break; case FUNC_LN: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(log(fArg)); break; case FUNC_LOG2: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(log(fArg)*M_LOG2E); break; case FUNC_LOG10: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(log(fArg)*M_LOG10E); break; case FUNC_EXP: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(exp(fArg)); break; case FUNC_SQRT: pRoot->m_iToken = TOK_CONST_FLOAT; pRoot->m_fConst = float(sqrt(fArg)); break; default: break; } return; } // constant function (such as NOW()) if ( pRoot->m_iToken==TOK_FUNC && pRoot->m_iFunc==FUNC_NOW ) { pRoot->m_iToken = TOK_CONST_INT; pRoot->m_iConst = m_iConstNow; return; } // SINT(int-attr) if ( pRoot->m_iToken==TOK_FUNC && pRoot->m_iFunc==FUNC_SINT && ( pLeft->m_iToken==TOK_ATTR_INT || pLeft->m_iToken==TOK_ATTR_BITS ) ) { pRoot->m_iToken = TOK_ATTR_SINT; pRoot->m_tLocator = pLeft->m_tLocator; } } // debug dump void ExprParser_t::Dump ( int iNode ) { if ( iNode<0 ) return; ExprNode_t & tNode = m_dNodes[iNode]; switch ( tNode.m_iToken ) { case TOK_CONST_INT: printf ( INT64_FMT, tNode.m_iConst ); break; case TOK_CONST_FLOAT: printf ( "%f", tNode.m_fConst ); break; case TOK_ATTR_INT: case TOK_ATTR_SINT: printf ( "row[%d]", tNode.m_tLocator.m_iBitOffset/32 ); break; default: printf ( "(" ); Dump ( tNode.m_iLeft ); printf ( ( tNode.m_iToken<256 ) ? " %c " : " op-%d ", tNode.m_iToken ); Dump ( tNode.m_iRight ); printf ( ")" ); break; } } /// fold arglist into array static void FoldArglist ( ISphExpr * pLeft, CSphVector & dArgs ) { if ( !pLeft || !pLeft->IsArglist() ) { dArgs.Add ( pLeft ); return; } Expr_Arglist_c * pArgs = dynamic_cast ( pLeft ); assert ( pLeft ); Swap ( dArgs, pArgs->m_dArgs ); SafeRelease ( pLeft ); } typedef sphinx_int64_t ( *UdfInt_fn ) ( SPH_UDF_INIT *, SPH_UDF_ARGS *, char * ); typedef double ( *UdfDouble_fn ) ( SPH_UDF_INIT *, SPH_UDF_ARGS *, char * ); class Expr_Udf_c : public ISphExpr { public: CSphVector m_dArgs; protected: UdfCall_t * m_pCall; mutable CSphVector m_dArgvals; mutable char m_bError; public: explicit Expr_Udf_c ( UdfCall_t * pCall ) : m_pCall ( pCall ) , m_bError ( 0 ) { SPH_UDF_ARGS & tArgs = m_pCall->m_tArgs; assert ( tArgs.arg_values==NULL ); tArgs.arg_values = new char * [ tArgs.arg_count ]; tArgs.str_lengths = new int [ tArgs.arg_count ]; m_dArgvals.Resize ( tArgs.arg_count ); ARRAY_FOREACH ( i, m_dArgvals ) tArgs.arg_values[i] = (char*) &m_dArgvals[i]; } ~Expr_Udf_c () { if ( m_pCall->m_pUdf->m_fnDeinit ) m_pCall->m_pUdf->m_fnDeinit ( &m_pCall->m_tInit ); SafeDeleteArray ( m_pCall->m_tArgs.arg_names ); SafeDeleteArray ( m_pCall->m_tArgs.arg_types ); SafeDeleteArray ( m_pCall->m_tArgs.arg_values ); SafeDeleteArray ( m_pCall->m_tArgs.str_lengths ); SafeDelete ( m_pCall ); ARRAY_FOREACH ( i, m_dArgs ) SafeRelease ( m_dArgs[i] ); } void FillArgs ( const CSphMatch & tMatch ) const { // FIXME? a cleaner way to reinterpret? SPH_UDF_ARGS & tArgs = m_pCall->m_tArgs; ARRAY_FOREACH ( i, m_dArgs ) { switch ( tArgs.arg_types[i] ) { case SPH_UDF_TYPE_UINT32: *(DWORD*)&m_dArgvals[i] = m_dArgs[i]->IntEval ( tMatch ); break; case SPH_UDF_TYPE_INT64: m_dArgvals[i] = m_dArgs[i]->Int64Eval ( tMatch ); break; case SPH_UDF_TYPE_FLOAT: *(float*)&m_dArgvals[i] = m_dArgs[i]->Eval ( tMatch ); break; case SPH_UDF_TYPE_STRING: tArgs.str_lengths[i] = m_dArgs[i]->StringEval ( tMatch, (const BYTE**)&tArgs.arg_values[i] ); break; case SPH_UDF_TYPE_UINT32SET: tArgs.arg_values[i] = (char*) m_dArgs[i]->MvaEval ( tMatch ); break; default: assert ( 0 ); m_dArgvals[i] = 0; break; } } } virtual void SetMVAPool ( const DWORD * pPool ) { ARRAY_FOREACH ( i, m_dArgs ) m_dArgs[i]->SetMVAPool ( pPool ); } virtual void SetStringPool ( const BYTE * pPool ) { ARRAY_FOREACH ( i, m_dArgs ) m_dArgs[i]->SetStringPool ( pPool ); } virtual void GetDependencyColumns ( CSphVector & dDeps ) const { ARRAY_FOREACH ( i, m_dArgs ) m_dArgs[i]->GetDependencyColumns ( dDeps ); } }; class Expr_UdfInt_c : public Expr_Udf_c { public: explicit Expr_UdfInt_c ( UdfCall_t * pCall ) : Expr_Udf_c ( pCall ) { assert ( pCall->m_pUdf->m_eRetType==SPH_ATTR_INTEGER || pCall->m_pUdf->m_eRetType==SPH_ATTR_BIGINT ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { if ( m_bError ) return 0; FillArgs ( tMatch ); UdfInt_fn pFn = (UdfInt_fn) m_pCall->m_pUdf->m_fnFunc; return (int) pFn ( &m_pCall->m_tInit, &m_pCall->m_tArgs, &m_bError ); } virtual int IntEval ( const CSphMatch & tMatch ) const { return (int) Int64Eval ( tMatch ); } virtual float Eval ( const CSphMatch & tMatch ) const { return (float) Int64Eval ( tMatch ); } }; class Expr_UdfFloat_c : public Expr_Udf_c { public: explicit Expr_UdfFloat_c ( UdfCall_t * pCall ) : Expr_Udf_c ( pCall ) { assert ( pCall->m_pUdf->m_eRetType==SPH_ATTR_FLOAT ); } virtual float Eval ( const CSphMatch & tMatch ) const { if ( m_bError ) return 0; FillArgs ( tMatch ); UdfDouble_fn pFn = (UdfDouble_fn) m_pCall->m_pUdf->m_fnFunc; return (float) pFn ( &m_pCall->m_tInit, &m_pCall->m_tArgs, &m_bError ); } virtual int IntEval ( const CSphMatch & tMatch ) const { return (int) Eval ( tMatch ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return (int64_t) Eval ( tMatch ); } }; ISphExpr * ExprParser_t::CreateUdfNode ( int iCall, ISphExpr * pLeft ) { Expr_Udf_c * pRes = NULL; switch ( m_dUdfCalls[iCall]->m_pUdf->m_eRetType ) { case SPH_ATTR_INTEGER: case SPH_ATTR_BIGINT: pRes = new Expr_UdfInt_c ( m_dUdfCalls[iCall] ); break; case SPH_ATTR_FLOAT: pRes = new Expr_UdfFloat_c ( m_dUdfCalls[iCall] ); break; default: m_sParserError.SetSprintf ( "internal error: unhandled type %d in CreateUdfNode()", m_dUdfCalls[iCall]->m_pUdf->m_eRetType ); break; } if ( pRes ) { if ( pLeft ) FoldArglist ( pLeft, pRes->m_dArgs ); m_dUdfCalls[iCall] = NULL; // evaluator owns it now } return pRes; } /// fold nodes subtree into opcodes ISphExpr * ExprParser_t::CreateTree ( int iNode ) { if ( iNode<0 ) return NULL; const ExprNode_t & tNode = m_dNodes[iNode]; // avoid spawning argument node in some cases bool bSkipLeft = false; bool bSkipRight = false; if ( tNode.m_iToken==TOK_FUNC ) { Func_e eFunc = g_dFuncs[tNode.m_iFunc].m_eFunc; if ( eFunc==FUNC_GEODIST || eFunc==FUNC_IN ) bSkipLeft = true; if ( eFunc==FUNC_IN ) bSkipRight = true; } ISphExpr * pLeft = bSkipLeft ? NULL : CreateTree ( tNode.m_iLeft ); ISphExpr * pRight = bSkipRight ? NULL : CreateTree ( tNode.m_iRight ); #define LOC_SPAWN_POLY(_classname) \ if ( tNode.m_eArgType==SPH_ATTR_INTEGER ) return new _classname##Int_c ( pLeft, pRight ); \ else if ( tNode.m_eArgType==SPH_ATTR_BIGINT ) return new _classname##Int64_c ( pLeft, pRight ); \ else return new _classname##Float_c ( pLeft, pRight ); switch ( tNode.m_iToken ) { case TOK_ATTR_INT: return new Expr_GetInt_c ( tNode.m_tLocator, tNode.m_iLocator ); case TOK_ATTR_BITS: return new Expr_GetBits_c ( tNode.m_tLocator, tNode.m_iLocator ); case TOK_ATTR_FLOAT: return new Expr_GetFloat_c ( tNode.m_tLocator, tNode.m_iLocator ); case TOK_ATTR_SINT: return new Expr_GetSint_c ( tNode.m_tLocator, tNode.m_iLocator ); case TOK_ATTR_STRING: return new Expr_GetString_c ( tNode.m_tLocator, tNode.m_iLocator ); case TOK_ATTR_MVA64: case TOK_ATTR_MVA32: return new Expr_GetMva_c ( tNode.m_tLocator, tNode.m_iLocator ); case TOK_CONST_FLOAT: return new Expr_GetConst_c ( tNode.m_fConst ); case TOK_CONST_INT: if ( tNode.m_eRetType==SPH_ATTR_INTEGER ) return new Expr_GetIntConst_c ( (int)tNode.m_iConst ); else if ( tNode.m_eRetType==SPH_ATTR_BIGINT ) return new Expr_GetInt64Const_c ( tNode.m_iConst ); else return new Expr_GetConst_c ( float(tNode.m_iConst) ); break; case TOK_CONST_STRING: return new Expr_GetStrConst_c ( m_sExpr+(int)( tNode.m_iConst>>32 ), (int)( tNode.m_iConst & 0xffffffffUL ) ); case TOK_ID: return new Expr_GetId_c (); case TOK_WEIGHT: return new Expr_GetWeight_c (); case '+': return new Expr_Add_c ( pLeft, pRight ); break; case '-': return new Expr_Sub_c ( pLeft, pRight ); break; case '*': return new Expr_Mul_c ( pLeft, pRight ); break; case '/': return new Expr_Div_c ( pLeft, pRight ); break; case '&': return new Expr_BitAnd_c ( pLeft, pRight ); break; case '|': return new Expr_BitOr_c ( pLeft, pRight ); break; case '%': return new Expr_Mod_c ( pLeft, pRight ); break; case '<': LOC_SPAWN_POLY ( Expr_Lt ); break; case '>': LOC_SPAWN_POLY ( Expr_Gt ); break; case TOK_LTE: LOC_SPAWN_POLY ( Expr_Lte ); break; case TOK_GTE: LOC_SPAWN_POLY ( Expr_Gte ); break; case TOK_EQ: LOC_SPAWN_POLY ( Expr_Eq ); break; case TOK_NE: LOC_SPAWN_POLY ( Expr_Ne ); break; case TOK_AND: LOC_SPAWN_POLY ( Expr_And ); break; case TOK_OR: LOC_SPAWN_POLY ( Expr_Or ); break; case TOK_NOT: if ( tNode.m_eArgType==SPH_ATTR_BIGINT ) return new Expr_NotInt64_c ( pLeft ); else return new Expr_NotInt_c ( pLeft ); break; case ',': return new Expr_Arglist_c ( pLeft, pRight ); break; case TOK_NEG: assert ( pRight==NULL ); return new Expr_Neg_c ( pLeft ); break; case TOK_FUNC: { // fold arglist to array Func_e eFunc = g_dFuncs[tNode.m_iFunc].m_eFunc; CSphVector dArgs; if ( !bSkipLeft ) FoldArglist ( pLeft, dArgs ); // spawn proper function assert ( tNode.m_iFunc>=0 && tNode.m_iFunc=0 && g_dFuncs[tNode.m_iFunc].m_iArgs==dArgs.GetLength() ) || // arg count matches, ( g_dFuncs[tNode.m_iFunc].m_iArgs<0 && -g_dFuncs[tNode.m_iFunc].m_iArgs<=dArgs.GetLength() ) ); // or min vararg count reached switch ( eFunc ) { case FUNC_NOW: assert ( 0 ); break; // prevent gcc bitching case FUNC_ABS: return new Expr_Abs_c ( dArgs[0] ); case FUNC_CEIL: return new Expr_Ceil_c ( dArgs[0] ); case FUNC_FLOOR: return new Expr_Floor_c ( dArgs[0] ); case FUNC_SIN: return new Expr_Sin_c ( dArgs[0] ); case FUNC_COS: return new Expr_Cos_c ( dArgs[0] ); case FUNC_LN: return new Expr_Ln_c ( dArgs[0] ); case FUNC_LOG2: return new Expr_Log2_c ( dArgs[0] ); case FUNC_LOG10: return new Expr_Log10_c ( dArgs[0] ); case FUNC_EXP: return new Expr_Exp_c ( dArgs[0] ); case FUNC_SQRT: return new Expr_Sqrt_c ( dArgs[0] ); case FUNC_BIGINT: return dArgs[0]; case FUNC_SINT: return new Expr_Sint_c ( dArgs[0] ); case FUNC_CRC32: return new Expr_Crc32_c ( dArgs[0] ); case FUNC_DAY: return new Expr_Day_c ( dArgs[0] ); case FUNC_MONTH: return new Expr_Month_c ( dArgs[0] ); case FUNC_YEAR: return new Expr_Year_c ( dArgs[0] ); case FUNC_YEARMONTH: return new Expr_YearMonth_c ( dArgs[0] ); case FUNC_YEARMONTHDAY: return new Expr_YearMonthDay_c ( dArgs[0] ); case FUNC_MIN: return new Expr_Min_c ( dArgs[0], dArgs[1] ); case FUNC_MAX: return new Expr_Max_c ( dArgs[0], dArgs[1] ); case FUNC_POW: return new Expr_Pow_c ( dArgs[0], dArgs[1] ); case FUNC_IDIV: return new Expr_Idiv_c ( dArgs[0], dArgs[1] ); case FUNC_IF: return new Expr_If_c ( dArgs[0], dArgs[1], dArgs[2] ); case FUNC_MADD: return new Expr_Madd_c ( dArgs[0], dArgs[1], dArgs[2] ); case FUNC_MUL3: return new Expr_Mul3_c ( dArgs[0], dArgs[1], dArgs[2] ); case FUNC_INTERVAL: return CreateIntervalNode ( tNode.m_iLeft, dArgs ); case FUNC_IN: return CreateInNode ( iNode ); case FUNC_BITDOT: return CreateBitdotNode ( tNode.m_iLeft, dArgs ); case FUNC_GEODIST: return CreateGeodistNode ( tNode.m_iLeft ); } assert ( 0 && "unhandled function id" ); break; } case TOK_UDF: return CreateUdfNode ( tNode.m_iFunc, pLeft ); break; case TOK_HOOK_IDENT: return m_pHook->CreateNode ( tNode.m_iFunc, NULL ); break; case TOK_HOOK_FUNC: return m_pHook->CreateNode ( tNode.m_iFunc, pLeft ); break; default: assert ( 0 && "unhandled token type" ); break; } #undef LOC_SPAWN_POLY // fire exit SafeRelease ( pLeft ); SafeRelease ( pRight ); return NULL; } ////////////////////////////////////////////////////////////////////////// /// arg-vs-set function (currently, IN or INTERVAL) evaluator traits template < typename T > class Expr_ArgVsSet_c : public ISphExpr { protected: ISphExpr * m_pArg; public: explicit Expr_ArgVsSet_c ( ISphExpr * pArg ) : m_pArg ( pArg ) {} ~Expr_ArgVsSet_c () { SafeRelease ( m_pArg ); } virtual int IntEval ( const CSphMatch & tMatch ) const = 0; virtual float Eval ( const CSphMatch & tMatch ) const { return (float) IntEval ( tMatch ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return IntEval ( tMatch ); } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { assert ( m_pArg ); m_pArg->GetDependencyColumns ( dColumns ); } protected: T ExprEval ( ISphExpr * pArg, const CSphMatch & tMatch ) const; }; template<> int Expr_ArgVsSet_c::ExprEval ( ISphExpr * pArg, const CSphMatch & tMatch ) const { return pArg->IntEval ( tMatch ); } template<> DWORD Expr_ArgVsSet_c::ExprEval ( ISphExpr * pArg, const CSphMatch & tMatch ) const { return (DWORD)pArg->IntEval ( tMatch ); } template<> float Expr_ArgVsSet_c::ExprEval ( ISphExpr * pArg, const CSphMatch & tMatch ) const { return pArg->Eval ( tMatch ); } template<> int64_t Expr_ArgVsSet_c::ExprEval ( ISphExpr * pArg, const CSphMatch & tMatch ) const { return pArg->Int64Eval ( tMatch ); } /// arg-vs-constant-set template < typename T > class Expr_ArgVsConstSet_c : public Expr_ArgVsSet_c { protected: CSphVector m_dValues; public: /// take ownership of arg, pre-evaluate and dismiss turn points Expr_ArgVsConstSet_c ( ISphExpr * pArg, CSphVector & dArgs, int iSkip ) : Expr_ArgVsSet_c ( pArg ) { CSphMatch tDummy; for ( int i=iSkip; i::ExprEval ( dArgs[i], tDummy ) ); SafeRelease ( dArgs[i] ); } } /// take ownership of arg, and copy that constlist Expr_ArgVsConstSet_c ( ISphExpr * pArg, ConstList_c * pConsts ) : Expr_ArgVsSet_c ( pArg ) { if ( pConsts->m_eRetType==SPH_ATTR_FLOAT ) { m_dValues.Reserve ( pConsts->m_dFloats.GetLength() ); ARRAY_FOREACH ( i, pConsts->m_dFloats ) m_dValues.Add ( (T)pConsts->m_dFloats[i] ); } else { m_dValues.Reserve ( pConsts->m_dInts.GetLength() ); ARRAY_FOREACH ( i, pConsts->m_dInts ) m_dValues.Add ( (T)pConsts->m_dInts[i] ); } } }; ////////////////////////////////////////////////////////////////////////// /// INTERVAL() evaluator for constant turn point values case template < typename T > class Expr_IntervalConst_c : public Expr_ArgVsConstSet_c { public: /// take ownership of arg, pre-evaluate and dismiss turn points explicit Expr_IntervalConst_c ( CSphVector & dArgs ) : Expr_ArgVsConstSet_c ( dArgs[0], dArgs, 1 ) {} /// evaluate arg, return interval id virtual int IntEval ( const CSphMatch & tMatch ) const { T val = ExprEval ( this->m_pArg, tMatch ); // 'this' fixes gcc braindamage ARRAY_FOREACH ( i, this->m_dValues ) // FIXME! OPTIMIZE! perform binary search here if ( valm_dValues[i] ) return i; return this->m_dValues.GetLength(); } virtual void SetMVAPool ( const DWORD * pMvaPool ) { this->m_pArg->SetMVAPool ( pMvaPool ); } virtual void SetStringPool ( const BYTE * pStrings ) { this->m_pArg->SetStringPool ( pStrings ); } }; /// generic INTERVAL() evaluator template < typename T > class Expr_Interval_c : public Expr_ArgVsSet_c { protected: CSphVector m_dTurnPoints; public: /// take ownership of arg and turn points explicit Expr_Interval_c ( const CSphVector & dArgs ) : Expr_ArgVsSet_c ( dArgs[0] ) { for ( int i=1; im_pArg, tMatch ); // 'this' fixes gcc braindamage ARRAY_FOREACH ( i, m_dTurnPoints ) if ( val < Expr_ArgVsSet_c::ExprEval ( m_dTurnPoints[i], tMatch ) ) return i; return m_dTurnPoints.GetLength(); } virtual void SetMVAPool ( const DWORD * pMvaPool ) { this->m_pArg->SetMVAPool ( pMvaPool ); ARRAY_FOREACH ( i, m_dTurnPoints ) m_dTurnPoints[i]->SetMVAPool ( pMvaPool ); } virtual void SetStringPool ( const BYTE * pStrings ) { this->m_pArg->SetStringPool ( pStrings ); ARRAY_FOREACH ( i, m_dTurnPoints ) m_dTurnPoints[i]->SetStringPool ( pStrings ); } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { Expr_ArgVsSet_c::GetDependencyColumns ( dColumns ); ARRAY_FOREACH ( i, m_dTurnPoints ) m_dTurnPoints[i]->GetDependencyColumns ( dColumns ); } }; ////////////////////////////////////////////////////////////////////////// /// IN() evaluator, arbitrary scalar expression vs. constant values template < typename T > class Expr_In_c : public Expr_ArgVsConstSet_c { public: /// pre-sort values for binary search Expr_In_c ( ISphExpr * pArg, ConstList_c * pConsts ) : Expr_ArgVsConstSet_c ( pArg, pConsts ) { this->m_dValues.Sort(); } /// evaluate arg, check if the value is within set virtual int IntEval ( const CSphMatch & tMatch ) const { T val = ExprEval ( this->m_pArg, tMatch ); // 'this' fixes gcc braindamage return this->m_dValues.BinarySearch ( val )!=NULL; } virtual void SetMVAPool ( const DWORD * pMvaPool ) { this->m_pArg->SetMVAPool ( pMvaPool ); } virtual void SetStringPool ( const BYTE * pStrings ) { this->m_pArg->SetStringPool ( pStrings ); } }; /// IN() evaluator, MVA attribute vs. constant values template < bool IS_MVA64 > class Expr_MVAIn_c : public Expr_ArgVsConstSet_c { public: /// pre-sort values for binary search Expr_MVAIn_c ( const CSphAttrLocator & tLoc, int iLocator, ConstList_c * pConsts ) : Expr_ArgVsConstSet_c ( NULL, pConsts ) , m_tLocator ( tLoc ) , m_iLocator ( iLocator ) , m_pMvaPool ( NULL ) { assert ( tLoc.m_iBitOffset>=0 && tLoc.m_iBitCount>0 ); this->m_dValues.Sort(); } int MvaEval ( const DWORD * pMva ) const; /// evaluate arg, check if any values are within set virtual int IntEval ( const CSphMatch & tMatch ) const { const DWORD * pMva = tMatch.GetAttrMVA ( m_tLocator, m_pMvaPool ); if ( !pMva ) return 0; return MvaEval ( pMva ); } virtual void SetMVAPool ( const DWORD * pMvaPool ) { m_pMvaPool = pMvaPool; // finally, some real setup work!!! } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { dColumns.Add ( m_iLocator ); } protected: CSphAttrLocator m_tLocator; int m_iLocator; const DWORD * m_pMvaPool; }; template<> int Expr_MVAIn_c::MvaEval ( const DWORD * pMva ) const { // OPTIMIZE! FIXME! factor out a common function with Filter_MVAValues::Eval() DWORD uLen = *pMva++; const DWORD * pMvaMax = pMva+uLen; const DWORD * pFilter = m_dValues.Begin(); const DWORD * pFilterMax = pFilter + m_dValues.GetLength(); const DWORD * L = pMva; const DWORD * R = pMvaMax - 1; for ( ; pFilter < pFilterMax; pFilter++ ) { while ( L<=R ) { const DWORD * m = L + (R - L) / 2; if ( *pFilter > *m ) L = m + 1; else if ( *pFilter < *m ) R = m - 1; else return 1; } R = pMvaMax - 1; } return 0; } template<> int Expr_MVAIn_c::MvaEval ( const DWORD * pMva ) const { // OPTIMIZE! FIXME! factor out a common function with Filter_MVAValues::Eval() DWORD uLen = *pMva++; assert ( ( uLen%2 )==0 ); const DWORD * pMvaMax = pMva+uLen; const DWORD * pFilter = m_dValues.Begin(); const DWORD * pFilterMax = pFilter + m_dValues.GetLength(); const uint64_t * L = (const uint64_t *)pMva; const uint64_t * R = (const uint64_t *)( pMvaMax - 2 ); for ( ; pFilter < pFilterMax; pFilter++ ) { while ( L<=R ) { const uint64_t * pVal = L + (R - L) / 2; uint64_t uMva = MVA_UPSIZE ( (const DWORD *)pVal ); if ( *pFilter > uMva ) L = pVal + 1; else if ( *pFilter < uMva ) R = pVal - 1; else return 1; } R = (const uint64_t *) ( pMvaMax - 2 ); } return 0; } ////////////////////////////////////////////////////////////////////////// /// generic BITDOT() evaluator template < typename T > class Expr_Bitdot_c : public Expr_ArgVsSet_c { protected: CSphVector m_dBitWeights; public: /// take ownership of arg and turn points explicit Expr_Bitdot_c ( const CSphVector & dArgs ) : Expr_ArgVsSet_c ( dArgs[0] ) { for ( int i=1; im_pArg->Int64Eval ( tMatch ); // 'this' fixes gcc braindamage T tRes = 0; int iBit = 0; while ( uArg && iBit::ExprEval ( m_dBitWeights[iBit], tMatch ); uArg >>= 1; iBit++; } return tRes; } public: virtual float Eval ( const CSphMatch & tMatch ) const { return (float) DoEval ( tMatch ); } virtual int IntEval ( const CSphMatch & tMatch ) const { return (int) DoEval ( tMatch ); } virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { return (int64_t) DoEval ( tMatch ); } virtual void SetMVAPool ( const DWORD * pMvaPool ) { this->m_pArg->SetMVAPool ( pMvaPool ); ARRAY_FOREACH ( i, m_dBitWeights ) m_dBitWeights[i]->SetMVAPool ( pMvaPool ); } virtual void SetStringPool ( const BYTE * pStrings ) { this->m_pArg->SetStringPool ( pStrings ); ARRAY_FOREACH ( i, m_dBitWeights ) m_dBitWeights[i]->SetStringPool ( pStrings ); } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { Expr_ArgVsSet_c::GetDependencyColumns ( dColumns ); ARRAY_FOREACH ( i, m_dBitWeights ) m_dBitWeights[i]->GetDependencyColumns ( dColumns ); } }; ////////////////////////////////////////////////////////////////////////// static inline double sphSqr ( double v ) { return v * v; } static inline float CalcGeodist ( float fPointLat, float fPointLon, float fAnchorLat, float fAnchorLon ) { const double R = 6384000; double dlat = fPointLat - fAnchorLat; double dlon = fPointLon - fAnchorLon; double a = sphSqr ( sin ( dlat/2 ) ) + cos ( fPointLat ) * cos ( fAnchorLat ) * sphSqr ( sin ( dlon/2 ) ); double c = 2*asin ( Min ( 1, sqrt(a) ) ); return (float)(R*c); } /// geodist() - attr point, constant anchor class Expr_GeodistAttrConst_c: public ISphExpr { public: Expr_GeodistAttrConst_c ( CSphAttrLocator tLat, CSphAttrLocator tLon, float fAnchorLat, float fAnchorLon, int iLat, int iLon ) : m_tLat ( tLat ) , m_tLon ( tLon ) , m_fAnchorLat ( fAnchorLat ) , m_fAnchorLon ( fAnchorLon ) , m_iLat ( iLat ) , m_iLon ( iLon ) {} virtual float Eval ( const CSphMatch & tMatch ) const { return CalcGeodist ( tMatch.GetAttrFloat ( m_tLat ), tMatch.GetAttrFloat ( m_tLon ), m_fAnchorLat, m_fAnchorLon ); } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { dColumns.Add ( m_iLat ); dColumns.Add ( m_iLon ); } private: CSphAttrLocator m_tLat; CSphAttrLocator m_tLon; float m_fAnchorLat; float m_fAnchorLon; int m_iLat; int m_iLon; }; /// geodist() - expr point, constant anchor class Expr_GeodistConst_c: public ISphExpr { public: Expr_GeodistConst_c ( ISphExpr * pLat, ISphExpr * pLon, float fAnchorLat, float fAnchorLon ) : m_pLat ( pLat ) , m_pLon ( pLon ) , m_fAnchorLat ( fAnchorLat ) , m_fAnchorLon ( fAnchorLon ) {} ~Expr_GeodistConst_c () { SafeRelease ( m_pLon ); SafeRelease ( m_pLat ); } virtual float Eval ( const CSphMatch & tMatch ) const { return CalcGeodist ( m_pLat->Eval(tMatch), m_pLon->Eval(tMatch), m_fAnchorLat, m_fAnchorLon ); } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { m_pLat->GetDependencyColumns ( dColumns ); m_pLon->GetDependencyColumns ( dColumns ); } private: ISphExpr * m_pLat; ISphExpr * m_pLon; float m_fAnchorLat; float m_fAnchorLon; }; /// geodist() - expr point, expr anchor class Expr_Geodist_c: public ISphExpr { public: Expr_Geodist_c ( ISphExpr * pLat, ISphExpr * pLon, ISphExpr * pAnchorLat, ISphExpr * pAnchorLon ) : m_pLat ( pLat ) , m_pLon ( pLon ) , m_pAnchorLat ( pAnchorLat ) , m_pAnchorLon ( pAnchorLon ) {} ~Expr_Geodist_c () { SafeRelease ( m_pAnchorLon ); SafeRelease ( m_pAnchorLat ); SafeRelease ( m_pLon ); SafeRelease ( m_pLat ); } virtual float Eval ( const CSphMatch & tMatch ) const { return CalcGeodist ( m_pLat->Eval(tMatch), m_pLon->Eval(tMatch), m_pAnchorLat->Eval(tMatch), m_pAnchorLon->Eval(tMatch) ); } virtual void GetDependencyColumns ( CSphVector & dColumns ) const { m_pLat->GetDependencyColumns ( dColumns ); m_pLon->GetDependencyColumns ( dColumns ); m_pAnchorLat->GetDependencyColumns ( dColumns ); m_pAnchorLon->GetDependencyColumns ( dColumns ); } private: ISphExpr * m_pLat; ISphExpr * m_pLon; ISphExpr * m_pAnchorLat; ISphExpr * m_pAnchorLon; }; ////////////////////////////////////////////////////////////////////////// void ExprParser_t::GatherArgTypes ( int iNode, CSphVector & dTypes ) { if ( iNode<0 ) return; const ExprNode_t & tNode = m_dNodes[iNode]; if ( tNode.m_iToken==',' ) { GatherArgTypes ( tNode.m_iLeft, dTypes ); GatherArgTypes ( tNode.m_iRight, dTypes ); } else { dTypes.Add ( tNode.m_iToken ); } } void ExprParser_t::GatherArgNodes ( int iNode, CSphVector & dNodes ) { if ( iNode<0 ) return; const ExprNode_t & tNode = m_dNodes[iNode]; if ( tNode.m_iToken==',' ) { GatherArgNodes ( tNode.m_iLeft, dNodes ); GatherArgNodes ( tNode.m_iRight, dNodes ); } else dNodes.Add ( iNode ); } bool ExprParser_t::CheckForConstSet ( int iArgsNode, int iSkip ) { CSphVector dTypes; GatherArgTypes ( iArgsNode, dTypes ); for ( int i=iSkip; i void ExprParser_t::WalkTree ( int iRoot, T & FUNCTOR ) { if ( iRoot>=0 ) { const ExprNode_t & tNode = m_dNodes[iRoot]; FUNCTOR.Enter ( tNode ); WalkTree ( tNode.m_iLeft, FUNCTOR ); WalkTree ( tNode.m_iRight, FUNCTOR ); FUNCTOR.Exit ( tNode ); } } ISphExpr * ExprParser_t::CreateIntervalNode ( int iArgsNode, CSphVector & dArgs ) { assert ( dArgs.GetLength()>=2 ); bool bConst = CheckForConstSet ( iArgsNode, 1 ); ESphAttr eAttrType = m_dNodes[iArgsNode].m_eArgType; if ( bConst ) { switch ( eAttrType ) { case SPH_ATTR_INTEGER: return new Expr_IntervalConst_c ( dArgs ); break; case SPH_ATTR_BIGINT: return new Expr_IntervalConst_c ( dArgs ); break; default: return new Expr_IntervalConst_c ( dArgs ); break; } } else { switch ( eAttrType ) { case SPH_ATTR_INTEGER: return new Expr_Interval_c ( dArgs ); break; case SPH_ATTR_BIGINT: return new Expr_Interval_c ( dArgs ); break; default: return new Expr_Interval_c ( dArgs ); break; } } } ISphExpr * ExprParser_t::CreateInNode ( int iNode ) { const ExprNode_t & tNode = m_dNodes[iNode]; if ( m_dNodes[tNode.m_iRight].m_iToken!=TOK_CONST_LIST ) { m_sCreateError = "IN() arguments must be constants (except the 1st one)"; return NULL; } assert ( m_dNodes[tNode.m_iRight].m_iToken==TOK_CONST_LIST ); ConstList_c * pConst = m_dNodes[tNode.m_iRight].m_pConsts; bool bMVA = ( m_dNodes[tNode.m_iLeft].m_iToken==TOK_ATTR_MVA32 || m_dNodes[tNode.m_iLeft].m_iToken==TOK_ATTR_MVA64 ); if ( bMVA ) { if ( m_dNodes[tNode.m_iLeft].m_iToken==TOK_ATTR_MVA32 ) return new Expr_MVAIn_c ( m_dNodes[tNode.m_iLeft].m_tLocator, m_dNodes[tNode.m_iLeft].m_iLocator, pConst ); else return new Expr_MVAIn_c ( m_dNodes[tNode.m_iLeft].m_tLocator, m_dNodes[tNode.m_iLeft].m_iLocator, pConst ); } else { ISphExpr * pArg = CreateTree ( tNode.m_iLeft ); switch ( pConst->m_eRetType ) { case SPH_ATTR_INTEGER: return new Expr_In_c ( pArg, pConst ); break; case SPH_ATTR_BIGINT: return new Expr_In_c ( pArg, pConst ); break; default: return new Expr_In_c ( pArg, pConst ); break; } } } ISphExpr * ExprParser_t::CreateGeodistNode ( int iArgs ) { CSphVector dArgs; GatherArgNodes ( iArgs, dArgs ); assert ( dArgs.GetLength()==4 ); bool bConst1 = ( IsConst ( &m_dNodes[dArgs[0]] ) && IsConst ( &m_dNodes[dArgs[1]] ) ); bool bConst2 = ( IsConst ( &m_dNodes[dArgs[2]] ) && IsConst ( &m_dNodes[dArgs[3]] ) ); if ( bConst1 && bConst2 ) { return new Expr_GetConst_c ( CalcGeodist ( m_dNodes[dArgs[0]].FloatVal(), m_dNodes[dArgs[1]].FloatVal(), m_dNodes[dArgs[2]].FloatVal(), m_dNodes[dArgs[3]].FloatVal() ) ); } if ( bConst1 ) { Swap ( dArgs[0], dArgs[2] ); Swap ( dArgs[1], dArgs[3] ); Swap ( bConst1, bConst2 ); } if ( bConst2 ) { // constant anchor if ( m_dNodes[dArgs[0]].m_iToken==TOK_ATTR_FLOAT && m_dNodes[dArgs[1]].m_iToken==TOK_ATTR_FLOAT ) { // attr point return new Expr_GeodistAttrConst_c ( m_dNodes[dArgs[0]].m_tLocator, m_dNodes[dArgs[1]].m_tLocator, m_dNodes[dArgs[2]].FloatVal(), m_dNodes[dArgs[3]].FloatVal(), m_dNodes[dArgs[0]].m_iLocator, m_dNodes[dArgs[1]].m_iLocator ); } else { // expr point return new Expr_GeodistConst_c ( CreateTree ( dArgs[0] ), CreateTree ( dArgs[1] ), m_dNodes[dArgs[2]].FloatVal(), m_dNodes[dArgs[3]].FloatVal() ); } } // four expressions CSphVector dExpr; FoldArglist ( CreateTree ( iArgs ), dExpr ); assert ( dExpr.GetLength()==4 ); return new Expr_Geodist_c ( dExpr[0], dExpr[1], dExpr[2], dExpr[3] ); } ISphExpr * ExprParser_t::CreateBitdotNode ( int iArgsNode, CSphVector & dArgs ) { assert ( dArgs.GetLength()>=1 ); ESphAttr eAttrType = m_dNodes[iArgsNode].m_eRetType; switch ( eAttrType ) { case SPH_ATTR_INTEGER: return new Expr_Bitdot_c ( dArgs ); break; case SPH_ATTR_BIGINT: return new Expr_Bitdot_c ( dArgs ); break; default: return new Expr_Bitdot_c ( dArgs ); break; } } ////////////////////////////////////////////////////////////////////////// int yylex ( YYSTYPE * lvalp, ExprParser_t * pParser ) { return pParser->GetToken ( lvalp ); } void yyerror ( ExprParser_t * pParser, const char * sMessage ) { pParser->m_sParserError.SetSprintf ( "Sphinx expr: %s near '%s'", sMessage, pParser->m_pLastTokenStart ); } #if USE_WINDOWS #pragma warning(push,1) #endif #include "yysphinxexpr.c" #if USE_WINDOWS #pragma warning(pop) #endif ////////////////////////////////////////////////////////////////////////// ExprParser_t::~ExprParser_t () { // i kinda own those constlists ARRAY_FOREACH ( i, m_dNodes ) if ( m_dNodes[i].m_iToken==TOK_CONST_LIST ) SafeDelete ( m_dNodes[i].m_pConsts ); // free any UDF calls that weren't taken over ARRAY_FOREACH ( i, m_dUdfCalls ) SafeDelete ( m_dUdfCalls[i] ); } ESphAttr ExprParser_t::GetWidestRet ( int iLeft, int iRight ) { ESphAttr uLeftType = ( iLeft<0 ) ? SPH_ATTR_INTEGER : m_dNodes[iLeft].m_eRetType; ESphAttr uRightType = ( iRight<0 ) ? SPH_ATTR_INTEGER : m_dNodes[iRight].m_eRetType; ESphAttr uRes = SPH_ATTR_FLOAT; // default is float if ( ( uLeftType==SPH_ATTR_INTEGER || uLeftType==SPH_ATTR_BIGINT ) && ( uRightType==SPH_ATTR_INTEGER || uRightType==SPH_ATTR_BIGINT ) ) { // both types are integer (int32 or int64), compute in integers uRes = ( uLeftType==SPH_ATTR_INTEGER && uRightType==SPH_ATTR_INTEGER ) ? SPH_ATTR_INTEGER : SPH_ATTR_BIGINT; } return uRes; } int ExprParser_t::AddNodeInt ( int64_t iValue ) { ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = TOK_CONST_INT; tNode.m_eRetType = GetIntType ( iValue ); tNode.m_iConst = iValue; return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeFloat ( float fValue ) { ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = TOK_CONST_FLOAT; tNode.m_eRetType = SPH_ATTR_FLOAT; tNode.m_fConst = fValue; return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeString ( int64_t iValue ) { ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = TOK_CONST_STRING; tNode.m_eRetType = SPH_ATTR_STRING; tNode.m_iConst = iValue; return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeAttr ( int iTokenType, uint64_t uAttrLocator ) { assert ( iTokenType==TOK_ATTR_INT || iTokenType==TOK_ATTR_BITS || iTokenType==TOK_ATTR_FLOAT || iTokenType==TOK_ATTR_MVA32 || iTokenType==TOK_ATTR_MVA64 || iTokenType==TOK_ATTR_STRING ); ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = iTokenType; sphUnpackAttrLocator ( uAttrLocator, &tNode ); if ( iTokenType==TOK_ATTR_FLOAT ) tNode.m_eRetType = SPH_ATTR_FLOAT; else if ( iTokenType==TOK_ATTR_MVA32 ) tNode.m_eRetType = SPH_ATTR_UINT32SET; else if ( iTokenType==TOK_ATTR_MVA64 ) tNode.m_eRetType = SPH_ATTR_UINT64SET; else if ( iTokenType==TOK_ATTR_STRING ) tNode.m_eRetType = SPH_ATTR_STRING; else if ( tNode.m_tLocator.m_iBitCount>32 ) tNode.m_eRetType = SPH_ATTR_BIGINT; else tNode.m_eRetType = SPH_ATTR_INTEGER; return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeID () { ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = TOK_ID; tNode.m_eRetType = USE_64BIT ? SPH_ATTR_BIGINT : SPH_ATTR_INTEGER; return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeWeight () { ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = TOK_WEIGHT; tNode.m_eRetType = SPH_ATTR_INTEGER; return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeOp ( int iOp, int iLeft, int iRight ) { ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = iOp; // deduce type tNode.m_eRetType = SPH_ATTR_FLOAT; // default to float if ( iOp==TOK_NEG ) { // NEG just inherits the type tNode.m_eArgType = m_dNodes[iLeft].m_eRetType; tNode.m_eRetType = tNode.m_eArgType; } else if ( iOp==TOK_NOT ) { // NOT result is integer, and its argument must be integer tNode.m_eArgType = m_dNodes[iLeft].m_eRetType; tNode.m_eRetType = SPH_ATTR_INTEGER; if (!( tNode.m_eArgType==SPH_ATTR_INTEGER || tNode.m_eArgType==SPH_ATTR_BIGINT )) { m_sParserError.SetSprintf ( "NOT argument must be integer" ); return -1; } } else if ( iOp==TOK_LTE || iOp==TOK_GTE || iOp==TOK_EQ || iOp==TOK_NE || iOp=='<' || iOp=='>' || iOp==TOK_AND || iOp==TOK_OR || iOp=='+' || iOp=='-' || iOp=='*' || iOp==',' || iOp=='&' || iOp=='|' || iOp=='%' ) { tNode.m_eArgType = GetWidestRet ( iLeft, iRight ); // arithmetical operations return arg type, logical return int tNode.m_eRetType = ( iOp=='+' || iOp=='-' || iOp=='*' || iOp==',' || iOp=='&' || iOp=='|' || iOp=='%' ) ? tNode.m_eArgType : SPH_ATTR_INTEGER; // both logical and bitwise AND/OR can only be over ints if ( ( iOp==TOK_AND || iOp==TOK_OR || iOp=='&' || iOp=='|' ) && !( tNode.m_eArgType==SPH_ATTR_INTEGER || tNode.m_eArgType==SPH_ATTR_BIGINT )) { m_sParserError.SetSprintf ( "%s arguments must be integer", ( iOp==TOK_AND || iOp=='&' ) ? "AND" : "OR" ); return -1; } // MOD can only be over ints if ( iOp=='%' && !( tNode.m_eArgType==SPH_ATTR_INTEGER || tNode.m_eArgType==SPH_ATTR_BIGINT )) { m_sParserError.SetSprintf ( "MOD arguments must be integer" ); return -1; } } else { // check for unknown op assert ( iOp=='/' && "unknown op in AddNodeOp() type deducer" ); } tNode.m_iArgs = 0; if ( iOp==',' ) { if ( iLeft>=0 ) tNode.m_iArgs += ( m_dNodes[iLeft].m_iToken==',' ) ? m_dNodes[iLeft].m_iArgs : 1; if ( iRight>=0 ) tNode.m_iArgs += ( m_dNodes[iRight].m_iToken==',' ) ? m_dNodes[iRight].m_iArgs : 1; } tNode.m_iLeft = iLeft; tNode.m_iRight = iRight; return m_dNodes.GetLength()-1; } struct TypeCheck_fn { bool * m_pStr; bool * m_pMva; explicit TypeCheck_fn ( bool * pStr, bool * pMva ) : m_pStr ( pStr ) , m_pMva ( pMva ) {} void Enter ( const ExprNode_t & tNode ) { *m_pStr |= ( tNode.m_eRetType==SPH_ATTR_STRING ); *m_pMva |= ( tNode.m_eRetType==SPH_ATTR_UINT32SET || tNode.m_eRetType==SPH_ATTR_UINT64SET ); } void Exit ( const ExprNode_t & ) {} }; int ExprParser_t::AddNodeFunc ( int iFunc, int iLeft, int iRight ) { // regular case, iLeft is entire arglist, iRight is -1 // special case for IN(), iLeft is arg, iRight is constlist assert ( iFunc>=0 && iFunc=0 ) iArgc = ( m_dNodes[iLeft].m_iToken==',' ) ? m_dNodes[iLeft].m_iArgs : 1; if ( iExpectedArgc<0 ) { if ( iArgc<-iExpectedArgc ) { m_sParserError.SetSprintf ( "%s() called with %d args, at least %d args expected", g_dFuncs[iFunc].m_sName, iArgc, -iExpectedArgc ); return -1; } } else if ( iArgc!=iExpectedArgc ) { m_sParserError.SetSprintf ( "%s() called with %d args, %d args expected", g_dFuncs[iFunc].m_sName, iArgc, iExpectedArgc ); return -1; } } // check arg types // // check for string args // most builtin functions take numeric args only bool bGotString = false, bGotMva = false; if ( iRight<0 ) { TypeCheck_fn fnCheck ( &bGotString, &bGotMva ); WalkTree ( iLeft, fnCheck ); } if ( bGotString && eFunc!=FUNC_CRC32 ) { m_sParserError.SetSprintf ( "%s() arguments can not be string", g_dFuncs[iFunc].m_sName ); return -1; } if ( bGotMva && eFunc!=FUNC_IN ) { m_sParserError.SetSprintf ( "%s() arguments can not be MVA", g_dFuncs[iFunc].m_sName ); return -1; } // check that first BITDOT arg is integer or bigint if ( eFunc==FUNC_BITDOT ) { int iLeftmost = iLeft; while ( m_dNodes[iLeftmost].m_iToken==',' ) iLeftmost = m_dNodes[iLeftmost].m_iLeft; ESphAttr eArg = m_dNodes[iLeftmost].m_eRetType; if ( eArg!=SPH_ATTR_INTEGER && eArg!=SPH_ATTR_BIGINT ) { m_sParserError.SetSprintf ( "first BITDOT() argument must be integer" ); return -1; } } // check that first SINT or timestamp family arg is integer if ( eFunc==FUNC_SINT || eFunc==FUNC_DAY || eFunc==FUNC_MONTH || eFunc==FUNC_YEAR || eFunc==FUNC_YEARMONTH || eFunc==FUNC_YEARMONTHDAY ) { assert ( iLeft>=0 ); if ( m_dNodes[iLeft].m_eRetType!=SPH_ATTR_INTEGER ) { m_sParserError.SetSprintf ( "%s() argument must be integer", g_dFuncs[iFunc].m_sName ); return -1; } } // do add ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = TOK_FUNC; tNode.m_iFunc = iFunc; tNode.m_iLeft = iLeft; tNode.m_iRight = iRight; tNode.m_eArgType = ( iLeft>=0 ) ? m_dNodes[iLeft].m_eRetType : SPH_ATTR_INTEGER; tNode.m_eRetType = g_dFuncs[iFunc].m_eRet; // fixup return type in a few special cases if ( eFunc==FUNC_MIN || eFunc==FUNC_MAX || eFunc==FUNC_MADD || eFunc==FUNC_MUL3 || eFunc==FUNC_ABS || eFunc==FUNC_IDIV ) tNode.m_eRetType = tNode.m_eArgType; if ( eFunc==FUNC_BIGINT && tNode.m_eRetType==SPH_ATTR_FLOAT ) tNode.m_eRetType = SPH_ATTR_FLOAT; // enforce if we can; FIXME! silently ignores BIGINT() on floats; should warn or raise an error if ( eFunc==FUNC_IF || eFunc==FUNC_BITDOT ) tNode.m_eRetType = GetWidestRet ( iLeft, iRight ); // all ok assert ( tNode.m_eRetType!=SPH_ATTR_NONE ); return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeUdf ( int iCall, int iArg ) { UdfCall_t * pCall = m_dUdfCalls[iCall]; SPH_UDF_INIT & tInit = pCall->m_tInit; SPH_UDF_ARGS & tArgs = pCall->m_tArgs; // initialize UDF right here, at AST creation stage // just because it's easy to gather arg types here if ( iArg>=0 ) { // gather arg types CSphVector dArgTypes; int iCur = iArg; while ( iCur>=0 ) { if ( m_dNodes[iCur].m_iToken!=',' ) { dArgTypes.Add ( m_dNodes[iCur].m_eRetType ); break; } int iRight = m_dNodes[iCur].m_iRight; if ( iRight>=0 ) { assert ( m_dNodes[iRight].m_iToken!=',' ); dArgTypes.Add ( m_dNodes[iRight].m_eRetType ); } iCur = m_dNodes[iCur].m_iLeft; } assert ( dArgTypes.GetLength() ); tArgs.arg_count = dArgTypes.GetLength(); tArgs.arg_types = new sphinx_udf_argtype [ tArgs.arg_count ]; // we gathered internal type ids in right-to-left order // reverse and remap // FIXME! eliminate remap, maybe? ARRAY_FOREACH ( i, dArgTypes ) { sphinx_udf_argtype & eRes = tArgs.arg_types [ tArgs.arg_count-1-i ]; switch ( dArgTypes[i] ) { case SPH_ATTR_INTEGER: case SPH_ATTR_TIMESTAMP: case SPH_ATTR_ORDINAL: case SPH_ATTR_BOOL: case SPH_ATTR_WORDCOUNT: eRes = SPH_UDF_TYPE_UINT32; break; case SPH_ATTR_FLOAT: eRes = SPH_UDF_TYPE_FLOAT; break; case SPH_ATTR_BIGINT: eRes = SPH_UDF_TYPE_INT64; break; case SPH_ATTR_STRING: eRes = SPH_UDF_TYPE_STRING; break; case SPH_ATTR_UINT32SET: eRes = SPH_UDF_TYPE_UINT32SET; break; default: m_sParserError.SetSprintf ( "internal error: unmapped UDF argument type (arg=%d, type=%d)", i, dArgTypes[i] ); return -1; } } } // init if ( pCall->m_pUdf->m_fnInit ) { char sError [ SPH_UDF_ERROR_LEN ]; if ( pCall->m_pUdf->m_fnInit ( &tInit, &tArgs, sError ) ) { m_sParserError = sError; return -1; } } // do add ExprNode_t & tNode = m_dNodes.Add (); tNode.m_iToken = TOK_UDF; tNode.m_iFunc = iCall; tNode.m_iLeft = iArg; tNode.m_iRight = -1; // deduce type tNode.m_eArgType = ( iArg>=0 ) ? m_dNodes[iArg].m_eRetType : SPH_ATTR_INTEGER; tNode.m_eRetType = pCall->m_pUdf->m_eRetType; return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeConstlist ( int64_t iValue ) { ExprNode_t & tNode = m_dNodes.Add(); tNode.m_iToken = TOK_CONST_LIST; tNode.m_pConsts = new ConstList_c(); tNode.m_pConsts->Add ( iValue ); return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeConstlist ( float iValue ) { ExprNode_t & tNode = m_dNodes.Add(); tNode.m_iToken = TOK_CONST_LIST; tNode.m_pConsts = new ConstList_c(); tNode.m_pConsts->Add ( iValue ); return m_dNodes.GetLength()-1; } void ExprParser_t::AppendToConstlist ( int iNode, int64_t iValue ) { m_dNodes[iNode].m_pConsts->Add ( iValue ); } void ExprParser_t::AppendToConstlist ( int iNode, float iValue ) { m_dNodes[iNode].m_pConsts->Add ( iValue ); } int ExprParser_t::ConstlistFromUservar ( int iUservar ) { if ( g_pUservarsHook ) { ExprNode_t & tNode = m_dNodes.Add(); tNode.m_iToken = TOK_CONST_LIST; tNode.m_pConsts = new ConstList_c(); if ( g_pUservarsHook ( m_dUservars[iUservar], tNode.m_pConsts->m_dInts ) ) { return m_dNodes.GetLength()-1; } else { SafeDelete ( tNode.m_pConsts ); m_dNodes.Pop(); } } m_sParserError.SetSprintf ( "undefined user variable '%s'", m_dUservars[iUservar].cstr() ); return -1; } int ExprParser_t::AddNodeHookIdent ( int iID ) { ExprNode_t & tNode = m_dNodes.Add(); tNode.m_iToken = TOK_HOOK_IDENT; tNode.m_iFunc = iID; tNode.m_eRetType = m_pHook->GetIdentType ( iID ); return m_dNodes.GetLength()-1; } int ExprParser_t::AddNodeHookFunc ( int iID, int iLeft ) { // check args count int iArgc = 0; if ( iLeft>=0 ) iArgc = ( m_dNodes[iLeft].m_iToken==',' ) ? m_dNodes[iLeft].m_iArgs : 1; int iExpectedArgc = m_pHook->GetExpectedArgc ( iID ); if ( iArgc!=iExpectedArgc ) { m_sParserError.SetSprintf ( "%s() called with %d args, %d args expected", m_pHook->GetFuncName ( iID ), iArgc, iExpectedArgc ); return -1; } ExprNode_t & tNode = m_dNodes.Add(); tNode.m_iToken = TOK_HOOK_FUNC; tNode.m_iFunc = iID; tNode.m_iLeft = iLeft; tNode.m_iRight = -1; // deduce type tNode.m_eArgType = ( iLeft>=0 ) ? m_dNodes[iLeft].m_eRetType : SPH_ATTR_INTEGER; tNode.m_eRetType = m_pHook->GetFuncType ( iID, m_dNodes[iLeft].m_eRetType ); return m_dNodes.GetLength()-1; } struct WeightCheck_fn { bool * m_pRes; explicit WeightCheck_fn ( bool * pRes ) : m_pRes ( pRes ) { assert ( m_pRes ); *m_pRes = false; } void Enter ( const ExprNode_t & tNode ) { if ( tNode.m_iToken==TOK_WEIGHT ) *m_pRes = true; } void Exit ( const ExprNode_t & ) {} }; struct HookCheck_fn { ISphExprHook * m_pHook; explicit HookCheck_fn ( ISphExprHook * pHook ) : m_pHook ( pHook ) {} void Enter ( const ExprNode_t & tNode ) { if ( tNode.m_iToken==TOK_HOOK_IDENT || tNode.m_iToken==TOK_HOOK_FUNC ) m_pHook->CheckEnter ( tNode.m_iFunc ); } void Exit ( const ExprNode_t & tNode ) { if ( tNode.m_iToken==TOK_HOOK_IDENT || tNode.m_iToken==TOK_HOOK_FUNC ) m_pHook->CheckExit ( tNode.m_iFunc ); } }; ISphExpr * ExprParser_t::Parse ( const char * sExpr, const CSphSchema & tSchema, ESphAttr * pAttrType, bool * pUsesWeight, CSphString & sError ) { m_sLexerError = ""; m_sParserError = ""; m_sCreateError = ""; // setup lexer m_sExpr = sExpr; m_pCur = sExpr; m_pSchema = &tSchema; // setup constant functions m_iConstNow = (int) time ( NULL ); // build tree m_iParsed = -1; yyparse ( this ); // handle errors if ( m_iParsed<0 || !m_sLexerError.IsEmpty() || !m_sParserError.IsEmpty() ) { sError = !m_sLexerError.IsEmpty() ? m_sLexerError : m_sParserError; if ( sError.IsEmpty() ) sError = "general parsing error"; return NULL; } // deduce return type ESphAttr eAttrType = m_dNodes[m_iParsed].m_eRetType; assert ( eAttrType==SPH_ATTR_INTEGER || eAttrType==SPH_ATTR_BIGINT || eAttrType==SPH_ATTR_FLOAT ); // perform optimizations Optimize ( m_iParsed ); #if 0 Dump ( m_iParsed ); #endif // create evaluator ISphExpr * pRes = CreateTree ( m_iParsed ); if ( !m_sCreateError.IsEmpty() ) { sError = m_sCreateError; SafeRelease ( pRes ); } else if ( !pRes ) { sError.SetSprintf ( "empty expression" ); } if ( pAttrType ) *pAttrType = eAttrType; if ( pUsesWeight ) { WeightCheck_fn tFunctor ( pUsesWeight ); WalkTree ( m_iParsed, tFunctor ); } if ( m_pHook ) { HookCheck_fn tFunctor ( m_pHook ); WalkTree ( m_iParsed, tFunctor ); } return pRes; } ////////////////////////////////////////////////////////////////////////// // UDF MANAGER ////////////////////////////////////////////////////////////////////////// #if USE_WINDOWS #define HAVE_DLOPEN 1 #define RTLD_LAZY 0 #define RTLD_LOCAL 0 void * dlsym ( void * lib, const char * name ) { return GetProcAddress ( (HMODULE)lib, name ); } void * dlopen ( const char * libname, int ) { return LoadLibraryEx ( libname, NULL, 0 ); } int dlclose ( void * lib ) { return FreeLibrary ( (HMODULE)lib ) ? 0 : GetLastError(); } const char * dlerror() { static char sError[256]; DWORD uError = GetLastError(); FormatMessage ( FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, NULL, uError, LANG_SYSTEM_DEFAULT, (LPTSTR)sError, sizeof(sError), NULL ); return sError; } #endif // USE_WINDOWS #if !HAVE_DLOPEN void sphUDFInit ( const char * ) { return; } bool sphUDFCreate ( const char *, const char *, ESphAttr, CSphString & sError ) { sError = "no dlopen(); UDF support disabled"; return false; } bool sphUDFDrop ( const char *, CSphString & sError ) { sError = "no dlopen(); UDF support disabled"; return false; } #else void sphUDFInit ( const char * sUdfDir ) { if ( !sUdfDir || !*sUdfDir ) return; g_sUdfDir = sUdfDir; g_bUdfEnabled = true; } bool sphUDFCreate ( const char * szLib, const char * szFunc, ESphAttr eRetType, CSphString & sError ) { if ( !g_bUdfEnabled ) { sError = "UDF support disabled (requires workers=threads; and a valid plugin_dir)"; return false; } // validate library name for ( const char * p = szLib; *p; p++ ) if ( *p=='/' || *p=='\\' ) { sError = "restricted character (path delimiter) in a library file name"; return false; } // from here, we need a lock (we intend to update UDF hash) g_tUdfMutex.Lock(); // validate function name CSphString sFunc ( szFunc ); sFunc.ToLower(); if ( g_hUdfFuncs ( sFunc ) ) { sError.SetSprintf ( "UDF '%s' already exists", sFunc.cstr() ); g_tUdfMutex.Unlock(); return false; } // lookup or load library CSphString sLib; sLib.SetSprintf ( "%s/%s", g_sUdfDir.cstr(), szLib ); UdfFunc_t tFunc; tFunc.m_eRetType = eRetType; tFunc.m_iUserCount = 0; tFunc.m_bToDrop = false; bool bLoaded = false; void * pHandle = NULL; tFunc.m_pLib = g_hUdfLibs ( sLib ); if ( !tFunc.m_pLib ) { bLoaded = true; pHandle = dlopen ( sLib.cstr(), RTLD_LAZY | RTLD_LOCAL ); if ( !pHandle ) { const char * sDlerror = dlerror(); sError.SetSprintf ( "dlopen() failed: %s", sDlerror ? sDlerror : "(null)" ); g_tUdfMutex.Unlock(); return false; } sphLogDebug ( "dlopen(%s)=%p", sLib.cstr(), pHandle ); } else { pHandle = tFunc.m_pLib->m_pHandle; } assert ( pHandle ); // lookup and check function symbols CSphString sName; tFunc.m_fnFunc = dlsym ( pHandle, sFunc.cstr() ); tFunc.m_fnInit = (UdfInit_fn) dlsym ( pHandle, sName.SetSprintf ( "%s_init", sFunc.cstr() ).cstr() ); tFunc.m_fnDeinit = (UdfDeinit_fn) dlsym ( pHandle, sName.SetSprintf ( "%s_deinit", sFunc.cstr() ).cstr() ); if ( !tFunc.m_fnFunc || !tFunc.m_fnInit ) { sError.SetSprintf ( "symbol '%s%s' not found in '%s'", sFunc.cstr(), tFunc.m_fnFunc ? "_init" : "", szLib ); if ( bLoaded ) dlclose ( pHandle ); g_tUdfMutex.Unlock(); return false; } // add library if ( bLoaded ) { UdfLib_t tLib; tLib.m_iFuncs = 1; tLib.m_pHandle = pHandle; Verify ( g_hUdfLibs.Add ( tLib, sLib ) ); tFunc.m_pLib = g_hUdfLibs ( sLib ); } else { tFunc.m_pLib->m_iFuncs++; } tFunc.m_pLibName = g_hUdfLibs.GetKeyPtr ( sLib ); assert ( tFunc.m_pLib ); // add function Verify ( g_hUdfFuncs.Add ( tFunc, sFunc ) ); // all ok g_tUdfMutex.Unlock(); return true; } bool sphUDFDrop ( const char * szFunc, CSphString & sError ) { CSphString sFunc ( szFunc ); sFunc.ToLower(); g_tUdfMutex.Lock(); UdfFunc_t * pFunc = g_hUdfFuncs ( sFunc ); if ( !pFunc || pFunc->m_bToDrop ) // handle concurrent drop in progress as "not exists" { sError.SetSprintf ( "UDF '%s' does not exist", sFunc.cstr() ); g_tUdfMutex.Unlock(); return false; } const int UDF_DROP_TIMEOUT_SEC = 30; // in seconds int64_t tmEnd = sphMicroTimer() + UDF_DROP_TIMEOUT_SEC*1000000; // mark function for deletion, to prevent new users pFunc->m_bToDrop = true; if ( pFunc->m_iUserCount ) for ( ;; ) { // release lock and wait // so that concurrent users could complete and release the function g_tUdfMutex.Unlock(); sphSleepMsec ( 50 ); // re-acquire lock g_tUdfMutex.Lock(); // everyone out? proceed with dropping assert ( pFunc->m_iUserCount>=0 ); if ( pFunc->m_iUserCount<=0 ) break; // timed out? clear deletion flag, and bail if ( sphMicroTimer() > tmEnd ) { pFunc->m_bToDrop = false; g_tUdfMutex.Unlock(); sError.SetSprintf ( "DROP timed out in (still got %d users after waiting for %d seconds); please retry", pFunc->m_iUserCount, UDF_DROP_TIMEOUT_SEC ); return false; } } UdfLib_t * pLib = pFunc->m_pLib; const CSphString * pLibName = pFunc->m_pLibName; Verify ( g_hUdfFuncs.Delete ( sFunc ) ); if ( --pLib->m_iFuncs<=0 ) { // FIXME! running queries might be using this function int iRes = dlclose ( pLib->m_pHandle ); sphLogDebug ( "dlclose(%s)=%d", pLibName->cstr(), iRes ); Verify ( g_hUdfLibs.Delete ( *pLibName ) ); } g_tUdfMutex.Unlock(); return true; } #endif // HAVE_DLOPEN ////////////////////////////////////////////////////////////////////////// // PUBLIC STUFF ////////////////////////////////////////////////////////////////////////// /// parser entry point ISphExpr * sphExprParse ( const char * sExpr, const CSphSchema & tSchema, ESphAttr * pAttrType, bool * pUsesWeight, CSphString & sError, CSphSchema * pExtra, ISphExprHook * pHook ) { // parse into opcodes ExprParser_t tParser ( pExtra, pHook ); return tParser.Parse ( sExpr, tSchema, pAttrType, pUsesWeight, sError ); } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxexpr.h100777 0 0 11072 11643565732 13652 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #ifndef _sphinxexpr_ #define _sphinxexpr_ #include "sphinxstd.h" /// forward decls class CSphMatch; struct CSphSchema; struct CSphString; /// known attribute types enum ESphAttr { SPH_ATTR_NONE = 0, ///< not an attribute at all SPH_ATTR_INTEGER = 1, ///< unsigned 32-bit integer SPH_ATTR_TIMESTAMP = 2, ///< this attr is a timestamp SPH_ATTR_ORDINAL = 3, ///< this attr is an ordinal string number (integer at search time, specially handled at indexing time) SPH_ATTR_BOOL = 4, ///< this attr is a boolean bit field SPH_ATTR_FLOAT = 5, ///< floating point number (IEEE 32-bit) SPH_ATTR_BIGINT = 6, ///< signed 64-bit integer SPH_ATTR_STRING = 7, ///< string (binary; in-memory) SPH_ATTR_WORDCOUNT = 8, ///< string word count (integer at search time,tokenized and counted at indexing time) SPH_ATTR_UINT32SET = 0x40000001UL, ///< MVA, set of unsigned 32-bit integers SPH_ATTR_UINT64SET = 0x40000002UL ///< MVA, set of unsigned 64-bit integers }; /// expression evaluator /// can always be evaluated in floats using Eval() /// can sometimes be evaluated in integers using IntEval(), depending on type as returned from sphExprParse() struct ISphExpr : public ISphRefcounted { public: /// evaluate this expression for that match virtual float Eval ( const CSphMatch & tMatch ) const = 0; /// evaluate this expression for that match, using int math virtual int IntEval ( const CSphMatch & tMatch ) const { assert ( 0 ); return (int) Eval ( tMatch ); } /// evaluate this expression for that match, using int64 math virtual int64_t Int64Eval ( const CSphMatch & tMatch ) const { assert ( 0 ); return (int64_t) Eval ( tMatch ); } /// evaluate string attr virtual int StringEval ( const CSphMatch &, const BYTE ** ppStr ) const { *ppStr = NULL; return 0; } /// evaluate MVA attr virtual const DWORD * MvaEval ( const CSphMatch & ) const { assert ( 0 ); return NULL; } /// check for arglist subtype virtual bool IsArglist () const { return false; } /// setup MVA pool virtual void SetMVAPool ( const DWORD * ) {} /// setup sting pool virtual void SetStringPool ( const BYTE * ) {} /// get schema columns index which affect expression virtual void GetDependencyColumns ( CSphVector & ) const {} }; /// hook to extend expressions /// lets one to add her own identifier and function handlers struct ISphExprHook { virtual ~ISphExprHook () {} /// checks for an identifier known to the hook /// returns -1 on failure, a non-negative OID on success virtual int IsKnownIdent ( const char * sIdent ) = 0; /// checks for a valid function call /// returns -1 on failure, a non-negative OID on success (possibly adjusted) virtual int IsKnownFunc ( const char * sFunc ) = 0; /// create node by OID virtual ISphExpr * CreateNode ( int iID, ISphExpr * pLeft ) = 0; /// get identifier return type by OID virtual ESphAttr GetIdentType ( int iID ) = 0; /// get function return type by OID and argument type virtual ESphAttr GetFuncType ( int iID, ESphAttr eArgType ) = 0; /// get expected function argument count by OID virtual int GetExpectedArgc ( int iID ) = 0; /// get function name by OID virtual const char * GetFuncName ( int iID ) = 0; /// recursive scope check virtual void CheckEnter ( int iID ) = 0; /// recursive scope check virtual void CheckExit ( int iID ) = 0; }; /// parses given expression, builds evaluator /// returns NULL and fills sError on failure /// returns pointer to evaluator on success /// fills pAttrType with result type (for now, can be SPH_ATTR_SINT or SPH_ATTR_FLOAT) /// fills pUsesWeight with a flag whether match relevance is referenced in expression AST ISphExpr * sphExprParse ( const char * sExpr, const CSphSchema & tSchema, ESphAttr * pAttrType, bool * pUsesWeight, CSphString & sError, CSphSchema * pExtra=NULL, ISphExprHook * pHook=NULL ); ////////////////////////////////////////////////////////////////////////// /// initialize UDF manager void sphUDFInit ( const char * sUdfDir ); /// load UDF function bool sphUDFCreate ( const char * szLib, const char * szFunc, ESphAttr eRetType, CSphString & sError ); /// unload UDF function bool sphUDFDrop ( const char * szFunc, CSphString & sError ); #endif // _sphinxexpr_ // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxexpr.y100777 0 0 12571 11643565732 13700 0%lex-param { ExprParser_t * pParser } %parse-param { ExprParser_t * pParser } %pure-parser %error-verbose %union { int64_t iConst; // constant value float fConst; // constant value uint64_t iAttrLocator; // attribute locator (rowitem for int/float; offset+size for bits) int iFunc; // function id int iNode; // node, or uservar, or udf index }; %token TOK_CONST_INT %token TOK_CONST_FLOAT %token TOK_CONST_STRING %token TOK_ATTR_INT %token TOK_ATTR_BITS %token TOK_ATTR_FLOAT %token TOK_ATTR_MVA32 %token TOK_ATTR_MVA64 %token TOK_ATTR_STRING %token TOK_FUNC %token TOK_FUNC_IN %token TOK_USERVAR %token TOK_UDF %token TOK_HOOK_IDENT %token TOK_HOOK_FUNC %token TOK_ATID %token TOK_ATWEIGHT %token TOK_ID %token TOK_WEIGHT %token TOK_COUNT %token TOK_DISTINCT %token TOK_CONST_LIST %token TOK_ATTR_SINT %type attr %type expr %type arg %type arglist %type constlist %type function %left TOK_OR %left TOK_AND %left '|' %left '&' %left TOK_EQ TOK_NE %left '<' '>' TOK_LTE TOK_GTE %left '+' '-' %left '*' '/' '%' TOK_DIV TOK_MOD %nonassoc TOK_NOT %nonassoc TOK_NEG %% exprline: expr { pParser->m_iParsed = $1; } ; attr: TOK_ATTR_INT { $$ = pParser->AddNodeAttr ( TOK_ATTR_INT, $1 ); } | TOK_ATTR_BITS { $$ = pParser->AddNodeAttr ( TOK_ATTR_BITS, $1 ); } | TOK_ATTR_FLOAT { $$ = pParser->AddNodeAttr ( TOK_ATTR_FLOAT, $1 ); } ; expr: attr | function | TOK_CONST_INT { $$ = pParser->AddNodeInt ( $1 ); } | TOK_CONST_FLOAT { $$ = pParser->AddNodeFloat ( $1 ); } | TOK_ATID { $$ = pParser->AddNodeID(); } | TOK_ATWEIGHT { $$ = pParser->AddNodeWeight(); } | TOK_ID { $$ = pParser->AddNodeID(); } | TOK_WEIGHT '(' ')' { $$ = pParser->AddNodeWeight(); } | TOK_HOOK_IDENT { $$ = pParser->AddNodeHookIdent ( $1 ); } | '-' expr %prec TOK_NEG { $$ = pParser->AddNodeOp ( TOK_NEG, $2, -1 ); } | TOK_NOT expr { $$ = pParser->AddNodeOp ( TOK_NOT, $2, -1 ); if ( $$<0 ) YYERROR; } | expr '+' expr { $$ = pParser->AddNodeOp ( '+', $1, $3 ); } | expr '-' expr { $$ = pParser->AddNodeOp ( '-', $1, $3 ); } | expr '*' expr { $$ = pParser->AddNodeOp ( '*', $1, $3 ); } | expr '/' expr { $$ = pParser->AddNodeOp ( '/', $1, $3 ); } | expr '<' expr { $$ = pParser->AddNodeOp ( '<', $1, $3 ); } | expr '>' expr { $$ = pParser->AddNodeOp ( '>', $1, $3 ); } | expr '&' expr { $$ = pParser->AddNodeOp ( '&', $1, $3 ); } | expr '|' expr { $$ = pParser->AddNodeOp ( '|', $1, $3 ); } | expr '%' expr { $$ = pParser->AddNodeOp ( '%', $1, $3 ); } | expr TOK_DIV expr { $$ = pParser->AddNodeFunc ( FUNC_IDIV, pParser->AddNodeOp ( ',', $1, $3 ) ); } | expr TOK_MOD expr { $$ = pParser->AddNodeOp ( '%', $1, $3 ); } | expr TOK_LTE expr { $$ = pParser->AddNodeOp ( TOK_LTE, $1, $3 ); } | expr TOK_GTE expr { $$ = pParser->AddNodeOp ( TOK_GTE, $1, $3 ); } | expr TOK_EQ expr { $$ = pParser->AddNodeOp ( TOK_EQ, $1, $3 ); } | expr TOK_NE expr { $$ = pParser->AddNodeOp ( TOK_NE, $1, $3 ); } | expr TOK_AND expr { $$ = pParser->AddNodeOp ( TOK_AND, $1, $3 ); if ( $$<0 ) YYERROR; } | expr TOK_OR expr { $$ = pParser->AddNodeOp ( TOK_OR, $1, $3 ); if ( $$<0 ) YYERROR; } | '(' expr ')' { $$ = $2; } ; arg: expr | TOK_ATTR_STRING { $$ = pParser->AddNodeAttr ( TOK_ATTR_STRING, $1 ); } | TOK_ATTR_MVA32 { $$ = pParser->AddNodeAttr ( TOK_ATTR_MVA32, $1 ); } | TOK_ATTR_MVA64 { $$ = pParser->AddNodeAttr ( TOK_ATTR_MVA64, $1 ); } | TOK_CONST_STRING { $$ = pParser->AddNodeString ( $1 ); } ; arglist: arg { $$ = $1; } | arglist ',' arg { $$ = pParser->AddNodeOp ( ',', $1, $3 ); } ; constlist: TOK_CONST_INT { $$ = pParser->AddNodeConstlist ( $1 ); } | TOK_CONST_FLOAT { $$ = pParser->AddNodeConstlist ( $1 ); } | constlist ',' TOK_CONST_INT { pParser->AppendToConstlist ( $$, $3 ); } | constlist ',' TOK_CONST_FLOAT { pParser->AppendToConstlist ( $$, $3 ); } ; function: TOK_FUNC '(' arglist ')' { $$ = pParser->AddNodeFunc ( $1, $3 ); if ( $$<0 ) YYERROR; } | TOK_FUNC '(' ')' { $$ = pParser->AddNodeFunc ( $1, -1 ); if ( $$<0 ) YYERROR; } | TOK_UDF '(' arglist ')' { $$ = pParser->AddNodeUdf ( $1, $3 ); if ( $$<0 ) YYERROR; } | TOK_UDF '(' ')' { $$ = pParser->AddNodeUdf ( $1, -1 ); if ( $$<0 ) YYERROR; } | TOK_FUNC_IN '(' attr ',' constlist ')' { $$ = pParser->AddNodeFunc ( $1, $3, $5 ); } | TOK_FUNC_IN '(' TOK_ID ',' constlist ')' { $$ = pParser->AddNodeFunc ( $1, pParser->AddNodeID(), $5 ); } | TOK_FUNC_IN '(' TOK_ATID ',' constlist ')' { $$ = pParser->AddNodeFunc ( $1, pParser->AddNodeID(), $5 ); } | TOK_FUNC_IN '(' TOK_ATTR_MVA32 ',' constlist ')' { $$ = pParser->AddNodeAttr ( TOK_ATTR_MVA32, $3 ); $$ = pParser->AddNodeFunc ( $1, $$, $5 ); } | TOK_FUNC_IN '(' TOK_ATTR_MVA64 ',' constlist ')' { $$ = pParser->AddNodeAttr ( TOK_ATTR_MVA64, $3 ); $$ = pParser->AddNodeFunc ( $1, $$, $5 ); } | TOK_FUNC_IN '(' attr ',' TOK_USERVAR ')' { int iConstlist = pParser->ConstlistFromUservar ( $5 ); if ( iConstlist<0 ) YYERROR; $$ = pParser->AddNodeFunc ( $1, $3, iConstlist ); } | TOK_HOOK_FUNC '(' arglist ')' { $$ = pParser->AddNodeHookFunc ( $1, $3 ); if ( $$<0 ) YYERROR; } ; %% coreseek-4.1-beta/csft-4.1/src/sphinxfilter.cpp100777 0 0 36440 11643565732 14522 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinxfilter.h" #include "sphinxint.h" #if USE_WINDOWS #pragma warning(disable:4250) // inheritance via dominance is our intent #endif /// attribute-based struct IFilter_Attr: virtual ISphFilter { CSphAttrLocator m_tLocator; virtual void SetLocator ( const CSphAttrLocator & tLocator ) { m_tLocator = tLocator; } }; /// values struct IFilter_Values: virtual ISphFilter { const SphAttr_t * m_pValues; int m_iValueCount; IFilter_Values () : m_pValues ( NULL ) , m_iValueCount ( 0 ) {} virtual void SetValues ( const SphAttr_t * pStorage, int iCount ) { assert ( pStorage ); assert ( iCount > 0 ); #ifndef NDEBUG // values must be sorted for ( int i = 1; i < iCount; i++ ) assert ( pStorage[i-1]<=pStorage[i] ); #endif m_pValues = pStorage; m_iValueCount = iCount; } inline const SphAttr_t GetValue ( int iIndex ) const { assert ( iIndex>=0 && iIndex(*pB) ) return false; while ( pB-pA>1 ) { const SphAttr_t * pM = pA + ((pB-pA)/2); if ( uValue==(*pM) ) return true; if ( uValue<(*pM) ) pB = pM; else pA = pM; } return false; } // OPTIMIZE: use binary search bool IFilter_Values::EvalBlockValues ( SphAttr_t uBlockMin, SphAttr_t uBlockMax ) const { // is any of our values inside the block? for ( int i = 0; i < m_iValueCount; i++ ) if ( GetValue(i)>=uBlockMin && GetValue(i)<=uBlockMax ) return true; return false; } /// range struct IFilter_Range: virtual ISphFilter { SphAttr_t m_uMinValue; SphAttr_t m_uMaxValue; virtual void SetRange ( SphAttr_t tMin, SphAttr_t tMax ) { m_uMinValue = tMin; m_uMaxValue = tMax; } bool EvalRange ( const SphAttr_t uValue ) const { return uValue>=m_uMinValue && uValue<=m_uMaxValue; } }; /// MVA struct IFilter_MVA: virtual IFilter_Attr { const DWORD * m_pMvaStorage; IFilter_MVA () : m_pMvaStorage ( NULL ) {} virtual void SetMVAStorage ( const DWORD * pMva ) { m_pMvaStorage = pMva; } inline bool LoadMVA ( const CSphMatch & tMatch, const DWORD ** pMva, const DWORD ** pMvaMax ) const { assert ( m_pMvaStorage ); *pMva = tMatch.GetAttrMVA ( m_tLocator, m_pMvaStorage ); if ( !*pMva ) return false; *pMvaMax = *pMva + (**pMva) + 1; (*pMva)++; return true; } }; /// filters // attr struct Filter_Values: public IFilter_Attr, IFilter_Values { virtual bool Eval ( const CSphMatch & tMatch ) const { return EvalValues ( tMatch.GetAttr ( m_tLocator ) ); } virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const { if ( m_tLocator.m_bDynamic ) return true; // ignore computed attributes SphAttr_t uBlockMin = sphGetRowAttr ( DOCINFO2ATTRS ( pMinDocinfo ), m_tLocator ); SphAttr_t uBlockMax = sphGetRowAttr ( DOCINFO2ATTRS ( pMaxDocinfo ), m_tLocator ); return EvalBlockValues ( uBlockMin, uBlockMax ); } }; struct Filter_Range: public IFilter_Attr, IFilter_Range { virtual bool Eval ( const CSphMatch & tMatch ) const { return EvalRange ( tMatch.GetAttr ( m_tLocator ) ); } virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const { if ( m_tLocator.m_bDynamic ) return true; // ignore computed attributes SphAttr_t uBlockMin = sphGetRowAttr ( DOCINFO2ATTRS ( pMinDocinfo ), m_tLocator ); SphAttr_t uBlockMax = sphGetRowAttr ( DOCINFO2ATTRS ( pMaxDocinfo ), m_tLocator ); return (!( m_uMaxValueuBlockMax )); // not-reject } }; // float struct Filter_FloatRange: public IFilter_Attr { float m_fMinValue; float m_fMaxValue; virtual void SetRangeFloat ( float fMin, float fMax ) { m_fMinValue = fMin; m_fMaxValue = fMax; } virtual bool Eval ( const CSphMatch & tMatch ) const { const float & fValue = tMatch.GetAttrFloat ( m_tLocator ); return fValue>=m_fMinValue && fValue<=m_fMaxValue; } virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const { if ( m_tLocator.m_bDynamic ) return true; // ignore computed attributes float fBlockMin = sphDW2F ( (DWORD)sphGetRowAttr ( DOCINFO2ATTRS ( pMinDocinfo ), m_tLocator ) ); float fBlockMax = sphDW2F ( (DWORD)sphGetRowAttr ( DOCINFO2ATTRS ( pMaxDocinfo ), m_tLocator ) ); return (!( m_fMaxValuefBlockMax )); // not-reject } }; // id struct Filter_IdValues: public IFilter_Values { virtual bool Eval ( const CSphMatch & tMatch ) const { return EvalValues ( tMatch.m_iDocID ); } bool EvalBlockValues ( SphAttr_t uBlockMin, SphAttr_t uBlockMax ) const { // is any of our values inside the block? for ( int i = 0; i < m_iValueCount; i++ ) if ( (SphDocID_t)GetValue(i)>=(SphDocID_t)uBlockMin && (SphDocID_t)GetValue(i)<=(SphDocID_t)uBlockMax ) return true; return false; } virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const { const SphAttr_t uBlockMin = DOCINFO2ID ( pMinDocinfo ); const SphAttr_t uBlockMax = DOCINFO2ID ( pMaxDocinfo ); return EvalBlockValues ( uBlockMin, uBlockMax ); } Filter_IdValues () { m_bUsesAttrs = false; } }; struct Filter_IdRange: public IFilter_Range { virtual bool Eval ( const CSphMatch & tMatch ) const { const SphDocID_t uID = tMatch.m_iDocID; return uID>=(SphDocID_t)m_uMinValue && uID<=(SphDocID_t)m_uMaxValue; } virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const { const SphDocID_t uBlockMin = DOCINFO2ID ( pMinDocinfo ); const SphDocID_t uBlockMax = DOCINFO2ID ( pMaxDocinfo ); return (!( (SphDocID_t)m_uMaxValueuBlockMax )); } Filter_IdRange () { m_bUsesAttrs = false; } }; // weight struct Filter_WeightValues: public IFilter_Values { virtual bool Eval ( const CSphMatch & tMatch ) const { return EvalValues ( tMatch.m_iWeight ); } Filter_WeightValues () { m_bUsesAttrs = false; } }; struct Filter_WeightRange: public IFilter_Range { virtual bool IsEarly () { return false; } virtual bool Eval ( const CSphMatch & tMatch ) const { return EvalRange ( tMatch.m_iWeight ); } Filter_WeightRange () { m_bUsesAttrs = false; } }; // MVA template < bool IS_MVA64 > struct Filter_MVAValues: public IFilter_MVA, IFilter_Values { virtual bool Eval ( const CSphMatch & tMatch ) const { const DWORD * pMva, * pMvaMax; if ( !LoadMVA ( tMatch, &pMva, &pMvaMax ) ) return false; return MvaEval ( pMva, pMvaMax ); } bool MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const; }; template<> bool Filter_MVAValues::MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const { const SphAttr_t * pFilter = m_pValues; const SphAttr_t * pFilterMax = pFilter + m_iValueCount; const DWORD * L = pMva; const DWORD * R = pMvaMax - 1; for ( ; pFilter < pFilterMax; pFilter++ ) { while ( L<=R ) { const DWORD * m = L + (R - L) / 2; if ( *pFilter > *m ) L = m + 1; else if ( *pFilter < *m ) R = m - 1; else return true; } R = pMvaMax - 1; } return false; } template<> bool Filter_MVAValues::MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const { const SphAttr_t * pFilter = m_pValues; const SphAttr_t * pFilterMax = pFilter + m_iValueCount; const uint64_t * L = (const uint64_t *)pMva; const uint64_t * R = (const uint64_t *)( pMvaMax - 2 ); for ( ; pFilter < pFilterMax; pFilter++ ) { uint64_t uFilter = *pFilter; while ( L<=R ) { const uint64_t * pVal = L + (R - L) / 2; uint64_t uMva = MVA_UPSIZE ( (const DWORD *)pVal ); if ( uFilter > uMva ) L = pVal + 1; else if ( uFilter < uMva ) R = pVal - 1; else return true; } R = (const uint64_t *)( pMvaMax - 2 ); } return false; } template < bool IS_MVA64 > struct Filter_MVARange: public IFilter_MVA, IFilter_Range { virtual bool Eval ( const CSphMatch & tMatch ) const { const DWORD * pMva, * pMvaMax; if ( !LoadMVA ( tMatch, &pMva, &pMvaMax ) ) return false; return MvaEval ( pMva, pMvaMax ); } bool MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const; }; template<> bool Filter_MVARange::MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const { const DWORD * L = pMva; const DWORD * R = pMvaMax - 1; while ( L<=R ) { const DWORD * m = L + (R - L) / 2; if ( m_uMinValue > *m ) L = m + 1; else if ( m_uMinValue < *m ) R = m - 1; else return true; } if ( L==pMvaMax ) return false; return *L<=m_uMaxValue; } template<> bool Filter_MVARange::MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const { const uint64_t * L = (const uint64_t *)pMva; const uint64_t * R = (const uint64_t *)( pMvaMax - 2 ); while ( L<=R ) { const uint64_t * pVal = L + (R - L) / 2; uint64_t uMva = MVA_UPSIZE ( (const DWORD *)pVal ); if ( (uint64_t)m_uMinValue>uMva ) L = pVal + 1; else if ( (uint64_t)m_uMinValue < uMva ) R = pVal - 1; else return true; } if ( L==(const uint64_t *)pMvaMax ) return false; uint64_t uMvaL = MVA_UPSIZE ( (const DWORD *)L ); return uMvaL<=(uint64_t)m_uMaxValue; } // and struct Filter_And: public ISphFilter { CSphVector m_dFilters; ~Filter_And () { ARRAY_FOREACH ( i, m_dFilters ) SafeDelete ( m_dFilters[i] ); } void Add ( ISphFilter * pFilter ) { m_dFilters.Add ( pFilter ); m_bUsesAttrs |= pFilter->UsesAttrs(); } virtual bool Eval ( const CSphMatch & tMatch ) const { ARRAY_FOREACH ( i, m_dFilters ) if ( !m_dFilters[i]->Eval ( tMatch ) ) return false; return true; } virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const { ARRAY_FOREACH ( i, m_dFilters ) if ( !m_dFilters[i]->EvalBlock ( pMinDocinfo, pMaxDocinfo ) ) return false; return true; } virtual ISphFilter * Join ( ISphFilter * pFilter ) { Add ( pFilter ); return this; } Filter_And () { m_bUsesAttrs = false; } virtual void SetMVAStorage ( const DWORD * pMva ) { ARRAY_FOREACH ( i, m_dFilters ) m_dFilters[i]->SetMVAStorage ( pMva ); } }; // not struct Filter_Not: public ISphFilter { ISphFilter * m_pFilter; explicit Filter_Not ( ISphFilter * pFilter ) : m_pFilter ( pFilter ) { assert ( pFilter ); m_bUsesAttrs = pFilter->UsesAttrs(); } ~Filter_Not () { SafeDelete ( m_pFilter ); } virtual bool Eval ( const CSphMatch & tMatch ) const { return !m_pFilter->Eval ( tMatch ); } virtual bool EvalBlock ( const DWORD *, const DWORD * ) const { // if block passes through the filter we can't just negate the // result since it's imprecise at this point return true; } virtual void SetMVAStorage ( const DWORD * pMva ) { m_pFilter->SetMVAStorage ( pMva ); } }; /// impl ISphFilter * ISphFilter::Join ( ISphFilter * pFilter ) { Filter_And * pAnd = new Filter_And(); pAnd->Add ( this ); pAnd->Add ( pFilter ); return pAnd; } /// helper functions static ISphFilter * CreateSpecialFilter ( const CSphString & sName, ESphFilter eFilterType ) { if ( sName=="@id" ) { switch ( eFilterType ) { case SPH_FILTER_VALUES: return new Filter_IdValues; case SPH_FILTER_RANGE: return new Filter_IdRange; default: assert ( 0 && "invalid filter on @id" ); return NULL; } } else if ( sName=="@weight" ) { switch ( eFilterType ) { case SPH_FILTER_VALUES: return new Filter_WeightValues; case SPH_FILTER_RANGE: return new Filter_WeightRange; default: assert ( 0 && "invalid filter on @weight" ); return NULL; } } return NULL; } static inline ISphFilter * ReportError ( CSphString & sError, const char * sMessage, ESphFilter eFilterType ) { CSphString sFilterName; switch ( eFilterType ) { case SPH_FILTER_VALUES: sFilterName = "intvalues"; break; case SPH_FILTER_RANGE: sFilterName = "intrange"; break; case SPH_FILTER_FLOATRANGE: sFilterName = "floatrange"; break; default: sFilterName.SetSprintf ( "(filter-type-%d)", eFilterType ); break; } sError.SetSprintf ( sMessage, sFilterName.cstr() ); return NULL; } static ISphFilter * CreateFilter ( ESphAttr eAttrType, ESphFilter eFilterType, CSphString & sError ) { // MVA if ( eAttrType==SPH_ATTR_UINT32SET || eAttrType==SPH_ATTR_UINT64SET ) { switch ( eFilterType ) { case SPH_FILTER_VALUES: if ( eAttrType==SPH_ATTR_UINT64SET ) return new Filter_MVAValues(); else return new Filter_MVAValues(); case SPH_FILTER_RANGE: if ( eAttrType==SPH_ATTR_UINT64SET ) return new Filter_MVARange(); else return new Filter_MVARange(); default: return ReportError ( sError, "unsupported filter type '%s' on MVA column", eFilterType ); } } // float if ( eAttrType==SPH_ATTR_FLOAT ) { if ( eFilterType==SPH_FILTER_FLOATRANGE ) return new Filter_FloatRange; return ReportError ( sError, "unsupported filter type '%s' on float column", eFilterType ); } // non-float, non-MVA switch ( eFilterType ) { case SPH_FILTER_VALUES: return new Filter_Values; case SPH_FILTER_RANGE: return new Filter_Range; default: return ReportError ( sError, "unsupported filter type '%s' on int column", eFilterType ); } } ISphFilter * sphCreateFilter ( const CSphFilterSettings & tSettings, const CSphSchema & tSchema, const DWORD * pMvaPool, CSphString & sError ) { ISphFilter * pFilter = 0; // try to create filter on special attribute const CSphString & sAttrName = tSettings.m_sAttrName; if ( sAttrName.Begins("@") ) pFilter = CreateSpecialFilter ( sAttrName, tSettings.m_eType ); // fetch column info const CSphColumnInfo * pAttr = NULL; const int iAttr = tSchema.GetAttrIndex ( sAttrName.cstr() ); if ( iAttr<0 ) { if ( !pFilter ) // might be special { sError.SetSprintf ( "no such filter attribute '%s'", sAttrName.cstr() ); return NULL; // no such attribute } } else { assert ( !pFilter ); pAttr = &tSchema.GetAttr(iAttr); pFilter = CreateFilter ( pAttr->m_eAttrType, tSettings.m_eType, sError ); } // fill filter's properties if ( pFilter ) { if ( pAttr ) pFilter->SetLocator ( pAttr->m_tLocator ); pFilter->SetRange ( tSettings.m_uMinValue, tSettings.m_uMaxValue ); pFilter->SetRangeFloat ( tSettings.m_fMinValue, tSettings.m_fMaxValue ); pFilter->SetMVAStorage ( pMvaPool ); if ( tSettings.GetNumValues() > 0 ) { pFilter->SetValues ( tSettings.GetValueArray(), tSettings.GetNumValues() ); #ifndef NDEBUG // check that the values are actually sorted const SphAttr_t * pValues = tSettings.GetValueArray(); int iValues = tSettings.GetNumValues (); for ( int i=1; i=pValues[i-1] ); #endif } if ( tSettings.m_bExclude ) pFilter = new Filter_Not ( pFilter ); } return pFilter; } ISphFilter * sphJoinFilters ( ISphFilter * pA, ISphFilter * pB ) { if ( pA ) return pB ? pA->Join(pB) : pA; return pB; } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxfilter.h100777 0 0 3274 11643565732 14146 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #ifndef _sphinxfilter_ #define _sphinxfilter_ #include "sphinx.h" struct ISphFilter { virtual void SetLocator ( const CSphAttrLocator & ) {} virtual void SetRange ( SphAttr_t, SphAttr_t ) {} virtual void SetRangeFloat ( float, float ) {} virtual void SetValues ( const SphAttr_t *, int ) {} virtual void SetMVAStorage ( const DWORD * ) {} virtual ~ISphFilter () {} /// evaluate filter for a given match /// returns true if match satisfies the filter critertia (i.e. in range, found in values list etc) virtual bool Eval ( const CSphMatch & tMatch ) const = 0; /// evaluate filter for a given block /// args are pMinDocinfo and pMaxDocinfo /// returns false if no document in block can possibly pass through the filter virtual bool EvalBlock ( const DWORD *, const DWORD * ) const { // if filter does not implement block-level evaluation we assume the block will pass return true; } virtual ISphFilter * Join ( ISphFilter * pFilter ); bool UsesAttrs() const { return m_bUsesAttrs; } ISphFilter() : m_bUsesAttrs ( true ) {} protected : bool m_bUsesAttrs; }; ISphFilter * sphCreateFilter ( const CSphFilterSettings &, const CSphSchema &, const DWORD * pMva, CSphString & sError ); ISphFilter * sphJoinFilters ( ISphFilter *, ISphFilter * ); #endif // _sphinxfilter_ // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxint.h100777 0 0 77007 11643565732 13500 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #ifndef _sphinxint_ #define _sphinxint_ #include "sphinx.h" #include "sphinxfilter.h" #include #include #include ////////////////////////////////////////////////////////////////////////// const char MAGIC_SYNONYM_WHITESPACE = 1; // used internally in tokenizer only const char MAGIC_CODE_SENTENCE = 2; // emitted from tokenizer on sentence boundary const char MAGIC_CODE_PARAGRAPH = 3; // emitted from stripper (and passed via tokenizer) on paragraph boundary const char MAGIC_CODE_ZONE = 4; // emitted from stripper (and passed via tokenizer) on zone boundary; followed by zero-terminated zone name const char MAGIC_WORD_HEAD = 1; // prepended to keyword by source, stored in (crc) dictionary const char MAGIC_WORD_TAIL = 1; // appended to keyword by source, stored in (crc) dictionary const char MAGIC_WORD_HEAD_NONSTEMMED = 2; // prepended to keyword by source, stored in dictionary extern const char * MAGIC_WORD_SENTENCE; extern const char * MAGIC_WORD_PARAGRAPH; ////////////////////////////////////////////////////////////////////////// #ifdef O_BINARY #define SPH_O_BINARY O_BINARY #else #define SPH_O_BINARY 0 #endif #define SPH_O_READ ( O_RDONLY | SPH_O_BINARY ) #define SPH_O_NEW ( O_CREAT | O_RDWR | O_TRUNC | SPH_O_BINARY ) #define MVA_DOWNSIZE DWORD // MVA32 offset type #define MVA_OFFSET_MASK 0x7fffffffUL // MVA offset mask #define MVA_ARENA_FLAG 0x80000000UL // MVA global-arena flag inline uint64_t MVA_UPSIZE ( const DWORD * pMva ) { uint64_t uMva = (uint64_t)pMva[0] | ( ( (uint64_t)pMva[1] )<<32 ); return uMva; } /// file writer with write buffering and int encoder class CSphWriter : ISphNoncopyable { public: CSphWriter (); virtual ~CSphWriter (); void SetBufferSize ( int iBufferSize ); ///< tune write cache size; must be called before OpenFile() or SetFile() bool OpenFile ( const CSphString & sName, CSphString & sErrorBuffer ); void SetFile ( int iFD, SphOffset_t * pSharedOffset ); void CloseFile ( bool bTruncate = false ); ///< note: calls Flush(), ie. IsError() might get true after this call void PutByte ( int uValue ); void PutBytes ( const void * pData, int iSize ); void PutDword ( DWORD uValue ) { PutBytes ( &uValue, sizeof(DWORD) ); } void PutOffset ( SphOffset_t uValue ) { PutBytes ( &uValue, sizeof(SphOffset_t) ); } void PutString ( const char * szString ); void PutString ( const CSphString & sString ); void SeekTo ( SphOffset_t pos ); ///< seeking inside the buffer will truncate it #if USE_64BIT void PutDocid ( SphDocID_t uValue ) { PutOffset ( uValue ); } #else void PutDocid ( SphDocID_t uValue ) { PutDword ( uValue ); } #endif void ZipInt ( DWORD uValue ); void ZipOffset ( SphOffset_t uValue ); void ZipOffsets ( CSphVector * pData ); bool IsError () const { return m_bError; } SphOffset_t GetPos () const { return m_iPos; } protected: CSphString m_sName; SphOffset_t m_iPos; SphOffset_t m_iWritten; int m_iFD; int m_iPoolUsed; BYTE * m_pBuffer; BYTE * m_pPool; bool m_bOwnFile; SphOffset_t * m_pSharedOffset; int m_iBufferSize; bool m_bError; CSphString * m_pError; virtual void Flush (); }; /// file which closes automatically when going out of scope class CSphAutofile : ISphNoncopyable { protected: int m_iFD; ///< my file descriptior CSphString m_sFilename; ///< my file name bool m_bTemporary; ///< whether to unlink this file on Close() CSphIndex::ProgressCallback_t * m_pProgress; ///< for displaying progress CSphIndexProgress * m_pStat; public: CSphAutofile (); CSphAutofile ( const CSphString & sName, int iMode, CSphString & sError, bool bTemp=false ); ~CSphAutofile (); int Open ( const CSphString & sName, int iMode, CSphString & sError, bool bTemp=false ); void Close (); public: int GetFD () const { return m_iFD; } const char * GetFilename () const; SphOffset_t GetSize ( SphOffset_t iMinSize, bool bCheckSizeT, CSphString & sError ); SphOffset_t GetSize (); bool Read ( void * pBuf, size_t uCount, CSphString & sError ); void SetProgressCallback ( CSphIndex::ProgressCallback_t * pfnProgress, CSphIndexProgress * pStat ); }; /// file reader with read buffering and int decoder class CSphReader { public: CSphReader ( BYTE * pBuf=NULL, int iSize=0 ); virtual ~CSphReader (); void SetBuffers ( int iReadBuffer, int iReadUnhinted ); void SetFile ( int iFD, const char * sFilename ); void SetFile ( const CSphAutofile & tFile ); void Reset (); void SeekTo ( SphOffset_t iPos, int iSizeHint ); void SkipBytes ( int iCount ); SphOffset_t GetPos () const { return m_iPos+m_iBuffPos; } void GetBytes ( void * pData, int iSize ); int GetBytesZerocopy ( const BYTE ** ppData, int iMax ); ///< zerocopy method; returns actual length present in buffer (upto iMax) int GetByte (); DWORD GetDword (); SphOffset_t GetOffset (); CSphString GetString (); int GetLine ( char * sBuffer, int iMaxLen ); DWORD UnzipInt (); SphOffset_t UnzipOffset (); SphOffset_t Tell () const { return m_iPos + m_iBuffPos; } bool GetErrorFlag () const { return m_bError; } const CSphString & GetErrorMessage () const { return m_sError; } const CSphString & GetFilename() const { return m_sFilename; } #if USE_64BIT SphDocID_t GetDocid () { return GetOffset(); } SphDocID_t UnzipDocid () { return UnzipOffset(); } SphWordID_t UnzipWordid () { return UnzipOffset(); } #else SphDocID_t GetDocid () { return GetDword(); } SphDocID_t UnzipDocid () { return UnzipInt(); } SphWordID_t UnzipWordid () { return UnzipInt(); } #endif const CSphReader & operator = ( const CSphReader & rhs ); protected: int m_iFD; SphOffset_t m_iPos; int m_iBuffPos; int m_iBuffUsed; BYTE * m_pBuff; int m_iSizeHint; ///< how much do we expect to read int m_iBufSize; bool m_bBufOwned; int m_iReadUnhinted; bool m_bError; CSphString m_sError; CSphString m_sFilename; private: void UpdateCache (); }; /// scoped reader class CSphAutoreader : public CSphReader { public: CSphAutoreader ( BYTE * pBuf=NULL, int iSize=0 ) : CSphReader ( pBuf, iSize ) {} ~CSphAutoreader (); bool Open ( const CSphString & sFilename, CSphString & sError ); void Close (); SphOffset_t GetFilesize (); public: // added for DebugCheck() int GetFD () { return m_iFD; } }; ////////////////////////////////////////////////////////////////////////// /// per-query search context /// everything that index needs to compute/create to process the query class CSphQueryContext { public: // searching-only, per-query int m_iWeights; ///< search query field weights count int m_dWeights [ SPH_MAX_FIELDS ]; ///< search query field weights bool m_bLookupFilter; ///< row data lookup required at filtering stage bool m_bLookupSort; ///< row data lookup required at sorting stage ISphFilter * m_pFilter; ISphFilter * m_pWeightFilter; struct CalcItem_t { CSphAttrLocator m_tLoc; ///< result locator ESphAttr m_eType; ///< result type ISphExpr * m_pExpr; ///< evaluator (non-owned) }; CSphVector m_dCalcFilter; ///< items to compute for filtering CSphVector m_dCalcSort; ///< items to compute for sorting/grouping CSphVector m_dCalcFinal; ///< items to compute when finalizing result set const CSphVector * m_pOverrides; ///< overridden attribute values CSphVector m_dOverrideIn; CSphVector m_dOverrideOut; void * m_pIndexData; ///< backend specific data public: CSphQueryContext (); ~CSphQueryContext (); void BindWeights ( const CSphQuery * pQuery, const CSphSchema & tSchema, int iIndexWeight ); bool SetupCalc ( CSphQueryResult * pResult, const CSphSchema & tInSchema, const CSphSchema & tSchema, const DWORD * pMvaPool ); bool CreateFilters ( bool bFullscan, const CSphVector * pdFilters, const CSphSchema & tSchema, const DWORD * pMvaPool, CSphString & sError ); bool SetupOverrides ( const CSphQuery * pQuery, CSphQueryResult * pResult, const CSphSchema & tIndexSchema ); void CalcFilter ( CSphMatch & tMatch ) const; void CalcSort ( CSphMatch & tMatch ) const; void CalcFinal ( CSphMatch & tMatch ) const; // rt index bind pools at segment searching, not at time it setups context void SetStringPool ( const BYTE * pStrings ); void SetMVAPool ( const DWORD * pMva ); }; struct SphStringSorterRemap_t { CSphAttrLocator m_tSrc; CSphAttrLocator m_tDst; }; ISphExpr * sphSortSetupExpr ( const CSphString & sName, const CSphSchema & tIndexSchema ); bool sphSortGetStringRemap ( const CSphSchema & tSorterSchema, const CSphSchema & tIndexSchema, CSphVector & dAttrs ); void sphSortRemoveInternalAttrs ( CSphSchema & tSchema ); bool sphIsSortStringInternal ( const char * sColumnName ); ////////////////////////////////////////////////////////////////////////// bool sphWriteThrottled ( int iFD, const void * pBuf, int64_t iCount, const char * sName, CSphString & sError ); void SafeClose ( int & iFD ); void sphMergeStats ( CSphQueryResultMeta & tDstResult, const SmallStringHash_T & hSrc ); bool sphCheckQueryHeight ( const struct XQNode_t * pRoot, CSphString & sError ); void sphTransformExtendedQuery ( XQNode_t ** ppNode ); const BYTE * SkipQuoted ( const BYTE * p ); class ISphBinlog : ISphNoncopyable { public: virtual ~ISphBinlog () {} virtual void BinlogUpdateAttributes ( const char * sIndexName, int64_t iTID, const CSphAttrUpdate & tUpd ) = 0; virtual void NotifyIndexFlush ( const char * sIndexName, int64_t iTID, bool bShutdown ) = 0; }; ////////////////////////////////////////////////////////////////////////// /// memory tracker namespace Memory { enum Category_e { SPH_MEM_CORE, SPH_MEM_IDX_DISK, SPH_MEM_IDX_RT, SPH_MEM_IDX_RT_ACCUM, SPH_MEM_MMAPED, SPH_MEM_BINLOG, SPH_MEM_HANDLE_NONSQL, SPH_MEM_HANDLE_SQL, SPH_MEM_SEARCH_NONSQL, SPH_MEM_QUERY_NONSQL, SPH_MEM_INSERT_SQL, SPH_MEM_SELECT_SQL, SPH_MEM_DELETE_SQL, SPH_MEM_COMMIT_SET_SQL, SPH_MEM_COMMIT_BEGIN_SQL, SPH_MEM_COMMIT_SQL, SPH_MEM_IDX_DISK_MULTY_QUERY, SPH_MEM_IDX_DISK_MULTY_QUERY_EX, SPH_MEM_IDX_RT_MULTY_QUERY, SPH_MEM_IDX_RT_RES_MATCHES, SPH_MEM_IDX_RT_RES_STRINGS, SPH_MEM_TOTAL }; } #if SPH_ALLOCS_PROFILER void sphMemStatPush ( Memory::Category_e eCategory ); void sphMemStatPop ( Memory::Category_e eCategory ); // memory tracker struct MemTracker_c : ISphNoncopyable { const Memory::Category_e m_eCategory; ///< category /// ctor explicit MemTracker_c ( Memory::Category_e eCategory ) : m_eCategory ( eCategory ) { sphMemStatPush ( m_eCategory ); } /// dtor ~MemTracker_c () { sphMemStatPop ( m_eCategory ); } }; #define MEMORY(name) MemTracker_c tracker_##__LINE__##name(Memory::name); #else // SPH_ALLOCS_PROFILER 0 #define MEMORY(name) #endif // if SPH_ALLOCS_PROFILER ////////////////////////////////////////////////////////////////////////// #define DOCINFO_INDEX_FREQ 128 // FIXME? make this configurable struct CSphDocMVA { SphDocID_t m_iDocID; CSphVector < CSphVector > m_dMVA; CSphVector < DWORD > m_dOffsets; explicit CSphDocMVA ( int iSize ) : m_iDocID ( 0 ) { m_dMVA.Resize ( iSize ); m_dOffsets.Resize ( iSize ); } void Read ( CSphReader & tReader ); void Write ( CSphWriter & tWriter ); }; /// attr min-max builder template < typename DOCID = SphDocID_t > class AttrIndexBuilder_t : ISphNoncopyable { private: CSphVector m_dIntAttrs; CSphVector m_dFloatAttrs; CSphVector m_dMvaAttrs; CSphVector m_dIntMin; CSphVector m_dIntMax; CSphVector m_dIntIndexMin; CSphVector m_dIntIndexMax; CSphVector m_dFloatMin; CSphVector m_dFloatMax; CSphVector m_dFloatIndexMin; CSphVector m_dFloatIndexMax; CSphVector m_dMvaMin; CSphVector m_dMvaMax; CSphVector m_dMvaIndexMin; CSphVector m_dMvaIndexMax; DWORD m_uStride; // size of attribute's chunk (in DWORDs) DWORD m_uElements; // counts total number of collected min/max pairs int m_iLoop; // loop inside one set DWORD * m_pOutBuffer; // storage for collected min/max DWORD * m_pOutMax; // storage max for bound checking DOCID m_uStart; // first and last docids of current chunk DOCID m_uLast; DOCID m_uIndexStart; // first and last docids of whole index DOCID m_uIndexLast; int m_iMva64; private: void ResetLocal(); void FlushComputed ( bool bUseAttrs, bool bUseMvas ); void UpdateMinMaxDocids ( DOCID uDocID ); void CollectRowMVA ( int iAttr, DWORD uCount, const DWORD * pMva ); public: explicit AttrIndexBuilder_t ( const CSphSchema & tSchema ); void Prepare ( DWORD * pOutBuffer, DWORD * pOutMax ); void CollectWithoutMvas ( const DWORD * pCur, bool bUseMvas ); bool Collect ( const DWORD * pCur, const DWORD * pMvas, int64_t iMvasCount, CSphString & sError ); void Collect ( const DWORD * pCur, const struct CSphDocMVA & dMvas ); void CollectMVA ( DOCID uDocID, const CSphVector< CSphVector > & dCurInfo ); void FinishCollect ( bool bMvaOnly = false ); /// actually used part of output buffer, only used with index merge /// (we reserve space for rows from both indexes, but might kill some rows) inline DWORD GetActualSize() const { return 2 * m_uElements * m_uStride; } /// how many DWORDs will we need for block index inline DWORD GetExpectedSize ( DWORD uMaxDocs ) const { DWORD uDocinfoIndex = ( uMaxDocs + DOCINFO_INDEX_FREQ - 1 ) / DOCINFO_INDEX_FREQ; return 2 * ( 1 + uDocinfoIndex ) * m_uStride; } }; typedef AttrIndexBuilder_t<> AttrIndexBuilder_c; // dirty hack for some build systems which not has LLONG_MAX #ifndef LLONG_MAX #define LLONG_MAX (((unsigned long long)(-1))>>1) #endif template < typename DOCID > void AttrIndexBuilder_t::ResetLocal() { ARRAY_FOREACH ( i, m_dIntMin ) { m_dIntMin[i] = LLONG_MAX; m_dIntMax[i] = 0; } ARRAY_FOREACH ( i, m_dFloatMin ) { m_dFloatMin[i] = FLT_MAX; m_dFloatMax[i] = -FLT_MAX; } ARRAY_FOREACH ( i, m_dMvaMin ) { m_dMvaMin[i] = LLONG_MAX; m_dMvaMax[i] = 0; } m_uStart = m_uLast = 0; m_iLoop = 0; } template < typename DOCID > void AttrIndexBuilder_t::FlushComputed ( bool bUseAttrs, bool bUseMvas ) { assert ( m_pOutBuffer ); DWORD * pMinEntry = m_pOutBuffer + 2 * m_uElements * m_uStride; DWORD * pMinAttrs = DOCINFO2ATTRS ( pMinEntry ); DWORD * pMaxEntry = pMinEntry + m_uStride; DWORD * pMaxAttrs = pMinAttrs + m_uStride; assert ( pMaxEntry+m_uStride<=m_pOutMax ); assert ( pMaxAttrs+m_uStride-DOCINFO_IDSIZE<=m_pOutMax ); m_uIndexLast = m_uLast; DOCINFOSETID ( pMinEntry, m_uStart ); DOCINFOSETID ( pMaxEntry, m_uLast ); if ( bUseAttrs ) { ARRAY_FOREACH ( i, m_dIntAttrs ) { m_dIntIndexMin[i] = Min ( m_dIntIndexMin[i], m_dIntMin[i] ); m_dIntIndexMax[i] = Max ( m_dIntIndexMax[i], m_dIntMax[i] ); sphSetRowAttr ( pMinAttrs, m_dIntAttrs[i], m_dIntMin[i] ); sphSetRowAttr ( pMaxAttrs, m_dIntAttrs[i], m_dIntMax[i] ); } ARRAY_FOREACH ( i, m_dFloatAttrs ) { m_dFloatIndexMin[i] = Min ( m_dFloatIndexMin[i], m_dFloatMin[i] ); m_dFloatIndexMax[i] = Max ( m_dFloatIndexMax[i], m_dFloatMax[i] ); sphSetRowAttr ( pMinAttrs, m_dFloatAttrs[i], sphF2DW ( m_dFloatMin[i] ) ); sphSetRowAttr ( pMaxAttrs, m_dFloatAttrs[i], sphF2DW ( m_dFloatMax[i] ) ); } } if ( bUseMvas ) ARRAY_FOREACH ( i, m_dMvaAttrs ) { m_dMvaIndexMin[i] = Min ( m_dMvaIndexMin[i], m_dMvaMin[i] ); m_dMvaIndexMax[i] = Max ( m_dMvaIndexMax[i], m_dMvaMax[i] ); sphSetRowAttr ( pMinAttrs, m_dMvaAttrs[i], m_dMvaMin[i] ); sphSetRowAttr ( pMaxAttrs, m_dMvaAttrs[i], m_dMvaMax[i] ); } m_uElements++; ResetLocal(); } template < typename DOCID > void AttrIndexBuilder_t::UpdateMinMaxDocids ( DOCID uDocID ) { if ( !m_uStart ) m_uStart = uDocID; if ( !m_uIndexStart ) m_uIndexStart = uDocID; m_uLast = uDocID; } template < typename DOCID > AttrIndexBuilder_t::AttrIndexBuilder_t ( const CSphSchema & tSchema ) : m_uStride ( DWSIZEOF(DOCID) + tSchema.GetRowSize() ) , m_uElements ( 0 ) , m_iLoop ( 0 ) , m_pOutBuffer ( NULL ) , m_pOutMax ( NULL ) , m_uStart ( 0 ) , m_uLast ( 0 ) , m_uIndexStart ( 0 ) , m_uIndexLast ( 0 ) { for ( int i=0; i void AttrIndexBuilder_t::Prepare ( DWORD * pOutBuffer, DWORD * pOutMax ) { m_pOutBuffer = pOutBuffer; m_pOutMax = pOutMax; m_uElements = 0; m_uIndexStart = m_uIndexLast = 0; ARRAY_FOREACH ( i, m_dIntIndexMin ) { m_dIntIndexMin[i] = LLONG_MAX; m_dIntIndexMax[i] = 0; } ARRAY_FOREACH ( i, m_dFloatIndexMin ) { m_dFloatIndexMin[i] = FLT_MAX; m_dFloatIndexMax[i] = -FLT_MAX; } ARRAY_FOREACH ( i, m_dMvaIndexMin ) { m_dMvaIndexMin[i] = LLONG_MAX; m_dMvaIndexMax[i] = 0; } ResetLocal(); } template < typename DOCID > void AttrIndexBuilder_t::CollectWithoutMvas ( const DWORD * pCur, bool bUseMvas ) { // check if it is time to flush already collected values if ( m_iLoop>=DOCINFO_INDEX_FREQ ) FlushComputed ( true, bUseMvas ); const DWORD * pRow = DOCINFO2ATTRS_T(pCur); UpdateMinMaxDocids ( DOCINFO2ID_T(pCur) ); m_iLoop++; // ints ARRAY_FOREACH ( i, m_dIntAttrs ) { SphAttr_t uVal = sphGetRowAttr ( pRow, m_dIntAttrs[i] ); m_dIntMin[i] = Min ( m_dIntMin[i], uVal ); m_dIntMax[i] = Max ( m_dIntMax[i], uVal ); } // floats ARRAY_FOREACH ( i, m_dFloatAttrs ) { float fVal = sphDW2F ( (DWORD)sphGetRowAttr ( pRow, m_dFloatAttrs[i] ) ); m_dFloatMin[i] = Min ( m_dFloatMin[i], fVal ); m_dFloatMax[i] = Max ( m_dFloatMax[i], fVal ); } } template < typename DOCID > void AttrIndexBuilder_t::CollectRowMVA ( int iAttr, DWORD uCount, const DWORD * pMva ) { if ( iAttr>=m_iMva64 ) { assert ( ( uCount%2 )==0 ); for ( ; uCount>0; uCount-=2, pMva+=2 ) { uint64_t uVal = MVA_UPSIZE ( pMva ); m_dMvaMin[iAttr] = Min ( m_dMvaMin[iAttr], uVal ); m_dMvaMax[iAttr] = Max ( m_dMvaMax[iAttr], uVal ); } } else { for ( ; uCount>0; uCount--, pMva++ ) { DWORD uVal = *pMva; m_dMvaMin[iAttr] = Min ( m_dMvaMin[iAttr], uVal ); m_dMvaMax[iAttr] = Max ( m_dMvaMax[iAttr], uVal ); } } } template < typename DOCID > bool AttrIndexBuilder_t::Collect ( const DWORD * pCur, const DWORD * pMvas, int64_t iMvasCount, CSphString & sError ) { CollectWithoutMvas ( pCur, true ); const DWORD * pRow = DOCINFO2ATTRS_T(pCur); SphDocID_t uDocID = DOCINFO2ID_T(pCur); // MVAs ARRAY_FOREACH ( i, m_dMvaAttrs ) { SphAttr_t uOff = sphGetRowAttr ( pRow, m_dMvaAttrs[i] ); if ( !uOff ) continue; // sanity checks if ( uOff>=iMvasCount ) { sError.SetSprintf ( "broken index: mva offset out of bounds, id=" DOCID_FMT, (SphDocID_t)uDocID ); return false; } const DWORD * pMva = pMvas + uOff; // don't care about updates at this point if ( i==0 && DOCINFO2ID_T ( pMva-DWSIZEOF(DOCID) )!=uDocID ) { sError.SetSprintf ( "broken index: mva docid verification failed, id=" DOCID_FMT, (SphDocID_t)uDocID ); return false; } DWORD uCount = *pMva; if ( ( uOff+uCount>=iMvasCount ) || ( i>=m_iMva64 && ( uCount%2 )!=0 ) ) { sError.SetSprintf ( "broken index: mva list out of bounds, id=" DOCID_FMT, (SphDocID_t)uDocID ); return false; } // walk and calc CollectRowMVA ( i, uCount, pMva ); } return true; } template < typename DOCID > void AttrIndexBuilder_t::Collect ( const DWORD * pCur, const CSphDocMVA & dMvas ) { CollectWithoutMvas ( pCur, true ); ARRAY_FOREACH ( i, m_dMvaAttrs ) { CollectRowMVA ( i, dMvas.m_dMVA[i].GetLength(), dMvas.m_dMVA[i].Begin() ); } } template < typename DOCID > void AttrIndexBuilder_t::CollectMVA ( DOCID uDocID, const CSphVector< CSphVector > & dCurInfo ) { // check if it is time to flush already collected values if ( m_iLoop>=DOCINFO_INDEX_FREQ ) FlushComputed ( false, true ); UpdateMinMaxDocids ( uDocID ); m_iLoop++; ARRAY_FOREACH ( i, dCurInfo ) { CollectRowMVA ( i, dCurInfo[i].GetLength(), dCurInfo[i].Begin() ); } } template < typename DOCID > void AttrIndexBuilder_t::FinishCollect ( bool bMvaOnly ) { assert ( m_pOutBuffer ); if ( m_iLoop ) FlushComputed ( !bMvaOnly, true ); DWORD * pMinEntry = m_pOutBuffer + 2 * m_uElements * m_uStride; DWORD * pMaxEntry = pMinEntry + m_uStride; CSphRowitem * pMinAttrs = DOCINFO2ATTRS_T ( pMinEntry ); CSphRowitem * pMaxAttrs = DOCINFO2ATTRS_T ( pMaxEntry ); assert ( pMaxEntry+m_uStride<=m_pOutMax ); assert ( pMaxAttrs+m_uStride-DWSIZEOF(DOCID)<=m_pOutMax ); DOCINFOSETID ( pMinEntry, m_uIndexStart ); DOCINFOSETID ( pMaxEntry, m_uIndexLast ); ARRAY_FOREACH ( i, m_dMvaAttrs ) { sphSetRowAttr ( pMinAttrs, m_dMvaAttrs[i], m_dMvaIndexMin[i] ); sphSetRowAttr ( pMaxAttrs, m_dMvaAttrs[i], m_dMvaIndexMax[i] ); } if ( !bMvaOnly ) { ARRAY_FOREACH ( i, m_dIntAttrs ) { sphSetRowAttr ( pMinAttrs, m_dIntAttrs[i], m_dIntIndexMin[i] ); sphSetRowAttr ( pMaxAttrs, m_dIntAttrs[i], m_dIntIndexMax[i] ); } ARRAY_FOREACH ( i, m_dFloatAttrs ) { sphSetRowAttr ( pMinAttrs, m_dFloatAttrs[i], sphF2DW ( m_dFloatIndexMin[i] ) ); sphSetRowAttr ( pMaxAttrs, m_dFloatAttrs[i], sphF2DW ( m_dFloatIndexMax[i] ) ); } m_uElements++; } else { m_uElements = 0; // rewind back for collecting the rest of attributes. } } ////////////////////////////////////////////////////////////////////////// /// find a value-enclosing span in a sorted vector (aka an index at which vec[i] <= val < vec[i+1]) template < typename T > static int FindSpan ( const CSphVector & dVec, T tRef, int iSmallTreshold=8 ) { // empty vector if ( !dVec.GetLength() ) return -1; // check last semi-span if ( dVec.Last()1 ) { if ( tRef<*pStart || *pEnd>= iBits; } iBits >>= 1; uMask >>= iBits; } return iIdx; } ////////////////////////////////////////////////////////////////////////// /// decode UTF-8 codepoint /// advances buffer ptr in all cases but end of buffer /// /// returns -1 on failure /// returns 0 on end of buffer /// returns codepoint on success inline int sphUTF8Decode ( BYTE * & pBuf ) { BYTE v = *pBuf; if ( !v ) return 0; pBuf++; // check for 7-bit case if ( v<128 ) return v; // get number of bytes int iBytes = 0; while ( v & 0x80 ) { iBytes++; v <<= 1; } // check for valid number of bytes if ( iBytes<2 || iBytes>4 ) return -1; int iCode = ( v >> iBytes ); iBytes--; do { if ( !(*pBuf) ) return 0; // unexpected eof if ( ((*pBuf) & 0xC0)!=0x80 ) return -1; // invalid code iCode = ( iCode<<6 ) + ( (*pBuf) & 0x3F ); iBytes--; pBuf++; } while ( iBytes ); // all good return iCode; } /// encode UTF-8 codepoint to buffer /// returns number of bytes used inline int sphUTF8Encode ( BYTE * pBuf, int iCode ) { if ( iCode<0x80 ) { pBuf[0] = (BYTE)( iCode & 0x7F ); return 1; } else if ( iCode<0x800 ) { pBuf[0] = (BYTE)( ( (iCode>>6) & 0x1F ) | 0xC0 ); pBuf[1] = (BYTE)( ( iCode & 0x3F ) | 0x80 ); return 2; } else { pBuf[0] = (BYTE)( ( (iCode>>12) & 0x0F ) | 0xE0 ); pBuf[1] = (BYTE)( ( (iCode>>6) & 0x3F ) | 0x80 ); pBuf[2] = (BYTE)( ( iCode & 0x3F ) | 0x80 ); return 3; } } /// compute UTF-8 string length in codepoints inline int sphUTF8Len ( const char * pStr ) { BYTE * pBuf = (BYTE*) pStr; int iRes = 0, iCode; while ( ( iCode = sphUTF8Decode(pBuf) )!=0 ) if ( iCode>0 ) iRes++; return iRes; } /// compute UTF-8 string length in codepoints inline int sphUTF8Len ( const char * pStr, int iMax ) { BYTE * pBuf = (BYTE*) pStr; BYTE * pMax = pBuf + iMax; int iRes = 0; while ( pBuf=2 ); assert ( sEscaped[0]=='\'' ); assert ( sEscaped[iLen-1]=='\'' ); // skip heading and trailing quotes const char * s = sEscaped+1; const char * sMax = s+iLen-2; sRes.Reserve ( iLen ); char * d = (char*) sRes.cstr(); while ( s & dDynamize ) = 0; }; ////////////////////////////////////////////////////////////////////////// /// dict traits class CSphDictTraits : public CSphDict { public: explicit CSphDictTraits ( CSphDict * pDict ) : m_pDict ( pDict ) { assert ( m_pDict ); } virtual void LoadStopwords ( const char * sFiles, ISphTokenizer * pTokenizer ) { m_pDict->LoadStopwords ( sFiles, pTokenizer ); } virtual bool LoadWordforms ( const char * sFile, ISphTokenizer * pTokenizer, const char * sIndex ) { return m_pDict->LoadWordforms ( sFile, pTokenizer, sIndex ); } virtual bool SetMorphology ( const char * szMorph, bool bUseUTF8, CSphString & sError ) { return m_pDict->SetMorphology ( szMorph, bUseUTF8, sError ); } virtual SphWordID_t GetWordID ( const BYTE * pWord, int iLen, bool bFilterStops ) { return m_pDict->GetWordID ( pWord, iLen, bFilterStops ); } virtual void Setup ( const CSphDictSettings & ) {} virtual const CSphDictSettings & GetSettings () const { return m_pDict->GetSettings (); } virtual const CSphVector & GetStopwordsFileInfos () { return m_pDict->GetStopwordsFileInfos (); } virtual const CSphSavedFile & GetWordformsFileInfo () { return m_pDict->GetWordformsFileInfo (); } virtual const CSphMultiformContainer * GetMultiWordforms () const { return m_pDict->GetMultiWordforms (); } virtual bool IsStopWord ( const BYTE * pWord ) const { return m_pDict->IsStopWord ( pWord ); } protected: CSphDict * m_pDict; }; /// dict wrapper for star-syntax support in prefix-indexes class CSphDictStar : public CSphDictTraits { public: explicit CSphDictStar ( CSphDict * pDict ) : CSphDictTraits ( pDict ) {} virtual SphWordID_t GetWordID ( BYTE * pWord ); virtual SphWordID_t GetWordIDNonStemmed ( BYTE * pWord ); }; /// star dict for index v.8+ class CSphDictStarV8 : public CSphDictStar { public: CSphDictStarV8 ( CSphDict * pDict, bool bPrefixes, bool bInfixes ); virtual SphWordID_t GetWordID ( BYTE * pWord ); private: bool m_bPrefixes; bool m_bInfixes; }; /// dict wrapper for exact-word syntax class CSphDictExact : public CSphDictTraits { public: explicit CSphDictExact ( CSphDict * pDict ) : CSphDictTraits ( pDict ) {} virtual SphWordID_t GetWordID ( BYTE * pWord ); }; #endif // _sphinxint_ // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxmetaphone.cpp100777 0 0 42164 11643565732 15215 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxint.h" struct CurrentWord_t { BYTE * pWord; int iLength; int iLengthPadded; }; static bool IsVowel ( BYTE c ) { return c=='A' || c=='E' || c=='I' || c=='O' || c=='U' || c=='Y'; } static bool SlavoGermanic ( BYTE * pString ) { // OPTIMIZE! char * szWord = (char *) pString; if ( strstr ( szWord, "W" ) ) return true; if ( strstr ( szWord, "K" ) ) return true; if ( strstr ( szWord, "CZ" ) ) return true; if ( strstr ( szWord, "WITZ" ) ) return true; return false; } static bool StrAt ( const CurrentWord_t & Word, int iStart, int iLength, const char * szStr1 ) { if ( iStart<0 || iStart>=Word.iLengthPadded ) return false; char * szPos = (char *)Word.pWord + iStart; return !strncmp ( szPos, szStr1, iLength ); } static bool StrAt ( const CurrentWord_t & Word, int iStart, int iLength, const char * szStr1, const char * szStr2 ) { if ( iStart<0 || iStart>=Word.iLengthPadded ) return false; char * szPos = (char *)Word.pWord + iStart; return !strncmp ( szPos, szStr1, iLength ) || !strncmp ( szPos, szStr2, iLength ); } static bool StrAt ( const CurrentWord_t & Word, int iStart, int iLength, const char * szStr1, const char * szStr2, const char * szStr3 ) { if ( iStart<0 || iStart>=Word.iLengthPadded ) return false; char * szPos = (char *)Word.pWord + iStart; return !strncmp ( szPos, szStr1, iLength ) || !strncmp ( szPos, szStr2, iLength ) || !strncmp ( szPos, szStr3, iLength ); } static bool StrAt ( const CurrentWord_t & Word, int iStart, int iLength, const char * szStr1, const char * szStr2, const char * szStr3, const char * szStr4 ) { if ( iStart<0 || iStart>=Word.iLengthPadded ) return false; char * szPos = (char *)Word.pWord + iStart; return !strncmp ( szPos, szStr1, iLength ) || !strncmp ( szPos, szStr2, iLength ) || !strncmp ( szPos, szStr3, iLength ) || !strncmp ( szPos, szStr4, iLength ); } static bool StrAt ( const CurrentWord_t & Word, int iStart, int iLength, const char * szStr1, const char * szStr2, const char * szStr3, const char * szStr4, const char * szStr5 ) { if ( iStart<0 || iStart>=Word.iLengthPadded ) return false; char * szPos = (char *)Word.pWord + iStart; return !strncmp ( szPos, szStr1, iLength ) || !strncmp ( szPos, szStr2, iLength ) || !strncmp ( szPos, szStr3, iLength ) || !strncmp ( szPos, szStr4, iLength ) || !strncmp ( szPos, szStr5, iLength ); } static void MetaphAdd ( BYTE * pPrimary, BYTE * pSecondary, const char * szAddPrimary, const char * szAddSecondary ) { strcat ( (char*)pPrimary, szAddPrimary ); // NOLINT strcat ( (char*)pSecondary, szAddSecondary ); // NOLINT } #define ADD_RET(prim,sec,adv)\ {\ MetaphAdd ( sPrimary, sSecondary, prim, sec );\ return (adv);\ } #define ADD(prim,sec)\ MetaphAdd ( sPrimary, sSecondary, prim, sec ) static int ProcessCode ( int iCode, int iCur, CurrentWord_t & Word, BYTE * sPrimary, BYTE * sSecondary ) { BYTE * pWord = Word.pWord; // codepoints, not bytes int iAdvance = 1; // bytes, not codepoints int iLast = Word.iLength - 1; switch ( iCode ) { case 'A': case 'E': case 'I': case 'O': case 'U': case 'Y': // all init vowels now map to 'A' if ( !iCur ) ADD ( "A", "A" ); break; case 'B': // "-mb", e.g", "dumb", already skipped over... ADD_RET ( "P", "P", ( pWord[iCur+1]=='B' ) ? 2 : 1 ) case 0xC7: case 0xE7: ADD_RET ( "S", "S", 1 ) case 'C': // various germanic if ( iCur > 1 && !IsVowel ( pWord[iCur-2] ) && StrAt ( Word, iCur-1, 3, "ACH" ) && ( pWord[iCur+2]!='I' && ( pWord[iCur+2]!='E' || StrAt ( Word, iCur-2, 6, "BACHER", "MACHER" ) ) ) ) ADD_RET ( "K", "K", 2 ) // special case 'caesar' if ( iCur==0 && StrAt ( Word, 0, 6, "CAESAR" ) ) ADD_RET ( "S", "S", 2 ) // italian 'chianti' if ( StrAt ( Word, iCur, 4, "CHIA" ) ) ADD_RET ( "K", "K", 2 ) if ( StrAt ( Word, iCur, 2, "CH" ) ) { // find 'michael' if ( iCur > 0 && StrAt ( Word, iCur, 4, "CHAE" ) ) ADD_RET ( "K", "X", 2 ) // greek roots e.g. 'chemistry', 'chorus' if ( iCur==0 && ( StrAt ( Word, iCur+1, 5, "HARAC", "HARIS" ) || StrAt ( Word, iCur+1, 3, "HOR", "HYM", "HIA", "HEM" ) ) && !StrAt ( Word, 0, 5, "CHORE" ) ) ADD_RET ( "K", "K", 2 ) // germanic, greek, or otherwise 'ch' for 'kh' sound if ( ( StrAt ( Word, 0, 4, "VAN ", "VON " ) || StrAt ( Word, 0, 3, "SCH" ) ) // 'architect but not 'arch', 'orchestra', 'orchid' || StrAt ( Word, iCur-2, 6, "ORCHES", "ARCHIT", "ORCHID" ) || StrAt ( Word, iCur+2, 1, "T", "S" ) || ( ( StrAt ( Word, iCur-1, 1, "A", "O", "U", "E" ) || iCur==0 ) // e.g., 'wachtler', 'wechsler', but not 'tichner' && ( StrAt ( Word, iCur+2, 1, "L", "R", "N", "M" ) || StrAt ( Word, iCur+2, 1, "B", "H", "F", "V" ) || StrAt ( Word, iCur+2, 1, "W", " " ) ) ) ) { ADD ( "K", "K" ); } else { if ( iCur > 0 ) { if ( StrAt ( Word, 0, 2, "MC" ) ) // e.g., "McHugh" ADD ( "K", "K" ); else ADD ( "X", "K" ); } else ADD ( "X", "X" ); } return 2; } // e.g, 'czerny' if ( StrAt ( Word, iCur, 2, "CZ" ) && !StrAt ( Word, iCur-2, 4, "WICZ" ) ) ADD_RET ( "S", "X", 2 ) // e.g., 'focaccia' if ( StrAt ( Word, iCur+1, 3, "CIA" ) ) ADD_RET ( "X", "X", 3 ) // double 'C', but not if e.g. 'McClellan' if ( StrAt ( Word, iCur, 2, "CC" ) && !( iCur==1 && pWord[0]=='M' ) ) { // 'bellocchio' but not 'bacchus' if ( StrAt ( Word, iCur+2, 1, "I", "E", "H" ) && !StrAt ( Word, iCur+2, 2, "HU" ) ) { // 'accident', 'accede' 'succeed' if ( ( iCur==1 && pWord[iCur-1]=='A' ) || StrAt ( Word, iCur-1, 5, "UCCEE", "UCCES" ) ) ADD_RET ( "KS", "KS", 2 ) else // 'bacci', 'bertucci', other italian ADD_RET ( "X", "X", 2 ) } else // Pierce's rule ADD_RET ( "K", "K", 2 ) } if ( StrAt ( Word, iCur, 2, "CK", "CG", "CQ" ) ) ADD_RET ( "K", "K", 2 ) if ( StrAt ( Word, iCur, 2, "CI", "CE", "CY" ) ) { // italian vs. english if ( StrAt ( Word, iCur, 3, "CIO", "CIE", "CIA" ) ) ADD_RET ( "S", "X", 2 ) else ADD_RET ( "S", "S", 2 ) } // else ADD ( "K", "K" ); // name sent in 'mac caffrey', 'mac gregor if ( StrAt ( Word, iCur+1, 2, " C", " Q", " G" ) ) return 3; else { if ( StrAt ( Word, iCur+1, 1, "C", "K", "Q" ) && !StrAt ( Word, iCur+1, 2, "CE", "CI" ) ) return 2; } break; case 'D': if ( StrAt ( Word, iCur, 2, "DG" ) ) { if ( StrAt ( Word, iCur+2, 1, "I", "E", "Y" ) ) // e.g. 'edge' ADD_RET ( "J", "J", 3 ) else // e.g. 'edgar' ADD_RET ( "TK", "TK", 2 ) } if ( StrAt ( Word, iCur, 2, "DT", "DD" ) ) ADD_RET ( "T", "T", 2 ) // else ADD_RET ( "T", "T", 1 ) case 'F': ADD_RET ( "F", "F", pWord[iCur+1]=='F' ? 2 : 1 ) case 'G': if ( pWord[iCur+1]=='H' ) { if ( iCur > 0 && !IsVowel ( pWord[iCur-1] ) ) ADD_RET ( "K", "K", 2 ) if ( iCur < 3 ) { // 'ghislane', ghiradelli if ( iCur==0 ) { if ( pWord[iCur+2]=='I' ) ADD_RET ( "J", "J", 2 ) else ADD_RET ( "K", "K", 2 ) } } // Parker's rule (with some further refinements) - e.g., 'hugh' if ( ( iCur > 1 && StrAt ( Word, iCur-2, 1, "B", "H", "D" ) ) || ( iCur > 2 && StrAt ( Word, iCur-3, 1, "B", "H", "D" ) ) // e.g., 'bough' || ( iCur > 3 && StrAt ( Word, iCur-4, 1, "B", "H" ) ) ) // e.g., 'broughton' return 2; else { // e.g., 'laugh', 'McLaughlin', 'cough', 'gough', 'rough', 'tough' if ( iCur > 2 && pWord[iCur-1]=='U' && StrAt ( Word, iCur-3, 1, "C", "G", "L", "R", "T" ) ) ADD ( "F", "F" ); else if ( iCur > 0 && pWord[iCur-1]!='I' ) ADD ( "K", "K" ); return 2; } } if ( pWord[iCur+1]=='N' ) { if ( iCur==1 && IsVowel ( pWord[0] ) && !SlavoGermanic ( pWord ) ) ADD ( "KN", "N" ); else // not e.g. 'cagney' if ( !StrAt ( Word, iCur+2, 2, "EY" ) && pWord[iCur+1]!='Y' && !SlavoGermanic ( pWord ) ) ADD ( "N", "KN" ); else ADD ( "KN", "KN" ); return 2; } // 'tagliaro' if ( StrAt ( Word, iCur+1, 2, "LI" ) && !SlavoGermanic ( pWord ) ) ADD_RET ( "KL", "L", 2 ) // -ges-,-gep-,-gel-, -gie- at beginning if ( iCur==0 && ( pWord[iCur+1]=='Y' || StrAt ( Word, iCur+1, 2, "ES", "EP", "EB", "EL" ) || StrAt ( Word, iCur+1, 2, "EY", "IB", "IL", "IN" ) || StrAt ( Word, iCur+1, 2, "IE", "EI", "ER" ) ) ) ADD_RET ( "K", "J", 2 ) // -ger-, -gy- if ( ( StrAt ( Word, iCur+1, 2, "ER" ) || pWord[iCur+1]=='Y' ) && !StrAt ( Word, 0, 6, "DANGER", "RANGER", "MANGER" ) && !StrAt ( Word, iCur-1, 1, "E", "I" ) && !StrAt ( Word, iCur-1, 3, "RGY", "OGY" ) ) ADD_RET ( "K", "J", 2 ) // italian e.g, 'biaggi' if ( StrAt ( Word, iCur+1, 1, "E", "I", "Y" ) || StrAt ( Word, iCur-1, 4, "AGGI", "OGGI" ) ) { // obvious germanic if ( StrAt ( Word, 0, 4, "VAN ", "VON " ) || StrAt ( Word, 0, 3, "SCH" ) || StrAt ( Word, iCur+1, 2, "ET" ) ) ADD ( "K", "K" ); else { // always soft if french ending if ( StrAt ( Word, iCur+1, 4, "IER " ) ) ADD ( "J", "J" ); else ADD ( "J", "K" ); } return 2; } ADD_RET ( "K", "K", pWord[iCur+1]=='G' ? 2 : 1 ) case 'H': // only keep if first & before vowel or btw. 2 vowels if ( ( iCur==0 || IsVowel ( pWord[iCur-1] ) ) && IsVowel ( pWord[iCur+1] ) ) ADD_RET ( "H", "H", 2 ) break; // also takes care of 'HH' case 'J': // obvious spanish, 'jose', 'san jacinto' if ( StrAt ( Word, iCur, 4, "JOSE" ) || StrAt ( Word, 0, 4, "SAN " ) ) { if ( ( iCur==0 && pWord[iCur+4]==' ' ) || StrAt ( Word, 0, 4, "SAN " ) ) ADD_RET ( "H", "H", 1 ) else ADD_RET ( "J", "H", 1 ) } if ( iCur==0 && !StrAt ( Word, iCur, 4, "JOSE" ) ) ADD ( "J", "A" ); // Yankelovich/Jankelowicz else { // spanish pron. of e.g. 'bajador' if ( ( iCur>0 && IsVowel ( pWord[iCur-1] ) )&& !SlavoGermanic ( pWord ) && ( pWord[iCur+1]=='A' || pWord[iCur+1]=='O' ) ) ADD ( "J", "H" ); else { if ( iCur==iLast ) ADD ( "J", "" ); else if ( !StrAt ( Word, iCur+1, 1, "L", "T", "K", "S" ) && !StrAt ( Word, iCur+1, 1, "N", "M", "B", "Z" ) && !StrAt ( Word, iCur-1, 1, "S", "K", "L" ) ) ADD ( "J", "J" ); } } if ( pWord[iCur+1]=='J' ) // it could happen! return 2; break; case 'K': ADD_RET ( "K", "K", pWord[iCur+1]=='K' ? 2 : 1 ) case 'L': if ( pWord[iCur+1]=='L' ) { // spanish e.g. 'cabrillo', 'gallegos' if ( ( iCur==iLast-2 && StrAt ( Word, iCur-1, 4, "ILLO", "ILLA", "ALLE" ) ) || ( ( StrAt ( Word, iLast - 1, 2, "AS", "OS" ) || StrAt ( Word, iLast, 1, "A", "O" ) ) && StrAt ( Word, iCur-1, 4, "ALLE" ) ) ) ADD_RET ( "L", "", 2 ) iAdvance = 2; } ADD ( "L", "L" ); break; case 'M': ADD ( "M", "M" ); // 'dumb','thumb' if ( ( StrAt ( Word, iCur-1, 3, "UMB" ) && ( iCur+1==iLast || StrAt ( Word, iCur+2, 2, "ER" ) ) ) || pWord[iCur+1]=='M' ) return 2; break; case 'N': ADD_RET ( "N", "N", pWord[iCur+1]=='N' ? 2 : 1 ) case 0xD1: case 0xF1: ADD_RET ( "N", "N", 1 ) case 'P': if ( pWord[iCur+1]=='H' ) ADD_RET ( "F", "F", 2 ) // also account for "campbell", "raspberry" ADD_RET ( "P", "P", StrAt ( Word, iCur+1, 1, "P", "B" ) ? 2 : 1 ) case 'Q': ADD_RET ( "K", "K", pWord[iCur+1]=='Q' ? 2 : 1 ) case 'R': // french e.g. 'rogier', but exclude 'hochmeier' if ( iCur==iLast && !SlavoGermanic ( pWord ) && StrAt ( Word, iCur-2, 2, "IE" ) && !StrAt ( Word, iCur-4, 2, "ME", "MA" ) ) ADD ( "", "R" ); else ADD ( "R", "R" ); return pWord[iCur+1]=='R' ? 2 : 1; case 'S': // special cases 'island', 'isle', 'carlisle', 'carlysle' if ( StrAt ( Word, iCur-1, 3, "ISL", "YSL" ) ) return 1; // special case 'sugar-' if ( iCur==0 && StrAt ( Word, iCur, 5, "SUGAR" ) ) ADD_RET ( "X", "S", 1 ) if ( StrAt ( Word, iCur, 2, "SH" ) ) { // germanic if ( StrAt ( Word, iCur+1, 4, "HEIM", "HOEK", "HOLM", "HOLZ" ) ) ADD_RET ( "S", "S", 2 ) else ADD_RET ( "X", "X", 2 ) } // italian & armenian if ( StrAt ( Word, iCur, 3, "SIO", "SIA" ) || StrAt ( Word, iCur, 4, "SIAN" ) ) { if ( !SlavoGermanic ( pWord ) ) ADD_RET ( "S", "X", 3 ) else ADD_RET ( "S", "S", 3 ) } // german & anglicisations, e.g. 'smith' match 'schmidt', 'snider' match 'schneider' // also, -sz- in slavic language altho in hungarian it is pronounced 's' if ( ( iCur==0 && StrAt ( Word, iCur+1, 1, "M", "N", "L", "W" ) ) || StrAt ( Word, iCur+1, 1, "Z" ) ) ADD_RET ( "S", "X", StrAt ( Word, iCur+1, 1, "Z" ) ? 2 : 1 ) if ( StrAt ( Word, iCur, 2, "SC" ) ) { // Schlesinger's rule if ( pWord[iCur+2]=='H' ) { if ( StrAt ( Word, iCur+3, 2, "OO", "ER", "EN", "UY" ) || StrAt ( Word, iCur+3, 2, "ED", "EM" ) ) // dutch origin, e.g. 'school', 'schooner' { // 'schermerhorn', 'schenker' if ( StrAt ( Word, iCur+3, 2, "ER", "EN" ) ) ADD_RET ( "X", "SK", 3 ) else ADD_RET ( "SK", "SK", 3 ) } else { if ( iCur==0 && !IsVowel ( pWord[3] ) && pWord[3]!='W' ) ADD_RET ( "X", "S", 3 ) else ADD_RET ( "X", "X", 3 ) } } if ( StrAt ( Word, iCur+2, 1, "I", "E", "Y" ) ) ADD_RET ( "S", "S", 3 ) // else ADD_RET ( "SK", "SK", 3 ) } // french e.g. 'resnais', 'artois' if ( iCur==iLast && StrAt ( Word, iCur-2, 2, "AI", "OI" ) ) ADD ( "", "S" ); else ADD ( "S", "S" ); return StrAt ( Word, iCur+1, 1, "S", "Z" ) ? 2 : 1; case 'T': if ( StrAt ( Word, iCur, 4, "TION" ) ) ADD_RET ( "X", "X", 3 ) if ( StrAt ( Word, iCur, 3, "TIA", "TCH" ) ) ADD_RET ( "X", "X", 3 ) if ( StrAt ( Word, iCur, 2, "TH" ) || StrAt ( Word, iCur, 3, "TTH" ) ) { // special case 'thomas', 'thames' or germanic if ( StrAt ( Word, iCur+2, 2, "OM", "AM" ) || StrAt ( Word, 0, 4, "VAN ", "VON " ) || StrAt ( Word, 0, 3, "SCH" ) ) ADD_RET ( "T", "T", 2 ) else ADD_RET ( "0", "T", 2 ) // yes, zero } ADD_RET ( "T", "T", StrAt ( Word, iCur+1, 1, "T", "D" ) ? 2 : 1 ) case 'V': ADD_RET ( "F", "F", pWord[iCur+1]=='V' ? 2 : 1 ) case 'W': // can also be in middle of word if ( StrAt ( Word, iCur, 2, "WR" ) ) ADD_RET ( "R", "R", 2 ) if ( iCur==0 && ( IsVowel ( pWord[iCur+1] ) || StrAt ( Word, iCur, 2, "WH" ) ) ) { // Wasserman should match Vasserman if ( IsVowel ( pWord[iCur+1] ) ) ADD ( "A", "F" ); else // need Uomo to match Womo ADD ( "A", "A" ); } // Arnow should match Arnoff if ( ( iCur==iLast && iCur > 0 && IsVowel ( pWord[iCur-1] ) ) || StrAt ( Word, iCur-1, 5, "EWSKI", "EWSKY", "OWSKI", "OWSKY" ) || StrAt ( Word, 0, 3, "SCH" ) ) ADD_RET ( "", "F", 1 ) // polish e.g. 'filipowicz' if ( StrAt ( Word, iCur, 4, "WICZ", "WITZ" ) ) ADD_RET ( "TS", "FX", 4 ) break; case 'X': // french e.g. breaux if ( !( iCur==iLast && ( StrAt ( Word, iCur-3, 3, "IAU", "EAU" ) || StrAt ( Word, iCur-2, 2, "AU", "OU" ) ) ) ) ADD ( "KS", "KS" ); return ( pWord[iCur+1]=='C' || pWord[iCur+1]=='X' ) ? 2 : 1; case 'Z': // chinese pinyin e.g. 'zhao' if ( pWord[iCur+1]=='H' ) ADD_RET ( "J", "J", 2 ) else if ( StrAt ( Word, iCur+1, 2, "ZO", "ZI", "ZA" ) || ( SlavoGermanic ( pWord ) && ( iCur > 0 && pWord[iCur-1]!='T' ) ) ) MetaphAdd ( sPrimary, sSecondary, "S", "TS" ); else MetaphAdd ( sPrimary, sSecondary, "S", "S" ); return pWord[iCur+1]=='Z' ? 2 : 1; } return iAdvance; } void stem_dmetaphone ( BYTE * pWord, bool bUTF8 ) { BYTE sOriginal [3*SPH_MAX_WORD_LEN+3]; BYTE sPrimary [3*SPH_MAX_WORD_LEN+3]; BYTE sSecondary [ 3*SPH_MAX_WORD_LEN+3 ]; int iLength = strlen ( (const char *)pWord ); memcpy ( sOriginal, pWord, iLength + 1 ); sPrimary[0] = '\0'; sSecondary[0] = '\0'; BYTE * pStart = sOriginal; while ( *pStart ) { if ( *pStart>='a' && *pStart<='z' ) *pStart = (BYTE) toupper ( *pStart ); ++pStart; } strcat ( (char *) sOriginal, " " ); // NOLINT int iAdvance = 0; CurrentWord_t Word; Word.pWord = sOriginal; Word.iLength = iLength; Word.iLengthPadded = strlen ( (const char *)sOriginal ); // skip these when at start of word if ( StrAt ( Word, 0, 2, "GN", "KN", "PN", "WR", "PS" ) ) iAdvance = 1; // Initial 'X' is pronounced 'Z' e.g. 'Xavier' if ( sOriginal[0]=='X' ) { ADD ( "S", "S" ); // 'Z' maps to 'S' iAdvance = 1; } BYTE * pPtr = sOriginal; BYTE * pLastPtr = sOriginal; int iCode = -1; if ( bUTF8 ) iCode = sphUTF8Decode ( pPtr ); while ( iCode!=0 ) { int iCur = ( bUTF8 ? pLastPtr : pPtr ) - sOriginal; if ( iCur>=iLength ) break; if ( bUTF8 ) { for ( int i = 0; i < iAdvance; ++i ) { pLastPtr = pPtr; iCode = sphUTF8Decode ( pPtr ); } } else { pPtr += iAdvance; iCode = *pPtr; } if ( iCode<=0 ) break; // unknown code: don't copy, just return if ( bUTF8 && iCode>128 && iCode!=0xC7 && iCode!=0xE7 && iCode!=0xD1 && iCode!=0xF1 ) return; iAdvance = ProcessCode ( iCode, ( bUTF8 ? pLastPtr : pPtr ) - sOriginal, Word, sPrimary, sSecondary ); } if ( !pWord[0] || sPrimary [0] ) strcpy ( (char*)pWord, (char*)sPrimary ); // NOLINT // TODO: handle secondary too } // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxql.l100777 0 0 12361 11643565732 13316 0%{ #include "yysphinxql.h" #if USE_WINDOWS #pragma warning(push,1) #endif // warning, lexer generator dependent! // this macro relies on that in flex yytext points to the actual location in the buffer #define YYSTOREBOUNDS \ { \ lvalp->m_iStart = yytext - pParser->m_pBuf; \ lvalp->m_iEnd = lvalp->m_iStart + yyleng; \ pParser->m_pLastTokenStart = yytext; \ } %} DIGIT [0-9] ID [a-zA-Z_][a-zA-Z_0-9]* SPACE [ \t\n\r] %option noyywrap %option nounput %option reentrant %x ccomment %% "/*" { BEGIN(ccomment); } . { } "*/" { BEGIN(INITIAL); } "AND" { YYSTOREBOUNDS; return TOK_AND; } "AS" { YYSTOREBOUNDS; return TOK_AS; } "ASC" { YYSTOREBOUNDS; return TOK_ASC; } "AVG" { YYSTOREBOUNDS; return TOK_AVG; } "BEGIN" { YYSTOREBOUNDS; return TOK_BEGIN; } "BETWEEN" { YYSTOREBOUNDS; return TOK_BETWEEN; } "BY" { YYSTOREBOUNDS; return TOK_BY; } "CALL" { YYSTOREBOUNDS; return TOK_CALL; } "COLLATION" { YYSTOREBOUNDS; return TOK_COLLATION; } "COMMIT" { YYSTOREBOUNDS; return TOK_COMMIT; } "COUNT" { YYSTOREBOUNDS; return TOK_COUNT; } "CREATE" { YYSTOREBOUNDS; return TOK_CREATE; } "DELETE" { YYSTOREBOUNDS; return TOK_DELETE; } "DESC" { YYSTOREBOUNDS; return TOK_DESC; } "DESCRIBE" { YYSTOREBOUNDS; return TOK_DESCRIBE; } "DISTINCT" { YYSTOREBOUNDS; return TOK_DISTINCT; } "DIV" { YYSTOREBOUNDS; return TOK_DIV; } "DROP" { YYSTOREBOUNDS; return TOK_DROP; } "FALSE" { YYSTOREBOUNDS; return TOK_FALSE; } "FLOAT" { YYSTOREBOUNDS; return TOK_FLOAT; } "FROM" { YYSTOREBOUNDS; return TOK_FROM; } "FUNCTION" { YYSTOREBOUNDS; return TOK_FUNCTION; } "GLOBAL" { YYSTOREBOUNDS; return TOK_GLOBAL; } "GROUP" { YYSTOREBOUNDS; return TOK_GROUP; } "ID" { YYSTOREBOUNDS; return TOK_ID; } "IN" { YYSTOREBOUNDS; return TOK_IN; } "INSERT" { YYSTOREBOUNDS; return TOK_INSERT; } "INT" { YYSTOREBOUNDS; return TOK_INT; } "INTO" { YYSTOREBOUNDS; return TOK_INTO; } "LIMIT" { YYSTOREBOUNDS; return TOK_LIMIT; } "MATCH" { YYSTOREBOUNDS; return TOK_MATCH; } "MAX" { YYSTOREBOUNDS; return TOK_MAX; } "META" { YYSTOREBOUNDS; return TOK_META; } "MIN" { YYSTOREBOUNDS; return TOK_MIN; } "MOD" { YYSTOREBOUNDS; return TOK_MOD; } "NAMES" { YYSTOREBOUNDS; return TOK_NAMES; } "NOT" { YYSTOREBOUNDS; return TOK_NOT; } "NULL" { YYSTOREBOUNDS; return TOK_NULL; } "OPTION" { YYSTOREBOUNDS; return TOK_OPTION; } "OR" { YYSTOREBOUNDS; return TOK_OR; } "ORDER" { YYSTOREBOUNDS; return TOK_ORDER; } "RAND" { YYSTOREBOUNDS; return TOK_RAND; } "REPLACE" { YYSTOREBOUNDS; return TOK_REPLACE; } "RETURNS" { YYSTOREBOUNDS; return TOK_RETURNS; } "ROLLBACK" { YYSTOREBOUNDS; return TOK_ROLLBACK; } "SELECT" { YYSTOREBOUNDS; return TOK_SELECT; } "SET" { YYSTOREBOUNDS; return TOK_SET; } "SESSION" { YYSTOREBOUNDS; return TOK_SESSION; } "SHOW" { YYSTOREBOUNDS; return TOK_SHOW; } "SONAME" { YYSTOREBOUNDS; return TOK_SONAME; } "START" { YYSTOREBOUNDS; return TOK_START; } "STATUS" { YYSTOREBOUNDS; return TOK_STATUS; } "SUM" { YYSTOREBOUNDS; return TOK_SUM; } "TABLES" { YYSTOREBOUNDS; return TOK_TABLES; } "TRANSACTION" { YYSTOREBOUNDS; return TOK_TRANSACTION; } "TRUE" { YYSTOREBOUNDS; return TOK_TRUE; } "UPDATE" { YYSTOREBOUNDS; return TOK_UPDATE; } "VALUES" { YYSTOREBOUNDS; return TOK_VALUES; } "VARIABLES" { YYSTOREBOUNDS; return TOK_VARIABLES; } "WARNINGS" { YYSTOREBOUNDS; return TOK_WARNINGS; } "WEIGHT" { YYSTOREBOUNDS; return TOK_WEIGHT; } "WHERE" { YYSTOREBOUNDS; return TOK_WHERE; } "WITHIN" { YYSTOREBOUNDS; return TOK_WITHIN; } "!=" { YYSTOREBOUNDS; return TOK_NE; } "<>" { YYSTOREBOUNDS; return TOK_NE; } "<=" { YYSTOREBOUNDS; return TOK_LTE; } ">=" { YYSTOREBOUNDS; return TOK_GTE; } ":=" { YYSTOREBOUNDS; return '='; } '([^'\\]|\\.|\\\\)*' { YYSTOREBOUNDS; SqlUnescape ( lvalp->m_sValue, yytext, yyleng ); return TOK_QUOTED_STRING; } {DIGIT}*\.{DIGIT}* { YYSTOREBOUNDS; lvalp->m_sValue = yytext; lvalp->m_fValue = (float)strtod ( yytext, NULL ); return TOK_CONST_FLOAT; } {DIGIT}+ { YYSTOREBOUNDS; lvalp->m_sValue = yytext; lvalp->m_iValue = strtoll ( yytext, NULL, 10 ); return TOK_CONST_INT; } "@id" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_ATIDENT; } "@weight" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_ATIDENT; } "@count" { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_ATIDENT; } {ID} { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_IDENT; } @{ID} { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_USERVAR; } @@{ID} { YYSTOREBOUNDS; lvalp->m_sValue = yytext; return TOK_SYSVAR; } `{ID}` { YYSTOREBOUNDS; lvalp->m_iStart++; lvalp->m_iEnd--; lvalp->m_sValue.SetBinary ( yytext+1, strlen(yytext)-2 ); return TOK_IDENT; } {SPACE}+ { ; } . { YYSTOREBOUNDS; return yytext[0]; } %% // warning, lexer generator dependent! // flex inserts trailing zero as needed into the buffer when lexing // but we need that rolled back when doing error reporting from yyerror void yylex_unhold ( yyscan_t yyscanner ) { struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; if ( YY_CURRENT_BUFFER ) { *yyg->yy_c_buf_p = yyg->yy_hold_char; YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; } } #if USE_WINDOWS #pragma warning(pop) #endif coreseek-4.1-beta/csft-4.1/src/sphinxql.y100777 0 0 46737 11643565732 13351 0%{ #if USE_WINDOWS #pragma warning(push,1) #pragma warning(disable:4702) // unreachable code #endif %} %lex-param { SqlParser_c * pParser } %parse-param { SqlParser_c * pParser } %pure-parser %error-verbose %token TOK_IDENT %token TOK_ATIDENT %token TOK_CONST_INT %token TOK_CONST_FLOAT %token TOK_CONST_MVA %token TOK_QUOTED_STRING %token TOK_USERVAR %token TOK_SYSVAR %token TOK_AS %token TOK_ASC %token TOK_AVG %token TOK_BEGIN %token TOK_BETWEEN %token TOK_BY %token TOK_CALL %token TOK_COLLATION %token TOK_COMMIT %token TOK_COUNT %token TOK_CREATE %token TOK_DELETE %token TOK_DESC %token TOK_DESCRIBE %token TOK_DISTINCT %token TOK_DIV %token TOK_DROP %token TOK_FALSE %token TOK_FLOAT %token TOK_FROM %token TOK_FUNCTION %token TOK_GLOBAL %token TOK_GROUP %token TOK_ID %token TOK_IN %token TOK_INSERT %token TOK_INT %token TOK_INTO %token TOK_LIMIT %token TOK_MATCH %token TOK_MAX %token TOK_META %token TOK_MIN %token TOK_MOD %token TOK_NAMES %token TOK_NULL %token TOK_OPTION %token TOK_ORDER %token TOK_RAND %token TOK_REPLACE %token TOK_RETURNS %token TOK_ROLLBACK %token TOK_SELECT %token TOK_SET %token TOK_SESSION %token TOK_SHOW %token TOK_SONAME %token TOK_START %token TOK_STATUS %token TOK_SUM %token TOK_TABLES %token TOK_TRANSACTION %token TOK_TRUE %token TOK_UPDATE %token TOK_VALUES %token TOK_VARIABLES %token TOK_WARNINGS %token TOK_WEIGHT %token TOK_WHERE %token TOK_WITHIN %type named_const_list %type udf_type %left TOK_OR %left TOK_AND %left '|' %left '&' %left '=' TOK_NE %left '<' '>' TOK_LTE TOK_GTE %left '+' '-' %left '*' '/' '%' TOK_DIV TOK_MOD %nonassoc TOK_NOT %nonassoc TOK_NEG %{ // some helpers #include // for FLT_MAX %} %% request: statement { pParser->PushQuery(); } | multi_stmt_list | multi_stmt_list ';' ; statement: insert_into | delete_from | set_clause | set_global_clause | transact_op | call_proc | describe | show_tables | update | show_variables | show_collation | create_function | drop_function ; ////////////////////////////////////////////////////////////////////////// multi_stmt_list: multi_stmt { pParser->PushQuery(); } | multi_stmt_list ';' multi_stmt { pParser->PushQuery(); } ; multi_stmt: select_from | show_clause ; select_from: TOK_SELECT select_items_list TOK_FROM ident_list opt_where_clause opt_group_clause opt_group_order_clause opt_order_clause opt_limit_clause opt_option_clause { pParser->m_pStmt->m_eStmt = STMT_SELECT; pParser->m_pQuery->m_sIndexes.SetBinary ( pParser->m_pBuf+$4.m_iStart, $4.m_iEnd-$4.m_iStart ); } ; select_items_list: select_item | select_items_list ',' select_item ; select_item: '*' { pParser->AddItem ( &$1 ); } | select_expr opt_alias ; opt_alias: // empty | TOK_IDENT { pParser->AliasLastItem ( &$1 ); } | TOK_AS TOK_IDENT { pParser->AliasLastItem ( &$2 ); } ; select_expr: expr { pParser->AddItem ( &$1 ); } | TOK_AVG '(' expr ')' { pParser->AddItem ( &$3, SPH_AGGR_AVG, &$1, &$4 ); } | TOK_MAX '(' expr ')' { pParser->AddItem ( &$3, SPH_AGGR_MAX, &$1, &$4 ); } | TOK_MIN '(' expr ')' { pParser->AddItem ( &$3, SPH_AGGR_MIN, &$1, &$4 ); } | TOK_SUM '(' expr ')' { pParser->AddItem ( &$3, SPH_AGGR_SUM, &$1, &$4 ); } | TOK_COUNT '(' '*' ')' { if ( !pParser->AddItem ( "count(*)", &$1, &$4 ) ) YYERROR; } | TOK_WEIGHT '(' ')' { if ( !pParser->AddItem ( "weight()", &$1, &$3 ) ) YYERROR; } | TOK_COUNT '(' TOK_DISTINCT TOK_IDENT ')' { if ( !pParser->AddDistinct ( &$4, &$1, &$5 ) ) YYERROR; } ; ident_list: TOK_IDENT | ident_list ',' TOK_IDENT { $$ = $1; $$.m_iEnd = $3.m_iEnd; } ; opt_where_clause: // empty | where_clause ; where_clause: TOK_WHERE where_expr ; where_expr: where_item | where_expr TOK_AND where_item ; where_item: TOK_MATCH '(' TOK_QUOTED_STRING ')' { if ( !pParser->SetMatch($3) ) YYERROR; } | expr_ident '=' const_int { CSphFilterSettings * pFilter = pParser->AddValuesFilter ( $1 ); if ( !pFilter ) YYERROR; pFilter->m_dValues.Add ( $3.m_iValue ); } | expr_ident TOK_NE const_int { CSphFilterSettings * pFilter = pParser->AddValuesFilter ( $1 ); if ( !pFilter ) YYERROR; pFilter->m_dValues.Add ( $3.m_iValue ); pFilter->m_bExclude = true; } | expr_ident TOK_IN '(' const_list ')' { CSphFilterSettings * pFilter = pParser->AddValuesFilter ( $1 ); if ( !pFilter ) YYERROR; pFilter->m_dValues = *$4.m_pValues.Ptr(); pFilter->m_dValues.Sort(); } | expr_ident TOK_NOT TOK_IN '(' const_list ')' { CSphFilterSettings * pFilter = pParser->AddValuesFilter ( $1 ); if ( !pFilter ) YYERROR; pFilter->m_dValues = *$5.m_pValues.Ptr(); pFilter->m_bExclude = true; pFilter->m_dValues.Sort(); } | expr_ident TOK_IN TOK_USERVAR { if ( !pParser->AddUservarFilter ( $1.m_sValue, $3.m_sValue, false ) ) YYERROR; } | expr_ident TOK_NOT TOK_IN TOK_USERVAR { if ( !pParser->AddUservarFilter ( $1.m_sValue, $3.m_sValue, true ) ) YYERROR; } | expr_ident TOK_BETWEEN const_int TOK_AND const_int { if ( !pParser->AddUintRangeFilter ( $1.m_sValue, $3.m_iValue, $5.m_iValue ) ) YYERROR; } | expr_ident '>' const_int { if ( !pParser->AddUintRangeFilter ( $1.m_sValue, $3.m_iValue+1, UINT_MAX ) ) YYERROR; } | expr_ident '<' const_int { if ( !pParser->AddUintRangeFilter ( $1.m_sValue, 0, $3.m_iValue-1 ) ) YYERROR; } | expr_ident TOK_GTE const_int { if ( !pParser->AddUintRangeFilter ( $1.m_sValue, $3.m_iValue, UINT_MAX ) ) YYERROR; } | expr_ident TOK_LTE const_int { if ( !pParser->AddUintRangeFilter ( $1.m_sValue, 0, $3.m_iValue ) ) YYERROR; } | expr_ident '=' const_float | expr_ident TOK_NE const_float | expr_ident '>' const_float | expr_ident '<' const_float { yyerror ( pParser, "only >=, <=, and BETWEEN floating-point filter types are supported in this version" ); YYERROR; } | expr_ident TOK_BETWEEN const_float TOK_AND const_float { if ( !pParser->AddFloatRangeFilter ( $1.m_sValue, $3.m_fValue, $5.m_fValue ) ) YYERROR; } | expr_ident TOK_GTE const_float { if ( !pParser->AddFloatRangeFilter ( $1.m_sValue, $3.m_fValue, FLT_MAX ) ) YYERROR; } | expr_ident TOK_LTE const_float { if ( !pParser->AddFloatRangeFilter ( $1.m_sValue, -FLT_MAX, $3.m_fValue ) ) YYERROR; } ; expr_ident: TOK_IDENT | TOK_ATIDENT { if ( !pParser->SetOldSyntax() ) YYERROR; } | TOK_COUNT '(' '*' ')' { $$.m_sValue = "@count"; if ( !pParser->SetNewSyntax() ) YYERROR; } | TOK_WEIGHT '(' ')' { $$.m_sValue = "@weight"; if ( !pParser->SetNewSyntax() ) YYERROR; } | TOK_ID { $$.m_sValue = "@id"; if ( !pParser->SetNewSyntax() ) YYERROR; } ; const_int: TOK_CONST_INT { $$.m_iInstype = TOK_CONST_INT; $$.m_iValue = $1.m_iValue; } | '-' TOK_CONST_INT { $$.m_iInstype = TOK_CONST_INT; $$.m_iValue = -$2.m_iValue; } ; const_float: TOK_CONST_FLOAT { $$.m_iInstype = TOK_CONST_FLOAT; $$.m_fValue = $1.m_fValue; } | '-' TOK_CONST_FLOAT { $$.m_iInstype = TOK_CONST_FLOAT; $$.m_fValue = -$2.m_fValue; } ; const_list: const_int { assert ( !$$.m_pValues.Ptr() ); $$.m_pValues = new RefcountedVector_c (); $$.m_pValues->Add ( $1.m_iValue ); } | const_list ',' const_int { $$.m_pValues->Add ( $3.m_iValue ); } ; opt_group_clause: // empty | group_clause ; group_clause: TOK_GROUP TOK_BY expr_ident { pParser->m_pQuery->m_eGroupFunc = SPH_GROUPBY_ATTR; pParser->m_pQuery->m_sGroupBy = $3.m_sValue; } ; opt_group_order_clause: // empty | group_order_clause ; group_order_clause: TOK_WITHIN TOK_GROUP TOK_ORDER TOK_BY order_items_list { pParser->m_pQuery->m_sSortBy.SetBinary ( pParser->m_pBuf+$5.m_iStart, $5.m_iEnd-$5.m_iStart ); } ; opt_order_clause: // empty | order_clause ; order_clause: TOK_ORDER TOK_BY order_items_list { pParser->m_pQuery->m_sOrderBy.SetBinary ( pParser->m_pBuf+$3.m_iStart, $3.m_iEnd-$3.m_iStart ); } | TOK_ORDER TOK_BY TOK_RAND '(' ')' { pParser->m_pQuery->m_sOrderBy = "@random"; } ; order_items_list: order_item | order_items_list ',' order_item { $$ = $1; $$.m_iEnd = $3.m_iEnd; } ; order_item: expr_ident | expr_ident TOK_ASC { $$ = $1; $$.m_iEnd = $2.m_iEnd; } | expr_ident TOK_DESC { $$ = $1; $$.m_iEnd = $2.m_iEnd; } ; opt_limit_clause: // empty | limit_clause ; limit_clause: TOK_LIMIT TOK_CONST_INT { pParser->m_pQuery->m_iOffset = 0; pParser->m_pQuery->m_iLimit = $2.m_iValue; } | TOK_LIMIT TOK_CONST_INT ',' TOK_CONST_INT { pParser->m_pQuery->m_iOffset = $2.m_iValue; pParser->m_pQuery->m_iLimit = $4.m_iValue; } ; opt_option_clause: // empty | option_clause ; option_clause: TOK_OPTION option_list ; option_list: option_item | option_list ',' option_item ; option_item: TOK_IDENT '=' TOK_IDENT { if ( !pParser->AddOption ( $1, $3 ) ) YYERROR; } | TOK_IDENT '=' TOK_CONST_INT { if ( !pParser->AddOption ( $1, $3 ) ) YYERROR; } | TOK_IDENT '=' '(' named_const_list ')' { if ( !pParser->AddOption ( $1, pParser->GetNamedVec ( $4 ) ) ) YYERROR; pParser->FreeNamedVec ( $4 ); } | TOK_IDENT '=' TOK_IDENT '(' TOK_QUOTED_STRING ')' { if ( !pParser->AddOption ( $1, $4, $5.m_sValue ) ) YYERROR; } ; named_const_list: named_const { $$ = pParser->AllocNamedVec (); pParser->AddConst ( $$, $1 ); } | named_const_list ',' named_const { pParser->AddConst( $$, $3 ); } ; named_const: TOK_IDENT '=' const_int { $$.m_sValue = $1.m_sValue; $$.m_iValue = $3.m_iValue; } ; ////////////////////////////////////////////////////////////////////////// expr: TOK_IDENT | TOK_ATIDENT { if ( !pParser->SetOldSyntax() ) YYERROR; } | TOK_ID { if ( !pParser->SetNewSyntax() ) YYERROR; } | TOK_CONST_INT | TOK_CONST_FLOAT | TOK_USERVAR | '-' expr %prec TOK_NEG { $$ = $1; $$.m_iEnd = $2.m_iEnd; } | TOK_NOT expr { $$ = $1; $$.m_iEnd = $2.m_iEnd; } | expr '+' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '-' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '*' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '/' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '<' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '>' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '&' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '|' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '%' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr TOK_DIV expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr TOK_MOD expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr TOK_LTE expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr TOK_GTE expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr '=' expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr TOK_NE expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr TOK_AND expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | expr TOK_OR expr { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | '(' expr ')' { $$ = $1; $$.m_iEnd = $3.m_iEnd; } | function ; function: TOK_IDENT '(' arglist ')' { $$ = $1; $$.m_iEnd = $4.m_iEnd; } | TOK_IN '(' arglist ')' { $$ = $1; $$.m_iEnd = $4.m_iEnd; } // handle exception from 'ident' rule | TOK_IDENT '(' ')' { $$ = $1; $$.m_iEnd = $3.m_iEnd } | TOK_MIN '(' expr ',' expr ')' { $$ = $1; $$.m_iEnd = $6.m_iEnd } // handle clash with aggregate functions | TOK_MAX '(' expr ',' expr ')' { $$ = $1; $$.m_iEnd = $6.m_iEnd } ; arglist: arg | arglist ',' arg ; arg: expr | TOK_QUOTED_STRING ; ////////////////////////////////////////////////////////////////////////// show_clause: TOK_SHOW show_variable ; show_variable: TOK_WARNINGS { pParser->m_pStmt->m_eStmt = STMT_SHOW_WARNINGS; } | TOK_STATUS { pParser->m_pStmt->m_eStmt = STMT_SHOW_STATUS; } | TOK_META { pParser->m_pStmt->m_eStmt = STMT_SHOW_META; } ; ////////////////////////////////////////////////////////////////////////// set_value: TOK_IDENT | TOK_NULL | TOK_QUOTED_STRING | TOK_CONST_INT | TOK_CONST_FLOAT ; set_clause: TOK_SET TOK_IDENT '=' boolean_value { pParser->SetStatement ( $2, SET_LOCAL ); pParser->m_pStmt->m_iSetValue = $4.m_iValue; } | TOK_SET TOK_IDENT '=' set_string_value { pParser->SetStatement ( $2, SET_LOCAL ); pParser->m_pStmt->m_sSetValue = $4.m_sValue; } | TOK_SET TOK_IDENT '=' TOK_NULL { pParser->SetStatement ( $2, SET_LOCAL ); pParser->m_pStmt->m_bSetNull = true; } | TOK_SET TOK_NAMES set_value { pParser->m_pStmt->m_eStmt = STMT_DUMMY; } | TOK_SET TOK_SYSVAR '=' set_value { pParser->m_pStmt->m_eStmt = STMT_DUMMY; } ; set_global_clause: TOK_SET TOK_GLOBAL TOK_USERVAR '=' '(' const_list ')' { pParser->SetStatement ( $3, SET_GLOBAL_UVAR ); pParser->m_pStmt->m_dSetValues = *$6.m_pValues.Ptr(); } | TOK_SET TOK_GLOBAL TOK_IDENT '=' set_string_value { pParser->SetStatement ( $3, SET_GLOBAL_SVAR ); pParser->m_pStmt->m_sSetValue = $5.m_sValue; } ; set_string_value: TOK_IDENT | TOK_QUOTED_STRING ; boolean_value: TOK_TRUE { $$.m_iValue = 1; } | TOK_FALSE { $$.m_iValue = 0; } | const_int { $$.m_iValue = $1.m_iValue; if ( $$.m_iValue!=0 && $$.m_iValue!=1 ) { yyerror ( pParser, "only 0 and 1 could be used as boolean values" ); YYERROR; } } ; ////////////////////////////////////////////////////////////////////////// transact_op: TOK_COMMIT { pParser->m_pStmt->m_eStmt = STMT_COMMIT; } | TOK_ROLLBACK { pParser->m_pStmt->m_eStmt = STMT_ROLLBACK; } | start_transaction { pParser->m_pStmt->m_eStmt = STMT_BEGIN; } ; start_transaction: TOK_BEGIN | TOK_START TOK_TRANSACTION ; ////////////////////////////////////////////////////////////////////////// insert_into: insert_or_replace TOK_INTO TOK_IDENT opt_column_list TOK_VALUES insert_rows_list { // everything else is pushed directly into parser within the rules pParser->m_pStmt->m_sIndex = $3.m_sValue; } ; insert_or_replace: TOK_INSERT { pParser->m_pStmt->m_eStmt = STMT_INSERT; } | TOK_REPLACE { pParser->m_pStmt->m_eStmt = STMT_REPLACE; } ; opt_column_list: // empty | '(' column_list ')' ; column_list: expr_ident { if ( !pParser->AddSchemaItem ( &$1 ) ) { yyerror ( pParser, "unknown field" ); YYERROR; } } | column_list ',' expr_ident { if ( !pParser->AddSchemaItem ( &$3 ) ) { yyerror ( pParser, "unknown field" ); YYERROR; } } ; insert_rows_list: insert_row | insert_rows_list ',' insert_row ; insert_row: '(' insert_vals_list ')' { if ( !pParser->m_pStmt->CheckInsertIntegrity() ) { yyerror ( pParser, "wrong number of values here" ); YYERROR; } } ; insert_vals_list: insert_val { AddInsval ( pParser->m_pStmt->m_dInsertValues, $1 ); } | insert_vals_list ',' insert_val { AddInsval ( pParser->m_pStmt->m_dInsertValues, $3 ); } ; insert_val: const_int { $$.m_iInstype = TOK_CONST_INT; $$.m_iValue = $1.m_iValue; } | const_float { $$.m_iInstype = TOK_CONST_FLOAT; $$.m_fValue = $1.m_fValue; } | TOK_QUOTED_STRING { $$.m_iInstype = TOK_QUOTED_STRING; $$.m_sValue = $1.m_sValue; } | '(' const_list ')' { $$.m_iInstype = TOK_CONST_MVA; $$.m_iValue = $2.m_pValues->GetLength(); $$.m_pValues = $2.m_pValues; } ; ////////////////////////////////////////////////////////////////////////// delete_from: TOK_DELETE TOK_FROM TOK_IDENT TOK_WHERE TOK_ID '=' const_int { pParser->m_pStmt->m_eStmt = STMT_DELETE; pParser->m_pStmt->m_sIndex = $3.m_sValue; pParser->m_pStmt->m_dDeleteIds.Add ( $7.m_iValue ); } | TOK_DELETE TOK_FROM TOK_IDENT TOK_WHERE TOK_ID TOK_IN '(' const_list ')' { pParser->m_pStmt->m_eStmt = STMT_DELETE; pParser->m_pStmt->m_sIndex = $3.m_sValue; for ( int i=0; i<$8.m_pValues.Ptr()->GetLength(); i++ ) pParser->m_pStmt->m_dDeleteIds.Add ( (*$8.m_pValues.Ptr())[i] ); } ; ////////////////////////////////////////////////////////////////////////// call_proc: TOK_CALL TOK_IDENT '(' insert_vals_list opt_call_opts_list ')' { pParser->m_pStmt->m_eStmt = STMT_CALL; pParser->m_pStmt->m_sCallProc = $2.m_sValue; } ; opt_call_opts_list: // empty | ',' call_opts_list ; call_opts_list: call_opt { assert ( pParser->m_pStmt->m_dCallOptNames.GetLength()==1 ); assert ( pParser->m_pStmt->m_dCallOptValues.GetLength()==1 ); } | call_opts_list ',' call_opt ; call_opt: insert_val opt_as call_opt_name { pParser->m_pStmt->m_dCallOptNames.Add ( $3.m_sValue ); AddInsval ( pParser->m_pStmt->m_dCallOptValues, $1 ); } ; opt_as: // empty | TOK_AS ; call_opt_name: TOK_IDENT | TOK_LIMIT { $$.m_sValue = "limit"; } ; ////////////////////////////////////////////////////////////////////////// describe: describe_tok TOK_IDENT { pParser->m_pStmt->m_eStmt = STMT_DESC; pParser->m_pStmt->m_sIndex = $2.m_sValue; } ; describe_tok: TOK_DESCRIBE | TOK_DESC ; ////////////////////////////////////////////////////////////////////////// show_tables: TOK_SHOW TOK_TABLES { pParser->m_pStmt->m_eStmt = STMT_SHOW_TABLES; } ; ////////////////////////////////////////////////////////////////////////// update: TOK_UPDATE TOK_IDENT TOK_SET update_items_list TOK_WHERE TOK_ID '=' const_int { SqlStmt_t & tStmt = *pParser->m_pStmt; tStmt.m_eStmt = STMT_UPDATE; tStmt.m_sIndex = $2.m_sValue; tStmt.m_tUpdate.m_dDocids.Add ( (SphDocID_t) $8.m_iValue ); tStmt.m_tUpdate.m_dRowOffset.Add ( 0 ); } ; update_items_list: update_item | update_items_list ',' update_item ; update_item: TOK_IDENT '=' const_int { CSphAttrUpdate & tUpd = pParser->m_pStmt->m_tUpdate; CSphColumnInfo & tAttr = tUpd.m_dAttrs.Add(); tAttr.m_sName = $1.m_sValue; tAttr.m_sName.ToLower(); tAttr.m_eAttrType = SPH_ATTR_INTEGER; // sorry, ints only for now, riding on legacy shit! tUpd.m_dPool.Add ( (DWORD) $3.m_iValue ); } | TOK_IDENT '=' '(' const_list ')' { CSphAttrUpdate & tUpd = pParser->m_pStmt->m_tUpdate; CSphColumnInfo & tAttr = tUpd.m_dAttrs.Add(); tAttr.m_sName = $1.m_sValue; tAttr.m_sName.ToLower(); assert ( $4.m_pValues.Ptr() && $4.m_pValues->GetLength()>0 ); $4.m_pValues->Uniq(); // don't need dupes within MVA tUpd.m_dPool.Add ( $4.m_pValues->GetLength()*2 ); tAttr.m_eAttrType = SPH_ATTR_UINT32SET; SphAttr_t * pVal = $4.m_pValues.Ptr()->Begin(); SphAttr_t * pValMax = pVal + $4.m_pValues->GetLength(); for ( ;pValUINT_MAX ) { tAttr.m_eAttrType = SPH_ATTR_UINT64SET; } tUpd.m_dPool.Add ( (DWORD)uVal ); tUpd.m_dPool.Add ( (DWORD)( uVal>>32 ) ); } } | TOK_IDENT '=' '(' ')' // special case () means delete mva { CSphAttrUpdate & tUpd = pParser->m_pStmt->m_tUpdate; CSphColumnInfo & tAttr = tUpd.m_dAttrs.Add(); tAttr.m_sName = $1.m_sValue; tAttr.m_sName.ToLower(); tAttr.m_eAttrType = SPH_ATTR_UINT32SET; tUpd.m_dPool.Add ( 0 ); } ; ////////////////////////////////////////////////////////////////////////// show_variables: TOK_SHOW opt_session TOK_VARIABLES { pParser->m_pStmt->m_eStmt = STMT_DUMMY; } ; opt_session: | TOK_SESSION ; show_collation: TOK_SHOW TOK_COLLATION { pParser->m_pStmt->m_eStmt = STMT_DUMMY; } ; ////////////////////////////////////////////////////////////////////////// create_function: TOK_CREATE TOK_FUNCTION TOK_IDENT TOK_RETURNS udf_type TOK_SONAME TOK_QUOTED_STRING { SqlStmt_t & tStmt = *pParser->m_pStmt; tStmt.m_eStmt = STMT_CREATE_FUNC; tStmt.m_sUdfName = $3.m_sValue; tStmt.m_sUdfLib = $7.m_sValue; tStmt.m_eUdfType = (ESphAttr) $5; } ; udf_type: TOK_INT { $$ = SPH_ATTR_INTEGER; } | TOK_FLOAT { $$ = SPH_ATTR_FLOAT; } ; drop_function: TOK_DROP TOK_FUNCTION TOK_IDENT { SqlStmt_t & tStmt = *pParser->m_pStmt; tStmt.m_eStmt = STMT_DROP_FUNC; tStmt.m_sUdfName = $3.m_sValue; } ; %% #if USE_WINDOWS #pragma warning(pop) #endif coreseek-4.1-beta/csft-4.1/src/sphinxquery.cpp100777 0 0 126310 11643565732 14416 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxquery.h" #include "sphinxutils.h" #include ////////////////////////////////////////////////////////////////////////// // EXTENDED PARSER RELOADED ////////////////////////////////////////////////////////////////////////// #include "yysphinxquery.h" ////////////////////////////////////////////////////////////////////////// class XQParser_t { public: XQParser_t (); ~XQParser_t () {} public: bool Parse ( XQQuery_t & tQuery, const char * sQuery, const ISphTokenizer * pTokenizer, const CSphSchema * pSchema, CSphDict * pDict, int iStopwordStep ); bool Error ( const char * sTemplate, ... ) __attribute__ ( ( format ( printf, 2, 3 ) ) ); void Warning ( const char * sTemplate, ... ) __attribute__ ( ( format ( printf, 2, 3 ) ) ); bool AddField ( CSphSmallBitvec & dFields, const char * szField, int iLen ); bool ParseFields ( CSphSmallBitvec & uFields, int & iMaxFieldPos ); int ParseZone ( const char * pZone ); bool IsSpecial ( char c ); int GetToken ( YYSTYPE * lvalp ); void AddQuery ( XQNode_t * pNode ); XQNode_t * AddKeyword ( const char * sKeyword, DWORD uStar = STAR_NONE ); XQNode_t * AddKeyword ( XQNode_t * pLeft, XQNode_t * pRight ); XQNode_t * AddOp ( XQOperator_e eOp, XQNode_t * pLeft, XQNode_t * pRight, int iOpArg=0 ); void Cleanup (); XQNode_t * SweepNulls ( XQNode_t * pNode ); bool FixupNots ( XQNode_t * pNode ); public: const CSphVector & GetZoneVec ( int iZoneVec ) const { return m_dZoneVecs[iZoneVec]; } public: XQQuery_t * m_pParsed; BYTE * m_sQuery; int m_iQueryLen; const char * m_pLastTokenStart; const CSphSchema * m_pSchema; ISphTokenizer * m_pTokenizer; CSphDict * m_pDict; const char * m_pCur; CSphVector m_dSpawned; XQNode_t * m_pRoot; bool m_bStopOnInvalid; int m_iAtomPos; int m_iPendingNulls; int m_iPendingType; YYSTYPE m_tPendingToken; bool m_bWasBlended; bool m_bEmpty; bool m_bQuoted; bool m_bEmptyStopword; CSphVector m_dIntTokens; CSphVector < CSphVector > m_dZoneVecs; }; ////////////////////////////////////////////////////////////////////////// int yylex ( YYSTYPE * lvalp, XQParser_t * pParser ) { return pParser->GetToken ( lvalp ); } void yyerror ( XQParser_t * pParser, const char * sMessage ) { if ( pParser->m_pParsed->m_sParseError.IsEmpty() ) pParser->m_pParsed->m_sParseError.SetSprintf ( "%s near '%s'", sMessage, pParser->m_pLastTokenStart ); } #include "yysphinxquery.c" ////////////////////////////////////////////////////////////////////////// void XQNode_t::SetFieldSpec ( const CSphSmallBitvec& uMask, int iMaxPos ) { // set it, if we do not yet have one if ( !m_bFieldSpec ) { m_bFieldSpec = true; m_dFieldMask = uMask; m_iFieldMaxPos = iMaxPos; } // some of the children might not yet have a spec, even if the node itself has // eg. 'hello @title world' (whole node has '@title' spec but 'hello' node does not have any!) ARRAY_FOREACH ( i, m_dChildren ) m_dChildren[i]->SetFieldSpec ( uMask, iMaxPos ); } void XQNode_t::SetZoneSpec ( const CSphVector & dZones ) { // set it, if we do not yet have one if ( !m_dZones.GetLength() ) m_dZones = dZones; // some of the children might not yet have a spec, even if the node itself has ARRAY_FOREACH ( i, m_dChildren ) m_dChildren[i]->SetZoneSpec ( dZones ); } void XQNode_t::CopySpecs ( const XQNode_t * pSpecs ) { if ( !pSpecs ) return; if ( pSpecs->m_bFieldSpec ) SetFieldSpec ( pSpecs->m_dFieldMask, pSpecs->m_iFieldMaxPos ); if ( pSpecs->m_dZones.GetLength() ) SetZoneSpec ( pSpecs->m_dZones ); } void XQNode_t::ClearFieldMask () { m_dFieldMask.Set(); ARRAY_FOREACH ( i, m_dChildren ) m_dChildren[i]->ClearFieldMask(); } bool XQNode_t::IsEqualTo ( const XQNode_t * pNode ) { if ( !pNode || pNode->GetHash()!=GetHash() || pNode->GetOp()!=GetOp() ) return false; if ( m_dWords.GetLength() ) { // two plain nodes. let's compare the keywords if ( pNode->m_dWords.GetLength()!=m_dWords.GetLength() ) return false; if ( !m_dWords.GetLength() ) return true; SmallStringHash_T hSortedWords; ARRAY_FOREACH ( i, pNode->m_dWords ) hSortedWords.Add ( 0, pNode->m_dWords[i].m_sWord ); ARRAY_FOREACH ( i, m_dWords ) if ( !hSortedWords.Exists ( m_dWords[i].m_sWord ) ) return false; return true; } // two non-plain nodes. let's compare the children if ( pNode->m_dChildren.GetLength()!=m_dChildren.GetLength() ) return false; if ( !m_dChildren.GetLength() ) return true; ARRAY_FOREACH ( i, m_dChildren ) if ( !pNode->m_dChildren[i]->IsEqualTo ( m_dChildren[i] ) ) return false; return true; } uint64_t XQNode_t::GetHash() const { if ( m_iMagicHash ) return m_iMagicHash; XQOperator_e dZeroOp[2]; dZeroOp[0] = m_eOp; dZeroOp[1] = (XQOperator_e) 0; ARRAY_FOREACH ( i, m_dWords ) m_iMagicHash = 100 + ( m_iMagicHash ^ sphFNV64 ( (const BYTE*)m_dWords[i].m_sWord.cstr() ) ); ///< +100 to make it non-transitive ARRAY_FOREACH ( j, m_dChildren ) m_iMagicHash = 100 + ( m_iMagicHash ^ m_dChildren[j]->GetHash() ); ///< +100 to make it non-transitive m_iMagicHash += 1000000; ///< to immerse difference between parents and children m_iMagicHash ^= sphFNV64 ( (const BYTE*)dZeroOp ); return m_iMagicHash; } void XQNode_t::SetOp ( XQOperator_e eOp, XQNode_t * pArg1, XQNode_t * pArg2 ) { m_eOp = eOp; m_dChildren.Reset(); if ( pArg1 ) m_dChildren.Add ( pArg1 ); if ( pArg2 ) m_dChildren.Add ( pArg2 ); } ////////////////////////////////////////////////////////////////////////// XQParser_t::XQParser_t () : m_pParsed ( NULL ) , m_pLastTokenStart ( NULL ) , m_pRoot ( NULL ) , m_bStopOnInvalid ( true ) , m_bWasBlended ( false ) , m_bQuoted ( false ) , m_bEmptyStopword ( false ) { } /// cleanup spawned nodes (for bailing out on errors) void XQParser_t::Cleanup () { m_dSpawned.Uniq(); // FIXME! should eliminate this by testing ARRAY_FOREACH ( i, m_dSpawned ) { m_dSpawned[i]->m_dChildren.Reset (); SafeDelete ( m_dSpawned[i] ); } m_dSpawned.Reset (); } bool XQParser_t::Error ( const char * sTemplate, ... ) { assert ( m_pParsed ); char sBuf[256]; const char * sPrefix = "query error: "; int iPrefix = strlen(sPrefix); memcpy ( sBuf, sPrefix, iPrefix ); va_list ap; va_start ( ap, sTemplate ); vsnprintf ( sBuf+iPrefix, sizeof(sBuf)-iPrefix, sTemplate, ap ); va_end ( ap ); m_pParsed->m_sParseError = sBuf; return false; } void XQParser_t::Warning ( const char * sTemplate, ... ) { assert ( m_pParsed ); char sBuf[256]; const char * sPrefix = "query warning: "; int iPrefix = strlen(sPrefix); memcpy ( sBuf, sPrefix, iPrefix ); va_list ap; va_start ( ap, sTemplate ); vsnprintf ( sBuf+iPrefix, sizeof(sBuf)-iPrefix, sTemplate, ap ); va_end ( ap ); m_pParsed->m_sParseWarning = sBuf; } /// my special chars bool XQParser_t::IsSpecial ( char c ) { return c=='(' || c==')' || c=='|' || c=='-' || c=='!' || c=='@' || c=='~' || c=='"' || c=='/'; } /// lookup field and add it into mask bool XQParser_t::AddField ( CSphSmallBitvec & dFields, const char * szField, int iLen ) { CSphString sField; sField.SetBinary ( szField, iLen ); int iField = m_pSchema->GetFieldIndex ( sField.cstr () ); if ( iField < 0 ) { if ( m_bStopOnInvalid ) return Error ( "no field '%s' found in schema", sField.cstr () ); else Warning ( "no field '%s' found in schema", sField.cstr () ); } else { if ( iField>=SPH_MAX_FIELDS ) return Error ( " max %d fields allowed", SPH_MAX_FIELDS ); dFields.Set(iField); } return true; } /// parse fields block bool XQParser_t::ParseFields ( CSphSmallBitvec & dFields, int & iMaxFieldPos ) { dFields.Unset(); iMaxFieldPos = 0; const char * pPtr = m_pTokenizer->GetBufferPtr (); const char * pLastPtr = m_pTokenizer->GetBufferEnd (); if ( pPtr==pLastPtr ) return true; // silently ignore trailing field operator bool bNegate = false; bool bBlock = false; // handle special modifiers if ( *pPtr=='!' ) { // handle @! and @!( bNegate = true; pPtr++; if ( *pPtr=='(' ) { bBlock = true; pPtr++; } } else if ( *pPtr=='*' ) { // handle @* dFields.Set(); m_pTokenizer->SetBufferPtr ( pPtr+1 ); return true; } else if ( *pPtr=='(' ) { // handle @( bBlock = true; pPtr++; } // handle invalid chars if ( !sphIsAlpha(*pPtr) ) { m_pTokenizer->SetBufferPtr ( pPtr ); // ignore and re-parse (FIXME! maybe warn?) return true; } assert ( sphIsAlpha(*pPtr) ); // i think i'm paranoid // handle field specification if ( !bBlock ) { // handle standalone field specification const char * pFieldStart = pPtr; while ( sphIsAlpha(*pPtr) && pPtr0 ); if ( !AddField ( dFields, pFieldStart, pPtr-pFieldStart ) ) return false; m_pTokenizer->SetBufferPtr ( pPtr ); if ( bNegate && ( !dFields.TestAll() ) ) dFields.Negate(); } else { // handle fields block specification assert ( sphIsAlpha(*pPtr) && bBlock ); // and complicated bool bOK = false; const char * pFieldStart = NULL; while ( pPtrSetBufferPtr ( ++pPtr ); if ( bNegate && ( !dFields.TestAll() ) ) dFields.Negate(); bOK = true; break; } else { return Error ( "invalid character '%c' in field block operator", *pPtr ); } } if ( !bOK ) return Error ( "missing closing ')' in field block operator" ); } // handle optional position range modifier if ( pPtr[0]=='[' && isdigit ( pPtr[1] ) ) { // skip '[' and digits const char * p = pPtr+1; while ( *p && isdigit(*p) ) p++; // check that the range ends with ']' (FIXME! maybe report an error if it does not?) if ( *p!=']' ) return true; // fetch my value iMaxFieldPos = strtoul ( pPtr+1, NULL, 10 ); m_pTokenizer->SetBufferPtr ( p+1 ); } // well done return true; } /// helper find-or-add (make it generic and move to sphinxstd?) static int GetZoneIndex ( XQQuery_t * pQuery, const CSphString & sZone ) { ARRAY_FOREACH ( i, pQuery->m_dZones ) if ( pQuery->m_dZones[i]==sZone ) return i; pQuery->m_dZones.Add ( sZone ); return pQuery->m_dZones.GetLength()-1; } /// parse zone int XQParser_t::ParseZone ( const char * pZone ) { const char * p = pZone; // case one, just a single zone name if ( sphIsAlpha ( *pZone ) ) { // find zone name while ( sphIsAlpha(*p) ) p++; m_pTokenizer->SetBufferPtr ( p ); // extract and lowercase it CSphString sZone; sZone.SetBinary ( pZone, p-pZone ); sZone.ToLower(); // register it in zones list int iZone = GetZoneIndex ( m_pParsed, sZone ); // create new 1-zone vector m_dZoneVecs.Add().Add ( iZone ); return m_dZoneVecs.GetLength()-1; } // case two, zone block // it must follow strict (name1,name2,...) syntax if ( *pZone=='(' ) { // create new zone vector CSphVector & dZones = m_dZoneVecs.Add(); p = ++pZone; // scan names for ( ;; ) { // syntax error, name expected! if ( !sphIsAlpha(*p) ) { Error ( "unexpected character '%c' in zone block operator", *p ); return -1; } // scan next name while ( sphIsAlpha(*p) ) p++; // extract and lowercase it CSphString sZone; sZone.SetBinary ( pZone, p-pZone ); sZone.ToLower(); // register it in zones list dZones.Add ( GetZoneIndex ( m_pParsed, sZone ) ); // must be either followed by comma, or closing paren // everything else will cause syntax error if ( *p==')' ) { m_pTokenizer->SetBufferPtr ( p+1 ); break; } if ( *p==',' ) pZone = ++p; } return m_dZoneVecs.GetLength()-1; } // unhandled case Error ( "internal error, unhandled case in ParseZone()" ); return -1; } /// a lexer of my own int XQParser_t::GetToken ( YYSTYPE * lvalp ) { // what, noone's pending for a bending?! if ( !m_iPendingType ) for ( ;; ) { assert ( m_iPendingNulls==0 ); if ( m_bWasBlended ) m_iAtomPos += m_pTokenizer->SkipBlended(); // tricky stuff // we need to manually check for numbers in certain states (currently, just after proximity or quorum operator) // required because if 0-9 are not in charset_table, or min_word_len is too high, // the tokenizer will *not* return the number as a token! m_pLastTokenStart = m_pTokenizer->GetBufferPtr (); const char * sEnd = m_pTokenizer->GetBufferEnd (); const char * p = m_pLastTokenStart; while ( psToken && p-sTokenGetToken() && m_pTokenizer->TokenIsBlended() ) // number with blended should be tokenized as usual { m_pTokenizer->SkipBlended(); m_pTokenizer->SetBufferPtr ( m_pLastTokenStart ); } else { // got not a very long number followed by a whitespace or special, handle it char sNumberBuf[NUMBER_BUF_LEN]; int iNumberLen = Min ( (int)sizeof(sNumberBuf)-1, int(p-sToken) ); memcpy ( sNumberBuf, sToken, iNumberLen ); sNumberBuf[iNumberLen] = '\0'; m_tPendingToken.tInt.iValue = atoi ( sNumberBuf ); // check if it can be used as a keyword too m_pTokenizer->SetBuffer ( (BYTE*)sNumberBuf, iNumberLen ); sToken = (const char*) m_pTokenizer->GetToken(); m_pTokenizer->SetBuffer ( m_sQuery, m_iQueryLen ); m_pTokenizer->SetBufferPtr ( p ); m_tPendingToken.tInt.iStrIndex = -1; if ( sToken ) { m_dIntTokens.Add ( sToken ); if ( m_pDict->GetWordID ( (BYTE*)sToken ) ) m_tPendingToken.tInt.iStrIndex = m_dIntTokens.GetLength()-1; else m_dIntTokens.Pop(); m_iAtomPos++; } m_iPendingNulls = 0; m_iPendingType = TOK_INT; break; } } // not a number, long number, or number not followed by a whitespace, so fallback to regular tokenizing sToken = (const char *) m_pTokenizer->GetToken (); if ( !sToken ) { m_iPendingNulls = m_pTokenizer->GetOvershortCount (); if ( !m_iPendingNulls ) return 0; m_iPendingNulls = 0; lvalp->pNode = AddKeyword ( NULL ); return TOK_KEYWORD; } // now let's do some token post-processing m_bWasBlended = m_pTokenizer->TokenIsBlended(); m_bEmpty = false; m_iPendingNulls = m_pTokenizer->GetOvershortCount (); m_iAtomPos += 1+m_iPendingNulls; // handle NEAR (must be case-sensitive, and immediately followed by slash and int) if ( sToken && p && !m_pTokenizer->m_bPhrase && strncmp ( p, "NEAR/", 5 )==0 && isdigit(p[5]) ) { // extract that int int iVal = 0; for ( p=p+5; isdigit(*p); p++ ) iVal = iVal*10 + (*p) - '0'; // FIXME! check for overflow? m_pTokenizer->SetBufferPtr ( p ); // we just lexed our next token m_iPendingType = TOK_NEAR; m_tPendingToken.tInt.iValue = iVal; m_tPendingToken.tInt.iStrIndex = -1; m_iAtomPos -= 1; // skip NEAR break; } // handle SENTENCE if ( sToken && p && !m_pTokenizer->m_bPhrase && !strcasecmp ( sToken, "sentence" ) && !strncmp ( p, "SENTENCE", 8 ) ) { // we just lexed our next token m_iPendingType = TOK_SENTENCE; m_iAtomPos -= 1; break; } // handle PARAGRAPH if ( sToken && p && !m_pTokenizer->m_bPhrase && !strcasecmp ( sToken, "paragraph" ) && !strncmp ( p, "PARAGRAPH", 9 ) ) { // we just lexed our next token m_iPendingType = TOK_PARAGRAPH; m_iAtomPos -= 1; break; } // handle ZONE if ( sToken && p && !m_pTokenizer->m_bPhrase && !strncmp ( p, "ZONE:", 5 ) && ( sphIsAlpha(p[5]) || p[5]=='(' ) ) { // ParseZone() will update tokenizer buffer ptr as needed int iVec = ParseZone ( p+5 ); if ( iVec<0 ) return -1; // we just lexed our next token m_iPendingType = TOK_ZONE; m_tPendingToken.iZoneVec = iVec; m_iAtomPos -= 1; break; } // handle specials if ( m_pTokenizer->WasTokenSpecial() ) { // specials must not affect pos m_iAtomPos--; // some specials are especially special if ( sToken[0]=='@' ) { // parse fields operator if ( !ParseFields ( m_tPendingToken.tFieldLimit.dMask, m_tPendingToken.tFieldLimit.iMaxPos ) ) return -1; if ( m_pSchema->m_dFields.GetLength()!=SPH_MAX_FIELDS ) m_tPendingToken.tFieldLimit.dMask.LimitBits ( m_pSchema->m_dFields.GetLength() ); m_iPendingType = TOK_FIELDLIMIT; break; } else if ( sToken[0]=='<' ) { if ( *m_pTokenizer->GetBufferPtr()=='<' ) { // got "<<", aka operator BEFORE m_iPendingType = TOK_BEFORE; break; } else { // got stray '<', ignore continue; } } else { // all the other specials are passed to parser verbatim if ( sToken[0]=='"' ) m_bQuoted = !m_bQuoted; m_iPendingType = sToken[0]=='!' ? '-' : sToken[0]; m_pTokenizer->m_bPhrase = m_bQuoted; break; } } // check for stopword, and create that node // temp buffer is required, because GetWordID() might expand (!) the keyword in-place const int MAX_BYTES = 3*SPH_MAX_WORD_LEN + 16; BYTE sTmp [ MAX_BYTES ]; strncpy ( (char*)sTmp, sToken, MAX_BYTES ); sTmp[MAX_BYTES-1] = '\0'; if ( !m_pDict->GetWordID ( sTmp ) ) { sToken = NULL; // stopwords with step=0 must not affect pos if ( m_bEmptyStopword ) m_iAtomPos--; } // information about stars is lost after this point, so was have to save it now DWORD uStarPosition = STAR_NONE; uStarPosition |= *m_pTokenizer->GetTokenEnd()=='*' ? STAR_BACK : 0; uStarPosition |= ( m_pTokenizer->GetTokenStart()!=m_pTokenizer->GetBufferPtr() ) && m_pTokenizer->GetTokenStart()[-1]=='*' ? STAR_FRONT : 0; m_tPendingToken.pNode = AddKeyword ( sToken, uStarPosition ); m_iPendingType = TOK_KEYWORD; if ( m_pTokenizer->TokenIsBlended() ) m_iAtomPos--; break; } // someone must be pending now! assert ( m_iPendingType ); m_bEmpty = false; // ladies first, though if ( m_iPendingNulls>0 ) { m_iPendingNulls--; lvalp->pNode = AddKeyword ( NULL ); return TOK_KEYWORD; } // pending the offending int iRes = m_iPendingType; m_iPendingType = 0; *lvalp = m_tPendingToken; return iRes; } void XQParser_t::AddQuery ( XQNode_t * pNode ) { m_pRoot = pNode; } XQNode_t * XQParser_t::AddKeyword ( const char * sKeyword, DWORD uStarPosition ) { XQKeyword_t tAW ( sKeyword, m_iAtomPos ); tAW.m_uStarPosition = uStarPosition; XQNode_t * pNode = new XQNode_t(); pNode->m_dWords.Add ( tAW ); m_dSpawned.Add ( pNode ); return pNode; } XQNode_t * XQParser_t::AddKeyword ( XQNode_t * pLeft, XQNode_t * pRight ) { if ( !pLeft || !pRight ) return pLeft ? pLeft : pRight; assert ( pLeft->m_dWords.GetLength()>0 ); assert ( pRight->m_dWords.GetLength()==1 ); pLeft->m_dWords.Add ( pRight->m_dWords[0] ); m_dSpawned.RemoveValue ( pRight ); SafeDelete ( pRight ); return pLeft; } XQNode_t * XQParser_t::AddOp ( XQOperator_e eOp, XQNode_t * pLeft, XQNode_t * pRight, int iOpArg ) { ///////// // unary ///////// if ( eOp==SPH_QUERY_NOT ) { XQNode_t * pNode = new XQNode_t(); pNode->SetOp ( SPH_QUERY_NOT, pLeft ); m_dSpawned.Add ( pNode ); return pNode; } ////////// // binary ////////// if ( !pLeft || !pRight ) return pLeft ? pLeft : pRight; // left spec always tries to infect the nodes to the right, only brackets can stop it // eg. '@title hello' vs 'world' pRight->CopySpecs ( pLeft ); // build a new node XQNode_t * pResult = NULL; if ( pLeft->m_dChildren.GetLength() && pLeft->GetOp()==eOp && pLeft->m_iOpArg==iOpArg ) { pLeft->m_dChildren.Add ( pRight ); pResult = pLeft; } else { XQNode_t * pNode = new XQNode_t(); pNode->SetOp ( eOp, pLeft, pRight ); pNode->m_iOpArg = iOpArg; m_dSpawned.Add ( pNode ); pResult = pNode; } // however, it's right (!) spec which is chosen for the resulting node, // eg. '@title hello' + 'world @body program' if ( pRight->m_bFieldSpec ) { pResult->m_bFieldSpec = true; pResult->m_dFieldMask = pRight->m_dFieldMask; pResult->m_iFieldMaxPos = pRight->m_iFieldMaxPos; } return pResult; } XQNode_t * XQParser_t::SweepNulls ( XQNode_t * pNode ) { if ( !pNode ) return NULL; // sweep plain node if ( pNode->m_dWords.GetLength() ) { ARRAY_FOREACH ( i, pNode->m_dWords ) if ( pNode->m_dWords[i].m_sWord.cstr()==NULL ) pNode->m_dWords.Remove ( i-- ); if ( pNode->m_dWords.GetLength()==0 ) { m_dSpawned.RemoveValue ( pNode ); // OPTIMIZE! SafeDelete ( pNode ); return NULL; } return pNode; } // sweep op node ARRAY_FOREACH ( i, pNode->m_dChildren ) { pNode->m_dChildren[i] = SweepNulls ( pNode->m_dChildren[i] ); if ( pNode->m_dChildren[i]==NULL ) pNode->m_dChildren.Remove ( i-- ); } if ( pNode->m_dChildren.GetLength()==0 ) { m_dSpawned.RemoveValue ( pNode ); // OPTIMIZE! SafeDelete ( pNode ); return NULL; } // remove redundancies if needed if ( pNode->GetOp()!=SPH_QUERY_NOT && pNode->m_dChildren.GetLength()==1 ) { XQNode_t * pRet = pNode->m_dChildren[0]; pNode->m_dChildren.Reset (); m_dSpawned.RemoveValue ( pNode ); // OPTIMIZE! SafeDelete ( pNode ); return pRet; } // done return pNode; } bool XQParser_t::FixupNots ( XQNode_t * pNode ) { // no processing for plain nodes if ( !pNode || pNode->m_dWords.GetLength() ) return true; // process 'em children ARRAY_FOREACH ( i, pNode->m_dChildren ) if ( !FixupNots ( pNode->m_dChildren[i] ) ) return false; // extract NOT subnodes CSphVector dNots; ARRAY_FOREACH ( i, pNode->m_dChildren ) if ( pNode->m_dChildren[i]->GetOp()==SPH_QUERY_NOT ) { dNots.Add ( pNode->m_dChildren[i] ); pNode->m_dChildren.RemoveFast ( i-- ); } // no NOTs? we're square if ( !dNots.GetLength() ) return true; // nothing but NOTs? we can't compute that if ( !pNode->m_dChildren.GetLength() ) { m_pParsed->m_sParseError.SetSprintf ( "query is non-computable (node consists of NOT operators only)" ); return false; } // NOT within OR? we can't compute that if ( pNode->GetOp()==SPH_QUERY_OR ) { m_pParsed->m_sParseError.SetSprintf ( "query is non-computable (NOT is not allowed within OR)" ); return false; } // NOT used in before operator if ( pNode->GetOp()==SPH_QUERY_BEFORE ) { m_pParsed->m_sParseError.SetSprintf ( "query is non-computable (NOT cannot be used as before operand)" ); return false; } // must be some NOTs within AND at this point, convert this node to ANDNOT assert ( pNode->GetOp()==SPH_QUERY_AND && pNode->m_dChildren.GetLength() && dNots.GetLength() ); XQNode_t * pAnd = new XQNode_t(); pAnd->SetOp ( SPH_QUERY_AND, pNode->m_dChildren ); m_dSpawned.Add ( pAnd ); XQNode_t * pNot = NULL; if ( dNots.GetLength()==1 ) { pNot = dNots[0]; } else { pNot = new XQNode_t(); pNot->SetOp ( SPH_QUERY_OR, dNots ); m_dSpawned.Add ( pNot ); } pNode->SetOp ( SPH_QUERY_ANDNOT, pAnd, pNot ); return true; } static void DeleteNodesWOFields ( XQNode_t * pNode ) { if ( !pNode ) return; for ( int i = 0; i < pNode->m_dChildren.GetLength (); ) { if ( pNode->m_dChildren[i]->m_dFieldMask.TestAll() ) { // this should be a leaf node assert ( pNode->m_dChildren[i]->m_dChildren.GetLength()==0 ); SafeDelete ( pNode->m_dChildren[i] ); pNode->m_dChildren.RemoveFast ( i ); } else { DeleteNodesWOFields ( pNode->m_dChildren[i] ); i++; } } } static bool CheckQuorum ( XQNode_t * pNode, CSphString * pError ) { assert ( pError ); if ( !pNode ) return true; if ( pNode->GetOp()==SPH_QUERY_QUORUM && pNode->m_iOpArg<=0 ) { pError->SetSprintf ( "quorum threshold too low (%d)", pNode->m_iOpArg ); return false; } bool bValid = true; ARRAY_FOREACH_COND ( i, pNode->m_dChildren, bValid ) { bValid &= CheckQuorum ( pNode->m_dChildren[i], pError ); } return bValid; } static void FixupDegenerates ( XQNode_t * pNode ) { if ( !pNode ) return; if ( pNode->m_dWords.GetLength()==1 && ( pNode->GetOp()==SPH_QUERY_PHRASE || pNode->GetOp()==SPH_QUERY_PROXIMITY || pNode->GetOp()==SPH_QUERY_QUORUM ) ) { pNode->SetOp ( SPH_QUERY_AND ); return; } ARRAY_FOREACH ( i, pNode->m_dChildren ) FixupDegenerates ( pNode->m_dChildren[i] ); } bool XQParser_t::Parse ( XQQuery_t & tParsed, const char * sQuery, const ISphTokenizer * pTokenizer, const CSphSchema * pSchema, CSphDict * pDict, int iStopwordStep ) { CSphScopedPtr pMyTokenizer ( pTokenizer->Clone ( true ) ); pMyTokenizer->AddSpecials ( "()|-!@~\"/^$<" ); pMyTokenizer->EnableQueryParserMode ( true ); // most outcomes are errors SafeDelete ( tParsed.m_pRoot ); // check for relaxed syntax const char * OPTION_RELAXED = "@@relaxed"; const int OPTION_RELAXED_LEN = strlen ( OPTION_RELAXED ); m_bStopOnInvalid = true; if ( strncmp ( sQuery, OPTION_RELAXED, OPTION_RELAXED_LEN )==0 && !sphIsAlpha ( sQuery[OPTION_RELAXED_LEN] ) ) { sQuery += OPTION_RELAXED_LEN; m_bStopOnInvalid = false; } // setup parser m_pParsed = &tParsed; m_sQuery = (BYTE*) sQuery; m_iQueryLen = strlen(sQuery); m_pTokenizer = pMyTokenizer.Ptr(); m_pSchema = pSchema; m_pDict = pDict; m_pCur = sQuery; m_iAtomPos = 0; m_iPendingNulls = 0; m_iPendingType = 0; m_pRoot = NULL; m_bEmpty = true; m_bEmptyStopword = ( iStopwordStep==0 ); m_pTokenizer->SetBuffer ( m_sQuery, m_iQueryLen ); int iRes = yyparse ( this ); if ( ( iRes || !m_pParsed->m_sParseError.IsEmpty() ) && !m_bEmpty ) { Cleanup (); return false; } DeleteNodesWOFields ( m_pRoot ); m_pRoot = SweepNulls ( m_pRoot ); FixupDegenerates ( m_pRoot ); if ( !FixupNots ( m_pRoot ) ) { Cleanup (); return false; } if ( !CheckQuorum ( m_pRoot, &m_pParsed->m_sParseError ) ) { Cleanup(); return false; } if ( m_pRoot && m_pRoot->GetOp()==SPH_QUERY_NOT ) { Cleanup (); m_pParsed->m_sParseError.SetSprintf ( "query is non-computable (single NOT operator)" ); return false; } // all ok; might want to create a dummy node to indicate that m_dSpawned.Reset(); tParsed.m_pRoot = m_pRoot ? m_pRoot : new XQNode_t (); return true; } ////////////////////////////////////////////////////////////////////////// #define XQDEBUG 0 #if XQDEBUG static void xqIndent ( int iIndent ) { iIndent *= 2; while ( iIndent-- ) printf ( " " ); } static void xqDump ( XQNode_t * pNode, const CSphSchema & tSch, int iIndent ) { if ( pNode->m_dChildren.GetLength() ) { xqIndent ( iIndent ); switch ( pNode->GetOp() ) { case SPH_QUERY_AND: printf ( "AND:\n" ); break; case SPH_QUERY_OR: printf ( "OR:\n" ); break; case SPH_QUERY_NOT: printf ( "NOT:\n" ); break; case SPH_QUERY_ANDNOT: printf ( "ANDNOT:\n" ); break; case SPH_QUERY_BEFORE: printf ( "BEFORE:\n" ); break; default: printf ( "unknown-op-%d:\n", pNode->GetOp() ); break; } ARRAY_FOREACH ( i, pNode->m_dChildren ) xqDump ( pNode->m_dChildren[i], tSch, iIndent+1 ); } else { xqIndent ( iIndent ); printf ( "MATCH(%d,%d):", pNode->m_uFieldMask, pNode->m_iOpArg ); ARRAY_FOREACH ( i, pNode->m_dWords ) { const XQKeyword_t & tWord = pNode->m_dWords[i]; const char * sLocTag = ""; if ( tWord.m_bFieldStart ) sLocTag = ", start"; if ( tWord.m_bFieldEnd ) sLocTag = ", end"; printf ( " %s (qpos %d%s)", tWord.m_sWord.cstr(), tWord.m_iAtomPos, sLocTag ); } printf ( "\n" ); } } #endif bool sphParseExtendedQuery ( XQQuery_t & tParsed, const char * sQuery, const ISphTokenizer * pTokenizer, const CSphSchema * pSchema, CSphDict * pDict, int iStopwordStep ) { XQParser_t qp; bool bRes = qp.Parse ( tParsed, sQuery, pTokenizer, pSchema, pDict, iStopwordStep ); #ifndef NDEBUG if ( bRes && tParsed.m_pRoot ) tParsed.m_pRoot->Check ( true ); #endif #if XQDEBUG if ( bRes ) { printf ( "--- query ---\n" ); xqDump ( tParsed.m_pRoot, *pSchema, 0 ); printf ( "---\n" ); } #endif return bRes; } ////////////////////////////////////////////////////////////////////////// // COMMON SUBTREES DETECTION ////////////////////////////////////////////////////////////////////////// /// Decides if given pTree is appropriate for caching or not. Currently we don't cache /// the end values (leafs). static bool IsAppropriate ( XQNode_t * pTree ) { if ( !pTree ) return false; // skip nodes that actually are leaves (eg. "AND smth" node instead of merely "smth") return !( pTree->m_dWords.GetLength()==1 && pTree->GetOp()!=SPH_QUERY_NOT ); } typedef CSphOrderedHash < DWORD, uint64_t, IdentityHash_fn, 128, 117 > CDwordHash; // stores the pair of a tree, and the bitmask of common nodes // which contains the tree. class BitMask_t { XQNode_t * m_pTree; uint64_t m_uMask; public: BitMask_t () : m_pTree ( NULL ) , m_uMask ( 0ull ) {} void Init ( XQNode_t * pTree, uint64_t uMask ) { m_pTree = pTree; m_uMask = uMask; } inline uint64_t GetMask() const { return m_uMask; } inline XQNode_t * GetTree() const { return m_pTree; } }; // a list of unique values. class Associations_t : public CDwordHash { public: // returns true when add the second member. // The reason is that only one is not interesting for us, // but more than two will flood the caller. bool Associate2nd ( uint64_t uTree ) { if ( Exists ( uTree ) ) return false; Add ( 0, uTree ); return GetLength()==2; } // merge with another similar void Merge ( const Associations_t& parents ) { parents.IterateStart(); while ( parents.IterateNext() ) Associate2nd ( parents.IterateGetKey() ); } }; // associate set of nodes, common bitmask for these nodes, // and gives the < to compare different pairs class BitAssociation_t { private: const Associations_t * m_pAssociations; mutable int m_iBits; // The key method of subtree selection. // Most 'heavy' subtrees will be extracted first. inline int GetWeight() const { assert ( m_pAssociations ); int iNodes = m_pAssociations->GetLength(); if ( m_iBits==0 && m_uMask!=0 ) { for ( uint64_t dMask = m_uMask; dMask; dMask >>=1 ) m_iBits += (int)( dMask & 1 ); } // current working formula is num_nodes^2 * num_hits return iNodes * iNodes * m_iBits; } public: uint64_t m_uMask; BitAssociation_t() : m_pAssociations ( NULL ) , m_iBits ( 0 ) , m_uMask ( 0 ) {} void Init ( uint64_t uMask, const Associations_t* dNodes ) { m_uMask = uMask; m_pAssociations = dNodes; m_iBits = 0; } bool operator< (const BitAssociation_t& second) const { return GetWeight() < second.GetWeight(); } }; // for pairs of values builds and stores the association "key -> list of values" class CAssociations_t : public CSphOrderedHash < Associations_t, uint64_t, IdentityHash_fn, 128, 117 > { int m_iBits; // number of non-unique associations public: CAssociations_t() : m_iBits ( 0 ) {} // Add the given pTree into the list of pTrees, associated with given uHash int Associate ( XQNode_t * pTree, uint64_t uHash ) { if ( !Exists ( uHash ) ) Add ( Associations_t(), uHash ); if ( operator[]( uHash ).Associate2nd ( pTree->GetHash() ) ) m_iBits++; return m_iBits; } // merge the existing association of uHash with given chain void MergeAssociations ( const Associations_t & chain, uint64_t uHash ) { if ( !Exists ( uHash ) ) Add ( chain, uHash ); else operator[]( uHash ).Merge ( chain ); } inline int GetBits() const { return m_iBits; } }; // The main class for working with common subtrees class RevealCommon_t : ISphNoncopyable { private: static const int MAX_MULTINODES = 64; CSphVector m_dBitmasks; // all bitmasks for all the nodes CSphVector m_dSubQueries; // final vector with roadmap for tree division. CAssociations_t m_hNodes; // initial accumulator for nodes CAssociations_t m_hInterSections; // initial accumulator for nodes CDwordHash m_hBitOrders; // order numbers for found common subnodes XQOperator_e m_eOp; // my operator which I process private: // returns the order for given uHash (if any). inline int GetBitOrder ( uint64_t uHash ) const { if ( !m_hBitOrders.Exists ( uHash ) ) return -1; return m_hBitOrders[uHash]; } // recursively scans the whole tree and builds the maps // where a list of parents associated with every "leaf" nodes (i.e. with children) bool BuildAssociations ( XQNode_t * pTree ) { if ( IsAppropriate ( pTree ) ) { ARRAY_FOREACH ( i, pTree->m_dChildren ) if ( ( !BuildAssociations ( pTree->m_dChildren[i] ) ) || ( ( m_eOp==pTree->GetOp() ) && ( m_hNodes.Associate ( pTree, pTree->m_dChildren[i]->GetHash() )>=MAX_MULTINODES ) ) ) { return false; } } return true; } // Find all leafs, non-unique across the tree, // and associate the order number with every of them bool CalcCommonNodes () { if ( !m_hNodes.GetBits() ) return false; // there is totally no non-unique leaves int iBit = 0; m_hNodes.IterateStart(); while ( m_hNodes.IterateNext() ) if ( m_hNodes.IterateGet().GetLength() > 1 ) m_hBitOrders.Add ( iBit++, m_hNodes.IterateGetKey() ); assert ( m_hNodes.GetBits()==m_hBitOrders.GetLength() ); m_hNodes.Reset(); ///< since from now we don't need this data anymore return true; } // recursively builds for every node the bitmaks // of common nodes it has as children void BuildBitmasks ( XQNode_t * pTree ) { if ( !IsAppropriate ( pTree ) ) return; if ( m_eOp==pTree->GetOp() ) { // calculate the bitmask int iOrder; uint64_t dMask = 0; ARRAY_FOREACH ( i, pTree->m_dChildren ) { iOrder = GetBitOrder ( pTree->m_dChildren[i]->GetHash() ); if ( iOrder>=0 ) dMask |= 1ull << iOrder; } // add the bitmask into the array if ( dMask ) m_dBitmasks.Add().Init( pTree, dMask ); } // recursively process all the children ARRAY_FOREACH ( i, pTree->m_dChildren ) BuildBitmasks ( pTree->m_dChildren[i] ); } // Collect all possible intersections of Bitmasks. // For every non-zero intersection we collect the list of trees which contain it. void CalcIntersections () { // Round 1. Intersect all content of bitmasks one-by-one. ARRAY_FOREACH ( i, m_dBitmasks ) for ( int j = i+1; j dSubnodes; // masks for our selected subnodes dSubnodes.Reserve ( m_hInterSections.GetLength() ); m_hInterSections.IterateStart(); while ( m_hInterSections.IterateNext() ) dSubnodes.Add().Init( m_hInterSections.IterateGetKey(), &m_hInterSections.IterateGet() ); // sort by weight descending (weight sorting is hold by operator <) dSubnodes.RSort(); m_dSubQueries.Reset(); // make the final subtrees vector: get one-by-one from the beginning, // intresect with all the next and throw out zeros. // The final subqueries will not be intersected between each other. int j; uint64_t uMask; ARRAY_FOREACH ( i, dSubnodes ) { uMask = dSubnodes[i].m_uMask; m_dSubQueries.Add ( uMask ); j = i+1; while ( j < dSubnodes.GetLength() ) { if ( !( dSubnodes[j].m_uMask &= ~uMask ) ) dSubnodes.Remove(j); else j++; } } } // Now we finally extract the common subtrees from original tree // and (recursively) from it's children void Reorganize ( XQNode_t * pTree ) { if ( !IsAppropriate ( pTree ) ) return; if ( m_eOp==pTree->GetOp() ) { // pBranch is for common subset of children, pOtherChildren is for the rest. CSphOrderedHash < XQNode_t*, int, IdentityHash_fn, 64, 13 > hBranches; XQNode_t * pOtherChildren = NULL; int iBit; int iOptimizations = 0; ARRAY_FOREACH ( i, pTree->m_dChildren ) { iBit = GetBitOrder ( pTree->m_dChildren[i]->GetHash() ); // works only with children which are actually common with somebody else if ( iBit>=0 ) { // since subqueries doesn't intersected between each other, // the first hit we found in this loop is exactly what we searched. ARRAY_FOREACH ( j, m_dSubQueries ) if ( ( 1ull << iBit ) & m_dSubQueries[j] ) { XQNode_t * pNode; if ( !hBranches.Exists(j) ) { pNode = new XQNode_t; pNode->SetOp ( m_eOp, pTree->m_dChildren[i] ); hBranches.Add ( pNode, j ); } else { pNode = hBranches[j]; pNode->m_dChildren.Add ( pTree->m_dChildren[i] ); // Count essential subtrees (with at least 2 children) if ( pNode->m_dChildren.GetLength()==2 ) iOptimizations++; } break; } // another nodes add to the set of "other" children } else { if ( !pOtherChildren ) { pOtherChildren = new XQNode_t; pOtherChildren->SetOp ( m_eOp, pTree->m_dChildren[i] ); } else pOtherChildren->m_dChildren.Add ( pTree->m_dChildren[i] ); } } // we don't reorganize explicit simple case - as no "others" and only one common. // Also reject optimization if there is nothing to optimize. if ( ( iOptimizations==0 ) | ( !pOtherChildren && ( hBranches.GetLength()==1 ) ) ) { if ( pOtherChildren ) pOtherChildren->m_dChildren.Reset(); hBranches.IterateStart(); while ( hBranches.IterateNext() ) { assert ( hBranches.IterateGet() ); hBranches.IterateGet()->m_dChildren.Reset(); SafeDelete ( hBranches.IterateGet() ); } } else { // reorganize the tree: replace the common subset to explicit node with // only common members inside. This will give the the possibility // to cache the node. pTree->m_dChildren.Reset(); if ( pOtherChildren ) pTree->m_dChildren.SwapData ( pOtherChildren->m_dChildren ); hBranches.IterateStart(); while ( hBranches.IterateNext() ) { if ( hBranches.IterateGet()->m_dChildren.GetLength()==1 ) { pTree->m_dChildren.Add ( hBranches.IterateGet()->m_dChildren[0] ); hBranches.IterateGet()->m_dChildren.Reset(); SafeDelete ( hBranches.IterateGet() ); } else pTree->m_dChildren.Add ( hBranches.IterateGet() ); } } SafeDelete ( pOtherChildren ); } // recursively process all the children ARRAY_FOREACH ( i, pTree->m_dChildren ) Reorganize ( pTree->m_dChildren[i] ); } public: explicit RevealCommon_t ( XQOperator_e eOp ) : m_eOp ( eOp ) {} // actual method for processing tree and reveal (extract) common subtrees void Transform ( int iXQ, const XQQuery_t * pXQ ) { // collect all non-unique nodes for ( int i=0; i1 ) m_iCounter--; if ( m_iCounter<2 ) m_bMarked = false; } }; typedef CSphOrderedHash < MarkedNode_t, uint64_t, IdentityHash_fn, 128, 117 > CSubtreeHash; /// check hashes, then check subtrees, then flag static void FlagCommonSubtrees ( XQNode_t * pTree, CSubtreeHash & hSubTrees, bool bFlag=true, bool bMarkIt=true ) { if ( !IsAppropriate ( pTree ) ) return; // we do not yet have any collisions stats, // but chances are we don't actually need IsEqualTo() at all uint64_t iHash = pTree->GetHash(); if ( bFlag && hSubTrees.Exists ( iHash ) && hSubTrees [ iHash ].m_pTree->IsEqualTo ( pTree ) ) { hSubTrees[iHash].MarkIt (); // we just add all the children but do NOT mark them as common // so that only the subtree root is marked. // also we unmark all the cases which were eaten by bigger trees ARRAY_FOREACH ( i, pTree->m_dChildren ) if ( !hSubTrees.Exists ( pTree->m_dChildren[i]->GetHash() ) ) FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, false, bMarkIt ); else FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, false, false ); } else { if ( !bMarkIt ) hSubTrees[iHash].MarkIt(false); else hSubTrees.Add ( MarkedNode_t ( pTree ), iHash ); ARRAY_FOREACH ( i, pTree->m_dChildren ) FlagCommonSubtrees ( pTree->m_dChildren[i], hSubTrees, bFlag, bMarkIt ); } } static void SignCommonSubtrees ( XQNode_t * pTree, CSubtreeHash & hSubTrees ) { if ( !pTree ) return; uint64_t iHash = pTree->GetHash(); if ( hSubTrees.Exists(iHash) && hSubTrees[iHash].m_bMarked ) pTree->TagAsCommon ( hSubTrees[iHash].m_iOrder, hSubTrees[iHash].m_iCounter ); ARRAY_FOREACH ( i, pTree->m_dChildren ) SignCommonSubtrees ( pTree->m_dChildren[i], hSubTrees ); } int sphMarkCommonSubtrees ( int iXQ, const XQQuery_t * pXQ ) { if ( iXQ<=0 || !pXQ ) return 0; { // Optional reorganize tree to extract common parts RevealCommon_t ( SPH_QUERY_AND ).Transform ( iXQ, pXQ ); RevealCommon_t ( SPH_QUERY_OR ).Transform ( iXQ, pXQ ); } // flag common subtrees and refcount them CSubtreeHash hSubtrees; for ( int i=0; i m_dChildren; ///< non-plain node children bool m_bFieldSpec; ///< whether field spec was already explicitly set CSphSmallBitvec m_dFieldMask; ///< fields mask (spec part) int m_iFieldMaxPos; ///< max position within field (spec part) CSphVector m_dZones; ///< zone indexes in per-query zones list CSphVector m_dWords; ///< query words (plain node) int m_iOpArg; ///< operator argument (proximity distance, quorum count) int m_iAtomPos; ///< atom position override (currently only used within expanded nodes) bool m_bVirtuallyPlain; ///< "virtually plain" flag (currently only used by expanded nodes) bool m_bNotWeighted; ///< this our expanded but empty word's node public: /// ctor XQNode_t () : m_pParent ( NULL ) , m_eOp ( SPH_QUERY_AND ) , m_iOrder ( 0 ) , m_iCounter ( 0 ) , m_iMagicHash ( 0 ) , m_bFieldSpec ( false ) , m_iFieldMaxPos ( 0 ) , m_iOpArg ( 0 ) , m_iAtomPos ( -1 ) , m_bVirtuallyPlain ( false ) , m_bNotWeighted ( false ) { m_dFieldMask.Set(); } /// dtor ~XQNode_t () { ARRAY_FOREACH ( i, m_dChildren ) SafeDelete ( m_dChildren[i] ); } /// check if i'm empty bool IsEmpty () const { assert ( m_dWords.GetLength()==0 || m_dChildren.GetLength()==0 ); return m_dWords.GetLength()==0 && m_dChildren.GetLength()==0; } /// setup field limits void SetFieldSpec ( const CSphSmallBitvec& uMask, int iMaxPos ); /// setup zone limits void SetZoneSpec ( const CSphVector & dZones ); /// copy field/zone limits from another node void CopySpecs ( const XQNode_t * pSpecs ); /// unconditionally clear field mask void ClearFieldMask (); public: /// get my operator XQOperator_e GetOp () const { return m_eOp; } /// get my cache order DWORD GetOrder () const { return m_iOrder; } /// get my cache counter int GetCount () const { return m_iCounter; } /// setup common nodes for caching void TagAsCommon ( int iOrder, int iCounter ) { m_iCounter = iCounter; m_iOrder = iOrder; } /// precise comparison bool IsEqualTo ( const XQNode_t * pNode ); /// hash me uint64_t GetHash () const; /// setup new operator and args void SetOp ( XQOperator_e eOp, XQNode_t * pArg1, XQNode_t * pArg2=NULL ); /// setup new operator and args void SetOp ( XQOperator_e eOp, CSphVector & dArgs ) { m_eOp = eOp; m_dChildren.SwapData(dArgs); } /// setup new operator (careful parser/transform use only) void SetOp ( XQOperator_e eOp ) { m_eOp = eOp; } #ifndef NDEBUG /// consistency check void Check ( bool bRoot ) { assert ( bRoot || !IsEmpty() ); // empty leaves must be removed from the final tree; empty root is allowed assert (!( m_dWords.GetLength() && m_eOp!=SPH_QUERY_AND && m_eOp!=SPH_QUERY_PHRASE && m_eOp!=SPH_QUERY_PROXIMITY && m_eOp!=SPH_QUERY_QUORUM )); // words are only allowed in these node types assert (!( m_dWords.GetLength()==1 && m_eOp!=SPH_QUERY_AND )); // 1-word leaves must be of AND type ARRAY_FOREACH ( i, m_dChildren ) m_dChildren[i]->Check ( false ); } #endif }; /// extended query struct XQQuery_t : public ISphNoncopyable { CSphString m_sParseError; CSphString m_sParseWarning; CSphVector m_dZones; XQNode_t * m_pRoot; /// ctor XQQuery_t () { m_pRoot = NULL; } /// dtor ~XQQuery_t () { SafeDelete ( m_pRoot ); } }; ////////////////////////////////////////////////////////////////////////////// /// parses the query and returns the resulting tree /// return false and fills tQuery.m_sParseError on error /// WARNING, parsed tree might be NULL (eg. if query was empty) bool sphParseExtendedQuery ( XQQuery_t & tQuery, const char * sQuery, const ISphTokenizer * pTokenizer, const CSphSchema * pSchema, CSphDict * pDict, int iStopwordStep ); /// analyse vector of trees and tag common parts of them (to cache them later) int sphMarkCommonSubtrees ( int iXQ, const XQQuery_t * pXQ ); #endif // _sphinxquery_ // // $Id$ // coreseek-4.1-beta/csft-4.1/src/sphinxquery.y100777 0 0 10065 11643565732 14063 0%{ #if USE_WINDOWS #pragma warning(push,1) #endif %} %lex-param { XQParser_t * pParser } %parse-param { XQParser_t * pParser } %pure-parser %error-verbose %union { XQNode_t * pNode; // tree node struct { int iValue; int iStrIndex; } tInt; struct // field spec { CSphSmallBitvec dMask; // acceptable fields mask int iMaxPos; // max allowed position within field } tFieldLimit; int iZoneVec; }; %token TOK_KEYWORD %token TOK_NEAR %token TOK_INT %token TOK_FIELDLIMIT %token TOK_ZONE %token TOK_BEFORE %token TOK_SENTENCE %token TOK_PARAGRAPH %type rawkeyword %type keyword %type phrasetoken %type phrase %type sp_item %type sentence %type paragraph %type atom %type atomf %type orlist %type orlistf %type beforelist %type expr %left TOK_BEFORE TOK_NEAR %% query: expr { pParser->AddQuery ( $1 ); } ; rawkeyword: TOK_KEYWORD { $$ = $1; } | TOK_INT { $$ = pParser->AddKeyword ( ( $1.iStrIndex>=0 ) ? pParser->m_dIntTokens[$1.iStrIndex].cstr() : NULL ); } ; keyword: rawkeyword | rawkeyword '$' { $$ = $1; assert ( $$->m_dWords.GetLength()==1 ); $$->m_dWords[0].m_bFieldEnd = true; } | '^' rawkeyword { $$ = $2; assert ( $$->m_dWords.GetLength()==1 ); $$->m_dWords[0].m_bFieldStart = true; } | '^' rawkeyword '$' { $$ = $2; assert ( $$->m_dWords.GetLength()==1 ); $$->m_dWords[0].m_bFieldStart = true; $$->m_dWords[0].m_bFieldEnd = true; } ; phrasetoken: keyword { $$ = $1; } | '(' { $$ = NULL; } | ')' { $$ = NULL; } | '-' { $$ = NULL; } | '|' { $$ = NULL; } | '~' { $$ = NULL; } | '/' { $$ = NULL; } ; phrase: phrasetoken { $$ = $1; } | phrase phrasetoken { $$ = pParser->AddKeyword ( $1, $2 ); } ; sp_item: keyword { $$ = $1; } | '"' phrase '"' { $$ = $2; if ( $$ ) { assert ( $$->m_dWords.GetLength() ); $$->SetOp ( SPH_QUERY_PHRASE); } } ; sentence: sp_item TOK_SENTENCE sp_item { $$ = pParser->AddOp ( SPH_QUERY_SENTENCE, $1, $3 ); } | sentence TOK_SENTENCE sp_item { $$ = pParser->AddOp ( SPH_QUERY_SENTENCE, $1, $3 ); } ; paragraph: sp_item TOK_PARAGRAPH sp_item { $$ = pParser->AddOp ( SPH_QUERY_PARAGRAPH, $1, $3 ); } | paragraph TOK_PARAGRAPH sp_item { $$ = pParser->AddOp ( SPH_QUERY_PARAGRAPH, $1, $3 ); } ; atom: keyword { $$ = $1; } | sentence { $$ = $1; } | paragraph { $$ = $1; } | '"' '"' { $$ = NULL; } | '"' '"' '~' TOK_INT { $$ = NULL; } | '"' '"' '/' TOK_INT { $$ = NULL; } | '"' phrase '"' { $$ = $2; if ( $$ ) { assert ( $$->m_dWords.GetLength() ); $$->SetOp ( SPH_QUERY_PHRASE); } } | '"' phrase '"' '~' TOK_INT { $$ = $2; if ( $$ ) { assert ( $$->m_dWords.GetLength() ); $$->SetOp ( SPH_QUERY_PROXIMITY ); $$->m_iOpArg = $5.iValue; } } | '"' phrase '"' '/' TOK_INT { $$ = $2; if ( $$ ) { assert ( $$->m_dWords.GetLength() ); $$->SetOp ( SPH_QUERY_QUORUM ); $$->m_iOpArg = $5.iValue; } } | '(' expr ')' { $$ = $2; if ( $$ ) $$->m_bFieldSpec = false; } ; atomf: atom { $$ = $1; } | TOK_FIELDLIMIT atom { $$ = $2; if ( $$ ) $$->SetFieldSpec ( $1.dMask, $1.iMaxPos ); } | TOK_ZONE atom { $$ = $2; if ( $$ ) $$->SetZoneSpec ( pParser->GetZoneVec ( $1 ) ); } ; orlist: atomf { $$ = $1; } | orlist '|' atomf { $$ = pParser->AddOp ( SPH_QUERY_OR, $1, $3 ); } ; orlistf: orlist { $$ = $1; } | '-' orlist { $$ = pParser->AddOp ( SPH_QUERY_NOT, $2, NULL ); } | TOK_FIELDLIMIT '-' orlist { $$ = pParser->AddOp ( SPH_QUERY_NOT, $3, NULL ); $$->SetFieldSpec ( $1.dMask, $1.iMaxPos ); } ; beforelist: orlistf | beforelist TOK_BEFORE orlistf { $$ = pParser->AddOp ( SPH_QUERY_BEFORE, $1, $3 ); } | beforelist TOK_NEAR orlistf { $$ = pParser->AddOp ( SPH_QUERY_NEAR, $1, $3, $2.iValue ); } ; expr: beforelist { $$ = $1; } | expr beforelist { $$ = pParser->AddOp ( SPH_QUERY_AND, $1, $2 ); } ; %% #if USE_WINDOWS #pragma warning(pop) #endif coreseek-4.1-beta/csft-4.1/src/sphinxrt.cpp100777 0 0 474625 11643565732 13715 0// // $Id$ // // // Copyright (c) 2001-2011, Andrew Aksyonoff // Copyright (c) 2008-2011, Sphinx Technologies Inc // All rights reserved // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License. You should have // received a copy of the GPL license along with this program; if you // did not, you can find it at http://www.gnu.org/ // #include "sphinx.h" #include "sphinxint.h" #include "sphinxrt.h" #include "sphinxsearch.h" #include "sphinxutils.h" #include #include #if USE_WINDOWS #include // for open(), close() #include #else #include #include #endif ////////////////////////////////////////////////////////////////////////// #define BINLOG_WRITE_BUFFER 256*1024 #define BINLOG_AUTO_FLUSH 1000000 #define BINLOG_RESTART_SIZE 128*1024*1024 #if USE_64BIT #define WORDID_MAX U64C(0xffffffffffffffff) #else #define WORDID_MAX 0xffffffffUL #endif // RT hitman typedef Hitman_c<8> HITMAN; ////////////////////////////////////////////////////////////////////////// #ifndef NDEBUG #define Verify(_expr) assert(_expr) #else #define Verify(_expr) _expr #endif ////////////////////////////////////////////////////////////////////////// // !COMMIT cleanup extern ref to sphinx.cpp extern void sphSortDocinfos ( DWORD * pBuf, int iCount, int iStride ); // !COMMIT yes i am when debugging #ifndef NDEBUG #define PARANOID 1 #endif ////////////////////////////////////////////////////////////////////////// template < typename T, typename P > static inline void ZipT ( CSphVector < BYTE, P > & dOut, T uValue ) { do { BYTE bOut = (BYTE)( uValue & 0x7f ); uValue >>= 7; if ( uValue ) bOut |= 0x80; dOut.Add ( bOut ); } while ( uValue ); } template < typename T > static inline const BYTE * UnzipT ( T * pValue, const BYTE * pIn ) { T uValue = 0; BYTE bIn; int iOff = 0; do { bIn = *pIn++; uValue += ( T ( bIn & 0x7f ) ) << iOff; iOff += 7; } while ( bIn & 0x80 ); *pValue = uValue; return pIn; } #define ZipDword ZipT #define ZipQword ZipT #define UnzipDword UnzipT #define UnzipQword UnzipT #if USE_64BIT #define ZipDocid ZipQword #define ZipWordid ZipQword #define UnzipDocid UnzipQword #define UnzipWordid UnzipQword #else #define ZipDocid ZipDword #define ZipWordid ZipDword #define UnzipDocid UnzipDword #define UnzipWordid UnzipDword #endif ////////////////////////////////////////////////////////////////////////// struct CmpHit_fn { inline bool IsLess ( const CSphWordHit & a, const CSphWordHit & b ) { return ( a.m_iWordID struct RtDoc_tmpl { DOCID m_uDocID; ///< my document id CSphSmallBitvec m_dFields; ///< fields mask DWORD m_uHits; ///< hit count DWORD m_uHit; ///< either index into segment hits, or the only hit itself (if hit count is 1) }; template < typename WORDID = SphWordID_t > struct RtWord_tmpl { WORDID m_uWordID; ///< my keyword id DWORD m_uDocs; ///< document count (for stats and/or BM25) DWORD m_uHits; ///< hit count (for stats and/or BM25) DWORD m_uDoc; ///< index into segment docs }; typedef RtDoc_tmpl<> RtDoc_t; typedef RtWord_tmpl<> RtWord_t; struct RtWordCheckpoint_t { SphWordID_t m_uWordID; int m_iOffset; }; class RtDiskKlist_t : public ISphNoncopyable { private: static const int MAX_SMALL_SIZE = 512; CSphVector < SphAttr_t > m_dLargeKlist; CSphOrderedHash < bool, SphDocID_t, IdentityHash_fn, MAX_SMALL_SIZE, 11 > m_hSmallKlist; mutable CSphRwlock m_tRwLargelock; mutable CSphRwlock m_tRwSmalllock; void NakedFlush(); // flush without lockers public: RtDiskKlist_t() { m_tRwLargelock.Init(); m_tRwSmalllock.Init(); } virtual ~RtDiskKlist_t() { m_tRwLargelock.Done(); m_tRwSmalllock.Done(); } void Reset (); void Flush() { if ( m_hSmallKlist.GetLength()==0 ) return; m_tRwSmalllock.WriteLock(); m_tRwLargelock.WriteLock(); NakedFlush(); m_tRwLargelock.Unlock(); m_tRwSmalllock.Unlock(); } void LoadFromFile ( const char * sFilename ); void SaveToFile ( const char * sFilename ); inline void Delete ( SphDocID_t uDoc ) { m_tRwSmalllock.WriteLock(); if ( !m_hSmallKlist.Exists ( uDoc ) ) m_hSmallKlist.Add ( true, uDoc ); if ( m_hSmallKlist.GetLength()>=MAX_SMALL_SIZE ) NakedFlush(); m_tRwSmalllock.Unlock(); } inline const SphAttr_t * GetKillList () const { return m_dLargeKlist.Begin(); } inline int GetKillListSize () const { return m_dLargeKlist.GetLength(); } inline bool KillListLock() const { return m_tRwLargelock.ReadLock(); } inline bool KillListUnlock() const { return m_tRwLargelock.Unlock(); } // NOT THREAD SAFE bool Exists ( SphDocID_t uDoc ) { return ( m_hSmallKlist.Exists ( uDoc ) || m_dLargeKlist.BinarySearch ( SphAttr_t(uDoc))!=NULL ); } }; void RtDiskKlist_t::Reset() { m_dLargeKlist.Reset(); m_hSmallKlist.Reset(); } void RtDiskKlist_t::NakedFlush() { if ( m_hSmallKlist.GetLength()==0 ) return; m_hSmallKlist.IterateStart(); while ( m_hSmallKlist.IterateNext() ) m_dLargeKlist.Add ( m_hSmallKlist.IterateGetKey() ); m_dLargeKlist.Uniq(); m_hSmallKlist.Reset(); } // is already id32<>id64 safe void RtDiskKlist_t::LoadFromFile ( const char * sFilename ) { m_tRwLargelock.WriteLock(); m_tRwSmalllock.WriteLock(); m_hSmallKlist.Reset(); m_tRwSmalllock.Unlock(); m_dLargeKlist.Reset(); CSphString sName, sError; sName.SetSprintf ( "%s.kill", sFilename ); if ( !sphIsReadable ( sName.cstr(), &sError ) ) { m_tRwLargelock.Unlock(); return; } CSphAutoreader rdKlist; if ( !rdKlist.Open ( sName, sError ) ) { m_tRwLargelock.Unlock(); return; } m_dLargeKlist.Resize ( rdKlist.GetDword() ); SphDocID_t uLastDocID = 0; ARRAY_FOREACH ( i, m_dLargeKlist ) { uLastDocID += ( SphDocID_t ) rdKlist.UnzipOffset(); m_dLargeKlist[i] = uLastDocID; }; m_tRwLargelock.Unlock(); } void RtDiskKlist_t::SaveToFile ( const char * sFilename ) { m_tRwLargelock.WriteLock(); m_tRwSmalllock.WriteLock(); NakedFlush(); m_tRwSmalllock.Unlock(); CSphWriter wrKlist; CSphString sName, sError; sName.SetSprintf ( "%s.kill", sFilename ); wrKlist.OpenFile ( sName.cstr(), sError ); wrKlist.PutDword ( m_dLargeKlist.GetLength() ); SphDocID_t uLastDocID = 0; ARRAY_FOREACH ( i, m_dLargeKlist ) { wrKlist.ZipOffset ( m_dLargeKlist[i] - uLastDocID ); uLastDocID = ( SphDocID_t ) m_dLargeKlist[i]; }; m_tRwLargelock.Unlock(); wrKlist.CloseFile (); } struct RtSegment_t { protected: static const int KLIST_ACCUM_THRESH = 32; public: static CSphStaticMutex m_tSegmentSeq; static int m_iSegments; ///< age tag sequence generator int m_iTag; ///< segment age tag CSphTightVector m_dWords; CSphVector m_dWordCheckpoints; CSphTightVector m_dDocs; CSphTightVector m_dHits; int m_iRows; ///< number of actually allocated rows int m_iAliveRows; ///< number of alive (non-killed) rows CSphVector m_dRows; ///< row data storage CSphVector m_dKlist; ///< sorted K-list bool m_bTlsKlist; ///< whether to apply TLS K-list during merge (must only be used by writer during Commit()) CSphTightVector m_dStrings; ///< strings storage CSphTightVector m_dMvas; ///< MVAs storage RtSegment_t () { m_tSegmentSeq.Lock (); m_iTag = m_iSegments++; m_tSegmentSeq.Unlock (); m_iRows = 0; m_iAliveRows = 0; m_bTlsKlist = false; m_dStrings.Add ( 0 ); // dummy zero offset m_dMvas.Add ( 0 ); // dummy zero offset } int64_t GetUsedRam () const { // FIXME! gonna break on vectors over 2GB return m_dWords.GetLimit()*sizeof(m_dWords[0]) + m_dDocs.GetLimit()*sizeof(m_dDocs[0]) + m_dHits.GetLimit()*sizeof(m_dHits[0]) + m_dStrings.GetLimit()*sizeof(m_dStrings[0])+ m_dMvas.GetLimit()*sizeof(m_dMvas[0]); } int GetMergeFactor () const { return m_iRows; } const CSphRowitem * FindRow ( SphDocID_t uDocid ) const; const CSphRowitem * FindAliveRow ( SphDocID_t uDocid ) const; }; int RtSegment_t::m_iSegments = 0; CSphStaticMutex RtSegment_t::m_tSegmentSeq; const CSphRowitem * RtSegment_t::FindRow ( SphDocID_t uDocid ) const { // binary search through the rows int iStride = m_dRows.GetLength() / m_iRows; SphDocID_t uL = DOCINFO2ID ( m_dRows.Begin() ); SphDocID_t uR = DOCINFO2ID ( &m_dRows[m_dRows.GetLength()-iStride] ); if ( uDocid==uL ) return m_dRows.Begin(); if ( uDocid==uR ) return &m_dRows[m_dRows.GetLength()-iStride]; if ( uDocid