bogofilter-1.2.4/0000755000175000017500000000000012201507133012030 5ustar sezsezbogofilter-1.2.4/configure0000755000175000017500000135770312163573273013776 0ustar sezsez#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69 for bogofilter 1.2.4. # # # Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1 test -x / || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : export CONFIG_SHELL # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='bogofilter' PACKAGE_TARNAME='bogofilter' PACKAGE_VERSION='1.2.4' PACKAGE_STRING='bogofilter 1.2.4' PACKAGE_BUGREPORT='' PACKAGE_URL='' # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_unique_file="src/bogofilter.c" ac_header_list= ac_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS transformed_bogoutil transformed_bogofilter NEED_GETOPT_FALSE NEED_GETOPT_TRUE NEED_GSL_FALSE NEED_GSL_TRUE GSL_LIBS GSL_CFLAGS GSL_CONFIG HAVE_EXTENDED_PRECISION_REGISTERS ENABLE_XMLTO_FALSE ENABLE_XMLTO_TRUE ac_cv_enable_xmlto NEEDTRIO_FALSE NEEDTRIO_TRUE ENABLE_TOKYOCABINET_DATASTORE_FALSE ENABLE_TOKYOCABINET_DATASTORE_TRUE ENABLE_SQLITE_DATASTORE_FALSE ENABLE_SQLITE_DATASTORE_TRUE ENABLE_QDBM_DATASTORE_FALSE ENABLE_QDBM_DATASTORE_TRUE STATIC_DB DB_TYPE DB_EXT LTLIBDB LIBDB LTLIBQDBM LIBQDBM LTLIBTOKYOCABINET LIBTOKYOCABINET LTLIBSQLITE3 LIBSQLITE3 ENABLE_TRANSACTIONS_FALSE ENABLE_TRANSACTIONS_TRUE DISABLE_TRANSACTIONS_FALSE DISABLE_TRANSACTIONS_TRUE USE_TRANSACTIONS LIBOBJS ENABLE_MEMDEBUG_FALSE ENABLE_MEMDEBUG_TRUE DEFAULT_CHARSET ENCODING LTLIBICONV LIBICONV ENABLE_UNICODE_FALSE ENABLE_UNICODE_TRUE DISABLE_UNICODE_FALSE DISABLE_UNICODE_TRUE USE_UNICODE EXE_EXT ENABLE_STATIC_FALSE ENABLE_STATIC_TRUE STATICLDFLAGS PATCH_FLEX_253X_FALSE PATCH_FLEX_253X_TRUE PATCH_FLEX_254_FALSE PATCH_FLEX_254_TRUE USE_GCC4_FALSE USE_GCC4_TRUE HAVE_EXTERN_INLINE HAVE_INLINE LEXLIB LEX_OUTPUT_ROOT LEX XMLLINT RPMBUILD NSGMLS PERL RANLIB AR am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE am__nodep AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM host_os host_vendor host_cpu host build_os build_vendor build_cpu build EGREP GREP CPP OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_dependency_tracking enable_largefile enable_static enable_spam_header_name enable_unicode with_gnu_ld enable_rpath with_libiconv_prefix enable_russian with_charset enable_memdebug enable_transactions enable_dummy enable_dbshared_test with_database with_libsqlite3_prefix with_libtokyocabinet_prefix with_libqdbm_prefix with_libdb_prefix with_included_gsl with_gsl_prefix with_gsl_exec_prefix enable_gsltest ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures bogofilter 1.2.4 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/bogofilter] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of bogofilter 1.2.4:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-dependency-tracking do not reject slow dependency extractors --disable-dependency-tracking speeds up one-time build --disable-largefile omit support for large files --enable-static build static versions as well (unsupported). --enable-spam-header-name=name use specified header name instead of "X-Bogosity" --disable-unicode disables Unicode/UTF-8 conversion of character sets --disable-rpath do not hardcode runtime library paths --enable-russian switch default character set to CP866 [[iso-8859-1]] --enable-memdebug enable memory usage debugging --enable-transactions force transactional mode (disable traditional) in Berkeley DB [compile both modes and select at run-time] --disable-transactions disable transactional mode (force traditional) in Berkeley DB [compile both modes and select at run-time] --disable-dbshared-test defeat test for shared environment (unsafe) --disable-gsltest Do not try to compile and run a test GSL program 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-libiconv-prefix[=DIR] search for libiconv in DIR/include and DIR/lib --without-libiconv-prefix don't search for libiconv in includedir and libdir --with-charset=name use specified charset (overrides --enable-russian) [[iso-8859-1]] --with-database=ENGINE choose database engine {db|qdbm|sqlite3|tokyocabinet} [[db]] --with-libsqlite3-prefix[=DIR] search for libsqlite3 in DIR/include and DIR/lib --without-libsqlite3-prefix don't search for libsqlite3 in includedir and libdir --with-libtokyocabinet-prefix[=DIR] search for libtokyocabinet in DIR/include and DIR/lib --without-libtokyocabinet-prefix don't search for libtokyocabinet in includedir and libdir --with-libqdbm-prefix[=DIR] search for libqdbm in DIR/include and DIR/lib --without-libqdbm-prefix don't search for libqdbm in includedir and libdir --with-libdb-prefix[=DIR] search for libdb in DIR/include and DIR/lib --without-libdb-prefix don't search for libdb in includedir and libdir --with-included-gsl force use of shipped GSL rather than system GSL --with-gsl-prefix=PFX Prefix where GSL is installed (optional) --with-gsl-exec-prefix=PFX Exec prefix where GSL is installed (optional) Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CPP C preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to the package provider. _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF bogofilter configure 1.2.4 generated by GNU Autoconf 2.69 Copyright (C) 2012 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists, giving a warning if it cannot be compiled using # the include files in INCLUDES and setting the cache variable VAR # accordingly. ac_fn_c_check_header_mongrel () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if eval \${$3+:} false; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.i conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_mongrel # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_compile # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || test -x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_check_decl LINENO SYMBOL VAR INCLUDES # --------------------------------------------- # Tests whether SYMBOL is declared in INCLUDES, setting cache variable VAR # accordingly. ac_fn_c_check_decl () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack as_decl_name=`echo $2|sed 's/ *(.*//'` as_decl_use=`echo $2|sed -e 's/(/((/' -e 's/)/) 0&/' -e 's/,/) 0& (/g'` { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $as_decl_name is declared" >&5 $as_echo_n "checking whether $as_decl_name is declared... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { #ifndef $as_decl_name #ifdef __cplusplus (void) $as_decl_use; #else (void) $as_decl_name; #endif #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_decl # ac_fn_c_check_type LINENO TYPE VAR INCLUDES # ------------------------------------------- # Tests whether TYPE exists after having included INCLUDES, setting cache # variable VAR accordingly. ac_fn_c_check_type () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=no" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof ($2)) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof (($2))) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else eval "$3=yes" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_type # ac_fn_c_compute_int LINENO EXPR VAR INCLUDES # -------------------------------------------- # Tries to find the compile-time value of EXPR in a program that includes # INCLUDES, setting VAR accordingly. Returns whether the value could be # computed ac_fn_c_compute_int () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if test "$cross_compiling" = yes; then # Depending upon the size, compute the lo and hi bounds. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= 0)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=0 ac_mid=0 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid; break else as_fn_arith $ac_mid + 1 && ac_lo=$as_val if test $ac_lo -le $ac_mid; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid + 1 && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) < 0)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=-1 ac_mid=-1 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=$ac_mid; break else as_fn_arith '(' $ac_mid ')' - 1 && ac_hi=$as_val if test $ac_mid -le $ac_hi; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else ac_lo= ac_hi= fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext # Binary search between lo and hi bounds. while test "x$ac_lo" != "x$ac_hi"; do as_fn_arith '(' $ac_hi - $ac_lo ')' / 2 + $ac_lo && ac_mid=$as_val cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid else as_fn_arith '(' $ac_mid ')' + 1 && ac_lo=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done case $ac_lo in #(( ?*) eval "$3=\$ac_lo"; ac_retval=0 ;; '') ac_retval=1 ;; esac else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 static long int longval () { return $2; } static unsigned long int ulongval () { return $2; } #include #include int main () { FILE *f = fopen ("conftest.val", "w"); if (! f) return 1; if (($2) < 0) { long int i = longval (); if (i != ($2)) return 1; fprintf (f, "%ld", i); } else { unsigned long int i = ulongval (); if (i != ($2)) return 1; fprintf (f, "%lu", i); } /* Do not output a trailing newline, as this causes \r\n confusion on some platforms. */ return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : echo >>conftest.val; read $3 &5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_func cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by bogofilter $as_me 1.2.4, which was generated by GNU Autoconf 2.69. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi as_fn_append ac_header_list " stdlib.h" as_fn_append ac_header_list " unistd.h" as_fn_append ac_header_list " sys/param.h" # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "C compiler cannot create executables See \`config.log' for more details" "$LINENO" 5; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details" "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if ${ac_cv_objext+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of object files: cannot compile See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if ${ac_cv_prog_CPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_GREP" || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if ${ac_cv_path_EGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_EGREP" || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done ac_fn_c_check_header_mongrel "$LINENO" "minix/config.h" "ac_cv_header_minix_config_h" "$ac_includes_default" if test "x$ac_cv_header_minix_config_h" = xyes; then : MINIX=yes else MINIX= fi if test "$MINIX" = yes; then $as_echo "#define _POSIX_SOURCE 1" >>confdefs.h $as_echo "#define _POSIX_1_SOURCE 2" >>confdefs.h $as_echo "#define _MINIX 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether it is safe to define __EXTENSIONS__" >&5 $as_echo_n "checking whether it is safe to define __EXTENSIONS__... " >&6; } if ${ac_cv_safe_to_define___extensions__+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ # define __EXTENSIONS__ 1 $ac_includes_default int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_safe_to_define___extensions__=yes else ac_cv_safe_to_define___extensions__=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_safe_to_define___extensions__" >&5 $as_echo "$ac_cv_safe_to_define___extensions__" >&6; } test $ac_cv_safe_to_define___extensions__ = yes && $as_echo "#define __EXTENSIONS__ 1" >>confdefs.h $as_echo "#define _ALL_SOURCE 1" >>confdefs.h $as_echo "#define _GNU_SOURCE 1" >>confdefs.h $as_echo "#define _POSIX_PTHREAD_SEMANTICS 1" >>confdefs.h $as_echo "#define _TANDEM_SOURCE 1" >>confdefs.h 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 as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if ${ac_cv_build+:} false; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if ${ac_cv_host+:} false; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac am__api_version='1.12' # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if ${ac_cv_path_install+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;; esac # Do 'set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error $? "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi if test "$2" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done test "$2" = conftest.file ) then # Ok. : else as_fn_error $? "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi rm -f conftest.file test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using 'strip' when the user # run "make install-strip". However 'strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the 'STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if ${ac_cv_path_mkdir+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AWK+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering ...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from 'make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='bogofilter' VERSION='1.2.4' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # mkdir_p='$(MKDIR_P)' # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AMTAR='$${TAR-tar}' am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -' depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CC_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi ac_config_headers="$ac_config_headers src/config.h:config.in" for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AWK+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done 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 for ac_prog in gcc xlc cc do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in gcc xlc cc do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu 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 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AR="${ac_tool_prefix}ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi 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 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_AR="ar" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_AR" = x; then AR="no" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac AR=$ac_ct_AR fi else AR="$ac_cv_prog_AR" fi if test "$AR" = no ; then as_fn_error $? "Please make sure that \"ar\" is in your PATH." "$LINENO" 5 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 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi for ac_prog in perl perl5 do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_PERL+:} false; then : $as_echo_n "(cached) " >&6 else case $PERL in [\\/]* | ?:[\\/]*) ac_cv_path_PERL="$PERL" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_dummy="$PATH:/usr/local/bin:/usr/bin" for as_dir in $as_dummy do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_path_PERL="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS ;; esac fi PERL=$ac_cv_path_PERL if test -n "$PERL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PERL" >&5 $as_echo "$PERL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$PERL" && break done for ac_prog in onsgmls nsgmls do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_NSGMLS+:} false; then : $as_echo_n "(cached) " >&6 else case $NSGMLS in [\\/]* | ?:[\\/]*) ac_cv_path_NSGMLS="$NSGMLS" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_path_NSGMLS="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS ;; esac fi NSGMLS=$ac_cv_path_NSGMLS if test -n "$NSGMLS"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NSGMLS" >&5 $as_echo "$NSGMLS" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$NSGMLS" && break done test -n "$NSGMLS" || NSGMLS="nsgmls" for ac_prog in rpmbuild rpm do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_RPMBUILD+:} false; then : $as_echo_n "(cached) " >&6 else case $RPMBUILD in [\\/]* | ?:[\\/]*) ac_cv_path_RPMBUILD="$RPMBUILD" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_path_RPMBUILD="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS ;; esac fi RPMBUILD=$ac_cv_path_RPMBUILD if test -n "$RPMBUILD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RPMBUILD" >&5 $as_echo "$RPMBUILD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$RPMBUILD" && break done test -n "$RPMBUILD" || RPMBUILD="rpmbuild" for ac_prog in xmllint do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_XMLLINT+:} false; then : $as_echo_n "(cached) " >&6 else case $XMLLINT in [\\/]* | ?:[\\/]*) ac_cv_path_XMLLINT="$XMLLINT" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_path_XMLLINT="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS ;; esac fi XMLLINT=$ac_cv_path_XMLLINT if test -n "$XMLLINT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $XMLLINT" >&5 $as_echo "$XMLLINT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$XMLLINT" && break done test -n "$XMLLINT" || XMLLINT="xmllint" for ac_prog in flex lex do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_LEX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$LEX"; then ac_cv_prog_LEX="$LEX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_LEX="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LEX=$ac_cv_prog_LEX if test -n "$LEX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LEX" >&5 $as_echo "$LEX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$LEX" && break done test -n "$LEX" || LEX=":" if test "x$LEX" != "x:"; then cat >conftest.l <<_ACEOF %% a { ECHO; } b { REJECT; } c { yymore (); } d { yyless (1); } e { /* IRIX 6.5 flex 2.5.4 underquotes its yyless argument. */ yyless ((input () != 0)); } f { unput (yytext[0]); } . { BEGIN INITIAL; } %% #ifdef YYTEXT_POINTER extern char *yytext; #endif int main (void) { return ! yylex () + ! yywrap (); } _ACEOF { { ac_try="$LEX conftest.l" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$LEX conftest.l") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking lex output file root" >&5 $as_echo_n "checking lex output file root... " >&6; } if ${ac_cv_prog_lex_root+:} false; then : $as_echo_n "(cached) " >&6 else if test -f lex.yy.c; then ac_cv_prog_lex_root=lex.yy elif test -f lexyy.c; then ac_cv_prog_lex_root=lexyy else as_fn_error $? "cannot find output from $LEX; giving up" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_lex_root" >&5 $as_echo "$ac_cv_prog_lex_root" >&6; } LEX_OUTPUT_ROOT=$ac_cv_prog_lex_root if test -z "${LEXLIB+set}"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking lex library" >&5 $as_echo_n "checking lex library... " >&6; } if ${ac_cv_lib_lex+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_LIBS=$LIBS ac_cv_lib_lex='none needed' for ac_lib in '' -lfl -ll; do LIBS="$ac_lib $ac_save_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ `cat $LEX_OUTPUT_ROOT.c` _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_lex=$ac_lib fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext test "$ac_cv_lib_lex" != 'none needed' && break done LIBS=$ac_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_lex" >&5 $as_echo "$ac_cv_lib_lex" >&6; } test "$ac_cv_lib_lex" != 'none needed' && LEXLIB=$ac_cv_lib_lex fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether yytext is a pointer" >&5 $as_echo_n "checking whether yytext is a pointer... " >&6; } if ${ac_cv_prog_lex_yytext_pointer+:} false; then : $as_echo_n "(cached) " >&6 else # POSIX says lex can declare yytext either as a pointer or an array; the # default is implementation-dependent. Figure out which it is, since # not all implementations provide the %pointer and %array declarations. ac_cv_prog_lex_yytext_pointer=no ac_save_LIBS=$LIBS LIBS="$LEXLIB $ac_save_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #define YYTEXT_POINTER 1 `cat $LEX_OUTPUT_ROOT.c` _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_prog_lex_yytext_pointer=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_lex_yytext_pointer" >&5 $as_echo "$ac_cv_prog_lex_yytext_pointer" >&6; } if test $ac_cv_prog_lex_yytext_pointer = yes; then $as_echo "#define YYTEXT_POINTER 1" >>confdefs.h fi rm -f conftest.l $LEX_OUTPUT_ROOT.c fi if test "$LEX" = :; then LEX=${am_missing_run}flex fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for an ANSI C-conforming const" >&5 $as_echo_n "checking for an ANSI C-conforming const... " >&6; } if ${ac_cv_c_const+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __cplusplus /* Ultrix mips cc rejects this sort of thing. */ typedef int charset[2]; const charset cs = { 0, 0 }; /* SunOS 4.1.1 cc rejects this. */ char const *const *pcpcc; char **ppc; /* NEC SVR4.0.2 mips cc rejects this. */ struct point {int x, y;}; static struct point const zero = {0,0}; /* AIX XL C 1.02.0.0 rejects this. It does not let you subtract one const X* pointer from another in an arm of an if-expression whose if-part is not a constant expression */ const char *g = "string"; pcpcc = &g + (g ? g-g : 0); /* HPUX 7.0 cc rejects these. */ ++pcpcc; ppc = (char**) pcpcc; pcpcc = (char const *const *) ppc; { /* SCO 3.2v4 cc rejects this sort of thing. */ char tx; char *t = &tx; char const *s = 0 ? (char *) 0 : (char const *) 0; *t++ = 0; if (s) return 0; } { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ int x[] = {25, 17}; const int *foo = &x[0]; ++foo; } { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ typedef const int *iptr; iptr p = 0; ++p; } { /* AIX XL C 1.02.0.0 rejects this sort of thing, saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; } bx; struct s *b = &bx; b->j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; if (!foo) return 0; } return !cs[0] && !zero.x; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_const=yes else ac_cv_c_const=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_const" >&5 $as_echo "$ac_cv_c_const" >&6; } if test $ac_cv_c_const = no; then $as_echo "#define const /**/" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for inline" >&5 $as_echo_n "checking for inline... " >&6; } if ${ac_cv_c_inline+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_c_inline=no for ac_kw in inline __inline__ __inline; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef __cplusplus typedef int foo_t; static $ac_kw foo_t static_foo () {return 0; } $ac_kw foo_t foo () {return 0; } #endif _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_inline=$ac_kw fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext test "$ac_cv_c_inline" != no && break done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_inline" >&5 $as_echo "$ac_cv_c_inline" >&6; } case $ac_cv_c_inline in inline | yes) ;; *) case $ac_cv_c_inline in no) ac_val=;; *) ac_val=$ac_cv_c_inline;; esac cat >>confdefs.h <<_ACEOF #ifndef __cplusplus #define inline $ac_val #endif _ACEOF ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for working volatile" >&5 $as_echo_n "checking for working volatile... " >&6; } if ${ac_cv_c_volatile+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { volatile int x; int * volatile y = (int *) 0; return !x && !y; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_volatile=yes else ac_cv_c_volatile=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_volatile" >&5 $as_echo "$ac_cv_c_volatile" >&6; } if test $ac_cv_c_volatile = no; then $as_echo "#define volatile /**/" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C/C++ restrict keyword" >&5 $as_echo_n "checking for C/C++ restrict keyword... " >&6; } if ${ac_cv_c_restrict+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_c_restrict=no # The order here caters to the fact that C++ does not require restrict. for ac_kw in __restrict __restrict__ _Restrict restrict; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ typedef int * int_ptr; int foo (int_ptr $ac_kw ip) { return ip[0]; } int main () { int s[1]; int * $ac_kw t = s; t[0] = 0; return foo(t) ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_restrict=$ac_kw fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext test "$ac_cv_c_restrict" != no && break done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_restrict" >&5 $as_echo "$ac_cv_c_restrict" >&6; } case $ac_cv_c_restrict in restrict) ;; no) $as_echo "#define restrict /**/" >>confdefs.h ;; *) cat >>confdefs.h <<_ACEOF #define restrict $ac_cv_c_restrict _ACEOF ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test "$ac_cv_c_inline" != no ; then $as_echo "#define HAVE_INLINE 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for extern inline" >&5 $as_echo_n "checking for extern inline... " >&6; } if ${ac_cv_c_extern_inline+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_c_extern_inline=no cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ extern $ac_cv_c_inline double foo(double x); extern $ac_cv_c_inline double foo(double x) { return x+1.0; }; double foo (double x) { return x + 1.0; }; int main () { foo(1.0) ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_extern_inline="yes" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_extern_inline" >&5 $as_echo "$ac_cv_c_extern_inline" >&6; } if test "$ac_cv_c_extern_inline" != no ; then $as_echo "#define HAVE_EXTERN_INLINE 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a working shell..." >&5 $as_echo_n "checking for a working shell...... " >&6; } for i in /usr/xpg6/bin/sh /usr/xpg4/bin/sh /usr/ccs/bin/sh /bin/sh /usr/bin/sh /bin/ksh /bin/bash /usr/local/bin/bash ; do $i -c 'if ! false ; then echo $(echo ok) ; fi' >config.$$ 2>/dev/null j=`cat config.$$` rm -f config.$$ if test "x$j" = "xok" ; then SHELL=$i break fi done { $as_echo "$as_me:${as_lineno-$LINENO}: result: $SHELL" >&5 $as_echo "$SHELL" >&6; } if test "x$SHELL" = "x" ; then as_fn_error install SUNWxcu4 "no SUS compliant shell found - on Solaris" "$LINENO" 5 fi if test "x$host_cpu" = "xs390" && test "x$GCC" = "xyes" ; then case ${CFLAGS} in *-O*) OCFLAGS="$CFLAGS" CFLAGS="`echo \"$CFLAGS\" | sed 's/-O[s1-9][0-9]*/-O1/'`" export CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: GCC for s390: Overriding CFLAGS \"$OCFLAGS\" to \"$CFLAGS\"." >&5 $as_echo "$as_me: GCC for s390: Overriding CFLAGS \"$OCFLAGS\" to \"$CFLAGS\"." >&6;} esac fi case "$host_os" in dgux*) if test "$GCC" = yes ; then case "`$CC --version`" in 2.7*) case ${CFLAGS} in *-g*) OCFLAGS="$CFLAGS" CFLAGS="" for i in $OCFLAGS ; do case x$i in x-g*) ;; *) CFLAGS="$CFLAGS$i " ;; esac done { $as_echo "$as_me:${as_lineno-$LINENO}: dgux: Removing -g options from CFLAGS, new: \"$CFLAGS\"." >&5 $as_echo "$as_me: dgux: Removing -g options from CFLAGS, new: \"$CFLAGS\"." >&6;} ;; esac ;; esac fi ;; esac if test "$GCC" = yes ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if gcc is really Intel C++" >&5 $as_echo_n "checking if gcc is really Intel C++... " >&6; } case "`$CC -V 2>&1`" in [iI][nN][tT][eE][lL]*) ICC=yes ;; *) ICC=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ICC" >&5 $as_echo "$ICC" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for additional compiler options" >&5 $as_echo_n "checking for additional compiler options... " >&6; } if ${ac_cv_prog_gcc_flags+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_gcc_flags="" if test "$GCC" = yes && test "$ICC" = no then echo "void dummy(void);" >configure-dummy.c echo "void dummy(void) {}" >>configure-dummy.c addopts= # note: GCC 2.X print just the version number, like "2.95.3" # GCC 3.X print something like "gcc (GCC) 3.3.1 (SuSE Linux)" case `$CC --version` in 2.*) ;; *) addopts="$addopts -Wpointer-arith -ggdb" ;; esac for i in $addopts \ -mieee \ -Wall -W -Wstrict-prototypes -Wmissing-prototypes -Wshadow \ -Wbad-function-cast -Wcast-qual -Wcast-align -Wwrite-strings \ -Waggregate-return -Wmissing-declarations \ -Wmissing-format-attribute -Wnested-externs \ -fno-common -Wchar-subscripts -Wcomment \ -Wimplicit -Wsequence-point -Wreturn-type \ -Wno-system-headers -Wformat # -Wfloat-equal -Wformat=2 # -Wmissing-noreturn -Wconversion -pedantic -Wredundant-decls do if $CC $i $ac_cv_prog_gcc_flags -c configure-dummy.c >/dev/null 2>&1 then ac_cv_prog_gcc_flags="$ac_cv_prog_gcc_flags $i" else echo "ignoring $i" fi done fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_gcc_flags" >&5 $as_echo "$ac_cv_prog_gcc_flags" >&6; } rm -f configure-dummy.c configure-dummy.o CFLAGS="$CFLAGS $ac_cv_prog_gcc_flags" gcc4=no if test "$GCC" = yes && test "$ICC" = no ; then case `$CC -dumpversion 2>/dev/null` in ""|2.*|3.*) ;; 4.*) gcc4=yes ;; esac case "$CC" in *clang) gcc4=yes ;; esac fi if test $gcc4 = yes; then USE_GCC4_TRUE= USE_GCC4_FALSE='#' else USE_GCC4_TRUE='#' USE_GCC4_FALSE= fi flex=no if test -n "$LEX"; then case `$LEX --version` in *2.5.4) flex=254 ;; *2.5.31) flex=253x ;; *2.5.33) flex=253x ;; *2.5.35) flex=O.K. ;; esac fi if test $flex = 254; then PATCH_FLEX_254_TRUE= PATCH_FLEX_254_FALSE='#' else PATCH_FLEX_254_TRUE='#' PATCH_FLEX_254_FALSE= fi if test $flex = 253x; then PATCH_FLEX_253X_TRUE= PATCH_FLEX_253X_FALSE='#' else PATCH_FLEX_253X_TRUE='#' PATCH_FLEX_253X_FALSE= fi # Check whether --enable-largefile was given. if test "${enable_largefile+set}" = set; then : enableval=$enable_largefile; fi if test "$enable_largefile" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for special C compiler options needed for large files" >&5 $as_echo_n "checking for special C compiler options needed for large files... " >&6; } if ${ac_cv_sys_largefile_CC+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_sys_largefile_CC=no if test "$GCC" != yes; then ac_save_CC=$CC while :; do # IRIX 6.2 and later do not support large files by default, # so use the C compiler's -n32 option if that helps. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include /* Check that off_t can represent 2**63 - 1 correctly. We can't simply define LARGE_OFF_T to be 9223372036854775807, since some C++ compilers masquerading as C compilers incorrectly reject 9223372036854775807. */ #define LARGE_OFF_T (((off_t) 1 << 62) - 1 + ((off_t) 1 << 62)) int off_t_is_large[(LARGE_OFF_T % 2147483629 == 721 && LARGE_OFF_T % 2147483647 == 1) ? 1 : -1]; int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : break fi rm -f core conftest.err conftest.$ac_objext CC="$CC -n32" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_sys_largefile_CC=' -n32'; break fi rm -f core conftest.err conftest.$ac_objext break done CC=$ac_save_CC rm -f conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sys_largefile_CC" >&5 $as_echo "$ac_cv_sys_largefile_CC" >&6; } if test "$ac_cv_sys_largefile_CC" != no; then CC=$CC$ac_cv_sys_largefile_CC fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for _FILE_OFFSET_BITS value needed for large files" >&5 $as_echo_n "checking for _FILE_OFFSET_BITS value needed for large files... " >&6; } if ${ac_cv_sys_file_offset_bits+:} false; then : $as_echo_n "(cached) " >&6 else while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include /* Check that off_t can represent 2**63 - 1 correctly. We can't simply define LARGE_OFF_T to be 9223372036854775807, since some C++ compilers masquerading as C compilers incorrectly reject 9223372036854775807. */ #define LARGE_OFF_T (((off_t) 1 << 62) - 1 + ((off_t) 1 << 62)) int off_t_is_large[(LARGE_OFF_T % 2147483629 == 721 && LARGE_OFF_T % 2147483647 == 1) ? 1 : -1]; int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_sys_file_offset_bits=no; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #define _FILE_OFFSET_BITS 64 #include /* Check that off_t can represent 2**63 - 1 correctly. We can't simply define LARGE_OFF_T to be 9223372036854775807, since some C++ compilers masquerading as C compilers incorrectly reject 9223372036854775807. */ #define LARGE_OFF_T (((off_t) 1 << 62) - 1 + ((off_t) 1 << 62)) int off_t_is_large[(LARGE_OFF_T % 2147483629 == 721 && LARGE_OFF_T % 2147483647 == 1) ? 1 : -1]; int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_sys_file_offset_bits=64; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_sys_file_offset_bits=unknown break done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sys_file_offset_bits" >&5 $as_echo "$ac_cv_sys_file_offset_bits" >&6; } case $ac_cv_sys_file_offset_bits in #( no | unknown) ;; *) cat >>confdefs.h <<_ACEOF #define _FILE_OFFSET_BITS $ac_cv_sys_file_offset_bits _ACEOF ;; esac rm -rf conftest* if test $ac_cv_sys_file_offset_bits = unknown; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for _LARGE_FILES value needed for large files" >&5 $as_echo_n "checking for _LARGE_FILES value needed for large files... " >&6; } if ${ac_cv_sys_large_files+:} false; then : $as_echo_n "(cached) " >&6 else while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include /* Check that off_t can represent 2**63 - 1 correctly. We can't simply define LARGE_OFF_T to be 9223372036854775807, since some C++ compilers masquerading as C compilers incorrectly reject 9223372036854775807. */ #define LARGE_OFF_T (((off_t) 1 << 62) - 1 + ((off_t) 1 << 62)) int off_t_is_large[(LARGE_OFF_T % 2147483629 == 721 && LARGE_OFF_T % 2147483647 == 1) ? 1 : -1]; int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_sys_large_files=no; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #define _LARGE_FILES 1 #include /* Check that off_t can represent 2**63 - 1 correctly. We can't simply define LARGE_OFF_T to be 9223372036854775807, since some C++ compilers masquerading as C compilers incorrectly reject 9223372036854775807. */ #define LARGE_OFF_T (((off_t) 1 << 62) - 1 + ((off_t) 1 << 62)) int off_t_is_large[(LARGE_OFF_T % 2147483629 == 721 && LARGE_OFF_T % 2147483647 == 1) ? 1 : -1]; int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_sys_large_files=1; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_sys_large_files=unknown break done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sys_large_files" >&5 $as_echo "$ac_cv_sys_large_files" >&6; } case $ac_cv_sys_large_files in #( no | unknown) ;; *) cat >>confdefs.h <<_ACEOF #define _LARGE_FILES $ac_cv_sys_large_files _ACEOF ;; esac rm -rf conftest* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for cos in -lm" >&5 $as_echo_n "checking for cos in -lm... " >&6; } if ${ac_cv_lib_m_cos+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lm $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char cos (); int main () { return cos (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_m_cos=yes else ac_cv_lib_m_cos=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_cos" >&5 $as_echo "$ac_cv_lib_m_cos" >&6; } if test "x$ac_cv_lib_m_cos" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBM 1 _ACEOF LIBS="-lm $LIBS" fi ac_fn_c_check_decl "$LINENO" "getopt" "ac_cv_have_decl_getopt" " #include /* Solaris */ #include " if test "x$ac_cv_have_decl_getopt" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_GETOPT $ac_have_decl _ACEOF ac_fn_c_check_decl "$LINENO" "optreset" "ac_cv_have_decl_optreset" " #include /* Solaris */ #include " if test "x$ac_cv_have_decl_optreset" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_OPTRESET $ac_have_decl _ACEOF ac_fn_c_check_decl "$LINENO" "O_DSYNC" "ac_cv_have_decl_O_DSYNC" "#include " if test "x$ac_cv_have_decl_O_DSYNC" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_O_DSYNC $ac_have_decl _ACEOF ac_fn_c_check_decl "$LINENO" "O_SYNC" "ac_cv_have_decl_O_SYNC" "#include " if test "x$ac_cv_have_decl_O_SYNC" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_O_SYNC $ac_have_decl _ACEOF ac_fn_c_check_decl "$LINENO" "O_FSYNC" "ac_cv_have_decl_O_FSYNC" "#include " if test "x$ac_cv_have_decl_O_FSYNC" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_O_FSYNC $ac_have_decl _ACEOF $as_echo "#define __NO_CTYPE 1" >>confdefs.h # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; fi case a$enable_static in ayes) EXE_EXT="_static" { $as_echo "$as_me:${as_lineno-$LINENO}: checking option to link statically" >&5 $as_echo_n "checking option to link statically... " >&6; } LDEFLAGS="$LDFLAGS" found=0 for i in -static ; do LDFLAGS="$LDEFLAGS $i" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { exit (0); ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : found=1 fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $found -eq 1 ; then break ; fi done if test $found -eq 1 ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $i" >&5 $as_echo "$i" >&6; } STATICLDFLAGS=$i LDFLAGS="$LDEFLAGS" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ?" >&5 $as_echo "?" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot figure out how to statically link a program." >&5 $as_echo "$as_me: WARNING: Cannot figure out how to statically link a program." >&2;} STATICLDFLAGS= enable_static=no fi ;; ano|a) ;; *) STATICLDFLAGS="$enable_static" enable_static=yes ;; esac export STATICLDFLAGS if test x$enable_static = xyes; then ENABLE_STATIC_TRUE= ENABLE_STATIC_FALSE='#' else ENABLE_STATIC_TRUE='#' ENABLE_STATIC_FALSE= fi # Check whether --enable-spam-header-name was given. if test "${enable_spam_header_name+set}" = set; then : enableval=$enable_spam_header_name; cat >>confdefs.h <<_ACEOF #define SPAM_HEADER_NAME "$enableval" _ACEOF else cat >>confdefs.h <<_ACEOF #define SPAM_HEADER_NAME "X-Bogosity" _ACEOF fi # Check whether --enable-unicode was given. if test "${enable_unicode+set}" = set; then : enableval=$enable_unicode; if test "$enableval" = no; then USE_UNICODE=NO fi if test "$enableval" = yes; then USE_UNICODE=YES fi if test x$USE_UNICODE != x ; then cat >>confdefs.h <<_ACEOF #define USE_UNICODE "$USE_UNICODE" _ACEOF fi fi if test x$USE_UNICODE = xNO; then DISABLE_UNICODE_TRUE= DISABLE_UNICODE_FALSE='#' else DISABLE_UNICODE_TRUE='#' DISABLE_UNICODE_FALSE= fi if test x$USE_UNICODE != xNO; then ENABLE_UNICODE_TRUE= ENABLE_UNICODE_FALSE='#' else ENABLE_UNICODE_TRUE='#' ENABLE_UNICODE_FALSE= fi if test x$USE_UNICODE = xNO ; then $as_echo "#define DISABLE_UNICODE 1" >>confdefs.h ENCODING="raw" else if test "X$prefix" = "XNONE"; then acl_final_prefix="$ac_default_prefix" else acl_final_prefix="$prefix" fi if test "X$exec_prefix" = "XNONE"; then acl_final_exec_prefix='${prefix}' else acl_final_exec_prefix="$exec_prefix" fi acl_save_prefix="$prefix" prefix="$acl_final_prefix" eval acl_final_exec_prefix=\"$acl_final_exec_prefix\" prefix="$acl_save_prefix" # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi # Prepare PATH_SEPARATOR. # 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 ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by GCC" >&5 $as_echo_n "checking for ld used by GCC... " >&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. [\\/]* | [A-Za-z]:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the path of ld ac_prog=`echo $ac_prog| sed 's%\\\\%/%g'` while echo $ac_prog | grep "$re_direlt" > /dev/null 2>&1; do ac_prog=`echo $ac_prog| sed "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${acl_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}${PATH_SEPARATOR-:}" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then acl_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 `"$acl_cv_path_LD" -v 2>&1 < /dev/null` in *GNU* | *'with BFD'*) test "$with_gnu_ld" != no && break ;; *) test "$with_gnu_ld" != yes && break ;; esac fi done IFS="$ac_save_ifs" else acl_cv_path_LD="$LD" # Let the user override the test with a path. fi fi LD="$acl_cv_path_LD" if test -n "$LD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LD" >&5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${acl_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU ld's only accept -v. case `$LD -v 2>&1 &5 $as_echo "$acl_cv_prog_gnu_ld" >&6; } with_gnu_ld=$acl_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shared library run path origin" >&5 $as_echo_n "checking for shared library run path origin... " >&6; } if ${acl_cv_rpath+:} false; then : $as_echo_n "(cached) " >&6 else CC="$CC" GCC="$GCC" LDFLAGS="$LDFLAGS" LD="$LD" with_gnu_ld="$with_gnu_ld" \ ${CONFIG_SHELL-/bin/sh} "$ac_aux_dir/config.rpath" "$host" > conftest.sh . ./conftest.sh rm -f ./conftest.sh acl_cv_rpath=done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acl_cv_rpath" >&5 $as_echo "$acl_cv_rpath" >&6; } wl="$acl_cv_wl" libext="$acl_cv_libext" shlibext="$acl_cv_shlibext" hardcode_libdir_flag_spec="$acl_cv_hardcode_libdir_flag_spec" hardcode_libdir_separator="$acl_cv_hardcode_libdir_separator" hardcode_direct="$acl_cv_hardcode_direct" hardcode_minus_L="$acl_cv_hardcode_minus_L" # Check whether --enable-rpath was given. if test "${enable_rpath+set}" = set; then : enableval=$enable_rpath; : else enable_rpath=yes fi use_additional=yes acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" # Check whether --with-libiconv-prefix was given. if test "${with_libiconv_prefix+set}" = set; then : withval=$with_libiconv_prefix; if test "X$withval" = "Xno"; then use_additional=no else if test "X$withval" = "X"; then acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" else additional_includedir="$withval/include" additional_libdir="$withval/lib" fi fi fi LIBICONV= LTLIBICONV= INCICONV= rpathdirs= ltrpathdirs= names_already_handled= names_next_round='iconv ' while test -n "$names_next_round"; do names_this_round="$names_next_round" names_next_round= for name in $names_this_round; do already_handled= for n in $names_already_handled; do if test "$n" = "$name"; then already_handled=yes break fi done if test -z "$already_handled"; then names_already_handled="$names_already_handled $name" uppername=`echo "$name" | sed -e 'y|abcdefghijklmnopqrstuvwxyz./-|ABCDEFGHIJKLMNOPQRSTUVWXYZ___|'` eval value=\"\$HAVE_LIB$uppername\" if test -n "$value"; then if test "$value" = yes; then eval value=\"\$LIB$uppername\" test -z "$value" || LIBICONV="${LIBICONV}${LIBICONV:+ }$value" eval value=\"\$LTLIB$uppername\" test -z "$value" || LTLIBICONV="${LTLIBICONV}${LTLIBICONV:+ }$value" else : fi else found_dir= found_la= found_so= found_a= if test $use_additional = yes; then if test -n "$shlibext" && test -f "$additional_libdir/lib$name.$shlibext"; then found_dir="$additional_libdir" found_so="$additional_libdir/lib$name.$shlibext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi else if test -f "$additional_libdir/lib$name.$libext"; then found_dir="$additional_libdir" found_a="$additional_libdir/lib$name.$libext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi fi fi fi if test "X$found_dir" = "X"; then for x in $LDFLAGS $LTLIBICONV; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" case "$x" in -L*) dir=`echo "X$x" | sed -e 's/^X-L//'` if test -n "$shlibext" && test -f "$dir/lib$name.$shlibext"; then found_dir="$dir" found_so="$dir/lib$name.$shlibext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi else if test -f "$dir/lib$name.$libext"; then found_dir="$dir" found_a="$dir/lib$name.$libext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi fi fi ;; esac if test "X$found_dir" != "X"; then break fi done fi if test "X$found_dir" != "X"; then LTLIBICONV="${LTLIBICONV}${LTLIBICONV:+ }-L$found_dir -l$name" if test "X$found_so" != "X"; then if test "$enable_rpath" = no || test "X$found_dir" = "X/usr/lib"; then LIBICONV="${LIBICONV}${LIBICONV:+ }$found_so" else haveit= for x in $ltrpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $found_dir" fi if test "$hardcode_direct" = yes; then LIBICONV="${LIBICONV}${LIBICONV:+ }$found_so" else if test -n "$hardcode_libdir_flag_spec" && test "$hardcode_minus_L" = no; then LIBICONV="${LIBICONV}${LIBICONV:+ }$found_so" haveit= for x in $rpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $found_dir" fi else haveit= for x in $LDFLAGS $LIBICONV; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then LIBICONV="${LIBICONV}${LIBICONV:+ }-L$found_dir" fi if test "$hardcode_minus_L" != no; then LIBICONV="${LIBICONV}${LIBICONV:+ }$found_so" else LIBICONV="${LIBICONV}${LIBICONV:+ }-l$name" fi fi fi fi else if test "X$found_a" != "X"; then LIBICONV="${LIBICONV}${LIBICONV:+ }$found_a" else LIBICONV="${LIBICONV}${LIBICONV:+ }-L$found_dir -l$name" fi fi additional_includedir= case "$found_dir" in */lib | */lib/) basedir=`echo "X$found_dir" | sed -e 's,^X,,' -e 's,/lib/*$,,'` additional_includedir="$basedir/include" ;; esac if test "X$additional_includedir" != "X"; then if test "X$additional_includedir" != "X/usr/include"; then haveit= if test "X$additional_includedir" = "X/usr/local/include"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then for x in $CPPFLAGS $INCICONV; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-I$additional_includedir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_includedir"; then INCICONV="${INCICONV}${INCICONV:+ }-I$additional_includedir" fi fi fi fi fi if test -n "$found_la"; then save_libdir="$libdir" case "$found_la" in */* | *\\*) . "$found_la" ;; *) . "./$found_la" ;; esac libdir="$save_libdir" for dep in $dependency_libs; do case "$dep" in -L*) additional_libdir=`echo "X$dep" | sed -e 's/^X-L//'` if test "X$additional_libdir" != "X/usr/lib"; then haveit= if test "X$additional_libdir" = "X/usr/local/lib"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then haveit= for x in $LDFLAGS $LIBICONV; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LIBICONV="${LIBICONV}${LIBICONV:+ }-L$additional_libdir" fi fi haveit= for x in $LDFLAGS $LTLIBICONV; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LTLIBICONV="${LTLIBICONV}${LTLIBICONV:+ }-L$additional_libdir" fi fi fi fi ;; -R*) dir=`echo "X$dep" | sed -e 's/^X-R//'` if test "$enable_rpath" != no; then haveit= for x in $rpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $dir" fi haveit= for x in $ltrpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $dir" fi fi ;; -l*) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's/^X-l//'` ;; *.la) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's,^X.*/,,' -e 's,^lib,,' -e 's,\.la$,,'` ;; *) LIBICONV="${LIBICONV}${LIBICONV:+ }$dep" LTLIBICONV="${LTLIBICONV}${LTLIBICONV:+ }$dep" ;; esac done fi else LIBICONV="${LIBICONV}${LIBICONV:+ }-l$name" LTLIBICONV="${LTLIBICONV}${LTLIBICONV:+ }-l$name" fi fi fi done done if test "X$rpathdirs" != "X"; then if test -n "$hardcode_libdir_separator"; then alldirs= for found_dir in $rpathdirs; do alldirs="${alldirs}${alldirs:+$hardcode_libdir_separator}$found_dir" done acl_save_libdir="$libdir" libdir="$alldirs" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBICONV="${LIBICONV}${LIBICONV:+ }$flag" else for found_dir in $rpathdirs; do acl_save_libdir="$libdir" libdir="$found_dir" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBICONV="${LIBICONV}${LIBICONV:+ }$flag" done fi fi if test "X$ltrpathdirs" != "X"; then for found_dir in $ltrpathdirs; do LTLIBICONV="${LTLIBICONV}${LTLIBICONV:+ }-R$found_dir" done fi am_save_CPPFLAGS="$CPPFLAGS" for element in $INCICONV; do haveit= for x in $CPPFLAGS; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X$element"; then haveit=yes break fi done if test -z "$haveit"; then CPPFLAGS="${CPPFLAGS}${CPPFLAGS:+ }$element" fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for iconv" >&5 $as_echo_n "checking for iconv... " >&6; } if ${am_cv_func_iconv+:} false; then : $as_echo_n "(cached) " >&6 else am_cv_func_iconv="no, consider installing GNU libiconv" am_cv_lib_iconv=no cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { iconv_t cd = iconv_open("",""); iconv(cd,NULL,NULL,NULL,NULL); iconv_close(cd); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : am_cv_func_iconv=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "$am_cv_func_iconv" != yes; then am_save_LIBS="$LIBS" LIBS="$LIBS $LIBICONV" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { iconv_t cd = iconv_open("",""); iconv(cd,NULL,NULL,NULL,NULL); iconv_close(cd); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : am_cv_lib_iconv=yes am_cv_func_iconv=yes fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS="$am_save_LIBS" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_func_iconv" >&5 $as_echo "$am_cv_func_iconv" >&6; } if test "$am_cv_func_iconv" = yes; then $as_echo "#define HAVE_ICONV 1" >>confdefs.h fi if test "$am_cv_lib_iconv" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to link with libiconv" >&5 $as_echo_n "checking how to link with libiconv... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIBICONV" >&5 $as_echo "$LIBICONV" >&6; } else CPPFLAGS="$am_save_CPPFLAGS" LIBICONV= LTLIBICONV= fi if test "$am_cv_func_iconv" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for iconv declaration" >&5 $as_echo_n "checking for iconv declaration... " >&6; } if ${am_cv_proto_iconv+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include extern #ifdef __cplusplus "C" #endif #if defined(__STDC__) || defined(__cplusplus) size_t iconv (iconv_t cd, char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft); #else size_t iconv(); #endif int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : am_cv_proto_iconv_arg1="" else am_cv_proto_iconv_arg1="const" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext am_cv_proto_iconv="extern size_t iconv (iconv_t cd, $am_cv_proto_iconv_arg1 char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft);" fi am_cv_proto_iconv=`echo "$am_cv_proto_iconv" | tr -s ' ' | sed -e 's/( /(/'` { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${ac_t:- }$am_cv_proto_iconv" >&5 $as_echo "${ac_t:- }$am_cv_proto_iconv" >&6; } cat >>confdefs.h <<_ACEOF #define ICONV_CONST $am_cv_proto_iconv_arg1 _ACEOF fi $as_echo "#define ENABLE_UNICODE 1" >>confdefs.h ENCODING="utf-8" fi DEFAULT_CHARSET="iso-8859-1" if test x$USE_UNICODE != xYES ; then # Check whether --enable-russian was given. if test "${enable_russian+set}" = set; then : enableval=$enable_russian; if test "$enableval" = no; then USE_CP866=NO else USE_CP866=YES fi fi if test x$USE_CP866 = xYES ; then $as_echo "#define CP866 1" >>confdefs.h DEFAULT_CHARSET="CP866" fi fi # Check whether --with-charset was given. if test "${with_charset+set}" = set; then : withval=$with_charset; cat >>confdefs.h <<_ACEOF #define DEFAULT_CHARSET "$withval" _ACEOF fi cat >>confdefs.h <<_ACEOF #define DEFAULT_CHARSET "$DEFAULT_CHARSET" _ACEOF # Check whether --enable-memdebug was given. if test "${enable_memdebug+set}" = set; then : enableval=$enable_memdebug; if test "$enableval" = no; then USE_MEMDEBUG=NO else USE_MEMDEBUG=YES fi fi if test x$USE_MEMDEBUG = xYES ; then $as_echo "#define ENABLE_MEMDEBUG 1" >>confdefs.h fi if test x$USE_MEMDEBUG = xYES; then ENABLE_MEMDEBUG_TRUE= ENABLE_MEMDEBUG_FALSE='#' else ENABLE_MEMDEBUG_TRUE='#' ENABLE_MEMDEBUG_FALSE= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdbool.h that conforms to C99" >&5 $as_echo_n "checking for stdbool.h that conforms to C99... " >&6; } if ${ac_cv_header_stdbool_h+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #ifndef bool # error bool is not defined #endif #ifndef false # error false is not defined #endif #if false # error false is not 0 #endif #ifndef true # error true is not defined #endif #if true != 1 # error true is not 1 #endif #ifndef __bool_true_false_are_defined # error __bool_true_false_are_defined is not defined #endif struct s { _Bool s: 1; _Bool t; } s; char a[true == 1 ? 1 : -1]; char b[false == 0 ? 1 : -1]; char c[__bool_true_false_are_defined == 1 ? 1 : -1]; char d[(bool) -0.5 == true ? 1 : -1]; bool e = &s; char f[(_Bool) -0.0 == false ? 1 : -1]; char g[true]; char h[sizeof (_Bool)]; char i[sizeof s.t]; int main () { return !a + !b + !c + !d + !e + !f + !g + !h + !i; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdbool_h=yes else ac_cv_header_stdbool_h=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdbool_h" >&5 $as_echo "$ac_cv_header_stdbool_h" >&6; } ac_fn_c_check_type "$LINENO" "_Bool" "ac_cv_type__Bool" "$ac_includes_default" if test "x$ac_cv_type__Bool" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE__BOOL 1 _ACEOF fi if test $ac_cv_header_stdbool_h = yes; then $as_echo "#define HAVE_STDBOOL_H 1" >>confdefs.h fi ac_header_dirent=no for ac_hdr in dirent.h sys/ndir.h sys/dir.h ndir.h; do as_ac_Header=`$as_echo "ac_cv_header_dirent_$ac_hdr" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_hdr that defines DIR" >&5 $as_echo_n "checking for $ac_hdr that defines DIR... " >&6; } if eval \${$as_ac_Header+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include <$ac_hdr> int main () { if ((DIR *) 0) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$as_ac_Header=yes" else eval "$as_ac_Header=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$as_ac_Header { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_hdr" | $as_tr_cpp` 1 _ACEOF ac_header_dirent=$ac_hdr; break fi done # Two versions of opendir et al. are in -ldir and -lx on SCO Xenix. if test $ac_header_dirent = dirent.h; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing opendir" >&5 $as_echo_n "checking for library containing opendir... " >&6; } if ${ac_cv_search_opendir+:} false; then : $as_echo_n "(cached) " >&6 else ac_func_search_save_LIBS=$LIBS cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char opendir (); int main () { return opendir (); ; return 0; } _ACEOF for ac_lib in '' dir; do if test -z "$ac_lib"; then ac_res="none required" else ac_res=-l$ac_lib LIBS="-l$ac_lib $ac_func_search_save_LIBS" fi if ac_fn_c_try_link "$LINENO"; then : ac_cv_search_opendir=$ac_res fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext if ${ac_cv_search_opendir+:} false; then : break fi done if ${ac_cv_search_opendir+:} false; then : else ac_cv_search_opendir=no fi rm conftest.$ac_ext LIBS=$ac_func_search_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_opendir" >&5 $as_echo "$ac_cv_search_opendir" >&6; } ac_res=$ac_cv_search_opendir if test "$ac_res" != no; then : test "$ac_res" = "none required" || LIBS="$ac_res $LIBS" fi else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing opendir" >&5 $as_echo_n "checking for library containing opendir... " >&6; } if ${ac_cv_search_opendir+:} false; then : $as_echo_n "(cached) " >&6 else ac_func_search_save_LIBS=$LIBS cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char opendir (); int main () { return opendir (); ; return 0; } _ACEOF for ac_lib in '' x; do if test -z "$ac_lib"; then ac_res="none required" else ac_res=-l$ac_lib LIBS="-l$ac_lib $ac_func_search_save_LIBS" fi if ac_fn_c_try_link "$LINENO"; then : ac_cv_search_opendir=$ac_res fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext if ${ac_cv_search_opendir+:} false; then : break fi done if ${ac_cv_search_opendir+:} false; then : else ac_cv_search_opendir=no fi rm conftest.$ac_ext LIBS=$ac_func_search_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_opendir" >&5 $as_echo "$ac_cv_search_opendir" >&6; } ac_res=$ac_cv_search_opendir if test "$ac_res" != no; then : test "$ac_res" = "none required" || LIBS="$ac_res $LIBS" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether time.h and sys/time.h may both be included" >&5 $as_echo_n "checking whether time.h and sys/time.h may both be included... " >&6; } if ${ac_cv_header_time+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include int main () { if ((struct tm *) 0) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_time=yes else ac_cv_header_time=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_time" >&5 $as_echo "$ac_cv_header_time" >&6; } if test $ac_cv_header_time = yes; then $as_echo "#define TIME_WITH_SYS_TIME 1" >>confdefs.h fi for ac_header in syslog.h sys/param.h fcntl.h string.h strings.h unistd.h sys/time.h sys/select.h inttypes.h stdarg.h stdint.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default" if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in limits.h float.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default" if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF else for ac_header in values.h do : ac_fn_c_check_header_mongrel "$LINENO" "values.h" "ac_cv_header_values_h" "$ac_includes_default" if test "x$ac_cv_header_values_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_VALUES_H 1 _ACEOF fi done fi done ac_fn_c_check_type "$LINENO" "pid_t" "ac_cv_type_pid_t" "$ac_includes_default" if test "x$ac_cv_type_pid_t" = xyes; then : else cat >>confdefs.h <<_ACEOF #define pid_t int _ACEOF fi ac_fn_c_check_type "$LINENO" "size_t" "ac_cv_type_size_t" "$ac_includes_default" if test "x$ac_cv_type_size_t" = xyes; then : else cat >>confdefs.h <<_ACEOF #define size_t unsigned int _ACEOF fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for uid_t in sys/types.h" >&5 $as_echo_n "checking for uid_t in sys/types.h... " >&6; } if ${ac_cv_type_uid_t+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "uid_t" >/dev/null 2>&1; then : ac_cv_type_uid_t=yes else ac_cv_type_uid_t=no fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_type_uid_t" >&5 $as_echo "$ac_cv_type_uid_t" >&6; } if test $ac_cv_type_uid_t = no; then $as_echo "#define uid_t int" >>confdefs.h $as_echo "#define gid_t int" >>confdefs.h fi for ac_header in sys/select.h sys/socket.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default" if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking types of arguments for select" >&5 $as_echo_n "checking types of arguments for select... " >&6; } if ${ac_cv_func_select_args+:} false; then : $as_echo_n "(cached) " >&6 else for ac_arg234 in 'fd_set *' 'int *' 'void *'; do for ac_arg1 in 'int' 'size_t' 'unsigned long int' 'unsigned int'; do for ac_arg5 in 'struct timeval *' 'const struct timeval *'; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $ac_includes_default #ifdef HAVE_SYS_SELECT_H # include #endif #ifdef HAVE_SYS_SOCKET_H # include #endif int main () { extern int select ($ac_arg1, $ac_arg234, $ac_arg234, $ac_arg234, $ac_arg5); ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_func_select_args="$ac_arg1,$ac_arg234,$ac_arg5"; break 3 fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done done done # Provide a safe default value. : "${ac_cv_func_select_args=int,int *,struct timeval *}" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_func_select_args" >&5 $as_echo "$ac_cv_func_select_args" >&6; } ac_save_IFS=$IFS; IFS=',' set dummy `echo "$ac_cv_func_select_args" | sed 's/\*/\*/g'` IFS=$ac_save_IFS shift cat >>confdefs.h <<_ACEOF #define SELECT_TYPE_ARG1 $1 _ACEOF cat >>confdefs.h <<_ACEOF #define SELECT_TYPE_ARG234 ($2) _ACEOF cat >>confdefs.h <<_ACEOF #define SELECT_TYPE_ARG5 ($3) _ACEOF rm -f conftest* ac_fn_c_check_type "$LINENO" "uint" "ac_cv_type_uint" "$ac_includes_default" if test "x$ac_cv_type_uint" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_UINT 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "ulong" "ac_cv_type_ulong" "$ac_includes_default" if test "x$ac_cv_type_ulong" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_ULONG 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "uint32_t" "ac_cv_type_uint32_t" "$ac_includes_default" if test "x$ac_cv_type_uint32_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_UINT32_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "u_int32_t" "ac_cv_type_u_int32_t" "$ac_includes_default" if test "x$ac_cv_type_u_int32_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_U_INT32_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "int32_t" "ac_cv_type_int32_t" "$ac_includes_default" if test "x$ac_cv_type_int32_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_INT32_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "int16_t" "ac_cv_type_int16_t" "$ac_includes_default" if test "x$ac_cv_type_int16_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_INT16_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "u_int16_t" "ac_cv_type_u_int16_t" "$ac_includes_default" if test "x$ac_cv_type_u_int16_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_U_INT16_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "uint16_t" "ac_cv_type_uint16_t" "$ac_includes_default" if test "x$ac_cv_type_uint16_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_UINT16_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "u_int8_t" "ac_cv_type_u_int8_t" "$ac_includes_default" if test "x$ac_cv_type_u_int8_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_U_INT8_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "ssize_t" "ac_cv_type_ssize_t" "$ac_includes_default" if test "x$ac_cv_type_ssize_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_SSIZE_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "u_long" "ac_cv_type_u_long" "$ac_includes_default" if test "x$ac_cv_type_u_long" = xyes; then : else cat >>confdefs.h <<_ACEOF #define u_long unsigned long _ACEOF fi ac_fn_c_check_type "$LINENO" "sig_atomic_t" "ac_cv_type_sig_atomic_t" " #include " if test "x$ac_cv_type_sig_atomic_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_SIG_ATOMIC_T 1 _ACEOF fi ac_fn_c_check_type "$LINENO" "rlim_t" "ac_cv_type_rlim_t" " #ifdef HAVE_SYS_TYPES_H #include #endif #ifdef HAVE_SYS_TIME_H #include #endif #include " if test "x$ac_cv_type_rlim_t" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_RLIM_T 1 _ACEOF fi cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of short" >&5 $as_echo_n "checking size of short... " >&6; } if ${ac_cv_sizeof_short+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (short))" "ac_cv_sizeof_short" "$ac_includes_default"; then : else if test "$ac_cv_type_short" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (short) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_short=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_short" >&5 $as_echo "$ac_cv_sizeof_short" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_SHORT $ac_cv_sizeof_short _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of int" >&5 $as_echo_n "checking size of int... " >&6; } if ${ac_cv_sizeof_int+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (int))" "ac_cv_sizeof_int" "$ac_includes_default"; then : else if test "$ac_cv_type_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (int) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_int" >&5 $as_echo "$ac_cv_sizeof_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_INT $ac_cv_sizeof_int _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long" >&5 $as_echo_n "checking size of long... " >&6; } if ${ac_cv_sizeof_long+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long))" "ac_cv_sizeof_long" "$ac_includes_default"; then : else if test "$ac_cv_type_long" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (long) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_long=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long" >&5 $as_echo "$ac_cv_sizeof_long" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_LONG $ac_cv_sizeof_long _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of size_t" >&5 $as_echo_n "checking size of size_t... " >&6; } if ${ac_cv_sizeof_size_t+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (size_t))" "ac_cv_sizeof_size_t" "$ac_includes_default"; then : else if test "$ac_cv_type_size_t" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (size_t) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_size_t=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_size_t" >&5 $as_echo "$ac_cv_sizeof_size_t" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_SIZE_T $ac_cv_sizeof_size_t _ACEOF { $as_echo "$as_me:${as_lineno-$LINENO}: checking for working memcmp" >&5 $as_echo_n "checking for working memcmp... " >&6; } if ${ac_cv_func_memcmp_working+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ac_cv_func_memcmp_working=no else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $ac_includes_default int main () { /* Some versions of memcmp are not 8-bit clean. */ char c0 = '\100', c1 = '\200', c2 = '\201'; if (memcmp(&c0, &c2, 1) >= 0 || memcmp(&c1, &c2, 1) >= 0) return 1; /* The Next x86 OpenStep bug shows up only when comparing 16 bytes or more and with at least one buffer not starting on a 4-byte boundary. William Lewis provided this test program. */ { char foo[21]; char bar[21]; int i; for (i = 0; i < 4; i++) { char *a = foo + i; char *b = bar + i; strcpy (a, "--------01111111"); strcpy (b, "--------10000000"); if (memcmp (a, b, 16) >= 0) return 1; } return 0; } ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ac_cv_func_memcmp_working=yes else ac_cv_func_memcmp_working=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_func_memcmp_working" >&5 $as_echo "$ac_cv_func_memcmp_working" >&6; } test $ac_cv_func_memcmp_working = no && case " $LIBOBJS " in *" memcmp.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS memcmp.$ac_objext" ;; esac for ac_header in $ac_header_list do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_func in getpagesize do : ac_fn_c_check_func "$LINENO" "getpagesize" "ac_cv_func_getpagesize" if test "x$ac_cv_func_getpagesize" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_GETPAGESIZE 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for working mmap" >&5 $as_echo_n "checking for working mmap... " >&6; } if ${ac_cv_func_mmap_fixed_mapped+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ac_cv_func_mmap_fixed_mapped=no else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $ac_includes_default /* malloc might have been renamed as rpl_malloc. */ #undef malloc /* Thanks to Mike Haertel and Jim Avera for this test. Here is a matrix of mmap possibilities: mmap private not fixed mmap private fixed at somewhere currently unmapped mmap private fixed at somewhere already mapped mmap shared not fixed mmap shared fixed at somewhere currently unmapped mmap shared fixed at somewhere already mapped For private mappings, we should verify that changes cannot be read() back from the file, nor mmap's back from the file at a different address. (There have been systems where private was not correctly implemented like the infamous i386 svr4.0, and systems where the VM page cache was not coherent with the file system buffer cache like early versions of FreeBSD and possibly contemporary NetBSD.) For shared mappings, we should conversely verify that changes get propagated back to all the places they're supposed to be. Grep wants private fixed already mapped. The main things grep needs to know about mmap are: * does it exist and is it safe to write into the mmap'd area * how to use it (BSD variants) */ #include #include #if !defined STDC_HEADERS && !defined HAVE_STDLIB_H char *malloc (); #endif /* This mess was copied from the GNU getpagesize.h. */ #ifndef HAVE_GETPAGESIZE # ifdef _SC_PAGESIZE # define getpagesize() sysconf(_SC_PAGESIZE) # else /* no _SC_PAGESIZE */ # ifdef HAVE_SYS_PARAM_H # include # ifdef EXEC_PAGESIZE # define getpagesize() EXEC_PAGESIZE # else /* no EXEC_PAGESIZE */ # ifdef NBPG # define getpagesize() NBPG * CLSIZE # ifndef CLSIZE # define CLSIZE 1 # endif /* no CLSIZE */ # else /* no NBPG */ # ifdef NBPC # define getpagesize() NBPC # else /* no NBPC */ # ifdef PAGESIZE # define getpagesize() PAGESIZE # endif /* PAGESIZE */ # endif /* no NBPC */ # endif /* no NBPG */ # endif /* no EXEC_PAGESIZE */ # else /* no HAVE_SYS_PARAM_H */ # define getpagesize() 8192 /* punt totally */ # endif /* no HAVE_SYS_PARAM_H */ # endif /* no _SC_PAGESIZE */ #endif /* no HAVE_GETPAGESIZE */ int main () { char *data, *data2, *data3; const char *cdata2; int i, pagesize; int fd, fd2; pagesize = getpagesize (); /* First, make a file with some known garbage in it. */ data = (char *) malloc (pagesize); if (!data) return 1; for (i = 0; i < pagesize; ++i) *(data + i) = rand (); umask (0); fd = creat ("conftest.mmap", 0600); if (fd < 0) return 2; if (write (fd, data, pagesize) != pagesize) return 3; close (fd); /* Next, check that the tail of a page is zero-filled. File must have non-zero length, otherwise we risk SIGBUS for entire page. */ fd2 = open ("conftest.txt", O_RDWR | O_CREAT | O_TRUNC, 0600); if (fd2 < 0) return 4; cdata2 = ""; if (write (fd2, cdata2, 1) != 1) return 5; data2 = (char *) mmap (0, pagesize, PROT_READ | PROT_WRITE, MAP_SHARED, fd2, 0L); if (data2 == MAP_FAILED) return 6; for (i = 0; i < pagesize; ++i) if (*(data2 + i)) return 7; close (fd2); if (munmap (data2, pagesize)) return 8; /* Next, try to mmap the file at a fixed address which already has something else allocated at it. If we can, also make sure that we see the same garbage. */ fd = open ("conftest.mmap", O_RDWR); if (fd < 0) return 9; if (data2 != mmap (data2, pagesize, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_FIXED, fd, 0L)) return 10; for (i = 0; i < pagesize; ++i) if (*(data + i) != *(data2 + i)) return 11; /* Finally, make sure that changes to the mapped area do not percolate back to the file as seen by read(). (This is a bug on some variants of i386 svr4.0.) */ for (i = 0; i < pagesize; ++i) *(data2 + i) = *(data2 + i) + 1; data3 = (char *) malloc (pagesize); if (!data3) return 12; if (read (fd, data3, pagesize) != pagesize) return 13; for (i = 0; i < pagesize; ++i) if (*(data + i) != *(data3 + i)) return 14; close (fd); return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ac_cv_func_mmap_fixed_mapped=yes else ac_cv_func_mmap_fixed_mapped=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_func_mmap_fixed_mapped" >&5 $as_echo "$ac_cv_func_mmap_fixed_mapped" >&6; } if test $ac_cv_func_mmap_fixed_mapped = yes; then $as_echo "#define HAVE_MMAP 1" >>confdefs.h fi rm -f conftest.mmap conftest.txt for ac_func in vprintf do : ac_fn_c_check_func "$LINENO" "vprintf" "ac_cv_func_vprintf" if test "x$ac_cv_func_vprintf" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_VPRINTF 1 _ACEOF ac_fn_c_check_func "$LINENO" "_doprnt" "ac_cv_func__doprnt" if test "x$ac_cv_func__doprnt" = xyes; then : $as_echo "#define HAVE_DOPRNT 1" >>confdefs.h fi fi done for ac_func in strchr strrchr memcpy memmove snprintf vsnprintf getopt_long arc4random do : as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh` ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var" if eval test \"x\$"$as_ac_var"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_func" | $as_tr_cpp` 1 _ACEOF fi done ac_fn_c_check_func "$LINENO" "strlcpy" "ac_cv_func_strlcpy" if test "x$ac_cv_func_strlcpy" = xyes; then : $as_echo "#define HAVE_STRLCPY 1" >>confdefs.h else case " $LIBOBJS " in *" strlcpy.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS strlcpy.$ac_objext" ;; esac fi ac_fn_c_check_func "$LINENO" "strlcat" "ac_cv_func_strlcat" if test "x$ac_cv_func_strlcat" = xyes; then : $as_echo "#define HAVE_STRLCAT 1" >>confdefs.h else case " $LIBOBJS " in *" strlcat.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS strlcat.$ac_objext" ;; esac fi ac_fn_c_check_func "$LINENO" "strerror" "ac_cv_func_strerror" if test "x$ac_cv_func_strerror" = xyes; then : $as_echo "#define HAVE_STRERROR 1" >>confdefs.h else case " $LIBOBJS " in *" strerror.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS strerror.$ac_objext" ;; esac fi ac_fn_c_check_func "$LINENO" "strtoul" "ac_cv_func_strtoul" if test "x$ac_cv_func_strtoul" = xyes; then : $as_echo "#define HAVE_STRTOUL 1" >>confdefs.h else case " $LIBOBJS " in *" strtoul.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS strtoul.$ac_objext" ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shared library run path origin" >&5 $as_echo_n "checking for shared library run path origin... " >&6; } if ${acl_cv_rpath+:} false; then : $as_echo_n "(cached) " >&6 else CC="$CC" GCC="$GCC" LDFLAGS="$LDFLAGS" LD="$LD" with_gnu_ld="$with_gnu_ld" \ ${CONFIG_SHELL-/bin/sh} "$ac_aux_dir/config.rpath" "$host" > conftest.sh . ./conftest.sh rm -f ./conftest.sh acl_cv_rpath=done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $acl_cv_rpath" >&5 $as_echo "$acl_cv_rpath" >&6; } wl="$acl_cv_wl" libext="$acl_cv_libext" shlibext="$acl_cv_shlibext" hardcode_libdir_flag_spec="$acl_cv_hardcode_libdir_flag_spec" hardcode_libdir_separator="$acl_cv_hardcode_libdir_separator" hardcode_direct="$acl_cv_hardcode_direct" hardcode_minus_L="$acl_cv_hardcode_minus_L" # Check whether --enable-rpath was given. if test "${enable_rpath+set}" = set; then : enableval=$enable_rpath; : else enable_rpath=yes fi # Check whether --enable-transactions was given. if test "${enable_transactions+set}" = set; then : enableval=$enable_transactions; if test "$enableval" = no; then USE_TRANSACTIONS=NO fi if test "$enableval" = yes; then USE_TRANSACTIONS=YES fi if test x$USE_TRANSACTIONS != x ; then cat >>confdefs.h <<_ACEOF #define USE_TRANSACTIONS "$USE_TRANSACTIONS" _ACEOF fi fi # Check whether --enable-dummy was given. if test "${enable_dummy+set}" = set; then : enableval=$enable_dummy; fi if test x$USE_TRANSACTIONS = xNO; then DISABLE_TRANSACTIONS_TRUE= DISABLE_TRANSACTIONS_FALSE='#' else DISABLE_TRANSACTIONS_TRUE='#' DISABLE_TRANSACTIONS_FALSE= fi if test x$USE_TRANSACTIONS = xYES; then ENABLE_TRANSACTIONS_TRUE= ENABLE_TRANSACTIONS_FALSE='#' else ENABLE_TRANSACTIONS_TRUE='#' ENABLE_TRANSACTIONS_FALSE= fi if test x$USE_TRANSACTIONS = xNO ; then $as_echo "#define DISABLE_TRANSACTIONS 1" >>confdefs.h fi if test x$USE_TRANSACTIONS = xYES ; then $as_echo "#define ENABLE_TRANSACTIONS 1" >>confdefs.h fi # Check whether --enable-dbshared-test was given. if test "${enable_dbshared_test+set}" = set; then : enableval=$enable_dbshared_test; fi cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache WITH_DB_ENGINE=db # Check whether --with-database was given. if test "${with_database+set}" = set; then : withval=$with_database; WITH_DB_ENGINE=$withval fi case "x$WITH_DB_ENGINE" in xsqlite|xsqlite3) $as_echo "#define ENABLE_SQLITE_DATASTORE 1" >>confdefs.h DB_TYPE=sqlite DB_EXT=.db for ac_header in sqlite3.h do : ac_fn_c_check_header_mongrel "$LINENO" "sqlite3.h" "ac_cv_header_sqlite3_h" "$ac_includes_default" if test "x$ac_cv_header_sqlite3_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_SQLITE3_H 1 _ACEOF else as_fn_error $? "Cannot find sqlite3.h header file" "$LINENO" 5 fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to link with libsqlite3" >&5 $as_echo_n "checking how to link with libsqlite3... " >&6; } if ${ac_cv_libsqlite3_libs+:} false; then : $as_echo_n "(cached) " >&6 else use_additional=yes acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" # Check whether --with-libsqlite3-prefix was given. if test "${with_libsqlite3_prefix+set}" = set; then : withval=$with_libsqlite3_prefix; if test "X$withval" = "Xno"; then use_additional=no else if test "X$withval" = "X"; then acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" else additional_includedir="$withval/include" additional_libdir="$withval/lib" fi fi fi LIBSQLITE3= LTLIBSQLITE3= INCSQLITE3= rpathdirs= ltrpathdirs= names_already_handled= names_next_round='sqlite3 ' while test -n "$names_next_round"; do names_this_round="$names_next_round" names_next_round= for name in $names_this_round; do already_handled= for n in $names_already_handled; do if test "$n" = "$name"; then already_handled=yes break fi done if test -z "$already_handled"; then names_already_handled="$names_already_handled $name" uppername=`echo "$name" | sed -e 'y|abcdefghijklmnopqrstuvwxyz./-|ABCDEFGHIJKLMNOPQRSTUVWXYZ___|'` eval value=\"\$HAVE_LIB$uppername\" if test -n "$value"; then if test "$value" = yes; then eval value=\"\$LIB$uppername\" test -z "$value" || LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$value" eval value=\"\$LTLIB$uppername\" test -z "$value" || LTLIBSQLITE3="${LTLIBSQLITE3}${LTLIBSQLITE3:+ }$value" else : fi else found_dir= found_la= found_so= found_a= if test $use_additional = yes; then if test -n "$shlibext" && test -f "$additional_libdir/lib$name.$shlibext"; then found_dir="$additional_libdir" found_so="$additional_libdir/lib$name.$shlibext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi else if test -f "$additional_libdir/lib$name.$libext"; then found_dir="$additional_libdir" found_a="$additional_libdir/lib$name.$libext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi fi fi fi if test "X$found_dir" = "X"; then for x in $LDFLAGS $LTLIBSQLITE3; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" case "$x" in -L*) dir=`echo "X$x" | sed -e 's/^X-L//'` if test -n "$shlibext" && test -f "$dir/lib$name.$shlibext"; then found_dir="$dir" found_so="$dir/lib$name.$shlibext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi else if test -f "$dir/lib$name.$libext"; then found_dir="$dir" found_a="$dir/lib$name.$libext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi fi fi ;; esac if test "X$found_dir" != "X"; then break fi done fi if test "X$found_dir" != "X"; then LTLIBSQLITE3="${LTLIBSQLITE3}${LTLIBSQLITE3:+ }-L$found_dir -l$name" if test "X$found_so" != "X"; then if test "$enable_rpath" = no || test "X$found_dir" = "X/usr/lib"; then LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$found_so" else haveit= for x in $ltrpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $found_dir" fi if test "$hardcode_direct" = yes; then LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$found_so" else if test -n "$hardcode_libdir_flag_spec" && test "$hardcode_minus_L" = no; then LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$found_so" haveit= for x in $rpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $found_dir" fi else haveit= for x in $LDFLAGS $LIBSQLITE3; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }-L$found_dir" fi if test "$hardcode_minus_L" != no; then LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$found_so" else LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }-l$name" fi fi fi fi else if test "X$found_a" != "X"; then LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$found_a" else LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }-L$found_dir -l$name" fi fi additional_includedir= case "$found_dir" in */lib | */lib/) basedir=`echo "X$found_dir" | sed -e 's,^X,,' -e 's,/lib/*$,,'` additional_includedir="$basedir/include" ;; esac if test "X$additional_includedir" != "X"; then if test "X$additional_includedir" != "X/usr/include"; then haveit= if test "X$additional_includedir" = "X/usr/local/include"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then for x in $CPPFLAGS $INCSQLITE3; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-I$additional_includedir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_includedir"; then INCSQLITE3="${INCSQLITE3}${INCSQLITE3:+ }-I$additional_includedir" fi fi fi fi fi if test -n "$found_la"; then save_libdir="$libdir" case "$found_la" in */* | *\\*) . "$found_la" ;; *) . "./$found_la" ;; esac libdir="$save_libdir" for dep in $dependency_libs; do case "$dep" in -L*) additional_libdir=`echo "X$dep" | sed -e 's/^X-L//'` if test "X$additional_libdir" != "X/usr/lib"; then haveit= if test "X$additional_libdir" = "X/usr/local/lib"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then haveit= for x in $LDFLAGS $LIBSQLITE3; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }-L$additional_libdir" fi fi haveit= for x in $LDFLAGS $LTLIBSQLITE3; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LTLIBSQLITE3="${LTLIBSQLITE3}${LTLIBSQLITE3:+ }-L$additional_libdir" fi fi fi fi ;; -R*) dir=`echo "X$dep" | sed -e 's/^X-R//'` if test "$enable_rpath" != no; then haveit= for x in $rpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $dir" fi haveit= for x in $ltrpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $dir" fi fi ;; -l*) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's/^X-l//'` ;; *.la) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's,^X.*/,,' -e 's,^lib,,' -e 's,\.la$,,'` ;; *) LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$dep" LTLIBSQLITE3="${LTLIBSQLITE3}${LTLIBSQLITE3:+ }$dep" ;; esac done fi else LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }-l$name" LTLIBSQLITE3="${LTLIBSQLITE3}${LTLIBSQLITE3:+ }-l$name" fi fi fi done done if test "X$rpathdirs" != "X"; then if test -n "$hardcode_libdir_separator"; then alldirs= for found_dir in $rpathdirs; do alldirs="${alldirs}${alldirs:+$hardcode_libdir_separator}$found_dir" done acl_save_libdir="$libdir" libdir="$alldirs" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$flag" else for found_dir in $rpathdirs; do acl_save_libdir="$libdir" libdir="$found_dir" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBSQLITE3="${LIBSQLITE3}${LIBSQLITE3:+ }$flag" done fi fi if test "X$ltrpathdirs" != "X"; then for found_dir in $ltrpathdirs; do LTLIBSQLITE3="${LTLIBSQLITE3}${LTLIBSQLITE3:+ }-R$found_dir" done fi ac_cv_libsqlite3_libs="$LIBSQLITE3" ac_cv_libsqlite3_ltlibs="$LTLIBSQLITE3" ac_cv_libsqlite3_cppflags="$INCSQLITE3" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_libsqlite3_libs" >&5 $as_echo "$ac_cv_libsqlite3_libs" >&6; } LIBSQLITE3="$ac_cv_libsqlite3_libs" LTLIBSQLITE3="$ac_cv_libsqlite3_ltlibs" INCSQLITE3="$ac_cv_libsqlite3_cppflags" for element in $INCSQLITE3; do haveit= for x in $CPPFLAGS; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X$element"; then haveit=yes break fi done if test -z "$haveit"; then CPPFLAGS="${CPPFLAGS}${CPPFLAGS:+ }$element" fi done HAVE_LIBSQLITE3=yes LIBDB="$LIBSQLITE3" WITH_DB_ENGINE="sqlite3" saveLIBS="$LIBS" LIBS="$LIBDB $LIBS" ac_fn_c_check_func "$LINENO" "sqlite3_prepare_v2" "ac_cv_func_sqlite3_prepare_v2" if test "x$ac_cv_func_sqlite3_prepare_v2" = xyes; then : else $as_echo "#define sqlite3_prepare_v2 sqlite3_prepare" >>confdefs.h fi LIBS="$saveLIBS" ;; xtokyocabinet) $as_echo "#define ENABLE_TOKYOCABINET_DATASTORE 1" >>confdefs.h DB_TYPE=tokyocabinet DB_EXT=.tc { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to link with libtokyocabinet" >&5 $as_echo_n "checking how to link with libtokyocabinet... " >&6; } if ${ac_cv_libtokyocabinet_libs+:} false; then : $as_echo_n "(cached) " >&6 else use_additional=yes acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" # Check whether --with-libtokyocabinet-prefix was given. if test "${with_libtokyocabinet_prefix+set}" = set; then : withval=$with_libtokyocabinet_prefix; if test "X$withval" = "Xno"; then use_additional=no else if test "X$withval" = "X"; then acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" else additional_includedir="$withval/include" additional_libdir="$withval/lib" fi fi fi LIBTOKYOCABINET= LTLIBTOKYOCABINET= INCTOKYOCABINET= rpathdirs= ltrpathdirs= names_already_handled= names_next_round='tokyocabinet ' while test -n "$names_next_round"; do names_this_round="$names_next_round" names_next_round= for name in $names_this_round; do already_handled= for n in $names_already_handled; do if test "$n" = "$name"; then already_handled=yes break fi done if test -z "$already_handled"; then names_already_handled="$names_already_handled $name" uppername=`echo "$name" | sed -e 'y|abcdefghijklmnopqrstuvwxyz./-|ABCDEFGHIJKLMNOPQRSTUVWXYZ___|'` eval value=\"\$HAVE_LIB$uppername\" if test -n "$value"; then if test "$value" = yes; then eval value=\"\$LIB$uppername\" test -z "$value" || LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$value" eval value=\"\$LTLIB$uppername\" test -z "$value" || LTLIBTOKYOCABINET="${LTLIBTOKYOCABINET}${LTLIBTOKYOCABINET:+ }$value" else : fi else found_dir= found_la= found_so= found_a= if test $use_additional = yes; then if test -n "$shlibext" && test -f "$additional_libdir/lib$name.$shlibext"; then found_dir="$additional_libdir" found_so="$additional_libdir/lib$name.$shlibext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi else if test -f "$additional_libdir/lib$name.$libext"; then found_dir="$additional_libdir" found_a="$additional_libdir/lib$name.$libext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi fi fi fi if test "X$found_dir" = "X"; then for x in $LDFLAGS $LTLIBTOKYOCABINET; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" case "$x" in -L*) dir=`echo "X$x" | sed -e 's/^X-L//'` if test -n "$shlibext" && test -f "$dir/lib$name.$shlibext"; then found_dir="$dir" found_so="$dir/lib$name.$shlibext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi else if test -f "$dir/lib$name.$libext"; then found_dir="$dir" found_a="$dir/lib$name.$libext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi fi fi ;; esac if test "X$found_dir" != "X"; then break fi done fi if test "X$found_dir" != "X"; then LTLIBTOKYOCABINET="${LTLIBTOKYOCABINET}${LTLIBTOKYOCABINET:+ }-L$found_dir -l$name" if test "X$found_so" != "X"; then if test "$enable_rpath" = no || test "X$found_dir" = "X/usr/lib"; then LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$found_so" else haveit= for x in $ltrpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $found_dir" fi if test "$hardcode_direct" = yes; then LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$found_so" else if test -n "$hardcode_libdir_flag_spec" && test "$hardcode_minus_L" = no; then LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$found_so" haveit= for x in $rpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $found_dir" fi else haveit= for x in $LDFLAGS $LIBTOKYOCABINET; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }-L$found_dir" fi if test "$hardcode_minus_L" != no; then LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$found_so" else LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }-l$name" fi fi fi fi else if test "X$found_a" != "X"; then LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$found_a" else LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }-L$found_dir -l$name" fi fi additional_includedir= case "$found_dir" in */lib | */lib/) basedir=`echo "X$found_dir" | sed -e 's,^X,,' -e 's,/lib/*$,,'` additional_includedir="$basedir/include" ;; esac if test "X$additional_includedir" != "X"; then if test "X$additional_includedir" != "X/usr/include"; then haveit= if test "X$additional_includedir" = "X/usr/local/include"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then for x in $CPPFLAGS $INCTOKYOCABINET; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-I$additional_includedir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_includedir"; then INCTOKYOCABINET="${INCTOKYOCABINET}${INCTOKYOCABINET:+ }-I$additional_includedir" fi fi fi fi fi if test -n "$found_la"; then save_libdir="$libdir" case "$found_la" in */* | *\\*) . "$found_la" ;; *) . "./$found_la" ;; esac libdir="$save_libdir" for dep in $dependency_libs; do case "$dep" in -L*) additional_libdir=`echo "X$dep" | sed -e 's/^X-L//'` if test "X$additional_libdir" != "X/usr/lib"; then haveit= if test "X$additional_libdir" = "X/usr/local/lib"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then haveit= for x in $LDFLAGS $LIBTOKYOCABINET; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }-L$additional_libdir" fi fi haveit= for x in $LDFLAGS $LTLIBTOKYOCABINET; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LTLIBTOKYOCABINET="${LTLIBTOKYOCABINET}${LTLIBTOKYOCABINET:+ }-L$additional_libdir" fi fi fi fi ;; -R*) dir=`echo "X$dep" | sed -e 's/^X-R//'` if test "$enable_rpath" != no; then haveit= for x in $rpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $dir" fi haveit= for x in $ltrpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $dir" fi fi ;; -l*) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's/^X-l//'` ;; *.la) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's,^X.*/,,' -e 's,^lib,,' -e 's,\.la$,,'` ;; *) LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$dep" LTLIBTOKYOCABINET="${LTLIBTOKYOCABINET}${LTLIBTOKYOCABINET:+ }$dep" ;; esac done fi else LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }-l$name" LTLIBTOKYOCABINET="${LTLIBTOKYOCABINET}${LTLIBTOKYOCABINET:+ }-l$name" fi fi fi done done if test "X$rpathdirs" != "X"; then if test -n "$hardcode_libdir_separator"; then alldirs= for found_dir in $rpathdirs; do alldirs="${alldirs}${alldirs:+$hardcode_libdir_separator}$found_dir" done acl_save_libdir="$libdir" libdir="$alldirs" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$flag" else for found_dir in $rpathdirs; do acl_save_libdir="$libdir" libdir="$found_dir" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBTOKYOCABINET="${LIBTOKYOCABINET}${LIBTOKYOCABINET:+ }$flag" done fi fi if test "X$ltrpathdirs" != "X"; then for found_dir in $ltrpathdirs; do LTLIBTOKYOCABINET="${LTLIBTOKYOCABINET}${LTLIBTOKYOCABINET:+ }-R$found_dir" done fi ac_cv_libtokyocabinet_libs="$LIBTOKYOCABINET" ac_cv_libtokyocabinet_ltlibs="$LTLIBTOKYOCABINET" ac_cv_libtokyocabinet_cppflags="$INCTOKYOCABINET" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_libtokyocabinet_libs" >&5 $as_echo "$ac_cv_libtokyocabinet_libs" >&6; } LIBTOKYOCABINET="$ac_cv_libtokyocabinet_libs" LTLIBTOKYOCABINET="$ac_cv_libtokyocabinet_ltlibs" INCTOKYOCABINET="$ac_cv_libtokyocabinet_cppflags" for element in $INCTOKYOCABINET; do haveit= for x in $CPPFLAGS; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X$element"; then haveit=yes break fi done if test -z "$haveit"; then CPPFLAGS="${CPPFLAGS}${CPPFLAGS:+ }$element" fi done HAVE_LIBTOKYOCABINET=yes LIBDB="$LIBTOKYOCABINET" saveLIBS="$LIBS" LIBS="$LIBS $LIBDB" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include #include #include #include int main () { TCBDB *d = tcbdbnew(); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : else as_fn_error $? "Cannot link to tokyocabinet library." "$LINENO" 5 fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS="$saveLIBS" ;; xqdbm) $as_echo "#define ENABLE_QDBM_DATASTORE 1" >>confdefs.h DB_TYPE=qdbm DB_EXT=.qdbm { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to link with libqdbm" >&5 $as_echo_n "checking how to link with libqdbm... " >&6; } if ${ac_cv_libqdbm_libs+:} false; then : $as_echo_n "(cached) " >&6 else use_additional=yes acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" # Check whether --with-libqdbm-prefix was given. if test "${with_libqdbm_prefix+set}" = set; then : withval=$with_libqdbm_prefix; if test "X$withval" = "Xno"; then use_additional=no else if test "X$withval" = "X"; then acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" else additional_includedir="$withval/include" additional_libdir="$withval/lib" fi fi fi LIBQDBM= LTLIBQDBM= INCQDBM= rpathdirs= ltrpathdirs= names_already_handled= names_next_round='qdbm ' while test -n "$names_next_round"; do names_this_round="$names_next_round" names_next_round= for name in $names_this_round; do already_handled= for n in $names_already_handled; do if test "$n" = "$name"; then already_handled=yes break fi done if test -z "$already_handled"; then names_already_handled="$names_already_handled $name" uppername=`echo "$name" | sed -e 'y|abcdefghijklmnopqrstuvwxyz./-|ABCDEFGHIJKLMNOPQRSTUVWXYZ___|'` eval value=\"\$HAVE_LIB$uppername\" if test -n "$value"; then if test "$value" = yes; then eval value=\"\$LIB$uppername\" test -z "$value" || LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$value" eval value=\"\$LTLIB$uppername\" test -z "$value" || LTLIBQDBM="${LTLIBQDBM}${LTLIBQDBM:+ }$value" else : fi else found_dir= found_la= found_so= found_a= if test $use_additional = yes; then if test -n "$shlibext" && test -f "$additional_libdir/lib$name.$shlibext"; then found_dir="$additional_libdir" found_so="$additional_libdir/lib$name.$shlibext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi else if test -f "$additional_libdir/lib$name.$libext"; then found_dir="$additional_libdir" found_a="$additional_libdir/lib$name.$libext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi fi fi fi if test "X$found_dir" = "X"; then for x in $LDFLAGS $LTLIBQDBM; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" case "$x" in -L*) dir=`echo "X$x" | sed -e 's/^X-L//'` if test -n "$shlibext" && test -f "$dir/lib$name.$shlibext"; then found_dir="$dir" found_so="$dir/lib$name.$shlibext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi else if test -f "$dir/lib$name.$libext"; then found_dir="$dir" found_a="$dir/lib$name.$libext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi fi fi ;; esac if test "X$found_dir" != "X"; then break fi done fi if test "X$found_dir" != "X"; then LTLIBQDBM="${LTLIBQDBM}${LTLIBQDBM:+ }-L$found_dir -l$name" if test "X$found_so" != "X"; then if test "$enable_rpath" = no || test "X$found_dir" = "X/usr/lib"; then LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$found_so" else haveit= for x in $ltrpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $found_dir" fi if test "$hardcode_direct" = yes; then LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$found_so" else if test -n "$hardcode_libdir_flag_spec" && test "$hardcode_minus_L" = no; then LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$found_so" haveit= for x in $rpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $found_dir" fi else haveit= for x in $LDFLAGS $LIBQDBM; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then LIBQDBM="${LIBQDBM}${LIBQDBM:+ }-L$found_dir" fi if test "$hardcode_minus_L" != no; then LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$found_so" else LIBQDBM="${LIBQDBM}${LIBQDBM:+ }-l$name" fi fi fi fi else if test "X$found_a" != "X"; then LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$found_a" else LIBQDBM="${LIBQDBM}${LIBQDBM:+ }-L$found_dir -l$name" fi fi additional_includedir= case "$found_dir" in */lib | */lib/) basedir=`echo "X$found_dir" | sed -e 's,^X,,' -e 's,/lib/*$,,'` additional_includedir="$basedir/include" ;; esac if test "X$additional_includedir" != "X"; then if test "X$additional_includedir" != "X/usr/include"; then haveit= if test "X$additional_includedir" = "X/usr/local/include"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then for x in $CPPFLAGS $INCQDBM; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-I$additional_includedir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_includedir"; then INCQDBM="${INCQDBM}${INCQDBM:+ }-I$additional_includedir" fi fi fi fi fi if test -n "$found_la"; then save_libdir="$libdir" case "$found_la" in */* | *\\*) . "$found_la" ;; *) . "./$found_la" ;; esac libdir="$save_libdir" for dep in $dependency_libs; do case "$dep" in -L*) additional_libdir=`echo "X$dep" | sed -e 's/^X-L//'` if test "X$additional_libdir" != "X/usr/lib"; then haveit= if test "X$additional_libdir" = "X/usr/local/lib"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then haveit= for x in $LDFLAGS $LIBQDBM; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LIBQDBM="${LIBQDBM}${LIBQDBM:+ }-L$additional_libdir" fi fi haveit= for x in $LDFLAGS $LTLIBQDBM; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LTLIBQDBM="${LTLIBQDBM}${LTLIBQDBM:+ }-L$additional_libdir" fi fi fi fi ;; -R*) dir=`echo "X$dep" | sed -e 's/^X-R//'` if test "$enable_rpath" != no; then haveit= for x in $rpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $dir" fi haveit= for x in $ltrpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $dir" fi fi ;; -l*) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's/^X-l//'` ;; *.la) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's,^X.*/,,' -e 's,^lib,,' -e 's,\.la$,,'` ;; *) LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$dep" LTLIBQDBM="${LTLIBQDBM}${LTLIBQDBM:+ }$dep" ;; esac done fi else LIBQDBM="${LIBQDBM}${LIBQDBM:+ }-l$name" LTLIBQDBM="${LTLIBQDBM}${LTLIBQDBM:+ }-l$name" fi fi fi done done if test "X$rpathdirs" != "X"; then if test -n "$hardcode_libdir_separator"; then alldirs= for found_dir in $rpathdirs; do alldirs="${alldirs}${alldirs:+$hardcode_libdir_separator}$found_dir" done acl_save_libdir="$libdir" libdir="$alldirs" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$flag" else for found_dir in $rpathdirs; do acl_save_libdir="$libdir" libdir="$found_dir" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBQDBM="${LIBQDBM}${LIBQDBM:+ }$flag" done fi fi if test "X$ltrpathdirs" != "X"; then for found_dir in $ltrpathdirs; do LTLIBQDBM="${LTLIBQDBM}${LTLIBQDBM:+ }-R$found_dir" done fi ac_cv_libqdbm_libs="$LIBQDBM" ac_cv_libqdbm_ltlibs="$LTLIBQDBM" ac_cv_libqdbm_cppflags="$INCQDBM" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_libqdbm_libs" >&5 $as_echo "$ac_cv_libqdbm_libs" >&6; } LIBQDBM="$ac_cv_libqdbm_libs" LTLIBQDBM="$ac_cv_libqdbm_ltlibs" INCQDBM="$ac_cv_libqdbm_cppflags" for element in $INCQDBM; do haveit= for x in $CPPFLAGS; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X$element"; then haveit=yes break fi done if test -z "$haveit"; then CPPFLAGS="${CPPFLAGS}${CPPFLAGS:+ }$element" fi done HAVE_LIBQDBM=yes LIBDB="$LIBQDBM" saveLIBS="$LIBS" LIBS="$LIBS $LIBDB" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { DEPOT *d = dpopen("", 0, 0); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : else as_fn_error $? "Cannot link to qdbm library." "$LINENO" 5 fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS="$saveLIBS" ;; xdb*) DB_TYPE=db DB_EXT=.db { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to link with libdb" >&5 $as_echo_n "checking how to link with libdb... " >&6; } if ${ac_cv_libdb_libs+:} false; then : $as_echo_n "(cached) " >&6 else use_additional=yes acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" # Check whether --with-libdb-prefix was given. if test "${with_libdb_prefix+set}" = set; then : withval=$with_libdb_prefix; if test "X$withval" = "Xno"; then use_additional=no else if test "X$withval" = "X"; then acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" else additional_includedir="$withval/include" additional_libdir="$withval/lib" fi fi fi LIBDB= LTLIBDB= INCDB= rpathdirs= ltrpathdirs= names_already_handled= names_next_round='db ' while test -n "$names_next_round"; do names_this_round="$names_next_round" names_next_round= for name in $names_this_round; do already_handled= for n in $names_already_handled; do if test "$n" = "$name"; then already_handled=yes break fi done if test -z "$already_handled"; then names_already_handled="$names_already_handled $name" uppername=`echo "$name" | sed -e 'y|abcdefghijklmnopqrstuvwxyz./-|ABCDEFGHIJKLMNOPQRSTUVWXYZ___|'` eval value=\"\$HAVE_LIB$uppername\" if test -n "$value"; then if test "$value" = yes; then eval value=\"\$LIB$uppername\" test -z "$value" || LIBDB="${LIBDB}${LIBDB:+ }$value" eval value=\"\$LTLIB$uppername\" test -z "$value" || LTLIBDB="${LTLIBDB}${LTLIBDB:+ }$value" else : fi else found_dir= found_la= found_so= found_a= if test $use_additional = yes; then if test -n "$shlibext" && test -f "$additional_libdir/lib$name.$shlibext"; then found_dir="$additional_libdir" found_so="$additional_libdir/lib$name.$shlibext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi else if test -f "$additional_libdir/lib$name.$libext"; then found_dir="$additional_libdir" found_a="$additional_libdir/lib$name.$libext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi fi fi fi if test "X$found_dir" = "X"; then for x in $LDFLAGS $LTLIBDB; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" case "$x" in -L*) dir=`echo "X$x" | sed -e 's/^X-L//'` if test -n "$shlibext" && test -f "$dir/lib$name.$shlibext"; then found_dir="$dir" found_so="$dir/lib$name.$shlibext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi else if test -f "$dir/lib$name.$libext"; then found_dir="$dir" found_a="$dir/lib$name.$libext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi fi fi ;; esac if test "X$found_dir" != "X"; then break fi done fi if test "X$found_dir" != "X"; then LTLIBDB="${LTLIBDB}${LTLIBDB:+ }-L$found_dir -l$name" if test "X$found_so" != "X"; then if test "$enable_rpath" = no || test "X$found_dir" = "X/usr/lib"; then LIBDB="${LIBDB}${LIBDB:+ }$found_so" else haveit= for x in $ltrpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $found_dir" fi if test "$hardcode_direct" = yes; then LIBDB="${LIBDB}${LIBDB:+ }$found_so" else if test -n "$hardcode_libdir_flag_spec" && test "$hardcode_minus_L" = no; then LIBDB="${LIBDB}${LIBDB:+ }$found_so" haveit= for x in $rpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $found_dir" fi else haveit= for x in $LDFLAGS $LIBDB; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then LIBDB="${LIBDB}${LIBDB:+ }-L$found_dir" fi if test "$hardcode_minus_L" != no; then LIBDB="${LIBDB}${LIBDB:+ }$found_so" else LIBDB="${LIBDB}${LIBDB:+ }-l$name" fi fi fi fi else if test "X$found_a" != "X"; then LIBDB="${LIBDB}${LIBDB:+ }$found_a" else LIBDB="${LIBDB}${LIBDB:+ }-L$found_dir -l$name" fi fi additional_includedir= case "$found_dir" in */lib | */lib/) basedir=`echo "X$found_dir" | sed -e 's,^X,,' -e 's,/lib/*$,,'` additional_includedir="$basedir/include" ;; esac if test "X$additional_includedir" != "X"; then if test "X$additional_includedir" != "X/usr/include"; then haveit= if test "X$additional_includedir" = "X/usr/local/include"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then for x in $CPPFLAGS $INCDB; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-I$additional_includedir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_includedir"; then INCDB="${INCDB}${INCDB:+ }-I$additional_includedir" fi fi fi fi fi if test -n "$found_la"; then save_libdir="$libdir" case "$found_la" in */* | *\\*) . "$found_la" ;; *) . "./$found_la" ;; esac libdir="$save_libdir" for dep in $dependency_libs; do case "$dep" in -L*) additional_libdir=`echo "X$dep" | sed -e 's/^X-L//'` if test "X$additional_libdir" != "X/usr/lib"; then haveit= if test "X$additional_libdir" = "X/usr/local/lib"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then haveit= for x in $LDFLAGS $LIBDB; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LIBDB="${LIBDB}${LIBDB:+ }-L$additional_libdir" fi fi haveit= for x in $LDFLAGS $LTLIBDB; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then LTLIBDB="${LTLIBDB}${LTLIBDB:+ }-L$additional_libdir" fi fi fi fi ;; -R*) dir=`echo "X$dep" | sed -e 's/^X-R//'` if test "$enable_rpath" != no; then haveit= for x in $rpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $dir" fi haveit= for x in $ltrpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $dir" fi fi ;; -l*) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's/^X-l//'` ;; *.la) names_next_round="$names_next_round "`echo "X$dep" | sed -e 's,^X.*/,,' -e 's,^lib,,' -e 's,\.la$,,'` ;; *) LIBDB="${LIBDB}${LIBDB:+ }$dep" LTLIBDB="${LTLIBDB}${LTLIBDB:+ }$dep" ;; esac done fi else LIBDB="${LIBDB}${LIBDB:+ }-l$name" LTLIBDB="${LTLIBDB}${LTLIBDB:+ }-l$name" fi fi fi done done if test "X$rpathdirs" != "X"; then if test -n "$hardcode_libdir_separator"; then alldirs= for found_dir in $rpathdirs; do alldirs="${alldirs}${alldirs:+$hardcode_libdir_separator}$found_dir" done acl_save_libdir="$libdir" libdir="$alldirs" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBDB="${LIBDB}${LIBDB:+ }$flag" else for found_dir in $rpathdirs; do acl_save_libdir="$libdir" libdir="$found_dir" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIBDB="${LIBDB}${LIBDB:+ }$flag" done fi fi if test "X$ltrpathdirs" != "X"; then for found_dir in $ltrpathdirs; do LTLIBDB="${LTLIBDB}${LTLIBDB:+ }-R$found_dir" done fi ac_cv_libdb_libs="$LIBDB" ac_cv_libdb_ltlibs="$LTLIBDB" ac_cv_libdb_cppflags="$INCDB" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_libdb_libs" >&5 $as_echo "$ac_cv_libdb_libs" >&6; } LIBDB="$ac_cv_libdb_libs" LTLIBDB="$ac_cv_libdb_ltlibs" INCDB="$ac_cv_libdb_cppflags" for element in $INCDB; do haveit= for x in $CPPFLAGS; do acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" eval x=\"$x\" exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" if test "X$x" = "X$element"; then haveit=yes break fi done if test -z "$haveit"; then CPPFLAGS="${CPPFLAGS}${CPPFLAGS:+ }$element" fi done HAVE_LIBDB=yes { $as_echo "$as_me:${as_lineno-$LINENO}: checking db and dependent libraries" >&5 $as_echo_n "checking db and dependent libraries... " >&6; } saveLIBS="$LIBS" havelib=0 for dblibs in "" "$LIBDB" ; do for addlibs in "" -lpthread -lthread ; do LIBDB="$dblibs $addlibs" export LIBDB LIBS="$saveLIBS $LIBDB" export LIBS cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int r, s, t; db_version(&r, &s, &t); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : havelib=1 ; break 2 fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext done done LIBS="$saveLIBS" export LIBS if test $havelib = 0 ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: error" >&5 $as_echo "error" >&6; } as_fn_error $? " ===================================================================== Cannot link against libdb? Try these steps to solve the problem: 1. Be sure that the Berkeley DB developer package is installed. 2. Type: rm -f config.cache then re-run configure. 3. If the problem persists, report it to the bogofilter mailing list. Remember to include your config.log. ===================================================================== " "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIBDB" >&5 $as_echo "$LIBDB" >&6; } LIBS="$saveLIBS" export LIBS saveLIBS="$LIBS" LIBS="$LIBS $LIBDB" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if a program can be linked against Berkeley DB and run" >&5 $as_echo_n "checking if a program can be linked against Berkeley DB and run... " >&6; } if test "$cross_compiling" = yes; then : true else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef HAVE_INTTYPES_H #include #endif #include int main () { return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } as_fn_error $? "Cannot run a program linked against libdb. Did you adjust your library search path to include your libdb?" "$LINENO" 5 fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if Berkeley DB header and library versions match" >&5 $as_echo_n "checking if Berkeley DB header and library versions match... " >&6; } rm -r -f bfadtestdir mkdir bfadtestdir if test "$cross_compiling" = yes; then : true else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #ifdef HAVE_INTTYPES_H #include #endif #include int main () { int maj, min; (void)db_version(&maj, &min, 0); (void)fprintf(stderr, "headers: %d.%d, library: %d.%d\n", DB_VERSION_MAJOR, DB_VERSION_MINOR, maj, min); if (maj != DB_VERSION_MAJOR) exit(1); if (min != DB_VERSION_MINOR) exit(1); exit(0); ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } as_fn_error $? "db.h header file and db library version do not match." "$LINENO" 5 fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } ac_fn_c_check_decl "$LINENO" "db_create" "ac_cv_have_decl_db_create" "#ifdef HAVE_INTTYPES_H #include #endif #include " if test "x$ac_cv_have_decl_db_create" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_DB_CREATE $ac_have_decl _ACEOF if test $ac_have_decl = 1; then : else as_fn_error $? "Can not locate a suitable Berkeley DB db.h header file. Use --with-libdb-prefix=PATH to specify the path to a v3+ install directory. You can download Berkeley DB 4.3.x from http://www.sleepycat.com/" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if Berkeley DB supports shared environments" >&5 $as_echo_n "checking if Berkeley DB supports shared environments... " >&6; } if test "x$enable_dbshared_test" != xno && test "x$USE_TRANSACTIONS" != xNO ; then if test "$cross_compiling" = yes; then : true else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef HAVE_INTTYPES_H #include #endif #include #include #include #define TESTDIR "bfadtestdir" #define barf(where, what) do { fprintf(stderr, "%s failed: %s\n", where, db_strerror(what)); exit(1); } while(0) int main () { DB_ENV *e; int r; if ((r = db_env_create(&e, 0))) barf("db_env_create", r); if ((r = e->open(e, TESTDIR, DB_INIT_LOG|DB_INIT_TXN|DB_INIT_MPOOL|DB_CREATE, 0664))) barf("DB_ENV->open", r); if ((r = e->close(e, 0))) barf("DB_ENV->close", r); if ((r = db_env_create(&e, 0))) barf("db_env_create", r); if ((r = e->remove(e, TESTDIR, 0))) barf("DB_ENV->remove", r); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } rm -r -f bfadtestdir as_fn_error $? " Cannot open a shared environment in Berkeley DB. This is a known problem on Fedora Core Linux. Build your own Berkeley DB installation and use --with-libdb-prefix to point bogofilter to it. Alternatively, you can use the unsafe non-transactional database by configuring with --disable-transactions. Packagers, if you are absolutely sure that the target system supports shared environments, you can use --disable-dbshared-test." "$LINENO" 5 fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi rm -r -f bfadtestdir { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: skipped" >&5 $as_echo "skipped" >&6; } fi $as_echo "#define ENABLE_DB_DATASTORE 1" >>confdefs.h LIBS="$saveLIBS" ;; *) as_fn_error $? "Invalid --with-database argument. Supported engines are db, qdbm, sqlite3, tokyocabinet." "$LINENO" 5 ;; esac if test "a$STATIC_DB" = a ; then if test "a$WITH_DB_ENGINE" = a ; then STATIC_DB="-ldb" else STATIC_DB="-l$WITH_DB_ENGINE" fi fi if test "x$BF_ZAP_LIBDB" = "xzap" ; then LIBDB= export LIBDB fi cat >>confdefs.h <<_ACEOF #define DB_EXT "$DB_EXT" _ACEOF cat >>confdefs.h <<_ACEOF #define DB_TYPE "$DB_TYPE" _ACEOF if test "x$WITH_DB_ENGINE" = "xqdbm"; then ENABLE_QDBM_DATASTORE_TRUE= ENABLE_QDBM_DATASTORE_FALSE='#' else ENABLE_QDBM_DATASTORE_TRUE='#' ENABLE_QDBM_DATASTORE_FALSE= fi if test "x$WITH_DB_ENGINE" = "xsqlite3"; then ENABLE_SQLITE_DATASTORE_TRUE= ENABLE_SQLITE_DATASTORE_FALSE='#' else ENABLE_SQLITE_DATASTORE_TRUE='#' ENABLE_SQLITE_DATASTORE_FALSE= fi if test "x$WITH_DB_ENGINE" = "xtokyocabinet"; then ENABLE_TOKYOCABINET_DATASTORE_TRUE= ENABLE_TOKYOCABINET_DATASTORE_FALSE='#' else ENABLE_TOKYOCABINET_DATASTORE_TRUE='#' ENABLE_TOKYOCABINET_DATASTORE_FALSE= fi needtrio=0 if test "$BF_FORCE_TRIO" = "yes" ; then needtrio=1 ; ac_cv_func_vsnprintf=no ; ac_cv_func_snprintf=no ; fi if test "x$ac_cv_func_snprintf" != "xyes" ; then $as_echo "#define snprintf trio_snprintf" >>confdefs.h needtrio=1 fi if test "x$ac_cv_func_vsnprintf" != "xyes" ; then $as_echo "#define vsnprintf trio_vsnprintf" >>confdefs.h needtrio=1 fi if test $needtrio -gt 0 then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for IEEE compilation options" >&5 $as_echo_n "checking for IEEE compilation options... " >&6; } if ${ac_cv_ieee_option+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_ieee_option="none" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #if !(defined(__alpha) && (defined(__DECC) || defined(__DECCXX) || (defined(__osf__) && defined(__LANGUAGE_C__))) && (defined(VMS) || defined(__VMS))) # error "Option needed" #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_ieee_option="/IEEE_MODE=UNDERFLOW_TO_ZERO/FLOAT=IEEE" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_ieee_option = none ; then cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #if !(defined(__alpha) && (defined(__DECC) || defined(__DECCXX) || (defined(__osf__) && defined(__LANGUAGE_C__))) && !(defined(VMS) || defined(__VMS)) && !defined(_CFE)) # error "Option needed" #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_ieee_option="-ieee" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi if test $ac_cv_ieee_option = none ; then cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #if !(defined(__alpha) && (defined(__GNUC__) && (defined(__osf__) || defined(__linux__)))) # error "Option needed" #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_ieee_option="-mieee" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_ieee_option" >&5 $as_echo "$ac_cv_ieee_option" >&6; } if test $ac_cv_ieee_option != none; then CFLAGS="${CFLAGS} ${ac_cv_ieee_option}" fi $as_echo "#define NEEDTRIO 1" >>confdefs.h fi if test "$needtrio" = "1"; then NEEDTRIO_TRUE= NEEDTRIO_FALSE='#' else NEEDTRIO_TRUE='#' NEEDTRIO_FALSE= fi # Extract the first word of "xmlto", so it can be a program name with args. set dummy xmlto; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_cv_enable_xmlto+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_cv_enable_xmlto"; then ac_cv_prog_ac_cv_enable_xmlto="$ac_cv_enable_xmlto" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_cv_enable_xmlto="yes" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_ac_cv_enable_xmlto" && ac_cv_prog_ac_cv_enable_xmlto="no" fi fi ac_cv_enable_xmlto=$ac_cv_prog_ac_cv_enable_xmlto if test -n "$ac_cv_enable_xmlto"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_enable_xmlto" >&5 $as_echo "$ac_cv_enable_xmlto" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether xmlto is available" >&5 $as_echo_n "checking whether xmlto is available... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_enable_xmlto" >&5 $as_echo "$ac_cv_enable_xmlto" >&6; } if test x$ac_cv_enable_xmlto = xyes; then ENABLE_XMLTO_TRUE= ENABLE_XMLTO_FALSE='#' else ENABLE_XMLTO_TRUE='#' ENABLE_XMLTO_FALSE= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for extended floating point registers" >&5 $as_echo_n "checking for extended floating point registers... " >&6; } if ${ac_cv_c_extended_fp+:} false; then : $as_echo_n "(cached) " >&6 else case "$host" in *sparc*-*-*) ac_cv_c_extended_fp=no ;; *powerpc*-*-*) ac_cv_c_extended_fp=no ;; *mips*-*-*) ac_cv_c_extended_fp=no ;; *hppa*-*-*) ac_cv_c_extended_fp=no ;; *alpha*-*-*) ac_cv_c_extended_fp=no ;; *68k*-*-*) ac_cv_c_extended_fp=yes ;; *86*-*-*) ac_cv_c_extended_fp=yes ;; *) ac_cv_c_extended_fp=unknown ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_extended_fp" >&5 $as_echo "$ac_cv_c_extended_fp" >&6; } if test $ac_cv_c_extended_fp != "no" ; then $as_echo "#define HAVE_EXTENDED_PRECISION_REGISTERS 1" >>confdefs.h fi cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache if test "$sysconfdir" = "\${prefix}/etc" \ && { test "$prefix" = "NONE" || test "$prefix" = "/usr" \ || test "$prefix" = "/usr/" ; } ; then if test "$( (uname -s) )" = "Linux" ; then sysconfdir=/etc fi ( prefix=$ac_default_prefix sysconfdir=`eval echo "$sysconfdir"` { $as_echo "$as_me:${as_lineno-$LINENO}: configuration directory is \"$sysconfdir\"." >&5 $as_echo "$as_me: configuration directory is \"$sysconfdir\"." >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: use --sysconfdir to override." >&5 $as_echo "$as_me: use --sysconfdir to override." >&6;} ) fi { $as_echo "$as_me:${as_lineno-$LINENO}: -------------------------------------------------------------" >&5 $as_echo "$as_me: -------------------------------------------------------------" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: If you have multiple versions of GSL installed, this" >&5 $as_echo "$as_me: If you have multiple versions of GSL installed, this" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: configure script will prefer the one in /lib or /usr/lib" >&5 $as_echo "$as_me: configure script will prefer the one in /lib or /usr/lib" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: to work around a bug in Linux ldconfig." >&5 $as_echo "$as_me: to work around a bug in Linux ldconfig." >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: Deinstall the older GSL version if this behaviour annoys you." >&5 $as_echo "$as_me: Deinstall the older GSL version if this behaviour annoys you." >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: -------------------------------------------------------------" >&5 $as_echo "$as_me: -------------------------------------------------------------" >&6;} PATH_SAVED="$PATH" PATH=/bin:/usr/bin:$PATH export PATH need_my_gsl=1 # Check whether --with-included-gsl was given. if test "${with_included_gsl+set}" = set; then : withval=$with_included_gsl; if test "x$withval" = "xyes" ; then need_my_gsl=2 ; fi fi if test "$need_my_gsl" = 1 ; then # Check whether --with-gsl-prefix was given. if test "${with_gsl_prefix+set}" = set; then : withval=$with_gsl_prefix; gsl_prefix="$withval" else gsl_prefix="" fi # Check whether --with-gsl-exec-prefix was given. if test "${with_gsl_exec_prefix+set}" = set; then : withval=$with_gsl_exec_prefix; gsl_exec_prefix="$withval" else gsl_exec_prefix="" fi # Check whether --enable-gsltest was given. if test "${enable_gsltest+set}" = set; then : enableval=$enable_gsltest; else enable_gsltest=yes fi if test "x${GSL_CONFIG+set}" != xset ; then if test "x$gsl_prefix" != x ; then GSL_CONFIG="$gsl_prefix/bin/gsl-config" fi if test "x$gsl_exec_prefix" != x ; then GSL_CONFIG="$gsl_exec_prefix/bin/gsl-config" fi fi # Extract the first word of "gsl-config", so it can be a program name with args. set dummy gsl-config; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_GSL_CONFIG+:} false; then : $as_echo_n "(cached) " >&6 else case $GSL_CONFIG in [\\/]* | ?:[\\/]*) ac_cv_path_GSL_CONFIG="$GSL_CONFIG" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_path_GSL_CONFIG="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_path_GSL_CONFIG" && ac_cv_path_GSL_CONFIG="no" ;; esac fi GSL_CONFIG=$ac_cv_path_GSL_CONFIG if test -n "$GSL_CONFIG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $GSL_CONFIG" >&5 $as_echo "$GSL_CONFIG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi min_gsl_version=1.4 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GSL - version >= $min_gsl_version" >&5 $as_echo_n "checking for GSL - version >= $min_gsl_version... " >&6; } no_gsl="" if test "$GSL_CONFIG" = "no" ; then no_gsl=yes else GSL_CFLAGS=`$GSL_CONFIG --cflags` GSL_LIBS=`$GSL_CONFIG --libs` gsl_major_version=`$GSL_CONFIG --version | \ sed 's/^\([0-9]*\).*/\1/'` if test "x${gsl_major_version}" = "x" ; then gsl_major_version=0 fi gsl_minor_version=`$GSL_CONFIG --version | \ sed 's/^\([0-9]*\)\.\{0,1\}\([0-9]*\).*/\2/'` if test "x${gsl_minor_version}" = "x" ; then gsl_minor_version=0 fi gsl_micro_version=`$GSL_CONFIG --version | \ sed 's/^\([0-9]*\)\.\{0,1\}\([0-9]*\)\.\{0,1\}\([0-9]*\).*/\3/'` if test "x${gsl_micro_version}" = "x" ; then gsl_micro_version=0 fi if test "x$enable_gsltest" = "xyes" ; then ac_save_CFLAGS="$CFLAGS" ac_save_LIBS="$LIBS" CFLAGS="$CFLAGS $GSL_CFLAGS" LIBS="$LIBS $GSL_LIBS" rm -f conf.gsltest if test "$cross_compiling" = yes; then : echo $ac_n "cross compiling; assumed OK... $ac_c" else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include char* my_strdup (const char *str); char* my_strdup (const char *str) { char *new_str; if (str) { new_str = (char *)malloc ((strlen (str) + 1) * sizeof(char)); strcpy (new_str, str); } else new_str = NULL; return new_str; } int main (void) { int major = 0, minor = 0, micro = 0; int n; char *tmp_version; system ("touch conf.gsltest"); /* HP/UX 9 (%@#!) writes to sscanf strings */ tmp_version = my_strdup("$min_gsl_version"); n = sscanf(tmp_version, "%d.%d.%d", &major, &minor, µ) ; if (n != 2 && n != 3) { printf("%s, bad version string\n", "$min_gsl_version"); exit(1); } if (($gsl_major_version > major) || (($gsl_major_version == major) && ($gsl_minor_version > minor)) || (($gsl_major_version == major) && ($gsl_minor_version == minor) && ($gsl_micro_version >= micro))) { exit(0); } else { exit(1); } } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else no_gsl=yes fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi CFLAGS="$ac_save_CFLAGS" LIBS="$ac_save_LIBS" fi fi if test "x$no_gsl" = x ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } $as_echo "#define HAVE_GSL_14 /**/" >>confdefs.h need_my_gsl=0 else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } if test "$GSL_CONFIG" != "no" ; then if test -f conf.gsltest ; then : else echo "*** Could not run GSL test program, checking why..." CFLAGS="$CFLAGS $GSL_CFLAGS" LIBS="$LIBS $GSL_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { return 0; ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : echo "*** The test program compiled, but did not run. This usually means" echo "*** that the run-time linker is not finding GSL or finding the wrong" echo "*** version of GSL. If it is not finding GSL, you'll need to set your" echo "*** LD_LIBRARY_PATH environment variable, or edit /etc/ld.so.conf to point" echo "*** to the installed location Also, make sure you have run ldconfig if that" echo "*** is required on your system" echo "***" echo "*** If you have an old version installed, it is best to remove it, although" echo "*** you may also be able to get things to work by modifying LD_LIBRARY_PATH" else echo "*** The test program failed to compile or link. See the file config.log for the" echo "*** exact error that occured. This usually means GSL was incorrectly installed" echo "*** or that you have moved GSL since it was installed. In the latter case, you" echo "*** may want to edit the gsl-config script: $GSL_CONFIG" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext CFLAGS="$ac_save_CFLAGS" LIBS="$ac_save_LIBS" fi fi # GSL_CFLAGS="" # GSL_LIBS="" : fi rm -f conf.gsltest # Check whether --with-gsl-prefix was given. if test "${with_gsl_prefix+set}" = set; then : withval=$with_gsl_prefix; gsl_prefix="$withval" else gsl_prefix="" fi # Check whether --with-gsl-exec-prefix was given. if test "${with_gsl_exec_prefix+set}" = set; then : withval=$with_gsl_exec_prefix; gsl_exec_prefix="$withval" else gsl_exec_prefix="" fi # Check whether --enable-gsltest was given. if test "${enable_gsltest+set}" = set; then : enableval=$enable_gsltest; else enable_gsltest=yes fi if test "x${GSL_CONFIG+set}" != xset ; then if test "x$gsl_prefix" != x ; then GSL_CONFIG="$gsl_prefix/bin/gsl-config" fi if test "x$gsl_exec_prefix" != x ; then GSL_CONFIG="$gsl_exec_prefix/bin/gsl-config" fi fi # Extract the first word of "gsl-config", so it can be a program name with args. set dummy gsl-config; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_GSL_CONFIG+:} false; then : $as_echo_n "(cached) " >&6 else case $GSL_CONFIG in [\\/]* | ?:[\\/]*) ac_cv_path_GSL_CONFIG="$GSL_CONFIG" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_path_GSL_CONFIG="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_path_GSL_CONFIG" && ac_cv_path_GSL_CONFIG="no" ;; esac fi GSL_CONFIG=$ac_cv_path_GSL_CONFIG if test -n "$GSL_CONFIG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $GSL_CONFIG" >&5 $as_echo "$GSL_CONFIG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi min_gsl_version=1.0 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GSL - version >= $min_gsl_version" >&5 $as_echo_n "checking for GSL - version >= $min_gsl_version... " >&6; } no_gsl="" if test "$GSL_CONFIG" = "no" ; then no_gsl=yes else GSL_CFLAGS=`$GSL_CONFIG --cflags` GSL_LIBS=`$GSL_CONFIG --libs` gsl_major_version=`$GSL_CONFIG --version | \ sed 's/^\([0-9]*\).*/\1/'` if test "x${gsl_major_version}" = "x" ; then gsl_major_version=0 fi gsl_minor_version=`$GSL_CONFIG --version | \ sed 's/^\([0-9]*\)\.\{0,1\}\([0-9]*\).*/\2/'` if test "x${gsl_minor_version}" = "x" ; then gsl_minor_version=0 fi gsl_micro_version=`$GSL_CONFIG --version | \ sed 's/^\([0-9]*\)\.\{0,1\}\([0-9]*\)\.\{0,1\}\([0-9]*\).*/\3/'` if test "x${gsl_micro_version}" = "x" ; then gsl_micro_version=0 fi if test "x$enable_gsltest" = "xyes" ; then ac_save_CFLAGS="$CFLAGS" ac_save_LIBS="$LIBS" CFLAGS="$CFLAGS $GSL_CFLAGS" LIBS="$LIBS $GSL_LIBS" rm -f conf.gsltest if test "$cross_compiling" = yes; then : echo $ac_n "cross compiling; assumed OK... $ac_c" else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include char* my_strdup (const char *str); char* my_strdup (const char *str) { char *new_str; if (str) { new_str = (char *)malloc ((strlen (str) + 1) * sizeof(char)); strcpy (new_str, str); } else new_str = NULL; return new_str; } int main (void) { int major = 0, minor = 0, micro = 0; int n; char *tmp_version; system ("touch conf.gsltest"); /* HP/UX 9 (%@#!) writes to sscanf strings */ tmp_version = my_strdup("$min_gsl_version"); n = sscanf(tmp_version, "%d.%d.%d", &major, &minor, µ) ; if (n != 2 && n != 3) { printf("%s, bad version string\n", "$min_gsl_version"); exit(1); } if (($gsl_major_version > major) || (($gsl_major_version == major) && ($gsl_minor_version > minor)) || (($gsl_major_version == major) && ($gsl_minor_version == minor) && ($gsl_micro_version >= micro))) { exit(0); } else { exit(1); } } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else no_gsl=yes fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi CFLAGS="$ac_save_CFLAGS" LIBS="$ac_save_LIBS" fi fi if test "x$no_gsl" = x ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } $as_echo "#define HAVE_GSL_10 /**/" >>confdefs.h need_my_gsl=0 else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } if test "$GSL_CONFIG" != "no" ; then if test -f conf.gsltest ; then : else echo "*** Could not run GSL test program, checking why..." CFLAGS="$CFLAGS $GSL_CFLAGS" LIBS="$LIBS $GSL_LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { return 0; ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : echo "*** The test program compiled, but did not run. This usually means" echo "*** that the run-time linker is not finding GSL or finding the wrong" echo "*** version of GSL. If it is not finding GSL, you'll need to set your" echo "*** LD_LIBRARY_PATH environment variable, or edit /etc/ld.so.conf to point" echo "*** to the installed location Also, make sure you have run ldconfig if that" echo "*** is required on your system" echo "***" echo "*** If you have an old version installed, it is best to remove it, although" echo "*** you may also be able to get things to work by modifying LD_LIBRARY_PATH" else echo "*** The test program failed to compile or link. See the file config.log for the" echo "*** exact error that occured. This usually means GSL was incorrectly installed" echo "*** or that you have moved GSL since it was installed. In the latter case, you" echo "*** may want to edit the gsl-config script: $GSL_CONFIG" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext CFLAGS="$ac_save_CFLAGS" LIBS="$ac_save_LIBS" fi fi # GSL_CFLAGS="" # GSL_LIBS="" : fi rm -f conf.gsltest fi if test "$need_my_gsl" != 0 ; then GSL_LIBS="libbf_gsl.a" $as_echo "#define HAVE_GSL_14 1" >>confdefs.h $as_echo "#define HAVE_GSL_10 1" >>confdefs.h fi PATH="$PATH_SAVED" if test $need_my_gsl != 0; then NEED_GSL_TRUE= NEED_GSL_FALSE='#' else NEED_GSL_TRUE='#' NEED_GSL_FALSE= fi if test $ac_cv_func_getopt_long != yes; then NEED_GETOPT_TRUE= NEED_GETOPT_FALSE='#' else NEED_GETOPT_TRUE='#' NEED_GETOPT_FALSE= fi have_dosish_system=no case "${host}" in *-*-mingw32*) # special stuff for Windoze NT have_dosish_system=yes ;; i?86-emx-os2 | i?86-*-os2*emx ) # OS/2 with the EMX environment have_dosish_system=no ;; i?86-*-msdosdjgpp*) # DOS with the DJGPP environment have_dosish_system=yes ;; *) ;; esac bogofilter_transform=`echo "${program_transform_name}" | sed -e 's,\\\\\\\\,\\\\,g;s,\\\$\\\$,\$,g'` transformed_bogofilter=`echo bogofilter | sed -e "$bogofilter_transform"` transformed_bogoutil=`echo bogoutil | sed -e "$bogofilter_transform"` # Note the \\\\ for backslashes. Autoconf eats one layer, leaving \\ $as_echo "#define CURDIR_S \".\"" >>confdefs.h $as_echo "#define EXTSEP_S \".\"" >>confdefs.h if test "$have_dosish_system" = no; then $as_echo "#define DIRSEP_C '/'" >>confdefs.h $as_echo "#define DIRSEP_S \"/\"" >>confdefs.h else $as_echo "#define DIRSEP_C '\\\\\\\\'" >>confdefs.h $as_echo "#define DIRSEP_S \"\\\\\\\\\"" >>confdefs.h fi ac_config_files="$ac_config_files Makefile bogofilter.spec trio/Makefile doc/Makefile src/Makefile src/tests/Makefile src/bf_compact src/bf_copy src/bf_tar" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs { $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5 $as_echo_n "checking that generated files are newer than configure... " >&6; } if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5 $as_echo "done" >&6; } if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error $? "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${USE_GCC4_TRUE}" && test -z "${USE_GCC4_FALSE}"; then as_fn_error $? "conditional \"USE_GCC4\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${PATCH_FLEX_254_TRUE}" && test -z "${PATCH_FLEX_254_FALSE}"; then as_fn_error $? "conditional \"PATCH_FLEX_254\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${PATCH_FLEX_253X_TRUE}" && test -z "${PATCH_FLEX_253X_FALSE}"; then as_fn_error $? "conditional \"PATCH_FLEX_253X\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_STATIC_TRUE}" && test -z "${ENABLE_STATIC_FALSE}"; then as_fn_error $? "conditional \"ENABLE_STATIC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${DISABLE_UNICODE_TRUE}" && test -z "${DISABLE_UNICODE_FALSE}"; then as_fn_error $? "conditional \"DISABLE_UNICODE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_UNICODE_TRUE}" && test -z "${ENABLE_UNICODE_FALSE}"; then as_fn_error $? "conditional \"ENABLE_UNICODE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_MEMDEBUG_TRUE}" && test -z "${ENABLE_MEMDEBUG_FALSE}"; then as_fn_error $? "conditional \"ENABLE_MEMDEBUG\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${DISABLE_TRANSACTIONS_TRUE}" && test -z "${DISABLE_TRANSACTIONS_FALSE}"; then as_fn_error $? "conditional \"DISABLE_TRANSACTIONS\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_TRANSACTIONS_TRUE}" && test -z "${ENABLE_TRANSACTIONS_FALSE}"; then as_fn_error $? "conditional \"ENABLE_TRANSACTIONS\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_QDBM_DATASTORE_TRUE}" && test -z "${ENABLE_QDBM_DATASTORE_FALSE}"; then as_fn_error $? "conditional \"ENABLE_QDBM_DATASTORE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_SQLITE_DATASTORE_TRUE}" && test -z "${ENABLE_SQLITE_DATASTORE_FALSE}"; then as_fn_error $? "conditional \"ENABLE_SQLITE_DATASTORE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_TOKYOCABINET_DATASTORE_TRUE}" && test -z "${ENABLE_TOKYOCABINET_DATASTORE_FALSE}"; then as_fn_error $? "conditional \"ENABLE_TOKYOCABINET_DATASTORE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${NEEDTRIO_TRUE}" && test -z "${NEEDTRIO_FALSE}"; then as_fn_error $? "conditional \"NEEDTRIO\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${ENABLE_XMLTO_TRUE}" && test -z "${ENABLE_XMLTO_FALSE}"; then as_fn_error $? "conditional \"ENABLE_XMLTO\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${NEED_GSL_TRUE}" && test -z "${NEED_GSL_FALSE}"; then as_fn_error $? "conditional \"NEED_GSL\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${NEED_GETOPT_TRUE}" && test -z "${NEED_GETOPT_FALSE}"; then as_fn_error $? "conditional \"NEED_GETOPT\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by bogofilter $as_me 1.2.4, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to the package provider." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ bogofilter config.status 1.2.4 configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error $? "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "src/config.h") CONFIG_HEADERS="$CONFIG_HEADERS src/config.h:config.in" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "bogofilter.spec") CONFIG_FILES="$CONFIG_FILES bogofilter.spec" ;; "trio/Makefile") CONFIG_FILES="$CONFIG_FILES trio/Makefile" ;; "doc/Makefile") CONFIG_FILES="$CONFIG_FILES doc/Makefile" ;; "src/Makefile") CONFIG_FILES="$CONFIG_FILES src/Makefile" ;; "src/tests/Makefile") CONFIG_FILES="$CONFIG_FILES src/tests/Makefile" ;; "src/bf_compact") CONFIG_FILES="$CONFIG_FILES src/bf_compact" ;; "src/bf_copy") CONFIG_FILES="$CONFIG_FILES src/bf_copy" ;; "src/bf_tar") CONFIG_FILES="$CONFIG_FILES src/bf_tar" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$ac_tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_tt=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_tt"; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error $? "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" } >"$ac_tmp/config.h" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$ac_tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$ac_tmp/config.h" "$ac_file" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error $? "could not create -" "$LINENO" 5 fi # Compute "$ac_file"'s index in $config_headers. _am_arg="$ac_file" _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named 'Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running 'make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi { $as_echo "$as_me:${as_lineno-$LINENO}: Using these settings:" >&5 $as_echo "$as_me: Using these settings:" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: ---------------------" >&5 $as_echo "$as_me: ---------------------" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: CPPFLAGS=$CPPFLAGS" >&5 $as_echo "$as_me: CPPFLAGS=$CPPFLAGS" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: CFLAGS=$CFLAGS" >&5 $as_echo "$as_me: CFLAGS=$CFLAGS" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: LDFLAGS=$LDFLAGS" >&5 $as_echo "$as_me: LDFLAGS=$LDFLAGS" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: LIBS=$LIBS" >&5 $as_echo "$as_me: LIBS=$LIBS" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: LIBDB=$LIBDB" >&5 $as_echo "$as_me: LIBDB=$LIBDB" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: GSL_LIBS=$GSL_LIBS" >&5 $as_echo "$as_me: GSL_LIBS=$GSL_LIBS" >&6;} { $as_echo "$as_me:${as_lineno-$LINENO}: LIBICONV=$LIBICONV" >&5 $as_echo "$as_me: LIBICONV=$LIBICONV" >&6;} bogofilter-1.2.4/autogen.sh0000755000175000017500000000261712163572311014046 0ustar sezsez#!/bin/sh # # Run this to generate all the initial makefiles, etc. # # $Id: autogen.sh 3443 2003-10-29 15:12:06Z m-a $ DIE=0 PROGNAME="bogofilter" (autoconf --version) < /dev/null | head -1 > autogen.log 2>&1 || { echo echo "**Error**: You must have 'autoconf' installed to compile $PROGNAME." echo "Download the appropriate package for your distribution," echo "or get the source tarball at ftp://ftp.gnu.org/pub/gnu/" DIE=1 } (automake --version) < /dev/null | head -1 >> autogen.log 2>&1 || { echo echo "**Error**: You must have 'automake' installed to compile $PROGNAME." echo "Download the appropriate package for your distribution," echo "or get the source tarball at ftp://ftp.gnu.org/pub/gnu/" DIE=1 } (flex --version) < /dev/null | head -1 >> autogen.log 2>&1 || { echo echo "**Error**: You must have 'flex' installed to compile $PROGNAME." echo "Download the appropriate package for your distribution," echo "or get the source tarball at ftp://ftp.gnu.org/pub/gnu/" DIE=1 } if [ "$DIE" -eq 1 ]; then exit 1 fi if [ -z "$*" ]; then echo "**Warning**: Running 'configure' with no arguments." echo "If you wish to pass any to it, specify them on the" echo "'$0' command line." echo fi echo "Running 'autoreconf -fis'" autoreconf -fis echo "" echo "Running './configure --quiet $*'" ./configure --quiet $* echo "" echo "Running 'make -s check'" make -s check echo "" bogofilter-1.2.4/Makefile.in0000644000175000017500000010671612163573271014125 0ustar sezsez# Makefile.in generated by automake 1.12.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2012 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # $Id: Makefile.am 6787 2009-02-09 09:00:24Z m-a $ VPATH = @srcdir@ am__make_dryrun = \ { \ am__dry=no; \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \ | grep '^AM OK$$' >/dev/null || am__dry=yes;; \ *) \ for am__flg in $$MAKEFLAGS; do \ case $$am__flg in \ *=*|--*) ;; \ *n*) am__dry=yes; break;; \ esac; \ done;; \ esac; \ test $$am__dry = yes; \ } pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ noinst_PROGRAMS = bogogrep$(EXEEXT) $(am__EXEEXT_1) @ENABLE_STATIC_TRUE@am__append_1 = bogogrep_static subdir = . DIST_COMMON = README $(am__configure_deps) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in $(srcdir)/bogofilter.spec.in \ $(top_srcdir)/configure AUTHORS COPYING INSTALL NEWS TODO \ config.guess config.rpath config.sub depcomp install-sh \ missing ylwrap ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/gsl.m4 \ $(top_srcdir)/m4/iconv.m4 $(top_srcdir)/m4/lib-ld.m4 \ $(top_srcdir)/m4/lib-link.m4 $(top_srcdir)/m4/lib-prefix.m4 \ $(top_srcdir)/m4/stdbool.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/src/config.h CONFIG_CLEAN_FILES = bogofilter.spec CONFIG_CLEAN_VPATH_FILES = @ENABLE_STATIC_TRUE@am__EXEEXT_1 = bogogrep_static$(EXEEXT) PROGRAMS = $(noinst_PROGRAMS) am_bogogrep_OBJECTS = bogogrep.$(OBJEXT) bogogrep_OBJECTS = $(am_bogogrep_OBJECTS) bogogrep_LDADD = $(LDADD) am__bogogrep_static_SOURCES_DIST = contrib/bogogrep.c @ENABLE_STATIC_TRUE@am_bogogrep_static_OBJECTS = bogogrep.$(OBJEXT) bogogrep_static_OBJECTS = $(am_bogogrep_static_OBJECTS) bogogrep_static_LDADD = $(LDADD) bogogrep_static_LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(bogogrep_static_LDFLAGS) $(LDFLAGS) -o $@ DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)/src depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ SOURCES = $(bogogrep_SOURCES) $(bogogrep_static_SOURCES) DIST_SOURCES = $(bogogrep_SOURCES) $(am__bogogrep_static_SOURCES_DIST) RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } am__installdirs = "$(DESTDIR)$(sysconfdir)" DATA = $(sysconf_DATA) RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ cscope distdir dist dist-all distcheck ETAGS = etags CTAGS = ctags CSCOPE = cscope DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ if test -d "$(distdir)"; then \ find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -rf "$(distdir)" \ || { sleep 5 && rm -rf "$(distdir)"; }; \ else :; fi am__post_remove_distdir = $(am__remove_distdir) am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" DIST_ARCHIVES = $(distdir).tar.gz $(distdir).tar.bz2 GZIP_ENV = --best DIST_TARGETS = dist-bzip2 dist-gzip distuninstallcheck_listfiles = find . -type f -print am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \ | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$' distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DB_EXT = @DB_EXT@ DB_TYPE = @DB_TYPE@ DEFAULT_CHARSET = @DEFAULT_CHARSET@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ ENCODING = @ENCODING@ EXEEXT = @EXEEXT@ EXE_EXT = @EXE_EXT@ GREP = @GREP@ GSL_CFLAGS = @GSL_CFLAGS@ GSL_CONFIG = @GSL_CONFIG@ GSL_LIBS = @GSL_LIBS@ HAVE_EXTENDED_PRECISION_REGISTERS = @HAVE_EXTENDED_PRECISION_REGISTERS@ HAVE_EXTERN_INLINE = @HAVE_EXTERN_INLINE@ HAVE_INLINE = @HAVE_INLINE@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LEX = @LEX@ LEXLIB = @LEXLIB@ LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@ LIBDB = @LIBDB@ LIBICONV = @LIBICONV@ LIBOBJS = @LIBOBJS@ LIBQDBM = @LIBQDBM@ LIBS = @LIBS@ LIBSQLITE3 = @LIBSQLITE3@ LIBTOKYOCABINET = @LIBTOKYOCABINET@ LTLIBDB = @LTLIBDB@ LTLIBICONV = @LTLIBICONV@ LTLIBOBJS = @LTLIBOBJS@ LTLIBQDBM = @LTLIBQDBM@ LTLIBSQLITE3 = @LTLIBSQLITE3@ LTLIBTOKYOCABINET = @LTLIBTOKYOCABINET@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NSGMLS = @NSGMLS@ OBJEXT = @OBJEXT@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PERL = @PERL@ RANLIB = @RANLIB@ RPMBUILD = @RPMBUILD@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STATICLDFLAGS = @STATICLDFLAGS@ STATIC_DB = @STATIC_DB@ STRIP = @STRIP@ USE_TRANSACTIONS = @USE_TRANSACTIONS@ USE_UNICODE = @USE_UNICODE@ VERSION = @VERSION@ XMLLINT = @XMLLINT@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_cv_enable_xmlto = @ac_cv_enable_xmlto@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ transformed_bogofilter = @transformed_bogofilter@ transformed_bogoutil = @transformed_bogoutil@ # search path for m4 macros ACLOCAL_AMFLAGS = -I m4 SUBDIRS = trio src . doc SYSCONFDIR = @sysconfdir@ # what to build sysconf_DATA = bogofilter.cf.example # what to distribute EXTRA_DIST = autogen.sh gsl config.rpath bogofilter.cf.example \ bogofilter.spec bogofilter.spec.in Doxyfile gpl-3.0.txt \ gnugetopt GETTING.STARTED NEWS.0 README.svn RELEASE.NOTES \ install-staticdblibs.sh contrib/README.contrib \ contrib/README.randomtrain contrib/bogo.R contrib/bfproxy.pl \ contrib/bogofilter-milter.pl contrib/bogofilter-qfe.sh \ contrib/bogominitrain.pl contrib/dot-qmail-bogofilter-default \ contrib/mailfilter.example contrib/mime.get.rfc822.pl \ contrib/parmtest.sh contrib/printmaildir.pl \ contrib/procmailrc.example contrib/randomtrain.sh \ contrib/scramble.sh contrib/spamitarium.pl \ contrib/stripsearch.pl contrib/trainbogo.sh \ contrib/vm-bogofilter.el # # RPM building - there are some cheats here # # BF_ZAP_LIBDB is a magic variable we check from configure.ac, # which zaps LIBDB and allows us to override the library choice # through LIBS=... # # Passing -ldb-4.2 (for the second -tb line) will fail on systems that # don't have libdb-4.2.* in the default library path that "ld" uses. # Install your system's db42 and db42-devel packages and retry. # Using -ldb-4.2 is indispensable as systems with db 4.3 or 4.4 would # otherwise pick the newer one as their default, but we must match # the library between shared and static RPM so that users can switch # forth and back without difficulties such as dumping and reloading # the database. # # CPPFLAGS=-D__NO_CTYPE tells glibc to use the older glibc 2.2.X # ctype implementation (functions). Else glibc would use a newer # 2.3.X ctype implementation, and as this is the only module that # requires 2.3.X in our code, we just use the 2.2.X version instead. # This works up to and including 2.3.5, the newest glibc version # available at the time this code was written. # # RPM and GPG-AGENT # ================= # Using the GnuPG agent requires some fiddling, as RPM has no native # support. # # 1. add these lines to your ~/.rpmmacros: # # %__gpg_check_password_cmd %{__gpg} gpg --batch --no-verbose \ # --use-agent -u "%{_gpg_name}" -so - # %__gpg_sign_cmd %{__gpg} gpg --batch --no-verbose \ # --no-armor --use-agent --no-secmem-warning -u "%{_gpg_name}" \ # -sbo %{__signature_filename} %{__plaintext_filename} # # 2. launch the GnuPG agent, unless already running: # eval $(gpg-agent --sh --daemon) # # 3. run "setsid make rpm /dev/null" # DBPFX = /opt/db-4.2-lean SQPFX = /opt/sqlite-3-lean DBLIB = $(DBPFX)/lib/libdb.a SQLIB = $(SQPFX)/lib/libsqlite3.a DEF_DB42 = --define 'with_db42 1' DEF_SQLITE = --define 'with_sqlite 1' DEF_STATIC = --define 'bf_nameext -static' SIGN = --sign bogogrep_SOURCES = contrib/bogogrep.c @ENABLE_STATIC_TRUE@bogogrep_static_SOURCES = contrib/bogogrep.c @ENABLE_STATIC_TRUE@bogogrep_static_LDFLAGS = $(STATICLDFLAGS) all: all-recursive .SUFFIXES: .SUFFIXES: .c .o .obj am--refresh: Makefile @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): bogofilter.spec: $(top_builddir)/config.status $(srcdir)/bogofilter.spec.in cd $(top_builddir) && $(SHELL) ./config.status $@ clean-noinstPROGRAMS: -test -z "$(noinst_PROGRAMS)" || rm -f $(noinst_PROGRAMS) bogogrep$(EXEEXT): $(bogogrep_OBJECTS) $(bogogrep_DEPENDENCIES) $(EXTRA_bogogrep_DEPENDENCIES) @rm -f bogogrep$(EXEEXT) $(LINK) $(bogogrep_OBJECTS) $(bogogrep_LDADD) $(LIBS) bogogrep_static$(EXEEXT): $(bogogrep_static_OBJECTS) $(bogogrep_static_DEPENDENCIES) $(EXTRA_bogogrep_static_DEPENDENCIES) @rm -f bogogrep_static$(EXEEXT) $(bogogrep_static_LINK) $(bogogrep_static_OBJECTS) $(bogogrep_static_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogogrep.Po@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'` bogogrep.o: contrib/bogogrep.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT bogogrep.o -MD -MP -MF $(DEPDIR)/bogogrep.Tpo -c -o bogogrep.o `test -f 'contrib/bogogrep.c' || echo '$(srcdir)/'`contrib/bogogrep.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/bogogrep.Tpo $(DEPDIR)/bogogrep.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='contrib/bogogrep.c' object='bogogrep.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o bogogrep.o `test -f 'contrib/bogogrep.c' || echo '$(srcdir)/'`contrib/bogogrep.c bogogrep.obj: contrib/bogogrep.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT bogogrep.obj -MD -MP -MF $(DEPDIR)/bogogrep.Tpo -c -o bogogrep.obj `if test -f 'contrib/bogogrep.c'; then $(CYGPATH_W) 'contrib/bogogrep.c'; else $(CYGPATH_W) '$(srcdir)/contrib/bogogrep.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/bogogrep.Tpo $(DEPDIR)/bogogrep.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='contrib/bogogrep.c' object='bogogrep.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o bogogrep.obj `if test -f 'contrib/bogogrep.c'; then $(CYGPATH_W) 'contrib/bogogrep.c'; else $(CYGPATH_W) '$(srcdir)/contrib/bogogrep.c'; fi` install-sysconfDATA: $(sysconf_DATA) @$(NORMAL_INSTALL) @list='$(sysconf_DATA)'; test -n "$(sysconfdir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(sysconfdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(sysconfdir)" || exit 1; \ fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(sysconfdir)'"; \ $(INSTALL_DATA) $$files "$(DESTDIR)$(sysconfdir)" || exit $$?; \ done uninstall-sysconfDATA: @$(NORMAL_UNINSTALL) @list='$(sysconf_DATA)'; test -n "$(sysconfdir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(sysconfdir)'; $(am__uninstall_files_from_dir) # This directory's subdirectories are mostly independent; you can cd # into them and run 'make' without going through this Makefile. # To change the values of 'make' variables: instead of editing Makefiles, # (1) if the variable is set in 'config.status', edit 'config.status' # (which will cause the Makefiles to be regenerated when you run 'make'); # (2) otherwise, pass the desired values on the 'make' command line. $(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done cscopelist-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) config.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) config.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) config.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" cscope: cscope.files test ! -s cscope.files \ || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS) clean-cscope: -rm -f cscope.files cscope.files: clean-cscope cscopelist-recursive cscopelist cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags -rm -f cscope.out cscope.in.out cscope.po.out cscope.files distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__post_remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__post_remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__post_remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__post_remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__post_remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__post_remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__post_remove_distdir) dist dist-all: $(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:' $(am__post_remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lz*) \ lzip -dc $(distdir).tar.lz | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir) chmod u+w $(distdir) mkdir $(distdir)/_build $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__post_remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @test -n '$(distuninstallcheck_dir)' || { \ echo 'ERROR: trying to run $@ with an empty' \ '$$(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ $(am__cd) '$(distuninstallcheck_dir)' || { \ echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am check: check-recursive all-am: Makefile $(PROGRAMS) $(DATA) installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(sysconfdir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-generic clean-noinstPROGRAMS mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-sysconfDATA install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-compile mostlyclean-generic pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-sysconfDATA .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) \ cscopelist-recursive ctags-recursive install-am install-strip \ tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am am--refresh check check-am clean clean-cscope \ clean-generic clean-noinstPROGRAMS cscope cscopelist \ cscopelist-recursive ctags ctags-recursive dist dist-all \ dist-bzip2 dist-gzip dist-hook dist-lzip dist-shar dist-tarZ \ dist-xz dist-zip distcheck distclean distclean-compile \ distclean-generic distclean-tags distcleancheck distdir \ distuninstallcheck dvi dvi-am html html-am info info-am \ install install-am install-data install-data-am install-dvi \ install-dvi-am install-exec install-exec-am install-html \ install-html-am install-info install-info-am install-man \ install-pdf install-pdf-am install-ps install-ps-am \ install-strip install-sysconfDATA installcheck installcheck-am \ installdirs installdirs-am maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic pdf pdf-am ps ps-am tags tags-recursive \ uninstall uninstall-am uninstall-sysconfDATA # ChangeLog, cvs2cl lives at http://www.red-bean.com/cvs2cl .PHONY: $(srcdir)/changelog.txt $(srcdir)/changelog.txt: test -f $@ || : >$@ || { rm -f $@ ; exit 1; } ( cd $(srcdir) && cvs2cl.pl --fsf --accum --utc --file changelog.txt ) .PHONY: check rpm svn-check # rpm: dist @echo @echo "Note: if 'make rpm' fails, check the top-level Makefile.am for documentation." @echo @echo "Note: see Makefile.am comments for information on how to use the GnuPG agent." @echo @sleep 5 $(RPMBUILD) $(SIGN) -ts $(distdir).tar.gz if test ! -f $(DBLIB) || test ! -f $(SQLIB) || objdump -t $(SQLIB) | grep -q __ctype_b_loc ; then \ echo >&2 "Please run the install-staticdblibs.sh script first." ; exit 1 ; fi BF_ZAP_LIBDB=zap CPPFLAGS="-D__NO_CTYPE -I$(DBPFX)/include" LIBS=$(DBLIB) \ $(RPMBUILD) $(DEF_STATIC) $(DEF_DB42) $(SIGN) -tb $(distdir).tar.gz BF_ZAP_LIBDB=zap CPPFLAGS="-D__NO_CTYPE -I$(SQPFX)/include" LIBS="$(SQLIB) -ldl" \ $(RPMBUILD) $(DEF_STATIC) $(DEF_SQLITE) $(SIGN) -tb $(distdir).tar.gz @echo @echo "Now building the shared database library RPMs - this may fail" @echo "if system-wide library installs of BerkeleyDB 4.2 or SQLite 3" @echo "are missing from your system. The static RPMs that have just" @echo "been built are ready to go however." @echo @sleep 5 - CPPFLAGS="-D__NO_CTYPE -I$(DBPFX)" LIBS="-ldb-4.2 -pthread" \ $(RPMBUILD) $(DEF_DB42) $(SIGN) -tb $(distdir).tar.gz - CPPFLAGS="-D__NO_CTYPE -I$(SQPFX)" \ $(RPMBUILD) $(DEF_SQLITE) $(SIGN) -tb $(distdir).tar.gz svn-check: rm -rf $(PACKAGE)-$(VERSION)-export svn export -rBASE $(srcdir) $(PACKAGE)-$(VERSION)-export cd $(PACKAGE)-$(VERSION)-export && autoreconf -i -f -s -v \ && ./configure && make distcheck # this target expects a .rsyncs file with lines of this format: # host:directory/ # it will call rsync from its source directory to the destination for # each of them, running them in parallel .PHONY: rsync rsynconly rsync: distdir rsynconly rsynconly: .rsyncs @( cat $(srcdir)/.rsyncs | sed -e 's}^}rsync -av -e ssh --delete $(PACKAGE)-$(VERSION)/ }; s/\($$\)/ \&/;' ; echo "wait" ) | $(SHELL) -x dist-hook: cd $(distdir) && find doc gnugetopt gsl '(' -name .svn -o -name CVS ')' -type d -prune -exec rm -rf '{}' + cd $(distdir) && find doc gnugetopt gsl -name '.#*' -type f -exec rm '{}' ';' rm -f $(distdir)/doc/.cvsignore $(distdir)/ChangeLog # --------------------------------------------------------------------- # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: bogofilter-1.2.4/configure.ac0000644000175000017500000006540112163573023014334 0ustar sezsezdnl vim: set noai tw=0: dnl $Id: configure.ac 6980 2012-12-03 22:24:25Z m-a $ dnl dnl configure.ac for bogofilter dnl (C) Copyright 2003 Clint Adams, Gyepi Sam, David Relson, Matthias Andree dnl (C) Copyright 2008 Clint Adams, David Relson, Matthias Andree dnl (C) Copyright 2004-2007, 2009 David Relson, Matthias Andree dnl dnl ******************************************************** dnl "Magic" environment variables for this script are: dnl dnl BF_ZAP_LIBDB - LIBDB turns out empty, so that dnl set to "zap" the database library can be taken from dnl libs (for static linking). dnl dnl BF_FORCE_TRIO - Unconditionally compile and link against dnl set to "yes" the "Trio" [v]snprintf library (which is dnl part of the bogofilter source). dnl ******************************************************** dnl AC_INIT([bogofilter],[1.2.4]) dnl AC_PREREQ([2.68]) AC_USE_SYSTEM_EXTENSIONS AC_CONFIG_SRCDIR([src/bogofilter.c]) AC_CANONICAL_HOST AM_INIT_AUTOMAKE([foreign 1.10 dist-bzip2 no-installinfo]) AC_CONFIG_HEADERS([src/config.h:config.in]) AC_PROG_AWK AC_PROG_CC(gcc xlc cc) dnl this requires autoconf 2.60: dnl AC_USE_SYSTEM_EXTENSIONS AC_CHECK_TOOL(AR, ar, no) if test "$AR" = no ; then AC_MSG_ERROR([Please make sure that "ar" is in your PATH.]) fi AC_PROG_RANLIB AC_PATH_PROGS(PERL, perl perl5,,$PATH:/usr/local/bin:/usr/bin) AC_PATH_PROGS(NSGMLS,onsgmls nsgmls,nsgmls) AC_PATH_PROGS(RPMBUILD,rpmbuild rpm,rpmbuild) AC_PATH_PROGS(XMLLINT,xmllint,xmllint) AM_PROG_LEX dnl Check compiler capabilities AC_C_CONST AC_C_INLINE AC_C_VOLATILE AC_C_RESTRICT dnl define our test programs are C AC_LANG([C]) if test "$ac_cv_c_inline" != no ; then AC_DEFINE(HAVE_INLINE,1, [define to 1 if 'inline' is supported]) AC_SUBST(HAVE_INLINE) fi dnl Check for "extern inline", using a modified version dnl of the test for AC_C_INLINE from acspecific.mt. dnl Run this before AC_C_INLINE to avoid skewing the results? dnl Imported from the GSL 1.4 documentation (section "Autoconf Macros") dnl and modified to define HAVE_EXTERN_INLINE. AC_CACHE_CHECK([for extern inline], ac_cv_c_extern_inline, [ac_cv_c_extern_inline=no AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[extern $ac_cv_c_inline double foo(double x); extern $ac_cv_c_inline double foo(double x) { return x+1.0; }; double foo (double x) { return x + 1.0; };]], [[ foo(1.0) ]])],[ac_cv_c_extern_inline="yes"],[]) ]) if test "$ac_cv_c_extern_inline" != no ; then AC_DEFINE(HAVE_EXTERN_INLINE,1,Define to 1 if your compiler supports extern inline storage class.) AC_SUBST(HAVE_EXTERN_INLINE) fi dnl Check for extension AC_EXEEXT dnl check for b0rked Solaris (and other shells) and find one that works AC_MSG_CHECKING(for a working shell...) for i in /usr/xpg6/bin/sh /usr/xpg4/bin/sh /usr/ccs/bin/sh /bin/sh /usr/bin/sh /bin/ksh /bin/bash /usr/local/bin/bash ; do $i -c 'if ! false ; then echo $(echo ok) ; fi' >config.$$ 2>/dev/null j=`cat config.$$` rm -f config.$$ if test "x$j" = "xok" ; then SHELL=$i AC_SUBST(SHELL) break fi done AC_MSG_RESULT($SHELL) if test "x$SHELL" = "x" ; then AC_MSG_ERROR(no SUS compliant shell found - on Solaris, install SUNWxcu4) fi dnl crutch for b0rked S/390 gcc: if test "x$host_cpu" = "xs390" && test "x$GCC" = "xyes" ; then case ${CFLAGS} in *-O*) OCFLAGS="$CFLAGS" dnl override -Os and -O2 and higher to -O1. dnl this is imperfect, as you can fool it by saying -O04 dnl however, you can as well say -O4 -O4 and it will dnl be -O1 and -O4 -- the last one takes precedence in gcc. CFLAGS="`echo \"$CFLAGS\" | sed 's/-O[[s1-9][0-9]]*/-O1/'`" export CFLAGS AC_MSG_NOTICE([GCC for s390: Overriding CFLAGS "$OCFLAGS" to "$CFLAGS".]) esac fi dnl crutch for b0rked dgux gcc 2.7 (-g gives unresolved symbols in GSL), dnl gcc 2.8.1 is fine according to Message-ID: <199805061718.NAA01272@monty> dnl see http://list-archive.xemacs.org/xemacs-beta/199805/msg00291.html case "$host_os" in dgux*) if test "$GCC" = yes ; then case "`$CC --version`" in 2.7*) case ${CFLAGS} in *-g*) OCFLAGS="$CFLAGS" CFLAGS="" for i in $OCFLAGS ; do case x$i in x-g*) ;; *) CFLAGS="$CFLAGS$i " ;; esac done AC_MSG_NOTICE([dgux: Removing -g options from CFLAGS, new: "$CFLAGS".]) ;; esac ;; esac fi ;; esac dnl If we're using gcc, enable some warnings dnl missing: -Wunreachable-code if test "$GCC" = yes ; then AC_MSG_CHECKING([if gcc is really Intel C++]) case "`$CC -V 2>&1`" in [[iI][nN][tT][eE][lL]]*) ICC=yes ;; *) ICC=no ;; esac AC_MSG_RESULT($ICC) fi AC_CACHE_CHECK(for additional compiler options, ac_cv_prog_gcc_flags, [ ac_cv_prog_gcc_flags="" if test "$GCC" = yes && test "$ICC" = no then echo "void dummy(void);" >configure-dummy.c echo "void dummy(void) {}" >>configure-dummy.c addopts= # note: GCC 2.X print just the version number, like "2.95.3" # GCC 3.X print something like "gcc (GCC) 3.3.1 (SuSE Linux)" case `$CC --version` in 2.*) ;; *) addopts="$addopts -Wpointer-arith -ggdb" ;; esac for i in $addopts \ dnl the -ieee option is for Alpha, Clint Adams' recommendation dnl See http://thread.gmane.org/gmane.mail.bogofilter.general/6352 -mieee \ -Wall -W -Wstrict-prototypes -Wmissing-prototypes -Wshadow \ -Wbad-function-cast -Wcast-qual -Wcast-align -Wwrite-strings \ -Waggregate-return -Wmissing-declarations \ -Wmissing-format-attribute -Wnested-externs \ -fno-common -Wchar-subscripts -Wcomment \ -Wimplicit -Wsequence-point -Wreturn-type \ -Wno-system-headers -Wformat # -Wfloat-equal -Wformat=2 # -Wmissing-noreturn -Wconversion -pedantic -Wredundant-decls do if $CC $i $ac_cv_prog_gcc_flags -c configure-dummy.c >/dev/null 2>&1 then ac_cv_prog_gcc_flags="$ac_cv_prog_gcc_flags $i" else echo "ignoring $i" fi done fi]) rm -f configure-dummy.c configure-dummy.o CFLAGS="$CFLAGS $ac_cv_prog_gcc_flags" AC_SUBST(CFLAGS) dnl Check if we're running GCC 4.0.0 or higher, if so, switch dnl to the new -iquote scheme rather than using -I- -I. gcc4=no if test "$GCC" = yes && test "$ICC" = no ; then case `$CC -dumpversion 2>/dev/null` in ""|2.*|3.*) ;; 4.*) gcc4=yes ;; esac case "$CC" in *clang) gcc4=yes ;; esac fi AM_CONDITIONAL(USE_GCC4, test $gcc4 = yes) dnl Check whether flex needs patching flex=no if test -n "$LEX"; then case `$LEX --version` in *2.5.4) flex=254 ;; *2.5.31) flex=253x ;; *2.5.33) flex=253x ;; *2.5.35) flex=O.K. ;; esac fi dnl flex=yes AM_CONDITIONAL(PATCH_FLEX_254, test $flex = 254) AM_CONDITIONAL(PATCH_FLEX_253X, test $flex = 253x) dnl large file support (LFS) AC_SYS_LARGEFILE dnl AC_FUNC_FSEEKO dnl Checks for libraries. AC_CHECK_LIB([m], [cos]) dnl fdatasync can be faster than fsync but may be in librt on some systems dnl such as Solaris. The code is currently stubbed out in db_lock.c dnl AC_SEARCH_LIBS([fdatasync],[rt],AC_DEFINE(HAVE_FDATASYNC,1,[Define to 1 if you have the 'fdatasync' function.])) AC_CHECK_DECLS([getopt,optreset],,,[[ #include /* Solaris */ #include ]]) dnl check for SYNC stuff AC_CHECK_DECLS([O_DSYNC, O_SYNC, O_FSYNC],,,[#include ]) dnl Coerce GLIBC 2.3 to GLIBC 2.2 compatibility. dnl May not be complete with future extensions, but appears to work dnl today, 2003-10-02. Matthias Andree AC_DEFINE(__NO_CTYPE,1,[Define __NO_CTYPE to 1 to avoid GLIBC_2.3-specific ctype.h functions.]) dnl Enable building statically linked executables AC_ARG_ENABLE(static, AS_HELP_STRING([--enable-static], [build static versions as well (unsupported).])) case a$enable_static in ayes) EXE_EXT="_static" AC_MSG_CHECKING([option to link statically]) LDEFLAGS="$LDFLAGS" found=0 for i in -static ; do LDFLAGS="$LDEFLAGS $i" AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include ]], [[exit (0);]])],found=1) if test $found -eq 1 ; then break ; fi done if test $found -eq 1 ; then AC_MSG_RESULT($i) STATICLDFLAGS=$i LDFLAGS="$LDEFLAGS" else AC_MSG_RESULT([[?]]) AC_MSG_WARN([Cannot figure out how to statically link a program.]) STATICLDFLAGS= enable_static=no fi ;; ano|a) ;; *) STATICLDFLAGS="$enable_static" enable_static=yes ;; esac export STATICLDFLAGS AC_SUBST(STATICLDFLAGS) AM_CONDITIONAL(ENABLE_STATIC, test x$enable_static = xyes) AC_SUBST(EXE_EXT) dnl Allow the user to specify a header name to use to indicate whether a given dnl message is SPAM or not. AC_ARG_ENABLE(spam-header-name, AS_HELP_STRING([--enable-spam-header-name=name], [use specified header name instead of "X-Bogosity"]), AC_DEFINE_UNQUOTED(SPAM_HEADER_NAME, ["$enableval"], [Use specified header name instead of "X-Bogosity"]), AC_DEFINE_UNQUOTED(SPAM_HEADER_NAME, ["X-Bogosity"]) ) dnl Allow the user to enable/disable use of Unicode AC_ARG_ENABLE(unicode, AS_HELP_STRING([--disable-unicode], [disables Unicode/UTF-8 conversion of character sets]), if test "$enableval" = no; then [USE_UNICODE=NO] fi if test "$enableval" = yes; then [USE_UNICODE=YES] fi if test x$USE_UNICODE != x ; then AC_DEFINE_UNQUOTED(USE_UNICODE, "$USE_UNICODE", [Unicode enabled/disabled flag]) AC_SUBST(USE_UNICODE) fi ) AM_CONDITIONAL(DISABLE_UNICODE, test x$USE_UNICODE = xNO) AM_CONDITIONAL(ENABLE_UNICODE, test x$USE_UNICODE != xNO) if test x$USE_UNICODE = xNO ; then AC_DEFINE(DISABLE_UNICODE,1, [Disable converting character sets to Unicode]) [ENCODING="raw"] else AM_ICONV AC_DEFINE(ENABLE_UNICODE,1, [Enable converting character sets to Unicode]) [ENCODING="utf-8"] fi [DEFAULT_CHARSET="iso-8859-1"] dnl Allow the user to enable Russian character set support if test x$USE_UNICODE != xYES ; then AC_ARG_ENABLE(russian, AS_HELP_STRING([--enable-russian], [switch default character set to CP866 [[iso-8859-1]]]), if test "$enableval" = no; then [USE_CP866=NO] else [USE_CP866=YES] fi ) dnl Enable building with Russian character set support. if test x$USE_CP866 = xYES ; then AC_DEFINE(CP866,1, [Default charset is CP866 rather than iso-8859-1]) [DEFAULT_CHARSET="CP866"] fi fi dnl Allow the user to specify a default charset AC_ARG_WITH(charset, AS_HELP_STRING([--with-charset=name], [use specified charset (overrides --enable-russian) [[iso-8859-1]]]), AC_DEFINE_UNQUOTED(DEFAULT_CHARSET, ["$withval"], [Use specified default charset instead of iso-8859-1]) ) AC_SUBST(ENCODING) AC_SUBST(DEFAULT_CHARSET) AC_DEFINE_UNQUOTED(DEFAULT_CHARSET, ["$DEFAULT_CHARSET"], [Use specified charset]) dnl Allow the user to enable memory usage debugging methods AC_ARG_ENABLE(memdebug, AS_HELP_STRING([--enable-memdebug], [enable memory usage debugging]), if test "$enableval" = no; then [USE_MEMDEBUG=NO] else [USE_MEMDEBUG=YES] fi ) dnl Enable building with memory usage debugging files. if test x$USE_MEMDEBUG = xYES ; then AC_DEFINE(ENABLE_MEMDEBUG,1, [Enable memory usage debugging]) fi AM_CONDITIONAL(ENABLE_MEMDEBUG, test x$USE_MEMDEBUG = xYES) dnl Checks for header files. AC_HEADER_STDC AC_HEADER_STDBOOL AC_HEADER_DIRENT AC_HEADER_TIME AC_CHECK_HEADERS([syslog.h sys/param.h fcntl.h string.h strings.h unistd.h sys/time.h sys/select.h inttypes.h stdarg.h stdint.h]) AC_CHECK_HEADERS([limits.h float.h],,[AC_CHECK_HEADERS(values.h)]) dnl Checks for typedefs, structures, and compiler characteristics. AC_TYPE_PID_T AC_TYPE_SIZE_T AC_TYPE_UID_T AC_FUNC_SELECT_ARGTYPES AC_CHECK_TYPES([uint, ulong, uint32_t, u_int32_t, int32_t, int16_t, u_int16_t, uint16_t, u_int8_t, ssize_t]) AC_CHECK_TYPE(u_long, unsigned long) dnl XXX FIXME - this is a crude hack and not necessarily working, dnl but it might be good enough if we don't see asynchronous signals AC_CHECK_TYPES([sig_atomic_t],,,[ #include ]) dnl FreeBSD needs sys/types.h and sys/time.h for sys/resource.h AC_CHECK_TYPES([rlim_t],,,[ #ifdef HAVE_SYS_TYPES_H #include #endif #ifdef HAVE_SYS_TIME_H #include #endif #include ]) AC_CACHE_SAVE AC_CHECK_SIZEOF(short) AC_CHECK_SIZEOF(int) AC_CHECK_SIZEOF(long) dnl The next one isn't really needed, but useful for post-mortem analysis of dnl automated package build logs such as bento.freebsd.org or buildd.debian.org: AC_CHECK_SIZEOF(size_t) AC_FUNC_MEMCMP AC_FUNC_MMAP AC_FUNC_VPRINTF AC_CHECK_FUNCS(strchr strrchr memcpy memmove snprintf vsnprintf getopt_long arc4random) AC_REPLACE_FUNCS(strlcpy strlcat strerror strtoul) AC_LIB_RPATH dnl Allow the user to enable/disable use of database transactions AC_ARG_ENABLE(transactions, AS_HELP_STRING([--enable-transactions], [force transactional mode (disable traditional) in Berkeley DB @<:@compile both modes and select at run-time@:>@]), if test "$enableval" = no; then [USE_TRANSACTIONS=NO] fi if test "$enableval" = yes; then [USE_TRANSACTIONS=YES] fi if test x$USE_TRANSACTIONS != x ; then AC_DEFINE_UNQUOTED(USE_TRANSACTIONS, "$USE_TRANSACTIONS", [transactions enabled/disabled flag]) AC_SUBST(USE_TRANSACTIONS) fi ) dnl dummy ARG_ENABLE to produce the help string AC_ARG_ENABLE(dummy, AS_HELP_STRING([--disable-transactions], [disable transactional mode (force traditional) in Berkeley DB @<:@compile both modes and select at run-time@:>@]),,) AM_CONDITIONAL(DISABLE_TRANSACTIONS, test x$USE_TRANSACTIONS = xNO) AM_CONDITIONAL(ENABLE_TRANSACTIONS, test x$USE_TRANSACTIONS = xYES) if test x$USE_TRANSACTIONS = xNO ; then AC_DEFINE(DISABLE_TRANSACTIONS,1, [Disable transactional mode in Berkeley DB]) fi if test x$USE_TRANSACTIONS = xYES ; then AC_DEFINE(ENABLE_TRANSACTIONS,1, [Force transactional mode in Berkeley DB]) fi AC_ARG_ENABLE(dbshared-test, AS_HELP_STRING([--disable-dbshared-test], [defeat test for shared environment (unsafe)])) AC_CACHE_SAVE WITH_DB_ENGINE=db AC_ARG_WITH(database, AS_HELP_STRING([--with-database=ENGINE], [choose database engine {db|qdbm|sqlite3|tokyocabinet} [[db]]]), [ WITH_DB_ENGINE=$withval ] ) case "x$WITH_DB_ENGINE" in xsqlite|xsqlite3) AC_DEFINE(ENABLE_SQLITE_DATASTORE,1, [Enable sqlite3 datastore]) DB_TYPE=sqlite DB_EXT=.db AC_CHECK_HEADERS([sqlite3.h],,AC_MSG_ERROR(Cannot find sqlite3.h header file)) AC_LIB_LINKFLAGS([sqlite3]) LIBDB="$LIBSQLITE3" WITH_DB_ENGINE="sqlite3" saveLIBS="$LIBS" LIBS="$LIBDB $LIBS" AC_CHECK_FUNC([sqlite3_prepare_v2],,AC_DEFINE(sqlite3_prepare_v2,sqlite3_prepare,[Define to sqlite3_prepare if new interface missing (for sqlite < 3.3.9)])) LIBS="$saveLIBS" ;; xtokyocabinet) AC_DEFINE(ENABLE_TOKYOCABINET_DATASTORE,1, [Enable tokyocabinet datastore]) DB_TYPE=tokyocabinet DB_EXT=.tc AC_LIB_LINKFLAGS([tokyocabinet]) LIBDB="$LIBTOKYOCABINET" saveLIBS="$LIBS" LIBS="$LIBS $LIBDB" AC_LINK_IFELSE([AC_LANG_PROGRAM([ #include #include #include #include #include #include #include ], [ TCBDB *d = tcbdbnew(); ])],,AC_MSG_ERROR(Cannot link to tokyocabinet library.)) LIBS="$saveLIBS" ;; xqdbm) AC_DEFINE(ENABLE_QDBM_DATASTORE,1, [Enable qdbm datastore]) DB_TYPE=qdbm DB_EXT=.qdbm AC_LIB_LINKFLAGS([qdbm]) LIBDB="$LIBQDBM" saveLIBS="$LIBS" LIBS="$LIBS $LIBDB" AC_LINK_IFELSE([AC_LANG_PROGRAM([ #include #include ], [ DEPOT *d = dpopen("", 0, 0); ])],,AC_MSG_ERROR(Cannot link to qdbm library.)) LIBS="$saveLIBS" ;; xdb*) dnl check if we need LIBDB at all (it is harmful on BSD since dnl they rename the library including soname) dnl and try to guess if we need -lpthread or -lthread DB_TYPE=db DB_EXT=.db AC_LIB_LINKFLAGS([db]) AC_MSG_CHECKING(db and dependent libraries) saveLIBS="$LIBS" havelib=0 for dblibs in "" "$LIBDB" ; do for addlibs in "" -lpthread -lthread ; do LIBDB="$dblibs $addlibs" export LIBDB LIBS="$saveLIBS $LIBDB" export LIBS AC_LINK_IFELSE([AC_LANG_PROGRAM([#include ], [int r, s, t; db_version(&r, &s, &t);])],havelib=1 ; break 2) done done LIBS="$saveLIBS" export LIBS if test $havelib = 0 ; then AC_MSG_RESULT(error) AC_MSG_ERROR([[ ===================================================================== Cannot link against libdb? Try these steps to solve the problem: 1. Be sure that the Berkeley DB developer package is installed. 2. Type: rm -f config.cache then re-run configure. 3. If the problem persists, report it to the bogofilter mailing list. Remember to include your config.log. ===================================================================== ]]) fi AC_MSG_RESULT($LIBDB) LIBS="$saveLIBS" export LIBS AH_TEMPLATE([HAVE_DB_H], [Have suitable db.h header]) AC_SUBST(LIBDB) dnl check if run-time link works saveLIBS="$LIBS" LIBS="$LIBS $LIBDB" AC_MSG_CHECKING(if a program can be linked against Berkeley DB and run) AC_RUN_IFELSE([AC_LANG_PROGRAM([[ #ifdef HAVE_INTTYPES_H #include #endif #include ]], [[ return 0; ]])],, [AC_MSG_RESULT(no) AC_MSG_ERROR([Cannot run a program linked against libdb. Did you adjust your library search path to include your libdb?])],true) AC_MSG_RESULT(yes) dnl check if header and library of DB library match dnl ignore if cross compiling AC_MSG_CHECKING(if Berkeley DB header and library versions match) rm -r -f bfadtestdir mkdir bfadtestdir AC_RUN_IFELSE([ AC_LANG_PROGRAM([[ #include #include #ifdef HAVE_INTTYPES_H #include #endif #include ]], [[ int maj, min; (void)db_version(&maj, &min, 0); (void)fprintf(stderr, "headers: %d.%d, library: %d.%d\n", DB_VERSION_MAJOR, DB_VERSION_MINOR, maj, min); if (maj != DB_VERSION_MAJOR) exit(1); if (min != DB_VERSION_MINOR) exit(1); exit(0); ]])],, [AC_MSG_RESULT(no) AC_MSG_ERROR(db.h header file and db library version do not match.)],true) AC_MSG_RESULT(yes) AC_CHECK_DECLS(db_create,, AC_MSG_ERROR([[Can not locate a suitable Berkeley DB db.h header file. Use --with-libdb-prefix=PATH to specify the path to a v3+ install directory. You can download Berkeley DB 4.3.x from http://www.sleepycat.com/]]), [[#ifdef HAVE_INTTYPES_H #include #endif #include ]] ) AC_MSG_CHECKING(if Berkeley DB supports shared environments) if test "x$enable_dbshared_test" != xno && test "x$USE_TRANSACTIONS" != xNO ; then AC_RUN_IFELSE([ AC_LANG_PROGRAM([[ #ifdef HAVE_INTTYPES_H #include #endif #include #include #include #define TESTDIR "bfadtestdir" #define barf(where, what) do { fprintf(stderr, "%s failed: %s\n", where, db_strerror(what)); exit(1); } while(0) ]], [[ DB_ENV *e; int r; if ((r = db_env_create(&e, 0))) barf("db_env_create", r); if ((r = e->open(e, TESTDIR, DB_INIT_LOG|DB_INIT_TXN|DB_INIT_MPOOL|DB_CREATE, 0664))) barf("DB_ENV->open", r); if ((r = e->close(e, 0))) barf("DB_ENV->close", r); if ((r = db_env_create(&e, 0))) barf("db_env_create", r); if ((r = e->remove(e, TESTDIR, 0))) barf("DB_ENV->remove", r); return 0; ]])],, [AC_MSG_RESULT(no) rm -r -f bfadtestdir AC_MSG_ERROR([ Cannot open a shared environment in Berkeley DB. This is a known problem on Fedora Core Linux. Build your own Berkeley DB installation and use --with-libdb-prefix to point bogofilter to it. Alternatively, you can use the unsafe non-transactional database by configuring with --disable-transactions. Packagers, if you are absolutely sure that the target system supports shared environments, you can use --disable-dbshared-test.])],true) rm -r -f bfadtestdir AC_MSG_RESULT(yes) else AC_MSG_RESULT(skipped) fi AC_DEFINE(ENABLE_DB_DATASTORE,1, [Enable Berkeley DB datastore]) LIBS="$saveLIBS" ;; *) AC_MSG_ERROR([Invalid --with-database argument. Supported engines are db, qdbm, sqlite3, tokyocabinet.]) ;; esac if test "a$STATIC_DB" = a ; then if test "a$WITH_DB_ENGINE" = a ; then STATIC_DB="-ldb" else STATIC_DB="-l$WITH_DB_ENGINE" fi fi if test "x$BF_ZAP_LIBDB" = "xzap" ; then LIBDB= export LIBDB fi AC_DEFINE_UNQUOTED(DB_EXT, "$DB_EXT", [database file extension]) AC_DEFINE_UNQUOTED(DB_TYPE, "$DB_TYPE", [database type]) AC_SUBST(DB_EXT) AC_SUBST(DB_TYPE) AC_SUBST(STATIC_DB) AM_CONDITIONAL(ENABLE_QDBM_DATASTORE, test "x$WITH_DB_ENGINE" = "xqdbm") AM_CONDITIONAL(ENABLE_SQLITE_DATASTORE, test "x$WITH_DB_ENGINE" = "xsqlite3") AM_CONDITIONAL(ENABLE_TOKYOCABINET_DATASTORE, test "x$WITH_DB_ENGINE" = "xtokyocabinet") dnl Use TRIO to replace missing snprintf/vsnprintf. needtrio=0 if test "$BF_FORCE_TRIO" = "yes" ; then needtrio=1 ; ac_cv_func_vsnprintf=no ; ac_cv_func_snprintf=no ; fi if test "x$ac_cv_func_snprintf" != "xyes" ; then AC_DEFINE(snprintf, trio_snprintf, [Define to trio_snprintf if your system lacks snprintf]) needtrio=1 fi if test "x$ac_cv_func_vsnprintf" != "xyes" ; then AC_DEFINE(vsnprintf, trio_vsnprintf, [Define to trio_vsnprintf if your system lacks vsnprintf]) needtrio=1 fi if test $needtrio -gt 0 then dnl BEGIN TRIO dnl Alpha floating-point compiler option. dnl AC_MSG_CHECKING(for IEEE compilation options) AC_CACHE_VAL(ac_cv_ieee_option, [ ac_cv_ieee_option="none" AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[]], [[ #if !(defined(__alpha) && (defined(__DECC) || defined(__DECCXX) || (defined(__osf__) && defined(__LANGUAGE_C__))) && (defined(VMS) || defined(__VMS))) # error "Option needed" #endif ]])],[ac_cv_ieee_option="/IEEE_MODE=UNDERFLOW_TO_ZERO/FLOAT=IEEE"],[]) if test $ac_cv_ieee_option = none ; then AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[]], [[ #if !(defined(__alpha) && (defined(__DECC) || defined(__DECCXX) || (defined(__osf__) && defined(__LANGUAGE_C__))) && !(defined(VMS) || defined(__VMS)) && !defined(_CFE)) # error "Option needed" #endif ]])],[ac_cv_ieee_option="-ieee"],[]) fi if test $ac_cv_ieee_option = none ; then AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[]], [[ #if !(defined(__alpha) && (defined(__GNUC__) && (defined(__osf__) || defined(__linux__)))) # error "Option needed" #endif ]])],[ac_cv_ieee_option="-mieee"],[]) fi ]) dnl end AC_CACHE_VAL AC_MSG_RESULT($ac_cv_ieee_option) if test $ac_cv_ieee_option != none; then CFLAGS="${CFLAGS} ${ac_cv_ieee_option}" fi dnl END TRIO AC_DEFINE(NEEDTRIO, 1, [Define to 1 if trio is to be included.]) fi AM_CONDITIONAL(NEEDTRIO, test "$needtrio" = "1") dnl check if XMLTO is somewhere AC_CHECK_PROG(ac_cv_enable_xmlto, xmlto, yes, no) AC_MSG_CHECKING([whether xmlto is available]) AC_MSG_RESULT($ac_cv_enable_xmlto) AM_CONDITIONAL(ENABLE_XMLTO, test x$ac_cv_enable_xmlto = xyes) dnl end of tests dnl BEGIN EMBEDDED GSL AC_CACHE_CHECK([for extended floating point registers],ac_cv_c_extended_fp, [case "$host" in *sparc*-*-*) ac_cv_c_extended_fp=no ;; *powerpc*-*-*) ac_cv_c_extended_fp=no ;; *mips*-*-*) ac_cv_c_extended_fp=no ;; *hppa*-*-*) ac_cv_c_extended_fp=no ;; *alpha*-*-*) ac_cv_c_extended_fp=no ;; *68k*-*-*) ac_cv_c_extended_fp=yes ;; *86*-*-*) ac_cv_c_extended_fp=yes ;; *) ac_cv_c_extended_fp=unknown ;; esac]) if test $ac_cv_c_extended_fp != "no" ; then AC_DEFINE(HAVE_EXTENDED_PRECISION_REGISTERS,1) AC_SUBST(HAVE_EXTENDED_PRECISION_REGISTERS) fi dnl END EMBEDDED GSL AH_BOTTOM([ #ifdef HAVE_EXTENDED_PRECISION_REGISTERS #define GSL_COERCE_DBL(x) (gsl_coerce_double(x)) #else #define GSL_COERCE_DBL(x) (x) #endif ]) AC_CACHE_SAVE if test "$sysconfdir" = "\${prefix}/etc" \ && { test "$prefix" = "NONE" || test "$prefix" = "/usr" \ || test "$prefix" = "/usr/" ; } ; then if test "$( (uname -s) )" = "Linux" ; then sysconfdir=/etc fi ( prefix=$ac_default_prefix sysconfdir=`eval echo "$sysconfdir"` AC_MSG_NOTICE([configuration directory is "$sysconfdir".]) AC_MSG_NOTICE([use --sysconfdir to override.]) ) fi dnl work around Linux ldconfig design bug dnl ldconfig will cache libraries in order found in library search dnl order rather than by minor version, so it will happily link against dnl /usr/lib/libgsl.so.0 (which is 0.4.0) when dnl /usr/local/lib/libgsl.so.0 (which is 0.5.0) is available dnl so try to find gsl-config in trusted system path first AC_MSG_NOTICE([-------------------------------------------------------------]) AC_MSG_NOTICE([If you have multiple versions of GSL installed, this]) AC_MSG_NOTICE([configure script will prefer the one in /lib or /usr/lib]) AC_MSG_NOTICE([to work around a bug in Linux ldconfig.]) AC_MSG_NOTICE([Deinstall the older GSL version if this behaviour annoys you.]) AC_MSG_NOTICE([-------------------------------------------------------------]) PATH_SAVED="$PATH" PATH=/bin:/usr/bin:$PATH export PATH need_my_gsl=1 AC_ARG_WITH(included-gsl, AS_HELP_STRING([--with-included-gsl],[force use of shipped GSL rather than system GSL]), if test "x$withval" = "xyes" ; then need_my_gsl=2 ; fi) if test "$need_my_gsl" = 1 ; then AM_PATH_GSL(1.4, AC_DEFINE(HAVE_GSL_14,,[Define if you have GNU Scientific Library 1.4 or newer]) need_my_gsl=0) AM_PATH_GSL(1.0, AC_DEFINE(HAVE_GSL_10,,[Define if you have GNU Scientific Library 1.0 or newer]) need_my_gsl=0) fi if test "$need_my_gsl" != 0 ; then GSL_LIBS="libbf_gsl.a" AC_DEFINE(HAVE_GSL_14) AC_DEFINE(HAVE_GSL_10) fi PATH="$PATH_SAVED" AM_CONDITIONAL(NEED_GSL,test $need_my_gsl != 0) AM_CONDITIONAL(NEED_GETOPT,test $ac_cv_func_getopt_long != yes) have_dosish_system=no case "${host}" in *-*-mingw32*) # special stuff for Windoze NT have_dosish_system=yes ;; i?86-emx-os2 | i?86-*-os2*emx ) # OS/2 with the EMX environment have_dosish_system=no ;; i?86-*-msdosdjgpp*) # DOS with the DJGPP environment have_dosish_system=yes ;; *) ;; esac bogofilter_transform=`echo "${program_transform_name}" | sed -e 's,\\\\\\\\,\\\\,g;s,\\\$\\\$,\$,g'` transformed_bogofilter=`echo bogofilter | sed -e "$bogofilter_transform"` transformed_bogoutil=`echo bogoutil | sed -e "$bogofilter_transform"` AC_SUBST(transformed_bogofilter) AC_SUBST(transformed_bogoutil) # Note the \\\\ for backslashes. Autoconf eats one layer, leaving \\ AC_DEFINE(CURDIR_S, ".", [Define name of current directory (C string)]) AC_DEFINE(EXTSEP_S, ".", [Define file extension separator (C string)]) if test "$have_dosish_system" = no; then AC_DEFINE(DIRSEP_C, '/', [Define directory separator (C character)]) AC_DEFINE(DIRSEP_S, "/", [Define directory separator (C string)]) else AC_DEFINE(DIRSEP_C, '\\\\') AC_DEFINE(DIRSEP_S, "\\\\") fi AC_CONFIG_FILES([Makefile \ bogofilter.spec \ trio/Makefile \ doc/Makefile \ src/Makefile \ src/tests/Makefile \ src/bf_compact src/bf_copy src/bf_tar \ ]) AC_OUTPUT AC_MSG_NOTICE([Using these settings:]) AC_MSG_NOTICE([---------------------]) AC_MSG_NOTICE([CPPFLAGS=$CPPFLAGS]) AC_MSG_NOTICE([ CFLAGS=$CFLAGS]) AC_MSG_NOTICE([ LDFLAGS=$LDFLAGS]) AC_MSG_NOTICE([ LIBS=$LIBS]) AC_MSG_NOTICE([ LIBDB=$LIBDB]) AC_MSG_NOTICE([GSL_LIBS=$GSL_LIBS]) AC_MSG_NOTICE([LIBICONV=$LIBICONV]) bogofilter-1.2.4/m4/0000755000175000017500000000000012164443242012360 5ustar sezsezbogofilter-1.2.4/m4/lib-link.m40000644000175000017500000005534312163572264014343 0ustar sezsez# lib-link.m4 serial 4 (gettext-0.12) dnl Copyright (C) 2001-2003 Free Software Foundation, Inc. dnl This file is free software, distributed under the terms of the GNU dnl General Public License. As a special exception to the GNU General dnl Public License, this file may be distributed as part of a program dnl that contains a configuration script generated by Autoconf, under dnl the same distribution terms as the rest of that program. dnl From Bruno Haible. dnl AC_LIB_LINKFLAGS(name [, dependencies]) searches for libname and dnl the libraries corresponding to explicit and implicit dependencies. dnl Sets and AC_SUBSTs the LIB${NAME} and LTLIB${NAME} variables and dnl augments the CPPFLAGS variable. AC_DEFUN([AC_LIB_LINKFLAGS], [ AC_REQUIRE([AC_LIB_PREPARE_PREFIX]) AC_REQUIRE([AC_LIB_RPATH]) define([Name],[translit([$1],[./-], [___])]) define([NAME],[translit([$1],[abcdefghijklmnopqrstuvwxyz./-], [ABCDEFGHIJKLMNOPQRSTUVWXYZ___])]) AC_CACHE_CHECK([how to link with lib[]$1], [ac_cv_lib[]Name[]_libs], [ AC_LIB_LINKFLAGS_BODY([$1], [$2]) ac_cv_lib[]Name[]_libs="$LIB[]NAME" ac_cv_lib[]Name[]_ltlibs="$LTLIB[]NAME" ac_cv_lib[]Name[]_cppflags="$INC[]NAME" ]) LIB[]NAME="$ac_cv_lib[]Name[]_libs" LTLIB[]NAME="$ac_cv_lib[]Name[]_ltlibs" INC[]NAME="$ac_cv_lib[]Name[]_cppflags" AC_LIB_APPENDTOVAR([CPPFLAGS], [$INC]NAME) AC_SUBST([LIB]NAME) AC_SUBST([LTLIB]NAME) dnl Also set HAVE_LIB[]NAME so that AC_LIB_HAVE_LINKFLAGS can reuse the dnl results of this search when this library appears as a dependency. HAVE_LIB[]NAME=yes undefine([Name]) undefine([NAME]) ]) dnl AC_LIB_HAVE_LINKFLAGS(name, dependencies, includes, testcode) dnl searches for libname and the libraries corresponding to explicit and dnl implicit dependencies, together with the specified include files and dnl the ability to compile and link the specified testcode. If found, it dnl sets and AC_SUBSTs HAVE_LIB${NAME}=yes and the LIB${NAME} and dnl LTLIB${NAME} variables and augments the CPPFLAGS variable, and dnl #defines HAVE_LIB${NAME} to 1. Otherwise, it sets and AC_SUBSTs dnl HAVE_LIB${NAME}=no and LIB${NAME} and LTLIB${NAME} to empty. AC_DEFUN([AC_LIB_HAVE_LINKFLAGS], [ AC_REQUIRE([AC_LIB_PREPARE_PREFIX]) AC_REQUIRE([AC_LIB_RPATH]) define([Name],[translit([$1],[./-], [___])]) define([NAME],[translit([$1],[abcdefghijklmnopqrstuvwxyz./-], [ABCDEFGHIJKLMNOPQRSTUVWXYZ___])]) dnl Search for lib[]Name and define LIB[]NAME, LTLIB[]NAME and INC[]NAME dnl accordingly. AC_LIB_LINKFLAGS_BODY([$1], [$2]) dnl Add $INC[]NAME to CPPFLAGS before performing the following checks, dnl because if the user has installed lib[]Name and not disabled its use dnl via --without-lib[]Name-prefix, he wants to use it. ac_save_CPPFLAGS="$CPPFLAGS" AC_LIB_APPENDTOVAR([CPPFLAGS], [$INC]NAME) AC_CACHE_CHECK([for lib[]$1], [ac_cv_lib[]Name], [ ac_save_LIBS="$LIBS" LIBS="$LIBS $LIB[]NAME" AC_TRY_LINK([$3], [$4], [ac_cv_lib[]Name=yes], [ac_cv_lib[]Name=no]) LIBS="$ac_save_LIBS" ]) if test "$ac_cv_lib[]Name" = yes; then HAVE_LIB[]NAME=yes AC_DEFINE([HAVE_LIB]NAME, 1, [Define if you have the $1 library.]) AC_MSG_CHECKING([how to link with lib[]$1]) AC_MSG_RESULT([$LIB[]NAME]) else HAVE_LIB[]NAME=no dnl If $LIB[]NAME didn't lead to a usable library, we don't need dnl $INC[]NAME either. CPPFLAGS="$ac_save_CPPFLAGS" LIB[]NAME= LTLIB[]NAME= fi AC_SUBST([HAVE_LIB]NAME) AC_SUBST([LIB]NAME) AC_SUBST([LTLIB]NAME) undefine([Name]) undefine([NAME]) ]) dnl Determine the platform dependent parameters needed to use rpath: dnl libext, shlibext, hardcode_libdir_flag_spec, hardcode_libdir_separator, dnl hardcode_direct, hardcode_minus_L. AC_DEFUN([AC_LIB_RPATH], [ AC_REQUIRE([AC_PROG_CC]) dnl we use $CC, $GCC, $LDFLAGS AC_REQUIRE([AC_LIB_PROG_LD]) dnl we use $LD, $with_gnu_ld AC_REQUIRE([AC_CANONICAL_HOST]) dnl we use $host AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT]) dnl we use $ac_aux_dir AC_CACHE_CHECK([for shared library run path origin], acl_cv_rpath, [ CC="$CC" GCC="$GCC" LDFLAGS="$LDFLAGS" LD="$LD" with_gnu_ld="$with_gnu_ld" \ ${CONFIG_SHELL-/bin/sh} "$ac_aux_dir/config.rpath" "$host" > conftest.sh . ./conftest.sh rm -f ./conftest.sh acl_cv_rpath=done ]) wl="$acl_cv_wl" libext="$acl_cv_libext" shlibext="$acl_cv_shlibext" hardcode_libdir_flag_spec="$acl_cv_hardcode_libdir_flag_spec" hardcode_libdir_separator="$acl_cv_hardcode_libdir_separator" hardcode_direct="$acl_cv_hardcode_direct" hardcode_minus_L="$acl_cv_hardcode_minus_L" dnl Determine whether the user wants rpath handling at all. AC_ARG_ENABLE(rpath, [ --disable-rpath do not hardcode runtime library paths], :, enable_rpath=yes) ]) dnl AC_LIB_LINKFLAGS_BODY(name [, dependencies]) searches for libname and dnl the libraries corresponding to explicit and implicit dependencies. dnl Sets the LIB${NAME}, LTLIB${NAME} and INC${NAME} variables. AC_DEFUN([AC_LIB_LINKFLAGS_BODY], [ define([NAME],[translit([$1],[abcdefghijklmnopqrstuvwxyz./-], [ABCDEFGHIJKLMNOPQRSTUVWXYZ___])]) dnl By default, look in $includedir and $libdir. use_additional=yes AC_LIB_WITH_FINAL_PREFIX([ eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" ]) AC_LIB_ARG_WITH([lib$1-prefix], [ --with-lib$1-prefix[=DIR] search for lib$1 in DIR/include and DIR/lib --without-lib$1-prefix don't search for lib$1 in includedir and libdir], [ if test "X$withval" = "Xno"; then use_additional=no else if test "X$withval" = "X"; then AC_LIB_WITH_FINAL_PREFIX([ eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" ]) else additional_includedir="$withval/include" additional_libdir="$withval/lib" fi fi ]) dnl Search the library and its dependencies in $additional_libdir and dnl $LDFLAGS. Using breadth-first-seach. LIB[]NAME= LTLIB[]NAME= INC[]NAME= rpathdirs= ltrpathdirs= names_already_handled= names_next_round='$1 $2' while test -n "$names_next_round"; do names_this_round="$names_next_round" names_next_round= for name in $names_this_round; do already_handled= for n in $names_already_handled; do if test "$n" = "$name"; then already_handled=yes break fi done if test -z "$already_handled"; then names_already_handled="$names_already_handled $name" dnl See if it was already located by an earlier AC_LIB_LINKFLAGS dnl or AC_LIB_HAVE_LINKFLAGS call. uppername=`echo "$name" | sed -e 'y|abcdefghijklmnopqrstuvwxyz./-|ABCDEFGHIJKLMNOPQRSTUVWXYZ___|'` eval value=\"\$HAVE_LIB$uppername\" if test -n "$value"; then if test "$value" = yes; then eval value=\"\$LIB$uppername\" test -z "$value" || LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$value" eval value=\"\$LTLIB$uppername\" test -z "$value" || LTLIB[]NAME="${LTLIB[]NAME}${LTLIB[]NAME:+ }$value" else dnl An earlier call to AC_LIB_HAVE_LINKFLAGS has determined dnl that this library doesn't exist. So just drop it. : fi else dnl Search the library lib$name in $additional_libdir and $LDFLAGS dnl and the already constructed $LIBNAME/$LTLIBNAME. found_dir= found_la= found_so= found_a= if test $use_additional = yes; then if test -n "$shlibext" && test -f "$additional_libdir/lib$name.$shlibext"; then found_dir="$additional_libdir" found_so="$additional_libdir/lib$name.$shlibext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi else if test -f "$additional_libdir/lib$name.$libext"; then found_dir="$additional_libdir" found_a="$additional_libdir/lib$name.$libext" if test -f "$additional_libdir/lib$name.la"; then found_la="$additional_libdir/lib$name.la" fi fi fi fi if test "X$found_dir" = "X"; then for x in $LDFLAGS $LTLIB[]NAME; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) case "$x" in -L*) dir=`echo "X$x" | sed -e 's/^X-L//'` if test -n "$shlibext" && test -f "$dir/lib$name.$shlibext"; then found_dir="$dir" found_so="$dir/lib$name.$shlibext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi else if test -f "$dir/lib$name.$libext"; then found_dir="$dir" found_a="$dir/lib$name.$libext" if test -f "$dir/lib$name.la"; then found_la="$dir/lib$name.la" fi fi fi ;; esac if test "X$found_dir" != "X"; then break fi done fi if test "X$found_dir" != "X"; then dnl Found the library. LTLIB[]NAME="${LTLIB[]NAME}${LTLIB[]NAME:+ }-L$found_dir -l$name" if test "X$found_so" != "X"; then dnl Linking with a shared library. We attempt to hardcode its dnl directory into the executable's runpath, unless it's the dnl standard /usr/lib. if test "$enable_rpath" = no || test "X$found_dir" = "X/usr/lib"; then dnl No hardcoding is needed. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$found_so" else dnl Use an explicit option to hardcode DIR into the resulting dnl binary. dnl Potentially add DIR to ltrpathdirs. dnl The ltrpathdirs will be appended to $LTLIBNAME at the end. haveit= for x in $ltrpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $found_dir" fi dnl The hardcoding into $LIBNAME is system dependent. if test "$hardcode_direct" = yes; then dnl Using DIR/libNAME.so during linking hardcodes DIR into the dnl resulting binary. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$found_so" else if test -n "$hardcode_libdir_flag_spec" && test "$hardcode_minus_L" = no; then dnl Use an explicit option to hardcode DIR into the resulting dnl binary. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$found_so" dnl Potentially add DIR to rpathdirs. dnl The rpathdirs will be appended to $LIBNAME at the end. haveit= for x in $rpathdirs; do if test "X$x" = "X$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $found_dir" fi else dnl Rely on "-L$found_dir". dnl But don't add it if it's already contained in the LDFLAGS dnl or the already constructed $LIBNAME haveit= for x in $LDFLAGS $LIB[]NAME; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) if test "X$x" = "X-L$found_dir"; then haveit=yes break fi done if test -z "$haveit"; then LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }-L$found_dir" fi if test "$hardcode_minus_L" != no; then dnl FIXME: Not sure whether we should use dnl "-L$found_dir -l$name" or "-L$found_dir $found_so" dnl here. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$found_so" else dnl We cannot use $hardcode_runpath_var and LD_RUN_PATH dnl here, because this doesn't fit in flags passed to the dnl compiler. So give up. No hardcoding. This affects only dnl very old systems. dnl FIXME: Not sure whether we should use dnl "-L$found_dir -l$name" or "-L$found_dir $found_so" dnl here. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }-l$name" fi fi fi fi else if test "X$found_a" != "X"; then dnl Linking with a static library. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$found_a" else dnl We shouldn't come here, but anyway it's good to have a dnl fallback. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }-L$found_dir -l$name" fi fi dnl Assume the include files are nearby. additional_includedir= case "$found_dir" in */lib | */lib/) basedir=`echo "X$found_dir" | sed -e 's,^X,,' -e 's,/lib/*$,,'` additional_includedir="$basedir/include" ;; esac if test "X$additional_includedir" != "X"; then dnl Potentially add $additional_includedir to $INCNAME. dnl But don't add it dnl 1. if it's the standard /usr/include, dnl 2. if it's /usr/local/include and we are using GCC on Linux, dnl 3. if it's already present in $CPPFLAGS or the already dnl constructed $INCNAME, dnl 4. if it doesn't exist as a directory. if test "X$additional_includedir" != "X/usr/include"; then haveit= if test "X$additional_includedir" = "X/usr/local/include"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then for x in $CPPFLAGS $INC[]NAME; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) if test "X$x" = "X-I$additional_includedir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_includedir"; then dnl Really add $additional_includedir to $INCNAME. INC[]NAME="${INC[]NAME}${INC[]NAME:+ }-I$additional_includedir" fi fi fi fi fi dnl Look for dependencies. if test -n "$found_la"; then dnl Read the .la file. It defines the variables dnl dlname, library_names, old_library, dependency_libs, current, dnl age, revision, installed, dlopen, dlpreopen, libdir. save_libdir="$libdir" case "$found_la" in */* | *\\*) . "$found_la" ;; *) . "./$found_la" ;; esac libdir="$save_libdir" dnl We use only dependency_libs. for dep in $dependency_libs; do case "$dep" in -L*) additional_libdir=`echo "X$dep" | sed -e 's/^X-L//'` dnl Potentially add $additional_libdir to $LIBNAME and $LTLIBNAME. dnl But don't add it dnl 1. if it's the standard /usr/lib, dnl 2. if it's /usr/local/lib and we are using GCC on Linux, dnl 3. if it's already present in $LDFLAGS or the already dnl constructed $LIBNAME, dnl 4. if it doesn't exist as a directory. if test "X$additional_libdir" != "X/usr/lib"; then haveit= if test "X$additional_libdir" = "X/usr/local/lib"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then haveit= for x in $LDFLAGS $LIB[]NAME; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then dnl Really add $additional_libdir to $LIBNAME. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }-L$additional_libdir" fi fi haveit= for x in $LDFLAGS $LTLIB[]NAME; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test -d "$additional_libdir"; then dnl Really add $additional_libdir to $LTLIBNAME. LTLIB[]NAME="${LTLIB[]NAME}${LTLIB[]NAME:+ }-L$additional_libdir" fi fi fi fi ;; -R*) dir=`echo "X$dep" | sed -e 's/^X-R//'` if test "$enable_rpath" != no; then dnl Potentially add DIR to rpathdirs. dnl The rpathdirs will be appended to $LIBNAME at the end. haveit= for x in $rpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then rpathdirs="$rpathdirs $dir" fi dnl Potentially add DIR to ltrpathdirs. dnl The ltrpathdirs will be appended to $LTLIBNAME at the end. haveit= for x in $ltrpathdirs; do if test "X$x" = "X$dir"; then haveit=yes break fi done if test -z "$haveit"; then ltrpathdirs="$ltrpathdirs $dir" fi fi ;; -l*) dnl Handle this in the next round. names_next_round="$names_next_round "`echo "X$dep" | sed -e 's/^X-l//'` ;; *.la) dnl Handle this in the next round. Throw away the .la's dnl directory; it is already contained in a preceding -L dnl option. names_next_round="$names_next_round "`echo "X$dep" | sed -e 's,^X.*/,,' -e 's,^lib,,' -e 's,\.la$,,'` ;; *) dnl Most likely an immediate library name. LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$dep" LTLIB[]NAME="${LTLIB[]NAME}${LTLIB[]NAME:+ }$dep" ;; esac done fi else dnl Didn't find the library; assume it is in the system directories dnl known to the linker and runtime loader. (All the system dnl directories known to the linker should also be known to the dnl runtime loader, otherwise the system is severely misconfigured.) LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }-l$name" LTLIB[]NAME="${LTLIB[]NAME}${LTLIB[]NAME:+ }-l$name" fi fi fi done done if test "X$rpathdirs" != "X"; then if test -n "$hardcode_libdir_separator"; then dnl Weird platform: only the last -rpath option counts, the user must dnl pass all path elements in one option. We can arrange that for a dnl single library, but not when more than one $LIBNAMEs are used. alldirs= for found_dir in $rpathdirs; do alldirs="${alldirs}${alldirs:+$hardcode_libdir_separator}$found_dir" done dnl Note: hardcode_libdir_flag_spec uses $libdir and $wl. acl_save_libdir="$libdir" libdir="$alldirs" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$flag" else dnl The -rpath options are cumulative. for found_dir in $rpathdirs; do acl_save_libdir="$libdir" libdir="$found_dir" eval flag=\"$hardcode_libdir_flag_spec\" libdir="$acl_save_libdir" LIB[]NAME="${LIB[]NAME}${LIB[]NAME:+ }$flag" done fi fi if test "X$ltrpathdirs" != "X"; then dnl When using libtool, the option that works for both libraries and dnl executables is -R. The -R options are cumulative. for found_dir in $ltrpathdirs; do LTLIB[]NAME="${LTLIB[]NAME}${LTLIB[]NAME:+ }-R$found_dir" done fi ]) dnl AC_LIB_APPENDTOVAR(VAR, CONTENTS) appends the elements of CONTENTS to VAR, dnl unless already present in VAR. dnl Works only for CPPFLAGS, not for LIB* variables because that sometimes dnl contains two or three consecutive elements that belong together. AC_DEFUN([AC_LIB_APPENDTOVAR], [ for element in [$2]; do haveit= for x in $[$1]; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) if test "X$x" = "X$element"; then haveit=yes break fi done if test -z "$haveit"; then [$1]="${[$1]}${[$1]:+ }$element" fi done ]) bogofilter-1.2.4/m4/lib-prefix.m40000644000175000017500000001250712163572264014676 0ustar sezsez# lib-prefix.m4 serial 3 (gettext-0.13) dnl Copyright (C) 2001-2003 Free Software Foundation, Inc. dnl This file is free software, distributed under the terms of the GNU dnl General Public License. As a special exception to the GNU General dnl Public License, this file may be distributed as part of a program dnl that contains a configuration script generated by Autoconf, under dnl the same distribution terms as the rest of that program. dnl From Bruno Haible. dnl AC_LIB_ARG_WITH is synonymous to AC_ARG_WITH in autoconf-2.13, and dnl similar to AC_ARG_WITH in autoconf 2.52...2.57 except that is doesn't dnl require excessive bracketing. ifdef([AC_HELP_STRING], [AC_DEFUN([AC_LIB_ARG_WITH], [AC_ARG_WITH([$1],[[$2]],[$3],[$4])])], [AC_DEFUN([AC_][LIB_ARG_WITH], [AC_ARG_WITH([$1],[$2],[$3],[$4])])]) dnl AC_LIB_PREFIX adds to the CPPFLAGS and LDFLAGS the flags that are needed dnl to access previously installed libraries. The basic assumption is that dnl a user will want packages to use other packages he previously installed dnl with the same --prefix option. dnl This macro is not needed if only AC_LIB_LINKFLAGS is used to locate dnl libraries, but is otherwise very convenient. AC_DEFUN([AC_LIB_PREFIX], [ AC_BEFORE([$0], [AC_LIB_LINKFLAGS]) AC_REQUIRE([AC_PROG_CC]) AC_REQUIRE([AC_CANONICAL_HOST]) AC_REQUIRE([AC_LIB_PREPARE_PREFIX]) dnl By default, look in $includedir and $libdir. use_additional=yes AC_LIB_WITH_FINAL_PREFIX([ eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" ]) AC_LIB_ARG_WITH([lib-prefix], [ --with-lib-prefix[=DIR] search for libraries in DIR/include and DIR/lib --without-lib-prefix don't search for libraries in includedir and libdir], [ if test "X$withval" = "Xno"; then use_additional=no else if test "X$withval" = "X"; then AC_LIB_WITH_FINAL_PREFIX([ eval additional_includedir=\"$includedir\" eval additional_libdir=\"$libdir\" ]) else additional_includedir="$withval/include" additional_libdir="$withval/lib" fi fi ]) if test $use_additional = yes; then dnl Potentially add $additional_includedir to $CPPFLAGS. dnl But don't add it dnl 1. if it's the standard /usr/include, dnl 2. if it's already present in $CPPFLAGS, dnl 3. if it's /usr/local/include and we are using GCC on Linux, dnl 4. if it doesn't exist as a directory. if test "X$additional_includedir" != "X/usr/include"; then haveit= for x in $CPPFLAGS; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) if test "X$x" = "X-I$additional_includedir"; then haveit=yes break fi done if test -z "$haveit"; then if test "X$additional_includedir" = "X/usr/local/include"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then if test -d "$additional_includedir"; then dnl Really add $additional_includedir to $CPPFLAGS. CPPFLAGS="${CPPFLAGS}${CPPFLAGS:+ }-I$additional_includedir" fi fi fi fi dnl Potentially add $additional_libdir to $LDFLAGS. dnl But don't add it dnl 1. if it's the standard /usr/lib, dnl 2. if it's already present in $LDFLAGS, dnl 3. if it's /usr/local/lib and we are using GCC on Linux, dnl 4. if it doesn't exist as a directory. if test "X$additional_libdir" != "X/usr/lib"; then haveit= for x in $LDFLAGS; do AC_LIB_WITH_FINAL_PREFIX([eval x=\"$x\"]) if test "X$x" = "X-L$additional_libdir"; then haveit=yes break fi done if test -z "$haveit"; then if test "X$additional_libdir" = "X/usr/local/lib"; then if test -n "$GCC"; then case $host_os in linux*) haveit=yes;; esac fi fi if test -z "$haveit"; then if test -d "$additional_libdir"; then dnl Really add $additional_libdir to $LDFLAGS. LDFLAGS="${LDFLAGS}${LDFLAGS:+ }-L$additional_libdir" fi fi fi fi fi ]) dnl AC_LIB_PREPARE_PREFIX creates variables acl_final_prefix, dnl acl_final_exec_prefix, containing the values to which $prefix and dnl $exec_prefix will expand at the end of the configure script. AC_DEFUN([AC_LIB_PREPARE_PREFIX], [ dnl Unfortunately, prefix and exec_prefix get only finally determined dnl at the end of configure. if test "X$prefix" = "XNONE"; then acl_final_prefix="$ac_default_prefix" else acl_final_prefix="$prefix" fi if test "X$exec_prefix" = "XNONE"; then acl_final_exec_prefix='${prefix}' else acl_final_exec_prefix="$exec_prefix" fi acl_save_prefix="$prefix" prefix="$acl_final_prefix" eval acl_final_exec_prefix=\"$acl_final_exec_prefix\" prefix="$acl_save_prefix" ]) dnl AC_LIB_WITH_FINAL_PREFIX([statement]) evaluates statement, with the dnl variables prefix and exec_prefix bound to the values they will have dnl at the end of the configure script. AC_DEFUN([AC_LIB_WITH_FINAL_PREFIX], [ acl_save_prefix="$prefix" prefix="$acl_final_prefix" acl_save_exec_prefix="$exec_prefix" exec_prefix="$acl_final_exec_prefix" $1 exec_prefix="$acl_save_exec_prefix" prefix="$acl_save_prefix" ]) bogofilter-1.2.4/m4/iconv.m40000644000175000017500000000706712163572264013760 0ustar sezsez# iconv.m4 serial AM4 (gettext-0.11.3) dnl Copyright (C) 2000-2002 Free Software Foundation, Inc. dnl This file is free software, distributed under the terms of the GNU dnl General Public License. As a special exception to the GNU General dnl Public License, this file may be distributed as part of a program dnl that contains a configuration script generated by Autoconf, under dnl the same distribution terms as the rest of that program. dnl From Bruno Haible. AC_DEFUN([AM_ICONV_LINKFLAGS_BODY], [ dnl Prerequisites of AC_LIB_LINKFLAGS_BODY. AC_REQUIRE([AC_LIB_PREPARE_PREFIX]) AC_REQUIRE([AC_LIB_RPATH]) dnl Search for libiconv and define LIBICONV, LTLIBICONV and INCICONV dnl accordingly. AC_LIB_LINKFLAGS_BODY([iconv]) ]) AC_DEFUN([AM_ICONV_LINK], [ dnl Some systems have iconv in libc, some have it in libiconv (OSF/1 and dnl those with the standalone portable GNU libiconv installed). dnl Search for libiconv and define LIBICONV, LTLIBICONV and INCICONV dnl accordingly. AC_REQUIRE([AM_ICONV_LINKFLAGS_BODY]) dnl Add $INCICONV to CPPFLAGS before performing the following checks, dnl because if the user has installed libiconv and not disabled its use dnl via --without-libiconv-prefix, he wants to use it. The first dnl AC_LINK_IFELSE([AC_LANG_PROGRAM([[]], [[]])],[],[]) will then fail, the second AC_LINK_IFELSE([AC_LANG_PROGRAM([[]], [[]])],[],[]) will succeed. am_save_CPPFLAGS="$CPPFLAGS" AC_LIB_APPENDTOVAR([CPPFLAGS], [$INCICONV]) AC_CACHE_CHECK(for iconv, am_cv_func_iconv, [ am_cv_func_iconv="no, consider installing GNU libiconv" am_cv_lib_iconv=no AC_LINK_IFELSE([AC_LANG_PROGRAM([[#include #include ]], [[iconv_t cd = iconv_open("",""); iconv(cd,NULL,NULL,NULL,NULL); iconv_close(cd);]])],[am_cv_func_iconv=yes],[]) if test "$am_cv_func_iconv" != yes; then am_save_LIBS="$LIBS" LIBS="$LIBS $LIBICONV" AC_LINK_IFELSE([AC_LANG_PROGRAM([[#include #include ]], [[iconv_t cd = iconv_open("",""); iconv(cd,NULL,NULL,NULL,NULL); iconv_close(cd);]])],[am_cv_lib_iconv=yes am_cv_func_iconv=yes],[]) LIBS="$am_save_LIBS" fi ]) if test "$am_cv_func_iconv" = yes; then AC_DEFINE(HAVE_ICONV, 1, [Define if you have the iconv() function.]) fi if test "$am_cv_lib_iconv" = yes; then AC_MSG_CHECKING([how to link with libiconv]) AC_MSG_RESULT([$LIBICONV]) else dnl If $LIBICONV didn't lead to a usable library, we don't need $INCICONV dnl either. CPPFLAGS="$am_save_CPPFLAGS" LIBICONV= LTLIBICONV= fi AC_SUBST(LIBICONV) AC_SUBST(LTLIBICONV) ]) AC_DEFUN([AM_ICONV], [ AM_ICONV_LINK if test "$am_cv_func_iconv" = yes; then AC_MSG_CHECKING([for iconv declaration]) AC_CACHE_VAL(am_cv_proto_iconv, [ AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[ #include #include extern #ifdef __cplusplus "C" #endif #if defined(__STDC__) || defined(__cplusplus) size_t iconv (iconv_t cd, char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft); #else size_t iconv(); #endif ]], [[]])],[am_cv_proto_iconv_arg1=""],[am_cv_proto_iconv_arg1="const"]) am_cv_proto_iconv="extern size_t iconv (iconv_t cd, $am_cv_proto_iconv_arg1 char * *inbuf, size_t *inbytesleft, char * *outbuf, size_t *outbytesleft);"]) am_cv_proto_iconv=`echo "[$]am_cv_proto_iconv" | tr -s ' ' | sed -e 's/( /(/'` AC_MSG_RESULT([$]{ac_t:- }[$]am_cv_proto_iconv) AC_DEFINE_UNQUOTED(ICONV_CONST, $am_cv_proto_iconv_arg1, [Define as const if the declaration of iconv() needs const.]) fi ]) bogofilter-1.2.4/m4/lib-ld.m40000644000175000017500000000675612163572264014011 0ustar sezsez# lib-ld.m4 serial 3 (gettext-0.13) dnl Copyright (C) 1996-2003 Free Software Foundation, Inc. dnl This file is free software, distributed under the terms of the GNU dnl General Public License. As a special exception to the GNU General dnl Public License, this file may be distributed as part of a program dnl that contains a configuration script generated by Autoconf, under dnl the same distribution terms as the rest of that program. dnl Subroutines of libtool.m4, dnl with replacements s/AC_/AC_LIB/ and s/lt_cv/acl_cv/ to avoid collision dnl with libtool.m4. dnl From libtool-1.4. Sets the variable with_gnu_ld to yes or no. AC_DEFUN([AC_LIB_PROG_LD_GNU], [AC_CACHE_CHECK([if the linker ($LD) is GNU ld], acl_cv_prog_gnu_ld, [# I'd rather use --version here, but apparently some GNU ld's only accept -v. case `$LD -v 2>&1 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 ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by GCC]) 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. [[\\/]* | [A-Za-z]:[\\/]*)] [re_direlt='/[^/][^/]*/\.\./'] # Canonicalize the path of ld ac_prog=`echo $ac_prog| sed 's%\\\\%/%g'` while echo $ac_prog | grep "$re_direlt" > /dev/null 2>&1; do ac_prog=`echo $ac_prog| sed "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(acl_cv_path_LD, [if test -z "$LD"; then IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}${PATH_SEPARATOR-:}" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then acl_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 `"$acl_cv_path_LD" -v 2>&1 < /dev/null` in *GNU* | *'with BFD'*) test "$with_gnu_ld" != no && break ;; *) test "$with_gnu_ld" != yes && break ;; esac fi done IFS="$ac_save_ifs" else acl_cv_path_LD="$LD" # Let the user override the test with a path. fi]) LD="$acl_cv_path_LD" if test -n "$LD"; then AC_MSG_RESULT($LD) else AC_MSG_RESULT(no) fi test -z "$LD" && AC_MSG_ERROR([no acceptable ld found in \$PATH]) AC_LIB_PROG_LD_GNU ]) bogofilter-1.2.4/m4/gsl.m40000644000175000017500000001135012163572264013415 0ustar sezsezdnl -*- Autoconf -*- # Configure path for the GNU Scientific Library # Christopher R. Gabriel , April 2000 # Modified by Matthias Andree, 2003 AC_DEFUN([AM_PATH_GSL], [ AC_ARG_WITH(gsl-prefix,[ --with-gsl-prefix=PFX Prefix where GSL is installed (optional)], gsl_prefix="$withval", gsl_prefix="") AC_ARG_WITH(gsl-exec-prefix,[ --with-gsl-exec-prefix=PFX Exec prefix where GSL is installed (optional)], gsl_exec_prefix="$withval", gsl_exec_prefix="") AC_ARG_ENABLE(gsltest, [ --disable-gsltest Do not try to compile and run a test GSL program], , enable_gsltest=yes) if test "x${GSL_CONFIG+set}" != xset ; then if test "x$gsl_prefix" != x ; then GSL_CONFIG="$gsl_prefix/bin/gsl-config" fi if test "x$gsl_exec_prefix" != x ; then GSL_CONFIG="$gsl_exec_prefix/bin/gsl-config" fi fi AC_PATH_PROG(GSL_CONFIG, gsl-config, no) min_gsl_version=ifelse([$1], ,0.2.5,$1) AC_MSG_CHECKING(for GSL - version >= $min_gsl_version) no_gsl="" if test "$GSL_CONFIG" = "no" ; then no_gsl=yes else GSL_CFLAGS=`$GSL_CONFIG --cflags` GSL_LIBS=`$GSL_CONFIG --libs` gsl_major_version=`$GSL_CONFIG --version | \ sed 's/^\([[0-9]]*\).*/\1/'` if test "x${gsl_major_version}" = "x" ; then gsl_major_version=0 fi gsl_minor_version=`$GSL_CONFIG --version | \ sed 's/^\([[0-9]]*\)\.\{0,1\}\([[0-9]]*\).*/\2/'` if test "x${gsl_minor_version}" = "x" ; then gsl_minor_version=0 fi gsl_micro_version=`$GSL_CONFIG --version | \ sed 's/^\([[0-9]]*\)\.\{0,1\}\([[0-9]]*\)\.\{0,1\}\([[0-9]]*\).*/\3/'` if test "x${gsl_micro_version}" = "x" ; then gsl_micro_version=0 fi if test "x$enable_gsltest" = "xyes" ; then ac_save_CFLAGS="$CFLAGS" ac_save_LIBS="$LIBS" CFLAGS="$CFLAGS $GSL_CFLAGS" LIBS="$LIBS $GSL_LIBS" rm -f conf.gsltest AC_RUN_IFELSE([AC_LANG_SOURCE([[ #include #include #include char* my_strdup (const char *str); char* my_strdup (const char *str) { char *new_str; if (str) { new_str = (char *)malloc ((strlen (str) + 1) * sizeof(char)); strcpy (new_str, str); } else new_str = NULL; return new_str; } int main (void) { int major = 0, minor = 0, micro = 0; int n; char *tmp_version; system ("touch conf.gsltest"); /* HP/UX 9 (%@#!) writes to sscanf strings */ tmp_version = my_strdup("$min_gsl_version"); n = sscanf(tmp_version, "%d.%d.%d", &major, &minor, µ) ; if (n != 2 && n != 3) { printf("%s, bad version string\n", "$min_gsl_version"); exit(1); } if (($gsl_major_version > major) || (($gsl_major_version == major) && ($gsl_minor_version > minor)) || (($gsl_major_version == major) && ($gsl_minor_version == minor) && ($gsl_micro_version >= micro))) { exit(0); } else { exit(1); } } ]])],[],[no_gsl=yes],[echo $ac_n "cross compiling; assumed OK... $ac_c"]) CFLAGS="$ac_save_CFLAGS" LIBS="$ac_save_LIBS" fi fi if test "x$no_gsl" = x ; then AC_MSG_RESULT(yes) ifelse([$2], , :, [$2]) else AC_MSG_RESULT(no) if test "$GSL_CONFIG" != "no" ; then if test -f conf.gsltest ; then : else echo "*** Could not run GSL test program, checking why..." CFLAGS="$CFLAGS $GSL_CFLAGS" LIBS="$LIBS $GSL_LIBS" AC_LINK_IFELSE([AC_LANG_PROGRAM([[ #include ]], [[ return 0; ]])],[ echo "*** The test program compiled, but did not run. This usually means" echo "*** that the run-time linker is not finding GSL or finding the wrong" echo "*** version of GSL. If it is not finding GSL, you'll need to set your" echo "*** LD_LIBRARY_PATH environment variable, or edit /etc/ld.so.conf to point" echo "*** to the installed location Also, make sure you have run ldconfig if that" echo "*** is required on your system" echo "***" echo "*** If you have an old version installed, it is best to remove it, although" echo "*** you may also be able to get things to work by modifying LD_LIBRARY_PATH"],[ echo "*** The test program failed to compile or link. See the file config.log for the" echo "*** exact error that occured. This usually means GSL was incorrectly installed" echo "*** or that you have moved GSL since it was installed. In the latter case, you" echo "*** may want to edit the gsl-config script: $GSL_CONFIG" ]) CFLAGS="$ac_save_CFLAGS" LIBS="$ac_save_LIBS" fi fi # GSL_CFLAGS="" # GSL_LIBS="" ifelse([$3], , :, [$3]) fi AC_SUBST(GSL_CFLAGS) AC_SUBST(GSL_LIBS) rm -f conf.gsltest ]) bogofilter-1.2.4/m4/stdbool.m40000644000175000017500000001014012163572264014272 0ustar sezsezdnl -*- Autoconf -*- dnl The AC_HEADER_STDBOOL code was taken from autoconf 2.57. dnl dnl It was modified to only define the AC_HEADER_STDBOOL test, dnl which is not present in autoconf 2.54 and older, because dnl many distributions (Red Hat Linux 8.0, SuSE Linux 8.1) still ship dnl autoconf 2.53. dnl -- Matthias Andree # This file is part of Autoconf. -*- Autoconf -*- # Checking for headers. # # Copyright (C) 2000, 2001, 2002 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., 59 Temple Place - Suite 330, Boston, MA # 02111-1307, USA. # # As a special exception, the Free Software Foundation gives unlimited # permission to copy, distribute and modify the configure scripts that # are the output of Autoconf. You need not follow the terms of the GNU # General Public License when using or distributing such scripts, even # though portions of the text of Autoconf appear in them. The GNU # General Public License (GPL) does govern all other use of the material # that constitutes the Autoconf program. # # Certain portions of the Autoconf source text are designed to be copied # (in certain cases, depending on the input) into the output of # Autoconf. We call these the "data" portions. The rest of the Autoconf # source text consists of comments plus executable code that decides which # of the data portions to output in any given case. We call these # comments and executable code the "non-data" portions. Autoconf never # copies any of the non-data portions into its output. # # This special exception to the GPL applies to versions of Autoconf # released by the Free Software Foundation. When you make and # distribute a modified version of Autoconf, you may extend this special # exception to the GPL to apply to your modified version as well, *unless* # your modified version has the potential to copy into its output some # of the text that was the non-data portion of the version that you started # with. (In other words, unless your change moves or copies text from # the non-data portions to the data portions.) If your modification has # such potential, you must delete any notice of this special exception # to the GPL from your modified version. # # Written by David MacKenzie, with help from # François Pinard, Karl Berry, Richard Pixley, Ian Lance Taylor, # Roland McGrath, Noah Friedman, david d zuhn, and many others. AC_DEFUN([AC_HEADER_STDBOOL], [AC_CACHE_CHECK([for stdbool.h that conforms to C99], [ac_cv_header_stdbool_h], [AC_COMPILE_IFELSE([AC_LANG_PROGRAM( [[ #include #ifndef bool # error bool is not defined #endif #ifndef false # error false is not defined #endif #if false # error false is not 0 #endif #ifndef true # error true is not defined #endif #if true != 1 # error true is not 1 #endif #ifndef __bool_true_false_are_defined # error __bool_true_false_are_defined is not defined #endif struct s { _Bool s: 1; _Bool t; } s; char a[true == 1 ? 1 : -1]; char b[false == 0 ? 1 : -1]; char c[__bool_true_false_are_defined == 1 ? 1 : -1]; char d[(bool) -0.5 == true ? 1 : -1]; bool e = &s; char f[(_Bool) -0.0 == false ? 1 : -1]; char g[true]; char h[sizeof (_Bool)]; char i[sizeof s.t]; ]], [[ return !a + !b + !c + !d + !e + !f + !g + !h + !i; ]])], [ac_cv_header_stdbool_h=yes], [ac_cv_header_stdbool_h=no])]) AC_CHECK_TYPES([_Bool]) if test $ac_cv_header_stdbool_h = yes; then AC_DEFINE(HAVE_STDBOOL_H, 1, [Define to 1 if stdbool.h conforms to C99.]) fi ])# AC_HEADER_STDBOOL bogofilter-1.2.4/config.sub0000755000175000017500000010612412145424021014020 0ustar sezsez#! /bin/sh # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, # 2011, 2012, 2013 Free Software Foundation, Inc. timestamp='2013-01-11' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # Please send patches with a ChangeLog entry to config-patches@gnu.org. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \ linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \ knetbsd*-gnu* | netbsd*-gnu* | \ kopensolaris*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; android-linux) os=-linux-android basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray | -microblaze*) os= basic_machine=$1 ;; -bluegene*) os=-cnk ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*178) os=-lynxos178 ;; -lynx*5) os=-lynxos5 ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | aarch64 | aarch64_be \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc \ | arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \ | avr | avr32 \ | be32 | be64 \ | bfin \ | c4x | clipper \ | d10v | d30v | dlx | dsp16xx | dvp \ | epiphany \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | hexagon \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | le32 | le64 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | microblazeel | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipsr5900 | mipsr5900el \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nds32 | nds32le | nds32be \ | nios | nios2 \ | ns16k | ns32k \ | open8 \ | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle \ | pyramid \ | rl78 | rx \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu \ | tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \ | ubicom32 \ | v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \ | we32k \ | x86 | xc16x | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; c54x) basic_machine=tic54x-unknown ;; c55x) basic_machine=tic55x-unknown ;; c6x) basic_machine=tic6x-unknown ;; m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | picochip) basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; strongarm | thumb | xscale) basic_machine=arm-unknown ;; xgate) basic_machine=$basic_machine-unknown os=-none ;; xscaleeb) basic_machine=armeb-unknown ;; xscaleel) basic_machine=armel-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | aarch64-* | aarch64_be-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | be32-* | be64-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* \ | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | hexagon-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | le32-* | le64-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | microblaze-* | microblazeel-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipsr5900-* | mipsr5900el-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nds32-* | nds32le-* | nds32be-* \ | nios-* | nios2-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | open8-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \ | pyramid-* \ | rl78-* | romp-* | rs6000-* | rx-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx?-* \ | tahoe-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tile*-* \ | tron-* \ | ubicom32-* \ | v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \ | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; bluegene*) basic_machine=powerpc-ibm os=-cnk ;; c54x-*) basic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c55x-*) basic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c6x-*) basic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16 | cr16-*) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; microblaze*) basic_machine=microblaze-xilinx ;; mingw64) basic_machine=x86_64-pc os=-mingw64 ;; mingw32) basic_machine=i386-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mipsEE* | ee | ps2) basic_machine=mips64r5900el-scei case $os in -linux*) ;; *) os=-elf ;; esac ;; iop) basic_machine=mipsel-scei os=-irx ;; dvp) basic_machine=dvp-scei os=-elf ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; msys) basic_machine=i386-pc os=-msys ;; mvs) basic_machine=i370-ibm os=-mvs ;; nacl) basic_machine=le32-unknown os=-nacl ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; neo-tandem) basic_machine=neo-tandem ;; nse-tandem) basic_machine=nse-tandem ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc | ppcbe) basic_machine=powerpc-unknown ;; ppc-* | ppcbe-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos | rdos64) basic_machine=x86_64-pc os=-rdos ;; rdos32) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; strongarm-* | thumb-*) basic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'` ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tile*) basic_machine=$basic_machine-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; xscale-* | xscalee[bl]-*) basic_machine=`echo $basic_machine | sed 's/^xscale/arm/'` ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -auroraux) os=-auroraux ;; -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \ | -sym* | -kopensolaris* | -plan9* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -bitrig* | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* \ | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \ | -linux-newlib* | -linux-musl* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* | -irx* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -nacl*) ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; hexagon-*) os=-elf ;; tic54x-*) os=-coff ;; tic55x-*) os=-coff ;; tic6x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -cnk*|-aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: bogofilter-1.2.4/README0000644000175000017500000001455512163572305012734 0ustar sezsez Bogofilter -- fast Bayesian spam filtering # $Id: README 6987 2012-12-30 18:05:33Z m-a $ Summary: 0. Important 1. What is Bogofilter? 2. Documentation 3. Installing Bogofilter 4. How to contribute 5. How to request features 6. Building & Installing Bogofilter from Source Tarball or SVN a. Downloading b. Building & Installing c. Configuring d. Changing Bogofilter 7. License 0. IMPORTANT ------------ If you are using bogofilter with the Berkeley DB data base library (which is the default, received most testing, is the most powerful of the data base engines that bogofilter supports and hence recommended), do read the doc/README.db file, it contains important information. The doc/README.db file contains troubleshooting information and requirements that should be read ahead of time so you can fix problems quickly should they arise later. 1. What is Bogofilter? ---------------------- Bogofilter is a fast Bayesian spam filter along the lines suggested by Paul Graham in his article "A Plan For Spam": http://www.paulgraham.com/spam.html with algorithmic changes suggested by Gary Robinson in: http://radio.weblogs.com/0101454/stories/2002/09/16/spamDetection.html and in "A Statistical Approach to the Spam Problem": http://www.linuxjournal.com/article.php?sid=6467 This version improves on the papers by doing smarter lexical analysis. In particular, hostames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are discarded so as not to bloat the word lists. 2. Documentation ---------------- It is recommended, although not necessary, that you install the GNU Scientific Library (GSL) version 1.4 or newer before configuring bogofilter. This allows bogofilter to link dynamically against a system-wide GSL rather than statically against a shipped GSL subset, conserving memory and disk space. When installed, there are man pages for bogofilter, bogoutil, bogolexer, and bogoupgrade. Additional documentation is in /usr/share/doc/bogofilter-x.y.z or comparable directory (depending on your operating system). If you've installed the source code, the doc directory and its subdirectories contain most of bogofilter's documentation. In it are a variety of README files, the xml originals for the man pages , and other documents. Additionally, many of the directories in the bogofilter hierarchy have their own README files. If you use mutt, see the bogofilter(1) manual page for helpful macros you can add to your .muttrc. 3. Installing Bogofilter ---------------------- When updating, check the RELEASE.NOTES files. For fresh installs, check the rest of this file and the INSTALL file. You can safely ignore any of these compile time warnings: warning: unused parameter ... warning: format not a string literal, argument types not checked 4. How to contribute -------------------- The best way to contribute to bogofilter is through the bogofilter mailing list, bogofilter@bogofilter.org. You can subscribe to it by sending a message to bogofilter-subscribe@bogofilter.org and responding to the confirmation message it sends to you. More information is available on the bogofilter home page at http://bogofilter.sourceforge.net/ Bugs can be reported via the bogfilter mailing list or through http://sourceforge.net/tracker/?atid=499997&group_id=62265&func=browse If you have code to contribute, please post it on the bogofilter mailing list or mail it to David Relson (relson@users.sourceforge.net) 5. How to request features -------------------------- Ask around in the bogofilter mailing list. The idea may have been already suggested, considered, accepted, rejected, ... You won't know until you ask! Alternatively, you might want to hack at the code and develop the feature on your own, which would be great! You can then send a patch to the list. 6. Building & Installing Bogofilter from Source Tarball or SVN -------------------------------------------------------------- a. Downloading -------------- The most recent version of this software is available at: http://sourceforge.net/projects/bogofilter/ The latest stable version can be downloaded. The development source is in a Subversion repository on SourceForge. To download the latest SVN source, cd to the directory to which you wish to download and type the following command: svn checkout http://svn.code.sf.net/p/bogofilter/code/trunk bogofilter b. Building & Installing ------------------------ To compile and install the standard configuration from a tarball, use the following commands: cd bogofilter-1.0.1 [change to project directory] ./configure [add configure options as required] make all check make install [as root] To compile and install the standard configuration from SVN, use the following commands: cd bogofilter [change to project directory] ./autogen.sh [add configure options as required] make install [as root] Be sure to read README.svn for additional preparations required. You will need a full set of development tools installed to be able to run autogen.sh, including recent automake (1.8) and autoconf (2.59). configure does not have these requirements. c. Configuring -------------- After using ./autogen.sh, which builds the standard configuration and runs "make check" to ensure it works in your environment and on your hardware, you might wish to further customize bogofilter for your use. Running "./configure --help" will list all the configuration options. The most notable ones are: --prefix=PREFIX install architecture-independent files in PREFIX [default: /usr/local] --with-database=ENGINE Choose database engine {db|qdbm|sqlite3} [default: db] CPPFLAGS=-I/opt/csw/include Choose additional include file path /opt/csw/include LDFLAGS=-L/opt/csw/lib Ditto, for library files d. Changing Bogofilter ---------------------- If you make modifications to bogofilter, you may need to have a recent DocBook XML tool chain, the xmlto program, PassiveTeX and XMLTeX, recent versions of automake (1.8) and autoconf (2.59). These requirements do not apply if you are building an unmodified tarball. 7. License ---------- Bogofilter is offered under the GNU General Public License, see the COPYING file for details. Note that some parts, especially in the contrib/ section or scripts, may be under a different license. bogofilter-1.2.4/AUTHORS0000644000175000017500000000255112163572272013120 0ustar sezsez# $Id: AUTHORS 6717 2008-04-20 15:34:59Z relson $ This file is in Unicode charset, with UTF-8 encoding. Eric S. Raymond (Initial Version) Adrian Otto (portability code, file locking) Paul Tomblin (bug fixes) David Relson (new features, release coordinator, bug fixes, cleanups) Matthias Andree (bug fixes, improvements, auto tools build environment, cleanups, portability, RPM packaging, sqlite3 and Berkeley DB Transactional support) Gyepi Sam (database abstraction, initial BerkeleyDB support, wordhash, bogoupgrade, bogoutil, documentation, bug fixes, TDB support) Allyn Fratkin (bug fixes, bug database maintainer) Clint Adams (bug fixes, portability, debian packaging) Greg Louis (spamicity calculation methods, tuning) Boris Piwinger (bogominitrain.pl, documentation) Stefan Bellon (SDBM/QDBM drivers (the former has been abandoned), RISC OS port) Contributors: Nick Simicich Michael O'Reilly Fabrice Prigent Yuri Dario Jonathan Kamens Yar Tikhiy Stefan Bellon Evgeny Kotsuba Andras Salamon Martin Gagern Dan Deward Burkhard Kaas Henning Makholm Charles A. Edwards Pablo Rosciani Pavel Kankovsky Ben Finney Bill Wohler Bill McClain Alfons Hoogervorst Ciprian Popovici Yar Tikhiy Daichi Kawahata Torsten Veller Mikhael Zabaluev Tom Anderson Tobias Roppelt Elmar Hoffmann Nicolas Kaiser Björn Knutsson Pimpon Jason A. Smith Marco Bozzolan Paul Mangan Roman Trunov bogofilter-1.2.4/bogofilter.spec.in0000644000175000017500000001316512163572305015465 0ustar sezsez# $Id: bogofilter.spec.in 6431 2006-01-22 03:28:21Z relson $ # This .spec file will not build the static package by default. # To do this, run either of the next rpm[build] commands: # # rpmbuild --define 'bogostatic 1' --sign -bb bogofilter.spec # # To build with SQLite3, use: # # rpmbuild --define 'with_sqlite 1' --sign -bb bogofilter.spec # To build -debuginfo RPMs on systems with RPM 4.2 or newer and recent # elfutils, add # # --define 'debugrpm 1' # # or place %debugrpm 1 into your ~/.rpmmacros file. %define Name @PACKAGE@ %define Version @VERSION@ %define Release 1 %{?bogostatic: %define bogostatic 1} %{!?bogostatic: %define bogostatic 0} %{?with_db42: %define with_db42 1} %{!?with_db42: %define with_db42 0} %{?with_sqlite: %define with_sqlite 1} %{!?with_sqlite: %define with_sqlite 0} %if %{with_db42} %define DBFlag 1 %define DBName -db42 %endif %if %{with_sqlite} %define DBFlag 1 %define DBName -sqlite3 %endif %{!?DBFlag: %define DBFlag 0} %{!?bf_nameext: %define bf_nameext %{nil}} Summary: Fast anti-spam filtering by Bayesian statistical analysis %if ! %{DBFlag} Name: %{Name}%{bf_nameext} %else Name: %{Name}%{DBName}%{bf_nameext} %endif Version: %{Version} Release: %{Release} License: GPL Group: Networking/Mail URL: http://bogofilter.sourceforge.net Source0: %{Name}-%{Version}.tar.gz %define _requires_exceptions perl Buildroot: %{_tmppath}/%{Name}-%{Version}-root Conflicts: %{Name}%{DBName}-static %description Bogofilter is a Bayesian spam filter. In its normal mode of operation, it takes an email message or other text on standard input, does a statistical check against lists of "good" and "bad" words, and returns a status code indicating whether or not the message is spam. Bogofilter is designed with fast algorithms (including Berkeley DB system), coded directly in C, and tuned for speed, so it can be used for production by sites that process a lot of mail. %if %{with_sqlite} This version was built with SQLite3 support. %else This version was built with Berkeley DB support. %endif %package static Summary: Statically linked Group: Networking/Mail Conflicts: %{Name}%{DBName} %description static Statically linked bogofilter, bogolexer, bogoutil, and bogotune. # use the debug_package macro if applicable: %{?debugrpm:%debug_package} %prep %setup -q -n %{Name}-%{Version} CFLAGS="$RPM_OPT_FLAGS" \ ./configure \ --prefix=%{_prefix} \ --mandir=%{_mandir} \ --sysconfdir=%{_sysconfdir} \ %if %{?bogostatic} --enable-static \ %endif %if %{?with_db42} --with-database=db \ %endif %if %{?with_sqlite} --with-database=sqlite3 \ %endif --with-included-gsl %build make make DESTDIR="%{buildroot}" check %clean [ -n "%{buildroot}" -a "%{buildroot}" != / ] && rm -rf %{buildroot} %install [ -n "%{buildroot}" -a "%{buildroot}" != / ] && rm -rf %{buildroot} make DESTDIR=%{buildroot} install cp %{buildroot}%{_sysconfdir}/bogofilter.cf.example \ %{buildroot}%{_sysconfdir}/bogofilter.cf for n in xml html ; do install -d .inst/$n install -m644 doc/*.$n .inst/$n done for n in `find %{buildroot}%{_datadir}/%{name} -type d` ; do chmod o-w $n done for d in contrib ; do install -d %{buildroot}%{_datadir}/%{name}/$d files=$(find "$d" -maxdepth 1 -type f -print) for f in $files ; do case $f in *.c|*.o|*.obj|*/Makefile*) continue ;; *.1) cp -p $f %{buildroot}%{_mandir}/man1 ;; *) cp -p $f %{buildroot}%{_datadir}/%{name}/$d ;; esac done done mv bogogrep* contrib %if %{bogostatic} ( cd %{buildroot}%{_datadir}/%{name} cp -p -r contrib contrib-static rm contrib/bogogrep_static rm contrib-static/bogogrep strip contrib-static/bogogrep_static ) %endif %post %post static for file in bogofilter bogolexer bogoutil bogotune ; do if [ $1 -lt 2 ] ; then ln -s %{_bindir}/${file}_static %{_bindir}/${file} fi done %postun static for file in bogofilter bogolexer bogoutil bogotune ; do if [ $1 -eq 0 ] ; then rm -f %{_bindir}/${file} echo rm -f %{_bindir}/${file} fi done %files %defattr(-,root,root) %doc AUTHORS COPYING INSTALL %doc GETTING.STARTED %doc NEWS README* RELEASE.NOTES TODO %doc doc/bogofilter-tuning.HOWTO.html %doc doc/bogofilter-SA-2002-01 %doc doc/integrating* %doc doc/programmer %doc doc/README.*db doc/rpm.notes.BerkeleyDB %doc .inst/html .inst/xml %{_sysconfdir}/bogofilter.cf.example %config(noreplace) %{_sysconfdir}/bogofilter.cf %{_bindir}/bogofilter %{_bindir}/bogolexer %{_bindir}/bogotune %{_bindir}/bogoutil %{_bindir}/bogoupgrade %{_bindir}/bf_copy %{_bindir}/bf_compact %{_bindir}/bf_tar %{_mandir}/man1/bogofilter.1* %{_mandir}/man1/bogolexer.1* %{_mandir}/man1/bogotune.1* %{_mandir}/man1/bogoutil.1* %{_mandir}/man1/bogoupgrade.1* %{_mandir}/man1/bf_compact.1* %{_mandir}/man1/bf_copy.1* %{_mandir}/man1/bf_tar.1* %{_datadir}/%{name}/contrib/* %if %{bogostatic} %files static %defattr(-,root,root) %doc AUTHORS COPYING INSTALL %doc GETTING.STARTED %doc NEWS README* RELEASE.NOTES TODO %doc doc/bogofilter-tuning.HOWTO.html %doc doc/bogofilter-SA-2002-01 %doc doc/integrating* %doc doc/programmer %doc doc/README.*db doc/rpm.notes.BerkeleyDB %doc .inst/html .inst/xml %{_sysconfdir}/bogofilter.cf.example %config(noreplace) %{_sysconfdir}/bogofilter.cf %{_bindir}/bogofilter_static %{_bindir}/bogolexer_static %{_bindir}/bogotune_static %{_bindir}/bogoutil_static %{_bindir}/bogoupgrade %{_bindir}/bf_copy %{_bindir}/bf_compact %{_bindir}/bf_tar %{_mandir}/man1/bogofilter.1* %{_mandir}/man1/bogolexer.1* %{_mandir}/man1/bogotune.1* %{_mandir}/man1/bogoutil.1* %{_mandir}/man1/bogoupgrade.1* %{_mandir}/man1/bf_compact.1* %{_mandir}/man1/bf_copy.1* %{_mandir}/man1/bf_tar.1* %{_datadir}/%{name}/contrib-static/* %endif %changelog bogofilter-1.2.4/README.svn0000644000175000017500000000171712163572305013535 0ustar sezsezREADME.svn -- How to build bogofilter from Subversion (SVN) $Id: README.svn 6853 2009-08-01 09:18:08Z m-a $ (C) 2002,2007,2009 by Matthias Andree. Freely distributable according to the terms of the GNU Free Documentation License 1.0. No front- or back-matter parts, no invariant parts. ------------------------------------------------------------------------- After you have checked out bogofilter from SVN, some files are missing, for example, configure, ylwrap and others. These files can be created automatically with recent autoconf and automake versions. You will need autoconf 2.60 and automake 1.9 or newer. To recreate these files, run: autoreconf -i -s -f You can optionally add -v to see what autoreconf is doing. Then proceed as usual: ./configure && make && make check and so on. For less verbose output: ./configure --quiet && make -s && make -s check Have fun! ------------------------------------------------------------------------- end of README.svn bogofilter-1.2.4/config.rpath0000755000175000017500000003521312163572264014362 0ustar sezsez#! /bin/sh # Output a system dependent set of variables, describing how to set the # run time search path of shared libraries in an executable. # # Copyright 1996-2003 Free Software Foundation, Inc. # Taken from GNU libtool, 2001 # 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. # # The first argument passed to this file is the canonical host specification, # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # The environment variables CC, GCC, LDFLAGS, LD, with_gnu_ld # should be set by the caller. # # The set of defined variables is at the end of this script. # Known limitations: # - On IRIX 6.5 with CC="cc", the run time search patch must not be longer # than 256 bytes, otherwise the compiler driver will dump core. The only # known workaround is to choose shorter directory names for the build # directory and/or the installation directory. # All known linkers require a `.a' archive for static linking (except M$VC, # which needs '.lib'). libext=a shrext=.so host="$1" host_cpu=`echo "$host" | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` host_vendor=`echo "$host" | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` host_os=`echo "$host" | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` # Code taken from libtool.m4's AC_LIBTOOL_PROG_COMPILER_PIC. wl= if test "$GCC" = yes; then wl='-Wl,' else case "$host_os" in aix*) wl='-Wl,' ;; mingw* | pw32* | os2*) ;; hpux9* | hpux10* | hpux11*) wl='-Wl,' ;; irix5* | irix6* | nonstopux*) wl='-Wl,' ;; newsos6) ;; linux*) case $CC in icc|ecc) wl='-Wl,' ;; ccc) wl='-Wl,' ;; esac ;; osf3* | osf4* | osf5*) wl='-Wl,' ;; sco3.2v5*) ;; solaris*) wl='-Wl,' ;; sunos4*) wl='-Qoption ld ' ;; sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) wl='-Wl,' ;; sysv4*MP*) ;; uts4*) ;; esac fi # Code taken from libtool.m4's AC_LIBTOOL_PROG_LD_SHLIBS. hardcode_libdir_flag_spec= hardcode_libdir_separator= hardcode_direct=no hardcode_minus_L=no 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 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 fi ;; amigaos*) 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 use # them. ld_shlibs=no ;; beos*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then : else ld_shlibs=no fi ;; cygwin* | mingw* | pw32*) # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then : else ld_shlibs=no fi ;; netbsd*) ;; solaris* | sysv5*) if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then ld_shlibs=no elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then : else ld_shlibs=no fi ;; sunos4*) hardcode_direct=yes ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then : else ld_shlibs=no fi ;; esac if test "$ld_shlibs" = yes; then # Unlike libtool, we use -rpath here, not --rpath, since the documented # option of GNU ld is called -rpath, not --rpath. hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' fi else case "$host_os" in aix3*) # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test "$GCC" = yes; 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 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 if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done esac fi hardcode_direct=yes hardcode_libdir_separator=':' if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) 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 hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi esac fi # Begin _LT_AC_SYS_LIBPATH_AIX. echo 'int main () { return 0; }' > conftest.c ${CC} ${LDFLAGS} conftest.c -o conftest aix_libpath=`dump -H conftest 2>/dev/null | sed -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest 2>/dev/null | sed -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` fi if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib" fi rm -f conftest.c conftest # End _LT_AC_SYS_LIBPATH_AIX. if test "$aix_use_runtimelinking" = yes; then hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib' else hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" fi fi ;; amigaos*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes # see comment about different semantics on the GNU ld section ld_shlibs=no ;; bsdi4*) ;; 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=' ' libext=lib ;; darwin* | rhapsody*) if $CC -v 2>&1 | grep 'Apple' >/dev/null ; then hardcode_direct=no fi ;; dgux*) hardcode_libdir_flag_spec='-L$libdir' ;; freebsd1*) ld_shlibs=no ;; freebsd2.2*) hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes ;; freebsd2*) hardcode_direct=yes hardcode_minus_L=yes ;; freebsd*) hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes ;; hpux9*) 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 ;; hpux10* | hpux11*) if test "$with_gnu_ld" = no; then case "$host_cpu" in hppa*64*) hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=no ;; ia64*) hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=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 # 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*) hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; netbsd*) hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes ;; newsos6) hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; openbsd*) hardcode_direct=yes if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then hardcode_libdir_flag_spec='${wl}-rpath,$libdir' else case "$host_os" in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) hardcode_libdir_flag_spec='-R$libdir' ;; *) hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; osf3*) hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) if test "$GCC" = yes; then hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' else # Both cc and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi hardcode_libdir_separator=: ;; sco3.2v5*) ;; solaris*) hardcode_libdir_flag_spec='-R$libdir' ;; sunos4*) hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes ;; sysv4) case $host_vendor in sni) hardcode_direct=yes # is this really true??? ;; siemens) hardcode_direct=no ;; motorola) hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac ;; sysv4.3*) ;; sysv4*MP*) if test -d /usr/nec; then ld_shlibs=yes fi ;; sysv4.2uw2*) hardcode_direct=yes hardcode_minus_L=no ;; sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[78]* | unixware7*) ;; sysv5*) hardcode_libdir_flag_spec= ;; uts4*) hardcode_libdir_flag_spec='-L$libdir' ;; *) ld_shlibs=no ;; esac fi # Check dynamic linker characteristics # Code taken from libtool.m4's AC_LIBTOOL_SYS_DYNAMIC_LINKER. libname_spec='lib$name' case "$host_os" in aix3*) ;; aix4* | aix5*) ;; amigaos*) ;; beos*) ;; bsdi4*) ;; cygwin* | mingw* | pw32*) shrext=.dll ;; darwin* | rhapsody*) shrext=.dylib ;; dgux*) ;; freebsd1*) ;; freebsd*) ;; gnu*) ;; hpux9* | hpux10* | hpux11*) case "$host_cpu" in ia64*) shrext=.so ;; hppa*64*) shrext=.sl ;; *) shrext=.sl ;; esac ;; irix5* | irix6* | nonstopux*) case "$host_os" in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= ;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 ;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 ;; *) libsuff= shlibsuff= ;; esac ;; esac ;; linux*oldld* | linux*aout* | linux*coff*) ;; linux*) ;; netbsd*) ;; newsos6) ;; nto-qnx) ;; openbsd*) ;; os2*) libname_spec='$name' shrext=.dll ;; osf3* | osf4* | osf5*) ;; sco3.2v5*) ;; solaris*) ;; sunos4*) ;; sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) ;; sysv4*MP*) ;; uts4*) ;; esac sed_quote_subst='s/\(["`$\\]\)/\\\1/g' escaped_wl=`echo "X$wl" | sed -e 's/^X//' -e "$sed_quote_subst"` shlibext=`echo "$shrext" | sed -e 's,^\.,,'` escaped_hardcode_libdir_flag_spec=`echo "X$hardcode_libdir_flag_spec" | sed -e 's/^X//' -e "$sed_quote_subst"` sed -e 's/^\([a-zA-Z0-9_]*\)=/acl_cv_\1=/' <. # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # This file is maintained in Automake, please report # bugs to or send patches to # . get_dirname () { case $1 in */*|*\\*) printf '%s\n' "$1" | sed -e 's|\([\\/]\)[^\\/]*$|\1|';; # Otherwise, we want the empty string (not "."). esac } # guard FILE # ---------- # The CPP macro used to guard inclusion of FILE. guard() { printf '%s\n' "$from" \ | sed \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'\ -e 's/[^ABCDEFGHIJKLMNOPQRSTUVWXYZ]/_/g' } # quote_for_sed [STRING] # ---------------------- # Return STRING (or stdin) quoted to be used as a sed pattern. quote_for_sed () { case $# in 0) cat;; 1) printf '%s\n' "$1";; esac \ | sed -e 's|[][\\.*]|\\&|g' } case "$1" in '') echo "$0: No files given. Try '$0 --help' for more information." 1>&2 exit 1 ;; --basedir) basedir=$2 shift 2 ;; -h|--h*) cat <<\EOF Usage: ylwrap [--help|--version] INPUT [OUTPUT DESIRED]... -- PROGRAM [ARGS]... Wrapper for lex/yacc invocations, renaming files as desired. INPUT is the input file OUTPUT is one file PROG generates DESIRED is the file we actually want instead of OUTPUT PROGRAM is program to run ARGS are passed to PROG Any number of OUTPUT,DESIRED pairs may be used. Report bugs to . EOF exit $? ;; -v|--v*) echo "ylwrap $scriptversion" exit $? ;; esac # The input. input="$1" shift # We'll later need for a correct munging of "#line" directives. input_sub_rx=`get_dirname "$input" | quote_for_sed` case "$input" in [\\/]* | ?:[\\/]*) # Absolute path; do nothing. ;; *) # Relative path. Make it absolute. input="`pwd`/$input" ;; esac input_rx=`get_dirname "$input" | quote_for_sed` # Since DOS filename conventions don't allow two dots, # the DOS version of Bison writes out y_tab.c instead of y.tab.c # and y_tab.h instead of y.tab.h. Test to see if this is the case. y_tab_nodot=false if test -f y_tab.c || test -f y_tab.h; then y_tab_nodot=true fi # The parser itself, the first file, is the destination of the .y.c # rule in the Makefile. parser=$1 # A sed program to s/FROM/TO/g for all the FROM/TO so that, for # instance, we rename #include "y.tab.h" into #include "parse.h" # during the conversion from y.tab.c to parse.c. rename_sed= while test "$#" -ne 0; do if test "$1" = "--"; then shift break fi from=$1 # Handle y_tab.c and y_tab.h output by DOS if $y_tab_nodot; then case $from in "y.tab.c") from=y_tab.c;; "y.tab.h") from=y_tab.h;; esac fi shift to=$1 shift rename_sed="${rename_sed}s|"`quote_for_sed "$from"`"|$to|g;" done # The program to run. prog="$1" shift # Make any relative path in $prog absolute. case "$prog" in [\\/]* | ?:[\\/]*) ;; *[\\/]*) prog="`pwd`/$prog" ;; esac # FIXME: add hostname here for parallel makes that run commands on # other machines. But that might take us over the 14-char limit. dirname=ylwrap$$ do_exit="cd '`pwd`' && rm -rf $dirname > /dev/null 2>&1;"' (exit $ret); exit $ret' trap "ret=129; $do_exit" 1 trap "ret=130; $do_exit" 2 trap "ret=141; $do_exit" 13 trap "ret=143; $do_exit" 15 mkdir $dirname || exit 1 cd $dirname case $# in 0) "$prog" "$input" ;; *) "$prog" "$@" "$input" ;; esac ret=$? if test $ret -eq 0; then for from in * do to=`printf '%s\n' "$from" | sed "$rename_sed"` if test -f "$from"; then # If $2 is an absolute path name, then just use that, # otherwise prepend '../'. case $to in [\\/]* | ?:[\\/]*) target=$to;; *) target="../$to";; esac # Do not overwrite unchanged header files to avoid useless # recompilations. Always update the parser itself: it is the # destination of the .y.c rule in the Makefile. Divert the # output of all other files to a temporary file so we can # compare them to existing versions. if test $from != $parser; then realtarget="$target" target=tmp-`printf '%s\n' "$target" | sed 's|.*[\\/]||g'` fi # Munge "#line" or "#" directives. Don't let the resulting # debug information point at an absolute srcdir. Use the real # output file name, not yy.lex.c for instance. Adjust the # include guards too. FROM=`guard "$from"` TARGET=`guard "$to"` sed -e "/^#/!b" -e "s|$input_rx|$input_sub_rx|" -e "$rename_sed" \ -e "s|$FROM|$TARGET|" "$from" >"$target" || ret=$? # Check whether files must be updated. if test "$from" != "$parser"; then if test -f "$realtarget" && cmp -s "$realtarget" "$target"; then echo "$to is unchanged" rm -f "$target" else echo "updating $to" mv -f "$target" "$realtarget" fi fi else # A missing file is only an error for the parser. This is a # blatant hack to let us support using "yacc -d". If -d is not # specified, don't fail when the header file is "missing". if test "$from" = "$parser"; then ret=1 fi fi done fi # Remove the directory. cd .. rm -rf $dirname exit $ret # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: bogofilter-1.2.4/debian/0000755000175000017500000000000012201507134013253 5ustar sezsezbogofilter-1.2.4/debian/bogofilter-bdb.docs0000644000175000017500000000001611664467503017024 0ustar sezsezdoc/README.db bogofilter-1.2.4/debian/bogofilter-tokyocabinet.dirs0000644000175000017500000000001011664467503020773 0ustar sezsezusr/bin bogofilter-1.2.4/debian/bogofilter-tokyocabinet.prerm0000755000175000017500000000046312057700523021163 0ustar sezsez#!/bin/sh set -e util=tokyocabinet #DEBHELPER# case "$1" in remove|deconfigure) if update-alternatives --list bogofilter | grep -q bogofilter-${util}; then update-alternatives --quiet --remove bogofilter "/usr/bin/bogofilter-${util}" fi ;; *) ;; esac bogofilter-1.2.4/debian/bogofilter-common.doc-base.bogotune-faq0000644000175000017500000000064611664467503022711 0ustar sezsezDocument: bogofilter-bogotune-faq Title: Bogotune FAQ Author: David Relson Abstract: Bogotune tries to find optimum parameter settings for bogofilter. It needs at least one set each of spam and non-spam messages. This document is a FAQ on bogotune internals. Section: Network/Communication Format: HTML Index: /usr/share/doc/bogofilter-common/bogotune-faq.html Files: /usr/share/doc/bogofilter-common/bogotune-faq.html bogofilter-1.2.4/debian/bogofilter-bdb.NEWS0000644000175000017500000001516412057700523016647 0ustar sezsezbogofilter (1.2.2-3) unstable; urgency=low * If this is a new installation, or if you are upgrading from a version prior to 0.93.0-1, you should have no problems. If you are using the BDB backend with transactions enabled (they're disabled by default), you must manually clean-up your transaction logs before it will function again. - To do so, first make sure you have the db4.X-util package installed, the precise version depending on the Debian release you upgrade from: * lenny (bogofilter 1.1.7-1): db4.6-util * squeeze (bogofilter 1.2.2-2): db4.8-util * unstable (bogofilter 1.2.2-2): db4.8-util - Then (substitute 4.8 below for the version of your release): 1. Stop invocation of bogofilter 2. db4.8_recover -h ~/.bogofilter 3. rm ~/.bogofilter/lockfi* 4. cd ~/.bogofilter && rm $(db4.8_archive -h .) 5. Resume invocation of bogofilter - Repeat this upgrade procedure for each relevant bogofilter wordlist database, substituting the directory name for "~/.bogofilter". * Alternately, if you don't want to upgrade your database, you may move or delete it and rebuild your wordlist from scratch. -- Serafeim Zanikolas Sat, 09 Apr 2011 21:04:24 +0200 bogofilter (1.2.1-2) unstable; urgency=low * If this is a new installation, or if you are upgrading from a version prior to 0.93.0-1, you should have no problems. If you are using the BDB backend with transactions enabled (they're disabled by default), you must manually clean-up your transaction logs before it will function again. - To do so, first make sure you have the db4.X-util package installed, the precise version depending on the Debian release you upgrade from: * etch (bogofilter 1.1.1-3): db4.4-util * lenny (bogofilter 1.1.7-1): db4.6-util * testing (bogofilter 1.2.0-1): db4.6-util * unstable (bogofilter 1.2.1-1): db4.7-util - Then (substitute 4.6 below for the version of your release): 1. Stop invocation of bogofilter 2. db4.6_recover -h ~/.bogofilter 3. rm ~/.bogofilter/lockfi* 4. cd ~/.bogofilter && rm $(db4.6_archive -h .) 5. Resume invocation of bogofilter - Repeat this upgrade procedure for each relevant bogofilter wordlist database, substituting the directory name for "~/.bogofilter". * Alternately, if you don't want to upgrade your database, you may move or delete it and rebuild your wordlist from scratch. -- Serafeim Zanikolas Sun, 14 Feb 2010 11:48:55 +0100 bogofilter (1.2.0-2) unstable; urgency=low * If you are using the BDB backend with transactions enabled, you must manually upgrade each of your wordlist databases before it will function again. - To do so, follow the instructions below, but using the utilities from the db4.6-util package. -- Serafeim Zanikolas Wed, 06 May 2009 22:55:15 +0200 bogofilter (1.1.5-3) unstable; urgency=low * If this is a new installation, or if you are upgrading from a version prior to 0.93.0-1, you should have no problems. If you are using the BDB backend with transactions enabled, you must manually upgrade each of your wordlist databases before it will function again. - To do so, first make sure you have the db4.5-util package installed, then 1. Stop invocation of bogofilter 2. db4.5_recover -h ~/.bogofilter 3. rm ~/.bogofilter/lockfi* 4. cd ~/.bogofilter && rm $(db4.5_archive -h .) 5. Resume invocation of bogofilter - Repeat this upgrade procedure for each relevant bogofilter wordlist database, substituting the directory name for "~/.bogofilter". * Alternately, if you don't want to upgrade your database, you may move or delete it and rebuild your wordlist from scratch. -- Clint Adams Sun, 29 Jul 2007 07:17:21 -0400 bogofilter (1.0.1-2) unstable; urgency=low * If this is a new installation, or if you are upgrading from a version prior to 0.93.0-1, you should have no problems. If you are using the BDB backend with transactions enabled, you must manually upgrade each of your wordlist databases before it will function again. - To do so, first make sure you have the db4.3-util package installed, then 1. Stop invocation of bogofilter 2. db4.3_recover -h ~/.bogofilter 3. rm ~/.bogofilter/lockfi* 4. cd ~/.bogofilter && rm $(db4.3_archive -h .) 5. Resume invocation of bogofilter - Repeat this upgrade procedure for each relevant bogofilter wordlist database, substituting the directory name for "~/.bogofilter". * Alternately, if you don't want to upgrade your database, you may move or delete it and rebuild your wordlist from scratch. -- Clint Adams Sat, 14 Jan 2006 14:47:17 -0500 bogofilter (0.93.1-2) unstable; urgency=medium * If this is a new installation, or if you are upgrading from a version prior to 0.93.0-1, you should have no problems. If, on the other hand, you are unfortunate enough to be upgrading from 0.93.0-1 or 0.93.0-2, you must manually upgrade each of your wordlist databases before it will function again. - To do so, first make sure you have the db4.2-util package installed, then 1. Stop invocation of bogofilter 2. db4.2_recover -h ~/.bogofilter 3. rm ~/.bogofilter/lockfi* 4. cd ~/.bogofilter && rm $(db4.2_archive -h .) 5. Resume invocation of bogofilter - Repeat this upgrade procedure for each relevant bogofilter wordlist database, substituting the directory name for "~/.bogofilter". * Alternately, if you don't want to upgrade your database, you may move or delete it and rebuild your wordlist from scratch. -- Clint Adams Sat, 27 Nov 2004 16:29:00 -0500 bogofilter (0.93.0-1) unstable; urgency=low * For more detailed information, read /usr/share/doc/bogofilter/RELEASE.NOTES-0.93 . * bogofilter's defaults have changed. All users should be made aware that depending on their configurations, the words in the header added to messages by bogofilter in passthrough mode may abruptly change from "Yes" and "No" to "Spam", "Ham", and "Unsure"; and this may render useless any filtering based on these headers. * bogofilter has switched to use the Berkeley DB Transactional Data Store. bogofilter will read databases created by previous versions, though rebuilding the database is recommended to take advantage of all features. Currently transaction log files need to be archived or deleted manually. -- Clint Adams Sat, 6 Nov 2004 23:05:11 -0500 bogofilter-1.2.4/debian/bogofilter-tokyocabinet.preinst0000755000175000017500000000021312057700523021513 0ustar sezsez#!/bin/sh set -e #DEBHELPER# if [ -L /usr/share/doc/bogofilter-tokyocabinet ]; then rm -f /usr/share/doc/bogofilter-tokyocabinet fi bogofilter-1.2.4/debian/bogofilter-common.doc-base.bogofilter-faq-fr0000644000175000017500000000042311664467503023621 0ustar sezsezDocument: bogofilter-faq-en Title: Bogofilter FAQ (French) Author: David Relson Abstract: FAQ in French Section: Network/Communication Format: HTML Index: /usr/share/doc/bogofilter-common/bogofilter-faq-fr.html Files: /usr/share/doc/bogofilter-common/bogofilter-faq-fr.html bogofilter-1.2.4/debian/bogofilter-sqlite.links0000644000175000017500000000112211664467503017765 0ustar sezsezusr/share/man/man1/bogofilter.1.gz usr/share/man/man1/bogofilter-sqlite.1.gz usr/share/man/man1/bf_compact.1.gz usr/share/man/man1/bf_compact-sqlite.1.gz usr/share/man/man1/bf_copy.1.gz usr/share/man/man1/bf_copy-sqlite.1.gz usr/share/man/man1/bf_tar.1.gz usr/share/man/man1/bf_tar-sqlite.1.gz usr/share/man/man1/bogolexer.1.gz usr/share/man/man1/bogolexer-sqlite.1.gz usr/share/man/man1/bogotune.1.gz usr/share/man/man1/bogotune-sqlite.1.gz usr/share/man/man1/bogoupgrade.1.gz usr/share/man/man1/bogoupgrade-sqlite.1.gz usr/share/man/man1/bogoutil.1.gz usr/share/man/man1/bogoutil-sqlite.1.gz bogofilter-1.2.4/debian/bogofilter.links0000644000175000017500000000007311664467503016472 0ustar sezsez/usr/share/doc/bogofilter-common /usr/share/doc/bogofilter bogofilter-1.2.4/debian/bogofilter-bdb.links0000644000175000017500000000107211664467503017217 0ustar sezsezusr/share/man/man1/bogofilter.1.gz usr/share/man/man1/bogofilter-bdb.1.gz usr/share/man/man1/bf_compact.1.gz usr/share/man/man1/bf_compact-bdb.1.gz usr/share/man/man1/bf_copy.1.gz usr/share/man/man1/bf_copy-bdb.1.gz usr/share/man/man1/bf_tar.1.gz usr/share/man/man1/bf_tar-bdb.1.gz usr/share/man/man1/bogolexer.1.gz usr/share/man/man1/bogolexer-bdb.1.gz usr/share/man/man1/bogotune.1.gz usr/share/man/man1/bogotune-bdb.1.gz usr/share/man/man1/bogoupgrade.1.gz usr/share/man/man1/bogoupgrade-bdb.1.gz usr/share/man/man1/bogoutil.1.gz usr/share/man/man1/bogoutil-bdb.1.gz bogofilter-1.2.4/debian/bogofilter-sqlite.docs0000644000175000017500000000002311664467503017574 0ustar sezsezdoc/README.sqlite bogofilter-1.2.4/debian/bogofilter-tokyocabinet.postinst0000755000175000017500000000153512057700523021722 0ustar sezsez#!/bin/sh set -e util=tokyocabinet #DEBHELPER# case "$1" in configure|abort-upgrade) update-alternatives --quiet --install \ /usr/bin/bogofilter bogofilter /usr/bin/bogofilter-${util} 20 \ --slave /usr/bin/bogoupgrade bogoupgrade /usr/bin/bogoupgrade-${util} \ --slave /usr/bin/bogotune bogotune /usr/bin/bogotune-${util} \ --slave /usr/bin/bf_copy bf_copy /usr/bin/bf_copy-${util} \ --slave /usr/bin/bogolexer bogolexer /usr/bin/bogolexer-${util} \ --slave /usr/bin/bogoutil bogoutil /usr/bin/bogoutil-${util} \ --slave /usr/bin/bf_compact bf_compact /usr/bin/bf_compact-${util} \ --slave /usr/bin/bf_tar bf_tar /usr/bin/bf_tar-${util} ;; *) echo "postint called with unknown argument \`$1'" >&2 exit 1 ;; esac bogofilter-1.2.4/debian/bogofilter-sqlite.prerm0000755000175000017500000000045512057700523017772 0ustar sezsez#!/bin/sh set -e util=sqlite #DEBHELPER# case "$1" in remove|deconfigure) if update-alternatives --list bogofilter | grep -q bogofilter-${util}; then update-alternatives --quiet --remove bogofilter "/usr/bin/bogofilter-${util}" fi ;; *) ;; esac bogofilter-1.2.4/debian/copyright0000644000175000017500000000266112057700523015221 0ustar sezsezThis package was debianized by Clint Adams on Thu, 29 Aug 2002 20:56:36 +0000, and is currently maintained by Serafeim Zanikolas . It was downloaded from http://www.tuxedo.org/~esr/bogofilter/ and is now housed at http://bogofilter.sourceforge.net/ The following copyright applies to this package: # Bogofilter is Copyright © 2002-2009 see /usr/share/doc/bogofilter-common/AUTHORS # # 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. On Debian systems, the complete text of the GPL is in /usr/share/common-licenses/GPL-2. Some files are licensed under the terms of BSD (3 clause), MIT/X11, or ISC (see file headers). The upstream has been repackaged to exclude these non-DFSG-free licensed files: bogofilter-SA-2005-01 bogofilter-SA-2010-01 bogofilter-SA-2005-02 bogofilter-1.2.4/debian/watch0000644000175000017500000000016712061152067014315 0ustar sezsezversion=3 opts=dversionmangle=s/\+dfsg\d+$// \ http://sf.net/bogofilter/ bogofilter-([\d.]*).tar.gz debian uupdate bogofilter-1.2.4/debian/bogofilter-sqlite.dirs0000644000175000017500000000001011664467503017601 0ustar sezsezusr/bin bogofilter-1.2.4/debian/bogofilter-sqlite.preinst0000755000175000017500000000017712057700523020332 0ustar sezsez#!/bin/sh set -e #DEBHELPER# if [ -L /usr/share/doc/bogofilter-sqlite ]; then rm -f /usr/share/doc/bogofilter-sqlite fi bogofilter-1.2.4/debian/changelog0000644000175000017500000013733112201507134015135 0ustar sezsezbogofilter (1.2.4-1) UNRELEASED; urgency=low * New upstream release -- Serafeim Zanikolas Sat, 10 Aug 2013 20:02:52 +0100 bogofilter (1.2.2+dfsg1-3) unstable; urgency=low * Build with security hardening enabled. * debian/rules: fix the binary target by making the binary-arch target depend on the build target * Update debian/watch to mangle Debian version. closes: #665340. -- Serafeim Zanikolas Sun, 09 Dec 2012 14:01:25 +0100 bogofilter (1.2.2+dfsg1-2) unstable; urgency=high * Cherry-pick fix and test for CVE-2012-5468 (aka bogofilter-SA-2012-01) from upstream release 1.2.3. Setting urgency to high. closes: #695139. -- Serafeim Zanikolas Tue, 04 Dec 2012 20:08:50 +0100 bogofilter (1.2.2+dfsg1-1) unstable; urgency=low * Rebuild with repackaged source to exclude non-DFSG-free licensed security advisories (this only affects the source package, as the files were not included in the binaries). closes: #645825. * Add debian/README.source to document the above-described modification to the upstream tarball * Add debhelper token to all maintainer scripts * Add debian/rules targets build-arch and build-indep * debian/copyright: list non-DFSG-free files that were removed in repackaged source, and change my email address to the debian one -- Serafeim Zanikolas Sun, 27 Nov 2011 15:28:05 +0100 bogofilter (1.2.2-3) unstable; urgency=low * bdb backend: - build with libdb5.1 and update Suggests to db5.1-util closes: #621406. - add NEWS.Debian entry to advise users that have enabled bdb transactions, on upgrade steps * Add Vcs-* fields to debian/control. * Bump Standards-Version to 3.9.2 (no changes). * Drop indefinite article from package short descriptions -- Serafeim Zanikolas Sat, 09 Apr 2011 21:04:24 +0200 bogofilter (1.2.2-2) unstable; urgency=high * Add debian/bogofilter-{bdb,sqlite,tokyocabinet}.preinst to remove /usr/share/doc/bogofilter-{bdb,sqlite,tokyocabinet} if they exist and are symlinks, which was the case back in 1.1.7-2. Setting urgency=high. closes: #600489. * Update standards version (no changes). -- Serafeim Zanikolas Mon, 18 Oct 2010 20:51:27 +0200 bogofilter (1.2.2-1) unstable; urgency=low * New Upstream Version (fixes CVE-2010-2494, aka bogofilter-SA-2010-01, so drop debian/patches/prevent-memory-corruption-in-base64_decode.diff) -- Serafeim Zanikolas Fri, 09 Jul 2010 19:25:51 +0200 bogofilter (1.2.1-3) unstable; urgency=high * Apply patch from Julius Plenz to prevent possible heap corruption due to a bug in the base64_decode function (see bogofilter-SA-2010-01). Setting urgency=high. closes: #588090. * Do not hardwire the optimisation level for s390. closes: 582882. * Apply patch from Loïc Minier to not build bogofilter-tokyocabinet for Ubuntu (and Ubuntu-derived) distributions. closes: #581995. * Force autoconf to use bash. closes: #583311. * debian/bogofilter-common.NEWS: fix debian-news-entry-without-blank-line * debian/control:Maintainer: set to my debian email address. * Bump Standards-Version to 3.9.0 (no changes). -- Serafeim Zanikolas Tue, 06 Jul 2010 00:21:16 +0200 bogofilter (1.2.1-2) unstable; urgency=low * Bump Standards-Version to 3.8.4 (no changes). * Convert to dpkg-source 3.0 (quilt) format * Add Depends: ${misc:Depends} for all binary packages * bogofilter-common: - actually install upstream docs, which was not the case since the convertion to dh - register upstream docs with doc-base and add Suggests: doc-base - rename NEWS files so that they're actually picked up by dh - remove entry about dropping qdbm backend from NEWS file (which was not shipped anyway, due to the issue above) * bdb backend: - build with libdb4.8 and update Suggests to db4.8-util - add NEWS.Debian entry to advise users that have enabled bdb transactions, on upgrade steps - correct db-util version in NEWS.Debian for bogofilter-bdb 1.2.0-2 -- Serafeim Zanikolas Sun, 14 Feb 2010 11:48:55 +0100 bogofilter (1.2.1-1) unstable; urgency=low * New Upstream Version * Bump Standards-Version to 3.8.2 (no changes). * Switch debian/rules to debhelper and improve error handling. * Skip tests when DEB_BUILD_OPTIONS contains nocheck. * Remove revision part of libdb-dev in Build-Depends to ease backporting (fixes build-depends-on-1-revision lintian warning). * Make the dummy package bogofilter depend on bogofilter-common and remove lintian override. * Patch bf_tar to use tar instead of pax given the higher priority of the former, and drop "Suggests: pax". closes: #341973. * Add Build-Depends on quilt. * Copy upstream bogofilter.cf.example to /usr/share/doc/bogofilter/examples/bogofilter.cf.example. closes: #266552 * Reduce priority of bogofilter-tokyocabinet to extra, to align with the priority of its dependency libtokyocabinet8. Ditto for bogofilter-sqlite for consistency, as they are both alternative backends. closes: #539561. * Use a single changelog file for all binary packages. * Drop bogofilter-qdbm and announce so in bogofilter-common's NEWS.Debian -- Serafeim Zanikolas Sun, 02 Aug 2009 22:57:31 +0200 bogofilter (1.2.0-3) unstable; urgency=low * New maintainer. closes: #524743. * Maintain a separate Debian changelog for every binary package. closes: #524191. * Allow the system administrator to choose a db backend, other than the default bdb, using update-alternatives. closes: #315318. * Add symbolic links so that manpages are accessible regardless of the db backend in use. closes: #437718. * Make executable /usr/share/doc/bogofilter-common/examples/contrib/bogominitrain.pl closes: #281892. * Add lintian override for false lintian error message. * Update binary package descriptions and remove duplicate Section: fields in debian/control. -- Serafeim Zanikolas Wed, 06 May 2009 21:03:34 +0200 bogofilter (1.2.0-2) unstable; urgency=low * Bump to Standards-Version 3.8.1. * Set Maintainer to Debian QA Group . -- Clint Adams Sun, 19 Apr 2009 11:39:26 -0400 bogofilter (1.2.0-1) unstable; urgency=low * New upstream release. -- Clint Adams Tue, 24 Feb 2009 08:59:46 -0500 bogofilter (1.1.7-2) unstable; urgency=low * Have bf_compact use the correct bogoutil and bogofilter alternatives. closes: #501947. * Bump to Standards-Version 3.8.0. * Change suggests from db4.6-util to db4.7-util. -- Clint Adams Wed, 18 Feb 2009 20:11:21 -0500 bogofilter (1.1.7-1) unstable; urgency=low * New upstream release. -- Clint Adams Tue, 06 May 2008 11:14:51 -0400 bogofilter (1.1.6-4) unstable; urgency=low * Force use of awk (rather than gawk, mawk, or nawk). closes: #477840. -- Clint Adams Sat, 26 Apr 2008 11:26:24 -0400 bogofilter (1.1.6-3) unstable; urgency=low * Move -common to binary-indep. closes: #465845. -- Clint Adams Thu, 28 Feb 2008 11:18:08 -0500 bogofilter (1.1.6-2) unstable; urgency=low * Bump to Standards-Version 3.7.3. * Compress NEWS.Debian. -- Clint Adams Thu, 10 Jan 2008 22:30:18 -0500 bogofilter (1.1.6-1) unstable; urgency=low * New upstream current release. -- Clint Adams Mon, 26 Nov 2007 23:29:00 -0500 bogofilter (1.1.5-4) unstable; urgency=low * Add bogofilter-tokyocabinet with datastore support by Pierre Habouzit. closes: #452452. -- Clint Adams Fri, 23 Nov 2007 19:31:46 -0500 bogofilter (1.1.5-3) unstable; urgency=low * Switch to db4.6 for bogofilter-bdb. -- Clint Adams Sun, 29 Jul 2007 07:17:21 -0400 bogofilter (1.1.5-2) unstable; urgency=low * Switch to db4.5 for bogofilter-bdb. -- Clint Adams Fri, 13 Apr 2007 14:58:02 -0400 bogofilter (1.1.5-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sun, 14 Jan 2007 20:01:10 -0500 bogofilter (1.1.4-1) unstable; urgency=low * New upstream current release. -- Clint Adams Mon, 1 Jan 2007 16:31:03 -0500 bogofilter (1.1.3-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sun, 3 Dec 2006 11:34:37 -0500 bogofilter (1.1.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sun, 3 Dec 2006 03:20:23 -0500 bogofilter (1.1.1-6) unstable; urgency=medium * Apply patch from Santiago Vila to properly clean up all the substvars files and use modern syntax for tail. closes: #401327. -- Clint Adams Sat, 2 Dec 2006 11:55:36 -0500 bogofilter (1.1.1-5) unstable; urgency=medium * Reenable qdbm, now that the alpha problem has a workaround. -- Clint Adams Fri, 3 Nov 2006 11:00:04 -0500 bogofilter (1.1.1-4) unstable; urgency=low * Disable qdbm again. -- Clint Adams Sun, 22 Oct 2006 04:43:04 -0400 bogofilter (1.1.1-3) unstable; urgency=low * Reenable qdbm. -- Clint Adams Sun, 17 Sep 2006 03:17:05 -0400 bogofilter (1.1.1-2) unstable; urgency=low * Remove the qdbm build-dep while the qdbm build is disabled. -- Clint Adams Mon, 4 Sep 2006 00:32:18 -0400 bogofilter (1.1.1-1) unstable; urgency=medium * New upstream stable release. * Disable qdbm build due to qdbm breakage. -- Clint Adams Fri, 1 Sep 2006 15:36:58 -0400 bogofilter (1.0.3-1) unstable; urgency=low * New upstream current release. * Bump Standards-Version to 3.7.2. -- Clint Adams Tue, 11 Jul 2006 09:53:46 -0400 bogofilter (1.0.2-3) unstable; urgency=low * Strip .comment section from binaries. -- Clint Adams Mon, 3 Apr 2006 20:23:43 -0400 bogofilter (1.0.2-2) unstable; urgency=medium * Change Suggests to db4.4-util. -- Clint Adams Mon, 6 Mar 2006 09:40:13 -0500 bogofilter (1.0.2-1) unstable; urgency=low * New upstream current release. -- Clint Adams Fri, 3 Mar 2006 20:30:30 -0500 bogofilter (1.0.1-2) unstable; urgency=low * Switch to db4.4. -- Clint Adams Sat, 14 Jan 2006 14:47:17 -0500 bogofilter (1.0.1-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sun, 1 Jan 2006 17:42:01 -0500 bogofilter (1.0.0-1) unstable; urgency=medium * New upstream stable release. -- Clint Adams Wed, 30 Nov 2005 21:43:57 -0500 bogofilter (0.96.6-1) unstable; urgency=low * New upstream release. -- Clint Adams Sun, 13 Nov 2005 03:40:56 -0500 bogofilter (0.96.5-1) unstable; urgency=low * New upstream release. -- Clint Adams Mon, 7 Nov 2005 22:06:19 -0500 bogofilter (0.96.4-2) unstable; urgency=medium * Patch from upstream to fix infinite loop when using charset_default=iso-8859-1. closes: #317524. -- Clint Adams Fri, 4 Nov 2005 19:29:17 -0500 bogofilter (0.96.4-1) unstable; urgency=high * New upstream current release. -- Clint Adams Tue, 1 Nov 2005 12:52:45 -0500 bogofilter (0.96.3-1) unstable; urgency=medium * New upstream current release. - Includes fix from Mariusz Kruk for error in postfix example leading to potential data loss. closes: #334854, #324646. -- Clint Adams Tue, 25 Oct 2005 23:48:34 -0400 bogofilter (0.96.2-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sun, 25 Sep 2005 12:07:36 -0400 bogofilter (0.96.1-1) unstable; urgency=low * New upstream current release. -- Clint Adams Mon, 5 Sep 2005 09:39:17 -0400 bogofilter (0.96.0-1) unstable; urgency=low * New upstream current release. * TDB support has been dropped upstream, so the -tdb package is dropped as well. -- Clint Adams Mon, 15 Aug 2005 21:54:11 -0400 bogofilter (0.95.2-1) unstable; urgency=low * New upstream current release. * Bump to Standards-Version 3.6.2. -- Clint Adams Thu, 30 Jun 2005 22:14:01 -0400 bogofilter (0.95.1-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sun, 26 Jun 2005 22:40:33 -0400 bogofilter (0.95.0-2) unstable; urgency=low * Make bogofilter-bdb Replace bogofilter (<< 0.94.14-1). closes: #315316. * Make bogofilter-common Replace bogofilter (<< 0.94.14-1). closes: #315317. -- Clint Adams Tue, 21 Jun 2005 17:11:23 -0400 bogofilter (0.95.0-1) unstable; urgency=low * New upstream current release. * Stop trying to chown in build target. closes: #315202. * Fix short description of bogofilter-sqlite. -- Clint Adams Tue, 21 Jun 2005 09:31:38 -0400 bogofilter (0.94.14-2) unstable; urgency=medium * Patch tdb code to not attempt unaligned word access. * Disable t.lock3 test for sqlite. -- Clint Adams Fri, 10 Jun 2005 09:53:14 -0400 bogofilter (0.94.14-1) unstable; urgency=low * New upstream bugfix release. * Ship a binary package for each db backend (Berkeley DB, tdb, qdbm, sqlite). closes: #309724. -- Clint Adams Wed, 8 Jun 2005 21:09:29 -0400 bogofilter (0.94.13-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sat, 28 May 2005 16:43:07 -0400 bogofilter (0.94.12-1) unstable; urgency=low * New upstream stable release. -- Clint Adams Sun, 15 May 2005 21:57:56 -0400 bogofilter (0.94.11-1) unstable; urgency=low * New upstream current release. -- Clint Adams Tue, 10 May 2005 20:24:47 -0400 bogofilter (0.94.10-1) unstable; urgency=low * New upstream current release. -- Clint Adams Mon, 9 May 2005 11:26:22 -0400 bogofilter (0.94.9-1) unstable; urgency=low * New upstream current release. -- Clint Adams Fri, 6 May 2005 15:25:32 -0400 bogofilter (0.94.8-1) unstable; urgency=low * New upstream current release. -- Clint Adams Tue, 3 May 2005 22:20:40 -0400 bogofilter (0.94.7-1) unstable; urgency=medium * New upstream current release. * Switch watch file to use the lolando sfdlr. -- Clint Adams Sat, 30 Apr 2005 12:55:49 -0400 bogofilter (0.94.6-1) unstable; urgency=low * New upstream current release. -- Clint Adams Tue, 26 Apr 2005 20:24:47 -0400 bogofilter (0.94.5-1) unstable; urgency=medium * New upstream current release. * Drop db4.3-util to Suggests. -- Clint Adams Sat, 23 Apr 2005 12:33:37 -0400 bogofilter (0.94.4-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 7 Apr 2005 20:49:55 -0400 bogofilter (0.94.3-2) unstable; urgency=low * Stop prepending extra #'s to lines in /etc/bogofilter.cf. -- Clint Adams Thu, 7 Apr 2005 14:14:40 -0400 bogofilter (0.94.3-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Wed, 30 Mar 2005 21:02:16 -0500 bogofilter (0.94.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 25 Mar 2005 00:35:51 -0500 bogofilter (0.94.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Wed, 16 Mar 2005 21:31:42 -0500 bogofilter (0.94.0-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sat, 5 Mar 2005 20:55:45 -0500 bogofilter (0.93.5-1) unstable; urgency=medium * New upstream release. -- Clint Adams Sat, 22 Jan 2005 21:21:28 -0500 bogofilter (0.93.4-2) unstable; urgency=low * Fix 'bogofilter -F' crash. -- Clint Adams Sat, 15 Jan 2005 14:08:36 -0500 bogofilter (0.93.4-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sun, 9 Jan 2005 11:16:40 -0500 bogofilter (0.93.3.snapshot20050105a-1) unstable; urgency=medium * New unofficial Matthias snapshot. -- Clint Adams Wed, 5 Jan 2005 11:26:31 -0500 bogofilter (0.93.3.1-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sun, 26 Dec 2004 23:06:23 -0500 bogofilter (0.93.3-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 24 Dec 2004 23:14:35 -0500 bogofilter (0.93.2.cvs+1220-1) unstable; urgency=medium * New upstream CVS snapshot. -- Clint Adams Mon, 20 Dec 2004 13:30:23 -0500 bogofilter (0.93.2.cvs+1213-1) unstable; urgency=medium * New upstream CVS snapshot. -- Clint Adams Wed, 15 Dec 2004 17:51:31 -0500 bogofilter (0.93.2-2) unstable; urgency=medium * Change bf_* scripts to call db4.3_* instead of db_*. * Raise Suggests on db4.3-util to Recommends. * Add Suggests on pax (for bf_tar). -- Clint Adams Mon, 6 Dec 2004 22:33:32 -0500 bogofilter (0.93.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 3 Dec 2004 20:51:07 -0500 bogofilter (0.93.1-2) unstable; urgency=medium * Add Suggests for db4.3-util. closes: #282779. * Build-dep on libdb4.3-dev. * Add NEWS.Debian entry to advise on upgrade steps for anyone coming from 0.93.0-1 or 0.93.1-1. (Such users will find that bogofilter will break completely until they intervene). -- Clint Adams Sat, 27 Nov 2004 16:29:00 -0500 bogofilter (0.93.1-1) unstable; urgency=low * New upstream current release. -- Clint Adams Thu, 11 Nov 2004 09:55:08 -0500 bogofilter (0.93.0-1) unstable; urgency=low * New upstream current release (the release of significant changes). * Add NEWS.Debian to advise people not to downgrade, and to be aware of changes in defaults. -- Clint Adams Sat, 6 Nov 2004 23:05:11 -0500 bogofilter (0.92.8-1) unstable; urgency=medium * New upstream current release. (This fixes a rfc2047 qp decoding segfault.) closes: #275373. -- Clint Adams Tue, 19 Oct 2004 21:05:00 -0400 bogofilter (0.92.7-1) unstable; urgency=medium * New upstream current release. (This fixes bogotune -D failures.) closes: #274405. -- Clint Adams Sat, 2 Oct 2004 11:18:43 -0400 bogofilter (0.92.6-1) unstable; urgency=medium * New upstream current release. Fixes -QQ bugs. -- Clint Adams Wed, 25 Aug 2004 20:06:33 -0400 bogofilter (0.92.5-1) unstable; urgency=medium * New upstream current release. - adds "-QQ" option to bogofilter to display extended parameter list. closes: #265667, #265706. - improves documentation and resiliency of '-y'. closes: #264502. -- Clint Adams Fri, 20 Aug 2004 10:46:18 -0400 bogofilter (0.92.4-1) unstable; urgency=low * New upstream current release. -- Clint Adams Thu, 29 Jul 2004 11:45:17 -0400 bogofilter (0.92.3-1) unstable; urgency=medium * New upstream current release. * Change watch file to point to ftp2.sf.net instead of prdownloads.sourceforge.net. -- Clint Adams Wed, 28 Jul 2004 09:32:34 -0400 bogofilter (0.92.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 15 Jul 2004 00:03:58 -0400 bogofilter (0.92.1-2) unstable; urgency=low * Add debian/watch file for dehs. -- Clint Adams Fri, 9 Jul 2004 08:38:48 -0400 bogofilter (0.92.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 1 Jul 2004 22:03:09 -0400 bogofilter (0.92.0-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sun, 27 Jun 2004 09:22:31 -0400 bogofilter (0.91.4-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sun, 20 Jun 2004 17:32:38 -0400 bogofilter (0.91.3-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Wed, 16 Jun 2004 09:24:52 -0400 bogofilter (0.91.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 11 Jun 2004 16:14:50 -0400 bogofilter (0.91.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 4 Jun 2004 10:59:20 -0400 bogofilter (0.91.0-4) unstable; urgency=low * Additional wordlist and datastore patches. -- Clint Adams Wed, 2 Jun 2004 10:49:07 -0400 bogofilter (0.91.0-3) unstable; urgency=low * Apply other patches related to tilde expansion cleanup. * Convert contrib/scramble and contrib/trainbogo.sh from bash scripts to POSIX sh scripts. -- Clint Adams Sun, 30 May 2004 17:32:21 -0400 bogofilter (0.91.0-2) unstable; urgency=medium * Apply patch to unbreak tilde expansion. closes: #251117. -- Clint Adams Fri, 28 May 2004 09:52:56 -0400 bogofilter (0.91.0-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sat, 22 May 2004 17:17:18 -0400 bogofilter (0.90.0-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sun, 9 May 2004 22:29:25 -0400 bogofilter (0.17.5-1) unstable; urgency=low * New upstream current release. -- Clint Adams Thu, 1 Apr 2004 22:33:17 -0500 bogofilter (0.17.4-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Mon, 22 Mar 2004 09:38:48 -0500 bogofilter (0.17.3-1) unstable; urgency=low * New upstream current release. -- Clint Adams Thu, 18 Mar 2004 09:14:45 -0500 bogofilter (0.17.2-4) unstable; urgency=low * Extend bogotune -f to override sanity checks on ham-spam ratio. -- Clint Adams Wed, 3 Mar 2004 06:29:39 -0500 bogofilter (0.17.2-3) unstable; urgency=low * Extend bogotune -f to override sanity checks on provided corpora. -- Clint Adams Wed, 3 Mar 2004 06:21:47 -0500 bogofilter (0.17.2-2) unstable; urgency=low * Apply (on a temporary trial basis) Jason A. Smith's bogotune -f patch (allows override of sanity checks; currently proscribed by bogofilter upstream). -- Clint Adams Wed, 3 Mar 2004 05:35:04 -0500 bogofilter (0.17.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sun, 22 Feb 2004 15:07:17 -0500 bogofilter (0.17.1-2) unstable; urgency=low * Fix -n/-s thinko in bogofilter(1), thanks to Stephane Bortzmeyer. closes: #233838. * Add missing slash to mailfilter example, thanks to Kai Hendry. closes: #232830. -- Clint Adams Fri, 20 Feb 2004 09:45:47 -0500 bogofilter (0.17.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Tue, 10 Feb 2004 11:17:56 -0500 bogofilter (0.17.0-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sun, 1 Feb 2004 22:01:09 -0500 bogofilter (0.16.4-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 23 Jan 2004 08:21:22 -0500 bogofilter (0.16.3-2) unstable; urgency=medium * Don't ship bogogrep stuff from contrib directory. closes: #228368. -- Clint Adams Sun, 18 Jan 2004 12:44:47 -0500 bogofilter (0.16.3-1) unstable; urgency=low * New upstream current release. -- Clint Adams Sat, 17 Jan 2004 16:55:57 -0500 bogofilter (0.16.2-2) unstable; urgency=low * Install contrib scripts to /usr/share/doc/bogofilter/examples. closes: #227505. -- Clint Adams Fri, 16 Jan 2004 21:35:25 -0500 bogofilter (0.16.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 16 Jan 2004 19:01:48 -0500 bogofilter (0.16.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 8 Jan 2004 11:01:01 -0500 bogofilter (0.16.0-1) unstable; urgency=low * New upstream current release. If you are using the Graham algorithm, the Robinson geometric-mean algorithm, separate wordlist databases, ignorelists, or any related command-line options, bogofilter will almost certainly stop working. * Switch from db4.1 to db4.2. -- Clint Adams Thu, 1 Jan 2004 18:06:24 -0500 bogofilter (0.15.13-1) unstable; urgency=low * New upstream current release. This fixes the "cannot allocate memory" error for people still using separate wordlist files. closes: #224504, #224546. -- Clint Adams Sat, 27 Dec 2003 15:11:14 -0500 bogofilter (0.15.12-1) unstable; urgency=low * New upstream current release. -- Clint Adams Wed, 24 Dec 2003 20:56:03 -0500 bogofilter (0.15.11-1) unstable; urgency=low * New upstream current release. -- Clint Adams Wed, 17 Dec 2003 10:28:29 -0500 bogofilter (0.15.10-1) unstable; urgency=low * New upstream current release. -- Clint Adams Mon, 8 Dec 2003 21:45:53 -0500 bogofilter (0.15.9-2) unstable; urgency=medium * Include integrating-with-{postfix,qmail} docs. closes: #223183. -- Clint Adams Sun, 7 Dec 2003 10:12:41 -0500 bogofilter (0.15.9-1) unstable; urgency=medium * New upstream current release. * No longer suggest db4.1-util, and remove db4.1-util note from README.Debian. closes: #218582. -- Clint Adams Mon, 24 Nov 2003 00:37:31 -0500 bogofilter (0.15.8-1) unstable; urgency=medium * New upstream current release. (This removes some out-of-date information from the manpage, thus closes: #217739.) -- Clint Adams Thu, 30 Oct 2003 09:20:54 -0500 bogofilter (0.15.7-1) unstable; urgency=medium * New upstream current release. * Add note from Jerome R. Acks to README.Debian that db4.1-util is necessary for running bogotune. closes: #212791. -- Clint Adams Tue, 14 Oct 2003 09:31:32 -0400 bogofilter (0.15.6-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 3 Oct 2003 15:53:38 -0400 bogofilter (0.15.4-2) unstable; urgency=medium * Make bogolex.sh POSIX-compliant. -- Clint Adams Wed, 24 Sep 2003 09:41:14 -0400 bogofilter (0.15.4-1) unstable; urgency=medium * New upstream current release. * Bump to Standards-Version 3.6.1. * Add libgsl0-dev to Build-Depends. -- Clint Adams Fri, 19 Sep 2003 19:08:47 -0400 bogofilter (0.15.3-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 11 Sep 2003 10:33:59 -0400 bogofilter (0.15.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 4 Sep 2003 08:04:33 -0400 bogofilter (0.15.0-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Mon, 1 Sep 2003 14:13:16 -0400 bogofilter (0.14.5.4-1) unstable; urgency=low * New upstream current release. -- Clint Adams Mon, 1 Sep 2003 14:07:46 -0400 bogofilter (0.14.5.2-1) unstable; urgency=medium * New upstream stable release. -- Clint Adams Tue, 26 Aug 2003 09:00:30 -0400 bogofilter (0.14.5.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Tue, 19 Aug 2003 20:44:30 -0400 bogofilter (0.14.4-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sun, 10 Aug 2003 17:37:54 -0400 bogofilter (0.14.3-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Mon, 4 Aug 2003 21:47:57 -0400 bogofilter (0.14.2-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Sat, 2 Aug 2003 21:57:18 -0400 bogofilter (0.14.1.1-3) unstable; urgency=medium * Apply the real patch to stop segfaulting on some architectures. -- Clint Adams Sat, 2 Aug 2003 16:24:30 -0400 bogofilter (0.14.1.1-2) unstable; urgency=medium * Apply patch to stop segfaulting on some architectures. * Remove gdb build-dep again. -- Clint Adams Sat, 2 Aug 2003 11:07:14 -0400 bogofilter (0.14.1.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Fri, 1 Aug 2003 20:10:36 -0400 bogofilter (0.14.1-1) unstable; urgency=medium * New upstream current release. * Build-dep on gdb for arm, hppa, m68k, mips, mipsel to help track down possible misoptimization. -- Clint Adams Thu, 31 Jul 2003 19:19:54 -0400 bogofilter (0.14.0.1-2) unstable; urgency=medium * Bump to Standards-Version 3.6.0. * Suggest db4.1-util (for bogotune). * Have bogotune call db4.1_verify instead of db_verify. closes: #203017 -- Clint Adams Mon, 28 Jul 2003 09:57:30 -0400 bogofilter (0.14.0.1-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 24 Jul 2003 01:04:41 -0400 bogofilter (0.14.0-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Tue, 22 Jul 2003 19:24:24 -0400 bogofilter (0.13.7.3-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Thu, 17 Jul 2003 09:47:26 -0400 bogofilter (0.13.7.2-2) unstable; urgency=medium * Use newer config.{guess,sub}. -- Clint Adams Mon, 14 Jul 2003 08:11:05 -0400 bogofilter (0.13.7.2-1) unstable; urgency=medium * New upstream stable release. * Move tuning stuff to saner locations. closes: #199921. -- Clint Adams Sun, 6 Jul 2003 11:49:35 -0400 bogofilter (0.13.7-2) unstable; urgency=medium * Use newer config.{guess,sub}. -- Clint Adams Mon, 23 Jun 2003 07:36:55 -0400 bogofilter (0.13.7-1) unstable; urgency=low * New upstream current release. -- Clint Adams Fri, 20 Jun 2003 20:14:36 -0400 bogofilter (0.13.6.2-1) unstable; urgency=medium * New upstream stable release. -- Clint Adams Thu, 12 Jun 2003 14:25:19 -0400 bogofilter (0.13.6.1-1) unstable; urgency=medium * New upstream stable release. -- Clint Adams Thu, 5 Jun 2003 22:30:14 -0400 bogofilter (0.13.6-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Wed, 4 Jun 2003 15:15:29 -0400 bogofilter (0.13.5-1) unstable; urgency=medium * New upstream current release. -- Clint Adams Tue, 3 Jun 2003 10:59:27 -0400 bogofilter (0.13.4-1) unstable; urgency=medium * New upstream current release. This increases the default robs value from 0.001 to 0.01. -- Clint Adams Fri, 30 May 2003 09:49:45 -0400 bogofilter (0.13.3-1) unstable; urgency=medium * New upstream current release. Note that as of 0.13.2, case folding was disabled by default, and may lead to an increase in false negatives when using case-folded wordlists. -- Clint Adams Thu, 29 May 2003 12:20:38 -0400 bogofilter (0.13.2-1) unstable; urgency=high * New upstream current release, which fixes the replace_ascii_characters/ignore_case interaction defect. -- Clint Adams Sat, 24 May 2003 11:12:45 -0400 bogofilter (0.13.0-1) unstable; urgency=low * New upstream current release. * Clean the correct substvars file in the clean target. -- Clint Adams Wed, 21 May 2003 12:51:00 -0400 bogofilter (0.12.3-1) unstable; urgency=medium * New upstream current release. * Remove misleading comments from bogofilter.cf. closes: #187721. -- Clint Adams Sat, 10 May 2003 12:30:37 -0400 bogofilter (0.12.2-1) unstable; urgency=medium * New upstream current release. * Build-dep ONLY on libdb4.1-dev, for Adrian Bunk. closes: #191061. -- Clint Adams Wed, 30 Apr 2003 10:39:26 -0400 bogofilter (0.12.1-1) unstable; urgency=medium * New upstream current release. * Wordhash patch from David Relson to fix hppa alignment issue. -- Clint Adams Sat, 26 Apr 2003 11:21:58 -0400 bogofilter (0.11.2-1) unstable; urgency=low * New upstream stable release. -- Clint Adams Wed, 23 Apr 2003 22:02:30 -0400 bogofilter (0.11.1.9-1) unstable; urgency=medium * New upstream current release. * Install procmail and maildrop examples. -- Clint Adams Fri, 11 Apr 2003 21:19:41 -0400 bogofilter (0.11.1.6-3) unstable; urgency=medium * Add some more checks to t.bogodir to make sure it's failing due to nonexistent homedirs on certain buildds. -- Clint Adams Sun, 6 Apr 2003 19:20:43 -0400 bogofilter (0.11.1.6-2) unstable; urgency=medium * Use more loquacious t.bogodir to try to get some insight on the intermittent failures. * Drop gdb build-dep on s390. -- Clint Adams Sun, 6 Apr 2003 12:21:56 -0400 bogofilter (0.11.1.6-1) unstable; urgency=medium * New upstream current release. * Go back to building with -O1 on s390 to deal with the gcc bug. -- Clint Adams Sat, 5 Apr 2003 22:39:12 -0500 bogofilter (0.11.1.5-1) unstable; urgency=low * New upstream bugfix release. -- Clint Adams Sat, 29 Mar 2003 13:17:50 -0500 bogofilter (0.11.1.4-1) unstable; urgency=medium * New upstream bugfix release. -- Clint Adams Wed, 26 Mar 2003 01:20:23 -0500 bogofilter (0.11.1.3-6) unstable; urgency=low * See if the segfaults recur with -O2. -- Clint Adams Tue, 11 Mar 2003 19:36:49 -0500 bogofilter (0.11.1.3-5) unstable; urgency=low * Now build with -O0 on s390. -- Clint Adams Tue, 11 Mar 2003 18:45:18 -0500 bogofilter (0.11.1.3-4) unstable; urgency=low * Really build with -O1 on s390 this time. -- Clint Adams Tue, 11 Mar 2003 16:02:28 -0500 bogofilter (0.11.1.3-3) unstable; urgency=low * Build with -O1 on s390. -- Clint Adams Tue, 11 Mar 2003 15:27:09 -0500 bogofilter (0.11.1.3-2) unstable; urgency=medium * Unlimit coredumpsize so that printcore works. -- Clint Adams Mon, 10 Mar 2003 23:32:32 -0500 bogofilter (0.11.1.3-1) unstable; urgency=low * New upstream bugfix release. * Temporarily build-dep on gdb on s390 to get more information on the mysterious segfaults under sbuild. -- Clint Adams Mon, 10 Mar 2003 20:57:14 -0500 bogofilter (0.11.1.2-2) unstable; urgency=low * Remove no-longer-relevant Build-Depends. -- Clint Adams Sun, 9 Mar 2003 22:17:56 -0500 bogofilter (0.11.1.2-1) unstable; urgency=low * New upstream bugfix release. -- Clint Adams Sat, 8 Mar 2003 12:04:04 -0500 bogofilter (0.11.1.1-2) unstable; urgency=medium * Apply patch to avoid divide by zero. (should fix alpha build) -- Clint Adams Thu, 6 Mar 2003 09:49:24 -0500 bogofilter (0.11.1.1-1) unstable; urgency=low * New upstream bugfix release. -- Clint Adams Thu, 6 Mar 2003 00:01:49 -0500 bogofilter (0.11.1-1) unstable; urgency=low * New upstream release. -- Clint Adams Tue, 4 Mar 2003 22:24:23 -0500 bogofilter (0.10.3-1) unstable; urgency=low * New upstream patch release. -- Clint Adams Fri, 14 Feb 2003 11:39:05 -0500 bogofilter (0.10.2-2) unstable; urgency=low * Patch to fix html comment parsing bug. -- Clint Adams Mon, 3 Feb 2003 18:17:15 -0500 bogofilter (0.10.2-1) unstable; urgency=low * New upstream stable release. -- Clint Adams Mon, 3 Feb 2003 11:25:09 -0500 bogofilter (0.10.1.5-1) unstable; urgency=low * New upstream release, which fixes the sleep time randomization problem. closes: #179297. * Add README.Debian with mutt pipe_decode caveat. * Switch to db4.1. -- Clint Adams Sat, 1 Feb 2003 14:16:45 -0500 bogofilter (0.10.1.4-1) unstable; urgency=low * New upstream release. * Put METHODS file in /usr/share/doc. -- Clint Adams Fri, 31 Jan 2003 01:43:19 -0500 bogofilter (0.10.1.3-1) unstable; urgency=low * New upstream release. -- Clint Adams Thu, 30 Jan 2003 00:43:25 -0500 bogofilter (0.10.1.2-4) unstable; urgency=low * Fix broken tilde expansion. closes: #178934. -- Clint Adams Wed, 29 Jan 2003 21:34:49 -0500 bogofilter (0.10.1.2-3) unstable; urgency=low * More sizeof(long) and signedness issues. -- Clint Adams Tue, 28 Jan 2003 20:49:15 -0500 bogofilter (0.10.1.2-2) unstable; urgency=low * Correct silly assumption of sizeof(long)==4. -- Clint Adams Tue, 28 Jan 2003 17:42:54 -0500 bogofilter (0.10.1.2-1) unstable; urgency=low * New upstream release. -- Clint Adams Tue, 28 Jan 2003 12:12:46 -0500 bogofilter (0.10.1.1-1) unstable; urgency=low * New upstream release. -- Clint Adams Mon, 27 Jan 2003 10:58:20 -0500 bogofilter (0.10.1-2) unstable; urgency=low * Fix autoconf fumble. -- Clint Adams Fri, 24 Jan 2003 01:19:35 -0500 bogofilter (0.10.1-1) unstable; urgency=low * New upstream release. -- Clint Adams Thu, 23 Jan 2003 07:59:50 -0500 bogofilter (0.10.0-1) unstable; urgency=low * New upstream release. * Remove hppa gcc kludge. * Add Build-Conflicts against autoconf so people will stop filing bugs demanding that it be added to Build-Depends. -- Clint Adams Sun, 19 Jan 2003 15:12:28 -0500 bogofilter (0.9.1.2-5) unstable; urgency=low * Fix "regognition" typo. closes: #175671. -- Clint Adams Tue, 7 Jan 2003 08:58:16 -0500 bogofilter (0.9.1.2-4) unstable; urgency=low * Change xmlto build-dep to require versions that call xmllint, and don't call xmllint directly from build. closes: #174819. (Thanks to Graham Wilson). -- Clint Adams Tue, 31 Dec 2002 09:04:33 -0500 bogofilter (0.9.1.2-3) unstable; urgency=low * Install AUTHORS file and refer to it from copyright file. -- Clint Adams Thu, 12 Dec 2002 09:18:06 -0500 bogofilter (0.9.1.2-2) unstable; urgency=low * Fix misleading bogofilter -h output. closes: #172313. -- Clint Adams Mon, 9 Dec 2002 11:21:40 -0500 bogofilter (0.9.1.2-1) unstable; urgency=low * New upstream release. * Include README.Robinson in /usr/share/doc. closes: #171967. -- Clint Adams Fri, 6 Dec 2002 09:16:10 -0500 bogofilter (0.9.1.1-1) unstable; urgency=low * New upstream release. -- Clint Adams Thu, 5 Dec 2002 15:30:21 -0500 bogofilter (0.9.1-2) unstable; urgency=low * Patch from David Relson to remove an overzealous message count check. -- Clint Adams Wed, 4 Dec 2002 10:02:47 -0500 bogofilter (0.9.1-1) unstable; urgency=low * New upstream release. * Fix documentation and config typoes. closes: #171010. -- Clint Adams Tue, 3 Dec 2002 18:24:29 -0500 bogofilter (0.9.0.1-3) unstable; urgency=low * Check for size of double and long double in configure. -- Clint Adams Sat, 23 Nov 2002 20:59:32 -0500 bogofilter (0.9.0.1-2) unstable; urgency=low * Remove errant strip command. closes: #170452. -- Clint Adams Sat, 23 Nov 2002 17:11:42 -0500 bogofilter (0.9.0.1-1) unstable; urgency=low * New upstream bugfix beta. -- Clint Adams Sat, 23 Nov 2002 15:57:40 -0500 bogofilter (0.9.0-1) unstable; urgency=low * New upstream beta. Default algorithm is now Robinson, not Graham. -- Clint Adams Sat, 23 Nov 2002 02:42:17 -0500 bogofilter (0.8.0.scvs20021121-1) unstable; urgency=low * New upstream CVS snapshot. Includes Fisher's method for combining P. * Build with gcc 3.2 on hppa to avoid bug in 3.0. -- Clint Adams Thu, 21 Nov 2002 02:53:38 -0500 bogofilter (0.8.0.rel-2) unstable; urgency=low * Add /etc/bogofilter.cf conffile. * Install bogofilter-faq.html. -- Clint Adams Sat, 9 Nov 2002 22:47:52 -0500 bogofilter (0.8.0.rel-1) unstable; urgency=low * New upstream release. -- Clint Adams Sat, 9 Nov 2002 13:32:45 -0500 bogofilter (0.8.0.rc3-1) unstable; urgency=low * New upstream release candidate. -- Clint Adams Fri, 8 Nov 2002 12:51:51 -0500 bogofilter (0.8.0.rc2-2) unstable; urgency=medium * Apply -u fix from rc3. -- Clint Adams Thu, 7 Nov 2002 11:21:14 -0500 bogofilter (0.8.0.rc2-1) unstable; urgency=low * New upstream release candidate. 0.8.0 release has been retracted. -- Clint Adams Wed, 6 Nov 2002 21:34:56 -0500 bogofilter (0.8.0-1) unstable; urgency=low * New upstream release. -- Clint Adams Tue, 5 Nov 2002 19:58:02 -0500 bogofilter (0.7.999+0.8.0.rc1-1) unstable; urgency=low * New upstream release candidate. -- Clint Adams Sat, 2 Nov 2002 14:41:31 -0500 bogofilter (0.7.6-1) unstable; urgency=low * New upstream release. -- Clint Adams Mon, 28 Oct 2002 19:08:04 -0500 bogofilter (0.7.5+rc2.0.7.6-1) unstable; urgency=low * New upstream release candidate for 0.7.6 (0.7.6rc2). -- Clint Adams Sun, 27 Oct 2002 14:11:34 -0500 bogofilter (0.7.5+rc1.0.7.6-2) unstable; urgency=low * Reapply signed char fix. -- Clint Adams Sat, 26 Oct 2002 19:39:39 -0400 bogofilter (0.7.5+rc1.0.7.6-1) unstable; urgency=low * New upstream release candidate for 0.7.6 (0.7.6rc1). -- Clint Adams Sat, 26 Oct 2002 16:50:33 -0400 bogofilter (0.7.5+1025cvs-5) unstable; urgency=low * Try alternate patch for ia64. -- Clint Adams Sat, 26 Oct 2002 11:19:52 -0400 bogofilter (0.7.5+1025cvs-4) unstable; urgency=low * Change xmalloc to malloc in lexer.l to avoid segfault on ia64. -- Clint Adams Sat, 26 Oct 2002 03:06:08 -0400 bogofilter (0.7.5+1025cvs-3) unstable; urgency=low * Change char to int to avoid signedness problem on s390/arm/powerpc. -- Clint Adams Sat, 26 Oct 2002 01:08:26 -0400 bogofilter (0.7.5+1025cvs-2) unstable; urgency=low * Resync with CVS. * New fix for bus error. closes: #166280. * Build with 'make check' -- Clint Adams Fri, 25 Oct 2002 22:59:15 -0400 bogofilter (0.7.5+1025cvs-1) unstable; urgency=low * New upstream CVS snapshot. * Should fix memory alignment error. closes: #166280. * Includes bogoutil manpage. closes: #165728. * Also new are -g and -r options (for Graham and Robinson algorithms, respectively). -- Clint Adams Fri, 25 Oct 2002 17:58:46 -0400 bogofilter (0.7.5+1017cvs-1) unstable; urgency=low * New upstream CVS snapshot. -- Clint Adams Thu, 17 Oct 2002 19:59:01 -0400 bogofilter (0.7.4+1014cvs-1) unstable; urgency=low * New upstream CVS snapshot. -- Clint Adams Mon, 14 Oct 2002 16:12:20 -0400 bogofilter (0.7.4+1004cvs-1) unstable; urgency=low * New upstream CVS snapshot, with fix for wordhash segfaults on hppa. closes: bug#163049. * Correct description of -v option in manpage. closes: bug#163157. -- Clint Adams Fri, 4 Oct 2002 04:17:05 -0400 bogofilter (0.7.4+1002cvs-1) unstable; urgency=low * New upstream CVS snapshot. This includes multiple wordlist support. -- Clint Adams Wed, 2 Oct 2002 17:45:26 -0400 bogofilter (0.7.4+0929cvs-1) unstable; urgency=low * New upstream CVS snapshot. This includes some fun changes. For example, Judy is no longer used, -h and -H have been changed back to -n and -N (whee), and the db filenames have been changed again to spamlist and goodlist. * Remove manpage reference to now-nonexistent -l option. -- Clint Adams Sun, 29 Sep 2002 12:17:21 -0400 bogofilter (0.7.4-6) unstable; urgency=low * Get rid of 'debug'-priority syslog messages about 'trying' and 'released' flock locks. closes: #162739. -- Clint Adams Sun, 29 Sep 2002 11:42:14 -0400 bogofilter (0.7.4-5) unstable; urgency=low * No longer Build-Depend on debhelper. -- Clint Adams Mon, 23 Sep 2002 00:18:25 -0400 bogofilter (0.7.4-4) unstable; urgency=low * Drop 'debug', support 'noopt' in DEB_BUILD_OPTIONS. -- Clint Adams Sun, 22 Sep 2002 18:20:06 -0400 bogofilter (0.7.4-3) unstable; urgency=low * Use more liberal tokenization in the lexer, so that all manner of high-bit characters will be treated as parts of words. Hopefully this doesn't break much. closes: #161019. -- Clint Adams Sun, 22 Sep 2002 17:38:20 -0400 bogofilter (0.7.4-2) unstable; urgency=medium * Refix manpage typos. -- Clint Adams Sat, 21 Sep 2002 03:25:55 -0400 bogofilter (0.7.4-1) unstable; urgency=low * New upstream release. -- Clint Adams Fri, 20 Sep 2002 22:14:36 -0400 bogofilter (0.7-6) unstable; urgency=medium * Don't segfault when HOME is unset. closes: bug#161084. -- Clint Adams Mon, 16 Sep 2002 19:11:04 -0400 bogofilter (0.7-5) unstable; urgency=medium * Check for reverse wraparound (but not forward wraparound). closes: bug#160979. -- Clint Adams Sun, 15 Sep 2002 15:28:22 -0400 bogofilter (0.7-4) unstable; urgency=medium * Fix segfault when using bogofilter -d. closes: bug#160413. Beware; -d is still a bit temperamental. -- Clint Adams Wed, 11 Sep 2002 12:16:14 -0400 bogofilter (0.7-3) unstable; urgency=low * Really fix manpage typos this time. closes: #160237. -- Clint Adams Tue, 10 Sep 2002 15:58:47 -0400 bogofilter (0.7-2) unstable; urgency=low * Fix several manpage typos. -- Clint Adams Mon, 9 Sep 2002 11:58:28 -0400 bogofilter (0.7-1) unstable; urgency=low * New upstream release. This gets rid of the autodaemon, thus it closes: bug#159937. * Include TODO and the changelog, now that they're included in the tarball. * Update to Standards-Version 3.5.7. * New build-dep on libdb4.0-dev. -- Clint Adams Sat, 7 Sep 2002 19:04:15 -0400 bogofilter (0.6-2) unstable; urgency=low * Logic inversion patch from Frank Copeland. -- Clint Adams Sun, 1 Sep 2002 13:48:25 -0400 bogofilter (0.6-1) unstable; urgency=low * New upstream release. -- Clint Adams Fri, 30 Aug 2002 13:25:50 -0400 bogofilter (0.5-1) unstable; urgency=low * New upstream release. -- Clint Adams Thu, 29 Aug 2002 19:27:16 -0400 bogofilter (0.4-1) unstable; urgency=low * Initial Release. closes: #157878. -- Clint Adams Thu, 29 Aug 2002 20:56:36 +0000 bogofilter-1.2.4/debian/bogofilter-common.NEWS0000644000175000017500000000110011664467503017404 0ustar sezsezbogofilter (1.2.0-2) unstable; urgency=low * You may now use update-alternatives to choose another than the default db backend. For instance, to switch the backend to sqlite, install bogofilter-sqlite and run as root: update-alternatives --set bogofilter /usr/bin/bogofilter-sqlite Bear in mind that, to switch to a different backend you have to dump your word lists using bogoutil of the old backend, and and load your word lists again using bogoutil of the new backend. -- Serafeim Zanikolas Wed, 06 May 2009 22:55:15 +0200 bogofilter-1.2.4/debian/bogofilter-common.examples0000644000175000017500000000003611664467503020455 0ustar sezsezcontrib bogofilter.cf.example bogofilter-1.2.4/debian/bogofilter-common.manpages0000644000175000017500000000026511664467570020442 0ustar sezsezobj-db/doc/bogoutil.1 obj-db/doc/bogoupgrade.1 obj-db/doc/bf_tar.1 obj-db/doc/bf_copy.1 obj-db/doc/bf_compact.1 obj-db/doc/bogofilter.1 obj-db/doc/bogolexer.1 obj-db/doc/bogotune.1 bogofilter-1.2.4/debian/bogofilter-common.docs0000644000175000017500000000035711664467503017575 0ustar sezsezTODO AUTHORS RELEASE.NOTES README GETTING.STARTED doc/integrating-with-postfix doc/integrating-with-qmail doc/bogofilter-tuning.HOWTO.html doc/bogofilter-faq.html doc/bogotune-faq.html doc/bogofilter-faq-fr.html doc/bogofilter-faq-it.html bogofilter-1.2.4/debian/source/0000755000175000017500000000000011664467503014574 5ustar sezsezbogofilter-1.2.4/debian/source/format0000644000175000017500000000001411664467503016002 0ustar sezsez3.0 (quilt) bogofilter-1.2.4/debian/control0000644000175000017500000000726412057700523014675 0ustar sezsezSource: bogofilter Section: mail Priority: optional Maintainer: Serafeim Zanikolas Build-Depends: debhelper (>= 7), libdb-dev (>= 4.6.19), libgsl0-dev, libsqlite3-dev, libtokyocabinet-dev Standards-Version: 3.9.2 Vcs-Git: git://git.debian.org/collab-maint/bogofilter.git Vcs-Browser: http://git.debian.org/?p=collab-maint/bogofilter.git Package: bogofilter Architecture: any Depends: ${misc:Depends}, bogofilter-common, bogofilter-bdb | bogofilter-db Description: fast Bayesian spam filter (dummy package) This package implements a fast Bayesian spam filter along the lines suggested by Paul Graham in his article "A Plan For Spam". . This version substantially improves on Paul's proposal by doing smarter lexical analysis. In particular, hostnames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are discarded so as not to bloat the word lists. Package: bogofilter-bdb Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends}, bogofilter-common Suggests: db5.1-util Provides: bogofilter-db Replaces: bogofilter (<< 0.94.14-1) Description: fast Bayesian spam filter (Berkeley DB) This package implements a fast Bayesian spam filter along the lines suggested by Paul Graham in his article "A Plan For Spam". . This version substantially improves on Paul's proposal by doing smarter lexical analysis. In particular, hostnames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are discarded so as not to bloat the word lists. . This package provides the bdb database backend. Package: bogofilter-sqlite Priority: extra Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends}, bogofilter-common Provides: bogofilter-db Description: fast Bayesian spam filter (sqlite) This package implements a fast Bayesian spam filter along the lines suggested by Paul Graham in his article "A Plan For Spam". . This version substantially improves on Paul's proposal by doing smarter lexical analysis. In particular, hostnames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are discarded so as not to bloat the word lists. . This package provides the sqlite database backend. Package: bogofilter-tokyocabinet Priority: extra Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends}, bogofilter-common Provides: bogofilter-db Description: fast Bayesian spam filter (tokyocabinet) This package implements a fast Bayesian spam filter along the lines suggested by Paul Graham in his article "A Plan For Spam". . This version substantially improves on Paul's proposal by doing smarter lexical analysis. In particular, hostnames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are discarded so as not to bloat the word lists. . This package provides the tokyocabinet backend. Package: bogofilter-common Architecture: all Depends: ${misc:Depends} Suggests: doc-base Replaces: bogofilter (<< 0.94.14-1) Description: fast Bayesian spam filter (common files) This package implements a fast Bayesian spam filter along the lines suggested by Paul Graham in his article "A Plan For Spam". . This version substantially improves on Paul's proposal by doing smarter lexical analysis. In particular, hostnames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are discarded so as not to bloat the word lists. . This package provides files that are common for all database backends. bogofilter-1.2.4/debian/bogofilter-bdb.dirs0000644000175000017500000000001011664467503017027 0ustar sezsezusr/bin bogofilter-1.2.4/debian/patches/0000755000175000017500000000000012057572472014722 5ustar sezsezbogofilter-1.2.4/debian/patches/series0000644000175000017500000000006012057572472016133 0ustar sezsezsa-2012-01-fix.diff use-tar-instead-of-pax.diff bogofilter-1.2.4/debian/patches/use-tar-instead-of-pax.diff0000644000175000017500000000170711664467503021757 0ustar sezsez# Description: make bf_tar use tar instead of pax to drop "Suggests: pax" # Bug-Debian: http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=341973 # Forwarded: not-needed # Author: Serafeim Zanikolas # Last-Update: 2009-08-01 Index: bogofilter/src/bf_tar =================================================================== --- bogofilter.orig/src/bf_tar.in 2009-07-13 22:30:30.000000000 +0200 +++ bogofilter/src/bf_tar.in 2009-07-13 22:30:49.000000000 +0200 @@ -61,12 +61,13 @@ # that state will not be recoverable! # # pax options: -w: write archive, -v: verbosely, -x ustar: pick tar format. -( +files=$( c="${BOGOHOME}/DB_CONFIG" if [ -f "$c" ] ; then echo "$c" ; fi $BOGOFILTER -QQ -d "$BOGOHOME" | grep '^wordlist ' | cut -f3 -d, $BOGOUTIL --db-list-logfiles="$BOGOHOME" all -) | pax -w -v -x ustar +) +tar --create --to-stdout --verbose --format=ustar $files # remove if requested if [ $REMOVEAFT -eq 1 ] ; then nukelogs ; fi bogofilter-1.2.4/debian/patches/sa-2012-01-fix.diff0000644000175000017500000000433512057572472017550 0ustar sezsez# Description: apply fix and test for CVE-2012-5468 (aka bogofilter-SA-2012-01) # Bug-Debian: http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=695139 # Author: Matthias Andree # Last-Update: 2012-12-03 --- a/src/iconvert.c +++ b/src/iconvert.c @@ -76,7 +76,7 @@ outbuf = (char *)dst->t.u.text + dst->t.leng; outbytesleft = dst->size - dst->read - dst->t.leng; - if (outbytesleft == 0) + if (outbytesleft <= 0) break; /* @@ -141,6 +141,10 @@ switch (err) { case EILSEQ: /* invalid multibyte sequence */ case EINVAL: /* incomplete multibyte sequence */ + if(outbytesleft <= 0) { + done = true; + break; + } /* copy 1 byte (or substitute a '?') */ if (!replace_nonascii_characters) *outbuf = *inbuf; --- a/src/tests/Makefile.am +++ b/src/tests/Makefile.am @@ -45,6 +45,7 @@ t.multiple.tokens.head t.multiple.tokens.body t.multiple.tokens.min.mul \ $(ENCODING_TESTS) \ t.rfc2047_broken t.rfc2047_folded \ + t.crash-invalid-base64 \ t.message_addr t.message_id t.queue_id WORDLIST_TESTS = t.dump.load t.nonascii.replace t.maint t.robx t.regtest t.upgrade.subnet.prefix t.multiple.wordlists t.probe t.bf_compact --- /dev/null +++ b/src/tests/t.crash-invalid-base64 @@ -0,0 +1,21 @@ +#! /bin/sh + +. ${srcdir:=.}/t.frame + +# make sure that we do not crash on excessively long tokens +# Test program by Julius Plenz, TU Berlin. +perl -e ' +print < /dev/null --- a/src/tests/Makefile.in +++ b/src/tests/Makefile.in @@ -269,6 +269,7 @@ t.multiple.tokens.head t.multiple.tokens.body t.multiple.tokens.min.mul \ $(ENCODING_TESTS) \ t.rfc2047_broken t.rfc2047_folded \ + t.crash-invalid-base64 \ t.message_addr t.message_id t.queue_id WORDLIST_TESTS = t.dump.load t.nonascii.replace t.maint t.robx t.regtest t.upgrade.subnet.prefix t.multiple.wordlists t.probe t.bf_compact bogofilter-1.2.4/debian/bogofilter-bdb.postinst0000755000175000017500000000152412057700523017754 0ustar sezsez#!/bin/sh set -e util=bdb #DEBHELPER# case "$1" in configure|abort-upgrade) update-alternatives --quiet --install \ /usr/bin/bogofilter bogofilter /usr/bin/bogofilter-${util} 20 \ --slave /usr/bin/bogoupgrade bogoupgrade /usr/bin/bogoupgrade-${util} \ --slave /usr/bin/bogotune bogotune /usr/bin/bogotune-${util} \ --slave /usr/bin/bf_copy bf_copy /usr/bin/bf_copy-${util} \ --slave /usr/bin/bogolexer bogolexer /usr/bin/bogolexer-${util} \ --slave /usr/bin/bogoutil bogoutil /usr/bin/bogoutil-${util} \ --slave /usr/bin/bf_compact bf_compact /usr/bin/bf_compact-${util} \ --slave /usr/bin/bf_tar bf_tar /usr/bin/bf_tar-${util} ;; *) echo "postint called with unknown argument \`$1'" >&2 exit 1 ;; esac bogofilter-1.2.4/debian/compat0000644000175000017500000000000211664467503014472 0ustar sezsez7 bogofilter-1.2.4/debian/bogofilter-common.doc-base.bogofilter-faq-it0000644000175000017500000000042511664467503023630 0ustar sezsezDocument: bogofilter-faq-it Title: Bogofilter FAQ (Italian) Author: David Relson Abstract: FAQ in Italian Section: Network/Communication Format: HTML Index: /usr/share/doc/bogofilter-common/bogofilter-faq-it.html Files: /usr/share/doc/bogofilter-common/bogofilter-faq-it.html bogofilter-1.2.4/debian/bogofilter-common.doc-base.bogofilter-tuning-howto0000644000175000017500000000144611664467503025115 0ustar sezsezDocument: bogofilter-tuning-howto Title: Tuning Bogofilter's Robinson-Fisher Method -- An Updated HOWTO Author: Greg Louis Abstract: Bogotune is a tool (shipped with bogofilter) that automates the tuning process. Its "full search" mode performs a five-dimensional grid search over possible values of the parameters to be described in this howto, and comes up with recommendations for optimal settings. There's also a "partial search" mode that is only three-dimensional. If you have enough spam and nonspam messages (at least 2,500 of each), using bogotune is highly recommended for optimizing bogofilter's accuracy. Section: Network/Communication Format: HTML Index: /usr/share/doc/bogofilter-common/bogofilter-tuning.HOWTO.html Files: /usr/share/doc/bogofilter-common/bogofilter-tuning.HOWTO.html bogofilter-1.2.4/debian/bogofilter-sqlite.postinst0000755000175000017500000000152712057700523020531 0ustar sezsez#!/bin/sh set -e util=sqlite #DEBHELPER# case "$1" in configure|abort-upgrade) update-alternatives --quiet --install \ /usr/bin/bogofilter bogofilter /usr/bin/bogofilter-${util} 20 \ --slave /usr/bin/bogoupgrade bogoupgrade /usr/bin/bogoupgrade-${util} \ --slave /usr/bin/bogotune bogotune /usr/bin/bogotune-${util} \ --slave /usr/bin/bf_copy bf_copy /usr/bin/bf_copy-${util} \ --slave /usr/bin/bogolexer bogolexer /usr/bin/bogolexer-${util} \ --slave /usr/bin/bogoutil bogoutil /usr/bin/bogoutil-${util} \ --slave /usr/bin/bf_compact bf_compact /usr/bin/bf_compact-${util} \ --slave /usr/bin/bf_tar bf_tar /usr/bin/bf_tar-${util} ;; *) echo "postint called with unknown argument \`$1'" >&2 exit 1 ;; esac bogofilter-1.2.4/debian/bogofilter-common.doc-base.bogofilter-faq-en0000644000175000017500000000041711664467503023617 0ustar sezsezDocument: bogofilter-faq-en Title: Bogofilter FAQ (English) Author: David Relson Abstract: FAQ in English Section: Network/Communication Format: HTML Index: /usr/share/doc/bogofilter-common/bogofilter-faq.html Files: /usr/share/doc/bogofilter-common/bogofilter-faq.html bogofilter-1.2.4/debian/rules0000755000175000017500000000701612061106346014343 0ustar sezsez#!/usr/bin/make -f #export DH_VERBOSE=1 export CONFIG_SHELL=/bin/bash derives_from_ubuntu := $(shell (dpkg-vendor --derives-from ubuntu && echo yes) || echo no) ifeq ($(derives_from_ubuntu),yes) DO_TOKYOCABINET = no export DH_OPTIONS := -Nbogofilter-tokyocabinet else DO_TOKYOCABINET = yes endif ifeq (,$(filter nocheck,$(DEB_BUILD_OPTIONS))) TESTS_TARGET = check else TESTS_TARGET = endif configure: configure-stamp configure-stamp: dh_testdir mkdir obj-db obj-sqlite cd obj-db && ../configure --with-database=db \ --prefix=/usr --mandir=\$${prefix}/share/man --sysconfdir=/etc \ AWK=awk $(shell dpkg-buildflags --export=configure) cd obj-sqlite && ../configure --with-database=sqlite \ --program-suffix=-sqlite --prefix=/usr --mandir=\$${prefix}/share/man \ --sysconfdir=/etc AWK=awk $(shell dpkg-buildflags --export=configure) && \ sed -i 's/^INTEGRITY_TESTS.*/INTEGRITY_TESTS=t.lock1/' src/tests/Makefile if [ $(DO_TOKYOCABINET) = yes ]; then \ mkdir obj-tokyocabinet; \ cd obj-tokyocabinet && ../configure \ --with-database=tokyocabinet --program-suffix=-tokyocabinet \ --prefix=/usr --mandir=\$${prefix}/share/man --sysconfdir=/etc AWK=awk \ $(shell dpkg-buildflags --export=configure); \ fi touch configure-stamp build: build-stamp build-stamp: configure-stamp dh_testdir cd obj-db && $(MAKE) cd obj-sqlite && $(MAKE) if [ $(DO_TOKYOCABINET) = yes ]; then \ cd obj-tokyocabinet && $(MAKE); \ fi touch build-stamp clean: dh_testdir rm -f build-stamp configure-stamp config.h.in debian/*debhelper.log \ debian/*.substvars debian/bogofilter.substvars \ debian/files debian/bogofilter-bdb.substvars \ debian/bogofilter-sqlite.substvars rm -rf debian/bogofilter debian/bogofilter-bdb \ debian/bogofilter-sqlite debian/bogofilter-common \ obj-db obj-sqlite if [ $(DO_TOKYOCABINET) = yes ]; then \ rm -rf debian/bogofilter-tokyocabinet obj-tokyocabinet \ debian/bogofilter-tokyocabinet.substvars; \ fi check: dh_testdir cd obj-db && $(MAKE) check cd obj-sqlite && $(MAKE) check if [ $(DO_TOKYOCABINET) = yes ]; then \ cd obj-tokyocabinet && $(MAKE) check; \ fi PACKAGES = bdb sqlite ifeq ($(DO_TOKYOCABINET),yes) PACKAGES += tokyocabinet endif PROGRAMS = bf_compact bf_copy bf_tar bogofilter bogolexer bogotune \ bogoupgrade bogoutil binary-arch: build $(TESTS_TARGET) dh_testdir dh_testroot dh_installchangelogs dh_installdirs # rename binaries: util becomes util-pkg test -e obj-bdb || ln -s obj-db obj-bdb for p in ${PACKAGES}; do \ for i in ${PROGRAMS}; do \ (set -e; cp obj-$${p}/src/$${i} debian/bogofilter-$${p}/usr/bin/$${i}-$${p}) \ done \ done rm -f obj-bdb cp bogofilter.cf.example debian/bogofilter-common/etc/bogofilter.cf dh_installman dh_compress dh_installdocs # installdocs copies copyright/changelog in doc/bogofilter # but we really want it to be a symlink to doc/bogofilter-common rm -rf debian/bogofilter/usr/share/doc/bogofilter dh_link dh_installexamples dh_fixperms chmod 755 debian/bogofilter-common/usr/share/doc/bogofilter-common/examples/contrib/bogominitrain.pl mv debian/bogofilter-common/usr/share/doc/bogofilter-common/examples/contrib/*example \ debian/bogofilter-common/usr/share/doc/bogofilter-common/examples dh_strip dh_installdeb dh_shlibdeps dh_gencontrol dh_md5sums dh_builddeb # TODO: fix Package builds NAME_all.deb when binary-indep target is not called build: build-arch build-indep build-arch: build-stamp build-indep: build-stamp binary: binary-indep binary-arch .PHONY: build clean binary-indep binary-arch binary install configure bogofilter-1.2.4/debian/bogofilter-bdb.prerm0000755000175000017500000000045212057700523017215 0ustar sezsez#!/bin/sh set -e util=bdb #DEBHELPER# case "$1" in remove|deconfigure) if update-alternatives --list bogofilter | grep -q bogofilter-${util}; then update-alternatives --quiet --remove bogofilter "/usr/bin/bogofilter-${util}" fi ;; *) ;; esac bogofilter-1.2.4/debian/bogofilter-common.README.Debian0000644000175000017500000000031111664467503020751 0ustar sezsezIf mutt's pipe_decode option is on, information will be lost when piping messages to bogofilter. This is the default in the distributed /etc/Muttrc. It is HIGHLY recommended that this be turned off. bogofilter-1.2.4/debian/README.source0000644000175000017500000000022612057700523015440 0ustar sezsezThe upstream source has been repackaged without these non-DFSG-free licensed files: bogofilter-SA-2005-01 bogofilter-SA-2010-01 bogofilter-SA-2005-02 bogofilter-1.2.4/debian/bogofilter-bdb.preinst0000755000175000017500000000017112057700523017552 0ustar sezsez#!/bin/sh set -e #DEBHELPER# if [ -L /usr/share/doc/bogofilter-bdb ]; then rm -f /usr/share/doc/bogofilter-bdb fi bogofilter-1.2.4/debian/bogofilter-tokyocabinet.links0000644000175000017500000000120211664467503021156 0ustar sezsezusr/share/man/man1/bogofilter.1.gz usr/share/man/man1/bogofilter-tokyocabinet.1.gz usr/share/man/man1/bf_compact.1.gz usr/share/man/man1/bf_compact-tokyocabinet.1.gz usr/share/man/man1/bf_copy.1.gz usr/share/man/man1/bf_copy-tokyocabinet.1.gz usr/share/man/man1/bf_tar.1.gz usr/share/man/man1/bf_tar-tokyocabinet.1.gz usr/share/man/man1/bogolexer.1.gz usr/share/man/man1/bogolexer-tokyocabinet.1.gz usr/share/man/man1/bogotune.1.gz usr/share/man/man1/bogotune-tokyocabinet.1.gz usr/share/man/man1/bogoupgrade.1.gz usr/share/man/man1/bogoupgrade-tokyocabinet.1.gz usr/share/man/man1/bogoutil.1.gz usr/share/man/man1/bogoutil-tokyocabinet.1.gz bogofilter-1.2.4/debian/bogofilter-common.dirs0000644000175000017500000000003111664467503017573 0ustar sezsezetc/ usr/share/man/man1/ bogofilter-1.2.4/aclocal.m40000644000175000017500000010534012163573270013707 0ustar sezsez# generated automatically by aclocal 1.12.6 -*- Autoconf -*- # Copyright (C) 1996-2012 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],, [m4_warning([this file was generated for autoconf 2.69. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically 'autoreconf'.])]) # Copyright (C) 2002-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.12' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.12.6], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.12.6])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to '$srcdir/foo'. In other projects, it is set to # '$srcdir', '$srcdir/..', or '$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is '.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl m4_if([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # There are a few dirty hacks below to avoid letting 'AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "OBJC", "OBJCXX", "UPC", or "GJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl m4_if([$1], [CC], [depcc="$CC" am_compiler_list=], [$1], [CXX], [depcc="$CXX" am_compiler_list=], [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], [OBJCXX], [depcc="$OBJCXX" am_compiler_list='gcc3 gcc'], [$1], [UPC], [depcc="$UPC" am_compiler_list=], [$1], [GCJ], [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES. AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE([dependency-tracking], [dnl AS_HELP_STRING( [--enable-dependency-tracking], [do not reject slow dependency extractors]) AS_HELP_STRING( [--disable-dependency-tracking], [speeds up one-time build])]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl AC_SUBST([am__nodep])dnl _AM_SUBST_NOTMAKE([am__nodep])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named 'Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running 'make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each '.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.62])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [AC_DIAGNOSE([obsolete], [$0: two- and three-arguments forms are deprecated. For more info, see: http://www.gnu.org/software/automake/manual/automake.html#Modernize-AM_INIT_AUTOMAKE-invocation]) m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if( m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]), [ok:ok],, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package]) AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}]) AM_MISSING_PROG([AUTOCONF], [autoconf]) AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}]) AM_MISSING_PROG([AUTOHEADER], [autoheader]) AM_MISSING_PROG([MAKEINFO], [makeinfo]) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # AC_SUBST([mkdir_p], ['$(MKDIR_P)']) # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES([CC])], [m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES([CXX])], [m4_define([AC_PROG_CXX], m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES([OBJC])], [m4_define([AC_PROG_OBJC], m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl dnl Support for Objective C++ was only introduced in Autoconf 2.65, dnl but we still cater to Autoconf 2.62. m4_ifdef([AC_PROG_OBJCXX], [AC_PROVIDE_IFELSE([AC_PROG_OBJCXX], [_AM_DEPENDENCIES([OBJCXX])], [m4_define([AC_PROG_OBJCXX], m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])])dnl ]) _AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl dnl The 'parallel-tests' driver may need to know about EXEEXT, so add the dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro dnl is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl ]) dnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST([install_sh])]) # Copyright (C) 2003-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Copyright (C) 1998-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_LEX # ----------- # Autoconf leaves LEX=: if lex or flex can't be found. Change that to a # "missing" invocation, for better error output. AC_DEFUN([AM_PROG_LEX], [AC_PREREQ([2.50])dnl AC_REQUIRE([AM_MISSING_HAS_RUN])dnl AC_REQUIRE([AC_PROG_LEX])dnl if test "$LEX" = :; then LEX=${am_missing_run}flex fi]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from 'make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it supports --run. # If it does, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= AC_MSG_WARN(['missing' script is too old or missing]) fi ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # -------------------- # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), [1])]) # _AM_SET_OPTIONS(OPTIONS) # ------------------------ # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);; esac # Do 'set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi if test "$[2]" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT([yes]) # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi AC_CONFIG_COMMANDS_PRE( [AC_MSG_CHECKING([that generated files are newer than configure]) if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi AC_MSG_RESULT([done])]) rm -f conftest.file ]) # Copyright (C) 2001-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor 'install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in "make install-strip", and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using 'strip' when the user # run "make install-strip". However 'strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the 'STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be 'maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # -------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004-2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of 'v7', 'ustar', or 'pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AC_SUBST([AMTAR], ['$${TAR-tar}']) m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar],, [pax],, [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' _am_tools=${am_cv_prog_tar_$1-$_am_tools} # Do not fold the above two line into one, because Tru64 sh and # Solaris sh will not grok spaces in the rhs of '-'. for _am_tool in $_am_tools do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR m4_include([m4/gsl.m4]) m4_include([m4/iconv.m4]) m4_include([m4/lib-ld.m4]) m4_include([m4/lib-link.m4]) m4_include([m4/lib-prefix.m4]) m4_include([m4/stdbool.m4]) bogofilter-1.2.4/Makefile.am0000644000175000017500000001317712163572311014104 0ustar sezsez# $Id: Makefile.am 6787 2009-02-09 09:00:24Z m-a $ # search path for m4 macros ACLOCAL_AMFLAGS = -I m4 SUBDIRS = trio src . doc SYSCONFDIR = @sysconfdir@ # what to build sysconf_DATA= bogofilter.cf.example # ChangeLog, cvs2cl lives at http://www.red-bean.com/cvs2cl .PHONY: $(srcdir)/changelog.txt $(srcdir)/changelog.txt: test -f $@ || : >$@ || { rm -f $@ ; exit 1; } ( cd $(srcdir) && cvs2cl.pl --fsf --accum --utc --file changelog.txt ) # what to distribute EXTRA_DIST= autogen.sh gsl config.rpath \ bogofilter.cf.example \ bogofilter.spec bogofilter.spec.in \ Doxyfile gpl-3.0.txt gnugetopt \ GETTING.STARTED \ NEWS.0 \ README.svn \ RELEASE.NOTES \ install-staticdblibs.sh .PHONY: check rpm svn-check # # RPM building - there are some cheats here # # BF_ZAP_LIBDB is a magic variable we check from configure.ac, # which zaps LIBDB and allows us to override the library choice # through LIBS=... # # Passing -ldb-4.2 (for the second -tb line) will fail on systems that # don't have libdb-4.2.* in the default library path that "ld" uses. # Install your system's db42 and db42-devel packages and retry. # Using -ldb-4.2 is indispensable as systems with db 4.3 or 4.4 would # otherwise pick the newer one as their default, but we must match # the library between shared and static RPM so that users can switch # forth and back without difficulties such as dumping and reloading # the database. # # CPPFLAGS=-D__NO_CTYPE tells glibc to use the older glibc 2.2.X # ctype implementation (functions). Else glibc would use a newer # 2.3.X ctype implementation, and as this is the only module that # requires 2.3.X in our code, we just use the 2.2.X version instead. # This works up to and including 2.3.5, the newest glibc version # available at the time this code was written. # # RPM and GPG-AGENT # ================= # Using the GnuPG agent requires some fiddling, as RPM has no native # support. # # 1. add these lines to your ~/.rpmmacros: # # %__gpg_check_password_cmd %{__gpg} gpg --batch --no-verbose \ # --use-agent -u "%{_gpg_name}" -so - # %__gpg_sign_cmd %{__gpg} gpg --batch --no-verbose \ # --no-armor --use-agent --no-secmem-warning -u "%{_gpg_name}" \ # -sbo %{__signature_filename} %{__plaintext_filename} # # 2. launch the GnuPG agent, unless already running: # eval $(gpg-agent --sh --daemon) # # 3. run "setsid make rpm /dev/null" # DBPFX=/opt/db-4.2-lean SQPFX=/opt/sqlite-3-lean DBLIB=$(DBPFX)/lib/libdb.a SQLIB=$(SQPFX)/lib/libsqlite3.a DEF_DB42=--define 'with_db42 1' DEF_SQLITE=--define 'with_sqlite 1' DEF_STATIC=--define 'bf_nameext -static' SIGN=--sign # rpm: dist @echo @echo "Note: if 'make rpm' fails, check the top-level Makefile.am for documentation." @echo @echo "Note: see Makefile.am comments for information on how to use the GnuPG agent." @echo @sleep 5 $(RPMBUILD) $(SIGN) -ts $(distdir).tar.gz if test ! -f $(DBLIB) || test ! -f $(SQLIB) || objdump -t $(SQLIB) | grep -q __ctype_b_loc ; then \ echo >&2 "Please run the install-staticdblibs.sh script first." ; exit 1 ; fi BF_ZAP_LIBDB=zap CPPFLAGS="-D__NO_CTYPE -I$(DBPFX)/include" LIBS=$(DBLIB) \ $(RPMBUILD) $(DEF_STATIC) $(DEF_DB42) $(SIGN) -tb $(distdir).tar.gz BF_ZAP_LIBDB=zap CPPFLAGS="-D__NO_CTYPE -I$(SQPFX)/include" LIBS="$(SQLIB) -ldl" \ $(RPMBUILD) $(DEF_STATIC) $(DEF_SQLITE) $(SIGN) -tb $(distdir).tar.gz @echo @echo "Now building the shared database library RPMs - this may fail" @echo "if system-wide library installs of BerkeleyDB 4.2 or SQLite 3" @echo "are missing from your system. The static RPMs that have just" @echo "been built are ready to go however." @echo @sleep 5 - CPPFLAGS="-D__NO_CTYPE -I$(DBPFX)" LIBS="-ldb-4.2 -pthread" \ $(RPMBUILD) $(DEF_DB42) $(SIGN) -tb $(distdir).tar.gz - CPPFLAGS="-D__NO_CTYPE -I$(SQPFX)" \ $(RPMBUILD) $(DEF_SQLITE) $(SIGN) -tb $(distdir).tar.gz svn-check: rm -rf $(PACKAGE)-$(VERSION)-export svn export -rBASE $(srcdir) $(PACKAGE)-$(VERSION)-export cd $(PACKAGE)-$(VERSION)-export && autoreconf -i -f -s -v \ && ./configure && make distcheck # this target expects a .rsyncs file with lines of this format: # host:directory/ # it will call rsync from its source directory to the destination for # each of them, running them in parallel .PHONY: rsync rsynconly rsync: distdir rsynconly rsynconly: .rsyncs @( cat $(srcdir)/.rsyncs | sed -e 's}^}rsync -av -e ssh --delete $(PACKAGE)-$(VERSION)/ }; s/\($$\)/ \&/;' ; echo "wait" ) | $(SHELL) -x dist-hook: cd $(distdir) && find doc gnugetopt gsl '(' -name .svn -o -name CVS ')' -type d -prune -exec rm -rf '{}' + cd $(distdir) && find doc gnugetopt gsl -name '.#*' -type f -exec rm '{}' ';' rm -f $(distdir)/doc/.cvsignore $(distdir)/ChangeLog # --------------------------------------------------------------------- # This section deals with the contrib/ directory # noinst_PROGRAMS=bogogrep bogogrep_SOURCES=contrib/bogogrep.c if ENABLE_STATIC noinst_PROGRAMS+=bogogrep_static bogogrep_static_SOURCES=contrib/bogogrep.c bogogrep_static_LDFLAGS=$(STATICLDFLAGS) endif EXTRA_DIST+= \ contrib/README.contrib \ contrib/README.randomtrain \ contrib/bogo.R \ contrib/bfproxy.pl \ contrib/bogofilter-milter.pl \ contrib/bogofilter-qfe.sh \ contrib/bogominitrain.pl \ contrib/dot-qmail-bogofilter-default \ contrib/mailfilter.example \ contrib/mime.get.rfc822.pl \ contrib/parmtest.sh \ contrib/printmaildir.pl \ contrib/procmailrc.example \ contrib/randomtrain.sh \ contrib/scramble.sh \ contrib/spamitarium.pl \ contrib/stripsearch.pl \ contrib/trainbogo.sh \ contrib/vm-bogofilter.el # --------------------------------------------------------------------- bogofilter-1.2.4/trio/0000755000175000017500000000000012164443243013016 5ustar sezsezbogofilter-1.2.4/trio/trionan.c0000644000175000017500000007111312163572311014635 0ustar sezsez/************************************************************************* * * $Id: trionan.c,v 1.33 2005/05/29 11:57:25 breese Exp $ * * Copyright (C) 2001 Bjorn Reese * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************ * * Functions to handle special quantities in floating-point numbers * (that is, NaNs and infinity). They provide the capability to detect * and fabricate special quantities. * * Although written to be as portable as possible, it can never be * guaranteed to work on all platforms, as not all hardware supports * special quantities. * * The approach used here (approximately) is to: * * 1. Use C99 functionality when available. * 2. Use IEEE 754 bit-patterns if possible. * 3. Use platform-specific techniques. * ************************************************************************/ /************************************************************************* * Include files */ #include "triodef.h" #include "trionan.h" #include #include #include #if !defined(TRIO_PLATFORM_SYMBIAN) # include #endif #if defined(TRIO_PLATFORM_UNIX) # include #endif #if defined(TRIO_COMPILER_DECC) # include #endif #include #if defined(TRIO_DOCUMENTATION) # include "doc/doc_nan.h" #endif /** @addtogroup SpecialQuantities @{ */ /************************************************************************* * Definitions */ #if !defined(TRIO_PUBLIC_NAN) # define TRIO_PUBLIC_NAN TRIO_PUBLIC #endif #if !defined(TRIO_PRIVATE_NAN) # define TRIO_PRIVATE_NAN TRIO_PRIVATE #endif #define TRIO_TRUE (1 == 1) #define TRIO_FALSE (0 == 1) /* * We must enable IEEE floating-point on Alpha */ #if defined(__alpha) && !defined(_IEEE_FP) # if defined(TRIO_COMPILER_DECC) # if defined(TRIO_PLATFORM_VMS) # error "Must be compiled with option /IEEE_MODE=UNDERFLOW_TO_ZERO/FLOAT=IEEE" # else # if !defined(_CFE) # error "Must be compiled with option -ieee" # endif # endif # else # if defined(TRIO_COMPILER_GCC) # error "Must be compiled with option -mieee" # endif # endif #endif /* __alpha && ! _IEEE_FP */ /* * In ANSI/IEEE 754-1985 64-bits double format numbers have the * following properties (amoungst others) * * o FLT_RADIX == 2: binary encoding * o DBL_MAX_EXP == 1024: 11 bits exponent, where one bit is used * to indicate special numbers (e.g. NaN and Infinity), so the * maximum exponent is 10 bits wide (2^10 == 1024). * o DBL_MANT_DIG == 53: The mantissa is 52 bits wide, but because * numbers are normalized the initial binary 1 is represented * implicitly (the so-called "hidden bit"), which leaves us with * the ability to represent 53 bits wide mantissa. */ #if defined(__STDC_IEC_559__) # define TRIO_IEEE_754 #else # if (FLT_RADIX - 0 == 2) && (DBL_MAX_EXP - 0 == 1024) && (DBL_MANT_DIG - 0 == 53) # define TRIO_IEEE_754 # endif #endif /* * Determine which fpclassify_and_sign() function to use. */ #if defined(TRIO_FUNC_FPCLASSIFY_AND_SIGNBIT) # if defined(PREDEF_STANDARD_C99) && defined(fpclassify) # define TRIO_FUNC_C99_FPCLASSIFY_AND_SIGNBIT # else # if defined(TRIO_COMPILER_DECC) # define TRIO_FUNC_DECC_FPCLASSIFY_AND_SIGNBIT # else # if defined(TRIO_COMPILER_VISUALC) || defined(TRIO_COMPILER_BORLAND) # define TRIO_FUNC_MS_FPCLASSIFY_AND_SIGNBIT # else # if defined(TRIO_COMPILER_HP) && defined(FP_PLUS_NORM) # define TRIO_FUNC_HP_FPCLASSIFY_AND_SIGNBIT # else # if defined(TRIO_COMPILER_XLC) && defined(FP_PLUS_NORM) # define TRIO_FUNC_XLC_FPCLASSIFY_AND_SIGNBIT # else # define TRIO_FUNC_INTERNAL_FPCLASSIFY_AND_SIGNBIT # endif # endif # endif # endif # endif #endif /* * Determine how to generate negative zero. */ #if defined(TRIO_FUNC_NZERO) # if defined(TRIO_IEEE_754) # define TRIO_NZERO_IEEE_754 # else # define TRIO_NZERO_FALLBACK # endif #endif /* * Determine how to generate positive infinity. */ #if defined(TRIO_FUNC_PINF) # if defined(INFINITY) && defined(__STDC_IEC_559__) # define TRIO_PINF_C99_MACRO # else # if defined(TRIO_IEEE_754) # define TRIO_PINF_IEEE_754 # else # define TRIO_PINF_FALLBACK # endif # endif #endif /* * Determine how to generate NaN. */ #if defined(TRIO_FUNC_NAN) # if defined(PREDEF_STANDARD_C99) && !defined(TRIO_COMPILER_DECC) # define TRIO_NAN_C99_FUNCTION # else # if defined(NAN) && defined(__STDC_IEC_559__) # define TRIO_NAN_C99_MACRO # else # if defined(TRIO_IEEE_754) # define TRIO_NAN_IEEE_754 # else # define TRIO_NAN_FALLBACK # endif # endif # endif #endif /* * Resolve internal dependencies. */ #if defined(TRIO_FUNC_INTERNAL_FPCLASSIFY_AND_SIGNBIT) # define TRIO_FUNC_INTERNAL_ISNAN # define TRIO_FUNC_INTERNAL_ISINF # if defined(TRIO_IEEE_754) # define TRIO_FUNC_INTERNAL_IS_SPECIAL_QUANTITY # define TRIO_FUNC_INTERNAL_IS_NEGATIVE # endif #endif #if defined(TRIO_NZERO_IEEE_754) \ || defined(TRIO_PINF_IEEE_754) \ || defined(TRIO_NAN_IEEE_754) # define TRIO_FUNC_INTERNAL_MAKE_DOUBLE #endif #if defined(TRIO_FUNC_INTERNAL_ISNAN) # if defined(PREDEF_STANDARD_XPG3) # define TRIO_INTERNAL_ISNAN_XPG3 # else # if defined(TRIO_IEEE_754) # define TRIO_INTERNAL_ISNAN_IEEE_754 # else # define TRIO_INTERNAL_ISNAN_FALLBACK # endif # endif #endif #if defined(TRIO_FUNC_INTERNAL_ISINF) # if defined(TRIO_IEEE_754) # define TRIO_INTERNAL_ISINF_IEEE_754 # else # define TRIO_INTERNAL_ISINF_FALLBACK # endif #endif /************************************************************************* * Constants */ #if !defined(TRIO_EMBED_NAN) static TRIO_CONST char rcsid[] = "@(#)$Id: trionan.c,v 1.33 2005/05/29 11:57:25 breese Exp $"; #endif #if defined(TRIO_FUNC_INTERNAL_MAKE_DOUBLE) \ || defined(TRIO_FUNC_INTERNAL_IS_SPECIAL_QUANTITY) \ || defined(TRIO_FUNC_INTERNAL_IS_NEGATIVE) /* * Endian-agnostic indexing macro. * * The value of internalEndianMagic, when converted into a 64-bit * integer, becomes 0x0706050403020100 (we could have used a 64-bit * integer value instead of a double, but not all platforms supports * that type). The value is automatically encoded with the correct * endianess by the compiler, which means that we can support any * kind of endianess. The individual bytes are then used as an index * for the IEEE 754 bit-patterns and masks. */ #define TRIO_DOUBLE_INDEX(x) (((unsigned char *)&internalEndianMagic)[7-(x)]) static TRIO_CONST double internalEndianMagic = 7.949928895127363e-275; #endif #if defined(TRIO_FUNC_INTERNAL_IS_SPECIAL_QUANTITY) /* Mask for the exponent */ static TRIO_CONST unsigned char ieee_754_exponent_mask[] = { 0x7F, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; /* Mask for the mantissa */ static TRIO_CONST unsigned char ieee_754_mantissa_mask[] = { 0x00, 0x0F, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF }; #endif #if defined(TRIO_FUNC_INTERNAL_IS_NEGATIVE) /* Mask for the sign bit */ static TRIO_CONST unsigned char ieee_754_sign_mask[] = { 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; #endif #if defined(TRIO_NZERO_IEEE_754) /* Bit-pattern for negative zero */ static TRIO_CONST unsigned char ieee_754_negzero_array[] = { 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; #endif #if defined(TRIO_PINF_IEEE_754) /* Bit-pattern for infinity */ static TRIO_CONST unsigned char ieee_754_infinity_array[] = { 0x7F, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; #endif #if defined(TRIO_NAN_IEEE_754) /* Bit-pattern for quiet NaN */ static TRIO_CONST unsigned char ieee_754_qnan_array[] = { 0x7F, 0xF8, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; #endif /************************************************************************* * Internal functions */ /* * internal_make_double */ #if defined(TRIO_FUNC_INTERNAL_MAKE_DOUBLE) TRIO_PRIVATE_NAN double internal_make_double TRIO_ARGS1((values), TRIO_CONST unsigned char *values) { TRIO_VOLATILE double result; int i; for (i = 0; i < (int)sizeof(double); i++) { ((TRIO_VOLATILE unsigned char *)&result)[TRIO_DOUBLE_INDEX(i)] = values[i]; } return result; } #endif /* * internal_is_special_quantity */ #if defined(TRIO_FUNC_INTERNAL_IS_SPECIAL_QUANTITY) TRIO_PRIVATE_NAN int internal_is_special_quantity TRIO_ARGS2((number, has_mantissa), double number, int *has_mantissa) { unsigned int i; unsigned char current; int is_special_quantity = TRIO_TRUE; *has_mantissa = 0; for (i = 0; i < (unsigned int)sizeof(double); i++) { current = ((unsigned char *)&number)[TRIO_DOUBLE_INDEX(i)]; is_special_quantity &= ((current & ieee_754_exponent_mask[i]) == ieee_754_exponent_mask[i]); *has_mantissa |= (current & ieee_754_mantissa_mask[i]); } return is_special_quantity; } #endif /* * internal_is_negative */ #if defined(TRIO_FUNC_INTERNAL_IS_NEGATIVE) TRIO_PRIVATE_NAN int internal_is_negative TRIO_ARGS1((number), double number) { unsigned int i; int is_negative = TRIO_FALSE; for (i = 0; i < (unsigned int)sizeof(double); i++) { is_negative |= (((unsigned char *)&number)[TRIO_DOUBLE_INDEX(i)] & ieee_754_sign_mask[i]); } return is_negative; } #endif #if defined(TRIO_FUNC_C99_FPCLASSIFY_AND_SIGNBIT) TRIO_PRIVATE_NAN TRIO_INLINE int c99_fpclassify_and_signbit TRIO_ARGS2((number, is_negative), double number, int *is_negative) { *is_negative = signbit(number); switch (fpclassify(number)) { case FP_NAN: return TRIO_FP_NAN; case FP_INFINITE: return TRIO_FP_INFINITE; case FP_SUBNORMAL: return TRIO_FP_SUBNORMAL; case FP_ZERO: return TRIO_FP_ZERO; default: return TRIO_FP_NORMAL; } } #endif /* TRIO_FUNC_C99_FPCLASSIFY_AND_SIGNBIT */ #if defined(TRIO_FUNC_DECC_FPCLASSIFY_AND_SIGNBIT) TRIO_PRIVATE_NAN TRIO_INLINE int decc_fpclassify_and_signbit TRIO_ARGS2((number, is_negative), double number, int *is_negative) { switch (fp_class(number)) { case FP_QNAN: case FP_SNAN: *is_negative = TRIO_FALSE; /* NaN has no sign */ return TRIO_FP_NAN; case FP_POS_INF: *is_negative = TRIO_FALSE; return TRIO_FP_INFINITE; case FP_NEG_INF: *is_negative = TRIO_TRUE; return TRIO_FP_INFINITE; case FP_POS_DENORM: *is_negative = TRIO_FALSE; return TRIO_FP_SUBNORMAL; case FP_NEG_DENORM: *is_negative = TRIO_TRUE; return TRIO_FP_SUBNORMAL; case FP_POS_ZERO: *is_negative = TRIO_FALSE; return TRIO_FP_ZERO; case FP_NEG_ZERO: *is_negative = TRIO_TRUE; return TRIO_FP_ZERO; case FP_POS_NORM: *is_negative = TRIO_FALSE; return TRIO_FP_NORMAL; case FP_NEG_NORM: *is_negative = TRIO_TRUE; return TRIO_FP_NORMAL; default: *is_negative = (number < 0.0); return TRIO_FP_NORMAL; } } #endif /* TRIO_FUNC_DECC_FPCLASSIFY_AND_SIGNBIT */ #if defined(TRIO_FUNC_MS_FPCLASSIFY_AND_SIGNBIT) TRIO_PRIVATE_NAN int ms_fpclassify_and_signbit TRIO_ARGS2((number, is_negative), double number, int *is_negative) { int result; # if defined(TRIO_COMPILER_BORLAND) /* * The floating-point precision may be changed by the Borland _fpclass() * function, so we have to save and restore the floating-point control mask. */ unsigned int mask; /* Remember the old mask */ mask = _control87(0, 0); # endif switch (_fpclass(number)) { case _FPCLASS_QNAN: case _FPCLASS_SNAN: *is_negative = TRIO_FALSE; /* NaN has no sign */ result = TRIO_FP_NAN; break; case _FPCLASS_PINF: *is_negative = TRIO_FALSE; result = TRIO_FP_INFINITE; break; case _FPCLASS_NINF: *is_negative = TRIO_TRUE; result = TRIO_FP_INFINITE; break; case _FPCLASS_PD: *is_negative = TRIO_FALSE; result = TRIO_FP_SUBNORMAL; break; case _FPCLASS_ND: *is_negative = TRIO_TRUE; result = TRIO_FP_SUBNORMAL; break; case _FPCLASS_PZ: *is_negative = TRIO_FALSE; result = TRIO_FP_ZERO; break; case _FPCLASS_NZ: *is_negative = TRIO_TRUE; result = TRIO_FP_ZERO; break; case _FPCLASS_PN: *is_negative = TRIO_FALSE; result = TRIO_FP_NORMAL; break; case _FPCLASS_NN: *is_negative = TRIO_TRUE; result = TRIO_FP_NORMAL; break; default: *is_negative = (number < 0.0); result = TRIO_FP_NORMAL; break; } # if defined(TRIO_COMPILER_BORLAND) /* Restore the old precision */ (void)_control87(mask, MCW_PC); # endif return result; } #endif /* TRIO_FUNC_MS_FPCLASSIFY_AND_SIGNBIT */ #if defined(TRIO_FUNC_HP_FPCLASSIFY_AND_SIGNBIT) TRIO_PRIVATE_NAN TRIO_INLINE int hp_fpclassify_and_signbit TRIO_ARGS2((number, is_negative), double number, int *is_negative) { /* * HP-UX 9.x and 10.x have an fpclassify() function, that is different * from the C99 fpclassify() macro supported on HP-UX 11.x. */ switch (fpclassify(number)) { case FP_QNAN: case FP_SNAN: *is_negative = TRIO_FALSE; /* NaN has no sign */ return TRIO_FP_NAN; case FP_PLUS_INF: *is_negative = TRIO_FALSE; return TRIO_FP_INFINITE; case FP_MINUS_INF: *is_negative = TRIO_TRUE; return TRIO_FP_INFINITE; case FP_PLUS_DENORM: *is_negative = TRIO_FALSE; return TRIO_FP_SUBNORMAL; case FP_MINUS_DENORM: *is_negative = TRIO_TRUE; return TRIO_FP_SUBNORMAL; case FP_PLUS_ZERO: *is_negative = TRIO_FALSE; return TRIO_FP_ZERO; case FP_MINUS_ZERO: *is_negative = TRIO_TRUE; return TRIO_FP_ZERO; case FP_PLUS_NORM: *is_negative = TRIO_FALSE; return TRIO_FP_NORMAL; case FP_MINUS_NORM: *is_negative = TRIO_TRUE; return TRIO_FP_NORMAL; default: *is_negative = (number < 0.0); return TRIO_FP_NORMAL; } } #endif /* TRIO_FUNC_HP_FPCLASSIFY_AND_SIGNBIT */ #if defined(TRIO_FUNC_XLC_FPCLASSIFY_AND_SIGNBIT) TRIO_PRIVATE_NAN TRIO_INLINE int xlc_fpclassify_and_signbit TRIO_ARGS2((number, is_negative), double number, int *is_negative) { /* * AIX has class() for C, and _class() for C++ */ # if defined(__cplusplus) # define AIX_CLASS(n) _class(n) # else # define AIX_CLASS(n) class(n) # endif switch (AIX_CLASS(number)) { case FP_QNAN: case FP_SNAN: *is_negative = TRIO_FALSE; /* NaN has no sign */ return TRIO_FP_NAN; case FP_PLUS_INF: *is_negative = TRIO_FALSE; return TRIO_FP_INFINITE; case FP_MINUS_INF: *is_negative = TRIO_TRUE; return TRIO_FP_INFINITE; case FP_PLUS_DENORM: *is_negative = TRIO_FALSE; return TRIO_FP_SUBNORMAL; case FP_MINUS_DENORM: *is_negative = TRIO_TRUE; return TRIO_FP_SUBNORMAL; case FP_PLUS_ZERO: *is_negative = TRIO_FALSE; return TRIO_FP_ZERO; case FP_MINUS_ZERO: *is_negative = TRIO_TRUE; return TRIO_FP_ZERO; case FP_PLUS_NORM: *is_negative = TRIO_FALSE; return TRIO_FP_NORMAL; case FP_MINUS_NORM: *is_negative = TRIO_TRUE; return TRIO_FP_NORMAL; default: *is_negative = (number < 0.0); return TRIO_FP_NORMAL; } } #endif /* TRIO_FUNC_XLC_FPCLASSIFY_AND_SIGNBIT */ #if defined(TRIO_FUNC_INTERNAL_ISNAN) TRIO_PRIVATE_NAN TRIO_INLINE int internal_isnan TRIO_ARGS1((number), double number) { # if defined(TRIO_INTERNAL_ISNAN_XPG3) || defined(TRIO_PLATFORM_SYMBIAN) /* * XPG3 defines isnan() as a function. */ return isnan(number); # endif # if defined(TRIO_INTERNAL_ISNAN_IEEE_754) /* * Examine IEEE 754 bit-pattern. A NaN must have a special exponent * pattern, and a non-empty mantissa. */ int has_mantissa; int is_special_quantity; is_special_quantity = internal_is_special_quantity(number, &has_mantissa); return (is_special_quantity && has_mantissa); # endif # if defined(TRIO_INTERNAL_ISNAN_FALLBACK) /* * Fallback solution */ int status; double integral, fraction; # if defined(TRIO_PLATFORM_UNIX) void (*signal_handler)(int) = signal(SIGFPE, SIG_IGN); # endif status = (/* * NaN is the only number which does not compare to itself */ ((TRIO_VOLATILE double)number != (TRIO_VOLATILE double)number) || /* * Fallback solution if NaN compares to NaN */ ((number != 0.0) && (fraction = modf(number, &integral), integral == fraction))); # if defined(TRIO_PLATFORM_UNIX) signal(SIGFPE, signal_handler); # endif return status; # endif } #endif /* TRIO_FUNC_INTERNAL_ISNAN */ #if defined(TRIO_FUNC_INTERNAL_ISINF) TRIO_PRIVATE_NAN TRIO_INLINE int internal_isinf TRIO_ARGS1((number), double number) { # if defined(TRIO_PLATFORM_SYMBIAN) return isinf(number); # endif # if defined(TRIO_INTERNAL_ISINF_IEEE_754) /* * Examine IEEE 754 bit-pattern. Infinity must have a special exponent * pattern, and an empty mantissa. */ int has_mantissa; int is_special_quantity; is_special_quantity = internal_is_special_quantity(number, &has_mantissa); return (is_special_quantity && !has_mantissa) ? ((number < 0.0) ? -1 : 1) : 0; # endif # if defined(TRIO_INTERNAL_ISINF_FALLBACK) /* * Fallback solution. */ int status; # if defined(TRIO_PLATFORM_UNIX) void (*signal_handler)(int) = signal(SIGFPE, SIG_IGN); # endif double infinity = trio_pinf(); status = ((number == infinity) ? 1 : ((number == -infinity) ? -1 : 0)); # if defined(TRIO_PLATFORM_UNIX) signal(SIGFPE, signal_handler); # endif return status; # endif } #endif /* TRIO_FUNC_INTERNAL_ISINF */ /************************************************************************* * Public functions */ #if defined(TRIO_FUNC_FPCLASSIFY_AND_SIGNBIT) TRIO_PUBLIC_NAN int trio_fpclassify_and_signbit TRIO_ARGS2((number, is_negative), double number, int *is_negative) { /* The TRIO_FUNC_xxx_FPCLASSIFY_AND_SIGNBIT macros are mutually exclusive */ #if defined(TRIO_FUNC_C99_FPCLASSIFY_AND_SIGNBIT) return c99_fpclassify_and_signbit(number, is_negative); #endif #if defined(TRIO_FUNC_DECC_FPCLASSIFY_AND_SIGNBIT) return decc_fpclassify_and_signbit(number, is_negative); #endif #if defined(TRIO_FUNC_MS_FPCLASSIFY_AND_SIGNBIT) return ms_fpclassify_and_signbit(number, is_negative); #endif #if defined(TRIO_FUNC_HP_FPCLASSIFY_AND_SIGNBIT) return hp_fpclassify_and_signbit(number, is_negative); #endif #if defined(TRIO_FUNC_XLC_FPCLASSIFY_AND_SIGNBIT) return xlc_fpclassify_and_signbit(number, is_negative); #endif #if defined(TRIO_FUNC_INTERNAL_FPCLASSIFY_AND_SIGNBIT) /* * Fallback solution. */ int rc; if (number == 0.0) { /* * In IEEE 754 the sign of zero is ignored in comparisons, so we * have to handle this as a special case by examining the sign bit * directly. */ # if defined(TRIO_IEEE_754) *is_negative = internal_is_negative(number); # else *is_negative = TRIO_FALSE; /* FIXME */ # endif return TRIO_FP_ZERO; } if (internal_isnan(number)) { *is_negative = TRIO_FALSE; return TRIO_FP_NAN; } rc = internal_isinf(number); if (rc != 0) { *is_negative = (rc == -1); return TRIO_FP_INFINITE; } if ((number > 0.0) && (number < DBL_MIN)) { *is_negative = TRIO_FALSE; return TRIO_FP_SUBNORMAL; } if ((number < 0.0) && (number > -DBL_MIN)) { *is_negative = TRIO_TRUE; return TRIO_FP_SUBNORMAL; } *is_negative = (number < 0.0); return TRIO_FP_NORMAL; #endif } #endif /** Check for NaN. @param number An arbitrary floating-point number. @return Boolean value indicating whether or not the number is a NaN. */ #if defined(TRIO_FUNC_ISNAN) TRIO_PUBLIC_NAN int trio_isnan TRIO_ARGS1((number), double number) { int dummy; return (trio_fpclassify_and_signbit(number, &dummy) == TRIO_FP_NAN); } #endif /** Check for infinity. @param number An arbitrary floating-point number. @return 1 if positive infinity, -1 if negative infinity, 0 otherwise. */ #if defined(TRIO_FUNC_ISINF) TRIO_PUBLIC_NAN int trio_isinf TRIO_ARGS1((number), double number) { int is_negative; if (trio_fpclassify_and_signbit(number, &is_negative) == TRIO_FP_INFINITE) { return (is_negative) ? -1 : 1; } else { return 0; } } #endif /** Check for finity. @param number An arbitrary floating-point number. @return Boolean value indicating whether or not the number is a finite. */ #if defined(TRIO_FUNC_ISFINITE) TRIO_PUBLIC_NAN int trio_isfinite TRIO_ARGS1((number), double number) { int dummy; switch (trio_fpclassify_and_signbit(number, &dummy)) { case TRIO_FP_INFINITE: case TRIO_FP_NAN: return 0; default: return 1; } } #endif /** Examine the sign of a number. @param number An arbitrary floating-point number. @return Boolean value indicating whether or not the number has the sign bit set (i.e. is negative). */ #if defined(TRIO_FUNC_SIGNBIT) TRIO_PUBLIC_NAN int trio_signbit TRIO_ARGS1((number), double number) { int is_negative; (void)trio_fpclassify_and_signbit(number, &is_negative); return is_negative; } #endif /** Examine the class of a number. @param number An arbitrary floating-point number. @return Enumerable value indicating the class of @p number */ #if defined(TRIO_FUNC_FPCLASSIFY) TRIO_PUBLIC_NAN int trio_fpclassify TRIO_ARGS1((number), double number) { int dummy; return trio_fpclassify_and_signbit(number, &dummy); } #endif /** Generate negative zero. @return Floating-point representation of negative zero. */ #if defined(TRIO_FUNC_NZERO) TRIO_PUBLIC_NAN double trio_nzero(TRIO_NOARGS) { # if defined(TRIO_NZERO_IEEE_754) return internal_make_double(ieee_754_negzero_array); # endif # if defined(TRIO_NZERO_FALLBACK) TRIO_VOLATILE double zero = 0.0; return -zero; # endif } #endif /** Generate positive infinity. @return Floating-point representation of positive infinity. */ #if defined(TRIO_FUNC_PINF) TRIO_PUBLIC_NAN double trio_pinf(TRIO_NOARGS) { /* Cache the result */ static double pinf_value = 0.0; if (pinf_value == 0.0) { # if defined(TRIO_PINF_C99_MACRO) pinf_value = (double)INFINITY; # endif # if defined(TRIO_PINF_IEEE_754) pinf_value = internal_make_double(ieee_754_infinity_array); # endif # if defined(TRIO_PINF_FALLBACK) /* * If HUGE_VAL is different from DBL_MAX, then HUGE_VAL is used * as infinity. Otherwise we have to resort to an overflow * operation to generate infinity. */ # if defined(TRIO_PLATFORM_UNIX) void (*signal_handler)(int) = signal(SIGFPE, SIG_IGN); # endif pinf_value = HUGE_VAL; if (HUGE_VAL == DBL_MAX) { /* Force overflow */ pinf_value += HUGE_VAL; } # if defined(TRIO_PLATFORM_UNIX) signal(SIGFPE, signal_handler); # endif # endif } return pinf_value; } #endif /** Generate negative infinity. @return Floating-point value of negative infinity. */ #if defined(TRIO_FUNC_NINF) TRIO_PUBLIC_NAN double trio_ninf(TRIO_NOARGS) { static double ninf_value = 0.0; if (ninf_value == 0.0) { /* * Negative infinity is calculated by negating positive infinity, * which can be done because it is legal to do calculations on * infinity (for example, 1 / infinity == 0). */ ninf_value = -trio_pinf(); } return ninf_value; } #endif /** Generate NaN. @return Floating-point representation of NaN. */ #if defined(TRIO_FUNC_NAN) TRIO_PUBLIC_NAN double trio_nan(TRIO_NOARGS) { /* Cache the result */ static double nan_value = 0.0; if (nan_value == 0.0) { # if defined(TRIO_NAN_C99_FUNCTION) || defined(TRIO_PLATFORM_SYMBIAN) nan_value = nan(""); # endif # if defined(TRIO_NAN_C99_MACRO) nan_value = (double)NAN; # endif # if defined(TRIO_NAN_IEEE_754) nan_value = internal_make_double(ieee_754_qnan_array); # endif # if defined(TRIO_NAN_FALLBACK) /* * There are several ways to generate NaN. The one used here is * to divide infinity by infinity. I would have preferred to add * negative infinity to positive infinity, but that yields wrong * result (infinity) on FreeBSD. * * This may fail if the hardware does not support NaN, or if * the Invalid Operation floating-point exception is unmasked. */ # if defined(TRIO_PLATFORM_UNIX) void (*signal_handler)(int) = signal(SIGFPE, SIG_IGN); # endif nan_value = trio_pinf() / trio_pinf(); # if defined(TRIO_PLATFORM_UNIX) signal(SIGFPE, signal_handler); # endif # endif } return nan_value; } #endif /** @} SpecialQuantities */ /************************************************************************* * For test purposes. * * Add the following compiler option to include this test code. * * Unix : -DSTANDALONE * VMS : /DEFINE=(STANDALONE) */ #if defined(STANDALONE) # include static TRIO_CONST char * getClassification TRIO_ARGS1((type), int type) { switch (type) { case TRIO_FP_INFINITE: return "FP_INFINITE"; case TRIO_FP_NAN: return "FP_NAN"; case TRIO_FP_NORMAL: return "FP_NORMAL"; case TRIO_FP_SUBNORMAL: return "FP_SUBNORMAL"; case TRIO_FP_ZERO: return "FP_ZERO"; default: return "FP_UNKNOWN"; } } static void print_class TRIO_ARGS2((prefix, number), TRIO_CONST char *prefix, double number) { printf("%-6s: %s %-15s %g\n", prefix, trio_signbit(number) ? "-" : "+", getClassification(trio_fpclassify(number)), number); } int main(TRIO_NOARGS) { double my_nan; double my_pinf; double my_ninf; # if defined(TRIO_PLATFORM_UNIX) void (*signal_handler) TRIO_PROTO((int)); # endif my_nan = trio_nan(); my_pinf = trio_pinf(); my_ninf = trio_ninf(); print_class("Nan", my_nan); print_class("PInf", my_pinf); print_class("NInf", my_ninf); print_class("PZero", 0.0); print_class("NZero", -0.0); print_class("PNorm", 1.0); print_class("NNorm", -1.0); print_class("PSub", 1.01e-307 - 1.00e-307); print_class("NSub", 1.00e-307 - 1.01e-307); printf("NaN : %4g 0x%02x%02x%02x%02x%02x%02x%02x%02x (%2d, %2d, %2d)\n", my_nan, ((unsigned char *)&my_nan)[0], ((unsigned char *)&my_nan)[1], ((unsigned char *)&my_nan)[2], ((unsigned char *)&my_nan)[3], ((unsigned char *)&my_nan)[4], ((unsigned char *)&my_nan)[5], ((unsigned char *)&my_nan)[6], ((unsigned char *)&my_nan)[7], trio_isnan(my_nan), trio_isinf(my_nan), trio_isfinite(my_nan)); printf("PInf: %4g 0x%02x%02x%02x%02x%02x%02x%02x%02x (%2d, %2d, %2d)\n", my_pinf, ((unsigned char *)&my_pinf)[0], ((unsigned char *)&my_pinf)[1], ((unsigned char *)&my_pinf)[2], ((unsigned char *)&my_pinf)[3], ((unsigned char *)&my_pinf)[4], ((unsigned char *)&my_pinf)[5], ((unsigned char *)&my_pinf)[6], ((unsigned char *)&my_pinf)[7], trio_isnan(my_pinf), trio_isinf(my_pinf), trio_isfinite(my_pinf)); printf("NInf: %4g 0x%02x%02x%02x%02x%02x%02x%02x%02x (%2d, %2d, %2d)\n", my_ninf, ((unsigned char *)&my_ninf)[0], ((unsigned char *)&my_ninf)[1], ((unsigned char *)&my_ninf)[2], ((unsigned char *)&my_ninf)[3], ((unsigned char *)&my_ninf)[4], ((unsigned char *)&my_ninf)[5], ((unsigned char *)&my_ninf)[6], ((unsigned char *)&my_ninf)[7], trio_isnan(my_ninf), trio_isinf(my_ninf), trio_isfinite(my_ninf)); # if defined(TRIO_PLATFORM_UNIX) signal_handler = signal(SIGFPE, SIG_IGN); # endif my_pinf = DBL_MAX + DBL_MAX; my_ninf = -my_pinf; my_nan = my_pinf / my_pinf; # if defined(TRIO_PLATFORM_UNIX) signal(SIGFPE, signal_handler); # endif printf("NaN : %4g 0x%02x%02x%02x%02x%02x%02x%02x%02x (%2d, %2d, %2d)\n", my_nan, ((unsigned char *)&my_nan)[0], ((unsigned char *)&my_nan)[1], ((unsigned char *)&my_nan)[2], ((unsigned char *)&my_nan)[3], ((unsigned char *)&my_nan)[4], ((unsigned char *)&my_nan)[5], ((unsigned char *)&my_nan)[6], ((unsigned char *)&my_nan)[7], trio_isnan(my_nan), trio_isinf(my_nan), trio_isfinite(my_nan)); printf("PInf: %4g 0x%02x%02x%02x%02x%02x%02x%02x%02x (%2d, %2d, %2d)\n", my_pinf, ((unsigned char *)&my_pinf)[0], ((unsigned char *)&my_pinf)[1], ((unsigned char *)&my_pinf)[2], ((unsigned char *)&my_pinf)[3], ((unsigned char *)&my_pinf)[4], ((unsigned char *)&my_pinf)[5], ((unsigned char *)&my_pinf)[6], ((unsigned char *)&my_pinf)[7], trio_isnan(my_pinf), trio_isinf(my_pinf), trio_isfinite(my_pinf)); printf("NInf: %4g 0x%02x%02x%02x%02x%02x%02x%02x%02x (%2d, %2d, %2d)\n", my_ninf, ((unsigned char *)&my_ninf)[0], ((unsigned char *)&my_ninf)[1], ((unsigned char *)&my_ninf)[2], ((unsigned char *)&my_ninf)[3], ((unsigned char *)&my_ninf)[4], ((unsigned char *)&my_ninf)[5], ((unsigned char *)&my_ninf)[6], ((unsigned char *)&my_ninf)[7], trio_isnan(my_ninf), trio_isinf(my_ninf), trio_isfinite(my_ninf)); return 0; } #endif bogofilter-1.2.4/trio/CHANGES0000644000175000017500000005076212163572311014021 0ustar sezsezCHANGES -- trio The changes listed without a name attributed to them were most likely done by Bjorn Reese and/or Daniel Stenberg. Bogofilter-local change - 2005-12-30 ------------------------------------ * Matthias Andree Fix triodef.h to work on systems were empty macros don't default to 0 in numeric evaluations, such as Sun Workshop 6. Version 1.11 - 2005/12/26 ------------------------- * Fixed accuracy for denormalized numbers (bug item #758327). * Glen Davidson Fixed scanning of floating-point numbers without a decimal-point (bug item #1370427). * David Byron Fixed more compiler warnings. * Fixed compilation of trio_to_long_double and TRIO_FEATURE_FLOAT (reported by David Byron). * Fixed precision of large floating-point numbers (bug item #1314524). * Karl Bochert Fixed trio_fpclassify_and_signbit to only restore the floating-point precision. * Fixed detection of need for ieee option on FreeBSD/Alpha. * Added TRIO_SNPRINTF_ONLY compilation. * Fixed trio_to_double by not using strtod() on Tru64/DECC because it does not support hex-floats. * Fixed crash on 64 bits machines related to a previous workaround in version 1.9 for uninitialized va_list (reported by Nicolai Tufar, suggestion by Douglas Gwyn). * Patrick Jessee Fixed width calculation for %g. * Added macros for internal features. * Jon Foster Added macros for conditional compilation of many features. Documented all the features. * Karl Bochert Fixed problem with Borland C++, which changes the floating-point precision for certain math functions (log10() and _fpclass()). * Karl Bochert Fixed compilation warnings on Borland C++. * Removed any occurrence of #elif because Borland C++ reports wrong line numbers when they are present (reported by Karl Bochert). * David Byron Added trio_asprintfv. * Brian Chapman Fixed Mac OS X compilation. * David Byron Fixed several compiler warnings. * Fixed printing of out-of-range arguments for %hhd and %hd. These arguments can be out of range because of default integer promotion. * Bob Friesenhahn Fixed installation of header files. * Joe Orton Added SHELL to Makefile.in to avoid problems with CShells. * Shaun Tancheff Fixed regresion tests for MSVC. * Craig Berry Fixed the VMS C99 workaround. Version 1.10 - 2003/03/06 ------------------------- * Rearranged some include files to accommodate large file support (reported by Albert Chin-A-Young). * Added support for SunOS 4.1.x lack of strerror, tolower, and toupper (reported by Peter McCluskey). * Fixed pedantic compilation with TRIO_MINIMAL. * Jose Kahan Moved to avoid redefinition problems. * Fixed hex-float exponents (reported by Matthias Clasen). * Fixed handling of negative width and precision via paramters (reported by Jacob Navia). * Nigel Hall Fixed TRIO_VA_START for VMS. * Rune Enggaard Lausen Fixed compilation for Borland C++ Builder. * Fixed precision of hex-float numbers (reported by James Antill). * Fixed plus sign only to be added for signed numbers. * Fixed printing of integers with value and precision of zero (reported by James Antill). * Fixed %#.o to only print one zero if the value is zero (reported by James Antill). * Rewrote check for IEEE compilation option to remove dependency on additional scripts. * Mehdi Lavasani Makefile install target fixed to work with older install programs. * Collapsed the DECC, MSVC, HP-UX, and AIX code for trio_fpclassify_and_sign() with further preprocessing. Version 1.9 - 2002/10/13 ------------------------ * Fixed trio_fpclassify_and_signbit on AIX 3.2 * Added configure check for -ieee/-mieee compilation option for Alpha machines. * Craig Berry Fixed compilation on VMS. * Albert Chin-A-Young Fixed incorrect conditional expression in trio_isinf. * Fixed the warnings about uninitialized va_list in the printfv and scanfv family without the use of compiler specific pragmas (suggested by Ian Pilcher). * Fixed space flag for floating-point numbers (reported by Ian Main). Version 1.8 - 2002/07/10 ------------------------ * Fixed infinite loop in multibyte handling (reported by Gisli Ottarsson). * Added the customizable cprintf/cscanf family which enables to user to specify input and output stream functions (suggested by Florian Schulze). * Fixed trio_isinf by removing the HP-UX workaround, and instead making sure that the C99 macro will adhere to the trio return values (reported by Luke Dunstan). * Alexander Lukyanov Fixed boundary case for scanning and EOF. * Jacob Navia Enabled the L modifier for formatting. * Added TRIO_MINIMAL to build trio without the string functions. * Added the R modifier to print rounded floating-point numbers. * Added trio_to_long_double and long double scanning (the L modifier). * Added trio_locale_decimal_point, trio_locale_thousand_separator, trio_locale_grouping to overwrite locale settings. * Rewrote TrioWriteDouble to avoid temporary buffers and thus the danger of buffer overflows (for instance %.5000f). * Improved floating-point formatting accuracy. * Fixed formatting of non-decimal exponents. * Fixed thousand separator checking. * Fixed %f scanning to get a float and %lf to get a double. * Fixed WIN32 compilation (reported by Emmanuel Mogenet) * Fixed regression test cases to exclude disabled features. Version 1.7 - 2002/05/07 ------------------------ * Fixed trio_to_double to handle hex-floats properly. * Fixed printing of %a-format to be like %e, not like %g. * Fixed floating-point printing of values beyond the machine accuracy. * Fixed %f for printing with large precision. * Fixed the usage of C99 nan(), which caused a crash on OSF/1 (reported by Georg Bolz) * Joe Orton Fixed %p on 64-bit platforms. * Made trio compile with K&R compilers. * Emmanuel Mogenet Fixed bug in trio_asprintf. * Emmanuel Mogenet Various WIN32 fixes. * Joe Orton Fixed trio_isinf() on HP-UX, and added test cases. * Joe Orton Fixed non-portable use of $^ in Makefile. * Joe Orton Added autoconf. * Alexander Lukyanov Fixed a number of bugs in the scanning of EOF and the count specifier. * Richard Jinks Added trio_nzero * Fixed incorrect handling of return code from TrioReadChar (reported by Henrik Löf) * Fixed parsing of character class expressions. * Fixed trio_to_double which did not work with long fractions. * Fixed %f for printing of large numbers. * Fixed %#s to handle whitespaces as non-printable characters. * Added trio_isfinite, trio_signbit, and trio_fpclassify. * Added new test cases. Version 1.6 - 2002/01/13 ------------------------ * Added dynamic string functions. * Rewrote and extended documentation in JavaDoc (using Doxygen). * Moved and renamed strio functions to triostr. * Robert Collins Added definition for Cygwin. * Markus Henke Added long double workaround for the HP C/iX compiler. * Marc Verwerft Improved error handling for dynamically allocated strings. * John Fotheringham Made trionan compile on OpenVMS. * Added 'd' and 'D' as exponent letters when using TRIO_MICROSOFT. * Fixed uninitial memory read for the parameter modifiers. Version 1.5 - 2001/09/08 ------------------------ * Merged with libxml changes. * Moved NaN and Inf handling to separate file to enable reuse in other projects. * Igor Zlatkovic Fixed TrioGenerateNan for MSVC. * Fixed lots of preprocessor macros and internal data structure names. Version 1.4 - 2001/06/03 ------------------------ * Added hex-float (%a and %A) for scanning. * Added wide character arguments (%ls, %ws, %S, %lc, %wc, and %C) for both printf and scanf. * Added mutex callbacks for user-specified specifiers to enable applications to add thread-safety. These are registered with trio_register, where the namespace is set to either ":enter" to lock a mutex, or ":leave" to unlock a mutex. * Added equivalence class expressions for scanning. For example, %[[=a=]] scans for all letters in the same equivalence class as the letter 'a' as defined by the locale. * Changed character class expressions for scanning. The expressions must now be embedded withing an extra set of brackets, e.g. %[[:alpha:]]. This was done to adhere to the syntax of UNIX98 regular expressions. * Added the possibility to specify standard support (TRIO_C99 etc.) as compiler options. * Fixed conversion of hex-float in StrToDouble. * Fixed formatting of hex-float numbers. * Stan Boehm Fixed crash on QNX, which happend because some buffers on the stack were too big. * Fixed default precision for %f and %g (reported by Jose Ortiz) * Howard Kapustein Added the I8, I16, I32, and I64 modifiers. * Jose Ortiz Fixed rounding problem for %e. * Jose Ortiz Fixed various problems with the xlC and Sun C++ compilers. Version 1.3 - 2001/05/16 ------------------------ * trio's treatment of the field width when the %e code was used was not correct (reported by Gisli Ottarsson). It turns out the fraction part should be zero-padded by default and the exponent part should be zero-prefixed if it is only one digit. At least that's how the GNU and Sun libc's work. The trio floating point output looks identical to them now. * Fixed group scanning with modifiers. * Fixed compilation for 64-bit Digital Unix. * Igor Zlatkovic Fixed compilation of dprintf, which uses read/write, for MSVC. * Fixed various compilation problems on Digital Unix (mainly associated with va_list). Version 1.2 - 2001/04/11 ------------------------ * Added autoconf integration. If compiled with HAVE_CONFIG_H the following happens. Firstly, is included. Secondly, trio will only be compiled if WITH_TRIO is defined herein. Thirdly, if TRIO_REPLACE_STDIO is defined, only stdio functions that have not been detected by autoconf, i.e. those not defined by HAVE_PRINTF or similar, will be replaced by trio functions (suggested by Daniel Veillard). * Fixed '%m.nf' output. Previously trio did not treat the width properly in all cases (reported by Gisli Ottarsson). * Added explicit promotion for the scanfv family. * Fixed more C++ compilation warnings. Version 1.1 - 2001/02/25 ------------------------ * Added explicit promotion for the printfv familiy. A float must be specified by %hf. * Fixed positionals for printfv (reported by Gisli Ottarsson). * Fixed an integer to pointer conversion problem on the SGI MIPS C compiler (reported by Gisli Ottarsson). * Fixed ANSI C++ warnings (type casting, and namespace is a reserved keyword). * Added \n to all examples in the documentation to prevent confusion. * Fixed StrSubstringMax Version 1.0 - 2000/12/10 ------------------------ * Bumped Version number. Version 0.25 - 2000/12/09 ------------------------- * Wrote more documentation. * Improved NaN support and added NaN to regression test. * Fixed C99 support. * Added missing getter/setter functions. Version 0.24 - 2000/12/02 ------------------------- * Added callback functionality for the user-defined specifier (<>). All the necessary functions are defined in triop.h header file. See the documentation for trio_register for further detail. * Wrote initial documentation on the callback functionality. * Added the printfv and scanfv family of functions, which takes a pointer array rather than variadic arguments. Each pointer in the array must point to the associated data (requested by Bruce Korb). * As indicated in version 0.21 the extension modifiers (<>) have now been completely removed. * Added skipping of thousand-separators in floating-point number scanning. Version 0.23 - 2000/10/21 ------------------------- * Added width to scanning of floating-point numbers. * Wrote more documentation on trio_printf. * Fixed problem with trailing zeroes after decimal-point. Version 0.22 - 2000/08/06 ------------------------- * Added LC_CTYPE locale dependent character class expressions to scan lists. Included are [:alnum:], [:alpha:], [:cntrl:], [:digit:], [:graph:], [:lower:], [:print:], [:punct:], [:space:], [:upper:], [:xdigit:] * Added C escapes to alternative string formatting and scanning. * Added StrSubstringMax. * Wrote a little more documentation. * Fixed scanf return values. * Fixed a sign error for non-ascii characters. Version 0.21 - 2000/07/19 ------------------------- * Converted the documentation to TeX. With latex2man the documentation can automatically be converted into man pages. * Added trio_scanf, trio_vscanf, trio_fscanf, and trio_vfscanf. * Added trio_dprintf, trio_vdprintf, trio_dscanf, and trio_vdscanf. These functions can be used to write and read directly to pipes and sockets (the assume blocking sockets). Stdio buffering is surpassed, so the functions are async-safe. However, reading from stdin (STDIN_FILENO) or writing to stdout (STDOUT_FILENO) reintroduces the buffering. * Added trio_dprintf and trio_vdprintf. These can be used to write directly to pipes and sockets. * Paul Janzen Added trio_asprintf and trio_vasprintf, which are compatible with the GNU and BSD interfaces. * Added scanlist ranges for group scanning (%[]). * Added width for scanning (missing for floating-point numbers though). * Added variable size modifier (&) to handle system defined types of unknown size. This modifier makes certain assumptions about the integer sizes, which may not be valid on any machine. Consequently, the modifier will remain undocumented, as it may be removed later. * Added \777 and \xFF to alternative string scanning (%#s) * Added the TRIO_REPLACE_STDIO check in the header. * Improved performance of the multibyte character parsing. * Fixed positionals (%n$) which had stopped working. * Fixed hh and ll modifiers to allow exactly two letters and no more. * Fixed ANSI C++ warnings. Also fixed the compiler warning about casting between integer and pointer (this has been annoying me for ages). * Fixed snprintf and vsnprintf with zero buffer size. * Fixed NAN problems (reported by Keith Briggs). * Fixed parsing of multibyte characters. The format string was not correctly advanced in case of a multibyte character. * Renamed many of the internal functions to have more consistant names. * Removed the and modifiers. They are not really worth including. The other <> modifiers may disappear as well. Version 0.20 - 2000/06/05 ------------------------- * Added intmax_t and ptrdiff_t support. * Added support for LC_NUMERIC grouping. * Added double-dot notation for the conversion base. The style is now %width.precision.base, where any argument can be a number, an asterix indicating a parameter, or be omitted entirely. For example, %*..2i is to specify binary numbers without precision, and with width as a parameter on the va_list. * Added sticky modifier (!), which makes subsequent specifiers of the same type reuse the current modifiers. Inspired by a suggestion from Gary Porter. * Added group scanning (%[]). Scanlist ranges and multibyte sequences are not supported yet. * Added count scanning (%n). * Changed the number scanning to accept thousand separators and any base. * Fixed positional for parameters. It is possible to write something like %3$*1$.*2$d (which happens to be the same as %*.*d). * Fixed precision of integers. * Fixed parameter flags. Before trio could only handle one parameter flag per specifier, although two (three with double-dot base) were possible. * Fixed isinf() for those platforms where it is unimplemented. Version 0.18 - 2000/05/27 ------------------------- * Rewrote the entire floating-point formatting function (Danny Dulai had reported several errors and even supplied some patches, which unfortunately were lost due to the refactoring). * Removed the use of strlen() in the declaration of a stack array. This caused problems on some compilers (besides it isn't really ANSI C compliant anyways). Using some arbitrarily chosen maximum value; should examine if some standard defines an upper limit on the length of decimal-point and thousands-separator (sizeof(wchar_t) perhaps?) * Changed the parsing of the format string to be multibyte aware. Version 0.17 - 2000/05/19 ------------------------- * Added INF, -INF, and NAN for floating-point numbers. * Fixed %#.9g -- alternative with precision. * Ken Gibson Fixed printing of negative hex numbers * Joerg (last name unknown) Fixed convertion of non-ASCII characters Version 0.16 - 1999/08/06 ------------------------- * Changed the constness of the second argument of StrFloat and StrDouble. The lack of parameter overloading in C is the reason for the strange use of constness in strtof and strtod. * Cleaned up constness. Version 0.15 - 1999/07/23 ------------------------- * Fixed the internal representation of numbers from signed to unsigned. Signed numbers posed a problem for large unsigned numbers (reported by Tero) * Fixed a tiny bug in trio_vsprintfcat * Changed the meaning of the max argument of StrAppendMax to be consistant with StrFormatAppendMax. Now it is the maximal size of the entire target buffer, not just the appended size. This makes it easier to avoid buffer overflows (requested by Tero) Version 0.14 - 1999/05/16 ------------------------- * Added size_t support (just waiting for a C99 compliant compiler to add ptrdiff_t and intmax_t) * Rewrote TrioOutStreamDouble so it does not use the libc sprintf to emulate floating-point anylonger. * Fixed width, precision, and adjustment for numbers and doubles. Version 0.13 - 1999/05/06 ------------------------- * Fixed zero padding for %d. Now %d will only zero pad if explicitly requested to do so with the 0 flag (reported by Tero). * Fixed an incorrect while() condition in TrioGetString (reported by Tero). Version 0.12 - 1999/04/19 ------------------------- * Fixed incorrect zero padding of pointers * Added StrHash with STRIO_HASH_PLAIN * Added StrFormatDateMax Version 0.11 - 1999/03/25 ------------------------- * Made it compile under cygwin * Fixed a bug were TrioPreprocess would return an error if no formatting chars were found (reported by Tero). Version - 1999/03/19 -------------------- * Added trio_strerror and TRIO_ERROR_NAME. * Changed the error codes to be positive (as errno) * Fixed two reads of uninitialized memory reported by Purify * Added binary specifiers 'b' and 'B' (like SCO.) ThousandSeparator can be used to separate nibbles (4 bit) * Renamed all Internal* functions to Trio*, which seems like a better namespace (even though it is of no practical interest because these functions are not visible beyond the scope of this file.) Version - 1999/03/12 -------------------- * Added hex-float format for StrToDouble * Double references and gaps in the arguments are not allowed (for the %n$ format) and in both cases an error code is returned. * Added StrToDouble (and StrToFloat) Version - 1999/03/08 -------------------- * Added InStream and OutStream to the trio_T structure. * Started work on TrioScan. * Return values for errors changed. Two macros to unpack the error code has been added to the header. * Shortshort (hh) flag added. * %#s also quotes the quote-char now. * Removed the 'errorInFormat' boolean, which isn't used anymore after the functions bail out with an error instead. Version - 1999/03/04 -------------------- * More than MAX_PARAMETERS parametes will now cause the TrioPreprocess() function to return error. * Unknown flags and/or specifiers cause errors too. * Added trio_snprintfcat and trio_vsnprintfcat and the defined name StrFormatAppendMax. They append a formatted string to the end of a string. * Define MAX_PARAMETERS to 128 at all times instead of using NL_ARGMAX when that exists. * Added platform fixes for Amiga as suggested by Tero Jänkä Version - 1999/01/31 -------------------- * vaprintf did add a zero byte even when it had failed. * Cleaned up the code for locale handling and thousand separator * Added trio_aprintf() and trio_vaprintf(). They return an allocated string. * Added thousands separator for numbers * Added floating point support for *printf Version - 1998/10/20 -------------------- * StrMatchCase() called StrMatch() instead of itself recursively * Rewrote the implementation of *printf and *scanf and put all the code in this file. Extended qualifiers and qualifiers from other standards were added. * Added StrSpanFunction, StrToLong, and StrToUnsignedLong Version - 1998/05/23 -------------------- * Made the StrEqual* functions resistant to NULL pointers * Turns out strdup() is no standard at all, and some platforms (I seem to recall HP-UX) has problems with it. Made our own StrDuplicate() instead. * Added StrFormat() and StrFormatMax() to serve as sprintf() and snprintf() respectively. bogofilter-1.2.4/trio/Makefile.in0000644000175000017500000002514112163573272015073 0ustar sezsez# Makefile.in generated by automake 1.12.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2012 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ am__make_dryrun = \ { \ am__dry=no; \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \ | grep '^AM OK$$' >/dev/null || am__dry=yes;; \ *) \ for am__flg in $$MAKEFLAGS; do \ case $$am__flg in \ *=*|--*) ;; \ *n*) am__dry=yes; break;; \ esac; \ done;; \ esac; \ test $$am__dry = yes; \ } pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = trio DIST_COMMON = README $(srcdir)/Makefile.am $(srcdir)/Makefile.in \ AUTHORS ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/gsl.m4 \ $(top_srcdir)/m4/iconv.m4 $(top_srcdir)/m4/lib-ld.m4 \ $(top_srcdir)/m4/lib-link.m4 $(top_srcdir)/m4/lib-prefix.m4 \ $(top_srcdir)/m4/stdbool.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/src/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DB_EXT = @DB_EXT@ DB_TYPE = @DB_TYPE@ DEFAULT_CHARSET = @DEFAULT_CHARSET@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ ENCODING = @ENCODING@ EXEEXT = @EXEEXT@ EXE_EXT = @EXE_EXT@ GREP = @GREP@ GSL_CFLAGS = @GSL_CFLAGS@ GSL_CONFIG = @GSL_CONFIG@ GSL_LIBS = @GSL_LIBS@ HAVE_EXTENDED_PRECISION_REGISTERS = @HAVE_EXTENDED_PRECISION_REGISTERS@ HAVE_EXTERN_INLINE = @HAVE_EXTERN_INLINE@ HAVE_INLINE = @HAVE_INLINE@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LEX = @LEX@ LEXLIB = @LEXLIB@ LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@ LIBDB = @LIBDB@ LIBICONV = @LIBICONV@ LIBOBJS = @LIBOBJS@ LIBQDBM = @LIBQDBM@ LIBS = @LIBS@ LIBSQLITE3 = @LIBSQLITE3@ LIBTOKYOCABINET = @LIBTOKYOCABINET@ LTLIBDB = @LTLIBDB@ LTLIBICONV = @LTLIBICONV@ LTLIBOBJS = @LTLIBOBJS@ LTLIBQDBM = @LTLIBQDBM@ LTLIBSQLITE3 = @LTLIBSQLITE3@ LTLIBTOKYOCABINET = @LTLIBTOKYOCABINET@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NSGMLS = @NSGMLS@ OBJEXT = @OBJEXT@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PERL = @PERL@ RANLIB = @RANLIB@ RPMBUILD = @RPMBUILD@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STATICLDFLAGS = @STATICLDFLAGS@ STATIC_DB = @STATIC_DB@ STRIP = @STRIP@ USE_TRANSACTIONS = @USE_TRANSACTIONS@ USE_UNICODE = @USE_UNICODE@ VERSION = @VERSION@ XMLLINT = @XMLLINT@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_cv_enable_xmlto = @ac_cv_enable_xmlto@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ transformed_bogofilter = @transformed_bogofilter@ transformed_bogoutil = @transformed_bogoutil@ EXTRA_DIST = CHANGES README triostr.c trio.c trionan.c \ trio.h triop.h triodef.h trionan.h triostr.h regression.c all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign trio/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign trio/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): tags: TAGS TAGS: ctags: CTAGS CTAGS: cscope cscopelist: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic distclean \ distclean-generic distdir dvi dvi-am html html-am info info-am \ install install-am install-data install-data-am install-dvi \ install-dvi-am install-exec install-exec-am install-html \ install-html-am install-info install-info-am install-man \ install-pdf install-pdf-am install-ps install-ps-am \ install-strip installcheck installcheck-am installdirs \ maintainer-clean maintainer-clean-generic mostlyclean \ mostlyclean-generic pdf pdf-am ps ps-am uninstall uninstall-am # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: bogofilter-1.2.4/trio/README0000644000175000017500000000237412163572311013702 0ustar sezsezREADME -- trio Trio is a package with portable string functions. Including printf() clones and others. Copyright (C) 1998-2001 by Bjorn Reese and Daniel Stenberg. Permission to use, copy, modify, and distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. Trio is intended to be an integral part of another application, so we have not done anything to create a proper installation. Compile with 'make' (edit the Makefile if you want a release build) Test the package with 'make test' Install by copying trio.h, triop.h, and libtrio.a (and man/man?/* if you want documentation) to the appropriate directories. Catch some usage examples in example.c Send feedback and patches to the mailing list, subscription and other information is found here: http://lists.sourceforge.net/lists/listinfo/ctrio-talk Enjoy! Trio web page http://daniel.haxx.se/trio/ bogofilter-1.2.4/trio/trio.c0000644000175000017500000051333712163572311014151 0ustar sezsez/************************************************************************* * * $Id: trio.c,v 1.95 2005/12/26 17:15:21 breese Exp $ * * Copyright (C) 1998 Bjorn Reese and Daniel Stenberg. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************* * * A note to trio contributors: * * Avoid heap allocation at all costs to ensure that the trio functions * are async-safe. The exceptions are the printf/fprintf functions, which * uses fputc, and the asprintf functions and the modifier, which * by design are required to allocate form the heap. * ************************************************************************/ /* * TODO: * - Scan is probably too permissive about its modifiers. * - C escapes in %#[] ? * - Multibyte characters (done for format parsing, except scan groups) * - Complex numbers? (C99 _Complex) * - Boolean values? (C99 _Bool) * - C99 NaN(n-char-sequence) missing. The n-char-sequence can be used * to print the mantissa, e.g. NaN(0xc000000000000000) * - Should we support the GNU %a alloc modifier? GNU has an ugly hack * for %a, because C99 used %a for other purposes. If specified as * %as or %a[ it is interpreted as the alloc modifier, otherwise as * the C99 hex-float. This means that you cannot scan %as as a hex-float * immediately followed by an 's'. * - Scanning of collating symbols. */ /************************************************************************* * Trio include files */ #include "triodef.h" #include "trio.h" #include "triop.h" #if defined(TRIO_EMBED_NAN) # define TRIO_PUBLIC_NAN static # if TRIO_FEATURE_FLOAT # define TRIO_FUNC_NAN # define TRIO_FUNC_NINF # define TRIO_FUNC_PINF # define TRIO_FUNC_FPCLASSIFY_AND_SIGNBIT # define TRIO_FUNC_ISINF # endif #endif #include "trionan.h" #if defined(TRIO_EMBED_STRING) # define TRIO_PUBLIC_STRING static # define TRIO_FUNC_LENGTH # define TRIO_FUNC_TO_LONG # if TRIO_FEATURE_LOCALE # define TRIO_FUNC_COPY_MAX # endif # if TRIO_FEATURE_DYNAMICSTRING # define TRIO_FUNC_XSTRING_DUPLICATE # endif # if TRIO_EXTENSION && TRIO_FEATURE_SCANF # define TRIO_FUNC_EQUAL_LOCALE # endif # if TRIO_FEATURE_ERRNO # define TRIO_FUNC_ERROR # endif # if TRIO_FEATURE_FLOAT && TRIO_FEATURE_SCANF # define TRIO_FUNC_TO_DOUBLE # endif # if TRIO_FEATURE_DYNAMICSTRING # define TRIO_FUNC_STRING_EXTRACT # endif # if TRIO_FEATURE_DYNAMICSTRING # define TRIO_FUNC_STRING_TERMINATE # endif # if TRIO_FEATURE_USER_DEFINED # define TRIO_FUNC_DUPLICATE # endif # if TRIO_FEATURE_DYNAMICSTRING # define TRIO_FUNC_STRING_DESTROY # endif # if TRIO_FEATURE_USER_DEFINED # define TRIO_FUNC_DESTROY # endif # if TRIO_FEATURE_USER_DEFINED || (TRIO_FEATURE_FLOAT && TRIO_FEATURE_SCANF) # define TRIO_FUNC_EQUAL # endif # if TRIO_FEATURE_USER_DEFINED || TRIO_FEATURE_SCANF # define TRIO_FUNC_EQUAL_CASE # endif # if (TRIO_EXTENSION && TRIO_FEATURE_SCANF) # define TRIO_FUNC_EQUAL_MAX # endif # if TRIO_FEATURE_SCANF # define TRIO_FUNC_TO_UPPER # endif # if TRIO_FEATURE_DYNAMICSTRING # define TRIO_FUNC_XSTRING_APPEND_CHAR # endif #endif #include "triostr.h" /************************************************************************** * * Definitions * *************************************************************************/ #include #if TRIO_FEATURE_FLOAT # include # include #endif #if defined(__STDC_ISO_10646__) || defined(MB_LEN_MAX) || defined(USE_MULTIBYTE) || TRIO_FEATURE_WIDECHAR # define TRIO_COMPILER_SUPPORTS_MULTIBYTE # if !defined(MB_LEN_MAX) # define MB_LEN_MAX 6 # endif #endif #if (TRIO_COMPILER_VISUALC - 0 >= 1100) || defined(TRIO_COMPILER_BORLAND) # define TRIO_COMPILER_SUPPORTS_VISUALC_INT #endif #if TRIO_FEATURE_FLOAT # if defined(PREDEF_STANDARD_C99) \ || defined(PREDEF_STANDARD_UNIX03) # if !defined(HAVE_FLOORL) # define HAVE_FLOORL # endif # if !defined(HAVE_POWL) # define HAVE_POWL # endif # if !defined(HAVE_FMODL) # define HAVE_FMODL # endif # endif # if defined(TRIO_COMPILER_VISUALC) # if defined(floorl) # define HAVE_FLOORL # endif # if defined(powl) # define HAVE_POWL # endif # if defined(fmodl) # define HAVE_FMODL # endif # endif #endif /************************************************************************* * Generic definitions */ #if !(defined(DEBUG) || defined(NDEBUG)) # define NDEBUG #endif #include #include #if defined(PREDEF_STANDARD_C99) # define isascii(x) ((x) & 0x7F) #else # define isblank(x) (((x)==32) || ((x)==9)) #endif #if defined(TRIO_COMPILER_ANCIENT) # include #else # include #endif #include #include #ifndef NULL # define NULL 0 #endif #define NIL ((char)0) #ifndef FALSE # define FALSE (1 == 0) # define TRUE (! FALSE) #endif #define BOOLEAN_T int /* mincore() can be used for debugging purposes */ #define VALID(x) (NULL != (x)) #if TRIO_FEATURE_ERRORCODE /* * Encode the error code and the position. This is decoded * with TRIO_ERROR_CODE and TRIO_ERROR_POSITION. */ # define TRIO_ERROR_RETURN(x,y) (- ((x) + ((y) << 8))) #else # define TRIO_ERROR_RETURN(x,y) (-1) #endif typedef unsigned long trio_flags_t; /************************************************************************* * Platform specific definitions */ #if defined(TRIO_PLATFORM_UNIX) # include # include # include # if !defined(TRIO_FEATURE_LOCALE) # define USE_LOCALE # endif #endif /* TRIO_PLATFORM_UNIX */ #if defined(TRIO_PLATFORM_VMS) # include #endif #if defined(TRIO_PLATFORM_WIN32) # include # define read _read # define write _write #endif /* TRIO_PLATFORM_WIN32 */ #if TRIO_FEATURE_WIDECHAR # if defined(PREDEF_STANDARD_C94) # include # include typedef wchar_t trio_wchar_t; typedef wint_t trio_wint_t; # else typedef char trio_wchar_t; typedef int trio_wint_t; # define WCONST(x) L ## x # define WEOF EOF # define iswalnum(x) isalnum(x) # define iswalpha(x) isalpha(x) # define iswblank(x) isblank(x) # define iswcntrl(x) iscntrl(x) # define iswdigit(x) isdigit(x) # define iswgraph(x) isgraph(x) # define iswlower(x) islower(x) # define iswprint(x) isprint(x) # define iswpunct(x) ispunct(x) # define iswspace(x) isspace(x) # define iswupper(x) isupper(x) # define iswxdigit(x) isxdigit(x) # endif #endif /************************************************************************* * Compiler dependent definitions */ /* Support for long long */ #ifndef __cplusplus # if !defined(USE_LONGLONG) # if defined(TRIO_COMPILER_GCC) && !defined(__STRICT_ANSI__) # define USE_LONGLONG # else # if defined(TRIO_COMPILER_SUNPRO) # define USE_LONGLONG # else # if defined(_LONG_LONG) || defined(_LONGLONG) # define USE_LONGLONG # endif # endif # endif # endif #endif /* The extra long numbers */ #if defined(USE_LONGLONG) typedef signed long long int trio_longlong_t; typedef unsigned long long int trio_ulonglong_t; #else # if defined(TRIO_COMPILER_SUPPORTS_VISUALC_INT) typedef signed __int64 trio_longlong_t; typedef unsigned __int64 trio_ulonglong_t; # else typedef TRIO_SIGNED long int trio_longlong_t; typedef unsigned long int trio_ulonglong_t; # endif #endif /* Maximal and fixed integer types */ #if defined(PREDEF_STANDARD_C99) # include typedef intmax_t trio_intmax_t; typedef uintmax_t trio_uintmax_t; typedef int8_t trio_int8_t; typedef int16_t trio_int16_t; typedef int32_t trio_int32_t; typedef int64_t trio_int64_t; #else # if defined(PREDEF_STANDARD_UNIX98) # include typedef intmax_t trio_intmax_t; typedef uintmax_t trio_uintmax_t; typedef int8_t trio_int8_t; typedef int16_t trio_int16_t; typedef int32_t trio_int32_t; typedef int64_t trio_int64_t; # else # if defined(TRIO_COMPILER_SUPPORTS_VISUALC_INT) typedef trio_longlong_t trio_intmax_t; typedef trio_ulonglong_t trio_uintmax_t; typedef __int8 trio_int8_t; typedef __int16 trio_int16_t; typedef __int32 trio_int32_t; typedef __int64 trio_int64_t; # else typedef trio_longlong_t trio_intmax_t; typedef trio_ulonglong_t trio_uintmax_t; # if defined(TRIO_INT8_T) typedef TRIO_INT8_T trio_int8_t; # else typedef TRIO_SIGNED char trio_int8_t; # endif # if defined(TRIO_INT16_T) typedef TRIO_INT16_T trio_int16_t; # else typedef TRIO_SIGNED short trio_int16_t; # endif # if defined(TRIO_INT32_T) typedef TRIO_INT32_T trio_int32_t; # else typedef TRIO_SIGNED int trio_int32_t; # endif # if defined(TRIO_INT64_T) typedef TRIO_INT64_T trio_int64_t; # else typedef trio_longlong_t trio_int64_t; # endif # endif # endif #endif #if defined(HAVE_FLOORL) # define trio_floorl(x) floorl((x)) #else # define trio_floorl(x) floor((double)(x)) #endif #if defined(HAVE_FMODL) # define trio_fmodl(x,y) fmodl((x),(y)) #else # define trio_fmodl(x,y) fmod((double)(x),(double)(y)) #endif #if defined(HAVE_POWL) # define trio_powl(x,y) powl((x),(y)) #else # define trio_powl(x,y) pow((double)(x),(double)(y)) #endif #if TRIO_FEATURE_FLOAT # define TRIO_FABS(x) (((x) < 0.0) ? -(x) : (x)) #endif /************************************************************************* * Internal Definitions */ #if TRIO_FEATURE_FLOAT # if !defined(DECIMAL_DIG) # define DECIMAL_DIG DBL_DIG # endif /* Long double sizes */ # ifdef LDBL_DIG # define MAX_MANTISSA_DIGITS LDBL_DIG # define MAX_EXPONENT_DIGITS 4 # define MAX_DOUBLE_DIGITS LDBL_MAX_10_EXP # else # define MAX_MANTISSA_DIGITS DECIMAL_DIG # define MAX_EXPONENT_DIGITS 3 # define MAX_DOUBLE_DIGITS DBL_MAX_10_EXP # endif # if defined(TRIO_COMPILER_ANCIENT) || !defined(LDBL_DIG) # undef LDBL_DIG # undef LDBL_MANT_DIG # undef LDBL_EPSILON # define LDBL_DIG DBL_DIG # define LDBL_MANT_DIG DBL_MANT_DIG # define LDBL_EPSILON DBL_EPSILON # endif #endif /* TRIO_FEATURE_FLOAT */ /* The maximal number of digits is for base 2 */ #define MAX_CHARS_IN(x) (sizeof(x) * CHAR_BIT) /* The width of a pointer. The number of bits in a hex digit is 4 */ #define POINTER_WIDTH ((sizeof("0x") - 1) + sizeof(trio_pointer_t) * CHAR_BIT / 4) #if TRIO_FEATURE_FLOAT /* Infinite and Not-A-Number for floating-point */ # define INFINITE_LOWER "inf" # define INFINITE_UPPER "INF" # define LONG_INFINITE_LOWER "infinite" # define LONG_INFINITE_UPPER "INFINITE" # define NAN_LOWER "nan" # define NAN_UPPER "NAN" #endif /* Various constants */ enum { TYPE_PRINT = 1, #if TRIO_FEATURE_SCANF TYPE_SCAN = 2, #endif /* Flags. FLAGS_LAST must be less than ULONG_MAX */ FLAGS_NEW = 0, FLAGS_STICKY = 1, FLAGS_SPACE = 2 * FLAGS_STICKY, FLAGS_SHOWSIGN = 2 * FLAGS_SPACE, FLAGS_LEFTADJUST = 2 * FLAGS_SHOWSIGN, FLAGS_ALTERNATIVE = 2 * FLAGS_LEFTADJUST, FLAGS_SHORT = 2 * FLAGS_ALTERNATIVE, FLAGS_SHORTSHORT = 2 * FLAGS_SHORT, FLAGS_LONG = 2 * FLAGS_SHORTSHORT, FLAGS_QUAD = 2 * FLAGS_LONG, FLAGS_LONGDOUBLE = 2 * FLAGS_QUAD, FLAGS_SIZE_T = 2 * FLAGS_LONGDOUBLE, FLAGS_PTRDIFF_T = 2 * FLAGS_SIZE_T, FLAGS_INTMAX_T = 2 * FLAGS_PTRDIFF_T, FLAGS_NILPADDING = 2 * FLAGS_INTMAX_T, FLAGS_UNSIGNED = 2 * FLAGS_NILPADDING, FLAGS_UPPER = 2 * FLAGS_UNSIGNED, FLAGS_WIDTH = 2 * FLAGS_UPPER, FLAGS_WIDTH_PARAMETER = 2 * FLAGS_WIDTH, FLAGS_PRECISION = 2 * FLAGS_WIDTH_PARAMETER, FLAGS_PRECISION_PARAMETER = 2 * FLAGS_PRECISION, FLAGS_BASE = 2 * FLAGS_PRECISION_PARAMETER, FLAGS_BASE_PARAMETER = 2 * FLAGS_BASE, FLAGS_FLOAT_E = 2 * FLAGS_BASE_PARAMETER, FLAGS_FLOAT_G = 2 * FLAGS_FLOAT_E, FLAGS_QUOTE = 2 * FLAGS_FLOAT_G, FLAGS_WIDECHAR = 2 * FLAGS_QUOTE, FLAGS_ALLOC = 2 * FLAGS_WIDECHAR, FLAGS_IGNORE = 2 * FLAGS_ALLOC, FLAGS_IGNORE_PARAMETER = 2 * FLAGS_IGNORE, FLAGS_VARSIZE_PARAMETER = 2 * FLAGS_IGNORE_PARAMETER, FLAGS_FIXED_SIZE = 2 * FLAGS_VARSIZE_PARAMETER, FLAGS_LAST = FLAGS_FIXED_SIZE, /* Reused flags */ FLAGS_EXCLUDE = FLAGS_SHORT, FLAGS_USER_DEFINED = FLAGS_IGNORE, FLAGS_ROUNDING = FLAGS_INTMAX_T, /* Compounded flags */ FLAGS_ALL_VARSIZES = FLAGS_LONG | FLAGS_QUAD | FLAGS_INTMAX_T | FLAGS_PTRDIFF_T | FLAGS_SIZE_T, FLAGS_ALL_SIZES = FLAGS_ALL_VARSIZES | FLAGS_SHORTSHORT | FLAGS_SHORT, NO_POSITION = -1, NO_WIDTH = 0, NO_PRECISION = -1, NO_SIZE = -1, /* Do not change these */ NO_BASE = -1, MIN_BASE = 2, MAX_BASE = 36, BASE_BINARY = 2, BASE_OCTAL = 8, BASE_DECIMAL = 10, BASE_HEX = 16, /* Maximal number of allowed parameters */ MAX_PARAMETERS = 64, /* Maximal number of characters in class */ MAX_CHARACTER_CLASS = UCHAR_MAX + 1, #if TRIO_FEATURE_USER_DEFINED /* Maximal string lengths for user-defined specifiers */ MAX_USER_NAME = 64, MAX_USER_DATA = 256, #endif /* Maximal length of locale separator strings */ MAX_LOCALE_SEPARATOR_LENGTH = MB_LEN_MAX, /* Maximal number of integers in grouping */ MAX_LOCALE_GROUPS = 64, }; #define NO_GROUPING ((int)CHAR_MAX) /* Fundamental formatting parameter types */ #define FORMAT_UNKNOWN 0 #define FORMAT_INT 1 #define FORMAT_DOUBLE 2 #define FORMAT_CHAR 3 #define FORMAT_STRING 4 #define FORMAT_POINTER 5 #define FORMAT_COUNT 6 #define FORMAT_PARAMETER 7 #define FORMAT_GROUP 8 #define FORMAT_ERRNO 9 #define FORMAT_USER_DEFINED 10 /* Character constants */ #define CHAR_IDENTIFIER '%' #define CHAR_BACKSLASH '\\' #define CHAR_QUOTE '\"' #define CHAR_ADJUST ' ' #if TRIO_EXTENSION /* Character class expressions */ # define CLASS_ALNUM "[:alnum:]" # define CLASS_ALPHA "[:alpha:]" # define CLASS_BLANK "[:blank:]" # define CLASS_CNTRL "[:cntrl:]" # define CLASS_DIGIT "[:digit:]" # define CLASS_GRAPH "[:graph:]" # define CLASS_LOWER "[:lower:]" # define CLASS_PRINT "[:print:]" # define CLASS_PUNCT "[:punct:]" # define CLASS_SPACE "[:space:]" # define CLASS_UPPER "[:upper:]" # define CLASS_XDIGIT "[:xdigit:]" #endif /* * SPECIFIERS: * * * a Hex-float * A Hex-float * c Character * C Widechar character (wint_t) * d Decimal * e Float * E Float * F Float * F Float * g Float * G Float * i Integer * m Error message * n Count * o Octal * p Pointer * s String * S Widechar string (wchar_t *) * u Unsigned * x Hex * X Hex * [] Group * <> User-defined * * Reserved: * * D Binary Coded Decimal %D(length,precision) (OS/390) */ #define SPECIFIER_CHAR 'c' #define SPECIFIER_STRING 's' #define SPECIFIER_DECIMAL 'd' #define SPECIFIER_INTEGER 'i' #define SPECIFIER_UNSIGNED 'u' #define SPECIFIER_OCTAL 'o' #define SPECIFIER_HEX 'x' #define SPECIFIER_HEX_UPPER 'X' #if TRIO_FEATURE_FLOAT # define SPECIFIER_FLOAT_E 'e' # define SPECIFIER_FLOAT_E_UPPER 'E' # define SPECIFIER_FLOAT_F 'f' # define SPECIFIER_FLOAT_F_UPPER 'F' # define SPECIFIER_FLOAT_G 'g' # define SPECIFIER_FLOAT_G_UPPER 'G' #endif #define SPECIFIER_POINTER 'p' #if TRIO_FEATURE_SCANF # define SPECIFIER_GROUP '[' # define SPECIFIER_UNGROUP ']' #endif #define SPECIFIER_COUNT 'n' #if TRIO_UNIX98 # define SPECIFIER_CHAR_UPPER 'C' # define SPECIFIER_STRING_UPPER 'S' #endif #define SPECIFIER_HEXFLOAT 'a' #define SPECIFIER_HEXFLOAT_UPPER 'A' #define SPECIFIER_ERRNO 'm' #if TRIO_FEATURE_BINARY # define SPECIFIER_BINARY 'b' # define SPECIFIER_BINARY_UPPER 'B' #endif #if TRIO_FEATURE_USER_DEFINED # define SPECIFIER_USER_DEFINED_BEGIN '<' # define SPECIFIER_USER_DEFINED_END '>' # define SPECIFIER_USER_DEFINED_SEPARATOR ':' #endif /* * QUALIFIERS: * * * Numbers = d,i,o,u,x,X * Float = a,A,e,E,f,F,g,G * String = s * Char = c * * * 9$ Position * Use the 9th parameter. 9 can be any number between 1 and * the maximal argument * * 9 Width * Set width to 9. 9 can be any number, but must not be postfixed * by '$' * * h Short * Numbers: * (unsigned) short int * * hh Short short * Numbers: * (unsigned) char * * l Long * Numbers: * (unsigned) long int * String: * as the S specifier * Char: * as the C specifier * * ll Long Long * Numbers: * (unsigned) long long int * * L Long Double * Float * long double * * # Alternative * Float: * Decimal-point is always present * String: * non-printable characters are handled as \number * * Spacing * * + Sign * * - Alignment * * . Precision * * * Parameter * print: use parameter * scan: no parameter (ignore) * * q Quad * * Z size_t * * w Widechar * * ' Thousands/quote * Numbers: * Integer part grouped in thousands * Binary numbers: * Number grouped in nibbles (4 bits) * String: * Quoted string * * j intmax_t * t prtdiff_t * z size_t * * ! Sticky * @ Parameter (for both print and scan) * * I n-bit Integer * Numbers: * The following options exists * I8 = 8-bit integer * I16 = 16-bit integer * I32 = 32-bit integer * I64 = 64-bit integer */ #define QUALIFIER_POSITION '$' #define QUALIFIER_SHORT 'h' #define QUALIFIER_LONG 'l' #define QUALIFIER_LONG_UPPER 'L' #define QUALIFIER_ALTERNATIVE '#' #define QUALIFIER_SPACE ' ' #define QUALIFIER_PLUS '+' #define QUALIFIER_MINUS '-' #define QUALIFIER_DOT '.' #define QUALIFIER_STAR '*' #define QUALIFIER_CIRCUMFLEX '^' /* For scanlists */ #define QUALIFIER_SIZE_T 'z' #define QUALIFIER_PTRDIFF_T 't' #define QUALIFIER_INTMAX_T 'j' #define QUALIFIER_QUAD 'q' #define QUALIFIER_SIZE_T_UPPER 'Z' #if TRIO_MISC # define QUALIFIER_WIDECHAR 'w' #endif #define QUALIFIER_FIXED_SIZE 'I' #define QUALIFIER_QUOTE '\'' #define QUALIFIER_STICKY '!' #define QUALIFIER_VARSIZE '&' /* This should remain undocumented */ #define QUALIFIER_ROUNDING_UPPER 'R' #if TRIO_EXTENSION # define QUALIFIER_PARAM '@' /* Experimental */ # define QUALIFIER_COLON ':' /* For scanlists */ # define QUALIFIER_EQUAL '=' /* For scanlists */ #endif /************************************************************************* * * Internal Structures * *************************************************************************/ /* Parameters */ typedef struct { /* An indication of which entry in the data union is used */ int type; /* The flags */ trio_flags_t flags; /* The width qualifier */ int width; /* The precision qualifier */ int precision; /* The base qualifier */ int base; /* The size for the variable size qualifier */ int varsize; /* The marker of the end of the specifier */ int indexAfterSpecifier; /* The data from the argument list */ union { char *string; #if TRIO_FEATURE_WIDECHAR trio_wchar_t *wstring; #endif trio_pointer_t pointer; union { trio_intmax_t as_signed; trio_uintmax_t as_unsigned; } number; #if TRIO_FEATURE_FLOAT double doubleNumber; double *doublePointer; trio_long_double_t longdoubleNumber; trio_long_double_t *longdoublePointer; #endif int errorNumber; } data; #if TRIO_FEATURE_USER_DEFINED /* For the user-defined specifier */ char user_name[MAX_USER_NAME]; char user_data[MAX_USER_DATA]; #endif } trio_parameter_t; /* Container for customized functions */ typedef struct { union { trio_outstream_t out; trio_instream_t in; } stream; trio_pointer_t closure; } trio_custom_t; /* General trio "class" */ typedef struct _trio_class_t { /* * The function to write characters to a stream. */ void (*OutStream) TRIO_PROTO((struct _trio_class_t *, int)); /* * The function to read characters from a stream. */ void (*InStream) TRIO_PROTO((struct _trio_class_t *, int *)); /* * The current location in the stream. */ trio_pointer_t location; /* * The character currently being processed. */ int current; /* * The number of characters that would have been written/read * if there had been sufficient space. */ int processed; /* * The number of characters that are actually written/read. * Processed and committed will only differ for the *nprintf * and *nscanf functions. */ int committed; /* * The upper limit of characters that may be written/read. */ int max; /* * The last output error that was detected. */ int error; } trio_class_t; /* References (for user-defined callbacks) */ typedef struct _trio_reference_t { trio_class_t *data; trio_parameter_t *parameter; } trio_reference_t; #if TRIO_FEATURE_USER_DEFINED /* Registered entries (for user-defined callbacks) */ typedef struct _trio_userdef_t { struct _trio_userdef_t *next; trio_callback_t callback; char *name; } trio_userdef_t; #endif /************************************************************************* * * Internal Variables * *************************************************************************/ static TRIO_CONST char rcsid[] = "@(#)$Id: trio.c,v 1.95 2005/12/26 17:15:21 breese Exp $"; #if TRIO_FEATURE_FLOAT /* * Need this to workaround a parser bug in HP C/iX compiler that fails * to resolves macro definitions that includes type 'long double', * e.g: va_arg(arg_ptr, long double) */ # if defined(TRIO_PLATFORM_MPEIX) static TRIO_CONST trio_long_double_t ___dummy_long_double = 0; # endif #endif static TRIO_CONST char internalNullString[] = "(nil)"; #if defined(USE_LOCALE) static struct lconv *internalLocaleValues = NULL; #endif /* * UNIX98 says "in a locale where the radix character is not defined, * the radix character defaults to a period (.)" */ #if TRIO_FEATURE_FLOAT || TRIO_FEATURE_LOCALE || defined(USE_LOCALE) static int internalDecimalPointLength = 1; static char internalDecimalPoint = '.'; static char internalDecimalPointString[MAX_LOCALE_SEPARATOR_LENGTH + 1] = "."; #endif #if TRIO_FEATURE_QUOTE || TRIO_FEATURE_LOCALE || TRIO_EXTENSION static int internalThousandSeparatorLength = 1; static char internalThousandSeparator[MAX_LOCALE_SEPARATOR_LENGTH + 1] = ","; static char internalGrouping[MAX_LOCALE_GROUPS] = { (char)NO_GROUPING }; #endif static TRIO_CONST char internalDigitsLower[] = "0123456789abcdefghijklmnopqrstuvwxyz"; static TRIO_CONST char internalDigitsUpper[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; #if TRIO_FEATURE_SCANF static BOOLEAN_T internalDigitsUnconverted = TRUE; static int internalDigitArray[128]; # if TRIO_EXTENSION static BOOLEAN_T internalCollationUnconverted = TRUE; static char internalCollationArray[MAX_CHARACTER_CLASS][MAX_CHARACTER_CLASS]; # endif #endif #if TRIO_FEATURE_USER_DEFINED static TRIO_VOLATILE trio_callback_t internalEnterCriticalRegion = NULL; static TRIO_VOLATILE trio_callback_t internalLeaveCriticalRegion = NULL; static trio_userdef_t *internalUserDef = NULL; #endif /************************************************************************* * * Internal Functions * ************************************************************************/ #if defined(TRIO_EMBED_NAN) # include "trionan.c" #endif #if defined(TRIO_EMBED_STRING) # include "triostr.c" #endif /************************************************************************* * TrioIsQualifier * * Description: * Remember to add all new qualifiers to this function. * QUALIFIER_POSITION must not be added. */ TRIO_PRIVATE BOOLEAN_T TrioIsQualifier TRIO_ARGS1((character), TRIO_CONST char character) { /* QUALIFIER_POSITION is not included */ switch (character) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': case QUALIFIER_PLUS: case QUALIFIER_MINUS: case QUALIFIER_SPACE: case QUALIFIER_DOT: case QUALIFIER_STAR: case QUALIFIER_ALTERNATIVE: case QUALIFIER_SHORT: case QUALIFIER_LONG: case QUALIFIER_CIRCUMFLEX: case QUALIFIER_LONG_UPPER: case QUALIFIER_SIZE_T: case QUALIFIER_PTRDIFF_T: case QUALIFIER_INTMAX_T: case QUALIFIER_QUAD: case QUALIFIER_SIZE_T_UPPER: #if defined(QUALIFIER_WIDECHAR) case QUALIFIER_WIDECHAR: #endif case QUALIFIER_QUOTE: case QUALIFIER_STICKY: case QUALIFIER_VARSIZE: #if defined(QUALIFIER_PARAM) case QUALIFIER_PARAM: #endif case QUALIFIER_FIXED_SIZE: case QUALIFIER_ROUNDING_UPPER: return TRUE; default: return FALSE; } } /************************************************************************* * TrioSetLocale */ #if defined(USE_LOCALE) TRIO_PRIVATE void TrioSetLocale(TRIO_NOARGS) { internalLocaleValues = (struct lconv *)localeconv(); if (internalLocaleValues) { if ((internalLocaleValues->decimal_point) && (internalLocaleValues->decimal_point[0] != NIL)) { internalDecimalPointLength = trio_length(internalLocaleValues->decimal_point); if (internalDecimalPointLength == 1) { internalDecimalPoint = internalLocaleValues->decimal_point[0]; } else { internalDecimalPoint = NIL; trio_copy_max(internalDecimalPointString, sizeof(internalDecimalPointString), internalLocaleValues->decimal_point); } } # if TRIO_EXTENSION if ((internalLocaleValues->thousands_sep) && (internalLocaleValues->thousands_sep[0] != NIL)) { trio_copy_max(internalThousandSeparator, sizeof(internalThousandSeparator), internalLocaleValues->thousands_sep); internalThousandSeparatorLength = trio_length(internalThousandSeparator); } # endif # if TRIO_EXTENSION if ((internalLocaleValues->grouping) && (internalLocaleValues->grouping[0] != NIL)) { trio_copy_max(internalGrouping, sizeof(internalGrouping), internalLocaleValues->grouping); } # endif } } #endif /* defined(USE_LOCALE) */ #if TRIO_FEATURE_FLOAT && TRIO_FEATURE_QUOTE TRIO_PRIVATE int TrioCalcThousandSeparatorLength TRIO_ARGS1((digits), int digits) { int count = 0; int step = NO_GROUPING; char *groupingPointer = internalGrouping; while (digits > 0) { if (*groupingPointer == CHAR_MAX) { /* Disable grouping */ break; /* while */ } else if (*groupingPointer == 0) { /* Repeat last group */ if (step == NO_GROUPING) { /* Error in locale */ break; /* while */ } } else { step = *groupingPointer++; } if (digits > step) count += internalThousandSeparatorLength; digits -= step; } return count; } #endif /* TRIO_FEATURE_FLOAT && TRIO_FEATURE_QUOTE */ #if TRIO_FEATURE_QUOTE TRIO_PRIVATE BOOLEAN_T TrioFollowedBySeparator TRIO_ARGS1((position), int position) { int step = 0; char *groupingPointer = internalGrouping; position--; if (position == 0) return FALSE; while (position > 0) { if (*groupingPointer == CHAR_MAX) { /* Disable grouping */ break; /* while */ } else if (*groupingPointer != 0) { step = *groupingPointer++; } if (step == 0) break; position -= step; } return (position == 0); } #endif /* TRIO_FEATURE_QUOTE */ /************************************************************************* * TrioGetPosition * * Get the %n$ position. */ TRIO_PRIVATE int TrioGetPosition TRIO_ARGS2((format, indexPointer), TRIO_CONST char *format, int *indexPointer) { #if TRIO_FEATURE_POSITIONAL char *tmpformat; int number = 0; int index = *indexPointer; number = (int)trio_to_long(&format[index], &tmpformat, BASE_DECIMAL); index = (int)(tmpformat - format); if ((number != 0) && (QUALIFIER_POSITION == format[index++])) { *indexPointer = index; /* * number is decreased by 1, because n$ starts from 1, whereas * the array it is indexing starts from 0. */ return number - 1; } #endif return NO_POSITION; } /************************************************************************* * TrioFindNamespace * * Find registered user-defined specifier. * The prev argument is used for optimization only. */ #if TRIO_FEATURE_USER_DEFINED TRIO_PRIVATE trio_userdef_t * TrioFindNamespace TRIO_ARGS2((name, prev), TRIO_CONST char *name, trio_userdef_t **prev) { trio_userdef_t *def; if (internalEnterCriticalRegion) (void)internalEnterCriticalRegion(NULL); for (def = internalUserDef; def; def = def->next) { /* Case-sensitive string comparison */ if (trio_equal_case(def->name, name)) break; if (prev) *prev = def; } if (internalLeaveCriticalRegion) (void)internalLeaveCriticalRegion(NULL); return def; } #endif /************************************************************************* * TrioPower * * Description: * Calculate pow(base, exponent), where number and exponent are integers. */ #if TRIO_FEATURE_FLOAT TRIO_PRIVATE trio_long_double_t TrioPower TRIO_ARGS2((number, exponent), int number, int exponent) { trio_long_double_t result; if (number == 10) { switch (exponent) { /* Speed up calculation of common cases */ case 0: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E-1); break; case 1: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+0); break; case 2: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+1); break; case 3: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+2); break; case 4: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+3); break; case 5: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+4); break; case 6: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+5); break; case 7: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+6); break; case 8: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+7); break; case 9: result = (trio_long_double_t)number * TRIO_SUFFIX_LONG(1E+8); break; default: result = trio_powl((trio_long_double_t)number, (trio_long_double_t)exponent); break; } } else { return trio_powl((trio_long_double_t)number, (trio_long_double_t)exponent); } return result; } #endif /* TRIO_FEATURE_FLOAT */ /************************************************************************* * TrioLogarithm */ #if TRIO_FEATURE_FLOAT TRIO_PRIVATE double TrioLogarithm TRIO_ARGS2((number, base), double number, int base) { double result; if (number <= 0.0) { /* xlC crashes on log(0) */ result = (number == 0.0) ? trio_ninf() : trio_nan(); } else { if (base == 10) { result = log10(number); } else { result = log10(number) / log10((double)base); } } return result; } #endif /* TRIO_FEATURE_FLOAT */ /************************************************************************* * TrioLogarithmBase */ #if TRIO_FEATURE_FLOAT TRIO_PRIVATE double TrioLogarithmBase TRIO_ARGS1((base), int base) { switch (base) { case BASE_BINARY : return 1.0; case BASE_OCTAL : return 3.0; case BASE_DECIMAL: return 3.321928094887362345; case BASE_HEX : return 4.0; default : return TrioLogarithm((double)base, 2); } } #endif /* TRIO_FEATURE_FLOAT */ /************************************************************************* * TrioParse * * Description: * Parse the format string */ TRIO_PRIVATE int TrioParse TRIO_ARGS5((type, format, parameters, arglist, argarray), int type, TRIO_CONST char *format, trio_parameter_t *parameters, va_list arglist, trio_pointer_t *argarray) { /* Count the number of times a parameter is referenced */ unsigned short usedEntries[MAX_PARAMETERS]; /* Parameter counters */ int parameterPosition; int currentParam; int maxParam = -1; /* Utility variables */ trio_flags_t flags; int width; int precision; int varsize; int base; int index; /* Index into formatting string */ int dots; /* Count number of dots in modifier part */ BOOLEAN_T positional; /* Does the specifier have a positional? */ BOOLEAN_T gotSticky = FALSE; /* Are there any sticky modifiers at all? */ /* * indices specifies the order in which the parameters must be * read from the va_args (this is necessary to handle positionals) */ int indices[MAX_PARAMETERS]; int pos = 0; /* Various variables */ char ch; #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) int charlen; #endif int save_errno; int i = -1; int num; char *tmpformat; /* * The 'parameters' array is not initialized, but we need to * know which entries we have used. */ memset(usedEntries, 0, sizeof(usedEntries)); save_errno = errno; index = 0; parameterPosition = 0; #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) (void)mblen(NULL, 0); #endif while (format[index]) { #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) if (! isascii(format[index])) { /* * Multibyte characters cannot be legal specifiers or * modifiers, so we skip over them. */ charlen = mblen(&format[index], MB_LEN_MAX); index += (charlen > 0) ? charlen : 1; continue; /* while */ } #endif /* TRIO_COMPILER_SUPPORTS_MULTIBYTE */ if (CHAR_IDENTIFIER == format[index++]) { if (CHAR_IDENTIFIER == format[index]) { index++; continue; /* while */ } flags = FLAGS_NEW; dots = 0; currentParam = TrioGetPosition(format, &index); positional = (NO_POSITION != currentParam); if (!positional) { /* We have no positional, get the next counter */ currentParam = parameterPosition; } if(currentParam >= MAX_PARAMETERS) { /* Bail out completely to make the error more obvious */ return TRIO_ERROR_RETURN(TRIO_ETOOMANY, index); } if (currentParam > maxParam) maxParam = currentParam; /* Default values */ width = NO_WIDTH; precision = NO_PRECISION; base = NO_BASE; varsize = NO_SIZE; while (TrioIsQualifier(format[index])) { ch = format[index++]; switch (ch) { case QUALIFIER_SPACE: flags |= FLAGS_SPACE; break; case QUALIFIER_PLUS: flags |= FLAGS_SHOWSIGN; break; case QUALIFIER_MINUS: flags |= FLAGS_LEFTADJUST; flags &= ~FLAGS_NILPADDING; break; case QUALIFIER_ALTERNATIVE: flags |= FLAGS_ALTERNATIVE; break; case QUALIFIER_DOT: if (dots == 0) /* Precision */ { dots++; /* Skip if no precision */ if (QUALIFIER_DOT == format[index]) break; /* After the first dot we have the precision */ flags |= FLAGS_PRECISION; if ((QUALIFIER_STAR == format[index]) #if defined(QUALIFIER_PARAM) || (QUALIFIER_PARAM == format[index]) #endif ) { index++; flags |= FLAGS_PRECISION_PARAMETER; precision = TrioGetPosition(format, &index); if (precision == NO_POSITION) { parameterPosition++; if (positional) precision = parameterPosition; else { precision = currentParam; currentParam = precision + 1; } } else { if (! positional) currentParam = precision + 1; if (width > maxParam) maxParam = precision; } if (currentParam > maxParam) maxParam = currentParam; } else { precision = trio_to_long(&format[index], &tmpformat, BASE_DECIMAL); index = (int)(tmpformat - format); } } else if (dots == 1) /* Base */ { dots++; /* After the second dot we have the base */ flags |= FLAGS_BASE; if ((QUALIFIER_STAR == format[index]) #if defined(QUALIFIER_PARAM) || (QUALIFIER_PARAM == format[index]) #endif ) { index++; flags |= FLAGS_BASE_PARAMETER; base = TrioGetPosition(format, &index); if (base == NO_POSITION) { parameterPosition++; if (positional) base = parameterPosition; else { base = currentParam; currentParam = base + 1; } } else { if (! positional) currentParam = base + 1; if (base > maxParam) maxParam = base; } if (currentParam > maxParam) maxParam = currentParam; } else { base = trio_to_long(&format[index], &tmpformat, BASE_DECIMAL); if (base > MAX_BASE) return TRIO_ERROR_RETURN(TRIO_EINVAL, index); index = (int)(tmpformat - format); } } else { return TRIO_ERROR_RETURN(TRIO_EINVAL, index); } break; /* QUALIFIER_DOT */ #if defined(QUALIFIER_PARAM) case QUALIFIER_PARAM: type = TYPE_PRINT; /* FALLTHROUGH */ #endif case QUALIFIER_STAR: /* This has different meanings for print and scan */ if (TYPE_PRINT == type) { /* Read with from parameter */ flags |= (FLAGS_WIDTH | FLAGS_WIDTH_PARAMETER); width = TrioGetPosition(format, &index); if (width == NO_POSITION) { parameterPosition++; if (positional) width = parameterPosition; else { width = currentParam; currentParam = width + 1; } } else { if (! positional) currentParam = width + 1; if (width > maxParam) maxParam = width; } if (currentParam > maxParam) maxParam = currentParam; } #if TRIO_FEATURE_SCANF else { /* Scan, but do not store result */ flags |= FLAGS_IGNORE; } #endif break; /* QUALIFIER_STAR */ case '0': if (! (flags & FLAGS_LEFTADJUST)) flags |= FLAGS_NILPADDING; /* FALLTHROUGH */ case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': flags |= FLAGS_WIDTH; /* &format[index - 1] is used to "rewind" the read * character from format */ width = trio_to_long(&format[index - 1], &tmpformat, BASE_DECIMAL); index = (int)(tmpformat - format); break; case QUALIFIER_SHORT: if (flags & FLAGS_SHORTSHORT) return TRIO_ERROR_RETURN(TRIO_EINVAL, index); else if (flags & FLAGS_SHORT) flags |= FLAGS_SHORTSHORT; else flags |= FLAGS_SHORT; break; case QUALIFIER_LONG: if (flags & FLAGS_QUAD) return TRIO_ERROR_RETURN(TRIO_EINVAL, index); else if (flags & FLAGS_LONG) flags |= FLAGS_QUAD; else flags |= FLAGS_LONG; break; #if TRIO_FEATURE_LONGDOUBLE case QUALIFIER_LONG_UPPER: flags |= FLAGS_LONGDOUBLE; break; #endif #if TRIO_FEATURE_SIZE_T case QUALIFIER_SIZE_T: flags |= FLAGS_SIZE_T; /* Modify flags for later truncation of number */ if (sizeof(size_t) == sizeof(trio_ulonglong_t)) flags |= FLAGS_QUAD; else if (sizeof(size_t) == sizeof(long)) flags |= FLAGS_LONG; break; #endif #if TRIO_FEATURE_PTRDIFF_T case QUALIFIER_PTRDIFF_T: flags |= FLAGS_PTRDIFF_T; if (sizeof(ptrdiff_t) == sizeof(trio_ulonglong_t)) flags |= FLAGS_QUAD; else if (sizeof(ptrdiff_t) == sizeof(long)) flags |= FLAGS_LONG; break; #endif #if TRIO_FEATURE_INTMAX_T case QUALIFIER_INTMAX_T: flags |= FLAGS_INTMAX_T; if (sizeof(trio_intmax_t) == sizeof(trio_ulonglong_t)) flags |= FLAGS_QUAD; else if (sizeof(trio_intmax_t) == sizeof(long)) flags |= FLAGS_LONG; break; #endif #if TRIO_FEATURE_QUAD case QUALIFIER_QUAD: flags |= FLAGS_QUAD; break; #endif #if TRIO_FEATURE_FIXED_SIZE case QUALIFIER_FIXED_SIZE: if (flags & FLAGS_FIXED_SIZE) return TRIO_ERROR_RETURN(TRIO_EINVAL, index); if (flags & (FLAGS_ALL_SIZES | FLAGS_LONGDOUBLE | FLAGS_WIDECHAR | FLAGS_VARSIZE_PARAMETER)) return TRIO_ERROR_RETURN(TRIO_EINVAL, index); if ((format[index] == '6') && (format[index + 1] == '4')) { varsize = sizeof(trio_int64_t); index += 2; } else if ((format[index] == '3') && (format[index + 1] == '2')) { varsize = sizeof(trio_int32_t); index += 2; } else if ((format[index] == '1') && (format[index + 1] == '6')) { varsize = sizeof(trio_int16_t); index += 2; } else if (format[index] == '8') { varsize = sizeof(trio_int8_t); index++; } else return TRIO_ERROR_RETURN(TRIO_EINVAL, index); flags |= FLAGS_FIXED_SIZE; break; #endif /* TRIO_FEATURE_FIXED_SIZE */ #if defined(QUALIFIER_WIDECHAR) case QUALIFIER_WIDECHAR: flags |= FLAGS_WIDECHAR; break; #endif #if TRIO_FEATURE_SIZE_T_UPPER case QUALIFIER_SIZE_T_UPPER: break; #endif #if TRIO_FEATURE_QUOTE case QUALIFIER_QUOTE: flags |= FLAGS_QUOTE; break; #endif #if TRIO_FEATURE_STICKY case QUALIFIER_STICKY: flags |= FLAGS_STICKY; gotSticky = TRUE; break; #endif #if TRIO_FEATURE_VARSIZE case QUALIFIER_VARSIZE: flags |= FLAGS_VARSIZE_PARAMETER; parameterPosition++; if (positional) varsize = parameterPosition; else { varsize = currentParam; currentParam = varsize + 1; } if (currentParam > maxParam) maxParam = currentParam; break; #endif #if TRIO_FEATURE_ROUNDING case QUALIFIER_ROUNDING_UPPER: flags |= FLAGS_ROUNDING; break; #endif default: /* Bail out completely to make the error more obvious */ return TRIO_ERROR_RETURN(TRIO_EINVAL, index); } } /* while qualifier */ /* * Parameters only need the type and value. The value is * read later. */ if (flags & FLAGS_WIDTH_PARAMETER) { usedEntries[width] += 1; parameters[pos].type = FORMAT_PARAMETER; parameters[pos].flags = 0; indices[width] = pos; width = pos++; } if (flags & FLAGS_PRECISION_PARAMETER) { usedEntries[precision] += 1; parameters[pos].type = FORMAT_PARAMETER; parameters[pos].flags = 0; indices[precision] = pos; precision = pos++; } if (flags & FLAGS_BASE_PARAMETER) { usedEntries[base] += 1; parameters[pos].type = FORMAT_PARAMETER; parameters[pos].flags = 0; indices[base] = pos; base = pos++; } if (flags & FLAGS_VARSIZE_PARAMETER) { usedEntries[varsize] += 1; parameters[pos].type = FORMAT_PARAMETER; parameters[pos].flags = 0; indices[varsize] = pos; varsize = pos++; } indices[currentParam] = pos; switch (format[index++]) { #if defined(SPECIFIER_CHAR_UPPER) case SPECIFIER_CHAR_UPPER: flags |= FLAGS_WIDECHAR; /* FALLTHROUGH */ #endif case SPECIFIER_CHAR: if (flags & FLAGS_LONG) flags |= FLAGS_WIDECHAR; else if (flags & FLAGS_SHORT) flags &= ~FLAGS_WIDECHAR; parameters[pos].type = FORMAT_CHAR; break; #if defined(SPECIFIER_STRING_UPPER) case SPECIFIER_STRING_UPPER: flags |= FLAGS_WIDECHAR; /* FALLTHROUGH */ #endif case SPECIFIER_STRING: if (flags & FLAGS_LONG) flags |= FLAGS_WIDECHAR; else if (flags & FLAGS_SHORT) flags &= ~FLAGS_WIDECHAR; parameters[pos].type = FORMAT_STRING; break; #if defined(SPECIFIER_GROUP) case SPECIFIER_GROUP: if (TYPE_SCAN == type) { int depth = 1; parameters[pos].type = FORMAT_GROUP; if (format[index] == QUALIFIER_CIRCUMFLEX) index++; if (format[index] == SPECIFIER_UNGROUP) index++; if (format[index] == QUALIFIER_MINUS) index++; /* Skip nested brackets */ while (format[index] != NIL) { if (format[index] == SPECIFIER_GROUP) { depth++; } else if (format[index] == SPECIFIER_UNGROUP) { if (--depth <= 0) { index++; break; } } index++; } } break; #endif /* defined(SPECIFIER_GROUP) */ case SPECIFIER_INTEGER: parameters[pos].type = FORMAT_INT; break; case SPECIFIER_UNSIGNED: flags |= FLAGS_UNSIGNED; parameters[pos].type = FORMAT_INT; break; case SPECIFIER_DECIMAL: /* Disable base modifier */ flags &= ~FLAGS_BASE_PARAMETER; base = BASE_DECIMAL; parameters[pos].type = FORMAT_INT; break; case SPECIFIER_OCTAL: flags |= FLAGS_UNSIGNED; flags &= ~FLAGS_BASE_PARAMETER; base = BASE_OCTAL; parameters[pos].type = FORMAT_INT; break; #if TRIO_FEATURE_BINARY case SPECIFIER_BINARY_UPPER: flags |= FLAGS_UPPER; /* FALLTHROUGH */ case SPECIFIER_BINARY: flags |= FLAGS_NILPADDING; flags &= ~FLAGS_BASE_PARAMETER; base = BASE_BINARY; parameters[pos].type = FORMAT_INT; break; #endif case SPECIFIER_HEX_UPPER: flags |= FLAGS_UPPER; /* FALLTHROUGH */ case SPECIFIER_HEX: flags |= FLAGS_UNSIGNED; flags &= ~FLAGS_BASE_PARAMETER; base = BASE_HEX; parameters[pos].type = FORMAT_INT; break; #if defined(SPECIFIER_FLOAT_E) # if defined(SPECIFIER_FLOAT_E_UPPER) case SPECIFIER_FLOAT_E_UPPER: flags |= FLAGS_UPPER; /* FALLTHROUGH */ # endif case SPECIFIER_FLOAT_E: flags |= FLAGS_FLOAT_E; parameters[pos].type = FORMAT_DOUBLE; break; #endif #if defined(SPECIFIER_FLOAT_G) # if defined(SPECIFIER_FLOAT_G_UPPER) case SPECIFIER_FLOAT_G_UPPER: flags |= FLAGS_UPPER; /* FALLTHROUGH */ # endif case SPECIFIER_FLOAT_G: flags |= FLAGS_FLOAT_G; parameters[pos].type = FORMAT_DOUBLE; break; #endif #if defined(SPECIFIER_FLOAT_F) # if defined(SPECIFIER_FLOAT_F_UPPER) case SPECIFIER_FLOAT_F_UPPER: flags |= FLAGS_UPPER; /* FALLTHROUGH */ # endif case SPECIFIER_FLOAT_F: parameters[pos].type = FORMAT_DOUBLE; break; #endif #if defined(TRIO_COMPILER_VISUALC) # pragma warning( push ) # pragma warning( disable : 4127 ) /* Conditional expression is constant */ #endif case SPECIFIER_POINTER: if (sizeof(trio_pointer_t) == sizeof(trio_ulonglong_t)) flags |= FLAGS_QUAD; else if (sizeof(trio_pointer_t) == sizeof(long)) flags |= FLAGS_LONG; parameters[pos].type = FORMAT_POINTER; break; #if defined(TRIO_COMPILER_VISUALC) # pragma warning( pop ) #endif case SPECIFIER_COUNT: parameters[pos].type = FORMAT_COUNT; break; #if TRIO_FEATURE_HEXFLOAT case SPECIFIER_HEXFLOAT_UPPER: flags |= FLAGS_UPPER; /* FALLTHROUGH */ case SPECIFIER_HEXFLOAT: base = BASE_HEX; parameters[pos].type = FORMAT_DOUBLE; break; #endif #if TRIO_FEATURE_ERRNO case SPECIFIER_ERRNO: parameters[pos].type = FORMAT_ERRNO; break; #endif #if TRIO_FEATURE_USER_DEFINED case SPECIFIER_USER_DEFINED_BEGIN: { unsigned int max; int without_namespace = TRUE; parameters[pos].type = FORMAT_USER_DEFINED; parameters[pos].user_name[0] = NIL; tmpformat = (char *)&format[index]; while ((ch = format[index]) != NIL) { index++; if (ch == SPECIFIER_USER_DEFINED_END) { if (without_namespace) { /* We must get the handle first */ parameters[pos].type = FORMAT_PARAMETER; parameters[pos].indexAfterSpecifier = index; parameters[pos].flags = FLAGS_USER_DEFINED; /* Adjust parameters for insertion of new one */ pos++; usedEntries[currentParam] += 1; parameters[pos].type = FORMAT_USER_DEFINED; currentParam++; indices[currentParam] = pos; if (currentParam > maxParam) maxParam = currentParam; } /* Copy the user data */ max = (unsigned int)(&format[index] - tmpformat); if (max > MAX_USER_DATA) max = MAX_USER_DATA; trio_copy_max(parameters[pos].user_data, max, tmpformat); break; /* while */ } if (ch == SPECIFIER_USER_DEFINED_SEPARATOR) { without_namespace = FALSE; /* Copy the namespace for later looking-up */ max = (int)(&format[index] - tmpformat); if (max > MAX_USER_NAME) max = MAX_USER_NAME; trio_copy_max(parameters[pos].user_name, max, tmpformat); tmpformat = (char *)&format[index]; } } if (ch != SPECIFIER_USER_DEFINED_END) return TRIO_ERROR_RETURN(TRIO_EINVAL, index); } break; #endif /* TRIO_FEATURE_USER_DEFINED */ default: /* Bail out completely to make the error more obvious */ return TRIO_ERROR_RETURN(TRIO_EINVAL, index); } /* Count the number of times this entry has been used */ usedEntries[currentParam] += 1; /* Find last sticky parameters */ if (gotSticky && !(flags & FLAGS_STICKY)) { for (i = pos - 1; i >= 0; i--) { if (parameters[i].type == FORMAT_PARAMETER) continue; if ((parameters[i].flags & FLAGS_STICKY) && (parameters[i].type == parameters[pos].type)) { /* Do not overwrite current qualifiers */ flags |= (parameters[i].flags & (unsigned long)~FLAGS_STICKY); if (width == NO_WIDTH) width = parameters[i].width; if (precision == NO_PRECISION) precision = parameters[i].precision; if (base == NO_BASE) base = parameters[i].base; break; } } } parameters[pos].indexAfterSpecifier = index; parameters[pos].flags = flags; parameters[pos].width = width; parameters[pos].precision = precision; parameters[pos].base = (base == NO_BASE) ? BASE_DECIMAL : base; parameters[pos].varsize = varsize; pos++; if (! positional) parameterPosition++; } /* if identifier */ } /* while format characters left */ for (num = 0; num <= maxParam; num++) { if (usedEntries[num] != 1) { if (usedEntries[num] == 0) /* gap detected */ return TRIO_ERROR_RETURN(TRIO_EGAP, num); else /* double references detected */ return TRIO_ERROR_RETURN(TRIO_EDBLREF, num); } i = indices[num]; /* * FORMAT_PARAMETERS are only present if they must be read, * so it makes no sense to check the ignore flag (besides, * the flags variable is not set for that particular type) */ if ((parameters[i].type != FORMAT_PARAMETER) && (parameters[i].flags & FLAGS_IGNORE)) continue; /* for all arguments */ /* * The stack arguments are read according to ANSI C89 * default argument promotions: * * char = int * short = int * unsigned char = unsigned int * unsigned short = unsigned int * float = double * * In addition to the ANSI C89 these types are read (the * default argument promotions of C99 has not been * considered yet) * * long long * long double * size_t * ptrdiff_t * intmax_t */ switch (parameters[i].type) { case FORMAT_GROUP: case FORMAT_STRING: #if TRIO_FEATURE_WIDECHAR if (flags & FLAGS_WIDECHAR) { parameters[i].data.wstring = (argarray == NULL) ? va_arg(arglist, trio_wchar_t *) : (trio_wchar_t *)(argarray[num]); } else #endif { parameters[i].data.string = (argarray == NULL) ? va_arg(arglist, char *) : (char *)(argarray[num]); } break; #if TRIO_FEATURE_USER_DEFINED case FORMAT_USER_DEFINED: #endif case FORMAT_POINTER: case FORMAT_COUNT: case FORMAT_UNKNOWN: parameters[i].data.pointer = (argarray == NULL) ? va_arg(arglist, trio_pointer_t ) : argarray[num]; break; case FORMAT_CHAR: case FORMAT_INT: #if TRIO_FEATURE_SCANF if (TYPE_SCAN == type) { if (argarray == NULL) parameters[i].data.pointer = (trio_pointer_t)va_arg(arglist, trio_pointer_t); else { if (parameters[i].type == FORMAT_CHAR) parameters[i].data.pointer = (trio_pointer_t)((char *)argarray[num]); else if (parameters[i].flags & FLAGS_SHORT) parameters[i].data.pointer = (trio_pointer_t)((short *)argarray[num]); else parameters[i].data.pointer = (trio_pointer_t)((int *)argarray[num]); } } else #endif /* TRIO_FEATURE_SCANF */ { #if TRIO_FEATURE_VARSIZE || TRIO_FEATURE_FIXED_SIZE if (parameters[i].flags & (FLAGS_VARSIZE_PARAMETER | FLAGS_FIXED_SIZE)) { if (parameters[i].flags & FLAGS_VARSIZE_PARAMETER) { /* * Variable sizes are mapped onto the fixed sizes, in * accordance with integer promotion. * * Please note that this may not be portable, as we * only guess the size, not the layout of the numbers. * For example, if int is little-endian, and long is * big-endian, then this will fail. */ varsize = (int)parameters[parameters[i].varsize].data.number.as_unsigned; } else { /* Used for the I modifiers */ varsize = parameters[i].varsize; } parameters[i].flags &= ~FLAGS_ALL_VARSIZES; if (varsize <= (int)sizeof(int)) ; else if (varsize <= (int)sizeof(long)) parameters[i].flags |= FLAGS_LONG; #if TRIO_FEATURE_INTMAX_T else if (varsize <= (int)sizeof(trio_longlong_t)) parameters[i].flags |= FLAGS_QUAD; else parameters[i].flags |= FLAGS_INTMAX_T; #else else parameters[i].flags |= FLAGS_QUAD; #endif } #endif /* TRIO_FEATURE_VARSIZE */ #if TRIO_FEATURE_SIZE_T || TRIO_FEATURE_SIZE_T_UPPER if (parameters[i].flags & FLAGS_SIZE_T) parameters[i].data.number.as_unsigned = (argarray == NULL) ? (trio_uintmax_t)va_arg(arglist, size_t) : (trio_uintmax_t)(*((size_t *)argarray[num])); else #endif #if TRIO_FEATURE_PTRDIFF_T if (parameters[i].flags & FLAGS_PTRDIFF_T) parameters[i].data.number.as_unsigned = (argarray == NULL) ? (trio_uintmax_t)va_arg(arglist, ptrdiff_t) : (trio_uintmax_t)(*((ptrdiff_t *)argarray[num])); else #endif #if TRIO_FEATURE_INTMAX_T if (parameters[i].flags & FLAGS_INTMAX_T) parameters[i].data.number.as_unsigned = (argarray == NULL) ? (trio_uintmax_t)va_arg(arglist, trio_intmax_t) : (trio_uintmax_t)(*((trio_intmax_t *)argarray[num])); else #endif if (parameters[i].flags & FLAGS_QUAD) parameters[i].data.number.as_unsigned = (argarray == NULL) ? (trio_uintmax_t)va_arg(arglist, trio_ulonglong_t) : (trio_uintmax_t)(*((trio_ulonglong_t *)argarray[num])); else if (parameters[i].flags & FLAGS_LONG) parameters[i].data.number.as_unsigned = (argarray == NULL) ? (trio_uintmax_t)va_arg(arglist, long) : (trio_uintmax_t)(*((long *)argarray[num])); else { if (argarray == NULL) parameters[i].data.number.as_unsigned = (trio_uintmax_t)va_arg(arglist, int); else { if (parameters[i].type == FORMAT_CHAR) parameters[i].data.number.as_unsigned = (trio_uintmax_t)(*((char *)argarray[num])); else if (parameters[i].flags & FLAGS_SHORT) parameters[i].data.number.as_unsigned = (trio_uintmax_t)(*((short *)argarray[num])); else parameters[i].data.number.as_unsigned = (trio_uintmax_t)(*((int *)argarray[num])); } } } break; case FORMAT_PARAMETER: /* * The parameter for the user-defined specifier is a pointer, * whereas the rest (width, precision, base) uses an integer. */ if (parameters[i].flags & FLAGS_USER_DEFINED) parameters[i].data.pointer = (argarray == NULL) ? va_arg(arglist, trio_pointer_t ) : argarray[num]; else parameters[i].data.number.as_unsigned = (argarray == NULL) ? (trio_uintmax_t)va_arg(arglist, int) : (trio_uintmax_t)(*((int *)argarray[num])); break; #if TRIO_FEATURE_FLOAT case FORMAT_DOUBLE: # if TRIO_FEATURE_SCANF if (TYPE_SCAN == type) { if (parameters[i].flags & FLAGS_LONGDOUBLE) parameters[i].data.longdoublePointer = (argarray == NULL) ? va_arg(arglist, trio_long_double_t *) : (trio_long_double_t *)argarray[num]; else { if (parameters[i].flags & FLAGS_LONG) parameters[i].data.doublePointer = (argarray == NULL) ? va_arg(arglist, double *) : (double *)argarray[num]; else parameters[i].data.doublePointer = (argarray == NULL) ? (double *)va_arg(arglist, float *) : (double *)((float *)argarray[num]); } } else # endif /* TRIO_FEATURE_SCANF */ { if (parameters[i].flags & FLAGS_LONGDOUBLE) parameters[i].data.longdoubleNumber = (argarray == NULL) ? va_arg(arglist, trio_long_double_t) : (trio_long_double_t)(*((trio_long_double_t *)argarray[num])); else { if (argarray == NULL) parameters[i].data.longdoubleNumber = (trio_long_double_t)va_arg(arglist, double); else { if (parameters[i].flags & FLAGS_SHORT) parameters[i].data.longdoubleNumber = (trio_long_double_t)(*((float *)argarray[num])); else parameters[i].data.longdoubleNumber = (trio_long_double_t)(*((double *)argarray[num])); } } } break; #endif /* TRIO_FEATURE_FLOAT */ #if TRIO_FEATURE_ERRNO case FORMAT_ERRNO: parameters[i].data.errorNumber = save_errno; break; #endif default: break; } } /* for all specifiers */ return num; } /************************************************************************* * * FORMATTING * ************************************************************************/ /************************************************************************* * TrioWriteNumber * * Description: * Output a number. * The complexity of this function is a result of the complexity * of the dependencies of the flags. */ TRIO_PRIVATE void TrioWriteNumber TRIO_ARGS6((self, number, flags, width, precision, base), trio_class_t *self, trio_uintmax_t number, trio_flags_t flags, int width, int precision, int base) { BOOLEAN_T isNegative; BOOLEAN_T isNumberZero; BOOLEAN_T isPrecisionZero; BOOLEAN_T ignoreNumber; char buffer[MAX_CHARS_IN(trio_uintmax_t) * (1 + MAX_LOCALE_SEPARATOR_LENGTH) + 1]; char *bufferend; char *pointer; TRIO_CONST char *digits; int i; #if TRIO_FEATURE_QUOTE int length; char *p; #endif int count; int digitIndex; assert(VALID(self)); assert(VALID(self->OutStream)); assert(((base >= MIN_BASE) && (base <= MAX_BASE)) || (base == NO_BASE)); digits = (flags & FLAGS_UPPER) ? internalDigitsUpper : internalDigitsLower; if (base == NO_BASE) base = BASE_DECIMAL; isNumberZero = (number == 0); isPrecisionZero = (precision == 0); ignoreNumber = (isNumberZero && isPrecisionZero && !((flags & FLAGS_ALTERNATIVE) && (base == BASE_OCTAL))); if (flags & FLAGS_UNSIGNED) { isNegative = FALSE; flags &= ~FLAGS_SHOWSIGN; } else { isNegative = ((trio_intmax_t)number < 0); if (isNegative) number = -((trio_intmax_t)number); } if (flags & FLAGS_QUAD) number &= (trio_ulonglong_t)-1; else if (flags & FLAGS_LONG) number &= (unsigned long)-1; else number &= (unsigned int)-1; /* Build number */ pointer = bufferend = &buffer[sizeof(buffer) - 1]; *pointer-- = NIL; for (i = 1; i < (int)sizeof(buffer); i++) { digitIndex = number % base; *pointer-- = digits[digitIndex]; number /= base; if (number == 0) break; #if TRIO_FEATURE_QUOTE if ((flags & FLAGS_QUOTE) && TrioFollowedBySeparator(i + 1)) { /* * We are building the number from the least significant * to the most significant digit, so we have to copy the * thousand separator backwards */ length = internalThousandSeparatorLength; if (((int)(pointer - buffer) - length) > 0) { p = &internalThousandSeparator[length - 1]; while (length-- > 0) *pointer-- = *p--; } } #endif } if (! ignoreNumber) { /* Adjust width */ width -= (bufferend - pointer) - 1; } /* Adjust precision */ if (NO_PRECISION != precision) { precision -= (bufferend - pointer) - 1; if (precision < 0) precision = 0; flags |= FLAGS_NILPADDING; } /* Calculate padding */ count = (! ((flags & FLAGS_LEFTADJUST) || (precision == NO_PRECISION))) ? precision : 0; /* Adjust width further */ if (isNegative || (flags & FLAGS_SHOWSIGN) || (flags & FLAGS_SPACE)) width--; if ((flags & FLAGS_ALTERNATIVE) && !isNumberZero) { switch (base) { case BASE_BINARY: case BASE_HEX: width -= 2; break; case BASE_OCTAL: if (!(flags & FLAGS_NILPADDING) || (count == 0)) width--; break; default: break; } } /* Output prefixes spaces if needed */ if (! ((flags & FLAGS_LEFTADJUST) || ((flags & FLAGS_NILPADDING) && (precision == NO_PRECISION)))) { while (width-- > count) self->OutStream(self, CHAR_ADJUST); } /* width has been adjusted for signs and alternatives */ if (isNegative) self->OutStream(self, '-'); else if (flags & FLAGS_SHOWSIGN) self->OutStream(self, '+'); else if (flags & FLAGS_SPACE) self->OutStream(self, ' '); /* Prefix is not written when the value is zero */ if ((flags & FLAGS_ALTERNATIVE) && !isNumberZero) { switch (base) { case BASE_BINARY: self->OutStream(self, '0'); self->OutStream(self, (flags & FLAGS_UPPER) ? 'B' : 'b'); break; case BASE_OCTAL: if (!(flags & FLAGS_NILPADDING) || (count == 0)) self->OutStream(self, '0'); break; case BASE_HEX: self->OutStream(self, '0'); self->OutStream(self, (flags & FLAGS_UPPER) ? 'X' : 'x'); break; default: break; } /* switch base */ } /* Output prefixed zero padding if needed */ if (flags & FLAGS_NILPADDING) { if (precision == NO_PRECISION) precision = width; while (precision-- > 0) { self->OutStream(self, '0'); width--; } } if (! ignoreNumber) { /* Output the number itself */ while (*(++pointer)) { self->OutStream(self, *pointer); } } /* Output trailing spaces if needed */ if (flags & FLAGS_LEFTADJUST) { while (width-- > 0) self->OutStream(self, CHAR_ADJUST); } } /************************************************************************* * TrioWriteStringCharacter * * Description: * Output a single character of a string */ TRIO_PRIVATE void TrioWriteStringCharacter TRIO_ARGS3((self, ch, flags), trio_class_t *self, int ch, trio_flags_t flags) { if (flags & FLAGS_ALTERNATIVE) { if (! isprint(ch)) { /* * Non-printable characters are converted to C escapes or * \number, if no C escape exists. */ self->OutStream(self, CHAR_BACKSLASH); switch (ch) { case '\007': self->OutStream(self, 'a'); break; case '\b': self->OutStream(self, 'b'); break; case '\f': self->OutStream(self, 'f'); break; case '\n': self->OutStream(self, 'n'); break; case '\r': self->OutStream(self, 'r'); break; case '\t': self->OutStream(self, 't'); break; case '\v': self->OutStream(self, 'v'); break; case '\\': self->OutStream(self, '\\'); break; default: self->OutStream(self, 'x'); TrioWriteNumber(self, (trio_uintmax_t)ch, FLAGS_UNSIGNED | FLAGS_NILPADDING, 2, 2, BASE_HEX); break; } } else if (ch == CHAR_BACKSLASH) { self->OutStream(self, CHAR_BACKSLASH); self->OutStream(self, CHAR_BACKSLASH); } else { self->OutStream(self, ch); } } else { self->OutStream(self, ch); } } /************************************************************************* * TrioWriteString * * Description: * Output a string */ TRIO_PRIVATE void TrioWriteString TRIO_ARGS5((self, string, flags, width, precision), trio_class_t *self, TRIO_CONST char *string, trio_flags_t flags, int width, int precision) { int length; int ch; assert(VALID(self)); assert(VALID(self->OutStream)); if (string == NULL) { string = internalNullString; length = sizeof(internalNullString) - 1; #if TRIO_FEATURE_QUOTE /* Disable quoting for the null pointer */ flags &= (~FLAGS_QUOTE); #endif width = 0; } else { length = trio_length(string); } if ((NO_PRECISION != precision) && (precision < length)) { length = precision; } width -= length; #if TRIO_FEATURE_QUOTE if (flags & FLAGS_QUOTE) self->OutStream(self, CHAR_QUOTE); #endif if (! (flags & FLAGS_LEFTADJUST)) { while (width-- > 0) self->OutStream(self, CHAR_ADJUST); } while (length-- > 0) { /* The ctype parameters must be an unsigned char (or EOF) */ ch = (int)((unsigned char)(*string++)); TrioWriteStringCharacter(self, ch, flags); } if (flags & FLAGS_LEFTADJUST) { while (width-- > 0) self->OutStream(self, CHAR_ADJUST); } #if TRIO_FEATURE_QUOTE if (flags & FLAGS_QUOTE) self->OutStream(self, CHAR_QUOTE); #endif } /************************************************************************* * TrioWriteWideStringCharacter * * Description: * Output a wide string as a multi-byte sequence */ #if TRIO_FEATURE_WIDECHAR TRIO_PRIVATE int TrioWriteWideStringCharacter TRIO_ARGS4((self, wch, flags, width), trio_class_t *self, trio_wchar_t wch, trio_flags_t flags, int width) { int size; int i; int ch; char *string; char buffer[MB_LEN_MAX + 1]; if (width == NO_WIDTH) width = sizeof(buffer); size = wctomb(buffer, wch); if ((size <= 0) || (size > width) || (buffer[0] == NIL)) return 0; string = buffer; i = size; while ((width >= i) && (width-- > 0) && (i-- > 0)) { /* The ctype parameters must be an unsigned char (or EOF) */ ch = (int)((unsigned char)(*string++)); TrioWriteStringCharacter(self, ch, flags); } return size; } #endif /* TRIO_FEATURE_WIDECHAR */ /************************************************************************* * TrioWriteWideString * * Description: * Output a wide character string as a multi-byte string */ #if TRIO_FEATURE_WIDECHAR TRIO_PRIVATE void TrioWriteWideString TRIO_ARGS5((self, wstring, flags, width, precision), trio_class_t *self, TRIO_CONST trio_wchar_t *wstring, trio_flags_t flags, int width, int precision) { int length; int size; assert(VALID(self)); assert(VALID(self->OutStream)); #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) (void)mblen(NULL, 0); #endif if (wstring == NULL) { TrioWriteString(self, NULL, flags, width, precision); return; } if (NO_PRECISION == precision) { length = INT_MAX; } else { length = precision; width -= length; } #if TRIO_FEATURE_QUOTE if (flags & FLAGS_QUOTE) self->OutStream(self, CHAR_QUOTE); #endif if (! (flags & FLAGS_LEFTADJUST)) { while (width-- > 0) self->OutStream(self, CHAR_ADJUST); } while (length > 0) { size = TrioWriteWideStringCharacter(self, *wstring++, flags, length); if (size == 0) break; /* while */ length -= size; } if (flags & FLAGS_LEFTADJUST) { while (width-- > 0) self->OutStream(self, CHAR_ADJUST); } #if TRIO_FEATURE_QUOTE if (flags & FLAGS_QUOTE) self->OutStream(self, CHAR_QUOTE); #endif } #endif /* TRIO_FEATURE_WIDECHAR */ /************************************************************************* * TrioWriteDouble * * http://wwwold.dkuug.dk/JTC1/SC22/WG14/www/docs/dr_211.htm * * "5.2.4.2.2 paragraph #4 * * The accuracy [...] is implementation defined, as is the accuracy * of the conversion between floating-point internal representations * and string representations performed by the libray routine in * " */ /* FIXME: handle all instances of constant long-double number (L) * and *l() math functions. */ #if TRIO_FEATURE_FLOAT TRIO_PRIVATE void TrioWriteDouble TRIO_ARGS6((self, number, flags, width, precision, base), trio_class_t *self, trio_long_double_t number, trio_flags_t flags, int width, int precision, int base) { trio_long_double_t integerNumber; trio_long_double_t fractionNumber; trio_long_double_t workNumber; int integerDigits; int fractionDigits; int exponentDigits; int baseDigits; int integerThreshold; int fractionThreshold; int expectedWidth; int exponent = 0; unsigned int uExponent = 0; int exponentBase; trio_long_double_t dblBase; trio_long_double_t dblFractionBase; trio_long_double_t integerAdjust; trio_long_double_t fractionAdjust; trio_long_double_t workFractionNumber; trio_long_double_t workFractionAdjust; int fractionDigitsInspect; BOOLEAN_T isNegative; BOOLEAN_T isExponentNegative = FALSE; BOOLEAN_T requireTwoDigitExponent; BOOLEAN_T isHex; TRIO_CONST char *digits; # if TRIO_FEATURE_QUOTE char *groupingPointer; # endif int i; int index; BOOLEAN_T hasOnlyZeroes; int leadingFractionZeroes = 0; register int trailingZeroes; BOOLEAN_T keepTrailingZeroes; BOOLEAN_T keepDecimalPoint; trio_long_double_t epsilon; assert(VALID(self)); assert(VALID(self->OutStream)); assert(((base >= MIN_BASE) && (base <= MAX_BASE)) || (base == NO_BASE)); /* Determine sign and look for special quantities */ switch (trio_fpclassify_and_signbit(number, &isNegative)) { case TRIO_FP_NAN: TrioWriteString(self, (flags & FLAGS_UPPER) ? NAN_UPPER : NAN_LOWER, flags, width, precision); return; case TRIO_FP_INFINITE: if (isNegative) { /* Negative infinity */ TrioWriteString(self, (flags & FLAGS_UPPER) ? "-" INFINITE_UPPER : "-" INFINITE_LOWER, flags, width, precision); return; } else { /* Positive infinity */ TrioWriteString(self, (flags & FLAGS_UPPER) ? INFINITE_UPPER : INFINITE_LOWER, flags, width, precision); return; } default: /* Finitude */ break; } /* Normal numbers */ if (flags & FLAGS_LONGDOUBLE) { baseDigits = (base == 10) ? LDBL_DIG : (int)floor(LDBL_MANT_DIG / TrioLogarithmBase(base)); epsilon = LDBL_EPSILON; } else if (flags & FLAGS_SHORT) { baseDigits = (base == BASE_DECIMAL) ? FLT_DIG : (int)floor(FLT_MANT_DIG / TrioLogarithmBase(base)); epsilon = FLT_EPSILON; } else { baseDigits = (base == BASE_DECIMAL) ? DBL_DIG : (int)floor(DBL_MANT_DIG / TrioLogarithmBase(base)); epsilon = DBL_EPSILON; } digits = (flags & FLAGS_UPPER) ? internalDigitsUpper : internalDigitsLower; isHex = (base == BASE_HEX); if (base == NO_BASE) base = BASE_DECIMAL; dblBase = (trio_long_double_t)base; keepTrailingZeroes = !( (flags & FLAGS_ROUNDING) || ( (flags & FLAGS_FLOAT_G) && !(flags & FLAGS_ALTERNATIVE) ) ); # if TRIO_FEATURE_ROUNDING if (flags & FLAGS_ROUNDING) { precision = baseDigits; } # endif if (precision == NO_PRECISION) { if (isHex) { keepTrailingZeroes = FALSE; precision = FLT_MANT_DIG; } else { precision = FLT_DIG; } } if (isNegative) { number = -number; } if (isHex) { flags |= FLAGS_FLOAT_E; } reprocess: if (flags & FLAGS_FLOAT_G) { if (precision == 0) precision = 1; if ( (number < 1.0E-4) || (number >= trio_powl(base, (trio_long_double_t)precision)) ) { /* Use scientific notation */ flags |= FLAGS_FLOAT_E; } else if (number < 1.0) { /* * Use normal notation. If the integer part of the number is * zero, then adjust the precision to include leading fractional * zeros. */ workNumber = TrioLogarithm(number, base); workNumber = TRIO_FABS(workNumber); if (workNumber - trio_floorl(workNumber) < epsilon) workNumber--; leadingFractionZeroes = (int)trio_floorl(workNumber); } } if (flags & FLAGS_FLOAT_E) { /* Scale the number */ workNumber = TrioLogarithm(number, base); if (trio_isinf(workNumber) == -1) { exponent = 0; /* Undo setting */ if (flags & FLAGS_FLOAT_G) flags &= ~FLAGS_FLOAT_E; } else { exponent = (int)trio_floorl(workNumber); number /= trio_powl(dblBase, (trio_long_double_t)exponent); isExponentNegative = (exponent < 0); uExponent = (isExponentNegative) ? -exponent : exponent; if (isHex) uExponent *= 4; /* log16(2) */ #if TRIO_FEATURE_QUOTE /* No thousand separators */ flags &= ~FLAGS_QUOTE; #endif } } integerNumber = trio_floorl(number); fractionNumber = number - integerNumber; /* * Truncated number. * * Precision is number of significant digits for FLOAT_G and number of * fractional digits for others. */ integerDigits = 1; if (integerNumber > epsilon) { integerDigits += (int)TrioLogarithm(integerNumber, base); } fractionDigits = precision; if (flags & FLAGS_FLOAT_G) { if (leadingFractionZeroes > 0) { fractionDigits += leadingFractionZeroes; } if ((integerNumber > epsilon) || (number <= epsilon)) { fractionDigits -= integerDigits; } } dblFractionBase = TrioPower(base, fractionDigits); workNumber = number + 0.5 / dblFractionBase; if (trio_floorl(number) != trio_floorl(workNumber)) { if ((flags & FLAGS_FLOAT_G) && !(flags & FLAGS_FLOAT_E)) { /* The adjustment may require a change to scientific notation */ if ( (workNumber < 1.0E-4) || (workNumber >= trio_powl(base, (trio_long_double_t)precision)) ) { /* Use scientific notation */ flags |= FLAGS_FLOAT_E; goto reprocess; } } if (flags & FLAGS_FLOAT_E) { /* Adjust if number was rounded up one digit (ie. 0.99 to 1.00) */ exponent++; isExponentNegative = (exponent < 0); uExponent = (isExponentNegative) ? -exponent : exponent; if (isHex) uExponent *= 4; /* log16(2) */ workNumber = (number + 0.5 / dblFractionBase) / dblBase; integerNumber = trio_floorl(workNumber); fractionNumber = workNumber - integerNumber; } else { /* Adjust if number was rounded up one digit (ie. 99 to 100) */ integerNumber = trio_floorl(number + 0.5); fractionNumber = 0.0; integerDigits = (integerNumber > epsilon) ? 1 + (int)TrioLogarithm(integerNumber, base) : 1; if (flags & FLAGS_FLOAT_G) { fractionDigits = 0; } } } /* Estimate accuracy */ integerAdjust = fractionAdjust = 0.5; # if TRIO_FEATURE_ROUNDING if (flags & FLAGS_ROUNDING) { if (integerDigits > baseDigits) { integerThreshold = baseDigits; fractionDigits = 0; dblFractionBase = 1.0; fractionThreshold = 0; precision = 0; /* Disable decimal-point */ integerAdjust = TrioPower(base, integerDigits - integerThreshold - 1); fractionAdjust = 0.0; } else { integerThreshold = integerDigits; fractionThreshold = fractionDigits - integerThreshold; fractionAdjust = 1.0; } } else # endif { integerThreshold = INT_MAX; fractionThreshold = INT_MAX; } /* * Calculate expected width. * sign + integer part + thousands separators + decimal point * + fraction + exponent */ fractionAdjust /= dblFractionBase; hasOnlyZeroes = (trio_floorl((fractionNumber + fractionAdjust) * dblFractionBase) < epsilon); keepDecimalPoint = ( (flags & FLAGS_ALTERNATIVE) || !((precision == 0) || (!keepTrailingZeroes && hasOnlyZeroes)) ); expectedWidth = integerDigits + fractionDigits; if (!keepTrailingZeroes) { trailingZeroes = 0; workFractionNumber = fractionNumber; workFractionAdjust = fractionAdjust; fractionDigitsInspect = fractionDigits; if (integerDigits > integerThreshold) { fractionDigitsInspect = 0; } else if (fractionThreshold <= fractionDigits) { fractionDigitsInspect = fractionThreshold + 1; } trailingZeroes = fractionDigits - fractionDigitsInspect; for (i = 0; i < fractionDigitsInspect; i++) { workFractionNumber *= dblBase; workFractionAdjust *= dblBase; workNumber = trio_floorl(workFractionNumber + workFractionAdjust); workFractionNumber -= workNumber; index = (int)trio_fmodl(workNumber, dblBase); if (index == 0) { trailingZeroes++; } else { trailingZeroes = 0; } } expectedWidth -= trailingZeroes; } if (keepDecimalPoint) { expectedWidth += internalDecimalPointLength; } #if TRIO_FEATURE_QUOTE if (flags & FLAGS_QUOTE) { expectedWidth += TrioCalcThousandSeparatorLength(integerDigits); } #endif if (isNegative || (flags & FLAGS_SHOWSIGN) || (flags & FLAGS_SPACE)) { expectedWidth += sizeof("-") - 1; } exponentDigits = 0; if (flags & FLAGS_FLOAT_E) { exponentDigits = (uExponent == 0) ? 1 : (int)ceil(TrioLogarithm((double)(uExponent + 1), (isHex) ? 10 : base)); } requireTwoDigitExponent = ((base == BASE_DECIMAL) && (exponentDigits == 1)); if (exponentDigits > 0) { expectedWidth += exponentDigits; expectedWidth += (requireTwoDigitExponent ? sizeof("E+0") - 1 : sizeof("E+") - 1); } if (isHex) { expectedWidth += sizeof("0X") - 1; } /* Output prefixing */ if (flags & FLAGS_NILPADDING) { /* Leading zeros must be after sign */ if (isNegative) self->OutStream(self, '-'); else if (flags & FLAGS_SHOWSIGN) self->OutStream(self, '+'); else if (flags & FLAGS_SPACE) self->OutStream(self, ' '); if (isHex) { self->OutStream(self, '0'); self->OutStream(self, (flags & FLAGS_UPPER) ? 'X' : 'x'); } if (!(flags & FLAGS_LEFTADJUST)) { for (i = expectedWidth; i < width; i++) { self->OutStream(self, '0'); } } } else { /* Leading spaces must be before sign */ if (!(flags & FLAGS_LEFTADJUST)) { for (i = expectedWidth; i < width; i++) { self->OutStream(self, CHAR_ADJUST); } } if (isNegative) self->OutStream(self, '-'); else if (flags & FLAGS_SHOWSIGN) self->OutStream(self, '+'); else if (flags & FLAGS_SPACE) self->OutStream(self, ' '); if (isHex) { self->OutStream(self, '0'); self->OutStream(self, (flags & FLAGS_UPPER) ? 'X' : 'x'); } } /* Output the integer part and thousand separators */ for (i = 0; i < integerDigits; i++) { workNumber = trio_floorl(((integerNumber + integerAdjust) / TrioPower(base, integerDigits - i - 1))); if (i > integerThreshold) { /* Beyond accuracy */ self->OutStream(self, digits[0]); } else { self->OutStream(self, digits[(int)trio_fmodl(workNumber, dblBase)]); } #if TRIO_FEATURE_QUOTE if (((flags & (FLAGS_FLOAT_E | FLAGS_QUOTE)) == FLAGS_QUOTE) && TrioFollowedBySeparator(integerDigits - i)) { for (groupingPointer = internalThousandSeparator; *groupingPointer != NIL; groupingPointer++) { self->OutStream(self, *groupingPointer); } } #endif } /* Insert decimal point and build the fraction part */ trailingZeroes = 0; if (keepDecimalPoint) { if (internalDecimalPoint) { self->OutStream(self, internalDecimalPoint); } else { for (i = 0; i < internalDecimalPointLength; i++) { self->OutStream(self, internalDecimalPointString[i]); } } } for (i = 0; i < fractionDigits; i++) { if ((integerDigits > integerThreshold) || (i > fractionThreshold)) { /* Beyond accuracy */ trailingZeroes++; } else { fractionNumber *= dblBase; fractionAdjust *= dblBase; workNumber = trio_floorl(fractionNumber + fractionAdjust); if (workNumber > fractionNumber) { /* fractionNumber should never become negative */ fractionNumber = 0.0; fractionAdjust = 0.0; } else { fractionNumber -= workNumber; } index = (int)trio_fmodl(workNumber, dblBase); if (index == 0) { trailingZeroes++; } else { while (trailingZeroes > 0) { /* Not trailing zeroes after all */ self->OutStream(self, digits[0]); trailingZeroes--; } self->OutStream(self, digits[index]); } } } if (keepTrailingZeroes) { while (trailingZeroes > 0) { self->OutStream(self, digits[0]); trailingZeroes--; } } /* Output exponent */ if (exponentDigits > 0) { self->OutStream(self, isHex ? ((flags & FLAGS_UPPER) ? 'P' : 'p') : ((flags & FLAGS_UPPER) ? 'E' : 'e')); self->OutStream(self, (isExponentNegative) ? '-' : '+'); /* The exponent must contain at least two digits */ if (requireTwoDigitExponent) self->OutStream(self, '0'); if (isHex) base = 10; exponentBase = (int)TrioPower(base, exponentDigits - 1); for (i = 0; i < exponentDigits; i++) { self->OutStream(self, digits[(uExponent / exponentBase) % base]); exponentBase /= base; } } /* Output trailing spaces */ if (flags & FLAGS_LEFTADJUST) { for (i = expectedWidth; i < width; i++) { self->OutStream(self, CHAR_ADJUST); } } } #endif /* TRIO_FEATURE_FLOAT */ /************************************************************************* * TrioFormatProcess * * Description: * This is the main engine for formatting output */ TRIO_PRIVATE int TrioFormatProcess TRIO_ARGS3((data, format, parameters), trio_class_t *data, TRIO_CONST char *format, trio_parameter_t *parameters) { #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) int charlen; #endif int i; #if TRIO_FEATURE_ERRNO TRIO_CONST char *string; #endif trio_pointer_t pointer; trio_flags_t flags; int width; int precision; int base; int index; index = 0; i = 0; #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) (void)mblen(NULL, 0); #endif while (format[index]) { #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) if (! isascii(format[index])) { charlen = mblen(&format[index], MB_LEN_MAX); /* * Only valid multibyte characters are handled here. Invalid * multibyte characters (charlen == -1) are handled as normal * characters. */ if (charlen != -1) { while (charlen-- > 0) { data->OutStream(data, format[index++]); } continue; /* while characters left in formatting string */ } } #endif /* TRIO_COMPILER_SUPPORTS_MULTIBYTE */ if (CHAR_IDENTIFIER == format[index]) { if (CHAR_IDENTIFIER == format[index + 1]) { data->OutStream(data, CHAR_IDENTIFIER); index += 2; } else { /* Skip the parameter entries */ while (parameters[i].type == FORMAT_PARAMETER) i++; flags = parameters[i].flags; /* Find width */ width = parameters[i].width; if (flags & FLAGS_WIDTH_PARAMETER) { /* Get width from parameter list */ width = (int)parameters[width].data.number.as_signed; if (width < 0) { /* * A negative width is the same as the - flag and * a positive width. */ flags |= FLAGS_LEFTADJUST; flags &= ~FLAGS_NILPADDING; width = -width; } } /* Find precision */ if (flags & FLAGS_PRECISION) { precision = parameters[i].precision; if (flags & FLAGS_PRECISION_PARAMETER) { /* Get precision from parameter list */ precision = (int)parameters[precision].data.number.as_signed; if (precision < 0) { /* * A negative precision is the same as no * precision */ precision = NO_PRECISION; } } } else { precision = NO_PRECISION; } /* Find base */ base = parameters[i].base; if (flags & FLAGS_BASE_PARAMETER) { /* Get base from parameter list */ base = (int)parameters[base].data.number.as_signed; } switch (parameters[i].type) { case FORMAT_CHAR: #if TRIO_FEATURE_QUOTE if (flags & FLAGS_QUOTE) data->OutStream(data, CHAR_QUOTE); #endif if (! (flags & FLAGS_LEFTADJUST)) { while (--width > 0) data->OutStream(data, CHAR_ADJUST); } #if TRIO_FEATURE_WIDECHAR if (flags & FLAGS_WIDECHAR) { TrioWriteWideStringCharacter(data, (trio_wchar_t)parameters[i].data.number.as_signed, flags, NO_WIDTH); } else #endif { TrioWriteStringCharacter(data, (int)parameters[i].data.number.as_signed, flags); } if (flags & FLAGS_LEFTADJUST) { while(--width > 0) data->OutStream(data, CHAR_ADJUST); } #if TRIO_FEATURE_QUOTE if (flags & FLAGS_QUOTE) data->OutStream(data, CHAR_QUOTE); #endif break; /* FORMAT_CHAR */ case FORMAT_INT: TrioWriteNumber(data, parameters[i].data.number.as_unsigned, flags, width, precision, base); break; /* FORMAT_INT */ #if TRIO_FEATURE_FLOAT case FORMAT_DOUBLE: TrioWriteDouble(data, parameters[i].data.longdoubleNumber, flags, width, precision, base); break; /* FORMAT_DOUBLE */ #endif case FORMAT_STRING: #if TRIO_FEATURE_WIDECHAR if (flags & FLAGS_WIDECHAR) { TrioWriteWideString(data, parameters[i].data.wstring, flags, width, precision); } else #endif { TrioWriteString(data, parameters[i].data.string, flags, width, precision); } break; /* FORMAT_STRING */ case FORMAT_POINTER: { trio_reference_t reference; reference.data = data; reference.parameter = ¶meters[i]; trio_print_pointer(&reference, parameters[i].data.pointer); } break; /* FORMAT_POINTER */ case FORMAT_COUNT: pointer = parameters[i].data.pointer; if (NULL != pointer) { /* * C99 paragraph 7.19.6.1.8 says "the number of * characters written to the output stream so far by * this call", which is data->committed */ #if TRIO_FEATURE_SIZE_T || TRIO_FEATURE_SIZE_T_UPPER if (flags & FLAGS_SIZE_T) *(size_t *)pointer = (size_t)data->committed; else #endif #if TRIO_FEATURE_PTRDIFF_T if (flags & FLAGS_PTRDIFF_T) *(ptrdiff_t *)pointer = (ptrdiff_t)data->committed; else #endif #if TRIO_FEATURE_INTMAX_T if (flags & FLAGS_INTMAX_T) *(trio_intmax_t *)pointer = (trio_intmax_t)data->committed; else #endif if (flags & FLAGS_QUAD) { *(trio_ulonglong_t *)pointer = (trio_ulonglong_t)data->committed; } else if (flags & FLAGS_LONG) { *(long int *)pointer = (long int)data->committed; } else if (flags & FLAGS_SHORT) { *(short int *)pointer = (short int)data->committed; } else { *(int *)pointer = (int)data->committed; } } break; /* FORMAT_COUNT */ case FORMAT_PARAMETER: break; /* FORMAT_PARAMETER */ #if TRIO_FEATURE_ERRNO case FORMAT_ERRNO: string = trio_error(parameters[i].data.errorNumber); if (string) { TrioWriteString(data, string, flags, width, precision); } else { data->OutStream(data, '#'); TrioWriteNumber(data, (trio_uintmax_t)parameters[i].data.errorNumber, flags, width, precision, BASE_DECIMAL); } break; /* FORMAT_ERRNO */ #endif /* TRIO_FEATURE_ERRNO */ #if TRIO_FEATURE_USER_DEFINED case FORMAT_USER_DEFINED: { trio_reference_t reference; trio_userdef_t *def = NULL; if (parameters[i].user_name[0] == NIL) { /* Use handle */ if ((i > 0) || (parameters[i - 1].type == FORMAT_PARAMETER)) def = (trio_userdef_t *)parameters[i - 1].data.pointer; } else { /* Look up namespace */ def = TrioFindNamespace(parameters[i].user_name, NULL); } if (def) { reference.data = data; reference.parameter = ¶meters[i]; def->callback(&reference); } } break; #endif /* TRIO_FEATURE_USER_DEFINED */ default: break; } /* switch parameter type */ /* Prepare for next */ index = parameters[i].indexAfterSpecifier; i++; } } else /* not identifier */ { data->OutStream(data, format[index++]); } } return data->processed; } /************************************************************************* * TrioFormatRef */ #if TRIO_EXTENSION TRIO_PRIVATE int TrioFormatRef TRIO_ARGS4((reference, format, arglist, argarray), trio_reference_t *reference, TRIO_CONST char *format, va_list arglist, trio_pointer_t *argarray) { int status; trio_parameter_t parameters[MAX_PARAMETERS]; status = TrioParse(TYPE_PRINT, format, parameters, arglist, argarray); if (status < 0) return status; status = TrioFormatProcess(reference->data, format, parameters); if (reference->data->error != 0) { status = reference->data->error; } return status; } #endif /* TRIO_EXTENSION */ /************************************************************************* * TrioFormat */ TRIO_PRIVATE int TrioFormat TRIO_ARGS6((destination, destinationSize, OutStream, format, arglist, argarray), trio_pointer_t destination, size_t destinationSize, void (*OutStream) TRIO_PROTO((trio_class_t *, int)), TRIO_CONST char *format, va_list arglist, trio_pointer_t *argarray) { int status; trio_class_t data; trio_parameter_t parameters[MAX_PARAMETERS]; assert(VALID(OutStream)); assert(VALID(format)); memset(&data, 0, sizeof(data)); data.OutStream = OutStream; data.location = destination; data.max = destinationSize; data.error = 0; #if defined(USE_LOCALE) if (NULL == internalLocaleValues) { TrioSetLocale(); } #endif status = TrioParse(TYPE_PRINT, format, parameters, arglist, argarray); if (status < 0) return status; status = TrioFormatProcess(&data, format, parameters); if (data.error != 0) { status = data.error; } return status; } /************************************************************************* * TrioOutStreamFile */ #if TRIO_FEATURE_FILE || TRIO_FEATURE_STDIO TRIO_PRIVATE void TrioOutStreamFile TRIO_ARGS2((self, output), trio_class_t *self, int output) { FILE *file; assert(VALID(self)); assert(VALID(self->location)); file = (FILE *)self->location; self->processed++; if (fputc(output, file) == EOF) { self->error = TRIO_ERROR_RETURN(TRIO_EOF, 0); } else { self->committed++; } } #endif /* TRIO_FEATURE_FILE || TRIO_FEATURE_STDIO */ /************************************************************************* * TrioOutStreamFileDescriptor */ #if TRIO_FEATURE_FD TRIO_PRIVATE void TrioOutStreamFileDescriptor TRIO_ARGS2((self, output), trio_class_t *self, int output) { int fd; char ch; assert(VALID(self)); fd = *((int *)self->location); ch = (char)output; self->processed++; if (write(fd, &ch, sizeof(char)) == -1) { self->error = TRIO_ERROR_RETURN(TRIO_ERRNO, 0); } else { self->committed++; } } #endif /* TRIO_FEATURE_FD */ /************************************************************************* * TrioOutStreamCustom */ #if TRIO_FEATURE_CLOSURE TRIO_PRIVATE void TrioOutStreamCustom TRIO_ARGS2((self, output), trio_class_t *self, int output) { int status; trio_custom_t *data; assert(VALID(self)); assert(VALID(self->location)); data = (trio_custom_t *)self->location; if (data->stream.out) { status = (data->stream.out)(data->closure, output); if (status >= 0) { self->committed++; } else { if (self->error == 0) { self->error = TRIO_ERROR_RETURN(TRIO_ECUSTOM, -status); } } } self->processed++; } #endif /* TRIO_FEATURE_CLOSURE */ /************************************************************************* * TrioOutStreamString */ TRIO_PRIVATE void TrioOutStreamString TRIO_ARGS2((self, output), trio_class_t *self, int output) { char **buffer; assert(VALID(self)); assert(VALID(self->location)); buffer = (char **)self->location; **buffer = (char)output; (*buffer)++; self->processed++; self->committed++; } /************************************************************************* * TrioOutStreamStringMax */ TRIO_PRIVATE void TrioOutStreamStringMax TRIO_ARGS2((self, output), trio_class_t *self, int output) { char **buffer; assert(VALID(self)); assert(VALID(self->location)); buffer = (char **)self->location; if (self->processed < self->max) { **buffer = (char)output; (*buffer)++; self->committed++; } self->processed++; } /************************************************************************* * TrioOutStreamStringDynamic */ #if TRIO_FEATURE_DYNAMICSTRING TRIO_PRIVATE void TrioOutStreamStringDynamic TRIO_ARGS2((self, output), trio_class_t *self, int output) { assert(VALID(self)); assert(VALID(self->location)); if (self->error == 0) { trio_xstring_append_char((trio_string_t *)self->location, (char)output); self->committed++; } /* The processed variable must always be increased */ self->processed++; } #endif /* TRIO_FEATURE_DYNAMICSTRING */ /************************************************************************* * * Formatted printing functions * ************************************************************************/ #if defined(TRIO_DOCUMENTATION) # include "doc/doc_printf.h" #endif /** @addtogroup Printf @{ */ /************************************************************************* * printf */ /** Print to standard output stream. @param format Formatting string. @param ... Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_STDIO TRIO_PUBLIC int trio_printf TRIO_VARGS2((format, va_alist), TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(format)); TRIO_VA_START(args, format); status = TrioFormat(stdout, 0, TrioOutStreamFile, format, args, NULL); TRIO_VA_END(args); return status; } #endif /* TRIO_FEATURE_STDIO */ /** Print to standard output stream. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_STDIO TRIO_PUBLIC int trio_vprintf TRIO_ARGS2((format, args), TRIO_CONST char *format, va_list args) { assert(VALID(format)); return TrioFormat(stdout, 0, TrioOutStreamFile, format, args, NULL); } #endif /* TRIO_FEATURE_STDIO */ /** Print to standard output stream. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_STDIO TRIO_PUBLIC int trio_printfv TRIO_ARGS2((format, args), TRIO_CONST char *format, trio_pointer_t * args) { static va_list unused; assert(VALID(format)); return TrioFormat(stdout, 0, TrioOutStreamFile, format, unused, args); } #endif /* TRIO_FEATURE_STDIO */ /************************************************************************* * fprintf */ /** Print to file. @param file File pointer. @param format Formatting string. @param ... Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_FILE TRIO_PUBLIC int trio_fprintf TRIO_VARGS3((file, format, va_alist), FILE *file, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(file)); assert(VALID(format)); TRIO_VA_START(args, format); status = TrioFormat(file, 0, TrioOutStreamFile, format, args, NULL); TRIO_VA_END(args); return status; } #endif /* TRIO_FEATURE_FILE */ /** Print to file. @param file File pointer. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_FILE TRIO_PUBLIC int trio_vfprintf TRIO_ARGS3((file, format, args), FILE *file, TRIO_CONST char *format, va_list args) { assert(VALID(file)); assert(VALID(format)); return TrioFormat(file, 0, TrioOutStreamFile, format, args, NULL); } #endif /* TRIO_FEATURE_FILE */ /** Print to file. @param file File pointer. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_FILE TRIO_PUBLIC int trio_fprintfv TRIO_ARGS3((file, format, args), FILE *file, TRIO_CONST char *format, trio_pointer_t * args) { static va_list unused; assert(VALID(file)); assert(VALID(format)); return TrioFormat(file, 0, TrioOutStreamFile, format, unused, args); } #endif /* TRIO_FEATURE_FILE */ /************************************************************************* * dprintf */ /** Print to file descriptor. @param fd File descriptor. @param format Formatting string. @param ... Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_FD TRIO_PUBLIC int trio_dprintf TRIO_VARGS3((fd, format, va_alist), int fd, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(format)); TRIO_VA_START(args, format); status = TrioFormat(&fd, 0, TrioOutStreamFileDescriptor, format, args, NULL); TRIO_VA_END(args); return status; } #endif /* TRIO_FEATURE_FD */ /** Print to file descriptor. @param fd File descriptor. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_FD TRIO_PUBLIC int trio_vdprintf TRIO_ARGS3((fd, format, args), int fd, TRIO_CONST char *format, va_list args) { assert(VALID(format)); return TrioFormat(&fd, 0, TrioOutStreamFileDescriptor, format, args, NULL); } #endif /* TRIO_FEATURE_FD */ /** Print to file descriptor. @param fd File descriptor. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_FD TRIO_PUBLIC int trio_dprintfv TRIO_ARGS3((fd, format, args), int fd, TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; assert(VALID(format)); return TrioFormat(&fd, 0, TrioOutStreamFileDescriptor, format, unused, args); } #endif /* TRIO_FEATURE_FD */ /************************************************************************* * cprintf */ #if TRIO_FEATURE_CLOSURE TRIO_PUBLIC int trio_cprintf TRIO_VARGS4((stream, closure, format, va_alist), trio_outstream_t stream, trio_pointer_t closure, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; trio_custom_t data; assert(VALID(stream)); assert(VALID(format)); TRIO_VA_START(args, format); data.stream.out = stream; data.closure = closure; status = TrioFormat(&data, 0, TrioOutStreamCustom, format, args, NULL); TRIO_VA_END(args); return status; } #endif /* TRIO_FEATURE_CLOSURE */ #if TRIO_FEATURE_CLOSURE TRIO_PUBLIC int trio_vcprintf TRIO_ARGS4((stream, closure, format, args), trio_outstream_t stream, trio_pointer_t closure, TRIO_CONST char *format, va_list args) { trio_custom_t data; assert(VALID(stream)); assert(VALID(format)); data.stream.out = stream; data.closure = closure; return TrioFormat(&data, 0, TrioOutStreamCustom, format, args, NULL); } #endif /* TRIO_FEATURE_CLOSURE */ #if TRIO_FEATURE_CLOSURE TRIO_PUBLIC int trio_cprintfv TRIO_ARGS4((stream, closure, format, args), trio_outstream_t stream, trio_pointer_t closure, TRIO_CONST char *format, void **args) { static va_list unused; trio_custom_t data; assert(VALID(stream)); assert(VALID(format)); data.stream.out = stream; data.closure = closure; return TrioFormat(&data, 0, TrioOutStreamCustom, format, unused, args); } #endif /* TRIO_FEATURE_CLOSURE */ /************************************************************************* * sprintf */ /** Print to string. @param buffer Output string. @param format Formatting string. @param ... Arguments. @return Number of printed characters. */ TRIO_PUBLIC int trio_sprintf TRIO_VARGS3((buffer, format, va_alist), char *buffer, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(buffer)); assert(VALID(format)); TRIO_VA_START(args, format); status = TrioFormat(&buffer, 0, TrioOutStreamString, format, args, NULL); *buffer = NIL; /* Terminate with NIL character */ TRIO_VA_END(args); return status; } /** Print to string. @param buffer Output string. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ TRIO_PUBLIC int trio_vsprintf TRIO_ARGS3((buffer, format, args), char *buffer, TRIO_CONST char *format, va_list args) { int status; assert(VALID(buffer)); assert(VALID(format)); status = TrioFormat(&buffer, 0, TrioOutStreamString, format, args, NULL); *buffer = NIL; return status; } /** Print to string. @param buffer Output string. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ TRIO_PUBLIC int trio_sprintfv TRIO_ARGS3((buffer, format, args), char *buffer, TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; int status; assert(VALID(buffer)); assert(VALID(format)); status = TrioFormat(&buffer, 0, TrioOutStreamString, format, unused, args); *buffer = NIL; return status; } /************************************************************************* * snprintf */ /** Print at most @p max characters to string. @param buffer Output string. @param max Maximum number of characters to print. @param format Formatting string. @param ... Arguments. @return Number of printed characters. */ TRIO_PUBLIC int trio_snprintf TRIO_VARGS4((buffer, max, format, va_alist), char *buffer, size_t max, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(buffer)); assert(VALID(format)); TRIO_VA_START(args, format); status = TrioFormat(&buffer, max > 0 ? max - 1 : 0, TrioOutStreamStringMax, format, args, NULL); if (max > 0) *buffer = NIL; TRIO_VA_END(args); return status; } /** Print at most @p max characters to string. @param buffer Output string. @param max Maximum number of characters to print. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ TRIO_PUBLIC int trio_vsnprintf TRIO_ARGS4((buffer, max, format, args), char *buffer, size_t max, TRIO_CONST char *format, va_list args) { int status; assert(VALID(buffer)); assert(VALID(format)); status = TrioFormat(&buffer, max > 0 ? max - 1 : 0, TrioOutStreamStringMax, format, args, NULL); if (max > 0) *buffer = NIL; return status; } /** Print at most @p max characters to string. @param buffer Output string. @param max Maximum number of characters to print. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ TRIO_PUBLIC int trio_snprintfv TRIO_ARGS4((buffer, max, format, args), char *buffer, size_t max, TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; int status; assert(VALID(buffer)); assert(VALID(format)); status = TrioFormat(&buffer, max > 0 ? max - 1 : 0, TrioOutStreamStringMax, format, unused, args); if (max > 0) *buffer = NIL; return status; } /************************************************************************* * snprintfcat * Appends the new string to the buffer string overwriting the '\0' * character at the end of buffer. */ #if TRIO_EXTENSION TRIO_PUBLIC int trio_snprintfcat TRIO_VARGS4((buffer, max, format, va_alist), char *buffer, size_t max, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; size_t buf_len; TRIO_VA_START(args, format); assert(VALID(buffer)); assert(VALID(format)); buf_len = trio_length(buffer); buffer = &buffer[buf_len]; status = TrioFormat(&buffer, max - 1 - buf_len, TrioOutStreamStringMax, format, args, NULL); TRIO_VA_END(args); *buffer = NIL; return status; } #endif #if TRIO_EXTENSION TRIO_PUBLIC int trio_vsnprintfcat TRIO_ARGS4((buffer, max, format, args), char *buffer, size_t max, TRIO_CONST char *format, va_list args) { int status; size_t buf_len; assert(VALID(buffer)); assert(VALID(format)); buf_len = trio_length(buffer); buffer = &buffer[buf_len]; status = TrioFormat(&buffer, max - 1 - buf_len, TrioOutStreamStringMax, format, args, NULL); *buffer = NIL; return status; } #endif /************************************************************************* * trio_aprintf */ /* Deprecated */ #if TRIO_FEATURE_DYNAMICSTRING TRIO_PUBLIC char * trio_aprintf TRIO_VARGS2((format, va_alist), TRIO_CONST char *format, TRIO_VA_DECL) { va_list args; trio_string_t *info; char *result = NULL; assert(VALID(format)); info = trio_xstring_duplicate(""); if (info) { TRIO_VA_START(args, format); (void)TrioFormat(info, 0, TrioOutStreamStringDynamic, format, args, NULL); TRIO_VA_END(args); trio_string_terminate(info); result = trio_string_extract(info); trio_string_destroy(info); } return result; } #endif /* TRIO_FEATURE_DYNAMICSTRING */ /* Deprecated */ #if TRIO_FEATURE_DYNAMICSTRING TRIO_PUBLIC char * trio_vaprintf TRIO_ARGS2((format, args), TRIO_CONST char *format, va_list args) { trio_string_t *info; char *result = NULL; assert(VALID(format)); info = trio_xstring_duplicate(""); if (info) { (void)TrioFormat(info, 0, TrioOutStreamStringDynamic, format, args, NULL); trio_string_terminate(info); result = trio_string_extract(info); trio_string_destroy(info); } return result; } #endif /* TRIO_FEATURE_DYNAMICSTRING */ /** Allocate and print to string. The memory allocated and returned by @p result must be freed by the calling application. @param result Output string. @param format Formatting string. @param ... Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_DYNAMICSTRING TRIO_PUBLIC int trio_asprintf TRIO_VARGS3((result, format, va_alist), char **result, TRIO_CONST char *format, TRIO_VA_DECL) { va_list args; int status; trio_string_t *info; assert(VALID(format)); *result = NULL; info = trio_xstring_duplicate(""); if (info == NULL) { status = TRIO_ERROR_RETURN(TRIO_ENOMEM, 0); } else { TRIO_VA_START(args, format); status = TrioFormat(info, 0, TrioOutStreamStringDynamic, format, args, NULL); TRIO_VA_END(args); if (status >= 0) { trio_string_terminate(info); *result = trio_string_extract(info); } trio_string_destroy(info); } return status; } #endif /* TRIO_FEATURE_DYNAMICSTRING */ /** Allocate and print to string. The memory allocated and returned by @p result must be freed by the calling application. @param result Output string. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_DYNAMICSTRING TRIO_PUBLIC int trio_vasprintf TRIO_ARGS3((result, format, args), char **result, TRIO_CONST char *format, va_list args) { int status; trio_string_t *info; assert(VALID(format)); *result = NULL; info = trio_xstring_duplicate(""); if (info == NULL) { status = TRIO_ERROR_RETURN(TRIO_ENOMEM, 0); } else { status = TrioFormat(info, 0, TrioOutStreamStringDynamic, format, args, NULL); if (status >= 0) { trio_string_terminate(info); *result = trio_string_extract(info); } trio_string_destroy(info); } return status; } #endif /* TRIO_FEATURE_DYNAMICSTRING */ /** Allocate and print to string. The memory allocated and returned by @p result must be freed by the calling application. @param result Output string. @param format Formatting string. @param args Arguments. @return Number of printed characters. */ #if TRIO_FEATURE_DYNAMICSTRING TRIO_PUBLIC int trio_asprintfv TRIO_ARGS3((result, format, args), char **result, TRIO_CONST char *format, trio_pointer_t * args) { static va_list unused; int status; trio_string_t *info; assert(VALID(format)); *result = NULL; info = trio_xstring_duplicate(""); if (info == NULL) { status = TRIO_ERROR_RETURN(TRIO_ENOMEM, 0); } else { status = TrioFormat(info, 0, TrioOutStreamStringDynamic, format, unused, args); if (status >= 0) { trio_string_terminate(info); *result = trio_string_extract(info); } trio_string_destroy(info); } return status; } #endif /* TRIO_FEATURE_DYNAMICSTRING */ /** @} End of Printf documentation module */ /************************************************************************* * * CALLBACK * ************************************************************************/ #if defined(TRIO_DOCUMENTATION) # include "doc/doc_register.h" #endif /** @addtogroup UserDefined @{ */ #if TRIO_FEATURE_USER_DEFINED /************************************************************************* * trio_register */ /** Register new user-defined specifier. @param callback @param name @return Handle. */ TRIO_PUBLIC trio_pointer_t trio_register TRIO_ARGS2((callback, name), trio_callback_t callback, TRIO_CONST char *name) { trio_userdef_t *def; trio_userdef_t *prev = NULL; if (callback == NULL) return NULL; if (name) { /* Handle built-in namespaces */ if (name[0] == ':') { if (trio_equal(name, ":enter")) { internalEnterCriticalRegion = callback; } else if (trio_equal(name, ":leave")) { internalLeaveCriticalRegion = callback; } return NULL; } /* Bail out if namespace is too long */ if (trio_length(name) >= MAX_USER_NAME) return NULL; /* Bail out if namespace already is registered */ def = TrioFindNamespace(name, &prev); if (def) return NULL; } def = (trio_userdef_t *)TRIO_MALLOC(sizeof(trio_userdef_t)); if (def) { if (internalEnterCriticalRegion) (void)internalEnterCriticalRegion(NULL); if (name) { /* Link into internal list */ if (prev == NULL) internalUserDef = def; else prev->next = def; } /* Initialize */ def->callback = callback; def->name = (name == NULL) ? NULL : trio_duplicate(name); def->next = NULL; if (internalLeaveCriticalRegion) (void)internalLeaveCriticalRegion(NULL); } return (trio_pointer_t)def; } /** Unregister an existing user-defined specifier. @param handle */ void trio_unregister TRIO_ARGS1((handle), trio_pointer_t handle) { trio_userdef_t *self = (trio_userdef_t *)handle; trio_userdef_t *def; trio_userdef_t *prev = NULL; assert(VALID(self)); if (self->name) { def = TrioFindNamespace(self->name, &prev); if (def) { if (internalEnterCriticalRegion) (void)internalEnterCriticalRegion(NULL); if (prev == NULL) internalUserDef = NULL; else prev->next = def->next; if (internalLeaveCriticalRegion) (void)internalLeaveCriticalRegion(NULL); } trio_destroy(self->name); } TRIO_FREE(self); } /************************************************************************* * trio_get_format [public] */ TRIO_CONST char * trio_get_format TRIO_ARGS1((ref), trio_pointer_t ref) { #if TRIO_FEATURE_USER_DEFINED assert(((trio_reference_t *)ref)->parameter->type == FORMAT_USER_DEFINED); #endif return (((trio_reference_t *)ref)->parameter->user_data); } /************************************************************************* * trio_get_argument [public] */ trio_pointer_t trio_get_argument TRIO_ARGS1((ref), trio_pointer_t ref) { #if TRIO_FEATURE_USER_DEFINED assert(((trio_reference_t *)ref)->parameter->type == FORMAT_USER_DEFINED); #endif return ((trio_reference_t *)ref)->parameter->data.pointer; } /************************************************************************* * trio_get_width / trio_set_width [public] */ int trio_get_width TRIO_ARGS1((ref), trio_pointer_t ref) { return ((trio_reference_t *)ref)->parameter->width; } void trio_set_width TRIO_ARGS2((ref, width), trio_pointer_t ref, int width) { ((trio_reference_t *)ref)->parameter->width = width; } /************************************************************************* * trio_get_precision / trio_set_precision [public] */ int trio_get_precision TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->precision); } void trio_set_precision TRIO_ARGS2((ref, precision), trio_pointer_t ref, int precision) { ((trio_reference_t *)ref)->parameter->precision = precision; } /************************************************************************* * trio_get_base / trio_set_base [public] */ int trio_get_base TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->base); } void trio_set_base TRIO_ARGS2((ref, base), trio_pointer_t ref, int base) { ((trio_reference_t *)ref)->parameter->base = base; } /************************************************************************* * trio_get_long / trio_set_long [public] */ int trio_get_long TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_LONG) ? TRUE : FALSE; } void trio_set_long TRIO_ARGS2((ref, is_long), trio_pointer_t ref, int is_long) { if (is_long) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_LONG; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_LONG; } /************************************************************************* * trio_get_longlong / trio_set_longlong [public] */ int trio_get_longlong TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_QUAD) ? TRUE : FALSE; } void trio_set_longlong TRIO_ARGS2((ref, is_longlong), trio_pointer_t ref, int is_longlong) { if (is_longlong) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_QUAD; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_QUAD; } /************************************************************************* * trio_get_longdouble / trio_set_longdouble [public] */ # if TRIO_FEATURE_FLOAT int trio_get_longdouble TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_LONGDOUBLE) ? TRUE : FALSE; } void trio_set_longdouble TRIO_ARGS2((ref, is_longdouble), trio_pointer_t ref, int is_longdouble) { if (is_longdouble) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_LONGDOUBLE; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_LONGDOUBLE; } # endif /* TRIO_FEATURE_FLOAT */ /************************************************************************* * trio_get_short / trio_set_short [public] */ int trio_get_short TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_SHORT) ? TRUE : FALSE; } void trio_set_short TRIO_ARGS2((ref, is_short), trio_pointer_t ref, int is_short) { if (is_short) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_SHORT; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_SHORT; } /************************************************************************* * trio_get_shortshort / trio_set_shortshort [public] */ int trio_get_shortshort TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_SHORTSHORT) ? TRUE : FALSE; } void trio_set_shortshort TRIO_ARGS2((ref, is_shortshort), trio_pointer_t ref, int is_shortshort) { if (is_shortshort) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_SHORTSHORT; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_SHORTSHORT; } /************************************************************************* * trio_get_alternative / trio_set_alternative [public] */ int trio_get_alternative TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_ALTERNATIVE) ? TRUE : FALSE; } void trio_set_alternative TRIO_ARGS2((ref, is_alternative), trio_pointer_t ref, int is_alternative) { if (is_alternative) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_ALTERNATIVE; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_ALTERNATIVE; } /************************************************************************* * trio_get_alignment / trio_set_alignment [public] */ int trio_get_alignment TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_LEFTADJUST) ? TRUE : FALSE; } void trio_set_alignment TRIO_ARGS2((ref, is_leftaligned), trio_pointer_t ref, int is_leftaligned) { if (is_leftaligned) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_LEFTADJUST; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_LEFTADJUST; } /************************************************************************* * trio_get_spacing /trio_set_spacing [public] */ int trio_get_spacing TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_SPACE) ? TRUE : FALSE; } void trio_set_spacing TRIO_ARGS2((ref, is_space), trio_pointer_t ref, int is_space) { if (is_space) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_SPACE; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_SPACE; } /************************************************************************* * trio_get_sign / trio_set_sign [public] */ int trio_get_sign TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_SHOWSIGN) ? TRUE : FALSE; } void trio_set_sign TRIO_ARGS2((ref, is_sign), trio_pointer_t ref, int is_sign) { if (is_sign) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_SHOWSIGN; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_SHOWSIGN; } /************************************************************************* * trio_get_padding / trio_set_padding [public] */ int trio_get_padding TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_NILPADDING) ? TRUE : FALSE; } void trio_set_padding TRIO_ARGS2((ref, is_padding), trio_pointer_t ref, int is_padding) { if (is_padding) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_NILPADDING; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_NILPADDING; } /************************************************************************* * trio_get_quote / trio_set_quote [public] */ # if TRIO_FEATURE_QUOTE int trio_get_quote TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_QUOTE) ? TRUE : FALSE; } void trio_set_quote TRIO_ARGS2((ref, is_quote), trio_pointer_t ref, int is_quote) { if (is_quote) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_QUOTE; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_QUOTE; } #endif /* TRIO_FEATURE_QUOTE */ /************************************************************************* * trio_get_upper / trio_set_upper [public] */ int trio_get_upper TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_UPPER) ? TRUE : FALSE; } void trio_set_upper TRIO_ARGS2((ref, is_upper), trio_pointer_t ref, int is_upper) { if (is_upper) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_UPPER; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_UPPER; } /************************************************************************* * trio_get_largest / trio_set_largest [public] */ #if TRIO_FEATURE_INTMAX_T int trio_get_largest TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_INTMAX_T) ? TRUE : FALSE; } void trio_set_largest TRIO_ARGS2((ref, is_largest), trio_pointer_t ref, int is_largest) { if (is_largest) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_INTMAX_T; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_INTMAX_T; } #endif /* TRIO_FEATURE_INTMAX_T */ /************************************************************************* * trio_get_ptrdiff / trio_set_ptrdiff [public] */ #if TRIO_FEATURE_PTRDIFF_T int trio_get_ptrdiff TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_PTRDIFF_T) ? TRUE : FALSE; } void trio_set_ptrdiff TRIO_ARGS2((ref, is_ptrdiff), trio_pointer_t ref, int is_ptrdiff) { if (is_ptrdiff) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_PTRDIFF_T; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_PTRDIFF_T; } #endif /* TRIO_FEATURE_PTRDIFF_T */ /************************************************************************* * trio_get_size / trio_set_size [public] */ #if TRIO_FEATURE_SIZE_T int trio_get_size TRIO_ARGS1((ref), trio_pointer_t ref) { return (((trio_reference_t *)ref)->parameter->flags & FLAGS_SIZE_T) ? TRUE : FALSE; } void trio_set_size TRIO_ARGS2((ref, is_size), trio_pointer_t ref, int is_size) { if (is_size) ((trio_reference_t *)ref)->parameter->flags |= FLAGS_SIZE_T; else ((trio_reference_t *)ref)->parameter->flags &= ~FLAGS_SIZE_T; } #endif /* TRIO_FEATURE_SIZE_T */ /************************************************************************* * trio_print_int [public] */ void trio_print_int TRIO_ARGS2((ref, number), trio_pointer_t ref, int number) { trio_reference_t *self = (trio_reference_t *)ref; TrioWriteNumber(self->data, (trio_uintmax_t)number, self->parameter->flags, self->parameter->width, self->parameter->precision, self->parameter->base); } /************************************************************************* * trio_print_uint [public] */ void trio_print_uint TRIO_ARGS2((ref, number), trio_pointer_t ref, unsigned int number) { trio_reference_t *self = (trio_reference_t *)ref; TrioWriteNumber(self->data, (trio_uintmax_t)number, self->parameter->flags | FLAGS_UNSIGNED, self->parameter->width, self->parameter->precision, self->parameter->base); } /************************************************************************* * trio_print_double [public] */ #if TRIO_FEATURE_FLOAT void trio_print_double TRIO_ARGS2((ref, number), trio_pointer_t ref, double number) { trio_reference_t *self = (trio_reference_t *)ref; TrioWriteDouble(self->data, number, self->parameter->flags, self->parameter->width, self->parameter->precision, self->parameter->base); } #endif /* TRIO_FEATURE_FLOAT */ /************************************************************************* * trio_print_string [public] */ void trio_print_string TRIO_ARGS2((ref, string), trio_pointer_t ref, char *string) { trio_reference_t *self = (trio_reference_t *)ref; TrioWriteString(self->data, string, self->parameter->flags, self->parameter->width, self->parameter->precision); } /************************************************************************* * trio_print_ref [public] */ int trio_print_ref TRIO_VARGS3((ref, format, va_alist), trio_pointer_t ref, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list arglist; assert(VALID(format)); TRIO_VA_START(arglist, format); status = TrioFormatRef((trio_reference_t *)ref, format, arglist, NULL); TRIO_VA_END(arglist); return status; } /************************************************************************* * trio_vprint_ref [public] */ int trio_vprint_ref TRIO_ARGS3((ref, format, arglist), trio_pointer_t ref, TRIO_CONST char *format, va_list arglist) { assert(VALID(format)); return TrioFormatRef((trio_reference_t *)ref, format, arglist, NULL); } /************************************************************************* * trio_printv_ref [public] */ int trio_printv_ref TRIO_ARGS3((ref, format, argarray), trio_pointer_t ref, TRIO_CONST char *format, trio_pointer_t *argarray) { static va_list unused; assert(VALID(format)); return TrioFormatRef((trio_reference_t *)ref, format, unused, argarray); } #endif /************************************************************************* * trio_print_pointer [public] */ void trio_print_pointer TRIO_ARGS2((ref, pointer), trio_pointer_t ref, trio_pointer_t pointer) { trio_reference_t *self = (trio_reference_t *)ref; trio_flags_t flags; trio_uintmax_t number; if (NULL == pointer) { TRIO_CONST char *string = internalNullString; while (*string) self->data->OutStream(self->data, *string++); } else { /* * The subtraction of the null pointer is a workaround * to avoid a compiler warning. The performance overhead * is negligible (and likely to be removed by an * optimizing compiler). The (char *) casting is done * to please ANSI C++. */ number = (trio_uintmax_t)((char *)pointer - (char *)0); /* Shrink to size of pointer */ number &= (trio_uintmax_t)-1; flags = self->parameter->flags; flags |= (FLAGS_UNSIGNED | FLAGS_ALTERNATIVE | FLAGS_NILPADDING); TrioWriteNumber(self->data, number, flags, POINTER_WIDTH, NO_PRECISION, BASE_HEX); } } /** @} End of UserDefined documentation module */ /************************************************************************* * * LOCALES * ************************************************************************/ /************************************************************************* * trio_locale_set_decimal_point * * Decimal point can only be one character. The input argument is a * string to enable multibyte characters. At most MB_LEN_MAX characters * will be used. */ #if TRIO_FEATURE_LOCALE TRIO_PUBLIC void trio_locale_set_decimal_point TRIO_ARGS1((decimalPoint), char *decimalPoint) { #if defined(USE_LOCALE) if (NULL == internalLocaleValues) { TrioSetLocale(); } #endif internalDecimalPointLength = trio_length(decimalPoint); if (internalDecimalPointLength == 1) { internalDecimalPoint = *decimalPoint; } else { internalDecimalPoint = NIL; trio_copy_max(internalDecimalPointString, sizeof(internalDecimalPointString), decimalPoint); } } #endif /************************************************************************* * trio_locale_set_thousand_separator * * See trio_locale_set_decimal_point */ #if TRIO_FEATURE_LOCALE || TRIO_EXTENSION TRIO_PUBLIC void trio_locale_set_thousand_separator TRIO_ARGS1((thousandSeparator), char *thousandSeparator) { # if defined(USE_LOCALE) if (NULL == internalLocaleValues) { TrioSetLocale(); } # endif trio_copy_max(internalThousandSeparator, sizeof(internalThousandSeparator), thousandSeparator); internalThousandSeparatorLength = trio_length(internalThousandSeparator); } #endif /************************************************************************* * trio_locale_set_grouping * * Array of bytes. Reversed order. * * CHAR_MAX : No further grouping * 0 : Repeat last group for the remaining digits (not necessary * as C strings are zero-terminated) * n : Set current group to n * * Same order as the grouping attribute in LC_NUMERIC. */ #if TRIO_FEATURE_LOCALE || TRIO_EXTENSION TRIO_PUBLIC void trio_locale_set_grouping TRIO_ARGS1((grouping), char *grouping) { # if defined(USE_LOCALE) if (NULL == internalLocaleValues) { TrioSetLocale(); } # endif trio_copy_max(internalGrouping, sizeof(internalGrouping), grouping); } #endif /************************************************************************* * * SCANNING * ************************************************************************/ #if TRIO_FEATURE_SCANF /************************************************************************* * TrioSkipWhitespaces */ TRIO_PRIVATE int TrioSkipWhitespaces TRIO_ARGS1((self), trio_class_t *self) { int ch; ch = self->current; while (isspace(ch)) { self->InStream(self, &ch); } return ch; } /************************************************************************* * TrioGetCollation */ #if TRIO_EXTENSION TRIO_PRIVATE void TrioGetCollation(TRIO_NOARGS) { int i; int j; int k; char first[2]; char second[2]; /* This is computationally expensive */ first[1] = NIL; second[1] = NIL; for (i = 0; i < MAX_CHARACTER_CLASS; i++) { k = 0; first[0] = (char)i; for (j = 0; j < MAX_CHARACTER_CLASS; j++) { second[0] = (char)j; if (trio_equal_locale(first, second)) internalCollationArray[i][k++] = (char)j; } internalCollationArray[i][k] = NIL; } } #endif /************************************************************************* * TrioGetCharacterClass * * FIXME: * multibyte */ TRIO_PRIVATE int TrioGetCharacterClass TRIO_ARGS4((format, indexPointer, flagsPointer, characterclass), TRIO_CONST char *format, int *indexPointer, trio_flags_t *flagsPointer, int *characterclass) { int index = *indexPointer; int i; char ch; char range_begin; char range_end; *flagsPointer &= ~FLAGS_EXCLUDE; if (format[index] == QUALIFIER_CIRCUMFLEX) { *flagsPointer |= FLAGS_EXCLUDE; index++; } /* * If the ungroup character is at the beginning of the scanlist, * it will be part of the class, and a second ungroup character * must follow to end the group. */ if (format[index] == SPECIFIER_UNGROUP) { characterclass[(int)SPECIFIER_UNGROUP]++; index++; } /* * Minus is used to specify ranges. To include minus in the class, * it must be at the beginning of the list */ if (format[index] == QUALIFIER_MINUS) { characterclass[(int)QUALIFIER_MINUS]++; index++; } /* Collect characters */ for (ch = format[index]; (ch != SPECIFIER_UNGROUP) && (ch != NIL); ch = format[++index]) { switch (ch) { case QUALIFIER_MINUS: /* Scanlist ranges */ /* * Both C99 and UNIX98 describes ranges as implementation- * defined. * * We support the following behaviour (although this may * change as we become wiser) * - only increasing ranges, ie. [a-b] but not [b-a] * - transitive ranges, ie. [a-b-c] == [a-c] * - trailing minus, ie. [a-] is interpreted as an 'a' * and a '-' * - duplicates (although we can easily convert these * into errors) */ range_begin = format[index - 1]; range_end = format[++index]; if (range_end == SPECIFIER_UNGROUP) { /* Trailing minus is included */ characterclass[(int)ch]++; ch = range_end; break; /* for */ } if (range_end == NIL) return TRIO_ERROR_RETURN(TRIO_EINVAL, index); if (range_begin > range_end) return TRIO_ERROR_RETURN(TRIO_ERANGE, index); for (i = (int)range_begin; i <= (int)range_end; i++) characterclass[i]++; ch = range_end; break; #if TRIO_EXTENSION case SPECIFIER_GROUP: switch (format[index + 1]) { case QUALIFIER_DOT: /* Collating symbol */ /* * FIXME: This will be easier to implement when multibyte * characters have been implemented. Until now, we ignore * this feature. */ for (i = index + 2; ; i++) { if (format[i] == NIL) /* Error in syntax */ return -1; else if (format[i] == QUALIFIER_DOT) break; /* for */ } if (format[++i] != SPECIFIER_UNGROUP) return -1; index = i; break; case QUALIFIER_EQUAL: /* Equivalence class expressions */ { unsigned int j; unsigned int k; if (internalCollationUnconverted) { /* Lazy evaluation of collation array */ TrioGetCollation(); internalCollationUnconverted = FALSE; } for (i = index + 2; ; i++) { if (format[i] == NIL) /* Error in syntax */ return -1; else if (format[i] == QUALIFIER_EQUAL) break; /* for */ else { /* Mark any equivalent character */ k = (unsigned int)format[i]; for (j = 0; internalCollationArray[k][j] != NIL; j++) characterclass[(int)internalCollationArray[k][j]]++; } } if (format[++i] != SPECIFIER_UNGROUP) return -1; index = i; } break; case QUALIFIER_COLON: /* Character class expressions */ if (trio_equal_max(CLASS_ALNUM, sizeof(CLASS_ALNUM) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isalnum(i)) characterclass[i]++; index += sizeof(CLASS_ALNUM) - 1; } else if (trio_equal_max(CLASS_ALPHA, sizeof(CLASS_ALPHA) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isalpha(i)) characterclass[i]++; index += sizeof(CLASS_ALPHA) - 1; } else if (trio_equal_max(CLASS_CNTRL, sizeof(CLASS_CNTRL) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (iscntrl(i)) characterclass[i]++; index += sizeof(CLASS_CNTRL) - 1; } else if (trio_equal_max(CLASS_DIGIT, sizeof(CLASS_DIGIT) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isdigit(i)) characterclass[i]++; index += sizeof(CLASS_DIGIT) - 1; } else if (trio_equal_max(CLASS_GRAPH, sizeof(CLASS_GRAPH) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isgraph(i)) characterclass[i]++; index += sizeof(CLASS_GRAPH) - 1; } else if (trio_equal_max(CLASS_LOWER, sizeof(CLASS_LOWER) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (islower(i)) characterclass[i]++; index += sizeof(CLASS_LOWER) - 1; } else if (trio_equal_max(CLASS_PRINT, sizeof(CLASS_PRINT) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isprint(i)) characterclass[i]++; index += sizeof(CLASS_PRINT) - 1; } else if (trio_equal_max(CLASS_PUNCT, sizeof(CLASS_PUNCT) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (ispunct(i)) characterclass[i]++; index += sizeof(CLASS_PUNCT) - 1; } else if (trio_equal_max(CLASS_SPACE, sizeof(CLASS_SPACE) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isspace(i)) characterclass[i]++; index += sizeof(CLASS_SPACE) - 1; } else if (trio_equal_max(CLASS_UPPER, sizeof(CLASS_UPPER) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isupper(i)) characterclass[i]++; index += sizeof(CLASS_UPPER) - 1; } else if (trio_equal_max(CLASS_XDIGIT, sizeof(CLASS_XDIGIT) - 1, &format[index])) { for (i = 0; i < MAX_CHARACTER_CLASS; i++) if (isxdigit(i)) characterclass[i]++; index += sizeof(CLASS_XDIGIT) - 1; } else { characterclass[(int)ch]++; } break; default: characterclass[(int)ch]++; break; } break; #endif /* TRIO_EXTENSION */ default: characterclass[(int)ch]++; break; } } return 0; } /************************************************************************* * TrioReadNumber * * We implement our own number conversion in preference of strtol and * strtoul, because we must handle 'long long' and thousand separators. */ TRIO_PRIVATE BOOLEAN_T TrioReadNumber TRIO_ARGS5((self, target, flags, width, base), trio_class_t *self, trio_uintmax_t *target, trio_flags_t flags, int width, int base) { trio_uintmax_t number = 0; int digit; int count; BOOLEAN_T isNegative = FALSE; BOOLEAN_T gotNumber = FALSE; int j; assert(VALID(self)); assert(VALID(self->InStream)); assert((base >= MIN_BASE && base <= MAX_BASE) || (base == NO_BASE)); if (internalDigitsUnconverted) { /* Lazy evaluation of digits array */ memset(internalDigitArray, -1, sizeof(internalDigitArray)); for (j = 0; j < (int)sizeof(internalDigitsLower) - 1; j++) { internalDigitArray[(int)internalDigitsLower[j]] = j; internalDigitArray[(int)internalDigitsUpper[j]] = j; } internalDigitsUnconverted = FALSE; } TrioSkipWhitespaces(self); if (!(flags & FLAGS_UNSIGNED)) { /* Leading sign */ if (self->current == '+') { self->InStream(self, NULL); } else if (self->current == '-') { self->InStream(self, NULL); isNegative = TRUE; } } count = self->processed; if (flags & FLAGS_ALTERNATIVE) { switch (base) { case NO_BASE: case BASE_OCTAL: case BASE_HEX: case BASE_BINARY: if (self->current == '0') { self->InStream(self, NULL); if (self->current) { if ((base == BASE_HEX) && (trio_to_upper(self->current) == 'X')) { self->InStream(self, NULL); } else if ((base == BASE_BINARY) && (trio_to_upper(self->current) == 'B')) { self->InStream(self, NULL); } } } else return FALSE; break; default: break; } } while (((width == NO_WIDTH) || (self->processed - count < width)) && (! ((self->current == EOF) || isspace(self->current)))) { if (isascii(self->current)) { digit = internalDigitArray[self->current]; /* Abort if digit is not allowed in the specified base */ if ((digit == -1) || (digit >= base)) break; } #if TRIO_FEATURE_QUOTE else if (flags & FLAGS_QUOTE) { /* Compare with thousands separator */ for (j = 0; internalThousandSeparator[j] && self->current; j++) { if (internalThousandSeparator[j] != self->current) break; self->InStream(self, NULL); } if (internalThousandSeparator[j]) break; /* Mismatch */ else continue; /* Match */ } #endif else break; number *= base; number += digit; gotNumber = TRUE; /* we need at least one digit */ self->InStream(self, NULL); } /* Was anything read at all? */ if (!gotNumber) return FALSE; if (target) *target = (isNegative) ? (trio_uintmax_t)(-((trio_intmax_t)number)) : number; return TRUE; } /************************************************************************* * TrioReadChar */ TRIO_PRIVATE int TrioReadChar TRIO_ARGS4((self, target, flags, width), trio_class_t *self, char *target, trio_flags_t flags, int width) { int i; char ch; trio_uintmax_t number; assert(VALID(self)); assert(VALID(self->InStream)); for (i = 0; (self->current != EOF) && (i < width); i++) { ch = (char)self->current; self->InStream(self, NULL); if ((flags & FLAGS_ALTERNATIVE) && (ch == CHAR_BACKSLASH)) { switch (self->current) { case '\\': ch = '\\'; break; case 'a': ch = '\007'; break; case 'b': ch = '\b'; break; case 'f': ch = '\f'; break; case 'n': ch = '\n'; break; case 'r': ch = '\r'; break; case 't': ch = '\t'; break; case 'v': ch = '\v'; break; default: if (isdigit(self->current)) { /* Read octal number */ if (!TrioReadNumber(self, &number, 0, 3, BASE_OCTAL)) return 0; ch = (char)number; } else if (trio_to_upper(self->current) == 'X') { /* Read hexadecimal number */ self->InStream(self, NULL); if (!TrioReadNumber(self, &number, 0, 2, BASE_HEX)) return 0; ch = (char)number; } else { ch = (char)self->current; } break; } } if (target) target[i] = ch; } return i + 1; } /************************************************************************* * TrioReadString */ TRIO_PRIVATE BOOLEAN_T TrioReadString TRIO_ARGS4((self, target, flags, width), trio_class_t *self, char *target, trio_flags_t flags, int width) { int i; assert(VALID(self)); assert(VALID(self->InStream)); TrioSkipWhitespaces(self); /* * Continue until end of string is reached, a whitespace is encountered, * or width is exceeded */ for (i = 0; ((width == NO_WIDTH) || (i < width)) && (! ((self->current == EOF) || isspace(self->current))); i++) { if (TrioReadChar(self, (target ? &target[i] : 0), flags, 1) == 0) break; /* for */ } if (target) target[i] = NIL; return TRUE; } /************************************************************************* * TrioReadWideChar */ #if TRIO_FEATURE_WIDECHAR TRIO_PRIVATE int TrioReadWideChar TRIO_ARGS4((self, target, flags, width), trio_class_t *self, trio_wchar_t *target, trio_flags_t flags, int width) { int i; int j; int size; int amount = 0; trio_wchar_t wch; char buffer[MB_LEN_MAX + 1]; assert(VALID(self)); assert(VALID(self->InStream)); for (i = 0; (self->current != EOF) && (i < width); i++) { if (isascii(self->current)) { if (TrioReadChar(self, buffer, flags, 1) == 0) return 0; buffer[1] = NIL; } else { /* * Collect a multibyte character, by enlarging buffer until * it contains a fully legal multibyte character, or the * buffer is full. */ j = 0; do { buffer[j++] = (char)self->current; buffer[j] = NIL; self->InStream(self, NULL); } while ((j < (int)sizeof(buffer)) && (mblen(buffer, (size_t)j) != j)); } if (target) { size = mbtowc(&wch, buffer, sizeof(buffer)); if (size > 0) target[i] = wch; } amount += size; self->InStream(self, NULL); } return amount; } #endif /* TRIO_FEATURE_WIDECHAR */ /************************************************************************* * TrioReadWideString */ #if TRIO_FEATURE_WIDECHAR TRIO_PRIVATE BOOLEAN_T TrioReadWideString TRIO_ARGS4((self, target, flags, width), trio_class_t *self, trio_wchar_t *target, trio_flags_t flags, int width) { int i; int size; assert(VALID(self)); assert(VALID(self->InStream)); TrioSkipWhitespaces(self); #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) (void)mblen(NULL, 0); #endif /* * Continue until end of string is reached, a whitespace is encountered, * or width is exceeded */ for (i = 0; ((width == NO_WIDTH) || (i < width)) && (! ((self->current == EOF) || isspace(self->current))); ) { size = TrioReadWideChar(self, &target[i], flags, 1); if (size == 0) break; /* for */ i += size; } if (target) target[i] = WCONST('\0'); return TRUE; } #endif /* TRIO_FEATURE_WIDECHAR */ /************************************************************************* * TrioReadGroup * * FIXME: characterclass does not work with multibyte characters */ TRIO_PRIVATE BOOLEAN_T TrioReadGroup TRIO_ARGS5((self, target, characterclass, flags, width), trio_class_t *self, char *target, int *characterclass, trio_flags_t flags, int width) { int ch; int i; assert(VALID(self)); assert(VALID(self->InStream)); ch = self->current; for (i = 0; ((width == NO_WIDTH) || (i < width)) && (! ((ch == EOF) || (((flags & FLAGS_EXCLUDE) != 0) ^ (characterclass[ch] == 0)))); i++) { if (target) target[i] = (char)ch; self->InStream(self, &ch); } if (target) target[i] = NIL; return TRUE; } /************************************************************************* * TrioReadDouble * * FIXME: * add long double * handle base */ #if TRIO_FEATURE_FLOAT TRIO_PRIVATE BOOLEAN_T TrioReadDouble TRIO_ARGS4((self, target, flags, width), trio_class_t *self, trio_pointer_t target, trio_flags_t flags, int width) { int ch; char doubleString[512]; int index = 0; int start; # if TRIO_FEATURE_QUOTE int j; # endif BOOLEAN_T isHex = FALSE; doubleString[0] = 0; if ((width == NO_WIDTH) || (width > (int)sizeof(doubleString) - 1)) width = sizeof(doubleString) - 1; TrioSkipWhitespaces(self); /* * Read entire double number from stream. trio_to_double requires * a string as input, but InStream can be anything, so we have to * collect all characters. */ ch = self->current; if ((ch == '+') || (ch == '-')) { doubleString[index++] = (char)ch; self->InStream(self, &ch); width--; } start = index; switch (ch) { case 'n': case 'N': /* Not-a-number */ if (index != 0) break; /* FALLTHROUGH */ case 'i': case 'I': /* Infinity */ while (isalpha(ch) && (index - start < width)) { doubleString[index++] = (char)ch; self->InStream(self, &ch); } doubleString[index] = NIL; /* Case insensitive string comparison */ if (trio_equal(&doubleString[start], INFINITE_UPPER) || trio_equal(&doubleString[start], LONG_INFINITE_UPPER)) { if (flags & FLAGS_LONGDOUBLE) { if ((start == 1) && (doubleString[0] == '-')) { *((trio_long_double_t *)target) = trio_ninf(); } else { *((trio_long_double_t *)target) = trio_pinf(); } } else { if ((start == 1) && (doubleString[0] == '-')) { *((double *)target) = trio_ninf(); } else { *((double *)target) = trio_pinf(); } } return TRUE; } if (trio_equal(doubleString, NAN_UPPER)) { /* NaN must not have a preceeding + nor - */ if (flags & FLAGS_LONGDOUBLE) { *((trio_long_double_t *)target) = trio_nan(); } else { *((double *)target) = trio_nan(); } return TRUE; } return FALSE; case '0': doubleString[index++] = (char)ch; self->InStream(self, &ch); if (trio_to_upper(ch) == 'X') { isHex = TRUE; doubleString[index++] = (char)ch; self->InStream(self, &ch); } break; default: break; } while ((ch != EOF) && (index - start < width)) { /* Integer part */ if (isHex ? isxdigit(ch) : isdigit(ch)) { doubleString[index++] = (char)ch; self->InStream(self, &ch); } # if TRIO_FEATURE_QUOTE else if (flags & FLAGS_QUOTE) { /* Compare with thousands separator */ for (j = 0; internalThousandSeparator[j] && self->current; j++) { if (internalThousandSeparator[j] != self->current) break; self->InStream(self, &ch); } if (internalThousandSeparator[j]) break; /* Mismatch */ else continue; /* Match */ } # endif else break; /* while */ } if (ch == '.') { /* Decimal part */ doubleString[index++] = (char)ch; self->InStream(self, &ch); while ((isHex ? isxdigit(ch) : isdigit(ch)) && (index - start < width)) { doubleString[index++] = (char)ch; self->InStream(self, &ch); } } if (isHex ? (trio_to_upper(ch) == 'P') : (trio_to_upper(ch) == 'E')) { /* Exponent */ doubleString[index++] = (char)ch; self->InStream(self, &ch); if ((ch == '+') || (ch == '-')) { doubleString[index++] = (char)ch; self->InStream(self, &ch); } while (isdigit(ch) && (index - start < width)) { doubleString[index++] = (char)ch; self->InStream(self, &ch); } } if ((index == start) || (*doubleString == NIL)) return FALSE; doubleString[index] = 0; if (flags & FLAGS_LONGDOUBLE) { *((trio_long_double_t *)target) = trio_to_long_double(doubleString, NULL); } else { *((double *)target) = trio_to_double(doubleString, NULL); } return TRUE; } #endif /* TRIO_FEATURE_FLOAT */ /************************************************************************* * TrioReadPointer */ TRIO_PRIVATE BOOLEAN_T TrioReadPointer TRIO_ARGS3((self, target, flags), trio_class_t *self, trio_pointer_t *target, trio_flags_t flags) { trio_uintmax_t number; char buffer[sizeof(internalNullString)]; flags |= (FLAGS_UNSIGNED | FLAGS_ALTERNATIVE | FLAGS_NILPADDING); if (TrioReadNumber(self, &number, flags, POINTER_WIDTH, BASE_HEX)) { if (target) { #if defined(TRIO_COMPILER_GCC) /* * The strange assignment of number is a workaround for a compiler * warning */ *target = &((char *)0)[number]; #else *target = (trio_pointer_t)number; #endif } return TRUE; } else if (TrioReadString(self, (flags & FLAGS_IGNORE) ? NULL : buffer, 0, sizeof(internalNullString) - 1)) { if (trio_equal_case(buffer, internalNullString)) { if (target) *target = NULL; return TRUE; } } return FALSE; } /************************************************************************* * TrioScanProcess */ TRIO_PRIVATE int TrioScanProcess TRIO_ARGS3((data, format, parameters), trio_class_t *data, TRIO_CONST char *format, trio_parameter_t *parameters) { #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) int charlen; int cnt; #endif int assignment; int ch; int index; /* Index of format string */ int i; /* Index of current parameter */ trio_flags_t flags; int width; int base; trio_pointer_t pointer; assignment = 0; i = 0; index = 0; data->InStream(data, &ch); #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) (void)mblen(NULL, 0); #endif while (format[index]) { #if defined(TRIO_COMPILER_SUPPORTS_MULTIBYTE) if (! isascii(format[index])) { charlen = mblen(&format[index], MB_LEN_MAX); if (charlen != -1) { /* Compare multibyte characters in format string */ for (cnt = 0; cnt < charlen - 1; cnt++) { if (ch != format[index + cnt]) { return TRIO_ERROR_RETURN(TRIO_EINVAL, index); } data->InStream(data, &ch); } continue; /* while characters left in formatting string */ } } #endif /* TRIO_COMPILER_SUPPORTS_MULTIBYTE */ if ((EOF == ch) && (parameters[i].type != FORMAT_COUNT)) { return (assignment > 0) ? assignment : EOF; } if (CHAR_IDENTIFIER == format[index]) { if (CHAR_IDENTIFIER == format[index + 1]) { /* Two % in format matches one % in input stream */ if (CHAR_IDENTIFIER == ch) { data->InStream(data, &ch); index += 2; continue; /* while format chars left */ } else return TRIO_ERROR_RETURN(TRIO_EINVAL, index); } /* Skip the parameter entries */ while (parameters[i].type == FORMAT_PARAMETER) i++; flags = parameters[i].flags; /* Find width */ width = parameters[i].width; if (flags & FLAGS_WIDTH_PARAMETER) { /* Get width from parameter list */ width = (int)parameters[width].data.number.as_signed; } /* Find base */ base = parameters[i].base; if (flags & FLAGS_BASE_PARAMETER) { /* Get base from parameter list */ base = (int)parameters[base].data.number.as_signed; } switch (parameters[i].type) { case FORMAT_INT: { trio_uintmax_t number; if (0 == base) base = BASE_DECIMAL; if (!TrioReadNumber(data, &number, flags, width, base)) return assignment; if (!(flags & FLAGS_IGNORE)) { assignment++; pointer = parameters[i].data.pointer; #if TRIO_FEATURE_SIZE_T || TRIO_FEATURE_SIZE_T_UPPER if (flags & FLAGS_SIZE_T) *(size_t *)pointer = (size_t)number; else #endif #if TRIO_FEATURE_PTRDIFF_T if (flags & FLAGS_PTRDIFF_T) *(ptrdiff_t *)pointer = (ptrdiff_t)number; else #endif #if TRIO_FEATURE_INTMAX_T if (flags & FLAGS_INTMAX_T) *(trio_intmax_t *)pointer = (trio_intmax_t)number; else #endif if (flags & FLAGS_QUAD) *(trio_ulonglong_t *)pointer = (trio_ulonglong_t)number; else if (flags & FLAGS_LONG) *(long int *)pointer = (long int)number; else if (flags & FLAGS_SHORT) *(short int *)pointer = (short int)number; else *(int *)pointer = (int)number; } } break; /* FORMAT_INT */ case FORMAT_STRING: #if TRIO_FEATURE_WIDECHAR if (flags & FLAGS_WIDECHAR) { if (!TrioReadWideString(data, (flags & FLAGS_IGNORE) ? NULL : parameters[i].data.wstring, flags, width)) return assignment; } else #endif { if (!TrioReadString(data, (flags & FLAGS_IGNORE) ? NULL : parameters[i].data.string, flags, width)) return assignment; } if (!(flags & FLAGS_IGNORE)) assignment++; break; /* FORMAT_STRING */ #if TRIO_FEATURE_FLOAT case FORMAT_DOUBLE: { if (flags & FLAGS_IGNORE) { pointer = NULL; } else { pointer = (flags & FLAGS_LONGDOUBLE) ? (trio_pointer_t)parameters[i].data.longdoublePointer : (trio_pointer_t)parameters[i].data.doublePointer; } if (!TrioReadDouble(data, pointer, flags, width)) { return assignment; } if (!(flags & FLAGS_IGNORE)) { assignment++; } break; /* FORMAT_DOUBLE */ } #endif case FORMAT_GROUP: { int characterclass[MAX_CHARACTER_CLASS + 1]; int rc; /* Skip over modifiers */ while (format[index] != SPECIFIER_GROUP) { index++; } /* Skip over group specifier */ index++; memset(characterclass, 0, sizeof(characterclass)); rc = TrioGetCharacterClass(format, &index, &flags, characterclass); if (rc < 0) return rc; if (!TrioReadGroup(data, (flags & FLAGS_IGNORE) ? NULL : parameters[i].data.string, characterclass, flags, parameters[i].width)) return assignment; if (!(flags & FLAGS_IGNORE)) assignment++; } break; /* FORMAT_GROUP */ case FORMAT_COUNT: pointer = parameters[i].data.pointer; if (NULL != pointer) { int count = data->committed; if (ch != EOF) count--; /* a character is read, but is not consumed yet */ #if TRIO_FEATURE_SIZE_T || TRIO_FEATURE_SIZE_T_UPPER if (flags & FLAGS_SIZE_T) *(size_t *)pointer = (size_t)count; else #endif #if TRIO_FEATURE_PTRDIFF_T if (flags & FLAGS_PTRDIFF_T) *(ptrdiff_t *)pointer = (ptrdiff_t)count; else #endif #if TRIO_FEATURE_INTMAX_T if (flags & FLAGS_INTMAX_T) *(trio_intmax_t *)pointer = (trio_intmax_t)count; else #endif if (flags & FLAGS_QUAD) { *(trio_ulonglong_t *)pointer = (trio_ulonglong_t)count; } else if (flags & FLAGS_LONG) { *(long int *)pointer = (long int)count; } else if (flags & FLAGS_SHORT) { *(short int *)pointer = (short int)count; } else { *(int *)pointer = (int)count; } } break; /* FORMAT_COUNT */ case FORMAT_CHAR: #if TRIO_FEATURE_WIDECHAR if (flags & FLAGS_WIDECHAR) { if (TrioReadWideChar(data, (flags & FLAGS_IGNORE) ? NULL : parameters[i].data.wstring, flags, (width == NO_WIDTH) ? 1 : width) == 0) return assignment; } else #endif { if (TrioReadChar(data, (flags & FLAGS_IGNORE) ? NULL : parameters[i].data.string, flags, (width == NO_WIDTH) ? 1 : width) == 0) return assignment; } if (!(flags & FLAGS_IGNORE)) assignment++; break; /* FORMAT_CHAR */ case FORMAT_POINTER: if (!TrioReadPointer(data, (flags & FLAGS_IGNORE) ? NULL : (trio_pointer_t *)parameters[i].data.pointer, flags)) return assignment; if (!(flags & FLAGS_IGNORE)) assignment++; break; /* FORMAT_POINTER */ case FORMAT_PARAMETER: break; /* FORMAT_PARAMETER */ default: return TRIO_ERROR_RETURN(TRIO_EINVAL, index); } ch = data->current; index = parameters[i].indexAfterSpecifier; i++; } else /* Not an % identifier */ { if (isspace((int)format[index])) { /* Whitespaces may match any amount of whitespaces */ ch = TrioSkipWhitespaces(data); } else if (ch == format[index]) { data->InStream(data, &ch); } else return assignment; index++; } } return assignment; } /************************************************************************* * TrioScan */ TRIO_PRIVATE int TrioScan TRIO_ARGS6((source, sourceSize, InStream, format, arglist, argarray), trio_pointer_t source, size_t sourceSize, void (*InStream) TRIO_PROTO((trio_class_t *, int *)), TRIO_CONST char *format, va_list arglist, trio_pointer_t *argarray) { int status; trio_parameter_t parameters[MAX_PARAMETERS]; trio_class_t data; assert(VALID(InStream)); assert(VALID(format)); memset(&data, 0, sizeof(data)); data.InStream = InStream; data.location = (trio_pointer_t)source; data.max = sourceSize; data.error = 0; #if defined(USE_LOCALE) if (NULL == internalLocaleValues) { TrioSetLocale(); } #endif status = TrioParse(TYPE_SCAN, format, parameters, arglist, argarray); if (status < 0) return status; status = TrioScanProcess(&data, format, parameters); if (data.error != 0) { status = data.error; } return status; } /************************************************************************* * TrioInStreamFile */ #if TRIO_FEATURE_FILE || TRIO_FEATURE_STDIO TRIO_PRIVATE void TrioInStreamFile TRIO_ARGS2((self, intPointer), trio_class_t *self, int *intPointer) { FILE *file = (FILE *)self->location; assert(VALID(self)); assert(VALID(file)); self->current = fgetc(file); if (self->current == EOF) { self->error = (ferror(file)) ? TRIO_ERROR_RETURN(TRIO_ERRNO, 0) : TRIO_ERROR_RETURN(TRIO_EOF, 0); } else { self->processed++; self->committed++; } if (VALID(intPointer)) { *intPointer = self->current; } } #endif /* TRIO_FEATURE_FILE || TRIO_FEATURE_STDIO */ /************************************************************************* * TrioInStreamFileDescriptor */ #if TRIO_FEATURE_FD TRIO_PRIVATE void TrioInStreamFileDescriptor TRIO_ARGS2((self, intPointer), trio_class_t *self, int *intPointer) { int fd = *((int *)self->location); int size; unsigned char input; assert(VALID(self)); size = read(fd, &input, sizeof(char)); if (size == -1) { self->error = TRIO_ERROR_RETURN(TRIO_ERRNO, 0); self->current = EOF; } else { self->current = (size == 0) ? EOF : input; } if (self->current != EOF) { self->committed++; self->processed++; } if (VALID(intPointer)) { *intPointer = self->current; } } #endif /* TRIO_FEATURE_FD */ /************************************************************************* * TrioInStreamCustom */ #if TRIO_FEATURE_CLOSURE TRIO_PRIVATE void TrioInStreamCustom TRIO_ARGS2((self, intPointer), trio_class_t *self, int *intPointer) { trio_custom_t *data; assert(VALID(self)); assert(VALID(self->location)); data = (trio_custom_t *)self->location; self->current = (data->stream.in == NULL) ? NIL : (data->stream.in)(data->closure); if (self->current == NIL) { self->current = EOF; } else { self->processed++; self->committed++; } if (VALID(intPointer)) { *intPointer = self->current; } } #endif /* TRIO_FEATURE_CLOSURE */ /************************************************************************* * TrioInStreamString */ TRIO_PRIVATE void TrioInStreamString TRIO_ARGS2((self, intPointer), trio_class_t *self, int *intPointer) { unsigned char **buffer; assert(VALID(self)); assert(VALID(self->location)); buffer = (unsigned char **)self->location; self->current = (*buffer)[0]; if (self->current == NIL) { self->current = EOF; } else { (*buffer)++; self->processed++; self->committed++; } if (VALID(intPointer)) { *intPointer = self->current; } } /************************************************************************* * * Formatted scanning functions * ************************************************************************/ #if defined(TRIO_DOCUMENTATION) # include "doc/doc_scanf.h" #endif /** @addtogroup Scanf @{ */ /************************************************************************* * scanf */ /** Scan characters from standard input stream. @param format Formatting string. @param ... Arguments. @return Number of scanned characters. */ #if TRIO_FEATURE_STDIO TRIO_PUBLIC int trio_scanf TRIO_VARGS2((format, va_alist), TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(format)); TRIO_VA_START(args, format); status = TrioScan((trio_pointer_t)stdin, 0, TrioInStreamFile, format, args, NULL); TRIO_VA_END(args); return status; } #endif #if TRIO_FEATURE_STDIO TRIO_PUBLIC int trio_vscanf TRIO_ARGS2((format, args), TRIO_CONST char *format, va_list args) { assert(VALID(format)); return TrioScan((trio_pointer_t)stdin, 0, TrioInStreamFile, format, args, NULL); } #endif #if TRIO_FEATURE_STDIO TRIO_PUBLIC int trio_scanfv TRIO_ARGS2((format, args), TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; assert(VALID(format)); return TrioScan((trio_pointer_t)stdin, 0, TrioInStreamFile, format, unused, args); } #endif /************************************************************************* * fscanf */ #if TRIO_FEATURE_FILE TRIO_PUBLIC int trio_fscanf TRIO_VARGS3((file, format, va_alist), FILE *file, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(file)); assert(VALID(format)); TRIO_VA_START(args, format); status = TrioScan((trio_pointer_t)file, 0, TrioInStreamFile, format, args, NULL); TRIO_VA_END(args); return status; } #endif #if TRIO_FEATURE_FILE TRIO_PUBLIC int trio_vfscanf TRIO_ARGS3((file, format, args), FILE *file, TRIO_CONST char *format, va_list args) { assert(VALID(file)); assert(VALID(format)); return TrioScan((trio_pointer_t)file, 0, TrioInStreamFile, format, args, NULL); } #endif #if TRIO_FEATURE_FILE TRIO_PUBLIC int trio_fscanfv TRIO_ARGS3((file, format, args), FILE *file, TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; assert(VALID(file)); assert(VALID(format)); return TrioScan((trio_pointer_t)file, 0, TrioInStreamFile, format, unused, args); } #endif /************************************************************************* * dscanf */ #if TRIO_FEATURE_FD TRIO_PUBLIC int trio_dscanf TRIO_VARGS3((fd, format, va_alist), int fd, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(format)); TRIO_VA_START(args, format); status = TrioScan((trio_pointer_t)&fd, 0, TrioInStreamFileDescriptor, format, args, NULL); TRIO_VA_END(args); return status; } #endif #if TRIO_FEATURE_FD TRIO_PUBLIC int trio_vdscanf TRIO_ARGS3((fd, format, args), int fd, TRIO_CONST char *format, va_list args) { assert(VALID(format)); return TrioScan((trio_pointer_t)&fd, 0, TrioInStreamFileDescriptor, format, args, NULL); } #endif #if TRIO_FEATURE_FD TRIO_PUBLIC int trio_dscanfv TRIO_ARGS3((fd, format, args), int fd, TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; assert(VALID(format)); return TrioScan((trio_pointer_t)&fd, 0, TrioInStreamFileDescriptor, format, unused, args); } #endif /************************************************************************* * cscanf */ #if TRIO_FEATURE_CLOSURE TRIO_PUBLIC int trio_cscanf TRIO_VARGS4((stream, closure, format, va_alist), trio_instream_t stream, trio_pointer_t closure, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; trio_custom_t data; assert(VALID(stream)); assert(VALID(format)); TRIO_VA_START(args, format); data.stream.in = stream; data.closure = closure; status = TrioScan(&data, 0, TrioInStreamCustom, format, args, NULL); TRIO_VA_END(args); return status; } #endif #if TRIO_FEATURE_CLOSURE TRIO_PUBLIC int trio_vcscanf TRIO_ARGS4((stream, closure, format, args), trio_instream_t stream, trio_pointer_t closure, TRIO_CONST char *format, va_list args) { trio_custom_t data; assert(VALID(stream)); assert(VALID(format)); data.stream.in = stream; data.closure = closure; return TrioScan(&data, 0, TrioInStreamCustom, format, args, NULL); } #endif #if TRIO_FEATURE_CLOSURE TRIO_PUBLIC int trio_cscanfv TRIO_ARGS4((stream, closure, format, args), trio_instream_t stream, trio_pointer_t closure, TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; trio_custom_t data; assert(VALID(stream)); assert(VALID(format)); data.stream.in = stream; data.closure = closure; return TrioScan(&data, 0, TrioInStreamCustom, format, unused, args); } #endif /************************************************************************* * sscanf */ TRIO_PUBLIC int trio_sscanf TRIO_VARGS3((buffer, format, va_alist), TRIO_CONST char *buffer, TRIO_CONST char *format, TRIO_VA_DECL) { int status; va_list args; assert(VALID(buffer)); assert(VALID(format)); TRIO_VA_START(args, format); status = TrioScan((trio_pointer_t)&buffer, 0, TrioInStreamString, format, args, NULL); TRIO_VA_END(args); return status; } TRIO_PUBLIC int trio_vsscanf TRIO_ARGS3((buffer, format, args), TRIO_CONST char *buffer, TRIO_CONST char *format, va_list args) { assert(VALID(buffer)); assert(VALID(format)); return TrioScan((trio_pointer_t)&buffer, 0, TrioInStreamString, format, args, NULL); } TRIO_PUBLIC int trio_sscanfv TRIO_ARGS3((buffer, format, args), TRIO_CONST char *buffer, TRIO_CONST char *format, trio_pointer_t *args) { static va_list unused; assert(VALID(buffer)); assert(VALID(format)); return TrioScan((trio_pointer_t)&buffer, 0, TrioInStreamString, format, unused, args); } #endif /* TRIO_FEATURE_SCANF */ /** @} End of Scanf documentation module */ /************************************************************************* * trio_strerror */ TRIO_PUBLIC TRIO_CONST char * trio_strerror TRIO_ARGS1((errorcode), int errorcode) { #if TRIO_FEATURE_STRERR /* Textual versions of the error codes */ switch (TRIO_ERROR_CODE(errorcode)) { case TRIO_EOF: return "End of file"; case TRIO_EINVAL: return "Invalid argument"; case TRIO_ETOOMANY: return "Too many arguments"; case TRIO_EDBLREF: return "Double reference"; case TRIO_EGAP: return "Reference gap"; case TRIO_ENOMEM: return "Out of memory"; case TRIO_ERANGE: return "Invalid range"; case TRIO_ECUSTOM: return "Custom error"; default: return "Unknown"; } #else return "Unknown"; #endif } bogofilter-1.2.4/trio/AUTHORS0000644000175000017500000000022612163572311014064 0ustar sezsez# $Id: AUTHORS,v 1.12 2003/09/25 01:21:41 m-a Exp $ TRIO is Copyright (C) 1998-2005 by Bjorn Reese and Daniel Stenberg. See README for the license. bogofilter-1.2.4/trio/triostr.c0000644000175000017500000012610612163572311014674 0ustar sezsez/************************************************************************* * * $Id: triostr.c,v 1.30 2005/11/26 14:47:54 breese Exp $ * * Copyright (C) 2001 Bjorn Reese and Daniel Stenberg. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************/ /************************************************************************* * Include files */ #if defined(HAVE_CONFIG_H) # include #endif #include #include #include #include #include "triodef.h" #include "triostr.h" #if defined(TRIO_FUNC_TO_LONG_DOUBLE) # define USE_MATH #endif #if defined(USE_MATH) # include #endif /************************************************************************* * Definitions */ #if !defined(TRIO_PUBLIC_STRING) # define TRIO_PUBLIC_STRING TRIO_PUBLIC #endif #if !defined(TRIO_PRIVATE_STRING) # define TRIO_PRIVATE_STRING TRIO_PRIVATE #endif #if !defined(NULL) # define NULL 0 #endif #if !defined(NIL) # define NIL ((char)0) #endif #if !defined(FALSE) # define FALSE (1 == 0) # define TRUE (! FALSE) #endif #if !defined(BOOLEAN_T) # define BOOLEAN_T int #endif #if defined(USE_MATH) # if defined(PREDEF_STANDARD_C99) # if defined(TRIO_COMPILER_DECC) # if (TRIO_COMPILER_DECC - 0 > 80000000) /* * The OSF/1 runtime that comes with the DECC compiler does not support * hexfloats conversion. */ # define USE_STRTOD # define USE_STRTOF # endif # else # define USE_STRTOD # define USE_STRTOF # endif # else # if defined(TRIO_COMPILER_VISUALC) # define USE_STRTOD # endif #endif #endif #if defined(TRIO_PLATFORM_UNIX) # if defined(PREDEF_STANDARD_UNIX95) # define USE_STRCASECMP # define USE_STRNCASECMP # endif # if defined(TRIO_PLATFORM_SUNOS) # define USE_SYS_ERRLIST # else # define USE_STRERROR # endif # if defined(TRIO_PLATFORM_QNX) # define strcasecmp(x,y) stricmp(x,y) # define strncasecmp(x,y,n) strnicmp(x,y,n) # endif #endif #if defined(TRIO_PLATFORM_WIN32) # define USE_STRCASECMP # define strcasecmp(x,y) strcmpi(x,y) #endif #if !(defined(TRIO_PLATFORM_SUNOS)) # define USE_TOLOWER # define USE_TOUPPER #endif #if defined(USE_MATH) # if !defined(HAVE_POWL) # if defined(PREDEF_STANDARD_C99) \ || defined(PREDEF_STANDARD_UNIX03) # define HAVE_POWL # else # if defined(TRIO_COMPILER_VISUALC) # if defined(powl) # define HAVE_POWL # endif # endif # endif # endif #endif #if defined(HAVE_POWL) # define trio_powl(x,y) powl((x),(y)) #else # define trio_powl(x,y) pow((double)(x),(double)(y)) #endif #if defined(TRIO_FUNC_TO_UPPER) \ || (defined(TRIO_FUNC_EQUAL) && !defined(USE_STRCASECMP)) \ || (defined(TRIO_FUNC_EQUAL_MAX) && !defined(USE_STRNCASECMP)) \ || defined(TRIO_FUNC_MATCH) \ || defined(TRIO_FUNC_TO_LONG_DOUBLE) \ || defined(TRIO_FUNC_UPPER) # define TRIO_FUNC_INTERNAL_TO_UPPER #endif /************************************************************************* * Structures */ struct _trio_string_t { char *content; size_t length; size_t allocated; }; /************************************************************************* * Constants */ #if !defined(TRIO_EMBED_STRING) static TRIO_CONST char rcsid[] = "@(#)$Id: triostr.c,v 1.30 2005/11/26 14:47:54 breese Exp $"; #endif /************************************************************************* * Static String Functions */ #if defined(TRIO_DOCUMENTATION) # include "doc/doc_static.h" #endif /** @addtogroup StaticStrings @{ */ /* * internal_duplicate_max */ #if defined(TRIO_FUNC_DUPLICATE) \ || defined(TRIO_FUNC_DUPLICATE_MAX) \ || defined(TRIO_FUNC_STRING_DUPLICATE) \ || defined(TRIO_FUNC_XSTRING_DUPLICATE) TRIO_PRIVATE_STRING char * internal_duplicate_max TRIO_ARGS2((source, size), TRIO_CONST char *source, size_t size) { char *target; assert(source); /* Make room for string plus a terminating zero */ size++; target = trio_create(size); if (target) { trio_copy_max(target, size, source); } return target; } #endif /* * internal_string_alloc */ #if defined(TRIO_FUNC_STRING_CREATE) \ || defined(TRIO_FUNC_STRING_DUPLICATE) \ || defined(TRIO_FUNC_XSTRING_DUPLICATE) TRIO_PRIVATE_STRING trio_string_t * internal_string_alloc(TRIO_NOARGS) { trio_string_t *self; self = (trio_string_t *)TRIO_MALLOC(sizeof(trio_string_t)); if (self) { self->content = NULL; self->length = 0; self->allocated = 0; } return self; } #endif /* * internal_string_grow * * The size of the string will be increased by 'delta' characters. If * 'delta' is zero, the size will be doubled. */ #if defined(TRIO_FUNC_STRING_CREATE) \ || defined(TRIO_FUNC_STRING_APPEND) \ || defined(TRIO_FUNC_XSTRING_APPEND) \ || defined(TRIO_FUNC_XSTRING_APPEND_CHAR) TRIO_PRIVATE_STRING BOOLEAN_T internal_string_grow TRIO_ARGS2((self, delta), trio_string_t *self, size_t delta) { BOOLEAN_T status = FALSE; char *new_content; size_t new_size; new_size = (delta == 0) ? ( (self->allocated == 0) ? 1 : self->allocated * 2 ) : self->allocated + delta; new_content = (char *)TRIO_REALLOC(self->content, new_size); if (new_content) { self->content = new_content; self->allocated = new_size; status = TRUE; } return status; } #endif /* * internal_string_grow_to * * The size of the string will be increased to 'length' plus one characters. * If 'length' is less than the original size, the original size will be * used (that is, the size of the string is never decreased). */ #if defined(TRIO_FUNC_STRING_APPEND) \ || defined(TRIO_FUNC_XSTRING_APPEND) TRIO_PRIVATE_STRING BOOLEAN_T internal_string_grow_to TRIO_ARGS2((self, length), trio_string_t *self, size_t length) { length++; /* Room for terminating zero */ return (self->allocated < length) ? internal_string_grow(self, length - self->allocated) : TRUE; } #endif #if defined(TRIO_FUNC_INTERNAL_TO_UPPER) TRIO_PRIVATE_STRING TRIO_INLINE int internal_to_upper TRIO_ARGS1((source), int source) { # if defined(USE_TOUPPER) return toupper(source); # else /* Does not handle locales or non-contiguous alphabetic characters */ return ((source >= (int)'a') && (source <= (int)'z')) ? source - 'a' + 'A' : source; # endif } #endif /** Create new string. @param size Size of new string. @return Pointer to string, or NULL if allocation failed. */ #if defined(TRIO_FUNC_CREATE) TRIO_PUBLIC_STRING char * trio_create TRIO_ARGS1((size), size_t size) { return (char *)TRIO_MALLOC(size); } #endif /** Destroy string. @param string String to be freed. */ #if defined(TRIO_FUNC_DESTROY) TRIO_PUBLIC_STRING void trio_destroy TRIO_ARGS1((string), char *string) { if (string) { TRIO_FREE(string); } } #endif /** Count the number of characters in a string. @param string String to measure. @return Number of characters in @p string. */ #if defined(TRIO_FUNC_LENGTH) TRIO_PUBLIC_STRING size_t trio_length TRIO_ARGS1((string), TRIO_CONST char *string) { return strlen(string); } #endif /** Append @p source at the end of @p target. @param target Target string. @param source Source string. @return Boolean value indicating success or failure. @pre @p target must point to a memory chunk with sufficient room to contain the @p target string and @p source string. @pre No boundary checking is performed, so insufficient memory will result in a buffer overrun. @post @p target will be zero terminated. */ #if defined(TRIO_FUNC_APPEND) TRIO_PUBLIC_STRING int trio_append TRIO_ARGS2((target, source), char *target, TRIO_CONST char *source) { assert(target); assert(source); return (strcat(target, source) != NULL); } #endif /** Append at most @p max characters from @p source to @p target. @param target Target string. @param max Maximum number of characters to append. @param source Source string. @return Boolean value indicating success or failure. @pre @p target must point to a memory chuck with sufficient room to contain the @p target string and the @p source string (at most @p max characters). @pre No boundary checking is performed, so insufficient memory will result in a buffer overrun. @post @p target will be zero terminated. */ #if defined(TRIO_FUNC_APPEND_MAX) TRIO_PUBLIC_STRING int trio_append_max TRIO_ARGS3((target, max, source), char *target, size_t max, TRIO_CONST char *source) { size_t length; assert(target); assert(source); length = trio_length(target); if (max > length) { strncat(target, source, max - length - 1); } return TRUE; } #endif /** Determine if a string contains a substring. @param string String to be searched. @param substring String to be found. @return Boolean value indicating success or failure. */ #if defined(TRIO_FUNC_CONTAINS) TRIO_PUBLIC_STRING int trio_contains TRIO_ARGS2((string, substring), TRIO_CONST char *string, TRIO_CONST char *substring) { assert(string); assert(substring); return (0 != strstr(string, substring)); } #endif /** Copy @p source to @p target. @param target Target string. @param source Source string. @return Boolean value indicating success or failure. @pre @p target must point to a memory chunk with sufficient room to contain the @p source string. @pre No boundary checking is performed, so insufficient memory will result in a buffer overrun. @post @p target will be zero terminated. */ #if defined(TRIO_FUNC_COPY) TRIO_PUBLIC_STRING int trio_copy TRIO_ARGS2((target, source), char *target, TRIO_CONST char *source) { assert(target); assert(source); (void)strcpy(target, source); return TRUE; } #endif /** Copy at most @p max characters from @p source to @p target. @param target Target string. @param max Maximum number of characters to append. @param source Source string. @return Boolean value indicating success or failure. @pre @p target must point to a memory chunk with sufficient room to contain the @p source string (at most @p max characters). @pre No boundary checking is performed, so insufficient memory will result in a buffer overrun. @post @p target will be zero terminated. */ #if defined(TRIO_FUNC_COPY_MAX) TRIO_PUBLIC_STRING int trio_copy_max TRIO_ARGS3((target, max, source), char *target, size_t max, TRIO_CONST char *source) { assert(target); assert(source); assert(max > 0); /* Includes != 0 */ (void)strncpy(target, source, max - 1); target[max - 1] = (char)0; return TRUE; } #endif /** Duplicate @p source. @param source Source string. @return A copy of the @p source string. @post @p target will be zero terminated. */ #if defined(TRIO_FUNC_DUPLICATE) TRIO_PUBLIC_STRING char * trio_duplicate TRIO_ARGS1((source), TRIO_CONST char *source) { return internal_duplicate_max(source, trio_length(source)); } #endif /** Duplicate at most @p max characters of @p source. @param source Source string. @param max Maximum number of characters to duplicate. @return A copy of the @p source string. @post @p target will be zero terminated. */ #if defined(TRIO_FUNC_DUPLICATE_MAX) TRIO_PUBLIC_STRING char * trio_duplicate_max TRIO_ARGS2((source, max), TRIO_CONST char *source, size_t max) { size_t length; assert(source); assert(max > 0); length = trio_length(source); if (length > max) { length = max; } return internal_duplicate_max(source, length); } #endif /** Compare if two strings are equal. @param first First string. @param second Second string. @return Boolean indicating whether the two strings are equal or not. Case-insensitive comparison. */ #if defined(TRIO_FUNC_EQUAL) TRIO_PUBLIC_STRING int trio_equal TRIO_ARGS2((first, second), TRIO_CONST char *first, TRIO_CONST char *second) { assert(first); assert(second); if ((first != NULL) && (second != NULL)) { # if defined(USE_STRCASECMP) return (0 == strcasecmp(first, second)); # else while ((*first != NIL) && (*second != NIL)) { if (internal_to_upper(*first) != internal_to_upper(*second)) { break; } first++; second++; } return ((*first == NIL) && (*second == NIL)); # endif } return FALSE; } #endif /** Compare if two strings are equal. @param first First string. @param second Second string. @return Boolean indicating whether the two strings are equal or not. Case-sensitive comparison. */ #if defined(TRIO_FUNC_EQUAL_CASE) TRIO_PUBLIC_STRING int trio_equal_case TRIO_ARGS2((first, second), TRIO_CONST char *first, TRIO_CONST char *second) { assert(first); assert(second); if ((first != NULL) && (second != NULL)) { return (0 == strcmp(first, second)); } return FALSE; } #endif /** Compare if two strings up until the first @p max characters are equal. @param first First string. @param max Maximum number of characters to compare. @param second Second string. @return Boolean indicating whether the two strings are equal or not. Case-sensitive comparison. */ #if defined(TRIO_FUNC_EQUAL_CASE_MAX) TRIO_PUBLIC_STRING int trio_equal_case_max TRIO_ARGS3((first, max, second), TRIO_CONST char *first, size_t max, TRIO_CONST char *second) { assert(first); assert(second); if ((first != NULL) && (second != NULL)) { return (0 == strncmp(first, second, max)); } return FALSE; } #endif /** Compare if two strings are equal. @param first First string. @param second Second string. @return Boolean indicating whether the two strings are equal or not. Collating characters are considered equal. */ #if defined(TRIO_FUNC_EQUAL_LOCALE) TRIO_PUBLIC_STRING int trio_equal_locale TRIO_ARGS2((first, second), TRIO_CONST char *first, TRIO_CONST char *second) { assert(first); assert(second); # if defined(LC_COLLATE) return (strcoll(first, second) == 0); # else return trio_equal(first, second); # endif } #endif /** Compare if two strings up until the first @p max characters are equal. @param first First string. @param max Maximum number of characters to compare. @param second Second string. @return Boolean indicating whether the two strings are equal or not. Case-insensitive comparison. */ #if defined(TRIO_FUNC_EQUAL_MAX) TRIO_PUBLIC_STRING int trio_equal_max TRIO_ARGS3((first, max, second), TRIO_CONST char *first, size_t max, TRIO_CONST char *second) { assert(first); assert(second); if ((first != NULL) && (second != NULL)) { # if defined(USE_STRNCASECMP) return (0 == strncasecmp(first, second, max)); # else /* Not adequately tested yet */ size_t cnt = 0; while ((*first != NIL) && (*second != NIL) && (cnt <= max)) { if (internal_to_upper(*first) != internal_to_upper(*second)) { break; } first++; second++; cnt++; } return ((cnt == max) || ((*first == NIL) && (*second == NIL))); # endif } return FALSE; } #endif /** Provide a textual description of an error code (errno). @param error_number Error number. @return Textual description of @p error_number. */ #if defined(TRIO_FUNC_ERROR) TRIO_PUBLIC_STRING TRIO_CONST char * trio_error TRIO_ARGS1((error_number), int error_number) { # if defined(USE_STRERROR) return strerror(error_number); # else # if defined(USE_SYS_ERRLIST) extern char *sys_errlist[]; extern int sys_nerr; return ((error_number < 0) || (error_number >= sys_nerr)) ? "unknown" : sys_errlist[error_number]; # else return "unknown"; # endif # endif } #endif /** Format the date/time according to @p format. @param target Target string. @param max Maximum number of characters to format. @param format Formatting string. @param datetime Date/time structure. @return Number of formatted characters. The formatting string accepts the same specifiers as the standard C function strftime. */ #if defined(TRIO_FUNC_FORMAT_DATE_MAX) TRIO_PUBLIC_STRING size_t trio_format_date_max TRIO_ARGS4((target, max, format, datetime), char *target, size_t max, TRIO_CONST char *format, TRIO_CONST struct tm *datetime) { assert(target); assert(format); assert(datetime); assert(max > 0); return strftime(target, max, format, datetime); } #endif /** Calculate a hash value for a string. @param string String to be calculated on. @param type Hash function. @return Calculated hash value. @p type can be one of the following @li @c TRIO_HASH_PLAIN Plain hash function. */ #if defined(TRIO_FUNC_HASH) TRIO_PUBLIC_STRING unsigned long trio_hash TRIO_ARGS2((string, type), TRIO_CONST char *string, int type) { unsigned long value = 0L; char ch; assert(string); switch (type) { case TRIO_HASH_PLAIN: while ( (ch = *string++) != NIL ) { value *= 31; value += (unsigned long)ch; } break; default: assert(FALSE); break; } return value; } #endif /** Find first occurrence of a character in a string. @param string String to be searched. @param character Character to be found. @return A pointer to the found character, or NULL if character was not found. */ #if defined(TRIO_FUNC_INDEX) TRIO_PUBLIC_STRING char * trio_index TRIO_ARGS2((string, character), TRIO_CONST char *string, int character) { assert(string); return strchr(string, character); } #endif /** Find last occurrence of a character in a string. @param string String to be searched. @param character Character to be found. @return A pointer to the found character, or NULL if character was not found. */ #if defined(TRIO_FUNC_INDEX_LAST) TRIO_PUBLIC_STRING char * trio_index_last TRIO_ARGS2((string, character), TRIO_CONST char *string, int character) { assert(string); return strchr(string, character); } #endif /** Convert the alphabetic letters in the string to lower-case. @param target String to be converted. @return Number of processed characters (converted or not). */ #if defined(TRIO_FUNC_LOWER) TRIO_PUBLIC_STRING int trio_lower TRIO_ARGS1((target), char *target) { assert(target); return trio_span_function(target, target, trio_to_lower); } #endif /** Compare two strings using wildcards. @param string String to be searched. @param pattern Pattern, including wildcards, to search for. @return Boolean value indicating success or failure. Case-insensitive comparison. The following wildcards can be used @li @c * Match any number of characters. @li @c ? Match a single character. */ #if defined(TRIO_FUNC_MATCH) TRIO_PUBLIC_STRING int trio_match TRIO_ARGS2((string, pattern), TRIO_CONST char *string, TRIO_CONST char *pattern) { assert(string); assert(pattern); for (; ('*' != *pattern); ++pattern, ++string) { if (NIL == *string) { return (NIL == *pattern); } if ((internal_to_upper((int)*string) != internal_to_upper((int)*pattern)) && ('?' != *pattern)) { return FALSE; } } /* two-line patch to prevent *too* much recursiveness: */ while ('*' == pattern[1]) pattern++; do { if ( trio_match(string, &pattern[1]) ) { return TRUE; } } while (*string++); return FALSE; } #endif /** Compare two strings using wildcards. @param string String to be searched. @param pattern Pattern, including wildcards, to search for. @return Boolean value indicating success or failure. Case-sensitive comparison. The following wildcards can be used @li @c * Match any number of characters. @li @c ? Match a single character. */ #if defined(TRIO_FUNC_MATCH_CASE) TRIO_PUBLIC_STRING int trio_match_case TRIO_ARGS2((string, pattern), TRIO_CONST char *string, TRIO_CONST char *pattern) { assert(string); assert(pattern); for (; ('*' != *pattern); ++pattern, ++string) { if (NIL == *string) { return (NIL == *pattern); } if ((*string != *pattern) && ('?' != *pattern)) { return FALSE; } } /* two-line patch to prevent *too* much recursiveness: */ while ('*' == pattern[1]) pattern++; do { if ( trio_match_case(string, &pattern[1]) ) { return TRUE; } } while (*string++); return FALSE; } #endif /** Execute a function on each character in string. @param target Target string. @param source Source string. @param Function Function to be executed. @return Number of processed characters. */ #if defined(TRIO_FUNC_SPAN_FUNCTION) TRIO_PUBLIC_STRING size_t trio_span_function TRIO_ARGS3((target, source, Function), char *target, TRIO_CONST char *source, int (*Function) TRIO_PROTO((int))) { size_t count = 0; assert(target); assert(source); assert(Function); while (*source != NIL) { *target++ = Function(*source++); count++; } return count; } #endif /** Search for a substring in a string. @param string String to be searched. @param substring String to be found. @return Pointer to first occurrence of @p substring in @p string, or NULL if no match was found. */ #if defined(TRIO_FUNC_SUBSTRING) TRIO_PUBLIC_STRING char * trio_substring TRIO_ARGS2((string, substring), TRIO_CONST char *string, TRIO_CONST char *substring) { assert(string); assert(substring); return strstr(string, substring); } #endif /** Search for a substring in the first @p max characters of a string. @param string String to be searched. @param max Maximum characters to be searched. @param substring String to be found. @return Pointer to first occurrence of @p substring in @p string, or NULL if no match was found. */ #if defined(TRIO_FUNC_SUBSTRING_MAX) TRIO_PUBLIC_STRING char * trio_substring_max TRIO_ARGS3((string, max, substring), TRIO_CONST char *string, size_t max, TRIO_CONST char *substring) { size_t count; size_t size; char *result = NULL; assert(string); assert(substring); size = trio_length(substring); if (size <= max) { for (count = 0; count <= max - size; count++) { if (trio_equal_max(substring, size, &string[count])) { result = (char *)&string[count]; break; } } } return result; } #endif /** Tokenize string. @param string String to be tokenized. @param delimiters String containing list of delimiting characters. @return Start of new token. @warning @p string will be destroyed. */ #if defined(TRIO_FUNC_TOKENIZE) TRIO_PUBLIC_STRING char * trio_tokenize TRIO_ARGS2((string, delimiters), char *string, TRIO_CONST char *delimiters) { assert(delimiters); return strtok(string, delimiters); } #endif /** Convert string to floating-point number. @param source String to be converted. @param endp Pointer to end of the converted string. @return A floating-point number. The following Extended Backus-Naur form is used @verbatim double ::= [ ] ( | | ) [ [ ] ] number ::= 1*( ) digit ::= ( '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' ) exponential ::= ( 'e' | 'E' ) sign ::= ( '-' | '+' ) decimal_point ::= '.' @endverbatim */ #if defined(TRIO_FUNC_TO_LONG_DOUBLE) /* FIXME: Add EBNF for hex-floats */ TRIO_PUBLIC_STRING trio_long_double_t trio_to_long_double TRIO_ARGS2((source, endp), TRIO_CONST char *source, char **endp) { # if defined(USE_STRTOLD) return strtold(source, endp); # else int isNegative = FALSE; int isExponentNegative = FALSE; trio_long_double_t integer = 0.0; trio_long_double_t fraction = 0.0; unsigned long exponent = 0; trio_long_double_t base; trio_long_double_t fracdiv = 1.0; trio_long_double_t value = 0.0; /* First try hex-floats */ if ((source[0] == '0') && ((source[1] == 'x') || (source[1] == 'X'))) { base = 16.0; source += 2; while (isxdigit((int)*source)) { integer *= base; integer += (isdigit((int)*source) ? (*source - '0') : 10 + (internal_to_upper((int)*source) - 'A')); source++; } if (*source == '.') { source++; while (isxdigit((int)*source)) { fracdiv /= base; fraction += fracdiv * (isdigit((int)*source) ? (*source - '0') : 10 + (internal_to_upper((int)*source) - 'A')); source++; } if ((*source == 'p') || (*source == 'P')) { source++; if ((*source == '+') || (*source == '-')) { isExponentNegative = (*source == '-'); source++; } while (isdigit((int)*source)) { exponent *= 10; exponent += (*source - '0'); source++; } } } /* For later use with exponent */ base = 2.0; } else /* Then try normal decimal floats */ { base = 10.0; isNegative = (*source == '-'); /* Skip sign */ if ((*source == '+') || (*source == '-')) source++; /* Integer part */ while (isdigit((int)*source)) { integer *= base; integer += (*source - '0'); source++; } if (*source == '.') { source++; /* skip decimal point */ while (isdigit((int)*source)) { fracdiv /= base; fraction += (*source - '0') * fracdiv; source++; } } if ((*source == 'e') || (*source == 'E') # if TRIO_MICROSOFT || (*source == 'd') || (*source == 'D') # endif ) { source++; /* Skip exponential indicator */ isExponentNegative = (*source == '-'); if ((*source == '+') || (*source == '-')) source++; while (isdigit((int)*source)) { exponent *= (int)base; exponent += (*source - '0'); source++; } } } value = integer + fraction; if (exponent != 0) { if (isExponentNegative) value /= trio_powl(base, (trio_long_double_t)exponent); else value *= trio_powl(base, (trio_long_double_t)exponent); } if (isNegative) value = -value; if (endp) *endp = (char *)source; return value; # endif } #endif /** Convert string to floating-point number. @param source String to be converted. @param endp Pointer to end of the converted string. @return A floating-point number. See @ref trio_to_long_double. */ #if defined(TRIO_FUNC_TO_DOUBLE) TRIO_PUBLIC_STRING double trio_to_double TRIO_ARGS2((source, endp), TRIO_CONST char *source, char **endp) { #if defined(USE_STRTOD) return strtod(source, endp); #else return (double)trio_to_long_double(source, endp); #endif } #endif /** Convert string to floating-point number. @param source String to be converted. @param endp Pointer to end of the converted string. @return A floating-point number. See @ref trio_to_long_double. */ #if defined(TRIO_FUNC_TO_FLOAT) TRIO_PUBLIC_STRING float trio_to_float TRIO_ARGS2((source, endp), TRIO_CONST char *source, char **endp) { # if defined(USE_STRTOF) return strtof(source, endp); # else return (float)trio_to_long_double(source, endp); # endif } #endif /** Convert string to signed integer. @param string String to be converted. @param endp Pointer to end of converted string. @param base Radix number of number. */ #if defined(TRIO_FUNC_TO_LONG) TRIO_PUBLIC_STRING long trio_to_long TRIO_ARGS3((string, endp, base), TRIO_CONST char *string, char **endp, int base) { assert(string); assert((base >= 2) && (base <= 36)); return strtol(string, endp, base); } #endif /** Convert one alphabetic letter to lower-case. @param source The letter to be converted. @return The converted letter. */ #if defined(TRIO_FUNC_TO_LOWER) TRIO_PUBLIC_STRING int trio_to_lower TRIO_ARGS1((source), int source) { # if defined(USE_TOLOWER) return tolower(source); # else /* Does not handle locales or non-contiguous alphabetic characters */ return ((source >= (int)'A') && (source <= (int)'Z')) ? source - 'A' + 'a' : source; # endif } #endif /** Convert string to unsigned integer. @param string String to be converted. @param endp Pointer to end of converted string. @param base Radix number of number. */ #if defined(TRIO_FUNC_TO_UNSIGNED_LONG) TRIO_PUBLIC_STRING unsigned long trio_to_unsigned_long TRIO_ARGS3((string, endp, base), TRIO_CONST char *string, char **endp, int base) { assert(string); assert((base >= 2) && (base <= 36)); return strtoul(string, endp, base); } #endif /** Convert one alphabetic letter to upper-case. @param source The letter to be converted. @return The converted letter. */ #if defined(TRIO_FUNC_TO_UPPER) TRIO_PUBLIC_STRING int trio_to_upper TRIO_ARGS1((source), int source) { return internal_to_upper(source); } #endif /** Convert the alphabetic letters in the string to upper-case. @param target The string to be converted. @return The number of processed characters (converted or not). */ #if defined(TRIO_FUNC_UPPER) TRIO_PUBLIC_STRING int trio_upper TRIO_ARGS1((target), char *target) { assert(target); return trio_span_function(target, target, internal_to_upper); } #endif /** @} End of StaticStrings */ /************************************************************************* * Dynamic String Functions */ #if defined(TRIO_DOCUMENTATION) # include "doc/doc_dynamic.h" #endif /** @addtogroup DynamicStrings @{ */ /** Create a new dynamic string. @param initial_size Initial size of the buffer. @return Newly allocated dynamic string, or NULL if memory allocation failed. */ #if defined(TRIO_FUNC_STRING_CREATE) TRIO_PUBLIC_STRING trio_string_t * trio_string_create TRIO_ARGS1((initial_size), int initial_size) { trio_string_t *self; self = internal_string_alloc(); if (self) { if (internal_string_grow(self, (size_t)((initial_size > 0) ? initial_size : 1))) { self->content[0] = (char)0; self->allocated = initial_size; } else { trio_string_destroy(self); self = NULL; } } return self; } #endif /** Deallocate the dynamic string and its contents. @param self Dynamic string */ #if defined(TRIO_FUNC_STRING_DESTROY) TRIO_PUBLIC_STRING void trio_string_destroy TRIO_ARGS1((self), trio_string_t *self) { assert(self); if (self) { trio_destroy(self->content); TRIO_FREE(self); } } #endif /** Get a pointer to the content. @param self Dynamic string. @param offset Offset into content. @return Pointer to the content. @p Offset can be zero, positive, or negative. If @p offset is zero, then the start of the content will be returned. If @p offset is positive, then a pointer to @p offset number of characters from the beginning of the content is returned. If @p offset is negative, then a pointer to @p offset number of characters from the ending of the string, starting at the terminating zero, is returned. */ #if defined(TRIO_FUNCT_STRING_GET) TRIO_PUBLIC_STRING char * trio_string_get TRIO_ARGS2((self, offset), trio_string_t *self, int offset) { char *result = NULL; assert(self); if (self->content != NULL) { if (self->length == 0) { (void)trio_string_length(self); } if (offset >= 0) { if (offset > (int)self->length) { offset = self->length; } } else { offset += self->length + 1; if (offset < 0) { offset = 0; } } result = &(self->content[offset]); } return result; } #endif /** Extract the content. @param self Dynamic String @return Content of dynamic string. The content is removed from the dynamic string. This enables destruction of the dynamic string without deallocation of the content. */ #if defined(TRIO_FUNC_STRING_EXTRACT) TRIO_PUBLIC_STRING char * trio_string_extract TRIO_ARGS1((self), trio_string_t *self) { char *result; assert(self); result = self->content; /* FIXME: Allocate new empty buffer? */ self->content = NULL; self->length = self->allocated = 0; return result; } #endif /** Set the content of the dynamic string. @param self Dynamic String @param buffer The new content. Sets the content of the dynamic string to a copy @p buffer. An existing content will be deallocated first, if necessary. @remark This function will make a copy of @p buffer. You are responsible for deallocating @p buffer yourself. */ #if defined(TRIO_FUNC_XSTRING_SET) TRIO_PUBLIC_STRING void trio_xstring_set TRIO_ARGS2((self, buffer), trio_string_t *self, char *buffer) { assert(self); trio_destroy(self->content); self->content = trio_duplicate(buffer); } #endif /* * trio_string_size */ #if defined(TRIO_FUNC_STRING_SIZE) TRIO_PUBLIC_STRING int trio_string_size TRIO_ARGS1((self), trio_string_t *self) { assert(self); return self->allocated; } #endif /* * trio_string_terminate */ #if defined(TRIO_FUNC_STRING_TERMINATE) TRIO_PUBLIC_STRING void trio_string_terminate TRIO_ARGS1((self), trio_string_t *self) { trio_xstring_append_char(self, 0); } #endif /** Append the second string to the first. @param self Dynamic string to be modified. @param other Dynamic string to copy from. @return Boolean value indicating success or failure. */ #if defined(TRIO_FUNC_STRING_APPEND) TRIO_PUBLIC_STRING int trio_string_append TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { size_t length; assert(self); assert(other); length = self->length + other->length; if (!internal_string_grow_to(self, length)) goto error; trio_copy(&self->content[self->length], other->content); self->length = length; return TRUE; error: return FALSE; } #endif /* * trio_xstring_append */ #if defined(TRIO_FUNC_XSTRING_APPEND) TRIO_PUBLIC_STRING int trio_xstring_append TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { size_t length; assert(self); assert(other); length = self->length + trio_length(other); if (!internal_string_grow_to(self, length)) goto error; trio_copy(&self->content[self->length], other); self->length = length; return TRUE; error: return FALSE; } #endif /* * trio_xstring_append_char */ #if defined(TRIO_FUNC_XSTRING_APPEND_CHAR) TRIO_PUBLIC_STRING int trio_xstring_append_char TRIO_ARGS2((self, character), trio_string_t *self, char character) { assert(self); if ((int)self->length >= trio_string_size(self)) { if (!internal_string_grow(self, 0)) goto error; } self->content[self->length] = character; self->length++; return TRUE; error: return FALSE; } #endif /** Search for the first occurrence of second parameter in the first. @param self Dynamic string to be modified. @param other Dynamic string to copy from. @return Boolean value indicating success or failure. */ #if defined(TRIO_FUNC_STRING_CONTAINS) TRIO_PUBLIC_STRING int trio_string_contains TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { assert(self); assert(other); return trio_contains(self->content, other->content); } #endif /* * trio_xstring_contains */ #if defined(TRIO_FUNC_XSTRING_CONTAINS) TRIO_PUBLIC_STRING int trio_xstring_contains TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { assert(self); assert(other); return trio_contains(self->content, other); } #endif /* * trio_string_copy */ #if defined(TRIO_FUNC_STRING_COPY) TRIO_PUBLIC_STRING int trio_string_copy TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { assert(self); assert(other); self->length = 0; return trio_string_append(self, other); } #endif /* * trio_xstring_copy */ #if defined(TRIO_FUNC_XSTRING_COPY) TRIO_PUBLIC_STRING int trio_xstring_copy TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { assert(self); assert(other); self->length = 0; return trio_xstring_append(self, other); } #endif /* * trio_string_duplicate */ #if defined(TRIO_FUNC_STRING_DUPLICATE) TRIO_PUBLIC_STRING trio_string_t * trio_string_duplicate TRIO_ARGS1((other), trio_string_t *other) { trio_string_t *self; assert(other); self = internal_string_alloc(); if (self) { self->content = internal_duplicate_max(other->content, other->length); if (self->content) { self->length = other->length; self->allocated = self->length + 1; } else { self->length = self->allocated = 0; } } return self; } #endif /* * trio_xstring_duplicate */ #if defined(TRIO_FUNC_XSTRING_DUPLICATE) TRIO_PUBLIC_STRING trio_string_t * trio_xstring_duplicate TRIO_ARGS1((other), TRIO_CONST char *other) { trio_string_t *self; assert(other); self = internal_string_alloc(); if (self) { self->content = internal_duplicate_max(other, trio_length(other)); if (self->content) { self->length = trio_length(self->content); self->allocated = self->length + 1; } else { self->length = self->allocated = 0; } } return self; } #endif /* * trio_string_equal */ #if defined(TRIO_FUNC_STRING_EQUAL) TRIO_PUBLIC_STRING int trio_string_equal TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { assert(self); assert(other); return trio_equal(self->content, other->content); } #endif /* * trio_xstring_equal */ #if defined(TRIO_FUNC_XSTRING_EQUAL) TRIO_PUBLIC_STRING int trio_xstring_equal TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { assert(self); assert(other); return trio_equal(self->content, other); } #endif /* * trio_string_equal_max */ #if defined(TRIO_FUNC_STRING_EQUAL_MAX) TRIO_PUBLIC_STRING int trio_string_equal_max TRIO_ARGS3((self, max, other), trio_string_t *self, size_t max, trio_string_t *other) { assert(self); assert(other); return trio_equal_max(self->content, max, other->content); } #endif /* * trio_xstring_equal_max */ #if defined(TRIO_FUNC_XSTRING_EQUAL_MAX) TRIO_PUBLIC_STRING int trio_xstring_equal_max TRIO_ARGS3((self, max, other), trio_string_t *self, size_t max, TRIO_CONST char *other) { assert(self); assert(other); return trio_equal_max(self->content, max, other); } #endif /* * trio_string_equal_case */ #if defined(TRIO_FUNC_STRING_EQUAL_CASE) TRIO_PUBLIC_STRING int trio_string_equal_case TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { assert(self); assert(other); return trio_equal_case(self->content, other->content); } #endif /* * trio_xstring_equal_case */ #if defined(TRIO_FUNC_XSTRING_EQUAL_CASE) TRIO_PUBLIC_STRING int trio_xstring_equal_case TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { assert(self); assert(other); return trio_equal_case(self->content, other); } #endif /* * trio_string_equal_case_max */ #if defined(TRIO_FUNC_STRING_EQUAL_CASE_MAX) TRIO_PUBLIC_STRING int trio_string_equal_case_max TRIO_ARGS3((self, max, other), trio_string_t *self, size_t max, trio_string_t *other) { assert(self); assert(other); return trio_equal_case_max(self->content, max, other->content); } #endif /* * trio_xstring_equal_case_max */ #if defined(TRIO_FUNC_XSTRING_EQUAL_CASE_MAX) TRIO_PUBLIC_STRING int trio_xstring_equal_case_max TRIO_ARGS3((self, max, other), trio_string_t *self, size_t max, TRIO_CONST char *other) { assert(self); assert(other); return trio_equal_case_max(self->content, max, other); } #endif /* * trio_string_format_data_max */ #if defined(TRIO_FUNC_STRING_FORMAT_DATE_MAX) TRIO_PUBLIC_STRING size_t trio_string_format_date_max TRIO_ARGS4((self, max, format, datetime), trio_string_t *self, size_t max, TRIO_CONST char *format, TRIO_CONST struct tm *datetime) { assert(self); return trio_format_date_max(self->content, max, format, datetime); } #endif /* * trio_string_index */ #if defined(TRIO_FUNC_STRING_INDEX) TRIO_PUBLIC_STRING char * trio_string_index TRIO_ARGS2((self, character), trio_string_t *self, int character) { assert(self); return trio_index(self->content, character); } #endif /* * trio_string_index_last */ #if defined(TRIO_FUNC_STRING_INDEX_LAST) TRIO_PUBLIC_STRING char * trio_string_index_last TRIO_ARGS2((self, character), trio_string_t *self, int character) { assert(self); return trio_index_last(self->content, character); } #endif /* * trio_string_length */ #if defined(TRIO_FUNC_STRING_LENGTH) TRIO_PUBLIC_STRING int trio_string_length TRIO_ARGS1((self), trio_string_t *self) { assert(self); if (self->length == 0) { self->length = trio_length(self->content); } return self->length; } #endif /* * trio_string_lower */ #if defined(TRIO_FUNC_STRING_LOWER) TRIO_PUBLIC_STRING int trio_string_lower TRIO_ARGS1((self), trio_string_t *self) { assert(self); return trio_lower(self->content); } #endif /* * trio_string_match */ #if defined(TRIO_FUNC_STRING_MATCH) TRIO_PUBLIC_STRING int trio_string_match TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { assert(self); assert(other); return trio_match(self->content, other->content); } #endif /* * trio_xstring_match */ #if defined(TRIO_FUNC_XSTRING_MATCH) TRIO_PUBLIC_STRING int trio_xstring_match TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { assert(self); assert(other); return trio_match(self->content, other); } #endif /* * trio_string_match_case */ #if defined(TRIO_FUNC_STRING_MATCH_CASE) TRIO_PUBLIC_STRING int trio_string_match_case TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { assert(self); assert(other); return trio_match_case(self->content, other->content); } #endif /* * trio_xstring_match_case */ #if defined(TRIO_FUNC_XSTRING_MATCH_CASE) TRIO_PUBLIC_STRING int trio_xstring_match_case TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { assert(self); assert(other); return trio_match_case(self->content, other); } #endif /* * trio_string_substring */ #if defined(TRIO_FUNC_STRING_SUBSTRING) TRIO_PUBLIC_STRING char * trio_string_substring TRIO_ARGS2((self, other), trio_string_t *self, trio_string_t *other) { assert(self); assert(other); return trio_substring(self->content, other->content); } #endif /* * trio_xstring_substring */ #if defined(TRIO_FUNC_XSTRING_SUBSTRING) TRIO_PUBLIC_STRING char * trio_xstring_substring TRIO_ARGS2((self, other), trio_string_t *self, TRIO_CONST char *other) { assert(self); assert(other); return trio_substring(self->content, other); } #endif /* * trio_string_upper */ #if defined(TRIO_FUNC_STRING_UPPER) TRIO_PUBLIC_STRING int trio_string_upper TRIO_ARGS1((self), trio_string_t *self) { assert(self); return trio_upper(self->content); } #endif /** @} End of DynamicStrings */ bogofilter-1.2.4/trio/triodef.h0000644000175000017500000001673312163572311014633 0ustar sezsez/************************************************************************* * * $Id: triodef.h,v 1.27 2005/03/27 18:52:45 breese Exp $ * * Copyright (C) 2001 Bjorn Reese * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************/ #ifndef TRIO_TRIODEF_H #define TRIO_TRIODEF_H /************************************************************************* * Compiler support detection */ #if defined(__GNUC__) # define TRIO_COMPILER_GCC #endif #if defined(__SUNPRO_C) # define TRIO_COMPILER_SUNPRO #endif #if defined(__SUNPRO_CC) # define TRIO_COMPILER_SUNPRO # define __SUNPRO_C __SUNPRO_CC #endif #if defined(__xlC__) || defined(__IBMC__) || defined(__IBMCPP__) # define TRIO_COMPILER_XLC #else # if defined(_AIX) && !defined(__GNUC__) # define TRIO_COMPILER_XLC /* Workaround for old xlc */ # endif #endif #if defined(__DECC) || defined(__DECCXX) # define TRIO_COMPILER_DECC #else # if defined(__osf__) && defined(__LANGUAGE_C__) && !defined(__GNUC__) # define TRIO_COMPILER_DECC /* Workaround for old DEC C compilers */ # endif #endif #if defined(__HP_aCC) || defined(__HP_cc) # define TRIO_COMPILER_HP #endif #if defined(_MSC_VER) # define TRIO_COMPILER_MSVC #endif #if defined(__BORLANDC__) # define TRIO_COMPILER_BCB #endif /************************************************************************* * Platform support detection */ #if defined(VMS) || defined(__VMS) # define TRIO_PLATFORM_VMS #endif #if defined(unix) || defined(__unix) || defined(__unix__) # define TRIO_PLATFORM_UNIX #endif #if defined(TRIO_COMPILER_XLC) || defined(_AIX) # define TRIO_PLATFORM_UNIX #endif #if defined(TRIO_COMPILER_DECC) || defined(__osf___) # if !defined(TRIO_PLATFORM_VMS) # define TRIO_PLATFORM_UNIX # endif #endif #if defined(__NetBSD__) # define TRIO_PLATFORM_UNIX #endif #if defined(__APPLE__) && defined(__MACH__) # define TRIO_PLATFORM_UNIX #endif #if defined(__QNX__) # define TRIO_PLATFORM_UNIX # define TRIO_PLATFORM_QNX #endif #if defined(__CYGWIN__) # define TRIO_PLATFORM_UNIX #endif #if defined(AMIGA) && defined(TRIO_COMPILER_GCC) # define TRIO_PLATFORM_UNIX #endif #if defined(TRIO_COMPILER_MSVC) || defined(WIN32) || defined(_WIN32) # define TRIO_PLATFORM_WIN32 #endif #if defined(mpeix) || defined(__mpexl) # define TRIO_PLATFORM_MPEIX #endif #if defined(_AIX) # define TRIO_PLATFORM_AIX #endif #if defined(__hpux) # define TRIO_PLATFORM_HPUX #endif #if defined(sun) || defined(__sun__) # if defined(__SVR4) || defined(__svr4__) # define TRIO_PLATFORM_SOLARIS # else # define TRIO_PLATFORM_SUNOS # endif #endif /************************************************************************* * Standards support detection */ #if defined(__STDC__) \ || defined(_MSC_EXTENSIONS) \ || defined(TRIO_COMPILER_BORLAND) # define PREDEF_STANDARD_C89 #endif #if defined(__STDC_VERSION__) # define PREDEF_STANDARD_C90 #endif #if (__STDC_VERSION__ - 0 >= 199409L) # define PREDEF_STANDARD_C94 #endif #if (__STDC_VERSION__ - 0 >= 199901L) # define PREDEF_STANDARD_C99 #endif #if defined(TRIO_COMPILER_SUNPRO) && (TRIO_COMPILER_SUNPRO >= 0x420) # if !defined(PREDEF_STANDARD_C94) # define PREDEF_STANDARD_C94 # endif #endif #if defined(__cplusplus) # define PREDEF_STANDARD_CXX #endif #if __cplusplus - 0 >= 199711L # define PREDEF_STANDARD_CXX89 #endif #if defined(TRIO_PLATFORM_UNIX) # include #endif #if (_XOPEN_VERSION - 0 >= 3) || defined(_XOPEN_XPG3) # define PREDEF_STANDARD_XPG3 #endif #if (_XOPEN_VERSION - 0 >= 4) || defined(_XOPEN_XPG4) # define PREDEF_STANDARD_XPG4 #endif #if (_XOPEN_VERSION - 0 > 4) \ || (defined(_XOPEN_UNIX) && (_XOPEN_VERSION - 0 == 4)) # define PREDEF_STANDARD_UNIX95 #endif #if (_XOPEN_VERSION - 0 >= 500) # define PREDEF_STANDARD_UNIX98 #endif #if (_XOPEN_VERSION - 0 >= 600) # define PREDEF_STANDARD_UNIX03 #endif /************************************************************************* * Generic defines */ #if !defined(TRIO_PUBLIC) # define TRIO_PUBLIC #endif #if !defined(TRIO_PRIVATE) # define TRIO_PRIVATE static #endif #if !(defined(PREDEF_STANDARD_C89) || defined(PREDEF_STANDARD_CXX)) # define TRIO_COMPILER_ANCIENT #endif #if defined(TRIO_COMPILER_ANCIENT) # define TRIO_CONST # define TRIO_VOLATILE # define TRIO_SIGNED typedef double trio_long_double_t; typedef char * trio_pointer_t; # define TRIO_SUFFIX_LONG(x) x # define TRIO_PROTO(x) () # define TRIO_NOARGS # define TRIO_ARGS1(list,a1) list a1; # define TRIO_ARGS2(list,a1,a2) list a1; a2; # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3; # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4; # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5; # define TRIO_ARGS6(list,a1,a2,a3,a4,a5,a6) list a1; a2; a3; a4; a5; a6; # define TRIO_VARGS2(list,a1,a2) list a1; a2 # define TRIO_VARGS3(list,a1,a2,a3) list a1; a2; a3 # define TRIO_VARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4 # define TRIO_VARGS5(list,a1,a2,a3,a4,a5) list a1; a2; a3; a4; a5 # define TRIO_VA_DECL va_dcl # define TRIO_VA_START(x,y) va_start(x) # define TRIO_VA_END(x) va_end(x) #else /* ANSI C */ # define TRIO_CONST const # define TRIO_VOLATILE volatile # define TRIO_SIGNED signed typedef long double trio_long_double_t; typedef void * trio_pointer_t; # define TRIO_SUFFIX_LONG(x) x ## L # define TRIO_PROTO(x) x # define TRIO_NOARGS void # define TRIO_ARGS1(list,a1) (a1) # define TRIO_ARGS2(list,a1,a2) (a1,a2) # define TRIO_ARGS3(list,a1,a2,a3) (a1,a2,a3) # define TRIO_ARGS4(list,a1,a2,a3,a4) (a1,a2,a3,a4) # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) (a1,a2,a3,a4,a5) # define TRIO_ARGS6(list,a1,a2,a3,a4,a5,a6) (a1,a2,a3,a4,a5,a6) # define TRIO_VARGS2 TRIO_ARGS2 # define TRIO_VARGS3 TRIO_ARGS3 # define TRIO_VARGS4 TRIO_ARGS4 # define TRIO_VARGS5 TRIO_ARGS5 # define TRIO_VA_DECL ... # define TRIO_VA_START(x,y) va_start(x,y) # define TRIO_VA_END(x) va_end(x) #endif #if defined(PREDEF_STANDARD_C99) || defined(PREDEF_STANDARD_CXX) # define TRIO_INLINE inline #else # if defined(TRIO_COMPILER_GCC) # define TRIO_INLINE __inline__ # endif # if defined(TRIO_COMPILER_MSVC) # define TRIO_INLINE _inline # endif # if defined(TRIO_COMPILER_BCB) # define TRIO_INLINE __inline # endif #endif #if !defined(TRIO_INLINE) # define TRIO_INLINE #endif /************************************************************************* * Workarounds */ #if defined(TRIO_PLATFORM_VMS) /* * Computations done with constants at compile time can trigger these * even when compiling with IEEE enabled. */ # pragma message disable (UNDERFLOW, FLOATOVERFL) # if (__CRTL_VER < 80000000) /* * Although the compiler supports C99 language constructs, the C * run-time library does not contain all C99 functions. * * This was the case for 70300022. Update the 80000000 value when * it has been accurately determined what version of the library * supports C99. */ # if defined(PREDEF_STANDARD_C99) # undef PREDEF_STANDARD_C99 # endif # endif #endif /* * Not all preprocessors supports the LL token. */ #if defined(TRIO_COMPILER_MSVC) || defined(TRIO_COMPILER_BCB) #else # define TRIO_COMPILER_SUPPORTS_LL #endif #endif /* TRIO_TRIODEF_H */ bogofilter-1.2.4/trio/triostr.h0000644000175000017500000003720112163572311014676 0ustar sezsez/************************************************************************* * * $Id: triostr.h,v 1.15 2005/05/29 11:56:01 breese Exp $ * * Copyright (C) 2001 Bjorn Reese and Daniel Stenberg. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************/ #ifndef TRIO_TRIOSTR_H #define TRIO_TRIOSTR_H /* * Documentation is located in triostr.c */ #include #include #include #include #include "triodef.h" #include "triop.h" #ifdef __cplusplus extern "C" { #endif enum { TRIO_HASH_NONE = 0, TRIO_HASH_PLAIN, TRIO_HASH_TWOSIGNED }; #if !defined(TRIO_PUBLIC_STRING) # if !defined(TRIO_PUBLIC) # define TRIO_PUBLIC # endif # define TRIO_PUBLIC_STRING TRIO_PUBLIC #endif /************************************************************************* * Dependencies */ #if defined(TRIO_EMBED_STRING) /* * The application that triostr is embedded in must define which functions * it uses. * * The following resolves internal dependencies. */ # if defined(TRIO_FUNC_XSTRING_SET) # if !defined(TRIO_FUNC_DUPLICATE) # define TRIO_FUNC_DUPLICATE # endif # endif # if defined(TRIO_FUNC_DUPLICATE) \ || defined(TRIO_FUNC_DUPLICATE_MAX) \ || defined(TRIO_FUNC_STRING_DUPLICATE) \ || defined(TRIO_FUNC_XSTRING_DUPLICATE) # if !defined(TRIO_FUNC_CREATE) # define TRIO_FUNC_CREATE # endif # if !defined(TRIO_FUNC_COPY_MAX) # define TRIO_FUNC_COPY_MAX # endif # endif # if defined(TRIO_FUNC_STRING_CREATE) # if !defined(TRIO_FUNC_STRING_DESTROY) # define TRIO_FUNC_STRING_DESTROY # endif # endif # if defined(TRIO_FUNC_STRING_DESTROY) \ || defined(TRIO_FUNC_XSTRING_SET) # if !defined(TRIO_FUNC_DESTROY) # define TRIO_FUNC_DESTROY # endif # endif # if defined(TRIO_FUNC_EQUAL_LOCALE) \ || defined(TRIO_FUNC_STRING_EQUAL) \ || defined(TRIO_FUNC_XSTRING_EQUAL) # if !defined(TRIO_FUNC_EQUAL) # define TRIO_FUNC_EQUAL # endif # endif # if defined(TRIO_FUNC_EQUAL_CASE) \ || defined(TRIO_FUNC_STRING_EQUAL_CASE) \ || defined(TRIO_FUNC_XSTRING_EQUAL_CASE) # if !defined(TRIO_FUNC_EQUAL_CASE) # define TRIO_FUNC_EQUAL_CASE # endif # endif # if defined(TRIO_FUNC_SUBSTRING_MAX) \ || defined(TRIO_FUNC_STRING_EQUAL_MAX) \ || defined(TRIO_FUNC_XSTRING_EQUAL_MAX) # if !defined(TRIO_FUNC_EQUAL_MAX) # define TRIO_FUNC_EQUAL_MAX # endif # endif # if defined(TRIO_FUNC_TO_DOUBLE) \ || defined(TRIO_FUNC_TO_FLOAT) # if !defined(TRIO_FUNC_TO_LONG_DOUBLE) # define TRIO_FUNC_TO_LONG_DOUBLE # endif # endif # if defined(TRIO_FUNC_STRING_TERMINATE) # if !defined(TRIO_FUNC_XSTRING_APPEND_CHAR) # define TRIO_FUNC_XSTRING_APPEND_CHAR # endif # endif # if defined(TRIO_FUNC_XSTRING_APPEND_CHAR) # if !defined(TRIO_FUNC_STRING_SIZE) # define TRIO_FUNC_STRING_SIZE # endif # endif #else /* * When triostr is not embedded all all functions are defined. */ # define TRIO_FUNC_APPEND # define TRIO_FUNC_APPEND_MAX # define TRIO_FUNC_CONTAINS # define TRIO_FUNC_COPY # define TRIO_FUNC_COPY_MAX # define TRIO_FUNC_CREATE # define TRIO_FUNC_DESTROY # define TRIO_FUNC_DUPLICATE # define TRIO_FUNC_DUPLICATE_MAX # define TRIO_FUNC_EQUAL # define TRIO_FUNC_EQUAL_CASE # define TRIO_FUNC_EQUAL_CASE_MAX # define TRIO_FUNC_EQUAL_LOCALE # define TRIO_FUNC_EQUAL_MAX # define TRIO_FUNC_ERROR # define TRIO_FUNC_FORMAT_DATE_MAX # define TRIO_FUNC_HASH # define TRIO_FUNC_INDEX # define TRIO_FUNC_INDEX_LAST # define TRIO_FUNC_LENGTH # define TRIO_FUNC_LOWER # define TRIO_FUNC_MATCH # define TRIO_FUNC_MATCH_CASE # define TRIO_FUNC_SPAN_FUNCTION # define TRIO_FUNC_SUBSTRING # define TRIO_FUNC_SUBSTRING_MAX # define TRIO_FUNC_TO_DOUBLE # define TRIO_FUNC_TO_FLOAT # define TRIO_FUNC_TO_LONG # define TRIO_FUNC_TO_LONG_DOUBLE # define TRIO_FUNC_TO_LOWER # define TRIO_FUNC_TO_UNSIGNED_LONG # define TRIO_FUNC_TO_UPPER # define TRIO_FUNC_TOKENIZE # define TRIO_FUNC_UPPER # define TRIO_FUNC_STRING_APPEND # define TRIO_FUNC_STRING_CONTAINS # define TRIO_FUNC_STRING_COPY # define TRIO_FUNC_STRING_CREATE # define TRIO_FUNC_STRING_DESTROY # define TRIO_FUNC_STRING_DUPLICATE # define TRIO_FUNC_STRING_EQUAL # define TRIO_FUNC_STRING_EQUAL_CASE # define TRIO_FUNC_STRING_EQUAL_CASE_MAX # define TRIO_FUNC_STRING_EQUAL_MAX # define TRIO_FUNC_STRING_EXTRACT # define TRIO_FUNC_STRING_FORMAT_DATE_MAX # define TRIO_FUNC_STRING_GET # define TRIO_FUNC_STRING_INDEX # define TRIO_FUNC_STRING_INDEX_LAST # define TRIO_FUNC_STRING_LENGTH # define TRIO_FUNC_STRING_LOWER # define TRIO_FUNC_STRING_MATCH # define TRIO_FUNC_STRING_MATCH_CASE # define TRIO_FUNC_STRING_SIZE # define TRIO_FUNC_STRING_SUBSTRING # define TRIO_FUNC_STRING_TERMINATE # define TRIO_FUNC_STRING_UPPER # define TRIO_FUNC_XSTRING_APPEND # define TRIO_FUNC_XSTRING_APPEND_CHAR # define TRIO_FUNC_XSTRING_CONTAINS # define TRIO_FUNC_XSTRING_COPY # define TRIO_FUNC_XSTRING_DUPLICATE # define TRIO_FUNC_XSTRING_EQUAL # define TRIO_FUNC_XSTRING_EQUAL_CASE # define TRIO_FUNC_XSTRING_EQUAL_CASE_MAX # define TRIO_FUNC_XSTRING_EQUAL_MAX # define TRIO_FUNC_XSTRING_MATCH # define TRIO_FUNC_XSTRING_MATCH_CASE # define TRIO_FUNC_XSTRING_SET # define TRIO_FUNC_XSTRING_SUBSTRING #endif /************************************************************************* * String functions */ #if defined(TRIO_FUNC_APPEND) TRIO_PUBLIC_STRING int trio_append TRIO_PROTO((char *target, TRIO_CONST char *source)); #endif #if defined(TRIO_FUNC_APPEND_MAX) TRIO_PUBLIC_STRING int trio_append_max TRIO_PROTO((char *target, size_t max, TRIO_CONST char *source)); #endif #if defined(TRIO_FUNC_CONTAINS) TRIO_PUBLIC_STRING int trio_contains TRIO_PROTO((TRIO_CONST char *string, TRIO_CONST char *substring)); #endif #if defined(TRIO_FUNC_COPY) TRIO_PUBLIC_STRING int trio_copy TRIO_PROTO((char *target, TRIO_CONST char *source)); #endif #if defined(TRIO_FUNC_COPY_MAX) TRIO_PUBLIC_STRING int trio_copy_max TRIO_PROTO((char *target, size_t max, TRIO_CONST char *source)); #endif #if defined(TRIO_FUNC_CREATE) TRIO_PUBLIC_STRING char * trio_create TRIO_PROTO((size_t size)); #endif #if defined(TRIO_FUNC_DESTROY) TRIO_PUBLIC_STRING void trio_destroy TRIO_PROTO((char *string)); #endif #if defined(TRIO_FUNC_DUPLICATE) TRIO_PUBLIC_STRING char * trio_duplicate TRIO_PROTO((TRIO_CONST char *source)); #endif #if defined(TRIO_FUNC_DUPLICATE_MAX) TRIO_PUBLIC_STRING char * trio_duplicate_max TRIO_PROTO((TRIO_CONST char *source, size_t max)); #endif #if defined(TRIO_FUNC_EQUAL) TRIO_PUBLIC_STRING int trio_equal TRIO_PROTO((TRIO_CONST char *first, TRIO_CONST char *second)); #endif #if defined(TRIO_FUNC_EQUAL_CASE) TRIO_PUBLIC_STRING int trio_equal_case TRIO_PROTO((TRIO_CONST char *first, TRIO_CONST char *second)); #endif #if defined(TRIO_FUNC_EQUAL_CASE_MAX) TRIO_PUBLIC_STRING int trio_equal_case_max TRIO_PROTO((TRIO_CONST char *first, size_t max, TRIO_CONST char *second)); #endif #if defined(TRIO_FUNC_EQUAL_LOCALE) TRIO_PUBLIC_STRING int trio_equal_locale TRIO_PROTO((TRIO_CONST char *first, TRIO_CONST char *second)); #endif #if defined(TRIO_FUNC_EQUAL_MAX) TRIO_PUBLIC_STRING int trio_equal_max TRIO_PROTO((TRIO_CONST char *first, size_t max, TRIO_CONST char *second)); #endif #if defined(TRIO_FUNC_ERROR) TRIO_PUBLIC_STRING TRIO_CONST char * trio_error TRIO_PROTO((int)); #endif #if defined(TRIO_FUNC_FORMAT_DATE_MAX) TRIO_PUBLIC_STRING size_t trio_format_date_max TRIO_PROTO((char *target, size_t max, TRIO_CONST char *format, TRIO_CONST struct tm *datetime)); #endif #if defined(TRIO_FUNC_HASH) TRIO_PUBLIC_STRING unsigned long trio_hash TRIO_PROTO((TRIO_CONST char *string, int type)); #endif #if defined(TRIO_FUNC_INDEX) TRIO_PUBLIC_STRING char * trio_index TRIO_PROTO((TRIO_CONST char *string, int character)); #endif #if defined(TRIO_FUNC_INDEX_LAST) TRIO_PUBLIC_STRING char * trio_index_last TRIO_PROTO((TRIO_CONST char *string, int character)); #endif #if defined(TRIO_FUNC_LENGTH) TRIO_PUBLIC_STRING size_t trio_length TRIO_PROTO((TRIO_CONST char *string)); #endif #if defined(TRIO_FUNC_LOWER) TRIO_PUBLIC_STRING int trio_lower TRIO_PROTO((char *target)); #endif #if defined(TRIO_FUNC_MATCH) TRIO_PUBLIC_STRING int trio_match TRIO_PROTO((TRIO_CONST char *string, TRIO_CONST char *pattern)); #endif #if defined(TRIO_FUNC_MATCH_CASE) TRIO_PUBLIC_STRING int trio_match_case TRIO_PROTO((TRIO_CONST char *string, TRIO_CONST char *pattern)); #endif #if defined(TRIO_FUNC_SPAN_FUNCTION) TRIO_PUBLIC_STRING size_t trio_span_function TRIO_PROTO((char *target, TRIO_CONST char *source, int (*Function) TRIO_PROTO((int)))); #endif #if defined(TRIO_FUNC_SUBSTRING) TRIO_PUBLIC_STRING char * trio_substring TRIO_PROTO((TRIO_CONST char *string, TRIO_CONST char *substring)); #endif #if defined(TRIO_FUNC_SUBSTRING_MAX) TRIO_PUBLIC_STRING char * trio_substring_max TRIO_PROTO((TRIO_CONST char *string, size_t max, TRIO_CONST char *substring)); #endif #if defined(TRIO_FUNC_TO_DOUBLE) TRIO_PUBLIC_STRING double trio_to_double TRIO_PROTO((TRIO_CONST char *source, char **endp)); #endif #if defined(TRIO_FUNC_TO_FLOAT) TRIO_PUBLIC_STRING float trio_to_float TRIO_PROTO((TRIO_CONST char *source, char **endp)); #endif #if defined(TRIO_FUNC_TO_LONG) TRIO_PUBLIC_STRING long trio_to_long TRIO_PROTO((TRIO_CONST char *source, char **endp, int base)); #endif #if defined(TRIO_FUNC_TO_LOWER) TRIO_PUBLIC_STRING int trio_to_lower TRIO_PROTO((int source)); #endif #if defined(TRIO_FUNC_TO_LONG_DOUBLE) TRIO_PUBLIC_STRING trio_long_double_t trio_to_long_double TRIO_PROTO((TRIO_CONST char *source, char **endp)); #endif #if defined(TRIO_FUNC_TO_UNSIGNED_LONG) TRIO_PUBLIC_STRING unsigned long trio_to_unsigned_long TRIO_PROTO((TRIO_CONST char *source, char **endp, int base)); #endif #if defined(TRIO_FUNC_TO_UPPER) TRIO_PUBLIC_STRING int trio_to_upper TRIO_PROTO((int source)); #endif #if defined(TRIO_FUNC_TOKENIZE) TRIO_PUBLIC_STRING char * trio_tokenize TRIO_PROTO((char *string, TRIO_CONST char *delimiters)); #endif #if defined(TRIO_FUNC_UPPER) TRIO_PUBLIC_STRING int trio_upper TRIO_PROTO((char *target)); #endif /************************************************************************* * Dynamic string functions */ /* * Opaque type for dynamic strings */ typedef struct _trio_string_t trio_string_t; #if defined(TRIO_FUNC_STRING_APPEND) TRIO_PUBLIC_STRING int trio_string_append TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_CONTAINS) TRIO_PUBLIC_STRING int trio_string_contains TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_COPY) TRIO_PUBLIC_STRING int trio_string_copy TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_CREATE) TRIO_PUBLIC_STRING trio_string_t * trio_string_create TRIO_PROTO((int initial_size)); #endif #if defined(TRIO_FUNC_STRING_DESTROY) TRIO_PUBLIC_STRING void trio_string_destroy TRIO_PROTO((trio_string_t *self)); #endif #if defined(TRIO_FUNC_STRING_DUPLICATE) TRIO_PUBLIC_STRING trio_string_t * trio_string_duplicate TRIO_PROTO((trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_EQUAL) TRIO_PUBLIC_STRING int trio_string_equal TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_EQUAL_MAX) TRIO_PUBLIC_STRING int trio_string_equal_max TRIO_PROTO((trio_string_t *self, size_t max, trio_string_t *second)); #endif #if defined(TRIO_FUNC_STRING_EQUAL_CASE) TRIO_PUBLIC_STRING int trio_string_equal_case TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_EQUAL_CASE_MAX) TRIO_PUBLIC_STRING int trio_string_equal_case_max TRIO_PROTO((trio_string_t *self, size_t max, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_EXTRACT) TRIO_PUBLIC_STRING char * trio_string_extract TRIO_PROTO((trio_string_t *self)); #endif #if defined(TRIO_FUNC_STRING_FORMAT_DATE_MAX) TRIO_PUBLIC_STRING size_t trio_string_format_date_max TRIO_PROTO((trio_string_t *self, size_t max, TRIO_CONST char *format, TRIO_CONST struct tm *datetime)); #endif #if defined(TRIO_FUNC_STRING_GET) TRIO_PUBLIC_STRING char * trio_string_get TRIO_PROTO((trio_string_t *self, int offset)); #endif #if defined(TRIO_FUNC_STRING_INDEX) TRIO_PUBLIC_STRING char * trio_string_index TRIO_PROTO((trio_string_t *self, int character)); #endif #if defined(TRIO_FUNC_STRING_INDEX_LAST) TRIO_PUBLIC_STRING char * trio_string_index_last TRIO_PROTO((trio_string_t *self, int character)); #endif #if defined(TRIO_FUNC_STRING_LENGTH) TRIO_PUBLIC_STRING int trio_string_length TRIO_PROTO((trio_string_t *self)); #endif #if defined(TRIO_FUNC_STRING_LOWER) TRIO_PUBLIC_STRING int trio_string_lower TRIO_PROTO((trio_string_t *self)); #endif #if defined(TRIO_FUNC_STRING_MATCH) TRIO_PUBLIC_STRING int trio_string_match TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_MATCH_CASE) TRIO_PUBLIC_STRING int trio_string_match_case TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_SIZE) TRIO_PUBLIC_STRING int trio_string_size TRIO_PROTO((trio_string_t *self)); #endif #if defined(TRIO_FUNC_STRING_SUBSTRING) TRIO_PUBLIC_STRING char * trio_string_substring TRIO_PROTO((trio_string_t *self, trio_string_t *other)); #endif #if defined(TRIO_FUNC_STRING_TERMINATE) TRIO_PUBLIC_STRING void trio_string_terminate TRIO_PROTO((trio_string_t *self)); #endif #if defined(TRIO_FUNC_STRING_UPPER) TRIO_PUBLIC_STRING int trio_string_upper TRIO_PROTO((trio_string_t *self)); #endif #if defined(TRIO_FUNC_XSTRING_APPEND) TRIO_PUBLIC_STRING int trio_xstring_append TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_APPEND_CHAR) TRIO_PUBLIC_STRING int trio_xstring_append_char TRIO_PROTO((trio_string_t *self, char character)); #endif #if defined(TRIO_FUNC_XSTRING_CONTAINS) TRIO_PUBLIC_STRING int trio_xstring_contains TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_COPY) TRIO_PUBLIC_STRING int trio_xstring_copy TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_DUPLICATE) TRIO_PUBLIC_STRING trio_string_t * trio_xstring_duplicate TRIO_PROTO((TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_EQUAL) TRIO_PUBLIC_STRING int trio_xstring_equal TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_EQUAL_MAX) TRIO_PUBLIC_STRING int trio_xstring_equal_max TRIO_PROTO((trio_string_t *self, size_t max, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_EQUAL_CASE) TRIO_PUBLIC_STRING int trio_xstring_equal_case TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_EQUAL_CASE_MAX) TRIO_PUBLIC_STRING int trio_xstring_equal_case_max TRIO_PROTO((trio_string_t *self, size_t max, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_MATCH) TRIO_PUBLIC_STRING int trio_xstring_match TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_MATCH_CASE) TRIO_PUBLIC_STRING int trio_xstring_match_case TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #if defined(TRIO_FUNC_XSTRING_SET) TRIO_PUBLIC_STRING void trio_xstring_set TRIO_PROTO((trio_string_t *self, char *buffer)); #endif #if defined(TRIO_FUNC_XSTRING_SUBSTRING) TRIO_PUBLIC_STRING char * trio_xstring_substring TRIO_PROTO((trio_string_t *self, TRIO_CONST char *other)); #endif #ifdef __cplusplus } #endif #endif /* TRIO_TRIOSTR_H */ bogofilter-1.2.4/trio/Makefile.am0000644000175000017500000000016712163572311015054 0ustar sezsezEXTRA_DIST= CHANGES README triostr.c trio.c trionan.c \ trio.h triop.h triodef.h trionan.h triostr.h regression.c bogofilter-1.2.4/trio/regression.c0000644000175000017500000012146112163572311015345 0ustar sezsez/************************************************************************* * Regression test */ #include "triodef.h" #if defined(TRIO_COMPILER_ANCIENT) # include #else # include #endif #include #include #include #include #include "trio.h" #include "triop.h" #if defined(TRIO_EMBED_NAN) # define TRIO_PUBLIC_NAN static # define TRIO_FUNC_NINF # define TRIO_FUNC_PINF # define TRIO_FUNC_NAN # define TRIO_FUNC_ISINF # define TRIO_FUNC_ISNAN # if TRIO_FEATURE_FLOAT # define TRIO_FUNC_NZERO # endif #endif #include "trionan.h" #if defined(TRIO_EMBED_STRING) # define TRIO_PUBLIC_STRING static # define TRIO_FUNC_EQUAL_CASE #endif #include "triostr.h" #undef printf #if TRIO_FEATURE_WIDECHAR # include #endif #define QUOTE(x) #x #define DOUBLE_EQUAL(x,y) (((x)>(y)-DBL_EPSILON) && ((x)<(y)+DBL_EPSILON)) #define FLOAT_EQUAL(x,y) (((x)>(y)-FLT_EPSILON) && ((x)<(y)+FLT_EPSILON)) static TRIO_CONST char rcsid[] = "@(#)$Id: regression.c,v 1.54 2005/12/25 11:06:57 breese Exp $"; #if defined(TRIO_EMBED_NAN) # include "trionan.c" #endif #if defined(TRIO_EMBED_STRING) # include "triostr.c" #endif /************************************************************************* * */ static void Dump TRIO_ARGS2((buffer, rc), char *buffer, int rc) { if (rc < 0) { printf("Err = %d (%s), Pos = %d\n", TRIO_ERROR_CODE(rc), TRIO_ERROR_NAME(rc), TRIO_ERROR_POSITION(rc)); } else if (buffer) printf("buffer[% 3d] = \"%s\"\n", rc, buffer); } /************************************************************************* * */ static void Report0 TRIO_ARGS2((file, line), TRIO_CONST char *file, int line) { printf("Verification failed in %s:%d.\n", file, line); } /************************************************************************* * */ static void Report TRIO_ARGS4((file, line, expected, got), TRIO_CONST char *file, int line, TRIO_CONST char *expected, TRIO_CONST char *got) { Report0(file, line); printf(" Expected \"%s\"\n", expected); printf(" Got \"%s\"\n", got); } /************************************************************************* * */ int Verify TRIO_VARGS5((file, line, result, fmt, va_alist), TRIO_CONST char *file, int line, TRIO_CONST char *result, TRIO_CONST char *fmt, TRIO_VA_DECL) { int rc; va_list args; char buffer[4096]; TRIO_VA_START(args, fmt); rc = trio_vsnprintf(buffer, sizeof(buffer), fmt, args); if (rc < 0) Dump(buffer, rc); TRIO_VA_END(args); if (!trio_equal_case(result, buffer)) { Report(file, line, result, buffer); return 1; } return 0; } /************************************************************************* * */ int VerifyReturnValues(TRIO_NOARGS) { int nerrors = 0; int rc; int count; char *expected; char buffer[4096]; char result[4096]; rc = trio_sprintf(buffer, "%s%n", "0123456789", &count); trio_sprintf(result, "%d %d %s", rc, count, buffer); expected = "10 10 0123456789"; if (!trio_equal_case(result, expected)) { nerrors++; Report(__FILE__, __LINE__, expected, result); } rc = trio_snprintf(buffer, sizeof(buffer), "%s%n", "0123456789", &count); trio_sprintf(result, "%d %d %s", rc, count, buffer); expected = "10 10 0123456789"; if (!trio_equal_case(result, expected)) { nerrors++; Report(__FILE__, __LINE__, expected, result); } rc = trio_snprintf(buffer, 4, "%s%n", "0123456789", &count); trio_sprintf(result, "%d %d %s", rc, count, buffer); expected = "10 3 012"; if (!trio_equal_case(result, expected)) { nerrors++; Report(__FILE__, __LINE__, expected, result); } /* The output buffer contains the empty string */ rc = trio_snprintf(buffer, 1, "%s%n", "0123456789", &count); trio_sprintf(result, "%d %d %s", rc, count, buffer); expected = "10 0 "; if (!trio_equal_case(result, expected)) { nerrors++; Report(__FILE__, __LINE__, expected, result); } /* The output buffer should be left untouched when max size is 0 */ trio_sprintf(buffer, "DO NOT TOUCH"); rc = trio_snprintf(buffer, 0, "%s%n", "0123456789", &count); trio_sprintf(result, "%d %d %s", rc, count, buffer); expected = "10 0 DO NOT TOUCH"; if (!trio_equal_case(result, expected)) { nerrors++; Report(__FILE__, __LINE__, expected, result); } return nerrors; } /************************************************************************* * */ #define TEST_STRING "0123456789" int VerifyAllocate(TRIO_NOARGS) { int nerrors = 0; #if TRIO_FEATURE_DYNAMICSTRING int rc; char *string; int count; int test_size = sizeof(TEST_STRING) - 1; /* Allocate a string with the result */ rc = trio_asprintf(&string, "%s%n", TEST_STRING, &count); if (rc < 0) { nerrors++; Dump(string, rc); } else if (count != test_size) { nerrors++; printf("Validation failed in %s:%d\n", __FILE__, __LINE__); printf(" Expected %%n = %d\n", test_size); printf(" Got %%n = %d\n", count); } else if (!trio_equal_case(string, TEST_STRING)) { nerrors++; Report(__FILE__, __LINE__, TEST_STRING, string); } if (string) free(string); #endif return nerrors; } /************************************************************************* * */ int VerifyFormatting(TRIO_NOARGS) { int nerrors = 0; char buffer[256]; /* Normal text */ nerrors += Verify(__FILE__, __LINE__, "Hello world", "Hello world"); /* String */ nerrors += Verify(__FILE__, __LINE__, "Hello world", "%s", "Hello world"); /* Pointer */ if (sizeof(void *) == 4) { nerrors += Verify(__FILE__, __LINE__, "Pointer 0x01234567", "Pointer %p", 0x1234567); } else if (sizeof(void *) == 8) { nerrors += Verify(__FILE__, __LINE__, "Pointer 0x0123456789012345", "Pointer %p", 0x123456789012345); } /* Nil pointer */ nerrors += Verify(__FILE__, __LINE__, "Pointer (nil)", "Pointer %p", NULL); /* Integer */ nerrors += Verify(__FILE__, __LINE__, "Number 42", "Number %d", 42); nerrors += Verify(__FILE__, __LINE__, "Number -42", "Number %d", -42); nerrors += Verify(__FILE__, __LINE__, "Number 42", "Number %ld", 42L); nerrors += Verify(__FILE__, __LINE__, "Number -42", "Number %ld", -42L); /* Integer width */ nerrors += Verify(__FILE__, __LINE__, " 1234", "%6d", 1234); nerrors += Verify(__FILE__, __LINE__, " 1234", "%*d", 6, 1234); /* Integer width overrun */ nerrors += Verify(__FILE__, __LINE__, "123456", "%4d", 123456); /* Integer precision */ nerrors += Verify(__FILE__, __LINE__, "0012", "%.4d", 12); nerrors += Verify(__FILE__, __LINE__, "0012", "%.*d", 4, 12); nerrors += Verify(__FILE__, __LINE__, " 0012", "%6.*d", 4, 12); nerrors += Verify(__FILE__, __LINE__, " 0012", "%*.*d", 6, 4, 12); nerrors += Verify(__FILE__, __LINE__, " 0012", "%*.*.*d", 6, 4, 2, 12); nerrors += Verify(__FILE__, __LINE__, " 0012", "%*.*.*i", 6, 4, 10, 12); /* Integer sign, zero-padding, and width */ nerrors += Verify(__FILE__, __LINE__, "+01234", "%+06d", 1234); nerrors += Verify(__FILE__, __LINE__, " 01234", "% 06d", 1234); nerrors += Verify(__FILE__, __LINE__, "+01234", "% +06d", 1234); /* Integer adjust, zero-padding, and width */ nerrors += Verify(__FILE__, __LINE__, "12 ", "%-08d", 12); /* Integer zero-padding, width, and precision */ nerrors += Verify(__FILE__, __LINE__, " 000012", "%08.6d", 12); /* Integer base */ nerrors += Verify(__FILE__, __LINE__, "42", "%u", 42); nerrors += Verify(__FILE__, __LINE__, "-1", "%d", -1); nerrors += Verify(__FILE__, __LINE__, "52", "%o", 42); nerrors += Verify(__FILE__, __LINE__, "052", "%#o", 42); nerrors += Verify(__FILE__, __LINE__, "0", "%#o", 0); nerrors += Verify(__FILE__, __LINE__, "2a", "%x", 42); nerrors += Verify(__FILE__, __LINE__, "2A", "%X", 42); nerrors += Verify(__FILE__, __LINE__, "0x2a", "%#x", 42); nerrors += Verify(__FILE__, __LINE__, "0X2A", "%#X", 42); nerrors += Verify(__FILE__, __LINE__, "0x00c ", "%-#6.3x", 12); nerrors += Verify(__FILE__, __LINE__, "", "%.d", 0); nerrors += Verify(__FILE__, __LINE__, "", "%#.d", 0); nerrors += Verify(__FILE__, __LINE__, "42", "%.d", 42); nerrors += Verify(__FILE__, __LINE__, "", "%.o", 0); nerrors += Verify(__FILE__, __LINE__, " 0000", "%8.4o", 0); nerrors += Verify(__FILE__, __LINE__, " 0", "%8o", 0); nerrors += Verify(__FILE__, __LINE__, "00000000", "%08o", 0); nerrors += Verify(__FILE__, __LINE__, "0", "%#.o", 0); nerrors += Verify(__FILE__, __LINE__, "52", "%.o", 42); nerrors += Verify(__FILE__, __LINE__, "", "%.x", 0); nerrors += Verify(__FILE__, __LINE__, "", "%#.x", 0); nerrors += Verify(__FILE__, __LINE__, "2a", "%.x", 42); sprintf(buffer, "%u", UINT_MAX); nerrors += Verify(__FILE__, __LINE__, buffer, "%u", -1); sprintf(buffer, "%x", UINT_MAX); nerrors += Verify(__FILE__, __LINE__, buffer, "%x", -1); #if TRIO_FEATURE_FLOAT /* Double */ nerrors += Verify(__FILE__, __LINE__, "3141.000000", "%f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "3141.500000", "%f", 3141.5); nerrors += Verify(__FILE__, __LINE__, "3.141000e+03", "%e", 3141.0); nerrors += Verify(__FILE__, __LINE__, " -2.3420e-02", "%16.4e", -2.342E-02); nerrors += Verify(__FILE__, __LINE__, " -2.3420e-22", "%16.4e", -2.342E-22); nerrors += Verify(__FILE__, __LINE__, " 2.3420e-02", "% 16.4e", 2.342E-02); nerrors += Verify(__FILE__, __LINE__, " 2.3420e-02", "% 1.4e", 2.342E-02); nerrors += Verify(__FILE__, __LINE__, "3.141000E-44", "%E", 3.141e-44); nerrors += Verify(__FILE__, __LINE__, "0", "%g", 0.0); nerrors += Verify(__FILE__, __LINE__, "-0", "%g", trio_nzero()); nerrors += Verify(__FILE__, __LINE__, "3141.5", "%g", 3141.5); nerrors += Verify(__FILE__, __LINE__, "3.1415E-06", "%G", 3.1415e-6); nerrors += Verify(__FILE__, __LINE__, "+3141.000000", "%+f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "-3141.000000", "%+f", -3141.0); nerrors += Verify(__FILE__, __LINE__, "0.333333", "%f", 1.0/3.0); nerrors += Verify(__FILE__, __LINE__, "0.666667", "%f", 2.0/3.0); /* Beyond accuracy */ nerrors += Verify(__FILE__, __LINE__, "0.000000", "%f", 1.234567890123456789e-20); # if defined(TRIO_BREESE) nerrors += Verify(__FILE__, __LINE__, "1.3999999999999999111821580299875", "%.32g", 1.4); nerrors += Verify(__FILE__, __LINE__, "1.39999999999999991118215802998748", "%.32f", 1.4); nerrors += Verify(__FILE__, __LINE__, "1.3999999999999999111821580300", "%.28f", 1.4); nerrors += Verify(__FILE__, __LINE__, "1.399999999999999911182158", "%.24f", 1.4); nerrors += Verify(__FILE__, __LINE__, "1.39999999999999991", "%.17f", 1.4); nerrors += Verify(__FILE__, __LINE__, "1.40000000000000", "%.14f", 1.4); nerrors += Verify(__FILE__, __LINE__, "39413.800000000002910383045673370361", "%.30f", 39413.80); # endif /* 2^-1 + 2^-15 */ nerrors += Verify(__FILE__, __LINE__, "0.500030517578125", "%.*g", DBL_DIG + 10, 0.500030517578125); /* Double decimal point */ nerrors += Verify(__FILE__, __LINE__, "3141", "%.0f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "3142", "%.0f", 3141.5); nerrors += Verify(__FILE__, __LINE__, "3141", "%.f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "12", "%.f", 12.34); nerrors += Verify(__FILE__, __LINE__, "3141.000", "%.3f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "3141.000000", "%#f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "0.0000", "%#.4f", 0.0); nerrors += Verify(__FILE__, __LINE__, "0.000", "%#.4g", 0.0); nerrors += Verify(__FILE__, __LINE__, "0.001000", "%#.4g", 1e-3); nerrors += Verify(__FILE__, __LINE__, "3141.0000", "%#.4f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "3141.", "%#.0f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "3141.", "%#.f", 3141.0); nerrors += Verify(__FILE__, __LINE__, "11.0000", "%#.4f", 11.0); nerrors += Verify(__FILE__, __LINE__, "100.00", "%.2f", 99.9999); nerrors += Verify(__FILE__, __LINE__, "3e+03", "%.e", 3141.0); nerrors += Verify(__FILE__, __LINE__, "3.e+03", "%#.e", 3141.0); nerrors += Verify(__FILE__, __LINE__, "1.23457e+06", "%g", 1234567.0); nerrors += Verify(__FILE__, __LINE__, "1e+02", "%.2g", 99.9999); nerrors += Verify(__FILE__, __LINE__, "1.0e+02", "%#.2g", 99.9999); nerrors += Verify(__FILE__, __LINE__, "0.123", "%0g", 0.123); nerrors += Verify(__FILE__, __LINE__, "1.00e+00", "%.2e", 0.9999); nerrors += Verify(__FILE__, __LINE__, "1", "%.2g", 0.9999); nerrors += Verify(__FILE__, __LINE__, "2", "%.0g", 1.5); nerrors += Verify(__FILE__, __LINE__, "2", "%.g", 1.5); nerrors += Verify(__FILE__, __LINE__, "0.01", "%.2g", 0.01); nerrors += Verify(__FILE__, __LINE__, "0.010", "%#.2g", 0.01); nerrors += Verify(__FILE__, __LINE__, "1e-04", "%5.g", 0.999999e-4); /* Double width and precision */ nerrors += Verify(__FILE__, __LINE__, " 1e-05", "%11.5g", 1e-5); nerrors += Verify(__FILE__, __LINE__, " 0.0001", "%11.5g", 1e-4); nerrors += Verify(__FILE__, __LINE__, " 0.001", "%11.5g", 1e-3); nerrors += Verify(__FILE__, __LINE__, " 0.01", "%11.5g", 1e-2); nerrors += Verify(__FILE__, __LINE__, " 0.1", "%11.5g", 1e-1); nerrors += Verify(__FILE__, __LINE__, " 1", "%11.5g", 1e0); nerrors += Verify(__FILE__, __LINE__, " 10", "%11.5g", 1e1); nerrors += Verify(__FILE__, __LINE__, " 100", "%11.5g", 1e2); nerrors += Verify(__FILE__, __LINE__, " 1000", "%11.5g", 1e3); nerrors += Verify(__FILE__, __LINE__, " 10000", "%11.5g", 1e4); nerrors += Verify(__FILE__, __LINE__, " 1e+05", "%11.5g", 1e5); nerrors += Verify(__FILE__, __LINE__, " 9.9e-05", "%11.2g", 0.99e-4); nerrors += Verify(__FILE__, __LINE__, " 0.00099", "%11.2g", 0.99e-3); nerrors += Verify(__FILE__, __LINE__, " 0.0099", "%11.2g", 0.99e-2); nerrors += Verify(__FILE__, __LINE__, " 0.099", "%11.2g", 0.99e-1); nerrors += Verify(__FILE__, __LINE__, " 0.99", "%11.2g", 0.99e0); nerrors += Verify(__FILE__, __LINE__, " 9.9", "%11.2g", 0.99e1); nerrors += Verify(__FILE__, __LINE__, " 99", "%11.2g", 0.99e2); nerrors += Verify(__FILE__, __LINE__, " 9.9e+02", "%11.2g", 0.99e3); nerrors += Verify(__FILE__, __LINE__, " 9.9e+03", "%11.2g", 0.99e4); nerrors += Verify(__FILE__, __LINE__, " 9.9e+04", "%11.2g", 0.99e5); /* Double width, precision, and alternative */ nerrors += Verify(__FILE__, __LINE__, " 1.0000e-05", "%#11.5g", 1e-5); nerrors += Verify(__FILE__, __LINE__, " 0.00010000", "%#11.5g", 1e-4); nerrors += Verify(__FILE__, __LINE__, " 0.0010000", "%#11.5g", 1e-3); nerrors += Verify(__FILE__, __LINE__, " 0.010000", "%#11.5g", 1e-2); nerrors += Verify(__FILE__, __LINE__, " 0.10000", "%#11.5g", 1e-1); nerrors += Verify(__FILE__, __LINE__, " 1.0000", "%#11.5g", 1e0); nerrors += Verify(__FILE__, __LINE__, " 10.000", "%#11.5g", 1e1); nerrors += Verify(__FILE__, __LINE__, " 100.00", "%#11.5g", 1e2); nerrors += Verify(__FILE__, __LINE__, " 1000.0", "%#11.5g", 1e3); nerrors += Verify(__FILE__, __LINE__, " 10000.", "%#11.5g", 1e4); nerrors += Verify(__FILE__, __LINE__, " 1.0000e+05", "%#11.5g", 1e5); nerrors += Verify(__FILE__, __LINE__, " 9.9e-05", "%#11.2g", 0.99e-4); nerrors += Verify(__FILE__, __LINE__, " 0.00099", "%#11.2g", 0.99e-3); nerrors += Verify(__FILE__, __LINE__, " 0.0099", "%#11.2g", 0.99e-2); nerrors += Verify(__FILE__, __LINE__, " 0.099", "%#11.2g", 0.99e-1); nerrors += Verify(__FILE__, __LINE__, " 0.99", "%#11.2g", 0.99e0); nerrors += Verify(__FILE__, __LINE__, " 9.9", "%#11.2g", 0.99e1); nerrors += Verify(__FILE__, __LINE__, " 99.", "%#11.2g", 0.99e2); nerrors += Verify(__FILE__, __LINE__, " 9.9e+02", "%#11.2g", 0.99e3); nerrors += Verify(__FILE__, __LINE__, " 9.9e+03", "%#11.2g", 0.99e4); nerrors += Verify(__FILE__, __LINE__, " 9.9e+04", "%#11.2g", 0.99e5); /* Double width, precision, and zero padding */ nerrors += Verify(__FILE__, __LINE__, "00003.141500e+03", "%016e", 3141.5); nerrors += Verify(__FILE__, __LINE__, " 3.141500e+03", "%16e", 3141.5); nerrors += Verify(__FILE__, __LINE__, "3.141500e+03 ", "%-16e", 3141.5); nerrors += Verify(__FILE__, __LINE__, "03.142e+03", "%010.3e", 3141.5); #if !defined(TRIO_COMPILER_ANCIENT) /* Long double */ nerrors += Verify(__FILE__, __LINE__, "1.400000", "%Lf", 1.4L); #endif /* Special cases */ nerrors += Verify(__FILE__, __LINE__, "1.00", "%.2f", 0.999); nerrors += Verify(__FILE__, __LINE__, "100", "%.0f", 99.9); nerrors += Verify(__FILE__, __LINE__, "inf", "%f", trio_pinf()); nerrors += Verify(__FILE__, __LINE__, "-inf", "%f", trio_ninf()); nerrors += Verify(__FILE__, __LINE__, "INF", "%F", trio_pinf()); nerrors += Verify(__FILE__, __LINE__, "-INF", "%F", trio_ninf()); /* May fail if NaN is unsupported */ nerrors += Verify(__FILE__, __LINE__, "nan", "%f", trio_nan()); nerrors += Verify(__FILE__, __LINE__, "NAN", "%F", trio_nan()); #endif /* TRIO_FEATURE_FLOAT */ /* Char width alignment */ nerrors += Verify(__FILE__, __LINE__, "Char X .", "Char %-4c.", 'X'); /* String width / precision */ nerrors += Verify(__FILE__, __LINE__, " testing", "%8s", "testing"); nerrors += Verify(__FILE__, __LINE__, "testing ", "%-8s", "testing"); nerrors += Verify(__FILE__, __LINE__, " testing", "%*s", 8, "testing"); nerrors += Verify(__FILE__, __LINE__, "testing ", "%*s", -8, "testing"); nerrors += Verify(__FILE__, __LINE__, "test", "%.4s", "testing"); nerrors += Verify(__FILE__, __LINE__, "test", "%.*s", 4, "testing"); nerrors += Verify(__FILE__, __LINE__, "testing", "%.*s", -4, "testing"); #if TRIO_FEATURE_POSITIONAL /* Positional */ nerrors += Verify(__FILE__, __LINE__, "222 111", "%2$s %1$s", "111", "222"); nerrors += Verify(__FILE__, __LINE__, "123456 12345 0001234 00123", "%4$d %3$*8$d %2$.*7$d %1$*6$.*5$d", 123, 1234, 12345, 123456, 5, 6, 7, 8); #endif #if TRIO_FEATURE_SIZE_T_UPPER nerrors += Verify(__FILE__, __LINE__, "256", "%Zd", sizeof(buffer)); #endif #if TRIO_FEATURE_ERRNO errno = EINTR; nerrors += Verify(__FILE__, __LINE__, "Interrupted system call", "%m"); #endif #if TRIO_FEATURE_QUAD # if defined(TRIO_COMPILER_SUPPORTS_LL) /* This may fail if the preprocessor does not recognize LL */ nerrors += Verify(__FILE__, __LINE__, "42", "%qd", 42LL); # endif #endif #if TRIO_FEATURE_FLOAT # if TRIO_FEATURE_HEXFLOAT nerrors += Verify(__FILE__, __LINE__, "0x2.ap+4", "%a", 42.0); nerrors += Verify(__FILE__, __LINE__, "-0x2.ap+4", "%a", -42.0); nerrors += Verify(__FILE__, __LINE__, "0x1.8p+0", "%a", 1.5); nerrors += Verify(__FILE__, __LINE__, "0x1.6666666666666p+0", "%a", 1.4); nerrors += Verify(__FILE__, __LINE__, "0xc.45p+8", "%a", 3141.0); nerrors += Verify(__FILE__, __LINE__, "0XC.45P+8", "%A", 3141.0); nerrors += Verify(__FILE__, __LINE__, "0xb.351c434a98fa8p-148", "%a", 3.141e-44); # endif #endif #if TRIO_FEATURE_SIZE_T nerrors += Verify(__FILE__, __LINE__, "256", "%zd", sizeof(buffer)); #endif #if TRIO_FEATURE_PTRDIFF_T nerrors += Verify(__FILE__, __LINE__, "42", "%td", 42); #endif #if TRIO_FEATURE_INTMAX_T # if defined(TRIO_COMPILER_SUPPORTS_LL) /* Some compilers may not handle the LL suffix correctly */ nerrors += Verify(__FILE__, __LINE__, "42", "%jd", 42LL); # endif #endif #if TRIO_FEATURE_WIDECHAR nerrors += Verify(__FILE__, __LINE__, "Hello World", "%ls", L"Hello World"); nerrors += Verify(__FILE__, __LINE__, "\\aHello World", "%#ls", L"\aHello World"); nerrors += Verify(__FILE__, __LINE__, "A", "%lc", L'A'); nerrors += Verify(__FILE__, __LINE__, "\\a", "%#lc", L'\a'); #endif #if TRIO_FEATURE_FIXED_SIZE nerrors += Verify(__FILE__, __LINE__, "42", "%I8d", 42); nerrors += Verify(__FILE__, __LINE__, "ffffffff", "%I16x", -1); #endif #if TRIO_EXTENSION nerrors += Verify(__FILE__, __LINE__, " 42 86", "%!4d %d", 42, 86); nerrors += Verify(__FILE__, __LINE__, "0042 0086", "%!04d %d", 42, 86); nerrors += Verify(__FILE__, __LINE__, "42", "%&d", sizeof(long), 42L); /* Non-printable string */ nerrors += Verify(__FILE__, __LINE__, "NonPrintable \\x01 \\a \\\\", "NonPrintable %#s", "\01 \07 \\"); nerrors += Verify(__FILE__, __LINE__, "\\a \\b \\t \\n \\v \\f \\r", "%#s", "\007 \010 \011 \012 \013 \014 \015"); /* Quote flag */ nerrors += Verify(__FILE__, __LINE__, "Another \"quoted\" string", "Another %'s string", "quoted"); /* Integer base */ nerrors += Verify(__FILE__, __LINE__, "Number 42 == 1120 (base 3)", "Number %d == %..3i (base 3)", 42, 42); /* Integer base (specifier base must be used instead of base modifier) */ nerrors += Verify(__FILE__, __LINE__, "42", "%..3d", 42); nerrors += Verify(__FILE__, __LINE__, "52", "%..3o", 42); nerrors += Verify(__FILE__, __LINE__, "2a", "%..3x", 42); /* Integer thousand separator */ nerrors += Verify(__FILE__, __LINE__, "Number 100", "Number %'d", 100); nerrors += Verify(__FILE__, __LINE__, "Number 1,000,000", "Number %'d", 1000000); # if TRIO_FEATURE_FLOAT /* Float thousand separator */ nerrors += Verify(__FILE__, __LINE__, "31,415.200000", "%'f", 31415.2); nerrors += Verify(__FILE__, __LINE__, "1,000,000.000000", "%'f", 1000000.0); /* Rounding modifier */ nerrors += Verify(__FILE__, __LINE__, "1.4", "%.32Rf", 1.4); nerrors += Verify(__FILE__, __LINE__, "1.4", "%.17Rf", 1.4); nerrors += Verify(__FILE__, __LINE__, "39413.8", "%.30Rf", 39413.80); # if !defined(TRIO_COMPILER_ANCIENT) /* Long double */ nerrors += Verify(__FILE__, __LINE__, "1.4", "%RLf", 1.4L); nerrors += Verify(__FILE__, __LINE__, "1.4", "%.30RLf", 1.4L); # endif # endif #endif #if defined(TRIO_BREESE) /* * These results depends on issues beyond our control. For example, * the accuracy of floating-point numbers depends on the underlying * floating-point hardware (e.g. whether IEEE 754 double or extended- * double format is used). * * These tests are therefore not part of the normal regression test, * but we keep them here for development purposes. */ nerrors += Verify(__FILE__, __LINE__, "123456789012345680868.000000", "%f", 1.234567890123456789e20); nerrors += Verify(__FILE__, __LINE__, "1.23456789012345677901e-20", "%.20e", 1.2345678901234567e-20); nerrors += Verify(__FILE__, __LINE__, "0.666666666666666629659233", "%.*g", DBL_DIG + 10, 2.0/3.0); nerrors += Verify(__FILE__, __LINE__, "123456789012345700000", "%Rf", 1.234567890123456789e20); # if !defined(TRIO_COMPILER_ANCIENT) nerrors += Verify(__FILE__, __LINE__, "0.666666666666666667", "%RLf", (2.0L/3.0L)); nerrors += Verify(__FILE__, __LINE__, "0.666666666666666667", "%.30RLf", (2.0L/3.0L)); # endif #endif return nerrors; } /************************************************************************* * */ int VerifyErrors(TRIO_NOARGS) { char buffer[512]; int rc; int nerrors = 0; /* Error: Invalid argument 1 */ rc = trio_snprintf(buffer, sizeof(buffer), "%d %r", 42, "text"); #if TRIO_FEATURE_ERRORCODE # if TRIO_FEATURE_STRERR trio_snprintf(buffer, sizeof(buffer), "Err = %d (%s), Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_NAME(rc), TRIO_ERROR_POSITION(rc)); nerrors += Verify(__FILE__, __LINE__, "Err = 2 (Invalid argument), Pos = 5", "%s", buffer); # else trio_snprintf(buffer, sizeof(buffer), "Err = %d, Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_POSITION(rc)); nerrors += Verify(__FILE__, __LINE__, "Err = 2, Pos = 5", "%s", buffer); # endif #else nerrors += (rc != -1); #endif /* Error: Invalid argument 2 */ rc = trio_snprintf(buffer, sizeof(buffer), "%#"); #if TRIO_FEATURE_ERRORCODE # if TRIO_FEATRUE_STRERR trio_snprintf(buffer, sizeof(buffer), "Err = %d (%s), Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_NAME(rc), TRIO_ERROR_POSITION(rc)); nerrors += Verify(__FILE__, __LINE__, "Err = 2 (Invalid argument), Pos = 3", "%s", buffer); # else trio_snprintf(buffer, sizeof(buffer), "Err = %d, Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_POSITION(rc)); nerrors += Verify(__FILE__, __LINE__, "Err = 2, Pos = 3", "%s", buffer); # endif #else nerrors += (rc != -1); #endif /* Error: Invalid argument 3 */ rc = trio_snprintf(buffer, sizeof(buffer), "%hhhd", 42); #if TRIO_FEATURE_ERRORCODE # if TRIO_FEATRUE_STRERR trio_snprintf(buffer, sizeof(buffer), "Err = %d (%s), Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_NAME(rc), TRIO_ERROR_POSITION(rc)); nerrors += Verify(__FILE__, __LINE__, "Err = 2 (Invalid argument), Pos = 4", "%s", buffer); # else trio_snprintf(buffer, sizeof(buffer), "Err = %d, Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_POSITION(rc)); nerrors += Verify(__FILE__, __LINE__, "Err = 2, Pos = 4", "%s", buffer); # endif #else nerrors += (rc != -1); #endif /* Error: Double reference */ rc = trio_snprintf(buffer, sizeof(buffer), "hello %1$d %1$d", 31, 32); #if TRIO_FEATURE_ERRORCODE # if TRIO_FEATRUE_STRERR trio_snprintf(buffer, sizeof(buffer), "Err = %d (%s), Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_NAME(rc), TRIO_ERROR_POSITION(rc)); # if TRIO_UNIX98 nerrors += Verify(__FILE__, __LINE__, "Err = 4 (Double reference), Pos = 0", "%s", buffer); # else nerrors += Verify(__FILE__, __LINE__, "Err = 2 (Invalid argument), Pos = 9", "%s", buffer); # endif # else trio_snprintf(buffer, sizeof(buffer), "Err = %d, Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_POSITION(rc)); # if TRIO_UNIX98 nerrors += Verify(__FILE__, __LINE__, "Err = 4, Pos = 0", "%s", buffer); # else nerrors += Verify(__FILE__, __LINE__, "Err = 2, Pos = 9", "%s", buffer); # endif # endif #else nerrors += (rc != -1); #endif /* Error: Reference gap */ rc = trio_snprintf(buffer, sizeof(buffer), "%3$d %1$d", 31, 32, 33); #if TRIO_FEATURE_ERRORCODE # if TRIO_FEATRUE_STRERR trio_snprintf(buffer, sizeof(buffer), "Err = %d (%s), Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_NAME(rc), TRIO_ERROR_POSITION(rc)); # if TRIO_UNIX98 nerrors += Verify(__FILE__, __LINE__, "Err = 5 (Reference gap), Pos = 1", "%s", buffer); # else nerrors += Verify(__FILE__, __LINE__, "Err = 2 (Invalid argument), Pos = 3", "%s", buffer); # endif # else trio_snprintf(buffer, sizeof(buffer), "Err = %d, Pos = %d", TRIO_ERROR_CODE(rc), TRIO_ERROR_POSITION(rc)); # if TRIO_UNIX98 nerrors += Verify(__FILE__, __LINE__, "Err = 5, Pos = 1", "%s", buffer); # else nerrors += Verify(__FILE__, __LINE__, "Err = 2, Pos = 3", "%s", buffer); # endif # endif #else nerrors += (rc != -1); #endif return nerrors; } /************************************************************************* * */ #if TRIO_FEATURE_SCANF int VerifyScanningOneInteger TRIO_ARGS5((file, line, expected, format, original), TRIO_CONST char *file, int line, TRIO_CONST char *expected, TRIO_CONST char *format, int original) { int number; char data[512]; trio_snprintf(data, sizeof(data), format, original); trio_sscanf(data, format, &number); return Verify(file, line, expected, format, number); } int VerifyScanningIntegers(TRIO_NOARGS) { int nerrors = 0; nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "42", "%i", 42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "42", "%d", 42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "-42", "%d", -42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "2147483647", "%d", 2147483647); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "42", "%u", 42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "2a", "%x", 42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "52", "%o", 42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "101010", "%..2i", 42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "0x2a", "%#x", 42); nerrors += VerifyScanningOneInteger(__FILE__, __LINE__, "052", "%#o", 42); return nerrors; } #endif /************************************************************************* * */ #if TRIO_FEATURE_SCANF int VerifyScanningOneFloat TRIO_ARGS5((file, line, expected, format, original), TRIO_CONST char *file, int line, TRIO_CONST char *expected, TRIO_CONST char *format, double original) { double number; char data[512]; trio_snprintf(data, sizeof(data), format, original); trio_sscanf(data, format, &number); return Verify(file, line, expected, format, number); } int VerifyScanningFloats(TRIO_NOARGS) { int nerrors = 0; #if TRIO_FEATURE_FLOAT nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "42.000000", "%f", 42.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "-42.000000", "%f", -42.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "4.200000e+01", "%e", 42.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "4.200000E+01", "%E", 42.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "42", "%g", 42.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.23457e+06", "%g", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.23457e-06", "%g", 1.234567e-6); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.23457E+06", "%G", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.234567e+06", "%12e", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.234500e+00", "%6e", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.234567e+06", "%.6e", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.2345670000e+06", "%.10e", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.23457e+06", "%.6g", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1234567", "%.10g", 1234567.0); # if TRIO_FEATURE_HEXFLOAT nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "0x2.ap+4", "%a", 42.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "0x1.2d687p+20", "%a", 1234567.0); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "0X1.2D687P+20", "%A", 1234567.0); # endif nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "1.79769e+308", "%g", 1.79769e+308); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "nan", "%f", trio_nan()); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "NAN", "%F", trio_nan()); nerrors += VerifyScanningOneFloat(__FILE__, __LINE__, "-inf", "%f", trio_ninf()); #endif return nerrors; } #endif /************************************************************************* * */ #if TRIO_FEATURE_SCANF int VerifyScanningOneString TRIO_ARGS5((file, line, expected, format, original), TRIO_CONST char *file, int line, TRIO_CONST char *expected, TRIO_CONST char *format, char *original) { char string[512]; char data[512]; trio_snprintf(data, sizeof(data), "%s", original); trio_sscanf(data, format, string); return Verify(file, line, expected, "%s", string); } int VerifyScanningStrings(TRIO_NOARGS) { int nerrors = 0; nerrors += VerifyScanningOneString(__FILE__, __LINE__, "hello", "%s", "hello"); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "hello", "%s", "hello world"); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "hello world", "%[^\n]", "hello world"); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "(nil)", "%s", NULL); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "hello", "%20s", "hello"); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "he", "%2s", "hello"); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "ab", "%[ab]", "abcba"); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "abcba", "%[abc]", "abcba"); nerrors += VerifyScanningOneString(__FILE__, __LINE__, "abcba", "%[a-c]", "abcba"); #if TRIO_EXTENSION nerrors += VerifyScanningOneString(__FILE__, __LINE__, "abcba", "%[[:alpha:]]", "abcba"); #endif nerrors += VerifyScanningOneString(__FILE__, __LINE__, "ba", "%*[ab]c%[^\n]", "abcba"); return nerrors; } #endif /************************************************************************* * */ #if TRIO_FEATURE_SCANF int VerifyScanningRegression(TRIO_NOARGS) { int nerrors = 0; int rc; #if TRIO_FEATURE_FLOAT int index; double dnumber; # if defined(TRIO_BREESE) trio_long_double_t ldnumber; # endif #endif long lnumber; int number; char ch; #if TRIO_FEATURE_FLOAT rc = trio_sscanf("1.5", "%lf%n", &dnumber, &index); nerrors += Verify(__FILE__, __LINE__, "1 3 1.500000", "%d %d %f", rc, index, dnumber); #endif rc = trio_sscanf("q 123", "%c%ld", &ch, &lnumber); nerrors += Verify(__FILE__, __LINE__, "q 123", "%c %ld", ch, lnumber); rc = trio_sscanf("abc", "%*s%n", &number); nerrors += Verify(__FILE__, __LINE__, "0 3", "%d %d", rc, number); rc = trio_sscanf("abc def", "%*s%n", &number); nerrors += Verify(__FILE__, __LINE__, "0 3", "%d %d", rc, number); #if TRIO_FEATURE_FLOAT rc = trio_sscanf("0.141882295971771490", "%lf", &dnumber); /* FIXME: Verify */ #endif number = 33; rc = trio_sscanf("total 1", "total %d", &number); nerrors += Verify(__FILE__, __LINE__, "1 1", "%d %d", rc, number); #if defined(TRIO_BREESE) # if TRIO_FEATURE_FLOAT nerrors += Verify(__FILE__, __LINE__, "1 0.141882295971771488", "%d %.18f", rc, dnumber); rc = trio_sscanf("0.141882295971771490", "%Lf", &ldnumber); nerrors += Verify(__FILE__, __LINE__, "1 0.141882295971771490", "%d %.18Lf", rc, ldnumber); # endif #endif #if TRIO_FEATURE_FLOAT rc = trio_sscanf("1.e-6", "%g", &dnumber); nerrors += Verify(__FILE__, __LINE__, "1e-06", "%g", dnumber); rc = trio_sscanf("1e-6", "%g", &dnumber); nerrors += Verify(__FILE__, __LINE__, "1e-06", "%g", dnumber); #endif return nerrors; } #endif /************************************************************************* * */ int VerifyScanning(TRIO_NOARGS) { int nerrors = 0; #if TRIO_FEATURE_SCANF nerrors += VerifyScanningIntegers(); nerrors += VerifyScanningFloats(); nerrors += VerifyScanningStrings(); nerrors += VerifyScanningRegression(); #endif return nerrors; } /************************************************************************* * */ int VerifyStrings(TRIO_NOARGS) { int nerrors = 0; #if !defined(TRIO_MINIMAL) char buffer[512]; #if TRIO_FEATURE_FLOAT double dnumber; float fnumber; #endif char *end; /* Comparison */ trio_copy(buffer, "Find me now"); if (trio_length(buffer) != sizeof("Find me now") - 1) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_equal(buffer, "Find me now")) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_equal_case(buffer, "Find me now")) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_equal_case(buffer, "FIND ME NOW")) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_equal_max(buffer, sizeof("Find me") - 1, "Find ME")) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_contains(buffer, "me")) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_contains(buffer, "and me")) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_substring(buffer, "me") == NULL) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_substring_max(buffer, 4, "me") != NULL) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_match(buffer, "* me *")) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_match_case(buffer, "* ME *")) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_index(buffer, 'n') == NULL) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_index(buffer, '_') != NULL) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_index_last(buffer, 'n') == NULL) { nerrors++; Report0(__FILE__, __LINE__); } /* Append */ trio_copy(buffer, "Find me now"); if (!trio_append(buffer, " and again")) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_equal(buffer, "Find me now and again")) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_append_max(buffer, 0, "should not appear")) { nerrors++; Report0(__FILE__, __LINE__); } if (!trio_equal(buffer, "Find me now and again")) { nerrors++; Report0(__FILE__, __LINE__); } /* To upper/lower */ trio_copy(buffer, "Find me now"); trio_upper(buffer); if (!trio_equal_case(buffer, "FIND ME NOW")) { nerrors++; Report0(__FILE__, __LINE__); } trio_lower(buffer); if (!trio_equal_case(buffer, "find me now")) { nerrors++; Report0(__FILE__, __LINE__); } #if TRIO_FEATURE_FLOAT /* Double conversion */ trio_copy(buffer, "3.1415"); dnumber = trio_to_double(buffer, NULL); if (!DOUBLE_EQUAL(dnumber, 3.1415)) { nerrors++; Report0(__FILE__, __LINE__); } fnumber = trio_to_float(buffer, NULL); if (!FLOAT_EQUAL(fnumber, 3.1415)) { nerrors++; Report0(__FILE__, __LINE__); } #endif /* Long conversion */ trio_copy(buffer, "3.1415"); if (trio_to_long(buffer, NULL, 10) != 3L) { nerrors++; Report0(__FILE__, __LINE__); } if (trio_to_long(buffer, NULL, 4) != 3L) { nerrors++; Report0(__FILE__, __LINE__); } trio_to_long(buffer, &end, 2); if (end != buffer) { nerrors++; Report0(__FILE__, __LINE__); } #endif /* !defined(TRIO_MINIMAL) */ return nerrors; } /************************************************************************* * */ int VerifyDynamicStrings(TRIO_NOARGS) { int nerrors = 0; #if !defined(TRIO_MINIMAL) trio_string_t *string; string = trio_xstring_duplicate("Find me now"); if (string == NULL) { nerrors++; goto error; } if (!trio_xstring_equal(string, "FIND ME NOW")) nerrors++; if (!trio_xstring_append(string, " and again") || !trio_xstring_equal(string, "FIND ME NOW AND AGAIN")) nerrors++; if (!trio_xstring_contains(string, "me")) nerrors++; if (trio_xstring_contains(string, "ME")) nerrors++; if (!trio_xstring_match(string, "* me *")) nerrors++; if (trio_xstring_match_case(string, "* ME *")) nerrors++; error: if (string) trio_string_destroy(string); #endif /* !defined(TRIO_MINIMAL) */ return nerrors; } /************************************************************************* * */ int VerifyNaN(TRIO_NOARGS) { double ninf_number = trio_ninf(); double pinf_number = trio_pinf(); double nan_number = trio_nan(); int nerrors = 0; nerrors += Verify(__FILE__, __LINE__, "-1", "%d", trio_isinf(ninf_number)); nerrors += Verify(__FILE__, __LINE__, "0", "%d", trio_isinf(42.0)); nerrors += Verify(__FILE__, __LINE__, "1", "%d", trio_isinf(pinf_number)); nerrors += Verify(__FILE__, __LINE__, "1", "%d", trio_isnan(nan_number)); nerrors += Verify(__FILE__, __LINE__, "0", "%d", trio_isnan(42.0)); return nerrors; } /************************************************************************* * */ int main(TRIO_NOARGS) { int nerrors = 0; printf("%s\n", rcsid); #if TRIO_EXTENSION /* Override system locale settings */ trio_locale_set_decimal_point("."); trio_locale_set_thousand_separator(","); trio_locale_set_grouping("\3"); #endif printf("Verifying strings\n"); nerrors += VerifyStrings(); printf("Verifying dynamic strings\n"); nerrors += VerifyDynamicStrings(); printf("Verifying special quantities\n"); nerrors += VerifyNaN(); printf("Verifying formatting\n"); nerrors += VerifyFormatting(); printf("Verifying scanning\n"); nerrors += VerifyScanning(); printf("Verifying return values\n"); nerrors += VerifyErrors(); nerrors += VerifyReturnValues(); printf("Verifying allocation\n"); nerrors += VerifyAllocate(); if (nerrors == 0) printf("Regression test suceeded\n"); else printf("Regression test failed in %d instance(s)\n", nerrors); return nerrors ? 1 : 0; } bogofilter-1.2.4/trio/trio.h0000644000175000017500000001625612163572311014154 0ustar sezsez/************************************************************************* * * $Id: trio.h,v 1.17 2005/05/29 11:58:14 breese Exp $ * * Copyright (C) 1998 Bjorn Reese and Daniel Stenberg. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************* * * http://ctrio.sourceforge.net/ * ************************************************************************/ #ifndef TRIO_TRIO_H #define TRIO_TRIO_H #if !defined(WITHOUT_TRIO) /* * Use autoconf defines if present. Packages using trio must define * HAVE_CONFIG_H as a compiler option themselves. */ #if defined(HAVE_CONFIG_H) # include #endif #include "triodef.h" #include #include #if defined(TRIO_COMPILER_ANCIENT) # include #else # include #endif #ifdef __cplusplus extern "C" { #endif /* * Error codes. * * Remember to add a textual description to trio_strerror. */ enum { TRIO_EOF = 1, TRIO_EINVAL = 2, TRIO_ETOOMANY = 3, TRIO_EDBLREF = 4, TRIO_EGAP = 5, TRIO_ENOMEM = 6, TRIO_ERANGE = 7, TRIO_ERRNO = 8, TRIO_ECUSTOM = 9 }; /* Error macros */ #define TRIO_ERROR_CODE(x) ((-(x)) & 0x00FF) #define TRIO_ERROR_POSITION(x) ((-(x)) >> 8) #define TRIO_ERROR_NAME(x) trio_strerror(x) typedef int (*trio_outstream_t) TRIO_PROTO((trio_pointer_t, int)); typedef int (*trio_instream_t) TRIO_PROTO((trio_pointer_t)); TRIO_CONST char *trio_strerror TRIO_PROTO((int)); /************************************************************************* * Print Functions */ int trio_printf TRIO_PROTO((TRIO_CONST char *format, ...)); int trio_vprintf TRIO_PROTO((TRIO_CONST char *format, va_list args)); int trio_printfv TRIO_PROTO((TRIO_CONST char *format, void **args)); int trio_fprintf TRIO_PROTO((FILE *file, TRIO_CONST char *format, ...)); int trio_vfprintf TRIO_PROTO((FILE *file, TRIO_CONST char *format, va_list args)); int trio_fprintfv TRIO_PROTO((FILE *file, TRIO_CONST char *format, void **args)); int trio_dprintf TRIO_PROTO((int fd, TRIO_CONST char *format, ...)); int trio_vdprintf TRIO_PROTO((int fd, TRIO_CONST char *format, va_list args)); int trio_dprintfv TRIO_PROTO((int fd, TRIO_CONST char *format, void **args)); int trio_cprintf TRIO_PROTO((trio_outstream_t stream, trio_pointer_t closure, TRIO_CONST char *format, ...)); int trio_vcprintf TRIO_PROTO((trio_outstream_t stream, trio_pointer_t closure, TRIO_CONST char *format, va_list args)); int trio_cprintfv TRIO_PROTO((trio_outstream_t stream, trio_pointer_t closure, TRIO_CONST char *format, void **args)); int trio_sprintf TRIO_PROTO((char *buffer, TRIO_CONST char *format, ...)); int trio_vsprintf TRIO_PROTO((char *buffer, TRIO_CONST char *format, va_list args)); int trio_sprintfv TRIO_PROTO((char *buffer, TRIO_CONST char *format, void **args)); int trio_snprintf TRIO_PROTO((char *buffer, size_t max, TRIO_CONST char *format, ...)); int trio_vsnprintf TRIO_PROTO((char *buffer, size_t bufferSize, TRIO_CONST char *format, va_list args)); int trio_snprintfv TRIO_PROTO((char *buffer, size_t bufferSize, TRIO_CONST char *format, void **args)); int trio_snprintfcat TRIO_PROTO((char *buffer, size_t max, TRIO_CONST char *format, ...)); int trio_vsnprintfcat TRIO_PROTO((char *buffer, size_t bufferSize, TRIO_CONST char *format, va_list args)); char *trio_aprintf TRIO_PROTO((TRIO_CONST char *format, ...)); char *trio_vaprintf TRIO_PROTO((TRIO_CONST char *format, va_list args)); int trio_asprintf TRIO_PROTO((char **ret, TRIO_CONST char *format, ...)); int trio_vasprintf TRIO_PROTO((char **ret, TRIO_CONST char *format, va_list args)); int trio_asprintfv TRIO_PROTO((char **result, TRIO_CONST char *format, trio_pointer_t * args)); /************************************************************************* * Scan Functions */ int trio_scanf TRIO_PROTO((TRIO_CONST char *format, ...)); int trio_vscanf TRIO_PROTO((TRIO_CONST char *format, va_list args)); int trio_scanfv TRIO_PROTO((TRIO_CONST char *format, void **args)); int trio_fscanf TRIO_PROTO((FILE *file, TRIO_CONST char *format, ...)); int trio_vfscanf TRIO_PROTO((FILE *file, TRIO_CONST char *format, va_list args)); int trio_fscanfv TRIO_PROTO((FILE *file, TRIO_CONST char *format, void **args)); int trio_dscanf TRIO_PROTO((int fd, TRIO_CONST char *format, ...)); int trio_vdscanf TRIO_PROTO((int fd, TRIO_CONST char *format, va_list args)); int trio_dscanfv TRIO_PROTO((int fd, TRIO_CONST char *format, void **args)); int trio_cscanf TRIO_PROTO((trio_instream_t stream, trio_pointer_t closure, TRIO_CONST char *format, ...)); int trio_vcscanf TRIO_PROTO((trio_instream_t stream, trio_pointer_t closure, TRIO_CONST char *format, va_list args)); int trio_cscanfv TRIO_PROTO((trio_instream_t stream, trio_pointer_t closure, TRIO_CONST char *format, void **args)); int trio_sscanf TRIO_PROTO((TRIO_CONST char *buffer, TRIO_CONST char *format, ...)); int trio_vsscanf TRIO_PROTO((TRIO_CONST char *buffer, TRIO_CONST char *format, va_list args)); int trio_sscanfv TRIO_PROTO((TRIO_CONST char *buffer, TRIO_CONST char *format, void **args)); /************************************************************************* * Locale Functions */ void trio_locale_set_decimal_point TRIO_PROTO((char *decimalPoint)); void trio_locale_set_thousand_separator TRIO_PROTO((char *thousandSeparator)); void trio_locale_set_grouping TRIO_PROTO((char *grouping)); /************************************************************************* * Renaming */ #ifdef TRIO_REPLACE_STDIO /* Replace the functions */ #ifndef HAVE_PRINTF # define printf trio_printf #endif #ifndef HAVE_VPRINTF # define vprintf trio_vprintf #endif #ifndef HAVE_FPRINTF # define fprintf trio_fprintf #endif #ifndef HAVE_VFPRINTF # define vfprintf trio_vfprintf #endif #ifndef HAVE_SPRINTF # define sprintf trio_sprintf #endif #ifndef HAVE_VSPRINTF # define vsprintf trio_vsprintf #endif #ifndef HAVE_SNPRINTF # define snprintf trio_snprintf #endif #ifndef HAVE_VSNPRINTF # define vsnprintf trio_vsnprintf #endif #ifndef HAVE_SCANF # define scanf trio_scanf #endif #ifndef HAVE_VSCANF # define vscanf trio_vscanf #endif #ifndef HAVE_FSCANF # define fscanf trio_fscanf #endif #ifndef HAVE_VFSCANF # define vfscanf trio_vfscanf #endif #ifndef HAVE_SSCANF # define sscanf trio_sscanf #endif #ifndef HAVE_VSSCANF # define vsscanf trio_vsscanf #endif /* These aren't stdio functions, but we make them look similar */ #define dprintf trio_dprintf #define vdprintf trio_vdprintf #define aprintf trio_aprintf #define vaprintf trio_vaprintf #define asprintf trio_asprintf #define vasprintf trio_vasprintf #define dscanf trio_dscanf #define vdscanf trio_vdscanf #endif #ifdef __cplusplus } /* extern "C" */ #endif #endif /* WITHOUT_TRIO */ #endif /* TRIO_TRIO_H */ bogofilter-1.2.4/trio/trionan.h0000644000175000017500000000720512163572311014643 0ustar sezsez/************************************************************************* * * $Id: trionan.h,v 1.9 2005/03/27 18:52:45 breese Exp $ * * Copyright (C) 2001 Bjorn Reese * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************/ #ifndef TRIO_TRIONAN_H #define TRIO_TRIONAN_H #include "triodef.h" #ifdef __cplusplus extern "C" { #endif #if !defined(TRIO_PUBLIC_NAN) # if !defined(TRIO_PUBLIC) # define TRIO_PUBLIC # endif # define TRIO_PUBLIC_NAN TRIO_PUBLIC #endif enum { TRIO_FP_INFINITE, TRIO_FP_NAN, TRIO_FP_NORMAL, TRIO_FP_SUBNORMAL, TRIO_FP_ZERO }; /************************************************************************* * Dependencies */ #if defined(TRIO_EMBED_NAN) /* * The application that trionan is embedded in must define which functions * it uses. * * The following resolves internal dependencies. */ # if defined(TRIO_FUNC_ISNAN) \ || defined(TRIO_FUNC_ISINF) # if !defined(TRIO_FUNC_FPCLASSIFY_AND_SIGNBIT) # define TRIO_FUNC_FPCLASSIFY_AND_SIGNBIT # endif # endif # if defined(TRIO_FUNC_NAN) # if !defined(TRIO_FUNC_PINF) # define TRIO_FUNC_PINF # endif # endif # if defined(TRIO_FUNC_NINF) # if !defined(TRIO_FUNC_PINF) # define TRIO_FUNC_PINF # endif # endif #else /* * When trionan is not embedded all all functions are defined. */ # define TRIO_FUNC_NAN # define TRIO_FUNC_PINF # define TRIO_FUNC_NINF # define TRIO_FUNC_NZERO # define TRIO_FUNC_ISNAN # define TRIO_FUNC_ISINF # define TRIO_FUNC_ISFINITE # define TRIO_FUNC_SIGNBIT # define TRIO_FUNC_FPCLASSIFY # define TRIO_FUNC_FPCLASSIFY_AND_SIGNBIT #endif /************************************************************************* * Functions */ /* * Return NaN (Not-a-Number). */ #if defined(TRIO_FUNC_NAN) TRIO_PUBLIC_NAN double trio_nan TRIO_PROTO((void)); #endif /* * Return positive infinity. */ #if defined(TRIO_FUNC_PINF) TRIO_PUBLIC_NAN double trio_pinf TRIO_PROTO((void)); #endif /* * Return negative infinity. */ #if defined(TRIO_FUNC_NINF) TRIO_PUBLIC_NAN double trio_ninf TRIO_PROTO((void)); #endif /* * Return negative zero. */ #if defined(TRIO_FUNC_NZERO) TRIO_PUBLIC_NAN double trio_nzero TRIO_PROTO((TRIO_NOARGS)); #endif /* * If number is a NaN return non-zero, otherwise return zero. */ #if defined(TRIO_FUNC_ISNAN) TRIO_PUBLIC_NAN int trio_isnan TRIO_PROTO((double number)); #endif /* * If number is positive infinity return 1, if number is negative * infinity return -1, otherwise return 0. */ #if defined(TRIO_FUNC_ISINF) TRIO_PUBLIC_NAN int trio_isinf TRIO_PROTO((double number)); #endif /* * If number is finite return non-zero, otherwise return zero. */ #if defined(TRIO_FUNC_ISFINITE) TRIO_PUBLIC_NAN int trio_isfinite TRIO_PROTO((double number)); #endif #if defined(TRIO_FUNC_SIGNBIT) TRIO_PUBLIC_NAN int trio_signbit TRIO_PROTO((double number)); #endif #if defined(TRIO_FUNC_FPCLASSIFY) TRIO_PUBLIC_NAN int trio_fpclassify TRIO_PROTO((double number)); #endif #if defined(TRIO_FUNC_FPCLASSIFY_AND_SIGNBIT) TRIO_PUBLIC_NAN int trio_fpclassify_and_signbit TRIO_PROTO((double number, int *is_negative)); #endif #ifdef __cplusplus } #endif #endif /* TRIO_TRIONAN_H */ bogofilter-1.2.4/trio/triop.h0000644000175000017500000003341312163572311014326 0ustar sezsez/************************************************************************* * * $Id: triop.h,v 1.15 2005/03/24 15:43:03 breese Exp $ * * Copyright (C) 2000 Bjorn Reese and Daniel Stenberg. * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. * ************************************************************************ * * Private functions, types, etc. used for callback functions. * * The ref pointer is an opaque type and should remain as such. * Private data must only be accessible through the getter and * setter functions. * ************************************************************************/ #ifndef TRIO_TRIOP_H #define TRIO_TRIOP_H #include "triodef.h" #include #if defined(TRIO_COMPILER_ANCIENT) # include #else # include #endif #ifdef __cplusplus extern "C" { #endif /************************************************************************* * Supported standards */ /* * TRIO_C99 (=0 or =1) * * Define this to 0 to disable C99 format specifier extensions, or * define to 1 to enable them. The format specifiers that are * disabled by this switch are labelled with [C99] in the format * specifier documentation. */ #if !defined(TRIO_C99) # define TRIO_C99 1 #endif /* * TRIO_BSD (=0 or =1) * * Define this to 0 to disable BSD format specifier extensions, or * define to 1 to enable them. The format specifiers that are * disabled by this switch are labelled with [BSD] in the format * specifier documentation. */ #if !defined(TRIO_BSD) # define TRIO_BSD 1 #endif /* * TRIO_GNU (=0 or =1) * * Define this to 0 to disable GNU format specifier extensions, or * define to 1 to enable them. The format specifiers that are * disabled by this switch are labelled with [GNU] in the format * specifier documentation. */ #if !defined(TRIO_GNU) # define TRIO_GNU 1 #endif /* * TRIO_MISC (=0 or =1) * * Define this to 0 to disable miscellaneous format specifier * extensions, or define to 1 to enable them. The format specifiers * that are disabled by this switch are labelled with [MISC] in the * format specifier documentation. */ #if !defined(TRIO_MISC) # define TRIO_MISC 1 #endif /* * TRIO_UNIX98 (=0 or =1) * * Define this to 0 to disable UNIX98 format specifier extensions, * or define to 1 to enable them. The format specifiers that are * disabled by this switch are labelled with [UNIX98] in the format * specifier documentation. */ #if !defined(TRIO_UNIX98) # define TRIO_UNIX98 1 #endif /* * TRIO_MICROSOFT (=0 or =1) * * Define this to 0 to disable Microsoft Visual C format specifier * extensions, or define to 1 to enable them. The format specifiers * that are disabled by this switch are labelled with [MSVC] in the * format specifier documentation. */ #if !defined(TRIO_MICROSOFT) # define TRIO_MICROSOFT 1 #endif /* * TRIO_EXTENSION (=0 or =1) * * Define this to 0 to disable Trio-specific extensions, or define * to 1 to enable them. This has two effects: it controls whether * or not the Trio user-defined formating mechanism * (trio_register() etc) is supported, and it enables or disables * Trio's own format specifier extensions. The format specifiers * that are disabled by this switch are labelled with [TRIO] in * the format specifier documentation. */ #if !defined(TRIO_EXTENSION) # define TRIO_EXTENSION 1 #endif /************************************************************************* * Features */ #if defined(TRIO_SNPRINTF_ONLY) # define TRIO_FEATURE_SCANF 0 # define TRIO_FEATURE_FILE 0 # define TRIO_FEATURE_STDIO 0 # define TRIO_FEATURE_FD 0 # define TRIO_FEATURE_DYNAMICSTRING 0 # define TRIO_FEATURE_CLOSURE 0 # define TRIO_FEATURE_STRERR 0 # define TRIO_FEATURE_LOCALE 0 # define TRIO_EMBED_NAN 1 # define TRIO_EMBED_STRING 1 #endif /* * TRIO_FEATURE_SCANF (=0 or =1) * * Define this to 0 to disable all the scanf() variants, or define to 1 * to enable them. */ #if !defined(TRIO_FEATURE_SCANF) # define TRIO_FEATURE_SCANF 1 #endif /* * TRIO_FEATURE_FILE (=0 or =1) * * Define this to 0 to disable compilation of the trio_fprintf() and * trio_fscanf() family of functions, or define to 1 to enable them. * * This may be useful on an embedded platform with no filesystem. * Note that trio_printf() uses fwrite to write to stdout, so if you * do not have an implementation of fwrite() at all then you must also * define TRIO_FEATURE_STDIO to 0. */ #if !defined(TRIO_FEATURE_FILE) # define TRIO_FEATURE_FILE 1 #endif /* * TRIO_FEATURE_STDIO (=0 or =1) * * Define this to 0 to disable compilation of the trio_printf() and * trio_scanf() family of functions, or define to 1 to enable them. * * This may be useful on an embedded platform with no standard I/O. */ #if !defined(TRIO_FEATURE_STDIO) # define TRIO_FEATURE_STDIO 1 #endif /* * TRIO_FEATURE_FD (=0 or =1) * * Define this to 0 to disable compilation of the trio_dprintf() and * trio_dscanf() family of functions, or define to 1 to enable them. * * This may be useful on an embedded platform with no filesystem, or on * a platform that supports file I/O using FILE* but not using raw file * descriptors. */ #if !defined(TRIO_FEATURE_FD) # define TRIO_FEATURE_FD 1 #endif /* * TRIO_FEATURE_DYNAMICSTRING (=0 or =1) * * Define this to 0 to disable compilation of the trio_aprintf() * family of functions, or define to 1 to enable them. * * If you define both this and TRIO_MINIMAL to 0, then Trio will never * call malloc or free. */ #if !defined(TRIO_FEATURE_DYNAMICSTRING) # define TRIO_FEATURE_DYNAMICSTRING 1 #endif /* * TRIO_FEATURE_CLOSURE (=0 or =1) * * Define this to 0 to disable compilation of the trio_cprintf() and * trio_cscanf() family of functions, or define to 1 to enable them. * * These functions are rarely needed. This saves a (small) amount of code. */ #if !defined(TRIO_FEATURE_CLOSURE) # define TRIO_FEATURE_CLOSURE 1 #endif /* * TRIO_FEATURE_ERRORCODE (=0 or =1) * * Define this to 0 to return -1 from the print and scan function on * error, or define to 1 to return a negative number with debugging * information as part of the return code. * * If enabled, the return code will be a negative number, which encodes * an error code and an error location. These can be decoded with the * TRIO_ERROR_CODE and TRIO_ERROR_POSITION macros. */ #if defined(TRIO_ERRORS) # define TRIO_FEATURE_ERRORCODE TRIO_ERRORS #endif #if !defined(TRIO_FEATURE_ERRORCODE) # define TRIO_FEATURE_ERRORCODE 1 #endif /* * TRIO_FEATURE_STRERR (=0 or =1) * * Define this to 0 if you do not use trio_strerror(), or define to 1 if * you do use it. * * This saves a (small) amount of code. */ #if !defined(TRIO_FEATURE_STRERR) # define TRIO_FEATURE_STRERR 1 #endif /* * TRIO_FEATURE_FLOAT (=0 or =1) * * Define this to 0 to disable all floating-point support, or define * to 1 to enable it. * * This is useful in restricted embedded platforms that do not support * floating-point. Obviously you cannot use floating-point format * specifiers if you define this. * * Do not compile trionan.c if you disable this. */ #if !defined(TRIO_FEATURE_FLOAT) # define TRIO_FEATURE_FLOAT 1 #endif /* * TRIO_FEATURE_LOCALE (=0 or =1) * * Define this to 0 to disable customized locale support, or define * to 1 to enable it. * * This saves a (small) amount of code. */ #if !defined(TRIO_FEATURE_LOCALE) # define TRIO_FEATURE_LOCALE 1 #endif /* * TRIO_MINIMAL * * Define this to disable building the public trionan.h and triostr.h. * If you define this, then you must not compile trionan.c and triostr.c * separately. */ #if defined(TRIO_MINIMAL) # if !defined(TRIO_EMBED_NAN) # define TRIO_EMBED_NAN # endif # if !defined(TRIO_EMBED_STRING) # define TRIO_EMBED_STRING # endif #endif /* Does not work yet. Do not enable */ #ifndef TRIO_FEATURE_WIDECHAR # define TRIO_FEATURE_WIDECHAR 0 #endif /************************************************************************* * Mapping standards to internal features */ #if !defined(TRIO_FEATURE_HEXFLOAT) # define TRIO_FEATURE_HEXFLOAT (TRIO_C99 && TRIO_FEATURE_FLOAT) #endif #if !defined(TRIO_FEATURE_LONGDOUBLE) # define TRIO_FEATURE_LONGDOUBLE TRIO_FEATURE_FLOAT #endif #if !defined(TRIO_FEATURE_ERRNO) # define TRIO_FEATURE_ERRNO TRIO_GNU #endif #if !defined(TRIO_FEATURE_QUAD) # define TRIO_FEATURE_QUAD (TRIO_BSD || TRIO_GNU) #endif #if !defined(TRIO_FEATURE_SIZE_T) # define TRIO_FEATURE_SIZE_T TRIO_C99 #endif #if !defined(TRIO_FEATURE_SIZE_T_UPPER) # define TRIO_FEATURE_SIZE_T_UPPER TRIO_GNU #endif #if !defined(TRIO_FEATURE_PTRDIFF_T) # define TRIO_FEATURE_PTRDIFF_T TRIO_C99 #endif #if !defined(TRIO_FEATURE_INTMAX_T) # define TRIO_FEATURE_INTMAX_T TRIO_C99 #endif #if !defined(TRIO_FEATURE_FIXED_SIZE) # define TRIO_FEATURE_FIXED_SIZE TRIO_MICROSOFT #endif #if !defined(TRIO_FEATURE_POSITIONAL) # define TRIO_FEATURE_POSITIONAL TRIO_UNIX98 #endif #if !defined(TRIO_FEATURE_USER_DEFINED) # define TRIO_FEATURE_USER_DEFINED TRIO_EXTENSION #endif #if !defined(TRIO_FEATURE_BINARY) # define TRIO_FEATURE_BINARY TRIO_EXTENSION #endif #if !defined(TRIO_FEATURE_QUOTE) # define TRIO_FEATURE_QUOTE TRIO_EXTENSION #endif #if !defined(TRIO_FEATURE_STICKY) # define TRIO_FEATURE_STICKY TRIO_EXTENSION #endif #if !defined(TRIO_FEATURE_VARSIZE) # define TRIO_FEATURE_VARSIZE TRIO_EXTENSION #endif #if !defined(TRIO_FEATURE_ROUNDING) # define TRIO_FEATURE_ROUNDING TRIO_EXTENSION #endif /************************************************************************* * Memory handling */ #ifndef TRIO_MALLOC # define TRIO_MALLOC(n) malloc(n) #endif #ifndef TRIO_REALLOC # define TRIO_REALLOC(x,n) realloc((x),(n)) #endif #ifndef TRIO_FREE # define TRIO_FREE(x) free(x) #endif /************************************************************************* * User-defined specifiers */ typedef int (*trio_callback_t) TRIO_PROTO((trio_pointer_t)); trio_pointer_t trio_register TRIO_PROTO((trio_callback_t callback, const char *name)); void trio_unregister TRIO_PROTO((trio_pointer_t handle)); TRIO_CONST char *trio_get_format TRIO_PROTO((trio_pointer_t ref)); trio_pointer_t trio_get_argument TRIO_PROTO((trio_pointer_t ref)); /* Modifiers */ int trio_get_width TRIO_PROTO((trio_pointer_t ref)); void trio_set_width TRIO_PROTO((trio_pointer_t ref, int width)); int trio_get_precision TRIO_PROTO((trio_pointer_t ref)); void trio_set_precision TRIO_PROTO((trio_pointer_t ref, int precision)); int trio_get_base TRIO_PROTO((trio_pointer_t ref)); void trio_set_base TRIO_PROTO((trio_pointer_t ref, int base)); int trio_get_padding TRIO_PROTO((trio_pointer_t ref)); void trio_set_padding TRIO_PROTO((trio_pointer_t ref, int is_padding)); int trio_get_short TRIO_PROTO((trio_pointer_t ref)); /* h */ void trio_set_shortshort TRIO_PROTO((trio_pointer_t ref, int is_shortshort)); int trio_get_shortshort TRIO_PROTO((trio_pointer_t ref)); /* hh */ void trio_set_short TRIO_PROTO((trio_pointer_t ref, int is_short)); int trio_get_long TRIO_PROTO((trio_pointer_t ref)); /* l */ void trio_set_long TRIO_PROTO((trio_pointer_t ref, int is_long)); int trio_get_longlong TRIO_PROTO((trio_pointer_t ref)); /* ll */ void trio_set_longlong TRIO_PROTO((trio_pointer_t ref, int is_longlong)); int trio_get_longdouble TRIO_PROTO((trio_pointer_t ref)); /* L */ void trio_set_longdouble TRIO_PROTO((trio_pointer_t ref, int is_longdouble)); int trio_get_alternative TRIO_PROTO((trio_pointer_t ref)); /* # */ void trio_set_alternative TRIO_PROTO((trio_pointer_t ref, int is_alternative)); int trio_get_alignment TRIO_PROTO((trio_pointer_t ref)); /* - */ void trio_set_alignment TRIO_PROTO((trio_pointer_t ref, int is_leftaligned)); int trio_get_spacing TRIO_PROTO((trio_pointer_t ref)); /* TRIO_PROTO((space) */ void trio_set_spacing TRIO_PROTO((trio_pointer_t ref, int is_space)); int trio_get_sign TRIO_PROTO((trio_pointer_t ref)); /* + */ void trio_set_sign TRIO_PROTO((trio_pointer_t ref, int is_showsign)); #if TRIO_FEATURE_QUOTE int trio_get_quote TRIO_PROTO((trio_pointer_t ref)); /* ' */ void trio_set_quote TRIO_PROTO((trio_pointer_t ref, int is_quote)); #endif int trio_get_upper TRIO_PROTO((trio_pointer_t ref)); void trio_set_upper TRIO_PROTO((trio_pointer_t ref, int is_upper)); #if TRIO_FEATURE_INTMAX_T int trio_get_largest TRIO_PROTO((trio_pointer_t ref)); /* j */ void trio_set_largest TRIO_PROTO((trio_pointer_t ref, int is_largest)); #endif #if TRIO_FEATURE_PTRDIFF_T int trio_get_ptrdiff TRIO_PROTO((trio_pointer_t ref)); /* t */ void trio_set_ptrdiff TRIO_PROTO((trio_pointer_t ref, int is_ptrdiff)); #endif #if TRIO_FEATURE_SIZE_T int trio_get_size TRIO_PROTO((trio_pointer_t ref)); /* z / Z */ void trio_set_size TRIO_PROTO((trio_pointer_t ref, int is_size)); #endif /* Printing */ int trio_print_ref TRIO_PROTO((trio_pointer_t ref, const char *format, ...)); int trio_vprint_ref TRIO_PROTO((trio_pointer_t ref, const char *format, va_list args)); int trio_printv_ref TRIO_PROTO((trio_pointer_t ref, const char *format, trio_pointer_t *args)); void trio_print_int TRIO_PROTO((trio_pointer_t ref, int number)); void trio_print_uint TRIO_PROTO((trio_pointer_t ref, unsigned int number)); /* void trio_print_long TRIO_PROTO((trio_pointer_t ref, long number)); */ /* void trio_print_ulong TRIO_PROTO((trio_pointer_t ref, unsigned long number)); */ void trio_print_double TRIO_PROTO((trio_pointer_t ref, double number)); void trio_print_string TRIO_PROTO((trio_pointer_t ref, char *string)); void trio_print_pointer TRIO_PROTO((trio_pointer_t ref, trio_pointer_t pointer)); #ifdef __cplusplus } /* extern "C" */ #endif #endif /* TRIO_TRIOP_H */ bogofilter-1.2.4/COPYING0000644000175000017500000004363212163572311013102 0ustar sezsezNOTE: the remainder of this file contains the GNU GENERAL PUBLIC LICENSE version 2, which does not apply to all parts of bogofilter. Other parts may be under different licenses, such as the GNU GENERAL PUBLIC LICENSE v3 (which should be in the file gpl-3.0.txt). ------------------------------------------------------------------------ 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) 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) year 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. bogofilter-1.2.4/gpl-3.0.txt0000644000175000017500000010451312163572305013667 0ustar sezsez GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. 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 them 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 prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. 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. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey 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; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If 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 convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU 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 that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. 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. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 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. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. 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 state 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 program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program 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, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU 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 Lesser General Public License instead of this License. But first, please read . bogofilter-1.2.4/install-staticdblibs.sh0000755000175000017500000001332712163572264016526 0ustar sezsez#! /bin/sh # install-staticdblibs.sh -- shell script to fetch, build and install # the static libraries bogofilter links against, # to ease building of portable RPMs. # (C) Copyright 2005 - 2009 Matthias Andree # # This program is free software: you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation, either version 3 of the License, or (at # your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program. If not, see . # this script requires these in the PATH: # --------------------------------------- # sudo - must be configured properly for the user running this script # wget or curl - must be installed # md5sum or md5 - must be installed # gunzip - must be installed # tar - must be installed # make - must be installed # this script will: # ----------------- # download 6 MB from the network # require 44 MB in /var/tmp # require 3 MB in /opt # _fetch_xxx URL _fetch_curl() { curl -q -s -S -L -O "$1" } _fetch_wget() { wget -nc -nv "$1" } # fetch URL # fetch a file with curl or wget fetch() { if command -v >/dev/null 2>&1 curl ; then _fetch_curl "$@" else _fetch_wget "$@" fi } # _md5_file FILE # check MD5 sum of a single file _md5_file() { if command -v >/dev/null 2>&1 md5sum then md5sum "$1" | cut -f1 -d" " else if command -v >/dev/null 2>&1 md5 then md5 -q "$1" else echo >&2 "Cannot calculate md5 hash, no program found." exit 1 fi fi } # fetch file and check MD5 sum want() { f=${1##*/} if test ! -f ${f} || test "$(_md5_file ${f})" != "$2" ; then rm -f ${f} echo "fetching $1 -> ${f}" fetch "$1" else echo "${f} was already downloaded, reusing it" fi if test "$(_md5_file ${1##*/})" = "$2" ; then echo "${f} MD5 checksum OK" else echo "${f} MD5 checksum FAIL, aborting." >&2 exit 1 fi } set -e cat <<'_EOF' --------------------------------------------------------------------- install-staticdblibs.sh Copyright (C) 2005 - 2009 Matthias Andree This program comes with ABSOLUTELY NO WARRANTY. This is free software, and you are welcome to redistribute it under certain conditions. Read the accompanying file gpl-3.0.txt for details. --------------------------------------------------------------------- _EOF cd ${TMPDIR:=/var/tmp} dbdir=db-4.2.52 dbpfx=/opt/db-4.2-lean sqfil=sqlite-amalgamation-3.6.7.tar.gz sqdir=sqlite-3.6.7 sqpfx=/opt/sqlite-3-lean ### download SleepyCat DB 4.2.52 and patches source=oracle.com build_db=0 dbpatches="1 2 3 4 5" checklib=$dbpfx/lib/libdb.a if test ! -f $checklib ; then case $source in oracle.com) URL1=http://download.oracle.com/berkeley-db URL2=http://www.oracle.com/technology/products/berkeley-db/db/ want $URL1/db-4.2.52.tar.gz 8b5cff6eb83972afdd8e0b821703c33c want $URL2/update/4.2.52/patch.4.2.52.1 1227f5f9ff43d48b5b1759e113a1c2d7 want $URL2/update/4.2.52/patch.4.2.52.2 3da7efd8d29919a9113e2f6f5166f5b7 want $URL2/update/4.2.52/patch.4.2.52.3 0bf9ebbe852652bed433e522928d40ec want $URL2/update/4.2.52/patch.4.2.52.4 9cfeff4dce0c11372c0b04b134f8faef want $URL2/update/4.2.52/patch.4.2.52.5 99836f962361da8936219cc193edc7ed ;; esac build_db=1 else echo "$checklib already exists, not building Berkeley DB." fi ### download SQLite 3.6.7 # Info: the objdump test fixes up the effects of a bug # in an earlier version of this script, which built # a sqlite 3.2.8 version that required GLIBC_2.3. source=sqlite.org build_sqlite=0 checklib=$sqpfx/lib/libsqlite3.a if test ! -f $checklib || \ objdump -t /opt/sqlite-3-lean/lib/libsqlite3.a \ | grep -q __ctype_b_loc ; then case $source in sqlite.org) URL=http://www.sqlite.org ;; bogofilter.org) URL=ftp://ftp.bogofilter.org/pub/outgoing/tools/SQLite ;; esac want $URL/$sqfil a2f569b0b100e70e9e043e0158f11861 build_sqlite=1 else echo "$checklib already exists, not building SQLite3." fi # build DB 4.2 if test $build_db = 1 ; then rm -rf $dbdir gunzip -c -d $dbdir.tar.gz | tar xf - for N in $dbpatches ; do if [ -f patch.4.2.52.$N ] ; then patch -s -d $dbdir -p0 /dev/null rm -rf $dbdir fi # build SQLite 3 if test $build_sqlite = 1 ; then rm -rf build-$sqdir $sqdir gunzip -cd $sqfil | tar xf - set -e echo "installing $sqdir" mkdir -p build-$sqdir cd build-$sqdir env CFLAGS="-O2 -D__NO_CTYPE" ../$sqdir/configure \ --prefix=$sqpfx --silent \ --disable-shared \ --disable-threadsafe make -s sudo make -s install # fix permissions: sudo chown -R 0:0 $sqpfx sudo chmod -R a-w $sqpfx echo "$sqdir was installed into $sqpfx" cd - >/dev/null rm -rf build-$sqdir $sqdir fi rm -f $dbdir.tar.gz $sqdir.tar.gz patch.4.2.52.? bogofilter-1.2.4/doc/0000755000175000017500000000000012202001537012573 5ustar sezsezbogofilter-1.2.4/doc/bf_compact.htmlin0000644000175000017500000000515212163573362016130 0ustar sezsezbf_compact

Name

bf_compact — shell script to compact a bogofilter directory

Synopsis

bf_compact bogofilter_directory [wordlist_name...]

Description

bf_compact creates a more compact bogofilter working directory with a dump/load cycle and renames the previous bogofilter_directory to bogofilter_directory.old.

Note: bf_compact cannot be used to process the current working directory, ".", because that cannot be renamed.

If no wordlist_file arguments are given, then bf_compact will use the configured set of wordlists, if the given bogofilter_directory is the same as the configured, or use all *.db files if it is a different directory.

Exit Status

The script exits with status code 0 if everything went well, and nonzero if it encountered trouble.

Notes

This script will delete bogofilter_directory.old and all of its contents!

This script expects a SUSv2 compliant shell. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used.

Authors

Matthias Andree

bogofilter-1.2.4/doc/bogotune.1in0000644000175000017500000001311112163572470015042 0ustar sezsez'\" t .\" Title: bogotune .\" Author: [see the "AUTHOR" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BOGOTUNE" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bogotune \- find optimum parameter settings for bogofilter .SH "SYNOPSIS" .HP \w'\fBbogotune\fR\ 'u \fBbogotune\fR [\-v] [\-c\ \fIconfig\fR] [\-C] [\-d\ \fIdir\fR] [\-D] [\-r\ \fIvalue\fR] [\-T\ \fIvalue\fR] \-n\ \fIokfile\fR\ [[\-n]\ \fIokfile\fR\ [\&.\&.\&.]] \-s\ \fIspamfile\fR\ [[\-s]\ \fIspamfile\fR\ [\&.\&.\&.]] [\-M\ \fIfile\fR] .HP \w'\fBbogotune\fR\ 'u \fBbogotune\fR [\-h] .SH "DESCRIPTION" .PP Bogotune tries to find optimum parameter settings for bogofilter\&. It needs at least one set each of spam and non\-spam messages\&. The production wordlist is normally used, but it can be directed to read a different wordlist, or to build its own from half the supplied messages\&. .PP In order to produce useful results, bogotune has minimum message count requirements\&. The wordlist it uses must have at least 2,000 spam and 2,000 non\-spam in it and the message files must contain at least 500 spam and 500 non\-spam messages\&. Also, the ratio of spam to non\-spam should be in the range 0\&.2 to 5\&. If you direct bogotune to build its own wordlist, it will use the half the input or 2000 messages (whichever is larger) for the wordlist\&. .PP Message files may be in mbox, maildir, or MH folder or any combination\&. Msg\-count files can also be used, but not mixed with other formats\&. .SH "OPTIONS" .PP The \fB\-h\fR option prints the help message and exits\&. .PP The \fB\-v\fR option increases the verbosity level\&. Level 1 displays the scan output in detail instead of using a progress meter\&. .PP The \fB\-c\fR \fIfilename\fR option tells bogofilter to read the config file named\&. .PP The \fB\-C\fR option prevents bogotune from reading a configuration file\&. .PP The \fB\-d\fR \fIdir\fR option specifies the directory for the database\&. See the ENVIRONMENT section for other directory setting options\&. .PP The \fB\-D\fR option tells bogotune to build a wordlist in memory using the input messages\&. The messages are read and divided into two groups\&. The first group is used to build a wordlist (in ram) and the second is used for tuning\&. To meet the minimum requirements of 2000 messages in the wordlist and 500 messages for testing, when \fB\-D\fR is used, there must be 2500 non\-spam and 2500 spam in the input files\&. If there are enough messages (more than 4000), they will be split evenly between wordlist and testing\&. Otherwise, they will be split proportionately\&. .PP The \fB\-n\fR option tells bogotune that the following argument is a file (or folder) containing non\-spam\&. Since version 1\&.0\&.3, multiple arguments to the \fB\-n\fR option can be given\&. All non\-option arguments until the next \fB\-s\fR option will be treated as though they had been preceded by \fB\-n\fR .PP The \fB\-s\fR option tells bogotune that the following argument is a file (or folder) containing spam\&. It can be repeated as often as necessary\&. Since version 1\&.0\&.3, multiple arguments to the \fB\-s\fR can be given\&. All non\-option arguments until the next \fB\-n\fR option will be treated as though they had been preceded by \fB\-s\fR\&. .PP The \fB\-r \fR\fB\fIvalue\fR\fR option tells bogotune to use the following parameter as the robx value\&. .PP The \fB\-T \fR\fB\fIvalue\fR\fR option tells bogotune to use the following parameter as fp target value\&. .PP The \fB\-M \fR\fB\fIfile\fR\fR option tells bogotune to convert the file to message count format\&. This format provides a sorted list of each message\*(Aqs unique tokens, along with their ham and spam counts\&. Sorting hides the sense of the messages quite effectively, thus protecting privacy\&. The message\-count format allows bogotune and bogofilter to score messages quickly without needing the original token database\&. .SH "ENVIRONMENT" .PP Bogofilter uses a database directory, which can be set in the config file\&. If not set there, bogofilter will use the value of \fBBOGOFILTER_DIR\fR\&. Both can be overridden by the \fB\-d\fR\fB\fIdir\fR\fR option\&. If none of that is available, bogofilter will use directory $HOME/\&.bogofilter\&. .SH "BUGS" .PP Bogotune is not particularly robust when presented with garbage input\&. .SH "AUTHOR" .PP The bogofilter developer team\&. .PP For updates, see \m[blue]\fBthe bogofilter project page\fR\m[]\&\s-2\u[1]\d\s+2\&. .SH "SEE ALSO" .PP bogofilter(1), bogolexer(1), bogoupgrade(1), bogoutil(1) .SH "NOTES" .IP " 1." 4 the bogofilter project page .RS 4 \%http://bogofilter.sourceforge.net/ .RE bogofilter-1.2.4/doc/bogoupgrade.1in0000644000175000017500000001152012163572465015524 0ustar sezsez'\" t .\" Title: bogoupgrade .\" Author: [see the "AUTHOR" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BOGOUPGRADE" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bogoupgrade \- upgrades bogofilter database to current version .SH "SYNOPSIS" .HP \w'\fBbogoupgrade\fR\ 'u \fBbogoupgrade\fR [\-h] \-d\ \fIdirectory\fR [\-i\ \fIinput\ file\fR] [\-o\ \fIoutput\ file\fR] [\-b\ \fIpath\ to\ bogoutil\fR] .SH "DESCRIPTION" .PP \fBbogoupgrade\fR is a command to upgrade bogofilter\*(Aqs databases from an old format to the current format\&. Since the format of the database changes once in a while, the utility is designed to make the upgrade easy\&. .SH "OPTIONS" .PP The \fB\-h\fR option prints the help message and exits\&. .PP The \fB\-d\fR specifies the directory with the wordlists for converting\&. This option is used when converting from multiple, separate wordlists (spamlist\&.db and goodlist\&.db \- containing spam and ham tokens, respectively) to a combined wordlist (wordlist\&.db) which contains both spam and ham tokens\&. .PP The \fB\-i\fR specifies the input file to be converted\&. It should be a text file containing message counts, and possibly data\&. If there is no data in the text file, there should be a Berkeley DB file in the same directory as the text file which contains the data\&. .PP The \fB\-o\fR specifies the output Berkeley DB file\&. .PP The \fB\-b\fR gives the path to the \fBbogoutil\fR command\&. It defaults to \*(Aqbogoutil\*(Aq, in the hopes that your shell will find it\&. .SH "UPGRADING" .PP Follow these instructions to upgrade bogofilter\*(Aqs databases to the latest version\&. .sp .RS 4 .ie n \{\ \h'-04' 1.\h'+01'\c .\} .el \{\ .sp -1 .IP " 1." 4.2 .\} Stop all instances of bogofilter\&. While the upgrade tools lock the database files, the upgrade may take a long time if you have a busy site\&. Don\*(Aqt forget to stop cron jobs or daemons that fetch and process mail and could fire off bogofilter\&. .RE .sp .RS 4 .ie n \{\ \h'-04' 2.\h'+01'\c .\} .el \{\ .sp -1 .IP " 2." 4.2 .\} Backup your data\&. Let\*(Aqs assume that you said: .sp .if n \{\ .RS 4 .\} .nf $ \fBmv ~/\&.bogofilter ~/\&.bogofilter\&.safe\fR $ \fBmkdir ~/\&.bogofilter\fR .fi .if n \{\ .RE .\} .RE .sp .RS 4 .ie n \{\ \h'-04' 3.\h'+01'\c .\} .el \{\ .sp -1 .IP " 3." 4.2 .\} If your bogofilter version is less than 0\&.7, say: .sp .if n \{\ .RS 4 .\} .nf $ \fBbogoupgrade \-i ~/\&.bogofilter\&.safe/goodlist \-o ~/\&.bogofilter/goodlist\&.db\fR $ \fBbogoupgrade \-i ~/\&.bogofilter\&.safe/badlist \-o ~/\&.bogofilter/spamlist\&.db\fR .fi .if n \{\ .RE .\} .sp If your bogofilter version is 0\&.7 or greater, say: .sp .if n \{\ .RS 4 .\} .nf $ \fBbogoupgrade \-i ~/\&.bogofilter\&.safe/hamlist\&.count \-o ~/\&.bogofilter/goodlist\&.db\fR $ \fBbogoupgrade \-i ~/\&.bogofilter\&.safe/spamlist\&.count \-o ~/\&.bogofilter/spamlist\&.db\fR .fi .if n \{\ .RE .\} .RE .sp .RS 4 .ie n \{\ \h'-04' 4.\h'+01'\c .\} .el \{\ .sp -1 .IP " 4." 4.2 .\} Current versions of bogofilter use a combined wordlist that holds both spam and non\-spam tokens\&. It is named wordlist\&.db\&. If you\*(Aqre updating from a version older than 0\&.14\&.0 that has separate wordlists (named goodlist\&.db and spamlist\&.db), use: .sp .if n \{\ .RS 4 .\} .nf $ \fBbogoupgrade \-d ~/\&.bogofilter\&.safe\fR .fi .if n \{\ .RE .\} .RE .sp .RS 4 .ie n \{\ \h'-04' 5.\h'+01'\c .\} .el \{\ .sp -1 .IP " 5." 4.2 .\} Done\&. Restart any stopped daemons, cron tasks, etc\&. .RE .SH "AUTHOR" .PP \fBbogoupgrade\fR was written by Gyepi Sam and David Relson \&. .PP For updates, see \m[blue]\fBthe bogofilter project page\fR\m[]\&\s-2\u[1]\d\s+2\&. .SH "SEE ALSO" .PP bogofilter(1), bogolexer(1), bogotune(1), bogoutil(1) .SH "NOTES" .IP " 1." 4 the bogofilter project page .RS 4 \%http://bogofilter.sourceforge.net/ .RE bogofilter-1.2.4/doc/bf_copy.htmlin0000644000175000017500000000454312163573361015456 0ustar sezsezbf_copy

Name

bf_copy — shell script to copy a bogofilter working directory

Synopsis

bf_copy [-c] source_dir destination_dir

Description

bf_copy copies a bogofilter working directory to another directory. Currently it copies the database files (*.db), related files (log.*), and DB_CONFIG (if present).

Options

The -c option causes only active log files to be copied, not all. The default is to copy all log files.

Exit Status

The script exits with status code 0 if everything went well, and nonzero if it encountered trouble.

Bugs

This script assumes all *.db files in the source directory are relevant and copies them. This may not match your actual configuration.

Notes

This script is meant for use with Berkeley DB and SQLite based bogofilter versions.

This script expects a SUSv2 compliant shell. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used.

Authors

Matthias Andree

bogofilter-1.2.4/doc/bogofilter-faq.html0000644000175000017500000017610712163572307016414 0ustar sezsez Bogofilter FAQ

Bogofilter FAQ

Official Versions: In English or French or Italian or Bulgarian
Maintainer: David Relson <relson@osagesoftware.com>

This document is intended to answer frequently asked questions about bogofilter.

Typographic conventions

  • If we show example commands that start with a dollar sign ($), this means that these commands should be executed by an unprivileged user, NOT the root user.
  • If we show example commands that start with a hash mark (#), this means that these commands need to be executed by the root user.

Frequently asked questions and their answers

What is bogofilter?

Bogofilter is a fast Bayesian spam filter along the lines suggested by Paul Graham in his article A Plan For Spam. bogofilter uses Gary Robinson's geometric-mean algorithm with the Fisher's method modification to classify email as spam or non-spam.

The bogofilter home page at SourceForge is the central clearinghouse for bogofilter resources.

Bogofilter was started by Eric S. Raymond on August 19, 2002. It gained popularity in September 2002, and a number of other authors have started to contribute to the project.

The NEWS file describes bogofilter's version history.

Bogo-what?

Bogofilter is some kind of a bogometer or bogon filter, i.e., it tries to identify bogus mail by measuring the bogosity.

How does bogofilter work?

See the man page's THEORY OF OPERATION section for an introduction. The main source for understanding this is Gary Robinson's Linux Journal article "A Statistical Approach to the Spam Problem".

After you read all this you might ask some questions. The first could be "Is bogofilter really a Bayesian spam filter?" Bogofilter is based on Bayes' theorem and uses it in the initial calculations and other statistical methods later. Without doubt it is a statistical spam filter with a Bayesian flavor.

Other questions you might have might concern the basic assumptions of Bayes' theory. Two short answers are: "No, they are not satisfied" and "We don't care as long as it works". A longer answer will mention that the basic assumption that "an e-mail is a random collection of words, each independent of the others" is violated. There are several places where practice doesn't follow theory. Some are always present, and some which will depend on the way you use bogofilter:

  • Words in an e-mail are by no means independent. In all languages, the opposite is true.
  • The words used are not random, though some spammers include random words.
  • Full training or using a random sample, follows Bayes' principles. Choosing messages to use for training violates the assumption that the training messages are a random sample of the messages received. This principle is also violated by Bogofilter's auto-update function (with the thresh_update parameter), training on error, or anything similar to these approaches.
  • The same applies if you train with the same message more than once.
  • Other problems arise if you modify your database by removing tokens (like using bogoutil with -a or -c).
  • Undoubtedly there are more.

As the man page explains, bogofilter tries to understand how badly the null hypothesis fails. Some people argue that "those departures from reality usually work in our favor" (from Gary's article). Some argue that, even then, we should not violate too much. Nobody really knows. Just keep in mind that problems might occur if you push too hard. The key to bogofilter's approach is: What matters most is simply what works in the real world.

Now that you have been warned, have fun and use bogofilter as suits you best.

Mailing Lists

There are currently four mailing lists for bogofilter:

List Address Links Description
bogofilter-announce@bogofilter.org [subscribe] [archives: mailman, gmane] An announcement-only list where new versions are announced.
bogofilter@bogofilter.org [subscribe] [archives: mailman, gmane] A discussion list where any conversation about bogofilter may take place.
bogofilter-dev@bogofilter.org [subscribe] [archives: mailman, gmane] A list for sharing patches, development, and technical discussions.
bogofilter-cvs@lists.sourceforge.net [subscribe] [archive] Mailing list for announcing code changes to the SVN archive. (The CVS name is a leftover from before the migration for our users' convenience.)

The bogofilter-announce list is moderated and is used only for important announcements (eg: new versions). It is low traffic. If you have subscribed to the user's list or the developer's list, you don't need to subscribe to the announce list. Messages posted to the announce list are also distributed to the others.

How do I start my bogofilter training?

To classify messages as ham (non-spam) or spam, bogofilter needs to learn from your mail. To start with it is best to have collections (that are as large as possible) of messages you know for sure are ham or spam. (Errors here will cause problems later, so try hard;-). Warning: Only use your mail; using other collections (like a spam collection found on the web), might cause bogofilter to draw a wrong conclusion — after all you want it to understand your mail.

Once you have the spam and ham collections, you have basically four choices. In all cases it works better if your training base (the above collections) is bigger, rather than smaller. The smaller your training collection is, the higher the number of errors bogofilter will make in production. Let's assume your collection is two mbox files: ham.mbox and spam.mbox.

  • Method 1) Full training. Train bogofilter with all your messages. In our example:

        bogofilter -s < spam.mbox
    bogofilter -n < ham.mbox

Note: Bogofilter's contrib directory includes two scripts that both use a train-on-error technique. This technique scores each message and adds to the database only those messages that were scored incorrectly (messages scored as uncertain, ham scored as spam, or spam scored as ham). The goal is to build a database of those words needed to correctly classify messages. The resulting database is smaller than the one build using full training.

  • Method 2) Use the script bogominitrain.pl (in the contrib directory). It checks the messages in the same order as your mailbox files. You can use the -f option which will repeat this until all messages in your training collection are classified correctly (you can even adjust the level of certainty). Since the script makes sure the database understands your training collection "exactly" (with your chosen precision), it works very well. You can use -o to create a security margin around your spam_cutoff. Assuming spam_cutoff=0.6 you might want to score all ham in your collection below 0.3 and all spam above 0.9. Our example is:

        bogominitrain.pl -fnv ~/.bogofilter ham.mbox spam.mbox '-o 0.9,0.3'

  • Method 3) Use the script randomtrain (in the contrib directory). The script generates a list of all the messages in the mailboxes, randomly shuffles the list, and then scores each message, with training as needed. In our example:

        randomtrain -s spam.mbox -n ham.mbox

    As with method 4, it works better if you start with full training using several thousand messages. This will give a database that is more comprehensive and significantly bigger.

  • Method 4) If you have enough spams and non-spams in your training collection, separate out some 10,000 spams and 10,000 non-spams into separate mbox files, and train as in method 1. Then use bogofilter to classify the remaining spams and non-spams. Take any messages that it classifies as unsure or classifies incorrectly, and train with those. Here are two little scripts you can use to classify the train-on-error messages:

        #! /bin/sh
    #  class3 -- classify one message as bad, good or unsure
    cat >msg.$$
    bogofilter $* <msg.$$
    res=$?
    if [ $res = 0 ]; then
        cat msg.$$ >>corpus.bad
    elif [ $res = 1 ]; then
        cat msg.$$ >>corpus.good
    elif [ $res = 2 ]; then
        cat msg.$$ >>corpus.unsure
    fi
    rm msg.$$
        #! /bin/sh
    # classify -- put all messages in mbox through class3
    src=$1;
    shift
    formail -s class3 $* <$src

    In our example (after the initial full training):

        classify spam.mbox [bogofilter options]
    bogofilter -s < corpus.good
    rm -f corpus.*
    classify ham.mbox [bogofilter options]
    bogofilter -n < corpus.bad
    rm -f corpus.*

Comparing these methods

It is important to understand the consequences of the methods just described. Doing full training as in methods 1 and 4 produces a larger database than does training with methods 2 or 3. If your database size needs to be small (for example due to quota limitations), use methods 2 or 3.

Full training with method 1 is fastest. Training on error (as in methods 2, 3 and 4) is effective, but the initial training takes longer.

How do I train using maildirs?

Initial training from mbox:

    bogofilter -M -s -I ~/mail/Spam
    bogofilter -M -n -I ~/mail/NonSpam

Initial training from maildir:

    bogofilter -s -B ~/Maildir/.Spam
    bogofilter -n -B ~/Maildir/.NonSpam

Corrective training from mbox:

    bogofilter -M -Ns -I ~/mail/Missed_Spam
    bogofilter -M -Sn -I ~/mail/False_Spam

Corrective training from maildir:

    bogofilter -s -B ~/Maildir/.Missed_Spam
    bogofilter -n -B ~/Maildir/.False_Spam

How can I keep the scoring accuracy high?

Bogofilter will make mistakes once in a while. So ongoing training is important. There are two main methodologies for doing this. First, you can train with every incoming message (using the -u option). Second, you can train on error only.

Since you might want to rebuild your database at some point, for example when a major new feature is implemented in bogofilter, it can be very useful to update your training collection continuously.

Bogofilter always does the best it can with the information available to it. However, it will make mistakes, i.e., classify ham as spam (false positives) or spam as ham (false negatives). To reduce the likelihood of repeating the mistake, it is necessary to train bogofilter with the errant message. If a message is incorrectly classified as spam, use switch -n to train with it as ham. Use switch -s to train with a spam message.

Bogofilter has a -u switch that automatically updates the wordlists after scoring each message. As bogofilter sometimes misclassifies a message, monitoring is necessary to correct any mistakes. Corrections can be done using -Sn to change a message's classification from spam to non-spam and -Ns to change it from non-spam to spam.

Correcting a misclassified message may affect classification for other message. The smaller your database is, the higher is the likelihood that a training error will cause a misclassification.

Using a method like #2 or #3 (above) can compensate for this effect. Repeat the training with your complete training collection (including all the new messages added since the earlier training). This will add messages to the database which show that adverse effect on both sides until you have a new equilibrium.

An alternative strategy, based on method 4 in the previous section, is the following: Periodically take blocks of messages and use the scripts in method 4 above to classify them. Then manually review the good, bad and unsure files, correct any errors, and split the unsures into spam and non-spam. Until you have accumulated some 10,000 spam and 10,000 non-spam in your training database, train with the good, the bad, and the separated errors and unsures; thereafter, train with only the separated and unsures, discarding the messages that bogofilter already classifies correctly.

What mailbox (file) formats does bogofilter understand?

Bogofilter understands the traditional Unix mbox format, the Maildir and MH formats. Note though that bogofilter does not support subfolders, you will have to explicitly list them in MH or Maildir++ folders - just mention the full path to the subfolder.

For unsupported formats, you will have to convert the mailbox to a format bogofilter understands. Mbox is often convenient because it can be piped into bogofilter.

For example, to convert UW-IMAP/PINE mbx format to mbox: 

    mailtool copy /full/path/to/mail.mbox '#driver.unix//full/path/to/mbox'

or:

    for MSG in /full/path/to/maildir/* ; do 
        formail -I Status: < "$MSG" >> /full/path/to/mbox
    done

What does bogofilter's verbose output mean?

Bogofilter can instructed to display information on the scoring of a message by running it with flags "-v", "-vv", "-vvv", or "-R".

  • Using "-v" causes bogofilter to generate the "X-Bogosity:" header line, i.e. 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
  • Using "-vv" causes bogofilter to generate a histogram, i.e. 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
      int  cnt    prob   spamicity  histogram
     0.00   29  0.000209  0.000052  #############################
     0.10    2  0.179065  0.003425  ##
     0.20    2  0.276880  0.008870  ##
     0.30   18  0.363295  0.069245  ##################
     0.40    0  0.000000  0.069245
     0.50    0  0.000000  0.069245
     0.60   37  0.667823  0.257307  #####################################
     0.70    5  0.767436  0.278892  #####
     0.80   13  0.836789  0.334980  #############
     0.90   32  0.984903  0.499835  ################################

    Each row shows an interval, the count of tokens with scores in that interval, the average spam probability for those tokens, the message's spamicity score (for those tokens and all lesser valued tokens), and a bar graph corresponding to the token count.

    In the above histogram there are a lot of low scoring tokens and a lot of high scoring tokens. They "balance" one another to give the spamicity score of 0.5000

  • Using "-vvv" produces a list of all the tokens in the messages with information on each one, i.e. 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
                          n    pgood     pbad      fw     U
    "which"              10  0.208333  0.000000  0.000041 +
    "own"                 7  0.145833  0.000000  0.000059 +
    "having"              6  0.125000  0.000000  0.000069 +
    ...
    "unsubscribe.asp"     2  0.000000  0.095238  0.999708 +
    "million"             4  0.000000  0.190476  0.999854 +
    "copy"                5  0.000000  0.238095  0.999883 +
    N_P_Q_S_s_x_md      138  0.00e+00  0.00e+00  5.00e-01
                             1.00e-03  4.15e-01  0.100
    The columns printed contain the following information:
    "…"
    the token in question
    n
    number of times this token was encountered in training
    pgood
    proportion of good messages that contained this token
    pbad
    proportion of spam messages that contained this token
    fw
    Robinson's weighted index, which combines pgood and pbad to give a value that will be close to zero if a message containing this token is likely to be non-spam and close to one if it's likely to be spam
    U
    '+' if this token contributes to the final bogosity value, '-' otherwise. A token is excluded when its score is closer to 0.5 than min_dev.

    The final lines show:

    • The cumulative results of the columns
    • The values of Robinson's s and x parameters and of min_dev
  • Using "-R" produces the "-vvv" output described above plus two additional columns:
    invfwlog
    logarithm of fw
    fwlog
    logarithm of (1-fw)

    The "-R" output is formatted for use with the R language for statistical computing. More information is available at The R Project for Statistical Computing.

What is Unsure mode?

Bogofilter's default configuration will classify a message as spam or non-spam. The SPAM_CUTOFF parameter is used for this. Messages with scores greater than or equal to SPAM_CUTOFF are classified as spam. Other messages are classified as ham.

There is also a HAM_CUTOFF parameter. When used, messages must have scores less than or equal to HAM_CUTOFF to be classified as ham. Messages with scores between HAM_CUTOFF and SPAM_CUTOFF are classified as unsure. If you look in bogofilter.cf, you will see the following lines:

    #### CUTOFF Values
    #
    #    both ham_cutoff and spam_cutoff are allowed.
    #    setting ham_cutoff to a non-zero value will
    #    enable tri-state results (Spam/Ham/Unsure).
    #
    #ham_cutoff  = 0.45
    #spam_cutoff = 0.99
    #
    #    for two-state classification:
    #
    ## ham_cutoff = 0.00
    ## spam_cutoff= 0.99

To turn on Yes/No/Unsure classification, remove the #'s from the last two lines.

Alternatively, if you'd rather use labels Yes/No/Unsure instead of Spam/Ham/Unsure, remove the #'s from the following bogofilter.cf line: 

    ## spamicity_tags = Yes, No, Unsure

Once that's done, you may want to set the filtering rules for your mail program to include rules like:

    if header contains "X-Bogosity: Spam", put in Spam folder
    if header contains "X-Bogosity: Unsure", put in Unsure folder

Alternatively, bogofilter.cf has directives for modifying the Subject: line, i.e.

    #### SPAM_SUBJECT_TAG
    #
    #    tag added to "Subject: " line for identifying spam or unsure
    #    default is to add nothing.
    #
    ##spam_subject_tag=***SPAM***
    ##unsure_subject_tag=???UNSURE???

With these subject tags, the filtering rules would look like:

    if subject contains "***SPAM***", put in Spam folder
    if subject contains "???UNSURE???", put in Unsure folder

What are "training on error" and "training to exhaustion"?

"Training on error" involves scanning a corpus of known spam and non-spam messages; only those that are misclassified, or classed as unsure, get registered in the training database. It's been found that sampling just messages prone to misclassification is an effective way to train; if you train bogofilter on the hard messages, it learns to handle obvious spam and non-spam too.

This method can be enhanced by using a "security margin". By increasing the spam cutoff value and decreasing the ham cutoff value, messages which are close to a cutoff will be used for training. Using security margins improves results when training on error. In general, greater margins help more (although too much also isn't optimal). As a rule of thumb spam cutoff +/- 0.3 gives good results. For tristate mode, you might try the middle of the unsure interval +/- 0.3 for training.

Repeating training on error on the same message corpus can improve accuracy. The idea is that messages which were rated correctly in the first place might after some more training be rated wrongly which will then be corrected.

"Training to exhaustion" is repeating training on error, with the same message corpus, until no errors remain. Also this method can be improved with security margins. See Gary Robinson's Rants on this topic for more details.

Note: bogominitrain.pl has a -f option to do "training to exhaustion". Using -fn avoids repeated training for each message.

What does the '-u' (autoupdate) switch do?

The "-u" switch (autoupdate) is used to automatically expand the wordlist. When this switch is used and bogofilter classifies a message as Spam or Ham, the message's tokens are added to the wordlist with a ham/spam tag (as appropriate).

As an example, suppose a new "Refinance now - best Mortgage rates" message comes in. It will have some words that bogofilter has seen and (probably) some new ones as well. Using '-u' the new words will be added to the wordlist so that bogofilter can better recognize the next, related message.

If/when you use to use '-u', you need to be on the lookout for classification errors and retrain bogofilter with any messages that have been classified incorrectly. An incorrectly classified message that is auto-updated _may_ cause bogofilter to make additional classification errors in the future. This is the same problem as when you (the sys admin) incorrectly register a ham message as spam (or vice versa).

How can I use SpamAssassin to train Bogofilter?

If you have a working SpamAssassin installation (or care to create one), you can use its return codes to train bogofilter. The easiest way is to create a script for your MDA that runs SpamAssassin, tests the spam/non-spam return code, and runs bogofilter to register the message as spam (or non-spam). The sample procmail recipe below shows one way to do this:

    BOGOFILTER     = "/usr/bin/bogofilter"
    BOGOFILTER_DIR = "training"
    SPAMASSASSIN  = "/usr/bin/spamassassin"

    :0 HBc
    * ? $SPAMASSASSIN -e
    #spam yields non-zero
    #non-spam yields zero
    | $BOGOFILTER -n -d $BOGOFILTER_DIR
    #else (E)
    :0Ec
    | $BOGOFILTER -s -d $BOGOFILTER_DIR

    :0fw
    | $BOGOFILTER -p -e

    :0:
    * ^X-Bogosity:.Spam
    spam

    :0:
    * ^X-Bogosity:.Ham
    non-spam

What can I do about Asian spam?

Many people get unsolicited email using Asian language charsets. Since they don't know the languages and don't know people there, they assume it's spam.

The good news is that bogofilter does detect them quite successfully. The bad news is that this can be expensive. You have basically two choices:

  • You can simply let bogofilter handle it. Just train bogofilter with the Asian language messages identified as spam. Bogofilter will parse the messages as best it can and will add tokens to the spam wordlist. The wordlist will contain many tokens which don't make sense to you (since the charset cannot be displayed), but bogofilter can work with them and successfully identify Asian spam.

    A second method is to use the "replace_nonascii_characters" config file option. This will replace high-bit characters, i.e. those between 0x80 and 0xFF, with question marks, '?'. This keeps the database much smaller. Unfortunately this conflicts with European language which have many accented vowels and consonant in the high-bit range.

  • If you are sure you will not receive any legitimate messages in those languages, you can kill them right away. This will keep the database smaller. You can do this with an MDA script.

    Here's a procmail recipe that will sideline messages written with Asian charsets:

        ## Silently drop all Asian language mail
    UNREADABLE='[^?"]*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987'
    :0:
    * 1^0 $ ^Subject:.*=\?($UNREADABLE)
    * 1^0 $ ^Content-Type:.*charset="?($UNREADABLE)
    spam-unreadable

    :0:
    * ^Content-Type:.*multipart
    * B ?? $ ^Content-Type:.*^?.*charset="?($UNREADABLE)
    spam-unreadable

    With the above recipe, bogofilter will never see the message.

How can I compact my database?

You can periodically compact the database so it occupies a minimum of disk space. Assuming your wordlist is in directory ~/.bogofilter, for bogofilter 0.93.0 (or newer) use:

    bf_compact ~/.bogofilter wordlist.db

For bogofilter older than 0.93.0, use:

    cd ~/.bogofilter
    bogoutil -d wordlist.db | bogoutil -l wordlist.db.new
    mv wordlist.db wordlist.db.prv
    mv wordlist.db.new wordlist.db

The script is needed to duplicate your database environment (in order to support BerkeleyDB transaction processing). Your original directory will be renamed to ~/.bogofilter.old and ~/.bogofilter will contain the new database environment.

Since older versions of bogofilter don't use Berkeley DB transactions, the database is just a single file (wordlist.db) and it isn't necessary to use the script. The commands shown above create a new compact database and rename the original file to wordlist.db.prv

Note: it's O.K. to use the script with old versions of bogofilter.

How do I manually query the database?

To find the spam and ham counts for a token (word) use bogoutil's '-w' option. For example, "bogoutil -w $BOGOFILTER_DIR/wordlist.db example.com" gives the good and bad counts for "example.com".

If you want the spam score in addition to the spam and ham counts for a token (word) use bogoutil's '-p' option. For example, "bogoutil -p $BOGOFILTER_DIR/wordlist.db example.com" gives the good and bad counts for "example.com".

To find out how many messages are in your wordlists query the special token .MSG_COUNT, i.e., run command "bogoutil -w $BOGOFILTER_DIR/wordlist.db .MSG_COUNT" to see the counts for the spam and ham wordlists.

To tell how many tokens are in your wordlists pipe the output of bogoutil's dump command to command "wc", i.e. use "bogoutil -d $BOGOFILTER_DIR/wordlist.db | wc -l " to display the count.

Can I use multiple wordlists?

Yes. Bogofilter can be run with multiple wordlists. For example, if you have both user and system wordlists, bogofilter can be instructed to check the user list and, if the word isn't there, then check the system list. Alternatively, it can be instructed to add together the information from the two lists.

Following are the config file options and some examples:

A wordlist has several attributes, notably type, name, filename, and precedence.

  • Type: 'R' and 'I' (for "regular" and "ignore"). Current wordlists are of type 'R'. Type 'I' means "don't score the token if found in the ignore list".
  • Name: a short identifying symbol used when printing error messages. Examples are "global", "user", and "ignore", but you can use any identifier you want.
  • Filename: the name (path) of the file. When opening the wordlist, if the name is fully qualifified (with a leading '/' or '~'), that name is used. If the name isn't fully qualified, bogofilter will prepend the directory, using the usual search order is used, i.e. $BOGOFILTER_DIR, $BOGODIR, $HOME.
  • Precedence: an integer like 1, 2, 3, ... Wordlists are searched in ascending order for the token. If the search token is found, lists with the same precedence number will be checked (and counts added together). Lists with higher precedence numbers will not be checked.

Example 1 - merge user and system lists:

    wordlist R,user,~/wordlist.db,1
    wordlist R,system,/var/spool/bogofilter/wordlist.db,1

Example 2 - prefer user to system list:

    wordlist R,user,~/wordlist.db,2
    wordlist R,system,/var/spool/bogofilter/wordlist.db,3

Example 3 - prefer system to user list:

    wordlist R,user,~/wordlist.db,5
    wordlist R,system,/var/spool/bogofilter/wordlist.db,4

Note 1: bogofilter's registration flags ('-s', '-n', '-u', '-S', '-N' ) will apply to the lowest numbered list.

Note 2: having lists of types 'R' and 'I' of the same precedence won't be allowed because the types are contradictory.

Can I tell bogofilter to ignore certain tokens?

Through the use of an ignore list, bogofilter will ignore the listed tokens when scoring the message.

Example:

    wordlist I,ignore,~/ignorelist.db,7
    wordlist R,system,/var/spool/bogofilter/wordlist.db,8

Because ignorelist.db has a lower index (7), than wordlist.db (8), bogofilter will stop looking when finds a token in ignorelist.db.

Note: Technically, bogofilter gives a score of ROBX to the tokens and expects the min_dev parameter to drop them from the scoring.

There are two main methods for building/maintaining an ignore list.

First, a text file can be created and maintained using any text editor. Bogoutil can convert the text file to database format, e.g. "bogoutil -l ignorelist.db < ignorelist.txt".

Alternatively, echo ... | bogoutil ... can be used to add a single token, for example "ignore.me", as in:

  echo ignore.me | bogoutil -l ~/ignorelist.db

How do I upgrade from separate word databases to the combined wordlist format?

Run script bogoupgrade. For more info, run "bogoupgrade -h" to see its help message or run "man bogoupgrade" and read its man page.

How can I tell if my wordlists are corrupted?

NOTE: some distributors rename all the db_ utilities given below by inserting or appending the version number, with or without dot, for instance db4.1_verify or db_verify-4.2. There is no standard on the renaming of these utilities.

If you think your wordlists are hosed, you can see what BerkeleyDB thinks by running:

    db_verify wordlist.db

You may be able to recover some (or all) of the tokens and their counts with the following commands:

    bogoutil -d wordlist.db | bogoutil -l wordlist.new.db

or - if there has been more damage to the token list - with

    db_dump -r wordlist.db > wordlist.txt
    db_load wordlist.new.db < wordlist.txt

You can also use a text file instead of a pipe, as in:

    bogoutil -d wordlist.db > wordlist.txt
    bogoutil -l wordlist.db.new < wordlist.txt

How can I convert my wordlist to/from unicode?

Wordlists can be converted from raw storage to unicode using:

    bogoutil -d wordlist.db > wordlist.raw.txt
    iconv -f iso-8859-1 -t utf-8 < wordlist.raw.txt > wordlist.utf8.txt
    bogoutil -l wordlist.db.new < wordlist.utf8.txt

or:

    bogoutil --unicode=yes -m wordlist.db

Wordlists can be converted from unicode to raw storage using:

    bogoutil -d wordlist.db > wordlist.utf8.txt
    iconv -f utf-8  -t iso-8859-1 < wordlist.utf8.txt > wordlist.raw.txt
    bogoutil -l wordlist.db.new < wordlist.raw.txt

or:

    bogoutil --unicode=no -m wordlist.db

The above methods work best when the wordlist is based on the iso-8859-1 charset. If your wordlist is based on a different charset, for example CP866 or KOI8-R, use that charset in the above commands.

For a wordlist containing tokens from multiple languages, particularly non-european languages, the conversion methods described above may not work well. Building a new wordlist (from scratch) will likely work better as the new wordlist will be based solely on unicode.

How can I switch from non-transaction to transaction mode?

How to do this is fully documented in file doc/README.db section 2.2.1. We suggest you read the whole section.

In brief, use these commands: 

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    bogoutil --db-transaction=yes -l wordlist.db < wordlist.txt

If everything went well, you can remove the backup files:

    rm wordlist.db.old wordlist.txt

How can I switch from transaction to non-transaction mode?

How to do this is fully documented in file doc/README.db section 2.2.2. We suggest you read the whole section.

In brief, you can use bogoutil to dump/load the wordlist, for example: 

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    rm -f log.?????????? __db.???
    bogoutil --db-transaction=no -l wordlist.db < wordlist.txt

Why does bogofilter die after printing "Lock table is out of available locks" or "Lock table is out of available object entries"

The transactional and concurrent modes of BerkeleyDB require a lock table that corresponds to the data base in size. See the README.db file for a detailed explanation and a remedy.

The size of the lock table can be set in bogofilter.cf or in DB_CONFIG. Bogofilter.cf uses the db_lk_max_locks and db_lk_max_objects directives, while DB_CONFIG uses the set_lk_max_objects and set_lk_max_locks directives.

After changing these values in DB_CONFIG, run command 

  bogoutil --db-recover /your/bogofilter/directory

to rebuild the lock tables.

Why am I getting DB_PAGE_NOTFOUND messages?

You have a problem with your BerkeleyDB database. There are two likely causes: either you've hit a max size limit or the database is corrupt.

Some mail transfer agents, such as Postfix, impose file size limits. When bogofilter's database reaches that limit, write problems will occur.

To show the database size use:

    ls -lh $BOGOFILTER_DIR/wordlist.db

To show the postfix setting:

    postconf | grep mailbox_size_limit

To set the limit to 73MB (or whatever size is right for you):

    postconf -e mailbox_size_limit=73000000

If you think your database may be corrupt, read How can I tell if my wordlists are corrupted? FAQ entry.

Why am I getting "Berkeley DB library configured to support only DB_PRIVATE environments" or
"Berkeley DB library configured to support only private environments"?

Some distributors (for instance the Fedora Project) package Berkeley DB with support for POSIX threading and hence POSIX mutexes, but your system does not support POSIX mutexes (whether it does, depends on the kernel version and exact processor type).

To work around this problem:

  1. download, compile and install Berkeley DB on your own and the reconfigure bogofilter:
    1. cd build_unix
    2. ../dist/configure --enable-cxx
    3. make
    4. make install
  2. recompile and install bogofilter:
    1. ./configure --with-libdb-prefix=/usr/local/BerkeleyDB.4.3 (replace your Berkeley DB version number)
    2. make && make check
    3. make install (if space is a premium, use make install-strip)

Can bogofilter be used in a multi-user environment?

Yes, it can. There are multiple, distinct strategies for doing this. The two extremes are:

  • Having a bogofilter administrator who maintains a global wordlist that everybody uses.
  • Having each user maintain his/her own wordlist.

As a middle ground, the bogofilter administrator can create and maintain the global wordlists and each user can be given the choice of using the global wordlist or a private wordlist. An MDA, such as procmail, can be programmed to first apply the global wordlist (with a very stringent spam cutoff) and then (if necessary) apply the user's wordlist.

Can I share wordlists over NFS?

If you're just reading from them, there are no problems. When you're updating them, you need to use the correct file locking to avoid data corruption. When you compile bogofilter, you will need to verify that the configure script has set "#define HAVE_FCNTL 1" in your config.h file. Popular UNIX operating systems will all support this. If you are running an unusual, or an older version of an operating system, make sure it supports fcntl(). If your system does not support fcntl(), then you will not be able to share wordlist files over NFS without the risk of data corruption.

Next, make sure you have NFS set up properly, with "lockd" running. Refer to your NFS documentation for more information about running "lockd" or "rpc.lockd". Most operating systems with NFS turn this on by default.

For shared directories (NFS directories used by multiple machines, for instance, Sparc/Itanium/Alpha and x86), the architecture-specific parts can be installed separately by giving a different --exec-prefix (it will default to --prefix)

Why does bogofilter give return codes like 0 and 256 when it's run from inside a program?

Likely the return codes are being reformatted by waitpid(2). In C use WEXITSTATUS(status) in sys/wait.h, or comparable macro, to get the correct value. In Perl you can just use 'system("bogofilter $input") >> 8'. If you want more info, run "man waitpid".

Now that I've upgraded why are my scripts broken?

Over time bogofilter accumulated a large number of functions. Some of those were discontinued or changed. Please read the NEWS file for details.

Now that I've upgraded why is bogofilter working less well?

The lexer, i.e., that part of bogofilter which extracts tokens from a message, evolves. This results in different readings of messages with the consequence that some tokens in the database can no longer be used.

If you encounter this problem, you are strongly advised to rebuild your database. If this is not an option for you, you might want to use version 0.15.13 and read the documentation which comes with it for how to migrate your database.

How can I delete all the spam (or non-spam) tokens?

Bogoutil lets you dump a wordlist and load the tokens into a new wordlist. With the added use of awk and grep, counts can be zeroed and tokens with zero counts for both spam and non-spam can be deleted.

The following commands will delete the tokens from spam messages:

    bogoutil -d wordlist.db | \
    awk '{print $1 " " $2 " 0"}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

The following commands will delete the tokens from non-spam messages:

    bogoutil -d wordlist.db | \
    awk '{print $1 " 0 " $3}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

How do I get bogofilter working on Solaris, BSD, etc?

If you don't already have a v3.0+ version of BerkeleyDB, then download it (take one of the 4.4.X, 4.3.X or 4.2.X versions), unpack it, and do these commands in the db directory:

    $ cd build_unix
    $ sh ../dist/configure
    $ make
    # make install

Next, download a portable version of bogofilter.

On Solaris

Be sure that your PATH environment variable begins with /usr/xpg6/bin:/usr/xpg4/bin:/usr/ccs/bin (/usr/xpg6/bin is only present on Solaris 10 and can be omitted on Solaris 9 and older versions). That is required for POSIX compliance.

Unpack it, and then do:

    $ ./configure --with-libdb-prefix=/usr/local/BerkeleyDB.4.4
    $ make
    # make install-strip

You will either want to put a symlink to libdb.so in /usr/lib, or use a modified LD_LIBRARY_PATH environment variable before you start bogofilter. On newer systems, the most convenient way is probably to use the crle(1) tool to set the path permanently so BerkeleyDB is available to all applications.

    $ LD_LIBRARY_PATH=/usr/lib:/usr/local/lib:/usr/local/BerkeleyDB.4.4
    $ export LD_LIBRARY_PATH

Note that some "make" versions shipped with older Solaris version break when you try to build bogofilter outside of its source directory. Either build in the source directory (as suggested above) or use GNU make (gmake).

If your Solaris GCC complains with "ld: fatal: file values-Xa.o: open failed: No such file or directory", install the SUNWarc package.

On FreeBSD

The FreeBSD ports collection carries the latest stable versions of bogofilter. This approach uses the highly recommended portupgrade and portsnap software packages. To install portupgrade, type (you need to do this only once), as root:

    # pkg_add -r portupgrade

On newer FreeBSD releases, portsnap is in the base system. If typing portsnap help does not print portsnap's help, you need to install portsnap from ports. To achieve that, type (you need to do this only once), as root:

    # pkg_add -r portsnap

To install or upgrade bogofilter, just upgrade your portstree using portsnap, then type, as root:

    # portupgrade -N bogofilter

Note: This assumes you are root. If not, read through the remainder of this FreeBSD section and then see how you can build if you haven't got root privileges.

Depending on your system you may have to set some environment variables for the ./configure command. Example:

    $ env CPPFLAGS=-I/usr/local/include/db3 LIBS=-ldb3 LDFLAGS=-L/usr/local/lib ./configure

The actual paths you use here depend on your system and the database versions you have installed. Check and replace accordingly.

On NetBSD and other systems that use "pkgsrc"

pkgsrc should be offering a reasonably recent stable bogofilter release. See http://www.pkgsrc.org/ for information on pkgsrc.

On HP-UX

See the file doc/programmer/README.hp-ux in the source distribution.

Can I use the make command on my operating system?

Bogofilter has been successfully built on many operating systems using GNU make and the native make commands. However, bogofilter's Makefile doesn't work with some make commands.

GNU make is recommended for building bogofilter because we know it works. We cannot support less capable make commands. If your non-GNU make command can successfully build bogofilter, that's great. If you encounter problems, the right thing to do is install GNU make. If your non-GNU make can't build bogofilter, we're sorry but you're on your own. If it takes just a minor and clean patch to make it compatible, we might take it.

How do I build bogofilter as non-root user or for a non-standard installation prefix?

To install bogofilter to a non-standard path (as non-root user you don't have the permission to the normal paths), you need to provide the installation prefix when you run ./configure.

After downloading and unpacking the source code, run ./configure --prefix=PATH where PATH is the installation prefix for the generated files (binaries, man pages etc.). Then run the usual build commands — make && make check && make install.

How do I build bogofilter with patches?

If you need to apply patches, get the source code and unpack it using tar -xzf or gunzip | tar -xf - (as appropriate). Change to the source directory and run ./configure --prefix=PATH where PATH is the installation prefix for the generated files (binaries, man pages etc.). Apply your patches than run make && make install.

How do I make the executables smaller?

When space is tight, you can use make install-strip instead of make install. Doing this will save space, but crashes can't be debugged unless more information on reproducing the bug is provided to the developers.

datastore_db.c does not compile!

If you are configuring a data base path for instance with --with-libdb-prefix or via CPPFLAGS and LIBS, be sure to pass in an absolute path (with leading slash), a relative path will not work. Example: use --with-libdb-prefix=/usr/local/BerkeleyDB.4.2, but not --with-libdb-prefix=../BerkeleyDB.4.2

With which mail programs does bogofilter work?

Bogofilter is known to work with kmail, mozilla-mail, mutt, alpine, sylpheed-claws. A google search will help you find more information on using bogofilter with the mail program you use.

How do I use bogofilter with mutt?

Use a mail filter (procmail, maildrop, etc.) to filter mail into different folders based on bogofilter's return code and set mutt key bindings to train bogofilter on errors:

    macro index S "|bogofilter -s\ns=junkmail"  "Learn as spam and save to junk"
    macro pager S "|bogofilter -s\ns=junkmail"  "Learn as spam and save to junk"
    macro index H "|bogofilter -n\ns="          "Learn as ham and save"
    macro pager H "|bogofilter -n\ns="          "Learn as ham and save"

These will pipe the selected message through bogofilter, training a false-ham as spam or vice versa, then offer to save the message to a different folder.

How do I use bogofilter with Sylpheed Claws?

Add a filtering rule to run bogofilter on incoming messages and an action to perform if it's spam 

    condition:
    * test "bogofilter < %F"
    action:
    * move "#mh/YOUR_SPAM_BOX"

Note: this assumes that bogofilter is in your path!

Create two Claws actions - one for marking messages as spam and one for marking messages as ham. Use the "Mark As Spam" action for messages incorrectly classified as ham and use the "Mark As Ham" action for messages incorrectly classified as spam.

    Mark as ham / spam:
    * bogofilter -n -v -B "%f" (mark ham)
    * bogofilter -s -v -B "%f" (mark spam)

Another approach is to save incorrectly classified messages in a folder (or folders) and run a script like:

    #!/bin/sh
    CONFIGDIR=~/.bogofilter
    SPAMDIRS="$CONFIGDIR/spamdirs"
    MARKFILE="$CONFIGDIR/lastbogorun"
    for D in `cat "$SPAMDIRS"`; do
        find "$D" -type f -newer "$MARKFILE" -not -name ".sylpheed*"
    done|bogofilter -bNsv
    touch "$MARKFILE"

This script can be used as an action and/or made into a toolbar button. It will register as spam the messages in ${SPAMDIRS} that are newer than ${MARKFILE}.

Additional information is available at the Sylpheed-Claws's wiki.

Another approach is to run bogofilter from procmail, maildrop, etc and have Claws check the X-Bogosity header and filter messages into Spam and Unsure folders, e.g.:

    Condition:
        header "X-Bogosity" matchcase "Spam"
    Action:
        move "#mh/Mailbox/Spam"
    Condition:
        header "X-Bogosity" matchcase "Unsure"
    Action:
        move "#mh/Mailbox/Unsure"

Any messages in the Unsure folder should be used for training, as should messages incorrectly classified as ham or spam. The actions below will handle these cases:

    Register Spam:
        bogofilter -s < "%f"

    Register Ham:
        bogofilter -n < "%f"

    Unregister Spam:
        bogofilter -S < "%f"

    Unregister Ham:
        bogofilter -N < "%f"

To look inside the bogofilter scoring mechanism, the following diagnostic are useful:

    BogoTest -vv:
        bogofilter -vv < "%f"

    BogoTest -vvv:
        bogofilter -vvv < "%f"

Additional information on this approach is available here.

How do I use bogofilter with VM (an Emacs Mail tool)?

You need to include the separate file vm-bogofilter.el (included in bogofilter's contrib directory). The latest version of the file is at http://www.cis.upenn.edu/~bjornk/bogofilter/vm-bogofilter.el) in your emacs path.

Then, just add in your ~/.vm configuration file:

;; load bogofilter capabilities (spam)
;;
(require 'vm-bogofilter)

;; short-key for bogofilter
;; C (shift-c) means spam message
;; K (shift-k) means ham message
(define-key vm-mode-map "K" 'vm-bogofilter-is-spam)
(define-key vm-mode-map "C" 'vm-bogofilter-is-clean)

All the messages are filtered by bogofilter each time you check newly arrived e-mail. When you change the status of an e-mail, the bogofilter header is changed (X-Bogosity: header).

There is a limit: you cannot change multiple message headers at one time in VM; you have to do it message by message.

How do I use bogofilter with MH-E (the Emacs interface to the MH mail system)?

The default setting of the 'mh-junk-program' option is 'Auto-detect' which means that MH-E will automatically choose one of SpamAssassin, Bogofilter, or SpamProbe in that order. If, for example, you have both SpamAssassin and Bogofilter installed and you want to use BogoFilter, then you can set this option to 'Bogofilter'.

The 'J b' ('mh-junk-blacklist') command trains the spam program in use with the content of the range and then handles the message(s) as specified by the 'mh-junk-disposition' option. By default, this option is set to 'Delete Spam' but you can also specify the name of the folder which is useful for building a corpus of spam for training purposes.

In contrast, the 'J w' ('mh-junk-whitelist') command reclassifies a range of messages as ham if it were incorrectly classified as spam. It then refiles the message into the '+inbox' folder.

For more information, see the MH-E home page

bogofilter-1.2.4/doc/Makefile.in0000644000175000017500000004724312163573271014671 0ustar sezsez# Makefile.in generated by automake 1.12.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2012 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # $Id: Makefile.am 6984 2012-12-04 00:40:24Z m-a $ VPATH = @srcdir@ am__make_dryrun = \ { \ am__dry=no; \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \ | grep '^AM OK$$' >/dev/null || am__dry=yes;; \ *) \ for am__flg in $$MAKEFLAGS; do \ case $$am__flg in \ *=*|--*) ;; \ *n*) am__dry=yes; break;; \ esac; \ done;; \ esac; \ test $$am__dry = yes; \ } pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = doc DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/gsl.m4 \ $(top_srcdir)/m4/iconv.m4 $(top_srcdir)/m4/lib-ld.m4 \ $(top_srcdir)/m4/lib-link.m4 $(top_srcdir)/m4/lib-prefix.m4 \ $(top_srcdir)/m4/stdbool.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/src/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = SOURCES = DIST_SOURCES = am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } man1dir = $(mandir)/man1 am__installdirs = "$(DESTDIR)$(man1dir)" NROFF = nroff MANS = $(man_MANS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DB_EXT = @DB_EXT@ DB_TYPE = @DB_TYPE@ DEFAULT_CHARSET = @DEFAULT_CHARSET@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ ENCODING = @ENCODING@ EXEEXT = @EXEEXT@ EXE_EXT = @EXE_EXT@ GREP = @GREP@ GSL_CFLAGS = @GSL_CFLAGS@ GSL_CONFIG = @GSL_CONFIG@ GSL_LIBS = @GSL_LIBS@ HAVE_EXTENDED_PRECISION_REGISTERS = @HAVE_EXTENDED_PRECISION_REGISTERS@ HAVE_EXTERN_INLINE = @HAVE_EXTERN_INLINE@ HAVE_INLINE = @HAVE_INLINE@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LEX = @LEX@ LEXLIB = @LEXLIB@ LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@ LIBDB = @LIBDB@ LIBICONV = @LIBICONV@ LIBOBJS = @LIBOBJS@ LIBQDBM = @LIBQDBM@ LIBS = @LIBS@ LIBSQLITE3 = @LIBSQLITE3@ LIBTOKYOCABINET = @LIBTOKYOCABINET@ LTLIBDB = @LTLIBDB@ LTLIBICONV = @LTLIBICONV@ LTLIBOBJS = @LTLIBOBJS@ LTLIBQDBM = @LTLIBQDBM@ LTLIBSQLITE3 = @LTLIBSQLITE3@ LTLIBTOKYOCABINET = @LTLIBTOKYOCABINET@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NSGMLS = @NSGMLS@ OBJEXT = @OBJEXT@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PERL = @PERL@ RANLIB = @RANLIB@ RPMBUILD = @RPMBUILD@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STATICLDFLAGS = @STATICLDFLAGS@ STATIC_DB = @STATIC_DB@ STRIP = @STRIP@ USE_TRANSACTIONS = @USE_TRANSACTIONS@ USE_UNICODE = @USE_UNICODE@ VERSION = @VERSION@ XMLLINT = @XMLLINT@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_cv_enable_xmlto = @ac_cv_enable_xmlto@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ transformed_bogofilter = @transformed_bogofilter@ transformed_bogoutil = @transformed_bogoutil@ # Tell BSD make(1) to not remake the .1in and .htmlin files. SUFFIXES = .1 .1in .htmlin .html # requires: # xmllint (libxml2) # xmlto (cyberelk.net) # nsgmls (opensp) # what to build man_MANS = bogofilter.1 bogoutil.1 bogoupgrade.1 bogolexer.1 bogotune.1 \ bf_copy.1 bf_tar.1 bf_compact.1 html_MANS = bogofilter.html bogoutil.html bogoupgrade.html \ bogolexer.html bogotune.html \ bf_copy.html bf_tar.html bf_compact.html CLEANFILES = $(man_MANS) $(html_MANS) HTML_DOCS = bogofilter-faq.html bogofilter-faq-fr.html bogofilter-faq-it.html bogotune-faq.html XHTML_DOCS = bogofilter-faq-bg.xhtml # what to distribute EXTRA_DIST = \ bogofilter.xml bogofilter.1in bogofilter.htmlin \ bogolexer.xml bogolexer.1in bogolexer.htmlin \ bogotune.xml bogotune.1in bogotune.htmlin \ bogoupgrade.xml bogoupgrade.1in bogoupgrade.htmlin \ bogoutil.xml bogoutil.1in bogoutil.htmlin \ bf_compact.xml bf_compact.1in bf_compact.htmlin \ bf_copy.xml bf_copy.1in bf_copy.htmlin \ bf_tar.xml bf_tar.1in bf_tar.htmlin \ $(HTML_DOCS) \ $(XHTML_DOCS) \ bogofilter-tuning.HOWTO.html \ bogofilter-SA-2002-01 bogofilter-SA-2004-01 \ bogofilter-SA-2005-01 bogofilter-SA-2005-02 \ bogofilter-SA-2010-01 \ bogofilter-SA-2012-01 \ integrating-with-postfix \ integrating-with-qmail \ programmer/OS2/configure.os2 \ programmer/README.freebsd programmer/README.hp-ux \ programmer/README.RISC-OS programmer/README.memory-checking \ programmer/README.osx \ programmer/RISC-OS/src/Makefile \ programmer/RISC-OS/gsl/Makefile \ rpm.notes.BerkeleyDB \ README.db README.sqlite \ README.validation all: all-am .SUFFIXES: .SUFFIXES: .1 .1in .htmlin .html .xml $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign doc/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign doc/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): install-man1: $(man_MANS) @$(NORMAL_INSTALL) @list1=''; \ list2='$(man_MANS)'; \ test -n "$(man1dir)" \ && test -n "`echo $$list1$$list2`" \ || exit 0; \ echo " $(MKDIR_P) '$(DESTDIR)$(man1dir)'"; \ $(MKDIR_P) "$(DESTDIR)$(man1dir)" || exit 1; \ { for i in $$list1; do echo "$$i"; done; \ if test -n "$$list2"; then \ for i in $$list2; do echo "$$i"; done \ | sed -n '/\.1[a-z]*$$/p'; \ fi; \ } | while read p; do \ if test -f $$p; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; echo "$$p"; \ done | \ sed -e 'n;s,.*/,,;p;h;s,.*\.,,;s,^[^1][0-9a-z]*$$,1,;x' \ -e 's,\.[0-9a-z]*$$,,;$(transform);G;s,\n,.,' | \ sed 'N;N;s,\n, ,g' | { \ list=; while read file base inst; do \ if test "$$base" = "$$inst"; then list="$$list $$file"; else \ echo " $(INSTALL_DATA) '$$file' '$(DESTDIR)$(man1dir)/$$inst'"; \ $(INSTALL_DATA) "$$file" "$(DESTDIR)$(man1dir)/$$inst" || exit $$?; \ fi; \ done; \ for i in $$list; do echo "$$i"; done | $(am__base_list) | \ while read files; do \ test -z "$$files" || { \ echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(man1dir)'"; \ $(INSTALL_DATA) $$files "$(DESTDIR)$(man1dir)" || exit $$?; }; \ done; } uninstall-man1: @$(NORMAL_UNINSTALL) @list=''; test -n "$(man1dir)" || exit 0; \ files=`{ for i in $$list; do echo "$$i"; done; \ l2='$(man_MANS)'; for i in $$l2; do echo "$$i"; done | \ sed -n '/\.1[a-z]*$$/p'; \ } | sed -e 's,.*/,,;h;s,.*\.,,;s,^[^1][0-9a-z]*$$,1,;x' \ -e 's,\.[0-9a-z]*$$,,;$(transform);G;s,\n,.,'`; \ dir='$(DESTDIR)$(man1dir)'; $(am__uninstall_files_from_dir) tags: TAGS TAGS: ctags: CTAGS CTAGS: cscope cscopelist: distdir: $(DISTFILES) @list='$(MANS)'; if test -n "$$list"; then \ list=`for p in $$list; do \ if test -f $$p; then d=; else d="$(srcdir)/"; fi; \ if test -f "$$d$$p"; then echo "$$d$$p"; else :; fi; done`; \ if test -n "$$list" && \ grep 'ab help2man is required to generate this page' $$list >/dev/null; then \ echo "error: found man pages containing the 'missing help2man' replacement text:" >&2; \ grep -l 'ab help2man is required to generate this page' $$list | sed 's/^/ /' >&2; \ echo " to fix them, install help2man, remove and regenerate the man pages;" >&2; \ echo " typically 'make maintainer-clean' will remove them" >&2; \ exit 1; \ else :; fi; \ else :; fi @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook check-am: all-am check: check-am all-am: Makefile $(MANS) installdirs: for dir in "$(DESTDIR)$(man1dir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-man install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-man1 install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-man uninstall-man: uninstall-man1 .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic dist-hook \ distclean distclean-generic distdir dvi dvi-am html html-am \ info info-am install install-am install-data install-data-am \ install-dvi install-dvi-am install-exec install-exec-am \ install-html install-html-am install-info install-info-am \ install-man install-man1 install-pdf install-pdf-am install-ps \ install-ps-am install-strip installcheck installcheck-am \ installdirs maintainer-clean maintainer-clean-generic \ mostlyclean mostlyclean-generic pdf pdf-am ps ps-am uninstall \ uninstall-am uninstall-man uninstall-man1 all: $(man_MANS) $(html_MANS) # bogofilter.cf.example # strlcat.3 strlcpy.3 .1in.1: sed -e "s|[@]sysconfdir@|$(sysconfdir)|g" \ -e "s|[@]bindir@|$(bindir)|g" <$< >$@ \ || { rm -f $@ ; exit 1 ; } # same as .1in.1: above, but POSIX doesn't allow two targets on one line. .htmlin.html: sed -e "s|[@]sysconfdir@|$(sysconfdir)|g" \ -e "s|[@]bindir@|$(bindir)|g" <$< >$@ \ || { rm -f $@ ; exit 1 ; } @ENABLE_XMLTO_TRUE@dist-hook: @ENABLE_XMLTO_TRUE@ @if [ ! -f catalog ] ; then \ @ENABLE_XMLTO_TRUE@ echo ; echo "Warning: 'catalog' file not present; see 'README.validation'". ; echo ; else \ @ENABLE_XMLTO_TRUE@ case "$(MFLAGS)" in *s*) : ;; *) echo >&2 "validating $(HTML_DOCS)" ;; esac ; \ @ENABLE_XMLTO_TRUE@ ( set -e ; for i in $(HTML_DOCS) ; do $(NSGMLS) -s $(srcdir)/$$i \ @ENABLE_XMLTO_TRUE@ || { echo >&2 "ERROR: $$i does not validate." ; exit 1 ; } ; done ) ; \ @ENABLE_XMLTO_TRUE@ fi # Use Perl to fix up br0ken 0xa0 characters that the XML DocBook style # sheets emit instead of "\ " for roff or " " for HTML, # respectively. @ENABLE_XMLTO_TRUE@.xml.htmlin: @ENABLE_XMLTO_TRUE@ $(XMLLINT) --noout --postvalid $< @ENABLE_XMLTO_TRUE@ if test -f $(srcdir)/$@ && test $(srcdir)/$@ -nt $< ; then \ @ENABLE_XMLTO_TRUE@ cp $(srcdir)/$@ . ; else \ @ENABLE_XMLTO_TRUE@ if xmlto html-nochunks $< ; then f=$@ ; mv $${f%%in} $@ ; else rm -f $@ ; exit 1 ; fi ; \ @ENABLE_XMLTO_TRUE@ perl -pl -e "s|\xA0| |g" -i $@ || { rm -f $@ ; exit 1 ; } \ @ENABLE_XMLTO_TRUE@ fi @ENABLE_XMLTO_TRUE@.xml.1in: @ENABLE_XMLTO_TRUE@ $(XMLLINT) --noout --postvalid $< @ENABLE_XMLTO_TRUE@ if test -f $(srcdir)/$@ && test $(srcdir)/$@ -nt $< ; then \ @ENABLE_XMLTO_TRUE@ cp $(srcdir)/$@ . ; else \ @ENABLE_XMLTO_TRUE@ if xmlto man $< ; then f=$@ ; mv $${f%in} $@ ; else rm -f $@ ; exit 1 ; fi ; \ @ENABLE_XMLTO_TRUE@ perl -pl -e "s|\xA0|\\ |g" -i $@ || { rm -f $@ ; exit 1 ; } \ @ENABLE_XMLTO_TRUE@ fi @ENABLE_XMLTO_FALSE@dist-hook: @ENABLE_XMLTO_FALSE@ true @ENABLE_XMLTO_FALSE@.xml.1in: @ENABLE_XMLTO_FALSE@ @echo 1>&2 @ENABLE_XMLTO_FALSE@ @echo 1>&2 "You need xmlto to build bogofilter documentation." @ENABLE_XMLTO_FALSE@ @echo 1>&2 @ENABLE_XMLTO_FALSE@ @exit 1 @ENABLE_XMLTO_FALSE@.xml.htmlin: @ENABLE_XMLTO_FALSE@ @echo 1>&2 @ENABLE_XMLTO_FALSE@ @echo 1>&2 "You need xmlto to build bogofilter documentation." @ENABLE_XMLTO_FALSE@ @echo 1>&2 @ENABLE_XMLTO_FALSE@ @exit 1 .PHONY: check checkx checkx: @if echo ' </head><body /> </html>' | $(XMLLINT) --noout --nonet --postvalid - 2>/dev/null ; then \ set +e ; fail=0 ; for i in $(XHTML_DOCS) ; do if $(XMLLINT) --noout --postvalid $(srcdir)/$$i ; then echo PASS: $$i ; else echo FAIL: $$i: ; fail=1 ; fi ; done ; \ if test "$$fail" = 1 ; then echo >&2 "*** XHTML document invalid ***" ; false ; fi ; \ else echo >&2 "*** Not validating XHTML, XHTML 1.1 DTD not or improperly installed ***" ; fi check: checkx @if echo '<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"><HTML><HEAD><TITLE>

' | $(NSGMLS) -s 2>/dev/null; then \ set +e ; fail=0 ; for i in $(HTML_DOCS) ; do if $(NSGMLS) -s $(srcdir)/$$i ; then echo PASS: $$i ; else echo FAIL: $$i: ; fail=1 ; fi ; done ; \ else echo >&2 "*** Not validating HTML, nsgmls/HTML DTDs improperly installed ***" ; fi ; \ if test "$$fail" = "1" ; then echo >&2 "*** HTML document invalid ***" ; false ; fi # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: bogofilter-1.2.4/doc/bogofilter-faq-bg.xhtml0000644000175000017500000026106212163572307017165 0ustar sezsez Bogofilter ВъпроÑи

Bogofilter ВъпроÑи

Официален верÑии: в английÑки или Franais или италианÑки злато българÑки
Отговорник: Дейвид Relson <relson@osagesoftware.com>
Преводач: Ð¤Ð°Ð±Ñ€Ð¸Ñ Prigent <Fabrice.Prigent@univ-tlse1.fr>

Този документ е предназначен да ни отговори на въпроÑите за frquemment bogofilter пози.

Какво е bogofilter?

Bogofilter Bayesian филтър е бързо надолу за работата на
Пол Греъм
в ÑтатиÑта Ñи план Ñрещу Ñпам. Bogofilter използва алгоритъм на Ñредната gomtrique
Gary Robinson Ñ Ð¿Ñ€Ð¾Ð¼ÐµÐ½Ð¸ mthode Фишър (chi2)
за клаÑифициране на Ñпам и бутове (NDT: липÑата на Ñпам поща).

Уеб Ñтраницата на bogofilter в SourceForge е фокуÑна точка за вÑички реÑурÑи на bogofilter.

Bogofilter Ñ‚ кр от Eric S. Raymond на 19 AOT 2002 година. Ð¢Ñ Ð¿Ñ€Ð¸Ð´Ð¾Ð±Ð¸ популÑрноÑÑ‚, тъй като Ñептември 2002 г., както и много програмиÑти Ñа започнали да учаÑтват.

Файлът ÐОВИÐИ ОпиÑва иÑториÑта на верÑии на bogofilter.

Bogo-какво?

Bogofilter е един вид bogomtre
(bogometer)
или филтър бъг
(bogon-филтър) е, че Ñ‚Ñ Ñе опитва да Ñе идентифицират фалшиви имейли
(фалшиви)

чрез измерване на техните Bogos
(Bogosity).

Как bogofilter?

Обърнете внимание на първата чаÑÑ‚
ТЕОРИЯ ÐРРÐБОТРна ръководÑтвото за въвеждане. ОÑновниÑÑ‚ източник за разбиране е ÑтатиÑта на Gary Robinson в Linux Journal
“ÑтатиÑтичеÑки подход към Спам проблем”

(A ÑтатиÑтичеÑки подход към проблема на Ñпам).

APRS четете това, вероÑтно имате нÑкакви въпроÑи. ПЪРВИТЕ може да бъде “bogofilter той наиÑтина е Bayesian филтър за Ñпам?” Bogofilter е ниÑко на Thorma Ð‘ÐµÐ¹Ñ Ð¸ го използва в чаÑÑ‚ първа на изчиÑление, както и други ÑтатиÑтики mthodes Ñлед това. Следователно можем да кажем, че това е Ñпам филтър на Ð‘ÐµÐ¹Ñ ÑтатиÑтика Ñ ÐµÐ´Ð¸Ð½ аромат.

Други въпроÑи, които могат да Ñе отнаÑÑÑ‚ към hypothses нападение Ð²Ð°Ñ Ð¸Ð»Ð¸ prrequis на Тората БейÑ. Ð’ rponses Ñа проÑти: “Ðе, те не Ñа изпълнени” и “Ðа кого му пука, докато Ñ‚Ñ Ñ€Ð°Ð±Ð¾Ñ‚Ð¸.” По-rponse labore Ñпоменава, че оÑновната предпоÑтавка, коÑто казва “имейл Ñлучаен образ е Ñбор от думи, напълно indpendants вÑеки друг” е изнаÑилване. Има нÑколко меÑта, където тази практика Ñе Ñвободи Ñ Ð¢Ð¾Ñ€Ð°. ÐÑкои от Ñ‚ÑÑ… Ñа през цÑлото време Изпратено други dpendent на Manir използвате bogofilter:

  • Думи в едно електронна поща по никакъв начин не indpendants. Във вÑички езици е предимÑтво, дори обратното.
  • Думите не Ñа utiliss произволно изображение, дори и ако нÑкои Ñпамърите използват произволни думи изображението.
  • ПълниÑÑ‚ текÑÑ‚ на обучение, или чрез Ñлучайна извадка изображение, Ñледвайки принципите на БейÑ. Изберете ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð·Ð° практика нарушава предположение, че ÑъобщениÑта utiliss за обучение Ñа предÑтавителна извадка на Ñлучаен Reus изображение ÑъобщениÑ. Този принцип е нарушено от автоматично обновÑване bogofilter (Ðргументът Ñ thresh_update), обучение по грешка, или нÑкакъв подобен подход.
  • Същото важи, ако използвате едно и Ñъщо поÑлание повече от веднъж.
  • От друга проблеми могат да бъдат повдигнати от факта на промÑната в базата данни чрез премахване на Ñимволи (Ñ Ð¿Ð¾Ð¼Ð¾Ñ‰Ñ‚Ð° на bogoutil Ñ-а или-C).
  • Ð¡ÑŠÑ ÑигурноÑÑ‚ има други.

Когато мъжът Ñтраница обÑÑнÑва, bogofilter Ñе опитва да Ñе Ñправи Ñ Ð²Ð»Ð¸Ñнието на тези ngative hypothses не Ñе Ñпазват. ÐÑкои казват, че “картата Ralite gnral работÑÑ‚ в наша полза” (член на Гари). Други казват, че дори в този Ñлучай, ние не Ñ‚Ñ€Ñбва да Ñтане твърде картера hypothses база. Ð’ дейÑтвителноÑÑ‚, о не знае наиÑтина. ПроÑто имайте предвид, че ако “зареди муле”, проблемът ще възникнат. Подходът на CL bogofilter е: това, което най-важното е, че той работи в Ñвета REL.

Сега, когато имате тон prvenus, да Ñе забавлÑват и използването bogofilter на най-добрите от ваÑ.

ПощенÑки ÑпиÑъци

ПонаÑтоÑщем ÑъщеÑтвуват четири пощенÑки ÑпиÑъци за bogofilter (на английÑки):

ÐÐ´Ñ€ÐµÑ ÑпиÑъци Връзки ОпиÑание
bogofilter-announce@bogofilter.org [Ðбонамент]
[архиви: пощальон, Gmane] 		O ÑпиÑък на реклами Ñа новите верÑии.
bogofilter@bogofilter.org [Ðбонамент]
[архиви: пощальон, Gmane] 		Ð gnraliste пощенÑÐºÐ¸Ñ ÑпиÑък на bogofilter.
bogofilter-dev@bogofilter.org [Ðбонамент]
[архиви: пощальон, Gmane] 		БорÑа за ÑпиÑък на петна, на dveloppement и техничеÑки диÑкуÑии.
bogofilter-cvs@lists.sourceforge.net [Ðбонамент]
[Ðрхив]		 Ð’ ÑпиÑъка, за да обÑви промени в кода на CVS архив.

Ðачинаещи обучение как bogofilter?

За да Ñе клаÑифицират ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ ÐºÐ°Ñ‚Ð¾ шунка или Ñпам, bogofilter Ñ‚Ñ€Ñбва да научи вашата поща. За начало, най-добре е да има Ñ‚Ñло (възможно най-широка) на Ð²Ð°ÑˆÐ¸Ñ ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ SR на държавата, шунка или Ñпам. (Грешки тук ще доведе до проблем по-къÑно, така че бъдете внимателни;-)). Бъдете внимателни, използвайте Ñамо вашата електронна поща. Използването на друг орган (като орган по интернет), може да доведе до bogofilter да изготви погрешни Ð·Ð°ÐºÐ»ÑŽÑ‡ÐµÐ½Ð¸Ñ Ð’ крайна Ñметка, целта ви е да го накара да разбере вашето мнение.

След като Ñте Ñи ÐºÐ¾Ñ€Ð¿ÑƒÑ Ð½Ð° Ñпам и шунка, имате четири възможноÑти за избор. Във вÑички Ñлучаи това работи най-добре, ако Ñи за обучение, (корпуÑа по-горе) е consquente. ÐŸÐ»ÑŽÑ ÐµÐ´Ð¸Ð½ ÐºÐ¾Ñ€Ð¿ÑƒÑ Ðµ малък, толкова по-голÑм броÑÑ‚ на грешките, ще bogofilter в производÑтвото. Да предположим, че Ñ‚Ñлото ви е в два файла mbox: ham.mbox и spam.mbox.

  • Mthode 1) Full Обучение: Entran bogofilter Ñ Ð²Ñичките Ñи ÑъобщениÑ. Ð’ Ð½Ð°ÑˆÐ¸Ñ Ð¿Ñ€Ð¸Ð¼ÐµÑ€:

        bogofilter -s < spam.mbox
	bogofilter -n < ham.mbox

Забележка: директориÑта допринеÑоха bogofilter Ñъдържа две Ñкриптове, които и двете използват техника за обучение по грешка. Тази техника Ð´Ð¾Ð±Ð°Ð²Ñ ÑтойноÑÑ‚ и вÑÑко Ñъобщение до базата данни, че поÑланиÑта, които Ñа били на ÑтойноÑÑ‚ лош тон (ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð¼Ð°Ñ€ÐºÐ¸Ñ€Ð°Ð½Ð¸ като неÑигурни, шунка е Ñтрувало като Ñпам или обратното). Целта е да Ñе CRER база данни от думи наиÑтина
ncessaires правилно да клаÑифицира ÑъобщениÑ. Rsultante до базата данни е по-малка от пълната обучение.

  • Mthode 2) Използвайте Ñкрипта bogominitrain.pl (в допринеÑоха директориÑ). Той Ð¼Ð½ÐµÐ½Ð¸Ñ ÑÑŠÑ‰Ð¸Ñ Ð¾Ð±Ñ…Ð²Ð°Ñ‚ като ÑтойноÑÑ‚ вашата пощенÑка ÐºÑƒÑ‚Ð¸Ñ Ñ„Ð°Ð¹Ð»Ð¾Ð²Ðµ. Вие Ñ‚Ñ€Ñбва да използвате опциÑта-F ще инÑтруктира работа rpter Ñкрипт, докато, че вÑички ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ñа правилно classs. (Ðко ncessaire, дори можете да регулирате нивото на ÑигурноÑÑ‚). Тъй като Ñкрипт гарантира, че ÑраÑнали база даде “вÑичко” обучението Ñи ÐºÐ¾Ð»ÐµÐºÑ†Ð¸Ñ (Ñ Ñ‚Ð¾Ñ‡Ð½Ð¾ÑÑ‚ по ваш избор), Ñ‚Ñ Ñ€Ð°Ð±Ð¾Ñ‚Ð¸ добре TRS. Можете да използвате-oЗа да Ñъздадете Ð»Ð¸Ð½Ð¸Ñ Ð½Ð° ÑигурноÑтта около “SPAM_CUTOFF” spam_cutoff = 0,6 може да иÑкате да Ñе оцени вÑеки шунка в колекциÑта Ñи под 0,3 и вÑички Ñпам дел 0.9. Ð’ Ð½Ð°ÑˆÐ¸Ñ Ð¿Ñ€Ð¸Ð¼ÐµÑ€ е:

        bogominitrain.pl -fnv ~/.bogofilter ham.mbox spam.mbox '-o 0.9,0.3'

  • Mthode 3) Използвайте Ñкрипта randomtrain (в допринеÑоха директориÑ). СценариÑÑ‚ gnre ÑпиÑък на вÑички ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð² пощенÑката кутиÑ, разбъркват в ÑпиÑъка и ÑтойноÑтта на вÑÑко Ñъобщение, Ñ Ð¾Ð±ÑƒÑ‡ÐµÐ½Ð¸Ðµ, както ncessaire. Ð’ Ð½Ð°ÑˆÐ¸Ñ Ð¿Ñ€Ð¸Ð¼ÐµÑ€:

        randomtrain -s spam.mbox -n ham.mbox

    Що Ñе отнаÑÑ Ð´Ð¾ mthode 4, Ñ‚Ñ Ñ€Ð°Ð±Ð¾Ñ‚Ð¸ по-добре, ако Ñе започне Ñ Ð¾Ð±ÑƒÑ‡ÐµÐ½Ð¸Ðµ ÐºÐ¾Ñ€Ð¿ÑƒÑ Ð¾Ñ‚ нÑколко хилÑди ÑъобщениÑ. Това ще ви даде една база данни на по-complte и значително по-големи.

  • Mthode 4) Ðко имате доÑтатъчно Ñпам и шунка в Ñ‚Ñлото Ñи, “Резервиран” 10000 Ñпамове и 10 000 бутове във файлове рангоута mbox, Ñлед това използвайте ÐºÐ¾Ñ€Ð¿ÑƒÑ Ð·Ð° Entran. След това използвайте bogofilter за клаÑифициране на оÑтаналите Ñпама и шунки. Вземете вÑÑко Ñъобщение или като неправилно Ñпечели неÑигурно положение, и ги използват за нови знаниÑ. Това дава на най-добрите mthode mthode евентуална диÑкриминациÑ. Ето две малки Ñкриптове, които могат да бъдат използвани за клаÑифициране на ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ utiliss “лоши lves”.

        #! /bin/sh
	  #  class3 -- classe un message en mauvais, bon ou incertain
	  cat >msg.$$
	  bogofilter $* <msg.$$
	  res=$?
	  if [$res = 0]; then
	      cat msg.$$ >>corpus.bad
	  elif [$res = 1]; then
	      cat msg.$$ >>corpus.good
	  elif [$res = 2]; then
	      cat msg.$$ >>corpus.unsure
	  fi
	  rm msg.$$
        #! /bin/sh
	  # classify -- Place tous les messages dans un fichier mbox  l'aide de class3
	  src=$1;
	  shift
	  formail -s class3 $* <$src

    Ð’ Ð½Ð°ÑˆÐ¸Ñ Ð¿Ñ€Ð¸Ð¼ÐµÑ€ (APRS първоначалното обучение):

        classify spam.mbox [bogofilter options]
	  bogofilter -s < corpus.good
	  rm -f corpus.*
	  classify ham.mbox [bogofilter options]
	  bogofilter -n < corpus.bad
	  rm -f corpus.*

Сравнение на тези mthodes

Важно е да Ñе разбере consquences на методите, които Ñа dcrire. За пълно обучение, както и в 1 и 4, произведени mthodes база данни за повече, отколкото би една тренировка Ñ mthodes 2 или 3. Ðко вашата база данни Ñ‚Ñ€Ñбва да Ñе дават малки (например, защото на квоти), използвайте mthodes 2 или 3.

Обучението Ñ mthode 1 е най-бързо. Обучение по грешка (както в mthodes ОпиÑва 2,3 и 4) е ефективна, но обучението е plutt бавно.

Как да започнем обучение Ñ mbox и maildir?

Първоначално обучение Ñ Ñ„Ð¾Ñ€Ð¼Ð°Ñ‚ mbox:

    bogofilter -M -s -I ~/mail/Spam
	bogofilter -M -n -I ~/mail/NonSpam

Първоначално обучение Ñ maildir формат:

    bogofilter -s -B ~/Maildir/.Spam
	bogofilter -n -B ~/Maildir/.NonSpam

Обучение по грешка Ñ Ñ„Ð¾Ñ€Ð¼Ð°Ñ‚ mbox:

    bogofilter -M -Ns -I ~/mail/Missed_Spam
	bogofilter -M -Sn -I ~/mail/False_Spam

Обучение по грешка Ñ Ñ„Ð¾Ñ€Ð¼Ð°Ñ‚ maildir:

    bogofilter -s -B ~/Maildir/.Missed_Spam
	bogofilter -n -B ~/Maildir/.False_Spam

Как мога да Ñе поддържа добра оÑтрота?

Bogofilter ще правÑÑ‚ грешки от време на време. Ето защо обучението е важно rgulier. Има два оÑновни mthodes да го направÑÑ‚. Premire, можете да Entran Ñ Ð²ÑÑко ново Ñъобщение (Ñ Ð¿Ð¾Ð¼Ð¾Ñ‰Ñ‚Ð° на U-опциÑ). Deuximement, можете да направите на грешки Entran.

Ð’ допълнение, Вие може да изгради база данни пъти, като при голÑма нова функционалноÑÑ‚ Ñе Ð´Ð¾Ð±Ð°Ð²Ñ bogofilter. След това може да бъде полезна за Ð´ÐµÐ½Ñ ÐºÐ¾Ñ€Ð¿ÑƒÑ rgulirement обучение.

Bogofilter винаги Ñи върши най-добре Ñ Ð½Ð°Ð»Ð¸Ñ‡Ð½Ð°Ñ‚Ð° информациÑ. Въпреки това, той ще прави грешки, като клаÑифициране на шунка като Ñпам (фалшиво положителни) или Ñпам като шунка (фалшиво ngatifs). Rduire за вероÑтноÑтта от rapparition на грешка, Ñ‚Ñ Ñ‰Ðµ ncessaire да Ñе обучават bogofilter Ñ Ð¿Ð¾Ð³Ñ€ÐµÑˆÐ½Ð¾ поÑлание. Ðко Ñъобщението е неправилно клаÑифицирани като Ñпам, използвайте-nще Ñе интегрират като шунка. Използвайте-s ще интегрира като Ñпам.

Bogofilter има Ð¾Ð¿Ñ†Ð¸Ñ -u, което автоматично поÑÑ‚Ð°Ð²Ñ ÑпиÑък от думи, дни Ñлед вÑÑка оценка на ÑъобщениÑта. Като bogofilter понÑкога прави грешки, това е mthode inconvnient на DGRAD обучение Ñ Ð³Ñ€ÐµÑˆÐ½Ð¸ входа. Ще Ñ‚Ñ€Ñбва да разгледаме и правилно frquemment. КорекциÑта може да Ñе използва-Sn за промÑна на клаÑификациÑта на Ñпам Ñъобщение като шунка и -Ns за промÑна на шунка като Ñпам.

Коригира misclassified Ñъобщение може да повлиÑе на клаÑирането на другите ÑъобщениÑ. ОÑвен това базата данни ще предоÑÑ‚Ð°Ð²Ñ Ð½Ð° малките, толкова по-голÑма вероÑтноÑтта за грешка обучение неправилна клаÑификациÑ.

Използването на mthode 2 или 3 (по-горе) може да компенÑира този ефект. Repti обучение Ñ Ð¿ÑŠÐ»ÐµÐ½ ÐºÐ¾Ñ€Ð¿ÑƒÑ (включително ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð´Ð¾Ð±Ð°Ð²ÐµÐ½Ð¸ Ñлед Ð¿Ñ€ÐµÐ´Ð¸ÑˆÐ½Ð¸Ñ Ð¶Ð¸Ð²Ð¾Ñ‚). Това ще добави ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð´Ð¾ базата данни Ñ Ñ†ÐµÐ» поÑтигане на ново равновеÑие, вероÑтно преодолÑване на ефекта на “ÑвръхкомпенÑациє.

Ралтернатива stratgie, въз оÑнова на mthode 4 от Ð¿Ñ€ÐµÐ´Ð¸ÑˆÐ½Ð¸Ñ Ñ€Ð°Ð·Ð´ÐµÐ» е: Периодично Ñе блокове на ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð¸ използването на Ñкриптове на mthode 4, да ги клаÑифицира. Ръчно Ñканиране Ñпам, шунка и неÑигурно, коригиране на грешки, и неÑигурната бутове Sparer и Ñпам. Докато не Ñа Ñпам 10000 и 10000 шунка в обучението,, Entran Ñ Ð±ÑƒÑ‚Ð¾Ð²Ðµ, Ñпам, и грешки и Ð½Ð°ÐºÑ€Ð°Ñ Ð½ÐµÑигурноÑÑ‚. По-къÑно Ñамо Ñ Ð½ÐµÑигурни и, игнорирайки поÑланиÑта, които bogofilter правилно клаÑ.

Имайте предвид, че rgulirement изпълнете:

    bogoutil -d wordlist.db | bogoutil -l wordlist.db.new
	mv wordlist.db wordlist.db.prv
	mv wordlist.db.new wordlist.db

или за файлове и spamlist.db goodlist.db (ако използвате bogofilter Ñ Ñ€Ð°Ð½Ð³Ð¾ÑƒÑ‚Ð° дума ÑпиÑъци). Това ще компреÑирате Данни за заемане Ñамо минимален ncessaire диÑково проÑтранÑтво.

Какво bogofilter файлов формат го разбира?

Bogofilter включва традиционни mbox, Maildir и МЗ. Bogofilter не поддържа поддиректории, Ñ‚Ñ€Ñбва изрично да им ÑпиÑък, ако имате директории Maildir++ или МЗ – Ñамо да Ñпомена, Ð¿ÑŠÐ»Ð½Ð¸Ñ Ð¿ÑŠÑ‚ към поддиректориите.

За неподдържани формати, Ñ‚Ñ€Ñбва да конвертирате файла в един формат bogofilter разбира. Mbox чеÑто е удобен, защото Ñ‚Ñ Ð¼Ð¾Ð¶Ðµ да бъде директно enovy bogofilter.

Ðапример, за да го превърне в mbox формат mbx UW-IMAP/PINE:

    mailtool copy /full/path/to/mail.mbox '#driver.unix//full/path/to/mbox'

или:

    for MSG in /full/path/to/maildir/* ; do
	    formail -I Status: < "$MSG" >> /full/path/to/mbox
	done

Какво е значението на производÑтвото на многоÑловно bogofilter?

Можем да кажем, bogofilter за показване на Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð·Ð° оценката на едно Ñъобщение от техничеÑката работна група, като Ñе обадите на потребителÑки наÑтройки Ñ “-V”, “Ð’Ð’-”, “Ð’Ð’Ð’-” или “-R”.

  • Използване на “-V”, gnre bogofilter Ð·Ð°Ð³Ð»Ð°Ð²Ð½Ð¸Ñ Ñ€ÐµÐ´ “X-Bogosity”, например 
      X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
  • С помощта на “Ð’Ð’-” bogofilter gnre хиÑтограма, например 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
      int  cnt    prob   spamicity  histogram
     0.00   29  0.000209  0.000052  #############################
     0.10    2  0.179065  0.003425  ##
     0.20    2  0.276880  0.008870  ##
     0.30   18  0.363295  0.069245  ##################
     0.40    0  0.000000  0.069245
     0.50    0  0.000000  0.069245
     0.60   37  0.667823  0.257307  #####################################
     0.70    5  0.767436  0.278892  #####
     0.80   13  0.836789  0.334980  #############
     0.90   32  0.984903  0.499835  ################################

    Изпратено вÑеки ред интервал, броÑÑ‚ на Ñимволите (lment NDT минимално лечение, gnralement дума) Ñ Ð¾Ñ†ÐµÐ½ÐºÐ° в този диапазон, Ñредната вероÑтноÑÑ‚ за Ñпам за тези Ñимволи, оценката на “spamicit” на Ñъобщението (за Ñимволи на този интервал или предишните) и бар за Ð±Ñ€Ð¾Ñ Ð½Ð° Ñимволите.

    Ð’ хиÑтограма по-горе, има много Ñимволи ниÑка оценка и виÑок рейтинг. Те s’quilibrent да Ñе даде “spamicit” на 0.500000

  • С помощта на “Ð’Ð’Ð’-” произвежда ÑпиÑък на вÑички

    на Ñимволите в Ñъобщението, Ñ Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð·Ð° вÑеки един. Ðапример:

      X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
                        n    pgood     pbad      fw     U
  "which"              10  0.208333  0.000000  0.000041+
  "own"                 7  0.145833  0.000000  0.000059+
  "having"              6  0.125000  0.000000  0.000069+
 ...
  "unsubscribe.asp"     2  0.000000  0.095238  0.999708+
  "million"             4  0.000000  0.190476  0.999854+
  "copy"                5  0.000000  0.238095  0.999883+
  N_P_Q_S_s_x_md      138  0.00e+00  0.00e+00  5.00e-01
                           1.00e-03  4.15e-01  0.100

    Колоните даде Ñледните плакати:

    “…”
    на токен в
    N
    БроÑÑ‚ на пъти по-Ñимволичен тон Ñе ÑблъÑка по време на обучение
    pgood
    ДÑл на добри ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ (шунка), Ñъдържащ знак
    pbad
    ДÑл на лошите ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ (Ñпам), Ñъдържащи този знак
    FW
    ИндекÑÑŠÑ‚ на хвърлÑне на хайвера РобинÑън, който Ñъчетава pgood pbad и да Ñе даде ÑтойноÑÑ‚ да бъде близо до нула, ако едно Ñъобщение, Ñъдържащо знак е вероÑтно да бъде шунка, и в близоÑÑ‚ до един, ако има вероÑтноÑÑ‚ за Ñпам.
    U
    ” + “Ðко този знак допринаÑÑ Ð·Ð° ÐºÑ€Ð°Ð¹Ð½Ð¸Ñ Ñ€ÐµÐ·ÑƒÐ»Ñ‚Ð°Ñ‚,” - “друго. Символ е изключено, когато резултатът е по-малко от “min_dev” 0.5. min_dev е параметър.

    ПоÑледниÑÑ‚ ред показва:

    • Общите Ñуми на колони rsultats
    • СтойноÑтите на paramtres РобинÑън е и
      X и на min_dev
  • Използвайте “-R” произвежда на изхода на “Ð’Ð’Ð’-”, опиÑва по-горе още две supplmentaires колони:
    invfwlog
    логаритъм на FW
    fwlog
    логаритъм на (1-FW)

    ПродукциÑта на “-R” е да Ñе използва Добавен Ñ ÐµÐ·Ð¸ÐºÐ° R за ÑтатиÑтичеÑки изчиÑлениÑ. Повече Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ðµ на разположение на проекта R за ÑтатиÑтичеÑки компютърни http://www.r-project.org/.

Какво е режим ÐеÑигурни?

По подразбиране на bogofilter клаÑифицира Ñъобщение като Ñпам или не Ñпам. Ðргументът SPAM_CUTOFF Ñе използва за това. Ð¡ÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ñ Ð¿Ð¾-виÑок резултат или момиче в SPAM_CUTOFF classs Ñа Ñпам. ОÑтаналите шунка.

Ðалице е Ñъщо така един параметър HAM_CUTOFF. Когато Ñе използва, ÑъобщениÑта Ñ‚Ñ€Ñбва да имат оценка по-долу или classs Гал HAM_CUTOFF да бъде шунка. Ð¡ÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ñ Ñ€ÐµÐ·ÑƒÐ»Ñ‚Ð°Ñ‚ между HAM_CUTOFF и билети за SPAM_CUTOFF Ñа “Ñигурни”. Ðко Ñе вгледате в bogofilter.cf, ще видите Ñледните редове:

    #### CUTOFF Values
    #
    #    both ham_cutoff and spam_cutoff are allowed.
    #    setting ham_cutoff to a non-zero value will
    #    enable tri-state results (Spam/Ham/Unsure).
    #
    #ham_cutoff  = 0.45
    #spam_cutoff = 0.99
    #
    #    for two-state classification:
    #
    ## ham_cutoff = 0.00
    ## spam_cutoff= 0.99

За да може клаÑÐ¸Ñ„Ð¸ÐºÐ°Ñ†Ð¸Ñ Ð”Ð° / Ðе / Ñигурни, премахнете да кажа на поÑледните два реда.

ОÑвен това, ако използвате етикети prfrez Да / Ðе / Ðе Ñте Ñигурни, вмеÑто за Спам / Хем / Ñигурни, премахване на предната Ð»Ð¸Ð½Ð¸Ñ ÐºÐ°Ð¶Ð°:

    ## spamicity_tags = Yes, No, Unsure

След това Ñе прави, можете да включите Ñледните правила за филтъра, за да Ñи поща:

    if header contains "X-Bogosity: Spam", put in Spam folder
    if header contains "X-Bogosity: Unsure", put in Unsure folder

Ð’ допълнение, bogofilter.cf possde наÑоки за промÑна на темата: напр.

    #### SPAM_SUBJECT_TAG
    #
    #	tag added to "Subject: " line for identifying spam or unsure
    #    default is to add nothing.
    #
    ##spam_subject_tag=***SPAM***
    ##unsure_subject_tag=??UNSURE??

С такива маркери, правилата за филтър ще изглежда така:

    if subject contains "***SPAM***", put in Spam folder
    if subject contains "??UNSURE??", put in Unsure folder

Какво е “обучение по грешка” и “обучение на изтощение”?

“Обучение на грешка” включва анализ на ÐºÐ¾Ñ€Ð¿ÑƒÑ Ð½Ð° ÑъобщениÑ, чийто Ñтатут е извеÑтен Ñпам или шунка. Само тези, които Ñа зле classs, или чиÑто клаÑÐ¸Ñ„Ð¸ÐºÐ°Ñ†Ð¸Ñ Ðµ неÑигурна, ще Intgr в до базата данни на обучение. Ð¢Ñ Ð½Ðµ показва, че изберете Ñамо ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ “лошо lves” тихи ефективно ÑредÑтво за обучение. Ðко тренирате bogofilter вÑички ÑъобщениÑ, че ще науча ÑÑŠÑ Ñпама и бутове празна.

Това може да бъде mthode amliore Ñ Ð¿Ð¾Ð¼Ð¾Ñ‰Ñ‚Ð° на “маржа на ÑигурноÑÑ‚.” Чрез увеличаване на ÑтойноÑтта “изключване Ñпам” и от намалÑване на ÑтойноÑтта “шунка изключване” ÑъобщениÑта, които Ñа близо до прага ще utiliss за обучение. Използването на този марж ÑигурноÑÑ‚ показа ефективноÑтта Ñи в rsultats amliorer обучението по грешка. Ð’ gnral, по-широки граници Ñа supplmentaire помощ (въпреки факта, че границите Ñа твърде големи, не Ñа оптимално). За една държава три режим, можете да използвате Ñредата на Ñигурни държава Ñ Ð¸Ð½Ñ‚ÐµÑ€Ð²Ð°Ð» от+ / – 0.3 за обучение

Rpter обучение на грешка на един и Ñъщи орган на Ñъобщението може да amliorer точноÑÑ‚. Ð’ IDE е, че ÑъобщениÑта, които имат classs тона и може да ПЪРВИ ПЪТ, Ñлед обучение, било погрешно classs. ТрÑбва да бъде компенÑирано от rptition.

“Обучение на изтощение” е rptition на обучението по грешка, ÑÑŠÑ ÑÑŠÑ‰Ð¸Ñ ÐºÐ¾Ñ€Ð¿ÑƒÑ Ñъобщение, че нÑма грешки, докато оÑтане. Това може да Ñе mthode amliore благодарение на маржовете на ÑигурноÑтта. Вижте защо

ÑÑ‚Ð°Ñ‚Ð¸Ñ Ð“Ð°Ñ€Ð¸ РобинÑън
за повече информациÑ.

Забележка: bogominitrain.pl possde Ð¾Ð¿Ñ†Ð¸Ñ -fcouraging, коÑто позволÑва на “обучение до изтощение”. Ðко решите да го използвате, да Ñа наÑÑно Ñ Ð²ÑŠÐ·Ð¼Ð¾Ð¶Ð½Ð¸Ñ‚Ðµ Ñтранични ефекти. Използването на-fn бързо rpter обучение за вÑÑко Ñъобщение.

Какво означава “-U” (AutoUpdate)?

Ð’ “-U” (AutoUpdate) Ñе използва за автоматично complter ÑпиÑък дума. Когато тази Ð¾Ð¿Ñ†Ð¸Ñ Ñе използва и bogofilter клаÑифицира Ñъобщение като Ñпам или Хам, Ñъобщение Ñимволи Ñе добавÑÑ‚ към ÑпиÑъка на думи Ñ Ð¼Ð°Ñ€ÐºÐµÑ€ за Ñпам или шунка (Ñпоред ÑлучаÑ).

Вземете ÑÐ»ÑƒÑ‡Ð°Ñ Ñ Ð¿Ñ€Ð¸Ñтигането на ново Ñъобщение “рефинанÑира Ñега – най-добрите лихви по ипотечните кредити”. Той Ñъдържа думи, които bogofilter ADJ видели и вероÑтно ново. Използването на “-U” тези нови думи Ñа добавени към ÑпиÑъка Ñ Ð´ÑƒÐ¼Ð¸, така че по-добре да bogofilter reconnatre Ñледните ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ ÐºÐ°Ñ‚Ð¾ него.

Ðко използвате “-U”, Ñ‚Ñ€Ñбва да Ñе вгледате внимателно неправилна клаÑÐ¸Ñ„Ð¸ÐºÐ°Ñ†Ð¸Ñ Ð¸ rentrainer bogofilter Ñ Ñ‚Ð¾Ð²Ð° Ñъобщение, е погрешно идентифициран. РпоÑланието, че е неправилно клаÑифицирани и Ñамоук _peut_ уÑилват бъдеще недоброто клаÑифициране на bogofilter. Това е ÑÑŠÑ‰Ð¸Ñ Ð¿Ñ€Ð¾Ð±Ð»ÐµÐ¼ като теб, ÑиÑтемен админиÑтратор, запишете лошо поÑлание шунка като Ñпам или обратно.

Как мога да използвам SpamAssassin да Ñе обучават bogofilter?

Ðко имате актив SpamAssassin (или ако иÑкате CRER), можете да използвате на неговото връщане, кодове за влак bogofilter. Ðай-леÑниÑÑ‚ начин е да CRER Ñкрипт за MDA, коÑто работи SpamAssassin, теÑтове за ÑÑŠÑтоÑнието на Ñпам кода на връщане / шунка, и тичам bogofilter за валидиране на Ñъобщението. СценариÑÑ‚ procmail по-долу е един от начините да го направите:

    BOGOFILTER     = "/usr/bin/bogofilter"
    BOGOFILTER_DIR = "training"
    SPAMASSASSIN  = "/usr/bin/spamassassin"

   :0 HBc
    *? $SPAMASSASSIN -e
    #spam yields non-zero
    #non-spam yields zero
    | $BOGOFILTER -n -d $BOGOFILTER_DIR
    #else (E)
   :0Ec
    | $BOGOFILTER -s -d $BOGOFILTER_DIR

   :0fw
    | $BOGOFILTER -p -e

   :0:
    * ^X-Bogosity:.Spam
    spam

   :0:
    * ^X-Bogosity:.Ham
    non-spam

Какво ще кажете за азиатÑки Ñпам?

Много хора reoivent на нежелана поща, като използват азиатÑки Ñимволи. Тъй като те не практикуват езика и познават лицето надолу, те предполагат, че е Ñпам.

Добрата новина е, че bogofilter DTECT на Manir plutt ефективни. Лошата новина е, че Ñ‚Ñ Ð¼Ð¾Ð¶Ðµ да бъде coteux. Можете оÑновно Ñа три възможноÑти:

  • Можете проÑто да bogofilter решетка на проблема. Entran Ñ Ð°Ð·Ð¸Ð°Ñ‚Ñки ÑъобщениÑ, определени като Ñпам. Bogofilter анализ на ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ ÐºÐ°Ñ‚Ð¾ най-той може и ще добави жетони ÑпиÑък на Ñпам думи. СпиÑъкът на думи ще Ñъдържа много Ñимволи, които не правÑÑ‚ ÑмиÑъл за Ð²Ð°Ñ (в завиÑимоÑÑ‚ от маÑата на Ñимволи, които не могат да бъдат показвани), но bogofilter може да работи Ñ Ñ‚ÑÑ… и правилно да идентифицира Ñпам ÐзиÑ.

  • Mthode втори вариант е да използвате ÐºÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ð¾Ð½Ð½Ð¸Ñ Ñ„Ð°Ð¹Ð» “replace_nonascii_characters”. Това ще замени ASCII Ñимволи “нагоре” (тези, които между 0×80 и 0xFF) Ñ Ð²ÑŠÐ¿Ñ€Ð¾Ñителен знак “?”. Това поддържа малка база. За Ñъжаление това не противоречи на европейÑките езици Ñ Ð¼Ð½Ð¾Ð³Ð¾ глаÑни и ÑъглаÑни увеличение ASCII “виÑока”.
  • Ðко никога не Ñи SR получите lgitime Ñъобщение на тези езици, можете директно да dtruire. Това ще намали базата на едни и Ñъщи. Можете да направите това Ñ ÐµÐ´Ð¸Ð½ Ñкрипт MDA.
  • Това е Ñкрипт, който ще изтрие ÑъобщениÑта Crits Ñ Ð¼Ð°Ñи на азиатÑките Ñимволи
  • ## Efface silencieusement tous les mails en langue asiatique
    UNREADABLE='[^?"]*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987'
   :0:
    * 1^0 $ ^Subject:.*=\?($UNREADABLE)
    * 1^0 $ ^Content-Type:.*charset="?($UNREADABLE)
    spam-unreadable

   :0:
    * ^Content-Type:.*multipart
    * B? $ ^Content-Type:.*^?.*charset="?($UNREADABLE)
    spam-unreadable

    С такава програма, bogofilter ще видите никога
    Ñъобщението.

Как да компактен базата данни?

Периодично Можете да компактен базата данни, за да заемат най-малко диÑково проÑтранÑтво. Ðко приемем, че Ñи е ÑпиÑък от думи в директориÑта ~ / Bogofilter, за bogofilter 0.93.0 (или поÑÐ»ÐµÐ´Ð½Ð¸Ñ Ð±Ñ€Ð¾Ð¹) тип.:

    bf_compact ~/.bogofilter wordlist.db

За antrieur bogofilter 0.93.0, използвайте:

    cd ~/.bogofilter
    bogoutil -d wordlist.db | bogoutil -l wordlist.db.new
    mv wordlist.db wordlist.db.prv
    mv wordlist.db.new wordlist.db

Този Ñкрипт е необходимо за дублиране на вашата Ñреда база данни (за подкрепа на BerkeleyDB обработка на транзакции). Оригиналните ви Ð´Ð¸Ñ€ÐµÐºÑ‚Ð¾Ñ€Ð¸Ñ Ñ‰Ðµ бъде преименуван на ~ /. Bogofilter.old и ~ /. Bogofilter ще Ñъдържа новата Ñреда.

За по-Ñтарите верÑии на bogofilter не, използващи принципа на Ñделките на база данни е обикновен файл (wordlist.db) и не ncessite за използване на Ñкрипт. Горните crent команди даде нова оÑнова за по-компактен и преименуване на Ð¾Ñ€Ð¸Ð³Ð¸Ð½Ð°Ð»Ð½Ð¸Ñ Ñ„Ð°Ð¹Ð» wordlist.db.prv

Забележка: Това е напълно валиден за използване на Ñкрипт Ñ Ð¿Ð¾-Ñтари верÑии на bogofilter.

Как да Ñи направим една молба, оÑнована на ръководÑтвото?

За да намерите Ð±Ñ€Ð¾Ñ Ð½Ð° Ñпам и шунка за знак (дума), използвайте bogoutil на “-w”. Ðапример, “-w ​​$ bogoutil BOGOFILTER_DIR / wordlist.db example.com” дава Ð±Ñ€Ð¾Ñ Ð½Ð° шунка и Ñпам за “example.com”.

Ðко иÑкате да изкарате повече spamicit броÑÑ‚ на Ñпам и шунка за знак, използвайте bogoutil на “-Ñ€”. Ðапример, “-P $ bogoutil BOGOFILTER_DIR / wordlist.db example.com” оÑигурÑва повече номера шунка и Ñпам, оценка на думата.

За да разберете колко ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ñа в ÑпиÑъка Ñи Ñ Ð´ÑƒÐ¼Ð¸, е отправила иÑкане за пÑевдо-Ñимволичен “. MSG_COUNT” (точка на БР). За пример, Ñтартирайте командата “-w $ bogoutil BOGOFILTER_DIR / wordlist.db. MSG_COUNT”.

За колко жетони Ñа подадени в думата Ñи ÑпиÑък, изпратете на изхода на командата да Ñе отърват bogoutil командата “тоалетна”. Ðапример, използвайте “г-$ bogoutil BOGOFILTER_DIR / wordlist.db / wordlist.db | WC-л”, за да показва Ð±Ñ€Ð¾Ñ Ð½Ð° Ñлучаи на Ñимволите (Ðко използвате spamlist.db goodlist.db и Ñтартирайте командата за вÑеки един от Ñ‚ÑÑ…).

Мога ли да използвам нÑколко wordlists?

Да. Bogofilter може да работи Ñ Ð½Ñколко ÑпиÑъка на думи. Ðапример, ако Ñте ÑпиÑъкutilisateur и
systemeBogofilter да vrifier ако думата е в ÑпиÑъка Ñ Ð¿Ð¾Ñ‚Ñ€ÐµÐ±Ð¸Ñ‚ÐµÐ»Ð¸, и ако думата не е там, vrifier ÑиÑтема ÑпиÑък. Bogofilter може да ÑмеÑва Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð¸ от двете лиÑти.

Тук Ñа възможноÑтите за ÐºÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ð¾Ð½Ð½Ð¸Ñ Ñ„Ð°Ð¹Ð» и нÑкои примери:

СпиÑък на думи possde нÑколко качеÑтва, particulirement тип, име, името на файла и prcdence.

  • Тип “R” и “Ðз” (за редовни и Игнорирай). ÐаÑтоÑщите ÑпиÑъци Ñа от типа “R”. Тип “аз” означава “не n’value знак, ако Ñе открие в ÑпиÑък Ñ Ð¿Ñ€ÐµÐ½ÐµÐ±Ñ€ÐµÐ³Ð½Ð°Ñ‚Ð¸.”
  • Име: кратко идентификатор, който ще Ñе използва за показване на ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð·Ð° грешка. Ðапример “глобално”, “потребител” и “игнорирай”. Ðо вÑеки идентификатор е валиден.
  • Име: името на файла на думите. Когато отворите база данни, ако пътÑÑ‚ е compltement квалифицирани (Ñ ‘/’ в горната чаÑÑ‚, или “~”) име Ñе използва, в противен Ñлучай добавите Ñъдържание променливи път bogofilter по реда Ñледното: $ BOGOFILTER_DIR, BOGODIR $, $ HOME.
  • Prcdence: това е цÑло чиÑло, като 1, 2, 3,… Изглежда за токен в ÑпиÑъците на думи в поÑока нагоре на prcdence. Ðко знак Ñе намира, дори prcdence ÑпиÑъци Ñе използват за Ñумата на Ñметките. СпиÑъци Ñ prcdence suprieure не Ñе проверÑва.

Пример 1 – Ð¼Ð¸ÐºÑ Ð½Ð° Ð¿Ð¾Ñ‚Ñ€ÐµÐ±Ð¸Ñ‚ÐµÐ»Ñ Ð¸ ÑпиÑъци ÑиÑтема:

    wordlist R,utilisateur,~/wordlist.db,1
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,1

Пример 2 – Преди Ð¿Ð¾Ñ‚Ñ€ÐµÐ±Ð¸Ñ‚ÐµÐ»Ñ ÑпиÑък:

    wordlist R,utilisateur,~/wordlist.db,2
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,3

Пример 3 – Преди ÑпиÑък ÑиÑтема:

    wordlist R,utilisateur,~/wordlist.db,5
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,4

Бележка 1: Опции enregristrement bogofilter (“-ите”, “-н”, “-U”, “-S”, “-N”) ще Ñе прилага Ñамо ÑпиÑъци на най-ниÑките в PR cdence.

Бележка 2: разполагат ÑÑŠÑ ÑпиÑъци от типа “R” и “аз” на една и Ñъща prcdence не е позволено, защото видовете Ñа противоречиви.

Мога ли да кажа bogofilter да игнорират определени Ñимволи?

Чрез използването на ÑпиÑъци от типа “игнорирай”, bogofilter не ще вземе предвид ÑпиÑъците жетони за оценка на Ñъобщението.

Пример:

    wordlist I,ignore,~/ignorelist.db,7
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,8

Като ignorelist.db има Ð¸Ð½Ð´ÐµÐºÑ infrieur (7), че на
wordlist.db (8), bogofilter нÑма да изглежда на жетони, които ще бъдат в ignorelist.db.

Забележка: ТехничеÑки bogofilter дава оценка на ROBX на Ñимволи, както и очаква, че min_dev Ðргументът прави “Cancel”.

Има два оÑновни mthodes за изграждане / поддържане на ÑпиÑък на “игнорирай”.

Първо, текÑтов файл може да бъде кр и поддържа от издателÑ. Bogoutil може да конвертирате текÑтов файл в база данни, например “bogoutil ignorelist.db-л <ignorelist.txt”.

Secondo, echo... | bogoutil... може да Ñе използва за добавÑне на един Ñимвол, например “ignorez.moi”

  echo ignorez.moi | bogoutil -l ~/ignorelist.db

Как мога да направÑ, за да превърне базата на думи SPAR в Комбинираната формат?

Стартирайте bogoupgrade Ñкрипт. За повече Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð¿Ð¸Ñта “bogoupgrade-H” за да видите помощта Ñъобщение, или “човекът bogoupgrade” Ñтраница и прочетете ръководÑтвото.

Какво Ñтава, ако думите ми е повреден?

Ðко ÑмÑтате, че думата Ñи ÑпиÑъци DGRAD нужно, можете да гледате какво Ñе казва, че от Ñтартирането BerkeleyDB:

    db_verify wordlist.db

Ðко има проблем, можете да rcuprer или вÑички от Ñимволите и Ð±Ñ€Ð¾Ñ ÑÑŠÑ Ñледната команда:

    bogoutil -d wordlist.db | bogoutil -l wordlist.new.db

или – ÑпиÑъкът не може да бъде rcupre командата Предишна – Ñ:

    db_dump -r wordlist.db > wordlist.txt
    db_load wordlist.new.db < wordlist.txt

Как мога да конвертирате Ð¼Ð¾Ñ ÑпиÑък от думи от / до уникод?

Ð’ оÑновата на думи могат да бъдат превърнати от Ñуров формат Unicode помощта на Ñледните команди:

    bogoutil -d wordlist.db > wordlist.raw.txt
    iconv -f iso-8859-1 -t utf-8 < wordlist.raw.txt > wordlist.utf8.txt
    bogoutil -l wordlist.db.new < wordlist.utf8.txt

или:

    bogoutil --unicode=yes -m wordlist.db

Ð’ оÑновата на думи могат да бъдат превърнати от Unicode формат до Ñуровини, като напишете Ñледното:

    bogoutil -d wordlist.db > wordlist.utf8.txt
    iconv -f utf-8  -t iso-8859-1 < wordlist.utf8.txt > wordlist.raw.txt
    bogoutil -l wordlist.db.new < wordlist.raw.txt

или:

    bogoutil --unicode=no -m wordlist.db

Как да преминете от не-Ñ‚Ñ€Ð°Ð½Ð·Ð°ÐºÑ†Ð¸Ñ Ð¿Ð¾ Ñ‚Ñ€Ð°Ð½Ð·Ð°ÐºÑ†Ð¸Ñ Ñ€ÐµÐ¶Ð¸Ð¼?

Процедурата е compltement документи по препиÑката документ / README.db раздел 2.2.1. МолÑ, прочетете suggrons параграф compltement.

В резюме, използвайте тези команди: 

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    bogoutil --db-transaction=yes -l wordlist.db < wordlist.txt

Ðко вÑичко върви добре, можете да премахнете архивиране на файлове:

    rm wordlist.db.old wordlist.txt

Как да преминете от не-транзакционни транзакции режим?

Процедурата е compltement документи по препиÑката документ / README.db раздел 2.2.1. МолÑ, прочетете suggrons параграф compltement.

В резюме, можете да използвате bogoutil да копирате и презареждане на базата данни от думи, като например: 

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    rm -f log.????? __db.??
    bogoutil --db-transaction=no -l wordlist.db < wordlist.txt

Защо bogofilter умре като APRS диÑÐ¿Ð»ÐµÑ “Lock маÑа е от наличните заключва” или “Lock маÑа е от налични запиÑи обект”

Ðа Ñделката и едновременно видове BerkeleyDB ncessitent ключалка таблица, коÑто ÑъответÑтва на база данни размер. Прочетете файлаREADME.db Търговец на дребно за обÑÑнение и решение.

Размерът на заключване на таблица могат да бъдат в paramtre bogofilter.cf или DB_CONFIG. Bogofilter.cf използва db_lk_max_locks и db_lk_max_objects директиви, докато DB_CONFIG използва set_lk_max_objects и set_lk_max_locks директиви.

APRs Ñа тези ценноÑти в DB_CONFIG Чанг, Ñтартирайте

  bogoutil --db-recover /votre/repertoire/bogofilter

за възÑтановÑване на таблицата за заключване.

Как е, че получавате ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ DB_PAGE_NOTFOUND?

Вие ÑÑŠÑ ÑигурноÑÑ‚ имате проблем Ñ Ð±Ð°Ð·Ð°Ñ‚Ð° Ñи на даване BerkeleyDB. Има две възможни причини: или Ñте доÑтигнали лимита, или на базата данни е повреден.

ÐÑкои пощенÑки Ñървъри, като Postfix, да налагат Ð¾Ð³Ñ€Ð°Ð½Ð¸Ñ‡ÐµÐ½Ð¸Ñ Ð½Ð° размера на файла. Когато bogofilter до базата данни доÑтига тази граница, проблемът изглежда пиÑмена форма.

За да видите размера на Ð¸Ð·Ð¿Ð¾Ð»Ð·Ð²Ð°Ð½Ð¸Ñ Ð¾Ñ‚ до базата данни:

    ls -lh $BOGOFILTER_DIR/wordlist.db

За да видите макÑÐ¸Ð¼Ð°Ð»Ð½Ð¸Ñ Ñ€Ð°Ð·Ð¼ÐµÑ€ Ñ Postfix:

    postconf | grep mailbox_size_limit

За да зададете макÑÐ¸Ð¼Ð°Ð»Ð½Ð¸Ñ Ñ€Ð°Ð·Ð¼ÐµÑ€ на 73MB (или каквото и размер е приложимо):

    postconf -e mailbox_size_limit=73000000

Ðко ÑмÑтате, че вашата база данни е повреден даде, прочетете точка
Какво Ñтава, ако в Ð¼Ð¾Ñ ÑпиÑък на думи е corroumpue?
чеÑто задавани въпроÑи.

Защо получавам “Berkeley DB библиотеката конфигуриран да подкрепÑÑ‚ Ñамо DB_PRIVATE Ñреда” или “Berkeley DB библиотеката конфигуриран да поддържа Ñамо чаÑтен Ñреда”?

ÐÑкои диÑтрибуции (например Fedora) предлага BerkeleyDB Ñ Ð¿Ð¾Ð´Ð´Ñ€ÑŠÐ¶ÐºÐ° на теми POSIX и POSIX mutexes consquent, когато ÑиÑтемата ви не поддържа тези mutexes. (Това dpend Ñи верÑÐ¸Ñ Ð½Ð° Ñдрото и точниÑÑ‚ вид на процеÑор).

За да Ñе Ñправите Ñ Ð¿Ñ€Ð¾Ð±Ð»ÐµÐ¼Ð°

  1. Tlcharger, компилирате и инÑталирате Berkeley DB ръчно да конфигурирате bogofilter:
    1. CD build_unix
    2. .. / Dist / конфигурирате - позволи-cxx
    3. да
    4. да инÑталирате
  2. компилирате и инÑталирате bogofilter:
    1. . / Конфигуриране - Ñ-libdb-Ð¿Ñ€ÐµÑ„Ð¸ÐºÑ = / usr/local/BerkeleyDB.4.3
      (замени номера на верÑиÑта на Berkeley DB)
    2. и да и направÑÑ‚ проверка
    3. да инÑталирате (ако понÑтието за проÑтранÑтво е важно, използвайте да инÑталирате-лента)

Bogofilter могат да работÑÑ‚ в Ñреда Ñ Ð¼Ð½Ð¾Ð³Ð¾ потребители?

Да, може. Има много stratgies да го направÑÑ‚. двете крайноÑти Ñа:

  • Като bogofilter админиÑтратор, който поддържа обширна база данни, че вÑеки използва.
  • Ð’Ñеки потребител поддържа ÑобÑтвена база данни.

ÐаÑтоÑщиÑÑ‚ компромиÑ: bogofilter админиÑтратор поддържа глобална wordlists и вÑеки потребител има право да използват глобалната ÑпиÑък или ÑпиÑък чаÑтни. Ð MDA като procmail, могат да бъдат програмирани за изпълнение на Ð¿ÑŠÑ€Ð²Ð¸Ñ Ð¸Ð·Ñ‡ÐµÑ€Ð¿Ð°Ñ‚ÐµÐ»ÐµÐ½ ÑпиÑък (ÑÑŠÑ Ñтрог лимит TRS Ñпам) и, когато е необходимо, да Ñе прилага ÑпиÑък на думи отрича.

Мога ли да ÑподелÑм една дума NFS ÑпиÑък?

Ðко току-що прочетох, нÑма проблем. Ðко Ñте ги Ñложили дни, Ñ‚Ñ€Ñбва да предоÑтавите правото възможноÑти за заключване Ñе избегне повреда на данни. Когато Ñе ÑÑŠÑтавÑÑ‚ bogofilter, ще Ñ‚Ñ€Ñбва vrifier, че конфигурирате Ñкрипт е разположен “# определи HAVE_FCNTL 1″ в config.h Ð²Ð°ÑˆÐ¸Ñ Ñ„Ð°Ð¹Ð». Операционната ÑиÑтема UNIX вÑички поддържат този Ñтандарт. Ðко използвате верÑÐ¸Ñ particulirement екзотични или Ñтар, Ñе уверете, че Ð¿Ð¾Ð´ÐºÑ€ÐµÐ¿Ñ fcntl (). Ðко “# определи HAVE_FCNTL 1″ Ñе определÑ, като Ñе поÑочва, че вашата ÑиÑтема, за да ÑраÑнали fcntl (), Ñлед това dcommentez “# определи HAVE_FLOCK 1″, така че ÑиÑтемата използва заключване fcntl () вмеÑто на Ñтадото () за заключване. Ðко ÑиÑтемата ви не поддържа fcntl, така че можете да ÑподелÑте wordlists през NFS, без да риÑкуват повреда на данни.

След това Ñе уверете, че NFS е конфигуриран правилно Ñ “lockd” работи. Rfrez Ñи NFS Ð´Ð¾ÐºÑƒÐ¼ÐµÐ½Ñ‚Ð°Ñ†Ð¸Ñ Ð·Ð° Ñтартиране на “lockd” или “rpc.lockd”. Повечето от активното Systmes Ñ NFS по подразбиране.

Защо bogofilter оÑигурÑва възвръщаемоÑÑ‚ кодове като 0 и 256, когато Ñтартирате програма на закрито?

ВероÑтно кодове връщане Ñа тона rcrits от waitpid (2). С използването WEXITSTATUS (ÑтатуÑ) в макро-ÑиÑтеми / wait.h, или ÑъпоÑтавими, за да получите правилната ÑтойноÑÑ‚. Perl употреба “ÑиÑтема (” bogofilter $ вход “)>> 8. Ðко иÑкате повече информациÑ, Ñтартирайте
"man waitpid".

Защо Ñа ми Ñкриптове chouent дни, откакто Ñложих?

Що Ñе отнаÑÑ, bogofilter е натрупал голÑм брой опции. ÐÑкои от Ñ‚ÑÑ… Ñа изчезнали или променени. Виж файла
ÐОВИÐИ за повече информациÑ.

Защо, тъй като Ñъм модернизирани bogofilter работÑÑ‚ по-малко и там?

Ð’ lexer, чаÑтта, коÑто извлича знаците на ÑъобщениÑ, Ñе развива. Това води до промÑна в gnration ÑпиÑъка на Ñимволи, които на Ñвой ред ще направи Ñтарите Ñимволи inutiliss.

Ðко Ñе ÑблъÑкате Ñ Ñ‚Ð¾Ð·Ð¸ проблем, призова ви възÑтановÑване на базата данни. Ðко това не е възможно, можете да използвате верÑиÑ
0.15.13
и прочетете документациÑта, коÑто върви Ñ Ð½ÐµÐ³Ð¾, за да видите как да мигрират.

Комбинира Ñе Ñ ÐµÐ´Ð¸Ð½ ÑпиÑък от думи, как мога да dtruire вÑички Ñимволи Ñпам (или не-Ñпам)?

Bogoutil ви позволÑва да Ñе изброÑÑ‚ (дъмп) един ÑпиÑък от думи и натоварване на Ñимволите в нов ÑпиÑък от думи. С помощта на инÑтрументи като awk и Впиши, номерата могат да бъдат пуÑнати zros и Ñимволите, чиито Ñметки ще бъдат за нула-Ñпам и бутове може да бъде dtruits.

По-долу ще dtruire жетони от Ñпам ÑъобщениÑ:

    bogoutil -d wordlist.db | \
    awk '{print $1 " " $2 " 0"}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

По-долу ще dtruire жетони от Ñпам ÑъобщениÑ.

    bogoutil -d wordlist.db | \
    awk '{print $1 " 0 " $3}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

Как bogofilter работи върху Solaris, BSD и др.?

Ðко не Ñте DJ верÑÐ¸Ñ 3.0 или по-виÑока от
BerkeleyDB, а Ñлед това
актуализациите файлове за изтеглÑне (под една от 4.2.x), на dcompactez, и изпълнете Ñледните команди в директориÑта “DIST”:

    $ cd build_unix
    $ sh../dist/configure
    $ make
    # make install

След Tlcharger на преноÑима верÑÐ¸Ñ Ð½Ð° bogofilter.

Ðа Solaris

Dcompactez и Ñлед това да направите:

    $./configure --with-libdb-prefix=/usr/local/BerkeleyDB-4.2
    $ make
    # make install-strip

След това можете да направите или Ñимволично libdb.so връзка в / ЮЕÑÐÑ€ / ИЪ, или използването на модифицирана верÑÐ¸Ñ Ð½Ð° променливата на Ñредата LD_LIBRARY_PATH, преди да пуÑнете bogofilter.

    $ LD_LIBRARY_PATH=/usr/lib:/usr/local/lib:/usr/local/BerkeleyDB-4.2
        $ export LD_LIBRARY_PATH

Имайте предвид, че нÑкои верÑии на книги направи Ñ Ð¿Ð¾-Ñтара верÑÐ¸Ñ Solaris почивка, когато Ñе опитваме да изградим bogofilter извън нейната Ð´Ð¸Ñ€ÐµÐºÑ‚Ð¾Ñ€Ð¸Ñ Ð¸Ð·Ñ‚Ð¾Ñ‡Ð½Ð¸Ðº. Или ще ÑÑŠÑÑ‚Ð°Ð²Ñ Ñ€ÐµÐ³Ð¸Ñтъра източник (като suggr по-горе) или да използвате GNU марка (gmake).

Ðа FreeBSD

Пакетите Ñа на разположение Ñ Ð²ÐµÑ€Ñии на trsrcentes bogofilter. Този подход Ñе използва пакети TRS Ñе препоръчва portupgrade и portsnap. За да инÑталирате тези две прекраÑни инÑтрументи (което Ñ‚Ñ€Ñбва да направите това Ñамо веднъж):

    # pkg_add -r portupgrade cvsup

За да инÑталирате или актуализирате bogofilter, Ñамо нÑколко дни до
дървото преобразуване (приÑтанища дърво) Ñ CVSup Ñлед това въведете

    # portupgrade -N bogofilter

Забележка:. Това предполага, че Ñа корен Ð’ противен Ñлучай, прочетете mmento на този раздел FreeBSD и да видим как да Ñе
ÑÑŠÑтавÑÑ‚, ако не разполагат Ñ Ð¿Ñ€Ð¸Ð²Ð¸Ð»ÐµÐ³Ð¸Ð¸ изиÑква..

Ð’ завиÑимоÑÑ‚ от вашата ÑиÑтема, може да зададете нÑкои ÑиÑтемни променливи, да Ñе контролира ./configure. Пример:

    # env CPPFLAGS=-I/usr/local/include/db3 LIBS=-ldb3 LDFLAGS=-L/usr/local/lib./configure

Dpendent пътеки на вашата ÑиÑтема и верÑии на бази от данни, които Ñте инÑталирали. Уверете Ñе, и промÑна в consquence.

HP-UX

Виж файла
DOC / програмиÑÑ‚ / README.hp-UX
в източник на разпроÑтранение.

Мога ли да използвам командата правÑÑ‚ ми Systm?

Bogofilter уÑпешно ÑÑŠÑтавен от нÑколко Systmes Ñ Ð¿Ð¾Ð¼Ð¾Ñ‰Ñ‚Ð° на GNU и да направи Ñ€Ð¾Ð´Ð½Ð¸Ñ ÐºÐ¾Ð¼Ð°Ð½Ð´Ð¸. Въпреки това, Makefile bogofilter не работи Ñ Ð½Ñкои команди направи.

GNU да Ñе препоръчва за изграждане bogofilter, защото ние знаем, че работи. Ðие не може да поддържа поръчки правÑÑ‚ по-малко ефективни. Ðко не-GNU да работи, Ñтрахотно!. Ðко Ñе ÑблъÑкате Ñ Ð½Ñкакъв проблем, нещо, което да направите е да инÑталирате GNU направи. Ðко не-GNU да могат да ÑÑŠÑтавÑÑ‚ bogofilter, ние Ñме СъжалÑвам, но това е ваш проблем. Ðко това не ncessite ÑобÑтвен малък учаÑтък да Ñтане ÑъвмеÑтим, ние ще интегрира възможно.

Как да ÑÑŠÑÑ‚Ð°Ð²Ñ bogofilter за без корен потребител или Ñ Ð¿Ñ€ÐµÑ„Ð¸ÐºÑ Ð½Ð° неÑтандартни инÑталациÑ?

Bogofilter да Ñе инÑталира в Ð´Ð¸Ñ€ÐµÐºÑ‚Ð¾Ñ€Ð¸Ñ Ð½ÐµÑтандартни (като без корен не Ñа Ñ€Ð°Ð·Ñ€ÐµÑˆÐµÐ½Ð¸Ñ Ð·Ð° директории нормално), ще Ñ‚Ñ€Ñбва prciser префикÑа, когато инÑталирате Ñтартира
./configure.

APRS dcompacter изтеглите и Ñа
Ð¸Ð·Ñ…Ð¾Ð´Ð½Ð¸Ñ ÐºÐ¾Ð´, Ñтартирайте./configure --prefix=PATH. о PATH е инÑталациÑта Ð¿Ñ€ÐµÑ„Ð¸ÐºÑ Ð·Ð° gnrs файлове (изпълними файлове, човек Ñтраници и Ñ‚.н.) След това Ñтартирайте обичайните команди -

make && make check && make install.

Как да Ñъздам bogofilter Ñ Ð»ÐµÐ¿ÐµÐ½ÐºÐ¸?

Ðко Ñте ncessaire прилагат петна, rcuprez
Ð¸Ð·Ñ…Ð¾Ð´Ð½Ð¸Ñ ÐºÐ¾Ð´
 и използването на dcompacteztar -xzf или gunzip
| tar -xf -. ПромÑна на източника Ð´Ð¸Ñ€ÐµÐºÑ‚Ð¾Ñ€Ð¸Ñ Ð¸ да Ñтартирате./configure --prefix=PATH

о PATH е инÑталациÑта Ð¿Ñ€ÐµÑ„Ð¸ÐºÑ Ð·Ð° gnrs файлове (изпълними файлове, човек Ñтраници и Ñ‚.н.) След това APRS Ñа приложили петна, изпълнете обичайните команди. -
make && make install.

Как да Ñи направим изпълними по-малки?

ÐамалÑва Когато проÑтранÑтво, можете да използвате make
install-strip вмеÑто make install. Това позволÑва SAVE диÑково проÑтранÑтво, но не позволÑва отÑтранÑването на грешки в катаÑтрофата, оÑвен ако повече Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð·Ð° възпроизвеждане на грешки Ñе предоÑÑ‚Ð°Ð²Ñ dveloppeurs.

datastore_db.c не Ñе компилира!

Ðко зададете Ð¿ÑŠÑ‚Ñ Ð´Ð¾ базата данни, например, – Ñ-libdb-Ð¿Ñ€ÐµÑ„Ð¸ÐºÑ Ð¸Ð»Ð¸ чрез CPPFLAGS и LIBS, не забравÑйте да оÑигури
абÑÐ¾Ð»ÑŽÑ‚Ð½Ð¸Ñ Ð¿ÑŠÑ‚ (Ñ Ð½Ð°ÐºÐ»Ð¾Ð½ÐµÐ½Ð° черта в начинаещи), един отноÑÐ¸Ñ‚ÐµÐ»Ð½Ð¸Ñ Ð¿ÑŠÑ‚ нÑма да работи. Пример: използване
- Ñ-libdb-Ð¿Ñ€ÐµÑ„Ð¸ÐºÑ = / usr/local/BerkeleyDB.4.2, но
не - Ñ-libdb-Ð¿Ñ€ÐµÑ„Ð¸ÐºÑ =.. / BerkeleyDB.4.2

Кои програми Ñе bogofilter работите?

Bogofilter rput е да Ñе работи Ñ KMail, Mozilla поща, куче, алпийÑки, Sylpheed-нокти. Рза Ñ‚ÑŠÑ€Ñене на Google ще ви помогне да получите повече Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð·Ð° използване bogofilter Ñ Ñ€ÐµÐ´Ð¾Ð²Ð½Ð¸ пощата Ñи програма.

Как да използвате bogofilter Ñ Ð¿ÐµÑ?

Използвайте поща филтър (procmail, maildrop и др.) Да филтрират електронна поща в папки РÐЗЛИЧÐИ Ñлед връщането код на bogofilter, както и бутони за връзка влак bogofilter на грешки:

    macro index S "|bogofilter -s\ns=junkmail"  "Apprendre comme spam et sauvegarder dans junk"
    macro pager S "|bogofilter -s\ns=junkmail"  "Apprendre comme spam et sauvegarder dans junk"
    macro index H "|bogofilter -n\ns="          "Apprendre comme spam et sauvegarder"
    macro pager H "|bogofilter -n\ns="          "Apprendre comme spam et sauvegarder"

Това ще изпращат ÑъобщениÑ, за да изберете bogofilter, преподаване фалшиви шунка в Ñпам и обратно, а Ñлед това предложи да запишете в папка по-различно.

Как да използвате bogofilter Ñ Sylpheed Claws?

ПРÐВИЛРдобавите филтър, за да тече bogofilter за входÑщи ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð¸ извършване на дейÑтвиÑ, ако това е Ñпам.

    condition:
    * test "bogofilter < %F"
    action:
    * move "#mh/VOTRE_BOITE_A_SPAM"

Забележка: Това предполага, че bogofilter е по Ð¿ÑŠÑ‚Ñ Ñи!

Създаване на две Claws дейÑÑ‚Ð²Ð¸Ñ – един за маркиране на ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ ÐºÐ°Ñ‚Ð¾ Ñпам и един за маркиране на ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ ÐºÐ°Ñ‚Ð¾ шунка. Използвайте дейÑтвие “Маркирай като Спам” ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð·Ð° неправилно classs като шунка и използване “Маркирай като Хем” classs за ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð½ÐµÐ¿Ñ€Ð°Ð²Ð¸Ð»Ð½Ð¾ като Ñпам.

    Mark as ham / spam:
    * bogofilter -n -v -B "%f" (mark ham)
    * bogofilter -s -v -B "%f" (mark spam)

Друг подход е да Ñе запишете на ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð² папка неправилно classs (или повече) и да Ñтартирате Ñкрипт, като например:

    #!/bin/sh
    CONFIGDIR=~/.bogofilter
    SPAMDIRS="$CONFIGDIR/spamdirs"
    MARKFILE="$CONFIGDIR/lastbogorun"
    for D in `cat "$SPAMDIRS"`; do
        find "$D" -type f -newer "$MARKFILE" -not -name ".sylpheed*"
    done|bogofilter -bNsv
    touch "$MARKFILE"

Този Ñценарий може да Ñе използва като дейÑтвие или транÑформират като бутон. Това ще ÑпеÑти като Ñпам, ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð² $ {} Ñа SPAMDIRS поÑÐ»ÐµÐ´Ð½Ð¸Ñ Ð±Ñ€Ð¾Ð¹ MARKFILE като $ {}.

Повече Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ðµ на разположение в
уики Sylpheed-Claws.

Друг подход е да Ñтартирате bogofilter от procmail, maildrop и др. и да Claws vrifier от заглавието X-Bogosity и филтър ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð² Спам и неÑигурна папки. Ðапример:

    Condition:
        header "X-Bogosity" matchcase "Spam"
    Action:
        move "#mh/Mailbox/Spam"
    Condition:
        header "X-Bogosity" matchcase "Unsure"
    Action:
        move "#mh/Mailbox/Unsure"

Ð’Ñички ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð² ÐеÑигурни папка Ñ‚Ñ€Ñбва да Ñе научи, тъй като вÑички ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð½ÐµÐ¿Ñ€Ð°Ð²Ð¸Ð»Ð½Ð¾ клаÑифицирани като шунка или Ñпам. Следните дейÑÑ‚Ð²Ð¸Ñ greront такива Ñлучаи:

    Register Spam:
        bogofilter -s < "%f"

    Register Ham:
        bogofilter -n < "%f"

    Unregister Spam:
        bogofilter -S < "%f"

    Unregister Ham:
        bogofilter -N < "%f"

За да проверите bogofilter mcanisme вкарване, Ñлед поÑтавÑне на диагнозата е от полза:

    BogoTest -vv:
        bogofilter -vv < "%f"

    BogoTest -vvv:
        bogofilter -vvv < "%f"

Допълнителна Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð·Ð° този подход Ñа доÑтъпни тук.

Как да използвате bogofilter Ñ VM (едно Mail Emacs инÑтрумент)?

ТрÑбва да включите файла VM-bogofilter.el (както можете да Ñе обърнете към търговеца е bogofilter или Tlcharger http://www.cis.upenn.edu/ ~ bjornk / bogofilter / VM-bogofilter.el) в път библиотека на Emacs.

Ð¢Ñ Ð¾Ñтава Ñамо за ваÑ, които поÑтавÑÑ‚ в ÐºÐ¾Ð½Ñ„Ð¸Ð³ÑƒÑ€Ð°Ñ†Ð¸Ð¾Ð½Ð½Ð¸Ñ Ñ„Ð°Ð¹Ð» ~ / VM.:

;; Lutte contre les pourriels (via bogofilter)
;;
(require 'vm-bogofilter)

;; Raccourcis-clavier pour bogofilter
;; C (shift-c): pourriel
;; K (shift-k): message correct
(define-key vm-mode-map "K" 'vm-bogofilter-is-spam)
(define-key vm-mode-map "C" 'vm-bogofilter-is-clean)

Ð’Ñички ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ñе филтрират от bogofilter когато Проверете вашите нови ÑъобщениÑ. При промÑна на ÑÑŠÑтоÑнието на Ñъобщение, заглавиÑта на Ñъобщението Ñа променени (заглавието X-Bogosity:).

Има едно ограничение: не можете да промените ÑÑŠÑтоÑнието на изберете набор от ÑъобщениÑ: вие Ñ‚Ñ€Ñбва да направите, APRS Ñъобщение Ñъобщение…

Как да използвате bogofilter Ñ MH-E (интерфейÑа Emacs да изпратите по пощата Systm МЗ)?

Paramtrage опциÑта по подразбиране “MH-боклуци програма” е “Ðвтоматично откриване”, което означава, че MH-E автоматично ще избере между SpamAssassin, bogofilter, или SpamProbe, в този ред. Ðко, например, да инÑталирате SpamAssassin и bogofilter, а вие иÑкате да използвате bogofilter, Ñ‚Ñ€Ñбва да промените това “bogofilter”.

“PG” Командата (“MH-боклуци черен ÑпиÑък”) влакове на Ñпам в ход програма Ñ Ð¸Ð·Ð±ÐµÑ€ÐµÑ‚Ðµ Ñъдържанието и Ñлед това третира (и) Ñъобщение (Ñ), както Задава опциÑта ” MH-боклуци разпореждане “. По подразбиране тази Ð¾Ð¿Ñ†Ð¸Ñ Ðµ наÑтроена на “Delete Спам” Ðо можете да spcifier името на директориÑта, коÑто ще бъде полезно за изграждането на корпуÑа на Ñпам за обучение.

ВмеÑто това, командата “w J” (“MH-боклуци-Ð±ÐµÐ»Ð¸Ñ ÑпиÑък”) преклаÑифицира ÑÑŠÐ¾Ð±Ñ‰ÐµÐ½Ð¸Ñ Ð˜Ð·Ð±ÐµÑ€ÐµÑ‚Ðµ Хем, тъй като те неправилно taient classs като Ñпам. След това Ñ‚Ñ dplace Ð¼Ð½ÐµÐ½Ð¸Ñ Ð² “+ кутиє.

За повече Ð¸Ð½Ñ„Ð¾Ñ€Ð¼Ð°Ñ†Ð¸Ñ Ð¿Ñ€Ð¾Ñ‡ÐµÑ‚ÐµÑ‚Ðµ на Ñтраницата MH-E

bogofilter-1.2.4/doc/bogolexer.1in0000644000175000017500000000610712163572467015223 0ustar sezsez'\" t .\" Title: bogolexer .\" Author: [see the "AUTHOR" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BOGOLEXER" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bogolexer \- Utility program for separating email messages into tokens .SH "SYNOPSIS" .HP \w'\fBbogolexer\fR\ 'u \fBbogolexer\fR [\-p] [\-q] [\-h] [\-n] [\-v] [\-x\ \fIflags\fR] [\-c\ \fIfile\fR] [\-C] [\-D] [\-I\ \fIfile\fR] [\-O\ \fIfile\fR] [\-V] .SH "DESCRIPTION" .PP Bogolexer is part of the bogofilter Bayesian spam filter package\&. .PP It is used to separate messages into tokens and to test new versions of the lexer\&.l code\&. .SH "OPTIONS" .PP The \fB\-p\fR option tells bogolexer to print just the tokens read from stdin, without any extra messages\&. .PP The \fB\-q\fR option tells bogolexer to print a token count, without printing the actual tokens\&. .PP The \fB\-h\fR option prints the help message and exits\&. .PP The \fB\-n\fR option tells bogolexer to map non\-ascii characters to the question point \*(Aq?\*(Aq\&. .PP The \fB\-v\fR option increases the verbosity level\&. .PP The \fB\-x \fR\fB\fIflags\fR\fR option allows setting of debug flags for printing debug messages\&. .PP The \fB\-c\fR\fIfilename\fR option tells bogolexer to read the config file named\&. .PP The \fB\-C\fR option prevents bogolexer from reading configuration files\&. .PP The \fB\-D\fR option redirects the debugging output to stdout (it defaults to stderr)\&. .PP The \fB\-I \fR\fIfilename\fR option tells bogolexer to read its input from the specified file, rather than from \fIstdin\fR\&. .PP The \fB\-O \fR\fIfilename\fR option tells bogolexer to write its output to the specified file, rather than to \fIstdout\fR\&. .PP The \fB\-V\fR option prints the version number and exits\&. .SH "AUTHOR" .PP The bogofilter developer team\&. .PP For updates, see \m[blue]\fBthe bogofilter project page\fR\m[]\&\s-2\u[1]\d\s+2\&. .SH "SEE ALSO" .PP bogofilter(1), bogotune(1), bogoupgrade(1), bogoutil(1) .SH "NOTES" .IP " 1." 4 the bogofilter project page .RS 4 \%http://bogofilter.sourceforge.net/ .RE bogofilter-1.2.4/doc/bogoupgrade.htmlin0000644000175000017500000001231312163573356016331 0ustar sezsezbogoupgrade

Name

bogoupgrade — upgrades bogofilter database to current version

Synopsis

bogoupgrade [-h] -d directory [-i input file] [-o output file] [-b path to bogoutil]

DESCRIPTION

bogoupgrade is a command to upgrade bogofilter's databases from an old format to the current format. Since the format of the database changes once in a while, the utility is designed to make the upgrade easy.

OPTIONS

The -h option prints the help message and exits.

The -d specifies the directory with the wordlists for converting. This option is used when converting from multiple, separate wordlists (spamlist.db and goodlist.db - containing spam and ham tokens, respectively) to a combined wordlist (wordlist.db) which contains both spam and ham tokens.

The -i specifies the input file to be converted. It should be a text file containing message counts, and possibly data. If there is no data in the text file, there should be a Berkeley DB file in the same directory as the text file which contains the data.

The -o specifies the output Berkeley DB file.

The -b gives the path to the bogoutil command. It defaults to 'bogoutil', in the hopes that your shell will find it.

UPGRADING

Follow these instructions to upgrade bogofilter's databases to the latest version.

  1. Stop all instances of bogofilter. While the upgrade tools lock the database files, the upgrade may take a long time if you have a busy site. Don't forget to stop cron jobs or daemons that fetch and process mail and could fire off bogofilter.

  2. Backup your data. Let's assume that you said:

    $ mv ~/.bogofilter ~/.bogofilter.safe
$ mkdir ~/.bogofilter

  3. If your bogofilter version is less than 0.7, say:

    $ bogoupgrade -i ~/.bogofilter.safe/goodlist -o ~/.bogofilter/goodlist.db
$ bogoupgrade -i ~/.bogofilter.safe/badlist -o ~/.bogofilter/spamlist.db

    If your bogofilter version is 0.7 or greater, say:

    $ bogoupgrade -i ~/.bogofilter.safe/hamlist.count -o ~/.bogofilter/goodlist.db
$ bogoupgrade -i ~/.bogofilter.safe/spamlist.count -o ~/.bogofilter/spamlist.db

  4. Current versions of bogofilter use a combined wordlist that holds both spam and non-spam tokens. It is named wordlist.db. If you're updating from a version older than 0.14.0 that has separate wordlists (named goodlist.db and spamlist.db), use:

    $ bogoupgrade -d ~/.bogofilter.safe

  5. Done. Restart any stopped daemons, cron tasks, etc.

AUTHOR

bogoupgrade was written by Gyepi Sam and David Relson .

For updates, see the bogofilter project page.

SEE ALSO

bogofilter(1), bogolexer(1), bogotune(1), bogoutil(1)

bogofilter-1.2.4/doc/README.sqlite0000644000175000017500000000556412163572307015003 0ustar sezsezSQLITE3 DATABASE DRIVER FOR BOGOFILTER ====================================== $Id: README.sqlite 6901 2010-04-01 16:05:05Z m-a $ This document only applies if you want to use bogofilter with SQLite3 databases. 1. Overview ----------------------------------------------------------- Bogofilter 0.93.3 and newer can use recent SQLite3 versions to store their tokens; see section 2.1 below for supported versions. SQLite is a database that handles a large SQL subset and stores all tables in one permanent file, and the journal for changes in one temporary file that gets automatically removed when no longer needed. SQLite3 ships with a command-line client for the shell, named sqlite3. 2. Prerequisites ------------------------------------------------------ 2.1 Compatibility - supported SQLite versions At this time, only SQLite v3.6.13, and v3.6.22 and newer are supported. Please check the SQLite website for upgrade recommendations. Older versions back to 3.0.8 may work, but you are advised to carefully review the sqlite3 ChangeLog, because there have been several important bug fixes since 3.0.8, including fixes for bugs that can corrupt the database. Note that sqlite v3.3.9 and newer sometimes generate error messages that are clearer when executing SQL statements (that bogofilter generates internally). Bogofilter prints a warning (but continues to run) when used with SQLite versions older than v3.6.12. This warning can be suppressed by defining the environment variable BF_USE_OLD_SQLITE to any value, including the empty value. The Oracle Berkeley DB SQLite3 API that is available since Berkeley DB 5.0.21 is unsupported. Use Berkeley DB's native API instead, see README.db for details. 2.2 Installation To use bogofilter with the SQLite3 back-end driver, you must install a sufficiently recent SQLite3 version before configuring bogofilter. You can download SQLite 3 and find installation instructions for SQLite 3 at , the SQLite installation is pretty straightforward. After that, you can configure bogofilter, add --with-database=sqlite to the ./configure command. 3. Use ---------------------------------------------------------------- 3.1 Care and feeding SQLite is pretty self-maintaining. After larger maintenance operations to remove older tokens you may want to run this command: sqlite3 ~/.bogofilter/wordlist.db 'VACUUM;' to remove unused pages from the database file and reduce the file size. A. Miscellaneous ------------------------------------------------------ A.1 Why does bogofilter use BLOB for both columns? bogofilter has traditionally managed its own data structure inside key and value, BLOB allows the verbatim retrieval of such data without stumbling across embedded NUL characters and without adding even more translations between data formats. END-------------------------------------------------------------------- bogofilter-1.2.4/doc/bogofilter.xml0000644000175000017500000007245012163572307015477 0ustar sezsez bogofilter 1 Bogofilter Reference Manual Bogofilter bogofilter fast Bayesian spam filter bogofilter help options classification options registration options parameter options info options general options config file options where are: -h --help -V -Q are: -p -e -t -T -u -H -M -b -B object ... -R general options parameter options config file options are: -s -n -S -N general options are: -c filename -C -d dir -k cachesize -l -L tag -I filename -O filename are: -E value,value -m value,value,value -o value,value are: -v -y date -D -x flags are: --option=value Note: Use bogofilter --help to display the complete list of options. DESCRIPTION Bogofilter is a Bayesian spam filter. In its normal mode of operation, it takes an email message or other text on standard input, does a statistical check against lists of "good" and "bad" words, and returns a status code indicating whether or not the message is spam. Bogofilter is designed with a fast algorithm, uses the Berkeley DB for fast startup and lookups, coded directly in C, and tuned for speed, so it can be used for production by sites that process a lot of mail. THEORY OF OPERATION Bogofilter treats its input as a bag of tokens. Each token is checked against a wordlist, which maintains counts of the numbers of times it has occurred in non-spam and spam mails. These numbers are used to compute an estimate of the probability that a message in which the token occurs is spam. Those are combined to indicate whether the message is spam or ham. While this method sounds crude compared to the more usual pattern-matching approach, it turns out to be extremely effective. Paul Graham's paper A Plan For Spam is recommended reading. This program substantially improves on Paul's proposal by doing smarter lexical analysis. Bogofilter does proper MIME decoding and a reasonable HTML parsing. Special kinds of tokens like hostnames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are ignored so as not to bloat the wordlist. Tokens found in various header fields are marked appropriately. Another improvement is that this program offers Gary Robinson's suggested modifications to the calculations (see the parameters robx and robs below). These modifications are described in Robinson's paper Spam Detection. Since then, Robinson (see his Linux Journal article A Statistical Approach to the Spam Problem) and others have realized that the calculation can be further optimized using Fisher's method. Another improvement compensates for token redundancy by applying separate effective size factors (ESF) to spam and nonspam probability calculations. In short, this is how it works: The estimates for the spam probabilities of the individual tokens are combined using the "inverse chi-square function". Its value indicates how badly the null hypothesis that the message is just a random collection of independent words with probabilities given by our previous estimates fails. This function is very sensitive to small probabilities (hammish words), but not to high probabilities (spammish words); so the value only indicates strong hammish signs in a message. Now using inverse probabilities for the tokens, the same computation is done again, giving an indicator that a message looks strongly spammish. Finally, those two indicators are subtracted (and scaled into a 0-1-interval). This combined indicator (bogosity) is close to 0 if the signs for a hammish message are stronger than for a spammish message and close to 1 if the situation is the other way round. If signs for both are equally strong, the value will be near 0.5. Since those message don't give a clear indication there is a tristate mode in bogofilter to mark those messages as unsure, while the clear messages are marked as spam or ham, respectively. In two-state mode, every message is marked as either spam or ham. Various parameters influence these calculations, the most important are: robx: the score given to a token which has not seen before. robx is the probability that the token is spammish. robs: a weight on robx which moves the probability of a little seen token towards robx. min-dev: a minimum distance from .5 for tokens to use in the calculation. Only tokens farther away from 0.5 than this value are used. spam-cutoff: messages with scores greater than or equal to will be marked as spam. ham-cutoff: If zero or spam-cutoff, all messages with values strictly below spam-cutoff are marked as ham, all others as spam (two-state). Else values less than or equal to ham-cutoff are marked as ham, messages with values strictly between ham-cutoff and spam-cutoff are marked as unsure; the rest as spam (tristate) sp-esf: the effective size factor (ESF) for spam. ns-esf: the ESF for nonspam. These ESF values default to 1.0, which is the same as not using ESF in the calculation. Values suitable to a user's email population can be determined with the aid of the bogotune program. OPTIONS HELP OPTIONS The option prints the help message and exits. The option prints the version number and exits. The (query) option prints bogofilter's configuration, i.e. registration parameters, parsing options, bogofilter directory, etc. CLASSIFICATION OPTIONS The (passthrough) option outputs the message with an X-Bogosity line at the end of the message header. This requires keeping the entire message in memory when it's read from stdin (or from a pipe or socket). If the message is read from a file that can be rewound, bogofilter will read it a second time. The (embed) option tells bogofilter to exit with code 0 if the message can be classified, i.e. if there is not an error. Normally bogofilter uses different codes for spam, ham, and unsure classifications, but this simplifies using bogofilter with procmail or maildrop. The (terse) option tells bogofilter to print an abbreviated spamicity message containing 1 letter and the score. Spam is indicated with "Y", ham by "N", and unsure by "U". Note: the formatting can be customized using the config file. The provides an invariant terse mode for scripts to use. bogofilter will print an abbreviated spamicity message containing 1 letter and the score. Spam is indicated with "S", ham by "H", and unsure by "U". The provides an invariant terse mode for scripts to use. Bogofilter prints only the score and displays it to 16 significant digits. The option tells bogofilter to register the message's text after classifying it as spam or non-spam. A spam message will be registered on the spamlist and a non-spam message on the goodlist. If the classification is "unsure", the message will not be registered. Effectively this option runs bogofilter with the or flag, as appropriate. Caution is urged in the use of this capability, as any classification errors bogofilter may make will be preserved and will accumulate until manually corrected with the and option combinations. Note this option causes the database to be opened for write access, which can entail massive slowdowns through lock contention and synchronous I/O operations. The option tells bogofilter to not tag tokens from the header. This option is for testing, you should not use it in normal operation. The option tells bogofilter to process its input as a mbox formatted file. If the or option is also given, a spamicity line will be printed for each message. The (streaming bulk mode) option tells bogofilter to classify multiple objects whose names are read from stdin. If the or option is also given, bogofilter will print a line giving file name and classification information for each file. This is an alternative to which lists objects on the command line. An object in this context shall be a maildir (autodetected), or if it's not a maildir, a single mail unless is given - in that case it's processed as mbox. (The Content-Length: header is not taken into account currently.) When reading mbox format, bogofilter relies on the empty line after a mail. If needed, formail -es will ensure this is the case. The (bulk mode) option tells bogofilter to classify multiple objects named on the command line. The objects may be filenames (for single messages), mailboxes (files with multiple messages), or directories (of maildir and MH format). If the or option is also given, bogofilter will print a line giving file name and classification information for each file. This is an alternative to which lists objects on stdin. The option tells bogofilter to output an R data frame in text form on the standard output. See the section on integration with R, below, for further detail. REGISTRATION OPTIONS The option tells bogofilter to register the text presented as spam. The database is created if absent. The option tells bogofilter to register the text presented as non-spam. Bogofilter doesn't detect if a message registered twice. If you do this by accident, the token counts will off by 1 from what you really want and the corresponding spam scores will be slightly off. Given a large number of tokens and messages in the wordlist, this doesn't matter. The problem can be corrected by using the option or the option. The option tells bogofilter to undo a prior registration of the same message as spam. If a message was incorrectly entered as spam by or and you want to remove it and enter it as non-spam, use . If is used for a message that wasn't registered as spam, the counts will still be decremented. The option tells bogofilter to undo a prior registration of the same message as non-spam. If a message was incorrectly entered as non-spam by or and you want to remove it and enter it as spam, then use . If is used for a message that wasn't registered as non-spam, the counts will still be decremented. GENERAL OPTIONS The option tells bogofilter to read the config file named. The option prevents bogofilter from reading configuration files. The option allows you to set the directory for the database. See the ENVIRONMENT section for other directory setting options. The option sets the cache size for the BerkeleyDB subsystem, in units of 1 MiB (1,048,576 bytes). Properly sizing the cache improves bogofilter's performance. The recommended size is one third of the size of the database file. You can run the bogotune script (in the tuning directory) to determine the recommended size. The option writes an informational line to the system log each time bogofilter is run. The information logged depends on how bogofilter is run. The option configures a tag which can be included in the information being logged by the option, but it requires a custom format that includes the %l string for now. This option implies . The option tells bogofilter to read its input from the specified file, rather than from . The option tells bogofilter where to write its output in passthrough mode. Note that this only works when -p is explicitly given. PARAMETER OPTIONS The option allows setting the sp-esf value and the ns-esf value. With two values, both sp-esf and ns-esf are set. If only one value is given, parameters are set as described in the note below. The option allows setting the min-dev value and, optionally, the robs and robx values. With three values, min-dev, robs, and robx are all set. If fewer values are given, parameters are set as described in the note below. The option allows setting the spam-cutoff ham-cutoff values. With two values, both spam-cutoff and ham-cutoff are set. If only one value is given, parameters are set as described in the note below. Note: All of these options allow fewer values to be provided. Values can be skipped by using just the comma delimiter, in which case the corresponding parameter(s) won't be changed. If only the first value is provided, then only the first parameter is set. Trailing values can be skipped, in which case the corresponding parameters won't be changed. Within the parameter list, spaces are not allowed after commas. INFO OPTIONS The option produces a report to standard output on bogofilter's analysis of the input. Each additional will increase the verbosity of the output, up to a maximum of 4. With , the report lists the tokens with highest deviation from a mean of 0.5 association with spam. Option can be used to override the current date when timestamping tokens. A value of zero (0) turns off timestamping. The option redirects debug output to stdout. The option allows setting of debug flags for printing debug information. See header file debug.h for the list of usable flags. CONFIG FILE OPTIONS Using GNU longopt syntax, a config file's statement becomes a command line's . Use command bogofilter --help for a list of options and see bogofilter.cf.example for more info on them. For example to change the X-Bogosity header to "X-Spam-Header", use: ENVIRONMENT Bogofilter uses a database directory, which can be set in the config file. If not set there, bogofilter will use the value of BOGOFILTER_DIR. Both can be overridden by the option. If none of that is available, bogofilter will use directory $HOME/.bogofilter. CONFIGURATION The bogofilter command line allows setting of many options that determine how bogofilter operates. File @sysconfdir@/bogofilter.cf can be used to set additional parameters that affect its operation. File @sysconfdir@/bogofilter.cf.example has samples of all of the parameters. Status and logging messages can be customized for each site. RETURN VALUES 0 for spam; 1 for non-spam; 2 for unsure ; 3 for I/O or other errors. If both and are used, the return values are: 0 for spam or non-spam; 3 for I/O or other errors. Error 3 usually means that the wordlist file bogofilter wants to read at startup is missing or the hard disk has filled up in mode. INTEGRATION WITH OTHER TOOLS Use with procmail The following recipe (a) spam-bins anything that bogofilter rates as spam, (b) registers the words in messages rated as spam as such, and (c) registers the words in messages rated as non-spam as such. With this in place, it will normally only be necessary for the user to intervene (with or ) when bogofilter miscategorizes something. # filter mail through bogofilter, tagging it as Ham, Spam, or Unsure, # and updating the wordlist :0fw | bogofilter -u -e -p # if bogofilter failed, return the mail to the queue; # the MTA will retry to deliver it later # 75 is the value for EX_TEMPFAIL in /usr/include/sysexits.h :0e { EXITCODE=75 HOST } # file the mail to spam-bogofilter if it's spam. :0: * ^X-Bogosity: Spam, tests=bogofilter spam-bogofilter # file the mail to unsure-bogofilter # if it's neither ham nor spam. :0: * ^X-Bogosity: Unsure, tests=bogofilter unsure-bogofilter # With this recipe, you can train bogofilter starting with an empty # wordlist. Be sure to check your unsure-folder regularly, take the # messages out of it, classify them as ham (or spam), and use them to # train bogofilter. The following procmail rule will take mail on stdin and save it to file spam if bogofilter thinks it's spam: :0HB: * ? bogofilter spam and this similar rule will also register the tokens in the mail according to the bogofilter classification: :0HB: * ? bogofilter -u spam If bogofilter fails (returning 3) the message will be treated as non-spam. This one is for maildrop, it automatically defers the mail and retries later when the xfilter command fails, use this in your ~/.mailfilter: xfilter "bogofilter -u -e -p" if (/^X-Bogosity: Spam, tests=bogofilter/) { to "spam-bogofilter" } The following .muttrc lines will create mutt macros for dispatching mail to bogofilter. macro index d "<enter-command>unset wait_key\n\ <pipe-entry>bogofilter -n\n\ <enter-command>set wait_key\n\ <delete-message>" "delete message as non-spam" macro index \ed "<enter-command>unset wait_key\n\ <pipe-entry>bogofilter -s\n\ <enter-command>set wait_key\n\ <delete-message>" "delete message as spam" Integration with Mail Transport Agent (MTA) bogofilter can also be integrated into an MTA to filter all incoming mail. While the specific implementation is MTA dependent, the general steps are as follows: Install bogofilter on the mail server Prime the bogofilter databases with a spam and non-spam corpus. Since bogofilter will be serving a larger community, it is important to prime it with a representative set of messages. Set up the MTA to invoke bogofilter on each message. While this is an MTA specific step, you'll probably need to use the , , and options. Set up a mechanism for users to register spam/non-spam messages, as well as to correct mis-classifications. The most generic solution is to set up alias email addresses to which users bounce messages. See the doc and contrib directories for more information. Use of R to verify bogofilter's calculations The -R option tells bogofilter to generate an R data frame. The data frame contains one row per token analyzed. Each such row contains the token, the sum of its database "good" and "spam" counts, the "good" count divided by the number of non-spam messages used to create the training database, the "spam" count divided by the spam message count, Robinson's f(w) for the token, the natural logs of (1 - f(w)) and f(w), and an indicator character (+ if the token's f(w) value exceeded the minimum deviation from 0.5, - if it didn't). There is one additional row at the end of the table that contains a label in the token field, followed by the number of words actually used (the ones with + indicators), Robinson's P, Q, S, s and x values and the minimum deviation. The R data frame can be saved to a file and later read into an R session (see the R project website for information about the mathematics package R). Provided with the bogofilter distribution is a simple R script (file bogo.R) that can be used to verify bogofilter's calculations. Instructions for its use are included in the script in the form of comments. Log messages Bogofilter writes messages to the system log when the option is used. What is written depends on which other flags are used. A classification run will generate (we are not showing the date and host part here): bogofilter[1412]: X-Bogosity: Ham, spamicity=0.000227 bogofilter[1415]: X-Bogosity: Spam, spamicity=0.998918 Using to classify a message and update a wordlist will produce (one a single line): bogofilter[1426]: X-Bogosity: Spam, spamicity=0.998918, register -s, 329 words, 1 messages Registering words ( and , , , or ) will produce: bogofilter[1440]: register-n, 255 words, 1 messages A registration run (using , , , or ) will generate messages like: bogofilter[17330]: register-n, 574 words, 3 messages bogofilter[6244]: register-s, 1273 words, 4 messages FILES @sysconfdir@/bogofilter.cf System configuration file. ~/.bogofilter.cf User configuration file. ~/.bogofilter/wordlist.db Combined list of good and spam tokens. AUTHOR Eric S. Raymond esr@thyrsus.com. David Relson relson@osagesoftware.com. Matthias Andree matthias.andree@gmx.de. Greg Louis glouis@dynamicro.on.ca. For updates, see the bogofilter project page. SEE ALSO bogolexer(1), bogotune(1), bogoupgrade(1), bogoutil(1) bogofilter-1.2.4/doc/bogofilter-tuning.HOWTO.html0000644000175000017500000005232212163572307020040 0ustar sezsez Tuning bogofilter

TUNING BOGOFILTER'S ROBINSON-FISHER METHOD -- an updated HOWTO

(Greg Louis, September 2004)

NB: Bogotune is a tool (shipped with bogofilter) that automates the tuning process. Its "full search" mode performs a five-dimensional grid search over possible values of the parameters to be described below, and comes up with recommendations for optimal settings. There's also a "partial search" mode that is only three-dimensional. If you have enough spam and nonspam messages (at least 2,500 of each), using bogotune is highly recommended for optimizing bogofilter's accuracy.

CONTENTS

INTRODUCTION

The bogofilter program has evolved through three classification methods: the original as proposed by Paul Graham and implemented in bogofilter by Eric S. Raymond; a variation proposed by Gary Robinson and implemented in bogofilter by Greg Louis; and a further variation, also proposed by Gary Robinson, which uses Fisher's method (Fisher, R. A., 1950: Statistical Methods for Research Workers, pp. 99ff.  London: Oliver and Boyd) of combining probabilities; for bogofilter, your author has implemented this one too.  Recently, Gary Robinson described a further improvement, the application of effective size factors in the scoring process; this is available by default in bogofilter, but since it's relatively new, an option exists in both bogofilter and bogotune to switch it off.

Each of Gary Robinson's proposed classification methods works better than the earlier versions.  For optimal results, they (and the original) require some tuning.  As distributed, bogofilter attempts to supply good starting values for the tunable parameters.  Since the optimum values depend on the size and content of the wordlists at your installation, the best results can only be determined by some experimentation using your wordlists.  After several thousand each of spam and nonspam messages have been fed to bogofilter for training, this experimentation can be well worthwhile: you may be able to cut the number of spams that are still getting through by more than half.

The purpose of this document is to explain how to adjust bogofilter's parameters for best spam filtering.  A manual tuning process is described; though you'll be wise to use bogotune to help find your parameter values, understanding the manual process will help you make sense of what bogotune does.

With Robinson's changes as implemented in bogofilter, there are seven (five without effective size factors) things to tune, six (or four) of which are highly interdependent, as explained below:

ROBINSON'S x

First off, you should determine the value of x appropriate to your training database.

The way bogofilter works, summarizing briefly, is that the message being classified is separated into "tokens" -- words, IP addresses and other logical units of information.  Each token is looked up in the wordlist that makes up the training database.  The number of times it's been seen in a spam message is divided by the total number of times it's been seen, and that gives an indication of the likelihood that the token is in a spam message.  The likelihood estimates for all the tokens are combined to give a score between 0 and 1 -- 0 means the message is not likely to be a spam, 1 means it is.  That's fine, but what happens if a token's never been seen before? That's where x comes in: it's a "first guess" at what the presence of an unknown token means, in terms of its contribution to the score.  It's the value used as the likelihood estimate when a new token is found.

Obtaining a value for x is easy: bogoutil will calculate it for you.

Assuming your bogofilter wordlist is in ~/.bogofilter, run

  bogoutil -r

This will print out an x value. If it's in the range of 0.4 to 0.6, you can run  bogoutil -R ~/.bogofilter  to install the calculated value so bogofilter will use it from then on.

The value of x that bogoutil calculates is just the average of

  p(w) = badcount / (goodcount + badcount)

for every word in your training set that appears at least 10 times in spam and/or ham counts in your wordlist (i.e. badcount + goodcount >= 10).

To be honest, that's an oversimplification, for the sake of explaining the basic concept clearly.  In real life, you have to scale the counts somehow.  If you had exactly the same number of spam and nonspam messages contributing to your wordlist, the formula for p(w) given above would be ok; but we actually have to use

  p(w) = (badcount / badlist_msgcount) /
         (badcount / badlist_msgcount + goodcount / goodlist_msgcount)

where badlist_msgcount is the number of spam messages that were fed into the training set, and goodlist_msgcount is the number of nonspams used in training.

An equivalent way of calculating x, that's a little easier to read, is:

  scalefactor = badlist_msgcount / goodlist_msgcount
  p(w) = badcount / (badcount + goodcount * scalefactor)

In either case, x is the average of those p(w) values.

The calculated x is just a first guess, and it may be worth while experimenting (after tuning s and the minimum deviation as described below) to see what happens if you adjust it up or downward within a range of about 0.1 either way.

ROBINSON'S s

With a count of zero for a given token, we have only x to go on, so that's what we use as the likelihood estimate for that token.  The question then arises, what if we have seen the token before, but only a few times? Statistical variation will result in the ratio of two small numbers being rather unreliable, so perhaps we ought to compromise between that ratio and our "first guess" value.  This is what the Robinson method does.

The compromise works like this: a parameter s is defined, that serves as a weighting factor; the larger the value of s, the more importance is given to x in the presence of low token counts.  The token count is  n = badcount + goodcount  and the p(w) value for the token is modified as follows:

  f(w) = (s * x + n * p(w))/(s + n)

As you see, if n is zero, f(w) is just x, as we have been saying all along; but if n is nonzero and small, the s * x term will influence the f(w) value.

Parameters s and x are only important when the counts are small, and the value of s reflects what we think of as "small." If s is large, then when counts are small we trust our x value more than we do the p(w); if s is small, we give more weight to p(w) and less to x.

So how big should s be? Gary Robinson suggested, on a theoretical basis, that we start with a value of 1; it might be worth trying values in the range of 0.01 to 10, though I've never had good results with values larger than 1.  Making s smaller than 0.01 or so is a bad idea, because of what happens when a token is encountered that's been seen in spam before, but never in nonspam, or vice versa.  In that case, p(w) is exactly 1 or 0, and f(w) will vary greatly as the value of s diminishes.  As an example, one spam that had about ten such tokens, out of 78 that contributed to the spam score, scored 0.999 with s set to 0.001, and was found to score 0.505 when s was 1.0e-8!

Choosing a value for s is a matter of trial and error.  Experience suggests that 0.1 might be a better starting value than 1, at least if your training database is moderately large.

THE MINIMUM DEVIATION

MIN_DEV is another thing you might need to vary.  Paul Graham's original method was based on looking only at the fifteen tokens with p(w) values farthest from 0.5 (nearest to 0 or 1).  We don't do it that way; instead, we set a minimum deviation from 0.5 (Gary Robinson coined the term "exclusion radius" for this parameter), and look at all the tokens with f(w) values farther away than that.  If the minimum is set to zero, every token in the message contributes its spammishness value f(w) to the final calculation.  It might save time, and perhaps improve discrimination, to ignore tokens with f(w) values near 0.5, since those tokens obviously make less difference to the outcome of the calculation.  It seems helpful, at least once the training database is a good size, to use a MIN_DEV value between 0.3 and 0.46.  You might try 0.35 initially; one experiment suggests that even 0.44 might be a good value, but that may not work for everyone.  In fact, some people are likely to find that quite a small value of MIN_DEV (around 0.05) works best.

Note that higher values of MIN_DEV accentuate the distortion caused by small s, because tokens appearing in only one of the spam and nonspam counts will (if present) be a higher proportion of the total number of tokens considered.

EFFECTIVE SIZE FACTORS (ESF)

Tokens tend to appear more than once in a given message.  If a spam contains the word "valium" it's likely to occur several times.  Bogofilter only uses any given token once in calculating the message score, no matter how many times it appears in the message; but since "spammy" and "non-spammy" tokens may occur with very different frequency in the populations of spam and nonspam messages respectively, it helps (as Gary Robinson pointed out) to take this difference in redundancy into account.  This is done as follows:  Without effective size factors, the score is calculated with inverse chi-squared function prbx thus:

P = prbx(-2 * sum(ln(1-f(w))), 2*N)
Q = prbx(-2 * sum(ln(f(w))), 2*N)
S = (1 + Q - P) / 2

and to apply ESF, we instead calculate:

P = prbx(-2 * ln(prod(1-f(w))^y), 2*N*y)
Q = prbx(-2 * ln(prod(f(w))^z), 2*N*z)
S = Q / (Q + P)

where y and z are the spam and nonspam ESF values, the prod function returns the product of all its arguments, and S is forced to 0.5 if Q and P are both very near zero.

Determining the correct values to use for y and z is, like choosing the value for s, a matter of trial and error.  A significant corpus of messages is required and users who don't have access to large collections of their spam and nonspam messages should probably opt to do without ESF.  Useful values to try seem to be in the range of 0.75 raised to powers between 1 and 20.

THE SPAM AND NONSPAM CUTOFFS

Most spam messages will have scores very close to 1 when the Fisher method of combining the likelihood estimates is applied, and most nonspam will have scores very close to 0.  In between, there is a grey area, where messages will fall that have both spammish and nonspammish characteristics.  The spam and nonspam cutoffs are thresholds: bogofilter classes messages with scores below the nonspam cutoff as nonspam, and those with scores at or above the spam cutoff as spam. Messages with scores between the two cutoff values are classed as uncertain.  (Usually, mail administrators will want to deliver mail classed as uncertain, even though some of it may well be spam.)

The best value for the spam cutoff depends strongly on the values of the x, s, MIN_DEV and ESF parameters that are being used in the calculation.  For that reason, the way to test a given parameter set is the following:

  1. Determine a suitable level of false positives (nonspams classified as spam); this will probably need to fall somewhere in the range of 0.05 to 0.3 percent (the lower the better, of course, except that lowering the false-positive target too much gives too many false negatives).
  2. Apply the parameters to classify a number of known nonspam messages. From the distribution of scores, pick a spam cutoff value that will give the selected proportion of false positives.
  3. Apply the parameters and the chosen spam cutoff to classify a number of spam messages; the parameter set should be judged on how few false negatives (spam messages classed as uncertain or nonspam) are obtained.

The value for the nonspam threshold should be such that no more than about one in ten thousand spams is classified as nonspam.  A value of 0.2 to 0.25 might be a good starting point for use with the recommended s and MIN_DEV (0.1 and 0.35 respectively).

AN OVERVIEW OF BOGOTUNE

As already mentioned, bogotune attempts to automate the above process by doing a grid search over useful ranges of s, MIN_DEV, x, y and z (an option exists to disable ESF, i.e. leave the ESF values [y and z] at 1.0).  Bogotune validates the test inputs, calculates a suitable cache size for the training database, calculates the starting x value as described above, and picks a false-positive target with which to run the grid search.  There is an option to force a specific target (more about this shortly).  If not coerced, the target is calculated based on the number of nonspam messages in the test set, and then adjusted downward to give a cutoff between 0.5 and 0.975, above 0.55 if possible.  It's important to note that this false-positive target is chosen to facilitate the grid search, and is usually very much larger than one would want to see in production; there's no relation between the two.  At the end of its run, bogotune attempts to suggest a reasonable production target.

With these preliminaries completed, bogotune performs two scans:  The first is a coarse grid search over the entire useful range of each parameter, which should locate an approximate optimum.  A finer grid, centered on the optimum derived from the coarse search, is then scanned to produce the final recommendations.  At the end of each scan, outliers -- apparently good parameter sets from which even slight deviation degrades performance significantly -- are rejected.  Bogotune usually manages to find a robust parameter set that gives good discrimination between spam and nonspam messages, provided that sufficient training and test messages are supplied.

There are two reasons why one might want to force a bogotune run to use a specific false-positive target.  One is that sometimes bogotune's target calculation algorithm is overly optimistic, i.e. it occasionally sets the target too low.  The symptom of this problem is that many parameter combinations in the coarse grid scan simply can't deliver that few false positives from the test message corpus.  Manually increasing the target by 20 to 30 percent usually fixes this.  The other reason to coerce the target to a specific value is that one might want to compare two bogotune runs -- with and without ESF, for example -- and comparisons aren't valid unless both runs use the same target.

Bogotune may produce very different recommendations for very similar sets of spam and nonspam messages.  That's not necessarily a defect.  For many message populations, the scoring algorithm doesn't depend heavily on precise values of any of the parameters but the spam cutoff.  In such cases it's common to see bogotune's coarse scan settle on one of several local optima that may have quite different parameter values.  In general, the parameter values have more influence when a single training database is used for a large number of users, and are less crucial when the wordlist is for just one or a few users.

HOW OFTEN TO TUNE

It's probably wise to review the spam cutoff frequently.  If the false-negative count is gratifyingly low, or if false positives are occurring, increasing the cutoff will reduce the false-positive rate. If, on the other hand, there are absolutely no false positives but the false-negative rate is high, lowering the cutoff a bit may improve discrimination.

How often to tune the other parameters depends on how fussy you are about optimizing performance.  If you're eager to get the best discrimination you can, here are my recommendations:  In the early stage, while the training database is still small and growing rapidly, it's probably wise to experiment with tuning x, s and MIN_DEV once a month or so.  Once the training database is a good size (over 5000 spams and 5000 nonspams), this can be reduced to quarterly or half-yearly.  If you use ESF (which I recommend you do), retuning should probably happen a bit more often, especially if you see that the characteristics of spam you're receiving seem to be changing.

FWIW my own practice, after two years' experience, is to review the spam cutoff monthly and do a bogotune run about quarterly.

A NOTE ON TRAINING

Bogofilter's ability to distinguish accurately between spam and nonspam messages depends on the quality of its training database.  Here is a way of maximizing that quality with relatively little effort.

When starting afresh, feed every spam and every nonspam you get into bogofilter.  Do not use bogofilter's -u option to do this: there will be far too many errors when your training database is small.  Instead, classify messages manually and train bogofilter with the -n and -s options appropriately.  You can do it in batches: if you work with standard mbox files, use a mail reader to move spam and nonspam into separate files, then do  bogofilter -s < spambox  and  bogofilter -n < nonspambox to register the messages.

To find out how many spam and nonspam messages have gone into your wordlist, assuming it's kept in ~/.bogofilter, do

  bogoutil -w ~/.bogofilter .MSG_COUNT

Once you've accumulated about 5,000 spam or nonspam messages in the list, you need to let the other count catch up unless they're growing at about the same rate.  Stop adding every message to the larger of the two counts, and instead, add only messages that bogofilter got wrong or was unsure about.  To do this, you need to start classifying messages into 4 sets instead of 2: spam, nonspam, unsures that were actually spam, and unsures that were nonspam.

Once the counts are both over 5,000 and fairly similar, you can train only on errors and unsures.  By this time there should be very few errors (spams classed as nonspam or vice versa), but there will still be a proportion of unsure spam and unsure nonspam messages. Training on these will keep bogofilter working well, as you're telling it what it needs to learn, and not so much of what it already knows. If one list grows faster than the other, extra (correctly classified) messages may be added from time to time to equalize them again; try to keep the smaller list's message count at least two thirds of the larger's.

The use of bogofilter's -u option is convenient but dangerous.  Even when well trained, bogofilter will misclassify a small number of messages.  With the -u option, these mistakes are entered into the database and decrease its accuracy.  More mistakes result and the process snowballs.  You therefore need to review and correct the databases frequently, and in the interval between such reviews, bogofilter's effectiveness will keep falling off.  The method described above has the advantage that (human error excepted) no wrongly classified messages are ever entered into the database, and if you have to leave it for a time without updating it, its effectiveness doesn't diminish.

Much of the advice given here arises out of experiments reported on the author's bogofilter web pages; in particular, the report at http://www.bgl.nu/bogofilter/smindev3.html might interest those who'd like more information about the basis of bogofilter tuning.

Thanks go to David Relson for reviewing this document in draft and suggesting several improvements.

[© Greg Louis, 2004; last modified 2004-09-09]
bogofilter-1.2.4/doc/README.db0000644000175000017500000006406012163572307014063 0ustar sezsezBERKELEY DB ENVIRONMENT CODE ============================ $Id: README.db 6978 2012-12-03 22:04:13Z m-a $ This document does not apply when you are installing a bogofilter version that has been configured to use the QDBM or SQLite3 database libraries. Common entry points are these QUICK LINKS: ------------ Upgrade of Berkeley DB or operating system section 2.6 Switching transactions on or off section 2.2.1 or 2.2.2 Recover broken database section 3.2 or 3.3 0. Definitions --------------------------------------------------------- Whenever ~/.bogofilter appears in the text below, this is the directory where bogofilter keeps its data base by default. If you are overriding this directory by configuration or environment variables, replace your actual bogofilter data base directory. 1. Overview ------------------------------------------------------------ Operating bogofilter with a Berkeley DB back-end requires some attention. Bogofilter offers two operating modes that can be switched on or off a directory-by-directory basis: - the traditional, simple Berkeley DB Data Store easy to use, but also easy to corrupt, an interrupted registration of spam or non-spam mail, an application crash, a system crash, a disk that runs out of space, a user that runs out of quota. - the Berkeley DB Transactional Data Store, transactional, TXN or XA in bogofilter jargon for short a bit more complex to use, but pretty crash-proof as long as it is not abused. Upgrading bogofilter, Berkeley DB, copying around databases and backups require special considerations given in this document. Note that the system administrator can disable either mode of operation at compile time; in the default install, either will be present. 2. Prerequisites and Caveats ------------------------------------------- 2.1 Compatibility, Berkeley DB versions These versions are supported (with all Sleepycat-posted patches applied - if using a pre-packaged Berkeley DB version, the packager should have applied the patches, check your vendor's update site regularly): Sleepycat Software: Berkeley DB 3.1.17: (July 31, 2000) Sleepycat Software: Berkeley DB 3.2.9: (January 24, 2001) Sleepycat Software: Berkeley DB 3.3.11: (July 12, 2001) Sleepycat Software: Berkeley DB 4.0.14: (November 18, 2001) Sleepycat Software: Berkeley DB 4.1.25: (December 19, 2002) Sleepycat Software: Berkeley DB 4.2.52: (December 3, 2003) Sleepycat Software: Berkeley DB 4.3.29: (September 6, 2005) Sleepycat Software: Berkeley DB 4.4.20: (January 10, 2006) Berkeley DB 4.5.20: (September 20, 2006) Berkeley DB 4.6.19: (August 10, 2007) Berkeley DB 4.7.25: (May 15, 2008) Berkeley DB 4.8.24: (August 14, 2009) Berkeley DB 4.8.26: (December 18, 2009) Berkeley DB 5.0.21: (March 30, 2010) Berkeley DB 5.1.19: (August 27, 2010) Berkeley DB 5.2.42: (February 29, 2012) Berkeley DB 5.3.21: (May 11, 2012) Other versions of Berkeley DB between the first and last listed above may or may not work but usually they will. Berkeley DB versions 4.1 and newer are recommended over the previous versions, because the newer can detect data corruptions more reliably (through the use of checksums that detect partially written data base pages); Berkeley DB 4.2 and 4.3 appear a bit faster under load than 4.1 and older versions, 4.4 and newer have not yet been evaluated for speed. 2.2.1 Upgrading to transactional databases, also from older bogofilter versions NOTE: for updates of Berkeley DB itself, see section 2.6! Bogofilter should transparently upgrade the existing data base to the new transactional data base, but going the reverse way requires manual intervention, see section 2.2.2 below. For enhanced reliability (only available with Berkeley DB 4.1 or newer), it is recommended that you dump and reload the database once so that Berkeley DB adds page checksums. Skip this procedure for Berkeley DB versions 4.0 or older. For 4.1 and newer, use these commands: cd ~/.bogofilter bogoutil -d wordlist.db > wordlist.txt mv wordlist.db wordlist.db.old bogoutil --db-transaction=yes -l wordlist.db < wordlist.txt And if all commands succeeded: rm wordlist.txt wordlist.db.old 2.2.2 Downgrading to non-transactional database To downgrade a transactional database to a non-transactional, a dump/reload cycle is required. These commands should do the job: cd ~/.bogofilter bogoutil -d wordlist.db > wordlist.txt mv wordlist.db wordlist.db.old rm -f log.?????????? __db.??? bogoutil --db-transaction=no -l wordlist.db < wordlist.txt 2.3 Recoverability The ability to recover the data base after a crash (power failure!) depends on data being written to the disk (or a battery-backed write cache) _immediately_ rather than delayed to be written later. Common disk drives in current PCs and MACs are of the ATA or SATA kind and usually ship with their write cache enabled. They write fast, but can lose or corrupt up to a few MB of data when the power fails. Note: This problem is not specific to bogofilter. It is possible to sacrifice a bit bit of the the write speed and get reliability in turn, by switching off the disk's write cache (see appendix A for instructions). Switching the write cache off may however adversely affect the performance below acceptable levels, particularly for large writes such as recording live audio or video data to hard disk. If performance is degraded too much, consider getting a separate disk drive and using one for fast writes (with the write cache on) and one for reliable writes (with the write cache off, for bogofilter, mail servers and other applications that need survive a power loss without data loss). 2.4 Choosing a file system If your computer saves the data on its own disk drive (a "local file system"), Berkeley DB should work fine. Such file systems are ext2, ext3, ffs, jfs, hfs, hfs+, reiserfs, ufs, xfs. Berkeley DB Transactional and Concurrent data stores do not work reliably with a networked file system for various technical reasons. AFS, CIFS, Coda, NFS, SMBFS fall into this category. Strictly speaking, with Berkeley DB 4.0 and older versions, the data base block size must be written atomically. The bogofilter maintainers are not currently aware of a file system that meets this requirement and is production quality at the same time. 2.5 Making a snapshot backup The transactional data store is no good if the disk drive has become inaccessible (which happens after some months or years with every drive), so you _must_ back up your data base regularly (see the db_archive utility manual for additional documentation of a "hot" backup), bogofilter cannot, of course, guess data that got lost through a hard drive fault. When copying or archiving directory contents, be sure to copy or archive the *.db files FIRST, BEFORE archiving/copying the log.* files, this is needed to let the database copy or archive remain recoverable. You can use the bf_tar script for convenience. It requires the pax utility (UNIX standard for over a decade now) and writes a tar archive to stdout, and it can optionally remove inactive log files before or after writing the tarball. Run bf_tar without arguments to see its synopsis. 2.6 Updating Berkeley DB version underneath bogofilter When upgrading the Berkeley DB library to a new version, or recompiling bogofilter to use a newer version, two things in the on-disk data format can change, generally speaking: the database format (we use the Btree access method), the log file format, or both. You need a "log file upgrade" for your transactional databases if at least one of these conditions is true ("-->" means "to") - you upgraded Berkeley DB from a 3.X version --> a 4.Y version - you upgraded Berkeley DB from a 4.X version --> a newer 4.Y version that means Y > X; EXCEPT if you upgraded from 4.0 to 4.1 Non-transactional databases do not need log file format upgrades as they do not use log files. If you need a log file upgrade, the upgrade procedure is: (NOTE: DO NOT UPGRADE BERKELEY DB OR BOGOFILTER UNTIL STEP 4!) 1. shut down your mail system, 2. run 'bogoutil --db-remove-environment ~/.bogofilter' (for each user!) (this will automatically recover the environment) 3. archive the database for catastrophic recovery (make a backup) 4. install the new Berkeley DB version, recompile bogofilter (unless using a binary package), install the new bogofilter 5. start your mail system. If you've been using Berkeley DB 3.0 (only supported with bogofilter versions 0.17.2 and older) and are about to update to any newer 3.X or 4.X version, you need a database format upgrade. You can either: - dump the wordlists to a text file, then update Berkeley DB and bogofilter, remove the wordlists and load them from the dump. The procedure is the same as in section 2.2.1 or 2.2.2 (depending on whether you want to use transactions or not). or - use the db_upgrade utility to upgrade the databases in place (this is dangerous and must not be interrupted, backup first!) 3. Use and troubleshooting --------------------------------------------- 3.1 LOG FILE HANDLING This section only applies to transactional databases. The Berkeley DB Transactional Data Store uses log files to store data base changes so that they can be rolled back or restored after an application crash. The logs of the transactional data store, log.NNNNNNNNNN files of up to 1 MB in size (in the default configuration), can consume considerable amounts of disk space. Bogofilter therefore removes log files that are no longer part of active transactions by default. This automatic removal of log files can be disabled by either using --db-log-autoremove=no on the command line, or by configuring db_log_autoremove=no in the configuration file. If automatic removal is disabled, it can manually be triggered by running 'bogoutil --db-prune ~/.bogofilter'. Note that removing log files makes catastrophic recovery impossible without backups, so you *must* make snapshot backups that contain both the *.db and log.* files (in this order!). See section 2.5 for details. Referral: Berkeley DB's db_archive documentation contains suggestions for several backup strategies. 3.2 RECOVERY AND FAILED RECOVERY, FOR TRANSACTIONAL DATABASES ONLY The recovery procedures should be tried in the order shown in this section. If you aren't willing to experiment much, but have kept sufficient spam and ham that you can easily and quickly retrain bogofilter from scratch, read only sections 3.2.1 and 3.2.5, skipping subsections 3.2.2 to 3.2.4. 3.2.1 Regular recovery Bogofilter and related bogo* utilities will automatically detect when regular recovery is needed and run it. This process is transparent, the user will usually be aware this happens. This process needs the *.db file and the corresponding _active_ log files. It is possible to trigger regular recovery by running bogoutil --db-recover ~/.bogofilter although this should not be needed. If this fails, remove the __db.*, *.db and log.* files, restore from the latest snapshot backup (see section 2.5) and force recovery as shown in the previous paragraph. 3.2.2 Catastrophic recovery If regular recovery fails after severe damage to hardware, filesystem, database files, you can attempt to run catastrophic recovery. If log files have been damaged, catastrophic recovery may not work. This may need *all* log files from the backup and is therefore not available if log files have been pruned. To run catastrophic recovery, replace the log files from your archives, then run: bogoutil --db-recover-harder ~/.bogofilter If this fails, read on. 3.2.3 Last-resort recovery method #1: nuke the environment This recovery methods do not guarantee you are getting all of your database, you may already have lost part or all of your data when this is required, and you may lose recent updates to the database and corrupt it. Only attempt this methods if the regular and catastrophic recovery methods have failed or were unavailable. To use this method: 1. remove the __db.* and log.* files 2. run: bogoutil -v --db-verify ~/.bogofilter/wordlist.db 3a. if that printed OK, watch carefully if bogofilter performs to the standards you are used to. 3b. if verify failed, read the next section. 3.2.4 Last-resort recovery method #2: salvage the raw .db file This recovery methods do not guarantee you are getting all of your database, you may already have lost part or all of your data when this is required, and you may lose recent updates to the database and corrupt it. Only attempt this methods if the regular and catastrophic recovery methods have failed or were unavailable. To try this method: # salvage raw data db_dump -r ~/.bogofilter/wordlist.db > ~/.bogofilter/wordlist.saved rm ~/.bogofilter/{__db.*,log.*,wordlist.db} db_load ~/.bogofilter/wordlist.db < ~/.bogofilter/wordlist.saved # convert to transactional store bogoutil -d ~/.bogofilter/wordlist.db > ~/.bogofilter/wordlist.saved rm ~/.bogofilter/{__db.*,log.*,wordlist.db} bogoutil --db-transaction=yes -l ~/.bogofilter/wordlist.db \ < ~/.bogofilter/wordlist.saved 3.2.5 No recovery possible? We're sorry. This should happen really rarely. There's nothing left to try, so you need to retrain from scratch. First, remove the database and environment, type: rm ~/.bogofilter/{__db.*,log.*,wordlist.db} Then retrain from scratch with the usual bogofilter -n and bogofilter -s commands. 3.3 RECOVERY OF TRADITIONAL (NON-TRANSACTIONAL) DATABASES Non-transactional databases do not store data that could help with recovering data, so the recovery options are: 3.3.1 Salvage raw data Note that your database may already have lost data, so this procedure may not recover everything that used to be in the database before the corruption happened. To try this, suspend mail delivery to your directory, run these commands: db_dump -r ~/.bogofilter/wordlist.db > ~/.bogofilter/wordlist.saved rm ~/.bogofilter/{__db.*,log.*,wordlist.db} db_load ~/.bogofilter/wordlist.db < ~/.bogofilter/wordlist.saved and resume mail delivery. 3.3.2 Restore from backup If the previous procedure has provided you with incomplete data, simply replace your wordlist.db file by the latest good copy that you have. 3.3.3 Retrain from scratch If you don't have good backups and the procedure from 3.3.1 also failed, you have no other choice than to remove the wordlist.db file and redo the whole training process with the usual bogofilter -s and bogofilter -n commands. 3.4 COPYING DATABASES If you intend to copy a transactional database, you MUST copy the *.db file(s) first and then the log.* files. Note that the database should NOT be subject to training while the copy is in progress, or automatic log file removal should be suspended while the copy is made. If you intend to copy a non-transactional database, you MUST NOT perform any training while the copy is in progress. Note that bogofilter's -u option can cause automatic training as mail arrives. If you need to copy the *.db files, DO NOT USE cp, BUT DO USE dd instead and give it a block size that matches the data base's block size, which can be found by running bogoutil --db-print-pagesize as shown in section 4.1 below. Example: dd if=~/.bogofilter/wordlist.db bs=4096 of=/tmp/copy.db The reason is that some operating systems let their cp command use mmap() for efficiency without guaranteeing consistency of mmap() versus simultaneous write(). A bf_copy script is provided for your convenience. 3.5 OTHER TROUBLESHOOTING 3.5.1 "Logging region out of memory; you may need to increase its size" This happens only for transactional databases. Use the DB_CONFIG file to set the log region size (set_lg_regionmax) higher and after that, run database recovery - see section 4.2 for details. 4. Other Information of Interest --------------------------------------- 4.1 GENERAL INFORMATION Berkeley DB keeps some additional statistics about the database itself, and in transactional databases also about caching, logging, transactions and their efficiency. The page size of the database file can be queried by bogoutil: bogoutil --db-print-pagesize ~/.bogofilter/wordlist.db Further statistics can be obtained by running the db_stat utility: db_stat -h ~/.bogofilter -d wordlist.db # data base statistics The following are only available in transactional mode: db_stat -h ~/.bogofilter -e # environment statistics db_stat -h ~/.bogofilter -m # buffer pool statistics db_stat -h ~/.bogofilter -l # log statistics db_stat -h ~/.bogofilter -t # transaction statistics Note that statistics may disappear when the data base is recovered. They will reappear after running bogofilter and are the more reliable the more often bogofilter has been used since the last recovery. You MUST NOT manually remove files named __db.NNN and log.NNNNNNNNNN from the ~/.bogofilter directory. ================================================ REMOVING THESE FILES CAUSES DATABASE CORRUPTION! ================================================ These can contain update data for the data base that must be still written back to the wordlist.db file - this happens when there are many concurrent processes alongside a registration process. You can safely remove the __db.NNN files with the following command, but note that these will reappear when bogofilter or bogoutil is used: bogoutil --db-remove-environment ~/.bogofilter log.* files are removed automatically in the default configuration, the remaining ones must remain in place. For further information and on safe removal, see section 3.1. 4.2 INTERESTING CONFIGURATION PARAMETERS FOR DB_CONFIG A "DB_CONFIG" file that is in your bogofilter home directory, usually ~/.bogofilter, can be used to configure the data base behavior of transactional databases. Some options take effect immediately, some need 'bogoutil --db-recover' to become effective. All options are ignored if the database in the same directory as DB_CONFIG is non-transactional. Here is a list of interesting settings. Use one per line, and omit the leading spaces and hyphen: SIZING OPTIONS: - set_cachesize G B C (valid in Berkeley DB 3.1 - 4.6, requires recovery to change) sets the cache size to G gigabytes plus B bytes which are spread out in C equally sized caches (all figures are natural numbers). You cannot configure caches smaller than 20 kB, Berkeley DB will increase all caches under 500 MB by 25%, and you must provide at least one cache per 4 GB. This option takes precedence over Bogofilter's db_cachesize option! Example: set_cachesize 0 60000000 6 will create six caches sized 12500000 bytes (12.5 MB, +25% applied) - set_lg_max 250000 (valid in Berkeley DB 3.1 - 4.6, takes effect immediately) this option configures the maximum log file size, in bytes, before Berkeley DB starts a new log file. The default is 1 MB. - set_lg_regionmax 262144 (valid in Berkeley DB 3.3 - 4.6, requires recovery to take effect) this option configures the log region size, in bytes, and may sometimes need to be increased. The default is around 60 kB. SAFE OPTIONS: - set_flags DB_DIRECT_DB (valid in Berkeley DB 4.1 - 4.6, takes effect immediately) this option turns off system buffering of *database* files, to avoid double caching of data. NOT SUPPORTED ON ALL PLATFORMS! - set_flags DB_DIRECT_LOG (valid in Berkeley DB 4.1 - 4.6, takes effect immediately) this option turns off system buffering of *log* files, to avoid double caching of data. NOT SUPPORTED ON ALL PLATFORMS! - set_flags DB_DSYNC_LOG (valid in Berkeley DB 4.3 - 4.6, takes effect immediately) this option can increase performance on some systems (and decrease on other systems), by using the O_DSYNC POSIX flag rather than a separate function to flush the logs. - set_flags DB_NOMMAP (valid in Berkeley DB 3.2 - 4.6, takes effect immediately) this option can reduce memory consumption at run time, particularly with large databases, at some cost of performance - set_flags DB_REGION_INIT (valid in Berkeley DB 3.2 - 4.6, takes effect immediately) this option causes all shared memory regions to be "page faulted" into core memory at application start and written at data base creation. This can improve performance under load, and it allows bogofilter or bogoutil to allocate disk space in advance, to avoid some out-of-space conditions later on. - set_verbose DB_VERB_CHKPOINT (valid in Berkeley DB 3.1 - 4.2, takes effect immediately) - set_verbose DB_VERB_DEADLOCK (valid in Berkeley DB 3.1 - 4.6, takes effect immediately) - set_verbose DB_VERB_RECOVERY (valid in Berkeley DB 3.1 - 4.6, takes effect immediately) - set_verbose DB_VERB_WAITSFOR (valid in Berkeley DB 3.1 - 4.6, takes effect immediately) these verbose flags cause extended output for long-lasting operations, ...CHKPOINT prints location information when searching for checkpoints, ...DEADLOCK prints information on deadlock detection, ...RECOVERY prints information during recovery and ...WAITSFOR prints the waits-for table during deadlock detection. UNSAFE OPTIONS - these may impair robustness/recoverability of the data base - set_flags DB_TXN_NOSYNC (valid in Berkeley DB 3.3 - 4.4, takes effect immediately) if set, the log is not written or synchronously flushed at commit time. In case of an application or system crash, the last few registrations can be lost. - set_flags DB_TXN_WRITE_NOSYNC (valid in Berkeley DB 4.1 - 4.4, takes effect immediately) if set, the log is written, but not synchronously flushed at commit time. In case of a system crash, the last few registrations can be lost. DANGEROUS OPTIONS - these can improve performance, but should be avoided - set_flags DB_TXN_NOT_DURABLE (valid in Berkeley DB 4.2 - 4.4, takes effect at next application start, replaced by DB_LOG_INMEMORY for version 4.3 - 4.4) this option prevents writing into log files. In case of application or system crashes, the data base can become corrupt, and large registrations can exhaust the log buffer space and then fail. - set_flags DB_LOG_INMEMORY (valid in Berkeley DB 4.3 - 4.4, takes effect at next application start) this option prevents the writing of any log files to disk. In case of application or system crashes, the data base can become corrupt, and large registrations can exhaust the log buffer space and then fail. After a crash, verify the data base (see below) and if it is corrupt, restore from backup or rebuild from scratch. 4.3 VERIFYING DATABASES TO CHECK FOR CORRUPTION To verify that the database is intact, type: bogoutil --db-verify ~/.bogofilter/wordlist.db There should be no output. If there are errors, you must recover your database, see section 3.2 for methods. A. Switching the disk drive's write cache off and on ------------------- A.1 Introduction You need to determine the name of the disk device and its type. Type "mount", you'll usually get an output that contains lines like these; find the "on /home" if you have it, if you don't check for "on /usr" if you have it, or finally, resort to looking at the "on /" line. From this line, look at the left hand column, usually starting with /dev. If you have FreeBSD, skip to section A.3 now. A.2 Switching the write cache off or on in Linux In this line you've found (see previous section A.1), you'll usually find something that starts with /dev/hda, /dev/hde or /dev/sda in the left hand column of that line, you can ignore the trailing number. /dev/hd* means ATA, /dev/sd* means SCSI. If the drive name starts with /dev/hd, type the following line, but replace hda by hde or what else you may have found: /sbin/hdparm -W0 /dev/hda (replace -W0 by -W1 to re-enable the write cache) If your drive name starts with /dev/sd, use the graphical scsi-config utility and add a blank the device name on the command line; for example: scsi-config /dev/sda You can "try changes" (they will be forgotten the next time the computer is switched off) or "save changes" (settings will be saved permanently); you can use the same utility to restore the previous setting or load manufacturer defaults. Skip to section 2.4. What is this scsi-config? The scsi-config command is a Tk script, delivered with the scsiinfo package. At the time of writing, scsiinfo can be found at ftp://tsx-11.mit.edu/pub/linux/ALPHA/scsi/scsiinfo-1.7.tar.gz . For users who don't run X on their mail servers, there is also a command-line utility, scsiinfo, in the package. Setting parameters with scsiinfo is a bit hairy, but the following sequence worked for two of us who tried it (back up your drive first): # get current disk settings and turn off the write cache # (substitute the appropriate device for /dev/sda in all these commands) parms=`scsiinfo -cX /dev/sda | sed 's/^./0/'` # write the parameters back to the hard drive's current settings # this needs to be put in a boot script scsiinfo -cXR /dev/sda $parms # if you don't want to put this in a boot script, you can alternatively # save the parameters to the hard drive's settings area: scsiinfo -cXRS /dev/sda $parms You did back up your drive before trying that, right? :) A.3 Switching the write cache off in FreeBSD Have you read section A.1 already? You should have. In this line you've found (see section A.1), you'll usually have a line that starts with /dev/ad0, /dev/wd0 (either means you have ATA) or /dev/da0 (which means you have SCSI). If you have ATA, add the line hw.ata.wc="0" to /boot/loader.conf.local, shut down all applications and reboot. (To revert the change, remove the line, shut down all applications and reboot.) If you have SCSI, you'll need to decide if you want the setting until the next reboot, or permanent (the permanent setting can be changed back, don't worry). In either case, omit the leading /dev and trailing s parts (/dev/da0s1a -> da0; /dev/da4s3f -> da4). Replace da0 by your device name in these examples, and leave out the part in parentheses: camcontrol modepage da0 -m8 -e -P0 (effective until computer is switched off) camcontrol modepage da0 -m8 -e -P3 (save parameters permanently) camcontrol will open a temporary file with a WCE: line on top. Edit the figure to read 0 (cache disabled) or 1 (cache enabled), then save the file and exit the editor. bogofilter-1.2.4/doc/bf_compact.1in0000644000175000017500000000460312163572475015330 0ustar sezsez'\" t .\" Title: bf_compact .\" Author: [see the "Authors" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BF_COMPACT" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bf_compact \- shell script to compact a bogofilter directory .SH "SYNOPSIS" .HP \w'\fBbf_compact\fR\ 'u \fBbf_compact\fR \fIbogofilter_directory\fR [\fIwordlist_name\fR...] .SH "DESCRIPTION" .PP \fBbf_compact\fR creates a more compact bogofilter working directory with a dump/load cycle and renames the previous \fIbogofilter_directory\fR to \fIbogofilter_directory\fR\&.old\&. .PP Note: \fBbf_compact\fR cannot be used to process the current working directory, "\&.", because that cannot be renamed\&. .PP If no \fIwordlist_file\fR arguments are given, then \fBbf_compact\fR will use the configured set of wordlists, if the given \fIbogofilter_directory\fR is the same as the configured, or use all *\&.db files if it is a different directory\&. .SH "EXIT STATUS" .PP The script exits with status code 0 if everything went well, and nonzero if it encountered trouble\&. .SH "NOTES" .PP This script will delete \fIbogofilter_directory\fR\&.old and all of its contents! .PP This script expects a SUSv2 compliant shell\&. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used\&. .SH "AUTHORS" .PP Matthias Andree bogofilter-1.2.4/doc/programmer/0000755000175000017500000000000012164443245014763 5ustar sezsezbogofilter-1.2.4/doc/programmer/RISC-OS/0000755000175000017500000000000012164443244016041 5ustar sezsezbogofilter-1.2.4/doc/programmer/RISC-OS/src/0000755000175000017500000000000012164443245016631 5ustar sezsezbogofilter-1.2.4/doc/programmer/RISC-OS/src/Makefile0000644000175000017500000001071612163572307020277 0ustar sezsez# Makefile for the RISC OS version of bogofilter # Define which compiler to use: CC = cc #CC = gcc # You might have to change the paths in the DBLIB and DBINCLUDE variables # to suit your configuration. DBINCLUDE = ^.^.qdbm DBLIB = ^.^.qdbm.libqdbm ######################################### # DO NOT EDIT ANYTHING BELOW THIS LINE! # ######################################### ifeq (${CC},cc) MAKE = amu CC = cc LD = link AR = libfile DEPEND = -depend !Depend CC_FLAGS = -Wdp -throwback -Otime -I@,^,^.^,$(DBINCLUDE),Unix: -JUnix: -D__riscos__ -DHAVE_CONFIG_H UNIXLIB = Unix:o.UnixLib else ifeq (${CC},gcc) MAKE = make CC = gcc LD = gcc AR = ar CC_FLAGS = -mthrowback -O3 -I@ -I^ -I^.^ -I$(DBINCLUDE) -D__riscos__ -DHAVE_CONFIG_H else # No other compiler supported! endif endif LIBGSL = ^.gsl.libgsl COMMON_OBJS = o.base64 \ o.bf_exit \ o.bogoconfig \ o.bogofilter \ o.bogoreader \ o.bool \ o.buff \ o.charset \ o.collect \ o.configfile \ o.datastore \ o.datastore_qdbm \ o.debug \ o.degen \ o.error \ o.fgetsl \ o.find_home \ o.find_home_tildeexpand \ o.find_home_user \ o.format \ o.globals \ o.graham \ o.lexer \ o.lexer_v3 \ o.maint \ o.memcmp \ o.memdebug \ o.mime \ o.msgcounts \ o.passthrough \ o.paths \ o.qp \ o.register \ o.rstats \ o.score \ o.strlcat \ o.strlcpy \ o.swap_32bit \ o.system \ o.textblock \ o.token \ o.transaction \ o.tunelist \ o.uudecode \ o.version \ o.word \ o.wordhash \ o.wordlists \ o.wordlists_base \ o.xatof \ o.xatoi \ o.xcalloc \ o.xmalloc \ o.xmemrchr \ o.xmem_error \ o.xrealloc \ o.xstrdup \ o.xstrlcat \ o.xstrlcpy BOGOFILTER_OBJS = o.main BOGOLEXER_OBJS = o.bogolexer BOGOTUNE_OBJS = o.bogotune BOGOUTIL_OBJS = o.bogoutil BOGOWORDFREQ_OBJS = o.bogowordfreq CONFIGTEST_OBJS = o.configtest .PHONY: all dist install clean .INIT: @cdir o ## Rule Patterns ## .SUFFIXES: .c .o .c.o: $(CC) $(CC_FLAGS) $(DEPEND) -c -o $@ $< # Static dependencies: all: bogofilter bogolexer bogotune bogoutil bogowordfreq configtest dist: install -cdir .doc -copy ^.AUTHORS .doc.* ~CF~V -copy ^.COPYING .doc.* ~CF~V -copy ^.NEWS .doc.* ~CF~V -copy ^.doc.bogofilter-faq/html .doc.* ~CF~V -copy ^.doc.bogofilter/htmlin .doc.bogofilter/html ~CF~V -copy ^.doc.bogolexer/htmlin .doc.bogolexer/html ~CF~V -copy ^.doc.bogotune/htmlin .doc.bogotune/html ~CF~V -copy ^.doc.bogoutil/htmlin .doc.bogoutil/html ~CF~V -settype .doc.AUTHORS Text -settype .doc.COPYING Text -settype .doc.NEWS Text -settype .doc.bogofilter-faq/html HTML -settype .doc.bogofilter/html HTML -settype .doc.bogolexer/html HTML -settype .doc.bogotune/html HTML -settype .doc.bogoutil/html HTML install: bogofilter bogolexer bogotune bogoutil bogowordfreq configtest -copy bogofilter .bin.* ~CF~V -copy bogolexer .bin.* ~CF~V -copy bogotune .bin.* ~CF~V -copy bogoutil .bin.* ~CF~V -copy bogowordfreq .bin.* ~CF~V -copy configtest .bin.* ~CF~V libbogo: $(COMMON_OBJS) $(AR) $(AR_FLAGS) -c -o $@ $(COMMON_OBJS) $(LIBGSL): dir ^.gsl $(MAKE) dir ^.src bogofilter: libbogo $(LIBGSL) $(BOGOFILTER_OBJS) $(DBLIB) $(LD) $(LD_FLAGS) -o $@ $(BOGOFILTER_OBJS) libbogo $(LIBGSL) $(DBLIB) $(UNIXLIB) bogolexer: libbogo $(BOGOLEXER_OBJS) $(DBLIB) $(LD) $(LD_FLAGS) -o $@ $(BOGOLEXER_OBJS) libbogo $(DBLIB) $(UNIXLIB) bogotune: libbogo $(LIBGSL) $(BOGOTUNE_OBJS) $(DBLIB) $(LD) $(LD_FLAGS) -o $@ $(BOGOTUNE_OBJS) libbogo $(LIBGSL) $(DBLIB) $(UNIXLIB) bogoutil: libbogo $(BOGOUTIL_OBJS) $(DBLIB) $(LD) $(LD_FLAGS) -o $@ $(BOGOUTIL_OBJS) libbogo $(DBLIB) $(UNIXLIB) bogowordfreq: libbogo $(BOGOWORDFREQ_OBJS) $(DBLIB) $(LD) $(LD_FLAGS) -o $@ $(BOGOWORDFREQ_OBJS) libbogo $(DBLIB) $(UNIXLIB) configtest: libbogo $(CONFIGTEST_OBJS) $(DBLIB) $(LD) $(LD_FLAGS) -o $@ $(CONFIGTEST_OBJS) libbogo $(DBLIB) $(UNIXLIB) clean: -ifthere bogofilter then wipe bogofilter ~CF~V -ifthere bogolexer then wipe bogolexer ~CF~V -ifthere bogotune then wipe bogotune ~CF~V -ifthere bogoutil then wipe bogoutil ~CF~V -ifthere bogowordfreq then wipe bogowordfreq ~CF~V -ifthere configtest then wipe configtest ~CF~V -ifthere libbogo then wipe libbogo ~CF~V -ifthere o.* then wipe o.* ~CF~V # Dynamic dependencies: bogofilter-1.2.4/doc/programmer/RISC-OS/gsl/0000755000175000017500000000000012164443245016627 5ustar sezsezbogofilter-1.2.4/doc/programmer/RISC-OS/gsl/Makefile0000644000175000017500000000271512163572307020275 0ustar sezsez# Makefile for the RISC OS version of gsl # Define which compiler to use: CC = cc #CC = gcc ######################################### # DO NOT EDIT ANYTHING BELOW THIS LINE! # ######################################### ifeq (${CC},cc) CC = cc LD = link AR = libfile DEPEND = -depend !Depend CC_FLAGS = -Wdp -throwback -Otime -I^,@,Unix: -JUnix: -D__riscos__ -DHAVE_CONFIG_H UNIXLIB = Unix:o.UnixLib else ifeq (${CC},gcc) CC = gcc LD = gcc AR = ar CC_FLAGS = -mthrowback -O3 -I^ -I@ -D__riscos__ -DHAVE_CONFIG_H else # No other compiler supported! endif endif CDF_OBJS = cdf.o.chisq \ cdf.o.gamma ERR_OBJS = err.o.error \ err.o.stream SPECFUNC_OBJS = specfunc.o.elementary \ specfunc.o.erfc \ specfunc.o.exp \ specfunc.o.expint \ specfunc.o.gamma_inc \ specfunc.o.log \ specfunc.o.psi \ specfunc.o.trig \ specfunc.o.zeta SYS_OBJS = sys.o.coerce \ sys.o.fdiv \ sys.o.infnan \ sys.o.pow_int .INIT: @cdir cdf.o @cdir err.o @cdir specfunc.o @cdir sys.o ## Rule Patterns ## .SUFFIXES: .c .o .c.o: $(CC) $(CC_FLAGS) $(DEPEND) -c -o $@ $< # Static dependencies: libgsl: $(CDF_OBJS) $(ERR_OBJS) $(SPECFUNC_OBJS) $(SYS_OBJS) $(AR) $(AR_FLAGS) -c -o $@ $(CDF_OBJS) $(ERR_OBJS) $(SPECFUNC_OBJS) $(SYS_OBJS) clean: -ifthere libgsl then wipe libgsl ~CFR~V -ifthere cdf.o.* then wipe cdf.o.* ~CFR~V -ifthere err.o.* then wipe err.o.* ~CFR~V -ifthere specfunc.o.* then wipe specfunc.o.* ~CFR~V -ifthere sys.o.* then wipe sys.o.* ~CFR~V # Dynamic dependencies: bogofilter-1.2.4/doc/programmer/README.osx0000644000175000017500000000240712163572307016457 0ustar sezsezCompiling Bogofilter on OS-X ============================= Bogofilter has been tested and is used on OS-X. There are two prerequisites for compiling Bogofilter on OS-X. 1. Berkeley DB 2. xlc or gcc (automatically detected if in the search path) Berkeley DB is available from Sleepycat Software, at . Users of the "Fink" package manager can install it using 'fink install db42 db42-bin db42-shlibs'. (They can optionally add db42-doc if you want the Berkeley DB documentation set installed as well.) You must pass the 'configure' script information on where to find the Berkeley DB headers and libraries, like this (for Fink): ./configure CPPFLAGS=-I/sw/include/db4 LDFLAGS=-L/sw/lib LIBS=-ldb-4.2 (the --with-libdb-prefix option does not work because it does not support different prefixes for libraries and headers) On the HP Gnome Desktop, try: ./configure --with-libdb-prefix=/opt/gnome Bogofilter can be built with either gcc or xlc. The configure script checks gcc first, then for xlc, then for cc, and uses the first that is found. To override the default choice, you can add CC=gcc34 (optionally with full path) to the configure command line. Read the INSTALL file for more information and additional options for the 'configure' script. bogofilter-1.2.4/doc/programmer/OS2/0000755000175000017500000000000012164443245015366 5ustar sezsezbogofilter-1.2.4/doc/programmer/OS2/configure.os20000644000175000017500000000046312163572307020000 0ustar sezsez#! /bin/sh CFLAGS="-s -Zomf -O3 -march=pentium -mcpu=pentium3" \ CXXFLAGS="-s -Zomf -O3 -march=pentium -mcpu=pentium3" \ LDFLAGS="-s -Zmap -Zhigh-mem -Zomf -Zexe" \ LN_CP_F="cp.exe" \ RANLIB="echo" \ AR="emxomfar" \ ./configure --with-libdb-prefix=e:/usr/local/berkeleydb.4.2 --prefix=/usr/local/bogofilter bogofilter-1.2.4/doc/programmer/README.memory-checking0000644000175000017500000000115512163572307020726 0ustar sezsez$Id: README.memory-checking 5251 2005-01-03 02:14:45Z m-a $ Bogofilter's test suite has support for several memory access/leak checking tools, namely Valgrind ("valgrind"), Electric Fence ("efence"), GNU libc ("glibc", default), and the Boehm-Demers-Weiser Conservative Garbage Collector ("boehm-gc"). To enable one of these, just add BF_CHECKTOOL=tool to your make check command line, example: make check BF_TESTDIR=/tmp BF_CHECKTOOL=boehm-gc If a leak checker is enabled, t.leakfind is a simple smoke test, it should PASS. If no leak checker is enabled, t.leakfind will report SKIP. -- Matthias Andree, 2005-01-03 bogofilter-1.2.4/doc/programmer/README.hp-ux0000644000175000017500000000306012163572307016703 0ustar sezsezCompiling Bogofilter on HP-UX ============================= Bogofilter has been tested on HP-UX 11.00 and 11i. There are two prerequisites for compiling Bogofilter on HP-UX. 1. Berkeley DB 2. HP ANSI C or gcc Berkeley DB may be obtained from Sleepycat Software, at http://www.sleepycat.com/ . Also available from HP as part of the HP release of the Gnome Desktop, at http://www.software.hp.com/products/GNOME/ . The Gnome Desktop and Gnome Developer bundles are required. HP ANSI C is available for purchase from HP, at http://www.software.hp.com/ . An alternative is gcc, an open-source ANSI C compiler available for free. gcc (and other open-source software) is available from HP, at http://h21007.www2.hp.com/dev/technologies/topic/1,2608,10602,00.html . Also available from the HP-UX Porting and Archive Centre, at http://hpux.connect.org.uk/ (and mirrors around the world). Be sure to run the 'configure' script with the '--with-libdb-prefix=/path/to/berkeley-db-dir' option so that 'configure' can find your Berkeley DB installation. For example, users with the HP Gnome Desktop would use 'configure --with-libdb-prefixxo=/opt/gnome'. Read the INSTALL file in this directory for more information and additional options for the 'configure' script. Please note that HP's lex is insufficient for generating lexer.c from lexer.l so a pre-generated lexer.c is included in the distribution. If you wish to make any changes or improvements to lexer.l this would require access to flex, an open-source version of lex. flex is available in the same locations as gcc (see above). bogofilter-1.2.4/doc/programmer/README.RISC-OS0000644000175000017500000000311112163572307016716 0ustar sezsezCompiling Bogofilter on RISC OS =============================== There are two prerequisites for compiling Bogofilter on RISC OS: 1. One compiler of the following two: - GCC (available for free on http://hard-mofo.dsvr.net/gcc/) - Norcroft C (available from http://www.castle.org.uk/castle/cinfo.htm) and UnixLib (available from http://hard-mofo.dsvr.net/unixlib/) 2. One database of the following two: - SQLITE3 - QDBM A RISC OS port of them is available from http://www.sbellon.de/sw-ports.html Place the top-level Bogofilter directory alongside the top-level database directory. In doc.programmer.RISC-OS you'll find (along-side to this README, so you already have found the correct place to look at!) a directory gsl and a directory src both containing a Makefile and a config/h file. Copy the contents of gsl over the directory gsl in bogofilter and the directory src over the directory src in bogofilter. Rename the source files of bogofilter from foobar/c to c.foobar (you can use utilities like unixify (http://www.mk-net.demon.co.uk/software/risc_os/) in order to ease up this task. Edit the first few lines of the Makefiles to suit your needs, then set your CSD (currently selected directory) to bogofilter.src and type either "amu" or "make" depending on whether you use Norcroft C and UnixLib or GCC in order to compile bogofilter. (Even if you use Norcroft, you'll need GCC for two files inside gsl as Norcroft C has a bug and can't compile them.) I will provide RISC OS binaries on my homepage (at http://www.sbellon.de/sw-ports.html) as well. Have fun, Stefan. bogofilter-1.2.4/doc/programmer/README.freebsd0000644000175000017500000000076212163572307017262 0ustar sezsezThe bogofilter ./configure script cannot currently auto-detect the non-standard install location of db3 or db4 on FreeBSD. To compile bogofilter on a stock FreeBSD 4.x with db3 or db4 installed via port or package, try to re-run configure like this: env CPPFLAGS=-I/usr/local/include/db3 LIBS=-ldb3 LDFLAGS=-L/usr/local/lib \ sh ./configure --with-libdb-prefix=/usr/local Replace the two "db3" with "db4" if appropriate, and adjust all /usr/local occurrences if your PREFIX is not /usr/local. bogofilter-1.2.4/doc/README.validation0000644000175000017500000000211112163572307015615 0ustar sezsez$Id: README.validation 3771 2003-12-17 14:43:19Z relson $ The bogofilter package will validate its SGML/XML documents prior to building either derived versions or the distribution tarball. The names of required packages differ greatly among the various distributions, some don't ship with the needed packages at all. Here's what packages are needed (assuming all their dependencies are installed as well according to the respective packager's directions): Mandrake Linux 9.1: HTML: OpenSP or openjade, HTML document type definitions installed manually XML: docbook-dtd412-xml, libxml2, libxml2-utils SuSE Linux 8.2: HTML: opensp, html-dtd XML: libxml2, libxslt, docbook_4, xmlto (needs to be installed manually) FreeBSD: HTML: jade or openjade, html XML: xmlto If you encounter a slew of errors, it may be necessary to create a catalog file. The following line will create the needed file for a Mandrake system (with html-4.01.tar.gz installed in /usr/share/sgml/html/): echo 'CATALOG "/usr/share/sgml/html/catalog"' > catalog vim:tw=79 com=bf\:* ts=8 sts=8 sw=8 ai: bogofilter-1.2.4/doc/Makefile.am0000644000175000017500000001126012163572307014645 0ustar sezsez# $Id: Makefile.am 6984 2012-12-04 00:40:24Z m-a $ # Tell BSD make(1) to not remake the .1in and .htmlin files. SUFFIXES= .1 .1in .htmlin .html # requires: # xmllint (libxml2) # xmlto (cyberelk.net) # nsgmls (opensp) # what to build man_MANS = bogofilter.1 bogoutil.1 bogoupgrade.1 bogolexer.1 bogotune.1 \ bf_copy.1 bf_tar.1 bf_compact.1 html_MANS = bogofilter.html bogoutil.html bogoupgrade.html \ bogolexer.html bogotune.html \ bf_copy.html bf_tar.html bf_compact.html all: $(man_MANS) $(html_MANS) CLEANFILES = $(man_MANS) $(html_MANS) HTML_DOCS = bogofilter-faq.html bogofilter-faq-fr.html bogofilter-faq-it.html bogotune-faq.html XHTML_DOCS= bogofilter-faq-bg.xhtml # what to distribute EXTRA_DIST = \ bogofilter.xml bogofilter.1in bogofilter.htmlin \ bogolexer.xml bogolexer.1in bogolexer.htmlin \ bogotune.xml bogotune.1in bogotune.htmlin \ bogoupgrade.xml bogoupgrade.1in bogoupgrade.htmlin \ bogoutil.xml bogoutil.1in bogoutil.htmlin \ bf_compact.xml bf_compact.1in bf_compact.htmlin \ bf_copy.xml bf_copy.1in bf_copy.htmlin \ bf_tar.xml bf_tar.1in bf_tar.htmlin \ $(HTML_DOCS) \ $(XHTML_DOCS) \ bogofilter-tuning.HOWTO.html \ bogofilter-SA-2002-01 bogofilter-SA-2004-01 \ bogofilter-SA-2005-01 bogofilter-SA-2005-02 \ bogofilter-SA-2010-01 \ bogofilter-SA-2012-01 \ integrating-with-postfix \ integrating-with-qmail \ programmer/OS2/configure.os2 \ programmer/README.freebsd programmer/README.hp-ux \ programmer/README.RISC-OS programmer/README.memory-checking \ programmer/README.osx \ programmer/RISC-OS/src/Makefile \ programmer/RISC-OS/gsl/Makefile \ rpm.notes.BerkeleyDB \ README.db README.sqlite \ README.validation # bogofilter.cf.example # strlcat.3 strlcpy.3 .1in.1: sed -e "s|[@]sysconfdir@|$(sysconfdir)|g" \ -e "s|[@]bindir@|$(bindir)|g" <$< >$@ \ || { rm -f $@ ; exit 1 ; } # same as .1in.1: above, but POSIX doesn't allow two targets on one line. .htmlin.html: sed -e "s|[@]sysconfdir@|$(sysconfdir)|g" \ -e "s|[@]bindir@|$(bindir)|g" <$< >$@ \ || { rm -f $@ ; exit 1 ; } if ENABLE_XMLTO dist-hook: @if [ ! -f catalog ] ; then \ echo ; echo "Warning: 'catalog' file not present; see 'README.validation'". ; echo ; else \ case "$(MFLAGS)" in *s*) : ;; *) echo >&2 "validating $(HTML_DOCS)" ;; esac ; \ ( set -e ; for i in $(HTML_DOCS) ; do $(NSGMLS) -s $(srcdir)/$$i \ || { echo >&2 "ERROR: $$i does not validate." ; exit 1 ; } ; done ) ; \ fi # Use Perl to fix up br0ken 0xa0 characters that the XML DocBook style # sheets emit instead of "\ " for roff or " " for HTML, # respectively. .xml.htmlin: $(XMLLINT) --noout --postvalid $< if test -f $(srcdir)/$@ && test $(srcdir)/$@ -nt $< ; then \ cp $(srcdir)/$@ . ; else \ if xmlto html-nochunks $< ; then f=$@ ; mv $${f%%in} $@ ; else rm -f $@ ; exit 1 ; fi ; \ perl -pl -e "s|\xA0| |g" -i $@ || { rm -f $@ ; exit 1 ; } \ fi .xml.1in: $(XMLLINT) --noout --postvalid $< if test -f $(srcdir)/$@ && test $(srcdir)/$@ -nt $< ; then \ cp $(srcdir)/$@ . ; else \ if xmlto man $< ; then f=$@ ; mv $${f%in} $@ ; else rm -f $@ ; exit 1 ; fi ; \ perl -pl -e "s|\xA0|\\ |g" -i $@ || { rm -f $@ ; exit 1 ; } \ fi else dist-hook: true .xml.1in: @echo 1>&2 @echo 1>&2 "You need xmlto to build bogofilter documentation." @echo 1>&2 @exit 1 .xml.htmlin: @echo 1>&2 @echo 1>&2 "You need xmlto to build bogofilter documentation." @echo 1>&2 @exit 1 endif .PHONY: check checkx checkx: @if echo ' </head><body /> </html>' | $(XMLLINT) --noout --nonet --postvalid - 2>/dev/null ; then \ set +e ; fail=0 ; for i in $(XHTML_DOCS) ; do if $(XMLLINT) --noout --postvalid $(srcdir)/$$i ; then echo PASS: $$i ; else echo FAIL: $$i: ; fail=1 ; fi ; done ; \ if test "$$fail" = 1 ; then echo >&2 "*** XHTML document invalid ***" ; false ; fi ; \ else echo >&2 "*** Not validating XHTML, XHTML 1.1 DTD not or improperly installed ***" ; fi check: checkx @if echo '<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"><HTML><HEAD><TITLE>

' | $(NSGMLS) -s 2>/dev/null; then \ set +e ; fail=0 ; for i in $(HTML_DOCS) ; do if $(NSGMLS) -s $(srcdir)/$$i ; then echo PASS: $$i ; else echo FAIL: $$i: ; fail=1 ; fi ; done ; \ else echo >&2 "*** Not validating HTML, nsgmls/HTML DTDs improperly installed ***" ; fi ; \ if test "$$fail" = "1" ; then echo >&2 "*** HTML document invalid ***" ; false ; fi bogofilter-1.2.4/doc/bogofilter-faq-fr.html0000644000175000017500000020435012163572307017011 0ustar sezsez FAQ Bogofilter

FAQ Bogofilter

Versions Officielles: en Anglais ou Français ou Italien ou Bulgares
Mainteneur: David Relson <relson@osagesoftware.com>
Traducteur: Fabrice Prigent <Fabrice.Prigent@univ-tlse1.fr>

Ce document a pour but de répondre aux questions fréquemment posées sur Bogofilter.

Qu'est ce que Bogofilter?

Bogofilter est un filtre bayésien rapide basé sur les travaux de Paul Graham dans son article Un plan contre le Spam. Bogofilter utilise l'algorithme de moyenne géométrique de Gary Robinson avec la méthode modifiée de Fisher (khi2) pour classifier les spams et hams (N.D.T.: les mails autres que des spams).

La page web de Bogofilter chez SourceForge est le point central pour toutes les ressources sur Bogofilter.

Bogofilter a été créé par Eric S. Raymond le 19 Août 2002. Il a gagné en popularité depuis Septembre 2002, et un grand nombre de programmeurs ont commencé à participer au projet.

Le fichier NEWS décrit l'historique des versions de Bogofilter.

Bogo-quoi?

Bogofilter est une sorte de bogomètre (bogometer) ou filtre à bogues (bogon-filter), c'est à dire qu'il essaie d'identifier des mails bogués (bogus) en mesurant leur bogosité (bogosity).

Comment fonctionne Bogofilter?

Jetez d'abord un oeil sur la section THEORY OF OPERATION du manuel pour une introduction. La principale source pour comprendre est l'article de Gary Robinson dans le Linux Journal "A Statistical Approach to the Spam Problem" (Une approche statistique du problème du Spam).

Après avoir lu tout ceci, vous vous posez probablement quelques questions. La première pourrait être "Bogofilter est-il réellement un filtre anti-spam bayésien?" Bogofilter est basé sur le théorème de Bayes et l'utilise dans les premières parties du calcul, puis d'autres méthodes statistiques par la suite. On peut donc affirmer sans risque qu'il s'agit d'un filtre anti-spam statistique avec un parfum bayésien.

D'autres questions qui pourraient vous assaillir concerneraient les prérequis ou hypothèses de la théorie de Bayes. Les réponses simples sont : "Non, ils ne sont pas remplis" et "On s'en moque tant que cela marche". Une réponse plus élaborée mentionnerait que le postulat de base qui dit que "Un email est une collection aléatoire de mots, totalement indépendants les uns des autres" est violé. Il y a plusieurs points où la pratique prend des libertés avec la théorie. Certains sont tout le temps présents, d'autres dépendent de la manière dont vous utilisez Bogofilter :

  • Les mots dans un e-mail ne sont en aucun cas indépendants. Dans toutes les langues c'est même le contraire qui prime.
  • Les mots utilisés ne sont pas aléatoires, même si certains spammeurs utilisent des mots aléatoires.
  • L'entrainement complet, ou utilisant un échantillon aléatoire, suit les principes de Bayes. Choisir les messages pour l'entrainement viole le postulat disant que les messages utilisés pour l'entrainement sont un échantillon aléatoire des messages reçus. Ce principe est aussi violé par la fonction auto-update de Bogofilter (avec le paramètre tresh_update), l'entrainement sur erreur, ou n'importe quelle approche similaire.
  • La même chose s'applique si vous utilisez le même message plus d'une fois.
  • D'autres problèmes peuvent être soulevés par le fait de modifier la base de données en enlevant les tokens (en utilisant par exemple bogoutil avec -a ou -c).
  • Il y en a certainement d'autres.

Comme la page manuel l'explique, Bogofilter essaie de composer avec l'influence négative de ces hypothèses non respectées. Certains disent que "ces écarts de la réalité travaillent en général en notre faveur" (Article de Gary). D'autres disent que, même dans ce cas, nous devrions ne pas trop nous écarter des hypothèses de base. En fait, ersonne ne sait réellement. Gardez simplement à l'esprit que si vous "chargez la mule", des problèmes se poseront. La clé de l'approche de Bogofilter est : la chose qui importe le plus est que cela fonctionne dans le monde réel.

Maintenant que vous avez été prévenus, amusez vous et utilisez Bogofilter au mieux de vos besoins.

Listes de diffusion

Il existe actuellement 4 listes de diffusion pour Bogofilter (en anglais):

Adresses des listes Liens Description
bogofilter-announce@bogofilter.org [subscribe] [archives: mailman, gmane] Une liste où sont annoncées les nouvelles versions.
bogofilter@bogofilter.org [subscribe] [archives: mailman, gmane] Une liste de diffusion généraliste sur Bogofilter.
bogofilter-dev@bogofilter.org [subscribe] [archives: mailman, gmane] Une liste pour des échanges de patches, le développement, et les discussions techniques.
bogofilter-cvs@lists.sourceforge.net [abonnement] [archive] Une liste pour annoncer les changements de code sur l'archive CVS.

Comment débuter l'apprentissage de Bogofilter?

Pour classifier les messages comme ham ou spam, Bogofilter a besoin d'apprendre votre courrier. Pour commencer, le mieux est d'avoir un corpus (aussi large que possible) de messages dont vous êtes sûr de l'état de ham ou de spam. (Des erreurs à ce stade occasionneront des problèmes plus tard, aussi, soyez attentifs ;-)). Attention, n'utilisez que votre email. L'utilisation d'autres corpus (tel qu'un corpus trouvé sur Internet), peut pousser Bogofilter à tirer de mauvaises conclusions après tout, votre but est de lui faire comprendre votre courrier.

Une fois que vous avez vos corpus de spam et de ham, vous avez quatre choix possibles. Dans tous les cas, cela fonctionnera mieux si votre base d'apprentissage (les corpus ci-dessus) est conséquente. Plus un corpus est petit, plus grand sera le nombre d'erreurs que fera Bogofilter en production. Supposons que vos corpus se trouvent dans deux fichiers mbox: ham.mbox et spam.mbox.

  • Méthode 1) Entrainement complet: Entraînez Bogofilter avec tous vos messages. Dans notre example:

        bogofilter -s < spam.mbox
    bogofilter -n < ham.mbox

Note: Le répertoire contrib de Bogofilter contient deux scripts qui tous les deux utilisent une technique d'entrainement sur erreur. Cette technique évalue chaque message et n'ajoute à la base de données que les messages qui ont été mal évalués (messages marqués comme incertains, ham évalués en tant que spam ou inversement). Le but est de créer une base de données des mots réellement nécessaires pour classer correctement les messages. La base de données résultante est plus petite que celle de l'entrainement complet.

  • Méthode 2) Utilisez le script bogominitrain.pl (dans le répertoire contrib). Il évalue les messages le même ordre que vos fichiers mailbox. Vous devriez utiliser l'option -f qui va demander au script de répéter le travail, jusqu'à ce que tous les messages soient classés correctement. (Si nécessaire, vous pouvez même ajuster le niveau de certitude). Comme le script s'assure que la base de données connaît "tout" votre corpus d'entrainement (avec la précision de votre choix), cela fonctionne très bien. Vous pouvez utiliser -o pour créer une marge de sécurité autour de "spam_cutoff" Avec spam_cutoff=0.6 vous voudrez peut-être évaluer tous les hams dans votre corpus en dessous de 0.3 et tous les spams au delà de 0.9. Notre exemple devient:

        bogominitrain.pl -fnv ~/.bogofilter ham.mbox spam.mbox '-o 0.9,0.3'

  • Méthode 3) Utilisez le script randomtrain (dans le répertoire contrib). Le script génère une liste de tous les messages dans les mailbox, mélange la liste, puis évalue chaque message, suiv d'un entrainement si nécessaire. Dans notre exemple:

        randomtrain -s spam.mbox -n ham.mbox

    Comme pour la méthode 4, cela fonctionne mieux si vous commencer avec un corpus d'entrainement de plusieurs milliers de messages. Ceci vous donnera une base de données plus complète et significativement plus grande.

  • Méthode 4) Si vous avez suffisamment de spam et de ham dans votre corpus, "réservez" 10000 spams et 10000 hams dans des fichiers mbox séparés, puis utilisez ce corpus pour l'entraînement. Lancez alors Bogofilter pour classer les spams et hams restants. Prenez tout message incorrectement évalué ou ayant le statut incertain, et utilisez les pour un nouvel apprentissage. Cette méthode donne la meilleure méthode possible de discrimination. Voici deux petits scripts qui peuvent être utilisés pour classifier les messages "mauvais élèves".

        #! /bin/sh
    #  class3 -- classe un message en mauvais, bon ou incertain
    cat >msg.$$
    bogofilter $* <msg.$$
    res=$?
    if [ $res = 0 ]; then
        cat msg.$$ >>corpus.bad
    elif [ $res = 1 ]; then
        cat msg.$$ >>corpus.good
    elif [ $res = 2 ]; then
        cat msg.$$ >>corpus.unsure
    fi
    rm msg.$$
        #! /bin/sh
    # classify -- Place tous les messages dans un fichier mbox à l'aide de class3
    src=$1;
    shift
    formail -s class3 $* <$src

    Dans notre exemple (après l'entrainement initial):

        classify spam.mbox [bogofilter options]
    bogofilter -s < corpus.good
    rm -f corpus.*
    classify ham.mbox [bogofilter options]
    bogofilter -n < corpus.bad
    rm -f corpus.*

Comparaison de ces méthodes

Il est important de comprendre les conséquences des méthodes que nous venons de décrire. Faire un entrainement complet, tel que dans les méthodes 1 et 4 produit une base de données plus grande que ne le ferait un entrainement avec les méthodes 2 ou 3. Si votre base de données doit être de petite taille (par exemple à cause de quotas), utilisez les méthodes 2 ou 3.

L'entrainement avec la méthode 1 est le plus rapide. L'entrainement sur erreur (tel que décrit dans les méthodes 2,3 et 4) est efficace, mais l'apprentissage est plutôt lent.

Comment lancer l'entrainement avec des formats mbox et maildir?

Entrainement initial avec un format mbox:

    bogofilter -M -s -I ~/mail/Spam
    bogofilter -M -n -I ~/mail/NonSpam

Entrainement initial avec un format maildir:

    bogofilter -s -B ~/Maildir/.Spam
    bogofilter -n -B ~/Maildir/.NonSpam

Entrainement sur erreur avec un format mbox:

    bogofilter -M -Ns -I ~/mail/Missed_Spam
    bogofilter -M -Sn -I ~/mail/False_Spam

Entrainement sur erreur avec un format maildir:

    bogofilter -s -B ~/Maildir/.Missed_Spam
    bogofilter -n -B ~/Maildir/.False_Spam

Comment puis-je conserver une bonne acuité?

Bogofilter fera des erreurs de temps en temps. C'est pourquoi un apprentissage régulier est important. Il existe principalement deux méthodes pour le faire. Premièrement, vous pouvez l'entraîner avec chaque nouveau message (en utilisant l'option -u). Deuxièmement, vous pouvez ne l'entraîner que sur des erreurs.

De plus, vous pouvez reconstruire votre base à certains moments, par exemple quand une nouvelle fonctionnalité importante est ajoutée à Bogofilter. Il peut être alors fort utile de mettre à jour régulièrement votre corpus d'apprentissage.

Bogofilter fait toujours de son mieux avec les informations disponibles. Cependant, il fera des erreurs, tel que classer des ham en spam (faux positifs) ou spam en ham (faux négatifs). Pour réduire la probabilité d'un réapparition de l'erreur, il sera nécessaire d'entrainer Bogofilter avec le message erroné. Si un message est classé incorrectement spam, utilisez l'option -n pour l'intégrer en tant que ham. Utilisez l'option -s pour l'intégrer en tant que spam.

Bogofilter a une option -u qui, automagiquement, met à jour la liste des mots après chaque évaluation de messages. Comme Bogofilter fait parfois des erreurs, cette méthode a l'inconvénient de dégrader la base d'entrainement avec des entrées erronées. Vous aurez alors besoin de la regarder et la corriger fréquemment. La correction peut être faite en utilisant -Sn pour changer la classification du message de spam en ham et -Ns pour changer de ham en spam.

Corriger un message incorrectement classé peut affecter la classification d'autres messages. Plus votre base de données sera petite, plus grande sera la probabilité qu'une erreur d'apprentissage créee des classifications incorrectes.

L'utilisation de la méthode 2 ou 3 (ci-dessus) peut compenser cet effet. Repéter l'entrainement avec le corpus complet (y compris les messages de corrections ajoutés depuis le précédent apprentissage). Ceci ajoutera des messages dans la base de données afin que d'atteindre un nouvel équilibre, annulant les effets éventuellement de "surcompensation".

Une stratégie alternative, basée sur la méthode 4 de la section précédente est la suivante: Périodiquement, prenez des blocs de messages et utilisez les scripts de la méthode 4 pour les classer. Analyser manuellement les spams, ham et incertains, corriger les erreurs, puis séparer les incertains en hams et spam. Jusqu'à ce que vous ayez 10000 spams et 10000 hams dans votre base d'apprentissage, entraînez avec les hams, les spams, puis les erreurs et enfin les incertains. Plus tard, vous n'entrainerez qu'avec les erreurs et les incertains, en ignorant les messagess que Bogofilter a correctement classé.

Notez que vous devrez régulièrement lancer:

    bogoutil -d wordlist.db | bogoutil -l wordlist.db.new
    mv wordlist.db wordlist.db.prv
    mv wordlist.db.new wordlist.db

ou pour les fichiers spamlist.db et goodlist.db (si vous utilisez Bogofilter avec les listes de mots séparés). Ceci compressera les bases de données pour n'occuper que le minimum d'espace disque nécessaire.

Quels formats de fichier Bogofilter comprend-il?

Bogofilter comprend les formats mbox traditionnel, Maildir et MH. Bogofilter ne soutient pas des sous-répertoires, vous devrez explicitement les lister si vous avez des répertoires Maildir++ ou MH - mentionnez seulement les noms absoluts des sous-répertoires.

Pour des formats non soutenus, vous devrez transformer le fichier en un format que Bogofilter comprend. Mbox est souvent commode parce qu'il peut être enovyé directement à bogofilter.

Par exemple, pour convertir format UW-IMAP/PINE mbx en mbox: 

    mailtool copy /full/path/to/mail.mbox '#driver.unix//full/path/to/mbox'

ou:

    for MSG in /full/path/to/maildir/* ; do 
        formail -I Status: < "$MSG" >> /full/path/to/mbox
    done

Quelle est la signification de la sortie verbeuse de Bogofilter?

On peut dire à Bogofilter d'afficher des informations sur l'évaluation d'un message en le lançant avec les paramètres "-v", "-vv", "-vvv", or "-R".

  • En utilisant "-v", Bogofilter génère la ligne d'entête "X-Bogosity:", par exemple 
      X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
  • En utilisant "-vv" Bogofilter génère un histogramme, par exemple 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
      int  cnt    prob   spamicity  histogram
     0.00   29  0.000209  0.000052  #############################
     0.10    2  0.179065  0.003425  ##
     0.20    2  0.276880  0.008870  ##
     0.30   18  0.363295  0.069245  ##################
     0.40    0  0.000000  0.069245
     0.50    0  0.000000  0.069245
     0.60   37  0.667823  0.257307  #####################################
     0.70    5  0.767436  0.278892  #####
     0.80   13  0.836789  0.334980  #############
     0.90   32  0.984903  0.499835  ################################

    Chaque ligne présente un intervalle, le nombre de tokens (N.D.T. élément minimal pour le traitement, généralement un mot) avec le score dans cet intervalle, la moyenne de la probabilité de spam pour ces tokens, l'évaluation de la "spamicité" du message (pour les tokens de cet intervalle ou des précédents) et une barre correspondant au nombre de tokens.

    Dans l'histogramme ci-dessus, il y a beaucoup de tokens à faible score et à haut score. Ils s'équilibrent pour donner une "spamicité" de 0.500000

  • En utilisant "-vvv" on produit la liste de tous les tokens dans le message, avec de l'information pour chacun d'un. Par exemple: 
      X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
                        n    pgood     pbad      fw     U
  "which"              10  0.208333  0.000000  0.000041 +
  "own"                 7  0.145833  0.000000  0.000059 +
  "having"              6  0.125000  0.000000  0.000069 +
  ...
  "unsubscribe.asp"     2  0.000000  0.095238  0.999708 +
  "million"             4  0.000000  0.190476  0.999854 +
  "copy"                5  0.000000  0.238095  0.999883 +
  N_P_Q_S_s_x_md      138  0.00e+00  0.00e+00  5.00e-01
                           1.00e-03  4.15e-01  0.100
    Les colonnes affichées donnent les informations suivantes:
    "…"
    le token pris en compte
    n
    Le nombre de fois ou le token a été rencontré lors de l'apprentissage
    pgood
    Proportion de bons messages (ham) contenant ce token
    pbad
    Proportion de mauvais messages (spam) contenant ce token
    fw
    L'index pondéré de Robinson, qui combine pgood et pbad pour donner une valeur qui sera proche de zéro si un message contenant ce token est vraisemblablement un ham, et proche de un s'il est vraisemblablement un spam.
    U
    '+' Si ce token contribue à la note finale, '-' sinon. Un token est exclu quand un score est à moins de "min_dev" de 0.5. min_dev est paramétrable.

    La dernière ligne montre:

    • Les résultats cumulés des colonnes
    • Les valeurs des paramètres de Robinson s et x et celle de min_dev
  • Utiliser "-R" produit la sortie de "-vvv" décrite plus haut plus 2 colonnes supplémentaires:
    invfwlog
    le logarithme of fw
    fwlog
    le logarithme of (1-fw)

    La sortie de "-R" est présentée pour être utilisé avec le langage R de calcul statistique. Plus d'information est disponible sur la page du projet R pour le calcul statistique http://www.r-project.org/.

Qu'est-ce que le mode Unsure?

La configuration par défaut de Bogofilter classera un message en tant que spam ou non-spam. Le paramètre SPAM_CUTOFF est utilisé pour cela. Les messages avec un score supérieur ou égal à SPAM_CUTOFF sont classés en spam. Les autres en ham.

Il y a aussi un paramètre HAM_CUTOFF. Quand il est utilisé, les messages doivent avoir un score inférieur ou égal à HAM_CUTOFF pour être classés ham. Les messages avec un score compris entre HAM_CUTOFF et SPAM_CUTOFF sont étiquetés "unsure". Si vous regardez le fichier bogofilter.cf, vous verrez les lignes suivantes :

    #### CUTOFF Values
    #
    #    both ham_cutoff and spam_cutoff are allowed.
    #    setting ham_cutoff to a non-zero value will
    #    enable tri-state results (Spam/Ham/Unsure).
    #
    #ham_cutoff  = 0.45
    #spam_cutoff = 0.99
    #
    #    for two-state classification:
    #
    ## ham_cutoff = 0.00
    ## spam_cutoff= 0.99

Pour activer la classification Yes/No/Unsure, enlevez les dièses devant les deux dernières lignes.

Alternativement, si vous préférez utiliser les labels Yes/No/Unsure au lieu de Spam/Ham/Unsure, enlevez les dièses devant la ligne : 

    ## spamicity_tags = Yes, No, Unsure

Une fois que cela est fait, vous pourrez inclure les règles de filtrage suivantes pour votre outil de messagerie:

    if header contains "X-Bogosity: Spam", put in Spam folder
    if header contains "X-Bogosity: Unsure", put in Unsure folder

De plus, bogofilter.cf possède des directives pour modifier la ligne Sujet:, par exemple.

    #### SPAM_SUBJECT_TAG
    #
    #	tag added to "Subject: " line for identifying spam or unsure
    #    default is to add nothing.
    #
    ##spam_subject_tag=***SPAM***
    ##unsure_subject_tag=???UNSURE???

Avec de tels marqueurs, les règles de filtrage ressembleraient à ceci:

    if subject contains "***SPAM***", put in Spam folder
    if subject contains "???UNSURE???", put in Unsure folder

Qu'est-ce que "l'entrainement sur erreur" et "l'entrainement sur épuisement"?

"L'entrainement sur erreur" implique l'analyse d'un corpus de messages dont le statut de spam ou ham est connu. Seuls ceux qui sont mal classés, ou dont le classement est incertain, seront intégrés dans la base de données d'apprentissage. Il a été montré que la sélection des seuls messages "mauvais élèves" était un moyen efficace d'entrainement. Si l'on entrainait Bogofilter avec tous les messages, il va réapprendre avec des spams ou hams évidents.

Cette méthode peut être améliorée en utilisant une "marge de sécurité". En augmentant la valeur "spam cutoff" et en diminuant la valeur "ham cutoff", les messages qui sont proches du seuil seront utilisés, pour l'entrainement. L'utilisation de cette marge de sécurité a montré son efficacité à améliorer les résultats dans l'entrainement sur erreur. En général, des marges plus larges sont une aide supplémentaire (malgré le fait que des marges trop grandes ne soient pas optimales). Pour un mode à triple état, vous pouvez utiliser le milieu de l'état unsure avec un intervalle de +/- 0.3 pour l'entrainement

Répéter l'entrainement sur erreur sur le même corpus de message peut améliorer la précision. L'idée est que les messages qui ont été bien classés une première fois peuvent, à la suite de l'entrainement, être mal classés. Fait qui sera compensé par cette répétition.

"L'entrainement sur épuisement" est la répétition de l'entrainement sur erreur, avec le même corpus de messages, jusqu'à ce que plus aucune erreur ne subsiste. Cette méthode peut aussi être améliorée grâce aux marges de sécurité. Voir pour cela L'article de Gary Robinson pour plus de détail.

Note: bogominitrain.pl possède une option -f qui permet de réaliser "l'entrainement sur épuisement". Si vous choisissez de l'utiliser, soyez conscient des effets secondaires possibles. L'utilisation de -fn évite de répéter l'entrainement pour chaque message.

Que fait l'option '-u' (autoupdate)?

L'option '-u' (autoupdate) est utilisé pour compléter automatiquement la liste de mots. Quand cette option est utilisée et que Bogofilter classe un message en Spam ou Ham, les tokens du message sont ajoutés dans la liste de mots avec un marqueur ham ou spam (suivi le contexte).

Prenons le cas de l'arrivée d'un nouveau message "Refinance now - best Mortgage rates". Il contient des mots que Bogofilter a déjà vu et, probablement, des nouveaux. En utilisant '-u' ces nouveaux mots seront ajoutés dans la liste des mots, afin que Bogofilter puisse mieux reconnaître les messages suivants qui lui ressembleraient.

Si vous utilisez '-u', vous avez besoin de regarder attentivement les erreurs de classification et de réentrainer Bogofilter avec les messages qu'il a mal identifiés. Un message incorrectement classé et qui est auto-appris _peut_ amplifier les futures mauvaises classifications de Bogofilter. C'est le même problème que si vous, administrateur système, vous enregistriez mal un message : ham en spam ou vice versa.

Comment puis-je utiliser SpamAssassin pour l'apprentissage de Bogofilter?

Si vous avez un SpamAssassin actif (ou si vous voulez en créer un), vous pouvez utiliser ses codes de retour pour l'apprentissage de Bogofilter. Le moyen le plus simple est de créer un script pour votre MDA qui fait tourner SpamAssassin, tester l'état du code de retour spam/ham, et lancer Bogofilter pour valider le message. Le script procmail ci-dessous est un moyen de le faire:

    BOGOFILTER     = "/usr/bin/bogofilter"
    BOGOFILTER_DIR = "training"
    SPAMASSASSIN  = "/usr/bin/spamassassin"

    :0 HBc
    * ? $SPAMASSASSIN -e
    #spam yields non-zero
    #non-spam yields zero
    | $BOGOFILTER -n -d $BOGOFILTER_DIR
    #else (E)
    :0Ec
    | $BOGOFILTER -s -d $BOGOFILTER_DIR

    :0fw
    | $BOGOFILTER -p -e

    :0:
    * ^X-Bogosity:.Spam
    spam

    :0:
    * ^X-Bogosity:.Ham
    non-spam

Comment traiter les spams asiatiques?

Beaucoup de personnes reçoivent du mail non sollicité utilisant des caractères asiatiques. Comme ils ne pratiquent pas la langue et qu'ils ne connaissent personne là bas, ils supposent qu'il s'agit de spam.

La bonne nouvelle est que bogofilter les détecte de manière plutôt efficace. La mauvaise nouvelle est que cela peut être coûteux. Vous avez en gros trois possibilités:

  • Vous pouvez simplement laisser bogofilter gérer le problème. Entraînez le avec des messages asiatiques identifiés comme spam. Bogofilter analysera les messages du mieux qu'il peut et ajoutera des tokens à la liste des mots de spam. La liste des mots contiendra beaucoup de tokens qui n'auront pas de sens pour vous (puisque la table de caractères ne peut être affichée), mais Bogofilter peut travailler avec eux et identifier correctement du spam asiatique.

  • Une seconde méthode est d'utiliser l'option du fichier de configuration "replace_nonascii_characters". Ceci remplacera les caractères à code ASCII "haut" (ceux compris entre 0x80 et 0xFF) avec des points d'interrogations '?'. Ceci permet de garder une base de petite taille. Malheureusement ceci entre en conflit avec les langues européennes qui contiennent beaucoup de voyelles et de consonnes accentuées à code ASCII "haut".
  • Si vous êtes sûr de ne jamais recevoir un message légitime dans ces langues, vous pouvez directement les détruire. Cela diminuera la base d'autant. Vous pouvez le faire avec un script MDA.
  • Ceci est un script qui effacera les messages écrits avec les tables de caractères asiatiques
  • ## Efface silencieusement tous les mails en langue asiatique
    UNREADABLE='[^?"]*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987'
    :0:
    * 1^0 $ ^Subject:.*=\?($UNREADABLE)
    * 1^0 $ ^Content-Type:.*charset="?($UNREADABLE)
    spam-unreadable

    :0:
    * ^Content-Type:.*multipart
    * B ?? $ ^Content-Type:.*^?.*charset="?($UNREADABLE)
    spam-unreadable

    Avec un tel programme, Bogofilter ne verra jamais le message.

Comment compacter les bases?

Vous pouvez périodiquement compacter les bases afin d'occuper un minimum d'estpace disque. En supposant que votre base de mots se trouve dans le répertoire ~/.bogofilter, pour bogofilter 0.93.0 (ou plus récent) tapez :

    bf_compact ~/.bogofilter wordlist.db

Pour un bogofilter antérieur à 0.93.0, tapez:

    cd ~/.bogofilter
    bogoutil -d wordlist.db | bogoutil -l wordlist.db.new
    mv wordlist.db wordlist.db.prv
    mv wordlist.db.new wordlist.db

Ce script est nécessaire pour dupliquer votre environnement de base de données (afin de supporter le traitement des transactions en BerkeleyDB). Votre répertoire original sera renommé en ~/.bogofilter.old et ~/.bogofilter contiendra le nouvel environnement.

Pour les anciennes versions de Bogofilter qui n'utilisent pas le principe des transactions, la base de données est un simple fichier (wordlist.db) et ne nécessite pas d'utiliser le script. Les commandes ci-dessus créent une nouvelle base de données plus compacte et renomment le fichier original en wordlist.db.prv

Note: Il est tout à fait valide d'utiliser le script avec d'anciennes versions de Bogofilter.

Comment faire une requête manuelle sur la base?

Pour trouver le nombre de spam et ham pour un token (mot), utiliser l'option '-w' de bogoutil. Par exemple, "bogoutil -w $BOGOFILTER_DIR/wordlist.db example.com" fournit le nombre de ham et spam pour "example.com".

Si vous voulez le score de spamicité en plus du nombre de ham et spam pour un token, utilisez l'option '-p' de bogoutil. Par exemple, "bogoutil -p $BOGOFILTER_DIR/wordlist.db example.com" fournit en plus des nombres ham et spam, le score du mot.

Pour trouver combien de messages sont dans votre liste de mots, faites une requête sur le pseudo-token ".MSG_COUNT" (avec le point devant NdT). Par exemple, lancez la commande "bogoutil -w $BOGOFILTER_DIR/wordlist.db .MSG_COUNT".

Pour dire combien de tokens sont présents dans votre liste de mots, envoyez la sortie de la commande dump de bogoutil vers la commande "wc". Par exemple utilisez "bogoutil -d $BOGOFILTER_DIR/wordlist.db/wordlist.db | wc -l " pour afficher le nombre d'apparitions des tokens (Si vous utilisez spamlist.db et goodlist.db, lancez la commande pour chacun d'eux).

Puis-je utiliser plusieurs listes de mots?

Oui. Bogofilter peut travailler avec plusieurs listes de mots. Par exemple, si vous avez des listes utilisateur et systeme, Bogofilter peut vérifier si le mot se trouve dans la liste utilisateur, et si le mot ne s'y trouve pas, vérifier la liste systeme. Bogofilter peut aussi mixer ensemble l'information des deux listes.

Voici par les options du fichier de configuration et quelques exemples:

Une liste de mots possède plusieurs attributs, particulièrement le type, le nom, le nom de fichier et la précédence.

  • Le type: 'R' et 'I' (pour Regular et Ignore). Les listes actuelles sont de type 'R'. Le type 'I' signifie "n'évalue pas le token s'il est trouvé dans la liste ignore".
  • Nom: un identifiant court qui sera utilisé pour l'affichage de messages d'erreur. Par exemple "global", "utilisateur" et "ignore". Mais n'importe quel identifiant est valide.
  • Nom du fichier: le nom du fichier des mots. Quand on ouvre la base, si le chemin est complètement qualifié (avec un '/' en tête, ou '~') le nom est utilisé, sinon Bogofilter ajoute le contenu des variables de chemin dans l'ordre suivant : $BOGOFILTER_DIR, $BOGODIR, $HOME.
  • Précédence: c'est un entier tel que 1, 2, 3, ... On recherche le token dans les listes de mots dans le sens ascendant de la précédence. Si le token est trouvé, les listes de même précédence sont utilisées pour faire la somme des comptes. Les listes avec une précédence supérieure, ne sont pas vérifiées.

Exemple 1 - mixage des listes systeme et utilisateur:

    wordlist R,utilisateur,~/wordlist.db,1
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,1

Exemple 2 - priorité à la liste utilisateur:

    wordlist R,utilisateur,~/wordlist.db,2
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,3

Exemple 3 - priorité à la liste systeme:

    wordlist R,utilisateur,~/wordlist.db,5
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,4

Note 1: les options d'enregristrement de Bogofilter ('-s', '-n', '-u', '-S', '-N' ) ne s'appliqueront qu'aux listes les plus basses en précédence.

Note 2: avoir des listes de type 'R' et 'I' de même précédence n'est pas autorisé, car les types sont contradictoires.

Puis-je indiquer à Bogofilter d'ignorer certains tokens?

A travers l'utilisation des listes de type "ignore", Bogofilter ne prendra pas en compte les tokens listés pour évaluer le message.

Exemple:

    wordlist I,ignore,~/ignorelist.db,7
    wordlist R,systeme,/var/spool/bogofilter/wordlist.db,8

Puisque ignorelist.db a un index inférieur (7), à celui de wordlist.db (8), Bogofilter ne regardera pas les tokens qui se trouveront dans ignorelist.db.

Note: Techniquement, Bogofilter donne le score de ROBX aux tokens, et s'attend à ce que le paramètre min_dev les fasse "annuler".

Il y a deux méthodes principales pour construire/maintenir une liste "ignore".

Primo, un fichier texte peut être créé et maintenu à l'aide d'un éditeur. Bogoutil peut alors convertir le fichier texte en base de données, e.g. "bogoutil -l ignorelist.db < ignorelist.txt".

Secondo, echo ... | bogoutil ... peut être utilisé pour ajouter un simple token, par exemple "ignorez.moi" :

  echo ignorez.moi | bogoutil -l ~/ignorelist.db

Comment puis-je faire pour transformer la base des mots séparé dans le format combiné?

Lancez le script bogoupgrade. Pour plus d'informations lancez "bogoupgrade -h" pour voir le message d'aide ou "man bogoupgrade" et lisez la page manuel.

Comment faire si ma liste de mots est corrompue?

Si vous pensez que vos listes de mots ont été dégradées, vous pouvez regarder ce qu'en dit BerkeleyDB en lançant:

    db_verify wordlist.db

S'il y a un problème, vous pouvez récupérer tout ou partie des tokens et leur nombre avec la commande suivante:

    bogoutil -d wordlist.db | bogoutil -l wordlist.new.db

ou - si la liste ne pourrait pas être récupérée par la commande précédente - avec:

    db_dump -r wordlist.db > wordlist.txt
    db_load wordlist.new.db < wordlist.txt

Comment puis-je convertir ma base de mots de/vers l'unicode?

La base de mots peut être convertie du format brut vers l'unicode en utilisant les commandes suivantes :

    bogoutil -d wordlist.db > wordlist.raw.txt
    iconv -f iso-8859-1 -t utf-8 < wordlist.raw.txt > wordlist.utf8.txt
    bogoutil -l wordlist.db.new < wordlist.utf8.txt

ou alors :

    bogoutil --unicode=yes -m wordlist.db

La base de mots peut-être convertie de l'unicode vers le format brut en tapant ceci :

    bogoutil -d wordlist.db > wordlist.utf8.txt
    iconv -f utf-8  -t iso-8859-1 < wordlist.utf8.txt > wordlist.raw.txt
    bogoutil -l wordlist.db.new < wordlist.raw.txt

ou encore:

    bogoutil --unicode=no -m wordlist.db

Comment passer du mode non-transactionnel au mode transactionnel?

La procédure est complètement documentée dans le fichier doc/README.db section 2.2.1. Nous vous suggérons de lire complètement le paragraphe.

En résumé, utilisez ces commandes: 

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    bogoutil --db-transaction=yes -l wordlist.db < wordlist.txt

Si tout ce passe bien, vous pouvez enlever les fichiers de sauvegarde:

    rm wordlist.db.old wordlist.txt

Comment passer du mode transactionnel au mode non transactionnel?

La procédure est complètement documentée dans le fichier doc/README.db section 2.2.1. Nous vous suggérons de lire complètement le paragraphe.

En résumé, vous pouvez utiliser bogoutil pour copier et recharger la base de mots, par exemple : 

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    rm -f log.?????????? __db.???
    bogoutil --db-transaction=no -l wordlist.db < wordlist.txt

Pourquoi Bogofilter meurt après avoir afficher "Lock table is out of available locks" ou "Lock table is out of available object entries"

Les modes transactionnel et concurrent de BerkeleyDB nécessitent une table de verrouillage qui correspond à la base de données en taille. Lisez le fichier README.db pour une explication détaillée et la solution.

La taille de la table de verrouillage peut-être paramétrée dans bogofilter.cf ou dans DB_CONFIG. Bogofilter.cf utilise les directives db_lk_max_locks et db_lk_max_objects, tandis que DB_CONFIG utilise les directives set_lk_max_objects et set_lk_max_locks.

Après avoir changé ces valeurs dans DB_CONFIG, lancez la commande 

  bogoutil --db-recover /votre/repertoire/bogofilter

pour reconstruire la table de verrouillage.

Comment se fait-il que j'obtienne des messages DB_PAGE_NOTFOUND?

Vous avez certainement un problème avec votre base de données BerkeleyDB. Il y a deux causes probables : soit vous avez atteint une taille limite, ou bien, la base est corrompue.

Certains serveurs de messagerie, tel Postfix, impose une taille de fichier limite. Quand la base de données Bogofilter atteint cette limite, des problèmes d'écriture apparaissent.

Pour voir la taille utilisée par la base de données:

    ls -lh $BOGOFILTER_DIR/wordlist.db

Pour voir la taille limite avec postfix:

    postconf | grep mailbox_size_limit

Pour positionner la taille limite à 73MB (ou n'importe quelle taille appropriée):

    postconf -e mailbox_size_limit=73000000

Si vous pensez que votre base de données est corrompue, lisez le point Comment faire si ma liste de mots est corroumpue? de la FAQ.

Pourquoi obtient-on "Berkeley DB library configured to support only DB_PRIVATE environments" ou
"Berkeley DB library configured to support only private environments"?

Certaines distributions (par exemple le projet Fedora) propose BerkeleyDB avec le support des threads POSIX, et par conséquent les mutexes POSIX, alors que votre système ne supporte pas ces mutexes. (ceci dépend de votre version de noyau et du type exact de processeur).

Pour contourner le problème

  1. téléchargez, compilez et installez Berkeley DB manuellement et reconfigurez bogofilter:
    1. cd build_unix
    2. ../dist/configure --enable-cxx
    3. make
    4. make install
  2. recompilez et installez bogofilter:
    1. ./configure --with-libdb-prefix=/usr/local/BerkeleyDB.4.3 (remplacer le numéro de version de Berkeley DB)
    2. make && make check
    3. make install (si la notion d'espace est importante utilisez make install-strip)

Bogofilter peut-il fonctionner en environnement multi-utilisateurs?

Oui, il peut. Il existe de multiples stratégies pour le faire. les deux extrêmes sont:

  • Avoir un administrateur Bogofilter qui maintient une base globale que chacun utilise.
  • Que chaque utilisateur maintienne sa propre base.

Le compromis courant : l'administrateur Bogofilter maintient la base de mots globale et chaque utilisateur est autorisé à utiliser la liste globale ou sa liste privée. Un MDA, tel que procmail, peut-être programé pour appliquer d'abord la liste global (avec un seuil spam très strict) puis, si nécessaire, appliquer la liste des mots privée.

Puis-je partager une liste de mots par NFS?

Si vous ne faites que les lire, il n'y a pas de problème. Si vous les mettez à jour, vous devrez fournir les bonnes options de verrouillage pour éviter la corruption des données. Quand vous compilerez Bogofilter, vous aurez besoin de vérifier que le script configure a positionné "#define HAVE_FCNTL 1" dans votre fichier config.h. Les systèmes d'exploitation UNIX supporteront quasiment tous ceci. Si vous utilisez une version exotique ou particulièrement ancienne, assurez-vous qu'elle supporte fcntl(). Si "#define HAVE_FCNTL 1" est positionné, ce qui indique que votre système connaît la fonction fcntl(), alors décommentez "#define HAVE_FLOCK 1" afin que le système de verrouillage utilise fcntl() au lieu du verrouillage flock(). Si votre système ne supporte pas fcntl, alors vous ne pourrez partager les listes de mots en NFS sans risquer une corruption des données.

Ensuite, assurez-vous que NFS est correctement configuré avec "lockd" en fonctionnement. Référez vous à la documentation NFS à propos du lancement de "lockd" ou de "rpc.lockd". La plupart des systèmes avec NFS l'active par défaut.

Pourquoi Bogofilter fournit des codes de retour tels que 0 et 256 quand il est lancé à l'intérieur d'un programme?

Vraisemblablement les codes de retour ont été réécrits par waitpid(2). En C utilisez WEXITSTATUS(status) dans sys/wait.h, ou une macro comparable pour obtenir la valeur correcte. En Perl utilisez 'system("bogofilter $input")>> 8'. Si vous voulez plus d'information, lancez la commande "man waitpid".

Pourquoi mes scripts échouent depuis que j'ai mis à jour?

Au fur et à mesure, Bogofilter a accumulé un grand nombre d'options. Certaines d'entre elles ont disparu ou changé. Lisez le fichier NEWS pour plus d'informations.

Pourquoi, depuis que j'ai changé de version, Bogofilter fonctionne-t-il moins bien?

Le lexer, la partie qui extrait les tokens des messages, évolue. Ceci occasionne une modification de la génération de la liste des tokens, qui, par contrecoups va rendre des anciens tokens inutilisés.

Si vous rencontrez ce problème, vous êtes vivement encouragés à reconstruire votre base. Si cela n'est pas possible, vous pouvez utiliser la version 0.15.13 et lire la documentation qui va avec pour voir comment migrer.

Avec une wordlist combinée, comment puis-je détruire tous les tokens spams (ou les non-spams)?

Bogoutil vous permet de lister (dump) une wordlist et de charger les tokens dans une nouvelle wordlist. Avec l'aide d'outils tels que awk et grep, les nombres peuvent être mis à zéros et les tokens dont les comptes seraient à zéro pour les spams et les hams pourraient être détruits.

Les commandes suivantes vont détruire les tokens des messages spams:

    bogoutil -d wordlist.db | \
    awk '{print $1 " " $2 " 0"}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

Les commandes suivantes vont détruire les tokens provenant des messages hams.

    bogoutil -d wordlist.db | \
    awk '{print $1 " 0 " $3}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

Comment faire fonctionner Bogofilter sur Solaris, BSD, etc.?

Si vous n'avez pas déjà la version 3.0 ou plus de la BerkeleyDB, alors téléchargez la (prenez une des 4.2.X), décompactez la, et lancez les commandes suivantes dans le répertoire 'dist':

    $ cd build_unix
    $ sh ../dist/configure
    $ make
    # make install

Puis, téléchargez la version portable de Bogofilter.

Sur Solaris

Décompactez la, puis faites:

    $ ./configure --with-libdb-prefix=/usr/local/BerkeleyDB-4.2
    $ make
    # make install-strip

Vous pourrez alors, soit mettre un lien symbolique sur libdb.so dans /usr/lib, ou utiliser une version modifiée de la variable d'environnement LD_LIBRARY_PATH avant de lancer Bogofilter.

    $ LD_LIBRARY_PATH=/usr/lib:/usr/local/lib:/usr/local/BerkeleyDB-4.2
        $ export LD_LIBRARY_PATH

Notez que que certaines versions de make livrées avec Solaris bugguent quand vous essayez de compiler Bogofilter hors de son répertoire source. Soit vous compilez dans le répertoire source (comme suggéré ci-avant), soit vous utilisez GNU make (gmake).

Sur FreeBSD

Des paquetages existent avec des versions très récentes de Bogofilter. Cette approche utilise les paquetages très recommandés portupgrade et cvsup. Pour installer ces deux magnifiques outils (vous n'avez besoin de le faire qu'une seule fois):

    # pkg_add -r portupgrade cvsup

Pour installer ou mettre à jour Bogofilter, il suffit de mettre à jour l'arbre de conversion (ports tree) avec cvsup puis de taper

    # portupgrade -N bogofilter

Note: Ceci suppose que vous soyez root. Sinon, lisez le mémento sur la section FreeBSC, et regardez comment compiler si vous n'avez pas les privilèges requis..

Suivant votre système, vous pourrez avoir à positionner certaines variables d'environnement pour la commande ./configure. Exemple:

    # env CPPFLAGS=-I/usr/local/include/db3 LIBS=-ldb3 LDFLAGS=-L/usr/local/lib ./configure

Les chemins dépendent de votre système et des versions de bases de données que vous avez installées. Vérifiez et remplacez en conséquence.

Sur HP-UX

Regardez le fichier doc/programmer/README.hp-ux dans la distribution source.

Puis-je utiliser la commande make sur mon système?

Bogofilter a été compilé avec succès sur plusieurs systèmes en utilisant la commande GNU make et les commandes natives make. Cependant, le Makefile de Bogofilter ne fonctionne pas avec certaines commandes make.

GNU make est recommandé pour compiler Bogofilter car nous savons qu'il fonctionne. Nous ne pouvons maintenir des commandes make moins performantes. Si votre make non-GNU fonctionne, magnifique!. Si vous rencontrez des problèmes, la chose à faire est d'installer la commande GNU make. Si votre make non-GNU ne peut compiler Bogofilter, nous sommes désolés, mais c'est votre problème. Si cela ne nécessite qu'un petit patch propre pour le rendre compatible, nous pouvons éventuellement l'intégrer.

Comment compiler Bogofilter pour un utilisateur non-root ou avec un préfixe d'installation non standard?

Pour installer Bogofilter dans un répertoire non standard (en tant qu'utilisateur non-root vous n'avez pas les permissions pour les répertoires normaux), vous aurez besoin de préciser le préfixe d'installation quand vous lancerez ./configure.

Après avoir télécharger et décompacter le code source, lancez ./configure --prefix=PATH où PATH est le préfixe d'installation pour les fichiers générés (binaires, manuel, etc.) Puis lancez les commandes habituelles — make && make check && make install.

Comment dois-je compiler Bogofilter avec les patches?

S'il vous est nécessaire d'appliquer des correctifs, récupérez le code source et décompactez le en utilisant tar -xzf ou gunzip | tar -xf -. Placez vous dans le répertoire source et lancez la commande./configure --prefix=PATH où PATH est le préfixe d'installation pour les fichiers générés (binaires, manuel, etc.) Puis, après avoir appliqué les correctifs, lancez les commandes habituelles — make && make install.

Comment rendre les exécutables plus petits?

Quand votre espace est réduit, vous pouvez utiliser make install-strip en lieu et place de make install. Ceci permet d'économiser de l'espace disque, mais ne permet pas le debugage lors de crash, à moins que plus d'informations pour reproduire le bug ne soient fournies aux développeurs.

datastore_db.c ne se compile pas!

Si vous configurez le chemin de la base de données avec, par exemple, --with-libdb-prefix ou via CPPFLAGS et LIBS, assurez-vous que vous fournissez un chemin absolu (avec un slash en début), un chemin relatif ne marchera pas. Exemple: utilisez --with-libdb-prefix=/usr/local/BerkeleyDB.4.2, mais pas --with-libdb-prefix=../BerkeleyDB.4.2

Avec quel programme de messgerie Bogofilter fonctionne-t-il?

Bogofilter est réputé pour fonctionner avec kmail, mozilla-mail, mutt, alpine, sylpheed-claws. Une recherche Googole vous aidera à obtenir d'autres informations pour utiliser Bogofilter avec votre programme de messagerie habituel.

Comment utiliser Bogofilter avec Mutt?

Utilisez a filtre mail (procmail, maildrop, etc.) pour aiguiller le mail dans différents dossiers suivant le code de retour de Bogofilter, et associez les touches pour entrainer Bogofilter sur les erreurs :

    macro index S "|bogofilter -s\ns=junkmail"  "Apprendre comme spam et sauvegarder dans junk"
    macro pager S "|bogofilter -s\ns=junkmail"  "Apprendre comme spam et sauvegarder dans junk"
    macro index H "|bogofilter -n\ns="          "Apprendre comme spam et sauvegarder"
    macro pager H "|bogofilter -n\ns="          "Apprendre comme spam et sauvegarder"

Ceci enverra les messages sélectionnés dans Bogofilter, enseignant les faux-ham en spam et vice-versa, puis proposera la sauvegarde dans un dossier différent.

Comment utiliser Bogofilter avec Sylpheed Claws?

Ajoutez une règle de filtrage pour lancer Bogofilter sur les messages entrants et une action à effectuer s'il s'agit d'un spam.

    condition:
    * test "bogofilter < %F"
    action:
    * move "#mh/VOTRE_BOITE_A_SPAM"

Note: ceci suppose que bogofilter est dans votre path!

Créer deux actions Clasw - une pour marquer les messages comme spam et l'autre pour marquer les messages comme ham. Utilisez l'action "Mark As Spam" pour les messages incorrectement classés comme ham et utilisez "Mark As Ham" pour les messages incorrectement classés comme spam.

    Mark as ham / spam:
    * bogofilter -n -v -B "%f" (mark ham)
    * bogofilter -s -v -B "%f" (mark spam)

Une autre approche est de sauvegarder les messages incorrectement classés dans un dossier (ou plusieurs) et de lancer un script tel que:

    #!/bin/sh
    CONFIGDIR=~/.bogofilter
    SPAMDIRS="$CONFIGDIR/spamdirs"
    MARKFILE="$CONFIGDIR/lastbogorun"
    for D in `cat "$SPAMDIRS"`; do
        find "$D" -type f -newer "$MARKFILE" -not -name ".sylpheed*"
    done|bogofilter -bNsv
    touch "$MARKFILE"

Ce script peut-être utilisez comme une action ou transformé comme un bouton. Ceci enregistrera comme spam, les messages dans ${SPAMDIRS} qui sont plus récents que ${MARKFILE}.

D'autres informations sont disponible dans le wiki de Sylpheed-Claws.

Une autre approche est de lancer Bogofilter depuis procmail, maildrop,etc. et de faire vérifier par Claws l'en-tête X-Bogosity et de filtrer les messages dans les dossiesr Spams et Unsure. Par exemple:

    Condition:
        header "X-Bogosity" matchcase "Spam"
    Action:
        move "#mh/Mailbox/Spam"
    Condition:
        header "X-Bogosity" matchcase "Unsure"
    Action:
        move "#mh/Mailbox/Unsure"

Tout message dans le dossier Unsure devrait être enseigné, comme tout message incorrectement classé comme ham ou spam. Les actions suivantes gèreront de tels cas :

    Register Spam:
        bogofilter -s < "%f"

    Register Ham:
        bogofilter -n < "%f"

    Unregister Spam:
        bogofilter -S < "%f"

    Unregister Ham:
        bogofilter -N < "%f"

Pour vérifier dans le mécanisme de notation de Bogofilter, le diagnostic suivant est utile:

    BogoTest -vv:
        bogofilter -vv < "%f"

    BogoTest -vvv:
        bogofilter -vvv < "%f"

D'autres informations sur cette approche sont disponibles ici.

Comment utiliser Bogofilter avec VM (un logiciel de messagerie sous Emacs)?

Vous devez inclure le fichier vm-bogofilter.el (que vous pouvez avec la distributione bogofilter ou télécharger à http://www.cis.upenn.edu/~bjornk/bogofilter/vm-bogofilter.el) dans le chemin des bibliothèques de votre Emacs.

Il ne vous reste plus qu'à mettre dans votre fichier de configuration ~/.vm :

;; Lutte contre les pourriels (via bogofilter)
;;
(require 'vm-bogofilter)

;; Raccourcis-clavier pour bogofilter
;; C (shift-c) : pourriel
;; K (shift-k) : message correct
(define-key vm-mode-map "K" 'vm-bogofilter-is-spam)
(define-key vm-mode-map "C" 'vm-bogofilter-is-clean)

Tous les messages sont filtrés par bogofilter à chaque fois que vous vérifiez vos nouveaux messages. Quand vous changez l'état d'un message, les en-têtes du message sont changées (en-tête X-Bogosity:).

Il y a toutefois une limite : vous ne pouvez changer l'état d'un ensemble de messages sélectionnés : vous devez le faire message après message...

Comment utiliser Bogofilter avec MH-E (l'interface Emacs pour le système de mail MH)?

Le paramétrage par défaut de l'option 'mh-junk-program' est 'Auto-detect' ce qui signifie que MH-E choisira automatiquement entre SpamAssassin, Bogofilter, ou SpamProbe, dans cet ordre. Si, par exemple, vous avez installé SpamAssassin et Bogofilter, et que vous souhaitiez utiliser Bogofilter, vous devrez modifier cette option pour 'Bogofilter'.

La commande 'J b' ('mh-junk-blacklist') Entrainer le programme de spam en cours avec le contenu sélectionné, puis traite le(s) message(s) comme spécifié dans l'option 'mh-junk-disposition'. Par défaut, cette option est positionné sur 'Delete Spam' Mais vous pouvez aussi spécifier le nom d'un répertoire, ce qui sera utile pour construire un corpus de spam pour l'entrainement.

Au contraire, la commande 'J w' ('mh-junk-whitelist') reclassifie les messages sélectionnés comme Ham s'ils étaient incorrectement classés comme spam. Elle déplace alors les messages dans le dossier '+inbox'.

Pour plus d'information lire la page MH-E

bogofilter-1.2.4/doc/bogoutil.xml0000644000175000017500000003246212163572307015166 0ustar sezsez bogoutil 1 Bogofilter Reference Manual Bogofilter bogoutil Dumps, loads, and maintains bogofilter database files bogoutil -h -V bogoutil options -d file -H file -l file -m file -w file -p file bogoutil -r file -R file bogoutil --db-print-leafpage-count file --db-print-pagesize file --db-verify file --db-checkpoint directoryflag --db-list-logfiles directory --db-prune directory --db-recover directory --db-recover-harder directory --db-remove-environment directory where is bogoutil -v -n -C -D -a age -c count -s min,max -y date -I file -O file -x flags --config-file file DESCRIPTION Bogoutil is part of the bogofilter Bayesian spam filter package. It is used to dump and load bogofilter's Berkeley DB databases to and from text files, perform database maintenance functions, and to display the values for specific words. OPTIONS The option tells bogoutil to print the contents of the database file to . The option tells bogoutil to print a histogram of the database file to . The output is similar to bogofilter -vv. Finally, hapaxes (tokens which were only seen once) and pure tokens (tokens which were encountered only in ham or only in spam) are counted. The option tells bogoutil to load the data from into the database file. If the database file exists, data is merged into the database file, with counts added up. The option tells bogoutil to perform maintenance functions on the specified database, i.e. discard tokens that are older than desired, have counts that are too small, or sizes (lengths) that are too long or too short. The option tells bogoutil to display token information from the database file. The option takes an argument, which is either the name of the wordlist (usually wordlist.db) or the name of the directory containing it. Tokens can be listed on the command line or piped to bogoutil. When there are extra arguments on the command line, bogoutil will use them as the tokens to lookup. If there are no extra arguments, bogoutil will read tokens from . The option tells bogoutil to display the database information for one or more tokens. The display includes a probability column with the token's spam score (computed using bogofilter's default values). Option takes the same arguments as option . The option tells bogoutil to recalculate the ROBX value and print it as a six-digit fraction. The option does the same as , but saves the result in the training database without printing it. The option tells bogoutil to read its input from file rather than stdin. The option tells bogoutil to write its output to file rather than stdout. The option produces verbose output on . This option is primarily useful for debugging. The inhibits reading configuration files and lets bogoutil go with the defaults. The option tells bogoutil to read file instead of the standard configuration file. The redirects debug output to stdout (it usually goes to stderr). The option sets debugging flags. Option stands for "replace non-ascii characters". It will replace characters with the high bit (0x80) by question marks. This can be useful if a word list has lots of unreadable tokens, for example from Asian spam. The "bad" characters will be converted to question marks and matching tokens will be combined when used with or , but not with . Option indicates an acceptable token age, with older ones being discarded. The age can be a date (in form YYYYMMMDD) or a day count, i.e. discard tokens older than days. Option indicates that tokens with counts less than or equal to are to be discarded. Option is used to discard tokens based on their size, i.e. length. All tokens shorter than or longer than will be discarded. Option is specifies the date to give to tokens that don't have dates. The format is YYYYMMDD. The option prints the help message and exits. The option prints the version number and exits. ENVIRONMENT MAINTENANCE The option causes bogoutil to flush the buffer caches and checkpoint the database environment. The option causes bogoutil to list the log files in the environment. Zero or more keywords can be added or combined (separated by whitespace) to modify the behavior of this mode. The default behavior is to list only inactive log files with relative paths. You can add to list all log files (inactive and active). You can add to switch the listing to absolute paths. The option causes bogoutil to checkpoint the database environment and remove inactive log files. The option runs a regular database recovery in the specified database directory. If that fails, it will retry with a (usually slower) catastrophic database recovery. If that fails, too, your database cannot be repaired and must be rebuilt from scratch. This is only supported when compiled with Berkeley DB support with transactions enabled. Trying recovery with QDBM or SQLite3 support will result in an error. The option runs a catastrophic data base recovery in the specified database directory. If that fails, your database cannot be repaired and must be rebuilt from scratch. This is only supported when compiled with Berkeley DB support with transactions enabled. Trying recovery with QDBM or SQLite3 support will result in an error. The option has no short option equivalent. It runs recovery in the given directory and then removes the database environment. Use this before upgrading to a new Berkeley DB version if the new version to be installed requires a log file format update. The option prints the number of leaf pages in the database file file as a decimal number, or UNKNOWN if the database does not support querying this figure. The option prints the size of a database page in file as a decimal number, or UNKNOWN for databases with variable page size or databases that do not allow a query of the database page size. The option requests that bogofilter verifies the database file. It prints only errors, unless in verbose mode. DATA FORMAT Bogoutil reads and writes text files where each nonblank line consists of a word, any amount of horizontal whitespace, a numeric word count, more whitespace, and (optionally) a date in form YYYYMMDD. Blank lines are skipped. RETURN VALUES 0 for successful operation. 1 for most errors. 3 for I/O or other errors. Error 3 usually means that something is seriously wrong with the database files. AUTHOR Gyepi Sam gyepi@praxis-sw.com. Matthias Andree matthias.andree@gmx.de. David Relson relson@osagesoftware.com. For updates, see the bogofilter project page. SEE ALSO bogofilter(1), bogolexer(1), bogotune(1), bogoupgrade(1) bogofilter-1.2.4/doc/bf_tar.1in0000644000175000017500000000633312163572474014471 0ustar sezsez'\" t .\" Title: bf_tar .\" Author: [see the "Authors" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BF_TAR" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bf_tar \- shell script to write a tar file of a bogofilter directory to stdout .SH "SYNOPSIS" .HP \w'\fBbf_tar\fR\ 'u \fBbf_tar\fR [\-r] [\-R] \fIbogofilter_directory\fR .SH "DESCRIPTION" .PP \fBbf_tar\fR bundles a bogofilter working directory in tar format and copies it to standard output (your console, or where you redirect it, see EXAMPLES below)\&. .SH "OPTIONS" .PP The \fB\-r\fR option causes \fBbf_tar\fR to remove inactive log files after the archive has been written successfully\&. The default is to leave log files\&. .PP The \fB\-R\fR option causes \fBbf_tar\fR to remove inactive log files before the archive is written\&. This may reduce chances that the resulting archive is recoverable should it become damaged\&. The archive may be smaller though\&. The default is to leave log files\&. .SH "EXIT STATUS" .PP The script exits with status code 0 if everything went well, and nonzero if it encountered trouble\&. .SH "EXAMPLES" .sp .RS 4 .ie n \{\ \h'-04'\(bu\h'+03'\c .\} .el \{\ .sp -1 .IP \(bu 2.3 .\} \fBbf_tar ~/\&.bogofilter > outfile\&.tar\fR .sp Writes a standard \&.tar file containing the essential files from ~/\&.bogofilter to outfile\&.tar\&. .RE .sp .RS 4 .ie n \{\ \h'-04'\(bu\h'+03'\c .\} .el \{\ .sp -1 .IP \(bu 2.3 .\} \fBbf_tar ~/\&.bogofilter | gzip \-9 \-c > outfile\&.tar\&.gz\fR .sp Writes a gzipped \&.tar\&.gz file containing the essential files from ~/\&.bogofilter to outfile\&.tar\&.gz\&. .RE .sp .RS 4 .ie n \{\ \h'-04'\(bu\h'+03'\c .\} .el \{\ .sp -1 .IP \(bu 2.3 .\} \fBbf_tar `pwd`/mydirectory > outfile\&.tar\fR .sp Prepend \fB$(pwd)/\fR or \fB`pwd`/\fR if you want to specify an absolute path instead of a relative path\&. .RE .SH "NOTES" .PP This script is meant for use with Berkeley DB based bogofilter versions\&. .PP This script requires a SUSv2 compliant \fBpax\fR utility\&. .PP This script expects a SUSv2 compliant shell\&. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used\&. .SH "AUTHORS" .PP Matthias Andree bogofilter-1.2.4/doc/rpm.notes.BerkeleyDB0000644000175000017500000000102412163572307016425 0ustar sezsezThere have been significant changes in bogofilter's use of Berkeley DB. Bogofilter now uses the Transactional mode to ensure database integrity. If you are updating from a bogofilter version older than 0.93.0, you may need to configure your database environment. If you encounter messages like: "Lock table is out of available locks" or "Lock table is out of available object entries" then you need to configure your database environment. The FAQ has some information on this problem and file README.db has full details. bogofilter-1.2.4/doc/bogofilter-SA-2002-010000644000175000017500000000550212163572307015772 0ustar sezsezThis security announcement is kept for historic reasons. The software that was found to be vulnerable no longer ships with bogofilter. ----------------------------------------------------------------------- bogofilter-SA-2002:01.bogopass Topic: vulnerability in bogopass Announcement: bogofilter-SA-2002:01 Writer: Matthias Andree Version: 1.00 Announced: 2002-11-29 Category: contrib Type: temporary file created insecurely Impact: anonymous local file destruction or change Credits: - Danger: medium (the vulnerable version was replaced after 6 hours, the vulnerable program is not installed by default) Bugtraq ID: 6278 URL: http://bogofilter.sourceforge.net/security/bogofilter-SA-2002-01 Affects: bogofilter 0.9.0.4 (beta version) Not affected: bogofilter 0.9.0.3 and before bogofilter 0.9.0.5 and newer Default install: unaffected. Introduced: 2002-11-27 23:04:28 UTC (CVS) 2002-11-27 23:11 bogofilter 0.9.0.4 released Corrected: 2002-11-28 01:19:04 UTC (CVS) - disabled original version 2002-11-28 03:32:47 UTC (CVS) - committed corrected version 2002-11-28 04:26 bogofilter 0.9.0.5 released 0. Release history 2002-11-28 1.00 initial announcement 2004-10-28 added Bugtraq ID 2004-10-30 added URL 1. Background Bogofilter is a software package to determine if a mail on its standard input is spam or not. 2. Problem description A vulnerability was found in the contrib/bogopass Perl program that was added to bogofilter as of the 0.9.0.4 beta release (date: 2002-11-27 23:04:28 UTC in CVS) with bogofilter, but is not installed by default. The bogopass program creates temporary files with the name /tmp/bogopass.$$, where $$ is the process ID, with the open FH, ">file" syntax of Perl, which uses O_TRUNC mode, not O_EXCL. 3. Impact This vulnerability allows for anonymous file destruction or change, and might be abused to further escalate the privileges of the local attacker. If bogopass is run by the root user, this may eventually lead to a complete system compromise. 4. Workaround Do not install or use the "bogopass" program that shipped with the vulnerable versions (see above) of bogofilter. 5. Solution Upgrade your bogofilter to version 0.9.0.5 beta, and reinstall the bogopass program. Make sure you delete all copies of the old version of bogopass. bogofilter 0.9.0.5 is available from sourceforge: http://sourceforge.net/project/showfiles.php?group_id=62265&release_id=118794 6. Solution details revision 1.3 date: 2002/11/28 03:32:47; author: m-a; state: Exp; lines: +67 -26 7. Other hints Software that treats user input should not run as root if it can be avoided. When installing bogofilter for system-wide use, make sure that it runs as an unprivileged user to limit the impact of possible vulnerabilities. A. References bogofilter home page: http://bogofilter.sourceforge.net/ bogofilter-1.2.4/doc/bf_tar.htmlin0000644000175000017500000000734112163573362015272 0ustar sezsezbf_tar

Name

bf_tar — shell script to write a tar file of a bogofilter directory to stdout

Synopsis

bf_tar [-r] [-R] bogofilter_directory

Description

bf_tar bundles a bogofilter working directory in tar format and copies it to standard output (your console, or where you redirect it, see EXAMPLES below).

Options

The -r option causes bf_tar to remove inactive log files after the archive has been written successfully. The default is to leave log files.

The -R option causes bf_tar to remove inactive log files before the archive is written. This may reduce chances that the resulting archive is recoverable should it become damaged. The archive may be smaller though. The default is to leave log files.

Exit Status

The script exits with status code 0 if everything went well, and nonzero if it encountered trouble.

Examples

  • bf_tar ~/.bogofilter > outfile.tar

    Writes a standard .tar file containing the essential files from ~/.bogofilter to outfile.tar.

  • bf_tar ~/.bogofilter | gzip -9 -c > outfile.tar.gz

    Writes a gzipped .tar.gz file containing the essential files from ~/.bogofilter to outfile.tar.gz.

  • bf_tar `pwd`/mydirectory > outfile.tar

    Prepend $(pwd)/ or `pwd`/ if you want to specify an absolute path instead of a relative path.

Notes

This script is meant for use with Berkeley DB based bogofilter versions.

This script requires a SUSv2 compliant pax utility.

This script expects a SUSv2 compliant shell. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used.

Authors

Matthias Andree

bogofilter-1.2.4/doc/bogolexer.htmlin0000644000175000017500000000676312163573357016036 0ustar sezsezbogolexer

Name

bogolexer — Utility program for separating email messages into tokens

Synopsis

bogolexer [-p] [-q] [-h] [-n] [-v] [-x flags] [-c file] [-C] [-D] [-I file] [-O file] [-V]

DESCRIPTION

Bogolexer is part of the bogofilter Bayesian spam filter package.

It is used to separate messages into tokens and to test new versions of the lexer.l code.

OPTIONS

The -p option tells bogolexer to print just the tokens read from stdin, without any extra messages.

The -q option tells bogolexer to print a token count, without printing the actual tokens.

The -h option prints the help message and exits.

The -n option tells bogolexer to map non-ascii characters to the question point '?'.

The -v option increases the verbosity level.

The -x flags option allows setting of debug flags for printing debug messages.

The -cfilename option tells bogolexer to read the config file named.

The -C option prevents bogolexer from reading configuration files.

The -D option redirects the debugging output to stdout (it defaults to stderr).

The -I filename option tells bogolexer to read its input from the specified file, rather than from stdin.

The -O filename option tells bogolexer to write its output to the specified file, rather than to stdout.

The -V option prints the version number and exits.

AUTHOR

The bogofilter developer team.

For updates, see the bogofilter project page.

SEE ALSO

bogofilter(1), bogotune(1), bogoupgrade(1), bogoutil(1)

bogofilter-1.2.4/doc/integrating-with-postfix0000644000175000017500000001120712163572310017505 0ustar sezsezWhat: This document describes how to use bogofilter to filter mail that passes through a postfix mail server. Theory: The idea is to setup bogofilter on the mail server and have it filter all incoming mail. There are several advantages to doing so: 1. Mail users on non-Unix platforms will benefit from bogofilter spam filtering. 2. bogofilter learns better since it has access to a larger corpus. There is also a mechanism for users to register new spam/non-spam messages, as well as correcting misclassifications. Assumptions: - Most of the steps described here require root privileges. - postfix is installed into /usr. If you installed postfix from rpm, it is probably installed there. If you installed from source, it is installed into /usr/local unless you changed its configuration. - bogofilter is installed in /usr/bin/bogofilter on the mail server. Installation: - Build the initial spam and non-spam databases by feeding your corpus of mail. Assuming there are two files in mbox format in /home/bogofilter, you say: # cd /home/bogofilter # bogofilter -d . -s < spam.mbx # bogofilter -d . -n < nonspam.mbx Filtering: - Create a script to invoke bogofilter, say /home/bogofilter/postfix-filter.sh, modeled on the following: #!/bin/sh FILTER=/usr/bin/bogofilter FILTER_DIR=/var/spool/filter # WARNING! The -i is crucial, else you may see # messages truncated at the first period that is alone on a line # (which can happen with several kinds of messages, particularly # quoted-printable) # -G is ignored before Postfix 2.3 and tells it that the message # does not originate on the local system (Gateway submission), # so Postfix avoids some of the local expansions that can leave # misleading traces in headers, such as local address # canonicalizations. POSTFIX="/usr/sbin/sendmail -G -i" export BOGOFILTER_DIR=/home/bogofilter # Exit codes from EX_TEMPFAIL=75 EX_UNAVAILABLE=69 cd $FILTER_DIR || \ { echo $FILTER_DIR does not exist; exit $EX_TEMPFAIL; } # Clean up when done or when aborting. trap "rm -f msg.$$ ; exit $EX_TEMPFAIL" 0 1 2 3 15 # bogofilter -e returns: 0 for OK, nonzero for error rm -f msg.$$ || exit $EX_TEMPFAIL $FILTER -p -u -e > msg.$$ || exit $EX_TEMPFAIL exec Matthias Andree bogofilter-1.2.4/doc/bogofilter-SA-2004-010000644000175000017500000000657212163572307016004 0ustar sezsezbogofilter-SA-2004-01 rfc2047crash Topic: vulnerability in bogofilter/bogolexer Announcement: bogofilter-SA-2004-01 Writer: Matthias Andree Version: 1.01 CVE id: CVE-2004-1007 Announced: 2004-10-30 Category: vulnerability Type: segmentation fault through malformed input Impact: denial of service Credits: Antti-Juhani Kaijanaho, Clint Adams, David Relson Danger: medium URL: http://bogofilter.sourceforge.net/security/bogofilter-SA-2004-01 Affected: bogofilter (stable) 0.92.6, 0.92.4, 0.92.0, 0.17.5 bogofilter (current) 0.17.4 to 0.92.7 (inclusive) Not affected: bogofilter 0.17.3 and older bogofilter 0.92.8 and newer Introduced: 2004-03-20 21:46:39 UTC (CVS) 2004-03-20 22:20 bogofilter 0.17.4 released as current 2004-04-02 01:00 bogofilter 0.17.5 released as stable Corrected: 2004-10-08 23:50:04 UTC (CVS) - committed corrected version 2004-10-25 bogofilter 0.92.8 released as stable 2004-10-26 recognized bug as a vulnerability References: Debian Bug #275373 FreeBSD VuXML ID f4428842-a583-4a4c-89b7-297c3459a1c3 FreeBSD Problem Report #73144 0. Release history 2004-10-28 0.01 initial draft for internal review 2004-10-30 0.02 minor revision, added URL 2004-10-30 1.00 minor revision by David Relson, published. 2004-11-03 1.01 Added CVE candidate number. 1. Background Bogofilter is a software package to classify a mail as spam or non-spam. It uses a data base to store words and must be trained which mail are spam and non-spam. It uses the probabilities of individual words for classifying the message. Bogofilter understands enough of MIME to decode headers and only consider text parts of mail. 2. Problem description Antti-Juhani Kaijanaho provided Debian with a test case that crashed bogofilter 0.92.7. The problem was examined and tracked down to a change in bogofilter's quoted-printable decoder that went into 0.17.4. The pertinent change allowed the quoted-printable decoder to accept LF in encoded words but replaced it by a NUL character, which the calling function inside bogofilter could not handle. It attempted to write a NUL byte either one byte past the end of a buffer provided by the lexical analyzer or to an address that was the negative of the address of the first byte of the "encoded text" part of the encoded word that was supposed to be decoded. It was decided to announce this as a vulnerability because bogofilter cannot process the pertinent message. 3. Impact This vulnerability causes bogofilter to catch a "segmentation violation" signal, which causes an immediate program abort. The exact impact depends on the way bogofilter is integrated into the system. In common setups, the mail that contains such malformed headers is deferred by the mail delivery agent and remains in the queue, where it will eventually bounce back to the sender. 4. Workaround No reasonable workaround is known at this time. 5. Solution Upgrade your bogofilter to version 0.92.8. bogofilter 0.92.8 is available from sourceforge: http://sourceforge.net/project/showfiles.php?group_id=62265&package_id=59357&release_id=277823 Note that a broken-out bugfix patch is not available at this time, because the reversion of the failure-inducing change is not a complete fix. Besides, bogofilter is under development and support is limited to the latest available "current" plus the latest available "stable" versions. END of bogofilter-SA-2004-01 rfc2047crash bogofilter-1.2.4/doc/bogotune.htmlin0000644000175000017500000001572112163573360015656 0ustar sezsezbogotune

Name

bogotune — find optimum parameter settings for bogofilter

Synopsis

bogotune [-v] [-c config] [-C] [-d dir] [-D] [-r value] [-T value] -n okfile [[-n] okfile [...]] -s spamfile [[-s] spamfile [...]] [-M file ]

bogotune [-h]

DESCRIPTION

Bogotune tries to find optimum parameter settings for bogofilter. It needs at least one set each of spam and non-spam messages. The production wordlist is normally used, but it can be directed to read a different wordlist, or to build its own from half the supplied messages.

In order to produce useful results, bogotune has minimum message count requirements. The wordlist it uses must have at least 2,000 spam and 2,000 non-spam in it and the message files must contain at least 500 spam and 500 non-spam messages. Also, the ratio of spam to non-spam should be in the range 0.2 to 5. If you direct bogotune to build its own wordlist, it will use the half the input or 2000 messages (whichever is larger) for the wordlist.

Message files may be in mbox, maildir, or MH folder or any combination. Msg-count files can also be used, but not mixed with other formats.

OPTIONS

The -h option prints the help message and exits.

The -v option increases the verbosity level. Level 1 displays the scan output in detail instead of using a progress meter.

The -c filename option tells bogofilter to read the config file named.

The -C option prevents bogotune from reading a configuration file.

The -d dir option specifies the directory for the database. See the ENVIRONMENT section for other directory setting options.

The -D option tells bogotune to build a wordlist in memory using the input messages. The messages are read and divided into two groups. The first group is used to build a wordlist (in ram) and the second is used for tuning. To meet the minimum requirements of 2000 messages in the wordlist and 500 messages for testing, when -D is used, there must be 2500 non-spam and 2500 spam in the input files. If there are enough messages (more than 4000), they will be split evenly between wordlist and testing. Otherwise, they will be split proportionately.

The -n option tells bogotune that the following argument is a file (or folder) containing non-spam. Since version 1.0.3, multiple arguments to the -n option can be given. All non-option arguments until the next -s option will be treated as though they had been preceded by -n

The -s option tells bogotune that the following argument is a file (or folder) containing spam. It can be repeated as often as necessary. Since version 1.0.3, multiple arguments to the -s can be given. All non-option arguments until the next -n option will be treated as though they had been preceded by -s.

The -r value option tells bogotune to use the following parameter as the robx value.

The -T value option tells bogotune to use the following parameter as fp target value.

The -M file option tells bogotune to convert the file to message count format. This format provides a sorted list of each message's unique tokens, along with their ham and spam counts. Sorting hides the sense of the messages quite effectively, thus protecting privacy. The message-count format allows bogotune and bogofilter to score messages quickly without needing the original token database.

ENVIRONMENT

Bogofilter uses a database directory, which can be set in the config file. If not set there, bogofilter will use the value of BOGOFILTER_DIR. Both can be overridden by the -ddir option. If none of that is available, bogofilter will use directory $HOME/.bogofilter.

Bugs

Bogotune is not particularly robust when presented with garbage input.

AUTHOR

The bogofilter developer team.

For updates, see the bogofilter project page.

SEE ALSO

bogofilter(1), bogolexer(1), bogoupgrade(1), bogoutil(1)

bogofilter-1.2.4/doc/bogofilter.1in0000644000175000017500000006063112163572461015365 0ustar sezsez'\" t .\" Title: bogofilter .\" Author: [see the "AUTHOR" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BOGOFILTER" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bogofilter \- fast Bayesian spam filter .SH "SYNOPSIS" .HP \w'\fBbogofilter\fR\ 'u \fBbogofilter\fR [help\ options | classification\ options | registration\ options | parameter\ options | info\ options] [general\ options] [config\ file\ options] .PP where .PP \fBhelp options\fR are: .HP \w'\ 'u [\-h] [\-\-help] [\-V] [\-Q] .PP \fBclassification options\fR are: .HP \w'\ 'u [\-p] [\-e] [\-t] [\-T] [\-u] [\-H] [\-M] [\-b] [\-B\ \fIobject\ \&.\&.\&.\fR] [\-R] [general\ options] [parameter\ options] [config\ file\ options] .PP \fBregistration options\fR are: .HP \w'\ 'u [\-s | \-n] [\-S | \-N] [general\ options] .PP \fBgeneral options\fR are: .HP \w'\ 'u [\-c\ \fIfilename\fR] [\-C] [\-d\ \fIdir\fR] [\-k\ \fIcachesize\fR] [\-l] [\-L\ \fItag\fR] [\-I\ \fIfilename\fR] [\-O\ \fIfilename\fR] .PP \fBparameter options\fR are: .HP \w'\ 'u [\-E\ \fIvalue\fR\fI[,value]\fR] [\-m\ \fIvalue\fR\fI[,value]\fR\fI[,value]\fR] [\-o\ \fIvalue\fR\fI[,value]\fR] .PP \fBinfo options\fR are: .HP \w'\ 'u [\-v] [\-y\ \fIdate\fR] [\-D] [\-x\ \fIflags\fR] .PP \fBconfig file options\fR are: .HP \w'\ 'u [\-\-\fIoption=value\fR] .PP Note: Use \fBbogofilter \-\-help\fR to display the complete list of options\&. .SH "DESCRIPTION" .PP Bogofilter is a Bayesian spam filter\&. In its normal mode of operation, it takes an email message or other text on standard input, does a statistical check against lists of "good" and "bad" words, and returns a status code indicating whether or not the message is spam\&. Bogofilter is designed with a fast algorithm, uses the Berkeley DB for fast startup and lookups, coded directly in C, and tuned for speed, so it can be used for production by sites that process a lot of mail\&. .SH "THEORY OF OPERATION" .PP Bogofilter treats its input as a bag of tokens\&. Each token is checked against a wordlist, which maintains counts of the numbers of times it has occurred in non\-spam and spam mails\&. These numbers are used to compute an estimate of the probability that a message in which the token occurs is spam\&. Those are combined to indicate whether the message is spam or ham\&. .PP While this method sounds crude compared to the more usual pattern\-matching approach, it turns out to be extremely effective\&. Paul Graham\*(Aqs paper \m[blue]\fBA Plan For Spam\fR\m[]\&\s-2\u[1]\d\s+2 is recommended reading\&. .PP This program substantially improves on Paul\*(Aqs proposal by doing smarter lexical analysis\&. Bogofilter does proper MIME decoding and a reasonable HTML parsing\&. Special kinds of tokens like hostnames and IP addresses are retained as recognition features rather than broken up\&. Various kinds of MTA cruft such as dates and message\-IDs are ignored so as not to bloat the wordlist\&. Tokens found in various header fields are marked appropriately\&. .PP Another improvement is that this program offers Gary Robinson\*(Aqs suggested modifications to the calculations (see the parameters robx and robs below)\&. These modifications are described in Robinson\*(Aqs paper \m[blue]\fBSpam Detection\fR\m[]\&\s-2\u[2]\d\s+2\&. .PP Since then, Robinson (see his Linux Journal article \m[blue]\fBA Statistical Approach to the Spam Problem\fR\m[]\&\s-2\u[3]\d\s+2) and others have realized that the calculation can be further optimized using Fisher\*(Aqs method\&. \m[blue]\fBAnother improvement\fR\m[]\&\s-2\u[4]\d\s+2 compensates for token redundancy by applying separate effective size factors (ESF) to spam and nonspam probability calculations\&. .PP In short, this is how it works: The estimates for the spam probabilities of the individual tokens are combined using the "inverse chi\-square function"\&. Its value indicates how badly the null hypothesis that the message is just a random collection of independent words with probabilities given by our previous estimates fails\&. This function is very sensitive to small probabilities (hammish words), but not to high probabilities (spammish words); so the value only indicates strong hammish signs in a message\&. Now using inverse probabilities for the tokens, the same computation is done again, giving an indicator that a message looks strongly spammish\&. Finally, those two indicators are subtracted (and scaled into a 0\-1\-interval)\&. This combined indicator (bogosity) is close to 0 if the signs for a hammish message are stronger than for a spammish message and close to 1 if the situation is the other way round\&. If signs for both are equally strong, the value will be near 0\&.5\&. Since those message don\*(Aqt give a clear indication there is a tristate mode in bogofilter to mark those messages as unsure, while the clear messages are marked as spam or ham, respectively\&. In two\-state mode, every message is marked as either spam or ham\&. .PP Various parameters influence these calculations, the most important are: .PP robx: the score given to a token which has not seen before\&. robx is the probability that the token is spammish\&. .PP robs: a weight on robx which moves the probability of a little seen token towards robx\&. .PP min\-dev: a minimum distance from \&.5 for tokens to use in the calculation\&. Only tokens farther away from 0\&.5 than this value are used\&. .PP spam\-cutoff: messages with scores greater than or equal to will be marked as spam\&. .PP ham\-cutoff: If zero or spam\-cutoff, all messages with values strictly below spam\-cutoff are marked as ham, all others as spam (two\-state)\&. Else values less than or equal to ham\-cutoff are marked as ham, messages with values strictly between ham\-cutoff and spam\-cutoff are marked as unsure; the rest as spam (tristate) .PP sp\-esf: the effective size factor (ESF) for spam\&. .PP ns\-esf: the ESF for nonspam\&. These ESF values default to 1\&.0, which is the same as not using ESF in the calculation\&. Values suitable to a user\*(Aqs email population can be determined with the aid of the bogotune program\&. .SH "OPTIONS" .PP HELP OPTIONS .PP The \fB\-h\fR option prints the help message and exits\&. .PP The \fB\-V\fR option prints the version number and exits\&. .PP The \fB\-Q\fR (query) option prints bogofilter\*(Aqs configuration, i\&.e\&. registration parameters, parsing options, bogofilter directory, etc\&. .PP CLASSIFICATION OPTIONS .PP The \fB\-p\fR (passthrough) option outputs the message with an X\-Bogosity line at the end of the message header\&. This requires keeping the entire message in memory when it\*(Aqs read from stdin (or from a pipe or socket)\&. If the message is read from a file that can be rewound, bogofilter will read it a second time\&. .PP The \fB\-e\fR (embed) option tells bogofilter to exit with code 0 if the message can be classified, i\&.e\&. if there is not an error\&. Normally bogofilter uses different codes for spam, ham, and unsure classifications, but this simplifies using bogofilter with procmail or maildrop\&. .PP The \fB\-t\fR (terse) option tells bogofilter to print an abbreviated spamicity message containing 1 letter and the score\&. Spam is indicated with "Y", ham by "N", and unsure by "U"\&. Note: the formatting can be customized using the config file\&. .PP The \fB\-T\fR provides an invariant terse mode for scripts to use\&. bogofilter will print an abbreviated spamicity message containing 1 letter and the score\&. Spam is indicated with "S", ham by "H", and unsure by "U"\&. .PP The \fB\-TT\fR provides an invariant terse mode for scripts to use\&. Bogofilter prints only the score and displays it to 16 significant digits\&. .PP The \fB\-u\fR option tells bogofilter to register the message\*(Aqs text after classifying it as spam or non\-spam\&. A spam message will be registered on the spamlist and a non\-spam message on the goodlist\&. If the classification is "unsure", the message will not be registered\&. Effectively this option runs bogofilter with the \fB\-s\fR or \fB\-n\fR flag, as appropriate\&. Caution is urged in the use of this capability, as any classification errors bogofilter may make will be preserved and will accumulate until manually corrected with the \fB\-Sn\fR and \fB\-Ns\fR option combinations\&. Note this option causes the database to be opened for write access, which can entail massive slowdowns through lock contention and synchronous I/O operations\&. .PP The \fB\-H\fR option tells bogofilter to not tag tokens from the header\&. This option is for testing, you should not use it in normal operation\&. .PP The \fB\-M\fR option tells bogofilter to process its input as a mbox formatted file\&. If the \fB\-v\fR or \fB\-t\fR option is also given, a spamicity line will be printed for each message\&. .PP The \fB\-b\fR (streaming bulk mode) option tells bogofilter to classify multiple objects whose names are read from stdin\&. If the \fB\-v\fR or \fB\-t\fR option is also given, bogofilter will print a line giving file name and classification information for each file\&. This is an alternative to \fB\-B\fR which lists objects on the command line\&. .PP An object in this context shall be a maildir (autodetected), or if it\*(Aqs not a maildir, a single mail unless \fB\-M\fR is given \- in that case it\*(Aqs processed as mbox\&. (The Content\-Length: header is not taken into account currently\&.) .PP When reading mbox format, bogofilter relies on the empty line after a mail\&. If needed, \fBformail \-es\fR will ensure this is the case\&. .PP The \fB\-B \fR\fB\fIobject \&.\&.\&.\fR\fR (bulk mode) option tells bogofilter to classify multiple objects named on the command line\&. The objects may be filenames (for single messages), mailboxes (files with multiple messages), or directories (of maildir and MH format)\&. If the \fB\-v\fR or \fB\-t\fR option is also given, bogofilter will print a line giving file name and classification information for each file\&. This is an alternative to \fB\-b\fR which lists objects on stdin\&. .PP The \fB\-R\fR option tells bogofilter to output an R data frame in text form on the standard output\&. See the section on integration with R, below, for further detail\&. .PP REGISTRATION OPTIONS .PP The \fB\-s\fR option tells bogofilter to register the text presented as spam\&. The database is created if absent\&. .PP The \fB\-n\fR option tells bogofilter to register the text presented as non\-spam\&. .PP Bogofilter doesn\*(Aqt detect if a message registered twice\&. If you do this by accident, the token counts will off by 1 from what you really want and the corresponding spam scores will be slightly off\&. Given a large number of tokens and messages in the wordlist, this doesn\*(Aqt matter\&. The problem \fIcan\fR be corrected by using the \fB\-S\fR option or the \fB\-N\fR option\&. .PP The \fB\-S\fR option tells bogofilter to undo a prior registration of the same message as spam\&. If a message was incorrectly entered as spam by \fB\-s\fR or \fB\-u\fR and you want to remove it and enter it as non\-spam, use \fB\-Sn\fR\&. If \fB\-S\fR is used for a message that wasn\*(Aqt registered as spam, the counts will still be decremented\&. .PP The \fB\-N\fR option tells bogofilter to undo a prior registration of the same message as non\-spam\&. If a message was incorrectly entered as non\-spam by \fB\-n\fR or \fB\-u\fR and you want to remove it and enter it as spam, then use \fB\-Ns\fR\&. If \fB\-N\fR is used for a message that wasn\*(Aqt registered as non\-spam, the counts will still be decremented\&. .PP GENERAL OPTIONS .PP The \fB\-c \fR\fB\fIfilename\fR\fR option tells bogofilter to read the config file named\&. .PP The \fB\-C\fR option prevents bogofilter from reading configuration files\&. .PP The \fB\-d \fR\fB\fIdir\fR\fR option allows you to set the directory for the database\&. See the ENVIRONMENT section for other directory setting options\&. .PP The \fB\-k \fR\fB\fIcachesize\fR\fR option sets the cache size for the BerkeleyDB subsystem, in units of 1 MiB (1,048,576 bytes)\&. Properly sizing the cache improves bogofilter\*(Aqs performance\&. The recommended size is one third of the size of the database file\&. You can run the bogotune script (in the tuning directory) to determine the recommended size\&. .PP The \fB\-l\fR option writes an informational line to the system log each time bogofilter is run\&. The information logged depends on how bogofilter is run\&. .PP The \fB\-L \fR\fB\fItag\fR\fR option configures a tag which can be included in the information being logged by the \fB\-l\fR option, but it requires a custom format that includes the %l string for now\&. This option implies \fB\-l\fR\&. .PP The \fB\-I \fR\fB\fIfilename\fR\fR option tells bogofilter to read its input from the specified file, rather than from \fBstdin\fR\&. .PP The \fB\-O \fR\fB\fIfilename\fR\fR option tells bogofilter where to write its output in passthrough mode\&. Note that this only works when \-p is explicitly given\&. .PP PARAMETER OPTIONS .PP The \fB\-E \fR\fB\fIvalue\fR\fI[,value]\fR\fR option allows setting the sp\-esf value and the ns\-esf value\&. With two values, both sp\-esf and ns\-esf are set\&. If only one value is given, parameters are set as described in the note below\&. .PP The \fB\-m \fR\fB\fIvalue\fR\fI[,value]\fR\fI[,value]\fR\fR option allows setting the min\-dev value and, optionally, the robs and robx values\&. With three values, min\-dev, robs, and robx are all set\&. If fewer values are given, parameters are set as described in the note below\&. .PP The \fB\-o \fR\fB\fIvalue\fR\fI[,value]\fR\fR option allows setting the spam\-cutoff ham\-cutoff values\&. With two values, both spam\-cutoff and ham\-cutoff are set\&. If only one value is given, parameters are set as described in the note below\&. .PP Note: All of these options allow fewer values to be provided\&. Values can be skipped by using just the comma delimiter, in which case the corresponding parameter(s) won\*(Aqt be changed\&. If only the first value is provided, then only the first parameter is set\&. Trailing values can be skipped, in which case the corresponding parameters won\*(Aqt be changed\&. Within the parameter list, spaces are not allowed after commas\&. .PP INFO OPTIONS .PP The \fB\-v\fR option produces a report to standard output on bogofilter\*(Aqs analysis of the input\&. Each additional \fBv\fR will increase the verbosity of the output, up to a maximum of 4\&. With \fB\-vv\fR, the report lists the tokens with highest deviation from a mean of 0\&.5 association with spam\&. .PP Option \fB\-y date\fR can be used to override the current date when timestamping tokens\&. A value of zero (0) turns off timestamping\&. .PP The \fB\-D\fR option redirects debug output to stdout\&. .PP The \fB\-x \fR\fB\fIflags\fR\fR option allows setting of debug flags for printing debug information\&. See header file debug\&.h for the list of usable flags\&. .PP CONFIG FILE OPTIONS .PP Using GNU longopt \fB\-\-\fR syntax, a config file\*(Aqs \fB\fIname=value\fR\fR statement becomes a command line\*(Aqs \fB\-\-\fR\fB\fIoption=value\fR\fR\&. Use command \fBbogofilter \-\-help\fR for a list of options and see bogofilter\&.cf\&.example for more info on them\&. For example to change the X\-Bogosity header to "X\-Spam\-Header", use: .PP \fB\fI\-\-spam\-header\-name=X\-Spam\-Header\fR\fR .SH "ENVIRONMENT" .PP Bogofilter uses a database directory, which can be set in the config file\&. If not set there, bogofilter will use the value of \fBBOGOFILTER_DIR\fR\&. Both can be overridden by the \fB\-d \fR\fB\fIdir\fR\fR option\&. If none of that is available, bogofilter will use directory $HOME/\&.bogofilter\&. .SH "CONFIGURATION" .PP The bogofilter command line allows setting of many options that determine how bogofilter operates\&. File @sysconfdir@/bogofilter\&.cf can be used to set additional parameters that affect its operation\&. File @sysconfdir@/bogofilter\&.cf\&.example has samples of all of the parameters\&. Status and logging messages can be customized for each site\&. .SH "RETURN VALUES" .PP 0 for spam; 1 for non\-spam; 2 for unsure ; 3 for I/O or other errors\&. .PP If both \fB\-p\fR and \fB\-e\fR are used, the return values are: 0 for spam or non\-spam; 3 for I/O or other errors\&. .PP Error 3 usually means that the wordlist file bogofilter wants to read at startup is missing or the hard disk has filled up in \fB\-p\fR mode\&. .SH "INTEGRATION WITH OTHER TOOLS" .PP Use with procmail .PP The following recipe (a) spam\-bins anything that bogofilter rates as spam, (b) registers the words in messages rated as spam as such, and (c) registers the words in messages rated as non\-spam as such\&. With this in place, it will normally only be necessary for the user to intervene (with \fB\-Ns\fR or \fB\-Sn\fR) when bogofilter miscategorizes something\&. .sp .if n \{\ .RS 4 .\} .nf # filter mail through bogofilter, tagging it as Ham, Spam, or Unsure, # and updating the wordlist :0fw | bogofilter \-u \-e \-p # if bogofilter failed, return the mail to the queue; # the MTA will retry to deliver it later # 75 is the value for EX_TEMPFAIL in /usr/include/sysexits\&.h :0e { EXITCODE=75 HOST } # file the mail to spam\-bogofilter if it\*(Aqs spam\&. :0: * ^X\-Bogosity: Spam, tests=bogofilter spam\-bogofilter # file the mail to unsure\-bogofilter # if it\*(Aqs neither ham nor spam\&. :0: * ^X\-Bogosity: Unsure, tests=bogofilter unsure\-bogofilter # With this recipe, you can train bogofilter starting with an empty # wordlist\&. Be sure to check your unsure\-folder regularly, take the # messages out of it, classify them as ham (or spam), and use them to # train bogofilter\&. .fi .if n \{\ .RE .\} .PP The following procmail rule will take mail on stdin and save it to file spam if bogofilter thinks it\*(Aqs spam: .sp .if n \{\ .RS 4 .\} .nf :0HB: * ? bogofilter spam .fi .if n \{\ .RE .\} .sp and this similar rule will also register the tokens in the mail according to the bogofilter classification: .sp .if n \{\ .RS 4 .\} .nf :0HB: * ? bogofilter \-u spam .fi .if n \{\ .RE .\} .PP If bogofilter fails (returning 3) the message will be treated as non\-spam\&. .PP This one is for maildrop, it automatically defers the mail and retries later when the xfilter command fails, use this in your ~/\&.mailfilter: .sp .if n \{\ .RS 4 .\} .nf xfilter "bogofilter \-u \-e \-p" if (/^X\-Bogosity: Spam, tests=bogofilter/) { to "spam\-bogofilter" } .fi .if n \{\ .RE .\} .PP The following \&.muttrc lines will create mutt macros for dispatching mail to bogofilter\&. .sp .if n \{\ .RS 4 .\} .nf macro index d "unset wait_key\en\e bogofilter \-n\en\e set wait_key\en\e " "delete message as non\-spam" macro index \eed "unset wait_key\en\e bogofilter \-s\en\e set wait_key\en\e " "delete message as spam" .fi .if n \{\ .RE .\} .PP Integration with Mail Transport Agent (MTA) .sp .RS 4 .ie n \{\ \h'-04' 1.\h'+01'\c .\} .el \{\ .sp -1 .IP " 1." 4.2 .\} bogofilter can also be integrated into an MTA to filter all incoming mail\&. While the specific implementation is MTA dependent, the general steps are as follows: .RE .sp .RS 4 .ie n \{\ \h'-04' 2.\h'+01'\c .\} .el \{\ .sp -1 .IP " 2." 4.2 .\} Install bogofilter on the mail server .RE .sp .RS 4 .ie n \{\ \h'-04' 3.\h'+01'\c .\} .el \{\ .sp -1 .IP " 3." 4.2 .\} Prime the bogofilter databases with a spam and non\-spam corpus\&. Since bogofilter will be serving a larger community, it is important to prime it with a representative set of messages\&. .RE .sp .RS 4 .ie n \{\ \h'-04' 4.\h'+01'\c .\} .el \{\ .sp -1 .IP " 4." 4.2 .\} Set up the MTA to invoke bogofilter on each message\&. While this is an MTA specific step, you\*(Aqll probably need to use the \fB\-p\fR, \fB\-u\fR, and \fB\-e\fR options\&. .RE .sp .RS 4 .ie n \{\ \h'-04' 5.\h'+01'\c .\} .el \{\ .sp -1 .IP " 5." 4.2 .\} Set up a mechanism for users to register spam/non\-spam messages, as well as to correct mis\-classifications\&. The most generic solution is to set up alias email addresses to which users bounce messages\&. .RE .sp .RS 4 .ie n \{\ \h'-04' 6.\h'+01'\c .\} .el \{\ .sp -1 .IP " 6." 4.2 .\} See the doc and contrib directories for more information\&. .RE .PP Use of R to verify bogofilter\*(Aqs calculations .PP The \-R option tells bogofilter to generate an R data frame\&. The data frame contains one row per token analyzed\&. Each such row contains the token, the sum of its database "good" and "spam" counts, the "good" count divided by the number of non\-spam messages used to create the training database, the "spam" count divided by the spam message count, Robinson\*(Aqs f(w) for the token, the natural logs of (1 \- f(w)) and f(w), and an indicator character (+ if the token\*(Aqs f(w) value exceeded the minimum deviation from 0\&.5, \- if it didn\*(Aqt)\&. There is one additional row at the end of the table that contains a label in the token field, followed by the number of words actually used (the ones with + indicators), Robinson\*(Aqs P, Q, S, s and x values and the minimum deviation\&. .PP The R data frame can be saved to a file and later read into an R session (see \m[blue]\fBthe R project website\fR\m[]\&\s-2\u[5]\d\s+2 for information about the mathematics package R)\&. Provided with the bogofilter distribution is a simple R script (file bogo\&.R) that can be used to verify bogofilter\*(Aqs calculations\&. Instructions for its use are included in the script in the form of comments\&. .SH "LOG MESSAGES" .PP Bogofilter writes messages to the system log when the \fB\-l\fR option is used\&. What is written depends on which other flags are used\&. .PP A classification run will generate (we are not showing the date and host part here): .sp .if n \{\ .RS 4 .\} .nf bogofilter[1412]: X\-Bogosity: Ham, spamicity=0\&.000227 bogofilter[1415]: X\-Bogosity: Spam, spamicity=0\&.998918 .fi .if n \{\ .RE .\} .PP Using \fB\-u\fR to classify a message and update a wordlist will produce (one a single line): .sp .if n \{\ .RS 4 .\} .nf bogofilter[1426]: X\-Bogosity: Spam, spamicity=0\&.998918, register \-s, 329 words, 1 messages .fi .if n \{\ .RE .\} .PP Registering words (\fB\-l\fR and \fB\-s\fR, \fB\-n\fR, \fB\-S\fR, or \fB\-N\fR) will produce: .sp .if n \{\ .RS 4 .\} .nf bogofilter[1440]: register\-n, 255 words, 1 messages .fi .if n \{\ .RE .\} .PP A registration run (using \fB\-s\fR, \fB\-n\fR, \fB\-N\fR, or \fB\-S\fR) will generate messages like: .sp .if n \{\ .RS 4 .\} .nf bogofilter[17330]: register\-n, 574 words, 3 messages bogofilter[6244]: register\-s, 1273 words, 4 messages .fi .if n \{\ .RE .\} .SH "FILES" .PP @sysconfdir@/bogofilter\&.cf .RS 4 System configuration file\&. .RE .PP ~/\&.bogofilter\&.cf .RS 4 User configuration file\&. .RE .PP ~/\&.bogofilter/wordlist\&.db .RS 4 Combined list of good and spam tokens\&. .RE .SH "AUTHOR" .sp .if n \{\ .RS 4 .\} .nf Eric S\&. Raymond \&. David Relson \&. Matthias Andree \&. Greg Louis \&. .fi .if n \{\ .RE .\} .PP For updates, see the \m[blue]\fBbogofilter project page\fR\m[]\&\s-2\u[6]\d\s+2\&. .SH "SEE ALSO" .PP bogolexer(1), bogotune(1), bogoupgrade(1), bogoutil(1) .SH "NOTES" .IP " 1." 4 A Plan For Spam .RS 4 \%http://www.paulgraham.com/spam.html .RE .IP " 2." 4 Spam Detection .RS 4 \%http://radio-weblogs.com/0101454/stories/2002/09/16/spamDetection.html .RE .IP " 3." 4 A Statistical Approach to the Spam Problem .RS 4 \%http://www.linuxjournal.com/article/6467 .RE .IP " 4." 4 Another improvement .RS 4 \%http://www.garyrobinson.net/2004/04/improved%5fchi.html .RE .IP " 5." 4 the R project website .RS 4 \%http://cran.r-project.org/ .RE .IP " 6." 4 bogofilter project page .RS 4 \%http://bogofilter.sourceforge.net/ .RE bogofilter-1.2.4/doc/bogolexer.xml0000644000175000017500000000725612163572307015333 0ustar sezsez bogolexer 1 Bogofilter Reference Manual Bogofilter bogolexer Utility program for separating email messages into tokens bogolexer -p -q -h -n -v -x flags -c file -C -D -I file -O file -V DESCRIPTION Bogolexer is part of the bogofilter Bayesian spam filter package. It is used to separate messages into tokens and to test new versions of the lexer.l code. OPTIONS The option tells bogolexer to print just the tokens read from stdin, without any extra messages. The option tells bogolexer to print a token count, without printing the actual tokens. The option prints the help message and exits. The option tells bogolexer to map non-ascii characters to the question point '?'. The option increases the verbosity level. The option allows setting of debug flags for printing debug messages. The filename option tells bogolexer to read the config file named. The option prevents bogolexer from reading configuration files. The option redirects the debugging output to stdout (it defaults to stderr). The filename option tells bogolexer to read its input from the specified file, rather than from stdin. The filename option tells bogolexer to write its output to the specified file, rather than to stdout. The option prints the version number and exits. AUTHOR The bogofilter developer team. For updates, see the bogofilter project page. SEE ALSO bogofilter(1), bogotune(1), bogoupgrade(1), bogoutil(1) bogofilter-1.2.4/doc/integrating-with-qmail0000644000175000017500000001120612163572307017121 0ustar sezsezWhat: This document describes how to use bogofilter to filter mail that passes through a qmail mail server. Theory: The idea is to setup bogofilter on the mail server and have it filter all incoming mail. There are several advantages to doing so: 1. Mail users on non-unix platforms will benefit from bogofilter spam filtering 2. bogofilter learns better since it has access to a larger corpus. There is also a mechanism for users to register new spam/nonspam messages, as well as correcting misclassifications. Assumptions: - Most of the steps described here require root privileges. - qmail is installed in /var/qmail. If you installed qmail from rpm, it is probably installed in /usr/qmail. - You have installed Bruce Guenter's qmail-qfilter program which is available from: http://untroubled.org/qmail-qfilter - bogofilter is installed in /usr/bin/bogofilter on the mail server. Installation: - Create a /home/bogofilter directory if you don't already have one. Note that you may change the name and location, if you wish. Just remember that you did so! # mkdir /home/bogofilter - Change the ownership of /home/bogofilter to the qmail alias user, usually called 'alias' # chown -R alias:alias /home/bogofilter - Build the initial spam and nonspam databases by feeding your corpus of mail. Assuming that the files are in mbox format in /home/bogofilter, you say: # bogofilter -d /home/bogofilter -s < spam.mbx # bogofilter -d /home/bogofilter -n < nonspam.mbx Filtering: - Create a script to invoke bogofilter, say /home/bogofilter/bogofilter-run, modeled on the following: #!/bin/sh exec /usr/bin/qmail-qfilter /usr/bin/bogofilter -d /home/bogofilter -p -u -e Make sure the script is executable! Given a good initial corpus, it is better to have bogofilter update its lists based on the message classification, since it is quite likely to get it right. NOTE: Misclassifications MUST be corrected later, else the corpus will degrade and misclassifications can get worse over time. - Setup an /etc/tcpcontrol/qmail.rules entry to trigger the filtering. Ideally, you want to filter incoming mail, but not outgoing. in /etc/tcpcontrol/qmail.rules or its equivalent, enter the default rule: :allow,QMAILQUEUE="/home/bogofilter/bogofilter-run" - Now, every incoming message will have the header line X-Bogosity: ... added to the headers. A bogofilter classified spam messages will have the entry: X-Bogosity: Spam ... Note that the actual header name is configurable at compile time and may have been changed. - Educate your users on how to filter their spam based on the value of the X-Bogosity header. Spam messages should be diverted to a spam mailbox, rather than deleted. Registration and Correction: Setup an email alias, for users to register new spam or nonspam messages as well as to correct misclassification. - copy contrib/dot-qmail-bogofilter-default to /var/qmail/alias/.qmail-bogofilter-default If you are not using the alias 'bogofilter', you'll need to rename the file to your alias and edit the contents If you are not using /home/bogofilter, you'll need to edit the contents - copy contrib/bogofilter-qfe script to /home/bogofilter. Change the domain variable in the script to your domain. Let's assume example.com. The script will have to be edited if: 1. You have multiple domains 2. Your users use Mail User Agents I don't know about. Please send me your improvements! If you wish to save copies of the incoming messages, run the command # /var/qmail/bin/maildirmake /home/bogofilter/Maildir and to /var/qmail/alias/.qmail-bogofilter-default, append the line: /home/bogofilter/Maildir/ The trailing slash is important. Thanks to John Crawford for reminding me. - Make sure the script is executable # chmod +x /home/bogofilter/bogofilter-qfe - Educate your users to bounce their messages to: To register: spam, send to bogofilter-register-spam@example.com nonspam, send to bogofilter-register-nonspam@example.com To correct misclassified: spam, send to bogofilter-spam@example.com nonspam, send to bogofilter-nonspam@example.com It is important that users bounce or redirect the messages rather than forward them since forwarding loses important header information. - Done! NOTE: If bogofilter generates "out of memory" error messages, check the ulimits setting. TODO: A message that is delivered to a group alias will be filtered once, but may be corrected multiple times. Ideally, the script should only accept the first correction and ignore the rest. Author: Gyepi Sam bogofilter-1.2.4/doc/bogofilter-faq-it.html0000644000175000017500000020760612163572310017017 0ustar sezsez Bogofilter FAQ

Bogofilter FAQ

Versioni ufficiali: in Inglese o Francese o Italiano o Bulgaro
Maintainer: David Relson <relson@osagesoftware.com>
Traduzione italiana di Marco Bozzolan <bozzolan@gmail.com>

Con questo documento si intende rispondere alle domande poste frequentemente riguardanti bogofilter.

Convenzioni tipografiche

  • Se mostriamo un comando d'esempio che inizia con un simbolo di dollaro ($), questo significa che questi comandi dovrebbero essere eseguiti come utente senza provilegi, NON come utente root.
  • Se mostriamo comandi d'esempio che iniziano con un cancelletto (#), ciò significa che questi comandi devono essere eseguiti come utente root.

Domande poste frequentemente e loro risposte

Che cos'è bogofilter?

Bogofilter è un filtro bayesiano veloce contro lo spam implementato secondo le linee indicate da Paul Graham nel suo articolo "A plan for spam" ("Un piano per lo spam"). Bogofilter usa l'algoritmo per la media geometrica di Gary Robinson insieme alla modifica del metodo di Fisher per classificare i messaggi come spam o non-spam.

La pagina dedicata a bogofilter presso SourceForge è il punto di riferimento per le risorse relative a bogofilter.

Bogofilter è stato iniziato da Eric S. Raymond il 19 agosto 2002. Ha guadagnato popolarità nel settembre 2002, e un gruppo di altri autori hanno iniziato a contribuire al progetto.

Il file NEWS descrive la cronologia delle versioni di bogofilter.

Bogo-che?

Bogofilter è una sorta di bogometro (bogometer) o filtro bogon (bogon filter), ovvero tenta di identificare i messaggi impropri (bogus) misurandone la bogosità (bogosity).

Come funziona bogofilter?

Vedi la sezione Theory of operation (teoria dell'operazione) per un'introduzione. La fonte principale per la comprensione è questo articolo di Gary Robinson apparso sul Linux Journal: "A Statistical Approach to the Spam Problem" (Un approccio statistico al problema dello spam).

Dopo aver letto tutto ciò potresti avere delle domande. La prima potrebbe essere "Bogofilter è davvero un filtro baesiano?". Bogofilter è basato sul teorema di Bayes e lo usa per i calcoli iniziali e successivamente per altri metodi statistici. Senza dubbio è un filtro statistico per lo spam baesiano sotto molti aspetti.

Altre domande che potresti avere potrebbero riguardare gli assunti di base della teoria di Bayes. Due brevi risposte sono: "No, non sono soddisfatte" e "A noi non interessano, fintanto che funziona". Una risposta più articolata spiegherà che l'ipotesi di partenza che "una e-mail è una raccolta casuale di parole, ciascuna indipendente dalle altre" è violata. Ci sono diversi casi in cui la pratica non segue la teoria. Alcuni sono sempre presenti, altri dipenderanno dal modo in cui usi bogofilter:

  • le parole in una e-mail non sono mai indipendenti. In tutte le lingue è vero il contrario.
  • le parole usate non sono casuali, benché alcuni spammer inseriscano termini "a casaccio"
  • l'apprendimento completo utilizzando un campione casuale segue i principi di Bayes. Una scelta dei messaggi da usare per l'apprendimento violerebbe l'ipotesi che tali messaggi siano un campione casuale dei messaggi ricevuti. Questo principio viene anche violato dalla funzione per l'autoaggiornamento di bogofilter (con il parametro thresh_update) training on error, o qualunque altro approccio simile a questo.
  • lo stesso accade se usi per l'apprendimento lo stesso messaggio più di una volta.
  • altri problemi sorgono se modifichi il tuo database rimuovendo tokens (per esempio usando bogoutil con -a o -c).
  • senza dubbio ce ne sono altri.

Come spiegato dalla man page, bogofilter cerca di capire quanto malamente fallisce l'ipotesi nulla. Alcune persone sostengono che "tali scostamenti dalla realtà di solito sono a nostro favore" (dall'articolo di Gary). Altri sostengono che, anche in tali casi, non dovremmo scostarci troppo. Nessuno davvero sa. Tieni solo a mente che potresti avere dei problemi se spingi troppo. La chiave nell'approccio di Bogofilter è: quello che importa maggiormente è semplicemente quello che funziona nel mondo reale.

Ora che sei stato avvisato, divertiti e usa Bogofilter come meglio ti sembra.

Liste di discussione

Ci sono attualmente quattro liste di discussione per bogofilter:

  1. bogofilter-announce@bogofilter.org: [iscriviti][archivi: mailman, gmane]. Una lista di soli annunci dove vengono presentate le nuove versioni.
  2. bogofilter@bogofilter.org: [iscriviti][archivi: mailman, gmane]. Una lista di discussione dove parlare di bogofilter.
  3. bogofilter-dev@bogofilter.org: [iscriviti][archivi: mailman, gmane]. Una lista per condividere patch e discussioni tecniche e sullo sviluppo.
  4. bogofilter-cvs@lists.sourceforge.net: [iscriviti][archivio]. Lista per annunciare le modifiche al codice nell'archivio CVS.

La lista bogofilter-announce è moderata e viene utilizzata solo per annunci importanti (come quelli relativi a nuove versioni). È una lista poco trafficata. Se sei iscritto alla lista degli utilizzatori o a quella degli sviluppatori, non hai bisogno di iscriverti a quella degli annunci. I messaggi inviati alla lista degli annunci vengono anche inoltrati alle altre liste.

Come avvio l'apprendimento di bogofilter?

Per classificare i messaggi come ham (non spam) o come spam, bogofilter ha bisogno di imparare dalla tua posta. Per iniziare è meglio avere collezioni (il più estese possibili) di messsaggi che sai essere ham o spam. (Errori in questa fase causeranno dei problemi in seguito, dunque fai attenzione ;-). Attenzione: usa soltanto la tua posta; usare altre collezioni (come una collezione di spam trovata sul web) potrebbe portare bogofilter a conclusioni errate — dopo tutto tu vuoi che capisca la tua posta.

Una volta che hai le collezioni di spam e ham, puoi scegliere tra quattro opzioni. In tutti i casi funziona meglio se la tua base d'apprendimento (le collezioni di cui sopra) sono più estese, piuttosto che più ristrette. Più la tua base d'apprendimento è ristretta, più alto sarà il numero di errori che bogofilter farà in produzione. Assumiamo che la tua base sia composta da due files: ham.mbox e spam.mbox.

  • Metodo 1. Apprendimento completo. Passa a bogofilter tutti i tuoi messaggi. Nel nostro esempio:

        bogofilter -s < spam.mbox
    bogofilter -n < ham.mbox

Nota: la directory contrib di Bogofilter contiene due script che utilizzano la tecnica train-on-error. Questa tecnica assegna un punteggio a ogni messaggio e aggiunge al database solo quei messaggi che erano stati valutati in modo scorretto (messaggi valutati come incerti, ham valutato come spam, o spam valutato come ham). L'obiettivo è costruire un database di quelle parole necessarie per classificare correttamente i messaggi. Il database risultante è più piccolo di quello costruito utilizzando l'apprendimento completo.

  • Metodo 2. Usa lo script bogomintrain.pl (nella directory contrib). Esso controlla i messaggi nello stesso ordine dei tuoi file mailbox. Puoi usare l'opzione -f che ripeterà questa operazione finché tutti i messaggi nella tua collezione per l'apprendimento saranno classificati correttamente (puoi anche correggere il livello di certezza). Poiché lo script si assicura che il database comprenda la tua collezione iniziale "esattamente" (con la precisione da te richiesta), funziona molto bene. Puoi usare -o per creare un margine di sicurezza attorno al tuo spam_cutoff. Assumendo spam_cutoff=0.6 potresti voler assegnare a tutto lo ham nella tua collezione sotto 0.3 e tutto lo spam sopra 0.9. Il nostro esempio è:

        bogominitrain.pl -fnv ~/.bogofilter ham.mbox spam.mbox '-o 0.9,0.3'

  • Metodo 3. Usa lo script randomtrain (nella directory contrib). Lo script genera una lista di tutti i messaggi nelle mailbox, riordina la lista in modo casuale, e poi valuta ogni messaggio, con l'apprendimento se richiesto. Nel nostro esempio:

        randomtrain -s spam.mbox -n ham.mbox

    Come con il metodo 4, funziona meglio se inizi con l'apprendimento completo usando alcune migliaia di messaggi. Questo fornirà un database che sarà pié comprensivo e significativamente pié esteso.

  • Metodo 4. Se hai abbastanza messaggi spam e non spam nella tua collezione iniziale, separa dal resto circa 10 000 messaggi di spam e 10 000 non spam in file mbox separati, ed esegui l'apprendimento come nel metodo 1. Poi usa bogofilter per classificare i rimanenti spam e non spam. Prendi ogni messaggio che viene classificato scorrettamente o come incerto, e fai l'apprendimento con quelli. Qui ci sono due brevi script che puoi utilizzare per classificare i messaggi nel train-on-error:

        #! /bin/sh
    #  class3 -- classify one message as bad, good or unsure
    cat >msg.$$
    bogofilter $* <msg.$$
    res=$?
    if [ $res = 0 ]; then
	cat msg.$$ >>corpus.bad
    elif [ $res = 1 ]; then
	cat msg.$$ >>corpus.good
    elif [ $res = 2 ]; then
	cat msg.$$ >>corpus.unsure
    fi
    rm msg.$$
        #! /bin/sh
    # classify -- put all messages in mbox through class3
    src=$1;
    shift
    formail -s class3 $* <$src

    Nel nostro esempio (dopo l'apprendimento completo iniziale):

        classify spam.mbox [bogofilter options]
    bogofilter -s < corpus.good
    rm -f corpus.*
    classify ham.mbox [bogofilter options]
    bogofilter -n < corpus.bad
    rm -f corpus.*

Confronto tra i metodi

È importante capire le conseguenze dei metodi appena descritti. Fare l'apprendimento completo come nei metodi 1 e 4 produce un database più esteso di quanto facciano i metodi 2 e 3. Se hai bisogno che la dimensione del database rimanga piccola (per esempio a causa di limitazioni di quota) usa i metodi 2 o 3.

L'apprendimento completo con il metodo 1 è il più rapido. L'apprendimento sugli errori (nei metodi 2, 3 e 4) è efficente, ma l'apprendimento iniziale richiede più tempo.

Come posso mantenere alta l'accuratezza nell'assegnazione del punteggio?

Bogofilter farà degli errori di tanto in tanto. Dunque l'apprendimento costante è importante. Ci sono due metodi principali per fare ciò. Primo, puoi usare ogni messaggio in arrivo come base d'apprendimento (usando l'opzione -u). Secondo, puoi fargli imparare dagli errori.

Poiché potresti voler ricostruire il tuo database ad un certo punto, per esempio quando una nuova funzionalità viene implementata in bogofilter, può essere molto utile aggiornalre la tua collezione d'apprendimento continuamente.

Bogofilter fa sempre del suo meglio con le informazioni che ha in suo possesso. Comunque, farà degli errori, ad esempio classificare ham come spam (falsi positivi) o spam come ham (falsi negativi). Per ridurre la possibilità che l'errore si ripeta, è necessario far imparare a bogofilter dal messaggio classificato erroneamente. Se un messaggio viene classificato scorrettamente come spam, usa l'opzione -n per notificarlo come ham. Usa -s per riclassificare un messaggio di spam.

Bogofilter ha un'opzione -u che aggiorna automaticamente la lista delle parole dopo aver valutato ogni messaggio. Poiché bogofilter talvolta sbaglia nella classificazione di un messaggio, un monitoraggio è necessario per correggere eventuali errori. Le correzioni possono essere fatte usando -Sn per cambiare la classificazione da spam a non spam e -Ns per cambiarla da non spam a spam.

La correzione della classificazione di un messaggio potrebbe influenzare la classificazione di altri messaggi. Più piccolo è il database, più alta è la possibilità che un errore nell'apprendimento causi una classificazione errata.

L'utilizzo di un metodo come il 2 o il 3 (sopra) può compensare questo effetto. Ripeti l'apprendimento con la collezione iniziale completa (includendo tutti i nuovi messaggi aggiunti dal precedente apprendimento). Questo aggiungerà messaggi al database, il quale mostrerà effetti opposti ad entrambi i lati fino a che avrai un nuovo equilibrio.

Una strategia alternativa, basata sul metodo 4 nella sezione precedente, è il seguente: periodicamente prendi blocchi di messaggi e usa gli script indicati nel metodo 4 per classificarli. Poi controlla manualmente quelli corretti, quelli scorretti e gli incerti, correggi gli errori e dividi gli incerti tra spam e non spam. Quando hai accumulato circa 10 000 messaggi spam e 10 000 non spam, esegui l'apprendimento con quelli corretti, non corretti e con quelli scorretti separati e gli incerti; poi, esegui l'apprendimento solo con quelli separati e gli incerti, scartando i messaggi che bogofilter già classifica correttamente.

Quali formati di posta sono supportati da bogofilter?

Bogofilter supporta il formato tradizionale delle mailbox Unix e i formati Maildir e MH. Nota però che bogofilter non supporta le sottocartelle, dovrai elencarle esplicitamente tra le cartelle MH o Maildir++ - basta menzionare il percorso completo fino alla sottocartella.

Per i formati non supportati, dovrai convertire la mailbox in un formato utilizzato anche da bogofilter. Mbox risulta spesso conveniente perché può essere passato direttamente a bogofilter.

Per convertirlo formato UW-IMAP/PINE in mbox: 

    mailtool copy /percorso/completo/di/mail.mbox '#driver.unix//percorso/completo/di//mbox'

o:

    for MSG in /full/path/to/maildir/* ; do 
	    formail -I Status: < "$MSG" >> /full/path/to/mbox
    done

Cosa significa l'output verboso di bogofilter?

Bogofilter può essere istruito per mostrare informazioni sulla valutazione di un messaggio lanciandolo con le opzioni "-v", "-vv", "-vvv" o "-R".

  • Utilizzando "-v" bogofilter genera la riga d'intestazione "X-Bogosity:", come nell'esempio: 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
  • Utilizzando "-vv" bogofilter genera un istogramma, per esempio: 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
      int  cnt    prob   spamicity  histogram
     0.00   29  0.000209  0.000052  #############################
     0.10    2  0.179065  0.003425  ##
     0.20    2  0.276880  0.008870  ##
     0.30   18  0.363295  0.069245  ##################
     0.40    0  0.000000  0.069245
     0.50    0  0.000000  0.069245
     0.60   37  0.667823  0.257307  #####################################
     0.70    5  0.767436  0.278892  #####
     0.80   13  0.836789  0.334980  #############
     0.90   32  0.984903  0.499835  ################################

    Ogni riga mostra un intervallo, il conteggio dei termini con i valori in quell'intervallo, la probabilità media che tali termini siano spam, il punteggio del messaggio (per quei termini e per tutti quelli con punteggio inferiore), e un grafico a barre corrispondente al conteggio dei termini.

    Nell'istogramma sopra riportato ci sono un sacco di termini con punteggio basso e un sacco di termini ad alto punteggio. Essi si bilanciano a vicenda per fornire un punteggio per il messaggio di 0.5000.

  • Usando "-vvv" si ottiene una lista di tutti i termini nei messaggi con le informazioni relative a ciascuno, come nell'esempio: 
        X-Bogosity: Ham, tests=bogofilter, spamicity=0.500000
			      n    pgood     pbad      fw     U
    "which"              10  0.208333  0.000000  0.000041 +
    "own"                 7  0.145833  0.000000  0.000059 +
    "having"              6  0.125000  0.000000  0.000069 +
    ...
    "unsubscribe.asp"     2  0.000000  0.095238  0.999708 +
    "million"             4  0.000000  0.190476  0.999854 +
    "copy"                5  0.000000  0.238095  0.999883 +
    N_P_Q_S_s_x_md      138  0.00e+00  0.00e+00  5.00e-01
			     1.00e-03  4.15e-01  0.100
    Le colonne stampate contengono le seguenti informazioni:
    "…"
    il blocco in questione
    n
    il numero di volte che il blocco è stato trovato nell'apprendimento
    pgood
    la porzione di messaggi buoni che contenevano questo blocco
    pbad
    la porzione di messaggi spam che contenevano questo blocco
    fw
    l'indice pesato di Robinson, che combina pgood e pbad per fornire un valore che sarà vicino a zero se un messaggio contenente questo blocco non sembra essere spam, mentre sarà vicino a uno se sembrerà essere spam
    U
    '+' se questo blocco contribuisce al punteggio finale del messaggio, '-' in caso contrario. Un blocco viene escluso quando il suo punteggio è più vicino a 0.5 di min_dev.

    Le linee finali mostrano:

    • I totali relativi alle colonne
    • I valori della s e della x di Robinson e di min_dev
  • Usando "-R" si ottiene lo stesso risultato di "-vvv" sopra descritto più due colonne aggiuntive:
    invfwlog
    logaritmo di fw
    fwlog
    logaritmo di (1-fw)

    L'output di "-R" è formattato per l'utilizzo con il linguaggio R per il calcolo statistico. Maggiori informazioni sono disponibili presso Il progetto R per il calcolo statistico.

Che cos'è la modalità insicura?

La configurazione predefinita di bogofilter classificherà un messaggio come spam o non spam. Per fare ciò viene utilizzato il parametro SPAM_CUTOFF. Messaggi con punteggio maggiori o uguali a SPAM_CUTOFF sono classificati come spam. Gli altri messaggi sono catalogati come ham.

Esiste anche un parametro HAM_CUTOFF. Quando questo viene utilizzato, i messaggi devono avere punteggi minori o uguali a HAM_CUTOFF per essere riconosciuti come ham. I messaggi con punteggi compresi tra HAM_CUTOFF e SPAM_CUTOFF sono classificati come incerti. Se guardi in bogofilter.cf, vedrai le seguenti linee:

    #### CUTOFF Values
    #
    #    both ham_cutoff and spam_cutoff are allowed.
    #    setting ham_cutoff to a non-zero value will
    #    enable tri-state results (Spam/Ham/Unsure).
    #
    #ham_cutoff  = 0.45
    #spam_cutoff = 0.99
    #
    #    for two-state classification:
    #
    ## ham_cutoff = 0.00
    ## spam_cutoff= 0.99

Per attivare la classificazione con Sì/No/Incerto rimuovi i caratteri # dalle ultime due righe.

Alternativamente, se preferisci utilizzare le etichette Sì/No/Incerto invece di Spam/Ham/Incerto, rimuovi i caratteri # dalle seguenti righe di bogofilter.cf:

    ## spamicity_tags = Yes, No, Unsure

Una volta fatto ciò, potresti voler impostare le regole del tuo programma di filtraggio della posta per includere qualcosa come:

    Se l'intestazione contiene "X-Bogosity: Spam", metti il messaggio nella cartella Spam
    Se l'intestazione contiene "X-Bogosity: Unsure", metti il messaggio nella cartella Incerti

In alternativa, bogofilter.cf contiene delle direttive per modificare la linea dell'oggetto, es:

    #### SPAM_SUBJECT_TAG
    #
    #    dicitura aggiunta alla linea "Oggetto:" per identificare spam o gli incerti
    #    l'impostazione predefinita non aggiunge nulla
    #
    ##spam_subject_tag=***SPAM***
    ##unsure_subject_tag=???UNSURE???

Con queste diciture nell'oggetto, le regole per il filtraggio diventerebbero:

    Se l'oggetto contiene "***SPAM***" metti il messaggio nella cartella Spam
    Se l'oggetto contiene "???UNSURE???" metti il messaggio nella cartella Incerti

Cosa sono l'"apprendimento dagli errori" e l'"apprendimento per esaurimento"

L'"apprendimento dagli errori" comporta la scansione di un corpus di messaggi noti come spam e non spam; solo quelli che vengono classificati in modo errato, o come incerti, vengono registrati nel database d'apprendimento. È stato verificato che presentare solo messaggi inclini ad una classificazione scorretta sia un metodo efficiente di apprendimento; se alleni bogofilter con messaggi di difficile classificazione, esso apprende anche a riconoscere i messaggi palesemente di spam e non spam.

Questo metodo può essere rafforzato utilizzando un "margine di sicurezza". Aumentando il valore di soglia dello spam e diminuendo il valore di soglia dello ham, i messaggi che sono vicini ai valori di soglia saranno utilizzati per l'apprendimento. L'utilizzo del margine di sicurezza migliora i risultati quando si sta apprendendo dagli errori. In generale, margini di sicurezza più ampi aiutano di più (ma neanche impostarli troppo ampi è una scelta ottimale). Come regola empirica il valore di soglia più o meno 0.3 dà buoni risultati. Per la modalità a tre stati, potresti provare la metà dell'intervallo per i messaggi incerti più o meno 0.3.

Ripetere l'apprendimento dagli errori sullo stesso insieme di messaggi può migliorare la precisione. L'idea è che i messaggi che erano stati valutati correttamente nella prima occasione potrebbero non esserlo più dopo nuovo apprendimento, e in questo modo sarebbero corretti.

L'"apprendimento per esaurimento" consiste nel ripetere l'apprendimento dagli errori, con lo stesso insieme di messaggi, finché non viene commesso più alcun errore. Anche questo metodo può essere migliorato con i margini di sicurezza. Vedi la pagina Gary Robinson's Rants su questo argomento per maggiori dettagli.

Nota: bogomintrain.pl ha un'opzione -f per fare l'apprendimento per esaurimento. Usando -fn si evita di ripetere l'apprendimento per ogni messaggio.

Cosa fa l'opzione '-u' (autoaggiornamento)?

L'opzione -u (autoaggiornamento) viene utilizzato per espandere automaticamente il dizionario. Quando viene utilizzata questa opzione e bogofilter classifica un messaggio come ham o spam, i termini che costituiscono il messaggio vengono aggiunti al dizionario con un indicatore di spam/ham (come appropriato).

Come esempio, supponiamo che arrivi un nuovo messaggio "Refinance now - best Mortgage rates". Esso conterrà alcune parole che bogofilter ha già incontrato e (probabilmente) altre nuove. Usando -u le nuove parole saranno aggiunte al dizionario in modo che bogofilter possa riconoscere il messaggio che segue.

Se/quando usi -u, devi stare all'erta per individuare gli errori di classificazione e segnalare a bogofilter ogni messaggio venga erroneamente classificato. Un messaggio non riconosciuto correttamente potrebbe far commettere altri errori a bogofilter in futuro. Si tratta dello stesso problema che si presenta quando tu (l'amministratore di sistema) registri scorrettamente un messaggio ham come spam (o viceversa).

Come posso utilizzare SpamAssassin per istruire bogofilter?

Se hai un'installazione funzionante di SpamAssassin (o ne crei una), puoi utilizzare i suoi return codes per istruire bogofilter. Il modo più semplice è di creare uno script per il tuo MDA che esegue SpamAssassin, verifica il return code e lancia bogofilter per registrare il messaggio come spam (o non spam). Il file di regole per procmail che segue mostra un modo per fare ciò:

    BOGOFILTER     = "/usr/bin/bogofilter"
    BOGOFILTER_DIR = "training"
    SPAMASSASSIN  = "/usr/bin/spamassassin"

    :0 HBc
    * ? $SPAMASSASSIN -e
    #spam yields non-zero
    #non-spam yields zero
    | $BOGOFILTER -n -d $BOGOFILTER_DIR
    #else (E)
    :0Ec
    | $BOGOFILTER -s -d $BOGOFILTER_DIR

    :0fw
    | $BOGOFILTER -p -e

    :0:
    * ^X-Bogosity:.Spam
    spam

    :0:
    * ^X-Bogosity:.Ham
    non-spam

Cosa posso fare contro lo spam asiatico?

Molte persone ricevono mail indesiderate che utilizzano i set di caratteri delle lingue asiatiche. Poiché non conoscono quelle lingue e non conoscono gente di laggiù, concludono si tratti di spam.

La buona notizia è che bogofilter individua quei messaggi con buon successo. Quella cattiva è che questo può essere costoso. Puoi scegliere tra due opzioni:

  • Puoi semplicemente lasciare che bogofilter gestisca questi messaggi. Istruisci bogofilter utilizzando i messaggi in lingua asiatica identificati come spam. Bogofilter leggerà i messaggi nel miglior modo e aggiungerà i termini al dizionario dello spam. Il dizionario conterrà molti termini che non avranno senso per te (visto che il set di caratteri non può essere visualizzato), ma bogofilter può lavorare senza problemi con essi e identificare con successo lo spam asiatico.

  • Un secondo metodo consiste nell'utilizzare l'opzione "replace_nonascii_characters" nel file di configurazione. Questo sostituirà i caratteri con bit alto, ovvero quelli compresi tra 0x80 e 0xFF, con punti interrogativi, '?'. Questo terrà il database molto più piccolo. Sfortunatamente questo metodo non è adatto ai messaggi scritti nelle lingue europee, che hanno molte vocali accentate e consonanti nell'intervallo con bit alto.

  • Se sei sicuro che non riceverai nessun messaggio scritto in queste lingue, puoi escluderli fin dall'inizio. Questo manterrà il database di dimensioni contenute. Puoi farlo con uno script per MDA.

    Segue un file di regole per procmail che accantonerà i messaggi scritti con set di caratteri asiatici:

        ## Silently drop all Asian language mail
    UNREADABLE='[^?"]*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987'
    :0:
    * 1^0 $ ^Subject:.*=\?($UNREADABLE)
    * 1^0 $ ^Content-Type:.*charset="?($UNREADABLE)
    spam-unreadable

    :0:
    * ^Content-Type:.*multipart
    * B ?? $ ^Content-Type:.*^?.*charset="?($UNREADABLE)
    spam-unreadable

    Con la regola appena descritta, bogofilter non vedrà mai il messaggio.

Come posso compattare il database?

Puoi compattare periodicamente il database in modo che occupi sempre un minimo spazio su disco. Assumendo che il tuo dizionario si trovi nella directory ~/.bogofilter, con bogofilter 0.93.0 (o più recente) userai:

    bf_compact ~/.bogofilter wordlist.db

Con una versione precedente alla 0.93.0 usa invece:

    cd ~/.bogofilter
    bogoutil -d wordlist.db | bogoutil -l wordlist.db.new
    mv wordlist.db wordlist.db.prv
    mv wordlist.db.new wordlist.db

Lo script è necessario per duplicare il tuo ambiente di database (per poter supportare il processo delle transazioni BerkeleyDB). La tua directory originale verrà rinominata in ~/.bogofilter.old e ~/.bogofilter conterrà il nuovo ambiente database.

Poiché versioni precedenti di bogofilter non usano le transazioni Berkeley DB, il database è un file singolo (wordlist.db) e non è necessario usare lo script. I comandi mostrati sopra creano un nuovo database compatto e rinominano il file originale in wordlist.db.prv.

Nota: va bene anche usare lo script con vecchie versioni di bogofilter.

Come si fa una ricerca manuale sul database?

Per trovare i valori spam e ham per un termine usa l'opzione -w di bogoutil. Per esempio, bogoutil -w $BOGOFILTER_DIR/wordlist.db example.com fornisce il numero di messaggi ham e spam contenenti "example.com".

Se vuoi anche il punteggio spam in aggiunta ai valori ham e spam per un termine usa l'opzione -p di bogoutil. Per esempio, bogoutil -p $BOGOFILTER_DIR/wordlist.db example.com fornisce il numero di messaggi ham e spam contenenti "example.com"

Per sapere quanti messaggi ci sono nel tuo dizionario interroga il termine speciale .MSG_COUNT, ad esempio con il comando bogoutil -w $BOGOFILTER_DIR/wordlist.db .MSG_COUNT per vedere i conteggi per i dizionari di ham e spam.

Per sapere quanti termini ci sono nei tuoi dizionari concatena l'output del comando dump di bogoutil con il comando wc: bogoutil -d $BOGOFILTER_DIR/wordlist.db | wc -l mostrerà il totale.

Posso usare liste di termini multiple?

Sì. Bogofilter può essere lanciato con dizionari multipli. Per esempio, se hai dizionari di sistema e per singoli utenti, bogofilter può essere configurato in modo che controlli il dizionario dell'utente e, se non trova la parola, allora controlli il dizionario di sistema. Alternativamente, può essere configurato in modo da unire le informazioni dalle due liste.

Seguono le opzioni per il file di configurazione e alcuni esempi.

Un dizionario ha diversi attributi, solitamente tipo, nome, nome del file e priorità.

  • Tipo: 'R' e 'I' (per "regolare" e "ignora"). I dizionari in uso sono di tipo 'R'. Il tipo 'I' significa "non assegnare punteggio al termine se trovato nella lista di quelli da ignorare"
  • Nome: un breve simbolo identificativo usato nella stampa dei messaggi di errore. Esempi sono "globale", "utente" e "ignora", ma puoi usare qualunque identificativo tu voglia.
  • Nome del file: il nome (percorso) del file. All'apertura del dizionario, se il nome è completamente descritto (con un '/' o '~' iniziale) viene usato quel nome. Altrimenti bogofilter premetterà la directory, seguendo il normale ordine di ricerca: $BOGOFILTER_DIR, $BOGODIR, $HOME.
  • Priorità: un intero come 1, 2, 3, ... I dizionari sono consultati per ogni parola in ordine ascendente. Se il termine cercato viene trovato, vengono consultate le altre liste con uguale priorità (e i valori addizionati tra loro). Liste con priorità più alta non verranno consultate.

Esempio 1 - unisce liste di sistema e per singolo utente:

    wordlist R,user,~/wordlist.db,1
    wordlist R,system,/var/spool/bogofilter/wordlist.db,1

Esempio 2 - preferisce il dizionario utente a quello di sistema:

    wordlist R,user,~/wordlist.db,2
    wordlist R,system,/var/spool/bogofilter/wordlist.db,3

Esempio 3 - preferisce il dizionario di sistema a quello dell'utente:

    wordlist R,user,~/wordlist.db,5
    wordlist R,system,/var/spool/bogofilter/wordlist.db,4

Nota 1: le opzioni di bogofilter per la registrazione (-s, -n, 0u, -S, -N) si applicheranno alla lista con numerazione inferiore.

Nota 2: non è consentito avere liste di tipo 'R' e 'I' con la stessa priorità perché i tipi sono contraddittori.

Posso dire a bogofilter di ignorare certi termini?

Bogofilter ignorerà i termini contenuti in una lista da ignorare nell'assegnare il punteggio al messaggio.

Esempio:

 wordlist I,ignore,~/ignorelist.db,7
      wordlist R,system,/var/spool/bogofilter/wordlist.db,8

Poiché ignorelist.db ha un indice (7) minore di wordlist.db (8), bogofilter smetterà di cercare una volta trovato un termine in ignorelist.db.

Nota: tecnicamente, bogofilter assegna un punteggio di ROBX ai termini e li esclude alla valutazione del parametro min_dev.

Ci sono due metodi per creare/mantenere una lista di termini da ignorare.

Primo, un file di testo può essere creato e mantenuto usando un qualsiasi editor di testi. Bogoutil può convertire il file di testo nel formato database, es.: bogoutil -l ignorelist.db < ignorelist.txt.

Alternativamente echo ... | bogoutil ... può essere utilizzato per aggiungere un singolo termine, per esempio "ignorami", come segue:

  echo ignore.me | bogoutil -l ~/ignorelist.db

Come faccio ad aggiornare da un database di termini separati al formato con liste di termini combinate?

Lancia lo script bogoupgrade. Per maggiori informazioni lancia bogoupgrade -h per visualizzare il suo messaggio di aiuto o esegui man bogoupgrade per leggere la sua pagina di manuale.

Come faccio a capire se le mie liste di termini sono corrotte?

NOTA: alcuni distributori rinominano tutte le utilità db_ nominate di seguito inserendo o postponendo il numero di versione, con o senza punti; per esempio db4.1_verify o db_verify4.2. Non esiste uno standard nel rinominare queste utilità.

Se pensi che i tuoi dizionari contengano errori, puoi vedere cosa ne pensa BerkeleyDB lanciando

    db_verify wordlist.db

Potresti riuscire a recuperare alcuni (o tutti) i termini e i loro valori con i seguenti comandi:

    bogoutil -d wordlist.db | bogoutil -l wordlist.new.db

oppure - se c'è stati un danno maggiore all'elenco dei temini - con

    db_dump -r wordlist.db > wordlist.txt
    db_load wordlist.new.db < wordlist.txt

Puoi anche usare un file di testo al posto della concatenazione, come segue:

    bogoutil -d wordlist.db > wordlist.txt
    bogoutil -l wordlist.db.new < wordlist.txt

Come converto la mia lista di termini in/da unicode?

I dizionari possono essere convertiti dal formato grezzo a unicode usando:

    bogoutil -d wordlist.db > wordlist.raw.txt
    iconv -f iso-8859-1 -t utf-8 < wordlist.raw.txt > wordlist.utf8.txt
    bogoutil -l wordlist.db.new < wordlist.utf8.txt

oppure

    bogoutil --unicode=yes -m wordlist.db

I dizionari possono essere convertiti da unicode al formato grezzo usando:

    bogoutil -d wordlist.db > wordlist.utf8.txt
    iconv -f utf-8  -t iso-8859-1 < wordlist.utf8.txt > wordlist.raw.txt
    bogoutil -l wordlist.db.new < wordlist.raw.txt

oppure

    bogoutil --unicode=no -m wordlist.db

I metodi sopra citati funzionano meglio quando il dizionario è basato sul set di caratteri iso-8859-1. Se il tuo dizionario è basato su un set di caratteri differente, per esempio CP866 o KOI8-R, usa quel set di caratteri nei comandi presentati.

Per un dizionario contenente termini in molteplici lingue, in particolare lingue non europee, i metodi di conversione appena descritti potrebbero non funzionare bene. La costruzione di un nuovo dizionario (da zero) funzionerà sicuramente meglio perché sarebbe basato unicamente su unicode.

Come passo dalla modalità non-transaction a quella transaction?

La procedura è ampiamente documentata nel file doc/README.db sezione 2.2.1. Ti suggeriamo di leggere l'intera sezione.

In breve, usa questi comandi:

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    bogoutil --db-transaction=yes -l wordlist.db < wordlist.txt

Se tutto è andato bene, puoi rimuovere i file di backup:

    rm wordlist.db.old wordlist.txt

Come passo dalla modalità transaction a quella non-transaction?

La procedura è ampiamente documentata nel file doc/README.db sezione 2.2.2. Ti suggeriamo di leggere l'intera sezione.

In breve, puoi usare bogoutil per stampare/caricare il dizionario, per esempio:

    cd ~/.bogofilter
    bogoutil -d wordlist.db > wordlist.txt
    mv wordlist.db wordlist.db.old
    rm -f log.?????????? __db.???
    bogoutil --db-transaction=no -l wordlist.db < wordlist.txt

Perché bogofilter muore dopo aver stampato "Lock table is out of available locks" oppure "Lock table is out of available object entries"?

Le modalità transaction e concurrent del BerkeleyDB richiedono una tabella dei lock che corrisponda in dimensione al database. Vedi il file README.db per una spiegazione dettagliata e una soluzione al problema.

La dimensione della tabella dei lock può essere impostata in bogofilter.cf o in DB_CONFIG. Bogofilter.cf usa le direttive db_lk_max_locks e db_lk_max_objects, mentre DB_CONFIG usa le direttive set_lk_max_objects e set_lk_max_locks.

Dopo aver cambiato questi valori in DB_CONFIG, lancia il comando 

 bogoutil --db-recover /your/bogofilter/directory

perricompilare le tabelle dei lock.

Perché ottengo messaggi DB_PAGE_NOTFOUND?

Hai un problema con il BerkeleyDB database. Ci sono due cause probabili: o hai raggiunto un limite di dimensione massima o il database è corrotto.

Alcuni MTA, come Postfix, impongono dei limiti alla dimensione dei file. Quando il database di bogofilter raggiunge quel limite, si avranno problemi in scrittura.

Per vedere la dimensione del database usa:

    ls -lh $BOGOFILTER_DIR/wordlist.db

Per vedere l'impostazione di postfix:

    postconf | grep mailbox_size_limit

Per impostare il limite a 73MB (o qualunque altra sia la dimensione giusta per te):

    postconf -e mailbox_size_limit=73000000

Se pensi che il tuo database si possa esser corrotto, leggi la domanda Come faccio a capire se le mie liste di termini sono corrotte?

Perché ottengo "Berkeley DB library configured to support only DB_PRIVATE environments" o "Berkeley DB library configured to support only private environments"?

Alcuni distributori (per esempio il Fedora project) preparano il pacchetto BerkeleyDB con il supporto per i thread POSIX e quindi per i mutex POSIX, ma il tuo sistema non supporta i mutex POSIX (che lo faccia o meno dipende dalla versione del kernel e dall'esatto tipo di processore).

Per risolvere questo problema:

  1. scarica, compila e installa BerkeleyDB per conto tuo e poi riconfigura bogofilter:
    1. cd build_unix
    2. ../dist/configure --enable-cxx
    3. make
    4. make install
  2. Ricompila ed installa bogofilter:
    1. ./configure --with-libdb-prefix=/usr/local/BerkeleyDB.4.3 (sostituisci con la tua versione di Berkeley DB)
    2. make && make check
    3. make install (se lo spazio è prezioso usa make install-strip)

Bogofilter può essere usato in un ambiente multiutente?

Sì, è possibile. Ci sono multiple, distinte strategie per farlo. I due estremi sono:

  • c'è un amministratore di bogofilter che mantiene un dizionario globale che tutti usano
  • ogni utente mantiene un proprio dizionario.

Nel mezzo, l'amministratore di bogofilter può creare e mantenere i dizionari globali e a ogni utente può essere data la scelta di usare un dizionario globale o uno privato. Un MDA, come procmail, può essere programmato per applicare prima il dizionario globale (con un valore di soglia dello spam molto stringente) e poi (se necessario) applicare il dizionario dell'utente.

Posso condividere le liste di termini attraverso NFS?

Se le stai solo leggendo, non ci sono problemi. Se le vuoi aggiornare, allora hai bisogno di usare il meccanismo di blocco dei file corretto per evitare perdite di dati. Quando compili bogofilter, dovrai verificare che lo script di configurazione abbia impostato #define HAVE_FCNTL 1 nel tuo config.h. I più diffusi sistemi operativi UNIX supporteranno tutti questa opzione. Se stai usando un sistema operativo atipico, o una versione più vecchia, accertati che supporti fcntl(). Se il tuo sistema non supporta fcntl(), allora non potrai condividere i file di dizionario attraverso NFS senza il rischio di corruzione dei dati.

Poi, accertati di avere configurato correttamente NFS, con "lockd" in esecuzione. Fai riferimento alla documentazione di NFS per maggiori informazioni sull'esecuzione di 'lockd' o 'rpc.lockd'. La maggior parte dei sistemi operativi con NFS lo attivano automaticamente.

Per le directory condivise (directory NFS usate da macchine multiple, per esempio, Sparc/Itanium/Alpha e x86), le parti specifiche per l'architettura può essere installata separatamente dando un diverso --exec-prefix (quello predefinito sarà --prefix).

Perché bogofilter restituisce codici come 0 e 256 quando viene lanciato dall'interno di un programma?

Probabilmente i return codes sono stati riformattati da waitpid(2). In C usa WEXITSTATUS(status) in sys/wait.h, o una macro simile, per ottenere il valore corretto. In Perl puoi usare semplicemente 'system("bogofilter $input") >> 8'. Se vuoi maggiori informazioni digita "man waitpid".

Ora che ho aggiornato perché si sono corrotti i miei scripts?

Nel tempo bogofilter ha accumulato un gran numero di funzioni. Alcune di queste sono state abbandonate o modificate. Leggi il file NEWS per i dettagli.

Ora che ho aggiornato perché bogofilter sta lavorando peggio?

Il lexer, ovvero la parte di bogofilter che estrae i termini da un messaggio, si evolve. Questo comporta letture differenti dei messaggi con la conseguenza che alcuni termini nel database non possono più essere usati.

Se ti imbatti in questo problema sei caldamente invitato a ricostruire il tuo database. Se ciò non è possibile per te, potresti voler usare la versione 0.15.13 e leggere la documentazione allegata per sapere come migrare il tuo database.

Come posso eliminare tutti i token dello spam (o quelli non-spam)?

Bogoutil ti permette di stampare un dizionario e di caricare i termini in uno nuovo. Attraverso l'uso di awk e grep i conteggi possono essere azzerati e i termini con valori pari a zero per spam e non spam possono essere eliminati.

I seguenti comandi elimineranno i termini dai messaggi di spam:

    bogoutil -d wordlist.db | \
    awk '{print $1 " " $2 " 0"}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

I seguenti comandi elimineranno i termini dai messaggi non spam:

    bogoutil -d wordlist.db | \
    awk '{print $1 " 0 " $3}' | grep -v " 0 0" | \
    bogoutil -l wordlist.new.db

Come faccio a far funzionare bogofilter su Solaris, BSD, ecc?

Se non hai già una versione 3.0 o maggiore di BerkeleyDB, allora scaricala (prendi una tra le versioni 4.4.X, 4.3.X o 4.2.X), scompattala ed esegui questi comandi nella directory db:

    $ cd build_unix
    $ sh ../dist/configure
    $ make
    # make install

Poi scarica una versione portabile di bogofilter.

Su Solaris

Assicurati che la tua variabile d'ambiente PATH inizi con /usr/xpg6/bin:/usr/xpg4/bin:/usr/ccs/bin (/usr/xpg6/bin esiste solo su Solaris 10 e può essere omessa su Solaris 9 e versioni precedenti). Ciò è richiesto per compatibilità POSIX.

Scompattalo, e digita:

    $ ./configure --with-libdb-prefix=/usr/local/BerkeleyDB.4.4
    $ make
    # make install-strip

Potresti voler mettere un collegamento simbolico a libdb.so sotto /usr/lib, o usare una variabile d'ambiente LD_LIBRARY_PATH modificata prima di lanciare bogofilter. Su sistemi recenti, la via più conveniente è di usare crle(1) per impostare il percorso permanentemente in modo che BerkeleyDB sia disponibile per tutte le applicazioni.

    $ LD_LIBRARY_PATH=/usr/lib:/usr/local/lib:/usr/local/BerkeleyDB.4.4
    $ export LD_LIBRARY_PATH

Nota che alcune versioni di make fornite con vecchie versioni di Solaris falliscono se tenti di compilare bogofilter fuori dalla sua directory dei sorgenti. Compila nella directory dei sorgenti (come suggerito sopra) o usa GNU make (gmake).

Se il tuo Solaris GCC si lamenta dicendo "ld: fatal: file values-Xa.o: open failed: No such file or directory", installa il pacchetto SUNWarc.

Su FreeBSD

La collezione di ports di FreeBSD fornisce la più recente versione stabile di bogofilter. Questo approccio usa i pacchetti di software portupgrade e portsnap, altamente raccomandati. Per installare pirtupgrade digita (dovrai farlo solo una volta), come root:

    # pkg_add -r portupgrade

Su versioni di FreeBSD più recenti portsnap fa parte del sistema base. Se digitando portsnap help non viene stampata la pagina di aiuto di portsnap devi installarlo dai ports. Per farlo (basta una volta soltanto) digita, come root:

    # pkg_add -r portsnap

Per installare o aggiornare bogofilter, basta aggiornare il tuo albero dei ports usando portsnap, poi digita, come root:

    # portupgrade -N bogofilter

Nota: si suppone che tu sia root. Se non è questo il caso, leggi il seguito di questa sezione su FreeBSD e guarda come puoi compilare se non hai i privilegi di root.

A seconda del tuo sistema potresti dover impostare alcune variabili d'ambiente per il comando ./configure. Per esempio:

    $ env CPPFLAGS=-I/usr/local/include/db3 LIBS=-ldb3 LDFLAGS=-L/usr/local/lib ./configure

I percorsi reali da usare qui dipendono dal tuo sistema e dalle versioni di database che sono installate. Controlla e sostituisci di conseguenza.

Su NetBSD e altri sistemi che usano "pkgsrc"

pkgsrc dovrebbe offrire una versione stabile di bogofilter ragionevolmente recente. Vedi http://www.pkgsrc.org/ per informazioni su pkgsrc.

Su HP-UX

Leggi il file doc/programmer/README.hp-ux nella distribuzione con i sorgenti.

Posso usare il comando make sul mio sistema operativo?

Bogofilter è stato compilato correttamente su molti sistemi operativi usando GNU make e i comandi nativi di make. Comunque, il Makefile di bogofilter non funziona con alcuni make.

GNU make è raccomandato per compilare bogofilter perché noi sappiamo come lavora. Non possiamo supportare comandi make meno potenti. Se il tuo comando make non GNU riesce a compilare correttamente bogofilter, va benissimo. Se però incontri problemi la cosa giusta da fare è installare GNU make. Se il tuo make non-GNU non può compilare bogofilter, ci spiace ma sarai da solo. Se richiede soltanto una minima e pulita patch per renderlo compatibile, potremmo includerla.

Come compilo bogofilter come utente non-root per installarlo in una directory non standard?

Per installare bogofilter in un percorso non standard (come utente non-root non hai i permessi per le directory normali) hai bisogno di fornire il prefisso d'installazione quando lanci ./configure.

Dopo aver scaricato e scompattato il codice sorgente, lancia ./configure --prefix=PATH dove PATH è il prefisso di installazione per i file generati (binari, pagine man, ecc). Poi lancia i soliti comandi di compilazione: make && make check && make install

Come compilo bogofilter con le patch?

Se hai bisogno di applicare delle patch, recupera il codice sorgente e scompattalo usando tar -xzf o gunzip | tar -xf - (come appropriato). Spostati nella directory dei sorgenti e lancia ./configure --prefix=PATH dove PATH è il prefisso di installazione per i file generati (binari, pagine man, ecc). Applica le tue patch e poi lancia make && make install.

Come rendo gli eseguibili più piccoli?

Quando lo spazio è scarso, puoi usare make install-strip al posto di make install. Così facendo risparmierai spazio, ma i crash non potranno essere debuggati a meno che maggiori informazioni sul come riprodurre il crash non vengano fornite agli sviluppatori.

datastore_db.c non compila!

Se stai configurando il percorso di un database, per esempio con --with-libdb-prefix o attraverso CPPFLAGS e LIBS, accertati di passare un percorso assoluto (con barra iniziale), un percorso relativo non funzionerebbe. Esempio: usa --with-libdb-prefix=/usr/local/BerkeleyDB.4.2, ma non --with-libdb-prefix=../BerkeleyDB.4.2.

Con quali programmi di posta funziona bogofilter?

Sappiamo che bogofilter funziona con kmail, mozilla-mail, mutt, alpine, sylpheed-claws. Una ricerca con google ti aiuterà a trovare maggiori informazioni sull'utilizzo di bogofilter insieme al programma di posta che utilizzi.

Come uso bogofilter con mutt?

Usa un filtro per la posta elettronica (procmail, maildrop, ecc) per dividere i messaggi in gruppi differenti in base al return code di bogofilter e imposta delle associazioni di tasti per l'apprendimento basato sugli errori:

    macro index S "|bogofilter -s\ns=junkmail"  "Ricorda come spam e cestinalo"
    macro pager S "|bogofilter -s\ns=junkmail"  "Ricorda come spam e cestinalo"
    macro index H "|bogofilter -n\ns="          "Ricorda come ham e salvalo"
    macro pager H "|bogofilter -n\ns="          "Ricorda come ham e salvalo"

Queste associazioni filtreranno il messaggio selezionato attraverso bogofilter, indicandogli un falso-ham come spam o viceversa, e poi proponendo di salvare il messaggio in una destinazione differente.

Come uso bogofilter con Sylpheed Claws?

Aggiungi un filtro per passare a bogofilter i messaggi in arrivo e un'azione da eseguire se si tratta di spam:

    condition:
    * test "bogofilter < %F"
    action:
    * move "#mh/YOUR_SPAM_BOX"

Nota: si assume che bogofilter sia nel tuo path!

Crea due azioni Claws - una per segnare i messaggi come spam e l'altra per segnarli come ham. Usa l'azione "Segna come Spam" per i messaggi erroneamente classificati come ham e usa "Segna come Ham" su quelli erroneamente classificati come spam.

    Mark as ham / spam:
    * bogofilter -n -v -B "%f" (mark ham)
    * bogofilter -s -v -B "%f" (mark spam)

Un altro approccio consiste nel salvare i messaggi non riconosciuti correttamente in una cartella e lanciare uno script come:

    #!/bin/sh
    CONFIGDIR=~/.bogofilter
    SPAMDIRS="$CONFIGDIR/spamdirs"
    MARKFILE="$CONFIGDIR/lastbogorun"
    for D in `cat "$SPAMDIRS"`; do
	find "$D" -type f -newer "$MARKFILE" -not -name ".sylpheed*"
    done|bogofilter -bNsv
    touch "$MARKFILE"

Questo script può essere utilizzato come un'azione e/o associato ad un pulsante della barra degli strumenti. Registrerà come spam i messaggi contenuti in ${SPAMDIRS} che sono più recenti di ${MARKFILE}.

Maggiori informazioni sono disponibili sul wiki di Claws.

Un altro approccio è di lanciare bogofilter da procmail, maildrop, ecc e far controllare a Claws l'intestazione X-Bogosity e filtrare i messaggi nelle cartelle Spam e Incerti, es.:

    Condition:
	header "X-Bogosity" matchcase "Spam"
    Action:
	move "#mh/Mailbox/Spam"
    Condition:
	header "X-Bogosity" matchcase "Unsure"
    Action:
	move "#mh/Mailbox/Unsure"

Qualsiasi messaggio nella cartella Incerti dovrebbe essere usato per l'apprendimento; lo stesso per i messaggi classificati in modo errato come ham o spam. Le azioni seguenti gestiranno questi casi:

    Register Spam:
	bogofilter -s < "%f"

    Register Ham:
	bogofilter -n < "%f"

    Unregister Spam:
	bogofilter -S < "%f"

    Unregister Ham:
	bogofilter -N < "%f"

Per vedere all'interno del sistema di assegnazione dei punteggi di bogofilter, i seguenti strumenti diagnostici sono utili:

    BogoTest -vv:
	bogofilter -vv < "%f"

    BogoTest -vvv:
	bogofilter -vvv < "%f"

Ulteriori informazioni su questo approccio sono disponibili all'indirizzo http://www.bogofilter.org/pipermail/bogofilter/2005-March/007815.html.

Come uso bogofilter con VM (uno strumento di Emacs per la posta)?

Devi includere il file separato vm-bogofilter.el (contenuto nella directory contrib di bogofilter; la versione più recente del file si trova presso http://www.cis.upenn.edu/~bjornk/bogofilter/vm-bogofilter.el) nel path del tuo emacs.

Poi, aggiungi solo nel tuo file di configurazione ~/.vm:

;; load bogofilter capabilities (spam)
;;
(require 'vm-bogofilter)

;; short-key for bogofilter
;; C (shift-c) means spam message
;; K (shift-k) means ham message
(define-key vm-mode-map "K" 'vm-bogofilter-is-spam)
(define-key vm-mode-map "C" 'vm-bogofilter-is-clean)

Tutti i messaggi vengono filtrati da bogofilter ogni volta che controlli se è arrivata nuova posta. Quando modifichi lo stato di un messaggio, l'intestazione di bogofilter (X-Bogosity) viene modificata.

C'è un limite: non puoi modificare le intestazioni di più messaggi alla volta in VM; dovrai farlo un messaggio alla volta.

Come uso bogofilter con MH-E (l'interfaccia Emacs al sistema di posta MH)?

Il valore predefinito dell'opzione 'mh-junk-program' è 'Auto-detect' che significa che MH-E sceglierà automaticamente uno tra SpamAssassin, Bogofilter o SpamProbe nell'ordine specificato. Se, per esempio, hai sia SpamAssassin che Bogofilter installati e vuoi utilizzare Bogofilter, puoi assegnare a quest'opzione il valore 'Bogofilter'.

Il comando 'J b' ('mh-junk-blacklist') istruisce il programma antispam in uso con il contenuto nell'intervallo e poi manipola i messaggi come indicato dall'opzione 'mh-junk-disposition'. Normalmente questa opzione è impostata come 'Elimina spam' ma puoi anche specificare il nome della cartella che è utile per la costruzione di un gruppo di messaggi di spam per scopi di apprendimento.

Per contrasto, il comando 'J w' ('mh-junk-whitelist') riclassifica un intervallo di messaggi come spam se erano stati classificati erroneamente come spam. Esso poi riporta i messaggi nella cartella '+inbox'.

Per maggiori informazioni, vedi la home page di MH-E.

bogofilter-1.2.4/doc/bf_copy.xml0000644000175000017500000000464012163572307014760 0ustar sezsez bf_copy 1 Bogofilter Reference Manual Bogofilter bf_copy shell script to copy a bogofilter working directory bf_copy -c source_dir destination_dir Description bf_copy copies a bogofilter working directory to another directory. Currently it copies the database files (*.db), related files (log.*), and DB_CONFIG (if present). Options The option causes only active log files to be copied, not all. The default is to copy all log files. Exit Status The script exits with status code 0 if everything went well, and nonzero if it encountered trouble. Bugs This script assumes all *.db files in the source directory are relevant and copies them. This may not match your actual configuration. Notes This script is meant for use with Berkeley DB and SQLite based bogofilter versions. This script expects a SUSv2 compliant shell. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used. Authors MatthiasAndree bogofilter-1.2.4/doc/bogofilter.htmlin0000644000175000017500000007421112163573354016172 0ustar sezsezbogofilter

Name

bogofilter — fast Bayesian spam filter

Synopsis

bogofilter [ help options | classification options | registration options | parameter options | info options ] [general options] [config file options]

where

help options are:

[-h] [--help] [-V] [-Q]

classification options are:

[-p] [-e] [-t] [-T] [-u] [-H] [-M] [-b] [-B object ...] [-R] [general options] [parameter options] [config file options]

registration options are:

[ -s | -n ] [ -S | -N ] [general options]

general options are:

[-c filename] [-C] [-d dir] [-k cachesize] [-l] [-L tag] [-I filename] [-O filename]

parameter options are:

[-E value[,value]] [-m value[,value][,value]] [-o value[,value]]

info options are:

[-v] [-y date] [-D] [-x flags]

config file options are:

[--option=value]

Note: Use bogofilter --help to display the complete list of options.

DESCRIPTION

Bogofilter is a Bayesian spam filter. In its normal mode of operation, it takes an email message or other text on standard input, does a statistical check against lists of "good" and "bad" words, and returns a status code indicating whether or not the message is spam. Bogofilter is designed with a fast algorithm, uses the Berkeley DB for fast startup and lookups, coded directly in C, and tuned for speed, so it can be used for production by sites that process a lot of mail.

THEORY OF OPERATION

Bogofilter treats its input as a bag of tokens. Each token is checked against a wordlist, which maintains counts of the numbers of times it has occurred in non-spam and spam mails. These numbers are used to compute an estimate of the probability that a message in which the token occurs is spam. Those are combined to indicate whether the message is spam or ham.

While this method sounds crude compared to the more usual pattern-matching approach, it turns out to be extremely effective. Paul Graham's paper A Plan For Spam is recommended reading.

This program substantially improves on Paul's proposal by doing smarter lexical analysis. Bogofilter does proper MIME decoding and a reasonable HTML parsing. Special kinds of tokens like hostnames and IP addresses are retained as recognition features rather than broken up. Various kinds of MTA cruft such as dates and message-IDs are ignored so as not to bloat the wordlist. Tokens found in various header fields are marked appropriately.

Another improvement is that this program offers Gary Robinson's suggested modifications to the calculations (see the parameters robx and robs below). These modifications are described in Robinson's paper Spam Detection.

Since then, Robinson (see his Linux Journal article A Statistical Approach to the Spam Problem) and others have realized that the calculation can be further optimized using Fisher's method. Another improvement compensates for token redundancy by applying separate effective size factors (ESF) to spam and nonspam probability calculations.

In short, this is how it works: The estimates for the spam probabilities of the individual tokens are combined using the "inverse chi-square function". Its value indicates how badly the null hypothesis that the message is just a random collection of independent words with probabilities given by our previous estimates fails. This function is very sensitive to small probabilities (hammish words), but not to high probabilities (spammish words); so the value only indicates strong hammish signs in a message. Now using inverse probabilities for the tokens, the same computation is done again, giving an indicator that a message looks strongly spammish. Finally, those two indicators are subtracted (and scaled into a 0-1-interval). This combined indicator (bogosity) is close to 0 if the signs for a hammish message are stronger than for a spammish message and close to 1 if the situation is the other way round. If signs for both are equally strong, the value will be near 0.5. Since those message don't give a clear indication there is a tristate mode in bogofilter to mark those messages as unsure, while the clear messages are marked as spam or ham, respectively. In two-state mode, every message is marked as either spam or ham.

Various parameters influence these calculations, the most important are:

robx: the score given to a token which has not seen before. robx is the probability that the token is spammish.

robs: a weight on robx which moves the probability of a little seen token towards robx.

min-dev: a minimum distance from .5 for tokens to use in the calculation. Only tokens farther away from 0.5 than this value are used.

spam-cutoff: messages with scores greater than or equal to will be marked as spam.

ham-cutoff: If zero or spam-cutoff, all messages with values strictly below spam-cutoff are marked as ham, all others as spam (two-state). Else values less than or equal to ham-cutoff are marked as ham, messages with values strictly between ham-cutoff and spam-cutoff are marked as unsure; the rest as spam (tristate)

sp-esf: the effective size factor (ESF) for spam.

ns-esf: the ESF for nonspam. These ESF values default to 1.0, which is the same as not using ESF in the calculation. Values suitable to a user's email population can be determined with the aid of the bogotune program.

OPTIONS

HELP OPTIONS

The -h option prints the help message and exits.

The -V option prints the version number and exits.

The -Q (query) option prints bogofilter's configuration, i.e. registration parameters, parsing options, bogofilter directory, etc.

CLASSIFICATION OPTIONS

The -p (passthrough) option outputs the message with an X-Bogosity line at the end of the message header. This requires keeping the entire message in memory when it's read from stdin (or from a pipe or socket). If the message is read from a file that can be rewound, bogofilter will read it a second time.

The -e (embed) option tells bogofilter to exit with code 0 if the message can be classified, i.e. if there is not an error. Normally bogofilter uses different codes for spam, ham, and unsure classifications, but this simplifies using bogofilter with procmail or maildrop.

The -t (terse) option tells bogofilter to print an abbreviated spamicity message containing 1 letter and the score. Spam is indicated with "Y", ham by "N", and unsure by "U". Note: the formatting can be customized using the config file.

The -T provides an invariant terse mode for scripts to use. bogofilter will print an abbreviated spamicity message containing 1 letter and the score. Spam is indicated with "S", ham by "H", and unsure by "U".

The -TT provides an invariant terse mode for scripts to use. Bogofilter prints only the score and displays it to 16 significant digits.

The -u option tells bogofilter to register the message's text after classifying it as spam or non-spam. A spam message will be registered on the spamlist and a non-spam message on the goodlist. If the classification is "unsure", the message will not be registered. Effectively this option runs bogofilter with the -s or -n flag, as appropriate. Caution is urged in the use of this capability, as any classification errors bogofilter may make will be preserved and will accumulate until manually corrected with the -Sn and -Ns option combinations. Note this option causes the database to be opened for write access, which can entail massive slowdowns through lock contention and synchronous I/O operations.

The -H option tells bogofilter to not tag tokens from the header. This option is for testing, you should not use it in normal operation.

The -M option tells bogofilter to process its input as a mbox formatted file. If the -v or -t option is also given, a spamicity line will be printed for each message.

The -b (streaming bulk mode) option tells bogofilter to classify multiple objects whose names are read from stdin. If the -v or -t option is also given, bogofilter will print a line giving file name and classification information for each file. This is an alternative to -B which lists objects on the command line.

An object in this context shall be a maildir (autodetected), or if it's not a maildir, a single mail unless -M is given - in that case it's processed as mbox. (The Content-Length: header is not taken into account currently.)

When reading mbox format, bogofilter relies on the empty line after a mail. If needed, formail -es will ensure this is the case.

The -B object ... (bulk mode) option tells bogofilter to classify multiple objects named on the command line. The objects may be filenames (for single messages), mailboxes (files with multiple messages), or directories (of maildir and MH format). If the -v or -t option is also given, bogofilter will print a line giving file name and classification information for each file. This is an alternative to -b which lists objects on stdin.

The -R option tells bogofilter to output an R data frame in text form on the standard output. See the section on integration with R, below, for further detail.

REGISTRATION OPTIONS

The -s option tells bogofilter to register the text presented as spam. The database is created if absent.

The -n option tells bogofilter to register the text presented as non-spam.

Bogofilter doesn't detect if a message registered twice. If you do this by accident, the token counts will off by 1 from what you really want and the corresponding spam scores will be slightly off. Given a large number of tokens and messages in the wordlist, this doesn't matter. The problem can be corrected by using the -S option or the -N option.

The -S option tells bogofilter to undo a prior registration of the same message as spam. If a message was incorrectly entered as spam by -s or -u and you want to remove it and enter it as non-spam, use -Sn. If -S is used for a message that wasn't registered as spam, the counts will still be decremented.

The -N option tells bogofilter to undo a prior registration of the same message as non-spam. If a message was incorrectly entered as non-spam by -n or -u and you want to remove it and enter it as spam, then use -Ns. If -N is used for a message that wasn't registered as non-spam, the counts will still be decremented.

GENERAL OPTIONS

The -c filename option tells bogofilter to read the config file named.

The -C option prevents bogofilter from reading configuration files.

The -d dir option allows you to set the directory for the database. See the ENVIRONMENT section for other directory setting options.

The -k cachesize option sets the cache size for the BerkeleyDB subsystem, in units of 1 MiB (1,048,576 bytes). Properly sizing the cache improves bogofilter's performance. The recommended size is one third of the size of the database file. You can run the bogotune script (in the tuning directory) to determine the recommended size.

The -l option writes an informational line to the system log each time bogofilter is run. The information logged depends on how bogofilter is run.

The -L tag option configures a tag which can be included in the information being logged by the -l option, but it requires a custom format that includes the %l string for now. This option implies -l.

The -I filename option tells bogofilter to read its input from the specified file, rather than from stdin.

The -O filename option tells bogofilter where to write its output in passthrough mode. Note that this only works when -p is explicitly given.

PARAMETER OPTIONS

The -E value[,value] option allows setting the sp-esf value and the ns-esf value. With two values, both sp-esf and ns-esf are set. If only one value is given, parameters are set as described in the note below.

The -m value[,value][,value] option allows setting the min-dev value and, optionally, the robs and robx values. With three values, min-dev, robs, and robx are all set. If fewer values are given, parameters are set as described in the note below.

The -o value[,value] option allows setting the spam-cutoff ham-cutoff values. With two values, both spam-cutoff and ham-cutoff are set. If only one value is given, parameters are set as described in the note below.

Note: All of these options allow fewer values to be provided. Values can be skipped by using just the comma delimiter, in which case the corresponding parameter(s) won't be changed. If only the first value is provided, then only the first parameter is set. Trailing values can be skipped, in which case the corresponding parameters won't be changed. Within the parameter list, spaces are not allowed after commas.

INFO OPTIONS

The -v option produces a report to standard output on bogofilter's analysis of the input. Each additional v will increase the verbosity of the output, up to a maximum of 4. With -vv, the report lists the tokens with highest deviation from a mean of 0.5 association with spam.

Option -y date can be used to override the current date when timestamping tokens. A value of zero (0) turns off timestamping.

The -D option redirects debug output to stdout.

The -x flags option allows setting of debug flags for printing debug information. See header file debug.h for the list of usable flags.

CONFIG FILE OPTIONS

Using GNU longopt -- syntax, a config file's name=value statement becomes a command line's --option=value. Use command bogofilter --help for a list of options and see bogofilter.cf.example for more info on them. For example to change the X-Bogosity header to "X-Spam-Header", use:

--spam-header-name=X-Spam-Header

ENVIRONMENT

Bogofilter uses a database directory, which can be set in the config file. If not set there, bogofilter will use the value of BOGOFILTER_DIR. Both can be overridden by the -d dir option. If none of that is available, bogofilter will use directory $HOME/.bogofilter.

CONFIGURATION

The bogofilter command line allows setting of many options that determine how bogofilter operates. File @sysconfdir@/bogofilter.cf can be used to set additional parameters that affect its operation. File @sysconfdir@/bogofilter.cf.example has samples of all of the parameters. Status and logging messages can be customized for each site.

RETURN VALUES

0 for spam; 1 for non-spam; 2 for unsure ; 3 for I/O or other errors.

If both -p and -e are used, the return values are: 0 for spam or non-spam; 3 for I/O or other errors.

Error 3 usually means that the wordlist file bogofilter wants to read at startup is missing or the hard disk has filled up in -p mode.

INTEGRATION WITH OTHER TOOLS

Use with procmail

The following recipe (a) spam-bins anything that bogofilter rates as spam, (b) registers the words in messages rated as spam as such, and (c) registers the words in messages rated as non-spam as such. With this in place, it will normally only be necessary for the user to intervene (with -Ns or -Sn) when bogofilter miscategorizes something.


# filter mail through bogofilter, tagging it as Ham, Spam, or Unsure,
# and updating the wordlist

:0fw
| bogofilter -u -e -p


# if bogofilter failed, return the mail to the queue;
# the MTA will retry to deliver it later
# 75 is the value for EX_TEMPFAIL in /usr/include/sysexits.h

:0e
{ EXITCODE=75 HOST }


# file the mail to spam-bogofilter if it's spam.

:0:
* ^X-Bogosity: Spam, tests=bogofilter
spam-bogofilter

# file the mail to unsure-bogofilter 
# if it's neither ham nor spam.

:0:
* ^X-Bogosity: Unsure, tests=bogofilter
unsure-bogofilter

# With this recipe, you can train bogofilter starting with an empty
# wordlist.  Be sure to check your unsure-folder regularly, take the
# messages out of it, classify them as ham (or spam), and use them to
# train bogofilter.

The following procmail rule will take mail on stdin and save it to file spam if bogofilter thinks it's spam: 

:0HB:
* ? bogofilter
spam

and this similar rule will also register the tokens in the mail according to the bogofilter classification: 

:0HB:
* ? bogofilter -u
spam

If bogofilter fails (returning 3) the message will be treated as non-spam.

This one is for maildrop, it automatically defers the mail and retries later when the xfilter command fails, use this in your ~/.mailfilter:

xfilter "bogofilter -u -e -p"
if (/^X-Bogosity: Spam, tests=bogofilter/)
{
  to "spam-bogofilter"
}

The following .muttrc lines will create mutt macros for dispatching mail to bogofilter.

macro index d "<enter-command>unset wait_key\n\
<pipe-entry>bogofilter -n\n\
<enter-command>set wait_key\n\
<delete-message>" "delete message as non-spam"
macro index \ed "<enter-command>unset wait_key\n\
<pipe-entry>bogofilter -s\n\
<enter-command>set wait_key\n\
<delete-message>" "delete message as spam"

Integration with Mail Transport Agent (MTA)

  1. bogofilter can also be integrated into an MTA to filter all incoming mail. While the specific implementation is MTA dependent, the general steps are as follows:

  2. Install bogofilter on the mail server

  3. Prime the bogofilter databases with a spam and non-spam corpus. Since bogofilter will be serving a larger community, it is important to prime it with a representative set of messages.

  4. Set up the MTA to invoke bogofilter on each message. While this is an MTA specific step, you'll probably need to use the -p, -u, and -e options.

  5. Set up a mechanism for users to register spam/non-spam messages, as well as to correct mis-classifications. The most generic solution is to set up alias email addresses to which users bounce messages.

  6. See the doc and contrib directories for more information.

Use of R to verify bogofilter's calculations

The -R option tells bogofilter to generate an R data frame. The data frame contains one row per token analyzed. Each such row contains the token, the sum of its database "good" and "spam" counts, the "good" count divided by the number of non-spam messages used to create the training database, the "spam" count divided by the spam message count, Robinson's f(w) for the token, the natural logs of (1 - f(w)) and f(w), and an indicator character (+ if the token's f(w) value exceeded the minimum deviation from 0.5, - if it didn't). There is one additional row at the end of the table that contains a label in the token field, followed by the number of words actually used (the ones with + indicators), Robinson's P, Q, S, s and x values and the minimum deviation.

The R data frame can be saved to a file and later read into an R session (see the R project website for information about the mathematics package R). Provided with the bogofilter distribution is a simple R script (file bogo.R) that can be used to verify bogofilter's calculations. Instructions for its use are included in the script in the form of comments.

Log messages

Bogofilter writes messages to the system log when the -l option is used. What is written depends on which other flags are used.

A classification run will generate (we are not showing the date and host part here): 

bogofilter[1412]: X-Bogosity: Ham, spamicity=0.000227
bogofilter[1415]: X-Bogosity: Spam, spamicity=0.998918

Using -u to classify a message and update a wordlist will produce (one a single line): 

bogofilter[1426]: X-Bogosity: Spam, spamicity=0.998918,
  register -s, 329 words, 1 messages

Registering words (-l and -s, -n, -S, or -N) will produce: 

bogofilter[1440]: register-n, 255 words, 1 messages

A registration run (using -s, -n, -N, or -S) will generate messages like: 

bogofilter[17330]: register-n, 574 words, 3 messages
bogofilter[6244]: register-s, 1273 words, 4 messages

FILES

@sysconfdir@/bogofilter.cf

System configuration file.

~/.bogofilter.cf

User configuration file.

~/.bogofilter/wordlist.db

Combined list of good and spam tokens.

AUTHOR


Eric S. Raymond .
David Relson .
Matthias Andree .
Greg Louis .

For updates, see the bogofilter project page.

SEE ALSO

bogolexer(1), bogotune(1), bogoupgrade(1), bogoutil(1)

bogofilter-1.2.4/doc/bogoutil.1in0000644000175000017500000002311012163572463015046 0ustar sezsez'\" t .\" Title: bogoutil .\" Author: [see the "AUTHOR" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BOGOUTIL" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bogoutil \- Dumps, loads, and maintains bogofilter database files .SH "SYNOPSIS" .HP \w'\fBbogoutil\fR\ 'u \fBbogoutil\fR {\-h | \-V} .HP \w'\fBbogoutil\fR\ 'u \fBbogoutil\fR [options] {\-d\ \fIfile\fR | \-H\ \fIfile\fR | \-l\ \fIfile\fR | \-m\ \fIfile\fR | \-w\ \fIfile\fR | \-p\ \fIfile\fR} .HP \w'\fBbogoutil\fR\ 'u \fBbogoutil\fR {\-r\ \fIfile\fR | \-R\ \fIfile\fR} .HP \w'\fBbogoutil\fR\ 'u \fBbogoutil\fR {\-\-db\-print\-leafpage\-count\ \fIfile\fR | \-\-db\-print\-pagesize\ \fIfile\fR | \-\-db\-verify\ \fIfile\fR | \-\-db\-checkpoint\ \fIdirectory\fR\ [flag...] | \-\-db\-list\-logfiles\ \fIdirectory\fR | \-\-db\-prune\ \fIdirectory\fR | \-\-db\-recover\ \fIdirectory\fR | \-\-db\-recover\-harder\ \fIdirectory\fR | \-\-db\-remove\-environment\ \fIdirectory\fR} .PP where \fBoptions\fR is .HP \w'\fBbogoutil\fR\ 'u \fBbogoutil\fR [\-v] [\-n] [\-C] [\-D] [\-a\ \fIage\fR] [\-c\ \fIcount\fR] [\-s\ \fImin,max\fR] [\-y\ \fIdate\fR] [\-I\ \fIfile\fR] [\-O\ \fIfile\fR] [\-x\ \fIflags\fR] [\-\-config\-file\ \fIfile\fR] .SH "DESCRIPTION" .PP Bogoutil is part of the bogofilter Bayesian spam filter package\&. .PP It is used to dump and load bogofilter\*(Aqs Berkeley DB databases to and from text files, perform database maintenance functions, and to display the values for specific words\&. .SH "OPTIONS" .PP The \fB\-d \fR\fB\fIfile\fR\fR option tells bogoutil to print the contents of the database file to \fBstdout\fR\&. .PP The \fB\-H \fR\fB\fIfile\fR\fR option tells bogoutil to print a histogram of the database file to \fBstdout\fR\&. The output is similar to bogofilter \-vv\&. Finally, hapaxes (tokens which were only seen once) and pure tokens (tokens which were encountered only in ham or only in spam) are counted\&. .PP The \fB\-l \fR\fB\fIfile\fR\fR option tells bogoutil to load the data from \fBstdin\fR into the database file\&. If the database file exists, \fBstdin\fR data is merged into the database file, with counts added up\&. .PP The \fB\-m\fR option tells bogoutil to perform maintenance functions on the specified database, i\&.e\&. discard tokens that are older than desired, have counts that are too small, or sizes (lengths) that are too long or too short\&. .PP The \fB\-w \fR\fB\fIfile\fR\fR option tells bogoutil to display token information from the database file\&. The option takes an argument, which is either the name of the wordlist (usually wordlist\&.db) or the name of the directory containing it\&. Tokens can be listed on the command line or piped to bogoutil\&. When there are extra arguments on the command line, bogoutil will use them as the tokens to lookup\&. If there are no extra arguments, bogoutil will read tokens from \fBstdin\fR\&. .PP The \fB\-p \fR\fB\fIfile\fR\fR option tells bogoutil to display the database information for one or more tokens\&. The display includes a probability column with the token\*(Aqs spam score (computed using bogofilter\*(Aqs default values)\&. Option \fB\-p\fR takes the same arguments as option \fB\-w\fR \&. .PP The \fB\-r \fR\fB\fIfile\fR\fR option tells bogoutil to recalculate the ROBX value and print it as a six\-digit fraction\&. .PP The \fB\-R \fR\fB\fIfile\fR\fR option does the same as \fB\-r\fR, but saves the result in the training database without printing it\&. .PP The \fB\-I \fR\fB\fIfile\fR\fR option tells bogoutil to read its input from \fIfile\fR rather than stdin\&. .PP The \fB\-O \fR\fB\fIfile\fR\fR option tells bogoutil to write its output to \fIfile\fR rather than stdout\&. .PP The \fB\-v\fR option produces verbose output on \fBstderr\fR\&. This option is primarily useful for debugging\&. .PP The \fB\-C\fR inhibits reading configuration files and lets bogoutil go with the defaults\&. .PP The \fB\-\-config\-file \fR\fB\fIfile\fR\fR option tells bogoutil to read \fIfile\fR instead of the standard configuration file\&. .PP The \fB\-D\fR redirects debug output to stdout (it usually goes to stderr)\&. .PP The \fB\-x \fR\fB\fIflags\fR\fR option sets debugging flags\&. .PP Option \fB\-n\fR stands for "replace non\-ascii characters"\&. It will replace characters with the high bit (0x80) by question marks\&. This can be useful if a word list has lots of unreadable tokens, for example from Asian spam\&. The "bad" characters will be converted to question marks and matching tokens will be combined when used with \fB\-m\fR or \fB\-l\fR, but not with \fB\-d\fR\&. .PP Option \fB\-a age\fR indicates an acceptable token age, with older ones being discarded\&. The age can be a date (in form YYYYMMMDD) or a day count, i\&.e\&. discard tokens older than \fBage\fR days\&. .PP Option \fB\-c value\fR indicates that tokens with counts less than or equal to \fBvalue\fR are to be discarded\&. .PP Option \fB\-s min,max\fR is used to discard tokens based on their size, i\&.e\&. length\&. All tokens shorter than \fBmin\fR or longer than \fBmax\fR will be discarded\&. .PP Option \fB\-y date\fR is specifies the date to give to tokens that don\*(Aqt have dates\&. The format is YYYYMMDD\&. .PP The \fB\-h\fR option prints the help message and exits\&. .PP The \fB\-V\fR option prints the version number and exits\&. .SH "ENVIRONMENT MAINTENANCE" .PP The \fB\-\-db\-checkpoint \fR\fB\fIdir\fR\fR option causes bogoutil to flush the buffer caches and checkpoint the database environment\&. .PP The \fB\-\-db\-list\-logfiles \fR\fB\fIdir\fR\fR option causes bogoutil to list the log files in the environment\&. Zero or more keywords can be added or combined (separated by whitespace) to modify the behavior of this mode\&. The default behavior is to list only inactive log files with relative paths\&. You can add \fBall\fR to list all log files (inactive and active)\&. You can add \fBabsolute\fR to switch the listing to absolute paths\&. .PP The \fB\-\-db\-prune \fR\fB\fIdir\fR\fR option causes bogoutil to checkpoint the database environment and remove inactive log files\&. .PP The \fB\-\-db\-recover \fR\fB\fIdir\fR\fR option runs a regular database recovery in the specified database directory\&. If that fails, it will retry with a (usually slower) catastrophic database recovery\&. If that fails, too, your database cannot be repaired and must be rebuilt from scratch\&. This is only supported when compiled with Berkeley DB support with transactions enabled\&. Trying recovery with QDBM or SQLite3 support will result in an error\&. .PP The \fB\-\-db\-recover\-harder \fR\fB\fIdir\fR\fR option runs a catastrophic data base recovery in the specified database directory\&. If that fails, your database cannot be repaired and must be rebuilt from scratch\&. This is only supported when compiled with Berkeley DB support with transactions enabled\&. Trying recovery with QDBM or SQLite3 support will result in an error\&. .PP The \fB\-\-db\-remove\-environment \fR\fB\fIdirectory\fR\fR option has no short option equivalent\&. It runs recovery in the given directory and then removes the database environment\&. Use this \fIbefore\fR upgrading to a new Berkeley DB version if the new version to be installed requires a log file format update\&. .PP The \fB\-\-db\-print\-leafpage\-count \fR\fB\fIfile\fR\fR option prints the number of leaf pages in the database file \fIfile\fR as a decimal number, or UNKNOWN if the database does not support querying this figure\&. .PP The \fB\-\-db\-print\-pagesize \fR\fB\fIfile\fR\fR option prints the size of a database page in \fIfile\fR as a decimal number, or UNKNOWN for databases with variable page size or databases that do not allow a query of the database page size\&. .PP The \fB\-\-db\-verify \fR\fB\fIfile\fR\fR option requests that bogofilter verifies the database file\&. It prints only errors, unless in verbose mode\&. .SH "DATA FORMAT" .PP Bogoutil reads and writes text files where each nonblank line consists of a word, any amount of horizontal whitespace, a numeric word count, more whitespace, and (optionally) a date in form YYYYMMDD\&. Blank lines are skipped\&. .SH "RETURN VALUES" .PP 0 for successful operation\&. 1 for most errors\&. 3 for I/O or other errors\&. Error 3 usually means that something is seriously wrong with the database files\&. .SH "AUTHOR" .PP Gyepi Sam \&. .PP Matthias Andree \&. .PP David Relson \&. .PP For updates, see \m[blue]\fBthe bogofilter project page\fR\m[]\&\s-2\u[1]\d\s+2\&. .SH "SEE ALSO" .PP bogofilter(1), bogolexer(1), bogotune(1), bogoupgrade(1) .SH "NOTES" .IP " 1." 4 the bogofilter project page .RS 4 \%http://bogofilter.sourceforge.net/ .RE bogofilter-1.2.4/doc/bogotune.xml0000644000175000017500000001540112163572307015156 0ustar sezsez bogotune 1 Bogofilter Reference Manual Bogofilter bogotune find optimum parameter settings for bogofilter bogotune -v -c config -C -d dir -D -r value -T value -n okfile [[-n] okfile [...]] -s spamfile [[-s] spamfile [...]] -M file bogotune -h DESCRIPTION Bogotune tries to find optimum parameter settings for bogofilter. It needs at least one set each of spam and non-spam messages. The production wordlist is normally used, but it can be directed to read a different wordlist, or to build its own from half the supplied messages. In order to produce useful results, bogotune has minimum message count requirements. The wordlist it uses must have at least 2,000 spam and 2,000 non-spam in it and the message files must contain at least 500 spam and 500 non-spam messages. Also, the ratio of spam to non-spam should be in the range 0.2 to 5. If you direct bogotune to build its own wordlist, it will use the half the input or 2000 messages (whichever is larger) for the wordlist. Message files may be in mbox, maildir, or MH folder or any combination. Msg-count files can also be used, but not mixed with other formats. OPTIONS The option prints the help message and exits. The option increases the verbosity level. Level 1 displays the scan output in detail instead of using a progress meter. The filename option tells bogofilter to read the config file named. The option prevents bogotune from reading a configuration file. The dir option specifies the directory for the database. See the ENVIRONMENT section for other directory setting options. The option tells bogotune to build a wordlist in memory using the input messages. The messages are read and divided into two groups. The first group is used to build a wordlist (in ram) and the second is used for tuning. To meet the minimum requirements of 2000 messages in the wordlist and 500 messages for testing, when is used, there must be 2500 non-spam and 2500 spam in the input files. If there are enough messages (more than 4000), they will be split evenly between wordlist and testing. Otherwise, they will be split proportionately. The option tells bogotune that the following argument is a file (or folder) containing non-spam. Since version 1.0.3, multiple arguments to the option can be given. All non-option arguments until the next option will be treated as though they had been preceded by The option tells bogotune that the following argument is a file (or folder) containing spam. It can be repeated as often as necessary. Since version 1.0.3, multiple arguments to the can be given. All non-option arguments until the next option will be treated as though they had been preceded by . The option tells bogotune to use the following parameter as the robx value. The option tells bogotune to use the following parameter as fp target value. The option tells bogotune to convert the file to message count format. This format provides a sorted list of each message's unique tokens, along with their ham and spam counts. Sorting hides the sense of the messages quite effectively, thus protecting privacy. The message-count format allows bogotune and bogofilter to score messages quickly without needing the original token database. ENVIRONMENT Bogofilter uses a database directory, which can be set in the config file. If not set there, bogofilter will use the value of BOGOFILTER_DIR. Both can be overridden by the option. If none of that is available, bogofilter will use directory $HOME/.bogofilter. Bugs Bogotune is not particularly robust when presented with garbage input. AUTHOR The bogofilter developer team. For updates, see the bogofilter project page. SEE ALSO bogofilter(1), bogolexer(1), bogoupgrade(1), bogoutil(1) bogofilter-1.2.4/doc/bf_copy.1in0000644000175000017500000000444312163572472014653 0ustar sezsez'\" t .\" Title: bf_copy .\" Author: [see the "Authors" section] .\" Generator: DocBook XSL Stylesheets v1.78.0 .\" Date: 06/29/2013 .\" Manual: Bogofilter Reference Manual .\" Source: Bogofilter .\" Language: English .\" .TH "BF_COPY" "1" "06/29/2013" "Bogofilter" "Bogofilter Reference Manual" .\" ----------------------------------------------------------------- .\" * 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" bf_copy \- shell script to copy a bogofilter working directory .SH "SYNOPSIS" .HP \w'\fBbf_copy\fR\ 'u \fBbf_copy\fR [\-c] \fIsource_dir\fR \fIdestination_dir\fR .SH "DESCRIPTION" .PP \fBbf_copy\fR copies a bogofilter working directory to another directory\&. Currently it copies the database files (*\&.db), related files (log\&.*), and DB_CONFIG (if present)\&. .SH "OPTIONS" .PP The \fB\-c\fR option causes only active log files to be copied, not all\&. The default is to copy all log files\&. .SH "EXIT STATUS" .PP The script exits with status code 0 if everything went well, and nonzero if it encountered trouble\&. .SH "BUGS" .PP This script assumes all *\&.db files in the source directory are relevant and copies them\&. This may not match your actual configuration\&. .SH "NOTES" .PP This script is meant for use with Berkeley DB and SQLite based bogofilter versions\&. .PP This script expects a SUSv2 compliant shell\&. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used\&. .SH "AUTHORS" .PP Matthias Andree bogofilter-1.2.4/doc/bf_compact.xml0000644000175000017500000000502012163572307015425 0ustar sezsez bf_compact 1 Bogofilter Reference Manual Bogofilter bf_compact shell script to compact a bogofilter directory bf_compact bogofilter_directory wordlist_name Description bf_compact creates a more compact bogofilter working directory with a dump/load cycle and renames the previous bogofilter_directory to bogofilter_directory.old. Note: bf_compact cannot be used to process the current working directory, ".", because that cannot be renamed. If no wordlist_file arguments are given, then bf_compact will use the configured set of wordlists, if the given bogofilter_directory is the same as the configured, or use all *.db files if it is a different directory. Exit Status The script exits with status code 0 if everything went well, and nonzero if it encountered trouble. Notes This script will delete bogofilter_directory.old and all of its contents! This script expects a SUSv2 compliant shell. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used. Authors MatthiasAndree bogofilter-1.2.4/doc/bogoupgrade.xml0000644000175000017500000001131712163572307015634 0ustar sezsez bogoupgrade 1 Bogofilter Reference Manual Bogofilter bogoupgrade upgrades bogofilter database to current version bogoupgrade -h -d directory -i input file -o output file -b path to bogoutil DESCRIPTION bogoupgrade is a command to upgrade bogofilter's databases from an old format to the current format. Since the format of the database changes once in a while, the utility is designed to make the upgrade easy. OPTIONS The option prints the help message and exits. The specifies the directory with the wordlists for converting. This option is used when converting from multiple, separate wordlists (spamlist.db and goodlist.db - containing spam and ham tokens, respectively) to a combined wordlist (wordlist.db) which contains both spam and ham tokens. The specifies the input file to be converted. It should be a text file containing message counts, and possibly data. If there is no data in the text file, there should be a Berkeley DB file in the same directory as the text file which contains the data. The specifies the output Berkeley DB file. The gives the path to the bogoutil command. It defaults to 'bogoutil', in the hopes that your shell will find it. UPGRADING Follow these instructions to upgrade bogofilter's databases to the latest version. Stop all instances of bogofilter. While the upgrade tools lock the database files, the upgrade may take a long time if you have a busy site. Don't forget to stop cron jobs or daemons that fetch and process mail and could fire off bogofilter. Backup your data. Let's assume that you said: $ mv ~/.bogofilter ~/.bogofilter.safe $ mkdir ~/.bogofilter If your bogofilter version is less than 0.7, say: $ bogoupgrade -i ~/.bogofilter.safe/goodlist -o ~/.bogofilter/goodlist.db $ bogoupgrade -i ~/.bogofilter.safe/badlist -o ~/.bogofilter/spamlist.db If your bogofilter version is 0.7 or greater, say: $ bogoupgrade -i ~/.bogofilter.safe/hamlist.count -o ~/.bogofilter/goodlist.db $ bogoupgrade -i ~/.bogofilter.safe/spamlist.count -o ~/.bogofilter/spamlist.db Current versions of bogofilter use a combined wordlist that holds both spam and non-spam tokens. It is named wordlist.db. If you're updating from a version older than 0.14.0 that has separate wordlists (named goodlist.db and spamlist.db), use: $ bogoupgrade -d ~/.bogofilter.safe Done. Restart any stopped daemons, cron tasks, etc. AUTHOR bogoupgrade was written by Gyepi Sam gyepi@praxis-sw.com and David Relson relson@osagesoftware.com. For updates, see the bogofilter project page. SEE ALSO bogofilter(1), bogolexer(1), bogotune(1), bogoutil(1) bogofilter-1.2.4/doc/bogoutil.htmlin0000644000175000017500000003323412163573355015663 0ustar sezsezbogoutil

Name

bogoutil — Dumps, loads, and maintains bogofilter database files

Synopsis

bogoutil { -h | -V }

bogoutil [options] { -d file | -H file | -l file | -m file | -w file | -p file }

bogoutil { -r file | -R file }

bogoutil { --db-print-leafpage-count file | --db-print-pagesize file | --db-verify file | --db-checkpoint directory [flag...] | --db-list-logfiles directory | --db-prune directory | --db-recover directory | --db-recover-harder directory | --db-remove-environment directory }

where options is

bogoutil [-v] [-n] [-C] [-D] [-a age] [-c count] [-s min,max] [-y date] [-I file] [-O file] [-x flags] [--config-file file]

DESCRIPTION

Bogoutil is part of the bogofilter Bayesian spam filter package.

It is used to dump and load bogofilter's Berkeley DB databases to and from text files, perform database maintenance functions, and to display the values for specific words.

OPTIONS

The -d file option tells bogoutil to print the contents of the database file to stdout.

The -H file option tells bogoutil to print a histogram of the database file to stdout. The output is similar to bogofilter -vv. Finally, hapaxes (tokens which were only seen once) and pure tokens (tokens which were encountered only in ham or only in spam) are counted.

The -l file option tells bogoutil to load the data from stdin into the database file. If the database file exists, stdin data is merged into the database file, with counts added up.

The -m option tells bogoutil to perform maintenance functions on the specified database, i.e. discard tokens that are older than desired, have counts that are too small, or sizes (lengths) that are too long or too short.

The -w file option tells bogoutil to display token information from the database file. The option takes an argument, which is either the name of the wordlist (usually wordlist.db) or the name of the directory containing it. Tokens can be listed on the command line or piped to bogoutil. When there are extra arguments on the command line, bogoutil will use them as the tokens to lookup. If there are no extra arguments, bogoutil will read tokens from stdin.

The -p file option tells bogoutil to display the database information for one or more tokens. The display includes a probability column with the token's spam score (computed using bogofilter's default values). Option -p takes the same arguments as option -w .

The -r file option tells bogoutil to recalculate the ROBX value and print it as a six-digit fraction.

The -R file option does the same as -r, but saves the result in the training database without printing it.

The -I file option tells bogoutil to read its input from file rather than stdin.

The -O file option tells bogoutil to write its output to file rather than stdout.

The -v option produces verbose output on stderr. This option is primarily useful for debugging.

The -C inhibits reading configuration files and lets bogoutil go with the defaults.

The --config-file file option tells bogoutil to read file instead of the standard configuration file.

The -D redirects debug output to stdout (it usually goes to stderr).

The -x flags option sets debugging flags.

Option -n stands for "replace non-ascii characters". It will replace characters with the high bit (0x80) by question marks. This can be useful if a word list has lots of unreadable tokens, for example from Asian spam. The "bad" characters will be converted to question marks and matching tokens will be combined when used with -m or -l, but not with -d.

Option -a age indicates an acceptable token age, with older ones being discarded. The age can be a date (in form YYYYMMMDD) or a day count, i.e. discard tokens older than age days.

Option -c value indicates that tokens with counts less than or equal to value are to be discarded.

Option -s min,max is used to discard tokens based on their size, i.e. length. All tokens shorter than min or longer than max will be discarded.

Option -y date is specifies the date to give to tokens that don't have dates. The format is YYYYMMDD.

The -h option prints the help message and exits.

The -V option prints the version number and exits.

ENVIRONMENT MAINTENANCE

The --db-checkpoint dir option causes bogoutil to flush the buffer caches and checkpoint the database environment.

The --db-list-logfiles dir option causes bogoutil to list the log files in the environment. Zero or more keywords can be added or combined (separated by whitespace) to modify the behavior of this mode. The default behavior is to list only inactive log files with relative paths. You can add all to list all log files (inactive and active). You can add absolute to switch the listing to absolute paths.

The --db-prune dir option causes bogoutil to checkpoint the database environment and remove inactive log files.

The --db-recover dir option runs a regular database recovery in the specified database directory. If that fails, it will retry with a (usually slower) catastrophic database recovery. If that fails, too, your database cannot be repaired and must be rebuilt from scratch. This is only supported when compiled with Berkeley DB support with transactions enabled. Trying recovery with QDBM or SQLite3 support will result in an error.

The --db-recover-harder dir option runs a catastrophic data base recovery in the specified database directory. If that fails, your database cannot be repaired and must be rebuilt from scratch. This is only supported when compiled with Berkeley DB support with transactions enabled. Trying recovery with QDBM or SQLite3 support will result in an error.

The --db-remove-environment directory option has no short option equivalent. It runs recovery in the given directory and then removes the database environment. Use this before upgrading to a new Berkeley DB version if the new version to be installed requires a log file format update.

The --db-print-leafpage-count file option prints the number of leaf pages in the database file file as a decimal number, or UNKNOWN if the database does not support querying this figure.

The --db-print-pagesize file option prints the size of a database page in file as a decimal number, or UNKNOWN for databases with variable page size or databases that do not allow a query of the database page size.

The --db-verify file option requests that bogofilter verifies the database file. It prints only errors, unless in verbose mode.

DATA FORMAT

Bogoutil reads and writes text files where each nonblank line consists of a word, any amount of horizontal whitespace, a numeric word count, more whitespace, and (optionally) a date in form YYYYMMDD. Blank lines are skipped.

RETURN VALUES

0 for successful operation. 1 for most errors. 3 for I/O or other errors. Error 3 usually means that something is seriously wrong with the database files.

AUTHOR

Gyepi Sam .

Matthias Andree .

David Relson .

For updates, see the bogofilter project page.

SEE ALSO

bogofilter(1), bogolexer(1), bogotune(1), bogoupgrade(1)

bogofilter-1.2.4/doc/bogotune-faq.html0000644000175000017500000001314612163572307016073 0ustar sezsez Bogotune FAQ

Bogotune FAQ

Official Versions: In bogotune-faq
Maintainer: David Relson <relson@osagesoftware.com>

This document is intended to answer frequently asked questions about bogotune.

Where did bogotune come from?

Greg Louis wrote the original Robinson geometric-mean and Robinson-Fisher algorithm code for bogofilter. To determine the optimal parameters for the Robinson-Fisher algorithm he wrote bogotune. The initial implementation was written in the R programming language. This was followed by the Perl implementation. Both of these implementations were slow because bogofilter had to be run for each message being scored. David Relson translated bogotune from Perl to C to provide more speed.

What's the message count format?

The parsing of a message by bogofilter takes some time. After parsing, finding the spam and non-spam counts for each token takes additional time. Having to repeate these steps every time bogotune needed a score was slow. It was realized that parsing and look-up could be done once with the results being saved in a special format. Initially this was called the bogolex format because the work was done by piping bogolexer output to bogoutil and formatting the result. Since each processed message begins with the .MSG_COUNT token the format became knowns as the message count format. The convention is to use a .mc extension for these files.

How does bogotune work?

First it reads all the files into memory, i.e. the wordlist and the ham messages and the spam messages. From the wordlist tokens, it computes an initial robx value which is used in the initial scan of the messages to ensure they're usable.

Given the total number of messages in the test set, a target number of false positives is selected for use in determining spam cutoff values in the individual scans.

Then comes the coarse scan. Using 225 combinations of values chosen to span the potentially useful ranges for robs, robx, and min_dev, all the ham messages are scored and the target value is used to find a spam_cutoff score. Then the spam messages are scored and the false negatives are counted. The scan finishes with a listing of the ten best sets of parameters and their scores (false negative and false positive counts and percent).

From the results, the best non-outlying result is picked and these parameters become the starting point for the fine scan.

The fine scan, as the name suggests, scans the region (range of values of robs, robx and min_dev) surrounding the optimum found in the coarse scan, with smaller intervals so as to determine the optimum values more precisely.

How does bogotune ensure the messages it works with are numerous enough, and well enough classified, to deliver useful recommendations?

It has certain minimum requirements that it checks for as it starts up. It will complain (and halt) if there are fewer than 2,000 ham or 2,000 spam in the wordlist, or if there are fewer than 500 ham or 500 spam in the set of test messages. It will warn, but not halt, if there's too little scoring variation in the ham messages or the spam messages or if too many of the ham messages score as spam (or vice versa) on the initial pass. There are additional checks, but I'm sure you get the idea from these examples. For details, use the source :)

Can I tell bogotune to do its work even though it doesn't like the data?

No. At one time we had a -F option to force bogotune to run with unsuitable message data, but it was realized that this could be misleading and had little chance of being helpful. Bogotune will warn the operator if its conclusions are untrustworthy due to marginal input, and will not run if its input data are detectably inadequate.

bogofilter-1.2.4/doc/bf_tar.xml0000644000175000017500000000705112163572307014573 0ustar sezsez bf_tar 1 Bogofilter Reference Manual Bogofilter bf_tar shell script to write a tar file of a bogofilter directory to stdout bf_tar -r -R bogofilter_directory Description bf_tar bundles a bogofilter working directory in tar format and copies it to standard output (your console, or where you redirect it, see EXAMPLES below). Options The option causes bf_tar to remove inactive log files after the archive has been written successfully. The default is to leave log files. The option causes bf_tar to remove inactive log files before the archive is written. This may reduce chances that the resulting archive is recoverable should it become damaged. The archive may be smaller though. The default is to leave log files. Exit Status The script exits with status code 0 if everything went well, and nonzero if it encountered trouble. Examples bf_tar ~/.bogofilter > outfile.tar Writes a standard .tar file containing the essential files from ~/.bogofilter to outfile.tar. bf_tar ~/.bogofilter | gzip -9 -c > outfile.tar.gz Writes a gzipped .tar.gz file containing the essential files from ~/.bogofilter to outfile.tar.gz. bf_tar `pwd`/mydirectory > outfile.tar Prepend $(pwd)/ or `pwd`/ if you want to specify an absolute path instead of a relative path. Notes This script is meant for use with Berkeley DB based bogofilter versions. This script requires a SUSv2 compliant pax utility. This script expects a SUSv2 compliant shell. Solaris systems should have the SUNWxcu4 package installed (when bogofilter is configured) so that /usr/xpg4/bin/sh can be used. Authors MatthiasAndree bogofilter-1.2.4/TODO0000644000175000017500000001017512163572307012540 0ustar sezsez# $Id: TODO 6883 2010-03-14 14:34:33Z m-a $ bogofilter TODO list **** Solaris: /opt/csw - fix system iconv vs. csw iconv. This fails if for instance libsqlite3 is taken from /opt/csw --with-libsqlite3-prefix, because iconv isn't taken from there. This needs a *general* cleanup of prefixes, because those don't apply to includes (which probably causes these issues). **** Documentation: Berkeley DB 4.7, check options (versions for existing ones, new options), use a list of versions that require a log format upgrade (or DB format or whatever) for simplicity **** Database (Berkeley DB): Use auto-recover features of Berkeley DB 4.4+ and give up on our own recovery locking and crash detection. **** Database (Berkeley DB): Can we use the bulk load feature to our advantage? **** If insufficient data is present and the default "undecided" bogosity is added in -p mode, add also a comment stating that bogofilter needs more training first **** Add a "reservation lock" (fcntl style on separate file) so that a writer can prevent new readers from starting, so that busy scoring systems don't starve registration processes. (Figure out the details to avoid deadlock.) **** Drop/fix MAXTOKENLEN: where it is an allocation, it must die. Where it is a character limit, count characters, not octets, to support UTF-8. **** Database (Berkeley DB): Implement Concurrent Data store, quite similar to Transactional. **** MIME: Make sure that RFC-2047 decoder runs only once, not recursively. **** MIME: Implement RFC-2046 section 5.2.2 (message/partial reassembly rules, Take most headers from enclosing message except Content-*, Subject, Message-ID, Encrypted, MIME-Version, which are taken from the enclosed message). **** Reimplement seeking passthrough mode that got dropped on 2003-08-23 with the switch to bogoreader.* http://article.gmane.org/gmane.mail.bogofilter.general/9035 and followups. (MID <20041222105734.GA30574@sela.f4n.org>, by "John" Subject "Size limit?" on 2004-12-22) The fseek() code to determine if the input is seekable got removed when the reader moved out of main.c between 1.66 and 1.67 (CVS) and has never been in bogoreader.c. **** New Feature: Token aging. Support for struct data in the wordlists is already present. **** New feature: Token merging, based on delta tokens (Andras Salamon, andras@dns.net on bogofilter-dev, 2005-01-25) **** Two deletes for kmail? This wouldn't be a patch for bogofilter itself, but a change to give kmail delete-as-spam and delete-as- nonspam buttons. Similarly for other MUAs. **** New Feature: Make it a milter? **** New Feature: Multiple list file support with weights and rules. Wordlist verfification. Eric Seppanen: > Allow use of a variable number of list files, each with their > own weights and rules. > Possible uses: > - hand-maintained "whitelist" or "blacklist" files, with massive > weighting to override everything else. > - allow users to use system-wide list files and their own files. > Shared-database version based on the autodaemon code, In the shared-database version (which doesn't yet exist) worldlist verification to avoid attacks on posters (thanks, Barry!). Emulate the Vipul's Razor reputation scheme for people reporting tokens? http://razor.sourceforge.net/ **** What this software is probably heading towards is a scheme in which there's a general notion of tagged categories (spam being one) with cluster analysis being applied to categorize which categories a message belongs to at above 0.9 confidence level. **** New Feature: Web based tool for wordlist management. Allow message registration and whitelist management. HTML Templatized for easy integration with existing web mail systems. **** New Feature: Add support for a user configurable list of headers that should be used to ignore (single or multi-line) headers that appear in the list. The list should be used to ignore headers both during the message registration and evaluation procedures. bogofilter-1.2.4/config.guess0000755000175000017500000013016212145424021014354 0ustar sezsez#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, # 2011, 2012, 2013 Free Software Foundation, Inc. timestamp='2012-12-30' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # # Originally written by Per Bothner. # # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD # # Please send patches with a ChangeLog entry to config-patches@gnu.org. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown case "${UNAME_SYSTEM}" in Linux|GNU/*) eval $set_cc_for_build cat <<-EOF > $dummy.c #include #ifdef __UCLIBC__ # ifdef __UCLIBC_CONFIG_VERSION__ LIBC=uclibc __UCLIBC_CONFIG_VERSION__ # else LIBC=uclibc # endif #else # ifdef __dietlibc__ LIBC=dietlibc # else LIBC=gnu # endif #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC'` ;; esac # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:Bitrig:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'` echo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE} exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` # Reset EXIT trap before exiting to avoid spurious non-zero exit code. exitcode=$? trap '' 0 exit $exitcode ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm*:riscos:*:*|arm*:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*) echo i386-pc-auroraux${UNAME_RELEASE} exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval $set_cc_for_build SUN_ARCH="i386" # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH="x86_64" fi fi echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[4567]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) UNAME_PROCESSOR=`/usr/bin/uname -p` case ${UNAME_PROCESSOR} in amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW64*:*) echo ${UNAME_MACHINE}-pc-mingw64 exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:MSYS*:*) echo ${UNAME_MACHINE}-pc-msys exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; authenticamd | genuineintel | EM64T) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; 8664:Windows_NT:*) echo x86_64-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC} exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; aarch64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; aarch64_be:Linux:*:*) UNAME_MACHINE=aarch64_be echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC="gnulibc1" ; fi echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-${LIBC} else if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_PCS_VFP then echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi else echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf fi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; cris:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; crisv32:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; frv:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; hexagon:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:Linux:*:*) echo ${UNAME_MACHINE}-pc-linux-${LIBC} exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; mips:Linux:*:* | mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef ${UNAME_MACHINE} #undef ${UNAME_MACHINE}el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=${UNAME_MACHINE}el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=${UNAME_MACHINE} #else CPU= #endif #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'` test x"${CPU}" != x && { echo "${CPU}-unknown-linux-${LIBC}"; exit; } ;; or32:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; padre:Linux:*:*) echo sparc-unknown-linux-${LIBC} exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-${LIBC} exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-${LIBC} ;; PA8*) echo hppa2.0-unknown-linux-${LIBC} ;; *) echo hppa-unknown-linux-${LIBC} ;; esac exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-${LIBC} exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-${LIBC} exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; tile*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-${LIBC} exit ;; x86_64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configury will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; x86_64:Haiku:*:*) echo x86_64-unknown-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown case $UNAME_PROCESSOR in i386) eval $set_cc_for_build if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then UNAME_PROCESSOR="x86_64" fi fi ;; unknown) UNAME_PROCESSOR=powerpc ;; esac echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NEO-?:NONSTOP_KERNEL:*:*) echo neo-tandem-nsk${UNAME_RELEASE} exit ;; NSE-*:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; i*86:AROS:*:*) echo ${UNAME_MACHINE}-pc-aros exit ;; x86_64:VMkernel:*:*) echo ${UNAME_MACHINE}-unknown-esx exit ;; esac eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: bogofilter-1.2.4/bogofilter.cf.example0000644000175000017500000001641712163572311016150 0ustar sezsez########### Sample BOGOFILTER Configuration File ########################### # $Id: bogofilter.cf.example 6811 2009-02-21 20:32:50Z relson $ # Default settings (as defined in the bogofilter source code) # have a single hash mark at the beginning of the line. # Alternate values have two hash marks. # Comment lines MUST have their hash mark in the leftmost column. # Comments can be added at the end of any line (after whitespace and a '#'). # Blank lines are allowed. ########### General Settings ######################################## #### BOGOFILTER_DIR # # directory for wordlists # #bogofilter_dir=~/.bogofilter ##bogofilter_dir=/var/spool/bogofilter #### name/location of user config file # #user_config_file=~/.bogofilter.cf ##user_config_file=~/.bogofilterrc ##user_config_file=~/.bogofilter/config #### TRANSACTIONS: enable/disable database transactions # # boolean indicating whether transactions # should be enabled (yes) or disabled (no) # #db_transaction=no # default ##db_transaction=yes # (alternate) #### WORDLIST: define additional word lists # # char type: 'r' (regular) or 'i' (ignore) # char *name: name of list, e.g. "system", "user", "ignore" # char *path: absolute path to file or # file name (relative to bogofilter_dir) # int order - once found, skip higher numbered lists # ##wordlist i,ignore,~/ignorelist.db,1 ##wordlist r,wordlist,~/wordlist.db,2 #### SPAM_HEADER_NAME # # used in reporting spamicity and # in removing already existing headers # #spam_header_name=X-Bogosity #### SPAM_HEADER_PLACE # # used in placing the SPAM_HEADER_NAME line # #spam_header_place=DomainKey-Signature #### SPAM_SUBJECT_TAG # # tag added to "Subject: " line for identifying spam or unsure # default is to add nothing. # ##spam_subject_tag=***SPAM*** ##unsure_subject_tag=???UNSURE??? #### STATS_IN_HEADER # # non-zero (default): put spamicity info in message header # zero: put spamicity info in message body # can use "bool" values of True, False, Yes, No, 1, or 0 # #stats_in_header=Yes # default ##stats_in_header=No # (alternate) #### DB_CACHESIZE # # non-zero: set this as DB cache size (in Mbytes) # zero: use DB default cache size (.25 Mbyte in 4.0.14) # # note that Berkeley DB increases any buffer size below 500 MB # by 25%! # This helps most when doing massive changes to the data base that # involve a lot of overwrites, such as registering mail boxes, # whereas it is mostly a waste of memory for read-only # applications such as scoring. # WARNING: If you set this too large, bogofilter will fail. # #db_cachesize=0 # default ##db_cachesize=16 # (alternate) #### DB_LOG_AUTOREMOVE # # boolean indicating whether auto-removing of # logs should be enabled (yes) or disabled (no) # #db_log_autoremove=yes # default ##db_log_autoremove=no # (alternate) #### TIMESTAMP # # enables or disables token timestamps # #timestamp=Yes #### Format of spamicity output # # for two-state output the third entry is not needed and not used # #spamicity_tags = Spam, Ham, Unsure #spamicity_formats = %0.6f, %0.6f, %0.6f # ##spamicity_tags = Yes, No, Unsure ##spamicity_formats = %0.6f, %0.6f, %0.6f #### Format of SPAM_HEADER # # formatting characters: # # h - spam_header_name, e.g. "X-Bogosity" # # c - classification, e.g. Yes/No, Spam/Ham/Unsure, +/-/? # # D - date, fixed ISO-8601 format for Universal Time ("GMT") # # e - spamicity as 'e' format # f - spamicity as 'f' format # g - spamicity as 'g' format # # A - IP address (from first Received: statement having one) # Not guaranteed to be the originating address of the message. # I - Message ID # Q - Queue ID (from first id tag found in Received: headers) # # l - logging tag (from '-l' option) # # o - spam_cutoff, ex. cutoff=%o # # p - spamicity value # d - if ham or unsure, the spamicity # if spam, difference of spamicity from 1.0 # # r - runtype # w - word count # m - message count # # u - username - this will either be the login from getlogin(), # if that is empty, the pw_name obtained from # the password database, or the user id # prefixed by #, for instance, #1003 # # v - version # # customizable messages: # # header_format - the "X-Bogosity" line that '-p' adds to # the message header and '-v' outputs. # terse_format - an abbreviated form of header_format; # selected by command line option '-t' # log_header_format - written to syslog by '-u' option # when classifying messages. # log_update_format - written to syslog by '-u' option # when registering messages. # # #header_format = %h: %c, tests=bogofilter, spamicity=%p, version=%v #terse_format = %1.1c %f #log_header_format = %h: %c, spamicity=%p, version=%v #log_update_format = register-%r, %w words, %m messages ##log_header_format = %h: %c, spamicity=%f, ipaddr=%A, queueID=%Q, msgID=%I, version=%v #### TERSE # # if enabled, format the X-Bogosity using the 'terse_format' specificaton. # #terse=no # default ##terse=yes # (alternate) ########### Tokenizer Settings ###################################### #### BLOCK ON SUBNETS # # convert IPADDRs into a special token, url:1.2.3.4, # and also return url:1.2.3, url:1.2, and url:1 # to allow identifying spammers by ip address / subnets. # #block_on_subnets=no #### CHARSET handling # # specify default charset # #charset_default=iso-8859-1 # default #charset_default=us-ascii # (alternate) ##charset_default=cp866 # for Russian #### REPLACE_NONASCII_CHARACTERS # # replace non-7bit chars with '?' # #replace_nonascii_characters=N # default ##replace_nonascii_characters=Y # (alternate) #### UNICODE handling # # boolean indicating whether raw storage (no) or unicode (yes) # is the default encoding for the wordlist # #unicode=yes # default ##unicode=no # (alternate) #### lexer parameters # # minimum and maximum lengths for single tokens # #min-token-len=3 # default #max-token-len=30 # default # # count and length for multi-word tokens # Note: if length not specified, defaults to # multi-token-count * max-token-len (approx) # #multi-token-count=1 # default #max-multi-token-len=0 # default ########### Classification Constants Settings ####################### # # See man page for a more detailled description of the parameters. #### MINIMUM DEVIATION # # if token spamicity closer to EVEN_ODDS (0.5) # than MIN_DEV, don't use the word in the # spamicity calculation # #min_dev=0.375 # default #### Robinson Constants # # floating point values for # Robinson S and X coefficients. # #robs=0.0178 # default #robx=0.52 # default #### CUTOFF Values # # both ham_cutoff and spam_cutoff are allowed. # setting ham_cutoff to a non-zero value will # enable tri-state results (Spam/Ham/Unsure). # #ham_cutoff = 0.45 # default #spam_cutoff= 0.99 # default # # for two-state classification: # ##ham_cutoff = 0.00 # default ##spam_cutoff = 0.99 # default #### Effective Size Factor Values # #ns_esf = 1.000 # default #sp_esf = 1.000 # default #### Auto-update threshold # # Skip autoupdating if the spamicity is within this value # of 0.000000 (surely ham) or 1.000000 (surely spam). # ## thresh_update=0.01 # (optional) #### token count parameters # # coerce the number of tokens used to score a message # Note: zero means no coercing # ##token_count=0 # default ##token_count_min=0 # default ##token_count_max=0 # default bogofilter-1.2.4/NEWS.00000644000175000017500000024343412163572311012706 0ustar sezsez1.0.0 2005-11-30 2005-11-28 * Minor FAQ updates and correctons. * Abort if ar(1) is not available during build. 2005-11-19 * bogofilter supports BerkeleyDB 4.4.16. doc/README.db and INSTALL have been updated accordingly. 0.96.6 2005-11-19 - Promoted to Stable Release 2005-11-11 (a.k.a. 1.0.0-rc6) * Fix parsing error after binary attachment. 2005-11-10 * Correct charset_default value in bogofilter.cf.example 0.96.5 2005-11-07 2005-11-04 * Fix parsing of config file string options. * Fix handling of unknown charset name. 0.96.4 2005-10-31 2005-10-29 * Removed the BUGS section from the bogofilter man page as it's now obsolete. 2005-10-26 * The bash-dependent contrib/* scripts were changed so they may now work on regular POSIX compliant sh (NOTE: Solaris has a POSIX sh in /usr/xpg4/bin/sh, Solaris's /bin/sh is unsuitable for bogofilter!) * The contrib/ directory is now managed by the top-level Makefile.am, which removes one "make" recursion. This implies that "bogogrep" is now built on the top level rather than in contrib/. * Renamed all contrib/ scripts to that their suffix gives a hint what kind of script it is (.pl, .sh). * Recognize all image/ types as opaque data that we do not parse, rather than just image/bmp. 0.96.3 2005-10-25 (a.k.a. 1.0.0-rc3) * Don't decode mime-audio and mime-video attachments. * Remove unused CP866 code. 2005-10-23 * Fix possible SIGSEGV with long html comments. 2005-10-22 * Don't decode mime-image and mime-application attachments. 2005-10-21 * Avoid pointer use after freeing its memory. * Avoid buffer overflow during conversion to unicode. 2005-10-15 * Fix program abort when bad options are used. * Remove unused Berkeley DB locking options. 2005-10-12 * Fixed sqlite build option in bogofilter.spec.in (contributed by Tobias Roppelt) 2005-10-07 * Added contrib scripts bfproxy, spamitarium, and stripsearch (contributed by Tom Anderson) 0.96.2 2005-10-06 - Promoted to Stable Release 2005-09-25 (a.k.a. 1.0.0-rc2) 2005-09-25 * SQLite3 - no longer using EXCLUSIVE in BEGIN TRANSACTION as it seems unnecessary and it causes trouble on MAC OSX 2005-09-19 * Require sqlite 3.2.6 and print warning if older version installed, to avoid people running into critical bugs in older sqlite3 versions. The test can be defeated by setting the environment variable BF_USE_OLD_SQLITE to any value. Also warn on 32-bit machines. 2005-09-16 * Fix bogus t.maint failures on some systems that don't use bash for /bin/sh (for instance, FreeBSD). 2005-09-11 * Resurrected atexit() code to ensure databases have been closed (needed for rare cases on RISC OS). 2005-09-07 * Perform unicode conversion after base64 and quoted-printable decoding. (Thanks to Mikhael Zabaluev for the patch) 2005-09-06 * (sqlite3 based builds only) Print reminder to register tokens before scoring if preparing the SELECT statement fails. * Avoid "obsolete option -I- used, please use -iquote instead" nagging from GCC version 4. (Heck, autoconf has even reached include lines that worked for ages.) 2005-09-05 * Replace mime stack by linked list (to correct gentoo bug #69893). * Fix configure's --with-included-gsl option. (Thanks to Torsten Veller for the patch) 0.96.1 2005-09-05 (a.k.a. 1.0.0-rc1) 2005-08-24 * Fix incompatibility with SunOS make(1S), adding a missing trailing backslash character to src/Makefile.am. 2005-08-17 * Update RISC OS versions of Makefile and config.h 0.96.0 2005-08-15 2005-08-14 * When directory name is argument for bogoutil's dump/load option, use "wordlist.db" to avoid a sigsegv. * Remove support for TDB, the Trivial Database. 2005-08-05 * db_lock.c: rename "cell_t" to "bf_cell_t" to avoid clashing with IRIX's cell_t. Reported by Daichi Kawahata. * configure.ac: MIPS doesn't have extended FP precisiopn. Patch by Daichi Kawahata. 2005-08-03 * bogotune - Restored code for recommending db_cachesize value. 2005-07-10 * Bogofilter now complains if sqlite 3.2.1 or older is used on a machine with a word width greater than 32 bits, but tries to proceed. It may however crash with SIGBUS as sqlite 3.2.1 performs unaligned 64-bit accesses. sqlite 3.2.2 or newer is strongly recommended. 2005-07-04 * Updated history of stable releases (file RELEASES). 2005-07-03 * Switched t.encoding test to use the POSIX utility cksum, rather than OS-specific utilities such as md5sum or md5. 0.95.2 2005-07-08 - Promoted to Stable Release 2005-06-30 2005-06-29 * Fix incorrect directory creation revealed by t.bogodir. * Use unicode & transaction enable/disable flags to limit 'make check' tests being run. 2005-06-28 * Fixed buffer allocation error causing problem processing RFC2047 encoded words. * Fixed wordlist access problems causing bogotune to incorrectly complain of mixed database encodings. 2005-06-21 * Bogofilter programs now use their own locking for transactional databases, to evade the problems with overflowing lock tables, resizing. The database is locked globally, which no longer allows registrations to happen concurrently with read access. The db-lk-max-locks and db-lk-max-objects options and the bf_resize scripts and pages have been removed. 0.95.1 2005-06-26 * Fixed some wordlist open conflicts in bogotune. * Document unicode requirements for 'make check' 2005-06-25 * Added unicode processing of encoded tokens. 2005-06-24 * Use iso-8859-1 for default charset, rather than us-ascii. 0.95.0 2005-06-20 * Fix bf_resize bash-isms (let BLAH...) and use POSIX-sh arithmetic expansion $((...)) instead, to fix bf_resize on FreeBSD. Reported by Andrey Chernov. 2005-06-19 * New unicode capabilities! - default configuration: . bogofilter auto-detects whether database is using unicode (utf-8) or not. . bogofilter uses unicode when creating new databases. . bogoutil preserves unicode/non-unicode stat during dump/load. . bogofilter, bogolexer, and bogoutil have "--unicode=yes/no" options which permit user selectable modes for experimenting, testing, and wordlist conversion. - configure with "--enable-unicode" or "--disable--unicode" builds bogofilter and bogolexer restricted to a single mode. - bogoutil uses "--unicode=yes/no" when creating a new wordlists. - bogoutil uses "--unicode=yes/no" in maintenance mode to convert a wordlist to/from unicode. - bogolexer uses "--unicode=yes/no" to control parsing 2005-06-18 * Added FAQ entry on using bogofilter with qmail. 2005-06-11 * Output --help messages to stdout (rather than stderr) so more can be used for paging. 2005-06-10 * TDB driver now copies TDB returned data in the traversor to align data at proper boundaries, to avoid SIGBUS on some architectures and performance loss on others. 2005-06-09 * Close environment after probing if it has transactions, to conform to Berkeley DB documentation and not leak a file descriptor. 2005-06-07 * Additional unicode support: Added global variable encoding { E_RAW, E_UNICODE } Added --unicode=yes/no options for bogolexer and bogoutil. Added meta-token .ENCODING { 1=raw, 2=unicode } 0.94.14 2005-06-18 - Promoted to Stable Release 2005-06-08 * Fix bug in transactional auto-detection that caused recovery to fail if the environment was in PANIC state. (Reported by Andrey Chernov.) 2005-06-06 * Removed extra SunOS 4.1.x support code. 2005-05-31 * Support systems with GNU iconv or separate libiconv. * Split up acinclude.m4 into separate files under m4/. 2005-05-29 * Refactor charset and unicode functions into charset.[ch], convert_charset.[ch], and conver_unicode.[ch] * Add configure and runtime options to select charset and/or unicode character conversion: ./configure - runtime selection ./configure --enable-unicode - unicode only ./configure --disable-unicode - charset only bogofilter --unicode=yes - use unicode conversion bogofilter --unicode=no - use charset conversion 2005-05-29 * Consistency: Skip test if Berkeley DB supports shared environments when ./configure --disable-transactions is run, as shared environments are only needed for transactions. (Fixes SunOS portability problem reported by Charles Hewson.) 0.94.13 2005-05-28 * Minor cleanups to iconv code. 2005-05-26 * Fixed buffer sizing problem affecting unicode encoding of long lines. * Added '-q' (quiet) option for bogofilter to suppress printing of statistics. * Added return code to lookup function to support error retries. 2005-05-24 * Fixed compilation problems with --enable-iconv and --enable-russian. Thanks to Lev Butyrev and Yar Tikhiy for reporting them. * Modified configure.ac and added t.query.config.in so t.query.con regression test works with --enable-iconv. 2005-05-21 * Efficiency: The SQLite adaptor now creates new databases with an additional index, to reduce CPU time for lookups. You can add the same index to existing databases by typing: sqlite3 ~/.bogofilter/wordlist.db \ 'CREATE INDEX bfidx ON bogofilter(key,value);' 2005-05-19 * Efficiency: The SQLite adaptor now precompiles the common SQL statements with variables, which avoids the need to parse/compile them for every single token we acces, and which avoids the need to hex encode/decode tokens (suggested by D. Richard Hipp, SQLite maintainer). * Efficiency: save one malloc() in db_get_dbvalue(). * Cleanup: The SQLite adaptor now uses a single central busy handler, which simplifies the code. * Bugfix: Fix abort/retry logic with transactional interfaces (Berkeley DB and SQLite) so that retries actually work. 0.94.12 2005-05-15 - Stable Release * RELEASE notes now has a brief summary of the changes since the last stable release (0.92.8) in October 2004. * Man pages added for the utility scripts bf_compact, bf_copy, bf_resize, and bf_tar. * bf_tar now includes the DB_CONFIG file in the output if present. 2005-05-13 * French FAQ updated by Fabrice Prigent. 2005-05-12 * bogofilter-milter.pl update by Jonathan Kamens. Use Spam/Ham rather than Yes/No, fixes to syslog calls, efficiency improvements. 0.94.11 2005-05-10 * Correct variable name in bf_resize. 0.94.10 2005-05-08 * Substitute path to the same awk program that configure found into bf_compact so it works on systems that have only nawk or gawk but not awk. * Substitute path to SUSv2 compliant shell in bf_* script "magic shebang" lines, so they use /usr/xpg4/bin/sh on Solaris 7+ and don't fail any more. * Repaired t.abort and t.probe tests to work with ancient shells. 2005-05-07 * Fixed pathing problem in bogoutil. Default directory should be "." * Revised utility scripts (bf_copy, bf_compact, bf_tar, bf_resize) for consistency and Solaris 9 compatibility. 0.94.9 2005-05-06 * Fixed pathing regression which caused 'bogofilter_dir=dir' option to supercede '-d dir' option. 0.94.8 2005-05-03 * Revised manpage's description of -p (passthrough) option. * When configured with --enable-transactions or --disable-transactions - Fixed compilation problem - Fixed bogofilter -Q reporting - Skip t.probe during "make check" 0.94.7 2005-04-30 * Fix transaction enabling/disabling so that command line options, i.e. --db-transactions=yes/no, are primary and probing is secondary. 0.94.6 2005-04-26 * Fixed bogoutil help and documentation to show that -d, -l, -w, -p, and -H options expect a filename, not a directory. * Refactored bfpath creation to clean up open modes and lessen number of external calls into paths.c * Added db-3.2.9 compatibility macro for db->stat(). * Updated bogominitrain.pl to v1.6 0.94.5 2005-04-23 * Fixed database open bug in bogoutil. 2005-04-20 * bf_compact now removes the $BOGOHOME.old directory before renaming the backup to this name, to avoid nested backup directories. * Let bf_compact maintain current state of transactions vs. non-transactions. (Bug report: Bill McClain) 2005-04-10 * Use bogoutil --db-print-leafpage-count in bf_resize. * Add --db-print-leafpage-count mode to bogoutil. * Use bogofilter -QQ in bf_resize and bf_tar. * Use bogoutil --db-list-logfiles in bf_copy and bf_tar. * Add --db-list-logfiles mode to bogoutil. Can list inactive or all logfiles in relative or absolute paths. * Repair bf_copy script that lost log.* files, possibly corrupting database if they had been transactional. The defect was introduced into bogofilter 0.94.2. 2005-04-09 * Suppress valgrind reports of errors in glibc::strchr. 0.94.4 2005-04-07 * The RELEASE.NOTES file has been reformatted for readability. * When using transactions, the db_log_autoremove option is now enabled by default (to match the documentation). * Option db_log_autoremove has been added to bogofilter.cf.example 2005-04-05 * Fix segfault in VERP processing. 2005-04-04 * The code for handling file and directory names has been rewritten for clarity and maintainability. Some options for bogoutil which used to take a directory argument now take a filename, for example -H, -r, and -R which all operate on a database, not on a database environment. 2005-04-03 * File handling code rewritten to use bfpath structure for holding all info and with a 3 step use of the info. 1 - create bfpaths during command line and config file processing; 2 - validate directories and file names; and 3 - use files for processing. 0.94.3 2005-03-29 2005-03-27 * Added FAQ info on using bogofilter with mutt and sylpheed claws. * Fixed --db-print-pagesize so that the proper directory is used for database environment. 2005-03-25 * Add error checking to bogoutil's ROBX calculation. * Allow --db-verify to work for non-transactional databases. * Repair several minor defects around --db-print-pagesize. Support page size detection with Berkeley DB 3.1 and 3.2 (it was already supported for 3.3 - 4.3). Offer --db-print-pagesize function in bogoutil --help when compiled against SQLite3. * Add more intensive bogoutil inspection to the test suite. * Fix incomplete cleanups that broke several bogoutil functions again, among them --db-recover[-harder], --db-remove-environment, --db-verify and --db-print-pagesize. * Let SQLite3 retry when the database is busy (rather than locked). 0.94.2 2005-03-24 * Fix SQLite3 open problem, trying again when the table it is locked. 2005-03-23 * Fix --enable-iconv breaking with non-ASCII default charset. * bogolexer now understands the --charset-default options. 2005-03-22 * Fix SQLite3 regression in 0.94.0 that broke consistency guarantees and caused a _massive_ slowdown. * Add 'bogoutil --db-print-pagesize', to query the database size, useful to replace running awk on 'db_stat -d database.db' output. 2005-03-20 * Fixed dirname/filename problem in bogotune. 0.94.1 2005-03-16 * Long options cleanup: options that have no meaning for a particular program are now rejected, to meet common expectations. The option parsing code was cleaned up and is easier to maintain now. 2005-03-14 * Add 'bogoutil --db-checkpoint', to replace db_checkpoint -1h. 2005-03-13 * Modified get_token() to use static storage in order to lessen malloc/free overhead. 2005-03-09 * Fix segfault in 'bogoutil --db-verify'. 2005-03-08 * Support for Berkeley DB 3.1 is back. * Terminate 'bogoutil -d' when SIGINT or SIGTERM is received. 2005-03-07 * Fixed query_config ('-Q') option. 0.94.0 2005-03-05 Default mode is transactions disabled for Berkeley DB. 2005-02-26 * Remove bogus signal handler, remove SIGKILL handling; ignore SIGINT, SIGTERM and SIGPIPE. * Fix non-transactional mode for Berkeley DB 4.0 and older. 2005-02-25 * Implement --db-log-autoremove=BOOL option, defaults to on. This option removes outdated log files automatically before closing the environment, to conserve disk space. * Added signal handler to catch SIGINT, SIGKILL, and SIGTERM and exit cleanly. * Support for Berkeley DB 3.1 has been removed as a side effect of automatically detecting transactional mode at run-time, since 3.1 lacks DB_JOINENV. 2005-02-24 * Transactional datastore autoprobing was completed, it assumes transactional mode if log.NNNNNNNNNN files (where N in {0, 1, ... 9}) are found. * Add swapped endian support for SQlite3 database, to support reading big endian (SPARC) generated databases on little endian machines (x86) and vice versa. To enable reading databases on machines with differing endian, dump and re-load the databases on a machine with same endian as the machine that created them. 2005-02-18 * Added code to auto-detect when a transaction environment exists and act accordingly (if none of the enable/disable options are specified in the config file or on the command line). 2005-02-10 * Fixed problem causing SIGSEGV when using options "-p" and "-s" with multiple wordlists. 2005-02-06 * Code to enable/disable Berkeley DB transactions now uses an OO paradigm (implemented via struct of method addresses). * Enabling/disabling transactions is now run-time selectable using "--enable-transactions=yes/no" on the command line and "enable_transactions=yes/no" in the config file. * Use "./configure --enable/disable-transactions" for build time specification. 2005-01-28 * Add option "--db-transaction=yes/no" for run-time enabling/disabling of transactions. 2005-01-25 * Removed unused program bogowordfreq. 2005-01-23 * Included charset_iconv.c in the build. 0.93.5 2005-01-22 2005-01-21 * Revised t.systest to remove vestiges of different scoring algorithms. 2005-01-17 * bogotune's '-M' option for converting a message to msg-count format now requires a filename option. 2005-01-15 * Fixed segfault caused by using non-existant option 'F' * Fixed size/count errors in wordhash code used by bogotune. 2005-01-12 * Fixed an array overrun in bogotune that caused problems when using msg-count files. * Include saving of Unsures in procmail example in man page. * Change Yes/No/Unsure to Spam/Ham/Unsure in FAQ. 2005-01-09 * bf_util scripts now use name 'BOGOHOME' for their directory parameter and check that it really is a directory. 0.93.4 2005-01-09 2005-01-08 * Misc fixing of compiler warning messages. * Minor refactoring of charset code. 2005-01-05 * Fix --enable-transactions logic, was inverted since 2004-12-26 (affected release: 0.93.3.1 only, 0.93.3 was fine). Note that giving neither --enable-transactions nor --disable-transactions would still enable transactions. 2005-01-04 * bogoutil now reads the configuration files to know the user's db_lk_max_* values. Reported by Karl O. Pinc. * Added '--config-file=name' to bogoutil to name a config file and '-C' option to suppress reading a config file. * Berkeley DB Transactional recovery now uses the actual db_lk_max_* values rather than hardcoded 1024. Reported by Karl O. Pinc. 2005-01-03 * Added '--default-charset=name' option to configure script. 2005-01-02 * Initial support for Russian character sets. (Thanks to Evgeny Kotsuba) 2004-12-30 * Bogolexer man page: replaced incorrect references to 'bogofilter' with 'bogolexer'. * Added '-O file' to specify bogolexer output file. 2004-12-28 * Fixed bogoutil --db-remove-environment DIR, which would just abort. * Fixed several memory leaks. * Refactored long option code. All definitions are now in one file (longoptions.c). Programs bogolexer and bogoutil ignore options that don't apply to them, rather than abort. * Long options used in the config file use underscores in their names. Used on the command line, they have hyphens. This fixes a problem where some options had hyphens and some had underscores. 0.93.3.1 2004-12-26 * Fixed errors in bogoutil's usage and help messages. 0.93.3 2004-12-24 * Bogoutil's options for maintaining the database environment are all long options with a "db-" prefix. * Bogoutil's help message and man page include the new long options. 2004-12-21 * Early Christmas Gift: Bogofilter now supports SQLite v3. Requires SQLite v3.0.8. See the RELEASE.NOTES. 2004-12-20 * Internal cleanup: Move transaction handling back into database space, and let the database backend driver map this into the environment if necessary. * Portability fix for BerkeleyDB versions 3.1 and 3.2: log_archive expects a fourth argument. 2004-12-17 * lexer_v3 HTML parser fix for urlencoded characters, by Krzysztof Foltman. Speeds up a particular case of malformatted mail. 2004-12-14 * bogoutil -C file now checks if the database file file is intact. (Only implemented for Berkeley DB stores with and without transactions.) 2004-12-13 * bf_compact now uses db_archive without -d option and loops on the results instead, calling rm in turn for each file. -d is not supported by older Berkeley DB versions such as 4.0. * bogoutil -P directory now checkpoints the database and removes inactive log files. Note you must save the database and remaining log files, in that order, if you want to be able to recover from corrupted files. 2004-12-10 * Limit mime overflow error messages to 1 per email. 2004-12-09 * configure now checks if Berkeley DB supports shared environments and suggests workarounds if it doesn't, to aid Fedora Core users. 2004-12-05 * New directory doc/programmer/OS2 contains configure.os2 script contributed by Yuri Dario 0.93.2 2004-12-03 * New script bf_resize DIR that checks the sizes of all databases in an environment and writes a lock size to DB_CONFIG. 2004-12-02 * Accuracy fix: message counts of ignore lists (that can be present) will be ignored and no longer skew the spamicity. 2004-12-01 * Allow environment to be group writable, reported by Fletcher Mattox. * Accuracy fix: no longer pretend that we had seen an empty message registered when there was no registration. Use ROBX for spamicity. This changes the output format of bogofilter -vvv mode when no spam or no ham messages have been registered previously. 2004-11-29 * Support for Berkeley DB 3.0 was explicitly removed again, so that no stable bogofilter version since 0.17.5 will have had support for this version. This eliminates the need for on-disk database format upgrades and keeps things simple. As the unadvertised breaking of BDB 3.0 didn't raise a single complaint and 3.1 has been around since July 2000, this should be safe. * Support long options in bogoutil. * Add --remove-environment DIR long option to bogoutil, to remove the environment. Only one such option can be used and there is no corresponding short option. * Remove useless numeric Berkeley DB error codes from error messages. 2004-11-26 * bogofilter processes will refuse to open multiple wordlists in different database environments (directories) when the transactional Berkeley DB datastore is compiled (default). The non-transactional (--disable-transactions), QDBM and TDB datastores are unaffected. 2004-11-21 * bogotune now uses getopt() to process the argument list, hence requires a '-n' flag before each non-spam file and a '-s' flag before each spam file. * bogotune now accepts '-x flags' to set debug flags. 2004-11-20 * Make scoring one huge transaction, rather than one individual transaction per token. This fixes consistency and should improve score speed. WARNING: this seems to have broken bogotune, which, BTW, doesn't return errors to the test suite (t.bulkmode, with message-count files), it reports a bogus "PASS" in spite of database PANICs. 2004-11-19 * Restored the old traditional Berkeley DB datastore that cannot be recovered. Its use is discouraged, to use this, type ./configure --disable-transactions * Restored the error message when recovery is attempted on QDBM databases, was lost in the DEPOT (hash) ->VILLA (B+tree) switch. 2004-11-15 * Added utility script bf_tar. 2004-11-14 * Added utility scripts bf_copy and bf_compact. * Added BerkeleyDB warning for binary rpm users. 2004-11-12 * New entries in bogofilter-faq.html on error messages "Lock table is out of available locks" and "Lock table is out of available object entries" * Add %u formatting option to print login or user ID information, SourceForge Feature Request #1056729. 0.93.1 2004-11-11 * The README.db file now has information on the DB_CONFIG file that can be created and used to configure the Berkeley DB module. * Bogofilter's config file now supports setting max lock and object counts for Berkeley DB using options db_lk_max_locks=N db_lk_max_objects=N * Bogofilter and bogoutil now allow these options on the command line, as: --db_lk_max_locks=N --db_lk_max_objects=N * When running database recovery automatically, don't let go of the lockfile, so we can do our actual work subsequently. 2004-11-10 * Support for BerkeleyDB 4.3 was added. We'll avoid DB_NOSYNC on DB->close() when DB_LOG_INMEMORY is configured for now. * Update manual pages/example outputs and filter recipe examples from "X-Bogosity: yes" to "X-Bogosity: Spam". Fixes Debian bug #280557. * Bugfix for BerkeleyDB 4.2 support: check the data base flags, not the environment flags, for DB_TXN_NOT_DURABLE, when determining whether DB_NOSYNC is safe on DB->close(). May fix some kinds of database corruption encountered with DB_TXN_NOT_DURABLE. * Return DB_VERSION_STRING contents in -V (version) output when compiled against Berkeley DB. Minor change to the output format. 2004-11-09 * Unify and clean up the horrible RELEASE.NOTES-*, CHANGES* and NEWS-* mess with lots of duplicated info. There shall only be one RELEASE.NOTES file and one NEWS file. RELEASE.NOTES shall contain important information for updates. NEWS shall contain noteworthy code changes in technical detail. This also removes the confusion that RELEASE.NOTES didn't contain information relevant for 0.93.X. 2004-11-08 * Berkeley DB mode: do not create data base in read mode (properly map open_mode to DB_RDONLY flag, store open_mode). * Berkeley DB mode: exit with error code if lock file cannot be created. Attempt recovery even if creation of lock file succeeded. 2004-11-07 * Fixed negative buffer index in mime.c 0.93.0 2004-11-06 "Broken compatibility" release * Fix bogotune's '-D' option. 2004-11-02 * Use only reentrant functions in the signal handler that runs periodically to check for crashed processes. Reported by Pavel Kankovsky. 2004-11-01 * Add a debugged and enhanced version of Stefan Bellon's QDBM Hash->B+tree converter. * Broke QDBM compatibility with 2004-10-30 change, check unsigned characters to match Berkeley DB behavior of bogoutil -d. 2004-10-31 * Rearranged flag setting for Berkeley DB data store, so as only to set DB_CHKSUM[_SHA1] when creating the data base. Fixes "checksum error: catastrophic recovery required" and consequential "wordlist.db: page 1: reference count overflow" errors Reported by Torsten Veller. * Revised RELEASE.NOTES-0.93 to move QDBM change into "Incompatible Changes" section and to mention BerkeleyDB dump/load for 4.1 and 4.2 to add checksums. * Inserted new section 2.2 into doc/README.db to mention that it is recommended to dump/load the data base when using BerkeleyDB 4.1 and 4.2. 2004-10-30 * Converted QDBM from hash files (DEPOT API) to B+ trees (Villa API) for better speed (Stefan Bellon). 2004-10-29 * Attempting recovery with TDB or QDBM data bases results in an error, so the user does not think it succeeded. * Document that recovery only works for Berkeley DB, but not TDB or QDBM. 2004-10-28 * Merged Transactional branch (for BerkeleyDB) back into the trunk. Further changes below. 2004-10-25 * Added GETTING.STARTED document. * Changed default mode from two-state to three-state - with ham_cutoff=0.45 and spam_cutoff=0.99 The ham_cutoff value is new and spam_cutoff is unchanged. - changed the "Yes/No" tags used in the "X-Bogosity:" line to "Spam/Ham/Unsure" NOTE: the next entries appear to be out of order, the pertinent changes have been developed on a side branch of bogofilter and have been merged for bogofilter 0.93.0. 2004-09-21 * bogofilter can now be used with Berkeley DB 3.0 or 3.1 although this is not recommended. You should prefer 4.2 or 4.1 instead. UPDATE: support for 3.0 was later removed on 2004-11-29 * Documentation on the write cache issue (recoverability of data bases) has been revised. 2004-09-13 * Updates doc/README.db with a section on the log file size and pointers to db_checkpoint and db_archive. 2004-09-03 (txn 2.1) * The on-line crash detector would consider its own process a zombie, so all processes that lasted 30 s or longer would abort themselves after that period. This was particularly prominent with BerkeleyDB 4.1 with x86/gcc-assembly mutexes as this combination appears rather slow when facing lock contention, causing t.lock3 failure. BDB 4.1 compiled to use POSIX mutexes (where working) appears to be a lot faster in this situation. 2004-09-01 (txn 2.0) * Hook up crash detection code. Bogofilter is now able to detect when recovery is necessary and should detect stalled data bases within 30 seconds. NOTE: this means if one process crashes all other processes accessing the same data base will abort with an error code. Stalled data bases happen when one process or the system crashes and doesn't have a chance to clear its locks. This code uses ideas from Matthias Andree and Pavel Kankovsky. 2004-08-23 (txn 1.1) * Add -f and -F options to bogoutil (mnemonic: fix) to run data base recovery. * Reimplement our own locking so that recovery and data base access don't collide and no two processes try running recovery at the same time. 0.92.8 2004-10-25 - Promoted to Stable Release 2004-10-19 * Bogotune now warns when using '-E' to suppress ESF checking and non 1.0 esf values are read from the config file. * bogofilter will now properly exit with code 3 when encountering write errors in pass-through mode. It would use the wrong code, 2, since the introduction of the "unsure" exit code. * Properly flush existing data before changing I/O buffer size. Fixes t.bogodir failure seen, for instance, on Solaris, particularly with -D and redirected output. 2004-10-15 * Limit bogotune's scanning to rx values between 0.4 and 0.6. 2004-10-13 * Ignore 'X-Bogosity' lines in mime attachments. 2004-10-12 * Revise lexer variables for flex-2.5.31 compatibility. 2004-10-10 * OS/2 compatibility fixes for configure, bogofilter, and bogoutil. (Thanks to Yuri Dario) 2004-10-09 * Fix a potential crash on malformatted input (writing a NUL byte to the wrong place) in the RFC-2047 decoder. Reported by Clint Adams. This fixes CVE id: CVE-2004-1007 0.92.7 2004-10-02 * '-M' allows processing 1 msg-count file with multiple messages. Otherwise allow multiple msg-count files with 1 message in each. 2004-09-30 * Allow only one of '-d' and '-D' options for bogotune. 2004-09-28 * Remove check for bogohome since it breaks "bogotune -D". 2004-09-25 * Fixed minor formatting defects in bogotune. * Fixed bogotune man page error for "-d" option. * Additional portability fix for SunOS 4.1.X 2004-09-23 * Fixed help messages for bogofilter's "-m" and "-o" options. 2004-09-10 * bogofilter-tuning.HOWTO revised and converted to html. 2004-09-05 * Ensure that robx computation uses a regular wordlist (rather than an ignore list) to avoid a seg fault in bogotune. 2004-08-30 * Remove bogus 'P' in bogolexer's allowed option list. 0.92.6 2004-08-22 * Revise "-QQ" output so it can be used (unchanged) in a config file. * Remove obsolete "--with-db" option from configure.ac 0.92.5 2004-08-20 2004-08-17 * Expanded discussion of long options in bogofilter's man page. * Merged files RELEASE.NOTES-0.1? into cumulative RELEASE.NOTES file. * Removed files CHANGES-0.1? as they duplicate info in NEWS. 2004-08-16 * Added "-QQ" option to bogofilter to display extended parameter list. 2004-08-15 * Documentation update. Sample configure commands now use option --with-libdb-prefix rather than obsolete --with-db. * Added "--wordlist" to bogofilter's help output. * Minor clean-ups for bogofilter's help output. 2004-08-10 * Improve documentation of '-B' and '-y' options. * Validate dates used with '-y'. * Diagnose missing wordlist specification. 2004-08-07 * Cross reference man pages to one another. * OS/2 compatibility changes (contributed by Yuri Dario). * Removed obsolete test output files - degen.out, combined.out, and separate.out 0.92.4 2004-07-29 - Stable Release * Warn on invalid options, rather than exit. 0.92.3 2004-07-27 2004-07-19 * Revise enums and regression tests for new format characters %A, %I, %Q. * Strip bogogrep_static executable to reduce binary rpm size. 2004-07-18 * Remove initialize() function in bogoconfig.c and use lexer_init() in lexer.c, which provides same functionality. 0.92.2 2004-07-11 * Bugfix: '%I' is now really the Message-ID, * Feature: '%Q' is now the queue ID 2004-07-10 * Use an explicit inputs/outputs directory list to avoid shipping test files in those directories. 2004-07-08 * Miscellaneous cleanups, removed 'degen' code remainders. 2004-07-07 * Formatting character changes: '%A' is now the message's IP address. '%I' is now the message's ID. * bogofilter-faq.html - corrected editting error that deleted "asian spam" question and added answer to "multi-user" question. * Fix self-test suite ("make check") when bogofilter is compiled with QDBM or TDB as the data base engine. 2004-07-02 * The self-test suite now properly detects valgrind when make check VERBOSE=-x is used. 2004-07-01 * Convert a C99/C++ //-style comment to a /* C-style comment */ * Fix valgrind self test that still had an obsolete '-f' option. 0.92.1 2004-07-01 * Remove 'g', 'r', and 'f' from bogofilter's OPTIONS list as there's only one scoring algorithm. * Removed obsolete occurrences of '-g' and '-f' from regression tests. 2004-06-30 * Revised README file. 2004-06-29 * French version of FAQ updated. * Rewrote code for identifying message's originating IP address. * Changed name of variable 'ipaddr' to 'msgaddr'. * Added t.msgaddr to regression test. 2004-06-27 * Fixed db_init/db_cleanup problems encountered with multiple wordlists and concurrent data stores. 0.92.0 2004-06-26 - Stable Release * Added ESF options to bogofilter's man page. * Revised man pages' description of multi-parameter options. 2004-06-25 * Fixed problem recognizing empty line ending of header in files with CRLFs and X-Bogosity line as last header line. 2004-06-24 * Added ESF options to bogofilter's help message. 2004-06-22 * t.lock3 regression modified for solaris shell compatibility. 0.91.4 2004-06-20 2004-06-19 * Fix abort during db_open (ds_open wasn't first calling ds_init). * Added regression test t.lock3 for this fix. * Revise datastore and database levels so that each level calls its own init() and cleanup() routines. 0.91.3 2004-06-15 2004-06-14 * Added format specification '%I' to allow logging of the IP address from which an email was received. 2004-06-13 * Avoid "Invalid buffer size, exiting." problems by discarding text from an excessively long html tag. 0.91.2 2004-06-11 * Bogofilter's creation of new wordlists now includes .WORDLIST_VERSION token. * Fix erroneous double opening of wordlists specified on command line. * Corrected tests so that "make check" passes with qdbm and tdb. 2004-06-10 * Fix included GSL compile for compilers that do not support "extern inline", such as Compaq C V6.3. * FAQ updated with info on multiple wordlists and ignore lists. * FAQ updated with info on building as non-root user. 0.91.1 2004-06-04 2004-06-04 * Fix problem with not expanding tildes. * Add DS_LOAD flag to distinguish between database creation by bogofilter and bogoutil so .WORDLIST_VERSION is only added by bogofilter. * Modify regression tests to use bogoutil to create empty wordlists (as needed). 2004-05-30 * Fixed registration. When multiple wordlists are specified, registration is to first regular wordlist. * Added regresstion test for multiple wordlists. 2004-05-29 * Distinguish open modes of READ, WRITE, and CREATE so * bogofilter will include .WORDLIST_VERSION in new database. 2004-05-28 * Modify contrib scripts so they're sh compatible. * Fix problem with not expanding tildes. 2004-05-23 * Use named constants for wordlist 'type' attribute. 2004-05-22 * Fix problem when bogofilter's home is a symlink. 0.91.0 2004-05-22 * Miscellaneous cleanups for multiple wordlist code. * Cleanup variable names in database open() code. * Increase width of 'count' column for -vvv output. 2004-05-17 * Add ignore list capability. * Revive and revise multiple wordlist code. 0.90.0 2004-05-09 * Revised bogotune's parameter ranges for coarse scan. 2004-05-08 * Changed list address in FAQ to bogofilter.org 2004-05-05 * Added code for Robinson's Effective Size Factor (ESF) to score.c, bogotune.c, bogofilter.cf.example, etc. * Added '-E' options to bogotune to suppress ESF scan. 2004-05-02 * Remove unreferenced enum wl_e. * Add .WORDLIST_VERSION meta symbol. * Change subnet prefix from url: to ip: * Add -u switch to bogoutil to do wordlist upgrade. * Add regression test t.upgrade.subnet.prefix 2004-04-22 * Fixed configure's --enable-memdebug option. 2004-04-12 * Updated TODO list and procmailrc.example 2004-04-02 * Lower output precision for regression tests, by using %f rather than %e, to mask differences between GSL versions. 0.17.5 2004-04-08 - Promoted to Stable Release 2004-04-01 2004-03-31 * Change default parameters to the results of Greg's 300k ham and 300k spam bogotune run: robs robx min_dev spam_co old 0.010000 0.415000 0.100000 0.950000 new 0.017800 0.520000 0.375000 0.990000 2004-03-22 * Fix check for PGP signatures. 0.17.4 2004-03-20 * Ignore data portion of PGP signatures. * Use "mime:" (rather than "head:") to tag mime part headers. 2004-03-19 * Fix "Can't find '.MSG_COUNT'" problem in bogotune. * Fix defect that continues decoding base64/qp after invalid chars. 2004-03-18 * Fix message reporting lack of config file. 0.17.3 2004-03-17 2004-03-15 * Warn if user specified config file doesn't exist. 2004-03-09 * Fix tagging of IPAddrs in header lines. 2004-03-04 * Added code to use Berkeley DB Concurrent Data Store, which uses a "DB_ENV" BerkeleyDB environment and the BerkeleyDB Lock Manager. This is documented in file doc/README.db. 2004-03-03 * "bogofilter -Q" output now includes all config file options and is formatted to be read in as a config file. 2004-02-27 * Removed t.lock2 from "make check". 2004-02-26 * Fixed minor bogotune problems related to building wordlists. 2004-02-23 * Exempt tokens .MSG_COUNT and .ROBX from maintenance operations. * Remove unused 'active' and 'weight' attributes of wordlists. * If message uses CRLF, put CRLF after added header lines. 2004-02-22 * Fixed code causing gcc 2.9x complaint. 0.17.2 2004-02-22 * Algorithm code cleanup -- created file score.[ch] from files method.[ch], robinson.[ch], and fisher.[ch] 2004-02-21 * Changed path in example config files to /var/spool/bogofilter. 2004-02-20 * Corrected typos in doc/bogofilter.xml (the man page) and in contrib/mailfilter.example * Documented bogoutil's histogram ('-H') option. * Revised documentation of '-d', '-p', and '-w' options for bogoutil. * Relax filename vs. path restrictions in bogoutil. 2004-02-19 * Added experimental code for BerkeleyDB environments code for improved locking and caching. 0.17.1 2004-02-09 * 2004-02-05 * Additional portability fixes for SunOS 4.1.4 * 2004-02-04 * Fix '-d' and '--bogofilter_dir=directory' options. 0.17.0 2004-02-01 * Documentation cleanups. 2004-01-31 * Fixed warnings from Intel C++ 8 * Portability fixes for SunOS 4.1.4 2004-01-30 * Removed DEPRECATED CODE. * Bogoutil now 'and's the maintenance operations together. * Bogofilter and bogolexer now use standard long option parsing. 2004-01-25 * Extracted basic typedefs from system.h into bftypes.h. 2004-01-23 * Correct processing order as '-V' doesn't need to read the config file. * Correct SIGSEGV causes by missing environment variables. 0.16.4 2004-01-31 - Promoted to Stable Version 2004-01-23 - Released 2004-01-20 * Config options 'thresh_stats' and 'thresh_rtable' have been deprecated. 2004-01-19 * Fix bogus config file warnings from bogolexer. * Merge lexer rules to save a few bytes. * Additional portability fixes. 0.16.3 2004-01-17 * Removed optional argument from "-u" flag. * Config file options can be put on the command line by using "--key=value" syntax. 0.16.2 2004-01-16 * Added '-c' (compact) option to bogominitrain.pl 2004-01-14 * Tag Cc: lines as To: lines. * Allow setting threshold for auto-updating, using the "-u value" flag or the "thresh_update=value" option. * Minor FAQ updates. 2004-01-12 * Pass -mieee to GCC on machines that know this option (Alpha, SH). Prevents SIGFPE and program termination with coredumps in some conditions. Reported by Paul Ackersville, fix suggested by Clint Adams. * Fix defined minimum autoconf/automake versions to match actual requirements: autoconf 2.54, automake 1.7. * Change AS_HELP_STRING to AC_HELP_STRING for compatibility with older autoconf than version 2.58. * Fix two compiler warnings in BerkeleyDB data store code. It is unknown whether one has real-world impact when opening data bases, fixing nonetheless. The other is cosmetic in any case. 2004-01-09 * '-H' now disables header tagging for bogofilter and bogolexer. 0.16.1 2004-01-08 2004-01-07 * Ignore X-Bogosity lines in message header. 2004-01-04 * Updated bogotune man page. * Fixed minor errors in bogotune. * Corrected memory leaks affecting bogotune. 2004-01-03 * Added additional ifdefs for deprecated code. * Added database histogram to bogoutil (using '-H' flag). 0.16.0 2004-01-01 * Added "#ifdef ENABLE_DEPRECATED_CODE" statements as appropriate. * Corrected configure.ac defect for "--enable-memdebug". * Corrected lexer defect that created unnecessary "rcvd:Received" tokens. * Fixed header file problem that causes sigsegv with qdbm. * Expanded VERP pattern to reduce hapax count. 0.15.13 2003-12-31 - Stable Release If updating from a bogofilter version older than 0.15.4, it's a good idea to retrain or else use the '-H' (header tag degeneration) option. 0.15.13 2003-12-26 * Fix problem with separate wordlists that causes "db_get_dbvalue( '...' ), err: 12, out of memory". 2003-12-25 * Fixed memory leak affecting bogotune. * Added -V (version) option to bogotune. * RPM build fixed. (with help from Charles A Edwards) * Compiler options changed to reduce warnings during gsl builds. 0.15.12 2003-12-24 * Distinguish between pipe and stdin as input sources. (contributed by Henning Makholm) 2003-12-23 * Minor fixes for parsing msg-count files. * Fix sigsegv in bogotune when '-D' option is used. * Clarify list of supported mail formats in FAQ. * Force line buffered output when not in passthrough mode. * Enhance memdebug capabilities. 2003-12-21 * Fix decoding of escaped urls. 2003-12-18 * Fix compilation problems with datastore_tdb.c and datastore_qdbm.c 0.15.11 2003-12-17 * Additional portability fixes for DGUX in configure.ac and bogogrep.c 2003-12-15 * Bugfix for SIGFPE (division by zero) crash on start-up on systems with BerkeleyDB 3.2 or older. * bogotune-faq.html - new file * bogofilter-faq.html - updated * bogoupgrade - revised help message and man page 2003-12-14 * bogotune now understands degeneration options and can use them when creating message-count files. 2003-12-12 * Fixed CRLF problem in bogoreader.c 2003-12-11 * Updates to bogofilter man page and FAQ. * Updates to configure scripts and makefiles to support DGUX. * Improved configuration of BerkeleyDB and GSL. 2003-12-10 * Removed unused '-F' (force) option from bogofilter. * Exclude ~ (tilde) at the end of tokens. 2003-12-09 * Removed unused '-q' (quiet) option from bogofilter. 0.15.10 2003-12-08 * Important string format fixes that address "prints garbage" and "crashes" problems. * Formatting and portability fixes for DGUX. * The test suite ("make check") now works without formail for t.bulkmode. * Added -M option to bogotune for creating message count files. msg-count.sh no longer needed. 2003-12-07 * Fixed "configure --enable-static" for building statically linked executables. * "make check" now uses static executables when "configure --enable-static" was used. * Revised msg-count.sh so that formail isn't needed. 2003-12-03 * Script msg-count.sh has been added to create message count files from mailboxes and mail directories. 2003-12-01 * Fixed bug in header degeneration. * Added degeneration options to config file. * Added subject line tagging for Unsures. (Contributed by Burkhard Kaas). 2003-11-30 * Multiple fixes, revisions, and changes to bogotune. 2003-11-27 * Fix defect in robx calculation (for bogoutil and bogotune). 2003-11-24 * The test suite ("make check") now works without procmail for t.MH and t.maildir. * Moved robx calculation code to new file for sharing by bogoutil and bogotune. * Fix segfault when using '-H' (header_degen) option. 0.15.9 2003-11-23 * Minor revisions to the FAQ. * Miscellaneous cleanups to bogotune.c * Cleanup bogoutil's help message. 2003-11-20 * Fixed a defect in lexer.c that was discarding X-Bogosity lines in rfc822 attachments. Thanks to Martin Gagern for reporting the problem and supplying a patch. * Fixed a memory leak in bogoutil. Thanks to Dan Deward for reporting the problem. * Refactored passthrough.c. * Test suite bugfixes for TDB/QDBM. 2003-11-19 * TDB passes all checks again. * Fixed a defect in QDBM support that was breaking maintenance mode. 2003-11-18 * Revised wordhash code to minimize storage needed for bogotune. 2003-11-17 * Exclude apostrophes and backticks at the end of a token. * Updated bogominitrain.pl to v1.4.2 * BerkeleyDB support warns if data base size approaches file size resource limit, to avoid DB corruption when bogofilter is spawned from Postfix-controlled systems (Postfix by default limits file size to 51,200,000 bytes). 2003-11-15 * "" is now recognized as starting html text. 2003-11-14 * Bogotune now checks for incorrectly classified messages in the test data and exits if so. * Configure now finds a POSIX compliant shell for running version.sh 2003-11-12 * Several minor lexer bugs fixed. * Lexer changes reduce size of bogofilter executable by approx 90%. 2003-11-07 * Minor error message cleanups. * Minor documentation fixes. 2003-11-05 * Fixed timestamp config option. * Removed repetition counts in lexer for TOKEN and MIME_BOUNDARY patterns to reduce executable size. 2003-11-01 * Remove --disable-* options for algorithms. Has never been supported well and serves no useful purpose, the algorithm code is irrelevant compared to lexer or other stuff. 0.15.8 2003-10-29 * Print "X-Bogosity" line when "-t" is used alone. * Modified handling of mime attachments to decode rfc822 and to ignore applications and images. 2003-10-27 * Change bogoupgrade back to using 2 arg open for perl-5.6 compatibility. 2003-10-26 * Added man page for bogotune. 2003-10-23 * Initial release of faster, C language version of bogotune. 2003-10-21 * Configure script modified to better detect BerkeleyDB libs. * Makefile modified to build bogolexer and bogoutil with fewer shared libs. 2003-10-19 * Added decoding of percent escaped characters in URLs. 2003-10-16 * English and french versions of bogofilter-faq.html revised. * Tuning script doc/bogotune rewritten as C program. 2003-10-15 * Fix build problem in doc directory. * Refactored source code so bogolexer will build without datastore code. 2003-10-14 * Fix initialization problem that prevents reading more than one msg-count file. * Initialize wordhash storage. 0.15.7 2003-10-13 * Include all tokens in bogoutil dump output (unless in maintenance mode). 2003-10-08 * Disable header line tagging when processing msg-count files. 2003-10-06 * Added decoding of escaped characters in html. * Revised mailbox processing so type recognition is now table driven. * Added support for ANT mailboxes. * Made portability changes for OS/2 and RISC-OS 0.15.6 2003-10-02 * Fixed problem in bogoupgrade. * Revised configure.ac to remove GLIBC-2.3 dependency and include info for DOS-ish file in config.h. 2003-10-01 * Bogofilter can now use GSL 1.0 to 1.3 as well as 1.4. If your distribution splits GSL into a library and a developer package (Mandrake and Debian Linux), remember to install both! * Rebuild i586.rpm with GSL dynamically linked; source rpms and bogofilter-static rpm not affected. * Don't allow whitespace in SMTP and ESMTP tokens. * Revised reference ouputs for SMTP/ESMTP change. 0.15.5.2 2003-10-01 * Rebuild of i586.rpm with GSL-1.4 dynamically linked. Source rpms and bogofilter-static rpm not affected. 0.15.5.1 2003-09-30 * Added GSL-1.4 as requirement for binary rpm. * Fixed up t.separate reference test and cleaned up t.degen, t.split, and t.regtest. * Man page and French FAQ revised. 0.15.5 2003-09-29 * Added '-H' (header-degen) option to aid transition to new parsing. See RELEASE.NOTES-0.15 for more info. 2003-09-28 * Minor revisions of OS/2 and RISC-OS compatibility code. 2003-09-27 * Transaction code added for wordlist maintenance. * Timestamp code refactored and moved from maint.c to datastore.c 2003-09-26 * VERPs (Variable Envelope Return Paths) now have their sequence numbers replaced by a '#' for scoring. * Fixed problem that caused auto-update ("-u") to not update separate wordlists. * End-of-header code revised to ensure that passthrough ("-p") properly places the X-Bogosity line. 2003-09-25 * GNU GSL 1.4 has replaced DCDFLIB. If GSL 1.4 or newer is installed in your system, bogofilter will use that (which will usually be a shared library); if GSL is missing or a prior version is present, bogofilter will statically link against GSL 1.4 excerpts from the gsl/ directory. While we believe we have been allowed to include DCDFLIB with bogofilter, some people had expressed concerns. GSL is subject to the GNU General Public License v2, so we are DEFINITELY allowed to include it. 2003-09-22 * Added support for OS/2's file system. 2003-09-21 * Fixed logging behavior when scoring mailboxes, maildirs, etc. 2003-09-20 * Fixed processing of rmail files. 0.15.4 2003-09-20 * Additional header line tagging as suggested by Michael O'Reilly. * Minor revision of bogotune. 2003-09-17 * Report if database file permissions wrong. * No longer including pid in syslog error messages. 2003-09-16 * No longer ignoring message separators. 2003-09-15 * Added BOGOTEST environment variable to enable flex debugging. * Minor revision of bogominitrain.pl 2003-09-13 * Fixed bogoutil problem with '-w' and '-p'. 2003-09-12 * Revise parsing pattern for "encoded text" and regression test for folded text. 2003-09-11 * Use GSL (the Gnu Scientific Library) when it's available. 0.15.3 2003-09-10 2003-09-09 * Fixed maintenance mode (broken during database API rewrite). * Added regression test for maintenance mode. * Re-organized test framework to put all scripts in src/tests, all input files in src/tests/inputs, and reference outputs in src/tests/outputs. 2003-09-08 * Revised parsing to ignore additional headers, i.e. Resent-Message-ID, In-Reply-To, and References. 2003-09-07 * Fix auto-update ('-u') bug that double registers ham and spam. * Correct QDBM optimization problems arising from API change. 0.15.2 2003-09-07 2003-09-06 * Header line unfolding now handled by flex rules. Special thanks to Michael O'Reilly for his help! * Initial release of RISC-OS support, including qdbm and tdb. * QDBM is now supported. * The data base configuration has changed. --with-tdb is gone, use --with-database=db, --with-database=tdb or --with-database=qdbm instead. 2003-09-05 * Update bogowordfreq to work with bogoreader. * Fatal flex errors are now caught and bogofilter exits gracefully after closing its database(s). 0.15.1 2003-09-03 * Limit size of unfolded header lines. 2003-09-02 * Check for xmlto during configuration. * Fix problem in empty line parsing rule. * Fix string termination problem for bulk mode paths. 2003-09-01 * Allow -I to be used with file or directory. * Revise flex rule for encoded text to reduce program size. 2003-08-31 * Revise flex grammar: - to reduce size of generated rules - to simplify handling of header tags and mime parts 2003-08-30 * Clean-up message header processing: - Don't tokenize message separator lines. - Merge whitespace separated encoded words. - Unfold header lines. 0.15.0 2003-08-30 * Fix defective printing in 'bogofilter -Q' output. 2003-08-28 * Revise mime processing to cure "fatal flex scanner internal error--end of buffer missed". * Restore parsing rule for ending a "loose" html comment. 2003-08-26 * Change mime boundary line to operate on raw input, i.e. before decoding it. * Add charset map for windows-1251 to KOI8-R (Cyrillic). 2003-08-24 * Fix some printf calls for 64-bit machines (%*s). * Fix compilation with TDB. * The -b and -B options now autodetect Maildir/s and iterate over each mail in them. When the named input is a file, it is assumed to be a single mail unless -s, -S, -n, -N or -M is given - in that case it's an mbox. * Revised message reader implementation so the way of specifing the input is independent from the input format (such as mbox vs. Maildir). * Bugfixed Maildir implementation to read cur/ and new/. * Implement support for MH directory (such as used by Sylpheed). 2003-08-23 * Implemented new message reading protocol for processing bulk mode, splitting mailboxes into messages, reading messages in maildirs, etc. 0.14.5.4 2003-08-30 * _Really_ fix defective printing in 'bogofilter -Q' output. 0.14.5.3 2003-08-29 * Fix parser errors that can cause: 1. Incorrect processing of html comments. 2. "fatal flex scanner internal error--end of buffer missed", which kills bogofilter. * Fix defective printing in 'bogofilter -Q' output. * Compiles with TDB again. 0.14.5.2 2003-08-20 - Stable Release * bogominitrain.pl - removed email 'cruft' and revised format of verbose output. 0.14.5.1 2003-08-19 * Fixed parameter type error in dbh_print_names() that causes segfault. * Enhanced verbose output of bogominitrain.pl * Documented '-T' option in man page. 2003-08-18 * Fixed parsing error that treated "^From " in encoded text as a message separator. 2003-08-17 * Revised format for '-T'. * Fixed defect in bogominitrain.pl's norepetition mode. 0.14.5 2003-08-15 * Updated bogominitrain.pl to version 1.3. 2003-08-14 * Corrected parsing error (in html code) that caused bogofilter to miss message separators. 2003-08-12 * Revised FAQ. * Added '-T' as terse mode (with fixed formatting). 2003-08-10 * Revised processing of From and empty lines so that parsing works correctly with both flex-2.5.4 and flex-2.5.31. 0.14.4 2003-08-10 * Updated FAQ. 2003-08-08 * Revised database API so that there are 3 distinct layers (program, datastore, and database) with a clean interface between them. * Correct exitcodes in bogoutil by using EX_ERROR. 2003-08-07 * Fixed token registration bug in 0.14.x versions. * Fixed seg fault caused by database lock contention. 0.14.3 2003-08-05 * Fixed critical locking bug introduced into bogofilter 0.14.0 with the combined-wordlist code: when working with separate wordlists, bogofilter would lock only the first one opened, rather than all. * Documentation updates. 2003-08-04 * %g formatting is now supported by bogofilter's formatting functions. * Merged trio 1.10 (http://ctrio.sourceforge.net/) to support compilation on ancient systems (Solaris 2.5) that do not have [v]snprintf functions. Trio is Copyright (C) 1998-2000 Bjorn Reese and Daniel Stenberg. * Various documentation updates, including the FAQ. 2003-08-03 * The test suite was adjusted for older grep variants (Solaris 2.5) that don't cope with long lines. * Print database version in print_version(). 2003-08-02 * Postfix integration instructions have been upgraded. * Debug output for wordlists and databases was enhanced. 0.14.2 2003-08-02 * Replaced use of memcpy() by memmove() in an input routine. The overlapping copy migh cause data corruption on some systems. * Fixed "make check" failures for bogoutil introduced with the "combined wordlist" feature in 0.14.0. There has been a buffer overflow. All users of bogofilter with combined wordlist prior to 0.14.2 are advised to upgrade. * Fixed bogus "t.valgrind" test FAILures. * Fixed uninitialized data in db_get_dbvalue(), for split word lists. * New file, contrib/vm-bogofilter.el, provides an interface between the VM mail reader and bogofilter." * Revised lexer_v3.l for compatibility with flex-2.5.31 * Break up long line in regression test input for Solaris 2.5 compatibility. 0.14.1.1 2003-08-01 * Fixed check for adding spam_subject_tag to Subject: line. * Updated French version of FAQ. 2003-07-31 * Correct problem with t.degen regression test. 0.14.1 2003-07-31 * Updated English version of FAQ. 2003-07-29 * Initial release of token degeneration code. 2003-07-25 * Revised lexer pattern to better recognize encoded tokens. 2003-07-24 * Implemented named exitcodes, with Unsure having its own value (2) and changing the value for error from 2 to 3. 0.14.0.1 2003-07-23 * Fix problem with encoded text. * Fix handling of absolute paths. * Fix defect in base64 decoding that can cause segfaults. * Bogoutil now complains before exiting when it can't open a file. * Updated bogominitrain.pl to work with combined wordlists. 0.14.0 2003-07-22 * Updated contrib/bogominitrain.pl prints more info and can save messages used in training. * Miscellaneous documentation updates. 2003-07-21 * Decode encoded text in header lines. 2003-07-19 * Bogofilter and bogoutil detect whether one or two wordlists are in BOGOFILTER_DIR and use the appropriate wordlist mode (combined or separate). * Bogofilter's -V output now includes algorithm and database info. 2003-07-18 * Default wordlist mode is single, combined wordlist. File wordlist.db contains all spam and ham tokens. 2003-07-17 * Added tdb (trivial database) support. 2003-07-16 * Initial release of code allowing bogofilter to use a single, combined BerkeleyDB database for storing both ham and spam tokens. The file is named wordlist.db. 0.13.7.3 2003-07-16 * Added contrib/bogominitrain.pl 2003-07-15 * Fix bug in "boundary" parser, which ignored boundaries with spaces. 2003-07-05 * Updated doc/integrating-with-qmail 2003-07-03 * Accept whitespace in html tags. * Checks for "Subject:" are now case insensitive. * Adds "Subject:" header if needed for including spam_subject_tag. (Thanks to Pavel Kankovsky for these patches.) 0.13.7.2 2003-07-02 - Stable Release * Fixed loop in yyinput() caused by unexpected EOF. 0.13.7.1 2003-06-26 * Update bogotune to version 0.3 * Added '-k size' option to bogofilter and bogoutil for setting BerkeleyDB's cache size. 2003-06-25 * For bogotune change processing of '-t' switch from pass 1 to pass 2 so that it supercedes the config file. * Man pages now use '\ ' when a non-breaking space is needed, instead of 0xA0. 2003-06-24 * '-Q' processing no longer requires that spamlist.db be present. 0.13.7 2003-06-20 * Replaced tuning/tuning.sh with tuning/bogotune (and related files). 0.13.6.3 2003-06-18 * Minor code rewrites to speed up processing messages, mboxes, and msg-count files. In particular, tuning/tuning.sh runs are approx 47% faster than before. * Fixed several errors in tuning/tuning.sh and reformatted "Top 10 Results" output. * Minor changes to bogoutil to support bogotune script. * Added newlines to correct usage messages. 0.13.6.2 2003-06-05 * Don't allow square brackets in tokens. Do allow dollar signs in tokens in msg-count files. * Bogolexer now ignores first 'From' token to match scoring behavior of bogofilter. 0.13.6.1 2003-06-05 * Updated file tuning/README and script tuning/tuning.sh. 0.13.6 2003-06-04 * Fix check for "^From " lines to work properly during base64 decoding. * End html comment processing when a message header is found. * Improve README for the tuning scripts and simplify them. 0.13.5 2003-06-03 * Allow terminal exclamation points on tokens. * Updated contrib/mime.get.rfc822 2003-06-02 * Fixed bogofilter's non-use of message counts in msg-count files. * Diagnose invalid values of robx. * Modified rstats_print_histogram() so it doesn't print 'nan's. * Modified t.frame to find version of grep on Solaris so t.bulkmode can run successfully. 0.13.4.1 2003-05-31 * Modified t.parsing test so it works with OSX's default file system. 0.13.4 2003-05-30 * Changed default value of ROBS from 0.001 to 0.01 * Fixed options '-M' (mailbox mode) and '-p' (passthrough mode) so they work properly together. * Minor cleanups in bogofilter.cf.example * Added db-3.2 and db-3.1 to list for AC_CHECK_DB in configure.ac 0.13.3 2003-05-28 * Minor code tweaks to quiet gcc-3.3 warnings. 2003-05-26 * Added doc/programmer/README.osx to distribution. * Corrected FAQ's procmail recipe for training with SpamAssassin. 2003-05-24 * Added -V (version) option to bogolexer. * Tweaked long line check used to prevent scanner buffer overflow. 0.13.2.1 2003-05-24 * In bulkmode, output filenames to stdout. * Further fixes for static-build system. 0.13.2 2003-05-24 * Autoconfiguration of BerkeleyDB library has been improved. * Build procedure for statically linked binaries has been improved. * Fixed defect in replace_nonascii_characters that was superseding ignore_case option. * Portability fix for efence usage in t.frame. * Added static-build to solve glibc version problem. 0.13.1 2003-05-23 * Modified "make rpm" to also build statically linked binaries. They're packaged in bogofilter-static-x.y.z-1.i586.rpm * Fixed bogofilter.spec.in to include files CHANGES-0.13 and RELEASE.NOTES-0.13 which had been left out. * tests/t.frame portability fix for non-Linux compatibility. 0.13.0 2003-05-21 * Added file RELEASE.NOTES-0.13. Read it! * Changed parsing defaults to: -PI ignore_case (default is disabled) -Ph header_line_markup (default is enabled) -Pt tokenize_html_tags (default is enabled) * Recognize a line of whitespace as ending the message header. * contrib/randomtrain and contrib/scramble can now process both mbox and maildir formats. * Added perl script contrib/mime.get.rfc822 to extract forwarded messages from with a message. * Added basic support for emacs RMAIL mailboxes. * Removed incomplete RMAIL/Babyl-5 support. * Registration code modified to count unique tokens for each message and display the total of the counts. * Added 'bogo-what?' to FAQ. 0.12.3 2003-05-10 * Modified bulk mode code to allow registering maildirs. * Added options to return tokens from inside HTML tags. Switch '-Ht' and option "tokenize_html_tags" turn it on. * Bogofilter's '-e' switch can now be used without '-p'. * Added doc/integrating-with-postfix. * Added bogofilter-faq-fr.html, a French translation of the FAQ. * Revise description of verbose output in FAQ. * Update man page documentation of bogofilter's switches. * Added basic memory accounting and debug capability. * Fixed memory leak in rstats.c * Fixed defect in handling of folded spam header lines. * Modified parsing so that yyredo() and yy_use_redo_text() are no longer needed. 0.12.2 2003-04-30 * Corrected bulkmode problem processing messages without "^From " lines. * Corrected alignment of wordprop_t which caused bus error on risc. * Added directory to 'Error creating directory' message. 0.12.1 2003-04-25 * Corrected bad BOGOFILTER_DIR value in t.bulkmode * Subdirectories contrib and tuning now install from rpm to /usr/share/bogofilter. 0.12.0 2003-04-24 * Corrected some errors in rpm specfile. 2003-04-23 * Added 'tuning' directory with scripts for tuning bogofilter. (cf. bogofilter-tuning.HOWTO) 2003-04-21 * Added '-M' to allow classification of multiple messages in mbox formatted files. * New option '-Q' (query/display config) replaces '-qv'. * Grouped options into logical groups for help message and man page. Revised option descriptions. 2003-04-19 * Added bogofilter-tuning.HOWTO as replacement for README.Robinson 2003-04-18 * Added classification support for msg-count formatted files. * Add bogolex.sh for creating msg-count formatted email file. 2003-04-17 * Added bulk mode procesing for Maildirs. '-b' reads filenames from stdin. '-B' gets filenames from the command line. 2003-04-16 * Miscellaneous refactoring in main.c 0.11.2 - stable version 2003-04-13 * Added 'terse' option to bogofilter.cf for selecting format of X-Bogosity line. 2003-04-11 * Use frexp() to retain maximum precision of floating point results. 0.11.1.9 2003-04-10 * Reformat histogram output (from "-vv") to fit in 80 columns. * Added sample configuration for maildrop. 2003-04-09 * Added protections against negative token counts to bogoutil.c and database_db.c * Additional portability changes made to the regression tests. * Enhanced '-m' option allows specifying robs value. 0.11.1.8 2003-04-07 * Include 'strict_check' in '-qv' output. * Correct outdated acinclude.m4, as it causes the configure script to be invalid. * Revised UPGRADE document. * Added contrib/bogotrain.sh 0.11.1.7 2003-04-07 * Change bogoutil's '-p' option to require a database. * Fix OS X segfault caused by using DB handle after closing database. 2003-04-05 * Improve bogoutil's reporting of a bad directory or filename. * Simplify configure check for BerkeleyDB. * Extend configure's compiler checks for AIX. 0.11.1.6 2003-04-01 * Changed default value of 'strict_check' to 'no' (disabled). 2003-03-30 * Added config file option 'strict_check' for processing html comments. Enabled means to use "" to delimit comments. Disabled uses "". 0.11.1.5 2003-03-28 * Bogofilter now frees _all_ memory that it allocates. * FAQ reorganized and info added on asian spam, the format of verbose output, and using SpamAssassin to train bogofilter. * Fixed processing of '-o' option. 0.11.1.4 2003-03-25 * Cleaned up help messages and added version info. * Expanded bogofilter-faq.html * Fixed precedence for directory specifications. * Fixed processing of folded X-Bogosity line. * Fixed processing of spam_subject_tag. 0.11.1.3 2003-03-10 - stable release * Expanded regression tests. * Cleaned up fprintf() arguments. * Cleaned up message and mime header checks. * Additional improvements to maintenance code. 0.11.1.2 2003-03-06 * Fixed bogoutil's broken maintenance mode. * Update bogofilter documentation and FAQ. * Explicitly check linking against libdb early to avoid unspecific error messages as "cannot determine size of unsigned short". * Retry locking without mmap() on systems that return the old-fashioned EACCES rather than EAGAIN for locking failures such as AIX 4.3.3. * Fix potential division by zero in histogram generator, it caused program abort after not handling floating point exceptions on some architectures such as Alpha. The division by zero is now avoided. 0.11.1.1 2003-03-05 * Fixed flaw that caused user config file to be ignored. * Fixed broken '-u' (update) code. * Updated documentation of bogolexer and bogoutil. 0.11.1 2003-03-04 * Using standard html comment delimiters when ignoring comments. * Fixed charset initialization flaw. 0.11.0 2003-03-03 * The Robinson-Fisher algorithm is now the default algorithm. * The configuration file parser is stricter and more correct. * Separated message registration options from unregistration options. '-S' and '-N' have been changed and now just do unregistration. To move a message from one wordlist to the other, use '-S -n' or '-N -s' (as appropriate) * Bogofilter's -p (passthrough) mode will no longer read the entire mail into memory if the standard input is a seekable regular file. * Bogofilter's '-l' option was changed and no longer allows an argument. Use the new '-L yourtag' option to provide a tag for log messages. * Database access efficiency changes. * Improvements in html comment handling code. * Internal cleanup of storage used in parsing messages and working with databases. * Manual pages now contain the proper path to bogofilter.cf. 0.10.3.1 2003-02-17 * Updated bogofilter and bogoutil man pages. * Give command line options preference over config file options. 0.10.3 2003-02-14 * Database access efficiency changes. * Database properly closed at end of maintenance pass. * Improvements in html comment handling code. * Support option '-?' 0.10.2 2003-02-01 * Stable release of 0.10.1.5 0.10.1.5 2003-02-01 0.10.1.4 2003-01-30 0.10.1.3 2003-01-29 0.10.1.2 2003-01-27 0.10.1.1 2003-01-25 0.10.1 2003-01-22 * A variety of robustness and portability changes, code and file cleanups and documentation updates. * Multiple fixes for mime and html processing. * Additional support and fixes for the various spam scoring algorithms. ** See file CHANGES-0.10 for details of the above items. 0.10.0 2003-01-19 * Added mime processing capability, with decoding of base64, quoted-printable and uuencoded sections. Ignores attachments when computing spamicity. * Added wordlist maintenance capability to bogoutil. Can ignore tokens based on count, age, or length. Can replace non-ASCII chars with question marks. * Added dates to wordlist tokens. Option "datestamp_tokens=true|false" can be used to enable/disable them. * Moved most documentation files to doc directory. * Added sample procmail file, contrib/procmailrc.example * Spamicity score now computable from multiple word list pairs, i.e. all spam and ham word lists in directories named on command line or in config file (via "wordlist=" or "bogofilter_dir=" lines). * Lexer is now case insensitive * Increase MAXTOKENLEN from 20 to 30, allowing more and longer tokens to be processed. * New options for setting of default charset and replacing of non-ASCII characters. New character set handling routines to provide charset specific token parsing. * New error handling routine will output error messages to stderr and, if '-l' (logging) is enabled, to syslog. * New message formatting capability allows formats to be put in config file for X-Bogosity line and logging messages. Message content can include status, spamicity, version, etc. * Long-standing locking bugs that caused corruption in the database have been resolved. * Work around ash-0.2 and bash-1 bugs, needed for make check. * Cater for malloc/calloc implementations that return NULL when 0 bytes of memory are requested, some AIX versions e. g., that would previously falsely claim an "out of memory" condition. (also available as patch for 0.9.1.2) * Reorder gcc __attribute__ lines for gcc-2.7 compatibility. (also available as patch for 0.9.1.2) 0.9.1.2 2002-12-05 * A defect in the collect_words routines (in 0.9.1) caused incorrect generation of "must get only one message to calculate spamicity!" messages. This has been fixed. * A defect in the contrib/bogopass script caused the unbase64-edited version of the mail to be printed rather than the original with just the header added. This has been fixed. * Documentation has been revised and updated. * Robinson-Fisher method now produces a tristate status, i.e. spam/ham/unsure, if ham_cutoff is non-zero. ham_cutoff defaults to 0.1 and can be set via config file. * Script contrib/bogopass has revised error and environment checking. 0.9.1 2002-11-30 * New script contrib/bogopass allows processing of base64 attachments. This is a temporary solution until base64 code can be built into bogofilter. * New file README.Robinson describes the tunable parameters for the Robinson algorithm and what to do for best performance. * Changed the default behavior to use the Robinson algorithm. * Corrected incorrect sort order when printing statistics. * Added support for Fisher's method of combining probabilities, as optimized for this purpose by Rob W. W. Hooft, to the "Robinson" algorithm. * The new file METHODS describes the Graham, Robinson, and Fisher methods that bogofilter supports for computing spamicity. * New file README.dcdflib gives some info on the dcdflib free library of routines for cumulative distribution functions. * A new '-f' option tells bogofilter to use Fisher's method. * A new '-c' option in bogofilter allows specification of the configuration file to read. * A new '-C' option tells bogofilter not to read any config file. * The syslog facility in '-l' mode has changed from "daemon" to "mail", so your logs may now be in /var/log/maillog or /var/log/mail rather than /var/log/messages. Check your /etc/syslog.conf. * The testing framework now works on Solaris. Internal Changes: * Fixed several portability problems uncovered by the new regression tests. * Added three more regression tests designed to confirm that bogofilter's results are matching saved reference results. * Implemented an object oriented API for using computational methods. * Split the main module into a registration module and three algorithm modules - for the fisher, graham and robinson methods. * Registering big mbox files is much faster now, at the expense of some memory. 0.8.0 2002-11-10 * The lexer code now detects read errors (and exits with code 2 if it finds one.) * Fixed passthrough mode in bogofilter: it no longer strips the spam-header from a mail body. * Fixed portability to some systems, notably, Solaris and HP-UX, added README. for some systems to describe build issues. * Fixed "rpl_malloc" link failures. * Fixed bogofilter 0.7.6 passthrough regression on some systems: The X-Bogofilter header would be added to the body and a bogus blank line would be added. * Bogofilter now supports a configuration file named /etc/bogofilter.cf and/or ~/.bogofilter.cf. * Bogofilter's use of '-v' for printing spamicity statistics has been organized with increasing levels of details as additional '-v's are added. * When using the Robinson algorithm, bogofilter can print a simple histogram showing word probability distribution. * Bogoutil supports a new '-w' switch for displaying tokens from the word list databases. * Bogolexer added to distribution. Provides easy access to parsing a file to examine the tokens. * Bogolexer has a new '-p' (passthrough) for printing tokens and bogoutil has a new '-p' (probability) for printing the probabilities of one or more tokens. They can be connected via pipe to display the probabilities of all words in a message. * DB 4.1 support has been fixed. * Documentation updates. 0.7.6 2002-10-27 * Added README.hp-ux for those using HP-UX. * Added support for additional architectures - ia64, arm, powerpc, and s390. * Bogofilter -p mode now preserves CR and NUL characters. * Bogofilter -p mode now detects if the computer runs out of memory. * Bogofilter supports a new "-l" switch to write run-time log information to syslog. * Bogofilter supports a new algorithm to calculate the "spamicity", the "Robinson" algorithm. It is enabled with the new "-r" switch. The old behavior is called the "Graham" algorithm and can be enforced with the new "-g" switch. The default behavior is to use the "Graham" algorithm. * Bogofilter now has an "-R FILE" option (that implies -r) to print an R data frame to FILE. * Bogofilter and bogoutil now have a "-x CLASSES" option to turn on debugging. * Bogoupgrade.pl has been renamed to bogoupgrade. * There is now a man page for bogoupgrade. * BASE64 treatment has been fixed. It ignored whole lines if they consisted of a single token. Now a token is only considered base64 and ignored if it's >= 32 characters or ends in one or two padding "=" signs. * MIME boundary lines are now emitted as tokens. Some of them are typical of certain spam software, so they might turn out to be useful. * All control characters are now considered token delimiters. * Bogofilter now aborts if it cannot figure where to look for its database directory. * The software no longer crashes on machines that do not allow for unaligned memory access (m68k; many RISC, e. g. SPARC). * DB 4.1 is now supported. * Documentation updates. 0.7.5 Sun Oct 20 17:34:35 PDT 2002 * The header in bogofilter -p mode now defaults to X-Bogosity, but can be changed by using "./configure --enable-spam-header=name" at compile time. * The option names -h/-H are back to -n/-N like they were in version 0.6, and -h now means "help". * A utility has been added to help upgrade wordlists from older versions of bogofilter to the current format. See the UPGRADE file for more information. * Support has been added for the environment variable BOGOFILTER_DIR to control where bogofilter looks for it's wordlists. * Now bogofilter no longer depends on the Judy package. We now use a high performance hashing algorithm for message evaluation. The Judy package is no longer required to compile or run bogofilter. * Support for the -e flag, which will cause bogofilter to exit with a value of 0 regardless of the spamicity of the message. This is useful when using -p mode. * Support for -u flag. This allows message evaluation and training to happen in the same invocation of bogofilter. * Extended TOKEN patterns to improve support for European languages. * Improved wordlist locking to prevent data corruption. * Added procmail recipes for example usage in the man page. 0.7.4 Tue Sep 17 02:29:48 EDT 2002 * Added infrastructure to support multiple wordlists * Fixed classification bug * Fixed errors in documentation * Improved portability of locking code * Fixed 'last line occasionally emitted twice' bug * Cleaned up underflow checking for word counts in bogofilter.c * Code readability improvements * Split main() function in bogofilter.c into smaller pieces * Message processing performance improvements 0.7.3 Thu Sep 12 13:28:37 PDT 2002 Adrian Otto: * Added portable file locking support for files and databases David Relson: * Bug fix for negative counts in word registration * Bug fix for SEGV in $HOME path code * Bug fix for trailing slash in -d option 0.7.2: Wed Sep 11 15:28:00 PDT 2002 Adrian Otto: * Introduced GNU configure for portability code 0.7.1: Tue Sep 10 00:59:00 PDT 2002 Adrian Otto: * Skip existing X-Spam-Header * Performance improvement for -p mode Paul Tomblin: * Bug fix in getopt argument 0.7: Sat Sep 7 14:18:33 EDT 2002 Eric S. Raymond: * Check your scripts! Option names have changed. * Name changes: goodlist -> hamlist, badlist-> spamlist. This is a step towards supporting more categories. * Autodaemon is gone. Instead, the new implementation uses DBM. Optimization with mmap will be in a future release. * Speed-tuning of the bogofilter function. * We're back to not ignoring HTML comments. 0.6: Fri Aug 30 00:25:49 EDT 2002 * Fixed a fluky bug in the socket-transmission logic * Fixed an edge case where a single message with a From line was getting counted twice. * Unknown-word probability bumped from 0.2 to 0.4, tracking a change by Paul Graham. * Documented -d option. 0.5: Thu Aug 29 13:38:12 EDT 2002 * Passthrough option can be used to add an X-Spam-Status header. * There is now a per-message word frequency cap, so spammers can't do an equivalent of Google fodder. * HTML comments are now ignored. * HTML 4.0 keywords and attributes are now ignored. * Improved extrema calculation. * Mutt patch withdrawn -- have a better version of mutt macros instead. * -S and -N options from matt@lickey.com (Matt Armstrong). * Client-server partitioning with a persistent server, drastically reducing startup cost after the first run. * Minor bug fix by Eric Seppanen. 0.4: Sat Aug 24 09:07:45 EDT 2002 * regenerated bogofilter mutt patch. * wordlist files are now automatically created in -s and -n modes. * Reversed the exit values, following a suggestion by Michael Elkins about how to make bogofilter fail gracefully. * -Wall cleanup and uninitialized-variable fix from Eric Seppanen. * fcntl(2) file locking to head off a race condition in write_list. * Added the long-sought procmail recipe. 0.3: Fri 23 Aug 03:30:49 EDT 2002 * Specfile/Makefile improvements from Graham Reed. * Case blindness fix from Eric Seppanen. * Deallocation fix from Mike Mayfield. * Wordlist file format changed. 0.2: Tue Aug 20 06:49:42 EDT 2002 * Added mutt-1.4 interface patch * Note: Location of the base directory has changed. 0.1: Mon 19 Aug 2002 03:07:31 * Initial release. $Id: NEWS.0 6525 2006-07-04 03:20:12Z relson $ vim:tw=79 com=bf\:* ts=8 sts=8 sw=8 ai: LocalWords: bogofilter bogolexer bogoutil Spamicity spamicity LocalWords: procmail maildrop bogofilter-1.2.4/NEWS0000644000175000017500000004650112164443123012543 0ustar sezsez ================= BOGOFILTER NEWS ================= !!!!!!!! READ THE RELEASE.NOTES !!!!!!!! This file is in Unicode charset, with UTF-8 encoding. Sections headed '[Incompat ]' and '[Major ]' are particularly important. They describe changes that are incompatible with earlier releases or are significantly different. !!!!!!!! READ THE RELEASE.NOTES !!!!!!!! ------------------------------------------------------------------------------- 1.2.4 2013-07-01 (released) 2013-06-28 * Fix three crashes in command line and environment variable parsers that caused NULL pointer dereferences with long option variants of bogofilter --syslog-tag, or bogoutil --timestamp-date, or when bogotune -M cannot derive the bogofilter directory. Reported by Alexandre Rebert, found with Mayhem tool. * Add getopt_long_chk(), a getopt_long variant that checks if the overlapping short and long options agree on whether their argument is not required, mandatory, or optional. If they disagree, the program aborts. * Fix a crash in command line parser that causes a NULL pointer dereference when --db-cachesize is used without argument. Found with getopt_long_chk(). 2013-01-20 * Change lexer API/ABI a bit so as to work with flex 2.5.36 generated lexers (for instance, on Fedora 18 "Spherical Cow") that flip the type of yyleng from int to size_t. We use a signed long internally. 2012-12-30 * The bogofilter project was updated to the new SourceForge.net platform. This has caused the URLs to change. Use one of these commands for a read-only checkout: svn checkout svn://svn.code.sf.net/p/bogofilter/code/trunk bogofilter svn checkout http://svn.code.sf.net/p/bogofilter/code/trunk bogofilter And developers would use, replacing joe by their sf.net login: svn checkout --username=joe svn+ssh://m-a@svn.code.sf.net/p/bogofilter/code/trunk bogofilter 2012-12-03 * Add bogofilter-SA-2012-01 (CVE-2012-5468). * Fix XML form of Bulgarian FAQ so that it validates; and validate XHTML at build time. * Mark Berkeley DB 5.2.42 and 5.3.21 supported. 1.2.3 2012-12-02 (released) 2012-10-24 * Update configure.ac to avoid autoconf 2.68 warnings, by (a) quoting the first AC_RUN_IFELSE argument, an AC_LANG_PROGRAM(), with [ ], and (b) providing an explicit "true" assumption for Berkeley DB capabilities to avoid cross-compilation warnings. 2012-10-22 * Security bugfix for CVE-2012-5468 (bogofilter-SA-2012-01): Fix a heap corruption in base64 decoder on invalid input. Analysis and patch by Julius Plenz . 2011-01-02 * Added bogofilter-faq-bg.html, a Bulgarian translation of the FAQ. (thanks to Albert Ward) 2010-10-29 * Mark "Berkeley DB 5.1.19: (August 27, 2010)" supported. 1.2.2 2010-07-08 (released) 2010-07-05 * Use a better PRNG for random sleeps. That is arc4random() where available, and drand48() elsewhere. * Assorted fixes for issues found with clang analyzer: + Fix a potential NULL deference + Fix a potential division by zero + Remove dead assignments and increments * Update Doxyfile and source contrib/bogogrep.c for docs, too. 2010-07-03 * Security bugfix, CVE-2010-2494: Fix a heap corruption in base64 decoder on invalid input. Analysis and patch by Julius Plenz . Please see doc/bogofilter-SA-2010-01 for details. 2010-04-07 * Updated sendmail milter contrib/bogofilter-milter.pl to v1.?????? (thanks to Jonathan Kamens) 2010-04-01 * Bump supported/minimum SQLite3 versions and warning threshold. See doc/README.sqlite for details. * Mark BerkeleyDB 4.8.26 and 5.0.21 supported. Note that Berkeley DB 5.0's SQLite3 compatibility API is NOT supported, it causes shifts in scores and write failures under contention. Bogofilter can use Berkeley DB 5.0's native interface, and using that is more efficient than the added SQL shim layer. 2010-03-06 * Make t.maint more robust; ignore .ENCODING token. To fix test failures on, for instance, FreeBSD with unicode enabled. 2010-02-15 * Fix several compiler warnings "array subscript has type 'char'", by casting the arguments to unsigned char. A security audit was conducted and showed that all affected functions either received the relevant input from the user running bogofilter, or the input had already been pre-validated by the token lexer. 2010-02-14 * Split error messages for ENOENT and EINVAL into new function. * Avoid divison by zero in robx computation by checking if there are at least one ham message and one spam message registered. 2009-08-13 * contrib/spamitarium.pl updated to version 0.4.0 (thanks to Tom Anderson) 2009-08-05 * Updated and integrated Ted Phelps's "Patch to prevent .ENCODING from being discarded by bogoutil -m" (SourceForge Patch #1743984). Thanks to Ted for debugging the issue and providing the patch (which was for bogofilter v1.1.5). 2009-09-15 * Promoted to "stable" 1.2.1 2009-08-01 (released) 2009-08-01 * Update configure to use "host" rather than "target", to match the newer autotools cross-build semantics. Untested. Developers changing the build system and users who build from SVN will now need automake 1.9 and autoconf 2.60. 2009-07-31 * Fix Christian Frommeyer's MIME decoding bug, Ubuntu/Launchpad Bug #320829. As a side effect, also fixes misattribution of MIME bodies as MIME headers with mime: tag. Original bug report: https://bugs.launchpad.net/ubuntu/+source/bogofilter/+bug/320829 Before this fix, bogofilter did not properly MIME-decode the first line in a body. This was especially bad with Christian's samples where the whole body was only one long base64 line. 2009-05-28 * Removed two scripts that are auto-built. * Added test case for Stephen Davies' Q-P EOL problem (see below). 2009-05-25 * Fixed EOL problem in quoted_printable text. Problem reported by Stephen Davies and identified by Pavel Kankovsky. 2009-03-28 * Promoted to "stable" 1.2.0 2009-02-21 (released) 2009-03-28 (declared stable) 2009-02-20 * Flex-2.5.35 has fix for memory allocation problem in 2.5.4, 2.5.31, and 2.5.33, making bogofilter's flex patch obsolete. 2009-02-12 * Bogofilter now uses listsort in place of qsort. 2009-01-31 * Added token-count=n, token-count-min=n, and token-count-max=n options. * Minor code cleanups. 2009-01-21 * spamitarium.pl updated to version 0.3.0 (thanks to Tom Anderson) 2009-01-11 * For compatibility with Sun's Sun Studio 12 compiler, provide a name for the anonymous union in typedef word_t. Patch provided by Jack Bailey. 2008-10-20 * update bf_compact documentation by removing explicit Berkeley DB references, as it has been fixed to work with other database drivers in March 2008. 2008-10-15 * bf_compact, bf_copy and bf_tar now support transformed program names (fixes Debian Bug#501947). * Update sqlite3 adaptor to take advantage of sqlite3_prepare_v2() API function that appeared in SQLite 3.3.9. The new _v2 interface allows for more specific error messages when executing SQL statements. Also enable extended result codes for more precise error reporting. 2008-07-21 * Update doc/integrating-with-postfix: the script now suggests sendmail -G -i (where -G will be ignored by Postfix before 2.3) to tell Postfix it's a gateway submission, not an original injection; the filter pipe(8) magic for master.cf now suggests flags=Rq (was flags=R), as per Postfix's FILTER_README. 2008-07-09 * Drop support for systems that reverse setvbuf arguments. The last systems to do that are reported to be shipped in 1987 by the autoconf manual, so ditch them. 1.1.7 2008-05-04 (released) 2008-05-18 (declared stable) 2008-04-30 * Updated sendmail milter contrib/bogofilter-milter.pl to v1.45 (thanks to Jonathan Kamens) 2008-04-28 * Added maildir training info to English and French FAQs. (thanks to Karl Schmidt and to Mouss) 2008-04-26 * Fix uninitialized variable in lexer.c when unicode is disabled. Patch provided by Roman Trunov. 2008-04-20 * In process_arg functions use the val parameter rather than optarg. Patch provided by Roman Trunov. 2008-04-18 * Function process_arg now has the same prototype for bogofilter, bogolexer, bogoutil, and bogotune. The proper version is called by function read_config_file for all programs. Problem reported by Roman Trunov. 2008-04-17 * Update Doxyfile for doxygen v1.5.5 2008-04-16 * Fixed syntax errors in t.valgrind test 2008-03-21 * bf_compact now supports compacting databases that use QDBM, Tokyo Cabinet or SQLite3 and is covered by the test suite. 2008-03-19 * bf_compact now verifies databases before dumping them, to avoid getting into an unterminated loop and wasting all diskspace. * Bogoupgrade now verifies databases before dumping them, to avoid getting into an unterminated loop and burning all memory or disk space when the database is corrupt. This should fix Debian Bug#226643 and Debian Bug#226646. * Bogoupgrade now uses Pod::Usage to print usage/help, prints error messages that are a bit more concise and validates arguments a bit stricter. 2008-02-08 * Bump required sqlite version to 3.5.4, earlier versions could sometimes corrupt the database. Update install-staticdblibs.sh. Bogofilter will complain when used with older versions. 2008-01-05 * bf_compact problem fixed. Reported by Thomas Novin. 1.1.6 2007-11-25 (released) * Transaction support added for TokyoCabinet datastore. (thanks to Pierre Habouzit) * Bump required sqlite version to 3.4.2 and fix related compiler warnings. Bogofilter will complain when used with older versions. 2007-11-22 * Support for TokyoCabinet datastore added. (thanks to Pierre Habouzit) 2007-08-14 * doc/README.db was updated to BerkeleyDB 4.6 * doc/README.db: section 3.5 was added, with information on how to resolve "Logging region out of memory; you may need to increase its size", section 4.2 now documents set_lg_regionmax. 2007-07-23 * The upstream repository was migrated to SVN. In order to check the code out, use this command (one line): (OBSOLETE) svn co https://bogofilter.svn.sourceforge.net/svnroot/bogofilter/trunk/bogofilter/ bogofilter (see entry for 2012-12-30 for updated URL) 2007-07-22 * The install-staticdblibs.sh script was relicensed under GNU GPL v3, adjusted to download Berkeley DB 4.2 from oracle.com, adds patch #5, and updated to build SQLite 3.4.1. In order to for a rebuild of the updated library, do: rm -rf /opt/db-4.2-lean /opt/sqlite-3-lean and re-run the script. * The recommended minimum sqlite3 version is now 3.4.0, bogofilter will warn if used with older versions. Bugs that could cause database corruption in rare circumstances have been fixed in sqlite3. See doc/README.sqlite for details. * Updated sendmail milter contrib/bogofilter-milter.pl to v1.27 (thanks to Jonathan Kamens) 2007-02-25 * Add '--spam-header-place={header}' to specify header line before which the X-Bogosity line is placed. 2007-02-14 * Support --db-verify for sqlite3. * Fix defect where the database verification method would not be called for traditional Berkeley DB databases. Reported by Eric Wood. 2007-01-28 * Fix test suite for situations where there are blanks in the test or working directories' names. * Repair passthrough defect on systems whose standard system library makes a distinction between text and binary mode in stdio stuff. 1.1.5 2007-01-14 (released) 2007-01-25 (declared stable) * Fixed Makefile dependency problem. (reported by Andras Salamon) This took several iterations to get right. 2007-01-11 * Fixed block-on-subnets problem. (thanks to Jack Bailey) 2007-01-10 * Added block-on-subnets regression test. 1.1.4 2007-01-01 (released) * Update copyright notices. 2006-12-08 * Add GSL dependency to bogofilter target to support parallel makes. (reported by Martin von Gagern) 2006-12-05 * Fixed problem in flex-2.5.4 patch. (reported by Boris 'pi' Piwinger) 1.1.3 2006-12-03 (released) 2006-12-20 (declared stable) * Fixed typo in configure.ac. (reported by Boris 'pi' Piwinger and Torsten Veller) 1.1.2 2006-12-02 (released) 2006-12-01 * Revise install-staticlibs.sh's links for retrieving database tarball and patches. * Revise make rules for generating statically linked RPM. 2006-11-29 * Provide separate flex patches for 2.5.4 and 2.5.3x 2006-11-26 * Updated file comment for lexer_v3.l and removed unneeded rules T1, T12, SHORT_TOKEN, and TOKEN_12. * Miscellaneous minor cleanups of lexer_v3.l classes and rules. * Patch flex skeleton code problem which can cause a seg-fault. (reported by Michael Gerdau) 2006-11-21 * Fix processing of "--unicode=no" option. 2006-11-18 * Fix prefixes for ip address and url tokens. Restore colon that was dropped in token.c edit for bogofilter-1.1.0. 2006-11-04 * Fixed problem parsing message ids, which can cause a seg-fault on an x86_64. (reported by Torsten Veller) 2006-10-03 * Added '--ham-true' option for bogofilter (to match docs) 2006-08-26 * FAQ's updated to point to current sylpheed-claws wiki (thanks to Paul Mangan) 1.1.1 2006-08-23 (released) 2006-09-01 (declared stable) 2006-08-22 * Added bogofilter-faq-it.html, an Italian translation of the FAQ (thanks to Marco Bozzolan). 2006-08-10 * Fixed minor header/body multi-word token defect. 1.1.0 2006-08-09 (released) * Revised FAQ's mailbox conversion example. 2006-07-26 * 1.0.3 Promoted to "Stable" status 2006-07-24 * Forward port GNU make compatibility fix for doc/Makefile* from 1.0 branch. 2006-07-08 * Add large file support for 32-bit systems. (_FILE_OFFSET_BITS/_LARGE_FILE). * Fix lexer_v3.l format string mismatch that broke debugging code on 64-bit systems. 2006-07-04 * Add multi-word token support to bogoutil & bogotune. 2006-07-03 * Clean up token prefixing. * Clean up queue-id processing. * Add max-multi-token-len checks. * Revised function names. get_token() uses parse_new_token(), add_token_to_array(), build_token_from_array(), and build_prefixed_token(). 2006-07-02 * Add min-token-len check (with exemption for 2 character money amounts which bogofilter has long accepted). * Add "short token" pattern to lexer 2006-07-01 * Refactor get_token. Function get_single_token is the original get_token function. Function get_multi_token calls get_single_token when another token must be parsed, else it constructs multi-part tokens using w_token_array (an array of word_t structs). 2006-06-20 * Add options for min/max token length, multi-token count, and max multi-token length. * Modify get_token() to return multi-word tokens. 1.0.3 2006-07-10 (released) 2006-07-26 (declared stable) * Released 1.0.3 to provide the bogotune bugfixes to a wider audience. 2006-07-09 * Work around GNU make 3.81 incompatibility in doc/Makefile* (it does not work properly with "}\" at the line ends, but wants "} \" instead). 2006-06-02 * "make rpm" changes: - document use with gpg-agent (see Makefile.am) - build static RPMs (these won't fail) before shared RPMs 2006-05-29 * #include cleanups in common.h, system.h and C files. 2006-04-28 * Updated copyright dates. 2006-04-13 * Included additional config file options in bogofilter's --help message. 2006-03-27 * Corrected option parsing in bogotune to support -n ham1 ham2 -s spam1 spam2 as suggested by bogotune -h; broken since 0.93.2. 2006-03-26 * Corrected problem with bogotune's -D option (thanks to Jason Smith). * Corrected man page description of bogotune's -n and -s options. 2006-03-17 * Fixed bf_compact's test for transactional environment. 2006-03-12 * 1.0.2 Promoted to "Stable" status 1.0.2 2006-03-03 (released) 2006-02-19 * Added vm-bogofilter.el for using bogofilter with VM, an Emacs mail tool (thanks to Björn Knutsson). * Added FAQ question "How do I use bogofilter with VM (an Emacs mail tool)?" (thanks to Pimpon). 2006-02-14 * SleepyCat has been acquired by Oracle, who are now providing Berkeley DB. Since most of the references are to actual strings in the programs or addresses that remain unchanged, this will only gradually show in the bogofilter sources and documentation. 2006-02-06 * Flush output after writing spam header line and/or message body. * When database is near to maximum allowed size, allow reading it and disallow writing to it. 2006-01-30 * Fix formatting of Rtable output when in the message header, this keeps verbose passthrough modes RFC-822/2822 compliant. 2006-01-29 * The configure script, when checking Berkeley DB capabilities, now checks for logging and transactional subsystems rather than the locking subsystem that was abandoned before 1.0.0. This appears a suitable workaround for configure lockups on OpenBSD 3.7 macppc with db 4.2 or 4.3. 2006-01-28 * Only print Berkeley DB file size message once per run. 2006-01-21 * 1.0.1 Promoted to "Stable" status 2006-01-02 * Fixed --input-file and --output-file command line options. 2006-01-01 * Added CVE-2005 identifiers for defects described in doc/bogofilter-SA-2005-01 1.0.1 2006-01-01 (released) * New names for binary rpms: bogofilter-db42 - requires shared library for DB-4.2.52 bogofilter-db42-static - statically linked with DB-4.2.52 bogofilter-sqlite3 - requires shared library for SQLite3-3.2.8 bogofilter-sqlite3-static - statically linked with SQLite3-3.2.8 2005-12-30 * The configure help texts have been revised, the IEEE checks for trio have been simplified (they are no longer nested) and configure.ac has been updated to quiet autoconf -Wobsolete warnings. The README file now reflects the new requirements. 2005-12-29 * For maintainers: Add install-staticdblibs.sh, a script to fetch and build static & lean BerkeleyDB 4.2.52.4 and SQLite 3.2.8 libraries. Modify some parts of the RPM building so that the binary RPMs are built without external dependencies beyond glibc 2.2. This may render "make rpm" unusable on non-Linux platforms, but you should still be able to "rpmbuild -tb" from the source .tar.gz file. 2005-12-27 * Add '-O' option to direct bogoutil output to a file. * Fix building of binary rpms with SQLite support. * Include SQLite binary rpm as standard part of "make rpm" 2005-12-26 * Split NEWS file into files NEWS and NEWS.0 for new (version 1.0 and after) and old (version 0.x.y) info 2005-12-25 * Capitalize variables in bogofilter.spec.in to please RH9's RPM 4.2 implementation. 2005-12-18 * Fix bad return code in db_loop() in datastore_sqlite.c (reported by Sami Farin). 2005-12-17 * XML documentation cleanups (thanks to Nicholas Kaiser). 2005-12-06 * bogofilter.cf.example was updated to reflect the proper default of db_log_autoremove=yes. It previously claimed the default were "off". 1.0.0 2005-11-30 (released) Release history prior to 1.0.0 is in file NEWS.0 $Id: NEWS 6993 2013-06-28 21:54:23Z m-a $ vim:tw=79 com=bf\:* ts=8 sts=8 sw=8 ai: LocalWords: bogofilter bogolexer bogoutil Spamicity spamicity LocalWords: procmail maildrop bogofilter-1.2.4/contrib/0000755000175000017500000000000012164443242013500 5ustar sezsezbogofilter-1.2.4/contrib/bogominitrain.pl0000755000175000017500000001734412163572305016714 0ustar sezsez#! /usr/bin/perl # Script to train bogofilter from mboxes # by Boris 'pi' Piwinger <3.14@piology.org> # with many useful additions by David Relson # Program locations my $bogofilter="bogofilter"; my $bogoutil="bogoutil"; my $bf_compact="bf_compact"; my $catcommand="bzcat -f"; # Not correct number of parameters my $commandlineoptions=($ARGV[0]=~/^-(?=[^c]*c?[^c]*$)(?=[^f]*f?[^f]*$)(?=[^n]*n?[^n]*$)(?=[^s]*s?[^s]*$)[cfns]*v{0,2}[cfns]*$/); unless (scalar(@ARGV)-$commandlineoptions==3 || scalar(@ARGV)-$commandlineoptions==4) { print < \\ [bogofilter-options] database-directory is the directory containing your wordlist. It will be created as needed. ham-mboxes and spam-mboxes are the mboxes containing the mails; they will be shell-expanded. bogofilter-options are given to bogofilter literally. Uses a "train on error" process to build minimal wordlists that can correctly score all messages. It may be a good idea to run this script command several times. Use the '-f' option to run the script until no scoring errors occur (training to exhaustion). The '-n' option will prevent messages from being added more than once; this may leave errors at the end. To improve bogofilter's accuracy, use bogofilter's -o option to create a "security margin" around your normal cutoff during training. The script will train so that the messages will avoid this interval, i.e., all messages in your training mboxes will be marked as ham or spam with values far from your production cutoff. For example you might want to use spam_cutoff=0.5 and '-o 0.8,0.2' as bogofilter options. If you would rather use tri-state mode, you can just center this around 0.5 and again use '-o 0.8,0.2'. To correct the classification of a message, just move it to the correct mbox and repeat the full training process (which will add a few messages to the existing database). Example: bogominitrain.pl -fnv .bogofilter 'ham*' 'spam*' '-c train.cf' Options: -v This switch produces info on messages used for training. -vv Also lists messages not used for training. -f Runs the program until no errors remain. -n Prevents repetitions. -s Saves the messages used for training to files bogominitrain.ham.* and bogominitrain.spam.* -c Compacts the database at the end. Note: If you need to use more than one option, you must combine them. END exit; } # Check input my $compact=1 if ($commandlineoptions && $ARGV[0]=~s/c//); my $force=1 if ($commandlineoptions && $ARGV[0]=~s/f//); my $norepetitions=1 if ($commandlineoptions && $ARGV[0]=~s/n//); my ($safe,$safeham,$safespam)=(1,"bogominitrain.ham","bogominitrain.spam") if ($commandlineoptions && $ARGV[0]=~s/s//); my $verbose=1 if ($commandlineoptions && $ARGV[0]=~s/^-v/-/); my $vverbose=1 if ($commandlineoptions && $ARGV[0] eq "-v"); shift (@ARGV) if ($commandlineoptions); my ($dir,$ham,$spam,$options) = @ARGV; $bogofilter.=" $options -d $dir"; die ("$dir is not a directory or not accessible.\n") unless (-d $dir && -r $dir && -w $dir && -x $dir); `$bogofilter -n < /dev/null` unless (-s "$dir/wordlist.db"); my $ham_total=`$catcommand $ham 2>/dev/null |grep -c "^From "`; my $spam_total=`$catcommand $spam 2>/dev/null |grep -c "^From "`; my ($fp,$fn,$hamadd,$spamadd,%trainedham,%trainedspam); my $runs=0; my @status=("S","H","U","E"); print "\nStarting with this database:\n"; print `$bogoutil -w $dir/wordlist.db .MSG_COUNT`,"\n"; do { # Start force loop my $starttime=time; $runs++; open (HAM, "$catcommand $ham 2>/dev/null |") || die("Cannot open ham: $!\n"); open (SPAM, "$catcommand $spam 2>/dev/null |") || die("Cannot open spam: $!\n"); # Loop through all the mail my ($lasthamline,$lastspamline,$hamcount,$spamcount,$skipham,$skipspam) = ("","",0,0,0,0); ($hamadd,$spamadd)=(0,0); do { # Read one mail from ham box and test, train as needed unless (eof(HAM) || $hamcount*$spam_total > $spamcount*$ham_total) { my $mail=$lasthamline; $lasthamline=""; while (defined(my $line=)) { if ($line=~/^From /) {$lasthamline=$line; last;} $mail.=$line; } if ($mail) { $hamcount++; open (TEMP, "| $bogofilter") || die "Cannot pipe to bogofilter: $!"; print TEMP $mail; close (TEMP); my$status=$status[$?>>8]; unless ($status eq "H") { unless ($norepetitions && $trainedham{$hamcount}) { open (TEMP, "| $bogofilter -n") || die "Cannot pipe to bogofilter: $!"; print TEMP $mail; close (TEMP); $hamadd++; $trainedham{$hamcount}++; print "$status -- Training ham message $hamcount", $trainedham{$hamcount}>1&&" ($trainedham{$hamcount})", ".\n" if ($verbose); if ($safe) { open (TEMP, ">>$safeham.$runs") || die "Cannot write to $safeham.$runs: $!"; print TEMP $mail; close (TEMP); } } else {$skipham++;print "$status -- Skipping ham message $hamcount.\n" if ($verbose);} } else {print "$status -- Not training ham message $hamcount.\n" if ($vverbose);} } } # Read one mail from spam box and test, train as needed unless (eof(SPAM) || $spamcount*$ham_total > $hamcount*$spam_total) { my $mail=$lastspamline; $lastspamline=""; while (!eof(SPAM) && defined(my $line=)) { if ($line=~/^From /) {$lastspamline=$line; last;} $mail.=$line; } if ($mail) { $spamcount++; open (TEMP, "| $bogofilter") || die "Cannot pipe to bogofilter: $!"; print TEMP $mail; close (TEMP); my$status=$status[$?>>8]; unless ($status eq "S") { unless ($norepetitions && $trainedspam{$spamcount}) { open (TEMP, "| $bogofilter -s") || die "Cannot pipe to bogofilter: $!"; print TEMP $mail; close (TEMP); $spamadd++; $trainedspam{$spamcount}++; print "$status -- Training spam message $spamcount", $trainedspam{$spamcount}>1&&" ($trainedspam{$spamcount})", ".\n" if ($verbose); if ($safe) { open (TEMP, ">>$safespam.$runs") || die "Cannot write to $safespam.$runs: $!"; print TEMP $mail; close (TEMP); } } else {$skipspam++;print "$status -- Skipping spam message $spamcount.\n" if ($verbose);} } else {print "$status -- Not training spam message $spamcount.\n" if ($vverbose);} } } } until (eof(HAM) && eof(SPAM)); close (HAM); close (SPAM); print "\nEnd of run #$runs (in ",time-$starttime,"s):\n"; print "Read $hamcount ham mail",$hamcount!=1&&"s"," and $spamcount spam mail",$spamcount!=1&&"s",".\n"; print "Added $hamadd ham mail",$hamadd!=1&&"s",$skipham>0&&" (skipping $skipham)", " and $spamadd spam mail",$spamadd!=1&&"s",$skipspam>0&&" (skipping $skipspam)", " to the database.\n"; print `$bogoutil -w $dir/wordlist.db .MSG_COUNT`; unless ($hamadd+$spamadd==0) { $starttime=time; $fn=$spamcount>0 && `$catcommand $spam | $bogofilter -TM | grep -cv ^S` || "0\n"; print "\nFalse negatives: $fn"; $fp=$hamcount>0 && `$catcommand $ham | $bogofilter -TM | grep -cv ^H` || "0\n"; print "False positives: $fp\n"; print "Verification done in ",time-$starttime,"s.\n\n"; } } until ($fn+$fp==0 || $hamadd+$spamadd==0 || !$force); print "\n$runs run",$runs>1&&"s"," needed to close off.\n" if ($force); if ($compact) { print "Compacting database ...\n"; system("$bf_compact $dir && rm -rf $dir.old"); } bogofilter-1.2.4/contrib/scramble.sh0000644000175000017500000000766312163572305015642 0ustar sezsez#! /bin/bash # # $Id: scramble.sh 6306 2005-11-01 00:30:59Z relson $ # # # scramble -- split up files into entries assuming each entry # starts with a given separator # optionally, classify the entries # produce, on stdout, a random list of entries and # their locations and classes, or a stream of # entries in random order, with classifiers if given # needs: POSIX compliant sh, basename rm grep awk wc perl dd # usage: see function usage() starting on line 14 of this file # version: 0.12 (Greg Louis ) # Note: on Solaris, use /usr/xpg4/bin/sh -- /bin/sh will not work. pid=$$ mbox=1 # mbox mode mdir=2 # maildir mode usage() { iam=$(basename $0) echo "Usage: $iam separator [-l] [-c classID] filename/directory [...]" echo " Files contain entries, each of which begins with" echo " text matching the separator. Entries are listed or" echo " output in random order." echo "Parameters:" echo " separator is a regex used by grep that matches the" echo " start of each entry." echo " -l indicates that the output is to be a list of" echo " entries. If this option is not given, the output" echo " consists of the entries themselves." echo " classID is text used to identify the class of a" echo " given entry. If no classID values are specified," echo " this field consists of a single . character. If" echo " classID values are given and the -l option is not" echo " used, each entry in the output stream is preceded" echo " by a single line of the form %%-CLASS-ClassID-%%." echo " No one file may contain entries of more than one" echo " class." echo " File and directory names may not contain blanks." # rm -f list.$pid exit 1 } doit() { # the first param is the separator test "x$1" = "x" && usage if [ "$1" != "-d" ] ; then sep="$1" mode="$mbox" else mode="$mdir" fi shift stream=1 classID="." if [ "$mode" = "$mbox" ] ; then # mbox create_mbox_entries $* else # maildir create_maildir_entries $* fi output | perl \ -e' srand ( time() ^ ($$ + ($$ << 15)) );' \ -e' foreach $key (<>) {' \ -e' $shuf{$key} = rand;' \ -e' }' \ -e' foreach $key (sort { $shuf{$b} <=> $shuf{$a} } keys %shuf ) {' \ -e' print $key;' \ -e' }' >shuf.$pid cat shuf.$pid # next line can be commented out for debugging rm list.$pid shuf.$pid } create_mbox_entries() { # get all the byte offsets in all the files, in one list while [ ${#*} -gt 0 ]; do if [ "$1" = "-l" ]; then stream=0 shift continue fi if [ "$1" = "-c" ]; then classID=$2 shift 2 continue fi file=$1 ; shift if [ ! -r $file ]; then echo "$file not found"; usage; fi grep -a -b '^From ' $file | \ awk "BEGIN {FS=\":\"} {print \"$classID $file \"\$1}" >>list.$pid wc -c $file | awk "{print \"$classID $file \"\$1}" >>list.$pid done } create_maildir_entries() { # get all the byte offsets in all the files, in one list while [ ${#*} -gt 0 ]; do if [ "$1" = "-l" ]; then stream=0 shift continue fi if [ "$1" = "-c" ]; then classID=$2 shift 2 continue fi file=$1 ; shift if [ ! -r $file ]; then echo "$file not found"; usage; fi for fnam in $file/* ; do echo $classID $fnam >>list.$pid ; done done } output_mbox_entries() { file="" { while read classID fnam offset; do if [ "$fnam" = "$file" ]; then let length=$offset-$oldoff if [ $length -gt 0 ] ; then echo "$classID $fnam $oldoff $length" fi oldoff=$offset else file=$fnam oldoff=0 fi done } < list.$pid } output_maildir_entries() { cat list.$pid } output() { if [ "$mode" = "$mbox" ] ; then # mbox output_mbox_entries else # maildir output_maildir_entries fi } doit "$@" bogofilter-1.2.4/contrib/bfproxy.pl0000755000175000017500000006004512163572305015540 0ustar sezsez#!/usr/bin/perl -Tw require 5.006_001; use strict; use sigtrap; =head1 NAME bfproxy - performs bogofilter functions via email =cut my $version = "0.3.5"; ################################################ ############### Copyleft Notice ################ ################################################ # Copyright © 2003 Order amid Chaos, Inc. # Author: Tom Anderson # neo+bfproxy@orderamidchaos.com # # This program is open-source software; you can redistribute it # and/or modify it under the terms of the GNU General Public # License, v2, as published by the Free Software Foundation. # # 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: # # Free Software Foundation # 59 Temple Place, Suite 330 # Boston, MA 02111-1307 USA # # http://www.gnu.org/ ################################################# ################# Documentation ################# ################################################# # use "perldoc bfproxy" or "bfproxy -h" to read this =head1 SYNOPSIS =head2 Command line usage: B [I] < [I] =head2 Procmail usage (recommended): Add to ~/.procmailrc the following recipe. This recipe needs to be BEFORE the filtering recipe to prevent reclassifying all of the forwarded messages again. :0fw * ^To: $USER\+bfproxyID | $HOME/.bogofilter/bfproxy Where I<$HOME> is your home directory, if not set in the environment, I<$USER> is your login name, if not set, and "I" is any string by which you choose to identify mail that should be processed by bfproxy. Essentially, you are matching your regular email address with "I<+bfproxyID>" after it. Eg: joe.shmoe+mybfproxystring@somedomain.com Joe's procmail recipe would then be: :0fw * ^To: joe.shmoe\+mybfproxystring | $HOME/.bogofilter/bfproxy Don't use the default "I" though, and keep yours confidential so that people can't send bogofilter commands on your behalf. The from address would have to be spoofed, and you'd get a report anyway, but why tempt fate? Using your own unique "I" helps prevent automated attacks by spammers on bogofilter users. When entering the bogofilter recipe after the bfproxy recipe, you should add the C flag so that bogofilter does not filter the results of running bfproxy. Eg: :0Efw | bogofilter -uep It's not necessary, but suggested. If you use the C<-u> option with bogofilter, these bfproxy-trained emails would be trained again otherwise, which is generally not what you want. You would also risk having the results thrown in with your spam, which would also be undesireable. Therefore, it's best to use the C flag in the bogofilter recipe. Just remember to make sure that the bogofilter recipe is AFTER the bfproxy recipe to prevent screwing up your database by double- classifying those attached emails. =head2 Email usage: When using an MDA such as Procmail to handle running bfproxy, as intended, you'll need to send yourself emails with the special "I" included, followed by any options. Eg: [I]+[I]-[I]@[I] The email you send to this address should contain any emails you want to correct as attachments. Using your email client's forward- as-attachment functionality should suffice. All such attached emails will be processed according to address-line options. =head1 OPTIONS: =head2 Address-line options: =over 4 =item B all emails with an original bogosity of I or I will be unregistered and then re-registered as the opposite bogosity (C<-Sn>, C<-Ns>). This is useful if the emails were originally auto registered with the C<-u> flag or if a user error occurred. =item B all emails with an original bogosity of I or I will be registered as the opposite bogosity (C<-n>, C<-s>). =item B unregister all attached emails from the ham database =item B unregister all attached emails from the spam database =item B register all attached emails as ham =item B register all attached emails as spam =item B Repeatedly register emails that are within the "unsure" zone of spamicity values (between ham_cutoff and spam_cutoff) until they are correctly classified or until I has been reached. =item B Verbose output. Show per-email registration information in addition to the subject lines and summary. =item B Show benchmarking information in the output. =item B Display bogofilter configuration info in the output. =back If no address-line command is provided, it defaults to C for "correction" mode. If you choose to use C or C and wish to register unsures at the same time, you can add a secondary command after the C or C to register unsures as either spam (C) or ham (C). Eg: joe.shmoe+mybfproxystring-Rs@somedomain.com The result of the above command string will be that all emails previously classified as spams will be registered as hams, all emails previously classified as hams will be registered as spams, and all emails previously classified as unsures will be registered as spams. If a secondary command is not used with C or C, then unsures are not registered. =head2 Command-line options: =over 4 =item B display this help file =back =head1 REQUIRES =over 4 =item * Perl 5.6.1 =item * bogofilter =back =head1 DESCRIPTION Bfproxy accepts an email on stdin (generally from procmail or some other MDA) containing one or more forwarded-as-attachment emails. It will extract the attached emails and remove [SPAM] indicators from the subject line. Then, it'll determine the original classification of each email from its X-Bogosity field, and pass the original emails to bogofilter with the appropriate flags as determined by address-line options. The attachments containing the emails should be message/rfc822 format, which is how most email clients will do forwarding-by-attachment by default. If they are not in this format, then it is quite likely that important header information is being omitted, and bfproxy will ignore such attachments. Moreover, bfproxy will only recognize attachments in encapsulating MIME types multipart/mixed or multipart/digest. Quoted-text attachments will not work, nor will inline attachments which do not conform to the previous requirements (rfc822 and mixed or digest). Just about any MUA should be able to meet these requirements for forwarding emails. If there is one that uses a slightly different, but possibly acceptable format, please send a bug report to neo+bfproxy@orderamidchaos.com. Also, bfproxy will not parse attached emails multiple MIME levels. If an attachment has an attachment, then the whole thing will get parsed as a single email rather than accounting for the headers in the attached email. Do not nest corrections within each other. This scheme uses "subaddressing" to direct the MDA to run the email through bfproxy without requiring a new user or alias on the system. Moreover, the output of the operation will arrive in the user's mailbox without having to resend a second email. This also allows bfproxy to run with the permissions of the user whose database is to be altered by the command, and access his/her environment, including the appropriate config files and db files. See RFC3598 (http://www.ietf.org/) for details on "subaddressing". It is supported by common MTA's such as Sendmail. =head1 FAQ =head2 Why isn't it working? If you get an error the first time you try it, such as bfproxy saying it received zero emails for correction, then view the source of the email you sent and make sure the attachments use message/rfc822 format, and that the attachments are contained in a MIME part of multipart/mixed or multipart/digest. If not, check your email client's options to see if you can get it into that format. If you get any other errors/problems, please submit a bug report. =head2 Why call it 'bfproxy' instead of 'bogoproxy', etc.? Because "bogo" refers to bogons which are the elementary particle of bogosity which bogofilter filters. We're not proxying bogons but commands to bogofilter. Therefore, despite the lyrical synergy that "bogoproxy" would have, it simply wouldn't make any logical sense, whereas the less elegant bfproxy is more descriptive of its actual function... proxying "bf" commands. =head2 What happens to X-headers from my client/proxy/etc? X-headers are left as-is now, unlike initial bfproxy behavior. The reason is that bogofilter's Bayesian algorithm will essentially make those X-headers irrelevant to classifications since an equal number will come from spams as from hams. Therefore emails will end up being classified based on other tokens instead. And this way, X-headers from senders' clients/proxies/servers/etc may be useful in classifying. Furthermore, this reduces the number of ad hoc rules that bfproxy applies and would need to be maintained. Bogofilter already strips the X-Bogosity header, so it is unnecessary to do so in bfproxy. =head1 BUGS =over 4 =item Please report any. =back =head1 TODO =over 4 =item Add more verbosity options =item Use bogofilter -Q to obtain non-standard tags, formats, etc. =item Suggestions welcome. =back =head1 SEE ALSO L =head1 AUTHOR Tom Anderson =cut ################################################# ############### User Variables ################# ################################################# # please edit according to your setup # default path our $path = "/bin:/usr/bin:/usr/local/bin"; # default shell our $shell = "/bin/sh"; # address-line command string (after the "+", before the "@") our $command = "bfproxyID"; # maximum number of recursions for train-to-exhaustion our $rmax = 10; # delivery username; leave blank unless your MTA is unable # to deliver to individual virtual host users but instead # delivers to a single shared virtual host user our $mailbox = ""; # most setups will not need this # of course, modify the first line of this file, # the shebang, to point to your perl interpreter # do not edit below this line unless you really # know what you're doing ################################################# ############## Include Libraries ################ ################################################# use IO::Select; use IPC::Open2; use Fcntl qw(:flock); use Benchmark; ################################################# ############## Default Globals ################## ################################################# $> = $<; # set effective user ID to real UID $) = $(; # set effective group ID to real GID # Make %ENV safer delete @ENV{qw(IFS CDPATH ENV BASH_ENV PATH SHELL)}; # Set the environment explicitely $ENV{PATH} = $path; $ENV{SHELL} = $shell; ################################################ ##################### Main ##################### ################################################ # print help info if (defined @ARGV && $ARGV[0] =~ /^-+h.*/) { my $bfproxy = $1 if $0 =~ /^([\w\/.\-~]*)$/; system("perldoc $bfproxy"); exit(0); } # determine bogofilter settings our ($robx, $robs, $min_dev, $ham_cutoff, $spam_cutoff) = get_config(); # extract the header my ($header, $boundary, $from, $options) = extract_header($command, $version); # run bogofilter on the extracted emails and gather the results my $results = process_emails($boundary, $from, $options); # output the new email containing the results print "$header\n$results\n"; ################################################ ############## Get Configuration ############## ################################################ sub get_config { my ($robx, $robs, $min_dev, $ham_cutoff, $spam_cutoff) = (0,0,0,0,0); open (CONF, "bogofilter -Q |") or error("warn", "Could not get bogofilter settings"); while () { my $line = $_; $robx = ($1+0) if $line =~ /robx\s*?=\s*?([0-9\.]+?)\s/i; $robs = ($1+0) if $line =~ /robs\s*?=\s*?([0-9\.]+?)\s/i; $min_dev = ($1+0) if $line =~ /min_dev\s*?=\s*?([0-9\.]+?)\s/i; $ham_cutoff = ($1+0) if $line =~ /ham_cutoff\s*?=\s*?([0-9\.]+?)\s/i; $spam_cutoff = ($1+0) if $line =~ /spam_cutoff\s*?=\s*?([0-9\.]+?)\s/i; } close CONF; return $robx, $robs, $min_dev, $ham_cutoff, $spam_cutoff; } ################################################ ############### Extract Header ################ ################################################ sub extract_header { my $command = shift; my $version = shift; my $header = ""; my $boundary = ""; my $multipart = 0; my $from = ""; my $to = ""; while () { my $line = $_; # record the boundary of the multipart/mixed or digest MIME message $multipart = 1 if $line =~ /Content-Type: multipart\/(?:mixed|digest);/i; $boundary = $1 if $multipart && $line =~ /boundary="(.*?)"/i; # replace the from, subject, and content-type lines in the headers $from = $1 if $line =~ s/^From:\s(.*)$/From: Bfproxy v$version/i; $line =~ s/^Subject:\s.*$/Subject: training results/i; $line =~ s/^Content-type:\s.*$/Content-Type: text\/plain/i; $to = $1 if $line =~ /^To:\s(.*)$/i; $header .= $line; # if $line =~ /^\w*?:\s|^From\s/i; # unless $line =~ /^X-[^\s]*?:/i; # we're done with the header when we've found a blank line last if $line !~ /[^\s]/i; } # extract the "user" portion of the "from" address my $user = $1 if $from =~ /.*?((?:\w|-|\.)+?)\@.*$/i; # parse any address-line flags my $options = ($to =~ /.*?$user\+$command\-(.*?)\@.*$/i)? $1 : ""; return $header, $boundary, $from, $options; } ################################################ ############### Process Emails ################ ################################################ sub process_emails { # 1) Read the email from STDIN # 2) Discard the enveloping email and process only the "message/rfc822" MIME parts # representing the forwarded-as-attachment incorrectly classified emails # 3) Send emails to bogofilter for registration # 4) Output the results my $boundary=shift||""; # multipart boundary my $from = shift || ""; # address of sender my $options=shift ||""; # address-line flags my @count = (0,0,0,0); # count of emails (found, processed, lines, words) my $locked = 0; # lock the boundary at the shallowest level where rfc822 content found my %email; # hash to temporarily hold a single email my $found = 0; # indicator of when to record an email # 0: no rfc822 messages found yet # 1: we've got a message/rfc822 header # 2: we're out of the header part # start timing the process my $start_time = new Benchmark if $options =~ /b/; # begin generating output my $results .= "Bfproxy has processed the following emails with option $options:\n\n"; while () { my $line = $_; $count[2]++; if ($found < 2) # try to find any new attached emails { # record the boundary of the multipart/mixed or digest MIME message unless ($locked) { $boundary = $1 if $line =~ /Content-Type: multipart\/(?:mixed|digest); boundary="(.*?)"/i; } # we've found a new attached email if the content-type is message/rfc822 and we have a boundary if ($line =~ /Content-Type: message\/rfc822/i && $boundary) { $found++; $locked = 1; # lock the boundary on first attachment } # we're ready to start recording if we're out of the attachment header (found a blank line) $found++ if ($line !~ /[^\s]/i && $found == 1); } else # if we're inside an attached email, record it { if ($line !~ /\Q$boundary\E/) { # strip [SPAM] token from subject $line =~ s/^Subject: (.*?)\[(?:SPAM|UNSURE)\]/Subject: $1/i; # escape From lines in body $line =~ s/^(From) />$1 /i; # record properties of this email $email{'spam'} = 'U' if $line =~ /^X-Bogosity: (?:Unsure)/i; $email{'spam'} = 'S' if $line =~ /^X-Bogosity: (?:Yes|Spam)/i; $email{'spam'} = 'H' if $line =~ /^X-Bogosity: (?:No|Ham|Clean)/i; $email{'spamicity'} = $1 if $line =~ /spamicity=((?:\d|\.)*?), /; $email{'content'} .= "$line" unless $line =~ /^X-[^\s]*?:/i; $email{'return-path'} = $1 if $line =~ /^Return-Path: |\n)/i; $email{'from'} = $1 if !defined $email{'from'} && $line =~ /^From: (?:.*?<)?(.*?)(?=>|\n)/i; $email{'subject'} = $1 if $line =~ /^Subject: (.{0, 40})(.*?)/i; $email{'subject'} .= "..." if $line =~ /^Subject: .{40}.+?/i; } else # the email is finished once we've come to a boundary -- send it to bogofilter { $count[0]++; $email{'subject'} = "No Subject" unless $email{'subject'}; $email{'spam'} = 'U' unless defined $email{'spam'}; $email{'spamicity'} = "None" unless $email{'spamicity'}; my $training = train(\%email, $options, 0, \@count); # per-email output $results .= "subject: $email{'subject'}\n"; $results .= "original spamicity: $email{'spamicity'}\n" . $training if $options =~ /v/; # close this email and advance to the next undef %email; $found = 0; } } } $results .= "\n"; $results .= "$count[0] emails found, containing $count[2] lines total.\n"; $results .= "$count[3] words from $count[1] emails were registered.\n\n"; if ($options =~ /b/) { # calculate total running time my $end_time = new Benchmark; my $td = timediff($end_time, $start_time); my $cpu = $td->[1]+$td->[2]+$td->[3]+$td->[4]; my $wall = $td->[0]; my $per_line = $cpu / $count[2]; $per_line = int(($per_line*1000) + .5 * ($per_line <=> 0)) / 1000; my $per_mail = $cpu / $count[0]; $per_mail = int(($per_mail*1000) + .5 * ($per_mail <=> 0)) / 1000; $results .= "Total running time was $wall wallclock secs, $cpu CPU secs.\n"; $results .= "$per_line CPU secs/line, $per_mail CPU secs/email.\n"; $results .= "Bfproxy required ".$td->[1]." usr + ".$td->[2]." sys = ".($td->[1]+$td->[2])." CPU secs.\n"; $results .= "Bogofilter required ".$td->[3]." usr + ".$td->[4]." sys = ".($td->[3]+$td->[4])." CPU secs.\n\n"; } if ($options =~ /c/) { $results .= "robx=$robx, robs=$robs, min_dev=$min_dev, spam_cutoff=$spam_cutoff, ham_cutoff=$ham_cutoff, rmax=$rmax\n"; } return $results; } ################################################ ############### Perform Training ############### ################################################ sub train { my $email = shift or error("warn", "No email provided"); my $options = shift || "C"; my $r = shift || 0; # recursion counter for exhaustive training my $count = shift || (0,0,0,0); my $results = ""; if ($options =~ /[CR]/) # if action is corrective, check the bogosity to decide what to do { if ($email->{'spam'} == 'S') # email was classified as SPAM { my $flag = ($options =~ /C/)? "Sn" : "n"; $results .= "user classification: ham\ncommand: bogofilter -${\$flag}\n" unless $r; my ($status, $words, $output) = bogofilter("-${\$flag}evD 2>&1", $email->{'content'}); unless ($status || $r) { $count->[1]++; $count->[3]+=$words; $results .= "words: $words\n"; } elsif ($status) {$results .= "could not process this email: $status\n";} } elsif ($email->{'spam'} == 'H') # email was classified as HAM { my $flag = ($options =~ /C/)? "Ns" : "s"; $results .= "user classification: spam\ncommand: bogofilter -${\$flag}\n" unless $r; my ($status, $words, $output) = bogofilter("-${\$flag}evD 2>&1", $email->{'content'}); unless ($status || $r) { $count->[1]++; $count->[3]+=$words; $results .= "words: $words\n"; } elsif ($status) {$results .= "could not process this email: $status\n";} } elsif ($email->{'spam'} == 'U') # email was classified as UNSURE { my $new_options = $options; $new_options =~ s/[CR]//gs; $results .= train($email, $new_options, $r, $count); return $results; } } elsif ($options =~ /[NSns]/) # if action is direct, just do it { my $flag = $options; $flag =~ s/[^NSns]//gs; my $class = ($flag =~ /s/)? "spam" : ($flag =~ /n/)? "ham" : "none"; $results .= "user classification: $class\ncommand: bogofilter -${\$flag}\n" unless $r; my ($status, $words, $output) = bogofilter("-${\$flag}evD 2>&1", $email->{'content'}); unless ($status || $r) { $count->[1]++; $count->[3]+=$words; $results .= "words: $words\n"; } elsif ($status) { $results .= "could not process this email: $status\n"; } } else { $results .= "could not process this email: no option passed in for this condition\n"; } # check new spamicity my ($status, $words, $output) = bogofilter("-te 2>&1", $email->{'content'}); unless ($status) { $output =~ s/^.*?((?:\d|\.)*?)$/$1/; $results .= "new spamicity: $output"; } else {$results .= "could not classify this email: $status\n";} # train-to-exhaustion $options =~ s/[^nsx]//gis; # only do registration on subsequent recursions $results .= train($email, $options, $r+1, $count) if $options =~ /x/ && $r < $rmax && (($options =~ /s/ && $output < $spam_cutoff) || ($options =~ /n/ && $output > $ham_cutoff)); $results .= "\n" unless $r; return $results; } ################################################ ################ Run Bogofilter ################ ################################################ sub bogofilter { my $options = shift || ""; my $email = shift || ""; my $status = 0; my $output = ""; my $words = ""; # for environments that don't split virtual host users into system users $options = "-d $ENV{HOME}/.bogofilter/$mailbox " . $options if $mailbox; # trap broken pipes $SIG{PIPE} = \&sig_trap; # fork pipe to bogofilter my $pid = open2(\*R, \*W, "bogofilter $options") or error("die", "Could not open pipe to bogofilter: $!"); # lock filehandle assert_dominance (\*W, LOCK_EX); # create filehandle references my $R = *R{IO}; my $W = *W{IO}; # create select object and add handles my $sel = IO::Select->new($R, $W) or error("die", "Cannot create IO::Select object: $!"); # set autoflush select((select(W), $| = 1)[0]); # select strings my $ex = join(', ', $sel->has_exception(0)); my $cw = join(', ', $sel->can_write(0)); my $w = "$W"; # send email to bogofilter unless ($ex =~ /\Q$w\E/) # unless there was an exception on this filehandle { if ($cw =~ /\Q$w\E/) # if this filehandle is writeable { syswrite W, $email or error("die", "Cannot write to pipe: bogofilter $options: $email: $!"); } else {error("warn", "Filehandle $w is not in ready list: $cw: $!");} } else {error("warn", "Filehandle $w had an exception: $!");} # close write filehandle to flush the buffer and read from the process outputs if (close W) { $status = $? >> 8; # exit status sysread R, $output, 32 or error("warn", "Cannot read from pipe: $!"); $words = $1 if $output =~ /^#\s*?(\d*?) words.*/; } else {error("warn", "Could not flush output to bogofilter: $!");} # close read filehandle unless (close R) {error("warn", "Could not close input from bogofilter: $!");} # terminate child processes waitpid $pid, 0; return $status, $words, $output; } ################################################ ################ Error Handling ################ ################################################ sub error { my ($action, $msg) = @_; die $msg if $action eq "die"; warn $msg unless $action eq "die"; # add other actions if you like } sub sig_trap { my $sig = shift; my ($action, $more) = ("warn", ""); sig: { $action = "warn", last sig if $sig =~ /ALRM/; $action = "warn", last sig if $sig =~ /PIPE/; $action = "warn", last sig if $sig =~ /CHLD/; $action = "die" , last sig if $sig =~ /INT/; $action = "die" , last sig if $sig =~ /HUP/; $action = "warn"; } my $waitedpid = wait; $more = "; Reaped pid $waitedpid, exited with status " . ($? >> 8) if $waitedpid; $SIG{$sig} = \&sig_trap; error ($action, "Trapped signal SIG$sig$more"); } ################################################ ################# File Locking ################# ################################################ sub assert_dominance { my ($handle, $type) = @_; # assert yourself unless (flock ($handle, $type)) { # get impatient sleep 3; # reassert yourself or give up unless (flock ($handle, $type)) { error ("die", "File lock error: $!"); } } seek $handle, 0, 2; } bogofilter-1.2.4/contrib/trainbogo.sh0000644000175000017500000002167112163572305016031 0ustar sezsez#!/bin/sh # Train bogofilter from a ham and spam corpus # # Copyright 2003 by Trevor Harrison (trevor-trainbogo@harrison.org) # # This file is released under the GPL. See http://www.gnu.org/licenses/gpl.txt # $Id: trainbogo.sh 4431 2004-05-30 20:25:16Z m-a $ # # Note: this script has not yet had bogofilter maintainer review. # Security concerned people should not run it if in doubt about its security. usage() { echo "USAGE:" echo echo " trainbogo.sh [options]" echo echo "OPTIONS:" echo echo " Required arguments:" echo " -H hamdir points to directory with all your ham" echo " -S spamdir points to directory will all your spam" echo echo " Optional arguments:" echo " -s statdir directory where stat and tmp files are created." echo " default is ./stats.tmp" echo " -b pathtobogofilter points to the bogofilter executable," echo " with any bogofilter options you need." echo " ex. -b \"/usr/local/bin/bogofilter -d /etc/bogodb\"" echo " -f force rebuild of ham and spam directory index. Will" echo " cause msgs to be sorted into new order unless" echo " -p and -t are used." echo " -c cleanup statdir when done. (default is not to)" echo " -p rndseed specify the pid.timestamp used to randomize the msgs." echo " ex. -p 5432.1049498805" echo " -m don't test or train bogofilter, just show cached stats." echo " -n don't train bogofilter, just test." echo " -q don't show stats or dots. (quiet)" echo " -h show help." echo } help() { echo "trainbogo.sh" echo echo " Train bogofilter from a qmail maildir type ham and spam corpus" echo echo " This script relies on you having seperated your qmail maildir messages into" echo " ham and spam directories. This script randomizes the message order, and" echo " then feeds each message in turn into bogofilter, noting if bogofilter" echo " correctly identified the message as ham or spam. If mis-identified, it" echo " trains bogofilter with that message, and then re-tests to see if bogofilter" echo " correctly identifies the message." echo echo " When I've used this script on my ham/spam collection, it takes about 4" echo " consecutive executions to get my wordlists to a 0 false positive state." echo " Just because this script reports 0 failed trainings doesn't mean that you" echo " are ready to go. Run the script a second time to make sure. You should" echo " keep running the script until you get 0 misdetections and, of course, 0" echo " retrain failed's." echo echo " While running, trainbogo.sh will write some dots and dashes to the screen." echo echo " . = successfully categorized the message." echo " - = failed to categorized the message, and training was turned off (-n)." echo " + = successfully categorized the message after being retrained." echo " f = failed to categorize the message after training." echo echo " The results of the testing can be found in the statsdir. Log files have" echo " the filename of each message that match the logfile name:" echo echo " trainbogo.log.[0,1].[success,fail]" echo " 0 = spam message log" echo " 1 = ham message log" echo " success/fail = were/weren't correctly categorized." echo usage } verbose() { [ -n "${verbose}" ] && echo $@ } normal() { [ -z "${quiet}" ] && echo $@ } normaln() { [ -z "${quiet}" ] && printf "%s" "$*" } cleanup() { verbose "Performing cleanup" [ -z "${log}" ] || [ -z "${list}" ] || [ "${docleanup}" != "y" ] && return rm -f ${log}.[01].success ${log}.[01].fail \ ${log}.[01].train.success ${log}.[01].train.fail \ ${list} [ "${madestatsdir}" = "y" ] && [ -n "${statsdir}" ] && rmdir --ignore-fail-on-non-empty "${statsdir}" } dofilelist= dotrain=y dotest=y docleanup= verbose= quiet= statsdir="${PWD}/stats.tmp/" origstatsdir="${statsdir}" bf=bogofilter while getopts "H:S:s:b:p:fcmnqvh" optname; do case "${optname}" in "H") hamdir="$OPTARG" ;; "S") spamdir="$OPTARG" ;; "s") statsdir="$OPTARG" ;; "b") bf="$OPTARG";; "f") dofilelist=y ;; "c") docleanup=y ;; "p") rndseed=$OPTARG ;; "m") dotest= ; dotrain= ;; "n") dotrain= ;; "q") quiet=y ;; "v") verbose=y ;; "h") help; exit ;; esac done # Check for required options [ -z "${hamdir}" ] || [ ! -d "${hamdir}" ] && echo "Missing or bad -H option" && usage && exit [ -z "${spamdir}" ] || [ ! -d "${spamdir}" ] && echo "Missing or bad -S option" && usage && exit [ -z "${statsdir}" ] && echo "Bad statsdir option" && usage && exit # make the stats dir if its missing, but only if its the default stats dir and not user specified [ "${statsdir}" = "${origstatsdir}" ] && [ ! -d "${statsdir}" ] && mkdir "${statsdir}" && madestatsdir=y [ ! -d "${statsdir}" ] && echo "Missing statsdir (-s option)" && exit # check for bogofilter bfbin=$(which ${bf%% *}) [ $? -ne 0 ] && echo "Missing bogofilter, not in path? (${bf})" && exit [ ! -x "${bfbin}" ] && echo "Missing or bad bogofilter binary! (${bf})" && exit list="${statsdir}/trainbogo.filenames.txt" log="${statsdir}/trainbogo.log" # Init log files if [ ! -f "${log}.0.success" ] || [ -n "${dotest}" ] || [ -n "${dotrain}" ] ; then verbose "init log files" >"${log}.0.success" >"${log}.1.success" >"${log}.0.fail" >"${log}.1.fail" >"${log}.0.train.success" >"${log}.0.train.fail" >"${log}.1.train.success" >"${log}.1.train.fail" fi # First make a randomly sorted list of all the ham and spam files (if needed) if [ ! -f "${list}" ] || [ -n "${dofilelist}" ]; then # MD5 all the spam and ham [ -z "${rndseed}" ] && rndseed="$$.$(date +%s)" normal "MD5'ing ham and spam corpus, rndseed used: ${rndseed}" >"${list}" for i in "${hamdir}"/* "${spamdir}"/* do [ ! -f "${i}" ] && continue md5=$(printf "%s" "${rndseed}${i}" | md5sum | sed "s/ -//") echo "${md5} ${i}" >> "${list}" done [ $(wc -l < "${list}") -eq 0 ] && echo "No files to work on!!!" && exit # This randomizes the file names by sorting on the md5 hash normal "Randomizing ham and spam" sort "${list}" > "${list}.tmp" mv -f "${list}.tmp" "${list}" # Drop the hash sed "s/^.\{32\} \(.*\)/\1/" < "${list}" > "${list}.tmp" mv -f "${list}.tmp" "${list}" # Put expected bogofilter error levels in front of each filename # Using @'s for sed's rule delimiter because ${hamdir} can have /'s. # Hopefully there won't be any @'s in the ham/spam dir name. sed "s@^${hamdir}\(.*\)@1 ${hamdir}\\1@g; s@^${spamdir}\(.*\)@0 ${spamdir}\\1@g" < "${list}" > "${list}.tmp" mv -f "${list}.tmp" "${list}" fi # Read each filename from the filelist and test and train bogofilter. if [ -n "${dotest}" ] || [ -n "${dotrain}" ]; then normal "Training bogofilter" (while read spamstatus fname do normaln "${lastdot}" bogotest=$(${bf} -v < "${fname}") ret=$? if [ ${spamstatus} -eq ${ret} ]; then # bogofilter detected this message correctly echo "${fname}" >> "${log}.${spamstatus}.success" lastdot="." continue fi # Bogofilter failed to detect the msg correctly echo "${fname}" >> "${log}.${spamstatus}.fail" lastdot="-" [ -z "${dotrain}" ] && continue # Set the bogofilter option for training if [ ${spamstatus} -eq 0 ]; then bfopt="-s" else bfopt="-n" fi # Train bogofilter ${bf} ${bfopt} < "${fname}" # Test again bogotest=$(${bf} -v < "${fname}") ret=$? # Did it train successfully? if [ ${spamstatus} -eq ${ret} ]; then testresult="success" lastdot="+" else testresult="fail" lastdot="f" fi # Log train result echo "${fname}" >> "${log}.${spamstatus}.train.${testresult}" done) < ${list} fi echo echo if [ -z "${quiet}" ]; then total_msg=$(wc -l < "${list}") total_ham_msg=$(ls "${hamdir}" | wc -l) total_ham_success=$(wc -l < "${log}.1.success") total_ham_fail=$(wc -l < "${log}.1.fail") total_ham_train_fail=$(wc -l < "${log}.1.train.fail") total_spam_msg=$(ls "${spamdir}" | wc -l) total_spam_success=$(wc -l < "${log}.0.success") total_spam_fail=$(wc -l < "${log}.0.fail") total_spam_train_fail=$(wc -l < "${log}.0.train.fail") echo "Total messages: ${total_msg}" echo echo "Total ham: ${total_ham_msg}" echo "Misdetected ham: ${total_ham_fail}" [ -n "${dotrain}" ] && echo " retrain fail: ${total_ham_train_fail}" echo echo "Total spam: ${total_spam_msg}" echo "Misdetected spam: ${total_spam_fail}" [ -n "${dotrain}" ] && echo " retrain fail: ${total_spam_train_fail}" echo fi normal "Done" cleanup # done bogofilter-1.2.4/contrib/parmtest.sh0000755000175000017500000000640312163572305015703 0ustar sezsez#!/bin/sh # parmtest.sh - a parameter testing script. # # This script can be used to test a bogofilter option # to see whether the option makes bogofilter is more # effective or less effective. # # It is presently set to test 'tag_header_lines', but # by creating different config files can be used to test # other config file options. # # For each test named in variable TESTS, a corresponding # config file, e.g. $test.cf, is needed. Bogofilter is # trained using $test.cf to create wordlists for the test. # The newly created wordlists are saved in directory $test.d. # This allows a test to be run using the same parameters # used to build the wordlists. # # For each mbox file used in testing, an output file is # created that gives the result of testing each message # in the mbox. The result lines include: # # S/H/U - the spam/ham/unsure classification. # spamicity - 0.0 to 1.0 # message number - 0000, 0001, ... # subject line - "Subject: This is a test" # # A summary line is generated for each file giving # test name, filename, S count, H count, and U count, # for example: # # default.spam.mbx.out 1603 5 136 # default.good.mbx.out 3 4934 108 BIN=~/bin BOGOUTIL="$BIN/bogoutil" BOGOFILTER="$BIN/bogofilter" # TEST_DIR="./test.bogofilter" BOGOFILTER_DIR="$TEST_DIR" export BOGOFILTER_DIR #specify files for creating the test wordlists SPAM_TRAIN=$(ls spam_train*mbx) GOOD_TRAIN=$(ls good_train*mbx) #specify files for testing SPAM_TEST=$(ls spam_test*mbx) GOOD_TEST=$(ls good_test*mbx) #specify names of tests to run TESTS="default tag_header_lines" if [ -z "$1" ] ; then # create standard (base) config file cat < base.cf algorithm = fisher ham_cutoff = 0.10 spam_cutoff = 0.95 terse_format = %1.1c %f header_format = %1.1c spamicity_tags = S, H, U spamicity_formats = %0.6f %0.6f %0.6f EOF # copy base config file for each test for test in $TESTS ; do cat base.cf > $test.cf done # customize config files cat <> default.cf tag_header_lines=no EOF cat <> tag_header_lines.cf tag_header_lines=yes EOF [ ! -d $TEST_DIR ] && mkdir $TEST_DIR date for test in $TESTS ; do echo $test # train (build wordlists for testing) if [ ! -d $test.d ] ; then mkdir $test.d rm -f $TEST_DIR/*.db if [ ! -f spamlist.db ] ; then for m in $SPAM_TRAIN ; do echo $m $BOGOFILTER -v -c $test.cf -s < $m done cp -p $TEST_DIR/spamlist.db $test.d fi if [ ! -f goodlist.db ] ; then for m in $GOOD_TRAIN ; do echo $m $BOGOFILTER -v -c $test.cfd -n < $m done cp -p $TEST_DIR/goodlist.db $test.d fi $BOGOUTIL -w $test.d .MSG_COUNT fi # copy wordlists for use cp -pf $test.d/*.db $TEST_DIR # test (score accuracy) cfg="$test.cf" list="$SPAM_TEST $GOOD_TEST" for mbox in $list ; do b=$(basename $mbox) f="$test.$b.out" cat /dev/null > $f FILENO=0000 formail -s $0 $cfg $f < $mbox s=$(grep "^S" $f | wc -l) h=$(grep "^H" $f | wc -l) u=$(grep "^U" $f | wc -l) printf "%-20s %4d %4d %4d\n" $(basename $f) $s $h $u done echo "" done else cfg="$1" out="$2" cat > $$.tmp result=$($BOGOFILTER -t -v -c $cfg < $$.tmp | head -1) echo $result $FILENO $(grep ^Subject: $$.tmp | head -1) >> $out rm -f $$.tmp fi bogofilter-1.2.4/contrib/randomtrain.sh0000755000175000017500000001244412163572305016364 0ustar sezsez#! /bin/bash # # $Id: randomtrain.sh 6306 2005-11-01 00:30:59Z relson $ # # # randomtrain -- bogofilter messages from files in random order # and train if the result is wrong or uncertain # needs: POSIX compliant sh, basename rm grep awk wc perl dd bogofilter # usage: see function usage() of this file # # original author: Greg Louis # modified by: David Relson # Note: on Solaris, use /usr/xpg4/bin/sh -- /bin/sh will not work. BOGOFILTER="bogofilter" usage() { name=$(basename $0) echo "Usage: $name [-d bogodir] [-p pid] [-c cfg] [-]n|s filename [-]n|s filename [...]" echo " Messages contained in the files are fed to bogofilter" echo " in random order. If bogofilter is wrong or uncertain" echo " about whether a message is spam, that message is used" echo " for training, with bogofilter's -s or -n option." echo "" echo "Parameters:" echo " bogodir is where bogofilter's wordlists files are kept" echo " (bogodir defaults to $HOME/.bogofilter)." echo " n (or -n) indicates that the next file contains only nonspams." echo " s (or -s) means it contains only spams." echo " No one file may contain both spams and nonspams." echo " Filenames may not contain blanks." echo "" echo " c (or -c) indicates that the next file is the config file." echo " p (or -p) indicates that a pid comes next (used for re-running a test)." echo "NB: At least one spam and one nonspam file are needed!" exit 1 } train_mbox() { # go through the list, extract the messages, eval with bogofilter # and train if bogofilter is wrong or uncertain cnt=0; nspam=0; ngood=0; rspam=0; rgood=0; echo " spam reg good reg" while read expect fnam offset length; do let cnt=cnt+1 dd if=$fnam bs=1 skip=$offset count=$length 2>/dev/null >msg.$pid result=$($BOGOFILTER -t -v -d $bogodir $cfg -I msg.$pid) got=$? # 0=spam, 1=ham, 2=unsure, 3=err if [ "$expect" = "s" ]; then let nspam=$nspam+1 else let ngood=$ngood+1; fi if [ $got -eq 0 ]; then got="s"; elif [ $got -eq 1 ]; then got="n"; fi if [ "$got" != "$expect" ]; then if [ "$expect" = "s" ]; then let rspam=$rspam+1 else let rgood=$rgood+1; fi # comment out the next line for dry-run testing $BOGOFILTER -$expect $cfg -d $bogodir -I msg.$pid fi # echo $expect $got $result, $nspam $rspam, $ngood $rgood n=$(expr \( $nspam + $ngood \) % 10) test $n -eq 0 && \ printf "\r%5d%5d %5d%5d " $nspam $rspam $ngood $rgood done printf "\r%5d%5d %5d%5d\n" $nspam $rspam $ngood $rgood } train_maildir() { # go through the list, extract the messages, eval with bogofilter # and train if bogofilter is wrong or uncertain cnt=0; nspam=0; ngood=0; rspam=0; rgood=0; echo " spam reg good reg" while read expect fnam; do let cnt=cnt+1 result=$($BOGOFILTER -t -v -d $bogodir $cfg -I $fnam) got=$? # 0=spam, 1=ham, 2=unsure, 3=err if [ "$expect" = "s" ]; then let nspam=$nspam+1 else let ngood=$ngood+1; fi if [ $got -eq 0 ]; then got="s"; elif [ $got -eq 1 ]; then got="n"; fi if [ "$got" != "$expect" ]; then if [ "$expect" = "s" ]; then let rspam=$rspam+1 else let rgood=$rgood+1; fi # comment out the next line for dry-run testing $BOGOFILTER -$expect $cfg -d $bogodir -I $fnam fi # echo $expect $got $result, $nspam $rspam, $ngood $rgood n=$(expr \( $nspam + $ngood \) % 10) test $n -eq 0 && \ printf "\r%5d%5d %5d%5d " $nspam $rspam $ngood $rgood done printf "\r%5d%5d %5d%5d\n" $nspam $rspam $ngood $rgood } # Execution begins here... cnt=0; cmd="" cfg='-C' pid=$$ mode=0 # unknown mbox=1 # mbox mode mdir=2 # maildir mode while [ ${#*} -gt 1 ]; do indic=$1 ; shift case "$indic" in s|-s|n|-n) path=$1 ; shift cmd="$cmd -c $indic $path" if [ ! -r $path ]; then echo "file '$path' not found"; usage; fi let cnt=cnt+2 if [ $mode = 0 ] ; then if [ -f $path ]; then # if mbox mode=$mbox else # else maildir mode=$mdir fi fi ;; c|-c) file=$1 ; shift cfg="-c $file" if [ ! -r $file ]; then echo "file '$file' not found"; usage; fi ;; p|-p) pid=$1; shift; ;; d|-d) [ -n "$bogodir" ] && usage bogodir=$1 ; shift if [ ! -d $bogodir ]; then echo "directory '$bogodir' not found"; usage; fi [ ! -f $bogodir/spamlist.db ] && $BOGOFILTER -d $bogodir -s -C < /dev/null [ ! -f $bogodir/goodlist.db ] && $BOGOFILTER -d $bogodir -n -C < /dev/null ;; *) usage esac done # if the first param isn't s or n, treat it as a directory test -z "$bogodir" && bogodir="${HOME}/.bogofilter" # check for an even number of s/n files >= 4 test $cnt -ge 4 || usage let n=$cnt%2 test $n -eq 0 || usage # params may be ok, here goes... # create a shuffled list, with lengths if [ ! -f scram.$pid ] ; then if [ "$mode" = "$mbox" ] ; then # mbox scramble.sh "^From " -l $cmd > scram.$pid else # maildir scramble.sh -d -l $cmd > scram.$pid fi fi if [ "$mode" = "$mbox" ] ; then # mbox train_mbox =cut # Copyright(C) Simon Huggins 2003 # # 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 # # 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 # Yes, it is silly having the license boilerplate take up more space than # the code but it does remove all doubt. use strict; use MIME::Parser; my $parser = new MIME::Parser; $parser->extract_nested_messages(0); $parser->output_to_core(1); # No temporary files my $entity = $parser->parse(\*STDIN); my $found=0; # Loop recursing deeper until we find a message/rfc822 part. my @check_parts = $entity->parts; while (!$found) { foreach my $subent (@check_parts) { if ($subent->effective_type eq "message/rfc822") { print "From invalid\@example.com Mon May 19 18:00:00 2003\n"; my $body = $subent->stringify_body; $body =~ s/^From />From /mg; $body =~ s/\n*$/\n\n/; print $body; $found++; } } if (!$found) { @check_parts = map { $_->parts; } @check_parts; last if ! @check_parts; } } bogofilter-1.2.4/contrib/bogo.R0000644000175000017500000000303512163572305014554 0ustar sezsez# bogo.R - check calculations performed by bogofilter # # Before running this script, # prepare file bogo.tbl as follows: run # bogofilter -R bogo.tbl # where mailbox is a file with only one email message in it. # Then run R and type # source("bogo.R") # first read the data bogo <- read.table("bogo.tbl") attach(bogo) # next read the special values from the last line l <- length(fw) bogoS <- fw[l] s <- invfwlog[l] x <- fwlog[l] md <- as.real(levels(U[l])[3]) # now truncate bogo and reset l to match detach(bogo) bogo[abs(0.5 - bogo$fw) >= md,] -> bogo attach(bogo) l <- length(fw) # next recalculate the fw values from the counts in the table attach(bogo) pw2 <- pbad / (pbad + pgood) pw2[pbad + pgood == 0] <- 0 fw2 <- (s * x + n * pw2) / (s + n) # display fw (calculated by bogofilter) and fw2 and compare print.noquote("R f(w):") print(round(fw2, digits=6)) print.noquote("") print.noquote("Bogofilter f(w):") print(fw) print.noquote("") print.noquote("Difference (R - bogo):") print(round(fw2, digits=6) - fw) # calculate S using fw2 P <- 1 - exp(sum(log(1-fw2))/l) Q <- 1 - exp(sum(log(fw2))/l) Srob <- ( 1 + (P-Q)/(P+Q) ) / 2 S <- pchisq(sum(log(1-fw2)) * -2, 2 * l) H <- pchisq(sum(log(fw2)) * -2, 2 * l) Sfis <- (1 + S - H) / 2 Drob <- abs(Srob - bogoS) Dfis <- abs(Sfis - bogoS) diff <- min(Drob,Dfis) RS <- if(Drob < Dfis) Srob else Sfis # display S as calculated by bogofilter and by R and compare print.noquote("") print.noquote(sprintf( "R S: %8.2e, Bogofilter S: %8.2e, Difference (R - bogo): %10.4e", RS, bogoS, diff)) bogofilter-1.2.4/contrib/bogogrep.c0000644000175000017500000000555212163572305015461 0ustar sezsez/** \file bogogrep.c * * This file emulates GNU grep -ab with a plain text pattern anchored to * the left. The Horspool search was taken from a publicly available * version on the Internet. * * The rest of the program was written by Matthias Andree and is public * domain. */ #include #include #include #include #include #include #include #include #ifndef MAP_FAILED #define MAP_FAILED ((void *) -1) #endif #if !defined(__GNUC__) #define __attribute__(a) #endif #define ALPHABET 256 /* vanilla Boyer-Moore-Horspool */ static const unsigned char *search(const unsigned char *text, const unsigned char *pat, long n) { long i, j, k, m, skip[ALPHABET]; m = strlen((const char *)pat); if (m == 0) return (text); for (k = 0; k < ALPHABET; k++) skip[k] = m; for (k = 0; k < m - 1; k++) skip[pat[k]] = m - k - 1; for (k = m - 1; k < n; k += skip[text[k] & (ALPHABET - 1)]) { for (j = m - 1, i = k; j >= 0 && text[i] == pat[j]; j--) i--; if (j == (-1)) return (text + i + 1); } return (NULL); } static void usage(int rc, const char *tag) __attribute__((noreturn)) ; static void usage(int rc, const char *tag) { fprintf(stderr, "Usage: %s searchstring regular_file [...]\n" "This program searches all lines in regular_file that start with searchstring.\n" "For each match, it prints the byte offset (starting with 0), a colon and the\n" "the matching line.\n", tag); exit(rc); } int main(int argc, char **argv) { int fd; unsigned char *base; const unsigned char *i; struct stat st; int argindex; /* file name in argv[] vector */ int rc = 0; if (argc < 3) usage(1, argv[0]); for(argindex = 2; argindex < argc; argindex++) { if ((fd = open(argv[argindex], O_RDONLY)) < 0) { perror(argv[argindex]); rc = 1; continue; } if (fstat(fd, &st)) { perror(argv[argindex]); close(fd); rc = 1; continue; } if (MAP_FAILED == (base = (unsigned char *)mmap(NULL, st.st_size, PROT_READ, MAP_SHARED, fd, 0))) { perror("mmap"); close(fd); rc = 1; continue; } i = base; while(NULL != (i = search((const unsigned char *)i, (unsigned char *)argv[1], base - i + st.st_size))) { if (i == base || *(i-1) == '\n') { /** \bug FIXME: dead assignments here */ int l = strcspn((const char *)i, "\n"); if (l > base - i + st.st_size) l = base - i + st.st_size; printf("%ld:", (long)(i - base)); (void) fwrite(i, 1, strcspn((const char *)i, "\n"), stdout); if (EOF == puts("")) { perror("stdout"); exit(2); } } i += strlen(argv[1]); } if (munmap((char *)base, st.st_size)) { perror("munmap"); rc = 1; } if (close(fd)) { perror("close"); rc = 1; } } if (fflush(stdout)) { perror("stdout"); rc = 2; } exit(rc); } bogofilter-1.2.4/contrib/stripsearch.pl0000755000175000017500000003313012163572305016371 0ustar sezsez#!/usr/bin/perl -Tw require 5.006_001; use strict; =head1 NAME Stripsearch - where the spam's body gets violated... =cut my $version = "1.0.5"; ################################################ ############### Copyleft Notice ################ ################################################ # Copyright © 2005 Order amid Chaos, Inc. # Author: Tom Anderson # neo+stripsearch@orderamidchaos.com # # This program is open-source software; you can redistribute it # and/or modify it under the terms of the GNU General Public # License, v2, as published by the Free Software Foundation. # # 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: # # Free Software Foundation # 59 Temple Place, Suite 330 # Boston, MA 02111-1307 USA # # http://www.gnu.org/ ################################################# ################# Documentation ################# ################################################# # use "perldoc stripsearch" or "stripsearch -h" to read this =head1 SYNOPSIS =head2 Command line usage: B [I] < [I] =head2 Procmail usage (recommended): Add to ~/.procmailrc the following recipe, where I<$HOME> is your home directory, if not set in the environment: :0 { :0 fbw | $HOME/.bogofilter/stripsearch # filter through bogofilter, tagging as spam # or not and updating the word lists :0 fw | bogofilter -uep } =head2 Command line options: =over 4 =item B display this help file =item B display benchmarking info =back =head1 REQUIRES =over 4 =item * Perl 5.6.1 =item * MIME::QuotedPrint =item * Benchmark =back =head1 DESCRIPTION Stripsearch investigates the body of your emails for evidence of spamvertized URLs by looking them up in a Realtime BlockList (RBL) such as surbl.org or spamhaus.org. Any matching URLs are then replaced by the token SPAM-ADDRESS as a hook for statistical filters, and a link to look up the domain in a list checker such as the one at rulesemporium.com. This serves the double purpose of making it less likely to click on a phishing scam or illegitimate unsubscribe link, and also making it more likely that the email will be flagged as spam. This should especially help to classify those spams which consist of just a linked image and no text, or a phishing scam posing as a company with which you have regular correspondance such as, perhaps, eBay, PayPal, or your bank. If a domain is not listed in a URIBL, a further test is performed on HTML emails. The HREF link is compared to the content enclosed by the tag, and if there is a domain in the content, and it does not match the domain of the link, then the token SCAM-ADDRESS is added to indicate that the address shown is not the address to which the link connects. There may be occasions where this is proper, but in most cases, this technique is used for phishing or fraud. Stripsearch does not remove any information from emails. It only adds flags to them. If an address is flagged inappropriately, little harm is done. These tokens alone shouldn't cause a ham message to be misclassified by a statistical filter as there should be many other hammy tokens to offset it. However, it is quite effective at making spams that are otherwise right on the border, or having very few overall tokens, classify correctly as spam. =head1 FAQ =head2 Ask a question Ye may receive an answer here if it is asked frequently =head1 BUGS =over 4 =item * Please report any. =back =head1 TODO =over 4 =item * Detect MIME headers and only parse text or html parts =item * Suggestions welcome. =back =head1 SEE ALSO =over 4 =item * L =item * L =back =head1 AUTHOR Tom Anderson =cut ################################################# ############### User Variables ################# ################################################# # please edit according to your setup # default path our $path = "/bin:/usr/bin:/usr/local/bin"; # default shell our $shell = "/bin/sh"; # seconds before we bail waiting on input our $timeout = 30; # maximum lines per email to parse # this may break large attachments so set it high our $maxlines = 100000; # server to use for URIBL lookups (separate multiple servers by a comma or semi-colon) our $uribl_server = "multi.surbl.org;sbl-xbl.spamhaus.org"; # URL to lookup spamvertized URL (use [DOMAIN] for domain holder in lookup URLs) our $lookup = "http://www.rulesemporium.com/cgi-bin/uribl.cgi?domain0=[DOMAIN]&bl0=0"; # of course, modify the first line of this file, # the shebang, to point to your perl interpreter # do not edit below this line unless you really # know what you're doing ################################################# ############## Include Libraries ################ ################################################# #use MIME::QuotedPrint; use Benchmark; ################################################# ############## Default Globals ################## ################################################# $> = $<; # set effective user ID to real UID $) = $(; # set effective group ID to real GID # Make %ENV safer delete @ENV{qw(IFS CDPATH ENV BASH_ENV PATH SHELL)}; # Set the environment explicitely $ENV{PATH} = $path; $ENV{SHELL} = $shell; # options flags our $options = ""; # define the control-linefeed syntax for this system our $CRLF = "\n"; #($^O=~/VMS/i)? "\n": # VMS #("\t" ne "\011")? "\r\n": # EBCDIC # "\015\012"; # others our $lastline = ""; ################################################ ##################### Main ##################### ################################################ # process options if (defined @ARGV && $ARGV[0] =~ /h/) { my $stripsearch = $1 if $0 =~ /^([\w\/.\-~]*)$/; system("perldoc $stripsearch"); exit(0); } if (defined @ARGV && $ARGV[0] =~ /b/) { $options .= "b"; } # output benchmarking info # start timing the process my $start_time = new Benchmark if $options =~ /b/; # get STDIN and process the email eval { # set an alarm so that we don't hang on an empty STDIN local $SIG{ALRM} = sub { die "timeout" }; alarm $timeout; # do the search my $body = disrobe(); # cancel timeout if we got this far alarm 0; print $body; }; # propagate errors die if $@ && $@ !~ /timeout/i; # print timeout message if ($@ =~ /timeout/i) { error("die","Timed out... make sure to supply an email for processing. Try 'stripsearch -h' for details.\n"); } # calculate total running time if ($options =~ /b/) { my $end_time = new Benchmark; my $td = timediff($end_time, $start_time); my $usr = $td->[1]+$td->[3]; my $sys = $td->[2]+$td->[4]; my $cpu = $usr+$sys; my $wall = $td->[0]; print "Total stripsearch running time was $wall wallclock secs; $usr usr + $sys sys = $cpu CPU secs.$CRLF"; } exit(0); ################################################ ############# Search Body for URIs ############ ################################################ sub disrobe { my $body = ""; my $count = 0; while () { $body .= $_; last if $count > $maxlines; } $body = inspect($body); return $body; } ################################################ ############# Parse Lines for URIs ############ ################################################ sub inspect { my $body = shift; # heuristics my $DOMAIN = qr~[A-Za-z](?:\w|-|\.)+\.\w{2,4}~is; my $IP = qr~(?:\d{1,3}\.){3}\d{1,3}~is; my $LUSER = qr~(?:\w|-|\.)+?~is; my $EMAIL = qr~$LUSER\@(?:$DOMAIN|$IP)~is; my $LINK = qr~<\s*a\s+[^>]*href\s*=\s*['"]?~is; my $PROTOCOL = qr~(?:ht|f)tps?:\/\/~is; my $DIRS = qr~\/(?:[^\/\\;:,{}\[\]()'"<>]*?\/)*~is; my $FILE = qr~[^\/\\;:,{}\[\]()<>'"[:space:]]+~is; my $ENDTAG = qr~['" ]?.*?>~is; my $ENDURL = qr~[,.;:<>{}\[\]()[:space:]'"]~is; my $CONTENT = qr~.*?~is; my $CLOSETAG = qr~<\s*\/\s*a\s*>~is; # unencode quoted-printable #$body = decode_qp($body) if $body =~ /Content-Transfer-Encoding: quoted-printable/i; # tag HTML links $body =~ s/($LINK)($PROTOCOL)?($IP|$DOMAIN)($DIRS)?($FILE)?($ENDTAG)($CONTENT)($CLOSETAG)/tag_uri($1,$2,$3,$4,$5,$6,$7,$8)/egis; # tag bare URLs (variable-width look-behinds would be good here) $body =~ s/(?\n" : "\n"; # if it's spam, replace the URI with a flag return "$br $br SPAM-ADDRESS: $proto$domain$dirs$file $br $domain_lookup $br $br $content " if listed($root_domain) || listed(host($root_domain)); # if the link and content domains don't match, replace the URI with a flag return "$br $br SCAM-ADDRESS: $proto$domain$dirs$file $br $content $br $br" if $content && get_domain($content) && (get_domain($content) !~ /(^|\.)$root_domain$/i); # otherwise pass it along normally return $link.$proto.$domain.$dirs.$file.$endtag.$content.$closetag; } sub listed { my $target = shift; my $output = ""; my $server = $uribl_server; # reverse IP order to conform to standard $target = "$4.$3.$2.$1" if $target =~ /(\d{1,3})\.(\d{1,3})\.(\d{1,3})\.(\d{1,3})/; while ( $server =~ s/^([^;,]+)(?:;|,|$)//is && $target && !$output) { my $lookup = $target . "." . $1; open (HOST, "host -t a $lookup 2>/dev/null |") or error("warn","Host lookup failed: $!"); while () { $output = $1 if /has address ([0-9.]+)/; } close HOST; } return $output; } sub host { my $target = shift; my $output = ""; my $IP = qr~(?:\d{1,3}\.){3}\d{1,3}~; my $DOMAIN = qr~[\w|-|\.]+\.\w{2,4}~; if ($target =~ s/($IP|$DOMAIN)/$1/) { open (HOST, "host $target 2>/dev/null |") or error("warn","Host lookup failed: $!"); while () { $output = $1 if /$DOMAIN (?:domain name pointer|has address) ($IP|$DOMAIN)\.?/; } close HOST; } return $output; } sub get_domain { my $text = shift; # heuristics my $DOMAIN = qr~(?:\w|-|\.)+\.\w{2,4}~; my $IP = qr~(?:\d{1,3}\.){3}\d{1,3}~; my $PROTOCOL = qr~(?:ht|f)tp(?:s?):\/\/~; return ($text =~ /(?> 8) if $waitedpid; $SIG{$sig} = \&sig_trap; error ($action,"Trapped signal SIG$sig$more"); } ################################################ ################################################ ################################################ bogofilter-1.2.4/contrib/README.contrib0000644000175000017500000000350612163572305016025 0ustar sezsezFiles in this directory ~~~~~~~~~~~~~~~~~~~~~~~ README.contrib - the file you are now reading. QDBM-transactions.patch - a patch to teach QDBM to use transactions, to show how QDBM transaction enhancements might look like. bfproxy.pl - performs bogofilter functions via email bogo.R - Script to check calculations performed by bogofilter. bogofilter-milter.pl - Sendmail::Milter Perl script for filtering mail using individual users' bogofilter databases. bogogrep.c - This file emulates GNU grep -ab with a plain text pattern anchored to the left. bogominitrain.pl - Script for training to exhaustion from mbox, see FAQ. dot-qmail-bogofilter-default - Sample .qmail or .qmail-default file to go along with ... bogofilter-qfe.sh - Qmail specific bogofilter frontend script which allows the use of a centralized bogofilter running on an smtp mail server. mailfilter.example - Sample maildrop configuration file. mime.get.rfc822.pl - Perl script to extract message/rfc822 attachments into an mbox. parmtest.sh - Script to test a bogofilter option. printmaildir.pl - Converts a Maildir to mbox format. procmailrc.example - Sample .procmailrc file. randomtrain.sh - Script to train on error with random order from mbox, see FAQ. Comes with (and uses) ... scramble.sh - Script needed by randomtrain. spamitarium.pl - helps to remove unnecessary noise from email headers and to highlight just the portions which contribute positively to spam filtering using statistical methods. stripsearch.pl - Stripsearch investigates the body of your emails for evidence of spamvertized URLs by looking them up in a Realtime BlockList (RBL) such as surbl.org or spamhaus.org. trainbogo.sh - Script to train from qmail maildirs. vm-bogofilter.el - An interface between the VM mail reader and the bogofilter spam filter. bogofilter-1.2.4/contrib/procmailrc.example0000644000175000017500000000373412163572305017221 0ustar sezsez# $Id: procmailrc.example 4328 2004-04-13 00:15:29Z relson $ # # procmailrc.example # # This is a sample procmail setup file that # 1 - retains an unprocessed copy of all incoming mail # 2 - diverts incoming mail with asian character sets # 3 - runs bogofilter # 4 - retains a processed copy of all messages identified as spam. # 5 - retains a processed copy of all messages identified as unsure. # ### bogofilter - filter & update word lists MAILDIR=/var/spool/mail BOGOFILTER_DIR=/var/spool/bogofilter #### testing #### ## MAILDIR=/tmp/mail ## MAILDIR=/home/user/filter/korean.spam/mail ## procmail procmailrc < input.file ; echo $? ; ll -t $MAILDIR | head #### end testing #### #### backup #### :0c: mail.backup #### ## Silently drop all completely unreadable mail :0: * 1^0 ^\/Subject:.*=\?(.*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987|windows-1251|windows-1256)\? * 1^0 ^\/Content-Type:.*charset="(.*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987|windows-1251|windows-1256) spam-unreadable #### #### bogofilter passthrough-update #### :0fw | bogofilter -p -u -l -e -v # -p)assthrough -u)pdate, -l)og -e)xitcode 0 for spam and ham # -v)erbose #### begin error catcher #### # m-a 2002-10-28 # If bogofilter failed, return the mail to the queue. # Better put this after _EACH_ delivering recipe (not shown here). # Later, the MTA will try again to deliver it. # 75 is the value for EX_TEMPFAIL in /usr/include/sysexits.h # # Originally published by Philip Guenther on the postfix-users # mailing list. :0e { EXITCODE=75 HOST } #### end error catcher #### :0c: * ^X-Bogosity: (Spam|Yes) spam-bogofilter # put copy error catcher here to avoid fallthrough # unnecessary in twostate mode: :0c: * ^X-Bogosity: Unsure unsure-bogofilter # put another copy of error catcher here to avoid fallthrough #### end bogofilter passthrough-update #### #### SpamAssassin #### # :0c: # * ^X-Spam-Status: Yes # spam-spamassassin #### end SpamAssassin #### bogofilter-1.2.4/contrib/vm-bogofilter.el0000644000175000017500000003556212163572305016613 0ustar sezsez;;; vm-bogofilter.el version 1.1.4 ;; ;; An interface between the VM mail reader and the bogofilter spam filter. ;; ;; This file is in Unicode charset, with UTF-8 encoding. ;; ;; Copyright (C) 2003-2006 by Björn Knutsson ;; ;; Home page: http://www.cis.upenn.edu/~bjornk/ ;; ;; Bjorn Knutsson, CIS, 3330 Walnut Street, Philadelphia, PA 19104-6389, USA ;; ;; ;; Based on vm-spamassassin.el v1.1, Copyright (C) 2002 by Markus Mohnen ;; ;; ;; 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., 675 Mass Ave, Cambridge, MA 02139, USA. ;; ;;; Version history: ;; v 1.1.4: Change in the way bogofilter is called ;; * No longer uses formail to process mails ;; * Slightly improved error handling ;; v 1.1.3: Minor edits ;; * Documentation updates ;; * Error checking for bogofilter calls. ;; * vm-bogofilter-delete-spam variable. ;; Set to cause spam to be automatically deleted. ;; * vm-bogofilter-setup function. ;; Automatically called on loading, but can be called again ;; to re-initialize the vm-bogofilter setup ;; v 1.1.2: Borg assimilation version (12-Sep-2003) ;; * Great minds think alike. Olivier Cappe independently ;; created his own version of vm-bogofilter.el based on ;; vm-spamassassin.el with the same basic functions. ;; He submitted a patch to my version to harmonize them. ;; * Added comment about vm-delete-after-archiving, as suggested ;; by Olivier. ;; v 1.1.1: minor edits ;; * Chris McMahan submitted a patch that disables running ;; bogfilter on incoming mail. While at first potentially ;; confusing, this means that you can run bogofilter via ;; e.g. procmail filters, and then use vm-bogofilter.el to ;; (re-)educate bogofilter about false positives/negatives. ;; * Documentation of a folder problem added ;; v 1.1: functional update ;; * Changed re-training functions to also re-tag the the message ;; in the VM folder, thus making the tag on the message in VM ;; be consistent with bogofilter's opinion about the message. ;; Notice!! If you use the tag in the message, you should be ;; aware that a message re-classified as spam may still not ;; be tagged as spam by bogofilter, and vice versa, if the ;; bogofilter database contains too many counter-examples. ;; The old re-training functions are still present, if you ;; prefer not to muck around with your inbox. They've been ;; renamed vm-bogofilter-is-spam-old/vm-bogofilter-is-clean-old ;; and works as before. ;; v 1.0.1: update ;; * Very minor edits of texts, no functional changes. ;; v 1.0: initial release ;; * First release, based on Markus Mohnen's vm-spamassassin ;; ;; ;; To use this program, you need reasonably recent versions of VM from ;; http://www.wonderworks.com/vm) and bogofilter from ;; http://sourceforge.net/projects/bogofilter/ ;; ;; This version of the interface has been developed for, and tested ;; with, VM version 7.17 and later, and bogofilter version 0.17.4 and ;; later. Some features used /require/ bogofilter version 0.15.0 and ;; later but no testing of versions earlier than 0.17.4 has been done. ;; It has been tested with bogofilter versions up to 0.93.2 ;; ;; (Former RMAIL-users should read the BUGS-note about the BABYL-format) ;; ;;; Installation: ;; ;; Put this file on your Emacs-Lisp load path and add following into your ;; ~/.vm startup file ;; ;; (require 'vm-bogofilter) ;; ;; ;;; Usage: ;; ;; Whenever you get new mail bogofilter will be invoked on them. Mail ;; detected as spam will be tagged by bogofilter, and you can use ;; existing mechanisms to dispose of them. ;; ;; For example, if you append this line to your .vm (or modify your ;; existing auto-folder-alist), you could then have messages tagged as ;; spam automatically saved in a separate 'spam' folder: ;; ;; (setq vm-auto-folder-alist '(("^X-Bogosity: " ("Yes," . "spam")))) ;; ;; If you want your auto-folder to be used every time you've received ;; new mail, just add the following to your .vm: ;; ;; (add-hook 'vm-arrived-messages-hook 'vm-auto-archive-messages) ;; ;; You can also set (setq 'vm-delete-after-archiving t) to make VM ;; automatically delete archived spams from the main folder. ;; ;; ;; If a message is tagged as spam incorrectly, you can re-train ;; bogofilter by calling the function vm-bogofilter-is-clean on that ;; message. Similarly, calling vm-bogofilter-is-spam will re-train ;; bogofilter to recognize a clean-marked message as spam. ;; ;; These functions can be bound to keys in your .vm, for example: ;; ;; (define-key vm-mode-map "K" 'vm-bogofilter-is-spam) ;; (define-key vm-mode-map "C" 'vm-bogofilter-is-clean) ;; ;; would define K (shift-k) as the key to declare the current message ;; as spam, while C (shift-c) as the key to declare the current ;; message as clean. ;; ;; Re-training with the old functions (still available) would not ;; re-tag messages, while the new ones will. Re-training may or may ;; not change the spam-status of a message. Because of the way ;; bogofilter works, even a message explicitly declared as spam may ;; not be tagged as spam if there are enough similar non-spam ;; messages. Remember, bogofilter is not trained to recognize ;; individual messages, but rather patterns. You may have to train ;; bogofilter on a number of spam messages before it recognizes any of ;; them as spam. See the documentation for bogofilter. Notice also ;; that even if the tag changes, this will not undo actions previously ;; taken based on the tag, e.g. moving spam to a spamfolder with ;; auto-folders. ;; ;; If you have a small database, running bogofilter without '-u' may ;; be better in the beginning. If you want to run without '-u', it ;; can easily be accomplished. Just: ;; ;; M-x customize vm-bogofilter ;; ;; Then change the Program Options to just '-p -e' and the Unspam to ;; '-n' and Spam to '-s'. ;; ;; Now, bogofilter will not auto-train, and you must instead use the ;; vm-bogofilter-is-spam and vm-bogofilter-is-clean to manually tag ;; messages. (If you've bound them to keys, it will be quite simple.) ;; ;;; BUGS: ;; ;; One know bug is that formail will not like it if the input is not ;; in the format it expects and knows. Even though it's supposed to ;; know BABYL, this does not work. ;; ;; A related problem is that if you have the wrong folder type ;; selected, then sometimes, VM will merge messages. You can check the ;; raw folder to see if you have a blank line before the "From "-line ;; separating messages. See the documentation for vm-default-folder-type ;; ;; vm-bogofilter is not very smart about errors. If an error occurs ;; during any operation that tags or re-tags messages, the message(s) ;; being processed will be *lost*. If errors occur during initial ;; processing, the lost mails can sometimes be recovered since VM will ;; save the folder *after* receiving new mails, but *before* ;; processing hooks, e.g. vm-bogofilter. If you notice the errors ;; before saving the folder, you can copy the old file, close VM, ;; rename your copy to the original folder name and then start VM ;; again. Naturally, anything that happened to the folder after ;; fetching new mail will be lost, e.g. bogofilter tagging etc. ;; ;;; Customization: ;; ;; M-x customize RET vm-bogofilter ;;; Code: (eval-when-compile (require 'vm)) ;;; Customisation: (defgroup vm-bogofilter nil "VM Spam Filter Options" :group 'vm) (defcustom vm-bogofilter-program "bogofilter" "*Name of the bogofilter program." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-program-options "-u -p -e" "*Options for the bogofilter program. Since we use bogofilter as a filter, '-p' must be one of the options, while '-e' tells bogofilter that it is embedded, and thus should not signal spam/ham with return values. * The flag '-u' controls if bogofilter automatically learns from its own classification. You may not want to use this flag if bogofilter still is learning to classify, or if you do not have the discipline to correct every mis-classification." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-program-mbox "-M" "*Options for the bogofilter program. This flags tells bogofilter how to process mailboxes, i.e., multiple messages." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-program-options-unspam "-Sn" "*Options for the bogofilter program when declaring a spam-marked message as clean. The default, '-Sn', assumes that bogofilter already has trained itself on the message, e.g. by running it with '-u' during classification. If this is the initial training, use '-n' instead." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-program-options-spam "-Ns" "*Options for the bogofilter program when declaring a clean-marked message as spam. The default, '-Ns', assumes that bogofilter already has trained itself on the message, e.g. by running it with '-u' during classification. If this is the initial training, use '-s' instead." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-program-options-reclassify "-p -e" "*Options for the bogofilter program when declaring a clean-marked message as spam. *See vm-bogofilter-program-options for a discussion of the options." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-formail-program "formail" "*Name of the program used to split a sequence of mails." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-formail-program-options "-s" "*Options for the 'vm-bogofilter-formail-program'. After this arguments, the name of the bogofilter program will be passed." :group 'vm-bogofilter :type 'string) (defcustom vm-bogofilter-invoke-through-vm t "*When true, bogofilter will be invoked through the vm-retrieved-spooled-mail-hook. If you have procmail or some other MTA configured to filter through bogofilter already, then set this to nil to speed vm-startup. *NOTE: This variable is only consulted on startup, so if you change it, it will take effect the next time vm-bogofilter is loaded, or vm-bogofilter-setup is called." :group 'vm-bogofilter :type 'boolean) (defcustom vm-bogofilter-delete-spam nil "*When true, mark messages for deletion when reclassifying as spam. *NOTE: This does not affect the initial classification, only when messages are explicitly marked as spams by the vm-bogofilter-is-spam function." :group 'vm-bogofilter :type 'boolean) (defun vm-bogofilter-arrived-message () "The function used to do the actual filtering. It is used as a value for vm-retrieved-spooled-mail-hook." (save-excursion (vm-save-restriction (let ((tail-cons (vm-last vm-message-list)) (buffer-read-only nil)) (widen) (if (null tail-cons) (goto-char (point-min)) (goto-char (vm-text-end-of (car tail-cons))) (beginning-of-line) (forward-line) ) (message "Filtering new messages... ") (let ((res (call-process-region (point) (point-max) (or shell-file-name "sh") t t nil shell-command-switch (concat vm-bogofilter-program " " vm-bogofilter-program-options " " vm-bogofilter-program-mbox)))) (if (and res (not (and (integerp res) (zerop res)))) (error "Something went wrong filtering new messages (exit %s)" res) (delete-region (point) (point-max)))) (message "Filtering new messages... done.") ) ) ) ) (defun vm-bogofilter-is-spam-old () "Declare that a clean-marked message is spam" (interactive) (vm-follow-summary-cursor) (vm-pipe-message-to-command (concat vm-bogofilter-program " " vm-bogofilter-program-options-spam) nil) ) (defun vm-bogofilter-is-clean-old () "Declare that a spam-marked message is clean" (interactive) (vm-follow-summary-cursor) (vm-pipe-message-to-command (concat vm-bogofilter-program " " vm-bogofilter-program-options-unspam) nil) ) (defun vm-bogofilter-is-spam () "Declare that a clean-marked message is spam, and re-tag message" (interactive) (vm-bogofilter-retag "spam" vm-bogofilter-program-options-reclassify vm-bogofilter-program-options-spam) (if vm-bogofilter-delete-spam (vm-delete-message 1)) ) (defun vm-bogofilter-is-clean () "Declare that a spam-marked message is clean, and re-tag message" (interactive) (vm-bogofilter-retag "clean" vm-bogofilter-program-options-reclassify vm-bogofilter-program-options-unspam) ) ;; Based on vm-pipe-message-to-command (defun vm-bogofilter-retag (text switch &optional switch2) "Workhorse function for re-tagging of messages." (vm-follow-summary-cursor) (vm-select-folder-buffer) (vm-check-for-killed-summary) (vm-error-if-folder-read-only) (vm-error-if-folder-empty) (save-excursion (let ((message (vm-real-message-of (car vm-message-pointer))) (buffer (get-buffer-create "*Shell Command Output*")) ) (save-excursion (set-buffer buffer) (erase-buffer)) (set-buffer (vm-buffer-of message)) (vm-save-restriction (vm-save-buffer-excursion (widen) (goto-char (vm-headers-of message)) (narrow-to-region (point) (vm-text-end-of message)) (message "Re-classifying message as %s." text) (if (not (eq switch2 nil)) (progn (call-process-region (point-min) (point-max) (or shell-file-name "sh") nil buffer nil shell-command-switch (concat vm-bogofilter-program " " switch2) ) (message "Message re-classified as %s, updating tag." text) )) (let ((buffer-read-only nil) (buffer (get-buffer-create "*Shell Command Output*"))) (call-process-region (point-min) (point-max) (or shell-file-name "sh") nil t nil shell-command-switch (concat vm-bogofilter-program " " switch) ) (delete-region (point) (vm-text-end-of message))) (vm-discard-cached-data) (message "Message re-classified and tagged as %s." text) (vm-preview-current-message) (vm-update-summary-and-mode-line) ))))) ;;; Hooking into VM (defun vm-bogofilter-setup () "Initialize vm-bogofilter." (interactive) (if vm-bogofilter-invoke-through-vm (add-hook 'vm-retrieved-spooled-mail-hook 'vm-bogofilter-arrived-message) (remove-hook 'vm-retrieved-spooled-mail-hook 'vm-bogofilter-arrived-message))) (vm-bogofilter-setup) (provide 'vm-bogofilter) ;;; vm-bogofilter.el ends here bogofilter-1.2.4/contrib/README.randomtrain0000644000175000017500000000474212163572305016706 0ustar sezsezIt seems that training bogofilter on its errors _only_ is a very good way to train, at least with the Robinson-Fisher or Bayes chain rule calculation methods. The way this works is: messages from the training corpus are picked at random (without replacement, ie no message is used more than once) and fed to bogofilter for evaluation. If bogofilter gets the classification right, nothing further is done. If it's wrong, or uncertain if ternary mode is in use, then the message is fed to bogofilter again with the -s or -n option, as appropriate. That's all very well, except that it's not an easy process to execute with just a couple of shell commands. I've now written a bash script that does the job [Matthias Andree: this has been changed so it may now work on a regular POSIX compliant sh, too, feedback is welcome]; you give it the directory in which to build the bogofilter database, and a list of files flagged with either -s or -n to indicate spam or nonspam, and it performs training-on-error using all the messages in all the files in random order. My production version of bogofilter returns the following exit codes: 0 for spam 1 for nonspam 2 for uncertain 3 for error Normal bogofilter returns (I think) 0 for spam 1 for nonspam 2 for error This script will work with either. You can use it to build from scratch; the first message evaluated will return the error exit code, and randomtrain (as this script is called) will train with that message, thus creating the databases. The script needs rather a lot of auxiliary commands (they're listed in the comments at the top of the file); in particular, perl is called for the randomization function. (The embedded perl script is "useful" in its own right: it takes text on standard input and returns the lines in random sequence.) Known portability issue: on HP-UX (10.20 at least), grep -b returns a block offset instead of a byte offset, so randomtrain won't work unless gnu grep is substituted for the HP-UX one. I rebuilt my training lists with randomtrain. The training corpus consists of 9878 spams and 7896 nonspams. The message-counts from bogoutil -w bogodir are 1475 and 408. The database sizes from full training were 10 and 4 Mb; randomtrain produced .db files of 7 and 1.2 Mb. I don't yet have figures comparing discrimination by bogofilter with these two training sets, but yesterday's smaller-scale test (which motivated me to write this script) clearly indicated an improvement could be expected. Greg Louis bogofilter-1.2.4/contrib/dot-qmail-bogofilter-default0000644000175000017500000000004412163572305021066 0ustar sezsez|/home/bogofilter/bogofilter-qfe.sh bogofilter-1.2.4/contrib/mailfilter.example0000644000175000017500000000261312163572305017211 0ustar sezsez# $Id: mailfilter.example 4899 2004-10-30 19:54:26Z relson $ # # mailfilter.example # # This is a sample maildrop configuration file which shows some ways # of running bogofilter from maildrop. ### bogofilter - filter & update word lists MAILDIR=/var/spool/mail BOGOFILTER_DIR=/var/spool/bogofilter #### backup #### cc "mail.backup" #### ## Silently drop all completely unreadable mail into separate folder if (/^Subject:.*=\?(.*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987|windows-1251|windows-1256)\?/ || /^Content-Type:.*charset="(.*big5|iso-2022-jp|ISO-2022-KR|euc-kr|gb2312|ks_c_5601-1987|windows-1251|windows-1256)/) to "spam-unreadable" #### #### bogofilter passthrough-update #### xfilter 'bogofilter -p -u -l -e -v' # if spam, file this into the "spam-bogofilter" folder and exit # processing if (/^X-Bogosity: (Spam|Yes)/) to "spam-bogofilter" # if unsure, copy this into the "spam-bogofilter" folder and # CONTINUE processing if (/^X-Bogosity: Unsure/) cc "unsure-bogofilter" #### end bogofilter passthrough-update #### #### SpamAssassin #### # if spamassassin detects spam (this example assumes spamd is running), # teach bogofilter about it (avoiding to register spamassassin markup) # and store it to spam-spamassassin xfilter "/usr/bin/spamc" if (/^X-Spam-Status: YES/) { cc "|/usr/bin/spamassassin -d -L|bogofilter -s" to "spam-spamassassin" } #### end SpamAssassin #### bogofilter-1.2.4/contrib/printmaildir.pl0000755000175000017500000000200212163572305016532 0ustar sezsez#! /usr/bin/perl -w # printmaildir.pl -- (C) 2003 by Matthias Andree # This program reads a Maildir and prints in in UNIX mbox format on # stdout. It is redistributable in accordance to the terms of the # GNU GENERAL PUBLIC LICENSE V2 use strict; use POSIX; sub read_dir($ ) { my $dir = shift; my @list = (); my $d; foreach $d (qw/cur new/) { opendir(DIR, $dir . "/$d") || die "can't opendir $dir/$d: $!"; push @list, grep { ! /^\./ && $_ =~ s|^|$dir/$d/|; } readdir(DIR); closedir DIR; } foreach (@list) { if (open F, $_) { my $head = ; my $last = $head; if ($head !~ /^From /) { print "From unknown\@example.invalid ", POSIX::ctime(time); } print $head; while() { $last = $_; if (/^From /){ print ">$_"; } else { print $_; } } if ($last !~ /\n$/) { print "\n"; } close F; } else { # open failed warn "can't open $_: $!"; } } } if (!@ARGV) { unshift @ARGV, "."; } foreach(@ARGV) { read_dir $_; } bogofilter-1.2.4/contrib/bogofilter-milter.pl0000644000175000017500000012666012163572305017500 0ustar sezsez#!/usr/bin/perl # $Id: bogofilter-milter.pl 6902 2010-04-08 04:07:24Z relson $ # # bogofilter-milter.pl - a Sendmail::Milter Perl script for filtering # mail using individual users' bogofilter databases. # # (additional information below the coypright statement) # Copyright 2003, 2005, 2007, 2008, 2010 Jonathan Kamens # . Please send me bug reports, # suggestions, criticisms, compliments, or any other feedback you have # about this script! # # The current version of this script and extensive additional # documentation are available from # . # # 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 will need the following non-standard Perl modules installed to # use this script: Sendmail::Milter, Mail::Alias, Proc::Daemon, # IO::Stringy, Socket, Net::CIDR. Before using this script, search # for CONFIGURABLE SETTINGS and configure them appropriately for your # site. # # Inserts "X-Bogosity: Spam, tests=bogofilter" into messages that # appear to be spam (or "Ham" or "Unsure" into ones that don't). If # the message is rejected, you usually won't see the "Spam", but see # below about training mode. # # Save this script somewhere, launch it as root (by running it in the # background or invoking it with "--daemon" in which case it will # background itself), and reconfigure your sendmail installation to # call it as an external filter (probably by calling INPUT_MAIL_FILTER # in your sendmail.mc file). Running this script as root should be # safe because it changes its effective UID and GID whenever # performing operations on individual users' files (if you find a # security problem, please let me know!). # # NOTE: You will want to take steps to ensure that this script is # started before sendmail whenever your machine boots, e.g., by # creating an appropriate script in /etc/rc.d/init.d with appropriate # links to it in /etc/rc.d/rc?.d, because once you configure sendmail # to talk to a particular milter, it may refuse to deliver email if # that milter isn't running when the email comes in. # # For additional information about libmilter and integrating this or # any other libmilter filter into your sendmail installation, see the # file README.libmilter that ships with sendmail and/or the section # entitled "ADDING NEW MAIL FILTERS" in the README file that ships # with the M4 sendmail CF templates. # # You may need to restart this script to get it to notice changes in # mail aliases. # This script logs various informational, warning and error messages # to the "mail" facility. # Thanks to Tom Anderson # for the IP whitelisting changes and for several other useful # suggestions and bug fixes. # BEGIN CONFIGURABLE SETTINGS # If this string appears in the Subject of a message (case # insensitive), the message won't be filtered. my $magic_string = '[no-bogofilter]'; # Set the syslog facility you wish to log messages to. my $log_facility = 'LOG_MAIL'; # These settings control exactly what error sendmail sends back to the # sender if a message is rejected. You can leave them as-is, or # customize them as desired. my $rcode = 550; # three-digit RFC 821 SMTP reply my $xcode = "5.7.1"; # extended RFC 2034 reply code my $reject_message = "Your message looks like spam.\n" . "If it isn't, resend it with $magic_string " . "in the Subject line."; # Whitelist any IP addresses or ranges from this filter. # For example: #my(@whitelist) = ("127.0.0.1", "10.127.0.1-10.127.0.9", "192.168.0.0/16"); my(@ip_whitelist) = (); # If you want to whitelist any addresses which have authenticated # via poprelayd (i.e. remote workstations of users on your server) # set $dbfile to your popip.db location, else set it to undef. # For example: #my $ip_whitelist_db = "/etc/mail/popip.db"; my $ip_whitelist_db = undef; # The largest message to keep in memory rather than writing to a # temporary file. my $MAX_INCORE_MSG_LENGTH = 1000000; my $pid_file = '/var/run/bogofilter-milter.pid'; # Whatever path you specify for $socket needs to match the socket # specified in the sendmail.cf file (with "local:" in front of it # there, but not here). my $socket = '/var/run/bogofilter-milter.sock'; # The following two settings give more granular control over whether # bogofilter is used for any particular user and what configuration # settings are used when it is. # - If $bogofilter_cf is set, then the script will look for a file # with that name in the user's home directory. If it finds it, then # bogofilter will be called with "-c $HOME/$bogofilter_cf" so that the # specified configuration file is used rather than the default, # .bogofilter.cf. # - If $require_cf is true, then the specified configuration file # *must* exist for bogofilter to be used for this user. In other # words, rather than only looking for the .bogofilter subdirectory of # the user's home directory, the script will look for both the # .bogofilter subdirectory *and* the config file. # - Note that $require_cf is ignored if $bogofilter_cf is unset. my $bogofilter_cf = undef; my $require_cf = undef; # If you would like the milter to add a unique ID to the X-Bogosity # line, then set this variable to true. ", milter_id=..." will be # added to the end of the X-Bogosity line. my $add_unique_id = 1; # If a file with this name exists in the user's .bogofilter directory, # then it is assumed to contain regular expressions, one per line, to # match against Subject lines in incoming messages (lines containing # only whitespace and lines starting with "#" are ignored). Any # message whose Subject line matches one of the regular expressions # will not be filtered, just as if $magic_string (see above) had # appeared in its Subject line. my $subject_filter_file = 'milter-subject-filters'; # If an executable file or link with this name exists in the user's # .bogofilter directory, and it is owned by the user or root (for # security reasons), then it will be used as a filter, i.e., the # message will be fed into it and replaced with its output, before # bogofilter is run on it, if it returns a zero exit status. # Furthermore, the filtered message is what will be put into the # $archive_mbox and $ham_archive_mbox files. However, the actual # message delivered by the MTA if the milter accepts it will be the # unfiltered version, not the filtered version. You could use this, # e.g., to reformat incoming email with a script that calls # spamitariuim.pl (in bogofilter contrib directory) before filtering # it. # # The following environment variables are available to the script when # it is executed: # # MILTER_REMOTE_IP IP address of remote SMTP server # MILTER_REMOTE_NAME Host name of remote SMTP server as per a # reverse DNS lookup on its IP address # MILTER_LOCAL_IP IP address of SMTP server receiving the # message # MILTER_LOCAL_NAME Host name of SMTP server receiving the message # MILTER_HELOHOST Host name specified by the remote server in # its HELO or EHLO command # MILTER_ENVFROM The envelope address of the sender of the # message, a.k.a., the Return-Path # MILTER_ENVRCPT The envelope address of the recipient of the # message for whom bogofilter is being invoked. # # If you want to disable this functionality, set the variable to # undef. my $filter_script = 'milter-filter-script'; # If a file with this name exists in the user's .bogofilter directory, # then that user's mail will be filtered in training mode. This means # that the message will be filtered and registered as spam or non-spam # and the appropriate X-Bogosity header will be inserted, but it'll be # delivered even if bogofilter thinks it's spam. This allows the user # to detect false positives or false negatives and feed them back into # bogofilter to train it. To disable this functionality set # $training_file to undef. my $training_file = 'training'; # If a file or link with this name exists in the user's .bogofilter # directory, then copies of rejected messages will be saved in this # file in mbox format, using flock locking. To disable rejected # message archiving, set $archive_mbox to undef. my $archive_mbox = 'archive'; # If a file or link with this name exists in the user's .bogofilter # directory, then copies of accepted messages (Ham or Unsure) will be # saved in this file in mbox format, using flock locking. To disable # accepted message archiving, set $ham_archive_mbox to undef. my $ham_archive_mbox = 'ham_archive'; # If $cyrus_deliver is set to an existing executable, then it is # assumed to be a Cyrus IMAP "deliver" program. If the $archive_mbox # or $ham_archive_mbox for a particular user is a symlink pointing at # a nonexistent file whose name starts with "cyrus:", then everything # after the "cyrus:" is assumed to be the name of a Cyrus IMAP folder # within the user's mailbox to which to deliver the spam message # instead of saving it into an mbox format file. my $cyrus_deliver = '/usr/lib/cyrus-imapd/deliver'; # If you would like to use a shared bogofilter database for everyone, # rather than separate per-user databases, then create a user on your # system to be used as a home for the shared database, and set # $database_user to that user's username. # # If you set $database_user, then all the logic described above for # deciding whether to run bogofilter, whether to run in training mode # or real mode, and whether to archive spam still applies, so make # sure you configure $database_user's account properly. # # If you set $database_user, then $aliases_file, $sendmail_canon, # $sendmail_prog, $recipient_cache_expire, and # $recipient_cache_check_interval do NOT apply and are ignored. my $database_user = undef; # Mail::Alias is used to expand SMTP recipient addresses into local # mailboxes to determine if any of them have bogofilter databases. If # someone sends E-mail to a mailing list or alias whose expansion # contains one or more local users with bogofilter databases, then one # of those users' database (which one in particular is not defined) # will be used to filter the message. To disable this functionality # and remove the dependency on Mail::Alias, comment out the "use # Mail::Alias;" line and set $aliases_file to undef in the # configuration section. With this functionality disabled, mail will # only be filtered if it is sent directly to a user in the passwd # file. On the other hand, with this functionality enabled, one # person's bogofilter database can cause a message to be filtered for # everyone on a local mailing list. my $aliases_file = '/etc/aliases'; # If you want the milter to ask sendmail to canonicalize recipient # addresses before trying to alias-expand them, then set # $sendmail_canon to true and $sendmail_prog to the path of the # sendmail binary to invoke. This is necessary, e.g., if you use a # virtual user table for some recipients that do sendmail filtering. # You may also wish to examine the sendmail_canon subroutine below, # because it may not be right for your particular sendmail # configuration. Search for CHECKTHIS in the function. my $sendmail_canon = 1; my $sendmail_prog = '/usr/sbin/sendmail'; # @discard_control is an array of anonymous arrays. Each sub-array # contains a pair of entries, a control pattern and an action, either # "discard" or "reject". The action corresponding to the first # matching control pattern determines what happens to the messages. # If @discard_control is empty or none of its control patterns match, # the default action is "reject". The following control patterns are # valid: # "addr:a.b.c.d" matches if the sending host has the indicated IP address # "netblock:a.b.c.d/e" matches if the sending host is in the indicated netblock # "host:fqdn" matches if the IP address of the sending host resolves # to the indicated host name # "domain:fqdn" matches if the IP address of the sending host resolves # to a host name in the indicated domain # "mx" matches if one of the MX servers for the recipient's # domain resolves to the IP address of the sending host # "*" always matches # The default @discard_control setting discards messages from MX # servers to prevent this script from contributing to spam "blowback", # which occurs when a spammer forges someone's real email address as # the return address on spam, and then that person has to deal with # tons of bounce messages from sites that reject the spam. my(@discard_control) = ( ["mx" => "discard"], ["*" => "reject"], ); # You can configure how long addresses will stay in the cache of # addresses that have been been expanded against the virtual user # table (if $sendmail_canon is set above), then expanded against the # aliases file (if $aliases_file is set above), then checked to see if # they represent users who are doing filtering. You would want cache # entries to time out if you get a lot of spam dictionary attacks # against your mail server, when the spammers try tons of invalid # addresses on the off chance that one of them might be valid, because # in that case your cache will grow without bound and the bogofilter # milter process will get really large. Set this to 0 to disable # cache expiration, or to the number of seconds after which cache # entries should expire. # # Configuration changes in the user's bogofilter directory, e.g., # changes to $subject_filter_file, aren't detected until the cache # entry for the user expires, so if you're allowing users to make # changes like that, you should probably reduce this timeout to # something smaller so that their changes will take affect somewhat # promptly. my $recipient_cache_expire = 24 * 60 * 60; # one day # How often to expire entries from the cache. my $recipient_cache_check_interval = 60 * 60; # one hour # You may wish to remove this restriction, by setting this variable to # 0, if your site gets a lot of mail, but I haven't tested the script # to make sure it functions correctly with multiple interpreters. my $milter_interpreters = 1; # END CONFIGURABLE SETTINGS require 5.008_000; # for User::pwent use strict; use warnings; use DB_File; use Data::Dumper; use English '-no_match_vars'; use Fcntl qw(:flock :seek); use File::Basename; use File::Temp qw(tempfile); use Getopt::Long; use IO::Scalar; use IPC::Open2; use Mail::Alias; use Net::CIDR; use Net::DNS; use POSIX; use Proc::Daemon; use Sendmail::Milter; use Socket; use Sys::Syslog qw(:DEFAULT :macros setlogsock); use User::pwent; $Data::Dumper::Indent = 0; # Used to cache the results of alias expansions and checks for # filtered recipients. my %cached_recipients; my $whoami = basename $0; my $usage = "Usage: $whoami [--daemon] [--debug] [--restart]\n"; my($run_as_daemon, $get_help, $debug, $restart); my %my_milter_callbacks = ( 'helo' => \&my_helo_callback, 'envfrom' => \&my_envfrom_callback, 'envrcpt' => \&my_rcpt_callback, 'header' => \&my_header_callback, 'eoh' => \&my_eoh_callback, 'body' => \&my_body_callback, 'eom' => \&my_eom_callback, 'abort' => \&my_abort_callback, 'close' => \&my_close_callback, ); $my_milter_callbacks{'connect'} = \&my_connect_callback if (@ip_whitelist || $ip_whitelist_db || @discard_control); die $usage if (! GetOptions('daemon' => \$run_as_daemon, 'debug' => \$debug, 'restart' => \$restart, 'help|h|?' => \$get_help)); if ($get_help) { print $usage; exit; } if ($run_as_daemon) { Proc::Daemon::Init; } if (! (open(PIDFILE, '+<', $pid_file) || open(PIDFILE, '+>', $pid_file))) { &die("open($pid_file): $!\n"); } seek(PIDFILE, 0, SEEK_SET); if (! flock(PIDFILE, LOCK_EX|LOCK_NB)) { &die("flock($pid_file): $!\n"); } if (! (print(PIDFILE "$$\n"))) { &die("writing to $pid_file: $!\n"); } # Flush the PID seek(PIDFILE, 0, SEEK_SET); setlogsock('unix'); openlog($whoami, 'pid', $log_facility); if (! $debug) { # I'd really like to to this, but it doesn't work with Sys::Syslog # 0.13 in Perl 5.8.8. # setlogmask(&LOG_UPTO(LOG_INFO)); eval " no warnings 'redefine'; sub debuglog { } "; } while ($restart) { my $pid = fork(); if (! defined($pid)) { &die("fork: $!"); } elsif ($pid) { $SIG{'TERM'} = sub { &syslog('info', "got SIGTERM, shutting down"); kill 'TERM', $pid; exit; }; waitpid $pid, 0; my $status = $? >> 8; &syslog('warning', "child process $pid exited (status word $?, exit status $status)"); } else { last; } } my $magic_string_re = $magic_string; $magic_string_re =~ s/(\W)/\\$1/g; # convert whitelist into CIDR notation { my(@whitelist_cidr); foreach my $IP (@ip_whitelist) { if (not eval {@whitelist_cidr = Net::CIDR::cidradd($IP, @whitelist_cidr)}) { &die("Error processing whitelist: \"$IP\" is not a valid IP ", "address or range."); } } @ip_whitelist = @whitelist_cidr; } # open popip database for reading my %ip_whitelist_db; &opendb_read if ($ip_whitelist_db); if ($database_user) { $aliases_file = $sendmail_canon = $sendmail_prog = $recipient_cache_expire = $recipient_cache_check_interval = undef; syslog("info", "Using shared bogofilter database under %s's account", $database_user); } unlink($socket); Sendmail::Milter::setconn("local:$socket"); Sendmail::Milter::register("bogofilter-milter", \%my_milter_callbacks, SMFI_CURR_ACTS); Sendmail::Milter::main($milter_interpreters); &closedb; sub my_helo_callback { my $ctx = shift; my $helo = shift; my $hash = &getpriv($ctx); $hash->{'helo'} = $helo; &setpriv($ctx, $hash); return SMFIS_CONTINUE; } sub my_envfrom_callback { my $ctx = shift; my $envfrom = shift; my $hash = &getpriv($ctx); $hash->{'envfrom'} = $envfrom; &setpriv($ctx, $hash); return SMFIS_CONTINUE; } sub my_connect_callback { my $ctx = shift; # milter context object my $hostname = shift; # The connection's host name. my $sockaddr_in = shift; # AF_INET portion of the host address, # from getpeername(2) syscall my $hash = &getpriv($ctx); my ($port, $ipaddr) = Socket::unpack_sockaddr_in($sockaddr_in) or &die("Could not unpack socket address: $!"); $ipaddr = Socket::inet_ntoa($ipaddr); # translates into standard IPv4 addr $hash->{'remotename'} = $hostname; $hash->{'remoteip'} = $ipaddr; $hash->{'localname'} = $ctx->getsymval('j'); $hash->{'localip'} = $ctx->getsymval('{if_addr}'); &debuglog("my_connect_callback: entering with hostname=$hostname, ", "ipaddr=$ipaddr, port=$port"); # check if the connecting server is listed in the whitelist if (@ip_whitelist) { if (eval {Net::CIDR::cidrlookup($ipaddr, @ip_whitelist)}) { syslog('info', '%s', "$ipaddr is whitelisted, so this email is " . "being accepted unfiltered."); &setpriv($ctx, undef); return SMFIS_ACCEPT; } else { &debuglog("$ipaddr is not in the whitelist"); } } # check if connecting server is listed in the popip database if ($ip_whitelist_db) { if ($ip_whitelist_db{$ipaddr}) { syslog('info', '%s', "$ipaddr is authenticated via poprelayd, " . "so this email is being accepted unfiltered."); &setpriv($ctx, undef); return SMFIS_ACCEPT; } else { &debuglog("$ipaddr is not in the popip database"); } } $hash->{'ipaddr'} = $ipaddr; &setpriv($ctx, $hash); &debuglog("my_connect_callback: return CONTINUE with hash"); return SMFIS_CONTINUE; } sub my_rcpt_callback { my $ctx = shift; my $envrcpt = shift; my $hash = &getpriv($ctx); &debuglog("my_rcpt_callback: entering with " . Data::Dumper->Dump([&small_hash($hash)], [qw(hash)])); if ($hash->{'rcpt'}) { # We've already encountered a recipient who is filtering this message. &setpriv($ctx, $hash); &debuglog("my_rcpt_callback: return CONTINUE with old hash"); return SMFIS_CONTINUE; } my $rcpt = $ctx->getsymval('{rcpt_addr}'); &debuglog("my_rcpt_callback: rcpt_addr: $rcpt"); if (&filtered_dir($rcpt)) { $hash->{'rcpt'} = $rcpt; $hash->{'envrcpt'} = $envrcpt; &setpriv($ctx, $hash); &debuglog("my_rcpt_callback: return CONTINUE with hash"); return SMFIS_CONTINUE; } else { &setpriv($ctx, undef); &debuglog("my_rcpt_callback: return CONTINUE with undef"); return SMFIS_CONTINUE; } } sub my_header_callback { my($ctx, $field, $value) = @_; my($hash) = &getpriv($ctx); &debuglog("my_header_callback: entering with " . Data::Dumper->Dump([&small_hash($hash), $field, $value], [qw(hash field value)])); if (! $hash) { &debuglog("my_header_callback: return ACCEPT with no hash"); return SMFIS_ACCEPT; } if (lc $field eq 'subject') { if ($value =~ /$magic_string_re/oi) { &setpriv($ctx, undef); &debuglog("my_header_callback: returning ACCEPT for magic subject"); return SMFIS_ACCEPT; } if ($hash->{'rcpt'}) { my(@subject_filters) = &user_subject_filters($hash->{'rcpt'}); foreach my $filter (@subject_filters) { if ($value =~ /$filter/) { &setpriv($ctx, undef); &debuglog(sprintf("my_header_callback: returning ACCEPT for subject filter %s for recipient %s", $filter, $hash->{'rcpt'})); return SMFIS_ACCEPT; } } } } if (lc $field eq 'x-bogosity') { &debuglog("Found $field: $value"); my $index = $hash->{x_bogosity_index} || 1; if ($value =~ /tests=bogofilter/) { unshift(@{$hash->{x_bogosity}}, $index); &debuglog("my_header_callback: stashing $field: $value ", "at index $index"); } $hash->{x_bogosity_index} = $index + 1; } $hash = &add_to_message($hash, "$field: $value\n"); &setpriv($ctx, $hash); &debuglog("my_header_callback: returning CONTINUE with hash"); return SMFIS_CONTINUE; } sub my_eoh_callback { my($ctx) = @_; my($hash) = &getpriv($ctx); # If $hash is undefined here, it means that the sender sent no # message header at all, so the block of code in # my_header_callback for checking if $hash is undefined never got # called. This means the message is almost certainly spam, but # it's not our job to determine that if none of the recipients are # using bogofilter. if (! $hash) { &debuglog("my_eoh_callback: return ACCEPT with no hash (message had empty header)"); return SMFIS_ACCEPT; } &debuglog("my_eoh_callback: entering with " . Data::Dumper->Dump([&small_hash($hash)], [qw(hash)])); $hash = &add_to_message($hash, "\n"); &setpriv($ctx, $hash); &debuglog("my_eoh_callback: returning CONTINUE with hash"); return SMFIS_CONTINUE; } sub my_body_callback { my($ctx, $body, $len) = @_; my($hash) = &getpriv($ctx); &debuglog("my_body_callback: entering with " . Data::Dumper->Dump([&small_hash($hash), $len], [qw(hash len)])); $hash = &add_to_message($hash, $body); &setpriv($ctx, $hash); &debuglog("my_body_callback: returning CONTINUE with hash"); return SMFIS_CONTINUE; } sub add_to_message { my($hash, $text) = @_; return $hash if (! $text); if (! $hash->{'fh'}) { $hash->{'msg'} = '' if (! $hash->{'msg'}); $hash->{'msg'} .= $text; if (length($hash->{'msg'}) <= $MAX_INCORE_MSG_LENGTH) { return $hash; } ($hash->{'fh'}, $hash->{'fn'}) = tempfile(); if (! $hash->{'fn'}) { &die("error creating temporary file"); } &debuglog("switching to temporary file " . $hash->{'fn'}); $text = $hash->{'msg'}; delete $hash->{'msg'}; } if (! print({$hash->{'fh'} } $text)) { &die("error writing to temporary file " . $hash->{'fn'}); } return $hash; } sub message_read_handle { my($hash) = @_; if ($hash->{'fn'}) { if (! seek($hash->{'fh'}, 0, SEEK_SET)) { &die("couldn't seek in " . $hash->{'fn'} . ": $!"); } return $hash->{'fh'}; } else { return new IO::Scalar \$hash->{'msg'}; } } sub my_eom_callback { my $ctx = shift; my $hash = &getpriv($ctx); my $fh; local($_); &debuglog("my_eom_callback: entering with " . Data::Dumper->Dump([&small_hash($hash)], [qw(hash)])); my $dir = &filtered_dir($hash->{'rcpt'}); if (! $dir) { # This can happen if the MTA loses the input channel from the sender, # so it isn't an error condition. &debuglog("my_eom_callback: called for non-filtered recipient; " . Data::Dumper->Dump([&small_hash($hash)], [qw(hash)])); &setpriv($ctx, undef); &debuglog("my_eom_callback: returning ACCEPT with undef"); return SMFIS_ACCEPT; } if (defined($filter_script) and &restrict_permissions($hash->{'rcpt'}) and -x "$dir/$filter_script" and (-o _ or ! (stat(_))[4])) { my $s = "$dir/$filter_script"; &unrestrict_permissions; syslog('debug', 'filtering with %s', $s); my($filter_fh, $filter_fn) = tempfile(); my $stderr_fh = tempfile(); if (! $filter_fn) { &die("error creating temporary file"); } $^F = fileno($filter_fh); pipe(FROMPARENT, FILTER) or &die("pipe: $!\n"); my $pid = fork; &die("fork: $!\n") if (! defined($pid)); if (! $pid) { close(FILTER); if (! open(STDOUT, ">&", $filter_fh)) { syslog('err', "reopen filter STDOUT to $filter_fn failed: %m"); exit(1); } open(STDERR, ">&", $stderr_fh); if (! open(STDIN, "<&FROMPARENT")) { syslog('err', "reopen filter STDIN from parent failed: %m"); exit(1); } &die("couldn't restrict permissions") if (! &restrict_permissions($hash->{'rcpt'}, 1));; $ENV{'MILTER_REMOTE_IP'} = $hash->{'remoteip'} || ''; $ENV{'MILTER_REMOTE_NAME'} = $hash->{'remotename'} || ''; $ENV{'MILTER_HELOHOST'} = $hash->{'helo'} || ''; $ENV{'MILTER_ENVFROM'} = $hash->{'envfrom'} || ''; $ENV{'MILTER_ENVRCPT'} = $hash->{'envrcpt'} || ''; $ENV{'MILTER_LOCAL_IP'} = $hash->{'localip'} || ''; $ENV{'MILTER_LOCAL_NAME'} = $hash->{'localname'} || ''; if (! exec("$s")) { syslog('err', 'exec(%s) failed: %m', $s); exit(1); } } close(FROMPARENT); my $fh = &message_read_handle($hash); my $good_filter = 1; while (<$fh>) { s/\r\n$/\n/; if (! print(FILTER $_)) { syslog('info', 'writing to filter %s: %m', $s); $good_filter = undef; last; } } my @failed; if (! close(FILTER)) { push(@failed, "close(FILTER): $!"); } if (! waitpid($pid, 0)) { push(@failed, "waitpid($pid): $!"); } if ($? >> 8) { push(@failed, "\$?>>8 == " . ($?>>8)); } if (@failed and $good_filter) { syslog('warning', 'filter %s failed: %s', $s, join(", ", @failed)); $good_filter = undef; } if (seek($stderr_fh, 0, SEEK_SET) and -s $stderr_fh) { while (my $error = <$stderr_fh>) { $error =~ s/^\s+//; $error =~ s/\s+$//; syslog('warning', 'stderr output from %s: %s', $s, $error); } close($stderr_fh); } if ($good_filter) { delete $hash->{'msg'}; unlink $hash->{'fn'} if ($hash->{'fn'}); $hash->{'fh'} = $filter_fh; $hash->{'fn'} = $filter_fn; $hash->{'nocr'} = 1; syslog('debug', 'successfully filtered with %s', $s); } else { unlink $filter_fn; close($filter_fh); } } if (! pipe(FROMBOGO, TOPARENT)) { &die("pipe: $!\n"); } if (! pipe(FROMPARENT, BOGOFILTER)) { &die("pipe: $!\n"); } my $pid = fork; if (! defined($pid)) { &die("fork: $!\n"); } elsif (! $pid) { close(FROMBOGO); close(BOGOFILTER); open(STDOUT, ">&TOPARENT") or syslog('warning', "reopen STDOUT to parent failed: $!"); open(STDIN, "<&FROMPARENT"); close(TOPARENT); close(FROMPARENT); &die("couldn't restrict permissions") if (! &restrict_permissions($hash->{'rcpt'}, 1));; my(@cmd) = ('bogofilter', '-v', '-u', '-d', $dir); if ($bogofilter_cf && -f "$dir/$bogofilter_cf") { push(@cmd, '-c', "$dir/$bogofilter_cf"); } exec(@cmd) || &die("exec(bogofilter): $!\n"); # &die had better not return! } close(TOPARENT); close(FROMPARENT); $fh = &message_read_handle($hash); if ($hash->{'fn'}) { # This is safe to do on Unix, since on Unix you can unlink an # open file and it'll stay around until the last open file # handle to it goes away. If this script were to be used on # non-Unix operating systems, which is a big "if" that I'm not # sure could ever happen, then this unlink might be a problem # and would need to happen later. unlink $hash->{'fn'}; } while (<$fh>) { s/\r\n$/\n/ if (! $hash->{'nocr'}); print(BOGOFILTER $_) || &die("writing to bogofilter: $!\n"); } close(BOGOFILTER); my $bogosity_line = ; close(FROMBOGO); waitpid $pid, 0; my $exit_status = $? >> 8; if ($bogosity_line =~ s/^X-Bogosity:\s*//i) { chomp $bogosity_line; } elsif (! $exit_status) { $bogosity_line = "Spam, tests=bogofilter"; } elsif ($exit_status == 1) { $bogosity_line = "Ham, tests=bogofilter"; } elsif ($exit_status == 2) { $bogosity_line = "Unsure, tests=bogofilter"; } if ($add_unique_id) { $bogosity_line .= # I wish we could make this a real UUID, but that would # require depending on one of the CPAN UUID modules, and I # don't want to add that dependency just for this feature. ", milter_id=" . sprintf("%lx.%lx.%lx", $$, time(), int(rand(1000000000))); } my $from = $ctx->getsymval('{mail_addr}'); if (! $exit_status) { my($training); if ($training_file) { if (&restrict_permissions($hash->{'rcpt'})) { $training = (-f "$dir/$training_file"); &unrestrict_permissions; } else { syslog('warning', 'assuming training mode because ' . 'permissions could not be restricted'); $training = 1; } } foreach my $index (@{$hash->{x_bogosity}}) { &debuglog("Removing old X-Bogosity header"); $ctx->chgheader('X-Bogosity', $index, ""); } $ctx->addheader('X-Bogosity', $bogosity_line); my $which = &reject_or_discard($hash); my($verb) = ($which == SMFIS_REJECT) ? "reject" : "discard"; syslog('info', '%s', ($training ? "would $verb" : "${verb}ing") . " likely spam from $from to " . $hash->{'rcpt'} . " based on $dir"); &save_copy($fh, $from, $hash->{'rcpt'}, $dir, $archive_mbox, $bogosity_line, $hash->{'nocr'}); if (! $training) { $ctx->setreply($rcode, $xcode, $reject_message); &setpriv($ctx, undef); return $which; } } else { &save_copy($fh, $from, $hash->{'rcpt'}, $dir, $ham_archive_mbox, $bogosity_line, $hash->{'nocr'}); my $bogosity; if ($exit_status == 1) { $bogosity = "Ham"; } elsif ($exit_status == 2) { $bogosity = "Unsure"; } if ($bogosity_line || $bogosity) { foreach my $index (@{$hash->{x_bogosity}}) { &debuglog("Removing old X-Bogosity header"); $ctx->chgheader('X-Bogosity', $index, ""); } $ctx->addheader('X-Bogosity', $bogosity_line); } } &setpriv($ctx, undef); return SMFIS_CONTINUE; } sub save_copy { my($fh, $from, $rcpt, $dir, $archive_mbox, $bogosity, $nocr) = @_; local($_); my($archive, $link); $archive = ($archive_mbox && &restrict_permissions($rcpt) && (lstat($archive = "$dir/$archive_mbox"))) ? $archive : undef; if ($cyrus_deliver && -f $cyrus_deliver && -X $cyrus_deliver && -l $archive && ($link = readlink($archive)) && $link =~ s/^cyrus:// && (! -f $archive)) { &unrestrict_permissions; my $user = &filtered_user($rcpt); if (! $user) { &die("Couldn't determine username for IMAP delivery"); } if (! seek($fh, 0, SEEK_SET)) { &die("error rewinding message handle: $!"); } my $pid = open(DELIVER, "|-"); if (! defined($pid)) { &die("Error forking to execute $cyrus_deliver: $!"); } elsif (! $pid) { exec($cyrus_deliver, '-a', $user, '-m', "user.$user.$link") || &die("exec($cyrus_deliver): $!"); } else { my ($in_header) = 1; my $ret = 1; while ($ret && <$fh>) { s/\r\n/\n/ if (! $nocr); if ($in_header) { next if (/^x-bogosity:.*tests=bogofilter/i); if (/^$/) { if ($bogosity) { $ret = $ret && print(DELIVER "X-Bogosity: $bogosity\n"); } $in_header = 0; } } $ret = $ret && print(DELIVER $_); } $ret = $ret && close(DELIVER); if (! $ret) { syslog('warning', '%s', "$cyrus_deliver failed for user.$user.$link"); } return; } } if ($archive) { # There is an annoying race condition here. Suppose two spam # messages are delivered at the same time to a user whose # archive file is a symlink pointing at a nonexistent (yet) # file. Milter process A tries to open with +< and fails. IN # the meantime, process B also tries to open with +< and fails. # Then A opens witn +>, locks the file and starts writing to # it, and *then* B opens with +>, thus truncating whatever data # was written thus far by A. I'm not sure what the best way is # to fix this race condition reliably, and it seems rare enough # that it isn't worth the effort. if (! (open(MBOX, '+<', $archive) || open(MBOX, '+>', $archive))) { syslog('warning', '%s', "opening $archive for " . "write: $!"); goto no_archive_open; } if (! flock(MBOX, LOCK_EX)) { syslog('warning', '%s', "locking $archive: $!"); goto close_archive; } if (! seek(MBOX, 0, SEEK_END)) { syslog('warning', '%s', "seek($archive, 0, SEEK_END): $!"); goto close_archive; } if (! seek($fh, 0, SEEK_SET)) { &die("error rewinding message handle: $!"); } if (! print(MBOX "From " . ($from || 'MAILER-DAEMON') . " " . localtime() . "\n")) { syslog('warning', '%s', "write($archive): $!"); goto close_archive; } my($last_blank, $last_nl); my($in_header) = 1; while (<$fh>) { s/\r\n/\n/ if (! $nocr); $last_nl = ($_ =~ /\n/); $last_blank = ($_ eq "\n"); if ($in_header) { next if (/^x-bogosity:.*tests=bogofilter/i); if (/^$/) { if ($bogosity) { $_ = "X-Bogosity: $bogosity\n" . $_; } $in_header = 0; } } else { s/^From />From /; } if (! print(MBOX $_)) { syslog('warning', '%s', "write($archive): $!"); goto close_archive; } } # Mbox format requires a blank line at the end if (! ($last_blank || print(MBOX ($last_nl ? "\n" : "\n\n")))) { syslog('warning', '%s', "write($archive): $!"); goto close_archive; } close_archive: if (! close(MBOX)) { syslog('warning', '%s', "close($archive): $!"); } } no_archive_open: &unrestrict_permissions; } sub my_abort_callback { my($ctx) = shift; my $hash = &getpriv($ctx); &debuglog("my_abort_callback: entering with " . Data::Dumper->Dump([&small_hash($hash)], [qw(hash)])); if ($hash->{'fn'}) { unlink $hash->{'fn'}; } &setpriv($ctx, undef); &debuglog("my_abort_callback: returning CONTINUE with undef"); return SMFIS_CONTINUE; } sub my_close_callback { my($ctx) = shift; my $hash = &getpriv($ctx); &debuglog("my_close_callback: entering with " . Data::Dumper->Dump([&small_hash($hash)], [qw(hash)])); if ($hash) { if ($hash->{'fn'}) { unlink $hash->{'fn'}; } } &setpriv($ctx, undef); &debuglog("my_close_callback: returning CONTINUE with undef"); return SMFIS_CONTINUE; } sub filtered_dir { my($uid, $gid, $dir) = &expand_recipient($_[0]); $dir; } sub filtered_user { my($uid, $gid, $dir, $stamp, $user) = &expand_recipient($_[0]); $user; } sub user_subject_filters { my($uid, $gid, $dir, $stamp, $user, $filters) = &expand_recipient($_[0]); $filters ? @{$filters} : (); } sub restrict_permissions { my($rcpt) = shift; my($no_going_back) = shift; my($uid, $gid, $dir) = &expand_recipient($rcpt); if (! (defined($uid) && defined($gid))) { syslog('err', '%s', "internal error: couldn't determine UID and GID " . "for $rcpt"); return undef; } $EUID = $uid; $EGID = $gid; if ($no_going_back) { # When we're ready to exec an external program, i.e., # bogofilter, we want to set the real UID and GID so that, # e.g., bogofilter will look in the correct home directory for # .bogofilter.cf. $UID = $uid; $GID = $gid; } 1; } sub unrestrict_permissions { $EUID = $UID; $EGID = $GID; } my $recipient_cache_last_checked; # $uid, $gid, $dir, $timestamp, $username, \@subject_filters sub expand_recipient { my($rcpt) = @_; my($orig, @expanded); my $now = time; if ($recipient_cache_expire) { if (! defined($recipient_cache_last_checked)) { $recipient_cache_last_checked = $now; } if ($now - $recipient_cache_last_checked > $recipient_cache_check_interval) { my $old = $now - $recipient_cache_expire; my(@keys) = keys %cached_recipients; my(@expired) = grep($cached_recipients{$_}->[3] <= $old, keys %cached_recipients); &debuglog('expiring %d entries (out of %d) ' . 'from the recipient cache', scalar @expired, scalar @keys); map(delete $cached_recipients{$_}, @expired); $recipient_cache_last_checked = $now; } } if ($database_user) { $rcpt = $database_user; } if (defined($cached_recipients{$rcpt})) { return(@{$cached_recipients{$rcpt}}); } $rcpt = &sendmail_canon($orig = $rcpt); if ($rcpt =~ /\@/) { return(@{$cached_recipients{$orig}} = (undef, undef, undef, $now, undef)); } if ($aliases_file) { my $aliases = Mail::Alias::Sendmail->new($aliases_file); @expanded = $aliases->expand($rcpt); } else { @expanded = ($rcpt); } if ((@expanded == 1) && ($expanded[0] eq $rcpt)) { my($dir, $pw); my $stripped = $rcpt; $stripped =~ s/\+.*//; $pw = getpwnam($stripped); @{$cached_recipients{$orig}} = $pw ? ($pw->uid, $pw->gid, undef, $now, $stripped) : (undef, undef, undef, $now, undef); if ($pw && $pw->dir && &restrict_permissions($orig) && -d ($dir = $pw->dir . "/.bogofilter") && ! ($bogofilter_cf && $require_cf && ! -f "$dir/$bogofilter_cf")) { $cached_recipients{$orig}->[2] = $dir; if ($subject_filter_file) { my $sff = $dir . "/" . $subject_filter_file; my @subject_filters; if (open(SFF, "<", $sff)) { while () { s/^\s+//; s/\s+$//; next if (/^\#/); next if (/^$/); my $re; eval '$re = qr/$_/;'; if (! $re) { syslog("warning", "bad subject filter for %s: %s", $stripped, $_); next; } push(@subject_filters, $re); &debuglog(sprintf('subject filter for %s: %s', $stripped, $_)); } } close(SFF); if (@subject_filters) { $cached_recipients{$orig}->[5] = \@subject_filters; } } } elsif ($database_user) { syslog("warning", "Shared database user %s is not configured " . "properly for bogofilter", $database_user); } &unrestrict_permissions; return(@{$cached_recipients{$orig}}); } else { foreach my $addr (@expanded) { my(@sub); if (@sub = &expand_recipient($addr)) { return(@{$cached_recipients{$orig}} = @sub); } } return(@{$cached_recipients{$orig}} = (undef, undef, undef, $now, undef)); } } sub sendmail_canon { return $_[0] if (! $sendmail_canon); my($pid, $sendmail_reader, $sendmail_writer, $last); local($_); $pid = open2($sendmail_reader, $sendmail_writer, $sendmail_prog, '-bt') or &die("open2 for sendmail failed"); print($sendmail_writer "3,0 $_[0]\n"); close($sendmail_writer); while (<$sendmail_reader>) { # CHECKTHIS You should run "sendmail -bt" as root, give it the # input "3,0 addr" where "addr" is one of the addresses in # your virtual user table, and confirm that the last # "returns:" line that it returns matches the regexp here for # local addresses. if (/\s+returns: \$\# local \$\:\s+(.+)/) { $last = $1; $last =~ s/ \+ .*//; } } close($sendmail_reader); waitpid $pid, 0; if ($last) { return $last; } else { return $_[0]; } } sub opendb_read { tie(%ip_whitelist_db, "DB_File", $ip_whitelist_db, O_RDONLY, 0, $DB_HASH) or &die("Can't open $ip_whitelist_db: $!"); } sub closedb { untie %ip_whitelist_db; } sub die { my(@msg) = @_; &closedb; syslog('err', '%s', "@msg"); exit(1); } sub debuglog { syslog('debug', "%s", "DEBUG: " . join("", @_)); } my(%mx_cache); sub reject_or_discard { my($hash) = @_; my $hostname; foreach my $i (0..@discard_control-1) { my($pattern, $action) = @{$discard_control[$i]}; my $ret; if ($action =~ /^reject$/i) { $ret = SMFIS_REJECT; } elsif ($action =~ /^discard$/i) { $ret = SMFIS_DISCARD; } else { &die("Invalid action $action ", "for discard control pttern $pattern\n"); } if ($pattern =~ /^addr:(.*)$/i) { my $addr = $1; &die("Invalid IP address in discard control pattern $pattern\n") if ($addr !~ /^\d+\.\d+\.\d+\.\d+$/); if ($hash->{'ipaddr'} eq $addr) { &debuglog("reject_or_discard: addr match $addr: $action"); return $ret; } } elsif ($pattern =~ /^netblock:(.*)$/i) { my $netblock = $1; &die("Invalid netblock in discard control pattern $pattern\n") if ($netblock !~ /^\d+\.\d+\.\d+\.\d+\/\d+$/); if (Net::CIDR::cidrlookup($hash->{'ipaddr'}, $netblock)) { &debuglog("reject_or_discard: netblock match ", "$hash->{ipaddr} in $netblock: $action"); return $ret; } } elsif ($pattern =~ /^host:(.*)$/i) { my $match_host = lc $1; $hostname = lc gethostbyaddr(inet_aton($hash->{ipaddr}), AF_INET) if (! $hostname); if ($match_host eq $hostname) { &debuglog("reject_or_discard: ", "host match $hostname for $hash->{ipaddr}: ", "$action and cache"); splice(@discard_control, $i, 0, [ "addr:$hash->{ipaddr}", $action ]); return $ret; } } elsif ($pattern =~ /^domain:(.*)$/i) { my $match_domain = lc $1; $hostname = lc gethostbyaddr(inet_aton($hash->{ipaddr}), AF_INET) if (! $hostname); if ($match_domain eq $hostname or (substr($hostname, -1-length($match_domain)) eq ".$match_domain")) { &debuglog("reject_or_discard: domain match ", "$hostname for $hash->{ipaddr} in $match_domain: ", "$action and cache"); splice(@discard_control, $i, 0, [ "addr:$hash->{ipaddr}", $action ]); return $ret; } } elsif ($pattern =~ /^mx$/i) { my $mx_domain = lc $hash->{'envrcpt'}; if (! $mx_domain) { &debuglog("reject_or_discard: no envrcpt\n"); next; } $mx_domain =~ s/.*\@(.*[^\>])\>?/$1/; my %mx_ips; if ($mx_cache{$mx_domain} and # refetch MX records once per hour time - $mx_cache{$mx_domain}->[0] < 60 * 60) { %mx_ips = %{$mx_cache{$mx_domain}->[1]}; } else { my %mx_ips; foreach my $mx (mx($mx_domain)) { my($name, $aliases, $addrtype, $length, @addrs) = gethostbyname($mx->exchange); foreach my $addr (@addrs) { $mx_ips{inet_ntoa($addr)} = 1; } } $mx_cache{$mx_domain} = [time, \%mx_ips]; &debuglog("reject_or_discard: cached MX IPs ", join(" ", sort keys %mx_ips), " for domain $mx_domain"); } if ($mx_ips{$hash->{'ipaddr'}}) { &debuglog("reject_or_discard: MX addr match ", "$hash->{ipaddr} for domain $mx_domain: $action"); return $ret; } } elsif ($pattern eq "*") { return $ret; } else { &die("Unrecognized discard control pattern: $pattern"); } } return SMFIS_REJECT; } sub getpriv { my($ctx) = @_; my $d = $ctx->getpriv(); my $VAR1; if ($d) { eval $d; } else { undef; } } sub setpriv { my($ctx, $value) = @_; if (defined $value) { my $d = Dumper($value); $ctx->setpriv($d); } else { $ctx->setpriv(undef); } } sub small_hash { my($hash) = @_; return undef if (! $hash); my(%hash2) = %{$hash}; $hash2{'msg'} = "..." if ($hash2{'msg'} and length($hash2{'msg'}) > 100); \%hash2; } bogofilter-1.2.4/contrib/spamitarium.pl0000755000175000017500000011455712163572305016412 0ustar sezsez#!/usr/bin/perl -Tw require 5.006_001; use strict; =head1 NAME Spamitarium - evaluates and repairs the sanity of email headers... =cut my $version = "0.4.0"; ################################################ ############### Copyleft Notice ################ ################################################ # Copyright © 2004 Order amid Chaos, Inc. # Author: Tom Anderson # neo+spamitarium@orderamidchaos.com # # This program is open-source software; you can redistribute it # and/or modify it under the terms of the GNU General Public # License, v2, as published by the Free Software Foundation. # # 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: # # Free Software Foundation # 59 Temple Place, Suite 330 # Boston, MA 02111-1307 USA # # http://www.gnu.org/ ################################################# ################# Documentation ################# ################################################# # use "perldoc spamitarium" or "spamitarium -h" to read this =head1 SYNOPSIS =head2 Command line usage: B [I] [I] < [I] =head2 Procmail usage (recommended): Add to your .procmailrc the following recipe: :0 { :0 fhw | spamitarium -sreadxtp # filter through bogofilter, tagging as spam # or not and updating the word lists :0 fw | bogofilter -uep # add back the "From" header for proper delivery :0 fhw | formail -I "From " -a "From " } =head2 Command line options: =over 4 =item B display this help file =item B allow standard fields only (RFC 822/2822/1049/1341/1521/2183/1864) ... all others are stripped from the email =item B insert new received line containing verified received-line tokens =item B include helo string in received line =item B allow DNS lookups (forward and reverse) to help fill in all necessary received fields =item B force rDNS lookups even when provided already by the MTA =item B perform ASN lookups and include in received lines =item B

perform SPF lookups and include in received lines =item B include custom x-headers for additional header validations: =item B validate that the date header is within close proxmity to the received date (see $date_limit global variable to configure) =item B parse and display the body of the email in addition to the headers =item B display benchmarking info =back =head2 User-defined header field list: If using the B option, you may want to allow certain header fields other than those specified by RFCs. These might include fields set by your mailing list or proxy or other custom application. You may specify such a list of fields by appending them comma-delimited at the end of your command line. For example, if you wanted the I and I fields passed through, you would change your procmail recipe as follows: | spamitarium -sreadxtp list-id,encrypted =head1 REQUIRES =over 4 =item * Perl 5.6.1 Net::DNS::Resolver Mail::SPF::Query Net::CIDR DB_File POSIX =back =head1 DESCRIPTION Spamitarium helps to remove unnecessary noise from email headers and to highlight just the portions which contribute positively to spam filtering using statistical methods. The only non-spoofable, -forgable, or -tweakable part of an email is the received line, as it is generated by the receiving mail server which ought to have no reason to munge it. Every other part of an email can be influenced directly by the sender. Received line tokens, when verified authentic, are therefore highly indicative of whether or not a given message is spam. Spamitarium reads the received headers, determines which ones are authentic, and then prints tokens into the header which may be keyed on by statistical filters. This works much like a blacklist/whitelist, but when coupled with a statistical filter such as bogofilter, these lists are automatically generated and require no manual maintenance other than normal training. Moreover, headers which do not directly influence the email in any functional way, nor are visible to the end-user in a standard graphical MUA, are highly likely to contain information which spammers think will detract from normal statistical filtering. It is therefore desireable to remove these elements, specifically X-headers, prior to filtering. Spamitarium removes all invisible, non-functional header lines. Spamitarium also looks up any IP addresses or rDNS addresses which are not provided in order to provide the maximum tokens on which to filter. Moreover, it looks up the autonomous system number (ASN) associated with each "from" address in order to provide a small set of tokens representing the various major subnets of the internet. And it checks the Sender Policy Framework (SPF) records of the sender to ensure that the given MX has permission to send on their behalf. Finally, Spamitarium assesses the headers for missing required header lines, inserting keyable tokens or supplying the missing information. And it compares the date fields to determine if the email has been pre- or post-dated by a large margin in order to influence where it appears in your mail client and inserts an x-header with keyable range tokens to compensate for this. Together, all of these techniques help to remove the noise which accompanies, either incidentally or maliciously, most email messages. This results in a cleaner header consisting of more easily scored tokens. This permits better accuracy with statistical filters as well as quicker processing and a smaller token database. =head1 FAQ =head2 Ask a question Ye may receive an answer here if it is asked frequently =head1 BUGS =over 4 =item * timegm($sec,$min,$hour,$day,$mon,$year) aborts if Perl's time_t is 32 bits large and the year is too high (>2038). =back =head1 TODO =over 4 =item * Suggestions welcome. =back =head1 SEE ALSO =over 4 =item * L =item * L =back =head1 AUTHOR Tom Anderson =cut ################################################# ############### User Variables ################# ################################################# # please edit according to your setup # default path our $path = "/bin:/usr/bin:/usr/local/bin"; # default shell our $shell = "/bin/sh"; # seconds before we bail waiting on input our $timeout = 3; # server to use for ASN lookups our $asn_server = "asn.routeviews.org"; # Whitelist any IP addresses or ranges from SPF lookups our @whitelist = ("127.0.0.1","192.168.0.1-192.168.0.255"); # If you want to whitelist any addresses which have authenticated # via poprelayd (i.e. remote workstations of users on your server) # set $dbfile to your popip.db location, else set it to undef #our $dbfile = "/etc/mail/popip.db"; our $dbfile = undef; # distance in seconds from right now to consider a reasonable (non-spam) range to date an email our $date_limit = 60*60*24*2; # 2 days # EMAIL HEADER FIELDS # # See RFC 2076 / "Common Internet Message Header Fields" for a synopsis of common mail headers # SPECIFIED FIELDS -- all of the fields specified in RFC 822/2822, case-insensitive, in the suggested order our $spec_fields = "return-path,received,resent-date,resent-from,resent-sender,resent-reply-to,". "resent-to,resent-cc,resent-bcc,resent-message-id,date,from,sender,reply-to,". "to,cc,bcc,message-id,in-reply-to,references,subject,comments,keywords,encrypted"; # MIME header fields (RFC 1049/1341/1521/2183) $spec_fields .= ",mime-version,content-type,content-transfer-encoding,content-id,content-description,content-disposition"; # security/checksum (RFC 1864) $spec_fields .= ",content-md5"; # mailing list headers (RFC 2369/2919) may be added if you like, but for now I'm choosing to leave them out #$spec_fields .= ",list-id,list-help,list-unsubscribe,list-subscribe,list-post,list-owner,list-archive"; # MASKED FIELDS -- unnecessary fields often used for spam will be expunged from the spec fields list # (if you know of a valid, necessary use for these, let me know) our $masked_fields = "keywords,comments,encrypted,content-id,content-description"; # controversial and not strictly necessary: #$masked_fields .= ",reply-to"; # message-id fields are only machine-readable and not visible to nor readable by the recipient # however, they can be useful if your client produces discussion threading # uncomment this line if you don't care about threading: #$masked_fields .= ",message-id,resent-message-id,in-reply-to,references"; # resent fields are strictly informational (and not generally user-visible), therefore allowing them through is optional: # MIME specifies a different way of resending messages with the "Message" content-type, so these may be considered deprecated: $masked_fields .= ",resent-date,resent-from,resent-sender,resent-reply-to,resent-to,resent-cc,resent-bcc,resent-message-id"; # USER FIELDS -- User fields are those that are neither specified nor masked that you want permitted. # These may include special fields for your particular mail server, filter, or mail user agent. our $user_fields = ""; # NEW FIELDS -- New custom x-headers added by Spamitarium (it is recommend that you don't change these). # These are disabled unless you pass the 'x' option. our $new_fields = "x-date-check,x-spf"; # REQUIRED FIELDS -- Any fields that should show up in an email even if they are not sent -- i.e. if the lack of # these fields may be useful for the filter, a no-req-field tag will be added. The only *required* fields according to # RFC 2822 are "from", "sender", "reply-to", and "date", others are just suggested. However, "sender" and "reply-to" are # commonly not supplied, and so should probably not be in this list. On the other hand, "subject" and a few others may # be desired in this list. our $req_fields = "received,from,to,date,subject"; # of course, modify the first line of this file, # the shebang, to point to your perl interpreter # do not edit below this line unless you really # know what you're doing ################################################# ############## Include Libraries ################ ################################################# use Benchmark; use Time::Local; use Net::DNS::Resolver; use Mail::SPF::Query; use Net::CIDR; use DB_File; use POSIX; ################################################# ############## Default Globals ################## ################################################# $> = $<; # set effective user ID to real UID $) = $(; # set effective group ID to real GID # Make %ENV safer delete @ENV{qw(IFS CDPATH ENV BASH_ENV PATH SHELL)}; # Set the environment explicitly $ENV{PATH} = $path; $ENV{SHELL} = $shell; # options flags our $options = ""; # define the control-linefeed syntax for this system our $CRLF = "\n"; #($^O=~/VMS/i)? "\n": # VMS #("\t" ne "\011")? "\r\n": # EBCDIC # "\015\012"; # others # DNS query options our $res = Net::DNS::Resolver->new( nameservers => [qw(127.0.0.1)], udp_timeout => 2, retry => 1, #debug => 1 ); # convert whitelist into CIDR notation our @cidr_list = (); foreach my $IP (@whitelist) { if (not eval {@cidr_list = Net::CIDR::cidradd ($IP, @cidr_list)}) { error("warn","Error processing whitelist: \"$IP\" is not a valid IP address or range."); } } ################################################ ##################### Main ##################### ################################################ # process options if (!defined @ARGV || @ARGV == 0 || $ARGV[0] !~ /\w/ || $ARGV[0] =~ /h/) { my $spamitarium = $1 if $0 =~ /^([\w\/.\-~]*)$/; system("perldoc $spamitarium"); exit(0); } if ($ARGV[0] =~ /r/) { $options .= "r"; } # process received headers if ($ARGV[0] =~ /d/) { $options .= "d"; } # perform domain lookups where needed if ($ARGV[0] =~ /f/) { $options .= "f"; } # force RDNS lookups even where MTA provided if ($ARGV[0] =~ /a/) { $options .= "a"; } # perform ASN lookups if ($ARGV[0] =~ /s/) { $options .= "s"; } # standard fields only (strip others) if ($ARGV[0] =~ /e/) { $options .= "e"; } # include the helo received field in output if ($ARGV[0] =~ /b/) { $options .= "b"; } # output benchmarking info if ($ARGV[0] =~ /w/) { $options .= "w"; } # process whole email (including body) if ($ARGV[0] =~ /x/) { $options .= "x"; } # insert custom x-header fields if ($ARGV[0] =~ /t/) { $options .= "t"; } # perform date range checks if ($ARGV[0] =~ /p/) { $options .= "p"; } # perform SPF lookups # get the permitted headers if ($options =~ /s/ && $ARGV[1]) { $user_fields = $ARGV[1]; } # open popip database for reading our %db; &opendb_read if $dbfile; # start timing the process my $start_time = new Benchmark if $options =~ /b/; my ($start_parse, $end_parse, $start_rcvd, $end_rcvd, $start_set, $end_set); # get STDIN and process the email eval { # set an alarm so that we don't hang on an empty STDIN local $SIG{ALRM} = sub { die "timeout" }; alarm $timeout; # parse the header $start_parse = new Benchmark if $options =~ /b/; my ($header,$parse_benchmark) = parse_header(); $end_parse = new Benchmark if $options =~ /b/; # cancel timeout if we got this far alarm 0; # default date if none provided unless (defined $header->{'date'}) { $header->{'date'}->[0]->{'name'} = "Date"; $header->{'date'}->[0]->{'value'} = gmtime time; } # process the received lines if ($options =~ /r/) { $start_rcvd = new Benchmark if $options =~ /b/; $header->{'received'} = process_rcvd($header->{'received'},$header->{'return-path'}->[0]->{'value'}); $end_rcvd = new Benchmark if $options =~ /b/; } # add new custom header fields if ($options =~ /x/) { if ($options =~ /t/) { $header->{'x-date-check'}->[0]->{'name'} = "X-Date-Check"; $header->{'x-date-check'}->[0]->{'value'} = date_check($header->{'date'}->[0]->{'value'},$header->{'received'}->[0]->{'date'}); } if ($options =~ /p/) { for (my $x = 0; $x < scalar @{$header->{'received'}}; $x++) { if (defined $header->{'received'}->[$x]->{'spf'} && $header->{'received'}->[$x]->{'spf'} =~ /\w/) { $header->{'x-spf'}->[$x]->{'name'} = "X-SPF"; $header->{'x-spf'}->[$x]->{'value'} = $header->{'received'}->[$x]->{'spf'}; } } } } # output the new header containing the changes $start_set = new Benchmark if $options =~ /b/; print set_header($header); $end_set = new Benchmark if $options =~ /b/; # add the body if desired print parse_body() if $options =~ /w/; }; # propagate errors die if $@ && $@ !~ /timeout/i; # print timeout message if ($@ =~ /timeout/i) { error("die","Timed out... make sure to supply an email for processing. Try 'spamitarium -h' for details.\n"); } # calculate total running time if ($options =~ /b/) { my $end_time = new Benchmark; my $td = timediff($end_time, $start_time); my $usr = $td->[1]+$td->[3]; my $sys = $td->[2]+$td->[4]; my $cpu = $usr+$sys; my $wall = $td->[0]; print "Total running time was $wall wallclock secs; $usr usr + $sys sys = $cpu CPU secs.$CRLF"; $td = timediff($end_parse, $start_parse); $usr = $td->[1]+$td->[3]; $sys = $td->[2]+$td->[4]; $cpu = $usr+$sys; $wall = $td->[0]; print "Input parsing time was $wall wallclock secs; $usr usr + $sys sys = $cpu CPU secs.$CRLF"; if ($options =~ /r/) { $td = timediff($end_rcvd, $start_rcvd); $usr = $td->[1]+$td->[3]; $sys = $td->[2]+$td->[4]; $cpu = $usr+$sys; $wall = $td->[0]; print "Received line processing time was $wall wallclock secs; $usr usr + $sys sys = $cpu CPU secs.$CRLF"; } $td = timediff($end_set, $start_set); $usr = $td->[1]+$td->[3]; $sys = $td->[2]+$td->[4]; $cpu = $usr+$sys; $wall = $td->[0]; print "Rebuilding email time was $wall wallclock secs; $usr usr + $sys sys = $cpu CPU secs.$CRLF"; } # close popip database &closedb if $dbfile; exit(0); ################################################ ################ Parse Header ################# ################################################ sub parse_header { my $header = {}; my $name = ""; while () { alarm 0; my $line = $_; chomp($line); # we're done with the header when we've found a blank line # and the required headers have been found already last if (!defined $line || $line !~ /\S/); #&& ( #(defined $header->{'received'} && $header->{'received'}->[0]->{'value'} =~ /\w/) && #(defined $header->{'subject'} && $header->{'subject'}->[0]->{'value'} =~ /\w/) && #(defined $header->{'to'} && $header->{'to'}->[0]->{'value'} =~ /\w/) && #(defined $header->{'from'} && $header->{'from'}->[0]->{'value'} =~ /\w/))); # match header lines if ($line =~ /^(\S+?):\s*?(\S.*?)$/) { my $head = $1; my $value = $2; $name = $head; $name =~ tr/A-Z/a-z/; # header names are case insensitive chomp($name); $value =~ s/\s+?/ /gis; # nix extra spaces & unfold header lines by removing CRLF $value =~ s/(\S)$/$1 /; chomp($value); # if this header name has already been found, append to the end of the array my $count = ((defined $header->{$name}) && (ref($header->{$name}) eq "ARRAY"))? scalar @{$header->{$name}} : 0; # record this header line $header->{$name}->[$count]->{'value'} = $value; $header->{$name}->[$count]->{'name'} = $head; # just for consistency (i.e. pre transforms) #print "found $head [$count] = $value$CRLF"; } # if this line doesn't start with "header:", append to last line found (if exists) elsif ($name && $line =~ /\w/ && $line !~ /^:/) { $line =~ s/\s+?/ /gis; $line =~ s/^\s//; $header->{$name}->[(scalar @{$header->{$name}} - 1)]->{'value'} .= $line if ((defined $header->{$name}) && (ref($header->{$name}) eq "ARRAY")); } } return $header; } sub date_check { my ($date,$rcvd) = shift; my ($dow, $day, $mon, $year, $hour, $min, $sec, $rmdr) = "?"; if ($date =~ /\s*?(\w{1,9}),?\s+?(\d+?)\s+?(\w{3})\s+?(\d{4})\s+?(\d{1,2}):(\d{2}):(\d{2})(.*?)/i) { $dow=$1; $day=$2; $mon=$3; $year=$4; $hour=$5; $min=$6; $sec=$7; $rmdr=$8; $mon = $mon=~/Dec/i?11:$mon=~/Nov/i?10:$mon=~/Oct/i?9:$mon=~/Sep/i?8:$mon=~/Aug/i?7:$mon=~/Jul/i?6:$mon=~/Jun/i?5:$mon=~/May/i?4:$mon=~/Apr/i?3:$mon=~/Mar/i?2:$mon=~/Feb/i?1:0; $date = timegm($sec,$min,$hour,$day,$mon,$year); # adjust for local time if ($rmdr =~ /\+\d(\d)\d\d/) { $date -= $1 * 60 * 60; } if ($rmdr =~ /\-\d(\d)\d\d/) { $date += $1 * 60 * 60; } } else { return "date-format-unknown"; } if ($rcvd && $rcvd =~ /\s*?(\w{1,9}),?\s+?(\d+?)\s+?(\w{3})\s+?(\d{4})\s+?(\d{1,2}):(\d{2}):(\d{2})(.*?)/i) { $dow=$1; $day=$2; $mon=$3; $year=$4; $hour=$5; $min=$6; $sec=$7; $rmdr=$8; $mon = $mon=~/Dec/i?11:$mon=~/Nov/i?10:$mon=~/Oct/i?9:$mon=~/Sep/i?8:$mon=~/Aug/i?7:$mon=~/Jul/i?6:$mon=~/Jun/i?5:$mon=~/May/i?4:$mon=~/Apr/i?3:$mon=~/Mar/i?2:$mon=~/Feb/i?1:0; $rcvd = timegm($sec,$min,$hour,$day,$mon,$year); # adjust for local time if ($rmdr =~ /\+\d(\d)\d\d/) { $rcvd -= $1 * 60 * 60; } if ($rmdr =~ /\-\d(\d)\d\d/) { $rcvd += $1 * 60 * 60; } } else { $rcvd = time; } # check for range +/- my $diff = $rcvd - $date; my $diff_days = round($diff/(60*60*24)); if (($diff < $date_limit) and ($diff > $date_limit * -1)) { return "date-in-range ($diff_days days)"; } else { return "date-out-of-range ($diff_days days)"; } } sub round { my $num = shift; return int(($num*100)+0.5)/100; } ################################################ ################# Parse Body ################## ################################################ sub parse_body { # this function is really only used for # email-to-email comparisons, where processing # the entire email is required... usually # we'll just process the header my $body = ""; while () { $body .= $_; } return $body; } ################################################ ########### Process Received Lines ############ ################################################ sub process_rcvd { my $rcvd = shift; my $rtrn = shift; # heuristics my $LUSER = qr~(?:\w|-|\.)+?~; my $DOMAIN = qr~(?:\w|-|\.)+?\.\w{2,4}~; my $IP = qr~(?:\d{1,3}\.){3}\d{1,3}~; my $EMAIL = qr~$LUSER\@$DOMAIN~; my $HELO = qr~[^\s\0\/\\\#]+?~; my $RDNS = qr~(?:$DOMAIN|\[?$IP\]?|unknown|unverified)~; my $edge_ip = ""; my $untrusted = 0; # check if we were passed a valid array of received lines unless ((defined $rcvd) && (ref($rcvd) eq "ARRAY") && $rcvd->[0]->{'value'}) { no strict 'refs'; my %rcvd_hash = ('value' => "from localhost; " . gmtime time, 'name' => "Received"); my @rcvd_array; $rcvd_array[0] = \%rcvd_hash; $rcvd = \@rcvd_array; } else { # iterate through each received header, parsing and validating the info for (my $x = 0; $x < scalar @$rcvd; $x++) { # skip processing if we already lost confidence in this trail of received lines #if ($untrusted) { $rcvd->[$x]->{'sane'} = "untrusted"; next; } my $helo=""; my $ipad=""; my $rdns=""; my $idnt=""; my $from=""; my $mtan=""; my $mtai=""; my $mtav=""; my $fore=""; my $with=""; my $date=""; # try to take into account all known MTA formats if ($rcvd->[$x]->{'value'} =~ s/\(envelope-(?:sender|from) <($EMAIL)>\)//gis) { $from=$1; }# print "X-$x-matched-01: from=$from, remaining=$rcvd->[$x]->{'value'} $CRLF"; } if ($rcvd->[$x]->{'value'} =~ s/;\s+?(\w{3}, \d{1,2} \w{3} \d{2,4}.*?)$//gis) { $date=$1; }# print "X-$x-matched-02: date=$date, remaining=$rcvd->[$x]->{'value'} $CRLF"; } if ($rcvd->[$x]->{'value'} =~ s/for\s+??(?: \(single-drop\))?//gis) { $fore=$1; }# print "X-$x-matched-03: fore=$fore, remaining=$rcvd->[$x]->{'value'} $CRLF"; } if ($rcvd->[$x]->{'value'} =~ s/by\s+?(\S+?) \(($IP)\) \((.*?)\)//gis) { $mtan=$1; $mtai=$2; $mtav=$3; }# print "X-$x-matched-04: mtan=$mtan, mtai=$mtai, mtav=$mtav, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/by\s+?(\S+?) \[($IP)\]//gis) { $mtan=$1; $mtai=$2; }# print "X-$x-matched-05: mtan=$mtan, mtai=$mtai, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/by\s+?(\S+?) \((.+?)\)//gis) { $mtan=$1; $mtav=$2; }# print "X-$x-matched-06: mtan=$mtan, mtav=$mtav, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/by\s+?($IP)(?=\W|;|$)//gis) { $mtai=$1; }# print "X-$x-matched-07: mtai=$mtai, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/by\s+?($DOMAIN)(?=\W|;|$)//gis) { $mtan=$1; }# print "X-$x-matched-08: mtan=$mtan, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/by\s+?(\S+?)(?=\W|;|$)//gis) { $mtan=$1; }# print "X-$x-matched-09: mtan=$mtan, remaining=$rcvd->[$x]->{'value'} $CRLF"; } if ($rcvd->[$x]->{'value'} =~ s/(?:with)\s+?(\S+?) \((.*?)\)//gis) { $with=$1; $mtav=$2 if !$mtav; }# print "X-$x-matched-10: with=$with, mtav=$mtav, remaining=$rcvd->[$x]->{'value'} $CRLF";} elsif ($rcvd->[$x]->{'value'} =~ s/(?:with)\s+?(\S+?)(?=\W|;|$)//gis) { $with=$1; }# print "X-$x-matched-11: with=$with, remaining=$rcvd->[$x]->{'value'} $CRLF"; } if ($rcvd->[$x]->{'value'} =~ s/^from\s+?($RDNS) \(HELO ($HELO)\) \(($LUSER)\@\[?($IP)\]?//gis) { $rdns=$1; $helo=$2; $idnt=$3; $ipad=$4; }# print "X-$x-matched-12: rdns=$rdns, helo=$helo, idnt=$idnt, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($RDNS) \(HELO ($HELO)\) \(\[?($IP)\]?//gis) { $rdns=$1; $helo=$2; $ipad=$3; }# print "X-$x-matched-13: rdns=$rdns, helo=$helo, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($RDNS) \(\[($IP)\] helo=($HELO)\)//gis) { $rdns=$1; $ipad=$2; $helo=$3; }# print "X-$x-matched-14: rdns=$rdns, ipad=$ipad, helo=$helo, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($RDNS) \(($LUSER)\@\[?($IP)\]?\)//gis) { $rdns=$1; $idnt=$2; $ipad=$3; }# print "X-$x-matched-15: rdns=$rdns, idnt=$idnt, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($RDNS)\(($IP)\)//gis) { $rdns=$1; $ipad=$2; }# print "X-$x-matched-16: rdns=$rdns, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?\[($IP)\] \(helo=($HELO) ident=($LUSER)\)//gis) { $ipad=$1; $helo=$2; $idnt=$3; }# print "X-$x-matched-17: ipad=$ipad, helo=$helo, idnt=$idnt, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?\[($IP)\] \(account ($LUSER) HELO ($HELO)\)//gis) { $ipad=$1; $idnt=$2; $helo=$3; }# print "X-$x-matched-18: ipad=$ipad, idnt=$idnt, helo=$helo, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?\[($IP)\] \(helo=($HELO)\)//gis) { $ipad=$1; $helo=$2; }# print "X-$x-matched-19: ipad=$ipad, helo=$helo, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?\[?($IP)\]?:?\d*? \(HELO ($HELO)\)//gis) { $ipad=$1; $helo=$2; }# print "X-$x-matched-20: ipad=$ipad, helo=$helo, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(IDENT:($LUSER)\@($RDNS) \[($IP)\]//gis) { $helo=$1; $idnt=$2; $rdns=$3; $ipad=$4; }# print "X-$x-matched-21: helo=$helo, idnt=$idnt, rdns=$rdns, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(?\s?\[($IP)\]//gis) { $helo=$1; $rdns=$2; $ipad=$3; }# print "X-$x-matched-22: helo=$helo, rdns=$rdns, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(\[($IP)\] ident=($LUSER)\)//gis) { $helo=$1; $ipad=$2; $idnt=$3; }# print "X-$x-matched-23: helo=$helo, ipad=$ipad, idnt=$idnt, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(proxying for ($IP)\) \(.*? user ($LUSER)\)//gis) { $helo=$1; $ipad=$2; $idnt=$3; }# print "X-$x-matched-24: helo=$helo, ipad=$ipad, idnt=$idnt, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(account ($LUSER) \[($IP)\] verified\)//gis) { $helo=$1; $idnt=$2; $ipad=$3; }# print "X-$x-matched-25: helo=$helo, idnt=$idnt, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?\(?($HELO) \(?\[?($IP)\]?\)?//gis) { $helo=$1; $ipad=$2; }# print "X-$x-matched-26: helo=$helo, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(localhost \[.*?:($IP)\]\)//gis) { $helo=$1; $ipad=$2; }# print "X-$x-matched-27: helo=$helo, ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(($LUSER)\@($RDNS)\)//gis) { $helo=$1; $idnt=$2; $rdns=$3; }# print "X-$x-matched-28: helo=$helo, idnt=$idnt, rdns=$rdns, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO) \(($RDNS)\)//gis) { $helo=$1; $rdns=$2; }# print "X-$x-matched-29: helo=$helo, rdns=$rdns, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/\(from\s+?($LUSER)\@($RDNS)\)//gis) { $idnt=$1; $rdns=$2; }# print "X-$x-matched-30: idnt=$idnt, rdns=$rdns, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/\(from\s+?($LUSER)\@($HELO)\)//gis) { $idnt=$1; $helo=$2; }# print "X-$x-matched-31: idnt=$idnt, helo=$helo, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?\(?\[?($IP)\]?\)?//gis) { $ipad=$1; }# print "X-$x-matched-32: ipad=$ipad, remaining=$rcvd->[$x]->{'value'} $CRLF"; } elsif ($rcvd->[$x]->{'value'} =~ s/^from\s+?($HELO)(?=\W|;|$)//gis) { $helo=$1; }# print "X-$x-matched-33: helo=$helo, remaining=$rcvd->[$x]->{'value'} $CRLF"; } # lookup IP if not provided $ipad = host($rdns) if !$ipad && $rdns && $options =~ /d/; $ipad = host($helo) if !$ipad && !$rdns && $helo && $helo =~ /$DOMAIN/ && $options =~ /d/; # exclude lines with no IP #next if !$ipad && ((scalar @$rcvd) > 1); # ensure the local received line has a date stamp $date = gmtime time unless $date || $x; # save "from" info for comparison in next iteration $rcvd->[$x]->{'rdns'} = $rdns; $rcvd->[$x]->{'ipad'} = $ipad; $rcvd->[$x]->{'date'} = $date; # exclude lines from local, private (RFC 1918), and invalid IP address ranges my $reserved = qr~^((?:127\.)|(?:10\.)|(?:172\.(?:1[6-9]|2[0-9]|31)\.)|(?:192\.168\.)|(?:169\.254\.))~; my $valid = qr~^((?:0?0?\d|[01]?\d\d|2[0-4]\d|25[0-5])\.(?:0?0?\d|[01]?\d\d|2[0-4]\d|25[0-5])\.(?:0?0?\d|[01]?\d\d|2[0-4]\d|25[0-5])\.(?:0?0?\d|[01]?\d\d|2[0-4]\d|25[0-5]))$~; next if ($rdns =~ /localhost/i || $ipad =~ /$reserved/ || $ipad !~ /$valid/) && ((scalar @$rcvd) > 1); # lookup MTA IP/rDNS if not provided $mtai = host($mtan) if !$mtai && $mtan && $options =~ /d/; $mtan = host($mtai) if !$mtan && $mtai && $options =~ /d/; # exclude lines from within our class B (/16) network next if (($edge_ip && $ipad && is_same_class_B($edge_ip,$ipad))||(!$edge_ip && $mtai && $ipad && is_same_class_B($mtai,$ipad))) && ((scalar @$rcvd) > 1); # perform reverse DNS lookup if not provided by MTA $rdns = host($ipad) if !$rdns && $ipad && $options =~ /d/; # force a reverse DNS lookup on all IPs, even those with an RDNS set by the MTA $rdns = host($ipad) if $ipad && $options =~ /f/; # perform ASN lookup (RFC 1930/2270) my $asn = ""; $asn = asn($ipad) if $ipad && $options =~ /a/; # perform SPF lookup my $result = ""; my $smtp_comment = ""; my $header_comment = ""; my $spf_record = ""; if ($options =~ /p/) { &retie if $dbfile && !tied %db; if (scalar @cidr_list && eval{Net::CIDR::cidrlookup($ipad, @cidr_list)}) { $result = "pass"; $header_comment = "$ipad is locally whitelisted"; } elsif ($dbfile && $db{$ipad}) { $result = "pass"; $header_comment = "$ipad is authenticated via poprelayd"; } elsif ($rtrn && $ipad) { my $srvr = $rdns?$rdns:($helo?$helo:$ipad); my $query = new Mail::SPF::Query (ip=>$ipad, sender=>$rtrn, helo=>$srvr, trusted=>0, guess=>0) or error("warn","SPF lookup failed: $!"); ($result, # pass | fail | softfail | neutral | none | error | unknown [mechanism] $smtp_comment, # "please see http://www.openspf.org/why.html?..." when rejecting, return this string to the SMTP client $header_comment, # prepend_header("Received-SPF" => "$result ($header_comment)") $spf_record, # "v=spf1 ..." original SPF record for the domain ) = $query->result(); } else { $result = "error"; $header_comment = "unable to determine sender info"; } } # we implicitely trust the received line set "by" our own server as valid (first untrusted "from") if (!$edge_ip) { $edge_ip = $mtai; $rcvd->[$x]->{'sane'} = set_rcvd($helo,$ipad,$idnt,$rdns,$from,$mtan,$mtai,$mtav,$fore,$with,$date,$asn,$result); $rcvd->[$x]->{'spf'} = "$result ($header_comment)" if $options =~ /p/; } # now we'll try to establish the validity of each received line by checking # for continuity and rejecting lines that don't fit the "from/by" chain else { #print " by " . $mtan . " / prev from " . $rcvd->[$x-1]->{'rdns'} . "$CRLF"; #print " by " . $mtai . " / prev from " . $rcvd->[$x-1]->{'ipad'} . "$CRLF"; if ( ( ($mtan && $rcvd->[$x-1]->{'rdns'} && $mtan =~ /$rcvd->[$x-1]->{'rdns'}/) || ($mtai && $rcvd->[$x-1]->{'ipad'} && $mtai =~ /$rcvd->[$x-1]->{'ipad'}/) ) && (!$untrusted) ) { $rcvd->[$x]->{'sane'} = set_rcvd($helo,$ipad,$idnt,$rdns,$from,$mtan,$mtai,$mtav,$fore,$with,$date,$asn,$result); $rcvd->[$x]->{'spf'} = "$result ($header_comment)" if $options =~ /p/; } else { $helo = "untrusted-".$helo if $helo; $ipad = "untrusted-".$ipad if $ipad; $idnt = "untrusted-".$idnt if $idnt; $rdns = "untrusted-".$rdns if $rdns; $from = "untrusted-".$from if $from; $mtan = "untrusted-".$mtan if $mtan; $mtai = "untrusted-".$mtai if $mtai; $mtav = "untrusted-".$mtav if $mtav; $fore = "untrusted-".$fore if $fore; $with = "untrusted-".$with if $with; $date = ""; $asn = ""; $result = ""; $rcvd->[$x]->{'sane'} = set_rcvd($helo,$ipad,$idnt,$rdns,$from,$mtan,$mtai,$mtav,$fore,$with,$date,$asn,$result); $untrusted = 1; } } }} return $rcvd; } sub is_same_class_B { my ($ip1,$ip2) = @_; $ip1 =~ s/^(\d{1,3}\.\d{1,3}\.).*?$/$1/gis; $ip2 =~ s/^(\d{1,3}\.\d{1,3}\.).*?$/$1/gis; return ($ip1 eq $ip2)? 1:0; } sub asn { my $target = shift; my $output = ""; my $IP = qr~(?:\d{1,3}\.){3}\d{1,3}~; my $DOMAIN = qr~(?:\w|-|\.)+?\.\w{2,4}~; if ( $target =~ s/(\d{1,3})\.(\d{1,3})\.(\d{1,3})\.(\d{1,3})/$4.$3.$2.$1.$asn_server/ ) { # uncomment this code if you do not want to use Net::DNS::Resolver and you have 'host' on your system #open (HOST, "host -t txt $target 2>/dev/null |") or error("warn","Host lookup failed: $!"); #while () { $output = $1 if /\Q$target\E(?: descriptive)? text "(\d*?)".*/; } #close HOST; # find ASN info via Net::DNS::Resolver if (my $query = $res->send($target,"TXT")) { foreach ($query->answer) { $output = $1 if $_->string =~ /$DOMAIN\.\s+?\d+?\s+?IN\s+?TXT\s+?"(\d+?)"\s+?"$IP"\s+?"\d+?"/; }} #else { error("warn","ASN lookup failed: " . $res->errorstring); } } return $output; } sub host { my $target = shift; my $output = ""; my $IP = qr~(?:\d{1,3}\.){3}\d{1,3}~; my $DOMAIN = qr~(?:\w|-|\.)+?\.\w{2,4}~; if ($target =~ s/($IP|$DOMAIN)/$1/) { # uncomment this code if you do not want to use Net::DNS::Resolver and you have 'host' on your system #open (HOST, "host $target 2>/dev/null |") or error("warn","Host lookup failed: $!"); #while () { $output = $1 if /$DOMAIN (?:domain name pointer|has address) ($IP|$DOMAIN)\.?/; } #close HOST; # find DNS info via Net::DNS::Resolver if (my $query = $res->send($target)) { foreach ($query->answer) { $output = $1 if $_->string =~ /$DOMAIN\.\s+?\d+?\s+?IN\s+?(?:PTR|A)\s+?($IP|$DOMAIN)\.?/; }} #else { error("warn","DNS lookup failed: " . $res->errorstring); } } return $output; } sub set_rcvd { my ($helo,$ipad,$idnt,$rdns,$from,$mtan,$mtai,$mtav,$fore,$with,$date,$asn,$spf) = @_; my $output = "from"; if ($options =~ /e/) { $output .= ($helo)? " helo-$helo" : "";} # sender's salutation $output .= ($rdns)? " $rdns" : ""; # sender's name $output .= ($ipad)? " $ipad" : ""; # sender's IP $output .= ($spf)? " spf-$spf" : ""; # sender's policy result $output .= ($asn)? " as$asn" : ""; # sender's ASN $output .= ($mtan||$mtai)? " $CRLF\t by" : ""; $output .= ($mtan)? " $mtan" : ""; # receiving MTA's name $output .= ($mtai)? " $mtai" : ""; # receiving MTA's IP $output .= ($fore)? " $CRLF\t for" : ""; $output .= ($fore)? " <$fore>" : ""; # envelope to address $output .= ($date)? "; $date" : ""; # received date/time #print "outputting received: $output" . $CRLF; return $output; } sub opendb_read { tie(%db, "DB_File", $dbfile, O_RDONLY, 0, $DB_HASH) or error("warn","Can't open $dbfile: $!"); } sub closedb { untie %db; undef %db; } sub retie { &closedb; &opendb_read; } ################################################ ################ Output Header ################# ################################################ sub set_header { my $header = shift; my $output = ""; my $name = ""; # exclude the "masked fields" from display foreach $name (split(/,/,$masked_fields)) { $spec_fields =~ s/(?<=,)$name,?//; } # output the fields in the order specified by RFC 2822 - minus the masked fields foreach $name (split(/,/,$spec_fields)) { $output .= set_field($header,$name); delete $header->{$name}; } # set any user-specified fields foreach $name (split(/,/,$user_fields)) { $output .= set_field($header,$name); delete $header->{$name}; } # set new custom x-header fields if ($options =~ /x/) { foreach $name (split(/,/,$new_fields)) { $output .= set_field($header,$name); delete $header->{$name}; } } # then set any remaining fields (if allowed to set non-standard fields) if ($options !~ /s/) { foreach $name (keys %{$header}) { $output .= set_field($header,$name); } } $output .= $CRLF; return $output; } sub set_field { my $header = shift; my $name = shift; my $output = ""; if ((defined $header->{$name}) && (ref($header->{$name}) eq "ARRAY")) { for (my $x = 0; $x < scalar @{$header->{$name}}; $x++) { if (($name eq "received") && ($options =~ /r/)) { if (defined $header->{$name}->[$x]->{'sane'} && $header->{$name}->[$x]->{'sane'} =~ /\w/) { $output .= $header->{$name}->[$x]->{'name'} . ": " . $header->{$name}->[$x]->{'sane'} . $CRLF; } #else { $output .= $header->{$name}->[$x]->{'name'} . ": sanity check failed" . $CRLF; } } elsif ($header->{$name}->[$x]->{'value'} =~ /\w/) { $output .= $header->{$name}->[$x]->{'name'} . ": " . $header->{$name}->[$x]->{'value'} . $CRLF; } } } elsif (defined $header->{$name}) { $output .= ucfirst($name) . ": " . $header->{$name} . $CRLF; } elsif ($req_fields =~ /(?:^|,)$name(?:,|$)/) { $output .= ucfirst($name) . ": [no-$name] " . $CRLF; } return $output; } ################################################ ################ Error Handling ################ ################################################ sub error { my ($action,$msg) = @_; die $msg if $action eq "die"; warn $msg unless $action eq "die"; # add other actions if you like } sub sig_trap { my $sig = shift; my ($action,$more) = ("warn",""); sig: { $action = "die", last sig if $sig =~ /ALRM/; $action = "warn", last sig if $sig =~ /PIPE/; $action = "warn", last sig if $sig =~ /CHLD/; $action = "die" , last sig if $sig =~ /INT/; $action = "die" , last sig if $sig =~ /HUP/; $action = "warn"; } my $waitedpid = wait; $more = "; Reaped pid $waitedpid, exited with status " . ($? >> 8) if $waitedpid; $SIG{$sig} = \&sig_trap; error ($action,"Trapped signal SIG$sig$more"); } ################################################ ################################################ ################################################ bogofilter-1.2.4/contrib/bogofilter-qfe.sh0000755000175000017500000000345512163572305016755 0ustar sezsez#!/bin/sh #This a qmail specific bogofilter frontend script which allows the use of a centralized bogofilter #running on an smtp mail server #Copyright (C) Gyepi Sam 2002 #Change this! domain='example.com' #Change this if you want. sender='postmaster' TMPDIR='/tmp' opt="X" case "$EXT2" in register-spam) # register as spam opt="-s" ;; register-nonspam) # register as non-spam opt="-n" ;; spam) # unregister as ham # register as spam opt="-Ns" ;; nonspam) # unregister as spam # register as ham opt="-Sn" ;; esac if [ "${opt}" = "X" ]; then tmpfile=$(mktemp "$TMPDIR/bogofilter-fe-$$.XXXXXX") cat - > $tmpfile #Quite a few MUAs use Resent-* headers recipient=$(formail -x Resent-From < $tmpfile|grep -i $domain| tr '\n' ',') #but some don't if [ "${recipient}X" = "X" ]; then recipient=$SENDER echo "bogofilter-qfe: defaulting error response to $SENDER" fi #may need to weed out specific recipients here subject=$(formail -x Subject < $tmpfile) rm -f $tmpfile if [ -z "$recipient" ]; then exit 0 fi /usr/qmail/bin/qmail-inject -f$sender@$domain $recipient< To:$recipient Subject: Re:$subject I was unable to understand the message you sent to $RECIPIENT. To correct a bogofilter classification: Send mis-classified spam to bogofilter-spam@$domain Send mis-classified nonspam to bogofilter-nonspam@$domain To register new messages: Send spam to bogofilter-register-spam@$domain Send nonspam to bogofilter-register-nonspam@$domain In either case, be sure to 'bounce' or 'resend' the message rather than forwarding it. EOF else exec /usr/bin/formail -c | \ /bin/sed "/^Resent/d; /^Delivered-To/d; /^Received.*$domain/d; /^X-Bogosity/d" | \ /usr/bin/bogofilter -d /home/bogofilter $opt fi bogofilter-1.2.4/Doxyfile0000644000175000017500000020000412163572264013550 0ustar sezsez# Doxyfile 1.6.3 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = bogofilter # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doxygen # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = NO # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = YES # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 8 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it parses. # With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this tag. # The format is ext=language, where ext is a file extension, and language is one of # the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP, # Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat # .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran), # use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = YES # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = YES # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = YES # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = NO # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = NO # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = YES # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen # will list include files with double quotes in the documentation # rather than with sharp brackets. FORCE_LOCAL_INCLUDES = NO # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = YES # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = YES # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by # doxygen. The layout file controls the global structure of the generated output files # in an output format independent way. The create the layout file that represents # doxygen's defaults, run doxygen with the -l option. You can optionally specify a # file name after the option, if omitted DoxygenLayout.xml will be used as the name # of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = YES # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = . \ contrib/bogogrep.c \ doc \ src \ src/tests # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = *.[ch] # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = doxygen # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = YES # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = YES # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = YES # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = NO #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = YES # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = YES # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER # are set, an additional index file will be generated that can be used as input for # Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated # HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add. # For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's # filter section matches. # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files # will be generated, which together with the HTML files, form an Eclipse help # plugin. To install this plugin and make it available under the help contents # menu in Eclipse, the contents of the directory containing the HTML and XML # files needs to be copied into the plugins directory of eclipse. The name of # the directory within the plugins directory should be the same as # the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before the help appears. GENERATE_ECLIPSEHELP = NO # A unique identifier for the eclipse help plugin. When installing the plugin # the directory name containing the HTML and XML files should also have # this name. ECLIPSE_DOC_ID = org.doxygen.Project # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = YES # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = NO # When the SERVER_BASED_SEARCH tag is enabled the search engine will be implemented using a PHP enabled web server instead of at the web client using Javascript. Doxygen will generate the search PHP script and index # file to put on the web server. The advantage of the server based approach is that it scales better to large projects and allows full text search. The disadvances is that it is more difficult to setup # and does not have live searching capabilities. SERVER_BASED_SEARCH = NO #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = NO # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = NO # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = YES # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = YES # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = YES # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES bogofilter-1.2.4/depcomp0000755000175000017500000005654612130321455013427 0ustar sezsez#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2012-07-12.20; # UTC # Copyright (C) 1999-2012 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by 'PROGRAMS ARGS'. object Object file output by 'PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputting dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac # A tabulation character. tab=' ' # A newline character. nl=' ' if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Avoid interferences from the environment. gccflag= dashmflag= # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi cygpath_u="cygpath -u -f -" if test "$depmode" = msvcmsys; then # This is just like msvisualcpp but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvisualcpp fi if test "$depmode" = msvc7msys; then # This is just like msvc7 but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvc7 fi if test "$depmode" = xlc; then # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information. gccflag=-qmakedep=gcc,-MF depmode=gcc fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## Note that this doesn't just cater to obsosete pre-3.x GCC compilers. ## but also to in-use compilers like IMB xlc/xlC and the HP C compiler. ## (see the conditional assignment to $gccflag above). ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). Also, it might not be ## supported by the other compilers which use the 'gcc' depmode. ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -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 ' ' "$nl" < "$tmpdepfile" | ## Some versions of gcc put a space before the ':'. On the theory ## that the space means something, we add a space to the output as ## well. hp depmode also adds that space, but also prefixes the VPATH ## to the object. Take care to not repeat it in the output. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like '#:fec' to the end of the # dependency line. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr "$nl" ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else # 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" ;; xlc) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts '$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then # Each line is of the form 'foo.o: dependent.h'. # Do two passes, one to just change these to # '$object: dependent.h' and one to simply 'dependent.h:'. sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" sed -e 's,^.*\.[a-z]*:['"$tab"' ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler anf tcc (Tiny C Compiler) understand '-MD -MF file'. # However on # $CC -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 ... \ # ... # tcc 0.9.26 (FIXME still under development at the moment of writing) # will emit a similar output, but also prepend the continuation lines # with horizontal tabulation characters. "$@" -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 -e "s/^[ $tab][ $tab]*/ /" -e "s,^[^:]*:,$object :," \ < "$tmpdepfile" > "$depfile" sed ' s/[ '"$tab"'][ '"$tab"']*/ /g s/^ *// s/ *\\*$// s/^[^:]*: *// /^$/d /:$/d s/$/ :/ ' < "$tmpdepfile" >> "$depfile" rm -f "$tmpdepfile" ;; ## The order of this option in the case statement is important, since the ## shell code in configure will try each of these formats in the order ## listed in this file. A plain '-MD' option would be understood by many ## compilers, so we must ensure this comes after the gcc and icc options. pgcc) # Portland's C compiler understands '-MD'. # Will always output deps to 'file.d' where file is the root name of the # source file under compilation, even if file resides in a subdirectory. # The object file name does not affect the name of the '.d' file. # pgcc 10.2 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using '\' : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= # Use the source, not the object, to determine the base name, since # that's sadly what pgcc will do too. base=`echo "$source" | sed -e 's|^.*/||' -e 's/\.[-_a-zA-Z0-9]*$//'` tmpdepfile="$base.d" # For projects that build the same source file twice into different object # files, the pgcc approach of using the *source* file root name can cause # problems in parallel builds. Use a locking strategy to avoid stomping on # the same $tmpdepfile. lockdir="$base.d-lock" trap "echo '$0: caught signal, cleaning up...' >&2; rm -rf $lockdir" 1 2 13 15 numtries=100 i=$numtries while test $i -gt 0 ; do # mkdir is a portable test-and-set. if mkdir $lockdir 2>/dev/null; then # This process acquired the lock. "$@" -MD stat=$? # Release the lock. rm -rf $lockdir break else ## the lock is being held by a different process, ## wait until the winning process is done or we timeout while test -d $lockdir && test $i -gt 0; do sleep 1 i=`expr $i - 1` done fi i=`expr $i - 1` done trap - 1 2 13 15 if test $i -le 0; then echo "$0: failed to acquire lock after $numtries attempts" >&2 echo "$0: check lockdir '$lockdir'" >&2 exit 1 fi if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile" # Add 'dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. 'cc -MD -o foo.o ...' puts the dependencies into 'foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in 'foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mechanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" sed -e 's,^.*\.[a-z]*:['"$tab"' ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; msvc7) if test "$libtool" = yes; then showIncludes=-Wc,-showIncludes else showIncludes=-showIncludes fi "$@" $showIncludes > "$tmpdepfile" stat=$? grep -v '^Note: including file: ' "$tmpdepfile" if test "$stat" = 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # The first sed program below extracts the file names and escapes # backslashes for cygpath. The second sed program outputs the file # name when reading, but also accumulates all include files in the # hold buffer in order to output them again at the end. This only # works with sed implementations that can handle large buffers. sed < "$tmpdepfile" -n ' /^Note: including file: *\(.*\)/ { s//\1/ s/\\/\\\\/g p }' | $cygpath_u | sort -u | sed -n ' s/ /\\ /g s/\(.*\)/'"$tab"'\1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/'"$tab"'/ G p }' >> "$depfile" rm -f "$tmpdepfile" ;; msvc7msys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove '-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for ':' # in the target name. This is to cope with DOS-style filenames: # a dependency such as 'c:/foo/bar' could be seen as target 'c' otherwise. "$@" $dashmflag | sed 's:^['"$tab"' ]*[^:'"$tab"' ][^:][^:]*\:['"$tab"' ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' "$nl" < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # X makedepend shift cleared=no eat=no for arg do case $cleared in no) set ""; shift cleared=yes ;; esac if test $eat = yes; then eat=no continue fi case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -arch) eat=yes ;; -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix=`echo "$object" | sed 's/^.*\././'` touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" # makedepend may prepend the VPATH from the source file name to the object. # No need to regex-escape $object, excess matching of '.' is harmless. sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' "$nl" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove '-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi IFS=" " for arg do case "$arg" in -o) shift ;; $object) shift ;; "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E 2>/dev/null | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::'"$tab"'\1 \\:p' >> "$depfile" echo "$tab" >> "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; msvcmsys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: bogofilter-1.2.4/bogofilter.spec0000644000175000017500000001316212163573321015054 0ustar sezsez# $Id: bogofilter.spec.in 6431 2006-01-22 03:28:21Z relson $ # This .spec file will not build the static package by default. # To do this, run either of the next rpm[build] commands: # # rpmbuild --define 'bogostatic 1' --sign -bb bogofilter.spec # # To build with SQLite3, use: # # rpmbuild --define 'with_sqlite 1' --sign -bb bogofilter.spec # To build -debuginfo RPMs on systems with RPM 4.2 or newer and recent # elfutils, add # # --define 'debugrpm 1' # # or place %debugrpm 1 into your ~/.rpmmacros file. %define Name bogofilter %define Version 1.2.4 %define Release 1 %{?bogostatic: %define bogostatic 1} %{!?bogostatic: %define bogostatic 0} %{?with_db42: %define with_db42 1} %{!?with_db42: %define with_db42 0} %{?with_sqlite: %define with_sqlite 1} %{!?with_sqlite: %define with_sqlite 0} %if %{with_db42} %define DBFlag 1 %define DBName -db42 %endif %if %{with_sqlite} %define DBFlag 1 %define DBName -sqlite3 %endif %{!?DBFlag: %define DBFlag 0} %{!?bf_nameext: %define bf_nameext %{nil}} Summary: Fast anti-spam filtering by Bayesian statistical analysis %if ! %{DBFlag} Name: %{Name}%{bf_nameext} %else Name: %{Name}%{DBName}%{bf_nameext} %endif Version: %{Version} Release: %{Release} License: GPL Group: Networking/Mail URL: http://bogofilter.sourceforge.net Source0: %{Name}-%{Version}.tar.gz %define _requires_exceptions perl Buildroot: %{_tmppath}/%{Name}-%{Version}-root Conflicts: %{Name}%{DBName}-static %description Bogofilter is a Bayesian spam filter. In its normal mode of operation, it takes an email message or other text on standard input, does a statistical check against lists of "good" and "bad" words, and returns a status code indicating whether or not the message is spam. Bogofilter is designed with fast algorithms (including Berkeley DB system), coded directly in C, and tuned for speed, so it can be used for production by sites that process a lot of mail. %if %{with_sqlite} This version was built with SQLite3 support. %else This version was built with Berkeley DB support. %endif %package static Summary: Statically linked Group: Networking/Mail Conflicts: %{Name}%{DBName} %description static Statically linked bogofilter, bogolexer, bogoutil, and bogotune. # use the debug_package macro if applicable: %{?debugrpm:%debug_package} %prep %setup -q -n %{Name}-%{Version} CFLAGS="$RPM_OPT_FLAGS" \ ./configure \ --prefix=%{_prefix} \ --mandir=%{_mandir} \ --sysconfdir=%{_sysconfdir} \ %if %{?bogostatic} --enable-static \ %endif %if %{?with_db42} --with-database=db \ %endif %if %{?with_sqlite} --with-database=sqlite3 \ %endif --with-included-gsl %build make make DESTDIR="%{buildroot}" check %clean [ -n "%{buildroot}" -a "%{buildroot}" != / ] && rm -rf %{buildroot} %install [ -n "%{buildroot}" -a "%{buildroot}" != / ] && rm -rf %{buildroot} make DESTDIR=%{buildroot} install cp %{buildroot}%{_sysconfdir}/bogofilter.cf.example \ %{buildroot}%{_sysconfdir}/bogofilter.cf for n in xml html ; do install -d .inst/$n install -m644 doc/*.$n .inst/$n done for n in `find %{buildroot}%{_datadir}/%{name} -type d` ; do chmod o-w $n done for d in contrib ; do install -d %{buildroot}%{_datadir}/%{name}/$d files=$(find "$d" -maxdepth 1 -type f -print) for f in $files ; do case $f in *.c|*.o|*.obj|*/Makefile*) continue ;; *.1) cp -p $f %{buildroot}%{_mandir}/man1 ;; *) cp -p $f %{buildroot}%{_datadir}/%{name}/$d ;; esac done done mv bogogrep* contrib %if %{bogostatic} ( cd %{buildroot}%{_datadir}/%{name} cp -p -r contrib contrib-static rm contrib/bogogrep_static rm contrib-static/bogogrep strip contrib-static/bogogrep_static ) %endif %post %post static for file in bogofilter bogolexer bogoutil bogotune ; do if [ $1 -lt 2 ] ; then ln -s %{_bindir}/${file}_static %{_bindir}/${file} fi done %postun static for file in bogofilter bogolexer bogoutil bogotune ; do if [ $1 -eq 0 ] ; then rm -f %{_bindir}/${file} echo rm -f %{_bindir}/${file} fi done %files %defattr(-,root,root) %doc AUTHORS COPYING INSTALL %doc GETTING.STARTED %doc NEWS README* RELEASE.NOTES TODO %doc doc/bogofilter-tuning.HOWTO.html %doc doc/bogofilter-SA-2002-01 %doc doc/integrating* %doc doc/programmer %doc doc/README.*db doc/rpm.notes.BerkeleyDB %doc .inst/html .inst/xml %{_sysconfdir}/bogofilter.cf.example %config(noreplace) %{_sysconfdir}/bogofilter.cf %{_bindir}/bogofilter %{_bindir}/bogolexer %{_bindir}/bogotune %{_bindir}/bogoutil %{_bindir}/bogoupgrade %{_bindir}/bf_copy %{_bindir}/bf_compact %{_bindir}/bf_tar %{_mandir}/man1/bogofilter.1* %{_mandir}/man1/bogolexer.1* %{_mandir}/man1/bogotune.1* %{_mandir}/man1/bogoutil.1* %{_mandir}/man1/bogoupgrade.1* %{_mandir}/man1/bf_compact.1* %{_mandir}/man1/bf_copy.1* %{_mandir}/man1/bf_tar.1* %{_datadir}/%{name}/contrib/* %if %{bogostatic} %files static %defattr(-,root,root) %doc AUTHORS COPYING INSTALL %doc GETTING.STARTED %doc NEWS README* RELEASE.NOTES TODO %doc doc/bogofilter-tuning.HOWTO.html %doc doc/bogofilter-SA-2002-01 %doc doc/integrating* %doc doc/programmer %doc doc/README.*db doc/rpm.notes.BerkeleyDB %doc .inst/html .inst/xml %{_sysconfdir}/bogofilter.cf.example %config(noreplace) %{_sysconfdir}/bogofilter.cf %{_bindir}/bogofilter_static %{_bindir}/bogolexer_static %{_bindir}/bogotune_static %{_bindir}/bogoutil_static %{_bindir}/bogoupgrade %{_bindir}/bf_copy %{_bindir}/bf_compact %{_bindir}/bf_tar %{_mandir}/man1/bogofilter.1* %{_mandir}/man1/bogolexer.1* %{_mandir}/man1/bogotune.1* %{_mandir}/man1/bogoutil.1* %{_mandir}/man1/bogoupgrade.1* %{_mandir}/man1/bf_compact.1* %{_mandir}/man1/bf_copy.1* %{_mandir}/man1/bf_tar.1* %{_datadir}/%{name}/contrib-static/* %endif %changelog bogofilter-1.2.4/install-sh0000755000175000017500000003325512130321455014046 0ustar sezsez#!/bin/sh # install - install a program, script, or datafile scriptversion=2011-11-20.07; # UTC # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # 'make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call 'install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then do_exit='(exit $ret); exit $ret' trap "ret=129; $do_exit" 1 trap "ret=130; $do_exit" 2 trap "ret=141; $do_exit" 13 trap "ret=143; $do_exit" 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names problematic for 'test' and other utilities. case $src in -* | [=\(\)!]) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; [-=\(\)!]*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test X"$d" = X && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: bogofilter-1.2.4/GETTING.STARTED0000644000175000017500000002356512163572311014203 0ustar sezsez GETTING STARTED Summary: 0. Terminology 1. Installing Bogofilter 2. Preparing for use a. Configuring bogofilter b. Training bogofilter 3. Setting up the mail transfer and delivery agents 4. Use with mail user agent 5. Ongoing training 6. Tuning bogofilter 7. The bogoutil program 8. Other useful commands 9. Additional information 0. Terminology -------------- spam - unwanted email ham - wanted mail (also called non-spam) false positive - a ham message that is wrongly scored as spam false negative - a spam message that is wrongly scored as ham 1. Installing Bogofilter ------------------------ Bogofilter can be installed from source or from a binary package. Releases are made available on SourceForge.net. If you're a newbie, installing from a binary package is quickest and easiest. If you're running an rpm based distro like Mandrake or Suse, install bogofilter from an rpm. Similarly if you're running Debian, install from a deb package. Source formats include tarballs (in .tar.gz and .tar.bz2 forms) and rpms (bogofilter-VER.src.rpm). Once downloaded and untarred, build and install with the usual commands, i.e. "configure", "make", and "make install". To ensure that the newly built bogofilter is running properly on your hardware and operating system, use "make check" to run a series of tests. For source rpms, use "rpm -bb bogofilter.spec" and "rpm -ivh bogofilter" (or comparable commands). Binary formats include builds for dynamically linked (shared) libaries, e.g. bogofilter-VER.i586.rpm, and a statically linked executable, e.g. bogofilter-static-VER.i586.rpm. It is also available as a .deb pack (use "apt-get bogofilter" to install) and via yum (use "yum install bogofilter"). See the INSTALL file for more info. 2. Preparing for use -------------------- Once bogofilter has been installed, it needs to be configured and trained, i.e. given messages that you classify as spam and ham. 2a. Configuring bogofilter -------------------------- Bogofilter's default configuration is conservative, i.e. only messages that score very high on the ham/spam scale are classified as spam. This is done to minimize the number of false positives (non-spam messages which are classified as spam). If you need (or wish) to change bogofilter's configuration options, the file is named "bogofilter.cf" and bogofilter first checks for /etc/bogofilter.cf and then for ~/.bogofilter/bogofilter.cf. The configuration options are described in file bogofilter.cf.example. 2b. Training bogofilter ----------------------- Bogofilter uses a database for storing its tokens and their ham and spam counts. The file is commonly called "the wordlist" and its standard location is ~/.bogofilter/wordlist.db. The simple rule when training bogofilter is "more is better". As distributed, bogofilter does not include a wordlist. You, the user, need to tell bogofilter what you consider spam and what you consider ham. This is bogofilter's training process and involves running bogofilter with appropriate flags and with messages you've determined are ham and spam. As bogofilter can work with multiple mail formats, e.g. mailboxes, maildirs, MH directories, etc, the training commands will depend on your environment. As the default wordlist directory is $HOME/.bogofilter, the wordlist itself will be in $HOME/.bogofilter/wordlist.db. For user john, this is /home/john/.bogofilter/wordlist.db. Some useful options for training include: -s - register message(s) as spam. -n - register message(s) as non-spam. -M - use mailbox mode, i.e. classify multiple messages in an mbox formatted file. -B file1, file2, ... - set bulk mode, i.e. process multiple messages (files or directories) named on the command line. -v - sets the verbosity level, with the -s and -n training options, this will give the number of messages read and words entered in wordlist.db These options are documented in the bogofilter man page. Here are some sample commands: bogofilter -vn < ham.message.file bogofilter -vnM , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try '$0 --help' for more information" exit 1 fi run=: sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' sed_minuso='s/.* -o \([^ ]*\).*/\1/p' # In the cases where this matters, 'missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case $1 in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle 'PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file 'aclocal.m4' autoconf touch file 'configure' autoheader touch file 'config.h.in' autom4te touch the output file, or create a stub one automake touch all 'Makefile.in' files bison create 'y.tab.[ch]', if possible, from existing .[ch] flex create 'lex.yy.c', if possible, from existing .c help2man touch the output file lex create 'lex.yy.c', if possible, from existing .c makeinfo touch the output file yacc create 'y.tab.[ch]', if possible, from existing .[ch] Version suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and 'g' are ignored when checking the name. Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown '$1' option" echo 1>&2 "Try '$0 --help' for more information" exit 1 ;; esac # normalize program name to check for. program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). This is about non-GNU programs, so use $1 not # $program. case $1 in lex*|yacc*) # Not GNU programs, they don't have --version. ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running '$TOOL --version' or '$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case $program in aclocal*) echo 1>&2 "\ WARNING: '$1' is $msg. You should only need it if you modified 'acinclude.m4' or '${configure_ac}'. You might want to install the Automake and Perl packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf*) echo 1>&2 "\ WARNING: '$1' is $msg. You should only need it if you modified '${configure_ac}'. You might want to install the Autoconf and GNU m4 packages. Grab them from any GNU archive site." touch configure ;; autoheader*) echo 1>&2 "\ WARNING: '$1' is $msg. You should only need it if you modified 'acconfig.h' or '${configure_ac}'. You might want to install the Autoconf and GNU m4 packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case $f in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: '$1' is $msg. You should only need it if you modified 'Makefile.am', 'acinclude.m4' or '${configure_ac}'. You might want to install the Automake and Perl packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te*) echo 1>&2 "\ WARNING: '$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get '$1' as part of Autoconf from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison*|yacc*) echo 1>&2 "\ WARNING: '$1' $msg. You should only need it if you modified a '.y' file. You may need the Bison package in order for those modifications to take effect. You can get Bison from any GNU archive site." rm -f y.tab.c y.tab.h if test $# -ne 1; then eval LASTARG=\${$#} case $LASTARG in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.h fi ;; esac fi if test ! -f y.tab.h; then echo >y.tab.h fi if test ! -f y.tab.c; then echo 'main() { return 0; }' >y.tab.c fi ;; lex*|flex*) echo 1>&2 "\ WARNING: '$1' is $msg. You should only need it if you modified a '.l' file. You may need the Flex package in order for those modifications to take effect. You can get Flex from any GNU archive site." rm -f lex.yy.c if test $# -ne 1; then eval LASTARG=\${$#} case $LASTARG in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if test ! -f lex.yy.c; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man*) echo 1>&2 "\ WARNING: '$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the Help2man package in order for those modifications to take effect. You can get Help2man from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit $? fi ;; makeinfo*) echo 1>&2 "\ WARNING: '$1' is $msg. You should only need it if you modified a '.texi' or '.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy 'make' (AIX, DU, IRIX). You might want to install the Texinfo package or the GNU make package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n ' /^@setfilename/{ s/.* \([^ ]*\) *$/\1/ p q }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; *) echo 1>&2 "\ WARNING: '$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the 'README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing '$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: bogofilter-1.2.4/config.in0000644000175000017500000002623112163573323013644 0ustar sezsez/* config.in. Generated from configure.ac by autoheader. */ /* Default charset is CP866 rather than iso-8859-1 */ #undef CP866 /* Define name of current directory (C string) */ #undef CURDIR_S /* database file extension */ #undef DB_EXT /* database type */ #undef DB_TYPE /* Use specified charset */ #undef DEFAULT_CHARSET /* Define directory separator (C character) */ #undef DIRSEP_C /* Define directory separator (C string) */ #undef DIRSEP_S /* Disable transactional mode in Berkeley DB */ #undef DISABLE_TRANSACTIONS /* Disable converting character sets to Unicode */ #undef DISABLE_UNICODE /* Enable Berkeley DB datastore */ #undef ENABLE_DB_DATASTORE /* Enable memory usage debugging */ #undef ENABLE_MEMDEBUG /* Enable qdbm datastore */ #undef ENABLE_QDBM_DATASTORE /* Enable sqlite3 datastore */ #undef ENABLE_SQLITE_DATASTORE /* Enable tokyocabinet datastore */ #undef ENABLE_TOKYOCABINET_DATASTORE /* Force transactional mode in Berkeley DB */ #undef ENABLE_TRANSACTIONS /* Enable converting character sets to Unicode */ #undef ENABLE_UNICODE /* Define file extension separator (C string) */ #undef EXTSEP_S /* Define to 1 if you have the `arc4random' function. */ #undef HAVE_ARC4RANDOM /* Have suitable db.h header */ #undef HAVE_DB_H /* Define to 1 if you have the declaration of `db_create', and to 0 if you don't. */ #undef HAVE_DECL_DB_CREATE /* Define to 1 if you have the declaration of `getopt', and to 0 if you don't. */ #undef HAVE_DECL_GETOPT /* Define to 1 if you have the declaration of `optreset', and to 0 if you don't. */ #undef HAVE_DECL_OPTRESET /* Define to 1 if you have the declaration of `O_DSYNC', and to 0 if you don't. */ #undef HAVE_DECL_O_DSYNC /* Define to 1 if you have the declaration of `O_FSYNC', and to 0 if you don't. */ #undef HAVE_DECL_O_FSYNC /* Define to 1 if you have the declaration of `O_SYNC', and to 0 if you don't. */ #undef HAVE_DECL_O_SYNC /* Define to 1 if you have the header file, and it defines `DIR'. */ #undef HAVE_DIRENT_H /* Define to 1 if you don't have `vprintf' but do have `_doprnt.' */ #undef HAVE_DOPRNT /* Define to 1 if your compiler supports extern inline storage class. */ #undef HAVE_EXTERN_INLINE /* Define to 1 if you have the header file. */ #undef HAVE_FCNTL_H /* Define to 1 if you have the header file. */ #undef HAVE_FLOAT_H /* Define to 1 if you have the `getopt_long' function. */ #undef HAVE_GETOPT_LONG /* Define to 1 if you have the `getpagesize' function. */ #undef HAVE_GETPAGESIZE /* Define if you have GNU Scientific Library 1.0 or newer */ #undef HAVE_GSL_10 /* Define if you have GNU Scientific Library 1.4 or newer */ #undef HAVE_GSL_14 /* Define if you have the iconv() function. */ #undef HAVE_ICONV /* define to 1 if 'inline' is supported */ #undef HAVE_INLINE /* Define to 1 if the system has the type `int16_t'. */ #undef HAVE_INT16_T /* Define to 1 if the system has the type `int32_t'. */ #undef HAVE_INT32_T /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the `m' library (-lm). */ #undef HAVE_LIBM /* Define to 1 if you have the header file. */ #undef HAVE_LIMITS_H /* Define to 1 if you have the `memcpy' function. */ #undef HAVE_MEMCPY /* Define to 1 if you have the `memmove' function. */ #undef HAVE_MEMMOVE /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if you have a working `mmap' system call. */ #undef HAVE_MMAP /* Define to 1 if you have the header file, and it defines `DIR'. */ #undef HAVE_NDIR_H /* Define to 1 if the system has the type `rlim_t'. */ #undef HAVE_RLIM_T /* Define to 1 if the system has the type `sig_atomic_t'. */ #undef HAVE_SIG_ATOMIC_T /* Define to 1 if you have the `snprintf' function. */ #undef HAVE_SNPRINTF /* Define to 1 if you have the header file. */ #undef HAVE_SQLITE3_H /* Define to 1 if the system has the type `ssize_t'. */ #undef HAVE_SSIZE_T /* Define to 1 if you have the header file. */ #undef HAVE_STDARG_H /* Define to 1 if stdbool.h conforms to C99. */ #undef HAVE_STDBOOL_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 `strchr' function. */ #undef HAVE_STRCHR /* Define to 1 if you have the `strerror' function. */ #undef HAVE_STRERROR /* 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 `strlcat' function. */ #undef HAVE_STRLCAT /* Define to 1 if you have the `strlcpy' function. */ #undef HAVE_STRLCPY /* Define to 1 if you have the `strrchr' function. */ #undef HAVE_STRRCHR /* Define to 1 if you have the `strtoul' function. */ #undef HAVE_STRTOUL /* Define to 1 if you have the header file. */ #undef HAVE_SYSLOG_H /* Define to 1 if you have the header file, and it defines `DIR'. */ #undef HAVE_SYS_DIR_H /* Define to 1 if you have the header file, and it defines `DIR'. */ #undef HAVE_SYS_NDIR_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_PARAM_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_SELECT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_SOCKET_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_TIME_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if the system has the type `uint'. */ #undef HAVE_UINT /* Define to 1 if the system has the type `uint16_t'. */ #undef HAVE_UINT16_T /* Define to 1 if the system has the type `uint32_t'. */ #undef HAVE_UINT32_T /* Define to 1 if the system has the type `ulong'. */ #undef HAVE_ULONG /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Define to 1 if the system has the type `u_int16_t'. */ #undef HAVE_U_INT16_T /* Define to 1 if the system has the type `u_int32_t'. */ #undef HAVE_U_INT32_T /* Define to 1 if the system has the type `u_int8_t'. */ #undef HAVE_U_INT8_T /* Define to 1 if you have the header file. */ #undef HAVE_VALUES_H /* Define to 1 if you have the `vprintf' function. */ #undef HAVE_VPRINTF /* Define to 1 if you have the `vsnprintf' function. */ #undef HAVE_VSNPRINTF /* Define to 1 if the system has the type `_Bool'. */ #undef HAVE__BOOL /* Define as const if the declaration of iconv() needs const. */ #undef ICONV_CONST /* Define to 1 if trio is to be included. */ #undef NEEDTRIO /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the home page for this package. */ #undef PACKAGE_URL /* Define to the version of this package. */ #undef PACKAGE_VERSION /* Define to the type of arg 1 for `select'. */ #undef SELECT_TYPE_ARG1 /* Define to the type of args 2, 3 and 4 for `select'. */ #undef SELECT_TYPE_ARG234 /* Define to the type of arg 5 for `select'. */ #undef SELECT_TYPE_ARG5 /* The size of `int', as computed by sizeof. */ #undef SIZEOF_INT /* The size of `long', as computed by sizeof. */ #undef SIZEOF_LONG /* The size of `short', as computed by sizeof. */ #undef SIZEOF_SHORT /* The size of `size_t', as computed by sizeof. */ #undef SIZEOF_SIZE_T /* Use specified header name instead of "X-Bogosity" */ #undef SPAM_HEADER_NAME /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define to 1 if you can safely include both and . */ #undef TIME_WITH_SYS_TIME /* Enable extensions on AIX 3, Interix. */ #ifndef _ALL_SOURCE # undef _ALL_SOURCE #endif /* Enable GNU extensions on systems that have them. */ #ifndef _GNU_SOURCE # undef _GNU_SOURCE #endif /* Enable threading extensions on Solaris. */ #ifndef _POSIX_PTHREAD_SEMANTICS # undef _POSIX_PTHREAD_SEMANTICS #endif /* Enable extensions on HP NonStop. */ #ifndef _TANDEM_SOURCE # undef _TANDEM_SOURCE #endif /* Enable general extensions on Solaris. */ #ifndef __EXTENSIONS__ # undef __EXTENSIONS__ #endif /* transactions enabled/disabled flag */ #undef USE_TRANSACTIONS /* Unicode enabled/disabled flag */ #undef USE_UNICODE /* Version number of package */ #undef VERSION /* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a `char[]'. */ #undef YYTEXT_POINTER /* Enable large inode numbers on Mac OS X 10.5. */ #ifndef _DARWIN_USE_64_BIT_INODE # define _DARWIN_USE_64_BIT_INODE 1 #endif /* Number of bits in a file offset, on hosts where this is settable. */ #undef _FILE_OFFSET_BITS /* Define for large files, on AIX-style hosts. */ #undef _LARGE_FILES /* Define to 1 if on MINIX. */ #undef _MINIX /* Define to 2 if the system does not provide POSIX.1 features except with this defined. */ #undef _POSIX_1_SOURCE /* Define to 1 if you need to in order for `stat' and other things to work. */ #undef _POSIX_SOURCE /* Define __NO_CTYPE to 1 to avoid GLIBC_2.3-specific ctype.h functions. */ #undef __NO_CTYPE /* Define to empty if `const' does not conform to ANSI C. */ #undef const /* Define to `int' if doesn't define. */ #undef gid_t /* Define to `__inline__' or `__inline' if that's what the C compiler calls it, or to nothing if 'inline' is not supported under any name. */ #ifndef __cplusplus #undef inline #endif /* Define to `int' if does not define. */ #undef pid_t /* Define to the equivalent of the C99 'restrict' keyword, or to nothing if this is not supported. Do not define if restrict is supported directly. */ #undef restrict /* Work around a bug in Sun C++: it does not support _Restrict or __restrict__, even though the corresponding Sun C compiler ends up with "#define restrict _Restrict" or "#define restrict __restrict__" in the previous line. Perhaps some future version of Sun C++ will work with restrict; if so, hopefully it defines __RESTRICT like Sun C does. */ #if defined __SUNPRO_CC && !defined __RESTRICT # define _Restrict # define __restrict__ #endif /* Define to `unsigned int' if does not define. */ #undef size_t /* Define to trio_snprintf if your system lacks snprintf */ #undef snprintf /* Define to sqlite3_prepare if new interface missing (for sqlite < 3.3.9) */ #undef sqlite3_prepare_v2 /* Define to `unsigned long' if does not define. */ #undef u_long /* Define to `int' if doesn't define. */ #undef uid_t /* Define to empty if the keyword `volatile' does not work. Warning: valid code using `volatile' can become incorrect without. Disable with care. */ #undef volatile /* Define to trio_vsnprintf if your system lacks vsnprintf */ #undef vsnprintf #ifdef HAVE_EXTENDED_PRECISION_REGISTERS #define GSL_COERCE_DBL(x) (gsl_coerce_double(x)) #else #define GSL_COERCE_DBL(x) (x) #endif bogofilter-1.2.4/src/0000755000175000017500000000000012164443244012631 5ustar sezsezbogofilter-1.2.4/src/token.c0000644000175000017500000004000312163572304014111 0ustar sezsez/* $Id: token.c 6988 2013-01-20 14:02:48Z m-a $ */ /***************************************************************************** NAME: token.c -- post-lexer token processing 12/08/02 - split out from lexer.l AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include "bogoreader.h" #include "charset.h" #include "error.h" #include "mime.h" #include "msgcounts.h" #include "word.h" #include "token.h" #include "xmemrchr.h" #define MSG_COUNT_PADDING 2 * 10 /* space for 2 10-digit numbers */ /* Local Variables */ word_t *msg_addr; /* First IP Address in Received: statement */ word_t *msg_id; /* Message ID */ word_t *queue_id; /* Message's first queue ID */ static token_t save_class = NONE; static word_t *ipsave; static byte *yylval_text; static size_t yylval_text_size; static word_t yylval; static word_t *w_to = NULL; /* To: */ static word_t *w_from = NULL; /* From: */ static word_t *w_rtrn = NULL; /* Return-Path: */ static word_t *w_subj = NULL; /* Subject: */ static word_t *w_recv = NULL; /* Received: */ static word_t *w_head = NULL; /* Header: */ static word_t *w_mime = NULL; /* Mime: */ static word_t *w_ip = NULL; /* ip: */ static word_t *w_url = NULL; /* url: */ /* Global Variables */ bool block_on_subnets = false; static word_t *token_prefix = NULL; static uint32_t token_prefix_len; #define NONBLANK "spc:invalid_end_of_header" static word_t *nonblank_line = NULL; static uint tok_count = 0; static uint init_token = 1; static word_t *p_multi_words = NULL; static byte *p_multi_buff = NULL; static byte *p_multi_text = NULL; static word_t **w_token_array = NULL; /* Function Prototypes */ static void token_clear(void); static token_t parse_new_token(word_t *token); static void add_token_to_array(word_t *token); static void build_token_from_array(word_t *token); static uint token_copy_leng(const char *str, uint leng, byte *dest); /* Function Definitions */ static void init_token_array(void) { uint i; byte *text; word_t *words; p_multi_words = calloc( max_token_len, sizeof(word_t) ); p_multi_buff = malloc( max_multi_token_len+D ); p_multi_text = calloc( max_token_len+1+D, multi_token_count ); w_token_array = calloc( multi_token_count, sizeof(*w_token_array) ); text = p_multi_text; words = p_multi_words; for (i = 0; i < multi_token_count; i += 1) { words->leng = 0; words->u.text = text; w_token_array[i] = words; words += 1; text += max_token_len+1+D; } } static void free_token_array(void) { free(p_multi_words); free(p_multi_text ); free(p_multi_buff ); free(w_token_array); } static void token_set( word_t *token, byte *text, uint leng ) { token->leng = leng; memcpy(token->u.text, text, leng); /* include nul terminator */ token->u.text[leng] = '\0'; /* ensure nul termination */ } static inline void token_copy( word_t *dst, word_t *src ) { token_set(dst, src->u.text, src->leng); } static void build_prefixed_token( word_t *prefix, word_t *token, word_t *temp, uint32_t temp_size ) { uint len = token->leng + prefix->leng; if (len >= temp_size) len = temp_size - prefix->leng - 1; temp->leng = len; memmove(temp->u.text+prefix->leng, token->u.text, len-prefix->leng); memcpy(temp->u.text, prefix->u.text, prefix->leng); Z(temp->u.text[temp->leng]); token->leng = temp->leng; token->u.text = temp->u.text; } #define WRAP(n) ((n) % multi_token_count) token_t get_token(word_t *token) { token_t cls; bool fSingle = (tok_count < 2 || tok_count <= init_token || multi_token_count <= init_token); if (fSingle) { cls = parse_new_token(token); if (multi_token_count > 1) add_token_to_array(token); } else { cls = TOKEN; build_token_from_array(token); } if (token_prefix != NULL) { /* IP addresses get special prefix */ if (save_class != IPADDR) { build_prefixed_token(token_prefix, token, &yylval, yylval_text_size); } else { word_t *prefix = (wordlist_version >= IP_PREFIX) ? w_ip : w_url; build_prefixed_token(prefix, token, &yylval, yylval_text_size); } /* if excessive length caused by prefix, get another token */ if (fSingle && token->leng > max_token_len) cls = get_token(token); } return cls; } token_t parse_new_token(word_t *token) { token_t cls = NONE; unsigned char *cp; bool done = false; /* If saved IPADDR, truncate last octet */ if ( block_on_subnets && save_class == IPADDR ) { byte *t = xmemrchr(ipsave->u.text, '.', ipsave->leng); if (t == NULL) save_class = NONE; else { ipsave->leng = (uint) (t - ipsave->u.text); token_set( token, ipsave->u.text, ipsave->leng); cls = save_class; done = true; } } while (!done) { uint leng; byte *text; cls = (*lexer->yylex)(); token->leng = lexer->get_parser_token(&token->u.text); Z(token->u.text[token->leng]); /* for easier debugging - removable */ leng = token->leng; text = token->u.text; if (DEBUG_TEXT(2)) { word_puts(token, 0, dbgout); fputc('\n', dbgout); } if (cls == NONE) /* End of message */ break; switch (cls) { case EOH: /* end of header - bogus if not empty */ if (leng > max_token_len) continue; if (msg_state->mime_type == MIME_MESSAGE) mime_add_child(msg_state); if (leng == 1) continue; else { /* "spc:invalid_end_of_header" */ token_copy( &yylval, nonblank_line); done = true; } break; case BOUNDARY: /* don't return boundary tokens to the user */ continue; case VERP: /* Variable Envelope Return Path */ { byte *st = (byte *)text; byte *in; byte *fst = NULL; byte *lst = NULL; for (in = st; *in != '\0'; in += 1) { if (*in == '-') { if (fst == NULL) fst = in; lst = in; } } if (fst != NULL && lst != NULL && lst - fst > 3) { byte *ot = fst; *ot++ = '-'; *ot++ = '#'; for (in = lst; *in != '\0'; in += 1, ot += 1) *ot = *in; token->leng = leng = (uint) (ot - st); } Z(token->u.text[token->leng]); /* for easier debugging - removable */ } break; case HEADKEY: { if (!header_line_markup || *text == '\0') continue; else { const char *delim = strchr((const char *)text, ':'); leng = (uint) (delim - (const char *)text); if (leng > max_token_len) continue; token_set( &yylval, text, leng); } } /*@fallthrough@*/ case TOKEN: /* ignore anything when not reading text MIME types */ if (leng < min_token_len) continue; /*@fallthrough@*/ case MONEY: /* 2 character money is OK */ if (leng > max_token_len) continue; token->u.text = text; token->leng = leng; if (token_prefix == NULL) { switch (msg_state->mime_type) { case MIME_TEXT: case MIME_TEXT_HTML: case MIME_TEXT_PLAIN: case MIME_MULTIPART: break; case MIME_MESSAGE: case MIME_APPLICATION: case MIME_IMAGE: continue; default: continue; } } break; case MESSAGE_ID: /* special token; saved for formatted output, but not returned to bogofilter */ /** \bug: the parser MUST be aligned with lexer_v3.l! */ if (leng < max_token_len) { while (!isspace(text[0])) { text += 1; leng -= 1; } while (isspace(text[0])) { text += 1; leng -= 1; } token_set( msg_id, text, leng); } continue; case QUEUE_ID: /* special token; saved for formatted output, but not returned to bogofilter */ /** \bug: the parser MUST be aligned with lexer_v3.l! */ if (*queue_id->u.text == '\0' && leng < max_token_len ) { while (isspace(text[0])) { text += 1; leng -= 1; } if (memcmp(text, "id", 2) == 0) { text += 2; leng -= 2; } while (isspace(text[0])) { text += 1; leng -= 1; } if (text[0] == '<') { text += 1; leng -= 1; } if (text[leng-1] == '>') { leng -= 1; } leng = min(queue_id->leng, leng); memcpy( queue_id->u.text, text, leng ); Z(queue_id->u.text[leng]); } continue; case MESSAGE_ADDR: { /* trim brackets */ text += 1; leng -= 2; Z(text[leng]); /* for easier debugging - removable */ token_set( &yylval, text, leng); /* if top level, no address, not localhost, .... */ if (token_prefix == w_recv && msg_state->parent == NULL && *msg_addr->u.text == '\0' && strcmp((char *)text, "127.0.0.1") != 0) { /* Not guaranteed to be the originating address of the message. */ memcpy( msg_addr->u.text, yylval.u.text, min(msg_addr->leng, yylval.leng)+D ); Z(msg_addr->u.text[yylval.leng]); } } /*@fallthrough@*/ case IPADDR: if (block_on_subnets) { int q1, q2, q3, q4; /* * Trick collected by ESR in real time during John * Graham-Cummings's talk at Paul Graham's spam conference * in January 2003... Some spammers know that people are * doing recognition on spamhaus IP addresses. They use * the fact that HTML clients normally interpret IP addresses * by doing a simple accumulate-and-shift algorithm; they * add large random multiples of 256 to the quads to * mask their origin. Nuke the high bits to unmask the * address. */ if (sscanf((const char *)text, "%d.%d.%d.%d", &q1, &q2, &q3, &q4) == 4) /* safe because result string guaranteed to be shorter */ sprintf((char *)text, "%d.%d.%d.%d", q1 & 0xff, q2 & 0xff, q3 & 0xff, q4 & 0xff); leng = strlen((const char *)text); token->u.text = text; token->leng = leng; token_copy( ipsave, token ); save_class = IPADDR; return (cls); } token->u.text = text; token->leng = leng; break; case NONE: /* nothing to do */ break; case MSG_COUNT_LINE: msg_count_file = true; multi_token_count = 1; header_line_markup = false; token_prefix = NULL; lexer = &msg_count_lexer; if (mbox_mode) { /* Allows processing multiple messages, ** ** but only a single file. */ reader_more = msgcount_more; } continue; case BOGO_LEX_LINE: token_set( &yylval, text, leng); done = true; break; } if (DEBUG_TEXT(1)) { word_puts(&yylval, 0, dbgout); fputc('\n', dbgout); } /* eat all long words */ if (token->leng <= max_token_len) done = true; } if (!msg_count_file) { /* Remove trailing blanks */ /* From "From ", for example */ while (token->leng > 1 && token->u.text[token->leng-1] == ' ') { token->leng -= 1; token->u.text[token->leng] = (byte) '\0'; } /* Remove trailing colon */ if (token->leng > 1 && token->u.text[token->leng-1] == ':') { token->leng -= 1; token->u.text[token->leng] = (byte) '\0'; } if (replace_nonascii_characters) { /* replace nonascii characters by '?'s */ for (cp = token->u.text; cp < token->u.text+token->leng; cp += 1) *cp = casefold_table[*cp]; } } return(cls); } /* save token in token array */ static void add_token_to_array(word_t *token) { word_t *w = w_token_array[WRAP(tok_count)]; w->leng = token->leng; memcpy(w->u.text, token->u.text, w->leng); Z(w->u.text[w->leng]); /* for easier debugging - removable */ if (DEBUG_MULTI(1)) fprintf(stderr, "%s:%d %2s %2d %2d %p %s\n", __FILE__, __LINE__, "", tok_count, w->leng, w->u.text, w->u.text); tok_count += 1; init_token = 1; return; } static void build_token_from_array(word_t *token) { int tok; const char *sep = ""; uint leng; byte *dest; leng = init_token; for ( tok = init_token; tok >= 0; tok -= 1 ) { uint idx = tok_count - 1 - tok; leng += strlen((char *) w_token_array[WRAP(idx)]->u.text); } if (leng > max_multi_token_len) leng = max_multi_token_len; token->leng = leng; token->u.text = dest = p_multi_buff; for ( tok = init_token; tok >= 0; tok -= 1 ) { uint idx = tok_count - 1 - tok; uint len = w_token_array[WRAP(idx)]->leng; byte *str = w_token_array[WRAP(idx)]->u.text; if (DEBUG_MULTI(1)) fprintf(stderr, "%s:%d %2d %2d %2d %p %s\n", __FILE__, __LINE__, idx, tok_count, len, str, str); len = token_copy_leng((const char *)sep, leng, dest); leng -= len; dest += len; len = token_copy_leng((const char *)str, leng, dest); leng -= len; dest += len; sep = "*"; } Z(token->u.text[token->leng]); /* for easier debugging - removable */ init_token += 1; /* progress to next multi-token */ return; } static uint token_copy_leng(const char *str, uint leng, byte *dest) { uint len = strlen(str); if (leng < len) len = leng; if (len != 0) memcpy(dest, str, len); return (uint) len; } void token_init(void) { static bool fTokenInit = false; yyinit(); if ( fTokenInit) { token_clear(); } else { fTokenInit = true; if (max_multi_token_len == 0) max_multi_token_len = (max_token_len+1) * multi_token_count + MAX_PREFIX_LEN; yylval_text_size = max_multi_token_len + MSG_COUNT_PADDING; yylval_text = (byte *) malloc( yylval_text_size+D ); yylval.leng = 0; yylval.u.text = yylval_text; /* First IP Address in Received: statement */ msg_addr = word_new( NULL, max_token_len ); /* Message ID */ msg_id = word_new( NULL, max_token_len * 3 ); /* Message's first queue ID */ queue_id = word_new( NULL, max_token_len ); ipsave = word_new( NULL, max_token_len ); /* word_new() used to avoid compiler complaints */ w_to = word_news("to:"); /* To: */ w_from = word_news("from:"); /* From: */ w_rtrn = word_news("rtrn:"); /* Return-Path: */ w_subj = word_news("subj:"); /* Subject: */ w_recv = word_news("rcvd:"); /* Received: */ w_head = word_news("head:"); /* Header: */ w_mime = word_news("mime:"); /* Mime: */ w_ip = word_news("ip:"); /* ip: */ w_url = word_news("url:"); /* url: */ nonblank_line = word_news(NONBLANK); /* do multi-word token initializations */ init_token_array(); } return; } void clr_tag(void) { token_prefix = NULL; tok_count = 0; } void set_tag(const char *text) { word_t *old_prefix = token_prefix; if (!header_line_markup) return; if (msg_state->parent != NULL && msg_state->parent->mime_type == MIME_MESSAGE) { clr_tag(); /* don't tag if inside message/rfc822 */ return; } switch (tolower((unsigned char)*text)) { case 'c': /* CC: */ case 't': token_prefix = w_to; /* To: */ break; case 'f': token_prefix = w_from; /* From: */ break; case 'h': if (msg_state->parent == NULL) token_prefix = w_head; /* Header: */ else token_prefix = w_mime; /* Mime: */ break; case 'r': if (tolower((unsigned char)text[2]) == 't') token_prefix = w_rtrn; /* Return-Path: */ else token_prefix = w_recv; /* Received: */ break; case 's': token_prefix = w_subj; /* Subject: */ break; default: fprintf(stderr, "%s:%d invalid tag - '%s'\n", __FILE__, __LINE__, text); exit(EX_ERROR); } token_prefix_len = token_prefix->leng; assert(token_prefix_len <= MAX_PREFIX_LEN); if (DEBUG_LEXER(2)) { fprintf(dbgout,"--- set_tag(%s) -> prefix=", text); if (token_prefix) word_puts(token_prefix, 0, dbgout); fputc('\n', dbgout); } /* discard tokens when prefix changes */ if (old_prefix != NULL && old_prefix != token_prefix) tok_count = 0; return; } void set_msg_id(byte *text, uint leng) { (void) leng; /* suppress compiler warning */ token_set( msg_id, text, msg_id->leng ); } #define WFREE(n) word_free(n); n = NULL /* Cleanup storage allocation */ void token_cleanup() { WFREE(w_to); WFREE(w_from); WFREE(w_rtrn); WFREE(w_subj); WFREE(w_recv); WFREE(w_head); WFREE(w_mime); WFREE(w_ip); WFREE(w_url); WFREE(nonblank_line); token_clear(); /* do multi-word token cleanup */ free_token_array(); } void token_clear() { if (msg_addr != NULL) { *msg_addr->u.text = '\0'; *msg_id->u.text = '\0'; *queue_id->u.text = '\0'; } } bogofilter-1.2.4/src/patch.lexer.253x.txt0000644000175000017500000000124012163572304016303 0ustar sezsez--- lexer_v3.c.orig 2006-11-23 09:25:30.000000000 -0500 +++ lexer_v3.c 2006-11-23 09:29:24.000000000 -0500 @@ -2590,6 +2590,14 @@ else ret_val = EOB_ACT_CONTINUE_SCAN; + if ((yy_n_chars) + number_to_move > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + int new_size = (yy_n_chars) * 5 / 4 + 2; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yyrealloc( (void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, + new_size ); + } + (yy_n_chars) += number_to_move; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; bogofilter-1.2.4/src/wordlists_base.h0000644000175000017500000000331412163572304016026 0ustar sezsez/* $Id: wordlists_base.h 6058 2005-06-17 03:35:11Z relson $ */ /* constants and declarations for wordlists_base.c */ #ifndef WORDLISTS_CORE_H #define WORDLISTS_CORE_H #ifndef DATASTORE_H typedef void *dsh_t; #endif #include "paths.h" typedef enum e_WL_TYPE { WL_REGULAR = 'R', /**< list contains regular tokens */ WL_IGNORE = 'I' /**< list contains tokens that are skipped */ } WL_TYPE; /** type of a wordlist node */ typedef struct wordlist_s wordlist_t; /** structure of a wordlist node - singly linked priority queue */ struct wordlist_s { /*@null@*/ wordlist_t *next; /**< link to next queue node */ /*@owned@*/ char *listname; /**< resource name (for debug/verbose messages) */ /*@owned@*/ bfpath *bfp; /**< resource path info */ /*@owned@*/ dsh_t *dsh; /**< datastore handle */ u_int32_t msgcount[IX_SIZE]; /**< count of messages in wordlist. */ WL_TYPE type; /**< datastore type */ int override; /**< priority in queue */ e_enc encoding; /**< encoding */ }; void wordlists_set_bogohome(void); /** Initialize a wordlist node and insert into the right place of the * priority queue, \return -1 for error, 0 for success */ void init_wordlist(const char* name, const char *path, int override, WL_TYPE type); /** Print wordlists to stdout, prefixing it by \a fmt which is * considered a printf format string and provided one constant argument, * "wordlist" (literally). */ void display_wordlists(wordlist_t *list, const char *fmt); /** Free resources of all nodes in the list */ void free_wordlists(void); /** Get default wordlist for registering messages, finding robx, etc */ wordlist_t *get_default_wordlist(wordlist_t *list); #endif /* WORDLISTS_CORE_H */ bogofilter-1.2.4/src/listsort.h0000644000175000017500000000046012163572272014670 0ustar sezsez#ifndef _LISTSORT_H #define _LISTSORT_H #define LISTSORT #include "bftypes.h" typedef struct element element; struct element { element *next, *prev; int i; }; typedef int fcn_compare(const element *a, const element *b); extern element *listsort(element *list, fcn_compare *compare); #endif bogofilter-1.2.4/src/bogolexer.c0000644000175000017500000001562212163572272014774 0ustar sezsez/* $Id: bogolexer.c 6993 2013-06-28 21:54:23Z m-a $ */ /***************************************************************************** NAME: bogolexer.c -- runs bogofilter's lexer. AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include "getopt.h" #include #include #include "bogoconfig.h" #include "bogoreader.h" #include "bool.h" #include "charset.h" #include "configfile.h" #include "lexer.h" #include "longoptions.h" #include "mime.h" #include "textblock.h" #include "token.h" #include "format.h" #include "xstrdup.h" const char *progname = "bogolexer"; /* Function Definitions */ static void usage(void) { fprintf(stdout, "Usage: %s [ -p | -q | -n | -h ]\n", progname); } static void help(void) { usage(); fprintf(stdout, "\n" "\t-p\t- print the tokens from stdin.\n" "\t-q\t- quiet mode, no tokens are printed.\n" "\t-h\t- help, this output.\n" "\t-n\t- map non-ascii characters to '?'.\n" "\t-v\t- set verbosity level.\n" "\t-c file\t- read specified config file.\n" "\t-C\t- don't read standard config files.\n" "\t-H\t- disables header line tagging.\n" "\t-I file\t- read message from file instead of stdin.\n" "\t-O file\t- write to file instead of stdout.\n" "\t-x list\t- set debug flags.\n" "\t-D\t- direct debug output to stdout.\n"); fprintf(stdout, "\n" "%s (version %s) is part of the bogofilter package.\n", progname, version); } static void print_version(void) { (void)fprintf(stdout, "%s version %s\n" "Copyright (C) 2002-2010 David Relson\n\n" "%s comes with ABSOLUTELY NO WARRANTY. " "This is free software, and\nyou are welcome to " "redistribute it under the General Public License. " "See\nthe COPYING file with the source distribution for " "details.\n" "\n", progname, version, PACKAGE); } static bool get_bool(const char *name, const char *arg) { bool b = str_to_bool(arg); if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> %s\n", name, b ? "Yes" : "No"); return b; } static char *get_string(const char *name, const char *arg) { char *s = xstrdup(arg); remove_comment(s); if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> '%s'\n", name, s); return s; } static struct option longopts_bogolexer[] = { /* longoptions.h - common options */ LONGOPTIONS_COMMON /* longoptions.h - options for bogofilter and bogolexer */ LONGOPTIONS_LEX /* longoptions.h - options for bogolexer and bogoutil */ LONGOPTIONS_LEX_UTIL /* end of list */ { NULL, 0, 0, 0 } }; #define OPTIONS ":c:CDhHI:nO:pqvVx:X:m" /** These functions process command line arguments. ** ** They are called to perform passes 1 & 2 of command line switch processing. ** The config file is read in between the two function calls. ** ** The functions will exit if there's an error, for example if ** there are leftover command line arguments. */ static void process_arglist(int argc, char **argv) { int option; fpin = stdin; dbgout = stderr; #ifdef __EMX__ _response (&argc, &argv); /* expand response files (@filename) */ _wildcard (&argc, &argv); /* expand wildcards (*.*) */ #endif while (1) { int option_index = 0; int this_option_optind = optind ? optind : 1; const char *name; #ifdef __EMX__ if (optind == 1) optind = 0; #endif option = getopt_long_chk(argc, argv, OPTIONS, longopts_bogolexer, &option_index); if (option == -1) break; name = (option_index == 0) ? argv[this_option_optind] : longopts_bogolexer[option_index].name; process_arg(option, name, optarg, PR_COMMAND, PASS_1_CLI); } if (optind < argc) { fprintf(stderr, "Extra arguments given, first: %s. Aborting.\n", argv[optind]); exit(EX_ERROR); } } int process_arg(int option, const char *name, const char *val, priority_t precedence, arg_pass_t pass) { pass = 0; /* suppress compiler warning */ switch (option) { case ':': fprintf(stderr, "Option %s requires an argument.\n", name); exit(EX_ERROR); case '?': fprintf(stderr, "Unknown option '%s'.\n", name); break; case 'c': case O_CONFIG_FILE: read_config_file(val, false, false, precedence, longopts_bogolexer); /*@fallthrough@*/ /* fall through to suppress reading config files */ case 'C': suppress_config_file = true; break; case O_USER_CONFIG_FILE: user_config_file = get_string(name, val); break; case 'D': dbgout = stdout; break; case 'h': help(); exit(EX_OK); case 'H': header_line_markup = false; break; case 'I': bogoreader_name(val); break; case 'O': fpo = fopen(val, "wt"); if (fpo == NULL) { fprintf(stderr, "Can't write file '%s'\n", val); exit(EX_ERROR); } break; case 'n': replace_nonascii_characters = true; break; case O_CHARSET_DEFAULT: charset_default = get_string(name, val); break; case O_UNICODE: encoding = get_bool(name, val) ? E_UNICODE : E_RAW; break; case O_REPLACE_NONASCII_CHARACTERS: replace_nonascii_characters = get_bool(name, val); break; case 'p': passthrough = true; break; case 'q': quiet = true; break; case 'v': verbose += 1; break; case 'V': print_version(); exit(EX_OK); case 'x': set_debug_mask(val); break; case 'X': set_bogotest(val); break; case O_BLOCK_ON_SUBNETS: block_on_subnets = get_bool(name, val); break; case O_MAX_TOKEN_LEN: max_token_len = atoi(val); break; case O_MIN_TOKEN_LEN: min_token_len = atoi(val); break; case O_MAX_MULTI_TOKEN_LEN: max_multi_token_len=atoi(val); break; case O_MULTI_TOKEN_COUNT: multi_token_count=atoi(val); break; default: /* config file options: ** ok - if from config file ** error - if on command line */ if (pass == PASS_2_CFG) { fprintf(stderr, "Invalid option '%s'.\n", name); exit(EX_ERROR); } } return 0; } static int count=0; int main(int argc, char **argv) { token_t t; fpo = stdout; mbox_mode = true; /* to allow multiple messages */ process_arglist(argc, argv); process_config_files(false, longopts_bogolexer); if (encoding == E_UNKNOWN) encoding = E_DEFAULT; textblock_init(); if (!passthrough) { if (quiet) fprintf(fpo, "quiet mode.\n"); else fprintf(fpo, "normal mode.\n"); } bogoreader_init(argc, (const char * const *) argv); while ((*reader_more)()) { word_t token; lexer_init(); while ((t = get_token( &token )) != NONE) { count += 1; if (passthrough) { fprintf(fpo, "%s\n", token.u.text); } else if (!quiet) fprintf(fpo, "get_token: %d \"%s\"\n", (int)t, token.u.text); } } if ( !passthrough ) fprintf(fpo, "%d tokens read.\n", count); /* cleanup storage */ token_cleanup(); mime_cleanup(); textblock_free(); MEMDISPLAY; return 0; } bogofilter-1.2.4/src/xmemrchr.c0000644000175000017500000000064212163572272014627 0ustar sezsez/* (C) 2003 by David Relson, redistributable according to the terms * of the GNU General Public License, v2. * * $Id: xmemrchr.c 6542 2006-07-08 15:25:59Z m-a $ * */ #include "config.h" #include #include "xmemrchr.h" void *xmemrchr(void *v, byte b, size_t len) { byte *s = v; byte *e = s + len; byte *a = NULL; while (s < e) { if (*s == b) a = s; s += 1; } return a; } bogofilter-1.2.4/src/bogoreader.c0000644000175000017500000004125512163572272015120 0ustar sezsez/* $Id: bogoreader.c 6924 2010-07-06 21:44:36Z m-a $ */ /***************************************************************************** NAME: bogoreader.c -- process input files AUTHORS: (C) Copyright 2003-2005 by David Relson Matthias Andree ******************************************************************************/ /* ** Formats supported: ** ** mbox ** Maildir ** MH folder ** rmail ** ANT RISC-OS only ** ** msg-count special for bogofilter */ #include "common.h" #include #include #include #include "bogoreader.h" #include "error.h" #include "fgetsl.h" #include "lexer.h" #include "paths.h" #include "token.h" #include "xmalloc.h" static void (*fini)(void); static int argc; static const char * const *argv; static const char *filename; static char namebuff[PATH_LEN+1]; static char dir_name[PATH_LEN+1]; static FILE *yy_file; typedef enum ms_e {MS_FILE, MS_MAILDIR, MS_MH } ms_t; static ms_t mailstore_type; static bool mail_first = true; /* for the _next_mail functions */ static bool mailstore_first = true; /* for the _next_mailstore functions */ static bool firstline = true; /* for mailbox /^From / match */ static bool have_message = false; /* Lexer-Reader Interface */ reader_more_t *reader_more; reader_line_t *reader_getline; reader_file_t *reader_filename; /* Function Prototypes */ /* these functions check if there are more file names in bulk modes, * read-mail/mbox-from-stdin for uniformity */ static reader_more_t stdin_next_mailstore; static reader_more_t b_stdin_next_mailstore; static reader_more_t b_args_next_mailstore; /* these functions check if there is more mail in a mailbox/maildir/... * to process, trivial mail_next_mail for uniformity */ static reader_more_t dir_next_mail; static reader_more_t mail_next_mail; static reader_more_t mailbox_next_mail; /* maildir is the mailbox format specified in * http://cr.yp.to/proto/maildir.html */ static reader_line_t simple_getline; /* ignores /^From / */ static reader_line_t mailbox_getline; /* minds /^From / */ static reader_line_t rmail_getline; /* minds /^#! rmail/ */ static reader_line_t ant_getline; /* minds /^MAIL TO:/ */ static reader_file_t get_filename; static void bogoreader_close(void); typedef enum { MBOX, MC, RMAIL, ANT } mbox_t; typedef struct { const char *sep; uint len; mbox_t type; reader_line_t *fcn; } sep_2_box_t; static sep_2_box_t sep_2_box[] = { { "From ", 5, MBOX, mailbox_getline }, { "\".MSG_COUNT\"", 12, MC, mailbox_getline }, /* msg-count */ { "#! rmail", 8, RMAIL, rmail_getline }, { "MAIL FROM:", 10, ANT, ant_getline } /* RISC-OS only */ }; static uint seplen = 0; static const char *separator = NULL; static void dir_init(const char *name); static void dir_fini(void); typedef enum st_e { IS_DIR, IS_FILE, IS_ERR } st_t; /* Function Definitions */ bool is_eol(const char *buf, size_t len) { bool ans = ((len == 1 && memcmp(buf, NL, 1) == 0) || (len == 2 && memcmp(buf, CRLF, 2) == 0)); return ans; } static reader_line_t *get_reader_line(FILE *fp) { uint i; int c; reader_line_t *fcn = mailbox_getline; if (fp == NULL) return NULL; c = fgetc(fp); ungetc(c, fp); for (i = 0; i < COUNTOF(sep_2_box); i += 1) { sep_2_box_t *s = sep_2_box + i; if (s->sep[0] == c) { fcn = s->fcn; seplen = s->len; separator = s->sep; break; } } if (fcn == mailbox_getline && !mbox_mode) fcn = simple_getline; return fcn; } /* Checks if name is a directory. * Returns IS_DIR for directory, IS_FILE for other type, IS_ERR for error */ static st_t isdir(const char *name) { struct stat stat_buf; if (stat(name, &stat_buf)) return IS_ERR; return (S_ISDIR(stat_buf.st_mode) != 0) ? IS_DIR : IS_FILE; } static void save_dirname(const char *name) { size_t l = strlen(name); l = min(l, sizeof(dir_name)-2); memcpy(dir_name, name, l); if (dir_name[l-1] == DIRSEP_C) l -= 1; dir_name[l] = '\0'; } static const char* const maildir_subs[]={ DIRSEP_S "new", DIRSEP_S "cur", NULL }; static const char *const *maildir_sub; static DIR *reader_dir; /* MA: Check if the given name points to a Maildir. We don't require the * /tmp directory for simplicity. * This function checks if dir, dir/new and dir/cur are all directories. * Returns IS_DIR for directory, IS_FILE for other type, IS_ERR for error */ static st_t ismaildir(const char *dir) { st_t r; size_t l; char *x; const char *const *y; const size_t maxlen = 4; r = isdir(dir); if (r != IS_DIR) return r; x = xmalloc((l = strlen(dir)) + maxlen /* append */ + 1 /* NUL */); memcpy(x, dir, l); for (y = maildir_subs; *y; y++) { strlcpy(x + l, *y, maxlen + 1); r = isdir(x); if (r != IS_DIR) { xfree(x); return r; } } xfree(x); return IS_DIR; } static void dummy_fini(void) { } static reader_more_t *mailstore_next_store; static reader_more_t *mailstore_next_mail = NULL; /* this is the 'nesting driver' for our input. * mailstore := one of { mail, mbox, maildir } * if we have a current mailstore-specific handle, check that if we have * further input in the mailstore first. if we don't, see if we have * further mailstores to process */ static bool reader__next_mail(void) { for (;;) { /* check mailstore-specific method */ if (mailstore_next_mail) { if ((*mailstore_next_mail)()) /* more mails in the mailstore */ return true; mailstore_next_mail = NULL; } /* ok, that one has been exhausted, try the next mailstore */ /* mailstore_next_store opens the mailstore */ if (!(*mailstore_next_store)()) return false; /* ok, we have more mailstores, so check if the current mailstore has * input - loop. */ } } /* open mailstore (Maildir, mbox file or file with a single mail) and set * _getline and _next_mail pointers dependent on the mailstore's type. * * - automatically detects maildir * - does not automatically distinguish between mbox and mail * and takes mbox_mode instead */ static bool open_mailstore(const char *name) { filename = name; bogoreader_close(); firstline = true; switch (isdir(filename)) { case IS_FILE: if (DEBUG_READER(0)) fprintf(dbgout, "%s:%d - assuming %s is a %s\n", __FILE__, __LINE__, filename, mbox_mode ? "mbox" : "message"); fpin = fopen( filename, "r" ); if (fpin == NULL) { fprintf(stderr, "Can't open file '%s': %s\n", filename, strerror(errno)); return false; } else { mail_first = true; msg_count_file = false; reader_getline = get_reader_line(fpin); mailstore_next_mail = mbox_mode ? mailbox_next_mail : mail_next_mail; return true; } case IS_DIR: if (ismaildir(filename) == IS_DIR) { /* MAILDIR */ mailstore_type = MS_MAILDIR; dir_init(filename); reader_getline = simple_getline; mailstore_next_mail = dir_next_mail; return true; } else { /* MH */ mailstore_type = MS_MH; dir_init(filename); reader_getline = simple_getline; mailstore_next_mail = dir_next_mail; return true; } case IS_ERR: fprintf(stderr, "Can't stat mailstore '%s': %s\n", filename, strerror(errno)); break; default: fprintf(stderr, "Can't identify type of mailstore '%s'\n", filename); break; } return false; } /*** _next_mailstore functions ***********************************************/ /* this initializes for reading a single mail or a mbox from stdin */ static bool stdin_next_mailstore(void) { bool val = mailstore_first; reader_getline = get_reader_line(fpin); if (reader_getline == NULL) return false; mailstore_next_mail = mbox_mode ? mailbox_next_mail : mail_next_mail; mailstore_first = false; return val; } /* this reads file names from stdin and processes them according to * their type */ static bool b_stdin_next_mailstore(void) { int len; filename = namebuff; if ((len = fgetsl(namebuff, sizeof(namebuff), stdin)) <= 0) return false; if (len > 0 && namebuff[len-1] == '\n') namebuff[len-1] = '\0'; return open_mailstore(filename); } /* this reads file names from the command line and processes them * according to their type */ static bool b_args_next_mailstore(void) { if (argc <= 0) return false; filename = *argv; argc -= 1; argv += 1; return open_mailstore(filename); } /*** _next_mail functions ***********************************************/ /* trivial function, returns true on first run, * returns false on all subsequent runs */ static bool mail_next_mail(void) { bool val = mail_first; mail_first = false; return val; } /* always returns true on the first run * subsequent runs return true when a From line was encountered */ static bool mailbox_next_mail(void) { bool val = mail_first || have_message; mail_first = false; return val; } /* iterates over files in a directory */ static bool dir_next_mail(void) { struct dirent *dirent; struct stat st; for (;;) { if (reader_dir == NULL) { char *x = dir_name; /* open next directory */ if (mailstore_type == MS_MAILDIR) { size_t siz; if (*maildir_sub == NULL) return false; /* IMPORTANT for termination */ siz = strlen(dir_name) + 4 + 1; x = xmalloc(siz); strlcpy(x, dir_name, siz); strlcat(x, *(maildir_sub++), siz); } reader_dir = opendir(x); if (!reader_dir) { fprintf(stderr, "cannot open directory '%s': %s", x, strerror(errno)); } if (x != dir_name) xfree(x); } while ((errno = 0, dirent = readdir(reader_dir)) != NULL) { /* skip private files */ if ((mailstore_type == MS_MAILDIR && dirent->d_name[0] != '.') || (mailstore_type == MS_MH && isdigit((unsigned char)dirent->d_name[0]))) break; } if (errno) { fprintf(stderr, "Cannot read directory %s: %s", dir_name, strerror(errno)); exit(EX_ERROR); } if (dirent == NULL) { if (reader_dir) closedir(reader_dir); reader_dir = NULL; if (mailstore_type == MS_MAILDIR) continue; if (mailstore_type == MS_MH) return false; } filename = namebuff; snprintf(namebuff, sizeof(namebuff), "%s%s%c%s", dir_name, (mailstore_type == MS_MH) ? "" : *(maildir_sub-1), DIRSEP_C, dirent->d_name); bogoreader_close(); fpin = fopen( filename, "r" ); if (fpin == NULL) { fprintf(stderr, "Warning: can't open file '%s': %s\n", filename, strerror(errno)); /* don't barf, the file may have been changed by another MUA, * or a directory that just doesn't belong there, just skip it */ continue; } /* skip non-regular files */ if (0 == fstat(fileno(fpin), &st) && !S_ISREG(st.st_mode)) continue; if (DEBUG_READER(0)) fprintf(dbgout, "%s:%d - reading %s (%p)\n", __FILE__, __LINE__, filename, (void *)fpin); return true; } } /*** _getline functions ***********************************************/ /* reads from a mailbox, paying attention to ^From lines */ static int mailbox_getline(buff_t *buff) { uint used = buff->t.leng; byte *buf = buff->t.u.text + used; int count; static word_t *saved = NULL; static bool emptyline = false; /* for mailbox /^From / match */ if (saved != NULL) { count = saved->leng; buff_add(buff, saved); word_free(saved); saved = NULL; return count; } count = buff_fgetsl(buff, fpin); have_message = false; /* XXX FIXME: do we need to unescape the >From, >>From, >>>From, ... lines * by discarding the first ">"? */ /* DR 08/25/03 - NO!!! */ if ((firstline || emptyline) && seplen != 0 && count >= (int) seplen && memcmp(separator, buf, seplen) == 0) { if (firstline) { firstline = false; } else { have_message = true; saved = word_new(buf, count); count = EOF; } } else { if (buff->t.leng < buff->size) /* for easier debugging - removable */ Z(buff->t.u.text[buff->t.leng]); /* for easier debugging - removable */ } emptyline = is_eol((char *)buf, count); return count; } /* reads from an rmail batch, paying attention to ^#! rmail lines */ static int rmail_getline(buff_t *buff) { int count; uint used = buff->t.leng; byte *buf = buff->t.u.text + used; static word_t *saved = NULL; static uint bytesleft = 0; if (saved != NULL) { count = saved->leng; buff_add(buff, saved); word_free(saved); saved = NULL; return count; } if (bytesleft) { count = buff_fgetsln(buff, fpin, bytesleft); if (count > 0) bytesleft -= count; return count; } count = buff_fgetsl(buff, fpin); have_message = false; if (count >= (int) seplen && memcmp(separator, buf, seplen) == 0) { uint i; bytesleft = 0; for (i = seplen; i < (uint) count; i++) { if (isspace(buf[i])) continue; if (!isdigit(buf[i])) break; bytesleft = bytesleft * 10 + (buf[i] - '0'); } if (firstline) { firstline = false; } else { have_message = true; saved = word_new(buf, count); count = EOF; } } else { if (buff->t.leng < buff->size) /* for easier debugging - removable */ Z(buff->t.u.text[buff->t.leng]); /* for easier debugging - removable */ } return count; } /* reads from an ANT batch, paying attention to ^#! rmail lines */ static int ant_getline(buff_t *buff) { int count; uint used = buff->t.leng; byte *buf = buff->t.u.text + used; static word_t *saved = NULL; static bool dot_found = true; if (saved != NULL) { count = saved->leng; buff_add(buff, saved); word_free(saved); saved = NULL; return count; } count = buff_fgetsl(buff, fpin); have_message = false; if (dot_found && count >= (int) seplen && memcmp(separator, buf, seplen) == 0) { dot_found = false; /* ignore until dot */ if (firstline) { firstline = false; } else { have_message = true; saved = word_new(buf, count); count = EOF; } } else { if ((count == 2 || count == 3) && (buf[0] == '.') && (buf[1] == '\r' || buf[1] == '\n')) dot_found = true; /* dot found. look for separator */ if (buff->t.leng < buff->size) /* for easier debugging - removable */ Z(buff->t.u.text[buff->t.leng]); /* for easier debugging - removable */ } return count; } /* reads a file as a single mail ( no ^From detection ). */ static int simple_getline(buff_t *buff) { int count = buff_fgetsl(buff, fpin); if (buff->t.leng < buff->size) /* for easier debugging - removable */ Z(buff->t.u.text[buff->t.leng]);/* for easier debugging - removable */ return count; } /* initialize for MH directory and * Maildir subdirectories (cur and new). */ static void dir_init(const char *name) { reader_dir = NULL; fini = dir_fini; if (mailstore_type == MS_MAILDIR) maildir_sub = maildir_subs; save_dirname(name); return; } /* finish up MH/Maildir store */ static void dir_fini(void) { if (reader_dir) closedir(reader_dir); reader_dir = NULL; return; } /* returns current file name */ static const char *get_filename(void) { return filename; } /* global reader initialization, exported */ void bogoreader_init(int _argc, const char * const *_argv) { mailstore_first = mail_first = true; reader_more = reader__next_mail; fini = dummy_fini; switch (bulk_mode) { case B_NORMAL: /* read mail (mbox) from stdin */ yy_file = fpin; mailstore_next_store = stdin_next_mailstore; if (run_type & (REG_SPAM|REG_GOOD|UNREG_SPAM|UNREG_GOOD)) mbox_mode = true; break; case B_STDIN: /* '-b' - streaming (stdin) mode */ mailstore_next_store = b_stdin_next_mailstore; break; case B_CMDLINE: /* '-B' - command line mode */ argc = _argc; argv = (const char * const *) _argv; mailstore_next_store = b_args_next_mailstore; mailstore_next_mail = NULL; break; default: fprintf(stderr, "Unknown bulk_mode = %d\n", (int) bulk_mode); abort(); break; } reader_filename = get_filename; } /* For bogoconfig to distinguish '-I file' from '-I dir' */ /* global reader initialization, exported */ void bogoreader_name(const char *name) { bool ok; switch (isdir(name)) { case IS_FILE: fpin = fopen( name, "r" ); ok = fpin != NULL; break; case IS_DIR: ok = open_mailstore(name); break; default: ok = false; break; } if (!ok) { fprintf(stderr, "Can't read '%s'\n", name); exit(EX_ERROR); } } /* cleanup after reading a message, exported. */ /* Only called if the passthrough code says it is ok to close the file. */ void bogoreader_close_ifeof(void) { if (fpin && feof(fpin)) bogoreader_close(); } /* global cleanup, exported */ void bogoreader_fini(void) { bogoreader_close(); fini(); } static void bogoreader_close(void) { if (fpin && fpin != stdin) fclose(fpin); fpin = NULL; } bogofilter-1.2.4/src/globals.c0000644000175000017500000000412412163572304014420 0ustar sezsez/* $Id: globals.c 6925 2010-07-06 21:49:00Z m-a $ */ /***************************************************************************** NAME: globals.c -- define global variables AUTHOR: Matthias Andree ******************************************************************************/ #include "system.h" #include "globals.h" #include "score.h" /* exports */ bool fBogofilter = false; bool fBogotune = false; bool fBogoutil = false; /* command line options */ bulk_t bulk_mode = B_NORMAL; /* '-b, -B' */ bool suppress_config_file; /* '-C' */ bool nonspam_exits_zero; /* '-e' */ FILE *fpin = NULL; /* '-I' */ bool logflag; /* '-l' */ bool mbox_mode; /* '-M' */ bool replace_nonascii_characters; /* '-n' */ bool passthrough; /* '-p' */ bool pairs = false; /* '-P' */ bool quiet; /* '-q' */ int query; /* '-Q' */ bool Rtable; /* '-R' */ bool terse; /* '-t' */ int bogotest; /* '-X', env("BOGOTEST") */ int verbose; /* '-v' */ /* config file options */ double min_dev; double ham_cutoff = HAM_CUTOFF; double spam_cutoff; double thresh_update; uint min_token_len = MIN_TOKEN_LEN; uint max_token_len = MAX_TOKEN_LEN; uint max_multi_token_len = 0; uint multi_token_count = MUL_TOKEN_CNT; uint token_count_fix = 0; uint token_count_min = 0; uint token_count_max = 0; const char *update_dir; /*@observer@*/ const char *stats_prefix; const char *spam_header_name = SPAM_HEADER_NAME; const char *spam_header_place = ""; /* for lexer_v3.l */ bool header_line_markup = true; /* -H */ /* for transactions */ #ifndef ENABLE_TRANSACTIONS e_txn eTransaction = T_DEFAULT_OFF; #else e_txn eTransaction = T_DEFAULT_ON; #endif /* for encodings */ e_enc encoding = E_UNKNOWN; /* for bogoconfig.c, prob.c, rstats.c and score.c */ double robx = 0.0; double robs = 0.0; double sp_esf = SP_ESF; double ns_esf = NS_ESF; /* other */ FILE *fpo; uint db_cachesize = DB_CACHESIZE; /* in MB */ bool msg_count_file = false; char *progtype = NULL; bool unsure_stats = false; /* true if print stats for unsures */ run_t run_type = RUN_UNKNOWN; uint wordlist_version; bogofilter-1.2.4/src/prob.h0000644000175000017500000000077212163572272013755 0ustar sezsez/* $Id: prob.h 5381 2005-01-17 03:00:48Z relson $ */ /***************************************************************************** NAME: prob.h -- constants and declarations for prob.c AUTHOR: David Relson ******************************************************************************/ #ifndef PROB_H #define PROB_H /** calculate the probability that a token is bad */ extern double calc_prob(uint good, uint bad, uint goodmsgs, uint badmsgs); #endif /* PROB_H */ bogofilter-1.2.4/src/textblock.c0000644000175000017500000000574412163572304015005 0ustar sezsez/* $Id: textblock.c 5232 2004-12-28 13:45:52Z m-a $ */ /***************************************************************************** NAME: textblock.c -- implementation of textblock linked lists. ******************************************************************************/ #include "common.h" #include "textblock.h" #include "xmalloc.h" /* Global Variables */ static textblock_t *textblocks = NULL; static size_t cur_mem, max_mem, tot_mem; /* Function Definitions */ textdata_t *textblock_head(void) { return textblocks->head; } void textblock_init(void) { textblock_t *t = (textblock_t *) xcalloc(1, sizeof(*t)); size_t mem = sizeof(*t)+sizeof(textdata_t); t->head = (textdata_t *) xcalloc(1, sizeof(textdata_t)); t->tail = t->head; cur_mem += mem; tot_mem += mem; max_mem = max(max_mem, cur_mem); if (DEBUG_TEXT(2)) fprintf(dbgout, "%s:%d %p %p %3lu *ini* cur: %lu, max: %lu, tot: %lu\n", __FILE__,__LINE__, (void *)t, (void *)t->head, (unsigned long)mem, (unsigned long)cur_mem, (unsigned long)max_mem, (unsigned long)tot_mem); textblocks = t; } void textblock_add(const byte *text, size_t size) { textblock_t *t = textblocks; size_t mem = size+sizeof(textdata_t); textdata_t *cur = t->tail; cur->size = size; if (size == 0) cur->data = NULL; else { cur->data = (byte *)xmalloc(size+D); memcpy((char *)cur->data, (const char *)text, size+D); Z(((char *)cur->data)[size]); /* for easier debugging - removable */ } cur_mem += mem; tot_mem += mem; max_mem = max(max_mem, cur_mem); if (DEBUG_TEXT(2)) fprintf(dbgout, "%s:%d %p %p %3lu *add* cur: %lu, max: %lu, tot: %lu\n", __FILE__,__LINE__, (void *)cur, (void *)cur->data, (unsigned long)cur->size, (unsigned long)cur_mem, (unsigned long)max_mem, (unsigned long)tot_mem ); cur = cur->next = (textdata_t *) xcalloc(1, sizeof(textdata_t)); t->tail = cur; } void textblock_free(void) { size_t mem; textdata_t *cur, *nxt; textblock_t *t = textblocks; for (cur = t->head; cur ; cur = nxt) { nxt = cur->next; mem = cur->size + sizeof(*cur); cur_mem -= mem; if (DEBUG_TEXT(2)) fprintf(dbgout, "%s:%d %p %p %3lu *rel* cur: %lu, max: %lu, tot: %lu\n", __FILE__,__LINE__, (void *)cur, cur->data, (unsigned long)cur->size, (unsigned long)cur_mem, (unsigned long)max_mem, (unsigned long)tot_mem); xfree((void*)cur->data); xfree((void*)cur); } mem = sizeof(*t->head); cur_mem -= mem; if (DEBUG_TEXT(2)) fprintf(dbgout, "%s:%d %p %p *rel* cur: %lu, max: %lu, tot: %lu\n", __FILE__,__LINE__, (void *)t, (void *)t->head, (unsigned long)cur_mem, (unsigned long)max_mem, (unsigned long)tot_mem); xfree(t); cur_mem -= sizeof(t->head) + sizeof(t); if (DEBUG_TEXT(1)) fprintf(dbgout, "cur: %lu, max: %lu, tot: %lu\n", (unsigned long)cur_mem, (unsigned long)max_mem, (unsigned long)tot_mem ); } bogofilter-1.2.4/src/iconvert.h0000644000175000017500000000105312163572304014631 0ustar sezsez/* $Id: iconvert.h 6888 2010-03-14 16:24:40Z m-a $ */ /***************************************************************************** NAME: iconvert.h -- declarations for iconvert.c AUTHOR: David Relson ******************************************************************************/ #ifndef ICONVERT_H #define ICONVERT_H #include "config.h" #include extern void iconvert(buff_t *restrict src, buff_t *restrict dst); extern void iconvert_cd(iconv_t cd, buff_t *restrict src, buff_t *restrict dst); #endif bogofilter-1.2.4/src/find_home_tildeexpand.c0000644000175000017500000000425112163572304017307 0ustar sezsez/* find_home_tildeexpand.c -- library function to do sh-like ~ expansion */ /* (C) 2002 by Matthias Andree * * This program is free software; you can redistribute it and/or modify * it under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * 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, it is in the file named * COPYING. */ /* $Id: find_home_tildeexpand.c 5753 2005-03-29 03:06:11Z relson $ */ #include "common.h" #include #include #include "find_home.h" #include "xmalloc.h" #include "xstrdup.h" #ifndef __riscos__ static bool tilde_expand = true; #else static bool tilde_expand = false; #endif /* * tildeexpand tries to expand the first tilde argument, similar, but * not identical, to the way a POSIX sh does. It does not support * multiple tildes, and does not search for a slash, but for the longest * count of characters in the POSIX portable file name character set. */ /*@only@*/ char *tildeexpand(const char *name) { char *tmp; const char *home; size_t l, tl; if (!tilde_expand) return xstrdup(name); if (name[0] != '~') return xstrdup(name); /* figure length of user name */ l = strspn(&name[1], "abcdefghijklmnopqrstuvwxyz" "ABCDEFGHIJKLMNOPQRSTUVWXYZ" "0123456789._-"); /* Portable Filename Character Set */ if (l > 0) { /* got a parameter to the tilde */ tmp = xmalloc(l + 1); memcpy(tmp, &name[1], l); /* we want exactly the first l characters but as C string, * so stuff the NUL byte */ tmp[l] = '\0'; home = find_home_user(tmp); xfree(tmp); } else { /* plain tilde */ home = find_home(false); } if (home == NULL) { return xstrdup(name); } tl = strlen(name) + strlen(home) - l + 1; tmp = xmalloc(tl); (void)strlcpy(tmp, home, tl); /* no need to insert a slash here, name[l] contains one */ if (strlcat(tmp, name + l + 1, tl) >= tl) internal_error; return tmp; } bogofilter-1.2.4/src/transaction.h0000755000175000017500000000147312163572304015336 0ustar sezsez/* $Id: transaction.h 3200 2003-09-27 18:52:35Z relson $ */ /***************************************************************************** NAME: transaction.h -- prototypes and definitions for transaction.c AUTHORS: Stefan Bellon 2003 ******************************************************************************/ #ifndef TRANSACTION_H #define TRANSACTION_H #include "datastore.h" #include "word.h" #define TA_OK 0 #define TA_ERR 1 struct ta_type; typedef struct ta_type ta_t; ta_t *ta_init(void); int ta_commit(ta_t *ta); int ta_rollback(ta_t *ta); int ta_delete(ta_t *ta, void *vhandle, const word_t *word); int ta_write(ta_t *ta, void *vhandle, const word_t *word, dsv_t *val); int ta_read(ta_t *ta, void *vhandle, const word_t *word, /*@out@*/ dsv_t *val); #endif /* TRANSACTION_H */ bogofilter-1.2.4/src/system.c0000644000175000017500000000435512163572304014327 0ustar sezsez/* $Id: system.c 6484 2006-05-29 14:28:00Z relson $ */ /***************************************************************************** NAME: system.c -- bogofilter covers for OS/compiler dependent functions. ******************************************************************************/ #include "common.h" #if defined(__IBMC__) || defined(__IBMCPP__) || defined(__WATCOMC__) #define _OS2_ /* OS/2 stores the configuration file in the same directory as the * programs are run from. * Requested by Evgeny Kotsuba */ const char * const system_config_file = "bogofilter.cf"; #include "direct.h" #endif #ifdef __riscos__ /* static symbols that trigger UnixLib behaviour */ #include /* __RISCOSIFY_NO_PROCESS */ int __riscosify_control = __RISCOSIFY_NO_PROCESS; int __feature_imagefs_is_file = 1; const char *const system_config_file = ".bogofilter/cf"; #endif /* import select() */ #ifdef HAVE_SYS_SELECT_H #include #endif /** Checks if \a path is absolute. */ bool bf_abspath(const char *path /** path to check for absoluteness */) { #if defined(__OS2__) return (bool) strchr(path, ':') || (bool) (*path == '\\') || (bool) (*path == '/'); #elif defined(__riscos__) return (bool) (strchr(path, ':') || strchr(path, '$') || strchr(path, '#') || strchr(path, '@') || strchr(path, '%') || strchr(path, '&')); #else /* POSIX and similar*/ return (bool) (*path == DIRSEP_C); #endif } /** sleep for \a delay microseconds (rounded to nearest millisecond on * OS/2) */ void bf_sleep(long delay /** microseconds to wait */) { #ifndef _OS2_ struct timeval timeval; timeval.tv_sec = delay / 1000000; timeval.tv_usec = delay % 1000000; select(0,NULL,NULL,NULL,&timeval); #else /*APIRET DosSleep(ULONG msec ) */ DosSleep((delay+500)/1000); #endif } /** Create a new directory \a path with permissions \a mode, modified by * the current umask. \a mode is ignored on OS/2. */ int bf_mkdir(const char *path /** new directory to be created */, mode_t mode /** permissions for new directory, subject to umask restrictions */) { int rc; #ifndef _OS2_ /* POSIX and similar */ rc = mkdir(path, mode); #else rc = mkdir((unsigned char *)path); #endif return rc; } bogofilter-1.2.4/src/transaction.c0000755000175000017500000001045512163572304015331 0ustar sezsez/* $Id: transaction.c 3441 2003-10-29 15:10:38Z m-a $ */ /***************************************************************************** NAME: transaction.c -- implements transactions on datastore AUTHORS: Stefan Bellon 2003 ******************************************************************************/ #include "common.h" #include #include "maint.h" #include "transaction.h" #include "xmalloc.h" /* list all kinds of operations that can be present in the scheduler queue */ typedef enum ta_kind { TA_DELETE, TA_WRITE } ta_kind_t; /* scheduler queue item */ typedef struct ta_iter { ta_kind_t kind; void *vhandle; word_t *word; dsv_t *dsvval; struct ta_iter *next; struct ta_iter *prev; } ta_iter_t; /* scheduler queue anchor */ struct ta_type { ta_iter_t *head; ta_iter_t *last; }; /* open a transaction and return pointer to transaction anchor */ ta_t *ta_init(void) { ta_t *ta = xmalloc(sizeof(*ta)); ta->head = NULL; ta->last = NULL; return ta; } /* write back contents of scheduler queue to database (internal function) */ static int ta_flush(ta_t *ta, bool wr) { int ret = TA_OK; ta_iter_t *tmp, *iter = ta->head; while (iter) { if (wr) { switch (iter->kind) { case TA_DELETE: ret |= ds_delete(iter->vhandle, iter->word); break; case TA_WRITE: set_date(iter->dsvval->date); /* wrong date otherwise! */ ret |= ds_write(iter->vhandle, iter->word, iter->dsvval); break; } } word_free(iter->word); xfree(iter->dsvval); tmp = iter; iter = iter->next; xfree(tmp); } xfree(ta); return ret; } /* write back contents of scheduler queue to database and end transaction */ int ta_commit(ta_t *ta) { if (ta == NULL) return TA_ERR; return ta_flush(ta, true); } /* discard contents of scheduler queue and end transaction */ int ta_rollback(ta_t *ta) { if (ta == NULL) return TA_ERR; return ta_flush(ta, false); } /* add operation to scheduler queue (internal function) */ static void ta_add(ta_t *ta, ta_kind_t ta_kind, void *vhandle, const word_t *word, dsv_t *dsvval) { void *ta_vhandle = vhandle; word_t *ta_word = NULL; dsv_t *ta_dsvval = NULL; ta_iter_t *item = NULL; if (word) ta_word = word_dup(word); if (dsvval) { ta_dsvval = xmalloc(sizeof(*ta_dsvval)); memcpy(ta_dsvval, dsvval, sizeof(*ta_dsvval)); } item = xmalloc(sizeof(*item)); item->kind = ta_kind; item->vhandle = ta_vhandle; item->word = ta_word; item->dsvval = ta_dsvval; item->next = NULL; item->prev = ta->last; if (ta->head == NULL) ta->head = item; if (ta->last != NULL) ta->last->next = item; ta->last = item; } /* add delete operation to scheduler queue */ int ta_delete(ta_t *ta, void *vhandle, const word_t *word) { if (ta == NULL) return TA_ERR; ta_add(ta, TA_DELETE, vhandle, word, NULL); return TA_OK; } /* add write operation to scheduler queue */ int ta_write(ta_t *ta, void *vhandle, const word_t *word, dsv_t *val) { if (ta == NULL) return TA_ERR; ta_add(ta, TA_WRITE, vhandle, word, val); return TA_OK; } /* read from database, first looking whether transaction updated record */ int ta_read(ta_t *ta, void *vhandle, const word_t *word, /*@out@*/ dsv_t *val) { ta_iter_t *iter; if (ta == NULL) return TA_ERR; memset(val, 0, sizeof(*val)); /* search transaction list from end to start */ iter = ta->last; while (iter) { if (word_cmp(word, iter->word) == 0) { switch (iter->kind) { case TA_DELETE: return TA_ERR; /* token deleted, so not found */ case TA_WRITE: if (iter->dsvval) { memcpy(val, iter->dsvval, sizeof(*iter->dsvval)); return TA_OK; /* token found */ } else return TA_ERR; /* value should be present! ERROR! */ } } iter = iter->prev; } /* token not found in our transaction list, so ask the database backend */ return ds_read(vhandle, word, val); } bogofilter-1.2.4/src/bogohist.c0000644000175000017500000001051112163572304014610 0ustar sezsez/* $Id: bogohist.c 6766 2009-01-12 04:27:36Z relson $ */ /***************************************************************************** NAME: bogohist.c -- print bogofilter histogram AUTHOR: Gyepi Sam ******************************************************************************/ #include "common.h" #include #include #include #include #include #include "bogohist.h" #include "prob.h" #include "datastore.h" #include "msgcounts.h" #include "word.h" #include "wordlists.h" #include "xmalloc.h" static uint ham_only, ham_hapax; static uint spam_only, spam_hapax; static uint mgood, mbad; #define INTERVALS 20 #define PCT(n) 100.0 * n / count typedef struct rhistogram_s rhistogram_t; struct rhistogram_s { uint32_t count[INTERVALS]; }; /* Function Prototypes */ /* Function Definitions */ static int ds_histogram_hook(/*@unused@*/ word_t *key, dsv_t *data, void *userdata) /* returns 0 if ok, 1 if not ok */ { rhistogram_t *hist = userdata; double fw = calc_prob(data->goodcount, data->spamcount, mgood, mbad); uint idx = min(fw * INTERVALS, INTERVALS-1); /* ignore meta-tokens */ if (*key->u.text == (byte) '.') return 0; hist->count[idx] += 1; if (data->spamcount == 0) { ham_only += 1; if (data->goodcount == 1) ham_hapax += 1; } if (data->goodcount == 0) { spam_only += 1; if (data->spamcount == 1) spam_hapax += 1; } return 0; } static int print_histogram(rhistogram_t *hist) { uint i, r; uint maxcnt = 0; uint count = 0; if (verbose == 0) (void)printf("Histogram\n"); if (verbose == 1) { hist->count[0] -= ham_hapax; hist->count[INTERVALS-1] -= spam_hapax; (void)printf("Histogram without hapaxes\n"); } if (verbose == 2) { hist->count[0] -= ham_only; hist->count[INTERVALS-1] -= spam_only; (void)printf("Histogram without pure ham and spam\n"); } (void)printf("%5s%8s %3s %s\n", "score", "count", "pct", "histogram"); for (i=0; icount[i]; if (cnt > maxcnt) maxcnt = cnt; count += cnt; } /* Print histogram */ for (i=0; icount[i]; double beg = 1.0 * i / INTERVALS; double pct = PCT(cnt); /* print interval, count, probability, percent, and spamicity */ (void)printf("%3.2f %8u %5.2f ", beg, cnt, pct); /* scale histogram to 48 characters */ if (maxcnt>48) cnt = (cnt * 48 + maxcnt - 1) / maxcnt; /* display histogram */ for (r=0; r 0) { printf("hapaxes: ham %7u, spam %7u\n", ham_hapax, spam_hapax); printf(" pure: ham %7u, spam %7u\n", ham_only, spam_only); } else { printf("hapaxes: ham %7u (%5.2f%%), spam %7u (%5.2f%%)\n", ham_hapax, PCT(ham_hapax), spam_hapax, PCT(spam_hapax)); printf(" pure: ham %7u (%5.2f%%), spam %7u (%5.2f%%)\n", ham_only, PCT(ham_only), spam_only, PCT(spam_only)); } return rc; } /* for a standalone program: ** ** cc -o bogohist.prog.o -DMAIN -c bogohist.c ** cc -o bogohist bogohist.prog.o libbogofilter.a strlcpy.o strlcat.o -ldb -lm */ #ifdef MAIN const char *progname = "bogohist"; int main(int argc, char *argv[]) { if (argc < 2) { fprintf(stderr, "usage: %s BOGOFILTER_DIR\n", progname); exit(1); } else { const char *path = argv[1]; int rc = histogram(path); exit(rc); } } #endif bogofilter-1.2.4/src/passthrough.h0000644000175000017500000000130612163572304015350 0ustar sezsez/* $Id: passthrough.h 6654 2007-02-26 00:25:29Z relson $ */ /***************************************************************************** NAME: passthrough.h -- prototypes and definitions for passthrough.c ******************************************************************************/ #ifndef PASSTHROUGH_H #define PASSTHROUGH_H /* in main.c */ extern FILE *fpo; extern const char *spam_header_place; extern void passthrough_setup(void); extern void passthrough_cleanup(void); extern int passthrough_keepopen(void); extern void write_message(rc_t status); extern void write_log_message(rc_t status); extern void output_setup(void); extern void output_cleanup(void); #endif /* PASSTHROUGH_H */ bogofilter-1.2.4/src/datastore_tc.c0000644000175000017500000002144212163572304015453 0ustar sezsez/* $Id: datastore_tc.c 6892 2010-03-23 17:21:37Z m-a $ */ /***************************************************************************** NAME: datastore_tc.c -- implements the datastore, using tokyocabinet. AUTHORS: Gyepi Sam 2003 Matthias Andree 2003 Stefan Bellon 2003-2004 Pierre Habouzit 2007 ******************************************************************************/ #include "common.h" #include #include #include #include #include #include #include #include "datastore.h" #include "datastore_db.h" #include "error.h" #include "paths.h" #include "xmalloc.h" #include "xstrdup.h" #define UNUSED(x) ((void)&x) typedef struct { char *path; char *name; bool locked; bool created; TCBDB *dbp; } dbh_t; /* transaction stuff */ static int tc_txn_begin(void *vhandle) { dbh_t *dbh = vhandle; if (!dbh->dbp->wmode || tcbdbtranbegin(dbh->dbp)) return DST_OK; print_error(__FILE__, __LINE__, "tc_txn_begin(%p), err: %d, %s", dbh->dbp, tcbdbecode(dbh->dbp), tcbdberrmsg(tcbdbecode(dbh->dbp))); return DST_FAILURE; } static int tc_txn_abort(void *vhandle) { dbh_t *dbh = vhandle; if (!dbh->dbp->wmode || tcbdbtranabort(dbh->dbp)) return DST_OK; print_error(__FILE__, __LINE__, "tc_txn_abort(%p), err: %d, %s", dbh->dbp, tcbdbecode(dbh->dbp), tcbdberrmsg(tcbdbecode(dbh->dbp))); return DST_FAILURE; } static int tc_txn_commit(void *vhandle) { dbh_t *dbh = vhandle; if (!dbh->dbp->wmode || tcbdbtrancommit(dbh->dbp)) return DST_OK; print_error(__FILE__, __LINE__, "tc_txn_commit(%p), err: %d, %s", dbh->dbp, tcbdbecode(dbh->dbp), tcbdberrmsg(tcbdbecode(dbh->dbp))); return DST_FAILURE; } static dsm_t dsm_tc = { /* public -- used in datastore.c */ &tc_txn_begin, &tc_txn_abort, &tc_txn_commit, /* private -- used in datastore_db_*.c */ NULL, /* dsm_env_init */ NULL, /* dsm_cleanup */ NULL, /* dsm_cleanup_lite */ NULL, /* dsm_get_env_dbe */ NULL, /* dsm_database_name */ NULL, /* dsm_recover_open */ NULL, /* dsm_auto_commit_flags*/ NULL, /* dsm_get_rmw_flag */ NULL, /* dsm_lock */ NULL, /* dsm_common_close */ NULL, /* dsm_sync */ NULL, /* dsm_log_flush */ NULL, /* dsm_pagesize */ NULL, /* dsm_purgelogs */ NULL, /* dsm_checkpoint */ NULL, /* dsm_recover */ NULL, /* dsm_remove */ NULL, /* dsm_verify */ NULL, /* dsm_list_logfiles */ NULL /* dsm_leafpages */ }; dsm_t *dsm = &dsm_tc; /* Function definitions */ const char *db_version_str(void) { static char v[80]; if (!v[0]) snprintf(v, sizeof(v), "TokyoCabinet (version %s, B+tree API)", tcversion); return v; } static dbh_t *dbh_init(bfpath *bfp) { dbh_t *handle; handle = xmalloc(sizeof(dbh_t)); memset(handle, 0, sizeof(dbh_t)); /* valgrind */ handle->name = xstrdup(bfp->filepath); handle->locked = false; handle->created = false; return handle; } static void dbh_free(/*@only@*/ dbh_t *handle) { if (handle != NULL) { xfree(handle->name); xfree(handle->path); xfree(handle); } return; } /* Returns is_swapped flag */ bool db_is_swapped(void *vhandle) { UNUSED(vhandle); return false; } /* Returns created flag */ bool db_created(void *vhandle) { dbh_t *handle = vhandle; return handle->created; } /* Initialize database. Returns: pointer to database handle on success, NULL otherwise. */ void *db_open(void * dummy, bfpath *bfp, dbmode_t open_mode) { dbh_t *handle; bool res; int open_flags; TCBDB *dbp; UNUSED(dummy); if (open_mode & DS_WRITE) open_flags = BDBOWRITER; else open_flags = BDBOREADER; handle = dbh_init(bfp); if (handle == NULL) return NULL; dbp = handle->dbp = tcbdbnew(); res = tcbdbopen(dbp, handle->name, open_flags); if (!res && (open_mode & DS_WRITE)) { res = tcbdbopen(dbp, handle->name, open_flags | BDBOCREAT); handle->created |= res; } if (!res) goto open_err; if (DEBUG_DATABASE(1)) fprintf(dbgout, "(tc) tcbdbopen( %s, %d )\n", handle->name, open_mode); return handle; open_err: print_error(__FILE__, __LINE__, "(tc) tcbdbopen(%s, %d), err: %d, %s", handle->name, open_flags, tcbdbecode(dbp), tcbdberrmsg(tcbdbecode(dbp))); dbh_free(handle); return NULL; } int db_delete(void *vhandle, const dbv_t *token) { int ret; dbh_t *handle = vhandle; TCBDB *dbp; dbp = handle->dbp; ret = tcbdbout(dbp, token->data, token->leng); if (ret == 0) { print_error(__FILE__, __LINE__, "(tc) tcbdbout('%.*s'), err: %d, %s", CLAMP_INT_MAX(token->leng), (char *)token->data, tcbdbecode(dbp), tcbdberrmsg(tcbdbecode(dbp))); exit(EX_ERROR); } ret = ret ^ 1; /* ok is 1 in qdbm and 0 in bogofilter */ return ret; /* 0 if ok */ } int db_get_dbvalue(void *vhandle, const dbv_t *token, /*@out@*/ dbv_t *val) { char *data; int dsiz; dbh_t *handle = vhandle; TCBDB *dbp = handle->dbp; data = tcbdbget(dbp, token->data, token->leng, &dsiz); if (data == NULL) return DS_NOTFOUND; if (val->leng < (unsigned)dsiz) { print_error(__FILE__, __LINE__, "(tc) db_get_dbvalue( '%.*s' ), size error %lu: %lu", CLAMP_INT_MAX(token->leng), (char *)token->data, (unsigned long)val->leng, (unsigned long)dsiz); exit(EX_ERROR); } val->leng = dsiz; /* read count */ memcpy(val->data, data, dsiz); free(data); /* not xfree() as allocated by tcbdbget() */ return 0; } /* Re-organize database according to some heuristics */ static inline void db_optimize(TCBDB *dbp, char *name) { UNUSED(dbp); UNUSED(name); /* The Villa API doesn't need optimizing like the formerly used Depot API because Villa uses B+ trees and Depot uses hash tables. Database size may grow larger and could get compacted with tcbdboptimize() however as the database size with Villa is smaller anyway, I don't think it is worth it. */ } int db_set_dbvalue(void *vhandle, const dbv_t *token, const dbv_t *val) { int ret; dbh_t *handle = vhandle; TCBDB *dbp = handle->dbp; ret = tcbdbput(dbp, token->data, token->leng, val->data, val->leng); if (ret == 0) { print_error(__FILE__, __LINE__, "(tc) db_set_dbvalue( '%.*s' ) err: %d, %s", CLAMP_INT_MAX(token->leng), (char *)token->data, tcbdbecode(dbp), tcbdberrmsg(tcbdbecode(dbp))); exit(EX_ERROR); } db_optimize(dbp, handle->name); return 0; } /* Close files and clean up. */ void db_close(void *vhandle) { dbh_t *handle = vhandle; TCBDB *dbp; if (handle == NULL) return; if (DEBUG_DATABASE(1)) fprintf(dbgout, "(tc) tcbdbclose(%s)\n", handle->name); dbp = handle->dbp; db_optimize(dbp, handle->name); if (!tcbdbclose(dbp)) print_error(__FILE__, __LINE__, "(tc) tcbdbclose for %s err: %d, %s", handle->name, tcbdbecode(dbp), tcbdberrmsg(tcbdbecode(dbp))); tcbdbdel(dbp); handle->dbp = NULL; dbh_free(handle); } /* Flush any data in memory to disk */ void db_flush(void *vhandle) { dbh_t *handle = vhandle; TCBDB * dbp = handle->dbp; if (!tcbdbsync(dbp)) print_error(__FILE__, __LINE__, "(tc) tcbdbsync err: %d, %s", tcbdbecode(dbp), tcbdberrmsg(tcbdbecode(dbp))); } ex_t db_foreach(void *vhandle, db_foreach_t hook, void *userdata) { int ret = 0; dbh_t *handle = vhandle; TCBDB *dbp = handle->dbp; BDBCUR *cursor; dbv_t dbv_key, dbv_data; int ksiz, dsiz; char *key, *data; cursor = tcbdbcurnew(dbp); ret = tcbdbcurfirst(cursor); if (ret) { while ((key = tcbdbcurkey(cursor, &ksiz))) { data = tcbdbcurval(cursor, &dsiz); if (data) { /* switch to "dbv_t *" variables */ dbv_key.leng = ksiz; dbv_key.data = xmalloc(dbv_key.leng+1); memcpy(dbv_key.data, key, ksiz); ((char *)dbv_key.data)[dbv_key.leng] = '\0'; dbv_data.data = data; dbv_data.leng = dsiz; /* read count */ /* call user function */ ret = hook(&dbv_key, &dbv_data, userdata); xfree(dbv_key.data); if (ret != 0) break; free(data); /* not xfree() as allocated by dpget() */ } free(key); /* not xfree() as allocated by dpiternext() */ tcbdbcurnext(cursor); } } else { print_error(__FILE__, __LINE__, "(tc) tcbdbcurfirst err: %d, %s", tcbdbecode(dbp), tcbdberrmsg(tcbdbecode(dbp))); exit(EX_ERROR); } tcbdbcurdel(cursor); return EX_OK; } const char *db_str_err(int e) { return tcbdberrmsg(e); } bogofilter-1.2.4/src/word.h0000644000175000017500000000346212163572304013761 0ustar sezsez/* $Id: word.h 6895 2010-03-23 17:48:52Z m-a $ */ /** \file word.h * constants and declarations for word.c * * \author David Relson */ #ifndef WORD_H #define WORD_H #include "bftypes.h" #include "xmalloc.h" /** Structure to store a string of arbitrary content, including '\\0' * bytes. * \attention to lessen malloc/free calls, this struct and the data * are allocated in one chunk. */ typedef struct { uint leng; /** length of string in \a text */ union { byte *text; /** pointer to the string */ const char *ctext; } u; } word_t; /** create a new word_t from the \a leng bytes at address \a text */ extern word_t *word_new(const byte *text, /**< may be NULL, to create a blank word_t */ uint leng /**< length of input string */); /** create a new word_t from the NUL-terminated \a cstring */ extern word_t *word_news(const char *cstring); /** deallocate memory allocated for \a self */ #define word_free(self) xfree((self)) /** create a newly word_t to form a deep copy of \a self */ #define word_dup(self) word_new((self)->u.text, (self)->leng) /** compare \a w1 and \a w2 with memcmp() */ extern int word_cmp(const word_t *w1, const word_t *w2); /** create a new word_t that is the concatenation of \a w1 and \a w2 */ extern word_t *word_concat(const word_t *w1, const word_t *w2); /** output \a word onto the stream \a fp, formatted to \a width * characters. */ extern void word_puts(const word_t *word, /**< word structure to print */ uint width, /**< if 0, use actual width, if > 0 then either * truncate the string or fill it with blanks to print * exactly \a width characters */ FILE *fp /**< stdio stream to print word to */); /** Compare word \a w to string \a s. */ extern int word_cmps(const word_t *w, const char *s); #endif /* WORD_H */ bogofilter-1.2.4/src/xstrdup.c0000644000175000017500000000055412163572272014515 0ustar sezsez/* (C) 2002 by Matthias Andree, redistributable according to the terms * of the GNU General Public License, v2. * * $Id: xstrdup.c 4184 2004-02-25 04:51:58Z relson $ * */ #include #include "xmalloc.h" #include "xstrdup.h" char *xstrdup(const char *s) { size_t l = strlen(s) + 1; char *t = xmalloc(l); memcpy(t, s, l); return t; } bogofilter-1.2.4/src/xrealloc.c0000644000175000017500000000071412163572304014607 0ustar sezsez/* $Id: xrealloc.c 5649 2005-03-16 00:52:05Z relson $ */ /* * NAME: * xrealloc.c -- front-end to standard heap manipulation routines, with error checking. * * AUTHOR: * Gyepi Sam * */ #include "config.h" #include "xmalloc.h" void *xrealloc(void *ptr, size_t size){ ptr = bf_realloc(ptr, size); if (ptr == NULL && size == 0) ptr = bf_calloc(1, 1); if (ptr == NULL) xmem_error("xrealloc"); return ptr; } bogofilter-1.2.4/src/Makefile.in0000644000175000017500000033655712163573272014725 0ustar sezsez# Makefile.in generated by automake 1.12.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2012 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # vim:tw=0 # $Id: Makefile.am 6993 2013-06-28 21:54:23Z m-a $ VPATH = @srcdir@ am__make_dryrun = \ { \ am__dry=no; \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \ | grep '^AM OK$$' >/dev/null || am__dry=yes;; \ *) \ for am__flg in $$MAKEFLAGS; do \ case $$am__flg in \ *=*|--*) ;; \ *n*) am__dry=yes; break;; \ esac; \ done;; \ esac; \ test $$am__dry = yes; \ } pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ @ENABLE_MEMDEBUG_TRUE@am__append_1 = -DENABLE_MEMDEBUG bin_PROGRAMS = bogofilter$(EXEEXT) bogoutil$(EXEEXT) \ bogolexer$(EXEEXT) bogotune$(EXEEXT) $(am__EXEEXT_1) \ $(am__EXEEXT_2) @ENABLE_STATIC_TRUE@am__append_2 = bogofilter_static bogoutil_static bogolexer_static bogotune_static check_PROGRAMS = debugtest$(EXEEXT) configtest$(EXEEXT) \ wordhash$(EXEEXT) find_home.test$(EXEEXT) fgetsl.test$(EXEEXT) \ $(am__EXEEXT_3) @NEED_GSL_TRUE@am__append_3 = libbf_gsl.a @NEED_GSL_TRUE@am__append_4 = libbf_gsl.a EXTRA_PROGRAMS = panicenv$(EXEEXT) @NEEDTRIO_TRUE@am__append_5 = libtrio.a @NEEDTRIO_TRUE@am__append_6 = regression @NEEDTRIO_TRUE@am__append_7 = ./regression @NEEDTRIO_TRUE@am__append_8 = libtrio.a @DISABLE_UNICODE_FALSE@am__append_9 = @LIBICONV@ @NEED_GETOPT_TRUE@am__append_10 = libgnugetopt.a @NEED_GETOPT_TRUE@am__append_11 = libgnugetopt.a @ENABLE_QDBM_DATASTORE_TRUE@am__append_12 = bogoQDBMupgrade subdir = src DIST_COMMON = $(dist_bin_SCRIPTS) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in $(srcdir)/bf_compact.in \ $(srcdir)/bf_copy.in $(srcdir)/bf_tar.in \ $(top_srcdir)/config.in $(top_srcdir)/depcomp \ $(top_srcdir)/ylwrap lexer_v3.c memcmp.c strerror.c strlcat.c \ strlcpy.c strtoul.c ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/gsl.m4 \ $(top_srcdir)/m4/iconv.m4 $(top_srcdir)/m4/lib-ld.m4 \ $(top_srcdir)/m4/lib-link.m4 $(top_srcdir)/m4/lib-prefix.m4 \ $(top_srcdir)/m4/stdbool.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = config.h CONFIG_CLEAN_FILES = bf_compact bf_copy bf_tar CONFIG_CLEAN_VPATH_FILES = LIBRARIES = $(noinst_LIBRARIES) ARFLAGS = cru libbf_gsl_a_AR = $(AR) $(ARFLAGS) libbf_gsl_a_LIBADD = am__libbf_gsl_a_SOURCES_DIST = ../gsl/cdf/chisq.c ../gsl/cdf/gamma.c \ ../gsl/specfunc/gamma_inc.c ../gsl/err/error.c \ ../gsl/sys/infnan.c ../gsl/sys/fdiv.c ../gsl/specfunc/exp.c \ ../gsl/specfunc/trig.c ../gsl/specfunc/log.c \ ../gsl/specfunc/psi.c ../gsl/specfunc/zeta.c \ ../gsl/specfunc/elementary.c ../gsl/err/stream.c \ ../gsl/specfunc/expint.c ../gsl/specfunc/erfc.c \ ../gsl/sys/coerce.c ../gsl/sys/pow_int.c ../gsl/sys/minmax.c @NEED_GSL_TRUE@am_libbf_gsl_a_OBJECTS = libbf_gsl_a-chisq.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-gamma.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-gamma_inc.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-error.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-infnan.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-fdiv.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-exp.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-trig.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-log.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-psi.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-zeta.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-elementary.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-stream.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-expint.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-erfc.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-coerce.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-pow_int.$(OBJEXT) \ @NEED_GSL_TRUE@ libbf_gsl_a-minmax.$(OBJEXT) libbf_gsl_a_OBJECTS = $(am_libbf_gsl_a_OBJECTS) libbogofilter_a_AR = $(AR) $(ARFLAGS) libbogofilter_a_LIBADD = am__libbogofilter_a_SOURCES_DIST = version.c common.h system.h \ bftypes.h globals.h globals.c base64.h base64.c bf_exit.c \ bogoconfig.h bogoconfig.c bogomain.h bogomain.c bogoreader.h \ bogoreader.c bool.h bool.c bsdqueue.h buff.h buff.c charset.c \ charset.h convert_charset.c convert_charset.h chUnicodeTo866.h \ convert_unicode.c convert_unicode.h iconvert.c iconvert.h \ collect.h collect.c configfile.h configfile.c datastore.h \ datastore.c datastore_dbcommon.h datastore_db_private.h \ db_lock.h db_lock.c debug.h debug.c error.h error.c fgetsl.h \ fgetsl.c find_home.h find_home.c find_home_user.c \ find_home_tildeexpand.c format.h format.c lexer.h lexer.c \ lexer_v3.l listsort.h listsort.c longoptions.h maint.h maint.c \ memstr.h memstr.c mime.h mime.c msgcounts.h msgcounts.c \ mxcat.h mxcat.c passthrough.h passthrough.c paths.h paths.c \ prob.h prob.c qp.h qp.c rand_sleep.h rand_sleep.c register.h \ register.c robx.h robx.c rstats.h rstats.c score.h score.c \ sighandler.h sighandler.c swap.h swap_32bit.c system.c \ textblock.h textblock.c token.h token.c transaction.h \ transaction.c uudecode.h uudecode.c word.h word.c wordhash.h \ wordhash.c wordlists.h wordlists.c wordlists_base.h \ wordlists_base.c xmalloc.h xcalloc.c xmalloc.c xmem_error.c \ xrealloc.c xmemrchr.h xmemrchr.c xstrdup.h xstrdup.c \ xstrlcat.h xstrlcat.c xstrlcpy.h xstrlcpy.c memdebug.c \ memdebug.h xatox.h xatof.c xatoi.c getopt_long_chk.c \ datastore_db.h datastore_db.c datastore_db_trad.c \ datastore_db_trans.c datastore_opthelp_dummies.c \ datastore_tc.c datastore_dummies.c datastore_sqlite.c \ datastore_qdbm.c datastore_qdbm_cmpkey.c \ datastore_txn_dummies.c @DISABLE_UNICODE_FALSE@@ENABLE_UNICODE_FALSE@am__objects_1 = charset.$(OBJEXT) \ @DISABLE_UNICODE_FALSE@@ENABLE_UNICODE_FALSE@ convert_charset.$(OBJEXT) \ @DISABLE_UNICODE_FALSE@@ENABLE_UNICODE_FALSE@ convert_unicode.$(OBJEXT) \ @DISABLE_UNICODE_FALSE@@ENABLE_UNICODE_FALSE@ iconvert.$(OBJEXT) @DISABLE_UNICODE_TRUE@@ENABLE_UNICODE_FALSE@am__objects_1 = \ @DISABLE_UNICODE_TRUE@@ENABLE_UNICODE_FALSE@ charset.$(OBJEXT) \ @DISABLE_UNICODE_TRUE@@ENABLE_UNICODE_FALSE@ convert_charset.$(OBJEXT) @ENABLE_UNICODE_TRUE@am__objects_1 = charset.$(OBJEXT) \ @ENABLE_UNICODE_TRUE@ convert_unicode.$(OBJEXT) \ @ENABLE_UNICODE_TRUE@ iconvert.$(OBJEXT) @ENABLE_MEMDEBUG_TRUE@am__objects_2 = memdebug.$(OBJEXT) am__objects_3 = globals.$(OBJEXT) base64.$(OBJEXT) bf_exit.$(OBJEXT) \ bogoconfig.$(OBJEXT) bogomain.$(OBJEXT) bogoreader.$(OBJEXT) \ bool.$(OBJEXT) buff.$(OBJEXT) $(am__objects_1) \ collect.$(OBJEXT) configfile.$(OBJEXT) datastore.$(OBJEXT) \ db_lock.$(OBJEXT) debug.$(OBJEXT) error.$(OBJEXT) \ fgetsl.$(OBJEXT) find_home.$(OBJEXT) find_home_user.$(OBJEXT) \ find_home_tildeexpand.$(OBJEXT) format.$(OBJEXT) \ lexer.$(OBJEXT) lexer_v3.$(OBJEXT) listsort.$(OBJEXT) \ maint.$(OBJEXT) memstr.$(OBJEXT) mime.$(OBJEXT) \ msgcounts.$(OBJEXT) mxcat.$(OBJEXT) passthrough.$(OBJEXT) \ paths.$(OBJEXT) prob.$(OBJEXT) qp.$(OBJEXT) \ rand_sleep.$(OBJEXT) register.$(OBJEXT) robx.$(OBJEXT) \ rstats.$(OBJEXT) score.$(OBJEXT) sighandler.$(OBJEXT) \ swap_32bit.$(OBJEXT) system.$(OBJEXT) textblock.$(OBJEXT) \ token.$(OBJEXT) transaction.$(OBJEXT) uudecode.$(OBJEXT) \ word.$(OBJEXT) wordhash.$(OBJEXT) wordlists.$(OBJEXT) \ wordlists_base.$(OBJEXT) xcalloc.$(OBJEXT) xmalloc.$(OBJEXT) \ xmem_error.$(OBJEXT) xrealloc.$(OBJEXT) xmemrchr.$(OBJEXT) \ xstrdup.$(OBJEXT) xstrlcat.$(OBJEXT) xstrlcpy.$(OBJEXT) \ $(am__objects_2) xatof.$(OBJEXT) xatoi.$(OBJEXT) \ getopt_long_chk.$(OBJEXT) @DISABLE_TRANSACTIONS_FALSE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@am__objects_4 = datastore_db.$(OBJEXT) \ @DISABLE_TRANSACTIONS_FALSE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@ datastore_db_trad.$(OBJEXT) \ @DISABLE_TRANSACTIONS_FALSE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@ datastore_db_trans.$(OBJEXT) @DISABLE_TRANSACTIONS_TRUE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@am__objects_4 = datastore_db.$(OBJEXT) \ @DISABLE_TRANSACTIONS_TRUE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@ datastore_db_trad.$(OBJEXT) \ @DISABLE_TRANSACTIONS_TRUE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@ datastore_opthelp_dummies.$(OBJEXT) @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_TRUE@am__objects_4 = datastore_db.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_TRUE@ datastore_db_trans.$(OBJEXT) @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_TRUE@am__objects_4 = datastore_tc.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_TRUE@ datastore_opthelp_dummies.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_TRUE@ datastore_dummies.$(OBJEXT) @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_TRUE@am__objects_4 = datastore_sqlite.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_TRUE@ datastore_opthelp_dummies.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_TRUE@ datastore_dummies.$(OBJEXT) @ENABLE_QDBM_DATASTORE_TRUE@am__objects_4 = datastore_qdbm.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_TRUE@ datastore_qdbm_cmpkey.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_TRUE@ datastore_txn_dummies.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_TRUE@ datastore_opthelp_dummies.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_TRUE@ datastore_dummies.$(OBJEXT) am_libbogofilter_a_OBJECTS = version.$(OBJEXT) $(am__objects_3) \ $(am__objects_4) nodist_libbogofilter_a_OBJECTS = directories.$(OBJEXT) libbogofilter_a_OBJECTS = $(am_libbogofilter_a_OBJECTS) \ $(nodist_libbogofilter_a_OBJECTS) libgnugetopt_a_AR = $(AR) $(ARFLAGS) libgnugetopt_a_LIBADD = am__libgnugetopt_a_SOURCES_DIST = ../gnugetopt/getopt1.c \ ../gnugetopt/getopt.c @NEED_GETOPT_TRUE@am_libgnugetopt_a_OBJECTS = getopt1.$(OBJEXT) \ @NEED_GETOPT_TRUE@ getopt.$(OBJEXT) libgnugetopt_a_OBJECTS = $(am_libgnugetopt_a_OBJECTS) libtrio_a_AR = $(AR) $(ARFLAGS) libtrio_a_LIBADD = am__libtrio_a_SOURCES_DIST = ../trio/triostr.c ../trio/trio.c \ ../trio/trionan.c ../trio/trio.h ../trio/triop.h \ ../trio/triodef.h ../trio/trionan.h ../trio/triostr.h @NEEDTRIO_TRUE@am_libtrio_a_OBJECTS = triostr.$(OBJEXT) trio.$(OBJEXT) \ @NEEDTRIO_TRUE@ trionan.$(OBJEXT) libtrio_a_OBJECTS = $(am_libtrio_a_OBJECTS) @ENABLE_STATIC_TRUE@am__EXEEXT_1 = bogofilter_static$(EXEEXT) \ @ENABLE_STATIC_TRUE@ bogoutil_static$(EXEEXT) \ @ENABLE_STATIC_TRUE@ bogolexer_static$(EXEEXT) \ @ENABLE_STATIC_TRUE@ bogotune_static$(EXEEXT) @ENABLE_QDBM_DATASTORE_TRUE@am__EXEEXT_2 = bogoQDBMupgrade$(EXEEXT) am__installdirs = "$(DESTDIR)$(bindir)" "$(DESTDIR)$(bindir)" \ "$(DESTDIR)$(bindir)" @NEEDTRIO_TRUE@am__EXEEXT_3 = regression$(EXEEXT) PROGRAMS = $(bin_PROGRAMS) am__bogoQDBMupgrade_SOURCES_DIST = bogoQDBMupgrade.c \ datastore_qdbm_cmpkey.c @ENABLE_QDBM_DATASTORE_TRUE@am_bogoQDBMupgrade_OBJECTS = \ @ENABLE_QDBM_DATASTORE_TRUE@ bogoQDBMupgrade.$(OBJEXT) \ @ENABLE_QDBM_DATASTORE_TRUE@ datastore_qdbm_cmpkey.$(OBJEXT) bogoQDBMupgrade_OBJECTS = $(am_bogoQDBMupgrade_OBJECTS) am__DEPENDENCIES_1 = am__DEPENDENCIES_2 = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ @ENABLE_QDBM_DATASTORE_TRUE@bogoQDBMupgrade_DEPENDENCIES = \ @ENABLE_QDBM_DATASTORE_TRUE@ $(am__DEPENDENCIES_2) \ @ENABLE_QDBM_DATASTORE_TRUE@ $(am__DEPENDENCIES_1) am_bogofilter_OBJECTS = bogofilter.$(OBJEXT) main.$(OBJEXT) bogofilter_OBJECTS = $(am_bogofilter_OBJECTS) bogofilter_DEPENDENCIES = $(am__DEPENDENCIES_2) $(am__DEPENDENCIES_1) \ $(am__DEPENDENCIES_1) am__objects_5 = bogofilter.$(OBJEXT) main.$(OBJEXT) am_bogofilter_static_OBJECTS = $(am__objects_5) bogofilter_static_OBJECTS = $(am_bogofilter_static_OBJECTS) bogofilter_static_DEPENDENCIES = $(am__DEPENDENCIES_2) \ $(am__DEPENDENCIES_1) $(am__DEPENDENCIES_1) bogofilter_static_LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(bogofilter_static_LDFLAGS) $(LDFLAGS) -o $@ bogolexer_SOURCES = bogolexer.c bogolexer_OBJECTS = bogolexer.$(OBJEXT) bogolexer_LDADD = $(LDADD) bogolexer_DEPENDENCIES = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ am_bogolexer_static_OBJECTS = bogolexer.$(OBJEXT) bogolexer_static_OBJECTS = $(am_bogolexer_static_OBJECTS) bogolexer_static_LDADD = $(LDADD) bogolexer_static_DEPENDENCIES = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ bogolexer_static_LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(bogolexer_static_LDFLAGS) $(LDFLAGS) -o $@ am_bogotune_OBJECTS = bogotune.$(OBJEXT) tunelist.$(OBJEXT) bogotune_OBJECTS = $(am_bogotune_OBJECTS) bogotune_DEPENDENCIES = $(am__DEPENDENCIES_2) $(am__DEPENDENCIES_1) \ $(am__DEPENDENCIES_1) am_bogotune_static_OBJECTS = bogotune.$(OBJEXT) tunelist.$(OBJEXT) bogotune_static_OBJECTS = $(am_bogotune_static_OBJECTS) bogotune_static_DEPENDENCIES = $(am__DEPENDENCIES_2) \ $(am__DEPENDENCIES_1) $(am__DEPENDENCIES_1) bogotune_static_LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(bogotune_static_LDFLAGS) $(LDFLAGS) -o $@ am_bogoutil_OBJECTS = bogoutil.$(OBJEXT) bogohist.$(OBJEXT) bogoutil_OBJECTS = $(am_bogoutil_OBJECTS) bogoutil_DEPENDENCIES = $(am__DEPENDENCIES_2) $(am__DEPENDENCIES_1) am_bogoutil_static_OBJECTS = bogoutil.$(OBJEXT) bogohist.$(OBJEXT) bogoutil_static_OBJECTS = $(am_bogoutil_static_OBJECTS) bogoutil_static_DEPENDENCIES = $(am__DEPENDENCIES_2) \ $(am__DEPENDENCIES_1) bogoutil_static_LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(bogoutil_static_LDFLAGS) $(LDFLAGS) -o $@ configtest_SOURCES = configtest.c configtest_OBJECTS = configtest.$(OBJEXT) configtest_DEPENDENCIES = $(am__DEPENDENCIES_2) $(am__DEPENDENCIES_1) am_debugtest_OBJECTS = debug.main.$(OBJEXT) debugtest_OBJECTS = $(am_debugtest_OBJECTS) debugtest_LDADD = $(LDADD) debugtest_DEPENDENCIES = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ am_fgetsl_test_OBJECTS = fgetsl_test-fgetsl.$(OBJEXT) fgetsl_test_OBJECTS = $(am_fgetsl_test_OBJECTS) fgetsl_test_LDADD = $(LDADD) fgetsl_test_DEPENDENCIES = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ fgetsl_test_LINK = $(CCLD) $(fgetsl_test_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ am_find_home_test_OBJECTS = find_home.test.$(OBJEXT) find_home_test_OBJECTS = $(am_find_home_test_OBJECTS) find_home_test_LDADD = $(LDADD) find_home_test_DEPENDENCIES = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ am_panicenv_OBJECTS = panicenv.$(OBJEXT) panicenv_OBJECTS = $(am_panicenv_OBJECTS) panicenv_DEPENDENCIES = $(am__DEPENDENCIES_1) am__regression_SOURCES_DIST = ../trio/regression.c @NEEDTRIO_TRUE@am_regression_OBJECTS = regression.$(OBJEXT) regression_OBJECTS = $(am_regression_OBJECTS) regression_LDADD = $(LDADD) regression_DEPENDENCIES = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ am_wordhash_OBJECTS = wordhash.main.$(OBJEXT) wordhash_OBJECTS = $(am_wordhash_OBJECTS) wordhash_LDADD = $(LDADD) wordhash_DEPENDENCIES = libbogofilter.a $(am__append_8) \ $(am__DEPENDENCIES_1) $(am__append_11) @LIBOBJS@ am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } SCRIPTS = $(bin_SCRIPTS) $(dist_bin_SCRIPTS) DEFAULT_INCLUDES = -I.@am__isrc@ depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ LEXCOMPILE = $(LEX) $(AM_LFLAGS) $(LFLAGS) YLWRAP = $(top_srcdir)/ylwrap SOURCES = $(libbf_gsl_a_SOURCES) $(libbogofilter_a_SOURCES) \ $(EXTRA_libbogofilter_a_SOURCES) \ $(nodist_libbogofilter_a_SOURCES) $(libgnugetopt_a_SOURCES) \ $(libtrio_a_SOURCES) $(bogoQDBMupgrade_SOURCES) \ $(bogofilter_SOURCES) $(bogofilter_static_SOURCES) bogolexer.c \ $(bogolexer_static_SOURCES) $(bogotune_SOURCES) \ $(bogotune_static_SOURCES) $(bogoutil_SOURCES) \ $(bogoutil_static_SOURCES) configtest.c $(debugtest_SOURCES) \ $(fgetsl_test_SOURCES) $(find_home_test_SOURCES) \ $(panicenv_SOURCES) $(regression_SOURCES) $(wordhash_SOURCES) DIST_SOURCES = $(am__libbf_gsl_a_SOURCES_DIST) \ $(am__libbogofilter_a_SOURCES_DIST) \ $(EXTRA_libbogofilter_a_SOURCES) \ $(am__libgnugetopt_a_SOURCES_DIST) \ $(am__libtrio_a_SOURCES_DIST) \ $(am__bogoQDBMupgrade_SOURCES_DIST) $(bogofilter_SOURCES) \ $(bogofilter_static_SOURCES) bogolexer.c \ $(bogolexer_static_SOURCES) $(bogotune_SOURCES) \ $(bogotune_static_SOURCES) $(bogoutil_SOURCES) \ $(bogoutil_static_SOURCES) configtest.c $(debugtest_SOURCES) \ $(fgetsl_test_SOURCES) $(find_home_test_SOURCES) \ $(panicenv_SOURCES) $(am__regression_SOURCES_DIST) \ $(wordhash_SOURCES) RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ distdir ETAGS = etags CTAGS = ctags am__tty_colors_dummy = \ mgn= red= grn= lgn= blu= brg= std=; \ am__color_tests=no am__tty_colors = $(am__tty_colors_dummy) DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DB_EXT = @DB_EXT@ DB_TYPE = @DB_TYPE@ DEFAULT_CHARSET = @DEFAULT_CHARSET@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ ENCODING = @ENCODING@ EXEEXT = @EXEEXT@ EXE_EXT = @EXE_EXT@ GREP = @GREP@ GSL_CFLAGS = @GSL_CFLAGS@ GSL_CONFIG = @GSL_CONFIG@ GSL_LIBS = @GSL_LIBS@ HAVE_EXTENDED_PRECISION_REGISTERS = @HAVE_EXTENDED_PRECISION_REGISTERS@ HAVE_EXTERN_INLINE = @HAVE_EXTERN_INLINE@ HAVE_INLINE = @HAVE_INLINE@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LEX = @LEX@ LEXLIB = @LEXLIB@ LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@ LIBDB = @LIBDB@ LIBICONV = @LIBICONV@ LIBOBJS = @LIBOBJS@ LIBQDBM = @LIBQDBM@ LIBS = @LIBS@ LIBSQLITE3 = @LIBSQLITE3@ LIBTOKYOCABINET = @LIBTOKYOCABINET@ LTLIBDB = @LTLIBDB@ LTLIBICONV = @LTLIBICONV@ LTLIBOBJS = @LTLIBOBJS@ LTLIBQDBM = @LTLIBQDBM@ LTLIBSQLITE3 = @LTLIBSQLITE3@ LTLIBTOKYOCABINET = @LTLIBTOKYOCABINET@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NSGMLS = @NSGMLS@ OBJEXT = @OBJEXT@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PERL = @PERL@ RANLIB = @RANLIB@ RPMBUILD = @RPMBUILD@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STATICLDFLAGS = @STATICLDFLAGS@ STATIC_DB = @STATIC_DB@ STRIP = @STRIP@ USE_TRANSACTIONS = @USE_TRANSACTIONS@ USE_UNICODE = @USE_UNICODE@ VERSION = @VERSION@ XMLLINT = @XMLLINT@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_cv_enable_xmlto = @ac_cv_enable_xmlto@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ transformed_bogofilter = @transformed_bogofilter@ transformed_bogoutil = @transformed_bogoutil@ SUBDIRS = . tests SYSCONFDIR = @sysconfdir@ @ENABLE_MEMDEBUG_TRUE@MEMDEBUG_SRC = memdebug.c memdebug.h noinst_LIBRARIES = libbogofilter.a $(am__append_3) $(am__append_5) \ $(am__append_10) @USE_GCC4_FALSE@AM_CPPFLAGS = -I$(top_srcdir)/gnugetopt -I$(top_srcdir)/trio -I- -I. \ @USE_GCC4_FALSE@ -I$(srcdir) @GSL_CFLAGS@ -I$(top_srcdir)/gsl/specfunc -I$(top_srcdir) @USE_GCC4_TRUE@AM_CPPFLAGS = -iquote$(top_srcdir)/gnugetopt -iquote$(top_srcdir)/trio \ @USE_GCC4_TRUE@ -I$(srcdir) @GSL_CFLAGS@ -I$(top_srcdir)/gsl/specfunc -I$(top_srcdir) AM_CFLAGS = -DBOGOFILTER $(am__append_1) BUILT_SOURCES = version.c directories.c $(am__append_4) bin_SCRIPTS = bogoupgrade dist_bin_SCRIPTS = bf_copy bf_compact bf_tar TESTS = $(am__append_7) # this must be last so any library we may have added has access to the # AC_REPLACE objects, for instance, trio may need strtoul: LDADD = libbogofilter.a $(am__append_8) $(am__append_9) \ $(am__append_11) @LIBOBJS@ bogofilter_LDADD = $(LDADD) $(LIBDB) $(GSL_LIBS) bogoutil_LDADD = $(LDADD) $(LIBDB) configtest_LDADD = $(LDADD) $(LIBDB) @NEED_GSL_TRUE@libbf_gsl_a_CFLAGS = $(AM_CFLAGS) -DRENAMEFILES @NEED_GSL_TRUE@libbf_gsl_a_SOURCES = \ @NEED_GSL_TRUE@../gsl/cdf/chisq.c ../gsl/cdf/gamma.c \ @NEED_GSL_TRUE@../gsl/specfunc/gamma_inc.c ../gsl/err/error.c \ @NEED_GSL_TRUE@../gsl/sys/infnan.c ../gsl/sys/fdiv.c \ @NEED_GSL_TRUE@../gsl/specfunc/exp.c ../gsl/specfunc/trig.c \ @NEED_GSL_TRUE@../gsl/specfunc/log.c ../gsl/specfunc/psi.c \ @NEED_GSL_TRUE@../gsl/specfunc/zeta.c ../gsl/specfunc/elementary.c \ @NEED_GSL_TRUE@../gsl/err/stream.c ../gsl/specfunc/expint.c \ @NEED_GSL_TRUE@../gsl/specfunc/erfc.c ../gsl/sys/coerce.c \ @NEED_GSL_TRUE@../gsl/sys/pow_int.c ../gsl/sys/minmax.c @NEED_GSL_TRUE@libbf_gsl_a_CPPFLAGS = -I$(top_srcdir) panicenv_SOURCES = panicenv.c panicenv_LDADD = $(LIBDB) @NEEDTRIO_TRUE@libtrio_a_SOURCES = ../trio/triostr.c ../trio/trio.c ../trio/trionan.c \ @NEEDTRIO_TRUE@ ../trio/trio.h ../trio/triop.h ../trio/triodef.h \ @NEEDTRIO_TRUE@ ../trio/trionan.h ../trio/triostr.h @NEEDTRIO_TRUE@regression_SOURCES = ../trio/regression.c @DISABLE_UNICODE_FALSE@@ENABLE_UNICODE_FALSE@CHARSET_SOURCES = charset.c charset.h \ @DISABLE_UNICODE_FALSE@@ENABLE_UNICODE_FALSE@ convert_charset.c convert_charset.h chUnicodeTo866.h \ @DISABLE_UNICODE_FALSE@@ENABLE_UNICODE_FALSE@ convert_unicode.c convert_unicode.h iconvert.c iconvert.h @DISABLE_UNICODE_TRUE@@ENABLE_UNICODE_FALSE@CHARSET_SOURCES = charset.c charset.h convert_charset.c chUnicodeTo866.h @ENABLE_UNICODE_TRUE@CHARSET_SOURCES = charset.c charset.h convert_unicode.c iconvert.h iconvert.c # what to build that from version_sources = \ common.h system.h bftypes.h \ globals.h globals.c \ base64.h base64.c \ bf_exit.c \ bogoconfig.h bogoconfig.c \ bogomain.h bogomain.c \ bogoreader.h bogoreader.c \ bool.h bool.c \ bsdqueue.h \ buff.h buff.c \ $(CHARSET_SOURCES) \ collect.h collect.c \ configfile.h configfile.c \ datastore.h datastore.c \ datastore_dbcommon.h datastore_db_private.h \ db_lock.h db_lock.c \ debug.h debug.c \ error.h error.c \ fgetsl.h fgetsl.c \ find_home.h find_home.c find_home_user.c find_home_tildeexpand.c \ format.h format.c \ lexer.h lexer.c lexer_v3.l \ listsort.h listsort.c \ longoptions.h \ maint.h maint.c \ memstr.h memstr.c \ mime.h mime.c \ msgcounts.h msgcounts.c \ mxcat.h mxcat.c \ passthrough.h passthrough.c \ paths.h paths.c \ prob.h prob.c \ qp.h qp.c \ rand_sleep.h rand_sleep.c \ register.h register.c \ robx.h robx.c \ rstats.h rstats.c \ score.h score.c \ sighandler.h sighandler.c \ swap.h swap_32bit.c system.c \ textblock.h textblock.c \ token.h token.c \ transaction.h transaction.c \ uudecode.h uudecode.c \ word.h word.c \ wordhash.h wordhash.c wordlists.h wordlists.c \ wordlists_base.h wordlists_base.c \ xmalloc.h xcalloc.c xmalloc.c xmem_error.c xrealloc.c \ xmemrchr.h xmemrchr.c \ xstrdup.h xstrdup.c \ xstrlcat.h xstrlcat.c \ xstrlcpy.h xstrlcpy.c \ $(MEMDEBUG_SRC) \ xatox.h xatof.c xatoi.c \ getopt_long_chk.c \ datastore_db.h libbogofilter_a_SOURCES = version.c $(version_sources) \ $(datastore_SOURCE) nodist_libbogofilter_a_SOURCES = \ directories.c \ unicode_runtime_selection unicode_enabled unicode_disabled @NEED_GETOPT_TRUE@libgnugetopt_a_SOURCES = ../gnugetopt/getopt1.c ../gnugetopt/getopt.c @DISABLE_TRANSACTIONS_FALSE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@datastore_SOURCE = datastore_db.c datastore_db_trad.c datastore_db_trans.c @DISABLE_TRANSACTIONS_TRUE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@datastore_SOURCE = datastore_db.c datastore_db_trad.c \ @DISABLE_TRANSACTIONS_TRUE@@ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_FALSE@ datastore_opthelp_dummies.c @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_FALSE@@ENABLE_TRANSACTIONS_TRUE@datastore_SOURCE = datastore_db.c datastore_db_trans.c @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_TRUE@datastore_SOURCE = datastore_tc.c \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_TRUE@ datastore_opthelp_dummies.c \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_FALSE@@ENABLE_TOKYOCABINET_DATASTORE_TRUE@ datastore_dummies.c @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_TRUE@datastore_SOURCE = datastore_sqlite.c datastore_opthelp_dummies.c \ @ENABLE_QDBM_DATASTORE_FALSE@@ENABLE_SQLITE_DATASTORE_TRUE@ datastore_dummies.c @ENABLE_QDBM_DATASTORE_TRUE@datastore_SOURCE = datastore_qdbm.c datastore_qdbm_cmpkey.c \ @ENABLE_QDBM_DATASTORE_TRUE@ datastore_txn_dummies.c datastore_opthelp_dummies.c \ @ENABLE_QDBM_DATASTORE_TRUE@ datastore_dummies.c @ENABLE_QDBM_DATASTORE_TRUE@bogoQDBMupgrade_SOURCES = bogoQDBMupgrade.c datastore_qdbm_cmpkey.c @ENABLE_QDBM_DATASTORE_TRUE@bogoQDBMupgrade_LDADD = $(LDADD) $(LIBDB) datastore_OBJECT = $(datastore_SOURCE:.c=.o) EXTRA_libbogofilter_a_SOURCES = datastore_db.c datastore_db_trad.c \ datastore_db_trans.c \ datastore_opthelp_dummies.c \ datastore_txn_dummies.c \ datastore_qdbm.h datastore_qdbm.c \ datastore_sqlite.c \ charset.h convert_charset.h convert_unicode.h \ charset.c \ convert_charset.c chUnicodeTo866.h \ convert_unicode.c iconvert.c iconvert.h CLEANFILES = version.c directories.c bogoupgrade bogofilter_SOURCES = bogofilter.c bogofilter.h main.c \ common.h bogofilter_static_SOURCES = $(bogofilter_SOURCES) bogofilter_static_LDFLAGS = $(STATICLDFLAGS) bogofilter_static_LDADD = $(LDADD) $(STATIC_DB) $(GSL_LIBS) bogolexer_static_SOURCES = bogolexer.c bogolexer_static_LDFLAGS = $(STATICLDFLAGS) bogoutil_SOURCES = bogoutil.c bogohist.c bogohist.h bogoutil_static_SOURCES = bogoutil.c bogohist.c bogohist.h bogoutil_static_LDFLAGS = $(STATICLDFLAGS) bogoutil_static_LDADD = $(LDADD) $(STATIC_DB) bogotune_SOURCES = bogotune.c bogotune.h \ tunelist.c tunelist.h \ common.h bogotune_LDADD = $(LDADD) $(LIBDB) $(GSL_LIBS) bogotune_static_SOURCES = bogotune.c bogotune.h \ tunelist.c tunelist.h \ common.h bogotune_static_LDFLAGS = $(STATICLDFLAGS) bogotune_static_LDADD = $(LDADD) $(STATIC_DB) $(GSL_LIBS) debugtest_SOURCES = debug.main.c wordhash_SOURCES = wordhash.main.c find_home_test_SOURCES = find_home.test.c fgetsl_test_SOURCES = fgetsl.c fgetsl_test_CFLAGS = -DMAIN # what to distribute EXTRA_DIST = bogoupgrade.in \ version.sh \ strlcat.3 strlcpy.3 \ patch.lexer.254.txt patch.lexer.253x.txt all: $(BUILT_SOURCES) config.h $(MAKE) $(AM_MAKEFLAGS) all-recursive .SUFFIXES: .SUFFIXES: .c .l .o .obj $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign src/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): config.h: stamp-h1 @if test ! -f $@; then rm -f stamp-h1; else :; fi @if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) stamp-h1; else :; fi stamp-h1: $(top_srcdir)/config.in $(top_builddir)/config.status @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status src/config.h $(top_srcdir)/config.in: $(am__configure_deps) ($(am__cd) $(top_srcdir) && $(AUTOHEADER)) rm -f stamp-h1 touch $@ distclean-hdr: -rm -f config.h stamp-h1 bf_compact: $(top_builddir)/config.status $(srcdir)/bf_compact.in cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ bf_copy: $(top_builddir)/config.status $(srcdir)/bf_copy.in cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ bf_tar: $(top_builddir)/config.status $(srcdir)/bf_tar.in cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ clean-noinstLIBRARIES: -test -z "$(noinst_LIBRARIES)" || rm -f $(noinst_LIBRARIES) libbf_gsl.a: $(libbf_gsl_a_OBJECTS) $(libbf_gsl_a_DEPENDENCIES) $(EXTRA_libbf_gsl_a_DEPENDENCIES) -rm -f libbf_gsl.a $(libbf_gsl_a_AR) libbf_gsl.a $(libbf_gsl_a_OBJECTS) $(libbf_gsl_a_LIBADD) $(RANLIB) libbf_gsl.a libbogofilter.a: $(libbogofilter_a_OBJECTS) $(libbogofilter_a_DEPENDENCIES) $(EXTRA_libbogofilter_a_DEPENDENCIES) -rm -f libbogofilter.a $(libbogofilter_a_AR) libbogofilter.a $(libbogofilter_a_OBJECTS) $(libbogofilter_a_LIBADD) $(RANLIB) libbogofilter.a libgnugetopt.a: $(libgnugetopt_a_OBJECTS) $(libgnugetopt_a_DEPENDENCIES) $(EXTRA_libgnugetopt_a_DEPENDENCIES) -rm -f libgnugetopt.a $(libgnugetopt_a_AR) libgnugetopt.a $(libgnugetopt_a_OBJECTS) $(libgnugetopt_a_LIBADD) $(RANLIB) libgnugetopt.a libtrio.a: $(libtrio_a_OBJECTS) $(libtrio_a_DEPENDENCIES) $(EXTRA_libtrio_a_DEPENDENCIES) -rm -f libtrio.a $(libtrio_a_AR) libtrio.a $(libtrio_a_OBJECTS) $(libtrio_a_LIBADD) $(RANLIB) libtrio.a install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \ $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \ fi; \ for p in $$list; do echo "$$p $$p"; done | \ sed 's/$(EXEEXT)$$//' | \ while read p p1; do if test -f $$p; \ then echo "$$p"; echo "$$p"; else :; fi; \ done | \ sed -e 'p;s,.*/,,;n;h' -e 's|.*|.|' \ -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \ sed 'N;N;N;s,\n, ,g' | \ $(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1 } \ { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \ if ($$2 == $$4) files[d] = files[d] " " $$1; \ else { print "f", $$3 "/" $$4, $$1; } } \ END { for (d in files) print "f", d, files[d] }' | \ while read type dir files; do \ if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \ test -z "$$files" || { \ echo " $(INSTALL_PROGRAM_ENV) $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'"; \ $(INSTALL_PROGRAM_ENV) $(INSTALL_PROGRAM) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \ } \ ; done uninstall-binPROGRAMS: @$(NORMAL_UNINSTALL) @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ files=`for p in $$list; do echo "$$p"; done | \ sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \ -e 's/$$/$(EXEEXT)/' `; \ test -n "$$list" || exit 0; \ echo " ( cd '$(DESTDIR)$(bindir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(bindir)" && rm -f $$files clean-binPROGRAMS: -test -z "$(bin_PROGRAMS)" || rm -f $(bin_PROGRAMS) clean-checkPROGRAMS: -test -z "$(check_PROGRAMS)" || rm -f $(check_PROGRAMS) bogoQDBMupgrade$(EXEEXT): $(bogoQDBMupgrade_OBJECTS) $(bogoQDBMupgrade_DEPENDENCIES) $(EXTRA_bogoQDBMupgrade_DEPENDENCIES) @rm -f bogoQDBMupgrade$(EXEEXT) $(LINK) $(bogoQDBMupgrade_OBJECTS) $(bogoQDBMupgrade_LDADD) $(LIBS) bogofilter$(EXEEXT): $(bogofilter_OBJECTS) $(bogofilter_DEPENDENCIES) $(EXTRA_bogofilter_DEPENDENCIES) @rm -f bogofilter$(EXEEXT) $(LINK) $(bogofilter_OBJECTS) $(bogofilter_LDADD) $(LIBS) bogofilter_static$(EXEEXT): $(bogofilter_static_OBJECTS) $(bogofilter_static_DEPENDENCIES) $(EXTRA_bogofilter_static_DEPENDENCIES) @rm -f bogofilter_static$(EXEEXT) $(bogofilter_static_LINK) $(bogofilter_static_OBJECTS) $(bogofilter_static_LDADD) $(LIBS) bogolexer$(EXEEXT): $(bogolexer_OBJECTS) $(bogolexer_DEPENDENCIES) $(EXTRA_bogolexer_DEPENDENCIES) @rm -f bogolexer$(EXEEXT) $(LINK) $(bogolexer_OBJECTS) $(bogolexer_LDADD) $(LIBS) bogolexer_static$(EXEEXT): $(bogolexer_static_OBJECTS) $(bogolexer_static_DEPENDENCIES) $(EXTRA_bogolexer_static_DEPENDENCIES) @rm -f bogolexer_static$(EXEEXT) $(bogolexer_static_LINK) $(bogolexer_static_OBJECTS) $(bogolexer_static_LDADD) $(LIBS) bogotune$(EXEEXT): $(bogotune_OBJECTS) $(bogotune_DEPENDENCIES) $(EXTRA_bogotune_DEPENDENCIES) @rm -f bogotune$(EXEEXT) $(LINK) $(bogotune_OBJECTS) $(bogotune_LDADD) $(LIBS) bogotune_static$(EXEEXT): $(bogotune_static_OBJECTS) $(bogotune_static_DEPENDENCIES) $(EXTRA_bogotune_static_DEPENDENCIES) @rm -f bogotune_static$(EXEEXT) $(bogotune_static_LINK) $(bogotune_static_OBJECTS) $(bogotune_static_LDADD) $(LIBS) bogoutil$(EXEEXT): $(bogoutil_OBJECTS) $(bogoutil_DEPENDENCIES) $(EXTRA_bogoutil_DEPENDENCIES) @rm -f bogoutil$(EXEEXT) $(LINK) $(bogoutil_OBJECTS) $(bogoutil_LDADD) $(LIBS) bogoutil_static$(EXEEXT): $(bogoutil_static_OBJECTS) $(bogoutil_static_DEPENDENCIES) $(EXTRA_bogoutil_static_DEPENDENCIES) @rm -f bogoutil_static$(EXEEXT) $(bogoutil_static_LINK) $(bogoutil_static_OBJECTS) $(bogoutil_static_LDADD) $(LIBS) configtest$(EXEEXT): $(configtest_OBJECTS) $(configtest_DEPENDENCIES) $(EXTRA_configtest_DEPENDENCIES) @rm -f configtest$(EXEEXT) $(LINK) $(configtest_OBJECTS) $(configtest_LDADD) $(LIBS) debugtest$(EXEEXT): $(debugtest_OBJECTS) $(debugtest_DEPENDENCIES) $(EXTRA_debugtest_DEPENDENCIES) @rm -f debugtest$(EXEEXT) $(LINK) $(debugtest_OBJECTS) $(debugtest_LDADD) $(LIBS) fgetsl.test$(EXEEXT): $(fgetsl_test_OBJECTS) $(fgetsl_test_DEPENDENCIES) $(EXTRA_fgetsl_test_DEPENDENCIES) @rm -f fgetsl.test$(EXEEXT) $(fgetsl_test_LINK) $(fgetsl_test_OBJECTS) $(fgetsl_test_LDADD) $(LIBS) find_home.test$(EXEEXT): $(find_home_test_OBJECTS) $(find_home_test_DEPENDENCIES) $(EXTRA_find_home_test_DEPENDENCIES) @rm -f find_home.test$(EXEEXT) $(LINK) $(find_home_test_OBJECTS) $(find_home_test_LDADD) $(LIBS) panicenv$(EXEEXT): $(panicenv_OBJECTS) $(panicenv_DEPENDENCIES) $(EXTRA_panicenv_DEPENDENCIES) @rm -f panicenv$(EXEEXT) $(LINK) $(panicenv_OBJECTS) $(panicenv_LDADD) $(LIBS) regression$(EXEEXT): $(regression_OBJECTS) $(regression_DEPENDENCIES) $(EXTRA_regression_DEPENDENCIES) @rm -f regression$(EXEEXT) $(LINK) $(regression_OBJECTS) $(regression_LDADD) $(LIBS) wordhash$(EXEEXT): $(wordhash_OBJECTS) $(wordhash_DEPENDENCIES) $(EXTRA_wordhash_DEPENDENCIES) @rm -f wordhash$(EXEEXT) $(LINK) $(wordhash_OBJECTS) $(wordhash_LDADD) $(LIBS) install-binSCRIPTS: $(bin_SCRIPTS) @$(NORMAL_INSTALL) @list='$(bin_SCRIPTS)'; test -n "$(bindir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \ $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \ fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ if test -f "$$d$$p"; then echo "$$d$$p"; echo "$$p"; else :; fi; \ done | \ sed -e 'p;s,.*/,,;n' \ -e 'h;s|.*|.|' \ -e 'p;x;s,.*/,,;$(transform)' | sed 'N;N;N;s,\n, ,g' | \ $(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1; } \ { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \ if ($$2 == $$4) { files[d] = files[d] " " $$1; \ if (++n[d] == $(am__install_max)) { \ print "f", d, files[d]; n[d] = 0; files[d] = "" } } \ else { print "f", d "/" $$4, $$1 } } \ END { for (d in files) print "f", d, files[d] }' | \ while read type dir files; do \ if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \ test -z "$$files" || { \ echo " $(INSTALL_SCRIPT) $$files '$(DESTDIR)$(bindir)$$dir'"; \ $(INSTALL_SCRIPT) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \ } \ ; done uninstall-binSCRIPTS: @$(NORMAL_UNINSTALL) @list='$(bin_SCRIPTS)'; test -n "$(bindir)" || exit 0; \ files=`for p in $$list; do echo "$$p"; done | \ sed -e 's,.*/,,;$(transform)'`; \ dir='$(DESTDIR)$(bindir)'; $(am__uninstall_files_from_dir) install-dist_binSCRIPTS: $(dist_bin_SCRIPTS) @$(NORMAL_INSTALL) @list='$(dist_bin_SCRIPTS)'; test -n "$(bindir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \ $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \ fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ if test -f "$$d$$p"; then echo "$$d$$p"; echo "$$p"; else :; fi; \ done | \ sed -e 'p;s,.*/,,;n' \ -e 'h;s|.*|.|' \ -e 'p;x;s,.*/,,;$(transform)' | sed 'N;N;N;s,\n, ,g' | \ $(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1; } \ { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \ if ($$2 == $$4) { files[d] = files[d] " " $$1; \ if (++n[d] == $(am__install_max)) { \ print "f", d, files[d]; n[d] = 0; files[d] = "" } } \ else { print "f", d "/" $$4, $$1 } } \ END { for (d in files) print "f", d, files[d] }' | \ while read type dir files; do \ if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \ test -z "$$files" || { \ echo " $(INSTALL_SCRIPT) $$files '$(DESTDIR)$(bindir)$$dir'"; \ $(INSTALL_SCRIPT) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \ } \ ; done uninstall-dist_binSCRIPTS: @$(NORMAL_UNINSTALL) @list='$(dist_bin_SCRIPTS)'; test -n "$(bindir)" || exit 0; \ files=`for p in $$list; do echo "$$p"; done | \ sed -e 's,.*/,,;$(transform)'`; \ dir='$(DESTDIR)$(bindir)'; $(am__uninstall_files_from_dir) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/memcmp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/strerror.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/strlcat.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/strlcpy.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@$(DEPDIR)/strtoul.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/base64.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bf_exit.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogoQDBMupgrade.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogoconfig.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogofilter.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogohist.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogolexer.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogomain.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogoreader.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogotune.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bogoutil.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bool.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/buff.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/charset.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/collect.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/configfile.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/configtest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/convert_charset.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/convert_unicode.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_db.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_db_trad.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_db_trans.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_dummies.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_opthelp_dummies.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_qdbm.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_qdbm_cmpkey.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_sqlite.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_tc.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/datastore_txn_dummies.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/db_lock.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/debug.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/debug.main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/directories.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/error.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fgetsl.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/fgetsl_test-fgetsl.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/find_home.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/find_home.test.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/find_home_tildeexpand.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/find_home_user.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/format.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getopt.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getopt1.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/getopt_long_chk.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/globals.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/iconvert.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/lexer.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/lexer_v3.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-chisq.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-coerce.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-elementary.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-erfc.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-error.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-exp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-expint.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-fdiv.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-gamma.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-gamma_inc.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-infnan.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-log.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-minmax.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-pow_int.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-psi.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-stream.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-trig.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libbf_gsl_a-zeta.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/listsort.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/maint.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/memdebug.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/memstr.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mime.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/msgcounts.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/mxcat.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/panicenv.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/passthrough.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/paths.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/prob.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/qp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/rand_sleep.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/register.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/regression.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/robx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/rstats.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/score.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/sighandler.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/swap_32bit.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/system.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/textblock.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/token.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/transaction.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/trio.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/trionan.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/triostr.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/tunelist.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/uudecode.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/version.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/word.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/wordhash.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/wordhash.main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/wordlists.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/wordlists_base.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xatof.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xatoi.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xcalloc.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xmalloc.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xmem_error.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xmemrchr.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xrealloc.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xstrdup.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xstrlcat.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/xstrlcpy.Po@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'` libbf_gsl_a-chisq.o: ../gsl/cdf/chisq.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-chisq.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-chisq.Tpo -c -o libbf_gsl_a-chisq.o `test -f '../gsl/cdf/chisq.c' || echo '$(srcdir)/'`../gsl/cdf/chisq.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-chisq.Tpo $(DEPDIR)/libbf_gsl_a-chisq.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/cdf/chisq.c' object='libbf_gsl_a-chisq.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-chisq.o `test -f '../gsl/cdf/chisq.c' || echo '$(srcdir)/'`../gsl/cdf/chisq.c libbf_gsl_a-chisq.obj: ../gsl/cdf/chisq.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-chisq.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-chisq.Tpo -c -o libbf_gsl_a-chisq.obj `if test -f '../gsl/cdf/chisq.c'; then $(CYGPATH_W) '../gsl/cdf/chisq.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/cdf/chisq.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-chisq.Tpo $(DEPDIR)/libbf_gsl_a-chisq.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/cdf/chisq.c' object='libbf_gsl_a-chisq.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-chisq.obj `if test -f '../gsl/cdf/chisq.c'; then $(CYGPATH_W) '../gsl/cdf/chisq.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/cdf/chisq.c'; fi` libbf_gsl_a-gamma.o: ../gsl/cdf/gamma.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-gamma.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-gamma.Tpo -c -o libbf_gsl_a-gamma.o `test -f '../gsl/cdf/gamma.c' || echo '$(srcdir)/'`../gsl/cdf/gamma.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-gamma.Tpo $(DEPDIR)/libbf_gsl_a-gamma.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/cdf/gamma.c' object='libbf_gsl_a-gamma.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-gamma.o `test -f '../gsl/cdf/gamma.c' || echo '$(srcdir)/'`../gsl/cdf/gamma.c libbf_gsl_a-gamma.obj: ../gsl/cdf/gamma.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-gamma.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-gamma.Tpo -c -o libbf_gsl_a-gamma.obj `if test -f '../gsl/cdf/gamma.c'; then $(CYGPATH_W) '../gsl/cdf/gamma.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/cdf/gamma.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-gamma.Tpo $(DEPDIR)/libbf_gsl_a-gamma.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/cdf/gamma.c' object='libbf_gsl_a-gamma.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-gamma.obj `if test -f '../gsl/cdf/gamma.c'; then $(CYGPATH_W) '../gsl/cdf/gamma.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/cdf/gamma.c'; fi` libbf_gsl_a-gamma_inc.o: ../gsl/specfunc/gamma_inc.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-gamma_inc.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-gamma_inc.Tpo -c -o libbf_gsl_a-gamma_inc.o `test -f '../gsl/specfunc/gamma_inc.c' || echo '$(srcdir)/'`../gsl/specfunc/gamma_inc.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-gamma_inc.Tpo $(DEPDIR)/libbf_gsl_a-gamma_inc.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/gamma_inc.c' object='libbf_gsl_a-gamma_inc.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-gamma_inc.o `test -f '../gsl/specfunc/gamma_inc.c' || echo '$(srcdir)/'`../gsl/specfunc/gamma_inc.c libbf_gsl_a-gamma_inc.obj: ../gsl/specfunc/gamma_inc.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-gamma_inc.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-gamma_inc.Tpo -c -o libbf_gsl_a-gamma_inc.obj `if test -f '../gsl/specfunc/gamma_inc.c'; then $(CYGPATH_W) '../gsl/specfunc/gamma_inc.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/gamma_inc.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-gamma_inc.Tpo $(DEPDIR)/libbf_gsl_a-gamma_inc.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/gamma_inc.c' object='libbf_gsl_a-gamma_inc.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-gamma_inc.obj `if test -f '../gsl/specfunc/gamma_inc.c'; then $(CYGPATH_W) '../gsl/specfunc/gamma_inc.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/gamma_inc.c'; fi` libbf_gsl_a-error.o: ../gsl/err/error.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-error.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-error.Tpo -c -o libbf_gsl_a-error.o `test -f '../gsl/err/error.c' || echo '$(srcdir)/'`../gsl/err/error.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-error.Tpo $(DEPDIR)/libbf_gsl_a-error.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/err/error.c' object='libbf_gsl_a-error.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-error.o `test -f '../gsl/err/error.c' || echo '$(srcdir)/'`../gsl/err/error.c libbf_gsl_a-error.obj: ../gsl/err/error.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-error.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-error.Tpo -c -o libbf_gsl_a-error.obj `if test -f '../gsl/err/error.c'; then $(CYGPATH_W) '../gsl/err/error.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/err/error.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-error.Tpo $(DEPDIR)/libbf_gsl_a-error.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/err/error.c' object='libbf_gsl_a-error.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-error.obj `if test -f '../gsl/err/error.c'; then $(CYGPATH_W) '../gsl/err/error.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/err/error.c'; fi` libbf_gsl_a-infnan.o: ../gsl/sys/infnan.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-infnan.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-infnan.Tpo -c -o libbf_gsl_a-infnan.o `test -f '../gsl/sys/infnan.c' || echo '$(srcdir)/'`../gsl/sys/infnan.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-infnan.Tpo $(DEPDIR)/libbf_gsl_a-infnan.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/infnan.c' object='libbf_gsl_a-infnan.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-infnan.o `test -f '../gsl/sys/infnan.c' || echo '$(srcdir)/'`../gsl/sys/infnan.c libbf_gsl_a-infnan.obj: ../gsl/sys/infnan.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-infnan.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-infnan.Tpo -c -o libbf_gsl_a-infnan.obj `if test -f '../gsl/sys/infnan.c'; then $(CYGPATH_W) '../gsl/sys/infnan.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/infnan.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-infnan.Tpo $(DEPDIR)/libbf_gsl_a-infnan.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/infnan.c' object='libbf_gsl_a-infnan.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-infnan.obj `if test -f '../gsl/sys/infnan.c'; then $(CYGPATH_W) '../gsl/sys/infnan.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/infnan.c'; fi` libbf_gsl_a-fdiv.o: ../gsl/sys/fdiv.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-fdiv.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-fdiv.Tpo -c -o libbf_gsl_a-fdiv.o `test -f '../gsl/sys/fdiv.c' || echo '$(srcdir)/'`../gsl/sys/fdiv.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-fdiv.Tpo $(DEPDIR)/libbf_gsl_a-fdiv.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/fdiv.c' object='libbf_gsl_a-fdiv.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-fdiv.o `test -f '../gsl/sys/fdiv.c' || echo '$(srcdir)/'`../gsl/sys/fdiv.c libbf_gsl_a-fdiv.obj: ../gsl/sys/fdiv.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-fdiv.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-fdiv.Tpo -c -o libbf_gsl_a-fdiv.obj `if test -f '../gsl/sys/fdiv.c'; then $(CYGPATH_W) '../gsl/sys/fdiv.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/fdiv.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-fdiv.Tpo $(DEPDIR)/libbf_gsl_a-fdiv.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/fdiv.c' object='libbf_gsl_a-fdiv.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-fdiv.obj `if test -f '../gsl/sys/fdiv.c'; then $(CYGPATH_W) '../gsl/sys/fdiv.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/fdiv.c'; fi` libbf_gsl_a-exp.o: ../gsl/specfunc/exp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-exp.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-exp.Tpo -c -o libbf_gsl_a-exp.o `test -f '../gsl/specfunc/exp.c' || echo '$(srcdir)/'`../gsl/specfunc/exp.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-exp.Tpo $(DEPDIR)/libbf_gsl_a-exp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/exp.c' object='libbf_gsl_a-exp.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-exp.o `test -f '../gsl/specfunc/exp.c' || echo '$(srcdir)/'`../gsl/specfunc/exp.c libbf_gsl_a-exp.obj: ../gsl/specfunc/exp.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-exp.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-exp.Tpo -c -o libbf_gsl_a-exp.obj `if test -f '../gsl/specfunc/exp.c'; then $(CYGPATH_W) '../gsl/specfunc/exp.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/exp.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-exp.Tpo $(DEPDIR)/libbf_gsl_a-exp.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/exp.c' object='libbf_gsl_a-exp.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-exp.obj `if test -f '../gsl/specfunc/exp.c'; then $(CYGPATH_W) '../gsl/specfunc/exp.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/exp.c'; fi` libbf_gsl_a-trig.o: ../gsl/specfunc/trig.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-trig.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-trig.Tpo -c -o libbf_gsl_a-trig.o `test -f '../gsl/specfunc/trig.c' || echo '$(srcdir)/'`../gsl/specfunc/trig.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-trig.Tpo $(DEPDIR)/libbf_gsl_a-trig.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/trig.c' object='libbf_gsl_a-trig.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-trig.o `test -f '../gsl/specfunc/trig.c' || echo '$(srcdir)/'`../gsl/specfunc/trig.c libbf_gsl_a-trig.obj: ../gsl/specfunc/trig.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-trig.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-trig.Tpo -c -o libbf_gsl_a-trig.obj `if test -f '../gsl/specfunc/trig.c'; then $(CYGPATH_W) '../gsl/specfunc/trig.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/trig.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-trig.Tpo $(DEPDIR)/libbf_gsl_a-trig.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/trig.c' object='libbf_gsl_a-trig.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-trig.obj `if test -f '../gsl/specfunc/trig.c'; then $(CYGPATH_W) '../gsl/specfunc/trig.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/trig.c'; fi` libbf_gsl_a-log.o: ../gsl/specfunc/log.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-log.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-log.Tpo -c -o libbf_gsl_a-log.o `test -f '../gsl/specfunc/log.c' || echo '$(srcdir)/'`../gsl/specfunc/log.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-log.Tpo $(DEPDIR)/libbf_gsl_a-log.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/log.c' object='libbf_gsl_a-log.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-log.o `test -f '../gsl/specfunc/log.c' || echo '$(srcdir)/'`../gsl/specfunc/log.c libbf_gsl_a-log.obj: ../gsl/specfunc/log.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-log.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-log.Tpo -c -o libbf_gsl_a-log.obj `if test -f '../gsl/specfunc/log.c'; then $(CYGPATH_W) '../gsl/specfunc/log.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/log.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-log.Tpo $(DEPDIR)/libbf_gsl_a-log.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/log.c' object='libbf_gsl_a-log.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-log.obj `if test -f '../gsl/specfunc/log.c'; then $(CYGPATH_W) '../gsl/specfunc/log.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/log.c'; fi` libbf_gsl_a-psi.o: ../gsl/specfunc/psi.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-psi.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-psi.Tpo -c -o libbf_gsl_a-psi.o `test -f '../gsl/specfunc/psi.c' || echo '$(srcdir)/'`../gsl/specfunc/psi.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-psi.Tpo $(DEPDIR)/libbf_gsl_a-psi.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/psi.c' object='libbf_gsl_a-psi.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-psi.o `test -f '../gsl/specfunc/psi.c' || echo '$(srcdir)/'`../gsl/specfunc/psi.c libbf_gsl_a-psi.obj: ../gsl/specfunc/psi.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-psi.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-psi.Tpo -c -o libbf_gsl_a-psi.obj `if test -f '../gsl/specfunc/psi.c'; then $(CYGPATH_W) '../gsl/specfunc/psi.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/psi.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-psi.Tpo $(DEPDIR)/libbf_gsl_a-psi.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/psi.c' object='libbf_gsl_a-psi.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-psi.obj `if test -f '../gsl/specfunc/psi.c'; then $(CYGPATH_W) '../gsl/specfunc/psi.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/psi.c'; fi` libbf_gsl_a-zeta.o: ../gsl/specfunc/zeta.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-zeta.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-zeta.Tpo -c -o libbf_gsl_a-zeta.o `test -f '../gsl/specfunc/zeta.c' || echo '$(srcdir)/'`../gsl/specfunc/zeta.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-zeta.Tpo $(DEPDIR)/libbf_gsl_a-zeta.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/zeta.c' object='libbf_gsl_a-zeta.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-zeta.o `test -f '../gsl/specfunc/zeta.c' || echo '$(srcdir)/'`../gsl/specfunc/zeta.c libbf_gsl_a-zeta.obj: ../gsl/specfunc/zeta.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-zeta.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-zeta.Tpo -c -o libbf_gsl_a-zeta.obj `if test -f '../gsl/specfunc/zeta.c'; then $(CYGPATH_W) '../gsl/specfunc/zeta.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/zeta.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-zeta.Tpo $(DEPDIR)/libbf_gsl_a-zeta.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/zeta.c' object='libbf_gsl_a-zeta.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-zeta.obj `if test -f '../gsl/specfunc/zeta.c'; then $(CYGPATH_W) '../gsl/specfunc/zeta.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/zeta.c'; fi` libbf_gsl_a-elementary.o: ../gsl/specfunc/elementary.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-elementary.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-elementary.Tpo -c -o libbf_gsl_a-elementary.o `test -f '../gsl/specfunc/elementary.c' || echo '$(srcdir)/'`../gsl/specfunc/elementary.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-elementary.Tpo $(DEPDIR)/libbf_gsl_a-elementary.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/elementary.c' object='libbf_gsl_a-elementary.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-elementary.o `test -f '../gsl/specfunc/elementary.c' || echo '$(srcdir)/'`../gsl/specfunc/elementary.c libbf_gsl_a-elementary.obj: ../gsl/specfunc/elementary.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-elementary.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-elementary.Tpo -c -o libbf_gsl_a-elementary.obj `if test -f '../gsl/specfunc/elementary.c'; then $(CYGPATH_W) '../gsl/specfunc/elementary.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/elementary.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-elementary.Tpo $(DEPDIR)/libbf_gsl_a-elementary.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/elementary.c' object='libbf_gsl_a-elementary.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-elementary.obj `if test -f '../gsl/specfunc/elementary.c'; then $(CYGPATH_W) '../gsl/specfunc/elementary.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/elementary.c'; fi` libbf_gsl_a-stream.o: ../gsl/err/stream.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-stream.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-stream.Tpo -c -o libbf_gsl_a-stream.o `test -f '../gsl/err/stream.c' || echo '$(srcdir)/'`../gsl/err/stream.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-stream.Tpo $(DEPDIR)/libbf_gsl_a-stream.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/err/stream.c' object='libbf_gsl_a-stream.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-stream.o `test -f '../gsl/err/stream.c' || echo '$(srcdir)/'`../gsl/err/stream.c libbf_gsl_a-stream.obj: ../gsl/err/stream.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-stream.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-stream.Tpo -c -o libbf_gsl_a-stream.obj `if test -f '../gsl/err/stream.c'; then $(CYGPATH_W) '../gsl/err/stream.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/err/stream.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-stream.Tpo $(DEPDIR)/libbf_gsl_a-stream.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/err/stream.c' object='libbf_gsl_a-stream.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-stream.obj `if test -f '../gsl/err/stream.c'; then $(CYGPATH_W) '../gsl/err/stream.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/err/stream.c'; fi` libbf_gsl_a-expint.o: ../gsl/specfunc/expint.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-expint.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-expint.Tpo -c -o libbf_gsl_a-expint.o `test -f '../gsl/specfunc/expint.c' || echo '$(srcdir)/'`../gsl/specfunc/expint.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-expint.Tpo $(DEPDIR)/libbf_gsl_a-expint.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/expint.c' object='libbf_gsl_a-expint.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-expint.o `test -f '../gsl/specfunc/expint.c' || echo '$(srcdir)/'`../gsl/specfunc/expint.c libbf_gsl_a-expint.obj: ../gsl/specfunc/expint.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-expint.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-expint.Tpo -c -o libbf_gsl_a-expint.obj `if test -f '../gsl/specfunc/expint.c'; then $(CYGPATH_W) '../gsl/specfunc/expint.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/expint.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-expint.Tpo $(DEPDIR)/libbf_gsl_a-expint.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/expint.c' object='libbf_gsl_a-expint.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-expint.obj `if test -f '../gsl/specfunc/expint.c'; then $(CYGPATH_W) '../gsl/specfunc/expint.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/expint.c'; fi` libbf_gsl_a-erfc.o: ../gsl/specfunc/erfc.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-erfc.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-erfc.Tpo -c -o libbf_gsl_a-erfc.o `test -f '../gsl/specfunc/erfc.c' || echo '$(srcdir)/'`../gsl/specfunc/erfc.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-erfc.Tpo $(DEPDIR)/libbf_gsl_a-erfc.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/erfc.c' object='libbf_gsl_a-erfc.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-erfc.o `test -f '../gsl/specfunc/erfc.c' || echo '$(srcdir)/'`../gsl/specfunc/erfc.c libbf_gsl_a-erfc.obj: ../gsl/specfunc/erfc.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-erfc.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-erfc.Tpo -c -o libbf_gsl_a-erfc.obj `if test -f '../gsl/specfunc/erfc.c'; then $(CYGPATH_W) '../gsl/specfunc/erfc.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/erfc.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-erfc.Tpo $(DEPDIR)/libbf_gsl_a-erfc.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/specfunc/erfc.c' object='libbf_gsl_a-erfc.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-erfc.obj `if test -f '../gsl/specfunc/erfc.c'; then $(CYGPATH_W) '../gsl/specfunc/erfc.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/specfunc/erfc.c'; fi` libbf_gsl_a-coerce.o: ../gsl/sys/coerce.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-coerce.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-coerce.Tpo -c -o libbf_gsl_a-coerce.o `test -f '../gsl/sys/coerce.c' || echo '$(srcdir)/'`../gsl/sys/coerce.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-coerce.Tpo $(DEPDIR)/libbf_gsl_a-coerce.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/coerce.c' object='libbf_gsl_a-coerce.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-coerce.o `test -f '../gsl/sys/coerce.c' || echo '$(srcdir)/'`../gsl/sys/coerce.c libbf_gsl_a-coerce.obj: ../gsl/sys/coerce.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-coerce.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-coerce.Tpo -c -o libbf_gsl_a-coerce.obj `if test -f '../gsl/sys/coerce.c'; then $(CYGPATH_W) '../gsl/sys/coerce.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/coerce.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-coerce.Tpo $(DEPDIR)/libbf_gsl_a-coerce.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/coerce.c' object='libbf_gsl_a-coerce.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-coerce.obj `if test -f '../gsl/sys/coerce.c'; then $(CYGPATH_W) '../gsl/sys/coerce.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/coerce.c'; fi` libbf_gsl_a-pow_int.o: ../gsl/sys/pow_int.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-pow_int.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-pow_int.Tpo -c -o libbf_gsl_a-pow_int.o `test -f '../gsl/sys/pow_int.c' || echo '$(srcdir)/'`../gsl/sys/pow_int.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-pow_int.Tpo $(DEPDIR)/libbf_gsl_a-pow_int.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/pow_int.c' object='libbf_gsl_a-pow_int.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-pow_int.o `test -f '../gsl/sys/pow_int.c' || echo '$(srcdir)/'`../gsl/sys/pow_int.c libbf_gsl_a-pow_int.obj: ../gsl/sys/pow_int.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-pow_int.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-pow_int.Tpo -c -o libbf_gsl_a-pow_int.obj `if test -f '../gsl/sys/pow_int.c'; then $(CYGPATH_W) '../gsl/sys/pow_int.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/pow_int.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-pow_int.Tpo $(DEPDIR)/libbf_gsl_a-pow_int.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/pow_int.c' object='libbf_gsl_a-pow_int.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-pow_int.obj `if test -f '../gsl/sys/pow_int.c'; then $(CYGPATH_W) '../gsl/sys/pow_int.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/pow_int.c'; fi` libbf_gsl_a-minmax.o: ../gsl/sys/minmax.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-minmax.o -MD -MP -MF $(DEPDIR)/libbf_gsl_a-minmax.Tpo -c -o libbf_gsl_a-minmax.o `test -f '../gsl/sys/minmax.c' || echo '$(srcdir)/'`../gsl/sys/minmax.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-minmax.Tpo $(DEPDIR)/libbf_gsl_a-minmax.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/minmax.c' object='libbf_gsl_a-minmax.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-minmax.o `test -f '../gsl/sys/minmax.c' || echo '$(srcdir)/'`../gsl/sys/minmax.c libbf_gsl_a-minmax.obj: ../gsl/sys/minmax.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -MT libbf_gsl_a-minmax.obj -MD -MP -MF $(DEPDIR)/libbf_gsl_a-minmax.Tpo -c -o libbf_gsl_a-minmax.obj `if test -f '../gsl/sys/minmax.c'; then $(CYGPATH_W) '../gsl/sys/minmax.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/minmax.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/libbf_gsl_a-minmax.Tpo $(DEPDIR)/libbf_gsl_a-minmax.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gsl/sys/minmax.c' object='libbf_gsl_a-minmax.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libbf_gsl_a_CPPFLAGS) $(CPPFLAGS) $(libbf_gsl_a_CFLAGS) $(CFLAGS) -c -o libbf_gsl_a-minmax.obj `if test -f '../gsl/sys/minmax.c'; then $(CYGPATH_W) '../gsl/sys/minmax.c'; else $(CYGPATH_W) '$(srcdir)/../gsl/sys/minmax.c'; fi` getopt1.o: ../gnugetopt/getopt1.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT getopt1.o -MD -MP -MF $(DEPDIR)/getopt1.Tpo -c -o getopt1.o `test -f '../gnugetopt/getopt1.c' || echo '$(srcdir)/'`../gnugetopt/getopt1.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/getopt1.Tpo $(DEPDIR)/getopt1.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gnugetopt/getopt1.c' object='getopt1.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o getopt1.o `test -f '../gnugetopt/getopt1.c' || echo '$(srcdir)/'`../gnugetopt/getopt1.c getopt1.obj: ../gnugetopt/getopt1.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT getopt1.obj -MD -MP -MF $(DEPDIR)/getopt1.Tpo -c -o getopt1.obj `if test -f '../gnugetopt/getopt1.c'; then $(CYGPATH_W) '../gnugetopt/getopt1.c'; else $(CYGPATH_W) '$(srcdir)/../gnugetopt/getopt1.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/getopt1.Tpo $(DEPDIR)/getopt1.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gnugetopt/getopt1.c' object='getopt1.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o getopt1.obj `if test -f '../gnugetopt/getopt1.c'; then $(CYGPATH_W) '../gnugetopt/getopt1.c'; else $(CYGPATH_W) '$(srcdir)/../gnugetopt/getopt1.c'; fi` getopt.o: ../gnugetopt/getopt.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT getopt.o -MD -MP -MF $(DEPDIR)/getopt.Tpo -c -o getopt.o `test -f '../gnugetopt/getopt.c' || echo '$(srcdir)/'`../gnugetopt/getopt.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/getopt.Tpo $(DEPDIR)/getopt.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gnugetopt/getopt.c' object='getopt.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o getopt.o `test -f '../gnugetopt/getopt.c' || echo '$(srcdir)/'`../gnugetopt/getopt.c getopt.obj: ../gnugetopt/getopt.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT getopt.obj -MD -MP -MF $(DEPDIR)/getopt.Tpo -c -o getopt.obj `if test -f '../gnugetopt/getopt.c'; then $(CYGPATH_W) '../gnugetopt/getopt.c'; else $(CYGPATH_W) '$(srcdir)/../gnugetopt/getopt.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/getopt.Tpo $(DEPDIR)/getopt.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../gnugetopt/getopt.c' object='getopt.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o getopt.obj `if test -f '../gnugetopt/getopt.c'; then $(CYGPATH_W) '../gnugetopt/getopt.c'; else $(CYGPATH_W) '$(srcdir)/../gnugetopt/getopt.c'; fi` triostr.o: ../trio/triostr.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT triostr.o -MD -MP -MF $(DEPDIR)/triostr.Tpo -c -o triostr.o `test -f '../trio/triostr.c' || echo '$(srcdir)/'`../trio/triostr.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/triostr.Tpo $(DEPDIR)/triostr.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/triostr.c' object='triostr.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o triostr.o `test -f '../trio/triostr.c' || echo '$(srcdir)/'`../trio/triostr.c triostr.obj: ../trio/triostr.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT triostr.obj -MD -MP -MF $(DEPDIR)/triostr.Tpo -c -o triostr.obj `if test -f '../trio/triostr.c'; then $(CYGPATH_W) '../trio/triostr.c'; else $(CYGPATH_W) '$(srcdir)/../trio/triostr.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/triostr.Tpo $(DEPDIR)/triostr.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/triostr.c' object='triostr.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o triostr.obj `if test -f '../trio/triostr.c'; then $(CYGPATH_W) '../trio/triostr.c'; else $(CYGPATH_W) '$(srcdir)/../trio/triostr.c'; fi` trio.o: ../trio/trio.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT trio.o -MD -MP -MF $(DEPDIR)/trio.Tpo -c -o trio.o `test -f '../trio/trio.c' || echo '$(srcdir)/'`../trio/trio.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/trio.Tpo $(DEPDIR)/trio.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/trio.c' object='trio.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o trio.o `test -f '../trio/trio.c' || echo '$(srcdir)/'`../trio/trio.c trio.obj: ../trio/trio.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT trio.obj -MD -MP -MF $(DEPDIR)/trio.Tpo -c -o trio.obj `if test -f '../trio/trio.c'; then $(CYGPATH_W) '../trio/trio.c'; else $(CYGPATH_W) '$(srcdir)/../trio/trio.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/trio.Tpo $(DEPDIR)/trio.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/trio.c' object='trio.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o trio.obj `if test -f '../trio/trio.c'; then $(CYGPATH_W) '../trio/trio.c'; else $(CYGPATH_W) '$(srcdir)/../trio/trio.c'; fi` trionan.o: ../trio/trionan.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT trionan.o -MD -MP -MF $(DEPDIR)/trionan.Tpo -c -o trionan.o `test -f '../trio/trionan.c' || echo '$(srcdir)/'`../trio/trionan.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/trionan.Tpo $(DEPDIR)/trionan.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/trionan.c' object='trionan.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o trionan.o `test -f '../trio/trionan.c' || echo '$(srcdir)/'`../trio/trionan.c trionan.obj: ../trio/trionan.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT trionan.obj -MD -MP -MF $(DEPDIR)/trionan.Tpo -c -o trionan.obj `if test -f '../trio/trionan.c'; then $(CYGPATH_W) '../trio/trionan.c'; else $(CYGPATH_W) '$(srcdir)/../trio/trionan.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/trionan.Tpo $(DEPDIR)/trionan.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/trionan.c' object='trionan.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o trionan.obj `if test -f '../trio/trionan.c'; then $(CYGPATH_W) '../trio/trionan.c'; else $(CYGPATH_W) '$(srcdir)/../trio/trionan.c'; fi` fgetsl_test-fgetsl.o: fgetsl.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(fgetsl_test_CFLAGS) $(CFLAGS) -MT fgetsl_test-fgetsl.o -MD -MP -MF $(DEPDIR)/fgetsl_test-fgetsl.Tpo -c -o fgetsl_test-fgetsl.o `test -f 'fgetsl.c' || echo '$(srcdir)/'`fgetsl.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/fgetsl_test-fgetsl.Tpo $(DEPDIR)/fgetsl_test-fgetsl.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='fgetsl.c' object='fgetsl_test-fgetsl.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(fgetsl_test_CFLAGS) $(CFLAGS) -c -o fgetsl_test-fgetsl.o `test -f 'fgetsl.c' || echo '$(srcdir)/'`fgetsl.c fgetsl_test-fgetsl.obj: fgetsl.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(fgetsl_test_CFLAGS) $(CFLAGS) -MT fgetsl_test-fgetsl.obj -MD -MP -MF $(DEPDIR)/fgetsl_test-fgetsl.Tpo -c -o fgetsl_test-fgetsl.obj `if test -f 'fgetsl.c'; then $(CYGPATH_W) 'fgetsl.c'; else $(CYGPATH_W) '$(srcdir)/fgetsl.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/fgetsl_test-fgetsl.Tpo $(DEPDIR)/fgetsl_test-fgetsl.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='fgetsl.c' object='fgetsl_test-fgetsl.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(fgetsl_test_CFLAGS) $(CFLAGS) -c -o fgetsl_test-fgetsl.obj `if test -f 'fgetsl.c'; then $(CYGPATH_W) 'fgetsl.c'; else $(CYGPATH_W) '$(srcdir)/fgetsl.c'; fi` regression.o: ../trio/regression.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT regression.o -MD -MP -MF $(DEPDIR)/regression.Tpo -c -o regression.o `test -f '../trio/regression.c' || echo '$(srcdir)/'`../trio/regression.c @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/regression.Tpo $(DEPDIR)/regression.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/regression.c' object='regression.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o regression.o `test -f '../trio/regression.c' || echo '$(srcdir)/'`../trio/regression.c regression.obj: ../trio/regression.c @am__fastdepCC_TRUE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT regression.obj -MD -MP -MF $(DEPDIR)/regression.Tpo -c -o regression.obj `if test -f '../trio/regression.c'; then $(CYGPATH_W) '../trio/regression.c'; else $(CYGPATH_W) '$(srcdir)/../trio/regression.c'; fi` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/regression.Tpo $(DEPDIR)/regression.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='../trio/regression.c' object='regression.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o regression.obj `if test -f '../trio/regression.c'; then $(CYGPATH_W) '../trio/regression.c'; else $(CYGPATH_W) '$(srcdir)/../trio/regression.c'; fi` .l.c: $(am__skiplex) $(SHELL) $(YLWRAP) $< $(LEX_OUTPUT_ROOT).c $@ -- $(LEXCOMPILE) # This directory's subdirectories are mostly independent; you can cd # into them and run 'make' without going through this Makefile. # To change the values of 'make' variables: instead of editing Makefiles, # (1) if the variable is set in 'config.status', edit 'config.status' # (which will cause the Makefiles to be regenerated when you run 'make'); # (2) otherwise, pass the desired values on the 'make' command line. $(RECURSIVE_TARGETS) $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done cscopelist-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) cscopelist); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" cscopelist: cscopelist-recursive $(HEADERS) $(SOURCES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags check-TESTS: $(TESTS) @failed=0; all=0; xfail=0; xpass=0; skip=0; \ srcdir=$(srcdir); export srcdir; \ list=' $(TESTS) '; \ $(am__tty_colors); \ if test -n "$$list"; then \ for tst in $$list; do \ if test -f ./$$tst; then dir=./; \ elif test -f $$tst; then dir=; \ else dir="$(srcdir)/"; fi; \ if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xpass=`expr $$xpass + 1`; \ failed=`expr $$failed + 1`; \ col=$$red; res=XPASS; \ ;; \ *) \ col=$$grn; res=PASS; \ ;; \ esac; \ elif test $$? -ne 77; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xfail=`expr $$xfail + 1`; \ col=$$lgn; res=XFAIL; \ ;; \ *) \ failed=`expr $$failed + 1`; \ col=$$red; res=FAIL; \ ;; \ esac; \ else \ skip=`expr $$skip + 1`; \ col=$$blu; res=SKIP; \ fi; \ echo "$${col}$$res$${std}: $$tst"; \ done; \ if test "$$all" -eq 1; then \ tests="test"; \ All=""; \ else \ tests="tests"; \ All="All "; \ fi; \ if test "$$failed" -eq 0; then \ if test "$$xfail" -eq 0; then \ banner="$$All$$all $$tests passed"; \ else \ if test "$$xfail" -eq 1; then failures=failure; else failures=failures; fi; \ banner="$$All$$all $$tests behaved as expected ($$xfail expected $$failures)"; \ fi; \ else \ if test "$$xpass" -eq 0; then \ banner="$$failed of $$all $$tests failed"; \ else \ if test "$$xpass" -eq 1; then passes=pass; else passes=passes; fi; \ banner="$$failed of $$all $$tests did not behave as expected ($$xpass unexpected $$passes)"; \ fi; \ fi; \ dashes="$$banner"; \ skipped=""; \ if test "$$skip" -ne 0; then \ if test "$$skip" -eq 1; then \ skipped="($$skip test was not run)"; \ else \ skipped="($$skip tests were not run)"; \ fi; \ test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ report=""; \ if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ dashes=`echo "$$dashes" | sed s/./=/g`; \ if test "$$failed" -eq 0; then \ col="$$grn"; \ else \ col="$$red"; \ fi; \ echo "$${col}$$dashes$${std}"; \ echo "$${col}$$banner$${std}"; \ test -z "$$skipped" || echo "$${col}$$skipped$${std}"; \ test -z "$$report" || echo "$${col}$$report$${std}"; \ echo "$${col}$$dashes$${std}"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done check-am: all-am $(MAKE) $(AM_MAKEFLAGS) $(check_PROGRAMS) $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: $(BUILT_SOURCES) $(MAKE) $(AM_MAKEFLAGS) check-recursive all-am: Makefile $(LIBRARIES) $(PROGRAMS) $(SCRIPTS) config.h installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(bindir)" "$(DESTDIR)$(bindir)" "$(DESTDIR)$(bindir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: $(BUILT_SOURCES) $(MAKE) $(AM_MAKEFLAGS) install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." -rm -f lexer_v3.c -test -z "$(BUILT_SOURCES)" || rm -f $(BUILT_SOURCES) clean: clean-recursive clean-am: clean-binPROGRAMS clean-checkPROGRAMS clean-generic \ clean-noinstLIBRARIES mostlyclean-am distclean: distclean-recursive -rm -rf $(DEPDIR) ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-hdr distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-binPROGRAMS install-binSCRIPTS \ install-dist_binSCRIPTS install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -rf $(DEPDIR) ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-compile mostlyclean-generic pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-binPROGRAMS uninstall-binSCRIPTS \ uninstall-dist_binSCRIPTS .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all check \ check-am cscopelist-recursive ctags-recursive install \ install-am install-strip tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am check check-TESTS check-am clean clean-binPROGRAMS \ clean-checkPROGRAMS clean-generic clean-noinstLIBRARIES \ cscopelist cscopelist-recursive ctags ctags-recursive \ distclean distclean-compile distclean-generic distclean-hdr \ distclean-tags distdir dvi dvi-am html html-am info info-am \ install install-am install-binPROGRAMS install-binSCRIPTS \ install-data install-data-am install-dist_binSCRIPTS \ install-dvi install-dvi-am install-exec install-exec-am \ install-html install-html-am install-info install-info-am \ install-man install-pdf install-pdf-am install-ps \ install-ps-am install-strip installcheck installcheck-am \ installdirs installdirs-am maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic pdf pdf-am ps ps-am tags tags-recursive \ uninstall uninstall-am uninstall-binPROGRAMS \ uninstall-binSCRIPTS uninstall-dist_binSCRIPTS # version.c: version.sh ../configure.ac Makefile.am \ $(version_sources) \ $(bogofilter_SOURCES) \ $(bogolexer_SOURCES) \ $(bogoutil_SOURCES) \ $(bogotune_SOURCES) $(SHELL) $(srcdir)/version.sh $(top_srcdir) >"$@.new" && mv -f "$@.new" "$@" \ || { rm -f "$@" ; false ; } # directories.c: ../config.status rm -f $@ echo "const char *const system_config_file = \"$(SYSCONFDIR)/bogofilter.cf\";" >"$@" \ || { rm -f "$@" ; false ; } # $(datastore_OBJECT): Makefile $(datastore_SOURCE) # bogoupgrade: bogoupgrade.in Makefile rm -f $@ sed 's}[@]PERL@}$(PERL)}' <$(srcdir)/bogoupgrade.in >$@ || rm -f $@ chmod +x bogoupgrade #splint - weak splint.check: $(version_sources) $(bogofilter_SOURCES) $(bogolexer_SOURCES) $(bogoutil_SOURCES) $(bogotune_SOURCES) splint -I. -f $(srcdir)/.lclintrc -weak `for i in \ $(version_sources) \ $(bogofilter_SOURCES) \ $(bogolexer_SOURCES) \ $(bogoutil_SOURCES) \ $(bogotune_SOURCES) ; do echo $(srcdir)/$$i ; done | sort -u | egrep -v "(lexer_v3.l|db_handle_props.h)"` > splint.tmp || : grep ^F splint.tmp wc -l splint.tmp lexer_v3.c: $(srcdir)/lexer_v3.l $(srcdir)/Makefile.in $(LEX) $(srcdir)/lexer_v3.l (echo '/* Include config.h early to avoid _FILE_OFFSET_BITS redefinition on Solaris */'; echo '#include "config.h"' ; sed '/^#/ s|lex.yy\.c|$@|; s/\(accepting rule at line\) %d/\\1 %ld/' lex.yy.c) >$@ @PATCH_FLEX_254_TRUE@ patch $@ < $(srcdir)/patch.lexer.254.txt @PATCH_FLEX_253X_TRUE@ patch $@ < $(srcdir)/patch.lexer.253x.txt rm -f lex.yy.c # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: bogofilter-1.2.4/src/bf_exit.c0000644000175000017500000000070712163572272014424 0ustar sezsez/* $Id: bf_exit.c 6246 2005-09-11 12:51:52Z relson $ */ /***************************************************************************** NAME: bf_exit.c -- bogofilter exit AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include "wordlists.h" void bf_exit(void) { /* Ensure wordlists are closed */ close_wordlists(false); return; } bogofilter-1.2.4/src/wordhash.h0000644000175000017500000000563712163572304014633 0ustar sezsez/* $Id: wordhash.h 6799 2009-02-14 22:10:54Z relson $ */ #ifndef WORDHASH_H #define WORDHASH_H #include "word.h" /* Hash entry. */ typedef struct hashnode_t { /*@dependent@*/ struct hashnode_t *iter_next; /* Next item added to hash. For fast traversal */ struct hashnode_t *next; /* Next item in linked list of items with same hash */ word_t *key; /* word key */ void *data; /* Associated data. To be used by caller. */ } hashnode_t; typedef struct wh_alloc_node { hashnode_t *buf; /*@refs@*/ size_t avail; /*@refs@*/ size_t used; /*@null@*/ struct wh_alloc_node *next; } wh_alloc_node; typedef struct wh_alloc_str { char *buf; /*@refs@*/ size_t avail; /*@refs@*/ size_t used; /*@null@*/ struct wh_alloc_str *next; } wh_alloc_str; typedef /*@null@*/ hashnode_t *hashnode_pt; typedef enum wh_e { WH_NORMAL, WH_PROPS, WH_CNTS } wh_t; typedef struct wordhash_s { /*@null@*/ /*@dependent@*/ wh_t type; /* normal, ordered, props, or cnts */ /*@null@*/ /*@dependent@*/ bool freeable; /*@null@*/ /*@dependent@*/ uint index; /* access index */ /*@null@*/ /*@dependent@*/ uint count; /* count of words */ /*@null@*/ /*@dependent@*/ uint size; /* size of array */ hashnode_pt *bin; /*@null@*/ /*@owned@*/ wh_alloc_node *nodes; /* list of node buffers */ /*@null@*/ wh_alloc_str *strings; /* list of string buffers */ /*@null@*/ /*@dependent@*/ hashnode_t *iter_ptr; /*@null@*/ /*@dependent@*/ hashnode_t *iter_head; /*@null@*/ /*@dependent@*/ hashnode_t *iter_tail; /*@null@*/ /*@dependent@*/ hashnode_t *props; /* array of nodes */ /*@null@*/ /*@dependent@*/ wordcnts_t *cnts; /* array of counts */ } wordhash_t; /*@only@*/ wordhash_t *wordhash_new(void); /*@only@*/ wordhash_t *wordhash_init(wh_t type, uint count); void wordhash_free(/*@only@*/ wordhash_t *); size_t wordhash_count(wordhash_t * h); void wordhash_sort(wordhash_t * h); void wordhash_add(wordhash_t *dst, wordhash_t *src, void (*initializer)(void *)); void wordhash_set_counts(wordhash_t *wh, int good, int bad); void *wordhash_search (const wordhash_t *wh, const word_t *t, uint hash); /* Given h, s, n, search for key s. * If found, return pointer to associated buffer. * Else, insert key and return pointer to allocated buffer of size n. */ /*@observer@*/ void *wordhash_insert(wordhash_t *, word_t *, size_t, void (*)(void *)); /* Starts an iteration over the hash entries */ /*@null@*/ /*@exposed@*/ void *wordhash_first(wordhash_t *); /* returns next entry or NULL if at end */ /*@null@*/ /*@exposed@*/ void *wordhash_next(wordhash_t *); typedef void wh_foreach_t(word_t *token, void *data, void *userdata); void wordhash_foreach(wordhash_t *wh, wh_foreach_t *hook, void *userdata); wordhash_t *convert_propslist_to_countlist(wordhash_t *wh); wordhash_t *convert_wordhash_to_propslist(wordhash_t *wh, wordhash_t *db); /* for bogotune */ void *wordhash_search_memory (const word_t *t); #endif bogofilter-1.2.4/src/wordlists_base.c0000644000175000017500000000616112163572304016024 0ustar sezsez/* $Id: wordlists_base.c 5873 2005-05-06 01:34:01Z relson $ */ #include "common.h" #include "find_home.h" #include "mxcat.h" #include "paths.h" #include "wordlists.h" #include "wordlists_base.h" #include "xmalloc.h" #include "xstrdup.h" /** priority queue of wordlists, ordered by their "override" parameter */ /*@null@*/ wordlist_t* word_lists=NULL; /** Check if wordlist nodes \a a and \a b have the same type, override, * listname and filepath, \returns true if these parameters match in * either list node. */ static bool is_dup_wordlist(wordlist_t *a, wordlist_t *b) { if (a->type != b->type) return false; if (a->override!= b->override) return false; if (strcmp(a->listname, b->listname) != 0) return false; if (a->bfp->filepath != NULL && b->bfp->filepath != NULL && strcmp(a->bfp->filepath, b->bfp->filepath) != 0) return false; return true; } /** Free a wordlist node and return the pointer to the next node */ static wordlist_t *free_wordlistnode(wordlist_t *node) { wordlist_t *next = node->next; xfree(node->listname); bfpath_free(node->bfp); xfree(node); return next; } void wordlists_set_bogohome(void) { wordlist_t *list; /* set up default wordlist, if not yet done */ if (word_lists == NULL) init_wordlist("word", WORDLIST, 0, WL_REGULAR); for (list = word_lists; list != NULL; list = list->next) bfpath_set_bogohome(list->bfp); } void init_wordlist(const char* name, const char *path, int override, WL_TYPE type) { wordlist_t *n = (wordlist_t *)xcalloc(1, sizeof(*n)); wordlist_t *list_ptr; /* initialize list node */ n->listname=xstrdup(name); n->bfp =bfpath_create(path); n->type =type; n->override=override; /* now enqueue according to "override" (priority) */ list_ptr=word_lists; if (list_ptr == NULL || list_ptr->override > override) { /* prepend to list */ n->next=word_lists; word_lists=n; return; } for ( ; ; list_ptr=list_ptr->next) { /* drop duplicates */ if (is_dup_wordlist(n, list_ptr)) { free_wordlistnode(n); return; } /* append to list */ if (list_ptr->next == NULL || list_ptr->next->override > override) { n->next=list_ptr->next; list_ptr->next=n; return; } } } wordlist_t *get_default_wordlist(wordlist_t *list) { for (; list != NULL ; list = list->next) { if (list->type != WL_IGNORE) return list; } /* not found -> abort */ fprintf(stderr, "Can't find default wordlist.\n"); exit(EX_ERROR); } /* setup_wordlists() returns: -1 for error, 0 for success ** ** precedence: (high to low) ** ** command line ** $BOGOFILTER_DIR ** user config file ** site config file ** $HOME */ void free_wordlists() { wordlist_t *list = word_lists; while (list) { list = free_wordlistnode(list); } bogohome_cleanup(); } void display_wordlists(wordlist_t *list, const char *fmt) { for (; list; list = list->next) { printf(fmt, "wordlist"); printf("%s,%s,%s,%d\n", (list->type == WL_REGULAR) ? "r" : "i", list->listname, list->bfp->filepath, list->override); } } bogofilter-1.2.4/src/db_lock.c0000644000175000017500000002425212163572304014376 0ustar sezsez/** \file db_lock.c * \brief Lock handler to detect application crashes * \author Matthias Andree * \date 2004 * * GNU GPL v2 * with optimization ideas by Pavel Kankovsky * * \attention * This code uses signal handlers and must pay extra attention to * reentrancy! * * \par Lock file layout: * the lock file has a list of cells, which can be either 0 or 1. * - 0 means: slot is free * - 1 means: slot in use * - 1 with fcntl lock: process running * - 1 without lock: process quit prematurely, recovery needed * * \sa http://article.gmane.org/gmane.mail.bogofilter.devel/3240\n * http://article.gmane.org/gmane.mail.bogofilter.devel/3260\n * http://article.gmane.org/gmane.mail.bogofilter.devel/3270 */ #include "common.h" #include #include #include #include #include "db_lock.h" #include "debug.h" #include "error.h" #include "globals.h" #include "mxcat.h" #include "system.h" #include "xmalloc.h" #include "xstrdup.h" /** figure out which flag we pass to open() to enforce synchronous data * I/O completion */ #if HAVE_DECL_O_DSYNC static const int syncflag = O_DSYNC; #elif HAVE_DECL_O_SYNC static const int syncflag = O_SYNC; #elif HAVE_DECL_O_FSYNC static const int syncflag = O_FSYNC; #endif /** Type we use for a lock cell. */ typedef char bf_cell_t; /** Periodic check interval in seconds, for set_lock(). */ static const int chk_intval = 30; /** String to append to base directory, for process table file. */ static const char aprt[] = DIRSEP_S "lockfile-p"; /** Size of a cell, must match sizeof(bf_cell_t). */ static const off_t cellsize = 1; /** Offset of our lock cell inside the lock file. */ static off_t lockpos; /** Boolean marker to remember if we hold the lock. */ static int locked; /** File descriptor of the open lock file, or -1 when not open. * The lock file descriptor must be long-lived because fcntl() or * lockf() will immediately release all locks held on a file once we * call close() for the file for the first time no matter how many file * descriptors to the file we still hold, so we cannot use * open-check-close cycles but need to keep the * descriptor open until we'll let go of the locks. */ static int lockfd = -1; /** Constant cell content for cells that are in use. */ static const bf_cell_t cell_inuse = '1'; /** Constant cell content for cells that are \b not in use. */ static const bf_cell_t cell_free = '0'; /** Save area for previous SIGALRM signal handler. */ static struct sigaction oldact; /** Convert the fcntl lock type to a string. * \return constant string to resolve the numeric \a locktype. */ static const char *s_locktype(int locktype) { /* reentrant */ switch (locktype) { case F_UNLCK: return "F_UNLCK"; case F_RDLCK: return "F_RDLCK"; case F_WRLCK: return "F_WRLCK"; default: return "UNKNOWN"; } } /** Checks if the cell in file \a fd at given \a offset is locked. * \return 1 if locked, 0 if unlocked, negative if error */ /* part of the signal handler */ static int check_celllock(int fd, off_t offset) { /* reentrant */ struct flock fl; int r; /* check our own lock explicitly first, F_GETLK will return F_UNLCK * for our own locks because we can demote, upgrade, reset, set our * own locks at will, IOW, F_GETLK will only detect locks set by * other processes */ if (offset == lockpos && locked) return 1; fl.l_type = F_WRLCK; fl.l_whence = SEEK_SET; fl.l_start = offset; fl.l_len = cellsize; r = fcntl(fd, F_GETLK, &fl); if (r) { /* cannot use fprintf for debugging here - isn't reentrant! */ return -1; } /* cannot use fprintf for debugging here - isn't reentrant! */ return fl.l_type == F_UNLCK ? 0 : 1; } /** Fast lock function, uses F_SETLK so does not wait. Not reentrant. */ static int set_celllock(int fd, off_t offset, int locktype) { struct flock fl; int r; fl.l_type = locktype; fl.l_whence = SEEK_SET; fl.l_start = offset; fl.l_len = cellsize; r = fcntl(fd, F_SETLK, &fl); if (DEBUG_DATABASE(2)) fprintf(dbgout, "set_celllock(fd=%d, offset=%ld, type=%d (%s)) = %d%s%s\n", fd, (long)offset, locktype, s_locktype(locktype), r, r < 0 ? ", " : "", r < 0 ? strerror(errno) : ""); return r; } /** initialize the lock file which is presumed to exist and have the * file name \a fn, and which will be deleted in case of trouble. */ static int init_lockfile(const char *fn) { char b[1024]; /* XXX FIXME: make lock size configurable */ int rc = 0; memset(b, (unsigned char)cell_free, sizeof(b)); /* XXX FIXME: only works for char */ if (lseek(lockfd, (off_t)0, SEEK_SET) != (off_t)0) rc = -1; if (rc || sizeof(b) != write(lockfd, b, sizeof(b)) || fsync(lockfd)) { close(lockfd); lockfd = -1; if (fn) unlink(fn); return -1; } return 0; } /** Create a lock file with name \a fn and open modes \a modes to which * O_CREAT and O_EXCL are or'd. Will retry when a race was detected. * \return descriptor of open lock file for success, * -1 for error */ static int create_lockfile(const char *fn, int modes) { char *tmp = NULL; int count=1; do { char buf[50]; snprintf(buf, sizeof(buf), ".%ld.%d", (long)getpid(), count++); if (tmp) free(tmp); tmp = mxcat(fn, buf, NULL); lockfd = open(tmp, modes|O_CREAT|O_EXCL, DS_MODE); /* umask will decide about group writability */ } while (lockfd < 0 && errno == EEXIST); if (lockfd >= 0) { if (init_lockfile(tmp)) { free(tmp); return -1; } if (link(tmp, fn)) { int e = errno; close(lockfd); lockfd = -1; unlink(tmp); free(tmp); errno = e; return -1; } unlink(tmp); } return lockfd; } /** Open and possibly create the lock file. * This will do nothing and flag success if the file is open already * \return 0 for success, -1 for error. */ static int open_lockfile(const char *bogohomedir) { char *fn; int modes = O_RDWR|syncflag; if (lockfd >= 0) return 0; fn = mxcat(bogohomedir, aprt, NULL); do { lockfd = open(fn, modes); if (lockfd < 0 && errno == ENOENT) lockfd = create_lockfile(fn, modes); } while (lockfd < 0 && errno == EEXIST); if (lockfd < 0) { print_error(__FILE__, __LINE__, "open_lockfile: open(%s): %s", fn, strerror(errno)); } else { if (DEBUG_DATABASE(1)) { fprintf(dbgout, "open_lockfile: open(%s) succeeded, fd #%d\n", fn, lockfd); } } xfree(fn); return (lockfd < 0) ? -1 : 0; } /** Close the lock file, releasing all locks. * \return is propagated from the underlying close() function. */ static int close_lockfile(void) { int r = 0; if (lockfd >= 0) { if (DEBUG_DATABASE(1)) fprintf(dbgout, "close_lockfile\n"); r = close(lockfd); lockfd = -1; if (r) { int e = errno; print_error(__FILE__, __LINE__, "close_lockfile: close(%d) failed: %s", lockfd, strerror(errno)); errno = e; } } return r; } /** This function checks if any processes have previously crashed. * \return * - 0 - no zombies * - 1 - zombies * - 2 - file not found * - -1 - other error */ /* part of the signal handler */ /* reentrant */ static int check_zombies(void) { ssize_t r; off_t pos, savepos; bf_cell_t cell; savepos = lseek(lockfd, 0, SEEK_CUR); if (savepos < 0) return -1; if (lseek(lockfd, 0, SEEK_SET) < 0) return -1; for (;;) { pos = lseek(lockfd, 0, SEEK_CUR); r = read(lockfd, &cell, sizeof(cell)); if (r != sizeof(cell)) break; if (cell == cell_inuse && 1 != check_celllock(lockfd, pos)) { if (lseek(lockfd, savepos, SEEK_SET) != savepos) return -1; return 1; } } if (lseek(lockfd, savepos, SEEK_SET) != savepos) return -1; return r == 0 ? 0 : -1; } /** Signal handler, checks if processes have crashed and if so, * writes an error message to STDERR_FILENO and calls _exit(). */ static void check_lock(int unused) { (void)unused; if (0 != check_zombies()) { const char *text = "bogofilter or related application has crashed or directory damaged, aborting.\n"; (void)write(STDERR_FILENO, text, strlen(text)); _exit(EX_ERROR); /* use _exit, not exit, to avoid running the atexit handler that might deadlock */ } alarm(chk_intval); } /** Initialize signal handler and start the timer. \return 0 for * success, -1 for error */ static int init_sig(void) { #ifdef SA_RESTART struct sigaction sa; sigset_t ss; sigemptyset(&ss); sa.sa_handler = check_lock; sa.sa_mask = ss; sa.sa_flags = SA_RESTART; if (sigaction(SIGALRM, &sa, &oldact)) return -1; alarm(chk_intval); #endif return 0; } /** Shut down the timer and restore the previous SIGALRM handler. * \return is propagated from sigaction(). */ static int shut_sig(void) { alarm(0); return sigaction(SIGALRM, &oldact, NULL); } int set_lock(void) { bf_cell_t cell; ssize_t r; if (lseek(lockfd, 0, SEEK_SET) < 0) return -1; for (;;) { lockpos = lseek(lockfd, 0, SEEK_CUR); r = read(lockfd, &cell, sizeof(cell)); if (r != sizeof(cell)) return -1; /* XXX FIXME: retry? */ if (cell == cell_free && 0 == set_celllock(lockfd, lockpos, F_WRLCK)) { if (lseek(lockfd, lockpos, SEEK_SET) >= 0) { r = read(lockfd, &cell, sizeof(cell)); if (r != sizeof(cell) || cell != cell_free) { /* found fresh zombie */ set_celllock(lockfd, lockpos, F_UNLCK); return -2; } if (lseek(lockfd, lockpos, SEEK_SET) < 0) return -1; if (cellsize != write(lockfd, &cell_inuse, cellsize)) return -1; #if 0 /* disabled for now, O_{D,,F}SYNC should handle this for us */ #ifdef HAVE_FDATASYNC if (fdatasync(lockfd)) return -1; #else if (fsync(lockfd)) return -1; #endif #endif init_sig(); locked = 1; return 0; } } } } int clear_lock(void) { shut_sig(); if (lseek(lockfd, lockpos, SEEK_SET) < 0) return -1; locked = 0; if (cellsize != write(lockfd, &cell_free, cellsize)) return -1; if (set_celllock(lockfd, lockpos, F_UNLCK)) return -1; if (close_lockfile()) return -1; return 0; } int init_dbl(const char *bogodir) { return open_lockfile(bogodir) ? -1 : 0; } int needs_recovery(void) { return 0 != check_zombies(); } int clear_lockfile(void) { if (init_lockfile(NULL)) return -1; return 0; } bogofilter-1.2.4/src/error.h0000644000175000017500000000102012163572304014123 0ustar sezsez/* $Id: error.h 1578 2003-02-03 17:09:47Z relson $ */ /***************************************************************************** NAME: error.h -- definitions and prototypes for error.c AUTHOR: David Relson ******************************************************************************/ #ifndef ERROR_H #define ERROR_H extern void print_error( const char *file, unsigned long line, const char *format, ... ) #ifdef __GNUC__ __attribute__ ((format(printf,3,4))) #endif ; #endif bogofilter-1.2.4/src/error.c0000644000175000017500000000237212163572304014131 0ustar sezsez/* $Id: error.c 6486 2006-05-29 14:38:29Z relson $ */ /***************************************************************************** NAME: error.c -- print and log error messages AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #ifdef HAVE_SYSLOG_H #include #endif #include "error.h" #ifdef NEEDTRIO #include "trio.h" #endif void print_error( const char *file, unsigned long line, const char *format, ... ) { char message[256]; size_t l; va_list ap; va_start(ap, format); l = (size_t)vsnprintf(message, sizeof(message), format, ap); if (l >= sizeof(message)) { /* output was truncated, mark truncation */ strcpy(message + sizeof(message) - 4, "..."); } va_end(ap); /* security: replace unprintable characters by underscore "_" */ for (l = 0; l < strlen(message); l++) if (!isprint((unsigned char)message[l])) message[l] = '_'; #if 0 fprintf(stderr, "%s:%lu:", file, line); #endif fprintf(stderr, "%s[%ld]: %s\n", progname, (long)getpid(), message); #ifdef HAVE_SYSLOG_H if (logflag) syslog(LOG_INFO, "%s:%lu: %s", file, line, message ); #endif } bogofilter-1.2.4/src/strlcat.30000644000175000017500000000001612163572304014365 0ustar sezsez.so strlcpy.3 bogofilter-1.2.4/src/xatox.h0000644000175000017500000000240312163572304014143 0ustar sezsez/* $Id: xatox.h 1807 2003-03-04 04:10:38Z m-a $ */ /** \file xatox.h * Header file for xato* string-to-number conversion * functions with simplified error checking. * * \author Matthias Andree * \date 2003 */ #ifndef XATOX_H #define XATOX_H /** atoi variant with error checking. The function tries to parse the * integer string \a in into \a i using the \b strtol(3) ANSI C * function. \a i is only changed on success and retains its original * value otherwise. * * \return * - 0 - failure, out of range or illegal characters, see errno for * details; if errno == 0, then the string contained junk at the end. * - 1 - success */ int xatoi(/*@out@*/ int *i /** the result is stored here */, const char *in /** input string */); /** strtod variant with simplified error checking. The function tries to parse * the floating point string \a in into \a d using the \b strtod(3) ANSI * C function. \a d is only changed on success and retains its original * value otherwise. * * \return * - 0 - failure, out of range or illegal characters, see errno for * details; if errno == 0, then the string contained junk at the end. * - 1 - success */ int xatof(/*@out@*/ double *d /** the result is stored here */, const char *in /** input string */); #endif bogofilter-1.2.4/src/bogoQDBMupgrade.c0000644000175000017500000001111312163572304015733 0ustar sezsez/* $Id: bogoQDBMupgrade.c 6484 2006-05-29 14:28:00Z relson $ */ /* bogoQDBMupgrade.c -- convert QDBM data base from Hash to B+Tree format Copyright (C) 2004 Stefan Bellon 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 */ /* additional error checks and cleanups by Matthias Andree */ #include #include #include #include #include #include #include #include "datastore_qdbm.h" int main(int argc, char *argv[]) { DEPOT *dho; VILLA *dhn; char *new_name; #define TACKON "-new" const char *tackon = TACKON; int ret; int ksiz, dsiz; char *key, *data; if (argc < 2 || argc > 4) { fprintf(stderr, "Usage: %s []\n" " or: %s \n" " defaults to " TACKON "\n" " If is given, is backed up to and\n" " upgraded in place, via .\n", argv[0], argv[0]); exit(EXIT_FAILURE); } dho = dpopen(argv[1], DP_OREADER, 0); if (!dho) { fprintf(stderr, "Couldn't open database '%s': %s\n", argv[1], dperrmsg(dpecode)); exit(EXIT_FAILURE); } if (dpgetflags(dho) & 1) { fprintf(stderr, "Database '%s' is already in B+ tree format.\n", argv[1]); dpclose(dho); exit(EXIT_FAILURE); } if (argc >= 3) { new_name = strdup(argv[2]); } else { new_name = malloc(strlen(argv[1]) + strlen(tackon) + 1); if (new_name) { strcpy(new_name, argv[1]); strcat(new_name, tackon); } } if (!new_name) { fprintf(stderr, "Couldn't allocate memory.\n"); dpclose(dho); exit(EXIT_FAILURE); } if (strcmp(new_name, argv[1]) == 0) { fprintf(stderr, "database and %s must be different files!\n", argc >= 4 ? "tempfile" : "new database"); dpclose(dho); free(new_name); exit(EXIT_FAILURE); } remove(new_name); /* start with a fresh data base */ dhn = vlopen(new_name, VL_OWRITER | VL_OCREAT, cmpkey); if (!dhn) { fprintf(stderr, "Couldn't create database '%s': %s\n", new_name, dperrmsg(dpecode)); dpclose(dho); remove(new_name); free(new_name); exit(EXIT_FAILURE); } ret = dpiterinit(dho); if (ret) { while ((key = dpiternext(dho, &ksiz))) { data = dpget(dho, key, ksiz, 0, -1, &dsiz); if (data) { ret = vlput(dhn, key, ksiz, data, dsiz, VL_DOVER); if (!ret) { int i; fprintf(stderr, "Error writing key '%.*s', value '0x", ksiz, key); for (i = 0 ; i < dsiz ; i++) fprintf(stderr, "%02x", data[i]); fprintf(stderr, "': %s\n", dperrmsg(dpecode)); free(data); free(key); goto barf; } free(data); } else { fprintf(stderr, "Error reading value for key '%.*s': %s\n", ksiz, key, dperrmsg(dpecode)); free(key); goto barf; } free(key); } } else { fprintf(stderr, "Error creating database iterator: %s\n", dperrmsg(dpecode)); goto barf; } if (dpfatalerror(dho)) { fprintf(stderr, "Error: database has fatal error state after reading.\n" "Last error was: %s", dperrmsg(dpecode)); goto barf; } if (!dpclose(dho)) { fprintf(stderr, "Error closing input database: %s\n", dperrmsg(dpecode)); goto barf; } if (!vlclose(dhn)) { fprintf(stderr, "Error closing output database: %s\n", dperrmsg(dpecode)); goto barf; } if (argc >= 4) { /* rename output to input, taking care the file is always * present */ remove(argv[3]); /* ignore errors */ if (link(argv[1], argv[3])) { fprintf(stderr, "Error: cannot link %s to %s: %s\n", argv[1], argv[3], strerror(errno)); free(new_name); exit(EXIT_FAILURE); } if (rename(new_name, argv[1])) { fprintf(stderr, "Error: cannot rename %s to %s: %s\n", new_name, argv[1], strerror(errno)); free(new_name); exit(EXIT_FAILURE); } } exit(EXIT_SUCCESS); /* clean up in case of error */ barf: vlclose(dhn); remove(new_name); free(new_name); dpclose(dho); exit(EXIT_FAILURE); } bogofilter-1.2.4/src/datastore_qdbm.h0000644000175000017500000000034112163572304015770 0ustar sezsez/* $Id: datastore_qdbm.h 4914 2004-11-01 04:49:50Z relson $ */ #ifndef DATASTORE_QDBM_H #define DATASTORE_QDBM_H /** only used by Villa API of QDBM engine */ extern int cmpkey(const char *, int, const char *, int); #endif bogofilter-1.2.4/src/system.h0000644000175000017500000000433712163572304014334 0ustar sezsez/* $Id: system.h 6657 2007-03-22 15:24:47Z m-a $ */ /***************************************************************************** NAME: system.h -- system definitions and prototypes for bogofilter ******************************************************************************/ /* parts were taken from autoconf.info */ #ifndef SYSTEM_H #define SYSTEM_H #ifndef CONFIG_H # define CONFIG_H # include "config.h" #endif #ifndef BFTYPES_H # include "bftypes.h" #endif #ifdef HAVE_UNISTD_H # include #endif #if defined(HAVE_LIMITS_H) # include #elif defined(HAVE_SYS_PARAM_H) # include #endif #if HAVE_SYS_STAT_H # include #endif #include #if HAVE_STRING_H # if !STDC_HEADERS && HAVE_MEMORY_H # include # endif # include #endif #if HAVE_STRINGS_H #include #endif #if !STDC_HEADERS # if !HAVE_STRCHR # define strchr index # endif # if !HAVE_STRRCHR # define strrchr rindex # endif # if !HAVE_MEMCPY # define memcpy(d, s, n) bcopy ((s), (d), (n)) # endif # if !HAVE_MEMMOVE # define memmove(d, s, n) bcopy ((s), (d), (n)) # endif #endif #ifndef HAVE_STRLCPY size_t strlcpy(/*@out@*/ char *dst, const char *src, size_t size); #endif #ifndef HAVE_STRLCAT size_t strlcat(/*@out@*/ char *dst, const char *src, size_t size); #endif #if TIME_WITH_SYS_TIME # include # include #else # if HAVE_SYS_TIME_H # include # else # include # endif #endif #if HAVE_FCNTL_H #include #endif /* dirent.h surroundings */ /* from autoconf.info */ #if HAVE_DIRENT_H # include # define NAMLEN(dirent) strlen((dirent)->d_name) #else # define dirent direct # define NAMLEN(dirent) (dirent)->d_namlen # if HAVE_SYS_NDIR_H # include # endif # if HAVE_SYS_DIR_H # include # endif # if HAVE_NDIR_H # include # endif #endif #ifdef __DGUX__ #undef EX_OK #endif /* Ignore __attribute__ if not using GNU CC */ #if !defined(__GNUC__) && !defined(__attribute__) #define __attribute__(a) #endif /* system.c - function prototypes */ extern bool bf_abspath(const char *path); extern int bf_mkdir(const char *path, mode_t mode); extern void bf_sleep(long delay); #endif /* SYSTEM_H */ bogofilter-1.2.4/src/word.c0000644000175000017500000000370612163572304013755 0ustar sezsez/* $Id: word.c 6976 2012-12-02 20:49:49Z relson $ */ /** \file word.c * support for strings of arbitrary content, implementation * * \author David Relson */ #include "common.h" #include #include "word.h" #include "xmalloc.h" /* Function Definitions */ word_t *word_news(const char *cstring) { return word_new((const byte *)cstring, strlen(cstring)); } word_t *word_new(const byte *text, uint len) { /* to lessen malloc/free calls, allocate struct and data in one block */ word_t *self = xmalloc(sizeof(word_t)+len+1); self->leng = len; self->u.text = (byte *)((char *)self+sizeof(word_t)); if (text != NULL) { memcpy(self->u.text, text, len); self->u.text[len] = '\0'; /* ensure nul termination */ } else { self->u.text[0] = '\0'; /* ditto for text == NULL */ } return self; } int word_cmp(const word_t *w1, const word_t *w2) { uint l = min(w1->leng, w2->leng); int r = memcmp((const char *)w1->u.text, (const char *)w2->u.text, l); if (r) return r; if (w1->leng > w2->leng) return 1; if (w1->leng < w2->leng) return -1; return 0; } int word_cmps(const word_t *w, const char *s) { word_t w2; w2.leng = strlen(s); w2.u.ctext = s; return word_cmp(w, &w2); } word_t *word_concat(const word_t *w1, const word_t *w2) { uint len = w1->leng + w2->leng; word_t *ans = word_new(NULL, len); memcpy(ans->u.text, w1->u.text, w1->leng); memcpy(ans->u.text+w1->leng, w2->u.text, w2->leng); Z(ans->u.text[ans->leng]); /* for easier debugging - removable */ return ans; } void word_puts(const word_t *word, uint width, FILE *fp) { /* width = 0 - output all of the word ** > 0 - use 'width' as count, ** blank fill if 'width' < length */ uint l = (width == 0) ? word->leng : min(width, word->leng); (void) fwrite(word->u.text, 1, l, fp); if (l < width) (void) fprintf(fp, "%*s", (int)(width - l), " "); } bogofilter-1.2.4/src/memstr.c0000644000175000017500000000114712163572304014306 0ustar sezsez/* $Id: memstr.c 6774 2009-02-01 02:29:27Z relson $ */ /** \file memstr.c * find a C string in memory * \author Matthias Andree * \date 2004 * GNU General Public License v2 */ #include "memstr.h" /** find the C string \a needle in the \a n bytes starting with \a hay, * \return 0 if no match found, the pointer to the first byte otherwise. */ void *memstr(void *hay, size_t n, const char *needle) { unsigned char *haystack = hay; size_t l = strlen(needle); while (n >= l) { if (0 == memcmp(haystack, needle, l)) return (void *)haystack; haystack++; n--; } return (void *)0; } bogofilter-1.2.4/src/datastore.h0000644000175000017500000003032412163572304014771 0ustar sezsez/* $Id: datastore.h 6895 2010-03-23 17:48:52Z m-a $ */ /***************************************************************************** NAME: datastore.h - API for bogofilter datastore. The idea here is to make bogofilter independent of the database system used to store words. The interface specified by this file determines the entire interaction between bogofilter and the database. Writing a new database backend merely requires the implementation of the interface. AUTHORS: Gyepi Sam 2002 - 2003 Matthias Andree 2003 ******************************************************************************/ #ifndef DATASTORE_H #define DATASTORE_H #include "common.h" #include #ifdef ENABLE_DB_DATASTORE /* if Berkeley DB */ #include #endif #include "paths.h" #include "word.h" extern YYYYMMDD today; /* date as YYYYMMDD */ /** Name of the special token that counts the spam and ham messages * in the data base. */ #define MSG_COUNT ".MSG_COUNT" /** Datastore handle type ** - used to communicate between datastore layer and database layer ** - known to program layer as a void* */ typedef struct { /** database handle from db_open() */ void *dbh; /** tracks endianness */ bool is_swapped; } dsh_t; /** Datastore value type, used to communicate between program layer and * datastore layer. */ typedef struct { /** spam and ham counts */ u_int32_t count[IX_SIZE]; /** time stamp */ u_int32_t date; } dsv_t; #define spamcount count[IX_SPAM] #define goodcount count[IX_GOOD] /** Status value used when a key is not found in the data base. */ #define DS_NOTFOUND (-1) /** Status value when the transaction was aborted to resolve a deadlock * and should be retried. */ #define DS_ABORT_RETRY (-2) /** Macro that clamps its argument to INT_MAX and casts it to int. */ #define CLAMP_INT_MAX(i) ((int)min(INT_MAX, (i))) /** Database value type, used to communicate between datastore layer and * database layer. */ typedef struct { /** address of buffer */ void *data; /** number of data bytes */ u_int32_t leng; } dbv_t; #ifndef ENABLE_DB_DATASTORE /* if not Berkeley DB */ typedef void DB; typedef void DB_ENV; typedef void DB_TXN; #endif /** type to keep track of database environments we have opened. */ typedef struct { int magic; DB_ENV *dbe; /* stores the environment handle */ char *directory; /* stores the home directory for this environment */ } dbe_t; /* public -- used in datastore.c */ typedef int dsm_i_pv (void *vhandle); /* private -- used in datastore_db_*.c */ typedef int dsm_i_i (int open_mode); typedef int dsm_i_pnvi (DB_ENV *dbe, int ret); typedef int dsm_i_pvi (void *handle, int open_mode); typedef int dsm_i_v (void); typedef void dsm_v_pc (const char *str); typedef void dsm_v_pbe (dbe_t *env); typedef void dsm_v_pnv (DB_ENV *dbe); typedef void dsm_v_pvuiui (void *vhandle, u_int32_t numlocks, u_int32_t numobjs); typedef const char *dsm_pc_pc (const char *db_file); typedef ex_t dsm_x_ppbb (bfpath *bfp, bool, bool); typedef ex_t dsm_x_pnvpp (DB_ENV *dbe, bfpath *bfp); typedef dbe_t *dsm_pbe_pp (bfpath *bfp); typedef ex_t dsm_x_pp (bfpath *bfp); typedef u_int32_t dsm_u_pp (bfpath *bfp); typedef DB_ENV *dsm_pnv_pp (bfpath *bfp); typedef DB_ENV *dsm_pnv_pbe (dbe_t *env); typedef ex_t dsm_x_ppsi (bfpath *bfp, int argc, char **argv); /** Datastore methods type, used by datastore/database layers to switch * implementations after detection of database type. */ typedef struct { /* public -- used in datastore.c */ dsm_i_pv *dsm_begin; dsm_i_pv *dsm_abort; dsm_i_pv *dsm_commit; /* private -- used in datastore_db_*.c */ dsm_pbe_pp *dsm_env_init; dsm_v_pbe *dsm_cleanup; dsm_v_pbe *dsm_cleanup_lite; dsm_pnv_pbe *dsm_get_env_dbe; dsm_pc_pc *dsm_database_name; dsm_pnv_pp *dsm_recover_open; /**< exits on failure */ dsm_i_v *dsm_auto_commit_flags; dsm_i_i *dsm_get_rmw_flag; dsm_i_pvi *dsm_lock; dsm_x_pnvpp *dsm_common_close; dsm_i_pnvi *dsm_sync; dsm_v_pnv *dsm_log_flush; dsm_u_pp *dsm_pagesize; dsm_x_pp *dsm_checkpoint; dsm_x_pp *dsm_purgelogs; dsm_x_ppbb *dsm_recover; dsm_x_pp *dsm_remove; dsm_x_pp *dsm_verify; dsm_x_ppsi *dsm_list_logfiles; dsm_u_pp *dsm_leafpages; } dsm_t; extern dsm_t *dsm; /** Type of the callback function that ds_foreach calls. */ typedef int ds_foreach_t( /** current token that ds_foreach is looking at */ word_t *token, /** data store value */ dsv_t *data, /** unaltered value from ds_foreach call. */ void *userdata); /** Iterate over all records in data base and call \p hook for each item. * \p userdata is passed through to the hook function unaltered. */ extern ex_t ds_foreach(void *vhandle /** data store handle */, ds_foreach_t *hook /** callback function */, void *userdata /** opaque data that is passed to the callback function unaltered */); /** Wrapper for ds_foreach that opens and closes file */ extern ex_t ds_oper(void *dbenv, /**< parent environment */ bfpath *bfp, /**< path to database file */ dbmode_t open_mode, /**< open mode, DS_READ or DS_WRITE */ ds_foreach_t *hook, /**< function for actual operations */ void *userdata /**< user data for \a hook */); /** Initialize database, open and lock files, etc. * params: char * path to database file, char * name of database * \return opaque pointer to database handle, which must be saved and * passed as the first parameter in all subsequent database function calls. */ /*@only@*/ /*@null@*/ extern void *ds_open(void *dbe, /**< parent environment */ bfpath *bfp, /**< path to database file */ dbmode_t open_mode /**< open mode, DS_READ or DS_WRITE */); /** Close file and clean up. */ extern void ds_close(/*@only@*/ void *vhandle); /** Flush pending writes to disk */ extern void ds_flush(void *vhandle); /** Global initialization of datastore layer. Implies call to \a dsm_init. */ extern void *ds_init(bfpath *bfp); /** Cleanup storage allocation of datastore layer. After calling this, * datastore access is no longer permitted. */ extern void ds_cleanup(void *); /** Initialize datastore handle. */ dsh_t *dsh_init(void *dbh); /* database handle from db_open() */ /** Free data store handle that must not be used after calling this * function. */ void dsh_free(void *vhandle); /** Retrieve the value associated with a given word in a list. * \return zero if the word does not exist in the database. Front-end */ extern int ds_read (void *vhandle, const word_t *word, /*@out@*/ dsv_t *val); /** Retrieve the value associated with a given word in a list. * \return zero if the word does not exist in the database. Implementation */ extern int ds_get_dbvalue(void *vhandle, const dbv_t *token, /*@out@*/ dbv_t *val); /** Delete the key. */ extern int ds_delete(void *vhandle, const word_t *word); /** Set the value associated with a given word in a list. Front end. */ extern int ds_write (void *vhandle, const word_t *word, dsv_t *val); /** Set the value associated with a given word in a list. Implementation. */ extern int ds_set_dbvalue(void *vhandle, const dbv_t *token, dbv_t *val); /** Update the value associated with a given word in a list. */ extern void ds_updvalues(void *vhandle, const dbv_t *token, const dbv_t *updval); /** Get the database message count. */ extern int ds_get_msgcounts(void *vhandle, dsv_t *val); /** Set the database message count. */ extern int ds_set_msgcounts(void *vhandle, dsv_t *val); /** Get the parent environment. */ extern void *ds_get_dbenv(void *vhandle); /* transactional code */ /** Start a transaction for the data store identified by vhandle. * All data base operations, including reading, must be "opened" by * ds_txn_begin and must be "closed" by either ds_txn_commit (to keep * changes) or ds_txn_abort (to discard changes made since the last * ds_txn_begin for the data base). Application or system crash will * lose any changes made since ds_txn_begin that have not been * acknowledged by successful ds_txn_commit(). * \returns * - DST_OK for success. It is OK to proceed in data base access. * - DST_TEMPFAIL for problem. It is unknown whether this actually * happens. You must not touch the data base. * - DST_FAILURE for problem. You must not touch the data base. */ extern int ds_txn_begin(void *vhandle); /** Commit a transaction, keeping changes. As with any transactional * data base, concurrent updates to the same pages in the data base can * cause a deadlock of the writers. The datastore_xxx.c code will handle * the detection for you, in a way that it aborts as many transactions * until one can proceed. The aborted transactions will return * DST_TEMPFAIL and must be retried. No data base access must happen * after this call until the next ds_txn_begin(). * \returns * - DST_OK to signify that the data has made it to the disk * (which means nothing if the disk's write cache is enabled and the * kernel has no means of synchronizing the cache - this is unknown for * most kernels) * - DST_TEMPFAIL when a transaction has been aborted by the deadlock * detector and must be retried * - DST_FAILURE when a permanent error has occurred that cannot be * recovered from by the application (for instance, because corruption * has occurred and needs to be recovered). */ extern int ds_txn_commit(void *vhandle); /** Abort a transaction, discarding all changes since the previous * ds_txn_begin(). Changes are rolled back as though the transaction had * never been tried. No data base access must happen after this call * until the next ds_txn_begin(). * \returns * - DST_OK for success. * - DST_TEMPFAIL for failure. It is uncertain if this actually happens. * - DST_FAILURE for failure. The application cannot continue. */ extern int ds_txn_abort(void *vhandle); /** Successful return from ds_txn_* operation. */ #define DST_OK (0) /** Temporary failure return from ds_txn_* operation, the application * should retry the failed data base transaction. */ #define DST_TEMPFAIL (1) /** Permanent failure return from ds_txn_* operation, the application * should clean up and exit. */ #define DST_FAILURE (2) /** Get the database version */ extern int ds_get_wordlist_version(void *vhandle, dsv_t *val); /** set the database version */ extern int ds_set_wordlist_version(void *vhandle, dsv_t *val); /** Get the database encoding */ extern int ds_get_wordlist_encoding(void *vhandle, dsv_t *val); /** set the database encoding */ extern int ds_set_wordlist_encoding(void *vhandle, int enc); /** Get the current process ID. */ extern unsigned long ds_handle_pid(void *vhandle); /** Get the database filename. */ extern char *ds_handle_filename(void *vhandle); /** Locks and unlocks file descriptor. */ extern int ds_lock(int fd, int cmd, short int type); /** Returns version string. */ extern const char *ds_version_str(void); /** Runs forced recovery on data base */ extern ex_t ds_recover(bfpath *bfp, bool catastrophic); /** Remove environment in given directory, \return EX_OK or EX_ERROR */ extern ex_t ds_remove(bfpath *bfp); /** Verify given database */ extern ex_t ds_verify(bfpath *bfp); /** Return leaf page count of given database, \return 0xffffffff for error, * 0 if unknown. */ extern u_int32_t ds_leafpages(bfpath *bfp); /** Return page size of given database, \return 0xffffffff for error, 0 for * variable sized pages or unpaged datastores. */ extern u_int32_t ds_pagesize(bfpath *bfp); /** Remove inactive log files in given directory, \return EX_OK. */ extern ex_t ds_purgelogs(bfpath *bfp); /** Run checkpoint once */ extern ex_t ds_checkpoint(bfpath *bfp); /** datastore backends must provide this initializing function */ extern void dsm_init(bfpath *bfp); /** list log files, remaining arguments are backend specific */ extern ex_t ds_list_logfiles(bfpath *bfp, int argc, char **argv); /** parse bogofilter option * \return true if an option was recognized, false otherwise */ extern bool dsm_options_bogofilter(int option, const char *name, const char *val); /** parse bogoutil option * \return true if an option was recognized, false otherwise */ extern bool dsm_options_bogoutil(int option, cmd_t *flag, int *count, const char **ds_file, const char *name, const char *val); #endif bogofilter-1.2.4/src/xmemrchr.h0000644000175000017500000000025312163572272014632 0ustar sezsez/* $Id: xmemrchr.h 1605 2003-02-06 17:19:46Z relson $ */ #ifndef XMEMRCHR_H #define XMEMRCHR_H #include "common.h" void *xmemrchr(void *v, byte b, size_t len); #endif bogofilter-1.2.4/src/find_home_user.c0000644000175000017500000000223212163572304015761 0ustar sezsez/** \file find_home_user.c figure out the home dir of given user */ /* (C) 2002,2003,2006 by Matthias Andree * (C) 2003 by David Relson * * This program is free software; you can redistribute it and/or modify * it under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * 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, it is in the file named * COPYING. */ /* $Id: find_home_user.c 6541 2006-07-08 14:56:40Z m-a $ */ #include "system.h" #include #include #include #include "find_home.h" /** This function will try to figure out the home directory of the user * whose name is given as argument. * * This function returns NULL in case of failure. */ const char *find_home_user(const char *username) { struct passwd *pw; pw = getpwnam(username); if (pw != NULL) { return pw -> pw_dir; } return NULL; } bogofilter-1.2.4/src/base64.c0000644000175000017500000000406112163572304014061 0ustar sezsez/* $Id: base64.c 6906 2010-07-03 08:39:44Z m-a $ */ /** \file base64.c * decode base64 encoded text * \author David Relson * \author Matthias Andree * \date 2003-2005 */ #include "common.h" #include "base64.h" /* Local Variables */ /* rfc2047 - BASE64 [0-9a-zA-Z/+=]+ */ static byte base64_charset[] = { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" }; static byte base64_xlate[256]; static const byte base64_invalid = 0x7F; /* Function Definitions */ uint base64_decode(word_t *word) { uint count = 0; uint size = word->leng; byte *s = word->u.text; /* src */ byte *d = word->u.text; /* dst */ if (!base64_validate(word)) return size; while (size) { int i; int shorten = 0; unsigned long v = 0; while (size && (*s == '\r' || *s == '\n')) { size--; s++; } if (size < 4) break; for (i = 0; i < 4 && (uint)i < size; i += 1) { byte c = *s++; byte t = base64_xlate[c]; if (t == base64_invalid) { shorten = 4 - i; i = 4; v >>= (shorten * 2); if (shorten == 2) s++; break; } v = v << 6 | t; } size -= i; for (i = 2 - shorten; i >= 0; i -= 1) { byte c = (byte) v & 0xFF; d[i] = c; v = v >> 8; } if(shorten != 4) { d += 3 - shorten; count += 3 - shorten; } } /* XXX do we need this NUL byte? */ if (word->leng) *d = (byte) '\0'; /* safe, base64 is always longer than original */ return count; } static void base64_init(void) { size_t i; static bool first = true; if (!first) return; first = false; for (i = 0; i < sizeof(base64_charset); i += 1) { byte c = base64_charset[i]; base64_xlate[c] = (byte) i; } base64_xlate['='] = base64_invalid; return; } bool base64_validate(const word_t *word) { uint i; base64_init(); for (i = 0; i < word->leng; i += 1) { byte b = word->u.text[i]; byte v = base64_xlate[b]; if (v == 0 && b != 'A' && b != '\n' && b != '\r') return false; } return true; } bogofilter-1.2.4/src/bf_tar0000644000175000017500000000326712163573322014021 0ustar sezsez#! /bin/sh # This file dumps a bogofilter to standard output in POSIX-tar format. # # Requires: pax # # (C) 2004 by Matthias Andree # GNU GPL v2. # $Id: bf_tar.in 6750 2008-10-15 23:18:45Z clint $ set -e : ${BOGOFILTER:=bogofilter} : ${BOGOUTIL:=bogoutil} REMOVEBEF=0 REMOVEAFT=0 while [ "$1" ] ; do case "$1" in -r) REMOVEAFT=1 ;; -R) REMOVEBEF=1 ;; --) shift ; break ;; -*) echo >&2 "`basename $0`: unknown option $1" ; exit 1 ;; *) break; esac shift done if [ $# -ne 1 ] ; then echo >&2 "Usage: `basename $0` [options] bogodir > outfile.tar" echo >&2 " or: `basename $0` [options] bogodir | gzip -c >outfile.tar.gz" echo >&2 'Options are:' echo >&2 ' -r - remove inactive log files after archiving' echo >&2 ' -R - remove inactive log files before archiving (use with caution)' exit 1 fi # we could write $1 for the moment being as we demand exactly this # argument above [ $# -ne 1 ] BOGOHOME=${1:-.} if [ ! -d "$BOGOHOME" ] ; then echo $BOGOHOME must be a directory, not a file exit 1 fi nukelogs() { $BOGOUTIL --db-prune="$BOGOHOME" } # remove if requested if [ $REMOVEBEF -eq 1 ] ; then nukelogs else $BOGOUTIL --db-checkpoint="$BOGOHOME" fi # database first, then the logs. # the log MUST be newer than the database, if it's the other way around, # that state will not be recoverable! # # pax options: -w: write archive, -v: verbosely, -x ustar: pick tar format. ( c="${BOGOHOME}/DB_CONFIG" if [ -f "$c" ] ; then echo "$c" ; fi $BOGOFILTER -QQ -d "$BOGOHOME" | grep '^wordlist ' | cut -f3 -d, $BOGOUTIL --db-list-logfiles="$BOGOHOME" all ) | pax -w -v -x ustar # remove if requested if [ $REMOVEAFT -eq 1 ] ; then nukelogs ; fi bogofilter-1.2.4/src/mxcat.c0000644000175000017500000000110212163572272014106 0ustar sezsez/* memory allocating, unlimited strcat * (C) 2004 by Matthias Andree, GNU GPL v2 */ #include "mxcat.h" #include "system.h" #include "xmalloc.h" #include #include char *mxcat(const char *first, ...) { va_list ap; size_t s; char *t, *r; va_start(ap, first); s = strlen(first); while ((t = va_arg(ap, char *))) { s += strlen(t); } va_end(ap); s++; r = xmalloc(s); va_start(ap, first); strlcpy(r, first, s); while ((t = va_arg(ap, char *))) { strlcat(r, t, s); } va_end(ap); return r; } bogofilter-1.2.4/src/mime.c0000644000175000017500000003513212163572304013727 0ustar sezsez/* $Id: mime.c 6914 2010-07-05 15:22:00Z m-a $ */ /** * \file mime.c - lexer MIME processing * * NOTES: * * RFC2045: * Header fields occur in at least two contexts: *-# As part of a regular RFC 822 message header. *-# In a MIME body part header within a multipart construct. * * \author Matthias Andree * \author David Relson * \author Gyepi Sam */ #include "common.h" #include #include #include #include "base64.h" #include "lexer.h" #include "mime.h" #include "qp.h" #include "uudecode.h" #include "xstrdup.h" #include "xmalloc.h" /* Global Variables */ mime_t *msg_state = NULL; static mime_t *mime_stack_top = NULL; static mime_t *mime_stack_bot = NULL; /** MIME media types (or prefixes thereof) that we detect. */ static const struct type_s { enum mimetype type; /**< internal representation of MIME type */ const char *name; /**< prefix of MIME type to match */ } mime_type_table[] = { { MIME_TEXT_HTML, "text/html" }, { MIME_TEXT_PLAIN, "text/plain" }, { MIME_TEXT, "text" }, /* NON-COMPLIANT; should be "text/"*/ { MIME_APPLICATION, "application/" }, { MIME_MESSAGE, "message/" }, { MIME_MULTIPART, "multipart/" }, { MIME_IMAGE, "image/" }, { MIME_AUDIO, "audio/" }, { MIME_VIDEO, "video/" }, }; /** MIME encodings that we detect. */ static const struct encoding_s { enum mimeencoding encoding; /**< internal representation of encoding */ const char *name; /**< encoding name to match */ } mime_encoding_table[] = { { MIME_7BIT, "7BIT" }, { MIME_8BIT, "8BIT" }, { MIME_BINARY, "BINARY" }, { MIME_QP, "QUOTED-PRINTABLE" }, { MIME_BASE64, "BASE64" }, { MIME_UUENCODE, "X-UUENCODE" }, }; /** MIME content dispositions that we detect. */ static const struct disposition_s { enum mimedisposition disposition; /**< internal representation of disposition */ const char *name; /**< disposition name to match */ } mime_disposition_table[] = { { MIME_INLINE, "inline" }, { MIME_ATTACHMENT, "attachment" }, }; /** properties of a MIME boundary */ typedef struct { bool is_valid; /**< valid boundary of an enclosing MIME container */ bool is_final; /**< boundary is a closing one (two trailing dashes) */ int depth; /**< stack level the boundary was found at */ } boundary_t; /* Function Prototypes */ static void mime_disposition(word_t * text); static void mime_encoding(word_t * text); static void mime_type(word_t * text); static void mime_push(mime_t * parent); static void mime_pop(void); /* Function Definitions */ #if 0 /* Unused */ const char *mime_type_name(enum mimetype type) { size_t i; for (i = 0; i < COUNTOF(mime_type_table); i += 1) { struct type_s *typ = mime_type_table + i; if (typ->type == type) return typ->name; } return "unknown"; } #endif static const char *str_mime_type(enum mimetype m) { switch (m) { case MIME_TYPE_UNKNOWN: return "unknown"; case MIME_MULTIPART: return "multipart/*"; case MIME_MESSAGE: return "message/*"; case MIME_TEXT: return "text/*"; case MIME_TEXT_PLAIN: return "text/plain"; case MIME_TEXT_HTML: return "text/html"; case MIME_APPLICATION: return "application/*"; case MIME_IMAGE: return "image/*"; case MIME_AUDIO: return "audio/*"; case MIME_VIDEO: return "video/*"; } return "INTERNAL_ERROR"; } static const char *str_mime_enc(enum mimeencoding e) { switch (e) { case MIME_ENCODING_UNKNOWN: return "unknown"; case MIME_7BIT: return "7bit"; case MIME_8BIT: return "8bit"; case MIME_BINARY: return "binary"; case MIME_QP: return "quoted-printable"; case MIME_BASE64: return "base64"; case MIME_UUENCODE: return "x-uuencode"; } return "INTERNAL_ERROR"; } /** Dump the current MIME boundary stack. For debugging. */ #ifndef NODEBUG static void mime_stack_dump(void) { mime_t *ptr; fprintf(dbgout, "**** MIME stack is:\n"); for (ptr = mime_stack_top; ptr != NULL; ptr = ptr->child) { fprintf(dbgout, "**** %3d type: %-16s enc: %-16s chr: %-8.8s bnd: %s\n", ptr->depth, str_mime_type(ptr->mime_type), str_mime_enc(ptr->mime_encoding), ptr->charset, ptr->boundary ? ptr->boundary : "NIL"); } } #endif static void mime_init(mime_t * parent) { msg_state->mime_type = MIME_TEXT; msg_state->mime_encoding = MIME_7BIT; msg_state->boundary = NULL; msg_state->boundary_len = 0; msg_state->parent = parent; msg_state->charset = xstrdup("US-ASCII"); msg_state->depth = (parent == NULL) ? 0 : msg_state->parent->depth + 1; msg_state->child = NULL; msg_state->mime_dont_decode = false; msg_state->mime_disposition = MIME_DISPOSITION_UNKNOWN; if (parent) parent->child = msg_state; return; } static void mime_free(mime_t * t) { if (t == NULL) return; if (mime_stack_bot == t) mime_stack_bot = t->parent; if (mime_stack_top == t) mime_stack_top = NULL; if (t->boundary) { xfree(t->boundary); t->boundary = NULL; } if (t->charset) { xfree(t->charset); t->charset = NULL; } t->parent = NULL; xfree(t); } void mime_cleanup() { if (msg_state == NULL) return; while (mime_stack_top->parent) mime_pop(); mime_pop(); msg_state = NULL; mime_stack_top = NULL; mime_stack_bot = NULL; } static void mime_push(mime_t * parent) { msg_state = (mime_t *) xmalloc(sizeof(mime_t)); if (parent == NULL) mime_stack_top = msg_state; mime_stack_bot = msg_state; mime_init(parent); if (DEBUG_MIME(1)) fprintf(dbgout, "*** mime_push. stackp: %d\n", msg_state->depth); if (DEBUG_MIME(2)) mime_stack_dump(); } static void mime_pop(void) { if (DEBUG_MIME(1)) fprintf(dbgout, "*** mime_pop. stackp: %d\n", msg_state->depth); if (msg_state) { mime_t *parent = msg_state->parent; mime_free(msg_state); msg_state = parent; if (msg_state) msg_state->child = NULL; } else { fprintf(stderr, "Attempt to underflow mime stack\n"); } if (DEBUG_MIME(2)) mime_stack_dump(); } /** * check if the media type of the MIME entity \a m is a container type * (message/anything or multipart/anything) */ static bool is_mime_container(mime_t * m) { return (m && ((m->mime_type == MIME_MESSAGE) || (m->mime_type == MIME_MULTIPART))); } void mime_reset(void) { if (DEBUG_MIME(0)) fprintf(dbgout, "*** mime_reset\n"); mime_cleanup(); mime_push(NULL); } void mime_add_child(mime_t * parent) { mime_push(parent); } /** * Check if the line given in \a boundary is a boundary of one of the * outer MIME containers and store the results in \a b. * container we'd previously seen. \return a copy of b->is_valid */ static bool get_boundary_props(const word_t * boundary, /**< input line */ boundary_t * b /*@out@*/ /**< output properties, must be pre-allocated by caller */) { mime_t *ptr; const byte *buf = boundary->u.text; size_t blen = boundary->leng; b->is_valid = false; /* a boundary line must begin with two dashes */ if (blen > 2 && buf[0] == '-' && buf[1] == '-') { /* strip EOL characters */ while (blen > 2 && (buf[blen - 1] == '\r' || buf[blen - 1] == '\n')) blen--; /* skip initial -- */ buf += 2; blen -= 2; /* skip and note ending --, if any */ if (blen > 2 && buf[blen - 1] == '-' && buf[blen - 2] == '-') { b->is_final = true; blen -= 2; } else { b->is_final = false; } /* search stack for matching boundary, in reverse order */ for (ptr = mime_stack_bot; ptr != NULL; ptr = ptr->parent) { if (is_mime_container(ptr) && ptr->boundary != NULL && ptr->boundary_len == blen && (memcmp(ptr->boundary, buf, blen) == 0)) { b->depth = ptr->depth; b->is_valid = true; break; } } } return b->is_valid; } bool mime_is_boundary(word_t * boundary) { boundary_t b; return get_boundary_props(boundary, &b); } bool got_mime_boundary(word_t * boundary) { mime_t *parent = NULL; boundary_t b; get_boundary_props(boundary, &b); if (!b.is_valid) return false; if (DEBUG_MIME(0)) fprintf(dbgout, "*** got_mime_boundary: stackp: %d, boundary: '%s'\n", mime_stack_top->depth, boundary->u.text); if (msg_state != NULL) { /* This handles explicit and implicit boundaries - pop stack * until we reach the boundary level on the stack */ while (msg_state->depth > b.depth) mime_pop(); /* explicit end boundary */ if (b.is_final) return true; parent = is_mime_container(msg_state) ? msg_state : msg_state->parent; } if (parent != NULL) mime_push(parent); /* push for the next part */ else mime_push(msg_state); /* push for the next part */ return true; } /** Skip leading whitespace from t. * \return - pointer to first non-whitespace character, * - NULL if the string is all whitespace or empty */ static const byte *skipws( const byte * t, /**< string to find non-whitespace in */ const byte * e /**< pointer to the byte after the last byte in \a t */) { while (t < e && (*t == ' ' || *t == '\t')) t++; if (t < e) return t; return NULL; } /** * get next MIME word, \return malloc'd NUL-terminated string containing * a copy of the word, or NULL when none found. It is the caller's * responsibility to xfree() the returned string! */ static byte *getword( const byte * t, /**< string to extract word from */ const byte * e /**< pointer to byte after last byte in \a t */) { int quote = 0; int l; const byte *ts; byte *n; t = skipws(t, e); if (!t) return NULL; if (*t == '"') { quote++; t++; } ts = t; while ((t < e) && (quote ? *t != '"' : (*t != ' ' && *t != '\t'))) { t++; } l = t - ts; n = (byte *) xmalloc(l + 1); memcpy(n, ts, l); n[l] = (byte) '\0'; return n; } void mime_content(word_t * text) { char *key = (char *) text->u.text; switch (tolower((unsigned char)key[9])) { case 'r': /* Content-Transfer-Encoding: */ mime_encoding(text); break; case 'y': /* Content-Type: */ mime_type(text); break; case 'i': /* Content-Disposition: */ mime_disposition(text); break; } } static void mime_disposition(word_t * text) { size_t i; const size_t l = sizeof("Content-Disposition:") - 1; byte *w = getword(text->u.text + l, text->u.text + text->leng); if (!w) return; msg_state->mime_disposition = MIME_DISPOSITION_UNKNOWN; for (i = 0; i < COUNTOF(mime_disposition_table); i += 1) { const struct disposition_s *dis = mime_disposition_table + i; if (strcasecmp((const char *)w, dis->name) == 0) { msg_state->mime_disposition = dis->disposition; if (DEBUG_MIME(1)) fprintf(dbgout, "*** mime_disposition: %s\n", text->u.text); break; } } if (DEBUG_MIME(0) && msg_state->mime_disposition == MIME_DISPOSITION_UNKNOWN) fprintf(stderr, "Unknown mime disposition - '%s'\n", w); xfree(w); return; } /********* ** ** RFC2045, Section 6.1. Content-Transfer-Encoding Syntax ** ** encoding := "Content-Transfer-Encoding" ":" mechanism ** ** mechanism := "7bit" / "8bit" / "binary" / ** "quoted-printable" / "base64" / ** ietf-token / x-token ** *********/ static void mime_encoding(word_t * text) { size_t i; const size_t l = sizeof("Content-Transfer-Encoding:") - 1; byte *w = getword(text->u.text + l, text->u.text + text->leng); if (!w) return; msg_state->mime_encoding = MIME_ENCODING_UNKNOWN; for (i = 0; i < COUNTOF(mime_encoding_table); i += 1) { const struct encoding_s *enc = mime_encoding_table + i; if (strcasecmp((const char *)w, enc->name) == 0) { msg_state->mime_encoding = enc->encoding; if (DEBUG_MIME(1)) fprintf(dbgout, "*** mime_encoding: %s\n", text->u.text); break; } } if (DEBUG_MIME(0) && msg_state->mime_encoding == MIME_ENCODING_UNKNOWN) fprintf(stderr, "Unknown mime encoding - '%s'\n", w); xfree(w); return; } static void mime_type(word_t * text) { const struct type_s *typ; const size_t l = sizeof("Content-Type:") - 1; byte *w = getword(text->u.text + l, text->u.text + text->leng); if (!w) return; msg_state->mime_type = MIME_TYPE_UNKNOWN; for (typ = mime_type_table; typ < mime_type_table + COUNTOF(mime_type_table); typ += 1) { if (strncasecmp((const char *)w, typ->name, strlen(typ->name)) == 0) { msg_state->mime_type = typ->type; if (DEBUG_MIME(1) || DEBUG_LEXER(1)) fprintf(dbgout, "*** mime_type: %s\n", text->u.text); break; } } if (DEBUG_MIME(0) && msg_state->mime_type == MIME_TYPE_UNKNOWN) fprintf(stderr, "Unknown mime type - '%s'\n", w); xfree(w); switch (msg_state->mime_type) { case MIME_TEXT: return; /* XXX: read charset */ case MIME_TEXT_PLAIN: return; /* XXX: read charset */ case MIME_TEXT_HTML: return; case MIME_TYPE_UNKNOWN: return; case MIME_MULTIPART: return; /* XXX: read boundary */ case MIME_MESSAGE: return; case MIME_APPLICATION: case MIME_IMAGE: case MIME_AUDIO: case MIME_VIDEO: msg_state->mime_dont_decode = true; return; } return; } void mime_boundary_set(word_t * text) { byte *boundary = text->u.text; size_t blen = text->leng; if (DEBUG_MIME(1)) { int len = blen; if (blen > INT_MAX) len = INT_MAX; fprintf(dbgout, "*** --> mime_boundary_set: %d '%-.*s'\n", msg_state->depth, len, boundary); } boundary = getword(boundary + strlen("boundary="), boundary + blen); xfree(msg_state->boundary); msg_state->boundary = (char *) boundary; msg_state->boundary_len = strlen((char *) boundary); if (DEBUG_MIME(1)) fprintf(dbgout, "*** <-- mime_boundary_set: %d '%s'\n", msg_state->depth, boundary); return; } uint mime_decode(word_t * text) { uint count = text->leng; /* early out for the identity codings */ if (msg_state->mime_encoding == MIME_7BIT || msg_state->mime_encoding == MIME_8BIT || msg_state->mime_encoding == MIME_BINARY || msg_state->mime_encoding == MIME_ENCODING_UNKNOWN) return count; if (DEBUG_MIME(3)) fprintf(dbgout, "*** mime_decode %lu \"%-.*s\"\n", (unsigned long) count, count > INT_MAX ? INT_MAX : (int) (count - 1), text->u.text); /* Do not decode "real" boundary lines */ if (mime_is_boundary(text) == true) return count; switch (msg_state->mime_encoding) { case MIME_QP: count = qp_decode(text, RFC2045); break; case MIME_BASE64: if (count > 4) count = base64_decode(text); break; case MIME_UUENCODE: count = uudecode(text); break; case MIME_7BIT: case MIME_8BIT: case MIME_BINARY: case MIME_ENCODING_UNKNOWN: break; } return count; } enum mimetype get_content_type(void) { return msg_state->mime_type; } bogofilter-1.2.4/src/memstr.h0000644000175000017500000000056512163572304014316 0ustar sezsez/* $Id: memstr.h 6774 2009-02-01 02:29:27Z relson $ */ /** \file memstr.h declarations for memstr.c * \author Matthias Andree * \date 2004 * GNU General Public License v2 */ #ifndef MEMSTR_H #define MEMSTR_H #include /** find needle in haystack (which is treated as unsigned char *). */ void *memstr(void *haystack, size_t n, const char *needle); #endif bogofilter-1.2.4/src/fgetsl.c0000644000175000017500000000355012163572304014263 0ustar sezsez/** * \file fgetsl.c Implementation file for NUL-proof fgets() replacement. * Also usable as standalone test code when compiled with -DMAIN. * \author Matthias Andree * \date 2002 - 2003 */ #include "common.h" #include #include #include "fgetsl.h" /* calls exit(EX_ERROR) on read error or when max_size < 2 */ int fgetsl(char *buf, int siz, /*@null@*/ FILE *in) { return xfgetsl(buf, siz, in, 0); } int xfgetsl(char *buf, int max_size, FILE *in, bool no_nul_terminate) { int c = 0; int rc; char *cp = buf; char *end = buf + max_size; /* Physical end of buffer */ char *fin = end - (no_nul_terminate ? 0 : 1); /* Last available byte */ if (cp >= fin) { fprintf(stderr, "Invalid buffer size, exiting.\n"); abort(); } if (in == NULL) { errno = EBADF; return(EOF); } if (feof(in)) return(EOF); while ((cp < fin) && ((c = getc(in)) != EOF)) { *cp++ = (char)c; if (c == '\n') break; } if (c == EOF && ferror(in)) { perror("stdin"); exit(EX_ERROR); } if (cp < end) *cp = '\0'; /* DO NOT ADD ++ HERE! */ rc = (cp != buf || !feof(in)) ? cp - buf : EOF; return rc; } #ifdef MAIN #include #include "xmalloc.h" int main(int argc, char **argv) { char *buf; int size, count, non_nul_terminate; if (argc != 3) { fprintf(stderr, "%s \n", argv[0]); exit(EX_ERROR); } non_nul_terminate = atoi(argv[2]); size = atoi(argv[1]); buf = xmalloc(size); for (;;) { count = xfgetsl(buf, size, stdin, non_nul_terminate); if (count == EOF) break; printf("%d ", count); if (count > 0) fwrite((char *)buf, 1, count, stdout); if (count > 0 && !non_nul_terminate && buf[count] != '\0') { printf(" (NUL terminator missing)"); } putchar('\n'); } xfree(buf); exit(EXIT_SUCCESS); } #endif bogofilter-1.2.4/src/datastore_dbcommon.h0000644000175000017500000000377212163572304016656 0ustar sezsez#ifndef DATASTORE_DBCOMMON_H #define DATASTORE_DBCOMMON_H #define DB_AT_LEAST(maj, min) ((DB_VERSION_MAJOR > (maj)) || ((DB_VERSION_MAJOR == (maj)) && (DB_VERSION_MINOR >= (min)))) #define DB_AT_MOST(maj, min) ((DB_VERSION_MAJOR < (maj)) || ((DB_VERSION_MAJOR == (maj)) && (DB_VERSION_MINOR <= (min)))) #define DB_EQUAL(maj, min) ((DB_VERSION_MAJOR == (maj)) && (DB_VERSION_MINOR == (min))) /* wrapper for the API that changed in 4.0, to * collect the junk in a location separate from the implementation */ #if DB_AT_LEAST(4,0) /* BerkeleyDB 4.0, 4.1, 4.2 */ #define BF_LOG_FLUSH(e, i) ((e)->log_flush((e), (i))) #define BF_MEMP_SYNC(e, l) ((e)->memp_sync((e), (l))) #define BF_MEMP_TRICKLE(e, p, n) ((e)->memp_trickle((e), (p), (n))) #define BF_TXN_BEGIN(e, f, g, h) ((e)->txn_begin((e), (f), (g), (h))) #define BF_TXN_ID(t) ((t)->id(t)) #define BF_TXN_ABORT(t) ((t)->abort((t))) #define BF_TXN_COMMIT(t, f) ((t)->commit((t), (f))) #define BF_TXN_CHECKPOINT(e, k, m, f) ((e)->txn_checkpoint((e), (k), (m), (f))) #define BF_LOG_ARCHIVE(e, l, f) ((e)->log_archive((e), (l), (f))) #else /* BerkeleyDB 3.1, 3.2, 3.3 */ #define BF_LOG_FLUSH(e, i) (log_flush((e), (i))) #define BF_MEMP_SYNC(e, l) (memp_sync((e), (l))) #define BF_MEMP_TRICKLE(e, p, n) (memp_trickle((e), (p), (n))) #define BF_TXN_BEGIN(e, f, g, h) (txn_begin((e), (f), (g), (h))) #define BF_TXN_ID(t) (txn_id(t)) #define BF_TXN_ABORT(t) (txn_abort((t))) #define BF_TXN_COMMIT(t, f) (txn_commit((t), (f))) #define BF_TXN_CHECKPOINT(e, k, m, f) (txn_checkpoint((e), (k), (m), (f))) #if DB_AT_LEAST(3,3) #define BF_LOG_ARCHIVE(e, l, f) (log_archive((e), (l), (f))) #else #define BF_LOG_ARCHIVE(e, l, f) (log_archive((e), (l), (f), NULL)) #endif #endif /* DB->stat interface changed in 3.3 and in 4.3 */ #if DB_AT_MOST(3,2) #define BF_DB_STAT(d, t, s, f) ((d)->stat((d), (s), NULL, (f))) #endif #if DB_AT_LEAST(4,3) #define BF_DB_STAT(d, t, s, f) ((d)->stat((d), (t), (s), (f))) #endif #ifndef BF_DB_STAT #define BF_DB_STAT(d, t, s, f) ((d)->stat((d), (s), (f))) #endif #endif bogofilter-1.2.4/src/configtest.c0000644000175000017500000000324312163572304015143 0ustar sezsez/* $Id: configtest.c 6820 2009-02-22 20:13:08Z relson $ */ /***************************************************************************** NAME: config.c -- process config file parameters AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include "configfile.h" #include "score.h" #include "wordlists.h" const char *progname = "configtest"; #ifndef DEBUG_CONFIG #define DEBUG_CONFIG(level) (verbose > level) #endif /* Definitions to support config.c */ double msg_spamicity(void) { return 0.0; } rc_t msg_status(void) { return RC_HAM; } #ifdef COMPILE_DEAD_CODE static int x_init_list(wordlist_t* list, const char* name, const char* filepath, double weight, bool bad, int override, bool ignore) { if (DEBUG_CONFIG(0)) { fprintf( stderr, "list: %p\n", (void *)list); fprintf( stderr, "name: %s\n", name); fprintf( stderr, "filepath: %s\n", filepath); fprintf( stderr, "weight: %f\n", weight); fprintf( stderr, "bad: %s\n", bad ? "T" : "F" ); fprintf( stderr, "override: %d\n", override); fprintf( stderr, "ignore: %s\n", ignore ? "T" : "F" ); } return 0; } #endif static struct option longopts_dummy[] = { /* end of list */ { NULL, 0, 0, 0 } }; int main( int argc, char **argv) { verbose = 0; logflag = 0; while (--argc > 0) { char *arg = *++argv; if (strcmp(arg, "-v") == 0) verbose = 1; } if ( !process_config_files(false, longopts_dummy) ) exit(EX_ERROR); /* read_config_file("./bogofilter.cf", true, false); */ return 0; } bogofilter-1.2.4/src/strerror.c0000644000175000017500000000063112163572272014662 0ustar sezsez/* strerror.c - replacement strerror for systems that have sys_errlist */ /* (C) 2004 by Matthias Andree. License: GNU GPL v2. */ #include #include extern int sys_nerr; extern char *sys_errlist[]; char *strerror(int errnum) { static char buf[80]; if (errnum >= 0 && errnum < sys_nerr) return sys_errlist[errnum]; sprintf(buf, "Unknown error %d", errnum); return buf; } bogofilter-1.2.4/src/datastore_qdbm.c0000644000175000017500000001510412163572304015766 0ustar sezsez/* $Id: datastore_qdbm.c 6649 2007-02-14 20:30:15Z m-a $ */ /***************************************************************************** NAME: datastore_qdbm.c -- implements the datastore, using qdbm. AUTHORS: Gyepi Sam 2003 Matthias Andree 2003 Stefan Bellon 2003-2004 ******************************************************************************/ #include "common.h" #include #include #include #include #include "datastore.h" #include "datastore_db.h" #include "datastore_qdbm.h" #include "error.h" #include "paths.h" #include "xmalloc.h" #include "xstrdup.h" #define UNUSED(x) ((void)&x) typedef struct { char *path; char *name; bool locked; bool created; VILLA *dbp; } dbh_t; /* Function definitions */ const char *db_version_str(void) { static char v[80]; if (!v[0]) snprintf(v, sizeof(v), "QDBM (Depot version %s, Villa API)", dpversion); return v; } static dbh_t *dbh_init(bfpath *bfp) { dbh_t *handle; handle = xmalloc(sizeof(dbh_t)); memset(handle, 0, sizeof(dbh_t)); /* valgrind */ handle->name = xstrdup(bfp->filepath); handle->locked = false; handle->created = false; return handle; } static void dbh_free(/*@only@*/ dbh_t *handle) { if (handle != NULL) { xfree(handle->name); xfree(handle->path); xfree(handle); } return; } /* Returns is_swapped flag */ bool db_is_swapped(void *vhandle) { UNUSED(vhandle); return false; } /* Returns created flag */ bool db_created(void *vhandle) { dbh_t *handle = vhandle; return handle->created; } /* Initialize database. Returns: pointer to database handle on success, NULL otherwise. */ void *db_open(void * dummy, bfpath *bfp, dbmode_t open_mode) { dbh_t *handle; int open_flags; VILLA *dbp; UNUSED(dummy); if (open_mode & DS_WRITE) open_flags = VL_OWRITER; else open_flags = VL_OREADER; handle = dbh_init(bfp); if (handle == NULL) return NULL; dbp = handle->dbp = vlopen(handle->name, open_flags, cmpkey); if ((dbp == NULL) && (open_mode & DS_WRITE)) { dbp = handle->dbp = vlopen(handle->name, open_flags|VL_OCREAT, cmpkey); if (dbp != NULL) handle->created = true; } if (dbp == NULL) goto open_err; if (DEBUG_DATABASE(1)) fprintf(dbgout, "(qdbm) vlopen( %s, %d )\n", handle->name, open_mode); return handle; open_err: print_error(__FILE__, __LINE__, "(qdbm) vlopen(%s, %d), err: %d, %s", handle->name, open_flags, dpecode, dperrmsg(dpecode)); dbh_free(handle); return NULL; } int db_delete(void *vhandle, const dbv_t *token) { int ret; dbh_t *handle = vhandle; VILLA *dbp; dbp = handle->dbp; ret = vlout(dbp, token->data, token->leng); if (ret == 0) { print_error(__FILE__, __LINE__, "(qdbm) vlout('%.*s'), err: %d, %s", CLAMP_INT_MAX(token->leng), (char *)token->data, dpecode, dperrmsg(dpecode)); exit(EX_ERROR); } ret = ret ^ 1; /* ok is 1 in qdbm and 0 in bogofilter */ return ret; /* 0 if ok */ } int db_get_dbvalue(void *vhandle, const dbv_t *token, /*@out@*/ dbv_t *val) { char *data; int dsiz; dbh_t *handle = vhandle; VILLA *dbp = handle->dbp; data = vlget(dbp, token->data, token->leng, &dsiz); if (data == NULL) return DS_NOTFOUND; if (val->leng < (unsigned)dsiz) { print_error(__FILE__, __LINE__, "(qdbm) db_get_dbvalue( '%.*s' ), size error %lu: %lu", CLAMP_INT_MAX(token->leng), (char *)token->data, (unsigned long)val->leng, (unsigned long)dsiz); exit(EX_ERROR); } val->leng = dsiz; /* read count */ memcpy(val->data, data, dsiz); free(data); /* not xfree() as allocated by vlget() */ return 0; } /* Re-organize database according to some heuristics */ static inline void db_optimize(VILLA *dbp, char *name) { UNUSED(dbp); UNUSED(name); /* The Villa API doesn't need optimizing like the formerly used Depot API because Villa uses B+ trees and Depot uses hash tables. Database size may grow larger and could get compacted with vloptimize() however as the database size with Villa is smaller anyway, I don't think it is worth it. -- David Relson */ } int db_set_dbvalue(void *vhandle, const dbv_t *token, const dbv_t *val) { int ret; dbh_t *handle = vhandle; VILLA *dbp = handle->dbp; ret = vlput(dbp, token->data, token->leng, val->data, val->leng, VL_DOVER); if (ret == 0) { print_error(__FILE__, __LINE__, "(qdbm) db_set_dbvalue( '%.*s' ) err: %d, %s", CLAMP_INT_MAX(token->leng), (char *)token->data, dpecode, dperrmsg(dpecode)); exit(EX_ERROR); } db_optimize(dbp, handle->name); return 0; } /* Close files and clean up. */ void db_close(void *vhandle) { dbh_t *handle = vhandle; VILLA *dbp; if (handle == NULL) return; if (DEBUG_DATABASE(1)) fprintf(dbgout, "(qdbm) vlclose(%s)\n", handle->name); dbp = handle->dbp; db_optimize(dbp, handle->name); if (!vlclose(dbp)) print_error(__FILE__, __LINE__, "(qdbm) vlclose for %s err: %d, %s", handle->name, dpecode, dperrmsg(dpecode)); handle->dbp = NULL; dbh_free(handle); } /* Flush any data in memory to disk */ void db_flush(void *vhandle) { dbh_t *handle = vhandle; VILLA * dbp = handle->dbp; if (!vlsync(dbp)) print_error(__FILE__, __LINE__, "(qdbm) vlsync err: %d, %s", dpecode, dperrmsg(dpecode)); } ex_t db_foreach(void *vhandle, db_foreach_t hook, void *userdata) { int ret = 0; dbh_t *handle = vhandle; VILLA *dbp = handle->dbp; dbv_t dbv_key, dbv_data; int ksiz, dsiz; char *key, *data; ret = vlcurfirst(dbp); if (ret) { while ((key = vlcurkey(dbp, &ksiz))) { data = vlcurval(dbp, &dsiz); if (data) { /* switch to "dbv_t *" variables */ dbv_key.leng = ksiz; dbv_key.data = xmalloc(dbv_key.leng+1); memcpy(dbv_key.data, key, ksiz); ((char *)dbv_key.data)[dbv_key.leng] = '\0'; dbv_data.data = data; dbv_data.leng = dsiz; /* read count */ /* call user function */ ret = hook(&dbv_key, &dbv_data, userdata); xfree(dbv_key.data); if (ret != 0) break; free(data); /* not xfree() as allocated by dpget() */ } free(key); /* not xfree() as allocated by dpiternext() */ vlcurnext(dbp); } } else { print_error(__FILE__, __LINE__, "(qdbm) vlcurfirst err: %d, %s", dpecode, dperrmsg(dpecode)); exit(EX_ERROR); } return EX_OK; } const char *db_str_err(int e) { return dperrmsg(e); } bogofilter-1.2.4/src/textblock.h0000644000175000017500000000133212163572304014777 0ustar sezsez/* $Id: textblock.h 2843 2003-08-17 16:40:56Z relson $ */ /***************************************************************************** NAME: textblock.h -- prototypes and definitions for textblock.c ******************************************************************************/ #ifndef HAVE_TEXTBLOCK_H #define HAVE_TEXTBLOCK_H typedef struct textdata_s { struct textdata_s *next; size_t size; byte *data; } textdata_t; typedef struct textblock_s { textdata_t *head; textdata_t *tail; } textblock_t; textdata_t *textblock_head(void); void textblock_init(void); void textblock_free(void); void textblock_add(const byte *text, size_t size); #endif /* HAVE_TEXTBLOCK_H */ bogofilter-1.2.4/src/bf_copy.in0000755000175000017500000000240012163572304014600 0ustar sezsez#! @SHELL@ # bf_copy [-c] source_dir dest_dir # # use to copy wordlist.db and related files # from one directory to another # $Id: bf_copy.in 6750 2008-10-15 23:18:45Z clint $ set -e # die on errors : ${BOGOUTIL:=@transformed_bogoutil@} COMPACT=0 while test "$1" ; do case "$1" in -c) COMPACT=1 ;; --) shift ; break ;; -*) echo "unknown option $1" >&2 ; exit 1 ;; *) break; esac shift done if [ $# -ne 2 ] ; then echo 'usage: bf_copy [-c] source_dir dest_dir' echo " use -c to copy active logs, not all" exit 1 fi SRC="$1" DST="$2" # flush mempools $BOGOUTIL --db-checkpoint="$SRC" || : mkdir "$DST" TMP=bfc.$$.unneeded rm -f $TMP trap "rm -rf $TMP \"$DST\"" 0 if test $COMPACT -eq 1 ; then # don't copy unneeded logs $BOGOUTIL --db-list-logfiles="$SRC" >$TMP else : >$TMP fi # XXX FIXME - use Berkeley DB environment probing here LOGS=`ls "$SRC"/log.* 2>/dev/null | grep -v -F -f $TMP || :` if test "$LOGS" ; then cp -p $LOGS "$DST" ; fi if test -f "$SRC"/DB_CONFIG ; then cp -p "$SRC"/DB_CONFIG "$DST" ; fi for FILE in "$SRC"/*.db ; do SIZE=`$BOGOUTIL --db-print-pagesize="$FILE"` dd bs=$SIZE if=$FILE of="$DST/"`basename "$FILE"` done if test "$LOGS" ; then $BOGOUTIL --db-recover="$DST" ; fi rm -f $TMP trap - 0 bogofilter-1.2.4/src/wordlists.h0000644000175000017500000000163512163572304015040 0ustar sezsez/* $Id: wordlists.h 6875 2010-02-14 20:57:34Z relson $ */ /* constants and declarations for wordlists */ #ifndef WORDLISTS_H #define WORDLISTS_H #include "bftypes.h" #include "wordlists_base.h" extern const char *aCombined[]; extern size_t cCombined; extern const char *aSeparate[]; extern size_t cSeparate; typedef char FILEPATH[PATH_LEN]; /*@null@*/ extern wordlist_t *word_lists; void incr_wordlist_mode(void); void set_wordlist_mode(const char *filepath); bool configure_wordlist(const char *val); /** * initialize wordlist the same way as open_wordlists does, like * beginning a transaction and reading message counts */ void begin_wordlist(wordlist_t *list); void open_wordlists(dbmode_t mode); bool close_wordlists(bool commit); bool query_wordlists_closed(void); void set_list_active_status(bool status); void set_wordlist_directory(void); void wordlist_error(int err); #endif /* WORDLISTS_H */ bogofilter-1.2.4/src/configfile.h0000644000175000017500000000243612163572272015117 0ustar sezsez/* $Id: configfile.h 5656 2005-03-16 03:55:14Z m-a $ */ /***************************************************************************** NAME: configfile.h -- prototypes and definitions for bogoconfig.c. AUTHOR: David Relson ******************************************************************************/ #ifndef CONFIGFILE_H #define CONFIGFILE_H #include "getopt.h" /* Definitions */ typedef enum arg_pass_e { PASS_1_CLI = 1, /* 1 - first command line pass */ PASS_2_CFG = 2, /* 2 - config file options ... */ PASS_3_CLI = 3 /* 3 - second command line pass */ } arg_pass_t; /* Global variables */ extern char *config_file_name; extern void remove_comment(const char *line); extern bool process_config_files(bool warn_on_error, struct option *lopts); extern bool process_config_option(const char *arg, bool warn_on_error, priority_t precedence, struct option *lopts); extern bool read_config_file(const char *fname, bool tilde_expand, bool warn_on_error, priority_t precedence, struct option *lopts); extern bool process_config_option_and_val(const char *name, const char *val, bool warn_on_error, priority_t precedence); extern bool process_config_option_as_arg(const char *arg, const char *val, priority_t precedence, struct option *lopts); #endif bogofilter-1.2.4/src/paths.c0000644000175000017500000001654112163572304014122 0ustar sezsez/* $Id: paths.c 6207 2005-08-14 13:10:06Z relson $ */ /** * \file * paths.c -- routines for working with file paths. */ #include "common.h" #include #include #include #include "find_home.h" #include "mxcat.h" #include "paths.h" #include "xmalloc.h" #include "xstrdup.h" /* Local Data */ typedef struct { priority_t p; /* precedence */ const char *v; /* env var */ const char *s; /* sub dir */ } map_pri_env; static map_pri_env pri_2_env[] = { #ifndef __riscos__ { PR_ENV_BOGO, "BOGOFILTER_DIR", NULL }, { PR_ENV_BOGO, "BOGODIR", NULL }, { PR_ENV_HOME, "HOME", BOGODIR } #else { PR_ENV_HOME, "Choices$Write", BOGODIR }, { PR_ENV_HOME, "Bogofilter$Dir", NULL }, #endif }; /* Function Definitions */ char *bogohome = NULL; void set_bogohome(const char *path) { xfree(bogohome); bogohome = xstrdup(path); } void chk_bogohome(void) { if (!check_directory(bogohome)) { (void)fprintf(stderr, "%s: cannot find bogofilter directory.\n" "You must specify a directory on the command line, in the config file,\n" #ifndef __riscos__ "or by using the BOGOFILTER_DIR or HOME environment variables.\n" #else "or by ensuring that is set correctly.\n" #endif "Program aborting.\n", progname); exit(EX_ERROR); } } static bool cant_find_bogohome(void) { if (bogohome != NULL) return false; if (set_wordlist_dir(NULL, PR_ENV_BOGO) == 0) return false; if (set_wordlist_dir(NULL, PR_ENV_HOME) == 0) return false; return true; } void bogohome_cleanup(void) { xfree(bogohome); bogohome = NULL; } int set_wordlist_dir(const char* d, priority_t precedence) { int rc = 0; char *dir; static priority_t saved_precedence = PR_NONE; if (DEBUG_WORDLIST(2)) fprintf(dbgout, "p: %d, s: %d\n", (int) precedence, (int) saved_precedence); if (precedence < saved_precedence) return rc; dir = (d != NULL) ? tildeexpand(d) : get_directory(precedence); if (dir == NULL) return -1; if (DEBUG_WORDLIST(2)) fprintf(dbgout, "d: %s\n", dir); saved_precedence = precedence; set_bogohome(dir); xfree(dir); return rc; } char *get_directory(priority_t which) { size_t i; char *dir = NULL; for (i = 0; i < COUNTOF(pri_2_env) ; i += 1) { map_pri_env *p2e = &pri_2_env[i]; if (p2e->p == which) { dir = create_path_from_env(p2e->v, p2e->s); if (dir) break; } } return dir; } static bfpath *bfpath_split(bfpath *bfp, const char *home) { /* precondition: bfp->dirname and bfp->filename free'd if need be */ char *t = strrchr(bfp->filepath, DIRSEP_C); xfree(bfp->dirname); xfree(bfp->filename); if (t != NULL) { /* if directory separator present .... */ *t = '\0'; bfp->dirname = xstrdup(bfp->filepath); *t = DIRSEP_C; bfp->filename = xstrdup(t+1); } else if (home != NULL){ bfp->dirname = xstrdup(home); bfp->filename = bfp->filepath; bfp->filepath = mxcat(bfp->dirname, DIRSEP_S, bfp->filename, NULL); } else { bfp->dirname = NULL; bfp->filename = xstrdup(bfp->filepath); } return bfp; } bfpath *bfpath_create(const char *path) { bfpath *bfp = xcalloc(1, sizeof(bfpath)); bfp->filepath = xstrdup(path); return bfp; } static void check_for_file(bfpath *bfp) { int rc; struct stat sb; bfp->isdir = bfp->isfile = false; rc = stat(bfp->filepath, &sb); if (rc == 0) { bfp->exists = true; xfree(bfp->dirname); xfree(bfp->filename); if (S_ISDIR(sb.st_mode)) { bfp->isdir = true; bfp->dirname = xstrdup(bfp->filepath); bfp->filename = NULL; } if (!S_ISDIR(sb.st_mode)) { bfp->isfile = true; bfp->dirname = get_directory_from_path(bfp->filepath); bfp->filename = get_file_from_path(bfp->filepath); } } return; } bool bfpath_check_mode(bfpath *bfp, bfpath_mode m) { bool ok = true; bfp->checked = true; if (bfp->filepath != NULL && bfp->dirname == NULL && bfp->filename == NULL) { char *t = strrchr(bfp->filepath, DIRSEP_C); if (t == NULL) bfp->filename = xstrdup(bfp->filepath); else { bfp->dirname = xstrdup(bfp->filepath); bfp->dirname[t - bfp->filepath] = '\0'; bfp->filename = xstrdup(t+1); } } check_for_file(bfp); switch (m) { case BFP_MUST_EXIST: if (!bfp->exists) ok = false; break; case BFP_MAY_CREATE: break; case BFP_ERROR: /* can't get here */ abort(); } if (bfp->dirname != NULL && bogohome == NULL) set_bogohome(bfp->dirname); return ok; } void bfpath_set_bogohome(bfpath *bfp) { /* ensure bogohome is set */ if (cant_find_bogohome()) { fprintf(stderr, "Can't find HOME or BOGOFILTER_DIR in environment.\n"); exit(EX_ERROR); } bfpath_split(bfp, bogohome); } void bfpath_set_filename(bfpath *bfp, const char *filename) { xfree(bfp->filename); bfp->filename = xstrdup(filename); xfree(bfp->filepath); bfp->filepath = mxcat(bfp->dirname, DIRSEP_S, bfp->filename, NULL); check_for_file(bfp); return; } bfpath *bfpath_free(bfpath *bfp) { xfree(bfp->dirname); xfree(bfp->filename); xfree(bfp->filepath); xfree(bfp); return NULL; } char *build_progtype(const char *name, const char *db_type) { char *type; if (strcmp(db_type, "db") == 0) type = xstrdup(name); else { size_t len = strlen(name) + strlen(db_type) + 2; type = xmalloc(len); snprintf(type, len, "%s-%s", name, db_type); } return type; } char *create_path_from_env(const char *var, /*@null@*/ const char *subdir) { char *buff, *env; size_t path_size, env_size; env = getenv(var); if (env == NULL || *env == '\0') return NULL; env_size = strlen(env); path_size = env_size + (subdir ? strlen(subdir) : 0) + 2; buff = xmalloc(path_size); strlcpy(buff, env, path_size); if (subdir != NULL) { if (buff[env_size-1] != DIRSEP_C) strlcat(buff, DIRSEP_S, path_size); strlcat(buff, subdir, path_size); } if (strlcat(buff, "", path_size) >= path_size) abort(); /* buffer overrun, this cannot happen - buff is xmalloc()d */ return buff; } bool check_directory(const char* path) /*@globals errno,stderr@*/ { int rc; struct stat sb; if (path == NULL || *path == '\0') return false; rc = stat(path, &sb); if (rc < 0) { if (ENOENT==errno) { if (bf_mkdir(path, S_IRUSR|S_IWUSR|S_IXUSR)) { fprintf(stderr, "Error creating directory '%s': %s\n", path, strerror(errno)); return false; } else if (verbose > 0) { fprintf(dbgout, "Created directory %s .\n", path); } return true; } else { fprintf(stderr, "Error accessing directory '%s': %s\n", path, strerror(errno)); return false; } } else { if (! S_ISDIR(sb.st_mode)) { fprintf(stderr, "Error: %s is not a directory.\n", path); return false; } } return true; } /** returns malloc()ed copy of the file name part of \a path. */ char *get_file_from_path(const char *path) { char *file = strrchr(path, DIRSEP_C); if (file == NULL) file = xstrdup(path); else file = xstrdup(file + 1); return file; } /** returns malloc()ed copy of the directory name of \a path. */ char *get_directory_from_path(const char *path) { char *dir = xstrdup(path); char *last = strrchr(dir, DIRSEP_C); if (last == NULL) { xfree(dir); return NULL; } else { *last = '\0'; return dir; } } bogofilter-1.2.4/src/convert_charset.h0000644000175000017500000000075312163572304016177 0ustar sezsez/* $Id: convert_charset.h 6004 2005-05-29 03:31:57Z relson $ */ /***************************************************************************** NAME: charset_orig.h -- constants and declarations for charset_orig.c AUTHOR: David Relson ******************************************************************************/ #ifndef CHARSET_ORIG_H #define CHARSET_ORIG_H extern void init_charset_table_orig(const char *charset_name); #endif /* CHARSET_ORIG_H */ bogofilter-1.2.4/src/datastore_db_private.h0000644000175000017500000000264112163572304017171 0ustar sezsez/* $Id: datastore_db_private.h 5840 2005-04-29 11:44:43Z relson $ */ /***************************************************************************** NAME: datastore_db_private.h - provide OO interface for datastore methods; used for Berkeley DB transactional & non-transactional support. AUTHOR: David Relson 2005 ******************************************************************************/ #ifndef DATASTORE_DB_PRIVATE_H #define DATASTORE_DB_PRIVATE_H #define MAGIC_DBE 0xdbe #define MAGIC_DBH 0xdb4 /** implementation internal type to keep track of databases * we have opened. */ #ifndef ENABLE_SQLITE_DATASTORE typedef struct { int magic; char *path; char *name; int fd; /* file descriptor of data base file */ dbmode_t open_mode; /* datastore open mode, DS_READ/DS_WRITE */ #ifdef ENABLE_DB_DATASTORE /* if Berkeley DB */ DB *dbp; /* data base handle */ #endif bool locked; bool is_swapped; /* set if CPU and data base endianness differ */ bool created; /* if newly created; for datastore.c (to add .WORDLIST_VERSION) */ dbe_t *dbenv; /* "parent" environment */ #ifdef ENABLE_DB_DATASTORE /* if Berkeley DB */ DB_TXN *txn; /* transaction in progress or NULL */ #endif /** OO database methods */ dsm_t *dsm; } dbh_t; #endif #define DBT_init(dbt) (memset(&dbt, 0, sizeof(DBT))) e_txn probe_txn(bfpath *bfp); #endif bogofilter-1.2.4/src/xatof.c0000644000175000017500000000176512163572272014132 0ustar sezsez/** \file xatof.c * Implements xatof, an easy to use strtod() wrapper. * * \author Matthias Andree * \date 2003 */ #include "xatox.h" #include /* for strtod() for SunOS 4.1.X */ #include #include #include int xatof(double *d, const char *in) { double val; char *end; errno = 0; val = strtod(in, &end); if (end == in /* input string empty or does not start with sign/digit */ || end < in + strlen(in) /* junk at end of in */ || errno == EINVAL /* SUSv3: "no conversion could be performed" */ || errno == ERANGE /* overflow, SUSv3 CX underflow */) if (*end != ',') return 0; *d = val; return 1; } #ifdef MAIN #include int main(int argc, char **argv) { int i; for (i = 1; i < argc; i++) { double d; int s = xatof(&d, argv[i]); printf("%s -> errno=%d_(%s) status=%d", argv[i], errno, strerror(errno), s); if (s) printf(" double=%g", d); printf("\n"); } exit(EXIT_SUCCESS); } #endif bogofilter-1.2.4/src/score.c0000644000175000017500000003460112163572272014117 0ustar sezsez/* $Id: score.c 6890 2010-03-17 23:52:48Z m-a $ */ /***************************************************************************** NAME: score.c -- implements Fisher variant on Robinson algorithm. ******************************************************************************/ #include "common.h" #include #include #include #include "bogoconfig.h" #include "bogofilter.h" #include "collect.h" #include "datastore.h" #include "listsort.h" #include "msgcounts.h" #include "prob.h" #include "rand_sleep.h" #include "rstats.h" #include "score.h" #include "wordhash.h" #include "wordlists.h" #if defined(HAVE_GSL_10) && !defined(HAVE_GSL_14) /* HAVE_GSL_14 implies HAVE_GSL_10 * if we have neither, we'll use our included GSL 1.4, which knows CDFs * if we have both, we have GSL 1.4, which knows CDFs * * in other cases, we need to integrate the PDF to get the CDF */ #define GSL_INTEGRATE_PDF #include "gsl/gsl_randist.h" #include "gsl/gsl_integration.h" #include "gsl/gsl_errno.h" #else #include "gsl/gsl_cdf.h" #endif /* Structure Definitions */ typedef struct probnode_t { hashnode_t * node; double prob; } probnode_t; /* struct for saving stats for printing. */ typedef struct score_s { double min_dev; double spamicity; u_int32_t robn; double p_ln; /* Robinson P, as a log*/ double q_ln; /* Robinson Q, as a log*/ double p_pr; /* Robinson P */ double q_pr; /* Robinson Q */ } score_t; /* Function Prototypes */ static double get_spamicity(size_t robn, FLOAT P, FLOAT Q); static bool need_scoring_boundary(size_t count); static double find_scoring_boundary(wordhash_t *wh); static size_t compute_count_and_scores(wordhash_t *wh); static size_t compute_count_and_spamicity(wordhash_t *wh, FLOAT *P, FLOAT *Q, bool need_stats); static int compare_hashnode_t(const void *const pv1, const void *const pv2); /* Static Variables */ static score_t score; /* Function Definitions */ double msg_spamicity(void) { return score.spamicity; } rc_t msg_status(void) { if (score.spamicity >= spam_cutoff) return RC_SPAM; if ((ham_cutoff < EPS) || (score.spamicity <= ham_cutoff)) return RC_HAM; return RC_UNSURE; } void msg_print_stats(FILE *fp) { bool unsure = unsure_stats && (msg_status() == RC_UNSURE) && verbose; (void)fp; if (quiet) return; if (Rtable || unsure || verbose >= 2) rstats_print(unsure); } /** search token in all lists according to precedence, summing up the * counts (all lists at same precedence are used); if found, set cnts * accordingly. */ static int lookup(const word_t *token, wordcnts_t *cnts) { int override=0; wordlist_t* list; if (fBogotune) { wordprop_t *wp = wordhash_search_memory(token); if (wp) { cnts->good = wp->cnts.good; cnts->bad = wp->cnts.bad; } return 0; } cnts->msgs_bad = cnts->msgs_good = 0; for (list=word_lists; list != NULL; list=list->next) { dsv_t val; int ret; if (override > list->override) /* if already found */ break; ret = ds_read(list->dsh, token, &val); /* check if we have the token */ switch (ret) { case 0: /* token found, pass on */ break; case 1: /* token not found, clear counts */ val.count[IX_GOOD] = 0; val.count[IX_SPAM] = 0; break; case DS_ABORT_RETRY: /* sleep, reinitialize and start over */ rand_sleep(1000,1000000); begin_wordlist(list); /* FALLTHROUGH */ default: return ret; } if (ret == 0 && list->type == WL_IGNORE) { /* if found on ignore list */ cnts->good = cnts->bad = 0; break; } override=list->override; if (DEBUG_ALGORITHM(2)) { fprintf(dbgout, "%6d %5u %5u %5u %5u list=%s,%c,%d ", ret, (uint)val.count[IX_GOOD], (uint)val.count[IX_SPAM], (uint)list->msgcount[IX_GOOD], (uint)list->msgcount[IX_SPAM], list->listname, list->type, list->override); word_puts(token, 0, dbgout); fputc('\n', dbgout); } cnts->good += val.count[IX_GOOD]; cnts->bad += val.count[IX_SPAM]; cnts->msgs_good += list->msgcount[IX_GOOD]; cnts->msgs_bad += list->msgcount[IX_SPAM]; } if (DEBUG_ALGORITHM(1)) { fprintf(dbgout, "%5u %5u ", (uint)cnts->bad, (uint)cnts->good); word_puts(token, 0, dbgout); fputc('\n', dbgout); } return 0; } /* do wordlist lookups for the words in the wordhash */ void lookup_words(wordhash_t *wh) { int ret; hashnode_t *node; if (msg_count_file) /* if mc file, already done */ return; retry: for (node = wordhash_first(wh); node != NULL; node = wordhash_next(wh)) { word_t *token = node->key; wordprop_t *props = (wordprop_t *) node->data; wordcnts_t *cnts = &props->cnts; ret = lookup(token, cnts); if (ret == DS_ABORT_RETRY) /* start all over, the message counts may have changed * lookup handles reinitializing the wordlist */ goto retry; } return; } /** selects the best spam/non-spam indicators and calculates Robinson's S, * \return -1.0 for error, S otherwise */ double msg_compute_spamicity(wordhash_t *wh) /*@globals errno@*/ { FLOAT P = {1.0, 0}; /* Robinson's P */ FLOAT Q = {1.0, 0}; /* Robinson's Q */ double spamicity; size_t robn = 0; bool need_stats = !fBogotune && (Rtable || passthrough || (verbose > 0)); if (DEBUG_ALGORITHM(2)) fprintf(dbgout, "### msg_compute_spamicity() begins\n"); if (DEBUG_ALGORITHM(2)) fprintf(dbgout, "min_dev: %f, robs: %f, robx: %f\n", min_dev, robs, robx); /* compute scores for the wordhash's tokens */ robn = compute_count_and_scores(wh); /* recalculate min_dev if necessary to satisfy token_count settings */ if (!need_scoring_boundary(robn)) score.min_dev = min_dev; else score.min_dev = find_scoring_boundary(wh); /* compute message spamicity from the wordhash's scores */ robn = compute_count_and_spamicity(wh, &P, &Q, need_stats); /* Robinson's P, Q and S ** S = (P - Q) / (P + Q) [combined indicator] */ spamicity = get_spamicity(robn, P, Q); if (need_stats && robn != 0) rstats_fini(robn, P, Q, spamicity); if (DEBUG_ALGORITHM(2)) fprintf(dbgout, "### msg_compute_spamicity() ends\n"); return spamicity; } /* ** compute_count_and_scores() ** compute the token probabilities from the linked list of tokens */ static size_t compute_count_and_scores(wordhash_t *wh) { size_t count = 0; hashnode_t *node; if (fBogotune) return count; for (node = wordhash_first(wh); node != NULL; node = wordhash_next(wh)) { wordcnts_t *cnts; wordprop_t *props; props = (wordprop_t *) node->data; cnts = &props->cnts; props->prob = calc_prob(cnts->good, cnts->bad, cnts->msgs_good, cnts->msgs_bad); props->used = fabs(props->prob - EVEN_ODDS) > min_dev; if (props->used) count += 1; } return count; } /* ** compute_count_and_score() ** compute the spamicity from the linked list of tokens using ** min_dev to select tokens */ static size_t compute_count_and_spamicity(wordhash_t *wh, FLOAT *P, FLOAT *Q, bool need_stats) { size_t count = 0; hashnode_t *node; for (node = wordhash_first(wh); node != NULL; node = wordhash_next(wh)) { bool useflag; double prob; word_t *token; wordcnts_t *cnts; wordprop_t *props; if (!fBogotune) { token = node->key; props = (wordprop_t *) node->data; cnts = &props->cnts; prob = props->prob; useflag = props->used; } else { token = NULL; cnts = (wordcnts_t *) node; prob = calc_prob(cnts->good, cnts->bad, cnts->msgs_good, cnts->msgs_bad); useflag = fabs(prob - EVEN_ODDS) > score.min_dev; } if (need_stats) rstats_add(token, prob, useflag, cnts); /* Robinson's P and Q; accumulation step */ /* * P = 1 - ((1-p1)*(1-p2)*...*(1-pn))^(1/n) [spamminess] * Q = 1 - (p1*p2*...*pn)^(1/n) [non-spamminess] */ if (useflag ) { int e; P->mant *= 1-prob; if (P->mant < 1.0e-200) { P->mant = frexp(P->mant, &e); P->exp += e; } Q->mant *= prob; if (Q->mant < 1.0e-200) { Q->mant = frexp(Q->mant, &e); Q->exp += e; } count += 1; } if (DEBUG_ALGORITHM(3)) { (void)fprintf(dbgout, "%3lu %3lu %f ", (unsigned long)count, (unsigned long)count, prob); (void)word_puts(token, 0, dbgout); (void)fputc('\n', dbgout); } } return count; } /* need_scoring_boundary( ) ** determine if min_dev gives a count fitting the token count limits ** return True if so; False if not */ static bool need_scoring_boundary(size_t count) { /* Early out if no token count limits are set */ if (((token_count_min == 0) || (token_count_min <= count)) && ((token_count_max == 0) || (token_count_max >= count)) && ((token_count_fix == 0) || (token_count_fix == count))) return false; else return true; } /* find_scoring_boundary( ) ** determine the token score that gives the desired token count ** for scoring the message. */ static double find_scoring_boundary(wordhash_t *wh) { size_t count = 0; double min_prob = (token_count_max == 0.0) ? min_dev : 1.0; hashnode_t *node; /* sort by ascending score difference (from 0.5) */ wh->iter_head = (hashnode_t *)listsort((element *)wh->iter_head, (fcn_compare *)&compare_hashnode_t); count = max(token_count_fix, max(token_count_min, token_count_max)); for (node = wordhash_first(wh); node != NULL; node = wordhash_next(wh)) { wordcnts_t *cnts; wordprop_t *props = NULL; double prob; double dev; if (!fBogotune) { props = (wordprop_t *) node->data; cnts = &props->cnts; } else { cnts = (wordcnts_t *) node; } prob = calc_prob(cnts->good, cnts->bad, cnts->msgs_good, cnts->msgs_bad); dev = fabs(prob - EVEN_ODDS); if (count > 0) { count -= 1; if (!fBogotune) props->used = true; min_prob = dev; } else if (dev >= min_prob) { if (!fBogotune) props->used = true; } else { if (!fBogotune) props->used = false; } } return min_prob; } /* compare_hashnode_t - sort by ascending score difference (from 0.5) */ static int compare_hashnode_t(const void *const pv1, const void *const pv2) { double d1; double d2; if (!fBogotune) { const hashnode_t *hn1 = (const hashnode_t *const)pv1; const hashnode_t *hn2 = (const hashnode_t *const)pv2; d1 = fabs(((wordprop_t *) hn1->data)->prob - EVEN_ODDS); d2 = fabs(((wordprop_t *) hn2->data)->prob - EVEN_ODDS); } else { const wordcnts_t *cnts; double prob; cnts = (const wordcnts_t *) pv1; prob = calc_prob(cnts->good, cnts->bad, cnts->msgs_good, cnts->msgs_bad); d1 = fabs(prob - EVEN_ODDS); cnts = (const wordcnts_t *) pv2; prob = calc_prob(cnts->good, cnts->bad, cnts->msgs_good, cnts->msgs_bad); d2 = fabs(prob - EVEN_ODDS); } if (d1 < d2) return +1; if (d1 > d2) return -1; return 0; } void score_initialize(void) { word_t *word_robx = word_news(ROBX_W); wordlist_t *list = get_default_wordlist(word_lists); if (fabs(min_dev) < EPS) min_dev = MIN_DEV; if (spam_cutoff < EPS) spam_cutoff = SPAM_CUTOFF; /* ** If we're classifying messages, we need to compute the scalefactor ** (from the .MSG_COUNT values) ** If we're registering tokens, we needn't get .MSG_COUNT */ if (fabs(robs) < EPS) robs = ROBS; if (fabs(robx) < EPS) { /* Assign default value in case there's no wordlist * or no wordlist entry */ robx = ROBX; if (list->dsh != NULL) { int ret; dsv_t val; /* Note: .ROBX is scaled by 1000000 in the wordlist */ ret = ds_read(list->dsh, word_robx, &val); if (ret != 0) robx = ROBX; else { /* If found, unscale; else use predefined value */ uint l_robx = val.count[IX_SPAM]; robx = l_robx ? (double)l_robx / 1000000 : ROBX; } } } if (robx < 0.0 || 1.0 < robx) { fprintf(stderr, "Invalid robx value (%f). Must be between 0.0 and 1.0\n", robx); exit(EX_ERROR); } word_free(word_robx); return; } void score_cleanup(void) { /* rstats_cleanup(); */ } #ifdef GSL_INTEGRATE_PDF static double chisq(double x, void *p) { return(gsl_ran_chisq_pdf(x, *(double *)p)); } inline static double prbf(double x, double df) { gsl_function chi; int status; double p, abserr; const int intervals = 15; const double eps = 1000 * DBL_EPSILON; gsl_integration_workspace *w; chi.function = chisq; chi.params = &df; gsl_set_error_handler_off(); w = gsl_integration_workspace_alloc(intervals); if (!w) { fprintf(stderr, "Out of memory! %s:%d\n", __FILE__, __LINE__); exit(EX_ERROR); } status = gsl_integration_qag(&chi, 0, x, eps, eps, intervals, GSL_INTEG_GAUSS41, w, &p, &abserr); if (status && status != GSL_EMAXITER) { fprintf(stderr, "Integration error: %s\n", gsl_strerror(status)); exit(EX_ERROR); } gsl_integration_workspace_free(w); p = max(0.0, 1.0 - p); return(min(1.0, p)); } #else inline static double prbf(double x, double df) { double r = gsl_cdf_chisq_Q(x, df); return (r < DBL_EPSILON) ? 0.0 : r; } #endif static double get_spamicity(size_t robn, FLOAT P, FLOAT Q) { if (robn == 0) { score.spamicity = robx; } else { double sp_df = 2.0 * robn * sp_esf; double ns_df = 2.0 * robn * ns_esf; double ln2 = log(2.0); /* ln(2) */ score.robn = robn; /* convert to natural logs */ score.p_ln = (log(P.mant) + P.exp * ln2) * sp_esf; /* invlogsum */ score.q_ln = (log(Q.mant) + Q.exp * ln2) * ns_esf; /* logsum */ score.p_pr = prbf(-2.0 * score.p_ln, sp_df); /* compute P */ score.q_pr = prbf(-2.0 * score.q_ln, ns_df); /* compute Q */ if (!fBogotune && sp_esf >= 1.0 && ns_esf >= 1.0) { score.spamicity = (1.0 + score.q_pr - score.p_pr) / 2.0; } else if (score.q_pr < DBL_EPSILON && score.p_pr < DBL_EPSILON) { score.spamicity = 0.5; } else { score.spamicity = score.q_pr / (score.q_pr + score.p_pr); } } return score.spamicity; } void msg_print_summary(const char *pfx) { if (!Rtable) { (void)fprintf(fpo, "%s%-*s %6lu %9.6f %9.6f %9.6f\n", pfx, max_token_len+2, "N_P_Q_S_s_x_md", (unsigned long)score.robn, score.p_pr, score.q_pr, score.spamicity); (void)fprintf(fpo, "%s%-*s %9.6f %9.6f %9.6f\n", pfx, max_token_len+2+6, " ", robs, robx, score.min_dev); } else { /* Trim token to 22 characters to accomodate R's default line length of 80 */ (void)fprintf(fpo, "%s%-24s %6lu %9.2e %9.2e %9.2e %9.2e %9.2e %5.3f\n", pfx, "N_P_Q_S_s_x_md", (unsigned long)score.robn, score.p_pr, score.q_pr, score.spamicity, robs, robx, score.min_dev); } } /* Done */ bogofilter-1.2.4/src/bogoreader.h0000644000175000017500000000154312163572272015121 0ustar sezsez/* $Id: bogoreader.h 6714 2008-04-20 15:27:06Z relson $ */ /** \file bogoreader.h * prototypes and definitions for bogoreader.c * * \author David Relson */ #ifndef BOGOREADER_H #define BOGOREADER_H #include "buff.h" /* Function Prototypes */ extern void bogoreader_init(int argc, const char * const *argv); extern void bogoreader_close_ifeof(void); extern void bogoreader_fini(void); void bogoreader_name(const char *name); /* Lexer-Reader Interface */ /** check if the string of \a len bytes starting at \a buf * ends with LF or CRLF */ extern bool is_eol(const char *buf, size_t len); typedef int reader_line_t(buff_t *buff); typedef bool reader_more_t(void); typedef const char *reader_file_t(void); extern reader_line_t *reader_getline; extern reader_more_t *reader_more; extern reader_file_t *reader_filename; #endif bogofilter-1.2.4/src/format.c0000644000175000017500000002645512163572304014300 0ustar sezsez/* $Id: format.c 6820 2009-02-22 20:13:08Z relson $ */ /***************************************************************************** NAME: format.c -- formats a *printf-like string for ouput Most of the ideas in here are stolen from Mutt's snprintf implementation. ******************************************************************************/ #include "common.h" #include #include #include #include #include #ifdef NEEDTRIO #include "trio.h" #endif #include "system.h" #include "bogoconfig.h" #include "bogofilter.h" #include "format.h" #include "score.h" #include "token.h" #include "xstrdup.h" /* Function Prototypes */ static size_t format_float( char *dest, double val, int min, int prec, int flags, const char *destend); static size_t format_string(char *dest, const char *val, int min, int prec, int flags, const char *destend); static size_t format_spamicity(char *dest, const char *fmt, double spamicity, const char *destend); static void die (const char *msg, ...); static char *convert_format_to_string(char *buff, size_t size, const char *format); /* uninitialized static variables */ static const char *reg = ""; static const char *unreg = ""; static uint wrdcount = 0; static uint msgcount = 0; /* initialized static variables */ const char *spam_subject_tag = NULL; /* used in passthrough mode */ const char *unsure_subject_tag = NULL; /* used in passthrough mode */ /* ** formatting characters: ** ** XXX FIXME XXX this list is outdated and needs revision or removal ** ** h - spam_header_name, e.g. "X-Bogosity" ** ** c - classification, e.g. Yes/No, Spam/Ham/Unsure, +/-/? ** ** D - date, fixed ISO-8601 format for Universal Time ("GMT") ** ** e - spamicity as 'e' format ** f - spamicity as 'f' format ** g - spamicity as 'g' format ** ** l - logging tag (from '-l' option) ** ** o - spam_cutoff, ex. cutoff=%c ** ** r - runtype ** w - word count ** m - message count ** ** u - user name, f. i. "login=%u" ** ** v - version, ex. "version=%v" */ const char *header_format = "%h: %c, tests=bogofilter, spamicity=%p, version=%v"; const char *terse_format = "%1.1c %f"; const char *log_header_format = "%h: %c, spamicity=%p, version=%v"; const char *log_update_format = "register-%r, %w words, %m messages"; #define RC_COUNT 3 #ifdef DEAD_CODE static FIELD spamicity_tags_ynu[RC_COUNT] = { "Yes", "No", "Unsure" }; #endif static FIELD spamicity_tags_shu[RC_COUNT] = { "Spam", "Ham", "Unsure" }; static FIELD spamicity_format_d[RC_COUNT] = { "%0.6f", "%0.6f", "%0.6f" }; FIELD *spamicity_tags = spamicity_tags_shu; FIELD *spamicity_formats = spamicity_format_d; /* Descriptors for config file */ /* enums */ enum states { S_DEFAULT, S_FLAGS, S_MIN, S_DOT, S_PREC, S_CONV }; enum flags { F_ZERO = 1, F_FP_E = 2, F_FP_F = 4, F_FP_G = 8, F_DELTA = 16, F_PREC = 32 }; /* Function Definitions */ void set_terse_mode_format(int mode) { switch (mode) { case 1: spamicity_tags = spamicity_tags_shu; terse_format = "%1.1c %-8.6g"; break; case 2: terse_format = "%0.16f"; break; default: fprintf(stderr, "Invalid '-T' usage\n"); exit(EX_ERROR); } } /* any fields omitted will retain their original value */ bool set_spamicity_fields(FIELD *fields, const char *val) { size_t i; /* dup the value string and break it up */ char *tmp = xstrdup(val); for (i = 0; i < RC_COUNT; i += 1) { char *tok = strtok(i ? NULL : tmp, " ,"); if (tok == NULL) break; fields[i] = tok; } return true; } bool set_spamicity_tags(const char *val) { bool ok = set_spamicity_fields(spamicity_tags, val); return ok; } bool set_spamicity_formats(const char *val) { bool ok = set_spamicity_fields(spamicity_formats, val); return ok; } static size_t format_date(char *dest, const char *destend) { struct tm *tm; time_t t; size_t l; /* must check, size_t will wrap to INT_MAX or LONG_MAX otherwise */ if (dest == destend) return 0; (void)time(&t); tm = gmtime(&t); l = strftime(dest, (size_t)(destend - dest - 1), "%Y-%m-%dT%H:%M:%SZ", tm); if (l + 1 >= (size_t)(destend - dest)) /* sanitize return */ l = 0; return l; } static size_t format_float(char *dest, double src, int min, int prec, int flags, const char *destend) { #define SIZ 20 char buf[SIZ]; const char *fmt; double s; int p; s = ! (flags & F_DELTA) ? src : 1.0 - src; if (flags & F_DELTA && s > 0.001) s = src; if (flags & F_PREC) p = prec; else p = (flags & (F_FP_F|F_FP_G)) ? 6 : 2; if (flags & F_FP_F) fmt = (flags & F_ZERO) ? "%0*.*f" : "%*.*f"; else fmt = (flags & F_ZERO) ? "%0*.*e" : "%*.*e"; if (flags & F_FP_G) fmt = (flags & F_ZERO) ? "%0*.*g" : "%*.*g"; snprintf (buf, SIZ, fmt, min, p, s); return format_string (dest, buf, 0, 0, 0, destend); } static size_t format_string(char *dest, const char *src, int min, int prec, int flags, const char *destend) { int len = (int) strlen(src); if (len > INT_MAX) { fprintf(stderr, "cannot handle string length (%lu) above %d, aborting\n", (unsigned long)len, INT_MAX); internal_error; } (void)min; /* kill compiler warning */ if (flags & F_PREC && prec < len) len = prec; if (dest + len + 1 < destend) { memcpy(dest, src, len); dest[len] = '\0'; } else { fprintf(stderr, "header format is too long.\n"); /* abort to obtain a stack backtrace */ abort(); } return len; } static size_t format_spamicity(char *dest, const char *fmt, double spamicity, const char *destend) { char temp[20]; uint len = snprintf(temp, sizeof(temp), fmt, spamicity); if (len > INT_MAX) len = INT_MAX; /* clamp */ len = format_string(dest, temp, 0, len, 0, destend); return len; } static void die (const char *msg, ...) __attribute__ ((format(printf, 1, 2))) __attribute__ ((noreturn)); static void die (const char *msg, ...) { va_list ap; va_start (ap, msg); vfprintf (stderr, msg, ap); va_end (ap); exit(EX_ERROR); } static char *convert_format_to_string(char *buff, size_t size, const char *format) { char *beg = buff; char *end = beg + size; char temp[20]; char *tptr; int state = S_DEFAULT; int min = 0; int prec = 0; int flags = 0; rc_t status = msg_status(); double spamicity = msg_spamicity(); memset(buff, '\0', size); /* for debugging */ memset(temp, '\0', sizeof(temp)); /* for debugging */ while (buff < end && *format) { switch (state) { case S_DEFAULT: if (*format == '%') state = S_FLAGS; else *buff++ = *format; format++; break; case S_FLAGS: if ('1' <= *format && *format <= '9') format++; else if (*format == '-') format++; else switch (*format) { case '0': flags |= F_ZERO; format++; break; case '#': if (status == RC_SPAM) flags |= F_DELTA; format++; break; default: state = S_MIN; break; } break; case S_MIN: if (isdigit ((unsigned char)*format)) min = min * 10 + (*format++ - '0'); else state = S_DOT; break; case S_DOT: if (*format == '.') { state = S_PREC; format++; } else { state = S_CONV; } break; case S_PREC: if (isdigit ((unsigned char)*format)) { prec = prec * 10 + (*format++ - '0'); flags |= F_PREC; } else { state = S_CONV; } break; case S_CONV: switch (*format) { case '%': *buff++ = '%'; break; case 'A': /* A - Message Address */ buff += format_string(buff, (*msg_addr->u.text != '\0') ? (const char *)msg_addr->u.text : "UNKNOWN", 0, prec, flags, end); break; case 'c': /* c - classification, e.g. Yes/No, Spam/Ham/Unsure, or YN, SHU, +-? */ { const char *val = spamicity_tags[status]; buff += format_string(buff, val, 0, prec, flags, end); break; } case 'd': /* d - spam/non-spam as delta, unsure a probability */ { const char *f = spamicity_formats[status]; if (status == RC_SPAM) spamicity = 1.0 - spamicity; buff += format_spamicity(buff, f, spamicity, end); break; } case 'D': /* D - date in ISO8601 format for GMT time zone */ { buff += format_date(buff, end); break; } case 'I': /* M - Message ID */ buff += format_string(buff, (*msg_id->u.text != '\0') ? (const char *)msg_id->u.text : "UNKNOWN", 0, prec, flags, end); break; case 'Q': /* Q - Queue ID */ buff += format_string(buff, (*queue_id->u.text != '\0') ? (const char *)queue_id->u.text : "UNKNOWN", 0, prec, flags, end); break; case 'p': /* p - spamicity as a probability */ { const char *f = spamicity_formats[status]; buff += format_spamicity(buff, f, spamicity, end); break; } case 'e': /* e - spamicity as 'e' format */ buff += format_float(buff, spamicity, min, prec, flags | F_FP_E, end); break; case 'f': /* f - spamicity as 'f' format */ buff += format_float(buff, spamicity, min, prec, flags | F_FP_F, end); break; case 'g': /* g - spamicity as 'g' format */ buff += format_float(buff, spamicity, min, prec, flags | F_FP_G, end); break; case 'h': /* h - spam_header_name, e.g. "X-Bogosity" */ buff += format_string(buff, spam_header_name, 0, prec, flags, end); break; case 'l': /* l - logging tag */ buff += format_string(buff, logtag, 0, prec, flags, end); break; case 'o': /* o - spam_cutoff, ex. cutoff=%c */ buff += format_float(buff, spam_cutoff, min, prec, flags, end); break; case 'r': /* r - run type (s, n, S, or N) - two parts (reg/unreg)*/ snprintf( temp, sizeof(temp), "%s%s", reg, unreg ); buff += format_string(buff, temp, 0, 0, 0, end); break; case 'u': /* u - user name */ { struct passwd *p; tptr = getlogin(); if (!tptr) { if ((p = getpwuid(getuid()))) { tptr = p->pw_name; } else { snprintf(temp, sizeof(temp), "#%ld", (long)getuid()); tptr = temp; } } buff += format_string(buff, tptr, 0, prec, flags, end); } break; case 'w': /* w - word count */ snprintf( temp, sizeof(temp), "%u", wrdcount ); buff += format_string(buff, temp, 0, 0, 0, end); break; case 'm': /* m - message count */ snprintf( temp, sizeof(temp), "%u", msgcount ); buff += format_string(buff, temp, 0, 0, 0, end); break; case 'v': /* v - version, ex. "version=%v" */ buff += format_string(buff, version, 0, prec, flags, end); break; default: die ("unknown header format directive: '%c'\n", *format); break; } format += 1; prec = min = flags = 0; state = S_DEFAULT; break; default: break; } } *buff = '\0'; return beg; } char *format_header(char *buff, size_t size) { return convert_format_to_string( buff, size, header_format ); } char *format_terse(char *buff, size_t size) { return convert_format_to_string( buff, size, terse_format ); } void format_set_counts(uint _wrd, uint _msg) { wrdcount = _wrd; msgcount = _msg; } char *format_log_update(char *buff, size_t size, const char *_reg, const char *_unreg) { reg = _reg; unreg = _unreg; return convert_format_to_string( buff, size, log_update_format ); } char *format_log_header(char *buff, size_t size) { return convert_format_to_string( buff, size, log_header_format ); } /* vim:set ts=8 sw=4 sts=4:*/ bogofilter-1.2.4/src/bogomain.h0000644000175000017500000000022712163572304014575 0ustar sezsez/* $Id: bogomain.h 4830 2004-10-15 01:32:59Z relson $ */ #ifndef BOGOMAIN_H #define BOGOMAIN_H extern ex_t bogomain(int argc, char **argv); #endif bogofilter-1.2.4/src/maint.h0000644000175000017500000000135612163572304014116 0ustar sezsez/* $Id: maint.h 6053 2005-06-13 00:59:18Z relson $ */ #ifndef MAINT_H #define MAINT_H #include #include "datastore.h" #define AGE_IS_YDAY #undef AGE_IS_YDAY #undef AGE_IS_YYYYMMDD #define AGE_IS_YYYYMMDD extern uint32_t thresh_count; extern YYYYMMDD thresh_date; extern size_t size_min, size_max; extern bool timestamp_tokens; extern bool replace_nonascii_characters; extern bool upgrade_wordlist_version; /* Function Prototypes */ ex_t maintain_wordlist_file(bfpath *bfp); bool discard_token(word_t *token, dsv_t *info); bool do_replace_nonascii_characters(byte *, size_t); void set_today(void); void set_date(YYYYMMDD date); time_t long_to_date(long l); YYYYMMDD string_to_date(const char *s); #endif /* MAINT_H */ bogofilter-1.2.4/src/getopt_long_chk.c0000644000175000017500000000167712163572272016161 0ustar sezsez#include "config.h" #include "longoptions.h" #include #include enum state { NO = no_argument, REQ = required_argument, OPT = optional_argument }; int getopt_long_chk(int argc, char * const argv[], char const *optstring, const struct option *longopts, int *longindex) { const char *p = optstring; enum state want; int error = 0; while(p && *p) { if (!(*p == '?' || *p == '-')) { if (p[1] == ':') { if (p[2] == ':') want = OPT; else want = REQ; } else want = NO; int i = 0; if (longopts) { while (longopts[i].name) { if (longopts[i].val == *p && longopts[i].has_arg != (int)want) { fprintf(stderr, "option '%c' == '%s' mismatch: short %d long %d\n", *p, longopts[i].name, want, longopts[i].has_arg); error = 1; } i++; } } } p++; } if (error) abort(); return getopt_long(argc, argv, optstring, longopts, longindex); } bogofilter-1.2.4/src/qp.c0000644000175000017500000000565712163572304013431 0ustar sezsez/* $Id: qp.c 6835 2009-05-28 12:44:44Z m-a $ */ /***************************************************************************** NAME: qp.c -- decode quoted printable text AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include "qp.h" /* Local Variables */ static byte qp_xlate2045[256]; static byte qp_xlate2047[256]; static int hex_to_bin(byte c) { switch (c) { case '0': return 0; case '1': return 1; case '2': return 2; case '3': return 3; case '4': return 4; case '5': return 5; case '6': return 6; case '7': return 7; case '8': return 8; case '9': return 9; case 'a': case 'A': return 10; case 'b': case 'B': return 11; case 'c': case 'C': return 12; case 'd': case 'D': return 13; case 'e': case 'E': return 14; case 'f': case 'F': return 15; default: return -1; } } /* Function Prototypes */ static int qp_eol_check(byte *s, byte *e); /* Function Definitions */ uint qp_decode(word_t *word, qp_mode mode) { uint size = word->leng; byte *s = word->u.text; /* src */ byte *d = word->u.text; /* dst */ byte *e = s + size; /* end */ while (s < e) { byte ch = *s++; int x, y; switch (ch) { case '=': if (mode == RFC2045) { int c = qp_eol_check(s, e); if (c != 0) { /* continuation line, trailing = */ s += c; continue; } } if (s + 2 <= e && (y = hex_to_bin(s[0])) >= 0 && (x = hex_to_bin(s[1])) >= 0) { /* encoded character */ ch = (byte) (y << 4 | x); s += 2; } break; case '_': if (mode == RFC2047) ch = ' '; break; } *d++ = ch; } /* do not stuff NUL byte here: * if there was one, it has been copied! */ return d - word->u.text; } /* rfc2047 - QP [!->@-~]+ */ static void qp_init(void) { uint i; static bool first = true; if (!first) return; first = false; for (i = 33; i <= 126; i ++) { qp_xlate2045[i] = qp_xlate2047[i] = (byte) i; } qp_xlate2045['\t'] = '\t'; /* HTAB */ qp_xlate2045[' '] = ' '; /* SP */ qp_xlate2045['='] = 0; /* illegal */ qp_xlate2047['_'] = ' '; /* SP */ qp_xlate2047['='] = 0; /* illegal */ qp_xlate2047['?'] = 0; /* illegal */ return; } bool qp_validate(const word_t *word, qp_mode mode) { uint i; const byte *qp_xlate = mode == RFC2047 ? qp_xlate2047 : qp_xlate2045; qp_init(); for (i = 0; i < word->leng; i += 1) { byte b = word->u.text[i]; byte v = qp_xlate[b]; if (v == 0) switch (b) { case '=': /* allowed in encoded words, but must be encoded */ break; default: return false; } } return true; } static int qp_eol_check(byte *s, byte *e) { if (s + 1 <= e) { /* test for LF */ if (s[0] == '\n') { /* only LF */ return 1; } if (s[0] == '\r' && s + 2 <= e && s[1] == '\n') /* CR LF */ return 2; } return 0; } bogofilter-1.2.4/src/longoptions.h0000644000175000017500000000734612163572272015372 0ustar sezsez/* $Id: longoptions.h 6993 2013-06-28 21:54:23Z m-a $ */ /***************************************************************************** NAME: longoptions.h -- definitions for longoptions.c AUTHOR: David Relson ******************************************************************************/ #ifndef OPTIONS_H #define OPTIONS_H #include "getopt.h" /* Definitions */ /** has_arg symbolic values */ enum field_e { N = 0, /* no_argument (or 0) if the option does not take an argument, */ R = 1, /* required_argument (or 1) if the option requires an argument, */ O = 2 /* optional_argument (or 2) if the option takes an optional argument. */ }; typedef enum longopts_e { O_BLOCK_ON_SUBNETS = 1000, O_CHARSET_DEFAULT, O_CONFIG_FILE, O_DB_CHECKPOINT, O_DB_LIST_LOGFILES, O_DB_PRINT_LEAFPAGE_COUNT, O_DB_PRINT_PAGESIZE, O_DB_PRUNE, O_DB_RECOVER, O_DB_RECOVER_HARDER, O_DB_REMOVE_ENVIRONMENT, O_DB_VERIFY, O_DB_LOG_AUTOREMOVE, O_DB_TRANSACTION, O_DB_TXN_DURABLE, O_NS_ESF, O_SP_ESF, O_HAM_CUTOFF, O_HAM_TRUE, O_HEADER_FORMAT, O_LOG_HEADER_FORMAT, O_LOG_UPDATE_FORMAT, O_MIN_DEV, O_MIN_TOKEN_LEN, O_MAX_TOKEN_LEN, O_MAX_MULTI_TOKEN_LEN, O_MULTI_TOKEN_COUNT, O_REPLACE_NONASCII_CHARACTERS, O_ROBS, O_ROBX, O_SPAM_CUTOFF, O_SPAM_HEADER_NAME, O_SPAM_HEADER_PLACE, O_SPAM_SUBJECT_TAG, O_SPAMICITY_FORMATS, O_SPAMICITY_TAGS, O_STATS_IN_HEADER, O_TERSE, O_TERSE_FORMAT, O_THRESH_UPDATE, O_TOKEN_COUNT_FIX, O_TOKEN_COUNT_MIN, O_TOKEN_COUNT_MAX, O_TIMESTAMP, O_UNICODE, O_UNSURE_SUBJECT_TAG, O_USER_CONFIG_FILE, O_WORDLIST } longopts_t; #ifndef DISABLE_UNICODE #define UNICODE_OPTION \ { "unicode", R, 0, O_UNICODE }, #else #define UNICODE_OPTION #endif /* common options */ #define LONGOPTIONS_COMMON \ { "config-file", R, 0, O_CONFIG_FILE }, \ { "no-config-file", N, 0, 'C' }, \ { "help", N, 0, 'h' }, \ { "input-file", R, 0, 'I' }, \ { "output-file", R, 0, 'O' }, \ { "min-token-len", R, 0, O_MIN_TOKEN_LEN }, \ { "max-token-len", R, 0, O_MAX_TOKEN_LEN }, \ { "max-multi-token-len", R, 0, O_MAX_MULTI_TOKEN_LEN }, \ { "multi-token-count", R, 0, O_MULTI_TOKEN_COUNT }, \ UNICODE_OPTION \ { "version", N, 0, 'V' }, \ { "verbosity", N, 0, 'v' }, /* options for bogofilter */ #define LONGOPTIONS_MAIN \ { "ham-true" , N, 0, O_HAM_TRUE }, /* options for bogofilter */ #define LONGOPTIONS_MAIN_TUNE \ { "token-count" , R, 0, O_TOKEN_COUNT_FIX }, \ { "token-count-min" , R, 0, O_TOKEN_COUNT_MIN }, \ { "token-count-max" , R, 0, O_TOKEN_COUNT_MAX }, /* options for bogofilter and bogolexer */ #define LONGOPTIONS_LEX \ { "block-on-subnets", R, 0, O_BLOCK_ON_SUBNETS }, \ { "charset-default", R, 0, O_CHARSET_DEFAULT }, \ { "user-config-file", R, 0, O_USER_CONFIG_FILE }, \ { "replace-nonascii-characters", R, 0, O_REPLACE_NONASCII_CHARACTERS }, /* options for bogolexer and bogoutil */ #define LONGOPTIONS_LEX_UTIL /* options for bogofilter and bogoutil - some preprocessor workarounds here */ #define lo1 #define lo2 #ifdef HAVE_DECL_DB_CREATE #undef lo1 #define lo1 \ { "db-log-autoremove", R, 0, O_DB_LOG_AUTOREMOVE }, #ifdef FUTURE_DB_OPTIONS #undef lo2 #define lo2 \ { "db-txn-durable", R, 0, O_DB_TXN_DURABLE }, #endif #endif #define LONGOPTIONS_DB \ { "db-transaction", R, 0, O_DB_TRANSACTION }, \ { "timestamp-date", R, 0, 'y' }, \ lo1 lo2 extern int getopt_long_chk(int argc, char * const argv[], char const *optstring, const struct option *longopts, int *longindex); #endif bogofilter-1.2.4/src/bogotune.c0000644000175000017500000013332212163572304014622 0ustar sezsez/* $Id: bogotune.c 6993 2013-06-28 21:54:23Z m-a $ */ /***************************************************************************** NAME: bogotune.c -- determine optimal parameters for bogofilter AUTHORS: Greg Louis - perl version David Relson - C version Matthias Andree - options parser usability ******************************************************************************/ /* To allow tuning of large corpora, the memory use must be minimized ** for each messages. Given the wordlist in ram, foreach token of a ** test message bogotune only needs to know its spam and ham counts. ** ** 1. external wordlist ("-d") flag ** a. read wordlist.db ** b. read messages for test set ** 1. lookup words in wordlist ** 2. discard words ** c. replace wordhashs with wordcnts ** d. de-allocate resident wordlist ** ** 2. internal wordlist ("-D") flag ** a. read all messages ** b. distribute messages ** 1. proper pct to wordlist ** 2. proper pct to test set ** 2a. create wordprops from wordlists ** c. replace wordprops with wordcnts ** d. de-allocate resident wordlist */ /* Limitations: ** ** If all the input messages are in msg-count format, ** bogotune will use default ROBX value since an external ** wordlist is needed to compute a real robx value. */ #include "common.h" #include #include #include #include #include #include #include "bogotune.h" #include "bogoconfig.h" #include "bogoreader.h" #include "bool.h" #include "collect.h" #include "datastore.h" #include "longoptions.h" #include "msgcounts.h" #include "mime.h" #include "mxcat.h" #include "paths.h" #include "robx.h" #include "score.h" #include "token.h" #include "tunelist.h" #include "wordhash.h" #include "wordlists.h" #include "xmalloc.h" #include "xstrdup.h" #undef HAM_CUTOFF /* ignore value in score.h */ #undef SPAM_CUTOFF /* ignore value in score.h */ #define TEST_COUNT 500u /* minimum allowable message count */ #define LIST_COUNT 2000u /* minimum msg count in tunelist */ #define PREF_COUNT 4000u /* preferred message count */ #define LARGE_COUNT 40000u #define HAM_CUTOFF 0.10 #define MIN_HAM_CUTOFF 0.10 /* minimum final ham_cutoff */ #define MAX_HAM_CUTOFF 0.45 /* maximum final ham_cutoff */ #define MIN_CUTOFF 0.55 /* minimum cutoff for set_thresh() */ #define WARN_MIN 0.50 /* warning minimum for set_thresh() */ #define WARN_MAX 0.99 /* warning maximum for set_thresh() */ #define MAX_CUTOFF 0.99 /* maximum cutoff for set_thresh() */ #define SPAM_CUTOFF 0.975 #define FP_CUTOFF 0.999 #define SCAN_CUTOFF 0.500 /* skip scans if cutoff is less or equal */ #define CHECK_PCT 0.01 /* for checking high scoring non-spam ** and low scoring spam */ /* bogotune's default parameters */ #define DEFAULT_ROBS ROBS /* 0.0178 */ #define DEFAULT_ROBX ROBX /* 0.5200 */ #define DEFAULT_MIN_DEV 0.02 /* coarse scan parms */ #define MD_MIN_C 0.06 /* smallest min_dev to test */ #define MD_MAX_C 0.38 /* largest min_dev to test */ #define MD_DLT_C 0.08 /* increment */ /* fine scan parms */ #define MD_MIN_F 0.02 #define MD_MAX_F MD_MAX_C+MD_DLT_F #define MD_DLT_F 0.014 /* robx limits */ #define RX_MIN 0.4 #define RX_MAX 0.6 enum e_verbosity { SUMMARY = 1, /* summarize main loop iterations */ TIME = 2, /* include timing info */ PARMS = 3, /* print parameter sets (rs, md, rx) */ SCORE_SUMMARY = 5, /* verbosity level for printing scores */ SCORE_DETAIL /* verbosity level for printing scores */ }; typedef enum e_ds_loc { DS_NONE = 0, /* datastore locn not specified */ DS_ERR = 1, /* error in datastore locn spec */ DS_DSK = 2, /* datastore on disk */ DS_RAM = 4 /* datastore in ram */ } ds_loc; #define MOD(n,m) ((n) - (floor((n)/(m)))*(m)) #define ROUND(m,n) floor((m)*(n)+.5)/(n) #define MIN(n) ((n)/60) #define SECONDS(n) ((n) - MIN(n)*60) #define KEY(r) ((r)->fn + (((r)->co > 0.5) ? (r)->co : 0.99)) #define ESF_SEL(a,b) (!esf_flag ? (a) : (b)) /* Global Variables */ const char *progname = "bogotune"; static char *ds_path; /* directory */ static ds_loc ds_flag = DS_NONE; static void *env = NULL; static bool esf_flag = true; /* test ESF factors if true */ static bool exit_zero = false; /* non-error exits zero */ static const char *bogolex_file = NULL; /* non-NULL if creating msg-count output */ static word_t *w_msg_count; static uint message_count; static wordhash_t *train; static tunelist_t *ns_and_sp; static tunelist_t *ns_msglists, *sp_msglists; static flhead_t *spam_files, *ham_files; typedef struct { uint cnt; double *data; } data_t; static data_t *rsval; static data_t *rxval; static data_t *mdval; static data_t *spexp; static data_t *nsexp; static uint target; static uint ns_cnt, sp_cnt; static double spex, nsex; static double check_percent; /* initial check for excessively high/low scores */ static double *ns_scores; static double *sp_scores; static double user_robx = 0.0; /* from option '-r value' */ static uint coerced_target = 0; /* user supplied with '-T value' */ static uint ncnt, nsum; /* neighbor count and sum - for gfn() averaging */ #undef TEST #ifdef TEST uint test = 0; #endif bool fMakeCheck = false; /* allows quick & dirty regression testing */ uint cMakeCheck = 50; /* ... for 50 cycles */ const char *logtag = NULL; /* Function Declarations */ /* Function Definitions */ static void bt_trap(void) {} static bool get_bool(const char *name, const char *arg) { bool b = str_to_bool(arg); if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> %s\n", name, b ? "Yes" : "No"); return b; } static int get_cnt(double fst, double lst, double amt) { int cnt = (fabs(lst - fst) + EPS) / (fabs(amt) - EPS) + 1; return cnt; } static data_t *seq_by_amt(double fst, double lst, double amt) { uint i; data_t *val = xcalloc(1, sizeof(data_t)); val->cnt = get_cnt(fst, lst, amt); val->data = xcalloc(val->cnt, sizeof(double)); for (i = 0; i < val->cnt; i += 1) val->data[i] = fst + i * amt; return val; } static data_t *seq_canonical(double fst, double amt) { uint c; float v; uint i = 0; data_t *val = xcalloc(1, sizeof(data_t)); val->data = xcalloc(5, sizeof(double)); fst = max(fst, RX_MIN); fst = min(fst, RX_MAX); val->data[i++] = fst; for (c = 1; c <= 2; c += 1) { v = fst - amt * c; if (v >= RX_MIN) val->data[i++] = v; v = fst + amt * c; if (v <= RX_MAX) val->data[i++] = v; } val->cnt = i; return val; } static data_t *seq_by_pow(double fst, double lst, double amt) { uint i; data_t *val = xcalloc(1, sizeof(data_t)); val->cnt = get_cnt(fst, lst, amt); val->data = xcalloc(val->cnt, sizeof(double)); for (i = 0; i < val->cnt; i += 1) val->data[i] = pow(10, fst + i * amt); return val; } static void data_free(data_t *val) { xfree(val->data); xfree(val); } static void init_coarse(double _rx) { rxval = seq_canonical(_rx, 0.05); rsval = seq_by_pow(0.0, -2.0, -1.0); mdval = seq_by_amt(MD_MIN_C, MD_MAX_C, MD_DLT_C); spexp = seq_by_amt(ESF_SEL(0.0,2.0), ESF_SEL(0.0,20.0), 3.0); nsexp = seq_by_amt(ESF_SEL(0.0,2.0), ESF_SEL(0.0,20.0), 3.0); } static void init_fine(double _rs, double _md, double _rx, double _spex, double _nsex) { double s0, s1; s0 = max(log10(_rs) - 0.5, -2.0); s1 = min(log10(_rs) + 0.5, 0.0); rsval = seq_by_pow(s1, s0, -0.25); s0 = max(_md - 0.042, MD_MIN_F); s1 = min(_md + 0.042, MD_MAX_F); mdval = seq_by_amt(s0, s1, MD_DLT_F); rxval = seq_canonical(_rx, 0.013); s0 = max(_spex - 1.5, 0.0); s1 = min(_spex + 1.5, 20.0); spexp = seq_by_amt(s0, ESF_SEL(s0,s1), 0.5); s0 = max(_nsex - 1.5, 0.0); s1 = min(_nsex + 1.5, 20.0); nsexp = seq_by_amt(s0, ESF_SEL(s0,s1), 0.5); } static void print_parms(const char *label, const char *format, data_t *data) { uint i; printf(" %s: %2u ", label, data->cnt); for (i = 0; i < data->cnt; i += 1) { printf("%s", (i == 0) ? " (" : ", "); printf(format, data->data[i]); /* RATS: ignore */ } printf(")\n"); fflush(stdout); } static void print_all_parms(uint r_count) { if (verbose >= PARMS) { print_parms("rsval", "%6.4f", rsval); print_parms("rxval", "%5.3f", rxval); print_parms("mdval", "%5.3f", mdval); print_parms("spexp", "%5.2f", spexp); print_parms("nsexp", "%5.2f", nsexp); } if (verbose >= TIME) printf("cnt: %u (rs: %u, rx: %u, md: %u spex: %u, nsex: %u)\n", r_count, rsval->cnt, rxval->cnt, mdval->cnt, spexp->cnt, nsexp->cnt); } static int compare_ascending(const void *const ir1, const void *const ir2) { const double d1 = *(const double *)ir1; const double d2 = *(const double *)ir2; if (d1 - d2 > 0.0) return 1; if (d2 - d1 > 0.0) return -1; return 0; } static int compare_descending(const void *const ir1, const void *const ir2) { const double d1 = *(const double *)ir1; const double d2 = *(const double *)ir2; if (d1 - d2 > 0.0) return -1; if (d2 - d1 > 0.0) return +1; return 0; } #define CO(r) ((r->co > 0.5) ? r->co : 0.99) static int compare_results(const void *const ir1, const void *const ir2) { result_t const *r1 = (result_t const *)ir1; result_t const *r2 = (result_t const *)ir2; if (KEY(r1) > KEY(r2)) return 1; if (KEY(r2) > KEY(r1)) return -1; /* Favor cutoffs > 0.5 */ if (CO(r1) > CO(r2) ) return 1; if (CO(r2) > CO(r1) ) return -1; if (r1->idx > r2->idx ) return 1; if (r2->idx > r1->idx ) return -1; return 0; } /* Score all non-spam */ static void score_ns(double *results) { uint i; uint count = 0; if (verbose >= SCORE_DETAIL) printf("ns:\n"); verbose = -verbose; /* disable bogofilter debug output */ for (i = 0; i < COUNTOF(ns_msglists->u.sets); i += 1) { mlhead_t *list = ns_msglists->u.sets[i]; mlitem_t *item; for (item = list->head; item != NULL; item = item->next) { wordhash_t *wh = item->wh; double score = msg_compute_spamicity(wh); results[count++] = score; if ( -verbose == SCORE_DETAIL || (-verbose >= SCORE_DETAIL && EPS < score && score < 1 - EPS)) printf("%6u %0.16f\n", count-1, score); } } verbose = -verbose; /* enable bogofilter debug output */ qsort(results, count, sizeof(double), compare_descending); return; } static bool check_for_high_ns_scores(void) { uint t = ceil(ns_cnt * check_percent); score_ns(ns_scores); /* scores in descending order */ /* want at least 1 high scoring non-spam for FP determination */ if (ns_scores[t-1] < SPAM_CUTOFF) return false; if (!quiet) { fprintf(stderr, "Warning: test messages include many high scoring nonspam.\n"); fprintf(stderr, " You may wish to reclassify them and rerun.\n"); } return true; } /* Score all spam to determine false negative counts */ static void score_sp(double *results) { uint i; uint count = 0; if (verbose >= SCORE_DETAIL) printf("sp:\n"); verbose = -verbose; /* disable bogofilter debug output */ for (i = 0; i < COUNTOF(sp_msglists->u.sets); i += 1) { mlhead_t *list = sp_msglists->u.sets[i]; mlitem_t *item; for (item = list->head; item != NULL; item = item->next) { wordhash_t *wh = item->wh; double score = msg_compute_spamicity(wh); results[count++] = score; if ( -verbose == SCORE_DETAIL || (-verbose >= SCORE_DETAIL && EPS < score && score < 1 - EPS)) printf("%6u %0.16f\n", count-1, score); } } verbose = -verbose; /* enable bogofilter debug output */ qsort(results, count, sizeof(double), compare_ascending); return; } static uint get_fn_count(uint count, double *results) { uint i; uint fn = 0; for (i = 0; i < count; i += 1) { double score = results[i]; if (score < spam_cutoff) fn += 1; } return fn; } static bool check_for_low_sp_scores(void) { uint t = ceil(sp_cnt * check_percent); score_sp(sp_scores); /* get scores */ /* low scoring spam may cause problems ... */ if (sp_scores[t-1] > HAM_CUTOFF) return false; if (!quiet) { fprintf(stderr, "Warning: test messages include many low scoring spam.\n"); fprintf(stderr, " You may wish to reclassify them and rerun.\n"); } return true; } static void scoring_error(void) { int i; if (quiet) return; printf(" high ham scores:\n"); for (i = 0; i < 10 && ns_scores[i] > SPAM_CUTOFF; i += 1) printf(" %2d %8.6f\n", i+1, ns_scores[i]); printf(" low spam scores:\n"); for (i = 0; i < 10 && sp_scores[i] < HAM_CUTOFF; i += 1) printf(" %2d %8.6f\n", i+1, sp_scores[i]); } #ifdef TEST static char flag(uint idx, uint cnt, uint dlt) { if (dlt == 0) return ' '; if (idx < cnt) return '+'; else return '-'; } #endif #ifdef TEST static void print_ns_scores(uint beg, uint cnt, uint dlt) { uint i, m = min(cnt + dlt, ns_cnt); printf("ns:\n"); for (i = beg; i <= m; i += 1) printf(" %3d %0.16f %c\n", i+1, ns_scores[i], flag(i, cnt, dlt)); } #endif #ifdef TEST static void print_sp_scores(uint beg, uint cnt, uint dlt) { uint i, m = min(cnt + dlt, sp_cnt); printf("sp:\n"); for (i = beg; i <= m; i += 1) printf(" %3d %0.16f %c\n", i+1, sp_scores[i], flag(i, cnt, dlt)); } #endif static double scale(uint cnt, uint lo, uint hi, double beg, double end) { double ans; if (cnt < lo) return beg; if (cnt > hi) return end; ans = beg + (end - beg) * (cnt - lo ) / (hi - lo); return ans; } /* compute scores and set global variables: ** ** target ** spam_cutoff ** ** As count increases from 500 to 4000 ... ** 1) initial target percent drops from 1% to 0.25% ** 2) initial minimum target increases from 5 to 10 */ static void set_thresh(uint count, double *scores) { uint ftarget = 0; double cutoff, lgc; score_ns(scores); /* get scores */ /* ** Use parabolic curve to fit data ** message counts: (70814, 12645, 2118, 550) ** target values: ( 22, 18, 8, 1) */ lgc = log(count); ftarget = max(ROUND(((-0.4831 * lgc) + 12.8976) * lgc - 61.5264, 1.0), 1); while (1) { cutoff = ns_scores[ftarget-1]; if (verbose >= PARMS) printf("m: cutoff %8.6f, ftarget %u\n", cutoff, ftarget); if (ftarget == 1 || cutoff >= MIN_CUTOFF) break; ftarget -= 1; } /* ensure cutoff is below SPAM_CUTOFF */ if (cutoff > SPAM_CUTOFF) { while (cutoff > SPAM_CUTOFF && ++ftarget < count) { cutoff = scores[ftarget-1]; if (verbose >= PARMS) printf("s: cutoff %8.6f, ftarget %u%%\n", cutoff, ftarget); } cutoff = SPAM_CUTOFF; --ftarget; if (verbose >= PARMS) printf("s: cutoff %8.6f, ftarget %u%%\n", cutoff, ftarget); } if (cutoff < WARN_MIN || cutoff > WARN_MAX) { if (!quiet) { fprintf(stderr, "%s high-scoring non-spams in this data set.\n", (cutoff < WARN_MIN) ? "Too few" : "Too many"); fprintf(stderr, "At target %u, cutoff is %8.6f.\n", ftarget, cutoff); } } #ifdef TEST if (verbose >= PARMS) print_ns_scores(ftarget-4, ftarget+4, 0); #endif target = ftarget; spam_cutoff = cutoff; return; } static void init_count(void) { message_count = 0; } static void print_final_count(void) { if (verbose) { if (!fMakeCheck) printf("\r \r"); printf("%u messages\n", message_count); fflush(stdout); } } static int update_count(void) { message_count += 1; if (verbose && (message_count % 100) == 0 && !fMakeCheck) { if ((message_count % 1000) != 0) putchar('.'); else printf("\r \r%u ", message_count ); fflush(stdout); } return message_count; } static unsigned int calc_db_cachesize(void) { struct stat fst; if (!stat(ds_path, &fst)) { int dbc = ceil((double)fst.st_size / (3 * 1024 * 1024)); return ((unsigned int)dbc); } else { fprintf(stderr, "Unable to stat %s\n", ds_path); exit (EX_ERROR); } } static void load_wordlist(ds_foreach_t *hook, void *userdata) { bfpath *bfp = bfpath_create(ds_path); if (!bfpath_check_mode(bfp, BFP_MUST_EXIST)) { fprintf(stderr, "Can't open wordlist '%s'\n", bfp->filepath); exit(EX_ERROR); } if (verbose) { printf("Reading %s\n", ds_path); fflush(stdout); } ds_oper(env, bfp, DS_READ, hook, userdata); bfpath_free(bfp); return; } static int load_hook(word_t *key, dsv_t *data, void *userdata) /* returns 0 if ok, 1 if not ok */ { wordprop_t *tokenprop = wordhash_insert(train, key, sizeof(wordprop_t), &wordprop_init); (void) userdata; /* quiet compiler complaint */ tokenprop->cnts.bad = data->spamcount; tokenprop->cnts.good = data->goodcount; if (word_cmps(key, ".MSG_COUNT") == 0) set_msg_counts(data->goodcount, data->spamcount); if (word_cmps(key, ".ENCODING") == 0) { if (encoding == E_UNKNOWN) encoding = data->spamcount; if (encoding != data->spamcount) { fprintf(stderr, "Can't mix database encodings, i.e. utf-8 and any other.\n"); exit(EX_ERROR); } } return 0; } static void set_train_msg_counts(wordhash_t *wh) { (void)wordhash_insert(wh, w_msg_count, sizeof(wordprop_t), NULL); if (msgs_good == 0 && msgs_bad == 0) { fprintf(stderr, "Can't find '.MSG_COUNT'.\n"); exit(EX_ERROR); } } /* write_msgcount_file() ** ** Create a message count file from the original messages */ static void print_msgcount_entry(const char *token, uint bad, uint good) { printf("\"%s\" %u %u\n", token, bad, good); } static void write_msgcount_file(wordhash_t *wh) { hashnode_t *hn; print_msgcount_entry(".MSG_COUNT", msgs_bad, msgs_good); for (hn = wordhash_first(wh); hn != NULL; hn = wordhash_next(wh)) { word_t *token = hn->key; wordprop_t *wp = (wordprop_t *) hn->data; wordcnts_t *cnts = &wp->cnts; if (cnts->good == 0 && cnts->bad == 0) { wp = wordhash_search(train, token, 0); if (wp) { cnts->good = wp->cnts.good; cnts->bad = wp->cnts.bad; } } print_msgcount_entry((char *)token->u.text, cnts->bad, cnts->good); } return; } static uint read_mailbox(const char *arg, mlhead_t *msgs) { if (verbose) { printf("Reading %s\n", arg); fflush(stdout); } init_count(); mbox_mode = true; bogoreader_init(1, &arg); while ((*reader_more)()) { wordhash_t *whp = NULL; wordhash_t *whc = wordhash_new(); collect_words(whc); if (ds_path != NULL && (msgs_good + msgs_bad) == 0) set_train_msg_counts(whc); if (whc->count == 0 && !quiet) { printf("msg #%u, count is %u\n", message_count, whc->count); bt_trap(); } if (bogolex_file != NULL) { wordhash_sort(whc); lookup_words(whc); write_msgcount_file(whc); } else if (whc->count != 0) { if (!msg_count_file) whp = convert_wordhash_to_propslist(whc, train); else whp = convert_propslist_to_countlist(whc); msglist_add(msgs, whp); } update_count(); if (whc != whp) wordhash_free(whc); } print_final_count(); ns_and_sp->count += message_count; bogoreader_fini(); return message_count; } static uint filelist_read(int mode, flhead_t *list) { uint count = 0; flitem_t *item; mlhead_t *msgs = (mode == REG_GOOD) ? ns_msglists->msgs : sp_msglists->msgs; run_type = mode; for (item = list->head; item != NULL; item = item->next) { lexer = NULL; msg_count_file = false; count += read_mailbox(item->name, msgs); } return count; } /* distribute() ** ** Proportionally distribute messages between training and scoring sets. ** ** Method: ** If only 2500 messages, use 2000 for training and 500 for scoring. ** If over 4000 messages, use equal numbers for training and scoring. ** In between 2500 and 4000, do a proportional distribution. */ static void distribute(int mode, tunelist_t *ns_or_sp) { int good = mode == REG_GOOD; int bad = 1 - good; bool divvy = ds_flag == DS_RAM && user_robx < EPS && !msg_count_file; mlitem_t *item; mlhead_t *msgs = ns_or_sp->msgs; int score_count = 0; int train_count = 0; static int train_good = 0; static int train_bad = 0; double ratio = scale(msgs->count, LIST_COUNT + TEST_COUNT, /* small count */ LIST_COUNT + LIST_COUNT, /* large count */ LIST_COUNT / TEST_COUNT, /* small ratio */ LIST_COUNT / LIST_COUNT); /* large ratio */ for (item = msgs->head; item != NULL; item = item->next) { wordhash_t *wh = item->wh; /* training set */ if (divvy && train_count / ratio < score_count + 1) { wordhash_set_counts(wh, good, bad); wordhash_add(train, wh, &wordprop_init); train_count += 1; wordhash_free(wh); train_good += good; train_bad += bad; } /* scoring set */ else { uint bin = divvy ? MOD(score_count,3) : 0; msglist_add(ns_or_sp->u.sets[bin], wh); score_count += 1; } item->wh = NULL; } if (divvy) { wordhash_insert(train, w_msg_count, sizeof(wordprop_t), &wordprop_init); set_msg_counts(train_good, train_bad); } if (verbose > 1) printf("%s: train_count = %d, score_count = %d\n", good ? "ns" : "sp", train_count, score_count); return; } static void create_countlists(tunelist_t *ns_or_sp) { uint i; uint c = COUNTOF(ns_or_sp->u.sets); for (i = 0; i < c; i += 1) { mlhead_t *list = ns_or_sp->u.sets[i]; mlitem_t *item; for (item = list->head; item != NULL; item = item->next) { wordhash_t *who = item->wh; wordhash_t *whn = convert_propslist_to_countlist(who); if (whn != who) { wordhash_free(who); item->wh = whn; } } } return; } static void print_version(void) { (void)fprintf(stderr, "%s version %s\n" " Database: %s\n" "Copyright (C) 2002-2006 Greg Louis, David Relson\n\n" "%s comes with ABSOLUTELY NO WARRANTY. " "This is free software, and\nyou are welcome to " "redistribute it under the General Public License. " "See\nthe COPYING file with the source distribution for " "details.\n" "\n", progtype, version, ds_version_str(), PACKAGE); } static void help(void) { (void)fprintf(stderr, "Usage: %s [options] { -c config } { -d directory } -n non-spam-file -s spam-file\n", progname); (void)fprintf(stderr, "\t -h - print this help message.\n" "\t -C - don't read standard config files.\n" "\t -c file - read specified config file.\n" "\t -D - don't read a wordlist file.\n" "\t -d path - specify directory for wordlists.\n" "\t -E - disable ESF (effective size factor) tuning.\n" "\t -M file - rewrite input file in message count format.\n" "\t -r num - specify robx value\n"); (void)fprintf(stderr, "\t -T num - specify fp target value\n" "\t -s file1 file2 ... - spam files\n" "\t -n file1 file2 ... - non-spam files\n" "\t -v - increase level of verbose messages\n" "\t -q - quiet (suppress warnings)\n" ); (void)fprintf(stderr, "\n" "%s (version %s) is part of the bogofilter package.\n", progname, version); } static struct option longopts_bogotune[] = { /* longoptions.h - common options */ LONGOPTIONS_COMMON LONGOPTIONS_MAIN_TUNE /* longoptions.h - bogofilter/-lexer options */ LONGOPTIONS_LEX /* end of list */ { NULL, 0, 0, 0 } }; static int process_arglist(int argc, char **argv) { int count = 1; bulk_mode = B_CMDLINE; #ifdef __EMX__ _response (&argc, &argv); /* expand response files (@filename) */ _wildcard (&argc, &argv); /* expand wildcards (*.*) */ #endif #define OPTIONS ":-:c:Cd:DeEM:n:qr:s:tT:vVx:" while (1) { int option; int option_index = 0; const char *val; option = getopt_long_chk(argc, argv, OPTIONS, longopts_bogotune, &option_index); if (option == -1) break; val = optarg; process_arg(option, NULL, val, PR_NONE, PASS_1_CLI); } if (ds_flag == DS_NONE) /* default is "wordlist on disk" */ ds_flag = DS_DSK; if (ds_flag == DS_ERR) { fprintf(stderr, "Only one '-d dir' or '-D' option is allowed.\n"); exit(EX_ERROR); } if (bogolex_file == NULL && (spam_files->count == 0 || ham_files->count == 0)) { fprintf(stderr, "Bogotune needs both non-spam and spam message sets for its parameter testing.\n"); exit(EX_ERROR); } if (!suppress_config_file) process_config_files(false, longopts_bogotune); return count; } int process_arg(int option, const char *name, const char *val, priority_t precedence, arg_pass_t pass) { static int lastmode = -1; (void) name; /* suppress compiler warning */ (void) precedence; /* suppress compiler warning */ (void) pass; /* suppress compiler warning */ if (option == 1) { /* If getopt's RETURN_IN_ORDER behavior */ switch (lastmode) { case 'n': case 's': option = lastmode; break; default: fprintf(stderr, "File names may only be given after -n or -s options.\n"); } } switch (option) { case 'c': read_config_file(val, false, false, PR_CFG_USER, longopts_bogotune); /*@fallthrough@*/ /* fall through to suppress reading config files */ case 'C': suppress_config_file = true; break; case 'd': ds_path = xstrdup(val); ds_flag = (ds_flag == DS_NONE) ? DS_DSK : DS_ERR; break; case 'D': ds_flag = (ds_flag == DS_NONE) ? DS_RAM : DS_ERR; break; case 'e': exit_zero = true; break; case 'E': esf_flag ^= true; break; case 'M': bogolex_file = val; break; case 'n': lastmode = 'n'; filelist_add(ham_files, val); break; case 'q': quiet = true; break; case 'r': user_robx = atof(val); break; case 's': lastmode = 's'; filelist_add(spam_files, val); break; #ifdef TEST case 't': test += 1; break; #endif case 'T': coerced_target = atoi(val); break; case 'v': verbose += 1; break; case 'V': print_version(); exit(EX_OK); case 'x': if (strcmp(val, "MakeCheck") == 0) fMakeCheck = true; else set_debug_mask(val); break; case O_MAX_TOKEN_LEN: max_token_len = atoi(val); break; case O_MIN_TOKEN_LEN: min_token_len = atoi(val); break; case O_MAX_MULTI_TOKEN_LEN: max_multi_token_len=atoi(val); break; case O_MULTI_TOKEN_COUNT: multi_token_count=atoi(val); break; case O_BLOCK_ON_SUBNETS: block_on_subnets = get_bool(name, val); break; case O_REPLACE_NONASCII_CHARACTERS: replace_nonascii_characters = get_bool(name, val); break; case O_TOKEN_COUNT_FIX: token_count_fix = atoi(val); break; case O_TOKEN_COUNT_MIN: token_count_min = atoi(val); break; case O_TOKEN_COUNT_MAX: token_count_max = atoi(val); break; default: help(); exit(EX_ERROR); } return 0; } static double get_robx(void) { double rx; if (user_robx > 0.0) rx = user_robx; else if (ds_flag == DS_DSK) { printf("Calculating initial x value...\n"); verbose = -verbose; /* disable bogofilter debug output */ rx = compute_robinson_x(); verbose = -verbose; /* enable bogofilter debug output */ } else rx = ROBX; if (rx > RX_MAX) rx = RX_MAX; if (rx < RX_MIN) rx = RX_MIN; printf("Initial x value is %8.6f\n", rx); return rx; } static result_t *results_sort(uint r_count, result_t *results) { result_t *ans = xcalloc(r_count, sizeof(result_t)); memcpy(ans, results, r_count * sizeof(result_t)); qsort(ans, r_count, sizeof(result_t), compare_results); return ans; } static void top_ten(result_t *sorted, uint n) { uint i, j; bool f; printf("Top ten parameter sets from this scan:\n"); printf(" rs md rx spesf nsesf co fp fn fppc fnpc\n"); for (f = false; !f; f = true) { for (i = j = 0; i < 10 && j < n;) { result_t *r = &sorted[j++]; if (!f && r->fp != target) continue; sp_esf = ESF_SEL(sp_esf, pow(0.75, r->sp_exp)); ns_esf = ESF_SEL(ns_esf, pow(0.75, r->ns_exp)); printf("%5u %6.4f %5.3f %5.3f %8.6f %8.6f %6.4f %3u %3u %6.4f %6.4f\n", r->idx, r->rs, r->md, r->rx, sp_esf, ns_esf, r->co, r->fp, r->fn, r->fp*100.0/ns_cnt, r->fn*100.0/sp_cnt); ++i; } if (i) break; printf("Warning: fp target not met, using original results\n"); } printf("\n"); fflush(stdout); return; } /* get false negative */ static uint gfn(result_t *results, uint rsi, uint mdi, uint rxi, uint spi, uint nsi) { uint i = (((rsi * mdval->cnt + mdi) * rxval->cnt + rxi) * spexp->cnt + spi) * nsexp->cnt + nsi; result_t *r = &results[i]; uint fn = r->fn; if (r->fp != target) return INT_MAX; if (verbose > 100) printf(" %2u, %2u, %2u, %2u, %2u, %2u\n", rsi, mdi, rxi, spi, nsi, fn); ncnt += 1; nsum += fn; return fn; } static result_t *count_outliers(uint r_count, result_t *sorted, result_t *unsorted) { bool f = false; uint i, j = 0, o = 0; uint rsi, mdi, rxi, spi, nsi; uint rsc = rsval->cnt - 1; uint rxc = rxval->cnt - 1; uint mdc = mdval->cnt - 1; uint spc = spexp->cnt - 1; uint nsc = nsexp->cnt - 1; result_t *r = NULL; /* quench bogus compiler warning */ uint q33 = sorted[r_count * 33 / 100].fn; /* 33% quantile */ uint med = sorted[r_count * 50 / 100].fn; /* median false negative */ if (verbose) printf("%u%% fn count was %u\n", 50u, med); for (i = 0; i < r_count; i += 1) { r = &sorted[i]; if (r->fp != target) continue; if (j == 0) j = i+1; if (fMakeCheck && j >= cMakeCheck) break; rsi = r->rsi; mdi = r->mdi; rxi = r->rxi; spi = r->spi; nsi = r->nsi; ncnt = nsum = 0; if (((rsi == 0 || (gfn(unsorted, rsi-1, mdi, rxi, spi, nsi)) < med)) && ((rsi == rsc || (gfn(unsorted, rsi+1, mdi, rxi, spi, nsi)) < med)) && ((mdi == 0 || (gfn(unsorted, rsi, mdi-1, rxi, spi, nsi)) < med)) && ((mdi == mdc || (gfn(unsorted, rsi, mdi+1, rxi, spi, nsi)) < med)) && ((rxi == 0 || (gfn(unsorted, rsi, mdi, rxi-1, spi, nsi)) < med)) && ((rxi == rxc || (gfn(unsorted, rsi, mdi, rxi+1, spi, nsi)) < med)) && ((spi == 0 || (gfn(unsorted, rsi, mdi, rxi, spi-1, nsi)) < med)) && ((spi == spc || (gfn(unsorted, rsi, mdi, rxi, spi+1, nsi)) < med)) && ((nsi == 0 || (gfn(unsorted, rsi, mdi, rxi, spi, nsi-1)) < med)) && ((nsi == nsc || (gfn(unsorted, rsi, mdi, rxi, spi, nsi+1)) < med)) && (ncnt != 0 && nsum / ncnt < q33)) { f = true; break; } o++; } if (o > 0) { printf("%u outlier%s encountered. \n", o, (o > 1) ? "s" : ""); } if (!f) { r = &sorted[j-1]; printf("No smooth minimum encountered, using lowest fn count (an outlier). \n"); } return r; } static void progress(uint cur, uint top) { uint i; uint ndots = ceil(70.0 * cur / top); if (quiet) return; if (ndots < 1) ndots = 1; printf("\r%3u [", cur); for (i = 0; i < ndots; i += 1) printf("."); for (i = ndots; i < 70; i += 1) printf(" "); printf("]"); fflush(stdout); } static void final_warning(void) { printf( "The small number and/or relative uniformity of the test messages imply\n" "that the recommended values (above), though appropriate to the test set,\n" "may not remain valid for long. Bogotune should be run again with more\n" "messages when that becomes possible.\n" ); } static void final_recommendations(bool skip) { uint m; bool printed = false; uint minn[] = { 10000, 2000, 1000, 500, 1 }; printf("Performing final scoring:\n"); printf("Spam... "); score_sp(sp_scores); /* get scores (in ascending order) */ printf("Non-Spam...\n"); score_ns(ns_scores); /* get scores (in descending order) */ for (m=0; m<10; ++m) printf("%8.6f %8.6f\n", sp_scores[m], ns_scores[m]); if (verbose >= PARMS) printf("# ns_cnt %u, sp_cnt %u\n", ns_cnt, sp_cnt); if (skip) { printf("\n"); printf("### The following recommendations are provisional.\n"); printf("### Run bogotune with more messages when possible.\n"); printf("\n"); } printf("\nRecommendations:\n\n"); printf("---cut---\n"); printf("db_cachesize=%u\n", db_cachesize); printf("robs=%6.4f\n", robs); printf("min_dev=%5.3f\n", min_dev); printf("robx=%8.6f\n", robx); printf("sp_esf=%8.6f\n", sp_esf); printf("ns_esf=%8.6f\n", ns_esf); for (m=0; m < COUNTOF(minn); m += 1) { double cutoff; uint i, fp = 0, fn = 0; uint mn = minn[m]; double fpp, fnp; if (ns_cnt < mn) continue; if (mn > 1 ) { uint t = (ns_cnt + mn - 1) / mn; cutoff = ns_scores[t-1]; if (cutoff > FP_CUTOFF) continue; fp = ns_cnt / mn; fpp = 100.0 / mn; } else { cutoff = SPAM_CUTOFF; if (printed) break; for (i = 0; i < ns_cnt; i += 1) { if (ns_scores[i] >= cutoff) fp += 1; } cutoff = ns_scores[fp-1]; fpp = 100.0 * fp / ns_cnt; } for (i = 0; i < sp_cnt; i += 1) { if (sp_scores[i] >= cutoff) { fn = i; break; } } fnp = 100.0 * fn / sp_cnt; if (printed) printf("#"); printf("spam_cutoff=%8.6f\t# for %4.2f%% fp (%u); expect %4.2f%% fn (%u).\n", cutoff, fpp, fp, fnp, fn); printed = true; if (skip) ham_cutoff = cutoff; } if (!skip) { uint s = ceil(sp_cnt * 0.002 - 1); ham_cutoff = sp_scores[s]; if (ham_cutoff < MIN_HAM_CUTOFF) ham_cutoff = MIN_HAM_CUTOFF; if (ham_cutoff > MAX_HAM_CUTOFF) ham_cutoff = MAX_HAM_CUTOFF; } printf("ham_cutoff=%5.3f\t\n", ham_cutoff); printf("---cut---\n"); printf("\n"); if (skip) final_warning(); printf("Tuning completed.\n"); } static void bogotune_init(void) { const char *msg_count = MSG_COUNT; w_msg_count = word_news(msg_count); train = wordhash_new(); ns_and_sp = tunelist_new("tr"); /* training lists */ ns_msglists = tunelist_new("ns"); /* non-spam scoring lists */ sp_msglists = tunelist_new("sp"); /* spam scoring lists */ return; } static void bogotune_free(void) { xfree(ns_scores); xfree(sp_scores); filelist_free(ham_files); filelist_free(spam_files); tunelist_free(ns_msglists); tunelist_free(sp_msglists); tunelist_free(ns_and_sp); word_free(w_msg_count); token_cleanup(); mime_cleanup(); xfree(ds_path); return; } static bool check_msgcount_parms(void) { bool ok = true; if (ds_flag == DS_RAM) { fprintf(stderr, "A wordlist directory must be specified for converting messages to the message count format.\n"); ok = false; } if (ham_files->count != 0 && spam_files->count != 0) { fprintf(stderr, "Message count files may be created from spam or non-spam inputs but not both.\n"); fprintf(stderr, "Run bogotune once for the spam and again for the non-spam.\n"); ok = false; } return ok; } static bool check_msg_counts(void) { bool ok = true; double ratio; if (msgs_good < LIST_COUNT || msgs_bad < LIST_COUNT) { if (!quiet) fprintf(stderr, "The wordlist contains %u non-spam and %u spam messages.\n" "Bogotune must be run with at least %u of each.\n", msgs_good, msgs_bad, LIST_COUNT); ok = false; } ratio = (double)msgs_good / (double)msgs_bad; fprintf(stderr, "wordlist's ham to spam ratio is %0.1f to 1.0\n", ratio ); if ( ratio < 0.1 || ratio > 10.0) { if (!quiet) { fprintf(stderr, "Bogotune requires the ratio be in the range of 0.1 to 10.\n"); } ok = false; } if (ns_cnt < TEST_COUNT || sp_cnt < TEST_COUNT) { if (!quiet) fprintf(stderr, "The messages sets contain %u non-spam and %u spam. Bogotune " "requires at least %u non-spam and %u spam messages to run.\n", ns_cnt, sp_cnt, TEST_COUNT, TEST_COUNT); exit(EX_ERROR); } return ok; } static void show_elapsed_time(int beg, int end, uint cnt, double val, const char *lbl1, const char *lbl2) { int tm = end - beg; if (!fMakeCheck) printf(" %dm:%02ds for %u %s. avg: %.1f %s\n", MIN(tm), SECONDS(tm), cnt, lbl1, val, lbl2); } static rc_t bogolex(void) { rc_t status = RC_OK; if (!check_msgcount_parms()) exit(EX_ERROR); read_mailbox(bogolex_file, NULL); return status; } static rc_t bogotune(void) { bool skip; result_t *best; int beg, end; uint cnt, scan; rc_t status = RC_OK; beg = time(NULL); ham_cutoff = 0.0; spam_cutoff = 0.1; /* Note: memory usage highest while reading messages */ /* usage decreases as distribute() converts to count format */ /* read all messages, merge training sets, look up scoring sets */ ns_cnt = filelist_read(REG_GOOD, ham_files); sp_cnt = filelist_read(REG_SPAM, spam_files); cnt = ns_cnt + sp_cnt; end = time(NULL); if (verbose >= TIME) { show_elapsed_time(beg, end, ns_cnt + sp_cnt, (double)cnt/(end-beg), "messages", "msg/sec"); } distribute(REG_GOOD, ns_msglists); distribute(REG_SPAM, sp_msglists); create_countlists(ns_msglists); create_countlists(sp_msglists); if (verbose >= TIME && time(NULL) - end > 2) { end = time(NULL); show_elapsed_time(beg, end, ns_cnt + sp_cnt, (double)cnt/(end-beg), "messages", "msg/sec"); } if (verbose > PARMS+1) { tunelist_print(ns_and_sp); tunelist_print(ns_msglists); tunelist_print(sp_msglists); } ns_cnt = count_messages(ns_msglists); sp_cnt = count_messages(sp_msglists); if (ds_flag == DS_DSK && !check_msg_counts()) exit(exit_zero ? EX_OK : EX_ERROR); fflush(stdout); check_percent = CHECK_PCT; /* for checking low scoring spam ** and high scoring non-spam */ ns_scores = xcalloc(ns_cnt, sizeof(double)); sp_scores = xcalloc(sp_cnt, sizeof(double)); robs = DEFAULT_ROBS; robx = DEFAULT_ROBX; min_dev = DEFAULT_MIN_DEV; if (check_for_high_ns_scores() | check_for_low_sp_scores()) scoring_error(); /* ** 5. Calculate x and cache size ** Calculate x with bogoutil's -r option (a new addition). ** Bound the calculated value within [0.4, 0.6] and set the range to be ** investigated to [x-0.1, x+0.1]. */ robx = get_robx(); if (ds_flag == DS_DSK) { db_cachesize = calc_db_cachesize(); printf("Recommended db cache size is %u MB\n", db_cachesize); } /* ** 6. Calculate fp target ** The fp target will be derived thus: score non-spams with s and md as ** shipped, and determine the count that will result from a spam cutoff ** of 0.95; if that is < 0.25%, try 0.9375 etc. */ min_dev = 0.02; /* set target and spam_cutoff */ if (coerced_target == 0) set_thresh(ns_cnt, ns_scores); else { /* if coerced target ... */ target = coerced_target; spam_cutoff = ns_scores[target-1]; } skip = ROUND(spam_cutoff,100000) < SCAN_CUTOFF; printf("False-positive target is %u (cutoff %8.6f)\n", target, spam_cutoff); #ifdef TEST if (test) { printf("m: %8.6f, s: %8.6f, x: %0.16f\n", min_dev, robs, robx); if (verbose < PARMS) print_ns_scores(target-2, target+2, 0); } #endif if (!esf_flag && (sp_esf < 1.0 || ns_esf < 1.0)) fprintf(stderr, "Warning: Using ESF values (sp=%8.6f, ns=%8.6f) from config file.\n", sp_esf, ns_esf); /* No longer needed */ wordhash_free(train); train = NULL; for (scan=0; scan <= 1 && !skip; scan ++) { uint r_count; uint rsi, rxi, mdi, spi, nsi; result_t *results, *r, *sorted; printf("Performing %s scan:\n", scan==0 ? "coarse" : "fine"); switch (scan) { case 0: /* COARSE */ /* ** 7. Coarsely scan s, md and x ** The coarse s scan will range from 1 to 0.01 in half decades, and the ** coarse md scan will range from 0.05 to 0.45 in steps of 0.05. The ** coarse x scan will use steps of 0.05. The trough must be surrounded on ** six sides by values below the 33% quantile (unless bounded on one or ** more sides). */ init_coarse(robx); break; case 1: /* FINE */ /* ** 8. Finely scan the peak region ** The fine s scan will range over the estimated s +/- half a decade in ** steps of a quarter decade, and the fine md scan will range over the ** estimated md +/- 0.075 in steps of 0.015. The fine x scan will range ** over the estimated x +/- 0.04 in steps of 0.02. Scans of s and md ** are bounded by the limits of the coarse scan. Again, the trough must ** be surrounded on six sides by values below the 33% quantile. If no ** such trough exists, a warning is given. */ init_fine(robs, min_dev, robx, spex, nsex); break; } r_count = rsval->cnt * mdval->cnt * rxval->cnt * spexp->cnt * nsexp->cnt; results = (result_t *) xcalloc(r_count, sizeof(result_t)); print_all_parms(r_count); if (verbose >= SUMMARY) { if (verbose >= SUMMARY+1) printf("%3s ", "cnt"); if (verbose >= SUMMARY+2) printf(" %s %s %s ", "s", "m", "x"); printf(" %4s %5s %4s %8s %8s %7s %3s %3s\n", "rs", "md", "rx", "spesf", "nsesf", "cutoff", "fp", "fn"); } cnt = 0; beg = time(NULL); for (rsi = 0; rsi < rsval->cnt; rsi++) { robs = rsval->data[rsi]; for (mdi = 0; mdi < mdval->cnt; mdi++) { min_dev = mdval->data[mdi]; for (rxi = 0; rxi < rxval->cnt; rxi++) { robx = rxval->data[rxi]; for (spi = 0; spi < spexp->cnt; spi++) { spex = spexp->data[spi]; sp_esf = ESF_SEL(sp_esf, pow(0.75, spex)); for (nsi = 0; nsi < nsexp->cnt; nsi++) { uint fp, fn; nsex = nsexp->data[nsi]; ns_esf = ESF_SEL(ns_esf, pow(0.75, nsex)); /* save parms */ r = &results[cnt++]; r->idx = cnt; r->rsi = rsi; r->rs = robs; r->rxi = rxi; r->rx = robx; r->mdi = mdi; r->md = min_dev; r->spi = spi; r->sp_exp = spex; r->nsi = nsi; r->ns_exp = nsex; if (verbose >= SUMMARY) { if (verbose >= SUMMARY+1) printf("%3u ", cnt); if (verbose >= SUMMARY+2) printf(" %u %u %u %u %u ", rsi, mdi, rxi, spi, nsi); printf("%6.4f %5.3f %5.3f %8.6f %8.6f", robs, min_dev, robx, sp_esf, ns_esf); fflush(stdout); } spam_cutoff = 0.01; score_ns(ns_scores); /* scores in descending order */ /* Determine spam_cutoff and false_pos */ for (fp = target; fp < ns_cnt; fp += 1) { spam_cutoff = ns_scores[fp-1]; if (spam_cutoff < 0.999999) break; if (coerced_target != 0) break; } if (ns_cnt < fp) fprintf(stderr, "Too few false positives to determine a valid cutoff\n"); score_sp(sp_scores); /* scores in ascending order */ fn = get_fn_count(sp_cnt, sp_scores); /* save results */ r->co = spam_cutoff; r->fp = fp; r->fn = fn; if (verbose < SUMMARY) progress(cnt, r_count); else { printf(" %8.6f %2u %3u\n", spam_cutoff, fp, fn); fflush(stdout); } #ifdef TEST if (test && spam_cutoff < 0.501) { printf("co: %0.16f\n", spam_cutoff); print_ns_scores(0, fp, 2); print_sp_scores(fn-10, fn, 10); } #endif if (fMakeCheck && cnt >= cMakeCheck) break; } if (fMakeCheck && cnt >= cMakeCheck) break; } if (fMakeCheck && cnt >= cMakeCheck) break; } if (fMakeCheck && cnt >= cMakeCheck) break; } fflush(stdout); if (fMakeCheck && cnt >= cMakeCheck) break; } if (verbose >= TIME) { end = time(NULL); show_elapsed_time(beg, end, cnt, (double)(end-beg)/cnt, "iterations", "secs"); } printf("\n"); /* Scan complete, now find minima */ sorted = results_sort(r_count, results); top_ten(sorted, r_count); best = count_outliers(r_count, sorted, results); robs = rsval->data[best->rsi]; robx = rxval->data[best->rxi]; min_dev = mdval->data[best->mdi]; spex = spexp->data[best->spi]; sp_esf = ESF_SEL(sp_esf, pow(0.75, spex)); nsex = nsexp->data[best->nsi]; ns_esf = ESF_SEL(ns_esf, pow(0.75, nsex)); printf( "Minimum found at s %6.4f, md %5.3f, x %5.3f, spesf %8.6f, nsesf %8.6f\n", robs, min_dev, robx, sp_esf, ns_esf); printf(" fp %u (%6.4f%%), fn %u (%6.4f%%)\n", best->fp, best->fp*100.0/ns_cnt, best->fn, best->fn*100.0/sp_cnt); printf("\n"); data_free(rsval); data_free(rxval); data_free(mdval); data_free(spexp); data_free(nsexp); xfree(results); xfree(sorted); } /* ** 9. Suggest possible spam and non-spam cutoff values ** With the final x, md and s values, score the spams and non-spams and ** sort the non-spam scores decreasing and the spam scores increasing; ** then, traverse the non-spam list until the 0.2% point; report cutoffs ** that give 0.05%, 0.1% and 0.2% fp. */ final_recommendations(skip); return status; } int main(int argc, char **argv) /*@globals errno,stderr,stdout@*/ { ex_t exitcode = EX_OK; fBogotune = true; /* for rob_compute_spamicity() */ dbgout = stderr; progtype = build_progtype(progname, DB_TYPE); ham_files = filelist_new("ham"); spam_files = filelist_new("spam"); /* process args and read mailboxes */ process_arglist(argc, argv); /* directories from command line and config file are already handled */ if (ds_flag == DS_DSK) { bfpath *bfp; if (ds_path == NULL) ds_path = get_directory(PR_ENV_BOGO); if (ds_path == NULL) ds_path = get_directory(PR_ENV_HOME); if (ds_path == NULL) { fprintf(stderr, "Cannot derive bogofilter directory from environment, aborting.\n"); exit(EX_ERROR); } set_bogohome(ds_path); bfp = bfpath_create(ds_path); if (!bfpath_check_mode(bfp, BFP_MUST_EXIST)) { fprintf(stderr, "Can't open wordlist '%s'\n", bfp->filepath); exit(EX_ERROR); } if (bfp->exists && bfp->isdir) { bfpath_free(bfp); ds_path = mxcat(ds_path, DIRSEP_S, WORDLIST, NULL); bfp = bfpath_create(ds_path); if (!bfpath_check_mode(bfp, BFP_MUST_EXIST)) { fprintf(stderr, "Can't open wordlist '%s'\n", bfp->filepath); exit(EX_ERROR); } } env = ds_init(bfp); init_wordlist("word", ds_path, 0, WL_REGULAR); } bogotune_init(); if (ds_flag == DS_DSK) load_wordlist(load_hook, train); /* if encoding not yet set, assume old style */ if (encoding == E_UNKNOWN) encoding = E_RAW; if (bogolex_file != NULL) bogolex(); else bogotune(); bogotune_free(); if (ds_flag == DS_DSK) ds_cleanup(env); exit(exitcode); } /* End */ bogofilter-1.2.4/src/lexer.h0000644000175000017500000000333412163572304014123 0ustar sezsez/* $Id: lexer.h 6988 2013-01-20 14:02:48Z m-a $ */ /***************************************************************************** NAME: lexer.h -- prototypes and definitions for lexer.c ******************************************************************************/ #ifndef LEXER_H #define LEXER_H #include "buff.h" #include "word.h" extern FILE *yyin; extern bool block_on_subnets; #define YY_NULL 0 /* lexer interface */ typedef enum { NONE, TOKEN, /* regular token */ MONEY, /* dollars & cents */ HEADKEY, /* header keyword */ EOH, /* end-of-header (empty line) */ BOUNDARY, /* MIME multipart boundary line */ QUEUE_ID, /* Queue ID of message */ MESSAGE_ID, /* Message ID of message */ MESSAGE_ADDR,/* Message's IP address */ IPADDR, /* Generic IP address */ VERP, /* Variable Envelope Return Path */ MSG_COUNT_LINE, BOGO_LEX_LINE } token_t; /* in lexer.c */ extern int yylineno; extern bool msg_header; extern bool have_body; /* Define a struct for interfacing to a lexer */ typedef token_t yylex_t(void); typedef struct lexer_s { yylex_t *yylex; long (*get_parser_token)(byte **data); } lexer_t; extern lexer_t *lexer; extern lexer_t msg_count_lexer; /* in lexer_v3.l */ extern token_t yylex(void); extern void lexer_v3_init(FILE *fp); extern long lexer_v3_get_token(byte **output); /* in lexer_v?.c */ extern char yy_get_state(void); extern void yy_set_state_initial(void); /* in lexer.c */ extern void lexer_init(void); extern void yyinit(void); extern int yyinput(byte *buf, size_t used, size_t size); extern int buff_fill(buff_t *buff, size_t used, size_t need); extern word_t *text_decode(word_t *w); extern size_t html_decode(word_t *w); #endif /* LEXER_H */ bogofilter-1.2.4/src/listsort.c0000644000175000017500000001222312163572272014663 0ustar sezsez#include "config.h" #include /* * Demonstration code for sorting a linked list. * * The algorithm used is Mergesort, because that works really well * on linked lists, without requiring the O(N) extra space it needs * when you do it on arrays. * * This code can handle singly and doubly linked lists, and * circular and linear lists too. For any serious application, * you'll probably want to remove the conditionals on `is_circular' * and `is_double' to adapt the code to your own purpose. * */ /* * This file is copyright 2001 Simon Tatham. * * 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 SIMON TATHAM BE LIABLE FOR * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ #include "listsort.h" typedef unsigned char byte; #include "word.h" #ifdef TEST static int cmp(const element *a, const element *b); static int cmp(const element *a, const element *b) { return a->i - b->i; } #endif /* * This is the actual sort function. Notice that it returns the new * head of the list. (It has to, because the head will not * generally be the same element after the sort.) So unlike sorting * an array, where you can do * * sort(myarray); * * you now have to do * * list = listsort(mylist); */ element *listsort(element *list, fcn_compare *compare) { element *p, *q, *e, *tail; int insize, nmerges, psize, qsize, i; /* * Silly special case: if `list' was passed in as NULL, return * NULL immediately. */ if (!list) return NULL; insize = 1; while (1) { p = list; list = NULL; tail = NULL; nmerges = 0; /* count number of merges we do in this pass */ while (p) { nmerges++; /* there exists a merge to be done */ /* step `insize' places along from p */ q = p; psize = 0; for (i = 0; i < insize; i++) { psize++; q = q->next; if (!q) break; } /* if q hasn't fallen off end, we have two lists to merge */ qsize = insize; /* now we have two lists; merge them */ while (psize > 0 || (qsize > 0 && q)) { /* decide whether next element of merge comes from p or q */ if (psize == 0) { /* p is empty; e must come from q. */ e = q; q = q->next; qsize--; } else if (qsize == 0 || !q) { /* q is empty; e must come from p. */ e = p; p = p->next; psize--; } else if (compare(p,q) <= 0) { /* First element of p is lower (or same); * e must come from p. */ e = p; p = p->next; psize--; } else { /* First element of q is lower; e must come from q. */ e = q; q = q->next; qsize--; } /* add the next element to the merged list */ if (tail) { tail->next = e; } else { list = e; } tail = e; } /* now p has stepped `insize' places along, and q has too */ p = q; } tail->next = NULL; /* If we have done only one merge, we're finished. */ if (nmerges <= 1) /* allow for nmerges==0, the empty list case */ return list; /* Otherwise repeat, merging lists twice the size */ insize *= 2; } } /* * Small test rig with three test orders. The list length 13 is * chosen because that means some passes will have an extra list at * the end and some will not. */ #ifdef TEST int main(void) { #define n 13 element k[n], *head, *p; int order[][n] = { { 0,1,2,3,4,5,6,7,8,9,10,11,12 }, { 6,2,8,4,11,1,12,7,3,9,5,0,10 }, { 12,11,10,9,8,7,6,5,4,3,2,1,0 }, }; unsigned int i, j; for (j = 0; j < n; j++) k[j].i = j; listsort(NULL, cmp, 0, 0); for (i = 0; i < sizeof(order)/sizeof(*order); i++) { int *ord = order[i]; head = &k[ord[0]]; for (j = 0; j < n; j++) { if (j == n-1) k[ord[j]].next = NULL; else k[ord[j]].next = &k[ord[j+1]]; } printf("before:"); p = head; do { printf(" %d", p->i); p = p->next; } while (p != NULL); printf("\t"); head = listsort(head, cmp); printf(" after:"); p = head; do { printf(" %d", p->i); p = p->next; } while (p != NULL); printf("\n"); } printf("\n"); return 0; } #endif bogofilter-1.2.4/src/uudecode.h0000644000175000017500000000063412163572304014601 0ustar sezsez/* $Id: uudecode.h 3463 2003-10-31 15:34:53Z relson $ */ /***************************************************************************** NAME: uudecode.h -- prototypes and definitions for uudecode.c ******************************************************************************/ #ifndef HAVE_UUDECODE_H #define HAVE_UUDECODE_H #include "word.h" uint uudecode(word_t *word); #endif /* HAVE_UUDECODE_H */ bogofilter-1.2.4/src/bool.h0000644000175000017500000000061112163572304013732 0ustar sezsez/* $Id: bool.h 1578 2003-02-03 17:09:47Z relson $ */ /***************************************************************************** NAME: bool.h -- prototypes for bool.c ******************************************************************************/ #ifndef HAVE_BOOL_H #define HAVE_BOOL_H /* Function prototypes */ extern bool str_to_bool(const char *str); #endif /* HAVE_BOOL_H */ bogofilter-1.2.4/src/datastore_db.h0000644000175000017500000001036312163572304015437 0ustar sezsez/* $Id: datastore_db.h 6895 2010-03-23 17:48:52Z m-a $ */ /***************************************************************************** NAME: datastore.h - API for bogofilter datastore. The idea here is to make bogofilter independent of the database system used to store words. The interface specified by this file determines the entire interaction between bogofilter and the database. Writing a new database backend merely requires the implementation of the interface. AUTHORS: Gyepi Sam 2002 - 2003 Matthias Andree 2003 ******************************************************************************/ #ifndef DATASTORE_DB_H #define DATASTORE_DB_H #include "datastore.h" extern bool db_log_autoremove; /* DB_LOG_AUTOREMOVE */ extern bool db_txn_durable; /* not DB_TXN_NOT_DURABLE */ /** Initialize database, open and lock files, etc. * params: char * path to database file, char * name of database * \return opaque pointer to database handle, which must be saved and * passed as the first parameter in all subsequent database function calls. */ /*@only@*/ /*@null@*/ void *db_open(void *env, /**< database environment to open DB in */ bfpath *bfp, /**< path info for database file */ dbmode_t mode /**< open mode, DS_READ or DS_WRITE */); /** Close file and clean up. */ void db_close(/*@only@*/ void *vhandle); /** Flush pending writes to disk */ void db_flush(void *handle); /** Do global initializations. \return pointer to environment for success, NULL for * error. */ void *dbe_init(bfpath *bfp); /** Cleanup storage allocation */ void dbe_cleanup(void *); /** Retrieve the value associated with a given word in a list. * \return zero if the word does not exist in the database. */ int db_get_dbvalue( void *vhandle, /**< database handle */ const dbv_t *token, /**< key (token) to look for */ /*@out@*/ dbv_t *val /** output, note: this must be * pre-allocated and val->leng must * specify how many bytes val->data can * hold. */ ); /** Delete the key */ int db_delete(void *handle, const dbv_t *data); /** Set the value associated with a given word in a list. */ int db_set_dbvalue(void *handle, const dbv_t *token, const dbv_t *val); /** Callback hook used by db_foreach, passes the original \p userdata * down as well as \a token and \a data. If the function returns a * nonzero value, the traversal is aborted. */ typedef ex_t (*db_foreach_t)(dbv_t *token, dbv_t *data, void *userdata); /** Iterate over all elements in data base and call \p hook for each item. * \p userdata is passed through to the hook function unaltered. */ ex_t db_foreach(void *handle, db_foreach_t hook, void *userdata); /** Returns error string associated with \a code. */ const char *db_str_err(int code); /** Returns version string (pointer to a static buffer). */ const char *db_version_str(void); /* help messages and option processing */ const char **dsm_help_bogofilter(void); const char **dsm_help_bogoutil(void); /** Begin new transaction. */ int db_txn_begin(void *vhandle); /** Abort a pending transaction. */ int db_txn_abort(void *vhandle); /** Commit a pending transaction. */ int db_txn_commit(void *vhandle); /** Recover the environment given in \a directory. */ ex_t dbe_recover(bfpath *bfp, bool catastrophic, bool force); /** Remove the environment from \a directory. */ ex_t dbe_remove(bfpath *bfp); /** Return page size of \a databasefile, 0xffffffff for error, 0 for * unknown. */ u_int32_t db_pagesize(bfpath *bfp); /** Return leaf page count of \a databasefile, 0xffffffff for error, 0 for * unknown. */ u_int32_t db_leafpages(bfpath *bfp); /** Check if \a databasefile is a valid database. */ ex_t db_verify(bfpath *bfp); /** Returns true if the database is byteswapped. */ bool db_is_swapped(void *vhandle); /** Returns true if the database has been created in this session. */ bool db_created(void *vhandle); /** Returns parent environment handle. */ void *db_get_env(void *vhandle); /** Subroutine to place file lock */ int subr_db_lock(int fd, int cmd, short int type); /** Lock database \a vhandle for \a open_mode */ int db_lock(void *vhandle, int open_mode); /** Check if \a file is a regular file or missing */ bool is_file_or_missing(const char *file); #endif bogofilter-1.2.4/src/tests/0000755000175000017500000000000012164443244013773 5ustar sezsezbogofilter-1.2.4/src/tests/t.nullstatsprefix0000755000175000017500000000034212163572275017437 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # test description here # # test below # remember to use ${srcdir} ( echo ; echo 'blah' ) | $VAL $BOGOFILTER -p -v -e -C > "$TMPDIR/out" if egrep '\(null\)' "$TMPDIR"/out ; then exit 1 ; fi bogofilter-1.2.4/src/tests/t.lexer.eoh0000644000175000017500000000070412163572275016060 0ustar sezsez#! /bin/sh # This checks if bogofilter/bogolexer will properly MIME decode the # first body line. It used to fail up to and including 1.2.0, # because the lexer lookahead beyond \n wasn't decoded. . ${srcdir:=.}/t.frame # This message contains one body word "SPAM". Check if it's present # after scanning. cat <<_EOF | $BOGOLEXER -p -C | grep SPAM >/dev/null MIME-Version: 1.0 Content-Transfer-Encoding: quoted-printable =53=50=41=4D _EOF bogofilter-1.2.4/src/tests/abortme.c0000644000175000017500000000037512163572274015602 0ustar sezsez/** \file abortme.c * just calls abort() to trigger signal 6, to test core dumps * and post-mortem backtraces * \author Matthias Andree * \date 2003 * GNU GENERAL PUBLIC LICENSE, version 2. */ #include int main(void) { abort(); } bogofilter-1.2.4/src/tests/t.systest0000755000175000017500000000601612163572272015707 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # systest.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # systest.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame CFG="$TMPDIR"/test.cf OPTS="-y 0" cat < "$CFG" robx=0.415 min_dev=0.0 ham_cutoff=0.10 spam_cutoff=0.95 spam_header_name=X-Bogosity stats_in_header=Y EOF map_rc() { ( set +e "$@" a=$? [ $a -eq 0 ] && exit 0 [ $a -eq 1 ] && exit 0 [ $a -eq 2 ] && exit 0 exit $a ) } # Expected spamicity values (11/17/02 13:13): # # 1 g v X-Bogosity: Ham, spamicity=0.000000 # 1 r v X-Bogosity: Ham, spamicity=0.402296 # 2a g vv X-Bogosity: Spam, spamicity=1.000000 # 2a r vv X-Bogosity: Ham, spamicity=0.527095 # 2b g vv X-Bogosity: Spam, spamicity=1.000000 # 2b g vvv X-Bogosity: Spam, spamicity=1.000000 # 2b r vv X-Bogosity: Spam, spamicity=0.540124 # 2b r vvv X-Bogosity: Spam, spamicity=0.540124 # 3 g vvv X-Bogosity: Spam, spamicity=1.000000 # 3 r vvv X-Bogosity: Spam, spamicity=0.540316 BOGOFILTER_DIR="$TMPDIR" export BOGOFILTER_DIR $BOGOFILTER $OPTS -c "$CFG" -s < "$SYSTEST"/inputs/spam.mbx $BOGOFILTER $OPTS -c "$CFG" -n < "$SYSTEST"/inputs/good.mbx for f in "$BOGOFILTER_DIR"/*.$DB_EXT ; do n="$(basename "$f" ".$DB_EXT")" $BOGOUTIL -C -d "$BOGOFILTER_DIR/$n.$DB_EXT" > "$BOGOFILTER_DIR/$n.txt" done if [ $verbose -ne 0 ]; then ls -l "$BOGOFILTER_DIR"/*list.txt fi # # run tests for msg.1.txt, msg.2.txt, and msg.3.txt # for tst in 1.1.v.yes 2.2a.vv.yes 2.2a.vvv.no 3.3.vvv.no ; do in=`echo $tst | tr "." " " | $AWK '{print $1}'` out=`echo $tst | tr "." " " | $AWK '{print $2}'` ver=`echo $tst | tr "." " " | $AWK '{print $3}'` sih=`echo $tst | tr "." " " | $AWK '{print $4}'` map_rc $BOGOFILTER $OPTS -c "$CFG" --stats-in-header=$sih -$ver 2> /dev/null \ < "$SYSTEST"/inputs/msg.$in.txt > "$TMPDIR"/out || : sed s/,.version=.*// < "$TMPDIR"/out > "$TMPDIR"/msg.$out.$ver done # # classify msg.2.txt a second time and rerun tests # (expect different results from first run) # $BOGOFILTER $OPTS -c "$CFG" -s < "$SYSTEST"/inputs/msg.3.txt for tst in 2.2b.vv.yes 2.2b.vvv.no ; do in=`echo $tst | tr "." " " | $AWK '{print $1}'` out=`echo $tst | tr "." " " | $AWK '{print $2}'` ver=`echo $tst | tr "." " " | $AWK '{print $3}'` sih=`echo $tst | tr "." " " | $AWK '{print $4}'` map_rc $BOGOFILTER $OPTS -c "$CFG" --stats-in-header=$sih -$ver 2> /dev/null \ < "$SYSTEST"/inputs/msg.$in.txt > "$TMPDIR"/out sed s/,.version=.*// < "$TMPDIR"/out > "$TMPDIR"/msg.$out.$ver done if [ $verbose -eq 0 ]; then rm -f "$BOGOFILTER_DIR"/*.$DB_EXT fi rm -f "$CFG" if [ "$BF_SAVEDIR" ] ; then . "$srcdir/t.save" ; fi for i in "$OUTPUTS"/msg.*.v* ; do j="$(basename "$i")" if [ $verbose -eq 0 ]; then cmp "$i" "$TMPDIR/$j" else set +e diff $DIFF_BRIEF "$i" "$TMPDIR"/$j fi done bogofilter-1.2.4/src/tests/escnp.c0000644000175000017500000000042012163572275015251 0ustar sezsez#include #include int main(void) { int c; while ((c = getchar()) != EOF) { if ((c < 0x20 || c > 0x7e) && c != '\n') { printf("\\%03o", c); continue; } else if (c == '\\') { putchar('\\'); } putchar(c); } exit(0); } bogofilter-1.2.4/src/tests/t.abort0000755000175000017500000000016512163572274015301 0ustar sezsez#! /bin/sh NODB=1 . ${srcdir:=.}/t.frame if (${SHELL} "$srcdir/t._abort" junk arguments here) ; then exit 1 fi bogofilter-1.2.4/src/tests/wantcore.c0000644000175000017500000000250212163572274015765 0ustar sezsez/* wantcore -- run a program with soft core file size limit set to hard limit * Copyright © 2004 Matthias Andree 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. The license is found in the file ../../COPYING. */ #include "system.h" #include #include #include #include static void barf(const char *e) __attribute__((noreturn)); static void barf(const char *e) { perror(e); exit(EXIT_FAILURE); } int main(int argc, char **argv) { #ifndef __EMX__ struct rlimit rl; #endif if (argc <= 1) { fprintf(stderr, "Usage: %s program [args]\n", argv[0]); exit(EXIT_FAILURE); } #ifndef __EMX__ if (getrlimit(RLIMIT_CORE, &rl)) barf("getrlimit"); rl.rlim_cur = rl.rlim_max; if (setrlimit(RLIMIT_CORE, &rl)) barf("setrlimit"); #endif execv(argv[1], argv+1); fprintf(stderr, "execv: "); barf(argv[1]); } bogofilter-1.2.4/src/tests/t.message_addr0000755000175000017500000000134412163572274016610 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame CFG="$TMPDIR"/test.cf OUT="$TMPDIR/test.out" CORRECT="$SYSTEST/outputs/message_addr.ref" cat < "$CFG" # include message's ip address # suppress timestamps & version info in output header_format=%h: %c, message_addr=%A EOF # build wordlists $BOGOFILTER -n -v -D -c "$CFG" -M -B "$srcdir/inputs/good.mbx" > /dev/null $BOGOFILTER -s -v -D -c "$CFG" -M -B "$srcdir/inputs/spam.mbx" > /dev/null $BOGOFILTER -v -D -c "$CFG" -M -B "$srcdir/inputs/good.mbx" \ "$srcdir/inputs/spam.mbx" \ | sed 's}.*/inputs/}inputs/}' > "$OUT" # compare test output to reference output if [ $verbose -eq 0 ]; then diff "$CORRECT" "$OUT" cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi bogofilter-1.2.4/src/tests/unsort.pl0000755000175000017500000000065112163572274015674 0ustar sezsez#! /usr/bin/env perl # unsort.pl - print words of a short file in random order # processes from stdin to stdout # Copyright (C) 2004 by Matthias Andree # This file is under the GNU General Public License, v2 my @a = <>; chomp @a; @a = split ' ', join(' ', @a); srand(time ^ ($$ + ($$ << 15))); while(scalar @a) { my $pos = int rand scalar @a; print $a[$pos], "\n"; @a = (@a[0..($pos-1)],@a[($pos+1)..$#a]); } bogofilter-1.2.4/src/tests/t.u_fpe0000755000175000017500000000045312163572274015270 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # make sure we don't have SIGFPE aborts # Solaris 2.6 returns -nan, we don't care. ./u_fpe > "$TMPDIR"/res tr < "$TMPDIR/res" 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' \ | sed 's/^-//' > "$TMPDIR"/res.lc cmp - "$TMPDIR/res.lc" <<_EOF nan inf _EOF bogofilter-1.2.4/src/tests/t.bogodir0000755000175000017500000000411412163572275015616 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # bogodir.YYYYMMDD. This is useful when something is different. . ${srcdir=.}/t.frame HOME="$TMPDIR/home" mkdir "$HOME" export HOME LOG="$TMPDIR/bogodir.log" cat /dev/null >"$LOG" map_rc() { ( set +e echo >> "$LOG" "$@" echo >> "$LOG" "### expect: $expect" result=`"$@" 2>&1 | tee -a "$LOG" | grep open | head -1` ok=`echo "$result" | grep "$expect"` if [ -n "$ok" ] ; then echo >>"$LOG" "### ok: $ok" echo >>"$LOG" "PASS" else echo >>"$LOG" "### got '$result'" echo >>"$LOG" "FAIL" fi echo >> "$LOG" "" [ -z "$ok" ] && rc=1 [ -n "$ok" ] && rc=0 exit $rc ) } #standard test (bogodir.log=3225) OPTS=" -x d -vv -D" #a bit more info (bogodir.log=5071) #OPTS=" -x dcw -vvv -D" #everything (bogodir.log=5416) #OPTS=" -x cdfghlmrstw -vvvv -D" # just $HOME should display /home/userid unset BOGOFILTER_DIR expect="$HOME/.bogofilter" map_rc $BOGOFILTER $OPTS -C < /dev/null cat <"$TMPDIR/bogodir.cf" bogofilter_dir=$TMPDIR/bogoconf.d EOF # config file should display "command" expect="$TMPDIR/bogoconf.d" map_rc $BOGOFILTER $OPTS -c "$TMPDIR/bogodir.cf" < /dev/null # command line and config file should display "command.d" expect="$TMPDIR/command.d" map_rc $BOGOFILTER $OPTS -c "$TMPDIR/bogodir.cf" -d "$TMPDIR/command.d" < /dev/null # $HOME and $BOGOFILTER_DIR should display $TMPDIR expect="$BOGOFILTER_DIR" map_rc $BOGOFILTER $OPTS -C < /dev/null map_rc $BOGOFILTER $OPTS -c "$TMPDIR/bogodir.cf" < /dev/null # command line should display "command.d" expect="$TMPDIR/command.d" map_rc $BOGOFILTER $OPTS -C -d "$TMPDIR/command.d" < /dev/null map_rc $BOGOFILTER $OPTS -c "$TMPDIR/bogodir.cf" -d "$TMPDIR/command.d" < /dev/null # test whether command line supercedes bogus config file entry cat <"$TMPDIR/bogodir.cf" bogofilter_dir=$TMPDIR/bogus wordlist r,word,wordlist.$DB_EXT,1 EOF map_rc $BOGOFILTER $OPTS -c "$TMPDIR/bogodir.cf" -d "$TMPDIR/command.d" -v < /dev/null test ! -d "$TMPDIR/bogus" bogofilter-1.2.4/src/tests/t.rfc2047_folded0000755000175000017500000000357512163572274016606 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # This test checks if merging of folded header lines with encoded words # is working properly. # # test below # remember to use ${srcdir} cat > "$TMPDIR"/input <<_EOF Subject: =?iso-8859-1?q?ok?= =?iso-8859-1?q?ay?= another =?iso-8859-1?q?merge?= =?iso-8859-1?q?_worked?= Reply-To: =?iso-8859-1?Q?jo?= =?iso-8859-1?Q?in?= Reply-To: =?iso-8859-1?Q?jo?= =?iso-8859-1?Q?in?= Received: =?iso-8859-1?Q?john?= q =?iso-8859-1?Q?doe?= Received: =?iso-8859-1?Q?john?=_q_=?iso-8859-1?Q?public?= X-Subject: =?ISO-8859-1?Q?Zur=FCckbehaltungsre?=cht an Dateien =?ISO-8859-1?Q?f=FCr_?=?iso-8859-1?Q?Website?= - torso - header: =?iso-8859-1?q?bo?= =?iso-8859-1?q?dy?= _EOF cat > "$TMPDIR/reference.raw" <<_EOF subj:okay subj:another subj:merge subj:worked head:Reply-To head:join head:Reply-To head:join rcvd:john rcvd:doe rcvd:john_q_public head:X-Subject head:Zurückbehaltungsrecht head:Dateien head:für head:iso-8859-1 head:Website torso header iso-8859-1 iso-8859-1 _EOF cat > "$TMPDIR"/reference.utf8 <<_EOF subj:okay subj:another subj:merge subj:worked head:Reply-To head:join head:Reply-To head:join rcvd:john rcvd:doe rcvd:john_q_public head:X-Subject head:Zurückbehaltungsrecht head:Dateien head:für head:iso-8859-1 head:Website torso header iso-8859-1 iso-8859-1 _EOF if [ -z "$USE_UNICODE" ] ; then UNICODE_NO="--unicode=no" UNICODE_YES="--unicode=yes" fi if [ -z "$USE_UNICODE" -o "$USE_UNICODE" = "no" ] ; then $BOGOLEXER -p -C $UNICODE_NO < "$TMPDIR/input" > "$TMPDIR/output.raw" cmp "$TMPDIR"/reference.raw "$TMPDIR/output.raw" \ || diff "$TMPDIR/reference.raw" "$TMPDIR/output.raw" fi if [ -z "$USE_UNICODE" -o "$USE_UNICODE" = "yes" ] ; then $BOGOLEXER -p -C $UNICODE_YES < "$TMPDIR"/input > "$TMPDIR/output.utf8" cmp "$TMPDIR/reference.utf8" "$TMPDIR/output.utf8" \ || diff "$TMPDIR"/reference.utf8 "$TMPDIR/output.utf8" fi bogofilter-1.2.4/src/tests/t.encoding0000755000175000017500000000621512163572274015762 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # # test common encoding related capabilities, e.g. # registering messages and database maintenance # # initialize rm -r "$TMPDIR"/* # reset TXN detection if [ $DB_TXN = true ] ; then TXN=--db-transaction=yes ; else TXN= ; fi MSG="msg.accents" cat <<_EOF > "$TMPDIR"/$MSG.txt Subject: UTF-8 testing Content-Type: text/html; charset=iso-8859-1 Accented characters: â château é Cédric í Cecília ó escribió ü Düsseldorf Special Characters: 0x92-’-windows-apostrophe 0x93-“-windows-left-quote 0x94-”-windows-right-quote 0xA0- -no-break-space 0xA1-¡-inverted-exclamation-mark 0xA2-¢-cent-sign 0xA3-£-pound-sign 0xA4-¤-yen-sign 0xA7-§-section-sign 0xA9-©-copyright-sign 0xAA-ª-feminine-ordinal-indicator 0xAB-«-left-pointing-double-angle-quotation-mark 0xAC-¬-not-sign 0xAD-­-soft-hyphen 0xAE-®-registered-sign 0xAF-¯-macron 0xB0-°-degree-sign 0xB1-±-plus-minus-sign 0xB2-²-superscript-two 0xB3-³-superscript-three 0xB5-µ-micro-sign 0xB6-¶-pilcrow-sign 0xB7-·-middle-dot 0xB9-¹-superscript-one 0xBA-º-masculine-ordinal-indicator 0xBB-»-right-pointing-double-angle-quotation-mark 0xBC-¼-inverted-question-mark 0xD7-×-multiplication-sign 0xF7-÷-division-sign _EOF DATE=`date +%Y%m%d` BOGODIR="$TMPDIR"/wordlist WORDLIST="$TMPDIR"/wordlist/wordlist.$DB_EXT [ ! -d "$BOGODIR" ] && mkdir "$BOGODIR" # create and dump wordlists with/without unicode # without uses iso-8859-1 # with uses utf-8 for YN in yes no ; do rm -fr "$BOGODIR"/* $BOGOFILTER -C -y 0 -n -d "$BOGODIR" --unicode=$YN < "$TMPDIR"/$MSG.txt $BOGOUTIL -C -y 0 -d "$WORDLIST" | sort > "$TMPDIR"/wordlist.$YN.txt done $BOGOUTIL -C -y 0 -d "$WORDLIST" | sort > "$TMPDIR"/wordlist.raw.txt iconv -f iso-8859-1 -t utf-8 <"$TMPDIR"/wordlist.raw.txt | \ sed "s/.ENCODING 1/.ENCODING 2/" | sort > "$TMPDIR"/wordlist.iconv.txt # convert from iso-8859-1 to unicode $BOGOUTIL -C -y 0 -m "$WORDLIST" --unicode=yes $BOGOUTIL -C -y 0 -d "$WORDLIST" | sort > "$TMPDIR"/wordlist.new.txt # convert from unicode to iso-8859-1 $BOGOUTIL -C -y 0 -m "$WORDLIST" --unicode=no $BOGOUTIL -C -y 0 -d "$WORDLIST" | sort > "$TMPDIR"/wordlist.old.txt echo "This is a test." > "$TMPDIR"/empty.txt if ! cksum > "$TMPDIR"/empty.sum "$TMPDIR"/empty.txt ; then echo >&2 'cksum utility not found' exit 77 fi tr ' ' ' ' <"$TMPDIR"/empty.sum | cut -d " " -f 1-2 > "$TMPDIR"/empty.sumonly if ! echo "2711662207 16" | cmp -s - "$TMPDIR"/empty.sumonly then echo >&2 'cksum utility not POSIX compliant!' exit 1 fi cat < "$TMPDIR"/cksum.ref 1059676362 909 wordlist.iconv.txt 1059676362 909 wordlist.new.txt 3303802408 880 wordlist.no.txt 3303802408 880 wordlist.old.txt 3303802408 880 wordlist.raw.txt 1059676362 909 wordlist.yes.txt EOF for FILE in "$TMPDIR"/wordlist.*.txt ; do cksum "$FILE" | $AWK '{ printf "%s %s ", $1, $2 }' >> "$TMPDIR"/cksum.out basename "$FILE" >> "$TMPDIR"/cksum.out done if [ $verbose -eq 0 ] ; then cmp "$TMPDIR"/cksum.ref "$TMPDIR"/cksum.out else diff -s "$TMPDIR"/cksum.ref "$TMPDIR"/cksum.out fi bogofilter-1.2.4/src/tests/t.token.count0000755000175000017500000000450512163572275016444 0ustar sezsez#!/bin/sh +x . ${srcdir=.}/t.frame map_rc() { ( set +e eval "$@" a=$? [ $a -eq 0 ] && exit 0 [ $a -eq 1 ] && exit 0 [ $a -eq 2 ] && exit 0 exit $a ) } INP="$TMPDIR"/token.count.msg OUT="$TMPDIR"/token.count.txt REF="$OUTPUTS"/token.count.ref $BOGOFILTER -C -y 0 -s -M -I "$SYSTEST/inputs/spam.mbx" $BOGOFILTER -C -y 0 -n -M -I "$SYSTEST/inputs/good.mbx" cat > $INP < "$CFG" header_format = %h: %c, tests=bogofilter, spamicity=%p EOF # large min_dev - few tokens scored TST_L="--min-dev=0.496" # min 4 -- score more MIN_L4="--min-dev=0.496 --token-count-min=4" # max 8 -- OK - 2 less than 8 MAX_L8="--min-dev=0.496 --token-count-max=8" # small min_dev - many tokens scored TST_S="--min-dev=0.100" # min 4 -- OK - 4 less than 18 MIN_S4="--min-dev=0.100 --token-count-min=4" # max 8 -- score fewer MAX_S8="--min-dev=0.100 --token-count-max=8" # fix 20 -- score more FIX_S20="--min-dev=0.100 --token-count=20" cat /dev/null > $OUT #TOK="-x s -D" for OPT in "$TST_L" "$MIN_L4" "$MAX_L8" "$TST_S" "$MIN_S4" "$MAX_S8" "$FIX_S20" ; do echo "#### $OPT ####" >> $OUT map_rc $BOGOFILTER $OPT $TOK -c $CFG -vvv -H -I $INP >> $OUT if [ -n "$TOK" ] ; then echo >> $OUT fi done for OPT in "$TST_L" "$MIN_L4" "$MAX_L8" "$TST_S" "$MIN_S4" "$MAX_S8" "$FIX_S20" ; do SCORE=$( map_rc $BOGOFILTER $OPT $TOK -c $CFG -v -tt -H -I $INP ) echo "#### $SCORE $OPT " >> $OUT done if [ $verbose -eq 0 ]; then diff "$REF" "$OUT" cmp "$REF" "$OUT" else diff $DIFF_BRIEF "$REF" "$OUT" fi bogofilter-1.2.4/src/tests/run.sh0000644000175000017500000000224512163572274015143 0ustar sezsez#! /bin/sh #Test bogoutil and bogoupgrade #Test 1 -- combined count/data text file #Test 2 -- separate count, BDB data file. #Test 3 -- Same as 2 except that BDB file has a .count token. #Test 4 -- Same as 2 except that BDB file has a .MSG_COUNT token. # Technically already upgraded. set -e yday="-y 0" ( setopt SH_WORD_SPLIT 2> /dev/null ) && setopt SH_WORD_SPLIT while : ; do tdir=${BF_TESTDIR=.}/checks.$$.`date +"%Y%m%dT%H%M%S"` mkdir $tdir && break sleep 1 done trap "rm -f -r $tdir" 0 1 2 3 15 inputfile="input-${num}" for ext in txt count; do t="${inputfile}.$ext" if [ -f $srcdir/$t ]; then inputfile=$t break fi done if [ ! -f "$srcdir/$inputfile" ]; then exit 2; fi cp -f $srcdir/$inputfile $tdir/ datafile="$srcdir/input-${num}-data.txt" inputdb="input-${num}.db" if [ -f "$datafile" ]; then rm -f $tdir/$inputdb ../../bogoutil $yday -l $tdir/$inputdb < $datafile fi outputdb="output-${num}.db" rm -f $tdir/$outputdb perl ${srcdir}/../../bogoupgrade $yday -b ../../bogoutil \ -i $tdir/$inputfile -o $tdir/$outputdb \ && ../../bogoutil $yday -d $tdir/$outputdb \ |LC_COLLATE=C sort\ |diff - ${srcdir}/output-${num}.txt bogofilter-1.2.4/src/tests/t.save0000755000175000017500000000062012163572275015125 0ustar sezsez#!/bin/sh : ${BF_SAVEDIR=.} if [ ! -z "$BF_SAVEDIR" ] ; then NAME=`basename $0 | sed s@^t\.@@` DATE=`date +"%Y%m%d"` if [ -d $NAME.$DATE ] ; then rm -rf $NAME.$DATE fi mkdir $NAME.$DATE ( cd $TMPDIR ; tar cf - *) | ( cd $NAME.$DATE ; tar xf - ) while { fname=$NAME.`date +"%Y%m%d-%H%M%S"`.tar.gz test -f $fname } ; do sleep 1 ; done tar czf $fname $TMPDIR fi bogofilter-1.2.4/src/tests/Makefile.in0000644000175000017500000006141012163573272016046 0ustar sezsez# Makefile.in generated by automake 1.12.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2012 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # $Id: Makefile.am 6975 2012-11-06 02:18:15Z m-a $ VPATH = @srcdir@ am__make_dryrun = \ { \ am__dry=no; \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ echo 'am--echo: ; @echo "AM" OK' | $(MAKE) -f - 2>/dev/null \ | grep '^AM OK$$' >/dev/null || am__dry=yes;; \ *) \ for am__flg in $$MAKEFLAGS; do \ case $$am__flg in \ *=*|--*) ;; \ *n*) am__dry=yes; break;; \ esac; \ done;; \ esac; \ test $$am__dry = yes; \ } pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ check_PROGRAMS = dehex$(EXEEXT) spam_header_name$(EXEEXT) \ dumbhead$(EXEEXT) deqp$(EXEEXT) deb64$(EXEEXT) escnp$(EXEEXT) \ abortme$(EXEEXT) u_fpe$(EXEEXT) wantcore$(EXEEXT) \ leakmem$(EXEEXT) ctype$(EXEEXT) XFAIL_TESTS = TESTS = $(BUILT_TESTS) $(am__EXEEXT_1) subdir = src/tests DIST_COMMON = README $(srcdir)/Makefile.am $(srcdir)/Makefile.in \ $(top_srcdir)/depcomp ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/gsl.m4 \ $(top_srcdir)/m4/iconv.m4 $(top_srcdir)/m4/lib-ld.m4 \ $(top_srcdir)/m4/lib-link.m4 $(top_srcdir)/m4/lib-prefix.m4 \ $(top_srcdir)/m4/stdbool.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/src/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = abortme_SOURCES = abortme.c abortme_OBJECTS = abortme.$(OBJEXT) abortme_LDADD = $(LDADD) abortme_DEPENDENCIES = ctype_SOURCES = ctype.c ctype_OBJECTS = ctype.$(OBJEXT) ctype_LDADD = $(LDADD) ctype_DEPENDENCIES = deb64_SOURCES = deb64.c deb64_OBJECTS = deb64.$(OBJEXT) deb64_LDADD = $(LDADD) deb64_DEPENDENCIES = dehex_SOURCES = dehex.c dehex_OBJECTS = dehex.$(OBJEXT) dehex_LDADD = $(LDADD) dehex_DEPENDENCIES = deqp_SOURCES = deqp.c deqp_OBJECTS = deqp.$(OBJEXT) deqp_LDADD = $(LDADD) deqp_DEPENDENCIES = dumbhead_SOURCES = dumbhead.c dumbhead_OBJECTS = dumbhead.$(OBJEXT) dumbhead_LDADD = $(LDADD) dumbhead_DEPENDENCIES = escnp_SOURCES = escnp.c escnp_OBJECTS = escnp.$(OBJEXT) escnp_LDADD = $(LDADD) escnp_DEPENDENCIES = leakmem_SOURCES = leakmem.c leakmem_OBJECTS = leakmem.$(OBJEXT) leakmem_LDADD = $(LDADD) leakmem_DEPENDENCIES = spam_header_name_SOURCES = spam_header_name.c spam_header_name_OBJECTS = spam_header_name.$(OBJEXT) spam_header_name_LDADD = $(LDADD) spam_header_name_DEPENDENCIES = u_fpe_SOURCES = u_fpe.c u_fpe_OBJECTS = u_fpe.$(OBJEXT) u_fpe_LDADD = $(LDADD) u_fpe_DEPENDENCIES = wantcore_SOURCES = wantcore.c wantcore_OBJECTS = wantcore.$(OBJEXT) wantcore_LDADD = $(LDADD) wantcore_DEPENDENCIES = DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)/src depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ SOURCES = abortme.c ctype.c deb64.c dehex.c deqp.c dumbhead.c escnp.c \ leakmem.c spam_header_name.c u_fpe.c wantcore.c DIST_SOURCES = abortme.c ctype.c deb64.c dehex.c deqp.c dumbhead.c \ escnp.c leakmem.c spam_header_name.c u_fpe.c wantcore.c am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac ETAGS = etags CTAGS = ctags am__tty_colors_dummy = \ mgn= red= grn= lgn= blu= brg= std=; \ am__color_tests=no am__tty_colors = $(am__tty_colors_dummy) am__EXEEXT_1 = $(ENVIRON_TESTS) $(PARSING_TESTS) $(WORDLIST_TESTS) \ $(SCORING_TESTS) $(BULKMODE_TESTS) $(INTEGRITY_TESTS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DB_EXT = @DB_EXT@ DB_TYPE = @DB_TYPE@ DEFAULT_CHARSET = @DEFAULT_CHARSET@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ ENCODING = @ENCODING@ EXEEXT = @EXEEXT@ EXE_EXT = @EXE_EXT@ GREP = @GREP@ GSL_CFLAGS = @GSL_CFLAGS@ GSL_CONFIG = @GSL_CONFIG@ GSL_LIBS = @GSL_LIBS@ HAVE_EXTENDED_PRECISION_REGISTERS = @HAVE_EXTENDED_PRECISION_REGISTERS@ HAVE_EXTERN_INLINE = @HAVE_EXTERN_INLINE@ HAVE_INLINE = @HAVE_INLINE@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LEX = @LEX@ LEXLIB = @LEXLIB@ LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@ LIBDB = @LIBDB@ LIBICONV = @LIBICONV@ LIBOBJS = @LIBOBJS@ LIBQDBM = @LIBQDBM@ LIBS = @LIBS@ LIBSQLITE3 = @LIBSQLITE3@ LIBTOKYOCABINET = @LIBTOKYOCABINET@ LTLIBDB = @LTLIBDB@ LTLIBICONV = @LTLIBICONV@ LTLIBOBJS = @LTLIBOBJS@ LTLIBQDBM = @LTLIBQDBM@ LTLIBSQLITE3 = @LTLIBSQLITE3@ LTLIBTOKYOCABINET = @LTLIBTOKYOCABINET@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ NSGMLS = @NSGMLS@ OBJEXT = @OBJEXT@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PERL = @PERL@ RANLIB = @RANLIB@ RPMBUILD = @RPMBUILD@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STATICLDFLAGS = @STATICLDFLAGS@ STATIC_DB = @STATIC_DB@ STRIP = @STRIP@ USE_TRANSACTIONS = @USE_TRANSACTIONS@ USE_UNICODE = @USE_UNICODE@ VERSION = @VERSION@ XMLLINT = @XMLLINT@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ ac_cv_enable_xmlto = @ac_cv_enable_xmlto@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ transformed_bogofilter = @transformed_bogofilter@ transformed_bogoutil = @transformed_bogoutil@ AM_CPPFLAGS = -I$(srcdir)/.. AM_LDFLAGS = -L.. LDADD = -lbogofilter BUILT_SOURCES = t.config t.query.config CLEANFILES = $(BUILT_SOURCES) ENVIRON_TESTS = t.abort t.env t.ctype t.bogodir t.leakfind t.u_fpe @ENABLE_UNICODE_TRUE@ENCODING_TESTS = t.encoding PARSING_TESTS = \ t.longoptions \ t.ignore_spam_header \ t.nullstatsprefix \ t.integrity t.integrity2 t.integrity3 \ t.passthrough-hb \ t.escaped.html t.escaped.url \ t.base64 t.split t.parsing \ t.lexer t.lexer.mbx t.lexer.qpcr t.lexer.eoh \ t.spam.header.place \ t.block.on.subnets \ t.token.count \ t.multiple.tokens.head t.multiple.tokens.body t.multiple.tokens.min.mul \ $(ENCODING_TESTS) \ t.rfc2047_broken t.rfc2047_folded \ t.crash-invalid-base64 \ t.message_addr t.message_id t.queue_id WORDLIST_TESTS = t.dump.load t.nonascii.replace t.maint t.robx t.regtest t.upgrade.subnet.prefix t.multiple.wordlists t.probe t.bf_compact SCORING_TESTS = t.score1 t.score2 t.systest t.grftest t.wordhist BULKMODE_TESTS = t.bulkmode t.MH t.maildir t.bogoutil INTEGRITY_TESTS = t.lock1 t.lock3 t.valgrind # INTEGRITY_TESTS += t.lock2 # these tests are built, but must not be shipped: BUILT_TESTS = t.query.config TESTSCRIPTS = ${ENVIRON_TESTS} ${PARSING_TESTS} ${WORDLIST_TESTS} ${SCORING_TESTS} ${BULKMODE_TESTS} ${INTEGRITY_TESTS} TESTS_ENVIRONMENT = RUN_FROM_MAKE=1 AWK=$(AWK) srcdir=$(srcdir) SHELL="$(SHELL)" $(SHELL) $(VERBOSE) EXTRA_DIST = $(TESTSCRIPTS) t.frame t.save t.skel \ printcore t._abort unsort.pl \ t.query.config.in \ run.sh \ inputs/dump.load.inp \ inputs/dump.load.upd \ inputs/good.mbx \ inputs/headerbody.txt \ inputs/lexer.inp \ inputs/lexer.mbx \ inputs/lexer.out \ inputs/mime-qp-cont-with-cr.txt \ inputs/msg.1.txt \ inputs/msg.2.txt \ inputs/msg.3.txt \ inputs/msg.4.txt \ inputs/msg.5.txt \ inputs/msg.6.txt \ inputs/msg.7.txt \ inputs/msg.8.txt \ inputs/msg.flex \ inputs/msg.parsing.txt \ inputs/msg.regtest.n \ inputs/msg.regtest.s \ inputs/msg.split.bg.0117.text \ inputs/msg.split.dr.0118.base64 \ inputs/msg.split.gs.0119.text \ inputs/spam.mbx \ outputs/MH.out \ outputs/bogolex.out \ outputs/bulkmode.out \ outputs/dump.load-1.out \ outputs/dump.load-2.out \ outputs/dump.load-3.out \ outputs/dump.load-4.out \ outputs/dump.load-5.out \ outputs/dump.load-6.out \ outputs/grftest.out \ outputs/lexer.out \ outputs/maildir.out \ outputs/message_addr.ref \ outputs/message_id.ref \ outputs/mime-qp-cont-with-cr.exp \ outputs/msg.1.v \ outputs/msg.2a.vv \ outputs/msg.2a.vvv \ outputs/msg.2b.vv \ outputs/msg.2b.vvv \ outputs/msg.3.vvv \ outputs/multiple.wordlists.ref \ outputs/parsing.out \ outputs/queue_id.ref \ outputs/split.out \ outputs/token.count.ref all: $(BUILT_SOURCES) $(MAKE) $(AM_MAKEFLAGS) all-am .SUFFIXES: .SUFFIXES: .c .o .obj $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/tests/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign src/tests/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): clean-checkPROGRAMS: -test -z "$(check_PROGRAMS)" || rm -f $(check_PROGRAMS) abortme$(EXEEXT): $(abortme_OBJECTS) $(abortme_DEPENDENCIES) $(EXTRA_abortme_DEPENDENCIES) @rm -f abortme$(EXEEXT) $(LINK) $(abortme_OBJECTS) $(abortme_LDADD) $(LIBS) ctype$(EXEEXT): $(ctype_OBJECTS) $(ctype_DEPENDENCIES) $(EXTRA_ctype_DEPENDENCIES) @rm -f ctype$(EXEEXT) $(LINK) $(ctype_OBJECTS) $(ctype_LDADD) $(LIBS) deb64$(EXEEXT): $(deb64_OBJECTS) $(deb64_DEPENDENCIES) $(EXTRA_deb64_DEPENDENCIES) @rm -f deb64$(EXEEXT) $(LINK) $(deb64_OBJECTS) $(deb64_LDADD) $(LIBS) dehex$(EXEEXT): $(dehex_OBJECTS) $(dehex_DEPENDENCIES) $(EXTRA_dehex_DEPENDENCIES) @rm -f dehex$(EXEEXT) $(LINK) $(dehex_OBJECTS) $(dehex_LDADD) $(LIBS) deqp$(EXEEXT): $(deqp_OBJECTS) $(deqp_DEPENDENCIES) $(EXTRA_deqp_DEPENDENCIES) @rm -f deqp$(EXEEXT) $(LINK) $(deqp_OBJECTS) $(deqp_LDADD) $(LIBS) dumbhead$(EXEEXT): $(dumbhead_OBJECTS) $(dumbhead_DEPENDENCIES) $(EXTRA_dumbhead_DEPENDENCIES) @rm -f dumbhead$(EXEEXT) $(LINK) $(dumbhead_OBJECTS) $(dumbhead_LDADD) $(LIBS) escnp$(EXEEXT): $(escnp_OBJECTS) $(escnp_DEPENDENCIES) $(EXTRA_escnp_DEPENDENCIES) @rm -f escnp$(EXEEXT) $(LINK) $(escnp_OBJECTS) $(escnp_LDADD) $(LIBS) leakmem$(EXEEXT): $(leakmem_OBJECTS) $(leakmem_DEPENDENCIES) $(EXTRA_leakmem_DEPENDENCIES) @rm -f leakmem$(EXEEXT) $(LINK) $(leakmem_OBJECTS) $(leakmem_LDADD) $(LIBS) spam_header_name$(EXEEXT): $(spam_header_name_OBJECTS) $(spam_header_name_DEPENDENCIES) $(EXTRA_spam_header_name_DEPENDENCIES) @rm -f spam_header_name$(EXEEXT) $(LINK) $(spam_header_name_OBJECTS) $(spam_header_name_LDADD) $(LIBS) u_fpe$(EXEEXT): $(u_fpe_OBJECTS) $(u_fpe_DEPENDENCIES) $(EXTRA_u_fpe_DEPENDENCIES) @rm -f u_fpe$(EXEEXT) $(LINK) $(u_fpe_OBJECTS) $(u_fpe_LDADD) $(LIBS) wantcore$(EXEEXT): $(wantcore_OBJECTS) $(wantcore_DEPENDENCIES) $(EXTRA_wantcore_DEPENDENCIES) @rm -f wantcore$(EXEEXT) $(LINK) $(wantcore_OBJECTS) $(wantcore_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/abortme.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ctype.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/deb64.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/dehex.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/deqp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/dumbhead.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/escnp.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/leakmem.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/spam_header_name.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/u_fpe.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/wantcore.Po@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'` ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" cscopelist: $(HEADERS) $(SOURCES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags check-TESTS: $(TESTS) @failed=0; all=0; xfail=0; xpass=0; skip=0; \ srcdir=$(srcdir); export srcdir; \ list=' $(TESTS) '; \ $(am__tty_colors); \ if test -n "$$list"; then \ for tst in $$list; do \ if test -f ./$$tst; then dir=./; \ elif test -f $$tst; then dir=; \ else dir="$(srcdir)/"; fi; \ if $(TESTS_ENVIRONMENT) $${dir}$$tst $(AM_TESTS_FD_REDIRECT); then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xpass=`expr $$xpass + 1`; \ failed=`expr $$failed + 1`; \ col=$$red; res=XPASS; \ ;; \ *) \ col=$$grn; res=PASS; \ ;; \ esac; \ elif test $$? -ne 77; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xfail=`expr $$xfail + 1`; \ col=$$lgn; res=XFAIL; \ ;; \ *) \ failed=`expr $$failed + 1`; \ col=$$red; res=FAIL; \ ;; \ esac; \ else \ skip=`expr $$skip + 1`; \ col=$$blu; res=SKIP; \ fi; \ echo "$${col}$$res$${std}: $$tst"; \ done; \ if test "$$all" -eq 1; then \ tests="test"; \ All=""; \ else \ tests="tests"; \ All="All "; \ fi; \ if test "$$failed" -eq 0; then \ if test "$$xfail" -eq 0; then \ banner="$$All$$all $$tests passed"; \ else \ if test "$$xfail" -eq 1; then failures=failure; else failures=failures; fi; \ banner="$$All$$all $$tests behaved as expected ($$xfail expected $$failures)"; \ fi; \ else \ if test "$$xpass" -eq 0; then \ banner="$$failed of $$all $$tests failed"; \ else \ if test "$$xpass" -eq 1; then passes=pass; else passes=passes; fi; \ banner="$$failed of $$all $$tests did not behave as expected ($$xpass unexpected $$passes)"; \ fi; \ fi; \ dashes="$$banner"; \ skipped=""; \ if test "$$skip" -ne 0; then \ if test "$$skip" -eq 1; then \ skipped="($$skip test was not run)"; \ else \ skipped="($$skip tests were not run)"; \ fi; \ test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ report=""; \ if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ dashes=`echo "$$dashes" | sed s/./=/g`; \ if test "$$failed" -eq 0; then \ col="$$grn"; \ else \ col="$$red"; \ fi; \ echo "$${col}$$dashes$${std}"; \ echo "$${col}$$banner$${std}"; \ test -z "$$skipped" || echo "$${col}$$skipped$${std}"; \ test -z "$$report" || echo "$${col}$$report$${std}"; \ echo "$${col}$$dashes$${std}"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am $(MAKE) $(AM_MAKEFLAGS) $(check_PROGRAMS) $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: $(BUILT_SOURCES) $(MAKE) $(AM_MAKEFLAGS) check-am all-am: Makefile installdirs: install: $(BUILT_SOURCES) $(MAKE) $(AM_MAKEFLAGS) install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." -test -z "$(BUILT_SOURCES)" || rm -f $(BUILT_SOURCES) clean: clean-am clean-am: clean-checkPROGRAMS clean-generic mostlyclean-am distclean: distclean-am -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: all check check-am install install-am install-strip .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \ clean-checkPROGRAMS clean-generic cscopelist ctags distclean \ distclean-compile distclean-generic distclean-tags distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic pdf pdf-am ps ps-am tags uninstall \ uninstall-am t.config: Makefile ( echo >$@ 'EXE_EXT="@EXEEXT@"' ; \ echo >>$@ 'DB_EXT="@DB_EXT@"' ; \ echo >>$@ 'DB_TYPE="@DB_TYPE@"'; \ echo >>$@ 'USE_TRANSACTIONS="@USE_TRANSACTIONS@"' ; \ echo >>$@ 'USE_UNICODE="@USE_UNICODE@"' ) || rm -f $@ t.query.config: t.query.config.in Makefile rm -f $@ cat $(srcdir)/t.query.config.in | \ sed 's/[@]ENCODING[@]/@ENCODING@/' | \ sed 's/[@]DEFAULT_CHARSET[@]/@DEFAULT_CHARSET@/' > $@ || rm -f $@ chmod +x t.query.config # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: bogofilter-1.2.4/src/tests/t.query.config.in0000755000175000017500000000230512163572272017204 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame cat < "$TMPDIR"/reference # bogofilter version ... robx = 0.520000 # (5.20e-01) robs = 0.017800 # (1.78e-02) min_dev = 0.375000 # (3.75e-01) ham_cutoff = 0.450000 # (4.50e-01) spam_cutoff = 0.990000 # (9.90e-01) ns_esf = 1.000000 # (1.00e+00) sp_esf = 1.000000 # (1.00e+00) block-on-subnets = No encoding = @ENCODING@ charset-default = @DEFAULT_CHARSET@ replace-nonascii-characters = No stats-in-header = Yes thresh-update = 0.000000 timestamp = Yes spam-header-name = X-Bogosity spam-header-place = '' spam-subject-tag = '' unsure-subject-tag = '' header-format = %h: %c, tests=bogofilter, spamicity=%p, version=%v terse-format = %1.1c %f log-header-format = %h: %c, spamicity=%p, version=%v log-update-format = register-%r, %w words, %m messages spamicity-tags = Spam, Ham, Unsure spamicity-formats = %0.6f, %0.6f, %0.6f EOF $BOGOFILTER -C -Q | sed "s/# bogofilter version .*/# bogofilter version .../" > "$TMPDIR"/output CORRECT="$TMPDIR"/reference for OUT in "$TMPDIR"/output ; do if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi done bogofilter-1.2.4/src/tests/deb64.c0000644000175000017500000000137512163572275015057 0ustar sezsez/* $Id: deb64.c 6766 2009-01-12 04:27:36Z relson $ */ #include "common.h" #include #include #include /* for SEEK_*** for SunOS 4.1.x */ #include "base64.h" static void die(void) __attribute__((noreturn)); static void die(void) { perror("debase64"); exit(EXIT_FAILURE); } int main(void) { size_t size; word_t *w; if (fseek(stdin, 0, SEEK_END)) die(); size = ftell(stdin); if (fseek(stdin, 0, SEEK_SET)) die(); w = word_new(NULL, size); if (fread(w->u.text, 1, w->leng, stdin) != w->leng) die(); size = base64_decode(w); if (fwrite(w->u.text, 1, size, stdout) != size) die(); word_free(w); if (fflush(stdout)) die(); if (fclose(stdout)) die(); return EXIT_SUCCESS; } bogofilter-1.2.4/src/tests/t.upgrade.subnet.prefix0000755000175000017500000000264112163572275020416 0ustar sezsez#! /bin/sh . ${srcdir=.}/t.frame # test upgrading subnet tokens from "url:" to "ip:" prefix cat < "$TMPDIR"/t.before.ref .MSG_COUNT 0 1 test 0 1 this 0 1 url:127 0 1 url:127.0 0 1 url:127.0.0 0 1 url:127.0.0.1 0 1 url:192 0 1 url:192.168 0 1 url:192.168.3 0 1 url:192.168.3.4 0 1 EOF cat < "$TMPDIR"/t.after.ref Upgrading wordlist. .MSG_COUNT 0 1 .WORDLIST_VERSION 20040500 0 ip:127 0 1 ip:127.0 0 1 ip:127.0.0 0 1 ip:127.0.0.1 0 1 ip:192 0 1 ip:192.168 0 1 ip:192.168.3 0 1 ip:192.168.3.4 0 1 test 0 1 this 0 1 EOF cat < "$TMPDIR"/t.already.ref Wordlist has already been upgraded. .MSG_COUNT 0 1 .WORDLIST_VERSION 20040500 0 ip:127 0 1 ip:127.0 0 1 ip:127.0.0 0 1 ip:127.0.0.1 0 1 ip:192 0 1 ip:192.168 0 1 ip:192.168.3 0 1 ip:192.168.3.4 0 1 test 0 1 this 0 1 EOF create_empty_wordlist OPTS="-C -D -y 0" $BOGOUTIL $OPTS -l "$WORDLIST" < "$TMPDIR"/t.before.ref $BOGOUTIL $OPTS -d "$WORDLIST" | grep -v "^.ENCODING" | sort > "$TMPDIR"/t.before.out $BOGOUTIL $OPTS -u "$WORDLIST" > "$TMPDIR"/t.after.out $BOGOUTIL $OPTS -d "$WORDLIST" | grep -v "^.ENCODING" | sort >> "$TMPDIR"/t.after.out $BOGOUTIL $OPTS -u "$WORDLIST" > "$TMPDIR"/t.already.out $BOGOUTIL $OPTS -d "$WORDLIST" | grep -v "^.ENCODING" | sort >> "$TMPDIR"/t.already.out for i in "$TMPDIR"/*.ref ; do j=`basename "$i" .ref` if [ $verbose -eq 0 ]; then cmp "$i" "$TMPDIR"/$j.out else diff $DIFF_BRIEF "$i" "$TMPDIR"/$j.out fi done bogofilter-1.2.4/src/tests/printcore0000755000175000017500000000334012163572274015733 0ustar sezsez#! /bin/sh orc=$? set +e # This script tries to grab a core file and analyze it, obtaining a # backtrace. # (C) 2003 Matthias Andree # # Redistributable in accordance with the terms and conditions of the # GNU General Public License v2. # # THIS COMES WITHOUT ANY WARRANTIES! : ${GDB=gdb} # stage 1: find core file - we'll guess, not knowing all possible # core file name generators. Most tend to contain pid + "core" # or program name + "core". corefile="$(find . -name '*core*' -print | grep -w core | head -n1)" if [ -d "$TMPDIR" ] ; then corefile="$corefile$(find "$TMPDIR" -name '*core*' -print | grep -w core | head -n1)" fi if [ -z "$corefile" ] ; then if [ $orc -gt 0 ] ; then echo >&2 "No core file found" ; fi exit 0 fi echo >&2 ">>> Using core file \"$corefile\"." trap "rm -f \"$corefile\"" 0 # stage 2: pull name of executable file out of core backtick='`' LANG=C LC_MESSAGES=C export LANG LC_MESSAGES rm -f exit.$$ execfile="`( $GDB -nw -batch -nx -silent -c "$corefile" < /dev/null)`" if [ $? -gt 0 ] then echo >&2 "Problem with GDB program \"$GDB\"" exit 0 fi execfile=`echo "$execfile" | grep -i 'ore was generated by' | cut -f2- -d$backtick | cut -f1 -d"'" | cut -f1 -d" "` if [ -z "$execfile" ] then echo >&2 "Cannot figure executable." exit 0 fi echo >&2 ">>> Using exec file \"$execfile\"." # stage 3: obtain backtrace gdbfile="script.gdb.$$" rm -f "$gdbfile" cat <<_EOF > "$gdbfile" set height 0 set width 0 echo <<< SIMPLE BACKTRACE <<<\n backtrace echo <<< FULL BACKTRACE <<<\n backtrace full quit _EOF cmd="gdb -nw -r -batch -nx -x "$gdbfile" -silent "$execfile" "$corefile" < /dev/null" echo >&2 ">>> Running command: $cmd" eval "$cmd" rm -f "$gdbfile" echo >&2 ">>> Done." exit 0 bogofilter-1.2.4/src/tests/t.wordhist0000755000175000017500000000304112163572275016032 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # wordhist.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # wordhist.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame [ -d "$TMPDIR"/tests ] && rm -rf "$TMPDIR"/tests mkdir -p "$TMPDIR"/tests OUT="$TMPDIR"/wordhist.out REF="$TMPDIR/wordhist.ref" cat < "$REF" Histogram score count pct histogram 0.00 3515 66.30 ################################################ 0.05 1 0.02 # 0.10 1 0.02 # 0.15 7 0.13 # 0.20 10 0.19 # 0.25 12 0.23 # 0.30 16 0.30 # 0.35 27 0.51 # 0.40 38 0.72 # 0.45 19 0.36 # 0.50 82 1.55 ## 0.55 10 0.19 # 0.60 29 0.55 # 0.65 135 2.55 ## 0.70 7 0.13 # 0.75 22 0.41 # 0.80 63 1.19 # 0.85 14 0.26 # 0.90 28 0.53 # 0.95 1266 23.88 ################## tot 5302 hapaxes: ham 2593 (48.91%), spam 784 (14.79%) pure: ham 3515 (66.30%), spam 1257 (23.71%) EOF OPTS="-C -y 0" $BOGOFILTER $OPTS -s < "$SYSTEST/inputs/spam.mbx" $BOGOFILTER $OPTS -n < "$SYSTEST/inputs/good.mbx" $BOGOUTIL -C -H "$BOGOFILTER_DIR/wordlist.$DB_EXT" > "$OUT" $BOGOUTIL -C -d "$BOGOFILTER_DIR/wordlist.$DB_EXT" > "$TMPDIR"/wordlist.txt if [ $verbose -eq 0 ]; then cmp "$REF" "$OUT" else diff $DIFF_BRIEF "$REF" "$OUT" fi bogofilter-1.2.4/src/tests/t.ignore_spam_header0000755000175000017500000000146512163572275020012 0ustar sezsez#! /bin/sh . ${srcdir=.}/t.frame # t.ignore_spam_header # # bogofilter should remove all copies of the spam # header line in the incoming message, i.e. # the output file should exactly 1 copy of it. shn=`./spam_header_name` cat > "$TMPDIR/input" < "$TMPDIR/output1" # check non-seekable input cat "$TMPDIR/input" | $VAL $BOGOFILTER -p -e -C > "$TMPDIR/output2" count1=`grep $shn "$TMPDIR"/output1 | wc -l` count2=`grep $shn "$TMPDIR/output2" | wc -l` if [ $count1 = "1" ] && [ $count2 = "1" ] ; then exit 0 else echo count1: $count1, count2: $count2 exit 1 fi bogofilter-1.2.4/src/tests/t.nonascii.replace0000755000175000017500000000316612163572274017413 0ustar sezsez#! /bin/sh . ${srcdir=.}/t.frame # create a test wordlist with tokens containing non-ascii characters, # replace the non-ascii characters to question marks, # check the number of tokens in the wordlist # # test below # remember to use ${srcdir} # check for non-default configuration if [ -n "$USE_UNICODE" -a "$USE_UNICODE" != "yes" ] ; then exit 77 fi if [ -z "$USE_UNICODE" ] ; then UNICODE_NO="--unicode=no" fi echo 41 A4 BA B5 B5 20 31 20 30 20 32 30 30 33 30 33 30 33 0A \ 41 C1 BA B8 B5 20 32 20 30 20 32 30 30 32 31 32 30 32 0A \ 41 BA C1 B8 B5 20 33 20 30 20 32 30 30 33 30 33 30 31 0A \ 42 A4 BA B8 B5 B5 20 31 20 30 20 32 30 30 33 30 33 30 33 0A \ 42 C1 BA B8 B5 B5 20 32 20 30 20 32 30 30 32 31 32 30 32 0A \ 42 BA C1 B8 B5 B5 20 33 20 30 20 32 30 30 33 30 33 30 31 0A \ 42 C1 BA B5 B8 B5 20 34 20 30 20 32 30 30 33 30 33 30 34 0A \ | ./dehex > "$TMPDIR"/input $BOGOUTIL -C -l "$WORDLIST" < "$TMPDIR"/input $BOGOUTIL -C -d "$WORDLIST" | egrep -v "^(\.MSG_COUNT|\.ENCODING)" > "$TMPDIR"/output.1 $BOGOUTIL -C -n -m "$WORDLIST" $UNICODE_NO $BOGOUTIL -C -d "$WORDLIST" | egrep -v "^(\.MSG_COUNT|\.ENCODING)" > "$TMPDIR"/output.2 LEN1=`wc -l "$TMPDIR"/output.1 | $AWK '{print $1}'` LEN2=`wc -l "$TMPDIR"/output.2 | $AWK '{print $1}'` TOKDAT1=`head -1 "$TMPDIR"/output.2 | $AWK '{print $2 "." $4 }'` TOKDAT2=`tail -1 "$TMPDIR"/output.2 | $AWK '{print $2 "." $4 }'` RESULT=`printf "%d.%d %s %s" $LEN1 $LEN2 $TOKDAT1 $TOKDAT2` WANT="7.2 6.20030303 10.20030304" if [ "$RESULT" != "$WANT" ] || [ $verbose -gt 0 ] ; then echo want: \"$WANT\", have: \"$RESULT\" fi test "$RESULT" = "$WANT" bogofilter-1.2.4/src/tests/README0000644000175000017500000000020412163572275014655 0ustar sezsezDeveloper warnings: Solaris 8 head(1) cuts the output at the first NUL character. Solaris 8 sed(1) skips embedded NUL characters. bogofilter-1.2.4/src/tests/t.lexer.mbx0000755000175000017500000000403012163572274016071 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # lexer.mbx.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # lexer.mbx.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir:=.}/t.frame OUT="lexer.mbx.out" for f in good spam ; do $BOGOLEXER -C -D -p $v < "$srcdir/inputs/$f.mbx" > "$TMPDIR"/$f.1 sort < "$TMPDIR/$f.1" | uniq > "$TMPDIR/$f.2" if [ $verbose -ne 0 ]; then $BOGOLEXER -C -D -x ml -vvv -p < "$srcdir/inputs/$f.mbx" > "$TMPDIR"/$f.v fi done RESULT=`cat "$TMPDIR/spam.2" | wc -l`.`cat "$TMPDIR/good.2" | wc -l` RESULT=`echo "$RESULT" | sed s@\ @@g` WANT="1787.4045" if [ "$RESULT" != "$WANT" ] || [ $verbose -ne 0 ] ; then echo "want: $WANT, have: $RESULT" | tee "$TMPDIR"/$OUT fi if [ "$BF_SAVEDIR" ] ; then . "$srcdir"/t.save ; fi test "$RESULT" = "$WANT" ### Test binary attachment in first message followed by text attachment in second message ### Starting with v0.96.3 the second message is incorrectly parsed ### The problem is fixed in v0.96.6 cat > "$TMPDIR/msg.1.txt" < "$TMPDIR"/msg.2.txt < "$TMPDIR/msg.12.mbx" ( $BOGOLEXER -C -D -p < "$TMPDIR"/msg.1.txt ; \ $BOGOLEXER -C -D -p < "$TMPDIR/msg.2.txt" ) > "$TMPDIR/txt.out" ( $BOGOLEXER -C -D -p < "$TMPDIR"/msg.12.mbx ) > "$TMPDIR/mbx.out" cmp "$TMPDIR/txt.out" "$TMPDIR/mbx.out" \ || diff "$TMPDIR"/txt.out "$TMPDIR/mbx.out" bogofilter-1.2.4/src/tests/t.queue_id0000644000175000017500000000127212163572275015770 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame CFG="$TMPDIR/test.cf" OUT="$TMPDIR"/test.out CORRECT="$SYSTEST/outputs/queue_id.ref" cat < "$CFG" # include queue ID # suppress timestamps & version info in output header_format=%h: %c, queue_id=%Q EOF # build wordlists $BOGOFILTER -n -v -D -c "$CFG" -M -B "${srcdir}"/inputs/good.mbx > /dev/null $BOGOFILTER -s -v -D -c "$CFG" -M -B "${srcdir}"/inputs/spam.mbx > /dev/null $BOGOFILTER -v -D -c "$CFG" -M -B "${srcdir}"/inputs/good.mbx \ ${srcdir}/inputs/spam.mbx \ | sed 's}.*/inputs/}inputs/}' > "$OUT" # compare test output to reference output if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi bogofilter-1.2.4/src/tests/t.bf_compact0000755000175000017500000000151312163572275016266 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # wordhist.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs NODB=1 . ${srcdir=.}/t.frame [ -d "$TMPDIR"/tests ] && rm -rf "$TMPDIR"/tests mkdir -p "$TMPDIR"/tests OPTS="-C -y 0" $BOGOFILTER $OPTS -s < "$SYSTEST/inputs/spam.mbx" $BOGOFILTER $OPTS -n < "$SYSTEST/inputs/good.mbx" ( set -e $SHELL $BF_COMPACT $BOGOFILTER_DIR $BOGOUTIL -d "$WORDLIST" >$BOGOFILTER_DIR/cpc $BOGOUTIL -d "$BOGOFILTER_DIR/wordlist.$DB_EXT" >$BOGOFILTER_DIR/org if [ $verbose -eq 0 ] ; then cmp $BOGOFILTER_DIR/org $BOGOFILTER_DIR/cpc else diff $DIFF_BRIEF $BOGOFILTER_DIR/org $BOGOFILTER_DIR/cpc fi ) && a=0 || a=$? rm -rf "$BOGOFILTER_DIR.old" exit $a bogofilter-1.2.4/src/tests/ctype.c0000644000175000017500000000147412163572275015277 0ustar sezsez/** \file ctype.c * This file tests whether isspace() agrees with the POSIX definition of whitespace. * If so, it exits with EXIT_SUCCESS (0). * On broken systems such as OpenBSD 2.9 to 3.6 that return true for * isspace(0xa0), it will exit with EXIT_FAILURE. * \author Matthias Andree * \date 2005 * * GNU General Public License v2, without "any later version" option. */ #include #include #include #include const char POSIX_space[] = " \f\n\r\t\v"; int main(void) { int i; for (i=1; i < 256; i += 1) { int posix = strchr(POSIX_space, i) != NULL; int space = isspace(i) != 0; if (posix != space) { fprintf( stderr, "Error at %d. posix: %d, space: %d\n", i, posix, space ); fflush(stderr); exit(EXIT_FAILURE); } } exit(EXIT_SUCCESS); } bogofilter-1.2.4/src/tests/t.frame0000755000175000017500000001233212163572274015263 0ustar sezsez#!/bin/sh # testing framework for /bin/sh # if run from "make check", use pid and time to name TMPDIR, # which will automatically be deleted. # if run from command line, use testname and date for TMPDIR, # and suppress directory deletion. set -e exec < /dev/null : ${srcdir=.} : ${relpath=..} : ${BF_TESTDIR=.} # suck in EXE_EXT and DB_TYPE, export the latter. . ./t.config export DB_TYPE DB_EXT=${DB_EXT#.} export DB_EXT BOGOFILTER="$VAL${relpath}/bogofilter$EXE_EXT" BOGOLEXER="$VAL${relpath}/bogolexer$EXE_EXT" BOGOTUNE="$VAL${relpath}/bogotune$EXE_EXT" BOGOUTIL="$VAL${relpath}/bogoutil$EXE_EXT" BF_COMPACT="${relpath}/bf_compact" export BOGOFILTER export BOGOLEXER export BOGOTUNE export BOGOUTIL export BF_COMPACT # Cater for GNU coreutils "compatibility" _POSIX2_VERSION=199209 export _POSIX2_VERSION # Obtain data base file suffix DB_NAME=$("$BOGOFILTER" -C -V 2>&1 | sed -n '/Database:/ {p;q;}') case $DB_NAME in *BerkeleyDB*|*"Berkeley DB"*) case $DB_NAME in *" TRANSACTIONAL"*|*" AUTO-XA"*) DB_TXN=true ;; *) DB_TXN=false ;; esac ;; *QDBM*) DB_TXN=false ;; *Tokyo*) DB_TXN=true ;; *SQLite*) DB_TXN=true ;; *TrivialDB*) DB_TXN=false ;; *) echo >&2 "Unknown data base type in bogofilter -V: $DB_NAME" exit 1 ;; esac export DB_EXT DB_TXN # Cater for Solaris "compatibility" case $PATH in */usr/xpg4/bin:*) ;; *) if test -d /usr/xpg4/bin ; then PATH=/usr/xpg4/bin:$PATH export PATH fi ;; esac # However, Solaris' /usr/xpg4/bin/grep doesn't support long lines, so we # need to use /usr/bin/grep instead GREP=/bin/grep test -x $GREP || GREP=/usr/bin/grep test -x $GREP || { echo >&2 'Cannot find grep!' ; exit 1 ; } export GREP : ${AWK=awk} export AWK LANG= LC_COLLATE= LC_ALL= unset LANG || : unset LC_COLLATE || : unset LC_ALL || : i=0 INSERT=. while [ $i -lt 3 ] ; do PRINTCORE="$srcdir"/$INSERT/printcore if [ -f $PRINTCORE ] ; then break ; fi i=`expr $i + 1` INSERT=$INSERT/.. done SYSTEST=""$srcdir"" OUTPUTS=${SYSTEST}/outputs if [ -z "$RUN_FROM_MAKE" ] || [ "$SUPPRESS_DELETE" = YES ] ; then # standalone, from shell directly # THIS IS PRONE TO RACES NAME=`basename "$0" | sed -e 's/^t\.//'` DATE=`date +"%Y%m%d"` TMPDIR="$BF_TESTDIR/$NAME.$DATE" SUPPRESS_DELETE="NO" else # automated, from make while : ; do TMPDIR="$BF_TESTDIR/checks.$$.$(date +"%Y%m%dT%H%M%S")" if test x$SUPPRESS_DELETE = xNO ; then TMPDIR="$BF_TESTDIR/outputs.$(date +"%m%d")" ; fi mkdir "$TMPDIR" && break || : sleep 1 done fi rm -rf "$TMPDIR" mkdir "$TMPDIR" BOGOFILTER_DIR="$TMPDIR" export BOGOFILTER_DIR WORDLIST="$TMPDIR/wordlist.$DB_EXT" verbose=0 if [ "$1" = "-v" ]; then verbose=1 $BOGOFILTER -V 2> $TMPDIR/version.out fi if [ "$1" = "-vv" ]; then v="-x l -vv -D" verbose=2 fi if test "x$BF_TESTVERBOSE" != "x" ; then verbose=$BF_TESTVERBOSE fi if [ "$verbose" -ge 3 ] ; then echo "detected database type \"$DB_TYPE\", extension: \"$DB_EXT\", transactions: $DB_TXN" fi if test "x$SUPPRESS_DELETE" = "x" ; then trap '$SHELL $PRINTCORE ; rm -r -f core $TMPDIR' 0 else echo "Results are in $TMPDIR. Remove it after testing." fi create_empty_wordlist() { rm -f "$BOGOFILTER_DIR"/*.$DB_EXT rm -f "$BOGOFILTER_DIR"/__db.* "$BOGOFILTER_DIR"/log.* "$BOGOUTIL" -l "$BOGOFILTER_DIR/wordlist.$DB_EXT" < /dev/null } if [ -z "$NODB" ]; then create_empty_wordlist fi # check valgrind version case `(valgrind --version) 2> /dev/null` in valgrind-2.[123].*) VALGRIND="valgrind --tool=memcheck" ;; valgrind-*) VALGRIND="valgrind" ;; *) VALGRIND= ;; esac if [ "x$VALGRIND" != x ] ; then VALGRIND="$VALGRIND -q --num-callers=20" fi export VALGRIND # parse BF_CHECKTOOL BF_CHECKTOOL=${BF_CHECKTOOL-glibc} case ${BF_CHECKTOOL} in glibc) # make GNU libc nasty and abort on memory allocation issues: MALLOC_CHECK_=2 export MALLOC_CHECK_ ;; boehm-gc) # use the Boehm-Demers-Weiser Garbage Collector in find-leak mode, # only supported on Linux: for p in /usr/local/lib /usr/lib /lib ; do if test -f $p/libgc.so ; then VAL="env LD_PRELOAD=$p/libgc.so GC_FIND_LEAK=1 " export VAL break fi done ;; valgrind) # use valgrind if test "x$VALGRIND" != x ; then VAL="$VALGRIND --leak-check=yes " export VAL else echo >&2 "WARNING: valgrind not found or unsupported version, ignored." fi ;; efence) # use Electric Fence VAL="env LD_PRELOAD=libefence.so.0.0 " EF_PROTECT_FREE=1 EF_FILL=85 EF_ALLOW_MALLOC_0=1 EF_PROTECT_BELOW=0 EF_ALIGNMENT=0 export LD_PRELOAD EF_PROTECT_FREE EF_FILL EF_ALLOW_MALLOC_0 EF_PROTECT_BELOW export EF_ALIGNMENT VAL ;; "") ;; *) echo >&2 "WARNING: unsupported BF_CHECKTOOL=\"${BF_CHECKTOOL}\" ignored." echo >&2 " supported BF_CHECKTOOL values: glibc, boehm-gc, valgrind, efence" ;; esac # check diff options case `uname -s` in Linux) case $verbose in 1) DIFF_BRIEF="--brief -s" ;; 2) DIFF_BRIEF="-u" ;; esac ;; esac # ## HELPER FUNCTIONS --------------------------------------------- # split file on stdin into files 1, 2, 3, 4... at "From " lines. splitmbox() { $AWK 'BEGIN { f=0; } /^From / { close(f); f++; } { print $0 > f }' } bogofilter-1.2.4/src/tests/t.multiple.tokens.head0000755000175000017500000000306312163572275020230 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame INP="$TMPDIR"/test.inp REF="$TMPDIR/test.ref" OUT="$TMPDIR"/test.out CORRECT="$SYSTEST/outputs/multiple.wordlists.ref" cat < "$INP" From somebody@bogofilter.org To: somebody-else@bogofilter.org This is a test EOF cat < "$REF" ::: 1 ::: head:From head:somebody head:bogofilter.org to:somebody-else to:bogofilter.org This is test ::: 2 ::: head:From head:somebody head:From*somebody head:bogofilter.org head:somebody*bogofilter.org to:somebody-else to:bogofilter.org to:somebody-else*bogofilter.org This is This*is test is*test ::: 3 ::: head:From head:somebody head:From*somebody head:bogofilter.org head:somebody*bogofilter.org head:From*somebody*bogofilter.org to:somebody-else to:bogofilter.org to:somebody-else*bogofilter.org This is This*is test is*test This*is*test ::: 4 ::: head:From head:somebody head:From*somebody head:bogofilter.org head:somebody*bogofilter.org head:From*somebody*bogofilter.org to:somebody-else to:bogofilter.org to:somebody-else*bogofilter.org This is This*is test is*test This*is*test ::: 5 ::: head:From head:somebody head:From*somebody head:bogofilter.org head:somebody*bogofilter.org head:From*somebody*bogofilter.org to:somebody-else to:bogofilter.org to:somebody-else*bogofilter.org This is This*is test is*test This*is*test EOF for COUNT in 1 2 3 4 5 ; do echo "::: $COUNT :::" >> $OUT $BOGOLEXER -C -p --min-token-len 2 --multi-token-count $COUNT < "$INP" >> "$OUT" done if [ $verbose -eq 0 ]; then diff "$REF" "$OUT" cmp "$REF" "$OUT" else diff $DIFF_BRIEF "$REF" "$OUT" fi bogofilter-1.2.4/src/tests/t.base640000755000175000017500000000045712163572274015262 0ustar sezsez#! /bin/sh -x . ${srcdir:=.}/t.frame # # test base64 decoder functions # cat <<_EOF | $BOGOLEXER -C -q >/dev/null Content-Type: multipart/mixed;boundary="----bound" ------bound Content-Transfer-Encoding: base64 =C7ET=DDNERSAVA=DE=20 ------bound Content-Type: text/plain; charset="iso-8859-9" _EOF bogofilter-1.2.4/src/tests/t.score10000755000175000017500000000025212163572274015363 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # make sure that an uninitialized data base will not lead to bogus # spam qualifications echo | $VAL $BOGOFILTER -p -e -C > /dev/null bogofilter-1.2.4/src/tests/t.multiple.tokens.body0000755000175000017500000000210512163572274020257 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame INP="$TMPDIR/test.inp" REF="$TMPDIR"/test.ref OUT="$TMPDIR/test.out" CORRECT="$SYSTEST/outputs/multiple.wordlists.ref" cat < "$INP" aaa bbb ccc ddd eee fff EOF cat < "$REF" ::: 1 ::: aaa bbb ccc ddd eee fff ::: 2 ::: aaa bbb aaa*bbb ccc bbb*ccc ddd ccc*ddd eee ddd*eee fff eee*fff ::: 3 ::: aaa bbb aaa*bbb ccc bbb*ccc aaa*bbb*ccc ddd ccc*ddd bbb*ccc*ddd eee ddd*eee ccc*ddd*eee fff eee*fff ddd*eee*fff ::: 4 ::: aaa bbb aaa*bbb ccc bbb*ccc aaa*bbb*ccc ddd ccc*ddd bbb*ccc*ddd aaa*bbb*ccc*ddd eee ddd*eee ccc*ddd*eee bbb*ccc*ddd*eee fff eee*fff ddd*eee*fff ccc*ddd*eee*fff ::: 5 ::: aaa bbb aaa*bbb ccc bbb*ccc aaa*bbb*ccc ddd ccc*ddd bbb*ccc*ddd aaa*bbb*ccc*ddd eee ddd*eee ccc*ddd*eee bbb*ccc*ddd*eee aaa*bbb*ccc*ddd*eee fff eee*fff ddd*eee*fff ccc*ddd*eee*fff bbb*ccc*ddd*eee*fff EOF for COUNT in 1 2 3 4 5 ; do echo "::: $COUNT :::" >> $OUT $BOGOLEXER -C -H -p --multi-token-count $COUNT < "$INP" >> "$OUT" done if [ $verbose -eq 0 ]; then diff "$REF" "$OUT" cmp "$REF" "$OUT" else diff $DIFF_BRIEF "$REF" "$OUT" fi bogofilter-1.2.4/src/tests/t.parsing0000755000175000017500000000213112163572274015630 0ustar sezsez#!/bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # parsing.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # esp. parsing.out # # parsing.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame map_rc() { ( set +e eval "$@" a=$? [ $a -eq 0 ] && exit 0 [ $a -eq 1 ] && exit 0 exit $a ) } MSG="$SYSTEST/inputs/msg.parsing.txt" flaglist="IhT-2" for flags in $flaglist ; do opts=`echo $flags | tr -d "01234567-"` ( echo "****** " $opts " ******" ; \ $BOGOLEXER -C -D -p -v < "$MSG" ) | tee -a "$TMPDIR/parsing.out" > "$TMPDIR/tmp" if [ $verbose -ne 0 ]; then sort -u < "$TMPDIR"/tmp >> "$TMPDIR/parsing.sor" fi done if [ $verbose -ne 0 ]; then wc -l "$TMPDIR/parsing.out" wc -l "$TMPDIR"/parsing.sor fi OUT="${OUTPUTS}/parsing.out" test $verbose -eq 0 && cmp "$OUT" "$TMPDIR/parsing.out" \ || diff $DIFF_BRIEF "$OUT" "$TMPDIR"/parsing.out bogofilter-1.2.4/src/tests/t.skel0000755000175000017500000000015512163572275015130 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # test description here # # test below # remember to use ${srcdir} false bogofilter-1.2.4/src/tests/t.escaped.html0000755000175000017500000000137612163572274016546 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame cat > "$TMPDIR"/input <<_EOF From nobody@example.com Subject: **not interesting** Content-Type: text/html ABC; DEFG HIJKL ABC;—DEFG Get Anyone—Else RXY _EOF cat > "$TMPDIR"/reference <<_EOF ABC DEFG HIJKL ABC DEFG Get Anyone Else RXY SRC http www.prerequisite.com www.onlinemedstore.biz sv.php dvsr sonic-pik.com _EOF $BOGOLEXER -p -C < "$TMPDIR"/input | grep -v ":" > "$TMPDIR"/output cmp "$TMPDIR"/reference "$TMPDIR"/output \ || diff "$TMPDIR"/reference "$TMPDIR"/output bogofilter-1.2.4/src/tests/t.maint0000755000175000017500000000166012163572275015304 0ustar sezsez#!/bin/sh #Test database maintenance using bogoutil's dump/load capabilities. # The building of wordlist.db also tests bogofilter's lexer NODB=1 . ${srcdir=.}/t.frame OUT="$TMPDIR/maint.out" create_empty_wordlist $BOGOFILTER -C -y 0 -s < "$SYSTEST"/inputs/spam.mbx $BOGOFILTER -C -y 0 -n < "$SYSTEST"/inputs/good.mbx filter="egrep -v ^\\.ENCODING" CORRECT="$TMPDIR"/ref.txt cat >> "$CORRECT" < 5303 count 1 -> 1847 count 2 -> 949 count 3 -> 610 EOF echo "initial:" $($BOGOUTIL -d "$WORDLIST" | $filter | wc -l) > "$OUT" for cnt in 0 1 2 3 ; do $BOGOUTIL -C -c $cnt -m "$WORDLIST" echo "count $cnt ->" $($BOGOUTIL -C -d "$WORDLIST" | $filter | wc -l) >> "$OUT" if [ $verbose -ne 0 ]; then $BOGOUTIL -C -d "$WORDLIST" > "$OUT".$cnt fi done if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" \ || diff $DIFF_BRIEF "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi bogofilter-1.2.4/src/tests/t.bogoutil0000755000175000017500000000530012163572275016013 0ustar sezsez#! /bin/sh -x . ${srcdir:=.}/t.frame # # test common bogoutil functions # # initialize rm -r "$TMPDIR"/* # reset TXN detection if [ $DB_TXN = true ] ; then addarg=--db-transaction=yes ; else addarg= ; fi echo bacon on toast | $BOGOFILTER -C -d "$TMPDIR" -n $addarg echo foul eggs | $BOGOFILTER -C -d "$TMPDIR" -s $addarg # see that these do not crash $BOGOUTIL -C -v -V > /dev/null $BOGOUTIL -C -h > /dev/null # check if bogoutil can count ;-) cat <<_EOF > "$TMPDIR"/ref 7 tokens dumped _EOF $BOGOUTIL -C -v -d "$WORDLIST" -D | tail -1 > "$TMPDIR"/out cmp -s "$TMPDIR"/out "$TMPDIR"/ref # ROBX calculation cannot work, insufficient data if $BOGOUTIL -C -r "$WORDLIST" ; then false ; fi if $BOGOUTIL -C -R "$WORDLIST" ; then false ; fi # load more data as ROBX fodder $BOGOFILTER -xd -C -n -d "$TMPDIR" -M -B "$srcdir"/inputs/good.mbx $BOGOFILTER -xd -C -s -d "$TMPDIR" -M -B "$srcdir"/inputs/spam.mbx # printing robx must not store the token $BOGOUTIL -C -r "$WORDLIST" | egrep '^ ?0?.[0-9]+$' > /dev/null if $BOGOUTIL -C -w "$WORDLIST" .ROBX | egrep '^[[:alnum:]]' ; then false fi # storing robx must store the token, quite obviously :-) # also use -p so we test both -p and -w $BOGOUTIL -C -R "$WORDLIST" $BOGOUTIL -C -p "$WORDLIST" .ROBX | egrep '^\.ROBX' > /dev/null # check if it can dump tokens from stdin echo "head:toast" | $BOGOUTIL -C -p "$WORDLIST" \ | egrep '^head:toast' > /dev/null if [ $DB_TYPE = db ] || [ $DB_TYPE = sqlite ] ; then ps=`$BOGOUTIL -C --db-print-pagesize "$WORDLIST"` test -n "$ps" test "$ps" != UNKNOWN fi if [ $DB_TYPE = db ] ; then $BOGOUTIL -C --db-verify "$WORDLIST" pc=`$BOGOUTIL -C --db-print-leafpage-count "$WORDLIST"` test "$pc" != "" test "$pc" != "UNKNOWN" test "$pc" != "0" if [ $DB_TXN = true ] ; then $BOGOUTIL -C --db-recover "$TMPDIR"/ $BOGOUTIL -C --db-checkpoint "$TMPDIR"/ if ls "$TMPDIR/log."* > /dev/null 2>&1 ; then $BOGOUTIL -C --db-prune "$TMPDIR"/ ls "$TMPDIR"/log.* > "$TMPDIR"/logs.1 $BOGOUTIL -C --db-list-logfiles "$TMPDIR" all > "$TMPDIR/logs.2" cmp "$TMPDIR"/logs.1 "$TMPDIR"/logs.2 fi if ls "$TMPDIR/__db."* > /dev/null 2>&1 ; then $BOGOUTIL -C --db-remove-environment "$TMPDIR"/ if ls "$TMPDIR/__db."* > /dev/null 2>&1 ; then false fi fi fi fi #test with wordlist in current directory BOGOUTIL="$VAL`pwd`/${relpath}/bogoutil$EXE_EXT" WORDLIST="wordlist.${DB_EXT}" OPC=$PRINTCORE case $srcdir in /*) PRINTCORE="$srcdir"/$INSERT/printcore ;; *) PRINTCORE=`pwd`/"$srcdir"/$INSERT/printcore ;; esac unset BOGOFILTER_DIR cd "$TMPDIR" "$BOGOUTIL" -C -w "$WORDLIST" .MSG_COUNT > /dev/null "$BOGOUTIL" -C -p "$WORDLIST" .MSG_COUNT > /dev/null PRINTCORE=$OPC cd - > /dev/null bogofilter-1.2.4/src/tests/t.message_id0000644000175000017500000000126112163572274016265 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame CFG="$TMPDIR"/test.cf OUT="$TMPDIR"/test.out CORRECT="$OUTPUTS"/message_id.ref cat < "$CFG" # include message ID # suppress timestamps & version info in output header_format=%h: %c, message_id=%I EOF # build wordlists $BOGOFILTER -n -v -D -c "$CFG" -M -B "$srcdir"/inputs/good.mbx > /dev/null $BOGOFILTER -s -v -D -c "$CFG" -M -B "$srcdir"/inputs/spam.mbx > /dev/null $BOGOFILTER -v -D -c "$CFG" -M -B "$srcdir"/inputs/good.mbx \ "$srcdir"/inputs/spam.mbx \ | sed 's}.*/inputs/}inputs/}' > "$OUT" # compare test output to reference output if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi bogofilter-1.2.4/src/tests/t.integrity20000755000175000017500000000231012163572275016265 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # test description here # # test below # remember to use "$srcdir" ./dehex > "$TMPDIR/input" <<'_EOF' 00 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F 10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F 20 21 22 23 24 25 26 27 28 29 2A 2B 2C 2D 2E 2F 30 31 32 33 34 35 36 37 38 39 3A 3B 3C 3D 3E 3F 40 41 42 43 44 45 46 47 48 49 4A 4B 4C 4D 4E 4F 50 51 52 53 54 55 56 57 58 59 5A 5B 5C 5D 5E 5F 60 61 62 63 64 65 66 67 68 69 6A 6B 6C 6D 6E 6F 70 71 72 73 74 75 76 77 78 79 7A 7B 7C 7D 7E 7F 80 81 82 83 84 85 86 87 88 89 8A 8B 8C 8D 8E 8F 90 91 92 93 94 95 96 97 98 99 9A 9B 9C 9D 9E 9F A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 AA AB AC AD AE AF B0 B1 B2 B3 B4 B5 B6 B7 B8 B9 BA BB BC BD BE BF C0 C1 C2 C3 C4 C5 C6 C7 C8 C9 CA CB CC CD CE CF D0 D1 D2 D3 D4 D5 D6 D7 D8 D9 DA DB DC DD DE DF E0 E1 E2 E3 E4 E5 E6 E7 E8 E9 EA EB EC ED EE EF F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 FA FB FC FD FE FF 0A _EOF # check seekable input $VAL $BOGOFILTER -e -p -C < "$TMPDIR"/input > "$TMPDIR/output" ./dumbhead -2 < "$TMPDIR/output" | cmp - "$TMPDIR/input" # check non-seekable input cat "$TMPDIR"/input | $VAL $BOGOFILTER -e -p -C > "$TMPDIR/output" ./dumbhead -2 < "$TMPDIR/output" | cmp - "$TMPDIR/input" bogofilter-1.2.4/src/tests/t.rfc2047_broken0000755000175000017500000000416012163572274016620 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # Test #1: checks if improperly folded encoded words are decoded # without crash. # test case supplied by Clint Adams, Debian. # Test #2: checks if improperly terminated encoded words causes # improper processing of the mime parts. # Test case 2 supplied by Evgeny Kotsuba. # NOTE ##### # Test case 2 is currently disabled because we don't want to # provide the same output for broken encoded words as for conformant # ones, so we can tell broken mailers from intact. ##### Test #1 - improper folding ##### cat > "$TMPDIR/input.1" <<_EOF Subject: [Broken] =?ISO-8859-1?Q?Re=3A_=5BBroken=5D_=3D=3FISO-8859-1=3FQ=3F=3D5B?= =?ISO-8859-1?Q?Broken=3D5DBlah=3D20Foo=3DE4=3D20Bar=3D20Blah _?= =?ISO-8859-1?Q?Foo=3D3D28=3D5F=3F=3D_Bar=5F=5F=3F=3D_t=E4Blah?= =?ISO-8859-1?Q?Foo=E4t=29?= Hello. _EOF $BOGOLEXER -p -C < "$TMPDIR"/input.1 > "$TMPDIR/output.1" exit $? ##### Test #2a - improperly terminated encoded word ##### cat > "$TMPDIR/input.2a" <<_EOF Return-Path: Content-Type: multipart/mixed; boundary="--ek-1129" ----ek-1129 Content-Type: application/x-zip-compressed; name="filename.txt" Content-Disposition: attachment; filename="=?Windows-1251?B?Z29v?= =?Windows-1251?B?5fTu" Content-Transfer-Encoding: base64 UEsDBBQAAgAIADyWpzC0Mjdx9ksFAADEBQBJAAAAZ29vLTAwMWQwMDAwLTAxLYegrKXnoK2o 7yCvriCv4K7iruKor+Mg4qWrpeSuraAgR09PLTAwMSCu4iAyMDA0LTA1LTA3LmRvY+xZC1gT ----ek-1129-- _EOF $BOGOLEXER -p -C < "$TMPDIR"/input.2a > "$TMPDIR/output.2a" ##### Test #2b - properly terminated encoded word ##### cat > "$TMPDIR/input.2b" <<_EOF Return-Path: Content-Type: multipart/mixed; boundary="--ek-1129" ----ek-1129 Content-Type: application/x-zip-compressed; name="filename.txt" Content-Disposition: attachment; filename="=?Windows-1251?B?Z29v?= =?Windows-1251?B?5fTu?=" Content-Transfer-Encoding: base64 UEsDBBQAAgAIADyWpzC0Mjdx9ksFAADEBQBJAAAAZ29vLTAwMWQwMDAwLTAxLYegrKXnoK2o 7yCvriCv4K7iruKor+Mg4qWrpeSuraAgR09PLTAwMSCu4iAyMDA0LTA1LTA3LmRvY+xZC1gT ----ek-1129-- _EOF $BOGOLEXER -p -C < "$TMPDIR"/input.2b > "$TMPDIR/output.2b" diff "$TMPDIR/output.2a" "$TMPDIR/output.2b" bogofilter-1.2.4/src/tests/Makefile.am0000644000175000017500000000655512163572275016050 0ustar sezsez# $Id: Makefile.am 6975 2012-11-06 02:18:15Z m-a $ check_PROGRAMS=dehex spam_header_name dumbhead deqp deb64 escnp abortme \ u_fpe wantcore leakmem ctype AM_CPPFLAGS = -I$(srcdir)/.. AM_LDFLAGS = -L.. LDADD = -lbogofilter BUILT_SOURCES = t.config t.query.config CLEANFILES= $(BUILT_SOURCES) t.config: Makefile ( echo >$@ 'EXE_EXT="@EXEEXT@"' ; \ echo >>$@ 'DB_EXT="@DB_EXT@"' ; \ echo >>$@ 'DB_TYPE="@DB_TYPE@"'; \ echo >>$@ 'USE_TRANSACTIONS="@USE_TRANSACTIONS@"' ; \ echo >>$@ 'USE_UNICODE="@USE_UNICODE@"' ) || rm -f $@ t.query.config: t.query.config.in Makefile rm -f $@ cat $(srcdir)/t.query.config.in | \ sed 's/[@]ENCODING[@]/@ENCODING@/' | \ sed 's/[@]DEFAULT_CHARSET[@]/@DEFAULT_CHARSET@/' > $@ || rm -f $@ chmod +x t.query.config ENVIRON_TESTS = t.abort t.env t.ctype t.bogodir t.leakfind t.u_fpe if ENABLE_UNICODE ENCODING_TESTS=t.encoding endif PARSING_TESTS = \ t.longoptions \ t.ignore_spam_header \ t.nullstatsprefix \ t.integrity t.integrity2 t.integrity3 \ t.passthrough-hb \ t.escaped.html t.escaped.url \ t.base64 t.split t.parsing \ t.lexer t.lexer.mbx t.lexer.qpcr t.lexer.eoh \ t.spam.header.place \ t.block.on.subnets \ t.token.count \ t.multiple.tokens.head t.multiple.tokens.body t.multiple.tokens.min.mul \ $(ENCODING_TESTS) \ t.rfc2047_broken t.rfc2047_folded \ t.crash-invalid-base64 \ t.message_addr t.message_id t.queue_id WORDLIST_TESTS = t.dump.load t.nonascii.replace t.maint t.robx t.regtest t.upgrade.subnet.prefix t.multiple.wordlists t.probe t.bf_compact SCORING_TESTS = t.score1 t.score2 t.systest t.grftest t.wordhist BULKMODE_TESTS = t.bulkmode t.MH t.maildir t.bogoutil INTEGRITY_TESTS = t.lock1 t.lock3 t.valgrind # INTEGRITY_TESTS += t.lock2 # these tests are built, but must not be shipped: BUILT_TESTS = t.query.config # test scripts expected to fail XFAIL_TESTS = TESTSCRIPTS = ${ENVIRON_TESTS} ${PARSING_TESTS} ${WORDLIST_TESTS} ${SCORING_TESTS} ${BULKMODE_TESTS} ${INTEGRITY_TESTS} TESTS=$(BUILT_TESTS) $(TESTSCRIPTS) TESTS_ENVIRONMENT=RUN_FROM_MAKE=1 AWK=$(AWK) srcdir=$(srcdir) SHELL="$(SHELL)" $(SHELL) $(VERBOSE) EXTRA_DIST=$(TESTSCRIPTS) t.frame t.save t.skel \ printcore t._abort unsort.pl \ t.query.config.in \ run.sh \ inputs/dump.load.inp \ inputs/dump.load.upd \ inputs/good.mbx \ inputs/headerbody.txt \ inputs/lexer.inp \ inputs/lexer.mbx \ inputs/lexer.out \ inputs/mime-qp-cont-with-cr.txt \ inputs/msg.1.txt \ inputs/msg.2.txt \ inputs/msg.3.txt \ inputs/msg.4.txt \ inputs/msg.5.txt \ inputs/msg.6.txt \ inputs/msg.7.txt \ inputs/msg.8.txt \ inputs/msg.flex \ inputs/msg.parsing.txt \ inputs/msg.regtest.n \ inputs/msg.regtest.s \ inputs/msg.split.bg.0117.text \ inputs/msg.split.dr.0118.base64 \ inputs/msg.split.gs.0119.text \ inputs/spam.mbx \ outputs/MH.out \ outputs/bogolex.out \ outputs/bulkmode.out \ outputs/dump.load-1.out \ outputs/dump.load-2.out \ outputs/dump.load-3.out \ outputs/dump.load-4.out \ outputs/dump.load-5.out \ outputs/dump.load-6.out \ outputs/grftest.out \ outputs/lexer.out \ outputs/maildir.out \ outputs/message_addr.ref \ outputs/message_id.ref \ outputs/mime-qp-cont-with-cr.exp \ outputs/msg.1.v \ outputs/msg.2a.vv \ outputs/msg.2a.vvv \ outputs/msg.2b.vv \ outputs/msg.2b.vvv \ outputs/msg.3.vvv \ outputs/multiple.wordlists.ref \ outputs/parsing.out \ outputs/queue_id.ref \ outputs/split.out \ outputs/token.count.ref bogofilter-1.2.4/src/tests/t.env0000755000175000017500000000070312163572274014760 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # make sure we can run with only BOGOFILTER_DIR or only HOME defined echo | env -i "HOME=$BOGOFILTER_DIR" "PATH=$PATH" "$BOGOFILTER" -n -C > /dev/null 2>&1 echo | env -i "BOGOFILTER_DIR=$BOGOFILTER_DIR" "PATH=$PATH" "$BOGOFILTER" -p -e -C > /dev/null 2>&1 # check if BOGOFILTER_DIR overrides HOME echo | env -i "HOME=/nonexist" "BOGOFILTER_DIR=$BOGOFILTER_DIR" "PATH=$PATH" "$BOGOFILTER" -p -e -C > /dev/null 2>&1 bogofilter-1.2.4/src/tests/t.bulkmode0000755000175000017500000000632412163572274015777 0ustar sezsez#!/bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # bulkmode.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # esp. bulkmode.out # # ./bulkmode.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame map_rc() { ( set +e eval "$@" a=$? [ $a -eq 0 ] && exit 0 [ $a -eq 1 ] && exit 0 [ $a -eq 2 ] && exit 0 exit $a ) } if [ -d "$BOGOFILTER_DIR" ] ; then rm -f "$BOGOFILTER_DIR"/* ; else : ; fi mkdir -p "$BOGOFILTER_DIR" $BOGOFILTER -C -s < "$SYSTEST"/inputs/spam.mbx $BOGOFILTER -C -n < "$SYSTEST"/inputs/good.mbx OPT="-t -v -D" pattern="$SYSTEST/inputs/msg.?.txt" CFG="$TMPDIR/test.cf" # Fisher tristate cat < "$CFG" robx=0.415 min_dev=0.1 ham_cutoff=0.1 spam_cutoff=0.95 terse_format = %1.1c %d spamicity_tags = S,h,u spamicity_formats = %6.2e %6.2e %0.6f block_on_subnets=yes replace_nonascii_characters=yes EOF # # run tests for msg.[1-8].txt # BOGOFILTER="$BOGOFILTER $OPT" # test scoring of individual files NAME="bulk-single" ( for f in $pattern ; do echo $f `$BOGOFILTER -c "$CFG" -e -I $f` ; done ) | \ sed s@.*inputs/@./inputs/@ > "$TMPDIR"/$NAME.out # test scoring of files listed on stdin NAME="bulk-stdin" ls $pattern | $BOGOFILTER -c "$CFG" -b | \ sed s@.*inputs/@./inputs/@ > "$TMPDIR"/$NAME.out # test scoring of files listed on linend NAME="bulk-linend" $BOGOFILTER -c "$CFG" -B `ls $pattern` | \ sed s@.*inputs/@./inputs/@ > "$TMPDIR"/$NAME.out # test scoring each file twice (using linend) NAME="bulk-double-1" for f in $pattern ; do map_rc "$BOGOFILTER -c \"$CFG\" -B $f $f" | \ sed s@.*inputs/@./inputs/@ >> "$TMPDIR"/$NAME.tmp done sort -u < "$TMPDIR"/$NAME.tmp > "$TMPDIR"/$NAME.out # test scoring each file twice (using linend), when files are without "From " lines NAME="bulk-double-2" for f in $pattern ; do t="$TMPDIR/$(basename "$f")" $GREP -v "^From " <"$f" > "$t" map_rc "$BOGOFILTER -c \"$CFG\" -B \"$t\" \"$t\"" | \ sed 's@.*/@./inputs/@' >> "$TMPDIR"/$NAME.tmp done sort -u <"$TMPDIR"/$NAME.tmp > "$TMPDIR"/$NAME.out # test scoring of individual files using msg-count format NAME="bogolex-single" for f in $pattern ; do map_rc "$BOGOTUNE -c \"$CFG\" -M \"$f\" | $BOGOFILTER -c \"$CFG\" >>\"$TMPDIR/$NAME.out\"" done # test scoring of mbox batch of msg-count messages NAME="bogolex-mbox" cat $pattern > "$TMPDIR"/test.fr map_rc "$BOGOFILTER -c \"$CFG\" -M" < "$TMPDIR"/test.fr > "$TMPDIR"/$NAME.out NAME="bogolex-batch" cat /dev/null > "$TMPDIR"/test.bl for f in $pattern ; do map_rc "$BOGOTUNE -c \"$CFG\" -M $f" >> "$TMPDIR/test.bl" done map_rc "$BOGOFILTER -c \"$CFG\" -M" < "$TMPDIR"/test.bl > "$TMPDIR"/$NAME.out if [ "$BF_SAVEDIR" ] ; then . "$srcdir/t.save" ; fi CORRECT="$OUTPUTS/bulkmode.out" for OUT in "$TMPDIR"/bulk-*.out ; do if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi done CORRECT="$OUTPUTS/bogolex.out" for OUT in "$TMPDIR"/bogolex-*.out ; do if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi done bogofilter-1.2.4/src/tests/u_fpe.c0000644000175000017500000000021512163572274015240 0ustar sezsez#include int main(void) { volatile double a=.0, b=.0, c=1.; printf("%g\n", a/b); printf("%g\n", c/b); return 0; } bogofilter-1.2.4/src/tests/t.regtest0000755000175000017500000000531312163572274015647 0ustar sezsez#! /bin/sh # t.regtest # # test the registration options, i.e. '-s', '-n', '-S', and '-N' # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # regtest.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # regtest.YYYYMMDD: # output files contain wordlist contents relpath="`pwd`/.." NODB=1 . ${srcdir=.}/t.frame INPUT="$srcdir/inputs" #opts="-x rw -vvvv" OPTS="-C -y 0" check_counts() { if [ $verbose -ne 0 ]; then echo "test #$T" fi if [ -f "$BOGOFILTER_DIR"/goodlist.$DB_EXT ] ; then g=$("$BOGOUTIL" -C -d "$BOGOFILTER_DIR"/goodlist.$DB_EXT | grep -v " 0 " | tee "$TMPDIR"/good.$T.out | wc -l) s=$("$BOGOUTIL" -C -d "$BOGOFILTER_DIR"/spamlist.$DB_EXT | grep -v " 0 " | tee "$TMPDIR"/spam.$T.out | wc -l) else "$BOGOUTIL" -C -d "$BOGOFILTER_DIR"/wordlist.$DB_EXT > "$TMPDIR"/word.$T.out g=`grep -v " 0$" < "$TMPDIR"/word.$T.out | tee "$TMPDIR"/good.$T.out | wc -l` s=`grep -v " 0 " < "$TMPDIR"/word.$T.out | tee "$TMPDIR"/spam.$T.out | wc -l` fi WANT=`printf "%d.%d" $S $G` HAVE=`printf "%d.%d" $s $g` if [ $verbose -ne 0 ]; then echo want: $WANT, have: $HAVE fi if [ ! "$WANT" = "$HAVE" ] ; then if [ $verbose -eq 0 ] ; then exit 1 fi fi } create_empty_wordlist # populate goodlist and spamlist T=1 # test #1 S=32 # expected tokens from spam message G=36 # expected tokens from good message "$BOGOFILTER" $OPTS -s -I "${INPUT}"/msg.regtest.s "$BOGOFILTER" $OPTS -n -I "${INPUT}"/msg.regtest.n check_counts # move msg.regtest.n from goodlist to spamlist in two separate steps T=2.1 # test #2.1 S=32 # expected tokens from spam message G=0 # expected tokens from good message "$BOGOFILTER" $OPTS -N -I "${INPUT}"/msg.regtest.n check_counts T=2.2 # test #2.2 S=60 # expected tokens from spam message G=0 # expected tokens from good message "$BOGOFILTER" $OPTS -s -I "${INPUT}"/msg.regtest.n check_counts # move msg.regtest.n from goodlist to spamlist in one big step T=3 # test #3 S=60 # expected tokens from spam message G=0 # expected tokens from good message create_empty_wordlist "$BOGOFILTER" $OPTS -s -I "${INPUT}"/msg.regtest.s "$BOGOFILTER" $OPTS -n -I "${INPUT}"/msg.regtest.n "$BOGOFILTER" $OPTS -Ns -I "${INPUT}"/msg.regtest.n check_counts # move msg.regtest.s from spamlist to goodlist in one big step T=4 # test #4 S=0 # expected tokens from spam message G=60 # expected tokens from good message create_empty_wordlist "$BOGOFILTER" $OPTS -s -I "${INPUT}"/msg.regtest.s "$BOGOFILTER" $OPTS -n -I "${INPUT}"/msg.regtest.n "$BOGOFILTER" $OPTS -Sn -I "${INPUT}"/msg.regtest.s check_counts bogofilter-1.2.4/src/tests/t.lexer0000755000175000017500000000030412163572272015302 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame cat "$srcdir/inputs/lexer.inp" | $BOGOLEXER -p -C \ | tee "$TMPDIR"/lexer.tmp | sort | uniq > "$TMPDIR/lexer.out" cmp "$OUTPUTS/lexer.out" "$TMPDIR/lexer.out" bogofilter-1.2.4/src/tests/t.score20000755000175000017500000000041512163572274015365 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # make sure that an uninitialized data base will not lead to bogus # spam qualifications # ensure that "nonspam" exits with code 1 ( set +e echo | $VAL $BOGOFILTER -p -C > /dev/null if [ $? -eq 2 ] ; then exit 0 ; else exit 1 ; fi ) bogofilter-1.2.4/src/tests/t.robx0000755000175000017500000000240212163572274015140 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # robx.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # robx.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame [ -d "$TMPDIR"/tests ] && rm -rf "$TMPDIR"/tests mkdir -p "$TMPDIR"/tests CFG="$TMPDIR/test.cf" cat < "$CFG" robx=0.415 min_dev=0.0 spam_header_name=X-Bogosity stats_in_header=Y EOF $BOGOFILTER -c "$CFG" -y 0 -s < "$SYSTEST/inputs/spam.mbx" $BOGOFILTER -c "$CFG" -y 0 -n < "$SYSTEST/inputs/good.mbx" if [ ! -z "$RUN_FROM_MAKE" ] ; then $BOGOUTIL -C -D -R "$TMPDIR"/wordlist.$DB_EXT else for f in $BOGOFILTER_DIR/*.$DB_EXT ; do n="$(basename "$f" .$DB_EXT)" $BOGOUTIL -C -d $BOGOFILTER_DIR"/$n".$DB_EXT > "$TMPDIR/$n.txt" done $BOGOUTIL -C -vvvv -D -R "$TMPDIR"/wordlist.$DB_EXT > "$TMPDIR"/output.vvv fi if [ "$BF_SAVEDIR" ] ; then . ${srcdir}/t.save ; fi RESULT=`$BOGOUTIL -C -w "$TMPDIR"/wordlist.$DB_EXT .ROBX | $AWK '/.ROBX/ { print $2; }'` WANT="366405" if [ "$RESULT" != "$WANT" ] ; then echo want: $WANT, have: $RESULT fi test "$RESULT" = "$WANT" bogofilter-1.2.4/src/tests/t.split0000755000175000017500000000217612163572274015331 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # split.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # split.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame map_rc() { ( set +e eval "$@" a=$? [ $a -eq 0 ] && exit 0 [ $a -eq 1 ] && exit 0 [ $a -eq 2 ] && exit 0 exit $a ) } $BOGOFILTER -C -s < "$srcdir/inputs/spam.mbx" $BOGOFILTER -C -n < "$srcdir/inputs/good.mbx" OUT="split.out" files=`ls "${srcdir}"/inputs/msg.split.*` for msg in $files ; do nam=`basename "$msg"` out="$TMPDIR"/$nam map_rc $BOGOLEXER -C -p $v -I "$msg" > "$out.l" map_rc $BOGOFILTER -C -vvv -I "$msg" > "$out.f" printf "%-24s %s\n" "$nam" `head -1 "$out.f" | sed s@spamicity=@@ \ | tr -d "," | $AWK '{print $4}'` >> "$TMPDIR/$OUT" done if [ "$BF_SAVEDIR" ] ; then . "$srcdir/t.save" ; fi test $verbose -eq 0 && cmp "$OUTPUTS/$OUT" "$TMPDIR"/$OUT \ || diff $DIFF_BRIEF "$OUTPUTS/$OUT" "$TMPDIR/$OUT" bogofilter-1.2.4/src/tests/t.multiple.tokens.min.mul0000755000175000017500000000216412163572275020707 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame INP="$TMPDIR/test.inp" REF="$TMPDIR"/test.ref OUT="$TMPDIR/test.out" CORRECT="$SYSTEST/outputs/multiple.wordlists.ref" cat < "$INP" a b2 cc3 aa3 bbb4 cc3 ddd4 ee3 fff4 EOF cat < "$REF" ::: 1 2 ::: a b2 a*b2 cc3 b2*cc3 aa3 cc3*aa3 bbb4 aa3*bbb4 cc3 bbb4*cc3 ddd4 cc3*ddd4 ee3 ddd4*ee3 fff4 ee3*fff4 ::: 1 3 ::: a b2 a*b2 cc3 b2*cc3 a*b2*cc3 aa3 cc3*aa3 b2*cc3*aa3 bbb4 aa3*bbb4 cc3*aa3*bbb4 cc3 bbb4*cc3 aa3*bbb4*cc3 ddd4 cc3*ddd4 bbb4*cc3*ddd4 ee3 ddd4*ee3 cc3*ddd4*ee3 fff4 ee3*fff4 ddd4*ee3*fff4 ::: 2 2 ::: b2 cc3 b2*cc3 aa3 cc3*aa3 bbb4 aa3*bbb4 cc3 bbb4*cc3 ddd4 cc3*ddd4 ee3 ddd4*ee3 fff4 ee3*fff4 ::: 2 3 ::: b2 cc3 b2*cc3 aa3 cc3*aa3 b2*cc3*aa3 bbb4 aa3*bbb4 cc3*aa3*bbb4 cc3 bbb4*cc3 aa3*bbb4*cc3 ddd4 cc3*ddd4 bbb4*cc3*ddd4 ee3 ddd4*ee3 cc3*ddd4*ee3 fff4 ee3*fff4 ddd4*ee3*fff4 EOF for MIN in 1 2 ; do for MUL in 2 3 ; do echo "::: $MIN $MUL :::" >> "$OUT" $BOGOLEXER -C -H -p --min-token-len $MIN --multi-token-count $MUL < "$INP" >> "$OUT" done done if [ $verbose -eq 0 ]; then diff "$REF" "$OUT" cmp "$REF" "$OUT" else diff $DIFF_BRIEF "$REF" "$OUT" fi bogofilter-1.2.4/src/tests/leakmem.c0000644000175000017500000000061212163572275015557 0ustar sezsez/** * \file leakmem.c * deliberately leaks memory, to test memory checkers. * \author Matthias Andree * \date 2005 * * GNU General Public License v2 */ #include #include int main(void) { char *x; x = malloc(42); printf("got %p\n", x); /* deliberately leak memory here */ x = malloc(42); printf("got %p\n", x); free(x); return 0; } bogofilter-1.2.4/src/tests/t.lock10000755000175000017500000000022212163572275015176 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # this test checks that bogofilter -u works $VAL $BOGOFILTER -u -p -e -d "$TMPDIR" -C < /dev/null > /dev/null bogofilter-1.2.4/src/tests/t.spam.header.place0000755000175000017500000000273112163572275017446 0ustar sezsez#!/bin/sh +x # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # spam.header.place.YYYYMMDD. This is useful when something is different. NODB=1 . ${srcdir=.}/t.frame map_rc() { ( set +e eval "$@" a=$? [ $a -eq 0 ] && exit 0 [ $a -eq 1 ] && exit 0 [ $a -eq 2 ] && exit 0 exit $a ) } CFG="$TMPDIR/test.cfg" MSG="$TMPDIR/test.msg" REF="$TMPDIR/test.ref" OUT="$TMPDIR/test.out" X_BOGOSITY="X-Bogosity: Unsure, tests=bogofilter, spamicity=0.520000" cat >> "$CFG" <> "$MSG" <> "$REF.wo" <> "$REF.wi" <> "$MSG" <> "$REF" < "$OUT" if [ $verbose -eq 0 ]; then cmp "$REF" "$OUT" \ || diff $DIFF_BRIEF "$REF" "$OUT" else diff $DIFF_BRIEF "$REF" "$OUT" fi bogofilter-1.2.4/src/tests/t.leakfind0000644000175000017500000000056412163572272015745 0ustar sezsez#! /bin/sh # This test deliberately leaks memory, and checks if we get output on # stderr, to see if the leak checker sees something. # If it does, we PASS the test. # If it does not, we SKIP the test. # (C) Copyright 2005 Matthias Andree. GNU GPL v2 . ${srcdir:=.}/t.frame $VAL ./leakmem 2>&1 | egrep -v '^got |^ *(Electric Fence.*)?$' > "$TMPDIR"/out || exit 77 bogofilter-1.2.4/src/tests/dumbhead.c0000644000175000017500000000313712163572275015722 0ustar sezsez/* dumbhead.c -- trivial head(1) like program */ /* (C) 2002 by Matthias Andree * * This program is free software; you can redistribute it and/or modify * it under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * 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, it is in the file named * COPYING. */ /* $Id: dumbhead.c 1578 2003-02-03 17:09:47Z relson $ */ #include #include /*@noreturn@*/ static void die(const char *tag) #ifdef __GNUC__ __attribute__((noreturn)) #endif ; static void die(const char *tag) { perror(tag); exit(EXIT_FAILURE); } /* this is a very dumb "head" command that only copies from stdin to * stdout, but keeps embedded NUL characters. * It can accept a -N option, where N gives the number of lines. * If not given, defaults to 10. * Further or malformatted arguments are SILENTLY ignored. * * Diagnosis: read/write errors are detected, printed with perror and * let this program exit(EXIT_FAILURE). */ int main(int argc, char **argv) { int lines = 10, c; if (argc >= 2 && argv[1][0] == '-') lines = atoi(&argv[1][1]); while(lines && (c = getchar()) != EOF) { /* RATS: ignore */ if (putchar(c) == EOF) die("stdout"); if (c == '\n') lines--; } if (ferror(stdin)) die("stdin"); if (fflush(stdout) == EOF) die("stdout"); exit (EXIT_SUCCESS); } bogofilter-1.2.4/src/tests/dehex.c0000644000175000017500000000031712163572275015243 0ustar sezsez/* $Id: dehex.c 1578 2003-02-03 17:09:47Z relson $ */ #include #include int main(void) { unsigned int a; while(scanf("%2x ", &a) == 1) { putchar((int)a); } exit(0); } bogofilter-1.2.4/src/tests/outputs/0000755000175000017500000000000012164443244015516 5ustar sezsezbogofilter-1.2.4/src/tests/outputs/grftest.out0000644000175000017500000000040712163572274017733 0ustar sezsezid fisher tristate 1 h 0.500039 u 0.500039 2 h 0.500096 u 0.500096 3 h 0.500086 u 0.500086 4 h 0.507130 u 0.507130 5 h 0.982608 u 0.982608 6 h 0.638178 u 0.638178 7 s 1.000000 s 0.000000 8 s 1.000000 s 0.000000 bogofilter-1.2.4/src/tests/outputs/mime-qp-cont-with-cr.exp0000644000175000017500000000101412163572274022116 0ustar sezsezsubj:This subj:test subj:message subj:check subj:bogofilter's subj:decoding subj:continuation subj:lines subj:the subj:presence subj:spurious subj:characters head:MIME-Version head:Content-Type head:multipart head:alternative This multi-part message MIME format mime:Content-Type mime:text mime:html mime:charset mime:iso-8859-2 mime:Content-Transfer-Encoding mime:quoted-printable face Arial size pills $6.00 per pill face Arial size nbsp face Arial size href http groups.yahoo.com group ganebawusexut64 message Visit here bogofilter-1.2.4/src/tests/outputs/msg.2a.vvv0000644000175000017500000005726612163572274017375 0ustar sezsezX-Bogosity: Unsure, tests=bogofilter, spamicity=0.500000 n pgood pbad fw U "which" 10 0.208333 0.000000 0.000737 + "working" 6 0.125000 0.000000 0.001228 + "having" 5 0.104167 0.000000 0.001472 + "own" 5 0.104167 0.000000 0.001472 + "yet" 5 0.104167 0.000000 0.001472 + "around" 4 0.083333 0.000000 0.001839 + "being" 4 0.083333 0.000000 0.001839 + "effort" 4 0.083333 0.000000 0.001839 + "let" 4 0.083333 0.000000 0.001839 + "program" 4 0.083333 0.000000 0.001839 + "were" 4 0.083333 0.000000 0.001839 + "How" 3 0.062500 0.000000 0.002448 + "current" 3 0.062500 0.000000 0.002448 + "his" 3 0.062500 0.000000 0.002448 + "lot" 3 0.062500 0.000000 0.002448 + "making" 3 0.062500 0.000000 0.002448 + "rights" 3 0.062500 0.000000 0.002448 + "used" 3 0.062500 0.000000 0.002448 + "very" 3 0.062500 0.000000 0.002448 + "without" 3 0.062500 0.000000 0.002448 + "Find" 2 0.041667 0.000000 0.003661 + "Online" 2 0.041667 0.000000 0.003661 + "call" 2 0.041667 0.000000 0.003661 + "went" 2 0.041667 0.000000 0.003661 + "Future" 1 0.020833 0.000000 0.007258 + "LLC" 1 0.020833 0.000000 0.007258 + "Only" 1 0.020833 0.000000 0.007258 + "asked" 1 0.020833 0.000000 0.007258 + "dollars" 1 0.020833 0.000000 0.007258 + "everyone" 1 0.020833 0.000000 0.007258 + "made" 1 0.020833 0.000000 0.007258 + "site" 1 0.020833 0.000000 0.007258 + "steps" 1 0.020833 0.000000 0.007258 + "out" 20 0.375000 0.095238 0.202721 - "web" 10 0.187500 0.047619 0.202909 - "too" 9 0.166667 0.047619 0.222603 - "Nov" 8 0.145833 0.047619 0.246529 - "more" 15 0.270833 0.095238 0.260346 - "rcvd:ESMTP" 44 0.791667 0.285714 0.265254 - "find" 12 0.208333 0.095238 0.313875 - "also" 11 0.187500 0.095238 0.336968 - "about" 16 0.270833 0.142857 0.345401 - "just" 20 0.333333 0.190476 0.363682 - "All" 10 0.166667 0.095238 0.363728 - "work" 10 0.166667 0.095238 0.363728 - "contact" 5 0.083333 0.047619 0.363819 - "simple" 5 0.083333 0.047619 0.363819 - "but" 29 0.479167 0.285714 0.373566 - "that" 41 0.666667 0.428571 0.391315 - "e-mail" 9 0.145833 0.095238 0.395101 - "they" 9 0.145833 0.095238 0.395101 - "The" 35 0.562500 0.380952 0.403791 - "not" 26 0.416667 0.285714 0.406785 - "$495" 0 0.000000 0.000000 0.415000 - "ABSOLUTELY" 0 0.000000 0.000000 0.415000 - "Cash!" 0 0.000000 0.000000 0.415000 - "Charge" 0 0.000000 0.000000 0.415000 - "Dean" 0 0.000000 0.000000 0.415000 - "DentistLookup.com" 0 0.000000 0.000000 0.415000 - "Email-Lookup.com" 0 0.000000 0.000000 0.415000 - "Every" 0 0.000000 0.000000 0.415000 - "GREATEST" 0 0.000000 0.000000 0.415000 - "GenuineRewards" 0 0.000000 0.000000 0.415000 - "Graziosi" 0 0.000000 0.000000 0.415000 - "Isn't" 0 0.000000 0.000000 0.415000 - "Kit" 0 0.000000 0.000000 0.415000 - "LINDA" 0 0.000000 0.000000 0.415000 - "MDLookup.com" 0 0.000000 0.000000 0.415000 - "Millions" 0 0.000000 0.000000 0.415000 - "Motor" 0 0.000000 0.000000 0.415000 - "MotorMillions.com" 0 0.000000 0.000000 0.415000 - "NADA" 0 0.000000 0.000000 0.415000 - "NOSEND" 0 0.000000 0.000000 0.415000 - "NOW!!!" 0 0.000000 0.000000 0.415000 - "No-risk" 0 0.000000 0.000000 0.415000 - "Powered" 0 0.000000 0.000000 0.415000 - "Right" 0 0.000000 0.000000 0.415000 - "Sat" 0 0.000000 0.000000 0.415000 - "Unconditional" 0 0.000000 0.000000 0.415000 - "Uncover" 0 0.000000 0.000000 0.415000 - "absolutely" 0 0.000000 0.000000 0.415000 - "abuse" 0 0.000000 0.000000 0.415000 - "accomplishment" 0 0.000000 0.000000 0.415000 - "amazingly" 0 0.000000 0.000000 0.415000 - "apologize" 0 0.000000 0.000000 0.415000 - "bigtitle" 0 0.000000 0.000000 0.415000 - "blacktitle" 0 0.000000 0.000000 0.415000 - "build" 0 0.000000 0.000000 0.415000 - "cash" 0 0.000000 0.000000 0.415000 - "coupons" 0 0.000000 0.000000 0.415000 - "covered" 0 0.000000 0.000000 0.415000 - "debt" 0 0.000000 0.000000 0.415000 - "dentist" 0 0.000000 0.000000 0.415000 - "dentistlookup.com" 0 0.000000 0.000000 0.415000 - "doctor" 0 0.000000 0.000000 0.415000 - "easy-to-follow" 0 0.000000 0.000000 0.415000 - "email-lookup.com" 0 0.000000 0.000000 0.415000 - "enjoy" 0 0.000000 0.000000 0.415000 - "ensure" 0 0.000000 0.000000 0.415000 - "estimating" 0 0.000000 0.000000 0.415000 - "excluded" 0 0.000000 0.000000 0.415000 - "feel" 0 0.000000 0.000000 0.415000 - "ff0000" 0 0.000000 0.000000 0.415000 - "ff3333" 0 0.000000 0.000000 0.415000 - "financial" 0 0.000000 0.000000 0.415000 - "freedom" 0 0.000000 0.000000 0.415000 - "friend's" 0 0.000000 0.000000 0.415000 - "from:Millions" 0 0.000000 0.000000 0.415000 - "from:Motor" 0 0.000000 0.000000 0.415000 - "from:Motor_Millions" 0 0.000000 0.000000 0.415000 - "from:genuinerewards.com" 0 0.000000 0.000000 0.415000 - "genuinerewards.com" 0 0.000000 0.000000 0.415000 - "head:genuinerewards.com" 0 0.000000 0.000000 0.415000 - "head:linda" 0 0.000000 0.000000 0.415000 - "highlight" 0 0.000000 0.000000 0.415000 - "immediate" 0 0.000000 0.000000 0.415000 - "invest" 0 0.000000 0.000000 0.415000 - "laid" 0 0.000000 0.000000 0.415000 - "life's" 0 0.000000 0.000000 0.415000 - "lucrative" 0 0.000000 0.000000 0.415000 - "luxuries" 0 0.000000 0.000000 0.415000 - "mdlookup.com" 0 0.000000 0.000000 0.415000 - "minds" 0 0.000000 0.000000 0.415000 - "motorm" 0 0.000000 0.000000 0.415000 - "offer!" 0 0.000000 0.000000 0.415000 - "offerings" 0 0.000000 0.000000 0.415000 - "official" 0 0.000000 0.000000 0.415000 - "pocket" 0 0.000000 0.000000 0.415000 - "powerful" 0 0.000000 0.000000 0.415000 - "prevent" 0 0.000000 0.000000 0.415000 - "previously" 0 0.000000 0.000000 0.415000 - "promotional" 0 0.000000 0.000000 0.415000 - "qoute.jpg" 0 0.000000 0.000000 0.415000 - "rcvd:216.177.60.45" 0 0.000000 0.000000 0.415000 - "rcvd:LINDA" 0 0.000000 0.000000 0.415000 - "rcvd:OC31.YOURMAILSOURCE.COM" 0 0.000000 0.000000 0.415000 - "rcvd:om40.yourmailsource.com" 0 0.000000 0.000000 0.415000 - "reaching" 0 0.000000 0.000000 0.415000 - "reveal" 0 0.000000 0.000000 0.415000 - "rtrn:OC31.YOURMAILSOURCE.COM" 0 0.000000 0.000000 0.415000 - "sense" 0 0.000000 0.000000 0.415000 - "solicitations" 0 0.000000 0.000000 0.415000 - "stop.gif" 0 0.000000 0.000000 0.415000 - "stopped" 0 0.000000 0.000000 0.415000 - "subj:Build" 0 0.000000 0.000000 0.415000 - "subj:How" 0 0.000000 0.000000 0.415000 - "subj:Immediate" 0 0.000000 0.000000 0.415000 - "subj:Wealth!" 0 0.000000 0.000000 0.415000 - "take-control.gif" 0 0.000000 0.000000 0.415000 - "tap" 0 0.000000 0.000000 0.415000 - "title2" 0 0.000000 0.000000 0.415000 - "title3" 0 0.000000 0.000000 0.415000 - "to:LINDA" 0 0.000000 0.000000 0.415000 - "topbar3.jpg" 0 0.000000 0.000000 0.415000 - "trying!!" 0 0.000000 0.000000 0.415000 - "unable" 0 0.000000 0.000000 0.415000 - "wad" 0 0.000000 0.000000 0.415000 - "walk" 0 0.000000 0.000000 0.415000 - "wealth" 0 0.000000 0.000000 0.415000 - "www.genuinerewards.com" 0 0.000000 0.000000 0.415000 - "product" 4 0.062500 0.047619 0.432355 - "messages" 8 0.125000 0.095238 0.432394 - "one" 22 0.333333 0.285714 0.461501 - "are" 36 0.541667 0.476190 0.467810 - "nice" 7 0.104167 0.095238 0.477453 - "off" 7 0.104167 0.095238 0.477453 - "with" 49 0.729167 0.666667 0.477589 - "time" 10 0.145833 0.142857 0.494703 - "head:Date" 69 1.000000 1.000000 0.499978 - "head:Delivered-To" 69 1.000000 1.000000 0.499978 - "head:From" 69 1.000000 1.000000 0.499978 - "head:example.com" 69 1.000000 1.000000 0.499978 - "rcvd:EST" 69 1.000000 1.000000 0.499978 - "rcvd:Nov" 69 1.000000 1.000000 0.499978 - "rcvd:Postfix" 69 1.000000 1.000000 0.499978 - "rcvd:example.com" 69 1.000000 1.000000 0.499978 - "may" 13 0.187500 0.190476 0.503815 - "rcvd:for" 68 0.979167 1.000000 0.505240 - "rcvd:from" 68 0.979167 1.000000 0.505240 - "rcvd:with" 68 0.979167 1.000000 0.505240 - "will" 29 0.416667 0.428571 0.506986 - "the" 64 0.916667 0.952381 0.509528 - "have" 38 0.541667 0.571429 0.513323 - "and" 57 0.812500 0.857143 0.513338 - "Back" 3 0.041667 0.047619 0.532635 - "Date" 3 0.041667 0.047619 0.532635 - "However" 3 0.041667 0.047619 0.532635 - "error" 3 0.041667 0.047619 0.532635 - "keep" 3 0.041667 0.047619 0.532635 - "rcvd:v1.5" 3 0.041667 0.047619 0.532635 - "text" 6 0.083333 0.095238 0.532983 - "does" 9 0.125000 0.142857 0.533100 - "can" 21 0.291667 0.333333 0.533233 - "head:Reply-To" 45 0.625000 0.714286 0.533287 - "from" 41 0.562500 0.666667 0.542318 - "http" 61 0.833333 1.000000 0.545416 - "for" 49 0.666667 0.809524 0.548339 - "mime:charset" 17 0.229167 0.285714 0.554767 - "how" 14 0.187500 0.238095 0.559257 - "mime:Content-Disposition" 19 0.250000 0.333333 0.571282 - "mime:inline" 19 0.250000 0.333333 0.571282 - "class" 5 0.062500 0.095238 0.603104 - "reserved" 5 0.062500 0.095238 0.603104 - "help" 10 0.125000 0.190476 0.603438 - "head:Content-Type" 45 0.562500 0.857143 0.603699 - "new" 12 0.145833 0.238095 0.619851 - "format" 24 0.291667 0.476190 0.620003 - "this" 45 0.541667 0.904762 0.625431 - "you" 40 0.479167 0.809524 0.628081 - "get" 21 0.250000 0.428571 0.631396 - "your" 42 0.500000 0.857143 0.631487 - "head:MIME-Version" 30 0.354167 0.619048 0.635955 - "multi-part" 22 0.250000 0.476190 0.655543 - "head:Message-Id" 35 0.395833 0.761905 0.657974 - "was" 26 0.291667 0.571429 0.661900 - "mime:plain" 28 0.312500 0.619048 0.664378 - "address" 15 0.166667 0.333333 0.666368 - "MIME" 25 0.270833 0.571429 0.678258 - "head:multipart" 29 0.312500 0.666667 0.680688 - "mime:text" 29 0.312500 0.666667 0.680688 - "This" 41 0.437500 0.952381 0.685108 - "changing" 2 0.020833 0.047619 0.693176 - "extremely" 2 0.020833 0.047619 0.693176 - "field" 2 0.020833 0.047619 0.693176 - "reader" 2 0.020833 0.047619 0.693176 - "received" 2 0.020833 0.047619 0.693176 - "worth" 2 0.020833 0.047619 0.693176 - "database" 4 0.041667 0.095238 0.694409 - "industry" 4 0.041667 0.095238 0.694409 - "properly" 4 0.041667 0.095238 0.694409 - "rcvd:PowerMTA" 4 0.041667 0.095238 0.694409 - "want" 8 0.083333 0.190476 0.695029 - "over" 10 0.104167 0.238095 0.695154 - "their" 12 0.125000 0.285714 0.695236 - "mime:Content-Transfer-Encoding" 26 0.270833 0.619048 0.695460 - "mime:Content-Type" 28 0.291667 0.666667 0.695474 - "message" 34 0.354167 0.809524 0.695505 - "mime:bit" 25 0.250000 0.619048 0.712117 - "today" 9 0.083333 0.238095 0.740098 - "email" 30 0.270833 0.809524 0.749113 - "Service" 5 0.041667 0.142857 0.772919 - "links" 5 0.041667 0.142857 0.772919 - "Your" 10 0.083333 0.285714 0.773555 - "please" 10 0.083333 0.285714 0.773555 - "our" 13 0.104167 0.380952 0.784770 - "rcvd:unknown" 13 0.104167 0.380952 0.784770 - "offer" 8 0.062500 0.238095 0.791242 - "mail" 19 0.145833 0.571429 0.796323 - "You" 20 0.145833 0.619048 0.808988 - "Learn" 3 0.020833 0.095238 0.818121 - "Price" 3 0.020833 0.095238 0.818121 - "URL" 3 0.020833 0.095238 0.818121 - "believe" 3 0.020833 0.095238 0.818121 - "guide" 3 0.020833 0.095238 0.818121 - "reading" 3 0.020833 0.095238 0.818121 - "Now" 6 0.041667 0.190476 0.819313 - "into" 6 0.041667 0.190476 0.819313 - "mime:us-ascii" 6 0.041667 0.190476 0.819313 - "rcvd:envelope-from" 6 0.041667 0.190476 0.819313 - "money" 4 0.020833 0.142857 0.870699 - "rcvd:EXAMPLE.COM" 4 0.020833 0.142857 0.870699 - "Save" 5 0.020833 0.190476 0.899683 + "Arial" 15 0.062500 0.571429 0.900832 + "simply" 6 0.020833 0.238095 0.918048 + "Helvetica" 12 0.041667 0.476190 0.918793 + "here" 18 0.062500 0.714286 0.919042 + "receive" 13 0.041667 0.523810 0.925617 + "link" 7 0.020833 0.285714 0.930727 + "Click" 14 0.041667 0.571429 0.931382 + "blank" 8 0.020833 0.333333 0.940008 + "wish" 8 0.020833 0.333333 0.940008 + "color" 16 0.041667 0.666667 0.940592 + "head:alternative" 16 0.041667 0.666667 0.940592 + "sans-serif" 16 0.041667 0.666667 0.940592 + "size" 24 0.062500 1.000000 0.940787 + "border" 20 0.041667 0.857143 0.953163 + "face" 20 0.041667 0.857143 0.953163 + "height" 23 0.041667 1.000000 0.959579 + "href" 23 0.041667 1.000000 0.959579 + "src" 23 0.041667 1.000000 0.959579 + "width" 23 0.041667 1.000000 0.959579 + "click" 13 0.020833 0.571429 0.964072 + "mime:html" 15 0.020833 0.666667 0.969040 + "$19.95" 1 0.000000 0.047619 0.989769 + "$500" 1 0.000000 0.047619 0.989769 + "Book" 1 0.000000 0.047619 0.989769 + "Cars" 1 0.000000 0.047619 0.989769 + "Customer" 1 0.000000 0.047619 0.989769 + "Day" 1 0.000000 0.047619 0.989769 + "Guarantee!" 1 0.000000 0.047619 0.989769 + "Into" 1 0.000000 0.047619 0.989769 + "TARGET" 1 0.000000 0.047619 0.989769 + "Take" 1 0.000000 0.047619 0.989769 + "above" 1 0.000000 0.047619 0.989769 + "browser's" 1 0.000000 0.047619 0.989769 + "click.asp" 1 0.000000 0.047619 0.989769 + "consider" 1 0.000000 0.047619 0.989769 + "creative" 1 0.000000 0.047619 0.989769 + "emid" 1 0.000000 0.047619 0.989769 + "gateway" 1 0.000000 0.047619 0.989769 + "handle" 1 0.000000 0.047619 0.989769 + "head:mailings" 1 0.000000 0.047619 0.989769 + "limited" 1 0.000000 0.047619 0.989769 + "lnk" 1 0.000000 0.047619 0.989769 + "multipart" 1 0.000000 0.047619 0.989769 + "plus" 1 0.000000 0.047619 0.989769 + "rcvd:COM" 1 0.000000 0.047619 0.989769 + "rcvd:EXAMPLE" 1 0.000000 0.047619 0.989769 + "revolutionary" 1 0.000000 0.047619 0.989769 + "rtrn:COM" 1 0.000000 0.047619 0.989769 + "rtrn:EXAMPLE" 1 0.000000 0.047619 0.989769 + "understands" 1 0.000000 0.047619 0.989769 + "view.asp" 1 0.000000 0.047619 0.989769 + "yours" 1 0.000000 0.047619 0.989769 + "$40" 2 0.000000 0.095238 0.994839 + "Order" 2 0.000000 0.095238 0.994839 + "Secrets" 2 0.000000 0.095238 0.994839 + "Turn" 2 0.000000 0.095238 0.994839 + "car" 2 0.000000 0.095238 0.994839 + "million" 2 0.000000 0.095238 0.994839 + "paste" 2 0.000000 0.095238 0.994839 + "rcvd:Sat" 2 0.000000 0.095238 0.994839 + "target" 2 0.000000 0.095238 0.994839 + "unsubscribe.asp" 2 0.000000 0.095238 0.994839 + "EXAMPLE.COM" 3 0.000000 0.142857 0.996549 + "appear" 3 0.000000 0.142857 0.996549 + "to:EXAMPLE.COM" 3 0.000000 0.142857 0.996549 + "FFFFFF" 4 0.000000 0.190476 0.997408 + "Money" 5 0.000000 0.238095 0.997925 + "copy" 5 0.000000 0.238095 0.997925 + "Here" 7 0.000000 0.333333 0.998516 + "Verdana" 9 0.000000 0.428571 0.998845 + "FREE" 10 0.000000 0.476190 0.998961 + N_P_Q_S_s_x_md 105 0.000000 0.000000 0.500000 0.017800 0.415000 0.375000 bogofilter-1.2.4/src/tests/outputs/queue_id.ref0000644000175000017500000000713612163572274020030 0ustar sezsezinputs/good.mbx X-Bogosity: Ham, queue_id=ADE5027F82 inputs/good.mbx X-Bogosity: Ham, queue_id=F007927F82 inputs/good.mbx X-Bogosity: Ham, queue_id=9156627F82 inputs/good.mbx X-Bogosity: Ham, queue_id=B081C27F82 inputs/good.mbx X-Bogosity: Ham, queue_id=AC46827F82 inputs/good.mbx X-Bogosity: Ham, queue_id=8D33527F82 inputs/good.mbx X-Bogosity: Ham, queue_id=E027527F82 inputs/good.mbx X-Bogosity: Ham, queue_id=1599227F82 inputs/good.mbx X-Bogosity: Ham, queue_id=6DDFB280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=05D1E280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=DBB38280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=7F30C280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=91F00280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=E1655280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=7BE3D280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=99A92280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=6380B280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=63398280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=75C54280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=EC323280E2 inputs/good.mbx X-Bogosity: Ham, queue_id=66F6B280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=DEAAE280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=1A076280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=88FE0280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=C8097280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=273E2280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=F17A4280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=9D30D280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=4884827F7F inputs/good.mbx X-Bogosity: Ham, queue_id=19857280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=03EEA280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=25CF0280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=8FFA5280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=10A0B280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=DB718280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=03B3B280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=638B1280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=BF985280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=EA0D4280E2 inputs/good.mbx X-Bogosity: Ham, queue_id=A0549280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=AB690280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=2F369280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=667A2280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=F2BEC280E2 inputs/good.mbx X-Bogosity: Ham, queue_id=EB329280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=EB49D280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=744DA280E1 inputs/good.mbx X-Bogosity: Ham, queue_id=D6150280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=CC48C280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=8720427F82 inputs/spam.mbx X-Bogosity: Spam, queue_id=F213D27F82 inputs/spam.mbx X-Bogosity: Spam, queue_id=2901C280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=4DB23280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=9BBBD280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=A264927F7F inputs/spam.mbx X-Bogosity: Spam, queue_id=47FAA280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=9D425280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=91023280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=37183280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=C687E280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=BA372280E2 inputs/spam.mbx X-Bogosity: Spam, queue_id=C79CA280E2 inputs/spam.mbx X-Bogosity: Spam, queue_id=6139F280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=88245280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=C8327280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=D0228280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=5BBC7280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=14B97280E1 inputs/spam.mbx X-Bogosity: Spam, queue_id=9CEEC280E1 bogofilter-1.2.4/src/tests/outputs/msg.3.vvv0000644000175000017500000004441712163572274017227 0ustar sezsezX-Bogosity: Unsure, tests=bogofilter, spamicity=0.500000 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000527 + "such" 9 0.187500 0.000000 0.000819 + "Message" 7 0.145833 0.000000 0.001053 + "knows" 5 0.104167 0.000000 0.001472 + "around" 4 0.083333 0.000000 0.001839 + "being" 4 0.083333 0.000000 0.001839 + "Not" 3 0.062500 0.000000 0.002448 + "Tom" 3 0.062500 0.000000 0.002448 + "able" 3 0.062500 0.000000 0.002448 + "his" 3 0.062500 0.000000 0.002448 + "learned" 3 0.062500 0.000000 0.002448 + "might" 3 0.062500 0.000000 0.002448 + "without" 3 0.062500 0.000000 0.002448 + "AND" 2 0.041667 0.000000 0.003661 + "behind" 2 0.041667 0.000000 0.003661 + "details" 2 0.041667 0.000000 0.003661 + "popular" 2 0.041667 0.000000 0.003661 + "story" 2 0.041667 0.000000 0.003661 + "we're" 2 0.041667 0.000000 0.003661 + "Jack" 1 0.020833 0.000000 0.007258 + "biggest" 1 0.020833 0.000000 0.007258 + "browse" 1 0.020833 0.000000 0.007258 + "character" 1 0.020833 0.000000 0.007258 + "everyone" 1 0.020833 0.000000 0.007258 + "fear" 1 0.020833 0.000000 0.007258 + "manages" 1 0.020833 0.000000 0.007258 + "all" 21 0.395833 0.095238 0.194127 - "been" 8 0.145833 0.047619 0.246529 - "has" 13 0.229167 0.095238 0.293744 - "about" 16 0.270833 0.142857 0.345401 - "that" 41 0.666667 0.428571 0.391315 - "The" 35 0.562500 0.380952 0.403791 - "161.58.175.183" 0 0.000000 0.000000 0.415000 - "Alice" 0 0.000000 0.000000 0.415000 - "Author" 0 0.000000 0.000000 0.415000 - "Bones" 0 0.000000 0.000000 0.415000 - "Bottle" 0 0.000000 0.000000 0.415000 - "Buick" 0 0.000000 0.000000 0.415000 - "City" 0 0.000000 0.000000 0.415000 - "Clancy" 0 0.000000 0.000000 0.415000 - "Clancy's" 0 0.000000 0.000000 0.415000 - "Elmwood" 0 0.000000 0.000000 0.415000 - "Fannie" 0 0.000000 0.000000 0.415000 - "Flagg" 0 0.000000 0.000000 0.415000 - "Giuliani" 0 0.000000 0.000000 0.415000 - "HANDLING!!" 0 0.000000 0.000000 0.415000 - "King" 0 0.000000 0.000000 0.415000 - "King's" 0 0.000000 0.000000 0.415000 - "Leadership" 0 0.000000 0.000000 0.415000 - "Lovely" 0 0.000000 0.000000 0.415000 - "Macabre" 0 0.000000 0.000000 0.415000 - "Master" 0 0.000000 0.000000 0.415000 - "Missouri" 0 0.000000 0.000000 0.415000 - "Nicholas" 0 0.000000 0.000000 0.415000 - "Nights" 0 0.000000 0.000000 0.415000 - "Notebook" 0 0.000000 0.000000 0.415000 - "Rabbit" 0 0.000000 0.000000 0.415000 - "Rainbow" 0 0.000000 0.000000 0.415000 - "Red" 0 0.000000 0.000000 0.415000 - "Roadmaster" 0 0.000000 0.000000 0.415000 - "Rodanthe" 0 0.000000 0.000000 0.415000 - "Rudolph" 0 0.000000 0.000000 0.415000 - "Ryan" 0 0.000000 0.000000 0.415000 - "Sebold" 0 0.000000 0.000000 0.415000 - "Smith" 0 0.000000 0.000000 0.415000 - "Sparks" 0 0.000000 0.000000 0.415000 - "Springs" 0 0.000000 0.000000 0.415000 - "Standing" 0 0.000000 0.000000 0.415000 - "Stephen" 0 0.000000 0.000000 0.415000 - "bestseller" 0 0.000000 0.000000 0.415000 - "bestselling" 0 0.000000 0.000000 0.415000 - "cars" 0 0.000000 0.000000 0.415000 - "centered" 0 0.000000 0.000000 0.415000 - "city's" 0 0.000000 0.000000 0.415000 - "clowns" 0 0.000000 0.000000 0.415000 - "colorful" 0 0.000000 0.000000 0.415000 - "complaining" 0 0.000000 0.000000 0.415000 - "conjure" 0 0.000000 0.000000 0.415000 - "continually" 0 0.000000 0.000000 0.415000 - "controversial" 0 0.000000 0.000000 0.415000 - "creepy" 0 0.000000 0.000000 0.415000 - "crisis" 0 0.000000 0.000000 0.415000 - "dogs" 0 0.000000 0.000000 0.415000 - "endearing" 0 0.000000 0.000000 0.415000 - "family" 0 0.000000 0.000000 0.415000 - "from:Deal" 0 0.000000 0.000000 0.415000 - "from:Thriller" 0 0.000000 0.000000 0.415000 - "funny" 0 0.000000 0.000000 0.415000 - "guided" 0 0.000000 0.000000 0.415000 - "head:Deal" 0 0.000000 0.000000 0.415000 - "head:Thriller" 0 0.000000 0.000000 0.415000 - "head:linda" 0 0.000000 0.000000 0.415000 - "head:sarckos-22-8643-418714" 0 0.000000 0.000000 0.415000 - "heart!" 0 0.000000 0.000000 0.415000 - "history" 0 0.000000 0.000000 0.415000 - "lg.htm" 0 0.000000 0.000000 0.415000 - "lga_king50off_bks_01.jpg" 0 0.000000 0.000000 0.415000 - "lga_king50off_bks_02.jpg" 0 0.000000 0.000000 0.415000 - "lga_king50off_bks_03.jpg" 0 0.000000 0.000000 0.415000 - "lga_king50off_bks_04.jpg" 0 0.000000 0.000000 0.415000 - "lga_king50off_bks_05.jpg" 0 0.000000 0.000000 0.415000 - "lga_king50off_bks_06.jpg" 0 0.000000 0.000000 0.415000 - "lga_king50off_bks_07.jpg" 0 0.000000 0.000000 0.415000 - "lga_king50percentoff" 0 0.000000 0.000000 0.415000 - "love" 0 0.000000 0.000000 0.415000 - "mayor" 0 0.000000 0.000000 0.415000 - "mysterious" 0 0.000000 0.000000 0.415000 - "novel" 0 0.000000 0.000000 0.415000 - "obvious" 0 0.000000 0.000000 0.415000 - "off!" 0 0.000000 0.000000 0.415000 - "rcvd:66.46.150.6" 0 0.000000 0.000000 0.415000 - "rcvd:linda" 0 0.000000 0.000000 0.415000 - "rcvd:transport2.azogle.com" 0 0.000000 0.000000 0.415000 - "reflects" 0 0.000000 0.000000 0.415000 - "returns" 0 0.000000 0.000000 0.415000 - "selection!" 0 0.000000 0.000000 0.415000 - "sewers" 0 0.000000 0.000000 0.415000 - "steal" 0 0.000000 0.000000 0.415000 - "subj:Handling" 0 0.000000 0.000000 0.415000 - "subj:King's" 0 0.000000 0.000000 0.415000 - "subj:Stephen" 0 0.000000 0.000000 0.415000 - "subj:latest" 0 0.000000 0.000000 0.415000 - "subj:thriller!" 0 0.000000 0.000000 0.415000 - "tale" 0 0.000000 0.000000 0.415000 - "talking" 0 0.000000 0.000000 0.415000 - "terrified" 0 0.000000 0.000000 0.415000 - "to:linda" 0 0.000000 0.000000 0.415000 - "wonder" 0 0.000000 0.000000 0.415000 - "With" 4 0.062500 0.047619 0.432355 - "through" 4 0.062500 0.047619 0.432355 - "From" 12 0.187500 0.142857 0.432407 - "It's" 12 0.187500 0.142857 0.432407 - "one" 22 0.333333 0.285714 0.461501 - "are" 36 0.541667 0.476190 0.467810 - "back" 7 0.104167 0.095238 0.477453 - "with" 49 0.729167 0.666667 0.477589 - "time" 10 0.145833 0.142857 0.494703 - "head:Date" 69 1.000000 1.000000 0.499978 - "head:Delivered-To" 69 1.000000 1.000000 0.499978 - "head:From" 69 1.000000 1.000000 0.499978 - "head:example.com" 69 1.000000 1.000000 0.499978 - "rcvd:EST" 69 1.000000 1.000000 0.499978 - "rcvd:Nov" 69 1.000000 1.000000 0.499978 - "rcvd:Postfix" 69 1.000000 1.000000 0.499978 - "rcvd:example.com" 69 1.000000 1.000000 0.499978 - "rcvd:for" 68 0.979167 1.000000 0.505240 - "rcvd:from" 68 0.979167 1.000000 0.505240 - "rcvd:with" 68 0.979167 1.000000 0.505240 - "will" 29 0.416667 0.428571 0.506986 - "the" 64 0.916667 0.952381 0.509528 - "have" 38 0.541667 0.571429 0.513323 - "and" 57 0.812500 0.857143 0.513338 - "most" 9 0.125000 0.142857 0.533100 - "head:Reply-To" 45 0.625000 0.714286 0.533287 - "from" 41 0.562500 0.666667 0.542318 - "http" 61 0.833333 1.000000 0.545416 - "for" 49 0.666667 0.809524 0.548339 - "mime:charset" 17 0.229167 0.285714 0.554767 - "how" 14 0.187500 0.238095 0.559257 - "because" 13 0.166667 0.238095 0.587998 - "head:Content-Type" 45 0.562500 0.857143 0.603699 - "format" 24 0.291667 0.476190 0.620003 - "this" 45 0.541667 0.904762 0.625431 - "you" 40 0.479167 0.809524 0.628081 - "New" 7 0.083333 0.142857 0.631030 - "who" 7 0.083333 0.142857 0.631030 - "get" 21 0.250000 0.428571 0.631396 - "to:example.com" 42 0.500000 0.857143 0.631487 - "your" 42 0.500000 0.857143 0.631487 - "head:MIME-Version" 30 0.354167 0.619048 0.635955 - "head:Content-Transfer-Encoding" 22 0.250000 0.476190 0.655543 - "multi-part" 22 0.250000 0.476190 0.655543 - "head:Message-Id" 35 0.395833 0.761905 0.657974 - "mime:plain" 28 0.312500 0.619048 0.664378 - "head:bit" 21 0.229167 0.476190 0.674885 - "MIME" 25 0.270833 0.571429 0.678258 - "head:multipart" 29 0.312500 0.666667 0.680688 - "mime:text" 29 0.312500 0.666667 0.680688 - "This" 41 0.437500 0.952381 0.685108 - "another" 2 0.020833 0.047619 0.693176 - "titles" 4 0.041667 0.095238 0.694409 - "mime:Content-Transfer-Encoding" 26 0.270833 0.619048 0.695460 - "mime:Content-Type" 28 0.291667 0.666667 0.695474 - "message" 34 0.354167 0.809524 0.695505 - "rcvd:SMTP" 34 0.354167 0.809524 0.695505 - "mime:bit" 25 0.250000 0.619048 0.712117 - "email" 30 0.270833 0.809524 0.749113 - "getting" 5 0.041667 0.142857 0.772919 - "our" 13 0.104167 0.380952 0.784770 - "mail" 19 0.145833 0.571429 0.796323 - "You" 20 0.145833 0.619048 0.808988 - "mime:us-ascii" 6 0.041667 0.190476 0.819313 - "office" 6 0.041667 0.190476 0.819313 - "Get" 10 0.062500 0.333333 0.841346 - "unsubscribe" 18 0.104167 0.619048 0.855531 - "head:report" 4 0.020833 0.142857 0.870699 - "end" 5 0.020833 0.190476 0.899683 + "Arial" 15 0.062500 0.571429 0.900832 + "Special" 6 0.020833 0.238095 0.918048 + "here" 18 0.062500 0.714286 0.919042 + "receive" 13 0.041667 0.523810 0.925617 + "below" 7 0.020833 0.285714 0.930727 + "Click" 14 0.041667 0.571429 0.931382 + "receiving" 8 0.020833 0.333333 0.940008 + "head:alternative" 16 0.041667 0.666667 0.940592 + "size" 24 0.062500 1.000000 0.940787 + "border" 20 0.041667 0.857143 0.953163 + "face" 20 0.041667 0.857143 0.953163 + "height" 23 0.041667 1.000000 0.959579 + "href" 23 0.041667 1.000000 0.959579 + "src" 23 0.041667 1.000000 0.959579 + "width" 23 0.041667 1.000000 0.959579 + "click" 13 0.020833 0.571429 0.964072 + "mime:html" 15 0.020833 0.666667 0.969040 + "Choose" 1 0.000000 0.047619 0.989769 + "Times" 1 0.000000 0.047619 0.989769 + "York" 1 0.000000 0.047619 0.989769 + "lessons" 1 0.000000 0.047619 0.989769 + "plus" 1 0.000000 0.047619 0.989769 + "subj:Shipping" 1 0.000000 0.047619 0.989769 + "rcvd:Sat" 2 0.000000 0.095238 0.994839 + "Deals" 3 0.000000 0.142857 0.996549 + "SHIPPING" 3 0.000000 0.142857 0.996549 + "Sarckos" 3 0.000000 0.142857 0.996549 + "ZYPb9G" 3 0.000000 0.142857 0.996549 + "from:reply.azogle.com" 3 0.000000 0.142857 0.996549 + "from:sarckos" 3 0.000000 0.142857 0.996549 + "h.gif" 3 0.000000 0.142857 0.996549 + "head:X-Info" 3 0.000000 0.142857 0.996549 + "head:abuse" 3 0.000000 0.142857 0.996549 + "head:azogle.com" 3 0.000000 0.142857 0.996549 + "head:please" 3 0.000000 0.142857 0.996549 + "head:reply.azogle.com" 3 0.000000 0.142857 0.996549 + "head:service" 3 0.000000 0.142857 0.996549 + "head:this" 3 0.000000 0.142857 0.996549 + "jid" 3 0.000000 0.142857 0.996549 + "main.azogle.com" 3 0.000000 0.142857 0.996549 + "opted-in" 3 0.000000 0.142857 0.996549 + "or.php" 3 0.000000 0.142857 0.996549 + "publisher" 3 0.000000 0.142857 0.996549 + "rcvd:Azoogle" 3 0.000000 0.142857 0.996549 + "rcvd:GMT" 3 0.000000 0.142857 0.996549 + "rcvd:azoogle" 3 0.000000 0.142857 0.996549 + "rcvd:local" 3 0.000000 0.142857 0.996549 + "rtrn:bounce.azogle.com" 3 0.000000 0.142857 0.996549 + "sarckos" 3 0.000000 0.142857 0.996549 + "see" 3 0.000000 0.142857 0.996549 + "spacer.gif" 3 0.000000 0.142857 0.996549 + "subj:Free" 3 0.000000 0.142857 0.996549 + "u.azogle.com" 3 0.000000 0.142857 0.996549 + "www.sarcko.com" 3 0.000000 0.142857 0.996549 + "cancel" 4 0.000000 0.190476 0.997408 + "mime:Content-Length" 4 0.000000 0.190476 0.997408 + "instructions" 6 0.000000 0.285714 0.998270 + "subscriber" 6 0.000000 0.285714 0.998270 + "FREE" 10 0.000000 0.476190 0.998961 + N_P_Q_S_s_x_md 86 0.000000 0.000000 0.500000 0.017800 0.415000 0.375000 bogofilter-1.2.4/src/tests/outputs/multiple.wordlists.ref0000644000175000017500000002010312163572274022101 0ustar sezsez#### 1: score message using each wordlist #### ignore: X-Bogosity: Unsure, tests=bogofilter, spamicity=0.520000 system: X-Bogosity: Ham, tests=bogofilter, spamicity=0.213252 user: X-Bogosity: Ham, tests=bogofilter, spamicity=0.227632 wordlist: X-Bogosity: Ham, tests=bogofilter, spamicity=0.246543 #### 1: score message using each config file #### Using default.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.246543 n pgood pbad fw U "common" 9 7.000000 2.000000 0.222810 + "ignore" 9 7.000000 2.000000 0.222810 + "word_low" 9 7.000000 2.000000 0.222810 + "message" 0 0.000000 0.000000 0.520000 - "system_hi" 0 0.000000 0.000000 0.520000 - "system_low" 0 0.000000 0.000000 0.520000 - "user_hi" 0 0.000000 0.000000 0.520000 - "user_low" 0 0.000000 0.000000 0.520000 - "word_hi" 9 2.000000 7.000000 0.777269 + N_P_Q_S_s_x_md 4 0.807830 0.300917 0.246543 0.017800 0.520000 0.100000 Using ign_reg.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.346753 n pgood pbad fw U "common" 9 7.000000 2.000000 0.222810 + "word_low" 9 7.000000 2.000000 0.222810 + "ignore" 0 -------- -------- 0.520000 i "message" 0 0.000000 0.000000 0.520000 - "system_hi" 0 -------- -------- 0.520000 i "system_low" 0 0.000000 0.000000 0.520000 - "user_hi" 0 0.000000 0.000000 0.520000 - "user_low" 0 -------- -------- 0.520000 i "word_hi" 9 2.000000 7.000000 0.777269 + N_P_Q_S_s_x_md 3 0.675071 0.368576 0.346753 0.017800 0.520000 0.100000 Using ign_usr_sys.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.317310 n pgood pbad fw U "system_low" 11 0.818182 0.181818 0.182365 + "common" 21 1.545455 0.363636 0.190755 + "ignore" 0 -------- -------- 0.520000 i "message" 0 0.000000 0.000000 0.520000 - "system_hi" 0 -------- -------- 0.520000 i "user_low" 0 -------- -------- 0.520000 i "word_hi" 0 0.000000 0.000000 0.520000 - "word_low" 0 0.000000 0.000000 0.520000 - "user_hi" 10 0.181818 0.727273 0.799502 + N_P_Q_S_s_x_md 3 0.671278 0.305897 0.317310 0.017800 0.520000 0.100000 Using mrg_usr_sys.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.267356 n pgood pbad fw U "system_low" 11 0.818182 0.181818 0.182365 + "common" 21 1.545455 0.363636 0.190755 + "ignore" 21 1.545455 0.363636 0.190755 + "user_low" 10 0.727273 0.181818 0.200569 + "message" 0 0.000000 0.000000 0.520000 - "word_hi" 0 0.000000 0.000000 0.520000 - "word_low" 0 0.000000 0.000000 0.520000 - "user_hi" 10 0.181818 0.727273 0.799502 + "system_hi" 11 0.181818 0.818182 0.817700 + N_P_Q_S_s_x_md 6 0.760046 0.294759 0.267356 0.017800 0.520000 0.100000 #### Update user using ign_usr_sys.cf #### #### 2: score message using each wordlist #### ignore: X-Bogosity: Unsure, tests=bogofilter, spamicity=0.520000 system: X-Bogosity: Ham, tests=bogofilter, spamicity=0.213252 user: X-Bogosity: Ham, tests=bogofilter, spamicity=0.165188 wordlist: X-Bogosity: Ham, tests=bogofilter, spamicity=0.246543 #### 2: score message using each config file #### Using default.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.246543 n pgood pbad fw U "common" 9 7.000000 2.000000 0.222810 + "ignore" 9 7.000000 2.000000 0.222810 + "word_low" 9 7.000000 2.000000 0.222810 + "message" 0 0.000000 0.000000 0.520000 - "system_hi" 0 0.000000 0.000000 0.520000 - "system_low" 0 0.000000 0.000000 0.520000 - "user_hi" 0 0.000000 0.000000 0.520000 - "user_low" 0 0.000000 0.000000 0.520000 - "word_hi" 9 2.000000 7.000000 0.777269 + N_P_Q_S_s_x_md 4 0.807830 0.300917 0.246543 0.017800 0.520000 0.100000 Using ign_reg.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.346753 n pgood pbad fw U "common" 9 7.000000 2.000000 0.222810 + "word_low" 9 7.000000 2.000000 0.222810 + "ignore" 0 -------- -------- 0.520000 i "message" 0 0.000000 0.000000 0.520000 - "system_hi" 0 -------- -------- 0.520000 i "system_low" 0 0.000000 0.000000 0.520000 - "user_hi" 0 0.000000 0.000000 0.520000 - "user_low" 0 -------- -------- 0.520000 i "word_hi" 9 2.000000 7.000000 0.777269 + N_P_Q_S_s_x_md 3 0.675071 0.368576 0.346753 0.017800 0.520000 0.100000 Using ign_usr_sys.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.101546 n pgood pbad fw U "message" 1 0.083333 0.000000 0.009094 + "common" 22 1.500000 0.363636 0.195385 + "system_low" 11 0.750000 0.181818 0.195647 + "ignore" 0 -------- -------- 0.520000 i "system_hi" 0 -------- -------- 0.520000 i "user_low" 0 -------- -------- 0.520000 i "word_hi" 0 0.000000 0.000000 0.520000 - "word_low" 0 0.000000 0.000000 0.520000 - "user_hi" 10 0.166667 0.727273 0.813038 + N_P_Q_S_s_x_md 4 0.834638 0.037730 0.101546 0.017800 0.520000 0.100000 Using mrg_usr_sys.cf: X-Bogosity: Ham, tests=bogofilter, spamicity=0.105029 n pgood pbad fw U "message" 1 0.083333 0.000000 0.009094 + "common" 22 1.500000 0.363636 0.195385 + "ignore" 22 1.500000 0.363636 0.195385 + "system_low" 11 0.750000 0.181818 0.195647 + "user_low" 10 0.666667 0.181818 0.214829 + "word_hi" 0 0.000000 0.000000 0.520000 - "word_low" 0 0.000000 0.000000 0.520000 - "user_hi" 10 0.166667 0.727273 0.813038 + "system_hi" 11 0.166667 0.818182 0.830267 + N_P_Q_S_s_x_md 7 0.849305 0.059363 0.105029 0.017800 0.520000 0.100000 bogofilter-1.2.4/src/tests/outputs/dump.load-3.out0000644000175000017500000000032212163572274020274 0ustar sezsezyork 12 0 20021215 your 152 0 20021004 your-34 34 0 20021004 your-info.net 10 0 20021215 yours-340 340 0 20020820      sardonen 1 0 20021010 ¢º¢¹speed~¢Ü¢Ý¢·¢Â¸ 2 0 20021020 ¢¾¢¾ 2 0 20021210 ¢¾±¤ 2 0 20021210 bogofilter-1.2.4/src/tests/outputs/dump.load-5.out0000644000175000017500000000020712163572274020300 0ustar sezsez?????sardonen 1 0 20021010 ????speed~????????? 2 0 20021020 your-34 34 0 20021004 your-info.net 10 0 20021215 yours-340 340 0 20020820 bogofilter-1.2.4/src/tests/outputs/dump.load-1.out0000644000175000017500000000075612163572274020305 0ustar sezsez--------=_1036160812-16487-96 3 0 20020815 --------=_1036180482-12472-42 3 0 20020815 years 5 0 20020801 yinfobanner.jpg 2 0 20020801 york 1 0 20020801 you 92 0 20020801 you'd 2 0 20020801 you'll 8 0 20020801 you're 3 0 20020801 your 76 0 20020801 your-info.net 5 0 20020801 yours 3 0 20020801 yourself 12 0 20020801 yx5 1 0 20020801 ziff 1 0 20020801 znex 2 0 20020801 zyban 3 0 20020801 zypb9g 9 0 20020801 zzzzzz 2 0 20020801 –jim 4 0 20020815 –lydia 4 0 20020815      sardonen 1 0 20021010 bogofilter-1.2.4/src/tests/outputs/message_addr.ref0000644000175000017500000001005612163572274020641 0ustar sezsezinputs/good.mbx X-Bogosity: Ham, message_addr=242.21.90.239 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=219.168.1.10 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=208.16.1.169 inputs/good.mbx X-Bogosity: Ham, message_addr=192.6.114.30 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=66.28.209.210 inputs/good.mbx X-Bogosity: Ham, message_addr=198.111.176.9 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=242.21.90.239 inputs/good.mbx X-Bogosity: Ham, message_addr=18.181.0.25 inputs/good.mbx X-Bogosity: Ham, message_addr=216.91.57.134 inputs/good.mbx X-Bogosity: Ham, message_addr=208.10.173.199 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=208.179.92.72 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=207.69.200.60 inputs/good.mbx X-Bogosity: Ham, message_addr=209.0.176.201 inputs/good.mbx X-Bogosity: Ham, message_addr=UNKNOWN inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=219.168.1.10 inputs/good.mbx X-Bogosity: Ham, message_addr=216.86.64.42 inputs/good.mbx X-Bogosity: Ham, message_addr=12.155.117.29 inputs/good.mbx X-Bogosity: Ham, message_addr=216.73.90.107 inputs/good.mbx X-Bogosity: Ham, message_addr=208.137.16.31 inputs/good.mbx X-Bogosity: Ham, message_addr=208.16.1.163 inputs/good.mbx X-Bogosity: Ham, message_addr=12.155.117.29 inputs/good.mbx X-Bogosity: Ham, message_addr=240.138.93.2 inputs/good.mbx X-Bogosity: Ham, message_addr=12.155.117.29 inputs/good.mbx X-Bogosity: Ham, message_addr=242.21.90.239 inputs/good.mbx X-Bogosity: Ham, message_addr=240.38.6.9 inputs/good.mbx X-Bogosity: Ham, message_addr=242.21.90.239 inputs/good.mbx X-Bogosity: Ham, message_addr=63.209.80.248 inputs/good.mbx X-Bogosity: Ham, message_addr=242.21.90.239 inputs/spam.mbx X-Bogosity: Spam, message_addr=64.253.199.168 inputs/spam.mbx X-Bogosity: Spam, message_addr=209.132.232.123 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.180.247.22 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.46.150.35 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.216.107.148 inputs/spam.mbx X-Bogosity: Spam, message_addr=216.52.222.173 inputs/spam.mbx X-Bogosity: Spam, message_addr=216.73.90.45 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.46.150.14 inputs/spam.mbx X-Bogosity: Spam, message_addr=216.23.198.157 inputs/spam.mbx X-Bogosity: Spam, message_addr=64.49.250.134 inputs/spam.mbx X-Bogosity: Spam, message_addr=209.236.57.141 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.216.107.239 inputs/spam.mbx X-Bogosity: Spam, message_addr=209.236.57.228 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.216.110.163 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.46.150.8 inputs/spam.mbx X-Bogosity: Spam, message_addr=209.236.57.188 inputs/spam.mbx X-Bogosity: Spam, message_addr=216.109.92.210 inputs/spam.mbx X-Bogosity: Spam, message_addr=216.52.222.183 inputs/spam.mbx X-Bogosity: Spam, message_addr=64.49.241.142 inputs/spam.mbx X-Bogosity: Spam, message_addr=66.239.2.70 inputs/spam.mbx X-Bogosity: Spam, message_addr=216.23.198.157 bogofilter-1.2.4/src/tests/outputs/msg.2a.vv0000644000175000017500000000073712163572274017176 0ustar sezsezX-Bogosity: Unsure, tests=bogofilter, spamicity=0.500000 int cnt prob spamicity histogram 0.00 33 0.003618 0.001355 ####################### 0.10 0 0.000000 0.001355 0.20 0 0.000000 0.001355 0.30 0 0.000000 0.001355 0.40 0 0.000000 0.001355 0.50 0 0.000000 0.001355 0.60 0 0.000000 0.001355 0.70 0 0.000000 0.001355 0.80 1 0.899683 0.026406 # 0.90 71 0.977116 0.529864 ################################################ bogofilter-1.2.4/src/tests/outputs/msg.2b.vv0000644000175000017500000000073312163572274017173 0ustar sezsezX-Bogosity: Unsure, tests=bogofilter, spamicity=0.500000 int cnt prob spamicity histogram 0.00 28 0.003699 0.001283 ################### 0.10 0 0.000000 0.001283 0.20 0 0.000000 0.001283 0.30 0 0.000000 0.001283 0.40 0 0.000000 0.001283 0.50 0 0.000000 0.001283 0.60 0 0.000000 0.001283 0.70 0 0.000000 0.001283 0.80 1 0.895486 0.028074 # 0.90 72 0.977285 0.543657 ################################################ bogofilter-1.2.4/src/tests/outputs/lexer.out0000644000175000017500000000132612163572274017375 0ustar sezsezAccount City Clancy Clancy's Click DVDs Free Giuliani Inc Jack JunkFlix Leadership Netflix New Please Program Rabbit Red Rent Rudolph Ryan Standard Subject The Tom Trial! York Your all and any anytime back behind biggest button cancelable cancellation change character city's complete conditions controversial credits crisis for free guided head:From head:nobody head:nowhere.com his history including instructions learned length lessons mayor month-to-month monthly most office partial period periods popular reflects refunds reserves right story subj:Free subj:Handling subj:King's subj:Shipping subj:Stephen subj:latest subj:thriller! subscription terms the there through time trial visit want who with www.netflix.com you bogofilter-1.2.4/src/tests/outputs/MH.out0000644000175000017500000000103412163572274016556 0ustar sezsez spam good .MSG_COUNT 21 48 Lotus 1 1 Magazine 1 2 Min 1 1 Service 3 2 connection 1 1 more 2 13 most 3 6 set 1 1 that 9 32 unsubscribe 13 5 bogofilter-1.2.4/src/tests/outputs/msg.2b.vvv0000644000175000017500000005726612163572274017376 0ustar sezsezX-Bogosity: Unsure, tests=bogofilter, spamicity=0.500000 n pgood pbad fw U "which" 10 0.208333 0.000000 0.000737 + "working" 6 0.125000 0.000000 0.001228 + "having" 5 0.104167 0.000000 0.001472 + "own" 5 0.104167 0.000000 0.001472 + "yet" 5 0.104167 0.000000 0.001472 + "effort" 4 0.083333 0.000000 0.001839 + "let" 4 0.083333 0.000000 0.001839 + "program" 4 0.083333 0.000000 0.001839 + "were" 4 0.083333 0.000000 0.001839 + "How" 3 0.062500 0.000000 0.002448 + "current" 3 0.062500 0.000000 0.002448 + "lot" 3 0.062500 0.000000 0.002448 + "making" 3 0.062500 0.000000 0.002448 + "rights" 3 0.062500 0.000000 0.002448 + "used" 3 0.062500 0.000000 0.002448 + "very" 3 0.062500 0.000000 0.002448 + "Find" 2 0.041667 0.000000 0.003661 + "Online" 2 0.041667 0.000000 0.003661 + "call" 2 0.041667 0.000000 0.003661 + "went" 2 0.041667 0.000000 0.003661 + "Future" 1 0.020833 0.000000 0.007258 + "LLC" 1 0.020833 0.000000 0.007258 + "Only" 1 0.020833 0.000000 0.007258 + "asked" 1 0.020833 0.000000 0.007258 + "dollars" 1 0.020833 0.000000 0.007258 + "made" 1 0.020833 0.000000 0.007258 + "site" 1 0.020833 0.000000 0.007258 + "steps" 1 0.020833 0.000000 0.007258 + "out" 20 0.375000 0.090909 0.195317 - "web" 10 0.187500 0.045455 0.195513 - "too" 9 0.166667 0.045455 0.214682 - "Nov" 8 0.145833 0.045455 0.238018 - "more" 15 0.270833 0.090909 0.251503 - "rcvd:ESMTP" 44 0.791667 0.272727 0.256292 - "find" 12 0.208333 0.090909 0.303962 - "also" 11 0.187500 0.090909 0.326674 - "just" 20 0.333333 0.181818 0.352996 - "All" 10 0.166667 0.090909 0.353051 - "work" 10 0.166667 0.090909 0.353051 - "around" 5 0.083333 0.045455 0.353161 - "being" 5 0.083333 0.045455 0.353161 - "contact" 5 0.083333 0.045455 0.353161 - "simple" 5 0.083333 0.045455 0.353161 - "but" 29 0.479167 0.272727 0.362752 - "e-mail" 9 0.145833 0.090909 0.384061 - "they" 9 0.145833 0.090909 0.384061 - "not" 26 0.416667 0.272727 0.395618 - "about" 17 0.270833 0.181818 0.401688 - "that" 42 0.666667 0.454545 0.405409 - "$495" 0 0.000000 0.000000 0.415000 - "ABSOLUTELY" 0 0.000000 0.000000 0.415000 - "Cash!" 0 0.000000 0.000000 0.415000 - "Charge" 0 0.000000 0.000000 0.415000 - "Dean" 0 0.000000 0.000000 0.415000 - "DentistLookup.com" 0 0.000000 0.000000 0.415000 - "Email-Lookup.com" 0 0.000000 0.000000 0.415000 - "Every" 0 0.000000 0.000000 0.415000 - "GREATEST" 0 0.000000 0.000000 0.415000 - "GenuineRewards" 0 0.000000 0.000000 0.415000 - "Graziosi" 0 0.000000 0.000000 0.415000 - "Isn't" 0 0.000000 0.000000 0.415000 - "Kit" 0 0.000000 0.000000 0.415000 - "LINDA" 0 0.000000 0.000000 0.415000 - "MDLookup.com" 0 0.000000 0.000000 0.415000 - "Millions" 0 0.000000 0.000000 0.415000 - "Motor" 0 0.000000 0.000000 0.415000 - "MotorMillions.com" 0 0.000000 0.000000 0.415000 - "NADA" 0 0.000000 0.000000 0.415000 - "NOSEND" 0 0.000000 0.000000 0.415000 - "NOW!!!" 0 0.000000 0.000000 0.415000 - "No-risk" 0 0.000000 0.000000 0.415000 - "Powered" 0 0.000000 0.000000 0.415000 - "Right" 0 0.000000 0.000000 0.415000 - "Sat" 0 0.000000 0.000000 0.415000 - "Unconditional" 0 0.000000 0.000000 0.415000 - "Uncover" 0 0.000000 0.000000 0.415000 - "absolutely" 0 0.000000 0.000000 0.415000 - "abuse" 0 0.000000 0.000000 0.415000 - "accomplishment" 0 0.000000 0.000000 0.415000 - "amazingly" 0 0.000000 0.000000 0.415000 - "apologize" 0 0.000000 0.000000 0.415000 - "bigtitle" 0 0.000000 0.000000 0.415000 - "blacktitle" 0 0.000000 0.000000 0.415000 - "build" 0 0.000000 0.000000 0.415000 - "cash" 0 0.000000 0.000000 0.415000 - "coupons" 0 0.000000 0.000000 0.415000 - "covered" 0 0.000000 0.000000 0.415000 - "debt" 0 0.000000 0.000000 0.415000 - "dentist" 0 0.000000 0.000000 0.415000 - "dentistlookup.com" 0 0.000000 0.000000 0.415000 - "doctor" 0 0.000000 0.000000 0.415000 - "easy-to-follow" 0 0.000000 0.000000 0.415000 - "email-lookup.com" 0 0.000000 0.000000 0.415000 - "enjoy" 0 0.000000 0.000000 0.415000 - "ensure" 0 0.000000 0.000000 0.415000 - "estimating" 0 0.000000 0.000000 0.415000 - "excluded" 0 0.000000 0.000000 0.415000 - "feel" 0 0.000000 0.000000 0.415000 - "ff0000" 0 0.000000 0.000000 0.415000 - "ff3333" 0 0.000000 0.000000 0.415000 - "financial" 0 0.000000 0.000000 0.415000 - "freedom" 0 0.000000 0.000000 0.415000 - "friend's" 0 0.000000 0.000000 0.415000 - "from:Millions" 0 0.000000 0.000000 0.415000 - "from:Motor" 0 0.000000 0.000000 0.415000 - "from:Motor_Millions" 0 0.000000 0.000000 0.415000 - "from:genuinerewards.com" 0 0.000000 0.000000 0.415000 - "genuinerewards.com" 0 0.000000 0.000000 0.415000 - "head:genuinerewards.com" 0 0.000000 0.000000 0.415000 - "highlight" 0 0.000000 0.000000 0.415000 - "immediate" 0 0.000000 0.000000 0.415000 - "invest" 0 0.000000 0.000000 0.415000 - "laid" 0 0.000000 0.000000 0.415000 - "life's" 0 0.000000 0.000000 0.415000 - "lucrative" 0 0.000000 0.000000 0.415000 - "luxuries" 0 0.000000 0.000000 0.415000 - "mdlookup.com" 0 0.000000 0.000000 0.415000 - "minds" 0 0.000000 0.000000 0.415000 - "motorm" 0 0.000000 0.000000 0.415000 - "offer!" 0 0.000000 0.000000 0.415000 - "offerings" 0 0.000000 0.000000 0.415000 - "official" 0 0.000000 0.000000 0.415000 - "pocket" 0 0.000000 0.000000 0.415000 - "powerful" 0 0.000000 0.000000 0.415000 - "prevent" 0 0.000000 0.000000 0.415000 - "previously" 0 0.000000 0.000000 0.415000 - "promotional" 0 0.000000 0.000000 0.415000 - "qoute.jpg" 0 0.000000 0.000000 0.415000 - "rcvd:216.177.60.45" 0 0.000000 0.000000 0.415000 - "rcvd:LINDA" 0 0.000000 0.000000 0.415000 - "rcvd:OC31.YOURMAILSOURCE.COM" 0 0.000000 0.000000 0.415000 - "rcvd:om40.yourmailsource.com" 0 0.000000 0.000000 0.415000 - "reaching" 0 0.000000 0.000000 0.415000 - "reveal" 0 0.000000 0.000000 0.415000 - "rtrn:OC31.YOURMAILSOURCE.COM" 0 0.000000 0.000000 0.415000 - "sense" 0 0.000000 0.000000 0.415000 - "solicitations" 0 0.000000 0.000000 0.415000 - "stop.gif" 0 0.000000 0.000000 0.415000 - "stopped" 0 0.000000 0.000000 0.415000 - "subj:Build" 0 0.000000 0.000000 0.415000 - "subj:How" 0 0.000000 0.000000 0.415000 - "subj:Immediate" 0 0.000000 0.000000 0.415000 - "subj:Wealth!" 0 0.000000 0.000000 0.415000 - "take-control.gif" 0 0.000000 0.000000 0.415000 - "tap" 0 0.000000 0.000000 0.415000 - "title2" 0 0.000000 0.000000 0.415000 - "title3" 0 0.000000 0.000000 0.415000 - "to:LINDA" 0 0.000000 0.000000 0.415000 - "topbar3.jpg" 0 0.000000 0.000000 0.415000 - "trying!!" 0 0.000000 0.000000 0.415000 - "unable" 0 0.000000 0.000000 0.415000 - "wad" 0 0.000000 0.000000 0.415000 - "walk" 0 0.000000 0.000000 0.415000 - "wealth" 0 0.000000 0.000000 0.415000 - "www.genuinerewards.com" 0 0.000000 0.000000 0.415000 - "his" 4 0.062500 0.045455 0.421026 - "product" 4 0.062500 0.045455 0.421026 - "without" 4 0.062500 0.045455 0.421026 - "messages" 8 0.125000 0.090909 0.421039 - "The" 36 0.562500 0.409091 0.421050 - "nice" 7 0.104167 0.090909 0.465890 - "off" 7 0.104167 0.090909 0.465890 - "are" 37 0.541667 0.500000 0.479969 - "with" 50 0.729167 0.681818 0.483197 - "one" 23 0.333333 0.318182 0.488315 - "may" 13 0.187500 0.181818 0.492202 - "head:Date" 70 1.000000 1.000000 0.499978 - "head:Delivered-To" 70 1.000000 1.000000 0.499978 - "head:From" 70 1.000000 1.000000 0.499978 - "head:example.com" 70 1.000000 1.000000 0.499978 - "rcvd:EST" 70 1.000000 1.000000 0.499978 - "rcvd:Nov" 70 1.000000 1.000000 0.499978 - "rcvd:Postfix" 70 1.000000 1.000000 0.499978 - "rcvd:example.com" 70 1.000000 1.000000 0.499978 - "rcvd:for" 69 0.979167 1.000000 0.505240 - "rcvd:from" 69 0.979167 1.000000 0.505240 - "rcvd:with" 69 0.979167 1.000000 0.505240 - "the" 65 0.916667 0.954545 0.510095 - "and" 58 0.812500 0.863636 0.515223 - "Back" 3 0.041667 0.045455 0.521110 - "Date" 3 0.041667 0.045455 0.521110 - "However" 3 0.041667 0.045455 0.521110 - "error" 3 0.041667 0.045455 0.521110 - "keep" 3 0.041667 0.045455 0.521110 - "rcvd:v1.5" 3 0.041667 0.045455 0.521110 - "text" 6 0.083333 0.090909 0.521423 - "does" 9 0.125000 0.136364 0.521528 - "can" 21 0.291667 0.318182 0.521649 - "will" 30 0.416667 0.454545 0.521676 - "have" 39 0.541667 0.590909 0.521690 - "head:Reply-To" 46 0.625000 0.727273 0.537768 - "http" 62 0.833333 1.000000 0.545417 - "from" 42 0.562500 0.681818 0.547889 - "for" 50 0.666667 0.818182 0.550972 - "time" 11 0.145833 0.181818 0.554687 - "mime:Content-Disposition" 19 0.250000 0.318182 0.559864 - "mime:inline" 19 0.250000 0.318182 0.559864 - "mime:charset" 18 0.229167 0.318182 0.581151 - "class" 5 0.062500 0.090909 0.591963 - "reserved" 5 0.062500 0.090909 0.591963 - "help" 10 0.125000 0.181818 0.592277 - "how" 15 0.187500 0.272727 0.592382 - "head:Content-Type" 46 0.562500 0.863636 0.605504 - "new" 12 0.145833 0.227273 0.608850 - "this" 46 0.541667 0.909091 0.626550 - "you" 41 0.479167 0.818182 0.630563 - "format" 25 0.291667 0.500000 0.631425 - "your" 43 0.500000 0.863636 0.633243 - "head:MIME-Version" 31 0.354167 0.636364 0.642317 - "get" 22 0.250000 0.454545 0.644975 - "was" 26 0.291667 0.545455 0.651422 - "address" 15 0.166667 0.318182 0.655964 - "head:Message-Id" 36 0.395833 0.772727 0.661142 - "multi-part" 23 0.250000 0.500000 0.666472 - "mime:plain" 29 0.312500 0.636364 0.670502 - "changing" 2 0.020833 0.045455 0.683326 - "everyone" 2 0.020833 0.045455 0.683326 - "extremely" 2 0.020833 0.045455 0.683326 - "field" 2 0.020833 0.045455 0.683326 - "reader" 2 0.020833 0.045455 0.683326 - "received" 2 0.020833 0.045455 0.683326 - "worth" 2 0.020833 0.045455 0.683326 - "database" 4 0.041667 0.090909 0.684515 - "industry" 4 0.041667 0.090909 0.684515 - "properly" 4 0.041667 0.090909 0.684515 - "rcvd:PowerMTA" 4 0.041667 0.090909 0.684515 - "want" 8 0.083333 0.181818 0.685113 - "over" 10 0.104167 0.227273 0.685233 - "their" 12 0.125000 0.272727 0.685313 - "MIME" 26 0.270833 0.590909 0.685529 - "head:multipart" 30 0.312500 0.681818 0.685554 - "mime:text" 30 0.312500 0.681818 0.685554 - "This" 42 0.437500 0.954545 0.685600 - "message" 35 0.354167 0.818182 0.697756 - "mime:Content-Type" 29 0.291667 0.681818 0.700214 - "mime:Content-Transfer-Encoding" 27 0.270833 0.636364 0.701273 - "mime:bit" 26 0.250000 0.636364 0.717741 - "today" 9 0.083333 0.227273 0.731082 - "email" 31 0.270833 0.818182 0.751111 - "Service" 5 0.041667 0.136364 0.764712 - "links" 5 0.041667 0.136364 0.764712 - "Your" 10 0.083333 0.272727 0.765334 - "please" 10 0.083333 0.272727 0.765334 - "rcvd:unknown" 13 0.104167 0.363636 0.776833 - "offer" 8 0.062500 0.227273 0.783494 - "our" 14 0.104167 0.409091 0.796563 - "mail" 20 0.145833 0.590909 0.801712 - "Learn" 3 0.020833 0.090909 0.811208 - "Price" 3 0.020833 0.090909 0.811208 - "URL" 3 0.020833 0.090909 0.811208 - "believe" 3 0.020833 0.090909 0.811208 - "guide" 3 0.020833 0.090909 0.811208 - "reading" 3 0.020833 0.090909 0.811208 - "Now" 6 0.041667 0.181818 0.812380 - "into" 6 0.041667 0.181818 0.812380 - "rcvd:envelope-from" 6 0.041667 0.181818 0.812380 - "You" 21 0.145833 0.636364 0.813222 - "mime:us-ascii" 7 0.041667 0.227273 0.843980 - "money" 4 0.020833 0.136364 0.865465 - "rcvd:EXAMPLE.COM" 4 0.020833 0.136364 0.865465 - "Save" 5 0.020833 0.181818 0.895486 + "Arial" 16 0.062500 0.590909 0.903804 + "simply" 6 0.020833 0.227273 0.914549 + "Helvetica" 12 0.041667 0.454545 0.915288 + "here" 19 0.062500 0.727273 0.920390 + "link" 7 0.020833 0.272727 0.927728 + "receive" 14 0.041667 0.545455 0.928380 + "Click" 15 0.041667 0.590909 0.933516 + "blank" 8 0.020833 0.318182 0.937385 + "wish" 8 0.020833 0.318182 0.937385 + "color" 16 0.041667 0.636364 0.937966 + "sans-serif" 16 0.041667 0.636364 0.937966 + "size" 25 0.062500 1.000000 0.940802 + "head:alternative" 17 0.041667 0.681818 0.941857 + "border" 21 0.041667 0.863636 0.953518 + "face" 21 0.041667 0.863636 0.953518 + "height" 24 0.041667 1.000000 0.959596 + "href" 24 0.041667 1.000000 0.959596 + "src" 24 0.041667 1.000000 0.959596 + "width" 24 0.041667 1.000000 0.959596 + "click" 14 0.020833 0.590909 0.965245 + "mime:html" 16 0.020833 0.681818 0.969733 + "$19.95" 1 0.000000 0.045455 0.989769 + "$500" 1 0.000000 0.045455 0.989769 + "Book" 1 0.000000 0.045455 0.989769 + "Cars" 1 0.000000 0.045455 0.989769 + "Customer" 1 0.000000 0.045455 0.989769 + "Day" 1 0.000000 0.045455 0.989769 + "Guarantee!" 1 0.000000 0.045455 0.989769 + "Into" 1 0.000000 0.045455 0.989769 + "TARGET" 1 0.000000 0.045455 0.989769 + "Take" 1 0.000000 0.045455 0.989769 + "above" 1 0.000000 0.045455 0.989769 + "browser's" 1 0.000000 0.045455 0.989769 + "click.asp" 1 0.000000 0.045455 0.989769 + "consider" 1 0.000000 0.045455 0.989769 + "creative" 1 0.000000 0.045455 0.989769 + "emid" 1 0.000000 0.045455 0.989769 + "gateway" 1 0.000000 0.045455 0.989769 + "handle" 1 0.000000 0.045455 0.989769 + "head:linda" 1 0.000000 0.045455 0.989769 + "head:mailings" 1 0.000000 0.045455 0.989769 + "limited" 1 0.000000 0.045455 0.989769 + "lnk" 1 0.000000 0.045455 0.989769 + "multipart" 1 0.000000 0.045455 0.989769 + "rcvd:COM" 1 0.000000 0.045455 0.989769 + "rcvd:EXAMPLE" 1 0.000000 0.045455 0.989769 + "revolutionary" 1 0.000000 0.045455 0.989769 + "rtrn:COM" 1 0.000000 0.045455 0.989769 + "rtrn:EXAMPLE" 1 0.000000 0.045455 0.989769 + "understands" 1 0.000000 0.045455 0.989769 + "view.asp" 1 0.000000 0.045455 0.989769 + "yours" 1 0.000000 0.045455 0.989769 + "$40" 2 0.000000 0.090909 0.994839 + "Order" 2 0.000000 0.090909 0.994839 + "Secrets" 2 0.000000 0.090909 0.994839 + "Turn" 2 0.000000 0.090909 0.994839 + "car" 2 0.000000 0.090909 0.994839 + "million" 2 0.000000 0.090909 0.994839 + "paste" 2 0.000000 0.090909 0.994839 + "plus" 2 0.000000 0.090909 0.994839 + "target" 2 0.000000 0.090909 0.994839 + "unsubscribe.asp" 2 0.000000 0.090909 0.994839 + "EXAMPLE.COM" 3 0.000000 0.136364 0.996549 + "appear" 3 0.000000 0.136364 0.996549 + "rcvd:Sat" 3 0.000000 0.136364 0.996549 + "to:EXAMPLE.COM" 3 0.000000 0.136364 0.996549 + "FFFFFF" 4 0.000000 0.181818 0.997408 + "Money" 5 0.000000 0.227273 0.997925 + "copy" 5 0.000000 0.227273 0.997925 + "Here" 7 0.000000 0.318182 0.998516 + "Verdana" 9 0.000000 0.409091 0.998845 + "FREE" 11 0.000000 0.500000 0.999055 + N_P_Q_S_s_x_md 101 0.000000 0.000000 0.500000 0.017800 0.415000 0.375000 bogofilter-1.2.4/src/tests/outputs/token.count.ref0000644000175000017500000003617212163572274020501 0ustar sezsez#### --min-dev=0.496 #### X-Bogosity: Unsure, tests=bogofilter, spamicity=0.493025 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000660 + "zip" 1 0.020833 0.000000 0.009094 - "all" 21 0.395833 0.095238 0.194216 - "web" 10 0.187500 0.047619 0.203096 - "too" 9 0.166667 0.047619 0.222810 - "been" 8 0.145833 0.047619 0.246762 - "file" 6 0.104167 0.047619 0.314336 - "also" 11 0.187500 0.095238 0.337138 - "about" 16 0.270833 0.142857 0.345518 - "little" 5 0.083333 0.047619 0.364191 - "any" 20 0.312500 0.238095 0.432510 - "would" 15 0.229167 0.190476 0.453979 - "visit" 3 0.041667 0.047619 0.533255 - "does" 9 0.125000 0.142857 0.533307 - "for" 49 0.666667 0.809524 0.548377 - "how" 14 0.187500 0.238095 0.559390 - "name" 8 0.104167 0.142857 0.578184 - "new" 12 0.145833 0.238095 0.620007 - "this" 45 0.541667 0.904762 0.625473 - "home" 9 0.104167 0.190476 0.646215 - "over" 10 0.104167 0.238095 0.695340 - "way" 11 0.104167 0.285714 0.732481 - "visiting" 1 0.000000 0.047619 0.991605 - "dealer" 2 0.000000 0.095238 0.995766 - "agree" 3 0.000000 0.142857 0.997169 + N_P_Q_S_s_x_md 2 0.019431 0.005482 0.493025 0.017800 0.520000 0.496000 #### --min-dev=0.496 --token-count-min=4 #### X-Bogosity: Unsure, tests=bogofilter, spamicity=0.532831 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000660 + "zip" 1 0.020833 0.000000 0.009094 - "all" 21 0.395833 0.095238 0.194216 - "web" 10 0.187500 0.047619 0.203096 - "too" 9 0.166667 0.047619 0.222810 - "been" 8 0.145833 0.047619 0.246762 - "file" 6 0.104167 0.047619 0.314336 - "also" 11 0.187500 0.095238 0.337138 - "about" 16 0.270833 0.142857 0.345518 - "little" 5 0.083333 0.047619 0.364191 - "any" 20 0.312500 0.238095 0.432510 - "would" 15 0.229167 0.190476 0.453979 - "visit" 3 0.041667 0.047619 0.533255 - "does" 9 0.125000 0.142857 0.533307 - "for" 49 0.666667 0.809524 0.548377 - "how" 14 0.187500 0.238095 0.559390 - "name" 8 0.104167 0.142857 0.578184 - "new" 12 0.145833 0.238095 0.620007 - "this" 45 0.541667 0.904762 0.625473 - "home" 9 0.104167 0.190476 0.646215 - "over" 10 0.104167 0.238095 0.695340 - "way" 11 0.104167 0.285714 0.732481 - "visiting" 1 0.000000 0.047619 0.991605 + "dealer" 2 0.000000 0.095238 0.995766 + "agree" 3 0.000000 0.142857 0.997169 + N_P_Q_S_s_x_md 4 0.000085 0.065746 0.532831 0.017800 0.520000 0.491605 #### --min-dev=0.496 --token-count-max=8 #### X-Bogosity: Unsure, tests=bogofilter, spamicity=0.493025 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000660 + "zip" 1 0.020833 0.000000 0.009094 - "all" 21 0.395833 0.095238 0.194216 - "web" 10 0.187500 0.047619 0.203096 - "too" 9 0.166667 0.047619 0.222810 - "been" 8 0.145833 0.047619 0.246762 - "file" 6 0.104167 0.047619 0.314336 - "also" 11 0.187500 0.095238 0.337138 - "about" 16 0.270833 0.142857 0.345518 - "little" 5 0.083333 0.047619 0.364191 - "any" 20 0.312500 0.238095 0.432510 - "would" 15 0.229167 0.190476 0.453979 - "visit" 3 0.041667 0.047619 0.533255 - "does" 9 0.125000 0.142857 0.533307 - "for" 49 0.666667 0.809524 0.548377 - "how" 14 0.187500 0.238095 0.559390 - "name" 8 0.104167 0.142857 0.578184 - "new" 12 0.145833 0.238095 0.620007 - "this" 45 0.541667 0.904762 0.625473 - "home" 9 0.104167 0.190476 0.646215 - "over" 10 0.104167 0.238095 0.695340 - "way" 11 0.104167 0.285714 0.732481 - "visiting" 1 0.000000 0.047619 0.991605 - "dealer" 2 0.000000 0.095238 0.995766 - "agree" 3 0.000000 0.142857 0.997169 + N_P_Q_S_s_x_md 2 0.019431 0.005482 0.493025 0.017800 0.520000 0.496000 #### --min-dev=0.100 #### X-Bogosity: Unsure, tests=bogofilter, spamicity=0.496075 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000660 + "zip" 1 0.020833 0.000000 0.009094 + "all" 21 0.395833 0.095238 0.194216 + "web" 10 0.187500 0.047619 0.203096 + "too" 9 0.166667 0.047619 0.222810 + "been" 8 0.145833 0.047619 0.246762 + "file" 6 0.104167 0.047619 0.314336 + "also" 11 0.187500 0.095238 0.337138 + "about" 16 0.270833 0.142857 0.345518 + "little" 5 0.083333 0.047619 0.364191 + "any" 20 0.312500 0.238095 0.432510 - "would" 15 0.229167 0.190476 0.453979 - "visit" 3 0.041667 0.047619 0.533255 - "does" 9 0.125000 0.142857 0.533307 - "for" 49 0.666667 0.809524 0.548377 - "how" 14 0.187500 0.238095 0.559390 - "name" 8 0.104167 0.142857 0.578184 - "new" 12 0.145833 0.238095 0.620007 + "this" 45 0.541667 0.904762 0.625473 + "home" 9 0.104167 0.190476 0.646215 + "over" 10 0.104167 0.238095 0.695340 + "way" 11 0.104167 0.285714 0.732481 + "visiting" 1 0.000000 0.047619 0.991605 + "dealer" 2 0.000000 0.095238 0.995766 + "agree" 3 0.000000 0.142857 0.997169 + N_P_Q_S_s_x_md 18 0.079368 0.071517 0.496075 0.017800 0.520000 0.100000 #### --min-dev=0.100 --token-count-min=4 #### X-Bogosity: Unsure, tests=bogofilter, spamicity=0.496075 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000660 + "zip" 1 0.020833 0.000000 0.009094 + "all" 21 0.395833 0.095238 0.194216 + "web" 10 0.187500 0.047619 0.203096 + "too" 9 0.166667 0.047619 0.222810 + "been" 8 0.145833 0.047619 0.246762 + "file" 6 0.104167 0.047619 0.314336 + "also" 11 0.187500 0.095238 0.337138 + "about" 16 0.270833 0.142857 0.345518 + "little" 5 0.083333 0.047619 0.364191 + "any" 20 0.312500 0.238095 0.432510 - "would" 15 0.229167 0.190476 0.453979 - "visit" 3 0.041667 0.047619 0.533255 - "does" 9 0.125000 0.142857 0.533307 - "for" 49 0.666667 0.809524 0.548377 - "how" 14 0.187500 0.238095 0.559390 - "name" 8 0.104167 0.142857 0.578184 - "new" 12 0.145833 0.238095 0.620007 + "this" 45 0.541667 0.904762 0.625473 + "home" 9 0.104167 0.190476 0.646215 + "over" 10 0.104167 0.238095 0.695340 + "way" 11 0.104167 0.285714 0.732481 + "visiting" 1 0.000000 0.047619 0.991605 + "dealer" 2 0.000000 0.095238 0.995766 + "agree" 3 0.000000 0.142857 0.997169 + N_P_Q_S_s_x_md 18 0.079368 0.071517 0.496075 0.017800 0.520000 0.100000 #### --min-dev=0.100 --token-count-max=8 #### X-Bogosity: Unsure, tests=bogofilter, spamicity=0.500083 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000660 + "zip" 1 0.020833 0.000000 0.009094 + "all" 21 0.395833 0.095238 0.194216 + "web" 10 0.187500 0.047619 0.203096 + "too" 9 0.166667 0.047619 0.222810 + "been" 8 0.145833 0.047619 0.246762 - "file" 6 0.104167 0.047619 0.314336 - "also" 11 0.187500 0.095238 0.337138 - "about" 16 0.270833 0.142857 0.345518 - "little" 5 0.083333 0.047619 0.364191 - "any" 20 0.312500 0.238095 0.432510 - "would" 15 0.229167 0.190476 0.453979 - "visit" 3 0.041667 0.047619 0.533255 - "does" 9 0.125000 0.142857 0.533307 - "for" 49 0.666667 0.809524 0.548377 - "how" 14 0.187500 0.238095 0.559390 - "name" 8 0.104167 0.142857 0.578184 - "new" 12 0.145833 0.238095 0.620007 - "this" 45 0.541667 0.904762 0.625473 - "home" 9 0.104167 0.190476 0.646215 - "over" 10 0.104167 0.238095 0.695340 - "way" 11 0.104167 0.285714 0.732481 - "visiting" 1 0.000000 0.047619 0.991605 + "dealer" 2 0.000000 0.095238 0.995766 + "agree" 3 0.000000 0.142857 0.997169 + N_P_Q_S_s_x_md 8 0.006086 0.006252 0.500083 0.017800 0.520000 0.277190 #### --min-dev=0.100 --token-count=20 #### X-Bogosity: Unsure, tests=bogofilter, spamicity=0.495886 n pgood pbad fw U "there" 14 0.291667 0.000000 0.000660 + "zip" 1 0.020833 0.000000 0.009094 + "all" 21 0.395833 0.095238 0.194216 + "web" 10 0.187500 0.047619 0.203096 + "too" 9 0.166667 0.047619 0.222810 + "been" 8 0.145833 0.047619 0.246762 + "file" 6 0.104167 0.047619 0.314336 + "also" 11 0.187500 0.095238 0.337138 + "about" 16 0.270833 0.142857 0.345518 + "little" 5 0.083333 0.047619 0.364191 + "any" 20 0.312500 0.238095 0.432510 + "would" 15 0.229167 0.190476 0.453979 - "visit" 3 0.041667 0.047619 0.533255 - "does" 9 0.125000 0.142857 0.533307 - "for" 49 0.666667 0.809524 0.548377 - "how" 14 0.187500 0.238095 0.559390 - "name" 8 0.104167 0.142857 0.578184 + "new" 12 0.145833 0.238095 0.620007 + "this" 45 0.541667 0.904762 0.625473 + "home" 9 0.104167 0.190476 0.646215 + "over" 10 0.104167 0.238095 0.695340 + "way" 11 0.104167 0.285714 0.732481 + "visiting" 1 0.000000 0.047619 0.991605 + "dealer" 2 0.000000 0.095238 0.995766 + "agree" 3 0.000000 0.142857 0.997169 + N_P_Q_S_s_x_md 20 0.107193 0.098964 0.495886 0.017800 0.520000 0.067490 #### U 0.493025 --min-dev=0.496 #### U 0.532831 --min-dev=0.496 --token-count-min=4 #### U 0.493025 --min-dev=0.496 --token-count-max=8 #### U 0.496075 --min-dev=0.100 #### U 0.496075 --min-dev=0.100 --token-count-min=4 #### U 0.500083 --min-dev=0.100 --token-count-max=8 #### U 0.495886 --min-dev=0.100 --token-count=20 bogofilter-1.2.4/src/tests/outputs/dump.load-6.out0000644000175000017500000000007512163572274020304 0ustar sezsez????speed~????????? 2 0 20021020 your-info.net 10 0 20021215 bogofilter-1.2.4/src/tests/outputs/message_id.ref0000644000175000017500000001410512163572274020322 0ustar sezsezinputs/good.mbx X-Bogosity: Ham, message_id=<3DC259A6.2020800@riconet.net> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101112024.GA1280@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101113205.163A317E906@oak.example.com> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101113804.GA1499@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<1961754.1036152508913.JavaMail.root@abv-sfo1-ac-agent6> inputs/good.mbx X-Bogosity: Ham, message_id=<200211011226.EAA16707@hpsdlx.shdp.com> inputs/good.mbx X-Bogosity: Ham, message_id=<3293.1036154038@www24.gmx.net> inputs/good.mbx X-Bogosity: Ham, message_id=<3DC276BB.1000000@riconet.net> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<3DC284EA.10402@villanova.edu> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101135119.GA2554@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<200211010910.05041.praedor@yahoo.com> inputs/good.mbx X-Bogosity: Ham, message_id=<1036161672.2448.36.camel@tamriel.terranforge.com> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101145413.GA1244@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<9B5F92C2B565D511937C0008C786B37C01A1A668@mail2.jacksonnational.com> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101151303.24516.qmail@senator-bedfellow.mit.edu> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<20021101153838.4FD9632A23@asgard.iproduction.com> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101160045.GA1698@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<200211011619.IAA05556@ugu.com> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101162159.GA1914@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<200211011118.43401.praedor@yahoo.com> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<200211011715.gA1HFSQ10258@mail.mindspring.com> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<20021101175306.F17A4280E1@example.com> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101180217.GA2454@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<2961F29E9CFED4118E5700B0D068B70B0348E945@exchange1.nku.edu> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101190050.GA2824@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<1036178597.3222.24.camel@chupacabra.monkeynoodle.org> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<20021101202942.GA1293@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<20021101210001.173BC17E906@oak.example.com> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<20021101222642.GB3791@dman.com> inputs/good.mbx X-Bogosity: Ham, message_id=<1320492.1036190947757.JavaMail.root@abv-sfo1-ac-agent7> inputs/good.mbx X-Bogosity: Ham, message_id= inputs/good.mbx X-Bogosity: Ham, message_id=<20021101225546.GA2326@athame.dynagen.on.ca> inputs/good.mbx X-Bogosity: Ham, message_id=<15811.3035.967754.435766@slothrop.zope.com> inputs/good.mbx X-Bogosity: Ham, message_id=<1036198807.13996.4.camel@squash.scalabledynamics.com> inputs/good.mbx X-Bogosity: Ham, message_id=<021101205957.533f@aadl.annarbor.lib.mi.us> inputs/good.mbx X-Bogosity: Ham, message_id=<02110121463800.15605@glen.organic-earth.com> inputs/good.mbx X-Bogosity: Ham, message_id=<3.0.32.20021101215025.00a616c8@pop.east.cox.net> inputs/good.mbx X-Bogosity: Ham, message_id=<3DC35680.6010502@riconet.net> inputs/spam.mbx X-Bogosity: Spam, message_id=MID-16415-1507360 inputs/spam.mbx X-Bogosity: Spam, message_id=<1036142619.28395@eros.rbidaho.net> inputs/spam.mbx X-Bogosity: Spam, message_id=<108284.5689.394515540-1463792382-1036132992@topica.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<22-8586-418714@transport31.azogle.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021101175950.4DB23280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021101181213.9BBBD280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id= inputs/spam.mbx X-Bogosity: Spam, message_id=<22-8587-418714@transport10.azogle.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<200211012044.gA1KiWJ88714@mail7.transcentives.net> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021101222724.91023280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<1036199122.2745@mail141.gooberfoob.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021101235404.C687E280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021102005756.BA372280E2@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021102010258.C79CA280E2@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<22-8588-418714@transport4.azogle.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021102021243.14469.qmail@mtsbp524.opmnet.net> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021102033055.C8327280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021102034934.D0228280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021102040140.5BBC7280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<20021102044614.14B97280E1@example.com> inputs/spam.mbx X-Bogosity: Spam, message_id=<200211011710.gA1HARh07450@mail7.transcentives.net> bogofilter-1.2.4/src/tests/outputs/bogolex.out0000644000175000017500000000013012163572274017705 0ustar sezsezu 0.500039 u 0.500096 u 0.500086 u 0.507130 S 1.74e-02 u 0.638178 S 1.81e-11 S 0.00e+00 bogofilter-1.2.4/src/tests/outputs/split.out0000644000175000017500000000014612163572274017410 0ustar sezsezmsg.split.bg.0117.text 0.491493 msg.split.dr.0118.base64 0.500000 msg.split.gs.0119.text 0.888161 bogofilter-1.2.4/src/tests/outputs/dump.load-4.out0000644000175000017500000000032212163572274020275 0ustar sezsezyork 12 0 20021215 your 152 0 20021004 your-34 34 0 20021004 your-info.net 10 0 20021215 yours-340 340 0 20020820      sardonen 1 0 20021010 ¢º¢¹speed~¢Ü¢Ý¢·¢Â¸ 2 0 20021020 ¢¾¢¾ 2 0 20021210 ¢¾±¤ 2 0 20021210 bogofilter-1.2.4/src/tests/outputs/dump.load-2.out0000644000175000017500000000114512163572274020277 0ustar sezsez--------=_1036160812-16487-96 3 0 20020815 --------=_1036180482-12472-42 3 0 20020815 years 5 0 20020801 yinfobanner.jpg 2 0 20020801 york 12 0 20021215 you 92 0 20020801 you'd 2 0 20020801 you'll 8 0 20020801 you're 3 0 20020801 your 152 0 20021004 your-34 34 0 20021004 your-info.net 10 0 20021215 yours 3 0 20020801 yours-340 340 0 20020820 yourself 12 0 20020801 yx5 1 0 20020801 ziff 1 0 20020801 znex 2 0 20020801 zyban 3 0 20020801 zypb9g 9 0 20020801 zzzzzz 2 0 20020801 –jim 4 0 20020815 –lydia 4 0 20020815      sardonen 1 0 20021010 ¢º¢¹speed~¢Ü¢Ý¢·¢Â¸ 2 0 20021020 ¢¾¢¾ 2 0 20021210 ¢¾±¤ 2 0 20021210 bogofilter-1.2.4/src/tests/outputs/msg.1.v0000644000175000017500000000007112163572274016635 0ustar sezsezX-Bogosity: Unsure, tests=bogofilter, spamicity=0.500000 bogofilter-1.2.4/src/tests/outputs/bulkmode.out0000644000175000017500000000036012163572274020055 0ustar sezsez./inputs/msg.1.txt u 0.500039 ./inputs/msg.2.txt u 0.500096 ./inputs/msg.3.txt u 0.500086 ./inputs/msg.4.txt u 0.507130 ./inputs/msg.5.txt S 1.74e-02 ./inputs/msg.6.txt u 0.638178 ./inputs/msg.7.txt S 1.81e-11 ./inputs/msg.8.txt S 0.00e+00 bogofilter-1.2.4/src/tests/outputs/maildir.out0000644000175000017500000000103412163572274017673 0ustar sezsez spam good .MSG_COUNT 21 48 Lotus 1 1 Magazine 1 2 Min 1 1 Service 3 2 connection 1 1 more 2 13 most 3 6 set 1 1 that 9 32 unsubscribe 13 5 bogofilter-1.2.4/src/tests/outputs/parsing.out0000644000175000017500000000033212163572274017715 0ustar sezsez****** IhT ****** head:From head:bounce to:junk head:Content-Type head:text head:html DONE Done done comment two words www.com wordlist wordlist href url.example.com href file.img picture.gif verdana arial color red bogofilter-1.2.4/src/tests/t.escaped.url0000755000175000017500000000154312163572274016400 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame cat > "$TMPDIR/input" <<_EOF From Subject: test url encoding MIME-Version: 1.0 Content-Type: text/html; charset="iso-8859-1"

_EOF cat > "$TMPDIR/reference" <<_EOF href http 21.232.160.105 silver farm index.html border src http 221.232.160.105 silver farm ent.jpg width height target blank href http 221.232.160.105 done1.html _EOF $BOGOLEXER -p -C < "$TMPDIR/input" | grep -v ":" > "$TMPDIR/output" cmp "$TMPDIR/reference" "$TMPDIR/output" \ || diff "$TMPDIR/reference" "$TMPDIR/output" bogofilter-1.2.4/src/tests/spam_header_name.c0000644000175000017500000000242112163572274017413 0ustar sezsez/* spam_header_name.c -- print the default spam header name of bogofilter */ /* (C) 2002 by Matthias Andree. * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ #include "config.h" #include int main(void) { puts(SPAM_HEADER_NAME); return 0; } bogofilter-1.2.4/src/tests/t._abort0000755000175000017500000000003712163572274015436 0ustar sezsez#! /bin/sh set +e (./abortme) bogofilter-1.2.4/src/tests/t.integrity30000755000175000017500000000107512163572275016275 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # test description here # # test below # remember to use "$srcdir" echo 0a 74 65 73 74 00 74 65 0d 73 74 0d 0a \ | ./dehex > "$TMPDIR"/input ./escnp < "$TMPDIR/input" > "$TMPDIR/reference" shn="`./spam_header_name`:" # check seekable input $VAL $BOGOFILTER -e -p -C < "$TMPDIR"/input | ./escnp > "$TMPDIR/output" grep -v "$shn" "$TMPDIR/output" | cmp - "$TMPDIR/reference" # check non-seekable input cat "$TMPDIR"/input | $VAL $BOGOFILTER -e -p -C | ./escnp > "$TMPDIR/output" grep -v "$shn" "$TMPDIR/output" | cmp - "$TMPDIR/reference" bogofilter-1.2.4/src/tests/inputs/0000755000175000017500000000000012164443244015315 5ustar sezsezbogofilter-1.2.4/src/tests/inputs/msg.regtest.n0000644000175000017500000000067612163572272017752 0ustar sezsezFrom RBB-2294-9441900@cabo.rbmailsource.com Fri Nov 1 06:14:40 2002 Return-Path: Delivered-To: john@example.com Content-Transfer-Encoding: 8bit MIME-Version: 1.0 Date: Fri, 01 Nov 2002 01:23:39 PST From: Unbelievable but true To: John Johnson Subject: Get Paid for Driving Your Car! (msg.regtest.good) This is a single-part plain text message. bogofilter-1.2.4/src/tests/inputs/msg.split.gs.0119.text0000644000175000017500000000077512163572272021160 0ustar sezsezReturn-Path: From: "Yulia" To: "ckmolxldakzvog@usa.net" Subject: To Russia for love MIME-Version: 1.0 Content-Type: text/html Reply with off and I won't write you again. bogofilter-1.2.4/src/tests/inputs/mime-qp-cont-with-cr.txt0000644000175000017500000000202512163572272021741 0ustar sezsezSubject: This is a test message to check bogofilter's qp decoding of continuation lines in the presence of spurious CR characters. MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0007_01C9DC27.B9F73130" This is a multi-part message in MIME format. ------=_NextPart_000_0007_01C9DC27.B9F73130 Content-Type: text/html; charset="iso-8859-2" Content-Transfer-Encoding: quoted-printable
50mg x 10 pills $6.00 per p= ill
 
 ------=_NextPart_000_0007_01C9DC27.B9F73130-- bogofilter-1.2.4/src/tests/inputs/msg.4.txt0000644000175000017500000000163112163572272017012 0ustar sezsezFrom Return-Path: Delivered-To: linda@example.com Received: from om40.yourmailsource.com (unknown [216.177.60.45]) by example.com (Postfix) with ESMTP id E98CA280E2 for ; Sat, 2 Nov 2002 04:29:50 -0500 (EST) Received: by om40.yourmailsource.com (PowerMTA(TM) v1.5); Sat, 2 Nov 2002 04:29:45 -0500 (envelope-from ) From: "Motor Millions" To: LINDA@EXAMPLE.COM Reply-To: mailings@genuinerewards.com Subject: How to Build Immediate Wealth! MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Isn't it about time you stopped working for money and let money work for you? Uncover The Secrets Of... How To Turn Cars Into Cash! http://www.genuinerewards.com/click.asp?lnk=8228&email=LINDA@EXAMPLE.COM&ds=32 bogofilter-1.2.4/src/tests/inputs/msg.8.txt0000644000175000017500000002332312163572272017020 0ustar sezsezFrom Return-Path: Delivered-To: mark@osagesoftware.com Received: from mail7.transcentives.net (mail7.transcentives.net [216.23.198.157]) by osagesoftware.com (Postfix) with ESMTP id 28EED27DA3 for ; Fri, 11 Oct 2002 07:51:00 -0400 (EDT) Received: (from mailer@localhost) by mail7.transcentives.net (8.11.3/8.11.3) id g9BBow469631; Fri, 11 Oct 2002 06:50:58 -0500 (CDT) (envelope-from mailer) Date: Fri, 11 Oct 2002 06:50:58 -0500 (CDT) Message-Id: <200210111150.g9BBow469631@mail7.transcentives.net> To: "mark@osagesoftware.com" From: "flyfree@milespree.com" CONTENT-TYPE: text/html; SUBJECT: Earn up to 5% cash back + 2000 miles
     Hello mark@osagesoftware.com, you have 2000 miles!
We send this mail so you can earn free travel, faster. But if you'd like to unsubscribe, instructions appear at the bottom.

Take home a little extra with the new American Express Cash Rebate Card. Get cash back every time you use the Card, and enjoy even more cash back—up to 5%—on your everyday purchases at supermarkets, gas stations, drugstores, and home improvement stores. There's no other cash rebate card quite like it.
  • Cash back on all your purchases
  • Even more cash back—up to 5%—on your everyday purchases
  • No annual fee
  • 0% APR for your first six months of Cardmembership
  • Low 9.99% intro balance transfer rate
Apply now and get ready to earn cash back every day.

TO UNSUBSCRIBE: click here or forward a copy of this email to remove@milespree.com

Shop & Earn | Special Offers - Mostly Free | Profile | Refer a Friend
FAQ | Your Privacy | Terms & Conditions | Partners

MileSpree Mile Mail brings you offers to help you earn free travel faster. By clicking any links in this e-mail you agree to hold MileSpree, Inc. harmless from any liabilities or damages that could arise from participating in merchant offers.

MileSpree, MileSpree Rewards, "the fastest free travel on the net" and the MileSpree logo are service marks or trade marks of MileSpree, Inc. Copyright 2000-2002. All Rights Reserved.

bogofilter-1.2.4/src/tests/inputs/lexer.mbx0000755000175000017500000000355712163572272017164 0ustar sezsez#! /bin/sh set -e # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, outputs files are left in directory # lexer.mbx.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # lexer.mbx.YYYYMMDD: # tests - directory containing individual output files : ${srcdir=.} relpath="`pwd`/../.." NODB=1 . ${srcdir}/../t.frame OUT="lexer.mbx.out" verbose=0 if [ "$1" = "-v" ]; then verbose=1 v="-v" fi if [ "$1" = "-vv" ]; then verbose=1 v="-v -x l" fi BOGOLEXER="$VAL ${relpath}/bogolexer" for f in good spam ; do $BOGOLEXER -C -D -p $v < ${srcdir}/inputs/$f.mbx > $TMPDIR/$f.1 sort < $TMPDIR/$f.1 | uniq > $TMPDIR/$f.2 if [ $verbose -ne 0 ]; then $BOGOLEXER -C -D -x ml -vvv -p < ${srcdir}/inputs/$f.mbx > $TMPDIR/$f.v fi done RESULT=`cat $TMPDIR/spam.2 | wc -l`.`cat $TMPDIR/good.2 | wc -l` RESULT=`echo $RESULT | sed s@\ @@g` #strict checking WANT="1102.3073" #loose checking WANT="1103.3073" # v0.12.4 - parsing adds '!' and money amounts WANT="1126.3080" # v0.13.0 - new parsing rules - case sensitive, header_line_markup, tokenize_html_tags WANT="1690.3918" # v0.13.5 - new parsing rules - allow terminal exclamation points WANT="1724.3937" # v0.13.6.2 - lexer_v3.l changes to exclude brackets WANT="1723.3931" # v0.13.7.3 - lexer_v3.l changes to allow space in mime boundary WANT="1722.3929" # v0.15 - removed html.c - process_html_comments() WANT="1720.3925" # v0.15.1 - unfolding header lines ... WANT="1720.3927" # v0.15.1 - discarding message separators WANT="1710.3914" # v0.15.1 - discarding additional message ids WANT="1708.3909" if [ "$RESULT" != "$WANT" -o $verbose -ne 0 ] ; then echo want: $WANT, have: $RESULT | tee $TMPDIR/$OUT fi [ ! -z "$BF_SAVEDIR" ] && . ${srcdir}/../t.save test "$RESULT" = "$WANT" bogofilter-1.2.4/src/tests/inputs/lexer.inp0000644000175000017500000000151712163572272017153 0ustar sezsezFrom nobody@nowhere.com Subject: Stephen King's latest thriller! Free Shipping & Handling Red Rabbit By Tom Clancy Tom Clancy's back with the story behind his most popular character - Jack Ryan. Leadership By Rudolph Giuliani The controversial mayor who guided New York City through the biggest crisis in the city's history reflects on his time in office and the lessons he learned there. Subject: Rent all the DVDs you want -- Free Trial! The Standard Program is a month-to-month subscription cancelable at anytime. Click the "Your Account" button for cancellation instructions. No refunds or credits for partial monthly subscription periods. Please visit www.netflix.com for complete terms and conditions, including length of free trial period. Netflix reserves the right to change terms and conditions at any time. (c)2002 JunkFlix, Inc. bogofilter-1.2.4/src/tests/inputs/msg.6.txt0000644000175000017500000000530212163572272017013 0ustar sezsezFrom Return-Path: Delivered-To: eric@osagesoftware.com Received: from mtsopt28.naviantnetwork.net (unknown [66.115.47.135]) by osagesoftware.com (Postfix) with SMTP id 92CC327F7F for ; Sat, 19 Oct 2002 10:19:23 -0400 (EDT) Received: (qmail 24004 invoked by uid 500); 19 Oct 2002 13:56:29 -0000 Date: 19 Oct 2002 13:56:29 -0000 From: "Limited Time Offer" Reply-To: nobody@bounce.247mail.com Subject: Discover(R) Platinum Clear Card: 0% Intro APR! To: ERIC@OSAGESOFTWARE.COM Message-ID: 13909-771306 Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="____MAIL4339732002100021_BOUNDARY____" -____MAIL4339732002100021_BOUNDARY____ Content-Type: text/plain; charset="iso-8859-1" Content-Disposition: inline *************************************************** You've received this message because while visiting a 24/7 Mail Alliance partner Web site, you opted in to receive special online information and discounts. *************************************************** Offer Expires September 30, 2002 Get a 0% Intro APR* on Purchases and Balance Transfers You've been selected for a special No-Annual-Fee Discover(R) Platinum Clear Card with all of these privileges: * 0% Intro APR on Purchases and Balance Transfers* * No Annual Fee * Up to 2% Cashback Bonus(R) award* * Up to $50,000 Credit Limit * New, Clear Design Start Saving Today - APPLY NOW! It's fast, easy and secure. http://apr.freezefinds.com/cgi-bin/linktrack/go.cgi?2467clear To take advantage of this special offer, act by September 30, 2002! * Click below to see information about the APR, fees and other Important Information https://secure.novuslink.net/terms.asp?type=plat To UNSUBSCRIBE from our list, simply click here, http://opt-out.247mail.com/cgi-bin/optout_247?list=CONSUMERDATA&email=ERIC@OSAGESOFTWARE.COM --____MAIL4339732002100021_BOUNDARY____ Content-Type: text/html; charset="iso-8859-1" Content-Disposition: inline Discover® Platinum Clear Card



To UNSUBSCRIBE from our list, simply click here --____MAIL4339732002100021_BOUNDARY____-- bogofilter-1.2.4/src/tests/inputs/lexer.out0000644000175000017500000000125712163572272017175 0ustar sezsezAccount City Clancy Clancy's Click DVDs Free Giuliani Inc Jack JunkFlix Leadership Netflix New Please Program Rabbit Red Rent Rudolph Ryan Standard Subject The Tom Trial! York Your all and any anytime back behind biggest button cancelable cancellation change character city's complete conditions controversial credits crisis for free guided his history including instructions learned length lessons mayor month-to-month monthly most office partial period periods popular reflects refunds reserves right story subj:Free subj:Handling subj:King's subj:Shipping subj:Stephen subj:latest subj:thriller! subscription terms the there through time trial visit want who with www.netflix.com you bogofilter-1.2.4/src/tests/inputs/msg.2.txt0000644000175000017500000002504212163572272017012 0ustar sezsezFrom Return-Path: Delivered-To: linda@example.com Received: from om40.yourmailsource.com (unknown [216.177.60.45]) by example.com (Postfix) with ESMTP id E98CA280E2 for ; Sat, 2 Nov 2002 04:29:50 -0500 (EST) Received: by om40.yourmailsource.com (PowerMTA(TM) v1.5); Sat, 2 Nov 2002 04:29:45 -0500 (envelope-from ) From: "Motor Millions" To: LINDA@EXAMPLE.COM Reply-To: mailings@genuinerewards.com Subject: How to Build Immediate Wealth! MIME-Version: 1.0 Content-Type: multipart/alternative; boundary=06986E0E1E196312E032AFBC Message-Id: <20021102092952.E98CA280E2@example.com> Date: Sat, 2 Nov 2002 04:29:52 -0500 (EST) This is a multi-part message in MIME format. If you are reading this text, you may want to consider changing to a mail reader or gateway that understands how to properly handle MIME multipart messages. Date: Sat, 2 Nov 2002 04:29:45 -0500 --06986E0E1E196312E032AFBC Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Disposition: inline Isn't it about time you stopped working for money and let money work for you? Uncover The Secrets Of... How To Turn Cars Into Cash! http://www.genuinerewards.com/click.asp?lnk=8228&email=LINDA@EXAMPLE.COM&ds=32 Dean Graziosi is one of the GREATEST financial minds of our time. In his revolutionary program he will reveal powerful, yet easy-to-follow steps that will help you build immediate wealth, enjoy life's luxuries, and walk around with a nice wad of cash in your pocket. All without having to invest a lot of time and money. You too, can tap into this amazingly simple, but extremely lucrative, industry today with this limited time offer! Learn more NOW!!! Click here: http://www.genuinerewards.com/click.asp?lnk=8228&email=LINDA@EXAMPLE.COM&ds=32 Take Charge of Your Future Right Now & Save $40 off the TV Price -- Only $19.95! Order today and get $500 worth of coupons and the NADA Book, which is the official used car estimating guide, ABSOLUTELY FREE and yours to keep just for trying!! You are covered by our 100% Unconditional, No-risk, 30-Day Money Back Guarantee! Order Online at http://www.genuinerewards.com/click.asp?lnk=8228&email=LINDA@EXAMPLE.COM&ds=32 or simply call 1-800-906-4455 (c) 2002 MotorMillions.com, LLC. All rights reserved. ______________________________________________________________ If you previously asked to be excluded from GenuineRewards product offerings and solicitations, we apologize for this e-mail. Every effort was made to ensure that you were excluded from this e-mail. However, if GenuineRewards does not have your current e-mail address in their database, they are unable to prevent this e-mail from reaching you. If you do not wish to receive promotional e-mail from GenuineRewards, click here: http://www.genuinerewards.com/unsubscribe.asp?emid=6082&ds=32&email=LINDA@EXAMPLE.COM If you believe that you may have received this offer in error, please contact Customer Service at abuse@genuinerewards.com <645178564> ______________________________________________________________ Find a friend's email address at http://email-lookup.com, find a new doctor at http://mdlookup.com or dentist at http://dentistlookup.com Powered by Email-Lookup.com, MDLookup.com and DentistLookup.com ______________________________________________________________ --06986E0E1E196312E032AFBC Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Disposition: inline Motor Millions


Isn't it about time you stopped working for money and let money work for you?
Order today and get your very own money making web site worth over $495 absolutely FREE plus the NADA Book, which is the official used car estimating guide, also FREE and yours to keep just for trying!!
Uncover The Secrets Of...
How To Turn Cars Into Cash!
I went from $40,000 in debt, to being worth over 1.3 million dollars with the easy-to-follow steps I have laid out.

I want everyone to feel the sense of accomplishment and freedom that I do.

Dean Graziosi - Motor Millions Kit


Dean Graziosi is one of the GREATEST financial minds of our time. In his revolutionary program he will reveal powerful, yet easy-to-follow steps that will help you build immediate wealth, enjoy life's luxuries, and walk around with a nice wad of cash in your pocket. All without having to invest a lot of time and money. You too, can tap into this amazingly simple but extremely lucrative industry today with this limited time offer! Learn more NOW!!!

Take Charge of Your Future Right Now & Save $40 off the TV Price--Only $19.95
Click Here to Order

You are covered by our 100% Unconditional, No-risk, 30-Day Money Back Guarantee!

Order Online
or simply call 1-800-906-4455



(c) 2002 MotorMillions.com, LLC. All rights reserved.




If the above links do not work or appear, simply copy this URL and paste it into your browser's address field:
http://www.genuinerewards.com/click.asp?lnk=8228&email=LINDA@EXAMPLE.COM&ds=32


If you previously asked to be excluded from GenuineRewards product offerings and solicitations, we apologize for this e-mail. Every effort was made to ensure that you were excluded from this e-mail. However, if GenuineRewards does not have your current e-mail address in their database, they are unable to prevent this e-mail from reaching you. If you do not wish to receive promotional e-mail from GenuineRewards, click here or link to:
http://www.genuinerewards.com/unsubscribe.asp?emid=6082&ds=32&email=LINDA@EXAMPLE.COM

If you believe that you may have received this offer in error, please contact Customer Service at abuse@genuinerewards.com


Find a friend's email address, find a new doctor or dentist.
Powered by Email-Lookup.com, MDLookup.com, and and DentistLookup.com.
--06986E0E1E196312E032AFBC-- /* bogofilter-1.2.4/src/tests/inputs/msg.split.bg.0117.text0000644000175000017500000000544512163572272021134 0ustar sezsezFrom Bethannhrgk@hotmail.ru Tue Jan 14 21:47:26 2003 Return-Path: Received: from www.siliconave.com (siliconave.exo.com [209.25.7.5] (may be forged)) by mail.pennysaverusa.net (8.12.3/8.12.3) with ESMTP id h0F5lO2t002192 for ; Tue, 14 Jan 2003 21:47:25 -0800 Received: from fw.siliconave.com ([192.168.11.254]) by www.siliconave.com (8.11.6/8.11.2) with SMTP id h0F5lKG20419 for ; Tue, 14 Jan 2003 21:47:21 -0800 Received: (qmail 4146 invoked from network); 14 Jan 2003 21:45:02 -0000 Received: from unknown (HELO jxldqvu) (141.157.242.182) by siliconave.exo.com with SMTP; 14 Jan 2003 21:45:02 -0000 From: Rebbeca Marcellus To: Subject: Give the gift of health. Date: Wed, 09 Jan 2002 16:20:17 -0800 Mime-Version: 1.0 Content-Type: text/html Message-Id: X-Virus-Scanned: by AMaViS perl-11 Hello, bozo@siliconave.com

"Calcium is a Dieters Best Friend"
-Science News Online

"Calcium - The Superstar of Nutrients"
- Journal of AMA

"Calcium Leads To Weight Loss"
- Journal of the American College of Nutrition

Prevent Premature Aging and Disease
Build Leaner Muscle Mass
Reduce Body Fat and Stress
Increase Energy Levels and Sexual Stamina

CoraCal is made with 100% pure Okinawa Marine Coral Calcium
that has the highest rate of absorption into the bloodstream.

Please visit our website to see what the New England Journal of Medicine,
Science News and US News Report have to say about this health improving discovery.
Check out our 100% money back guarantee and free 1 month supply offer
click here

bogofilter-1.2.4/src/tests/inputs/dump.load.inp0000644000175000017500000000076112163572272017717 0ustar sezsez–jim 4 0 –lydia 4 0      sardonen 1 0 20021010 years 5 0 20020801 yinfobanner.jpg 2 0 20020801 york 1 0 20020801 you 92 0 20020801 you'd 2 0 20020801 you'll 8 0 20020801 you're 3 0 20020801 your 76 0 20020801 your-info.net 5 0 20020801 yours 3 0 20020801 yourself 12 0 20020801 yx5 1 0 20020801 ziff 1 0 20020801 znex 2 0 20020801 zyban 3 0 20020801 zypb9g 9 0 20020801 zzzzzz 2 0 20020801 --------=_1036160812-16487-96 3 0 --------=_1036180482-12472-42 3 0 ------------=_1036200996-24054-149 3 0 bogofilter-1.2.4/src/tests/inputs/msg.parsing.txt0000644000175000017500000000040612163572272020311 0ustar sezsezFrom bounce To: junk Content-Type: text/html DONE Done done comment two
words wordlist wordlist bogofilter-1.2.4/src/tests/inputs/msg.regtest.s0000644000175000017500000000073712163572272017755 0ustar sezsezFrom opt-in@mtsbp608.edirectbroadcast.com Fri Nov 1 04:50:54 2002 Return-Path: Delivered-To: john@example.com Received: from mtsbp608.edirectbroadcast.com (mtsbp608.edirectbroadcast.com [64.253.199.168]) by example.com (Postfix) with SMTP id CC48C280E1 for ; Fri, 1 Nov 2002 04:50:53 -0500 (EST) Subject: HTML Test Message (msg.regtest.spam) Content-Type: text/html; charset="us-ascii" This is html. bogofilter-1.2.4/src/tests/inputs/msg.7.txt0000644000175000017500000000523612163572272017022 0ustar sezsezFrom Return-Path: <22-7635-418714@bounce.azogle.com> Delivered-To: linda@osagesoftware.com Received: from transport19.azogle.com (transport19.azogle.com [66.46.150.23]) by osagesoftware.com (Postfix) with SMTP id 550EE27EB7 for ; Wed, 16 Oct 2002 12:41:08 -0400 (EDT) Received: from azoogle by transport19.azogle.com with local (Azoogle 2.1) id 22-7635-418714 for linda@osagesoftware.com; Wed, 16 Oct 2002 16:35:33 GMT Content-Type: multipart/alternative; boundary="----------=_1034786133-28506-109" Content-Transfer-Encoding: 7bit MIME-Version: 1.0 From: "Car Loan" Reply-To: "Car Loan" To: linda@osagesoftware.com Date: Wed, 16 Oct 2002 16:35:33 GMT Subject: Any Credit Auto Loans - Free App, No commitment Message-Id: <22-7635-418714@transport19.azogle.com> X-Info: please report abuse of this service to abuse@azogle.com This is a multi-part message in MIME format... ------------=_1034786133-28506-109 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 877

Buying a car doesn't have to be this difficult - Fast & Easy 2 minute Loan Application

 

 

 

 ------------=_1034786133-28506-109 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 599 You are getting this message as a subscriber to Sarckos Special Deals. To cancel, see the instructions at the end of this mail. --------------------------------------------------------------- Auto credit and car loans are just a FREE APPLICATION away! Even if you have bad credit, our auto loan specialists can help you obtain the auto credit you deserve! http://www.sarcko.com/icl.htm ------------------ You are receiving this email because you have opted-in to receive email from publisher: sarckos. To unsubscribe, click below: http://u.azogle.com/?z=22-418714-ZYPb9G ------------=_1034786133-28506-109-- bogofilter-1.2.4/src/tests/inputs/msg.1.txt0000644000175000017500000000602612163572272017012 0ustar sezsezFrom Return-Path: Delivered-To: relson@example.com Received: from 79.37.21.02 (node-c-0913.a2000.nl [62.194.9.19]) by example.com (Postfix) with SMTP id 033F227EB8 for ; Sat, 2 Nov 2002 18:37:11 -0500 (EST) From: MRS FELICIA KABILA To: relson@example.com Reply-To: felicia_kabila@spinfinder.com Subject: URGENT ASSISTANCE Date: Sat, 02 Nov 2002 23:37:22 +0000 MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="bb507e07-56a4-4d74-bc06-dd1d591be102" Message-Id: <20021102233712.033F227EB8@example.com> This is a multi-part message in MIME format --bb507e07-56a4-4d74-bc06-dd1d591be102 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable STRICTLY CONFIDENTIAL FROM: MRS. FELICIA KABILA E-MAIL: felicia_kabila@spinfinder.com ATTN: AN APPEAL FOR YOUR PERSONAL ASSISTANCE TO INVEST IN YOUR COUNTRY I AM FORTY-NINE YEARS OLD WIDOW (THE THIRD WIFE) OF THE LATE PRESIDENT LAURENT KABILA OF THE DEMOCRATIC REPUBLIC OF CONGO. MY HUSBAND WAS ASSASINATED BY ONE OF HIS BODYGUARD ON THE 16th OF JANUARY 2001. AT THE MID OF THE REBELLION WHICH IS STILL ON IN MY COUNTRY,MY DAUGHTER AND I WENT OUT OF CONGO ACCORDING TO MY HUSBAND INSTRUCTION BEFORE HIS DEATH BECAUSE THE FAITH OF OUR COUNTRY WAS YET TO BE DECIDED. WE CAME TO AMSTERDAM WITH THREE SEALED BAGGAGE CONTAINING THE SUM OF TWENTY-TWO MILLION UNITED STATES DOLLARS (US$22,000,000.00). ON ARRIVAL IN AMSTERDAM THE NETHERLANDS, WE SOUGHT FOR POLITICAL ASYLUM. WE WERE NOT ALLOWED TO OPERATE A BANK ACCOUNT AND DECIDED TO DEPOSIT THE SEALED BAGGAGES CONTAINING THE FUNDS WITH A PRIVATE SECURITY COMPANY.(GTC DIPLOMATIC SERVICES) FOR SECURITY REASONS, I DECLARED THE CONTENT AS PHOTOGRAHPIC MATERIALS of high security value BELONGING TO MY FOREIGN AFFILIATED BUSINESS PARTNER. SINCE THEN WE HAVE BEEN LOOKING FOR A RELIABLE AND TRUSTWORTHY PERSON TO HELP ME FOR SAFE KEEPING OF THE MONEY PRIOR TO INVESTING IN ANY CONDUCIVE = COUNTRY IN OVERSEA. I GOT IN CONTACT WITH SOMEBODY IN AUSTRALIA,HE BECAME GREEDY CONSIDERING HIS SHARE IN THE TRANSACTION, HE ASKED FOR 40%. LUCKILY, I RAN INTO YOUR PERSONAL INFORMATION AND DETAILS, AND DECIDE TO CONTACT YOU AND SEE IF YOU COULD BE OF ANY HELP TO ME AND THE TERMS OF THE TRANSACTION IS AS FOLLOWS: 1) 25% OF THE TOTAL SUM TO YOU FOR YOUR ASSISTANCE IN PROVIDING ACCOUNT AND SAFE KEEPING OF THE FUNDS. 2) 5% OF THE TOTAL SUM WILL BE SET ASIDE FOR ANY EXPENSES THAT MAY BE INCURRED IN THE PROCESS OF THIS TRANSACTION. 3) 70% OF THE TOTAL SUM WILL BE FOR ME AND MY FAMILY INVESTMENT IN YOUR COUNTRY OF WHICH YOU WILL BE A GUIDE TO US. PLEASE SHOULD THIS MEET YOUR ULTMOST CONSIDERATION,CONTACT ME VIA THIS = E_MAIL felicia_kabila@spinfinder.com PLEASE FEEL FREE TO ASK ( ANY QUESTIONS YOU MAY CONSIDER NECESSARY, AND AFTER YOUR FIRST RESPONSE, I WILL THEN LINK YOU UP = WITH MY DAUGHTER SHE IS FRONTING FOR ME AS I LOOK FOWARD TO HEAR FROM YOU. YOURS TRULY, MRS.FELICIA KABILA. --bb507e07-56a4-4d74-bc06-dd1d591be102-- bogofilter-1.2.4/src/tests/inputs/dump.load.upd0000644000175000017500000000024312163572272017714 0ustar sezsezyork 11 0 your 76 0 20021004 your-info.net 5 0 your-34 34 0 20021004 yours-340 340 0 20020820 ¢º¢¹speed~¢Ü¢Ý¢·¢Â¸ 2 0 20021020 ¢¾¢¾ 2 0 20021210 ¢¾±¤ 2 0 20021210 bogofilter-1.2.4/src/tests/inputs/spam.mbx0000644000175000017500000050171112163572272016775 0ustar sezsezFrom opt-in@mtsbp608.edirectbroadcast.com Fri Nov 1 04:50:54 2002 Return-Path: Delivered-To: john@example.com Received: from mtsbp608.edirectbroadcast.com (mtsbp608.edirectbroadcast.com [64.253.199.168]) by example.com (Postfix) with SMTP id CC48C280E1 for ; Fri, 1 Nov 2002 04:50:53 -0500 (EST) Received: (qmail 25750 invoked by uid 500); 1 Nov 2002 09:42:27 -0000 Date: 1 Nov 2002 09:42:27 -0000 From: KaplanCollege@mtsbp608.edirectbroadcast.com To: JOHN@EXAMPLE.COM Message-ID: MID-16415-1507360 Subject: Earn Your College Degree Online Mime-Version: 1.0 Content-Type: text/html; charset="us-ascii" Welcome to Adobe GoLive 5

To UNSUBSCRIBE from our list, simply click here.
From RBB-2294-9441900@cabo.rbmailsource.com Fri Nov 1 06:14:40 2002 Return-Path: Delivered-To: john@example.com Received: from buddha.rbidaho.net (buddha.rbidaho.net [209.132.232.123]) by example.com (Postfix) with ESMTP id 8720427F82 for ; Fri, 1 Nov 2002 06:14:39 -0500 (EST) Received: from eros.rbidaho.net (209.132.232.121) by buddha.rbidaho.net (PowerMTA(TM) v1.5); Fri, 1 Nov 2002 02:53:05 -0800 (envelope-from ) Message-ID: <1036142619.28395@eros.rbidaho.net> Content-Transfer-Encoding: 8bit Content-Type: multipart/alternative; boundary="_----------=_103614261928395" MIME-Version: 1.0 Date: Fri, 01 Nov 2002 01:23:39 PST From: Unbelievable but true To: John Johnson Subject: Get Paid for Driving Your Car! Precedence: bulk This is a multi-part message in MIME format. --_----------=_103614261928395 Content-Length: 1068 Content-Transfer-Encoding: 8bit Content-Type: text/plain =============================================== ** WE'RE GIVING AWAY FREE CARS! GET YOURS! ** =============================================== ====> CLICK HERE TO GET YOUR CAR! http://www.rbtexas.net/T/r.cfm?U=9441900&L=9111 AOL Users Click Here Unbelievable But True! You don't want to miss out! Click Here Now for Info http://www.rbtexas.net/T/r.cfm?U=9441900&L=9111 AOL Users Click Here ================================================= The following message was sent to you as an opt-in subscriber to RB Express. We will continue to bring you valuable offers on the products and services that interest you most. If you wish to unsubscribe please email unsub-dq@cancun.rbexpress.org with your email address in the subject line. You are subscribed as: john@example.com. To unsubscribe by postal mail, please send your request to: 1158 26th St. Suite 597 Santa Monica, CA 90403 --_----------=_103614261928395 Content-Length: 1520 Content-Transfer-Encoding: 8bit Content-Type: text/html Totally Free Cars
Get a FREE CAR or SUV!
CLICK HERE!

There are hundreds of companies
giving away FREE CARS!



Chevy Blazer
Dodge Durango
Ford Windstar
Honda Civic And More...!
CLICK HERE!




The following message was sent to you as an opt-in subscriber to RB Express. We will continue to bring you valuable offers on the products and services that interest you most. If you wish to unsubscribe please email unsub-dq@cancun.rbexpress.org with your email address in the subject line.

You are subscribed as: john@example.com

To unsubscribe by postal mail, please send your request to:
1158 26th St.
Suite 597
Santa Monica, CA 90403
--_----------=_103614261928395-- From perf-errors.5689.108284.9563362.501.0.4@boing.topica.com Fri Nov 1 07:45:44 2002 Return-Path: Delivered-To: leslie@example.com Received: from out002.tfmb.net (out002.tfmb.net [66.180.247.22]) by example.com (Postfix) with SMTP id F213D27F82 for ; Fri, 1 Nov 2002 07:45:43 -0500 (EST) To: leslie@example.com From: CarMatcher Subject: New & Used Cars - Get Quotes at CarMatcher.com Date: Thu, 31 Oct 2002 22:43:12 -0800 Message-ID: <108284.5689.394515540-1463792382-1036132992@topica.com> Errors-To: Reply-To: perf-remove.5689.108284.9563362.0.0.4@boing.topica.com X-Topica-Id: <1036130418.svc001.19170.1000584> Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="TEP-1540633999.1463793406.1036130407" --TEP-1540633999.1463793406.1036130407 Content-Type: text/plain Best Dealers with the Best Prices... that's what you'll get when you submit your purchase request to our Preferred Dealers. Click Here http://click.theoffers.email-publisher.com/maaaCkGaaUdJHaaOh1We/ Serious car buyers know that a FREE online dealer quote is the BEST way to save money!! New Dealer incentives and Manufacturer Rebates will help get you into that new car, truck or SUV. See how much you can SAVE with a FREE dealer quote! Click Here http://click.theoffers.email-publisher.com/maaaCkGaaUdJHaaOh1We/ This is the only way for serious shoppers to buy their next car! You received this message because you have agreed to accept offers from TheOffers.com or one of our carefully selected marketing partners. If you believe that message was sent in error, or if you would no longer like to receive email from TheOffers.com, please click the link provided below. To unsubscribe from these mailings, please click here: http://theoffers.tfmb.net/?aaabDV.aaOh1W.aaaCkG.aaaaae.aaaaaa.${recipient} --TEP-1540633999.1463793406.1036130407 Content-Type: text/html CarMatcher.com
Click here to unsubscribe from these mailings.




You received this message because you have agreed to accept offers from TheOffers.com
or one of our carefully selected marketing partners. If you believe that message
was sent in error, or if you would no longer like to receive email from TheOffers.com,
please click the link provided below.

--TEP-1540633999.1463793406.1036130407-- From 22-8586-418714@bounce.azogle.com Fri Nov 1 09:36:20 2002 Return-Path: <22-8586-418714@bounce.azogle.com> Delivered-To: leslie@example.com Received: from transport31.azogle.com (unknown [66.46.150.35]) by example.com (Postfix) with SMTP id 2901C280E1 for ; Fri, 1 Nov 2002 09:36:20 -0500 (EST) Received: from azoogle by transport31.azogle.com with local (Azoogle 2.1) id 22-8586-418714 for leslie@example.com; Fri, 01 Nov 2002 14:26:52 GMT Content-Type: multipart/alternative; boundary="----------=_1036160812-16487-96" Content-Transfer-Encoding: 7bit MIME-Version: 1.0 From: "Great Books" Reply-To: "Great Books" To: leslie@example.com Date: Fri, 01 Nov 2002 14:26:52 GMT Subject: Get Harry Potter for less than $1 Message-Id: <22-8586-418714@transport31.azogle.com> X-Info: please report abuse of this service to abuse@azogle.com This is a multi-part message in MIME format... ------------=_1036160812-16487-96 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 1063

Get Harry Potter and the Chamber of Secrets and 4 additional books for just $2 total! Imagine... 5 books from the Children's Book of the Month Club for just $2! There is no better way to get your children excited about reading - plus with your membership, you'll get an additional free gift. Click to get started!

 

 

 

 

------------------
You are receiving this email because you have opted-in to receive
email from publisher: sarckos.  To unsubscribe, click below:

http://u.azogle.com/?z=22-418714-ZYPb9G
------------=_1036160812-16487-96 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 794 You are getting this message as a subscriber to Sarckos Special Deals. To cancel, see the instructions at the end of this mail. --------------------------------------------------------------- Get Harry Potter and the Chamber of Secrets and 4 additional books for just $2 total! http://www.sarcko.com/cbom.htm Imagine... 5 books from the Children's Book of the Month Club for just $2! There is no better way to get your children excited about reading - plus with your membership, you'll get an additional free gift. Click to get started! http://www.sarcko.com/cbom.htm ------------------ You are receiving this email because you have opted-in to receive email from publisher: sarckos. To unsubscribe, click below: http://u.azogle.com/?z=22-418714-ZYPb9G ------------=_1036160812-16487-96-- From bounce-30673179-3343@mail148.dealdelivery.com Fri Nov 1 12:59:51 2002 Return-Path: Delivered-To: leslie@example.com Received: from mail148.dealdelivery.com (mail148.dealdelivery.com [66.216.107.148]) by example.com (Postfix) with SMTP id 4DB23280E1 for ; Fri, 1 Nov 2002 12:59:50 -0500 (EST) Content-Transfer-Encoding: 7bit Content-Type: multipart/alternative; boundary="_----------=_8177609094814736022586" MIME-Version: 1.0 X-Mailer: MIME::Lite 2.117 (F2.6; T0.16; A1.43; B2.12; Q2.03) Date: Fri, 1 Nov 2002 09:02:04 UT Subject: Access Your PC from Anywhere - Download Now X-Id: H4F%N9&]M258]Z:*I5''QR['4^!06@/JM8HJ09"G$*>T%*ED<\XETU@`` X-List-Unsubscribe: From: "Champion Offers" Reply-To: "Champion Offers" To: "Friend" Message-Id: <20021101175950.4DB23280E1@example.com> This is a multi-part message in MIME format. --_----------=_8177609094814736022586 Content-Disposition: inline Content-Transfer-Encoding: 7bit Content-Type: text/plain Access Your PC from Anywhere - Free Download *** Please forward this info to friends who need to access their computer away from the office. *** GoToMyPC Introducing a new technology for PC users that PC Magazine calls "revolutionary" and The New York Times calls "ingenious." GoToMyPC allows you to securely access and use your office computer from any Web browser anytime, anywhere. Free Download - Click Here: http://click.championoffers.com/sp/t.pl?id=35106:30673179 * WORK AT HOME: Work on your office computer from home, easily and securely, with just an Internet connection. * TRAVELERS: Access and use your computer and files from hotels, airports, Internet cafes - anywhere with Web access. * AFTER-HOURS ACCESS: Access and use your office desktop, email and other corporate resources after hours from any location connected to the Internet. * DEMONSTRATIONS: Invite your prospective buyers to remotely view your computer screen for on-the-fly demos. More than 70% of GoToMyPC users have their account fees reimbursed by their companies! Take advantage of this Free Trial offer for by clicking the following link: Download Now - Setup takes only 2 minutes. http://click.championoffers.com/sp/t.pl?id=35107:30673179 _________________________________________________ Remove yourself from this recurring list by sending a blank email to mailto:unsub-30673179-3343@championoffers.com OR Sending a postal mail to CustomerService, Box 202885, Austin, TX 78720 This message was sent to address leslie@example.com --_----------=_8177609094814736022586 Content-Disposition: inline Content-Transfer-Encoding: quoted-printable Content-Type: text/html =0D =0D =0D =0D =0D =0D =0D = =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
=0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
Use Your Applications.=
=0D Access Your Network.
=0D Check Email.
=0D Transfer Files.
=0D From Anywhere.
=0D
=0D GoToMyPC is the secure instant re= mote-access solution for you or your company.		<= /td>=0D
=0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
•TELEWORK= : Access your office PC from home, easily and securely, with just an In= ternet connection.
•TRAVEL:<= /b> Access and use your computer from hotels, airports, satellite offices, = Internet cafes – anywhere with Web access.
•LAST-MIN= UTE ACCESS: Get that file or email you left at the office from anywhere= , anytime. Try it now!

=0D =0D First Name:
=0D
=0D
=0D Last Name:
=0D
=0D
=0D Email:
=0D
=0D
=0D Password:
=0D
=0D (Min. 8 letters & numbers.)
=0D
=0D Re-type Password:
=0D
=0D
=0D Send me occasional
=0D product updates.
=0D
=0D

=0D
=0D Setup takes
=0D only 2 minutes.
=0D
=0D By clicking Download,
=0D you agree to the
=0D Terms of Service.

=0D PC Magazine= Logo is a trademark of Ziff Davis Publishing Holdings Inc. Used under lice= nse.
=0D =0D =09


=0D =0D =0D
=0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
Rem= ove yourself from this recurring list by:
Clicking here to send a bl= ank email to unsub-30673179-3343@championoffers.com
OR
Sending a pos= tal mail to CustomerService, Box 202885, Austin, TX 78720

This message was sent to address leslie@example.com
--_----------=_8177609094814736022586-- From n.2037.11411688@q.suitemail.theoffers.com Fri Nov 1 13:12:14 2002 Return-Path: Delivered-To: mark@example.com Received: from suitemail.theoffers.com (unknown [216.52.222.173]) by example.com (Postfix) with SMTP id 9BBBD280E1 for ; Fri, 1 Nov 2002 13:12:13 -0500 (EST) Date: Fri, Nov 01 02 01:50:58 From: "Virtual Offers" To: mark@example.com Subject: Printer Cartridges - Save up to 80% - Free Shipping offer MIME-Version: 1.0 X-Mailer: IES v1.1002.11411688 Reply-To: r.2037.11411688@q.suitemail.theoffers.com Content-Type: multipart/alternative; boundary="=_ad9c6b375a2ede05ccdab026882d2a09" Message-Id: <20021101181213.9BBBD280E1@example.com> This is a MIME encoded message. --=_ad9c6b375a2ede05ccdab026882d2a09 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit FREE Shipping on orders of $40 or more!!! PrintPal's normal prices save you up to 80% on inkjet cartridges and laser printer toners. Now get FREE Shipping. Click the link below to start saving! Why PrintPal.com? 1. Save up to 80% off store prices. 2. We offer a 100% guarantee on everything we sell. 3. Free shipping on orders over $40. 4. We're nice, friendly people. Ready to save? Click here: http://suitemail.theoffers.com/onlinedbm/l.php?582&11411688 AOL Users Click Here -------------------------------------------- I hope you enjoyed receiving this message, but if you no longer wish to receive them, use this http://suitemail.theoffers.com/onlinedbm/un.php?2037&mark@example.com. --=_ad9c6b375a2ede05ccdab026882d2a09 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable

Click=20 for Fantastic Savings on Laser & Inkjet Cartridges!  = Save up to 80%




Click=20 for Fantastic Savings on Laser & Inkjet Cartridges!  = Save up to 80%



I hope you enjoyed receiving= this message, but if you no longer wish to receive them, use this press= here.

--=_ad9c6b375a2ede05ccdab026882d2a09-- From MaxMail@mail.gravitydirect.net Fri Nov 1 14:49:21 2002 Return-Path: Delivered-To: leslie@example.com Received: from out4smtp5.ddc.dartmail.net (out4smtp5.ddc.dartmail.net [216.73.90.45]) by example.com (Postfix) with ESMTP id A264927F7F for ; Fri, 1 Nov 2002 14:49:20 -0500 (EST) Received: from CORE2PUMPER2 (unknown [10.21.6.200]) by out4smtp5.ddc.dartmail.net (Postfix) with SMTP id 810CD5C2FA6 for ; Fri, 1 Nov 2002 14:49:18 -0500 (EST) Message-Id: From: MaxMail To: leslie@example.com Subject: Make Your Head Spin! MIME-Version: 1.0 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: 7bit Date: Fri, 1 Nov 2002 14:49:18 -0500 (EST) # int cnt prob spamicity histogram # 0.00 2 0.005394 0.000790 ## # 0.10 5 0.165063 0.040376 ##### # 0.20 10 0.235191 0.096258 ########## # 0.30 22 0.350559 0.200901 ###################### # 0.40 16 0.444396 0.264441 ################ # 0.50 14 0.547802 0.322955 ############## # 0.60 11 0.637835 0.369865 ########### # 0.70 9 0.746156 0.413214 ######### # 0.80 17 0.858489 0.496178 ################# # 0.90 39 0.973338 0.649188 ####################################### Xerox Phaser 8200 Color Laser Printer Overview

Turn away from black and white.
An office color printer so fast and affordable
it makes your head spin!


Introducing the new Phaser 8200...
  • 16 ppm full color with crisp black text
  • Faster than 90% of today's office printers
  • Starting at only $1,499 USD
  • Industry-leading first-page-out speed of
    only 9 seconds!


    • Enter here for a chance to WIN!

    50" HDTV
    Flat Plasma Screen
    ($15,999 USD value)
    or    		 Xerox Phaser 8200
    Color Printer
    ($1,499 USD value)


    You signed up to receive this mailing at MaxExpress. This email was sent to:
    leslie@example.com
    To unsubscribe, click on the following link or copy and paste the URL into your browser:
    http://www.gravitydirect.net/unsubscribe.asp
    From 22-8587-418714@bounce.azogle.com Fri Nov 1 14:59:29 2002 Return-Path: <22-8587-418714@bounce.azogle.com> Delivered-To: leslie@example.com Received: from transport10.azogle.com (transport10.azogle.com [66.46.150.14]) by example.com (Postfix) with SMTP id 47FAA280E1 for ; Fri, 1 Nov 2002 14:59:28 -0500 (EST) Received: from azoogle by transport10.azogle.com with local (Azoogle 2.1) id 22-8587-418714 for leslie@example.com; Fri, 01 Nov 2002 19:54:42 GMT Content-Type: multipart/alternative; boundary="----------=_1036180482-12472-42" Content-Transfer-Encoding: 7bit MIME-Version: 1.0 From: "Free Music" Reply-To: "Free Music" To: leslie@example.com Date: Fri, 01 Nov 2002 19:54:42 GMT Subject: Get 12 CDs for the price of 1 Message-Id: <22-8587-418714@transport10.azogle.com> X-Info: please report abuse of this service to abuse@azogle.com # int cnt prob spamicity histogram # 0.00 1 0.010735 0.002430 # # 0.10 3 0.170726 0.057486 ### # 0.20 5 0.251893 0.115239 ##### # 0.30 11 0.356029 0.213568 ########### # 0.40 14 0.446721 0.302266 ############## # 0.50 15 0.545918 0.381810 ############### # 0.60 9 0.643984 0.427687 ######### # 0.70 6 0.751203 0.463032 ###### # 0.80 9 0.837626 0.516990 ######### # 0.90 24 0.981476 0.678583 ######################## This is a multi-part message in MIME format... ------------=_1036180482-12472-42 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 858

      
    ------------------
You are receiving this email because you have opted-in to receive
email from publisher: sarckos.  To unsubscribe, click below:

http://u.azogle.com/?z=22-418714-ZYPb9G
    ------------=_1036180482-12472-42 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 625 You are getting this message as a subscriber to Sarckos Special Deals. To cancel, see the instructions at the end of this mail. --------------------------------------------------------------- Get 12 CDs for the price of 1, nothing more to buy, ever! Simply join BMG Music Service and you can choose your FREE CDs from over 12,000 titles. It's 100% RISK FREE! http://www.metareward.com/s?si=364&ci=364&og=283 ------------------ You are receiving this email because you have opted-in to receive email from publisher: sarckos. To unsubscribe, click below: http://u.azogle.com/?z=22-418714-ZYPb9G ------------=_1036180482-12472-42-- From mailer@mail7.transcentives.net Fri Nov 1 15:44:35 2002 Return-Path: Delivered-To: leslie@example.com Received: from mail7.transcentives.net (mail7.transcentives.net [216.23.198.157]) by example.com (Postfix) with ESMTP id 9D425280E1 for ; Fri, 1 Nov 2002 15:44:34 -0500 (EST) Received: (from mailer@localhost) by mail7.transcentives.net (8.11.3/8.11.3) id gA1KiWJ88714; Fri, 1 Nov 2002 14:44:32 -0600 (CST) (envelope-from mailer) Date: Fri, 1 Nov 2002 14:44:32 -0600 (CST) Message-Id: <200211012044.gA1KiWJ88714@mail7.transcentives.net> To: "leslie@example.com" From: "flyfree@milespree.com" CONTENT-TYPE: text/html; SUBJECT: Save up to 63% on HP Optical USB Mouse (+150 miles) # int cnt prob spamicity histogram # 0.00 14 0.028546 0.005410 ############ # 0.10 19 0.166220 0.037465 ################# # 0.20 28 0.241749 0.085769 ######################## # 0.30 29 0.354015 0.145625 ######################### # 0.40 26 0.446591 0.201838 ####################### # 0.50 24 0.549802 0.257740 ##################### # 0.60 20 0.652403 0.307370 ################# # 0.70 8 0.760174 0.330524 ####### # 0.80 26 0.852957 0.408692 ####################### # 0.90 59 0.980920 0.590795 ##################################################
         Hello leslie@example.com, you have 2000 miles!
    We send this mail so you can earn free travel, faster. But if you'd like to unsubscribe, instructions appear at the bottom.



    Compare and Save
    .
    Price
    S&H
    Total
    You Save
    HP.com
    $24.99
    $4.99
    $29.98
    43%
    Office Depot
    $24.99
    $5.95
    $30.94
    45%
    Walmart
    $29.83
    $4.99
    $34.82
    51%
    CDW
    $32.76
    $7.54
    $40.30
    58%
    * Comparisons are based on the same or comparable models from leading merchants.

    Fed up with those annoying skips and jumps when you use your mouse?

    Thanks to HP™, you'll NEVER have to deal with those frustrating delays and slips of your cursor on the screen ever again!

    Even better - NEVER clean your mouse ball again - and you can also forget about your mousepad! This marvel of technology uses optical light sensors to record motion instead of the outdated mouseball.

    Why buy an ordinary ball mouse when you can get the latest USB-compatible Optical Mouse from the industry leader - HP™ - for a fraction of the retail price?

    This is the last mouse you'll ever need! Get one for yourself and a few for your office or home.

    You simply can't buy a better mouse
    and you can't get it for less anywhere else!
    Order today - while they last. You pay only:
    $16.99
    FREE SHIPPING

    TO UNSUBSCRIBE: click here or forward a copy of this email to remove@milespree.com

    Shop & Earn | Special Offers - Mostly Free | Profile | Refer a Friend
    FAQ | Your Privacy | Terms & Conditions | Partners

    MileSpree Mile Mail brings you offers to help you earn free travel faster. By clicking any links in this e-mail you agree to hold MileSpree, Inc. harmless from any liabilities or damages that could arise from participating in merchant offers.

    MileSpree, MileSpree Rewards, "the fastest free travel on the net" and the MileSpree logo are service marks or trade marks of MileSpree, Inc. Copyright 2000-2002. All Rights Reserved.

    From bounce-30673179-3359@mail127.greatfamilyoffers.com Fri Nov 1 17:27:25 2002 Return-Path: Delivered-To: leslie@example.com Received: from mail127.greatfamilyoffers.com (mail127.greatfamilyoffers.com [64.49.250.134]) by example.com (Postfix) with SMTP id 91023280E1 for ; Fri, 1 Nov 2002 17:27:24 -0500 (EST) Content-Transfer-Encoding: 7bit Content-Type: multipart/alternative; boundary="_----------=_8177609094814736182511" MIME-Version: 1.0 X-Mailer: MIME::Lite 2.117 (F2.6; B2.12; Q2.03) Date: Fri, 1 Nov 2002 22:27:23 UT Subject: Make a fortune in Real Estate in no time. X-Id: H4F%N9&]M25:B&RIJW0S`JAWYR:="CP4!8(R@?9QL\=2B6%3D""9Q1@`` X-List-Unsubscribe: From: "Real Estate Money" Reply-To: "Real Estate Money" To: "Friend" Message-Id: <20021101222724.91023280E1@example.com> # int cnt prob spamicity histogram # 0.00 1 0.013011 0.003063 # # 0.10 8 0.180900 0.087313 ######## # 0.20 13 0.210263 0.123080 ############# # 0.30 9 0.345669 0.172632 ######### # 0.40 15 0.439486 0.253486 ############### # 0.50 12 0.552084 0.318856 ############ # 0.60 8 0.640662 0.362714 ######## # 0.70 3 0.738235 0.382174 ### # 0.80 12 0.838280 0.464708 ############ # 0.90 36 0.970616 0.659419 #################################### This is a multi-part message in MIME format. --_----------=_8177609094814736182511 Content-Disposition: inline Content-Transfer-Encoding: 7bit Content-Type: text/plain This message contains an HTML formatted message but your email client does not support the display of HTML. Please view this message in a different mail client or forward this email to a web-based mail system. --_----------=_8177609094814736182511 Content-Disposition: inline Content-Transfer-Encoding: quoted-printable Content-Type: text/html =0D
    =0D = =0D =0D =0D =0D
    =0D
    =0D =0D
    =0D
    =0D This messag= e was sent to address leslie@example.com=0D
    =0D
    =0D =0D Remove yourself from this recurring list by:
    =0D sending a blank email to unsub-30673179-3359@greatfamilyoffers.co= m
    OR
    =0D Sending a postal mail to CustomerService, 364 Patteson Drive # 312,= Morgantown, WV 26505
    =0D --_----------=_8177609094814736182511-- From apeters@dealsweeps.virtual3.net Fri Nov 1 18:50:41 2002 Return-Path: Delivered-To: leslie@example.com Received: from mail141.gooberfoob.com (unknown [209.236.57.141]) by example.com (Postfix) with SMTP id 37183280E1 for ; Fri, 1 Nov 2002 18:50:40 -0500 (EST) To: leslie@example.com Date: Fri, 1 Nov 2002 20:05:22 -0500 Message-ID: <1036199122.2745@mail141.gooberfoob.com> X-Mailer: Becky! ver. 2.00.03 From: Alicia Peters Reply-To: Alicia Peters Subject: Dateline NBC features "Unclaimed Property" Mime-Version: 1.0 Content-Type: text/html # int cnt prob spamicity histogram # 0.00 1 0.013011 0.003053 # # 0.10 8 0.150464 0.066924 ######## # 0.20 12 0.260523 0.133168 ############ # 0.30 22 0.349387 0.221255 ###################### # 0.40 18 0.443043 0.284995 ################## # 0.50 16 0.560551 0.347551 ################ # 0.60 19 0.655432 0.416318 ################### # 0.70 5 0.776836 0.437427 ##### # 0.80 13 0.837662 0.490732 ############# # 0.90 27 0.972427 0.633006 ########################### Telegram
    Notification From: 81675
    Department: Unclaimed Property

    Confirming Telegram of Unclaimed Property
         		OFFICIAL TELEGRAM

    CONGRATULATIONS
         		 

    TO: leslie@example.com DATE: 11/01/02
    FROM: Foundmoney.com
    RE: Unclaimed Assets Notification


    Important: This is to notify you that you may have Unclaimed Money waiting for you in your name. Our records indicate that you may be among the millions of people who have lost touch with their money and that your name may be in our database.
    UNCLAIMED ASSET FACTS:
  • $7 BILLION STOCKPILE OF UNCLAIMED ASSETS
  • 30 MILLION UNCLAIMED ACCOUNTS IN OUR DATABASE OF NAMES
  • 7 OUT OF 10 NORTH AMERICAN FAMILIES ARE OWED MONEY
  • CONSISTS OF BANK ACCOUNTS, WILLS & ESTATES, INSURANCE CLAIMS
    •

    * 4 Million Updated Records as of October 15th 2002!*


    Enter your name today for this chance to be re-united with your money!

    CLICK HERE NOW TO LOCATE YOUR UNCLAIMED MONEY

         These funds may be currently reserved in your name and waiting for you to claim.


    The preceding message was sent to you as an opt-in subscriber to DealSweeps. We will continue to bring you valuable offers on the products and services that interest you most. If you wish to unsubscribe please click here: http://www.dealsweeps.com/remove.asp?E=leslie@example.com
    From bounce-30716179-3350@mail239.dealdelivery.com Fri Nov 1 18:54:05 2002 Return-Path: Delivered-To: mark@example.com Received: from mail239.dealdelivery.com (mail239.dealdelivery.com [66.216.107.239]) by example.com (Postfix) with SMTP id C687E280E1 for ; Fri, 1 Nov 2002 18:54:04 -0500 (EST) Content-Transfer-Encoding: 7bit Content-Type: multipart/alternative; boundary="_----------=_1400075327147069425819" MIME-Version: 1.0 X-Mailer: MIME::Lite 2.117 (F2.6; B2.12; Q2.03) Date: Fri, 1 Nov 2002 18:53:08 UT Subject: We cleared about $20,000. Not bad for our first deal X-Id: H4F%N9&]M25;!Y--MN3X$3QU"AO;A9>YX5)T'3#,O9SL3'2O0)G?7D0`` X-List-Unsubscribe: From: "Real Estate Secrets" Reply-To: "Real Estate Secrets" To: "Friend" Message-Id: <20021101235404.C687E280E1@example.com> # int cnt prob spamicity histogram # 0.00 1 0.013007 0.003054 # # 0.10 7 0.178852 0.082268 ####### # 0.20 17 0.211837 0.126686 ################# # 0.30 9 0.343916 0.170194 ######### # 0.40 15 0.434378 0.243879 ############### # 0.50 15 0.558349 0.321314 ############### # 0.60 8 0.643099 0.361502 ######## # 0.70 3 0.729268 0.378914 ### # 0.80 16 0.846761 0.479730 ################ # 0.90 46 0.977744 0.677658 ############################################## This is a multi-part message in MIME format. --_----------=_1400075327147069425819 Content-Disposition: inline Content-Transfer-Encoding: 7bit Content-Type: text/plain This message contains an HTML formatted message but your email client does not support the display of HTML. Please view this message in a different mail client or forward this email to a web-based mail system. --_----------=_1400075327147069425819 Content-Disposition: inline Content-Transfer-Encoding: quoted-printable Content-Type: text/html =0D
    =0D =0D =0D =0D =0D
    =0D


    =0D =0D =0D
    =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
    Rem= ove yourself from this recurring list by:
    Clicking here to send a bl= ank email to unsub-30716179-3350@championoffers.com
    OR
    Sending a pos= tal mail to CustomerService, Box 202885, Austin, TX 78720

    This message was sent to address mark@example.com
    =0D --_----------=_1400075327147069425819-- From apeters@DIDYOUCLICK.VIRTUAL3.NET Fri Nov 1 19:57:57 2002 Return-Path: Delivered-To: leslie@example.com Received: from idaho.virtual3.net (unknown [209.236.57.228]) by example.com (Postfix) with ESMTP id BA372280E2 for ; Fri, 1 Nov 2002 19:57:56 -0500 (EST) Received: from hawaii (192.168.6.227) by idaho.virtual3.net (LSMTP for Windows NT v1.1b) with SMTP id <57.00007629@idaho.virtual3.net>; Sat, 2 Nov 2002 7:47:43 -0500 Date: Sat, 2 Nov 2002 07:05:01 -0500 From: Alicia Peters Subject: Dateline NBC features "Unclaimed Property" To: leslie@EXAMPLE.COM Mime-Version: 1.0 Content-Type: text/html Message-Id: <20021102005756.BA372280E2@example.com> # int cnt prob spamicity histogram # 0.00 1 0.013008 0.003051 # # 0.10 7 0.149435 0.064006 ####### # 0.20 14 0.251840 0.135141 ############## # 0.30 22 0.349491 0.220502 ###################### # 0.40 17 0.445154 0.281315 ################# # 0.50 17 0.559970 0.347416 ################# # 0.60 18 0.655485 0.412734 ################## # 0.70 5 0.776794 0.434186 ##### # 0.80 15 0.833668 0.494140 ############### # 0.90 29 0.972846 0.638536 ############################# Telegram

    Notification From: 81675
    Department: Unclaimed Property

    Confirming Telegram of Unclaimed Property
         		OFFICIAL TELEGRAM

    CONGRATULATIONS
         		 

    TO: leslie@EXAMPLE.COM DATE: 11/01/02
    FROM: Foundmoney.com
    RE: Unclaimed Assets Notification


    Important: This is to notify you that you may have Unclaimed Money waiting for you in your name. Our records indicate that you may be among the millions of people who have lost touch with their money and that your name may be in our database.
    UNCLAIMED ASSET FACTS:
  • $7 BILLION STOCKPILE OF UNCLAIMED ASSETS
  • 30 MILLION UNCLAIMED ACCOUNTS IN OUR DATABASE OF NAMES
  • 7 OUT OF 10 NORTH AMERICAN FAMILIES ARE OWED MONEY
  • CONSISTS OF BANK ACCOUNTS, WILLS & ESTATES, INSURANCE CLAIMS
    •

    * 4 Million Updated Records as of October 15th 2002!*


    Enter your name today for this chance to be re-united with your money!

    CLICK HERE NOW TO LOCATE YOUR UNCLAIMED MONEY

         These funds may be currently reserved in your name and waiting for you to claim.


    The preceding message was sent to you as an opt-in subscriber to DidYouClick. We will continue to bring you valuable offers on the products and services that interest you most. If you wish to unsubscribe please click here: http://www.didyouclick.com/remove.asp?E=leslie@EXAMPLE.COM
    From bounce-72963894-1987@mail164.c0olmail.com Fri Nov 1 20:02:59 2002 Return-Path: Delivered-To: mark@example.com Received: from mail164.c0olmail.com (mail164.c0olmail.com [66.216.110.163]) by example.com (Postfix) with SMTP id C79CA280E2 for ; Fri, 1 Nov 2002 20:02:58 -0500 (EST) Content-Transfer-Encoding: 7bit Content-Type: multipart/alternative; boundary="_----------=_6997777597692590240363" MIME-Version: 1.0 X-Mailer: MIME::Lite 2.117 (F2.6; B2.12; Q2.03) Date: Sat, 2 Nov 2002 01:02:58 UT Subject: Friend, Start Making Money On Ebay X-Id: H4F%N9&]M25:+[?1T2^X7QV5W6OB%+7IQ4TS4"'W2=MMU%/``` X-List-Unsubscribe: From: "Cool Mail" Reply-To: "Cool Mail" To: "Friend" Message-Id: <20021102010258.C79CA280E2@example.com> # int cnt prob spamicity histogram # 0.00 6 0.015699 0.002717 ###### # 0.10 9 0.172066 0.036010 ######### # 0.20 26 0.230990 0.103744 ########################## # 0.30 24 0.345577 0.170664 ######################## # 0.40 18 0.440056 0.223039 ################## # 0.50 16 0.547764 0.275270 ################ # 0.60 12 0.652788 0.318550 ############ # 0.70 12 0.759512 0.366410 ############ # 0.80 21 0.839726 0.442188 ##################### # 0.90 31 0.956056 0.573775 ############################### This is a multi-part message in MIME format. --_----------=_6997777597692590240363 Content-Disposition: inline Content-Transfer-Encoding: 7bit Content-Type: text/plain This message contains an HTML formatted message but your email client does not support the display of HTML. Please view this message in a different mail client or forward this email to a web-based mail system. --_----------=_6997777597692590240363 Content-Disposition: inline Content-Transfer-Encoding: quoted-printable Content-Type: text/html =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
    =0D =0D =0D =0D Start Making Money On Ebay!!!
    =0D =0D
    =0D =0D My E-Book is packed with the
    =0D =0D tips and tricks the pro's
    =0D =0D DON'T want you to know!
    =0D =0D
    =0D =0D ACT NOW and receive
    =0D =0D MMP Warehouse,
    =0D =0D a comprehensive wholesale
    =0D =0D guide EXCLUSIVE to my program!
    = =0D =0D
    =0D =0D If you don't make $500 in your=
    =0D =0D first 30 days, I will send you= $30
    =0D =0D JUST FOR TRYING!
    =0D =0D
    =0D =0D Click here to find out more!!!
    =0D =0D     =0D =0D
    =0D =0D =0D =0D


    =0D
    =0D
    We respect your privacy. = You have opted in to receive updates on the best discount offers while visi= ting or an=0D affiliate.
    =0D

    =0D
    =0D
    If you would no longer like to receive these offer= s via email, you can unsubscribe by sending a blank email to unsub-72963894-1987@c0olmail.com<= /FONT>=0D
    OR
    Sending a postal mail to CustomerService, Box 202885, Austin, TX 787= 20=0D

    This message was sent to address mark@example.com= =0D
    =0D =0D =0D =0D --_----------=_6997777597692590240363-- From 22-8588-418714@bounce.azogle.com Fri Nov 1 20:44:53 2002 Return-Path: <22-8588-418714@bounce.azogle.com> Delivered-To: leslie@example.com Received: from transport4.azogle.com (transport4.azogle.com [66.46.150.8]) by example.com (Postfix) with SMTP id 6139F280E1 for ; Fri, 1 Nov 2002 20:44:52 -0500 (EST) Received: from azoogle by transport4.azogle.com with local (Azoogle 2.1) id 22-8588-418714 for leslie@example.com; Sat, 02 Nov 2002 01:36:36 GMT Content-Type: multipart/alternative; boundary="----------=_1036200996-24054-149" Content-Transfer-Encoding: 7bit MIME-Version: 1.0 From: "A Secret Admirer" Reply-To: "A Secret Admirer" To: leslie@example.com Date: Sat, 02 Nov 2002 01:36:36 GMT Subject: Free 7-day all access membership to Matchmaker.com Message-Id: <22-8588-418714@transport4.azogle.com> X-Info: please report abuse of this service to abuse@azogle.com # int cnt prob spamicity histogram # 0.00 3 0.053107 0.017467 ### # 0.10 5 0.173065 0.060409 ##### # 0.20 10 0.262060 0.125163 ########## # 0.30 19 0.359082 0.217749 ################### # 0.40 15 0.442112 0.277619 ############### # 0.50 26 0.549954 0.373969 ########################## # 0.60 11 0.649348 0.412559 ########### # 0.70 10 0.746256 0.451790 ########## # 0.80 15 0.847337 0.513206 ############### # 0.90 37 0.981097 0.670787 ##################################### This is a multi-part message in MIME format... ------------=_1036200996-24054-149 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 2498

    Greetings from Matchmaker!




    Hey There! Are you single?

    It's time to take control of your destiny and sign up for your FREE 7 Day membership at Matchmaker.com.

    Your trial membership gives you full access and functionality on our 80+ sites. Browse our in-depth profiles, upload your photos, view pictures, chat, send & receive email.

    With more than 8 million registered members, in-depth profiles, and our "freshness" guarantee - Matchmaker is your best bet for romance, friendship and more!

    Click here to join now!

    Sign up now -- No Credit Card Required

    -- The Matchmaker

     

     

    		 
      Stop Waiting. Start Living. Go Meet Somebody!

     

     

     

    ------------------
You are receiving this email because you have opted-in to receive
email from publisher: sarckos.  To unsubscribe, click below:

http://u.azogle.com/?z=22-418714-ZYPb9G
    ------------=_1036200996-24054-149 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 1080 You are getting this message as a subscriber to Sarckos Special Deals. To cancel, see the instructions at the end of this mail. --------------------------------------------------------------- Hey There! Are you single? http://www.sarcko.com/mm.htm It's time to take control of your destiny and sign up for your FREE 7 Day membership at Matchmaker.com. Your trial membership gives you full access and functionality on our 80+ sites. Browse our in-depth profiles, upload your photos, view pictures, chat, send & receive email. With more than 8 million registered members, in-depth profiles, and our "freshness" guarantee - Matchmaker is your best bet for romance, friendship and more! Sign up today -- No Credit Card Required -- The Matchmaker Stop Waiting. Start Living. Go Meet Somebody! http://www.sarcko.com/mm.htm ------------------ You are receiving this email because you have opted-in to receive email from publisher: sarckos. To unsubscribe, click below: http://u.azogle.com/?z=22-418714-ZYPb9G ------------=_1036200996-24054-149-- From opt-in@mtsbp524.opmnet.net Fri Nov 1 21:12:46 2002 Return-Path: Delivered-To: john@example.com Received: from mtsbp524.opmnet.net (mtsbp524.opmnet.net [209.236.57.188]) by example.com (Postfix) with SMTP id 88245280E1 for ; Fri, 1 Nov 2002 21:12:45 -0500 (EST) Received: (qmail 14470 invoked by uid 500); 2 Nov 2002 02:12:43 -0000 Date: 2 Nov 2002 02:12:43 -0000 Message-ID: <20021102021243.14469.qmail@mtsbp524.opmnet.net> To: john@example.com From: Video_Professor@mtsbp524.opmnet.net Reply-To: opt-in@mtsbp524.opmnet.net Subject: No Cost Computer Learning From Video Professor Content-type: multipart/alternative; boundary="##########" # int cnt prob spamicity histogram # 0.00 5 0.045189 0.012461 ##### # 0.10 11 0.147992 0.050746 ########### # 0.20 27 0.248376 0.124921 ########################### # 0.30 34 0.346344 0.201938 ################################## # 0.40 27 0.445256 0.262223 ########################### # 0.50 29 0.554018 0.330098 ############################# # 0.60 22 0.646994 0.380445 ###################### # 0.70 18 0.757635 0.425690 ################## # 0.80 28 0.848239 0.492550 ############################ # 0.90 38 0.955563 0.601079 ###################################### --########## ************************************************* STILL TRYING TO FIGURE OUT YOUR COMPUTER? WHO HAS THE TIME FOR MANUALS OR CLASSES? YOU NEED FREE* LESSONS FROM VIDEO PROFESSOR! ************************************************* FREE* computer lessons on CD-ROM! + Choose from over 15 titles + Learn new skills in 1 hour + Compare at $59.95 + Quick, easy and FREE! Get FREE* computer learning from Video Professor on a subject of your choice. For over 15 years, Video Professor has taught over 4 million people how to use their computers, and we can teach you too, FREE*. + Simple 'What-You-See-Is-What-You-Do' way to learn + Plays like a video on your computer screen + A complete & comprehensive lesson FREE & RISK FREE Get YOUR free* lesson today!! ************************************************* http://ct.opmnet.net/cgi-bin/opmt.cgi?action=click&linkid=1040&uinfo=dxukDxyGutDuDyhUkCfqwelwdqR AOL Memebers Click Here ************************************************* *The complete 3-lesson set on the subject of your choice is yours for a free 10-day trial, all you pay is just $6.95 to cover shipping and handling. Keep all three and we will conveniently bill $59.95 to your credit card. Or simply return any one lesson and keep the other two as our gift to you. Limit one per household. You are receiving this special offer because you have provided permission to receive third party email communications regarding special online promotions or offers. If you do not wish to receive any further messages from OPM Network Click Here http://opt-out.opmnet.net AOL Members click here This message was sent to you by OPM Network 5557 Oakland Park Blvd suite 117 Fort Lauderdale, FL, 33313 1.877.678.2536. Third-party offers contained in this email are the sole responsibility of the offer originator, offer # 1223366866. Please do not reply to this email, your request will not be properly processed. This may be a reoccurring mailing. --########## Content-Type: text/html Content-Transfer-Encoding: 7bit Content-Disposition: inline FREE Computer Learning!

    FREE* computer lessons
    on CD-ROM!

    • Learn new skills
      in as little as 1 hour
    • Choose from over 15 titles
    • Quick, easy and FREE!
    Get FREE* computer learning from Video Professor
    on a subject of your choice.
    For over 15 years, Video Professor has taught millions of people
    how to use their computers, and we can teach you too, FREE*.
  • Simple 'What-You-See-Is-What-You-Do' way to learn
  • Plays like a video on your computer screen
  • A complete & comprehensive lesson RISK FREE
  • Over 4 million satisfied users

    • Select from these available titles...

    Windows - Outlook - Excel - Access - PowerPoint - FrontPage - Works
    Quicken - Internet - Word - WordPerfect - Lotus 1-2-3 - DOS

    *The complete 3-lesson set on the subject of your choice is yours for a free 10-day trial, all you pay is just $6.95 to cover shipping and handling. Keep all three and we will conveniently bill $59.95 to your credit card. Or simply return any one lesson and keep the other two as our gift to you. Limit one per household.

    You are receiving this special offer because you have provided permission to receive third party email communications regarding special online promotions or offers. If you do not wish to receive any further messages from OPM Network Click Here. This message was sent to you by OPM Network 5557 Oakland Park Blvd suite 117 Fort Lauderdale, FL, 33313 1.877.678.2536. Third-party offers contained in this email are the sole responsibility of the offer originator, offer # 1223366866. Please do not reply to this email, your request will not be properly processed. This may be a reoccurring mailing.
    --##########-- From NOLIST-62645776-5565-JOHN**EXAMPLE*COM@MAIL1.SAVINGSENGINE.COM Fri Nov 1 22:30:56 2002 Return-Path: Delivered-To: john@example.com Received: from mail1.savingsengine.com (unknown [216.109.92.210]) by example.com (Postfix) with ESMTP id C8327280E1 for ; Fri, 1 Nov 2002 22:30:55 -0500 (EST) Received: by mail1.savingsengine.com (PowerMTA(TM) v1.6a13); Fri, 1 Nov 2002 22:30:39 -0500 (envelope-from ) From: "Computer Supplies" To: JOHN@EXAMPLE.COM Reply-To: mailings@savingsengine.com Subject: Printer Cartridges - Inkjet & Laser Toners - Save up to 80% MIME-Version: 1.0 Content-Type: multipart/alternative; boundary=06986E0E1E196312E032AFBC Message-Id: <20021102033055.C8327280E1@example.com> Date: Fri, 1 Nov 2002 22:30:55 -0500 (EST) # int cnt prob spamicity histogram # 0.00 1 0.012998 0.003034 # # 0.10 3 0.156758 0.051310 ### # 0.20 18 0.253522 0.151369 ################# # 0.30 24 0.344433 0.226077 ####################### # 0.40 24 0.444647 0.296262 ####################### # 0.50 23 0.548921 0.363544 ###################### # 0.60 19 0.660081 0.421622 ################## # 0.70 19 0.751920 0.477742 ################## # 0.80 28 0.856529 0.554157 ########################## # 0.90 54 0.964007 0.680130 ################################################## This is a multi-part message in MIME format. If you are reading this text, you may want to consider changing to a mail reader or gateway that understands how to properly handle MIME multipart messages. Date: Fri, 1 Nov 2002 22:30:39 -0500 --06986E0E1E196312E032AFBC Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Disposition: inline FREE Shipping on orders of $40 or more!!! PrintPal's normal prices save you up to 80% on inkjet cartridges and laser printer toners. Now get FREE Shipping. Click the link below to start saving! http://www.savingsengine.com/click.asp?lnk=9061&email=JOHN@EXAMPLE.COM Why PrintPal.com? 1. Save up to 80% off store prices. 2. We offer a 100% money-back guarantee on everything we sell. 3. Free shipping on orders over $40. 4. We're nice, friendly people. Ready to save? Click here: http://www.savingsengine.com/click.asp?lnk=9061&email=JOHN@EXAMPLE.COM ________________________________________________________________________ Your privacy is extremely important to us. You requested to receive this mailing, by registering at SavingsEngine.com or by subscribing through one of our marketing partners. As a leader in email marketing, we are committed to delivering a highly rewarding experience, with offers that include bargains, entertainment, and money-making ideas. However, if you wish to unsubscribe, please copy and paste the following link into your web browser: http://www.savingsengine.com/unsubscribe.asp?emid=5565&email=JOHN@EXAMPLE.COM Third-party offers contained in this email are the sole responsibility of the offer originator. ________________________________________________________________________ --06986E0E1E196312E032AFBC Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Disposition: inline


    If the above links do not work or appear, simply copy this URL and paste it into your browser's address field:
     http://www.savingsengine.com/click.asp?lnk=9061&email=JOHN@EXAMPLE.COM


    Your privacy is extremely important to us. You requested to receive this mailing, by registering at SavingsEngine.com or by subscribing through one of our marketing partners. As a leader in email marketing, we are committed to delivering a highly rewarding experience, with offers that include bargains, entertainment, and money-making ideas. However, if you wish to unsubscribe, click here or link to http://www.savingsengine.com/unsubscribe.asp?emid=5565&email=JOHN@EXAMPLE.COM Third-party offers contained in this email are the sole responsibility of the offer originator.

    --06986E0E1E196312E032AFBC-- /* From n.2051.11411688@q.suitemail.theoffers.com Fri Nov 1 22:49:35 2002 Return-Path: Delivered-To: mark@example.com Received: from suitemail.theoffers.com (unknown [216.52.222.183]) by example.com (Postfix) with SMTP id D0228280E1 for ; Fri, 1 Nov 2002 22:49:34 -0500 (EST) Date: Fri, Nov 01 02 15:01:05 From: "CarMatcher" To: mark@example.com Subject: New & Used Cars - Get Your Quotes at CarMatcher MIME-Version: 1.0 X-Mailer: IES v1.1002.11411688 Reply-To: r.2051.11411688@q.suitemail.theoffers.com Content-Type: multipart/alternative; boundary="=_a54c13680acdb39e8fbca644dffc8870" Message-Id: <20021102034934.D0228280E1@example.com> # int cnt prob spamicity histogram # 0.00 2 0.042510 0.012705 ## # 0.10 9 0.168596 0.075095 ######### # 0.20 15 0.232556 0.125523 ############### # 0.30 12 0.354197 0.180313 ############ # 0.40 20 0.445204 0.264575 #################### # 0.50 18 0.548493 0.335395 ################## # 0.60 12 0.654716 0.384607 ############ # 0.70 7 0.770542 0.418804 ####### # 0.80 27 0.840382 0.524139 ########################### # 0.90 37 0.972513 0.661100 ##################################### This is a MIME encoded message. --=_a54c13680acdb39e8fbca644dffc8870 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit Best Dealers with the Best Prices... that's what you'll get when you submit your purchase request to our Preferred Dealers. Click Here http://suitemail.theoffers.com/onlinedbm/l.php?597&11411688 Serious car buyers know that a FREE online dealer quote is the BEST way to save money!! New Dealer incentives and Manufacturer Rebates will help get you into that new car, truck or SUV. See how much you can SAVE with a FREE dealer quote! Click Here http://suitemail.theoffers.com/onlinedbm/l.php?597&11411688 This is the only way for serious shoppers to buy their next car! -------------------------------------------- I hope you enjoyed receiving this message, but if you no longer wish to receive them, use this http://suitemail.theoffers.com/onlinedbm/un.php?2051&mark@example.com. --=_a54c13680acdb39e8fbca644dffc8870 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable CarMatcher.com
    =20

    =20 =20 =20 =20 =20 =20
    =20 =20
    =20
    =20 =20
    =20


    I hope you enjoyed receiving= this message, but if you no longer wish to receive them, use this press= here.

    --=_a54c13680acdb39e8fbca644dffc8870-- 3D"">
    =20 © Copyright 2002, Legal Relief Systems


    I hope you enjoyed receiving= this message, but if you no longer wish to receive them, use this press= here.

    --=_faf4262d6084290a142babc315d872ad-- From bounce-5410083-208@mail135.evalueexpress.com Fri Nov 1 23:01:41 2002 Return-Path: Delivered-To: john@example.com Received: from mail135.evalueexpress.com (mail135.evalueexpress.com [64.49.241.142]) by example.com (Postfix) with SMTP id 5BBC7280E1 for ; Fri, 1 Nov 2002 23:01:40 -0500 (EST) Content-Transfer-Encoding: 7bit Content-Type: multipart/alternative; boundary="_----------=_2586880342258149016944" MIME-Version: 1.0 X-Mailer: MIME::Lite 2.117 (F2.6; B2.12; Q2.03) Date: Sat, 2 Nov 2002 04:01:35 UT Reply-To: "eBay Secrets Exposed" X-X: H4F%N9&]M25;-""%Z%>Z;:^I2=<52_7VA1L=*;[3R[-382Z,]\]HGE@`` Subject: John Johnson Make a Fortune on eBay! X-List-Unsubscribe: To: "John Johnson" From: "eBay Secrets Exposed" Message-Id: <20021102040140.5BBC7280E1@example.com> # int cnt prob spamicity histogram # 0.00 4 0.046686 0.014985 #### # 0.10 17 0.164260 0.074804 ################# # 0.20 35 0.237585 0.138509 ################################### # 0.30 33 0.338895 0.201309 ################################# # 0.40 30 0.443215 0.263121 ############################## # 0.50 14 0.547302 0.296232 ############## # 0.60 20 0.660571 0.351357 #################### # 0.70 7 0.740853 0.371806 ####### # 0.80 22 0.849198 0.443564 ###################### # 0.90 44 0.972721 0.604831 ############################################ This is a multi-part message in MIME format. --_----------=_2586880342258149016944 Content-Disposition: inline Content-Transfer-Encoding: 7bit Content-Type: text/plain "Finally -- You Too Can Turn Ebay Into A Nonstop Cash Generating Machine." Click Here: http://click.evalueexpress.com/sp/t.pl?id=1753:5410083 AOL Users Click Here This is the EASIEST and BEST way to Make Money on The Internet: Click Here: http://click.evalueexpress.com/sp/t.pl?id=1755:5410083 AOL Users Click Here ====================================================== Remove yourself from this recurring list by sending a blank email to mailto:unsub-5410083-208@evalueexpress.com OR Sending a postal mail to: Customer Service 4790 Caughlin Pkwy # 422 Reno, NV 89509 This message was sent to address john@example.com --_----------=_2586880342258149016944 Content-Disposition: inline Content-Transfer-Encoding: quoted-printable Content-Type: text/html =0D =0D ebay Sources EXPOSED! You will be shocked when you find out where e= ay power sellers are buying from=0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
    =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
    =0D
    "Finally =0D -- You Too Can Turn Ebay Into
    =0D A Nonstop Cash Generating Machine."     =0D

    "Why = almost =0D every other wholesale source guide
    =0D should be thrown away right now..."
    =0D

    =0D
    =0D
    =0D
    =0D =0D =0D =0D =0D
    =0D

    = "I =0D can't say thank you enough! I'm a stay at home mom and = had =0D been looking for a way to make extra income while I'm at ho= me =0D with my kids. I was skeptical at first, but I figured I wou= ld =0D try eBay Sources Exposed and if it didn't work I would just= get =0D my money back.

    =0D

    = Well, lets =0D just say I won't be returning it! I'm now make $255 a da= y. =0D I can't thank you enough. These sources have really cha= nged =0D my life."
    =0D     -- =0D Donna Richardson

    =0D

    = "...Absolutely =0D AMAZING! I can't believe how simple this is, the time I= save =0D using these sources has paid for the system over and over a= gain! =0D The bonus "eBay Marketing" alone is worth what I paid =0D for this entire system!"
    =0D --Larry Dwinzle

    =0D
    =0D

    =0D =0D
    =0D
    =0D
    =0D Click Here Now!
    Learn the Secrets    =0D =0D

    =0D =0D =0D
    =0D =0D =0D =0D =0D
    =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D =0D
    Remove yourself from this recurring list = by:
    =0D =0D =0D =0D =0D
    =0D =0D =0D =0D =0D
    =0D a. sending a blank email to unsub-5410083-208@evalueexpress.com
    =0D
    =0D b. Sending a postal mail to Customer Service, 4790 Caughl= in Pkwy # 422, Reno, NV 89509
    =0D
    =0D
    =0D
    This message was sent to address john@example.co= m
    =0D
    =0D =0D =0D --_----------=_2586880342258149016944-- From offers@offers.mynetoffers.com Fri Nov 1 23:46:15 2002 Return-Path: Delivered-To: leslie@example.com Received: from saturn.mynetoffers.com (unknown [66.239.2.70]) by example.com (Postfix) with SMTP id 14B97280E1 for ; Fri, 1 Nov 2002 23:46:14 -0500 (EST) X-CID: 132 X-UserID: 16878902 X-EMail: leslie@example.com X-From: offers@offers.mynetoffers.com Reply-To: offers@offers.mynetoffers.com Returnpath: offers@offers.mynetoffers.com Content-Type: text/html To: leslie@example.com From: "MyNetOffers" Subject: Rent all the DVDs you want -- Free Trial! Message-Id: <20021102044614.14B97280E1@example.com> Date: Fri, 1 Nov 2002 23:46:14 -0500 (EST) # int cnt prob spamicity histogram # 0.00 2 0.006522 0.000952 ## # 0.10 10 0.175725 0.061598 ########## # 0.20 28 0.250944 0.139681 ############################ # 0.30 26 0.348909 0.203179 ########################## # 0.40 23 0.448642 0.262501 ####################### # 0.50 21 0.547258 0.319339 ##################### # 0.60 21 0.655441 0.379392 ##################### # 0.70 16 0.746328 0.425113 ################ # 0.80 29 0.849439 0.504692 ############################# # 0.90 49 0.965771 0.636800 ################################################# Try a better way to rent DVDs - FREE!
    You are receiving this email as a special offer from MyNetOffers to its subscribers. If you do not want to receive these emails from MyNetOffers in the future, please follow the unsubscribe instructions at the bottom of this email.


    Rent as many DVDs as you want for $20 a month

    It's Easy:
     

     
    Create your list of DVDs online.

     
    We rush you 3 DVDs from your list
    		  
    Keep 'em as long as you want.
    		  
    Return 1 get another from your list.
    		  

    No Due Dates zzzz No Hidden Charges zzzz No Commitments


    Free trial valid in the 50 United States and its territories and possessions only. This limited introductory free trial offer expires 12/31/02 and cannot be combined with any other offer. Limit one per household. First-time customers only. Internet access and valid credit or debit card required to redeem offer. Netflix will begin to bill your credit card for monthly subscription fees of $19.95 at the completion of the free trial unless you cancel prior to the end of the free trial. The Netflix Standard Program is a month-to-month subscription cancelable at anytime. Click the Your Account button for cancellation instructions. No refunds or credits for partial monthly subscription periods. Please visit www.netflix.com for complete terms and conditions, including length of free trial period. Netflix reserves the right to change terms and conditions at any time. 2002 Netflix, Inc.









    If you would like to change your subscription status or be removed from this publishers mailing list, please use the following link:
    Unsubscribe

    If you would like to contact MyNetOffers directly, please write to:
    MyNetOffers
    9850 S Maryland Pkwy.
    Suite 5-420
    Las Vegas, NV 89123

    This message was sent to: leslie@example.com
    Your user id number is: 16878902
    Delivered-To: mark@example.com Received: from mail7.transcentives.net (mail7.transcentives.net [216.23.198.157]) by example.com (Postfix) with ESMTP id 9CEEC280E1 for ; Fri, 1 Nov 2002 12:10:30 -0500 (EST) Received: (from mailer@localhost) by mail7.transcentives.net (8.11.3/8.11.3) id gA1HARh07450; Fri, 1 Nov 2002 11:10:27 -0600 (CST) (envelope-from mailer) Date: Fri, 1 Nov 2002 11:10:27 -0600 (CST) Message-Id: <200211011710.gA1HARh07450@mail7.transcentives.net> To: "mark@example.com" From: "flyfree@milespree.com" CONTENT-TYPE: text/html; SUBJECT: Save up to 63% on HP Optical USB Mouse (+150 miles) X-Bogosity: Yes, tests=bogofilter, spamicity=0.590490, version=0.7.7-1030.1423 Status: RO X-Status: X-Keywords: X-UID: 4625 # int cnt prob spamicity histogram # 0.00 14 0.028552 0.005412 ############# # 0.10 19 0.166254 0.037474 ################# # 0.20 28 0.241787 0.085788 ######################### # 0.30 29 0.354071 0.145655 ######################### # 0.40 26 0.446651 0.201876 ####################### # 0.50 24 0.549863 0.257783 ##################### # 0.60 20 0.652459 0.307414 ################## # 0.70 8 0.760219 0.330569 ####### # 0.80 27 0.852680 0.410978 ######################## # 0.90 58 0.980890 0.590490 ##################################################
         Hello mark@example.com, you have 2000 miles!
    We send this mail so you can earn free travel, faster. But if you'd like to unsubscribe, instructions appear at the bottom.



    Compare and Save
    .
    Price
    S&H
    Total
    You Save
    HP.com
    $24.99
    $4.99
    $29.98
    43%
    Office Depot
    $24.99
    $5.95
    $30.94
    45%
    Walmart
    $29.83
    $4.99
    $34.82
    51%
    CDW
    $32.76
    $7.54
    $40.30
    58%
    * Comparisons are based on the same or comparable models from leading merchants.

    Fed up with those annoying skips and jumps when you use your mouse?

    Thanks to HP™, you'll NEVER have to deal with those frustrating delays and slips of your cursor on the screen ever again!

    Even better - NEVER clean your mouse ball again - and you can also forget about your mousepad! This marvel of technology uses optical light sensors to record motion instead of the outdated mouseball.

    Why buy an ordinary ball mouse when you can get the latest USB-compatible Optical Mouse from the industry leader - HP™ - for a fraction of the retail price?

    This is the last mouse you'll ever need! Get one for yourself and a few for your office or home.

    You simply can't buy a better mouse
    and you can't get it for less anywhere else!
    Order today - while they last. You pay only:
    $16.99
    FREE SHIPPING

    TO UNSUBSCRIBE: click here or forward a copy of this email to remove@milespree.com

    Shop & Earn | Special Offers - Mostly Free | Profile | Refer a Friend
    FAQ | Your Privacy | Terms & Conditions | Partners

    MileSpree Mile Mail brings you offers to help you earn free travel faster. By clicking any links in this e-mail you agree to hold MileSpree, Inc. harmless from any liabilities or damages that could arise from participating in merchant offers.

    MileSpree, MileSpree Rewards, "the fastest free travel on the net" and the MileSpree logo are service marks or trade marks of MileSpree, Inc. Copyright 2000-2002. All Rights Reserved.

    bogofilter-1.2.4/src/tests/inputs/headerbody.txt0000644000175000017500000000036712163572272020175 0ustar sezsezX-WARNING-1: DO NOT MODIFY THIS FILE X-WARNING-2: CHECK THIS FILE INTO CVS AS BINARY Subject: the next line only contains a TAB Summary: This line belongs in the header. If the body contains any lines prior to this one, the software is b0rked. bogofilter-1.2.4/src/tests/inputs/msg.flex0000644000175000017500000000062112163572272016765 0ustar sezsezFrom Content-type: multipart/mixed; boundary="simple boundary" --simple boundary Content-type: text/plain; charset=us-ascii Content-Transfer-Encoding: base64 dGVzdCAg --simple boundary Content-type: text/plain; charset=us-ascii Content-Transfer-Encoding: base64 dGVzdCAg --simple boundary Content-type: text/plain; charset=us-ascii Content-Transfer-Encoding: base64 dGVzdCAg --simple boundary-- bogofilter-1.2.4/src/tests/inputs/msg.3.txt0000644000175000017500000001160312163572272017011 0ustar sezsezFrom Return-Path: <22-8643-418714@bounce.azogle.com> Delivered-To: linda@example.com Received: from transport2.azogle.com (transport2.azogle.com [66.46.150.6]) by example.com (Postfix) with SMTP id 5D41C27EB8 for ; Sat, 2 Nov 2002 12:30:52 -0500 (EST) Received: from azoogle by transport2.azogle.com with local (Azoogle 2.1) id 22-8643-418714 for linda@example.com; Sat, 02 Nov 2002 17:21:27 GMT Content-Type: multipart/alternative; boundary="----------=_1036257687-5144-112" Content-Transfer-Encoding: 7bit MIME-Version: 1.0 From: "Thriller Deal" Reply-To: "Thriller Deal" To: linda@example.com Date: Sat, 02 Nov 2002 17:21:27 GMT Subject: Stephen King's latest thriller! Free Shipping & Handling Message-Id: <22-8643-418714@transport2.azogle.com> X-Info: please report abuse of this service to abuse@azogle.com This is a multi-part message in MIME format... ------------=_1036257687-5144-112 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 2061

     

     

     

    ------------------
You are receiving this email because you have opted-in to receive
email from publisher: sarckos.  To unsubscribe, click below:

http://u.azogle.com/?z=22-418714-ZYPb9G
    ------------=_1036257687-5144-112 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Length: 1754 You are getting this message as a subscriber to Sarckos Special Deals. To cancel, see the instructions at the end of this mail. --------------------------------------------------------------- With all the fear Stephen King has been able to conjure from cars, sewers, clowns and dogs, one might wonder how he manages to get around without being continually terrified. Not that we're complaining. The Master of the Macabre returns with a creepy tale about a mysterious Buick Roadmaster. Get Stephen King's "From a Buick 8" FREE plus another bestseller for 50% off! FREE SHIPPING AND HANDLING!! Click for details. http://www.sarcko.com/lg.htm Choose from titles such as: Nights in Rodanthe By Nicholas Sparks Author of the bestselling "The Notebook" & "Message in a Bottle". It's obvious Nicholas Sparks knows about love. Nights in Rodanthe will steal your heart! The Lovely Bones by Alice Sebold This New York Times bestseller that everyone is talking about. Leadership By Rudolph Giuliani The controversial mayor who guided New York City through the biggest crisis in the city's history reflects on his time in office and the lessons he learned there. Standing in the Rainbow By Fannie Flagg Fannie Flagg returns with a funny and endearing novel centered around the colorful Smith family of Elmwood Springs, Missouri. Red Rabbit By Tom Clancy Tom Clancy's back with the story behind his most popular character - Jack Ryan. Click here to browse our selection! http://www.sarcko.com/lg.htm ------------------ You are receiving this email because you have opted-in to receive email from publisher: sarckos. To unsubscribe, click below: http://u.azogle.com/?z=22-418714-ZYPb9G ------------=_1036257687-5144-112-- bogofilter-1.2.4/src/tests/inputs/msg.split.dr.0118.base640000644000175000017500000001121612163572272021243 0ustar sezsezFrom Kerschma@yahoo.com Sat Jan 18 16:53:41 2003 Return-Path: Delivered-To: john@example.com Received: from www.kurashi.ne.jp (kura1.kurashi.ne.jp [216.98.107.249]) by example.com (Postfix) with ESMTP id 1C3D82838C for ; Sat, 18 Jan 2003 16:53:41 -0500 (EST) Received: from Paulo ([218.24.129.170]) by www.kurashi.ne.jp (8.8.8+2.7Wbeta7/8.8.7) with SMTP id GAA21516; Sun, 19 Jan 2003 06:54:06 +0900 Message-Id: <200301182154.GAA21516@www.kurashi.ne.jp> Reply-To: "Paul Mendell" From: "Paul Mendell" To: john@omniplanar.com Subject: =?ISO-8859-3?B?ZXJpYyxBbWF6aW5nIFBlbmlzIERldmVsb3BtZW50IHByb2dyYW0gIQ==?= Date: Sat, 18 Jan 2003 22:01:13 GMT Mime-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_0119030601" X-Mailer: Microsoft Outlook Express 6.00.2462.0000 ------=_NextPart_0119030601 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: base64 PGh0bWw+DQoNCjxib2R5IGJnY29sb3I9IiNGRkZGRkYiIHRleHQ9IiMwMDAwMDAiPg0KU0k8IS0t bi0tPlpFIEFORCBTPCEtLUtoYWxpay0tPlRBTUlOQSBETyBNPCEtLUtob3Nyb3dqLS0+QVRURVI8 YnI+DQpNb3JlIFRoYW4gWW91IENhbiBQb3NzaTwhLS1haC0tPmJseSBJbWE8IS0tS2hvdXJ5LS0+ Z2luZSEhPGJyPg0KU2hlIGlzIGp1c3QgdHJ5PCEtLUtpbmctLT5pbmcgdG8gc3BhcmUgeW91ciBm ZWU8IS0tS2luZy0tPmxpbmdzIGJ5IHRlbGxpbmcgeW91IG90aGVyPCEtLUtpbnNlci0tPndpc2Uu PGJyPg0KRDwhLS1Lby0tPk9OJ1QgV0FJVCBVTlQ8IS0tS28tLT5JTCBTSEUgSVMgR09ORTxicj4N ClRPIEZJTkQgT1VUIFRIQVQgWU9VIENPVUw8IS0tS29sbG1hbi0tPkROJ1QgU0FUSVM8IS0tS29u ZG8tLT5GWSBIRVIhISENCjxwPklOVFJPRDwhLS1Lb3JzaGFrLS0+VUNJTkcsIFRIRSBGSVJTVCBB TEwtSU4tT05FPGJyPg0KICBNYTwhLS1Lb3VuZGlueS0tPmxlIFBlcmZvPCEtLWEtLT5ybWFuY2Ug RW5oYTwhLS1LdW1hci0tPm5jZXIgQU5EIFBlPCEtLUt1bXJhLS0+bmlzIEVubGE8IS0tTGFjaG5l eS0tPnJnZW1lbnQ8YnI+DQogIFdJVEggVEhFIFRSQUQ8IS0tTGFtLS0+RU1BUktFRCBTV0VEPCEt LUxhbi0tPklTSCBJTkdSRTwhLS1MYXphcm8tLT5ESUVOVCBDRVJOPCEtLUxlLS0+SVRJTi48L3A+ DQo8cD5TdGFuPCEtLUxlYXZlbmdvLS0+ZGFyZCBSZTwhLS1vZC0tPnN1bHRzIEluY2x1ZGU6PC9w Pg0KPHA+UEVOPCEtLUxlZS0tPklTIEVOTEFSR0VNRTwhLS1MZWUtLT5OVDxicj4NCiAgPT09PT09 PT09PT09PT09PT09PTxicj4NCiAgR0k8IS0tTGVlLS0+UlRIOiAwLjI1JnF1b3Q7IHVwIHRvIDIm cXVvdDs8YnI+DQogIExFTkc8IS0tTGVlLS0+VEg6IDEmcXVvdDsgdXAgdG8gMy4yNSZxdW90Ozwv cD4NCjxwPk1BPCEtLUxlZS0tPkxFIFBFUkZPUjwhLS1MZW5nLS0+TUFOQ0UgRU5IPCEtLUxlb25h cmQtLT5BTkNFUjxicj4NCiAgPT09PT09PT09PT09PT09PT09PT09PT09PT09PT08YnI+DQogIFNU PCEtLUxldW5nLS0+QU1JTkE6IFVwIHRvIDc0JSBoYXI8IS0tTGVWaW5lLS0+ZGVyIGVyZWN0PCEt LUxldy0tPmlvbnMsIHRoaXMgd2lsbCBoZWw8IS0tTGV3LS0+cCBjb250cmlidTwhLS1MZXdpcy0t PnRlIHRvPGJyPg0KICBsb248IS0tTGV3aXMtLT5nZXIgc2U8IS0tTGV6Y2Fuby0tPnh1YWwgZXhw ZTwhLS1MaS0tPnJpZW5jZXMuPGJyPg0KICBDTEk8IS0tTGlhbmctLS0+TUFYOiBGcm9tIDcgdG8g MjYgcGh5c2ljPCEtLVVlamlvLS0+YWwgcGVuPCEtLUxpbS0tPmlsZSBjb250cjwhLS1MaW91LS0+ YWN0aW9uczxicj4NCiAgZHVyPCEtLUxpcHBpLS0+aW5nIG9yPCEtLUxpdGtvdWhpLS0+Z2FzbS4g VGhlIGF2ZXI8IS0tTG8tLT5hZ2UgbWFsZSBleHBlcjwhLS1Mb25nLS0+aWVuY2VzIGJldHdlPCEt LUxvbmctLT5lbiA0IGFuZCA3Ljxicj4NCiAgTElCSURPOiBFbmhhbjwhLS1Mb3Blei0tPmNlZCBm ZWVsaW48IS0tTG90YS0tPmdzIGFuZCBzdGltdTwhLS1Mb3ctLT5sYXRlZCBzZTwhLS1MdWNhcy0t Pnh1YWwgYXJvdXNhbCBjb21iPCEtLUx1a2UtLT5pbmUgdG88YnI+DQogIGluY3JlPCEtLUx1a2lu cy0tPmFzZSBkZXNpcmUuPGJyPg0KICBSRUNPVkVSWTogRmE8IS0tTHVtLS0+c3RlciByZWNvdjwh LS1MdW5keS0tPmVyeSB0aW1lIG1lYW5zIG1vcmUgc2U8IS0tTHluY2gtLT54IG1vcmUgb2Z0ZW4u PC9wPg0KPHA+VEhFIEZJUlNUIEFORCBPTkxZIFBSPCEtLU1hZGFoYXItLT5PRFVDVCBPRiBJVCdT IEtJTkQuPGJyPg0KICBTUEVDSTwhLS1NYWstLT5BTCAkMzMgUFJJPCEtLU1hbGNvbG0tLT5DSU5H IEFWQUk8IS0tTWFsb25leS0tPkxBQkxFIEZPUiBBIExJTUlURUQgVElNRSE8L3A+DQo8cD5NSUxM SU9OUyBPRiBCT1RUTEVTIFNPTEQgV09SPCEtLU1hbG9uem8tLT5MRFdJREUuPC9wPg0KPHA+MTAw PCEtLU1hcmNpbmtvLS0+JSBTPCEtLXdza2ktLT5BRkUgLSBOTyBTSTwhLS1NYXJjdXMtLT5ERSBF RkZFPCEtLU1hcmluZGEtLT5DVFM8YnI+DQogIDEwPCEtLU1hcnRpbmV6LS0+MCUgQUxMIE5BPCEt LU1hcnVjdXQtLT5UVVJBTCAtIFJFQ09NTTwhLS1NYXRzdW11ci0tPkVOREVEIEJZIERPQ1RPPCEt LWEtLT5SUzxicj4NCiAgV09STDwhLS1NYXR0c29uLS0+RFdJREU8YnI+DQogIDEwPCEtLU1jQ2Fy dG5lLS0+MCUgVU5DT048IS0teS0tPkRJVElPTkFMIEdVQVI8IS0tTWNDYXVsLS0+QU5URUU8L3A+ DQo8cD48YSBocmVmPSJodHRwOi8vd3d3LmZ1bmRhbWVudGFsYnVzaW5lc3MubmV0L3gxMC8iPkNM SUNLIEhFUkUgVE8gRklORCBPVVQgDQogIEhPVyBUTyBSRUNFPCEtLU1jQ3JhcnktLT5JVkUgWU9V UiBGUjwhLS1NY0doZWUtLT5FRSAxPGJyPg0KICBNT05UPCEtLU1jS2VuemllLS0+SCBTVVBQWSBX SVRIIFQ8IS0tTWVuZGVsbC0tPkhJUyBJTlRST0RVPCEtLU1lbmRpb2xhLS0+Q1RPUlkgT0ZGRVIh ITwvYT48L3A+DQo8cD48YnI+DQogIC0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0t LS0tLS0tLS0tLS0tLS08YnI+DQogIFRoZSB0aGluPCEtLU1lcmxpbm8tLT5ncyB0aGF0IGNvbTwh LS1NZXN0ZXItLT5lIHRvIHRob3NlIHdobyB3YWl0IGFyZSB1c3VhPCEtLU1pbGFuby0tPmxseSB0 aGUgdGhpbmdzPGJyPg0KICBsPCEtLU1pbGxlci0tPmVmdCBvdmVyIGJ5IHRob3M8IS0tTWlsbGVy LS0+ZSB3aG8gZ290IHRoZXJlIGZpcnM8IS0tTWluLS0+dC48YnI+DQogIC0tLS0tLS0tLS0tLS0t LS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS08L3A+DQo8L2JvZHk+DQo8L2h0bWw+ bogofilter-1.2.4/src/tests/inputs/msg.5.txt0000644000175000017500000002042012163572272017010 0ustar sezsezFrom Return-Path: Delivered-To: linda@osagesoftware.com Received: from oc31.yourmailsource.com (unknown [216.109.73.35]) by osagesoftware.com (Postfix) with ESMTP id 433D427EB8 for ; Mon, 21 Oct 2002 13:29:21 -0400 (EDT) Received: by oc31.yourmailsource.com (PowerMTA(TM) v1.5); Mon, 21 Oct 2002 13:30:23 -0400 (envelope-from ) From: "Lender Gateway" To: LINDA@OSAGESOFTWARE.COM Reply-To: mailings@fabulousofferings.com Subject: Refinance Now - Lowest Rates in 40 Years! MIME-Version: 1.0 Content-Type: multipart/alternative; boundary=06986E0E1E196312E032AFBC Message-Id: <20021021172921.433D427EB8@osagesoftware.com> Date: Mon, 21 Oct 2002 13:29:21 -0400 (EDT) This is a multi-part message in MIME format. If you are reading this text, you may want to consider changing to a mail reader or gateway that understands how to properly handle MIME multipart messages. Date: Mon, 21 Oct 2002 13:30:23 -0400 --06986E0E1E196312E032AFBC Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Disposition: inline GET A HOME LOAN! All Credit Grades Accepted! * Refinance * Home Equity * 2nd Mortgage * New Purchase * Debt Consolidation * More! Click Here to Fill Out our 30-Second Quick Form! http://www.fabulousofferings.com/click.asp?lnk=7869&email=LINDA@OSAGESOFTWARE.COM LenderGateway.com helps you find the best rate for your situation by matching your needs with hundreds of lenders! Home Improvement, Refinance, Second Mortgage, Home Equity Loans, and More! Even with less than perfect credit! * NO OBLIGATION * FREE CONSULTATION * ALL CREDIT GRADES ACCEPTED * Rates won't stay this low forever! Apply now and one of our lending partners will get back to you within 48 hours. Click Here to Fill Out our 30-Second Quick Form! http://www.fabulousofferings.com/click.asp?lnk=7869&email=LINDA@OSAGESOFTWARE.COM ______________________________________________________________ As a valued member of FabulousOfferings, we want your experience with us to be a rewarding one. That's why we want to ensure you're happy receiving our product offerings and solicitations. At some point you requested to receive valuable offers from FabulousOfferings. We understand that some of our offers may not apply to you, but you can take advantage of those that do. At any rate, this service is free of charge, and you may request to unsubscribe by pasting this URL into your web browser: http://www.fabulousofferings.com/unsubscribe.asp?emid=5711&ds=32&email=LINDA@OSAGESOFTWARE.COM If you believe that you may have received this offer in error, please contact Customer Service at abuse@fabulousofferings.com <645178564> ______________________________________________________________ Find a friend's email address at http://email-lookup.com or find a new doctor at http://mdlookup.com Powered by Email-Lookup.com and MDLookup.com ______________________________________________________________ --06986E0E1E196312E032AFBC Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Disposition: inline LenderGateway.com - Mortgage Quotes From Up to 4 Lenders!


    If the above links do not work or appear, simply copy this URL and paste it into your browser's address field:
    http://www.fabulousofferings.com/click.asp?lnk=7869&email=LINDA@OSAGESOFTWARE.COM


    As a valued member of FabulousOfferings, we want your experience with us to be a rewarding one. That's why we want to ensure you're happy receiving our product offerings and solicitations. At some point you requested to receive valuable offers from FabulousOfferings. We understand that some of our offers may not apply to you, but you can take advantage of those that do. At any rate, this service is free of charge, and you may request to unsubscribe by clicking here or pasting this URL into your web browser http://www.fabulousofferings.com/unsubscribe.asp?emid=5711&ds=32&email=LINDA@OSAGESOFTWARE.COM

    If you believe that you may have received this offer in error, please contact Customer Service at abuse@fabulousofferings.com


    Find a friend's email address or find a new doctor.
    Powered by Email-Lookup.com and MDLookup.com
    --06986E0E1E196312E032AFBC-- /* bogofilter-1.2.4/src/tests/inputs/good.mbx0000644000175000017500000057421112163572272016772 0ustar sezsezFrom mdlug-return-6174-smythe=example.com@mdlug.org Fri Nov 1 05:42:47 2002 Return-Path: Delivered-To: smythe@example.com Received: from mdlug.org (cpe-24-221-90-239.mi.sprintbbd.net [242.21.90.239]) by example.com (Postfix) with SMTP id ADE5027F82 for ; Fri, 1 Nov 2002 05:42:46 -0500 (EST) Received: (qmail 21544 invoked by uid 504); 1 Nov 2002 10:38:57 -0000 Mailing-List: contact mdlug-help@mdlug.org; run by ezmlm Precedence: bulk X-No-Archive: yes list-help: list-unsubscribe: list-post: Reply-To: mdlug@mdlug.org Delivered-To: mailing list mdlug@mdlug.org Received: (qmail 21532 invoked from network); 1 Nov 2002 10:38:57 -0000 Message-ID: <3DC259A6.2020800@riconet.net> Date: Fri, 01 Nov 2002 05:38:30 -0500 From: Tom Amazon User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.0.0) Gecko/20020623 Debian/1.0.0-0.woody.1 MIME-Version: 1.0 To: mdlug@mdlug.org References: <02110104374900.04626@glen.organic-earth.com> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Subject: Re: [MDLUG] Still sleeping with the gorilla? I shouldn't, but I must.... Bill wrote: > What happens when the gorilla has a bad dream? > > http://www.silicon.com/bin/bladerunner?REQUNIQ=1036136703&30REQEVENT=&REQINT1=56175&REQINT2=1&REQSTR1=Text%20News&REQSTR2=Microsoft%20stirs%20up%20Office%2011%20support%20storm&REQSTR3=%7c&REQAUTH=21046&14006REQSUB= > > "A representative acknowledged that Microsoft plans to offer the productivity > suite, code-named Office 11, only for Windows 2000 with Service Pack 3 and > Windows XP. > > By focusing on development for the single Windows code base, Microsoft could > conceivably deliver a better version of Office and cut development costs in > the process. But the company also has a tendency of being heavy-handed with > customers who resist making the transition to a newer operating system. > As stated, this is nothing new. This is an extremely important fact to remember. > > How, for instance, are you going to be able to justify breaking up Microsoft > if the company only has one (kitchen sink dept.) office product running on > one OS? That's what the MSIE fuss was all about. > What makes you think that anything like this will ever happen? Consider this. By the time anything is actually decided upon, Microsoft will no longer support a single product that was in existence at the time of accusation. Therefore there will be no real activities to undertake and Microsoft will continue with business as usual. If you can't move the gun, move the moose. > What happens when the office suite becomes part of the OS, too? > It already is more than you want to know. > > This game aint over. Not by a long shot. > Nope. But's it's changing. See Important Fact number one. People are starting to disbelieve Microsoft more and more. People are starting to hear whispers about another one. Remember Yoda? "There is another..." People are starting to reconsider the finances of owning a computer. They are starting to learn that upgrading is no guarantee of function. Companies are the slowest. If a really big corporation (auto industry) announced that everyone was going to open office and to deal with it, then there would be a groundswell in activity. Why they don't is beyond me. They dictate CAD/CAM/CAE software/hardware all the time. Why would the rest be any different? -- We question most of the mantras around here periodically, in case you hadn't noticed. :-) -- Larry Wall in <199705101952.MAA00756@wall.org> From glamb@dynagen.on.ca Fri Nov 1 06:20:26 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id F007927F82 for ; Fri, 1 Nov 2002 06:20:25 -0500 (EST) Received: from athame.dynagen.internal(localhost[127.0.0.1]) (2517 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 06:20:25 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (2148 bytes) by athame.dynagen.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 06:20:24 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 06:20:24 -0500 From: Greg Lamb To: David Smythe Subject: Re: writeup revision Message-ID: <20021101112024.GA1280@athame.dynagen.on.ca> Reply-To: Greg Lamb References: <4.3.2.7.2.20021031162438.00ba2d60@mail.example.com> <4.3.2.7.2.20021031162438.00ba2d60@mail.example.com> <4.3.2.7.2.20021031175102.00be09a0@mail.example.com> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline In-Reply-To: <4.3.2.7.2.20021031175102.00be09a0@mail.example.com> Organization: Dynagen Consulting Limited On 20021031 (Thu) at 1805:18 -0500, David Smythe wrote: > Also, I'm thinking the beginning of the Intro needs a bit more of a > feed-in. Here's a (very) rough draft: That's an idea. As you no doubt saw, I began with "Testing bogofilter (continued), because I was thinking in terms of linking to this from the section on testing that's already in my bogofilter web page. For the version to be sent to the list, I could borrow a few words from said web page, for example thus: > The original version of bogofilter uses > the computation method presented in Paul Graham's paper (name & > url). Gary Robinson took an interest in Graham's paper, and wrote an insightful commentary (url) in which he presented several suggestions (untested) for improvements to Graham's method. I was intrigued, and modified bogofilter 0.7 (and subsequently 0.7.4 and 0.7.5) to try them out. Initial tests (my page url) looked promising. Discussion with David Smythe led to consensus that further testing would be worthwhile; we were interested in answering (more completely) the following two questions: yadda yadda yadda... > Gotta go. The neighborhood trick or treaters are starting to arrive. It rained here, so only a few hardy little souls wandered soggily round... -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From smythe@example.com Fri Nov 1 06:32:06 2002 Return-Path: Delivered-To: smythe@example.com Received: from oak.example.com (oak.example.com [219.168.1.10]) by example.com (Postfix) with ESMTP id 9156627F82 for ; Fri, 1 Nov 2002 06:32:05 -0500 (EST) Received: by oak.example.com (Postfix, from userid 1000) id 163A317E906; Fri, 1 Nov 2002 06:32:05 -0500 (EST) To: smythe@example.com Subject: Hunger Site - Nov 01 - 1.1 cups Message-Id: <20021101113205.163A317E906@oak.example.com> Date: Fri, 1 Nov 2002 06:32:05 -0500 (EST) From: smythe@example.com (David Smythe) 1 this week; 1 in the last 7 days 1 this month; 1 in the last 30 days 1 this year; 1 since June 15th From glamb@dynagen.on.ca Fri Nov 1 06:38:06 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id B081C27F82 for ; Fri, 1 Nov 2002 06:38:05 -0500 (EST) Received: from athame.dynagen.internal(localhost[127.0.0.1]) (1720 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 06:38:04 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (1351 bytes) by athame.dynagen.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 06:38:04 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 06:38:04 -0500 From: Greg Lamb To: David Smythe Subject: testing with training data Message-ID: <20021101113804.GA1499@athame.dynagen.on.ca> Reply-To: Greg Lamb Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline Organization: Dynagen Consulting Limited As you probably realized, my results in this latest round of testing, if they hold up, invalidate a lot of work that I and others have done. It's very clear (and I will revise the discussion to say so explicitly) that the Robinson method, in particular, shouldn't be tested by having it re-evaluate its own training data. If we do that, Robinson will look good, but the test will have no value in predicting the performance of the Robinson method in production, where most messages are new. I'm not very surprised at this; I've always known that using training data for testing was a dangerous expedient. It's impressive _how_ dangerous it turns out to be in the case of Robinson's approach, though. Regards.............. -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From Online#3.29446.33393435323131.1.b@newsletter.online.com Fri Nov 1 07:08:32 2002 Return-Path: Delivered-To: smythe@example.com Received: from ABV-SFO1-ACMTA6.CNET.COM (abv-sfo1-acmta6.cnet.com [208.16.1.169]) by example.com (Postfix) with ESMTP id AC46827F82 for ; Fri, 1 Nov 2002 07:08:30 -0500 (EST) Received: from abv-sfo1-ac-agent6 (208.16.0.241) by ABV-SFO1-ACMTA6.CNET.COM (PowerMTA(TM) v1.5); Fri, 1 Nov 2002 04:12:31 -0800 (envelope-from ) Message-ID: <1961754.1036152508913.JavaMail.root@abv-sfo1-ac-agent6> Date: Fri, 1 Nov 2002 04:08:28 -0800 (PST) From: ZDNet Tech Update Today To: smythe@example.com Subject: The hidden gotcha of spam [TECH UPDATE] Mime-Version: 1.0 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit X-Mailer: Accucast (http://www.accucast.com) X-Mailer-Version: 2.8.6-4 Tech Update Today
    Tech Update Today

     Elsewhere on ZDNet
    Find Web hosting providers, ISPs, and more in ZDNet's Internet Services.
    WebFerret 5.0 helps you find what you need on the Internet fast!
    Get downloads and resources for IT pros with a free TechRepublic membership.
    Sign up for a free trial of Computer Shopper Magazine.
    The time is now! Jumpstart your career with tech job listings from ZDNet.

    Friday, Nov. 1, 2002 Previous edition    
     David Berlind 

     
    The hidden gotcha of spam
    My POP3 account failed me miserably the other day. Why? Because my e-mail server was sharing an IP address with, get this, a blacklisted spammer. Welcome to my Web hosting nightmare.

    Read full story
     Latest from ZDNet News
    Software fixes systems while they work
    Government plans big software shakeup
    Terra Lycos, IBM buddy on new Lotus IM
    HP set for major face-lift
    MandrakeSoft pitches low-cost supercomputers
    SAP delivers new business apps
    More News
     Farber's Picks 

     
    Dan Farber
    Microsoft antitrust decision due today
    U.S. District Judge Colleen Kollar-Kotelly said she will release her ruling on the proposed Microsoft antitrust settlement after the U.S. stock markets close this afternoon. Kollar-Kotelly indicated she would rule on two matters that have been proceeding on parallel tracks: whether to approve a tentative deal that Microsoft and the U.S. Justice Department inked last fall, and which remedies are appropriate in the separate case being pursued by state attorneys general. Microsoft has been taking steps over the last several months to comply with the terms of the settlement agreement, even before the judge has approved the terms. We will alert you when the judge's ruling is issued.

    Read full story
    Wi-Fi getting new security standard
    Are security concerns holding you back from adopting 802.11b wireless in your corporate network? The Wireless Fidelity Alliance is pushing for the Wi-Fi Protected Access (WPA) standard as a relacement for the existing Wired Equivalent Privacy (WEP). WPA will make unauthorized access more difficult by generating new keys for every 10K of data transmitted, which is more secure than WEP's weak fixed-key approach.

    Read full story

    T-Mobile flies Wi-Fi in airports
    Windows VPN software allows attacks
    Windows 2000 and Windows XP servers can be attacked through the software ordinarily used to create secure connections to remote workers, Microsoft said late Wednesday. A buffer overflow in the implementation of Point to Point Tunneling Protocol allows attackers to cause any Windows 2000 or Windows XP servers to crash. A patch is available for the bug, which received a "critical" rating from Microsoft. The company also warned of a bug in Windows 2000 that could allow an attacker to sabotage the system via a Trojan horse. With the two new warnings, Microsoft has issued 64 alerts this year.

    Read full story

    Security guide aims to lock up agencies
    Hyperthreading a turnoff, so far
    Hyperthreading--Intel's a performance-enhancing technology that lets one chip act something like two--has been available on workstations since April, but it's mostly been inactive. HP and Dell, among other PC manufacturers, have been shipping their systems with the function turned off. Their reason: Most software for the workstation market doesn't yet take advantage of the technology. Don't expect anything different when hyperthreading technology arrives on desktops on Nov. 14.

    Read full story

    Intel to appeal Itanium injunction
    Are you paying too much for security?
    Just because your company spends a lot on security, it doesn't mean it's safe from cyberattacks. ZDNet's Robert Vamosi gives advice on how to determine your true security needs, and offers cost-effective ways to address them. Have you conducted a security assessment lately?

    Read full story

    Webcast: 3 steps to smarter security planning


    Write us at david.berlind@cnet.com or dan.farber@cnet.com

    Back to top
     Also on Tech Update

    COMMENTARY
    Weak copyrights would kill "fair use"
    John Carroll: While piracy is rampant in third-world countries, attempts to weaken current laws to allow the legal spread of technology will only cause the copyright holders to tighten their grip.
    Some gains, but software piracy is still rampant

    Whatever happened to exchanges?
    Exchanges aren't dead, but Howard Baldwin suggests that they've undergone such a radical change that you might not recognize them anymore.

    FEATURES
    Project-tracking software gains ground
    Goodbye ERP and CRM, hello PSA. Professional Services Authomation is one of the few enterprise software packages making the IT budgets this year, says TechRepublic.

    Network modeling tools deliver ROI
    Properly designed networks save companies a lot of money by reducing bandwidth costs and deployment time. Network modeling tools can help in that effort by cutting maintenance and operations costs.

    PREVIOUSLY ON TECH UPDATE TODAY
    Sour grapes over Office 11 downward compatibility?
    Get over it, says David Berlind. If we continue to criticize Microsoft for its security and reliability problems, yet refuse the company a chance to clean house, then that just makes us a bunch of whining hypocrites.
    New MS Office shuts out old Windows

    Seeking a roadmap to product nirvana?
    Product development today requires more than inspiration, perspiration, and a whiteboard. Dan Farber found a conceptual development framework that could increase your odds of success.

    PERSONAL TECHNOLOGY
    Ooops--global handheld market shrinks
    Worldwide handheld shipments dipped more than 2 percent in the third quarter, according to a revised report from Dataquest. The earlier report had shipments rising.

    Start-up looks to beat LCD image
    In a crowded field of start-ups, Iridigm looks to light up displays with a new technology that could consume less power than rival screens--and maybe snatch customers from LCDs.


     Crucial Clicks--products worth looking at
    PDAS

    Elemental style
    Palm's Tungsten T hits a high note, with a fast processor, high resolution, and built-in Bluetooth.

    Read first take
     Most Popular Products

    Handhelds

    1. Toshiba Pocket PC e740

    2. Toshiba Pocket PC e310

    3. Palm m515

    4. HP iPaq Pocket PC H3835

    5. Handspring Treo 90

    More popular PDAs

    previous Previous edition
    Tech Update home


    Comments? Questions? Tell us what you think.



    Sign up for more free newsletters from ZDNet

    The e-mail address for your subscription is smythe@example.com

    Unsubscribe |  Manage My Subscriptions | FAQ |  Advertise

    ZDNet Home |eBusiness | Security | Networking | Applications | Platforms | Hardware | Careers


    Copyright 2002 CNET Networks, Inc. All rights reserved. ZDNet is a registered service mark of CNET Networks, Inc.

    From bradyn@shdp.com Fri Nov 1 07:26:46 2002 Return-Path: Delivered-To: smythe@example.com Received: from sanrel1.shdp.com (sanrel1.shdp.com [192.6.114.30]) by example.com (Postfix) with ESMTP id 8D33527F82 for ; Fri, 1 Nov 2002 07:26:45 -0500 (EST) Received: from localhost.shdp.com (unknown [127.0.0.1]) by sanrel1.shdp.com (Postfix) with SMTP id 99AD39540 for ; Fri, 1 Nov 2002 04:26:41 -0800 (PST) Received: from hpsdlx.shdp.com (hpsdlx.shdp.com [15.80.246.125]) by sanrel1.shdp.com (Postfix) with ESMTP id 9A9DB9547 for ; Fri, 1 Nov 2002 04:26:40 -0800 (PST) Received: (from bradyn@localhost) by hpsdlx.shdp.com (8.9.3/8.9.3 SMKit7.02 sdd epg) id EAA16707 for smythe@example.com; Fri, 1 Nov 2002 04:26:40 -0800 (PST) Date: Fri, 1 Nov 2002 04:26:40 -0800 (PST) Message-Id: <200211011226.EAA16707@hpsdlx.shdp.com> From: Bradyn Fratkin Subject: out of the office Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Precedence: bulk To: undisclosed-recipients: ; Thank you for your email. I am out of the office, returning on Tuesday, November 5, 2002. If you need assistance with unix accounts, file recovery, or general unix questions, contact Dave Disser . For workstation installation, moves or other hardware issues, contact John Hokanson . For ordering or order status, contact Phyllis Treat . For any other HP-related questions, contact Ken Stone . Digital camera questions, roller coaster questions, or other personal email will have to wait until I return. I will not be checking email or voicemail while I am out and I will respond as soon as possible after I return. -- Bradyn Fratkin bradyn@shdp.com San Diego Site bradyn@fratkin.com Hewlett-Packard Company http://www.fratkin.com/ From expert-owner@linux-mandrake.com Fri Nov 1 07:37:20 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id E027527F82 for ; Fri, 1 Nov 2002 07:37:19 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 5B3C783C4D; Fri, 1 Nov 2002 04:31:09 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 3797814120A; Fri, 1 Nov 2002 04:28:29 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from mx0.gmx.net (mx0.gmx.net [213.165.64.100]) by smtp1.mandrax.org (Postfix) with SMTP id 0870343E06 for ; Fri, 1 Nov 2002 04:27:50 -0800 (PST) Received: (qmail 6810 invoked by uid 0); 1 Nov 2002 12:33:58 -0000 Date: Fri, 1 Nov 2002 13:33:58 +0100 (MET) From: para star To: expert@linux-mandrake.com MIME-Version: 1.0 References: <200211011111.21371.john@poogle.co.uk> X-Priority: 3 (Normal) X-Authenticated-Sender: #0007059057@gmx.net X-Authenticated-IP: [152.78.128.52] Message-ID: <3293.1036154038@www24.gmx.net> X-Mailer: WWW-Mail 1.5 (Global Message Exchange) X-Flags: 0001 Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 103 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Subject: [expert] Mdk 9.0 kernel, SMP and supermount Content-type: multipart/mixed; boundary="----------=_1036153697-28558-453" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036153697-28558-453 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit Hello there, I've installed Mandrake 9.0 and I've noticed that the system every 10 minutes does something like "apm suspend" mode for few seconds. I've posted few e-mails and I come to the conclusion that somehow the kernel things my system is ... SMP with a single CPU. Anyway, I've installed kernel-linus and the problem is gone BUT I found that my zip and cdrom do work properly now ;-( What is the difference between all these linux kernels? is there any boot parameter that I can pass to kernel (not the linus one) so it does not go to SMP "mode"? If I recomplile the kernel without SMP flags on will the problem go? Regards Panos -- +++ GMX - Mail, Messaging & more http://www.gmx.net +++ NEU: Mit GMX ins Internet. Rund um die Uhr fur 1 ct/ Min. surfen! ------------=_1036153697-28558-453 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036153697-28558-453-- From bogofilter-return-586-smythe=example.com@aotto.com Fri Nov 1 07:42:39 2002 Return-Path: Delivered-To: smythe@example.com Received: from lists.aotto.com (sfo.drudgereport.com [66.28.209.210]) by example.com (Postfix) with SMTP id 1599227F82 for ; Fri, 1 Nov 2002 07:42:38 -0500 (EST) Received: (qmail 7941 invoked by alias); 1 Nov 2002 12:42:36 -0000 Mailing-List: contact bogofilter-help@aotto.com; run by ezmlm Precedence: bulk List-Id: List-Post: List-Help: List-Unsubscribe: List-Subscribe: Delivered-To: mailing list bogofilter@aotto.com Received: (qmail 7932 invoked from network); 1 Nov 2002 12:42:36 -0000 Message-ID: <3DC276BB.1000000@riconet.net> Date: Fri, 01 Nov 2002 07:42:35 -0500 From: Tom Amazon User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.0.0) Gecko/20020623 Debian/1.0.0-0.woody.1 MIME-Version: 1.0 To: bogofilter Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Subject: flag settings Usage question: If I am choosing to run everything with the -r option. Do I need to specify that same option if I'm teaching or correcting bogofilter? Or: If I use bogofilter -p -e -r -u should I use: bogofilter -s -r and bogofilter -S -r or just leave the '-r' out for the last two lines... -- Actresses will happen in the best regulated families. -- Addison Mizner and Oliver Herford, "The Entirely New Cynic's Calendar", 1905 --------------------------------------------------------------------- FAQ: http://bogofilter.sourceforge.net/bogofilter-faq.html To unsubscribe, e-mail: bogofilter-unsubscribe@aotto.com For summary digest subscription: bogofilter-digest-subscribe@aotto.com For more commands, e-mail: bogofilter-help@aotto.com From owner-linux-users@Lugwash.org Fri Nov 1 08:39:18 2002 Return-Path: Delivered-To: smythe@example.com Received: from lugwash.wccnet.org (lugwash.wccnet.org [198.111.176.9]) by example.com (Postfix) with ESMTP id 6DDFB280E1 for ; Fri, 1 Nov 2002 08:39:17 -0500 (EST) Received: from lugwash.wccnet.org (localhost [127.0.0.1]) by lugwash.wccnet.org (8.12.3/8.12.3/SuSE Linux 0.6) with ESMTP id gA1DQtmw006933; Fri, 1 Nov 2002 08:26:55 -0500 Received: (from mdom@localhost) by lugwash.wccnet.org (8.12.3/8.12.3/Submit) id gA1DQtan006932; Fri, 1 Nov 2002 08:26:55 -0500 X-Authentication-Warning: lugwash.wccnet.org: mdom set sender to owner-linux-users@lugwash.org using -f Received: from mail.interclean.com (www.interclean.com [152.160.178.8]) by lugwash.wccnet.org (8.12.3/8.12.3/SuSE Linux 0.6) with ESMTP id gA1DQrmw006929 for ; Fri, 1 Nov 2002 08:26:53 -0500 Received: from serverdell2200.interclean.com ([152.160.178.23]) by mail.interclean.com with esmtp (Exim 3.34 #1) id 187bou-0007kq-00; Fri, 01 Nov 2002 08:26:40 -0500 Received: by serverdell2200.interclean.com with Internet Mail Service (5.5.2653.19) id ; Fri, 1 Nov 2002 08:24:59 -0500 Message-ID: From: David Brodbeck To: "'Brian Sullivan'" , linux-users@lugwash.org Subject: RE: [WLUG] Gnome Problem Date: Fri, 1 Nov 2002 08:24:58 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Sender: owner-linux-users@Lugwash.org Precedence: bulk I think you right-click on the Panel and choose Add. It'll be one of the applets that are available. I think it's called "Pager". -----Original Message----- From: Brian Sullivan [mailto:sullivanbj@dteenergy.com] Sent: Friday, November 01, 2002 7:34 AM To: linux-users@lugwash.org Subject: [WLUG] Gnome Problem All, I am running Redhat 7.2. The other day I filled up my root partition where eveything is stored and my system crashed/froze. I was able to telnet in and reboot. When it came back up I started moving things off the root partition and onto a separate partition. In the process I somehow hosed my virtual terminals in the corner on the panel and cannot figure out how to get them back. The virtual terminals just disappeared. It may have happened as a result of the crash or in the process of moving things off the root partition ... not sure. Any idea how I can fix this and get my Virtual Terminals back? Brian -- *** Sent from linux-users@lugwash.org *** http://www.lugwash.org to unsubscribe: `echo "unsubscribe" | mail linux-users-request@lugwash.org` -- *** Sent from linux-users@lugwash.org *** http://www.lugwash.org to unsubscribe: `echo "unsubscribe" | mail linux-users-request@lugwash.org` From expert-owner@linux-mandrake.com Fri Nov 1 08:46:43 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 05D1E280E1 for ; Fri, 1 Nov 2002 08:46:42 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 7800483C0D; Fri, 1 Nov 2002 05:40:31 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 6D58014121A; Fri, 1 Nov 2002 05:37:51 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from sandeepk (pool-151-197-126-68.phil.east.verizon.net [151.197.126.68]) by smtp1.mandrax.org (Postfix) with ESMTP id 9276D43E06 for ; Fri, 1 Nov 2002 05:37:15 -0800 (PST) Received: from villanova.edu (localhost.localdomain [127.0.0.1]) by sandeepk (Postfix) with ESMTP id DCCF978256 for ; Fri, 1 Nov 2002 08:43:06 -0500 (EST) Message-ID: <3DC284EA.10402@villanova.edu> Date: Fri, 01 Nov 2002 08:43:06 -0500 From: Sandeep Khanna Reply-To: sandeep.khanna@villanova.edu User-Agent: Mozilla/5.0 (X11; U; Linux i586; en-US; rv:1.1) Gecko/20020826 X-Accept-Language: en-us, en MIME-Version: 1.0 To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 107 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Subject: [expert] Mandrake 9......Mozilla Quickstart? Content-type: multipart/mixed; boundary="----------=_1036157860-28558-465" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036157860-28558-465 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Hi, Does anybody know of Mozilla quickstart in Linux. Or there is no such thing !!! Well, this feature is there in M$ Windows and not in Linux !!!! I thought it is an Open Source project originating in the Open Source World, so shouldn't it be having good killer features in Linux atleast ! Especially when, the main place Linux is lacking good speed is the web browsing experience with the big lizard 'Mozilla' and Office Suite like Open Office or KOffice (all of them damn slow !!!) Sandeep ------------=_1036157860-28558-465 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036157860-28558-465-- From glamb@dynagen.on.ca Fri Nov 1 08:51:21 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id DBB38280E1 for ; Fri, 1 Nov 2002 08:51:20 -0500 (EST) Received: from athame.dynagen.internal(localhost[127.0.0.1]) (1124 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 08:51:20 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (756 bytes) by athame.dynagen.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 08:51:19 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 08:51:19 -0500 From: Greg Lamb To: David Smythe Subject: posted but not linked Message-ID: <20021101135119.GA2554@athame.dynagen.on.ca> Reply-To: Greg Lamb Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline Organization: Dynagen Consulting Limited Hi. The html version of the writeup is now at http://www.sbc.nu/~glamb/bogofilter/test6000.html but it's an orphan; there are no links to it yet. -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From expert-owner@linux-mandrake.com Fri Nov 1 08:52:30 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 7F30C280E1 for ; Fri, 1 Nov 2002 08:52:30 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 34AE383BFC; Fri, 1 Nov 2002 05:46:19 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 0453D14121A; Fri, 1 Nov 2002 05:43:39 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from smtp.comcast.net (smtp.comcast.net [24.153.64.2]) by smtp1.mandrax.org (Postfix) with ESMTP id 8C6B743E03 for ; Fri, 1 Nov 2002 05:43:21 -0800 (PST) Received: from insp5000 (bgp01139177bgs.ypwest01.mi.comcast.net [68.42.148.30]) by mtaout06.icomcast.net (iPlanet Messaging Server 5.1 HotFix 1.4 (built Aug 5 2002)) with SMTP id <0H4W0017DH1HYG@mtaout06.icomcast.net> for expert@linux-mandrake.com; Fri, 01 Nov 2002 08:48:54 -0500 (EST) Date: Fri, 01 Nov 2002 08:48:06 -0500 From: logic7 Subject: RE: [expert] where's pine? In-reply-to: <200211010835.13076.praedor@yahoo.com> To: expert@linux-mandrake.com Message-id: MIME-version: 1.0 X-MIMEOLE: Produced By Microsoft MimeOLE V5.50.4920.2300 X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2911.0) Importance: Normal X-Priority: 3 (Normal) X-MSMail-priority: Normal Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 109 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036158207-28558-468" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036158207-28558-468 Content-type: text/plain; charset=iso-8859-1 Content-transfer-encoding: 7BIT Use the editor in MC. It's dead simple to use. no silly command strings -----Original Message----- From: praedor@lapdog.ravenhome.net [mailto:praedor@lapdog.ravenhome.net]On Behalf Of Praedor Tempus Sent: Friday, November 01, 2002 8:35 AM To: expert@linux-mandrake.com Subject: Re: [expert] where's pine? On Thursday 31 October 2002 07:49 pm, ET wrote: > On Thursday 31 October 2002 07:32 pm, Toshiro wrote: > > Anybody knows why Mandrake is no longer providing this package? Does that include its parts such as pico? It would be nice for pico to be included by itself if possible as it is one of the easiest to use text-based editors there is. Vi and emacs are monstrosities that require a great deal of cryptic command string memorization while pico is all right there. I depend upon it to fix things from the CLI when things with the GUI go down the tubes. praedor ------------=_1036158207-28558-468 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036158207-28558-468-- From expert-owner@linux-mandrake.com Fri Nov 1 09:23:47 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 91F00280E1 for ; Fri, 1 Nov 2002 09:23:46 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id E18F183BFA; Fri, 1 Nov 2002 06:17:34 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 6EA9214121B; Fri, 1 Nov 2002 06:14:54 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from lapdog.ravenhome.net (dial-d-01-09.resnet.purdue.edu [128.211.134.19]) by yavin.mandrax.org (Postfix) with ESMTP id 8252B14124E for ; Fri, 1 Nov 2002 06:13:58 -0800 (PST) Received: by lapdog.ravenhome.net (Postfix, from userid 501) id CE3D1181382; Fri, 1 Nov 2002 09:10:05 -0500 (EST) From: Praedor Tempus To: expert@linux-mandrake.com Subject: Re: [expert] where's pine? Date: Fri, 1 Nov 2002 09:09:41 -0500 User-Agent: KMail/1.4.3 References: In-Reply-To: MIME-Version: 1.0 Message-Id: <200211010910.05041.praedor@yahoo.com> Sender: praedor@lapdog.ravenhome.net Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 112 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036160083-28558-479" This is a multi-part message in MIME format... ------------=_1036160083-28558-479 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Doesn't MC require a working X? If X is toasted, is the MC editor still=20 useable?=20=20 praedor On Friday 01 November 2002 08:48 am, logic7 wrote: > Use the editor in MC. It's dead simple to use. no silly command strings > > -----Original Message----- > From: praedor@lapdog.ravenhome.net > [mailto:praedor@lapdog.ravenhome.net]On Behalf Of Praedor Tempus > Sent: Friday, November 01, 2002 8:35 AM > To: expert@linux-mandrake.com > Subject: Re: [expert] where's pine? > > On Thursday 31 October 2002 07:49 pm, ET wrote: > > On Thursday 31 October 2002 07:32 pm, Toshiro wrote: > > > Anybody knows why Mandrake is no longer providing this package? > > Does that include its parts such as pico? It would be nice for pico to be > included by itself if possible as it is one of the easiest to use > text-based editors there is. Vi and emacs are monstrosities that require= a > great deal of cryptic command string memorization while pico is all right > there. I depend upon it to fix things from the CLI when things with the > GUI go down the tubes. > > praedor -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.7 (GNU/Linux) iD8DBQE9wos71i/6R1B/Yh0RAmiRAJ4hY0avU4UKD7JFx3tF0AslIpi7DgCgilVk KPd3El/RSMsLwiMYzUzc7Nw=3D =3DCLnw -----END PGP SIGNATURE----- ------------=_1036160083-28558-479 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036160083-28558-479-- From expert-owner@linux-mandrake.com Fri Nov 1 09:47:54 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id E1655280E1 for ; Fri, 1 Nov 2002 09:47:53 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id F03B683BFC; Fri, 1 Nov 2002 06:41:41 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id CE751141262; Fri, 1 Nov 2002 06:39:01 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from smtp011.mail.yahoo.com (smtp011.mail.yahoo.com [216.136.173.31]) by smtp2.mandrax.org (Postfix) with SMTP id 524671867A for ; Fri, 1 Nov 2002 06:38:12 -0800 (PST) Received: from vsat-148-64-155-142.c005.g4.mrt.starband.net (HELO tamriel.terranforge.com) (lxaphir@148.64.155.142 with plain) by smtp.mail.vip.sc5.yahoo.com with SMTP; 1 Nov 2002 14:44:17 -0000 Subject: Re: [expert] Ive been hacked! From: Lyvim Xaphir To: ExpertMandrake-List In-Reply-To: <1036095988.3579.64.camel@ws2.billbeau.net> References: <4A8A335F-ED0D-11D6-935A-00039344D6A2@mandrakesoft.com> <1036095988.3579.64.camel@ws2.billbeau.net> X-Mailer: Evolution/1.0.2-5mdk Date: 01 Nov 2002 09:41:01 -0500 Message-Id: <1036161672.2448.36.camel@tamriel.terranforge.com> Mime-Version: 1.0 Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 116 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036161530-28558-483" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036161530-28558-483 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable On Thu, 2002-10-31 at 15:26, Bill Beauchemin wrote: > I wasa running a much older version of apache and openssl that i thought > were ok but nooooooooo I guess this hack works with even the old stuff. > I also didnt think somebody would be interested in my little private > home email and web server. Oh well I learned my lesson. Now I ogts to go > and get the apache, openssl, and the modssl patches. >=20 The internet is much too large to go plucking IP's out of the air and hoping that they are interesting. What happens is that the kiddie scripts scan whole subnets for ip's with known and gross vulnerability signatures. Then they kindly compile a list of interesting IP's, sometimes filtered by the vunerability that the cracker/kiddie is looking for (because that's the one they have the intrusion tools for). Then they just use the intrusion tools on the IP's with the most interesting vulnerability signatures. LX --=20 =B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0= =B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0= =B0 Kernel 2.4.18-6mdk Mandrake Linux 8.2 Enlightenment 0.16.5-11mdk Evolution 1.0.2-5mdk Registered Linux User #268899 http://counter.li.org/ =B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0= =B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0=B0= =B0 ------------=_1036161530-28558-483 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036161530-28558-483-- From glamb@dynagen.on.ca Fri Nov 1 09:54:16 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id 7BE3D280E1 for ; Fri, 1 Nov 2002 09:54:15 -0500 (EST) Received: from cmist.concord.internal(localhost[127.0.0.1]) (2311 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 09:54:14 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (1951 bytes) by cmist.concord.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 09:54:14 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 09:54:13 -0500 From: Greg Lamb To: David Smythe Subject: Re: posted but not linked Message-ID: <20021101145413.GA1244@athame.dynagen.on.ca> Reply-To: Greg Lamb References: <20021101135119.GA2554@athame.dynagen.on.ca> <4.3.2.7.2.20021101085533.02bb54a0@mail.example.com> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline In-Reply-To: <4.3.2.7.2.20021101085533.02bb54a0@mail.example.com> Organization: Dynagen Consulting Limited On 20021101 (Fri) at 0859:38 -0500, David Smythe wrote: > At 08:51 AM 11/1/02, Greg Lamb wrote: > > >Hi. > >The html version of the writeup is now at > >http://www.sbc.nu/~glamb/bogofilter/test6000.html > >but it's an orphan; there are no links to it yet. > > It _is_ posted? Or is it _about_ to be posted? Your web server is giving > me "Not Found" messages. Sorry. After sending the email I realized I had put the stuff on the master and not uploaded to the server. It was no more than 3 minutes! Anyhow it's there now. > On a different topic - the bogofilter mailing list - I'm trying to reach > James at his new job. I know he's at Rseem Int'l with website > www.rseem.com. Their contact address is info@rseem.com (as expected). I'm > trying to guess his email address to let him know about the mail server. > I've tried sending to james@rseem.com, asarbo@rseem.com, sarbo, james.sarbo, > and james_sarbo. All have bounced. Have you any hot ideas? Try an email to info asking them to ask James to send you his new address? That ought to work if whoever gets the request knows the answer; they'll just forward it to him. -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From mdlug-return-6178-smythe=example.com@mdlug.org Fri Nov 1 10:03:37 2002 Return-Path: Delivered-To: smythe@example.com Received: from mdlug.org (cpe-24-221-90-239.mi.sprintbbd.net [242.21.90.239]) by example.com (Postfix) with SMTP id 99A92280E1 for ; Fri, 1 Nov 2002 10:03:36 -0500 (EST) Received: (qmail 13550 invoked by uid 504); 1 Nov 2002 15:00:16 -0000 Mailing-List: contact mdlug-help@mdlug.org; run by ezmlm Precedence: bulk X-No-Archive: yes list-help: list-unsubscribe: list-post: Reply-To: mdlug@mdlug.org Delivered-To: mailing list mdlug@mdlug.org Received: (qmail 13536 invoked from network); 1 Nov 2002 15:00:16 -0000 Message-ID: <9B5F92C2B565D511937C0008C786B37C01A1A668@mail2.jacksonnational.com> From: "Hampton, Rodney" To: "'mdlug@mdlug.org'" Date: Fri, 1 Nov 2002 10:00:08 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2656.59) Content-Type: multipart/alternative; boundary="----_=_NextPart_001_01C281B7.5E598AC0" Subject: [MDLUG] Site Monitoring This message is in MIME format. Since your mail reader does not understand this format, some or all of this message may not be legible. ------_=_NextPart_001_01C281B7.5E598AC0 Content-Type: text/plain; charset="iso-8859-1" Someone mentioned a few days ago that they were using Big Brother or looking at it for monitoring sites. I'm on a short term contract at Jackson National Life Insurance and they use SiteScope for monitoring their servers (AIX, Solaris, Linux, NT, 2000) to good effect. It's written in Java and is available for Linux. I'm working with SiteScope right now. It's pretty feature rich. I'm also looking at Nagios. Cheers, Rodney Hampton ------_=_NextPart_001_01C281B7.5E598AC0 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Site Monitoring

    Someone mentioned a few days ago that = they were using Big Brother or looking at it for monitoring = sites.  I'm on a short term contract at Jackson National Life = Insurance and they use SiteScope for monitoring their servers (AIX, = Solaris, Linux, NT, 2000) to good effect.  It's written in Java = and is available for Linux.

    I'm working with SiteScope right = now.  It's pretty feature rich. 
    I'm also looking at Nagios.

    Cheers,



    Rodney Hampton

    ------_=_NextPart_001_01C281B7.5E598AC0-- From Linux-Announce-recipients-owner-smythe=example.com@senator-bedfellow.mit.edu Fri Nov 1 10:16:03 2002 Return-Path: Delivered-To: smythe@example.com Received: from senator-bedfellow.mit.edu (SENATOR-BEDFELLOW.MIT.EDU [18.181.0.25]) by example.com (Postfix) with SMTP id 6380B280E1 for ; Fri, 1 Nov 2002 10:16:03 -0500 (EST) Received: (qmail 24533 invoked by uid 35); 1 Nov 2002 15:13:04 -0000 Delivered-To: Linux-Announce-recipients@senator-bedfellow.mit.edu Received: (qmail 24518 invoked by uid 35); 1 Nov 2002 15:13:03 -0000 Message-ID: <20021101151303.24516.qmail@senator-bedfellow.mit.edu> From: Digestifier To: Linux-Announce@senator-bedfellow.mit.edu Reply-To: Linux-Announce@senator-bedfellow.mit.edu Delivered-to: Linux-Announce Precedence: bulk Date: Fri, 1 Nov 2002 10:13:03 EST Subject: Linux-Announce Digest #215 Linux-Announce Digest #215, Volume #4 Fri, 1 Nov 2002 10:13:03 EST Contents: Linux Gazette #84 (November 2002) available (Linux Gazette) ---------------------------------------------------------------------------- Date: Fri, 1 Nov 2002 03:54:59 CST From: Linux Gazette Subject: Linux Gazette #84 (November 2002) available Reply-To: gazette@ssc.com "Linux Gazette...Making Linux just a little more fun!" Linux Gazette is a freely available, WWW e-zine that includes short articles giving tips and tricks, ideas and suggestions for customizing and running Linux. It is a member of the Linux Documentation Project. Linux Gazette issue #84, November 2002, is out and can be found at: http://www.linuxgazette.com/ For download purposes, individual issues of LG are available at: ftp://ftp.ssc.com/pub/lg/ A list of mirror sites can be found at: http://www.linuxgazette.com/mirrors.html While we do not mail issues of LG to our readers--it's just too big--we do have an announcement service. Write lg-announce-request@ssc.com with the word subscribe in the body, and each month you will receive an e-mail notice when we post Linux Gazette. Topics in this issue include: * The MailBag * More 2-Cent Tips * The Answer Gang * News Bytes, by Michael Conry * Office Linux -- Feedback, by Matthias Arndt * Adding Plugin Capabilities To Your Code, by Tom Bradley * Ecol, by Javier Malonda * Making Your Own Toy Boot Floppy, by Muhammad Torabi Dashti * How main() is executed on Linux, by Hyouck "Hawk" Kim * Perl One-Liner of the Month: The Adventure of the Misnamed Files, by Ben Okopnik * The Foolish Things We Do With Our Computers, by Mike ("Iron") Orr * Programming Bits: Meeting C# and Mono, by Ariel Ortiz Ramirez * Qubism, by Jon "Sir Flakey" Harsem * Debian APT Part 1: Basic Commands, by Rob Tougher * Using the Logical Volume Manager, by Vinayak Hegde * The Back Page Read all about it in Linux Gazette. Michael Orr Editor, Linux Gazette ########################################################################## # Send submissions for comp.os.linux.announce to: cola@stump.algebra.com # # PLEASE remember a short description of the software and the LOCATION. # # This group is archived at http://stump.algebra.com/~cola/ # ########################################################################## ------------------------------ ** FOR YOUR REFERENCE ** The service address, to which questions about the list itself and requests to be added to or deleted from it should be directed, is: Internet: Linux-Announce-Request@NEWS-DIGESTS.MIT.EDU You can submit announcements to be moderated via: Internet: linux-announce@NEWS.ORNL.GOV Linux may be obtained via one of these FTP sites: ftp.funet.fi pub/Linux tsx-11.mit.edu pub/linux sunsite.unc.edu pub/Linux End of Linux-Announce Digest ****************************** From bounce-linuxcentral-daily-text-6402291@list4.internet.com Fri Nov 1 10:20:57 2002 Return-Path: Delivered-To: smythe@example.com Received: from intm4.sparklist.com (intm4.sparklist.com [216.91.57.134]) by example.com (Postfix) with SMTP id 63398280E1 for ; Fri, 1 Nov 2002 10:20:55 -0500 (EST) X-Mailer: Lyris ListManager Web Interface Date: Fri, 01 Nov 2002 07:20:48 -0800 Subject: Linux Central Specials for Friday November 01, 2002 To: From: LinuxCentral Daily List-Unsubscribe: Reply-To: LinuxCentral Daily Message-Id: Linux Central Daily Specials Friday November 01, 2002 ***************Today's Specials******************* - MANAGING AND USING MYSQL - LINUXCAD 2000 FOR LINUXPPC (FOR POWER MACINTOSH) - TRUSTIX SECURE LINUX 1.2 ************************************************** MANAGING AND USING MYSQL ......Only: $24.95 **You Save: $15 (37%) List Price: $ 39.95 ---------------------------------------------------------------- Learn how to use MySQL, a popular database product that supports key subsets of SQL on Linux and Unix systems. Using C/C++, Java, Perl, PHP, or Python, you can write programs to interact with a MySQL database, either as a stand-alone application or through a web page. This book covers the whole process, from installation to programming interfaces and database administration. It includes ample tutorial material and examples. URL http://linuxcentral.com/catalog/index.php3?prod_code=T000-193 LINUXCAD 2000 FOR LINUXPPC (FOR POWER MACINTOSH) ......Only: $49.95 **You Save: $39.05 (43%) List Price: $ 89.00 ---------------------------------------------------------------- LinuxCAD is today's leading computer aided design and drafting program for The Linux Operating System. LinuxCAD has grown in sales and functionality since its original introduction in 1998. URL http://linuxcentral.com/catalog/index.php3?prod_code=S000-205 TRUSTIX SECURE LINUX 1.2 ......Only: $7.95 **You Save: $31.05 (79%) List Price: $ 39.00 ---------------------------------------------------------------- Trustix Secure Linux is a server oriented Linux distribution with high emphasis on security and performance. URL http://linuxcentral.com/catalog/index.php3?prod_code=D000-106 For advertising information on our Linux Newsletters or any of our 125+ other e-mail Newsletters please contact Frank Fazio, Director Inside Sales @(203) 662-2997 or mailto:ffazio@internet.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ LIKE THIS NEWSLETTER? WANT YOUR OWN? Managing your own email newsletter is easy and affordable with SparkLIST! Over 800 businesses -- including internet.com -- use SparkLIST to manage their email newsletters & campaigns. Call us at 1 (800) 485-9994, or visit us at: http://www.sparklist.com/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Advertising: If you are interested in advertising in our newsletters, call Claudia at 1-203-662-2863 or send email to mailto:nsladsales@internet.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ For contact information on sales offices worldwide visit http://www.internet.com/mediakit/salescontacts.html ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ For details on becoming a Commerce Partner, contact David Arganbright on 1-203-662-2858 or mailto:commerce-licensing@internet.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ To learn about other free newsletters offered by internet.com or to change your subscription visit http://e-newsletters.internet.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ internet.com's network of more than 160 Web sites is organized into 16 channels: Internet Technology http://internet.com/it E-Commerce/Marketing http://internet.com/marketing Web Developer http://internet.com/webdev Windows Internet Technology http://internet.com/win Linux/Open Source http://internet.com/linux Internet Resources http://internet.com/resources ISP Resources http://internet.com/isp Internet Lists http://internet.com/lists Download http://internet.com/downloads International http://internet.com/international Internet News http://internet.com/news Internet Investing http://internet.com/stocks ASP Resources http://internet.com/asp Wireless Internet http://internet.com/wireless Career Resources http://internet.com/careers EarthWeb http://www.earthweb.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ To find an answer - http://search.internet.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Looking for a job? Filling an opening? - http://jobs.internet.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ This newsletter is published by Jupitermedia Corporation http://internet.com - The Internet & IT Network Copyright (c) 2002 Jupitermedia Corporation. All rights reserved. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ For information on reprinting or linking to internet.com content: http://internet.com/corporate/permissions.html ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ --- You are currently subscribed to linuxcentral-daily-text as: smythe@example.com To unsubscribe send a blank email to leave-linuxcentral-daily-text-6402291M@list4.internet.com From technews@eletter.technews.com Fri Nov 1 10:38:47 2002 Return-Path: Delivered-To: smythe@example.com Received: from asgard.iproduction.com (unknown [208.10.173.199]) by example.com (Postfix) with ESMTP id 75C54280E1 for ; Fri, 1 Nov 2002 10:38:45 -0500 (EST) Received: from asgard.iproduction.com (localhost [127.0.0.1]) by asgard.iproduction.com (Postfix) with ESMTP id 4FD9632A23 for ; Fri, 1 Nov 2002 09:38:38 -0600 (CST) To: smythe@example.com From: TechNews.com Daily Sender: TechNews.com Daily Subject: TechNews.com: Key Rulings Due Today in Microsoft Case; More... MIME-version: 1.0 Content-type: multipart/alternative; boundary="BoUnDaRy23644M1661D12724T32700" Message-Id: <20021101153838.4FD9632A23@asgard.iproduction.com> Date: Fri, 1 Nov 2002 09:38:38 -0600 (CST) --BoUnDaRy23644M1661D12724T32700 Content-type: text/plain; charset="us-ascii" -------------------- Advertisement -------------------- Maryland Technology Showcase: The biggest exhibition for the area's largest audience of technology buyers from Business and Enterprise State and Local Government Higher Education and K-12 Education. Get in front of qualified tech buyers and executive level managers with purchasing power. Online Registration Open! http://www.mdtechshowcase.com -------------------- Advertisement -------------------- ---------------------------------------- Your TechNews.com Wrap-Up for Friday, November 1, 2002 Here's the latest technology news for business, technology, and government leaders: A federal judge will issue rulings today in the Microsoft Corp. antitrust case that could profoundly affect not only the software giant's future but also how antitrust law will be applied in the digital age. http://www.washingtonpost.com/wp-dyn/articles/A48530-2002Oct31.html?referer=email o Moo-vin' On Up Gateway has embarked on an image overhaul that calls on the powers of research and design to craft a new look that may not include the company's trademark Holstein cow motif. -The Washington Post http://www.washingtonpost.com/wp-dyn/articles/A48818-2002Oct31.html?referer=email o Lowering the Veil of Secrecy? In adopting a reorganization plan that eliminates direct election of some board members, ICANN gives its many critics one more reason to question the group's management of the Internet's domain-name system. -washingtonpost.com http://www.washingtonpost.com/wp-dyn/articles/A50767-2002Nov1.html?referer=email o Satellite TV Deal Revised, And Rebuffed The Justice Department filed suit to block the proposed merger of EchoStar Communications and Hughes Electronics, saying the deal would create a monopoly that would eliminate competition for subscription television services in many rural areas.-The Washington Post http://www.washingtonpost.com/wp-dyn/articles/A48865-2002Oct31.html?referer=email Attacks Exposed Net's Weaknesses http://www.washingtonpost.com/wp-dyn/articles/A47438-2002Oct31.html?referer=email Tech Group Picks Co-Chairman http://www.washingtonpost.com/wp-dyn/articles/A48905-2002Oct31.html?referer=email Pirates Rob 'Harry' of Magic, and Fees http://www.washingtonpost.com/wp-dyn/articles/A49351-2002Oct31.html?referer=email Web Oversight Group Changes Election http://www.washingtonpost.com/wp-dyn/articles/A46223-2002Oct31.html?referer=email SafeNet To Buy California Company http://www.washingtonpost.com/wp-dyn/articles/A48820-2002Oct31.html?referer=email Revival of a Local Phone 'Reseller' http://www.washingtonpost.com/wp-dyn/articles/A48821-2002Oct31.html?referer=email Loss Widens at Gaithersburg Gene-Drug Firm GenVec http://www.washingtonpost.com/wp-dyn/articles/A49195-2002Oct31.html?referer=email On-Site Sourcing Reports 3Q Loss; More... http://www.washingtonpost.com/wp-dyn/articles/A32245-2002Apr11.html?referer=email SEC Chairman Pitt Assailed on Omission http://www.washingtonpost.com/wp-dyn/articles/A49150-2002Oct31.html?referer=email The Dinner Club Nov. 7, Noon EST: Columnist Shannon Henry will be online to discuss her new book. http://discuss.washingtonpost.com/wp-srv/zforum/02/r_technews_henry110702.htm Read an excerpt of Shannon's book http://www.washingtonpost.com/wp-srv/technology/articles/dinnerclub_excerpt1.htm Calendar Local Tech Events http://wpni.washtech.com/calendar/index.html Filter Monday-Friday: Cynthia L. Webb sorts the day's top technology headlines for you http://www.washingtonpost.com/wp-dyn/technology/columns/filter?referer=email ********** TechNews.com Links Shannon Henry's The Download http://www.washingtonpost.com/wp-dyn/technology/columns/thedownload/ Leslie Walker's .com http://www.washingtonpost.com/wp-dyn/technology/columns/dotcom Carrie Johnson's @work http://www.washingtonpost.com/wp-dyn/technology/columns/atwork Personal Tech News http://www.washingtonpost.com/wp-dyn/technology/personaltech/ Tech Policy News http://www.washingtonpost.com/wp-dyn/technology/techpolicy ********** ------------------------------------------ When it comes to researching companies doing business in the Washington IT market, we have the data you need: Tech Almanac: http://www.techalmanac.com Check out our TECH Calendar of events throughout the area. You can even add your own event: http://wpni.technews.com/cgi-bin/udt/EVENT.EDIT?client=washtech&submitter=USER Know how Washington affects your world. Get our weekly e-letter on the latest technology policy and security developments in the nation's capital. Sign-up today for the TechNews.com Tech Policy and Security Week in Review http://wpni.technews.com/profile/ ***** E-Letter Services: Visit http://www.technews.com/profile/ to sign up for additional e-letters, unsubscribe or get help. To discontinue receiving this specific e-letter, simply reply with "Unsubscribe" in the subject line. To provide feedback, e-mail us at eletters@technews.com To request advertising information, e-mail us at advertising@technews.com --BoUnDaRy23644M1661D12724T32700-- From glamb@dynagen.on.ca Fri Nov 1 11:00:46 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id EC323280E2 for ; Fri, 1 Nov 2002 11:00:45 -0500 (EST) Received: from cmist.concord.internal(localhost[127.0.0.1]) (2751 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 11:00:45 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (2391 bytes) by cmist.concord.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 11:00:45 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 11:00:45 -0500 From: Greg Lamb To: David Smythe Subject: Re: posted but not linked Message-ID: <20021101160045.GA1698@athame.dynagen.on.ca> Reply-To: Greg Lamb References: <4.3.2.7.2.20021101085533.02bb54a0@mail.example.com> <20021101135119.GA2554@athame.dynagen.on.ca> <4.3.2.7.2.20021101085533.02bb54a0@mail.example.com> <4.3.2.7.2.20021101100849.00d01100@mail.example.com> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline In-Reply-To: <4.3.2.7.2.20021101100849.00d01100@mail.example.com> Organization: Dynagen Consulting Limited On 20021101 (Fri) at 1016:48 -0500, David Smythe wrote: > > One issue spotted so far. bogoGR.png is too tall for Galeon on a 1024x768 > screen, or for Windows Mozilla. The horizontal label up to 0.06 nearly > fills the screen. Since the vertical axis goes up to 0.08, I'd estimate > that the png is about 1/3 too tall. I know. It's 945x923 pixels. I haven't yet learned how to control font size, so if I let R put that many data on a smaller canvas, labels get omitted. I tried shrinking it with ImageMagick and ended up trying to draw lines less than a pixel thick, which didn't work too marvellously either. So I guess people without 1600x1200 screens will have to use the scrollbars till I can think of something. (Come to think of it, maybe the par command is what I need to look at...) R is quite frustrating to work with because there's no comprehensive learning documentation. There's an introduction that gets you started, and then there's an alphabetical reference book with all the functions' man pages, many of which are a bit short on detail. For many of the add-on packages, there's nothing but the online help screens. I need a nice big book on how to get things done with R, and it seems nobody's written one yet. As I write this, snow is beginning to hide the grass outside; we're having what Environment Canada calls "flurries heavy at times" and this is one of the times. Fun in prospect. Wonder if my snowblower works this year??? -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From listserv@ugu.com Fri Nov 1 11:17:16 2002 Return-Path: Delivered-To: smythe@example.com Received: from ugu.com (ugu.com [208.179.92.72]) by example.com (Postfix) with ESMTP id 66F6B280E1 for ; Fri, 1 Nov 2002 11:17:15 -0500 (EST) Received: (from listserv@localhost) by ugu.com (8.9.3/8.9.3) id IAA05556 for smythe@example.com; Fri, 1 Nov 2002 08:19:33 -0800 Date: Fri, 1 Nov 2002 08:19:33 -0800 From: Unix Guru Universe Message-Id: <200211011619.IAA05556@ugu.com> To: smythe@example.com Subject: Unix Tip: NFS HANG FIX ON HP-UX =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= UNIX GURU UNIVERSE UNIX HOT TIP Unix Tip 2131 - November 1, 2002 http://www.ugu.com/sui/ugu/show?tip.today =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= NFS HANG FIX ON HP-UX In an NFS environment (Hp-UX based), sometimes no user is able to log-in when home directories are mounted using automounter). As user validation occurs, the user .profile is executed but no shell prompt appears unless the user presses CTRL-C. The Solution to this is to kill the portmap & inetd and restart the two daemons. The problem will then be sorted out. This tip generously supported by: sgogia@hss.hns.com -------------------------------------------------------------------------- To Subscribe: http://www.ugu.com/sui/ugu/show?tip.subscribe To Unsubscribe: http://www.ugu.com/sui/ugu/show?tip.unsubscribe To Submit A Tip: http://www.ugu.com/sui/ugu/show?tip.today ========================================================================== DISCLAIMER: All UNIX HOT TIPS ARE OWNED BY THE UNIX GURU UNIVERSE AND ARE NOT TO BE SOLD, PRINTED OR USED WITHOUT THE WRITTEN CONSENT OF THE UNIX GURU UNIVERSE. ALL TIPS ARE "USE AT YOUR OWN RISK". UGU ADVISES THAT ALL TIPS BE TESTED IN A NON-PRODUCTION DEVELOPMENT ENVIRONMENT FIRST. Unix Guru Universe - www.ugu.com - tips@ugu.com - Copyright 1994-2001 ========================================================================== From glamb@dynagen.on.ca Fri Nov 1 11:22:01 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id DEAAE280E1 for ; Fri, 1 Nov 2002 11:22:00 -0500 (EST) Received: from cmist.concord.internal(localhost[127.0.0.1]) (1187 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 11:22:00 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (828 bytes) by cmist.concord.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 11:21:59 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 11:21:59 -0500 From: Greg Lamb To: David Smythe Subject: squishing the graph Message-ID: <20021101162159.GA1914@athame.dynagen.on.ca> Reply-To: Greg Lamb Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline Organization: Dynagen Consulting Limited Hi again: The par command was the trick. Doing par(ps=9) allowed me to cut the .png file down to 655x655; still 'way too big for standard VGA but ok for most current displays, I guess. Thanks for prodding me on it... -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From expert-owner@linux-mandrake.com Fri Nov 1 11:32:10 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 1A076280E1 for ; Fri, 1 Nov 2002 11:32:10 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id C1A9F83C22; Fri, 1 Nov 2002 08:25:56 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 6DE8C14128C; Fri, 1 Nov 2002 08:23:16 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from lapdog.ravenhome.net (dial-d-01-49.resnet.purdue.edu [128.211.134.59]) by smtp2.mandrax.org (Postfix) with ESMTP id 6D21418686 for ; Fri, 1 Nov 2002 08:22:36 -0800 (PST) Received: by lapdog.ravenhome.net (Postfix, from userid 501) id 84846181382; Fri, 1 Nov 2002 11:18:44 -0500 (EST) From: Praedor Tempus To: expert@linux-mandrake.com Subject: Re: [expert] where's pine? Date: Fri, 1 Nov 2002 11:18:40 -0500 User-Agent: KMail/1.4.3 References: In-Reply-To: MIME-Version: 1.0 Message-Id: <200211011118.43401.praedor@yahoo.com> Sender: praedor@lapdog.ravenhome.net Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 124 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036167784-28558-504" This is a multi-part message in MIME format... ------------=_1036167784-28558-504 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Friday 01 November 2002 10:56 am, logic7 wrote: > And it's still even easier than that with MC. > MC > browse to the file then F4 > edit the file > F2 to save > done. I just tried mc for the first time to test the editor. It is quite easy wi= th=20 the handholding that I desire (menus with keys associated with standard=20 commands - no memorization required). It is simple. Thanx for pointing it= =20 out. I haven't done anything but glance at various iterations of midnight= =20 commander over the years, preferring other tools, but I will keep it in min= d=20 for future reference. praedor -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.7 (GNU/Linux) iD8DBQE9wqlh1i/6R1B/Yh0RAudwAJoDSp+hcfER7TI79/P8UtAIGbzl6wCdHxat cYJxMJANwzy3bJYbSeo7XZ0=3D =3DEuk7 -----END PGP SIGNATURE----- ------------=_1036167784-28558-504 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036167784-28558-504-- From expert-owner@linux-mandrake.com Fri Nov 1 12:13:25 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 88FE0280E1 for ; Fri, 1 Nov 2002 12:13:24 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id AE4E083BFE; Fri, 1 Nov 2002 09:07:09 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 3DC29141291; Fri, 1 Nov 2002 09:04:29 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from johan.ankarloo.nu (as1-2-5.an.g.bonet.se [212.181.53.23]) by smtp1.mandrax.org (Postfix) with ESMTP id 6FD1A43E05 for ; Fri, 1 Nov 2002 08:56:33 -0800 (PST) Received: from johan.ankarloo.nu (localhost.localdomain [127.0.0.1]) by johan.ankarloo.nu (8.12.1/8.12.1) with ESMTP id gA1H2jo9016395 for ; Fri, 1 Nov 2002 18:02:45 +0100 Received: from localhost (gustaf@localhost) by johan.ankarloo.nu (8.12.1/8.12.1/Submit) with ESMTP id gA1H2jUe016392 for ; Fri, 1 Nov 2002 18:02:45 +0100 Date: Fri, 1 Nov 2002 18:02:44 +0100 (CET) From: gustaf@johan.ankarloo.nu To: expert@linux-mandrake.com Message-Id: Mime-Version: 1.0 Reply-To: expert@linux-mandrake.com X-Loop: expert@ X-Sequence: 127 Precedence: list X-Validation-BY: gustaf@johan.ankarloo.nu Subject: [expert] Asus v8420 Content-type: multipart/mixed; boundary="----------=_1036170258-28558-511" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036170258-28558-511 Content-Type: TEXT/PLAIN; charset=US-ASCII I cant get my Asus v8420 Graphics card to work properly. It works just fine in text mode, but thats it. Mandrake 9 graphical installation makes the computer hang. and when I try to install the card after an succesful text installation DrakX tells me "could not found any devices" It works just fine under M$ XP HELP ------------=_1036170258-28558-511 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036170258-28558-511-- From earthlinkdsl@corp.earthlink.net Fri Nov 1 12:15:31 2002 Return-Path: Delivered-To: smythe@example.com Received: from hall.mail.mindspring.net (hall.mail.mindspring.net [207.69.200.60]) by example.com (Postfix) with ESMTP id C8097280E1 for ; Fri, 1 Nov 2002 12:15:30 -0500 (EST) Received: from ggz-2.atl2.fw.earthlink.net ([198.185.0.140] helo=mail.mindspring.com) by hall.mail.mindspring.net with esmtp (Exim 3.33 #1) id 187fOM-0000wB-00 for smythe@example.com; Fri, 01 Nov 2002 12:15:30 -0500 Received: (from dba@localhost) by mail.mindspring.com (8.11.6+Sun/8.10.2) id gA1HFSQ10258 for smythe@example.com; Fri, 1 Nov 2002 12:15:28 -0500 (EST) Date: Fri, 1 Nov 2002 12:15:28 -0500 (EST) From: earthlinkdsl@corp.earthlink.net Message-Id: <200211011715.gA1HFSQ10258@mail.mindspring.com> X-Authentication-Warning: midasdb2.internal.earthlink.net: dba set sender to earthlinkdsl@corp.earthlink.net using -r To: smythe@example.com Subject: Your EarthLink DSL Eligibility and High Speed Alternatives Dear David Smythe, Recently, you submitted your name and phone number to our EarthLink DSL waiting list. We just rechecked your number -- (888-821-8800) -- and found that, unfortunately, it is still ineligible for our EarthLink DSL service. However, we're making the coverage area for EarthLink DSL wider every week, and we check and recheck our waiting list numbers on a regular basis. When your line eventually becomes serviceable for EarthLink DSL, we will make every effort to contact you. But while you can't get EarthLink DSL right now, that doesn't mean you have to wait for blazing fast High Speed Internet Access. EarthLink offers several other High Speed services that may be available in your area right now! EarthLink offers High Speed Internet Access via Cable Modem, ISDN, Satellite, or Fixed Wireless services. To find out which of these services may be right for you, please visit: http://www.earthlink.net/home/broadband Or, call an EarthLink High Speed Internet sales representative at 1-800-635-0373. Thank you for your patience and once again, thank you for choosing EarthLink! Sincerely, The EarthLink High Speed Internet Sales Team EarthLink. The #1 provider of the real Internet. ************************************************ If you wish to no longer receive messages of this type from EarthLink, please follow these directions carefully. Visit the web at: http://www.earthlink.net/dsl/opt-out Or please forward this complete message to opt-out@earthlink.net. Please do not hit reply, as that may not get your request to the proper place. Also, please be sure that the return address you forward this from is the same address we have on record for you. For customer service, billing inquiries, or technical support regarding your EarthLink account, please visit your Personal Support Center: http://support.earthlink.net Please rest assured that EarthLink does not provide customer email addresses or other information to outside companies or organizations without your permission. Our complete Privacy Policy is available online: http://www.earthlink.net/about/policies/privacy.html From jamessarbo@rseem.com Fri Nov 1 12:32:03 2002 Return-Path: Delivered-To: smythe@example.com Received: from rseem-mail.rseem.com (mail.rseem.com [209.0.176.201]) by example.com (Postfix) with ESMTP id 273E2280E1 for ; Fri, 1 Nov 2002 12:32:03 -0500 (EST) content-class: urn:content-classes:message Subject: RE: assistance requested MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Date: Fri, 1 Nov 2002 09:32:02 -0800 X-MimeOLE: Produced By Microsoft Exchange V6.0.6249.0 Message-ID: X-MS-Has-Attach: X-MS-TNEF-Correlator: Thread-Topic: assistance requested Thread-Index: AcKBt7C0NrV0BEbCR9mF6p184UVTUgAC2RbQAABNMmA= From: "James Sarbo" To: David, I got your message. I have been having problems with my aotto.com = domain. I had not changed the nameserver records in the domain = registration before my former employer disconnected my servers. I have = made adjustments to alternate servers that I operate elsewhere, which = should be kicking in any time now. James > -----Original Message----- > From: David Smythe [mailto:smythe@example.com] > Sent: Friday, November 01, 2002 7:02 AM > To: Reich Grovier > Subject: assistance requested >=20 >=20 > Greetings, >=20 > I'm trying to reach James Sarbo who's a new hire there at Rseem=20 > Int'l. Would you please forward this message to him. >=20 > Thank you kindly. >=20 > Sincerely, >=20 > David Smythe > -------------------------------------------------------- > David Smythe Oak Software Systems, Inc. > smythe@example.com Ann Arbor, MI 48103 > www.example.com tel: 888.821.8800 >=20 >=20 From MAILER-DAEMON Fri Nov 1 12:53:07 2002 Return-Path: <> Delivered-To: smythe@example.com Received: by example.com (Postfix) via BOUNCE id F17A4280E1; Fri, 1 Nov 2002 12:53:06 -0500 (EST) Date: Fri, 1 Nov 2002 12:53:06 -0500 (EST) From: MAILER-DAEMON@example.com (Mail Delivery System) Subject: Delayed Mail (still being retried) To: smythe@example.com MIME-Version: 1.0 Content-Type: multipart/report; report-type=delivery-status; boundary="6CD7D27F82.1036173186/example.com" Message-Id: <20021101175306.F17A4280E1@example.com> This is a MIME-encapsulated message. --6CD7D27F82.1036173186/example.com Content-Description: Notification Content-Type: text/plain This is the Postfix program at host example.com. #################################################################### # THIS IS A WARNING ONLY. YOU DO NOT NEED TO RESEND YOUR MESSAGE. # #################################################################### Your message could not be delivered for 4.0 hours. It will be retried until it is 5.0 days old. For further assistance, please send mail to The Postfix program : Name service error for aotto.com: Host not found, try again --6CD7D27F82.1036173186/example.com Content-Description: Delivery error report Content-Type: message/delivery-status Reporting-MTA: dns; example.com Arrival-Date: Fri, 1 Nov 2002 07:59:10 -0500 (EST) Final-Recipient: rfc822; bogofilter@aotto.com Action: delayed Status: 4.0.0 Diagnostic-Code: X-Postfix; Name service error for aotto.com: Host not found, try again Will-Retry-Until: Wed, 6 Nov 2002 07:59:10 -0500 (EST) --6CD7D27F82.1036173186/example.com Content-Description: Undelivered Message Headers Content-Type: text/rfc822-headers Received: from maple.example.com (maple.example.com [219.168.1.20]) by example.com (Postfix) with ESMTP id 6CD7D27F82; Fri, 1 Nov 2002 07:59:10 -0500 (EST) Message-Id: <4.3.2.7.2.20021101074812.00d554a0@mail.example.com> X-Sender: smythe@mail.example.com X-Mailer: QUALCOMM Windows Eudora Version 4.3.2 Date: Fri, 01 Nov 2002 07:59:05 -0500 To: Tom Amazon From: David Smythe Subject: Re: flag settings Cc: bogofilter , Greg Lamb In-Reply-To: <3DC276BB.1000000@riconet.net> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii"; format=flowed --6CD7D27F82.1036173186/example.com-- From glamb@dynagen.on.ca Fri Nov 1 13:02:19 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id 9D30D280E1 for ; Fri, 1 Nov 2002 13:02:18 -0500 (EST) Received: from cmist.concord.internal(localhost[127.0.0.1]) (1454 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 13:02:18 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (1094 bytes) by cmist.concord.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 13:02:17 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 13:02:17 -0500 From: Greg Lamb To: David Smythe Subject: Re: squishing the graph Message-ID: <20021101180217.GA2454@athame.dynagen.on.ca> Reply-To: Greg Lamb References: <20021101162159.GA1914@athame.dynagen.on.ca> <4.3.2.7.2.20021101113802.00bfae60@mail.example.com> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline In-Reply-To: <4.3.2.7.2.20021101113802.00bfae60@mail.example.com> Organization: Dynagen Consulting Limited On 20021101 (Fri) at 1139:25 -0500, David Smythe wrote: > Much, much better. It fits nicely on the screen, though (to pick a nit) > the titles are a bit small. Yes but if I do ps=10 (ie use 10 point type instead of 9) I have to go back up to 900x900 before it will print all the labels :( -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From expert-owner@linux-mandrake.com Fri Nov 1 13:26:04 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 4884827F7F for ; Fri, 1 Nov 2002 13:26:04 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 5D7A883C01; Fri, 1 Nov 2002 10:19:49 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id B2B321412BD; Fri, 1 Nov 2002 10:17:08 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from pimout4-ext.prodigy.net (pimout4-ext.prodigy.net [207.115.63.103]) by yavin.mandrax.org (Postfix) with ESMTP id 1364C14125F for ; Fri, 1 Nov 2002 10:16:40 -0800 (PST) Received: from www7.prodigy.net (www7-ext.prodigy.net [207.115.61.21]) by pimout4-ext.prodigy.net (8.12.3 da nor stuldap/8.12.3) with SMTP id gA1IMpEk242322; Fri, 1 Nov 2002 13:22:51 -0500 To: , "Sevatio" , Message-Id: Date: Fri, 01 Nov 2002 13:22:51 -0500 From: JM5379@sbcglobal.net Subject: Re: [expert] Mandrake 9......Mozilla Quickstart? Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 132 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036174616-28558-523" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036174616-28558-523 personally, i wouldn't/don't want countless programs loading automatically and unnecessarily, and this all begs the question - which programs are to do this own their own? if mozilla nad openoffice, why not every single program loaded on every available storage medium? unless each program has a definable option to let me decide which ones to pre-load, i'd much rather keep my RAM (however much or little i may have) free to do with as i choose, not as every program i choose to keep decides. for openoffice, i leave it up for as long as i forsee needing to use it - sometimes hours or days if i do constant updates to something. otherwise i can afford to wait until it comes up, doing other tasks in the meantime. preloading has its place and definite benefits, but it may well not be suitable for all; don't try to make it so. --- Original Message --- From: Sandeep Khanna To: Sevatio , expert@linux-mandrake.com Subject: Re: [expert] Mandrake 9......Mozilla Quickstart? >Hi, > > >Sevatio wrote: > >> I've seen "quickstarts" of many kinds in Windoze, but out of >> curiosity: How much resources does a "quickstart" consume? Doesn't >> it preload parts of the application therefore unnecessarily using up >> resources? Why not just start it from an icon? > >With RAM so cheap and sop plenty, I don't think that should be a >problem. Why do people still want to go back to Windows?? One of the >reasons being, good User Interface principles............Hourglass >cursor when a program is loading, quick Browser opening, quick >spreadsheet opening...etc.... > >Linux is known to be fast, but, applications like Mozilla, Open Office >put shame on it's great reputation. I am sure this must not be anyone's >intention and there must be ways to tackle this. One of them being >loading portions of software during login or startup. > >--Sandeep > >> >> >> Sandeep Khanna wrote: >> >>> Hi, >>> >>> Does anybody know of Mozilla quickstart in Linux. Or there is no >>> such thing !!! >>> Well, this feature is there in M$ Windows and not in Linux !!!! I >>> thought it is an Open Source project originating in the Open Source >>> World, so shouldn't it be having good killer features in Linux atleast ! >>> >>> Especially when, the main place Linux is lacking good speed is the >>> web browsing experience with the big lizard 'Mozilla' and Office >>> Suite like Open Office or KOffice (all of them damn slow !!!) >>> >>> Sandeep >>> >>> >>> >>> >>> ------------------------------------------------------------------------ >>> >>> Want to buy your Pack or Services from MandrakeSoft? Go to >>> http://www.mandrakestore.com >> >> >> >> >> > >-- >Sandeep Khanna >Graduate Student in Computer Science, >Villanova University >Contact Number: >(Home) 1-610-964-1320 >(Office) 1-877-946-4622 Ext (106) >(Cell) 1-267-253-6808 > > >Quote of the day: > >Failure is the foundation of truth. It teaches us what isn't true, and that is a great beginning. To fear failure is to fear the possibility of truth. >--Joan Chittister > > > ------------=_1036174616-28558-523 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036174616-28558-523-- From expert-owner@linux-mandrake.com Fri Nov 1 13:39:20 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 19857280E1 for ; Fri, 1 Nov 2002 13:39:20 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 4EF5483C15; Fri, 1 Nov 2002 10:33:05 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 4C2431412BB; Fri, 1 Nov 2002 10:30:40 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from exchange1.nku.edu (exchange.nku.edu [192.122.237.32]) by smtp1.mandrax.org (Postfix) with ESMTP id 0B72A43E0F for ; Fri, 1 Nov 2002 10:30:18 -0800 (PST) Received: by exchange1.nku.edu with Internet Mail Service (5.5.2653.19) id ; Fri, 1 Nov 2002 13:36:30 -0500 Message-ID: <2961F29E9CFED4118E5700B0D068B70B0348E945@exchange1.nku.edu> From: Brian York To: "'expert@linux-mandrake.com'" Subject: RE: [expert] Spamassassin Date: Fri, 1 Nov 2002 13:36:23 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 135 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036175429-28558-525" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036175429-28558-525 Content-Type: text/plain I am working on the same project and have the same setup using OpenVMS. Brian -----Original Message----- From: Ken Hawkins [mailto:khawkins@nwcc.bc.ca] Sent: Thursday, October 31, 2002 12:51 PM To: mandrake expert Subject: [expert] Spamassassin Sorry if this is a repeat posting; suffering mail hiccups. Im Looking for some help/advice... New project put on my desk this morning.... Management want spam controlled better than current method, co-worker (sys admin) doesn't want to change over mail system wholesale. Current setup In: INTERNET--->Webshield(Antivirus on W2K)--->OpenVMS(VAX POP system)--->User Out: INTERNET<-----OpenVMS(SMTP)<-----------Webshield(Antivirus on W2K)<---User The request is to place SpamAssassin somewhere in the middle, before or after the W2K server. I have CD's for MDK 7.2, 8.2, and 9.0. The available box is a 1st generation pentium. The box would be dedicated to the 1 program. Management is NOT prepared to move off the VAX/OpenVMS email server. I am looking for suggestion/ideas on setup. I am NOT a guru, and couldn't program my way out of a wet paper bag 8^], but I do know my way around the file system, and can even get by at CLI with no mouse.... Thanks in advance Ken ------------=_1036175429-28558-525 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036175429-28558-525-- From glamb@dynagen.on.ca Fri Nov 1 14:00:53 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id 03EEA280E1 for ; Fri, 1 Nov 2002 14:00:51 -0500 (EST) Received: from cmist.concord.internal(localhost[127.0.0.1]) (2011 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 14:00:50 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (1651 bytes) by cmist.concord.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 14:00:50 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 14:00:50 -0500 From: Greg Lamb To: David Smythe Subject: Gary Message-ID: <20021101190050.GA2824@athame.dynagen.on.ca> Reply-To: Greg Lamb Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline Organization: Dynagen Consulting Limited Hi again: I've just fired off a note to Gary Robinson, giving him the url of the draft paper and asking him to take a look if he has the time and the interest. I'd like some feedback from a more knowledgeable statistician than I am, and he'd be an excellent candidate if he undertakes the review. I particularly asked him if he had any comments on the suitability of anova for this kind of data reduction. AFAIK the main prerequisite is that the raw data should be normally distributed, or close to it; the error rates are obviously not normally distributed, but I think they're close enough. My "expertise" is inadequate for me to be completely confident about it, however; all the anova work I've done hitherto has been in areas where the data, or at least a log transform thereof, were unquestionably suitable for anova. There are some more small wording changes and I've fixed a number of places in the scripts where the HTML rendering was swallowing stuff that started with < and a letter. Not quite sure but I think I've caught all of those now. -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From expert-owner@linux-mandrake.com Fri Nov 1 14:27:20 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 25CF0280E1 for ; Fri, 1 Nov 2002 14:27:20 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 6C4AC83C03; Fri, 1 Nov 2002 11:21:04 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id D30091412D6; Fri, 1 Nov 2002 11:18:23 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from felix.monkeynoodle.org (m201-9.dsl.tsoft.com [198.144.201.9]) by smtp1.mandrax.org (Postfix) with ESMTP id 3C7D743E05 for ; Fri, 1 Nov 2002 11:17:23 -0800 (PST) Received: from chupacabra.monkeynoodle.org (unknown [63.114.26.4]) by felix.monkeynoodle.org (Postfix) with ESMTP id 3CFDEEB45D for ; Fri, 1 Nov 2002 11:23:37 -0800 (PST) Subject: Re: [expert] where's pine? From: Jack Coates To: expert@linux-mandrake.com In-Reply-To: <200211010835.13076.praedor@yahoo.com> References: <1036110814.2994.9.camel@terminus.empire.org.uy> <200210311949.34150.etharp@earthlink.net> <200211010835.13076.praedor@yahoo.com> X-Mailer: Ximian Evolution 1.0.8-3mdk Date: 01 Nov 2002 11:23:15 -0800 Message-Id: <1036178597.3222.24.camel@chupacabra.monkeynoodle.org> Mime-Version: 1.0 Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 141 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036178292-28558-539" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036178292-28558-539 Content-Type: text/plain Content-Transfer-Encoding: 7bit you should have nano available to you -- it's a GPL clone of pico, behaves exactly the same. On Fri, 2002-11-01 at 05:34, Praedor Tempus wrote: > On Thursday 31 October 2002 07:49 pm, ET wrote: > > On Thursday 31 October 2002 07:32 pm, Toshiro wrote: > > > Anybody knows why Mandrake is no longer providing this package? > > Does that include its parts such as pico? It would be nice for pico to be > included by itself if possible as it is one of the easiest to use text-based > editors there is. Vi and emacs are monstrosities that require a great deal > of cryptic command string memorization while pico is all right there. I > depend upon it to fix things from the CLI when things with the GUI go down > the tubes. > > praedor > > ---- > > Want to buy your Pack or Services from MandrakeSoft? > Go to http://www.mandrakestore.com -- Jack Coates Monkeynoodle: A Scientific Venture... ------------=_1036178292-28558-539 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036178292-28558-539-- From expert-owner@linux-mandrake.com Fri Nov 1 14:46:56 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 8FFA5280E1 for ; Fri, 1 Nov 2002 14:46:55 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 26C9483BFE; Fri, 1 Nov 2002 11:40:40 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id 138D81412C1; Fri, 1 Nov 2002 11:38:00 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from helios.digitalhermit.com (adsl108.cofs.net [64.244.108.108]) by smtp1.mandrax.org (Postfix) with ESMTP id 10A4D43E06 for ; Fri, 1 Nov 2002 11:37:34 -0800 (PST) Received: from helios.digitalhermit.com (helios.digitalhermit.com [10.53.176.70]) by helios.digitalhermit.com (Postfix) with ESMTP id BF5FEC706 for ; Fri, 1 Nov 2002 14:47:34 -0500 (EST) Date: Fri, 1 Nov 2002 14:47:34 -0500 (EST) From: kwan@digitalhermit.com To: expert@linux-mandrake.com Subject: RE: [expert] portscans In-Reply-To: Message-ID: MIME-Version: 1.0 Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 145 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036179469-28558-544" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036179469-28558-544 Content-Type: TEXT/PLAIN; charset=US-ASCII On Fri, 1 Nov 2002, Chad wrote: > I remember reading an article in Linux Journal or something like that that > explained how to setup snort or some other software package to automatically > detect a port scan in progress and then to automatically block any other > connection attempts by that IP address. It automatically creates a block > using iptables/ipchains so there is no hacking risk if they portscan you > first because their IP will be blocked. That is, unless they on on DHCP / > Dial-Up / or using someone else's computer as their jump-off. However, it's > better than nothing. > > Unfortunately, I forgot what the software was, but I'm sure a good google > search using some of the keywords I've mentioned will find it. This is very useful; some Linux based firewalls such as Watchguard have a similar feature. But I've noticed that the IP scanning is becoming smarter to get around these blocks. The scanner will touch a few machines, just under the lockout threshold, then try again a few hours or days later. Some blocks won't check multiple IPs so a scanner could jump between a range of IPs and not trigger the alarm with a portscan. ------------=_1036179469-28558-544 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036179469-28558-544-- From glamb@dynagen.on.ca Fri Nov 1 15:29:45 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id 10A0B280E1 for ; Fri, 1 Nov 2002 15:29:44 -0500 (EST) Received: from athame.dynagen.internal(localhost[127.0.0.1]) (2359 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 15:29:43 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (1990 bytes) by athame.dynagen.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 15:29:42 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 15:29:42 -0500 From: Greg Lamb To: David Smythe Subject: Re: Gary Message-ID: <20021101202942.GA1293@athame.dynagen.on.ca> Reply-To: Greg Lamb References: <20021101190050.GA2824@athame.dynagen.on.ca> <4.3.2.7.2.20021101140554.00def1d0@mail.example.com> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline In-Reply-To: <4.3.2.7.2.20021101140554.00def1d0@mail.example.com> Organization: Dynagen Consulting Limited On 20021101 (Fri) at 1407:42 -0500, David Smythe wrote: > That'd be great if he can proof it. Hope he will. He was quite helpful when I was getting started. > html likes to have special characters spelled out. If you need, I can > probably dig up a list for you. Thanks, but I think I have what I need. There are two ways to fix that particular problem: (1) separate the < from the text; as in Delivered-To: admin@example.com Received: from oak.example.com (oak.example.com [219.168.1.10]) by example.com (Postfix) with ESMTP id DB718280E1 for ; Fri, 1 Nov 2002 16:00:03 -0500 (EST) Received: by oak.example.com (Postfix, from userid 1000) id 173BC17E906; Fri, 1 Nov 2002 16:00:01 -0500 (EST) From: root@example.com (Cron Daemon) To: admin@example.com Subject: Cron setiathome/snap.seti X-Cron-Env: X-Cron-Env: X-Cron-Env: X-Cron-Env: X-Cron-Env: X-Cron-Env: Message-Id: <20021101210001.173BC17E906@oak.example.com> Date: Fri, 1 Nov 2002 16:00:01 -0500 (EST) rcp: setiathome/user_info.sah: No such file or directory 0514.0010.nic 192 1101.0546.oak 593 1101.1137.walnut 594 13382 show.seti.all 13382 show.seti.bak 26764 total From hansen@sunpro.net Fri Nov 1 16:21:17 2002 Return-Path: Delivered-To: smythe@example.com Received: from sunpro.net (mail.sunpro.net [216.86.64.42]) by example.com (Postfix) with ESMTP id 03B3B280E1 for ; Fri, 1 Nov 2002 16:21:16 -0500 (EST) Received: from [209.44.17.194] (account ) by sunpro.net (CommuniGate Pro WebUser 3.5.9) with HTTP id 45604712 for ; Fri, 01 Nov 2002 16:21:16 -0500 From: Subject: Re: resume for netstar To: David Smythe X-Mailer: CommuniGate Pro Web Mailer v.3.5.9 Date: Fri, 01 Nov 2002 16:21:16 -0500 Message-ID: In-Reply-To: <4.3.2.7.2.20021101142127.00affc70@mail.example.com> MIME-Version: 1.0 Content-Type: text/plain; charset="ISO-8859-1" Content-Transfer-Encoding: 8bit Still living in Milford but working in Plymouth - and Novi. Full time at Broder Bros, distributor of sportswear, and a few hours a week at ADCO in Novi, Real Estate deveoloper. Dating a lady from Grand Blanc so I don't get to be home much. My two girls are a) graduated from MSU in 2001 and now at Eastern trying to get a masters and b) graduated from UofM Med School in 2002 now in Chicago in the first year of her residency at North Western. All is crazy, and normal. On Fri, 01 Nov 2002 14:24:58 -0500 David Smythe wrote: > At 02:14 PM 11/1/02, hansen@sunpro.net wrote: > > >FYI > > Art, > > Thank you kindly. Where does Netstar have you working > now? Are you still in Milford? > > I'm still on Keech. Mary and the kids are well. The > young'uns are now in 3 different schools - Linda in 4th > grade at Bach Elementary, Mark in 7th at Slauson Middle, > and Eric in 9th at Pioneer. All doing well and growing > like weeds. Eric is taller than Mary and nearly as tall > as the old guy. 'Tis fun :-) > > David > > From spambayes-bounces@python.org Fri Nov 1 17:06:18 2002 Return-Path: Delivered-To: smythe@example.com Received: from mail.python.org (mail.python.org [12.155.117.29]) by example.com (Postfix) with ESMTP id 638B1280E1 for ; Fri, 1 Nov 2002 17:06:18 -0500 (EST) Received: from localhost.localdomain ([127.0.0.1] helo=mail.python.org) by mail.python.org with esmtp (Exim 4.05) id 187jvl-0003w8-00; Fri, 01 Nov 2002 17:06:17 -0500 Received: from smtp.comcast.net ([24.153.64.2]) by mail.python.org with esmtp (Exim 4.05) id 187jvi-0003u0-00 for spambayes@python.org; Fri, 01 Nov 2002 17:06:14 -0500 Received: from cj569191b (pcp736393pcs.reston01.va.comcast.net [68.48.241.201]) by mtaout02.icomcast.net (iPlanet Messaging Server 5.1 HotFix 1.4 (built Aug 5 2002)) spambayes@python.org; Fri, 01 Nov 2002 17:05:33 -0500 (EST) Date: Fri, 01 Nov 2002 17:05:48 -0500 From: Tim Peters Subject: RE: [Spambayes] Email client integration -- what's needed? In-reply-to: <15809.55308.1945.988931@montanaro.dyndns.org> To: skip@pobox.com Message-id: MIME-version: 1.0 X-MIMEOLE: Produced By Microsoft MimeOLE V6.00.2800.1106 X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2911.0) Content-type: text/plain; charset=iso-8859-1 Content-transfer-encoding: 7BIT Importance: Normal X-Priority: 3 (Normal) X-MSMail-priority: Normal X-Spam-Status: No, hits=-18.5 required=5.0 tests=IN_REP_TO,QUOTED_EMAIL_TEXT,RCVD_IN_RFCI,SPAM_PHRASE_00_01,USER_AGENT_OUTLOOK,USER_IN_WHITELIST,USER_IN_WHITELIST_TO X-Spam-Level: Cc: spambayes@python.org X-BeenThere: spambayes@python.org X-Mailman-Version: 2.1b4+ Precedence: list List-Help: List-Archive: List-Unsubscribe: , List-Subscribe: , List-Post: List-Id: Discussion list for Pythonic Bayesian classifier Sender: spambayes-bounces@python.org Errors-To: spambayes-bounces@python.org [Skip Montanaro] > That's true, largely because that's what the focus of the initial phase of > the project was supposed to be. Even if it gets no farther than it is > today, the process has been highly educational for me, because we have an > expert in algorithm design (that'd be Tim) exposing his thought processes > and mechanics for the rest of us. I'm glad you've found it amusing . I'm afraid "think for a second, code for a minute, test for a day; repeat 6 times before you get a small win" is par for the course when trying to push any decent scheme beyond the 80/20 rule (each additional 20% improvement requires 80% of all the effort that went before). > That said, I think the classification stuff has gone about as far as it's > going to go. Me too. The classifier is hack-free now, as clean and uncompromising a realization of the underlying math as anything can be. The assumption of word independence is a limitation of the approach, though. > Future changes to the tokenizer are also likely to be incremental, so > the major changes over the next while will be in email integration. Yup! Thanks to Sean and especially Mark lately, the non-Windows platforms are a month behind on that too. It's a curious thing about Windows: because it is closed-source, the Windows market is homogenous enough that one major effort there can make millions of happy campers. I still hope that the pop3proxy can do that for non-Windows systems too, and that's the only advice I can offer: find a way to use the proxy instead of pursuing "deep integration" with unbounded dozens of quirky twenty-user email clients. _______________________________________________ Spambayes mailing list Spambayes@python.org http://mail.python.org/mailman/listinfo/spambayes From whatsnewnow@eletters1.ziffdavis.com Fri Nov 1 17:26:44 2002 Return-Path: Delivered-To: smythe@example.com Received: from out10smtp7.ddc.dartmail.net (out10smtp7.ddc.dartmail.net [216.73.90.107]) by example.com (Postfix) with ESMTP id BF985280E1 for ; Fri, 1 Nov 2002 17:26:43 -0500 (EST) Received: from CORE10PUMPER2 (unknown [10.21.8.70]) by out10smtp7.ddc.dartmail.net (Postfix) with SMTP id 402385587B5 for ; Fri, 1 Nov 2002 17:28:29 -0500 (EST) Message-Id: From: What's New Now from Ziff Davis To: smythe@example.com Subject: Special Edition: Judge Kotar-Kotelly Approves Final Judgment in Microsoft Case Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Date: Fri, 1 Nov 2002 17:28:29 -0500 (EST) ========================================================= -------- WHAT'S NEW NOW -------- Important Stories, Commentary & More from Ziff Davis ========================================================= SPECIAL EDITION November 1, 2002 Vol. 1, No. 17 ========================================================= Special Flash: Judge Kotar-Kotelly approves final judgment in Microsoft Case When something big breaks in the technology industry, What's New Now stops the presses and delivers a special e-mail to you, so you're always on top of the important stories... And today's is a doozy. Verdict: Judge Collen Kollar-Kotelly approves the proposed final judgment, siding with the federal government and nine states -- and against nine other states and the District of Columbia. This is a huge win for Microsoft: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60rxQ0AA Judge rules Microsoft can't retaliate against OEMs for five years: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60ryY0AJ If you're like me, you're probably pretty sick of this whole Microsoft and the Department of Justice thing. It seems like this case has gone on forever -- and now that technology has advanced, it's almost much ado about nothing. But much in the same way that tax evasion eventually brought famed gangster Al Capone to justice, Internet Explorer bundling may be the only way to rein in Microsoft's many supposedly anti-competitive business practices. At any rate, unfortunately this probably isn't the end of this twisty, turny, topsy road. For more details about all the ups and downs of the case, check our our Microsoft on Trial special report: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60ryU0AF And if you're looking for the latest and most up to date news on what Microsoft is doing, we've also got a special Microsoft News page, you can find all the details right here: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60ryV0AG Microsoft has continued to roll out products during this process, with many important new ventures launching in just the past few weeks. Some of the more significant that have just launched or are coming up: Office 11: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60rhe0AE Tablet PC launches 11/7: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60ryW0AH Windows XP Media Center: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60qpy0Af MSN 8: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60ryX0AI ========================================================= eNewsletter Information ========================================================= You are subscribed to WHAT'S NEW NOW with the e-mail address smythe@example.com. To change your HTML/text preferences, change your e-mail address or subscribe to other eNewsletters from Ziff Davis Media, click here: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60q6J0Au To unsubscribe, click here: http://eletters1.ziffdavis.com/cgi-bin10/flo?y=eSjC0CILrD0HX60q6M0Ax&e=smythe@example.com Copyright 2002 Ziff Davis Media Inc. All Rights Reserved. From clint@dman.com Fri Nov 1 17:26:45 2002 Return-Path: Delivered-To: smythe@example.com Received: from crystal.dman.com (crystal.dman.com [208.137.16.31]) by example.com (Postfix) with ESMTP id EA0D4280E2 for ; Fri, 1 Nov 2002 17:26:44 -0500 (EST) Received: from crystal.dman.com (clint@localhost [127.0.0.1]) by crystal.dman.com (8.12.6/8.12.6/Horus) with ESMTP id gA1MQghh004078; Fri, 1 Nov 2002 17:26:42 -0500 Received: (from clint@localhost) by crystal.dman.com (8.12.6/8.12.6/Debian-7) id gA1MQghj004076; Fri, 1 Nov 2002 17:26:42 -0500 Date: Fri, 1 Nov 2002 17:26:42 -0500 From: Clint Adams To: David Smythe Cc: Gyepi SAM Subject: Re: alignment Message-ID: <20021101222642.GB3791@dman.com> References: <4.3.2.7.2.20021031103704.00be7100@mail.example.com> <4.3.2.7.2.20021031103704.00be7100@mail.example.com> <4.3.2.7.2.20021031124051.00ea5d80@mail.example.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <4.3.2.7.2.20021031124051.00ea5d80@mail.example.com> User-Agent: Mutt/1.4i X-Virus-Scanned: by amavisd-milter (http://amavis.org/) > I hate it when my messages aren't clean. The numbers represent statement > executions per second. #2 is at 363M and #1 is at 352M. #2 is faster, > hence is being used. Sounds good to me. From Online#3.29500.33393435323131.1.b@newsletter.online.com Fri Nov 1 17:49:10 2002 Return-Path: Delivered-To: smythe@example.com Received: from acmta4.cnet.com (abv-sfo1-acmta4.cnet.com [208.16.1.163]) by example.com (Postfix) with ESMTP id A0549280E1 for ; Fri, 1 Nov 2002 17:49:09 -0500 (EST) Received: from abv-sfo1-ac-agent7 (208.16.0.244) by acmta4.cnet.com (PowerMTA(TM) v1.5); Fri, 1 Nov 2002 14:51:59 -0800 (envelope-from ) Message-ID: <1320492.1036190947757.JavaMail.root@abv-sfo1-ac-agent7> Date: Fri, 1 Nov 2002 14:49:07 -0800 (PST) From: ZDNet Tech Update Today To: smythe@example.com Subject: Judge approves most of MS-DOJ settlement [TECH UPDATE ALERT] Mime-Version: 1.0 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit X-Mailer: Accucast (http://www.accucast.com) X-Mailer-Version: 2.8.6-4 Tech Update Today
    Tech Update Today

     Elsewhere on ZDNet
    Find Web hosting providers, ISPs, and more in ZDNet's Internet Services.
    WebFerret 5.0 helps you find what you need on the Internet fast!
    Get downloads and resources for IT pros with a free TechRepublic membership.
    Sign up for a free trial of Computer Shopper Magazine.
    The time is now! Jumpstart your career with tech job listings from ZDNet.

    Friday, November 1, 2002

    News Alert
     Dan Farber 

     
    Judge approves most of MS-DOJ settlement

    In what Microsoft watchers termed no big surprise, U.S. District Judge Colleen Kollar-Kotelly accepted most of the proposed settlement in the long-running antitrust case.

    The settling parties have until Nov. 8 to refile the settlement with changes requested by the judge.

    The accepted settlement prevents Microsoft from participating in exclusionary, anti-competitive deals; requires uniform contract terms for computer manufacturers; and allows manufacturers and customers to remove access to some Microsoft features. Among other provisions, it also stipulates that Microsoft release technical data to software developers to help them optimize products for Microsoft's platforms.

    Over the last several months, Microsoft has been complying with some of the provisions of the settlement. For example, in September, the company released Windows XP Service Pack 1, which introduced a control that allows manufacturers to hide access to the Internet Explorer browser, Windows Messenger, Windows Media Player, Outlook Express, and Microsoft's version of the Java Virtual Machine.

    The sanctions will be enforced for at least five years unless extended by the court. Microsoft officials said the company was reviewing the decision. The nine states and District of Columbina who dissented from the proposed agreement may still appeal the judge's ruling.

    We will provide updates throughout the day and coming week.
    Read full story
     More News from ZDNet

    Thumbs-up on security for Windows 2000
    After spending three years and millions of dollars, Microsoft locks up an internationally recognized Common Criteria certification for the OS--and bills it as part of its Trusted Computing push.

    Read full story

    Microsoft wins class-action appeal
    A federal appeals court in Virginia dismisses a class-action suit against Microsoft, Hewlett-Packard, and Dell. The judges rule there's no proof of any anti-competitive activity.

    Read full story

    Cracks in Microsoft's empire?
    News Focus: For the first time in years, Microsoft seems vulnerable. Once untouchable, rivals and customers are now sensing opportunities to challenge the software empire. But Microsoft always fights hardest when it's injured.

    Read full report

    Write me at dan.farber@cnet.com



    Sign up for more free newsletters from ZDNet

    The e-mail address for your subscription is smythe@example.com

    Unsubscribe |  Manage My Subscriptions | FAQ |  Advertise

    ZDNet Home |eBusiness | Security | Networking | Applications | Platforms | Hardware | Careers


    Copyright 2002 CNET Networks, Inc. All rights reserved. ZDNet is a registered service mark of CNET Networks, Inc.

    From spambayes-bounces@python.org Fri Nov 1 17:55:36 2002 Return-Path: Delivered-To: smythe@example.com Received: from mail.python.org (mail.python.org [12.155.117.29]) by example.com (Postfix) with ESMTP id AB690280E1 for ; Fri, 1 Nov 2002 17:55:35 -0500 (EST) Received: from localhost.localdomain ([127.0.0.1] helo=mail.python.org) by mail.python.org with esmtp (Exim 4.05) id 187khR-0003ri-01; Fri, 01 Nov 2002 17:55:33 -0500 Received: from 205-158-62-78.outblaze.com ([205.158.62.78] helo=smtp1.us4.outblaze.com) by mail.python.org with smtp (Exim 4.05) id 187khM-0003p8-00 for spambayes@python.org; Fri, 01 Nov 2002 17:55:28 -0500 Received: (qmail 16955 invoked from network); 1 Nov 2002 22:54:51 -0000 Received: from unknown (HELO STRIPER) (seant:iname.com?iname.com@24.60.54.37) by 205-158-62-78.outblaze.com with SMTP; 1 Nov 2002 22:54:51 -0000 From: "Sean True" To: "Tim Peters" , Subject: RE: [Spambayes] Email client integration -- what's needed? Date: Fri, 1 Nov 2002 17:55:00 -0500 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2911.0) X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1106 Importance: Normal In-Reply-To: X-Spam-Status: No, hits=-10.8 required=5.0 tests=IN_REP_TO,QUOTED_EMAIL_TEXT,SPAM_PHRASE_00_01,USER_AGENT_OUTLOOK,USER_IN_WHITELIST_TO X-Spam-Level: Cc: spambayes@python.org X-BeenThere: spambayes@python.org X-Mailman-Version: 2.1b4+ Precedence: list List-Help: List-Archive: List-Unsubscribe: , List-Subscribe: , List-Post: List-Id: Discussion list for Pythonic Bayesian classifier Sender: spambayes-bounces@python.org Errors-To: spambayes-bounces@python.org > Yup! Thanks to Sean and especially Mark lately, the non-Windows platforms > are a month behind on that too. It's a curious thing about Windows: > because it is closed-source, the Windows market is homogenous enough that > one major effort there can make millions of happy campers. I still hope > that the pop3proxy can do that for non-Windows systems too, and that's the > only advice I can offer: find a way to use the proxy instead of pursuing > "deep integration" with unbounded dozens of quirky twenty-user email > clients. > Mark, mostly. I just complain. I'd like to second the pop3proxy architecture as the way forward. If it weren't for the fact that virus scanners weren't already sometimes adding both pop3 and smtp proxies to the mix on Windows, I would have pushed (er, whined) in favor of that architecture even for Outlook. (There is also the problem of how to configure proxies for the case of multiple pop3 accounts). You can mangle the host, user, and password together in a horrible looking user name, but it is really a pain. Nonetheless, it has a relatively clean API, and the same architecture could be used to proxy SMTP output traffic, catching messages to ham@wherever and spam@wherever, in order to talk to the training system. The same code then might run pretty happily on both the client and the server, depending on the needs of the installation. -- Sean _______________________________________________ Spambayes mailing list Spambayes@python.org http://mail.python.org/mailman/listinfo/spambayes From glamb@dynagen.on.ca Fri Nov 1 17:55:48 2002 Return-Path: Delivered-To: smythe@example.com Received: from csl2.contronics.on.ca (csl2.contronics.on.ca [240.138.93.2]) by example.com (Postfix) with ESMTP id 2F369280E1 for ; Fri, 1 Nov 2002 17:55:48 -0500 (EST) Received: from athame.dynagen.internal(localhost[127.0.0.1]) (1579 bytes) by csl2.contronics.on.ca via sendmail with P:esmtp/R:bind_hosts/T:inet_zone_bind_smtp (sender: ) id for ; Fri, 1 Nov 2002 17:55:47 -0500 (EST) (Smail-3.2.0.114 2001-Aug-6 #5 built 2002-Mar-26) Received: (1210 bytes) by athame.dynagen.internal via sendmail with P:stdio/R:smart_host/T:smtp (sender: ) id for smythe@example.com; Fri, 1 Nov 2002 17:55:46 -0500 (EST) (Smail-3.2.0.111 2000-Feb-17 #5 built 2000-Apr-12) Date: Fri, 1 Nov 2002 17:55:46 -0500 From: Greg Lamb To: David Smythe Subject: heard back from Gary Message-ID: <20021101225546.GA2326@athame.dynagen.on.ca> Reply-To: Greg Lamb Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline Organization: Dynagen Consulting Limited Hi again: Gary is "excited" that his method is in mainline bogofilter now. He will read through the page and let us know if he has comments. The spambayes people have been working on/with a further refinement of Gary's, involving a chi-square calculation. I knew about this (in concept, not in detail) but was daunted by the computation overhead. Gary says he doesn't know about that but thinks it ought to be doable. He's about to update his paper again, and when he does I'll code it up and try it, evaluating both discrimination (the spambayes folk say it's definitely better) and throughput. -- | G r e g l a m b | gpg public key: | | http://www.sbc.nu/~glamb | finger greg@sbc.nu | From spambayes-bounces@python.org Fri Nov 1 18:19:38 2002 Return-Path: Delivered-To: smythe@example.com Received: from mail.python.org (mail.python.org [12.155.117.29]) by example.com (Postfix) with ESMTP id 667A2280E1 for ; Fri, 1 Nov 2002 18:19:38 -0500 (EST) Received: from localhost.localdomain ([127.0.0.1] helo=mail.python.org) by mail.python.org with esmtp (Exim 4.05) id 187l4j-0002CE-00; Fri, 01 Nov 2002 18:19:37 -0500 Received: from [63.100.190.10] (helo=smtp.zope.com) by mail.python.org with esmtp (Exim 4.05) id 187l4e-0002C8-00 for spambayes@python.org; Fri, 01 Nov 2002 18:19:33 -0500 Received: from slothrop.zope.com ([208.251.201.42]) by smtp.zope.com (8.12.5/8.12.5) with ESMTP id gA1NQO7C028432; Fri, 1 Nov 2002 18:26:25 -0500 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <15811.3035.967754.435766@slothrop.zope.com> Date: Fri, 1 Nov 2002 18:18:51 -0500 From: jeremy@alum.mit.edu (Jeremy Hylton) To: Tim Peters Subject: RE: [Spambayes] Email client integration -- what's needed? In-Reply-To: References: <15810.64929.812472.459643@slothrop.zope.com> X-Mailer: VM 7.00 under 21.4 (patch 6) "Common Lisp" XEmacs Lucid X-MailScanner: Found to be clean X-Spam-Status: No, hits=-10.5 required=5.0 tests=IN_REP_TO,REFERENCES,SPAM_PHRASE_00_01,USER_IN_WHITELIST_TO X-Spam-Level: Cc: jeremy@alum.mit.edu Cc: spambayes@python.org X-BeenThere: spambayes@python.org X-Mailman-Version: 2.1b4+ Precedence: list Reply-To: Jeremy Hylton List-Help: List-Archive: List-Unsubscribe: , List-Subscribe: , List-Post: List-Id: Discussion list for Pythonic Bayesian classifier Sender: spambayes-bounces@python.org Errors-To: spambayes-bounces@python.org >>>>> "TP" == Tim Peters writes: TP> [Jeremy Hylton] >> The pop proxy is great for people who use pop, but lots of people >> don't. TP> Name 362. Ha! Guido and at least 361 other people . >> Even for people who use pop, the proxy doesn't help with training >> at all. So I'm afraid it's just a mess for non-Windows users. TP> I don't know that means it can't be less of a mess, though. For TP> example, I expect we could use a common Training class, which TP> manages a database of opaque message objects and takes care of TP> things like calling appropriate classifier methods at TP> appropriate times, and remembering which messages have been TP> trained on as what. Mark invented a bunch of code like that for TP> the Outlook client, but there's really nothing Outlook-specific TP> about it apart from the all Outlook-specific bits . Those TP> could be factored out, though. I should look at integrating Mark's code and my own training system based on VM folders. See what common code falls out. Jeremy _______________________________________________ Spambayes mailing list Spambayes@python.org http://mail.python.org/mailman/listinfo/spambayes From mdlug-return-6195-smythe=example.com@mdlug.org Fri Nov 1 20:02:47 2002 Return-Path: Delivered-To: smythe@example.com Received: from mdlug.org (cpe-24-221-90-239.mi.sprintbbd.net [242.21.90.239]) by example.com (Postfix) with SMTP id F2BEC280E2 for ; Fri, 1 Nov 2002 20:02:46 -0500 (EST) Received: (qmail 2682 invoked by uid 504); 2 Nov 2002 01:00:57 -0000 Mailing-List: contact mdlug-help@mdlug.org; run by ezmlm Precedence: bulk X-No-Archive: yes list-help: list-unsubscribe: list-post: Reply-To: mdlug@mdlug.org Delivered-To: mailing list mdlug@mdlug.org Received: (qmail 2652 invoked from network); 2 Nov 2002 01:00:55 -0000 From: Joe Sandlot To: mdlug Content-Type: text/plain Content-Transfer-Encoding: 7bit X-Mailer: Ximian Evolution 1.0.8 Date: 01 Nov 2002 20:00:07 -0500 Message-Id: <1036198807.13996.4.camel@squash.scalabledynamics.com> Mime-Version: 1.0 Subject: [MDLUG] OT: seeking recommendations Hi folks: Looking for recommendations for things like business printers (e.g. for rapid turn around of business cards etc), and where to turn to in order to get shirts (polo) imprinted with business paraphernalia (logos, websites, etc). Assume I have less than 10 days to get all this done, starting ... today (friday) :) Who is good? Where to go? Something in driving distance of Canton MI? Offline replies encouraged. Joe -- Garret Sandlot, Ph.D Scalable Dynamics LLC, email: sandlot@scalabledynamics.com web : http://scalabledynamics.com phone: +1 888 612 4615 From aadldatedue@aadl.annarbor.lib.mi.us Fri Nov 1 20:54:30 2002 Return-Path: Delivered-To: smythe@example.com Received: from aadl.annarbor.lib.mi.us (aadl.annarbor.lib.mi.us [240.38.6.9]) by example.com (Postfix) with SMTP id EB329280E1 for ; Fri, 1 Nov 2002 20:54:28 -0500 (EST) Received: by aadl.annarbor.lib.mi.us for SMYTHE@EXAMPLE.COM; Fri, 1 Nov 2002 20:59:57 -0500 Date: Fri, 1 Nov 2002 20:59:57 -0500 From: ANN ARBOR DISTRICT LIBRARY To: smythe@example.com Message-Id: <021101205957.533f@aadl.annarbor.lib.mi.us> Subject: Advanced Date Due Notice The titles listed below will be due on: Monday 04-NOV-2002 Please return them to the Main Library or any Branch. If an item is renewable, you may renew it at any Library location, or by calling the Library at 327-4219, or online at: http://aadl.annarbor.lib.mi.us This link will open the Library catalog. Select a location. Then, on the search page, choose RENEW AN ITEM (on the right side of the screen). You will need your Library card number and your PIN. TITLES: Misty of Chincoteague / From mdlug-return-6198-smythe=example.com@mdlug.org Fri Nov 1 21:50:32 2002 Return-Path: Delivered-To: smythe@example.com Received: from mdlug.org (cpe-24-221-90-239.mi.sprintbbd.net [242.21.90.239]) by example.com (Postfix) with SMTP id EB49D280E1 for ; Fri, 1 Nov 2002 21:50:31 -0500 (EST) Received: (qmail 8076 invoked by uid 504); 2 Nov 2002 02:48:42 -0000 Mailing-List: contact mdlug-help@mdlug.org; run by ezmlm Precedence: bulk X-No-Archive: yes list-help: list-unsubscribe: list-post: Reply-To: mdlug@mdlug.org Delivered-To: mailing list mdlug@mdlug.org Received: (qmail 8062 invoked from network); 2 Nov 2002 02:48:42 -0000 Content-Type: text/plain; charset="iso-8859-1" From: Bill To: MDLUG List Date: Fri, 1 Nov 2002 21:46:38 -0500 X-Mailer: KMail [version 1.2] MIME-Version: 1.0 Message-Id: <02110121463800.15605@glen.organic-earth.com> Content-Transfer-Encoding: 8bit Subject: [MDLUG] No kidding? Re: Linksys routers with older firmware. http://www.eweek.com/article2/0,3959,663846,00.asp Please note that after the router goes down, your intra-net is now effectively part of the DMZ. Rooting takes only a few moments. "Housekeeping to the transporter room. Kirk out." From expert-owner@linux-mandrake.com Fri Nov 1 23:08:15 2002 Return-Path: Delivered-To: smythe@example.com Received: from smtp.mandrake.com (smtp.mandrake.com [63.209.80.248]) by example.com (Postfix) with ESMTP id 744DA280E1 for ; Fri, 1 Nov 2002 23:08:14 -0500 (EST) Received: from yavin.mandrax.org (moseisley.mandrax.org [63.209.80.226]) by smtp.mandrake.com (Postfix) with ESMTP id 8477B83C0C; Fri, 1 Nov 2002 20:01:52 -0800 (PST) Received: by yavin.mandrax.org (Postfix, from userid 500) id CF2EA141359; Fri, 1 Nov 2002 19:59:08 -0800 (PST) Delivered-To: expert@linux-mandrake.com Received: from lakemtao02.cox.net (lakemtao02.cox.net [68.1.17.243]) by smtp1.mandrax.org (Postfix) with ESMTP id AAFB743E07 for ; Fri, 1 Nov 2002 19:58:34 -0800 (PST) Received: from michael ([68.1.124.170]) by lakemtao03.cox.net (InterMail vM.5.01.04.05 201-253-122-122-105-20011231) with SMTP id <20021102035115.CCEA16428.lakemtao03.cox.net@michael> for ; Fri, 1 Nov 2002 22:51:15 -0500 Message-Id: <3.0.32.20021101215025.00a616c8@pop.east.cox.net> X-Sender: mviron@pop.east.cox.net X-Mailer: Windows Eudora Pro Version 3.0 (32) Date: Fri, 01 Nov 2002 21:50:26 -0600 To: expert@linux-mandrake.com From: Michael Viron Subject: Re: [expert] where's pine? Mime-Version: 1.0 Reply-To: expert@linux-mandrake.com X-Loop: expert@linux-mandrake.com X-Sequence: 157 Precedence: list List-Help: List-Subscribe: List-Unsubscribe: List-Post: List-Owner: Content-type: multipart/mixed; boundary="----------=_1036209537 28558 591" Sender: expert-owner@linux-mandrake.com This is a multi-part message in MIME format... ------------=_1036209537 28558 591 Content-Type: text/plain; charset="us-ascii" Try joe, which I believe is still released with Mandrake. It's comparable to pico. Michael -- Michael Viron Project Manager / Primary Developer / Manager of Online Operations General Education Online At 09:09 AM 11/1/2002 -0500, you wrote: >-----BEGIN PGP SIGNED MESSAGE----- >Hash: SHA1 > >Doesn't MC require a working X? If X is toasted, is the MC editor still >useable? > >praedor > >On Friday 01 November 2002 08:48 am, logic7 wrote: >> Use the editor in MC. It's dead simple to use. no silly command strings >> >> -----Original Message----- >> From: praedor@lapdog.ravenhome.net >> [mailto:praedor@lapdog.ravenhome.net]On Behalf Of Praedor Tempus >> Sent: Friday, November 01, 2002 8:35 AM >> To: expert@linux-mandrake.com >> Subject: Re: [expert] where's pine? >> >> On Thursday 31 October 2002 07:49 pm, ET wrote: >> > On Thursday 31 October 2002 07:32 pm, Toshiro wrote: >> > > Anybody knows why Mandrake is no longer providing this package? >> >> Does that include its parts such as pico? It would be nice for pico to be >> included by itself if possible as it is one of the easiest to use >> text-based editors there is. Vi and emacs are monstrosities that require a >> great deal of cryptic command string memorization while pico is all right >> there. I depend upon it to fix things from the CLI when things with the >> GUI go down the tubes. >> >> praedor >-----BEGIN PGP SIGNATURE----- >Version: GnuPG v1.0.7 (GNU/Linux) > >iD8DBQE9wos71i/6R1B/Yh0RAmiRAJ4hY0avU4UKD7JFx3tF0AslIpi7DgCgilVk >KPd3El/RSMsLwiMYzUzc7Nw= >=CLnw >-----END PGP SIGNATURE----- > >Want to buy your Pack or Services from MandrakeSoft? >Go to http://www.mandrakestore.com > ------------=_1036209537 28558 591 Content-Type: text/plain; name="message.footer" Content-Disposition: inline; filename="message.footer" Content-Transfer-Encoding: 8bit Want to buy your Pack or Services from MandrakeSoft? Go to http://www.mandrakestore.com ------------=_1036209537 28558 591-- From mdlug-return-6207-smythe=example.com@mdlug.org Fri Nov 1 23:39:26 2002 Return-Path: Delivered-To: smythe@example.com Received: from mdlug.org (cpe-24-221-90-239.mi.sprintbbd.net [242.21.90.239]) by example.com (Postfix) with SMTP id D6150280E1 for ; Fri, 1 Nov 2002 23:39:25 -0500 (EST) Received: (qmail 14212 invoked by uid 504); 2 Nov 2002 04:37:46 -0000 Mailing-List: contact mdlug-help@mdlug.org; run by ezmlm Precedence: bulk X-No-Archive: yes list-help: list-unsubscribe: list-post: Reply-To: mdlug@mdlug.org Delivered-To: mailing list mdlug@mdlug.org Received: (qmail 14200 invoked from network); 2 Nov 2002 04:37:46 -0000 Message-ID: <3DC35680.6010502@riconet.net> Date: Fri, 01 Nov 2002 23:37:20 -0500 From: Tom Amazon User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.0.0) Gecko/20020623 Debian/1.0.0-0.woody.1 MIME-Version: 1.0 To: mdlug@mdlug.org References: <3DC34D28.2050809@riconet.net> <1036210222.1723.22.camel@protein.scalabledynamics.com> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Subject: Re: [MDLUG] mail filter + Mail::Audit Garret Sandlot wrote: > On Fri, 2002-11-01 at 22:57, Tom Amazon wrote: > >>HI JOE!! >> >>Have you ever looked at Mail::Audit? >>Seems to be the Frankenstein between procmail and perl. > > > Hi Tom: > > I thought Spamassassin was built atop Mail::Audit. Seems I was wrong, > but yes, I know about it. I thought you did as well. > > I'll bet its probably pretty close to what you want.... > > Joe > I don't think that email confirmation is all that effective. Especially for someone who is fairly free with their address. You never know what someone is going to use for an auto-responder when you subscribe some email-newsletter. This is just one example. What I liked about Mail::Audit when I saw it was the simplicity of how it wrapped up various functions. The one thing that I have learned so far about email filters is that: 1 -- bouncing mail back to spammers only blows up your mail-queue. 2 -- Having a queue of 2700 emails is a real pain. 3 -- If you are going to blacklist someone, do it /dev/null style 4 -- Whitelisting might be better, add auto-replies to confirm that the Sender was not tossed into the bit bucket. 5 -- with bogofilter and spamassassin (not spamd) I can only manage about 1 email per second overall. I backed off from spamd because they have so many warnings about the potential problems with running as root. I decided since I'm not running a major email server I can push this back to the slower, yet potentially more secure spamassassin. Do you know where spamd puts the auto-whitelists? I couldn't find them. That was the other reason I went to spamd. Mail::Audit is a tool that any spam-combatant should be aware of. -- poisoned coffee, n.: Grounds for divorce. bogofilter-1.2.4/src/tests/t.lock30000755000175000017500000000220212163572275015200 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame seq="1 2 3 4 5" # OPTS used for all # IOPTS used for initialization OPTS="-C -M" IOPTS= if [ $verbose -gt 0 ] ; then IOPTS="$IOPTS -v" ; fi rc=0 $BOGOFILTER $OPTS -d "$TMPDIR" $IOPTS -n -I "$srcdir"/inputs/good.mbx $BOGOFILTER $OPTS -d "$TMPDIR" $IOPTS -s -I "$srcdir"/inputs/spam.mbx oldtraps=`trap` case `uname -s` in SunOS) oldtraps=`echo $oldtraps | sed -e 's/^trap --/trap/g'` ;; esac trap 'kill $pid' 1 2 3 if [ $verbose -gt 0 ] ; then echo "#### Part 1 ####" ; fi for I in $seq ; do ( set +e $BOGOFILTER $OPTS -d "$TMPDIR" -u -I "$srcdir"/inputs/spam.mbx echo $? >> "$TMPDIR/exits" ) & pid="$pid $!" done wait pid= if [ $verbose -gt 0 ] ; then echo "#### Part 2 ####" ; fi for I in $seq ; do ( set +e $BOGOFILTER $OPTS -d "$TMPDIR" -u -p -I "$srcdir"/inputs/spam.mbx >> "$TMPDIR"/$I.out echo $? >> "$TMPDIR/exits" ) & pid="$pid $!" done wait pid= trap - 1 2 3 eval "$oldtraps" # check for program failures test "x$(grep -v 0 "$TMPDIR"/exits)" = x # check if all programs reported their code exits=`cat "$TMPDIR/exits" | wc -l` set -- $seq $seq test $exits -eq $# bogofilter-1.2.4/src/tests/t.crash-invalid-base640000755000175000017500000000104612163572274017777 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # make sure that we do not crash on excessively long tokens # Test program by Julius Plenz, TU Berlin. perl -e ' print < /dev/null bogofilter-1.2.4/src/tests/t.integrity0000755000175000017500000000100512163572274016202 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # Check if data integrity is maintained in passthrough mode. # Generate input file with embedded NUL, CR and LF. echo 74 65 73 74 00 74 65 0d 73 74 0d 0a \ | ./dehex > "$TMPDIR"/input # Check seekable input $VAL $BOGOFILTER -e -p -C < "$TMPDIR/input" > "$TMPDIR/output" ./dumbhead -1 < "$TMPDIR"/output | cmp - "$TMPDIR/input" # Check non-seekable input cat "$TMPDIR/input" | $VAL $BOGOFILTER -e -p -C > "$TMPDIR/output" ./dumbhead -1 < "$TMPDIR"/output | cmp - "$TMPDIR/input" bogofilter-1.2.4/src/tests/deqp.c0000644000175000017500000000165512163572275015105 0ustar sezsez/* $Id: deqp.c 6766 2009-01-12 04:27:36Z relson $ */ #include "common.h" #include #include #include /* for SEEK_*** for SunOS 4.1.x */ #include "qp.h" static void die(void) __attribute__((noreturn)); static void die(void) { perror("deqp"); exit(EXIT_FAILURE); } int main(int argc, char **argv) { size_t size; qp_mode mode = RFC2045; word_t *w; if (argc > 1 && strcasecmp(argv[1], "rfc2047")) mode = RFC2047; if (argc > 1 && strcasecmp(argv[1], "rfc-2047")) mode = RFC2047; if (fseek(stdin, 0, SEEK_END)) die(); size = ftell(stdin); if (fseek(stdin, 0, SEEK_SET)) die(); w = word_new(NULL, size); if (fread(w->u.text, 1, w->leng, stdin) != w->leng) die(); size = qp_decode(w, mode); if (fwrite(w->u.text, 1, size, stdout) != size) die(); word_free(w); if (fflush(stdout)) die(); if (fclose(stdout)) die(); return EXIT_SUCCESS; } bogofilter-1.2.4/src/tests/t.longoptions0000755000175000017500000000162412163572274016546 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # longoptions.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # # longoptions.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir:=.}/t.frame CFG="$TMPDIR"/test.cf MSG="$TMPDIR/test.msg" cat > "$CFG" < "$MSG" < "$TMPDIR"/bogolexer.out $BOGOFILTER -D -c "$CFG" -v -n -I "$MSG" > "$TMPDIR/bogofilter.out" bogofilter-1.2.4/src/tests/t.valgrind0000755000175000017500000000371212163572274016001 0ustar sezsez#!/bin/sh -x # only run this when valgrind is in the path, skip otherwise # ("exit 77" = skip) # # this is a stripped-down version of t.grftest NODB=1 . ${srcdir=.}/t.frame if test "x$BF_RUN_VALGRIND" = x ; then echo >&2 "----> the following test is skipped, set BF_RUN_VALGRIND=1 to run it" exit 77 fi if test "x$EXE_EXT" = "x_static"; then exit 77 fi case `valgrind --version` in valgrind-3*) VG_SUPP="$TMPDIR"/.valgrind.suppress VALGRIND="$VALGRIND 3>$TMPDIR/vg.out --log-fd=3" ;; valgrind-2*) VG_SUPP="$TMPDIR"/vg.supp VALGRIND="$VALGRIND 3>$TMPDIR/vg.out --logfile-fd=3" ;; *) exit 77 esac ( eval "$VALGRIND true" ) 2> /dev/null || exit 77 if ( eval "$VALGRIND false" ) 2> /dev/null ; then exit 77 ; fi # Fisher config cat < "$TMPDIR"/cfg.f robx=0.415 min_dev=0.1 ham_cutoff=0.0 EOF # Fisher tristate cat < "$TMPDIR"/cfg.t robx=0.415 min_dev=0.1 ham_cutoff=0.1 terse_format = %1.1c %d spamicity_tags = S,h,u spamicity_formats = %6.2e %6.2e %0.6f EOF # suppress valgrind complaints about glibc::strchr.S cat < "$VG_SUPP" { ignore strchr problem Memcheck:Cond fun:strchr } EOF #V="-v" # verbosity level run_test() { tst="$1" IN="$SYSTEST/inputs/msg.$tst.txt" OT="$TMPDIR/msg.$tst.$mth" if [ -n "$V" ] ; then OT="$OT.$V" ; fi OPTS="-e -t $V $CFG" eval $VALGRIND --suppressions=${VG_SUPP} $BOGOFILTER $OPTS < $IN > $OT if test -s "$TMPDIR"/vg.out ; then cat "$TMPDIR"/vg.out ; exit 2 ; fi } for mth in f t ; do BOGOFILTER_DIR="$TMPDIR"/words.$mth CFG="-y 0" export BOGOFILTER_DIR if [ -d $BOGOFILTER_DIR ] ; then rm -f $BOGOFILTER_DIR/* ; else : ; fi mkdir -p $BOGOFILTER_DIR $BOGOFILTER "$CFG" -c "$TMPDIR"/cfg.$mth -s < "$SYSTEST"/inputs/spam.mbx $BOGOFILTER "$CFG" -c "$TMPDIR"/cfg.$mth -n < "$SYSTEST"/inputs/good.mbx # if [ $verbose -gt 0 ] ; then $BOGOUTIL -w $BOGOFILTER_DIR .MSG_COUNT ; fi for tst in 3 ; do run_test $tst done done rm $VG_SUPP bogofilter-1.2.4/src/tests/t.maildir0000755000175000017500000000200012163572275015602 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # maildir.YYYYMMDD. This is useful when something is different. # # ./inputs/spam.mbx & ./inputs/good.mbx - test inputs # ./outputs - known correct outputs # # maildir.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame OUT="$TMPDIR"/maildir.out CORRECT="$SYSTEST/outputs/maildir.out" for f in good spam ; do mkdir "$TMPDIR"/$f mkdir "$TMPDIR"/$f/cur mkdir "$TMPDIR"/$f/tmp mkdir "$TMPDIR"/$f/new cat ${srcdir}/inputs/$f.mbx | ( cd "$TMPDIR"/$f/new && splitmbox ) done $BOGOFILTER -C -D -n -B "$TMPDIR"/good $BOGOFILTER -C -D -s -B "$TMPDIR"/spam words=".MSG_COUNT Lotus Magazine Min Service connection more most set that unsubscribe" $BOGOUTIL -w "$WORDLIST" $words > "$OUT" || rm -f "$OUT" if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi bogofilter-1.2.4/src/tests/t.dump.load0000755000175000017500000000554712163572275016067 0ustar sezsez#!/bin/sh #Test database maintenance using bogoutil's dump/load capabilities. . ${srcdir:=.}/t.frame BASE="dump.load" OUT="$TMPDIR/$BASE.out" DATA="$TMPDIR/$BASE.${DB_EXT}" SUM="$BASE.sum" GREP="grep -v /dump.load-" SORT="sort" clear_database() { rm -f "$DATA" rm -f "$TMPDIR"/__db.* rm -f "$TMPDIR"/log.* } clear_database LEN="--max-token-len 30" #load database $BOGOUTIL -C $LEN -l "$DATA" -y 20020815 < "$srcdir"/inputs/$BASE.inp #dump database (no restrictions, all dates should by 'yday') $BOGOUTIL -C $LEN -d "$DATA" -y 20020815 | $SORT > "$TMPDIR"/dump.load-1.txt #update some words, including some old dates $BOGOUTIL -C $LEN -l "$DATA" -y 20021215 < "$srcdir"/inputs/$BASE.upd #dump database $BOGOUTIL -C $LEN -d "$DATA" | grep -v "^.ENCODING" | $SORT > "$TMPDIR"/dump.load-2.txt #confirm that updated words have different counts and dates ( diff "$TMPDIR"/dump.load-1.txt "$TMPDIR"/dump.load-2.txt ; echo "" ) | $GREP | tee "$TMPDIR"/diff.1.2.txt >> "$OUT" #dump wordlist, excluding oldest entries $BOGOUTIL -C $LEN -a 20020815 -d "$DATA" | grep -v "^.ENCODING" | $SORT > "$TMPDIR"/dump.load-3.txt #confirm exclusion of oldest entries ( diff "$TMPDIR"/dump.load-2.txt "$TMPDIR"/dump.load-3.txt ; echo "" ) | $GREP | tee "$TMPDIR"/diff.2.3.txt >> "$OUT" #dump wordlist, excluding oldest, shortest, and longest entries # and'ing of command line qualifiers forced changing next line to two lines #BOGOUTIL -C $LEN -a 20020815 -s4,30 -d "$DATA" | $SORT > "$TMPDIR"/dump.load-4.txt $BOGOUTIL -C $LEN -a 20020815 -d "$DATA" | $SORT > "$TMPDIR"/dump.load-4.txt clear_database $BOGOUTIL -C $LEN -l "$DATA" < "$TMPDIR"/dump.load-4.txt $BOGOUTIL -C $LEN -s4,30 -d "$DATA" | $SORT > "$TMPDIR"/dump.load-4.txt #confirm exclusion of oldest, shortest(<, and longest entries ( diff "$TMPDIR"/dump.load-3.txt "$TMPDIR"/dump.load-4.txt ; echo "" ) | $GREP | tee "$TMPDIR"/diff.3.4.txt >> "$OUT" clear_database #load wordlist, excluding shortest entries $BOGOUTIL -C $LEN -s5,30 -l "$DATA" < "$TMPDIR"/dump.load-4.txt #dump using replace_non-ascii option $BOGOUTIL -C $LEN -n -d "$DATA" | $SORT > "$TMPDIR"/dump.load-5.txt #confirm effect of non-ascii option ( diff "$TMPDIR"/dump.load-4.txt "$TMPDIR"/dump.load-5.txt ; echo "" ) | $GREP | tee "$TMPDIR"/diff.4.5.txt >> "$OUT" clear_database #load wordlist non-ascii list and dump to show value combining $BOGOUTIL -C $LEN -a 20021010 -l "$DATA" < "$TMPDIR"/dump.load-5.txt $BOGOUTIL -C $LEN -a 20021010 -d "$DATA" | $SORT > "$TMPDIR"/dump.load-6.txt #confirm token merging ( diff "$TMPDIR"/dump.load-5.txt "$TMPDIR"/dump.load-6.txt ; echo "" ) | $GREP | tee "$TMPDIR"/diff.5.6.txt >> "$OUT" if [ "$BF_SAVEDIR" ] ; then . "$srcdir"/t.save ; fi for i in "${SYSTEST}"/outputs/dump.load-?.out ; do j="$TMPDIR"/`basename "$i" .out`.txt if [ $verbose -eq 0 ]; then cmp "$i" "$j" else diff $DIFF_BRIEF "$i" "$j" fi done bogofilter-1.2.4/src/tests/t.grftest0000755000175000017500000000504212163572272015645 0ustar sezsez#!/bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # grftest.YYYYMMDD. This is useful when something is different. # # ./inputs - test inputs # ./outputs - known correct outputs # esp. grftest.out # # grftest.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame # Fisher config cat < "$TMPDIR"/cfg.f robx=0.415 min_dev=0.1 ham_cutoff=0.0 EOF # Fisher tristate cat < "$TMPDIR"/cfg.t robx=0.415 min_dev=0.1 ham_cutoff=0.1 terse_format = %1.1c %d spamicity_tags = s,h,u spamicity_formats = %0.6f %0.6f %0.6f EOF V="v" # verbosity level map_rc() { ( set +e "$@" a=$? [ $a -eq 0 ] && exit 0 [ $a -eq 1 ] && exit 0 [ $a -eq 2 ] && exit 0 exit $a ) } run_test() { id="$1" fil="$2" ver="$3" OUT="$TMPDIR"/tests/msg.$fil.$mth.$ver OPTS="-t -$ver -y 0" map_rc $BOGOFILTER $OPTS -c "$TMPDIR"/cfg.$mth < "$SYSTEST/inputs/msg.$id.txt" > "$TMPDIR/tests-$mth" sed 's/,.version=.*//' < "$TMPDIR/tests-$mth" > "$OUT" } if [ -d "$TMPDIR"/tests ] ; then rm -f "$TMPDIR/tests/"* ; else : ; fi mkdir -p "$TMPDIR/tests" for mth in f t ; do BOGOFILTER_DIR="$TMPDIR"/words.$mth CFG="-y 0" export BOGOFILTER_DIR if [ -d "$BOGOFILTER_DIR" ] ; then rm -f "$BOGOFILTER_DIR"/* ; else : ; fi mkdir -p "$BOGOFILTER_DIR" $BOGOFILTER -y 0 -c "$TMPDIR/cfg.$mth" -s < "$SYSTEST/inputs/spam.mbx" $BOGOFILTER -y 0 -c "$TMPDIR"/cfg.$mth -n < "$SYSTEST/inputs/good.mbx" for f in "$BOGOFILTER_DIR"/*.$DB_EXT ; do n=`basename "$f" .$DB_EXT` $BOGOUTIL -d "$BOGOFILTER_DIR/$n.$DB_EXT" > "$BOGOFILTER_DIR/$n.txt" done # [ $verbose -gt 0 ] && $BOGOUTIL -w $BOGOFILTER_DIR .MSG_COUNT # # run tests for msg.[1-8].txt # for msg in "$SYSTEST/inputs/"msg.?.txt ; do tst=`echo "$msg" | sed "s@$SYSTEST/inputs/msg.@@" | sed 's@.txt@@'` args="$tst $tst $V" run_test $args done done OUT="grftest.out" printf "%2s %-10s %-10s\n" id fisher tristate > "$TMPDIR/tests/$OUT" for out in "$TMPDIR"/tests/msg.?.t.$V ; do id=`echo "$out" | sed "s@$TMPDIR/tests/msg.@@" | sed "s@.t.$V@@"` f=`head -1 "$TMPDIR"/tests/msg.$id.f.$V | tr "HS" "hs"` t=`head -1 "$TMPDIR/tests/msg.$id.t.$V"` printf "%2s %c %s %c %s\n" $id $f $t >> "$TMPDIR"/tests/$OUT done if [ "$BF_SAVEDIR" ] ; then . "$srcdir"/t.save ; fi if [ $verbose -eq 0 ]; then cmp "$OUTPUTS"/$OUT "$TMPDIR"/tests/$OUT else diff $DIFF_BRIEF "$OUTPUTS"/$OUT "$TMPDIR"/tests/$OUT fi bogofilter-1.2.4/src/tests/t.probe0000755000175000017500000000414712163572274015305 0ustar sezsez#!/bin/sh -x # verify that --db-transaction option is given # precedence over probing for a database environment # to create a wordlist without transaction files: # # bogofilter -d dir -n < /dev/null # # or: # # bogofilter -d dir -n --db-transaction=no < /dev/null # # to create a wordlist with transaction files, or # to convert to a wordlist with transaction files # # bogofilter -d dir -n --db-transaction=yes < /dev/null . ${srcdir=.}/t.frame # Skip test if non-default configuration if [ -n "$USE_TRANSACTIONS" ] ; then exit 77 fi AUTO_XA=`$BOGOFILTER -C -V 2>&1 | sed -n '2p;' | grep AUTO-XA || :` if [ -z "$AUTO_XA" ]; then exit 77 fi unset BF_FORCE_NON_TRANSACTIONAL || : unset BF_FORCE_TRANSACTIONAL || : OUT="$TMPDIR/test.out" MSG="$TMPDIR"/test.msg LOG="$BOGOFILTER_DIR/log.0000000001" # cksum is POSIX compliant ($HASHTOOL isn't) HASHTOOL=cksum NO="--db-transaction=no" YES="--db-transaction=yes" cat < "$MSG" this is a test message EOF # clean up - t.frame may have created everything for us rm -f "$BOGOFILTER_DIR"/log.?????????? \ "$BOGOFILTER_DIR"/__db.??? \ "$BOGOFILTER_DIR"/lockfile-? # transactions=no; no log file $BOGOFILTER -C $NO -H -n -I "$MSG" if [ -f "$LOG" ] ; then echo "Failed test 't=n'" >> "$OUT" exit 1 fi # probe=yes, no environment; no log file $BOGOFILTER -C -H -n -I "$MSG" if [ -f "$LOG" ] ; then echo "Failed test 'p=y, e=n'" >> "$OUT" exit 1 fi # transactions=yes; log file should appear $BOGOFILTER -C $YES -H -s -I "$MSG" if [ ! -f "$LOG" ] ; then echo "Failed test 't=y'" >> "$OUT" exit 1 fi # probe=yes; log file should change BEF=`$HASHTOOL "$LOG"` $BOGOFILTER -C -H -n -I "$MSG" AFT=`$HASHTOOL "$LOG"` if [ "$BEF" = "$AFT" ] ; then echo "Failed test 'p=y, e=y'" >> "$OUT" echo BEF: $BEF >> "$OUT" echo AFT: $AFT >> "$OUT" exit 1 fi # probe=yes, transactions=no; log file should not change BEF=`$HASHTOOL "$LOG"` $BOGOFILTER -C $NO -H -s -I "$MSG" AFT=`$HASHTOOL "$LOG"` if [ "$BEF" != "$AFT" ] ; then echo "Failed test 'p=y, t=n'" >> "$OUT" echo BEF: $BEF >> "$OUT" echo AFT: $AFT >> "$OUT" exit 1 fi bogofilter-1.2.4/src/tests/t.multiple.wordlists0000755000175000017500000000665412163572274020067 0ustar sezsez#!/bin/sh . ${srcdir=.}/t.frame OUT="$TMPDIR"/test.out CORRECT="$OUTPUTS"/multiple.wordlists.ref CF_DEFAULT=default.cf CF_IGN_REG=ign_reg.cf CF_IGN_USR_SYS=ign_usr_sys.cf CF_MRG_USR_SYS=mrg_usr_sys.cf # single wordlist cat < "$TMPDIR"/$CF_DEFAULT bogofilter_dir=$TMPDIR EOF # ignore list, single wordlist cat < "$TMPDIR"/$CF_IGN_REG bogofilter_dir=$TMPDIR wordlist i,ign,ignore.$DB_EXT,1 wordlist r,wrd,wordlist.$DB_EXT,2 EOF # ignore list, user & system wordlists cat < "$TMPDIR"/$CF_IGN_USR_SYS bogofilter_dir=$TMPDIR wordlist r,sys,system.$DB_EXT,6 wordlist i,ign,ignore.$DB_EXT,4 wordlist r,usr,user.$DB_EXT,5 EOF # merged user & system wordlists cat < "$TMPDIR"/$CF_MRG_USR_SYS bogofilter_dir=$TMPDIR wordlist r,usr,user.$DB_EXT,7 wordlist r,sys,system.$DB_EXT,7 EOF # files for building databases cat < "$TMPDIR"/ignore.txt ignore user_low system_hi EOF cat < "$TMPDIR"/wordlist.txt .MSG_COUNT 1 1 .WORDLIST_VERSION 20040500 0 ignore 2 7 common 2 7 word_low 2 7 word_hi 7 2 EOF cat < "$TMPDIR"/user.txt .MSG_COUNT 1 1 .WORDLIST_VERSION 20040500 0 ignore 2 8 common 2 8 user_low 2 8 user_hi 8 2 EOF cat < "$TMPDIR"/system.txt .MSG_COUNT 10 10 .WORDLIST_VERSION 20040500 0 ignore 2 9 common 2 9 system_low 2 9 system_hi 9 2 EOF cat < "$TMPDIR"/test.ref .MSG_COUNT 1 1 .WORDLIST_VERSION 20040500 0 system EOF # test message cat < "$TMPDIR"/message ignore common user_low system_hi word_low word_hi user_low user_hi system_low system_hi message EOF # suppress version info in output BFOPTS="-D -H -e -m0.1 -y 0 --stats-in-header=no" BFHEAD='--header-format=%h: %c, tests=bogofilter, spamicity=%p' # build wordlists $BOGOUTIL -l "$TMPDIR"/ignore.$DB_EXT < "$TMPDIR"/ignore.txt $BOGOUTIL -l "$TMPDIR"/wordlist.$DB_EXT < "$TMPDIR"/wordlist.txt $BOGOUTIL -l "$TMPDIR"/user.$DB_EXT < "$TMPDIR"/user.txt $BOGOUTIL -l "$TMPDIR"/system.$DB_EXT < "$TMPDIR"/system.txt (echo "#### 1: score message using each wordlist ####"; echo) >> "$OUT" for DB in "$TMPDIR"/*.$DB_EXT ; do N=`basename "${DB}" .$DB_EXT` printf "%-12s" $N: >> "$OUT" $BOGOFILTER $BFOPTS "$BFHEAD" -v -C --wordlist=r,wordlist,$N.$DB_EXT,1 -I "$TMPDIR"/message >> "$OUT" done echo >> "$OUT" (echo "#### 1: score message using each config file ####"; echo) >> "$OUT" for CFG in "$TMPDIR"/*.cf ; do N=`basename "$CFG"` echo Using $N: >> "$OUT" $BOGOFILTER $BFOPTS "$BFHEAD" -vvv -c "$CFG" -I "$TMPDIR"/message >> "$OUT" echo >> "$OUT" done (echo "#### Update user using $CF_IGN_USR_SYS ####"; echo) >> "$OUT" # Add message to user.$DB_EXT (first regular wordlist in CF_IGN_USR_SYS) echo >> "$OUT" echo common message ignore | $BOGOFILTER $BFOPTS "$BFHEAD" -n -c "$TMPDIR"/$CF_IGN_USR_SYS (echo "#### 2: score message using each wordlist ####"; echo) >> "$OUT" for DB in "$TMPDIR"/*.$DB_EXT ; do N=`basename "$DB" .$DB_EXT` printf "%-12s" $N: >> "$OUT" $BOGOFILTER $BFOPTS "$BFHEAD" -v -C --wordlist=r,wordlist,$N.$DB_EXT,1 -I "$TMPDIR"/message >> "$OUT" done echo >> "$OUT" (echo "#### 2: score message using each config file ####"; echo) >> "$OUT" for CFG in "$TMPDIR"/*.cf ; do N=`basename "$CFG"` echo Using $N: >> "$OUT" $BOGOFILTER $BFOPTS "$BFHEAD" -vvv -c "$CFG" -I "$TMPDIR"/message >> "$OUT" echo >> "$OUT" done # compare test output to reference output if [ $verbose -eq 0 ]; then diff "$CORRECT" "$OUT" cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi bogofilter-1.2.4/src/tests/t.MH0000755000175000017500000000163412163572275014501 0ustar sezsez#! /bin/sh # Note: When run via "make check", test output files are automatically deleted. # When run from the command line, output files are left in directory # MH.YYYYMMDD. This is useful when something is different. # # ./inputs/spam.mbx & ./inputs/good.mbx - test inputs # ./outputs - known correct outputs # # MH.YYYYMMDD: # directory containing individual output files NODB=1 . ${srcdir=.}/t.frame OUT="$TMPDIR"/MH.out CORRECT="$OUTPUTS/MH.out" for f in good spam ; do mkdir "$TMPDIR"/$f cat ${srcdir}/inputs/$f.mbx | (cd "$TMPDIR"/$f && splitmbox ) done $BOGOFILTER -C -D -n $v -B "$TMPDIR"/good $BOGOFILTER -C -D -s $v -B "$TMPDIR"/spam wordlist=".MSG_COUNT Lotus Magazine Min Service connection more most set that unsubscribe" $BOGOUTIL -C -w "$WORDLIST" $wordlist > "$OUT" || rm -f "$OUT" if [ $verbose -eq 0 ]; then cmp "$CORRECT" "$OUT" else diff $DIFF_BRIEF "$CORRECT" "$OUT" fi bogofilter-1.2.4/src/tests/t.passthrough-hb0000755000175000017500000000376012163572274017134 0ustar sezsez#! /bin/sh . ${srcdir:=.}/t.frame # t.passthrough-hb # # test for correct detection of line separating header and body $BOGOFILTER -e -p -C < "$srcdir/inputs/headerbody.txt" > "$TMPDIR/output" $AWK '/^X-Bogosity:/ { bl=NR } \ /^Summary:/ { sl=NR } \ END { if (sl > bl) { exit 1; } }' \ < "$TMPDIR"/output CFG="$TMPDIR/test.cf" cat >> "$CFG" < "$TMPDIR"/reference.2 < "$TMPDIR/reference.3" < "$TMPDIR"/reference.4 Header: no body^ head2^ Another-Header: head4 -- X-Bogosity should be next^ X-Bogosity: Unsure, tests=bogofilter, spamicity=0.520000^ ^ after non-empty blank^ ^ no body^ EOF printf "Header: body and empty line\n head2\nAnother-Header: head3\n \nafter non-empty blank -- X-Bogosity should be next\n\nafter empty line" > "$TMPDIR/input.2" $BOGOFILTER -e -p -c "$CFG" < "$TMPDIR"/input.2 > "$TMPDIR/results.2" printf "Header: no body\n head2\nAnother-Header: head3 -- X-Bogosity should be next\n \nafter non-empty blank\n \nno body" > "$TMPDIR/input.3" $BOGOFILTER -e -p -c "$CFG" < "$TMPDIR"/input.3 > "$TMPDIR/results.3" printf "Header: no body\r\n head2\r\nAnother-Header: head4 -- X-Bogosity should be next\r\n \r\nafter non-empty blank\r\n \r\nno body" > "$TMPDIR/input.4" $BOGOFILTER -e -p -c "$CFG" < "$TMPDIR"/input.4 > "$TMPDIR/results.4" for f in 2 3 4 ; do if [ $verbose -eq 0 ]; then cmp "$TMPDIR/reference.$f" "$TMPDIR/results.$f" else set +e diff $DIFF_BRIEF "$TMPDIR"/reference.$f "$TMPDIR/results.$f" fi done bogofilter-1.2.4/src/tests/t.ctype0000644000175000017500000000003112163572275015304 0ustar sezsez#! /bin/sh exec ./ctype bogofilter-1.2.4/src/tests/t.lexer.qpcr0000644000175000017500000000067112163572275016255 0ustar sezsez#! /bin/sh # This check sees if bogofilter can reassemble lines with spurious CR # during QP decoding. It used to fail up to and including 1.2.0 with # lines ending in =, not considering these as continuation. . ${srcdir:=.}/t.frame ifn=mime-qp-cont-with-cr.txt ofn=mime-qp-cont-with-cr.out efn=mime-qp-cont-with-cr.exp cat "$srcdir/inputs/$ifn" \ | $BOGOLEXER -p -C > "$TMPDIR/$ofn" diff $DIFF_BRIEF "$OUTPUTS/$efn" "$TMPDIR/$ofn" bogofilter-1.2.4/src/convert_unicode.h0000644000175000017500000000144112163572272016173 0ustar sezsez/* $Id: convert_unicode.h 6882 2010-03-14 14:16:28Z m-a $ */ /***************************************************************************** NAME: charset_unicode.h -- constants and declarations for charset_unicode.c AUTHOR: David Relson ******************************************************************************/ #ifndef CHARSET_UNICODE_H #define CHARSET_UNICODE_H #include extern void init_charset_table_iconv(const char *from_charset, const char *to_charset); extern iconv_t bf_iconv_open( const char *to_charset, const char *from_charset ); #if defined(CP866) && !defined(ENABLE_UNICODE) && !defined(DISABLE_UNICODE) extern int decode_and_htmlUNICODE_to_cp866(byte *buf, int len); #endif #endif /* CHARSET_UNICODE_H */ bogofilter-1.2.4/src/msgcounts.c0000644000175000017500000000343712163572272015031 0ustar sezsez/* $Id: msgcounts.c 6988 2013-01-20 14:02:48Z m-a $ */ /***************************************************************************** NAME: msgcounts.c -- routines for setting & computing .MSG_COUNT values AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include "msgcounts.h" /* Globals */ static char msg_count_buff[MSG_COUNT_MAX_LEN]; int msg_count_leng = MSG_COUNT_MAX_LEN; /* DO NOT MAKE THIS SIZE_T! */ char *msg_count_text = msg_count_buff; static const char *msg_count_header = "\"" MSG_COUNT "\" "; static size_t msg_count_header_len = 0; uint msgs_good = 0; uint msgs_bad = 0; static bool saved = false; /* Function Definitions */ token_t read_msg_count_line(void) { bool msg_sep; if (!saved) { if (fgets(msg_count_buff, sizeof(msg_count_buff), fpin) == NULL) { msg_count_leng = 0; return NONE; } } msg_count_leng = strlen(msg_count_buff); msg_sep = msg_count_buff[1] == '.' && memcmp(msg_count_buff, msg_count_header, msg_count_header_len) == 0; if (!saved && msg_sep) { saved = true; return NONE; } else { saved = false; if (msg_sep) return MSG_COUNT_LINE; else return BOGO_LEX_LINE; } } bool msgcount_more(void) { bool val = saved; saved = false; return val; } void set_msg_counts(u_int32_t good, u_int32_t spam) { msgs_bad = spam; msgs_good = good; } void set_msg_counts_from_str(char *str) { uint b, g; b = atoi(str); str = strchr(str, ' ') + 1; g = atoi(str); set_msg_counts(g, b); msg_count_header_len= strlen(msg_count_header); } long msg_count_get_token(byte **output) { *output = (byte *)msg_count_text; return msg_count_leng; } bogofilter-1.2.4/src/bftypes.h0000644000175000017500000000635612163572304014467 0ustar sezsez/* $Id: bftypes.h 6023 2005-06-04 12:47:16Z relson $ */ /*****************************************************************************/ /** \file bftypes.h * \brief Type definitions for bogofilter. * * This file shall define the bool and uint32_t types. * it shall include inttypes.h and stdbool.h if present. * * Parts were taken from autoconf.info. */ /*****************************************************************************/ #ifndef BFTYPES_H #define BFTYPES_H #ifndef CONFIG_H # define CONFIG_H # include "config.h" #endif /** Define C99 style _Bool type for C89 compilers. */ #if HAVE_STDBOOL_H # include #else # if ! HAVE__BOOL # ifdef __cplusplus typedef bool _Bool; # else typedef unsigned char _Bool; # endif # endif /** alias C99-standard _Bool type to bool */ # define bool _Bool /** default value for false */ # define false 0 /** default value for true */ # define true 1 /* internal - marker that we have defined true/false */ # define __bool_true_false_are_defined 1 #endif #ifdef HAVE_SYS_TYPES_H #include #endif #ifdef HAVE_INTTYPES_H #include #elif HAVE_STDINT_H #include #endif /** unsigned 32-bit integer */ #ifndef HAVE_UINT32_T #ifdef HAVE_U_INT32_T typedef u_int32_t uint32_t; #elif SIZEOF_LONG == 4 typedef unsigned long uint32_t; #elif SIZEOF_INT == 4 typedef unsigned int uint32_t; #elif SIZEOF_SHORT == 4 typedef unsigned short uint32_t; #else #error we do not know how to define uint32_t #endif #endif /* HAVE_UINT32_T */ #ifndef HAVE_U_INT32_T typedef uint32_t u_int32_t; #endif /** signed 32-bit integer */ #ifndef HAVE_INT32_T #if SIZEOF_LONG == 4 typedef signed long int32_t; #elif SIZEOF_INT == 4 typedef signed int int32_t; #elif SIZEOF_SHORT == 4 typedef signed short int32_t; #else #error we do not know how to define int32_t #endif #endif /* HAVE_INT32_T */ /** unsigned 16-bit integer */ #ifndef HAVE_UINT16_T #if SIZEOF_SHORT == 2 typedef unsigned short uint16_t; #else #error we do not know how to define uint16_t #endif #endif #ifndef HAVE_U_INT16_T typedef uint16_t u_int16_t; #endif /** signed 16-bit integer */ #ifndef HAVE_INT16_T #if SIZEOF_SHORT == 2 typedef signed short int16_t; #else #error we do not know how to define int16_t #endif #endif /** unsigned 8-bit integer */ #ifndef HAVE_U_INT8_T typedef unsigned char u_int8_t; #endif /** alias for unsigned long */ #ifndef HAVE_ULONG typedef unsigned long ulong; #endif /** alias for unsigned int */ #ifndef HAVE_UINT typedef unsigned int uint; #endif #if !defined(HAVE_SSIZE_T) typedef int ssize_t; #endif /** type for getrlimit/setrlimit functions (some systems don't define this * type) */ #ifndef HAVE_RLIM_T typedef int rlim_t; #endif /** prevent db.h from redefining the types above */ #undef __BIT_TYPES_DEFINED__ #define __BIT_TYPES_DEFINED__ 1 /* splint crutch */ #ifdef __LCLINT__ typedef uint32_t u_int32_t; typedef uint16_t u_int16_t; typedef uint8_t u_int8_t; #define false 0 #define true 1 #endif /** Data type for a date stamp in YYYY*10000 + MM*100 + DD format */ typedef uint32_t YYYYMMDD; /* sanity check */ #ifdef HAVE_SIZE_T #if SIZEOF_INT > SIZEOF_SIZE_T #error "int is wider than size_t. The current code is not designed to work on such systems and needs review." #endif #endif #endif /* BFTYPES_H */ bogofilter-1.2.4/src/wordhash.main.c0000644000175000017500000000147412163572304015544 0ustar sezsez/* $Id: wordhash.main.c 6797 2009-02-14 21:13:00Z relson $ */ #include "common.h" #include "wordhash.h" typedef struct { int count; } wh_elt_t; /* function definitions */ static void word_init(void *vw){ wh_elt_t *w = vw; w->count = 0; } static void dump_hash (wordhash_t * h) { hashnode_t *p; for (p = wordhash_first (h); p != NULL; p = wordhash_next (h)) { word_t *key = p->key; (void)word_puts(key, 0, stdout); (void)printf (" %d\n", ((wh_elt_t *) p->data)->count); } } int main (void) { wordhash_t *h = wordhash_new (); char buf[100]; wh_elt_t *w; while (scanf ("%99s", buf) != EOF) { word_t *t = word_news(buf); w = wordhash_insert (h, t, sizeof (word_t), &word_init); w->count++; } dump_hash (h); wordhash_free (h); return 0; } bogofilter-1.2.4/src/charset.c0000644000175000017500000000553212163572304014432 0ustar sezsez/* $Id: charset.c 6917 2010-07-05 15:59:15Z m-a $ */ /***************************************************************************** NAME: charset.c -- provide charset support for bogofilter's lexer. Note: Character translation is done to make life easier for the lexer. Text is changed only after the message has been saved for passthrough. The end user (mail reader) never sees any changes - only the lexer. AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include "charset.h" #include "convert_charset.h" #ifndef DISABLE_UNICODE #include "convert_unicode.h" #endif #include "xmalloc.h" #include "xstrdup.h" #define SP ' ' #ifndef DEFAULT_CHARSET #define DEFAULT_CHARSET "us-ascii" #endif const char *charset_default = DEFAULT_CHARSET; const char *charset_unicode = "UTF-8"; byte charset_table[256]; byte casefold_table[256]; #define DEBUG #undef DEBUG #ifndef DEBUG #define PRINT_CHARSET_TABLE #else #define PRINT_CHARSET_TABLE print_charset_table() #undef DEBUG_GENERAL #define DEBUG_GENERAL(level) (verbose >= level) #endif #ifdef DEBUG static void print_charset_table(void) { int c,r,i; char ch; if (!DEBUG_GENERAL(1)) return; printf( "\n" ); for (r=0; r<4; r+=1) { for (c=0; c<64; c+=1) { i=r*64+c; ch=charset_table[i]; if (ch != 0x08 && ch != 0x09 && ch != '\n' && ch != '\r') printf(" %02X.%2c.%02X", i, ch, ch); else printf(" %02X.%02X.%02X", i, ch, ch); if ((c & 15) == 15) printf( "\n" ); } } printf( "\n" ); } #endif void init_charset_table(const char *charset_name) { #ifdef DISABLE_UNICODE init_charset_table_orig(charset_name); #else #ifdef ENABLE_UNICODE init_charset_table_iconv(charset_name, charset_unicode); #else if (encoding != E_UNICODE) init_charset_table_orig(charset_name); else init_charset_table_iconv(charset_name, charset_unicode); #endif #endif return; } /* like set_charset() but charset is in form blabla="CharsetName" */ void got_charset(const char *charset) { set_charset(strchr(charset, '=') + 1); } /* like got_charset() but charset is pure charset name */ void set_charset(const char *charset) { bool q = (charset[0] == '"'); char *s, *d; char *t = xstrdup(charset + q); for (s = d = t; *s != '\0'; s++) { char c = tolower((unsigned char)*s); /* map upper case to lower */ if (c == '_') /* map underscore to dash */ c = '-'; if (c == '-' && /* map "iso-" to "iso" */ d - t == 3 && /* ensure 3 chars avail */ memcmp(t, "iso", 3) == 0) continue; if (q && c == '"') break; *d++ = c; } *d = '\0'; if (DEBUG_CONFIG(0)) fprintf(dbgout, "got_charset( '%s' )\n", t); init_charset_table( t ); xfree(t); } bogofilter-1.2.4/src/tunelist.c0000644000175000017500000000673312163572304014654 0ustar sezsez/* $Id: tunelist.c 6714 2008-04-20 15:27:06Z relson $ */ /***************************************************************************** NAME: tunelist.c -- definitions and prototypes of list structures for bogotune. includes msglist_t, filelist_t, and tunelist_t. ******************************************************************************/ #include "common.h" #include "tunelist.h" #include "xmalloc.h" #include "xstrdup.h" flhead_t *filelist_new(const char *name) { flhead_t *list = xcalloc(1, sizeof(flhead_t)); list->name = xstrdup(name); return list; } void filelist_add(flhead_t *list, const char *name) { flitem_t *item = xcalloc(1, sizeof(flitem_t)); item->name = xstrdup(name); if (list->head == NULL) list->head = item; if (list->tail != NULL) list->tail->next = item; list->tail = item; list->count += 1; if (verbose > 1000) printf("%s: h %p (%u) t %p w %p\n", list->name, (void *)list->head, list->count, (void *)list->tail, name); return; } void filelist_free(flhead_t *list) { flitem_t *item, *next; for (item = list->head; item != NULL; item = next) { next = item->next; xfree(item->name); xfree(item); } xfree(list->name); xfree(list); return; } mlhead_t *msglist_new(const char *label) { mlhead_t *v = xcalloc(1, sizeof(mlhead_t)); v->name = xstrdup(label); return v; } void msglist_add(mlhead_t *list, wordhash_t *wh) { mlitem_t *item = xcalloc(1, sizeof(mlitem_t)); if (list->head == NULL) list->head = item; if (list->tail != NULL) list->tail->next = item; list->tail = item; list->count += 1; item->wh = wh; if (verbose > 1000) printf("%s: h %p (%u) t %p w %p %4lu\n", list->name, (void *)list->head, list->count, (void *)list->tail, (void *)wh, (unsigned long)wh->count); return; } void msglist_print(mlhead_t *list) { int count = 0; mlitem_t *item; if (verbose <= 2) return; printf("%s:\n", list->name); if (list->count == 0) printf(" (empty)\n"); for (item = list->head; item != NULL; item = item->next) { wordhash_t *wh = item->wh; printf(" %4d %p %4lu\n", count++, (void *)item, (unsigned long)wh->count); } return; } void msglist_free(mlhead_t *list) { mlitem_t *item, *next; for (item = list->head; item != NULL; item = next) { next = item->next; wordhash_free(item->wh); xfree(item); } xfree(list->name); xfree(list); return; } tunelist_t *tunelist_new(const char *label) { tunelist_t *list = xcalloc( 1, sizeof(tunelist_t)); list->name = label; list->msgs = msglist_new("msgs"); list->u.r.r0 = msglist_new("r0"); list->u.r.r1 = msglist_new("r1"); list->u.r.r2 = msglist_new("r2"); return list; } void tunelist_print(tunelist_t *list) { printf("%s (%u):\n", list->name, list->count); msglist_print(list->u.r.r0); /* run sets */ msglist_print(list->u.r.r1); msglist_print(list->u.r.r2); return; } void tunelist_free(tunelist_t *list) { if (list == NULL) return; wordhash_free(list->train); /* training */ msglist_free(list->msgs); msglist_free(list->u.r.r0); /* run sets */ msglist_free(list->u.r.r1); msglist_free(list->u.r.r2); xfree(list); return; } /* Count all messages */ uint count_messages(tunelist_t *list) { uint i; uint count = 0; for (i=0; i < COUNTOF(list->u.sets); i += 1) { count += list->u.sets[i]->count; } return count; } bogofilter-1.2.4/src/passthrough.c0000644000175000017500000001722512163572304015352 0ustar sezsez/* $Id: passthrough.c 6926 2010-07-06 21:52:54Z m-a $ */ /***************************************************************************** NAME: passthrough.c -- handle writing out message in passthrough ('-p') mode. ******************************************************************************/ #include "common.h" #include #include #include #include #ifdef HAVE_SYSLOG_H #include #endif #include "passthrough.h" #include "bogofilter.h" #include "bogoreader.h" /* for is_eol() */ #include "fgetsl.h" #include "format.h" #include "textblock.h" #include "xmalloc.h" #include "lexer.h" /* need have_body */ static const char *eol; char msg_register[256]; static char msg_bogofilter[256]; static char msg_spam_header[256]; size_t msg_register_size = sizeof(msg_register); /* Function Definitions */ static void cleanup_exit(ex_t exitcode, int killfiles) __attribute__ ((noreturn)); static void cleanup_exit(ex_t exitcode, int killfiles) { if (fpo) { output_cleanup(); } if (killfiles && outfname[0] != '\0') unlink(outfname); exit(exitcode); } #define ISSPACE(ch) (isspace(ch) || (ch == '\b')) /* check for non-empty blank line */ static bool is_blank_line(const char *line, size_t len) { if (have_body) return len == 0; while (len-- > 0) { byte ch = *line++; if (!ISSPACE(ch)) return false; } return true; } /** check if the line we're looking at is a header/body delimiter */ static bool is_hb_delim(const char *line, size_t len, bool strict_body) { if (strict_body) return len == 0; return is_blank_line(line, len); } static int read_mem(char **out, void *in) { textdata_t **text = in; if ((*text)->next) { int s = (*text)->size; *out = (char *)(*text)->data; *text = (*text)->next; return s; } return 0; } typedef int (*readfunc_t)(char **, void *); static void write_spam_info(void) { if (eol == NULL) /* special treatment of empty input */ eol = NL; /* print spam-status at the end of the header * then mark the beginning of the message body */ if (passthrough || verbose || terse) fprintf(fpo, "%s%s", msg_spam_header, eol); if (passthrough || verbose || Rtable) { verbose += passthrough; print_stats( fpo ); verbose -= passthrough; } } static bool write_header(rc_t status, readfunc_t rf, void *rfarg) { ssize_t rd; char *out; bool hadlf = true; bool seen_subj = false; bool seen_place_header = false; int bogolen = strlen(spam_header_name); const char *subjstr = "Subject:"; int subjlen = strlen(subjstr); eol = NULL; /* print headers */ while ((rd = rf(&out, rfarg)) > 0) { if (eol == NULL) { if (memcmp(out+rd-1, NL, 1) == 0) eol = NL; if (rd >=2 && memcmp(out+rd-2, CRLF, 2) == 0) eol = CRLF; } /* skip over spam_header_name ("X-Bogosity:") lines */ while (rd >= bogolen && memcmp(out, spam_header_name, bogolen) == 0) { while (((rd = rf(&out, rfarg)) > 0) && (out[0] == ' ' || out[0] == '\t') ) /* empty loop */ ; } /* detect spam_header_place line */ if ( !seen_place_header && *spam_header_place != '\0' && memcmp(out, spam_header_place, strlen(spam_header_place)) == 0) { seen_place_header = true; write_spam_info(); } /* detect end of headers */ if (is_eol(out, rd) || is_hb_delim(out, rd, have_body)) /* check for non-empty blank line */ break; /* rewrite "Subject: " line */ if (!seen_subj && rd >= subjlen) { const char *tag = NULL; if (status == RC_SPAM && spam_subject_tag != NULL) tag = spam_subject_tag; if (status == RC_UNSURE && unsure_subject_tag != NULL) tag = unsure_subject_tag; if (tag != NULL && strncasecmp(out, subjstr, subjlen) == 0) { seen_subj = true; (void) fprintf(fpo, "%.*s %s", subjlen, out, tag); if (out[subjlen] != ' ') fputc(' ', fpo); (void) fwrite(out + subjlen, 1, rd - subjlen, fpo); continue; } } hadlf = (out[rd-1] == '\n'); (void) fwrite(out, 1, rd, fpo); if (ferror(fpo)) cleanup_exit(EX_ERROR, 1); } if (!seen_place_header) write_spam_info(); if (!hadlf) (void) fputs(eol, fpo); return seen_subj; } static void write_body(readfunc_t rf, void *rfarg) { ssize_t rd; char *out; int hadlf = 1; /* If the message terminated early (without body or blank * line between header and body), enforce a blank line to * prevent anything past us from choking. */ (void) fputs(eol, fpo); /* print body */ while ((rd = rf(&out, rfarg)) > 0) { (void) fwrite(out, 1, rd, fpo); hadlf = (out[rd-1] == '\n'); if (ferror(fpo)) cleanup_exit(EX_ERROR, 1); } if (!hadlf) (void) fputs(eol, fpo); } static void build_spam_header(void) { if (passthrough || verbose || terse) { typedef char *formatter(char *buff, size_t size); formatter *fcn = terse ? format_terse : format_header; (*fcn)(msg_spam_header, sizeof(msg_spam_header)); } } void write_message(rc_t status) { readfunc_t rf = NULL; /* assignment to quench warning */ void *rfarg = 0; /* assignment to quench warning */ textdata_t *text; bool seen_subj = false; build_spam_header(); if (!passthrough) { write_spam_info(); } else { eol = NULL; /* initialize */ rf = read_mem; text = textblock_head(); rfarg = &text; seen_subj = write_header(status, rf, rfarg); if (!seen_subj) { if (status == RC_SPAM && spam_subject_tag != NULL) (void) fprintf(fpo, "Subject: %s%s", spam_subject_tag, eol); if (status == RC_UNSURE && unsure_subject_tag != NULL) (void) fprintf(fpo, "Subject: %s%s", unsure_subject_tag, eol); } write_body(rf, rfarg); if (verbose || Rtable) { if (fflush(fpo) || ferror(fpo)) cleanup_exit(EX_ERROR, 1); } } return; } void write_log_message(rc_t status) { #ifdef HAVE_SYSLOG_H format_log_header(msg_bogofilter, sizeof(msg_bogofilter)); switch (run_type) { case RUN_NORMAL: syslog(LOG_INFO, "%s\n", msg_bogofilter); break; case RUN_UPDATE: if (status == RC_UNSURE || msg_register[0] == '\0') syslog(LOG_INFO, "%s\n", msg_bogofilter); else { syslog(LOG_INFO, "%s, %s\n", msg_bogofilter, msg_register); msg_register[0] = '\0'; } break; default: syslog(LOG_INFO, "%s", msg_register); msg_register[0] = '\0'; } closelog(); #endif } /* we need to take care not to fclose() a shared file descriptor, if, * for instance we've fdopen()ed STDOUT_FILENO, becase we'd prevent * other streams accessing the same file descriptor from flushing their * caches. Prominent symptom: t.bogodir failure. */ static bool fpo_mayclose; /* if output_cleanup can close the file */ void output_setup(void) { assert(fpo == NULL); if (*outfname && passthrough) { fpo = fopen(outfname,"w"); fpo_mayclose = true; } else { fpo = fdopen(STDOUT_FILENO, "w"); fpo_mayclose = false; } if (fpo == NULL) { if (*outfname) fprintf(stderr, "Cannot open %s: %s\n", outfname, strerror(errno)); else fprintf(stderr, "Cannot fdopen STDOUT: %s\n", strerror(errno)); exit(EX_ERROR); } /* if we're not in passthrough mode, set line buffered mode just in * case some program that calls uses waits for our output in -T mode */ if (!passthrough) { setvbuf(fpo, NULL, _IOLBF, BUFSIZ); } } void output_cleanup(void) { int rc; rc = fflush(fpo); if (fpo_mayclose) rc |= fclose(fpo); fpo = NULL; if (rc) cleanup_exit(EX_ERROR, 1); } void passthrough_setup(void) { if (!passthrough) return; textblock_init(); } int passthrough_keepopen(void) { return false; } void passthrough_cleanup(void) { if (!passthrough) return; textblock_free(); } /* End */ bogofilter-1.2.4/src/bf_copy0000644000175000017500000000236212163573322014200 0ustar sezsez#! /bin/sh # bf_copy [-c] source_dir dest_dir # # use to copy wordlist.db and related files # from one directory to another # $Id: bf_copy.in 6750 2008-10-15 23:18:45Z clint $ set -e # die on errors : ${BOGOUTIL:=bogoutil} COMPACT=0 while test "$1" ; do case "$1" in -c) COMPACT=1 ;; --) shift ; break ;; -*) echo "unknown option $1" >&2 ; exit 1 ;; *) break; esac shift done if [ $# -ne 2 ] ; then echo 'usage: bf_copy [-c] source_dir dest_dir' echo " use -c to copy active logs, not all" exit 1 fi SRC="$1" DST="$2" # flush mempools $BOGOUTIL --db-checkpoint="$SRC" || : mkdir "$DST" TMP=bfc.$$.unneeded rm -f $TMP trap "rm -rf $TMP \"$DST\"" 0 if test $COMPACT -eq 1 ; then # don't copy unneeded logs $BOGOUTIL --db-list-logfiles="$SRC" >$TMP else : >$TMP fi # XXX FIXME - use Berkeley DB environment probing here LOGS=`ls "$SRC"/log.* 2>/dev/null | grep -v -F -f $TMP || :` if test "$LOGS" ; then cp -p $LOGS "$DST" ; fi if test -f "$SRC"/DB_CONFIG ; then cp -p "$SRC"/DB_CONFIG "$DST" ; fi for FILE in "$SRC"/*.db ; do SIZE=`$BOGOUTIL --db-print-pagesize="$FILE"` dd bs=$SIZE if=$FILE of="$DST/"`basename "$FILE"` done if test "$LOGS" ; then $BOGOUTIL --db-recover="$DST" ; fi rm -f $TMP trap - 0 bogofilter-1.2.4/src/version.sh0000755000175000017500000000236412163572272014665 0ustar sezsez# no shebang line here, we want explicit $(SHELL) from make! # version.sh # # create version.c to define BOGOFILTER_VERSION # # if VERSION in config.h does not contain 'svn', use its value. # if it does contain 'svn', append a date to it. # # We'll first try to find CVS/Entries files and use the most # current date from the files. To parse, we need Perl 5 and # the HTTP::Date module. # # If that fails, either because HTTP::Date is missing, Perl is # missing or we're building outside the CVS working directory, # we'll fall back to use the current date (GMT time zone) with # hour precision. # # On FreeBSD, HTTP::Date is part of the p5-libwww port. VERSION=$(grep define.VERSION config.h | awk '{print $3}' | tr -d '"') SUFFIX=$(echo $VERSION | egrep "\.svn$") srcdir=$1 shift set -e if [ ! -z "$SUFFIX" ]; then set +e DATE=$(svn info --xml "$srcdir" | grep date | sed 's,,,g' | perl -MHTTP::Date -e ' $date = str2time(<>); $date=HTTP::Date::time2isoz($date); $date=~tr/ :Z-/_/d; print $date, "\n"; ') || DATE= if [ "x$DATE" = "x" ] ; then DATE=$(env TZ=GMT date "+build_date_%Y%m%d_%Hh") fi VERSION="$VERSION.$DATE" fi echo "#include \"globals.h\"" echo "const char * const version = \"$VERSION\";" bogofilter-1.2.4/src/sighandler.h0000644000175000017500000000056412163572304015126 0ustar sezsez/* $Id: sighandler.h 5544 2005-02-25 18:45:26Z relson $ */ /***************************************************************************** NAME: sighandler.h AUTHOR: David Relson ******************************************************************************/ #ifndef SIGHANDLER_H #define SIGHANDLER_H void signal_setup(void); #endif bogofilter-1.2.4/src/find_home.c0000644000175000017500000000267312163572304014734 0ustar sezsez/* find_home.c -- library function to figure out the home dir of current user */ /* (C) 2002 by Matthias Andree * * This program is free software; you can redistribute it and/or modify * it under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * 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, it is in the file named * COPYING. */ /* $Id: find_home.c 6487 2006-05-29 14:46:55Z relson $ */ #include "system.h" #include #include #include #include #include "find_home.h" /* This function will try to figure out the home directory of the user. * * If read_env is not zero, it will try to obtain the HOME environment * variable and return if it is defined and not empty. * * Then, it will look up the password entry of the current effective * user id and return the pw_dir field. * * This function returns NULL in case of failure. */ const char *find_home(int read_env) { char *r; uid_t u; struct passwd *pw; if (read_env) { if ((r = getenv("HOME")) != NULL && *r != '\0') return r; } u = geteuid(); pw = getpwuid(u); if (pw != NULL) { return pw -> pw_dir; } return NULL; } bogofilter-1.2.4/src/mime.h0000644000175000017500000000434412163572304013735 0ustar sezsez/* $Id: mime.h 6278 2005-10-25 23:48:03Z relson $ */ /** \file mime.h * prototypes and definitions for mime.c */ #ifndef HAVE_MIME_H #define HAVE_MIME_H #include "buff.h" #include "word.h" enum mimetype { MIME_TYPE_UNKNOWN, MIME_MULTIPART, MIME_MESSAGE, MIME_TEXT, MIME_TEXT_PLAIN, MIME_TEXT_HTML, MIME_APPLICATION, MIME_IMAGE, MIME_AUDIO, MIME_VIDEO }; enum mimeencoding { MIME_ENCODING_UNKNOWN, MIME_7BIT, MIME_8BIT, MIME_BINARY, MIME_QP, MIME_BASE64, MIME_UUENCODE }; enum mimedisposition { MIME_DISPOSITION_UNKNOWN, MIME_ATTACHMENT, MIME_INLINE }; typedef struct mime_t mime_t; /** data element of the MIME stack */ struct mime_t { int depth; char *charset; char *boundary; /**< only valid if mime_type is MIME_MULTIPART or MIME_MESSAGE */ size_t boundary_len; enum mimetype mime_type; bool mime_dont_decode; enum mimeencoding mime_encoding; enum mimedisposition mime_disposition; mime_t *parent; mime_t *child; /* for mime_stack_dump() */ }; extern mime_t *msg_state; extern mime_t *msg_top; /** pop all elements from the stack until it is empty */ void mime_reset(void); void mime_add_child(mime_t *parent); /** set MIME boundary in current stack level to \a text */ void mime_boundary_set(word_t *text); /** checks if \a text is a MIME boundary of an enclosing MIME container, * pop stack so it remains on top, and pop it if a final boundary */ bool got_mime_boundary(word_t *text); /** Parse \a text that is assumed to begin with "Content-" and set the * top stack element's member variable accordingly. */ void mime_content(word_t *text); /** Decode the line in \a buff in-place according to the current * Content-Transfer-Encoding, but do not decode boundary lines. \return * the new line length */ uint mime_decode(word_t *buff); /** checks if \a boundary is a MIME boundary of an enclosing MIME * container, leave stack unchanged */ bool mime_is_boundary(word_t *boundary); /** \return current mime_type */ enum mimetype get_content_type(void); /** pop all elements from the MIME stack and reinitialize */ void mime_cleanup(void); /** To be removed. */ void mime_type2(word_t * text); #endif /* HAVE_MIME_H */ bogofilter-1.2.4/src/xstrlcat.c0000644000175000017500000000034312163572272014644 0ustar sezsez#include "config.h" #include "xstrlcat.h" #include "xmalloc.h" #include "system.h" size_t xstrlcat(char *d, const char *s, size_t l) { size_t w = strlcat(d, s, l); if (w >= l) xmem_toolong("xstrlcat"); return w; } bogofilter-1.2.4/src/rand_sleep.c0000644000175000017500000000075712163572304015121 0ustar sezsez#include "config.h" #include "system.h" #include "rand_sleep.h" #include void rand_sleep(double min, double max) { long delay; #ifdef HAVE_ARC4RANDOM delay = (int)(min + (max-min)*arc4random()/0xFFFFFFFFu); #else static bool need_init = true; if (need_init) { struct timeval timeval; need_init = false; gettimeofday(&timeval, NULL); srand48(timeval.tv_usec ^ timeval.tv_sec); } delay = (int)(min + ((max-min)*drand48())); #endif bf_sleep(delay); } bogofilter-1.2.4/src/xstrlcat.h0000644000175000017500000000016612163572272014654 0ustar sezsez#ifndef XSTRLCAT_H #define XSTRLCAT_H #include size_t xstrlcat(char *, const char *, size_t); #endif bogofilter-1.2.4/src/datastore.c0000644000175000017500000003030612163572304014764 0ustar sezsez/* $Id: datastore.c 6917 2010-07-05 15:59:15Z m-a $ */ /***************************************************************************** NAME: datastore.c -- contains database independent components of data storage. AUTHORS: Gyepi Sam 2002 - 2003 Matthias Andree 2003 David Relson 2003 ******************************************************************************/ #include "common.h" #include #include #include #include #include "datastore.h" #include "datastore_db.h" #include "datastore_db_private.h" #include "error.h" #include "maint.h" #include "rand_sleep.h" #include "swap.h" #include "word.h" #include "xmalloc.h" #define struct_init(s) memset(&s, 0, sizeof(s)) YYYYMMDD today; /* date as YYYYMMDD */ /* OO function list */ static dsm_t dsm_dummies = { /* public -- used in datastore.c */ NULL, /* dsm_begin */ NULL, /* dsm_abort */ NULL, /* dsm_commit */ /* private -- used in datastore_db_*.c */ NULL, /* dsm_env_init */ NULL, /* dsm_cleanup */ NULL, /* dsm_cleanup_lite */ NULL, /* dsm_get_env_dbe */ NULL, /* dsm_database_name */ NULL, /* dsm_recover_open */ NULL, /* dsm_auto_commit_flags*/ NULL, /* dsm_get_rmw_flag */ NULL, /* dsm_lock */ NULL, /* dsm_common_close */ NULL, /* dsm_sync */ NULL, /* dsm_log_flush */ NULL, /* dsm_pagesize */ NULL, /* dsm_checkpoint */ NULL, /* dsm_purgelogs */ NULL, /* dsm_recover */ NULL, /* dsm_remove */ NULL, /* dsm_verify */ NULL, /* dsm_list_logfiles */ NULL /* dsm_leafpages */ }; /* Function definitions */ static YYYYMMDD time_to_date(YYYYMMDD days) { time_t t = time(NULL) - days * 86400; struct tm *tm = localtime( &t ); YYYYMMDD date = ((((tm->tm_year + (YYYYMMDD)1900) * 100 + tm->tm_mon + 1) * 100) + tm->tm_mday); return date; } YYYYMMDD string_to_date(const char *s) { YYYYMMDD date = (YYYYMMDD) atol(s); if (date < 20020801 && date != 0) { date = time_to_date(date); } return date; } void set_date(YYYYMMDD date) { today = date; } void set_today(void) { today = time_to_date(0); } static void convert_external_to_internal(dsh_t *dsh, dbv_t *ex_data, dsv_t *in_data) { size_t i = 0; uint32_t *cv = ex_data->data; in_data->spamcount = !dsh->is_swapped ? cv[i++] : swap_32bit(cv[i++]); if (ex_data->leng <= i * sizeof(uint32_t)) in_data->goodcount = 0; else in_data->goodcount = !dsh->is_swapped ? cv[i++] : swap_32bit(cv[i++]); if (ex_data->leng <= i * sizeof(uint32_t)) in_data->date = 0; else in_data->date = !dsh->is_swapped ? cv[i] : swap_32bit(cv[i]); return; } static void convert_internal_to_external(dsh_t *dsh, dsv_t *in_data, dbv_t *ex_data) { size_t i = 0; uint32_t *cv = ex_data->data; /* Writing requires extra magic since the counts may need to be ** separated for output to different wordlists. */ cv[i++] = !dsh->is_swapped ? in_data->spamcount : swap_32bit(in_data->spamcount); cv[i++] = !dsh->is_swapped ? in_data->goodcount : swap_32bit(in_data->goodcount); if (timestamp_tokens && in_data->date != 0) cv[i++] = !dsh->is_swapped ? in_data->date : swap_32bit(in_data->date); ex_data->leng = i * sizeof(cv[0]); return; } dsh_t *dsh_init(void *dbh) /* database handle from db_open() */ { dsh_t *val = xmalloc(sizeof(*val)); val->dbh = dbh; val->is_swapped = db_is_swapped(dbh); return val; } void dsh_free(void *vhandle) { dsh_t *dsh = vhandle; xfree(dsh); return; } void *ds_open(void *dbe, bfpath *bfp, dbmode_t open_mode) { dsh_t *dsh; void *v; v = db_open(dbe, bfp, open_mode); /* FIXME */ if (!v) return NULL; dsh = dsh_init(v); if (db_created(v) && ! (open_mode & DS_LOAD)) { if (DST_OK != ds_txn_begin(dsh)) exit(EX_ERROR); ds_set_wordlist_version(dsh, NULL); /* enforce use of default value */ if (encoding == E_UNKNOWN) encoding = E_DEFAULT; ds_set_wordlist_encoding(dsh, (int) encoding); if (DST_OK != ds_txn_commit(dsh)) exit(EX_ERROR); } return dsh; } void ds_close(/*@only@*/ void *vhandle) { dsh_t *dsh = vhandle; db_close(dsh->dbh); xfree(dsh); } void ds_flush(void *vhandle) { dsh_t *dsh = vhandle; db_flush(dsh->dbh); } int ds_read(void *vhandle, const word_t *word, /*@out@*/ dsv_t *val) { int ret; dsh_t *dsh = vhandle; dbv_t ex_key; dbv_t ex_data; uint32_t cv[3]; struct_init(ex_key); struct_init(ex_data); ex_key.data = word->u.text; ex_key.leng = word->leng; memset(val, 0, sizeof(*val)); /* init ex_data inside loop since first db_get_value() ** call can change it and cause the second call to fail. */ ex_data.data = cv; ex_data.leng = sizeof(cv); ret = db_get_dbvalue(dsh->dbh, &ex_key, &ex_data); switch (ret) { case 0: convert_external_to_internal(dsh, &ex_data, val); if (DEBUG_DATABASE(3)) { fprintf(dbgout, "ds_read: [%.*s] -- %lu,%lu\n", CLAMP_INT_MAX(word->leng), (const char *)word->u.text, (unsigned long)val->spamcount, (unsigned long)val->goodcount); } return 0; case DS_NOTFOUND: if (DEBUG_DATABASE(3)) { fprintf(dbgout, "ds_read: [%.*s] not found\n", CLAMP_INT_MAX(word->leng), (char *) word->u.text); } return 1; case DS_ABORT_RETRY: if (DEBUG_DATABASE(1)) { print_error(__FILE__, __LINE__, "ds_read('%.*s') was aborted to recover from a deadlock.", CLAMP_INT_MAX(word->leng), (char *) word->u.text); } break; default: fprintf(dbgout, "ret=%d, DS_NOTFOUND=%d\n", ret, DS_NOTFOUND); print_error(__FILE__, __LINE__, "ds_read( '%.*s' ), err: %d, %s", CLAMP_INT_MAX(word->leng), (char *) word->u.text, ret, db_str_err(ret)); exit(EX_ERROR); } return ret; } int ds_write(void *vhandle, const word_t *word, dsv_t *val) { int ret = 0; dsh_t *dsh = vhandle; dbv_t ex_key; dbv_t ex_data; uint32_t cv[3]; struct_init(ex_key); struct_init(ex_data); ex_key.data = word->u.text; ex_key.leng = word->leng; ex_data.data = cv; ex_data.leng = sizeof(cv); if (timestamp_tokens && today != 0) val->date = today; convert_internal_to_external(dsh, val, &ex_data); ret = db_set_dbvalue(dsh->dbh, &ex_key, &ex_data); if (DEBUG_DATABASE(3)) { fprintf(dbgout, "ds_write: [%.*s] -- %lu,%lu,%lu\n", CLAMP_INT_MAX(word->leng), (const char *)word->u.text, (unsigned long)val->spamcount, (unsigned long)val->goodcount, (unsigned long)val->date); } return ret; /* 0 if ok */ } int ds_delete(void *vhandle, const word_t *word) { dsh_t *dsh = vhandle; int ret; dbv_t ex_key; struct_init(ex_key); ex_key.data = word->u.text; ex_key.leng = word->leng; ret = db_delete(dsh->dbh, &ex_key); return ret; /* 0 if ok */ } int ds_txn_begin(void *vhandle) { dsh_t *dsh = vhandle; if (dsm->dsm_begin == NULL) return 0; else return dsm->dsm_begin(dsh->dbh); } int ds_txn_abort(void *vhandle) { dsh_t *dsh = vhandle; if (dsm->dsm_abort == NULL) return 0; else return dsm->dsm_abort(dsh->dbh); } int ds_txn_commit(void *vhandle) { dsh_t *dsh = vhandle; if (dsm->dsm_commit == NULL) return 0; else return dsm->dsm_commit(dsh->dbh); } typedef struct { ds_foreach_t *hook; dsh_t *dsh; void *data; } ds_userdata_t; static ex_t ds_hook(dbv_t *ex_key, dbv_t *ex_data, void *userdata) { ex_t ret; word_t w_key; dsv_t in_data; ds_userdata_t *ds_data = userdata; dsh_t *dsh = ds_data->dsh; w_key.u.text = ex_key->data; w_key.leng = ex_key->leng; memset(&in_data, 0, sizeof(in_data)); convert_external_to_internal(dsh, ex_data, &in_data); ret = (*ds_data->hook)(&w_key, &in_data, ds_data->data); return ret; /* EX_OK if ok */ } ex_t ds_foreach(void *vhandle, ds_foreach_t *hook, void *userdata) { dsh_t *dsh = vhandle; ex_t ret; ds_userdata_t ds_data; ds_data.hook = hook; ds_data.dsh = dsh; ds_data.data = userdata; ret = db_foreach(dsh->dbh, ds_hook, &ds_data); return ret; } /* Wrapper for ds_foreach that opens and closes file */ ex_t ds_oper(void *env, bfpath *bfp, dbmode_t open_mode, ds_foreach_t *hook, void *userdata) { ex_t ret = EX_OK; void *dsh; dsh = ds_open(env, bfp, open_mode); if (dsh == NULL) { fprintf(stderr, "Can't open file '%s'\n", bfp->filepath); exit(EX_ERROR); } if (DST_OK == ds_txn_begin(dsh)) { if (ret == EX_OK) ret = ds_foreach(dsh, hook, userdata); if (ret != EX_OK) { ds_txn_abort(dsh); } else if (ds_txn_commit(dsh) != DST_OK) ret = EX_ERROR; } ds_close(dsh); return ret; } static word_t *msg_count_tok; static word_t *wordlist_version_tok; static word_t *wordlist_encoding_tok; void *ds_init(bfpath *bfp) { void *dbe; dbe = dbe_init(bfp); if (dsm == NULL) dsm = &dsm_dummies; if (msg_count_tok == NULL) { msg_count_tok = word_news(MSG_COUNT); } if (wordlist_version_tok == NULL) { wordlist_version_tok = word_news(WORDLIST_VERSION); } if (wordlist_encoding_tok == NULL) { wordlist_encoding_tok = word_news(WORDLIST_ENCODING); } return dbe; } /* Cleanup storage allocation */ void ds_cleanup(void *dbe) { if (dsm->dsm_cleanup != NULL) dsm->dsm_cleanup(dbe); xfree(msg_count_tok); xfree(wordlist_version_tok); msg_count_tok = NULL; wordlist_version_tok = NULL; } /* Get the number of messages associated with database. */ int ds_get_msgcounts(void *vhandle, dsv_t *val) { dsh_t *dsh = vhandle; return ds_read(dsh, msg_count_tok, val); } /* Set the number of messages associated with database. */ int ds_set_msgcounts(void *vhandle, dsv_t *val) { dsh_t *dsh = vhandle; val->date = today; return ds_write(dsh, msg_count_tok, val); } void *ds_get_dbenv(void *vhandle) { dsh_t *dsh = vhandle; return db_get_env(dsh->dbh); } /* Get the wordlist encoding associated with database. */ int ds_get_wordlist_encoding(void *vhandle, dsv_t *val) { dsh_t *dsh = vhandle; return ds_read(dsh, wordlist_encoding_tok, val); } /* Set the wordlist encoding associated with database. */ int ds_set_wordlist_encoding(void *vhandle, int enc) { dsh_t *dsh = vhandle; dsv_t val; val.count[0] = enc; val.count[1] = 0; val.date = today; return ds_write(dsh, wordlist_encoding_tok, &val); } /* Get the wordlist version associated with database. */ int ds_get_wordlist_version(void *vhandle, dsv_t *val) { dsh_t *dsh = vhandle; return ds_read(dsh, wordlist_version_tok, val); } /* Set the wordlist version associated with database. */ int ds_set_wordlist_version(void *vhandle, dsv_t *val) { dsh_t *dsh = vhandle; dsv_t tmp; if (val == NULL) { val = &tmp; val->count[0] = CURRENT_VERSION; val->count[1] = 0; } val->date = today; return ds_write(dsh, wordlist_version_tok, val); } const char *ds_version_str(void) { return db_version_str(); } ex_t ds_recover(bfpath *bfp, bool catastrophic) { if (dsm->dsm_recover == NULL) return EX_OK; else return dsm->dsm_recover(bfp, catastrophic, true); } ex_t ds_remove(bfpath *bfp) { if (dsm->dsm_remove == NULL) return EX_OK; else return dsm->dsm_remove(bfp); } ex_t ds_checkpoint(bfpath *bfp) { if (dsm->dsm_checkpoint == NULL) return EX_OK; else return dsm->dsm_checkpoint(bfp); } ex_t ds_purgelogs(bfpath *bfp) { if (dsm->dsm_purgelogs == NULL) return EX_OK; else return dsm->dsm_purgelogs(bfp); } ex_t ds_verify(bfpath *bfp) { if (dsm->dsm_verify == NULL) return EX_OK; else return dsm->dsm_verify(bfp); } u_int32_t ds_leafpages(bfpath *bfp) { if (dsm->dsm_leafpages == NULL) return 0; else return dsm->dsm_leafpages(bfp); } u_int32_t ds_pagesize(bfpath *bfp) { if (dsm->dsm_pagesize == NULL) return 0; else return dsm->dsm_pagesize(bfp); } ex_t ds_list_logfiles(bfpath *bfp, int argc, char **argv) { if (dsm->dsm_list_logfiles == NULL) return 0; else return dsm->dsm_list_logfiles(bfp, argc, argv); } bogofilter-1.2.4/src/sighandler.c0000644000175000017500000000247712163572304015126 0ustar sezsez/* $Id: sighandler.c 6712 2008-04-19 02:33:29Z relson $ */ /***************************************************************************** NAME: sighandler.c -- signal handler AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include "sighandler.h" #include "wordlists.h" /* Global Definitions */ sig_atomic_t fDie = false; /* Function Definitions */ static void mysignal(int sig, void (*hdl)(int)) { #ifdef SA_RESTART struct sigaction sa; memset( &sa, 0, sizeof(sa)); sa.sa_handler = hdl; sigemptyset(&sa.sa_mask); sa.sa_flags = SA_RESTART; if (sigaction(sig, &sa, NULL)) { fprintf(stderr, "Cannot set signal %d handler to %p: %s\n", sig, hdl, strerror(errno)); exit(EX_ERROR); } #endif } static void mysigdie(int sig) { (void) sig; /* suppress compiler warning */ if (!fDie) fDie = true; else exit(EX_ERROR); /* XXX FIXME: Need something that is async-signal-safe here! Note that _exit bypasses atexit, so we may see database corruption! */ } void signal_setup(void) { mysignal(SIGINT, mysigdie); /* 2 */ mysignal(SIGPIPE, SIG_IGN); /* 1 */ mysignal(SIGTERM, mysigdie); /* 15 */ } bogofilter-1.2.4/src/Makefile.am0000644000175000017500000002062412163572304014670 0ustar sezsez# vim:tw=0 # $Id: Makefile.am 6993 2013-06-28 21:54:23Z m-a $ SUBDIRS = . tests SYSCONFDIR = @sysconfdir@ PERL = @PERL@ if ENABLE_MEMDEBUG MEMDEBUG_SRC = memdebug.c memdebug.h endif noinst_LIBRARIES = libbogofilter.a if USE_GCC4 AM_CPPFLAGS = -iquote$(top_srcdir)/gnugetopt -iquote$(top_srcdir)/trio \ -I$(srcdir) @GSL_CFLAGS@ -I$(top_srcdir)/gsl/specfunc -I$(top_srcdir) else AM_CPPFLAGS = -I$(top_srcdir)/gnugetopt -I$(top_srcdir)/trio -I- -I. \ -I$(srcdir) @GSL_CFLAGS@ -I$(top_srcdir)/gsl/specfunc -I$(top_srcdir) endif AM_CFLAGS = -DBOGOFILTER if ENABLE_MEMDEBUG AM_CFLAGS += -DENABLE_MEMDEBUG endif BUILT_SOURCES= version.c directories.c # what to build bin_PROGRAMS = bogofilter bogoutil bogolexer bogotune bin_SCRIPTS = bogoupgrade dist_bin_SCRIPTS = bf_copy bf_compact bf_tar if ENABLE_STATIC bin_PROGRAMS += bogofilter_static bogoutil_static bogolexer_static bogotune_static endif check_PROGRAMS = debugtest configtest wordhash find_home.test \ fgetsl.test TESTS= LDADD = libbogofilter.a bogofilter_LDADD = $(LDADD) $(LIBDB) $(GSL_LIBS) bogoutil_LDADD = $(LDADD) $(LIBDB) configtest_LDADD = $(LDADD) $(LIBDB) if NEED_GSL libbf_gsl_a_CFLAGS=$(AM_CFLAGS) -DRENAMEFILES libbf_gsl_a_SOURCES= \ ../gsl/cdf/chisq.c ../gsl/cdf/gamma.c \ ../gsl/specfunc/gamma_inc.c ../gsl/err/error.c \ ../gsl/sys/infnan.c ../gsl/sys/fdiv.c \ ../gsl/specfunc/exp.c ../gsl/specfunc/trig.c \ ../gsl/specfunc/log.c ../gsl/specfunc/psi.c \ ../gsl/specfunc/zeta.c ../gsl/specfunc/elementary.c \ ../gsl/err/stream.c ../gsl/specfunc/expint.c \ ../gsl/specfunc/erfc.c ../gsl/sys/coerce.c \ ../gsl/sys/pow_int.c ../gsl/sys/minmax.c noinst_LIBRARIES += libbf_gsl.a libbf_gsl_a_CPPFLAGS= -I$(top_srcdir) BUILT_SOURCES += libbf_gsl.a endif EXTRA_PROGRAMS=panicenv panicenv_SOURCES=panicenv.c panicenv_LDADD=$(LIBDB) if NEEDTRIO noinst_LIBRARIES += libtrio.a libtrio_a_SOURCES= ../trio/triostr.c ../trio/trio.c ../trio/trionan.c \ ../trio/trio.h ../trio/triop.h ../trio/triodef.h \ ../trio/trionan.h ../trio/triostr.h check_PROGRAMS += regression TESTS+=./regression regression_SOURCES= ../trio/regression.c LDADD += libtrio.a endif if !DISABLE_UNICODE LDADD += @LIBICONV@ endif if ENABLE_UNICODE CHARSET_SOURCES = charset.c charset.h convert_unicode.c iconvert.h iconvert.c else if DISABLE_UNICODE CHARSET_SOURCES = charset.c charset.h convert_charset.c chUnicodeTo866.h else CHARSET_SOURCES = charset.c charset.h \ convert_charset.c convert_charset.h chUnicodeTo866.h \ convert_unicode.c convert_unicode.h iconvert.c iconvert.h endif endif # what to build that from version_sources= \ common.h system.h bftypes.h \ globals.h globals.c \ base64.h base64.c \ bf_exit.c \ bogoconfig.h bogoconfig.c \ bogomain.h bogomain.c \ bogoreader.h bogoreader.c \ bool.h bool.c \ bsdqueue.h \ buff.h buff.c \ $(CHARSET_SOURCES) \ collect.h collect.c \ configfile.h configfile.c \ datastore.h datastore.c \ datastore_dbcommon.h datastore_db_private.h \ db_lock.h db_lock.c \ debug.h debug.c \ error.h error.c \ fgetsl.h fgetsl.c \ find_home.h find_home.c find_home_user.c find_home_tildeexpand.c \ format.h format.c \ lexer.h lexer.c lexer_v3.l \ listsort.h listsort.c \ longoptions.h \ maint.h maint.c \ memstr.h memstr.c \ mime.h mime.c \ msgcounts.h msgcounts.c \ mxcat.h mxcat.c \ passthrough.h passthrough.c \ paths.h paths.c \ prob.h prob.c \ qp.h qp.c \ rand_sleep.h rand_sleep.c \ register.h register.c \ robx.h robx.c \ rstats.h rstats.c \ score.h score.c \ sighandler.h sighandler.c \ swap.h swap_32bit.c system.c \ textblock.h textblock.c \ token.h token.c \ transaction.h transaction.c \ uudecode.h uudecode.c \ word.h word.c \ wordhash.h wordhash.c wordlists.h wordlists.c \ wordlists_base.h wordlists_base.c \ xmalloc.h xcalloc.c xmalloc.c xmem_error.c xrealloc.c \ xmemrchr.h xmemrchr.c \ xstrdup.h xstrdup.c \ xstrlcat.h xstrlcat.c \ xstrlcpy.h xstrlcpy.c \ $(MEMDEBUG_SRC) \ xatox.h xatof.c xatoi.c \ getopt_long_chk.c \ datastore_db.h libbogofilter_a_SOURCES = \ version.c \ $(version_sources) nodist_libbogofilter_a_SOURCES = \ directories.c \ unicode_runtime_selection unicode_enabled unicode_disabled if NEED_GETOPT noinst_LIBRARIES += libgnugetopt.a LDADD += libgnugetopt.a libgnugetopt_a_SOURCES = ../gnugetopt/getopt1.c ../gnugetopt/getopt.c endif # this must be last so any library we may have added has access to the # AC_REPLACE objects, for instance, trio may need strtoul: LDADD += @LIBOBJS@ if ENABLE_QDBM_DATASTORE datastore_SOURCE = datastore_qdbm.c datastore_qdbm_cmpkey.c \ datastore_txn_dummies.c datastore_opthelp_dummies.c \ datastore_dummies.c bin_PROGRAMS += bogoQDBMupgrade bogoQDBMupgrade_SOURCES = bogoQDBMupgrade.c datastore_qdbm_cmpkey.c bogoQDBMupgrade_LDADD = $(LDADD) $(LIBDB) else if ENABLE_SQLITE_DATASTORE datastore_SOURCE = datastore_sqlite.c datastore_opthelp_dummies.c \ datastore_dummies.c else if ENABLE_TOKYOCABINET_DATASTORE datastore_SOURCE = datastore_tc.c \ datastore_opthelp_dummies.c \ datastore_dummies.c else if ENABLE_TRANSACTIONS datastore_SOURCE = datastore_db.c datastore_db_trans.c else if DISABLE_TRANSACTIONS datastore_SOURCE = datastore_db.c datastore_db_trad.c \ datastore_opthelp_dummies.c else datastore_SOURCE = datastore_db.c datastore_db_trad.c datastore_db_trans.c endif endif endif endif endif datastore_OBJECT = $(datastore_SOURCE:.c=.o) libbogofilter_a_SOURCES += $(datastore_SOURCE) EXTRA_libbogofilter_a_SOURCES = datastore_db.c datastore_db_trad.c \ datastore_db_trans.c \ datastore_opthelp_dummies.c \ datastore_txn_dummies.c \ datastore_qdbm.h datastore_qdbm.c \ datastore_sqlite.c \ charset.h convert_charset.h convert_unicode.h \ charset.c \ convert_charset.c chUnicodeTo866.h \ convert_unicode.c iconvert.c iconvert.h CLEANFILES=version.c directories.c bogoupgrade bogofilter_SOURCES = bogofilter.c bogofilter.h main.c \ common.h bogofilter_static_SOURCES = $(bogofilter_SOURCES) bogofilter_static_LDFLAGS = $(STATICLDFLAGS) bogofilter_static_LDADD = $(LDADD) $(STATIC_DB) $(GSL_LIBS) bogolexer_static_SOURCES = bogolexer.c bogolexer_static_LDFLAGS = $(STATICLDFLAGS) bogoutil_SOURCES = bogoutil.c bogohist.c bogohist.h bogoutil_static_SOURCES = bogoutil.c bogohist.c bogohist.h bogoutil_static_LDFLAGS = $(STATICLDFLAGS) bogoutil_static_LDADD = $(LDADD) $(STATIC_DB) bogotune_SOURCES = bogotune.c bogotune.h \ tunelist.c tunelist.h \ common.h bogotune_LDADD = $(LDADD) $(LIBDB) $(GSL_LIBS) bogotune_static_SOURCES = bogotune.c bogotune.h \ tunelist.c tunelist.h \ common.h bogotune_static_LDFLAGS = $(STATICLDFLAGS) bogotune_static_LDADD= $(LDADD) $(STATIC_DB) $(GSL_LIBS) debugtest_SOURCES = debug.main.c wordhash_SOURCES = wordhash.main.c find_home_test_SOURCES = find_home.test.c fgetsl_test_SOURCES = fgetsl.c fgetsl_test_CFLAGS= -DMAIN # what to distribute EXTRA_DIST = bogoupgrade.in \ version.sh \ strlcat.3 strlcpy.3 \ patch.lexer.254.txt patch.lexer.253x.txt # version.c: version.sh ../configure.ac Makefile.am \ $(version_sources) \ $(bogofilter_SOURCES) \ $(bogolexer_SOURCES) \ $(bogoutil_SOURCES) \ $(bogotune_SOURCES) $(SHELL) $(srcdir)/version.sh $(top_srcdir) >"$@.new" && mv -f "$@.new" "$@" \ || { rm -f "$@" ; false ; } # directories.c: ../config.status rm -f $@ echo "const char *const system_config_file = \"$(SYSCONFDIR)/bogofilter.cf\";" >"$@" \ || { rm -f "$@" ; false ; } # $(datastore_OBJECT): Makefile $(datastore_SOURCE) # bogoupgrade: bogoupgrade.in Makefile rm -f $@ sed 's}[@]PERL@}$(PERL)}' <$(srcdir)/bogoupgrade.in >$@ || rm -f $@ chmod +x bogoupgrade #splint - weak splint.check: $(version_sources) $(bogofilter_SOURCES) $(bogolexer_SOURCES) $(bogoutil_SOURCES) $(bogotune_SOURCES) splint -I. -f $(srcdir)/.lclintrc -weak `for i in \ $(version_sources) \ $(bogofilter_SOURCES) \ $(bogolexer_SOURCES) \ $(bogoutil_SOURCES) \ $(bogotune_SOURCES) ; do echo $(srcdir)/$$i ; done | sort -u | egrep -v "(lexer_v3.l|db_handle_props.h)"` > splint.tmp || : grep ^F splint.tmp wc -l splint.tmp lexer_v3.c: $(srcdir)/lexer_v3.l $(srcdir)/Makefile.in $(LEX) $(srcdir)/lexer_v3.l (echo '/* Include config.h early to avoid _FILE_OFFSET_BITS redefinition on Solaris */'; echo '#include "config.h"' ; sed '/^#/ s|lex.yy\.c|$@|; s/\(accepting rule at line\) %d/\\1 %ld/' lex.yy.c) >$@ if PATCH_FLEX_254 patch $@ < $(srcdir)/patch.lexer.254.txt endif if PATCH_FLEX_253X patch $@ < $(srcdir)/patch.lexer.253x.txt endif rm -f lex.yy.c bogofilter-1.2.4/src/lexer_v3.l0000644000175000017500000003263612163572304014546 0ustar sezsez/* $Id: lexer_v3.l 6988 2013-01-20 14:02:48Z m-a $ */ %{ /* * NAME * lexer_v3.l -- bogofilter's lexical analyzer for message headers * * 01/01/2003 - split out of lexer.l * */ /* * Our lexical analysis is different from Paul Graham's rules: * * We throw away headers that are readily identifiable as dates. * We throw away all digit strings that don't look like IP address parts. * We thow away lines beginning with id -- mailer UDs. * * These are optimizations to keep the token lists from bloating. * The big win is recognizing machine-generated unique IDs that * we'll never see again and shouldn't * * We don't treat dot between two alphanumerics as a separator, * because we want to keep domain names and IP addresses together as * recognizable units. * * Having done the above, there isn't much need to recognize URLs. * If a URL is a spam indicator, very likely any other URL from the * same site is as well, so the hostname part should be an adequate * statistical trigger. * * LEXED_TOKENS, which are found in "msg-count" files need a special pattern * because they can be: * 1 - normal bogofilter tokens * 2 - url:xxx and subj: tokens * 3 - mime boundaries */ /* 12 May 2003 * Added Paul Graham's latest ideas on parsing. * (From http://www.paulgraham.com/better.html) * * 1. Case is preserved. * * 2. Exclamation points are constituent characters. * * 3. Periods and commas are constituents if they occur between two * digits. This lets me get ip addresses and prices intact. * * 4. A price range like $20-25 yields two tokens, $20 and $25. * * 5. Tokens that occur within the To, From, Subject, and Return-Path * lines, or within urls, get marked accordingly. * For example. "foo" in the Subject line becomes "subj:foo". */ /* DR 08/29/2003: ** ** With flex-2.5.31 and '%option never-interactive noreject', file ** msg.dr.0118.base64 (in tests/bogofilter/inputs/split.d) parses ** incorrectly because line 24 isn't base64 decoded. */ #define YY_NO_INPUT #include "common.h" #include #include #include "buff.h" #include "charset.h" #include "lexer.h" #include "mime.h" /* for mime_*() */ #include "msgcounts.h" #include "textblock.h" #include "token.h" #include "xmalloc.h" #define YY_DECL token_t yylex(void) YY_DECL; /* declare function */ #define YY_INPUT(buf,result,max_size) result = yyinput((byte *)buf, result, max_size) #define YY_EXIT_FAILURE EX_ERROR #undef stderr #define stderr dbgout /* for debug & -D options */ static int lineno; #define FLEX_VER(MAJ, MIN, SUB) ( MAJ * 1000 + MIN * 100 + SUB) #ifndef YY_FLEX_SUBMINOR_VERSION #define FLEX_VERSION_BF FLEX_VER(YY_FLEX_MAJOR_VERSION, YY_FLEX_MINOR_VERSION, 0) #else #define FLEX_VERSION_BF FLEX_VER(YY_FLEX_MAJOR_VERSION, YY_FLEX_MINOR_VERSION, YY_FLEX_SUBMINOR_VERSION) #endif #if FLEX_VERSION_BF != 2531 int yylineno; #endif /* Function Prototypes/Forward Declarations */ static word_t *yy_text(void); static void html_char(void); static void html_reorder(void); static void url_char(void); static void skip_to(char chr); static void yy_unput(const byte *txt, uint len); char yy_get_state(void); void yy_set_state_initial(void); static void header(void); /* Function Definitions */ static word_t *yy_text(void) { static word_t yyt; yyt.u.text = (byte *)yytext; yyt.leng = yyleng; return &yyt; } %} %option warn %option nodebug debug %option align caseless 8bit /*********************************************************************** WARNING: The scanner must be interactive so as not to look ahead past \n = EOH and other header/body delimiters, else it will fail when MIME decoding, because part of the body has already been read ahead. ***********************************************************************/ %option interactive always-interactive %option noreject noyywrap UINT8 ([01]?[0-9]?[0-9]|2([0-4][0-9]|5[0-5])) IPADDR {UINT8}\.{UINT8}\.{UINT8}\.{UINT8} BCHARSNOSPC [[:alnum:]()+_,-./:=?#\'] BCHARS [[:alnum:]()+_,-./:=?#\' ] MIME_BOUNDARY {BCHARS}*{BCHARSNOSPC} ID ? CHARSET [[:alnum:]-]+ VERPID [[:alnum:]#-]+[[:digit:]]+[[:alnum:]#-]+ MTYPE [[:blank:]]*[[:alnum:]/-]* NUM [[:digit:]]+ NUM_NUM \ {NUM}\ {NUM} MSG_COUNT ^\".MSG_COUNT\" FRONT_CHAR [^[:blank:][:cntrl:][:digit:][:punct:]] MID_CHAR [^[:blank:][:cntrl:]:$*<>;=()&%#@+|/\\{}^\"?,\[\]] BOGOLEX_CHAR [^[:blank:][:cntrl:] <>;=()&%#@+|/\\{}^\"?,\[\]] BACK_CHAR [^[:blank:][:cntrl:]:$*<>;=()&%#@+|/\\{}^\"?,\[\]._~\'\`\-] TOKEN {FRONT_CHAR}({MID_CHAR}*{BACK_CHAR})? /* RFC2047.2 encoded-word = "=?" charset "?" encoding "?" encoded-text "?=" charset = token ; see section 3 encoding = token ; see section 4 token = 1* especials = "(" / ")" / "<" / ">" / "@" / "," / ";" / ":" / " <"> / "/" / "[" / "]" / "?" / "." / "=" encoded-text = 1* ; (but see "Use of encoded-words in message ; headers", section 5) */ /* 09/01/03 Using "[^?]" in the pattern and validating the charset in 'C' reduces executable size by approx 290k. new: ENCODED_WORD =\?{CHARSET}\?[bq]\?[^?]*\?= old: ENCODED_WORD =\?{CHARSET}\?(b\?{BASE64}\|q\?{QP})\?= BASE64 [0-9a-zA-Z/+=]+ QP [!->@-~]+ */ WHITESPACE [[:blank:]\n] NOTWHITESPACE [^[:blank:]\n] HTML_ENCODING "&#"x?[[:xdigit:]]+";" URL_ENCODING "%"[[:xdigit:]][[:xdigit:]] ENCODED_WORD =\?{CHARSET}\?[bq]\?[^?\n]*\?= ENCODED_TOKEN ({FRONT_CHAR}{MID_CHAR}*)?({ENCODED_WORD}{WHITESPACE}+)*{ENCODED_WORD} /* HTML_WI_COMMENTS "<"[^>]*">" HTML_WO_COMMENTS "<"[^!][^>]*">"\|"<>" */ HTMLTOKEN "<"[^>]*">" /* * Generally, there are some html tags that cause an "eyebreak" and some * that do not. For example, the "P" tag or the "BR" tag cause a break, * and can be interpreted in place, while, the B (bold) tag does not. * No close tags seem to cause a break. * Comments do not. This is an attempt to make an exhaustive list of * tags that cause an "eyebreak". When the exit tag also causes a break, * we include the /?. I believe this to be a complete list of tags that * can cause a formatting break. */ HBREAK p|br|li|h[1-6]|hr|title|table|center|dd|dt|iframe|img|input|select|td|textarea|th|\/?(div|blockquote|pre|dir|dl|fieldset|legend|form|menu|ol|ul) BREAKHTML "<"({HBREAK}({WHITESPACE}[^>]*|""))">" VERP {TOKEN}-{VERPID}-{TOKEN}={TOKEN}@{TOKEN} %s TEXT HTML BOGO_LEX %s HTOKEN HDISCARD SCOMMENT LCOMMENT %s PGP_HEAD PGP_BODY %% {MSG_COUNT}{NUM_NUM} { if (lineno == 0) { BEGIN BOGO_LEX; set_msg_counts_from_str(strchr(yytext, ' ') + 1); } return MSG_COUNT_LINE; } ^\"{BOGOLEX_CHAR}+\"{NUM_NUM}$ { return BOGO_LEX_LINE; } \n { lineno += 1; } {ENCODED_TOKEN} { word_t *raw = yy_text(); word_t *txt = text_decode(raw); yy_unput(txt->u.text, txt->leng); } ^(To|CC|From|Return-Path|Subject|Received): { set_tag(yytext); } ^Content-(Transfer-Encoding|Type|Disposition):{MTYPE} { mime_content(yy_text()); skip_to(':'); header(); return TOKEN; } ^Message-ID:.* { /* save token for logging */ unsigned long off = 11; while(isspace((unsigned char)yytext[off]) && off < yyleng) off++; set_msg_id((unsigned char *)(yytext+off), yyleng-off); header(); return HEADKEY; } ^(Delivery-)?Date:.* | ^Resent-Message-ID:.* | ^(In-Reply-To|References):.* { header(); return HEADKEY; } boundary=[ ]*\"?{MIME_BOUNDARY}\"? { mime_boundary_set(yy_text()); } charset=\"?{CHARSET}\"? { got_charset(yytext); skip_to('='); header(); return TOKEN; } (file)?name=\"? /* ignore */ [[:blank:]]id{WHITESPACE}+{ID} { return QUEUE_ID; } /********************************************************************** WARNING: Do NOT add header () rules that require characters beyond a LF character (\n) - doing so will make the parser read ahead parts of the body in the wrong MIME decoding mode and goof up seriously. **********************************************************************/ ^\n { enum mimetype type = get_content_type(); have_body = true; msg_header = false; clr_tag(); switch (type) { case MIME_TEXT_HTML: BEGIN HTML; break; case MIME_MESSAGE: yy_set_state_initial(); break; default: BEGIN TEXT; } if (DEBUG_LEXER(1)) fprintf(dbgout, "*** end of header\n"); return EOH; } ^{TOKEN} { header(); return TOKEN; } \n { lineno += 1; } {VERP} { skip_to('='); return VERP; } ^-----BEGIN\ PGP\ SIGNATURE-----$ { BEGIN PGP_HEAD; yy_unput((byte *)yytext, yyleng); } ^\n { BEGIN PGP_BODY; } {TOKEN} { /* ignore */ } ^-----END\ PGP\ SIGNATURE-----$ { BEGIN TEXT; yy_unput((byte *)yytext, yyleng); } ^--{MIME_BOUNDARY}(--)?$ { if (got_mime_boundary(yy_text())) { yy_set_state_initial(); return BOUNDARY; } else { yyless(2); } } /* This has to match just as much or more than the below rules, so as to be the controlling rule. */ {TOKEN}({HTMLTOKEN}*{BREAKHTML}+{HTMLTOKEN}*.?|{HTMLTOKEN}+{WHITESPACE}) { char *chr = memchr(yytext, '<', yyleng); /* find start of html tag */ size_t len = chr - yytext; yyless(len); return TOKEN; } {TOKEN}{HTMLTOKEN}+/{NOTWHITESPACE} { html_reorder(); } "" { BEGIN HTML; } /* end of strict comment; return to normal html processing */ "<"\!DOCTYPE\ HTML\ PUBLIC\ .*">" { BEGIN HTML; } {IPADDR} { return IPADDR;} "\["({IPADDR})"\]" { return MESSAGE_ADDR;} {TOKEN} { return TOKEN;} {TOKEN}?{HTML_ENCODING} { html_char(); } /* process escaped chars, eg 'e' is 'a' */ "/"[^/[:blank:]\n%]*{URL_ENCODING}+ { url_char(); } /* process escaped chars, eg '%61' is 'a' */ \${NUM}(\.{NUM})? { return MONEY;} /* Dollars and cents */ . /* ignore character */ \n { lineno += 1; clr_tag(); } <> { return NONE; } %% static void header(void) { set_tag("Header"); } void lexer_v3_init(FILE *fp) { lineno = 0; have_body = false; yy_set_state_initial(); yyrestart(fp); } static void skip_to(char chr) { size_t len = strchr(yytext, chr) - yytext; yyless(len); } static void html_reorder(void) { char *chr = memchr(yytext, '<', yyleng); /* find start of html tag */ size_t len = chr - yytext; char *yycopy = xmalloc(yyleng + 1); /* +1 for NUL byte below */ memcpy(yycopy, yytext+len, yyleng-len); /* copy tag to start of buffer */ memcpy(yycopy+yyleng-len, yytext, len); /* copy leading text to end of buffer */ yycopy[yyleng] = '\0'; /* for debugging */ yy_unput((byte *)yycopy, yyleng); xfree(yycopy); } static int xtoi(char *in, size_t len) { int val = 0; while (isxdigit((byte) *in) && (len-- > 0)) { char c = *in++; val <<= 4; val += isdigit((byte)c) ? (c - '0') : (tolower((byte)c) - 'a' + 10); } return val; } static void html_char(void) { char *txt = strstr(yytext, "&#"); /* find decodable char */ size_t len = txt - yytext; int val; char *yycopy = NULL; if (len != 0) { yycopy = xmalloc(yyleng + 1); /* +1 for NUL byte below */ memcpy(yycopy, yytext, yyleng); /* copy tag to start of buffer */ yycopy[yyleng] = '\0'; /* for debugging */ } txt += 2; val = isdigit((byte) *txt) ? atoi(txt) : xtoi(txt+1, 4); /* xtoi() limits conversion to 4 characters */ /* atoi() limits value to 0x7fffffff, i.e. 2147483647 */ /* no problem on linux */ if ((val > 0) && (val < 256) && isprint(val)) { /* use it if printable */ yyunput(val, yytext); yyleng = len; /* adjust len to pre-char count */ } else { if (yycopy) yycopy[yyleng-1] = ' '; /* prevents parsing loop */ } if (yycopy != NULL) { yy_unput((byte *)yycopy, yyleng); xfree(yycopy); } } static void url_char(void) { char *src, *dst; src = dst = yytext; while (src < yytext + yyleng) { char c = *src++; if (c == '%') { c = xtoi(src, 2); src += 2; } *dst++ = c; } while (dst > yytext) { yyunput(*--dst, yytext); } } static void yy_unput(const byte *txt, uint len) { while (len-- > 0) yyunput(txt[len], yytext); } char yy_get_state() { switch (YYSTATE) { case INITIAL: return 'i'; case TEXT: return 't'; case HTML: case HTOKEN: return 'h'; case SCOMMENT: return 's'; case LCOMMENT: return 'l'; default: return 'o'; } } void yy_set_state_initial(void) { BEGIN INITIAL; msg_header = true; header(); if (DEBUG_LEXER(1)) fprintf(dbgout, "BEGIN INITIAL\n"); #ifdef FLEX_DEBUG yy_flex_debug = BOGOTEST('L'); #endif } long lexer_v3_get_token(byte **output) { *output = (byte *)yytext; return yyleng; } /* * The following sets edit modes for GNU EMACS * Local Variables: * mode:c * indent-tabs-mode:t * End: */ bogofilter-1.2.4/src/panicenv.c0000644000175000017500000000221612163572304014600 0ustar sezsez/** \file panicenv.c - Set Berkeley DB environment's PANIC state * \author Matthias Andree * \date 2005 * * GNU General Public License v2 */ #include #include #include #include __attribute__((noreturn)) static void barf(const char *tag, const int e) { fprintf(stderr, "%s: %s\n", tag, db_strerror(e)); exit(EXIT_FAILURE); } __attribute__((noreturn)) static void usage(int code) { fprintf(stderr, "Usage: panicenv \n"); exit(code); } int main(int argc, char **argv) { DB_ENV *env; int e; if (argc != 2) usage(EXIT_FAILURE); e = db_env_create(&env, 0); if (e) barf("db_env_create", e); e = env->set_flags(env, DB_NOPANIC, 1); if (e) barf("DB_ENV->set_flags/DB_NOPANIC", e); e = env->set_flags(env, DB_NOMMAP, 1); if (e) barf("DB_ENV->set_flags/DB_NOMMAP", e); e = env->open(env, argv[1], DB_JOINENV, 0); if (e) barf("DB_ENV->open", e); e = env->set_flags(env, DB_PANIC_ENVIRONMENT, 1); if (e) barf("DB_ENV->set_flags/DB_PANIC_ENVIRONMENT", e); e = env->close(env, 0); if (e) barf("DB_ENV->close", e); return EXIT_SUCCESS; } bogofilter-1.2.4/src/debug.c0000644000175000017500000000212712163572272014070 0ustar sezsez/* $Id: debug.c 6876 2010-02-15 19:16:16Z m-a $ */ /***************************************************************************** NAME: debug.c - shared debug functions AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include "debug.h" FILE *dbgout; u_int32_t debug_mask = DEBUG_NONE; void set_debug_mask(const char *mask) { char ch; const char *maskbits = BIT_NAMES; for (ch = tolower((unsigned char)*mask); ch != '\0'; ch = *++mask) { /*@-shiftnegative@*/ if (strchr(maskbits, ch) != NULL) debug_mask |= (1 << (ch - 'a')); /*@=shiftnegative@*/ else { (void)fprintf(stderr, "set_debug_mask: unknown mask specification '%c'\n", ch); exit(EX_ERROR); } } } /* 'L' - enable lexer_v3 debug output */ void set_bogotest(const char *mask) { char ch; while ((ch = *mask++) != '\0' && isalpha((int)(unsigned char)ch)) { ch = toupper((unsigned char)ch); bogotest |= MASK_BIT(ch); } } bogofilter-1.2.4/src/swap.h0000644000175000017500000000013512163572304013752 0ustar sezsez#ifndef SWAP_H #define SWAP_H #include "system.h" uint32_t swap_32bit(uint32_t x); #endif bogofilter-1.2.4/src/format.h0000644000175000017500000000215012163572304014267 0ustar sezsez/* $Id: format.h 6789 2009-02-12 01:12:53Z relson $ */ #ifndef FORMAT_H #define FORMAT_H #include "configfile.h" typedef const char *FIELD; /* Global variables */ extern const char *spam_header_name; extern const char *spam_subject_tag; extern const char *unsure_subject_tag; #if 0 extern const char *spam_header_place; #endif /* needed by bogoconfig.c */ extern const char *header_format; extern const char *terse_format; extern const char *log_update_format; extern const char *log_header_format; extern FIELD *spamicity_tags; extern FIELD *spamicity_formats; extern void set_terse_mode_format(int mode); extern bool set_spamicity_tags(const char *val); extern bool set_spamicity_formats(const char *val); extern bool set_spamicity_fields(FIELD *strings, const char *val); /* Function Prototypes */ extern char *format_header(char *buff, size_t size); extern char *format_terse(char *buff, size_t size); extern char *format_log_header(char *buff, size_t size); extern void format_set_counts(uint _wrd, uint _msg); extern char *format_log_update(char *buff, size_t size, const char *reg, const char *unreg); #endif bogofilter-1.2.4/src/token.h0000644000175000017500000000156612163572304014131 0ustar sezsez/* $Id: token.h 6493 2006-06-20 22:22:00Z relson $ */ /***************************************************************************** NAME: token.h -- prototypes and definitions for token.c ******************************************************************************/ #ifndef HAVE_TOKEN_H #define HAVE_TOKEN_H #include "lexer.h" extern word_t *msg_addr; /* First IP Address in Received: statement */ extern word_t *msg_id; /* Message ID */ extern word_t *queue_id; /* Message's first Queue ID */ extern token_t get_token(word_t *token); extern void got_from(void); extern void clr_tag(void); extern void set_tag(const char *text); extern void set_msg_id(byte *text, uint leng); extern void token_init(void); extern void token_cleanup(void); /* used by lexer_text_html.l */ extern void html_tag(int level); extern void html_comment(int level); #endif /* HAVE_TOKEN_H */ bogofilter-1.2.4/src/wordhash.c0000644000175000017500000002705612163572304014625 0ustar sezsez/* $Id: wordhash.c 6890 2010-03-17 23:52:48Z m-a $ */ /* NAME: wordhash.c -- Implements a hash data structure. AUTHOR: Gyepi Sam THEORY: See 'Programming Pearls' by Jon Bentley for a good treatment of word hashing. The algorithm, magic number selections, and hash function are based on his implementation. This module has been tuned to perform fast inserts and searches, using the following techniques: 1. Insert operation allocates and returns a pointer to a memory buffer, in which the caller can store associated data, eliminating the need for further retrieval or storage operations. 2. Maintains a linked list of hash nodes in insert order for fast traversal of hash table. */ #include "common.h" #include #include #include /* for offsetof */ #include "listsort.h" #include "wordhash.h" #include "xmalloc.h" #define NHASH 29989 #define MULT 31 /* Note: every wordhash includes three large chunks of memory: 20k - S_CHUNK -- 32k - N_CHUNK * sizeof (hashnode_t) 120k - NHASH * sizeof (hashnode_t **) */ #define N_CHUNK 2000 #define S_CHUNK 20000 #define WH_INIT 64 #define WH_INCR 64 #ifndef offsetof #define offsetof(type, member) ((size_t) &((type*)0)->member ) #endif /* global variables */ /* for bogotune */ static wordhash_t *memory_db; /* function prototypes */ static void wh_trap(void) {} /* function definitions */ /* 06/14/03 ** profiling shows wordhash_new() is significant portion ** of time spent processing msg-count files: ** ** % cumulative self self total ** time seconds seconds calls ms/call ms/call name ** 30.84 0.70 0.70 2535 0.28 0.28 wordhash_new ** ** wordhash_new() made faster by using xcalloc() to provide ** initialized storage. */ wordhash_t * wordhash_init (wh_t type, uint count) { wordhash_t *wh = xcalloc (1, sizeof (wordhash_t)); wh->type = type; wh->count = 0; wh->size = (type == WH_NORMAL) ? 0 : ((count == 0) ? WH_INIT : count); switch (type) { case WH_NORMAL: wh->bin = xcalloc (NHASH, sizeof (hashnode_t **)); break; case WH_CNTS: /* used for bogotune with msg_count files */ wh->cnts = (wordcnts_t *) xcalloc(wh->size, sizeof(wordcnts_t)); break; case WH_PROPS: wh->freeable = true; wh->props = (hashnode_t *) xcalloc(wh->size, sizeof(hashnode_t)); break; } return wh; } wordhash_t * wordhash_new (void) { wh_t type = (!fBogotune || !msg_count_file) ? WH_NORMAL : WH_CNTS; wordhash_t *wh = wordhash_init(type, 0); return wh; } static void wordhash_free_alloc_nodes (wordhash_t *wh) { wh_alloc_node *node, *next; /* iteration pointers are inside buf, ** so freeing buf requires clearing them. */ wh->iter_head = wh->iter_tail = NULL; for (node = wh->nodes; node; node = next) { next = node->next; xfree (node->buf); xfree (node); } wh->nodes = NULL; } static void wordhash_free_hash_nodes (wordhash_t *wh) { hashnode_t *item, *next; for (item = wh->iter_head; item != NULL ; item = next) { next = item->iter_next; word_free( item->key ); item->key = NULL; } wh->iter_head = NULL; } static void wordhash_free_strings (wordhash_t *wh) { wh_alloc_str *sp, *sq; for (sp = wh->strings; sp; sp = sq) { sq = sp->next; xfree (sp->buf); xfree (sp); } wh->strings = NULL; } void wordhash_free (wordhash_t *wh) { if (wh == NULL) return; wordhash_free_hash_nodes(wh); wordhash_free_alloc_nodes(wh); wordhash_free_strings(wh); switch (wh->type) { case WH_NORMAL: break; case WH_CNTS: xfree (wh->cnts); break; case WH_PROPS: if (wh->freeable) { uint i; for (i=0; isize; i++) xfree(wh->props[i].data); } xfree (wh->props); break; } xfree (wh->bin); xfree (wh); } static hashnode_t * nmalloc (wordhash_t *wh) /*@modifies wh->nodes@*/ { /*@dependent@*/ wh_alloc_node *wn = wh->nodes; hashnode_t *hn; if (wn == NULL || wn->avail == 0) { wn = xmalloc (sizeof (wh_alloc_node)); wn->next = wh->nodes; wh->nodes = wn; wn->buf = xmalloc (N_CHUNK * sizeof (hashnode_t)); wn->avail = N_CHUNK; wn->used = 0; } wn->avail--; hn = (wn->buf) + wn->used; wn->used ++; return (hn); } /* determine architecture's alignment boundary */ struct dummy { char *c; double d; }; #define ALIGNMENT offsetof(struct dummy, d) static char * smalloc (wordhash_t *wh, size_t n) /*@modifies wh->strings@*/ { wh_alloc_str *s = wh->strings; /*@dependent@*/ char *t; /* Force alignment on architecture's natural boundary.*/ if ((n % ALIGNMENT) != 0) n += ALIGNMENT - ( n % ALIGNMENT); if (s == NULL || s->avail < n) { s = xmalloc (sizeof (wh_alloc_str)); s->next = wh->strings; wh->strings = s; s->buf = xmalloc (S_CHUNK + n); s->avail = S_CHUNK + n; s->used = 0; } s->avail -= n; t = s->buf + s->used; s->used += n; return (t); } static unsigned int hash (const word_t *t) { unsigned int h = 0; size_t l; for (l=0; lleng; l++) h = MULT * h + t->u.text[l]; return h % NHASH; } static void display_node(hashnode_t *n, const char *str) { wordprop_t *p = (wordprop_t *)n->data; if (verbose > 2) printf( "%20.20s %5u %5u%s", n->key->u.text, p->cnts.bad, p->cnts.good, str); } /* this function accumulates the word frequencies from the src hash to * those of the dest hash */ void wordhash_add(wordhash_t *dest, wordhash_t *src, void (*initializer)(void *)) { hashnode_t *s; uint count = dest->count + src->count; /* use dest count as total */ dest->count += src->count; if (verbose > 20) { printf( "%5lu ", (unsigned long)dest->count); display_node(src->iter_head, " "); } for (s = wordhash_first(src); s != NULL; s = wordhash_next(src)) { wordprop_t *p = (wordprop_t *)s->data; word_t *key = s->key; wordprop_t *d; if (key == NULL) continue; d = wordhash_insert(dest, key, sizeof(wordprop_t), initializer); d->freq += p->freq; d->cnts.good += p->cnts.good; d->cnts.bad += p->cnts.bad; } if (verbose > 200) display_node(dest->iter_head, "\n"); dest->size = count; } void wordhash_foreach (wordhash_t *wh, wh_foreach_t *hook, void *userdata) { hashnode_t *hn; for (hn = wordhash_first(wh); hn != NULL; hn = wordhash_next(wh)) { (*hook)(hn->key, hn->data, userdata); } return; } void * wordhash_search_memory (const word_t *t) { void *ans = NULL; if (memory_db) ans = wordhash_search(memory_db, t, 0); return ans; } void * wordhash_search (const wordhash_t *wh, const word_t *t, unsigned int idx) { hashnode_t *hn; if (idx == 0) idx = hash (t); for (hn = wh->bin[idx]; hn != NULL; hn = hn->next) { word_t *key = hn->key; if (key->leng == t->leng && memcmp (t->u.text, key->u.text, t->leng) == 0) { wordprop_t *p = (wordprop_t *)hn->data; return p; } } return NULL; } static void * wordhash_standard_insert (wordhash_t *wh, word_t *t, size_t n, void (*initializer)(void *)) { hashnode_t *hn; unsigned int idx = hash (t); void *buf = wordhash_search(wh, t, idx); if (buf != NULL) return buf; hn = nmalloc (wh); hn->data = smalloc (wh, n); if (initializer) initializer(hn->data); else memset(hn->data, '\0', n); hn->key = word_dup(t); hn->next = wh->bin[idx]; wh->bin[idx] = hn; if (wh->iter_head == NULL){ wh->iter_head = hn; } else { wh->iter_tail->iter_next = hn; } hn->iter_next = NULL; wh->iter_tail = hn; wh->count += 1; wh->size += 1; return hn->data; } static void * wordhash_counts_insert (wordhash_t *wh) { if (wh->count == wh->size) { wh->size += WH_INCR; wh->cnts = (wordcnts_t *) xrealloc(wh->cnts, wh->size * sizeof(wordcnts_t)); } wh->index = wh->count; wh->count += 1; return & wh->cnts[wh->index]; } void * wordhash_insert (wordhash_t *wh, word_t *t, size_t n, void (*initializer)(void *)) { void *v; if (wh->type == WH_CNTS) v = wordhash_counts_insert (wh); else v = wordhash_standard_insert (wh, t, n, initializer); return v; } size_t wordhash_count (wordhash_t *wh) { return wh->size; } void * wordhash_first (wordhash_t *wh) { void *val = NULL; switch (wh->type) { case WH_NORMAL: val = wh->iter_ptr = wh->iter_head; break; case WH_CNTS: wh->index = 0; val = &wh->cnts[wh->index]; break; case WH_PROPS: wh->index = 0; val = &wh->props[wh->index]; break; } return val; } void * wordhash_next (wordhash_t *wh) { void *val = NULL; switch (wh->type) { case WH_NORMAL: if (wh->iter_ptr != NULL) val = wh->iter_ptr = wh->iter_ptr->iter_next; break; case WH_CNTS: if (++wh->index < wh->count) val = &wh->cnts[wh->index]; break; case WH_PROPS: if (++wh->index < wh->count) val = &wh->props[wh->index]; break; } return val; } /* compare_hashnode_t - sort by ascending token text */ static int compare_hashnode_t(const void *const pv1, const void *const pv2) { const hashnode_t *hn1 = (const hashnode_t *)pv1; const hashnode_t *hn2 = (const hashnode_t *)pv2; return word_cmp(hn1->key, hn2->key); } static wordcnts_t *wordhash_get_counts(wordhash_t *wh, hashnode_t *n) { if (wh->cnts == NULL) { wordprop_t *p = (wordprop_t *)n->data; wordcnts_t *c = &p->cnts; return c; } else { wordcnts_t *c = (wordcnts_t *) n; return c; } } void wordhash_set_counts(wordhash_t *wh, int good, int bad) { hashnode_t *hn; for (hn = wordhash_first(wh); hn != NULL; hn = wordhash_next(wh)) { wordcnts_t *c = wordhash_get_counts(wh, hn); c->good += good; c->bad += bad; } } /* wordhash_sort - sort by ascending token text */ void wordhash_sort (wordhash_t *wh) { wh->iter_head = (hashnode_t *)listsort((element *)wh->iter_head, (fcn_compare *)&compare_hashnode_t); return; } /* ** convert_propslist_to_countlist() allocates a new wordhash_t struct ** to improve program locality and lessen need for swapping when ** processing lots of messages. */ wordhash_t * convert_propslist_to_countlist(wordhash_t *whi) { hashnode_t *node; wordhash_t *who = NULL; if (whi->type == WH_CNTS) return whi; if (whi->type != WH_NORMAL && whi->type != WH_PROPS) { fprintf(stderr, "convert_propslist_to_countlist() called with invalid input.\n"); exit(EX_ERROR); } who = wordhash_init(WH_CNTS, whi->size); for (node = wordhash_first(whi); node != NULL; node = wordhash_next(whi)) { wordcnts_t *ci = wordhash_get_counts(whi, node); wordcnts_t *co = &who->cnts[who->count++]; co->good = ci->good; co->bad = ci->bad ; co->msgs_good = msgs_good; co->msgs_bad = msgs_bad ; } return who; } wordhash_t * convert_wordhash_to_propslist(wordhash_t *whi, wordhash_t *db) { if (whi->type == WH_CNTS) { if (whi->index == whi->size && whi->count > whi->size) { whi->size = whi->count; whi->cnts = (wordcnts_t *) xrealloc(whi->cnts, whi->size * sizeof(wordcnts_t)); } return whi; } else { wordhash_t *who = wordhash_init(WH_PROPS, whi->size); hashnode_t *node; who->count = 0; for (node = wordhash_first(whi); node != NULL; node = wordhash_next(whi)) { wordprop_t *wp; if (!msg_count_file && node->key != NULL) { who->freeable = false; wp = wordhash_insert(db, node->key, sizeof(wordprop_t), NULL); } else { wp = xcalloc(1, sizeof(wordprop_t)); memcpy(wp, node->data, sizeof(wordprop_t)); if (!who->freeable) wh_trap(); } who->props[who->count].data = wp; xfree(node->key); node->key = NULL; who->count += 1; } return who; } } bogofilter-1.2.4/src/bogomain.c0000644000175000017500000000424712163572304014576 0ustar sezsez/* $Id: bogomain.c 6486 2006-05-29 14:38:29Z relson $ */ /***************************************************************************** NAME: bogomain.c -- detect spam and bogons presented on standard input. AUTHOR: Eric S. Raymond David Relson Matthias Andree CONTRIBUTORS: Integrate patch by Zeph Hull and Clint Adams to present spamicity in X-Spam-Status header in -p (passthrough) mode. ******************************************************************************/ #include "common.h" #include #ifdef HAVE_SYSLOG_H #include #endif #include "getopt.h" #include "bogoconfig.h" #include "bogomain.h" #include "bogofilter.h" #include "datastore.h" #include "mime.h" #include "passthrough.h" #include "paths.h" #include "token.h" #include "wordlists.h" #include "xmalloc.h" /* Function Definitions */ ex_t bogomain(int argc, char **argv) /*@globals errno,stderr,stdout@*/ { rc_t status; ex_t exitcode = EX_OK; fBogofilter = true; dbgout = stderr; progtype = build_progtype(progname, DB_TYPE); process_parameters(argc, argv, true); output_setup(); #ifdef HAVE_SYSLOG_H if (logflag) openlog("bogofilter", LOG_PID, LOG_MAIL); #endif /* open all wordlists */ open_wordlists((run_type == RUN_NORMAL) ? DS_READ : DS_WRITE); if (encoding == E_UNKNOWN) encoding = E_DEFAULT; status = bogofilter(argc - optind, argv + optind); switch (status) { case RC_SPAM: exitcode = EX_SPAM; break; case RC_HAM: exitcode = EX_HAM; break; case RC_UNSURE: exitcode = EX_UNSURE; break; case RC_OK: exitcode = EX_OK; break; default: fprintf(dbgout, "Unexpected status code - %d\n", (int)status); return (EX_ERROR); } if (nonspam_exits_zero && exitcode != EX_ERROR) exitcode = EX_OK; close_wordlists(true); if (DEBUG_MEMORY(1)) MEMDISPLAY; /* cleanup storage */ token_cleanup(); mime_cleanup(); output_cleanup(); free_wordlists(); #ifdef HAVE_SYSLOG_H if (logflag) closelog(); #endif xfree(progtype); if (DEBUG_MEMORY(0)) MEMDISPLAY; return (exitcode); } /* End */ bogofilter-1.2.4/src/msgcounts.h0000644000175000017500000000147512163572272015036 0ustar sezsez/* $Id: msgcounts.h 6988 2013-01-20 14:02:48Z m-a $ */ /***************************************************************************** NAME: msgcounts.h -- routines for setting & computing .MSG_COUNT values AUTHOR: David Relson ******************************************************************************/ #ifndef MSGCOUNTS_H #define MSGCOUNTS_H #include "lexer.h" /* Globals */ #define MSG_COUNT_MAX_LEN 100 extern yylex_t read_msg_count_line; extern bool msgcount_more(void); extern char *msg_count_text; extern int msg_count_leng; /* DO NOT MAKE THIS SIZE_T */ /* Function prototypes */ void init_msg_counts(void); void set_msg_counts(u_int32_t good, u_int32_t spam); void set_msg_counts_from_str(char *str); long msg_count_get_token(byte **output); #endif /* MSGCOUNTS_H */ bogofilter-1.2.4/src/datastore_sqlite.c0000644000175000017500000004305212163572304016347 0ustar sezsez/** * \file datastore_sqlite.c SQLite 3 database driver back-end * \author Matthias Andree * \date 2004, 2005 * * This file handles a static table named "bogofilter" in a SQLite3 * database. The table has two "BLOB"-typed columns, key and value. * * GNU GENERAL PUBLIC LICENSE v2 */ #include "common.h" #include #include #include "datastore_db.h" #include "error.h" #include "rand_sleep.h" #include "xmalloc.h" #include "xstrdup.h" /** Structure to hold database handle and associated data. */ struct dbhsqlite_t { char *path; /**< directory to hold database */ char *name; /**< database file name */ sqlite3 *db; /**< pointer to SQLite3 handle */ sqlite3_stmt *select; /**< prepared SELECT statement for DB retrieval */ sqlite3_stmt *insert; /**< prepared INSERT OR REPLACE for DB update */ sqlite3_stmt *delete; /**< prepared DELETE statement */ bool created; /**< gets set by db_open if it created the database new */ bool swapped; /**< if endian swapped on disk vs. current host */ }; /** Convenience shortcut to avoid typing "struct dbh_t" */ typedef struct dbhsqlite_t dbh_t; static const char *ENDIAN32 = ".ENDIAN32"; void db_flush(void *unused) { (void)unused; } static int sql_txn_begin(void *vhandle); static int sql_txn_abort(void *vhandle); static int sql_txn_commit(void *vhandle); static u_int32_t sql_pagesize(bfpath *bfp); static ex_t sql_verify(bfpath *bfp); /** The layout of the bogofilter table, formatted as SQL statement. * * The additional index, although making writes a bit slower, speeds up * queries noticably as it improves locality of referenced data and * reduces complexity of the retrieval of the value column. */ #define LAYOUT \ "CREATE TABLE bogofilter (" \ " key BLOB PRIMARY KEY," \ " value BLOB);" \ "CREATE INDEX bfidx ON bogofilter(key,value);" /* * another experimental layout is as follows, * but does not appear to make a lot of difference * performance-wise (evaluation in other environments * is required though): * #define LAYOUT \ "CREATE TABLE bogofilter (key BLOB, value BLOB); " \ "CREATE INDEX bfidx ON bogofilter(key,value);" \ "CREATE TRIGGER bfuniquekey BEFORE INSERT ON bogofilter " \ " FOR EACH ROW WHEN EXISTS(SELECT key FROM bogofilter WHERE (key=NEW.key) LIMIT 1) " \ " BEGIN UPDATE bogofilter SET value=NEW.value WHERE (key=NEW.key); SELECT RAISE(IGNORE); END;" #endif */ dsm_t dsm_sqlite = { /* public -- used in datastore.c */ &sql_txn_begin, &sql_txn_abort, &sql_txn_commit, /* private -- used in datastore_db_*.c */ NULL, /* dsm_env_init */ NULL, /* dsm_cleanup */ NULL, /* dsm_cleanup_lite */ NULL, /* dsm_get_env_dbe */ NULL, /* dsm_database_name */ NULL, /* dsm_recover_open */ NULL, /* dsm_auto_commit_flags*/ NULL, /* dsm_get_rmw_flag */ NULL, /* dsm_lock */ NULL, /* dsm_common_close */ NULL, /* dsm_sync */ NULL, /* dsm_log_flush */ &sql_pagesize,/* dsm_pagesize */ NULL, /* dsm_purgelogs */ NULL, /* dsm_checkpoint */ NULL, /* dsm_recover */ NULL, /* dsm_remove */ &sql_verify,/* dsm_verify */ NULL, /* dsm_list_logfiles */ NULL /* dsm_leafpages */ }; dsm_t *dsm = &dsm_sqlite; /** The command to begin a regular transaction. */ #define BEGIN \ "BEGIN TRANSACTION;" /* real functions */ /** Initialize database handle and return it. * \returns non-NULL, as it exits with EX_ERROR in case of trouble. */ static dbh_t *dbh_init(bfpath *bfp) { dbh_t *handle; dsm = &dsm_sqlite; handle = xmalloc(sizeof(dbh_t)); memset(handle, 0, sizeof(dbh_t)); handle->name = xstrdup(bfp->filepath); return handle; } /** Free internal database handle \a dbh. */ static void free_dbh(dbh_t *dbh) { if (!dbh) return; xfree(dbh->name); xfree(dbh->path); xfree(dbh); } /** Executes the SQL statement \a cmd on the database \a db and returns * the sqlite3_exec return code. If the return code is nonzero, this * routine will have printed an error message. */ static int sqlexec(sqlite3 *db, const char *cmd) { char *e = NULL; int rc; rc = sqlite3_exec(db, cmd, NULL, NULL, &e); if (rc) { print_error(__FILE__, __LINE__, "Error executing \"%s\": %s (#%d)\n", cmd, e ? e : "NULL", rc); if (e) sqlite3_free(e); } return rc; } /** Compile SQL statement \a cmd for database handle \a dbh, exiting on * failure if \a bailout is true. */ static sqlite3_stmt *sqlprep(dbh_t *dbh /** data base handle */, const char *cmd /** sqlite command to compile */, bool bailout /** exit on error? */) { const char *tail; /* dummy */ sqlite3_stmt *ptr; if (sqlite3_prepare_v2(dbh->db, cmd, strlen(cmd), &ptr, &tail) != SQLITE_OK) { print_error(__FILE__, __LINE__, "cannot compile %s: %s\n", cmd, sqlite3_errmsg(dbh->db)); if (bailout) exit(EX_ERROR); return NULL; } return ptr; } /** Short trace handler function, passed to SQLite if debugging is * enabled. */ static void db_trace(void *userdata /** unused */, const char *log /** log message */) { (void)userdata; fprintf(dbgout, "SQLite[%ld]: %s\n", (long)getpid(), log); } /** Foreach function, we call \a hook for * each (key, value) tuple in the database. */ static int db_loop(sqlite3 *db, /**< SQLite3 database handle */ const char *cmd, /**< SQL command to obtain data */ db_foreach_t hook, /**< if non-NULL, called for each value */ void *userdata /** this is passed to the \a hook */ ) { const char *tail; sqlite3_stmt *stmt; int rc; bool loop, found = false; dbv_t key, val; /* sqlite3_exec doesn't allow us to retrieve BLOBs */ rc = sqlite3_prepare_v2(db, cmd, strlen(cmd), &stmt, &tail); if (rc) { print_error(__FILE__, __LINE__, "Error preparing \"%s\": %s (#%d)\n", cmd, sqlite3_errmsg(db), rc); sqlite3_finalize(stmt); return rc; } loop = true; while (loop) { rc = sqlite3_step(stmt); switch (rc) { case SQLITE_ROW: found = true; if (hook != NULL) { key.leng = sqlite3_column_bytes(stmt, /* column */ 0); key.data = xmalloc(key.leng); memcpy(key.data, sqlite3_column_blob(stmt, 0), key.leng); val.leng = sqlite3_column_bytes(stmt, /* column */ 1); val.data = xmalloc(val.leng); memcpy(val.data, sqlite3_column_blob(stmt, 1), val.leng); /* skip ENDIAN32 token */ if (key.leng != strlen(ENDIAN32) || memcmp(key.data, ENDIAN32, key.leng) != 0) rc = hook(&key, &val, userdata); else rc = 0; xfree(val.data); xfree(key.data); if (rc) { sqlite3_finalize(stmt); return rc; } } break; case SQLITE_DONE: loop = false; break; default: print_error(__FILE__, __LINE__, "Error executing \"%s\": %s (#%d)\n", cmd, sqlite3_errmsg(db), rc); sqlite3_finalize(stmt); return rc; } } /* free resources */ sqlite3_finalize(stmt); return found ? 0 : DS_NOTFOUND; } /** This busy handler just sleeps a while and retries */ static int busyhandler(void *dummy, int count) { (void)dummy; (void)count; rand_sleep(1000, 1000000); return 1; } static void check_sqlite_version(void) { const unsigned int wmaj = 3, wmin = 6, wpl = 12; /* desired version of sqlite3 library */ unsigned int vmaj, vmin, vpl; /* actual version of sqlite3 library */ static int complained; const char *v; if (complained) return; complained = 1; v = sqlite3_libversion(); sscanf(v, "%u.%u.%u", &vmaj, &vmin, &vpl); if (vmaj > wmaj) return; if (vmaj == wmaj && vmin > wmin) return; if (vmaj == wmaj && vmin == wmin && vpl >= wpl) return; if (!getenv("BF_USE_OLD_SQLITE")) fprintf(stderr, "\n" "WARNING: please update sqlite to %d.%d.%d or newer.\n" "\n", wmaj, wmin, wpl); } void *db_open(void *dummyenv, bfpath *bfp, dbmode_t mode) { int rc; dbh_t *dbh; dbv_t k, v; (void)dummyenv; check_sqlite_version(); dbh = dbh_init(bfp); /* open database file */ if (DEBUG_DATABASE(1) || getenv("BF_DEBUG_DB")) { fprintf(dbgout, "SQLite: db_open(%s)\n", dbh->name); fflush(dbgout); } rc = sqlite3_open(dbh->name, &dbh->db); if (rc) { print_error(__FILE__, __LINE__, "Can't open database %s: %s\n", dbh->name, sqlite3_errmsg(dbh->db)); goto barf; } /* request extended result codes for improved error reporting */ (void)sqlite3_extended_result_codes(dbh->db, true); /* set trace mode */ if (DEBUG_DATABASE(1) || getenv("BF_DEBUG_DB")) sqlite3_trace(dbh->db, db_trace, NULL); /* set busy handler */ if (sqlite3_busy_handler(dbh->db, busyhandler, NULL)) { print_error(__FILE__, __LINE__, "Can't set busy handler: %s\n", sqlite3_errmsg(dbh->db)); goto barf; } /* check/set endianness marker and create table if needed */ if (mode != DS_READ) { /* using IMMEDIATE or DEFERRED here locks up in t.lock3 * or t.bulkmode * using EXCLUSIVE locks up in t.lock3 on MAC OSX */ if (sqlexec(dbh->db, BEGIN)) goto barf; /* * trick: the sqlite_master table (see SQLite FAQ) is read-only * and lists all tables, indexes etc. so we use it to check if * the bogofilter table is already there, the error codes are * too vague either way, for "no such table" and "table already * exists" we always get SQLITE_ERROR, which we'll also get for * syntax errors, such as "EXCLUSIVE" not supported on older * versions :-( */ rc = db_loop(dbh->db, "SELECT name FROM sqlite_master " "WHERE type='table' AND name='bogofilter';", NULL, NULL); switch (rc) { case 0: if (sqlexec(dbh->db, "COMMIT;")) goto barf; break; case DS_NOTFOUND: { u_int32_t p[2] = { 0x01020304, 0x01020304 }; if (sqlexec(dbh->db, LAYOUT)) goto barf; /* set endianness marker */ k.data = xstrdup(ENDIAN32); k.leng = strlen(k.data); v.data = p; v.leng = sizeof(p); rc = db_set_dbvalue(dbh, &k, &v); xfree(k.data); if (rc) goto barf; if (sqlexec(dbh->db, "COMMIT;")) goto barf; dbh->created = true; } break; default: goto barf; } } /* * initialize common statements * dbh->insert is not here as it's needed earlier, * so it sets itself up lazily */ dbh->select = sqlprep(dbh, "SELECT value FROM bogofilter WHERE key=? LIMIT 1;", false); if (dbh->select == NULL) { fprintf(stderr, "\nRemember to register some spam and ham messages before you\n" "use bogofilter to evaluate mail for its probable spam status!\n\n"); exit(EX_ERROR); } dbh->delete = sqlprep(dbh, "DELETE FROM bogofilter WHERE(key = ?);", true); /* check if byteswapped */ { u_int32_t t, b[2]; int ee; k.data = xstrdup(ENDIAN32); k.leng = strlen(k.data); v.data = b; v.leng = sizeof(b); ee = db_get_dbvalue(dbh, &k, &v); xfree(k.data); switch (ee) { case 0: /* found endian marker token, read it */ if (v.leng < 4) goto barf; t = ((u_int32_t *)v.data)[0]; switch (t) { case 0x01020304: /* same endian, "UNIX" */ dbh->swapped = false; break; case 0x04030201: /* swapped, "XINU" */ dbh->swapped = true; break; default: /* NUXI or IXUN or crap */ print_error(__FILE__, __LINE__, "Unknown endianness on %s: %08x.\n", dbh->name, ((u_int32_t *)v.data)[0]); goto barf2; } break; case DS_NOTFOUND: /* no marker token, assume not swapped */ dbh->swapped = false; break; default: goto barf; } } return dbh; barf: print_error(__FILE__, __LINE__, "Error on database %s: %s\n", dbh->name, sqlite3_errmsg(dbh->db)); barf2: db_close(dbh); return NULL; } void db_close(void *handle) { int rc; dbh_t *dbh = handle; if (dbh->delete) sqlite3_finalize(dbh->delete); if (dbh->insert) sqlite3_finalize(dbh->insert); if (dbh->select) sqlite3_finalize(dbh->select); rc = sqlite3_close(dbh->db); if (rc) { print_error(__FILE__, __LINE__, "Can't close database %s: %d", dbh->name, rc); exit(EX_ERROR); } free_dbh(dbh); } const char *db_version_str(void) { static char buf[80]; if (!buf[0]) snprintf(buf, sizeof(buf), "SQLite %s", sqlite3_libversion()); return buf; } static int sql_txn_begin(void *vhandle) { dbh_t *dbh = vhandle; return sqlexec(dbh->db, BEGIN ); } static int sql_txn_abort(void *vhandle) { dbh_t *dbh = vhandle; return sqlexec(dbh->db, "ROLLBACK;"); } static int sql_txn_commit(void *vhandle) { dbh_t *dbh = vhandle; return sqlexec(dbh->db, "COMMIT;"); } /** common code for db_delete, db_(get|set)_dbvalue. * This works by setting variables in precompiled statements (see PREP, * sqlite3_prepare, sqlite3_bind_*, sqlite3_reset) and avoids encoding * binary data into SQL's hex representation as well as compiling the * same SQL statement over and over again. */ static int sql_fastpath( dbh_t *dbh, /**< database handle */ const char *func, /**< function name to report in errors */ sqlite3_stmt *stmt, /**< SQLite3 statement to execute/reset */ dbv_t *val, /**< OUT value from first row, NULL ok */ int retnotfound /** return value if no rows found */ ) { int rc; bool found = false; while (1) { rc = sqlite3_step(stmt); switch (rc) { case SQLITE_ROW: /* this is the only branch that loops */ if (val) { int len = min(INT_MAX, val->leng); val->leng = min(len, sqlite3_column_bytes(stmt, 0)); memcpy(val->data, sqlite3_column_blob(stmt, 0), val->leng); } found = 1; break; /* all other branches below return control to the caller */ case SQLITE_BUSY: sqlite3_reset(stmt); sql_txn_abort(dbh); return DS_ABORT_RETRY; case SQLITE_DONE: sqlite3_reset(stmt); return found ? 0 : retnotfound; default: print_error(__FILE__, __LINE__, "%s: error executing statement on %s: %s (%d)\n", func, dbh->name, sqlite3_errmsg(dbh->db), rc); sqlite3_reset(stmt); return rc; } } } int db_delete(void *vhandle, const dbv_t *key) { dbh_t *dbh = vhandle; sqlite3_bind_blob(dbh->delete, 1, key->data, key->leng, SQLITE_STATIC); return sql_fastpath(dbh, "db_delete", dbh->delete, NULL, 0); } int db_set_dbvalue(void *vhandle, const dbv_t *key, const dbv_t *val) { dbh_t *dbh = vhandle; if (!dbh->insert) dbh->insert = sqlprep(dbh, "INSERT OR REPLACE INTO bogofilter VALUES(?,?);", true); sqlite3_bind_blob(dbh->insert, 1, key->data, key->leng, SQLITE_STATIC); sqlite3_bind_blob(dbh->insert, 2, val->data, val->leng, SQLITE_STATIC); return sql_fastpath(dbh, "db_set_dbvalue", dbh->insert, NULL, 0); } int db_get_dbvalue(void *vhandle, const dbv_t* token, /*@out@*/ dbv_t *val) { dbh_t *dbh = vhandle; sqlite3_bind_blob(dbh->select, 1, token->data, token->leng, SQLITE_STATIC); return sql_fastpath(dbh, "db_get_dbvalue", dbh->select, val, DS_NOTFOUND); } ex_t db_foreach(void *vhandle, db_foreach_t hook, void *userdata) { dbh_t *dbh = vhandle; const char *cmd = "SELECT key, value FROM bogofilter;"; return db_loop(dbh->db, cmd, hook, userdata); } const char *db_str_err(int e) { return e == 0 ? "no error" : "unknown condition (not yet implemented)"; } bool db_created(void *vhandle) { dbh_t *dbh = vhandle; return dbh->created; } bool db_is_swapped(void *vhandle) { dbh_t *dbh = vhandle; return dbh->swapped; } static int pagesize_cb(void *ptr, int argc, char **argv, char **dummy) { u_int32_t *uptr = ptr; (void)dummy; if (argc != 1) return -1; errno = 0; *uptr = strtoul(argv[0], NULL, 0); return errno; } static u_int32_t sql_pagesize(bfpath *bfp) { dbh_t *dbh; int rc; u_int32_t size; dbh = db_open(NULL, bfp, DS_READ); if (!dbh) return 0xffffffff; rc = sqlite3_exec(dbh->db, "PRAGMA page_size;", pagesize_cb, &size, NULL); if (rc != SQLITE_OK) { return 0xffffffff; } db_close(dbh); return size; } static int cb_first; /** callback function for sql_verify, * \returns 0 to exhaust the full list of error messages. */ static int cb_verify(void *errflag, int columns, char * * values, char * * names) { int *e = errflag; if (columns != 1) { fprintf(stderr, "Strange: got row with more or less than one column.\n" "Aborting verification.\n"); return 1; } if (cb_first != 1 || 0 != strcmp(values[0], "ok")) { *e = 1; /* If we get any output other than a single row with the "ok" text, there's something wrong with the database -> set error flag and print the error. */ fprintf(stderr, "%s\n", values[0]); } (void)names; cb_first = 0; return 0; } /** Run database verification PRAGMA. Prints all error messages * and returns EX_OK if none were delivered by sqlite3 or EX_ERROR in * case of trouble. */ static ex_t sql_verify(bfpath *bfp) { dbh_t *dbh; int rc; int faulty = 0; char *errmsg = NULL; const char stmt[] = "PRAGMA integrity_check;"; if (DEBUG_DATABASE(1) || getenv("BF_DEBUG_DB")) { fprintf(dbgout, "SQLite: sql_verify(%s)\n", bfp->filename); fflush(dbgout); } dbh = db_open(NULL, bfp, DS_READ); if (!dbh) return EX_ERROR; cb_first = 1; rc = sqlite3_exec(dbh->db, stmt, cb_verify, &faulty, &errmsg); if (rc != SQLITE_OK) { print_error(__FILE__, __LINE__, "Error while evaluating \"%s\": %s", stmt, errmsg ? errmsg : "(unknown)"); if (errmsg) sqlite3_free(errmsg); return EX_ERROR; } db_close(dbh); if (faulty == 0) { /* success */ if (verbose) printf("%s: OK\n", bfp->filename); } else { /* database faulty */ fprintf(stderr, "%s: Database integrity check failed.\n", bfp->filename); } return faulty ? EX_ERROR : EX_OK; } bogofilter-1.2.4/src/datastore_opthelp_dummies.c0000644000175000017500000000133512163572272020246 0ustar sezsez#include "common.h" #include "datastore_db.h" /* help messages and option processing */ const char **dsm_help_bogofilter(void) { static const char *help_text[] = { NULL }; return &help_text[0]; } const char **dsm_help_bogoutil(void) { static const char *help_text[] = { NULL }; return &help_text[0]; } bool dsm_options_bogofilter(int option, const char *name, const char *val) { (void) option; (void) name; (void) val; return false; } bool dsm_options_bogoutil(int option, cmd_t *flag, int *count, const char **ds_file, const char *name, const char *val) { (void) option; (void) flag; (void) count; (void) ds_file; (void) name; (void) val; return false; } bogofilter-1.2.4/src/version.c0000644000175000017500000000007312163573322014462 0ustar sezsez#include "globals.h" const char * const version = "1.2.4"; bogofilter-1.2.4/src/buff.h0000644000175000017500000000374712163572304013736 0ustar sezsez/* $Id: buff.h 6894 2010-03-23 17:32:46Z m-a $ */ /** \file buff.h * declarations and type definitions for buff.c * * \author David Relson */ #ifndef BUFF_H #define BUFF_H #include "word.h" /** Type to store an arbitrary string with actual length, * maximum capacity and a pointer to the last byte read. */ typedef struct { word_t t; /**< the string contained here */ uint read; /**< start of last read */ uint size; /**< capacity */ } buff_t; /** allocate a new buff_t and initialize it from \a buff, \a used * and set the capacity to \a size, without allocating memory for the * actual string */ extern buff_t *buff_new(byte *buff, uint used, uint size); /** initialize an existing buff_t from \a buff, \a used * and set the capacity to \a size, without allocating memory for the * actual string */ extern buff_t *buff_init(buff_t *self, byte *buff, uint used, uint size); /** free the buff_t \a self, without freeing the string */ extern void buff_free(buff_t *self); /** append word \a in to the existing buffer \a self, reallocating more * room if necessary */ extern int buff_add(buff_t *self, word_t *in); /** read up to a line feed or exhaustion of the buffer capacity, * whichever comes first, from the stdio stream \a in into the buff_t \a * self. */ #define buff_fgetsl(self, in) buff_fgetsln(self, in, UINT_MAX) /** read up to \a maxlen characters, a line feed or exhaustion of the * buffer capacity, whichever comes first, from the stdio stream \a in * into the buff_t \a self. */ extern int buff_fgetsln(buff_t *self, FILE *in, uint maxlen); /** print the unread part of the buff_t \a self to the stdio stream fp * by means of word_puts(), which see for meaning of \a width. */ extern void buff_puts(const buff_t *self, /**< buff struct to print */ uint width, /**< passed verbatim to word_puts() */ FILE *fp /**< stdio.h stream to print to */); extern void buff_shift(buff_t *self, uint start, uint length); #endif /* BUFF_H */ bogofilter-1.2.4/src/fgetsl.h0000644000175000017500000000274412163572304014274 0ustar sezsez/** * \file fgetsl.h Header file for NUL-proof fgets() replacement. * \author Matthias Andree * \date 2002 - 2003 */ #ifndef FGETSL_H #define FGETSL_H #include /** This function reads up to \a siz-1 characters from the stdio stream \a in into \a buf * and adds a terminating NUL character. When the buffer cannot hold at * least one character of payload, the program is aborted. * \return * - negative: EOF or error condition (check ferror(3)) * - zero or positive: number of characters read (not counting the * trailing NUL) */ extern int fgetsl(/*@out@*/ char *buf /** output buffer */, int siz /** capacity of buffer */, FILE *in /** input stream */); /** This function reads up to \p max_size or \p max_size-1 (depending on \p * no_nul_terminate) characters from stdio stream \p in into \p buf and * optionally adds a terminating NUL character. When the buffer * cannot hold at least one character of payload, the program is * aborted. * \return * - negative: EOF or error condition (check ferror(3)) * - zero or positive: number of characters read (not counting the * trailing NUL) */ extern int xfgetsl(/*@out@*/ char *buf /** output buffer */, int max_size /** capacity of buffer */, /*@null@*/ FILE *in /** input stream */, bool no_nul_terminate /** \li if false, the maximum amount of bytes read is size-1 and the buffer is NUL terminated. \li if true, the maximum amount of bytes read is size and the buffer WILL NOT BE NUL terminated. */); #endif bogofilter-1.2.4/src/swap_32bit.c0000644000175000017500000000034312163572272014755 0ustar sezsez#include "swap.h" /* stolen from glibc's byteswap.c */ uint32_t swap_32bit(uint32_t x){ return ((((x) & 0xff000000) >> 24) | (((x) & 0x00ff0000) >> 8) | (((x) & 0x0000ff00) << 8) | (((x) & 0x000000ff) << 24)); } bogofilter-1.2.4/src/bogofilter.c0000644000175000017500000000771012163572304015135 0ustar sezsez/* $Id: bogofilter.c 6789 2009-02-12 01:12:53Z relson $ */ /***************************************************************************** NAME: bogofilter.c -- detect spam and bogons presented on standard input. AUTHORS: Eric S. Raymond David Relson Matthias Andree Greg Louis THEORY: Originally implemented as Paul Graham's variant of Bayes filtering, as described in "A Plan For Spam", http://www.paulgraham.com/spam.html Updated in accordance with Gary Robinson's proposed modifications, as described at http://radio.weblogs.com/0101454/stories/2002/09/16/spamDetection.html ******************************************************************************/ #include "common.h" #include #include #include "bogofilter.h" #include "bogoconfig.h" #include "bogoreader.h" #include "collect.h" #include "format.h" #include "passthrough.h" #include "register.h" #include "rstats.h" #include "score.h" /* ** case B_NORMAL: ** case B_STDIN: * '-b' - streaming (stdin) mode * ** case B_CMDLINE: * '-B' - command line mode * ** **loop: ** read & parse a message ** if -p, save textblocks ** register if -snSN && -pe ** classify if -pue && ! -snSN ** register if -u ** write if -p ** if (-snSN && -pe) || -u ** free tokens ** else ** accumulate tokens ** **end: register if -snSN && ! -pe */ /* Function Definitions */ void print_stats(FILE *fp) { msg_print_stats(fp); } rc_t bogofilter(int argc, char **argv) { uint msgcount = 0; rc_t status = RC_OK; bool register_opt = (run_type & (REG_SPAM | UNREG_SPAM | REG_GOOD | UNREG_GOOD)) != 0; bool register_bef = register_opt && passthrough; bool register_aft = ((register_opt && !passthrough) || (run_type & RUN_UPDATE)) != 0; bool write_msg = passthrough || Rtable; bool classify_msg = write_msg || ((run_type & (RUN_NORMAL | RUN_UPDATE))) != 0; wordhash_t *words; score_initialize(); /* initialize constants */ if (query) return query_config(); words = register_aft ? wordhash_new() : NULL; bogoreader_init(argc, (const char * const *) argv); while ((*reader_more)()) { double spamicity; wordhash_t *w = wordhash_new(); rstats_init(); passthrough_setup(); collect_words(w); wordhash_sort(w); msgcount += 1; format_set_counts(w->count, msgcount); if (!passthrough_keepopen()) bogoreader_close_ifeof(); if (register_opt && DEBUG_REGISTER(1)) fprintf(dbgout, "Message #%ld\n", (long) msgcount); if (register_bef) register_words(run_type, w, 1); if (register_aft) wordhash_add(words, w, &wordprop_init); if (classify_msg || write_msg) { lookup_words(w); /* This reads the database */ spamicity = msg_compute_spamicity(w); status = msg_status(); if (run_type & RUN_UPDATE) /* Note: don't register if RC_UNSURE */ { if (status == RC_SPAM && spamicity <= 1.0 - thresh_update) register_words(REG_SPAM, w, msgcount); if (status == RC_HAM && spamicity >= thresh_update) register_words(REG_GOOD, w, msgcount); } if (verbose && !passthrough && !quiet) { const char *filename = (*reader_filename)(); if (filename) fprintf(fpo, "%s ", filename); } write_message(status); /* passthrough */ if (logflag && !register_opt) { write_log_message(status); msgcount = 0; } } wordhash_free(w); passthrough_cleanup(); rstats_cleanup(); if (DEBUG_MEMORY(2)) MEMDISPLAY; if (fDie) exit(EX_ERROR); } bogoreader_fini(); if (DEBUG_MEMORY(1)) MEMDISPLAY; if (register_aft && ((run_type & RUN_UPDATE) == 0)) { wordhash_sort(words); register_words(run_type, words, msgcount); } score_cleanup(); if (logflag && register_opt) write_log_message(status); wordhash_free(words); if (DEBUG_MEMORY(1)) MEMDISPLAY; return status; } /* Done */ bogofilter-1.2.4/src/uudecode.c0000644000175000017500000000232612163572304014574 0ustar sezsez/* $Id: uudecode.c 6766 2009-01-12 04:27:36Z relson $ */ /***************************************************************************** NAME: uudecode.c -- decode uuencoded text AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include "uudecode.h" uint uudecode(word_t *word) { uint size = word->leng; uint count = 0; byte *b = word->u.text; /* beg */ byte *s = b; /* src */ byte *d = b; /* dst */ byte *e = b+size; /* end */ int out = (*s++ & 0x7f) - 0x20; /* don't process lines without leading count character */ if (out < 0) return size; /* don't process begin and end lines */ if ((strncasecmp((const char *)b, "begin ", 6) == 0) || (strncasecmp((const char *)b, "end", 3) == 0)) return size; while (s < e - 4) { int v = 0; int i; for (i = 0; i < 4; i += 1) { byte c = *s++; v = v << 6 | ((c - 0x20) & 0x3F); } for (i = 2; i >= 0; i -= 1) { byte c = (byte) (v & 0xFF); d[i] = c; v = v >> 8; } d += 3; count += 3; } while (s < e) { *d++ = *s++; count += 1; } *d = (byte) '\0'; return count; } bogofilter-1.2.4/src/configfile.c0000644000175000017500000001203312163572272015104 0ustar sezsez/* $Id: configfile.c 6876 2010-02-15 19:16:16Z m-a $ */ /***************************************************************************** NAME: configfile.c -- process config file parameters 2003-02-12 - split out from config.c so bogolexer use the code. AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include #include "getopt.h" #include "bogoconfig.h" #include "bogofilter.h" #include "bool.h" #include "maint.h" #include "error.h" #include "find_home.h" #include "format.h" #include "lexer.h" #include "longoptions.h" #include "maint.h" #include "wordlists.h" #include "xatox.h" #include "xmalloc.h" #include "xstrdup.h" #ifndef DEBUG_CONFIG #define DEBUG_CONFIG(level) (verbose > level) #endif /*---------------------------------------------------------------------------*/ /* NOTE: MAXBUFFLEN _MUST_ _NOT_ BE LARGER THAN INT_MAX! */ #define MAXBUFFLEN ((int)200) /*---------------------------------------------------------------------------*/ /* Global variables */ #ifndef __riscos__ const char *user_config_file = "~/.bogofilter.cf"; #else const char *user_config_file = "Choices:bogofilter.bogofilter/cf"; #endif bool stats_in_header = true; char *config_file_name; /*---------------------------------------------------------------------------*/ /* remove trailing comment from the line. */ void remove_comment(const char *line) { char *tmp = strchr(line, '#'); if (tmp != NULL) { tmp -= 1; while (tmp > line && isspace((unsigned char)*tmp)) tmp -= 1; *(tmp+1) = '\0'; } return; } bool process_config_option(const char *arg, bool warn_on_error, priority_t precedence, struct option *longopts) { uint pos; bool ok = true; char *val = NULL; const char *opt = arg; char *dupl; const char delim[] = " \t="; while (isspace((unsigned char)*opt)) /* ignore leading whitespace */ opt += 1; dupl = xstrdup(opt); pos = strcspn(dupl, delim); if (pos < strlen(dupl)) { /* if delimiter present */ val = dupl + pos; *val++ = '\0'; val += strspn(val, delim); } if (val == NULL || !process_config_option_as_arg(dupl, val, precedence, longopts)) { ok = false; if (warn_on_error) fprintf(stderr, "Error - bad parameter '%s'\n", arg); } xfree(dupl); return ok; } /* option_compare() ** ** Returns true if options are equal, without regard to case and ** allows underscore from config file to match hyphen */ static bool option_compare(const char *opt, const char *name) { char co, cn; if (strlen(opt) != strlen(name)) return false; while (((co = *opt++) != '\0') && ((cn = *name++) != '\0')) { if ((co == cn) || (tolower((unsigned char)co) == tolower((unsigned char)cn))) continue; if (co != '_' || cn != '-') return false; } return true; } bool process_config_option_as_arg(const char *opt, const char *val, priority_t precedence, struct option *long_options) { struct option *option; for (option = long_options; option->name; option += 1) { if (!option_compare(opt, option->name)) continue; if (strcmp(val, "''") == 0) val = ""; process_arg(option->val, option->name, val, precedence, PASS_2_CFG); return true; } return false; } bool read_config_file(const char *fname, bool tilde_expand, bool warn_on_error, priority_t precedence, struct option *longopts) { bool ok = true; int lineno = 0; FILE *fp; if (config_file_name != NULL) xfree(config_file_name); if (!tilde_expand) config_file_name = xstrdup(fname); else config_file_name = tildeexpand(fname); fp = fopen(config_file_name, "r"); if (fp == NULL) { xfree(config_file_name); config_file_name = NULL; return false; } if (DEBUG_CONFIG(0)) fprintf(dbgout, "Reading %s\n", config_file_name); while (!feof(fp)) { size_t len; char buff[MAXBUFFLEN]; lineno += 1; if (fgets(buff, sizeof(buff), fp) == NULL) break; len = strlen(buff); if ( buff[0] == '#' || buff[0] == ';' || buff[0] == '\n' ) continue; while (len >= 1 && (iscntrl((unsigned char)buff[len-1]) || isspace((unsigned char)buff[len-1]))) buff[--len] = '\0'; if (DEBUG_CONFIG(1)) fprintf(dbgout, "Testing: %s\n", buff); if (!process_config_option(buff, warn_on_error, precedence, longopts)) ok = false; } if (ferror(fp)) { fprintf(stderr, "Error reading file \"%s\"\n.", config_file_name); ok = false; } (void)fclose(fp); /* we're just reading, so fclose should succeed */ return ok; } /* exported */ bool process_config_files(bool warn_on_error, struct option *longopts) { bool ok = true; const char *env = getenv("BOGOTEST"); if (!suppress_config_file) { if (!read_config_file(system_config_file, false, warn_on_error, PR_CFG_SITE, longopts)) ok = false; if (!read_config_file(user_config_file, true, warn_on_error, PR_CFG_USER, longopts)) ok = false; } if (env) set_bogotest(env); return ok; } bogofilter-1.2.4/src/find_home.test.c0000644000175000017500000000322212163572272015705 0ustar sezsez/* find_home.test.c -- program to test find_home library */ /* (C) 2002 by Matthias Andree * * This program is free software; you can redistribute it and/or modify * it under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * 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, it is in the file named * COPYING. */ /* $Id: find_home.test.c 6484 2006-05-29 14:28:00Z relson $ */ #include "common.h" #include #include #include "find_home.h" enum mode { current = 42, by_user, tilde }; /* run: * without arguments or with 0 argument to get home by user id * with tilde argument to try tilde expansion * with non-0 argument to try $HOME, then try user id */ int main(int argc, char **argv) { const char *h; char *tofree = NULL; int read_env = 0; enum mode mode = current; if (argc >= 2) { if (!isdigit((unsigned char)argv[1][0])) { if (argv[1][0] == '~') { mode = tilde; } else { mode = by_user; } } else { read_env = atoi(argv[1]); } } switch (mode) { case by_user: h = find_home_user(argv[1]); break; case tilde: h = tofree = tildeexpand(argv[1]); break; case current: h = find_home(read_env); break; default: abort(); } if (h != NULL) { (void)puts(h); } else { perror(argv[0]); } if (tofree) free(tofree); exit(h ? EXIT_SUCCESS : EX_ERROR); } bogofilter-1.2.4/src/common.h0000644000175000017500000001044412163572304014274 0ustar sezsez/* $Id: common.h 6795 2009-02-14 18:29:46Z relson $ */ /***************************************************************************** NAME: common.h -- common definitions and prototypes for bogofilter ******************************************************************************/ #ifndef COMMON_H #define COMMON_H #include "system.h" #ifdef HAVE_STDARG_H #include #endif #include #include "debug.h" #ifdef ENABLE_MEMDEBUG #include "memdebug.h" #else #define MEMDISPLAY do { } while(0) #endif /* for easier debugging - can be disabled */ #if 0 #define D 0 /* size adjustment */ #define Z(n) /* mark end of string */ #else #define D 1 /* size adjustment */ #define Z(n) n=(byte)'\0' /* mark end of string */ #endif /* length of token between these values */ #define MIN_TOKEN_LEN 3 /* default value of min-token-len */ #define MAX_TOKEN_LEN 30 /* default value of max-token-len */ #define MAX_MULTI_TOKEN_LEN 30 /* default value of max-multi-token-len */ #define MAX_PREFIX_LEN 5 /* maximum length of prefix */ #define MUL_TOKEN_CNT 1 /* default value of multi-token-count */ typedef enum sh_e { IX_SPAM = 0, /* index for SPAM */ IX_GOOD = 1, /* index for GOOD */ IX_SIZE = 2, /* array size */ IX_UNDF = 3 /* ... undefined */ } sh_t; #define max(x, y) (((x) > (y)) ? (x) : (y)) #define min(x, y) (((x) < (y)) ? (x) : (y)) #define NL "\n" #define CRLF "\r\n" #if defined(PATH_MAX) #define PATH_LEN PATH_MAX #elif defined(MAXPATHLEN) #define PATH_LEN MAXPATHLEN #else #define PATH_LEN 1024 #endif /** Default database file mode */ #define DS_MODE (mode_t) 0664 /** Default directory */ #define DIR_MODE (mode_t) 0775 #define COUNTOF(array) (uint) (sizeof(array)/sizeof(array[0])) typedef unsigned char byte; enum dbmode_e { DS_READ = 1, DS_WRITE = 2, DS_LOAD = 8 }; typedef enum dbmode_e dbmode_t; #define BIT(n) (1 << n) typedef enum rc_e { RC_SPAM = 0, RC_HAM = 1, RC_UNSURE = 2, RC_OK, RC_MORE } rc_t; typedef enum ex_e { EX_SPAM = RC_SPAM, EX_HAM = RC_HAM, EX_UNSURE = RC_UNSURE, EX_OK = 0, EX_ERROR = 3 } ex_t; typedef enum run_e { RUN_UNKNOWN= 0, RUN_NORMAL = BIT(0), RUN_UPDATE = BIT(1), REG_SPAM = BIT(2), REG_GOOD = BIT(3), UNREG_SPAM = BIT(4), UNREG_GOOD = BIT(5) } run_t; extern run_t run_type; extern bool run_classify; extern bool run_register; typedef struct { double mant; int exp; } FLOAT; typedef enum priority_e { PR_NONE, /* 0 */ PR_ENV_HOME, /* 1 */ PR_CFG_SITE, /* 2 */ PR_CFG_USER, /* 3 */ PR_CFG_UPDATE, /* 4 */ PR_ENV_BOGO, /* 5 */ PR_COMMAND /* 6 */ } priority_t; typedef enum bulk_e { B_NORMAL, B_CMDLINE, B_STDIN } bulk_t; /* for transaction flag */ typedef enum { T_ERROR = -1, /* -1 for error */ T_DISABLED = 0, /* 0 for no transactions - 0 must mean T_DISABLE for compatibility with dummy functions */ T_ENABLED = 1, /* 1 for transactions */ T_DEFAULT_OFF = 2, /* 2 for off, unless explicity specified */ T_DEFAULT_ON = 3, /* 3 for on, unless explicity specified */ T_DONT_KNOW /* 4 for don't know */ } e_txn; /* for encoding (unicode) flag */ typedef enum { E_UNKNOWN = 0, /* 0 for not set */ E_RAW = 1, /* 1 for raw text */ E_UNICODE = 2, /* 2 for unicode */ #ifdef ENABLE_UNICODE E_DEFAULT = E_UNICODE #else E_DEFAULT = E_RAW #endif } e_enc; #include "globals.h" /* Represents the secondary data for a word key */ typedef struct { u_int32_t good; u_int32_t bad; u_int32_t msgs_good; u_int32_t msgs_bad; } wordcnts_t; typedef struct { wordcnts_t cnts; double prob; int freq; bool used; } wordprop_t; extern void bf_exit(void); #define internal_error do { fprintf(stderr, "Internal error in %s:%lu\n", __FILE__, (unsigned long)__LINE__); abort(); } while(0) typedef enum e_wordlist_version { ORIGINAL_VERSION = 0, IP_PREFIX = 20040500 /* when IP prefixes were added */ } t_wordlist_version; #define CURRENT_VERSION IP_PREFIX /* for bogoutil.c and datastore_db_trans.c */ typedef enum { M_NONE, M_DUMP, M_LOAD, M_WORD, M_MAINTAIN, M_ROBX, M_HIST, M_LIST_LOGFILES, M_LEAFPAGES, M_RECOVER, M_CRECOVER, M_PURGELOGS, M_VERIFY, M_REMOVEENV, M_CHECKPOINT, M_PAGESIZE } cmd_t; #endif bogofilter-1.2.4/src/find_home.h0000644000175000017500000000175612163572304014742 0ustar sezsez/* $Id: find_home.h 5752 2005-03-29 03:04:39Z relson $ */ /* find_home.h -- library function to figure out the home dir of current user */ #ifndef FIND_HOME_H #define FIND_HOME_H #include "system.h" /* (C) 2002 by Matthias Andree * * This program is free software; you can redistribute it and/or modify * it under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * 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, it is in the file named * COPYING. */ /*@null@*/ /*@observer@*/ const char * find_home(int read_env) /*@globals errno@*/; /*@null@*/ /*@observer@*/ const char * find_home_user(const char *username) /*@globals errno@*/; /*@only@*/ char * tildeexpand(const char *filename) /*@globals errno@*/; #endif bogofilter-1.2.4/src/buff.c0000644000175000017500000000465412163572304013727 0ustar sezsez/* $Id: buff.c 6766 2009-01-12 04:27:36Z relson $ */ /** \file buff.c * implementation of the buff type, a buffer for arbitrary strings * and actually a superset of word_t * * \author David Relson * \author Matthias Andree (buff_fgetsl) */ #include "common.h" #include #include "buff.h" #include "fgetsl.h" #include "xmalloc.h" #define BOGO_ASSERT(expr, msg) if (!(expr)) { fprintf(stderr, "%s: %s:%d %s\n", progname, __FILE__, __LINE__, msg); abort(); } /* Function Definitions */ buff_t *buff_init(buff_t *self, byte *buff, uint used, uint size) { self->t.u.text = buff; self->t.leng = used; self->read = 0; self->size = size; return self; } buff_t *buff_new(byte *buff, uint used, uint size) { buff_t *self = xmalloc(sizeof(buff_t)); buff_init(self, buff, used, size); return self; } void buff_free(buff_t *self) { xfree(self); } int buff_fgetsln(buff_t *self, FILE *in, uint maxlen) { uint readpos = self->t.leng; int readcnt = xfgetsl((char *)self->t.u.text + readpos, min(self->size - readpos, maxlen), in, true); /* WARNING: do not add NUL termination, the size must be exact! */ self->read = readpos; if (readcnt >= 0) self->t.leng += readcnt; return readcnt; } int buff_add(buff_t *self, word_t *in) { uint readpos = self->t.leng; int readcnt = in->leng; uint new_size = self->t.leng + in->leng; if (new_size > self->size) { self->t.u.text = xrealloc(self->t.u.text, new_size); self->size = new_size; } self->read = readpos; self->t.leng += readcnt; memcpy(self->t.u.text + readpos, in->u.text, readcnt); Z(self->t.u.text[self->t.leng]); /* for easier debugging - removable */ return readcnt; } void buff_puts(const buff_t *self, uint width, FILE *fp) { word_t word; word.leng = self->t.leng - self->read; word.u.text = self->t.u.text + self->read; word_puts(&word, width, fp); } void buff_shift(buff_t *self, uint start, uint length) { /* Shift buffer contents to delete the specified segment. */ /* Implemented for deleting html comments. */ BOGO_ASSERT(start + length <= self->t.leng, "Invalid buff_shift() parameters."); memmove(self->t.u.text + start, self->t.u.text + start + length, self->t.leng - length); self->t.leng -= length; Z(self->t.u.text[self->t.leng]); /* for easier debugging - removable */ return; } bogofilter-1.2.4/src/datastore_dummies.c0000644000175000017500000000037512163572304016512 0ustar sezsez #include "common.h" #include "datastore.h" #include "datastore_db.h" void *dbe_init(bfpath *p) { (void)p; return (void *)~0; } void dsm_init(bfpath *p) { (void)p; } void *db_get_env(void *vhandle) { (void)vhandle; return NULL; } bogofilter-1.2.4/src/xstrlcpy.h0000644000175000017500000000016612163572272014700 0ustar sezsez#ifndef XSTRLCPY_H #define XSTRLCPY_H #include size_t xstrlcpy(char *, const char *, size_t); #endif bogofilter-1.2.4/src/robx.h0000644000175000017500000000056512163572304013761 0ustar sezsez/* $Id: robx.h 5760 2005-04-04 11:16:24Z relson $ */ /***************************************************************************** NAME: robx.h -- prototypes and definitions for robx.c ******************************************************************************/ #ifndef HAVE_ROBX_H #define HAVE_ROBX_H double compute_robinson_x(void); #endif /* HAVE_ROBX_H */ bogofilter-1.2.4/src/datastore_db_trad.c0000644000175000017500000000652612163572272016456 0ustar sezsez/* $Id: datastore_db_trad.c 6650 2007-02-14 21:19:32Z m-a $ */ /***************************************************************************** NAME: datastore_db_trad.c -- implements bogofilter's traditional (non-transactional) datastore, using Berkeley DB AUTHORS: Gyepi Sam 2002 - 2003 Matthias Andree 2003 - 2004 David Relson 2003 - 2005 ******************************************************************************/ #include "common.h" #include #include #include "datastore.h" #include "datastore_db_private.h" #include "datastore_db.h" #include "datastore_dbcommon.h" #include "db_lock.h" #include "error.h" #include "longoptions.h" #include "paths.h" #include "xmalloc.h" #include "xstrdup.h" /* public -- used in datastore.c */ /* private -- used in datastore_db_*.c */ static DB_ENV *bft_get_env_dbe (dbe_t *env); static const char *bft_database_name (const char *db_file); static DB_ENV *bft_recover_open (bfpath *bfp); static int bft_get_rmw_flag (int open_mode); static void bft_log_flush (DB_ENV *dbe); static dbe_t *bft_init (bfpath *bfp); static void bft_cleanup (dbe_t *env); static void bft_cleanup_lite (dbe_t *env); /* OO function lists */ dsm_t dsm_traditional = { /* public -- used in datastore.c */ NULL, /* bft_begin */ NULL, /* bft_abort */ NULL, /* bft_commit */ /* private -- used in datastore_db_*.c */ &bft_init, &bft_cleanup, &bft_cleanup_lite, &bft_get_env_dbe, &bft_database_name, &bft_recover_open, NULL, /* bft_auto_commit_flags*/ &bft_get_rmw_flag, &db_lock, NULL, /* &bft_common_close */ NULL, /* &bft_sync */ &bft_log_flush, &db_pagesize, /* dsm_pagesize */ NULL, /* dsm_checkpoint */ NULL, /* dsm_purgelogs */ NULL, /* dsm_recover */ NULL, /* dsm_remove */ &db_verify, /* dsm_verify */ NULL, /* dsm_list_logfiles */ &db_leafpages /* dsm_leafpages */ }; DB_ENV *bft_get_env_dbe (dbe_t *env) { (void) env; return NULL; } const char *bft_database_name(const char *db_file) { return db_file; } int bft_get_rmw_flag(int open_mode) { (void) open_mode; return 0; } DB_ENV *bft_recover_open(bfpath *bfp) { int fd; fd = open(bfp->filepath, O_RDWR); if (fd < 0) { print_error(__FILE__, __LINE__, "bft_recover_open: cannot open %s: %s", bfp->filepath, strerror(errno)); exit(EX_ERROR); } if (subr_db_lock(fd, F_SETLKW, (short int)F_WRLCK)) { print_error(__FILE__, __LINE__, "bft_recover_open: cannot lock %s for exclusive use: %s", bfp->filepath, strerror(errno)); close(fd); exit(EX_ERROR); } return NULL; } void bft_log_flush(DB_ENV *dbe) { int ret; ret = BF_LOG_FLUSH(dbe, NULL); if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB_ENV->log_flush(%p): %s\n", (void *)dbe, db_strerror(ret)); } dbe_t *bft_init(bfpath *bfp) { dbe_t *env = xcalloc(1, sizeof(dbe_t)); env->magic = MAGIC_DBE; /* poor man's type checking */ env->directory = xstrdup(bfp->dirname); return env; } void bft_cleanup(dbe_t *env) { bft_cleanup_lite(env); } void bft_cleanup_lite(dbe_t *env) { xfree(env->directory); xfree(env); } bogofilter-1.2.4/src/datastore_db.c0000644000175000017500000007250212163572304015435 0ustar sezsez/* $Id: datastore_db.c 6895 2010-03-23 17:48:52Z m-a $ */ /***************************************************************************** NAME: datastore_db.c -- implements the datastore, using Berkeley DB AUTHORS: Gyepi Sam 2002 - 2003 Matthias Andree 2003 - 2005 ******************************************************************************/ /* To avoid header file conflicts the order is: ** 1. System header files ** 2. Header files for external packages ** 3. Bogofilter's header files */ /* TODO: * - implement proper retry when our transaction is aborted after a * deadlock * - document code changes * - conduct massive tests */ /* * NOTE: this code is an "#if" nightmare due to the many different APIs * in the many different BerkeleyDB versions. */ #include "common.h" #include #include #include #include #include #include #include "datastore.h" #include "datastore_db.h" #include "datastore_dbcommon.h" #ifdef DB_VERSION_MAJOR /* if Berkeley DB */ #include "datastore_db_private.h" #endif #include "error.h" #include "rand_sleep.h" #include "xmalloc.h" #include "xstrdup.h" extern dsm_t dsm_traditional; /* in datastore_db_trad.c */ extern dsm_t dsm_transactional; /* in datastore_db_trans.c */ #ifndef ENABLE_TRANSACTIONS dsm_t *dsm = &dsm_traditional; #else dsm_t *dsm = &dsm_transactional; #endif /** Default flags for DB_ENV->open() */ bool db_log_autoremove = true; /* DB_LOG_AUTOREMOVE */ #ifdef FUTURE_DB_OPTIONS bool db_txn_durable = true; /* not DB_TXN_NOT_DURABLE */ #endif static const DBTYPE dbtype = DB_BTREE; /** translate BerkeleyDB \a flags bitfield for DB->open method back to symbols */ static const char *resolveopenflags(u_int32_t flags) { static char buf[160]; char b2[80]; strlcpy(buf, "", sizeof(buf)); if (flags & DB_CREATE) flags &= ~DB_CREATE, strlcat(buf, "DB_CREATE ", sizeof(buf)); if (flags & DB_EXCL) flags &= ~DB_EXCL, strlcat(buf, "DB_EXCL ", sizeof(buf)); if (flags & DB_NOMMAP) flags &= ~DB_NOMMAP, strlcat(buf, "DB_NOMMAP ", sizeof(buf)); if (flags & DB_RDONLY) flags &= ~DB_RDONLY, strlcat(buf, "DB_RDONLY ", sizeof(buf)); #if DB_AT_LEAST(4,1) if (flags & DB_AUTO_COMMIT) flags &= ~DB_AUTO_COMMIT, strlcat(buf, "DB_AUTO_COMMIT ", sizeof(buf)); #endif snprintf(b2, sizeof(b2), "%#lx", (unsigned long)flags); if (flags) strlcat(buf, b2, sizeof(buf)); return buf; } static void set_txn_mode(void) { if (eTransaction == T_DEFAULT_OFF) eTransaction = T_DISABLED; if (eTransaction == T_DEFAULT_ON) eTransaction = T_ENABLED; } #if !defined(ENABLE_TRANSACTIONS) && !defined(DISABLE_TRANSACTIONS) static const char *txn2str(e_txn txn) { const char *v = "unknown"; switch (txn) { case T_ERROR: v = "T_ERROR"; break; case T_DISABLED: v = "T_DISABLED"; break; case T_ENABLED: v = "T_ENABLED"; break; case T_DEFAULT_OFF: v = "T_DEFAULT_OFF"; break; case T_DEFAULT_ON: v = "T_DEFAULT_ON"; break; case T_DONT_KNOW: v = "T_DONT_KNOW"; break; } return v; } #endif #if !defined(ENABLE_TRANSACTIONS) && !defined(DISABLE_TRANSACTIONS) static e_txn get_txn_state(bfpath *bfp) { e_txn txn = eTransaction; /* check for overrides (for test suite, etc.) */ if (getenv("BF_FORCE_NON_TRANSACTIONAL")) txn = T_DISABLED; if (getenv("BF_FORCE_TRANSACTIONAL")) txn = T_ENABLED; if (txn != T_DISABLED && txn != T_ENABLED) { /* if not set, probe for database environment */ e_txn probe; if (DEBUG_DATABASE(1)) fprintf(dbgout, "probing \"%s\" and \"%s\" for environment...", bfp->dirname, bfp->filename); probe = probe_txn(bfp); if (probe == T_DISABLED || probe == T_ENABLED) txn = probe; if (DEBUG_DATABASE(1)) fprintf(dbgout, "%s\n", txn2str(probe)); } /* else just use the default */ return txn; } #endif static void check_env_pagesize(DB *db) { const char *ps = getenv("BF_PAGESIZE"); if (ps != NULL) { u_int32_t s = atoi(ps); if (((s - 1) ^ s) != (s * 2 - 1)) { fprintf(stderr, "BF_PAGESIZE must be a power of 2, ignoring\n"); } else if (s < 512 || s > 65536) { fprintf(stderr, "BF_PAGESIZE must be 512 ... 65536, ignoring\n"); } else { int r = db->set_pagesize(db, s); if (r != 0) { fprintf(stderr, "setting pagesize to %d failed: %s\n", s, db_strerror(r)); } } } } /** wrapper for Berkeley DB's DB->open() method which has changed API and * semantics -- this should deal with 3.2, 3.3, 4.0, 4.1 and 4.2. */ static int DB_OPEN(DB *db, bfpath *bfp, const char *database, DBTYPE type, u_int32_t flags, int mode) { int ret; const char *file; check_env_pagesize(db); #if DB_AT_LEAST(4,1) if (dsm->dsm_auto_commit_flags != NULL) flags |= dsm->dsm_auto_commit_flags(); #endif if (eTransaction == T_DISABLED) file = bfp->filepath; else file = bfp->filename; ret = db->open(db, #if DB_AT_LEAST(4,1) 0, /* TXN handle - we use autocommit instead */ #endif file, database, type, flags, mode ); if (DEBUG_DATABASE(1) || getenv("BF_DEBUG_DB_OPEN")) fprintf(dbgout, "[pid %lu] DB->open(db=%p, file=%s, database=%s, " "type=%x, flags=%#lx=%s, mode=%#o) -> %d %s\n", (unsigned long)getpid(), (void *)db, file, database ? database : "NIL", type, (unsigned long)flags, resolveopenflags(flags), mode, ret, db_strerror(ret)); return ret; } #if DB_AT_LEAST(4,1) /** translate BerkeleyDB \a flags bitfield for DB->set_flags method back to symbols */ static const char *resolvesetflags(u_int32_t flags) { static char buf[160]; char b2[80]; strlcpy(buf, "", sizeof(buf)); #if DB_EQUAL(4,1) if (flags & DB_CHKSUM_SHA1) flags &= ~DB_CHKSUM_SHA1, strlcat(buf, "DB_CHKSUM_SHA1 ", sizeof(buf)); #endif #if DB_AT_LEAST(4,2) if (flags & DB_CHKSUM) flags &= ~DB_CHKSUM, strlcat(buf, "DB_CHKSUM ", sizeof(buf)); #endif snprintf(b2, sizeof(b2), "%#lx", (unsigned long)flags); if (flags) strlcat(buf, b2, sizeof(buf)); return buf; } /** Set flags and print debugging info */ static int DB_SET_FLAGS(DB *db, u_int32_t flags) { int ret = db->set_flags(db, flags); if (DEBUG_DATABASE(1)) fprintf(dbgout, "[pid %lu] DB->set_flags(db=%p, flags=%#lx=%s) -> %d %s\n", (unsigned long)getpid(), (void *)db, (unsigned long)flags, resolvesetflags(flags), ret, db_strerror(ret)); return ret; } #endif void *db_get_env(void *vhandle) { dbh_t *handle = vhandle; assert(handle->magic == MAGIC_DBH); return handle->dbenv; } /* implements locking. */ int subr_db_lock(int fd, int cmd, short int type) { struct flock lock; lock.l_type = type; lock.l_start = 0; lock.l_whence = (short int)SEEK_SET; lock.l_len = 0; return (fcntl(fd, cmd, &lock)); } int db_lock(void *vhandle, int open_mode) { int e = 0; dbh_t *handle = vhandle; /* try fcntl lock */ handle->locked = false; if (subr_db_lock(handle->fd, F_SETLK, (short int)(open_mode == DS_READ ? F_RDLCK : F_WRLCK))) { e = errno; db_close(handle); errno = e; if (errno == EACCES) e = errno = EAGAIN; } else { /* have lock */ if (handle->fd >= 0) handle->locked = true; } return e; } void dsm_init(bfpath *bfp) { /* Note: we assume that the default dsm initializers above handle * this properly, dsm_init is empty if transactions are disabled or * forced. */ #if !defined(ENABLE_TRANSACTIONS) && !defined(DISABLE_TRANSACTIONS) eTransaction = get_txn_state(bfp); set_txn_mode(); if (eTransaction == T_DISABLED) dsm = &dsm_traditional; else dsm = &dsm_transactional; #else (void)bfp; set_txn_mode(); #endif } /** "constructor" - allocate our handle and initialize its contents */ static dbh_t *dbh_init(bfpath *bfp) { dbh_t *handle; handle = xmalloc(sizeof(dbh_t)); memset(handle, 0, sizeof(dbh_t)); /* valgrind */ handle->dsm = dsm; handle->txn = NULL; handle->magic= MAGIC_DBH; /* poor man's type checking */ handle->fd = -1; /* for lock */ handle->name = xstrdup(bfp->filepath); handle->locked = false; handle->is_swapped = false; handle->created = false; return handle; } /** free \a handle and associated data. * NB: does not close transactions, data bases or the environment! */ static void handle_free(/*@only@*/ dbh_t *handle) { if (handle != NULL) { xfree((char *)handle->name); xfree(handle); } return; } static bool xstat(const char *path, struct stat *st) { int e = stat(path, st); if (e) { fprintf(stderr, "Cannot stat \"%s\": %s\n", path, strerror(errno)); } return e; } /** Ensure that only a single database environment is specified, * \return true for success */ static bool check_path(bfpath *bfp) { struct stat stdn, stbh; /* Only bogofilter (with transactions) has to worry about multiple environments */ if (!fBogofilter || eTransaction == T_DISABLED) return true; /* If bogohome not yet set, skip check */ if (bfp->dirname == NULL || bogohome == NULL) return true; /* XXX FIXME: If we cannot stat, skip check for now. * We should probably handle this condition but then again when * bootstrapping a setup a missing environment is probably OK */ if (xstat(bfp->dirname, &stdn)) return true; if (xstat(bogohome, &stbh)) return true; if (stdn.st_dev == stbh.st_dev && stdn.st_ino == stbh.st_ino) return true; else { fprintf(stderr, "ERROR: only one database _environment_ (directory) can be used at a time.\n" "You CAN use multiple wordlists that are in the same directory.\n\n"); fprintf(stderr, "If you need multiple wordlists in different directories,\n" "you cannot use the transactional interface, but you must configure\n" "the non-transactional interface, i. e. ./configure --disable-transactions\n" "then type make clean, after that rebuild and install as usual.\n" "Note that the data base will no longer be crash-proof in that case.\n" "Please accept our apologies for the inconvenience.\n"); fprintf(stderr, "\nAborting program\n"); return false; } } /** Initialize data base, configure some lock table sizes * (which can be overridden in the DB_CONFIG file) * and lock the file to tell other parts we're initialized and * do not want recovery to stomp over us. */ void *dbe_init(bfpath *bfp) { dbe_t *env; if (!check_path(bfp)) exit(EX_ERROR); if (bfp->isdir) return NULL; dsm_init(bfp); env = dsm->dsm_env_init(bfp); return env; } /* Returns is_swapped flag */ bool db_is_swapped(void *vhandle) { dbh_t *handle = vhandle; assert(handle->magic == MAGIC_DBH); return handle->is_swapped; } /* Returns created flag */ bool db_created(void *vhandle) { dbh_t *handle = vhandle; assert(handle->magic == MAGIC_DBH); return handle->created; } /* If header and library version do not match, * print an error message on stderr and exit with EX_ERROR. */ static void check_db_version(void) { int maj, min; static bool version_ok = false; #if DB_AT_MOST(3,0) #error "Berkeley DB 3.0 is not supported" #endif if (!version_ok) { version_ok = true; (void)db_version(&maj, &min, NULL); if (DEBUG_DATABASE(1)) fprintf(dbgout, "db_version: Header version %d.%d, library version %d.%d\n", DB_VERSION_MAJOR, DB_VERSION_MINOR, maj, min); if (!(maj == DB_VERSION_MAJOR && min == DB_VERSION_MINOR)) { fprintf(stderr, "The DB versions do not match.\n" "This program was compiled for DB version %d.%d,\n" "but it is linked against DB version %d.%d.\nAborting.\n", DB_VERSION_MAJOR, DB_VERSION_MINOR, maj, min); exit(EX_ERROR); } } } /** check limit of open file (given through descriptor \a fd) against * current resource limit and warn if file size is "close" (2 MB) to the * limit. errors from the system are ignored, no warning then. */ static bool check_fsize_limit(int fd, uint32_t pagesize) { bool ok = true; static bool fPrinted = false; #ifndef __EMX__ struct stat st; struct rlimit rl; /* Only print this message once per run */ if (fPrinted) return ok; if (fstat(fd, &st)) return ok; /* ignore error */ if (getrlimit(RLIMIT_FSIZE, &rl)) return ok; /* ignore error */ if (rl.rlim_cur != (rlim_t)RLIM_INFINITY) { /* WARNING: Be extremely careful that in these comparisons there * is no unsigned term, it will spoil everything as C will * coerce into unsigned types, which would then make "file size * larger than resource limit" undetectable. BUG: this doesn't * work when pagesize doesn't fit into signed long. ("requires" * 2**31 for file size and 32-bit integers to fail) */ if ((off_t)(rl.rlim_cur/pagesize) - st.st_size/(long)pagesize < 16) { print_error(__FILE__, __LINE__, "error: the data base file size is within 16 pages"); print_error(__FILE__, __LINE__, " of the resource limit. Cowardly refusing"); print_error(__FILE__, __LINE__, " to write to avoid data base corruption."); ok = false; } else if ((off_t)(rl.rlim_cur >> 20) - (st.st_size >> 20) < 2) { fPrinted = true; print_error(__FILE__, __LINE__, "warning: data base file size approaches resource limit."); print_error(__FILE__, __LINE__, " write errors (bumping into the limit) can cause"); print_error(__FILE__, __LINE__, " data base corruption."); } } #endif return ok; } /* The old, pre-3.3 API will not fill in the page size with * DB_CACHED_COUNTS, and without DB_CACHED_COUNTS, BerlekeyDB will read * the whole data base, incurring a severe performance penalty. We'll * guess a page size. As this is a safety margin for the file size, * we'll return 0 and let the caller guess some size instead. */ /* return page size, of 0xffffffff for trouble */ static uint32_t get_psize(DB *dbp, /**< Berkeley DB pointer */ bool wanted /** if set, try harder to get the page size, even if * it requires to read the whole database */) { uint32_t ret, pagesize; DB_BTREE_STAT *dbstat = NULL; #if DB_AT_LEAST(3,3) ret = BF_DB_STAT(dbp, NULL, &dbstat, DB_FAST_STAT); (void)wanted; #else ret = dbp->stat(dbp, &dbstat, malloc, wanted ? 0 : DB_CACHED_COUNTS); #endif if (ret) { print_error(__FILE__, __LINE__, "DB->stat"); return 0xffffffff; } pagesize = dbstat->bt_pagesize; if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB->stat success, pagesize: %lu\n", (unsigned long)pagesize); free(dbstat); return pagesize; } const char *db_version_str(void) { static char v[80]; #ifdef DB_VERSION_STRING strcpy(v, DB_VERSION_STRING); #else snprintf(v, sizeof(v), "BerkeleyDB (%d.%d.%d)", DB_VERSION_MAJOR, DB_VERSION_MINOR, DB_VERSION_PATCH); #endif #if !defined(ENABLE_TRANSACTIONS) && !defined(DISABLE_TRANSACTIONS) strcat(v, " AUTO-XA"); #else set_txn_mode(); if (eTransaction == T_ENABLED) strcat(v, " TRANSACTIONAL"); else strcat(v, " NON-TRANSACTIONAL"); #endif return v; } /** Initialize database. Expects open environment. * \return pointer to database handle on success, NULL otherwise. */ void *db_open(void *vhandle, bfpath *bfp, dbmode_t open_mode) { int ret; int is_swapped; int retries = 2; /* how often do we retry to open after ENOENT+EEXIST races? 2 is sufficient unless the kernel or BerkeleyDB are buggy. */ dbe_t *env = vhandle; dbh_t *handle = NULL; uint32_t opt_flags = (open_mode == DS_READ) ? DB_RDONLY : 0; size_t idx; uint32_t retryflags[] = { 0, DB_NOMMAP }; /* * If locking fails with EAGAIN, then try without MMAP, fcntl() * locking may be forbidden on mmapped files, or mmap may not be * available for NFS. Thanks to Piotr Kucharski and Casper Dik, * see news:comp.protocols.nfs and the bogofilter mailing list, * message #1520, Message-ID: <20030206172016.GS1214@sgh.waw.pl> * Date: Thu, 6 Feb 2003 18:20:16 +0100 */ check_db_version(); /* retry when locking failed */ for (idx = 0; idx < COUNTOF(retryflags); idx += 1) { int e; DB *dbp; DB_ENV *dbe; bool err = false; const char *db_file; uint32_t pagesize; uint32_t retryflag = retryflags[idx]; handle = dbh_init(bfp); if (handle == NULL) return NULL; /* create DB handle */ dbe = dsm->dsm_get_env_dbe(env); if ((ret = db_create (&dbp, dbe, 0)) != 0) { print_error(__FILE__, __LINE__, "(db) db_create, err: %d, %s", ret, db_strerror(ret)); goto open_err; } handle->dbp = dbp; handle->dbenv = env; handle->open_mode = open_mode; db_file = dsm->dsm_database_name(handle->name); #ifdef ENABLE_MEMDEBUG if (eTransaction == T_DISABLED) dbp->set_alloc(dbp, md_malloc, md_realloc, md_free); else dbe->set_alloc(dbe, md_malloc, md_realloc, md_free); #endif retry_db_open: handle->created = false; ret = DB_OPEN(dbp, bfp, NULL, dbtype, opt_flags | retryflag, DS_MODE); /* Begin complex change ... */ if (ret != 0) { err = (ret != ENOENT) || (opt_flags == DB_RDONLY); if (!err) { if ( #if DB_EQUAL(4,1) (ret = DB_SET_FLAGS(dbp, DB_CHKSUM_SHA1)) != 0 || #endif #if DB_AT_LEAST(4,2) (ret = DB_SET_FLAGS(dbp, DB_CHKSUM)) != 0 || #endif (ret = DB_OPEN(dbp, bfp, NULL, dbtype, opt_flags | DB_CREATE | DB_EXCL | retryflag, DS_MODE))) err = true; if (!err) handle->created = true; } } if (ret != 0) { if (ret == ENOENT && opt_flags != DB_RDONLY) return NULL; else err = true; } /* End complex change ... */ if (err) { if (open_mode != DB_RDONLY && ret == EEXIST && --retries) { /* sleep for 4 to 100 ms - this is just to give up the CPU * to another process and let it create the data base * file in peace */ rand_sleep(4 * 1000, 100 * 1000); goto retry_db_open; } /* close again and bail out without further tries */ if (DEBUG_DATABASE(0)) print_error(__FILE__, __LINE__, "DB->open(%s) - actually %s, directory %s, err %s", handle->name, db_file, env->directory, db_strerror(ret)); dbp->close(dbp, 0); goto open_err; } /* see if the database byte order differs from that of the cpu's */ #if DB_AT_LEAST(3,3) ret = dbp->get_byteswapped (dbp, &is_swapped); #else ret = 0; is_swapped = dbp->get_byteswapped (dbp); #endif handle->is_swapped = is_swapped ? true : false; if (ret != 0) { print_error(__FILE__, __LINE__, "DB->get_byteswapped: %s", db_strerror(ret)); db_close(handle); return NULL; /* handle already freed, ok to return */ } if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB->get_byteswapped: %s\n", is_swapped ? "true" : "false"); ret = dbp->fd(dbp, &handle->fd); if (ret != 0) { print_error(__FILE__, __LINE__, "DB->fd: %s", db_strerror(ret)); db_close(handle); return NULL; /* handle already freed, ok to return */ } if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB->fd: %d\n", handle->fd); /* query page size */ pagesize = get_psize(dbp, false); if (pagesize == 0xffffffff) { dbp->close(dbp, 0); goto open_err; } if (!pagesize) pagesize = 16384; /* check file size limit */ if (open_mode != DS_READ) { if (!check_fsize_limit(handle->fd, pagesize)) { open_mode = DS_READ; } } /* Begin complex change ... */ e = dsm->dsm_lock(handle, open_mode); if (e == 0) break; if (e != EAGAIN) return NULL; handle = NULL; /* End complex change ... */ } /* for idx over retryflags */ return handle; open_err: handle_free(handle); if (ret >= 0) errno = ret; else errno = EINVAL; return NULL; } int db_delete(void *vhandle, const dbv_t *token) { int ret = 0; dbh_t *handle = vhandle; DB *dbp = handle->dbp; DBT db_key; DBT_init(db_key); assert(handle->magic == MAGIC_DBH); assert((eTransaction == T_DISABLED) == (handle->txn == NULL)); db_key.data = token->data; db_key.size = token->leng; ret = dbp->del(dbp, handle->txn, &db_key, 0); if (ret != 0 && ret != DB_NOTFOUND) { print_error(__FILE__, __LINE__, "DB->del('%.*s'), err: %d, %s", CLAMP_INT_MAX(db_key.size), (const char *) db_key.data, ret, db_strerror(ret)); exit(EX_ERROR); } if (DEBUG_DATABASE(3)) fprintf(dbgout, "DB->del(%.*s)\n", CLAMP_INT_MAX(db_key.size), (const char *) db_key.data); return ret; /* 0 if ok */ } int db_get_dbvalue(void *vhandle, const dbv_t *token, /*@out@*/ dbv_t *val) { int ret = 0; int rmw_flag; DBT db_key; DBT db_data; dbh_t *handle = vhandle; DB *dbp = handle->dbp; assert(handle); assert(handle->magic == MAGIC_DBH); assert((eTransaction == T_DISABLED) == (handle->txn == NULL)); DBT_init(db_key); DBT_init(db_data); db_key.data = token->data; db_key.size = token->leng; db_data.data = val->data; db_data.size = val->leng; /* cur used */ db_data.ulen = val->leng; /* max size */ db_data.flags = DB_DBT_USERMEM; /* saves the memcpy */ /* DB_RMW can avoid deadlocks */ rmw_flag = dsm->dsm_get_rmw_flag(handle->open_mode); ret = dbp->get(dbp, handle->txn, &db_key, &db_data, rmw_flag ); if (DEBUG_DATABASE(3)) fprintf(dbgout, "DB->get(%.*s): %s\n", CLAMP_INT_MAX(token->leng), (char *) token->data, db_strerror(ret)); val->leng = db_data.size; /* read count */ switch (ret) { case 0: break; case DB_NOTFOUND: ret = DS_NOTFOUND; break; case DB_LOCK_DEADLOCK: dsm->dsm_abort(handle); ret = DS_ABORT_RETRY; break; default: print_error(__FILE__, __LINE__, "(db) DB->get(TXN=%lu, '%.*s' ), err: %d, %s", (unsigned long)handle->txn, CLAMP_INT_MAX(token->leng), (char *) token->data, ret, db_strerror(ret)); dsm->dsm_abort(handle); exit(EX_ERROR); } return ret; } int db_set_dbvalue(void *vhandle, const dbv_t *token, const dbv_t *val) { int ret; DBT db_key; DBT db_data; dbh_t *handle = vhandle; DB *dbp = handle->dbp; assert(handle->magic == MAGIC_DBH); assert((eTransaction == T_DISABLED) == (handle->txn == NULL)); DBT_init(db_key); DBT_init(db_data); db_key.data = token->data; db_key.size = token->leng; db_data.data = val->data; db_data.size = val->leng; /* write count */ ret = dbp->put(dbp, handle->txn, &db_key, &db_data, 0); if (ret == DB_LOCK_DEADLOCK) { dsm->dsm_abort(handle); return DS_ABORT_RETRY; } if (ret != 0) { print_error(__FILE__, __LINE__, "db_set_dbvalue( '%.*s' ), err: %d, %s", CLAMP_INT_MAX(token->leng), (char *)token->data, ret, db_strerror(ret)); exit(EX_ERROR); } if (DEBUG_DATABASE(3)) fprintf(dbgout, "DB->put(%.*s): %s\n", CLAMP_INT_MAX(token->leng), (char *) token->data, db_strerror(ret)); return 0; } #if DB_AT_LEAST(4,2) /* get_flags is new in 4.2 */ static uint32_t db_get_flags(DB *dbp, uint32_t test) { int ret; uint32_t flags; uint32_t mask = DB_NOSYNC; ret = dbp->get_flags(dbp, &flags); if (ret) { print_error(__FILE__, __LINE__, "DB->get_flags returned error: %s", db_strerror(ret)); mask = 0; } else { if (flags & test) mask &= ~DB_NOSYNC; } return mask; } #endif /* Close files and clean up. */ void db_close(void *vhandle) { int ret; dbh_t *handle = vhandle; DB *dbp = handle->dbp; /* This is _ONLY_ safe as long as we're logging TXNs */ uint32_t flag = (eTransaction == T_ENABLED) ? DB_NOSYNC : 0; assert(handle->magic == MAGIC_DBH); #ifdef DB_TXN_NOT_DURABLE /* DB_TXN_NOT_DURABLE is new in 4.2 */ flag &= db_get_flags(dbp, DB_TXN_NOT_DURABLE); #endif #ifdef DB_LOG_INMEMORY /* DB_LOG_INMEMORY is new in 4.3 */ flag &= db_get_flags(dbp, DB_LOG_INMEMORY); #endif if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB->close(%s, %s)\n", handle->name, flag & DB_NOSYNC ? "DB_NOSYNC" : "0"); if (handle->txn) { print_error(__FILE__, __LINE__, "db_close called with transaction still open, program fault!"); } ret = dbp->close(dbp, flag); #if DB_AT_LEAST(3,2) && DB_AT_MOST(4,0) /* ignore dirty pages in buffer pool */ if (ret == DB_INCOMPLETE) ret = 0; #endif if (dsm->dsm_sync != NULL) ret = dsm->dsm_sync(handle->dbenv->dbe, ret); if (ret) print_error(__FILE__, __LINE__, "DB->close error: %s", db_strerror(ret)); handle->dbp = NULL; handle_free(handle); } /* flush any data in memory to disk */ void db_flush(void *vhandle) { int ret; dbh_t *handle = vhandle; DB *dbp = handle->dbp; assert(handle->magic == MAGIC_DBH); if (DEBUG_DATABASE(1)) fprintf(dbgout, "db_flush(%s)\n", handle->name); ret = dbp->sync(dbp, 0); #if DB_AT_LEAST(3,2) && DB_AT_MOST(4,0) /* ignore dirty pages in buffer pool */ if (ret == DB_INCOMPLETE) ret = 0; #endif ret = dsm->dsm_sync(handle->dbenv->dbe, ret); if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB->sync(%p): %s\n", (void *)dbp, db_strerror(ret)); if (ret) print_error(__FILE__, __LINE__, "db_sync: err: %d, %s", ret, db_strerror(ret)); dsm->dsm_log_flush(handle->dbenv->dbe); } ex_t db_foreach(void *vhandle, db_foreach_t hook, void *userdata) { dbh_t *handle = vhandle; DB *dbp = handle->dbp; ex_t ret = EX_OK; bool eflag = false; DBC dbc; DBC *dbcp = &dbc; DBT key, data; dbv_t dbv_key, dbv_data; assert(handle->magic == MAGIC_DBH); assert((eTransaction == T_DISABLED) == (handle->txn == NULL)); memset(&key, 0, sizeof(key)); memset(&data, 0, sizeof(data)); ret = dbp->cursor(dbp, handle->txn, &dbcp, 0); if (ret) { print_error(__FILE__, __LINE__, "(cursor): %s", handle->path); return EX_ERROR; } #if DB_AT_LEAST(4,6) for (ret = dbcp->get(dbcp, &key, &data, DB_FIRST); ret == 0; ret = dbcp->get(dbcp, &key, &data, DB_NEXT)) #else for (ret = dbcp->c_get(dbcp, &key, &data, DB_FIRST); ret == 0; ret = dbcp->c_get(dbcp, &key, &data, DB_NEXT)) #endif { int rc; /* Question: Is there a way to avoid using malloc/free? */ /* switch to "dbv_t *" variables */ dbv_key.leng = key.size; dbv_key.data = xmalloc(dbv_key.leng+1); memcpy(dbv_key.data, key.data, dbv_key.leng); ((char *)dbv_key.data)[dbv_key.leng] = '\0'; dbv_data.data = data.data; dbv_data.leng = data.size; /* call user function */ rc = hook(&dbv_key, &dbv_data, userdata); xfree(dbv_key.data); /* returns 0 if ok, 1 if not */ if (rc != 0) break; } switch (ret) { case 0: case DB_NOTFOUND: /* OK */ ret = EX_OK; break; default: print_error(__FILE__, __LINE__, "(c_get): %s", db_strerror(ret)); eflag = true; break; } #if DB_AT_LEAST(4,6) if ((ret = dbcp->close(dbcp))) #else if ((ret = dbcp->c_close(dbcp))) #endif { print_error(__FILE__, __LINE__, "(c_close): %s", db_strerror(ret)); eflag = true; } return eflag ? EX_ERROR : ret; } const char *db_str_err(int e) { return db_strerror(e); } bool is_file_or_missing(const char* path) /*@globals errno,stderr@*/ { int rc; struct stat sb; if (path == NULL || *path == '\0') return false; rc = stat(path, &sb); if (rc == 0) { return S_ISREG(sb.st_mode); } if (errno == ENOENT) return true; return false; } static u_int32_t db_do_getpsize(DB *db) { return get_psize(db, true); } static u_int32_t db_dofile(bfpath *bfp, u_int32_t (*func)(DB *)) { DB_ENV *dbe = NULL; DB *db; int e; u_int32_t s; if (!is_file_or_missing(bfp->filename)) { print_error(__FILE__, __LINE__, "\"%s\" is not a file.", bfp->filename); return 0xffffffff; } dbe = dsm->dsm_recover_open(bfp); e = db_create(&db, dbe, 0); if (e != 0) { print_error(__FILE__, __LINE__, "error creating DB handle: %s", db_strerror(e)); exit(EX_ERROR); } e = DB_OPEN(db, bfp, NULL, dbtype, DB_RDONLY | DB_NOMMAP, DS_MODE); if (e != 0) { print_error(__FILE__, __LINE__, "cannot open database %s: %s", bfp->filename, db_strerror(e)); exit(EX_ERROR); } s = func(db); e = db->close(db, 0); if (e != 0) { print_error(__FILE__, __LINE__, "cannot close database %s: %s", bfp->filename, db_strerror(e)); exit(EX_ERROR); } if (dsm->dsm_common_close) e = dsm->dsm_common_close(dbe, bfp); if (e != 0) { print_error(__FILE__, __LINE__, "cannot close environment %s: %s", bfp->dirname, db_strerror(e)); exit(EX_ERROR); } return s; } u_int32_t db_pagesize(bfpath *bfp) { return db_dofile(bfp, db_do_getpsize); } static u_int32_t db_do_leafpages(DB *dbp) { int ret; u_int32_t c; DB_BTREE_STAT *dbstat = NULL; ret = BF_DB_STAT(dbp, NULL, &dbstat, 0); if (ret) { print_error(__FILE__, __LINE__, "DB->stat"); return 0xffffffff; } c = dbstat->bt_leaf_pg; free(dbstat); return c; } u_int32_t db_leafpages(bfpath *bfp) { return db_dofile(bfp, db_do_leafpages); } ex_t db_verify(bfpath *bfp) { DB_ENV *dbe = NULL; DB *db; int e; assert(bfp->isfile == is_file_or_missing(bfp->filepath)); if (!bfp->isfile) { print_error(__FILE__, __LINE__, "\"%s\" is not a file.", bfp->filename); return EX_ERROR; } dbe = dsm->dsm_recover_open(bfp); e = db_create(&db, NULL, 0); /* need not use environment here, DB->verify() does not lock anyways, we must hold the global lock instead */ if (e != 0) { print_error(__FILE__, __LINE__, "error creating DB handle: %s", db_strerror(e)); exit(EX_ERROR); } e = db->verify(db, bfp->filepath, NULL, NULL, 0); if (e) { print_error(__FILE__, __LINE__, "database %s does not verify: %s", bfp->filename, db_strerror(e)); exit(EX_ERROR); } if (dsm->dsm_common_close) e = dsm->dsm_common_close(dbe, bfp); if (e == 0 && verbose) printf("%s OK.\n", bfp->filename); return e; } bogofilter-1.2.4/src/score.h0000644000175000017500000000125412163572272014122 0ustar sezsez/* $Id: score.h 6777 2009-02-01 03:49:48Z relson $ */ /* constants and declarations for robinson-fisher method */ #ifndef FISHER_H #define FISHER_H #include "wordhash.h" #define MAX_REPEATS 1 /* cap on word frequency per message */ #define GOOD_BIAS 1.0 /* don't give good words more weight */ extern void lookup_words(wordhash_t *wh); extern void score_initialize(void); extern void score_cleanup(void); extern double msg_compute_spamicity(wordhash_t *wordhash) /*@globals errno@*/; extern double msg_spamicity(void); extern rc_t msg_status(void); extern void msg_print_stats(FILE *fp); extern void msg_print_summary(const char *pfx); extern void print_summary(void); #endif bogofilter-1.2.4/src/main.c0000644000175000017500000000126212163572304013721 0ustar sezsez/* $Id: main.c 6246 2005-09-11 12:51:52Z relson $ */ /***************************************************************************** NAME: main.c -- a wrapper for bogomain AUTHOR: Eric S. Raymond ******************************************************************************/ #include "common.h" #include #include "bogomain.h" #include "sighandler.h" const char *progname = "bogofilter"; /* Function Definitions */ int main(int argc, char **argv) /*@globals errno,stderr,stdout@*/ { ex_t exitcode; signal_setup(); /* setup to catch signals */ atexit(bf_exit); exitcode = bogomain(argc, argv); exit(exitcode); } /* End */ bogofilter-1.2.4/src/bogoconfig.c0000644000175000017500000006623212163572304015121 0ustar sezsez/* $Id: bogoconfig.c 6993 2013-06-28 21:54:23Z m-a $ */ /***************************************************************************** NAME: bogoconfig.c -- process config file parameters 2003-02-12 - split out from config.c AUTHOR: David Relson CONTRIBUTORS: David Saez -O option, helps embedding into Exim. ****************************************************************************** The call tree is (roughly): bogoconfig.c process_parameters bogoconfig.c process_arglist(PASS_1_CLI) bogoconfig.c process_arg(PASS_1_CLI) configfile.c process_config_files configfile.c read_config_file configfile.c process_config_option configfile.c process_config_option_as_arg bogoconfig.c process_arg(PASS_2_CFG) bogoconfig.c process_arglist(PASS_2_CLI) bogoconfig.c process_arg(PASS_3_CLI) Note: bogolexer also uses configfile.c. bogolexer.c calls process_config_files(), which calls back to it. ******************************************************************************/ #include "common.h" #include #include #include #include #include "bogoconfig.h" #include "bogofilter.h" #include "bogoreader.h" #include "bool.h" #include "charset.h" #include "datastore.h" #include "datastore_db.h" #include "error.h" #include "find_home.h" #include "format.h" #include "lexer.h" #include "longoptions.h" #include "maint.h" #include "paths.h" #include "score.h" #include "wordlists.h" #include "wordlists_base.h" #include "xatox.h" #include "xmalloc.h" #include "xstrdup.h" #include "xstrlcpy.h" #ifndef DEBUG_CONFIG #define DEBUG_CONFIG(level) (verbose > level) #endif /*---------------------------------------------------------------------------*/ /* Global variables */ char outfname[PATH_LEN] = ""; bool run_classify = false; bool run_register = false; const char *logtag = NULL; /* Local variables and declarations */ static int inv_terse_mode = 0; static void display_tag_array(const char *label, FIELD *array); static void process_arglist(int argc, char **argv, priority_t precedence, int pass); static bool get_parsed_value(char **arg, double *parm); static void comma_parse(char opt, const char *arg, double *parm1, double *parm2, double *parm3); static bool token_count_conflict(void); /*---------------------------------------------------------------------------*/ static struct option longopts_bogofilter[] = { /* longoptions.h - common options */ LONGOPTIONS_COMMON /* longoptions.h - bogofilter */ LONGOPTIONS_MAIN LONGOPTIONS_MAIN_TUNE /* longoptions.h - bogofilter/bogolexer options */ LONGOPTIONS_LEX /* longoptions.h - bogofilter/bogoutil options */ LONGOPTIONS_DB /* bogofilter specific options */ { "classify-files", N, 0, 'B' }, { "syslog-tag", R, 0, 'L' }, { "classify-mbox", N, 0, 'M' }, { "unregister-nonspam", N, 0, 'N' }, { "dataframe", N, 0, 'R' }, { "unregister-spam", N, 0, 'S' }, { "fixed-terse-format", N, 0, 'T' }, { "report-unsure", N, 0, 'U' }, { "classify-stdin", N, 0, 'b' }, { "bogofilter-dir", R, 0, 'd' }, { "nonspam-exits-zero", N, 0, 'e' }, { "use-syslog", N, 0, 'l' }, { "register-ham", N, 0, 'n' }, { "passthrough", N, 0, 'p' }, { "register-spam", N, 0, 's' }, { "update-as-scored", N, 0, 'u' }, { "debug-flags", R, 0, 'x' }, { "debug-to-stdout", N, 0, 'D' }, { "no-header-tags", N, 0, 'H' }, { "query", N, 0, 'Q' }, { "db-cachesize", R, 0, 'k' }, { "ns-esf", R, 0, O_NS_ESF }, { "sp-esf", R, 0, O_SP_ESF }, { "ham-cutoff", R, 0, O_HAM_CUTOFF }, { "header-format", R, 0, O_HEADER_FORMAT }, { "log-header-format", R, 0, O_LOG_HEADER_FORMAT }, { "log-update-format", R, 0, O_LOG_UPDATE_FORMAT }, { "min-dev", R, 0, O_MIN_DEV }, { "robs", R, 0, O_ROBS }, { "robx", R, 0, O_ROBX }, { "spam-cutoff", R, 0, O_SPAM_CUTOFF }, { "spam-header-name", R, 0, O_SPAM_HEADER_NAME }, { "spam-header-place", R, 0, O_SPAM_HEADER_PLACE }, { "spam-subject-tag", R, 0, O_SPAM_SUBJECT_TAG }, { "spamicity-formats", R, 0, O_SPAMICITY_FORMATS }, { "spamicity-tags", R, 0, O_SPAMICITY_TAGS }, { "stats-in-header", R, 0, O_STATS_IN_HEADER }, { "terse", R, 0, O_TERSE }, { "terse-format", R, 0, O_TERSE_FORMAT }, { "thresh-update", R, 0, O_THRESH_UPDATE }, { "timestamp", R, 0, O_TIMESTAMP }, { "unsure-subject-tag", R, 0, O_UNSURE_SUBJECT_TAG }, { "wordlist", R, 0, O_WORDLIST }, /* end of list */ { NULL, 0, 0, 0 } }; /*---------------------------------------------------------------------------*/ static bool get_bool(const char *name, const char *arg) { bool b = str_to_bool(arg); if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> %s\n", name, b ? "Yes" : "No"); return b; } static bool get_double(const char *name, const char *arg, double *d) { remove_comment(arg); if (!xatof(d, arg)) return false; if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> %f\n", name, *d); return true; } static char *get_string(const char *name, const char *arg) { char *s = xstrdup(arg); remove_comment(s); if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> '%s'\n", name, s); return s; } static e_txn get_txn(const char *name, const char *arg) { e_txn t = get_bool(name, arg) ? T_ENABLED : T_DISABLED; if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> %s\n", name, t ? "enabled" : "disabled"); return t; } void process_parameters(int argc, char **argv, bool warn_on_error) { bogotest = 0; verbose = 0; run_type = RUN_UNKNOWN; fpin = stdin; set_today(); /* compute current date for token age */ #ifdef __EMX__ _response (&argc, &argv); /* expand response files (@filename) */ _wildcard (&argc, &argv); /* expand wildcards (*.*) */ #endif process_arglist(argc, argv, PR_COMMAND, PASS_1_CLI); process_config_files(warn_on_error, longopts_bogofilter); process_arglist(argc, argv, PR_COMMAND, PASS_3_CLI); /* directories from command line and config file are already handled */ wordlists_set_bogohome(); stats_prefix= stats_in_header ? " " : "# "; return; } static bool get_parsed_value(char **arg, double *parm) { char *str = *arg; bool ok = true; if (parm && str && *str) { if (*str == ',') str += 1; else { ok = xatof(parm, str); str = strchr(str+1, ','); if (str) str += 1; } *arg = str; } return ok; } static void comma_parse(char opt, const char *arg, double *parm1, double *parm2, double *parm3) { char *parse = xstrdup(arg); char *copy = parse; bool ok = ( get_parsed_value(©, parm1) && get_parsed_value(©, parm2) && get_parsed_value(©, parm3) ); if (!ok) fprintf(stderr, "Cannot parse -%c option argument '%s'.\n", opt, arg); xfree(parse); } static run_t check_run_type(run_t add_type, run_t conflict) { if (run_type & conflict) { (void)fprintf(stderr, "Error: Invalid combination of options.\n"); exit(EX_ERROR); } return (run_type | add_type); } static int validate_args(void) { /* flags '-s', '-n', '-S', and '-N' are mutually exclusive with flags '-p', '-u', '-e', and '-R'. */ run_classify = (run_type & (RUN_NORMAL | RUN_UPDATE)) != 0; run_register = (run_type & (REG_SPAM | REG_GOOD | UNREG_SPAM | UNREG_GOOD)) != 0; if (*outfname && !passthrough) { (void)fprintf(stderr, "Warning: Option -O %s has no effect without -p\n", outfname); } if (run_register && (run_classify || Rtable)) { (void)fprintf(stderr, "Error: Option '-u' may not be used with options '-s', '-n', '-S', or '-N'.\n" ); return EX_ERROR; } return EX_OK; } static const char *help_text[] = { "help options:\n", " -h, --help - print this help message.\n", " -V, --version - print version information and exit.\n", " -Q, --query - query (display) base bogofilter configuration.\n", " -QQ - display extended configuration info.\n", "classification options:\n", " -p, --passthrough - passthrough.\n", " -e, --ham-true - in -p mode, exit with code 0 when the mail is not spam.\n", " -u, --update-as-scored - score message as spam or non-spam and register accordingly.\n", " -M, --classify-mbox - set mailbox mode. Classify multiple messages in an mbox formatted file.\n", " -b, --classify-stdin - set streaming bulk mode. Process multiple messages (files or directories) read from STDIN.\n", " -B, --classify-files=list - set bulk mode. Process multiple messages (files or directories) named on the command line.\n", " -R, --dataframe - print an R data frame.\n", "registration options:\n", " -s, --register-spam - register message(s) as spam.\n", " -n, --register-ham - register message(s) as non-spam.\n", " -S, --unregister-spam - unregister message(s) from spam list.\n", " -N, --unregister-nonspam - unregister message(s) from non-spam list.\n", "general options:\n", " -c, --config-file=file - read specified config file.\n", " -C, --no-config-file - don't read standard config files.\n", " -d, --bogofilter-dir=path - specify directory for wordlists.\n", " -H, --no-header-tags - disables header line tagging.\n", " -k, --db-cachesize=size - set Berkeley DB cache size (MB).\n", " -l, --use-syslog - write messages to syslog.\n", " -L, --syslog-tag=tag - specify the tag value for log messages.\n", " -I, --input-file=file - read message from 'file' instead of stdin.\n", " -O, --output-file=file - save message to 'file' in passthrough mode.\n", "parameter options:\n", " -mv1[,v2[,v3]] - set user defined min_dev, robs, and robx values.\n", " --min-dev=v1, --robs=v2, --robx=v3\n", " -ov1[,v2] - set user defined spam and non-spam cutoff values.\n", " --spam-cutoff=v1, --ham-cutoff=v2\n", "info options:\n", " -t, --terse - set terse output mode.\n", " -T, --fixed-terse-format - set invariant terse output mode.\n", " -q, --quiet - suppress token statistics.\n", " -U, --report-unsure - print statistics if spamicity is 'unsure'.\n", " -v, --verbosity - set debug verbosity level.\n", " -y, --timestamp-date - set date for token timestamps.\n", " -D, --debug-to-stdout - direct debug output to stdout.\n", " -x, --debug-flags=list - set flags to display debug information.\n", "config file options:\n", " --option=value - can be used to set the value of a config file option.\n", " see bogofilter.cf.example for more info.\n", " --block-on-subnets return class addr tokens\n", " --bogofilter-dir directory for wordlists\n", " --charset-default default character set\n", " --db-cachesize Berkeley db cache in Mb\n", #ifdef HAVE_DECL_DB_CREATE " --db-log-autoremove enable/disable autoremoval of log files\n", " --db-transaction enable/disable transactions\n", #ifdef FUTURE_DB_OPTIONS " --db-txn-durable \n", #endif #endif " --ham-cutoff nonspam if score below this\n", " --header-format spam header format\n", " --log-header-format header written to log\n", " --log-update-format logged on update\n", " --min-dev ignore if score near\n", " --min-token-len min len for single tokens\n", " --max-token-len max len for single tokens\n", " --max-multi-token-len max len for multi-word tokens\n", " --multi-token-count number of tokens per multi-word token\n", " --ns-esf effective size factor for ham\n", " --replace-nonascii-characters substitute '?' if bit 8 is 1\n", " --robs Robinson's s parameter\n", " --robx Robinson's x parameter\n", " --sp-esf effective size factor for spam\n", " --spam-cutoff spam if score above this\n", " --spam-header-name passthrough adds/replaces\n", " --spam-subject-tag passthrough prepends Subject\n", " --spamicity-formats spamicity output format\n", " --spamicity-tags spamicity tag format\n", " --stats-in-header use header not body\n", " --terse report in short form\n", " --terse-format short form\n", " --thresh-update no update if near 0 or 1\n", " --timestamp enable/disable token timestamps\n", " --token-count fixed token count for scoring\n", " --token-count-min min token count for scoring\n", " --token-count-max max token count for scoring\n", #ifndef DISABLE_UNICODE " --unicode enable/disable unicode based wordlist\n", #endif " --unsure-subject-tag like spam-subject-tag\n", " --user-config-file configuration file\n", " --wordlist specify wordlist parameters\n", "\n", "bogofilter is a tool for classifying email as spam or non-spam.\n", "\n", "For updates and additional information, see\n", "URL: http://bogofilter.sourceforge.net\n", NULL }; static void help(FILE *fp) { uint i; (void)fprintf(fp, "%s version %s\n" "\n" "Usage: %s [options] < message\n" "\n", progtype, version, PACKAGE ); for (i=0; help_text[i] != NULL; i++) (void)fprintf(fp, "%s", help_text[i]); } static void print_version(void) { (void)fprintf(stdout, "%s version %s\n" " Database: %s\n" "Copyright (C) 2002-2010 David Relson, Matthias Andree\n" "Copyright (C) 2002-2004 Greg Louis\n" "Copyright (C) 2002-2003 Eric S. Raymond, Adrian Otto, Gyepi Sam\n\n" "%s comes with ABSOLUTELY NO WARRANTY. " "This is free software, and\nyou are welcome to " "redistribute it under the General Public License. " "See\nthe COPYING file with the source distribution for " "details.\n" "\n", progtype, version, ds_version_str(), PACKAGE); } #define OPTIONS ":-:bBc:Cd:DehHI:k:lL:m:MnNo:O:pPqQRsStTuUvVx:X:y:" /** These functions process command line arguments. ** ** They are called to perform passes 1 & 2 of command line switch processing. ** The config file is read in between the two function calls. ** ** The functions will exit if there's an error, for example if ** there are leftover command line arguments. */ static void process_arglist(int argc, char **argv, priority_t precedence, int pass) { ex_t exitcode; if (pass != PASS_1_CLI) { optind = opterr = 1; #ifdef __EMX__ optind = 0; #endif /* don't use #ifdef here: */ #if HAVE_DECL_OPTRESET optreset = 1; #endif } while (1) { int option; int option_index = 0; int this_option_optind = optind ? optind : 1; const char *name; option = getopt_long_chk(argc, argv, OPTIONS, longopts_bogofilter, &option_index); if (option == -1) break; name = (option_index == 0) ? argv[this_option_optind] : longopts_bogofilter[option_index].name; #ifdef EXCESSIVE_DEBUG if (getenv("BOGOFILTER_DEBUG_OPTIONS")) { fprintf(stderr, "config: option=%c (%d), optind=%d, opterr=%d, optarg=%s\n", isprint((unsigned char)option) ? option : '_', option, optind, opterr, optarg ? optarg : "(null)"); } #endif process_arg(option, name, optarg, precedence, pass); } if (pass == PASS_1_CLI) { if (run_type == RUN_UNKNOWN) run_type = RUN_NORMAL; } if (pass == PASS_3_CLI) { exitcode = validate_args(); if (exitcode) exit(exitcode); if (bulk_mode == B_NORMAL && optind < argc) { fprintf(stderr, "Extra arguments given, first: %s. Aborting.\n", argv[optind]); exit(EX_ERROR); } if (inv_terse_mode) { verbose = max(1, verbose); /* force printing */ set_terse_mode_format(inv_terse_mode); } if (token_count_conflict()) { fprintf(stderr, "Conflicting token count arguments given.\n"); exit(EX_ERROR); } } return; } int process_arg(int option, const char *name, const char *val, priority_t precedence, arg_pass_t pass) { switch (option) { case '?': if (pass == PASS_1_CLI) fprintf(stderr, "Unknown option '%s'.\n", name); break; case 'b': bulk_mode = B_STDIN; fpin = NULL; /* Ensure that input file isn't stdin */ break; case 'B': bulk_mode = B_CMDLINE; break; case 'c': case O_CONFIG_FILE: if (pass == PASS_1_CLI) { if (!read_config_file(val, false, !quiet, PR_CFG_USER, longopts_bogofilter)) { fprintf(stderr, "Cannot open %s: %s\n", val, strerror(errno)); exit(EX_ERROR); } } /*@fallthrough@*/ /* fall through to suppress reading config files */ case 'C': if (pass == PASS_1_CLI) suppress_config_file = true; break; case O_USER_CONFIG_FILE: user_config_file = get_string(name, val); break; case 'D': dbgout = stdout; break; case 'e': case O_HAM_TRUE: nonspam_exits_zero = true; break; case 'h': help(stdout); exit(EX_OK); case 'I': if (pass == PASS_1_CLI) bogoreader_name(val); break; case 'L': logtag = xstrdup(val); /*@fallthrough@*/ case 'l': logflag = true; break; case 'M': mbox_mode = true; break; case 'n': run_type = check_run_type(REG_GOOD, REG_SPAM | UNREG_GOOD); break; case 'N': run_type = check_run_type(UNREG_GOOD, REG_GOOD | UNREG_SPAM); break; case 'O': if (pass == PASS_1_CLI) xstrlcpy(outfname, val, sizeof(outfname)); break; case 'p': passthrough = true; break; case 'q': quiet = true; break; case 'Q': if (pass == PASS_1_CLI) query += 1; break; case 'R': Rtable = true; break; case 's': run_type = check_run_type(REG_SPAM, REG_GOOD | UNREG_SPAM); break; case 'S': run_type = check_run_type(UNREG_SPAM, REG_SPAM | UNREG_GOOD); break; case 'u': run_type |= RUN_UPDATE; break; case 'U': unsure_stats = (val == NULL) ? true : get_bool(name, val); break; case 'v': if (pass == PASS_1_CLI) verbose++; break; case 'x': set_debug_mask( val ); break; case 'X': set_bogotest( val ); break; case 'y': /* date as YYYYMMDD */ { const char *str = val ? val : optarg; YYYYMMDD date = string_to_date(str); if (date != 0 && date < 19990000) { fprintf(stderr, "Date format for '-y' option is YYYYMMDD\n"); exit(EX_ERROR); } set_date( date ); break; } case ':': fprintf(stderr, "Option %s requires an argument.\n", name); exit(EX_ERROR); case '-': if (pass == PASS_3_CLI) process_config_option(val, true, precedence, longopts_bogofilter); break; case 'd': if (pass != PASS_1_CLI) set_wordlist_dir(val, precedence); break; case O_NS_ESF: if (pass != PASS_1_CLI) get_double(name, val, &ns_esf); break; case O_SP_ESF: if (pass != PASS_1_CLI) get_double(name, val, &sp_esf); break; case 'H': header_line_markup = (val == NULL) ? false : get_bool(name, val); break; case 'k': db_cachesize=atoi(val); break; case 'm': if (pass != PASS_1_CLI) { comma_parse(option, val, &min_dev, &robs, &robx); if (DEBUG_CONFIG(1)) fprintf(dbgout, "md %6.4f, rs %6.4f, rx %6.4f\n", min_dev, robs, robx); } break; case O_MIN_DEV: if (pass != PASS_1_CLI) get_double(name, val, &min_dev); break; case O_ROBS: if (pass != PASS_1_CLI) get_double(name, val, &robs); break; case O_ROBX: if (pass != PASS_1_CLI) get_double(name, val, &robx); break; case 'o': if (pass != PASS_1_CLI) { comma_parse(option, val, &spam_cutoff, &ham_cutoff, NULL); if (DEBUG_CONFIG(1)) fprintf(dbgout, "sc %6.4f, hc %6.4f\n", spam_cutoff, ham_cutoff); } break; case O_SPAM_CUTOFF: if (pass != PASS_1_CLI) get_double(name, val, &spam_cutoff); break; case O_HAM_CUTOFF: if (pass != PASS_1_CLI) get_double(name, val, &ham_cutoff); break; case 't': terse = true; break; case 'T': /* invariant terse mode */ terse = true; if (pass == PASS_1_CLI) inv_terse_mode += 1; break; case 'V': print_version(); exit(EX_OK); case O_BLOCK_ON_SUBNETS: block_on_subnets = get_bool(name, val); break; case O_CHARSET_DEFAULT: charset_default = get_string(name, val); break; case O_HEADER_FORMAT: header_format = get_string(name, val); break; case O_LOG_HEADER_FORMAT: log_header_format = get_string(name, val); break; case O_LOG_UPDATE_FORMAT: log_update_format = get_string(name, val); break; case O_MAX_TOKEN_LEN: max_token_len=atoi(val); break; case O_MIN_TOKEN_LEN: min_token_len=atoi(val); break; case O_MAX_MULTI_TOKEN_LEN: max_multi_token_len=atoi(val); break; case O_MULTI_TOKEN_COUNT: multi_token_count=atoi(val); break; case O_REPLACE_NONASCII_CHARACTERS: replace_nonascii_characters = get_bool(name, val); break; case O_SPAMICITY_FORMATS: set_spamicity_formats(val); break; case O_SPAMICITY_TAGS: set_spamicity_tags(val); break; case O_SPAM_HEADER_NAME: spam_header_name = get_string(name, val); break; case O_SPAM_HEADER_PLACE: spam_header_place = get_string(name, val); break; case O_SPAM_SUBJECT_TAG: spam_subject_tag = get_string(name, val); break; case O_STATS_IN_HEADER: stats_in_header = get_bool(name, val); break; case O_TERSE: terse = get_bool(name, val); break; case O_TERSE_FORMAT: terse_format = get_string(name, val); break; case O_THRESH_UPDATE: get_double(name, val, &thresh_update); break; case O_TIMESTAMP: timestamp_tokens = get_bool(name, val); break; case O_TOKEN_COUNT_FIX: token_count_fix = atoi(val); break; case O_TOKEN_COUNT_MIN: token_count_min = atoi(val); break; case O_TOKEN_COUNT_MAX: token_count_max = atoi(val); break; case O_UNSURE_SUBJECT_TAG: unsure_subject_tag = get_string(name, val); break; case O_UNICODE: encoding = get_bool(name, val) ? E_UNICODE : E_RAW; break; case O_WORDLIST: configure_wordlist(val); break; case O_DB_TRANSACTION: eTransaction = get_txn(name, val); break; default: #ifndef DISABLE_TRANSACTIONS if (!dsm_options_bogofilter(option, name, val)) #endif { fprintf(stderr, "Invalid option '%s'.\n", name); exit(EX_ERROR); } } return 0; } #define Q1 if (query >= 1) #define Q2 if (query >= 2) #define Q3 if (query >= 3) #define YN(b) (b ? "Yes" : "No") #define NB(b) ((b != NULL && *b != '\0') ? b : "''") rc_t query_config(void) { Q1 fprintf(stdout, "# %s version %s\n", progname, version); Q1 fprintf(stdout, "\n"); Q1 fprintf(stdout, "%-11s = %0.6f # (%8.2e)\n", "robx", robx, robx); Q1 fprintf(stdout, "%-11s = %0.6f # (%8.2e)\n", "robs", robs, robs); Q1 fprintf(stdout, "%-11s = %0.6f # (%8.2e)\n", "min_dev", min_dev, min_dev); Q1 fprintf(stdout, "%-11s = %0.6f # (%8.2e)\n", "ham_cutoff", ham_cutoff, ham_cutoff); Q1 fprintf(stdout, "%-11s = %0.6f # (%8.2e)\n", "spam_cutoff", spam_cutoff, spam_cutoff); Q1 fprintf(stdout, "%-11s = %0.6f # (%8.2e)\n", "ns_esf", ns_esf, ns_esf); Q1 fprintf(stdout, "%-11s = %0.6f # (%8.2e)\n", "sp_esf", sp_esf, sp_esf); Q1 fprintf(stdout, "\n"); Q3 fprintf(stdout, "%-17s = %d\n", "token-count", token_count_fix); Q3 fprintf(stdout, "%-17s = %d\n", "token-count-min", token_count_min); Q3 fprintf(stdout, "%-17s = %d\n", "token-count-max", token_count_max); Q3 fprintf(stdout, "\n"); Q1 fprintf(stdout, "%-17s = %s\n", "block-on-subnets", YN(block_on_subnets)); Q1 fprintf(stdout, "%-17s = %s\n", "encoding", (encoding != E_UNICODE) ? "raw" : "utf-8"); Q1 fprintf(stdout, "%-17s = %s\n", "charset-default", charset_default); Q1 fprintf(stdout, "%-17s = %s\n", "replace-nonascii-characters", YN(replace_nonascii_characters)); Q2 fprintf(stdout, "%-17s = %s\n", "no-header-tags", YN(header_line_markup)); Q1 fprintf(stdout, "%-17s = %s\n", "stats-in-header", YN(stats_in_header)); Q2 fprintf(stdout, "%-17s = %s\n", "report-unsure", YN(unsure_stats)); Q1 fprintf(stdout, "%-17s = %0.6f\n", "thresh-update", thresh_update); Q1 fprintf(stdout, "%-17s = %s\n", "timestamp", YN(timestamp_tokens)); Q2 fprintf(stdout, "%-17s = %ld\n", "timestamp-date", (long int)today); Q1 fprintf(stdout, "\n"); Q1 fprintf(stdout, "%-17s = %s\n", "spam-header-name", spam_header_name); Q1 fprintf(stdout, "%-17s = %s\n", "spam-header-place", NB(spam_header_place)); Q1 fprintf(stdout, "%-17s = %s\n", "spam-subject-tag", NB(spam_subject_tag)); Q1 fprintf(stdout, "%-17s = %s\n", "unsure-subject-tag", NB(unsure_subject_tag)); Q2 fprintf(stdout, "%-18s = %s\n", "syslog-tag", NB(logtag)); Q1 fprintf(stdout, "%-17s = %s\n", "header-format", header_format); Q1 fprintf(stdout, "%-17s = %s\n", "terse-format", terse_format); Q1 fprintf(stdout, "%-17s = %s\n", "log-header-format", log_header_format); Q1 fprintf(stdout, "%-17s = %s\n", "log-update-format", log_update_format); Q1 display_tag_array("spamicity-tags ", spamicity_tags); Q1 display_tag_array("spamicity-formats", spamicity_formats); Q2 fprintf(stdout, "\n"); Q2 fprintf(stdout, "%-18s = %s\n", "no-config-file", YN(suppress_config_file)); Q2 fprintf(stdout, "%-18s = %s\n", "config-file", NB(config_file_name)); Q2 fprintf(stdout, "%-18s = %s\n", "user-config-file", NB(user_config_file)); Q2 fprintf(stdout, "\n"); Q2 fprintf(stdout, "%-18s = %s\n", "bogofilter-dir", bogohome); Q2 display_wordlists(word_lists, "%-18s "); Q2 fprintf(stdout, "\n"); #ifndef DISABLE_TRANSACTIONS Q2 fprintf(stdout, "%-18s = %lu\n", "db-cachesize", (unsigned long)db_cachesize); #ifdef ENABLE_TRANSACTIONS #ifdef HAVE_DECL_DB_CREATE Q2 fprintf(stdout, "%-18s = %s\n", "db-log-autoremove", YN(db_log_autoremove)); #ifdef FUTURE_DB_OPTIONS Q2 fprintf(stdout, "%-18s = %s\n", "db-log-txn-durable", YN(db_txn_durable)); #endif #endif #endif #endif return RC_OK; } static void display_tag_array(const char *label, FIELD *array) { int i; int count = (ham_cutoff < EPS) ? 2 : 3; fprintf(stdout, "%s =", label); for (i = 0; i < count; i += 1) fprintf(stdout, "%s %s", (i == 0) ? "" : ",", array[i]); fprintf(stdout, "\n"); } static bool token_count_conflict(void) { if (token_count_fix != 0) { if (token_count_fix < token_count_min) return true; } if (token_count_max != 0) { if (token_count_max < token_count_min) return true; if (token_count_max < token_count_fix) return true; } return false; } bogofilter-1.2.4/src/convert_charset.c0000644000175000017500000004154712163572304016200 0ustar sezsez/* $Id: convert_charset.c 6017 2005-05-31 15:18:40Z m-a $ */ /***************************************************************************** NAME: charset.c -- provide charset support for bogofilter's lexer. Note: Character translation is done to make life easier for the lexer. Text is changed only after the message has been saved for passthrough. The end user (mail reader) never sees any changes - only the lexer. AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include "charset.h" #include "convert_charset.h" #include "xmalloc.h" #include "xstrdup.h" #define SP ' ' static void map_default(void); static void map_us_ascii(void); static void map_iso_8859_1(void); static void map_iso_8859_2(void); static void map_iso_8859_3(void); static void map_iso_8859_4(void); #ifndef CP866 static void map_iso_8859_5(void); #endif static void map_iso_8859_6(void); static void map_iso_8859_7(void); static void map_iso_8859_8(void); static void map_iso_8859_9(void); static void map_iso_8859_10(void); static void map_iso_8859_13(void); static void map_iso_8859_14(void); static void map_iso_8859_15(void); static void map_unicode(void); #ifndef CP866 static void map_windows_1251_to_koi8r(void); #else static void map_windows_1251_to_cp866(void); static void map_koi8_r_to_cp866(void); static void map_iso_8859_5_to_cp866(void); #endif static void map_windows_1252(void); static void map_windows_1256(void); static void map_nonascii_characters(void); #define DEBUG #undef DEBUG #ifndef DEBUG #define PRINT_CHARSET_TABLE #else #define PRINT_CHARSET_TABLE print_charset_table() #undef DEBUG_GENERAL #define DEBUG_GENERAL(level) (verbose >= level) #endif #ifdef DEBUG static void print_charset_table(void) { int c,r,i; char ch; if (!DEBUG_GENERAL(1)) return; printf( "\n" ); for (r=0; r<4; r+=1) { for (c=0; c<64; c+=1) { i=r*64+c; ch=charset_table[i]; if (ch != 0x08 && ch != 0x09 && ch != '\n' && ch != '\r') printf(" %02X.%2c.%02X", i, ch, ch); else printf(" %02X.%02X.%02X", i, ch, ch); if ((c & 15) == 15) printf( "\n" ); } } printf( "\n" ); } #endif static void map_nonascii_characters(void) { uint ch; for (ch = 0; ch < COUNTOF(charset_table); ch += 1) { /* convert high-bit characters to '?' */ if (ch & 0x80 && casefold_table[ch] == ch) casefold_table[ch] = '?'; } } static void map_xlate_characters(unsigned char *xlate, uint size) { uint i; for (i = 0; i < size; i += 2) { byte from = xlate[i]; byte to = xlate[i+1]; charset_table[from] = to; } } static void map_default(void) { unsigned int ch; for (ch = 0; ch < COUNTOF(charset_table); ch += 1) { charset_table[ch] = casefold_table[ch] = ch; } PRINT_CHARSET_TABLE; for (ch=0; ch < COUNTOF(charset_table); ch += 1) { if (iscntrl(ch) && /* convert control characters to blanks */ ch != '\t' && ch != '\n') /* except tabs and newlines */ charset_table[ch] = SP; } PRINT_CHARSET_TABLE; } static void map_iso_8859_1(void) /* ISOIEC 8859-1:1998 Latin Alphabet No. 1 */ { /* Not yet implemented */ } static void map_iso_8859_2(void) /* ISOIEC 8859-2:1999 Latin Alphabet No. 2 */ { /* Not yet implemented */ } static void map_iso_8859_3(void) /* ISOIEC 8859-3:1999 Latin Alphabet No. 3 */ { /* Not yet implemented */ } static void map_iso_8859_4(void) /* ISOIEC 8859-4:1998 Latin Alphabet No. 4 */ { /* Not yet implemented */ } #ifndef CP866 static void map_iso_8859_5(void) /* ISOIEC 8859-5:1999 LatinCyrillic Alphabet */ { /* Not yet implemented */ } #endif static void map_iso_8859_6(void) /* ISOIEC 8859-6:1999 LatinArabic Alphabet */ { /* Not yet implemented */ } static void map_iso_8859_7(void) /* ISO 8859-7:1987 LatinGreek Alphabet */ { /* Not yet implemented */ } static void map_iso_8859_8(void) /* ISOIEC 8859-8:1999 LatinHebrew Alphabet */ { /* Not yet implemented */ } static void map_iso_8859_9(void) /* ISOIEC 8859-9:1999 Latin Alphabet No. 5 */ { /* Not yet implemented */ } static void map_iso_8859_10(void) /* ISOIEC 8859-10:1998 Latin Alphabet No. 6 */ { /* Not yet implemented */ } static void map_iso_8859_13(void) /* ISOIEC 8859-13:1998 Latin Alphabet No. 7 (Baltic Rim) */ { /* Not yet implemented */ } static void map_iso_8859_14(void) /* ISOIEC 8859-14:1998 Latin Alphabet No. 8 (Celtic) */ { /* Not yet implemented */ } static void map_iso_8859_15(void) /* ISOIEC 8859-15:1999 Latin Alphabet No. 9 */ { static unsigned char xlate_15[] = { 0xA0, ' ', /* A0 160 160 NO-BREAK SPACE */ 0xA1, '!', /* A1 161 ¡ 161 INVERTED EXCLAMATION MARK */ 0xA2, '$', /* A2 162 ¢ 162 CENT SIGN */ 0xA3, '$', /* A3 163 £ 163 POUND SIGN */ 0xA4, '$', /* A4 164 EUR 8364 EURO SIGN */ 0xA5, '$', /* A5 165 ¥ 165 YEN SIGN */ 0xA7, ' ', /* A7 167 § 167 SECTION SIGN */ 0xA9, ' ', /* A9 169 © 169 COPYRIGHT SIGN */ 0xAA, ' ', /* AA 170 ª 170 FEMININE ORDINAL INDICATOR */ 0xAB, '\"', /* AB 171 « 171 LEFT-POINTING DOUBLE ANGLE QUOTATION MARK */ 0xAC, ' ', /* AC 172 ¬ 172 NOT SIGN */ 0xAD, ' ', /* AD 173 173 SOFT HYPHEN */ 0xAE, ' ', /* AE 174 ® 174 REGISTERED SIGN */ 0xAF, ' ', /* AF 175 ¯ 175 MACRON */ 0xB0, ' ', /* B0 176 ° 176 DEGREE SIGN */ 0xB1, ' ', /* B1 177 ± 177 PLUS-MINUS SIGN */ 0xB2, ' ', /* B2 178 ² 178 SUPERSCRIPT TWO */ 0xB3, ' ', /* B3 179 ³ 179 SUPERSCRIPT THREE */ 0xB5, ' ', /* B5 181 µ 181 MICRO SIGN */ 0xB6, ' ', /* B6 182 ¶ 182 PILCROW SIGN */ 0xB7, ' ', /* B7 183 · 183 MIDDLE DOT */ 0xB9, ' ', /* B9 185 ¹ 185 SUPERSCRIPT ONE */ 0xBA, ' ', /* BA 186 º 186 MASCULINE ORDINAL INDICATOR */ 0xBB, '\"', /* BB 187 » 187 RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK */ 0xBC, ' ', /* BC 188 OE 338 LATIN CAPITAL LIGATURE OE */ 0xBD, ' ', /* BD 189 oe 339 LATIN SMALL LIGATURE OE */ 0xBF, '?', /* BF 191 ¿ 191 INVERTED QUESTION MARK */ 0xD7, '*', /* D7 215 × 215 MULTIPLICATION SIGN */ 0xF7, '/', /* F7 247 ÷ 247 DIVISION SIGN */ }; map_xlate_characters( xlate_15, COUNTOF(xlate_15) ); /* Not yet implemented */ } /* For us-ascii, first do the iso-8859-1 setup then add special ** characters. */ static void map_us_ascii(void) { static unsigned char xlate_us[] = { 0xA0, ' ', /* no-break space to space */ 0x92, '\'', /* windows apostrophe to single quote */ 0x93, '"', /* windows left quote to double quote */ 0x94, '"', /* windows right quote to double quote */ 0xA9, ' ', /* copyright sign to space */ 0xAE, ' ', /* registered sign to space */ }; map_iso_8859_1(); map_xlate_characters( xlate_us, COUNTOF(xlate_us) ); } static void map_unicode(void) { /* Not yet implemented */ } #ifndef CP866 static void map_windows_1251_to_koi8r(void) { /* Map: windows-1251 -> KOI8-R (Cyrillic) */ /* Contributed by: Yar Tikhiy (yarq@users.sourceforge.net) */ static byte xlate_1251[] = { 0xA8, 0xB3, 0xB8, 0xA3, 0xE0, 0xC1, 0xE1, 0xC2, 0xE2, 0xD7, 0xE3, 0xC7, 0xE4, 0xC4, 0xE5, 0xC5, 0xE6, 0xD6, 0xE7, 0xDA, 0xE8, 0xC9, 0xE9, 0xCA, 0xEA, 0xCB, 0xEB, 0xCC, 0xEC, 0xCD, 0xED, 0xCE, 0xEE, 0xCF, 0xEF, 0xD0, 0xF0, 0xD2, 0xF1, 0xD3, 0xF2, 0xD4, 0xF3, 0xD5, 0xF4, 0xC6, 0xF5, 0xC8, 0xF6, 0xC3, 0xF7, 0xDE, 0xF8, 0xDB, 0xF9, 0xDD, 0xFA, 0xDF, 0xFB, 0xD9, 0xFC, 0xD8, 0xFD, 0xDC, 0xFE, 0xC0, 0xFF, 0xD1, 0xC0, 0xE1, 0xC1, 0xE2, 0xC2, 0xF7, 0xC3, 0xE7, 0xC4, 0xE4, 0xC5, 0xE5, 0xC6, 0xF6, 0xC7, 0xFA, 0xC8, 0xE9, 0xC9, 0xEA, 0xCA, 0xEB, 0xCB, 0xEC, 0xCC, 0xED, 0xCD, 0xEE, 0xCE, 0xEF, 0xCF, 0xF0, 0xD0, 0xF2, 0xD1, 0xF3, 0xD2, 0xF4, 0xD3, 0xF5, 0xD4, 0xE6, 0xD5, 0xE8, 0xD6, 0xE3, 0xD7, 0xFE, 0xD8, 0xFB, 0xD9, 0xFD, 0xDA, 0xFF, 0xDB, 0xF9, 0xDC, 0xF8, 0xDD, 0xFC, 0xDE, 0xE0, 0xDF, 0xF1, }; map_xlate_characters( xlate_1251, COUNTOF(xlate_1251) ); } #endif #ifdef CP866 static void map_windows_1251_to_cp866(void) { static byte cp1251_to_cp866[] = { /*Win-CP1251*/ 192, '€', 208, '', 224, ' ', 240, 'à', 193, '', 209, '‘', 225, '¡', 241, 'á', 194, '‚', 210, '’', 226, '¢', 242, 'â', 195, 'ƒ', 211, '“', 227, '£', 243, 'ã', 196, '„', 212, '”', 228, '¤', 244, 'ä', 197, '…', 213, '•', 229, '¥', 245, 'å', 198, '†', 214, '–', 230, '¦', 246, 'æ', 151 , 'Ä',199,'‡', 215 , '—', 231, '§', 247, 'ç', 168 , 'ð',184, 'ñ', 200 , 'ˆ', 216, '˜', 232, '¨', 248, 'è', /*; ᨬ¢®« 169 = (á)/255 ¢ ¤®á */ 169, 255, 201, '‰', 217 , '™', 233, '©', 249, 'é', 202, 'Š', 218 , 'š', 234, 'ª', 250, 'ê', 203, '‹', 219 , '›', 235, '«', 251, 'ë', 204, 'Œ', 220 , 'œ', 236, '¬', 252, 'ì', 205, '', 221 , '', 237, '­', 253, 'í', 206, 'Ž', 222 , 'ž', 238, '®', 254, 'î', 207, '', 223 , 'Ÿ', 239, '¯', 255, 'ï' }; map_xlate_characters( cp1251_to_cp866, COUNTOF(cp1251_to_cp866) ); } #endif #ifdef CP866 static void map_koi8_r_to_cp866(void) { /* KOI8-R ¯® —¥p­®¢ã KOI8-R [CODEPAGE] */ static byte koi8_r_to_cp866[] = { 128, 'Ä', 144, '°', 160, 'Í', 176, 'Ç', 192, 'î', 208, '¯', 224, 'ž', 240, '', 129, '³', 145, '±', 161, 'º', 177, 'Ì', 193, ' ', 209, 'ï', 225, '€', 241, 'Ÿ', 130, 'Ú', 146, '² ', 162, 'Õ', 178, 'µ', 194, '¡', 210, 'à', 226, '', 242, '', 131, '¿', 147, 'ô', 163, 'ñ', 179, 'ð', 195, 'æ', 211, 'á', 227, '–', 243, '‘', 132, 'À', 148, 'þ', 164, 'Ö', 180, '¶', 196, '¤', 212, 'â', 228, '„', 244, '’', 133, 'Ù', 149, 'ú', 165, 'É', 181, '¹', 197, '¥', 213, 'ã', 229, '…', 245, '“', 134, 'Ã', 150, 'û', 166, '¸', 182, 'Ñ', 198, 'ä', 214, '¦', 230, '”', 246, '†', 135, '´', 151, '÷', 167, '·', 183, 'Ò', 199, '£', 215, '¢', 231, 'ƒ', 247, '‚', 136, 'Â', 152, 'ó', 168, '»', 184, 'Ë', 200, 'å', 216, 'ì', 232, '•', 248, 'œ', 137, 'Á', 153, 'ò', 169, 'Ô', 185, 'Ï', 201, '¨', 217, 'ë', 233, 'ˆ', 249, '›', 138, 'Å', 154, 'ü', 170, 'Ó', 186, 'Ð', 202, '©', 218, '§', 234, '‰', 250, '‡', 139, 'ß', 155, 'õ', 171, 'È', 187, 'Ê', 203, 'ª', 219, 'è', 235, 'Š', 251, '˜', 140, 'Ü', 156, 'ø', 172, '¾', 188, 'Ø', 204, '«', 220, 'í', 236, '‹', 252, '', 141, 'Û', 157, 'ý', 173, '½', 189, '×', 205, '¬', 221, 'é', 237, 'Œ', 253, '™', 142, 'Ý', 158, 'ù', 174, '¼', 190, 'Î', 206, '­', 222, 'ç', 238, '', 254, '—', 143, 'Þ', 159, 'ö', 175, 'Æ', 191, 255, 207, '®', 223, 'ê', 239, 'Ž', 255, 'š' }; /* ᨬ¢®« 191 = (á)/255 ¢ ¤®á */ map_xlate_characters( koi8_r_to_cp866, COUNTOF( koi8_r_to_cp866) ); } #endif #ifdef CP866 static void map_iso_8859_5_to_cp866(void) { static byte iso_8859_5_to_cp866[] = { 160, 255, 176, '€', 192, '', 208, ' ', 224, 'à', 161, 'ð', 177, '', 193, '‘', 209, '¡', 225, 'á', 241, 'ñ', 178, '‚', 194, '’', 210, '¢', 226, 'â', 179, 'ƒ', 195, '“', 211, '£', 227, 'ã', 164, 'ò', 180, '„', 196, '”', 212, '¤', 228, 'ä', 244, 'ó', 181, '…', 197, '•', 213, '¥', 229, 'å', 182, '†', 198, '–', 214, '¦', 230, 'æ', 167, 'ô', 183, '‡', 199, '—', 215, '§', 231, 'ç', 247, 'õ', 184, 'ˆ', 200, '˜', 216, '¨', 232, 'è', 185, '‰', 201, '™', 217, '©', 233, 'é', 186, 'Š', 202, 'š', 218, 'ª', 234, 'ê', 187, '‹', 203, '›', 219, '«', 235, 'ë', 188, 'Œ', 204, 'œ', 220, '¬', 236, 'ì', 173, 'Ä', 189, '', 205, '', 221, '­', 237, 'í', 174, 'ö', 190, 'Ž', 206, 'ž', 222, '®', 238, 'î', 254, '÷', 191, '', 207, 'Ÿ', 223, '¯', 239, 'ï' }; /* ᨬ¢®« 160 = (á)/255 ¢ ¤®á */ map_xlate_characters( iso_8859_5_to_cp866, COUNTOF(iso_8859_5_to_cp866) ); } #endif #ifdef CP866 static void map_cp866(void) { } #endif static void map_windows_1252(void) { /* Not yet implemented */ } static void map_windows_1256(void) { /* Not yet implemented */ } static void map_chinese(void) { /* Not yet implemented */ } static void map_korean(void) { /* Not yet implemented */ } static void map_japanese(void) { /* Not yet implemented */ } typedef void (*charset_fcn) (void); typedef struct charset_def { const char *name; charset_fcn func; bool allow_nonascii_replacement; } charset_def_t; #define T true #define F false static charset_def_t charsets[] = { { "default", &map_default, T }, { "us-ascii", &map_us_ascii, T }, #ifdef CP866 { "cp866", &map_windows_1251_to_cp866, F },/* selected by 'charset_default=cp866' in bogofilter.cf */ #endif { "iso8859-1", &map_iso_8859_1, T }, /* ISOIEC 8859-1:1998 Latin Alphabet No. 1 */ /* tests/t.systest.d/inputs/spam.mbx is iso-8859-1 and contains 8-bit characters - " “Your Account” " */ { "iso8859-2", &map_iso_8859_2, F }, /* ISOIEC 8859-2:1999 Latin Alphabet No. 2 */ { "iso8859-3", &map_iso_8859_3, F }, /* ISOIEC 8859-3:1999 Latin Alphabet No. 3 */ { "iso8859-4", &map_iso_8859_4, F }, /* ISOIEC 8859-4:1998 Latin Alphabet No. 4 */ #ifndef CP866 { "iso8859-5", &map_iso_8859_5, F }, /* ISOIEC 8859-5:1999 LatinCyrillic Alphabet */ #else { "iso8859-5", &map_iso_8859_5_to_cp866, F }, /* ISOIEC 8859-5:1999 LatinCyrillic Alphabet */ #endif { "iso8859-6", &map_iso_8859_6, F }, /* ISOIEC 8859-6:1999 LatinArabic Alphabet */ { "iso8859-7", &map_iso_8859_7, F }, /* ISO 8859-7:1987 LatinGreek Alphabet */ { "iso8859-8", &map_iso_8859_8, F }, /* ISOIEC 8859-8:1999 LatinHebrew Alphabet */ { "iso8859-9", &map_iso_8859_9, F }, /* ISOIEC 8859-9:1999 Latin Alphabet No. 5 */ { "iso8859-10", &map_iso_8859_10, F }, /* ISOIEC 8859-10:1998 Latin Alphabet No. 6 */ { "iso8859-13", &map_iso_8859_13, F }, /* ISOIEC 8859-13:1998 Latin Alphabet No. 7 (Baltic Rim)*/ { "iso8859-14", &map_iso_8859_14, F }, /* ISOIEC 8859-14:1998 Latin Alphabet No. 8 (Celtic) */ { "iso8859-15", &map_iso_8859_15, F }, /* ISOIEC 8859-15:1999 Latin Alphabet No. 9 */ #ifndef CP866 { "windows-1251", &map_windows_1251_to_koi8r, F }, #else { "cp866", &map_cp866, F }, { "koi8-r", &map_koi8_r_to_cp866, F }, { "windows-1251", &map_windows_1251_to_cp866, F }, #endif { "windows-1252", &map_windows_1252, T }, { "windows-1256", &map_windows_1256, T }, { "utf-8", &map_unicode, T }, { "iso2022-jp", &map_japanese, T }, /* rfc-1468 - japanese */ { "euc-kr", &map_korean, T }, /* extended unix code for korean */ { "iso2022-kr", &map_korean, T }, /* korean standard code (7-bit)*/ { "ks-c-5601-1987", &map_korean, T }, /* korean standard (default) */ { "big5", &map_chinese, T }, { "csbig5", &map_chinese, T }, { "gb2312", &map_chinese, T }, { "csgb2312", &map_chinese, T }, }; #define MAX_LEN 64 void init_charset_table_orig(const char *charset_name) { uint idx; bool found = false; for (idx = 0; idx < COUNTOF(charsets); idx += 1) { charset_def_t *charset = &charsets[idx]; if (strcasecmp(charset->name, charset_name) == 0) { if (DEBUG_CONFIG(1)) fprintf(dbgout, " ... found.\n"); map_default(); /* Setup the table defaults. */ (*charset->func)(); found = true; if (replace_nonascii_characters && charset->allow_nonascii_replacement) map_nonascii_characters(); break; } } if ( !found ) { map_default(); if (DEBUG_CONFIG(0)) fprintf(dbgout, "Unknown charset '%s'; using default.\n", charset_name ); } return; } #ifdef CP866 int decode_and_htmlUNICODE_to_cp866(byte *buf, int len) { int i,j, j1, l; bool is = false; byte code = 0; byte *pbuf, str[40]; int l1; const int max_seq_length = 8; /* Ӓ ý */ l1 = 0; pbuf = buf; for (i=0;i < len;i++) { pbuf[l1] = charset_table[buf[i]]; /* should be decode table to the same cp as UnicodeTable */ l1++; if (buf[i] != '&') /* check for &-sequences */ continue; if (buf[i+1] != '#') /* " " ? */ { is = false; for (j=0, l=1; i+l max_seq_length) break; str[j] = buf[l+i]; if (buf[l+i] == ';' ) { str[j] = 0; for (j1 = 0; html_code[j1].sht; j1++) { if (!strncasecmp(str, html_code[j1].sht, strlen(html_code[j1].sht))) { is = true; code = html_code[j1].cht; } } break; } } if (is) { pbuf[l1-1] = code; i += l; } continue; } for (j=0, l=2; i+l max_seq_length) break; str[j] = buf[l+i]; if (buf[l+i] == ';' ) { is = true; str[j] = 0; code = atoi(str); break; } } if (is) { is = false; for (j1 = 0; j1 < 256; j1++) { if (code == UnicodeTable[j1]) { is = true; code = j1; break; } } if (is) { pbuf[l1-1] = code; i += l; } } } pbuf[l1] = 0; return l1; } #endif bogofilter-1.2.4/src/base64.h0000644000175000017500000000074712163572304014075 0ustar sezsez/* $Id: base64.h 5267 2005-01-04 15:46:33Z m-a $ */ /** \file base64.h * prototypes and definitions for base64.c */ #ifndef HAVE_BASE64_H #define HAVE_BASE64_H #include "word.h" /** decode base64 in-place, \return the count of decoded bytes in the \a * word */ uint base64_decode(word_t *word /** string to decode in-place, will be modified */); /** check if \a word contains conformant base64-encoded data */ bool base64_validate(const word_t *word); #endif /* HAVE_BASE64_H */ bogofilter-1.2.4/src/patch.lexer.254.txt0000644000175000017500000000117212163572304016120 0ustar sezsez--- lexer_v3-2.5.4.c 2006-11-18 18:46:05.000000000 -0500 +++ lexer_v3.c 2006-12-04 19:16:56.000000000 -0500 @@ -2435,6 +2435,14 @@ else ret_val = EOB_ACT_CONTINUE_SCAN; + if (yy_n_chars + number_to_move > yy_current_buffer->yy_buf_size) { + int new_size = yy_n_chars * 5 / 4 + 2; + yy_current_buffer->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yy_flex_realloc( (void *) yy_current_buffer->yy_ch_buf, + new_size ); + } + yy_n_chars += number_to_move; yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; bogofilter-1.2.4/src/iconvert.c0000644000175000017500000001245112163572304014630 0ustar sezsez/* $Id: iconvert.c 6986 2012-12-07 21:34:05Z m-a $ */ /***************************************************************************** NAME: iconvert.c -- provide iconv() support for bogofilter's lexer. AUTHOR: David Relson ******************************************************************************/ /** ** Note: 01/07/05 ** ** "make check" changes: ** ** t.systest - msg.3.txt ** 0x92 It’s ** ** t.lexer.mbx - spam.mbx ** msg**4 ** 0xAE Club® ** msg**20 ** 0xA0 MyNetOffers  ** 0x93 “Your ** 0x94 Account” **/ #include "common.h" #include #include #include "buff.h" #include "iconvert.h" extern iconv_t cd; static void iconv_print_error(int err, buff_t *src) { if (DEBUG_ICONV(1)) { const char *msg = NULL; switch (err) { case EILSEQ: /* invalid multibyte sequence */ msg = "EILSEQ"; break; case EINVAL: /* incomplete multibyte sequence */ msg = "EINVAL"; break; case E2BIG: /* output buffer has no more room */ msg = "E2BIG"; break; } if (msg != NULL) fprintf(dbgout, "err: %s (%d), tx: %p, rd: %d, ln: %d, sz: %d\n", msg, err, src->t.u.text, src->read, src->t.leng, src->size); } } static void convert(iconv_t xd, buff_t *restrict src, buff_t *restrict dst) { bool done = false; while (!done) { char * inbuf; size_t inbytesleft; char * outbuf; size_t outbytesleft; size_t count; inbuf = (char *)src->t.u.text + src->read; inbytesleft = src->t.leng - src->read; outbuf = (char *)dst->t.u.text + dst->t.leng; outbytesleft = dst->size - dst->read - dst->t.leng; if (outbytesleft == 0) break; /* * The iconv function converts one multibyte character at a time, and for * each character conversion it increments *inbuf and decrements * *inbytesleft by the number of converted input bytes, it increments * *outbuf and decrements *outbytesleft by the number of converted output * bytes, and it updates the conversion state contained in cd. The * conversion can stop for four reasons: */ count = iconv(xd, (ICONV_CONST char **)&inbuf, &inbytesleft, &outbuf, &outbytesleft); /* * 1. An invalid multibyte sequence is encountered * in the input. In this case it sets errno to * EILSEQ and returns (size_t)(-1). *inbuf is left * pointing to the beginning of the invalid * multibyte sequence. * 2. The input byte sequence has been entirely * converted, i.e. *inbytesleft has gone down to * 0. In this case iconv returns the number of * non-reversible conversions performed during * this call. * 3. An incomplete multibyte sequence is * encountered in the input, and the input byte * sequence terminates after it. In this case it * sets errno to EINVAL and returns * (size_t)(-1). *inbuf is left pointing to the * beginning of the incomplete multibyte sequence. * 4. The output buffer has no more room for the * next converted character. In this case it sets * errno to E2BIG and returns (size_t)(-1). * A different case is when inbuf is NULL or *inbuf is * NULL, but outbuf is not NULL and *outbuf is not * NULL. In this case, the iconv function attempts to * set cd's conversion state to the initial state and * store a corresponding shift sequence at *outbuf. At * most *outbytesleft bytes, starting at *outbuf, will * be written. If the output buffer has no more room * for this reset sequence, it sets errno to E2BIG and * returns (size_t)(-1). Otherwise it increments * *outbuf and decrements *outbytesleft by the number * of bytes written. * * A third case is when inbuf is NULL or inbuf is * NULL, and outbuf is NULL or outbuf is NULL. In this * case, the iconv function sets cd's conversion state * to the initial state. */ if (count == (size_t)(-1)) { int err = errno; iconv_print_error(err, src); switch (err) { case EILSEQ: /* invalid multibyte sequence */ case EINVAL: /* incomplete multibyte sequence */ if (outbytesleft == 0) { done = true; break; } /* copy 1 byte (or substitute a '?') */ if (!replace_nonascii_characters) *outbuf = *inbuf; else *outbuf = '?'; /* update counts and pointers */ inbytesleft -= 1; outbytesleft -= 1; inbuf += 1; outbuf += 1; break; case E2BIG: /* output buffer has no more room */ /* TODO: Provide proper handling of E2BIG */ done = true; break; default: break; } } src->read = src->t.leng - inbytesleft; dst->t.leng = dst->size - dst->read - outbytesleft; if (src->read >= src->t.leng) done = true; } Z(dst->t.u.text[dst->t.leng]); /* for easier debugging - removable */ if (DEBUG_ICONV(1) && src->t.leng != src->read) fprintf(dbgout, "tx: %p, rd: %d, ln: %d, sz: %d\n", src->t.u.text, src->read, src->t.leng, src->size); } static void copy(buff_t *restrict src, buff_t *restrict dst) { /* if conversion not available, use memcpy */ dst->t.leng = min(dst->size, src->t.leng); memcpy(dst->t.u.text, src->t.u.text, dst->t.leng+D); } void iconvert(buff_t *restrict src, buff_t *restrict dst) { if (cd == NULL) copy(src, dst); else convert(cd, src, dst); } void iconvert_cd(iconv_t xd, buff_t *restrict src, buff_t *restrict dst) { if (xd == (iconv_t)-1) copy(src, dst); else convert(xd, src, dst); } bogofilter-1.2.4/src/datastore_qdbm_cmpkey.c0000644000175000017500000000110712163572272017340 0ustar sezsez/* $Id: datastore_qdbm_cmpkey.c 4915 2004-11-01 10:17:15Z m-a $ */ #include "datastore_qdbm.h" int cmpkey(const char *aptrin, int asiz, const char *bptrin, int bsiz) { int aiter, biter; const unsigned char *aptr = (const unsigned char *)aptrin; const unsigned char *bptr = (const unsigned char *)bptrin; for (aiter = 0, biter = 0; aiter < asiz && biter < bsiz; ++aiter, ++biter) { if (aptr[aiter] != bptr[biter]) return (aptr[aiter] < bptr[biter]) ? -1 : 1; } if (aiter == asiz && biter == bsiz) return 0; return (aiter == asiz) ? -1 : 1; } bogofilter-1.2.4/src/robx.c0000644000175000017500000000524712163572304013756 0ustar sezsez/* $Id: robx.c 6875 2010-02-14 20:57:34Z relson $ */ /***************************************************************************** NAME: robx.c -- computes robx value by reading wordlist.db AUTHOR: David Relson - C version Greg Lous - perl version ******************************************************************************/ #include #include "common.h" #include "datastore.h" #include "rand_sleep.h" #include "robx.h" #include "wordlists.h" /* Function Prototypes */ /* Function Definitions */ typedef struct robhook_data { double sum; uint32_t count; uint32_t spam_cnt; uint32_t good_cnt; dsh_t *dsh; double scalefactor; } rhd_t; static void robx_accum(rhd_t *rh, word_t *key, dsv_t *data) { uint32_t goodness = data->goodcount; uint32_t spamness = data->spamcount; double prob = spamness / (goodness * rh->scalefactor + spamness); bool doit = goodness + spamness >= 10; if (doit) { rh->sum += prob; rh->count += 1; } /* print if -vvv and token in both word lists, or -vvvv */ if ((verbose > 2 && doit) || verbose > 3) { fprintf(dbgout, "cnt: %4lu, sum: %11.6f, ratio: %9.6f," " sp: %3lu, gd: %3lu, p: %9.6f, t: %.*s\n", (unsigned long)rh->count, rh->sum, rh->sum / rh->count, (unsigned long)spamness, (unsigned long)goodness, prob, CLAMP_INT_MAX(key->leng), key->u.text); } } static int robx_hook(word_t *key, dsv_t *data, void *userdata) { struct robhook_data *rh = userdata; /* ignore system meta-data */ if (*key->u.text != '.') robx_accum(rh, key, data); return 0; } /** returns negative for failure. * used by bogoutil and bogotune */ double compute_robinson_x(void) { int ret; double rx; dsh_t *dsh; wordlist_t *wordlist; struct robhook_data rh; open_wordlists(DS_READ); wordlist = get_default_wordlist(word_lists); dsh = wordlist->dsh; rh.spam_cnt = wordlist->msgcount[IX_SPAM]; rh.good_cnt = wordlist->msgcount[IX_GOOD]; if (rh.spam_cnt == 0 || rh.good_cnt == 0) wordlist_error(ENOENT); rh.scalefactor = (double)rh.spam_cnt/(double)rh.good_cnt; rh.dsh = dsh; rh.sum = 0.0; rh.count = 0; do { ret = ds_foreach(dsh, robx_hook, &rh); if (ret == DS_ABORT_RETRY) { rand_sleep(1000, 1000000); begin_wordlist(wordlist); } } while (ret == DS_ABORT_RETRY); rx = rh.sum/rh.count; if (rh.count == 0) ret = -1; if (verbose > 2) printf("%s: %u, %u, scale: %f, sum: %f, cnt: %6d, .ROBX: %f\n", MSG_COUNT, rh.spam_cnt, rh.good_cnt, rh.scalefactor, rh.sum, (int)rh.count, rx); close_wordlists(true); return ret ? -1 : rx; } bogofilter-1.2.4/src/db_lock.h0000644000175000017500000000242612163572272014406 0ustar sezsez/** \file db_lock.h * \brief header file for bogofilter's crash detector * \author Matthias Andree * \date 2004 * * GNU GPL v2 */ #ifndef DB_LOCK_H #define DB_LOCK_H /* function prototypes */ /** create and open lock file in \a bogohomedir * \return * - 0 for success * - -1 for error */ int init_dbl(const char *bogohomedir); /** set the next free lock cell and initialize the periodic crash * checker, which will _exit() the program when another process has * crashed. Requires that init_dbl() has been called before. \return * - 0 for success * - -2 if a process has just crashed * - -1 for error */ int set_lock(void); /** end the periodic crash checker and unlock our lock cell, and closes * the lock file. Requires that init_dbl() and set_lock() have been * called before. \return * - 0 for success * - -1 for error */ int clear_lock(void); /** reinitialize the lock file, which must pre-exist. Requires that * init_dbl() has been called before. \return * - 0 for success * - -1 for error */ int clear_lockfile(void); /** checks if a process has crashed previously. Requires that init_dbl() * has been called before. \return * - 0 if no process has previously crashed * - 1 if a process has crashed previously. */ int needs_recovery(void); #endif /* DB_LOCK_H */ bogofilter-1.2.4/src/qp.h0000644000175000017500000000100312163572304013413 0ustar sezsez/* $Id: qp.h 4803 2004-10-08 23:50:04Z m-a $ */ /***************************************************************************** NAME: qp.h -- prototypes and definitions for qp.c ******************************************************************************/ #ifndef HAVE_QP_H #define HAVE_QP_H #include "word.h" enum qp_mode { RFC2045=2045, RFC2047=2047 }; typedef enum qp_mode qp_mode; uint qp_decode(word_t *word, qp_mode mode); bool qp_validate(const word_t *word, qp_mode mode); #endif /* HAVE_QP_H */ bogofilter-1.2.4/src/register.h0000644000175000017500000000043712163572272014635 0ustar sezsez/* register.h -- constants and declarations for register.c */ /* $Id: register.h 3446 2003-10-29 18:47:45Z relson $ */ #ifndef REGISTER_H #define REGISTER_H #include "wordhash.h" extern void register_words(run_t _run_type, wordhash_t *h, u_int32_t msgcount); #endif /* REGISTER_H */ bogofilter-1.2.4/src/globals.h0000644000175000017500000000601412163572304014425 0ustar sezsez/* $Id: globals.h 6940 2010-12-21 01:20:22Z relson $ */ #ifndef GLOBALS_H #define GLOBALS_H #include /* has DBL_EPSILON */ #define EPS DBL_EPSILON /* equality cutoff */ #include "system.h" /* has bool */ #include "common.h" /* has PATH_LEN */ #ifdef __LCLINT__ typedef int bool; #endif extern bool fBogotune; extern bool fBogoutil; extern bool fBogofilter; /* for transactions */ extern e_txn eTransaction; /* command line options */ extern bulk_t bulk_mode; /* '-B' */ extern bool suppress_config_file; /* '-C' */ extern bool nonspam_exits_zero; /* '-e' */ extern bool fisher; /* '-f' */ extern FILE *fpin; /* '-I' */ extern bool logflag; /* '-l' */ extern uint min_token_len; extern uint max_token_len; extern uint max_multi_token_len; extern uint multi_token_count; extern bool mbox_mode; /* '-M' */ extern char outfname[PATH_LEN]; /* '-O' */ extern bool passthrough; /* '-p' */ extern bool pairs; /* '-P' */ extern bool quiet; /* '-q' */ extern int query; /* '-Q' */ extern bool Rtable; /* '-R' */ extern bool terse; /* '-t' */ extern int bogotest; /* '-X', env("BOGOTEST") */ extern int verbose; /* '-v' */ extern bool replace_nonascii_characters; /* '-n' */ /* config file options */ extern double min_dev; extern double ham_cutoff; extern double spam_cutoff; extern double thresh_update; extern uint token_count_fix; extern uint token_count_min; extern uint token_count_max; extern int abort_on_error; extern bool stats_in_header; extern bool header_line_markup; /* -Ph,-PH */ extern const char *update_dir; extern const char *progname; extern char *progtype; /*@observer@*/ extern const char *stats_prefix; extern const char *const version; extern const char *const system_config_file; /* for msgcounts.c */ #define MSG_COUNT ".MSG_COUNT" extern uint msgs_good; extern uint msgs_bad; /* for passthrough.c */ extern size_t msg_register_size; extern char msg_register[256]; /* old new ** robs 0.010 0.0178 ** robx 0.415 0.52 ** min_dev 0.1 0.375 ** spam_cutoff 0.95 0.99 ** ham_cutoff 0.00 0.00 (bi-state) ** ham_cutoff 0.10 0.45 (tri-state) */ #define ROBS 0.0178 /* Robinson's s */ #define ROBX 0.52 /* Robinson's x */ #define MIN_DEV 0.375 #define SP_ESF 1.0 #define NS_ESF 1.0 #define HAM_CUTOFF 0.45 /* 0.45 for three-state, 0.00 for two-state */ #define SPAM_CUTOFF 0.99 #define ROBX_W ".ROBX" extern double robs; extern double robx; extern double sp_esf; extern double ns_esf; /* for BerkeleyDB */ #define DB_CACHESIZE 4 /* in MB */ extern uint db_cachesize; /* other */ extern FILE *fpo; extern bool msg_count_file; extern bool unsure_stats; /* true if print stats for unsures */ #define WORDLIST_VERSION ".WORDLIST_VERSION" extern uint wordlist_version; #define WORDLIST_ENCODING ".ENCODING" extern e_enc encoding; #ifndef HAVE_SIG_ATOMIC_T typedef volatile int sig_atomic_t; #endif extern sig_atomic_t fDie; /* true if a terminating signal (such as SIGINT or SIGTERM) has been received */ #endif bogofilter-1.2.4/src/lexer.c0000644000175000017500000003137712163572304014126 0ustar sezsez/* $Id: lexer.c 6988 2013-01-20 14:02:48Z m-a $ */ /** * \file lexer.c * bogofilter's lexical analyzer (control routines) * * \date 2003-01-01 split out of lexer.l */ #include "common.h" #include #include #include "base64.h" #include "bogoconfig.h" #include "bogoreader.h" #include "charset.h" #include "error.h" #ifndef DISABLE_UNICODE #include "convert_unicode.h" #include "iconvert.h" #endif #include "lexer.h" #include "memstr.h" #include "mime.h" #include "msgcounts.h" #include "qp.h" #include "textblock.h" #include "token.h" #include "word.h" #include "xmalloc.h" /* Global Variables */ extern int yylineno; bool msg_header = true; bool have_body = false; lexer_t *lexer = NULL; /* Local Variables */ static lexer_t v3_lexer = { yylex, lexer_v3_get_token }; lexer_t msg_count_lexer = { read_msg_count_line, msg_count_get_token }; /* Function Prototypes */ static int yy_get_new_line(buff_t *buff); static int get_decoded_line(buff_t *buff); static int skip_folded_line(buff_t *buff); /* Function Definitions */ void lexer_init(void) { mime_reset(); token_init(); lexer_v3_init(NULL); init_charset_table(charset_default); } static void lexer_display_buffer(buff_t *buff) { fprintf(dbgout, "*** %2d %c%c %2ld ", yylineno-1, msg_header ? 'h' : 'b', yy_get_state(), (long)(buff->t.leng - buff->read)); buff_puts(buff, 0, dbgout); if (buff->t.leng > 0 && buff->t.u.text[buff->t.leng-1] != '\n') fputc('\n', dbgout); } /** * Check for lines wholly composed of printable characters as they can * cause a scanner abort "input buffer overflow, can't enlarge buffer * because scanner uses REJECT" * * \bug this function must go, we need to fix the lexer */ static bool long_token(byte *buf, uint count) { uint i; for (i=0; i < count; i += 1) { byte c = buf[i]; /* 10/23/05 - fix SIGSEGV with msg.1023.6479.txt ** evidently caused by 09/07/05 patch for 0.96.2 */ if (c == '\0') break; if ((iscntrl(c) || isspace(c) || ispunct(c)) && (c != '_')) return false; } return true; } static int yy_get_new_line(buff_t *buff) { int count = (*reader_getline)(buff); const byte *buf = buff->t.u.text; static size_t hdrlen = 0; if (hdrlen==0) hdrlen=strlen(spam_header_name); if (count > 0) yylineno += 1; if (count == EOF) { if (fpin == NULL || !ferror(fpin)) { return YY_NULL; } else { print_error(__FILE__, __LINE__, "input in flex scanner failed\n"); exit(EX_ERROR); } } /* Mime header check needs to be performed on raw input ** -- before mime decoding. Without it, flex aborts: ** "fatal flex scanner internal error--end of buffer missed" */ if (buff->t.leng > 2 && buf[0] == '-' && buf[1] == '-' && got_mime_boundary(&buff->t)) { yy_set_state_initial(); } if (count >= 0 && DEBUG_LEXER(0)) lexer_display_buffer(buff); /* skip spam_header ("X-Bogosity:") lines */ while (msg_header && count != EOF /* don't skip if inside message/rfc822 */ && msg_state->parent == NULL && memcmp(buff->t.u.text,spam_header_name,hdrlen) == 0) { count = skip_folded_line(buff); } return count; } static int get_decoded_line(buff_t *buff) { int count; buff_t *linebuff; #ifdef DISABLE_UNICODE linebuff = buff; #else if (encoding == E_RAW || msg_state->mime_dont_decode ) { linebuff = buff; } else { static buff_t *tempbuff = NULL; if (tempbuff == NULL) tempbuff = (buff_t *) calloc(sizeof(buff_t), 1); /* UTF-8 uses up to six octets per character. Make input buffer * sufficiently small that the UTF-8 text can fit in the output * buffer */ if (tempbuff->size < buff->size / 6) { xfree(tempbuff->t.u.text); tempbuff->size = buff->size / 6; tempbuff->t.u.text = (byte *) xmalloc(tempbuff->size+D); } tempbuff->t.leng = tempbuff->read = 0; linebuff = tempbuff; } #endif count = yy_get_new_line(linebuff); if (count == EOF) { if ( !ferror(fpin)) return YY_NULL; else { print_error(__FILE__, __LINE__, "input in flex scanner failed\n"); exit(EX_ERROR); } } /* Save the text on a linked list of lines. * Note that we store fixed-length blocks here, not lines. * One very long physical line could break up into more * than one of these. */ if (passthrough && count > 0) textblock_add(linebuff->t.u.text+linebuff->read, (size_t) count); if ( !msg_header && !msg_state->mime_dont_decode && msg_state->mime_type != MIME_TYPE_UNKNOWN) { word_t temp; uint decoded_count; temp.leng = (uint) count; temp.u.text = linebuff->t.u.text+linebuff->read; decoded_count = mime_decode(&temp); /*change buffer size only if the decoding worked */ if (decoded_count != 0 && decoded_count < (uint) count) { linebuff->t.leng -= (uint) (count - decoded_count); count = (int) decoded_count; if (DEBUG_LEXER(1)) lexer_display_buffer(linebuff); } } #ifndef DISABLE_UNICODE if (encoding == E_UNICODE && !msg_state->mime_dont_decode) { iconvert(linebuff, buff); /* * iconvert, treating multi-byte sequences, can shrink or enlarge * the output compared to its input. Correct count. */ if (count > 0) count = buff->t.leng; } #endif #ifdef EXCESSIVE_DEBUG /* debug */ fprintf(dbgout, "%d: ", count); buff_puts(buff, 0, dbgout); fprintf(dbgout, "\n"); #endif /* CRLF -> NL */ if (count >= 2) { byte *buf = buff->t.u.text; if (memcmp(buf + count - 2, CRLF, 2) == 0) { count --; *(buf + count - 1) = (byte) '\n'; } } if (buff->t.leng < buff->size) /* for easier debugging - removable */ Z(buff->t.u.text[buff->t.leng]); /* for easier debugging - removable */ return count; } static int skip_folded_line(buff_t *buff) { for (;;) { int count; buff->t.leng = 0; count = reader_getline(buff); yylineno += 1; /* only check for LWSP-char (RFC-822) aka. WSP (RFC-2822), * these only include SP and HTAB */ if (buff->t.u.text[0] != ' ' && buff->t.u.text[0] != '\t') return count; /* Check for empty line which terminates message header */ if (is_eol((char *)buff->t.u.text, count)) return count; } } int buff_fill(buff_t *buff, size_t used, size_t need) { int cnt = 0; size_t leng = buff->t.leng; size_t size = buff->size; /* check bytes needed vs. bytes in buff */ while (size - leng > 2 && need > leng - used) { /* too few, read more */ int add = get_decoded_line(buff); if (add == EOF) return EOF; if (add == 0) break ; cnt += add; leng += add; } return cnt; } void yyinit(void) { yylineno = 0; if ( !msg_count_file) lexer = &v3_lexer; } int yyinput(byte *buf, size_t used, size_t size) /* input getter for the scanner */ { int cnt; int count = 0; buff_t buff; buff_init(&buff, buf, 0, (uint) size); /* After reading a line of text, check if it has special characters. * If not, trim some, but leave enough to match a max length token. * Then read more text. This will ensure that a really long sequence * of alphanumerics, which bogofilter will ignore anyway, doesn't crash * the flex lexer. */ while ((cnt = get_decoded_line(&buff)) != 0) { count += cnt; /* Note: some malformed messages can cause xfgetsl() to report ** "Invalid buffer size, exiting." ** and then abort. This ** can happen when the parser is in html mode and there's a ** leading '<' but no closing '>'. ** ** The "fix" is to check for a nearly full lexer buffer and ** discard most of it. */ /* if not nearly full */ if (used < 1000 || used < size * 10) break; if (count >= MAX_TOKEN_LEN * 2 && long_token(buff.t.u.text, (uint) count)) { uint start = buff.t.leng - count; uint length = count - max_token_len; buff_shift(&buff, start, length); count = buff.t.leng; } else break; } if (msg_state && msg_state->mime_dont_decode && (msg_state->mime_disposition != MIME_DISPOSITION_UNKNOWN)) { return (count == EOF ? 0 : count); /* not decode at all */ } #if defined(CP866) && !defined(ENABLE_ICONV) /* EK - decoding things like м and charset_table */ count = decode_and_htmlUNICODE_to_cp866(buf, count); #endif if (replace_nonascii_characters) { /* do non-ascii replacement */ int i; for (i = 0; i < count; i++ ) { byte ch = buf[i]; buf[i] = charset_table[ch]; } } if (DEBUG_LEXER(2)) fprintf(dbgout, "*** yyinput(\"%-.*s\", %lu, %lu) = %d\n", count, buf, (unsigned long)used, (unsigned long)size, count); return (count == EOF ? 0 : count); } static char *charset_as_string(const byte *txt, const size_t len) { static char *charset_text = NULL; static unsigned short charset_leng = 0; if (charset_text == NULL) charset_text = xmalloc(len+D); else { if (charset_leng < len) { charset_leng = len; charset_text = xrealloc(charset_text, charset_leng+D); } } memcpy(charset_text, txt, len); Z(charset_text[len]); /* for easier debugging - removable */ return charset_text; } word_t *text_decode(word_t *w) { word_t *r = w; byte *const beg = w->u.text; /* base pointer, fixed */ byte *const fin = beg + w->leng; /* end+1 position */ byte *txt = (byte *) memstr(w->u.text, w->leng, "=?"); /* input position */ uint size = (uint) (txt - beg); /* output offset */ #ifndef DISABLE_UNICODE size_t max = w->leng * 4; static buff_t * buf = NULL; #endif if (txt == NULL) return r; #ifndef DISABLE_UNICODE if (encoding == E_UNICODE) { if (buf == NULL) buf = buff_new(xmalloc(max+D), 0, max); r = &buf->t; /* Use buf to return unicode result */ buf->t.leng = 0; if (buf->size < max) { buf->size = max; buf->t.u.text = (byte *) xrealloc(buf->t.u.text, buf->size+D); } buf->t.leng = size; memcpy(buf->t.u.text, beg, size ); Z(buf->t.u.text[buf->t.leng]); /* for easier debugging - removable */ } #endif if (DEBUG_LEXER(2)) { fputs("**1** ", dbgout); word_puts(w, 0, dbgout); fputs("\n", dbgout); } while (txt < fin) { byte *typ, *tmp, *end; uint len; bool adjacent; char *charset; txt += 2; typ = (byte *) memchr((char *)txt+1, '?', fin-txt); /* Encoding type - 'B' or 'Q' */ *typ++ = '\0'; /* nul terminate */ charset = charset_as_string(txt, typ - txt - 1); tmp = typ + 2; /* start of encoded word */ end = (byte *) memstr((char *)tmp, fin-tmp, "?="); /* last byte of encoded word */ len = end - tmp; w->u.text = tmp; /* Start of encoded word */ w->leng = len; /* Length of encoded word */ Z(w->u.text[w->leng]); /* for easier debugging - removable */ if (DEBUG_LEXER(2)) { fputs("**2** ", dbgout); word_puts(w, 0, dbgout); fputs("\n", dbgout); } switch (tolower(*typ)) { /* ... encoding type */ case 'b': if (base64_validate(w)) len = base64_decode(w); /* decode base64 */ break; case 'q': if (qp_validate(w, RFC2047)) len = qp_decode(w, RFC2047); /* decode quoted-printable */ break; } /* move decoded word to where the encoded used to be */ if (encoding == E_RAW) { memmove(beg+size, w->u.text, len); size += len; /* bump output pointer */ Z(beg[size]); /* for easier debugging - removable */ if (DEBUG_LEXER(3)) fprintf(dbgout, "**3** %s\n", beg); } #ifndef DISABLE_UNICODE if (encoding == E_UNICODE) { iconv_t cd; buff_t src; /* convert 'word_t *w' to 'buff_t src' because ** iconvert_cd() needs buff_t pointers */ src.t.u.text = w->u.text; src.t.leng = len; src.read = 0; src.size = len; cd = bf_iconv_open( charset_unicode, charset ); iconvert_cd(cd, &src, buf); iconv_close(cd); if (DEBUG_LEXER(3)) { fputs("**4** ", dbgout); word_puts(&buf->t, 0, dbgout); fputs("\n", dbgout); } } #endif txt = end + 2; /* skip ?= trailer */ if (txt >= fin) break; /* check for next encoded word */ end = (byte *) memstr((char *)txt, fin-txt, "=?"); adjacent = end != NULL; /* clear adjacent flag if non-whitespace character found between * adjacent encoded words */ if (adjacent) { tmp = txt; while (adjacent && tmp < end) { if (*tmp && strchr(" \t\r\n", *tmp)) tmp += 1; else adjacent = false; } } /* we have a next encoded word and we've had only whitespace * between the current and the next */ if (adjacent) /* just skip whitespace */ txt = end; else /* copy everything that was between the encoded words */ while (txt < end) { if (encoding == E_RAW) beg[size++] = *txt++; #ifndef DISABLE_UNICODE if (encoding == E_UNICODE) buf->t.u.text[buf->t.leng++] = *txt++; #endif } } if (encoding == E_RAW) { r->u.text = beg; r->leng = size; } return r; } /* * The following sets edit modes for GNU EMACS * Local Variables: * mode:c * End: */ bogofilter-1.2.4/src/xatoi.c0000644000175000017500000000206312163572304014121 0ustar sezsez/** \file xatoi.c * Implements xatoi, an easy to use atoi() replacement with error * checking. * * \author Matthias Andree * \date 2003 */ #include "xatox.h" #include #include #include #include int xatoi(int *i, const char *in) { long val; char *end; errno = 0; val = strtol(in, &end, 10); if (end == in /* input string empty or does not start with sign/digit */ || end < in + strlen(in) /* junk at end of in */ || errno == EINVAL /* "base not supported" (shouldn't happen) */ || errno == ERANGE /* underflow or overflow */) return 0; if (val > INT_MAX || val < INT_MIN) { /* out of range for 'int' type */ errno = ERANGE; return 0; } *i = (int)val; /* safe after range check */ return 1; } #ifdef MAIN #include int main(int argc, char **argv) { int i; for (i = 1; i < argc; i++) { int d; int s = xatoi(&d, argv[i]); printf("%s -> errno=%d_(%s) status=%d int=%d\n", argv[i], errno, strerror(errno), s, d); } exit(EXIT_SUCCESS); } #endif bogofilter-1.2.4/src/chUnicodeTo866.h0000644000175000017500000000701312163572304015452 0ustar sezsez/* Unicode.h */ /* â ¡«¨æ  ¯¥p¥ª®¤¨p®¢ª¨ CP866->Unicode */ int UnicodeTable[256]= { 0 , 0x01 , 0x02 , 0x03 , 0x04 , 0x05 , 0x06 , 0x07 , 0x08 , 0x09 , 0x0A , 0x0B , 0x0C , 0x0D , 0x0E , 0x0F , 0x10 , 0x11 , 0x12 , 0x13 , 0xB6 , 0xA7 , 0x16 , 0x17 , 0x18 , 0x19 , 0x1A , 0x1B , 0x1C , 0x1D , 0x1E , 0x1F , 0x20 , 0x21 , 0x22 , 0x23 , 0x24 , 0x25 , 0x26 , 0x27 , 0x28 , 0x29 , 0x2A , 0x2B , 0x2C , 0x2D , 0x2E , 0x2F , 0x30 , 0x31 , 0x32 , 0x33 , 0x34 , 0x35 , 0x36 , 0x37 , 0x38 , 0x39 , 0x3A , 0x3B , 0x3C , 0x3D , 0x3E , 0x3F , 0x40 , 0x41 , 0x42 , 0x43 , 0x44 , 0x45 , 0x46 , 0x47 , 0x48 , 0x49 , 0x4A , 0x4B , 0x4C , 0x4D , 0x4E , 0x4F , 0x50 , 0x51 , 0x52 , 0x53 , 0x54 , 0x55 , 0x56 , 0x57 , 0x58 , 0x59 , 0x5A , 0x5B , 0x5C , 0x5D , 0x5E , 0x5F , 0x60 , 0x61 , 0x62 , 0x63 , 0x64 , 0x65 , 0x66 , 0x67 , 0x68 , 0x69 , 0x6A , 0x6B , 0x6C , 0x6D , 0x6E , 0x6F , 0x70 , 0x71 , 0x72 , 0x73 , 0x74 , 0x75 , 0x76 , 0x77 , 0x78 , 0x79 , 0x7A , 0x7B , 0x7C , 0x7D , 0x7E , 0x7F , 0x410 , 0x411 , 0x412 , 0x413 , 0x414 , 0x415 , 0x416 , 0x417 , 0x418 , 0x419 , 0x41A , 0x41B , 0x41C , 0x41D , 0x41E , 0x41F , 0x420 , 0x421 , 0x422 , 0x423 , 0x424 , 0x425 , 0x426 , 0x427 , 0x428 , 0x429 , 0x42A , 0x42B , 0x42C , 0x42D , 0x42E , 0x42F , 0x430 , 0x431 , 0x432 , 0x433 , 0x434 , 0x435 , 0x436 , 0x437 , 0x438 , 0x439 , 0x43A , 0x43B , 0x43C , 0x43D , 0x43E , 0x43F , 0x2591, 0x2592, 0x2593, 0x2502, 0x2524, 0x2561, 0x2562, 0x2556, 0x2555, 0x2563, 0x2551, 0x2557, 0x255D, 0x255C, 0x255B, 0x2510, 0x2514, 0x2534, 0x252C, 0x251C, 0x2500, 0x253C, 0x255E, 0x255F, 0x255A, 0x2554, 0x2569, 0x2566, 0x2560, 0x2550, 0x256C, 0x2567, 0x2568, 0x2564, 0x2565, 0x2559, 0x2558, 0x2552, 0x2553, 0x256B, 0x256A, 0x2518, 0x250C, 0x2588, 0x2584, 0x258C, 0x2590, 0x2580, 0x440 , 0x441 , 0x442 , 0x443 , 0x444 , 0x445 , 0x446 , 0x447 , 0x448 , 0x449 , 0x44A , 0x44B , 0x44C , 0x44D , 0x44E , 0x44F , 0x401 , 0x451 , 0x404 , 0x454 , 0x407 , 0x457 , 0x40E , 0x45E , 0xB0 , 0x2219, 0xB7 , 0x221A, 0x2116, 0xA4 , 0x25A0, 0xA0 }; /* Html &-sequences */ typedef unsigned char uchar; struct htmlSeq { const char *sht; uchar cht; }; const struct htmlSeq html_code[] = { {"nbsp", 32}, {"#191", 191}, {"Agrave", 192}, {"Aacute", 193}, {"Acirc", 194}, {"Atilde", 195}, {"Auml", 196}, {"Aring", 197}, {"AElig", 198}, {"Ccedil", 199}, {"Egrave", 200}, {"Eacute", 201}, {"Ecirc", 202}, {"Euml", 203}, {"Igrave", 204}, {"Iacute", 205}, {"Icirc", 206}, {"Iuml", 207}, {"ETH", 208}, {"Ntilde", 209}, {"Ograve", 210}, {"Oacute", 211}, {"Ocirc", 212}, {"Otilde", 213}, {"Ouml", 214}, {"#215", 215}, {"Oslash", 216}, {"Ugrave", 217}, {"Uacute", 218}, {"Ucirc", 219}, {"Uuml", 220}, {"Yacute", 221}, {"THORN", 222}, {"szlig", 223}, {"agrave", 224}, {"aacute", 225}, {"acirc", 226}, {"atilde", 227}, {"auml", 228}, {"aring", 229}, {"aelig", 230}, {"ccedil", 231}, {"egrave", 232}, {"eacute", 233}, {"ecirc", 234}, {"euml", 235}, {"igrave", 236}, {"iacute", 237}, {"icirc", 238}, {"iuml", 239}, {"eth", 240}, {"ntilde", 241}, {"ograve", 242}, {"oacute", 243}, {"ocirc", 244}, {"otilde", 245}, {"ouml", 246}, {"#247", 247}, {"oslash", 248}, {"ugrave", 249}, {"uacute", 250}, {"ucirc", 251}, {"uuml", 252}, {"yacute", 253}, {"thorn", 254}, {"yuml", 255}, { NULL, 0} }; bogofilter-1.2.4/src/bogofilter.h0000644000175000017500000000061612163572304015140 0ustar sezsez/* $Id: bogofilter.h 2867 2003-08-23 18:03:56Z relson $ */ /* constants and declarations for bogofilter */ #ifndef BOGOFILTER_H #define BOGOFILTER_H #define EVEN_ODDS 0.5 /* used for words we want to ignore */ #define DEVIATION(n) fabs((n) - EVEN_ODDS) /* deviation from average */ extern rc_t bogofilter(int argc, char **argv); extern void print_stats(FILE *fp); #endif /* BOGOFILTER_H */ bogofilter-1.2.4/src/memdebug.h0000644000175000017500000000137512163572304014574 0ustar sezsez/* $Id: memdebug.h 5672 2005-03-21 01:34:30Z relson $ */ /* * NAME: * memdebug.h -- header file for memdebug.c * */ #ifndef MEMDEBUG_H #define MEMDEBUG_H #undef MEMDISPLAY #define MEMDISPLAY memdisplay(__FILE__, __LINE__) extern int memtrace; void *md_calloc(size_t nmemb, size_t size); void *md_malloc(size_t size); void *md_realloc(void *ptr, size_t size); void md_free(void *ptr); void memdisplay(const char *file, int lineno); enum { M_MALLOC = 1, M_FREE = 2 }; #ifndef NO_MEMDEBUG_MACROS #define bf_malloc md_malloc #define bf_calloc md_calloc #define bf_realloc md_realloc #define bf_free md_free #define malloc md_malloc #define calloc md_calloc #define realloc md_realloc #define free md_free #endif #endif /* MEMDEBUG_H */ bogofilter-1.2.4/src/xmem_error.c0000644000175000017500000000052312163572304015153 0ustar sezsez/* $Id: xmem_error.c 4050 2004-02-03 00:59:57Z relson $ */ #include #include "xmalloc.h" /*@noreturn@*/ void xmem_error(const char *a) { (void)fprintf(stderr, "%s: Out of memory\n", a); abort(); } /*@noreturn@*/ void xmem_toolong(const char *a) { (void)fprintf(stderr, "%s: String too long\n", a); abort(); } bogofilter-1.2.4/src/collect.h0000644000175000017500000000110512163572304014423 0ustar sezsez/* $Id: collect.h 3605 2003-11-24 19:27:47Z relson $ */ /***************************************************************************** NAME: collect.h -- global definitions for the collect library, part of bogofilter ******************************************************************************/ #ifndef COLLECT_H #define COLLECT_H #include "token.h" #include "wordhash.h" extern void wordprop_init(void *vwordprop); extern void wordcnts_init(void *vwordcnts); extern void wordcnts_incr(wordcnts_t *w1, wordcnts_t *w2); extern void collect_words(wordhash_t *wh); #endif bogofilter-1.2.4/src/maint.c0000644000175000017500000002162112163572304014106 0ustar sezsez/* $Id: maint.c 6862 2009-08-05 08:43:04Z m-a $ */ /***************************************************************************** NAME: maint.c -- wordlist maintenance functions AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include "buff.h" #include "datastore.h" #include "error.h" #include "charset.h" #ifndef DISABLE_UNICODE #include "convert_unicode.h" #include "iconvert.h" #endif #include "maint.h" #include "transaction.h" #include "wordlists.h" #include "xmalloc.h" #include "xstrdup.h" uint32_t thresh_count = 0; YYYYMMDD thresh_date = 0; size_t size_min = 0; size_t size_max = 0; bool timestamp_tokens = true; bool upgrade_wordlist_version = false; #ifndef DISABLE_UNICODE e_enc old_encoding; e_enc new_encoding; #define DEFAULT_OR_UNICODE(enc) (enc == E_RAW) ? charset_default : charset_unicode #endif /* Function Prototypes */ /* Function Definitions */ /* Keep high counts */ static bool keep_count(uint32_t count) { bool ok = count > thresh_count; if (count > 0 && DEBUG_DATABASE(1)) fprintf(dbgout, "keep_count: %lu > %lu -> %c\n", (unsigned long)count, (unsigned long)thresh_count, ok ? 't' : 'f' ); return ok; } /* Keep recent dates */ static bool keep_date(YYYYMMDD date) { bool ok = thresh_date < date; if (DEBUG_DATABASE(1)) fprintf(dbgout, "keep_date: %ld < %ld -> %c\n", (long)thresh_date, (long)date, ok ? 't' : 'f' ); return ok; } /* Keep sizes within bounds */ static bool keep_size(size_t size) { bool ok = (size_min <= size) && (size <= size_max); if (DEBUG_DATABASE(1)) fprintf(dbgout, "keep_size: %lu <= %lu <= %lu -> %c\n", (unsigned long)size_min, (unsigned long)size, (unsigned long)size_max, ok ? 't' : 'f' ); return ok; } static void merge_tokens(const word_t *old_token, const word_t *new_token, dsv_t *in_val, ta_t *transaction, void *vhandle) { int ret; dsv_t old_tmp; /* delete original token */ ta_delete(transaction, vhandle, old_token); /* retrieve and update nonascii token*/ ret = ta_read(transaction, vhandle, new_token, &old_tmp); if (ret == EX_OK) { in_val->spamcount += old_tmp.spamcount; in_val->goodcount += old_tmp.goodcount; in_val->date = max(old_tmp.date, in_val->date); /* date in form YYYYMMDD */ } set_date(in_val->date); /* set timestamp */ ta_write(transaction, vhandle, new_token, in_val); set_date(0); } static void replace_token(const word_t *old_token, const word_t *new_token, dsv_t *in_val, ta_t *transaction, void *vhandle) { /* delete original token */ ta_delete(transaction, vhandle, old_token); /* retrieve and update nonascii token*/ set_date(in_val->date); /* set timestamp */ ta_write(transaction, vhandle, new_token, in_val); set_date(0); } /* Keep token if at least one user given constraint should be kept */ /* Discard if all user given constraints are satisfied */ bool discard_token(word_t *token, dsv_t *in_val) { bool discard; if (token->u.text[0] == '.') { /* keep .ENCODING, .MSG_COUNT, and .ROBX */ if (strcmp((const char *)token->u.text, MSG_COUNT) == 0) return false; if (strcmp((const char *)token->u.text, ROBX_W) == 0) return false; if (strcmp((const char *)token->u.text, WORDLIST_ENCODING) == 0) return false; } discard = (thresh_count != 0) || (thresh_date != 0) || (size_min != 0) || (size_max != 0); if (discard) { if (thresh_count != 0 && (keep_count(in_val->spamcount) || keep_count(in_val->goodcount))) discard = false; if (thresh_date != 0 && keep_date(in_val->date)) discard = false; if ((size_min != 0 || size_max != 0) && keep_size(token->leng)) discard = false; } return discard; } bool do_replace_nonascii_characters(register byte *str, register size_t len) { bool change = false; assert(str != NULL); while (len--) { if (*str & 0x80) { *str = '?'; change = true; } str++; } return change; } struct userdata_t { void *vhandle; ta_t *transaction; }; static int maintain_hook(word_t *w_key, dsv_t *in_val, void *userdata) { size_t len; word_t token; void *vhandle = ((struct userdata_t *) userdata)->vhandle; ta_t *transaction = ((struct userdata_t *) userdata)->transaction; token.u.text = w_key->u.text; token.leng = w_key->leng; len = strlen(MSG_COUNT); if (len == token.leng && strncmp((char *)token.u.text, MSG_COUNT, token.leng) == 0) return EX_OK; if (discard_token(&token, in_val)) { int ret = ta_delete(transaction, vhandle, &token); if (DEBUG_DATABASE(0)) fprintf(dbgout, "deleting '%.*s'\n", (int)min(INT_MAX, token.leng), (char *)token.u.text); return ret; } if (replace_nonascii_characters) { word_t new_token; new_token.u.text = (byte *)xmalloc(token.leng + 1); memcpy(new_token.u.text, token.u.text, token.leng); new_token.leng = token.leng; new_token.u.text[new_token.leng] = '\0'; if (do_replace_nonascii_characters(new_token.u.text, new_token.leng)) merge_tokens(&token, &new_token, in_val, transaction, vhandle); xfree(new_token.u.text); } #ifndef DISABLE_UNICODE if (old_encoding != new_encoding) { buff_t new_buff; buff_t old_buff; old_buff.read = 0; old_buff.size = token.leng; old_buff.t.u.text = token.u.text; old_buff.t.leng = token.leng; new_buff.read = 0; new_buff.size = token.leng * 6; new_buff.t.leng = 0; new_buff.t.u.text = (byte *)xmalloc(new_buff.size); iconvert(&old_buff, &new_buff); if (old_buff.t.leng != new_buff.t.leng || memcmp(old_buff.t.u.text, new_buff.t.u.text, new_buff.t.leng) != 0) { if (DEBUG_ICONV(2)) { fputs("*** ", dbgout); word_puts(&old_buff.t, 0, dbgout); fputs( "\n", dbgout); fputs("*** ", dbgout); word_puts(&new_buff.t, 0, dbgout); fputs( "\n", dbgout); } merge_tokens(&old_buff.t, &new_buff.t, in_val, transaction, vhandle); } xfree(new_buff.t.u.text); } #endif if (upgrade_wordlist_version) { switch (wordlist_version) { case IP_PREFIX: { /* up-to-date - nothing to do */ break; } case 0: { /* update to "ip:" prefix level */ const char *url_hdr = "url:"; size_t url_len = strlen(url_hdr); const char *ip_hdr = "ip:"; size_t ip_len = strlen(ip_hdr); if (token.leng > url_len && memcmp(token.u.text, url_hdr, url_len) == 0) { word_t new_token; new_token.leng = token.leng + ip_len - url_len; new_token.u.text = (byte *)xmalloc(new_token.leng + 1); memcpy(new_token.u.text, ip_hdr, ip_len); memcpy(new_token.u.text+ip_len, token.u.text+url_len, token.leng - url_len); new_token.u.text[new_token.leng] = '\0'; replace_token(&token, &new_token, in_val, transaction, vhandle); xfree(new_token.u.text); } break; } } } return EX_OK; } static bool check_wordlist_version(dsh_t *dsh) { dsv_t val; ds_get_wordlist_version(dsh, &val); if (val.count[0] >= CURRENT_VERSION) return true; else return false; } static ex_t maintain_wordlist(void *database) { ta_t *transaction = ta_init(); struct userdata_t userdata; ex_t ret; bool done = false; userdata.vhandle = database; userdata.transaction = transaction; if (DST_OK == ds_txn_begin(database)) { #ifndef DISABLE_UNICODE dsv_t val; int rc = ds_get_wordlist_encoding(database, &val); new_encoding = encoding; if (rc == 0) old_encoding = val.spamcount; /* found */ else old_encoding = E_RAW; /* not found */ if (old_encoding != new_encoding) { const char *from_charset = DEFAULT_OR_UNICODE(old_encoding); const char *to_charset = DEFAULT_OR_UNICODE(new_encoding); init_charset_table_iconv(from_charset, to_charset); } #endif ret = ds_foreach(database, maintain_hook, &userdata); } else ret = EX_ERROR; if (upgrade_wordlist_version) { done = check_wordlist_version(database); if (!done) fprintf(dbgout, "Upgrading wordlist.\n"); else fprintf(dbgout, "Wordlist has already been upgraded.\n"); } if (!done && upgrade_wordlist_version) { dsv_t val; val.count[0] = CURRENT_VERSION; val.count[1] = 0; ds_set_wordlist_version(database, &val); } #ifndef DISABLE_UNICODE if (old_encoding != new_encoding) { dsv_t val; word_t enco; enco.u.text = (byte *)xstrdup(WORDLIST_ENCODING); enco.leng = strlen(WORDLIST_ENCODING); val.count[0] = new_encoding; val.count[1] = 0; val.date = 0; ds_write(database, &enco, &val); xfree(enco.u.text); } #endif if (ta_commit(transaction) != TA_OK) ret = EX_ERROR; if (DST_OK != ds_txn_commit(database)) ret = EX_ERROR; return ret; } ex_t maintain_wordlist_file(bfpath *bfp) { ex_t rc; dsh_t *dsh; void *dbe; dbe = ds_init(bfp); dsh = ds_open(dbe, bfp, DS_WRITE); if (dsh == NULL) return EX_ERROR; rc = maintain_wordlist(dsh); ds_close(dsh); ds_cleanup(dbe); return rc; } bogofilter-1.2.4/src/bf_compact.in0000755000175000017500000000422112163572272015263 0ustar sezsez#! @SHELL@ # bf_compact source_dir [wordlist_name...] # # use to compact wordlist.db # replaces original directory with new one # renames original directory with '.old' extension # $Id: bf_compact.in 6749 2008-10-15 23:08:06Z clint $ set -e # die on errors : ${BOGOFILTER:=@transformed_bogofilter@} : ${BOGOUTIL:=@transformed_bogoutil@} if [ -z "$1" ] ; then echo 'usage: bf_compact source_dir [wordlist_name...]' exit 1 fi # extract home directory BOGOHOME="$1" shift if [ ! -d "$BOGOHOME" ] ; then echo "$BOGOHOME must be a directory, not a file" exit 1 fi # strip trailing slashes while true; do case "$BOGOHOME" in */) BOGOHOME=${BOGOHOME%/} ;; *) break ;; esac done export BOGOHOME # find wordlists if [ -n "$1" ] ; then FILES="$@" else DIR=$($BOGOFILTER -QQ | grep ^bogofilter_dir | @AWK@ '{print $3}') if [ "$BOGOHOME" != "$DIR" ] ; then FILES=$(ls "$BOGOHOME"/*@DB_EXT@) else FILES=$($BOGOFILTER -QQ | grep ^wordlist | cut -f3 -d,) fi fi BOGOTEMP="bf_compact.$$" mkdir "$BOGOTEMP" || { echo "Cannot create directory $BOGOTEMP. Abort." exit 1 } # copy Berkeley DB configuration if present if test -f "$BOGOHOME"/DB_CONFIG ; then cp -p "$BOGOHOME"/DB_CONFIG "$BOGOTEMP"/ fi case "$($BOGOFILTER -V | grep Database:)" in *"Berkeley DB"*) # determine transactions if test "$(find "$BOGOHOME/" -name "log.??????????" -print)" = "" ; then TXN=no else TXN=yes fi ;; *) TXN=noarg ;; esac # reload files for FILE in $FILES ; do NAME="$(basename $FILE)" $BOGOUTIL --db-verify "$FILE" \ || { echo "$FILE corrupted, aborting." ; rm -r "$BOGOTEMP" ; exit 1 ; } $BOGOUTIL -d "$FILE" | case $TXN in no|yes) $BOGOUTIL --db-transaction=no -l "$BOGOTEMP/$NAME" ;; noarg) $BOGOUTIL -l "$BOGOTEMP/$NAME" ;; esac done if [ $TXN = "yes" ] ; then #create database environment files $BOGOFILTER -e -C -d "$BOGOTEMP" --db-transaction=yes < /dev/null fi # remove $BOGOHOME.old so we don't move the new backup *into* it # rather than renaming the backup to it. rm -rf "$BOGOHOME.old" mv "$BOGOHOME" "$BOGOHOME.old" mv "$BOGOTEMP" "$BOGOHOME" bogofilter-1.2.4/src/debug.main.c0000644000175000017500000000204612163572272015013 0ustar sezsez/* $Id: debug.main.c 3447 2003-10-29 18:51:23Z relson $ */ /***************************************************************************** NAME: debug.main.c - shared debug functions AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include typedef struct mask_char_to_symbol_s { const char *str; u_int32_t bit; } mask_char_to_symbol_t; static mask_char_to_symbol_t const char_to_symbol[] = { { "g", BIT_GENERAL }, { "s", BIT_SPAMICITY }, { "d", BIT_DATABASE }, { "l", BIT_LEXER }, { "w", BIT_WORDLIST } }; int main(void) { size_t i; for (i=0; istr ); if ( (debug_mask & ptr->bit) != ptr->bit ) { fprintf(stderr, "debug_mask for '%s' is wrong.\n", ptr->str); exit(EX_ERROR); } } printf("All O.K.\n"); return 0; } bogofilter-1.2.4/src/tunelist.h0000644000175000017500000000364512163572304014660 0ustar sezsez/* $Id: tunelist.h 6714 2008-04-20 15:27:06Z relson $ */ /***************************************************************************** NAME: tunelist.h -- definitions and prototypes of list structures for bogotune. includes msglist_t, filelist_t, and tunelist_t. ******************************************************************************/ #ifndef TUNELIST_H #define TUNELIST_H #include "wordhash.h" /***** msglist *****/ typedef struct mlitem_s mlitem_t; typedef struct msglist_s mlhead_t; typedef struct wordprops_s wordprops_t; struct msglist_s { /* message list header */ char *name; uint count; mlitem_t *head; mlitem_t *tail; }; struct mlitem_s { /* message list item */ mlitem_t *next; wordhash_t *wh; wordprops_t *wp; }; struct wordprops_s { uint count; wordprop_t *wp; }; extern mlhead_t *msglist_new(const char *label); extern void msglist_add(mlhead_t *list, wordhash_t *wh); extern void msglist_print(mlhead_t *list); extern void msglist_free(mlhead_t *list); /***** filelist *****/ typedef struct flitem_s flitem_t; typedef struct flhead_s flhead_t; struct flhead_s { /* file list header */ char *name; uint count; flitem_t *head; flitem_t *tail; }; struct flitem_s { /* file list item */ flitem_t *next; char *name; }; extern flhead_t *filelist_new(const char *name); extern void filelist_add(flhead_t *list, const char *name); extern void filelist_free(flhead_t *list); /***** tunelist *****/ typedef struct tunelist_s tunelist_t; struct tunelist_s { const char *name; uint count; wordhash_t *train; /* training */ mlhead_t *msgs; union { mlhead_t *sets[3]; struct runs { mlhead_t *r0; mlhead_t *r1; mlhead_t *r2; } r; } u; }; uint count_messages(tunelist_t *list); tunelist_t *tunelist_new(const char *label); void tunelist_print(tunelist_t *list); void tunelist_free(tunelist_t *list); #endif bogofilter-1.2.4/src/datastore_txn_dummies.c0000644000175000017500000000367312163572272017413 0ustar sezsez/* $Id: datastore_txn_dummies.c 5794 2005-04-11 19:06:34Z m-a $ */ /***************************************************************************** NAME: datastore_db_trans_stub.c -- stub routines for bogofilter's transactional datastore, using Berkeley DB AUTHORS: David Relson 2005 ******************************************************************************/ #include "common.h" #include "datastore.h" #include "datastore_db.h" #include "datastore_db_private.h" /* OO function lists */ dsm_t dsm_dummies = { /* public -- used in datastore.c */ NULL, /* dsm_begin */ NULL, /* dsm_abort */ NULL, /* dsm_commit */ /* private -- used in datastore_db_*.c */ NULL, /* dsm_env_init */ NULL, /* dsm_cleanup */ NULL, /* dsm_cleanup_lite */ NULL, /* dsm_get_env_dbe */ NULL, /* dsm_database_name */ NULL, /* dsm_recover_open */ NULL, /* dsm_auto_commit_flags*/ NULL, /* dsm_get_rmw_flag */ NULL, /* dsm_lock */ NULL, /* dsm_common_close */ NULL, /* dsm_sync */ NULL, /* dsm_log_flush */ NULL, /* dsm_checkpoint */ NULL, /* dsm_pagesize */ NULL, /* dsm_purgelogs */ NULL, /* dsm_recover */ NULL, /* dsm_remove */ NULL, /* dsm_verify */ NULL, /* dsm_list_logfiles */ NULL /* dsm_leafpages */ }; dsm_t *dsm = &dsm_dummies; ex_t dbe_recover(bfpath *bfp, bool catastrophic, bool force) { (void) bfp; (void) catastrophic; (void) force; fprintf(stderr, "ERROR: bogofilter can not recover databases without transaction support.\n" "If you experience hangs, strange behavior, inaccurate output,\n" "you must delete your data base and rebuild it, or restore an older version\n" "that you know is good from your backups.\n"); exit(EX_ERROR); } bogofilter-1.2.4/src/collect.c0000644000175000017500000000455612163572304014433 0ustar sezsez/* $Id: collect.c 6766 2009-01-12 04:27:36Z relson $ */ /* collect.c -- tokenize input and cap word frequencies, return a wordhash */ #include "common.h" #include #include #include "charset.h" #include "mime.h" #include "wordhash.h" #include "token.h" #include "collect.h" void wordprop_init(void *vwordprop) { wordprop_t *wp = vwordprop; memset(wp, 0, sizeof(*wp)); } void wordcnts_init(void *vwordcnts) { wordcnts_t *wc = vwordcnts; memset(wc, 0, sizeof(*wc)); } void wordcnts_incr(wordcnts_t *w1, wordcnts_t *w2) { w1->good += w2->good; w1->bad += w2->bad; } /* Tokenize input text and save words in the wordhash_t hash table. * * Returns: true if the EOF token has not been read. */ void collect_words(wordhash_t *wh) { if (DEBUG_WORDLIST(2)) fprintf(dbgout, "### collect_words() begins\n"); lexer_init(); for (;;){ wordprop_t *wp; word_t token; token_t cls = get_token( &token ); if (cls == NONE) break; if (cls == BOGO_LEX_LINE) { char *beg = (char *)token.u.text+1; /* skip leading quote mark */ char *end = strchr(beg, '"'); assert(end); token.leng = end - beg; memmove(token.u.text, token.u.text + 1, token.leng + 1); token.u.text[token.leng] = '\0'; /* ensure nul termination */ } wp = wordhash_insert(wh, &token, sizeof(wordprop_t), &wordprop_init); if (wh->type != WH_CNTS) wp->freq = 1; /******* EK **********/ #ifdef CP866 /* mime charset hack */ { static bool hasCharset=false; if (hasCharset) /* prev token == charset */ { if (token.leng > 5 && !strncmp(token.text, "mime:", 5)) set_charset(token.text+5); } hasCharset = 0; if (token.leng == 5+7) { if (!strncmp(token.text, "mime:", 5) && !strncasecmp(token.text+5, "charset", 7)) hasCharset = true; } } #endif /******* end of EK addition **********/ if (DEBUG_WORDLIST(3)) { fprintf(dbgout, "%3d ", (int) wh->count); word_puts(&token, 0, dbgout); fputc('\n', dbgout); } if (cls == BOGO_LEX_LINE) { char *s = (char *)token.u.text; s += token.leng + 2; wp->cnts.bad = atoi(s); s = strchr(s+1, ' ') + 1; wp->cnts.good = atoi(s); wp->cnts.msgs_good = msgs_good; wp->cnts.msgs_bad = msgs_bad; } } if (DEBUG_WORDLIST(2)) fprintf(dbgout, "### collect_words() ends\n"); return; } bogofilter-1.2.4/src/bf_tar.in0000755000175000017500000000332312163572272014425 0ustar sezsez#! @SHELL@ # This file dumps a bogofilter to standard output in POSIX-tar format. # # Requires: pax # # (C) 2004 by Matthias Andree # GNU GPL v2. # $Id: bf_tar.in 6750 2008-10-15 23:18:45Z clint $ set -e : ${BOGOFILTER:=@transformed_bogofilter@} : ${BOGOUTIL:=@transformed_bogoutil@} REMOVEBEF=0 REMOVEAFT=0 while [ "$1" ] ; do case "$1" in -r) REMOVEAFT=1 ;; -R) REMOVEBEF=1 ;; --) shift ; break ;; -*) echo >&2 "`basename $0`: unknown option $1" ; exit 1 ;; *) break; esac shift done if [ $# -ne 1 ] ; then echo >&2 "Usage: `basename $0` [options] bogodir > outfile.tar" echo >&2 " or: `basename $0` [options] bogodir | gzip -c >outfile.tar.gz" echo >&2 'Options are:' echo >&2 ' -r - remove inactive log files after archiving' echo >&2 ' -R - remove inactive log files before archiving (use with caution)' exit 1 fi # we could write $1 for the moment being as we demand exactly this # argument above [ $# -ne 1 ] BOGOHOME=${1:-.} if [ ! -d "$BOGOHOME" ] ; then echo $BOGOHOME must be a directory, not a file exit 1 fi nukelogs() { $BOGOUTIL --db-prune="$BOGOHOME" } # remove if requested if [ $REMOVEBEF -eq 1 ] ; then nukelogs else $BOGOUTIL --db-checkpoint="$BOGOHOME" fi # database first, then the logs. # the log MUST be newer than the database, if it's the other way around, # that state will not be recoverable! # # pax options: -w: write archive, -v: verbosely, -x ustar: pick tar format. ( c="${BOGOHOME}/DB_CONFIG" if [ -f "$c" ] ; then echo "$c" ; fi $BOGOFILTER -QQ -d "$BOGOHOME" | grep '^wordlist ' | cut -f3 -d, $BOGOUTIL --db-list-logfiles="$BOGOHOME" all ) | pax -w -v -x ustar # remove if requested if [ $REMOVEAFT -eq 1 ] ; then nukelogs ; fi bogofilter-1.2.4/src/prob.c0000644000175000017500000000311412163572272013741 0ustar sezsez/* $Id: prob.c 6733 2008-06-11 11:15:34Z relson $ */ /***************************************************************************** NAME: prob.c -- calculate token's spamicity AUTHORS: David Relson Matthias Andree ******************************************************************************/ #include "globals.h" #include "prob.h" double calc_prob(uint good, uint bad, uint goodmsgs, uint badmsgs) { uint n = good + bad; double fw, pw; /* http://www.linuxjournal.com/article.php?sid=6467 */ /* robs is Robinson's s parameter, the "strength of background info" */ /* robx is Robinson's x parameter, the assumed probability that * a word we don't have enough info about will be spam */ /* n is the number of messages that contain the word w */ if (n == 0 #ifdef EXTRA_DOMAIN_CHECKING /* we had this in place while the ignore lists caused the * token to have "nan" counts because score.c left the * message counts at zero - #ifdef'd out for speed */ || badmsgs == 0 || goodmsgs == 0 #endif ) { /* in these cases, pw would be undefined and return NaN * we substitute "we don't know", the x parameter */ fw = robx; } else { /* The original version of this code has four divisions. pw = ((bad / badmsgs) / (bad / badmsgs + good / goodmsgs)); */ /* This modified version, with 1 division, is considerably% faster. */ pw = bad * (double)goodmsgs / (bad * (double)goodmsgs + good * (double)badmsgs); fw = (robs * robx + n * pw) / (robs + n); } return fw; } bogofilter-1.2.4/src/strlcpy.30000644000175000017500000001202412163572304014413 0ustar sezsez.\" $NetBSD: strlcpy.3,v 1.9 2002/02/07 07:00:32 ross Exp $ .\" from OpenBSD: strlcpy.3,v 1.11 2000/11/16 23:27:41 angelos Exp .\" .\" Copyright (c) 1998, 2000 Todd C. Miller .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. The name of the author may not be used to endorse or promote products .\" derived from this software without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, .\" INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY .\" AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL .\" THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, .\" EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, .\" PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; .\" OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, .\" WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR .\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF .\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. .\" .Dd March 1, 2001 .Dt STRLCPY 3 .Os .Sh NAME .Nm strlcpy , .Nm strlcat .Nd size-bounded string copying and concatenation .Sh LIBRARY .Lb libc .Sh SYNOPSIS .Fd #include \*[Lt]string.h\*[Gt] .Ft size_t .Fn strlcpy "char *dst" "const char *src" "size_t size" .Ft size_t .Fn strlcat "char *dst" "const char *src" "size_t size" .Sh DESCRIPTION The .Fn strlcpy and .Fn strlcat functions copy and concatenate strings respectively. They are designed to be safer, more consistent, and less error prone replacements for .Xr strncpy 3 and .Xr strncat 3 . Unlike those functions, .Fn strlcpy and .Fn strlcat take the full size of the buffer (not just the length) and guarantee to NUL-terminate the result (as long as .Fa size is larger than 0 or, in the case of .Fn strlcat , as long as there is at least one byte free in .Fa dst ) . Note that you should include a byte for the NUL in .Fa size . Also note that .Fn strlcpy and .Fn strlcat only operate on true .Dq C strings. This means that for .Fn strlcpy .Fa src must be NUL-terminated and for .Fn strlcat both .Fa src and .Fa dst must be NUL-terminated. .Pp The .Fn strlcpy function copies up to .Fa size - 1 characters from the NUL-terminated string .Fa src to .Fa dst , NUL-terminating the result. .Pp The .Fn strlcat function appends the NUL-terminated string .Fa src to the end of .Fa dst . It will append at most .Fa size - strlen(dst) - 1 bytes, NUL-terminating the result. .Sh RETURN VALUES The .Fn strlcpy and .Fn strlcat functions return the total length of the string they tried to create. For .Fn strlcpy that means the length of .Fa src . For .Fn strlcat that means the initial length of .Fa dst plus the length of .Fa src . While this may seem somewhat confusing it was done to make truncation detection simple. .Pp Note however, that if .Fn strlcat traverses .Fa size characters without finding a NUL, the length of the string is considered to be .Fa size and the destination string will not be NUL-terminated (since there was no space for the NUL). This keeps .Fn strlcat from running off the end of a string. In practice this should not happen (as it means that either .Fa size is incorrect or that .Fa dst is not a proper .Dq C string). The check exists to prevent potential security problems in incorrect code. .Sh EXAMPLES The following code fragment illustrates the simple case: .Bd -literal -offset indent char *s, *p, buf[BUFSIZ]; \&... (void)strlcpy(buf, s, sizeof(buf)); (void)strlcat(buf, p, sizeof(buf)); .Ed .Pp To detect truncation, perhaps while building a pathname, something like the following might be used: .Bd -literal -offset indent char *dir, *file, pname[MAXPATHLEN]; \&... if (strlcpy(pname, dir, sizeof(pname)) \*[Ge] sizeof(pname)) goto toolong; if (strlcat(pname, file, sizeof(pname)) \*[Ge] sizeof(pname)) goto toolong; .Ed .Pp Since we know how many characters we copied the first time, we can speed things up a bit by using a copy instead of an append: .Bd -literal -offset indent char *dir, *file, pname[MAXPATHLEN]; size_t n; \&... n = strlcpy(pname, dir, sizeof(pname)); if (n \*[Ge] sizeof(pname)) goto toolong; if (strlcpy(pname + n, file, sizeof(pname) - n) \*[Ge] sizeof(pname) - n) goto toolong; .Ed .Pp However, one may question the validity of such optimizations, as they defeat the whole purpose of .Fn strlcpy and .Fn strlcat . .Sh SEE ALSO .Xr snprintf 3 , .Xr strncat 3 , .Xr strncpy 3 .Sh HISTORY .Fn strlcpy and .Fn strlcat first appeared in .Ox 2.4 , then in .Nx 1.4.3 and .Fx 3.3.0 . bogofilter-1.2.4/src/xstrlcpy.c0000644000175000017500000000034312163572272014670 0ustar sezsez#include "config.h" #include "xstrlcpy.h" #include "xmalloc.h" #include "system.h" size_t xstrlcpy(char *d, const char *s, size_t l) { size_t w = strlcpy(d, s, l); if (w >= l) xmem_toolong("xstrlcpy"); return w; } bogofilter-1.2.4/src/debug.h0000644000175000017500000000571112163572272014077 0ustar sezsez/* $Id: debug.h 6494 2006-06-21 01:39:51Z relson $ */ /***************************************************************************** NAME: debug.h -- prototypes and definitions for debug.c ******************************************************************************/ #ifndef _DEBUG_H #define _DEBUG_H /* define FILE type */ #include /* define other types */ #include "bftypes.h" #define DEBUG_NONE 0 #define MASK_BIT(uc) ( 1 << (uc - 'A')) #define BIT_NAMES "abcdghilmrstuwyz" #define BIT_ALGORITHM MASK_BIT('A') #define BIT_READER MASK_BIT('B') #define BIT_CONFIG MASK_BIT('C') #define BIT_DATABASE MASK_BIT('D') #define BIT_GENERAL MASK_BIT('G') #define BIT_HTML MASK_BIT('H') #define BIT_ICONV MASK_BIT('I') #define BIT_LEXER MASK_BIT('L') #define BIT_MIME MASK_BIT('M') #define BIT_MULTI MASK_BIT('U') #define BIT_REGISTER MASK_BIT('R') #define BIT_SPAMICITY MASK_BIT('S') #define BIT_TEXT MASK_BIT('T') #define BIT_WORDLIST MASK_BIT('W') #define BIT_MEMORY MASK_BIT('Y') #define BIT_TEST MASK_BIT('Z') extern FILE *dbgout; extern u_int32_t debug_mask; #ifdef NODEBUG #define DEBUG_GENERAL(level) 0 #define DEBUG_CONFIG(level) 0 #define DEBUG_DATABASE(level) 0 #define DEBUG_ALGORITHM(level) 0 #define DEBUG_HTML(level) 0 #define DEBUG_ICONV(level) 0 #define DEBUG_LEXER(level) 0 #define DEBUG_MEMORY(level) 0 #define DEBUG_MIME(level) 0 #define DEBUG_MULTI(level) 0 #define DEBUG_READER(level) 0 #define DEBUG_REGISTER(level) 0 #define DEBUG_SPAMICITY(level) 0 #define DEBUG_TEXT(level) 0 #define DEBUG_WORDLIST(level) 0 #define DEBUG_TEST(level) 0 #else #define DEBUG_GENERAL(level) ((debug_mask & BIT_GENERAL) && (verbose > level)) #define DEBUG_CONFIG(level) ((debug_mask & BIT_CONFIG) && (verbose > level)) #define DEBUG_DATABASE(level) ((debug_mask & BIT_DATABASE) && (verbose > level)) #define DEBUG_ALGORITHM(level) ((debug_mask & BIT_ALGORITHM) && (verbose > level)) #define DEBUG_HTML(level) ((debug_mask & BIT_HTML) && (verbose > level)) #define DEBUG_ICONV(level) ((debug_mask & BIT_ICONV) && (verbose > level)) #define DEBUG_LEXER(level) ((debug_mask & BIT_LEXER) && (verbose > level)) #define DEBUG_MEMORY(level) ((debug_mask & BIT_MEMORY) && (verbose > level)) #define DEBUG_MIME(level) ((debug_mask & BIT_MIME) && (verbose > level)) #define DEBUG_MULTI(level) ((debug_mask & BIT_MULTI) && (verbose > level)) #define DEBUG_READER(level) ((debug_mask & BIT_READER) && (verbose > level)) #define DEBUG_REGISTER(level) ((debug_mask & BIT_REGISTER) && (verbose > level)) #define DEBUG_SPAMICITY(level) ((debug_mask & BIT_SPAMICITY) && (verbose > level)) #define DEBUG_TEXT(level) ((debug_mask & BIT_TEXT) && (verbose > level)) #define DEBUG_WORDLIST(level) ((debug_mask & BIT_WORDLIST) && (verbose > level)) #define DEBUG_TEST(level) ((debug_mask & BIT_TEST) && (verbose > level)) #endif #define BOGOTEST(uc) ((bogotest & MASK_BIT(uc)) != 0) void set_debug_mask(const char *mask); void set_bogotest(const char *mask); #endif bogofilter-1.2.4/src/mxcat.h0000644000175000017500000000104312163572272014117 0ustar sezsez#ifndef MXCAT_H #define MXCAT_H /** mxcat allocates a new buffer and concatenates all strings in the * argument list into the new buffer, starting with \a first. * The variable argument list MUST be terminated by a NULL pointer. * \return the address of the first byte of the allocated string, the * caller must call free() on the result after use. * * \b Example: char *x = mxcat("this ", "is ", "nice!", NULL);\n * will point x to the first character of "this is nice!". */ char *mxcat(const char *first, ...); #endif bogofilter-1.2.4/src/strlcpy.c0000644000175000017500000000457112163572304014503 0ustar sezsez/* $Id: strlcpy.c 3436 2003-10-29 14:31:52Z m-a $ */ /* from NetBSD: strlcpy.c,v 1.5.8.2 2002/04/26 13:17:42 he Exp */ /* from OpenBSD: strlcpy.c,v 1.4 1999/05/01 18:56:41 millert Exp */ /* * Copyright (c) 1998 Todd C. Miller * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include #include #include "system.h" /* * Copy src to string dst of size siz. At most siz-1 characters * will be copied. Always NUL terminates (unless siz == 0). * Returns strlen(src); if retval >= siz, truncation occurred. */ size_t strlcpy(char *dst, const char *src, size_t siz) { register char *d = dst; register const char *s = src; register size_t n = siz; /* Copy as many bytes as will fit */ if (n != 0 && --n != 0) { do { if ((*d++ = *s++) == 0) break; } while (--n != 0); } /* Not enough room in dst, add NUL and traverse rest of src */ if (n == 0) { if (siz != 0) *d = '\0'; /* NUL-terminate dst */ while (*s++) ; } return(s - src - 1); /* count does not include NUL */ } bogofilter-1.2.4/src/charset.h0000644000175000017500000000150312163572304014431 0ustar sezsez/* $Id: charset.h 6112 2005-06-24 11:22:47Z relson $ */ /***************************************************************************** NAME: charset.h -- constants and declarations for charset.c AUTHOR: David Relson ******************************************************************************/ #ifndef CHARSET_H #define CHARSET_H extern const char *charset_default; extern const char *charset_unicode; extern bool replace_nonascii_characters; extern byte charset_table[256]; extern byte casefold_table[256]; extern void got_charset(const char *); extern void set_charset(const char *charset); extern void init_charset_table(const char *charset_name); #if defined(CP866) && !defined(ENABLE_ICONV) extern int decode_and_htmlUNICODE_to_cp866(byte *buf, int len); #endif #endif /* CHARSET_H */ bogofilter-1.2.4/src/convert_unicode.c0000644000175000017500000001066312163572272016174 0ustar sezsez/* $Id: convert_unicode.c 6888 2010-03-14 16:24:40Z m-a $ */ /***************************************************************************** NAME: charset_iconv.c -- provide charset support using iconv(). Note: Character translation is done to make life easier for the lexer. Text is changed only after the message has been saved for passthrough. The end user (mail reader) never sees any changes - only the lexer. AUTHOR: David Relson 2005 ******************************************************************************/ #include "common.h" #include #include #include #include #include "charset.h" #include "convert_unicode.h" #include "chUnicodeTo866.h" #include "xmalloc.h" #include "xstrdup.h" #define SP ' ' #include iconv_t cd = (iconv_t)-1; static void map_nonascii_characters(void) { uint ch; for (ch = 0; ch < COUNTOF(charset_table); ch += 1) { /* convert high-bit characters to '?' */ if (ch & 0x80 && casefold_table[ch] == ch) casefold_table[ch] = '?'; } } static void map_default(void) { unsigned int ch; for (ch = 0; ch < COUNTOF(charset_table); ch += 1) { charset_table[ch] = casefold_table[ch] = ch; } for (ch=0; ch < COUNTOF(charset_table); ch += 1) { if (iscntrl(ch) && /* convert control characters to blanks */ ch != '\t' && ch != '\n') /* except tabs and newlines */ charset_table[ch] = SP; } } typedef struct charset_def { const char *name; bool allow_nonascii_replacement; } charset_def_t; #define T true #define F false static charset_def_t charsets[] = { { "default", T }, { "us-ascii", T }, { "utf-8", T }, { "iso8859-1", T }, /* ISOIEC 8859-1:1998 Latin Alphabet No. 1 */ /* tests/t.systest.d/inputs/spam.mbx is iso-8859-1 and contains * 8-bit characters - " “Your Account” "---a typical case of a * message that should have declared windows-1252 instead */ { "iso8859-2", F }, /* ISOIEC 8859-2:1999 Latin Alphabet No. 2 */ { "iso8859-3", F }, /* ISOIEC 8859-3:1999 Latin Alphabet No. 3 */ { "iso8859-4", F }, /* ISOIEC 8859-4:1998 Latin Alphabet No. 4 */ { "iso8859-5", F }, /* ISOIEC 8859-5:1999 LatinCyrillic Alphabet */ { "iso8859-6", F }, /* ISOIEC 8859-6:1999 LatinArabic Alphabet */ { "iso8859-7", F }, /* ISO 8859-7:1987 LatinGreek Alphabet */ { "iso8859-8", F }, /* ISOIEC 8859-8:1999 LatinHebrew Alphabet */ { "iso8859-9", F }, /* ISOIEC 8859-9:1999 Latin Alphabet No. 5 */ { "iso8859-10", F }, /* ISOIEC 8859-10:1998 Latin Alphabet No. 6 */ { "iso8859-13", F }, /* ISOIEC 8859-13:1998 Latin Alphabet No. 7 (Baltic Rim)*/ { "iso8859-14", F }, /* ISOIEC 8859-14:1998 Latin Alphabet No. 8 (Celtic) */ { "iso8859-15", F }, /* ISOIEC 8859-15:1999 Latin Alphabet No. 9 */ { "cp866", F }, { "koi8-r", F }, { "windows-1251", F }, { "windows-1252", T }, { "windows-1256", T }, { "iso2022-jp", T }, /* rfc-1468 - japanese */ { "euc-kr", T }, /* extended unix code for korean */ { "iso2022-kr", T }, /* korean standard code (7-bit)*/ { "ks-c-5601-1987", T }, /* korean standard (default) */ { "big5", T }, { "csbig5", T }, { "gb2312", T }, { "csgb2312", T }, }; iconv_t bf_iconv_open( const char *to_charset, const char *from_charset ) { iconv_t xd = iconv_open( to_charset, from_charset ); if (xd == (iconv_t)-1) { int err = errno; if (err == EINVAL) { if (DEBUG_ICONV(1)) fprintf(dbgout, "Conversion from '%s' to '%s' is not supported.\n", from_charset, to_charset ); /* error - map default charset to unicode */ xd = iconv_open( charset_unicode, charset_default ); } } return xd; } void init_charset_table_iconv(const char *from_charset, const char *to_charset) { uint idx; if (cd != (iconv_t)-1) iconv_close(cd); if (DEBUG_ICONV(1)) fprintf(dbgout, "converting %s to %s\n", from_charset, to_charset); if (strcasecmp( from_charset, "default" ) == 0) from_charset = charset_default; cd = bf_iconv_open( to_charset, from_charset ); for (idx = 0; idx < COUNTOF(charsets); idx += 1) { charset_def_t *charset = &charsets[idx]; if (strcasecmp(charset->name, to_charset) == 0) { map_default(); /* Setup the table defaults. */ if (replace_nonascii_characters) if (charset->allow_nonascii_replacement) map_nonascii_characters(); break; } } return; } bogofilter-1.2.4/src/register.c0000644000175000017500000001024412163572272014625 0ustar sezsez/* $Id: register.c 6797 2009-02-14 21:13:00Z relson $ */ /* register.c -- read input with collect and register to persistent db */ #include "common.h" #include #include "bogofilter.h" #include "datastore.h" #include "collect.h" #include "format.h" #include "msgcounts.h" #include "rand_sleep.h" #include "register.h" #include "wordhash.h" #include "wordlists.h" #define PLURAL(count) ((count == 1) ? "" : "s") /* * tokenize text on stdin and register it to a specified list * and possibly out of another list */ void register_words(run_t _run_type, wordhash_t *h, u_int32_t msgcount) { const char *r="",*u=""; dsv_t val; hashnode_t *node; wordprop_t *wordprop; run_t save_run_type = run_type; int retrycount = 60; /* we'll retry an aborted registration five dozen times before giving up. */ bool first; u_int32_t wordcount = h->count; /* use number of unique tokens */ /* registrations always go to the default wordlist */ wordlist_t *list = get_default_wordlist(word_lists); sh_t incr = IX_UNDF, decr = IX_UNDF; /* If update directory explicity supplied, setup the wordlists. */ if (update_dir) { if (set_wordlist_dir(update_dir, PR_CFG_UPDATE) != 0) { fprintf(stderr, "Can't find HOME or BOGOFILTER_DIR in environment.\n"); exit(EX_ERROR); } } if (_run_type & REG_SPAM) { r = "s"; incr = IX_SPAM; } if (_run_type & REG_GOOD) { r = "n"; incr = IX_GOOD; } if (_run_type & UNREG_SPAM) { u = "S"; decr = IX_SPAM; } if (_run_type & UNREG_GOOD) { u = "N"; decr = IX_GOOD; } if (wordcount == 0) msgcount = 0; format_set_counts(wordcount, msgcount); format_log_update(msg_register, msg_register_size, u, r); if (verbose) (void)fprintf(dbgout, "# %u word%s, %u message%s\n", wordcount, PLURAL(wordcount), msgcount, PLURAL(msgcount)); /* When using auto-update with separate wordlists , datastore.c needs to know which to update */ run_type |= _run_type; first = true; retry: if (first) first = false; else { if (verbose) fprintf(stderr, "retrying registration after avoided deadlock...\n"); begin_wordlist(list); } if (retrycount-- == 0) { fprintf(stderr, "retry count exceeded, giving up.\n"); exit(EX_ERROR); } for (node = wordhash_first(h); node != NULL; node = wordhash_next(h)) { wordprop = node->data; switch (ds_read(list->dsh, node->key, &val)) { case DS_ABORT_RETRY: rand_sleep(4*1000,1000*1000); goto retry; case 0: case 1: break; default: fprintf(stderr, "cannot read from data base.\n"); exit(EX_ERROR); } if (incr != IX_UNDF) { u_int32_t *counts = val.count; counts[incr] += wordprop->freq; } if (decr != IX_UNDF) { u_int32_t *counts = val.count; counts[decr] = ((long)counts[decr] < wordprop->freq) ? 0 : counts[decr] - wordprop->freq; } switch (ds_write(list->dsh, node->key, &val)) { case DS_ABORT_RETRY: rand_sleep(4*1000,1000*1000); goto retry; case 0: break; default: fprintf(stderr, "cannot write to data base.\n"); exit(EX_ERROR); } } switch (ds_get_msgcounts(list->dsh, &val)) { case 0: case 1: break; case DS_ABORT_RETRY: rand_sleep(4 * 1000, 1000 * 1000); goto retry; default: fprintf(stderr, "cannot get message count values.\n"); exit(EX_ERROR); } list->msgcount[IX_SPAM] = val.spamcount; list->msgcount[IX_GOOD] = val.goodcount; if (incr != IX_UNDF) list->msgcount[incr] += msgcount; if (decr != IX_UNDF) { if (list->msgcount[decr] > msgcount) list->msgcount[decr] -= msgcount; else list->msgcount[decr] = 0; } val.spamcount = list->msgcount[IX_SPAM]; val.goodcount = list->msgcount[IX_GOOD]; switch (ds_set_msgcounts(list->dsh, &val)) { case 0: break; case DS_ABORT_RETRY: rand_sleep(4 * 1000, 1000 * 1000); goto retry; default: fprintf(stderr, "cannot set message count values\n"); exit(EX_ERROR); } if (DEBUG_REGISTER(1)) (void)fprintf(dbgout, "bogofilter: list %s (%s) - %ul spam, %ul good\n", list->listname, list->bfp->filepath, val.spamcount, val.goodcount); run_type = save_run_type; } bogofilter-1.2.4/src/xmalloc.c0000644000175000017500000000076312163572272014445 0ustar sezsez/* $Id: xmalloc.c 5649 2005-03-16 00:52:05Z relson $ */ /* * NAME: * xmalloc.c -- front-end to standard heap manipulation routines, with error checking. * * AUTHOR: * Gyepi Sam * */ #include "config.h" #include "xmalloc.h" void * xmalloc(size_t size){ void *ptr; ptr = bf_malloc(size); if (ptr == NULL && size == 0) ptr = bf_malloc(1); if (ptr == NULL) xmem_error("xmalloc"); return ptr; } void xfree(void *ptr){ if (ptr) bf_free(ptr); } bogofilter-1.2.4/src/bogotune.h0000644000175000017500000000112412163572304014621 0ustar sezsez/* $Id: bogotune.h 4349 2004-05-06 13:41:53Z relson $ */ /***************************************************************************** NAME: bogotune.h -- definitions and prototypes for bogotune.c ******************************************************************************/ #ifndef BOGOTUNE_H #define BOGOTUNE_H /* typedefs */ typedef struct result_s { uint idx; uint rsi; uint mdi; uint rxi; uint spi; uint nsi; double rs; double md; double rx; double co; double sp_exp; double ns_exp; uint fp; uint fn; } result_t; #endif bogofilter-1.2.4/src/lexer_v3.c0000644000175000017500000046011412163573332014533 0ustar sezsez/* Include config.h early to avoid _FILE_OFFSET_BITS redefinition on Solaris */ #include "config.h" #line 3 "lexer_v3.c" #define YY_INT_ALIGNED long int /* A lexical scanner generated by flex */ /* %not-for-header */ /* %if-c-only */ /* %if-not-reentrant */ /* %endif */ /* %endif */ /* %ok-for-header */ #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 5 #define YY_FLEX_SUBMINOR_VERSION 37 #if YY_FLEX_SUBMINOR_VERSION > 0 #define FLEX_BETA #endif /* %if-c++-only */ /* %endif */ /* %if-c-only */ /* %endif */ /* %if-c-only */ /* %endif */ /* First, we deal with platform-specific or compiler-specific issues. */ /* begin standard C headers. */ /* %if-c-only */ #include #include #include #include /* %endif */ /* %if-tables-serialization */ /* %endif */ /* end standard C headers. */ /* %if-c-or-c++ */ /* 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; /* 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 /* ! C99 */ #endif /* ! FLEXINT_H */ /* %endif */ /* %if-c++-only */ /* %endif */ #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 /* %not-for-header */ /* Returned upon end-of-file. */ #define YY_NULL 0 /* %ok-for-header */ /* %not-for-header */ /* 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) /* %ok-for-header */ /* %if-reentrant */ /* %endif */ /* %if-not-reentrant */ /* %endif */ /* 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 (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 (((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 ) #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 #ifndef YY_TYPEDEF_YY_SIZE_T #define YY_TYPEDEF_YY_SIZE_T typedef size_t yy_size_t; #endif /* %if-not-reentrant */ extern yy_size_t yyleng; /* %endif */ /* %if-c-only */ /* %if-not-reentrant */ extern FILE *yyin, *yyout; /* %endif */ /* %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 = (yy_hold_char); \ YY_RESTORE_YY_MORE_OFFSET \ (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, (yytext_ptr) ) #ifndef YY_STRUCT_YY_BUFFER_STATE #define YY_STRUCT_YY_BUFFER_STATE struct yy_buffer_state { /* %if-c-only */ FILE *yy_input_file; /* %endif */ /* %if-c++-only */ /* %endif */ 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. */ yy_size_t 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 */ /* %if-c-only Standard (non-C++) definition */ /* %not-for-header */ /* %if-not-reentrant */ /* Stack of input buffers. */ static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ /* %endif */ /* %ok-for-header */ /* %endif */ /* 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 ( (yy_buffer_stack) \ ? (yy_buffer_stack)[(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 (yy_buffer_stack)[(yy_buffer_stack_top)] /* %if-c-only Standard (non-C++) definition */ /* %if-not-reentrant */ /* %not-for-header */ /* yy_hold_char holds the character lost when yytext is formed. */ static char yy_hold_char; static yy_size_t yy_n_chars; /* number of characters read into yy_ch_buf */ yy_size_t yyleng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 0; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow yywrap()'s to do buffer switches * instead of setting up a fresh yyin. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; /* %ok-for-header */ /* %endif */ void yyrestart (FILE *input_file ); void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ); YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ); void yy_delete_buffer (YY_BUFFER_STATE b ); void yy_flush_buffer (YY_BUFFER_STATE b ); void yypush_buffer_state (YY_BUFFER_STATE new_buffer ); void yypop_buffer_state (void ); static void yyensure_buffer_stack (void ); static void yy_load_buffer_state (void ); static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ); #define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ) YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ); YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ); YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,yy_size_t len ); /* %endif */ void *yyalloc (yy_size_t ); void *yyrealloc (void *,yy_size_t ); void yyfree (void * ); #define yy_new_buffer yy_create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! YY_CURRENT_BUFFER ){ \ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! YY_CURRENT_BUFFER ){\ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) /* %% [1.0] yytext/yyin/yyout/yy_state_type/yylineno etc. def's & init go here */ /* Begin user sect3 */ #define yywrap() 1 #define YY_SKIP_YYWRAP #define FLEX_DEBUG typedef unsigned char YY_CHAR; FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; typedef int yy_state_type; extern int yylineno; int yylineno = 1; extern char *yytext; #define yytext_ptr yytext /* %if-c-only Standard (non-C++) definition */ static yy_state_type yy_get_previous_state (void ); static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); static int yy_get_next_buffer (void ); static void yy_fatal_error (yyconst char msg[] ); /* %endif */ /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ (yytext_ptr) = yy_bp; \ /* %% [2.0] code to fiddle yytext and yyleng for yymore() goes here \ */\ yyleng = (size_t) (yy_cp - yy_bp); \ (yy_hold_char) = *yy_cp; \ *yy_cp = '\0'; \ /* %% [3.0] code to copy yytext_ptr to yytext[] goes here, if %array \ */\ (yy_c_buf_p) = yy_cp; /* %% [4.0] data tables for the DFA and the user's section 1 definitions go here */ #define YY_NUM_RULES 43 #define YY_END_OF_BUFFER 44 /* 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_int32_t yy_accept[770] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 44, 41, 41, 17, 41, 41, 41, 41, 41, 41, 37, 37, 37, 37, 37, 41, 15, 41, 41, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 42, 37, 41, 29, 37, 3, 41, 41, 32, 30, 31, 41, 41, 20, 21, 0, 40, 0, 0, 0, 0, 0, 0, 0, 37, 0, 0, 0, 37, 37, 37, 37, 0, 0, 0, 0, 0, 16, 0, 0, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 37, 0, 0, 27, 0, 0, 0, 37, 0, 0, 0, 0, 0, 0, 30, 0, 31, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 37, 37, 37, 37, 37, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 16, 5, 16, 16, 16, 16, 16, 16, 0, 16, 16, 16, 16, 16, 16, 16, 0, 0, 0, 28, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 40, 0, 0, 0, 0, 0, 0, 0, 37, 37, 37, 37, 37, 0, 0, 0, 0, 23, 0, 0, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 38, 26, 0, 0, 0, 0, 0, 0, 25, 24, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 39, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 37, 37, 37, 37, 37, 13, 0, 0, 0, 0, 0, 0, 0, 0, 16, 16, 16, 16, 16, 8, 16, 16, 16, 16, 16, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 24, 24, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 37, 37, 13, 0, 0, 0, 0, 0, 0, 0, 16, 16, 16, 8, 16, 16, 16, 16, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 35, 35, 35, 0, 0, 0, 0, 0, 37, 37, 37, 37, 0, 0, 0, 0, 0, 0, 0, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 0, 0, 16, 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, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 35, 35, 35, 0, 4, 0, 0, 0, 0, 0, 0, 37, 0, 0, 37, 0, 37, 0, 37, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 16, 16, 0, 16, 0, 16, 16, 0, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 37, 37, 0, 37, 0, 0, 12, 36, 0, 0, 0, 0, 0, 0, 16, 16, 0, 16, 16, 16, 0, 0, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 37, 0, 0, 11, 11, 12, 0, 0, 0, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 11, 11, 0, 0, 0, 0, 16, 16, 16, 16, 16, 7, 10, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 11, 0, 0, 0, 16, 16, 16, 16, 7, 10, 16, 0, 0, 0, 0, 0, 0, 11, 0, 0, 0, 16, 16, 6, 16, 16, 0, 0, 0, 0, 0, 11, 0, 0, 0, 16, 16, 6, 6, 16, 0, 0, 0, 0, 11, 11, 11, 0, 0, 0, 16, 16, 0, 0, 0, 0, 4, 1, 0, 0, 16, 16, 16, 1, 0, 0, 0, 0, 16, 0, 16, 0, 11, 0, 0, 16, 16, 9, 0, 0, 0, 16, 16, 9, 0, 0, 0, 16, 0, 0, 0, 16, 0, 0, 0, 16, 0, 34, 0, 0, 16, 0, 0, 16, 0, 0, 16, 0, 0, 0, 0, 0, 22, 0, 19, 0 } ; static yyconst flex_int32_t yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 12, 13, 12, 12, 14, 15, 16, 17, 18, 19, 20, 20, 21, 22, 23, 23, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 53, 56, 1, 57, 1, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 53, 82, 83, 53, 1, 1, 1, 59, 1, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84 } ; static yyconst flex_int32_t yy_meta[85] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 9, 10, 11, 8, 12, 13, 14, 15, 15, 15, 15, 15, 15, 15, 16, 1, 17, 18, 1, 19, 20, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 22, 1, 1, 10, 5, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 22, 24 } ; static yyconst flex_int32_t yy_base[833] = { 0, 0, 84, 168, 1501, 252, 1484, 1464, 334, 348, 1434, 432, 1425, 503, 504, 0, 1413, 0, 516, 532, 1407, 1386, 5655, 578, 5655, 324, 505, 603, 612, 1365, 1336, 625, 627, 633, 648, 650, 676, 5655, 0, 1328, 655, 704, 706, 711, 745, 739, 774, 796, 781, 791, 814, 5655, 665, 1324, 821, 820, 5655, 889, 1321, 5655, 806, 852, 1271, 1270, 5655, 869, 594, 914, 903, 932, 941, 923, 1245, 611, 0, 954, 956, 971, 1225, 973, 978, 992, 1006, 1024, 1039, 1051, 606, 639, 1065, 1070, 1084, 1079, 1089, 1094, 1130, 1135, 1149, 1168, 1185, 1190, 1204, 1214, 1276, 1256, 1241, 1221, 1236, 648, 698, 686, 660, 668, 1287, 1238, 1313, 1357, 771, 1189, 0, 1263, 1278, 1293, 1305, 1169, 753, 1318, 1329, 725, 1339, 1394, 1423, 1432, 700, 1161, 1361, 1451, 0, 1449, 1468, 1470, 1485, 1469, 1533, 1152, 1166, 698, 1162, 833, 871, 1552, 0, 1503, 5655, 1566, 1571, 1573, 1580, 1588, 1630, 1642, 1655, 1657, 1664, 1666, 1683, 1721, 1723, 733, 737, 1151, 5655, 780, 811, 1112, 1774, 866, 1084, 823, 1715, 1581, 1749, 1768, 1174, 938, 952, 1346, 944, 1793, 969, 1108, 1097, 1061, 0, 5655, 904, 1519, 1845, 1854, 1688, 1081, 915, 1075, 1861, 1880, 1878, 1895, 1902, 1900, 1948, 1959, 1968, 938, 5655, 899, 987, 1987, 1985, 2002, 2020, 2009, 2011, 2038, 2061, 961, 2072, 2079, 2087, 2094, 2114, 2133, 2148, 5655, 5655, 949, 733, 1060, 1716, 1092, 1233, 5655, 5655, 2197, 1147, 1364, 1196, 1614, 1606, 1757, 1771, 1152, 1382, 1786, 1917, 1429, 1049, 1230, 1209, 1921, 1325, 1928, 1059, 1499, 1283, 1433, 1373, 2038, 1657, 2162, 1347, 2165, 2177, 1590, 1074, 2175, 1602, 2199, 2233, 2262, 1127, 1053, 2272, 2282, 2301, 0, 0, 2315, 2320, 2322, 644, 2344, 2371, 2380, 1033, 977, 1219, 2373, 2433, 0, 0, 2399, 2404, 2450, 0, 2414, 2455, 1358, 2460, 2469, 2489, 2484, 2518, 2524, 1115, 1550, 1518, 2221, 2238, 1452, 1684, 1787, 2259, 1725, 1496, 1772, 999, 5655, 5655, 2576, 2341, 1794, 1625, 1667, 1658, 2548, 645, 5655, 2576, 2613, 2642, 1007, 821, 981, 2651, 2731, 2664, 2681, 5655, 2665, 2682, 2696, 1589, 2147, 2113, 2811, 2750, 2761, 2785, 0, 2831, 1720, 2838, 2840, 2857, 2710, 2866, 2892, 1723, 1898, 1775, 2368, 1770, 1868, 1815, 2418, 946, 2944, 2055, 2513, 1920, 2884, 2199, 2773, 2892, 2521, 2072, 1724, 2883, 2121, 2963, 2246, 2374, 2243, 1912, 2304, 2761, 2056, 3015, 3022, 3029, 1761, 928, 912, 3048, 2926, 3128, 2934, 3046, 2955, 3059, 3068, 2842, 897, 1883, 2800, 2940, 3208, 3082, 3099, 3101, 3107, 3109, 1103, 3158, 3180, 3191, 3237, 3157, 3237, 2063, 2156, 2046, 2381, 2503, 1969, 2269, 2574, 2509, 2160, 2282, 2577, 1983, 3206, 2526, 3242, 3269, 2589, 2355, 3272, 3275, 2453, 2583, 2512, 2661, 3279, 2161, 3282, 881, 2486, 2698, 2451, 2148, 3285, 2482, 3302, 2573, 3312, 2678, 3315, 2682, 3318, 3330, 2264, 3306, 3179, 5655, 1986, 1131, 3327, 3344, 3399, 3479, 0, 0, 3349, 3366, 3559, 3639, 868, 0, 3368, 3373, 989, 3416, 3423, 3446, 2053, 3298, 2109, 3460, 3477, 3719, 3799, 0, 3500, 3498, 3879, 3533, 3959, 3532, 3574, 3610, 2511, 2742, 2759, 3366, 2882, 3387, 3395, 2701, 2757, 3426, 3457, 2850, 2866, 2928, 3537, 2796, 2894, 2945, 854, 3565, 2904, 2939, 2949, 3056, 3592, 2994, 5655, 2882, 858, 3238, 0, 3612, 3637, 0, 3620, 4039, 834, 1989, 1046, 1205, 5655, 3585, 3592, 787, 2184, 3517, 3115, 0, 3661, 4119, 772, 3223, 3284, 3687, 3058, 3040, 3702, 2615, 3322, 3434, 3102, 3454, 3067, 3482, 3612, 3161, 3613, 3489, 3683, 3656, 3601, 3652, 3700, 3662, 3403, 2231, 3733, 3738, 0, 780, 652, 737, 1260, 3778, 5655, 2275, 2663, 3762, 772, 3624, 3512, 3668, 3740, 3713, 776, 3816, 3759, 3561, 3653, 3753, 3739, 3697, 3734, 3760, 3831, 3804, 3773, 3842, 3801, 3851, 3859, 3399, 2354, 3857, 755, 1507, 5655, 3885, 773, 3805, 3914, 728, 3827, 3825, 3846, 3398, 1002, 0, 0, 3851, 1282, 3860, 3797, 3917, 3895, 3923, 3929, 3937, 3919, 746, 2363, 3935, 3941, 3963, 744, 3998, 3331, 3862, 3947, 1820, 3957, 0, 0, 3948, 4001, 3962, 3947, 3956, 700, 2517, 2703, 4050, 4005, 3807, 3974, 3977, 1517, 1928, 4013, 3970, 4072, 4079, 4067, 664, 4203, 4091, 4027, 4088, 4026, 4064, 1588, 1631, 653, 4068, 4131, 2929, 4287, 626, 631, 4028, 4098, 4118, 4154, 4111, 4115, 4092, 4141, 4153, 2928, 3526, 4162, 4183, 4196, 4150, 605, 4180, 4227, 2951, 4250, 4220, 4267, 4181, 4201, 2040, 3727, 3088, 4260, 4269, 4261, 4262, 0, 3866, 4276, 4306, 2327, 4205, 0, 4126, 4318, 4325, 4192, 525, 4327, 4346, 4289, 493, 4350, 4352, 4312, 311, 310, 4355, 4358, 4264, 4371, 4373, 4326, 4379, 4385, 2334, 4391, 4397, 4400, 4409, 4412, 5655, 4414, 5655, 5655, 4424, 4448, 4468, 4488, 4508, 4532, 4556, 4576, 4596, 4616, 4629, 4648, 4669, 4688, 4409, 4712, 4732, 879, 4750, 4773, 1163, 4796, 4813, 4832, 4852, 4876, 4900, 4924, 4948, 4972, 4990, 5010, 5030, 5050, 5070, 5090, 5110, 5130, 5150, 5174, 5194, 5198, 5218, 5238, 5257, 5276, 5296, 5316, 5340, 5360, 5380, 5400, 5421, 5424, 5445, 5464, 5488, 5512, 5535, 5558, 5582, 5606, 5630 } ; static yyconst flex_int32_t yy_def[833] = { 0, 769, 769, 769, 3, 769, 5, 3, 3, 769, 9, 769, 11, 11, 11, 11, 11, 3, 3, 769, 19, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 770, 770, 770, 770, 770, 769, 769, 771, 769, 772, 772, 772, 772, 772, 772, 772, 772, 772, 772, 772, 769, 773, 769, 769, 774, 769, 775, 776, 769, 777, 778, 769, 769, 769, 779, 769, 769, 769, 769, 769, 769, 769, 769, 780, 770, 770, 781, 769, 770, 770, 770, 770, 769, 769, 769, 769, 782, 772, 772, 783, 772, 772, 772, 772, 772, 772, 772, 772, 772, 772, 772, 772, 772, 772, 773, 773, 784, 769, 769, 769, 769, 774, 769, 774, 785, 786, 776, 787, 777, 777, 778, 778, 769, 782, 779, 779, 769, 769, 769, 769, 769, 769, 780, 788, 781, 135, 770, 770, 770, 770, 769, 769, 769, 769, 769, 782, 782, 782, 783, 149, 772, 769, 772, 772, 772, 772, 772, 772, 149, 772, 772, 772, 772, 772, 772, 772, 784, 784, 769, 769, 769, 769, 785, 785, 789, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 786, 769, 786, 790, 769, 791, 769, 769, 769, 769, 769, 769, 769, 792, 793, 770, 770, 770, 770, 769, 769, 769, 769, 769, 782, 782, 794, 772, 772, 772, 772, 772, 772, 772, 149, 772, 772, 772, 772, 772, 772, 772, 769, 769, 769, 769, 785, 785, 785, 785, 769, 769, 174, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 795, 796, 785, 785, 785, 785, 785, 785, 785, 785, 769, 786, 769, 791, 791, 769, 769, 769, 769, 769, 792, 792, 793, 282, 282, 770, 770, 770, 769, 769, 769, 769, 769, 769, 782, 782, 794, 296, 296, 772, 772, 772, 797, 772, 772, 149, 772, 772, 772, 772, 772, 772, 769, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 795, 769, 769, 798, 785, 785, 785, 785, 785, 769, 786, 769, 769, 769, 769, 769, 769, 799, 800, 801, 770, 770, 769, 769, 769, 769, 769, 782, 782, 802, 772, 772, 772, 797, 772, 149, 772, 772, 772, 772, 772, 772, 785, 785, 785, 785, 785, 785, 785, 785, 798, 798, 796, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 785, 785, 785, 785, 769, 786, 769, 769, 769, 769, 799, 769, 803, 804, 805, 806, 770, 770, 769, 769, 769, 769, 769, 782, 782, 807, 808, 772, 772, 772, 772, 149, 772, 772, 772, 149, 149, 772, 785, 785, 785, 785, 785, 785, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 809, 796, 798, 798, 798, 798, 798, 798, 798, 798, 785, 785, 785, 785, 769, 786, 769, 769, 769, 769, 769, 804, 804, 810, 803, 811, 480, 806, 806, 812, 805, 811, 486, 813, 770, 814, 769, 769, 769, 769, 782, 782, 808, 808, 815, 807, 501, 816, 772, 817, 772, 817, 507, 772, 772, 507, 507, 785, 785, 785, 785, 785, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 818, 798, 798, 798, 798, 798, 785, 785, 769, 819, 769, 769, 480, 820, 821, 486, 806, 813, 546, 822, 814, 814, 769, 769, 769, 769, 769, 782, 782, 501, 808, 816, 560, 507, 507, 507, 507, 507, 772, 507, 507, 785, 785, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 785, 819, 769, 821, 821, 823, 486, 822, 822, 822, 824, 769, 769, 782, 782, 501, 507, 507, 507, 507, 507, 507, 772, 507, 507, 785, 785, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 785, 819, 769, 825, 486, 822, 769, 824, 769, 782, 782, 501, 507, 507, 507, 507, 507, 826, 827, 507, 507, 785, 798, 798, 798, 798, 798, 798, 798, 819, 769, 825, 825, 822, 769, 782, 782, 507, 507, 507, 507, 826, 827, 507, 785, 798, 798, 798, 769, 769, 822, 769, 782, 782, 507, 507, 828, 507, 507, 798, 798, 798, 769, 769, 829, 769, 782, 782, 507, 507, 828, 828, 507, 798, 769, 769, 829, 830, 697, 822, 769, 782, 782, 507, 507, 507, 798, 769, 769, 822, 769, 782, 782, 507, 507, 507, 769, 769, 822, 782, 782, 507, 507, 507, 769, 822, 782, 782, 507, 507, 831, 769, 782, 782, 507, 507, 831, 769, 782, 782, 507, 769, 782, 782, 507, 832, 782, 782, 507, 832, 832, 782, 782, 507, 782, 782, 507, 782, 782, 507, 782, 782, 782, 782, 782, 769, 782, 769, 0, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769 } ; static yyconst flex_int32_t yy_nxt[5740] = { 0, 22, 23, 24, 23, 22, 22, 22, 25, 22, 22, 22, 22, 22, 22, 22, 22, 26, 26, 27, 28, 28, 28, 28, 22, 22, 29, 30, 22, 22, 22, 31, 32, 33, 31, 31, 34, 31, 31, 31, 31, 31, 31, 31, 35, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 36, 22, 22, 22, 31, 32, 33, 31, 31, 34, 31, 31, 31, 31, 31, 31, 31, 35, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 22, 23, 37, 23, 22, 38, 22, 25, 22, 22, 22, 22, 22, 39, 22, 22, 26, 26, 27, 28, 28, 28, 28, 22, 22, 29, 30, 22, 22, 22, 40, 41, 42, 43, 40, 44, 40, 40, 45, 40, 40, 40, 46, 47, 40, 40, 40, 48, 49, 50, 40, 40, 40, 40, 40, 36, 22, 22, 22, 40, 41, 42, 43, 40, 44, 40, 40, 45, 40, 40, 40, 46, 47, 40, 40, 40, 48, 49, 50, 40, 40, 40, 40, 40, 22, 22, 51, 22, 22, 22, 22, 25, 22, 22, 22, 22, 22, 22, 22, 22, 26, 26, 27, 28, 28, 28, 28, 22, 22, 29, 22, 22, 22, 22, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 36, 22, 22, 22, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 22, 22, 51, 22, 22, 22, 22, 25, 22, 53, 22, 22, 22, 22, 22, 22, 26, 26, 27, 28, 28, 28, 28, 22, 22, 54, 22, 22, 22, 22, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 36, 22, 22, 22, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 56, 751, 751, 57, 67, 67, 67, 67, 67, 67, 67, 39, 22, 22, 51, 22, 22, 22, 22, 25, 22, 22, 22, 22, 22, 22, 22, 58, 26, 26, 27, 28, 28, 28, 28, 22, 22, 29, 22, 59, 22, 22, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 36, 22, 22, 22, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 22, 22, 51, 22, 22, 22, 22, 25, 22, 22, 22, 22, 22, 22, 22, 22, 26, 26, 27, 28, 28, 28, 28, 22, 22, 29, 22, 59, 22, 22, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 36, 22, 22, 22, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 62, 63, 64, 68, 751, 69, 69, 69, 69, 69, 69, 69, 746, 39, 22, 22, 22, 22, 51, 22, 22, 22, 22, 25, 22, 22, 22, 22, 22, 22, 22, 22, 26, 26, 27, 28, 28, 28, 28, 22, 22, 29, 22, 22, 22, 22, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 36, 22, 22, 22, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 66, 68, 723, 70, 70, 70, 70, 71, 72, 72, 68, 127, 72, 72, 72, 72, 72, 72, 72, 76, 698, 76, 77, 76, 77, 76, 146, 76, 132, 66, 77, 76, 145, 346, 190, 78, 148, 78, 401, 591, 127, 592, 76, 78, 76, 77, 76, 77, 76, 89, 706, 696, 90, 89, 80, 79, 74, 132, 78, 106, 78, 145, 106, 106, 82, 78, 76, 76, 76, 76, 81, 170, 170, 170, 76, 76, 83, 83, 84, 85, 85, 85, 85, 80, 79, 168, 395, 683, 171, 76, 76, 76, 76, 82, 172, 169, 89, 89, 89, 81, 89, 90, 89, 90, 89, 89, 106, 106, 90, 89, 194, 194, 194, 168, 78, 132, 78, 171, 170, 170, 170, 78, 92, 172, 626, 95, 769, 93, 200, 96, 211, 672, 91, 89, 94, 669, 90, 89, 78, 89, 146, 231, 90, 89, 132, 89, 89, 89, 89, 78, 148, 92, 89, 89, 95, 78, 93, 200, 96, 211, 190, 91, 655, 94, 193, 78, 99, 97, 89, 632, 769, 90, 89, 149, 769, 89, 98, 625, 90, 89, 89, 89, 487, 638, 78, 89, 89, 89, 90, 89, 89, 78, 100, 90, 89, 99, 97, 191, 769, 102, 120, 78, 769, 120, 120, 98, 78, 233, 89, 108, 101, 90, 89, 113, 114, 89, 89, 114, 114, 212, 146, 100, 89, 89, 78, 103, 191, 551, 102, 115, 213, 234, 89, 89, 175, 109, 233, 89, 89, 101, 110, 244, 104, 111, 487, 586, 122, 120, 120, 122, 122, 240, 240, 240, 103, 89, 89, 212, 146, 399, 234, 114, 114, 126, 109, 457, 126, 126, 214, 110, 244, 104, 111, 86, 86, 241, 86, 192, 86, 86, 74, 86, 86, 192, 86, 212, 146, 399, 86, 194, 194, 194, 457, 122, 122, 408, 294, 86, 86, 86, 86, 86, 86, 129, 129, 130, 131, 131, 131, 131, 126, 126, 128, 274, 67, 67, 67, 67, 67, 67, 67, 68, 476, 72, 72, 72, 72, 72, 86, 86, 68, 278, 72, 72, 72, 72, 72, 72, 72, 68, 401, 72, 72, 72, 72, 72, 72, 72, 76, 175, 76, 77, 76, 76, 76, 175, 258, 376, 293, 75, 278, 134, 263, 175, 78, 76, 78, 76, 135, 76, 77, 76, 76, 212, 146, 77, 76, 259, 549, 305, 175, 78, 312, 78, 295, 258, 76, 293, 78, 77, 76, 263, 138, 401, 269, 76, 76, 76, 76, 149, 76, 74, 78, 77, 76, 336, 259, 137, 305, 639, 261, 312, 76, 76, 76, 76, 78, 139, 350, 76, 76, 138, 141, 269, 85, 85, 85, 85, 85, 85, 85, 289, 140, 76, 76, 769, 137, 141, 75, 142, 142, 142, 142, 143, 144, 144, 139, 76, 76, 141, 190, 144, 144, 144, 144, 144, 144, 144, 769, 89, 175, 140, 90, 89, 89, 341, 118, 89, 89, 320, 261, 175, 88, 89, 134, 78, 90, 89, 89, 196, 78, 149, 89, 89, 270, 242, 90, 89, 89, 78, 279, 90, 89, 271, 78, 175, 152, 190, 320, 78, 170, 170, 170, 175, 78, 279, 89, 89, 153, 242, 256, 89, 89, 151, 242, 243, 540, 540, 540, 279, 89, 89, 271, 175, 89, 89, 89, 90, 89, 89, 89, 89, 90, 89, 279, 89, 89, 153, 242, 256, 78, 507, 151, 89, 243, 78, 90, 89, 232, 146, 141, 88, 144, 144, 144, 144, 144, 154, 175, 78, 340, 272, 89, 175, 141, 90, 89, 272, 155, 507, 317, 89, 89, 201, 156, 313, 89, 89, 78, 89, 193, 118, 90, 89, 89, 175, 154, 159, 89, 340, 89, 89, 256, 157, 595, 78, 257, 155, 89, 317, 78, 90, 89, 156, 313, 212, 146, 175, 89, 89, 89, 90, 89, 158, 78, 106, 294, 769, 106, 106, 175, 256, 157, 314, 78, 257, 89, 89, 107, 322, 106, 89, 89, 106, 106, 89, 160, 74, 90, 89, 161, 175, 158, 68, 175, 89, 89, 626, 152, 627, 89, 78, 314, 90, 89, 89, 89, 120, 322, 321, 120, 120, 106, 106, 262, 160, 78, 124, 123, 161, 89, 166, 120, 90, 89, 120, 120, 106, 106, 149, 113, 114, 89, 89, 114, 114, 78, 122, 321, 152, 122, 122, 162, 262, 175, 163, 115, 89, 89, 122, 166, 328, 122, 122, 120, 120, 769, 114, 164, 165, 114, 114, 126, 118, 107, 126, 126, 89, 89, 120, 120, 162, 769, 126, 163, 87, 126, 126, 114, 114, 328, 260, 260, 260, 122, 122, 175, 164, 165, 195, 195, 195, 195, 195, 195, 195, 122, 122, 74, 260, 260, 260, 323, 73, 114, 114, 174, 261, 175, 126, 126, 202, 202, 202, 202, 202, 202, 202, 175, 769, 126, 126, 176, 177, 178, 261, 179, 262, 180, 181, 332, 323, 182, 183, 175, 184, 185, 359, 330, 186, 187, 188, 196, 175, 131, 131, 131, 131, 131, 131, 131, 176, 177, 178, 39, 179, 262, 180, 181, 332, 39, 182, 183, 318, 184, 185, 359, 330, 186, 187, 188, 196, 39, 197, 197, 197, 197, 198, 199, 199, 196, 39, 199, 199, 199, 199, 199, 199, 199, 75, 175, 134, 318, 76, 175, 76, 77, 76, 135, 76, 56, 203, 203, 203, 203, 203, 203, 203, 329, 78, 319, 78, 76, 175, 76, 77, 76, 77, 76, 208, 208, 209, 210, 210, 210, 210, 204, 368, 78, 76, 78, 39, 77, 76, 326, 240, 326, 329, 206, 319, 76, 76, 76, 76, 626, 78, 769, 89, 39, 205, 90, 89, 691, 207, 691, 204, 368, 175, 327, 76, 76, 76, 76, 78, 372, 769, 769, 206, 75, 195, 195, 195, 195, 195, 195, 195, 76, 76, 205, 175, 216, 141, 207, 144, 144, 144, 144, 144, 144, 144, 88, 769, 134, 372, 89, 89, 89, 769, 769, 149, 89, 367, 215, 215, 215, 215, 215, 215, 215, 216, 89, 175, 78, 90, 89, 89, 366, 89, 90, 89, 90, 89, 769, 691, 89, 691, 78, 90, 89, 190, 367, 78, 89, 78, 769, 90, 89, 769, 769, 769, 78, 219, 175, 89, 89, 366, 769, 217, 78, 260, 260, 260, 220, 249, 218, 412, 221, 89, 89, 250, 334, 769, 89, 89, 89, 89, 769, 175, 769, 88, 219, 89, 89, 769, 89, 261, 217, 90, 89, 89, 89, 220, 249, 218, 412, 221, 175, 315, 250, 334, 78, 316, 150, 150, 150, 150, 150, 150, 150, 89, 391, 89, 90, 89, 90, 89, 222, 769, 89, 769, 89, 90, 89, 90, 89, 78, 315, 78, 175, 175, 316, 89, 89, 223, 78, 225, 78, 89, 175, 391, 90, 89, 226, 393, 227, 222, 196, 224, 199, 199, 199, 199, 199, 78, 331, 175, 89, 89, 89, 89, 392, 228, 223, 769, 225, 89, 89, 89, 89, 769, 369, 226, 393, 227, 769, 89, 224, 89, 90, 89, 90, 89, 331, 769, 89, 89, 175, 175, 769, 392, 228, 78, 245, 78, 175, 376, 175, 246, 246, 369, 247, 247, 260, 260, 260, 421, 230, 428, 248, 455, 251, 251, 251, 251, 251, 229, 260, 260, 260, 371, 175, 245, 89, 89, 89, 89, 246, 246, 261, 247, 247, 260, 260, 260, 421, 230, 428, 248, 455, 175, 252, 175, 261, 175, 229, 175, 175, 253, 371, 235, 475, 236, 430, 179, 254, 255, 431, 261, 175, 237, 183, 370, 184, 238, 175, 175, 373, 264, 188, 252, 265, 266, 390, 769, 267, 268, 253, 149, 235, 475, 236, 430, 179, 254, 255, 431, 175, 677, 237, 183, 370, 184, 238, 769, 769, 373, 264, 188, 769, 265, 266, 390, 433, 267, 268, 275, 275, 276, 277, 277, 277, 277, 196, 769, 199, 199, 199, 199, 199, 199, 199, 281, 281, 281, 281, 281, 281, 281, 75, 769, 280, 433, 76, 769, 76, 77, 76, 282, 76, 175, 283, 283, 283, 283, 283, 283, 283, 769, 78, 76, 78, 769, 77, 76, 76, 285, 76, 77, 76, 77, 76, 432, 260, 260, 260, 78, 260, 260, 260, 175, 288, 495, 78, 260, 260, 260, 429, 769, 769, 76, 76, 76, 76, 175, 285, 149, 468, 286, 261, 287, 432, 376, 261, 769, 769, 302, 76, 76, 440, 261, 495, 76, 76, 76, 76, 429, 289, 75, 210, 210, 210, 210, 210, 210, 210, 468, 286, 289, 287, 290, 290, 290, 290, 291, 292, 292, 289, 440, 292, 292, 292, 292, 292, 292, 292, 88, 591, 280, 592, 89, 175, 89, 90, 89, 296, 89, 517, 297, 297, 297, 297, 297, 297, 297, 376, 78, 89, 78, 769, 90, 89, 594, 299, 89, 539, 89, 90, 89, 90, 89, 519, 769, 78, 769, 89, 517, 302, 90, 89, 78, 769, 78, 769, 260, 260, 260, 89, 89, 89, 89, 78, 299, 89, 539, 300, 90, 89, 149, 301, 519, 326, 240, 326, 89, 89, 190, 303, 731, 78, 261, 89, 89, 89, 89, 88, 89, 769, 175, 90, 89, 769, 89, 89, 300, 327, 304, 89, 301, 152, 90, 89, 78, 471, 89, 175, 303, 90, 89, 515, 89, 89, 89, 78, 376, 90, 89, 306, 555, 89, 288, 454, 90, 89, 513, 304, 212, 557, 78, 769, 212, 146, 471, 89, 89, 78, 769, 213, 515, 89, 307, 213, 90, 89, 89, 89, 306, 555, 769, 769, 454, 89, 89, 513, 769, 78, 308, 769, 89, 89, 89, 90, 89, 376, 212, 146, 89, 89, 769, 307, 459, 414, 309, 89, 78, 213, 90, 89, 260, 260, 260, 260, 260, 260, 769, 308, 89, 89, 769, 78, 376, 769, 769, 769, 532, 310, 413, 311, 175, 459, 414, 309, 376, 376, 261, 89, 89, 261, 333, 333, 333, 333, 333, 333, 333, 769, 769, 335, 514, 528, 89, 89, 458, 532, 310, 413, 311, 174, 336, 769, 277, 277, 277, 277, 277, 277, 277, 260, 260, 260, 769, 376, 596, 176, 177, 178, 769, 514, 528, 180, 181, 458, 445, 182, 260, 260, 260, 185, 446, 769, 186, 187, 336, 261, 337, 337, 337, 337, 338, 339, 339, 596, 176, 177, 178, 260, 260, 260, 180, 181, 261, 445, 182, 623, 190, 175, 185, 446, 376, 186, 187, 336, 467, 339, 339, 339, 339, 339, 339, 339, 342, 261, 465, 281, 281, 281, 281, 281, 281, 281, 342, 376, 623, 281, 281, 281, 281, 281, 281, 281, 75, 467, 280, 538, 376, 438, 76, 769, 769, 343, 76, 465, 283, 283, 283, 283, 283, 283, 283, 629, 76, 518, 78, 77, 76, 76, 175, 76, 77, 76, 77, 76, 538, 469, 438, 149, 78, 260, 260, 260, 344, 78, 149, 78, 769, 677, 769, 82, 629, 345, 518, 769, 677, 76, 76, 347, 347, 348, 349, 349, 349, 349, 469, 261, 260, 260, 260, 76, 76, 344, 212, 146, 76, 76, 76, 76, 82, 376, 345, 75, 289, 294, 292, 292, 292, 292, 292, 292, 292, 289, 261, 292, 292, 292, 292, 292, 175, 523, 651, 351, 670, 466, 352, 175, 89, 769, 769, 90, 89, 89, 516, 769, 90, 89, 260, 260, 260, 769, 769, 89, 78, 769, 90, 89, 354, 78, 523, 651, 351, 670, 466, 352, 88, 355, 280, 78, 769, 769, 89, 516, 261, 353, 89, 358, 297, 297, 297, 297, 297, 297, 297, 89, 89, 354, 78, 89, 89, 89, 90, 89, 89, 769, 355, 90, 89, 89, 89, 89, 90, 89, 769, 78, 358, 376, 89, 376, 78, 90, 89, 769, 101, 78, 326, 240, 326, 89, 89, 531, 356, 89, 78, 360, 90, 89, 89, 524, 769, 90, 89, 260, 260, 260, 89, 89, 376, 78, 327, 89, 89, 101, 78, 88, 89, 89, 769, 361, 531, 356, 362, 149, 360, 89, 89, 89, 524, 261, 90, 89, 363, 89, 533, 376, 90, 89, 376, 376, 89, 89, 452, 78, 568, 89, 89, 376, 361, 78, 394, 362, 376, 438, 452, 365, 526, 684, 453, 439, 364, 363, 533, 333, 333, 333, 333, 333, 333, 333, 769, 452, 520, 568, 89, 89, 521, 456, 456, 456, 89, 89, 438, 452, 365, 526, 684, 453, 439, 364, 375, 396, 396, 397, 398, 398, 398, 398, 769, 376, 376, 520, 376, 457, 769, 521, 377, 378, 379, 376, 380, 442, 381, 382, 443, 376, 383, 384, 525, 385, 386, 534, 522, 387, 388, 389, 336, 149, 339, 339, 339, 339, 339, 339, 339, 377, 378, 379, 769, 380, 442, 381, 382, 443, 769, 383, 384, 525, 385, 386, 534, 522, 387, 388, 389, 336, 280, 339, 339, 339, 339, 339, 607, 342, 212, 630, 281, 281, 281, 281, 281, 281, 281, 76, 769, 213, 77, 76, 408, 769, 349, 349, 349, 349, 349, 349, 349, 376, 769, 78, 76, 607, 769, 77, 76, 408, 527, 409, 409, 409, 409, 410, 411, 411, 175, 626, 78, 627, 175, 408, 406, 411, 411, 411, 411, 411, 411, 411, 769, 89, 76, 76, 425, 89, 376, 527, 535, 376, 536, 407, 685, 530, 572, 403, 75, 78, 280, 76, 76, 406, 76, 769, 769, 343, 76, 769, 283, 283, 283, 283, 283, 283, 283, 769, 149, 535, 78, 536, 407, 89, 530, 572, 90, 89, 769, 769, 89, 89, 769, 769, 89, 569, 769, 90, 89, 78, 470, 470, 470, 470, 470, 470, 470, 376, 769, 175, 78, 76, 76, 447, 447, 447, 447, 447, 89, 769, 417, 90, 89, 376, 569, 212, 146, 769, 769, 573, 89, 89, 570, 418, 78, 769, 213, 405, 88, 769, 280, 89, 89, 448, 89, 769, 376, 353, 89, 417, 297, 297, 297, 297, 297, 297, 297, 419, 573, 496, 78, 570, 418, 769, 89, 89, 89, 90, 89, 577, 769, 89, 448, 89, 90, 89, 90, 89, 769, 408, 78, 411, 411, 411, 411, 411, 419, 78, 496, 78, 89, 89, 89, 90, 89, 422, 769, 423, 577, 89, 376, 420, 426, 89, 769, 769, 78, 456, 456, 456, 190, 89, 89, 769, 574, 78, 376, 416, 89, 89, 89, 89, 769, 424, 422, 89, 423, 769, 90, 89, 420, 575, 175, 457, 376, 769, 769, 89, 89, 571, 441, 78, 376, 574, 376, 442, 89, 89, 443, 769, 449, 578, 424, 458, 376, 585, 444, 450, 451, 478, 575, 580, 478, 478, 427, 212, 146, 484, 571, 441, 489, 484, 89, 89, 442, 481, 213, 443, 376, 449, 578, 576, 458, 487, 585, 444, 450, 451, 76, 376, 580, 77, 76, 427, 376, 376, 497, 709, 434, 376, 435, 718, 380, 581, 491, 725, 478, 478, 436, 384, 576, 385, 437, 376, 484, 484, 460, 389, 579, 461, 462, 582, 769, 463, 464, 497, 709, 434, 769, 435, 718, 380, 581, 769, 725, 76, 76, 436, 384, 769, 385, 437, 769, 769, 175, 460, 389, 579, 461, 462, 582, 584, 463, 464, 398, 398, 398, 398, 398, 398, 398, 472, 472, 472, 472, 473, 474, 474, 474, 474, 474, 474, 474, 474, 474, 477, 149, 280, 769, 76, 584, 478, 77, 76, 479, 478, 769, 480, 480, 480, 480, 480, 480, 480, 149, 78, 605, 481, 492, 492, 493, 494, 494, 494, 494, 408, 376, 411, 411, 411, 411, 411, 411, 411, 626, 499, 627, 376, 503, 499, 583, 769, 769, 490, 612, 605, 76, 76, 478, 478, 604, 487, 89, 769, 89, 90, 89, 90, 89, 594, 89, 146, 89, 505, 89, 90, 89, 769, 78, 583, 491, 490, 175, 612, 477, 483, 78, 280, 78, 604, 769, 484, 499, 499, 485, 484, 769, 486, 486, 486, 486, 486, 486, 486, 610, 769, 504, 487, 769, 89, 89, 89, 89, 598, 769, 769, 506, 89, 89, 89, 89, 89, 769, 769, 508, 89, 150, 150, 150, 150, 150, 150, 150, 610, 504, 769, 769, 78, 484, 484, 769, 376, 598, 89, 506, 769, 90, 89, 474, 474, 474, 474, 474, 769, 89, 512, 614, 90, 89, 78, 456, 456, 456, 769, 483, 498, 509, 280, 89, 89, 78, 499, 769, 769, 500, 499, 510, 501, 501, 501, 501, 501, 501, 501, 512, 614, 457, 487, 769, 149, 89, 89, 540, 540, 540, 509, 456, 456, 456, 769, 89, 89, 89, 90, 89, 510, 150, 150, 150, 150, 150, 150, 150, 152, 600, 769, 78, 78, 499, 499, 769, 769, 457, 456, 456, 456, 456, 456, 456, 456, 456, 456, 511, 456, 456, 456, 456, 456, 456, 456, 456, 456, 769, 600, 498, 769, 769, 89, 89, 457, 149, 769, 457, 212, 146, 457, 456, 456, 456, 457, 769, 511, 457, 769, 213, 457, 456, 456, 456, 260, 260, 260, 260, 260, 260, 474, 474, 474, 474, 474, 474, 474, 457, 769, 601, 537, 212, 674, 149, 556, 478, 602, 457, 478, 478, 261, 769, 213, 261, 470, 470, 470, 470, 470, 470, 470, 481, 478, 769, 769, 478, 478, 484, 601, 769, 489, 484, 769, 556, 602, 260, 260, 260, 769, 608, 483, 769, 134, 487, 484, 769, 484, 484, 484, 546, 484, 76, 478, 478, 77, 76, 260, 260, 260, 769, 78, 261, 78, 769, 260, 260, 260, 548, 608, 478, 478, 477, 190, 280, 484, 484, 190, 478, 769, 149, 479, 478, 261, 480, 480, 480, 480, 480, 480, 480, 261, 484, 484, 484, 484, 456, 456, 456, 76, 76, 494, 494, 494, 494, 494, 494, 494, 552, 552, 552, 552, 553, 554, 554, 622, 661, 650, 769, 769, 483, 769, 457, 769, 769, 478, 478, 456, 456, 456, 175, 554, 554, 554, 554, 554, 554, 554, 769, 499, 769, 551, 503, 499, 622, 661, 650, 609, 551, 769, 376, 542, 477, 457, 280, 487, 499, 769, 478, 499, 499, 479, 478, 611, 480, 480, 480, 480, 480, 480, 480, 551, 78, 498, 481, 134, 609, 89, 376, 499, 90, 89, 560, 499, 613, 376, 499, 499, 212, 146, 769, 769, 611, 548, 149, 78, 540, 540, 719, 213, 627, 616, 769, 499, 499, 478, 478, 456, 456, 456, 769, 634, 89, 613, 149, 564, 89, 150, 150, 150, 150, 150, 150, 150, 89, 89, 499, 499, 78, 597, 616, 477, 483, 457, 280, 456, 456, 456, 484, 566, 634, 485, 484, 149, 486, 486, 486, 486, 486, 486, 486, 769, 498, 89, 78, 769, 90, 89, 597, 89, 89, 457, 260, 260, 260, 769, 152, 641, 566, 78, 554, 554, 554, 554, 554, 554, 554, 554, 554, 554, 554, 554, 456, 456, 456, 484, 484, 769, 261, 89, 769, 478, 90, 89, 478, 478, 641, 376, 769, 484, 89, 89, 489, 484, 618, 78, 149, 481, 457, 376, 551, 545, 483, 567, 280, 487, 588, 551, 484, 588, 588, 485, 484, 769, 486, 486, 486, 486, 486, 486, 486, 615, 769, 618, 487, 589, 89, 89, 478, 478, 499, 633, 567, 503, 499, 769, 484, 484, 376, 175, 149, 619, 376, 456, 456, 456, 487, 617, 175, 769, 615, 621, 769, 588, 588, 484, 484, 769, 769, 149, 633, 642, 150, 150, 150, 150, 150, 150, 150, 457, 619, 89, 635, 769, 90, 89, 617, 499, 499, 603, 621, 483, 498, 376, 280, 149, 376, 78, 499, 769, 642, 500, 499, 620, 501, 501, 501, 501, 501, 501, 501, 635, 588, 644, 78, 588, 588, 588, 603, 606, 588, 588, 149, 260, 260, 260, 637, 769, 89, 89, 376, 589, 620, 212, 146, 376, 769, 732, 769, 636, 769, 149, 644, 769, 213, 499, 499, 769, 606, 261, 626, 645, 627, 593, 643, 637, 376, 593, 593, 588, 588, 593, 593, 646, 588, 588, 732, 631, 636, 376, 593, 559, 498, 593, 280, 593, 640, 146, 499, 146, 645, 500, 499, 643, 501, 501, 501, 501, 501, 501, 501, 648, 646, 376, 487, 89, 631, 376, 90, 89, 376, 456, 456, 456, 593, 640, 647, 149, 639, 149, 769, 78, 456, 456, 456, 769, 666, 649, 769, 656, 648, 456, 456, 456, 688, 499, 499, 457, 149, 260, 260, 260, 769, 149, 769, 647, 653, 659, 457, 653, 653, 658, 89, 89, 149, 666, 649, 457, 656, 660, 664, 498, 88, 688, 134, 261, 175, 626, 89, 627, 593, 149, 89, 665, 593, 593, 659, 769, 593, 593, 658, 769, 769, 738, 78, 675, 769, 593, 660, 664, 593, 562, 654, 653, 653, 212, 146, 456, 456, 456, 769, 376, 665, 456, 456, 456, 213, 563, 667, 456, 456, 456, 738, 769, 675, 89, 89, 456, 456, 456, 562, 593, 769, 457, 653, 376, 769, 653, 653, 457, 653, 769, 668, 653, 653, 457, 563, 667, 657, 149, 149, 88, 88, 457, 134, 626, 769, 627, 89, 149, 769, 565, 89, 376, 215, 215, 215, 215, 215, 215, 215, 668, 376, 679, 78, 682, 149, 657, 376, 149, 678, 653, 653, 671, 676, 681, 376, 653, 653, 212, 146, 260, 260, 260, 769, 680, 212, 146, 671, 769, 213, 690, 679, 769, 682, 89, 89, 213, 694, 678, 769, 689, 671, 676, 681, 149, 769, 261, 212, 702, 626, 769, 627, 673, 680, 769, 769, 671, 149, 213, 690, 88, 483, 769, 134, 769, 693, 694, 484, 687, 689, 546, 484, 710, 590, 590, 590, 590, 590, 590, 590, 769, 673, 704, 78, 686, 686, 686, 686, 686, 686, 686, 456, 456, 456, 693, 149, 769, 687, 456, 456, 456, 695, 695, 695, 695, 695, 695, 695, 212, 146, 769, 704, 701, 376, 484, 484, 705, 457, 769, 213, 707, 769, 769, 149, 457, 686, 686, 686, 686, 686, 686, 686, 711, 711, 711, 711, 711, 711, 711, 146, 483, 498, 149, 134, 703, 705, 149, 499, 716, 707, 560, 499, 708, 599, 599, 599, 599, 599, 599, 599, 456, 456, 456, 78, 769, 695, 695, 695, 695, 695, 695, 695, 769, 703, 212, 146, 742, 716, 714, 769, 715, 149, 769, 769, 712, 213, 457, 717, 717, 717, 717, 717, 717, 717, 499, 499, 711, 711, 711, 711, 711, 711, 711, 212, 146, 742, 722, 714, 713, 715, 769, 149, 149, 712, 213, 769, 212, 146, 769, 769, 498, 400, 400, 149, 697, 400, 698, 213, 400, 400, 400, 724, 149, 400, 769, 722, 149, 713, 769, 720, 212, 146, 769, 729, 769, 400, 400, 537, 400, 700, 400, 213, 769, 730, 745, 741, 769, 721, 769, 769, 724, 717, 717, 717, 717, 717, 717, 717, 720, 540, 540, 719, 729, 769, 727, 769, 400, 400, 769, 400, 212, 146, 730, 745, 741, 769, 721, 212, 146, 212, 146, 213, 149, 149, 726, 149, 212, 146, 213, 769, 213, 769, 769, 727, 400, 400, 400, 213, 697, 400, 400, 769, 400, 400, 400, 728, 769, 400, 769, 769, 149, 733, 735, 736, 739, 757, 212, 146, 769, 400, 400, 769, 400, 700, 400, 769, 734, 213, 212, 146, 749, 769, 769, 149, 728, 212, 146, 212, 146, 213, 733, 735, 736, 739, 757, 769, 213, 149, 213, 769, 400, 400, 769, 400, 769, 734, 212, 146, 754, 749, 212, 146, 212, 146, 740, 212, 146, 213, 212, 146, 760, 213, 769, 753, 769, 743, 213, 769, 400, 756, 744, 212, 146, 212, 146, 747, 769, 754, 748, 212, 146, 769, 758, 740, 759, 212, 146, 755, 769, 760, 761, 212, 146, 769, 743, 752, 762, 212, 146, 744, 212, 146, 763, 769, 747, 769, 769, 748, 764, 766, 146, 765, 212, 146, 768, 146, 755, 769, 769, 769, 294, 167, 769, 767, 752, 294, 75, 167, 769, 167, 769, 75, 769, 75, 75, 769, 75, 769, 769, 75, 769, 769, 75, 75, 75, 75, 86, 86, 769, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 88, 769, 769, 769, 769, 88, 769, 88, 88, 769, 88, 769, 769, 88, 769, 769, 88, 88, 88, 88, 105, 769, 769, 769, 769, 105, 769, 105, 105, 769, 105, 769, 769, 769, 769, 769, 105, 105, 105, 105, 112, 769, 769, 769, 112, 112, 769, 112, 112, 769, 112, 769, 112, 769, 769, 769, 112, 112, 112, 112, 116, 116, 769, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, 117, 769, 769, 769, 117, 117, 117, 117, 117, 117, 117, 117, 117, 769, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 119, 769, 769, 769, 769, 119, 769, 119, 119, 769, 119, 769, 769, 769, 769, 769, 119, 119, 119, 119, 121, 769, 769, 769, 769, 121, 769, 121, 121, 769, 121, 769, 769, 769, 769, 769, 121, 121, 121, 121, 125, 769, 769, 769, 769, 125, 769, 125, 125, 769, 125, 769, 769, 769, 769, 769, 125, 125, 125, 125, 133, 769, 769, 133, 769, 769, 769, 769, 769, 133, 133, 133, 136, 769, 136, 769, 769, 136, 769, 136, 136, 769, 136, 769, 769, 136, 769, 769, 136, 136, 136, 136, 147, 769, 769, 147, 769, 769, 147, 147, 147, 147, 147, 147, 147, 769, 147, 147, 769, 147, 147, 147, 150, 769, 150, 769, 769, 150, 769, 150, 150, 769, 150, 769, 769, 150, 769, 769, 150, 150, 150, 150, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 189, 189, 769, 189, 769, 189, 769, 189, 189, 769, 189, 189, 769, 769, 769, 769, 189, 189, 189, 189, 134, 769, 769, 769, 769, 134, 769, 769, 134, 769, 769, 769, 769, 769, 134, 134, 134, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 239, 273, 273, 273, 769, 769, 769, 769, 769, 769, 769, 273, 273, 769, 273, 769, 273, 769, 769, 769, 273, 273, 273, 280, 769, 769, 769, 769, 280, 769, 769, 280, 769, 769, 769, 769, 769, 280, 280, 280, 284, 769, 284, 769, 769, 284, 769, 284, 284, 769, 284, 769, 769, 284, 769, 769, 284, 284, 284, 284, 298, 769, 298, 769, 769, 298, 769, 298, 298, 769, 298, 769, 769, 298, 769, 769, 298, 298, 298, 298, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 324, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 325, 357, 357, 769, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 357, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 374, 400, 400, 769, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 402, 769, 769, 769, 769, 402, 769, 769, 402, 769, 769, 769, 769, 769, 402, 402, 402, 402, 404, 769, 404, 769, 769, 404, 769, 404, 404, 769, 404, 769, 769, 404, 769, 769, 404, 404, 404, 404, 415, 769, 415, 769, 769, 415, 769, 415, 415, 769, 415, 769, 769, 415, 769, 769, 415, 415, 415, 415, 482, 769, 482, 769, 769, 482, 769, 482, 482, 769, 482, 769, 769, 482, 769, 769, 482, 482, 482, 482, 477, 769, 769, 769, 769, 477, 769, 477, 477, 769, 477, 769, 769, 477, 769, 769, 477, 477, 477, 477, 488, 769, 488, 769, 769, 488, 769, 488, 488, 769, 488, 769, 769, 488, 769, 769, 488, 488, 488, 488, 483, 769, 769, 769, 769, 483, 769, 483, 483, 769, 483, 769, 769, 483, 769, 769, 483, 483, 483, 483, 502, 769, 502, 769, 769, 502, 769, 502, 502, 769, 502, 769, 769, 502, 769, 769, 502, 502, 502, 502, 498, 769, 769, 769, 769, 498, 769, 498, 498, 769, 498, 769, 769, 498, 769, 769, 498, 498, 498, 498, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 541, 769, 541, 769, 769, 541, 769, 541, 541, 769, 541, 769, 769, 769, 769, 769, 541, 541, 541, 541, 543, 543, 543, 543, 544, 769, 544, 769, 769, 544, 769, 544, 544, 769, 544, 769, 769, 544, 769, 769, 544, 544, 544, 544, 547, 769, 547, 769, 769, 547, 769, 547, 547, 769, 547, 769, 769, 547, 769, 769, 547, 547, 547, 547, 550, 769, 769, 769, 769, 769, 550, 769, 769, 550, 769, 769, 769, 550, 769, 550, 550, 550, 558, 769, 558, 769, 769, 558, 769, 558, 558, 769, 558, 769, 769, 558, 769, 769, 558, 558, 558, 558, 561, 769, 561, 769, 769, 561, 769, 561, 561, 769, 561, 769, 769, 561, 769, 769, 561, 561, 561, 561, 150, 769, 150, 769, 769, 150, 769, 150, 150, 769, 150, 769, 769, 150, 769, 769, 150, 150, 150, 150, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 529, 189, 189, 769, 189, 769, 189, 769, 189, 189, 769, 189, 189, 769, 769, 769, 769, 189, 189, 189, 189, 477, 769, 769, 769, 769, 477, 769, 477, 477, 769, 477, 769, 769, 477, 769, 769, 477, 477, 477, 477, 587, 769, 769, 769, 769, 587, 769, 587, 587, 769, 587, 769, 769, 769, 769, 587, 587, 587, 587, 587, 593, 769, 593, 593, 769, 769, 593, 593, 593, 593, 593, 593, 593, 769, 593, 593, 769, 593, 593, 593, 624, 624, 624, 624, 628, 769, 628, 628, 769, 769, 628, 628, 628, 628, 628, 628, 628, 769, 628, 628, 769, 628, 628, 628, 652, 769, 769, 769, 769, 652, 769, 652, 652, 769, 652, 769, 769, 769, 769, 769, 652, 652, 652, 652, 662, 662, 769, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 663, 663, 769, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 663, 692, 769, 692, 769, 769, 769, 769, 769, 769, 769, 692, 769, 692, 692, 769, 769, 769, 769, 769, 692, 692, 692, 699, 699, 769, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 699, 400, 400, 769, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 400, 737, 737, 769, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 737, 750, 750, 769, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 750, 21, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769 } ; static yyconst flex_int32_t yy_chk[5740] = { 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 8, 751, 750, 8, 25, 25, 25, 25, 25, 25, 25, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 14, 18, 26, 746, 26, 26, 26, 26, 26, 26, 26, 742, 18, 13, 14, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 23, 27, 715, 27, 27, 27, 27, 27, 27, 27, 28, 66, 28, 28, 28, 28, 28, 28, 28, 31, 699, 32, 31, 31, 32, 32, 87, 33, 73, 23, 33, 33, 86, 288, 334, 31, 87, 32, 698, 591, 66, 591, 34, 33, 35, 34, 34, 35, 35, 40, 693, 684, 40, 40, 33, 32, 288, 73, 34, 52, 35, 86, 52, 52, 35, 40, 31, 31, 32, 32, 34, 109, 109, 109, 33, 33, 36, 36, 36, 36, 36, 36, 36, 33, 32, 107, 334, 669, 110, 34, 34, 35, 35, 35, 111, 108, 40, 40, 41, 34, 42, 41, 41, 42, 42, 43, 52, 52, 43, 43, 127, 127, 127, 107, 41, 108, 42, 110, 234, 234, 234, 43, 42, 111, 592, 43, 592, 42, 132, 43, 145, 655, 41, 45, 42, 650, 45, 45, 632, 44, 124, 167, 44, 44, 108, 41, 41, 42, 42, 45, 124, 42, 43, 43, 43, 44, 42, 132, 43, 145, 116, 41, 629, 42, 124, 625, 45, 44, 46, 599, 167, 46, 46, 605, 168, 48, 44, 590, 48, 48, 45, 45, 561, 605, 46, 49, 44, 44, 49, 49, 47, 48, 46, 47, 47, 45, 44, 116, 167, 48, 60, 49, 168, 60, 60, 44, 47, 171, 50, 54, 47, 50, 50, 55, 55, 46, 46, 55, 55, 147, 147, 46, 48, 48, 50, 49, 116, 554, 48, 55, 147, 172, 49, 49, 177, 54, 171, 47, 47, 47, 54, 177, 50, 54, 547, 539, 61, 60, 60, 61, 61, 175, 175, 175, 49, 50, 50, 148, 148, 340, 172, 55, 55, 65, 54, 529, 65, 65, 148, 54, 177, 50, 54, 57, 57, 175, 57, 787, 57, 57, 487, 57, 57, 787, 57, 213, 213, 340, 57, 194, 194, 194, 456, 61, 61, 411, 213, 57, 57, 57, 57, 57, 57, 68, 68, 68, 68, 68, 68, 68, 65, 65, 67, 194, 67, 67, 67, 67, 67, 67, 67, 71, 401, 71, 71, 71, 71, 71, 57, 57, 69, 200, 69, 69, 69, 69, 69, 69, 69, 70, 400, 70, 70, 70, 70, 70, 70, 70, 75, 183, 76, 75, 75, 76, 76, 186, 183, 374, 211, 77, 200, 77, 186, 184, 75, 77, 76, 79, 77, 77, 79, 79, 80, 214, 214, 80, 80, 184, 491, 223, 188, 77, 233, 79, 214, 183, 81, 211, 80, 81, 81, 186, 80, 341, 188, 75, 75, 76, 76, 637, 82, 491, 81, 82, 82, 339, 184, 79, 223, 637, 324, 233, 77, 77, 79, 79, 82, 81, 293, 80, 80, 80, 83, 188, 83, 83, 83, 83, 83, 83, 83, 292, 82, 81, 81, 549, 79, 84, 77, 84, 84, 84, 84, 84, 84, 84, 81, 82, 82, 85, 191, 85, 85, 85, 85, 85, 85, 85, 549, 88, 254, 82, 88, 88, 89, 279, 272, 89, 89, 254, 260, 235, 90, 91, 90, 88, 91, 91, 90, 199, 89, 90, 90, 92, 190, 235, 92, 92, 93, 91, 201, 93, 93, 191, 90, 176, 92, 189, 254, 92, 312, 312, 312, 237, 93, 201, 88, 88, 93, 176, 237, 89, 89, 91, 235, 176, 476, 476, 476, 201, 91, 91, 191, 173, 94, 90, 90, 94, 94, 95, 92, 92, 95, 95, 201, 93, 93, 93, 176, 237, 94, 421, 91, 96, 176, 95, 96, 96, 169, 146, 143, 90, 143, 143, 143, 143, 143, 94, 242, 96, 278, 790, 97, 249, 144, 97, 97, 790, 95, 421, 249, 94, 94, 133, 96, 242, 95, 95, 97, 98, 123, 117, 98, 98, 99, 182, 94, 99, 99, 278, 96, 96, 182, 97, 550, 98, 182, 95, 100, 249, 99, 100, 100, 96, 242, 294, 294, 244, 101, 97, 97, 101, 101, 98, 100, 105, 294, 550, 105, 105, 256, 182, 97, 244, 101, 182, 98, 98, 113, 256, 106, 99, 99, 106, 106, 104, 100, 78, 104, 104, 101, 255, 98, 72, 238, 100, 100, 593, 104, 593, 103, 104, 244, 103, 103, 101, 101, 119, 256, 255, 119, 119, 105, 105, 238, 100, 103, 63, 62, 101, 102, 103, 120, 102, 102, 120, 120, 106, 106, 641, 112, 112, 104, 104, 112, 112, 102, 121, 255, 641, 121, 121, 102, 238, 262, 102, 112, 103, 103, 122, 103, 262, 122, 122, 119, 119, 114, 114, 102, 102, 114, 114, 125, 58, 53, 125, 125, 102, 102, 120, 120, 102, 114, 126, 102, 39, 126, 126, 112, 112, 262, 185, 185, 185, 121, 121, 258, 102, 102, 128, 128, 128, 128, 128, 128, 128, 122, 122, 30, 243, 243, 243, 258, 29, 114, 114, 115, 185, 268, 125, 125, 134, 134, 134, 134, 134, 134, 134, 115, 21, 126, 126, 115, 115, 115, 243, 115, 185, 115, 115, 268, 258, 115, 115, 264, 115, 115, 305, 264, 115, 115, 115, 129, 250, 129, 129, 129, 129, 129, 129, 129, 115, 115, 115, 20, 115, 185, 115, 115, 268, 16, 115, 115, 250, 115, 115, 305, 264, 115, 115, 115, 130, 12, 130, 130, 130, 130, 130, 130, 130, 131, 10, 131, 131, 131, 131, 131, 131, 131, 135, 253, 135, 250, 137, 263, 135, 137, 137, 135, 135, 7, 135, 135, 135, 135, 135, 135, 135, 263, 137, 253, 135, 138, 317, 139, 138, 138, 139, 139, 141, 141, 141, 141, 141, 141, 141, 137, 317, 138, 140, 139, 6, 140, 140, 261, 261, 261, 263, 139, 253, 137, 137, 135, 135, 626, 140, 626, 151, 4, 138, 151, 151, 677, 140, 677, 137, 317, 322, 261, 138, 138, 139, 139, 151, 322, 0, 0, 139, 135, 195, 195, 195, 195, 195, 195, 195, 140, 140, 138, 314, 151, 142, 140, 142, 142, 142, 142, 142, 142, 142, 149, 0, 149, 322, 151, 151, 149, 0, 0, 149, 149, 314, 149, 149, 149, 149, 149, 149, 149, 151, 153, 313, 149, 153, 153, 154, 313, 155, 154, 154, 155, 155, 0, 691, 156, 691, 153, 156, 156, 271, 314, 154, 157, 155, 0, 157, 157, 274, 274, 274, 156, 155, 179, 149, 149, 313, 0, 153, 157, 245, 245, 245, 156, 179, 154, 350, 157, 153, 153, 179, 271, 274, 154, 154, 155, 155, 692, 246, 692, 149, 155, 156, 156, 0, 158, 245, 153, 158, 158, 157, 157, 156, 179, 154, 350, 157, 330, 246, 179, 271, 158, 246, 159, 159, 159, 159, 159, 159, 159, 160, 330, 161, 160, 160, 161, 161, 158, 0, 162, 0, 163, 162, 162, 163, 163, 160, 246, 161, 266, 332, 246, 158, 158, 159, 162, 161, 163, 164, 331, 330, 164, 164, 162, 332, 163, 158, 198, 160, 198, 198, 198, 198, 198, 164, 266, 318, 160, 160, 161, 161, 331, 164, 159, 0, 161, 162, 162, 163, 163, 0, 318, 162, 332, 163, 0, 165, 160, 166, 165, 165, 166, 166, 266, 0, 164, 164, 178, 236, 0, 331, 164, 165, 178, 166, 366, 385, 321, 178, 236, 318, 178, 236, 247, 247, 247, 359, 166, 366, 178, 385, 180, 180, 180, 180, 180, 165, 248, 248, 248, 321, 180, 178, 165, 165, 166, 166, 178, 236, 247, 178, 236, 251, 251, 251, 359, 166, 366, 178, 385, 181, 180, 370, 248, 323, 165, 174, 368, 181, 321, 174, 399, 174, 368, 174, 181, 181, 370, 251, 319, 174, 174, 319, 174, 174, 187, 329, 323, 187, 174, 180, 187, 187, 329, 0, 187, 187, 181, 660, 174, 399, 174, 368, 174, 181, 181, 370, 372, 660, 174, 174, 319, 174, 174, 0, 0, 323, 187, 174, 0, 187, 187, 329, 372, 187, 187, 196, 196, 196, 196, 196, 196, 196, 197, 0, 197, 197, 197, 197, 197, 197, 197, 202, 202, 202, 202, 202, 202, 202, 203, 0, 203, 372, 204, 0, 203, 204, 204, 203, 203, 371, 203, 203, 203, 203, 203, 203, 203, 0, 204, 205, 203, 0, 205, 205, 207, 204, 206, 207, 207, 206, 206, 371, 252, 252, 252, 205, 257, 257, 257, 367, 207, 412, 206, 259, 259, 259, 367, 0, 0, 204, 204, 203, 203, 392, 204, 678, 392, 205, 252, 206, 371, 378, 257, 0, 0, 678, 205, 205, 378, 259, 412, 207, 207, 206, 206, 367, 208, 203, 208, 208, 208, 208, 208, 208, 208, 392, 205, 209, 206, 209, 209, 209, 209, 209, 209, 209, 210, 378, 210, 210, 210, 210, 210, 210, 210, 215, 548, 215, 548, 216, 433, 215, 216, 216, 215, 215, 433, 215, 215, 215, 215, 215, 215, 215, 440, 216, 217, 215, 0, 217, 217, 548, 216, 219, 475, 220, 219, 219, 220, 220, 440, 0, 217, 0, 218, 433, 219, 218, 218, 219, 0, 220, 0, 265, 265, 265, 216, 216, 215, 215, 218, 216, 221, 475, 217, 221, 221, 724, 218, 440, 376, 376, 376, 217, 217, 395, 220, 724, 221, 265, 219, 219, 220, 220, 215, 222, 0, 430, 222, 222, 0, 218, 218, 217, 376, 221, 224, 218, 222, 224, 224, 222, 395, 225, 428, 220, 225, 225, 430, 221, 221, 226, 224, 384, 226, 226, 224, 495, 227, 225, 384, 227, 227, 428, 221, 497, 497, 226, 0, 352, 352, 395, 222, 222, 227, 0, 497, 430, 228, 226, 352, 228, 228, 224, 224, 224, 495, 0, 0, 384, 225, 225, 428, 0, 228, 227, 0, 229, 226, 226, 229, 229, 387, 351, 351, 227, 227, 0, 226, 387, 352, 228, 230, 229, 351, 230, 230, 267, 267, 267, 269, 269, 269, 0, 227, 228, 228, 0, 230, 460, 273, 273, 273, 460, 229, 351, 230, 429, 387, 352, 228, 437, 454, 267, 229, 229, 269, 270, 270, 270, 270, 270, 270, 270, 273, 0, 273, 429, 454, 230, 230, 437, 460, 229, 351, 230, 241, 275, 0, 275, 275, 275, 275, 275, 275, 275, 315, 315, 315, 0, 380, 555, 241, 241, 241, 0, 429, 454, 241, 241, 437, 380, 241, 316, 316, 316, 241, 380, 0, 241, 241, 276, 315, 276, 276, 276, 276, 276, 276, 276, 555, 241, 241, 241, 320, 320, 320, 241, 241, 316, 380, 241, 586, 471, 391, 241, 380, 389, 241, 241, 277, 391, 277, 277, 277, 277, 277, 277, 277, 280, 320, 389, 280, 280, 280, 280, 280, 280, 280, 281, 434, 586, 281, 281, 281, 281, 281, 281, 281, 282, 391, 282, 471, 438, 434, 282, 0, 0, 282, 282, 389, 282, 282, 282, 282, 282, 282, 282, 596, 285, 438, 282, 285, 285, 286, 393, 287, 286, 286, 287, 287, 471, 393, 434, 735, 285, 328, 328, 328, 285, 286, 760, 287, 0, 735, 0, 287, 596, 286, 438, 0, 760, 282, 282, 289, 289, 289, 289, 289, 289, 289, 393, 328, 369, 369, 369, 285, 285, 285, 295, 295, 286, 286, 287, 287, 287, 446, 286, 282, 290, 295, 290, 290, 290, 290, 290, 290, 290, 291, 369, 291, 291, 291, 291, 291, 390, 446, 623, 295, 651, 390, 295, 431, 299, 0, 0, 299, 299, 300, 431, 0, 300, 300, 373, 373, 373, 0, 0, 303, 299, 0, 303, 303, 299, 300, 446, 623, 295, 651, 390, 295, 296, 300, 296, 303, 0, 0, 296, 431, 373, 296, 296, 303, 296, 296, 296, 296, 296, 296, 296, 299, 299, 299, 296, 301, 300, 300, 301, 301, 304, 0, 300, 304, 304, 306, 303, 303, 306, 306, 0, 301, 303, 459, 307, 449, 304, 307, 307, 0, 304, 306, 457, 457, 457, 296, 296, 459, 301, 309, 307, 306, 309, 309, 308, 449, 0, 308, 308, 432, 432, 432, 301, 301, 462, 309, 457, 304, 304, 304, 308, 296, 306, 306, 0, 307, 459, 301, 308, 511, 306, 307, 307, 310, 449, 432, 310, 310, 309, 311, 462, 436, 311, 311, 451, 377, 309, 309, 436, 310, 511, 308, 308, 383, 307, 311, 333, 308, 442, 377, 383, 311, 451, 670, 383, 377, 310, 309, 462, 333, 333, 333, 333, 333, 333, 333, 0, 436, 442, 511, 310, 310, 442, 439, 439, 439, 311, 311, 377, 383, 311, 451, 670, 383, 377, 310, 327, 336, 336, 336, 336, 336, 336, 336, 0, 464, 435, 442, 327, 439, 0, 442, 327, 327, 327, 450, 327, 435, 327, 327, 435, 445, 327, 327, 450, 327, 327, 464, 445, 327, 327, 327, 337, 568, 337, 337, 337, 337, 337, 337, 337, 327, 327, 327, 0, 327, 435, 327, 327, 435, 0, 327, 327, 450, 327, 327, 464, 445, 327, 327, 327, 338, 342, 338, 338, 338, 338, 338, 568, 342, 597, 597, 342, 342, 342, 342, 342, 342, 342, 344, 0, 597, 344, 344, 347, 0, 347, 347, 347, 347, 347, 347, 347, 452, 0, 344, 345, 568, 0, 345, 345, 348, 452, 348, 348, 348, 348, 348, 348, 348, 466, 671, 345, 671, 468, 349, 344, 349, 349, 349, 349, 349, 349, 349, 0, 363, 344, 344, 363, 363, 458, 452, 466, 518, 468, 345, 671, 458, 518, 342, 343, 363, 343, 345, 345, 344, 343, 0, 0, 343, 343, 0, 343, 343, 343, 343, 343, 343, 343, 0, 512, 466, 343, 468, 345, 354, 458, 518, 354, 354, 0, 0, 363, 363, 0, 0, 355, 512, 0, 355, 355, 354, 394, 394, 394, 394, 394, 394, 394, 519, 0, 513, 355, 343, 343, 381, 381, 381, 381, 381, 356, 0, 354, 356, 356, 381, 512, 413, 413, 0, 0, 519, 354, 354, 513, 355, 356, 0, 413, 343, 353, 0, 353, 355, 355, 381, 353, 0, 526, 353, 353, 354, 353, 353, 353, 353, 353, 353, 353, 356, 519, 413, 353, 513, 355, 0, 358, 356, 356, 358, 358, 526, 0, 360, 381, 361, 360, 360, 361, 361, 0, 410, 358, 410, 410, 410, 410, 410, 356, 360, 413, 361, 362, 353, 353, 362, 362, 360, 0, 361, 526, 364, 522, 358, 364, 364, 0, 0, 362, 386, 386, 386, 538, 358, 358, 0, 522, 364, 523, 353, 360, 360, 361, 361, 0, 362, 360, 365, 361, 0, 365, 365, 358, 523, 515, 386, 379, 0, 0, 362, 362, 515, 379, 365, 382, 522, 527, 379, 364, 364, 379, 0, 382, 527, 362, 386, 531, 538, 379, 382, 382, 403, 523, 531, 403, 403, 365, 414, 414, 405, 515, 379, 405, 405, 365, 365, 379, 403, 414, 379, 524, 382, 527, 524, 386, 405, 538, 379, 382, 382, 407, 532, 531, 407, 407, 365, 375, 528, 414, 696, 375, 533, 375, 709, 375, 532, 407, 718, 403, 403, 375, 375, 524, 375, 375, 388, 405, 405, 388, 375, 528, 388, 388, 533, 0, 388, 388, 414, 696, 375, 0, 375, 709, 375, 532, 0, 718, 407, 407, 375, 375, 0, 375, 375, 0, 0, 536, 388, 375, 528, 388, 388, 533, 536, 388, 388, 396, 396, 396, 396, 396, 396, 396, 397, 397, 397, 397, 397, 397, 397, 398, 398, 398, 398, 398, 398, 398, 402, 566, 402, 0, 406, 536, 402, 406, 406, 402, 402, 0, 402, 402, 402, 402, 402, 402, 402, 565, 406, 566, 402, 408, 408, 408, 408, 408, 408, 408, 409, 534, 409, 409, 409, 409, 409, 409, 409, 726, 416, 726, 573, 416, 416, 534, 0, 0, 406, 573, 566, 406, 406, 402, 402, 565, 416, 417, 0, 418, 417, 417, 418, 418, 726, 419, 557, 420, 419, 419, 420, 420, 0, 417, 534, 418, 406, 571, 573, 402, 404, 419, 404, 420, 565, 0, 404, 416, 416, 404, 404, 0, 404, 404, 404, 404, 404, 404, 404, 571, 0, 417, 404, 0, 417, 417, 418, 418, 557, 0, 0, 420, 419, 419, 420, 420, 422, 0, 0, 422, 422, 426, 426, 426, 426, 426, 426, 426, 571, 417, 0, 0, 422, 404, 404, 0, 576, 557, 423, 420, 0, 423, 423, 473, 473, 473, 473, 473, 0, 424, 426, 576, 424, 424, 423, 441, 441, 441, 0, 404, 415, 423, 415, 422, 422, 424, 415, 0, 0, 415, 415, 424, 415, 415, 415, 415, 415, 415, 415, 426, 576, 441, 415, 0, 562, 423, 423, 540, 540, 540, 423, 443, 443, 443, 0, 427, 424, 424, 427, 427, 424, 425, 425, 425, 425, 425, 425, 425, 427, 562, 0, 427, 540, 415, 415, 0, 0, 443, 444, 444, 444, 447, 447, 447, 448, 448, 448, 425, 453, 453, 453, 455, 455, 455, 461, 461, 461, 0, 562, 415, 0, 0, 427, 427, 444, 563, 0, 447, 496, 496, 448, 463, 463, 463, 453, 0, 425, 455, 0, 496, 461, 465, 465, 465, 467, 467, 467, 469, 469, 469, 472, 472, 472, 472, 472, 472, 472, 463, 0, 563, 470, 657, 657, 569, 496, 477, 563, 465, 477, 477, 467, 0, 657, 469, 470, 470, 470, 470, 470, 470, 470, 477, 478, 0, 0, 478, 478, 483, 563, 0, 483, 483, 0, 496, 563, 514, 514, 514, 478, 569, 489, 0, 489, 483, 484, 0, 489, 484, 484, 489, 489, 490, 477, 477, 490, 490, 516, 516, 516, 0, 484, 514, 489, 0, 517, 517, 517, 490, 569, 478, 478, 479, 622, 479, 483, 483, 585, 479, 0, 636, 479, 479, 516, 479, 479, 479, 479, 479, 479, 479, 517, 484, 484, 489, 489, 520, 520, 520, 490, 490, 492, 492, 492, 492, 492, 492, 492, 493, 493, 493, 493, 493, 493, 493, 585, 636, 622, 0, 0, 489, 0, 520, 0, 0, 479, 479, 521, 521, 521, 570, 494, 494, 494, 494, 494, 494, 494, 0, 498, 0, 492, 498, 498, 585, 636, 622, 570, 493, 0, 572, 479, 480, 521, 480, 498, 499, 0, 480, 499, 499, 480, 480, 572, 480, 480, 480, 480, 480, 480, 480, 494, 499, 503, 480, 503, 570, 504, 574, 503, 504, 504, 503, 503, 574, 578, 498, 498, 556, 556, 0, 0, 572, 504, 601, 503, 710, 710, 710, 556, 710, 578, 0, 499, 499, 480, 480, 525, 525, 525, 0, 601, 506, 574, 508, 506, 506, 508, 508, 508, 508, 508, 508, 508, 504, 504, 503, 503, 506, 556, 578, 480, 485, 525, 485, 530, 530, 530, 485, 508, 601, 485, 485, 608, 485, 485, 485, 485, 485, 485, 485, 0, 503, 509, 485, 0, 509, 509, 556, 506, 506, 530, 535, 535, 535, 0, 509, 608, 508, 509, 552, 552, 552, 552, 552, 552, 552, 553, 553, 553, 553, 553, 575, 575, 575, 485, 485, 0, 535, 510, 0, 542, 510, 510, 542, 542, 608, 581, 0, 545, 509, 509, 545, 545, 581, 510, 600, 542, 575, 577, 552, 485, 486, 510, 486, 545, 543, 553, 486, 543, 543, 486, 486, 0, 486, 486, 486, 486, 486, 486, 486, 577, 0, 581, 486, 543, 510, 510, 542, 542, 559, 600, 510, 559, 559, 0, 545, 545, 582, 609, 602, 582, 580, 579, 579, 579, 559, 580, 584, 0, 577, 584, 0, 543, 543, 486, 486, 0, 0, 564, 600, 609, 564, 564, 564, 564, 564, 564, 564, 579, 582, 567, 602, 0, 567, 567, 580, 559, 559, 564, 584, 486, 500, 612, 500, 604, 583, 567, 500, 0, 609, 500, 500, 583, 500, 500, 500, 500, 500, 500, 500, 602, 587, 612, 500, 587, 587, 588, 564, 567, 588, 588, 603, 610, 610, 610, 604, 0, 567, 567, 613, 587, 583, 598, 598, 611, 588, 725, 0, 603, 0, 607, 612, 0, 598, 500, 500, 0, 567, 610, 594, 613, 594, 594, 611, 604, 614, 594, 594, 587, 587, 594, 594, 614, 588, 588, 725, 598, 603, 617, 594, 500, 501, 594, 501, 594, 607, 630, 501, 674, 613, 501, 501, 611, 501, 501, 501, 501, 501, 501, 501, 617, 614, 643, 501, 606, 598, 619, 606, 606, 616, 615, 615, 615, 594, 607, 616, 634, 606, 633, 0, 606, 618, 618, 618, 0, 643, 619, 0, 630, 617, 620, 620, 620, 674, 501, 501, 615, 635, 621, 621, 621, 0, 640, 0, 616, 624, 634, 618, 624, 624, 633, 606, 606, 658, 643, 619, 620, 630, 635, 640, 501, 505, 674, 505, 621, 642, 628, 505, 628, 628, 505, 505, 642, 628, 628, 634, 0, 628, 628, 633, 0, 0, 732, 505, 658, 0, 628, 635, 640, 628, 505, 628, 624, 624, 631, 631, 644, 644, 644, 0, 645, 642, 646, 646, 646, 631, 505, 645, 647, 647, 647, 732, 0, 658, 505, 505, 648, 648, 648, 505, 628, 0, 644, 652, 649, 0, 652, 652, 646, 653, 0, 649, 653, 653, 647, 505, 645, 631, 659, 664, 505, 507, 648, 507, 654, 0, 654, 507, 661, 0, 507, 507, 667, 507, 507, 507, 507, 507, 507, 507, 649, 668, 664, 507, 668, 675, 631, 666, 676, 661, 652, 652, 654, 659, 667, 680, 653, 653, 656, 656, 665, 665, 665, 0, 666, 673, 673, 654, 0, 656, 676, 664, 0, 668, 507, 507, 673, 680, 661, 0, 675, 654, 659, 667, 679, 0, 665, 687, 687, 700, 0, 700, 656, 666, 0, 0, 654, 689, 687, 676, 507, 546, 0, 546, 0, 679, 680, 546, 673, 675, 546, 546, 700, 546, 546, 546, 546, 546, 546, 546, 0, 656, 689, 546, 672, 672, 672, 672, 672, 672, 672, 681, 681, 681, 679, 690, 0, 673, 682, 682, 682, 683, 683, 683, 683, 683, 683, 683, 688, 688, 0, 689, 686, 694, 546, 546, 690, 681, 0, 688, 694, 0, 0, 706, 682, 686, 686, 686, 686, 686, 686, 686, 701, 701, 701, 701, 701, 701, 701, 702, 546, 560, 704, 560, 688, 690, 705, 560, 706, 694, 560, 560, 695, 560, 560, 560, 560, 560, 560, 560, 707, 707, 707, 560, 0, 695, 695, 695, 695, 695, 695, 695, 0, 688, 703, 703, 738, 706, 704, 0, 705, 714, 0, 0, 702, 703, 707, 708, 708, 708, 708, 708, 708, 708, 560, 560, 711, 711, 711, 711, 711, 711, 711, 712, 712, 738, 714, 704, 703, 705, 0, 716, 722, 702, 712, 0, 713, 713, 0, 0, 560, 685, 685, 741, 685, 685, 685, 713, 685, 685, 685, 716, 723, 685, 0, 714, 736, 703, 0, 712, 720, 720, 0, 722, 0, 685, 685, 717, 685, 685, 685, 720, 0, 723, 741, 736, 0, 713, 0, 0, 716, 717, 717, 717, 717, 717, 717, 717, 712, 719, 719, 719, 722, 719, 720, 0, 685, 685, 0, 685, 727, 727, 723, 741, 736, 0, 713, 721, 721, 728, 728, 727, 729, 730, 719, 754, 733, 733, 721, 0, 728, 0, 0, 720, 685, 697, 697, 733, 697, 697, 697, 0, 697, 697, 697, 721, 0, 697, 0, 0, 745, 727, 729, 730, 733, 754, 734, 734, 0, 697, 697, 0, 697, 697, 697, 0, 728, 734, 739, 739, 745, 0, 0, 749, 721, 740, 740, 743, 743, 739, 727, 729, 730, 733, 754, 0, 740, 757, 743, 0, 697, 697, 0, 697, 0, 728, 744, 744, 749, 745, 747, 747, 748, 748, 734, 752, 752, 744, 753, 753, 757, 747, 0, 748, 0, 739, 752, 0, 697, 753, 740, 755, 755, 756, 756, 743, 0, 749, 744, 758, 758, 0, 755, 734, 756, 759, 759, 752, 0, 757, 758, 761, 761, 0, 739, 747, 759, 762, 762, 740, 763, 763, 761, 0, 743, 0, 0, 744, 762, 764, 764, 763, 765, 765, 767, 767, 752, 0, 0, 0, 764, 784, 0, 765, 747, 767, 770, 784, 0, 784, 0, 770, 0, 770, 770, 0, 770, 0, 0, 770, 0, 0, 770, 770, 770, 770, 771, 771, 0, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 771, 772, 0, 0, 0, 0, 772, 0, 772, 772, 0, 772, 0, 0, 772, 0, 0, 772, 772, 772, 772, 773, 0, 0, 0, 0, 773, 0, 773, 773, 0, 773, 0, 0, 0, 0, 0, 773, 773, 773, 773, 774, 0, 0, 0, 774, 774, 0, 774, 774, 0, 774, 0, 774, 0, 0, 0, 774, 774, 774, 774, 775, 775, 0, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 775, 776, 0, 0, 0, 776, 776, 776, 776, 776, 776, 776, 776, 776, 0, 776, 776, 776, 776, 776, 776, 776, 776, 776, 776, 777, 0, 0, 0, 0, 777, 0, 777, 777, 0, 777, 0, 0, 0, 0, 0, 777, 777, 777, 777, 778, 0, 0, 0, 0, 778, 0, 778, 778, 0, 778, 0, 0, 0, 0, 0, 778, 778, 778, 778, 779, 0, 0, 0, 0, 779, 0, 779, 779, 0, 779, 0, 0, 0, 0, 0, 779, 779, 779, 779, 780, 0, 0, 780, 0, 0, 0, 0, 0, 780, 780, 780, 781, 0, 781, 0, 0, 781, 0, 781, 781, 0, 781, 0, 0, 781, 0, 0, 781, 781, 781, 781, 782, 0, 0, 782, 0, 0, 782, 782, 782, 782, 782, 782, 782, 0, 782, 782, 0, 782, 782, 782, 783, 0, 783, 0, 0, 783, 0, 783, 783, 0, 783, 0, 0, 783, 0, 0, 783, 783, 783, 783, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 785, 786, 786, 0, 786, 0, 786, 0, 786, 786, 0, 786, 786, 0, 0, 0, 0, 786, 786, 786, 786, 788, 0, 0, 0, 0, 788, 0, 0, 788, 0, 0, 0, 0, 0, 788, 788, 788, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 789, 791, 791, 791, 0, 0, 0, 0, 0, 0, 0, 791, 791, 0, 791, 0, 791, 0, 0, 0, 791, 791, 791, 792, 0, 0, 0, 0, 792, 0, 0, 792, 0, 0, 0, 0, 0, 792, 792, 792, 793, 0, 793, 0, 0, 793, 0, 793, 793, 0, 793, 0, 0, 793, 0, 0, 793, 793, 793, 793, 794, 0, 794, 0, 0, 794, 0, 794, 794, 0, 794, 0, 0, 794, 0, 0, 794, 794, 794, 794, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 795, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 796, 797, 797, 0, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 797, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 798, 799, 799, 0, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 799, 800, 0, 0, 0, 0, 800, 0, 0, 800, 0, 0, 0, 0, 0, 800, 800, 800, 800, 801, 0, 801, 0, 0, 801, 0, 801, 801, 0, 801, 0, 0, 801, 0, 0, 801, 801, 801, 801, 802, 0, 802, 0, 0, 802, 0, 802, 802, 0, 802, 0, 0, 802, 0, 0, 802, 802, 802, 802, 803, 0, 803, 0, 0, 803, 0, 803, 803, 0, 803, 0, 0, 803, 0, 0, 803, 803, 803, 803, 804, 0, 0, 0, 0, 804, 0, 804, 804, 0, 804, 0, 0, 804, 0, 0, 804, 804, 804, 804, 805, 0, 805, 0, 0, 805, 0, 805, 805, 0, 805, 0, 0, 805, 0, 0, 805, 805, 805, 805, 806, 0, 0, 0, 0, 806, 0, 806, 806, 0, 806, 0, 0, 806, 0, 0, 806, 806, 806, 806, 807, 0, 807, 0, 0, 807, 0, 807, 807, 0, 807, 0, 0, 807, 0, 0, 807, 807, 807, 807, 808, 0, 0, 0, 0, 808, 0, 808, 808, 0, 808, 0, 0, 808, 0, 0, 808, 808, 808, 808, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 809, 810, 0, 810, 0, 0, 810, 0, 810, 810, 0, 810, 0, 0, 0, 0, 0, 810, 810, 810, 810, 811, 811, 811, 811, 812, 0, 812, 0, 0, 812, 0, 812, 812, 0, 812, 0, 0, 812, 0, 0, 812, 812, 812, 812, 813, 0, 813, 0, 0, 813, 0, 813, 813, 0, 813, 0, 0, 813, 0, 0, 813, 813, 813, 813, 814, 0, 0, 0, 0, 0, 814, 0, 0, 814, 0, 0, 0, 814, 0, 814, 814, 814, 815, 0, 815, 0, 0, 815, 0, 815, 815, 0, 815, 0, 0, 815, 0, 0, 815, 815, 815, 815, 816, 0, 816, 0, 0, 816, 0, 816, 816, 0, 816, 0, 0, 816, 0, 0, 816, 816, 816, 816, 817, 0, 817, 0, 0, 817, 0, 817, 817, 0, 817, 0, 0, 817, 0, 0, 817, 817, 817, 817, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 818, 819, 819, 0, 819, 0, 819, 0, 819, 819, 0, 819, 819, 0, 0, 0, 0, 819, 819, 819, 819, 820, 0, 0, 0, 0, 820, 0, 820, 820, 0, 820, 0, 0, 820, 0, 0, 820, 820, 820, 820, 821, 0, 0, 0, 0, 821, 0, 821, 821, 0, 821, 0, 0, 0, 0, 821, 821, 821, 821, 821, 822, 0, 822, 822, 0, 0, 822, 822, 822, 822, 822, 822, 822, 0, 822, 822, 0, 822, 822, 822, 823, 823, 823, 823, 824, 0, 824, 824, 0, 0, 824, 824, 824, 824, 824, 824, 824, 0, 824, 824, 0, 824, 824, 824, 825, 0, 0, 0, 0, 825, 0, 825, 825, 0, 825, 0, 0, 0, 0, 0, 825, 825, 825, 825, 826, 826, 0, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 826, 827, 827, 0, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 827, 828, 0, 828, 0, 0, 0, 0, 0, 0, 0, 828, 0, 828, 828, 0, 0, 0, 0, 0, 828, 828, 828, 829, 829, 0, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 829, 830, 830, 0, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 830, 831, 831, 0, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 831, 832, 832, 0, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 832, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769, 769 } ; static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; extern int yy_flex_debug; int yy_flex_debug = 1; static yyconst flex_int32_t yy_rule_linenum[43] = { 0, 226, 232, 233, 235, 240, 241, 243, 251, 252, 253, 255, 256, 258, 259, 268, 281, 282, 284, 286, 289, 290, 291, 294, 304, 311, 313, 314, 315, 316, 318, 319, 321, 322, 323, 325, 326, 328, 330, 331, 333, 335, 336 } ; /* 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 char *yytext; #line 1 "./lexer_v3.l" /* $Id: lexer_v3.l 6988 2013-01-20 14:02:48Z m-a $ */ #line 4 "./lexer_v3.l" /* * NAME * lexer_v3.l -- bogofilter's lexical analyzer for message headers * * 01/01/2003 - split out of lexer.l * */ /* * Our lexical analysis is different from Paul Graham's rules: * * We throw away headers that are readily identifiable as dates. * We throw away all digit strings that don't look like IP address parts. * We thow away lines beginning with id -- mailer UDs. * * These are optimizations to keep the token lists from bloating. * The big win is recognizing machine-generated unique IDs that * we'll never see again and shouldn't * * We don't treat dot between two alphanumerics as a separator, * because we want to keep domain names and IP addresses together as * recognizable units. * * Having done the above, there isn't much need to recognize URLs. * If a URL is a spam indicator, very likely any other URL from the * same site is as well, so the hostname part should be an adequate * statistical trigger. * * LEXED_TOKENS, which are found in "msg-count" files need a special pattern * because they can be: * 1 - normal bogofilter tokens * 2 - url:xxx and subj: tokens * 3 - mime boundaries */ /* 12 May 2003 * Added Paul Graham's latest ideas on parsing. * (From http://www.paulgraham.com/better.html) * * 1. Case is preserved. * * 2. Exclamation points are constituent characters. * * 3. Periods and commas are constituents if they occur between two * digits. This lets me get ip addresses and prices intact. * * 4. A price range like $20-25 yields two tokens, $20 and $25. * * 5. Tokens that occur within the To, From, Subject, and Return-Path * lines, or within urls, get marked accordingly. * For example. "foo" in the Subject line becomes "subj:foo". */ /* DR 08/29/2003: ** ** With flex-2.5.31 and '%option never-interactive noreject', file ** msg.dr.0118.base64 (in tests/bogofilter/inputs/split.d) parses ** incorrectly because line 24 isn't base64 decoded. */ #define YY_NO_INPUT #include "common.h" #include #include #include "buff.h" #include "charset.h" #include "lexer.h" #include "mime.h" /* for mime_*() */ #include "msgcounts.h" #include "textblock.h" #include "token.h" #include "xmalloc.h" #define YY_DECL token_t yylex(void) YY_DECL; /* declare function */ #define YY_INPUT(buf,result,max_size) result = yyinput((byte *)buf, result, max_size) #define YY_EXIT_FAILURE EX_ERROR #undef stderr #define stderr dbgout /* for debug & -D options */ static int lineno; #define FLEX_VER(MAJ, MIN, SUB) ( MAJ * 1000 + MIN * 100 + SUB) #ifndef YY_FLEX_SUBMINOR_VERSION #define FLEX_VERSION_BF FLEX_VER(YY_FLEX_MAJOR_VERSION, YY_FLEX_MINOR_VERSION, 0) #else #define FLEX_VERSION_BF FLEX_VER(YY_FLEX_MAJOR_VERSION, YY_FLEX_MINOR_VERSION, YY_FLEX_SUBMINOR_VERSION) #endif #if FLEX_VERSION_BF != 2531 int yylineno; #endif /* Function Prototypes/Forward Declarations */ static word_t *yy_text(void); static void html_char(void); static void html_reorder(void); static void url_char(void); static void skip_to(char chr); static void yy_unput(const byte *txt, uint len); char yy_get_state(void); void yy_set_state_initial(void); static void header(void); /* Function Definitions */ static word_t *yy_text(void) { static word_t yyt; yyt.u.text = (byte *)yytext; yyt.leng = yyleng; return &yyt; } /*********************************************************************** WARNING: The scanner must be interactive so as not to look ahead past \n = EOH and other header/body delimiters, else it will fail when MIME decoding, because part of the body has already been read ahead. ***********************************************************************/ /* RFC2047.2 encoded-word = "=?" charset "?" encoding "?" encoded-text "?=" charset = token ; see section 3 encoding = token ; see section 4 token = 1* especials = "(" / ")" / "<" / ">" / "@" / "," / ";" / ":" / " <"> / "/" / "[" / "]" / "?" / "." / "=" encoded-text = 1* ; (but see "Use of encoded-words in message ; headers", section 5) */ /* 09/01/03 Using "[^?]" in the pattern and validating the charset in 'C' reduces executable size by approx 290k. new: ENCODED_WORD =\?{CHARSET}\?[bq]\?[^?]*\?= old: ENCODED_WORD =\?{CHARSET}\?(b\?{BASE64}\|q\?{QP})\?= BASE64 [0-9a-zA-Z/+=]+ QP [!->@-~]+ */ /* HTML_WI_COMMENTS "<"[^>]*">" HTML_WO_COMMENTS "<"[^!][^>]*">"\|"<>" */ /* * Generally, there are some html tags that cause an "eyebreak" and some * that do not. For example, the "P" tag or the "BR" tag cause a break, * and can be interpreted in place, while, the B (bold) tag does not. * No close tags seem to cause a break. * Comments do not. This is an attempt to make an exhaustive list of * tags that cause an "eyebreak". When the exit tag also causes a break, * we include the /?. I believe this to be a complete list of tags that * can cause a formatting break. */ #line 2248 "lexer_v3.c" #define INITIAL 0 #define TEXT 1 #define HTML 2 #define BOGO_LEX 3 #define HTOKEN 4 #define HDISCARD 5 #define SCOMMENT 6 #define LCOMMENT 7 #define PGP_HEAD 8 #define PGP_BODY 9 #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-c-only */ #include /* %endif */ /* %if-c++-only */ /* %endif */ #endif #ifndef YY_EXTRA_TYPE #define YY_EXTRA_TYPE void * #endif /* %if-c-only Reentrant structure and macros (non-C++). */ /* %if-reentrant */ /* %if-c-only */ static int yy_init_globals (void ); /* %endif */ /* %if-reentrant */ /* %endif */ /* %endif End reentrant structures and macros. */ /* Accessor methods to globals. These are made visible to non-reentrant scanners for convenience. */ int yylex_destroy (void ); int yyget_debug (void ); void yyset_debug (int debug_flag ); YY_EXTRA_TYPE yyget_extra (void ); void yyset_extra (YY_EXTRA_TYPE user_defined ); FILE *yyget_in (void ); void yyset_in (FILE * in_str ); FILE *yyget_out (void ); void yyset_out (FILE * out_str ); yy_size_t yyget_leng (void ); char *yyget_text (void ); int yyget_lineno (void ); void yyset_lineno (int line_number ); /* %if-bison-bridge */ /* %endif */ /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int yywrap (void ); #else extern int yywrap (void ); #endif #endif /* %not-for-header */ static void yyunput (int c,char *buf_ptr ); /* %ok-for-header */ /* %endif */ #ifndef yytext_ptr static void yy_flex_strncpy (char *,yyconst char *,int ); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen (yyconst char * ); #endif #ifndef YY_NO_INPUT /* %if-c-only Standard (non-C++) definition */ /* %not-for-header */ #ifdef __cplusplus static int yyinput (void ); #else static int input (void ); #endif /* %ok-for-header */ /* %endif */ #endif /* %if-c-only */ /* %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 /* %if-c-only Standard (non-C++) definition */ /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0) /* %endif */ /* %if-c++-only C++ definition */ /* %endif */ #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) \ /* %% [5.0] fread()/read() definition of YY_INPUT goes here unless we're doing C++ \ */\ if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ { \ int c = '*'; \ size_t 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); \ } \ }\ \ /* %if-c++-only C++ definition \ */\ /* %endif */ #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 /* %if-c-only */ #define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) /* %endif */ /* %if-c++-only */ /* %endif */ #endif /* %if-tables-serialization structures and prototypes */ /* %not-for-header */ /* %ok-for-header */ /* %not-for-header */ /* %tables-yydmap generated elements */ /* %endif */ /* end tables serialization structures and prototypes */ /* %ok-for-header */ /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef YY_DECL #define YY_DECL_IS_OURS 1 /* %if-c-only Standard (non-C++) definition */ extern int yylex (void); #define YY_DECL int yylex (void) /* %endif */ /* %if-c++-only C++ definition */ /* %endif */ #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 /* %% [6.0] YY_RULE_SETUP definition goes here */ #define YY_RULE_SETUP \ if ( yyleng > 0 ) \ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \ (yytext[yyleng - 1] == '\n'); \ YY_USER_ACTION /* %not-for-header */ /** 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; /* %% [7.0] user's declarations go here */ #line 224 "./lexer_v3.l" #line 2505 "lexer_v3.c" if ( !(yy_init) ) { (yy_init) = 1; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! (yy_start) ) (yy_start) = 1; /* first start state */ if ( ! yyin ) /* %if-c-only */ yyin = stdin; /* %endif */ /* %if-c++-only */ /* %endif */ if ( ! yyout ) /* %if-c-only */ yyout = stdout; /* %endif */ /* %if-c++-only */ /* %endif */ if ( ! YY_CURRENT_BUFFER ) { yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ); } yy_load_buffer_state( ); } while ( 1 ) /* loops until end-of-file is reached */ { /* %% [8.0] yymore()-related code goes here */ yy_cp = (yy_c_buf_p); /* Support of yytext. */ *yy_cp = (yy_hold_char); /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; /* %% [9.0] code to set up and find next match goes here */ yy_current_state = (yy_start); yy_current_state += YY_AT_BOL(); yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (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 >= 770 ) 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] != 5655 ); yy_find_action: /* %% [10.0] code to find the action number goes here */ yy_act = yy_accept[yy_current_state]; if ( yy_act == 0 ) { /* have to back up */ yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); yy_act = yy_accept[yy_current_state]; } YY_DO_BEFORE_ACTION; /* %% [11.0] code for yylineno update goes here */ do_action: /* This label is used only to access EOF actions. */ /* %% [12.0] debug code goes here */ if ( yy_flex_debug ) { if ( yy_act == 0 ) fprintf( stderr, "--scanner backing up\n" ); else if ( yy_act < 43 ) fprintf( stderr, "--accepting rule at line %ld (\"%s\")\n", (long)yy_rule_linenum[yy_act], yytext ); else if ( yy_act == 43 ) fprintf( stderr, "--accepting default rule (\"%s\")\n", yytext ); else if ( yy_act == 44 ) fprintf( stderr, "--(end of buffer or a NUL)\n" ); else fprintf( stderr, "--EOF (start condition %d)\n", YY_START ); } switch ( yy_act ) { /* beginning of action switch */ /* %% [13.0] actions go here */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = (yy_hold_char); yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); goto yy_find_action; case 1: YY_RULE_SETUP #line 226 "./lexer_v3.l" { if (lineno == 0) { BEGIN BOGO_LEX; set_msg_counts_from_str(strchr(yytext, ' ') + 1); } return MSG_COUNT_LINE; } YY_BREAK case 2: *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */ (yy_c_buf_p) = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 232 "./lexer_v3.l" { return BOGO_LEX_LINE; } YY_BREAK case 3: /* rule 3 can match eol */ YY_RULE_SETUP #line 233 "./lexer_v3.l" { lineno += 1; } YY_BREAK case 4: /* rule 4 can match eol */ YY_RULE_SETUP #line 235 "./lexer_v3.l" { word_t *raw = yy_text(); word_t *txt = text_decode(raw); yy_unput(txt->u.text, txt->leng); } YY_BREAK case 5: YY_RULE_SETUP #line 240 "./lexer_v3.l" { set_tag(yytext); } YY_BREAK case 6: YY_RULE_SETUP #line 241 "./lexer_v3.l" { mime_content(yy_text()); skip_to(':'); header(); return TOKEN; } YY_BREAK case 7: YY_RULE_SETUP #line 243 "./lexer_v3.l" { /* save token for logging */ unsigned long off = 11; while(isspace((unsigned char)yytext[off]) && off < yyleng) off++; set_msg_id((unsigned char *)(yytext+off), yyleng-off); header(); return HEADKEY; } YY_BREAK case 8: #line 252 "./lexer_v3.l" case 9: #line 253 "./lexer_v3.l" case 10: YY_RULE_SETUP #line 253 "./lexer_v3.l" { header(); return HEADKEY; } YY_BREAK case 11: YY_RULE_SETUP #line 255 "./lexer_v3.l" { mime_boundary_set(yy_text()); } YY_BREAK case 12: YY_RULE_SETUP #line 256 "./lexer_v3.l" { got_charset(yytext); skip_to('='); header(); return TOKEN; } YY_BREAK case 13: YY_RULE_SETUP #line 258 "./lexer_v3.l" /* ignore */ YY_BREAK case 14: /* rule 14 can match eol */ YY_RULE_SETUP #line 259 "./lexer_v3.l" { return QUEUE_ID; } YY_BREAK /********************************************************************** WARNING: Do NOT add header () rules that require characters beyond a LF character (\n) - doing so will make the parser read ahead parts of the body in the wrong MIME decoding mode and goof up seriously. **********************************************************************/ case 15: /* rule 15 can match eol */ YY_RULE_SETUP #line 268 "./lexer_v3.l" { enum mimetype type = get_content_type(); have_body = true; msg_header = false; clr_tag(); switch (type) { case MIME_TEXT_HTML: BEGIN HTML; break; case MIME_MESSAGE: yy_set_state_initial(); break; default: BEGIN TEXT; } if (DEBUG_LEXER(1)) fprintf(dbgout, "*** end of header\n"); return EOH; } YY_BREAK case 16: YY_RULE_SETUP #line 281 "./lexer_v3.l" { header(); return TOKEN; } YY_BREAK case 17: /* rule 17 can match eol */ YY_RULE_SETUP #line 282 "./lexer_v3.l" { lineno += 1; } YY_BREAK case 18: YY_RULE_SETUP #line 284 "./lexer_v3.l" { skip_to('='); return VERP; } YY_BREAK case 19: *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */ (yy_c_buf_p) = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 286 "./lexer_v3.l" { BEGIN PGP_HEAD; yy_unput((byte *)yytext, yyleng); } YY_BREAK case 20: /* rule 20 can match eol */ YY_RULE_SETUP #line 289 "./lexer_v3.l" { BEGIN PGP_BODY; } YY_BREAK case 21: YY_RULE_SETUP #line 290 "./lexer_v3.l" { /* ignore */ } YY_BREAK case 22: *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */ (yy_c_buf_p) = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 291 "./lexer_v3.l" { BEGIN TEXT; yy_unput((byte *)yytext, yyleng); } YY_BREAK case 23: *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */ (yy_c_buf_p) = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 294 "./lexer_v3.l" { if (got_mime_boundary(yy_text())) { yy_set_state_initial(); return BOUNDARY; } else { yyless(2); } } YY_BREAK /* This has to match just as much or more than the below rules, so as to be the controlling rule. */ case 24: /* rule 24 can match eol */ YY_RULE_SETUP #line 304 "./lexer_v3.l" { char *chr = memchr(yytext, '<', yyleng); /* find start of html tag */ size_t len = chr - yytext; yyless(len); return TOKEN; } YY_BREAK case 25: /* rule 25 can match eol */ *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */ (yy_c_buf_p) = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 311 "./lexer_v3.l" { html_reorder(); } YY_BREAK case 26: YY_RULE_SETUP #line 313 "./lexer_v3.l" { BEGIN SCOMMENT; } YY_BREAK case 27: YY_RULE_SETUP #line 314 "./lexer_v3.l" { BEGIN LCOMMENT; } YY_BREAK case 28: /* rule 28 can match eol */ YY_RULE_SETUP #line 315 "./lexer_v3.l" { BEGIN HTOKEN; } YY_BREAK case 29: YY_RULE_SETUP #line 316 "./lexer_v3.l" { BEGIN HDISCARD; } /* unknown tag */ YY_BREAK case 30: YY_RULE_SETUP #line 318 "./lexer_v3.l" { return TOKEN; } YY_BREAK case 31: YY_RULE_SETUP #line 319 "./lexer_v3.l" { /* discard innards of html tokens and comments */ } YY_BREAK case 32: YY_RULE_SETUP #line 321 "./lexer_v3.l" { BEGIN HTML; } /* end of tag, loose comment; return to normal html processing */ YY_BREAK case 33: YY_RULE_SETUP #line 322 "./lexer_v3.l" { BEGIN HTML; } /* end of strict comment; return to normal html processing */ YY_BREAK case 34: YY_RULE_SETUP #line 323 "./lexer_v3.l" { BEGIN HTML; } YY_BREAK case 35: YY_RULE_SETUP #line 325 "./lexer_v3.l" { return IPADDR;} YY_BREAK case 36: YY_RULE_SETUP #line 326 "./lexer_v3.l" { return MESSAGE_ADDR;} YY_BREAK case 37: YY_RULE_SETUP #line 328 "./lexer_v3.l" { return TOKEN;} YY_BREAK case 38: YY_RULE_SETUP #line 330 "./lexer_v3.l" { html_char(); } /* process escaped chars, eg 'e' is 'a' */ YY_BREAK case 39: YY_RULE_SETUP #line 331 "./lexer_v3.l" { url_char(); } /* process escaped chars, eg '%61' is 'a' */ YY_BREAK case 40: YY_RULE_SETUP #line 333 "./lexer_v3.l" { return MONEY;} /* Dollars and cents */ YY_BREAK case 41: YY_RULE_SETUP #line 335 "./lexer_v3.l" /* ignore character */ YY_BREAK case 42: /* rule 42 can match eol */ YY_RULE_SETUP #line 336 "./lexer_v3.l" { lineno += 1; clr_tag(); } YY_BREAK case YY_STATE_EOF(INITIAL): case YY_STATE_EOF(TEXT): case YY_STATE_EOF(HTML): case YY_STATE_EOF(BOGO_LEX): case YY_STATE_EOF(HTOKEN): case YY_STATE_EOF(HDISCARD): case YY_STATE_EOF(SCOMMENT): case YY_STATE_EOF(LCOMMENT): case YY_STATE_EOF(PGP_HEAD): case YY_STATE_EOF(PGP_BODY): #line 337 "./lexer_v3.l" { return NONE; } YY_BREAK case 43: YY_RULE_SETUP #line 338 "./lexer_v3.l" ECHO; YY_BREAK #line 2917 "lexer_v3.c" case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *yy_cp = (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. */ (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 ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) { /* This was really a NUL. */ yy_state_type yy_next_state; (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( ); /* 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 ); yy_bp = (yytext_ptr) + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++(yy_c_buf_p); yy_current_state = yy_next_state; goto yy_match; } else { /* %% [14.0] code to do back-up for compressed tables and set up yy_cp goes here */ yy_cp = (yy_c_buf_p); goto yy_find_action; } } else switch ( yy_get_next_buffer( ) ) { case EOB_ACT_END_OF_FILE: { (yy_did_buffer_switch_on_eof) = 0; if ( yywrap( ) ) { /* 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. */ (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! (yy_did_buffer_switch_on_eof) ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( ); yy_cp = (yy_c_buf_p); yy_bp = (yytext_ptr) + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: (yy_c_buf_p) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; yy_current_state = yy_get_previous_state( ); yy_cp = (yy_c_buf_p); yy_bp = (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 */ /* %ok-for-header */ /* %if-c++-only */ /* %not-for-header */ /* %ok-for-header */ /* %endif */ /* 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 */ /* %if-c-only */ static int yy_get_next_buffer (void) /* %endif */ /* %if-c++-only */ /* %endif */ { register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; register char *source = (yytext_ptr); register int number_to_move, i; int ret_val; if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(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 ( (yy_c_buf_p) - (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) ((yy_c_buf_p) - (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 = (yy_n_chars) = 0; else { yy_size_t 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_LVALUE; int yy_c_buf_p_offset = (int) ((yy_c_buf_p) - b->yy_ch_buf); if ( b->yy_is_our_buffer ) { yy_size_t 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 ); } 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" ); (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]), (yy_n_chars), num_to_read ); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } if ( (yy_n_chars) == 0 ) { if ( number_to_move == YY_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; yyrestart(yyin ); } 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) ((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 = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); } (yy_n_chars) += number_to_move; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; (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 */ /* %if-c-only */ /* %not-for-header */ static yy_state_type yy_get_previous_state (void) /* %endif */ /* %if-c++-only */ /* %endif */ { register yy_state_type yy_current_state; register char *yy_cp; /* %% [15.0] code to get the start state into yy_current_state goes here */ yy_current_state = (yy_start); yy_current_state += YY_AT_BOL(); for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) { /* %% [16.0] code to find the next state goes here */ register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (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 >= 770 ) 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 ); */ /* %if-c-only */ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) /* %endif */ /* %if-c++-only */ /* %endif */ { register int yy_is_jam; /* %% [17.0] code to find the next state, and perhaps do backing up, goes here */ register char *yy_cp = (yy_c_buf_p); register YY_CHAR yy_c = 1; if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (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 >= 770 ) 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 == 769); return yy_is_jam ? 0 : yy_current_state; } /* %if-c-only */ static void yyunput (int c, register char * yy_bp ) /* %endif */ /* %if-c++-only */ /* %endif */ { register char *yy_cp; yy_cp = (yy_c_buf_p); /* undo effects of setting up yytext */ *yy_cp = (yy_hold_char); if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register yy_size_t number_to_move = (yy_n_chars) + 2; register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; register char *source = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) *--dest = *--source; yy_cp += (int) (dest - source); yy_bp += (int) (dest - source); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size; if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) YY_FATAL_ERROR( "flex scanner push-back overflow" ); } *--yy_cp = (char) c; /* %% [18.0] update yylineno here */ (yytext_ptr) = yy_bp; (yy_hold_char) = *yy_cp; (yy_c_buf_p) = yy_cp; } /* %if-c-only */ /* %endif */ /* %if-c-only */ #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput (void) #else static int input (void) #endif /* %endif */ /* %if-c++-only */ /* %endif */ { int c; *(yy_c_buf_p) = (yy_hold_char); if ( *(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 ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) /* This was really a NUL. */ *(yy_c_buf_p) = '\0'; else { /* need more input */ yy_size_t offset = (yy_c_buf_p) - (yytext_ptr); ++(yy_c_buf_p); switch ( yy_get_next_buffer( ) ) { 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 ); /*FALLTHROUGH*/ case EOB_ACT_END_OF_FILE: { if ( yywrap( ) ) return EOF; if ( ! (yy_did_buffer_switch_on_eof) ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + offset; break; } } } c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ *(yy_c_buf_p) = '\0'; /* preserve yytext */ (yy_hold_char) = *++(yy_c_buf_p); /* %% [19.0] update BOL and yylineno */ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n'); return c; } /* %if-c-only */ #endif /* ifndef YY_NO_INPUT */ /* %endif */ /** Immediately switch to a different input stream. * @param input_file A readable stream. * * @note This function does not reset the start condition to @c INITIAL . */ /* %if-c-only */ void yyrestart (FILE * input_file ) /* %endif */ /* %if-c++-only */ /* %endif */ { if ( ! YY_CURRENT_BUFFER ){ yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ); } yy_init_buffer(YY_CURRENT_BUFFER,input_file ); yy_load_buffer_state( ); } /** Switch to a different input buffer. * @param new_buffer The new input buffer. * */ /* %if-c-only */ void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) /* %endif */ /* %if-c++-only */ /* %endif */ { /* TODO. We should be able to replace this entire function body * with * yypop_buffer_state(); * yypush_buffer_state(new_buffer); */ yyensure_buffer_stack (); if ( YY_CURRENT_BUFFER == new_buffer ) return; if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(yy_c_buf_p) = (yy_hold_char); YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } YY_CURRENT_BUFFER_LVALUE = new_buffer; yy_load_buffer_state( ); /* 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. */ (yy_did_buffer_switch_on_eof) = 1; } /* %if-c-only */ static void yy_load_buffer_state (void) /* %endif */ /* %if-c++-only */ /* %endif */ { (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; (yy_hold_char) = *(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. * * @return the allocated buffer state. */ /* %if-c-only */ YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) /* %endif */ /* %if-c++-only */ /* %endif */ { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); 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 ); 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 ); return b; } /** Destroy the buffer. * @param b a buffer created with yy_create_buffer() * */ /* %if-c-only */ void yy_delete_buffer (YY_BUFFER_STATE b ) /* %endif */ /* %if-c++-only */ /* %endif */ { 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 ); yyfree((void *) b ); } /* 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. */ /* %if-c-only */ static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) /* %endif */ /* %if-c++-only */ /* %endif */ { int oerrno = errno; yy_flush_buffer(b ); 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; } /* %if-c-only */ b->yy_is_interactive = 1; /* %endif */ /* %if-c++-only */ /* %endif */ 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. * */ /* %if-c-only */ void yy_flush_buffer (YY_BUFFER_STATE b ) /* %endif */ /* %if-c++-only */ /* %endif */ { 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( ); } /* %if-c-or-c++ */ /** 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. * */ /* %if-c-only */ void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) /* %endif */ /* %if-c++-only */ /* %endif */ { if (new_buffer == NULL) return; yyensure_buffer_stack(); /* This block is copied from yy_switch_to_buffer. */ if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(yy_c_buf_p) = (yy_hold_char); YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } /* Only push if top exists. Otherwise, replace top. */ if (YY_CURRENT_BUFFER) (yy_buffer_stack_top)++; YY_CURRENT_BUFFER_LVALUE = new_buffer; /* copied from yy_switch_to_buffer. */ yy_load_buffer_state( ); (yy_did_buffer_switch_on_eof) = 1; } /* %endif */ /* %if-c-or-c++ */ /** Removes and deletes the top of the stack, if present. * The next element becomes the new top. * */ /* %if-c-only */ void yypop_buffer_state (void) /* %endif */ /* %if-c++-only */ /* %endif */ { if (!YY_CURRENT_BUFFER) return; yy_delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; if ((yy_buffer_stack_top) > 0) --(yy_buffer_stack_top); if (YY_CURRENT_BUFFER) { yy_load_buffer_state( ); (yy_did_buffer_switch_on_eof) = 1; } } /* %endif */ /* %if-c-or-c++ */ /* Allocates the stack if it does not exist. * Guarantees space for at least one push. */ /* %if-c-only */ static void yyensure_buffer_stack (void) /* %endif */ /* %if-c++-only */ /* %endif */ { yy_size_t num_to_alloc; if (!(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; (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc (num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); (yy_buffer_stack_max) = num_to_alloc; (yy_buffer_stack_top) = 0; return; } if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ /* Increase the buffer to prepare for a possible push. */ int grow_size = 8 /* arbitrary grow size */; num_to_alloc = (yy_buffer_stack_max) + grow_size; (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc ((yy_buffer_stack), num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); /* zero only the new slots.*/ memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); (yy_buffer_stack_max) = num_to_alloc; } } /* %endif */ /* %if-c-only */ /** 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 * * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) { 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 ) ); 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 ); return b; } /* %endif */ /* %if-c-only */ /** 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 * * @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 ) { return yy_scan_bytes(yystr,strlen(yystr) ); } /* %endif */ /* %if-c-only */ /** 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 yybytes the byte buffer to scan * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. * * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, yy_size_t _yybytes_len ) { 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 ); 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 ); 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; } /* %endif */ #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif /* %if-c-only */ static void yy_fatal_error (yyconst char* msg ) { (void) fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* %endif */ /* %if-c++-only */ /* %endif */ /* 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] = (yy_hold_char); \ (yy_c_buf_p) = yytext + yyless_macro_arg; \ (yy_hold_char) = *(yy_c_buf_p); \ *(yy_c_buf_p) = '\0'; \ yyleng = yyless_macro_arg; \ } \ while ( 0 ) /* Accessor methods (get/set functions) to struct members. */ /* %if-c-only */ /* %if-reentrant */ /* %endif */ /** Get the current line number. * */ int yyget_lineno (void) { return yylineno; } /** Get the input stream. * */ FILE *yyget_in (void) { return yyin; } /** Get the output stream. * */ FILE *yyget_out (void) { return yyout; } /** Get the length of the current token. * */ yy_size_t yyget_leng (void) { return yyleng; } /** Get the current token. * */ char *yyget_text (void) { return yytext; } /* %if-reentrant */ /* %endif */ /** Set the current line number. * @param line_number * */ void yyset_lineno (int line_number ) { yylineno = line_number; } /** Set the input stream. This does not discard the current * input buffer. * @param in_str A readable stream. * * @see yy_switch_to_buffer */ void yyset_in (FILE * in_str ) { yyin = in_str ; } void yyset_out (FILE * out_str ) { yyout = out_str ; } int yyget_debug (void) { return yy_flex_debug; } void yyset_debug (int bdebug ) { yy_flex_debug = bdebug ; } /* %endif */ /* %if-reentrant */ /* %if-bison-bridge */ /* %endif */ /* %endif if-c-only */ /* %if-c-only */ static int yy_init_globals (void) { /* Initialization is the same as for the non-reentrant scanner. * This function is called from yylex_destroy(), so don't allocate here. */ (yy_buffer_stack) = 0; (yy_buffer_stack_top) = 0; (yy_buffer_stack_max) = 0; (yy_c_buf_p) = (char *) 0; (yy_init) = 0; (yy_start) = 0; /* 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; } /* %endif */ /* %if-c-only SNIP! this currently causes conflicts with the c++ scanner */ /* yylex_destroy is for both reentrant and non-reentrant scanners. */ int yylex_destroy (void) { /* Pop the buffer stack, destroying each element. */ while(YY_CURRENT_BUFFER){ yy_delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; yypop_buffer_state(); } /* Destroy the stack itself. */ yyfree((yy_buffer_stack) ); (yy_buffer_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( ); /* %if-reentrant */ /* %endif */ return 0; } /* %endif */ /* * Internal utility routines. */ #ifndef yytext_ptr static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) { 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 ) { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif void *yyalloc (yy_size_t size ) { return (void *) malloc( size ); } void *yyrealloc (void * ptr, yy_size_t size ) { /* 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 ) { free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ } /* %if-tables-serialization definitions */ /* %define-yytables The name for this specific scanner's tables. */ #define YYTABLES_NAME "yytables" /* %endif */ /* %ok-for-header */ #line 338 "./lexer_v3.l" static void header(void) { set_tag("Header"); } void lexer_v3_init(FILE *fp) { lineno = 0; have_body = false; yy_set_state_initial(); yyrestart(fp); } static void skip_to(char chr) { size_t len = strchr(yytext, chr) - yytext; yyless(len); } static void html_reorder(void) { char *chr = memchr(yytext, '<', yyleng); /* find start of html tag */ size_t len = chr - yytext; char *yycopy = xmalloc(yyleng + 1); /* +1 for NUL byte below */ memcpy(yycopy, yytext+len, yyleng-len); /* copy tag to start of buffer */ memcpy(yycopy+yyleng-len, yytext, len); /* copy leading text to end of buffer */ yycopy[yyleng] = '\0'; /* for debugging */ yy_unput((byte *)yycopy, yyleng); xfree(yycopy); } static int xtoi(char *in, size_t len) { int val = 0; while (isxdigit((byte) *in) && (len-- > 0)) { char c = *in++; val <<= 4; val += isdigit((byte)c) ? (c - '0') : (tolower((byte)c) - 'a' + 10); } return val; } static void html_char(void) { char *txt = strstr(yytext, "&#"); /* find decodable char */ size_t len = txt - yytext; int val; char *yycopy = NULL; if (len != 0) { yycopy = xmalloc(yyleng + 1); /* +1 for NUL byte below */ memcpy(yycopy, yytext, yyleng); /* copy tag to start of buffer */ yycopy[yyleng] = '\0'; /* for debugging */ } txt += 2; val = isdigit((byte) *txt) ? atoi(txt) : xtoi(txt+1, 4); /* xtoi() limits conversion to 4 characters */ /* atoi() limits value to 0x7fffffff, i.e. 2147483647 */ /* no problem on linux */ if ((val > 0) && (val < 256) && isprint(val)) { /* use it if printable */ yyunput(val, yytext); yyleng = len; /* adjust len to pre-char count */ } else { if (yycopy) yycopy[yyleng-1] = ' '; /* prevents parsing loop */ } if (yycopy != NULL) { yy_unput((byte *)yycopy, yyleng); xfree(yycopy); } } static void url_char(void) { char *src, *dst; src = dst = yytext; while (src < yytext + yyleng) { char c = *src++; if (c == '%') { c = xtoi(src, 2); src += 2; } *dst++ = c; } while (dst > yytext) { yyunput(*--dst, yytext); } } static void yy_unput(const byte *txt, uint len) { while (len-- > 0) yyunput(txt[len], yytext); } char yy_get_state() { switch (YYSTATE) { case INITIAL: return 'i'; case TEXT: return 't'; case HTML: case HTOKEN: return 'h'; case SCOMMENT: return 's'; case LCOMMENT: return 'l'; default: return 'o'; } } void yy_set_state_initial(void) { BEGIN INITIAL; msg_header = true; header(); if (DEBUG_LEXER(1)) fprintf(dbgout, "BEGIN INITIAL\n"); #ifdef FLEX_DEBUG yy_flex_debug = BOGOTEST('L'); #endif } long lexer_v3_get_token(byte **output) { *output = (byte *)yytext; return yyleng; } /* * The following sets edit modes for GNU EMACS * Local Variables: * mode:c * indent-tabs-mode:t * End: */ bogofilter-1.2.4/src/datastore_db_trans.c0000644000175000017500000005674312163572272016661 0ustar sezsez/* $Id: datastore_db_trans.c 6484 2006-05-29 14:28:00Z relson $ */ /***************************************************************************** NAME: datastore_db_trad.c -- implements bogofilter's traditional (non-transactional) datastore, using Berkeley DB AUTHORS: Gyepi Sam 2002 - 2003 Matthias Andree 2003 - 2004 David Relson 2005 ******************************************************************************/ #include "common.h" #include #include #include #include #include "datastore.h" #include "datastore_db_private.h" #include "datastore_db.h" #include "datastore_dbcommon.h" #include "bool.h" #include "db_lock.h" #include "longoptions.h" #include "mxcat.h" #include "rand_sleep.h" #include "xmalloc.h" #include "xstrdup.h" static int lockfd = -1; /* fd of lock file to prevent concurrent recovery */ /** Default flags for DB_ENV->open() */ static const u_int32_t dbenv_defflags = DB_INIT_MPOOL | DB_INIT_LOG | DB_INIT_TXN; /* public -- used in datastore.c */ static int dbx_begin (void *vhandle); static int dbx_abort (void *vhandle); static int dbx_commit (void *vhandle); /* private -- used in datastore_db_*.c */ static DB_ENV *dbx_get_env_dbe (dbe_t *env); static const char *dbx_database_name (const char *db_file); static DB_ENV *dbx_recover_open (bfpath *bfp); static int dbx_auto_commit_flags(void); static int dbx_get_rmw_flag (int open_mode); static ex_t dbx_common_close (DB_ENV *dbe, bfpath *bfp); static int dbx_sync (DB_ENV *dbe, int ret); static void dbx_log_flush (DB_ENV *dbe); static dbe_t *dbx_init (bfpath *bfp); static void dbx_cleanup (dbe_t *env); static void dbx_cleanup_lite (dbe_t *env); static ex_t dbe_env_purgelogs (DB_ENV *dbe); static ex_t dbx_checkpoint (bfpath *bfp); static ex_t dbx_purgelogs (bfpath *bfp); static ex_t dbx_recover (bfpath *bfp, bool catastrophic, bool force); static ex_t dbx_remove (bfpath *bfp); static ex_t dbx_list_logfiles (bfpath *bfp, int argc, char **argv); /* OO function lists */ dsm_t dsm_transactional = { /* public -- used in datastore.c */ &dbx_begin, &dbx_abort, &dbx_commit, /* private -- used in datastore_db_*.c */ &dbx_init, &dbx_cleanup, &dbx_cleanup_lite, &dbx_get_env_dbe, &dbx_database_name, &dbx_recover_open, &dbx_auto_commit_flags, &dbx_get_rmw_flag, &db_lock, &dbx_common_close, &dbx_sync, &dbx_log_flush, &db_pagesize, &dbx_checkpoint, &dbx_purgelogs, &dbx_recover, &dbx_remove, &db_verify, &dbx_list_logfiles, &db_leafpages }; /* non-OO static function prototypes */ static int plock(const char *path, short locktype, int mode); static int db_try_glock(bfpath *bfp, short locktype, int lockcmd); static int bf_dbenv_create(DB_ENV **dbe); static void dbe_config(void *vhandle); static dbe_t *dbe_xinit(dbe_t *env, bfpath *bfp, u_int32_t flags); static DB_ENV *dbe_recover_open(bfpath *bfp, u_int32_t flags); /* support functions */ static bool get_bool(const char *name, const char *arg) { bool b = str_to_bool(arg); if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> %s\n", name, b ? "Yes" : "No"); return b; } static e_txn get_txn(const char *name, const char *arg) { e_txn t = get_bool(name, arg) ? T_ENABLED : T_DISABLED; if (DEBUG_CONFIG(2)) fprintf(dbgout, "%s -> %s\n", name, t ? "enabled" : "disabled"); return t; } /* non-OO static functions */ DB_ENV *dbx_get_env_dbe(dbe_t *env) { return env->dbe; } const char *dbx_database_name(const char *db_file) { const char *t; t = strrchr(db_file, DIRSEP_C); if (t != NULL) t += 1; return t; } int dbx_auto_commit_flags(void) { #if DB_AT_LEAST(4,1) return DB_AUTO_COMMIT; #else return 0; #endif } int dbx_get_rmw_flag(int open_mode) { (void)open_mode; return 0; } /** print user-readable diagnostics and instructions after DB_ENV->open * failed. */ static void diag_dbeopen( /** DB_ENV->open() flags value */ u_int32_t flags, /** env directory tried to open */ bfpath *bfp) { if (flags & DB_RECOVER) { fprintf(stderr, "\n" "### Standard recovery failed. ###\n" "\n" "Please check section 3.3 in bogofilter's README.db file\n" "for help.\n"); /* ask that the user runs catastrophic recovery */ } else if (flags & DB_RECOVER_FATAL) { fprintf(stderr, "\n" "### Catastrophic recovery failed. ###\n" "\n" "Please check the README.db file that came with bogofilter for hints,\n" "section 3.3, or remove all __db.*, log.* and *.db files in \"%s\"\n" "and start from scratch.\n", bfp->dirname); /* catastrophic recovery failed */ } else { fprintf(stderr, "To recover, run: bogoutil -v --db-recover \"%s\"\n", bfp->dirname); } } /** run recovery, open environment and keep the exclusive lock */ static DB_ENV *dbe_recover_open(bfpath *bfp, u_int32_t flags) { const u_int32_t local_flags = flags | DB_CREATE; DB_ENV *dbe; int e; if (DEBUG_DATABASE(0)) fprintf(dbgout, "trying to lock database directory\n"); db_try_glock(bfp, F_WRLCK, F_SETLKW); /* wait for exclusive lock */ /* run recovery */ bf_dbenv_create(&dbe); if (DEBUG_DATABASE(0)) fprintf(dbgout, "running regular data base recovery%s\n", flags & DB_PRIVATE ? " and removing environment" : ""); /* quirk: DB_RECOVER requires DB_CREATE and cannot work with DB_JOINENV */ /* * Hint from Keith Bostic, SleepyCat support, 2004-11-29, * we can use the DB_PRIVATE flag, that rebuilds the database * environment in heap memory, so we don't need to remove it. */ e = dbe->open(dbe, bfp->dirname, dbenv_defflags | local_flags | DB_RECOVER, DS_MODE); if (e != 0) { print_error(__FILE__, __LINE__, "Cannot recover environment \"%s\": %s", bfp->dirname, db_strerror(e)); if (e == DB_RUNRECOVERY) diag_dbeopen(flags, bfp); exit(EX_ERROR); } return dbe; } static DB_ENV *dbx_recover_open(bfpath *bfp) { return dbe_recover_open(bfp, 0); } static int dbx_begin(void *vhandle) { DB_TXN *t; int ret; dbh_t *dbh = vhandle; dbe_t *env = dbh->dbenv; assert(dbh); assert(dbh->magic == MAGIC_DBH); assert(dbh->txn == 0); assert(env); assert(env->dbe); ret = BF_TXN_BEGIN(env->dbe, NULL, &t, 0); if (ret) { print_error(__FILE__, __LINE__, "DB_ENV->txn_begin(%p), err: %d, %s", (void *)env->dbe, ret, db_strerror(ret)); return ret; } dbh->txn = t; if (DEBUG_DATABASE(2)) fprintf(dbgout, "DB_ENV->dbx_begin(%p), tid: %lx\n", (void *)env->dbe, (unsigned long)BF_TXN_ID(t)); return 0; } static int dbx_abort(void *vhandle) { int ret; dbh_t *dbh = vhandle; DB_TXN *t; assert(dbh); assert(dbh->magic == MAGIC_DBH); t = dbh->txn; assert(t); ret = BF_TXN_ABORT(t); if (ret) print_error(__FILE__, __LINE__, "DB_TXN->abort(%lx) error: %s", (unsigned long)BF_TXN_ID(t), db_strerror(ret)); else if (DEBUG_DATABASE(2)) fprintf(dbgout, "DB_TXN->abort(%lx)\n", (unsigned long)BF_TXN_ID(t)); dbh->txn = NULL; switch (ret) { case 0: return DST_OK; case DB_LOCK_DEADLOCK: return DST_TEMPFAIL; default: return DST_FAILURE; } } static int dbx_commit(void *vhandle) { int ret; dbh_t *dbh = vhandle; DB_TXN *t; u_int32_t id; assert(dbh); assert(dbh->magic == MAGIC_DBH); t = dbh->txn; assert(t); id = BF_TXN_ID(t); ret = BF_TXN_COMMIT(t, 0); if (ret) print_error(__FILE__, __LINE__, "DB_TXN->commit(%lx) error: %s", (unsigned long)id, db_strerror(ret)); else if (DEBUG_DATABASE(2)) fprintf(dbgout, "DB_TXN->commit(%lx, 0)\n", (unsigned long)id); dbh->txn = NULL; switch (ret) { case 0: /* push out buffer pages so that >=15% are clean - we * can ignore errors here, as the log has all the data */ BF_MEMP_TRICKLE(dbh->dbenv->dbe, 15, NULL); return DST_OK; case DB_LOCK_DEADLOCK: return DST_TEMPFAIL; default: return DST_FAILURE; } } /** set an fcntl-style lock on \a path. * \a locktype is F_RDLCK, F_WRLCK, F_UNLCK * \a mode is F_SETLK or F_SETLKW * \return file descriptor of locked file if successful * negative value in case of error */ static int plock(const char *path, short locktype, int mode) { struct flock fl; int fd, r; fd = open(path, O_RDWR); if (fd < 0) return fd; fl.l_type = locktype; fl.l_whence = SEEK_SET; fl.l_start = (off_t)0; fl.l_len = (off_t)0; r = fcntl(fd, mode, &fl); if (r < 0) return r; return fd; } static int db_try_glock(bfpath *bfp, short locktype, int lockcmd) { int ret; char *t; /* lock */ ret = bf_mkdir(bfp->dirname, DIR_MODE); if (ret && errno != EEXIST) { print_error(__FILE__, __LINE__, "mkdir(%s): %s", bfp->dirname, strerror(errno)); exit(EX_ERROR); } t = mxcat(bfp->dirname, DIRSEP_S, "lockfile-d", NULL); /* All we are interested in is that this file exists, we'll close it * right away as plock down will open it again */ ret = open(t, O_RDWR|O_CREAT|O_EXCL, DS_MODE); if (ret < 0 && errno != EEXIST) { print_error(__FILE__, __LINE__, "open(%s): %s", t, strerror(errno)); exit(EX_ERROR); } if (ret >= 0) close(ret); lockfd = plock(t, locktype, lockcmd); if (lockfd < 0 && errno != EAGAIN && errno != EACCES) { print_error(__FILE__, __LINE__, "lock(%s): %s", t, strerror(errno)); exit(EX_ERROR); } xfree(t); /* lock set up */ return lockfd; } /** Create environment or exit with EX_ERROR */ static int bf_dbenv_create(DB_ENV **env) { int ret = db_env_create(env, 0); if (ret != 0) { print_error(__FILE__, __LINE__, "db_env_create, err: %d, %s", ret, db_strerror(ret)); exit(EX_ERROR); } if (DEBUG_DATABASE(1)) fprintf(dbgout, "db_env_create: %p\n", (void *)env); (*env)->set_errfile(*env, stderr); return ret; } static void dbe_config(void *vhandle) { dbe_t *env = vhandle; int ret = 0; u_int32_t logsize = 1048576; /* 1 MByte (default in BDB 10 MByte) */ /* configure log file size */ ret = env->dbe->set_lg_max(env->dbe, logsize); if (ret) { print_error(__FILE__, __LINE__, "DB_ENV->set_lg_max(%lu) err: %d, %s", (unsigned long)logsize, ret, db_strerror(ret)); exit(EX_ERROR); } if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB_ENV->set_lg_max(%lu)\n", (unsigned long)logsize); } static dbe_t *dbx_init(bfpath *bfp) { u_int32_t flags = 0; dbe_t *env = xcalloc(1, sizeof(dbe_t)); env->magic = MAGIC_DBE; /* poor man's type checking */ env->directory = xstrdup(bfp->dirname); /* open lock file, needed to detect previous crashes */ if (init_dbl(bfp->dirname)) exit(EX_ERROR); /* run recovery if needed */ if (needs_recovery()) { dbx_recover(bfp, false, false); /* DO NOT set force flag here, may cause multiple recovery! */ /* reinitialize */ if (init_dbl(bfp->dirname)) exit(EX_ERROR); } /* set (or demote to) shared/read lock for regular operation */ db_try_glock(bfp, F_RDLCK, F_SETLKW); /* set our cell lock in the crash detector */ if (set_lock()) { exit(EX_ERROR); } /* initialize */ #ifdef FUTURE_DB_OPTIONS #ifdef DB_BF_TXN_NOT_DURABLE if (db_txn_durable) flags ^= DB_BF_TXN_NOT_DURABLE; #endif #endif dbe_xinit(env, bfp, flags); return env; } /* dummy infrastructure, to be expanded by environment * or transactional initialization/shutdown */ static dbe_t *dbe_xinit(dbe_t *env, bfpath *bfp, u_int32_t flags) { int ret; env->magic = MAGIC_DBE; /* poor man's type checking */ ret = bf_dbenv_create(&env->dbe); if (db_cachesize != 0 && (ret = env->dbe->set_cachesize(env->dbe, db_cachesize/1024, (db_cachesize % 1024) * 1024*1024, 1)) != 0) { print_error(__FILE__, __LINE__, "DB_ENV->set_cachesize(%u), err: %d, %s", db_cachesize, ret, db_strerror(ret)); exit(EX_ERROR); } if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB_ENV->set_cachesize(%u)\n", db_cachesize); dbe_config(env); flags |= DB_CREATE | dbenv_defflags; ret = env->dbe->open(env->dbe, bfp->dirname, flags, DS_MODE); if (ret != 0) { env->dbe->close(env->dbe, 0); print_error(__FILE__, __LINE__, "DB_ENV->open, err: %d, %s", ret, db_strerror(ret)); switch (ret) { case DB_RUNRECOVERY: diag_dbeopen(flags, bfp); break; case EINVAL: fprintf(stderr, "\n" "If you have just got a message that only private environments are supported,\n" "your Berkeley DB %d.%d was not configured properly.\n" "Bogofilter requires shared environments to support Berkeley DB transactions.\n", DB_VERSION_MAJOR, DB_VERSION_MINOR); fprintf(stderr, "Reconfigure and recompile Berkeley DB with the right mutex interface,\n" "see the docs/ref/build_unix/conf.html file that comes with your db source code.\n" "This can happen when the DB library was compiled with POSIX threads\n" "but your system does not support NPTL.\n"); break; } exit(EX_ERROR); } if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB_ENV->open(home=%s)\n", bfp->dirname); return env; } static void dbx_cleanup(dbe_t *env) { dbx_cleanup_lite(env); } /* close the environment, but do not release locks */ static void dbx_cleanup_lite(dbe_t *env) { if (env) { if (env->dbe) { int ret; /* checkpoint if more than 64 kB of logs have been written * or 120 min have passed since the previous checkpoint */ /* kB min flags */ ret = BF_TXN_CHECKPOINT(env->dbe, 64, 120, 0); ret = dbx_sync(env->dbe, ret); if (ret) print_error(__FILE__, __LINE__, "DBE->dbx_checkpoint err: %d, %s", ret, db_strerror(ret)); if (db_log_autoremove) dbe_env_purgelogs(env->dbe); ret = env->dbe->close(env->dbe, 0); if (DEBUG_DATABASE(1) || ret) fprintf(dbgout, "DB_ENV->close(%p): %s\n", (void *)env->dbe, db_strerror(ret)); clear_lock(); if (lockfd >= 0) close(lockfd); /* release locks */ } xfree(env->directory); xfree(env); } } static int dbx_sync(DB_ENV *dbe, int ret) { #if DB_AT_LEAST(3,0) && DB_AT_MOST(4,0) /* flush dirty pages in buffer pool */ while (ret == DB_INCOMPLETE) { rand_sleep(10000,1000000); ret = BF_MEMP_SYNC(dbe, NULL); } #else (void)dbe; ret = 0; #endif return ret; } ex_t dbx_recover(bfpath *bfp, bool catastrophic, bool force) { dbe_t *env = xcalloc(1, sizeof(dbe_t)); /* set exclusive/write lock for recovery */ while ((force || needs_recovery()) && (db_try_glock(bfp, F_WRLCK, F_SETLKW) <= 0)) rand_sleep(10000,1000000); /* ok, when we have the lock, a concurrent process may have * proceeded with recovery */ if (!(force || needs_recovery())) return EX_OK; if (DEBUG_DATABASE(0)) fprintf(dbgout, "running %s data base recovery\n", catastrophic ? "catastrophic" : "regular"); env = dbe_xinit(env, bfp, catastrophic ? DB_RECOVER_FATAL : DB_RECOVER); if (env == NULL) { exit(EX_ERROR); } clear_lockfile(); dbx_cleanup_lite(env); return EX_OK; } static ex_t dbx_common_close(DB_ENV *dbe, bfpath *bfp) { int e; if (db_log_autoremove) dbe_env_purgelogs(dbe); if (DEBUG_DATABASE(0)) fprintf(dbgout, "closing environment\n"); e = dbe->close(dbe, 0); if (e != 0) { print_error(__FILE__, __LINE__, "Error closing environment \"%s\": %s", bfp->dirname, db_strerror(e)); exit(EX_ERROR); } clear_lock(); db_try_glock(bfp, F_UNLCK, F_SETLKW); /* release lock */ return EX_OK; } static ex_t dbe_env_purgelogs(DB_ENV *dbe) { char **i, **list; ex_t e; /* figure redundant log files and nuke them */ e = BF_LOG_ARCHIVE(dbe, &list, DB_ARCH_ABS); if (e != 0) { print_error(__FILE__, __LINE__, "DB_ENV->log_archive failed: %s", db_strerror(e)); exit(EX_ERROR); } if (list != NULL) { if (DEBUG_DATABASE(0)) fprintf(dbgout, "removing inactive logfiles\n"); for (i = list; *i != NULL; i++) { if (DEBUG_DATABASE(1)) fprintf(dbgout, " removing logfile %s\n", *i); if (unlink(*i)) { if (errno != ENOENT) print_error(__FILE__, __LINE__, "cannot unlink \"%s\": %s", *i, strerror(errno)); /* proceed anyways */ } } xfree(list); } return EX_OK; } /** checkpoint the open environment \a dbe once and unconditionally */ static ex_t dbe_env_checkpoint(DB_ENV *dbe) { int e; if (DEBUG_DATABASE(0)) fprintf(dbgout, "checkpoint database\n"); /* checkpoint the transactional system */ e = BF_TXN_CHECKPOINT(dbe, 0, 0, 0); e = dbx_sync(dbe, e); if (e != 0) { print_error(__FILE__, __LINE__, "DB_ENV->txn_checkpoint failed: %s", db_strerror(e)); exit(EX_ERROR); } return EX_OK; } static ex_t dbe_simpleop(bfpath *bfp, ex_t func(DB_ENV *env)) { ex_t e; DB_ENV *dbe = dbe_recover_open(bfp, 0); if (dbe == NULL) exit(EX_ERROR); e = func(dbe); dbx_common_close(dbe, bfp); return e; } ex_t dbx_checkpoint(bfpath *bfp) { return dbe_simpleop(bfp, dbe_env_checkpoint); } static ex_t i_purgelogs(DB_ENV *dbe) { int e = dbe_env_checkpoint(dbe); if (e != 0) return e; else return dbe_env_purgelogs(dbe); } ex_t dbx_purgelogs(bfpath *bfp) { return dbe_simpleop(bfp, i_purgelogs); } ex_t dbx_remove(bfpath *bfp) { DB_ENV *dbe = dbe_recover_open(bfp, DB_PRIVATE); if (dbe == NULL) exit(EX_ERROR); return dbx_common_close(dbe, bfp); } void dbx_log_flush(DB_ENV *dbe) { int ret; ret = BF_LOG_FLUSH(dbe, NULL); if (DEBUG_DATABASE(1)) fprintf(dbgout, "DB_ENV->log_flush(%p): %s\n", (void *)dbe, db_strerror(ret)); } const char **dsm_help_bogofilter(void) { static const char *help_text[] = { NULL }; return &help_text[0]; } const char **dsm_help_bogoutil(void) { static const char *help_text[] = { "environment maintenance:\n", " --db-transaction=BOOL - enable or disable transactions\n", " (only effective at creation time)\n", " --db-verify=file - verify data file.\n", " --db-checkpoint=dir - flush buffer cache and checkpoint database\n", " --db-list-logfiles=dir [FLAGS]\n" " - list logfiles in environment\n", " --db-prune=dir - remove inactive log files in dir.\n", " --db-recover=dir - run recovery on database in dir.\n", " --db-recover-harder=dir - run catastrophic recovery on database.\n", " --db-remove-environment - remove environment.\n", #ifdef HAVE_DECL_DB_CREATE " --db-lk-max-locks - set max lock count.\n", " --db-lk-max-objects - set max object count.\n", " --db-log-autoremove - set autoremoving of logs.\n", #ifdef FUTURE_DB_OPTIONS " --db-txn-durable - set durable mode.\n", #endif #endif "\n", NULL }; return &help_text[0]; } bool dsm_options_bogofilter(int option, const char *name, const char *val) { switch (option) { case O_DB_TRANSACTION: eTransaction = get_txn(name, val); return true; #ifdef HAVE_DECL_DB_CREATE case O_DB_LOG_AUTOREMOVE: db_log_autoremove = get_bool(name, val); return true; #ifdef FUTURE_DB_OPTIONS case O_DB_TXN_DURABLE: db_txn_durable = get_bool(name, val); return true; #endif #endif default: return false; } } bool dsm_options_bogoutil(int option, cmd_t *flag, int *count, const char **ds_file, const char *name, const char *val) { switch (option) { case O_DB_TRANSACTION: eTransaction = get_txn(name, val); return true; case O_DB_RECOVER: *flag = M_RECOVER; *count += 1; *ds_file = val; return true; case O_DB_RECOVER_HARDER: *flag = M_CRECOVER; *count += 1; *ds_file = val; return true; case O_DB_CHECKPOINT: *flag = M_CHECKPOINT; *count += 1; *ds_file = val; return true; case O_DB_LIST_LOGFILES: *flag = M_LIST_LOGFILES; *count += 1; *ds_file = val; return true; case O_DB_PRUNE: *flag = M_PURGELOGS; *count += 1; *ds_file = val; return true; case O_DB_REMOVE_ENVIRONMENT: *flag = M_REMOVEENV; *ds_file = val; *count += 1; return true; #ifdef FUTURE_DB_OPTIONS case O_DB_TXN_DURABLE: db_txn_durable = get_bool(name, val); return true; #endif default: return false; } } /** probe if the directory contains an environment, and if so, * if it has transactions */ e_txn probe_txn(bfpath *bfp) { DB_ENV *dbe; int r; #if DB_AT_LEAST(4,2) u_int32_t flags; #endif r = db_env_create(&dbe, 0); if (r) { print_error(__FILE__, __LINE__, "cannot create environment handle: %s", db_strerror(r)); return T_ERROR; } /* we might call dbe->set_flags here to set DB_NOPANIC, but this is * only supported from 4.1 onwards and probably not worth the * effort, we'll just check for DB_RUNRECOVERY */ #if DB_AT_LEAST(3,2) r = dbe->open(dbe, bfp->dirname, DB_JOINENV, DS_MODE); #else r = ENOENT; #endif if (r == DB_RUNRECOVERY) { dbe->close(dbe, 0); return T_ENABLED; } if (r == ENOENT) { struct stat st; int w; char *t = bfp->filepath; struct dirent *de; e_txn rc = T_DONT_KNOW; DIR *d; /* no environment found by JOINENV, but clean up handle */ dbe->close(dbe, 0); /* retry, looking for log\.[0-9]{10} files - needed for instance * after bogoutil --db-remove DIR or when DB_JOINENV is * unsupported */ d = opendir(bfp->dirname); if (d == NULL) { print_error(__FILE__, __LINE__, "cannot open directory %s: %s", t, strerror(r)); rc = T_ERROR; } else { while ((errno = 0, de = readdir(d))) { if (strlen(de->d_name) == 14 && strncmp(de->d_name, "log.", 4) == 0 && strspn(de->d_name + 4, "0123456789") == 10) { rc = T_ENABLED; break; } } if (errno) rc = T_ERROR; closedir(d); if (rc != T_ERROR && rc != T_ENABLED) { w = stat(t, &st); if (w == 0) { rc = T_DISABLED; } else if (errno != ENOENT) { rc = T_ERROR; print_error(__FILE__, __LINE__, "cannot stat %s: %s", t, db_strerror(r)); } } } return rc; } /* if (r == ENOENT) for environment join */ if (r != 0) { print_error(__FILE__, __LINE__, "cannot join environment: %s", db_strerror(r)); return T_ERROR; } /* environment found, validate if it has transactions */ #if DB_AT_LEAST(4,2) r = dbe->get_open_flags(dbe, &flags); if (r) { print_error(__FILE__, __LINE__, "cannot query flags: %s", db_strerror(r)); return T_ERROR; } dbe->close(dbe, 0); if ((flags & DB_INIT_TXN) == 0) { print_error(__FILE__, __LINE__, "environment found but does not support transactions."); return T_ERROR; } #else dbe->close(dbe, 0); #endif return T_ENABLED; } static ex_t dbx_list_logfiles(bfpath *bfp, int argc, char **argv) { ex_t e; char **list, **i; int j; u_int32_t flags = 0; DB_ENV *dbe = dbe_recover_open(bfp, 0); if (dbe == NULL) exit(EX_ERROR); for (j = 0; j < argc; j++) { if (strcasecmp(argv[j], "all") == 0) flags |= DB_ARCH_LOG; if (strcasecmp(argv[j], "absolute") == 0) flags |= DB_ARCH_ABS; } e = BF_LOG_ARCHIVE(dbe, &list, flags); if (e != 0) { print_error(__FILE__, __LINE__, "DB_ENV->log_archive failed: %s", db_strerror(e)); exit(EX_ERROR); } if (list) { for (i = list; *i; i++) { if (flags & DB_ARCH_ABS) puts(*i); else printf("%s%s%s\n", bfp->dirname, DIRSEP_S, *i); } } xfree(list); fflush(stdout); e = ferror(stdout) ? EX_ERROR : EX_OK; if (dbx_common_close(dbe, bfp)) e = EX_ERROR; return e; } bogofilter-1.2.4/src/paths.h0000644000175000017500000000567012163572304014130 0ustar sezsez/* $Id: paths.h 6207 2005-08-14 13:10:06Z relson $ */ /** * \file * paths.h -- prototypes and definitions for paths.c. */ #ifndef PATHS_H #define PATHS_H #include "common.h" #define OLD_PATHS /* Path Definitions */ #if !defined(_OS2_) && !defined(__riscos__) #define BOGODIR ".bogofilter" #else #define BOGODIR "bogofilter" #endif #define WORDLIST "wordlist" DB_EXT extern char *bogohome; typedef enum bfmode_e { BFP_ERROR, BFP_MUST_EXIST, BFP_MAY_CREATE } bfpath_mode; /* typedef and struct definitions */ typedef struct bfpath { bool checked; /* if bfpath_check_mode has been called */ bool exists; bool isdir; bool isfile; char *dirname; /* directory only */ char *filename; /* filename only */ char *filepath; /* dirname+filename */ } bfpath; /* Function Prototypes */ bfpath *bfpath_create(const char *path); void bfpath_set_bogohome(bfpath *bfp); bool bfpath_check_mode(bfpath *bfp, bfpath_mode mode); bfpath *bfpath_free(bfpath *path); bool paths_equal(bfpath *p1, bfpath *p2); void bfpath_set_filename(bfpath *bfp, const char *filename); void set_bogohome(const char *dirname); void chk_bogohome(void); void set_bogohome_using_dirname(const char *dirname); void bogohome_cleanup(void); int set_wordlist_dir(const char* dir, priority_t precedence); enum bfpath_e { BFP_NORMAL = 1 }; typedef enum bfpath_e bfpath_t; /** Build a path to a file given a directory and file name in malloc()d * memory (caller freed), concatenating dir and file, adding a slash if * necessary. \return * - true for success * - false for error (esp. overflow) */ char *build_path(const char* dir, const char* file); char *build_progtype(const char *name, const char *db_type); /** If the given environment variable \a var exists, create a path from * it and tack on the optional \a subdir value. * \return * - buffer address if success * - NULL if failure */ char *create_path_from_env(const char *var, /*@null@*/ const char *subdir); char *get_directory(priority_t which); /** \return malloc'd copy of just the file name of \a path */ char *get_file_from_path(const char *path); /** \return malloc'd copy of just the directory name of \a path */ char *get_directory_from_path(const char *path); /** Check whether \a path is a directory or a symlink to a directory. * \return * - true if \a path is a directory * - false if \a path is a file or an error occurred */ bool is_dir(const char* path) /*@globals errno,stderr@*/; /** Check whether \a path is a file (everything that is not a directory * or a symlink to a directory). * \return * - true if \a path is a file * - false if \a path is a directory or an error occurred */ bool is_file(const char* path) /*@globals errno,stderr@*/; /** Check that directory \a path exists and try to create it otherwise. * \return * - true on success * - false on error */ bool check_directory(const char *path) /*@globals errno,stderr@*/; #endif /* PATHS_H */ bogofilter-1.2.4/src/bogoconfig.h0000644000175000017500000000144312163572304015117 0ustar sezsez/* $Id: bogoconfig.h 6713 2008-04-19 03:20:54Z relson $ */ /***************************************************************************** NAME: bogoconfig.h -- prototypes and definitions for bogoconfig.c. AUTHOR: David Relson ******************************************************************************/ #ifndef BOGOCONFIG_H #define BOGOCONFIG_H #include "configfile.h" /* Global variables */ extern const char *logtag; extern const char *spam_header_name; extern const char *spam_header_place; extern const char *user_config_file; extern rc_t query_config(void); extern void process_parameters(int argc, char **argv, bool warn_on_error); extern int process_arg(int option, const char *name, const char *arg, priority_t precedence, arg_pass_t pass); #endif bogofilter-1.2.4/src/bogoutil.c0000644000175000017500000005621312163572304014627 0ustar sezsez/* $Id: bogoutil.c 6993 2013-06-28 21:54:23Z m-a $ */ /***************************************************************************** NAME: bogoutil.c -- dumps & loads bogofilter text files from/to Berkeley DB format. AUTHORS: Gyepi Sam David Relson ******************************************************************************/ #include "common.h" #include #include #include #include #include #include "getopt.h" #include "bogoconfig.h" #include "bogofilter.h" #include "bogohist.h" #include "bool.h" #include "buff.h" #include "configfile.h" #include "datastore.h" #include "datastore_db.h" #include "error.h" #include "longoptions.h" #include "maint.h" #include "msgcounts.h" #include "paths.h" #include "prob.h" #include "rand_sleep.h" #include "robx.h" #include "sighandler.h" #include "swap.h" #include "wordlists.h" #include "xmalloc.h" #include "xstrdup.h" /* prototypes for dummies below: */ #include "score.h" const char *progname = "bogoutil"; static int token_count = 0; static bool maintain = false; static bool onlyprint = false; /* Function Definitions */ /* dummies to avoid score.o */ double msg_spamicity(void) { return .0; } rc_t msg_status(void) { return RC_OK; } static void ds_open_failure(bfpath *bfp, void *dbe) { fprintf(stderr, "Error accessing file or directory '%s'.\n", bfp->filepath); if (errno != 0) fprintf(stderr, "error #%d - %s.\n", errno, strerror(errno)); if (dbe != NULL) ds_cleanup(dbe); exit(EX_ERROR); } static int ds_dump_hook(word_t *key, dsv_t *data, /*@unused@*/ void *userdata) /* returns 0 if ok, 1 if not ok */ { (void)userdata; if (fDie) exit(EX_ERROR); token_count += 1; if (maintain && discard_token(key, data)) return 0; if (replace_nonascii_characters) do_replace_nonascii_characters(key->u.text, key->leng); fprintf(fpo, "%.*s %lu %lu", CLAMP_INT_MAX(key->leng), key->u.text, (unsigned long)data->spamcount, (unsigned long)data->goodcount); if (data->date) fprintf(fpo, " %lu", (unsigned long)data->date); fprintf(fpo, "\n"); fflush(stdout); /* solicit ferror flag if output is shorter than buffer */ return ferror(stdout) ? 1 : 0; } static ex_t dump_wordlist(bfpath *bfp) { ex_t rc; void *dbe; token_count = 0; dbe = ds_init(bfp); rc = ds_oper(dbe, bfp, DS_READ, ds_dump_hook, NULL); ds_cleanup(dbe); if (rc != EX_OK) fprintf(stderr, "error dumping tokens!\n"); else if (verbose) fprintf(dbgout, "%d tokens dumped\n", token_count); return rc; } #define BUFSIZE 512 const char POSIX_space[] = " \f\n\r\t\v"; static byte *spanword(byte *t) { /* skip leading whitespace */ t += strspn((const char *)t, POSIX_space); /* span current word */ t += strcspn((const char *)t, POSIX_space); if (*t) *t++ = '\0'; return t; } /** determines if the token is a regular token or a special non-count * token (.ROBX, .WORDLIST_VERSION), returns true if the token is a * count token */ static bool is_count(const char *in) { static const char *const msgc = MSG_COUNT; static const char *const enco = WORDLIST_ENCODING; /* anything that doesn't start with a . is a count */ if (in[0] != '.') return true; /* .MSG_COUNT is also a count */ if (strcmp(in, msgc) == 0) return true; /* .ENCODING is also a count */ if (strcmp(in, enco) == 0) return true; return false; } static ex_t load_wordlist(bfpath *bfp) { void *dsh; byte buf[BUFSIZE]; byte *p; int rv = 0; size_t len; int load_count = 0; unsigned long line = 0; unsigned long count[IX_SIZE], date; YYYYMMDD today_save = today; void *dbe = ds_init(bfp); dsh = ds_open(dbe, bfp, DS_WRITE | DS_LOAD); if (dsh == NULL) /* print error, cleanup, and exit */ ds_open_failure(bfp, dbe); memset(buf, '\0', BUFSIZE); if (DST_OK != ds_txn_begin(dsh)) exit(EX_ERROR); for (;;) { dsv_t data; word_t *token; if (fgets((char *)buf, BUFSIZE, fpin) == NULL) { if (ferror(fpin)) { perror(progname); rv = 2; } break; } line++; len = strlen((char *)buf); /* too short. */ if (len < 4) continue; p = spanword(buf); len = strlen((const char *)buf); if (max_token_len != 0 && len > max_token_len) continue; /* too long - discard */ spamcount = (uint) atoi((const char *)p); if ((int) spamcount < 0) spamcount = 0; p = spanword(p); goodcount = (uint) atoi((const char *)p); if ((int) goodcount < 0) goodcount = 0; p = spanword(p); date = (uint) atoi((const char *)p); p = spanword(p); if (*p != '\0') { fprintf(stderr, "%s: Unexpected input [%s] on line %lu. " "Expecting whitespace before count.\n", progname, buf, line); rv = 1; break; } if (date == 0) /* date as YYYYMMDD */ date = today_save; if (replace_nonascii_characters) do_replace_nonascii_characters(buf, len); token = word_new(buf, len); data.goodcount = goodcount; data.spamcount = spamcount; data.date = date; if (is_count((const char *)buf) && !(maintain && discard_token(token, &data))) { load_count += 1; /* Slower, but allows multiple lists to be concatenated */ set_date(date); switch (ds_read(dsh, token, &data)) { case 0: case 1: break; default: rv = 1; } data.spamcount += spamcount; data.goodcount += goodcount; if (ds_write(dsh, token, &data)) rv = 1; } word_free(token); } if (rv) { fprintf(stderr, "read or write error, aborting.\n"); ds_txn_abort(dsh); } else { switch (ds_txn_commit(dsh)) { case DST_FAILURE: case DST_TEMPFAIL: fprintf(stderr, "commit failed\n"); exit(EX_ERROR); case DST_OK: break; } } ds_close(dsh); ds_cleanup(dbe); if (verbose) fprintf(dbgout, "%d tokens loaded\n", load_count); return rv; } static int get_token(buff_t *buff, FILE *fp) { int rv = 0; if (fgets((char *)buff->t.u.text, buff->size, fp) == NULL) { if (ferror(fp)) { perror(progname); rv = 2; } else { rv = 1; } } else { buff->t.leng = (uint) strlen((const char *)buff->t.u.text); if (buff->t.u.text[buff->t.leng - 1] == '\n' ) { buff->t.leng -= 1; buff->t.u.text[buff->t.leng] = (byte) '\0'; } else { fprintf(stderr, "%s: Unexpected input [%s]. Does not end with newline " "or line too long.\n", progname, buff->t.u.text); rv = 1; } } return rv; } static ex_t display_words(bfpath *bfp, int argc, char **argv, bool show_probability) { byte buf[BUFSIZE]; buff_t *buff = buff_new(buf, 0, BUFSIZE); const byte *word; const char *path = bfp->filepath; const char *head_format = !show_probability ? "%-30s %6s %6s\n" : "%-30s %6s %6s %6s\n"; const char *data_format = !show_probability ? "%-30s %6lu %6lu\n" : "%-30s %6lu %6lu %f\n"; void *dsh = NULL; /* initialize to silence bogus gcc warning */ void *dbe; int rv = 0; dsv_t msgcnts; /* protect against broken stat(2) that succeeds for empty names */ if (path == NULL || *path == '\0') { fprintf(stderr, "Expecting non-empty directory or file name.\n"); return EX_ERROR; } dbe = ds_init(bfp); dsh = ds_open(dbe, bfp, DS_READ);; if (dsh == NULL) /* print error, cleanup, and exit */ ds_open_failure(bfp, dbe); if (DST_OK != ds_txn_begin(dsh)) { ds_close(dsh); ds_cleanup(dbe); fprintf(stderr, "Cannot begin transaction.\n"); return EX_ERROR; } if (show_probability) { ds_get_msgcounts(dsh, &msgcnts); robs = ROBS; robx = ROBX; } fprintf(fpo, head_format, "", "spam", "good", " Fisher"); while (argc >= 0) { dsv_t val; word_t *token; int rc; unsigned long spam_count; unsigned long good_count; double rob_prob = 0.0; if (argc == 0) { if (get_token(buff, stdin) != 0) break; token = &buff->t; } else { word = (const byte *) *argv++; if (--argc == 0) argc = -1; token = word_news((const char *)word); } rc = ds_read(dsh, token, &val); switch (rc) { case 0: spam_count = val.spamcount; good_count = val.goodcount; if (!show_probability) fprintf(fpo, data_format, token->u.text, spam_count, good_count); else { rob_prob = calc_prob(good_count, spam_count, msgcnts.goodcount, msgcnts.spamcount); fprintf(fpo, data_format, token->u.text, spam_count, good_count, rob_prob); } break; case 1: break; default: fprintf(stderr, "Cannot read from database.\n"); rv = EX_ERROR; goto finish; } if (token != &buff->t) word_free(token); } finish: if (DST_OK != rv ? ds_txn_abort(dsh) : ds_txn_commit(dsh)) { fprintf(stderr, "Cannot %s transaction.\n", rv ? "abort" : "commit"); rv = EX_ERROR; } ds_close(dsh); ds_cleanup(dbe); buff_free(buff); return rv; } static ex_t get_robx(bfpath *bfp) { double rx; int ret = 0; init_wordlist("word", bfp->filepath, 0, WL_REGULAR); rx = compute_robinson_x(); if (rx < 0) return EX_ERROR; if (onlyprint) printf("%f\n", rx); else { dsv_t val; word_t *word_robx = word_news(ROBX_W); /* since compute_robinson_x() closes the wordlists, init_wordlist() must be called again */ init_wordlist("word", bfp->filepath, 0, WL_REGULAR); open_wordlists(DS_WRITE); val.goodcount = 0; val.spamcount = (uint32_t) (rx * 1000000); do { ret = ds_write(word_lists->dsh, word_robx, &val); if (ret == DS_ABORT_RETRY) { rand_sleep(1000, 1000000); begin_wordlist(word_lists); } } while (ret == DS_ABORT_RETRY); close_wordlists(true); free_wordlists(); word_free(word_robx); } return ret ? EX_ERROR : EX_OK; } static void print_version(void) { (void)fprintf(stdout, "%s version %s\n" " Database: %s\n" "Copyright (C) 2002-2010 David Relson, Matthias Andree\n" "Copyright (C) 2002-2003 Gyepi Sam.\n\n" "%s comes with ABSOLUTELY NO WARRANTY. " "This is free software, and\nyou are welcome to " "redistribute it under the General Public License. " "See\nthe COPYING file with the source distribution for " "details.\n" "\n", progname, version, ds_version_str(), PACKAGE); } static void usage(FILE *fp) { fprintf(fp, "Usage: %s {-h|-V}\n", progname); fprintf(fp, " or: %s [OPTIONS] {-d|-l|-u|-m|-w|-p|--db-verify} file%s\n", progname, DB_EXT); fprintf(fp, " or: %s [OPTIONS] {-H|-r|-R} file\n", progname); #if defined (ENABLE_DB_DATASTORE) || defined (ENABLE_SQLITE_DATASTORE) fprintf(fp, " or: %s [OPTIONS] {--db-print-leafpage-count} file%s\n", progname, DB_EXT); fprintf(fp, " or: %s [OPTIONS] {--db-print-pagesize} file%s\n", progname, DB_EXT); #endif #if defined(ENABLE_DB_DATASTORE) && !defined(DISABLE_TRANSACTIONS) fprintf(fp, " or: %s [OPTIONS] {--db-checkpoint} directory\n", progname); fprintf(fp, " or: %s [OPTIONS] {--db-list-logfiles} directory [list options]\n", progname); fprintf(fp, " or: %s [OPTIONS] {--db-prune|--db-remove-environment} directory\n", progname); fprintf(fp, " or: %s [OPTIONS] {--db-recover|--db-recover-harder} directory\n", progname); #endif } static const char *help_text[] = { "\n", "OPTIONS are:\n", " -C, --no-config-file - don't read standard config files.\n", " -D, --debug-to-stdout - direct debug output to stdout.\n", #ifdef ENABLE_DB_DATASTORE " -k, --db-cachesize=size - set Berkeley DB cache size (MB).\n", #endif " -v, --verbosity - set debug verbosity level.\n", " -x, --debug-flags=list - set flags to display debug information.\n", " -y, --timestamp-date=date - set default date (format YYYYMMDD).\n", "\n", "Modes of operation are:\n", " -h, --help - print this help message and exit.\n", " -V, --version - print version information and exit.\n", "\n", " -d, --dump=file - dump data from file to stdout.\n", " -l, --load=file - load data from stdin into file.\n", " -u, --upgrade=file - upgrade wordlist version.\n", "\n", "info options:\n", " -w file - display counts for words from stdin.\n", " -p file - display word counts and probabilities.\n", " -I, --input-file=file - read 'file' instead of standard input.\n", " -H file - display histogram and statistics for wordlist.\n", " - use with -v to exclude hapaxes.\n", " - use with -vv to exclude pure spam/ham.\n", " -r file - compute Robinson's X for the specified file.\n", " -R file - compute Robinson's X and save it in wordlist.\n", "\n", "database maintenance, the \"-m file\" option is required in this group:\n", " -m file - enable maintenance works (expiring tokens).\n", " -n - replace non-ascii characters with '?'.\n", " -a age - exclude tokens with older ages.\n", " -c cnt - exclude tokens with lower counts.\n", " -s l,h - exclude tokens with lengths between 'l' and 'h'\n" " (low and high).\n", #ifndef DISABLE_UNICODE " --unicode=yes/no - convert wordlist to/from unicode\n", #endif "\n", "token parsing options:\n", " --min-token-len - min len for single tokens\n", " --max-token-len - max len for single tokens\n", " --max-multi-token-len - max len for multi-word tokens\n", " --multi-token-count - number of tokens per multi-word token\n", "\n", NULL }; static void help(FILE *fp) { uint i; const char **messages; usage(fp); messages = help_text; for (i=0; messages[i] != NULL; i++) (void)fprintf(fp, "%s", messages[i]); messages = dsm_help_bogoutil(); for (i=0; messages[i] != NULL; i++) (void)fprintf(fp, "%s", messages[i]); (void)fprintf(fp, "%s (version %s) is part of the bogofilter package.\n", progname, version ); } static const char *ds_file = NULL; static bool prob = false; static cmd_t flag = M_NONE; static struct option longopts_bogoutil[] = { /* longoptions.h - common options */ LONGOPTIONS_COMMON /* longoptions.h - options for bogofilter and bogoutil */ LONGOPTIONS_DB /* longoptions.h - options for bogolexer and bogoutil */ LONGOPTIONS_LEX_UTIL /* bogoutil specific options */ { "db-prune", R, 0, O_DB_PRUNE }, { "db-checkpoint", R, 0, O_DB_CHECKPOINT }, { "db-list-logfiles", R, 0, O_DB_LIST_LOGFILES }, { "db-print-leafpage-count", R, 0, O_DB_PRINT_LEAFPAGE_COUNT }, { "db-print-pagesize", R, 0, O_DB_PRINT_PAGESIZE }, { "db-recover", R, 0, O_DB_RECOVER }, { "db-recover-harder", R, 0, O_DB_RECOVER_HARDER }, { "db-remove-environment", R, 0, O_DB_REMOVE_ENVIRONMENT }, { "db-verify", R, 0, O_DB_VERIFY }, /* end of list */ { NULL, 0, 0, 0 } }; #define OPTIONS ":a:c:Cd:DhH:I:k:l:m:nO:p:r:R:s:u:vVw:x:X:y:" static int process_arglist(int argc, char **argv) { int option; int count = 0; fpin = stdin; fpo = stdout; dbgout = stderr; #ifdef __EMX__ _response (&argc, &argv); /* expand response files (@filename) */ _wildcard (&argc, &argv); /* expand wildcards (*.*) */ #endif /* default: no token length checking */ max_token_len = 0; while (1) { int option_index = 0; int this_option_optind = optind ? optind : 1; const char *name; option = getopt_long_chk(argc, argv, OPTIONS, longopts_bogoutil, &option_index); if (option == -1) break; name = (option_index == 0) ? argv[this_option_optind] : longopts_bogoutil[option_index].name; count += process_arg(option, name, optarg, PR_NONE, PASS_1_CLI); } if (max_token_len != 0 && max_multi_token_len == 0) { /* token length checking ... */ if (multi_token_count == 1) max_multi_token_len = max_token_len + MAX_PREFIX_LEN; else max_multi_token_len = max_token_len = (max_token_len+1) * multi_token_count + MAX_PREFIX_LEN; } if (count != 1) { usage(stderr); fprintf(stderr, "%s: Exactly one of the file or directory commands must be present.\n", progname); exit(EX_ERROR); } return count; } int process_arg(int option, const char *name, const char *val, priority_t precedence, arg_pass_t pass) { int count = 0; (void) precedence; /* suppress compiler warning */ (void) pass; /* suppress compiler warning */ switch (option) { case '?': fprintf(stderr, "Unknown option '%s'.\n", name); break; case 'd': flag = M_DUMP; count += 1; ds_file = val; break; case O_CONFIG_FILE: read_config_file(val, false, false, PR_COMMAND, longopts_bogoutil); /*@fallthrough@*/ /* fall through to suppress reading config files */ case 'C': suppress_config_file = true; break; case 'k': db_cachesize=(uint) atoi(val); break; case 'l': flag = M_LOAD; count += 1; ds_file = val; break; case 'm': flag = M_MAINTAIN; count += 1; ds_file = val; break; case 'p': prob = true; /*@fallthrough@*/ case 'w': flag = M_WORD; count += 1; ds_file = val; break; case O_DB_PRINT_LEAFPAGE_COUNT: flag = M_LEAFPAGES; count += 1; ds_file = val; break; case O_DB_PRINT_PAGESIZE: flag = M_PAGESIZE; count += 1; ds_file = val; break; case 'r': onlyprint = true; case 'R': flag = M_ROBX; count += 1; ds_file = val; break; case 'u': upgrade_wordlist_version = true; flag = M_MAINTAIN; count += 1; ds_file = val; break; case 'v': verbose++; break; case ':': fprintf(stderr, "Option %s requires an argument.\n", name); exit(EX_ERROR); case 'h': help(stdout); exit(EX_OK); case 'H': flag = M_HIST; count += 1; ds_file = val; break; case 'V': print_version(); exit(EX_OK); case 'x': set_debug_mask(val); break; case 'X': set_bogotest(val); break; case 'a': maintain = true; thresh_date = string_to_date(val); break; case 'c': maintain = true; thresh_count = (uint) atoi(val); break; case 's': { unsigned long mi, ma; maintain = true; if (2 == sscanf(val, "%lu,%lu", &mi, &ma)) { size_min = mi; size_max = ma; } else { fprintf(stderr, "syntax error in argument \"%s\" of -s\n.", val); exit(EX_ERROR); } } break; case 'n': maintain = true; replace_nonascii_characters ^= true; break; case 'y': /* date as YYYYMMDD */ { YYYYMMDD date = string_to_date(val); maintain = true; if (date != 0 && date < 19990000) { fprintf(stderr, "Date format for '-y' option is YYYYMMDD\n"); exit(EX_ERROR); } set_date( date ); break; } case 'I': fpin = fopen(val, "r"); if (fpin == NULL) { fprintf(stderr, "Can't read file '%s'\n", val); exit(EX_ERROR); } break; case 'O': fpo = fopen(val, "wt"); if (fpo == NULL) { fprintf(stderr, "Can't write file '%s'\n", val); exit(EX_ERROR); } break; case 'D': dbgout = stdout; break; case O_DB_VERIFY: flag = M_VERIFY; count += 1; ds_file = val; break; case O_UNICODE: encoding = str_to_bool(val) ? E_UNICODE : E_RAW; break; case O_MAX_TOKEN_LEN: max_token_len = atoi(val); break; case O_MIN_TOKEN_LEN: min_token_len = atoi(val); break; case O_MAX_MULTI_TOKEN_LEN: max_multi_token_len=atoi(val); break; case O_MULTI_TOKEN_COUNT: multi_token_count=atoi(val); break; default: if (!dsm_options_bogoutil(option, &flag, &count, &ds_file, name, val)) { fprintf(stderr, "Invalid option '%s'\n", name); exit(EX_ERROR); } } return count; } static bfpath_mode get_mode(cmd_t cmd) { bfpath_mode mode = BFP_ERROR; switch (cmd) { case M_LOAD: mode = BFP_MAY_CREATE; break; case M_DUMP: case M_HIST: case M_MAINTAIN: case M_ROBX: case M_VERIFY: case M_WORD: case M_CHECKPOINT: /* database transaction/integrity operations */ case M_CRECOVER: case M_LEAFPAGES: case M_PAGESIZE: case M_PURGELOGS: case M_RECOVER: case M_REMOVEENV: case M_LIST_LOGFILES: mode = BFP_MUST_EXIST; break; case M_NONE: usage(stderr); exit(EX_ERROR); } return mode; } int main(int argc, char *argv[]) { ex_t rc = EX_OK; bfpath *bfp; bfpath_mode mode; fBogoutil = true; signal_setup(); /* setup to catch signals */ atexit(bf_exit); progtype = build_progtype(progname, DB_TYPE); set_today(); /* compute current date for token age */ process_arglist(argc, argv); process_config_files(false, longopts_bogoutil); /* need to read lock sizes */ /* Extra or missing parameters */ if (flag != M_WORD && flag != M_LIST_LOGFILES && argc != optind) { fprintf(stderr, "Missing or extraneous argument.\n"); usage(stderr); exit(EX_ERROR); } bfp = bfpath_create(ds_file); if (bogohome == NULL) set_bogohome( "." ); /* set default */ bfpath_set_bogohome(bfp); mode = get_mode(flag); if (bfpath_check_mode(bfp, mode)) { if (bfp->isdir) bfpath_set_filename(bfp, WORDLIST); } if (!bfpath_check_mode(bfp, mode)) { fprintf(stderr, "Can't open wordlist '%s'\n", bfp->filepath); exit(EX_ERROR); } errno = 0; /* clear error status */ switch (flag) { case M_RECOVER: ds_init(bfp); rc = ds_recover(bfp, false); break; case M_CRECOVER: ds_init(bfp); rc = ds_recover(bfp, true); break; case M_CHECKPOINT: ds_init(bfp); rc = ds_checkpoint(bfp); break; case M_LIST_LOGFILES: dsm_init(bfp); rc = ds_list_logfiles(bfp, argc - optind, argv + optind); break; case M_PURGELOGS: ds_init(bfp); rc = ds_purgelogs(bfp); break; case M_REMOVEENV: dsm_init(bfp); rc = ds_remove(bfp); break; case M_VERIFY: dsm_init(bfp); rc = ds_verify(bfp); break; case M_LEAFPAGES: { u_int32_t c; dsm_init(bfp); c = ds_leafpages(bfp); if (c == 0xffffffff) { fprintf(stderr, "%s: error getting leaf page count.\n", ds_file); rc = EX_ERROR; } else if (c == 0) { puts("UNKNOWN"); } else { printf("%lu\n", (unsigned long)c); } } break; case M_PAGESIZE: { u_int32_t s; dsm_init(bfp); s = ds_pagesize(bfp); if (s == 0xffffffff) { fprintf(stderr, "%s: error getting page size.\n", ds_file); } else if (s == 0) { puts("UNKNOWN"); } else { printf("%lu\n", (unsigned long)s); } } break; case M_DUMP: rc = dump_wordlist(bfp); break; case M_LOAD: rc = load_wordlist(bfp); break; case M_MAINTAIN: maintain = true; rc = maintain_wordlist_file(bfp); break; case M_WORD: argc -= optind; argv += optind; rc = display_words(bfp, argc, argv, prob); break; case M_HIST: rc = histogram(bfp); break; case M_ROBX: rc = get_robx(bfp); break; case M_NONE: default: /* should have been handled above */ abort(); break; } bfpath_free(bfp); return rc; } bogofilter-1.2.4/src/xmalloc.h0000644000175000017500000000256712163572272014456 0ustar sezsez/* $Id: xmalloc.h 5649 2005-03-16 00:52:05Z relson $ */ #ifndef XMALLOC_H #define XMALLOC_H #include #include /* special defines for xmalloc.c, xcalloc.c, etc */ #ifndef ENABLE_MEMDEBUG #define bf_malloc malloc #define bf_calloc calloc #define bf_realloc realloc #define bf_free free #else #include "memdebug.h" #endif /*@noreturn@*/ /** print out of memory error and exit program */ void xmem_error(const char *) #ifdef __GNUC__ __attribute__((noreturn)) #endif ; /*@noreturn@*/ /** print string too long error and exit program */ void xmem_toolong(const char *) #ifdef __GNUC__ __attribute__((noreturn)) #endif ; /*@only@*/ /*@out@*/ /*@notnull@*/ /** allocate \a size bytes of memory, exit program on allocation failure */ void *xmalloc(size_t size); /** free memory area at \a ptr if ptr is non-NULL, do nothing if \a ptr * is NULL */ void xfree(/*@only@*/ /*@null@*/ void *ptr); /** allocate and clear \a nmemb blocks of \a size bytes of memory, exit * program on allocation failure */ /*@only@*/ /*@out@*/ /*@notnull@*/ void *xcalloc(size_t nmemb, size_t size); /** reallocate \a size bytes of memory and initialize it with the * first bytes of the shorter area (old in \a ptr vs.\ newly allocated), * exit program on allocation failure */ /*@only@*/ /*@out@*/ /*@notnull@*/ void *xrealloc(/*@only@*/ void *ptr, size_t size); #endif bogofilter-1.2.4/src/wordlists.c0000644000175000017500000002102312163572304015024 0ustar sezsez/* $Id: wordlists.c 6917 2010-07-05 15:59:15Z m-a $ */ #include "common.h" #include #include #include #include #include #include "bogofilter.h" #include "datastore.h" #include "msgcounts.h" #include "mxcat.h" #include "paths.h" #include "rand_sleep.h" #include "wordlists.h" #include "xmalloc.h" #include "xstrdup.h" #include "bsdqueue.h" #define MIN_SLEEP 0.5e+3 /* 0.5 milliseconds */ #define MAX_SLEEP 2.0e+6 /* 2.0 seconds */ /* Function Definitions */ #define MAX_ENVS 10 /* Idea: - build dirname * - search list of known environments if we have that dirname, * if so, return it * - create and insert new environment * * for destruction: - when closed an environment, NULL it in word_lists * past the current one that match our address */ static LIST_HEAD(envlist, envnode) envs; struct envlist envlisthead; struct envnode { LIST_ENTRY(envnode) entries; void *dbe; char directory[1]; }; static void *list_searchinsert(bfpath *bfp) { uint l; struct envnode *i, *n; for (i = envlisthead.lh_first ; i ; i = i->entries.le_next) { if (strcmp(bfp->dirname, &i->directory[0]) == 0) return i->dbe; } l = strlen(bfp->dirname) + 1; n = xmalloc(sizeof(struct envnode) + l); n->dbe = ds_init(bfp); memcpy(&n->directory[0], bfp->dirname, l); LIST_INSERT_HEAD(&envlisthead, n, entries); return n->dbe; } void begin_wordlist(wordlist_t *list) { dsv_t val; while (1) { if (ds_txn_begin(list->dsh)) { rand_sleep(1000,1000000); continue; } switch (ds_get_msgcounts(list->dsh, &val)) { case 0: case 1: list->msgcount[IX_GOOD] = val.goodcount; list->msgcount[IX_SPAM] = val.spamcount; if (wordlist_version == 0 && ds_get_wordlist_version(list->dsh, &val) == 0) wordlist_version = val.count[0]; break; case DS_ABORT_RETRY: continue; } switch (ds_get_wordlist_encoding(list->dsh, &val)) { case 0: /* found */ list->encoding = val.spamcount; break; case 1: /* not found */ break; case DS_ABORT_RETRY: continue; } break; } } static bool open_wordlist(wordlist_t *list, dbmode_t mode) { bool retry = false; void *dbe; bfpath *bfp = list->bfp; if (list->dsh != NULL) /* Only need to open the list once. */ return retry; if (list->type == WL_IGNORE) /* open ignore list in read-only mode */ mode = DS_READ; /* FIXME: create or reuse environment from filepath */ dbe = list_searchinsert(bfp); if (dbe == NULL) exit(EX_ERROR); list->dsh = ds_open(dbe, bfp, mode); /* FIXME -- euh, what is here to fix? */ if (list->dsh == NULL) { int err = errno; close_wordlists(false); /* unlock and close */ switch (err) { /* F_SETLK can't obtain lock */ case EAGAIN: #ifdef __EMX__ case EACCES: #endif rand_sleep(MIN_SLEEP, MAX_SLEEP); retry = true; break; default: if (query) /* If "-Q", failure is OK */ return false; fprintf(stderr, "Can't open file '%s' in directory '%s'.\n", bfp->filename, bfp->dirname); if (err != 0) fprintf(stderr, "error #%d - %s.\n", err, strerror(err)); /* print error and exit */ wordlist_error(err); } /* switch */ } else { /* ds_open */ begin_wordlist(list); } if (list->encoding != E_UNKNOWN) { if (encoding == E_UNKNOWN) encoding = list->encoding; if (encoding != list->encoding) { fprintf(stderr, "Can't mix database encodings, i.e. utf-8 and any other.\n"); exit(EX_ERROR); } } return retry; } /* Note: seems like some cleanup around here should be possible.... ** It seems wrong to call set_bogohome() from outside of paths.c. ** (DR 04/03/05) */ static void check_wordlist_path(wordlist_t *list) { bfpath *bfp = list->bfp; bfpath_mode mode; if (((run_type & UNREG_SPAM) != 0) || ((run_type & UNREG_GOOD) != 0)) mode = BFP_MUST_EXIST; else mode = BFP_MAY_CREATE; bfpath_check_mode(bfp, mode); bfpath_set_bogohome(bfp); } /* set bogohome using first wordlist's directory */ void set_wordlist_directory(void) { wordlist_t *list; /* return if bogohome already set */ if (bogohome != NULL) return; list = word_lists; /* get first wordlist */ if (list != NULL) { bfpath *bfp = list->bfp; char *dir = get_directory_from_path(bfp->filepath); if (dir != NULL) { check_wordlist_path(list); set_bogohome(dir); free(dir); } } } void open_wordlists(dbmode_t mode) { wordlist_t *list; bool retry = true; /* set default wordlist if none specified */ if (word_lists == NULL) init_wordlist("word", WORDLIST, 0, WL_REGULAR); /* set bogohome using first wordlist's directory */ set_wordlist_directory(); chk_bogohome(); /* add bogohome value to path structs */ for (list = word_lists; list != NULL; list = list->next) bfpath_set_bogohome(list->bfp); LIST_INIT(&envs); while (retry) { retry = false; for (list = word_lists; list != NULL ; list = list->next) { check_wordlist_path(list); retry |= open_wordlist(list, list->type == WL_IGNORE ? DS_READ : mode); if (list == word_lists && encoding == E_UNKNOWN) encoding = list->encoding; if (list->encoding != E_UNKNOWN && list->encoding != encoding) { fprintf(stderr, "Can't mix database encodings, i.e. utf-8 and any other.\n"); exit(EX_ERROR); } } } } /** close all open word lists */ bool close_wordlists(bool commit /** if unset, abort */) /* FIXME: we really need to look at the list's environments */ { bool err = false; wordlist_t *list; struct envnode *i; for (list = word_lists; list != NULL ; list = list->next) { void *vhandle = list->dsh; list->dsh = NULL; if (vhandle) { if (commit) { if (ds_txn_commit(vhandle)) err = true; } else { (void)ds_txn_abort(vhandle); } ds_close(vhandle); } } while ((i = envlisthead.lh_first)) { ds_cleanup(i->dbe); LIST_REMOVE(i, entries); xfree(i); } if (commit) word_lists = NULL; return err; } #ifdef COMPILE_DEAD_CODE /* some sanity checking of lists is needed because we may allow users to specify lists eventually and there are opportunities to generate divide-by-zero exceptions or follow bogus pointers. */ static void sanitycheck_lists(void) { wordlist_t* list=word_lists; int listcount=0; while (1) { if (list == NULL) break; if (list->name == NULL) { fprintf(stderr, "A list has no name.\n"); exit(EX_ERROR); } if (list->msgcount==0) { fprintf(stderr, "list %s has zero message count.\n", list->name); exit(EX_ERROR); } listcount++; list=list->next; } if (0==listcount) { fprintf(stderr, "No wordlists available!\n"); exit(EX_ERROR); } if (DEBUG_WORDLIST(1)) fprintf(dbgout, "%d lists look OK.\n", listcount); } #endif /** skips to the end of a work (comma, blank, tab separated), replaces * the delimiter by 0, skips over whitespace, and returns a pointer to * the next character. */ static char *spanword(char *p) { const char *delim = ", \t"; p += strcspn(p, delim); /* skip to end of word */ *p++ = '\0'; p += strspn(p, " \t"); /* skip trailing whitespace */ return p; } /* type - 'n', or 'i' (normal or ignore) * name - 'user', 'system', 'ignore', etc * path - 'wordlist.db', 'ignorelist.db', etc * override - 1,2,... */ /* returns true for success, false for error */ bool configure_wordlist(const char *val) { char ch; WL_TYPE type; char* listname; char* filename; int precedence; char *tmp = xstrdup(val); ch= tmp[0]; /* save wordlist type (good/spam) */ tmp = spanword(tmp); switch (toupper((unsigned char)ch)) { case 'R': type = WL_REGULAR; break; case 'I': type = WL_IGNORE; break; default: fprintf( stderr, "Unknown wordlist type - '%c'\n", ch); return (false); } listname=tmp; /* name of wordlist */ tmp = spanword(tmp); filename=tmp; /* path to wordlist */ tmp = spanword(tmp); precedence=atoi(tmp); (void)spanword(tmp); init_wordlist(listname, filename, precedence, type); return true; } /* print error and exit */ void wordlist_error(int err) { if (err == ENOENT) fprintf(stderr, "\n" "Remember to register some spam and ham messages before you\n" "use bogofilter to evaluate mail for its probable spam status!\n"); if (err == EINVAL) fprintf(stderr, "\n" "Make sure that the database version this program is linked against\n" "can handle the format of the data base file (after updates in particular).\n"); exit(EX_ERROR); } bogofilter-1.2.4/src/rand_sleep.h0000644000175000017500000000014512163572304015115 0ustar sezsez#ifndef RAND_SLEEP_H #define RAND_SLEEP_H 1 extern void rand_sleep(double min, double max); #endif bogofilter-1.2.4/src/bf_compact0000644000175000017500000000415712163573322014660 0ustar sezsez#! /bin/sh # bf_compact source_dir [wordlist_name...] # # use to compact wordlist.db # replaces original directory with new one # renames original directory with '.old' extension # $Id: bf_compact.in 6749 2008-10-15 23:08:06Z clint $ set -e # die on errors : ${BOGOFILTER:=bogofilter} : ${BOGOUTIL:=bogoutil} if [ -z "$1" ] ; then echo 'usage: bf_compact source_dir [wordlist_name...]' exit 1 fi # extract home directory BOGOHOME="$1" shift if [ ! -d "$BOGOHOME" ] ; then echo "$BOGOHOME must be a directory, not a file" exit 1 fi # strip trailing slashes while true; do case "$BOGOHOME" in */) BOGOHOME=${BOGOHOME%/} ;; *) break ;; esac done export BOGOHOME # find wordlists if [ -n "$1" ] ; then FILES="$@" else DIR=$($BOGOFILTER -QQ | grep ^bogofilter_dir | gawk '{print $3}') if [ "$BOGOHOME" != "$DIR" ] ; then FILES=$(ls "$BOGOHOME"/*.db) else FILES=$($BOGOFILTER -QQ | grep ^wordlist | cut -f3 -d,) fi fi BOGOTEMP="bf_compact.$$" mkdir "$BOGOTEMP" || { echo "Cannot create directory $BOGOTEMP. Abort." exit 1 } # copy Berkeley DB configuration if present if test -f "$BOGOHOME"/DB_CONFIG ; then cp -p "$BOGOHOME"/DB_CONFIG "$BOGOTEMP"/ fi case "$($BOGOFILTER -V | grep Database:)" in *"Berkeley DB"*) # determine transactions if test "$(find "$BOGOHOME/" -name "log.??????????" -print)" = "" ; then TXN=no else TXN=yes fi ;; *) TXN=noarg ;; esac # reload files for FILE in $FILES ; do NAME="$(basename $FILE)" $BOGOUTIL --db-verify "$FILE" \ || { echo "$FILE corrupted, aborting." ; rm -r "$BOGOTEMP" ; exit 1 ; } $BOGOUTIL -d "$FILE" | case $TXN in no|yes) $BOGOUTIL --db-transaction=no -l "$BOGOTEMP/$NAME" ;; noarg) $BOGOUTIL -l "$BOGOTEMP/$NAME" ;; esac done if [ $TXN = "yes" ] ; then #create database environment files $BOGOFILTER -e -C -d "$BOGOTEMP" --db-transaction=yes < /dev/null fi # remove $BOGOHOME.old so we don't move the new backup *into* it # rather than renaming the backup to it. rm -rf "$BOGOHOME.old" mv "$BOGOHOME" "$BOGOHOME.old" mv "$BOGOTEMP" "$BOGOHOME" bogofilter-1.2.4/src/rstats.h0000644000175000017500000000132312163572272014324 0ustar sezsez/* $Id: rstats.h 6777 2009-02-01 03:49:48Z relson $ */ /***************************************************************************** NAME: rstats.h -- support for debug routines for printing robinson data. AUTHOR: David Relson ******************************************************************************/ #ifndef RSTATS_H #define RSTATS_H void rstats_init(void); void rstats_cleanup(void); void rstats_add(const word_t *token, double prob, bool used, wordcnts_t *cnts); void rstats_fini(size_t robn, FLOAT P, FLOAT Q, double spamicity); void rstats_print(bool unsure); void rstats_cnt_rn_ns_sp(uint *cnt, uint *rn, uint *ns, uint *sp); #endif /* RSTATS_H */ bogofilter-1.2.4/src/bogoupgrade.in0000755000175000017500000001327212163572272015472 0ustar sezsez#! @PERL@ -w =pod =head1 NAME bogoupgrade -- upgrade a bogofilter database to current version. =cut # bogofilter-0.3 through bogofilter-0.6.3 # # HEADER "# bogofilter email-count (format version A): %lu" # # bogofilter-0.7.x # # HEADER "# bogofilter email-count (format version B): %lu" # # bogofilter-0.8 to bogofilter-0.13.x # # BerkeleyDB with double wordlists # spamlist.db and goodlist.db # bogofilter-0.14 and later # # BerkeleyDB with single wordlist # wordlist.db require 5.005_03; use strict; use filetest 'access'; use Pod::Usage; sub convert_double_to_single(); sub convert_format_A(); sub convert_format_B(); sub db_verify($); my $VERSION = '0.5.0'; my ($in, $out, $dir, $yday, $msg_count_token); my $bogoutil = 'bogoutil'; for (my $i = 0; $i < @ARGV; $i++){ my $arg = $ARGV[$i]; if ($arg eq '-d'){ $dir = $ARGV[++$i]; } elsif ($arg eq '-i'){ $in = $ARGV[++$i]; } elsif ($arg eq '-o'){ $out = $ARGV[++$i]; } elsif ($arg eq '-b'){ $bogoutil = $ARGV[++$i]; } elsif ($arg eq '-y'){ $yday = "-y $ARGV[++$i]"; } elsif ($arg eq '-h' or $arg eq '--help'){ pod2usage(-verbose => 1, -exitstatus => 0); } else { pod2usage(-verbose => 0, -exitstatus => 1); } } my $db_ext = $ENV{DB_EXT} || 'db'; if ($dir) { if ($in || $out) { pod2usage("Cannot use -d at the same time as -i or -o!"); } convert_double_to_single(); } else { pod2usage("Missing input filename.\nAborting") unless $in; pod2usage("Missing output filename.\nAborting") unless $out; my $msg_count_token = '.MSG_COUNT'; open(F, "< $in") or die "Cannot open input file [$in]. $!.\nAborting"; my $sig = ; chomp($sig); if ($sig =~ m/^\# bogofilter wordlist \(format version A\):\s(\d+)$/){ convert_format_A(); } elsif ($sig =~ m/^\# bogofilter email-count \(format version B\):\s(\d+)/){ convert_format_B(); } else { $sig =~ y/[\040-\177]/_/cs; warn "Cannot recognize signature [$sig].\n"; exit(2); } } sub db_verify($) { my ($f) = shift; if (!-r $f) { die "Database $f is not readable: $!\nAborting"; } my $ret = system ($bogoutil, '--db-verify', $f); die "Database $f is corrupt.\nAborting" if $ret; } sub convert_format_A() { my $msg_count = $1; my $cmd = "$bogoutil $yday -l $out"; open(OUT, "| $cmd") or die "Cannot run command \"$cmd\": $!\nAborting"; while(){ print OUT $_; } print OUT "$msg_count_token $msg_count\n"; close(OUT) or die "Error executing command \"$cmd\": $!\nAborting"; close(F); } sub convert_format_B() { my $msg_count = $1; my $in_db = $in; $in_db =~ s/count$/$db_ext/; unless (-f $in_db){ warn("Cannot find database file [$in_db]\n corresponding to input file [$in]\n"); exit; } my $cmd = "$bogoutil $yday -l $out"; open(OUT, "| $cmd") or die "Cannot run command \"$cmd\": $!\nAborting"; close(F); db_verify($in_db); $cmd = "$bogoutil $yday -d $in_db"; open(F, "$cmd |") or die "Cannot run command \"$cmd\": $!\nAborting"; while(){ if (m/^\.count\s+(\d+)$/){ warn("Found a message count of [$1] in db.\nThrowing away text file count of [$msg_count]\n"); $msg_count = $1; next; } elsif (/^$msg_count_token\s(\d+)$/){ warn("This database appears to have been upgraded already.\nBut there's no harm in doing it again.\n"); $msg_count = $1; next; } print OUT $_; } print OUT "$msg_count_token $msg_count\n"; close(F); close(OUT); } # args: filename format sub cvt2to1_get($$) { my ($filename, $format) = @_; my @tmp; my $cmd; die "need array context in cvs2to1_get.\nAborting" unless wantarray; db_verify($filename); $cmd = "$bogoutil -d $filename"; open(I, "$cmd |") or die "cannot run \"$cmd\": $!\nAborting"; while () { chomp; my @a = split; push @tmp, sprintf($format, $a[0], $a[1], $a[2]); } close I or die "error running \"$cmd\": $!\nAborting"; return @tmp; } sub convert_double_to_single() { my @tmp; my $word = "$dir/wordlist.$db_ext"; my $spam = "$dir/spamlist.$db_ext"; my $good = "$dir/goodlist.$db_ext"; if (-e $word) { die "$word already exists.\nAborting"; } push @tmp, cvt2to1_get($spam, "%s %d 0 %d"); push @tmp, cvt2to1_get($good, "%s 0 %d %d"); my $cmd = "$bogoutil -l $word"; open(O, "| $cmd") or die "cannot run \"$cmd\": $!\nAborting"; print O join("\n", sort @tmp), "\n"; close O or die "error executing \"$cmd\": $!\nAborting"; } exit(0); __END__ =pod =head1 SYNOPSIS bogoupgrade [options] -d bogoupgrade [options] -i -o bogoupgrade {-h|--help} Options: -b =head1 DESCRIPTION B updates bogofilter databases from older formats to the current format. =head1 OPTIONS =over 8 =item B<-d > Name of directory containing database files. Old files will be read and new files will be written. =item B<-i > Text file containing message count, and possibly wordlist data records. If the file only contains a message count but no word list records, there must be a database file, in the same directory as the text file, which contains the word list data. =item B<-o > Output database file. Use the appropriate file extension for your version of bogofilter, i.e. '.db' for Berkeley DB and SQLite3, or '.qdbm' for QDBM. =item B<-b > Defaults to 'bogoutil', in the hopes that your shell will find it. =item B<-h> | B<--help> Print the help - you are currently reading it. =back =head1 AUTHORS Gyepi Sam David Relson Matthias Andree =cut # vim: set filetype=perl ai: bogofilter-1.2.4/src/bogohist.h0000644000175000017500000000071712163572304014624 0ustar sezsez/* $Id: bogohist.h 5760 2005-04-04 11:16:24Z relson $ */ /***************************************************************************** NAME: histogram.h -- constants and declarations for histogram.c AUTHOR: David Relson ******************************************************************************/ #ifndef HISTOGRAM_H #define HISTOGRAM_H #include "paths.h" extern ex_t histogram(bfpath *bfp); #endif /* HISTOGRAM_H */ bogofilter-1.2.4/src/xstrdup.h0000644000175000017500000000037412163572272014522 0ustar sezsez/* (C) 2002 by Matthias Andree, redistributable according to the terms * of the GNU General Public License, v2. * * $Id: xstrdup.h 4184 2004-02-25 04:51:58Z relson $ * */ #ifndef XSTRDUP_H #define XSTRDUP_H char *xstrdup(const char *s); #endif bogofilter-1.2.4/src/bool.c0000644000175000017500000000151412163572304013730 0ustar sezsez/* $Id: bool.c 4207 2004-03-03 16:29:12Z relson $ */ /***************************************************************************** NAME: bool.c -- functions to support the "bool" type. AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include "bool.h" bool str_to_bool(const char *str) { char ch; while (isspace((unsigned char)*str)) str += 1; ch = toupper((unsigned char)*str); switch (ch) { case 'Y': /* Yes */ case 'T': /* True */ case '1': return (true); case 'N': /* No */ case 'F': /* False */ case '0': return (false); default: fprintf(stderr, "Invalid boolean value - %s\n", str); exit(EX_ERROR); } return (0); } bogofilter-1.2.4/src/rstats.c0000644000175000017500000001514612163572272014327 0ustar sezsez/* $Id: rstats.c 6816 2009-02-21 21:11:01Z relson $ */ /***************************************************************************** NAME: rstats.c -- routines for printing robinson data for debugging. AUTHOR: David Relson ******************************************************************************/ #include "common.h" #include #include #include #include #include "bogofilter.h" #include "listsort.h" #include "msgcounts.h" #include "prob.h" #include "rstats.h" #include "score.h" #include "xmalloc.h" typedef struct rstats_s rstats_t; struct rstats_s { rstats_t *next; const word_t *token; u_int32_t good; u_int32_t bad; u_int32_t msgs_good; u_int32_t msgs_bad; bool used; double prob; }; typedef struct rhistogram_s rhistogram_t; struct rhistogram_s { size_t count; double prob; double spamicity; }; typedef struct header_s header_t; struct header_s { rstats_t *list; uint count; /* words in list */ uint robn; /* words in score */ FLOAT p; /* Robinson's P */ FLOAT q; /* Robinson's Q */ double min_dev; double spamicity; }; static header_t *stats_head = NULL; static rstats_t *stats_tail = NULL; /* Function Prototypes */ static void rstats_print_histogram(size_t robn, rstats_t *rstats_head); static void rstats_print_rtable(rstats_t *rstats_head); /* Function Definitions */ void rstats_init(void) { if (stats_head == NULL) { stats_head = xcalloc(1, sizeof(header_t)); stats_tail = (rstats_t *)xcalloc(1, sizeof(rstats_t)); stats_head->list = stats_tail; } } void rstats_cleanup(void) { rstats_t *p, *q; for (p = stats_head->list; p != NULL; p = q) { q = p->next; xfree(p); } xfree(stats_head); stats_head = NULL; stats_tail = NULL; } void rstats_add(const word_t *token, double prob, bool used, wordcnts_t *cnts) { if (token == NULL) return; stats_head->count += 1; stats_tail->next = NULL; /* Using externally controlled data; token must not be freed before calling rstats_cleanup() */ stats_tail->token = token; stats_tail->prob = prob; stats_tail->used = used; stats_tail->good = cnts->good; stats_tail->bad = cnts->bad; stats_tail->msgs_good = cnts->msgs_good; stats_tail->msgs_bad = cnts->msgs_bad; stats_tail->next = (rstats_t *)xcalloc(1, sizeof(rstats_t)); stats_tail = stats_tail->next; } /* compare_rstats_t - sort by ascending spamicity */ static int compare_rstats_t(const void *const pv1, const void *const pv2) { const rstats_t *r1 = (const rstats_t *)pv1; const rstats_t *r2 = (const rstats_t *)pv2; if (r1->prob > r2->prob) return 1; if (r2->prob > r1->prob) return -1; return word_cmp(r1->token, r2->token); } #define INTERVALS 10 void rstats_fini(size_t robn, FLOAT P, FLOAT Q, double spamicity) { stats_head->robn = robn; stats_head->p = P; stats_head->q = Q; stats_head->spamicity = spamicity; } void rstats_print(bool unsure) { size_t robn = stats_head->robn; /* sort by ascending spamicity */ stats_head->list = (rstats_t *)listsort((element *)stats_head->list, (fcn_compare *)&compare_rstats_t); if (Rtable || verbose>=3) rstats_print_rtable(stats_head->list); else if (verbose==2 || (unsure && verbose)) rstats_print_histogram(robn, stats_head->list); } static void rstats_print_histogram(size_t robn, rstats_t *rstats_head) { size_t i; size_t maxcnt=0; rstats_t *cur=rstats_head; rhistogram_t hist[INTERVALS]; double invn = (double) robn; double invlogsum = 0.0; /* Robinson's P */ double logsum = 0.0; /* Robinson's Q */ if (!stats_in_header) (void)fprintf(fpo, "\n" ); /* Compute histogram */ for (i=0; iprob = 0.0; h->spamicity=0.0; while (cur != NULL) { double prob = cur->prob; if (prob >= fin) break; if (cur->used) { cnt += 1; h->prob += prob; invlogsum += log(1.0 - prob); logsum += log(prob); } cur = cur->next; } if (robn == 0) h->spamicity = robx; else { double invproduct, product; invproduct = 1.0 - exp(invlogsum / invn); product = 1.0 - exp(logsum / invn); h->spamicity = (invproduct + product < EPS) ? 0.0 : (1.0 + (invproduct - product) / (invproduct + product)) / 2.0; } h->count=cnt; maxcnt = max(maxcnt, cnt); } (void)fprintf(fpo, "%s%4s %4s %6s %9s %s\n", stats_prefix, "int", "cnt", "prob", "spamicity", "histogram" ); /* Print histogram */ for (i=0; icount; double prob = cnt ? h->prob/cnt : 0.0; /* print interval, count, probability, and spamicity */ (void)fprintf(fpo, "%s%3.2f %4lu %f %f ", stats_prefix, beg, (unsigned long)cnt, prob, h->spamicity ); /* scale histogram to 48 characters */ if (maxcnt>48) cnt = (cnt * 48 + maxcnt - 1) / maxcnt; /* display histogram */ while (cnt-- > 0) (void)fputc( '#', fpo); (void)fputc( '\n', fpo); } } static void rstats_print_rtable(rstats_t *rstats_head) { const char *pfx = !stats_in_header ? "" : " "; rstats_t *cur; /* print header */ if (!Rtable) (void)fprintf(fpo, "%s%*s %6s %-6s %-6s %-6s %s\n", pfx, max_token_len+2, "", "n", "pgood", "pbad", "fw", "U"); else (void)fprintf(fpo, "%s%*s %6s %-6s %-6s %-6s %-6s %-6s %s\n", pfx, max_token_len+2, "", "n", "pgood", "pbad", "fw", "invfwlog", "fwlog", "U"); /* Print 1 line per token */ for (cur=rstats_head->next; cur != NULL; cur=cur->next) { int len = (cur->token->leng >= max_token_len) ? 0 : (max_token_len - cur->token->leng); double fw = calc_prob(cur->good, cur->bad, cur->msgs_good, cur->msgs_bad); char flag = cur->used ? '+' : '-'; (void)fprintf(fpo, "%s\"", pfx); (void)word_puts(cur->token, 0, fpo); if (cur->msgs_good == 0 && cur->msgs_bad == 0) { flag = 'i'; (void)fprintf(fpo, "\"%*s %6lu %8s %8s %8.6f", len, " ", (unsigned long)(cur->good + cur->bad), "--------", "--------", fw); } else (void)fprintf(fpo, "\"%*s %6lu %8.6f %8.6f %8.6f", len, " ", (unsigned long)(cur->good + cur->bad), (double)cur->good / cur->msgs_good, (double)cur->bad / cur->msgs_bad, fw); if (Rtable) (void)fprintf(fpo, "%s%10.5f%10.5f", pfx, log(1.0 - fw), log(fw)); (void)fprintf(fpo, " %c\n", flag); } /* print trailer */ msg_print_summary(pfx); } bogofilter-1.2.4/src/memdebug.c0000644000175000017500000001425712163572304014572 0ustar sezsez/* $Id: memdebug.c 5708 2005-03-24 04:04:01Z relson $ */ /* * NAME: * memdebug.c -- memory usage debugging layer for malloc(), free(), etc. * * AUTHOR: * David Relson * * NOTE: * These routines are useful, though not especially polished. * * Capabilities: * * - Count calls to malloc(), free(), realloc(), calloc(). * - For each such call, track current, maximum, and total bytes allocated. * - Display summary statistics. * - Display size and address of each block as allocated or freed to locate the unfreed blocks. * - Trap routine than can be called by allocation index or allocation size. * - Program exit when current allocation is "too much". */ #define NO_MEMDEBUG_MACROS #include "common.h" #include #include "memdebug.h" #include "xmalloc.h" int memtrace= 1 * (M_MALLOC+M_FREE); uint32_t dbg_trap_index= 36; uint32_t dbg_size_min = 0; uint32_t dbg_size_max = 0; uint32_t dbg_index_min = 0; /* 1 */ uint32_t dbg_index_max = 0; /* 1000 */ uint32_t dbg_size_trap = 0; /* 100000 */ #define MB 1000000 #define GB 1000*MB uint32_t dbg_too_much = 0; /* GB */ uint32_t dbg_size_delt = 0; /* MB */ uint32_t dbg_delt_save = 0; const uint32_t md_tag = (uint32_t) 0xABCD55AA; uint32_t cnt_alloc = 0; uint32_t cnt_free = 0; uint32_t cnt_malloc = 0; uint32_t cnt_realloc= 0; uint32_t cnt_calloc = 0; uint32_t cur_malloc = 0; uint32_t max_malloc = 0; uint32_t tot_malloc = 0; void md_trap(const char *why); void md_too_much(void); void md_trap(const char *why) { (void)why; } void md_too_much() { static bool first = true; if (first) { first = false; fprintf(stderr, "max_malloc = %12lu, tot_malloc = %12lu\n", (ulong) max_malloc, (ulong) tot_malloc); md_trap("dbg_too_much"); } } typedef struct memheader { uint32_t size; uint32_t indx; uint32_t tag; } mh_t; typedef struct memtrailer { uint32_t tag; } mt_t; void mh_disp(const char *s, mh_t *p); void mh_disp(const char *s, mh_t *p) { if (!DEBUG_MEMORY(1)) return; if (dbg_index_min != 0 && p->indx < dbg_index_min) return; if (dbg_index_max != 0 && p->indx > dbg_index_max) return; if (dbg_size_min != 0 && p->size < dbg_size_min) return; if (dbg_size_max != 0 && p->size > dbg_size_max) return; fprintf(dbgout, "::%3d %08lX %s %lu\n", p->indx, (ulong) (p+1), s, (ulong) p->size); return; } void * md_malloc(size_t size) { void *ptr; mt_t *mt; mh_t *mh = NULL; ++cnt_malloc; cur_malloc += size; if (dbg_size_delt != 0 && max_malloc - dbg_delt_save > dbg_size_delt) { dbg_delt_save = max_malloc / dbg_size_delt * dbg_size_delt; fprintf(dbgout, ":: max_malloc = %12lu\n", (ulong) max_malloc); } max_malloc = max(max_malloc, cur_malloc); tot_malloc += size; size += sizeof(mh_t) + sizeof(md_tag); /* Include size storage */ if (dbg_size_trap != 0 && size > dbg_size_trap) md_trap("dbg_size_trap"); if (dbg_too_much != 0 && max_malloc > dbg_too_much) md_too_much(); ptr = malloc(size); mh = (mh_t *) ptr; mh->size = size - sizeof(mh_t) - sizeof(md_tag); mh->indx = ++cnt_alloc; mh->tag = md_tag; if (memtrace & M_MALLOC) mh_disp( "a", mh ); if (dbg_trap_index != 0 && mh->indx == dbg_trap_index) md_trap("dbg_index"); mt = (mt_t *)((char *)(mh+1)+mh->size); mt->tag = md_tag; ptr = (void *) (mh+1); return ptr; } void md_free(void *ptr) { mt_t *mt; mh_t *mh = (mh_t *) ptr; if (!ptr) return; mh -= 1; ptr = (void *) mh; ++cnt_free; if (memtrace & M_FREE) mh_disp( "f", mh ); if (mh->tag != md_tag) md_trap("md_tag"); if (dbg_trap_index != 0 && mh->indx == dbg_trap_index) md_trap("dbg_trap_index"); if (mh->size > cur_malloc || (dbg_size_trap != 0 && mh->size > dbg_size_trap)) md_trap("dbg_size_trap"); mt = (mt_t *)((char *)(mh+1)+mh->size); if (mt->tag != md_tag) md_trap("md_tag"); cur_malloc -= mh->size; mh->tag = -1; free(ptr); } void memdisplay(const char *file, int lineno) { const char *pfx = ""; if (!DEBUG_MEMORY(0)) return; if (file != NULL) { pfx = "\t"; fprintf(dbgout, "%s:%d:\n", file, lineno); } fprintf(dbgout, "%smalloc: cur = %lu, max = %lu, tot = %lu\n", pfx, (ulong) cur_malloc, (ulong) max_malloc, (ulong) tot_malloc ); fprintf(dbgout, "%scounts: malloc: %lu, calloc: %lu, realloc: %lu, free: %lu\n", pfx, (ulong) cnt_malloc, (ulong) cnt_calloc, (ulong) cnt_realloc, (ulong) cnt_free); if (cnt_alloc == cnt_free) fprintf(dbgout, "%s none active.\n", pfx); else fprintf(dbgout, "%s active: %lu, average: %lu\n", pfx, (ulong) cnt_alloc - cnt_free, (ulong) cur_malloc/(cnt_alloc - cnt_free)); fflush(dbgout); } void *md_calloc(size_t nmemb, size_t size) { void *ptr; mt_t *mt; mh_t *mh; size = size * nmemb; nmemb = 1; cur_malloc += size; max_malloc = max(max_malloc, cur_malloc); tot_malloc += size; size += sizeof(mh_t) + sizeof(md_tag); /* Include size storage */ ++cnt_calloc; if (dbg_too_much != 0 && max_malloc > dbg_too_much) md_too_much(); ptr = calloc(nmemb, size); mh = (mh_t *) ptr; mh->size = size - sizeof(mh_t) - sizeof(md_tag); mh->indx = ++cnt_alloc; mh->tag = md_tag; if (memtrace & M_MALLOC) mh_disp( "c", mh ); if (dbg_trap_index != 0 && mh->indx == dbg_trap_index) md_trap("dbg_trap_index"); mt = (mt_t *)((char *)(mh+1)+mh->size); mt->tag = md_tag; ptr = (void *) (mh+1); return ptr; } void *md_realloc(void *ptr, size_t size) { mh_t *mh = ((mh_t *) ptr)-1; mt_t *mt; size_t oldsize = mh->size; cur_malloc += size - oldsize; max_malloc = max(max_malloc, cur_malloc); tot_malloc += size - oldsize; ++cnt_realloc; if (dbg_too_much != 0 && max_malloc > dbg_too_much) md_too_much(); if (memtrace & M_FREE) mh_disp( "r", mh ); size = size + sizeof(mh_t) + sizeof(md_tag); mh = realloc(mh, size); mh->size = size - sizeof(mh_t) - sizeof(md_tag); mh->indx = ++cnt_realloc; mh->tag = md_tag; if (memtrace & M_MALLOC) mh_disp( "r", mh ); mt = (mt_t *)((char *)mh+mh->size); mt->tag = md_tag; ptr = (void *) (mh+1); return ptr; } bogofilter-1.2.4/src/xcalloc.c0000644000175000017500000000075212163572304014425 0ustar sezsez/* $Id: xcalloc.c 5649 2005-03-16 00:52:05Z relson $ */ /* * NAME: * xcalloc.c -- front-end to standard heap manipulation routines, with error checking. * * AUTHOR: * Gyepi Sam * */ #include "config.h" #include "xmalloc.h" void *xcalloc(size_t nmemb, size_t size){ void *ptr; ptr = bf_calloc(nmemb, size); if (ptr == NULL && (nmemb == 0 || size == 0)) ptr = bf_calloc(1, 1); if (ptr == NULL) xmem_error("xcalloc"); return ptr; } bogofilter-1.2.4/src/strlcat.c0000644000175000017500000000467312163572304014462 0ustar sezsez/* $Id: strlcat.c 3436 2003-10-29 14:31:52Z m-a $ */ /* from NetBSD: strlcat.c,v 1.5.8.2 2002/04/26 13:17:23 he Exp */ /* from OpenBSD: strlcat.c,v 1.2 1999/06/17 16:28:58 millert Exp */ /* * Copyright (c) 1998 Todd C. Miller * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include #include #include "system.h" /* * Appends src to string dst of size siz (unlike strncat, siz is the * full size of dst, not space left). At most siz-1 characters * will be copied. Always NUL terminates (unless siz == 0). * Returns strlen(src); if retval >= siz, truncation occurred. */ size_t strlcat(char *dst, const char *src, size_t siz) { register char *d = dst; register const char *s = src; register size_t n = siz; size_t dlen; /* Find the end of dst and adjust bytes left but don't go past end */ while (*d != '\0' && n-- != 0) d++; dlen = d - dst; n = siz - dlen; if (n == 0) return(dlen + strlen(s)); while (*s != '\0') { if (n != 1) { *d++ = *s; n--; } s++; } *d = '\0'; return(dlen + (s - src)); /* count does not include NUL */ } bogofilter-1.2.4/src/bsdqueue.h0000644000175000017500000005170412163572304014625 0ustar sezsez/* $NetBSD: queue.h,v 1.39 2004/04/18 14:25:34 lukem Exp $ */ /* * Copyright (c) 1991, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)queue.h 8.5 (Berkeley) 8/20/94 */ #ifndef _SYS_QUEUE_H_ #define _SYS_QUEUE_H_ /* * This file defines five types of data structures: singly-linked lists, * lists, simple queues, tail queues, and circular queues. * * A singly-linked list is headed by a single forward pointer. The * elements are singly linked for minimum space and pointer manipulation * overhead at the expense of O(n) removal for arbitrary elements. New * elements can be added to the list after an existing element or at the * head of the list. Elements being removed from the head of the list * should use the explicit macro for this purpose for optimum * efficiency. A singly-linked list may only be traversed in the forward * direction. Singly-linked lists are ideal for applications with large * datasets and few or no removals or for implementing a LIFO queue. * * A list is headed by a single forward pointer (or an array of forward * pointers for a hash table header). The elements are doubly linked * so that an arbitrary element can be removed without a need to * traverse the list. New elements can be added to the list before * or after an existing element or at the head of the list. A list * may only be traversed in the forward direction. * * A simple queue is headed by a pair of pointers, one the head of the * list and the other to the tail of the list. The elements are singly * linked to save space, so only elements can only be removed from the * head of the list. New elements can be added to the list after * an existing element, at the head of the list, or at the end of the * list. A simple queue may only be traversed in the forward direction. * * A tail queue is headed by a pair of pointers, one to the head of the * list and the other to the tail of the list. The elements are doubly * linked so that an arbitrary element can be removed without a need to * traverse the list. New elements can be added to the list before or * after an existing element, at the head of the list, or at the end of * the list. A tail queue may be traversed in either direction. * * A circle queue is headed by a pair of pointers, one to the head of the * list and the other to the tail of the list. The elements are doubly * linked so that an arbitrary element can be removed without a need to * traverse the list. New elements can be added to the list before or after * an existing element, at the head of the list, or at the end of the list. * A circle queue may be traversed in either direction, but has a more * complex end of list detection. * * For details on the use of these macros, see the queue(3) manual page. */ /* * List definitions. */ #define LIST_HEAD(name, type) \ struct name { \ struct type *lh_first; /* first element */ \ } #define LIST_HEAD_INITIALIZER(head) \ { NULL } #define LIST_ENTRY(type) \ struct { \ struct type *le_next; /* next element */ \ struct type **le_prev; /* address of previous next element */ \ } /* * List functions. */ #if defined(_KERNEL) && defined(QUEUEDEBUG) #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ if ((head)->lh_first && \ (head)->lh_first->field.le_prev != &(head)->lh_first) \ panic("LIST_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__); #define QUEUEDEBUG_LIST_OP(elm, field) \ if ((elm)->field.le_next && \ (elm)->field.le_next->field.le_prev != \ &(elm)->field.le_next) \ panic("LIST_* forw %p %s:%d", (elm), __FILE__, __LINE__);\ if (*(elm)->field.le_prev != (elm)) \ panic("LIST_* back %p %s:%d", (elm), __FILE__, __LINE__); #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ (elm)->field.le_next = (void *)1L; \ (elm)->field.le_prev = (void *)1L; #else #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) #define QUEUEDEBUG_LIST_OP(elm, field) #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) #endif #define LIST_INIT(head) do { \ (head)->lh_first = NULL; \ } while (/*CONSTCOND*/0) #define LIST_INSERT_AFTER(listelm, elm, field) do { \ QUEUEDEBUG_LIST_OP((listelm), field) \ if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \ (listelm)->field.le_next->field.le_prev = \ &(elm)->field.le_next; \ (listelm)->field.le_next = (elm); \ (elm)->field.le_prev = &(listelm)->field.le_next; \ } while (/*CONSTCOND*/0) #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ QUEUEDEBUG_LIST_OP((listelm), field) \ (elm)->field.le_prev = (listelm)->field.le_prev; \ (elm)->field.le_next = (listelm); \ *(listelm)->field.le_prev = (elm); \ (listelm)->field.le_prev = &(elm)->field.le_next; \ } while (/*CONSTCOND*/0) #define LIST_INSERT_HEAD(head, elm, field) do { \ QUEUEDEBUG_LIST_INSERT_HEAD((head), (elm), field) \ if (((elm)->field.le_next = (head)->lh_first) != NULL) \ (head)->lh_first->field.le_prev = &(elm)->field.le_next;\ (head)->lh_first = (elm); \ (elm)->field.le_prev = &(head)->lh_first; \ } while (/*CONSTCOND*/0) #define LIST_REMOVE(elm, field) do { \ QUEUEDEBUG_LIST_OP((elm), field) \ if ((elm)->field.le_next != NULL) \ (elm)->field.le_next->field.le_prev = \ (elm)->field.le_prev; \ *(elm)->field.le_prev = (elm)->field.le_next; \ QUEUEDEBUG_LIST_POSTREMOVE((elm), field) \ } while (/*CONSTCOND*/0) #define LIST_FOREACH(var, head, field) \ for ((var) = ((head)->lh_first); \ (var); \ (var) = ((var)->field.le_next)) /* * List access methods. */ #define LIST_EMPTY(head) ((head)->lh_first == NULL) #define LIST_FIRST(head) ((head)->lh_first) #define LIST_NEXT(elm, field) ((elm)->field.le_next) /* * Singly-linked List definitions. */ #define SLIST_HEAD(name, type) \ struct name { \ struct type *slh_first; /* first element */ \ } #define SLIST_HEAD_INITIALIZER(head) \ { NULL } #define SLIST_ENTRY(type) \ struct { \ struct type *sle_next; /* next element */ \ } /* * Singly-linked List functions. */ #define SLIST_INIT(head) do { \ (head)->slh_first = NULL; \ } while (/*CONSTCOND*/0) #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ (elm)->field.sle_next = (slistelm)->field.sle_next; \ (slistelm)->field.sle_next = (elm); \ } while (/*CONSTCOND*/0) #define SLIST_INSERT_HEAD(head, elm, field) do { \ (elm)->field.sle_next = (head)->slh_first; \ (head)->slh_first = (elm); \ } while (/*CONSTCOND*/0) #define SLIST_REMOVE_HEAD(head, field) do { \ (head)->slh_first = (head)->slh_first->field.sle_next; \ } while (/*CONSTCOND*/0) #define SLIST_REMOVE(head, elm, type, field) do { \ if ((head)->slh_first == (elm)) { \ SLIST_REMOVE_HEAD((head), field); \ } \ else { \ struct type *curelm = (head)->slh_first; \ while(curelm->field.sle_next != (elm)) \ curelm = curelm->field.sle_next; \ curelm->field.sle_next = \ curelm->field.sle_next->field.sle_next; \ } \ } while (/*CONSTCOND*/0) #define SLIST_FOREACH(var, head, field) \ for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next) /* * Singly-linked List access methods. */ #define SLIST_EMPTY(head) ((head)->slh_first == NULL) #define SLIST_FIRST(head) ((head)->slh_first) #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) /* * Singly-linked Tail queue declarations. */ #define STAILQ_HEAD(name, type) \ struct name { \ struct type *stqh_first; /* first element */ \ struct type **stqh_last; /* addr of last next element */ \ } #define STAILQ_HEAD_INITIALIZER(head) \ { NULL, &(head).stqh_first } #define STAILQ_ENTRY(type) \ struct { \ struct type *stqe_next; /* next element */ \ } /* * Singly-linked Tail queue functions. */ #define STAILQ_INIT(head) do { \ (head)->stqh_first = NULL; \ (head)->stqh_last = &(head)->stqh_first; \ } while (/*CONSTCOND*/0) #define STAILQ_INSERT_HEAD(head, elm, field) do { \ if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \ (head)->stqh_last = &(elm)->field.stqe_next; \ (head)->stqh_first = (elm); \ } while (/*CONSTCOND*/0) #define STAILQ_INSERT_TAIL(head, elm, field) do { \ (elm)->field.stqe_next = NULL; \ *(head)->stqh_last = (elm); \ (head)->stqh_last = &(elm)->field.stqe_next; \ } while (/*CONSTCOND*/0) #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\ (head)->stqh_last = &(elm)->field.stqe_next; \ (listelm)->field.stqe_next = (elm); \ } while (/*CONSTCOND*/0) #define STAILQ_REMOVE_HEAD(head, field) do { \ if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == NULL) \ (head)->stqh_last = &(head)->stqh_first; \ } while (/*CONSTCOND*/0) #define STAILQ_REMOVE(head, elm, type, field) do { \ if ((head)->stqh_first == (elm)) { \ STAILQ_REMOVE_HEAD((head), field); \ } else { \ struct type *curelm = (head)->stqh_first; \ while (curelm->field.stqe_next != (elm)) \ curelm = curelm->field.stqe_next; \ if ((curelm->field.stqe_next = \ curelm->field.stqe_next->field.stqe_next) == NULL) \ (head)->stqh_last = &(curelm)->field.stqe_next; \ } \ } while (/*CONSTCOND*/0) #define STAILQ_FOREACH(var, head, field) \ for ((var) = ((head)->stqh_first); \ (var); \ (var) = ((var)->field.stqe_next)) /* * Singly-linked Tail queue access methods. */ #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) #define STAILQ_FIRST(head) ((head)->stqh_first) #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) /* * Simple queue definitions. */ #define SIMPLEQ_HEAD(name, type) \ struct name { \ struct type *sqh_first; /* first element */ \ struct type **sqh_last; /* addr of last next element */ \ } #define SIMPLEQ_HEAD_INITIALIZER(head) \ { NULL, &(head).sqh_first } #define SIMPLEQ_ENTRY(type) \ struct { \ struct type *sqe_next; /* next element */ \ } /* * Simple queue functions. */ #define SIMPLEQ_INIT(head) do { \ (head)->sqh_first = NULL; \ (head)->sqh_last = &(head)->sqh_first; \ } while (/*CONSTCOND*/0) #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \ (head)->sqh_last = &(elm)->field.sqe_next; \ (head)->sqh_first = (elm); \ } while (/*CONSTCOND*/0) #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ (elm)->field.sqe_next = NULL; \ *(head)->sqh_last = (elm); \ (head)->sqh_last = &(elm)->field.sqe_next; \ } while (/*CONSTCOND*/0) #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\ (head)->sqh_last = &(elm)->field.sqe_next; \ (listelm)->field.sqe_next = (elm); \ } while (/*CONSTCOND*/0) #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \ (head)->sqh_last = &(head)->sqh_first; \ } while (/*CONSTCOND*/0) #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ if ((head)->sqh_first == (elm)) { \ SIMPLEQ_REMOVE_HEAD((head), field); \ } else { \ struct type *curelm = (head)->sqh_first; \ while (curelm->field.sqe_next != (elm)) \ curelm = curelm->field.sqe_next; \ if ((curelm->field.sqe_next = \ curelm->field.sqe_next->field.sqe_next) == NULL) \ (head)->sqh_last = &(curelm)->field.sqe_next; \ } \ } while (/*CONSTCOND*/0) #define SIMPLEQ_FOREACH(var, head, field) \ for ((var) = ((head)->sqh_first); \ (var); \ (var) = ((var)->field.sqe_next)) /* * Simple queue access methods. */ #define SIMPLEQ_EMPTY(head) ((head)->sqh_first == NULL) #define SIMPLEQ_FIRST(head) ((head)->sqh_first) #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) /* * Tail queue definitions. */ #define TAILQ_HEAD(name, type) \ struct name { \ struct type *tqh_first; /* first element */ \ struct type **tqh_last; /* addr of last next element */ \ } #define TAILQ_HEAD_INITIALIZER(head) \ { NULL, &(head).tqh_first } #define TAILQ_ENTRY(type) \ struct { \ struct type *tqe_next; /* next element */ \ struct type **tqe_prev; /* address of previous next element */ \ } /* * Tail queue functions. */ #if defined(_KERNEL) && defined(QUEUEDEBUG) #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) \ if ((head)->tqh_first && \ (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \ panic("TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__); #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) \ if (*(head)->tqh_last != NULL) \ panic("TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__); #define QUEUEDEBUG_TAILQ_OP(elm, field) \ if ((elm)->field.tqe_next && \ (elm)->field.tqe_next->field.tqe_prev != \ &(elm)->field.tqe_next) \ panic("TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\ if (*(elm)->field.tqe_prev != (elm)) \ panic("TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__); #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) \ if ((elm)->field.tqe_next == NULL && \ (head)->tqh_last != &(elm)->field.tqe_next) \ panic("TAILQ_PREREMOVE head %p elm %p %s:%d", \ (head), (elm), __FILE__, __LINE__); #define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field) \ (elm)->field.tqe_next = (void *)1L; \ (elm)->field.tqe_prev = (void *)1L; #else #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) #define QUEUEDEBUG_TAILQ_OP(elm, field) #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) #define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field) #endif #define TAILQ_INIT(head) do { \ (head)->tqh_first = NULL; \ (head)->tqh_last = &(head)->tqh_first; \ } while (/*CONSTCOND*/0) #define TAILQ_INSERT_HEAD(head, elm, field) do { \ QUEUEDEBUG_TAILQ_INSERT_HEAD((head), (elm), field) \ if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ (head)->tqh_first->field.tqe_prev = \ &(elm)->field.tqe_next; \ else \ (head)->tqh_last = &(elm)->field.tqe_next; \ (head)->tqh_first = (elm); \ (elm)->field.tqe_prev = &(head)->tqh_first; \ } while (/*CONSTCOND*/0) #define TAILQ_INSERT_TAIL(head, elm, field) do { \ QUEUEDEBUG_TAILQ_INSERT_TAIL((head), (elm), field) \ (elm)->field.tqe_next = NULL; \ (elm)->field.tqe_prev = (head)->tqh_last; \ *(head)->tqh_last = (elm); \ (head)->tqh_last = &(elm)->field.tqe_next; \ } while (/*CONSTCOND*/0) #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ QUEUEDEBUG_TAILQ_OP((listelm), field) \ if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\ (elm)->field.tqe_next->field.tqe_prev = \ &(elm)->field.tqe_next; \ else \ (head)->tqh_last = &(elm)->field.tqe_next; \ (listelm)->field.tqe_next = (elm); \ (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \ } while (/*CONSTCOND*/0) #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ QUEUEDEBUG_TAILQ_OP((listelm), field) \ (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \ (elm)->field.tqe_next = (listelm); \ *(listelm)->field.tqe_prev = (elm); \ (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \ } while (/*CONSTCOND*/0) #define TAILQ_REMOVE(head, elm, field) do { \ QUEUEDEBUG_TAILQ_PREREMOVE((head), (elm), field) \ QUEUEDEBUG_TAILQ_OP((elm), field) \ if (((elm)->field.tqe_next) != NULL) \ (elm)->field.tqe_next->field.tqe_prev = \ (elm)->field.tqe_prev; \ else \ (head)->tqh_last = (elm)->field.tqe_prev; \ *(elm)->field.tqe_prev = (elm)->field.tqe_next; \ QUEUEDEBUG_TAILQ_POSTREMOVE((elm), field); \ } while (/*CONSTCOND*/0) #define TAILQ_FOREACH(var, head, field) \ for ((var) = ((head)->tqh_first); \ (var); \ (var) = ((var)->field.tqe_next)) #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \ (var); \ (var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last))) /* * Tail queue access methods. */ #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) #define TAILQ_FIRST(head) ((head)->tqh_first) #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) #define TAILQ_LAST(head, headname) \ (*(((struct headname *)((head)->tqh_last))->tqh_last)) #define TAILQ_PREV(elm, headname, field) \ (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) /* * Circular queue definitions. */ #define CIRCLEQ_HEAD(name, type) \ struct name { \ struct type *cqh_first; /* first element */ \ struct type *cqh_last; /* last element */ \ } #define CIRCLEQ_HEAD_INITIALIZER(head) \ { (void *)&head, (void *)&head } #define CIRCLEQ_ENTRY(type) \ struct { \ struct type *cqe_next; /* next element */ \ struct type *cqe_prev; /* previous element */ \ } /* * Circular queue functions. */ #define CIRCLEQ_INIT(head) do { \ (head)->cqh_first = (void *)(head); \ (head)->cqh_last = (void *)(head); \ } while (/*CONSTCOND*/0) #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ (elm)->field.cqe_next = (listelm)->field.cqe_next; \ (elm)->field.cqe_prev = (listelm); \ if ((listelm)->field.cqe_next == (void *)(head)) \ (head)->cqh_last = (elm); \ else \ (listelm)->field.cqe_next->field.cqe_prev = (elm); \ (listelm)->field.cqe_next = (elm); \ } while (/*CONSTCOND*/0) #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ (elm)->field.cqe_next = (listelm); \ (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \ if ((listelm)->field.cqe_prev == (void *)(head)) \ (head)->cqh_first = (elm); \ else \ (listelm)->field.cqe_prev->field.cqe_next = (elm); \ (listelm)->field.cqe_prev = (elm); \ } while (/*CONSTCOND*/0) #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ (elm)->field.cqe_next = (head)->cqh_first; \ (elm)->field.cqe_prev = (void *)(head); \ if ((head)->cqh_last == (void *)(head)) \ (head)->cqh_last = (elm); \ else \ (head)->cqh_first->field.cqe_prev = (elm); \ (head)->cqh_first = (elm); \ } while (/*CONSTCOND*/0) #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ (elm)->field.cqe_next = (void *)(head); \ (elm)->field.cqe_prev = (head)->cqh_last; \ if ((head)->cqh_first == (void *)(head)) \ (head)->cqh_first = (elm); \ else \ (head)->cqh_last->field.cqe_next = (elm); \ (head)->cqh_last = (elm); \ } while (/*CONSTCOND*/0) #define CIRCLEQ_REMOVE(head, elm, field) do { \ if ((elm)->field.cqe_next == (void *)(head)) \ (head)->cqh_last = (elm)->field.cqe_prev; \ else \ (elm)->field.cqe_next->field.cqe_prev = \ (elm)->field.cqe_prev; \ if ((elm)->field.cqe_prev == (void *)(head)) \ (head)->cqh_first = (elm)->field.cqe_next; \ else \ (elm)->field.cqe_prev->field.cqe_next = \ (elm)->field.cqe_next; \ } while (/*CONSTCOND*/0) #define CIRCLEQ_FOREACH(var, head, field) \ for ((var) = ((head)->cqh_first); \ (var) != (void *)(head); \ (var) = ((var)->field.cqe_next)) #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ for ((var) = ((head)->cqh_last); \ (var) != (void *)(head); \ (var) = ((var)->field.cqe_prev)) /* * Circular queue access methods. */ #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head)) #define CIRCLEQ_FIRST(head) ((head)->cqh_first) #define CIRCLEQ_LAST(head) ((head)->cqh_last) #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) #endif /* !_SYS_QUEUE_H_ */ bogofilter-1.2.4/src/memcmp.c0000644000175000017500000000236112163572304014254 0ustar sezsez/* $Id: memcmp.c 4814 2004-10-09 03:08:01Z relson $ */ /* memcmp.c -- Replacement memcmp.c * * Useful on systems that don't have a working memcmp, such as SunOS * 4.1.3 and NeXT x86 OpenStep. * * Copyright (C) 2002 - 2003 Matthias Andree * * 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 (see the file COPYING included with this * distribution); if not, write to the Free Software Foundation, Inc., * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include int memcmp(const void *s1, const void *s2, size_t n) { register unsigned const char *p1 = s1, *p2 = s2; int d; while (n-- > 0) { d = *p1++ - *p2++; if (d != 0) return d; } return 0; } bogofilter-1.2.4/src/strtoul.c0000644000175000017500000000104412163572272014513 0ustar sezsez/* strtoul.c - replacement strtoul */ /* (C) 2004 by Matthias Andree. License: GNU GPL v2. */ #include #include unsigned long strtoul(const char *str, char **endptr, int base) { unsigned long ret = 0; if (base != 10) { errno = EINVAL; return 0ul; } while (*str >= '0' && *str <= '9') { if (ret * 10 < ret) goto ovl; ret *= 10; if (ret + (*str - '0') < ret) goto ovl; ret += (*str - '0'); str++; } if (endptr) *endptr = (char *)str; return 0; ovl: errno = ERANGE; return ULONG_MAX; } bogofilter-1.2.4/gsl/0000755000175000017500000000000012163572265012634 5ustar sezsezbogofilter-1.2.4/gsl/gsl_sf_psi.h0000644000175000017500000000422612163572265015141 0ustar sezsez/* specfunc/gsl_sf_psi.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_PSI_H__ #define __GSL_SF_PSI_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Poly-Gamma Functions * * psi(m,x) := (d/dx)^m psi(0,x) = (d/dx)^{m+1} log(gamma(x)) */ /* Di-Gamma Function psi(n) * * n > 0 * exceptions: GSL_EDOM */ int gsl_sf_psi_int_e(const int n, gsl_sf_result * result); double gsl_sf_psi_int(const int n); /* Di-Gamma Function psi(x) * * x != 0.0 * exceptions: GSL_EDOM, GSL_ELOSS */ int gsl_sf_psi_e(const double x, gsl_sf_result * result); double gsl_sf_psi(const double x); /* Di-Gamma Function Re[psi(1 + I y)] * * exceptions: none */ int gsl_sf_psi_1piy_e(const double y, gsl_sf_result * result); double gsl_sf_psi_1piy(const double y); /* Tri-Gamma Function psi^(1)(n) * * n > 0 * exceptions: GSL_EDOM */ int gsl_sf_psi_1_int_e(const int n, gsl_sf_result * result); double gsl_sf_psi_1_int(const int n); /* Poly-Gamma Function psi^(n)(x) * * n >= 0, x > 0.0 * exceptions: GSL_EDOM */ int gsl_sf_psi_n_e(const int n, const double x, gsl_sf_result * result); double gsl_sf_psi_n(const int n, const double x); __END_DECLS #endif /* __GSL_SF_PSI_H__ */ bogofilter-1.2.4/gsl/cdf/0000755000175000017500000000000012163572264013367 5ustar sezsezbogofilter-1.2.4/gsl/cdf/chisq.c0000644000175000017500000000205312163572264014642 0ustar sezsez/* cdf/cdf_chisq.c * * Copyright (C) 2003 Brian Gough * * 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. */ #include #include #include double gsl_cdf_chisq_P (const double x, const double nu) { return gsl_cdf_gamma_P (x, nu / 2, 2.0); } double gsl_cdf_chisq_Q (const double x, const double nu) { return gsl_cdf_gamma_Q (x, nu / 2, 2.0); } bogofilter-1.2.4/gsl/cdf/gamma.c0000644000175000017500000000550512163572264014622 0ustar sezsez/* cdf/cdf_gamma.c * * Copyright (C) 2003 Jason Stover. * * 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. */ /* * Author: J. Stover */ #include #include #include #include #include #define LARGE_A 85 /* * Use the normal approximation as defined in * * D.B. Peizer and J.W. Pratt. "A Normal Approximation * for Binomial, F, Beta, and Other Common, Related Tail * Probabilities, I." Journal of the American Statistical * Association, volume 63, issue 324, Dec. 1968. pp 1416-1456. * * This initial coding of the approximation is giving obviously * incorrect errors. */ #if 0 static double norm_arg (double x, double a) { double t; double arg = x + (1.0 / 3.0) - a - (0.02 / a); double u = (a - 0.5) / x; if (fabs (u - 1.0) < GSL_DBL_EPSILON) { t = 0.0; } else if (fabs (u) < GSL_DBL_EPSILON) { t = 1.0; } else if (u > 0.0) { double v = 1.0 - u; t = (1.0 - u * u + 2 * u * log (u)) / (v * v); } else { t = GSL_NAN; } arg *= sqrt ((1 + t) / x); return arg; } #endif /* * Wrapper for the functions that do the work. */ double gsl_cdf_gamma_P (const double x, const double a, const double b) { double P; double y = x / b; if (x <= 0.0) { return 0.0; } #if 0 /* Not currently working to sufficient accuracy in tails */ if (a > LARGE_A) { /* Use Peizer and Pratt's normal approximation for large A. */ double z = norm_arg (y, a); P = gsl_cdf_ugaussian_P (z); } else #endif { P = gsl_sf_gamma_inc_P (a, y); } return P; } double gsl_cdf_gamma_Q (const double x, const double a, const double b) { double P; double y = x / b; if (x <= 0.0) { return 1.0; } #if 0 /* Not currently working to sufficient accuracy in tails */ if (a > LARGE_A) { /* * Peizer and Pratt's approximation mentioned above. */ double z = norm_arg (y, a); P = gsl_cdf_ugaussian_Q (z); } else #endif { P = gsl_sf_gamma_inc_Q (a, y); } return P; } /* work around automake limitation */ #include "../specfunc/gamma.c" bogofilter-1.2.4/gsl/gsl_cdf.h0000644000175000017500000001324012163572264014405 0ustar sezsez/* cdf/gsl_cdf.h * * Copyright (C) 2002 Jason H. Stover. * * 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. */ /* Author: J. Stover */ #ifndef __GSL_CDF_H__ #define __GSL_CDF_H__ #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS double gsl_cdf_ugaussian_P (const double x); double gsl_cdf_ugaussian_Q (const double x); double gsl_cdf_ugaussian_Pinv (const double P); double gsl_cdf_ugaussian_Qinv (const double Q); double gsl_cdf_gaussian_P (const double x, const double sigma); double gsl_cdf_gaussian_Q (const double x, const double sigma); double gsl_cdf_gaussian_Pinv (const double P, const double sigma); double gsl_cdf_gaussian_Qinv (const double Q, const double sigma); double gsl_cdf_gamma_P (const double x, const double a, const double b); double gsl_cdf_gamma_Q (const double x, const double a, const double b); double gsl_cdf_gamma_Pinv (const double P, const double a, const double b); double gsl_cdf_gamma_Qinv (const double Q, const double a, const double b); double gsl_cdf_cauchy_P (const double x, const double a); double gsl_cdf_cauchy_Q (const double x, const double a); double gsl_cdf_cauchy_Pinv (const double P, const double a); double gsl_cdf_cauchy_Qinv (const double Q, const double a); double gsl_cdf_laplace_P (const double x, const double a); double gsl_cdf_laplace_Q (const double x, const double a); double gsl_cdf_laplace_Pinv (const double P, const double a); double gsl_cdf_laplace_Qinv (const double Q, const double a); double gsl_cdf_rayleigh_P (const double x, const double sigma); double gsl_cdf_rayleigh_Q (const double x, const double sigma); double gsl_cdf_rayleigh_Pinv (const double P, const double sigma); double gsl_cdf_rayleigh_Qinv (const double Q, const double sigma); double gsl_cdf_chisq_P (const double x, const double nu); double gsl_cdf_chisq_Q (const double x, const double nu); double gsl_cdf_chisq_Pinv (const double P, const double nu); double gsl_cdf_chisq_Qinv (const double Q, const double nu); double gsl_cdf_exponential_P (const double x, const double mu); double gsl_cdf_exponential_Q (const double x, const double mu); double gsl_cdf_exponential_Pinv (const double P, const double mu); double gsl_cdf_exponential_Qinv (const double Q, const double mu); double gsl_cdf_tdist_P (const double x, const double nu); double gsl_cdf_tdist_Q (const double x, const double nu); double gsl_cdf_tdist_Pinv (const double P, const double nu); double gsl_cdf_tdist_Qinv (const double Q, const double nu); double gsl_cdf_fdist_P (const double x, const double nu1, const double nu2); double gsl_cdf_fdist_Q (const double x, const double nu1, const double nu2); double gsl_cdf_beta_P (const double x, const double a, const double b); double gsl_cdf_beta_Q (const double x, const double a, const double b); double gsl_cdf_flat_P (const double x, const double a, const double b); double gsl_cdf_flat_Q (const double x, const double a, const double b); double gsl_cdf_flat_Pinv (const double P, const double a, const double b); double gsl_cdf_flat_Qinv (const double Q, const double a, const double b); double gsl_cdf_lognormal_P (const double x, const double zeta, const double sigma); double gsl_cdf_lognormal_Q (const double x, const double zeta, const double sigma); double gsl_cdf_lognormal_Pinv (const double P, const double zeta, const double sigma); double gsl_cdf_lognormal_Qinv (const double Q, const double zeta, const double sigma); double gsl_cdf_gumbel1_P (const double x, const double a, const double b); double gsl_cdf_gumbel1_Q (const double x, const double a, const double b); double gsl_cdf_gumbel1_Pinv (const double P, const double a, const double b); double gsl_cdf_gumbel1_Qinv (const double Q, const double a, const double b); double gsl_cdf_gumbel2_P (const double x, const double a, const double b); double gsl_cdf_gumbel2_Q (const double x, const double a, const double b); double gsl_cdf_gumbel2_Pinv (const double P, const double a, const double b); double gsl_cdf_gumbel2_Qinv (const double Q, const double a, const double b); double gsl_cdf_weibull_P (const double x, const double a, const double b); double gsl_cdf_weibull_Q (const double x, const double a, const double b); double gsl_cdf_weibull_Pinv (const double P, const double a, const double b); double gsl_cdf_weibull_Qinv (const double Q, const double a, const double b); double gsl_cdf_pareto_P (const double x, const double a, const double b); double gsl_cdf_pareto_Q (const double x, const double a, const double b); double gsl_cdf_pareto_Pinv (const double P, const double a, const double b); double gsl_cdf_pareto_Qinv (const double Q, const double a, const double b); double gsl_cdf_logistic_P (const double x, const double a); double gsl_cdf_logistic_Q (const double x, const double a); double gsl_cdf_logistic_Pinv (const double P, const double a); double gsl_cdf_logistic_Qinv (const double Q, const double a); __END_DECLS #endif /* __GSL_CDF_H__ */ bogofilter-1.2.4/gsl/gsl_errno.h0000644000175000017500000001346212163572264015004 0ustar sezsez/* err/gsl_errno.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __GSL_ERRNO_H__ #define __GSL_ERRNO_H__ #include #include #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS enum { GSL_SUCCESS = 0, GSL_FAILURE = -1, GSL_CONTINUE = -2, /* iteration has not converged */ GSL_EDOM = 1, /* input domain error, e.g sqrt(-1) */ GSL_ERANGE = 2, /* output range error, e.g. exp(1e100) */ GSL_EFAULT = 3, /* invalid pointer */ GSL_EINVAL = 4, /* invalid argument supplied by user */ GSL_EFAILED = 5, /* generic failure */ GSL_EFACTOR = 6, /* factorization failed */ GSL_ESANITY = 7, /* sanity check failed - shouldn't happen */ GSL_ENOMEM = 8, /* malloc failed */ GSL_EBADFUNC = 9, /* problem with user-supplied function */ GSL_ERUNAWAY = 10, /* iterative process is out of control */ GSL_EMAXITER = 11, /* exceeded max number of iterations */ GSL_EZERODIV = 12, /* tried to divide by zero */ GSL_EBADTOL = 13, /* user specified an invalid tolerance */ GSL_ETOL = 14, /* failed to reach the specified tolerance */ GSL_EUNDRFLW = 15, /* underflow */ GSL_EOVRFLW = 16, /* overflow */ GSL_ELOSS = 17, /* loss of accuracy */ GSL_EROUND = 18, /* failed because of roundoff error */ GSL_EBADLEN = 19, /* matrix, vector lengths are not conformant */ GSL_ENOTSQR = 20, /* matrix not square */ GSL_ESING = 21, /* apparent singularity detected */ GSL_EDIVERGE = 22, /* integral or series is divergent */ GSL_EUNSUP = 23, /* requested feature is not supported by the hardware */ GSL_EUNIMPL = 24, /* requested feature not (yet) implemented */ GSL_ECACHE = 25, /* cache limit exceeded */ GSL_ETABLE = 26, /* table limit exceeded */ GSL_ENOPROG = 27, /* iteration is not making progress towards solution */ GSL_ENOPROGJ = 28, /* jacobian evaluations are not improving the solution */ GSL_ETOLF = 29, /* cannot reach the specified tolerance in F */ GSL_ETOLX = 30, /* cannot reach the specified tolerance in X */ GSL_ETOLG = 31, /* cannot reach the specified tolerance in gradient */ GSL_EOF = 32 /* end of file */ } ; void gsl_error (const char * reason, const char * file, int line, int gsl_errno); void gsl_stream_printf (const char *label, const char *file, int line, const char *reason); const char * gsl_strerror (const int gsl_errno); typedef void gsl_error_handler_t (const char * reason, const char * file, int line, int gsl_errno); typedef void gsl_stream_handler_t (const char * label, const char * file, int line, const char * reason); gsl_error_handler_t * gsl_set_error_handler (gsl_error_handler_t * new_handler); gsl_error_handler_t * gsl_set_error_handler_off (void); gsl_stream_handler_t * gsl_set_stream_handler (gsl_stream_handler_t * new_handler); FILE * gsl_set_stream (FILE * new_stream); /* GSL_ERROR: call the error handler, and return the error code */ #define GSL_ERROR(reason, gsl_errno) \ do { \ gsl_error (reason, __FILE__, __LINE__, gsl_errno) ; \ return gsl_errno ; \ } while (0) /* GSL_ERROR_VAL: call the error handler, and return the given value */ #define GSL_ERROR_VAL(reason, gsl_errno, value) \ do { \ gsl_error (reason, __FILE__, __LINE__, gsl_errno) ; \ return value ; \ } while (0) /* GSL_ERROR_VOID: call the error handler, and then return (for void functions which still need to generate an error) */ #define GSL_ERROR_VOID(reason, gsl_errno) \ do { \ gsl_error (reason, __FILE__, __LINE__, gsl_errno) ; \ return ; \ } while (0) /* GSL_ERROR_NULL suitable for out-of-memory conditions */ #define GSL_ERROR_NULL(reason, gsl_errno) GSL_ERROR_VAL(reason, gsl_errno, 0) /* Sometimes you have several status results returned from * function calls and you want to combine them in some sensible * way. You cannot produce a "total" status condition, but you can * pick one from a set of conditions based on an implied hierarchy. * * In other words: * you have: status_a, status_b, ... * you want: status = (status_a if it is bad, or status_b if it is bad,...) * * In this example you consider status_a to be more important and * it is checked first, followed by the others in the order specified. * * Here are some dumb macros to do this. */ #define GSL_ERROR_SELECT_2(a,b) ((a) != GSL_SUCCESS ? (a) : ((b) != GSL_SUCCESS ? (b) : GSL_SUCCESS)) #define GSL_ERROR_SELECT_3(a,b,c) ((a) != GSL_SUCCESS ? (a) : GSL_ERROR_SELECT_2(b,c)) #define GSL_ERROR_SELECT_4(a,b,c,d) ((a) != GSL_SUCCESS ? (a) : GSL_ERROR_SELECT_3(b,c,d)) #define GSL_ERROR_SELECT_5(a,b,c,d,e) ((a) != GSL_SUCCESS ? (a) : GSL_ERROR_SELECT_4(b,c,d,e)) #define GSL_STATUS_UPDATE(sp, s) do { if ((s) != GSL_SUCCESS) *(sp) = (s);} while(0) __END_DECLS #endif /* __GSL_ERRNO_H__ */ bogofilter-1.2.4/gsl/gsl_sf_erf.h0000644000175000017500000000434212163572265015121 0ustar sezsez/* specfunc/gsl_sf_erf.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_ERF_H__ #define __GSL_SF_ERF_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Complementary Error Function * erfc(x) := 2/Sqrt[Pi] Integrate[Exp[-t^2], {t,x,Infinity}] * * exceptions: none */ int gsl_sf_erfc_e(double x, gsl_sf_result * result); double gsl_sf_erfc(double x); /* Log Complementary Error Function * * exceptions: none */ int gsl_sf_log_erfc_e(double x, gsl_sf_result * result); double gsl_sf_log_erfc(double x); /* Error Function * erf(x) := 2/Sqrt[Pi] Integrate[Exp[-t^2], {t,0,x}] * * exceptions: none */ int gsl_sf_erf_e(double x, gsl_sf_result * result); double gsl_sf_erf(double x); /* Probability functions: * Z(x) : Abramowitz+Stegun 26.2.1 * Q(x) : Abramowitz+Stegun 26.2.3 * * exceptions: none */ int gsl_sf_erf_Z_e(double x, gsl_sf_result * result); int gsl_sf_erf_Q_e(double x, gsl_sf_result * result); double gsl_sf_erf_Z(double x); double gsl_sf_erf_Q(double x); /* Hazard function, also known as the inverse Mill's ratio. * * H(x) := Z(x)/Q(x) * = Sqrt[2/Pi] Exp[-x^2 / 2] / Erfc[x/Sqrt[2]] * * exceptions: GSL_EUNDRFLW */ int gsl_sf_hazard_e(double x, gsl_sf_result * result); double gsl_sf_hazard(double x); __END_DECLS #endif /* __GSL_SF_ERF_H__ */ bogofilter-1.2.4/gsl/gsl_sf_log.h0000644000175000017500000000535512163572265015133 0ustar sezsez/* specfunc/gsl_sf_log.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_LOG_H__ #define __GSL_SF_LOG_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Provide a logarithm function with GSL semantics. * * exceptions: GSL_EDOM */ int gsl_sf_log_e(const double x, gsl_sf_result * result); double gsl_sf_log(const double x); /* Log(|x|) * * exceptions: GSL_EDOM */ int gsl_sf_log_abs_e(const double x, gsl_sf_result * result); double gsl_sf_log_abs(const double x); /* Complex Logarithm * exp(lnr + I theta) = zr + I zi * Returns argument in [-pi,pi]. * * exceptions: GSL_EDOM */ int gsl_sf_complex_log_e(const double zr, const double zi, gsl_sf_result * lnr, gsl_sf_result * theta); /* Log(1 + x) * * exceptions: GSL_EDOM */ int gsl_sf_log_1plusx_e(const double x, gsl_sf_result * result); double gsl_sf_log_1plusx(const double x); /* Log(1 + x) - x * * exceptions: GSL_EDOM */ int gsl_sf_log_1plusx_mx_e(const double x, gsl_sf_result * result); double gsl_sf_log_1plusx_mx(const double x); #if HAVE_EXTERN_INLINE extern inline int gsl_sf_log_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x <= 0.0) { result->val = GSL_NAN; result->err = GSL_NAN; GSL_ERROR ("domain error", GSL_EDOM); } else { result->val = log(x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } extern inline int gsl_sf_log_abs_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x == 0.0) { result->val = GSL_NAN; result->err = GSL_NAN; GSL_ERROR ("domain error", GSL_EDOM); } else { result->val = log(fabs(x)); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } #endif /* HAVE_EXTERN_INLINE */ __END_DECLS #endif /* __GSL_SF_LOG_H__ */ bogofilter-1.2.4/gsl/gsl_message.h0000644000175000017500000000453112163572264015300 0ustar sezsez/* err/gsl_message.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __GSL_MESSAGE_H__ #define __GSL_MESSAGE_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Provide a general messaging service for client use. Messages can * be selectively turned off at compile time by defining an * appropriate message mask. Client code which uses the GSL_MESSAGE() * macro must provide a mask which is or'ed with the GSL_MESSAGE_MASK. * * The messaging service can be completely turned off * by defining GSL_MESSAGING_OFF. */ void gsl_message(const char * message, const char * file, int line, unsigned int mask); #ifndef GSL_MESSAGE_MASK #define GSL_MESSAGE_MASK 0xffffffffu /* default all messages allowed */ #endif GSL_VAR unsigned int gsl_message_mask ; /* Provide some symolic masks for client ease of use. */ enum { GSL_MESSAGE_MASK_A = 1, GSL_MESSAGE_MASK_B = 2, GSL_MESSAGE_MASK_C = 4, GSL_MESSAGE_MASK_D = 8, GSL_MESSAGE_MASK_E = 16, GSL_MESSAGE_MASK_F = 32, GSL_MESSAGE_MASK_G = 64, GSL_MESSAGE_MASK_H = 128 } ; #ifdef GSL_MESSAGING_OFF /* throw away messages */ #define GSL_MESSAGE(message, mask) do { } while(0) #else /* output all messages */ #define GSL_MESSAGE(message, mask) \ do { \ if (mask & GSL_MESSAGE_MASK) \ gsl_message (message, __FILE__, __LINE__, mask) ; \ } while (0) #endif __END_DECLS #endif /* __GSL_MESSAGE_H__ */ bogofilter-1.2.4/gsl/sys/0000755000175000017500000000000012163572265013452 5ustar sezsezbogofilter-1.2.4/gsl/sys/minmax.c0000644000175000017500000000357112163572265015115 0ustar sezsez/* sys/minmax.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #define GSL_MAX(a,b) ((a) > (b) ? (a) : (b)) #define GSL_MIN(a,b) ((a) < (b) ? (a) : (b)) #ifndef HIDE_INLINE_STATIC int GSL_MAX_INT (int a, int b); int GSL_MIN_INT (int a, int b); double GSL_MAX_DBL (double a, double b); double GSL_MIN_DBL (double a, double b); long double GSL_MAX_LDBL (long double a, long double b); long double GSL_MIN_LDBL (long double a, long double b); int GSL_MAX_INT (int a, int b) { return GSL_MAX (a, b); } int GSL_MIN_INT (int a, int b) { return GSL_MIN (a, b); } double GSL_MAX_DBL (double a, double b) { return GSL_MAX (a, b); } double GSL_MIN_DBL (double a, double b) { return GSL_MIN (a, b); } long double GSL_MAX_LDBL (long double a, long double b) { return GSL_MAX (a, b); } long double GSL_MIN_LDBL (long double a, long double b) { return GSL_MIN (a, b); } #endif /* Define some static functions which are always available */ double gsl_max (double a, double b); double gsl_min (double a, double b); double gsl_max (double a, double b) { return GSL_MAX (a, b); } double gsl_min (double a, double b) { return GSL_MIN (a, b); } bogofilter-1.2.4/gsl/sys/fdiv.c0000644000175000017500000000163012163572265014546 0ustar sezsez/* sys/fdiv.c * * Copyright (C) 2001 Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include double gsl_fdiv (const double x, const double y); double gsl_fdiv (const double x, const double y) { return x / y; } bogofilter-1.2.4/gsl/sys/coerce.c0000644000175000017500000000246512163572265015065 0ustar sezsez/* sys/coerce.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include double gsl_coerce_double (const double x); double gsl_coerce_double (const double x) { volatile double y; y = x; return y; } float gsl_coerce_float (const float x); float gsl_coerce_float (const float x) { volatile float y; y = x; return y; } /* The following function is not needed, but is included for completeness */ long double gsl_coerce_long_double (const long double x); long double gsl_coerce_long_double (const long double x) { volatile long double y; y = x; return y; } bogofilter-1.2.4/gsl/sys/pow_int.c0000644000175000017500000000332612163572265015301 0ustar sezsez/* sys/pow_int.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #ifndef HIDE_INLINE_STATIC double gsl_pow_2(const double x) { return x*x; } double gsl_pow_3(const double x) { return x*x*x; } double gsl_pow_4(const double x) { double x2 = x*x; return x2*x2; } double gsl_pow_5(const double x) { double x2 = x*x; return x2*x2*x; } double gsl_pow_6(const double x) { double x2 = x*x; return x2*x2*x2; } double gsl_pow_7(const double x) { double x3 = x*x*x; return x3*x3*x; } double gsl_pow_8(const double x) { double x2 = x*x; double x4 = x2*x2; return x4*x4; } double gsl_pow_9(const double x) { double x3 = x*x*x; return x3*x3*x3; } #endif double gsl_pow_int(double x, int n) { double value = 1.0; if(n < 0) { x = 1.0/x; n = -n; } /* repeated squaring method * returns 0.0^0 = 1.0, so continuous in x */ do { if(n & 1) value *= x; /* for n odd */ n >>= 1; x *= x; } while (n); return value; } bogofilter-1.2.4/gsl/sys/infnan.c0000644000175000017500000000436112163572265015073 0ustar sezsez/* sys/infnan.c * * Copyright (C) 2001 Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include double gsl_nan (void); double gsl_posinf (void); double gsl_neginf (void); double gsl_fdiv (const double x, const double y); double gsl_nan (void) { return gsl_fdiv (0.0, 0.0); } double gsl_posinf (void) { return gsl_fdiv (+1.0, 0.0); } double gsl_neginf (void) { return gsl_fdiv (-1.0, 0.0); } int gsl_isnan (const double x); int gsl_isinf (const double x); int gsl_finite (const double x); #if defined(_MSC_VER) /* Microsoft Visual C++ */ #include int gsl_isnan (const double x) { return _isnan(x); } int gsl_isinf (const double x) { int fpc = _fpclass(x); if (fpc == _FPCLASS_PINF) return +1; else if (fpc == _FPCLASS_NINF) return -1; else return 0; } int gsl_finite (const double x) { return _finite(x); } #elif HAVE_IEEE_COMPARISONS int gsl_isnan (const double x) { int status = (x != x); return status; } int gsl_isinf (const double x) { double y = x - x; int s = (y != y); if (s && x > 0) return +1; else if (s && x < 0) return -1; else return 0; } int gsl_finite (const double x) { const double y = x - x; int status = (y == y); return status; } #else #if HAVE_DECL_ISNAN int gsl_isnan (const double x) { return isnan(x); } #endif #if HAVE_DECL_ISINF int gsl_isinf (const double x) { return isinf(x); } #endif #if HAVE_DECL_FINITE int gsl_finite (const double x) { return finite(x); } #elif HAVE_DECL_ISFINITE int gsl_finite (const double x) { return isfinite(x); } #endif #endif bogofilter-1.2.4/gsl/AUTHORS0000644000175000017500000000307412163572264013707 0ustar sezsez# $Id: AUTHORS 3178 2003-09-25 09:51:02Z relson $ GSL is copyrighted and may be distributed under the terms of the GNU General Public License V2. GSL authors are: Mark Galassi (rosalia@lanl.gov) - overall design, simulated annealing Jim Davies (jimmyd@nis.lanl.gov) - statistics library James Theiler (jt@nis.lanl.gov) - random number generators Brian Gough (bjg@network-theory.co.uk) - FFTs, numerical integration, random number generators and distributions, root finding, minimization and fitting, polynomial solvers, complex numbers, physical constants, permutations, vector and matrix functions, histograms, statistics, ieee-utils, revised CBLAS Level 2 & 3, matrix decompositions and eigensystems. Reid Priedhorsky (rp@lanl.gov) - root finding Gerard Jungman (jungman@lanl.gov) special functions, interpolation, series acceleration, ODEs, BLAS, Linear Algebra, Eigensystems, Hankel Transforms. Michael Booth (booth@debian.org (email address not working)) - Monte Carlo integration Fabrice Rossi (rossi@ufrmd.dauphine.fr) - Multidimensional minimization Simone Piccardi (piccardi@fi.infn.it) - Ntuples Carlo Perassi (carlo@linux.it) - Additional random number generators Dan, Ho-Jin (hjdan@sys713.kaist.ac.kr) - divided differences interpolation Szymon Jaroszewicz (sj@cs.umb.edu) - combinations Nicolas Darnis (ndarnis@cvf.fr) - canonical permutation functions Tuomo Keskitalo (tuomo.keskitalo@iki.fi) - multidimensional minimization Ivo Alxneit (ivo.alxneit@psi.ch) - multidimensional minimization Jason H. Stover (jason@sakla.net) - cumulative distribution functions bogofilter-1.2.4/gsl/gsl_machine.h0000644000175000017500000000733512163572265015266 0ustar sezsez/* Author: B. Gough and G. Jungman */ #ifndef __GSL_MACHINE_H__ #define __GSL_MACHINE_H__ #include #include /* magic constants; mostly for the benefit of the implementation */ /* -*-MACHINE CONSTANTS-*- * * PLATFORM: Whiz-O-Matic 9000 * FP_PLATFORM: IEEE-Virtual * HOSTNAME: nnn.lanl.gov * DATE: Fri Nov 20 17:53:26 MST 1998 */ #define GSL_DBL_EPSILON 2.2204460492503131e-16 #define GSL_SQRT_DBL_EPSILON 1.4901161193847656e-08 #define GSL_ROOT3_DBL_EPSILON 6.0554544523933429e-06 #define GSL_ROOT4_DBL_EPSILON 1.2207031250000000e-04 #define GSL_ROOT5_DBL_EPSILON 7.4009597974140505e-04 #define GSL_ROOT6_DBL_EPSILON 2.4607833005759251e-03 #define GSL_LOG_DBL_EPSILON (-3.6043653389117154e+01) #define GSL_DBL_MIN 2.2250738585072014e-308 #define GSL_SQRT_DBL_MIN 1.4916681462400413e-154 #define GSL_ROOT3_DBL_MIN 2.8126442852362996e-103 #define GSL_ROOT4_DBL_MIN 1.2213386697554620e-77 #define GSL_ROOT5_DBL_MIN 2.9476022969691763e-62 #define GSL_ROOT6_DBL_MIN 5.3034368905798218e-52 #define GSL_LOG_DBL_MIN (-7.0839641853226408e+02) #define GSL_DBL_MAX 1.7976931348623157e+308 #define GSL_SQRT_DBL_MAX 1.3407807929942596e+154 #define GSL_ROOT3_DBL_MAX 5.6438030941222897e+102 #define GSL_ROOT4_DBL_MAX 1.1579208923731620e+77 #define GSL_ROOT5_DBL_MAX 4.4765466227572707e+61 #define GSL_ROOT6_DBL_MAX 2.3756689782295612e+51 #define GSL_LOG_DBL_MAX 7.0978271289338397e+02 #define GSL_FLT_EPSILON 1.1920928955078125e-07 #define GSL_SQRT_FLT_EPSILON 3.4526698300124393e-04 #define GSL_ROOT3_FLT_EPSILON 4.9215666011518501e-03 #define GSL_ROOT4_FLT_EPSILON 1.8581361171917516e-02 #define GSL_ROOT5_FLT_EPSILON 4.1234622211652937e-02 #define GSL_ROOT6_FLT_EPSILON 7.0153878019335827e-02 #define GSL_LOG_FLT_EPSILON (-1.5942385152878742e+01) #define GSL_FLT_MIN 1.1754943508222875e-38 #define GSL_SQRT_FLT_MIN 1.0842021724855044e-19 #define GSL_ROOT3_FLT_MIN 2.2737367544323241e-13 #define GSL_ROOT4_FLT_MIN 3.2927225399135965e-10 #define GSL_ROOT5_FLT_MIN 2.5944428542140822e-08 #define GSL_ROOT6_FLT_MIN 4.7683715820312542e-07 #define GSL_LOG_FLT_MIN (-8.7336544750553102e+01) #define GSL_FLT_MAX 3.4028234663852886e+38 #define GSL_SQRT_FLT_MAX 1.8446743523953730e+19 #define GSL_ROOT3_FLT_MAX 6.9814635196223242e+12 #define GSL_ROOT4_FLT_MAX 4.2949672319999986e+09 #define GSL_ROOT5_FLT_MAX 5.0859007855960041e+07 #define GSL_ROOT6_FLT_MAX 2.6422459233807749e+06 #define GSL_LOG_FLT_MAX 8.8722839052068352e+01 #define GSL_SFLT_EPSILON 4.8828125000000000e-04 #define GSL_SQRT_SFLT_EPSILON 2.2097086912079612e-02 #define GSL_ROOT3_SFLT_EPSILON 7.8745065618429588e-02 #define GSL_ROOT4_SFLT_EPSILON 1.4865088937534013e-01 #define GSL_ROOT5_SFLT_EPSILON 2.1763764082403100e-01 #define GSL_ROOT6_SFLT_EPSILON 2.8061551207734325e-01 #define GSL_LOG_SFLT_EPSILON (-7.6246189861593985e+00) /* !MACHINE CONSTANTS! */ /* a little internal backwards compatibility */ #define GSL_MACH_EPS GSL_DBL_EPSILON /* Here are the constants related to or derived from * machine constants. These are not to be confused with * the constants that define various precision levels * for the precision/error system. * * This information is determined at configure time * and is platform dependent. Edit at your own risk. * * PLATFORM: WHIZ-O-MATIC * CONFIG-DATE: Thu Nov 19 19:27:18 MST 1998 * CONFIG-HOST: nnn.lanl.gov */ /* machine precision constants */ /* #define GSL_MACH_EPS 1.0e-15 */ #define GSL_SQRT_MACH_EPS 3.2e-08 #define GSL_ROOT3_MACH_EPS 1.0e-05 #define GSL_ROOT4_MACH_EPS 0.000178 #define GSL_ROOT5_MACH_EPS 0.00100 #define GSL_ROOT6_MACH_EPS 0.00316 #define GSL_LOG_MACH_EPS (-34.54) #endif /* __GSL_MACHINE_H__ */ bogofilter-1.2.4/gsl/gsl_sf_trig.h0000644000175000017500000000754012163572264015314 0ustar sezsez/* specfunc/gsl_sf_trig.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_TRIG_H__ #define __GSL_SF_TRIG_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Sin(x) with GSL semantics. This is actually important * because we want to control the error estimate, and trying * to guess the error for the standard library implementation * every time it is used would be a little goofy. */ int gsl_sf_sin_e(double x, gsl_sf_result * result); double gsl_sf_sin(const double x); /* Cos(x) with GSL semantics. */ int gsl_sf_cos_e(double x, gsl_sf_result * result); double gsl_sf_cos(const double x); /* Hypot(x,y) with GSL semantics. */ int gsl_sf_hypot_e(const double x, const double y, gsl_sf_result * result); double gsl_sf_hypot(const double x, const double y); /* Sin(z) for complex z * * exceptions: GSL_EOVRFLW */ int gsl_sf_complex_sin_e(const double zr, const double zi, gsl_sf_result * szr, gsl_sf_result * szi); /* Cos(z) for complex z * * exceptions: GSL_EOVRFLW */ int gsl_sf_complex_cos_e(const double zr, const double zi, gsl_sf_result * czr, gsl_sf_result * czi); /* Log(Sin(z)) for complex z * * exceptions: GSL_EDOM, GSL_ELOSS */ int gsl_sf_complex_logsin_e(const double zr, const double zi, gsl_sf_result * lszr, gsl_sf_result * lszi); /* Sinc(x) = sin(pi x) / (pi x) * * exceptions: none */ int gsl_sf_sinc_e(double x, gsl_sf_result * result); double gsl_sf_sinc(const double x); /* Log(Sinh(x)), x > 0 * * exceptions: GSL_EDOM */ int gsl_sf_lnsinh_e(const double x, gsl_sf_result * result); double gsl_sf_lnsinh(const double x); /* Log(Cosh(x)) * * exceptions: none */ int gsl_sf_lncosh_e(const double x, gsl_sf_result * result); double gsl_sf_lncosh(const double x); /* Convert polar to rectlinear coordinates. * * exceptions: GSL_ELOSS */ int gsl_sf_polar_to_rect(const double r, const double theta, gsl_sf_result * x, gsl_sf_result * y); /* Convert rectilinear to polar coordinates. * return argument in range [-pi, pi] * * exceptions: GSL_EDOM */ int gsl_sf_rect_to_polar(const double x, const double y, gsl_sf_result * r, gsl_sf_result * theta); /* Sin(x) for quantity with an associated error. */ int gsl_sf_sin_err_e(const double x, const double dx, gsl_sf_result * result); /* Cos(x) for quantity with an associated error. */ int gsl_sf_cos_err_e(const double x, const double dx, gsl_sf_result * result); /* Force an angle to lie in the range (-pi,pi]. * * exceptions: GSL_ELOSS */ int gsl_sf_angle_restrict_symm_e(double * theta); double gsl_sf_angle_restrict_symm(const double theta); /* Force an angle to lie in the range [0, 2pi) * * exceptions: GSL_ELOSS */ int gsl_sf_angle_restrict_pos_e(double * theta); double gsl_sf_angle_restrict_pos(const double theta); int gsl_sf_angle_restrict_symm_err_e(const double theta, gsl_sf_result * result); int gsl_sf_angle_restrict_pos_err_e(const double theta, gsl_sf_result * result); __END_DECLS #endif /* __GSL_SF_TRIG_H__ */ bogofilter-1.2.4/gsl/err/0000755000175000017500000000000012163572264013423 5ustar sezsezbogofilter-1.2.4/gsl/err/error.c0000644000175000017500000000370412163572264014724 0ustar sezsez/* err/error.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include gsl_error_handler_t * gsl_error_handler = NULL; static void no_error_handler (const char *reason, const char *file, int line, int gsl_errno); void gsl_error (const char * reason, const char * file, int line, int gsl_errno) { if (gsl_error_handler) { (*gsl_error_handler) (reason, file, line, gsl_errno); return ; } gsl_stream_printf ("ERROR", file, line, reason); fprintf (stderr, "Default GSL error handler invoked.\n"); abort (); } gsl_error_handler_t * gsl_set_error_handler (gsl_error_handler_t * new_handler) { gsl_error_handler_t * previous_handler = gsl_error_handler; gsl_error_handler = new_handler; return previous_handler; } gsl_error_handler_t * gsl_set_error_handler_off (void) { gsl_error_handler_t * previous_handler = gsl_error_handler; gsl_error_handler = no_error_handler; return previous_handler; } static void no_error_handler (const char *reason, const char *file, int line, int gsl_errno) { /* do nothing */ reason = 0; file = 0; line = 0; gsl_errno = 0; return; } bogofilter-1.2.4/gsl/err/stream.c0000644000175000017500000000342412163572264015065 0ustar sezsez/* err/stream.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include FILE * gsl_stream = NULL ; gsl_stream_handler_t * gsl_stream_handler = NULL; void gsl_stream_printf (const char *label, const char *file, int line, const char *reason) { if (gsl_stream == NULL) { gsl_stream = stderr; } if (gsl_stream_handler) { (*gsl_stream_handler) (label, file, line, reason); return; } fprintf (gsl_stream, "gsl: %s:%d: %s: %s\n", file, line, label, reason); } gsl_stream_handler_t * gsl_set_stream_handler (gsl_stream_handler_t * new_handler) { gsl_stream_handler_t * previous_handler = gsl_stream_handler; gsl_stream_handler = new_handler; return previous_handler; } FILE * gsl_set_stream (FILE * new_stream) { FILE * previous_stream; if (gsl_stream == NULL) { gsl_stream = stderr; } previous_stream = gsl_stream; gsl_stream = new_stream; return previous_stream; } bogofilter-1.2.4/gsl/gsl_sf_gamma.h0000644000175000017500000001637012163572265015433 0ustar sezsez/* specfunc/gsl_sf_gamma.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_GAMMA_H__ #define __GSL_SF_GAMMA_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Log[Gamma(x)], x not a negative integer * Uses real Lanczos method. * Returns the real part of Log[Gamma[x]] when x < 0, * i.e. Log[|Gamma[x]|]. * * exceptions: GSL_EDOM, GSL_EROUND */ int gsl_sf_lngamma_e(double x, gsl_sf_result * result); double gsl_sf_lngamma(const double x); /* Log[Gamma(x)], x not a negative integer * Uses real Lanczos method. Determines * the sign of Gamma[x] as well as Log[|Gamma[x]|] for x < 0. * So Gamma[x] = sgn * Exp[result_lg]. * * exceptions: GSL_EDOM, GSL_EROUND */ int gsl_sf_lngamma_sgn_e(double x, gsl_sf_result * result_lg, double *sgn); /* Gamma(x), x not a negative integer * Uses real Lanczos method. * * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EROUND */ int gsl_sf_gamma_e(const double x, gsl_sf_result * result); double gsl_sf_gamma(const double x); /* Regulated Gamma Function, x > 0 * Gamma^*(x) = Gamma(x)/(Sqrt[2Pi] x^(x-1/2) exp(-x)) * = (1 + 1/(12x) + ...), x->Inf * A useful suggestion of Temme. * * exceptions: GSL_EDOM */ int gsl_sf_gammastar_e(const double x, gsl_sf_result * result); double gsl_sf_gammastar(const double x); /* 1/Gamma(x) * Uses real Lanczos method. * * exceptions: GSL_EUNDRFLW, GSL_EROUND */ int gsl_sf_gammainv_e(const double x, gsl_sf_result * result); double gsl_sf_gammainv(const double x); /* Log[Gamma(z)] for z complex, z not a negative integer * Uses complex Lanczos method. Note that the phase part (arg) * is not well-determined when |z| is very large, due * to inevitable roundoff in restricting to (-Pi,Pi]. * This will raise the GSL_ELOSS exception when it occurs. * The absolute value part (lnr), however, never suffers. * * Calculates: * lnr = log|Gamma(z)| * arg = arg(Gamma(z)) in (-Pi, Pi] * * exceptions: GSL_EDOM, GSL_ELOSS */ int gsl_sf_lngamma_complex_e(double zr, double zi, gsl_sf_result * lnr, gsl_sf_result * arg); /* x^n / n! * * x >= 0.0, n >= 0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_taylorcoeff_e(const int n, const double x, gsl_sf_result * result); double gsl_sf_taylorcoeff(const int n, const double x); /* n! * * exceptions: GSL_EDOM, GSL_OVRFLW */ int gsl_sf_fact_e(const unsigned int n, gsl_sf_result * result); double gsl_sf_fact(const unsigned int n); /* n!! = n(n-2)(n-4) ... * * exceptions: GSL_EDOM, GSL_OVRFLW */ int gsl_sf_doublefact_e(const unsigned int n, gsl_sf_result * result); double gsl_sf_doublefact(const unsigned int n); /* log(n!) * Faster than ln(Gamma(n+1)) for n < 170; defers for larger n. * * exceptions: none */ int gsl_sf_lnfact_e(const unsigned int n, gsl_sf_result * result); double gsl_sf_lnfact(const unsigned int n); /* log(n!!) * * exceptions: none */ int gsl_sf_lndoublefact_e(const unsigned int n, gsl_sf_result * result); double gsl_sf_lndoublefact(const unsigned int n); /* log(n choose m) * * exceptions: GSL_EDOM */ int gsl_sf_lnchoose_e(unsigned int n, unsigned int m, gsl_sf_result * result); double gsl_sf_lnchoose(unsigned int n, unsigned int m); /* n choose m * * exceptions: GSL_EDOM, GSL_EOVRFLW */ int gsl_sf_choose_e(unsigned int n, unsigned int m, gsl_sf_result * result); double gsl_sf_choose(unsigned int n, unsigned int m); /* Logarithm of Pochhammer (Apell) symbol * log( (a)_x ) * where (a)_x := Gamma[a + x]/Gamma[a] * * a > 0, a+x > 0 * * exceptions: GSL_EDOM */ int gsl_sf_lnpoch_e(const double a, const double x, gsl_sf_result * result); double gsl_sf_lnpoch(const double a, const double x); /* Logarithm of Pochhammer (Apell) symbol, with sign information. * result = log( |(a)_x| ) * sgn = sgn( (a)_x ) * where (a)_x := Gamma[a + x]/Gamma[a] * * a != neg integer, a+x != neg integer * * exceptions: GSL_EDOM */ int gsl_sf_lnpoch_sgn_e(const double a, const double x, gsl_sf_result * result, double * sgn); /* Pochhammer (Apell) symbol * (a)_x := Gamma[a + x]/Gamma[x] * * a != neg integer, a+x != neg integer * * exceptions: GSL_EDOM, GSL_EOVRFLW */ int gsl_sf_poch_e(const double a, const double x, gsl_sf_result * result); double gsl_sf_poch(const double a, const double x); /* Relative Pochhammer (Apell) symbol * ((a,x) - 1)/x * where (a,x) = (a)_x := Gamma[a + x]/Gamma[a] * * exceptions: GSL_EDOM */ int gsl_sf_pochrel_e(const double a, const double x, gsl_sf_result * result); double gsl_sf_pochrel(const double a, const double x); /* Normalized Incomplete Gamma Function * * Q(a,x) = 1/Gamma(a) Integral[ t^(a-1) e^(-t), {t,x,Infinity} ] * * a >= 0, x >= 0 * Q(a,0) := 1 * Q(0,x) := 0, x != 0 * * exceptions: GSL_EDOM */ int gsl_sf_gamma_inc_Q_e(const double a, const double x, gsl_sf_result * result); double gsl_sf_gamma_inc_Q(const double a, const double x); /* Complementary Normalized Incomplete Gamma Function * * P(a,x) = 1/Gamma(a) Integral[ t^(a-1) e^(-t), {t,0,x} ] * * a > 0, x >= 0 * * exceptions: GSL_EDOM */ int gsl_sf_gamma_inc_P_e(const double a, const double x, gsl_sf_result * result); double gsl_sf_gamma_inc_P(const double a, const double x); /* Non-normalized Incomplete Gamma Function * * Gamma(a,x) := Integral[ t^(a-1) e^(-t), {t,x,Infinity} ] * * x >= 0.0 * Gamma(a, 0) := Gamma(a) * * exceptions: GSL_EDOM */ int gsl_sf_gamma_inc_e(const double a, const double x, gsl_sf_result * result); double gsl_sf_gamma_inc(const double a, const double x); /* Logarithm of Beta Function * Log[B(a,b)] * * a > 0, b > 0 * exceptions: GSL_EDOM */ int gsl_sf_lnbeta_e(const double a, const double b, gsl_sf_result * result); double gsl_sf_lnbeta(const double a, const double b); /* Beta Function * B(a,b) * * a > 0, b > 0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_beta_e(const double a, const double b, gsl_sf_result * result); double gsl_sf_beta(const double a, const double b); /* Normalized Incomplete Beta Function * B_x(a,b)/B(a,b) * * a > 0, b > 0, 0 <= x <= 1 * exceptions: GSL_EDOM, GSL_EUNDRFLW */ int gsl_sf_beta_inc_e(const double a, const double b, const double x, gsl_sf_result * result); double gsl_sf_beta_inc(const double a, const double b, const double x); /* The maximum x such that gamma(x) is not * considered an overflow. */ #define GSL_SF_GAMMA_XMAX 171.0 __END_DECLS #endif /* __GSL_SF_GAMMA_H__ */ bogofilter-1.2.4/gsl/gsl_precision.h0000644000175000017500000000333712163572264015652 0ustar sezsez/* gsl_precision.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: B. Gough and G. Jungman */ #ifndef __GSL_PRECISION_H__ #define __GSL_PRECISION_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* A type for the precision indicator. * This is mainly for pedagogy. */ typedef unsigned int gsl_prec_t; /* The number of precision types. * Remember that precision-mode * can index an array. */ #define _GSL_PREC_T_NUM 3 /* Arrays containing derived * precision constants for the * different precision levels. */ GSL_VAR const double gsl_prec_eps[]; GSL_VAR const double gsl_prec_sqrt_eps[]; GSL_VAR const double gsl_prec_root3_eps[]; GSL_VAR const double gsl_prec_root4_eps[]; GSL_VAR const double gsl_prec_root5_eps[]; GSL_VAR const double gsl_prec_root6_eps[]; __END_DECLS #endif /* __GSL_PRECISION_H__ */ bogofilter-1.2.4/gsl/specfunc/0000755000175000017500000000000012163572265014442 5ustar sezsezbogofilter-1.2.4/gsl/specfunc/exp.c0000644000175000017500000003673612163572265015421 0ustar sezsez/* specfunc/exp.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include #include "error.h" /* Evaluate the continued fraction for exprel. * [Abramowitz+Stegun, 4.2.41] */ static int exprel_n_CF(const int N, const double x, gsl_sf_result * result) { const double RECUR_BIG = GSL_SQRT_DBL_MAX; const int maxiter = 5000; int n = 1; double Anm2 = 1.0; double Bnm2 = 0.0; double Anm1 = 0.0; double Bnm1 = 1.0; double a1 = 1.0; double b1 = 1.0; double a2 = -x; double b2 = N+1; double an, bn; double fn; double An = b1*Anm1 + a1*Anm2; /* A1 */ double Bn = b1*Bnm1 + a1*Bnm2; /* B1 */ /* One explicit step, before we get to the main pattern. */ n++; Anm2 = Anm1; Bnm2 = Bnm1; Anm1 = An; Bnm1 = Bn; An = b2*Anm1 + a2*Anm2; /* A2 */ Bn = b2*Bnm1 + a2*Bnm2; /* B2 */ fn = An/Bn; while(n < maxiter) { double old_fn; double del; n++; Anm2 = Anm1; Bnm2 = Bnm1; Anm1 = An; Bnm1 = Bn; an = ( GSL_IS_ODD(n) ? ((n-1)/2)*x : -(N+(n/2)-1)*x ); bn = N + n - 1; An = bn*Anm1 + an*Anm2; Bn = bn*Bnm1 + an*Bnm2; if(fabs(An) > RECUR_BIG || fabs(Bn) > RECUR_BIG) { An /= RECUR_BIG; Bn /= RECUR_BIG; Anm1 /= RECUR_BIG; Bnm1 /= RECUR_BIG; Anm2 /= RECUR_BIG; Bnm2 /= RECUR_BIG; } old_fn = fn; fn = An/Bn; del = old_fn/fn; if(fabs(del - 1.0) < 2.0*GSL_DBL_EPSILON) break; } result->val = fn; result->err = 2.0*(n+1.0)*GSL_DBL_EPSILON*fabs(fn); if(n == maxiter) GSL_ERROR ("error", GSL_EMAXITER); else return GSL_SUCCESS; } /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ #ifndef HIDE_INLINE_STATIC int gsl_sf_exp_e(const double x, gsl_sf_result * result) { if(x > GSL_LOG_DBL_MAX) { OVERFLOW_ERROR(result); } else if(x < GSL_LOG_DBL_MIN) { UNDERFLOW_ERROR(result); } else { result->val = exp(x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } #endif int gsl_sf_exp_e10_e(const double x, gsl_sf_result_e10 * result) { if(x > INT_MAX-1) { OVERFLOW_ERROR_E10(result); } else if(x < INT_MIN+1) { UNDERFLOW_ERROR_E10(result); } else { const int N = (int) floor(x/M_LN10); result->val = exp(x-N*M_LN10); result->err = 2.0 * (fabs(x)+1.0) * GSL_DBL_EPSILON * fabs(result->val); result->e10 = N; return GSL_SUCCESS; } } int gsl_sf_exp_mult_e(const double x, const double y, gsl_sf_result * result) { const double ay = fabs(y); if(y == 0.0) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if( ( x < 0.5*GSL_LOG_DBL_MAX && x > 0.5*GSL_LOG_DBL_MIN) && (ay < 0.8*GSL_SQRT_DBL_MAX && ay > 1.2*GSL_SQRT_DBL_MIN) ) { const double ex = exp(x); result->val = y * ex; result->err = (2.0 + fabs(x)) * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { const double ly = log(ay); const double lnr = x + ly; if(lnr > GSL_LOG_DBL_MAX - 0.01) { OVERFLOW_ERROR(result); } else if(lnr < GSL_LOG_DBL_MIN + 0.01) { UNDERFLOW_ERROR(result); } else { const double sy = GSL_SIGN(y); const double M = floor(x); const double N = floor(ly); const double a = x - M; const double b = ly - N; const double berr = 2.0 * GSL_DBL_EPSILON * (fabs(ly) + fabs(N)); result->val = sy * exp(M+N) * exp(a+b); result->err = berr * fabs(result->val); result->err += 2.0 * GSL_DBL_EPSILON * (M + N + 1.0) * fabs(result->val); return GSL_SUCCESS; } } } int gsl_sf_exp_mult_e10_e(const double x, const double y, gsl_sf_result_e10 * result) { const double ay = fabs(y); if(y == 0.0) { result->val = 0.0; result->err = 0.0; result->e10 = 0; return GSL_SUCCESS; } else if( ( x < 0.5*GSL_LOG_DBL_MAX && x > 0.5*GSL_LOG_DBL_MIN) && (ay < 0.8*GSL_SQRT_DBL_MAX && ay > 1.2*GSL_SQRT_DBL_MIN) ) { const double ex = exp(x); result->val = y * ex; result->err = (2.0 + fabs(x)) * GSL_DBL_EPSILON * fabs(result->val); result->e10 = 0; return GSL_SUCCESS; } else { const double ly = log(ay); const double l10_val = (x + ly)/M_LN10; if(l10_val > INT_MAX-1) { OVERFLOW_ERROR_E10(result); } else if(l10_val < INT_MIN+1) { UNDERFLOW_ERROR_E10(result); } else { const double sy = GSL_SIGN(y); const int N = (int) floor(l10_val); const double arg_val = (l10_val - N) * M_LN10; const double arg_err = 2.0 * GSL_DBL_EPSILON * fabs(ly); result->val = sy * exp(arg_val); result->err = arg_err * fabs(result->val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); result->e10 = N; return GSL_SUCCESS; } } } int gsl_sf_exp_mult_err_e(const double x, const double dx, const double y, const double dy, gsl_sf_result * result) { const double ay = fabs(y); if(y == 0.0) { result->val = 0.0; result->err = fabs(dy * exp(x)); return GSL_SUCCESS; } else if( ( x < 0.5*GSL_LOG_DBL_MAX && x > 0.5*GSL_LOG_DBL_MIN) && (ay < 0.8*GSL_SQRT_DBL_MAX && ay > 1.2*GSL_SQRT_DBL_MIN) ) { double ex = exp(x); result->val = y * ex; result->err = ex * (fabs(dy) + fabs(y*dx)); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { const double ly = log(ay); const double lnr = x + ly; if(lnr > GSL_LOG_DBL_MAX - 0.01) { OVERFLOW_ERROR(result); } else if(lnr < GSL_LOG_DBL_MIN + 0.01) { UNDERFLOW_ERROR(result); } else { const double sy = GSL_SIGN(y); const double M = floor(x); const double N = floor(ly); const double a = x - M; const double b = ly - N; const double eMN = exp(M+N); const double eab = exp(a+b); result->val = sy * eMN * eab; result->err = eMN * eab * 2.0*GSL_DBL_EPSILON; result->err += eMN * eab * fabs(dy/y); result->err += eMN * eab * fabs(dx); return GSL_SUCCESS; } } } int gsl_sf_exp_mult_err_e10_e(const double x, const double dx, const double y, const double dy, gsl_sf_result_e10 * result) { const double ay = fabs(y); if(y == 0.0) { result->val = 0.0; result->err = fabs(dy * exp(x)); result->e10 = 0; return GSL_SUCCESS; } else if( ( x < 0.5*GSL_LOG_DBL_MAX && x > 0.5*GSL_LOG_DBL_MIN) && (ay < 0.8*GSL_SQRT_DBL_MAX && ay > 1.2*GSL_SQRT_DBL_MIN) ) { const double ex = exp(x); result->val = y * ex; result->err = ex * (fabs(dy) + fabs(y*dx)); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); result->e10 = 0; return GSL_SUCCESS; } else { const double ly = log(ay); const double l10_val = (x + ly)/M_LN10; if(l10_val > INT_MAX-1) { OVERFLOW_ERROR_E10(result); } else if(l10_val < INT_MIN+1) { UNDERFLOW_ERROR_E10(result); } else { const double sy = GSL_SIGN(y); const int N = (int) floor(l10_val); const double arg_val = (l10_val - N) * M_LN10; const double arg_err = dy/fabs(y) + dx + 2.0*GSL_DBL_EPSILON*fabs(arg_val); result->val = sy * exp(arg_val); result->err = arg_err * fabs(result->val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); result->e10 = N; return GSL_SUCCESS; } } } int gsl_sf_expm1_e(const double x, gsl_sf_result * result) { const double cut = 0.002; if(x < GSL_LOG_DBL_MIN) { result->val = -1.0; result->err = GSL_DBL_EPSILON; return GSL_SUCCESS; } else if(x < -cut) { result->val = exp(x) - 1.0; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < cut) { result->val = x * (1.0 + 0.5*x*(1.0 + x/3.0*(1.0 + 0.25*x*(1.0 + 0.2*x)))); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < GSL_LOG_DBL_MAX) { result->val = exp(x) - 1.0; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR(result); } } int gsl_sf_exprel_e(const double x, gsl_sf_result * result) { const double cut = 0.002; if(x < GSL_LOG_DBL_MIN) { result->val = -1.0/x; result->err = GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < -cut) { result->val = (exp(x) - 1.0)/x; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < cut) { result->val = (1.0 + 0.5*x*(1.0 + x/3.0*(1.0 + 0.25*x*(1.0 + 0.2*x)))); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < GSL_LOG_DBL_MAX) { result->val = (exp(x) - 1.0)/x; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR(result); } } int gsl_sf_exprel_2_e(double x, gsl_sf_result * result) { const double cut = 0.002; if(x < GSL_LOG_DBL_MIN) { result->val = -2.0/x*(1.0 + 1.0/x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < -cut) { result->val = 2.0*(exp(x) - 1.0 - x)/(x*x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < cut) { result->val = (1.0 + 1.0/3.0*x*(1.0 + 0.25*x*(1.0 + 0.2*x*(1.0 + 1.0/6.0*x)))); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < GSL_LOG_DBL_MAX) { result->val = 2.0*(exp(x) - 1.0 - x)/(x*x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR(result); } } int gsl_sf_exprel_n_e(const int N, const double x, gsl_sf_result * result) { if(N < 0) { DOMAIN_ERROR(result); } else if(x == 0.0) { result->val = 1.0; result->err = 0.0; return GSL_SUCCESS; } else if(fabs(x) < GSL_ROOT3_DBL_EPSILON * N) { result->val = 1.0 + x/(N+1) * (1.0 + x/(N+2)); result->err = 2.0 * GSL_DBL_EPSILON; return GSL_SUCCESS; } else if(N == 0) { return gsl_sf_exp_e(x, result); } else if(N == 1) { return gsl_sf_exprel_e(x, result); } else if(N == 2) { return gsl_sf_exprel_2_e(x, result); } else { if(x > N && (-x + N*(1.0 + log(x/N)) < GSL_LOG_DBL_EPSILON)) { /* x is much larger than n. * Ignore polynomial part, so * exprel_N(x) ~= e^x N!/x^N */ gsl_sf_result lnf_N; double lnr_val; double lnr_err; double lnterm; gsl_sf_lnfact_e(N, &lnf_N); lnterm = N*log(x); lnr_val = x + lnf_N.val - lnterm; lnr_err = GSL_DBL_EPSILON * (fabs(x) + fabs(lnf_N.val) + fabs(lnterm)); lnr_err += lnf_N.err; return gsl_sf_exp_err_e(lnr_val, lnr_err, result); } else if(x > N) { /* Write the identity * exprel_n(x) = e^x n! / x^n (1 - Gamma[n,x]/Gamma[n]) * then use the asymptotic expansion * Gamma[n,x] ~ x^(n-1) e^(-x) (1 + (n-1)/x + (n-1)(n-2)/x^2 + ...) */ double ln_x = log(x); gsl_sf_result lnf_N; double lg_N; double lnpre_val; double lnpre_err; gsl_sf_lnfact_e(N, &lnf_N); /* log(N!) */ lg_N = lnf_N.val - log(N); /* log(Gamma(N)) */ lnpre_val = x + lnf_N.val - N*ln_x; lnpre_err = GSL_DBL_EPSILON * (fabs(x) + fabs(lnf_N.val) + fabs(N*ln_x)); lnpre_err += lnf_N.err; if(lnpre_val < GSL_LOG_DBL_MAX - 5.0) { int stat_eG; gsl_sf_result bigG_ratio; gsl_sf_result pre; int stat_ex = gsl_sf_exp_err_e(lnpre_val, lnpre_err, &pre); double ln_bigG_ratio_pre = -x + (N-1)*ln_x - lg_N; double bigGsum = 1.0; double term = 1.0; int k; for(k=1; kval = pre.val * (1.0 - bigG_ratio.val); result->err = pre.val * (2.0*GSL_DBL_EPSILON + bigG_ratio.err); result->err += pre.err * fabs(1.0 - bigG_ratio.val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_ex; } else { result->val = 0.0; result->err = 0.0; return stat_eG; } } else { OVERFLOW_ERROR(result); } } else if(x > -10.0*N) { return exprel_n_CF(N, x, result); } else { /* x -> -Inf asymptotic: * exprel_n(x) ~ e^x n!/x^n - n/x (1 + (n-1)/x + (n-1)(n-2)/x + ...) * ~ - n/x (1 + (n-1)/x + (n-1)(n-2)/x + ...) */ double sum = 1.0; double term = 1.0; int k; for(k=1; kval = -N/x * sum; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } } int gsl_sf_exp_err_e(const double x, const double dx, gsl_sf_result * result) { const double adx = fabs(dx); /* CHECK_POINTER(result) */ if(x + adx > GSL_LOG_DBL_MAX) { OVERFLOW_ERROR(result); } else if(x - adx < GSL_LOG_DBL_MIN) { UNDERFLOW_ERROR(result); } else { const double ex = exp(x); const double edx = exp(adx); result->val = ex; result->err = ex * GSL_MAX_DBL(GSL_DBL_EPSILON, edx - 1.0/edx); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_exp_err_e10_e(const double x, const double dx, gsl_sf_result_e10 * result) { const double adx = fabs(dx); /* CHECK_POINTER(result) */ if(x + adx > INT_MAX - 1) { OVERFLOW_ERROR_E10(result); } else if(x - adx < INT_MIN + 1) { UNDERFLOW_ERROR_E10(result); } else { const int N = (int)floor(x/M_LN10); const double ex = exp(x-N*M_LN10); result->val = ex; result->err = ex * (2.0 * GSL_DBL_EPSILON * (fabs(x) + 1.0) + adx); result->e10 = N; return GSL_SUCCESS; } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_exp(const double x) { EVAL_RESULT(gsl_sf_exp_e(x, &result)); } double gsl_sf_exp_mult(const double x, const double y) { EVAL_RESULT(gsl_sf_exp_mult_e(x, y, &result)); } double gsl_sf_expm1(const double x) { EVAL_RESULT(gsl_sf_expm1_e(x, &result)); } double gsl_sf_exprel(const double x) { EVAL_RESULT(gsl_sf_exprel_e(x, &result)); } double gsl_sf_exprel_2(const double x) { EVAL_RESULT(gsl_sf_exprel_2_e(x, &result)); } double gsl_sf_exprel_n(const int n, const double x) { EVAL_RESULT(gsl_sf_exprel_n_e(n, x, &result)); } bogofilter-1.2.4/gsl/specfunc/cheb_eval.c0000644000175000017500000000122012163572265016511 0ustar sezsez static inline int cheb_eval_e(const cheb_series * cs, const double x, gsl_sf_result * result) { int j; double d = 0.0; double dd = 0.0; double y = (2.0*x - cs->a - cs->b) / (cs->b - cs->a); double y2 = 2.0 * y; double e = 0.0; for(j = cs->order; j>=1; j--) { double temp = d; d = y2*d - dd + cs->c[j]; e += fabs(y2*temp) + fabs(dd) + fabs(cs->c[j]); dd = temp; } { double temp = d; d = y*d - dd + 0.5 * cs->c[0]; e += fabs(y*temp) + fabs(dd) + 0.5 * fabs(cs->c[0]); } result->val = d; result->err = GSL_DBL_EPSILON * e + fabs(cs->c[cs->order]); return GSL_SUCCESS; } bogofilter-1.2.4/gsl/specfunc/erfc.c0000644000175000017500000002765712163572265015546 0ustar sezsez/* specfunc/erfc.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: J. Theiler (modifications by G. Jungman) */ /* * See Hart et al, Computer Approximations, John Wiley and Sons, New York (1968) * (This applies only to the erfc8 stuff, which is the part * of the original code that survives. I have replaced much of * the other stuff with Chebyshev fits. These are simpler and * more precise than the original approximations. [GJ]) */ #include #include #include #include #include #include "check.h" #include "chebyshev.h" #include "cheb_eval.c" #define LogRootPi_ 0.57236494292470008706 static double erfc8_sum(double x) { /* estimates erfc(x) valid for 8 < x < 100 */ /* This is based on index 5725 in Hart et al */ static double P[] = { 2.97886562639399288862, 7.409740605964741794425, 6.1602098531096305440906, 5.019049726784267463450058, 1.275366644729965952479585264, 0.5641895835477550741253201704 }; static double Q[] = { 3.3690752069827527677, 9.608965327192787870698, 17.08144074746600431571095, 12.0489519278551290360340491, 9.396034016235054150430579648, 2.260528520767326969591866945, 1.0 }; double num=0.0, den=0.0; int i; num = P[5]; for (i=4; i>=0; --i) { num = x*num + P[i]; } den = Q[6]; for (i=5; i>=0; --i) { den = x*den + Q[i]; } return num/den; } inline static double erfc8(double x) { double e; e = erfc8_sum(x); e *= exp(-x*x); return e; } inline static double log_erfc8(double x) { double e; e = erfc8_sum(x); e = log(e) - x*x; return e; } #if 0 /* Abramowitz+Stegun, 7.2.14 */ static double erfcasympsum(double x) { int i; double e = 1.; double coef = 1.; for (i=1; i<5; ++i) { /* coef *= -(2*i-1)/(2*x*x); ??? [GJ] */ coef *= -(2*i+1)/(i*(4*x*x*x*x)); e += coef; /* if (fabs(coef) < 1.0e-15) break; if (fabs(coef) > 1.0e10) break; [GJ]: These tests are not useful. This function is only used below. Took them out; they gum up the pipeline. */ } return e; } #endif /* 0 */ /* Abramowitz+Stegun, 7.1.5 */ static int erfseries(double x, gsl_sf_result * result) { double coef = x; double e = coef; double del; int k; for (k=1; k<30; ++k) { coef *= -x*x/k; del = coef/(2.0*k+1.0); e += del; } result->val = 2.0 / M_SQRTPI * e; result->err = 2.0 / M_SQRTPI * (fabs(del) + GSL_DBL_EPSILON); return GSL_SUCCESS; } /* Chebyshev fit for erfc((t+1)/2), -1 < t < 1 */ static double erfc_xlt1_data[20] = { 1.06073416421769980345174155056, -0.42582445804381043569204735291, 0.04955262679620434040357683080, 0.00449293488768382749558001242, -0.00129194104658496953494224761, -0.00001836389292149396270416979, 0.00002211114704099526291538556, -5.23337485234257134673693179020e-7, -2.78184788833537885382530989578e-7, 1.41158092748813114560316684249e-8, 2.72571296330561699984539141865e-9, -2.06343904872070629406401492476e-10, -2.14273991996785367924201401812e-11, 2.22990255539358204580285098119e-12, 1.36250074650698280575807934155e-13, -1.95144010922293091898995913038e-14, -6.85627169231704599442806370690e-16, 1.44506492869699938239521607493e-16, 2.45935306460536488037576200030e-18, -9.29599561220523396007359328540e-19 }; static cheb_series erfc_xlt1_cs = { erfc_xlt1_data, 19, -1, 1, 12 }; /* Chebyshev fit for erfc(x) exp(x^2), 1 < x < 5, x = 2t + 3, -1 < t < 1 */ static double erfc_x15_data[25] = { 0.44045832024338111077637466616, -0.143958836762168335790826895326, 0.044786499817939267247056666937, -0.013343124200271211203618353102, 0.003824682739750469767692372556, -0.001058699227195126547306482530, 0.000283859419210073742736310108, -0.000073906170662206760483959432, 0.000018725312521489179015872934, -4.62530981164919445131297264430e-6, 1.11558657244432857487884006422e-6, -2.63098662650834130067808832725e-7, 6.07462122724551777372119408710e-8, -1.37460865539865444777251011793e-8, 3.05157051905475145520096717210e-9, -6.65174789720310713757307724790e-10, 1.42483346273207784489792999706e-10, -3.00141127395323902092018744545e-11, 6.22171792645348091472914001250e-12, -1.26994639225668496876152836555e-12, 2.55385883033257575402681845385e-13, -5.06258237507038698392265499770e-14, 9.89705409478327321641264227110e-15, -1.90685978789192181051961024995e-15, 3.50826648032737849245113757340e-16 }; static cheb_series erfc_x15_cs = { erfc_x15_data, 24, -1, 1, 16 }; /* Chebyshev fit for erfc(x) x exp(x^2), 5 < x < 10, x = (5t + 15)/2, -1 < t < 1 */ static double erfc_x510_data[20] = { 1.11684990123545698684297865808, 0.003736240359381998520654927536, -0.000916623948045470238763619870, 0.000199094325044940833965078819, -0.000040276384918650072591781859, 7.76515264697061049477127605790e-6, -1.44464794206689070402099225301e-6, 2.61311930343463958393485241947e-7, -4.61833026634844152345304095560e-8, 8.00253111512943601598732144340e-9, -1.36291114862793031395712122089e-9, 2.28570483090160869607683087722e-10, -3.78022521563251805044056974560e-11, 6.17253683874528285729910462130e-12, -9.96019290955316888445830597430e-13, 1.58953143706980770269506726000e-13, -2.51045971047162509999527428316e-14, 3.92607828989125810013581287560e-15, -6.07970619384160374392535453420e-16, 9.12600607264794717315507477670e-17 }; static cheb_series erfc_x510_cs = { erfc_x510_data, 19, -1, 1, 12 }; #if 0 inline static double erfc_asymptotic(double x) { return exp(-x*x)/x * erfcasympsum(x) / M_SQRTPI; } inline static double log_erfc_asymptotic(double x) { return log(erfcasympsum(x)/x) - x*x - LogRootPi_; } #endif /* 0 */ /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ int gsl_sf_erfc_e(double x, gsl_sf_result * result) { const double ax = fabs(x); double e_val, e_err; /* CHECK_POINTER(result) */ if(ax <= 1.0) { double t = 2.0*ax - 1.0; gsl_sf_result c; cheb_eval_e(&erfc_xlt1_cs, t, &c); e_val = c.val; e_err = c.err; } else if(ax <= 5.0) { double ex2 = exp(-x*x); double t = 0.5*(ax-3.0); gsl_sf_result c; cheb_eval_e(&erfc_x15_cs, t, &c); e_val = ex2 * c.val; e_err = ex2 * (c.err + 2.0*fabs(x)*GSL_DBL_EPSILON); } else if(ax < 10.0) { double exterm = exp(-x*x) / ax; double t = (2.0*ax - 15.0)/5.0; gsl_sf_result c; cheb_eval_e(&erfc_x510_cs, t, &c); e_val = exterm * c.val; e_err = exterm * (c.err + 2.0*fabs(x)*GSL_DBL_EPSILON + GSL_DBL_EPSILON); } else { e_val = erfc8(ax); e_err = (x*x + 1.0) * GSL_DBL_EPSILON * fabs(e_val); } if(x < 0.0) { result->val = 2.0 - e_val; result->err = e_err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); } else { result->val = e_val; result->err = e_err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); } return GSL_SUCCESS; } int gsl_sf_log_erfc_e(double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x*x < 10.0*GSL_ROOT6_DBL_EPSILON) { const double y = x / M_SQRTPI; /* series for -1/2 Log[Erfc[Sqrt[Pi] y]] */ const double c3 = (4.0 - M_PI)/3.0; const double c4 = 2.0*(1.0 - M_PI/3.0); const double c5 = -0.001829764677455021; /* (96.0 - 40.0*M_PI + 3.0*M_PI*M_PI)/30.0 */ const double c6 = 0.02629651521057465; /* 2.0*(120.0 - 60.0*M_PI + 7.0*M_PI*M_PI)/45.0 */ const double c7 = -0.01621575378835404; const double c8 = 0.00125993961762116; const double c9 = 0.00556964649138; const double c10 = -0.0045563339802; const double c11 = 0.0009461589032; const double c12 = 0.0013200243174; const double c13 = -0.00142906; const double c14 = 0.00048204; double series = c8 + y*(c9 + y*(c10 + y*(c11 + y*(c12 + y*(c13 + c14*y))))); series = y*(1.0 + y*(1.0 + y*(c3 + y*(c4 + y*(c5 + y*(c6 + y*(c7 + y*series))))))); result->val = -2.0 * series; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } /* don't like use of log1p(); added above series stuff for small x instead, should be ok [GJ] else if (fabs(x) < 1.0) { gsl_sf_result result_erf; gsl_sf_erf_e(x, &result_erf); result->val = log1p(-result_erf.val); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } */ else if(x > 8.0) { result->val = log_erfc8(x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { gsl_sf_result result_erfc; gsl_sf_erfc_e(x, &result_erfc); result->val = log(result_erfc.val); result->err = fabs(result_erfc.err / result_erfc.val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_erf_e(double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(fabs(x) < 1.0) { return erfseries(x, result); } else { gsl_sf_result result_erfc; gsl_sf_erfc_e(x, &result_erfc); result->val = 1.0 - result_erfc.val; result->err = result_erfc.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_erf_Z_e(double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ { const double ex2 = exp(-x*x/2.0); result->val = ex2 / (M_SQRT2 * M_SQRTPI); result->err = fabs(x * result->val) * GSL_DBL_EPSILON; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); CHECK_UNDERFLOW(result); return GSL_SUCCESS; } } int gsl_sf_erf_Q_e(double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ { gsl_sf_result result_erfc; int stat = gsl_sf_erfc_e(x/M_SQRT2, &result_erfc); result->val = 0.5 * result_erfc.val; result->err = 0.5 * result_erfc.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat; } } int gsl_sf_hazard_e(double x, gsl_sf_result * result) { if(x < 25.0) { gsl_sf_result result_ln_erfc; const int stat_l = gsl_sf_log_erfc_e(x/M_SQRT2, &result_ln_erfc); const double lnc = -0.22579135264472743236; /* ln(sqrt(2/pi)) */ const double arg = lnc - 0.5*x*x - result_ln_erfc.val; const int stat_e = gsl_sf_exp_e(arg, result); result->err += 3.0 * (1.0 + fabs(x)) * GSL_DBL_EPSILON * fabs(result->val); result->err += fabs(result_ln_erfc.err * result->val); return GSL_ERROR_SELECT_2(stat_l, stat_e); } else { const double ix2 = 1.0/(x*x); const double corrB = 1.0 - 9.0*ix2 * (1.0 - 11.0*ix2); const double corrM = 1.0 - 5.0*ix2 * (1.0 - 7.0*ix2 * corrB); const double corrT = 1.0 - ix2 * (1.0 - 3.0*ix2*corrM); result->val = x / corrT; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_erfc(double x) { EVAL_RESULT(gsl_sf_erfc_e(x, &result)); } double gsl_sf_log_erfc(double x) { EVAL_RESULT(gsl_sf_log_erfc_e(x, &result)); } double gsl_sf_erf(double x) { EVAL_RESULT(gsl_sf_erf_e(x, &result)); } double gsl_sf_erf_Z(double x) { EVAL_RESULT(gsl_sf_erf_Z_e(x, &result)); } double gsl_sf_erf_Q(double x) { EVAL_RESULT(gsl_sf_erf_Q_e(x, &result)); } double gsl_sf_hazard(double x) { EVAL_RESULT(gsl_sf_hazard_e(x, &result)); } bogofilter-1.2.4/gsl/specfunc/error.h0000644000175000017500000000343512163572265015751 0ustar sezsez#define OVERFLOW_ERROR(result) do { (result)->val = GSL_POSINF; (result)->err = GSL_POSINF; GSL_ERROR ("overflow", GSL_EOVRFLW); } while(0) #define UNDERFLOW_ERROR(result) do { (result)->val = 0.0; (result)->err = GSL_DBL_MIN; GSL_ERROR ("underflow", GSL_EUNDRFLW); } while(0) #define INTERNAL_OVERFLOW_ERROR(result) do { (result)->val = GSL_POSINF; (result)->err = GSL_POSINF; return GSL_EOVRFLW; } while(0) #define INTERNAL_UNDERFLOW_ERROR(result) do { (result)->val = 0.0; (result)->err = GSL_DBL_MIN; return GSL_EUNDRFLW; } while(0) #define DOMAIN_ERROR(result) do { (result)->val = GSL_NAN; (result)->err = GSL_NAN; GSL_ERROR ("domain error", GSL_EDOM); } while(0) #define DOMAIN_ERROR_MSG(msg, result) do { (result)->val = GSL_NAN; (result)->err = GSL_NAN; GSL_ERROR ((msg), GSL_EDOM); } while(0) #define DOMAIN_ERROR_E10(result) do { (result)->val = GSL_NAN; (result)->err = GSL_NAN; (result)->e10 = 0 ; GSL_ERROR ("domain error", GSL_EDOM); } while(0) #define OVERFLOW_ERROR_E10(result) do { (result)->val = GSL_POSINF; (result)->err = GSL_POSINF; (result)->e10 = 0; GSL_ERROR ("overflow", GSL_EOVRFLW); } while(0) #define UNDERFLOW_ERROR_E10(result) do { (result)->val = 0.0; (result)->err = GSL_DBL_MIN; (result)->e10 = 0; GSL_ERROR ("underflow", GSL_EUNDRFLW); } while(0) #define OVERFLOW_ERROR_2(r1,r2) do { (r1)->val = GSL_POSINF; (r1)->err = GSL_POSINF; (r2)->val = GSL_POSINF ; (r2)->err=GSL_POSINF; GSL_ERROR ("overflow", GSL_EOVRFLW); } while(0) #define UNDERFLOW_ERROR_2(r1,r2) do { (r1)->val = 0.0; (r1)->err = GSL_DBL_MIN; (r2)->val = 0.0 ; (r2)->err = GSL_DBL_MIN; GSL_ERROR ("underflow", GSL_EUNDRFLW); } while(0) #define DOMAIN_ERROR_2(r1,r2) do { (r1)->val = GSL_NAN; (r1)->err = GSL_NAN; (r2)->val = GSL_NAN; (r2)->err = GSL_NAN; GSL_ERROR ("domain error", GSL_EDOM); } while(0) bogofilter-1.2.4/gsl/specfunc/expint.c0000644000175000017500000003275412163572265016130 0ustar sezsez/* specfunc/expint.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include "error.h" #include "chebyshev.h" #include "cheb_eval.c" /*-*-*-*-*-*-*-*-*-*-*-* Private Section *-*-*-*-*-*-*-*-*-*-*-*/ /* Chebyshev expansions: based on SLATEC e1.f, W. Fullerton Series for AE11 on the interval -1.00000D-01 to 0. with weighted error 1.76E-17 log weighted error 16.75 significant figures required 15.70 decimal places required 17.55 Series for AE12 on the interval -2.50000D-01 to -1.00000D-01 with weighted error 5.83E-17 log weighted error 16.23 significant figures required 15.76 decimal places required 16.93 Series for E11 on the interval -4.00000D+00 to -1.00000D+00 with weighted error 1.08E-18 log weighted error 17.97 significant figures required 19.02 decimal places required 18.61 Series for E12 on the interval -1.00000D+00 to 1.00000D+00 with weighted error 3.15E-18 log weighted error 17.50 approx significant figures required 15.8 decimal places required 18.10 Series for AE13 on the interval 2.50000D-01 to 1.00000D+00 with weighted error 2.34E-17 log weighted error 16.63 significant figures required 16.14 decimal places required 17.33 Series for AE14 on the interval 0. to 2.50000D-01 with weighted error 5.41E-17 log weighted error 16.27 significant figures required 15.38 decimal places required 16.97 */ static double AE11_data[39] = { 0.121503239716065790, -0.065088778513550150, 0.004897651357459670, -0.000649237843027216, 0.000093840434587471, 0.000000420236380882, -0.000008113374735904, 0.000002804247688663, 0.000000056487164441, -0.000000344809174450, 0.000000058209273578, 0.000000038711426349, -0.000000012453235014, -0.000000005118504888, 0.000000002148771527, 0.000000000868459898, -0.000000000343650105, -0.000000000179796603, 0.000000000047442060, 0.000000000040423282, -0.000000000003543928, -0.000000000008853444, -0.000000000000960151, 0.000000000001692921, 0.000000000000607990, -0.000000000000224338, -0.000000000000200327, -0.000000000000006246, 0.000000000000045571, 0.000000000000016383, -0.000000000000005561, -0.000000000000006074, -0.000000000000000862, 0.000000000000001223, 0.000000000000000716, -0.000000000000000024, -0.000000000000000201, -0.000000000000000082, 0.000000000000000017 }; static cheb_series AE11_cs = { AE11_data, 38, -1, 1, 20 }; static double AE12_data[25] = { 0.582417495134726740, -0.158348850905782750, -0.006764275590323141, 0.005125843950185725, 0.000435232492169391, -0.000143613366305483, -0.000041801320556301, -0.000002713395758640, 0.000001151381913647, 0.000000420650022012, 0.000000066581901391, 0.000000000662143777, -0.000000002844104870, -0.000000000940724197, -0.000000000177476602, -0.000000000015830222, 0.000000000002905732, 0.000000000001769356, 0.000000000000492735, 0.000000000000093709, 0.000000000000010707, -0.000000000000000537, -0.000000000000000716, -0.000000000000000244, -0.000000000000000058 }; static cheb_series AE12_cs = { AE12_data, 24, -1, 1, 15 }; static double E11_data[19] = { -16.11346165557149402600, 7.79407277874268027690, -1.95540581886314195070, 0.37337293866277945612, -0.05692503191092901938, 0.00721107776966009185, -0.00078104901449841593, 0.00007388093356262168, -0.00000620286187580820, 0.00000046816002303176, -0.00000003209288853329, 0.00000000201519974874, -0.00000000011673686816, 0.00000000000627627066, -0.00000000000031481541, 0.00000000000001479904, -0.00000000000000065457, 0.00000000000000002733, -0.00000000000000000108 }; static cheb_series E11_cs = { E11_data, 18, -1, 1, 13 }; static double E12_data[16] = { -0.03739021479220279500, 0.04272398606220957700, -0.13031820798497005440, 0.01441912402469889073, -0.00134617078051068022, 0.00010731029253063780, -0.00000742999951611943, 0.00000045377325690753, -0.00000002476417211390, 0.00000000122076581374, -0.00000000005485141480, 0.00000000000226362142, -0.00000000000008635897, 0.00000000000000306291, -0.00000000000000010148, 0.00000000000000000315 }; static cheb_series E12_cs = { E12_data, 15, -1, 1, 10 }; static double AE13_data[25] = { -0.605773246640603460, -0.112535243483660900, 0.013432266247902779, -0.001926845187381145, 0.000309118337720603, -0.000053564132129618, 0.000009827812880247, -0.000001885368984916, 0.000000374943193568, -0.000000076823455870, 0.000000016143270567, -0.000000003466802211, 0.000000000758754209, -0.000000000168864333, 0.000000000038145706, -0.000000000008733026, 0.000000000002023672, -0.000000000000474132, 0.000000000000112211, -0.000000000000026804, 0.000000000000006457, -0.000000000000001568, 0.000000000000000383, -0.000000000000000094, 0.000000000000000023 }; static cheb_series AE13_cs = { AE13_data, 24, -1, 1, 15 }; static double AE14_data[26] = { -0.18929180007530170, -0.08648117855259871, 0.00722410154374659, -0.00080975594575573, 0.00010999134432661, -0.00001717332998937, 0.00000298562751447, -0.00000056596491457, 0.00000011526808397, -0.00000002495030440, 0.00000000569232420, -0.00000000135995766, 0.00000000033846628, -0.00000000008737853, 0.00000000002331588, -0.00000000000641148, 0.00000000000181224, -0.00000000000052538, 0.00000000000015592, -0.00000000000004729, 0.00000000000001463, -0.00000000000000461, 0.00000000000000148, -0.00000000000000048, 0.00000000000000016, -0.00000000000000005 }; static cheb_series AE14_cs = { AE14_data, 25, -1, 1, 13 }; /* implementation for E1, allowing for scaling by exp(x) */ static int expint_E1_impl(const double x, gsl_sf_result * result, const int scale) { const double xmaxt = -GSL_LOG_DBL_MIN; /* XMAXT = -LOG (R1MACH(1)) */ const double xmax = xmaxt - log(xmaxt); /* XMAX = XMAXT - LOG(XMAXT) */ /* CHECK_POINTER(result) */ if(x < -xmax && !scale) { OVERFLOW_ERROR(result); } else if(x <= -10.0) { const double s = 1.0/x * ( scale ? 1.0 : exp(-x) ); gsl_sf_result result_c; cheb_eval_e(&AE11_cs, 20.0/x+1.0, &result_c); result->val = s * (1.0 + result_c.val); result->err = s * result_c.err; result->err += 2.0 * GSL_DBL_EPSILON * (fabs(x) + 1.0) * fabs(result->val); return GSL_SUCCESS; } else if(x <= -4.0) { const double s = 1.0/x * ( scale ? 1.0 : exp(-x) ); gsl_sf_result result_c; cheb_eval_e(&AE12_cs, (40.0/x+7.0)/3.0, &result_c); result->val = s * (1.0 + result_c.val); result->err = s * result_c.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x <= -1.0) { const double ln_term = -log(fabs(x)); const double scale_factor = ( scale ? exp(x) : 1.0 ); gsl_sf_result result_c; cheb_eval_e(&E11_cs, (2.0*x+5.0)/3.0, &result_c); result->val = scale_factor * (ln_term + result_c.val); result->err = scale_factor * (result_c.err + GSL_DBL_EPSILON * fabs(ln_term)); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x == 0.0) { DOMAIN_ERROR(result); } else if(x <= 1.0) { const double ln_term = -log(fabs(x)); const double scale_factor = ( scale ? exp(x) : 1.0 ); gsl_sf_result result_c; cheb_eval_e(&E12_cs, x, &result_c); result->val = scale_factor * (ln_term - 0.6875 + x + result_c.val); result->err = scale_factor * (result_c.err + GSL_DBL_EPSILON * fabs(ln_term)); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x <= 4.0) { const double s = 1.0/x * ( scale ? 1.0 : exp(-x) ); gsl_sf_result result_c; cheb_eval_e(&AE13_cs, (8.0/x-5.0)/3.0, &result_c); result->val = s * (1.0 + result_c.val); result->err = s * result_c.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x <= xmax || scale) { const double s = 1.0/x * ( scale ? 1.0 : exp(-x) ); gsl_sf_result result_c; cheb_eval_e(&AE14_cs, 8.0/x-1.0, &result_c); result->val = s * (1.0 + result_c.val); result->err = s * (GSL_DBL_EPSILON + result_c.err); result->err += 2.0 * (x + 1.0) * GSL_DBL_EPSILON * fabs(result->val); if(result->val == 0.0) UNDERFLOW_ERROR(result); else return GSL_SUCCESS; } else { UNDERFLOW_ERROR(result); } } static int expint_E2_impl(const double x, gsl_sf_result * result, const int scale) { const double xmaxt = -GSL_LOG_DBL_MIN; const double xmax = xmaxt - log(xmaxt); /* CHECK_POINTER(result) */ if(x < -xmax && !scale) { OVERFLOW_ERROR(result); } else if(x < 100.0) { const double ex = ( scale ? 1.0 : exp(-x) ); gsl_sf_result result_E1; int stat_E1 = expint_E1_impl(x, &result_E1, scale); result->val = ex - x*result_E1.val; result->err = fabs(x) * (GSL_DBL_EPSILON*ex + result_E1.err); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_E1; } else if(x < xmax || scale) { const double s = ( scale ? 1.0 : exp(-x) ); const double c1 = -2.0; const double c2 = 6.0; const double c3 = -24.0; const double c4 = 120.0; const double c5 = -720.0; const double c6 = 5040.0; const double c7 = -40320.0; const double c8 = 362880.0; const double c9 = -3628800.0; const double c10 = 39916800.0; const double c11 = -479001600.0; const double c12 = 6227020800.0; const double c13 = -87178291200.0; const double y = 1.0/x; const double sum6 = c6+y*(c7+y*(c8+y*(c9+y*(c10+y*(c11+y*(c12+y*c13)))))); const double sum = y*(c1+y*(c2+y*(c3+y*(c4+y*(c5+y*sum6))))); result->val = s * (1.0 + sum)/x; result->err = 2.0 * (x + 1.0) * GSL_DBL_EPSILON * result->val; if(result->val == 0.0) UNDERFLOW_ERROR(result); else return GSL_SUCCESS; } else { UNDERFLOW_ERROR(result); } } /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ int gsl_sf_expint_E1_e(const double x, gsl_sf_result * result) { return expint_E1_impl(x, result, 0); } int gsl_sf_expint_E1_scaled_e(const double x, gsl_sf_result * result) { return expint_E1_impl(x, result, 1); } int gsl_sf_expint_E2_e(const double x, gsl_sf_result * result) { return expint_E2_impl(x, result, 0); } int gsl_sf_expint_E2_scaled_e(const double x, gsl_sf_result * result) { return expint_E2_impl(x, result, 1); } int gsl_sf_expint_Ei_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ { int status = gsl_sf_expint_E1_e(-x, result); result->val = -result->val; return status; } } int gsl_sf_expint_Ei_scaled_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ { int status = gsl_sf_expint_E1_scaled_e(-x, result); result->val = -result->val; return status; } } #if 0 static double recurse_En(int n, double x, double E1) { int i; double En = E1; double ex = exp(-x); for(i=2; i<=n; i++) { En = 1./(i-1) * (ex - x * En); } return En; } #endif /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_expint_E1(const double x) { EVAL_RESULT(gsl_sf_expint_E1_e(x, &result)); } double gsl_sf_expint_E1_scaled(const double x) { EVAL_RESULT(gsl_sf_expint_E1_scaled_e(x, &result)); } double gsl_sf_expint_E2(const double x) { EVAL_RESULT(gsl_sf_expint_E2_e(x, &result)); } double gsl_sf_expint_E2_scaled(const double x) { EVAL_RESULT(gsl_sf_expint_E2_scaled_e(x, &result)); } double gsl_sf_expint_Ei(const double x) { EVAL_RESULT(gsl_sf_expint_Ei_e(x, &result)); } double gsl_sf_expint_Ei_scaled(const double x) { EVAL_RESULT(gsl_sf_expint_Ei_e(x, &result)); } bogofilter-1.2.4/gsl/specfunc/zeta.c0000644000175000017500000006072212163572265015560 0ustar sezsez/* specfunc/zeta.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include #include #include #include #include "error.h" #include "chebyshev.h" #include "cheb_eval.c" #define LogTwoPi_ 1.8378770664093454835606594728111235279723 /*-*-*-*-*-*-*-*-*-*-*-* Private Section *-*-*-*-*-*-*-*-*-*-*-*/ /* chebyshev fit for (s(t)-1)Zeta[s(t)] * s(t)= (t+1)/2 * -1 <= t <= 1 */ static double zeta_xlt1_data[14] = { 1.48018677156931561235192914649, 0.25012062539889426471999938167, 0.00991137502135360774243761467, -0.00012084759656676410329833091, -4.7585866367662556504652535281e-06, 2.2229946694466391855561441361e-07, -2.2237496498030257121309056582e-09, -1.0173226513229028319420799028e-10, 4.3756643450424558284466248449e-12, -6.2229632593100551465504090814e-14, -6.6116201003272207115277520305e-16, 4.9477279533373912324518463830e-17, -1.0429819093456189719660003522e-18, 6.9925216166580021051464412040e-21, }; static cheb_series zeta_xlt1_cs = { zeta_xlt1_data, 13, -1, 1, 8 }; /* chebyshev fit for (s(t)-1)Zeta[s(t)] * s(t)= (19t+21)/2 * -1 <= t <= 1 */ static double zeta_xgt1_data[30] = { 19.3918515726724119415911269006, 9.1525329692510756181581271500, 0.2427897658867379985365270155, -0.1339000688262027338316641329, 0.0577827064065028595578410202, -0.0187625983754002298566409700, 0.0039403014258320354840823803, -0.0000581508273158127963598882, -0.0003756148907214820704594549, 0.0001892530548109214349092999, -0.0000549032199695513496115090, 8.7086484008939038610413331863e-6, 6.4609477924811889068410083425e-7, -9.6749773915059089205835337136e-7, 3.6585400766767257736982342461e-7, -8.4592516427275164351876072573e-8, 9.9956786144497936572288988883e-9, 1.4260036420951118112457144842e-9, -1.1761968823382879195380320948e-9, 3.7114575899785204664648987295e-10, -7.4756855194210961661210215325e-11, 7.8536934209183700456512982968e-12, 9.9827182259685539619810406271e-13, -7.5276687030192221587850302453e-13, 2.1955026393964279988917878654e-13, -4.1934859852834647427576319246e-14, 4.6341149635933550715779074274e-15, 2.3742488509048340106830309402e-16, -2.7276516388124786119323824391e-16, 7.8473570134636044722154797225e-17 }; static cheb_series zeta_xgt1_cs = { zeta_xgt1_data, 29, -1, 1, 17 }; /* assumes s >= 0 and s != 1.0 */ inline static int riemann_zeta_sgt0(double s, gsl_sf_result * result) { if(s < 1.0) { gsl_sf_result c; cheb_eval_e(&zeta_xlt1_cs, 2.0*s - 1.0, &c); result->val = c.val / (s - 1.0); result->err = c.err / fabs(s-1.0) + GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(s <= 20.0) { double x = (2.0*s - 21.0)/19.0; gsl_sf_result c; cheb_eval_e(&zeta_xgt1_cs, x, &c); result->val = c.val / (s - 1.0); result->err = c.err / (s - 1.0) + GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { double f2 = 1.0 - pow(2.0,-s); double f3 = 1.0 - pow(3.0,-s); double f5 = 1.0 - pow(5.0,-s); double f7 = 1.0 - pow(7.0,-s); result->val = 1.0/(f2*f3*f5*f7); result->err = 3.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } inline static int riemann_zeta1m_slt0(double s, gsl_sf_result * result) { if(s > -19.0) { double x = (-19 - 2.0*s)/19.0; gsl_sf_result c; cheb_eval_e(&zeta_xgt1_cs, x, &c); result->val = c.val / (-s); result->err = c.err / (-s) + GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { double f2 = 1.0 - pow(2.0,-(1.0-s)); double f3 = 1.0 - pow(3.0,-(1.0-s)); double f5 = 1.0 - pow(5.0,-(1.0-s)); double f7 = 1.0 - pow(7.0,-(1.0-s)); result->val = 1.0/(f2*f3*f5*f7); result->err = 3.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } /* zeta(n) */ #define ZETA_POS_TABLE_NMAX 100 static double zeta_pos_int_table[ZETA_POS_TABLE_NMAX+1] = { -0.50000000000000000000000000000, /* zeta(0) */ 0.0 /* FIXME: DirectedInfinity() */, /* zeta(1) */ 1.64493406684822643647241516665, /* ... */ 1.20205690315959428539973816151, 1.08232323371113819151600369654, 1.03692775514336992633136548646, 1.01734306198444913971451792979, 1.00834927738192282683979754985, 1.00407735619794433937868523851, 1.00200839282608221441785276923, 1.00099457512781808533714595890, 1.00049418860411946455870228253, 1.00024608655330804829863799805, 1.00012271334757848914675183653, 1.00006124813505870482925854511, 1.00003058823630702049355172851, 1.00001528225940865187173257149, 1.00000763719763789976227360029, 1.00000381729326499983985646164, 1.00000190821271655393892565696, 1.00000095396203387279611315204, 1.00000047693298678780646311672, 1.00000023845050272773299000365, 1.00000011921992596531107306779, 1.00000005960818905125947961244, 1.00000002980350351465228018606, 1.00000001490155482836504123466, 1.00000000745071178983542949198, 1.00000000372533402478845705482, 1.00000000186265972351304900640, 1.00000000093132743241966818287, 1.00000000046566290650337840730, 1.00000000023283118336765054920, 1.00000000011641550172700519776, 1.00000000005820772087902700889, 1.00000000002910385044497099687, 1.00000000001455192189104198424, 1.00000000000727595983505748101, 1.00000000000363797954737865119, 1.00000000000181898965030706595, 1.00000000000090949478402638893, 1.00000000000045474737830421540, 1.00000000000022737368458246525, 1.00000000000011368684076802278, 1.00000000000005684341987627586, 1.00000000000002842170976889302, 1.00000000000001421085482803161, 1.00000000000000710542739521085, 1.00000000000000355271369133711, 1.00000000000000177635684357912, 1.00000000000000088817842109308, 1.00000000000000044408921031438, 1.00000000000000022204460507980, 1.00000000000000011102230251411, 1.00000000000000005551115124845, 1.00000000000000002775557562136, 1.00000000000000001387778780973, 1.00000000000000000693889390454, 1.00000000000000000346944695217, 1.00000000000000000173472347605, 1.00000000000000000086736173801, 1.00000000000000000043368086900, 1.00000000000000000021684043450, 1.00000000000000000010842021725, 1.00000000000000000005421010862, 1.00000000000000000002710505431, 1.00000000000000000001355252716, 1.00000000000000000000677626358, 1.00000000000000000000338813179, 1.00000000000000000000169406589, 1.00000000000000000000084703295, 1.00000000000000000000042351647, 1.00000000000000000000021175824, 1.00000000000000000000010587912, 1.00000000000000000000005293956, 1.00000000000000000000002646978, 1.00000000000000000000001323489, 1.00000000000000000000000661744, 1.00000000000000000000000330872, 1.00000000000000000000000165436, 1.00000000000000000000000082718, 1.00000000000000000000000041359, 1.00000000000000000000000020680, 1.00000000000000000000000010340, 1.00000000000000000000000005170, 1.00000000000000000000000002585, 1.00000000000000000000000001292, 1.00000000000000000000000000646, 1.00000000000000000000000000323, 1.00000000000000000000000000162, 1.00000000000000000000000000081, 1.00000000000000000000000000040, 1.00000000000000000000000000020, 1.00000000000000000000000000010, 1.00000000000000000000000000005, 1.00000000000000000000000000003, 1.00000000000000000000000000001, 1.00000000000000000000000000001, 1.00000000000000000000000000000, 1.00000000000000000000000000000, 1.00000000000000000000000000000 }; #define ZETA_NEG_TABLE_NMAX 99 #define ZETA_NEG_TABLE_SIZE 50 static double zeta_neg_int_table[ZETA_NEG_TABLE_SIZE] = { -0.083333333333333333333333333333, /* zeta(-1) */ 0.008333333333333333333333333333, /* zeta(-3) */ -0.003968253968253968253968253968, /* ... */ 0.004166666666666666666666666667, -0.007575757575757575757575757576, 0.021092796092796092796092796093, -0.083333333333333333333333333333, 0.44325980392156862745098039216, -3.05395433027011974380395433027, 26.4562121212121212121212121212, -281.460144927536231884057971014, 3607.5105463980463980463980464, -54827.583333333333333333333333, 974936.82385057471264367816092, -2.0052695796688078946143462272e+07, 4.7238486772162990196078431373e+08, -1.2635724795916666666666666667e+10, 3.8087931125245368811553022079e+11, -1.2850850499305083333333333333e+13, 4.8241448354850170371581670362e+14, -2.0040310656516252738108421663e+16, 9.1677436031953307756992753623e+17, -4.5979888343656503490437943262e+19, 2.5180471921451095697089023320e+21, -1.5001733492153928733711440151e+23, 9.6899578874635940656497942895e+24, -6.7645882379292820990945242302e+26, 5.0890659468662289689766332916e+28, -4.1147288792557978697665486068e+30, 3.5666582095375556109684574609e+32, -3.3066089876577576725680214670e+34, 3.2715634236478716264211227016e+36, -3.4473782558278053878256455080e+38, 3.8614279832705258893092720200e+40, -4.5892974432454332168863989006e+42, 5.7775386342770431824884825688e+44, -7.6919858759507135167410075972e+46, 1.0813635449971654696354033351e+49, -1.6029364522008965406067102346e+51, 2.5019479041560462843656661499e+53, -4.1067052335810212479752045004e+55, 7.0798774408494580617452972433e+57, -1.2804546887939508790190849756e+60, 2.4267340392333524078020892067e+62, -4.8143218874045769355129570066e+64, 9.9875574175727530680652777408e+66, -2.1645634868435185631335136160e+69, 4.8962327039620553206849224516e+71, /* ... */ -1.1549023923963519663954271692e+74, /* zeta(-97) */ 2.8382249570693706959264156336e+76 /* zeta(-99) */ }; /* coefficients for Maclaurin summation in hzeta() * B_{2j}/(2j)! */ static double hzeta_c[15] = { 1.00000000000000000000000000000, 0.083333333333333333333333333333, -0.00138888888888888888888888888889, 0.000033068783068783068783068783069, -8.2671957671957671957671957672e-07, 2.0876756987868098979210090321e-08, -5.2841901386874931848476822022e-10, 1.3382536530684678832826980975e-11, -3.3896802963225828668301953912e-13, 8.5860620562778445641359054504e-15, -2.1748686985580618730415164239e-16, 5.5090028283602295152026526089e-18, -1.3954464685812523340707686264e-19, 3.5347070396294674716932299778e-21, -8.9535174270375468504026113181e-23 }; #define ETA_POS_TABLE_NMAX 100 static double eta_pos_int_table[ETA_POS_TABLE_NMAX+1] = { 0.50000000000000000000000000000, /* eta(0) */ M_LN2, /* eta(1) */ 0.82246703342411321823620758332, /* ... */ 0.90154267736969571404980362113, 0.94703282949724591757650323447, 0.97211977044690930593565514355, 0.98555109129743510409843924448, 0.99259381992283028267042571313, 0.99623300185264789922728926008, 0.99809429754160533076778303185, 0.99903950759827156563922184570, 0.99951714349806075414409417483, 0.99975768514385819085317967871, 0.99987854276326511549217499282, 0.99993917034597971817095419226, 0.99996955121309923808263293263, 0.99998476421490610644168277496, 0.99999237829204101197693787224, 0.99999618786961011347968922641, 0.99999809350817167510685649297, 0.99999904661158152211505084256, 0.99999952325821554281631666433, 0.99999976161323082254789720494, 0.99999988080131843950322382485, 0.99999994039889239462836140314, 0.99999997019885696283441513311, 0.99999998509923199656878766181, 0.99999999254955048496351585274, 0.99999999627475340010872752767, 0.99999999813736941811218674656, 0.99999999906868228145397862728, 0.99999999953434033145421751469, 0.99999999976716989595149082282, 0.99999999988358485804603047265, 0.99999999994179239904531592388, 0.99999999997089618952980952258, 0.99999999998544809143388476396, 0.99999999999272404460658475006, 0.99999999999636202193316875550, 0.99999999999818101084320873555, 0.99999999999909050538047887809, 0.99999999999954525267653087357, 0.99999999999977262633369589773, 0.99999999999988631316532476488, 0.99999999999994315658215465336, 0.99999999999997157829090808339, 0.99999999999998578914539762720, 0.99999999999999289457268000875, 0.99999999999999644728633373609, 0.99999999999999822364316477861, 0.99999999999999911182158169283, 0.99999999999999955591079061426, 0.99999999999999977795539522974, 0.99999999999999988897769758908, 0.99999999999999994448884878594, 0.99999999999999997224442439010, 0.99999999999999998612221219410, 0.99999999999999999306110609673, 0.99999999999999999653055304826, 0.99999999999999999826527652409, 0.99999999999999999913263826204, 0.99999999999999999956631913101, 0.99999999999999999978315956551, 0.99999999999999999989157978275, 0.99999999999999999994578989138, 0.99999999999999999997289494569, 0.99999999999999999998644747284, 0.99999999999999999999322373642, 0.99999999999999999999661186821, 0.99999999999999999999830593411, 0.99999999999999999999915296705, 0.99999999999999999999957648353, 0.99999999999999999999978824176, 0.99999999999999999999989412088, 0.99999999999999999999994706044, 0.99999999999999999999997353022, 0.99999999999999999999998676511, 0.99999999999999999999999338256, 0.99999999999999999999999669128, 0.99999999999999999999999834564, 0.99999999999999999999999917282, 0.99999999999999999999999958641, 0.99999999999999999999999979320, 0.99999999999999999999999989660, 0.99999999999999999999999994830, 0.99999999999999999999999997415, 0.99999999999999999999999998708, 0.99999999999999999999999999354, 0.99999999999999999999999999677, 0.99999999999999999999999999838, 0.99999999999999999999999999919, 0.99999999999999999999999999960, 0.99999999999999999999999999980, 0.99999999999999999999999999990, 0.99999999999999999999999999995, 0.99999999999999999999999999997, 0.99999999999999999999999999999, 0.99999999999999999999999999999, 1.00000000000000000000000000000, 1.00000000000000000000000000000, 1.00000000000000000000000000000, }; #define ETA_NEG_TABLE_NMAX 99 #define ETA_NEG_TABLE_SIZE 50 static double eta_neg_int_table[ETA_NEG_TABLE_SIZE] = { 0.25000000000000000000000000000, /* eta(-1) */ -0.12500000000000000000000000000, /* eta(-3) */ 0.25000000000000000000000000000, /* ... */ -1.06250000000000000000000000000, 7.75000000000000000000000000000, -86.3750000000000000000000000000, 1365.25000000000000000000000000, -29049.0312500000000000000000000, 800572.750000000000000000000000, -2.7741322625000000000000000000e+7, 1.1805291302500000000000000000e+9, -6.0523980051687500000000000000e+10, 3.6794167785377500000000000000e+12, -2.6170760990658387500000000000e+14, 2.1531418140800295250000000000e+16, -2.0288775575173015930156250000e+18, 2.1708009902623770590275000000e+20, -2.6173826968455814932120125000e+22, 3.5324148876863877826668602500e+24, -5.3042033406864906641493838981e+26, 8.8138218364311576767253114668e+28, -1.6128065107490778547354654864e+31, 3.2355470001722734208527794569e+33, -7.0876727476537493198506645215e+35, 1.6890450341293965779175629389e+38, -4.3639690731216831157655651358e+40, 1.2185998827061261322605065672e+43, -3.6670584803153006180101262324e+45, 1.1859898526302099104271449748e+48, -4.1120769493584015047981746438e+50, 1.5249042436787620309090168687e+53, -6.0349693196941307074572991901e+55, 2.5437161764210695823197691519e+58, -1.1396923802632287851130360170e+61, 5.4180861064753979196802726455e+63, -2.7283654799994373847287197104e+66, 1.4529750514918543238511171663e+69, -8.1705519371067450079777183386e+71, 4.8445781606678367790247757259e+74, -3.0246694206649519336179448018e+77, 1.9858807961690493054169047970e+80, -1.3694474620720086994386818232e+83, 9.9070382984295807826303785989e+85, -7.5103780796592645925968460677e+88, 5.9598418264260880840077992227e+91, -4.9455988887500020399263196307e+94, 4.2873596927020241277675775935e+97, -3.8791952037716162900707994047e+100, 3.6600317773156342245401829308e+103, -3.5978775704117283875784869570e+106 /* eta(-99) */ }; /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ int gsl_sf_hzeta_e(const double s, const double q, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(s <= 1.0 || q <= 0.0) { DOMAIN_ERROR(result); } else { const double max_bits = 54.0; const double ln_term0 = -s * log(q); if(ln_term0 < GSL_LOG_DBL_MIN + 1.0) { UNDERFLOW_ERROR(result); } else if(ln_term0 > GSL_LOG_DBL_MAX - 1.0) { OVERFLOW_ERROR (result); } else if((s > max_bits && q < 1.0) || (s > 0.5*max_bits && q < 0.25)) { result->val = pow(q, -s); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(s > 0.5*max_bits && q < 1.0) { const double p1 = pow(q, -s); const double p2 = pow(q/(1.0+q), s); const double p3 = pow(q/(2.0+q), s); result->val = p1 * (1.0 + p2 + p3); result->err = GSL_DBL_EPSILON * (0.5*s + 2.0) * fabs(result->val); return GSL_SUCCESS; } else { /* Euler-Maclaurin summation formula * [Moshier, p. 400, with several typo corrections] */ const int jmax = 12; const int kmax = 10; int j, k; const double pmax = pow(kmax + q, -s); double scp = s; double pcp = pmax / (kmax + q); double ans = pmax*((kmax+q)/(s-1.0) + 0.5); for(k=0; kval = ans; result->err = 2.0 * (jmax + 1.0) * GSL_DBL_EPSILON * fabs(ans); return GSL_SUCCESS; } } } int gsl_sf_zeta_e(const double s, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(s == 1.0) { DOMAIN_ERROR(result); } else if(s >= 0.0) { return riemann_zeta_sgt0(s, result); } else { /* reflection formula, [Abramowitz+Stegun, 23.2.5] */ gsl_sf_result zeta_one_minus_s; const int stat_zoms = riemann_zeta1m_slt0(s, &zeta_one_minus_s); const double sin_term = sin(0.5*M_PI*s)/M_PI; if(sin_term == 0.0) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if(s > -170) { /* We have to be careful about losing digits * in calculating pow(2 Pi, s). The gamma * function is fine because we were careful * with that implementation. * We keep an array of (2 Pi)^(10 n). */ const double twopi_pow[18] = { 1.0, 9.589560061550901348e+007, 9.195966217409212684e+015, 8.818527036583869903e+023, 8.456579467173150313e+031, 8.109487671573504384e+039, 7.776641909496069036e+047, 7.457457466828644277e+055, 7.151373628461452286e+063, 6.857852693272229709e+071, 6.576379029540265771e+079, 6.306458169130020789e+087, 6.047615938853066678e+095, 5.799397627482402614e+103, 5.561367186955830005e+111, 5.333106466365131227e+119, 5.114214477385391780e+127, 4.904306689854036836e+135 }; const int n = floor((-s)/10.0); const double fs = s + 10.0*n; const double p = pow(2.0*M_PI, fs) / twopi_pow[n]; gsl_sf_result g; const int stat_g = gsl_sf_gamma_e(1.0-s, &g); result->val = p * g.val * sin_term * zeta_one_minus_s.val; result->err = fabs(p * g.val * sin_term) * zeta_one_minus_s.err; result->err += fabs(p * sin_term * zeta_one_minus_s.val) * g.err; result->err += GSL_DBL_EPSILON * (fabs(s)+2.0) * fabs(result->val); return GSL_ERROR_SELECT_2(stat_g, stat_zoms); } else { /* The actual zeta function may or may not * overflow here. But we have no easy way * to calculate it when the prefactor(s) * overflow. Trying to use log's and exp * is no good because we loose a couple * digits to the exp error amplification. * When we gather a little more patience, * we can implement something here. Until * then just give up. */ OVERFLOW_ERROR(result); } } } int gsl_sf_zeta_int_e(const int n, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n < 0) { if(!GSL_IS_ODD(n)) { result->val = 0.0; /* exactly zero at even negative integers */ result->err = 0.0; return GSL_SUCCESS; } else if(n > -ZETA_NEG_TABLE_NMAX) { result->val = zeta_neg_int_table[-(n+1)/2]; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { return gsl_sf_zeta_e((double)n, result); } } else if(n == 1){ DOMAIN_ERROR(result); } else if(n <= ZETA_POS_TABLE_NMAX){ result->val = zeta_pos_int_table[n]; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { result->val = 1.0; result->err = GSL_DBL_EPSILON; return GSL_SUCCESS; } } int gsl_sf_eta_int_e(int n, gsl_sf_result * result) { if(n > ETA_POS_TABLE_NMAX) { result->val = 1.0; result->err = GSL_DBL_EPSILON; return GSL_SUCCESS; } else if(n >= 0) { result->val = eta_pos_int_table[n]; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { /* n < 0 */ if(!GSL_IS_ODD(n)) { /* exactly zero at even negative integers */ result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if(n > -ETA_NEG_TABLE_NMAX) { result->val = eta_neg_int_table[-(n+1)/2]; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { gsl_sf_result z; gsl_sf_result p; int stat_z = gsl_sf_zeta_int_e(n, &z); int stat_p = gsl_sf_exp_e((1.0-n)*M_LN2, &p); int stat_m = gsl_sf_multiply_e(-p.val, z.val, result); result->err = fabs(p.err * (M_LN2*(1.0-n)) * z.val) + z.err * fabs(p.val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_ERROR_SELECT_3(stat_m, stat_p, stat_z); } } } int gsl_sf_eta_e(const double s, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(s > 100.0) { result->val = 1.0; result->err = GSL_DBL_EPSILON; return GSL_SUCCESS; } else if(fabs(s-1.0) < 10.0*GSL_ROOT5_DBL_EPSILON) { double del = s-1.0; double c0 = M_LN2; double c1 = M_LN2 * (M_EULER - 0.5*M_LN2); double c2 = -0.0326862962794492996; double c3 = 0.0015689917054155150; double c4 = 0.00074987242112047532; result->val = c0 + del * (c1 + del * (c2 + del * (c3 + del * c4))); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { gsl_sf_result z; gsl_sf_result p; int stat_z = gsl_sf_zeta_e(s, &z); int stat_p = gsl_sf_exp_e((1.0-s)*M_LN2, &p); int stat_m = gsl_sf_multiply_e(1.0-p.val, z.val, result); result->err = fabs(p.err * (M_LN2*(1.0-s)) * z.val) + z.err * fabs(p.val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_ERROR_SELECT_3(stat_m, stat_p, stat_z); } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_zeta(const double s) { EVAL_RESULT(gsl_sf_zeta_e(s, &result)); } double gsl_sf_hzeta(const double s, const double a) { EVAL_RESULT(gsl_sf_hzeta_e(s, a, &result)); } double gsl_sf_zeta_int(const int s) { EVAL_RESULT(gsl_sf_zeta_int_e(s, &result)); } double gsl_sf_eta_int(const int s) { EVAL_RESULT(gsl_sf_eta_int_e(s, &result)); } double gsl_sf_eta(const double s) { EVAL_RESULT(gsl_sf_eta_e(s, &result)); } bogofilter-1.2.4/gsl/specfunc/psi.c0000644000175000017500000004523712163572265015414 0ustar sezsez/* specfunc/psi.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include #include #include #include "error.h" #include "chebyshev.h" #include "cheb_eval.c" /*-*-*-*-*-*-*-*-*-*-*-* Private Section *-*-*-*-*-*-*-*-*-*-*-*/ /* Chebyshev fit for f(y) = Re(Psi(1+Iy)) + M_EULER - y^2/(1+y^2) - y^2/(2(4+y^2)) * 1 < y < 10 * ==> * y(x) = (9x + 11)/2, -1 < x < 1 * x(y) = (2y - 11)/9 * * g(x) := f(y(x)) */ static double r1py_data[] = { 1.59888328244976954803168395603, 0.67905625353213463845115658455, -0.068485802980122530009506482524, -0.005788184183095866792008831182, 0.008511258167108615980419855648, -0.004042656134699693434334556409, 0.001352328406159402601778462956, -0.000311646563930660566674525382, 0.000018507563785249135437219139, 0.000028348705427529850296492146, -0.000019487536014574535567541960, 8.0709788710834469408621587335e-06, -2.2983564321340518037060346561e-06, 3.0506629599604749843855962658e-07, 1.3042238632418364610774284846e-07, -1.2308657181048950589464690208e-07, 5.7710855710682427240667414345e-08, -1.8275559342450963966092636354e-08, 3.1020471300626589420759518930e-09, 6.8989327480593812470039430640e-10, -8.7182290258923059852334818997e-10, 4.4069147710243611798213548777e-10, -1.4727311099198535963467200277e-10, 2.7589682523262644748825844248e-11, 4.1871826756975856411554363568e-12, -6.5673460487260087541400767340e-12, 3.4487900886723214020103638000e-12, -1.1807251417448690607973794078e-12, 2.3798314343969589258709315574e-13, 2.1663630410818831824259465821e-15 }; static cheb_series r1py_cs = { r1py_data, 29, -1,1, 18 }; /* Chebyshev fits from SLATEC code for psi(x) Series for PSI on the interval 0. to 1.00000D+00 with weighted error 2.03E-17 log weighted error 16.69 significant figures required 16.39 decimal places required 17.37 Series for APSI on the interval 0. to 2.50000D-01 with weighted error 5.54E-17 log weighted error 16.26 significant figures required 14.42 decimal places required 16.86 */ static double psics_data[23] = { -.038057080835217922, .491415393029387130, -.056815747821244730, .008357821225914313, -.001333232857994342, .000220313287069308, -.000037040238178456, .000006283793654854, -.000001071263908506, .000000183128394654, -.000000031353509361, .000000005372808776, -.000000000921168141, .000000000157981265, -.000000000027098646, .000000000004648722, -.000000000000797527, .000000000000136827, -.000000000000023475, .000000000000004027, -.000000000000000691, .000000000000000118, -.000000000000000020 }; static cheb_series psi_cs = { psics_data, 22, -1, 1, 17 }; static double apsics_data[16] = { -.0204749044678185, -.0101801271534859, .0000559718725387, -.0000012917176570, .0000000572858606, -.0000000038213539, .0000000003397434, -.0000000000374838, .0000000000048990, -.0000000000007344, .0000000000001233, -.0000000000000228, .0000000000000045, -.0000000000000009, .0000000000000002, -.0000000000000000 }; static cheb_series apsi_cs = { apsics_data, 15, -1, 1, 9 }; #define PSI_TABLE_NMAX 100 static double psi_table[PSI_TABLE_NMAX+1] = { 0.0, /* Infinity */ /* psi(0) */ -M_EULER, /* psi(1) */ 0.42278433509846713939348790992, /* ... */ 0.92278433509846713939348790992, 1.25611766843180047272682124325, 1.50611766843180047272682124325, 1.70611766843180047272682124325, 1.87278433509846713939348790992, 2.01564147795560999653634505277, 2.14064147795560999653634505277, 2.25175258906672110764745616389, 2.35175258906672110764745616389, 2.44266167997581201673836525479, 2.52599501330914535007169858813, 2.60291809023222227314862166505, 2.67434666166079370172005023648, 2.74101332832746036838671690315, 2.80351332832746036838671690315, 2.86233685773922507426906984432, 2.91789241329478062982462539988, 2.97052399224214905087725697883, 3.02052399224214905087725697883, 3.06814303986119666992487602645, 3.11359758531574212447033057190, 3.15707584618530734186163491973, 3.1987425128519740085283015864, 3.2387425128519740085283015864, 3.2772040513135124700667631249, 3.3142410883505495071038001619, 3.3499553740648352213895144476, 3.3844381326855248765619282407, 3.4177714660188582098952615740, 3.4500295305349872421533260902, 3.4812795305349872421533260902, 3.5115825608380175451836291205, 3.5409943255438998981248055911, 3.5695657541153284695533770196, 3.5973435318931062473311547974, 3.6243705589201332743581818244, 3.6506863483938174848844976139, 3.6763273740348431259101386396, 3.7013273740348431259101386396, 3.7257176179372821503003825420, 3.7495271417468059598241920658, 3.7727829557002943319172153216, 3.7955102284275670591899425943, 3.8177324506497892814121648166, 3.8394715810845718901078169905, 3.8607481768292527411716467777, 3.8815815101625860745049801110, 3.9019896734278921969539597029, 3.9219896734278921969539597029, 3.9415975165651470989147440166, 3.9608282857959163296839747858, 3.9796962103242182164764276160, 3.9982147288427367349949461345, 4.0163965470245549168131279527, 4.0342536898816977739559850956, 4.0517975495308205809735289552, 4.0690389288411654085597358518, 4.0859880813835382899156680552, 4.1026547480502049565823347218, 4.1190481906731557762544658694, 4.1351772229312202923834981274, 4.1510502388042361653993711433, 4.1666752388042361653993711433, 4.1820598541888515500147557587, 4.1972113693403667015299072739, 4.2121367424746950597388624977, 4.2268426248276362362094507330, 4.2413353784508246420065521823, 4.2556210927365389277208378966, 4.2697055997787924488475984600, 4.2835944886676813377364873489, 4.2972931188046676391063503626, 4.3108066323181811526198638761, 4.3241399656515144859531972094, 4.3372978603883565912163551041, 4.3502848733753695782293421171, 4.3631053861958823987421626300, 4.3757636140439836645649474401, 4.3882636140439836645649474401, 4.4006092930563293435772931191, 4.4128044150075488557724150703, 4.4248526077786331931218126607, 4.4367573696833950978837174226, 4.4485220755657480390601880108, 4.4601499825424922251066996387, 4.4716442354160554434975042364, 4.4830078717796918071338678728, 4.4942438268358715824147667492, 4.5053549379469826935258778603, 4.5163439489359936825368668713, 4.5272135141533849868846929582, 4.5379662023254279976373811303, 4.5486045001977684231692960239, 4.5591308159872421073798223397, 4.5695474826539087740464890064, 4.5798567610044242379640147796, 4.5900608426370772991885045755, 4.6001618527380874001986055856 }; #define PSI_1_TABLE_NMAX 100 static double psi_1_table[PSI_1_TABLE_NMAX+1] = { 0.0, /* Infinity */ /* psi(1,0) */ M_PI*M_PI/6.0, /* psi(1,1) */ 0.644934066848226436472415, /* ... */ 0.394934066848226436472415, 0.2838229557371153253613041, 0.2213229557371153253613041, 0.1813229557371153253613041, 0.1535451779593375475835263, 0.1331370146940314251345467, 0.1175120146940314251345467, 0.1051663356816857461222010, 0.0951663356816857461222010, 0.0869018728717683907503002, 0.0799574284273239463058557, 0.0740402686640103368384001, 0.0689382278476838062261552, 0.0644937834032393617817108, 0.0605875334032393617817108, 0.0571273257907826143768665, 0.0540409060376961946237801, 0.0512708229352031198315363, 0.0487708229352031198315363, 0.0465032492390579951149830, 0.0444371335365786562720078, 0.0425467743683366902984728, 0.0408106632572255791873617, 0.0392106632572255791873617, 0.0377313733163971768204978, 0.0363596312039143235969038, 0.0350841209998326909438426, 0.0338950603577399442137594, 0.0327839492466288331026483, 0.0317433665203020901265817, 0.03076680402030209012658168, 0.02984853037475571730748159, 0.02898347847164153045627052, 0.02816715194102928555831133, 0.02739554700275768062003973, 0.02666508681283803124093089, 0.02597256603721476254286995, 0.02531510384129102815759710, 0.02469010384129102815759710, 0.02409521984367056414807896, 0.02352832641963428296894063, 0.02298749353699501850166102, 0.02247096461137518379091722, 0.02197713745088135663042339, 0.02150454765882086513703965, 0.02105185413233829383780923, 0.02061782635456051606003145, 0.02020133322669712580597065, 0.01980133322669712580597065, 0.01941686571420193164987683, 0.01904704322899483105816086, 0.01869104465298913508094477, 0.01834810912486842177504628, 0.01801753061247172756017024, 0.01769865306145131939690494, 0.01739086605006319997554452, 0.01709360088954001329302371, 0.01680632711763538818529605, 0.01652854933985761040751827, 0.01625980437882562975715546, 0.01599965869724394401313881, 0.01574770606433893015574400, 0.01550356543933893015574400, 0.01526687904880638577704578, 0.01503731063741979257227076, 0.01481454387422086185273411, 0.01459828089844231513993134, 0.01438824099085987447620523, 0.01418415935820681325171544, 0.01398578601958352422176106, 0.01379288478501562298719316, 0.01360523231738567365335942, 0.01342261726990576130858221, 0.01324483949212798353080444, 0.01307170929822216635628920, 0.01290304679189732236910755, 0.01273868124291638877278934, 0.01257845051066194236996928, 0.01242220051066194236996928, 0.01226978472038606978956995, 0.01212106372098095378719041, 0.01197590477193174490346273, 0.01183418141592267460867815, 0.01169577311142440471248438, 0.01156056489076458859566448, 0.01142844704164317229232189, 0.01129931481023821361463594, 0.01117306812421372175754719, 0.01104961133409026496742374, 0.01092885297157366069257770, 0.01081070552355853781923177, 0.01069508522063334415522437, 0.01058191183901270133041676, 0.01047110851491297833872701, 0.01036260157046853389428257, 0.01025632035036012704977199, /* ... */ 0.01015219706839427948625679, /* psi(1,99) */ 0.01005016666333357139524567 /* psi(1,100) */ }; /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ int gsl_sf_psi_int_e(const int n, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n <= 0) { DOMAIN_ERROR(result); } else if(n <= PSI_TABLE_NMAX) { result->val = psi_table[n]; result->err = GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { /* Abramowitz+Stegun 6.3.18 */ const double c2 = -1.0/12.0; const double c3 = 1.0/120.0; const double c4 = -1.0/252.0; const double c5 = 1.0/240.0; const double ni2 = (1.0/n)*(1.0/n); const double ser = ni2 * (c2 + ni2 * (c3 + ni2 * (c4 + ni2*c5))); result->val = log(n) - 0.5/n + ser; result->err = GSL_DBL_EPSILON * (fabs(log(n)) + fabs(0.5/n) + fabs(ser)); result->err += GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_psi_e(const double x, gsl_sf_result * result) { const double y = fabs(x); /* CHECK_POINTER(result) */ if(x == 0.0 || x == -1.0 || x == -2.0) { DOMAIN_ERROR(result); } else if(y >= 2.0) { const double t = 8.0/(y*y)-1.0; gsl_sf_result result_c; cheb_eval_e(&apsi_cs, t, &result_c); if(x < 0.0) { const double s = sin(M_PI*x); const double c = cos(M_PI*x); if(fabs(s) < 2.0*GSL_SQRT_DBL_MIN) { DOMAIN_ERROR(result); } else { result->val = log(y) - 0.5/x + result_c.val - M_PI * c/s; result->err = M_PI*fabs(x)*GSL_DBL_EPSILON/(s*s); result->err += result_c.err; result->err += GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } else { result->val = log(y) - 0.5/x + result_c.val; result->err = result_c.err; result->err += GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } else { /* -2 < x < 2 */ gsl_sf_result result_c; if(x < -1.0) { /* x = -2 + v */ const double v = x + 2.0; const double t1 = 1.0/x; const double t2 = 1.0/(x+1.0); const double t3 = 1.0/v; cheb_eval_e(&psi_cs, 2.0*v-1.0, &result_c); result->val = -(t1 + t2 + t3) + result_c.val; result->err = GSL_DBL_EPSILON * (fabs(t1) + fabs(x/(t2*t2)) + fabs(x/(t3*t3))); result->err += result_c.err; result->err += GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < 0.0) { /* x = -1 + v */ const double v = x + 1.0; const double t1 = 1.0/x; const double t2 = 1.0/v; cheb_eval_e(&psi_cs, 2.0*v-1.0, &result_c); result->val = -(t1 + t2) + result_c.val; result->err = GSL_DBL_EPSILON * (fabs(t1) + fabs(x/(t2*t2))); result->err += result_c.err; result->err += GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < 1.0) { /* x = v */ const double t1 = 1.0/x; cheb_eval_e(&psi_cs, 2.0*x-1.0, &result_c); result->val = -t1 + result_c.val; result->err = GSL_DBL_EPSILON * t1; result->err += result_c.err; result->err += GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { /* x = 1 + v */ const double v = x - 1.0; return cheb_eval_e(&psi_cs, 2.0*v-1.0, result); } } } int gsl_sf_psi_1piy_e(const double y, gsl_sf_result * result) { const double ay = fabs(y); /* CHECK_POINTER(result) */ if(ay > 1000.0) { /* [Abramowitz+Stegun, 6.3.19] */ const double yi2 = 1.0/(ay*ay); const double lny = log(ay); const double sum = yi2 * (1.0/12.0 + 1.0/120.0 * yi2 + 1.0/252.0 * yi2*yi2); result->val = lny + sum; result->err = 2.0 * GSL_DBL_EPSILON * (fabs(lny) + fabs(sum)); return GSL_SUCCESS; } else if(ay > 10.0) { /* [Abramowitz+Stegun, 6.3.19] */ const double yi2 = 1.0/(ay*ay); const double lny = log(ay); const double sum = yi2 * (1.0/12.0 + yi2 * (1.0/120.0 + yi2 * (1.0/252.0 + yi2 * (1.0/240.0 + yi2 * (1.0/132.0 + 691.0/32760.0 * yi2))))); result->val = lny + sum; result->err = 2.0 * GSL_DBL_EPSILON * (fabs(lny) + fabs(sum)); return GSL_SUCCESS; } else if(ay > 1.0){ const double y2 = ay*ay; const double x = (2.0*ay - 11.0)/9.0; const double v = y2*(1.0/(1.0+y2) + 0.5/(4.0+y2)); gsl_sf_result result_c; cheb_eval_e(&r1py_cs, x, &result_c); result->val = result_c.val - M_EULER + v; result->err = result_c.err; result->err += 2.0 * GSL_DBL_EPSILON * (fabs(v) + M_EULER + fabs(result_c.val)); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); result->err *= 5.0; /* FIXME: losing a digit somewhere... maybe at x=... ? */ return GSL_SUCCESS; } else { /* [Abramowitz+Stegun, 6.3.17] * * -M_EULER + y^2 Sum[1/n 1/(n^2 + y^2), {n,1,M}] * + Sum[1/n^3, {n,M+1,Infinity}] * - y^2 Sum[1/n^5, {n,M+1,Infinity}] * + y^4 Sum[1/n^7, {n,M+1,Infinity}] * - y^6 Sum[1/n^9, {n,M+1,Infinity}] * + O(y^8) * * We take M=50 for at least 15 digit precision. */ const int M = 50; const double y2 = y*y; const double c0 = 0.00019603999466879846570; const double c2 = 3.8426659205114376860e-08; const double c4 = 1.0041592839497643554e-11; const double c6 = 2.9516743763500191289e-15; const double p = c0 + y2 *(-c2 + y2*(c4 - y2*c6)); double sum = 0.0; double v; int n; for(n=1; n<=M; n++) { sum += 1.0/(n * (n*n + y*y)); } v = y2 * (sum + p); result->val = -M_EULER + v; result->err = GSL_DBL_EPSILON * (M_EULER + fabs(v)); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_psi_1_int_e(const int n, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n <= 0) { DOMAIN_ERROR(result); } else if(n <= PSI_1_TABLE_NMAX) { result->val = psi_1_table[n]; result->err = GSL_DBL_EPSILON * result->val; return GSL_SUCCESS; } else { /* Abramowitz+Stegun 6.4.12 * double-precision for n > 100 */ const double c0 = -1.0/30.0; const double c1 = 1.0/42.0; const double c2 = -1.0/30.0; const double ni2 = (1.0/n)*(1.0/n); const double ser = ni2*ni2 * (c0 + ni2*(c1 + c2*ni2)); result->val = (1.0 + 0.5/n + 1.0/(6.0*n*n) + ser) / n; result->err = GSL_DBL_EPSILON * result->val; return GSL_SUCCESS; } } int gsl_sf_psi_n_e(const int n, const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n < 0 || x <= 0.0) { DOMAIN_ERROR(result); } else if(n == 0) { return gsl_sf_psi_e(x, result); } else { gsl_sf_result ln_nf; gsl_sf_result hzeta; int stat_hz = gsl_sf_hzeta_e(n+1.0, x, &hzeta); int stat_nf = gsl_sf_lnfact_e((unsigned int) n, &ln_nf); int stat_e = gsl_sf_exp_mult_err_e(ln_nf.val, ln_nf.err, hzeta.val, hzeta.err, result); if(GSL_IS_EVEN(n)) result->val = -result->val; return GSL_ERROR_SELECT_3(stat_e, stat_nf, stat_hz); } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_psi_int(const int n) { EVAL_RESULT(gsl_sf_psi_int_e(n, &result)); } double gsl_sf_psi(const double x) { EVAL_RESULT(gsl_sf_psi_e(x, &result)); } double gsl_sf_psi_1piy(const double x) { EVAL_RESULT(gsl_sf_psi_1piy_e(x, &result)); } double gsl_sf_psi_1_int(const int n) { EVAL_RESULT(gsl_sf_psi_1_int_e(n, &result)); } double gsl_sf_psi_n(const int n, const double x) { EVAL_RESULT(gsl_sf_psi_n_e(n, x, &result)); } bogofilter-1.2.4/gsl/specfunc/check.h0000644000175000017500000000017612163572265015674 0ustar sezsez/* check for underflow */ #define CHECK_UNDERFLOW(r) if (fabs((r)->val) < GSL_DBL_MIN) GSL_ERROR("underflow", GSL_EUNDRFLW); bogofilter-1.2.4/gsl/specfunc/log.c0000644000175000017500000001536512163572265015401 0ustar sezsez/* specfunc/log.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include "error.h" #include "chebyshev.h" #include "cheb_eval.c" /*-*-*-*-*-*-*-*-*-*-*-* Private Section *-*-*-*-*-*-*-*-*-*-*-*/ /* Chebyshev expansion for log(1 + x(t))/x(t) * * x(t) = (4t-1)/(2(4-t)) * t(x) = (8x+1)/(2(x+2)) * -1/2 < x < 1/2 * -1 < t < 1 */ static double lopx_data[21] = { 2.16647910664395270521272590407, -0.28565398551049742084877469679, 0.01517767255690553732382488171, -0.00200215904941415466274422081, 0.00019211375164056698287947962, -0.00002553258886105542567601400, 2.9004512660400621301999384544e-06, -3.8873813517057343800270917900e-07, 4.7743678729400456026672697926e-08, -6.4501969776090319441714445454e-09, 8.2751976628812389601561347296e-10, -1.1260499376492049411710290413e-10, 1.4844576692270934446023686322e-11, -2.0328515972462118942821556033e-12, 2.7291231220549214896095654769e-13, -3.7581977830387938294437434651e-14, 5.1107345870861673561462339876e-15, -7.0722150011433276578323272272e-16, 9.7089758328248469219003866867e-17, -1.3492637457521938883731579510e-17, 1.8657327910677296608121390705e-18 }; static cheb_series lopx_cs = { lopx_data, 20, -1, 1, 10 }; /* Chebyshev expansion for (log(1 + x(t)) - x(t))/x(t)^2 * * x(t) = (4t-1)/(2(4-t)) * t(x) = (8x+1)/(2(x+2)) * -1/2 < x < 1/2 * -1 < t < 1 */ static double lopxmx_data[20] = { -1.12100231323744103373737274541, 0.19553462773379386241549597019, -0.01467470453808083971825344956, 0.00166678250474365477643629067, -0.00018543356147700369785746902, 0.00002280154021771635036301071, -2.8031253116633521699214134172e-06, 3.5936568872522162983669541401e-07, -4.6241857041062060284381167925e-08, 6.0822637459403991012451054971e-09, -8.0339824424815790302621320732e-10, 1.0751718277499375044851551587e-10, -1.4445310914224613448759230882e-11, 1.9573912180610336168921438426e-12, -2.6614436796793061741564104510e-13, 3.6402634315269586532158344584e-14, -4.9937495922755006545809120531e-15, 6.8802890218846809524646902703e-16, -9.5034129794804273611403251480e-17, 1.3170135013050997157326965813e-17 }; static cheb_series lopxmx_cs = { lopxmx_data, 19, -1, 1, 9 }; /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ #ifndef HIDE_INLINE_STATIC int gsl_sf_log_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x <= 0.0) { DOMAIN_ERROR(result); } else { result->val = log(x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_log_abs_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x == 0.0) { DOMAIN_ERROR(result); } else { result->val = log(fabs(x)); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } #endif int gsl_sf_complex_log_e(const double zr, const double zi, gsl_sf_result * lnr, gsl_sf_result * theta) { /* CHECK_POINTER(lnr) */ /* CHECK_POINTER(theta) */ if(zr != 0.0 || zi != 0.0) { const double ax = fabs(zr); const double ay = fabs(zi); const double min = GSL_MIN(ax, ay); const double max = GSL_MAX(ax, ay); lnr->val = log(max) + 0.5 * log(1.0 + (min/max)*(min/max)); lnr->err = 2.0 * GSL_DBL_EPSILON * fabs(lnr->val); theta->val = atan2(zi, zr); theta->err = GSL_DBL_EPSILON * fabs(lnr->val); return GSL_SUCCESS; } else { DOMAIN_ERROR_2(lnr, theta); } } int gsl_sf_log_1plusx_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x <= -1.0) { DOMAIN_ERROR(result); } else if(fabs(x) < GSL_ROOT6_DBL_EPSILON) { const double c1 = -0.5; const double c2 = 1.0/3.0; const double c3 = -1.0/4.0; const double c4 = 1.0/5.0; const double c5 = -1.0/6.0; const double c6 = 1.0/7.0; const double c7 = -1.0/8.0; const double c8 = 1.0/9.0; const double c9 = -1.0/10.0; const double t = c5 + x*(c6 + x*(c7 + x*(c8 + x*c9))); result->val = x * (1.0 + x*(c1 + x*(c2 + x*(c3 + x*(c4 + x*t))))); result->err = GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(fabs(x) < 0.5) { double t = 0.5*(8.0*x + 1.0)/(x+2.0); gsl_sf_result c; cheb_eval_e(&lopx_cs, t, &c); result->val = x * c.val; result->err = fabs(x * c.err); return GSL_SUCCESS; } else { result->val = log(1.0 + x); result->err = GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_log_1plusx_mx_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x <= -1.0) { DOMAIN_ERROR(result); } else if(fabs(x) < GSL_ROOT5_DBL_EPSILON) { const double c1 = -0.5; const double c2 = 1.0/3.0; const double c3 = -1.0/4.0; const double c4 = 1.0/5.0; const double c5 = -1.0/6.0; const double c6 = 1.0/7.0; const double c7 = -1.0/8.0; const double c8 = 1.0/9.0; const double c9 = -1.0/10.0; const double t = c5 + x*(c6 + x*(c7 + x*(c8 + x*c9))); result->val = x*x * (c1 + x*(c2 + x*(c3 + x*(c4 + x*t)))); result->err = GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(fabs(x) < 0.5) { double t = 0.5*(8.0*x + 1.0)/(x+2.0); gsl_sf_result c; cheb_eval_e(&lopxmx_cs, t, &c); result->val = x*x * c.val; result->err = x*x * c.err; return GSL_SUCCESS; } else { const double lterm = log(1.0 + x); result->val = lterm - x; result->err = GSL_DBL_EPSILON * (fabs(lterm) + fabs(x)); return GSL_SUCCESS; } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_log(const double x) { EVAL_RESULT(gsl_sf_log_e(x, &result)); } double gsl_sf_log_abs(const double x) { EVAL_RESULT(gsl_sf_log_abs_e(x, &result)); } double gsl_sf_log_1plusx(const double x) { EVAL_RESULT(gsl_sf_log_1plusx_e(x, &result)); } double gsl_sf_log_1plusx_mx(const double x) { EVAL_RESULT(gsl_sf_log_1plusx_mx_e(x, &result)); } bogofilter-1.2.4/gsl/specfunc/gamma_inc.c0000644000175000017500000004432312163572265016527 0ustar sezsez/* specfunc/gamma_inc.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include #include #include #include #include "error.h" /* The dominant part, * D(a,x) := x^a e^(-x) / Gamma(a+1) */ static int gamma_inc_D(const double a, const double x, gsl_sf_result * result) { if(a < 10.0) { double lnr; gsl_sf_result lg; gsl_sf_lngamma_e(a+1.0, &lg); lnr = a * log(x) - x - lg.val; result->val = exp(lnr); result->err = 2.0 * GSL_DBL_EPSILON * (fabs(lnr) + 1.0) * fabs(result->val); return GSL_SUCCESS; } else { gsl_sf_result gstar; gsl_sf_result ln_term; double term1; if (x < a) { double u = x/a; ln_term.val = log(u) - u + 1.0; ln_term.err = ln_term.val * GSL_DBL_EPSILON; } else { double mu = (x-a)/a; gsl_sf_log_1plusx_mx_e(mu, &ln_term); /* log(1+mu) - mu */ }; gsl_sf_gammastar_e(a, &gstar); term1 = exp(a*ln_term.val)/sqrt(2.0*M_PI*a); result->val = term1/gstar.val; result->err = 2.0 * GSL_DBL_EPSILON * (fabs(a*ln_term.val) + 1.0) * fabs(result->val); result->err += gstar.err/fabs(gstar.val) * fabs(result->val); return GSL_SUCCESS; } } /* P series representation. */ static int gamma_inc_P_series(const double a, const double x, gsl_sf_result * result) { const int nmax = 5000; gsl_sf_result D; int stat_D = gamma_inc_D(a, x, &D); double sum = 1.0; double term = 1.0; int n; for(n=1; nval = D.val * sum; result->err = D.err * fabs(sum); result->err += (1.0 + n) * GSL_DBL_EPSILON * fabs(result->val); if(n == nmax) GSL_ERROR ("error", GSL_EMAXITER); else return stat_D; } /* Q large x asymptotic */ static int gamma_inc_Q_large_x(const double a, const double x, gsl_sf_result * result) { const int nmax = 5000; gsl_sf_result D; const int stat_D = gamma_inc_D(a, x, &D); double sum = 1.0; double term = 1.0; double last = 1.0; int n; for(n=1; n 1.0) break; if(fabs(term/sum) < GSL_DBL_EPSILON) break; sum += term; last = term; } result->val = D.val * (a/x) * sum; result->err = D.err * fabs((a/x) * sum); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); if(n == nmax) GSL_ERROR ("error in large x asymptotic", GSL_EMAXITER); else return stat_D; } /* Uniform asymptotic for x near a, a and x large. * See [Temme, p. 285] * FIXME: need c1 coefficient */ static int gamma_inc_Q_asymp_unif(const double a, const double x, gsl_sf_result * result) { const double rta = sqrt(a); const double eps = (x-a)/a; gsl_sf_result ln_term; const int stat_ln = gsl_sf_log_1plusx_mx_e(eps, &ln_term); /* log(1+eps) - eps */ const double eta = eps * sqrt(-2.0*ln_term.val/(eps*eps)); gsl_sf_result erfc; double R; double c0, c1; gsl_sf_erfc_e(eta*M_SQRT2*rta, &erfc); if(fabs(eps) < GSL_ROOT5_DBL_EPSILON) { c0 = -1.0/3.0 + eps*(1.0/12.0 - eps*(23.0/540.0 - eps*(353.0/12960.0 - eps*589.0/30240.0))); c1 = 0.0; } else { double rt_term; rt_term = sqrt(-2.0 * ln_term.val/(eps*eps)); c0 = (1.0 - 1.0/rt_term)/eps; c1 = 0.0; } R = exp(-0.5*a*eta*eta)/(M_SQRT2*M_SQRTPI*rta) * (c0 + c1/a); result->val = 0.5 * erfc.val + R; result->err = GSL_DBL_EPSILON * fabs(R * 0.5 * a*eta*eta) + 0.5 * erfc.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_ln; } /* Continued fraction which occurs in evaluation * of Q(a,x) or Gamma(a,x). * * 1 (1-a)/x 1/x (2-a)/x 2/x (3-a)/x * F(a,x) = ---- ------- ----- -------- ----- -------- ... * 1 + 1 + 1 + 1 + 1 + 1 + * * Hans E. Plesser, 2002-01-22 (hans dot plesser at itf dot nlh dot no). * * Split out from gamma_inc_Q_CF() by GJ [Tue Apr 1 13:16:41 MST 2003]. * See gamma_inc_Q_CF() below. * */ static int gamma_inc_F_CF(const double a, const double x, gsl_sf_result * result) { const int nmax = 5000; const double small = gsl_pow_3 (GSL_DBL_EPSILON); double hn = 1.0; /* convergent */ double Cn = 1.0 / small; double Dn = 1.0; int n; /* n == 1 has a_1, b_1, b_0 independent of a,x, so that has been done by hand */ for ( n = 2 ; n < nmax ; n++ ) { double an; double delta; if(GSL_IS_ODD(n)) an = 0.5*(n-1)/x; else an = (0.5*n-a)/x; Dn = 1.0 + an * Dn; if ( fabs(Dn) < small ) Dn = small; Cn = 1.0 + an/Cn; if ( fabs(Cn) < small ) Cn = small; Dn = 1.0 / Dn; delta = Cn * Dn; hn *= delta; if(fabs(delta-1.0) < GSL_DBL_EPSILON) break; } result->val = hn; result->err = 2.0*GSL_DBL_EPSILON * fabs(hn); result->err += GSL_DBL_EPSILON * (2.0 + 0.5*n) * fabs(result->val); if(n == nmax) GSL_ERROR ("error in CF for F(a,x)", GSL_EMAXITER); else return GSL_SUCCESS; } /* Continued fraction for Q. * * Q(a,x) = D(a,x) a/x F(a,x) * * Hans E. Plesser, 2002-01-22 (hans dot plesser at itf dot nlh dot no): * * Since the Gautschi equivalent series method for CF evaluation may lead * to singularities, I have replaced it with the modified Lentz algorithm * given in * * I J Thompson and A R Barnett * Coulomb and Bessel Functions of Complex Arguments and Order * J Computational Physics 64:490-509 (1986) * * In consequence, gamma_inc_Q_CF_protected() is now obsolete and has been * removed. * * Identification of terms between the above equation for F(a, x) and * the first equation in the appendix of Thompson&Barnett is as follows: * * b_0 = 0, b_n = 1 for all n > 0 * * a_1 = 1 * a_n = (n/2-a)/x for n even * a_n = (n-1)/(2x) for n odd * */ static int gamma_inc_Q_CF(const double a, const double x, gsl_sf_result * result) { gsl_sf_result D; gsl_sf_result F; const int stat_D = gamma_inc_D(a, x, &D); const int stat_F = gamma_inc_F_CF(a, x, &F); result->val = D.val * (a/x) * F.val; result->err = D.err * fabs((a/x) * F.val) + fabs(D.val * a/x * F.err); return GSL_ERROR_SELECT_2(stat_F, stat_D); } /* Useful for small a and x. Handles the subtraction analytically. */ static int gamma_inc_Q_series(const double a, const double x, gsl_sf_result * result) { double term1; /* 1 - x^a/Gamma(a+1) */ double sum; /* 1 + (a+1)/(a+2)(-x)/2! + (a+1)/(a+3)(-x)^2/3! + ... */ int stat_sum; double term2; /* a temporary variable used at the end */ { /* Evaluate series for 1 - x^a/Gamma(a+1), small a */ const double pg21 = -2.404113806319188570799476; /* PolyGamma[2,1] */ const double lnx = log(x); const double el = M_EULER+lnx; const double c1 = -el; const double c2 = M_PI*M_PI/12.0 - 0.5*el*el; const double c3 = el*(M_PI*M_PI/12.0 - el*el/6.0) + pg21/6.0; const double c4 = -0.04166666666666666667 * (-1.758243446661483480 + lnx) * (-0.764428657272716373 + lnx) * ( 0.723980571623507657 + lnx) * ( 4.107554191916823640 + lnx); const double c5 = -0.0083333333333333333 * (-2.06563396085715900 + lnx) * (-1.28459889470864700 + lnx) * (-0.27583535756454143 + lnx) * ( 1.33677371336239618 + lnx) * ( 5.17537282427561550 + lnx); const double c6 = -0.0013888888888888889 * (-2.30814336454783200 + lnx) * (-1.65846557706987300 + lnx) * (-0.88768082560020400 + lnx) * ( 0.17043847751371778 + lnx) * ( 1.92135970115863890 + lnx) * ( 6.22578557795474900 + lnx); const double c7 = -0.00019841269841269841 * (-2.5078657901291800 + lnx) * (-1.9478900888958200 + lnx) * (-1.3194837322612730 + lnx) * (-0.5281322700249279 + lnx) * ( 0.5913834939078759 + lnx) * ( 2.4876819633378140 + lnx) * ( 7.2648160783762400 + lnx); const double c8 = -0.00002480158730158730 * (-2.677341544966400 + lnx) * (-2.182810448271700 + lnx) * (-1.649350342277400 + lnx) * (-1.014099048290790 + lnx) * (-0.191366955370652 + lnx) * ( 0.995403817918724 + lnx) * ( 3.041323283529310 + lnx) * ( 8.295966556941250 + lnx); const double c9 = -2.75573192239859e-6 * (-2.8243487670469080 + lnx) * (-2.3798494322701120 + lnx) * (-1.9143674728689960 + lnx) * (-1.3814529102920370 + lnx) * (-0.7294312810261694 + lnx) * ( 0.1299079285269565 + lnx) * ( 1.3873333251885240 + lnx) * ( 3.5857258865210760 + lnx) * ( 9.3214237073814600 + lnx); const double c10 = -2.75573192239859e-7 * (-2.9540329644556910 + lnx) * (-2.5491366926991850 + lnx) * (-2.1348279229279880 + lnx) * (-1.6741881076349450 + lnx) * (-1.1325949616098420 + lnx) * (-0.4590034650618494 + lnx) * ( 0.4399352987435699 + lnx) * ( 1.7702236517651670 + lnx) * ( 4.1231539047474080 + lnx) * ( 10.342627908148680 + lnx); term1 = a*(c1+a*(c2+a*(c3+a*(c4+a*(c5+a*(c6+a*(c7+a*(c8+a*(c9+a*c10))))))))); } { /* Evaluate the sum. */ const int nmax = 5000; double t = 1.0; int n; sum = 1.0; for(n=1; nval = term1 + term2; result->err = GSL_DBL_EPSILON * (fabs(term1) + 2.0*fabs(term2)); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_sum; } /* series for small a and x, but not defined for a == 0 */ static int gamma_inc_series(double a, double x, gsl_sf_result * result) { gsl_sf_result Q; gsl_sf_result G; const int stat_Q = gamma_inc_Q_series(a, x, &Q); const int stat_G = gsl_sf_gamma_e(a, &G); result->val = Q.val * G.val; result->err = fabs(Q.val * G.err) + fabs(Q.err * G.val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_ERROR_SELECT_2(stat_Q, stat_G); } static int gamma_inc_a_gt_0(double a, double x, gsl_sf_result * result) { /* x > 0 and a > 0; use result for Q */ gsl_sf_result Q; gsl_sf_result G; const int stat_Q = gsl_sf_gamma_inc_Q_e(a, x, &Q); const int stat_G = gsl_sf_gamma_e(a, &G); result->val = G.val * Q.val; result->err = fabs(G.val * Q.err) + fabs(G.err * Q.val); result->err += 2.0*GSL_DBL_EPSILON * fabs(result->val); return GSL_ERROR_SELECT_2(stat_G, stat_Q); } static int gamma_inc_CF(double a, double x, gsl_sf_result * result) { gsl_sf_result F; gsl_sf_result pre; const int stat_F = gamma_inc_F_CF(a, x, &F); const int stat_E = gsl_sf_exp_e((a-1.0)*log(x) - x, &pre); result->val = F.val * pre.val; result->err = fabs(F.err * pre.val) + fabs(F.val * pre.err); result->err += (2.0 + fabs(a)) * GSL_DBL_EPSILON * fabs(result->val); return GSL_ERROR_SELECT_2(stat_F, stat_E); } /* evaluate Gamma(0,x), x > 0 */ #define GAMMA_INC_A_0(x, result) gsl_sf_expint_E1_e(x, result) /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ int gsl_sf_gamma_inc_Q_e(const double a, const double x, gsl_sf_result * result) { if(a < 0.0 || x < 0.0) { DOMAIN_ERROR(result); } else if(x == 0.0) { result->val = 1.0; result->err = 0.0; return GSL_SUCCESS; } else if(a == 0.0) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if(x <= 0.5*a) { /* If the series is quick, do that. It is * robust and simple. */ gsl_sf_result P; int stat_P = gamma_inc_P_series(a, x, &P); result->val = 1.0 - P.val; result->err = P.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_P; } else if(a >= 1.0e+06 && (x-a)*(x-a) < a) { /* Then try the difficult asymptotic regime. * This is the only way to do this region. */ return gamma_inc_Q_asymp_unif(a, x, result); } else if(a < 0.2 && x < 5.0) { /* Cancellations at small a must be handled * analytically; x should not be too big * either since the series terms grow * with x and log(x). */ return gamma_inc_Q_series(a, x, result); } else if(a <= x) { if(x <= 1.0e+06) { /* Continued fraction is excellent for x >~ a. * We do not let x be too large when x > a since * it is somewhat pointless to try this there; * the function is rapidly decreasing for * x large and x > a, and it will just * underflow in that region anyway. We * catch that case in the standard * large-x method. */ return gamma_inc_Q_CF(a, x, result); } else { return gamma_inc_Q_large_x(a, x, result); } } else { if(a < 0.8*x) { /* Continued fraction again. The convergence * is a little slower here, but that is fine. * We have to trade that off against the slow * convergence of the series, which is the * only other option. */ return gamma_inc_Q_CF(a, x, result); } else { gsl_sf_result P; int stat_P = gamma_inc_P_series(a, x, &P); result->val = 1.0 - P.val; result->err = P.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_P; } } } int gsl_sf_gamma_inc_P_e(const double a, const double x, gsl_sf_result * result) { if(a <= 0.0 || x < 0.0) { DOMAIN_ERROR(result); } else if(x == 0.0) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if(x < 20.0 || x < 0.5*a) { /* Do the easy series cases. Robust and quick. */ return gamma_inc_P_series(a, x, result); } else if(a > 1.0e+06 && (x-a)*(x-a) < a) { /* Crossover region. Note that Q and P are * roughly the same order of magnitude here, * so the subtraction is stable. */ gsl_sf_result Q; int stat_Q = gamma_inc_Q_asymp_unif(a, x, &Q); result->val = 1.0 - Q.val; result->err = Q.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_Q; } else if(a <= x) { /* Q <~ P in this area, so the * subtractions are stable. */ gsl_sf_result Q; int stat_Q; if(a > 0.2*x) { stat_Q = gamma_inc_Q_CF(a, x, &Q); } else { stat_Q = gamma_inc_Q_large_x(a, x, &Q); } result->val = 1.0 - Q.val; result->err = Q.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_Q; } else { if((x-a)*(x-a) < a) { /* This condition is meant to insure * that Q is not very close to 1, * so the subtraction is stable. */ gsl_sf_result Q; int stat_Q = gamma_inc_Q_CF(a, x, &Q); result->val = 1.0 - Q.val; result->err = Q.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_Q; } else { return gamma_inc_P_series(a, x, result); } } } int gsl_sf_gamma_inc_e(const double a, const double x, gsl_sf_result * result) { if(x < 0.0) { DOMAIN_ERROR(result); } else if(x == 0.0) { return gsl_sf_gamma_e(a, result); } else if(a == 0.0) { return GAMMA_INC_A_0(x, result); } else if(a > 0.0) { return gamma_inc_a_gt_0(a, x, result); } else if(x > 0.25) { /* continued fraction seems to fail for x too small; otherwise it is ok, independent of the value of |x/a|, because of the non-oscillation in the expansion, i.e. the CF is un-conditionally convergent for a < 0 and x > 0 */ return gamma_inc_CF(a, x, result); } else if(fabs(a) < 0.5) { return gamma_inc_series(a, x, result); } else { /* a = fa + da; da >= 0 */ const double fa = floor(a); const double da = a - fa; gsl_sf_result g_da; const int stat_g_da = ( da > 0.0 ? gamma_inc_a_gt_0(da, x, &g_da) : GAMMA_INC_A_0(x, &g_da)); double alpha = da; double gax = g_da.val; /* Gamma(alpha-1,x) = 1/(alpha-1) (Gamma(a,x) - x^(alpha-1) e^-x) */ do { const double shift = exp(-x + (alpha-1.0)*log(x)); gax = (gax - shift) / (alpha - 1.0); alpha -= 1.0; } while(alpha > a); result->val = gax; result->err = 2.0*(1.0 + fabs(a))*GSL_DBL_EPSILON*fabs(gax); return stat_g_da; } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_gamma_inc_P(const double a, const double x) { EVAL_RESULT(gsl_sf_gamma_inc_P_e(a, x, &result)); } double gsl_sf_gamma_inc_Q(const double a, const double x) { EVAL_RESULT(gsl_sf_gamma_inc_Q_e(a, x, &result)); } double gsl_sf_gamma_inc(const double a, const double x) { EVAL_RESULT(gsl_sf_gamma_inc_e(a, x, &result)); } bogofilter-1.2.4/gsl/specfunc/trig.c0000644000175000017500000004535412163572265015566 0ustar sezsez/* specfunc/trig.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include #include "error.h" #include "chebyshev.h" #include "cheb_eval.c" /* sinh(x) series * double-precision for |x| < 1.0 */ inline static int sinh_series(const double x, double * result) { const double y = x*x; const double c0 = 1.0/6.0; const double c1 = 1.0/120.0; const double c2 = 1.0/5040.0; const double c3 = 1.0/362880.0; const double c4 = 1.0/39916800.0; const double c5 = 1.0/6227020800.0; const double c6 = 1.0/1307674368000.0; const double c7 = 1.0/355687428096000.0; *result = x*(1.0 + y*(c0+y*(c1+y*(c2+y*(c3+y*(c4+y*(c5+y*(c6+y*c7)))))))); return GSL_SUCCESS; } /* cosh(x)-1 series * double-precision for |x| < 1.0 */ inline static int cosh_m1_series(const double x, double * result) { const double y = x*x; const double c0 = 0.5; const double c1 = 1.0/24.0; const double c2 = 1.0/720.0; const double c3 = 1.0/40320.0; const double c4 = 1.0/3628800.0; const double c5 = 1.0/479001600.0; const double c6 = 1.0/87178291200.0; const double c7 = 1.0/20922789888000.0; const double c8 = 1.0/6402373705728000.0; *result = y*(c0+y*(c1+y*(c2+y*(c3+y*(c4+y*(c5+y*(c6+y*(c7+y*c8)))))))); return GSL_SUCCESS; } /* Chebyshev expansion for f(t) = sinc((t+1)/2), -1 < t < 1 */ static double sinc_data[17] = { 1.133648177811747875422, -0.532677564732557348781, -0.068293048346633177859, 0.033403684226353715020, 0.001485679893925747818, -0.000734421305768455295, -0.000016837282388837229, 0.000008359950146618018, 0.000000117382095601192, -0.000000058413665922724, -0.000000000554763755743, 0.000000000276434190426, 0.000000000001895374892, -0.000000000000945237101, -0.000000000000004900690, 0.000000000000002445383, 0.000000000000000009925 }; static cheb_series sinc_cs = { sinc_data, 16, -1, 1, 10 }; /* Chebyshev expansion for f(t) = g((t+1)Pi/8), -1val = x * (1.0 - x2/6.0); result->err = fabs(x*x2*x2 / 100.0); return GSL_SUCCESS; } else { double sgn_result = sgn_x; double y = floor(abs_x/(0.25*M_PI)); int octant = y - ldexp(floor(ldexp(y,-3)),3); int stat_cs; double z; if(GSL_IS_ODD(octant)) { octant += 1; octant &= 07; y += 1.0; } if(octant > 3) { octant -= 4; sgn_result = -sgn_result; } z = ((abs_x - y * P1) - y * P2) - y * P3; if(octant == 0) { gsl_sf_result sin_cs_result; const double t = 8.0*fabs(z)/M_PI - 1.0; stat_cs = cheb_eval_e(&sin_cs, t, &sin_cs_result); result->val = z * (1.0 + z*z * sin_cs_result.val); } else { /* octant == 2 */ gsl_sf_result cos_cs_result; const double t = 8.0*fabs(z)/M_PI - 1.0; stat_cs = cheb_eval_e(&cos_cs, t, &cos_cs_result); result->val = 1.0 - 0.5*z*z * (1.0 - z*z * cos_cs_result.val); } result->val *= sgn_result; if(abs_x > 1.0/GSL_DBL_EPSILON) { result->err = fabs(result->val); } else if(abs_x > 100.0/GSL_SQRT_DBL_EPSILON) { result->err = 2.0 * abs_x * GSL_DBL_EPSILON * fabs(result->val); } else if(abs_x > 0.1/GSL_SQRT_DBL_EPSILON) { result->err = 2.0 * GSL_SQRT_DBL_EPSILON * fabs(result->val); } else { result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); } return stat_cs; } } } int gsl_sf_cos_e(double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ { const double P1 = 7.85398125648498535156e-1; const double P2 = 3.77489470793079817668e-8; const double P3 = 2.69515142907905952645e-15; const double abs_x = fabs(x); if(abs_x < GSL_ROOT4_DBL_EPSILON) { const double x2 = x*x; result->val = 1.0 - 0.5*x2; result->err = fabs(x2*x2/12.0); return GSL_SUCCESS; } else { double sgn_result = 1.0; double y = floor(abs_x/(0.25*M_PI)); int octant = y - ldexp(floor(ldexp(y,-3)),3); int stat_cs; double z; if(GSL_IS_ODD(octant)) { octant += 1; octant &= 07; y += 1.0; } if(octant > 3) { octant -= 4; sgn_result = -sgn_result; } if(octant > 1) { sgn_result = -sgn_result; } z = ((abs_x - y * P1) - y * P2) - y * P3; if(octant == 0) { gsl_sf_result cos_cs_result; const double t = 8.0*fabs(z)/M_PI - 1.0; stat_cs = cheb_eval_e(&cos_cs, t, &cos_cs_result); result->val = 1.0 - 0.5*z*z * (1.0 - z*z * cos_cs_result.val); } else { /* octant == 2 */ gsl_sf_result sin_cs_result; const double t = 8.0*fabs(z)/M_PI - 1.0; stat_cs = cheb_eval_e(&sin_cs, t, &sin_cs_result); result->val = z * (1.0 + z*z * sin_cs_result.val); } result->val *= sgn_result; if(abs_x > 1.0/GSL_DBL_EPSILON) { result->err = fabs(result->val); } else if(abs_x > 100.0/GSL_SQRT_DBL_EPSILON) { result->err = 2.0 * abs_x * GSL_DBL_EPSILON * fabs(result->val); } else if(abs_x > 0.1/GSL_SQRT_DBL_EPSILON) { result->err = 2.0 * GSL_SQRT_DBL_EPSILON * fabs(result->val); } else { result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); } return stat_cs; } } } int gsl_sf_hypot_e(const double x, const double y, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x == 0.0 && y == 0.0) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else { const double a = fabs(x); const double b = fabs(y); const double min = GSL_MIN_DBL(a,b); const double max = GSL_MAX_DBL(a,b); const double rat = min/max; const double root_term = sqrt(1.0 + rat*rat); if(max < GSL_DBL_MAX/root_term) { result->val = max * root_term; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR(result); } } } int gsl_sf_complex_sin_e(const double zr, const double zi, gsl_sf_result * szr, gsl_sf_result * szi) { /* CHECK_POINTER(szr) */ /* CHECK_POINTER(szi) */ if(fabs(zi) < 1.0) { double ch_m1, sh; sinh_series(zi, &sh); cosh_m1_series(zi, &ch_m1); szr->val = sin(zr)*(ch_m1 + 1.0); szi->val = cos(zr)*sh; szr->err = 2.0 * GSL_DBL_EPSILON * fabs(szr->val); szi->err = 2.0 * GSL_DBL_EPSILON * fabs(szi->val); return GSL_SUCCESS; } else if(fabs(zi) < GSL_LOG_DBL_MAX) { double ex = exp(zi); double ch = 0.5*(ex+1.0/ex); double sh = 0.5*(ex-1.0/ex); szr->val = sin(zr)*ch; szi->val = cos(zr)*sh; szr->err = 2.0 * GSL_DBL_EPSILON * fabs(szr->val); szi->err = 2.0 * GSL_DBL_EPSILON * fabs(szi->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR_2(szr, szi); } } int gsl_sf_complex_cos_e(const double zr, const double zi, gsl_sf_result * czr, gsl_sf_result * czi) { /* CHECK_POINTER(czr) */ /* CHECK_POINTER(czi) */ if(fabs(zi) < 1.0) { double ch_m1, sh; sinh_series(zi, &sh); cosh_m1_series(zi, &ch_m1); czr->val = cos(zr)*(ch_m1 + 1.0); czi->val = -sin(zr)*sh; czr->err = 2.0 * GSL_DBL_EPSILON * fabs(czr->val); czi->err = 2.0 * GSL_DBL_EPSILON * fabs(czi->val); return GSL_SUCCESS; } else if(fabs(zi) < GSL_LOG_DBL_MAX) { double ex = exp(zi); double ch = 0.5*(ex+1.0/ex); double sh = 0.5*(ex-1.0/ex); czr->val = cos(zr)*ch; czi->val = -sin(zr)*sh; czr->err = 2.0 * GSL_DBL_EPSILON * fabs(czr->val); czi->err = 2.0 * GSL_DBL_EPSILON * fabs(czi->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR_2(czr,czi); } } int gsl_sf_complex_logsin_e(const double zr, const double zi, gsl_sf_result * lszr, gsl_sf_result * lszi) { /* CHECK_POINTER(lszr) */ /* CHECK_POINTER(lszi) */ if(zi > 60.0) { lszr->val = -M_LN2 + zi; lszi->val = 0.5*M_PI - zr; lszr->err = 2.0 * GSL_DBL_EPSILON * fabs(lszr->val); lszi->err = 2.0 * GSL_DBL_EPSILON * fabs(lszi->val); } else if(zi < -60.0) { lszr->val = -M_LN2 - zi; lszi->val = -0.5*M_PI + zr; lszr->err = 2.0 * GSL_DBL_EPSILON * fabs(lszr->val); lszi->err = 2.0 * GSL_DBL_EPSILON * fabs(lszi->val); } else { gsl_sf_result sin_r, sin_i; int status; gsl_sf_complex_sin_e(zr, zi, &sin_r, &sin_i); /* ok by construction */ status = gsl_sf_complex_log_e(sin_r.val, sin_i.val, lszr, lszi); if(status == GSL_EDOM) { DOMAIN_ERROR_2(lszr, lszi); } } return gsl_sf_angle_restrict_symm_e(&(lszi->val)); } int gsl_sf_lnsinh_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x <= 0.0) { DOMAIN_ERROR(result); } else if(fabs(x) < 1.0) { double eps; sinh_series(x, &eps); result->val = log(eps); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < -0.5*GSL_LOG_DBL_EPSILON) { result->val = x + log(0.5*(1.0 - exp(-2.0*x))); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { result->val = -M_LN2 + x; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_lncosh_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(fabs(x) < 1.0) { double eps; cosh_m1_series(x, &eps); return gsl_sf_log_1plusx_e(eps, result); } else if(x < -0.5*GSL_LOG_DBL_EPSILON) { result->val = x + log(0.5*(1.0 + exp(-2.0*x))); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { result->val = -M_LN2 + x; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } /* inline int gsl_sf_sincos_e(const double theta, double * s, double * c) { double tan_half = tan(0.5 * theta); double den = 1. + tan_half*tan_half; double cos_theta = (1.0 - tan_half*tan_half) / den; double sin_theta = 2.0 * tan_half / den; } */ int gsl_sf_polar_to_rect(const double r, const double theta, gsl_sf_result * x, gsl_sf_result * y) { double t = theta; int status = gsl_sf_angle_restrict_symm_e(&t); double c = cos(t); double s = sin(t); x->val = r * cos(t); y->val = r * sin(t); x->err = r * fabs(s * GSL_DBL_EPSILON * t); x->err += 2.0 * GSL_DBL_EPSILON * fabs(x->val); y->err = r * fabs(c * GSL_DBL_EPSILON * t); y->err += 2.0 * GSL_DBL_EPSILON * fabs(y->val); return status; } int gsl_sf_rect_to_polar(const double x, const double y, gsl_sf_result * r, gsl_sf_result * theta) { int stat_h = gsl_sf_hypot_e(x, y, r); if(r->val > 0.0) { theta->val = atan2(y, x); theta->err = 2.0 * GSL_DBL_EPSILON * fabs(theta->val); return stat_h; } else { DOMAIN_ERROR(theta); } } int gsl_sf_angle_restrict_symm_err_e(const double theta, gsl_sf_result * result) { /* synthetic extended precision constants */ const double P1 = 4 * 7.8539812564849853515625e-01; const double P2 = 4 * 3.7748947079307981766760e-08; const double P3 = 4 * 2.6951514290790594840552e-15; const double TwoPi = 2*(P1 + P2 + P3); const double y = 2*floor(theta/TwoPi); double r = ((theta - y*P1) - y*P2) - y*P3; if(r > M_PI) r -= TwoPi; result->val = r; if(theta > 0.0625/GSL_DBL_EPSILON) { result->err = fabs(result->val); GSL_ERROR ("error", GSL_ELOSS); } else if(theta > 0.0625/GSL_SQRT_DBL_EPSILON) { result->err = GSL_SQRT_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_angle_restrict_pos_err_e(const double theta, gsl_sf_result * result) { /* synthetic extended precision constants */ const double P1 = 4 * 7.85398125648498535156e-01; const double P2 = 4 * 3.77489470793079817668e-08; const double P3 = 4 * 2.69515142907905952645e-15; const double TwoPi = 2*(P1 + P2 + P3); const double y = 2*floor(theta/TwoPi); result->val = ((theta - y*P1) - y*P2) - y*P3; if(theta > 0.0625/GSL_DBL_EPSILON) { result->err = fabs(result->val); GSL_ERROR ("error", GSL_ELOSS); } else if(theta > 0.0625/GSL_SQRT_DBL_EPSILON) { result->err = GSL_SQRT_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_angle_restrict_symm_e(double * theta) { gsl_sf_result r; int stat = gsl_sf_angle_restrict_symm_err_e(*theta, &r); *theta = r.val; return stat; } int gsl_sf_angle_restrict_pos_e(double * theta) { gsl_sf_result r; int stat = gsl_sf_angle_restrict_pos_err_e(*theta, &r); *theta = r.val; return stat; } int gsl_sf_sin_err_e(const double x, const double dx, gsl_sf_result * result) { int stat_s = gsl_sf_sin_e(x, result); result->err += fabs(cos(x) * dx); result->err += GSL_DBL_EPSILON * fabs(result->val); return stat_s; } int gsl_sf_cos_err_e(const double x, const double dx, gsl_sf_result * result) { int stat_c = gsl_sf_cos_e(x, result); result->err += fabs(sin(x) * dx); result->err += GSL_DBL_EPSILON * fabs(result->val); return stat_c; } #if 0 int gsl_sf_sin_pi_x_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(-100.0 < x && x < 100.0) { result->val = sin(M_PI * x) / (M_PI * x); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { const double N = floor(x + 0.5); const double f = x - N; if(N < INT_MAX && N > INT_MIN) { /* Make it an integer if we can. Saves another * call to floor(). */ const int intN = (int)N; const double sign = ( GSL_IS_ODD(intN) ? -1.0 : 1.0 ); result->val = sign * sin(M_PI * f); result->err = GSL_DBL_EPSILON * fabs(result->val); } else if(N > 2.0/GSL_DBL_EPSILON || N < -2.0/GSL_DBL_EPSILON) { /* All integer-valued floating point numbers * bigger than 2/eps=2^53 are actually even. */ result->val = 0.0; result->err = 0.0; } else { const double resN = N - 2.0*floor(0.5*N); /* 0 for even N, 1 for odd N */ const double sign = ( fabs(resN) > 0.5 ? -1.0 : 1.0 ); result->val = sign * sin(M_PI*f); result->err = GSL_DBL_EPSILON * fabs(result->val); } return GSL_SUCCESS; } } #endif int gsl_sf_sinc_e(double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ { const double ax = fabs(x); if(ax < 0.8) { /* Do not go to the limit of the fit since * there is a zero there and the Chebyshev * accuracy will go to zero. */ return cheb_eval_e(&sinc_cs, 2.0*ax-1.0, result); } else if(ax < 100.0) { /* Small arguments are no problem. * We trust the library sin() to * roughly machine precision. */ result->val = sin(M_PI * ax)/(M_PI * ax); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { /* Large arguments must be handled separately. */ const double r = M_PI*ax; gsl_sf_result s; int stat_s = gsl_sf_sin_e(r, &s); result->val = s.val/r; result->err = s.err/r + 2.0 * GSL_DBL_EPSILON * fabs(result->val); return stat_s; } } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_sin(const double x) { EVAL_RESULT(gsl_sf_sin_e(x, &result)); } double gsl_sf_cos(const double x) { EVAL_RESULT(gsl_sf_cos_e(x, &result)); } double gsl_sf_hypot(const double x, const double y) { EVAL_RESULT(gsl_sf_hypot_e(x, y, &result)); } double gsl_sf_lnsinh(const double x) { EVAL_RESULT(gsl_sf_lnsinh_e(x, &result)); } double gsl_sf_lncosh(const double x) { EVAL_RESULT(gsl_sf_lncosh_e(x, &result)); } double gsl_sf_angle_restrict_symm(const double theta) { double result = theta; EVAL_DOUBLE(gsl_sf_angle_restrict_symm_e(&result)); } double gsl_sf_angle_restrict_pos(const double theta) { double result = theta; EVAL_DOUBLE(gsl_sf_angle_restrict_pos_e(&result)); } #if 0 double gsl_sf_sin_pi_x(const double x) { EVAL_RESULT(gsl_sf_sin_pi_x_e(x, &result)); } #endif double gsl_sf_sinc(const double x) { EVAL_RESULT(gsl_sf_sinc_e(x, &result)); } bogofilter-1.2.4/gsl/specfunc/elementary.c0000644000175000017500000000461012163572265016754 0ustar sezsez/* specfunc/elementary.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include "error.h" #include "check.h" int gsl_sf_multiply_e(const double x, const double y, gsl_sf_result * result) { const double ax = fabs(x); const double ay = fabs(y); if(x == 0.0 || y == 0.0) { /* It is necessary to eliminate this immediately. */ result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if((ax <= 1.0 && ay >= 1.0) || (ay <= 1.0 && ax >= 1.0)) { /* Straddling 1.0 is always safe. */ result->val = x*y; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { const double f = 1.0 - 2.0 * GSL_DBL_EPSILON; const double min = GSL_MIN_DBL(fabs(x), fabs(y)); const double max = GSL_MAX_DBL(fabs(x), fabs(y)); if(max < 0.9 * GSL_SQRT_DBL_MAX || min < (f * DBL_MAX)/max) { result->val = GSL_COERCE_DBL(x*y); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); CHECK_UNDERFLOW(result); return GSL_SUCCESS; } else { OVERFLOW_ERROR(result); } } } int gsl_sf_multiply_err_e(const double x, const double dx, const double y, const double dy, gsl_sf_result * result) { int status = gsl_sf_multiply_e(x, y, result); result->err += fabs(dx*y) + fabs(dy*x); return status; } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_multiply(const double x, const double y) { EVAL_RESULT(gsl_sf_multiply_e(x, y, &result)); } bogofilter-1.2.4/gsl/specfunc/gamma.c0000644000175000017500000016630112163572265015677 0ustar sezsez/* specfunc/gamma.c * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #include #include #include #include #include #include #include #include #include "error.h" #include "check.h" #include "chebyshev.h" #include "cheb_eval.c" #define LogRootTwoPi_ 0.9189385332046727418 /*-*-*-*-*-*-*-*-*-*-*-* Private Section *-*-*-*-*-*-*-*-*-*-*-*/ #define FACT_TABLE_MAX 170 #define FACT_TABLE_SIZE (FACT_TABLE_MAX+1) static struct {int n; double f; long i; } fact_table[FACT_TABLE_SIZE] = { { 0, 1.0, 1L }, { 1, 1.0, 1L }, { 2, 2.0, 2L }, { 3, 6.0, 6L }, { 4, 24.0, 24L }, { 5, 120.0, 120L }, { 6, 720.0, 720L }, { 7, 5040.0, 5040L }, { 8, 40320.0, 40320L }, { 9, 362880.0, 362880L }, { 10, 3628800.0, 3628800L }, { 11, 39916800.0, 39916800L }, { 12, 479001600.0, 479001600L }, { 13, 6227020800.0, 0 }, { 14, 87178291200.0, 0 }, { 15, 1307674368000.0, 0 }, { 16, 20922789888000.0, 0 }, { 17, 355687428096000.0, 0 }, { 18, 6402373705728000.0, 0 }, { 19, 121645100408832000.0, 0 }, { 20, 2432902008176640000.0, 0 }, { 21, 51090942171709440000.0, 0 }, { 22, 1124000727777607680000.0, 0 }, { 23, 25852016738884976640000.0, 0 }, { 24, 620448401733239439360000.0, 0 }, { 25, 15511210043330985984000000.0, 0 }, { 26, 403291461126605635584000000.0, 0 }, { 27, 10888869450418352160768000000.0, 0 }, { 28, 304888344611713860501504000000.0, 0 }, { 29, 8841761993739701954543616000000.0, 0 }, { 30, 265252859812191058636308480000000.0, 0 }, { 31, 8222838654177922817725562880000000.0, 0 }, { 32, 263130836933693530167218012160000000.0, 0 }, { 33, 8683317618811886495518194401280000000.0, 0 }, { 34, 2.95232799039604140847618609644e38, 0 }, { 35, 1.03331479663861449296666513375e40, 0 }, { 36, 3.71993326789901217467999448151e41, 0 }, { 37, 1.37637530912263450463159795816e43, 0 }, { 38, 5.23022617466601111760007224100e44, 0 }, { 39, 2.03978820811974433586402817399e46, 0 }, { 40, 8.15915283247897734345611269600e47, 0 }, { 41, 3.34525266131638071081700620534e49, 0 }, { 42, 1.40500611775287989854314260624e51, 0 }, { 43, 6.04152630633738356373551320685e52, 0 }, { 44, 2.65827157478844876804362581101e54, 0 }, { 45, 1.19622220865480194561963161496e56, 0 }, { 46, 5.50262215981208894985030542880e57, 0 }, { 47, 2.58623241511168180642964355154e59, 0 }, { 48, 1.24139155925360726708622890474e61, 0 }, { 49, 6.08281864034267560872252163321e62, 0 }, { 50, 3.04140932017133780436126081661e64, 0 }, { 51, 1.55111875328738228022424301647e66, 0 }, { 52, 8.06581751709438785716606368564e67, 0 }, { 53, 4.27488328406002556429801375339e69, 0 }, { 54, 2.30843697339241380472092742683e71, 0 }, { 55, 1.26964033536582759259651008476e73, 0 }, { 56, 7.10998587804863451854045647464e74, 0 }, { 57, 4.05269195048772167556806019054e76, 0 }, { 58, 2.35056133128287857182947491052e78, 0 }, { 59, 1.38683118545689835737939019720e80, 0 }, { 60, 8.32098711274139014427634118320e81, 0 }, { 61, 5.07580213877224798800856812177e83, 0 }, { 62, 3.14699732603879375256531223550e85, 0 }, { 63, 1.982608315404440064116146708360e87, 0 }, { 64, 1.268869321858841641034333893350e89, 0 }, { 65, 8.247650592082470666723170306800e90, 0 }, { 66, 5.443449390774430640037292402480e92, 0 }, { 67, 3.647111091818868528824985909660e94, 0 }, { 68, 2.480035542436830599600990418570e96, 0 }, { 69, 1.711224524281413113724683388810e98, 0 }, { 70, 1.197857166996989179607278372170e100, 0 }, { 71, 8.504785885678623175211676442400e101, 0 }, { 72, 6.123445837688608686152407038530e103, 0 }, { 73, 4.470115461512684340891257138130e105, 0 }, { 74, 3.307885441519386412259530282210e107, 0 }, { 75, 2.480914081139539809194647711660e109, 0 }, { 76, 1.885494701666050254987932260860e111, 0 }, { 77, 1.451830920282858696340707840860e113, 0 }, { 78, 1.132428117820629783145752115870e115, 0 }, { 79, 8.946182130782975286851441715400e116, 0 }, { 80, 7.156945704626380229481153372320e118, 0 }, { 81, 5.797126020747367985879734231580e120, 0 }, { 82, 4.753643337012841748421382069890e122, 0 }, { 83, 3.945523969720658651189747118010e124, 0 }, { 84, 3.314240134565353266999387579130e126, 0 }, { 85, 2.817104114380550276949479442260e128, 0 }, { 86, 2.422709538367273238176552320340e130, 0 }, { 87, 2.107757298379527717213600518700e132, 0 }, { 88, 1.854826422573984391147968456460e134, 0 }, { 89, 1.650795516090846108121691926250e136, 0 }, { 90, 1.485715964481761497309522733620e138, 0 }, { 91, 1.352001527678402962551665687590e140, 0 }, { 92, 1.243841405464130725547532432590e142, 0 }, { 93, 1.156772507081641574759205162310e144, 0 }, { 94, 1.087366156656743080273652852570e146, 0 }, { 95, 1.032997848823905926259970209940e148, 0 }, { 96, 9.916779348709496892095714015400e149, 0 }, { 97, 9.619275968248211985332842594960e151, 0 }, { 98, 9.426890448883247745626185743100e153, 0 }, { 99, 9.332621544394415268169923885600e155, 0 }, { 100, 9.33262154439441526816992388563e157, 0 }, { 101, 9.42594775983835942085162312450e159, 0 }, { 102, 9.61446671503512660926865558700e161, 0 }, { 103, 9.90290071648618040754671525458e163, 0 }, { 104, 1.02990167451456276238485838648e166, 0 }, { 105, 1.08139675824029090050410130580e168, 0 }, { 106, 1.146280563734708354534347384148e170, 0 }, { 107, 1.226520203196137939351751701040e172, 0 }, { 108, 1.324641819451828974499891837120e174, 0 }, { 109, 1.443859583202493582204882102460e176, 0 }, { 110, 1.588245541522742940425370312710e178, 0 }, { 111, 1.762952551090244663872161047110e180, 0 }, { 112, 1.974506857221074023536820372760e182, 0 }, { 113, 2.231192748659813646596607021220e184, 0 }, { 114, 2.543559733472187557120132004190e186, 0 }, { 115, 2.925093693493015690688151804820e188, 0 }, { 116, 3.393108684451898201198256093590e190, 0 }, { 117, 3.96993716080872089540195962950e192, 0 }, { 118, 4.68452584975429065657431236281e194, 0 }, { 119, 5.57458576120760588132343171174e196, 0 }, { 120, 6.68950291344912705758811805409e198, 0 }, { 121, 8.09429852527344373968162284545e200, 0 }, { 122, 9.87504420083360136241157987140e202, 0 }, { 123, 1.21463043670253296757662432419e205, 0 }, { 124, 1.50614174151114087979501416199e207, 0 }, { 125, 1.88267717688892609974376770249e209, 0 }, { 126, 2.37217324288004688567714730514e211, 0 }, { 127, 3.01266001845765954480997707753e213, 0 }, { 128, 3.85620482362580421735677065923e215, 0 }, { 129, 4.97450422247728744039023415041e217, 0 }, { 130, 6.46685548922047367250730439554e219, 0 }, { 131, 8.47158069087882051098456875820e221, 0 }, { 132, 1.11824865119600430744996307608e224, 0 }, { 133, 1.48727070609068572890845089118e226, 0 }, { 134, 1.99294274616151887673732419418e228, 0 }, { 135, 2.69047270731805048359538766215e230, 0 }, { 136, 3.65904288195254865768972722052e232, 0 }, { 137, 5.01288874827499166103492629211e234, 0 }, { 138, 6.91778647261948849222819828311e236, 0 }, { 139, 9.61572319694108900419719561353e238, 0 }, { 140, 1.34620124757175246058760738589e241, 0 }, { 141, 1.89814375907617096942852641411e243, 0 }, { 142, 2.69536413788816277658850750804e245, 0 }, { 143, 3.85437071718007277052156573649e247, 0 }, { 144, 5.55029383273930478955105466055e249, 0 }, { 145, 8.04792605747199194484902925780e251, 0 }, { 146, 1.17499720439091082394795827164e254, 0 }, { 147, 1.72724589045463891120349865931e256, 0 }, { 148, 2.55632391787286558858117801578e258, 0 }, { 149, 3.80892263763056972698595524351e260, 0 }, { 150, 5.71338395644585459047893286526e262, 0 }, { 151, 8.62720977423324043162318862650e264, 0 }, { 152, 1.31133588568345254560672467123e267, 0 }, { 153, 2.00634390509568239477828874699e269, 0 }, { 154, 3.08976961384735088795856467036e271, 0 }, { 155, 4.78914290146339387633577523906e273, 0 }, { 156, 7.47106292628289444708380937294e275, 0 }, { 157, 1.17295687942641442819215807155e278, 0 }, { 158, 1.85327186949373479654360975305e280, 0 }, { 159, 2.94670227249503832650433950735e282, 0 }, { 160, 4.71472363599206132240694321176e284, 0 }, { 161, 7.59070505394721872907517857094e286, 0 }, { 162, 1.22969421873944943411017892849e289, 0 }, { 163, 2.00440157654530257759959165344e291, 0 }, { 164, 3.28721858553429622726333031164e293, 0 }, { 165, 5.42391066613158877498449501421e295, 0 }, { 166, 9.00369170577843736647426172359e297, 0 }, { 167, 1.50361651486499904020120170784e300, 0 }, { 168, 2.52607574497319838753801886917e302, 0 }, { 169, 4.26906800900470527493925188890e304, 0 }, { 170, 7.25741561530799896739672821113e306, 0 }, /* { 171, 1.24101807021766782342484052410e309, 0 }, { 172, 2.13455108077438865629072570146e311, 0 }, { 173, 3.69277336973969237538295546352e313, 0 }, { 174, 6.42542566334706473316634250653e315, 0 }, { 175, 1.12444949108573632830410993864e318, 0 }, { 176, 1.97903110431089593781523349201e320, 0 }, { 177, 3.50288505463028580993296328086e322, 0 }, { 178, 6.23513539724190874168067463993e324, 0 }, { 179, 1.11608923610630166476084076055e327, 0 }, { 180, 2.00896062499134299656951336898e329, 0 }, { 181, 3.63621873123433082379081919786e331, 0 }, { 182, 6.61791809084648209929929094011e333, 0 }, { 183, 1.21107901062490622417177024204e336, 0 }, { 184, 2.22838537954982745247605724535e338, 0 }, { 185, 4.12251295216718078708070590390e340, 0 }, { 186, 7.66787409103095626397011298130e342, 0 }, { 187, 1.43389245502278882136241112750e345, 0 }, { 188, 2.69571781544284298416133291969e347, 0 }, { 189, 5.09490667118697324006491921822e349, 0 }, { 190, 9.68032267525524915612334651460e351, 0 }, { 191, 1.84894163097375258881955918429e354, 0 }, { 192, 3.54996793146960497053355363384e356, 0 }, { 193, 6.85143810773633759312975851330e358, 0 }, { 194, 1.32917899290084949306717315158e361, 0 }, { 195, 2.59189903615665651148098764559e363, 0 }, { 196, 5.08012211086704676250273578535e365, 0 }, { 197, 1.00078405584080821221303894971e368, 0 }, { 198, 1.98155243056480026018181712043e370, 0 }, { 199, 3.94328933682395251776181606966e372, 0 }, { 200, 7.88657867364790503552363213932e374, 0 } */ }; #define DOUB_FACT_TABLE_MAX 297 #define DOUB_FACT_TABLE_SIZE (DOUB_FACT_TABLE_MAX+1) static struct {int n; double f; long i; } doub_fact_table[DOUB_FACT_TABLE_SIZE] = { { 0, 1.000000000000000000000000000, 1L }, { 1, 1.000000000000000000000000000, 1L }, { 2, 2.000000000000000000000000000, 2L }, { 3, 3.000000000000000000000000000, 3L }, { 4, 8.000000000000000000000000000, 8L }, { 5, 15.00000000000000000000000000, 15L }, { 6, 48.00000000000000000000000000, 48L }, { 7, 105.0000000000000000000000000, 105L }, { 8, 384.0000000000000000000000000, 384L }, { 9, 945.0000000000000000000000000, 945L }, { 10, 3840.000000000000000000000000, 3840L }, { 11, 10395.00000000000000000000000, 10395L }, { 12, 46080.00000000000000000000000, 46080L }, { 13, 135135.0000000000000000000000, 135135L }, { 14, 645120.00000000000000000000000, 645120L }, { 15, 2.02702500000000000000000000000e6, 2027025L }, { 16, 1.03219200000000000000000000000e7, 10321920L }, { 17, 3.4459425000000000000000000000e7, 34459425L }, { 18, 1.85794560000000000000000000000e8, 185794560L }, { 19, 6.5472907500000000000000000000e8, 0 }, { 20, 3.7158912000000000000000000000e9, 0 }, { 21, 1.37493105750000000000000000000e10, 0 }, { 22, 8.1749606400000000000000000000e10, 0 }, { 23, 3.1623414322500000000000000000e11, 0 }, { 24, 1.96199055360000000000000000000e12, 0 }, { 25, 7.9058535806250000000000000000e12, 0 }, { 26, 5.1011754393600000000000000000e13, 0 }, { 27, 2.13458046676875000000000000000e14, 0 }, { 28, 1.42832912302080000000000000000e15, 0 }, { 29, 6.1902833536293750000000000000e15, 0 }, { 30, 4.2849873690624000000000000000e16, 0 }, { 31, 1.91898783962510625000000000000e17, 0 }, { 32, 1.37119595809996800000000000000e18, 0 }, { 33, 6.3326598707628506250000000000e18, 0 }, { 34, 4.6620662575398912000000000000e19, 0 }, { 35, 2.21643095476699771875000000000e20, 0 }, { 36, 1.67834385271436083200000000000e21, 0 }, { 37, 8.2007945326378915593750000000e21, 0 }, { 38, 6.3777066403145711616000000000e22, 0 }, { 39, 3.1983098677287777081562500000e23, 0 }, { 40, 2.55108265612582846464000000000e24, 0 }, { 41, 1.31130704576879886034406250000e25, 0 }, { 42, 1.07145471557284795514880000000e26, 0 }, { 43, 5.6386202968058350994794687500e26, 0 }, { 44, 4.7144007485205310026547200000e27, 0 }, { 45, 2.53737913356262579476576093750e28, 0 }, { 46, 2.16862434431944426122117120000e29, 0 }, { 47, 1.19256819277443412353990764062e30, 0 }, { 48, 1.04093968527333324538616217600e31, 0 }, { 49, 5.8435841445947272053455474391e31, 0 }, { 50, 5.2046984263666662269308108800e32, 0 }, { 51, 2.98022791374331087472622919392e33, 0 }, { 52, 2.70644318171066643800402165760e34, 0 }, { 53, 1.57952079428395476360490147278e35, 0 }, { 54, 1.46147931812375987652217169510e36, 0 }, { 55, 8.6873643685617511998269581003e36, 0 }, { 56, 8.1842841814930553085241614926e37, 0 }, { 57, 4.9517976900801981839013661172e38, 0 }, { 58, 4.7468848252659720789440136657e39, 0 }, { 59, 2.92156063714731692850180600912e40, 0 }, { 60, 2.84813089515958324736640819942e41, 0 }, { 61, 1.78215198865986332638610166557e42, 0 }, { 62, 1.76584115499894161336717308364e43, 0 }, { 63, 1.12275575285571389562324404931e44, 0 }, { 64, 1.13013833919932263255499077353e45, 0 }, { 65, 7.2979123935621403215510863205e45, 0 }, { 66, 7.4589130387155293748629391053e46, 0 }, { 67, 4.8896013036866340154392278347e47, 0 }, { 68, 5.0720608663265599749067985916e48, 0 }, { 69, 3.3738248995437774706530672060e49, 0 }, { 70, 3.5504426064285919824347590141e50, 0 }, { 71, 2.39541567867608200416367771623e51, 0 }, { 72, 2.55631867662858622735302649017e52, 0 }, { 73, 1.74865344543353986303948473285e53, 0 }, { 74, 1.89167582070515380824123960272e54, 0 }, { 75, 1.31149008407515489727961354964e55, 0 }, { 76, 1.43767362373591689426334209807e56, 0 }, { 77, 1.00984736473786927090530243322e57, 0 }, { 78, 1.12138542651401517752540683649e58, 0 }, { 79, 7.9777941814291672401518892225e58, 0 }, { 80, 8.9710834121121214202032546920e59, 0 }, { 81, 6.4620132869576254645230302702e60, 0 }, { 82, 7.3562883979319395645666688474e61, 0 }, { 83, 5.3634710281748291355541151243e62, 0 }, { 84, 6.1792822542628292342360018318e63, 0 }, { 85, 4.5589503739486047652209978556e64, 0 }, { 86, 5.3141827386660331414429615754e65, 0 }, { 87, 3.9662868253352861457422681344e66, 0 }, { 88, 4.6764808100261091644698061863e67, 0 }, { 89, 3.5299952745484046697106186396e68, 0 }, { 90, 4.2088327290234982480228255677e69, 0 }, { 91, 3.2122956998390482494366629620e70, 0 }, { 92, 3.8721261107016183881809995223e71, 0 }, { 93, 2.98743500085031487197609655470e72, 0 }, { 94, 3.6397985440595212848901395509e73, 0 }, { 95, 2.83806325080779912837729172696e74, 0 }, { 96, 3.4942066022971404334945339689e75, 0 }, { 97, 2.75292135328356515452597297515e76, 0 }, { 98, 3.4243224702511976248246432895e77, 0 }, { 99, 2.72539213975072950298071324540e78, 0 }, { 100, 3.4243224702511976248246432895e79, 0 }, { 101, 2.75264606114823679801052037785e80, 0 }, { 102, 3.4928089196562215773211361553e81, 0 }, { 103, 2.83522544298268390195083598919e82, 0 }, { 104, 3.6325212764424704404139816015e83, 0 }, { 105, 2.97698671513181809704837778865e84, 0 }, { 106, 3.8504725530290186668388204976e85, 0 }, { 107, 3.1853757851910453638417642339e86, 0 }, { 108, 4.1585103572713401601859261374e87, 0 }, { 109, 3.4720596058582394465875230149e88, 0 }, { 110, 4.5743613929984741762045187512e89, 0 }, { 111, 3.8539861625026457857121505465e90, 0 }, { 112, 5.1232847601582910773490610013e91, 0 }, { 113, 4.3550043636279897378547301176e92, 0 }, { 114, 5.8405446265804518281779295415e93, 0 }, { 115, 5.0082550181721881985329396352e94, 0 }, { 116, 6.7750317668333241206863982681e95, 0 }, { 117, 5.8596583712614601922835393732e96, 0 }, { 118, 7.9945374848633224624099499564e97, 0 }, { 119, 6.9729934618011376288174118541e98, 0 }, { 120, 9.5934449818359869548919399477e99, 0 }, { 121, 8.4373220887793765308690683435e100, 0 }, { 122, 1.17040028778399040849681667362e102, 0 }, { 123, 1.03779061691986331329689540625e103, 0 }, { 124, 1.45129635685214810653605267528e104, 0 }, { 125, 1.29723827114982914162111925781e105, 0 }, { 126, 1.82863340963370661423542637086e106, 0 }, { 127, 1.64749260436028300985882145742e107, 0 }, { 128, 2.34065076433114446622134575470e108, 0 }, { 129, 2.12526545962476508271787968008e109, 0 }, { 130, 3.04284599363048780608774948111e110, 0 }, { 131, 2.78409775210844225836042238090e111, 0 }, { 132, 4.0165567115922439040358293151e112, 0 }, { 133, 3.7028500103042282036193617666e113, 0 }, { 134, 5.3821859935336068314080112822e114, 0 }, { 135, 4.9988475139107080748861383849e115, 0 }, { 136, 7.3197729512057052907148953438e116, 0 }, { 137, 6.8484210940576700625940095873e117, 0 }, { 138, 1.01012866726638733011865555744e119, 0 }, { 139, 9.5193053207401613870056733264e119, 0 }, { 140, 1.41418013417294226216611778042e121, 0 }, { 141, 1.34222205022436275556779993902e122, 0 }, { 142, 2.00813579052557801227588724819e123, 0 }, { 143, 1.91937753182083874046195391280e124, 0 }, { 144, 2.89171553835683233767727763739e125, 0 }, { 145, 2.78309742114021617366983317355e126, 0 }, { 146, 4.2219046860009752130088253506e127, 0 }, { 147, 4.0911532090761177752946547651e128, 0 }, { 148, 6.2484189352814433152530615189e129, 0 }, { 149, 6.0958182815234154851890356000e130, 0 }, { 150, 9.3726284029221649728795922783e131, 0 }, { 151, 9.2046856051003573826354437561e132, 0 }, { 152, 1.42463951724416907587769802630e134, 0 }, { 153, 1.40831689758035467954322289468e135, 0 }, { 154, 2.19394485655602037685165496051e136, 0 }, { 155, 2.18289119124954975329199548675e137, 0 }, { 156, 3.4225539762273917878885817384e138, 0 }, { 157, 3.4271391702617931126684329142e139, 0 }, { 158, 5.4076352824392790248639591467e140, 0 }, { 159, 5.4491512807162510491428083336e141, 0 }, { 160, 8.6522164519028464397823346347e142, 0 }, { 161, 8.7731335619531641891199214170e143, 0 }, { 162, 1.40165906520826112324473821082e145, 0 }, { 163, 1.43002077059836576282654719098e146, 0 }, { 164, 2.29872086694154824212137066574e147, 0 }, { 165, 2.35953427148730350866380286512e148, 0 }, { 166, 3.8158766391229700819214753051e149, 0 }, { 167, 3.9404222333837968594685507847e150, 0 }, { 168, 6.4106727537265897376280785126e151, 0 }, { 169, 6.6593135744186166925018508262e152, 0 }, { 170, 1.08981436813352025539677334714e154, 0 }, { 171, 1.13874262122558345441781649128e155, 0 }, { 172, 1.87448071318965483928245015709e156, 0 }, { 173, 1.97002473472025937614282252992e157, 0 }, { 174, 3.2615964409499994203514632733e158, 0 }, { 175, 3.4475432857604539082499394274e159, 0 }, { 176, 5.7404097360719989798185753611e160, 0 }, { 177, 6.1021516157960034176023927864e161, 0 }, { 178, 1.02179293302081581840770641427e163, 0 }, { 179, 1.09228513922748461175082830877e164, 0 }, { 180, 1.83922727943746847313387154568e165, 0 }, { 181, 1.97703610200174714726899923887e166, 0 }, { 182, 3.3473936485761926211036462131e167, 0 }, { 183, 3.6179760666631972795022686071e168, 0 }, { 184, 6.1592043133801944228307090322e169, 0 }, { 185, 6.6932557233269149670791969232e170, 0 }, { 186, 1.14561200228871616264651187999e172, 0 }, { 187, 1.25163882026213309884380982464e173, 0 }, { 188, 2.15375056430278638577544233437e174, 0 }, { 189, 2.36559737029543155681480056857e175, 0 }, { 190, 4.0921260721752941329733404353e176, 0 }, { 191, 4.5182909772642742735162690860e177, 0 }, { 192, 7.8568820585765647353088136358e178, 0 }, { 193, 8.7203015861200493478863993359e179, 0 }, { 194, 1.52423511936385355864990984535e181, 0 }, { 195, 1.70045880929340962283784787050e182, 0 }, { 196, 2.98750083395315297495382329688e183, 0 }, { 197, 3.3499038543080169569905603049e184, 0 }, { 198, 5.9152516512272428904085701278e185, 0 }, { 199, 6.6663086700729537444112150067e186, 0 }, { 200, 1.18305033024544857808171402556e188, 0 }, { 201, 1.33992804268466370262665421635e189, 0 }, { 202, 2.38976166709580612772506233164e190, 0 }, { 203, 2.72005392664986731633210805920e191, 0 }, { 204, 4.8751138008754445005591271565e192, 0 }, { 205, 5.5761105496322279984808215214e193, 0 }, { 206, 1.00427344298034156711518019425e195, 0 }, { 207, 1.15425488377387119568553005492e196, 0 }, { 208, 2.08888876139911045959957480403e197, 0 }, { 209, 2.41239270708739079898275781478e198, 0 }, { 210, 4.3866663989381319651591070885e199, 0 }, { 211, 5.0901486119543945858536189892e200, 0 }, { 212, 9.2997327657488397661373070276e201, 0 }, { 213, 1.08420165434628604678682084470e203, 0 }, { 214, 1.99014281187025170995338370390e204, 0 }, { 215, 2.33103355684451500059166481610e205, 0 }, { 216, 4.2987084736397436934993088004e206, 0 }, { 217, 5.0583428183525975512839126509e207, 0 }, { 218, 9.3711844725346412518284931849e208, 0 }, { 219, 1.10777707721921886373117687056e210, 0 }, { 220, 2.06166058395762107540226850068e211, 0 }, { 221, 2.44818734065447368884590088393e212, 0 }, { 222, 4.5768864963859187873930360715e213, 0 }, { 223, 5.4594577696594763261263589712e214, 0 }, { 224, 1.02522257519044580837604008002e216, 0 }, { 225, 1.22837799817338217337843076851e217, 0 }, { 226, 2.31700301993040752692985058084e218, 0 }, { 227, 2.78841805585357753356903784452e219, 0 }, { 228, 5.2827668854413291614000593243e220, 0 }, { 229, 6.3854773479046925518730966640e221, 0 }, { 230, 1.21503638365150570712201364459e223, 0 }, { 231, 1.47504526736598397948268532937e224, 0 }, { 232, 2.81888441007149324052307165546e225, 0 }, { 233, 3.4368554729627426721946568174e226, 0 }, { 234, 6.5961895195672941828239876738e227, 0 }, { 235, 8.0766103614624452796574435210e228, 0 }, { 236, 1.55670072661788142714646109101e230, 0 }, { 237, 1.91415665566659953127881411447e231, 0 }, { 238, 3.7049477293505577966085773966e232, 0 }, { 239, 4.5748344070431728797563657336e233, 0 }, { 240, 8.8918745504413387118605857518e234, 0 }, { 241, 1.10253509209740466402128414180e236, 0 }, { 242, 2.15183364120680396827026175195e237, 0 }, { 243, 2.67916027379669333357172046456e238, 0 }, { 244, 5.2504740845446016825794386748e239, 0 }, { 245, 6.5639426708018986672507151382e240, 0 }, { 246, 1.29161662479797201391454191399e242, 0 }, { 247, 1.62129383968806897081092663913e243, 0 }, { 248, 3.2032092294989705945080639467e244, 0 }, { 249, 4.0370216608232917373192073314e245, 0 }, { 250, 8.0080230737474264862701598667e246, 0 }, { 251, 1.01329243686664622606712104019e248, 0 }, { 252, 2.01802181458435147454008028642e249, 0 }, { 253, 2.56362986527261495194981623168e250, 0 }, { 254, 5.1257754090442527453318039275e251, 0 }, { 255, 6.5372561564451681274720313908e252, 0 }, { 256, 1.31219850471532870280494180544e254, 0 }, { 257, 1.68007483220640820876031206743e255, 0 }, { 258, 3.3854721421655480532367498580e256, 0 }, { 259, 4.3513938154145972606892082546e257, 0 }, { 260, 8.8022275696304249384155496309e258, 0 }, { 261, 1.13571378582320988503988335446e260, 0 }, { 262, 2.30618362324317133386487400329e261, 0 }, { 263, 2.98692725671504199765489322224e262, 0 }, { 264, 6.0883247653619723214032673687e263, 0 }, { 265, 7.9153572302948612937854670389e264, 0 }, { 266, 1.61949438758628463749326912007e266, 0 }, { 267, 2.11340038048872796544071969939e267, 0 }, { 268, 4.3402449587312428284819612418e268, 0 }, { 269, 5.6850470235146782270355359914e269, 0 }, { 270, 1.17186613885743556369012953528e271, 0 }, { 271, 1.54064774337247779952663025366e272, 0 }, { 272, 3.1874758976922247332371523360e273, 0 }, { 273, 4.2059683394068643927077005925e274, 0 }, { 274, 8.7336839596766957690697974006e275, 0 }, { 275, 1.15664129333688770799461766294e277, 0 }, { 276, 2.41049677287076803226326408256e278, 0 }, { 277, 3.2038963825431789511450909263e279, 0 }, { 278, 6.7011810285807351296918741495e280, 0 }, { 279, 8.9388709072954692736948036845e281, 0 }, { 280, 1.87633068800260583631372476186e283, 0 }, { 281, 2.51182272495002686590823983534e284, 0 }, { 282, 5.2912525401673484584047038284e285, 0 }, { 283, 7.1084583116085760305203187340e286, 0 }, { 284, 1.50271572140752696218693588728e288, 0 }, { 285, 2.02591061880844416869829083919e289, 0 }, { 286, 4.2977669632255271118546366376e290, 0 }, { 287, 5.8143634759802347641640947085e291, 0 }, { 288, 1.23775688540895180821413535163e293, 0 }, { 289, 1.68035104455828784684342337075e294, 0 }, { 290, 3.5894949676859602438209925197e295, 0 }, { 291, 4.8898215396646176343143620089e296, 0 }, { 292, 1.04813253056430039119572981576e298, 0 }, { 293, 1.43271771112173296685410806860e299, 0 }, { 294, 3.08150963985904315011544565835e300, 0 }, { 295, 4.2265172478091122522196188024e301, 0 }, { 296, 9.1212685339827677243417191487e302, 0 }, { 297, 1.25527562259930633890922678431e304, 0 }, /* { 298, 2.71813802312686478185383230631e305, 0 }, { 299, 3.7532741115719259533385880851e306, 0 }, { 300, 8.1544140693805943455614969189e307, } */ }; /* Chebyshev coefficients for Gamma*(3/4(t+1)+1/2), -1val = (zr+0.5)*log1_r.val - zi*log1_i.val - (zr+7.5) + LogRootTwoPi_ + logAg_r.val; yi->val = zi*log1_r.val + (zr+0.5)*log1_i.val - zi + logAg_i.val; yr->err = 4.0 * GSL_DBL_EPSILON * fabs(yr->val); yi->err = 4.0 * GSL_DBL_EPSILON * fabs(yi->val); yi_tmp_val = yi->val; yi_tmp_err = yi->err; gsl_sf_angle_restrict_symm_err_e(yi_tmp_val, yi); yi->err += yi_tmp_err; return GSL_SUCCESS; } /* Lanczos method for real x > 0; * gamma=7, truncated at 1/(z+8) * [J. SIAM Numer. Anal, Ser. B, 1 (1964) 86] */ static int lngamma_lanczos(double x, gsl_sf_result * result) { int k; double Ag; double term1, term2; x -= 1.0; /* Lanczos writes z! instead of Gamma(z) */ Ag = lanczos_7_c[0]; for(k=1; k<=8; k++) { Ag += lanczos_7_c[k]/(x+k); } /* (x+0.5)*log(x+7.5) - (x+7.5) + LogRootTwoPi_ + log(Ag(x)) */ term1 = (x+0.5)*log((x+7.5)/M_E); term2 = LogRootTwoPi_ + log(Ag); result->val = term1 + (term2 - 7.0); result->err = 2.0 * GSL_DBL_EPSILON * (fabs(term1) + fabs(term2) + 7.0); result->err += GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } /* x = eps near zero * gives double-precision for |eps| < 0.02 */ static int lngamma_sgn_0(double eps, gsl_sf_result * lng, double * sgn) { /* calculate series for g(eps) = Gamma(eps) eps - 1/(1+eps) - eps/2 */ const double c1 = -0.07721566490153286061; const double c2 = -0.01094400467202744461; const double c3 = 0.09252092391911371098; const double c4 = -0.01827191316559981266; const double c5 = 0.01800493109685479790; const double c6 = -0.00685088537872380685; const double c7 = 0.00399823955756846603; const double c8 = -0.00189430621687107802; const double c9 = 0.00097473237804513221; const double c10 = -0.00048434392722255893; const double g6 = c6+eps*(c7+eps*(c8 + eps*(c9 + eps*c10))); const double g = eps*(c1+eps*(c2+eps*(c3+eps*(c4+eps*(c5+eps*g6))))); /* calculate Gamma(eps) eps, a positive quantity */ const double gee = g + 1.0/(1.0+eps) + 0.5*eps; lng->val = log(gee/fabs(eps)); lng->err = 4.0 * GSL_DBL_EPSILON * fabs(lng->val); *sgn = GSL_SIGN(eps); return GSL_SUCCESS; } /* x near a negative integer * Calculates sign as well as log(|gamma(x)|). * x = -N + eps * assumes N >= 1 */ static int lngamma_sgn_sing(int N, double eps, gsl_sf_result * lng, double * sgn) { if(eps == 0.0) { lng->val = 0.0; lng->err = 0.0; *sgn = 0.0; GSL_ERROR ("error", GSL_EDOM); } else if(N == 1) { /* calculate series for * g = eps gamma(-1+eps) + 1 + eps/2 (1+3eps)/(1-eps^2) * double-precision for |eps| < 0.02 */ const double c0 = 0.07721566490153286061; const double c1 = 0.08815966957356030521; const double c2 = -0.00436125434555340577; const double c3 = 0.01391065882004640689; const double c4 = -0.00409427227680839100; const double c5 = 0.00275661310191541584; const double c6 = -0.00124162645565305019; const double c7 = 0.00065267976121802783; const double c8 = -0.00032205261682710437; const double c9 = 0.00016229131039545456; const double g5 = c5 + eps*(c6 + eps*(c7 + eps*(c8 + eps*c9))); const double g = eps*(c0 + eps*(c1 + eps*(c2 + eps*(c3 + eps*(c4 + eps*g5))))); /* calculate eps gamma(-1+eps), a negative quantity */ const double gam_e = g - 1.0 - 0.5*eps*(1.0+3.0*eps)/(1.0 - eps*eps); lng->val = log(fabs(gam_e)/fabs(eps)); lng->err = 2.0 * GSL_DBL_EPSILON * fabs(lng->val); *sgn = ( eps > 0.0 ? -1.0 : 1.0 ); return GSL_SUCCESS; } else { double g; /* series for sin(Pi(N+1-eps))/(Pi eps) modulo the sign * double-precision for |eps| < 0.02 */ const double cs1 = -1.6449340668482264365; const double cs2 = 0.8117424252833536436; const double cs3 = -0.1907518241220842137; const double cs4 = 0.0261478478176548005; const double cs5 = -0.0023460810354558236; const double e2 = eps*eps; const double sin_ser = 1.0 + e2*(cs1+e2*(cs2+e2*(cs3+e2*(cs4+e2*cs5)))); /* calculate series for ln(gamma(1+N-eps)) * double-precision for |eps| < 0.02 */ double aeps = fabs(eps); double c1, c2, c3, c4, c5, c6, c7; double lng_ser; gsl_sf_result c0; gsl_sf_result psi_0; gsl_sf_result psi_1; gsl_sf_result psi_2; gsl_sf_result psi_3; gsl_sf_result psi_4; gsl_sf_result psi_5; gsl_sf_result psi_6; psi_2.val = 0.0; psi_3.val = 0.0; psi_4.val = 0.0; psi_5.val = 0.0; psi_6.val = 0.0; gsl_sf_lnfact_e(N, &c0); gsl_sf_psi_int_e(N+1, &psi_0); gsl_sf_psi_1_int_e(N+1, &psi_1); if(aeps > 0.00001) gsl_sf_psi_n_e(2, N+1.0, &psi_2); if(aeps > 0.0002) gsl_sf_psi_n_e(3, N+1.0, &psi_3); if(aeps > 0.001) gsl_sf_psi_n_e(4, N+1.0, &psi_4); if(aeps > 0.005) gsl_sf_psi_n_e(5, N+1.0, &psi_5); if(aeps > 0.01) gsl_sf_psi_n_e(6, N+1.0, &psi_6); c1 = psi_0.val; c2 = psi_1.val/2.0; c3 = psi_2.val/6.0; c4 = psi_3.val/24.0; c5 = psi_4.val/120.0; c6 = psi_5.val/720.0; c7 = psi_6.val/5040.0; lng_ser = c0.val-eps*(c1-eps*(c2-eps*(c3-eps*(c4-eps*(c5-eps*(c6-eps*c7)))))); /* calculate * g = ln(|eps gamma(-N+eps)|) * = -ln(gamma(1+N-eps)) + ln(|eps Pi/sin(Pi(N+1+eps))|) */ g = -lng_ser - log(sin_ser); lng->val = g - log(fabs(eps)); lng->err = c0.err + 2.0 * GSL_DBL_EPSILON * (fabs(g) + fabs(lng->val)); *sgn = ( GSL_IS_ODD(N) ? -1.0 : 1.0 ) * ( eps > 0.0 ? 1.0 : -1.0 ); return GSL_SUCCESS; } } /* This gets bad near the negative half axis. However, this * region can be avoided by use of the reflection formula, as usual. * Only the first two terms of the series are kept. */ #if 0 static int lngamma_complex_stirling(const double zr, const double zi, double * lg_r, double * arg) { double re_zinv, im_zinv; double re_zinv2, im_zinv2; double re_zinv3, im_zinv3; double re_zhlnz, im_zhlnz; double r, lnr, theta; gsl_sf_complex_log_e(zr, zi, &lnr, &theta); /* z = r e^{i theta} */ r = exp(lnr); re_zinv = (zr/r)/r; im_zinv = -(zi/r)/r; re_zinv2 = re_zinv*re_zinv - im_zinv*im_zinv; re_zinv2 = 2.0*re_zinv*im_zinv; re_zinv3 = re_zinv2*re_zinv - im_zinv2*im_zinv; re_zinv3 = re_zinv2*im_zinv + im_zinv2*re_zinv; re_zhlnz = (zr - 0.5)*lnr - zi*theta; im_zhlnz = zi*lnr + zr*theta; *lg_r = re_zhlnz - zr + 0.5*(M_LN2+M_LNPI) + re_zinv/12.0 - re_zinv3/360.0; *arg = im_zhlnz - zi + 1.0/12.0*im_zinv - im_zinv3/360.0; return GSL_SUCCESS; } #endif /* 0 */ inline static int lngamma_1_pade(const double eps, gsl_sf_result * result) { /* Use (2,2) Pade for Log[Gamma[1+eps]]/eps * plus a correction series. */ const double n1 = -1.0017419282349508699871138440; const double n2 = 1.7364839209922879823280541733; const double d1 = 1.2433006018858751556055436011; const double d2 = 5.0456274100274010152489597514; const double num = (eps + n1) * (eps + n2); const double den = (eps + d1) * (eps + d2); const double pade = 2.0816265188662692474880210318 * num / den; const double c0 = 0.004785324257581753; const double c1 = -0.01192457083645441; const double c2 = 0.01931961413960498; const double c3 = -0.02594027398725020; const double c4 = 0.03141928755021455; const double eps5 = eps*eps*eps*eps*eps; const double corr = eps5 * (c0 + eps*(c1 + eps*(c2 + eps*(c3 + c4*eps)))); result->val = eps * (pade + corr); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } inline static int lngamma_2_pade(const double eps, gsl_sf_result * result) { /* Use (2,2) Pade for Log[Gamma[2+eps]]/eps * plus a correction series. */ const double n1 = 1.000895834786669227164446568; const double n2 = 4.209376735287755081642901277; const double d1 = 2.618851904903217274682578255; const double d2 = 10.85766559900983515322922936; const double num = (eps + n1) * (eps + n2); const double den = (eps + d1) * (eps + d2); const double pade = 2.85337998765781918463568869 * num/den; const double c0 = 0.0001139406357036744; const double c1 = -0.0001365435269792533; const double c2 = 0.0001067287169183665; const double c3 = -0.0000693271800931282; const double c4 = 0.0000407220927867950; const double eps5 = eps*eps*eps*eps*eps; const double corr = eps5 * (c0 + eps*(c1 + eps*(c2 + eps*(c3 + c4*eps)))); result->val = eps * (pade + corr); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } /* series for gammastar(x) * double-precision for x > 10.0 */ static int gammastar_ser(const double x, gsl_sf_result * result) { /* Use the Stirling series for the correction to Log(Gamma(x)), * which is better behaved and easier to compute than the * regular Stirling series for Gamma(x). */ const double y = 1.0/(x*x); const double c0 = 1.0/12.0; const double c1 = -1.0/360.0; const double c2 = 1.0/1260.0; const double c3 = -1.0/1680.0; const double c4 = 1.0/1188.0; const double c5 = -691.0/360360.0; const double c6 = 1.0/156.0; const double c7 = -3617.0/122400.0; const double ser = c0 + y*(c1 + y*(c2 + y*(c3 + y*(c4 + y*(c5 + y*(c6 + y*c7)))))); result->val = exp(ser/x); result->err = 2.0 * GSL_DBL_EPSILON * result->val * GSL_MAX_DBL(1.0, ser/x); return GSL_SUCCESS; } /* Chebyshev expansion for log(gamma(x)/gamma(8)) * 5 < x < 10 * -1 < t < 1 */ static double gamma_5_10_data[24] = { -1.5285594096661578881275075214, 4.8259152300595906319768555035, 0.2277712320977614992970601978, -0.0138867665685617873604917300, 0.0012704876495201082588139723, -0.0001393841240254993658962470, 0.0000169709242992322702260663, -2.2108528820210580075775889168e-06, 3.0196602854202309805163918716e-07, -4.2705675000079118380587357358e-08, 6.2026423818051402794663551945e-09, -9.1993973208880910416311405656e-10, 1.3875551258028145778301211638e-10, -2.1218861491906788718519522978e-11, 3.2821736040381439555133562600e-12, -5.1260001009953791220611135264e-13, 8.0713532554874636696982146610e-14, -1.2798522376569209083811628061e-14, 2.0417711600852502310258808643e-15, -3.2745239502992355776882614137e-16, 5.2759418422036579482120897453e-17, -8.5354147151695233960425725513e-18, 1.3858639703888078291599886143e-18, -2.2574398807738626571560124396e-19 }; static const cheb_series gamma_5_10_cs = { gamma_5_10_data, 23, -1, 1, 11 }; /* gamma(x) for x >= 1/2 * assumes x >= 1/2 */ static int gamma_xgthalf(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x == 0.5) { result->val = 1.77245385090551602729817; result->err = GSL_DBL_EPSILON * result->val; return GSL_SUCCESS; } else if (x <= (FACT_TABLE_MAX + 1.0) && x == floor(x)) { int n = (int) floor (x); result->val = fact_table[n - 1].f; result->err = GSL_DBL_EPSILON * result->val; return GSL_SUCCESS; } else if(fabs(x - 1.0) < 0.01) { /* Use series for Gamma[1+eps] - 1/(1+eps). */ const double eps = x - 1.0; const double c1 = 0.4227843350984671394; const double c2 = -0.01094400467202744461; const double c3 = 0.09252092391911371098; const double c4 = -0.018271913165599812664; const double c5 = 0.018004931096854797895; const double c6 = -0.006850885378723806846; const double c7 = 0.003998239557568466030; result->val = 1.0/x + eps*(c1+eps*(c2+eps*(c3+eps*(c4+eps*(c5+eps*(c6+eps*c7)))))); result->err = GSL_DBL_EPSILON; return GSL_SUCCESS; } else if(fabs(x - 2.0) < 0.01) { /* Use series for Gamma[1 + eps]. */ const double eps = x - 2.0; const double c1 = 0.4227843350984671394; const double c2 = 0.4118403304264396948; const double c3 = 0.08157691924708626638; const double c4 = 0.07424901075351389832; const double c5 = -0.00026698206874501476832; const double c6 = 0.011154045718130991049; const double c7 = -0.002852645821155340816; const double c8 = 0.0021039333406973880085; result->val = 1.0 + eps*(c1+eps*(c2+eps*(c3+eps*(c4+eps*(c5+eps*(c6+eps*(c7+eps*c8))))))); result->err = GSL_DBL_EPSILON; return GSL_SUCCESS; } else if(x < 5.0) { /* Exponentiating the logarithm is fine, as * long as the exponential is not so large * that it greatly amplifies the error. */ gsl_sf_result lg; lngamma_lanczos(x, &lg); result->val = exp(lg.val); result->err = result->val * (lg.err + 2.0 * GSL_DBL_EPSILON); return GSL_SUCCESS; } else if(x < 10.0) { /* This is a sticky area. The logarithm * is too large and the gammastar series * is not good. */ const double gamma_8 = 5040.0; const double t = (2.0*x - 15.0)/5.0; gsl_sf_result c; cheb_eval_e(&gamma_5_10_cs, t, &c); result->val = exp(c.val) * gamma_8; result->err = result->val * c.err; result->err += 2.0 * GSL_DBL_EPSILON * result->val; return GSL_SUCCESS; } else if(x < GSL_SF_GAMMA_XMAX) { /* We do not want to exponentiate the logarithm * if x is large because of the inevitable * inflation of the error. So we carefully * use pow() and exp() with exact quantities. */ double p = pow(x, 0.5*x); double e = exp(-x); double q = (p * e) * p; double pre = M_SQRT2 * M_SQRTPI * q/sqrt(x); gsl_sf_result gstar; int stat_gs = gammastar_ser(x, &gstar); result->val = pre * gstar.val; result->err = (x + 2.5) * GSL_DBL_EPSILON * result->val; return stat_gs; } else { OVERFLOW_ERROR(result); } } /*-*-*-*-*-*-*-*-*-*-*-* Functions with Error Codes *-*-*-*-*-*-*-*-*-*-*-*/ int gsl_sf_lngamma_e(double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(fabs(x - 1.0) < 0.01) { /* Note that we must amplify the errors * from the Pade evaluations because of * the way we must pass the argument, i.e. * writing (1-x) is a loss of precision * when x is near 1. */ int stat = lngamma_1_pade(x - 1.0, result); result->err *= 1.0/(GSL_DBL_EPSILON + fabs(x - 1.0)); return stat; } else if(fabs(x - 2.0) < 0.01) { int stat = lngamma_2_pade(x - 2.0, result); result->err *= 1.0/(GSL_DBL_EPSILON + fabs(x - 2.0)); return stat; } else if(x >= 0.5) { return lngamma_lanczos(x, result); } else if(x == 0.0) { DOMAIN_ERROR(result); } else if(fabs(x) < 0.02) { double sgn; return lngamma_sgn_0(x, result, &sgn); } else if(x > -0.5/(GSL_DBL_EPSILON*M_PI)) { /* Try to extract a fractional * part from x. */ double z = 1.0 - x; double s = sin(M_PI*z); double as = fabs(s); if(s == 0.0) { DOMAIN_ERROR(result); } else if(as < M_PI*0.015) { /* x is near a negative integer, -N */ if(x < INT_MIN + 2.0) { result->val = 0.0; result->err = 0.0; GSL_ERROR ("error", GSL_EROUND); } else { int N = -(int)(x - 0.5); double eps = x + N; double sgn; return lngamma_sgn_sing(N, eps, result, &sgn); } } else { gsl_sf_result lg_z; lngamma_lanczos(z, &lg_z); result->val = M_LNPI - (log(as) + lg_z.val); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val) + lg_z.err; return GSL_SUCCESS; } } else { /* |x| was too large to extract any fractional part */ result->val = 0.0; result->err = 0.0; GSL_ERROR ("error", GSL_EROUND); } } int gsl_sf_lngamma_sgn_e(double x, gsl_sf_result * result_lg, double * sgn) { if(fabs(x - 1.0) < 0.01) { *sgn = 1.0; return lngamma_1_pade(x-1.0, result_lg); } else if(fabs(x - 2.0) < 0.01) { *sgn = 1.0; return lngamma_2_pade(x-2.0, result_lg); } else if(x >= 0.5) { *sgn = 1.0; return lngamma_lanczos(x, result_lg); } else if(x == 0.0) { *sgn = 0.0; DOMAIN_ERROR(result_lg); } else if(fabs(x) < 0.02) { return lngamma_sgn_0(x, result_lg, sgn); } else if(x > -0.5/(GSL_DBL_EPSILON*M_PI)) { double z = 1.0 - x; double s = sin(M_PI*x); double as = fabs(s); if(s == 0.0) { *sgn = 0.0; DOMAIN_ERROR(result_lg); } else if(as < M_PI*0.015) { /* x is near a negative integer, -N */ if(x < INT_MIN + 2.0) { result_lg->val = 0.0; result_lg->err = 0.0; *sgn = 0.0; GSL_ERROR ("error", GSL_EROUND); } else { int N = -(int)(x - 0.5); double eps = x + N; return lngamma_sgn_sing(N, eps, result_lg, sgn); } } else { gsl_sf_result lg_z; lngamma_lanczos(z, &lg_z); *sgn = (s > 0.0 ? 1.0 : -1.0); result_lg->val = M_LNPI - (log(as) + lg_z.val); result_lg->err = 2.0 * GSL_DBL_EPSILON * fabs(result_lg->val) + lg_z.err; return GSL_SUCCESS; } } else { /* |x| was too large to extract any fractional part */ result_lg->val = 0.0; result_lg->err = 0.0; *sgn = 0.0; GSL_ERROR ("error", GSL_EROUND); } } int gsl_sf_gamma_e(const double x, gsl_sf_result * result) { if(x < 0.5) { int rint_x = (int)floor(x+0.5); double f_x = x - rint_x; double sgn_gamma = ( GSL_IS_EVEN(rint_x) ? 1.0 : -1.0 ); double sin_term = sgn_gamma * sin(M_PI * f_x) / M_PI; if(sin_term == 0.0) { DOMAIN_ERROR(result); } else if(x > -169.0) { gsl_sf_result g; gamma_xgthalf(1.0-x, &g); if(fabs(sin_term) * g.val * GSL_DBL_MIN < 1.0) { result->val = 1.0/(sin_term * g.val); result->err = fabs(g.err/g.val) * fabs(result->val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { UNDERFLOW_ERROR(result); } } else { /* It is hard to control it here. * We can only exponentiate the * logarithm and eat the loss of * precision. */ gsl_sf_result lng; double sgn; int stat_lng = gsl_sf_lngamma_sgn_e(x, &lng, &sgn); int stat_e = gsl_sf_exp_mult_err_e(lng.val, lng.err, sgn, 0.0, result); return GSL_ERROR_SELECT_2(stat_e, stat_lng); } } else { return gamma_xgthalf(x, result); } } int gsl_sf_gammastar_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x <= 0.0) { DOMAIN_ERROR(result); } else if(x < 0.5) { gsl_sf_result lg; const int stat_lg = gsl_sf_lngamma_e(x, &lg); const double lx = log(x); const double c = 0.5*(M_LN2+M_LNPI); const double lnr_val = lg.val - (x-0.5)*lx + x - c; const double lnr_err = lg.err + 2.0 * GSL_DBL_EPSILON *((x+0.5)*fabs(lx) + c); const int stat_e = gsl_sf_exp_err_e(lnr_val, lnr_err, result); return GSL_ERROR_SELECT_2(stat_lg, stat_e); } else if(x < 2.0) { const double t = 4.0/3.0*(x-0.5) - 1.0; return cheb_eval_e(&gstar_a_cs, t, result); } else if(x < 10.0) { const double t = 0.25*(x-2.0) - 1.0; gsl_sf_result c; cheb_eval_e(&gstar_b_cs, t, &c); result->val = c.val/(x*x) + 1.0 + 1.0/(12.0*x); result->err = c.err/(x*x); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(x < 1.0/GSL_ROOT4_DBL_EPSILON) { return gammastar_ser(x, result); } else if(x < 1.0/GSL_DBL_EPSILON) { /* Use Stirling formula for Gamma(x). */ const double xi = 1.0/x; result->val = 1.0 + xi/12.0*(1.0 + xi/24.0*(1.0 - xi*(139.0/180.0 + 571.0/8640.0*xi))); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { result->val = 1.0; result->err = 1.0/x; return GSL_SUCCESS; } } int gsl_sf_gammainv_e(const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if (x <= 0.0 && x == floor(x)) { /* negative integer */ result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if(x < 0.5) { gsl_sf_result lng; double sgn; int stat_lng = gsl_sf_lngamma_sgn_e(x, &lng, &sgn); if(stat_lng == GSL_EDOM) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else if(stat_lng != GSL_SUCCESS) { result->val = 0.0; result->err = 0.0; return stat_lng; } else { return gsl_sf_exp_mult_err_e(-lng.val, lng.err, sgn, 0.0, result); } } else { gsl_sf_result g; int stat_g = gamma_xgthalf(x, &g); if(stat_g == GSL_EOVRFLW) { UNDERFLOW_ERROR(result); } else { result->val = 1.0/g.val; result->err = fabs(g.err/g.val) * fabs(result->val); result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); CHECK_UNDERFLOW(result); return GSL_SUCCESS; } } } int gsl_sf_lngamma_complex_e(double zr, double zi, gsl_sf_result * lnr, gsl_sf_result * arg) { if(zr <= 0.5) { /* Transform to right half plane using reflection; * in fact we do a little better by stopping at 1/2. */ double x = 1.0-zr; double y = -zi; gsl_sf_result a, b; gsl_sf_result lnsin_r, lnsin_i; int stat_l = lngamma_lanczos_complex(x, y, &a, &b); int stat_s = gsl_sf_complex_logsin_e(M_PI*zr, M_PI*zi, &lnsin_r, &lnsin_i); if(stat_s == GSL_SUCCESS) { int stat_r; lnr->val = M_LNPI - lnsin_r.val - a.val; lnr->err = lnsin_r.err + a.err + 2.0 * GSL_DBL_EPSILON * fabs(lnr->val); arg->val = -lnsin_i.val - b.val; arg->err = lnsin_i.err + b.err + 2.0 * GSL_DBL_EPSILON * fabs(arg->val); stat_r = gsl_sf_angle_restrict_symm_e(&(arg->val)); return GSL_ERROR_SELECT_2(stat_r, stat_l); } else { DOMAIN_ERROR_2(lnr,arg); } } else { /* otherwise plain vanilla Lanczos */ return lngamma_lanczos_complex(zr, zi, lnr, arg); } } int gsl_sf_taylorcoeff_e(const int n, const double x, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(x < 0.0 || n < 0) { DOMAIN_ERROR(result); } else if(n == 0) { result->val = 1.0; result->err = 0.0; return GSL_SUCCESS; } else if(n == 1) { result->val = x; result->err = 0.0; return GSL_SUCCESS; } else if(x == 0.0) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else { const double log2pi = M_LNPI + M_LN2; const double ln_test = n*(log(x)+1.0) + 1.0 - (n+0.5)*log(n+1.0) + 0.5*log2pi; if(ln_test < GSL_LOG_DBL_MIN+1.0) { UNDERFLOW_ERROR(result); } else if(ln_test > GSL_LOG_DBL_MAX-1.0) { OVERFLOW_ERROR(result); } else { double product = 1.0; int k; for(k=1; k<=n; k++) { product *= (x/k); } result->val = product; result->err = n * GSL_DBL_EPSILON * product; CHECK_UNDERFLOW(result); return GSL_SUCCESS; } } } int gsl_sf_fact_e(const unsigned int n, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n < 18) { result->val = fact_table[n].f; result->err = 0.0; return GSL_SUCCESS; } else if(n <= FACT_TABLE_MAX){ result->val = fact_table[n].f; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR(result); } } int gsl_sf_doublefact_e(const unsigned int n, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n < 26) { result->val = doub_fact_table[n].f; result->err = 0.0; return GSL_SUCCESS; } else if(n <= DOUB_FACT_TABLE_MAX){ result->val = doub_fact_table[n].f; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { OVERFLOW_ERROR(result); } } int gsl_sf_lnfact_e(const unsigned int n, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n <= FACT_TABLE_MAX){ result->val = log(fact_table[n].f); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { gsl_sf_lngamma_e(n+1.0, result); return GSL_SUCCESS; } } int gsl_sf_lndoublefact_e(const unsigned int n, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(n <= DOUB_FACT_TABLE_MAX){ result->val = log(doub_fact_table[n].f); result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else if(GSL_IS_ODD(n)) { gsl_sf_result lg; gsl_sf_lngamma_e(0.5*(n+2.0), &lg); result->val = 0.5*(n+1.0) * M_LN2 - 0.5*M_LNPI + lg.val; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val) + lg.err; return GSL_SUCCESS; } else { gsl_sf_result lg; gsl_sf_lngamma_e(0.5*n+1.0, &lg); result->val = 0.5*n*M_LN2 + lg.val; result->err = 2.0 * GSL_DBL_EPSILON * fabs(result->val) + lg.err; return GSL_SUCCESS; } } int gsl_sf_lnchoose_e(unsigned int n, unsigned int m, gsl_sf_result * result) { /* CHECK_POINTER(result) */ if(m > n) { DOMAIN_ERROR(result); } else if(m == n || m == 0) { result->val = 0.0; result->err = 0.0; return GSL_SUCCESS; } else { gsl_sf_result nf; gsl_sf_result mf; gsl_sf_result nmmf; if(m*2 > n) m = n-m; gsl_sf_lnfact_e(n, &nf); gsl_sf_lnfact_e(m, &mf); gsl_sf_lnfact_e(n-m, &nmmf); result->val = nf.val - mf.val - nmmf.val; result->err = nf.err + mf.err + nmmf.err; result->err += 2.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } } int gsl_sf_choose_e(unsigned int n, unsigned int m, gsl_sf_result * result) { if(m > n) { DOMAIN_ERROR(result); } else if(m == n || m == 0) { result->val = 1.0; result->err = 0.0; return GSL_SUCCESS; } else if (n <= FACT_TABLE_MAX) { result->val = (fact_table[n].f / fact_table[m].f) / fact_table[n-m].f; result->err = 6.0 * GSL_DBL_EPSILON * fabs(result->val); return GSL_SUCCESS; } else { if(m*2 < n) m = n-m; if (n - m < 64) /* compute product for a manageable number of terms */ { double prod = 1.0; unsigned int k; for(k=n; k>=m+1; k--) { double tk = (double)k / (double)(k-m); if(tk > GSL_DBL_MAX/prod) { OVERFLOW_ERROR(result); } prod *= tk; } result->val = prod; result->err = 2.0 * GSL_DBL_EPSILON * prod * fabs(n-m); return GSL_SUCCESS; } else { gsl_sf_result lc; const int stat_lc = gsl_sf_lnchoose_e (n, m, &lc); const int stat_e = gsl_sf_exp_err_e(lc.val, lc.err, result); return GSL_ERROR_SELECT_2(stat_lc, stat_e); } } } /*-*-*-*-*-*-*-*-*-* Functions w/ Natural Prototypes *-*-*-*-*-*-*-*-*-*-*/ #include "eval.h" double gsl_sf_fact(const unsigned int n) { EVAL_RESULT(gsl_sf_fact_e(n, &result)); } double gsl_sf_lnfact(const unsigned int n) { EVAL_RESULT(gsl_sf_lnfact_e(n, &result)); } double gsl_sf_doublefact(const unsigned int n) { EVAL_RESULT(gsl_sf_doublefact_e(n, &result)); } double gsl_sf_lndoublefact(const unsigned int n) { EVAL_RESULT(gsl_sf_lndoublefact_e(n, &result)); } double gsl_sf_lngamma(const double x) { EVAL_RESULT(gsl_sf_lngamma_e(x, &result)); } double gsl_sf_gamma(const double x) { EVAL_RESULT(gsl_sf_gamma_e(x, &result)); } double gsl_sf_gammastar(const double x) { EVAL_RESULT(gsl_sf_gammastar_e(x, &result)); } double gsl_sf_gammainv(const double x) { EVAL_RESULT(gsl_sf_gammainv_e(x, &result)); } double gsl_sf_taylorcoeff(const int n, const double x) { EVAL_RESULT(gsl_sf_taylorcoeff_e(n, x, &result)); } double gsl_sf_choose(unsigned int n, unsigned int m) { EVAL_RESULT(gsl_sf_choose_e(n, m, &result)); } double gsl_sf_lnchoose(unsigned int n, unsigned int m) { EVAL_RESULT(gsl_sf_lnchoose_e(n, m, &result)); } bogofilter-1.2.4/gsl/specfunc/eval.h0000644000175000017500000000064012163572265015542 0ustar sezsez/* evaluate a function discarding the status value in a modifiable way */ #define EVAL_RESULT(fn) \ gsl_sf_result result; \ int status = fn; \ if (status != GSL_SUCCESS) { \ GSL_ERROR_VAL(#fn, status, result.val); \ } ; \ return result.val; #define EVAL_DOUBLE(fn) \ int status = fn; \ if (status != GSL_SUCCESS) { \ GSL_ERROR_VAL(#fn, status, result); \ } ; \ return result; bogofilter-1.2.4/gsl/specfunc/chebyshev.h0000644000175000017500000000224512163572265016576 0ustar sezsez/* specfunc/chebyshev.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* data for a Chebyshev series over a given interval */ struct cheb_series_struct { double * c; /* coefficients */ int order; /* order of expansion */ double a; /* lower interval point */ double b; /* upper interval point */ int order_sp; /* effective single precision order */ }; typedef struct cheb_series_struct cheb_series; bogofilter-1.2.4/gsl/gsl_sf_expint.h0000644000175000017500000000735312163572264015660 0ustar sezsez/* specfunc/gsl_sf_expint.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_EXPINT_H__ #define __GSL_SF_EXPINT_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* E_1(x) := Re[ Integrate[ Exp[-xt]/t, {t,1,Infinity}] ] * * x != 0.0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_expint_E1_e(const double x, gsl_sf_result * result); double gsl_sf_expint_E1(const double x); /* E_2(x) := Re[ Integrate[ Exp[-xt]/t^2, {t,1,Infinity}] ] * * x != 0.0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_expint_E2_e(const double x, gsl_sf_result * result); double gsl_sf_expint_E2(const double x); /* E_1_scaled(x) := exp(x) E_1(x) * * x != 0.0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_expint_E1_scaled_e(const double x, gsl_sf_result * result); double gsl_sf_expint_E1_scaled(const double x); /* E_2_scaled(x) := exp(x) E_2(x) * * x != 0.0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_expint_E2_scaled_e(const double x, gsl_sf_result * result); double gsl_sf_expint_E2_scaled(const double x); /* Ei(x) := - PV Integrate[ Exp[-t]/t, {t,-x,Infinity}] * := PV Integrate[ Exp[t]/t, {t,-Infinity,x}] * * x != 0.0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_expint_Ei_e(const double x, gsl_sf_result * result); double gsl_sf_expint_Ei(const double x); /* Ei_scaled(x) := exp(-x) Ei(x) * * x != 0.0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_expint_Ei_scaled_e(const double x, gsl_sf_result * result); double gsl_sf_expint_Ei_scaled(const double x); /* Shi(x) := Integrate[ Sinh[t]/t, {t,0,x}] * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_Shi_e(const double x, gsl_sf_result * result); double gsl_sf_Shi(const double x); /* Chi(x) := Re[ M_EULER + log(x) + Integrate[(Cosh[t]-1)/t, {t,0,x}] ] * * x != 0.0 * exceptions: GSL_EDOM, GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_Chi_e(const double x, gsl_sf_result * result); double gsl_sf_Chi(const double x); /* Ei_3(x) := Integral[ Exp[-t^3], {t,0,x}] * * x >= 0.0 * exceptions: GSL_EDOM */ int gsl_sf_expint_3_e(const double x, gsl_sf_result * result); double gsl_sf_expint_3(double x); /* Si(x) := Integrate[ Sin[t]/t, {t,0,x}] * * exceptions: none */ int gsl_sf_Si_e(const double x, gsl_sf_result * result); double gsl_sf_Si(const double x); /* Ci(x) := -Integrate[ Cos[t]/t, {t,x,Infinity}] * * x > 0.0 * exceptions: GSL_EDOM */ int gsl_sf_Ci_e(const double x, gsl_sf_result * result); double gsl_sf_Ci(const double x); /* AtanInt(x) := Integral[ Arctan[t]/t, {t,0,x}] * * * exceptions: */ int gsl_sf_atanint_e(const double x, gsl_sf_result * result); double gsl_sf_atanint(const double x); __END_DECLS #endif /* __GSL_SF_EXPINT_H__ */ bogofilter-1.2.4/gsl/gsl_sf_exp.h0000644000175000017500000001036412163572264015141 0ustar sezsez/* specfunc/gsl_sf_exp.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_EXP_H__ #define __GSL_SF_EXP_H__ #include #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Provide an exp() function with GSL semantics, * i.e. with proper error checking, etc. * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_exp_e(const double x, gsl_sf_result * result); double gsl_sf_exp(const double x); /* Exp(x) * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_exp_e10_e(const double x, gsl_sf_result_e10 * result); /* Exponentiate and multiply by a given factor: y * Exp(x) * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_exp_mult_e(const double x, const double y, gsl_sf_result * result); double gsl_sf_exp_mult(const double x, const double y); /* Exponentiate and multiply by a given factor: y * Exp(x) * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_exp_mult_e10_e(const double x, const double y, gsl_sf_result_e10 * result); /* exp(x)-1 * * exceptions: GSL_EOVRFLW */ int gsl_sf_expm1_e(const double x, gsl_sf_result * result); double gsl_sf_expm1(const double x); /* (exp(x)-1)/x = 1 + x/2 + x^2/(2*3) + x^3/(2*3*4) + ... * * exceptions: GSL_EOVRFLW */ int gsl_sf_exprel_e(const double x, gsl_sf_result * result); double gsl_sf_exprel(const double x); /* 2(exp(x)-1-x)/x^2 = 1 + x/3 + x^2/(3*4) + x^3/(3*4*5) + ... * * exceptions: GSL_EOVRFLW */ int gsl_sf_exprel_2_e(double x, gsl_sf_result * result); double gsl_sf_exprel_2(const double x); /* Similarly for the N-th generalization of * the above. The so-called N-relative exponential * * exprel_N(x) = N!/x^N (exp(x) - Sum[x^k/k!, {k,0,N-1}]) * = 1 + x/(N+1) + x^2/((N+1)(N+2)) + ... * = 1F1(1,1+N,x) */ int gsl_sf_exprel_n_e(const int n, const double x, gsl_sf_result * result); double gsl_sf_exprel_n(const int n, const double x); /* Exponentiate a quantity with an associated error. */ int gsl_sf_exp_err_e(const double x, const double dx, gsl_sf_result * result); /* Exponentiate a quantity with an associated error. */ int gsl_sf_exp_err_e10_e(const double x, const double dx, gsl_sf_result_e10 * result); /* Exponentiate and multiply by a given factor: y * Exp(x), * for quantities with associated errors. * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_exp_mult_err_e(const double x, const double dx, const double y, const double dy, gsl_sf_result * result); /* Exponentiate and multiply by a given factor: y * Exp(x), * for quantities with associated errors. * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_exp_mult_err_e10_e(const double x, const double dx, const double y, const double dy, gsl_sf_result_e10 * result); __END_DECLS #if HAVE_EXTERN_INLINE #include #include __BEGIN_DECLS extern inline int gsl_sf_exp_e(const double x, gsl_sf_result * result) { if(x > GSL_LOG_DBL_MAX) { result->val = GSL_POSINF; result->err = GSL_POSINF; GSL_ERROR ("overflow", GSL_EOVRFLW); } else if(x < GSL_LOG_DBL_MIN) { result->val = 0.0; result->err = GSL_DBL_MIN; GSL_ERROR ("underflow", GSL_EUNDRFLW); } else { result->val = exp(x); result->err = 2.0 * GSL_DBL_EPSILON * result->val; return GSL_SUCCESS; } } __END_DECLS #endif /* HAVE_EXTERN_INLINE */ #endif /* __GSL_SF_EXP_H__ */ bogofilter-1.2.4/gsl/gsl_sf_pow_int.h0000644000175000017500000000253112163572265016022 0ustar sezsez/* specfunc/gsl_sf_pow_int.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_POW_INT_H__ #define __GSL_SF_POW_INT_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Calculate x^n. * Does not check for overflow/underflow. */ int gsl_sf_pow_int_e(double x, int n, gsl_sf_result * result); double gsl_sf_pow_int(const double x, const int n); __END_DECLS #endif /* __GSL_SF_POW_INT_H__ */ bogofilter-1.2.4/gsl/gsl_math.h0000644000175000017500000001324712163572264014611 0ustar sezsez/* gsl_math.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __GSL_MATH_H__ #define __GSL_MATH_H__ #include #include #include #include #include #include #ifndef M_E #define M_E 2.71828182845904523536028747135 /* e */ #endif #ifndef M_LOG2E #define M_LOG2E 1.44269504088896340735992468100 /* log_2 (e) */ #endif #ifndef M_LOG10E #define M_LOG10E 0.43429448190325182765112891892 /* log_10 (e) */ #endif #ifndef M_SQRT2 #define M_SQRT2 1.41421356237309504880168872421 /* sqrt(2) */ #endif #ifndef M_SQRT1_2 #define M_SQRT1_2 0.70710678118654752440084436210 /* sqrt(1/2) */ #endif #ifndef M_SQRT3 #define M_SQRT3 1.73205080756887729352744634151 /* sqrt(3) */ #endif #ifndef M_PI #define M_PI 3.14159265358979323846264338328 /* pi */ #endif #ifndef M_PI_2 #define M_PI_2 1.57079632679489661923132169164 /* pi/2 */ #endif #ifndef M_PI_4 #define M_PI_4 0.78539816339744830966156608458 /* pi/4 */ #endif #ifndef M_SQRTPI #define M_SQRTPI 1.77245385090551602729816748334 /* sqrt(pi) */ #endif #ifndef M_2_SQRTPI #define M_2_SQRTPI 1.12837916709551257389615890312 /* 2/sqrt(pi) */ #endif #ifndef M_1_PI #define M_1_PI 0.31830988618379067153776752675 /* 1/pi */ #endif #ifndef M_2_PI #define M_2_PI 0.63661977236758134307553505349 /* 2/pi */ #endif #ifndef M_LN10 #define M_LN10 2.30258509299404568401799145468 /* ln(10) */ #endif #ifndef M_LN2 #define M_LN2 0.69314718055994530941723212146 /* ln(2) */ #endif #ifndef M_LNPI #define M_LNPI 1.14472988584940017414342735135 /* ln(pi) */ #endif #ifndef M_EULER #define M_EULER 0.57721566490153286060651209008 /* Euler constant */ #endif #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* other needlessly compulsive abstractions */ #define GSL_IS_ODD(n) ((n) & 1) #define GSL_IS_EVEN(n) (!(GSL_IS_ODD(n))) #define GSL_SIGN(x) ((x) >= 0.0 ? 1 : -1) /* Return nonzero if x is a real number, i.e. non NaN or infinite. */ #define GSL_IS_REAL(x) (gsl_finite(x)) /* Define MAX and MIN macros/functions if they don't exist. */ /* plain old macros for general use */ #define GSL_MAX(a,b) ((a) > (b) ? (a) : (b)) #define GSL_MIN(a,b) ((a) < (b) ? (a) : (b)) /* function versions of the above, in case they are needed */ double gsl_max (double a, double b); double gsl_min (double a, double b); /* inline-friendly strongly typed versions */ #if HAVE_EXTERN_INLINE extern inline int GSL_MAX_INT (int a, int b); extern inline int GSL_MIN_INT (int a, int b); extern inline double GSL_MAX_DBL (double a, double b); extern inline double GSL_MIN_DBL (double a, double b); extern inline long double GSL_MAX_LDBL (long double a, long double b); extern inline long double GSL_MIN_LDBL (long double a, long double b); extern inline int GSL_MAX_INT (int a, int b) { return GSL_MAX (a, b); } extern inline int GSL_MIN_INT (int a, int b) { return GSL_MIN (a, b); } extern inline double GSL_MAX_DBL (double a, double b) { return GSL_MAX (a, b); } extern inline double GSL_MIN_DBL (double a, double b) { return GSL_MIN (a, b); } extern inline long double GSL_MAX_LDBL (long double a, long double b) { return GSL_MAX (a, b); } extern inline long double GSL_MIN_LDBL (long double a, long double b) { return GSL_MIN (a, b); } #else #define GSL_MAX_INT(a,b) GSL_MAX(a,b) #define GSL_MIN_INT(a,b) GSL_MIN(a,b) #define GSL_MAX_DBL(a,b) GSL_MAX(a,b) #define GSL_MIN_DBL(a,b) GSL_MIN(a,b) #define GSL_MAX_LDBL(a,b) GSL_MAX(a,b) #define GSL_MIN_LDBL(a,b) GSL_MIN(a,b) #endif /* HAVE_EXTERN_INLINE */ /* Definition of an arbitrary function with parameters */ struct gsl_function_struct { double (* function) (double x, void * params); void * params; }; typedef struct gsl_function_struct gsl_function ; #define GSL_FN_EVAL(F,x) (*((F)->function))(x,(F)->params) /* Definition of an arbitrary function returning two values, r1, r2 */ struct gsl_function_fdf_struct { double (* f) (double x, void * params); double (* df) (double x, void * params); void (* fdf) (double x, void * params, double * f, double * df); void * params; }; typedef struct gsl_function_fdf_struct gsl_function_fdf ; #define GSL_FN_FDF_EVAL_F(FDF,x) (*((FDF)->f))(x,(FDF)->params) #define GSL_FN_FDF_EVAL_DF(FDF,x) (*((FDF)->df))(x,(FDF)->params) #define GSL_FN_FDF_EVAL_F_DF(FDF,x,y,dy) (*((FDF)->fdf))(x,(FDF)->params,(y),(dy)) /* Definition of an arbitrary vector-valued function with parameters */ struct gsl_function_vec_struct { int (* function) (double x, double y[], void * params); void * params; }; typedef struct gsl_function_vec_struct gsl_function_vec ; #define GSL_FN_VEC_EVAL(F,x,y) (*((F)->function))(x,y,(F)->params) __END_DECLS #endif /* __GSL_MATH_H__ */ bogofilter-1.2.4/gsl/gsl_sf_elementary.h0000644000175000017500000000314412163572264016510 0ustar sezsez/* specfunc/gsl_sf_elementary.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ /* Miscellaneous elementary functions and operations. */ #ifndef __GSL_SF_ELEMENTARY_H__ #define __GSL_SF_ELEMENTARY_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Multiplication. * * exceptions: GSL_EOVRFLW, GSL_EUNDRFLW */ int gsl_sf_multiply_e(const double x, const double y, gsl_sf_result * result); double gsl_sf_multiply(const double x, const double y); /* Multiplication of quantities with associated errors. */ int gsl_sf_multiply_err_e(const double x, const double dx, const double y, const double dy, gsl_sf_result * result); __END_DECLS #endif /* __GSL_SF_ELEMENTARY_H__ */ bogofilter-1.2.4/gsl/gsl_sf_result.h0000644000175000017500000000302412163572265015657 0ustar sezsez/* specfunc/gsl_sf_result.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_RESULT_H__ #define __GSL_SF_RESULT_H__ #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS struct gsl_sf_result_struct { double val; double err; }; typedef struct gsl_sf_result_struct gsl_sf_result; #define GSL_SF_RESULT_SET(r,v,e) do { (r)->val=(v); (r)->err=(e); } while(0) struct gsl_sf_result_e10_struct { double val; double err; int e10; }; typedef struct gsl_sf_result_e10_struct gsl_sf_result_e10; int gsl_sf_result_smash_e(const gsl_sf_result_e10 * re, gsl_sf_result * r); __END_DECLS #endif /* __GSL_SF_RESULT_H__ */ bogofilter-1.2.4/gsl/gsl_pow_int.h0000644000175000017500000000472312163572265015337 0ustar sezsez/* gsl_pow_int.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __GSL_POW_INT_H__ #define __GSL_POW_INT_H__ #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS #if HAVE_EXTERN_INLINE extern inline double gsl_pow_2(const double x); extern inline double gsl_pow_3(const double x); extern inline double gsl_pow_4(const double x); extern inline double gsl_pow_5(const double x); extern inline double gsl_pow_6(const double x); extern inline double gsl_pow_7(const double x); extern inline double gsl_pow_8(const double x); extern inline double gsl_pow_9(const double x); extern inline double gsl_pow_2(const double x) { return x*x; } extern inline double gsl_pow_3(const double x) { return x*x*x; } extern inline double gsl_pow_4(const double x) { double x2 = x*x; return x2*x2; } extern inline double gsl_pow_5(const double x) { double x2 = x*x; return x2*x2*x; } extern inline double gsl_pow_6(const double x) { double x2 = x*x; return x2*x2*x2; } extern inline double gsl_pow_7(const double x) { double x3 = x*x*x; return x3*x3*x; } extern inline double gsl_pow_8(const double x) { double x2 = x*x; double x4 = x2*x2; return x4*x4; } extern inline double gsl_pow_9(const double x) { double x3 = x*x*x; return x3*x3*x3; } #else double gsl_pow_2(const double x); double gsl_pow_3(const double x); double gsl_pow_4(const double x); double gsl_pow_5(const double x); double gsl_pow_6(const double x); double gsl_pow_7(const double x); double gsl_pow_8(const double x); double gsl_pow_9(const double x); #endif double gsl_pow_int(double x, int n); __END_DECLS #endif /* __GSL_POW_INT_H__ */ bogofilter-1.2.4/gsl/gsl_sys.h0000644000175000017500000000350312163572265014471 0ustar sezsez/* sys/gsl_sys.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __GSL_SYS_H__ #define __GSL_SYS_H__ #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS double gsl_log1p (const double x); double gsl_expm1 (const double x); double gsl_hypot (const double x, const double y); double gsl_acosh (const double x); double gsl_asinh (const double x); double gsl_atanh (const double x); int gsl_isnan (const double x); int gsl_isinf (const double x); int gsl_finite (const double x); double gsl_nan (void); double gsl_posinf (void); double gsl_neginf (void); double gsl_fdiv (const double x, const double y); double gsl_coerce_double (const double x); float gsl_coerce_float (const float x); long double gsl_coerce_long_double (const long double x); double gsl_ldexp(const double x, const int e); double gsl_frexp(const double x, int * e); int gsl_fcmp (const double x1, const double x2, const double epsilon); __END_DECLS #endif /* __GSL_SYS_H__ */ bogofilter-1.2.4/gsl/gsl_sf_zeta.h0000644000175000017500000000436712163572264015316 0ustar sezsez/* specfunc/gsl_sf_zeta.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Author: G. Jungman */ #ifndef __GSL_SF_ZETA_H__ #define __GSL_SF_ZETA_H__ #include #undef __BEGIN_DECLS #undef __END_DECLS #ifdef __cplusplus # define __BEGIN_DECLS extern "C" { # define __END_DECLS } #else # define __BEGIN_DECLS /* empty */ # define __END_DECLS /* empty */ #endif __BEGIN_DECLS /* Riemann Zeta Function * zeta(n) = Sum[ k^(-n), {k,1,Infinity} ] * * n=integer, n != 1 * exceptions: GSL_EDOM, GSL_EOVRFLW */ int gsl_sf_zeta_int_e(const int n, gsl_sf_result * result); double gsl_sf_zeta_int(const int n); /* Riemann Zeta Function * zeta(x) = Sum[ k^(-s), {k,1,Infinity} ], s != 1.0 * * s != 1.0 * exceptions: GSL_EDOM, GSL_EOVRFLW */ int gsl_sf_zeta_e(const double s, gsl_sf_result * result); double gsl_sf_zeta(const double s); /* Hurwitz Zeta Function * zeta(s,q) = Sum[ (k+q)^(-s), {k,0,Infinity} ] * * s > 1.0, q > 0.0 * exceptions: GSL_EDOM, GSL_EUNDRFLW, GSL_EOVRFLW */ int gsl_sf_hzeta_e(const double s, const double q, gsl_sf_result * result); double gsl_sf_hzeta(const double s, const double q); /* Eta Function * eta(n) = (1-2^(1-n)) zeta(n) * * exceptions: GSL_EUNDRFLW, GSL_EOVRFLW */ int gsl_sf_eta_int_e(int n, gsl_sf_result * result); double gsl_sf_eta_int(const int n); /* Eta Function * eta(s) = (1-2^(1-s)) zeta(s) * * exceptions: GSL_EUNDRFLW, GSL_EOVRFLW */ int gsl_sf_eta_e(const double s, gsl_sf_result * result); double gsl_sf_eta(const double s); __END_DECLS #endif /* __GSL_SF_ZETA_H__ */ bogofilter-1.2.4/gsl/gsl_types.h0000644000175000017500000000214212163572265015015 0ustar sezsez/* gsl_types.h * * Copyright (C) 2001 Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __GSL_TYPES_H__ #define __GSL_TYPES_H__ #ifndef GSL_VAR #ifdef WIN32 # ifdef GSL_DLL # ifdef DLL_EXPORT # define GSL_VAR extern __declspec(dllexport) # else # define GSL_VAR extern __declspec(dllimport) # endif # else # define GSL_VAR extern # endif #else # define GSL_VAR extern #endif #endif #endif /* __GSL_TYPES_H__ */ bogofilter-1.2.4/gsl/gsl_nan.h0000644000175000017500000000243012163572265014425 0ustar sezsez/* gsl_nan.h * * Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __GSL_NAN_H__ #define __GSL_NAN_H__ #ifdef INFINITY # define GSL_POSINF INFINITY # define GSL_NEGINF (-INFINITY) #elif defined(HUGE_VAL) # define GSL_POSINF HUGE_VAL # define GSL_NEGINF (-HUGE_VAL) #else # define GSL_POSINF (gsl_posinf()) # define GSL_NEGINF (gsl_neginf()) #endif #ifdef NAN # define GSL_NAN NAN #elif defined(INFINITY) # define GSL_NAN (INFINITY/INFINITY) #else # define GSL_NAN (gsl_nan()) #endif #define GSL_POSZERO (+0) #define GSL_NEGZERO (-0) #endif /* __GSL_NAN_H__ */ bogofilter-1.2.4/gsl/README.bogofilter0000644000175000017500000000071212163572264015646 0ustar sezsezREADME.bogofilter -- (C) 2004 by Matthias Andree, GNU GPL v2. ------------------------------------------------------------------------ This is a stripped-down import of the GNU Scientific Library v1.4. This GSL distribution has been modified: 1. functions unneeded for bogofilter have been dropped 2. all HAVE_INLINE have been replaced by HAVE_EXTERN_INLINE. ------------------------------------------------------------------------ END of README.bogofilter bogofilter-1.2.4/RELEASE.NOTES0000644000175000017500000005747112163572311013747 0ustar sezsezWARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING ------------------------------------------------------------------------ POTENTIAL FOR DATA CORRUPTION DURING UPDATES If you plan to upgrade your database library, if only as a side effect of an operating system upgrade, DO HEED the relevant documentation, for instance, the doc/README.db file. You may need to prepare the upgrade with the old version of the software. Otherwise, you may cause irrecoverable damage to your databases. DO backup your databases before making the upgrade. ------------------------------------------------------------------------ WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING This file documents changes in bogofilter since version 0.11. In particular it describes: (1) Features, which are significant changes (noteworthy and compatible) and (2) Incompatibilities, which are changes that require action upon update. Caution: If upgrading from an old version and skipping several intervening versions of bogofilter, be smart and check all the changes of the versions you skipped! In particular, read the sections labeled "Incompat" and "Major". NOTE: the NEWS document has greater detail on some of these changes. ------------------------------------------------------------------------ [Incompat 0.96.0] TDB removed Support for the TDB database library has been removed. ------------------------------------------------------------------------ [Incompat 0.95.2] Applies to Berkeley DB Transactional ONLY: This release gives up on locking the databases at page granularity and locks whole environments, to overcome lock sizing requirements which are a major issue in unattended setups. This however means that a writer (token registration) will lock out readers (message scoring) and readers will prevent new writers from starting. This may be fixed in a future version. ------------------------------------------------------------------------ [Major 0.95.0] Unicode in UTF-8 This release supports Unicode (UTF-8). A new meta-token .ENCODING has been added to the wordlist so that bogofilter can determine if it's using Unicode or not. A value of 1 indicates raw storage and 2 indicates UTF-8 encoded tokens. Bogofilter checks for this meta-token and converts incoming text to UTF-8 as appropriate. Command line options "--unicode=yes" and "--unicode=no" can be used. - With bogofilter, they control encoding of newly created databases. - With bogoutil, --unicode=yes converts the wordlist to Unicode. - For bogolexer, they print parser results in new and old modes. ./configure options allow bogofilter customization: - "./configure --unicode=yes" will _always_ operate in Unicode mode - "./configure --unicode=no" will _never_ operate in Unicode mode Wordlists can be converted from raw storage to Unicode using: NOTE: Replace iso-8859-1 by the character set and encoding of the dominant input token character set! bogoutil -d wordlist.db > wordlist.raw.txt iconv -f iso-8859-1 -t UTF-8 < wordlist.raw.txt > wordlist.UTF-8.txt bogoutil -l wordlist.db.new < wordlist.UTF-8.txt For a wordlist containing tokens from multiple languages, particularly non-European languages, the conversion methods described above may not work well for you. Building a new wordlist (from scratch) will likely work better as the new wordlist will be based solely on Unicode. ------------------------------------------------------------------------ [Incompat 0.94.12] Changed Options Some options have been added or modified. If you use any of the changed options, you will probably need to modify your scripts, procmail recipes, etc. As an example, some bogoutil options which used to allow either filenames or directory names are now restricted to filenames. See the man pages and help messages if you have questions. ------------------------------------------------------------------------ [Incompat 0.94.0] Transactions The transactional mode now defaults to off because the lock table sizing issue is unresolved. Bogofilter and bogoutil now support both build-time and run-time choosing whether to operate with (or without) transaction support. They can also auto-detect whether you've been using transactions or not. Run-time Selection: For bogofilter and bogoutil, transactions can be enabled or disabled in 2 ways -- by command line options or config file options. Command line option "--db-transaction=yes" enables transactions and "--db-transaction=no" disables them. Config file options "db_transaction=yes" and "db_transaction=no" have the same effect. Auto-detection: If none of the above methods are used to enable/disable transactions, bogofilter and bogoutil will query Berkeley DB to see if a transaction environment already exists. If so, transactions will be enabled. If not, they will be disabled. Compile-time selection: A default build includes the run-time and auto-detect capabilities. If you wish to minimize program size, ./configure can be used to create single mode versions of bogofilter and bogoutil, i.e. programs that only run transactionally or non-transactionallly. Use "./configure --enable-transactions" to enable transactions and "./configure --disable-transactions" to disable them. These programs will be _slightly_ smaller than the default build. ----------------------------------------------------------------------- [Incompat 0.93] Summary for the hasty YOU MUST ADJUST YOUR SCRIPTS EVALUATING "X-Bogosity" HEADERS! YOU MAY NEED TO ADJUST YOUR SCRIPTS THAT PARSE 'bogofilter -V'! WHEN USING BERKELEY DB (DEFAULT), NFS NO LONGER WORKS AND YOU M U S T READ doc/README.db AND POSSIBLY CONFIGURE THE DATABASE! ----------------------------------------------------------------------- [Incompat 0.93] Defaults changed Bogofilter's defaults have been changed. It now operates in tri-state mode and will classify messages as Spam, Ham, or Unsure. If you're checking messages for "X-Bogosity: Yes" or "X-Bogosity: No", you _need_ to change your checks. Use "X-Bogosity: Spam" and "X-Bogosity: Ham" instead of the old forms. Also, checking for "X-Bogosity: Unsure" and putting those messages in a separate folder (or mailbox) will give you an excellent set of messages for training, as "Unsure" messages are messages that bogofilter has too little information to classify (with certainty) as spam or ham. ----------------------------------------------------------------------- [Incompat 0.93] Berkeley DB switched to Transactional Data Store Bogofilter will now use the Berkeley DB Transactional Data Store when compiled with Berkeley DB as the data base engine (the default). This means the Berkeley DB directory can no longer reside on a networked or otherwise shared file system (such as NFS, AFS, Coda). When using BerkeleyDB 4.1 - 4.3, it is recommended that you dump and load the data bases to add checksums, for enhanced reliablity. See section 2.2 in doc/README.db for details. This means that bogofilter programs now exhibit the A C I D traits: changes are atomic (all-or-nothing); the data base is always consistent; changes are always isolated from each other; and all changes that are acknowledged are durable. Bogofilter can support multiple writers at the same time, mixed freely with simultaneous readers, and the data base will not be corrupted by application or system crashes, except when the disk drive gets damaged. Note that this requires that the operating system and disk drive maintain proper write order on the disk, and that both be honest about synchronous I/O completion. Note also that this causes bogofilter to write additional "log" files to its ~/.bogofilter (or other) home directory. The log files need to be archived or deleted periodically. For detailed instructions, be sure to _read_ doc/README.db and check the BerkeleyDB documentation. As a backwards compatibility option, for instance when space and I/O bandwidth are tight, it is possible to use the old non-transactional, non-concurrent Berkeley DB Data Store, which can only register messages when there are NO scoring processes at all and that may not be able recover from application or system crashes. These benefits are not available when bogofilter is compiled to use the TDB or QDBM data bases. ----------------------------------------------------------------------- [Major 1.1.6] Tokyo Cabinet support (B+-trees with transactions) added Bogofilter, as of release 1.1.6, supports Tokyo Cabinet databases, courtesy of Pierre Habouzit. Tokyo Cabinet is the sequel to QDBM with support for larger files and also written by Mikio Hirabayashi. For new installations, if you considered using QDBM, consider using Tokyo Cabinet instead. ----------------------------------------------------------------------- [Incompat 0.93] Berkeley DB version strings changed Bogofilter will now return the BerkeleyDB's actual DB_VERSION_STRING in the output of 'bogofilter -V'. The OLD format was: Database: BerkeleyDB (4.3.21) The NEW format is: Database: Sleepycat Software: Berkeley DB 4.3.21: (November 8, 2004) You may need to adjust your scripts. ----------------------------------------------------------------------- [Incompat 0.93] QDBM database format changed to B+ trees The QDBM database format has been changed from hash tables to B+ trees, i.e. from the Depot API to the Villa API. This results in significantly better performance, i.e. faster speed. Unfortunately, the two modes are incompatible, so upgrading to 0.93 requires running a special command to convert the database once: bogoQDBMupgrade wordlist.qdbm wordlist.tmp wordlist.qdbm.old If this command didn't print anything, everything has gone well and it has left your old data base in wordlist.qdbm.old. NOTE: bogoQDBMupgrade needs qdbm-1.7.23 or newer to build. ----------------------------------------------------------------------- [Incompat 0.93] Bogotune option parsing changes In bogotune 0.93.2 and newer, you must repeat the -n or -s option as prefix for the mailbox. Example: bogotune -n good1 good2 -s bad1 bad2 ... will be: bogotune -n good1 -n good2 -s bad1 -s bad2 ----------------------------------------------------------------------- [Major 0.93.3] SQLite 3.0.8 (and newer) is now supported. It isn't nearly as fast as Berkeley DB but uses only one permanent and one transient file (hence less maintenance work) and is supposed to be proof against application and system crashes. ----------------------------------------------------------------------- [Incompat 0.92] The formatting parameters have changed: '%A' is now the message's IP address. '%I' is now the Message-ID. '%Q' is now the Queue-ID. ----------------------------------------------------------------------- [Incompat 0.17] Support for --enable-deprecated-code (see the 0.16 release notes) has been removed. If you've run 0.16.X without that switch, nothing changes for you. Support for Berkeley DB 3.0 was removed in bogofilter 0.17.3 as a side effect of adding Concurrent Database support. ----------------------------------------------------------------------- [Incompat 0.16] A number of features have been deprecated. The relevant code is bracketed by "#ifdef ENABLE_DEPRECATED_CODE" and "#endif" statements. The default build will not include the deprecated features. For those who still need these features, configure option "--enable-deprecated-code" exists to allow them to be turned on. THIS MAY REQUIRE MAJOR CHANGES TO YOUR CONFIGURATION OR SCRIPTS! The following list is supposed to be complete. Let us know if we've omitted anything. We shall try to provide workarounds and migration paths whenever possible. 1) Scoring algorithms --------------------- Bogofilter will support only the Robinson-Fisher algorithm, commonly called the "Fisher algorithm". The Graham algorithm and Robinson geometric-mean algorithm, a.k.a. Robinson algorithm, have been deprecated. 2) Wordlist support ------------------- Bogofilter will now support only the combined wordlist, i.e. wordlist.db, which contains both the ham and spam counts for each token. The older, separate wordlists (spamlist.db and goodlist.db) are no longer supported. The bogoupgrade program can still be used to merge the separate databases for you. Type "bogoupgrade -d /you/wordlist/directory/". Ignore lists, i.e. ignorelist.db, are also being deprecated. The ignore list feature has never been thoroughly tested and is not used (as far as we know). 3) Command line switches ------------------------ Bogofilter will no longer support the switches listed in this section. If used, bogofilter will print an error message and exit. Scoring related switches: -g - select Graham algorithm -r - select Robinson Geometric-Mean algorithm -f - select Robinson-Fisher algorithm see section 1 above -2 - set binary classification mode -3 - set ternary classification mode Bogofilter will use binary mode if ham_cutoff is zero and will use ternary mode (Yes, No, Unsure) if ham_cutoff in non-zero and less than spam_cutoff. Wordlist modes: -W - use combined wordlist for spam and ham tokens -WW - use separate wordlists for spam and ham tokens Bogofilter will always operate in combined mode now. Backwards compatible token generation switches: -Pi and -PI - ignore_case -Pt and -PT - tokenize_html_tags -Pc and -PC - strict_check -Pd and -PD - degen_enabled -Pf and -PF - first_match Note: Since last May, the default values for these switches have been: ignore_case disabled tokenize_html_tags enabled strict_check disabled degen_enabled disabled first_match disabled There will be no change in the default values. 4) Configuration options ------------------------ The following configuration options (for the above switches) are deprecated: algorithm wordlist wordlist_mode ignore_case tokenize_html_tags tokenize_html_script header_degen degen_enabled first_match The following configuration options (which don't correspond to switches) are deprecated: thresh_stats thresh_rtable Note: Bogofilter will print a warning message if it sees any of these options, but will run fine anyhow. 5) Miscellany ------------- The user formatted SPAM_HEADER will no longer support format specification "%a" (for algorithm) since bogofilter now has only one algorithm. ----------------------------------------------------------------------- [Incompat 0.15.9] Bogofilter no longer allows disabling of algorithms, a feature which has never been well supported. ----------------------------------------------------------------------- [Incompat 0.15.4] All header line tokens are now tagged as: Subject: subj: To: to: From: from: Return-Path: rtrn: Received: rcvd: ***new*** any other: head: ***new*** Because existing wordlists don't have "head:???" tokens, the new tokens won't be found in the wordlist and bogofilter's accuracy will go down. To correct this you can do one of the following things: 1 - Use the new "-H" (for header-degen) option when scoring messages. This option tells bogofilter to check the wordlist twice for each header token - once for "head:xyz" and a second time for "xyz". The ham and spam counts are added together to give a cumulative result. Note that, with bogofilter 0.15.4 and later, during message registration, "head:xyz" tokens are added to the wordlist (for the header lines). The "-H" option is only applied during scoring. The "-H" option is meant for temporary usage to cover the period while bogofilter goes from having no "head:xyz" tokens in the wordlist to the time when there are enough such tokens to score messages effectively. After a few weeks, or perhaps months, of registering messages with the new bogofilter, use of the "-H" option can end and bogofilter will use the newly added "head:xyz" tokens. 2 - Retrain bogofilter with whatever ham and spam you have available. This will create "header:xyz" tokens and allow the new, more effective header tagging to be used to fullest advantage. ----------------------------------------------------------------------- [Major 0.15] The code for processing multiple messages has been rewritten. In addition to understanding mbox format files, bogofilter now understands maildirs and MH folders. ----------------------------------------------------------------------- [Incompat 0.14] The exit codes returned by bogofilter have been expanded. They are: Spam = 0 -- unchanged Ham = 1 -- unchanged Unsure = 2 -- *NEW* Error = 3 -- *CHANGED* ----------------------------------------------------------------------- [Major 0.14] Bogofilter now supports TDB (Trivial Data base). Instead of separate wordlists for spam and ham tokens, bogofilter can now use a single combined, wordlist that stores both all tokens. In the combined wordlist each token contains two counts - for spam and ham. The name of the new file is wordlist.db. However, this change broke the early versions (up to and including 0.14.2) of bogofilter. You should use at least bogofilter 0.14.3. Bogofilter will check in $BOGOFILTER_DIR and use the wordlist(s) that are there. If wordlist.db is present, bogofilter will use the combined mode. If wordlist.db is not present, but both spamlist.db and goodlist.db are present, bogofilter will use the separate wordlist mode. If no wordlists are present, bogofilter will create wordlist.db and use it. Command line switches '-W' and '-WW' can be used to tell bogofilter the mode you want. Also config file options "wordlist_mode=combined" and "wordlist_mode=separate" can be used. Upgrading from an old bogofilter environment with its two wordlists (spamlist.db and goodlist.db) to the new 0.14.x environment with its single, combined wordlist.db involves 3 main steps - dumping the current spamlist.db and goodlist.db files, formatting that output, and then loading the data into a new file wordlist.db. The script "bogoupgrade" is included with bogofilter and performs the task. Use command "bogoupgrade -d /path/to/your/wordlists" to do the upgrade. After running it, your BOGOFILTER_DIR will contain all 3 database files. When started, bogofilter checks for wordlist.db and will use it. ----------------------------------------------------------------------- [Incompat 0.13] Parsing has changed. As background, Paul Graham has done work to improve the results of his bayesian filter and has published them in "Better Bayesian Filtering" at http://www.paulgraham.com/better.html. He found the following definition of a token to be beneficial: 1. Case is preserved. 2. Exclamation points are constituent characters. 3. Periods and commas are constituents if they occur between two digits. This lets me get ip addresses and prices intact. 4. A price range like $20-25 yields two tokens, $20 and $25. 5. Tokens that occur within the To, From, Subject, and Return-Path lines, or within urls, get marked accordingly. Bogofilter has always done #3 and has tagged for Subject lines for a while. Its parser now does all of these things. Several command line switches and config file options have been added to allow enabling or disabling them. Here are the new switches and options: -Pi/-PI ignore_case default - disabled -Ph/-PH header_line_markup default - enabled -Pt/-PT tokenize_html_tags default - enabled The options can be enabled using the lower case switch or disabled using the upper case switch. When header_line_markup_is enabled, tokens in To:, From:, Subject:, and Return-Path: lines are prefixed by "to:", "from:", "subj:", and "rtrn:" respectively. When tokenize_html_tags_is enabled, tokens in A, IMG, and FONT tags are scored while classifying the message. NOTE: To take full advantage of these changes, additional training of bogofilter is necessary. Here's why: With bogofilter's use of upper and lower case, the wordlists won't match as many words as before. For example, "From" and "from" both used to match "from", but this is no longer the case. As additional training is done, words like these will be added to the wordlists and bogofilter will have a larger number of distinct tokens to use when classifying messages. This will improve its classification accuracy. Similarly, the use of header_line_markup will tokenize "Subject: great p0rn site" as "subj:great", "subj:p0rn", and "subj:site". At first these tokens won't be recognized, so bogofilter won't use them to score the message. After being trained, bogofilter will have these additional tokens to aid in the classification process. ----------------------------------------------------------------------- [Major 0.12] Directory bogofilter/tuning has been added and contains scripts for running tuning experiments as described in the new HOWTO. See file bogofilter/tuning/README for more information. Bogofilter's man page and help message describe the many command line switches. They have been divided into groups (help, classification, registration, general, algorithm, parameter, and info) in both places. Bogofilter 0.12.0 has three new command line switches for rapidly scoring large numbers of messages. These "bulk mode" switches are especially useful for the tuning process. The new switches are: -M - allows scoring all the messages in a mbox formatted file. If used with "-v", an X-Bogosity line is printed as each message is scored. Using the "-t" (terse) option is recommended to reduce the amount of output. -B - allows scoring of multiple message files, with each file containing a single message. With this option, bogofilter expects the file names to be at the end of the command line. If used with "-v", the file name is included in each printed line. Using "-t" is recommended. -b - allows scoring of multiple message files, with each file containing a single message. With this option, bogofilter reads the file names from stdin. This option can be used with maildirs, as in "ls Maildir/* | bogofilter -b ..." If used with "-v", the file name is included in each printed line. Using "-t" is recommended. New script bogolex.sh converts an email to a special file format that contains the information needed by bogofilter to score the email. Its use speeds up the message scoring done by the tuning scripts. The script is described in more detail in bogofilter/tuning/README. ----------------------------------------------------------------------- [Incompat 0.11] Command line flags: The meaning of command line flags '-S' and '-N' was changed in version 0.11.0. Previously '-S' meant to unregister a message from the spam wordlist and register the message in the non-spam wordlist and '-N' meant to unregister from non-spam and register as spam. Each of the flags now performs a single action. '-S' unregisters a message from the spam wordlist and '-N' unregisters a message from the non-spam wordlist. To duplicate the old (compound) actions, it is necessary to use two options - an unregister option ('-S' or '-N') and a register option ('-s' or '-n'). To duplicate the effect of the old '-S' option, use '-N -s'. To duplicate the effect of the old '-N' option, use '-S -n'. The order of the options doesn't matter and they can be concatenated, as in '-Sn' and '-sN'. Config file processing ---------------------- The code to process config files now checks numeric values for validity. It complains when it detects something wrong. In particular, double precision values are no longer allowed to have a terminal 'f'. For example "spam_cutoff=0.95f" will generate a messages. ----------------------------------------------------------------------- [Major 0.11] New parameter query option: Using options "-q -v" in a bogofilter command line will run the query_config() function and will display bogofilter's various parameter values. This can be very useful in finding the reason for an unexpected message classification. ----------------------------------------------------------------------- End of RELEASE.NOTES bogofilter-1.2.4/gnugetopt/0000755000175000017500000000000012163572311014053 5ustar sezsezbogofilter-1.2.4/gnugetopt/getopt.c0000644000175000017500000007270612163572311015535 0ustar sezsez/* Getopt for GNU. NOTE: getopt is now part of the C library, so if you don't know what "Keep this file name-space clean" means, talk to drepper@gnu.org before changing it! Copyright (C) 1987, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98 Free Software Foundation, Inc. NOTE: This source is derived from an old version taken from the GNU C Library (glibc). 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. */ /* This tells Alpha OSF/1 not to define a getopt prototype in . Ditto for AIX 3.2 and . */ #ifndef _NO_PROTO # define _NO_PROTO #endif #ifdef HAVE_CONFIG_H # include "config.h" #endif #if !defined __STDC__ || !__STDC__ /* This is a separate conditional since some stdc systems reject `defined (const)'. */ # ifndef const # define const # endif #endif #include /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #define GETOPT_INTERFACE_VERSION 2 #if !defined _LIBC && defined __GLIBC__ && __GLIBC__ >= 2 # include # if _GNU_GETOPT_INTERFACE_VERSION == GETOPT_INTERFACE_VERSION # define ELIDE_CODE # endif #endif #ifndef ELIDE_CODE /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ /* Don't include stdlib.h for non-GNU C libraries because some of them contain conflicting prototypes for getopt. */ # include # include #endif /* GNU C library. */ #ifdef VMS # include # if HAVE_STRING_H - 0 # include # endif #endif #ifndef _ /* This is for other GNU distributions with internationalized messages. When compiling libc, the _ macro is predefined. */ # if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC # include # define _(msgid) gettext (msgid) # else # define _(msgid) (msgid) # endif #endif /* This version of `getopt' appears to the caller like standard Unix `getopt' but it behaves differently for the user, since it allows the user to intersperse the options with the other arguments. As `getopt' works, it permutes the elements of ARGV so that, when it is done, all the options precede everything else. Thus all application programs are extended to handle flexible argument order. Setting the environment variable POSIXLY_CORRECT disables permutation. Then the behavior is completely standard. GNU application programs can use a third alternative mode in which they can distinguish the relative order of options and other arguments. */ #include "getopt.h" /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ char *optarg = NULL; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns -1, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ /* 1003.2 says this must be 1 before any call. */ int optind = 1; /* Formerly, initialization of getopt depended on optind==0, which causes problems with re-calling getopt as programs generally don't know that. */ int __getopt_initialized = 0; /* The next char to be scanned in the option-element in which the last option character we returned was found. This allows us to pick up the scan where we left off. If this is zero, or a null string, it means resume the scan by advancing to the next ARGV-element. */ static char *nextchar; /* Callers store zero here to inhibit the error message for unrecognized options. */ int opterr = 1; /* Set to an option character which was unrecognized. This must be initialized on some systems to avoid linking in the system's own getopt implementation. */ int optopt = '?'; /* Describe how to deal with options that follow non-option ARGV-elements. If the caller did not specify anything, the default is REQUIRE_ORDER if the environment variable POSIXLY_CORRECT is defined, PERMUTE otherwise. REQUIRE_ORDER means don't recognize them as options; stop option processing when the first non-option is seen. This is what Unix does. This mode of operation is selected by either setting the environment variable POSIXLY_CORRECT, or using `+' as the first character of the list of option characters. PERMUTE is the default. We permute the contents of ARGV as we scan, so that eventually all the non-options are at the end. This allows options to be given in any order, even with programs that were not written to expect this. RETURN_IN_ORDER is an option available to programs that were written to expect options and other ARGV-elements in any order and that care about the ordering of the two. We describe each non-option ARGV-element as if it were the argument of an option with character code 1. Using `-' as the first character of the list of option characters selects this mode of operation. The special argument `--' forces an end of option-scanning regardless of the value of `ordering'. In the case of RETURN_IN_ORDER, only `--' can cause `getopt' to return -1 with `optind' != ARGC. */ static enum { REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER } ordering; /* Value of POSIXLY_CORRECT environment variable. */ static char *posixly_correct; #ifdef __GNU_LIBRARY__ /* We want to avoid inclusion of string.h with non-GNU libraries because there are many ways it can cause trouble. On some systems, it contains special magic macros that don't work in GCC. */ # include # define my_index strchr #else # if HAVE_STRING_H # include # else # if HAVE_STRINGS_H # include # endif # endif /* Avoid depending on library functions or files whose names are inconsistent. */ #ifndef getenv extern char *getenv (); #endif static char * my_index (str, chr) const char *str; int chr; { while (*str) { if (*str == chr) return (char *) str; str++; } return 0; } /* If using GCC, we can safely declare strlen this way. If not using GCC, it is ok not to declare it. */ #ifdef __GNUC__ /* Note that Motorola Delta 68k R3V7 comes with GCC but not stddef.h. That was relevant to code that was here before. */ # if (!defined __STDC__ || !__STDC__) && !defined strlen /* gcc with -traditional declares the built-in strlen to return int, and has done so at least since version 2.4.5. -- rms. */ extern int strlen (const char *); # endif /* not __STDC__ */ #endif /* __GNUC__ */ #endif /* not __GNU_LIBRARY__ */ /* Handle permutation of arguments. */ /* Describe the part of ARGV that contains non-options that have been skipped. `first_nonopt' is the index in ARGV of the first of them; `last_nonopt' is the index after the last of them. */ static int first_nonopt; static int last_nonopt; #ifdef _LIBC /* Bash 2.0 gives us an environment variable containing flags indicating ARGV elements that should not be considered arguments. */ /* Defined in getopt_init.c */ extern char *__getopt_nonoption_flags; static int nonoption_flags_max_len; static int nonoption_flags_len; static int original_argc; static char *const *original_argv; /* Make sure the environment variable bash 2.0 puts in the environment is valid for the getopt call we must make sure that the ARGV passed to getopt is that one passed to the process. */ static void __attribute__ ((unused)) store_args_and_env (int argc, char *const *argv) { /* XXX This is no good solution. We should rather copy the args so that we can compare them later. But we must not use malloc(3). */ original_argc = argc; original_argv = argv; } # ifdef text_set_element text_set_element (__libc_subinit, store_args_and_env); # endif /* text_set_element */ # define SWAP_FLAGS(ch1, ch2) \ if (nonoption_flags_len > 0) \ { \ char __tmp = __getopt_nonoption_flags[ch1]; \ __getopt_nonoption_flags[ch1] = __getopt_nonoption_flags[ch2]; \ __getopt_nonoption_flags[ch2] = __tmp; \ } #else /* !_LIBC */ # define SWAP_FLAGS(ch1, ch2) #endif /* _LIBC */ /* Exchange two adjacent subsequences of ARGV. One subsequence is elements [first_nonopt,last_nonopt) which contains all the non-options that have been skipped so far. The other is elements [last_nonopt,optind), which contains all the options processed since those non-options were skipped. `first_nonopt' and `last_nonopt' are relocated so that they describe the new indices of the non-options in ARGV after they are moved. */ #if defined __STDC__ && __STDC__ static void exchange (char **); #endif static void exchange (argv) char **argv; { int bottom = first_nonopt; int middle = last_nonopt; int top = optind; char *tem; /* Exchange the shorter segment with the far end of the longer segment. That puts the shorter segment into the right place. It leaves the longer segment in the right place overall, but it consists of two parts that need to be swapped next. */ #ifdef _LIBC /* First make sure the handling of the `__getopt_nonoption_flags' string can work normally. Our top argument must be in the range of the string. */ if (nonoption_flags_len > 0 && top >= nonoption_flags_max_len) { /* We must extend the array. The user plays games with us and presents new arguments. */ char *new_str = malloc (top + 1); if (new_str == NULL) nonoption_flags_len = nonoption_flags_max_len = 0; else { memset (mempcpy (new_str, __getopt_nonoption_flags, nonoption_flags_max_len), '\0', top + 1 - nonoption_flags_max_len); nonoption_flags_max_len = top + 1; __getopt_nonoption_flags = new_str; } } #endif while (top > middle && middle > bottom) { if (top - middle > middle - bottom) { /* Bottom segment is the short one. */ int len = middle - bottom; register int i; /* Swap it with the top part of the top segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[top - (middle - bottom) + i]; argv[top - (middle - bottom) + i] = tem; SWAP_FLAGS (bottom + i, top - (middle - bottom) + i); } /* Exclude the moved bottom segment from further swapping. */ top -= len; } else { /* Top segment is the short one. */ int len = top - middle; register int i; /* Swap it with the bottom part of the bottom segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[middle + i]; argv[middle + i] = tem; SWAP_FLAGS (bottom + i, middle + i); } /* Exclude the moved top segment from further swapping. */ bottom += len; } } /* Update records for the slots the non-options now occupy. */ first_nonopt += (optind - last_nonopt); last_nonopt = optind; } /* Initialize the internal data when the first call is made. */ #if defined __STDC__ && __STDC__ static const char *_getopt_initialize (int, char *const *, const char *); #endif static const char * _getopt_initialize (argc, argv, optstring) int argc; char *const *argv; const char *optstring; { /* Start processing options with ARGV-element 1 (since ARGV-element 0 is the program name); the sequence of previously skipped non-option ARGV-elements is empty. */ first_nonopt = last_nonopt = optind; nextchar = NULL; posixly_correct = getenv ("POSIXLY_CORRECT"); /* Determine how to handle the ordering of options and nonoptions. */ if (optstring[0] == '-') { ordering = RETURN_IN_ORDER; ++optstring; } else if (optstring[0] == '+') { ordering = REQUIRE_ORDER; ++optstring; } else if (posixly_correct != NULL) ordering = REQUIRE_ORDER; else ordering = PERMUTE; #ifdef _LIBC if (posixly_correct == NULL && argc == original_argc && argv == original_argv) { if (nonoption_flags_max_len == 0) { if (__getopt_nonoption_flags == NULL || __getopt_nonoption_flags[0] == '\0') nonoption_flags_max_len = -1; else { const char *orig_str = __getopt_nonoption_flags; int len = nonoption_flags_max_len = strlen (orig_str); if (nonoption_flags_max_len < argc) nonoption_flags_max_len = argc; __getopt_nonoption_flags = (char *) malloc (nonoption_flags_max_len); if (__getopt_nonoption_flags == NULL) nonoption_flags_max_len = -1; else memset (mempcpy (__getopt_nonoption_flags, orig_str, len), '\0', nonoption_flags_max_len - len); } } nonoption_flags_len = nonoption_flags_max_len; } else nonoption_flags_len = 0; #endif return optstring; } /* Scan elements of ARGV (whose length is ARGC) for option characters given in OPTSTRING. If an element of ARGV starts with '-', and is not exactly "-" or "--", then it is an option element. The characters of this element (aside from the initial '-') are option characters. If `getopt' is called repeatedly, it returns successively each of the option characters from each of the option elements. If `getopt' finds another option character, it returns that character, updating `optind' and `nextchar' so that the next call to `getopt' can resume the scan with the following option character or ARGV-element. If there are no more option characters, `getopt' returns -1. Then `optind' is the index in ARGV of the first ARGV-element that is not an option. (The ARGV-elements have been permuted so that those that are not options now come last.) OPTSTRING is a string containing the legitimate option characters. If an option character is seen that is not listed in OPTSTRING, return '?' after printing an error message. If you set `opterr' to zero, the error message is suppressed but we still return '?'. If a char in OPTSTRING is followed by a colon, that means it wants an arg, so the following text in the same ARGV-element, or the text of the following ARGV-element, is returned in `optarg'. Two colons mean an option that wants an optional arg; if there is text in the current ARGV-element, it is returned in `optarg', otherwise `optarg' is set to zero. If OPTSTRING starts with `-' or `+', it requests different methods of handling the non-option ARGV-elements. See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above. Long-named options begin with `--' instead of `-'. Their names may be abbreviated as long as the abbreviation is unique or is an exact match for some defined option. If they have an argument, it follows the option name in the same ARGV-element, separated from the option name by a `=', or else the in next ARGV-element. When `getopt' finds a long-named option, it returns 0 if that option's `flag' field is nonzero, the value of the option's `val' field if the `flag' field is zero. The elements of ARGV aren't really const, because we permute them. But we pretend they're const in the prototype to be compatible with other systems. LONGOPTS is a vector of `struct option' terminated by an element containing a name which is zero. LONGIND returns the index in LONGOPT of the long-named option found. It is only valid when a long-named option has been found by the most recent call. If LONG_ONLY is nonzero, '-' as well as '--' can introduce long-named options. */ int _getopt_internal (argc, argv, optstring, longopts, longind, long_only) int argc; char *const *argv; const char *optstring; const struct option *longopts; int *longind; int long_only; { optarg = NULL; if (optind == 0 || !__getopt_initialized) { if (optind == 0) optind = 1; /* Don't scan ARGV[0], the program name. */ optstring = _getopt_initialize (argc, argv, optstring); __getopt_initialized = 1; } /* Test whether ARGV[optind] points to a non-option argument. Either it does not have option syntax, or there is an environment flag from the shell indicating it is not an option. The later information is only used when the used in the GNU libc. */ #ifdef _LIBC # define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0' \ || (optind < nonoption_flags_len \ && __getopt_nonoption_flags[optind] == '1')) #else # define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0') #endif if (nextchar == NULL || *nextchar == '\0') { /* Advance to the next ARGV-element. */ /* Give FIRST_NONOPT & LAST_NONOPT rational values if OPTIND has been moved back by the user (who may also have changed the arguments). */ if (last_nonopt > optind) last_nonopt = optind; if (first_nonopt > optind) first_nonopt = optind; if (ordering == PERMUTE) { /* If we have just processed some options following some non-options, exchange them so that the options come first. */ if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (last_nonopt != optind) first_nonopt = optind; /* Skip any additional non-options and extend the range of non-options previously skipped. */ while (optind < argc && NONOPTION_P) optind++; last_nonopt = optind; } /* The special ARGV-element `--' means premature end of options. Skip it like a null option, then exchange with previous non-options as if it were an option, then skip everything else like a non-option. */ if (optind != argc && !strcmp (argv[optind], "--")) { optind++; if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (first_nonopt == last_nonopt) first_nonopt = optind; last_nonopt = argc; optind = argc; } /* If we have done all the ARGV-elements, stop the scan and back over any non-options that we skipped and permuted. */ if (optind == argc) { /* Set the next-arg-index to point at the non-options that we previously skipped, so the caller will digest them. */ if (first_nonopt != last_nonopt) optind = first_nonopt; return -1; } /* If we have come to a non-option and did not permute it, either stop the scan or describe it to the caller and pass it by. */ if (NONOPTION_P) { if (ordering == REQUIRE_ORDER) return -1; optarg = argv[optind++]; return 1; } /* We have found another option-ARGV-element. Skip the initial punctuation. */ nextchar = (argv[optind] + 1 + (longopts != NULL && argv[optind][1] == '-')); } /* Decode the current option-ARGV-element. */ /* Check whether the ARGV-element is a long option. If long_only and the ARGV-element has the form "-f", where f is a valid short option, don't consider it an abbreviated form of a long option that starts with f. Otherwise there would be no way to give the -f short option. On the other hand, if there's a long option "fubar" and the ARGV-element is "-fu", do consider that an abbreviation of the long option, just like "--fu", and not "-f" with arg "u". This distinction seems to be the most useful approach. */ if (longopts != NULL && (argv[optind][1] == '-' || (long_only && (argv[optind][2] || !my_index (optstring, argv[optind][1]))))) { char *nameend; const struct option *p; const struct option *pfound = NULL; int exact = 0; int ambig = 0; int indfound = -1; int option_index; for (nameend = nextchar; *nameend && *nameend != '='; nameend++) /* Do nothing. */ ; /* Test all long options for either exact match or abbreviated matches. */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp (p->name, nextchar, nameend - nextchar)) { if ((unsigned int) (nameend - nextchar) == (unsigned int) strlen (p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else /* Second or later nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (opterr) fprintf (stderr, _("%s: option `%s' is ambiguous\n"), argv[0], argv[optind]); nextchar += strlen (nextchar); optind++; optopt = 0; return '?'; } if (pfound != NULL) { option_index = indfound; optind++; if (*nameend) { /* Don't test has_arg with >, because some C compilers don't allow it to be used on enums. */ if (pfound->has_arg) optarg = nameend + 1; else { if (opterr) { if (argv[optind - 1][1] == '-') /* --option */ fprintf (stderr, _("%s: option `--%s' doesn't allow an argument\n"), argv[0], pfound->name); else /* +option or -option */ fprintf (stderr, _("%s: option `%c%s' doesn't allow an argument\n"), argv[0], argv[optind - 1][0], pfound->name); nextchar += strlen (nextchar); optopt = pfound->val; return '?'; } } } else if (pfound->has_arg == 1) { if (optind < argc) optarg = argv[optind++]; else { if (opterr) fprintf (stderr, _("%s: option `%s' requires an argument\n"), argv[0], argv[optind - 1]); nextchar += strlen (nextchar); optopt = pfound->val; return optstring[0] == ':' ? ':' : '?'; } } nextchar += strlen (nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } /* Can't find it as a long option. If this is not getopt_long_only, or the option starts with '--' or is not a valid short option, then it's an error. Otherwise interpret it as a short option. */ if (!long_only || argv[optind][1] == '-' || my_index (optstring, *nextchar) == NULL) { if (opterr) { if (argv[optind][1] == '-') /* --option */ fprintf (stderr, _("%s: unrecognized option `--%s'\n"), argv[0], nextchar); else /* +option or -option */ fprintf (stderr, _("%s: unrecognized option `%c%s'\n"), argv[0], argv[optind][0], nextchar); } nextchar = (char *) ""; optind++; optopt = 0; return '?'; } } /* Look at and handle the next short option-character. */ { char c = *nextchar++; char *temp = my_index (optstring, c); /* Increment `optind' when we start to process its last character. */ if (*nextchar == '\0') ++optind; if (temp == NULL || c == ':') { if (opterr) { if (posixly_correct) /* 1003.2 specifies the format of this message. */ fprintf (stderr, _("%s: illegal option -- %c\n"), argv[0], c); else fprintf (stderr, _("%s: invalid option -- %c\n"), argv[0], c); } optopt = c; return '?'; } /* Convenience. Treat POSIX -W foo same as long option --foo */ if (temp[0] == 'W' && temp[1] == ';') { char *nameend; const struct option *p; const struct option *pfound = NULL; int exact = 0; int ambig = 0; int indfound = 0; int option_index; /* This is an option that requires an argument. */ if (*nextchar != '\0') { optarg = nextchar; /* If we end this ARGV-element by taking the rest as an arg, we must advance to the next element now. */ optind++; } else if (optind == argc) { if (opterr) { /* 1003.2 specifies the format of this message. */ fprintf (stderr, _("%s: option requires an argument -- %c\n"), argv[0], c); } optopt = c; if (optstring[0] == ':') c = ':'; else c = '?'; return c; } else /* We already incremented `optind' once; increment it again when taking next ARGV-elt as argument. */ optarg = argv[optind++]; /* optarg is now the argument, see if it's in the table of longopts. */ for (nextchar = nameend = optarg; *nameend && *nameend != '='; nameend++) /* Do nothing. */ ; /* Test all long options for either exact match or abbreviated matches. */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp (p->name, nextchar, nameend - nextchar)) { if ((unsigned int) (nameend - nextchar) == strlen (p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else /* Second or later nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (opterr) fprintf (stderr, _("%s: option `-W %s' is ambiguous\n"), argv[0], argv[optind]); nextchar += strlen (nextchar); optind++; return '?'; } if (pfound != NULL) { option_index = indfound; if (*nameend) { /* Don't test has_arg with >, because some C compilers don't allow it to be used on enums. */ if (pfound->has_arg) optarg = nameend + 1; else { if (opterr) fprintf (stderr, _("\ %s: option `-W %s' doesn't allow an argument\n"), argv[0], pfound->name); nextchar += strlen (nextchar); return '?'; } } else if (pfound->has_arg == 1) { if (optind < argc) optarg = argv[optind++]; else { if (opterr) fprintf (stderr, _("%s: option `%s' requires an argument\n"), argv[0], argv[optind - 1]); nextchar += strlen (nextchar); return optstring[0] == ':' ? ':' : '?'; } } nextchar += strlen (nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } nextchar = NULL; return 'W'; /* Let the application handle it. */ } if (temp[1] == ':') { if (temp[2] == ':') { /* This is an option that accepts an argument optionally. */ if (*nextchar != '\0') { optarg = nextchar; optind++; } else optarg = NULL; nextchar = NULL; } else { /* This is an option that requires an argument. */ if (*nextchar != '\0') { optarg = nextchar; /* If we end this ARGV-element by taking the rest as an arg, we must advance to the next element now. */ optind++; } else if (optind == argc) { if (opterr) { /* 1003.2 specifies the format of this message. */ fprintf (stderr, _("%s: option requires an argument -- %c\n"), argv[0], c); } optopt = c; if (optstring[0] == ':') c = ':'; else c = '?'; } else /* We already incremented `optind' once; increment it again when taking next ARGV-elt as argument. */ optarg = argv[optind++]; nextchar = NULL; } } return c; } } int getopt (argc, argv, optstring) int argc; char *const *argv; const char *optstring; { return _getopt_internal (argc, argv, optstring, (const struct option *) 0, (int *) 0, 0); } #endif /* Not ELIDE_CODE. */ #ifdef TEST /* Compile with -DTEST to make an executable for use in testing the above definition of `getopt'. */ int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; c = getopt (argc, argv, "abc:d:0123456789"); if (c == -1) break; switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ bogofilter-1.2.4/gnugetopt/getopt.h0000644000175000017500000001167412163572311015537 0ustar sezsez/* Declarations for getopt. Copyright 1989, 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 2000, 2002 Free Software Foundation, Inc. NOTE: The canonical source of this file is maintained with the GNU C Library. Bugs can be reported to bug-glibc@gnu.org. 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. */ #ifndef _GETOPT_H #define _GETOPT_H 1 #ifdef __cplusplus extern "C" { #endif /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ extern char *optarg; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns -1, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ extern int optind; /* Callers store zero here to inhibit the error message `getopt' prints for unrecognized options. */ extern int opterr; /* Set to an option character which was unrecognized. */ extern int optopt; /* Describe the long-named options requested by the application. The LONG_OPTIONS argument to getopt_long or getopt_long_only is a vector of `struct option' terminated by an element containing a name which is zero. The field `has_arg' is: no_argument (or 0) if the option does not take an argument, required_argument (or 1) if the option requires an argument, optional_argument (or 2) if the option takes an optional argument. If the field `flag' is not NULL, it points to a variable that is set to the value given in the field `val' when the option is found, but left unchanged if the option is not found. To have a long-named option do something other than set an `int' to a compiled-in constant, such as set a value from `optarg', set the option's `flag' field to zero and its `val' field to a nonzero value (the equivalent single-letter option character, if there is one). For long options that have a zero `flag' field, `getopt' returns the contents of the `val' field. */ struct option { #if defined (__STDC__) && __STDC__ const char *name; #else char *name; #endif /* has_arg can't be an enum because some compilers complain about type mismatches in all the code that assumes it is an int. */ int has_arg; int *flag; int val; }; /* Names for the values of the `has_arg' field of `struct option'. */ #define no_argument 0 #define required_argument 1 #define optional_argument 2 #if defined (__STDC__) && __STDC__ /* HAVE_DECL_* is a three-state macro: undefined, 0 or 1. If it is undefined, we haven't run the autoconf check so provide the declaration without arguments. If it is 0, we checked and failed to find the declaration so provide a fully prototyped one. If it is 1, we found it so don't provide any declaration at all. */ #if !HAVE_DECL_GETOPT #if defined (__GNU_LIBRARY__) || defined (HAVE_DECL_GETOPT) /* Many other libraries have conflicting prototypes for getopt, with differences in the consts, in unistd.h. To avoid compilation errors, only prototype getopt for the GNU C library. */ extern int getopt (int argc, char *const *argv, const char *shortopts); #else #ifndef __cplusplus extern int getopt (); #endif /* __cplusplus */ #endif #endif /* !HAVE_DECL_GETOPT */ extern int getopt_long (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); extern int getopt_long_only (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); /* Internal only. Users should not call this directly. */ extern int _getopt_internal (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind, int long_only); #else /* not __STDC__ */ extern int getopt (); extern int getopt_long (); extern int getopt_long_only (); extern int _getopt_internal (); #endif /* __STDC__ */ #ifdef __cplusplus } #endif #endif /* getopt.h */ bogofilter-1.2.4/gnugetopt/getopt1.c0000644000175000017500000001065012163572311015604 0ustar sezsez/* getopt_long and getopt_long_only entry points for GNU getopt. Copyright (C) 1987,88,89,90,91,92,93,94,96,97,98 Free Software Foundation, Inc. NOTE: This source is derived from an old version taken from the GNU C Library (glibc). 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. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "getopt.h" #if !defined __STDC__ || !__STDC__ /* This is a separate conditional since some stdc systems reject `defined (const)'. */ #ifndef const #define const #endif #endif #include /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #define GETOPT_INTERFACE_VERSION 2 #if !defined _LIBC && defined __GLIBC__ && __GLIBC__ >= 2 #include #if _GNU_GETOPT_INTERFACE_VERSION == GETOPT_INTERFACE_VERSION #define ELIDE_CODE #endif #endif #ifndef ELIDE_CODE /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ #include #endif #ifndef NULL #define NULL 0 #endif int getopt_long (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 0); } /* Like getopt_long, but '-' as well as '--' can indicate a long option. If an option that starts with '-' (not '--') doesn't match a long option, but does match a short option, it is parsed as a short option instead. */ int getopt_long_only (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 1); } #endif /* Not ELIDE_CODE. */ #ifdef TEST #include int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; int option_index = 0; static struct option long_options[] = { {"add", 1, 0, 0}, {"append", 0, 0, 0}, {"delete", 1, 0, 0}, {"verbose", 0, 0, 0}, {"create", 0, 0, 0}, {"file", 1, 0, 0}, {0, 0, 0, 0} }; c = getopt_long (argc, argv, "abc:d:0123456789", long_options, &option_index); if (c == -1) break; switch (c) { case 0: printf ("option %s", long_options[option_index].name); if (optarg) printf (" with arg %s", optarg); printf ("\n"); break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case 'd': printf ("option d with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ bogofilter-1.2.4/INSTALL0000644000175000017500000002617312163572311013101 0ustar sezsez# $Id: INSTALL 6666 2007-07-23 11:12:00Z m-a $ ======================================================================== NOTE: Whenever you are about to update your bogofilter version, be sure to read the corresponding RELEASE.NOTES file first. Any INCOMPATIBLE or major changes to bogofilter's mode of operation will be documented in it. Bogofilter supports several different database back ends, at the time of this writing in alphabetical order database, with version (patchlevel omitted) URL to home page --------------------------------------------- --------------------- 1a.Berkeley DB (3.1 - 4.4) with transactions http://sleepycat.com/ 1b.Berkeley DB (3.1 - 4.4) without transactions http://sleepycat.com/ 2. QDBM (1.7.23 or newer) http://qdbm.sf.net/ 3. SQLite (3.2.6 or newer) http://sqlite.org/ You can use --with-database=ARG (choose from db (for Berkeley DB), qdbm, sqlite) to pick the database backend (you must have installed the database and the corresponding developer package). db is the default. If you are using "db", you can use --disable-transactions or --enable-transactions to force the use of 1a or 1b. The default is to compile both modes into bogofilter and find out automatically at run time. See doc/README.db for details. REMEMBER to read the doc/programmer/README.* file for your operating systems in case of trouble. NOTE: If you are about to build from code checked out via SVN, then please read the README.svn file first before you proceed with this file! make command ============ Should your installed "make" command cause difficulties, try "gmake" (assuming GNU make is installed as gmake) and retry before reporting trouble. Some UNIX "make" commands (for instance, on Solaris 2.6) are known to break in certain configurations, particularly with 'VPATH' builds mentioned below. ======================================================================== Installation Instructions ************************* Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005 Free Software Foundation, Inc. This file is free documentation; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. Basic Installation ================== These are generic installation instructions. The 'configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a 'Makefile' in each directory of the package. It may also create one or more '.h' files containing system-dependent definitions. Finally, it creates a shell script 'config.status' that you can run in the future to recreate the current configuration, and a file 'config.log' containing compiler output (useful mainly for debugging 'configure'). It can also use an optional file (typically called 'config.cache' and enabled with '--cache-file=config.cache' or simply '-C') that saves the results of its tests to speed up reconfiguring. (Caching is disabled by default to prevent problems with accidental use of stale cache files.) If you need to do unusual things to compile the package, please try to figure out how 'configure' could check whether to do them, and mail diffs or instructions to the address given in the 'README' so they can be considered for the next release. If you are using the cache, and at some point 'config.cache' contains results you don't want to keep, you may remove or edit it. The file 'configure.ac' (or 'configure.in') is used to create 'configure' by a program called 'autoconf'. You only need 'configure.ac' if you want to change it or regenerate 'configure' using a newer version of 'autoconf'. The simplest way to compile this package is: 1. 'cd' to the directory containing the package's source code and type './configure' to configure the package for your system. If you're using 'csh' on an old version of System V, you might need to type 'sh ./configure' instead to prevent 'csh' from trying to execute 'configure' itself. Running 'configure' takes awhile. While running, it prints some messages telling which features it is checking for. 2. Type 'make' to compile the package. 3. Optionally, type 'make check' to run any self-tests that come with the package. 4. Type 'make install' to install the programs and any data files and documentation. 5. You can remove the program binaries and object files from the source code directory by typing 'make clean'. To also remove the files that 'configure' created (so you can compile the package for a different kind of computer), type 'make distclean'. There is also a 'make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the 'configure' script does not know about. Run './configure --help' for details on some of the pertinent environment variables. You can give 'configure' initial values for configuration parameters by setting variables in the command line or in the environment. Here is an example: ./configure CC=c89 CFLAGS=-O2 LIBS=-lposix *Note Defining Variables::, for more details. Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you must use a version of 'make' that supports the 'VPATH' variable, such as GNU 'make'. 'cd' to the directory where you want the object files and executables to go and run the 'configure' script. 'configure' automatically checks for the source code in the directory that 'configure' is in and in '..'. If you have to use a 'make' that does not support the 'VPATH' variable, you have to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use 'make distclean' before reconfiguring for another architecture. Installation Names ================== By default, 'make install' will install the package's files in '/usr/local/bin', '/usr/local/man', etc. You can specify an installation prefix other than '/usr/local' by giving 'configure' the option '--prefix=PREFIX'. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you give 'configure' the option '--exec-prefix=PREFIX', the package will use PREFIX as the prefix for installing programs and libraries. Documentation and other data files will still use the regular prefix. In addition, if you use an unusual directory layout you can give options like '--bindir=DIR' to specify different values for particular kinds of files. Run 'configure --help' for a list of the directories you can set and what kinds of files go in them. If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving 'configure' the option '--program-prefix=PREFIX' or '--program-suffix=SUFFIX'. Optional Features ================= Some packages pay attention to '--enable-FEATURE' options to 'configure', where FEATURE indicates an optional part of the package. They may also pay attention to '--with-PACKAGE' options, where PACKAGE is something like 'gnu-as' or 'x' (for the X Window System). The 'README' should mention any '--enable-' and '--with-' options that the package recognizes. For packages that use the X Window System, 'configure' can usually find the X include and library files automatically, but if it doesn't, you can use the 'configure' options '--x-includes=DIR' and '--x-libraries=DIR' to specify their locations. Specifying the System Type ========================== There may be some features 'configure' cannot figure out automatically, but needs to determine by the type of machine the package will run on. Usually, assuming the package is built to be run on the _same_ architectures, 'configure' can figure that out, but if it prints a message saying it cannot guess the machine type, give it the '--build=TYPE' option. TYPE can either be a short name for the system type, such as 'sun4', or a canonical name which has the form: CPU-COMPANY-SYSTEM where SYSTEM can have one of these forms: OS KERNEL-OS See the file 'config.sub' for the possible values of each field. If 'config.sub' isn't included in this package, then this package doesn't need to know the machine type. If you are _building_ compiler tools for cross-compiling, you should use the '--target=TYPE' option to select the type of system they will produce code for. If you want to _use_ a cross compiler, that generates code for a platform different from the build platform, you should specify the "host" platform (i.e., that on which the generated programs will eventually be run) with '--host=TYPE'. Sharing Defaults ================ If you want to set default values for 'configure' scripts to share, you can create a site shell script called 'config.site' that gives default values for variables like 'CC', 'cache_file', and 'prefix'. 'configure' looks for 'PREFIX/share/config.site' if it exists, then 'PREFIX/etc/config.site' if it exists. Or, you can set the 'CONFIG_SITE' environment variable to the location of the site script. A warning: not all 'configure' scripts look for a site script. Defining Variables ================== Variables not defined in a site shell script can be set in the environment passed to 'configure'. However, some packages may run configure again during the build, and the customized values of these variables may be lost. In order to avoid this problem, you should set them in the 'configure' command line, using 'VAR=value'. For example: ./configure CC=/usr/local2/bin/gcc causes the specified 'gcc' to be used as the C compiler (unless it is overridden in the site shell script). Here is a another example: /bin/bash ./configure CONFIG_SHELL=/bin/bash Here the 'CONFIG_SHELL=/bin/bash' operand causes subsequent configuration-related scripts to be executed by '/bin/bash'. 'configure' Invocation ====================== 'configure' recognizes the following options to control how it operates. '--help' '-h' Print a summary of the options to 'configure', and exit. '--version' '-V' Print the version of Autoconf used to generate the 'configure' script, and exit. '--cache-file=FILE' Enable the cache: use and save the results of the tests in FILE, traditionally 'config.cache'. FILE defaults to '/dev/null' to disable caching. '--config-cache' '-C' Alias for '--cache-file=config.cache'. '--quiet' '--silent' '-q' Do not print messages saying which checks are being made. To suppress all normal output, redirect it to '/dev/null' (any error messages will still be shown). '--srcdir=DIR' Look for the package's source code in directory DIR. Usually 'configure' can determine that directory automatically. 'configure' also accepts some other, not widely useful, options. Run 'configure --help' for more details. 
    ------------------
You are receiving this email because you have opted-in to receive
email from publisher: sarckos.  To unsubscribe, click below:

http://u.azogle.com/?z=22-418714-ZYPb9G