From a060376f1e240006839fcc9f0355364fb860fbe0 Mon Sep 17 00:00:00 2001
From: z3APA3A <3APA3A@3proxy.ru>
Date: Tue, 8 Apr 2014 13:03:21 +0400
Subject: [PATCH] initial import to git
---
.gitattributes | 22 +
.gitignore | 215 +
Changelog | 2215 ++++++
Makefile.Linux | 98 +
Makefile.Solaris | 35 +
Makefile.Solaris-gcc | 36 +
Makefile.am | 2 +
Makefile.ccc | 35 +
Makefile.debug | 27 +
Makefile.inc | 13 +
Makefile.intl | 34 +
Makefile.msvc | 36 +
Makefile.msvc64 | 35 +
Makefile.msvcCE | 36 +
Makefile.unix | 58 +
Makefile.unix-install | 61 +
Makefile.win | 35 +
Makefile.winCE | 35 +
Readme | 67 +
authors | 1 +
cfg/0.scenario.txt | 18 +
cfg/3proxy.cfg.sample | 202 +
cfg/counters.sample | 53 +
contrib/www3proxy/isqlodbc/Makefile.inc | 6 +
contrib/www3proxy/isqlodbc/Makefile.unix | 15 +
contrib/www3proxy/isqlodbc/Makefile.win | 15 +
contrib/www3proxy/isqlodbc/isqlodbc.c | 191 +
contrib/www3proxy/log.sql | 22 +
contrib/www3proxy/readme.ru | 63 +
contrib/www3proxy/stat.awk | 129 +
contrib/www3proxy/stat.pl | 185 +
copying | 62 +
doc/html/faqe.html | 158 +
doc/html/faqr.html | 283 +
doc/html/howtoe.html | 835 +++
doc/html/howtor.html | 1031 +++
doc/html/index.html | 18 +
doc/html/man3/3proxy.cfg.3.html | 1300 ++++
doc/html/man8/3proxy.8.html | 268 +
doc/html/man8/3proxy.conf.3.html | 693 ++
doc/html/man8/ftppr.8.html | 160 +
doc/html/man8/icqpr.8.html | 155 +
doc/html/man8/pop3p.8.html | 154 +
doc/html/man8/proxy.8.html | 147 +
doc/html/man8/smtpp.8.html | 155 +
doc/html/man8/socks.8.html | 148 +
doc/html/man8/tcppm.8.html | 146 +
doc/html/man8/udppm.8.html | 153 +
doc/html/securityen.html | 37 +
doc/ru/3proxy_for_dummies.rtf | 1825 +++++
doc/ru/example1.txt | 99 +
doc/ru/iodbc.txt | 101 +
doc/ru/odbc.txt | 28 +
man/3proxy.8 | 153 +
man/3proxy.cfg.3 | 896 +++
man/ftppr.8 | 85 +
man/icqpr.8 | 78 +
man/pop3p.8 | 81 +
man/proxy.8 | 76 +
man/smtpp.8 | 82 +
man/socks.8 | 77 +
man/tcppm.8 | 71 +
man/udppm.8 | 77 +
news | 143 +
scripts/3proxy.cfg | 32 +
scripts/add3proxyuser.sh | 10 +
scripts/install-unix.sh | 21 +
scripts/rc.d/proxy.sh | 48 +
src/3proxy.c | 2027 ++++++
src/Makefile | 1 +
src/Makefile.inc | 181 +
src/auth.c | 1329 ++++
src/base64.c | 104 +
src/common.c | 721 ++
src/countersutil.c | 145 +
src/datatypes.c | 834 +++
src/dighosts.c | 142 +
src/dnspr.c | 196 +
src/ftp.c | 233 +
src/ftppr.c | 329 +
src/icqpr.c | 533 ++
src/libs/md4.c | 315 +
src/libs/md4.h | 83 +
src/libs/md5.c | 345 +
src/libs/md5.h | 94 +
src/libs/regex.c | 3821 ++++++++++
src/libs/regex.h | 74 +
src/libs/smbdes.c | 321 +
src/msnpr.c | 234 +
src/myalloc.c | 367 +
src/mycrypt.c | 200 +
src/ntlm.c | 89 +
src/plugins.c | 142 +
src/plugins/CVS/Entries | 7 +
src/plugins/CVS/Repository | 1 +
src/plugins/CVS/Root | 1 +
src/plugins/FilePlugin/CVS/Entries | 4 +
src/plugins/FilePlugin/CVS/Repository | 1 +
src/plugins/FilePlugin/CVS/Root | 1 +
src/plugins/FilePlugin/FilePlugin.c | 895 +++
src/plugins/FilePlugin/FilePlugin.h | 41 +
src/plugins/FilePlugin/Makefile | 1 +
src/plugins/FilePlugin/Makefile.inc | 7 +
src/plugins/FilePlugin/Makefile.var | 37 +
src/plugins/LastFRipper/Makefile | 1 +
src/plugins/LastFRipper/Makefile.inc | 7 +
src/plugins/LastFRipper/Makefile.var | 37 +
src/plugins/LastFRipper/lastFripper.c | 704 ++
src/plugins/LastFRipper/lastFripper.h | 66 +
src/plugins/LdapPlugin/com-unix.sh | 3 +
src/plugins/LdapPlugin/com-win32.bat | 4 +
src/plugins/LdapPlugin/getldapuser.c | 105 +
src/plugins/LdapPlugin/ldapauth.c | 575 ++
src/plugins/LdapPlugin/ldapauth.txt | 602 ++
src/plugins/PCREPlugin/CVS/Entries | 2 +
src/plugins/PCREPlugin/CVS/Repository | 1 +
src/plugins/PCREPlugin/CVS/Root | 1 +
src/plugins/PCREPlugin/Makefile | 1 +
src/plugins/PCREPlugin/Makefile.inc | 71 +
src/plugins/PCREPlugin/Makefile.var | 37 +
src/plugins/PCREPlugin/config.h | 145 +
src/plugins/PCREPlugin/pcre.h | 304 +
src/plugins/PCREPlugin/pcre_compile.c | 6145 +++++++++++++++++
src/plugins/PCREPlugin/pcre_config.c | 128 +
src/plugins/PCREPlugin/pcre_dfa_exec.c | 2896 ++++++++
src/plugins/PCREPlugin/pcre_dftables.c | 192 +
src/plugins/PCREPlugin/pcre_exec.c | 4938 +++++++++++++
src/plugins/PCREPlugin/pcre_fullinfo.c | 165 +
src/plugins/PCREPlugin/pcre_get.c | 465 ++
src/plugins/PCREPlugin/pcre_globals.c | 63 +
src/plugins/PCREPlugin/pcre_info.c | 93 +
src/plugins/PCREPlugin/pcre_internal.h | 1118 +++
src/plugins/PCREPlugin/pcre_maketables.c | 143 +
src/plugins/PCREPlugin/pcre_newline.c | 164 +
src/plugins/PCREPlugin/pcre_ord2utf8.c | 85 +
src/plugins/PCREPlugin/pcre_plugin.c | 400 ++
src/plugins/PCREPlugin/pcre_refcount.c | 82 +
src/plugins/PCREPlugin/pcre_study.c | 579 ++
src/plugins/PCREPlugin/pcre_tables.c | 318 +
src/plugins/PCREPlugin/pcre_try_flipped.c | 137 +
src/plugins/PCREPlugin/pcre_ucp_searchfuncs.c | 179 +
src/plugins/PCREPlugin/pcre_valid_utf8.c | 162 +
src/plugins/PCREPlugin/pcre_version.c | 90 +
src/plugins/PCREPlugin/pcre_xclass.c | 148 +
src/plugins/PCREPlugin/pcreposix.c | 337 +
src/plugins/PCREPlugin/pcreposix.h | 142 +
src/plugins/PCREPlugin/ucp.h | 133 +
src/plugins/PCREPlugin/ucpinternal.h | 92 +
src/plugins/PCREPlugin/ucptable.c | 3068 ++++++++
src/plugins/PCREPlugin/ucptable.h | 3068 ++++++++
src/plugins/PamAuth/Makefile | 1 +
src/plugins/PamAuth/Makefile.inc | 7 +
src/plugins/PamAuth/PAMAUTH.TXT | 30 +
src/plugins/PamAuth/pamauth.c | 140 +
src/plugins/SSLPlugin/CVS/Entries | 1 +
src/plugins/SSLPlugin/CVS/Repository | 1 +
src/plugins/SSLPlugin/CVS/Root | 1 +
src/plugins/SSLPlugin/Makefile | 1 +
src/plugins/SSLPlugin/Makefile.inc | 14 +
src/plugins/SSLPlugin/Makefile.var | 37 +
src/plugins/SSLPlugin/my_ssl.c | 453 ++
src/plugins/SSLPlugin/my_ssl.h | 43 +
src/plugins/SSLPlugin/ssl_plugin.c | 371 +
src/plugins/StringsPlugin/CVS/Entries | 2 +
src/plugins/StringsPlugin/CVS/Repository | 1 +
src/plugins/StringsPlugin/CVS/Root | 1 +
src/plugins/StringsPlugin/Makefile | 1 +
src/plugins/StringsPlugin/Makefile.inc | 7 +
src/plugins/StringsPlugin/Makefile.var | 37 +
src/plugins/StringsPlugin/ReadMe.txt | 63 +
src/plugins/StringsPlugin/StringsPlugin.c | 254 +
src/plugins/TrafficPlugin/CVS/Entries | 2 +
src/plugins/TrafficPlugin/CVS/Repository | 1 +
src/plugins/TrafficPlugin/CVS/Root | 1 +
src/plugins/TrafficPlugin/Changelog.txt | 13 +
src/plugins/TrafficPlugin/Makefile | 1 +
src/plugins/TrafficPlugin/Makefile.inc | 7 +
src/plugins/TrafficPlugin/Makefile.var | 37 +
src/plugins/TrafficPlugin/ReadMe.txt | 67 +
src/plugins/TrafficPlugin/TrafficPlugin.c | 282 +
src/plugins/TransparentPlugin/CVS/Entries | 1 +
src/plugins/TransparentPlugin/CVS/Repository | 1 +
src/plugins/TransparentPlugin/CVS/Root | 1 +
src/plugins/TransparentPlugin/Makefile | 1 +
src/plugins/TransparentPlugin/Makefile.inc | 10 +
src/plugins/TransparentPlugin/Makefile.var | 35 +
.../TransparentPlugin/transparent_plugin.c | 114 +
src/plugins/WindowsAuthentication/CVS/Entries | 4 +
.../WindowsAuthentication/CVS/Repository | 1 +
src/plugins/WindowsAuthentication/CVS/Root | 1 +
src/plugins/WindowsAuthentication/Makefile | 1 +
.../WindowsAuthentication/Makefile.inc | 8 +
.../WindowsAuthentication/Makefile.var | 37 +
.../WindowsAuthentication.c | 103 +
src/plugins/WindowsAuthentication/copying | 31 +
src/plugins/utf8tocp1251/CVS/Entries | 1 +
src/plugins/utf8tocp1251/CVS/Repository | 1 +
src/plugins/utf8tocp1251/CVS/Root | 1 +
src/plugins/utf8tocp1251/Makefile | 1 +
src/plugins/utf8tocp1251/Makefile.inc | 8 +
src/plugins/utf8tocp1251/Makefile.var | 37 +
src/plugins/utf8tocp1251/utf8tocp1251.c | 98 +
src/pop3p.c | 73 +
src/proxy.c | 1120 +++
src/proxy.h | 331 +
src/proxymain.c | 956 +++
src/pstdint.h | 800 +++
src/smtpp.c | 317 +
src/sockgetchar.c | 173 +
src/sockmap.c | 265 +
src/socks.c | 421 ++
src/stringtable.c | 80 +
src/structures.h | 665 ++
src/tcppm.c | 41 +
src/udppm.c | 118 +
src/version.h | 2 +
src/webadmin.c | 585 ++
217 files changed, 64253 insertions(+)
create mode 100644 .gitattributes
create mode 100644 .gitignore
create mode 100644 Changelog
create mode 100644 Makefile.Linux
create mode 100644 Makefile.Solaris
create mode 100644 Makefile.Solaris-gcc
create mode 100644 Makefile.am
create mode 100644 Makefile.ccc
create mode 100644 Makefile.debug
create mode 100644 Makefile.inc
create mode 100644 Makefile.intl
create mode 100644 Makefile.msvc
create mode 100644 Makefile.msvc64
create mode 100644 Makefile.msvcCE
create mode 100644 Makefile.unix
create mode 100644 Makefile.unix-install
create mode 100644 Makefile.win
create mode 100644 Makefile.winCE
create mode 100644 Readme
create mode 100644 authors
create mode 100644 cfg/0.scenario.txt
create mode 100644 cfg/3proxy.cfg.sample
create mode 100644 cfg/counters.sample
create mode 100644 contrib/www3proxy/isqlodbc/Makefile.inc
create mode 100644 contrib/www3proxy/isqlodbc/Makefile.unix
create mode 100644 contrib/www3proxy/isqlodbc/Makefile.win
create mode 100644 contrib/www3proxy/isqlodbc/isqlodbc.c
create mode 100644 contrib/www3proxy/log.sql
create mode 100644 contrib/www3proxy/readme.ru
create mode 100644 contrib/www3proxy/stat.awk
create mode 100644 contrib/www3proxy/stat.pl
create mode 100644 copying
create mode 100644 doc/html/faqe.html
create mode 100644 doc/html/faqr.html
create mode 100644 doc/html/howtoe.html
create mode 100644 doc/html/howtor.html
create mode 100644 doc/html/index.html
create mode 100644 doc/html/man3/3proxy.cfg.3.html
create mode 100644 doc/html/man8/3proxy.8.html
create mode 100644 doc/html/man8/3proxy.conf.3.html
create mode 100644 doc/html/man8/ftppr.8.html
create mode 100644 doc/html/man8/icqpr.8.html
create mode 100644 doc/html/man8/pop3p.8.html
create mode 100644 doc/html/man8/proxy.8.html
create mode 100644 doc/html/man8/smtpp.8.html
create mode 100644 doc/html/man8/socks.8.html
create mode 100644 doc/html/man8/tcppm.8.html
create mode 100644 doc/html/man8/udppm.8.html
create mode 100644 doc/html/securityen.html
create mode 100644 doc/ru/3proxy_for_dummies.rtf
create mode 100644 doc/ru/example1.txt
create mode 100644 doc/ru/iodbc.txt
create mode 100644 doc/ru/odbc.txt
create mode 100644 man/3proxy.8
create mode 100644 man/3proxy.cfg.3
create mode 100644 man/ftppr.8
create mode 100644 man/icqpr.8
create mode 100644 man/pop3p.8
create mode 100644 man/proxy.8
create mode 100644 man/smtpp.8
create mode 100644 man/socks.8
create mode 100644 man/tcppm.8
create mode 100644 man/udppm.8
create mode 100644 news
create mode 100644 scripts/3proxy.cfg
create mode 100644 scripts/add3proxyuser.sh
create mode 100644 scripts/install-unix.sh
create mode 100644 scripts/rc.d/proxy.sh
create mode 100644 src/3proxy.c
create mode 100644 src/Makefile
create mode 100644 src/Makefile.inc
create mode 100644 src/auth.c
create mode 100644 src/base64.c
create mode 100644 src/common.c
create mode 100644 src/countersutil.c
create mode 100644 src/datatypes.c
create mode 100644 src/dighosts.c
create mode 100644 src/dnspr.c
create mode 100644 src/ftp.c
create mode 100644 src/ftppr.c
create mode 100644 src/icqpr.c
create mode 100644 src/libs/md4.c
create mode 100644 src/libs/md4.h
create mode 100644 src/libs/md5.c
create mode 100644 src/libs/md5.h
create mode 100644 src/libs/regex.c
create mode 100644 src/libs/regex.h
create mode 100644 src/libs/smbdes.c
create mode 100644 src/msnpr.c
create mode 100644 src/myalloc.c
create mode 100644 src/mycrypt.c
create mode 100644 src/ntlm.c
create mode 100644 src/plugins.c
create mode 100644 src/plugins/CVS/Entries
create mode 100644 src/plugins/CVS/Repository
create mode 100644 src/plugins/CVS/Root
create mode 100644 src/plugins/FilePlugin/CVS/Entries
create mode 100644 src/plugins/FilePlugin/CVS/Repository
create mode 100644 src/plugins/FilePlugin/CVS/Root
create mode 100644 src/plugins/FilePlugin/FilePlugin.c
create mode 100644 src/plugins/FilePlugin/FilePlugin.h
create mode 100644 src/plugins/FilePlugin/Makefile
create mode 100644 src/plugins/FilePlugin/Makefile.inc
create mode 100644 src/plugins/FilePlugin/Makefile.var
create mode 100644 src/plugins/LastFRipper/Makefile
create mode 100644 src/plugins/LastFRipper/Makefile.inc
create mode 100644 src/plugins/LastFRipper/Makefile.var
create mode 100644 src/plugins/LastFRipper/lastFripper.c
create mode 100644 src/plugins/LastFRipper/lastFripper.h
create mode 100644 src/plugins/LdapPlugin/com-unix.sh
create mode 100644 src/plugins/LdapPlugin/com-win32.bat
create mode 100644 src/plugins/LdapPlugin/getldapuser.c
create mode 100644 src/plugins/LdapPlugin/ldapauth.c
create mode 100644 src/plugins/LdapPlugin/ldapauth.txt
create mode 100644 src/plugins/PCREPlugin/CVS/Entries
create mode 100644 src/plugins/PCREPlugin/CVS/Repository
create mode 100644 src/plugins/PCREPlugin/CVS/Root
create mode 100644 src/plugins/PCREPlugin/Makefile
create mode 100644 src/plugins/PCREPlugin/Makefile.inc
create mode 100644 src/plugins/PCREPlugin/Makefile.var
create mode 100644 src/plugins/PCREPlugin/config.h
create mode 100644 src/plugins/PCREPlugin/pcre.h
create mode 100644 src/plugins/PCREPlugin/pcre_compile.c
create mode 100644 src/plugins/PCREPlugin/pcre_config.c
create mode 100644 src/plugins/PCREPlugin/pcre_dfa_exec.c
create mode 100644 src/plugins/PCREPlugin/pcre_dftables.c
create mode 100644 src/plugins/PCREPlugin/pcre_exec.c
create mode 100644 src/plugins/PCREPlugin/pcre_fullinfo.c
create mode 100644 src/plugins/PCREPlugin/pcre_get.c
create mode 100644 src/plugins/PCREPlugin/pcre_globals.c
create mode 100644 src/plugins/PCREPlugin/pcre_info.c
create mode 100644 src/plugins/PCREPlugin/pcre_internal.h
create mode 100644 src/plugins/PCREPlugin/pcre_maketables.c
create mode 100644 src/plugins/PCREPlugin/pcre_newline.c
create mode 100644 src/plugins/PCREPlugin/pcre_ord2utf8.c
create mode 100644 src/plugins/PCREPlugin/pcre_plugin.c
create mode 100644 src/plugins/PCREPlugin/pcre_refcount.c
create mode 100644 src/plugins/PCREPlugin/pcre_study.c
create mode 100644 src/plugins/PCREPlugin/pcre_tables.c
create mode 100644 src/plugins/PCREPlugin/pcre_try_flipped.c
create mode 100644 src/plugins/PCREPlugin/pcre_ucp_searchfuncs.c
create mode 100644 src/plugins/PCREPlugin/pcre_valid_utf8.c
create mode 100644 src/plugins/PCREPlugin/pcre_version.c
create mode 100644 src/plugins/PCREPlugin/pcre_xclass.c
create mode 100644 src/plugins/PCREPlugin/pcreposix.c
create mode 100644 src/plugins/PCREPlugin/pcreposix.h
create mode 100644 src/plugins/PCREPlugin/ucp.h
create mode 100644 src/plugins/PCREPlugin/ucpinternal.h
create mode 100644 src/plugins/PCREPlugin/ucptable.c
create mode 100644 src/plugins/PCREPlugin/ucptable.h
create mode 100644 src/plugins/PamAuth/Makefile
create mode 100644 src/plugins/PamAuth/Makefile.inc
create mode 100644 src/plugins/PamAuth/PAMAUTH.TXT
create mode 100644 src/plugins/PamAuth/pamauth.c
create mode 100644 src/plugins/SSLPlugin/CVS/Entries
create mode 100644 src/plugins/SSLPlugin/CVS/Repository
create mode 100644 src/plugins/SSLPlugin/CVS/Root
create mode 100644 src/plugins/SSLPlugin/Makefile
create mode 100644 src/plugins/SSLPlugin/Makefile.inc
create mode 100644 src/plugins/SSLPlugin/Makefile.var
create mode 100644 src/plugins/SSLPlugin/my_ssl.c
create mode 100644 src/plugins/SSLPlugin/my_ssl.h
create mode 100644 src/plugins/SSLPlugin/ssl_plugin.c
create mode 100644 src/plugins/StringsPlugin/CVS/Entries
create mode 100644 src/plugins/StringsPlugin/CVS/Repository
create mode 100644 src/plugins/StringsPlugin/CVS/Root
create mode 100644 src/plugins/StringsPlugin/Makefile
create mode 100644 src/plugins/StringsPlugin/Makefile.inc
create mode 100644 src/plugins/StringsPlugin/Makefile.var
create mode 100644 src/plugins/StringsPlugin/ReadMe.txt
create mode 100644 src/plugins/StringsPlugin/StringsPlugin.c
create mode 100644 src/plugins/TrafficPlugin/CVS/Entries
create mode 100644 src/plugins/TrafficPlugin/CVS/Repository
create mode 100644 src/plugins/TrafficPlugin/CVS/Root
create mode 100644 src/plugins/TrafficPlugin/Changelog.txt
create mode 100644 src/plugins/TrafficPlugin/Makefile
create mode 100644 src/plugins/TrafficPlugin/Makefile.inc
create mode 100644 src/plugins/TrafficPlugin/Makefile.var
create mode 100644 src/plugins/TrafficPlugin/ReadMe.txt
create mode 100644 src/plugins/TrafficPlugin/TrafficPlugin.c
create mode 100644 src/plugins/TransparentPlugin/CVS/Entries
create mode 100644 src/plugins/TransparentPlugin/CVS/Repository
create mode 100644 src/plugins/TransparentPlugin/CVS/Root
create mode 100644 src/plugins/TransparentPlugin/Makefile
create mode 100644 src/plugins/TransparentPlugin/Makefile.inc
create mode 100644 src/plugins/TransparentPlugin/Makefile.var
create mode 100644 src/plugins/TransparentPlugin/transparent_plugin.c
create mode 100644 src/plugins/WindowsAuthentication/CVS/Entries
create mode 100644 src/plugins/WindowsAuthentication/CVS/Repository
create mode 100644 src/plugins/WindowsAuthentication/CVS/Root
create mode 100644 src/plugins/WindowsAuthentication/Makefile
create mode 100644 src/plugins/WindowsAuthentication/Makefile.inc
create mode 100644 src/plugins/WindowsAuthentication/Makefile.var
create mode 100644 src/plugins/WindowsAuthentication/WindowsAuthentication.c
create mode 100644 src/plugins/WindowsAuthentication/copying
create mode 100644 src/plugins/utf8tocp1251/CVS/Entries
create mode 100644 src/plugins/utf8tocp1251/CVS/Repository
create mode 100644 src/plugins/utf8tocp1251/CVS/Root
create mode 100644 src/plugins/utf8tocp1251/Makefile
create mode 100644 src/plugins/utf8tocp1251/Makefile.inc
create mode 100644 src/plugins/utf8tocp1251/Makefile.var
create mode 100644 src/plugins/utf8tocp1251/utf8tocp1251.c
create mode 100644 src/pop3p.c
create mode 100644 src/proxy.c
create mode 100644 src/proxy.h
create mode 100644 src/proxymain.c
create mode 100644 src/pstdint.h
create mode 100644 src/smtpp.c
create mode 100644 src/sockgetchar.c
create mode 100644 src/sockmap.c
create mode 100644 src/socks.c
create mode 100644 src/stringtable.c
create mode 100644 src/structures.h
create mode 100644 src/tcppm.c
create mode 100644 src/udppm.c
create mode 100644 src/version.h
create mode 100644 src/webadmin.c
diff --git a/.gitattributes b/.gitattributes
new file mode 100644
index 0000000..412eeda
--- /dev/null
+++ b/.gitattributes
@@ -0,0 +1,22 @@
+# Auto detect text files and perform LF normalization
+* text=auto
+
+# Custom for Visual Studio
+*.cs diff=csharp
+*.sln merge=union
+*.csproj merge=union
+*.vbproj merge=union
+*.fsproj merge=union
+*.dbproj merge=union
+
+# Standard to msysgit
+*.doc diff=astextplain
+*.DOC diff=astextplain
+*.docx diff=astextplain
+*.DOCX diff=astextplain
+*.dot diff=astextplain
+*.DOT diff=astextplain
+*.pdf diff=astextplain
+*.PDF diff=astextplain
+*.rtf diff=astextplain
+*.RTF diff=astextplain
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..b9d6bd9
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,215 @@
+#################
+## Eclipse
+#################
+
+*.pydevproject
+.project
+.metadata
+bin/
+tmp/
+*.tmp
+*.bak
+*.swp
+*~.nib
+local.properties
+.classpath
+.settings/
+.loadpath
+
+# External tool builders
+.externalToolBuilders/
+
+# Locally stored "Eclipse launch configurations"
+*.launch
+
+# CDT-specific
+.cproject
+
+# PDT-specific
+.buildpath
+
+
+#################
+## Visual Studio
+#################
+
+## Ignore Visual Studio temporary files, build results, and
+## files generated by popular Visual Studio add-ons.
+
+# User-specific files
+*.suo
+*.user
+*.sln.docstates
+
+# Build results
+
+[Dd]ebug/
+[Rr]elease/
+x64/
+build/
+[Bb]in/
+[Oo]bj/
+
+# MSTest test Results
+[Tt]est[Rr]esult*/
+[Bb]uild[Ll]og.*
+
+*_i.c
+*_p.c
+*.ilk
+*.meta
+*.obj
+*.pch
+*.pdb
+*.pgc
+*.pgd
+*.rsp
+*.sbr
+*.tlb
+*.tli
+*.tlh
+*.tmp
+*.tmp_proj
+*.log
+*.vspscc
+*.vssscc
+.builds
+*.pidb
+*.log
+*.scc
+
+# Visual C++ cache files
+ipch/
+*.aps
+*.ncb
+*.opensdf
+*.sdf
+*.cachefile
+
+# Visual Studio profiler
+*.psess
+*.vsp
+*.vspx
+
+# Guidance Automation Toolkit
+*.gpState
+
+# ReSharper is a .NET coding add-in
+_ReSharper*/
+*.[Rr]e[Ss]harper
+
+# TeamCity is a build add-in
+_TeamCity*
+
+# DotCover is a Code Coverage Tool
+*.dotCover
+
+# NCrunch
+*.ncrunch*
+.*crunch*.local.xml
+
+# Installshield output folder
+[Ee]xpress/
+
+# DocProject is a documentation generator add-in
+DocProject/buildhelp/
+DocProject/Help/*.HxT
+DocProject/Help/*.HxC
+DocProject/Help/*.hhc
+DocProject/Help/*.hhk
+DocProject/Help/*.hhp
+DocProject/Help/Html2
+DocProject/Help/html
+
+# Click-Once directory
+publish/
+
+# Publish Web Output
+*.Publish.xml
+*.pubxml
+
+# NuGet Packages Directory
+## TODO: If you have NuGet Package Restore enabled, uncomment the next line
+#packages/
+
+# Windows Azure Build Output
+csx
+*.build.csdef
+
+# Windows Store app package directory
+AppPackages/
+
+# Others
+sql/
+*.Cache
+ClientBin/
+[Ss]tyle[Cc]op.*
+~$*
+*~
+*.dbmdl
+*.[Pp]ublish.xml
+*.pfx
+*.publishsettings
+
+# RIA/Silverlight projects
+Generated_Code/
+
+# Backup & report files from converting an old project file to a newer
+# Visual Studio version. Backup files are not needed, because we have git ;-)
+_UpgradeReport_Files/
+Backup*/
+UpgradeLog*.XML
+UpgradeLog*.htm
+
+# SQL Server files
+App_Data/*.mdf
+App_Data/*.ldf
+
+#############
+## Windows detritus
+#############
+
+# Windows image file caches
+Thumbs.db
+ehthumbs.db
+
+# Folder config file
+Desktop.ini
+
+# Recycle Bin used on file shares
+$RECYCLE.BIN/
+
+# Mac crap
+.DS_Store
+
+
+#############
+## Python
+#############
+
+*.py[co]
+
+# Packages
+*.egg
+*.egg-info
+dist/
+build/
+eggs/
+parts/
+var/
+sdist/
+develop-eggs/
+.installed.cfg
+
+# Installer logs
+pip-log.txt
+
+# Unit test / coverage reports
+.coverage
+.tox
+
+#Translations
+*.mo
+
+#Mr Developer
+.mr.developer.cfg
diff --git a/Changelog b/Changelog
new file mode 100644
index 0000000..017822e
--- /dev/null
+++ b/Changelog
@@ -0,0 +1,2215 @@
+08.04.2014
+Releasing as 0.7
+Significant changes since 0.6.1:
+!! auth iponly by default
+! maxconn is 500 by default
+! Improved HTTP/1.1 compatibility
+! Functionality bugfixes
++ Few new plugins
+
+11.07.2012
+! fixed: counters over 4GB in webadmin
+
+26.06.2012
+! OpenSSL thread support functions added to SSL plugin
+
+10.05.2012
+! SSL plugin works. Commands to enable/disable SSL spoofing will be added later.
+
+25.04.2012
+! pcre_rewrite slash sequence logic corrected
+
+16.04.2012
++ Added: SSLPlugin for SSL decryption with certificates spoofing
+
+12.04.2012
++ Added: new filter callback function type (pre data filter) for things like SSL/TLS, gzip, etc.
+ WARNING: all plugins with filter functions need to be reviewed for compatibility
+
+06.02.2012
++ Added: transparent redirection plugin for linux. Automatically detects redirection
+ address if traffic is redirected via iptables
+
+15.08.2011
+! Fixed: 100% CPU because of usleep with large value on NetBSD
+
+11.06.2011
++ Support for extusername/extpassword added to smtpp
+
+04.06.2011
+! Fixed: web admin access
+! Fixed: wrong error code in logfile in some rare cases
+! Migrated to VC 9.0 compiler
+
+14.04.2011
+! Authentication: do not request username/password in mixed authentication
+ if all modules deny access.
+
+12.04.2011
+! Minor code cleanup
+
+17.12.2010
+- Debugging output to stdout removed
+
+09.12.2010
+! Code cleanup for sockets mapping and chunked encoding,
+! Content-Length up to 4GB
+
+25.11.2010
++ System locale handling added for mixed case username in WindowAuthentication
+
+13.11.2010
++ Plugin utf8tocp1251 added to automatically detect UTF-8 (used by Chrome and
+ Opera in username/password.
+
+ usage
+
+ plugin "utf8tocp1251" utf8tocp1251
+ auth utf8tocp1251 strong
+
+ or
+
+ auth utf8tocp1251 cache windows
+
+
+11.11.2010
+! encoding paramter added to WWW-Authenticate and Proxy-Authenticate headers in
+ .3ps files according to
+ http://tools.ietf.org/id/draft-reschke-basicauth-enc-01.txt
+
+12.08.2010
+! Removed getservbyport() from webadmin to avoid potential race condition
+
+09.08.2010
+! Default .3ps files corrected
+
+26.06.2010
+! Fixed: keep-alive connections detection for HTTP/1.1
+
+10.12.2009
+! Fixed: external address may be incorrectly set if few requests are
+ received in single connection.
+
+02.12.2009
+! zero sockaddr before bind for some FreeBSD versions compatibity
+
+26.10.2009
+! Some changes for MD4/MD5 libraries 64-bit compatibility
+
+01.10.2009
+! Fixed: Content-Length is sent twice to server if there are content-handling
+ plugins.
+
+17.09.2009
+! Makefile.Linux: add3proxyuser.sh moved to INSTALL_CFG_OBJS
+ (thanks to Martin Wanicki)
++ Functionality added to intercept all socket-related calls for plugins
+
+03.09.2009
+! Fixed: client connection was not closed on removed Content-Length (may
+ cause connection hang for timeout at the end of large file transfer
+ if filtering plugins are used).
+
+24.08.2009
++ Added transparent redirection to ICQ and MSN proxy
++ Added (untested) Last.fm ripper plugin - initial version, code needs to be
+ cleaned to work under *nix. Thanks to Denis Stanishevskiy.
+
+14.08.2009
++ WinCE (Windows Mobile) support added
+
+27.07.2009
+! Fixed: use authnserver for name match check if configured
+
+22.07.2009
++ authnserver command added (nserver to use only with auth dnsname)
+
+13.07.2009
++ man pages for smtpp and icqpr added
+! traffic correction plugin logics fixed
+
+10.07.2009
++ 3proxy configuration parser: support added for empty strings ("").
+
+09.07.2009
++ dnsname authentication added (auth dnsname) - puts validated reverse DNS
+ record (PTR) instead of username
++ PCREPlugin: Added: \r, \n support from pcre_rewrite rewrite string. Use \0
+ for empty string
++ PCREPlugin: Added: * may be used instead of regex (no regex is created
+ and checked in this case)
+
+24.06.2009
+! random redirections are really fixed (incomplete fix on 08.04.2009)
+! icqpr "Need recync" problem fixed
+! disable NTLM by default (because of Windows Vista) until NTLMv2 implemented
+! set auth iponly to be default
+
+
+08.04.2009
+! Fixed: distribution between parent proxies was not even because of
+ non-linear probability
+
+18.03.2009
+! Marking as 0.7-devel
+
+06.03.2009
+! Fixed: filters were applied in reverse order
+
+25.02.2009
+! Fixed: beginning of HTTP data may be not passed to filter
+
+22.02.2009
+! handle Content-Length as unsigned long to allow files > 2GB.
+
+10.02.2009
+! Ldapauth plugin corrected according to changes on 02.02.2009
+
+02.02.2009
++ countout / nocountout commands added
+! Added workaround for Mac OS X / iPhone OS poll() (mis)behaviour.
+
+30.01.2009
+! Flush buffer in case of POLLxxx - probably required for Mac OS X / iPhone OS
+
+24.01.2009
+! Changed WindowsAuthentication to convert username to lowercase
+
+10.12.2008
+! Fixed: login may hang in ftppr in case of large server banner
+
+30.10.2008
+! WindowsAuthentication plugin may sometimes fail with 100122 error
+ on startup because of uninitialized variable.
+
+30.09.2008
+! -lXXX moved to $LIBS in Makefiles for linkers compatibility
++ 3proxy for Dummies v.1.2 by Kurmaeff Halit added (in Russian)
+
+26.08.2008
+! Fixed: end of chunked-encoded page may be incorrectly detected
+
+24.07.2008
+! Fixed: buffering problem on multiple chunks
+
+21.07.2008
+! Previous fix was incomplete
+
+13.07.2008
+ Thanks to Hostile Fork:
+! Fixed directory listing building for some rare FTP servers (e.g. HP)
+! Fixed (probably) chunked encoding should now work. REQUIRES TESTING.
+ please report, if you have problems with chunked.
+
+
+11.05.2008
++ minor plugin interface additions
+
+03.05.2008
++ pcre_options implemented
+
+24.04.2008
+! Fixed: bandlimsout may not work if both bandlimsin and bandlimsout
+ are configured.
+
+01.04.2008
+! Fixed: chunked was actually converted to non-chunked
+
+25.03.2008
++ HTTP chunked support (hopefully) added, not tested yet
+
+13.02.2008
+! Do not shutdown listening socket
+! FTPPR was broken on 10.02 fix
+! ':' may be encoded in ftp:// URI's in proxy
+
+12.02.2008
+! LOGIN and PLAIN authentication were swapped in smtpp.
+
+10.02.2008
+! FTPPR: potential race condition on socket close fixed
+
+07.02.2008
+! MSN: message channels were not captured
+
+05.02.2008
+! Use CDATA for XML data in webadmin module
+
+03.02.2008
++ MSN / Live messenger proxy (msnpr) addded
+
+02.02.2008
+! Fixed: counters may be flushed on configureation reload
+
+01.02.2008
+! Work with counters with more safe way on configuration reload
+
+28.01.2008
+! Do not compile empty PCRE
+
+17.01.2008
++ APPE support added to ftppr
+! Fixed problem with counters dumping on reload
+
+16.01.2008
++ reqip/reqport added to XML data export
+
+15.01.2008
+! cache auth: set default cache type to user/password with 600 sec timeout
+
+14.01.2008
+! Fixed EAGAIN handling in sockmap
+! Fixed: plugins: some data may be sent to the filter functions more than once
+ on incomplete send.
+! int * offset_p changed to int offset in plugins interface
+
+13.01.2008
+! icqpr: fixed new services request hijacking
+
+12.01.2008
++ icqpr: added support for ICQ 6.0 greeting
++ icqpr: added support for insecure authentication
++ icqpr: added support for server migration
+
+11.01.2008
++ Support for new service requests hijacking added to icqpr
+! Fixed: icqpr: sequence number can be > 0x8000 in current protocol verion
+
+10.01.2008
+! Fixed few rare cases where small amount of data may pass in/out statistics
+ (e.g parent proxy request/response).
+
+09.01.2008
++ Initial version of icqpr (ICQ proxy). Use it as portmapper to ICQ server:
+ You can also control access by UIN (use 'auth useronly'):
+ auth useronly
+ allow 1369139,1234567
+ icqpr 5190 login.icq.com 5190
+! Corrected seconds fractions calculation in poll() emulation code
+ (probably did not affected any functionality)
+! PCRE library updated to 7.4
+
+07.01.2008
+!! Error code is now 5-digit
+
+
+27.12.2007
++ StringsPlugin now supports strings substitution for 'admin' service (Kirill Lopuchov)
++ PamAuth plugin added (Kirill Lopuchov)
++ LdapPlugin added (Kirill Lopuchov)
+
+19.12.2007
+ Copyright text fixed in source files
+
+18.12.2007
++ Export added for weadmin strings to use/replace in plugins
+
+17.12.2007
++ Proxy-support: Session-Based-Authentication added for compatibility
+ with NTLM/Negotiate authentication in IE7.
+
+03.12.2007
+! StringPlugin fixed
+
+23.11.2007
++ Developer's documentation added
+
+19.11.2007
+! StringPlugin fixes (by Kirill Lopuchov)
+
+09.11.2007
+! Fixed: SOCKS5 authentication was broken some time ago
+
+28.10.2007
+! Fixed: do flush() if logged to file given with -l
+
+25.10.2007
+! Improper extparam structure initialization fixed (caused invalid behavior
+smtpp/pop3p/ftppr if no 'delimchar' configured after 11.10.2007)
+
+19.10.2007
+! StringsPlugin cleanup
+
+11.10.2007
++ delimchar command added
+
+10.10.2007
+! Fixed: filters are lost on configuration reload
++ Added chkconfig support to rc.d script
+
+09.10.2007
+! Fixed double addition of authentication function on WindowsAuthentication
+ plugin
+
+25.09.2007
+! Outgoing AUTH LOGIN fixed for smtpp
+! Fixed multiline banners in smtpp
++ smtpp: default server (-h) may be used without authentication
+
+11.09.2007
+! Documentation corrections, thanx to Vladimir Fesko
+
+30.08.2007
+! Fixed PCRE filter behaviour on configuration reload
+
+29.08.2007
+! Support added for in-line auth plain SMTP authentication. Default parent
+ authentication is changed to LOGIN.
+
+25.08.2007
+! Fixed -h feature (double memory free after second connect)
++ smtpp (SMTP proxy added). Supports both PLAIN and LOGIN for both client
+ and server, supports default SMTP server.
+
+23.08.2007
++ %e format specificator added for exaternal IP logging.
+
+22.08.2007
+! dighost corrected to do not change file, if no replay from the server
+ received.
+
+20.08.2007
++ authcache password added
+! authcache user and user,ip corrected and crash fixed
+
+17.08.2007
++ Documentation added for authentication cache
+
+16.08.2007
++ Authentication cache created! New command:
+ authcache authtype time
+ e.g.
+ authcache ip 600
+ and new authentication type: cache, e.g.
+ auth iponly cache strong
+ Doesn't work with NTLM, Requires proxy -n!
+
+07.08.2007
+! define _MAX__TIME64_T, because Microsoft only mentions it in configuration
+ and never actually defines it. Prevents crash on malformed/older counter
+ file.
+
+03.08.2007
++ 'nolog' command added to extend allow/deny rules (prevent logging
+ for requests mathing allow/deny rules). nolog only affects last allow
+ or deny command.
++ 'weight' command added to extend allow/deny rules. E.g. 'weight 100'.
+ weight only affects last allow/deny rule.
+
+31.07.2007
+! Error code changed to 100 on failed SOCKSv5 name resolution
++ FAQ and documentation updates
++ New command 'logdump' added, to create intermediate log records then given
+ amount of data is archieved through connection
++ New command 'filtermaxsize' to prevent filtering if expected Content-Length
+ is greater than given value.
+
+21.07.2007
+! rm changed to del in Windows makefiles
+
+07.07.2007
++ HTTP proxy code fixed to pre-buffer traffic and fix Content-Length in case of
+ short files. For longer files Content-Length is not sent to client. It's safe
+ now to change HTTP content within plugin.
+ Result: pcre_rewrite works perfectly.
+
+05.07.2007
++ Documentation improved.
+
+28.06.2007
++ FTP server authentication fixed
+
+26.06.2007
++ Request authentication for FTP server in HTTP proxy if anonymous logon fails
+
+18.06.2007
+! Documentation fixes
+
+11.06.2007
+! Fixed: \r in *nix installation scripts
+
+31.05.2007
+! PCRE: Fixed: replace on the string of different size
+! PCRE: Fixed: replace only replaces first match
+? PCRE: known problem: in HTTP if size changes after replacement it doesn't
+ match Content-Length any more. Any workaround suggestions? Remove
+ Content-Length on HTTP requests?
+
+07.05.2007
+! PCRE plugin only used first rule
+
+21.04.2007
+! Avoid usage of large stack buffer in proxy
++ PCREPlugin is now somehow usefull
+
+20.04.2007
+! Minor code cleanup
+
+18.04.2007
+! Fixed: TraffCorrect plugin doesn't NULLify pointer after free()
+
+13.04.2007
+!! Potential buffer overflow fixed on transparent request handling
+ thanks to big_gad_(at)_mail.ru
+
+12.04.2007
+! missed authentication type check in Windows Authentication plugin
+! fixed minor memory leak in tcppm
+
+11.04.2007
+! Compilation issue for structures.h introduced on 09.04 fixed
+
+09.04.2007
+! Minor code cleanup, documentation fixes, rus-win1251.3ps grammatics fixed.
+! *nix plugins compilation issue fixed
+
+08.04.2007
+! Bug fixed on socket mapping (introduced 06.04)
+! Some internal code review without functional changes
+! "parent type IP 0" is now used to specify external IP
+ (like -eIP, but only for connections matching "allow")
+
+06.04.2007
++ PCREPlugin added. Still in development, not all functionality is implemented.
+
+05.04.2007
++ StringsPlugin by Kirill Lopuchov is imported
+
+21.03.07
+! Fixed: FTP listing is not shown on long FTP server greeting in HTTP proxy
+! Fixed: FTP listing may noy be shown on specific server timing in HTTP proxy
+
+19.03.07
+! TraffCorrect plugin NULL pointer fixed
+
+16.03.07
++ It's now possible to use hostnames and patterns in destination ACL. Hostname
+ is checked against requested hostname. Hostnames and networks may be mixed.
+ Example:
+ deny * * *sex*,*porn*,localhost,192.168.0.0/16
+ '*' can not be uses in the middle of the hostname. www*com is invalid
+ pattern.
+! BINDIR changed to BUILDDIR in Makefiles to avoid collision with install
+ on Linux.
+
+15.03.07
+! Documentation update
+
+13.03.07
++ It's possible to use hostnames in ACL, but it should not be dynamic or
+ multihomed host because hotname is translated to IP immediately.
+
+01.03.07
+! fixed: unnecessary mutex_unlock on trafcounter mutex
+! Cosmetic changes
+
+28.02.07
++ FTP put support added for HTTP proxy
+! Code cleanups (few warnings fixed)
+! Makefile.Linux changed (by request of Jari Aalto)
+
+22.02.07
+! fixed: ftppr may delay on file uploading
+
+20.02.07
++ Minor improvements in schedule-handling code
+
+14.02.07
+! Previous FTP (24.12.06) fix was ineffective (operation after break)
+
+01.02.07
+! Documentation typo with portnumber in fordummies.html fixed
+
+25.01.07
+! Typo fixed in gethostbyname_r
+
+23.01.07
+! Plugins are added to main code tree
+
+20.01.07
+! Use gethostbyname_r on Linux and Solaris
+
+18.01.07
+! Set reload flag on Web interface reload, but do not call reload() function.
+ to process reloads in uniform way.
+
+08.01.07
+! Rotate counters with '0' number
++ Scheduling interface added
+
+29.12.06
+! udppm code cleanup
+
+24.12.06
+! Point ident for openlog to saved copy of string to prevent garbage in syslog
+! Fixed: FTP though parent proxy
+! Fixed: problem fixed for final FTP server response received before data
+ (slow connection).
+
+22.12.06
+! socks4 parent redirection fixed
+! Makefile.Solaris and Makefile.Solaris-gcc are corrected against -o problem
+ in Solaris.
+
+21.12.06
++ FAQ additions
+
+19.12.06
+! Fixed: POST request problem with NTLM authentication
++ Access to reload / exit status and proxy stringtable from plugin API
+
+05.12.06
+! Fixed: imcomlete pages through HTTP proxy (Internet Explorer hangs)
+! Minor changes in trafcount/bandlimit for better plugin compatibility
+
+30.12.06
+! Fixed: two 3xx replies on USER command in ftppr.
+
+27.11.06
+! Changed to SAFESQL because actually only Microsoft and Oracle
+ seems to follow ODBC standards.
+
+19.11.06
++ SITE command support in addition to OPEN for ftppr
+
+18.11.06
++ -I added to standalone services to be executed from inetd.
+
+14.11.06
+! Fixed behaviour on failed ODBC log attempt
++ Filtering HTTP request API now works
+
+10.11.06
++ Try to fallback to stdlog if odbclog fails
+
+07.11.06
++ Filtering API is partially implemented
+
+01.11.06
++ -h option added to use as default hostname:port for ftppr/pop3pr.
+
+15.10.06
+! WindowsAuthentication.dll version updated to match current internal
+ structures and changes in plugins API.
+
+13.10.06
+! Exit service on non-recoverable service error
+
+11.10.06
+! Fixed: hostname:xx causes name resolution problem (introduced on 09.10).
+! Fixed: wrong target ports for tcppm/udppm (introduced on 09.10).
+
+09.10.06
+! %Q and %q added to track requested IP/port. Hopefully also problems with
+ ACL checks on redirected applications are finally fixed.
+
+06.10.06
+! WindowsAuthentication.dll replaced with static version in distro
+
+04.10.06
+! Some compilation warnings cleaned
+! Back to static linking
+! Errors introduced with filters corrected
+
+03.10.06
+! Add .manifest files to distribution
+
+28.09.06
+! Compile 3proxy with msvcr80.dll
++ include msvcr80.dll into distribution
+
+27.09.06
++ FAQ updated.
++ Filtering functionality added (incomplete yet).
+! SOCKS BIND/UDPASSOC problems fixed (based on Artem Rebrov's patch)
+
+25.09.06
+! Traffic report name is now generated based on 'last traffic in report'
+ date/time and is not overwritten on service startup. Today traffic report
+ will only be seen tomorrow, but counters may be checked with 'countersutil'
+ or web interface.
+
+13.09.06
++ Examples of compatible log formats added to 3proxy.cfg.sample
+
+11.09.06
+! Name hash length changed from 64 to 128 bits.
+
+06.09.06
+! Documentation regarding to Unix compilation corrected
+
+
+05.09.06
+! Fixed: buffered input may double some data on empty reads
++ FTP diagnostics improved for FTP login problems
++ Add ".." to directory listing
+
+25.08.06
+! Fixed: endless loop on configuration parsing if ACL weekdays are given as
+ a comma delimited list (reported Andrey S. Alexeenko).
+
+23.08.06
+! Fixed: compilation under Solaris
++ Solaris/gcc Makefile added
+
+17.08.06
+! Fixed: NTLM authentication doesn't work for NT-encoded passwords
+! Fixed: offer NTLM authentication before basic
+
+15.08.06
+! Reset client address after hostname parsing
+! Warn on counterfile time_t incompatibility
+
+10.08.06
+! Fixed: \r's in few Makefiles
+
+09.08.06
+! Documentation corrections.
+
+04.08.06
+! Documentation corrections.
+
+28.07.06
+! Fixed: invalid traffic prediction for large downloads on traffic limits over
+ 4GB.
+
+26.07.06
+! nbname auth rejects, if no NetBIOS name determined. Use
+ auth nbname,iponly
+ to emulate old behaviour
+! It's now possible to use "-" in ACLs to match empty username.
+! No need to specify L/G for filename template in "log" (local time is
+ always used).
+
+25.07.06
++ "log" command now supports same format specifications for filename template
+ as "logformat" (if filename contains '%' sign it's believed to be template).
+ As with "logformat" filename must begin with "L" or "G".
+
+08.07.06
+! nreads/nwrites/nconnects fields added to internal client paramters structure
+ for plugin developments
+
+07.07.06
+! FTP_DATA operation added for FTP data connection ACLs.
+
+04.07.06
+! Scripts/Makefiles corrections
+
+03.07.06
+! Fixed: dnspr 822 error on Windows (seems like a bug with multithreading on
+ latest Visual C compiler, ioctlsocket() resets parameters of setsockopt().
+! Fixed: wrong limit and traffic on counters on the web
+
+30.06.06
+! Fixed: wrong traffic displayed on web for traffic > 4GB
+
+28.06.06
+! Fixed path to binary in scripts/rc.d/proxy.sh
+
+27.06.06
+! Fixed: limitations for traffic over 1GB work incorrectly
++ Start/stop script example added to distribution
+
+22.06.06
++ -u parameter added to services to avoid username authentication request/usage
+
+16.06.06
++ Windows authentication plugin added to binary Windows distribution
+
+14.06.06
+! Added workaround for broken HTTP client (e.g. SUM - SUN update manager) with
+ incomplete URI in HTTP request.
+
+11.06.06
+! bind FTP data connection socket to external interface
++ FTPPR fully supports parent proxy (SOCKS 4/5, HTTPS/CONNECT)
++ FTPPR supports FTP_GET/FTP_PUT/FTP_LIST ACL actions limitations
+
+09.06.06
++ 'auth' can be used with few authentication types now. It makes it possible
+ to request password only on demand with
+ auth ipony strong
+
+08.06.06
+! 'admin' redirect type added for redirection to local web administration
+ service (works like admin -s).
+
+31.05.06
+! Log '-' instead of username if username exists but is empty
+
+29.05.06
+!!!! Warning: counters file format changed on Windows since 0.5.2
+ because of different sizeof(time_t) on Visual C++ 2005 compiler.
++ countersutil utility added to manage counters. To convert 3proxy.exe
+ 0.5.2 counter file to 3proxy.exe current run
+ countersutil oldexport counterfile tmpfile
+ countersutil import counterfile tmpfile
+
+
+25.05.2006
+! Fixed: dnspr command lost from command list
+
+17.05.2006
+! Fixed: nobandlimin actually works like nobandlimout
+
+16.05.2006
+!! Fixed: crash if more than one "users" command in configuration
+! Fixed: timezone display for FreeBSD and Windows
++ added %o format specification for 3-character mOnth abbriviation
+! Fixed: check EINTR on poll() (avoids "Interrupted system call" in logs
+ and broken connection on USR1 signal.
+
+12.05.2006
+! Fixed: log rotation was broken after client code rewrite
+
+11.05.2006
+! Cleaned: "mypoll" error if compiled with GCC withoout WITH_POLL
+
+10.05.2006
+! Use SO_REUSEPORT if defined
+
+06.05.06
+! Minor HTTP proxy redirections code cleanup
+
+03.05.06
++ socks error codes improved
+
+02.05.2006
+! Fixed: compilation for Unix (plugins)
+
+01.05.2006
+! Fixed: names for authentication types turned back for compatibility
+! Fixed: no warning given for unknown authentication type
+! Fixed: bandlimout doesn't work if bandlimin presents for same connection
+
+30.04.2006
+! Fixed: nobandlimin/nobandlimout commands missed
+++ plugin command added to load dynamic library
+
+25.04.06
+! Internal structures moved to diffent header file
+
+20.04.06
+! Fixed: few problems with logging after latest modification (out of memory
+ reference on hostname).
+ SQL injections now are filtered even if \' is not in filtered characters.
+
+17.04.06
+! Few bugs introduced on 13.04 (especially 'nocountin' crash) fixed
+! Significant changes to internal structures
+! Compilation problems under Linux/Unix fixed
+
+13.04.2006
+! 3proxy.c configuration reading major code rewrite
+! Fixed: memory leaks on configuration reload
+! Changed from CreateThread to _beginthreadex according to MS reccomendations
+! Changed: FTP start data transfer code from 101 to 125 in FTPPR
++ NLST support added to ftppr
+
+05.04.2006
++ Minor documentation and help screen updates
+
+30.03.2006
+!! Windows distribution compiler changed to MSVC 8.0
+++ bin64 (Windows XP/2003 64 bit edition x64) added
+
+29.03.2006
+! Socket leak fixed on FTP data connection failure under Windows
+! minor 64 bit compatibility code cleanup
++ x64/amd64 Windows XP/2003 64 bit edition makefile added
+
+24.03.2006
+! Minor FAQ dummy compatibility updates
+
+18.03.2006
++ Parameters descriptions and XML stylesheet added to webadmin services view
+! Potential problem (wrong type dereference) fixed in webadmin services
+
+12.03.2006
+! Restore sasize after receivefrom
+
+10.03.2006
+! Fixed: CONNECT with http parent
++ bandlimout / nobandlimout implemented
+! Copyrights and banners fixed
+
+08.03.2006
+! Minor poll() code cleanup
+
+06.03.2006
+! Socks 4a name resolution fixed
+! Name resolution function was not cleared after configuration reload
+
+03.03.06
+! Print comments in traffic report
+
+26.02.06
+! Check POLLERR / POLLHUP for revents
+
+21.02.06
++ "monitor" command added to reload 3proxy if monitored file changes
+
+13.02.06
+! Some files are renamed for autotools compatibility
+
+07.02.06
+! Fixed: insufficient timeout on buffers flushing, leads to loss
+ of data if connection to client is worse than connection to server.
+
+06.02.06
++ -b (bufsize) parameter added to every service
+! flushing improved to prevent data loss at the end of output
+
+03.02.06
+! Documentation corrected
+
+10.01.06
++ Documentation updated
+! Buffered UDP data loss on exit is fixed for sockmap
+
+30.12.05
+! Minor interface fixes
+
+27.12.05
++ English FAQ added
+
+20.12.05
+! Fixed: crash on counters in webadmin if "NONE" counter rotation type
+ is used.
+
+09.12.05
+! Use bind port from BIND request for SOCKSv5 server
+
+30.11.05
+! Do not buffer UDP packets
+
+30.11.05
+! Do not drop connection on unknown command
+
+29.11.05
+! Do not drop connection on POP3 CAPA.
+
+28.11.05
+! Fixed: recv() may be called with small buffer on UDPPM
+
+23.11.05
+! Fixed: programming bug in $ file inclusing
+! Fixed: webadmin conter type uses stack for return value
+
+17.11.05
++ Makefile.Solaris added, thanks to 'pqr'.
+! Cleaned pointer conversion warnings
+
+15.11.05
+! define PTHREAD_STACK_MIN if not defined to compile under Solaris
+! S_NONE renamed to S_NOSERVICE to compile under Solaris
+
+14.11.05
+! Linger period is set to STRING_L (60 sec default)
+
+10.10.05
+! Add some grace period to shutdown services before exit
+
+03.10.05
+! Linger added to FTP socket to avoid data loss on socket close
+
+29.09.05
++ Added H (hour) and C (minute) routation support to countin
+
+22.08.05
+! Fixed: UDP resolver (nserver) fails to resolve name if reply contains
+ no additional records (for example dnscache from djbdns).
+
+06.08.05
+!!Workaround added for Windows XP SP2 / Windows 2003 SP1 problem with
+ 2 selects on single datagram socket. udppm -s and dnspr hang on random
+ time while sending packets to client, sometimes causing client timeouts.
+
+
+05.08.05
+! Fixed problem with UDP mappings
+! Workaround for strange Windows XP bug with sendto() delay for 2 secs
+ if no select() was performed on socket
+
+30.07.05
+! Error handling on SOCKSv5 parent improved
+
+28.07.05
++ Support for parent SOCKS4b/SOCKS5b (broken implementation with shortened
+ server reply) added. I never saw such server by they say there are.
+ socks4b, socks5b options for parent proxy.
+
+22.07.05
++ Name resolution for parent CONNECT, SOCKSv5 and SOCKSv4a proxy server
+ added, should work with "fakeresolve" option (connect+, socks4+
+ socks5+ options for parent proxy).
+
+13.07.05
+! Fixed: reading behind allocated memory in myrand() entropy
+ gathering function (leads to occasional craches) intrdoduced
+ on June, 20.
+
+12.07.05
+! Use client port only for portmappers
+! Code reviewed for possible double close()
+
+10.07.05
+! Improved quote handling in config files. No any string can be quoted
+ (for example Thi"s is a test" is same as "This is a test", fixed a
+ problem with using quotes with $ macro.
+
+01.07.05
++ Added RSA copyright text to 'mycrypt' to allow binary redistribution
+ for this tool only.
+
+22.06.05
++ try to use same (unprivileged) port as client for outgoing connections
+ for portmappers
+! admin -s now only shows counters related to user
+! Fixed: impossible to set traffic limit to even number of GB
+
+20.06.05
+! -a option corrected again (had inverted action)
++ -a1 option added to report random information about client IP
++ -s option added to 'admin' to allow safe-only commands (user mode)
+
+26.05.2005
+! -a option corrected
+
+25.05.2005
++ 'Y' (annually) option added to counters, logfile rotations, etc
++ -a (anonymous) option added to proxy server
+
+21.05.2005
+! socks: only allow UDP mapping from same IP with control connection
+! socks: always log network parameters for control connection
+! check timeout to be below 2000000
+
+20.05.2005
+! invalid sendto() argument fixed (may affect UDP mapping and sometimes
+ TCP under very rare configurations)
+! set sasize before sendto
+! socks checks requested address to be non-zero
+! socks checks requested port to be non-zero
+! socks: do not change UDP client parameters before UDP packet received
+
+19.05.2005
++ 'include' command added to 3proxy (include one config file from another
+ config file)
+! handle EAGAIN on send()/recv()
+
+18.05.2005
+! More detailed problem code in mapping code
+
+17.05.2005
+! Fixed typo with dnspr logging
+
+16.05.2005
++ dnspr can now resolve records different from hostname (request is proxied to
+ first DNS server in the list, reply is not cached).
+
+14.05.2005
+! Fixed: mishandled socket error in dnspr code
+
+13.05.2005
+! Few minor fixes in HTTP proxy code (timeout in initial handshake lefts
+ some garbage in request buffer).
+! Fixed short timeout in FTP proxy code
+! Mapping code is changed to leave unsent data on buffer
+
+06.05.2005
+! Prevent race conditions with 100% CPU usage in socksmap (introduced 30.04)
+
+03.05.2005
+! Fixed: double free() in authentication (probably introduced on 04.04)
+! Changed to POLLIN/POLLOUT/POLLPRI for more compatibility
+
+30.04.2005
+! Fixed: double free() in FTP over HTTP (probably introduced on 04.04)
+! Fixed: in very rare situation may loose some data at the and of connection
+
+27.04.2005
+! stack size increased (reported problems under some OSs)
+! Fixed: -l option for service executable leads to NULL-pointer reference
+!!! Moved from select() to poll() on *nix. Please upgrade your Makefiles.
+
+25.04.2005
+! set thread stack size explicitly to prevent problems with some Linux 2.6
+ kernels.
+
+22.04.2005
+! Never fallback to gethostbyname() if nameservers are configured to prevent
+ locking on *nix platforms
+!!Fixed: name resolution is called while mutex is locked in HTTP proxy
+ leading to long lasting blocking.
+
+21.04.2005
+! Fixed: dnspr returns A record of invalid class (fails with some resolvers)
+!! Socket I/O is now non-blocking
+
+19.04.2005
+! bandlimits changed to avoid floating point operations
+
+11.04.2005
++ Log if new connections delayed because of too many accepted connections
+
+04.04.2005
+! Fixed few minor rare memory leaks
+
+03.04.2005
+! Fixed: HTTP proxy should ignore Content-Length for 304 response
+
+14.03.2005
+! MD5 password hashin within mycrypt utility fixed
+! dnspr logging now shows DNS server IP instead of resolved IP, resolver IP
+ is shown in additional info
+
+11.02.2005
+! Configuration reload removed from signal handler
+
+31.01.2005
+! Limit for maximum log string size increased to ~4K
+! large FD_SETSIZE and FD_SETSIZE check is not required under Windows
+
+28.01.2005
+! Fixed: -s options for udppm
+
+17.01.2005
+! Fixed: invalid IP may appear in logs and bandlimits on redirection
+
+13.01.2005
++ fakeresolve option added
+
+21.12.2004
+! Fixed: traffic limits are set improperly for traffic over 1Gb
+
+11.12.2004
+! 0.6 development started
+
+11.12.2004
+Commited as 0.5b
+11/12/2004 3[APA3A]tiny proxy 0.5b
+New features marked with !.
+
+ Features:
+ 1. General
+ + HTTP/1.1 Proxy with keep-alive client and server support,
+ transparent proxy support.
+ + FTP over HTTP support.
+ + DNS caching with built-in resolver
+ + HTTPS (CONNECT) proxy
+ + SOCKSv4/4.5 Proxy
+ + SOCKSv5 Proxy
+ ! UDP and bind support for SOCKSv5 (fully compatible with
+ SocksCAP/FreeCAP for UDP)
+ + Transparent SOCKS->HTTP redirection
+ ! Transparent SOCKS->FTP redirection
+ ! Transparent SOCKS->POP3 redirection
+ + POP3 Proxy
+ ! FTP proxy
+ ! DNS proxy
+ + TCP port mapper
+ + UDP port mapper
+ + Threaded application (no child process).
+ ! Web administration and statistics
+ 2. Proxy chaining
+ + Parent proxy support for any type of incoming connection
+ + Username/password authentication for parent proxy(s).
+ + HTTPS/SOCKS4/SOCKS5 and redirection parent support
+ + Random parent selection
+ + Chain building (multihop proxing)
+ 3. Logging
+ + turnable log format compatible with any log parser
+ + stdout logging
+ + file logging
+ + syslog logging (Unix)
+ + ODBC logging (Windows and Unix)
+ + log file rotation (hourly, daily, weekly, monthly)
+ + automatic log file comperssion with external archiver (for files)
+ + automatic removal of older log files
+ ! Character filtering for log files
+ ! different log files for different servces are supported
+ 4. Access control
+ + ACL-driven (user/source/destination/protocol/weekday/daytime or
+ combined) bandwith limitation
+ + ACL-driven (user/source/destination/protocol/weekday/daytime or
+ combined) traffic limitation per day, week or month
+ + User authorization by NetBIOS messanger name
+ + Access control by username, source IP, destination IP, destination
+ port and destination action (POST, PUT, GET, etc), weekday and daytime.
+ + Access control by username/password for SOCKSv5 and HTTP/HTTPS/FTP
+ + Cleartext or encrypted (crypt/MD5 or NT) passwords.
+ + Connection redirection
+ + Access control by requested action (CONNECT/BIND,
+ HTTP GET/POST/PUT/HEAD/OTHER).
+ ! NTLM authentication for HTTP proxy access
+ ! All access controle entries now support weekday and daytime
+ limitations.
+ 5. Configuration
+ + support for configuration files
+ + support for includes in configuration files
+ + interface binding
+ + running as daemon process
+ + utility for automated networks list building
+ Unix
+ + support for chroot
+ + support for setgid
+ + support for setuid
+ ! support for signals
+ Windows NT/2K/XP/2K3
+ + support --install as service
+ + support --remove as service
+ + support for service START, STOP, PAUSE and CONTINUE commands (on
+ PAUSE no new connection accepted, but active connections still in
+ progress, on CONTINUE configuration is reloaded)
+ Windows 95/98/ME
+ ! support --install as service
+ ! support --remove as service
+ 6. Compilation
+ + MSVC (msvcrt.dll)
+ + Intel Windows Compiler (msvcrt.dll)
+ + Windows/gcc (msvcrt.dll)
+ + Cygwin/gcc (cygwin.dll)
+ + Unix/gcc
+ + Unix/ccc
+
+ Known bugs:
+
+ report to 3proxy@security.nnov.ru
+
+ Planned for future (0.6) release:
+ - External modules API
+ - Addon URL, antiviral, HTTP cache filters modules, authentication
+ modules for different protocols (RADIUS, PAM, integrated system, etc).
+
+$Id: Changelog,v 1.154 2006/03/08 18:44:00 vlad Exp $
+
+11.12.2004
++ man page for 3proxy.cfg added
+
+09.12.2004
+! restarting SQL on reloading configuration
+
+08.12.2004
+! Typo fixed in sockmap preventing portmappers from functioning
+
+06.12.2004
++ Network input is now buffered, decreasing CPU usage
+- Debugging printf() removed from ftppr
+
+30.11.2004
+!! Fixed: memory content may be leaked on FTP error in HTTP proxy
+! Few race conditions with double socket closing fixed in FTP proxy
++ Content-Length is checked to do not allow traffic overdraft via HTTP proxy
++ Connection now can be aborted due to traffic limit (code 90)
+
+24.11.2004
+! 333 error removed - no longer required
+
+23.11.2004
+! Deadlock in checkACL() (introduced 18.11) fixed
+
+20.11.2004
+! All mutex operation are now atomic to prvent deadlocks
+! Race conditions with bamdlimits on reload fixed
+
+18.11.2004
+! Mutex logic overwritten, should clear reload races completely
+! Fixed socket leak on some failed FTP operations
+! FD_SETSIZE increased, check for FD_SETSIZE added
+
+04.11.2004
+! Fixed: Maxconn limitation doesn't work, may lead to resource exhaustion
+ attacks
+! Fixed: reference to unallocated memory if fails to create new thread
+ (may lead to crash together with previous bug).
+
+03.11.2004
+! Fixed: Wrong type for "ace.users" in datatypes.c
+! Partially fixed: race conditions on reload in alwaysauth()
+
+02.11.2004
+! race condition in sql_init on reload fixed
+! minor code cleanup
+! typo with SQL deadlock introduced on last fix fixed
+! checked few memory allocation calls missed with debug library (myalloc)
+
+30.10.2004
+! Fixed: minor memory leak on SQL error
+
+28.10.2004
++ HTTP parent redirection for FTP requests
+
+23.10.2004
+! Fixed: access to free()'d memory in ODBC functions after few
+ configuration reloads
+! Configuration reload is more (but not yet completely) thread safe
+ now.
+
+17.10.2004
+! Fixed: Content-Type: missed in web interface
+
+16.10.2004
+! Fixed: log may show invalid IP/port for parent proxy connection
+
+12.10.2004
+- Debug printing to stdout in webadmin removed
+
+11.10.2004
+! Race conditions fixed, could cause 3proxy to crash on configuration reload
+
+28.09.2004
+! Limitation for maximum string length in config file removed (for included files)
+
+26.09.2004
+! Typo corrected preventing compilation under *nix
+
+18.09.2004
+! URL decoding corrected (affect HTTP over FTP clients)
++ "writable" command added to allow config modification via Web interface
++ Config file can be edited via web interface
+
+14.09.2004
+! Crash on HTTP redirections introduced on 08.09 fixed.
+
+11.09.2004
++ Weekday based access control is now possible
++ Time based access control added
+! Speed improved in ACL checks
+
+08.09.2004
++ * can be used as external username with a meaning of username should be
+ requested from user.
++ %n1-n2T is now available in logformat to log only few field of service
+ specific text
++ -t (silent start) option added
+
+20.08.2004
+! Yesterday fix was broken, corrected.
+
+19.08.2004
+! Fixed: target address is logged instead of proxy address in a case
+ of redirection
+
+09.08.2004
+! Fixed: under *nix if service fails to bind() port for few hours it falls
+ into endless loop with logging and high CPU usage.
+
+03.08.2004
+! Fixed: select() changes tv value on some Linux kernels (100% CPU usage)
+
+02.08.2004
+! Fixed: wrong initialization for counter descriptor (causes some stdout
+ noise).
+! Fixed: no HTTP proxy diagnostic message if host name doesn't resolve
+! Fixed: NULL pointer crash if no format specified
+
+30.07.2004
+! Few bugs with counters and bandlimits introduced yesterday fixed
+
+29.07.2004
+! Fixed few memory leaks on restart
+! Some code cleanup for configuration information storing
++ Statistics extended
++ Added "Zombie" threads support (service thread waiting for child shutdown
+ to exit).
++ Every service can now have different log format and character filtering
++ It's now possible to set logformat for service from command line
+
+28.07.2004
+! Fixed: ACLs are not cleared on reload
+! Fixed: bind() warnings on reload under *nix
+!! Fixed potential race conditions DoS on some Unix systems with thread
+ exit on aborted connection (accept(): Software caused connection abort)
+
+24.07.2004
++ Web interface shows information about all currently running services and
+ clients (plain format just for debugging, will be rewrtitten later)
+
+23.07.2004
+! Fixed: wrong external ip/port in logs sometimes on internal redirection
++ HowTo and FAQ (Russian) added to documentation, documentation corrected
+
+22.07.2004
++ Added logging options for request duration and average send/recieve
+ speed per request
+
+20.07.2004
+! Changed default password for anonymous FTP
+! Improved diagnostic messages for FTP over HTTP errors
+
+19.07.2004
+! Changed FTP behaviour for some RFC ignorant sites
+
+17.07.2004
++ services and clients are now registered for future extensions
+! counters show wrong result problem introduced yesterday fixed
+! fixed descriptor leak on configuration reload
+! fixed theoretical problem with client number limitations
+! few theoretical mutex leaks fixed
+
+16.07.2004
++ 3proxy can now read configuration from stdin under *nix,
+ 3proxy.cfg can be executable
++ 'config' command added to allow 3proxy reload configuration in chroot'ed
+ environment or if configured from stdin.
++ 'end' command added
++ Man pages in HTML added
+
+14.07.2004
+! Minor casting issues, Unix compilation issues fixed
++ counters sample added
+
+13.07.2004
++ Configuration improved and repacked
+
+08.07.2004
+! Problem introduced yesteday (after rotation logs do not print to
+ logfile) fixed.
+
+07.07.2004
+! Fixed FTP behaviour on RFC ignoring FTP sites (ftp.drweb.ru).
+! Config file example updated with FTP proxy service configuration
++ Logging changed to allow personal log files for every service (without
+ rotation) and to work on older FreeBSD systems.
+
+05.07.2004
+! Fixed call to free'ed memory (could cause crash on reloading 3proxy
+ configuration in 0.5b-devel after 28.06.2004)
+
+30.06.2004
+! Fixed redirection crash if parent username/password is not specified
+! Fixed documentation buf (%h instead of %n for hostname in logformat)
+
+28.06.2004
+! Minor changes in error messages generation
+
+25.06.2004
+! distributive repacked, some Russian documentation by Kirill Lopuchov
+ added
+
+24.06.2004
+! realm sometimes is not shown in proxy-authentication
+
+23.06.2004
+! fixed maxconn parameter was not set to default value on proxy reload.
+! fixed typo in pop3p causing it to fail
+
+22.06.2004
+! ftppr.c typo corrected, preventing compilation under unix.
+
+19.06.2004
++ FTP proxy (compatible with both USER and OPEN mode). Redirection to
+ FTP proxy from SOCKS
+
+18.06.2004
++ Local redirection to POP3 proxy is now awailable.
+! Fixed race conditions with double socket closing in POP3 proxy
+
+17.06.2004
+!! Threading problem causing minor memory leak and preventing 3proxy
+ from functioning under few OS versions (including Linux) after
+ some number of requests fixed.
+
+16.06.2004
+! Authentication problem introduced on 05.06 fixed
+
+15.06.2004
+! FTP over HTTP proxy supports spaces, quotes and 0x255 in filenames.
+!! Potential security risk fixed: FTP password may appear in log if
+ URL ftp://user:password@server is used.
+
+09.06.2004
+! NTLM is enabled by default. Use proxy -n to disable NTLM for proxy service
+ (for example, if crypt passwords are used).
+
+05.06.2004
+!! Potential security leak fixed: POP3 proxy password can appear in log if
+ proxy username is configured as proxyuser:proxypassword:pop3user@pop3server
+ in POP3 client program
+! Child invocation code rewritten to avoid code dupclication.
+
+27.05.2004
+! Reloading is now fast (new thread starts before old one dies)
+! Milliseconds are printed as .3 (not .4) in logs
+
+22.05.2004
++ Reload command added to Web interface and SIGUSR1 handling
+! Problem fixed: no mode is given to open() with O_CREAT for counter files,
+ counter file can be created as read only under Windows or with invalid mask
+ under Unix.
+! Do not fail if bind() fails
+! Setsockopt for integer options corrected
+! REUSEADDR added to avoid "Address already in use" problem if restarted
+ under Unix
+
+18.05.2004
++ Installation/removal as a service under Windows 95/98/ME now supported.
+
+17.05.2004
+! Fixed: 3proxy hangs on socket error during config reading
+
+14.05.2004
+! For HTTP proxy NTLM authentication both ntlm and basic are now advertized
+ to client for compatibility
+! Optimization parameters are changed and stack protection is turned on for
+ MSVC (Windows default) compilation.
+! Fixed: exiting thread shows last client IP in log
+
+
+27.04.2004
+! Fixed: Microsoft domain authentication to web server may fail via
+ transparent HTTP proxy with some IE versions.
+! HTTP HEAD now recognized
+
+23.04.2004
+! Fixed compilation issues under Unix
+
+22.04.2004
++ Configuration now can be dynamically reloaded with
+ net pause 3proxy / net continue 3proxy or by sending SIGPAUSE twice
+ without breaking connections
+! 3proxy is now distributed compiled with Microsoft Visual C++, thanx
+ to MS for releasing "Microsoft Visual C++ Toolkit 2003" for free.
+! Few bugs introduced in latest versions (username/password for parent proxy,
+ dnspr and single packet UDP are fixed)
+
+13.04.2004
++ NTLM authentication for proxy server (yes, it works under *nix). It will
+ not work with crypt password, only CL or NT. Use proxy -n to allow NTLM.
+! potential DoS (NULL pointer) condition fixed in configuration with crypted
+ passwords
+
+08.04.2004
++ %n (hostname) added to logformat
+
+05.04.04
+! compilation problem under Unix fixed
+
+01.04.04
+! problem with portmappers fixed (introduced on last modification)
+
+20.03.04
++ FTP messages are shown now
+! FTP problem with links with absolute paths fixed
+! No more authentication requested for user if ACL denies access to resource
+ in HTTP proxy.
+! ACLs are now stored in predefined container. It's required for future
+ improvement (Cisco-like ACL configuration and configuration reload without
+ restarting proxy). As a backside, number of ACLs is now limited to 256.
+! Function for configuration reading implemented for future improvements.
+
+12.03.2004
+! error text generation changed for pthread_create (use return code
+ instead of errno). Memory leak on failed pthread_create fixed.
+
+02.03.2004
+! Transparent proxy fixed to work with ports different from 80.
+! Workarond for Internet Explorer invalid Host: header bug
+
+28.02.2004
++ -+ options added to logformat for character filtering
+! ' character now filtered only if logged via ODBC
+! few bugs fixed in ODBC logging reliability code. Now 3proxy should better
+ handle broken database connections.
+
+26.02.2004
+! user32 added to library list for MSVC
+
+24.02.2004
+! Ask installation confirmation before installation
+
+23.02.2004
+! ttl now is real for DNS proxy proxy reply
+
+21.02.2004
++ dnspr - DNS caching proxy added to 3proxy module. Listens on UDP/53
+ and answers hostname requests. Requires nserver/nscache to be configured.
+! 3proxy wanrs user if installed as Windows service
+! 3proxy child threads are now started faster
+
+22.01.2004
+! mutex deadlock fixed if gethostbyname() is used under Unix
+
+19.01.2004
+! compilation issue fixed for MSVC (definition inside code)
+
+15.01.2004
+! bug fixed in configuration reading getip() called befor WSAStartup
+ (thanks to Kerd)
+! bug fixed with parent CONNECT proxy (thanks to Kerd)
+
+11.01.2003
++ Few man pages added
+
+06.01.2003
++ now it's possible to use "" inside quotation for double quote sign (for
+ example "say ""hello world"""
+
+04.01.2004
++ maxconn configuration option added
+
+19.12.2003
++ New "safe" memory allocation library implemented. It may slow down
+ performance but is thread safe and never cause memory fragmentation.
+! Memory leak in redirection SOCKS->HTTP fixed
+
+11.12.2003
+! Memory leak in UDPPM fixed
+
+29.11.2003
++ Copyrights added to banners
+!! Few signed/unsigned mismatches fixed (including potentially dangerous)
+
+27.11.2003
+! 'redirect' now can be used with hostname instead of ip address
+
+21.11.2003
+! POP3 proxy bug fixed
+
+04.11.2003
+! '@' situation in username for POP3 proxy corrected
+ (pop3name@pop3realm@pop3server)
+
+03.11.2003
+! One more bug with 'archiver' causing 3proxy to crash on log archieving
+ fixed
+
+29.10.2003
+! Some threading safety is added for logging (inet_ntoa and ODBC
+ re-initialisation)
+
+28.10.2003
+! Bug causing daily log filename to work as weekly fixed
+! 'daemon' example moved to beginning of configuration file
+
+16.10.2003
++ pidfile configuration option added
++ processing for SIGCONT (pause/resume) and SIGTERM (termination) added
+ under Unix
+
+01.10.2003
+! Weekly log filename now is generated by the date of last Sunday.
+! Do not strip executable for Unix (must be stripped during installation).
+
+21.09.2003
+! Bug fixed in "log" command processing (wrong buffer was used
+ for filename generation)
+
+16.09.2003
+! socksmapping algorythm changed to handle incomlete send() (for *BSD).
+
+15.09.2003
+! mutex added to gethostbyname() to avoid thread unsafety. It slows
+ down proxy if no nserver configured (it MUST be for *nix!) but prevents
+ crashing on active usage.
+! signal() handling is added for SIGPIPE. It seems to be some race conditions
+ on FreeBSD between send() and gethostbyname() somewhere causing SIGPIPE on
+ gethostbyname().
+
+13.09.2003
+! NULL reference corrected if rotate is given without archiver
+
+11.09.2003
+! Few additional checks added for open()/fopen() to do not crash on invalid
+ files in config
+! Buffer moved from stack to heap in socks.c to eliminate crash on FreeBSD
+
+10.09.2003
+! Bug in SOCKSv5 UDP mapping corrected. Now it works fine (checked with
+ Unreal Tournament) with both SocksCAP and FreeCAP.
+
+06.08.2003
+! Algorithm for SOCKS5 bind/udp assoc port selection is now intellegent
+ enough to allow server applications to use same port number on socks
+ server if available and not denied by access list
+! SOCKS5 bind/udp assoc now matches incoming connections/packet
+ with IP address from request in accordance to RFC 1928 to improve
+ security
+
+04.08.2003
+!!! Bug fixed sometimes causing 3proxy to crash if parent proxy is used
+!!! UDP associate finaly completed and is fully functional
+ (tested with SocksCAP on Unreal Tournament).
+!!! TCP bind code re-checked, and is probably working (doesn't work
+ on SocksCAP because of SocksCAP bug
+!!! Socket leak on nbname auth fixed
+
+21.07.03
++ Web administration module created
++ Dynamic enable/disable for counters now available via web interface
+
+19/07/2003 3[APA3A]tiny proxy 0.4
+New features marked with !.
+
+ Features:
+ 1. General
+ + HTTP/1.1 Proxy with keep-alive client and server support,
+ transparent proxy support.
+ ! FTP over HTTP support.
+ ! DNS caching
+ + HTTPS (CONNECT) proxy
+ + SOCKSv4 Proxy
+ + SOCKSv5 Proxy (TCP only)
+ + Transparent SOCKS->HTTP redirection
+ + POP3 Proxy
+ + TCP port mapper
+ + UDP port mapper
+ + Threaded application (no child process).
+ 2. Proxy chaining
+ + Parent proxy support for any type of incoming connection
+ + Username/password authentication for parent proxy(s).
+ + HTTPS/SOCKS4/SOCKS5 and redirection parent support
+ + Random parent selecttion
+ + Chain building (multihop proxing)
+ 3. Logging
+ + turnable log format
+ + stdout logging
+ + file logging
+ + syslog logging (Unix)
+ + ODBC logging (Windows and Unix)
+ + log file rotation (hourly, daily, weekly, monthly)
+ + automatic log file comperssion with external archiver (for files)
+ + automatic removal of older log files
+ 4. Access control
+ ! ACL-driven (user/source/destination/protocol or combined) bandwith
+ limitation
+ ! ACL-driven (user/source/destination/protocol or combined) traffic
+ limitation per day, week or month
+ + User authorization by NetBIOS messanger name
+ + Access control by username, source IP, destination IP, destination
+ port and destination action (POST, PUT, GET, etc).
+ + Access control by username/password for SOCKSv5 and HTTP/HTTPS/FTP
+ + Cleartext or encrypted (crypt/MD5 or NT) passwords.
+ + Connection redirection
+ + Access control by requested action (CONNECT/BIND,
+ HTTP GET/POST/PUT/HEAD/OTHER).
+ 5. Configuration
+ + support for configuration files
+ + support for includes in configuration files
+ + interface binding
+ + running as daemon process
+ + utility for automated networks list building
+ Unix
+ + support for chroot
+ + support for setgid
+ + support for setuid
+ NT
+ + support --install as service
+ + support --remove as service
+ + support for service START, STOP, PAUSE and CONTINUE commands (on
+ PAUSE no new connection accepted, but active connections still in
+ progress)
+ 6. Compilation
+ + MSVC (msvcrt.dll)
+ + Intel Windows Compiler (msvcrt.dll)
+ + Windows/gcc (msvcrt.dll)
+ + Cygwin/gcc (cygwin.dll)
+ + Unix/gcc
+ + Unix/ccc
+
+ Known bugs:
+
+ - udppm doesn't work if compiled with cygwin.
+
+ Cygwin doesn't support recvfrom()/sendto() on connected socket, so
+ recv/send is used instead... Not a big deal anyway.
+
+
+ Planned for future release:
+ - Web interface for configuration
+ - Signal handling on Unix (for stop/pause/resume/configuration change)
+ - External filter API
+ - Addon URL, antiviral, HTTP cache filters
+
+17.07.03
++ ODBC changed to re-establish broken connection
+
+11.06.03
+! #ifndef NOSQL changed to NOODBC
+
+22.05.03
++ strong auth now supported for POP3 proxy. Now, username can be in format
+ proxy_username:proxy_password:POP3_username@pop3server
+
+30.04.03
+! redirect function now do not change code of traffic limit error
+
+24.04.2003
+! -M changed to -D for *nix makefiles
+
+18.04.2003
+! HTTPS behaviour breaked by latest patches restored
+
+15.04.2003
+! fixed handling of special characters and non-existing files in
+ FTP over HTTP proxy.
+
+12.04.2003
+! fixed behaviour of HTTP proxy on RFC-incompatible web servers (banners
+ exchanges, price.ru, etc) - they terminate string with \n instead of
+ \r\n.
+
+10.04.2003
++ nsrecord and dialer commands added
+! Name resolution now occures right before authorization to prevent
+ unauthenticated users from performing NS lookups and demand dial.
+
+05.04.2003
++ N (Never) option value added for counters refreshing
+
+29.03.2003
++ !!! FTP support for HTTP proxy added.
+
+25.03.2003
+! Socks 4 bug fixed (was visible in Netscape)
++ Socks 4.5 support added (not tested)
+! !! UDP portmapper code fixed
+
+24.03.2003
+! Timeout, close on closed socket and FD bugs fixed in UDPPM
+
+21.03.2003
++ Proxy-Authorization now works for CONNECT (HTTPS proxy).
+
+07.03.2003
+! counter command extended to allow traffic reports
+
+02.03.2003
+! Bandwidth/Traffic limiting problems fixed
+! gethostbyname() argument limited to 256 characters. It may be significant
+ for Windows
+
+27.02.2003
++ !!! Traffic limitting feature added (counter/countin/nocountin)
+
+26.02.2003
+! nobandlim processing changed
+! bandlim/nobamdlim commands renamed to bandlimin/nobandlimin
+
+22.02.2003
++ !!! Bandwidth limiting features added (bandlim and nobandlim commands)
+
+18.02.2003
++ Mutext support added for inter-thread data access. Should improve stability.
+- debugging printf() removed from proxy, typo fixed in auth.c
+
+10.02.2003
+! Changed to use WSASocket()/WSAAccept() instead of socket()/accept() under
+ Windows
+
+30.01.2003
+! Version of gcc changed (3.2).
++ nscache option added to 3proxy configuration for DNS cache. For a while
+ caching is primitive (with no expiration).
+
+27.01.2003
+- \n removed from perror() calls
+
+27/01/2003 3[APA3A]tiny proxy 0.3b.
+New features are marked with !.
+
+ Features:
+ 1. General
+ + HTTP/1.1 Proxy with keep-alive client and server support,
+ transparent proxy support.
+ ! HTTPS (CONNECT) proxy
+ + SOCKSv4 Proxy
+ + SOCKSv5 Proxy (TCP only)
+ ! Transparent SOCKS->HTTP redirection
+ + POP3 Proxy
+ + TCP port mapper
+ + UDP port mapper
+ + Threaded application (no child process).
+ 2. Proxy chaining
+ ! Parent proxy support for any type of incoming connection
+ ! Username/password authentication for parent proxy(s).
+ ! HTTPS/SOCKS4/SOCKS5 and redirection parent support
+ ! Random parent select
+ ! Chain building (multihop proxing)
+ 3. Logging
+ ! turnable log format
+ + stdout logging
+ + file logging
+ + syslog logging (Unix)
+ ! ODBC logging (Windows)
+ + log file rotation (hourly, daily, weekly, monthly)
+ + automatic log file comperssion with external archiver (for files)
+ + automatic removal of older log files
+ 4. Access control
+ + User authorization by NetBIOS messanger name
+ + Access control by username, source IP, destination IP and destination
+ port
+ + Access control by username/password for SOCKSv5 and HTTP
+ + Cleartext or encrypted (crypt/MD5 or NT) passwords.
+ + Connection redirection
+ ! Access control by requested action (CONNECT/BIND,
+ HTTP GET/POST/PUT/HEAD/OTHER).
+ 5. Configuration
+ + support for configuration files
+ + support for includes in configuration files
+ + interface binding
+ + running as daemon process
+ ! utility for networks list building
+ Unix
+ + support for chroot
+ + support for setgid
+ + support for setuid
+ NT
+ + support --install as service
+ + support --remove as service
+ + support for service START, STOP, PAUSE and CONTINUE commands (on
+ PAUSE no new connection accepted, but active connections still in
+ progress)
+ 6. Compilation
+ + MSVC (msvcrt.dll)
+ ! Intel Windows Compiler (msvcrt.dll)
+ + Windows/gcc (msvcrt.dll)
+ + Cygwin/gcc (cygwin.dll)
+ + Unix/gcc
+ ! Unix/ccc
+
+ Known bugs:
+
+ - udppm doesn't work if compiled with cygwin.
+
+ Cygwin doesn't support recvfrom()/sendto() on connected socket, so
+ recv/send is used instead... Not a big deal anyway.
+
+
+ Planned for future release:
+ - FTP proxy support
+ - Web interface for configuration
+ - Signal handling on Unix (for stop/pause/resume/configuration change)
+ - External filter API
+ - Addon trafficshape, URL, antiviral, HTTP cache filters
+
+
+27.01.2003
+!!!!!!!!!!!!!!!!!!!
+! Tagging as 0.3b !
+!!!!!!!!!!!!!!!!!!!
+
+24.01.2003
+- Fixed to use INVALID_SOCKET instead of -1 (for Windows compatibility)
+- Fixed problem with threading support under gcc. Now ODBC logging seems
+ to work always.
+! strncasecmp removed. Changed to use strnicmp for Windows.
+
+21.01.2003
+! 0.3 development frozen to only bugfixes
+- bug fixed causing 3proxy to crash with NULL pointer reference on
+ transparent web redirection
+- SQL support removed from default (gcc) compilation
+
+20.01.2003
++ ODBC logging (yeah!). For a while it works stable only if compiled with
+ MSVC or Intel compiler.
+
+17.01.2003
+- bug introduced yesterday into CONNECT code cleaned
+
+16.01.2003
++ timeouts command added
+
+13.01.2003
+- daemonizing code changed to work correctly on buggy libc (FreeBSD)
+ (pthread_* doesn't work after daemon())
+- logging code changed to work correctly on buggy libc (FreeBSD 4.4)
+ (freopen "a" mode doesn't work as expected on stdout)
+
+12.01.2003
+! License is changed to prohibit modification and commercial use
+
+11.01.2003
+! All makefiles are made uniform
++ Makefiles for Compaq C complier (Makefile.ccc) and Intel C Compiler for
+ Windows (Makefile.intl) added
++ Makefile.msvc added for Microsoft Visual C Compiler
+! proxy.dsp removed
+
+10.01.2003
++ Now checked to compile with Compaq C Compiler under linux on alpha platform
++ logformat configuration command added for custom log entry format
+! Unix version changed to use gettimeofday instead of ftime to avoid -lcompat
+ issue.
+
+09.01.2003
+! Randomizer changed for proxy chaining
+! Code cleaned: Makefile, signed/unsigned conversions, etc.
+! Typo fixed preventing from compilation under *nix
+
+08.01.2003
++ dateformat command added
+! Log format changed!!!
++ Control for different operations (CONNECT,BIND,HTTP_*, etc) added to ACL,
+ see 3proxy.cfg.sample
+
+25.12.2002
++ Proxy chaining now is fully operational!!!!!
++ SOCKSv4 and SOCKSv5 client code added for chaining
++ HTTP connect authentication added for chaining
++ Parent authentication for HTTP proxy added
+- Problem with "Connection: close" resolved (if HTTP server time outs or closes
+ connection).
+
+24.12.2002
++ Proxy chaining works!!! (for a while only HTTP CONNECT proxies
+ are supported and no parent authentication). Logging is updated to
+ include number of redirections (parent proxies) in square brackets.
+ See config.sample for example of "parent" command.
+
+23.12.2002
+! Transparent proxy operations improved, logging corrected
++ Added base code for proxy chaining
+! Redirection code rewritten
+
+23.12.2002
++ UDP ASSOCIATE added (but not tested) to SOCKS.
+! Additional logging added to socks proxy
++ Local HTTP proxy redirection added (for SOCKS).
+
+01.12.2002
+! closesock() problem _finally_ patched...
+
+30.11.2002
+! Makefile.unix corrected
+! Do not process $ in included files for 3proxy.cfg
+! Common error codes are unified
+
+29.11.2002
++ nserver example added to 3proxy.cfg.sample
+
+28.11.2002
+- fixed closesock() instead of close() call on 3proxy.cfg included files
+ for native Windows.
+
+27.11.2002
+! Minor changes in docummentation
++ dighosts utility added
+
+22.11.2002
+- Few problems corrected in logfiles rotation
+
+20.11.2002
+- SOCKSv5 bind() reply corrected.
+
+19.11.2002
++ internal resolver added to avoid usage of thread unsafe gethostbyname().
+ nserver configuration option added to config file.
+! HTTP proxy behaviour slightly changed to be more compatible.
+
+06/11/2002 3[APA3A]tiny proxy 0.2b Initial release.
+
+ Features:
+ 1. General
+ + HTTP/1.1 Proxy with keep-alive client and server support,
+ transparent proxy support.
+ + SOCKSv4 Proxy
+ + SOCKSv5 Proxy (TCP only)
+ + POP3 Proxy
+ + TCP port mapper
+ + UDP port mapper
+ + Threaded application (no child process).
+ 2. Logging
+ + stdout logging
+ + file logging
+ + syslog logging (Unix)
+ + log file rotation (hourly, daily, weekly, monthly)
+ + automatic log file comperssion with external archiver (for files)
+ + automatic removal of older log files
+ 3. Access control
+ + User authorization by NetBIOS messanger name
+ + Access control by username, source IP, destination IP and destination
+ port
+ + Access control by username/password for SOCKSv5 and HTTP
+ + Cleartext or encrypted (crypt/MD5 or NT) passwords.
+ 4. Configuration
+ + support for configuration files
+ + support for includes in configuration files
+ + interface binding
+ + running as daemon process
+ Unix
+ + support for chroot
+ + support for setgid
+ + support for setuid
+ NT
+ + support --install as service
+ + support --remove as service
+ + support for service START, STOP, PAUSE and CONTINUE commands (on
+ PAUSE no new connection accepted, but active connections still in
+ progress)
+ 5. Compilation
+ + Microsoft VC++ (msvcrt.dll)
+ + Windows/gcc (msvcrt.dll)
+ + Cygwin/gcc (cygwin.dll)
+ + Unix/gcc
+
+ Known bugs:
+
+ - udppm doesn't work if compiled with cygwin.
+
+ Cygwin doesn't support recvfrom()/sendto() on connected socket, so
+ recv/send is used instead... Not a big deal anyway.
+
+ - socks5 doesn't work with UDP
+
+ Not implemented yet
+
+ Planned for future release:
+ - UDP implementation in SOCKSv5
+ - Signal handling on Unix (for pause/resume)
+ - External filter API
+ - Addon trafficshape, URL, antiviral, HTTP cache filters
+
+06.11.2002
+!!MARK IT 0.2beta
+! Using UPX to compress 3proxy.exe
+
+
+02.11.2002
++ HTTP proxy now supports kepp-alive connections to HTTP server or proxy.
+ It dramatically decreases number of outgoing connections and amount of DNS
+ traffic.
+
+01.11.2002
++ Now proxy can catch Web server style requests. It means proxy
+ may be used as a transparent proxy. Yes. It means you can redirect
+ SOCKS requests with target 80 to HTTP proxy.
+! Port check in ACL fixed
+! Now proxy catches redirection by changed destination IP or port. If
+ you redirect request to web server make sure it supports proxy style
+ requests (IIS and Apache do).
++ HTTP proxy supports keep-alive. Now number of threads required
+ significantly reduced.
++ HTTP CONNECT fully supported (both direct and redirected to another proxy).
+ Now you can use our proxy for HTTPs. Or for spam :) Don't forget to set ACL
+ for outgoing ports, cause now ports are not limited.
+
+26.10.2002
++ mycrypt utility added for making crypted passwords in NT and crypt/MD5
+! ACL check for strong auth corrected
++ HTTP proxy support for authentication (basic). Now you can use strong
+ username/password authentication with proxy module.
++ Error messages added for HTTP proxy
+
+25.10.2002
++ NT passwords are now supported in 3proxy.cfg
+! Public License Agreement changed to be more clear
+
+24.10.2002
+! Fixed handle leak because of missed CloseHandle for threads in Windows
+
+23.10.2002
+! Fixed POP3 proxy bug
+! Strong auth changed to allow rules with * for username
++ MD5 crypt format passwords is now supported... Do we ever need DES?
+ I will not implement blowfish - it's huge and rarely used.
++ More comments added to 3proxy.cfg.sample
+
+21.10.2002
+! Fixed strongauth problem - ACL was not checked for authenticated
+ SOCKSv5 users
+
+16.10.2002
++ Added support for SOCKSv5 cleartext password authentication
++ "strong" authentication is now OK (use it only for SOCKS)
++ added "users" config file command to specify username and password. Only
+ cleartext for a while.
+
+20.09.2002
+! Minor improvements in socket operations
+
+17.09.2002
+! HTTP proxy changed to do not strip hostname from URI if target port is not
+ 80. It allows to redirect requests to another proxy as well as redirect to
+ different Web server via ACL. It will work for most servers (IIS, Apache)
+ if target redirected to non-standard port of Web server, but may fail in
+ some rare cases. Redirection to proxy should always work OK except if proxy
+ is on TCP/80.
++ Added "redirect" ACL command. You can redirect request to another destination
+ if ACL entry matches (that is by target or source IP, target port, username).
+! Fixed documentation bug in 3proxy.cfg.sample ("authtype" instead of "auth")
+! Fixed bug causing server to exit in native Win32 mode if "service"
+ configuration option is not configured
+! Outgoing SOCKS connections are handled in common way now.
+
+07.09.2002
++ added binding to external interface for outgoing connections
+! Fixed bug causing username check in ACL always fail
++ Added ACL check for UDP map
++ Added "Single packet" services to UDP portmap (-s switch). Allows unlimited
+ number of clients to be handled by portmapper for single-packet services
+ (like DNS).
+
+06.09.2002 3[APA3A]tiny proxy 0.1b initial release
+
+ Features:
+ 1. General
+ + HTTP/1.0 Proxy
+ + SOCKSv4 Proxy
+ + SOCKSv5 Proxy (TCP only)
+ + POP3 Proxy
+ + TCP port mapper
+ + UDP port mapper
+ + Threaded application (no child process).
+ 2. Logging
+ + stdout logging
+ + file logging
+ + syslog logging (Unix)
+ + log file rotation (hourly, daily, weekly, monthly)
+ + automatic log file comperssion with external archiver (for files)
+ + automatic removal of older log files
+ 3. Access control
+ + User authorization by NetBIOS messanger name
+ + Access control by username, source IP, destination IP and destination
+ port
+ 4. Configuration
+ + support for configuration files
+ + support for includes in configuration files
+ + interface binding
+ + running as daemon process
+ Unix
+ + support for chroot
+ + support for setgid
+ + support for setuid
+ NT
+ + support --install as service
+ + support --remove as service
+ + support for service START, STOP, PAUSE and CONTINUE commands (on
+ PAUSE no new connection accepted, but active connections still in
+ progress)
+ 5. Compilation
+ + Microsoft VC++ (msvcrt.dll)
+ + Windows/gcc (msvcrt.dll)
+ + Cygwin/gcc (cygwin.dll)
+ + Unix/gcc
+
+ Known bugs:
+
+ - udppm doesn't work if compiled with cygwin.
+
+ Cygwin doesn't support recvfrom()/sendto() on connected socket, so
+ recv/send is used instead... Not a big deal anyway.
+
+ - udppm works without authentication
+
+ Will be patched later.
+
+ - socks5 doesn't work with UDP
+
+ Not implemented yet
+
+ Planned for future release:
+ - Improvements to UDP portmapping
+ - UDP implementation in SOCKSv5
+ - Ident authorization
+ - SOCKSv5 password authentication
+ - Signal handling on Unix (for pause/resume)
+ - External filter API
+ - Addon trafficshape, URL, antiviral, HTTP cache filters
+ - HTTP/1.1 support
+
+
+$Id: Changelog,v 1.154 2006/03/08 18:44:00 vlad Exp $
\ No newline at end of file
diff --git a/Makefile.Linux b/Makefile.Linux
new file mode 100644
index 0000000..9754446
--- /dev/null
+++ b/Makefile.Linux
@@ -0,0 +1,98 @@
+#$Id: Makefile.Linux,v 1.24 2014-04-07 20:34:57 vlad Exp $
+#
+# 3 proxy Makefile for GCC/Linux/Cygwin
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# remove -DNOODBC from CFLAGS and add -lodbc to LDFLAGS to compile with ODBC
+# library support. Add -DSAFESQL for poorely written ODBC library / drivers.
+
+BUILDDIR =
+CC = gcc
+
+CFLAGS = -Wall -g -O2 -c -pthread -DGETHOSTBYNAME_R -D_THREAD_SAFE -D_REENTRANT -DNOODBC -DWITH_STD_MALLOC -DFD_SETSIZE=4096 -DWITH_POLL
+COUT = -o
+LN = gcc
+DCFLAGS = -fpic
+LDFLAGS = -Wall -O2 -pthread
+DLFLAGS = -shared
+DLSUFFICS = .ld.so
+# -lpthreads may be reuqired on some platforms instead of -pthreads
+LIBS = -lcrypto -lssl -ldl
+LNOUT = -o
+EXESUFFICS =
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *~
+REMOVECOMMAND = rm -f
+TYPECOMMAND = cat
+COMPATLIBS =
+MAKEFILE = Makefile.Linux
+PLUGINS = SSLPlugin StringsPlugin TrafficPlugin PCREPlugin TransparentPlugin
+
+include Makefile.inc
+
+allplugins:
+ @list='$(PLUGINS)'; for p in $$list; do cp Makefile Makefile.var plugins/$$p; cd plugins/$$p ; make ; cd ../.. ; done
+
+DESTDIR =
+prefix = /usr/local
+exec_prefix = $(prefix)
+man_prefix = $(prefix)/share
+
+INSTALL = /usr/bin/install
+INSTALL_BIN = $(INSTALL) -m 755
+INSTALL_DATA = $(INSTALL) -m 644
+INSTALL_OBJS = src/3proxy \
+ src/countersutil \
+ src/dighosts \
+ src/ftppr \
+ src/mycrypt \
+ src/pop3p \
+ src/proxy \
+ src/socks \
+ src/tcppm \
+ src/udppm
+
+
+INSTALL_CFG_OBJS = scripts/3proxy.cfg \
+ scripts/add3proxyuser.sh
+INSTALL_CFG_DEST = config
+
+INSTALL_CFG_OBJS2 = passwd counters bandlimiters
+
+MANDIR1 = $(DESTDIR)$(man_prefix)/man/man1
+MANDIR3 = $(DESTDIR)$(man_prefix)/man/man3
+MANDIR8 = $(DESTDIR)$(man_prefix)/man/man8
+BINDIR = $(DESTDIR)$(exec_prefix)/bin
+ETCDIR = $(DESTDIR)$(prefix)/etc/3proxy
+
+install-bin:
+ $(INSTALL_BIN) -d $(BINDIR)
+ $(INSTALL_BIN) -s $(INSTALL_OBJS) $(BINDIR)
+
+install-etc-dir:
+ $(INSTALL_BIN) -d $(ETCDIR)
+
+install-etc-default-config:
+ if [ -f $(ETCDIR)/$(INSTALL_CFG_DEST) ]; then \
+ : ; \
+ else \
+ $(INSTALL_DATA) $(INSTALL_CFG_OBJS) $(ETCDIR)/$(INSTALL_CFG_DEST) \
+ fi
+
+install-etc: install-etc-dir
+ for file in $(INSTALL_CFG_OBJS2); \
+ do \
+ touch $(ETCDIR)/$$file; chmod 0600 $(ETCDIR)/$$file; \
+ done;
+
+install-man:
+ $(INSTALL_BIN) -d $(MANDIR3)
+ $(INSTALL_BIN) -d $(MANDIR8)
+ $(INSTALL_DATA) man/*.3 $(MANDIR3)
+ $(INSTALL_DATA) man/*.8 $(MANDIR8)
+
+install: install-bin install-etc install-man
+
diff --git a/Makefile.Solaris b/Makefile.Solaris
new file mode 100644
index 0000000..34c89ac
--- /dev/null
+++ b/Makefile.Solaris
@@ -0,0 +1,35 @@
+#$Id: Makefile.Solaris,v 1.18 2008/09/30 13:58:44 vlad Exp $
+#
+# 3 proxy Makefile for Solaris/SunCC
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# remove -DNOODBC from CFLAGS and add -lodbc to LDFLAGS to compile with ODBC
+# library support. Add -DSAFESQL for poorely written ODBC library / drivers.
+
+BUILDDIR =
+CC = cc
+CFLAGS = -xO3 -c -D_SOLARIS -D_THREAD_SAFE -DGETHOSTBYNAME_R -D_REENTRANT -DNOODBC -DWITH_STD_MALLOC -DFD_SETSIZE=4096 -DWITH_POLL
+COUT = -o ./
+LN = cc
+LDFLAGS = -xO3
+DCFLAGS = -fpic
+DLFLAGS = -shared
+DLSUFFICS = .ld.so
+LIBS = -lpthread -lsocket -lnsl -lresolv -ldl
+LNOUT = -o ./
+EXESUFFICS =
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *~
+REMOVECOMMAND = rm -f
+TYPECOMMAND = cat
+COMPATLIBS =
+MAKEFILE = Makefile.Solaris
+PLUGINS = StringsPlugin TrafficPlugin PCREPlugin
+
+include Makefile.inc
+
+allplugins:
+ @list='$(PLUGINS)'; for p in $$list; do cp Makefile Makefile.var plugins/$$p; cd plugins/$$p ; make ; cd ../.. ; done
diff --git a/Makefile.Solaris-gcc b/Makefile.Solaris-gcc
new file mode 100644
index 0000000..ac8e730
--- /dev/null
+++ b/Makefile.Solaris-gcc
@@ -0,0 +1,36 @@
+#$Id: Makefile.Solaris-gcc,v 1.14 2008/09/30 13:58:44 vlad Exp $
+#
+# 3 proxy Makefile for Solaris/gcc
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# remove -DNOODBC from CFLAGS and add -lodbc to LDFLAGS to compile with ODBC
+# library support. Add -DSAFESQL for poorely written ODBC library / drivers.
+
+
+BUILDDIR =
+CC = gcc
+CFLAGS = -O3 -c -D_SOLARIS -D_THREAD_SAFE -DGETHOSTBYNAME_R -D_REENTRANT -DNOODBC -DWITH_STD_MALLOC -DFD_SETSIZE=4096 -DWITH_POLL
+COUT = -o ./
+LN = gcc
+LDFLAGS = -O3
+DCFLAGS = -fpic
+DLFLAGS = -shared
+DLSUFFICS = .ld.so
+LIBS = -lpthread -lsocket -lnsl -lresolv -ldl
+LNOUT = -o ./
+EXESUFFICS =
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *~
+REMOVECOMMAND = rm -f
+TYPECOMMAND = cat
+COMPATLIBS =
+MAKEFILE = Makefile.Solaris-gcc
+PLUGINS = StringsPlugin TrafficPlugin PCREPlugin
+
+include Makefile.inc
+
+allplugins:
+ @list='$(PLUGINS)'; for p in $$list; do cp Makefile Makefile.var plugins/$$p; cd plugins/$$p ; make ; cd ../.. ; done
diff --git a/Makefile.am b/Makefile.am
new file mode 100644
index 0000000..c13ae0f
--- /dev/null
+++ b/Makefile.am
@@ -0,0 +1,2 @@
+SUBDIRS = src man
+EXTRA_DIST = doc cfg
diff --git a/Makefile.ccc b/Makefile.ccc
new file mode 100644
index 0000000..d350619
--- /dev/null
+++ b/Makefile.ccc
@@ -0,0 +1,35 @@
+#$Id: Makefile.ccc,v 1.12 2007/04/10 16:29:25 vlad Exp $
+#
+# 3 proxy Makefile for Compaq C Compiler
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# remove -DNOODBC from CFLAGS and add -lodbc to LDFLAGS to compile with ODBC
+# library support. Add -DSAFESQL for poorely written ODBC library / drivers.
+
+BUILDDIR =
+CC = ccc
+CFLAGS = -Wall -O2 -c -pthread -D_THREAD_SAFE -DNOODBC -DWITH_STD_MALLOC -DFD_SETSIZE=4096 -WITH_POLL
+COUT = -o
+LN = ccc
+LDFLAGS = -Wall -O2 -pthread
+DCFLAGS = -fpic
+DLFLAGS = -shared
+DLSUFFICS = .ld.so
+LIBS =
+LNOUT = -o
+EXESUFFICS =
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *~
+REMOVECOMMAND = rm -f
+TYPECOMMAND = cat
+COMPATLIBS =
+MAKEFILE = Makefile.ccc
+PLUGINS = StringsPlugin TrafficPlugin PCREPlugin
+
+include Makefile.inc
+
+allplugins:
+ @list='$(PLUGINS)'; for p in $$list; do cp Makefile Makefile.var plugins/$$p; cd plugins/$$p ; make ; cd ../.. ; done
diff --git a/Makefile.debug b/Makefile.debug
new file mode 100644
index 0000000..99259ff
--- /dev/null
+++ b/Makefile.debug
@@ -0,0 +1,27 @@
+#$Id: Makefile.debug,v 1.7 2007/04/18 05:33:19 vlad Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to add /D "WITH_STD_MALLOC" to CFLAGS to use standard malloc
+# libraries
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /FD /MDd /nologo /W3 /ZI /Wp64 /GS /Gs /RTCsu /EHs- /GA /GF /DEBUG /D "WITH_STD_MALLOC" /D "_DEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /machine:I386 /DEBUG
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.debug
+
+include Makefile.inc
+
+allplugins:
\ No newline at end of file
diff --git a/Makefile.inc b/Makefile.inc
new file mode 100644
index 0000000..d3bb6eb
--- /dev/null
+++ b/Makefile.inc
@@ -0,0 +1,13 @@
+#$Id: Makefile.inc,v 1.3 2007/01/23 16:00:26 vlad Exp $
+#
+# 3 proxy common Makefile
+#
+
+all:
+ $(TYPECOMMAND) $(MAKEFILE) > src/Makefile.var
+ @cd src && $(MAKE)
+
+clean:
+ @$(REMOVECOMMAND) *$(OBJSUFFICS) $(COMPFILES)
+ @cd src && $(MAKE) clean
+
diff --git a/Makefile.intl b/Makefile.intl
new file mode 100644
index 0000000..8d50fce
--- /dev/null
+++ b/Makefile.intl
@@ -0,0 +1,34 @@
+#$Id: Makefile.intl,v 1.8 2007/07/21 18:47:00 vlad Exp $
+#
+# 3 proxy Makefile for Intel C compiler for Windows (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+
+BUILDDIR = ../bin/
+CC = icl
+CFLAGS = /nologo /MD /W3 /G6 /GX /O2 /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /YX /FD /c
+COUT = /Fo
+LN = xilink
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.intl
+PLUGINS = WindowsAuthentication TrafficPlugin PCREPlugin
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
diff --git a/Makefile.msvc b/Makefile.msvc
new file mode 100644
index 0000000..75d4d7f
--- /dev/null
+++ b/Makefile.msvc
@@ -0,0 +1,36 @@
+#$Id: Makefile.msvc,v 1.17 2010-11-11 14:44:11 v.dubrovin Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin lastFripper FilePlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/Makefile.msvc64 b/Makefile.msvc64
new file mode 100644
index 0000000..d21f9de
--- /dev/null
+++ b/Makefile.msvc64
@@ -0,0 +1,35 @@
+#$Id: Makefile.msvc64,v 1.14 2007/07/21 18:47:05 vlad Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin64/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /EHs- /GS /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:x64
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc64
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
diff --git a/Makefile.msvcCE b/Makefile.msvcCE
new file mode 100644
index 0000000..8dc70a7
--- /dev/null
+++ b/Makefile.msvcCE
@@ -0,0 +1,36 @@
+#$Id: Makefile.msvc,v 1.14 2007/07/21 18:47:02 vlad Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /DARM /D "NOODBC" /nologo /MT /W3 /Wp64 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "_WINCE" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/Makefile.unix b/Makefile.unix
new file mode 100644
index 0000000..1be4eba
--- /dev/null
+++ b/Makefile.unix
@@ -0,0 +1,58 @@
+#$Id: Makefile.unix,v 1.20 2007/04/10 16:29:25 vlad Exp $
+#
+# 3 proxy Makefile for GCC/Unix
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# remove -DNOODBC from CFLAGS and add -lodbc to LDFLAGS to compile with ODBC
+# library support. Add -DSAFESQL for poorely written ODBC library / drivers.
+
+BUILDDIR =
+CC = gcc
+
+# you may need -L/usr/pkg/lib for older NetBSD versions
+CFLAGS = -Wall -g -O2 -c -pthread -D_THREAD_SAFE -D_REENTRANT -DNOODBC -DWITH_STD_MALLOC -DFD_SETSIZE=4096 -DWITH_POLL
+COUT = -o
+LN = gcc
+LDFLAGS = -Wall -O2 -pthread
+# -lpthreads may be reuqired on some platforms instead of -pthreads
+# -ldl or -lld may be required for some platforms
+DCFLAGS = -fpic
+DLFLAGS = -shared
+DLSUFFICS = .ld.so
+LIBS =
+LNOUT = -o
+EXESUFFICS =
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *~
+REMOVECOMMAND = rm -f
+TYPECOMMAND = cat
+COMPATLIBS =
+MAKEFILE = Makefile.unix
+PLUGINS = StringsPlugin TrafficPlugin PCREPlugin
+
+include Makefile.inc
+
+install: all
+ if [ ! -d /usr/local/etc/3proxy/bin ]; then mkdir -p /usr/local/etc/3proxy/bin/; fi
+ install src/3proxy /usr/local/etc/3proxy/bin/3proxy
+ install src/mycrypt /usr/local/etc/3proxy/bin/mycrypt
+ install scripts/rc.d/proxy.sh /usr/local/etc/rc.d/proxy.sh
+ install scripts/add3proxyuser.sh /usr/local/etc/3proxy/bin/
+ if [ -s /usr/local/etc/3proxy/3proxy.cfg ]; then
+ echo /usr/local/etc/3proxy/3proxy.cfg already exists
+ else
+ install scripts/3proxy.cfg /usr/local/etc/3proxy/
+ if [ ! -d /var/log/3proxy/ ]; then
+ mkdir /var/log/3proxy/
+ fi
+ touch /usr/local/etc/3proxy/passwd
+ touch /usr/local/etc/3proxy/counters
+ touch /usr/local/etc/3proxy/bandlimiters
+ echo Run /usr/local/etc/3proxy/bin/add3proxyuser.sh to add \'admin\' user
+ fi
+
+allplugins:
+ @list='$(PLUGINS)'; for p in $$list; do cp Makefile Makefile.var plugins/$$p; cd plugins/$$p ; make ; cd ../.. ; done
diff --git a/Makefile.unix-install b/Makefile.unix-install
new file mode 100644
index 0000000..2646b26
--- /dev/null
+++ b/Makefile.unix-install
@@ -0,0 +1,61 @@
+DESTDIR =
+prefix = /usr/local
+exec_prefix = $(prefix)
+man_prefix = $(prefix)/share
+
+INSTALL = /usr/bin/install
+INSTALL_BIN = $(INSTALL) -m 755
+INSTALL_DATA = $(INSTALL) -m 644
+INSTALL_OBJS = src/3proxy \
+ src/countersutil \
+ src/dighosts \
+ src/ftppr \
+ src/mycrypt \
+ src/pop3p \
+ src/proxy \
+ src/socks \
+ src/tcppm \
+ src/udppm \
+ scripts/add3proxyuser.sh
+
+INSTALL_CFG_OBJS = scripts/3proxy.cfg
+INSTALL_CFG_DEST = config
+
+INSTALL_CFG_OBJS2 = passwd counters bandlimiters
+
+MANDIR1 = $(DESTDIR)$(man_prefix)/man/man1
+MANDIR3 = $(DESTDIR)$(man_prefix)/man/man3
+MANDIR8 = $(DESTDIR)$(man_prefix)/man/man8
+BINDIR = $(DESTDIR)$(exec_prefix)/bin
+ETCDIR = $(DESTDIR)$(prefix)/etc/3proxy
+
+install-bin:
+ $(INSTALL_BIN) -d $(BINDIR)
+ $(INSTALL_BIN) -s $(INSTALL_OBJS) $(BINDIR)
+
+install-etc-dir:
+ $(INSTALL_BIN) -d $(ETCDIR)
+
+install-etc-default-config:
+ if [ -f $(ETCDIR)/$(INSTALL_CFG_DEST) ]; then \
+ : ; \
+ else \
+ $(INSTALL_DATA) $(INSTALL_CFG_OBJS) $(ETCDIR)/$(INSTALL_CFG_DEST) \
+ fi
+
+install-etc: install-etc-dir
+ for file in $(INSTALL_CFG_OBJS2); \
+ do \
+ touch $(ETCDIR)/$$file; chmod 0600 $(ETCDIR)/$$file; \
+ done;
+
+install-man:
+ $(INSTALL_BIN) -d $(MANDIR1)
+ $(INSTALL_BIN) -d $(MANDIR3)
+ $(INSTALL_BIN) -d $(MANDIR8)
+ $(INSTALL_DATA) man/*.1 $(MANDIR1)
+ $(INSTALL_DATA) man/*.3 $(MANDIR3)
+ $(INSTALL_DATA) man/*.8 $(MANDIR8)
+
+install: install-bin install-etc install-man
+
diff --git a/Makefile.win b/Makefile.win
new file mode 100644
index 0000000..39882bc
--- /dev/null
+++ b/Makefile.win
@@ -0,0 +1,35 @@
+#$Id: Makefile.win,v 1.9 2007/08/20 15:26:27 vlad Exp $
+#
+# 3 proxy Makefile for GCC/windows
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# remove -DNOODBC from CFLAGS and add -lodbc to LDFLAGS to compile with ODBC
+# library support
+
+
+BUILDDIR = ../bin/
+CC = gcc
+CFLAGS = -O2 -s -c -mthreads -DWITH_STD_MALLOC
+COUT = -o
+LN = gcc
+LDFLAGS = -O2 -s -mthreads
+DLFLAGS = -shared
+DLSUFFICS = .dll
+LIBS = -lws2_32 -lodbc32 -ladvapi32
+LNOUT = -o
+EXESUFFICS = .exe
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *.tmp
+REMOVECOMMAND = rm -f
+TYPECOMMAND = cat
+COMPATLIBS =
+MAKEFILE = Makefile.win
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin
+
+include Makefile.inc
+
+allplugins:
+ @list='$(PLUGINS)'; for p in $$list; do cp Makefile Makefile.var plugins/$$p; cd plugins/$$p ; make ; rm *.o ; cd ../.. ; done
diff --git a/Makefile.winCE b/Makefile.winCE
new file mode 100644
index 0000000..15d166a
--- /dev/null
+++ b/Makefile.winCE
@@ -0,0 +1,35 @@
+#$Id: Makefile.win,v 1.9 2007/08/20 15:26:27 vlad Exp $
+#
+# 3 proxy Makefile for GCC/windows
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# remove -DNOODBC from CFLAGS and add -lodbc to LDFLAGS to compile with ODBC
+# library support
+
+
+BUILDDIR = ../bin/
+CC = /opt/cegcc/arm-wince-cegcc/bin/gcc
+CFLAGS = -Wall -O2 -s -c -mthreads -DWITH_STD_MALLOC -DNOODBC -D_WINCE -D_WIN32 -D__USE_W32_SOCKETS
+COUT = -o
+LN = /opt/cegcc/arm-wince-cegcc/bin/gcc
+LDFLAGS = -Wall -O2 -s -mthreads
+DLFLAGS = -shared
+DLSUFFICS = .dll
+LIBS = -lws2
+LNOUT = -o
+EXESUFFICS = .exe
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *.tmp
+REMOVECOMMAND = rm -f
+TYPECOMMAND = more
+COMPATLIBS =
+MAKEFILE = Makefile.winCE
+PLUGINS = TrafficPlugin StringsPlugin PCREPlugin
+
+include Makefile.inc
+
+allplugins:
+ @list='$(PLUGINS)'; for p in $$list; do cp Makefile Makefile.var plugins/$$p; cd plugins/$$p ; make ; rm *.o ; cd ../.. ; done
diff --git a/Readme b/Readme
new file mode 100644
index 0000000..0292ccc
--- /dev/null
+++ b/Readme
@@ -0,0 +1,67 @@
+/*
+ 3APA3A 3proxy tiny proxy server
+ (c) 2002-2009 by ZARAZA <3APA3A@security.nnov.ru>,
+ Vladimir Dubrovin
+
+ please read License Agreement
+
+ $Id: Readme,v 1.8 2009/03/18 17:46:22 vlad Exp $
+*/
+
+Please read doc/html/index.html and man pages.
+
+3proxy Combined proxy server may be used as
+ Windows 95/98/NT/2000/XP/2003/Vista
+ executable or service (supports installation and removal).
+ It uses config file to read it's configuration (see
+ 3proxy.cfg.sample for details).
+ --install installs and starts proxy as NT/2000/XP service
+ (config file should be located in the same directory)
+ --remove removes the service (should be stopped before via
+ net stop 3proxy).
+ 3proxy.exe is all-in-one, it doesn't require all others .exe
+ to work.
+ See 3proxy.cfg.sample for examples, see man 3proxy.cfg
+proxy HTTP proxy server, binds to port 3128
+ftppr FTP proxy server, binds to port 21
+socks SOCKS 4/5 proxy server, binds to port 1080
+ftppr FTP proxy server, please do not mess it with FTP over HTTP
+ proxy used in browsers
+pop3p POP3 proxy server, binds to port 110. You must specify
+ POP3 username as username@target.host.ip[:port]
+ port is 110 by default.
+ Exmple: in Username configuration for you e-mail reader
+ set someuser@pop.somehost.ru, to obtains mail for someuser
+ from pop.somehost.ru via proxy.
+smtpp SMTP proxy server, binds to port 25. You must specify
+ SMTP username as username@target.host.ip[:port]
+ port is 25 by default.
+ Exmple: in Username configuration for you e-mail reader
+ set someuser@mail.somehost.ru, to send mail as someuser
+ via mail.somehost.ru via proxy.
+icqpr ICQ/AIM proxy. Maps some TCP port to TCP port of ICQ
+ server and performs packets translation. Example:
+ icqpr 5190 login.icq.com 5190
+msnpr MSN proxy (beta)
+tcppm TCP port mapping. Maps some TCP port on local machine to
+ TCP port on remote host.
+udppm UDP port mapping. Maps some UDP port on local machine to
+ UDP port on remote machine. Only one user simulationeously
+ can use UDP mapping, so it cann't be used for public service
+ in large networks. It's OK to use it to map to DNS server
+ in small network or to map Counter-Strike server for single
+ client (you can use few mappings on different ports for
+ different clients in last case).
+mycrypt Program to obtain crypted password fro cleartext. Supports
+ both MD5/crypt and NT password.
+ mycrypt password
+ produces NT password
+ mycrypt salt password
+ produces MD5/crypt password with salt "salt".
+dighosts Utility for building networks list from web page.
+countersutil Utility to manage counters file
+
+
+Run utility with --help option for command line reference.
+
+Latest version is available from http://3proxy.ru/
diff --git a/authors b/authors
new file mode 100644
index 0000000..fb7a217
--- /dev/null
+++ b/authors
@@ -0,0 +1 @@
+(c) 2002-2007 by ZARAZA <3APA3A@security.nnov.ru>, Vladimir Dubrovin
\ No newline at end of file
diff --git a/cfg/0.scenario.txt b/cfg/0.scenario.txt
new file mode 100644
index 0000000..4b89b41
--- /dev/null
+++ b/cfg/0.scenario.txt
@@ -0,0 +1,18 @@
+Please read doc/config.txt before using 3proxy.
+
+In all examples next scenario is used:
+
+3proxy is installed on multihomed host. IP address of internal interface
+is 192.168.1.1. IP address of external interface is 10.1.1.1.
+Internal network has few subnetworks for 192.168.0.0/16.
+Users are named user1, user2, etc.
+
+You use external DNS server 10.1.2.1 and 10.1.2.2
+
+Provider has networks with free access. A list of networks is published
+on the provider's Web server.
+
+Provider has proxy server 10.1.2.5. Traffic from proxy server is not free, but
+is cheaper than traffic from non-free networks.
+
+$Id: 0.scenario.txt,v 1.2 2004/07/23 13:33:39 vlad Exp $
\ No newline at end of file
diff --git a/cfg/3proxy.cfg.sample b/cfg/3proxy.cfg.sample
new file mode 100644
index 0000000..ed63303
--- /dev/null
+++ b/cfg/3proxy.cfg.sample
@@ -0,0 +1,202 @@
+#!/usr/local/bin/3proxy
+# Yes, 3proxy.cfg can be executable, in this case you should place
+# something like
+#config /usr/local/3proxy/3proxy.cfg
+# to show which configuration 3proxy should re-read on realod.
+
+#system "echo Hello world!"
+# you may use system to execute some external command if proxy starts
+
+# We can configure nservers to avoid unsafe gethostbyname() usage
+nserver 10.1.2.1
+nserver 10.2.2.2
+# nscache is good to save speed, traffic and bandwidth
+nscache 65536
+
+#nsrecord porno.security.nnov.ru 0.0.0.0
+# nobody will be able to access porno.security.nnov.ru by the name.
+#nsrecord wpad.security.nnov.ru www.security.nnov.ru
+# wpad.security.nnov.ru will resolve to www.security.nnov.ru for
+# clients
+
+
+timeouts 1 5 30 60 180 1800 15 60
+# Here we can change timeout values
+
+users 3APA3A:CL:3apa3a "test:CR:$1$qwer$CHFTUFGqkjue9HyhcMHEe1"
+# note that "" required, overvise $... is treated as include file name.
+# $1$qwer$CHFTUFGqkjue9HyhcMHEe1 is 'test' in MD5 crypt format.
+#users $/usr/local/etc/3proxy/passwd
+# this example shows you how to include passwd file. For included files
+# and are treated as field separators.
+
+#daemon
+# now we will not depend on any console (daemonize). daemon must be given
+# before any significant command on *nix.
+
+service
+# service is required under NT if you want 3proxy to start as service
+
+#log /usr/local/etc/3proxy/logs/3proxy.log D
+log c:\3proxy\logs\3proxy.log D
+# log allows to specify log file location and rotation, D means logfile
+# is created daily
+
+#logformat "L%d-%m-%Y %H:%M:%S %z %N.%p %E %U %C:%c %R:%r %O %I %h %T"
+#logformat "Linsert into log (l_date, l_user, l_service, l_in, l_out, l_descr) values ('%d-%m-%Y %H:%M:%S', '%U', '%N', %I, %O, '%T')"
+#Compatible with Squid access.log:
+#
+#"- +_G%t.%. %D %C TCP_MISS/200 %I %1-1T %2-2T %U DIRECT/%R application/unknown"
+#or, more compatible format without %D
+#"- +_G%t.%. 1 %C TCP_MISS/200 %I %1-1T %2-2T %U DIRECT/%R application/unknown"
+#
+#Compatible with ISA 2000 proxy WEBEXTD.LOG (fields are TAB-delimited):
+#
+#"- + L%C %U Unknown Y %Y-%m-%d %H:%M:%S w3proxy 3PROXY - %n %R %r %D %O %I http TCP %1-1T %2-2T - - %E - - -"
+#
+#Compatible with ISA 2004 proxy WEB.w3c
+#
+#"- + L%C %U Unknown %Y-%m-%d %H:%M:%S 3PROXY - %n %R %r %D %O %I http %1-1T %2-2T - %E - - Internal External 0x0 Allowed"
+#
+#Compatible with ISA 2000/2004 firewall FWSEXTD.log (fields are TAB-delimited):
+#
+#"- + L%C %U unnknown:0:0.0 N %Y-%m-%d %H:%M:%S fwsrv 3PROXY - %n %R %r %D %O %I %r TCP Connect - - - %E - - - - -"
+#
+#Compatible with HTTPD standard log (Apache and others)
+#
+#"-""+_L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I"
+#or more compatible without error code
+#"-""+_L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" 200 %I"
+
+# in log file we want to have underscores instead of spaces
+logformat "- +_L%t.%. %N.%p %E %U %C:%c %R:%r %O %I %h %T"
+
+
+#archiver gz /bin/gzip %F
+#archiver zip zip -m -qq %A %F
+#archiver zip pkzipc -add -silent -move %A %F
+archiver rar rar a -df -inul %A %F
+# if archiver specified log file will be compressed after closing.
+# you should specify extension, path to archiver and command line, %A will be
+# substituted with archive file name, %f - with original file name.
+# Original file will not be removed, so archiver should care about it.
+
+rotate 30
+# We will keep last 30 log files
+
+auth iponly
+#auth nbname
+#auth strong
+# auth specifies type of user authentication. If you specify none proxy
+# will not do anything to check name of the user. If you specify
+# nbname proxy will send NetBIOS name request packet to UDP/137 of
+# client and parse request for NetBIOS name of messanger service.
+# Strong means that proxy will check password. For strong authentication
+# unknown user will not be allowed to use proxy regardless of ACL.
+# If you do not want username to be checked but wanna ACL to work you should
+# specify auth iponly.
+
+
+#allow ADMINISTRATOR,root
+#allow * 127.0.0.1,192.168.1.1 * *
+#parent 1000 http 192.168.1.2 80 * * * 80
+#allow * 192.168.1.0/24 * 25,53,110,20-21,1024-65535
+# we will allow everything if username matches ADMINISTRATOR or root or
+# client ip is 127.0.0.1 or 192.168.1.1. Overwise we will redirect any request
+# to port 80 to our Web-server 192.168.0.2.
+# We will allow any outgoing connections from network 192.168.1.0/24 to
+# SMTP, POP3, FTP, DNS and unprivileged ports.
+# Note, that redirect may also be used with proxy or portmapper. It will
+# allow you to redirect requests to different ports or different server
+# for different clients.
+
+# sharing access to internet
+
+external 10.1.1.1
+# external is address 3proxy uses for outgoing connections. 0.0.0.0 means any
+# interface. Using 0.0.0.0 is not good because it allows to connect to 127.0.0.1
+
+internal 192.168.1.1
+# internal is address of interface proxy will listen for incoming requests
+# 127.0.0.1 means only localhost will be able to use this proxy. This is
+# address you should specify for clients as proxy IP.
+# You MAY use 0.0.0.0 but you shouldn't, because it's a chance for you to
+# have open proxy in your network in this case.
+
+auth none
+# no authentication is requires
+
+dnspr
+
+# dnsproxy listens on UDP/53 to answer client's DNS requests. It requires
+# nserver/nscache configuration.
+
+
+#external $./external.ip
+#internal $./internal.ip
+# this is just an alternative form fo giving external and internal address
+# allows you to read this addresses from files
+
+auth strong
+# We want to protect internal interface
+deny * * 127.0.0.1,192.168.1.1
+# and llow HTTP and HTTPS traffic.
+allow * * * 80-88,8080-8088 HTTP
+allow * * * 443,8443 HTTPS
+proxy -n
+
+auth none
+# pop3p will be used without any authentication. It's bad choice
+# because it's possible to use pop3p to access any port
+pop3p
+
+tcppm 25 mail.my.provider 25
+#udppm -s 53 ns.my.provider 53
+# we can portmap port TCP/25 to provider's SMTP server and UDP/53
+# to provider's DNS.
+# Now we can use our proxy as SMTP and DNS server.
+# -s switch for UDP means "single packet" service - instead of setting
+# association for period of time association will only be set for 1 packet.
+# It's very userfull for services like DNS but not for some massive services
+# like multimedia streams or online games.
+
+auth strong
+flush
+allow 3APA3A,test
+maxconn 20
+socks
+# for socks we will use password authentication and different access control -
+# we flush previously configured ACL list and create new one to allow users
+# test and 3APA3A to connect from any location
+
+
+auth strong
+flush
+internal 127.0.0.1
+allow 3APA3A 127.0.0.1
+maxconn 3
+admin
+#only allow acces to admin interface for user 3APA3A from 127.0.0.1 address
+#via 127.0.0.1 address.
+
+# map external 80 and 443 ports to internal Web server
+# examples below show how to use 3proxy to publish Web server in internal
+# network to Internet. We must switch internal and external addresses and
+# flush any ACLs
+
+#auth none
+#flush
+#external $./internal.ip
+#internal $./external.ip
+#maxconn 300
+#tcppm 80 websrv 80
+#tcppm 443 websrv 443
+
+
+#chroot /usr/local/jail
+#setgid 65535
+#setuid 65535
+# now we needn't any root rights. We can chroot and setgid/setuid.
+
+
+###$Id: 3proxy.cfg.sample,v 1.7 2006/11/18 14:37:06 vlad Exp $#######
diff --git a/cfg/counters.sample b/cfg/counters.sample
new file mode 100644
index 0000000..03e537e
--- /dev/null
+++ b/cfg/counters.sample
@@ -0,0 +1,53 @@
+# Scenario:
+# You're billed for traffic except internal networks
+# 192.168.0.0 mask 255.255.0.0 and 10.0.0.0 mask 255.0.0.0.
+# If you exceed 2Gb limit you will have very high penalty
+#
+# You want to have daily report about common amount of external traffic.
+# You also need to know amount of Web traffic for every user
+# You want to limit Web traffic to 100Mb/day to whole campus and
+# to 20MB/day to every user
+
+# see explanations in 3proxy.cfg.sample
+internal 192.168.1.1
+external 10.1.1.1
+nserver 10.1.2.1
+nserver 10.2.2.2
+nscache 65536
+dnspr
+
+# no logging will be used, only traffic reports
+
+# use d:\3proxy\3profy.3cf to store counters data
+# generate daily traffic reports in d:\3proxy\traf\
+counter "d:\3proxy\3profy.3cf" D "d:\3proxy\traf\traf"
+
+# define users
+users "user1:CL:password1" "user2:CL:password2" "user3:CL:password3"
+users "user4:CL:password4" "user5:CL:password5" "user6:CL:password6"
+# ...
+
+# do not count traffic for 192.168.0.0/16,10.0.0.0/8
+nocountin * * 192.168.0.0/16,10.0.0.0/8
+# Count external traffic summary for all clients with limit to 100MB/day
+countin "1/Test 1" D 100 *
+# Count external Web traffic summary for all clients to 1Gb/month
+countin "2/Test 2" M 1024 vlad,3APA3A,test 127.0.0.1 * 80,81,8080-8088
+# For every user count and limit daily Web traffic to 20 Mb
+# There is no way to configure it in a single line, we need a line
+# for every user we have
+countin "3/User 1" D 20 user1 * * 80,81,8080-8088
+countin "4/User 2" D 20 user2 * * 80,81,8080-8088
+# ...
+countin "202/User 200" D 20 user200 * * 80,81,8080-8088
+
+# enable proxy
+auth strong
+proxy
+
+# enable administration to user1 from localhost
+internal 127.0.0.1
+allow user1
+admin
+
+#$Id: counters.sample,v 1.2 2004/07/23 13:33:39 vlad Exp $
\ No newline at end of file
diff --git a/contrib/www3proxy/isqlodbc/Makefile.inc b/contrib/www3proxy/isqlodbc/Makefile.inc
new file mode 100644
index 0000000..dddfce4
--- /dev/null
+++ b/contrib/www3proxy/isqlodbc/Makefile.inc
@@ -0,0 +1,6 @@
+all: isqlodbc$(EXESUFFICS)
+clean:
+ @$(REMOVECOMMAND) *$(OBJSUFFICS) $(COMPFILES)
+
+isqlodbc$(EXESUFFICS): isqlodbc$(OBJSUFFICS)
+ $(LN) $(LNOUT)isqlodbc$(EXESUFFICS) $(LDFLAGS) $(VERFILE) isqlodbc$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
\ No newline at end of file
diff --git a/contrib/www3proxy/isqlodbc/Makefile.unix b/contrib/www3proxy/isqlodbc/Makefile.unix
new file mode 100644
index 0000000..29e6862
--- /dev/null
+++ b/contrib/www3proxy/isqlodbc/Makefile.unix
@@ -0,0 +1,15 @@
+CC = gcc
+CFLAGS = -I /usr/local/include -DUNIX
+COUT = -o
+LN = gcc
+LDFLAGS =
+LIBS =-L /usr/local/lib -lodbc
+LNOUT = -o
+EXESUFFICS =
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *~
+REMOVECOMMAND = rm -f
+COMPATLIBS =
+
+include Makefile.inc
diff --git a/contrib/www3proxy/isqlodbc/Makefile.win b/contrib/www3proxy/isqlodbc/Makefile.win
new file mode 100644
index 0000000..ea7ad09
--- /dev/null
+++ b/contrib/www3proxy/isqlodbc/Makefile.win
@@ -0,0 +1,15 @@
+CC = gcc
+CFLAGS = -DWIN32
+COUT = -o
+LN = gcc
+LDFLAGS =
+LIBS = -lodbc32
+LNOUT = -o
+EXESUFFICS =
+OBJSUFFICS = .o
+DEFINEOPTION = -D
+COMPFILES = *~
+REMOVECOMMAND = rm -f
+COMPATLIBS =
+
+include Makefile.inc
diff --git a/contrib/www3proxy/isqlodbc/isqlodbc.c b/contrib/www3proxy/isqlodbc/isqlodbc.c
new file mode 100644
index 0000000..7b43c48
--- /dev/null
+++ b/contrib/www3proxy/isqlodbc/isqlodbc.c
@@ -0,0 +1,191 @@
+#include
+#include
+#include
+#ifdef WIN32
+#include
+#include
+#endif
+#ifdef UNIX
+#include
+#endif
+#include
+#include
+
+
+
+#define BUF_LENGTH 65000
+
+/* environment variable */
+SQLHENV env=NULL;
+SQLHDBC dbc=NULL;
+SQLHSTMT stmt=NULL;
+SQLHSTMT cstmt=NULL;
+unsigned char *dsn;
+unsigned char *user;
+unsigned char *pass;
+
+RETCODE retcod;
+
+/*description a columns of result of request */
+SQLSMALLINT ColumnCount;
+unsigned int ColNumber;
+unsigned char ColName[SQL_MAX_COLUMN_NAME_LEN];
+unsigned int Length;
+unsigned int Type;
+unsigned int Size;
+unsigned int Digits;
+unsigned int Nullable;
+
+
+unsigned char data_buf[BUF_LENGTH];
+unsigned long OutData;
+
+/* function print error message*/
+void PrintError(HENV env,HDBC dbc,HSTMT stmt,RETCODE retcod)
+{
+ SQLINTEGER nError;
+ SQLSMALLINT TextLength;
+ unsigned char BufErrMsg[SQL_MAX_MESSAGE_LENGTH+1];
+ unsigned char SqlState[128];
+
+ SQLError(env,dbc,stmt,SqlState,&nError,BufErrMsg,512, &TextLength);
+ printf("%s\n" ,BufErrMsg);
+}
+
+void sqlquery(SQLHDBC dbc,SQLHSTMT stmt, unsigned char *strquery)
+{
+ retcod=SQLAllocStmt(dbc, &stmt);
+
+ retcod=SQLExecDirect(stmt,strquery,SQL_NTS);
+ if(retcod!=SQL_SUCCESS)
+ { PrintError(env,dbc,stmt,retcod);}
+
+ SQLNumResultCols(stmt,&ColumnCount);
+
+ while(SQLFetch(stmt)==SQL_SUCCESS)
+ {
+ for(ColNumber=1; ColNumber<=ColumnCount ; ColNumber++)
+ {
+ SQLGetData(stmt,ColNumber,SQL_CHAR,data_buf,BUF_LENGTH,&OutData);
+ printf("%s|",data_buf);
+ }
+ printf("\n",data_buf);
+ strcpy(data_buf,"");
+ }
+ SQLFreeStmt( stmt, SQL_DROP );
+}
+
+/* isqlodbc dsn[[,user][,pass]] ["SQLCMD"] */
+int main(int argc, char *argv[])
+{
+ unsigned char qbuf[64000];
+ unsigned char *ptr=NULL;
+
+ /* Allocate environment and database connection handles */
+ retcod=SQLAllocEnv( &env );
+ if(retcod!=SQL_SUCCESS)
+ {
+ PrintError(env,dbc,stmt,retcod);
+ SQLFreeEnv(env);
+ return (-1);
+ }
+ retcod = SQLAllocConnect( env, &dbc );
+ if(retcod!=SQL_SUCCESS)
+ {
+ PrintError(env,dbc,stmt,retcod);
+ SQLFreeConnect( dbc );
+ return (-1);
+ }
+
+
+ if(argc > 1 )
+ {
+ /* parsing command line and get parametrs */
+ dsn = strtok(argv[1],",");
+ user = strtok(NULL, ",");
+ pass = strtok(NULL, ",");
+
+ /* Connect from DSN */
+ retcod=SQLConnect(dbc,dsn,SQL_NTS,user,SQL_NTS,pass,SQL_NTS);
+
+ if(retcod!=SQL_SUCCESS)
+ { PrintError(env,dbc,stmt,retcod); }
+ else
+ {
+ if (argc > 2)
+ {
+ /*sql cmd from command line*/
+ sqlquery(dbc,stmt,argv[2]);
+ }
+ else
+ {
+ /*sql cmd from stdin */
+ if( isatty(0) ){ printf(".tables - list table\n.q - exit\nsql>"); }
+ while(fgets(qbuf,63000,stdin) != NULL )
+ {
+ ptr=strrchr(qbuf,';');
+ if (ptr!=NULL)
+ {
+ sqlquery(dbc,stmt,qbuf);
+ }
+ else
+ {
+ /*cmd exit*/
+ if (strstr(qbuf,".q")){ break; };
+
+ /*cmd table list*/
+ if (strstr(qbuf,".tables"))
+ {
+ retcod=SQLAllocStmt(dbc, &stmt);
+ if(retcod!=SQL_SUCCESS){ PrintError(env,dbc,stmt,retcod); }
+ else
+ {
+ retcod=SQLTables(stmt,NULL,0,NULL,0,NULL,0,NULL,0);
+ if(retcod !=SQL_SUCCESS) { PrintError(env,dbc,stmt,retcod);}
+ while(SQLFetch(stmt)==SQL_SUCCESS)
+ {
+ SQLGetData(stmt,3,SQL_CHAR,data_buf,BUF_LENGTH,&OutData);
+ printf("%s|",data_buf);
+
+ /*list columns */
+ retcod=SQLAllocStmt(dbc, &cstmt);
+ retcod=SQLColumns(cstmt,NULL,0,NULL,0,data_buf,strlen(data_buf),NULL,0);
+
+ if(retcod !=SQL_SUCCESS) { PrintError(env,dbc,stmt,retcod);}
+ else
+ {
+ printf("create table %s (",data_buf);
+ while(SQLFetch(cstmt)==SQL_SUCCESS)
+ {
+ SQLGetData(cstmt,4,SQL_CHAR,data_buf,BUF_LENGTH,&OutData);
+ printf("%s ",data_buf);
+ SQLGetData(cstmt,6,SQL_CHAR,data_buf,BUF_LENGTH,&OutData);
+ printf("%s, ",data_buf);
+ }
+ printf(");\n");
+ SQLFreeStmt( cstmt, SQL_DROP );
+ }/*end list columns*/
+
+ }/*end while SQLFetch */
+ SQLFreeStmt( stmt, SQL_DROP );
+ }
+
+ }/*end if (strstr(qbuf,".tables")) */
+
+
+ } /*end else cmd*/
+ if( isatty(0) ){ printf("sql>"); }
+ } /*end while*/
+ }
+ }
+ SQLDisconnect(dbc);
+ } /* if (argc > 2) */
+ else
+ {
+ printf("isqlodbc dsn[[,user][,pass]] [\"SQLCMD\"]\n");
+ }
+
+ SQLFreeConnect( dbc );
+ SQLFreeEnv( env );
+ return 0;
+}
diff --git a/contrib/www3proxy/log.sql b/contrib/www3proxy/log.sql
new file mode 100644
index 0000000..747b5d1
--- /dev/null
+++ b/contrib/www3proxy/log.sql
@@ -0,0 +1,22 @@
+
+create table log (ldate date,ltime time,username char (30),userip char (16),bytein integer (10),byteout integer (10),service char (8), host char(255), hostport integer (10), url char (255) );
+
+create index idate on log (ldate);
+create index iusername on log (username);
+create index iuserip on log (userip);
+create index ihost on log (host);
+
+create table services (port integer(10),service char(100),description char (100));
+
+INSERT INTO services values (80,'PROXY', 'Access to Web Server');
+INSERT INTO services values (21,'PROXY', 'Access to Ftp Server via HTTP proxy');
+INSERT INTO services values (5190,'PROXY', 'Access to ICQ via HTTP proxy');
+INSERT INTO services values (0, 'POP3P', 'Received Mail via POP3');
+INSERT INTO services values (0,'FTPPR', 'Access to Ftp server via FTP proxy');
+INSERT INTO services values (0,'SOCKS4', 'Access to external server via Socks v4');
+INSERT INTO services values (0,'SOCKS5', 'Access to external server via Socks v5');
+INSERT INTO services values (0,'TCPPM', 'Access to external server via TCP mapping');
+INSERT INTO services values (0,'UDPPM', 'Access to external server via UDP mapping');
+INSERT INTO services values (0, 0, NULL, 'Unknown');
+
+
diff --git a/contrib/www3proxy/readme.ru b/contrib/www3proxy/readme.ru
new file mode 100644
index 0000000..70013c5
--- /dev/null
+++ b/contrib/www3proxy/readme.ru
@@ -0,0 +1,63 @@
+------------------------------ KOI8-R ------------------------------------
+ üÔÏÔ ÁÒÈÉ× ÓÏÄÅÒÖÉÔ ÎÁÂÏÒ CGI cËÒÉÐÔÏ× É ÐÒÏÇÒÁÍÍ ÄÌÑ ÐÏÌÕÞÅÎÉÑ
+ÓÔÁÔÉÓÔÉËÉ ÒÁÂÏÔÙ ÐÏÌØÚÏ×ÁÔÅÌÅÊ ÐÒÏËÓÉ ÓÅÒ×ÅÒÁ "3proxy", ÐÏÓÒÅÄÓÔ×ÏÍ ÁÎÁÌÉÚÁ
+ÌÏÇÁ ÒÁÓÐÏÌÏÖÅÎÎÏÇÏ × ODBC ÉÓÔÏÞÎÉËÅ(ÂÁÚÅ), ÞÅÒÅÚ Web ÉÎÔÅÒÆÅÊÓ.
+
+stat.awk - ÏÓÎÏ×ÎÏÊ CGI ÓËÒÉÐÔ (äÌÑ ÅÇÏ ÉÓÐÏÌØÎÅÎÉÑ ÐÏÄ Win9X/2000 ÎÅÏÂÈÏÄÉÍÁ
+ ÐÒÏÇÒÁÍÍÁ awk.exe ,× linux/freebsd ÏÎÁ ËÁË ÐÒÁ×ÉÌÏ ×ÈÏÄÉÔ × ÓÉÓÉÔÅÍÕ
+ ÐÏ ÕÍÏÌÞÁÎÉÀ).
+isqlodbc - ÐÒÏÇÒÁÍÍÁ ÄÌÑ ×ÙÐÏÌÎÅÎÉÑ SQL ÚÁÐÒÏÓÏ× Ë ÂÁÚÁÍ ODBC
+ (×ÙÚÙ×ÁÅÔÓÑ ÉÚ stat.awk). ËÏÍÐÉÌÉÒÕÅÔÓÑ gcc É ÒÁÂÏÔÁÅÔ ËÁË ×
+ win9X/2000 ÔÁË É × linux/freebsd. (ôÁË ÖÅ ÍÏÖÅÔ
+ ÉÓÐÏÌØÚÏ×ÁÔØÓÑ ÎÅÚÁ×ÉÓÉÍÏ ÏÔ stat.awk ËÁË ÏÔÄÅÌØÎÁÑ
+ ÐÒÏÇÒÁÍÍÁ..)
+log.sql - SQL ÓËÒÉÐÔ ÓÏÚÄÁÎÉÑ ÂÁÚÙ ÄÌÑ ÌÏÇÁ ÓÅÒ×ÅÒÁ.
+awk.exe - awk ÉÎÔÅÒÐÒÅÔÁÔÏÒ ÐÏÄ Win9X/2000.
+
+ îÁÓÔÒÏÊËÁ ÓËÒÉÐÔÏ× ÓÔÁÔÉÓÔÉËÉ .
+
+äÌÑ ÒÁÂÏÔÙ ×ÁÍ ÐÏÔÒÅÂÕÅÔÓÑ:
+1) ÌÀÂÏÊ http ÓÅÒ×ÅÒ ÐÏÄÅÒÖÉ×ÁÀÝÉÊ CGI
+2) odbc ÍÅÎÅÄÖÅÒ (ÐÏÄ win32 ) ÉÌÉ iodbc ÍÅÎÅÄÖÅÒ (ÐÏÄ unix)
+ ÌÀÂÁÑ ÂÁÚÁ ÄÁÎÎÙÈ ÎÁÐÒÉÍÅÒ : sqlite, mysql, postgress ÉÌÉ ÌÀÂÙÅ ÄÒÕÇÉÅ
+ ÉÍÅÀÝÉÅ ODBC ÄÒÁÊ×ÅÒÁ.(ëÁË ÎÁÓÔÒÁÉ×ÁÔØ iODBC ÐÏÄ linux/freebsd ÓÍÏÔÒÉÔÅ ×
+ ÆÁÊÌÅ iodbc.txt × ËÁÔÁÌÏÇÅ /doc/ru ÁÒÈÉ×Á 3proxy.)
+
+ ûÁÇ ÎÁÓÔÒÏÊËÉ N1:
+óÏÚÄÁÅÍ ÂÁÚÕ ÄÁÎÎÙÈ É DSN ÄÌÑ ÈÒÁÎÅÎÉÑ ÌÏÇÁ. ( × ÎÁÛÅÍ ÓÌÕÞÁÅ DSN ÂÕÄÅÔ
+ÎÁÚÙ×ÁÔØÓÑ "sqlite".) ÄÁÌÅÅ ×ÙÐÏÌÎÑÑ ÓËÒÉÐÔ log.sql ÓÏÚÄÁÅÍ ÎÅÏÂÈÏÄÉÍÙÅ
+ÔÁÂÌÉÃÙ É ÉÎÄÅËÓÙ:
+
+isqlodbc sqlite < log.sql
+
+ ûÁÇ ÎÁÓÔÒÏÊËÉ N2:
+õÓÔÁÎÁ×ÌÉ×ÁÅÍ DSN É ÆÏÒÍÁÔ ÔÁÂÌÉÃÙ Ó ÌÏÇÏÍ × ÆÁÊÌÅ 3proxy.cfg ÓÌÅÄÕÀÝÅÇÏ ×ÉÄÁ:
+-----------
+# create table log (
+# ldate date,
+# ltime time,
+# username char (30),
+# userip char (16),
+# bytein integer (10),
+# byteout integer (10),
+# service char (8),
+# host char(255),
+# hostport integer (10),
+# url char (255)
+# );
+
+log &sqlite
+logformat "Linsert into log values ('%Y-%m-%d','%H:%M:%S','%U','%C','%I','%O','%N','%n','%r','%T');"
+-----------
+
+ ûÁÇ ÎÁÓÔÒÏÊËÉ N3:
+ëÏÐÉÒÕÅÍ ÆÁÊÌÙ isqlodbc É stat.awk × ËÁÔÁÌÏÇ Ó CGI ÓËÒÉÐÔÁÍÉ http ÓÅÒ×ÅÒÁ
+É ÍÅÎÑÅÍ × stat.awk ÐÕÔØ ×ÙÚÏ×Á É DSN ÎÁ Ó×ÏÉ ÚÎÁÞÅÎÉÑ , ÎÁÐÒÉÍÅÒ:
+isql="./isqlodbc.exe sqlite "
+
+ ûÁÇ ÎÁÓÔÒÏÊËÉ N4:
+ðÒÏÂÕÅÍ ×ÙÚ×ÁÔØ ÓËÒÉÐÔ ÉÚ web ÂÒÁÕÚÅÒÁ , ÎÁÐÒÉÍÅÒ
+
+http://localhost/cgi/stat.awk?
+
+------------------------------ KOI8-R ------------------------------------
\ No newline at end of file
diff --git a/contrib/www3proxy/stat.awk b/contrib/www3proxy/stat.awk
new file mode 100644
index 0000000..b3d3eb2
--- /dev/null
+++ b/contrib/www3proxy/stat.awk
@@ -0,0 +1,129 @@
+#!/usr/bin/awk -f
+BEGIN {
+ scriptname = ENVIRON["SCRIPT_NAME"]
+ #for win32
+ isql=".\\isqlodbc.exe sqlite "
+
+ #for unix
+ #isql="./isqlodbc sqlite "
+
+
+ print "Content-Type: text/html; charset=koi8-r \n\n"
+ print "\n\n";
+
+ # query parse
+ query_str = ENVIRON["QUERY_STRING"]
+ n = split(query_str, querys, "&")
+ for (i=1; i<=n; i++)
+ {
+ split(querys[i], data, "=")
+ qr[data[1]] = data[2]
+ }
+
+ printf ""
+
+
+ #printf "query_str=%s\n
",query_str
+ #print qr["rep"]
+
+ if(qr["rep"]=="user")
+ {
+ cmd = isql " \"select " qr["userid"] ",sum(bytein),sum(byteout),sum(bytein+byteout) from log \
+ where ldate > '" qr["datefrom"] "' AND ldate < '" qr["dateto"] \
+ "' group by " qr["userid"] " order by sum(bytein+byteout) desc;\""
+ printf " user | bytein | byteout | bytesum |
"
+ while( (cmd|getline result)>0)
+ {
+ split(result, rt, "|")
+ printf " %s <\/a> | %d | %d | %d |
",
+ scriptname,qr["datefrom"],qr["dateto"],qr["userid"],rt[1],rt[1],rt[2],rt[3],rt[4]
+ totalbytein=totalbytein+rt[2];
+ totalbyteout=totalbyteout+rt[3];
+ totalbytesum=totalbytesum+rt[4];
+ }
+ printf " Total users | %d | %d | \
+ %d |
",totalbytein,totalbyteout, totalbytesum
+ close(cmd)
+ }
+
+
+ if(qr["rep"]=="host")
+ {
+ cmd = isql "\"select sum(bytein+byteout), sum(bytein), sum(byteout),host from log \
+ where ldate > '" qr["datefrom"] "' AND ldate < '"qr["dateto"] \
+ "' AND " qr["userid"] " = '" qr["selectid"] \
+ "' group by host order by sum(bytein+byteout) desc;\""
+
+ printf "Detail statistic for user: %s",qr["selectid"]
+ printf " sum byte | bytein | byteout | host |
"
+ while( (cmd|getline result)>0)
+ {
+ split(result, rt, "|")
+ printf "%d | %d | %d | %s |
",rt[1],rt[2],rt[3],rt[4]
+ totalbytein=totalbytein+rt[1];
+ totalbyteout=totalbyteout+rt[2];
+ totalbytesum=totalbytesum+rt[3];
+
+ }
+ printf " %d | %d | \
+ %d | Total host |
",totalbytein,totalbyteout, totalbytesum
+ printf " "
+ close(cmd)
+
+ }
+
+ printf " ";
+} # end BEGIN
+
+
+# decode urlencoded string
+function decode(text, hex, i, hextab, decoded, len, c, c1, c2, code) {
+
+ split("0 1 2 3 4 5 6 7 8 9 a b c d e f", hex, " ")
+ for (i=0; i<16; i++) hextab[hex[i+1]] = i
+
+ # urldecode function from Heiner Steven
+ # http://www.shelldorado.com/scripts/cmds/urldecode
+
+ # decode %xx to ASCII char
+ decoded = ""
+ i = 1
+ len = length(text)
+
+ while ( i <= len ) {
+ c = substr (text, i, 1)
+ if ( c == "%" )
+ {
+ if ( i+2 <= len )
+ {
+ c1 = tolower(substr(text, i+1, 1))
+ c2 = tolower(substr(text, i+2, 1))
+ if ( hextab [c1] != "" || hextab [c2] != "" ) {
+ if ( (c1 >= 2 && (c1 != 7 && c2 != "F")) || (c1 == 0 && c2 ~ "[9acd]") )
+ {
+ code = 0 + hextab [c1] * 16 + hextab [c2] + 0
+ c = sprintf ("%c", code)
+ }
+ else { c = " " }
+ i = i + 2
+ }
+ }
+ } else if ( c == "+" ) { # special handling: "+" means " "
+ c = " "
+ }
+ decoded = decoded c
+ ++i
+ }
+ # change linebreaks to \n
+ gsub(/\r\n/, "\n", decoded)
+ # remove last linebreak
+ sub(/[\n\r]*$/,"",decoded)
+ return decoded
+}
diff --git a/contrib/www3proxy/stat.pl b/contrib/www3proxy/stat.pl
new file mode 100644
index 0000000..87c6b7c
--- /dev/null
+++ b/contrib/www3proxy/stat.pl
@@ -0,0 +1,185 @@
+#!/usr/bin/perl
+eval 'exec /usr/bin/perl -S $0 ${1+"$@"}'
+ if $running_under_some_shell;
+ # this emulates #! processing on NIH machines.
+ # (remove #! line above if indigestible)
+
+eval '$'.$1.'$2;' while $ARGV[0] =~ /^([A-Za-z_0-9]+=)(.*)/ && shift;
+ # process any FOO=bar switches
+
+$[ = 1; # set array base to 1
+$, = ' '; # set output field separator
+$\ = "\n"; # set output record separator
+
+$scriptname = $ENVIRON{'SCRIPT_NAME'};
+#for win32
+$isql = ".\\isqlodbc.exe sqlite ";
+
+#for unix
+#isql="./isqlodbc sqlite "
+
+print "Content-Type: text/html; charset=koi8-r \n\n";
+print "\n\n";
+
+# query parse
+$query_str = $ENVIRON{'QUERY_STRING'};
+$n = (@querys = split(/&/, $query_str, 9999));
+for ($i = 1; $i <= $n; $i++) {
+ @data = split(/=/, $querys[$i], 9999);
+ $qr{$data[1]} = $data[2];
+}
+
+printf "';
+
+#printf "query_str=%s\n
",query_str
+#print qr["rep"]
+
+if ($qr{'rep'} eq 'user') {
+ $cmd = $isql . " \"select " . $qr{'userid'} .
+
+ ",sum(bytein),sum(byteout),sum(bytein+byteout) from log where ldate > '"
+
+ . $qr{'datefrom'} . "' AND ldate < '" . $qr{'dateto'} . "' group by " .
+
+ $qr{'userid'} . " order by sum(bytein+byteout) desc;\"";
+ printf
+
+ ' user | bytein | byteout | bytesum |
';
+ while ((($result = &Getline3($cmd, '|'),$getline_ok)) > 0) {
+ @rt = split(/\|/, $result, 9999);
+ printf
+
+ " %s <\\/a> | %d | %d | %d |
",
+
+
+ $scriptname, $qr{'datefrom'}, $qr{'dateto'}, $qr{'userid'}, $rt[1],
+
+ $rt[1], $rt[2], $rt[3], $rt[4];
+ $totalbytein = $totalbytein + $rt[2];
+ $totalbyteout = $totalbyteout + $rt[3];
+ $totalbytesum = $totalbytesum + $rt[4];
+ }
+ printf
+
+ ' Total users | %d | %d | %d |
',
+
+ $totalbytein, $totalbyteout, $totalbytesum;
+ delete $opened{$cmd} && close($cmd);
+}
+
+if ($qr{'rep'} eq 'host') {
+ $cmd = $isql .
+
+ "\"select sum(bytein+byteout), sum(bytein), sum(byteout),host from log where ldate > '"
+
+ . $qr{'datefrom'} . "' AND ldate < '" . $qr{'dateto'} . "' AND " .
+
+ $qr{'userid'} . " = '" . $qr{'selectid'} .
+
+ "' group by host order by sum(bytein+byteout) desc;\"";
+
+ printf 'Detail statistic for user: %s',
+
+ $qr{'selectid'};
+ printf
+
+ ' sum byte | bytein | byteout | host |
';
+ while ((($result = &Getline3($cmd, '|'),$getline_ok)) > 0) {
+ @rt = split(/\|/, $result, 9999);
+ printf '%d | %d | %d | %s |
',
+
+ $rt[1], $rt[2], $rt[3], $rt[4];
+ $totalbytein = $totalbytein + $rt[1];
+ $totalbyteout = $totalbyteout + $rt[2];
+ $totalbytesum = $totalbytesum + $rt[3];
+ }
+ printf
+
+ ' %d | %d | %d | Total host |
',
+
+ $totalbytein, $totalbyteout, $totalbytesum;
+ printf ' ';
+ delete $opened{$cmd} && close($cmd);
+}
+
+printf ' ';
+
+# end BEGIN
+
+# decode urlencoded string
+
+sub decode {
+ local($text, *Hex, $i, *hextab, $decoded, $len, $c, $c1, $c2, $code) = @_;
+ @Hex = split(' ', '0 1 2 3 4 5 6 7 8 9 a b c d e f', 9999);
+ for ($i = 0; $i < 16; $i++) {
+ $hextab{$Hex[$i + 1]} = $i;
+
+ # urldecode function from Heiner Steven
+ # http://www.shelldorado.com/scripts/cmds/urldecode
+
+ # decode %xx to ASCII char
+ ;
+ }
+ $decoded = '';
+ $i = 1;
+ $len = length($text);
+
+ while ($i <= $len) { #???
+ $c = substr($text, $i, 1);
+ if ($c eq '%') {
+ if ($i + 2 <= $len) {
+ $c1 = &tolower(substr($text, $i + 1, 1));
+ $c2 = &tolower(substr($text, $i + 2, 1));
+ if ($hextab{$c1} ne '' || $hextab{$c2} ne '') {
+ if (($c1 >= 2 && ($c1 != 7 && $c2 ne 'F')) ||
+
+ ($c1 == 0 && $c2 =~ '[9acd]')) {
+ $code = 0 + $hextab{$c1} * 16 + $hextab{$c2} + 0;
+ $c = sprintf('%c', $code);
+ }
+ else {
+ $c = ' ';
+ }
+ $i = $i + 2;
+ }
+ }
+ }
+ elsif ($c eq '+') {
+ # special handling: "+" means " "
+ $c = ' ';
+ }
+ $decoded = $decoded . $c;
+ ++$i;
+ }
+ # change linebreaks to \n
+ $decoded =~ s/\r\n/\n/g;
+ # remove last linebreak
+ $decoded =~ s/[\n\r]*$//;
+ $decoded;
+}
+
+sub Getline3 {
+ &Pick('',@_);
+ local($_);
+ if ($getline_ok = (($_ = <$fh>) ne '')) {
+ ;
+ }
+ $_;
+}
+
+sub Pick {
+ local($mode,$name,$pipe) = @_;
+ $fh = $name;
+ open($name,$mode.$name.$pipe) unless $opened{$name}++;
+}
diff --git a/copying b/copying
new file mode 100644
index 0000000..6cf2b65
--- /dev/null
+++ b/copying
@@ -0,0 +1,62 @@
+3proxy 0.7 Public License Agreement
+
+(c) 2000-2014 by 3APA3A (3APA3A@security.nnov.ru)
+(c) 2000-2014 by SecurityVulns.com (http://3proxy.ru/)
+(c) 2000-2014 by Vladimir Dubrovin (vlad@sandy.ru)
+
+This software uses:
+ RSA Data Security, Inc. MD4 Message-Digest Algorithm
+ RSA Data Security, Inc. MD5 Message-Digest Algorithm
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+
+This software is FREEWARE.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that following conditions
+are met (BSD style license):
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+ * 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.
+ * Neither the name of the SecurityVulns.COM nor the names of its
+ contributors may be used to endorse or promote products derived from this
+ software without specific prior written permission.
+
+
+Instead of this license, you can also use and redistribute this software under
+terms of compatible license, including:
+
+1. Apache License, Version 2.0
+ You may obtain a copy of the License at
+
+ http://www.apache.org/licenses/LICENSE-2.0
+
+2. GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+ You may obtain a copy of the License at
+
+ http://www.gnu.org/licenses/gpl.txt
+
+3. GNU Lesser General Public License as published by the
+ Free Software Foundation; either version 2.1 of the License, or
+ (at your option) any later version.
+ You may obtain a copy of the License at
+
+ http://www.gnu.org/licenses/lgpl.txt
+
+
+$Id: License,v 1.3 2007/04/05 11:59:47 vlad Exp $
diff --git a/doc/html/faqe.html b/doc/html/faqe.html
new file mode 100644
index 0000000..a4ea57c
--- /dev/null
+++ b/doc/html/faqe.html
@@ -0,0 +1,158 @@
+Why ... doesn't work?
+
+Q: Why does nothing work?
+A: Valid configuration file is required.
+
+Q: Why restrictions (redirections, limits, etc) do not work?
+A: Most probable reasons: 'auth none' or no auth is used. For any ACL based feature one of 'iponly', 'nbname' or 'strong' auths required. Sequence of commands may be invalid. Commands are executed one-by-one and 'proxy', 'tcppm', 'socks' or another service commands must follow valid configuration. Invalid sequence of ACLs. First matching ACL is used (except of internal redirections, see below). If ACL contains at least one records last record is assumed to be 'deny *'.
+
+Q: Why doesn't 3proxy work as service under Windows?
+Possible reasons:
+
+
+Q: Why doesn't internal and external commands work as expected
+A: Check your expectations first.
+Both internal and external IPs are IPs of the host running 3proxy itself.
+This configuration option is usefull in situation 3proxy is running on the
+border host with 2 (or more) connections: e.g. LAN and WAN with different IPs
+
+ LAN connection +-------------+ Internet connection
+LAN <-------------->| 3proxy host |<-------------------> INTERNET
+ ^+-------------+^
+ | |
+ Internal IP External IP
+
+If 3proxy is used on the host with single connection, both internal and
+external are usually same IP.
+
Internal should exist and be UP on the moment 3proxy is started and
+should never be disconnected/DOWN. If this interface is periodically
+disconnected (e.g. direct link between 2 hosts), do not specify internal
+address or use 0.0.0.0 instead. In this case, if you have 2 or more
+interfaces you must use firewall (preferably) or 3proxy ACLs to avoid open
+proxy situation.
+
+External IP (if specified) must exist in the momet 3proxy
+serves client request. If external interface is no specified (or 0.0.0.0),
+system select external IP. It may be possible to access resources of internal
+network, to prevent this use ACLs. In addition, SOCKSv5 will not support BIND
+operation, required for incoming connections (this operation is quite rarely
+implemented in SOCKSv5 clients and usually is not required). In case of
+dynamic address, do not specify external or use external 0.0.0.0 or, if
+external address is required, create a script to determine current external
+IP and save it to file, and use external "$path_to_file" with "monitor" command
+to automatically reload configuration on address change.
+
+Q: Why doesn't ODBC loggind work?
+A: Check you use system DSN.
+Check SQL request is valid.
+The best way to check is to make file or stdout logging, get SQL request from log file or console and execute this request manually.
+
+Q: Why doesn't APOP/CRAM-MD5 authentication work with POP3 proxy?
+A: Any Challenge-response authentication require challenge to be transmitted from server. Pop3p doesn't know which server to use before authentication, it makes it impossible to obtain challenge. You can encrypt your POP3 communications with TLS (i.e. stunnel) or IPSec.
+
+Redirection to local proxy
+
+Q: What is it for?
+A: To have control based on request and to have URLs and another protocol specific parameters to be logged.
+
+Q: What are restrictions?
+A: It's hard to redirect services for non-default ports; Internet Explorer supports only SOCKSv4 with no password authentication (Internet Explorer sends username, but not password), for SOCKSv5 only cleartext password authentication is supported.
+
+Q: What are advantages?
+A: You need only to setup SOCKS proxy in browser settings. You can use socksifier, i.e. FreeCAP or SocksCAP with application which is not proxy aware.
+
+Q: How to setup?
+A: You should specify parent proxy with IP of 0.0.0.0 and port 0. Examples:
+
+auth iponly
+allow * * * 80,8080-8088
+parent 1000 http 0.0.0.0 0
+allow * * * 80,8080-8088
+#redirect ports 80 and 8080-8088 to local HTTP proxy
+#Second allow is required, because ACLs are checked
+#twice: first time by socks and second by http proxy.
+
+allow * * * 21,2121
+parent 1000 ftp 0.0.0.0 0
+allow * * * 21,2121
+#redirect ports 21 and 2121 to local
+#ftp proxy
+
+
+allow *
+#allow rest of connections directly
+
+socks
+#now let socks server to start
+
+
+Q: How it affects different ACL rules?
+A: After local redirections rules are applied again to protocol-level request. Redirection rule itself is skipped. It makes it possible to redirect request again on the external proxy depending on request itself.
+
+allow * * * 80,8080-8088
+parent 1000 http 0.0.0.0 0
+#redirect http traffic to internal proxy
+
+allow * * $c:\3proxy\local.nets 80,8080-8088
+#allow direct access to local.nets networks
+allow * * * 80,8080-8088
+parent 1000 http proxy.sandy.ru 3128
+#use parent caching proxy for rest of the networks
+
+allow *
+#allow direct connections for rest of socks
+#requests
+
+
+Can I ...?
+
+Q: Is it possible to resolve names through parent proxy?
+A: Yes, use 'proxy', 'connect+', 'socks4+' or 'socks5+' as parent proxy type.
+3proxy itself requires name resolutions for ACL checks, so, if it's impossible
+to resolve names from 3proxy host, use
+
+fakeresolve
+
+command. Fakeresolve resolves any name to 127.0.0.2.
+
+
+Q: Can I use 3proxy as FTP proxy?
+A: There are two kinds of FTP proxy supported: FTP over HTTP support (known as FTP proxy inside Internet Explorer, Mozilla and another browsers) and real FTP proxy (usable in Far and different FTP clients). Both are supported in 3proxy: first one as a part of HTTP 'proxy' and second one as 'ftppr'.
+
+Q: Can I bind any 3proxy service to non-default port?
+A: proxy -p8080
+
+Why so ...?
+
+Q: Why traffic accounting is incomplete? It differs for what my provider (or another accounting application) shows to me?
+A: 3proxy accounts protocol level traffic. Provider counts channel or IP-level traffic with network and transport headers. In additions, 3proxy doesn't counts DNS resolutions, pings, floods, scans, etc. It makes approx. 10% of difference. That's why you should have 15% reserve if you use 3proxy to limit your traffic. If difference with your provider is significantly above 10% you should look for traffic avoiding proxy server, for example connections through NAT, traffic originated from the host with proxy installed, traffic from server applications, etc.
+
+Q: Why configuration is so difficult and non-intuitive?
+A: Configuration format is created in a way it's easy to parse and matches to internal 3proxy structures. In addition, there are some older things left for compatibility to be cleaned in 3proxy release. And last, I think it's easy and intuitive.
+
+Q: Why the code is so difficult and non-intuitive?
+A: First, I'm not programmer. Second, 3proxy was 'proof of concept' in reply for some conference post. Request was to write proxy server in 100 lines of code. First version of 3proxy had less, with HTTP and SOCKS support and portmappers. Third, there are peoples who want to use 3proxy code in trojans. I don't want to help them. Fourth, the aim is to support different platforms. It's well known - the worse code is, the better it compiles.
+
+Q: Why do you use insecure strcpy, sprintf, etc?
+A: Why not? I try to use insecure function in secure manner. You're welcome to look for vulnerabilities.
+
+$Id: faqe.html,v 1.10 2007/07/31 08:42:38 vlad Exp $
+
\ No newline at end of file
diff --git a/doc/html/faqr.html b/doc/html/faqr.html
new file mode 100644
index 0000000..0e85252
--- /dev/null
+++ b/doc/html/faqr.html
@@ -0,0 +1,283 @@
+
+3APA3A 3proxy tiny proxy server Frequently Asked Questions (FAQ)
+
+
+Ïî÷åìó íå ðàáîòàåò...
+
+ - Q: Ïî÷åìó íè÷åãî íå ðàáîòàåò?
+
+ A: Ïîòîìó ÷òî äëÿ ðàáîòû íóæåí ïðàâèëüíûé ôàéë êîíôèãóðàöèè.
+
+ - Q: Ïî÷åìó íå ðàáîòàþò îãðàíè÷åíèÿ äîñòóïà (ïåðåíàïðàâëåíèÿ, îãðàíè÷åíèÿ ïî ñêîðîñòè,
+ òðàôèêó è ò.ä.)?
+
+ A: Îáû÷íûå îøèáêè - èñïîëüçîâàíèå auth none (äëÿ ðàáîòû ëþáûõ
+ ôóíêöèé, îñíîâàííûõ íà ACL, òðåáóåòñÿ auth iponly, nbname èëè strong),
+ íàðóøåíèå ïîðÿäêà ââîäà êîìàíä (êîìàíäû âûïîëíÿþòñÿ ïîñëåäîâàòåëüíî,
+ çàïóñê ñåðâèñà proxy, socks, tcppm è ò.ä. äîëæåí îñóùåñòâëÿòüñÿ ïîñëå
+ òîãî, êàê óêàçàíà åãî êîíôèãóðàöèÿ), íåïðàâèëüíûé ïîðÿäîê çàïèñåé â ACL
+ (çàïèñè ïðîñìàòðèâàþòñÿ ïîñëåäîâàòåëüíî äî ïåðâîé, óäîâëåòâîðÿþùåé
+ êðèòåðèÿì). Åñëè â ACL èìååòñÿ õîòÿ áû îäíà çàïèñü, òî ñ÷èòàåòñÿ, ÷òî
+ ïîñëåäíÿÿ çàïèñü â ACL - ýòî íåÿâíàÿ deny *.
+
+ - Q: Ïî÷åìó 3proxy íå çàïóñêàåòñÿ êàê ñëóæáà?
+
+ A: Íàèáîëåå âåðîÿòíûå ïðè÷èíû:
+
+
+ Q: Ïî÷åìó íå ïîëó÷àåòñÿ óêàçàòü internal è external?
+
+ A: Óáåäèòåñü, ÷òî âûïðàâèëüíî ïîíèìàåòå ÷òî òàêîå internal è external àäðåñà.
+ Îáà àäðåñà - ýòî àäðåñà, ïðèíàäëåæèùèå õîñòó, íà êîòîðîì óñòàíîâëåí 3proxy.
+ Ýòà îïöèÿ êîíôèãóðàöèè íåîáõîäèìà â êëàññè÷åñêîé ñèòóàöèè, êîãäà 3proxy
+ óñòàíîâëåí íà ãðàíè÷íîì êîìïüþòåðå ñ äâóìÿ (èëè áîëåå) ïîäêëþ÷åíèÿìè:
+
+ LAN connection +-------------+ Internet connection
+ LAN <-------------->| 3proxy host |<-------------------> INTERNET
+ ^+-------------+^
+ | |
+ Internal IP External IP
+ Åñëè 3proxy ðàáîòàåò íà õîñòå ñ îäíèì èíòåðôåéñîì, òî åãî àäðåñ áóäåò è
+ internal è external.
+
Èíòåðôåéñ ñ àäðåñîì internal äîëæåí ñóùåñòâîâàòü è áûòü ðàáî÷èì íà ìîìåíò
+ çàïóñêà 3proxy, è íå äîëæåí îòêëþ÷àòüñÿ. Åñëè internal èíòåðôåéñ
+ ïåðèîäè÷åñêè îòêëþ÷àåòñÿ, òî íå ñëåäóåò åãî óêàçûâàòü, èëè ìîæíî óêàçàòü àäðåñ
+ 0.0.0.0. Ïðè ýòîì ïðîêñè áóäåò ïðèíèìàòü çàïðîñû íà âñåõ èíòåðôåéñàõ, ïîýòîìó
+ ïðè íàëè÷èè íåñêîëüêèõ èíòåðôåéñîâ äëÿ îãðàíè÷åíèÿ äîñòóïà ñëåäóåò èñïîëüçîâàòü
+ ôàåðâîë èëè õîòÿ áû ACL.
+
+
+ Èíòåðôåéñ ñ àäðåñîì external, åñëè îí óêàçàí, äîëæåí áûòü ðàáî÷èì íà ìîìåíò
+ ïîëó÷åíèÿ çàïðîñà êëèåíòà. Ïðè îòñóòñòâèè external èëè àäðåñå 0.0.0.0 âíåøíèé
+ àäðåñ áóäåò âûáèðàòüñÿ ñèñòåìîé ïðè óñòàíîâêå ñîåäèíåíèÿ. Ïðè ýòîì, ìîæåò áûòü
+ âîçìîæíîñòü äîñòóïà ÷åðåç ïðîêñè ê ðåñóðñàì ëîêàëüíîé ñåòè, ïîýòîìó äëÿ
+ ïðåäîòâðàùåíèÿ íåñàíêöèîíèðîâàííîãî äîñòóïà ñëåäóåò èñïîëüçîâàòü ACL. Êðîìå
+ òîãî, ìîãóò áûòü ïðîáëåìû ñ ïðèåìîì âõîäÿùèõ ñîåäèíåíèé ÷åðåç SOCKSv5
+ (SOCKSv5 èñïîëüçóåòñÿ â êëèåíòàõ èñêëþ÷èòåëüíî ðåäêî).
+  ñëó÷àå, åñëè àäðåñ äèíàìè÷åñêèé, ìîæíî ëèáî íå
+ óêàçûâàòü external, ëèáî èñïîëüçîâàòü àäðåñ 0.0.0.0, ëèáî, åñëè íåîáõîäèìà
+ ïîääåðæêà âõîäÿùèõ ñîåäèíåíèé â SOCKSv5, èñïîëüçîâàòü ñêðèïò,
+ êîòîðûé áóäåò ïîëó÷àòü òåêóùèé àäðåñ è ñîõðàíÿòü åãî â ôàéë, êîòîðûé áóäåò
+ îòñëóæèâàòüñÿ ÷åðåç êîìàíäó monitor.
+
+ Q: Ïî÷åìó íå ðàáîòàåò âåäåíèå æóðíàëîâ â ODBC?
+
+ A: Óáåäèòåñü, ÷òî èñïîëüçóåòñÿ ñèñòåìíûé, à íå
+ ïîëüçîâàòåëüñêèé DSN. Óáåäèòåñü, ÷òî âûïîëíÿåòñÿ ïðàâèëüíûé SQL çàïðîñ. Íàèáîëåå
+ ðàñïðîñòðàíåííàÿ ïðîáëåìà ñâÿçàíà ñ îòñóòñòâèåì êàâû÷åê èëè íåïðàâèëüíûì
+ ôîðìàòîì äàííûõ. Ñàìûé ïðîñòîé ñïîñîá - ñäåëàòü âåäåíèå æóðíàëà â ôàéë èëè
+ íà ñòàíäàðòíûé âûâîä, ïðîñìîòðåòü âûäàâàåìûå SQL çàïðîñû è ïîïðîáîâàòü
+ äàòü òàêîé çàïðîñ âðó÷íóþ.
+
+ Q: Ïî÷åìó íå ïîääåðæèâàþòñÿ APOP è CRAM-MD5 â POP3 ïðîêñè?
+
+ A: Ëþáàÿ challenge-response àóòåíòèôèêàöèÿ, ê êîòîðûì îòíîñÿòñÿ APOP
+ è CRAM-MD5, òðåáóåò, ÷òîáû ñî ñòîðîíû ñåðâåðà áûë ïåðåäàí óíèêàëüíûé challenge.
+ Äî íà÷àëà àóòåíòèôèêàöèè POP3 ïðîêñè íå çíàåò, ê êàêîìó ñåðâåðó ñëåäóåò
+ ïîäêëþ÷àòüñÿ äëÿ ïîëó÷åíèÿ Challenge, ïîýòîìó challenge-response â ïðèíöèïå
+ íåâîçìîæåí. Çàùèòèòü ñîåäèíåíèå ìîæíî ñ ïîìîùüþ TLS (íàïðèìåð, stunnel) èëè
+ IPSec.
+
+
+
+Ïåðåíàïðàâëåíèå socks ñîåäèíåíèé â ëîêàëüíûé ïðîêñè
+
+ - Q: Äëÿ ÷åãî ýòî íàäî?
+
+ A: ×òîáû èìåòü â ëîãàõ URL çàïðîñîâ, åñëè ïîëüçîâàòåëü SOCKS ïîëüçóåòñÿ
+ Web, FTP èëè POP3.
+
+ - Q: Êàêèå íåäîñòàòêè?
+
+ A: Ïåðåíàïðàëåíèå íåâîçìîæíî äëÿ web-ñåðâåðîâ èëè FTP, âèñÿùèõ íà
+ íåñòàíäàðòíûõ ïîðòàõ, äëÿ SOCKSv4 íå ïîääðæèâàåòñÿ àâòîðèçàöèÿ ñ
+ ïàðîëåì (IE ïîääåðæèâàåò òîëüêî SOCKSv4), íî ïðè ýòîì IE ïåðåäàåò
+ èìÿ ïîëüçîâàòåëÿ ïî SOCKSv4 (èìÿ, ñ êîòîðûì ïîëüçîâàòåëü âîøåë â ñèñòåìó).
+ Äëÿ SOCKSv5 íå ïîääåðæèâàåòñÿ NTLM àâòîðèçàöèÿ, ïàðîëè ïåðåäàþòñÿ â îòêðûòîì
+ òåêñòå.
+
+ - Q: Êàêèå ïðåèìóùåñòâà?
+
+ A: Äîñòàòî÷íî â íàñòðîéêàõ IE òîëüêî óêàçàòü àäðåñ SOCKS ïðîêñè. Â
+ áîëüøèõ ñåòÿõ ìîæíî äëÿ ýòîãî èñïîëüçîâàòü WPAD (àâòîìàòè÷åñêîå
+ îáíàðóæåíèå ïðîêñè).  3proxy äîñòàòî÷íî çàïóñêàòü òîëüêî îäíó ñëóæáó
+ (socks). Åñëè èñïîëüçóåòñÿ òîëüêî Internet Explorer, òî ìîæíî
+ àâòîìàòè÷åñêè ïîëó÷àòü èìÿ ïîëüçîâàòåëÿ â ëîãàõ, íå çàïðàøèâàÿ
+ ëîãèí/ïàðîëü.
+
+ - Q: Êàê íàñòðàèâàåòñÿ?
+
+ A: Óêàçûâàåòñÿ parent http proxy ñî ñïåöèàëüíûì àäðåñîì 0.0.0.0 è ïîðòîì
+ 0. Ïðèìåð:
+
+ allow * * * 80,8080-8088
+ parent 1000 http 0.0.0.0 0
+ allow * * * 80,8080-8088
+ #ïåðåíàïðàâèòü ñîåäèíåíèÿ ïî ïîðòàì 80 è 8080-8088 â ëîêàëüíûé
+ #http ïðîêñè. Âòîðàÿ êîìàíäà allow íåîáõîäèìà, ò.ê. êîíòðîëü äîñòóïà
+ #îñóùåñòâëÿåòñÿ 2 ðàçà - íà óðîâíå socks è íà óðîâíå HTTP ïðîêñè
+ allow * * * 21,2121
+ parent 1000 ftp 0.0.0.0 0
+ allow * * * 21,2121
+ #ïåðåíàïðàâèòü ñîåäèíåíèÿ ïî ïîðòàì 21 è 2121 â ëîêàëüíûé
+ #ftp ïðîêñè
+ allow *
+ #ïóñòèòü âñå ñîåäèíåíèÿ íàïðÿìóþ
+ socks
+
+ Q: Êàê âçàèìîäåéñòâóåò ñ äðóãèìè ïðàâèëàìè â ACL?
+
+ A: Ïîñëå âíóòðåííåãî ïåðåíàïðàâëåíèÿ ïðàâèëà ðàññìàòðèâàþòñÿ åùå ðàç çà
+ èñêëþ÷åíèåì ñàìîãî ïðàâèëà ñ ïåðåíàïðàâëåíèåì (ò.å. îáðàáîòêà ïðàâèë íå
+ ïðåêðàùàåòñÿ). Ýòî ïîçâîëÿåò ñäåëàòü äàëüíåéøèå ïåðåíàïðàâëåíèÿ íà
+ âíåøíèé ïðîêñè. Ïî ýòîé æå ïðè÷èíå ëîêàëüíîå ïåðåíàïðàâëåíèå íå äîëæíî
+ áûòü ïîñëåäíèì ïðàâèëîì (ò.å. äîëæíî áûòü åùå õîòÿ áû ïðàâèëî allow,
+ ÷òîáû ðàçðåøèòü âíåøíèå ñîåäèíåíèÿ ÷åðåç HTTP ïðîêñè).
+ Íàïðèìåð,
+
+ allow * * * 80,8080-8088
+ parent 1000 http 0.0.0.0 0
+ #ïåðåíàïðàâèòü âî âíóòðåííèé ïðîêñè
+ allow * * $c:\3proxy\local.nets 80,8080-8088
+ #ðàçðåøèòü ïðÿìîé web-äîñòóï ê ñåòÿì èç local.nets
+ allow * * * 80,8080-8088
+ parent 1000 http proxy.sandy.ru 3128
+ #âñå îñòàëüíûå âåá-çàïðîñû ïåðåíàïðàâèòü íà âíåøíèé ïðîêñè-ñåðâåð
+ allow *
+ #ðàçðåøèòü socks-çàïðîñû ïî äðóãèì ïîðòàì
+
+
+
+À åñòü ëè...
+
+ - Q: Ìîæíî ëè ðàçðåøàòü èìåíà íà ðîäèòåëüñêîì ïðîêñè?
+
+ A: Ìîæíî. Äëÿ ýòîãî íàäî èñïîëüçîâàòü òèï ðîäèòåëüñêîãî ïðîêñè http,
+ connect+, socks4+ è socks5+. Îäíàêî, ïðè ýòî íàäî ïîìíèòü, ÷òî ñàìîìó 3proxy
+ òðåáóåòñÿ ðàçðåøåíèå èìåíè äëÿ óïðàâëåíèÿ ACL. Ïîýòîìó, åñëè ñ ïðîêñè-õîñòà
+ íå ðàáîòàþò ðàçðåøåíèÿ èìåíè, íåîáõîäèìî â êîíôèãóðàöèè äàòü êîìàíäó
+
+ fakeresolve
+ êîòîðàÿ ðàçðåøàåò ëþáîå èìÿ â àäðåñ 127.0.0.2.
+
+ Q: Ñóùåñòâóåò ëè ñåé÷àñ ïîääåðæêà FTP ïðîêñè â ïðîäóêòå?
+
+ Åñòü ïîääåðæêà êàê FTP ÷åðåç HTTP (òî, ÷òî íàçûâàåòñÿ FTP ïðîêñè â Internet
+ Explorer, Netscape, Opera) òàê è íàñòîÿùåãî FTP ïðîêñè (òî, ÷òî íàçûâàåòñÿ
+ FTP proxy â FAR è FTP êëèåíòàõ).
+
+ Q: Êàêèì îáðàçîì ìîæíî ïðèáèíäèòü ñåðâèñû íà ñâîé ïîðò, ê ïðèìåðó, HTTP ïðîêñè ê 8080, à íå 3128 êàê ïî-óìîë÷àíèþ?
+
+ À:
+
+ proxy -p8080
+
+ Q: Êàê îãðàíè÷èòü øèðèíó êàíàëà?
+
+ A: ×èòàéòå HowTo http://3proxy.ru/howtor.asp#BANDLIM
+
+
+
+Ïî÷åìó òàê êðèâî...
+
+ - Q: Ïî÷åìó òàê êðèâî ñ÷èòàåòñÿ òðàôèê? Íå ñîâïàäàåò ñ ...
+
+ A: Ñëåäóåò ó÷èòûâàòü, ÷òî 3proxy ñ÷èòàåò òðàôèê òîëüêî íà ïðèêëàäíîì óðîâíå è
+ òîëüêî ïðîõîäÿùèé ÷åðåç ïðîêñè-ñåðâåð. Ïðîâàéäåðû è äðóãèå ñðåäñòâà ó÷åòà
+ òðàôèêà ñ÷èòàþò òðàôèê íà ñåòåâîì óðîâíå, ÷òî óæå äàåò ðàñõîæäåíèå ïîðÿäêà 10%
+ çà ñ÷åò èíôîðìàöèè èç çàãîëîâêîâ ïàêåòîâ. Êðîìå òîãî, ÷àñòü òðàôèêà, êàê
+ ìèíèìóì DNS-ðàçðåøåíèÿ, ðàçëè÷íûé ôëóäîâûé òðàôèê è ò.ä. èäóò ìèìî ïðîêñè.
+ Óðîâåíü "øóìîâîãî" òðàôèêà â Internet ñåé÷àñ ñîñòàâëÿåò ïîðÿäêà 50KB/äåíü íà
+ êàæäûé ðåàëüíûé IP àäðåñ, íî ìîæåò ñèëüíî âàðüèðîâàòüñÿ â çàâèñèìîñòè îò ñåòè,
+ íàëè÷èÿ îòêðûòûõ ïîðòîâ, ðåàêöèè íà ping-çàïðîñû è òåêóùåãî óðîâíÿ âèðóñíîé
+ àêòèâíîñòè. Ïî ýòèì ïðè÷èíàì, åñëè 3proxy èñïîëüçóåòñÿ ÷òîáû íå "âûæðàòü"
+ òðàôèê, âûäåëåííûé ïðîâàéäåðîì, âñåãäà ñëåäóåò äåëàòü íåêèé çàïàñ ïîðÿäêà
+ 15%.
+
+
+ Åñëè íà îäíîé ñ 3proxy ìàøèíå èìåþòñÿ êàêèå-ëèáî ñåðâèñû èëè
+ ðàáîòàåò ïîëüçîâàòåëü, òî èõ òðàôèê íå ïðîõîäèò ÷åðåç proxy-ñåðâåð è òàê æå
+ íå áóäåò ó÷òåí. Åñëè ãäå-òî åñòü NAT, òî êëèåíòû, âûõîäÿùèå ÷åðåç NAT ìèìî
+ ïðîêñè, òàê æå îñòàíóòñÿ íåó÷òåííûìè. Åñëè ðàñõîæäåíèå ñ ïðîâàéäåðîì ïðåâûøàåò
+ 10% - íóæíî èñêàòü ïðè÷èíó èìåííî â ýòîì.
+
+ - Q: Ïî÷åìó òàêàÿ êðèâàÿ êîíôèãóðàöèÿ è íè÷åðòà íå ïîíÿòíî?
+
+ A: Åñòü íåñêîëüêî ïðè÷èí. Âî-ïåðâûõ, äî âûõîäà ðåëèçà (ò.å. âåðñèè 1.0) ÿ áóäó èçî
+ âñåõ ñèë äîáèâàòüñÿ ñîâìåñòèìîñòè êîíôèãóðàöèè ìåæäó âåðñèÿìè. Âî-âòîðûõ,
+ êîíôèãóðàöèÿ ñäåëàíà òàê, ÷òîáû åå ìîæíî áûëî ëåãêî ðàçáèðàòü ïðîãðàììíî.
+ Â-òðåòüèõ, âñå òàì ïîíÿòíî. Ïðè æåëàíèè. Åñëè çíàòü êàê âñå ðàáîòàåò.
+
+ - Q: Ïî÷åìó òàê êðèâî íàïèñàí êîä?
+
+ A: Åñòü íåñêîëüêî ïðè÷èí. Âî-ïåðâûõ, ÿ íå ïðîãðàììèñò. Âî-âòîðûõ, 3proxy èçíà÷àëüíî
+ ïèñàëñÿ íà êîëåíêå (â îòåò íà "ñëàáî" â îäíîé èç êîíôåðåíöèé). Íèêòî
+ íå ìîã ïðåäïîëîæèòü, ÷òî èì êòî-òî ðåàëüíî áóäåò ïîëüçîâàòüñÿ. Â-òðåòüèõ, ó ìíîãèõ
+ âîçíèêàåò æåëàíèå ðàçîáðàòüñÿ â êîäå 3proxy ÷òîáû âíåäðèòü åãî â êàêîé-íèáóäü
+ òðîÿí. Î÷åíü íå õî÷åòñÿ îáëåã÷àòü ýòó çàäà÷ó. Â-÷åòâåðòûõ, ìíå íàäî äîáèòüñÿ
+ êîìïèëÿöèè êîäà â êàê ìîæíî áîëüøåì ÷èñëå ñèñòåì. Çàìå÷åíî, ÷òî ÷åì êðèâåå êîä â
+ C, òåì îí ëó÷øå ïåðåíîñèòñÿ.
+
+ - Q: Ïî÷åìó òàê ìíîãî strcpy, sprintf è ò.ä., ýòî æ äûðû!
-
+
+ A: Åñòü íåñêîëüêî ïðè÷èí. Âî-ïåðâûõ, íåñìîòðÿ íà äóðíîé òîí èñïîëüçîâàíèÿ ýòèõ
+ ôóíêöèé, îíè íàèáîëåå ñîâìåñòèìû ìåæäó ðàçíûìè ñèñòåìàìè è êîìïèëÿòîðàìè.
+ Âî-âòîðûõ, ñàìî ïî ñåáå èõ èñïîëüçîâàíèå íå îçíà÷àåò ïðèñóòñòâèå äûðû, åñëè èõ
+ ïàðàìåòðû äîëæíûì îáðàçîì êîíòðîëèðóþòñÿ. Íàéäåòå äûðó - îáÿçàòåëüíî ñîîáùèòå.
+  òðåòüèõ, ìîæåò áûòü ÿ óáåðó èõ ïåðåä êîíå÷íûì ðåëèçîì, ÷òîáû íèêîãî íå
+ ïóãàòü.
+
+
+
+$Id: faqr.html,v 1.28 2007/09/25 09:47:13 vlad Exp $
+
\ No newline at end of file
diff --git a/doc/html/howtoe.html b/doc/html/howtoe.html
new file mode 100644
index 0000000..a8a0d33
--- /dev/null
+++ b/doc/html/howtoe.html
@@ -0,0 +1,835 @@
+
+
+ Proxy server installation and removal
+
+
+ - How to install/remove 3proxy under Windows NT/2000/XP
+
+Unpack 3proxy.zip to any directory, for example
+c:\Program Files\3proxy. If needed, create directory for storing log files,
+ODBC sources, etc. Create 3proxy.cfg in the 3proxy installation directory (See Server configuration).
+If you use 3proxy before 0.6 Add
+
+service
+
+string into 3proxy.cfg. Now, start command prompt (cmd.exe).
+Change directory to 3proxy installation and run 3proxy.exe --install:
+
+D:\>C:
+C:\>cd C:\Program Files\3proxy
+C:\Program Files\3proxy>3proxy.exe --install
+
+Now, you should have 3proxy service installed and running. If service is not
+started, remove "service" string from 3proxy.cfg, run 3proxy.exe manually
+and correct all errors.
+
+To remove 3proxy run 3proxy --remove:
+
+D:\>C:
+C:\>cd C:\Program Files\3proxy
+C:\Program Files\3proxy>net stop 3proxy
+C:\Program Files\3proxy>3proxy.exe --remove
+
+Now you can simply remove 3proxy installation directory.
+
+ - How to install/remove 3proxy under Windows 95/98/ME
+
+Unpack 3proxy.zip to any directory, for example
+c:\Program Files\3proxy. If needed, create directory for storing log files,
+ODBC sources, etc. Create 3proxy.cfg in the 3proxy installation directory (See Server configuration).
+Remove string
+
+service
+
+from 3proxy.cfg and add
+
+daemon
+
+if you want 3proxy to run in background.
+Create shortcut for 3proxy.exe and place it in autostart or add
+to registry with regedit.exe:
+
HKLM\Software\Microsoft\Windows\CurrentVersion\Run
+Type: String
+
3proxy = "c:\Program Files\3proxy.exe" "C:\Program Files\3proxy.cfg"
+You must use quotes if path contains space. If neccessary, restart Windows.
+If service is not started, check log. Remove "daemon" command from 3proxy.cfg,
+start 3proxy.exe manually and correct all errors.
+
+ - How to install/remove 3proxy under Unix/Linux
+
+Complie 3proxy (see Compilation). Copy
+executables to any appropriate location (for example /usr/local/3proxy/sbin
+for servers and /usr/local/3proxy/bin for utilities).
+Create /usr/local/etc/3proxy.cfg.
+(see Server configuration).
+You can change default configuration file location by specifing configuration file
+in 3proxy command line.
+Add 3proxy to system startup scripts.
+
+
+
+ Server configuration
+
+
+ - Where to find configuration example
+
+Server configuration example 3proxy.cfg.sample is in any 3proxy distribution.
+
+ - How to set up logging
+
+3proxy can log to stdout, file, ODBC datasource and
+syslog (Unix/Linux/Cygwin only). For using ODBC under Unix/Linux you must
+compile 3proxy with Unix ODBC libraries, see Compilation.
+You can control logging from 3proxy.cfg for all services or you can control
+logging of individual service, for example
+/usr/local/sbin/socks -l/var/log/socks.log starts SOCKS proxy with logging to file.
+For universal proxy (3proxy) log file rotation and archiving is supported.
+Log type is defined with "log" configuration file command or with
+-l switch on individual service invokation. log or -l is stdout logging.
+
+ log filename
+
+and
+
+ -lfilename
+
+specify filename for logging
+
+ log @ident
+
+and
+
+ -l@ident
+
+specify ident for syslog logging. If filename within "log" command contains
+'%' characters, it's processes as format specificator (see "logformat"). E.g.
+log c:\3proxy\logs\%y%m%d.log D creates file like c:\3proxy\logs\060729.log,
+date is generated based on local time.
+
+ log &connstring
+
+
+specifies ODBC connection string, connstring is in format
+datasource,username,password (2 last are optional of
+datasource does not require or already has authentication information).
+Also, you must specify logformat to build SQL query, to insert recod into
+log, see How to setup logging format
+
+
+Rotation and archiving may be set up with log, rotate ¨ archiver commands
+
+ log filename LOGTYPE
+
+sets rotation type. LOGTYPE may be:
+
+ - M, monthely
+
- W, weekly
+
- D, daily
+
- H, hourly
+
- ‘, minutely
+
+
+ rotate NUMBER
+
+ specifies number of files in rotation (that is how many files to keep).
+
+ archiver EXT COMMAND PARAMETERS
+
+ Sets external archiver. EXT is extention of archived files
+ (for example zip, gz, Z, rar etc) COMMAND and PARAMETERS are command
+ to execute and command line PARAMETERS. Originale file is not deleted by
+ 3proxy, this work is left for archiver.
+ You can pass original filename to archiver with %F macro and archive filename with %A.
+ Examples are located in
+ 3proxy.cfg.sample
+
+ - How to setup logging format
+
+ Since 0.3 version log format may be set with "logformat" command.
+ First symbol of log format specifies format of date and time and
+ should be L (LOCAL) or G (GMT - Grinwitch Meridian Time). Format
+ string may contains some macro substitutions:
+
+- %y - Year (2 digits)
+
- %Y - Year (4 digits)
+
- %m - Month (2 digits)
+
- %o - mOnth (3 letter abbriviation)
+
- %d - Day (2 digits)
+
- %H - Hour (2 digits)
+
- %M - Minute (2 digits)
+
- %S - Second (2 digits)
+
- %t - Timestamp (seconds since January, 1 1970 00:00:00 GMT)
+
- %. - Milliseconds
+
- %z - Timezone in mail format (from GMT, '+' east, '-' west HHMM), For example Moscow winter time is +0300.
+
- %U - Username ('-' if unknown).
+
- %N - Service name (PROXY, SOCKS, POP3P, etc)
+
- %p - Service port
+
- %E - Error code (see. Log error codes reference)
+
- %C - client IP
+
- %c - client port
+
- %R - target IP
+
- %r - target port
+
- %e - external IP address used to establish connection
+
- %Q - requested IP
+
- %q - requested port
+
- %I - bytes received from target
+
- %O - bytes sent to target
+
- %n - host name from request
+
- %h - hops before target (if redirection or chaning is used).
+ see How to use chains and parent proxies)
+
- %T - service specific text (for example URL requested). %X-YT
+ where X and Y are positive numbers, only displays fields
+ (space delimited) X to Y of the text. An example is %1-2T.
+
+ Example:
+
+logformat "L%t.%. %N.%p %E %U %C:%c %R:%r %O %I %h %T"
+
+ generates something like
+
+1042454727.0296 SOCK4.1080 000 3APA3A 127.0.0.1:4739 195.122.226.28:4739 505 18735 1 GET http://3proxy.ru/ HTTP/1.1
+
+
(no line breaks)
+
+
+ If ODBC used, logformat should specify SQL command,
+ to insert record into log, for example
+
+logformat "GINSERT INTO proxystat VALUES (%t, '%c', '%U', %I)"
+
+
(no line breaks)
+
+ - How to use log analizers with 3proxy
+
+Just make format of 3proxy logs compatible with format supported by your
+favourite log analizer. Examples of compatible logformats are:
+
+For Squid access.log:
+
+"- +_G%t.%. %D %C TCP_MISS/200 %I %1-1T %2-2T %U DIRECT/%R application/unknown"
+
+or, more compatible format without %D
+
+"- +_G%t.%. 1 %C TCP_MISS/200 %I %1-1T %2-2T %U
+ DIRECT/%R application/unknown"
+
+ISA 2000 proxy WEBEXTD.LOG (fields are TAB-delimited):
+
+"- + L%C %U Unknown Y %Y-%m-%d %H:%M:%S
+ w3proxy 3PROXY - %n %R %r %D
+ %O %I http TCP %1-1T %2-2T - -
+ %E - - -"
+
+ISA 2004 proxy WEB.w3c (fields are TAB-delimited):
+
+"- + L%C %U Unknown %Y-%m-%d %H:%M:%S
+ 3PROXY - %n %R %r %D %O
+ %I http %1-1T %2-2T - %E -
+ - Internal External 0x0 Allowed"
+
+ISA 2000/2004 firewall FWSEXTD.log (fields are TAB-delimited):
+
+"- + L%C %U unnknown:0:0.0 N %Y-%m-%d
+ %H:%M:%S fwsrv 3PROXY - %n %R %r
+ %D %O %I %r TCP Connect - -
+ - %E - - - - -"
+
+HTTPD standard log (Apache and others):
+
+"-""+_L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I"
+
+or more compatible without error code
+
+"-""+_L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" 200 %I"
+
+ - How to start any of proxy services (HTTP, SOCKS etc)
+
+3proxy is distributed in 2 variants: as a set of standalone modules (proxy,
+socks, pop3p, tcppm, udppm) and as universal proxy server. These services are
+absolutely independant, and if you use 3proxy you needn't any of standalone
+modules.
+
Standalone modules are only configurable via command line interface while
+3proxy uses configuration file. Many functions, such as ODBC logging, log
+rotation, access control, etc are only available in 3proxy, not in standalone
+proxies.
+Standalone module may be started from command line, for example:
+
+$/sbin/socks -l/var/log/socks.log -i127.0.0.1
+
+Starts SOCKS server binded to localhost ip, port 1080 with logging to
+/var/log/socks.log.
+You can get help for any standalone service with -? command line option.
+
+If 3proxy is used you should start all services in 3proxy.cfg file. 3proxy.cfg
+is executed by 3proxy as a batch file. Example of 3proxy.cfg and command syntaxys
+can be found in
+3proxy.cfg.sample.
+
+log /var/log/3proxy.log D
+rotate 30
+internal 127.0.0.1
+external 192.168.1.1
+proxy
+socks -p3129
+pop3p
+
+Starts 3 services: HTTP PROXY, SOCKS and POP3 PROXY. Each listens localhost
+interface with default port (3128 for HTTP, 1080 for SOCKS and 110 for POP3P)
+except socks started with port 3129.
+All logs are in file /var/log/3proxy.log (with daily date modification and
+rotation). 30 last files are stored.
+
+ - How to bind service to specific interface and port?
+
+-i options specifies internal interface, -p - listening port. No space are
+allowed. To bind 'proxy' service to port 8080 on interfaces 192.168.1.1
+and 192.168.2.1 use
+
+proxy -p8080 -i192.168.1.1
+proxy -p8080 -i192.168.2.1
+
+
+ - How to limit service access
+
+First, always specify internal interface to accept incoming connection with
+'internal' configuration command or '-i' service command. (See
+How to start any of proxy services (HTTP, SOCKS etc)). If
+no internal interface is specified your proxy will act as open one.
+
It's also important to specify external interface to prevent access to
+internal network with 'external' or -e.
+
3proxy with configuration files allows to use authentication and
+authorization for user's access. Authentication is possible by
+username/password or user's NetBIOS name. Authentication type is specified by
+'auth' command.
+
+auth none
+
+Disables both authentication and authorization. You can not use ACLs.
+
+auth iponly
+
+Specifies no authentication, ACLs authorization is used.
+
+auth nbname
+
+Authentication by NetBIOS name + ACLs. NetBIOS name of 'messenger' service
+is obrained before ACL validation. If no name is obtained it's assumed to be
+empty. Messenger is started by default in Windows NT/2000/XP. For Win9x
+WinPopUP need to be launched. This type of authentication may be spoofed
+by privileged local user.
+
+auth strong
+
+Authentication by username/password. If user is not registered his
+access is denied regardless of ACLs.
+
+Different services can have different authentication levels.
+
+auth none
+pop3p
+auth iponly
+proxy
+auth strong
+socks
+
+
+It's possible to authorize access by client IP address, IP address or requested resource,
+target port, time, etc after authentication.
+(See How to limit resource access).
+Since 0.6 version double authentication is possible, e.g.
+
+auth iponly strong
+allow * * 192.168.0.0/16
+allow user1,user2
+proxy
+
+strong authentication will only be used if ACL requires username to deside if
+access must be granted. That is, in example, strong username authentication
+is not required to access 192.168.0.0/16
+0.6 version introduces authentication (username) caching to increase
+productivity. It's recommended to use authentication caching with resource
+or time consuming authentication types, such as nbname or external plugins
+(WindowsAuthentication).
+Caching can be set with 'authcache' command with 2 parameters: caching type
+and caching time (in seconds). Caching type defines the type of cached access:
+'ip' - after successful authentication all connections during caching time
+from same IP are assigned to the same user, username is not requested.
+"ip,user" - username is requested and all connections from the same IP are
+assigned to the same user without actual authentication. "user" - same as above,
+but IP is not checked. "user,password" - username and password are checked
+against cached ones. For authentication special authentication type 'cache'
+must be used.
+ Example:
+
+authcache ip 60
+auth cache strong windows
+proxy -n
+
+
+Please note, that caching affects security. Never use caching for access to
+critical resources, such as web administration.
+
+ - How to create user list
+
+Userslist is created with 'users' command.
+
+users USERDESC ...
+
+With a single command it's possible to define few users, or you
+can use few 'users' commands. USERDESC is user description. Description
+consists of three semicolon delimited parts - login, password type and
+
+users admin:CL:bigsecret test:CL:password test1:CL:password1
+users "test2:CR:$1$lFDGlder$pLRb4cU2D7GAT58YQvY49."
+users test3:NT:BD7DFBF29A93F93C63CB84790DA00E63
+
+Please note the usage of quotation sign: it's required to comment out $ sign
+overwise used as a file inclusion macro.
+Next password types are available:
+
+ - No password type: use system authentication.
+
- CL - cleartext password
+
- CR - crypt password, only MD5 crypt passwords are supported
+
- NT - NT-hashed (MD4) passwords in hex, as used in pwdump or SAMBA
+
+NT and crypt passwords can be used to import accounts from Windows/SAMBA or
+Unix. For Windows you can use pwdump family of utilities.
+It's convenient to store accounts apart and include account file with $ macro.
+Because for included files newlines are treated as a space, it's possible to
+use atandard passwd file format:
+
+users $/etc/.3proxypasswd
+
+or
+
+users $"c:\Program Files\3proxy\passwords"
+
+It's possible to create NT and crypt passwords with mycrypt utility included
+in distribution.
+
Userlist is system-wide. To manage user access to specific service use ACLs.
+
+ - How to limit user access to resources
+
+Commands allow, deny and flush are used to manage ACLs:
+
+allow <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist> <weekdaylist> <timeperiodlist>
+
deny <userlist> <sourcelist> <targetlist> <weekdaylist> <timeperiodlist>
+
flush
+
+
+'flush' command is used to finish with existing ACL and to start new one.
+It's required to have different ACLs for different services.
+'allow' is used to allow connection and 'deny' to deny connection. 'allow'
+command can be extended by 'parent' command to manage redirections (see How to manage redirections)). If ACL
+is empty it allow everything. If ACL is not empty, first matching ACL entry
+is searched for user request and ACL action (allow or deny) performed. If
+no matching record found, connection is denied and user will be asked to
+re-authenticate (requested for username/password). To prevent this request
+add 'deny *' to the end of list.
+
+ - <userlist> - comma delimited list of users
+
- <sourcelist> - comma delimited list of source (client) networks.
+ Networks can be defined as single IP address or in CIDR form
+ xxx.yyy.zzz.mmm/l, where l - is the length of network mask
+ (a number of non-zero bits). 192.168.1.0/24
+ means network with 255.255.255.0 mask.
+
- <targetlist> - comma delimited list of target (server) networks.
+ In 3proxy 0.6 and above it's allowed to use hostnames with wildmasks
+ in targetlist. Wildmask may only present in the begginning or at the
+ end of the hostname, e.g.
+ 192.168.0.0/16,www.example.com,*wrongsite.com,*wrongcontent*.
+
- <targetportlist> - comma delimited list of ports. I
+ It's possible to define port ranges with -, e.g. 80,1024-65535
+ means port 80 and all unprivileged ports.
+
- <commandlist> - the list of allowed actions
+
CONNECT - establish outgoing TCP connection. e.g. POP3 or SOCKSv5
+
BIND - allow incoming TCP connection (SOCKSv5)
+
UDPASSOC - create UDP association (SOCKSv5)
+
ICMPASSOC - create ICMP association (not implemented)
+
HTTP_GET - HTTP GET request (HTTP proxy)
+
HTTP_PUT - HTTP PUT request (HTTP proxy)
+
HTTP_POST - HTTP POST request (HTTP proxy)
+
HTTP_HEAD - HTTP HEAD request (HTTP proxy)
+
HTTP_CONNECT - HTTP CONNECT, aka HTTPS request (HTTP proxy)
+
HTTP_OTHER - another HTTP request (HTTP proxy)
+
HTTP - any HTTP request except HTTP_CONNECT (HTTP proxy)
+
HTTPS - alias to HTTP_CONNECT (HTTP proxy)
+
FTP_GET - FTP get request (http, ftp proxy)
+
FTP_PUT - FTP put request (ftp proxy)
+
FTP_LIST - FTP list request (http, ftp proxy)
+
FTP - any FTP request
+
ADMIN - administration interface access
+
+
- <weeksdays> - week days numbers or periods (0 or 7 means Sunday, 1 is Monday, 1-5 means Monday through Friday).
+
- <timeperiodlists> - a list of time periods in HH:MM:SS-HH:MM:SS format. For example,
+ 00:00:00-08:00:00,17:00:00-24:00:00 lists non-working hours.
+
+
+* in ACL means "any".
+Usage examples could be found in 3proxy.cfg.sample.
+
+ - How to manage redirections
+
+Redirections are usefull to e.g. forward requests from specific clients
+to different servers or proxy server. Additionally, redirections are usefull
+to convert proxy interface from ont format to another, e.g. requests from
+SOCKS proxy can be redirected to parent HTTP proxy, or SOCKSv5 client can be
+redirected to SOCKSv4 proxy.
+
Because 3proxy understand "transparent" web request, it can be used as an
+intermediate software between HTTP proxy and NAT server for transparent HTTP
+forwarding, because it can convert "Web server" request issued by client to
+"proxy request" required by proxy server. A simplest redirection is:
+
+auth iponly
+allow *
+parent 1000 http 192.168.1.1 3128
+proxy
+
+All trafiic of HTTP proxy is redirected to parent proxy 192.168.1.1 port 3128.
+
If port number is '0', IP address from 'parent' is used as external address
+for this connection (that is like -eIP, but only for connections matching
+'allow').
+
Special case of redirection are local redirections. In this case both IP is
+0.0.0.0 and port is 0. It's only usseful with SOCKS service. In this case no
+new connection is established, but request is parsed by corresponding local
+service. E.g.:
+
+auth iponly
+allow * * * 80
+parent 1000 http 0.0.0.0 0
+allow * * * 21
+parent 1000 ftp 0.0.0.0 0
+allow * * * 110
+parent 1000 pop3 0.0.0.0 0
+socks
+
+In this case all SOCKS traffic with destination port 80 is forwarded to local
+'proxy' service, destination port 21 to 'ftppr' and 110 to 'pop3pr'. There is
+no need to run these services expicitly. Local redirections are usefull if
+you want to see and control via ACLs protocol specific parameters, e.g.
+filenames requests thorugh FTP while clients are using SOCKS.
+
+ - How to balance traffic between few external channgels?
+
+Proxy itself doesn't manage network level routing. The only way to control
+outgoing channel is to select external interface. It's possible to make
+external interface (what is usually selected with 'external' command or
+'-e' option) random by using local redirection with external port 0.
+
+auth iponly
+allow *
+parent 500 http 10.1.1.101 0
+parent 500 http 10.2.1.102 0
+
+Now external interface is randomly selected with 0.5 probability between
+10.1.1.101 and 10.2.1.102. To work as expected, different default routes
+must between 2 interfaces.
+used
+
+If both interface addresses are in same network, e.g. 10.1.1.101 and 10.1.1.102
+and you want to select random gateway between 10.1.1.1 and 10.1.1.2, you must
+control it by using routing table, in case there is no default gateway route
+for Windows:
+
+ route add -p 10.1.1.1 10.1.1.101
+ route add -p 10.1.1.2 10.1.1.102
+ route add -p 0.0.0.0 mask 0.0.0.0 192.168.1.1
+ route add -p 0.0.0.0 mask 0.0.0.0 192.168.1.2
+
+If you have no second address yet, just add it. Under Linux/Unix it's better
+to use source routing.
+
+ - How to manage proxy chains
+
+parent command may also be used to build a proxy chains. In this case
+few 'parent' commands are used for single 'allow' rule with different
+weights (first argument of parent command). Chain may contain any number
+of proxy servers, but it should be noted that every hope significantly
+reduces productivity. It's possible to mix different types of proxy within
+single chain: HTTPS (HTTP connect), SOCKS4, SOCKS5. Weight different from
+1000 is used to build random chains. if weight W is below 1000, this proxy
+will be used as a next chain hop with probability of W/1000. That is, if
+the weight is 250 probability this proxy will be used for the next hope is
+25%. 'parent' records with common weight of 1000 establish a group, one of
+these record will be used for the hop with probability according to weight.
+Warning: each group must have a weight even of 1000. As follows, common
+weight of all 'parent' records must also be even of 1000. If common weight
+of 'parent' records in te chain is 3000, chain has 3 hops and must be formed
+of 3 groups. Example:
+
+allow *
+parent 500 socks5 192.168.1.1 1080
+parent 500 connect 192.168.10.1 3128
+
+In this case we have 1 parent proxy (1 hop) which is randomely choosen between
+2 hosts: 192.168.1.1 and 192.168.10.1. 2 records form a single group.
+
+allow * * * 80
+parent 1000 socks5 192.168.10.1 1080
+parent 1000 connect 192.168.20.1 3128
+parent 300 socks4 192.168.30.1 1080
+parent 700 socks5 192.168.40.1 1080
+
+In this case we have 3 groups (3 hops in the chain). First hop is 192.168.10.1,
+second hop is 192.168.20.1 and 3rd one is either 192.168.30.1 with probability
+of 30% or 192.168.40.1 with probability of 70%.
+
+
+ - How to limit bandwidth
+
+3proxy supports bandwidth filters. To manage filters bandlimin/bandlimout and
+nobandlimin/nobandlimout. 'in' means incoming and 'out' - outgoing traffic.
+
+bandlimin <bitrate> <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
nobandlimin <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
+
+Commands are applied to all services. Imagine bandwidth filters as a series of
+pipes. Bitrate is a pipe's width and ACLs controls the flow thorugh this pipe.
+
+ bandlimin 57600 * 192.168.10.16
+ bandlimin 57600 * 192.168.10.17
+ bandlimin 57600 * 192.168.10.18
+ bandlimin 57600 * 192.168.10.19
+
+Create 4 separete pipes for 4 client with emulation of modem connection.
+
+ bandlimin 57600 * 192.168.10.16/30
+
+Create single pipe for all 4 clients. That is 4 clients share modem connection.
+In this example:
+
+ nobandlimin * * * 110
+ bandlimin 57600 * 192.168.10.16/32
+
+mail traffic from POP3 servers bypasses the pipe and has no bandwidth
+limitation.
+
+ - How to limit traffic amount
+
+
+counter <filename> <type> <reportpath>
+
countin <number> <type> <amount> <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
nocountin <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
countout <number> <type> <amount> <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
nocountout <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
+
+
+You can set traffic limit per day (D), week (W), month (M), year (Y) or
+absolute ('N'), as specified by 'type' argument of counterin command.
+Traffic information is stored in binary file specified by 'filename' argument.
+countersutil utility can be used to manage this file.
+reportpath specifies location of text reports, type parameter of 'counter'
+command controls how often text reports are created. amount is amount of
+allowed traffic in Megabytes (MB). nocountin allows you to set exclusions.
+
+ - How to build network lists
+
Networks or users lists are often very huge. 3proxy doesn't currently
+supports user groups, but ones can be created by the means of include files.
+You can store comma-delimited lists of networks or users in the separate
+file and use $ macro to insert this list into 3proxy.cfg.
+3proxy comes with 'dighosts'
+utility. This utility helps to grab the list of the network from HTTP page.
+It may be usefull to e.g. obtain a regullary updated list of local networks
+from ISP's server. A network list can be either in form of NETWORK MASK,
+e.g. 192.168.1.0 255.255.255.0 or NETWORK/LENGTH, e.g. 192.168.1.0/24. You can
+launch dighosts from 3proxy.cfg to be executed on every 3proxy startup or
+configuration reload:
+
+system "dighosts http://provider/network.html local.networks"
+allow * * $local.networks
+allow *
+parent 1000 proxy.provider 3128 *
+proxy
+flush
+
+In this example we obtain list of local networks from provider's page to
+local.networks file, allow direct access to these networks and redirect all
+connection to external networks to provider's proxy.
+
+
+
+
+ Client configuration
+
+
+ Administering and information analisys
+
+
+ - How to obtain latest 3proxy version
+
+Latest version of 3proxy may be obtained
+here.
+New version may have changes and incompatibilities with previous one in files
+format or commands. Please, read CHANGELOG file and another documentation
+before installing new version.
+
+ - How to control 3proxy service under Windows NT/2000/XP
+
+If installed as system service, 3proxy understands Windows service commands
+for START, STOP, PAUSE and RESUME. If service is PAUSEd, no new connections
+are accepted while older connections are processed. Currently there is no
+support for dynamic configuration change, so, you have to restart service
+completely if you have changed any configuration.
+
+You can control 3proxy service via "Services" administration ot via "net" command:
+
+ net start 3proxy
+ net stop 3proxy
+ net pause 3proxy
+ net continue 3proxy
+
+
+ - Log error codes reference
+
+
+ - 0 - Operation successfully complited (connection
+ was closed by one of peers)
+
- 1-9 - AUTHENTICATION ERRORS
+
- 1 - Access denied by ACL (deny)
+
- 2 - Redirection (should not appear)
+
- 3 - No ACL found, denied by default
+
- 4 - auth=strong and no username in request
+
- 5 - auth=strong and no matching username in configuration
+
- 6 - User found, wrong password (cleartext)
+
- 7 - User found, wrong password (crypt)
+
- 8 - User found, wrong password (NT)
+
- 9 - Redirection data not found (should not appear)
+
- 10 - Traffic limit exceeded
+
- 11-19 - CONNECTION ERRORS
+
- 11 - failed to create socket()
+
- 12 - failed to bind()
+
- 13 - failed to connect()
+
- 14 - failed to getpeername()
+
- 20-29 - COMMON ERRORS
+
- 21 - memory allocation failed
+
- 30-39 - CONNECT PROXY REDIRECTION ERRORS
+
- 31 - failed to request HTTP CONNECT proxy
+
- 32 - CONNECT proxy connection timed out or wrong reply
+
- 33 - CONNECT proxy fails to establish connection
+
- 34 - CONNECT proxy timed out or closed connection
+
- 40-49 - SOCKS4 PROXY REDIRECTION ERRORS
+
- 50-69 - SOCKS5 PROXY REDIRECTION ERRORS
+
- 70-79 PARENT PROXY CONNECTION ERRORS (identical to 1x)
+
- 90-99 - established connection errors
+
- 90 - socket error or connection broken
+
- 91 - TCP/IP common failure
+
- 92 - connection timed out
+
- 93 - error on reading data from server
+
- 94 - error on reading data from client
+
- 95 - timeout from bandlimin/bandlimout limitations
+
- 96 - error on sending data to client
+
- 97 - error on sending data to server
+
- 98 - server data limit (should not appear)
+
- 99 - client data limit (should not appear)
+
- 100 - HOST NOT FOUND
+
- 200-299 - UDP portmapper specific bugs
+
- 300-399 - TCP portmapper specific bugs
+
- 400-499 - SOCKS proxy specific bugs
+
- 500-599 - HTTP proxy specific bugs
+
- 600-699 - POP3 proxy specific bugs
+
- 999 - NOT IMPLEMENTED
+
+
+
+
+ How To ask quiestion not in How To?
+
+ Ask it in 3proxy forum.
+ Don't try to ask something before reading this document.
+
+
+
+
+
$Id: howtoe.html,v 1.41 2009/02/02 10:04:49 vlad Exp $
\ No newline at end of file
diff --git a/doc/html/howtor.html b/doc/html/howtor.html
new file mode 100644
index 0000000..4c75e23
--- /dev/null
+++ b/doc/html/howtor.html
@@ -0,0 +1,1031 @@
+3APA3A 3proxy tiny proxy server HowTo
+
+
 ñòàäèè ðàçðàáîòêè
+
+
+
+ Êîìïèëÿöèÿ
+
+
+ - Êàê ñêîìïèëèðîâàòü 3proxy Visual C++
+
+ Èçâëåêèòå ôàéëû èç àðõèâà 3proxy.tgz (íàïðèìåð, ñ ïîìîùüþ WinZip).
+ Èñïîëüçóéòå êîìàíäó nmake /f Makefile.msvc.
+
+ - Êàê ñêîìïèëèðîâàòü 3proxy Intel C Compiler ïîä Windows
+
+ Ñì. Êàê ñêîìïèëèðîâàòü 3proxy Visual C++.
+ Èñïîëüçóéòå Makefile.intl âìåñòî Makefile.msvc
+
+ - Êàê ñêîìïèëèðîâàòü 3proxy GCC ïîä Windows
+
+ Èçâëåêèòå ôàéëû èç àðõèâà 3proxy.tgz (íàïðèìåð, ñ ïîìîùüþ WinZip èëè, ïðè íàëè÷èè
+ Cygwin, tar -xzf 3proxy.tgz).
+ Èñïîëüçóéòå êîìàíäó make -f Makefile.win. Åñëè ïî êàêèì-òî ïðè÷èíàì âû õîòèòå èñïîëüçîâàòü
+ áèáëèîòåêó POSIX-ýìóëÿöèè CygWin - èñïîëüçóéòå make -f Makefile.unix.
+ Ïðè èñïîëüçîâàíèè CygWin, ôóíêöèè, ñïåöèôè÷íûå äëÿ Windows (òàêèå, êàê çàïóñê â
+ êà÷åñòâå ñëóæáû) áóäóò íåäîñòóïíû.
+
+ - Êàê ñêîìïèëèðîâàòü 3proxy GCC ïîä Unix/Linux
+
+ Èñïîëüçóéòå make -f Makefile.unix. Äîëæåí èñïîëüçîâàòüñÿ GNU make, íà
+ íåêîòîðûõ ñèñòåìàõ íåîáõîäèìî èñïîëüçîâàòü gmake âìåñòî make. Ïîä Linux
+ íåîáõîäèìî èñïîëüçîâàòü Makefile.Linux, ïîä Solaris - Makefile.Solaris-* (â
+ çàâèñèìîñòè îò èñïîëüçóåìîãî êîìïèëÿòîðà). Êîìïèëÿöèÿ ïðîâåðåíà â FreeBSD/i386,
+ OpenBSD/i386, NetBSD/i386, RH Linux/Alpha, Debian/i386, Gentoo/i386, Gentoo/PPC,
+ Solaris 10, íî äîëæíî ñîáèðàòüñÿ â ëþáûõ âåðñèÿõ *BSD/Linux/Solaris.
+ Â äðóãèõ ñèñòåìàõ ìîæåò ïîòðåáîâàòüñÿ ìîäèôèêàöèÿ make-ôàéëà è/èëè èñõîäíûõ òåêñòîâ.
+ Äëÿ êîìïèëÿöèè ñ ïîääåðæêîé ODBC íåîáõîäèìî óáðàòü -DNOODBC èç ôëàãîâ
+ êîìïèëÿöèè è äîáàâèòü -lodbc (èëè äðóãóþ ODBC-áèáëèîòåêó) ê ôëàãàì ëèíêîâùèêà.
+
+ - Êàê ñêîìïèëèðîâàòü 3proxy Compaq C Compiler ïîä Unix/Linux
+
+ Èñïîëüçóéòå make -f Makefile.ccc. Êîìïèëÿöèÿ ïðîâåðåíà â RH Linux 7.1/Alpha.
+ Â äðóãèõ ñèñòåìàõ ìîæåò ïîòðåáîâàòüñÿ ìîäèôèêàöèÿ ôàéëà è/èëè èñõîäíûõ òåêñòîâ.
+
+
+
+Óñòàíîâêà è óäàëåíèå 3proxy
+
+
+ - Êàê óñòàíîâèòü/óäàëèòü 3proxy ïîä Windows 95/98/ME/NT/2000/XP/2003 êàê ñëóæáó
+
+ Èçâëåêèòå ôàéëû èç àðõèâà 3proxy.zip â ëþáîé êàòàëîã
+ (íàïðèìåð, c:\Program Files\3proxy). Åñëè íåîáõîäèìî, ñîçäàéòå êàòàëîã äëÿ
+ õðàíåíèÿ ôàéëîâ æóðíàëîâ. Ñîçäàéòå ôàéë êîíôèãóðàöèè 3proxy.cfg â
+ êàòàëîãå 3proxy (ñì. ðàçäåë Êîíôèãóðàöèÿ ñåðâåðà).
+ Åñëè èñïîëüçóåòñÿ âåðñèÿ áîëåå ðàííÿÿ, ÷åì 0.6, äîáàâüòå ñòðîêó
+
+ service
+ â ôàéë 3proxy.cfg. Îòêðîéòå êîìàíäíóþ ñòðîêó (cmd.exe).
+ Ïåðåéäèòå â êàòàëîã ñ 3proxy è äàéòå êîìàíäó 3proxy.exe --install:
+
+ D:\>C:
+ C:\>cd C:\Program Files\3proxy
+ C:\Program Files\3proxy>3proxy.exe --install
+ Ñåðâèñ äîëæåí áûòü óñòàíîâëåí è çàïóùåí. Åñëè ñåðâèñ íå çàïóñêàåòñÿ,
+ ïðîâåðüòå ñîäåðæèìîå ôàéëà æóðíàëà,
+ ïîïðîáóéòå óäàëèòü ñòðîêó service èç 3proxy.cfg, çàïóñòèòü 3proxy.exe âðó÷íóþ
+ è ïðîàíàëèçèðîâàòü ñîîáùåíèÿ îá îøèáêàõ.
+
+ Äëÿ óäàëåíèÿ 3proxy íåîáõîäèìî îñòàíîâèòü ñåðâèñ è äàòü
+ êîìàíäó 3proxy.exe --remove:
+
+ D:\>C:
+ C:\>cd C:\Program Files\3proxy
+ C:\Program Files\3proxy>net stop 3proxy
+ C:\Program Files\3proxy>3proxy.exe --remove
+ ïîñëå ÷åãî êàòàëîã 3proxy ìîæíî óäàëèòü.
+
+ Óñòàíîâêà â êà÷åñòâå ñèñòåìíîé ñëóæáû ïîä Windows 9x ïîääåðæèâàåòñÿ ñ âåðñèè 0.5
+
+ - Êàê óñòàíîâèòü/óäàëèòü 3proxy ïîä Windows 95/98/ME
+
+ Èçâëåêèòå ôàéëû èç àðõèâà 3proxy.zip â ëþáîé êàòàëîã
+ (íàïðèìåð, c:\Program Files\3proxy). Åñëè íåîáõîäèìî, ñîçäàéòå êàòàëîã äëÿ
+ õðàíåíèÿ ôàéëîâ æóðíàëîâ. Ñîçäàéòå ôàéë êîíôèãóðàöèè 3proxy.cfg â
+ êàòàëîãå 3proxy (Ñì. ðàçäåë Êîíôèãóðàöèÿ ñåðâåðà).
+ Â ôàéëå êîíôèãóðàöèè óäàëèòå ñòðîêó
+
+ service
+ è äîáàâüòå ñòðîêó
+
+ daemon
+ Ñîçäàéòå ÿðëûê äëÿ 3proxy.exe è ïîìåñòèòå åãî â àâòîçàãðóçêó ëèáî ñ ïîìîùüþ
+ ðåäàêòîðà ðååñòðà regedit.exe äîáàâüòå â ðàçäåëå
+
HKLM\Software\Microsoft\Windows\CurrentVersion\Run
+ ñòðîêîâûé ïàðàìåòð
+
3proxy = "c:\Program Files\3proxy.exe" "C:\Program Files\3proxy.cfg"
+ Èñïîëüçîâàíèå êàâû÷åê ïðè íàëè÷èè â ïóòè ïðîáåëà îáÿçàòåëüíî.
+ Ïåðåçàãðóçèòåñü.
+ Åñëè ñåðâåð íå çàïóñêàåòñÿ,
+ ïðîâåðüòå ñîäåðæèìîå ôàéëà æóðíàëà,
+ ïîïðîáóéòå óäàëèòü ñòðîêó daemon èç 3proxy.cfg, çàïóñòèòü 3proxy.exe âðó÷íóþ
+ è ïðîàíàëèçèðîâàòü ñîîáùåíèÿ îá îøèáêàõ.
+
+ - Êàê óñòàíîâèòü/óäàëèòü 3proxy ïîä Unix/Linux
+
+ Ñêîìïèëèðóéòå 3proxy (ñì. ðàçäåë Êîìïèëÿöèÿ). Ñêîïèðóéòå
+ èñïîëíÿåìûå ôàéëû â ïîäõîäÿùèé êàòàëîã (íàïðèìåð, /usr/local/3proxy/sbin äëÿ
+ ñåðâåðíûõ ïðèëîæåíèé èëè /usr/local/3proxy/bin äëÿ êëèåíòñêèõ óòèëèò).
+ Ñîçäàéòå ôàéë /usr/local/etc/3proxy.cfg.
+ (Ñì. ðàçäåë Êîíôèãóðàöèÿ ñåðâåðà).
+ Èçìåíèòü ðàñïîëîæåíèå ôàéëà êîíôèãóðàöèè ìîæíî, çàäàâ ïàðàìåòð ïðè âûçîâå
+ 3proxy èëè èçìåíèâ ïóòü â ôàéëå 3proxy.c äî êîìïèëÿöèè.
+ Äîáàâüòå âûçîâ 3proxy â ñêðèïòû íà÷àëüíîé èíèöèàëèçàöèè.
+
+
+
+Êîíôèãóðàöèÿ ñåðâåðà
+
+
+ - Êàê ïîñìîòðåòü ïðèìåð ôàéëà êîíôèãóðàöèè
+
+ Ïðèìåð ôàéëà êîíôèãóðàöèè 3proxy.cfg.sample ïîñòàâëÿåòñÿ ñ ëþáûì äèñòðèáóòèâîì
+ ïðîãðàììû.
+
+ - Êàê íàñòðîèòü âåäåíèå æóðíàëà
+
+ 3proxy ïîääåðæèâàåò âåäåíèå æóðíàëà íà ýêðàí (stdout), â ôàéë, ÷åðåç ODBC è ÷åðåç ñëóæáó
+ syslog (òîëüêî äëÿ Unix/Linux/CygWin). Ìîæíî óïðàâëÿòü ëèáî îáùèì ôàéëîì
+ æóðíàëà, çàäàâàåìûì â ôàéëå êîíôèãóðàöèè 3proxy.cfg è åäèíûì äëÿ âñåõ ñëóæá,
+ ëèáî èíäèâèäóàëüíûìè ôàéëàìè äëÿ îòäåëüíûõ ñëóæá (íàïðèìåð, êîìàíäà
+ socks -l/var/log/socks.log çàïóñêàåò SOCKS ïðîêñè
+ è çàäàåò äëÿ íåãî èíäèâèäóàëüíûé æóðíàë). Äëÿ îáùåãî ôàéëà æóðíàëà
+ ïîääåðæèâàåòñÿ ðîòàöèÿ (ò.å. ïåðèîäè÷åñêîå ñîçäàíèå íîâûõ ôàéëîâ æóðíàëà
+ ñ ïðåäîïðåäåëåííûìè èìåíàìè è óäàëåíèå ôàéëîâ ñòàðøå îïðåäåëåííîãî ñðîêà)
+ è àðõèâàöèÿ ôàéëîâ æóðíàëà.
+ Òèï æóðíàëà îïðåäåëÿåòñÿ ïàðàìåòðîì log â ôàéëå êîíôèãóðàöèè ëèáî êëþ÷îì
+ -l ïðè âûçîâå êîíêðåòíîé ñëóæáû (íàïðèìåð, socks ïðîêñè). log èëè -l áåç
+ ïàðàìåòðîâ ñîîòâåòñòâóþò âåäåíèþ æóðíàëà íà ýêðàí (stdout).
+
+ log filename
+ è
+
+ -lfilename
+ ñîîòâåòñòâóþò çàïèñè æóðíàëà â ôàéë filename. Åñëè ïðè óêàçàíèè èìåíè ôàéëà
+ â log â íåì ñîäåðæèòñÿ ñèìâîë %, òî èìÿ ðàññìàòðèâàåòñÿ êàê ôîðìàòíûé
+ ñïåöèôèêàòîð (ñì. logformat). Íàïðèìåð,
+ log c:\3proxy\logs\%y%m%d.log D ñîçäàñò ôàéë òèïà c:\3proxy\logs\060725.log,
+ äëÿ îáðàçîâàíèÿ äàòû áóäåò èñïîëüçîâàíî ìåñòíîå âðåìÿ.
+
+ log @ident
+ è
+
+ -l@ident
+ ñîîòâåòñòâóþò âåäåíèþ æóðíàëà ÷åðåç syslog ñ èäåíòèôèêàòîðîì ident.
+
+ log &connstring
+ ñîîòâåòñòâóåò âåäåíèþ æóðíàëà ÷åðåç ODBC, connstring çàäàåòñÿ â ôîðìàòå
+ datasource,username,password (ïîñëåäíèå äâà ïàðàìåòðà îïöèîíàëüíû, åñëè
+ datasource íå òðåáóåò èëè óæå ñîäåðæèò ñâåäåíèÿ äëÿ àâòîðèçàöèè). Ïðè ýòîì
+ êîìàíäà logformat äîëæíà çàäàâàòü SQL çàïðîñ, êîòîðûé íåîáõîäèìî âûïîëíèòü
+ äëÿ äîáàâëåíèÿ çàïèñè â æóðíàë, ñì Êàê íàñòðîèòü ôîðìàò æóðíàëà.
+
+ Óïðàâëåíèå ðîòàöèåé îáùåãî ôàéëà æóðíàëà ïðîèñõîäèò ñ ïîìîùüþ êîìàíä ôàéëà
+ êîíôèãóðàöèè log, rotate è archiver.
+
+ log filename LOGTYPE
+ çàäàåò òèï ðîòàöèè. LOGTYPE ìîæåò ïðèíèìàòü çíà÷åíèÿ:
+
+ - M, åæåìåñÿ÷íàÿ ðîòàöèÿ
+
- W, åæåíåäåëüíàÿ ðîòàöèÿ
+
- D, åæåäíåâíàÿ ðîòàöèÿ
+
- H, åæå÷àñíàÿ ðîòàöèÿ
+
- Ñ, åæåìèíóòíàÿ ðîòàöèÿ
+
+
+ rotate NUMBER
+ óêàçûâàåò íà ÷èñëî ôàéëîâ, ó÷àñòâóþùèõ â ðîòàöèè (ò.å. ñêîëüêî ïîñëåäíèõ
+ æóðíàëîâ õðàíèòü).
+
+ archiver EXT COMMAND PARAMETERS
+ çàäàåò ïàðàìåòðû àðõèâàöèè æóðíàëà. EXT óêàçûâàåò íà ðàñøèðåíèå
+ àðõèâà (íàïðèìåð, zip, gz, Z, rar è ò.ä.) COMMAND óêàçûâàåò íà
+ ïðîãðàììó è PARAMETERS - íà ïàðàìåòðû êîìàíäíîé ñòðîêè. Àðõèâàòîð
+ äîëæåí ñàì óäàëÿòü èñõîäíûé ôàéë, òàêæå åìó ìîæíî ïåðåäàòü èìÿ ôàéëà
+ ñ ïîìîùüþ ìàêðîñà %F è îæèäàåìîå èìÿ àðõèâà ñ ïîìîùüþ ìàêðîñà %A.
+  êà÷åñòâå àðõèâàòîðà âïîëíå ìîæíî çàäàòü ïàêåòíûé ôàéë, êîòîðûé,
+ íàïðèìåð, áóäåò çàãðóæàòü äàííûå èç æóðíàëà â áàçó äàííûõ.
+ Ïðèìåðû êîìàíäû archiver äëÿ ïîïóëÿðíûõ àðõèâàòîðîâ ìîæíî íàéòè â
+ 3proxy.cfg.sample
+
+ logdump OFFSET_BYTES_FROM_SERVER OFFSET_BYTES_FROM_CLIENT
+ Çàäàåò ñìåùåíèå â áàéòàõ íà âõîäÿùèé è èñõîäÿùèé òðàôèê, ïðè äîñòèæåíèè
+ êîòîðîãî íåîáõîäèìî ñîçäàâàòü çàïèñü â æóðíàëå äàæå â òîì ñëó÷àå, åñëè
+ ñîåäèíåíèå åùå íå çàâåðøåíî. Åñëè logdump íå óêàçàí èëè çíà÷åíèÿ
+ OFFSET_BYTES_FROM_SERVER OFFSET_BYTES_FROM_CLIENT íóëåâûå - â æóðíàëå
+ áóäåò ñîçäàíà åäèíñòâåííàÿ çàïèñü ïî îêîí÷àíèè îáðàáîòêè çàïðîñà êëèåíòà
+ (ïðè ðàçðûâå ñîåäèíåíèÿ). Ïðèìåð:
+
+ logdump 1048576 1048576
+ ñîçäàåò â æóðíàëå çàïèñü íà êàæäûé ìåãàáàéò âõîäÿùåãî èëè èñõîäÿùåãî
+ òðàôèêà.
+
+ - Êàê íàñòðîèòü ôîðìàò æóðíàëà
+
+ Íà÷èíàÿ ñ âåðñèè 0.3, ôîðìàò æóðíàëà ìîæåò áûòü íàñòðîåí ñ ïîìîùüþ
+ êîìàíäû logformat ñî ñòðîêîé ôîðìàòà. Ïåðâûé ñèìâîë ñòðîêè äîëæåí
+ áûòü L èëè G, ÷òî óêàçûâàåò íà ôîðìàò, â êîòîðîì áóäåò óêàçûâàòüñÿ
+ âðåìÿ è äàòû, L - òåêóùåå ëîêàëüíîå âðåìÿ, G - àáñîëþòíîå âðåìÿ ïî
+ Ãðèíâè÷ó. Ñòðîêà ôîðìàòà ìîæåò ñîäåðæàòü ñëåäóþùèå ìîäèôèêàòîðû:
+
+ - %y - Ãîä (ïîñëåäíèå äâå öèôðû)
+
- %Y - Ãîä (÷åòûðåõçíà÷íûé)
+
- %m - Íîìåð ìåñÿöà (01-12)
+
- %o - Òðåõáóêâåííàÿ àááðåâèàòóðà ìåñÿöà
+
- %d - Äåíü (01-31)
+
- %H - ×àñ (00-23)
+
- %M - Ìèíóòà (00-59)
+
- %S - Ñåêóíäà (00-59)
+
- %t - Âðåìåííàÿ ìåòêà (÷èñëî ñåêóíä ñ 00:00:00 1 ÿíâàðÿ 1970 ã. ïî Ãðèíâè÷ó)
+
- %. - Ìèëëèñåêóíäû
+
- %z - Âðåìåííàÿ çîíà â ïî÷òîâîì ôîðìàòå (îò Ãðèíâè÷à, '+' âîñòîê, '-' çàïàä ××ÌÌ), íàïðèìåð, Ìîñêîâñêîå çèìíåå âðåìÿ +0300.
+
- %U - Èìÿ ïîëüçîâàòåëÿ ('-', åñëè îòñóòñòâóåò).
+
- %N - Íàçâàíèå ïðîêñè ñåðâèñà (PROXY, SOCKS, POP3P, è ò.ä.)
+
- %p - Ïîðò ïðîêñè ñåðâèñà
+
- %E - Êîä îøèáêè (ñì. Êîäû îøèáîê â æóðíàëå)
+
- %C - IP êëèåíòà
+
- %c - Ïîðò êëèåíòà
+
- %R - IP ñåðâåðà (èñõîäÿùåãî ñîåäèíåíèÿ ïî çàïðîñó êëèåíòà)
+
- %r - Ïîðò ñåðâåðà (èñõîäÿùåãî ñîåäèíåíèÿ ïî çàïðîñó êëèåíòà)
+
- %Q – IP, çàïðîøåííûé êëèåíòîì
+
- %q – Ïîðò, çàïðîøåííûé êëèåíòîì
+
- %I - Ïðèíÿòî áàéò îò ñåðâåðà
+
- %O - Îòïðàâëåíî áàéò íà ñåðâåð
+
- %n - Èìÿ õîñòà èç çàïðîñà
+
- %h - ×èñëî çâåíüåâ äî êîíå÷íîãî ñåðâåðà (ïðè èñïîëüçîâàíèè ïåðåíàïðàâëåíèé èëè ÷åéíèíãà
+ ñì. Êàê ñîñòàâëÿòü öåïî÷êè ïðîêñè)
+
- %T – Òåêñò, ñïåöèôè÷íûé äëÿ ïðîêñè ñåðâèñà (íàïðèìåð, çàïðîøåííûé URL).
+ Ìîæíî èñïîëüçîâàòü %X-YT, ãäå X è Y ïîëîæèòåëüíûå ÷èñëà, òîãäà
+ îòîáðàæàþòñÿ òîëüêî ïîëÿ ñ X ïî Y òåêñòà. Ïîëÿ ñ÷èòàþòñÿ ðàçäåëåííûìè
+ ïðîáåëüíûì ñèìâîëîì.
+
+ Ïðèìåð:
+
+ logformat "L%t.%. %N.%p %E %U %C:%c %R:%r %O %I %h %T"
+ áóäåò ãåíåðèðîâàòü â æóðíàëå çàïèñè òèïà
+
+ 1042454727.0296 SOCK4.1080 000 3APA3A 127.0.0.1:4739 195.122.226.28:4739 505 18735 1 GET http://3proxy.ru/ HTTP/1.1
+ (áåç ïåðåíîñà ñòðîê)
+ Ïðè èñïîëüçîâàíèè ODBC, logformat äîëæåí çàäàâàòü ôîðìàò SQL êîìàíäû,
+ êîòîðóþ íåîáõîäèìî äàòü äëÿ âíåñåíèÿ çàïèñè â æóðíàë, íàïðèìåð:
+
+ logformat "GINSERT INTO proxystat VALUES (%t, '%c', '%U', %I)"
+
+ - Êàê èñïîëüçîâàòü ëîã-àíàëèçàòîðû ñ 3proxy
+
+ Ïðîñòî ñäåëàéòå ôîðìàò âåäåíèÿ æóðíàëà ñîâìåñòèìûì ñ îäíèì èç ôîðìàòîâ,
+ ïîääåðæèâàåìûõ àíàëèçàòîðîì. Ýòî ïîçâîëÿåò èñïîëüçîâàòü ïðàêòè÷åñêè ëþáûå
+ àíàëèçàòîðû. Ïðèìåðû ñîâìåñòèìûõ ôîðìàòîâ:
+
+ Ôîðìàò Squid access.log:
+
+ "- +_G%t.%. %D %C TCP_MISS/200 %I %1-1T %2-2T %U DIRECT/%R application/unknown"
+ Áîëåå ñîâìåñòèìûé ôîðìàò, íî áåç %D
+
+ "- +_G%t.%. 1 %C TCP_MISS/200 %I %1-1T %2-2T %U
+ DIRECT/%R application/unknown"
+ Ôîðìàò ISA 2000 proxy WEBEXTD.LOG (ïîëÿ ðàçäåëåíû òàáóëÿöèåé):
+
+ "- + L%C %U Unknown Y %Y-%m-%d %H:%M:%S
+ w3proxy 3PROXY - %n %R %r %D
+ %O %I http TCP %1-1T %2-2T - -
+ %E - - -"
+ Ôîðìàò ISA 2004 proxy WEB.w3c (ïîëÿ ðàçäåëåíû òàáóëÿöèåé):
+
+ "- + L%C %U Unknown %Y-%m-%d %H:%M:%S
+ 3PROXY - %n %R %r %D %O
+ %I http %1-1T %2-2T - %E -
+ - Internal External 0x0 Allowed"
+ Ôîðìàò ISA 2000/2004 firewall FWSEXTD.log (ïîëÿ ðàçäåëåíû òàáóëÿöèåé):
+
+ "- + L%C %U unnknown:0:0.0 N %Y-%m-%d
+ %H:%M:%S fwsrv 3PROXY - %n %R %r
+ %D %O %I %r TCP Connect - -
+ - %E - - - - -"
+ Ñòàíäàðòíûé ëîã HTTPD (Apache è äðóãèå):
+
+ "-""+_L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I"
+ Áîëåå ñîâìåñòèìûé, íî áåç êîäà îøèáêè:
+
+ "-""+_L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" 200 %I"
+ - Êàê çàïóñòèòü êîíêðåòíóþ ñëóæáó (HTTP, SOCKS è ò.ä)
+
+ 3proxy ïîñòàâëÿåòñÿ â äâóõ âàðèàíòàõ: êàê íàáîð îòäåëüíûõ ìîäóëåé (proxy,
+ socks, pop3p, tcppm, udppm) è êàê óíèâåðñàëüíûé ïðîêñè-ñåðâåð (3proxy).
+ Óíèâåðñàëüíûé ïðîêñè ñåðâåð - ýòî çàêîí÷åííàÿ ïðîãðàììà, êîòîðîé íå òðåáóþòñÿ
+ îòäåëüíûå ìîäóëè.
+
Îòäåëüíûé ìîäóëü óïðàâëÿåòñÿ òîëüêî èç êîìàíäíîé ñòðîêè. Ïîýòîìó äëÿ
+ îòäåëüíîãî ìîäóëÿ íå ïîääåðæèâàþòñÿ ìíîãèå ôóíêöèè, òàêèå êàê óïðàâëåíèå
+ äîñòóïîì è ðîòàöèÿ æóðíàëà. Çàïóñê ìîäóëÿ îñóùåñòâëÿåòñÿ èç êîìàíäíîé ñòðîêè.
+ Íàïðèìåð,
+
+ $/sbin/socks -l/var/log/socks.log -i127.0.0.1
+ çàïóñêàåò SOCKS íà ïîðòó 127.0.0.1:1080 ñ âåäåíèåì æóðíàëà /var/log/socks.log
+ Ñïðàâêó ïî îïöèÿì êîìàíäíîé ñòðîêè ìîæíî ïîëó÷èòü çàïóñòèâ ìîäóëü ñ êëþ÷îì -?.
+
+ Åñëè èñïîëüçóåòñÿ 3proxy, òî çàïóñêàåìûå ñëóæáû óêàçûâàþòñÿ â ôàéëå 3proxy.cfg.
+ Ôàéë 3proxy.cfg ïðîñìàòðèâàåòñÿ 3proxy ïîñòðî÷íî, êàæäàÿ ñòðîêà ðàññìàòðèâàåòñÿ
+ êàê óïðàâëÿþùàÿ êîìàíäà. Ñèíòàêñèñ êîìàíä îïèñàí â 3proxy.cfg.sample. Íàïðèìåð,
+
+ log /var/log/3proxy.log D
+ rotate 30
+ internal 127.0.0.1
+ external 192.168.1.1
+ proxy
+ socks
+ pop3p -l/var/log/pop3proxy
+ çàïóñêàåò 3 ñëóæáû - PROXY, SOCKS è POP3 Proxy. Êàæäàÿ ñëóøàåò íà èíòåðôåéñå
+ 127.0.0.1 ïîðò ïî-óìîë÷àíèþ (3128 äëÿ proxy, 1080 äëÿ socks è 110 äëÿ
+ pop3p). Æóðíàëû âñåõ ñëóæá êðîìå pop3p âåäóòñÿ â ôàéëå /var/log/3proxy.log,
+ êîòîðûé åæåäíåâíî ìåíÿåòñÿ. Õðàíÿòñÿ 30 ïîñëåäíèõ ôàéëîâ. Äëÿ pop3p âåäåòñÿ
+ îòäåëüíûé æóðíàë /var/log/pop3proxy (ñì. Êàê íàñòðîèòü âåäåíèå æóðíàëà).
+
+ - Êàê ïîâåñèòü ñëóæáó íà îïðåäåëåííûé èíòåðôåéñ èëè ïîðò
+
+ Îïöèÿ -i ïîçâîëÿåò óêàçàòü âíóòðåííèé èíòåðôåéñ, -p - ïîðò (ïðîáåëû â
+ îïöèÿõ íå äîïóñêàþòñÿ). Íàïðèìåð, ÷òîáû ñëóæáà proxy âèñåëà íà ïîðòó
+ 8080 èíòåðôåéñîâ 192.168.1.1 è 192.168.2.1 íåîáõîäèìî äàòü êîìàíäû
+
+
+ proxy -p8080 -i192.168.1.1
+ proxy -p8080 -i192.168.2.1
+ - Êàê îãðàíè÷èòü äîñòóï ê ñëóæáå
+
+ Âî-ïåðâûõ, äëÿ îãðàíè÷åíèÿ äîñòóïà íåîáõîäèìî óêàçàòü âíóòðåííèé èíòåðôåéñ,
+ íà êîòîðîì ïðîêñè-ñåðâåð áóäåò ïðèíèìàòü ñîåäèíåíèÿ. Âíóòðåííèé èíòåðôåéñ
+ óêàçûâàåòñÿ ñ ïîìîùüþ êîìàíäû internal â ôàéëå êîíôèãóðàöèè èëè ñ ïîìîùüþ
+ êëþ÷à -i êîíêðåòíîãî ìîäóëÿ.
+ (ñì. Êàê çàïóñòèòü êîíêðåòíóþ ñëóæáó (HTTP, SOCKS è ò.ä)).
+ Îòñóòñòâèå óêàçàíèÿ âíóòðåííåãî èíòåðôåéñà ìîæåò ïðèâåñòè ê òîìó, ÷òî âàø
+ ïðîêñè áóäåò îòêðûòûì.
+
Óêàçàíèå âíåøíåãî èíòåðôåéñà (ò.å. IP, ñ êîòîðîãî ñåðâåð áóäåò óñòàíàâëèâàòü
+ âíåøíèå ñîåäèíåíèÿ) òàê æå ÿâëÿåòñÿ ïîëåçíûì. Äëÿ ýòîãî ñëóæèò êîìàíäà external
+ è êëþ÷ -e ñîîòâåòñòâåííî.
+ Äëÿ óíèâåðñàëüíîãî ïðîêñè âîçìîæíà äîïîëíèòåëüíàÿ àâòîðèçàöèÿ äîñòóïà ñ ïîìîùüþ
+ èìåíè/ïàðîëÿ, NetBIOS èìåíè ïîëüçîâàòåëÿ è ïî ñïèñêàì äîñòóïà (ïî IP êëèåíòà,
+ IP è ïîðòó íàçíà÷åíèÿ, ñì. Êàê îãðàíè÷èòü äîñòóï ïîëüçîâàòåëåé ê ðåñóðñàì).
+ Òèï àâòîðèçàöèè óñòàíàâëèâàåòñÿ êîìàíäîé auth â ôàéëå êîíôèãóðàöèè.
+
+ auth none
+ Îòñóòñòâèå êàêîé-ëèáî àâòîðèçàöèè. Ñïèñêè äîñòóïà íå ïðîâåðÿþòñÿ.
+
+ auth iponly
+ Áóäåò èäòè ïðîâåðêà ïî ñïèñêó äîñòóïà ñ èñïîëüçîâàíèåì IP êëèåíòà, IP è íîìåðà
+ ïîðòà íàçíà÷åíèÿ.
+
+ auth nbname
+ Ïåðåä ïðîâåðêîé ïî ñïèñêîì äîñòóïà áóäåò ïðîèçâåäåíà ïîïûòêà ïîëó÷èòü NetBIOS
+ èìÿ êëèåíòà. Äëÿ ýòîãî èñïîëüçóåòñÿ NetBIOS êîä ñëóæáû messager (0x03). Åñëè
+ èìÿ îïðåäåëèòü íå óäàëîñü (ñëóæáà messager äëÿ Windows NT/2000/XP èëè WinPopUP
+ äëÿ 95/98/ME íå çàïóùåíà), òî èìÿ áóäåò ñ÷èòàòüñÿ ïóñòûì. Äàëåå ñëåäóåò
+ ïðîâåðêà ïî ñïèñêàì äîñòóïà. Äàííûé òèï àâòîðèçàöèè íå çàâèñèò îò ïëàòôîðìû
+ ñåðâåðà (ò.å. ïðîêñè ñåðâåð, çàïóùåííûé ïîä Unix, ñìîæåò îïðåäåëÿòü NetBIOS
+ èìåíà). Åãî ðåêîìåíäóåòñÿ èñïîëüçîâàòü â îäíîðîäíûõ ñåòÿõ, ãäå ó âñåõ êëèåíòîâ
+ óñòàíîâëåíà Windows NT/2000/XP è ïîëüçîâàòåëè íå èìåþò äîñòóïà ê
+ ïðèâåëåãèðîâàííûì ó÷åòíûì çàïèñÿì. Ýòîò âèä àâòîðèçàöèè íå ÿâëÿåòñÿ íàäåæíûì.
+
+ auth strong
+ Ïðîâåðÿåòñÿ èìÿ è ïàðîëü, ïåðåäàííûå ïîëüçîâàòåëåì ïðè ïîäêëþ÷åíèè ê ïðîêñè.
+ Äàííûé âèä àâòîðèçàöèè ðàáîòàåò òîëüêî ñ proxy è socks. Íåîáõîäèìî çàäàíèå
+ ñïèñêà ïîëüçîâàòåëåé (ñì Êàê ñîçäàòü ñïèñîê ïîëüçîâàòåëåé).
+ Ñîåäèíåíèÿ îò íåèçâåñòíûõ ïîëüçîâàòåëåé íå ïðèíèìàþòñÿ. Ïîñëå ïðîâåðêè èìåíè
+ ïîëüçâîàòåëÿ è ïàðîëÿ ïðîèñõîäèò ïðîâåðêà ñïèñêîâ äîñòóïà.
+
+ Äëÿ ðàçíûõ ñëóæá ìîæíî óñòàíîâèòü ðàçëè÷íûå òèïû àâòîðèçàöèè, íàïðèìåð,
+
+ auth none
+ pop3p
+ auth iponly
+ proxy
+ auth strong
+ socks
+ íå íàêëàäûâàåò îãðàíè÷åíèé íà èñïîëüçîâàíèå POP3 Proxy, ïðîèçâîäèò ïðîâåðêó
+ ïî ñïèñêàì äîñòóïà äëÿ ïîëüçîâàòåëåé HTTP Proxy è òðåáóåò àâòîðèçàöèè ñ èìåíåì
+ è ïàðîëåì äëÿ SOCKS.
+ Ñ âåðñèè 0.6 âîçìîæíî èñïîëüçâîàòü äâîéíóþ àâòîðèçàöèþ, íàïðèìåð,
+
+ auth iponly strong
+ allow * * 192.168.0.0/16
+ allow user1,user2
+ proxy
+ áóäåò èñïîëüçîâàòü àâòîðèçàöèþ òîëüêî â òîì ñëó÷àå, åñëè íå óäàëîñü ïðîïóñòèòü
+ ïîëüçîâàòåëÿ ñ àâòîðèçàöèé iponly, ò.å. äëÿ äîñòóïà ê ðåñóðñàì 192.168.0.0/16
+ àâòîðèçàöèÿ íå òðåáóåòñÿ.
+ Ñ âåðñèè 0.6 òàê æå ìîæíî èñïîëüçâîàòü êýøèðîâàíèå àâòîðèçàöèè (èìåíè
+ ïîëüçîâàòåëÿ) ñ öåëüþ ïîâûøåíèÿ ïðîèçâîäèòåëüíîñòè. Èñïîëüçîâàòü êýøèðîâàíèå
+ äëÿ strong ïðàêòè÷åñêè íå èìååò ñìûñëà, îíà ïîëåçíî äëÿ nbname è àâòîðèçàöèè
+ ÷åðåç âíåøíèå ïëàãèíû, òèïà WindowsAuthentication. Êýøèðîâàíèå íàñòðàèâàåòñÿ
+ êîìàíäîé authcache ñ äâóìÿ ïàðàìåòðàìè - òèïîì êýøèðîâàíèÿ è âðåìåíåì, íà
+ êîòîðîå êýøèðóåòñÿ ïàðîëü. Âîçìîæíûå òèïû: ip - ïîñëå óñïåøíîé àâòîðèçàöèè â
+ òå÷åíèå âðåìåíè êýøèðîâàíèÿ âñå çàïðîñû ïðèøåäøèå ñ òîãî æå àäðåñà ñ÷èòàþòñÿ
+ çàïðîñàìè îò òîãî æå ïîëüçîâàòåëÿ, name - ïîñëå óñïåøíîé àâòîðèçàöèè îò
+ ïîëüçîâàòåëÿ ñ òåì æå èìåíåì òðåáóþò óêàçàíèÿ èìåíè, íî ðåàëüíî àóòåíòèôèêàöèè
+ íå ïðîèçâîäèòñÿ, ip,name - çàïðîñ äîëæåí ïðèäòè îò òîãî æå IP è ñ òåì æå
+ èìåíåì. user,password - èìÿ è ïàðîëü ïîëüçîâàòåëÿ ñâåðÿþòñÿ ñ êýøèðîâàííûìè.
+ Âîçìîæíû è äðóãèå ñî÷åòàíèÿ. Äëÿ àâòîðèçàöèè äîëæåí èñïîëüçîâàòüñÿ ñïåöèàëüíûé
+ ìåòîä àâòîðèçàöèè - cache. Ïðèìåð:
+
+ authcache ip 60
+ auth cache strong windows
+ proxy -n
+ Êýøèðîâàíèå âëèÿåò íà áåçîïàñíîñòü äîñòóïà. Íè â êîåì ñëó÷àå íå ñëåäóåò
+ èñïîëüçîâàòü êýøèðîâàíèå äëÿ äîñòóïà ê êðèòè÷íûì ðåñóðñàì, â ÷àñòíîñòè ê
+ èíòåðôåéñó àäìèíèñòðèðîâàíèÿ.
+
+ - Êàê ñîçäàòü ñïèñîê ïîëüçîâàòåëåé
+
+ Ñïèñîê ïîëüçîâàòåëåé çàäàåòñÿ ñ ïîìîùüþ êîìàíäû users.
+
+ users USERDESC ...
+ Ñ ïîìîùüþ îäíîé êîìàíäû ìîæíî çàäàòü íåñêîëüêî ïîëüçîâàòåëåé, ìîæíî
+ äàâàòü íåñêîëüêî êîìàíä users. USERDESC - îïèñàíèå ïîëüçîâàòåëÿ. Îïèñàíèå
+ ïîëüçîâàòåëÿ ñîñòîèò èç òðåõ ïîëåé ðàçäåëåííûõ : (äâîåòî÷èåì) - èìåíè (login)
+ òèïà ïàðîëÿ è ïàðîëÿ. Íàïðèìåð:
+
+ users admin:CL:bigsecret test:CL:password test1:CL:password1
+ users "test2:CR:$1$lFDGlder$pLRb4cU2D7GAT58YQvY49."
+ users test3:NT:BD7DFBF29A93F93C63CB84790DA00E63
+ Îáðàòèòå âíèìàíèå íà äâîéíûå êàâû÷êè - îíè íåîáõîäèìû äëÿ âòîðîãî ïîëüçîâàòåëÿ,
+ ò.ê. â åãî ïàðîëå âñòðå÷àåòñÿ çíàê $, êîòîðûé äëÿ ôàéëà 3proxy.cfg îçíà÷àåò
+ âêëþ÷åíèå äðóãîãî ôàéëà. Ïîääåæèâàåòñÿ ñëåäóþùèå òèïû ïàðîëåé:
+
+ - òèï íå óêàçàí - èñïîëüçîâàòü ñèñòåìíóþ àâòîðèçàöèþ äëÿ
+ äàííîãî ïîëüçîâàòåëÿ (ïîêà íå ðåàëèçîâàíî).
+
- CL - ïàðîëü â îòêðûòîì òåêñòå
+
- CR - ïàðîëü â ôîðìàòå crypt() (òîëüêî MD5)
+
- NT - ïàðîëü â ôîðìàòå NT â øåñòíàäöàòåðè÷íîé êîäèðîâêå
+
+ NT è crypt ïàðîëè ìîãóò áûòü èñïîëüçîâàíû äëÿ èìïîðòà ó÷åòíûõ çàïèñåé èç
+ Windows/Samba è Unix ñîîòâåòñòâåííî (äëÿ Windows ìîæíî èñïîëüçîâàòü óòèëèòû
+ ñåìåéñòâà pwdump).
+ Ó÷åòíûå çàïèñè óäîáíî õðàíèòü â îòäåëüíîì ôàéëå (â òàêîì ñëó÷àå ìîæíî õðàíèòü
+ èõ ïîñòðî÷íî â ôîðìàòå, òèïè÷íîì äëÿ ôàéëîâ ïàðîëåé). Âêëþ÷èòü ôàéë ìîæíî ñ
+ ïîìîùüþ ìàêðîñà $:
+
+ users $/etc/.3proxypasswd
+ èëè
+
+ users $"c:\Program Files\3proxy\passwords"
+ Øèôðîâàííûå NT è crypt ïàðîëè ìîæíî ñîçäàâàòü ñ ïîìîùüþ óòèëèòû mycrypt.
+
Ñïèñîê ïîëüçîâàòåëåé åäèí äëÿ âñåõ ñëóæá. Ðàçãðàíè÷åíèå äîñòóïà ïî ñëóæáàì
+ íåîáõîäèìî ïðîèçâîäèòü ñ ïîìîùüþ ñïèñêîâ äîñòóïà.
+
+ - Êàê îãðàíè÷èòü äîñòóï ïîëüçîâàòåëåé ê ðåñóðñàì
+
+ Äëÿ ïîñòðîåíèÿ ñïèñêîâ äîñòóïà èñïîëüçóþòñÿ êîìàíäû allow, deny è
+ flush. Êîìàíäû èìåþò ñëåäóþùóþ ñòðóêòóðó:
+
+ allow <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist> <weekdays> <timeperiodslist>
+ deny <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist> <weekdays> <timeperiodslist>
+ flush
+ Êîìàíäà flush èñïîëüçóåòñÿ äëÿ ñáðîñà ñóùåñòâóþùåãî ñïèñêà äîñòóïà (ýòî
+ íåîáõîäèìî äëÿ òîãî, ÷òîáû ìîæíî áûëî çàäàòü ðàçëè÷íûå ñïèñêè äîñòóïà äëÿ
+ ðàçëè÷íûõ ñëóæá). allow ñëóæèò äëÿ ðàçðåøåíèÿ ñîåäèíåíèÿ, deny - äëÿ çàïðåòà
+ ñîåäèíåíèÿ. Êîìàíäà parent èñïîëüçóåòñÿ â êà÷åñòâå ðàñøèðåíèÿ êîìàíäû
+ allow äëÿ óïðàâëåíèÿ ïåðåíàïðàâëåíèÿìè ñîåäèíåíèé (î ïåðåíàïðàâëåíèè ñì. Êàê óïðàâëÿòü ïåðåíàïðàâëåíèÿìè).
+ Â ìîìåíò óñòàíîâêè èñõîäÿùåãî ñîåäèíåíèÿ ïðîñìàòðèâàåòñÿ ñïèñîê äîñòóïà è
+ íàõîäèòñÿ ïåðâàÿ çàïèñü, ñîîòâåòñòâóþùàÿ çàïðîøåííîìó êëèåíòîì ñîåäèíåíèþ.
+ Åñëè çàïèñü ñîòòâåòñòâóåò allow - ñîåäèíåíèå ðàçðåøàåòñÿ, deny - çàïðåùàåòñÿ.
+ Åñëè ñïèñîê ïóñò, òî ñîåäèíåíèå ðàçðåøàåòñÿ. Åñëè ñïèñîê íå ïóñò, íî ïîäõîäÿùåé
+ çàïèñè íåò, òî ñîåäèíåíèå çàïðåùàåòñÿ. Ïðè ýòîì:
+
+ - <userlist> - ñïèñîê ëîãèíîâ ïîëüçîâàòåëåé ÷åðåç çàïÿòóþ
+
- <sourcelist> - ñïèñîê ñåòåé êëèåíòîâ ÷åðåç çàïÿòóþ. Ñåòü
+ çàäàåòñÿ â ôîðìàòå xxx.yyy.zzz.mmm/l, ãäå l - äëèíà ìàñêè
+ ñåòè (êîëè÷åñòâî íåíóëåâûõ áàéò). Íàïðèìåð, 192.168.1.0/24
+ ñîîòâåòñòâóåò ñåòè ñ ìàñêîé 255.255.255.0.
+
- <targetlist> - ñïèñîê ñåòåé íàçíà÷åíèÿ ÷åðåç çàïÿòóþ
+
- <targetportlist> - ñïèñîê ïîðòîâ íàçíà÷åíèÿ ÷åðåç çàïÿòóþ.
+ ìîæíî çàäàòü äèàïàçîí ïîðòîâ ÷åðåç -, íàïðèìåð, 80,1024-65535
+
- <commandlist> - ñïèñîê êîìàíä, ÷åðåç çàïÿòóþ, äëÿ êîòîðûõ ïðèìåíÿåòñÿ ïðàâèëî:
+
CONNECT - óñòàíîâèòü èñõîäÿùåå TCP ñîåäèíåíèå (íàïðèìåð, SOCKSv4/5, POP3 proxy, è ò.ä.)
+
BIND - ðàçðåøèòü âõîäÿùåå TCP ñîåäèíåíèå (SOCKSv5)
+
UDPASSOC - ñîçäàòü UDP-àññîöèàöèþ (SOCKSv5)
+
ICMPASSOC - ñîçäàòü ICMP-àññîöèàöèþ (íå ðåàëèçîâàíî)
+
HTTP_GET - HTTP GET çàïðîñ (HTTP proxy)
+
HTTP_PUT - HTTP PUT çàïðîñ (HTTP proxy)
+
HTTP_POST - HTTP POST çàïðîñ (HTTP proxy)
+
HTTP_HEAD - HTTP HEAD çàïðîñ (HTTP proxy)
+
HTTP_CONNECT - HTTP CONNECT çàïðîñ (HTTP proxy)
+
HTTP_OTHER - äðóãîé HTTP çàïðîñ (HTTP proxy)
+
HTTP - ñîîòâåòñòâóåò ëþáîìó HTTP çàïðîñó êðîìå HTTP_CONNECT (HTTP proxy)
+
HTTPS - òîæå, ÷òî HTTP_CONNECT (HTTP proxy)
+
FTP_GET - FTP get çàïðîñ
+
FTP_PUT - FTP put çàïðîñ
+
FTP_LIST - FTP list çàïðîñ
+
FTP - ñîîòâåòñòâóåò ëþáîìó FTP çàïðîñó
+
ADMIN - äîñòóï ê èíòåðôåéñó àäìèíèñòðèðîâàíèÿ
+ - <weekdays> çàäàåò ñïèñîê äíåé íåäåëè, 1 ñîîòâåòñòâóåò
+ ïîíåäåëüíèêó, 0 èëè 7 - âîñêðåñåíüå. 1-5 îçíà÷àåò ñ ïîíåäåëüíèêà
+ ïî ïÿòíèöó (âêëþ÷èòåëüíî). 1,3,5 çàäàåò íå÷åòíûå äíè íåäåëè.
+
- <timeperiodslist> ñïèñîê èíòåðâàëîâ äíÿ â ôîðìàòå
+ ××:ÌÌ:ÑÑ-××:ÌÌ:ÑÑ, íàïðèìåð, 00:00:00-08:00:00,17:00:00-24:00:00
+ çàäàåò íåðàáî÷åå âðåìÿ.
+
+ Ïðèìåðû èñïîëüçîâàíèÿ ëèñòîâ äîñòóïà ìîæíî íàéòè â ôàéëå 3proxy.cfg.sample.
+
+ - Êàê óïðàâëÿòü ïåðåíàïðàâëåíèÿìè
+
+ Ïåðåíàïðàâëåíèÿ èìååò ñìûñë èñïîëüçîâàòü, íàïðèìåð, ÷òîáû ïåðåíàïðàâèòü
+ îáðàùåíèÿ îïðåäåëåííûõ êëèåíòîâ èëè íà îïðåäåëííûå ñåðâåðà íà äðóãîé ñåðâåð
+ (íàïðèìåð, ïðè ïîïûòêå äîñòóïà íà Web ñåðâåð ñ íåäîçâîëåííûì ìàòåðèàëîì
+ ïåðåíàïðàâèòü íà ñîáñòâåííûé Web ñåðâåð, èëè äëÿ òîãî, ÷òîáû â çàâèñèìîñòè
+ îò IP êëèåíòà ïåðåíàïðàâëÿòü åãî ñîåäèíåíèÿ íà ðàçíûå ñåðâåðà (îñîáåííî ïðè
+ îòîáðàæåíèè ïîðòîâ ÷åðåç tcppm). Êðîìå òîãî, ïåðåíàïðàâëåíèå ìîæåò áûòü
+ èñïîëüçîâàíî, íàïðèìåð, äëÿ ïåðåíàïðàâëåíèÿ âñå èñõîäÿùèõ HTTP çàïðîñîâ,
+ ïîñëàííûõ ÷åðåç SOCKS, íà HTTP ïðîêñè. Ïîñêîëüêó ôîðìàò çàïðîñà ê Web ñåðâåðó
+ è Proxy ðàçëè÷àåòñÿ, íå ëþáîé Proxy ñåðâåð ñïîñîáåí êîððåêòíî îáðàáîòàòü
+ ïåðåíàïðàâëåííûé çàïðîñ (HTTP proxy â êîìïëåêòå 3proxy íîðìàëüíî îáðàáàòûâàåò
+ ïåðåíàïðàâëåííûå çàïðîñû, ÷òî äåëàåò âîçìîæíûì åãî èñïîëüçîâàíèÿ â êà÷åñòâå
+ "ïðîçðà÷íîãî" ïðîêñè. Êðîìå òîãî, HTTP ïðîêñè îáíàðóæèâàåò ïåðåíàïðàâëåíèÿ
+ íà ðîäèòåëüñêèé ïðîêñè è ãåíåðèðóåò íîðìàëüíûå çàãîëîâêè. Ïðèìåð ïðîñòåéøåãî
+ ïåðåíàïðàâëåíèÿ:
+
+ auth iponly
+ allow *
+ parent 1000 http 192.168.1.1 3128
+ proxy
+ ïåðåíàïðàâëÿåò âåñü òðàôèê ñëóæáû proxy íà ðîäèòåëüñêèé HTTP-ïðîêñè ñåðâåð
+ 192.168.1.1 ïîðò 3128.
+
+ Åñëè â êà÷åñòâå íîìåðà ïîðòà óêàçàí ïîðò 0, òî óêàçàííûé IP àäðåñ èñïîëüçóåòñÿ
+ â êà÷åñòâå âíåøíåãî àäðåñà äëÿ óñòàíîâêè ñîåäèíåíèÿ (àíàëîã -eIP, íî òîëüêî
+ äëÿ çàïðîñîâ ïîïàäàþùèõ ïîä allow).
+
+ Ñïåöèàëüíûì ñëó÷àåì ïåðåíàïðàâëåíèé ÿâëÿþòñÿ ëîêàëüíûå ïåðåíàïðàâëåíèÿ,
+ êîòîðûå, êàê ïðàâèëî, èñïîëüçóþòñÿ ñîâìåñòíî ñî ñëóæáîé socks. Â ëîêàëüíûõ
+ ïåðåíàïðàâëåíèÿõ IP àäðåñ 0.0.0.0 ïîðò 0. Íàïðèìåð,
+
+ auth iponly
+ allow * * * 80
+ parent 1000 http 0.0.0.0 0
+ allow * * * 21
+ parent 1000 ftp 0.0.0.0 0
+ allow * * * 110
+ parent 1000 pop3 0.0.0.0 0
+ socks
+ ïåðåíàïðàâëÿåò âñå ñîäåèíåíèÿ, ïðîõîäÿùèå ÷åðåç SOCKS-ñåðâåð ïî 80 ïîðòó, â
+ ëîêàëüíûé HTTP ïðîêñè, 21-ìó - â FTP, è 110 - â POP3 ïðîêñè. Ïðè ýòîì ñëóæáû
+ proxy, ftppr èëè pop3pr çàïóñêàòü íå òðåáóåòñÿ. Ýòî ìîæåò áûòü ïîëåçíî äëÿ
+ òîãî, ÷òîáû âèäåòü â ëîãàõ çàïèñè î ïîñåùàåìûõ ïîëüçâîàòåëåì ðåñóðñàõ è
+ çàãðóæàåìûõ ôàéëàõ äàæå â òîì ñëó÷àå, åñëè îí ïîäêëþ÷àåòñÿ ÷åðåç SOCKS.
+
+ - Êàê îðãàíèçîâàòü áàëàíñèðîâêó ìåæäó íåñîêëüêèìè êàíàëàìè
+
+ Ñàì ïî ñåáå ïðîêñè íå ìîæåò óïðàâëÿòü ìàðøðóòèçàöèåé ïàêåòîâ ñåòåâîãî óðîâíÿ.
+ Åäèíñòâåííàÿ âîçìîæíîñòü äëÿ óïðàâëåíèÿ âíåøíèìè ñîåäèíåíèÿìè - ýòî âûáîð
+ âíåøíåãî èíòåðôåéñà. Ñäåëàòü âûáîð âíåøíåãî èíòåðôåéñà ñëó÷àéíûì íà÷èíàÿ
+ ñ âåðñèè 0.6 ìîæíî ñ èñïîëüçîâàíèåì ëîêàëüíûõ ïåðåíàïðàâëåíèé (ñ íîìåðîì
+ ïîðòà ðàâíûì íóëþ):
+
+ auth iponly
+ allow *
+ parent 500 http 10.1.1.101 0
+ parent 500 http 10.2.1.102 0
+ áóäåò èñïîëüçîâàòü âíåøíèé èíòåðôåéñ 10.1.1.1 èëè 10.2.1.1 ñ âåðîÿòíîñòüþ 0.5.
+ Âíåøíèé èíòåðôåéñ ýòî òî æå, ÷òî çàäàåòñÿ êîìàíäîé external èëè îïöèåé -e.
+ ×òîáû ýòî ðàáîòàëî êàê îæèäàåòñÿ, íåîáõîäèìî, ÷òîáû ëîêàëüíûì èíòåðôåéñàì
+ 10.1.1.1 è 10.2.1.1 ñîîòâåòñòâîâàëè ðàçíûå ìàðøðóòû ïî-óìîë÷àíèþ.
+
+ Åñëè îáà àäðåñà ïðèíàäëåæàò îäíîé ñåòè, íàïðèìåð, 10.1.1.101 è 10.1.1.102 è
+ íóæíî ñëó÷àéíûì îáðàçîì âûáèðàòü îäèí èç øëþçîâ 10.1.1.1 è 10.1.1.2, òî íóæíî
+ óïðàâëÿòü ðîóòèíãîì ïðèìåðíî òàê (ïðè óñëîâèè ÷òî ìàðøðóò ïî-óìîë÷àíèþ íå
+ çàäàí):
+
+ route add -p 10.1.1.1 10.1.1.101
+ route add -p 10.1.1.2 10.1.1.102
+ route add -p 0.0.0.0 mask 0.0.0.0 192.168.1.1
+ route add -p 0.0.0.0 mask 0.0.0.0 192.168.1.2
+ Åñëè âòîðîãî àäðåñà íà ïðîêñè ñåðâåðå íåò - åãî íàäî äîáàâèòü. Ïîä Linux/Unix
+ ëó÷øå èñïîëüçîâàòü source routing.
+
+ - Êàê ñîñòàâëÿòü öåïî÷êè ïðîêñè
+
+ Äëÿ ñîñòàâëåíèÿ öåïî÷åê ïðîêñè òàê æå ìîæíî èñïîëüçîâàòü êîìàíäó parent, êîòîðàÿ
+ ÿâëÿåòñÿ ðàñøèðåíèåì êîìàíäû allow (ò.å. êîìàíäå parent äîëæíà ïðåäøåñòâîâàòü
+ êîìàíäà allow). Ñ ïîìîùüþ ýòîé êîìàíäû ìîæíî ñòðîèòü öåïî÷êè èç HTTPS
+ (HTTP CONNECT), SOCKS4 è SOCKS5 ïðîêñè (ò.å. ïîñëåäîâàòåëüíî ïîäêëþ÷àòüñÿ
+ ÷åðåç íåñêîëüêî ïðîêñè), ïðè ýòîì âîçìîæíà àâòîðèçàöèÿ íà ðîäèòåëüñêîì ïðîêñè,
+ çâåíî öåïî÷êè ìîæåò âûáèðàòüñÿ ñëó÷àéíûì îáðàçîì èç íåñîëüêèõ çíà÷åíèé
+ ñ âåðîÿòíîñòüþ ñîãëàñíî èõ âåñó. Âåñ (îò 1 äî 1000) çàäàåòñÿ äëÿ êàæäîãî
+ ïðîêñè. Ñóììà âåñîâ ïî âñåì ïåðåíàïðàâëåíèÿì äîëæíà áûòü êðàòíà 1000.
+ Ïðîêñè ñ âåñàìè äî 1000 ãðóïïèðóþòñÿ, è ïðè ïîñòðîåíèè öåïî÷êè îäèí èç íèõ
+ âûáèðàåòñÿ ñëó÷àéíî ñîãëàñíî âåñó. Äëèíà öåïî÷êè îïðåäåëÿåòñÿ èç ñóììàðíîãî
+ âåñà. Íàïðèìåð, åñëè ñóììàðíûé âåñ öåïî÷êè 3000, â öåïî÷êå áóäåò 3 çâåíà (õîïà).
+ Ñèíòàêñèñ êîìàíäû:
+
+ parent <weight> <type> <ip> <port> <username> <password>
+ weight - âåñ ïðîêñè, type - òèï ïðîêñè (tcp - ïåðåíàïðàâëåíèå ñîåäèíåíèÿ,
+ ìîæåò áûòü òîëüêî ïîñëåäíèì â öåïî÷êå, http - ñèíîíèì tcp, connect - HTTP
+ CONNECT/HTTPS ïðîêñè, socks4 - SOCKSv4 ïðîêñè, socks5 - SOCKSv5 ïðîêñè),
+ ip - IP àäðåñ ïðîêñè, port - ïîðò ïðîêñè, username - èìÿ äëÿ àâòîðèçàöèè
+ íà ïðîêñè (îïöèîíàëüíî), password - ïàðîëü äëÿ àâòîðèçàöèè íà ïðîêñè
+ (îïöèîíàëüíî).
+
Ïðèìåð:
+
+ allow *
+ parent 500 socks5 192.168.1.1 1080
+ parent 500 connect 192.168.10.1 3128
+ Ñîçäàåò öåïî÷êó èç îäíîãî çâåíà (ñóììàðíûé âåñ 1000), â êîòîðîì îäèí èç äâóõ
+ ïðîêñè âûáèðàåòñÿ ñëó÷àéíî ñ ðàâíîé âåðîÿòíîñòüþ (âåñà ðàâíû).  öåïî÷êó
+ ïåðåíàïðàâëÿþòñÿ âñå èñõîäÿùèå ñîåäèíåíèÿ (îïðåäåëÿåòñÿ êîìàíäîé allow).
+
+ allow * * * 80
+ parent 1000 socks5 192.168.10.1 1080
+ parent 1000 connect 192.168.20.1 3128
+ parent 300 socks4 192.168.30.1 1080
+ parent 700 socks5 192.168.40.1 1080
+ Ñîçäàåò öåïî÷êó èç òðåõ çâåíüåâ (ñóììàðíûé âåñ 3000). Ïåðâîå çâåíî -
+ 192.168.10.1, âòîðîå - 192.168.20.1, à òðåòüå - ëèáî 192.168.30.1 ñ
+ âåðîÿòíîñòüþ 0.3 ëèáî 192.168.40.1 ñ âåðîÿòíîñòüþ 0.7
+
+ - Êàê îãðàíè÷èâàòü ñêîðîñòè ïðèåìà
+
+ 3proxy ïîçâîëÿåò óñòàíàâëèâàòü ôèëüòðû øèðèíû ïîòðåáëÿåìîãî êàíàëà. Äëÿ ýòîãî
+ ñëóæàò êîìàíäû bandlimin/bandlimout è nobandlimin/nobandlimout
+ (in â êîìàíäå îçíà÷àåò, ÷òî ïðàâèëî ïðèìåíÿåòñÿ ê âõîäÿùåìó òðàôèêó,
+ out - ê èñõîäÿùåìó).
+
+ bandlimin <bitrate> <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+ nobandlimin <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
+ bitrate óêàçûâàåò øèðèíó ïîòîêà â áèòàõ â ñåêóíäó (èìåííî â áèòàõ). Â îñòàëüíîì
+ êîìàíäû àíàëîãè÷íû êîìàíäàì allow/deny ñ òåì îòëè÷èåì, ÷òî êîìàíäû bandlim
+ íå èìåþò ïðèâÿçêè ê êîíêðåòíîìó ñåðâèñó, òàêîìó êàê HTTP ïðîêñè èëè SOCKS
+ è äåéñòâóþò íà âñå ñåðâèñû, òðàôèê ïî âñåì ñîåäèíåíèÿì, ïîïàâøèì ïîä äåéñòâèå
+ ïðàâèëà ñóììèðóåòñÿ íåçàâèñèìî îò òîãî, ÷åðåç êàêîé ñåðâèñ ýòî ñîåäèíåíèå
+ óñòàíîâëåíî.
+
+ bandlimin 57600 * 192.168.10.16
+ bandlimin 57600 * 192.168.10.17
+ bandlimin 57600 * 192.168.10.18
+ bandlimin 57600 * 192.168.10.19
+ óñòàíàâàëèåò êàíàë 57600 äëÿ êàæäîãî èç ÷åòûðåõ êëèåíòîâ,
+
+ bandlimin 57600 * 192.168.10.16/30
+ óñòàíàâàëèàåò ñóììàðíûé êàíàë 57600 íà 4-õ êëèåíòîâ. Åñëè íåîáõîäèìî, ÷òîáû íà
+ êàêîé-òî ñåðâèñ íå áûëî îãðàíè÷åíèÿ øèðèíû êàíàëà, ñëåäóåò óêàçàòü nobandlim
+ äëÿ ýòîãî ñåðâèñà, íàïðèìåð:
+
+ nobandlimin * * * 110
+ bandlimin 57600 * 192.168.10.16/32
+ ðàçðåøàåò êëèåíòàì íåîãðàíè÷åííûé ïî ñêîðîñòè äîñòóï ïî ïðîòîêîëó POP3.
+
+ - Êàê îãðàíè÷èâàòü îáúåì ïðèíèìàåìîãî òðàôèêà
+
+
+ counter <filename> <type> <reportpath>
+ countin <number> <type> <amount> <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+ nocountin <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+ countout <number> <type> <amount> <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+ nocountout <userlist> <sourcelist> <targetlist> <targetportlist> <commandlist>
+
+ Êîìàíäû ïîçâîëÿþò óñòàíîâèòü ëèìèò òðàôèêà íà äåíü, íåäåëþ èëè ìåñÿö.
+ Ñâåäåíèÿ î òðàôèêå ïîñòîÿííî ñîõðàíÿþòñÿ â äâîè÷íîì ôàéëå, óêàçûâàåìîì
+ êîìàíäîé counter, ÷òî äåëàåò ïîäñ÷åò òðàôèêà íåçàâèñèìûì îò
+ ïåðåçàãðóçêè ïðîêñè. Ìîæíî óïðàâëÿòü äâîè÷íûì ôàéëîì, èñïîëüçóÿ óòèëèòó
+ countersutil.
+ Äåéñòâèå êîìàíä countin/nocountin àíàëîãè÷íî äåéñòâèþ bandlimin/nobandlimin,
+ number - çàäàåò ïîñëåäîâàòåëüíûé íîìåð ñ÷åò÷èêà, íîìåð äîëæåí áûòü
+ óíèêàëüíûì ïîëîæèòåëüíûì ÷èñëîì. Çíà÷åíèå 0 óêàçûâàåò, ÷òî ñâåäåíèÿ
+ äëÿ äàííîãî ñ÷åò÷èêà íå íàäî ñîõðàíÿòü â ôàéëå.
+
+ reportpath - ïóòü, ïî êîòîðîìó áóäóò ñîçäàâàòüñÿ òåêñòîâûå îò÷åòû ïî
+ ïîòðåáëåííîìó òðàôèêó.
+
+ type - òèï îãðàíè÷åíèÿ èëè ÷àñòîòà ñîçäàíèÿ ôàéëîâ îò÷åòà.
+ D (Íà äåíü), W (íà íåäåëþ) èëè M (íà ìåñÿö).
+
+ amount - îáúåì òðàôèêà íà óêàçàííûé ïåðèîä â ìåãàáàéòàõ.
+
+ - Êàê ñòðîèòü ñïèñêè ñåòåé
+
+ Î÷åíü ÷àñòî ñïèñêè ñåòåé è ïîëüçîâàòåëåé áûâàþò äîñòàòî÷íî ãðîìîçäêèìè.
+ 3proxy íå ïîääåðæèâàåò ñîçäàíèå ãðóïï, íî ïîçâîëÿåò âêëþ÷åíèå ôàéëîâ. Ýòî
+ îçíà÷àåò, ÷òî äëÿ óäîáñòâà àäìèíèñòðèðîâàíèÿ âûãîäíî õðàíèòü ñïèñêè
+ ïîëüçîâàòåëåé è ñïèñêè ñåòåé â îòäåëüíûõ ôàéëàõ è ïðè íåîáõîäèìîñòè äàòü
+ ïîëüçîâàòåëþ äîñòóï ê òîìó èëè èíîìó ðåñóðñó, ïðàâèòü ôàéë ñî ñïèñêîì
+ ïîëüçîâàòåëåé èëè ñåòåé âìåñòî òîãî, ÷òîáû ïðàâèòü ñàì ôàéë 3proxy.cfg. Â ôàéëå
+ 3proxy.cfg ôàéë ñî ñïèñêîì ìîæíî âêëþ÷èòü ñ ïîìîùüþ ìàêðîñà $.
+ Ïîñêîëüêó â 3proxy åñòü îãðàíè÷åíèÿ íà ìàêñèìàëüíûé ðàçìåð ýëåìåíòà
+ êîíôèãóðàöèè, áîëüøèå ñïèñêè ñëåäóåò ðàçáèâàòü íà íåñêîëüêî ôàéëîâ è
+ èñïîëüçîâàòü íåñêîëüêî çàïèñåé ñïèñêà êîíòðîëÿ äîñòóïîì.
+ Â êîìïëåêòå ñ 3proxy ïîñòàâëÿåòñÿ óòèëèòà dighosts, êîòîðàÿ ïîçâîëÿåò ïîñòðîèòü
+ ñïèñîê ñåòåé ïî ñòðàíèöå Web. Óòèëèòà îñóùåñòâëÿåò ïîèñê àäðåñîâ íà Web-ñòðàíèöå
+ â ôîðìàòå ÀÄÐÅÑ ÌÀÑÊÀ èëè ÀÄÐÅÑ/ÄËÈÍÀ. Óòèëèòó dighosts ìîæíî âûçâàòü âî âðåìÿ
+ ñòàðòà 3proxy, èñïîëüçóÿ êîìàíäó system. Íàïðèìåð:
+
+ system "dighosts http://provider/network.html local.networks"
+ allow * * $local.networks
+ allow *
+ parent 1000 proxy.provider 3128 *
+ proxy
+ flush
+  äàííîì ñëó÷àå â ôàéëå local.networks ãåíåðèðóåòñÿ ñïèñîê ëîêàëüíûõ ñåòåé ïî
+ ñòðàíèöå networklist.html. Äàëåå èñïîëüçóåòñÿ ñïèñîê êîíòðîëÿ äîñòóïà äëÿ òîãî,
+ ÷òîáû ðàçðåøèòü ëîêàëüíîìó ïðîêñè-ñåðâåðó äîñòóï ê ëîêàëüíûì ñåòÿì íàïðÿìóþ,
+ à âñå îñòàëüíûå çàïðîñû ïåðåíàïðàâèòü íà ïðîêñè-ñåðâåð ïðîâàéäåðà.
+
+ - Êàê óïðàâëÿòü ðàçðåøåíèåì èìåí è êýøèðîâàíèåì DNS
+
+ Äëÿ ðàçðåøåíèÿ èìåí è êýøèðîâàíèÿ ïðèìåíÿþòñÿ êîìàíäû nserver,
+ nscache è nsrecord.
+
+ nserver 192.168.1.2
+ nserver 192.168.1.3
+ óêàçûâàåò 3proxy êàêèå ìàøèíû ñëåäóåò èñïîëüçâîàòü â êà÷åñòâå ñåðâåðîâ
+ DNS. Ñåðâåð 192.168.1.3 áóäåò èñïîëüçîâàòüñÿ òîëêüî ïðè íåäîñòèæèìîñòè
+ 192.168.1.2. Ìîæíî óêàçàòü äî 5 ñåðâåðîâ. Åñëè nserver íå óêàçàí, áóäóò
+ èñïîëüçîâàíû ñèñòåìíûå ôóíêöèè ðàçðåøåíèÿ èìåí.
+
+ nscache 65535
+ óêàçûâàåò ðàçìåð êýøà äëÿ ðàçðåøåíèÿ èìåí (îáû÷íî äîñòàòî÷íî áîëüøîé).
+ Êýø èñîïëüçóåòñÿ òîëüêî ïðè ÿâíîì óêàçàíèè nserver.
+
+ nsrecord server.mycompany.example.com 192.168.1.1
+ nsrecord www.porno.com 127.0.0.2
+ ...
+ deny * * 127.0.0.2
+ äîáàâëÿåò ñòàòè÷åñêóþ çàïèñü â êýø.
+ - Êàê óñòàíàâëèâàòü ñîåäèíåíèå ïî òðåáîâàíèþ
+
+ Êîìàíäà dialer çàäàåò ïðîãðàììó, êîòîðàÿ áóäåò çàïóñêàòüñÿ ïðè
+ íåâîçìîæíîñòè ðàçðåøèòü èìÿ êîìïüþòåðà, íàïðèìåð:
+
+ dialer "rasdial PROVIDER"
+ (îïèñàíèå rasdial ìîæíî íàéòè íà ñåðâåðå ïîääåðæêè Microsoft).
+ Åñòü äâà àñïåêòà: íåâîçìîæíîñòü ðàçðåøåíèÿ èìåíè åùå íå ñâèäåòåëüñòâóåò
+ îá îòñóòñòâèè ñîåäèíåíèÿ (ýòî äîëæíà ó÷èòûâàòü âûçûâàåìàÿ ïðîãðàììà),
+ ïðè èñïîëüçîâàíèè nscache èìÿ ìîæåò ðàçðåøèòüñÿ ïðè îòñóòñòâèè
+ ñîåäèíåíèÿ.  òàêèõ ñëó÷àÿõ ïîëåçíî çàïðàøèâàòü çàâåäîìî íåñóùåñòâóþùèé
+ ðåñóðñ, íàïðèìåð, http://dial.right.now/.
+
+
+
+Êîíôèãóðàöèÿ êëèåíòîâ
+
+
+ - Êàê èñïîëüçîâàòü 3proxy ñ Internet Explorer èëè äðóãèì áðàóçåðîì
+
Ìû áóäåì ðàññìàòðèâàòü Interenet Explorer, ò.ê. ó íåãî áîëüøå îñîáåííîñòåé
+ íàñòðîéêè, ñ äðóãèìè áðàóçåðàìè äîëæíî âîçíèêàòü ìåíüøå âîïðîñîâ.
+
Åñòü äâà îñíîâíûõ ñïîñîáà ðàáîòû ñ 3proxy - èñïîëüçîâàòü HTTP ïðîêñè (ñåðâèñ
+ proxy) èëè SOCKS ïðîêñè (ñåðâèñ socks). Îáû÷íî èñïîëüçóåòñÿ HTTP ïðîêñè. Äëÿ
+ SOCKS ïðîêñè ìîæíî èñïîëüçîâàòü âñòðîåííóþ ïîääåðæêó áðàóçåðà èëè
+ ïðîãðàììó-ñîêñèôèêàòîð (ñì.
+ Êàê èñïîëüçîâàòü 3proxy ñ ïðîãðàììîé, íå ïîääåðæèâàþùåé ðàáîòó ñ ïðîêñè-ñåðâåðîì),
+ åñëè âñòðîåííàÿ ïîääåðæêà SOCKS ÷åì-òî íå óñòðàèâàåò èëè òàê óäîáíåå. Íå âñå
+ ñîêñèôèêàòîðû ïîääåðæèâàþò âõîäÿùèå ñîåäèíåíèÿ, ïîýòîìó ÷òîáû íå áûëî ïðîáëåì ñ
+ ïðîòîêîëîì FTP ëó÷øå èñïîëüçîâàòü ïàññèâíûé ðåæèì (â Internet Explorer 5.5SP2
+ è âûøå "Èñïîëüçîâàòü ïàññèâíûé FTP-ïðîòîêîë").
+
Äëÿ êîíôèãóðàöèè HTTP ïðîêñè íåîáõîäèìî óêàçàòü âíóòðåííèé àäðåñ è ïîðò,
+ óñòàíîâëåíûå äëÿ ñëóæáû proxy â êîíôèãóðàöèè 3proxy (ëèáî êàê "Îäèí
+ ïðîêñè-ñåðâåð äëÿ âñåõ ïðîòîêîëîâ" ëèáî äëÿ HTTP, Secure, FTP). Ïîääåðæêà
+ Gopher â 3proxy â íàñòîÿùèé ìîìåíò íå ðåàëèçîâàíà, íî ýòîò óñòàðåâøèé ïðîòîêîë
+ â Internet ïðàêòè÷åñêè íå èñïîëüçóåòñÿ. Äëÿ íîðìàëüíîé ðàáîòû FTP ÷åðåç HTTP
+ ïðîêñè íåîáõîäèìî îòêëþ÷èòü ïðåäñòàâëåíèå äëÿ ïàïîê FTP (FTP folder view),
+ îí âêëþ÷åí ïî-óìîë÷àíèþ, ò.ê. èíà÷å FTP áóäåò ðàáîòàòü áåç èñïîëüçâàíèÿ HTTP
+ ïðîêñè. HTTP ïðîêñè èñïîëüçóåò ïàññèâíûé ðåæèì äëÿ ïðîòîêîëà FTP. Â íàñòðîéêàõ
+ 3proxy ðåêîìåíäóåòñÿ ðàçðåøòü ìåòîä HTTP_CONNECT òîëüêî äëÿ ïîðòà íàçíà÷åíèÿ 443.
+ Åñëè ìåòîä HTTP_CONNECT íå ðàçðåøåí, òî íå áóäåò ðàáîòàòü ïðîòîêîë HTTPS, åñëè
+ îí ðàçðåøåí äëÿ âñåõ ïîðòîâ, òî ìîæíî îáîéòè æóðíàëèðîâàíèå çàïðîñîâ äëÿ
+ ïðîòîêîëà HTTP).
+ Äëÿ ðàáîòû ñ HTTP ïðîêñè ìîæåò èñïîëüçîâàòüñÿ àâòîðèçàöèÿ ïî ïàðîëþ (strong).
+
Äëÿ èñïîëüçîâàíèÿ SOCKS íåîáõîäèìî íàñòðîèòü òîëüêî SOCKS ïðîêñè (èíà÷å äëÿ
+ ïðîòîêîëîâ, äëÿ êîòîðûõ óêàçàí ïðîêñè ñåðâåð, îí áóäåò èñïîëüçîâàòüñÿ êàê HTTP
+ ïðîêñè). Internet Explorer (âêëþ÷àÿ IE 6.0SP1)
+ ïîääåðæèâàåò òîëüêî SOCKSv4.  êà÷åñòâå èìåíè ïîëüçîâàòåëÿ ïåðåäàåòñÿ èìÿ
+ ïîëüçîâàòåëÿ, èñïîëüçîâàííîå äëÿ âõîäà â ñèñòåìó. Ïåðåäà÷à ïàðîëÿ â SOCKSv4 íå
+ ïîääåðæèâàåòñÿ, ïîýòîìó àâòîðèçàöèÿ ïî ïàðîëþ (strong) íå äîñòóïíà. Ìîæíî
+ èñïîëüçîâàòü èìÿ ïîëüçîâàòåëÿ, ïåðåäàííîå áðàóçåðîì â ACL äëÿ iponly-àâòîðèçàöèè,
+ íî ïðè ýòîì íåîáõîäèìî èìåòü ââèäó íåíàäåæíîñòü òàêîãî ñïîñîáà. Ïðè ðàáîòå ÷åðåç
+ SOCKS Internet Explorer (è áîëüøàÿ ÷àñòü äðóãèõ áðàóçåðîâ) èñïîëüçóþò ïàññèâíûé
+ ðåæèì ðàáîòû äëÿ FTP. Ïðè èñïîëüçîâàíèè SOCKS ìîæíî ïîëó÷èòü â æóðíàëå (ëîãàõ)
+ URL çàïðàøèâàåìûõ ñòðàíèö, äëÿ ýòîãî íåîáõîäèìî ñîçäàòü âíóòðåííåå
+ ïåðåíàïðàâëåíèå â HTTP ïðîêñè äëÿ ïîðòà 80 (è äðóãèõ ïîðòîâ, èñïîëüçóåìûõ äëÿ
+ HTTP) â ëîêàëüíûé HTTP ïðîêñè (proxy), ïîðò 21 (è äðóãèå ïîðòû, èñïîëüçóåìûå
+ FTP) â FTP ïðîêñè. Ïðè ïåðåíàïðàâëåíèè ñîåäèíåíèé â FTP ïðîêñè, íóæíî èìåòü
+ ââèäó, ÷òî FTP ñîçäàåò âòîðè÷íûå ñîåäèíåíèÿ äëÿ ïåðåäà÷è äàííûõ. Äëÿ ýòîãî,
+ âî-ïåðâûõ, íåîáõîäèìî ðàçðåøèòü äîñòóï ê âíóòðåííåìó èíòåðôåéñó ïðîêñè ñåðâåðà
+ ÷åðåç SOCKS (÷òî íå î÷åíü áåçîïàñíî), âî-âòîðûõ, ïðèíÿòü ìåðû, ÷òîáû â SOCKS
+ òàêèå ñîåäèíåíèÿ íà âíóòðåííèé èíòåðôåéñ íå òàðèôèöèðîâàëèñü (ò.ê. èíà÷å îíè
+ áóäóò òàðèôèöèðîâàòüñÿ äâàæäû - SOCKS è FTP ïðîêñè).
+
Internet Explorer è äðóãèå ïðîäâèíóòûå áðàóçåðû ïîääåðæèâàþò àâòîìàòè÷åñêóþ
+ êîíôèãóðàöèþ ïðîêñè-ñåðâåðà â ïîëíîñòüþ àâòîìàòè÷åñêîì èëè ïîëóàâòîìàòè÷åñêîì
+ ðåæèìàõ. Àâòîìàòè÷åñêàÿ êîíôèãóðàöèÿ ïîçâîëÿåò çàäàòü äîñòàòî÷íî ñëîæíûå
+ ïðàâèëà, ïîçâîëÿþùèå êëèåíòàì èñïîëüçîâàòü (èëè íå èñïîëüçâîàòü) ðàçíûå
+ ïðîêñè-ñåðâåðû äëÿ äîñòóïà ê ðàçíûì ðåñóðñàì. Ýòà âîçìîæíîñòü ðàçáèðàåòñÿ â
+ ñòàòüÿõ
+
Microsoft: Q296591 A Description of the Automatic Discovery Feature
+
http://support.microsoft.com/default.aspx?scid=kb;EN-US;296591
+
Netscape: Navigator Proxy Auto-Config File Format
+
http://wp.netscape.com/eng/mozilla/2.0/relnotes/demo/proxy-live.html
+
- Êàê íàñòðàèâàòü FTP êëèåíò
+
+ Íàñòðîéêà FTP êëèåíòà äëÿ ðàáîòû ÷åðåç SOCKS ïðîêñè íå îòëè÷àåòñÿ îò íàñòðîéêè
+ áðàóçåðà.
+
+ Äëÿ ðàáîòû ñ FTP êëèåíòîì ÷åðåç FTP ïðîêñè (ftppr) åñòü íåñêîëüêî âîçìîæíîñòåé.
+ Äîïóñòèì, íàì íåîáõîäèìî ïîäêëþ÷èòüñÿ êî âíåøíåìó FTP ñåðâåðó ñî ñëåäóþùèìè
+ ïàðàìåòðàìè:
+
+ Àäðåñ: ftp.security.nnov.ru
+ Username: ftpuser
+ Password: ********
+ Ðàáîòà ñ êëèåíòîì, íå ïîääåðæèâàþùèì FTP ïðîêñè - â êà÷åñòâå àäðåñà FTP
+ ñåðâåðà óêàçûâàåòñÿ àäðåñ ïðîêñè (íàïðèìåð, proxy.security.nnov.ru), â êà÷åñòâå
+ èìåíè ïîëüçîâàòåëÿ ftpuser@ftp.security.nnov.ru. Åñëè äëÿ äîñòóïà ê ñëóæáå
+ ftppr òðåáóåòñÿ àâòîðèçàöèÿ ïî èìåíè è ïàðîëþ ñ èìåíåì pruser è ïàðîëåì prpass,
+ òî â êà÷åñòâå èìåíè ïîëüçîâàòåëÿ íåîáõîäèìî óêàçàòü
+ pruser:prpass:ftpuser@ftp.security.nnov.ru. Åñëè FTP êëèåíò òðåáóåò óêàçàíèÿ
+ ïîëíîé URL äëÿ ïîäêëþ÷åíèÿ ê ñåðâåðó, òî îíà äîëæíà âûãëÿäåòü êàê
+
+ pruser:prpass:ftpuser@ftp.security.nnov.ru:********@proxy.security.nnov.ru
+
+ Íå âñå êëèåíòû îáðàáîòàþò ýòî êîððåêòíî, íî â áîëüøèíñòâå ñëó÷àåâ ýòîãî íå
+ òðåáóåòñÿ.
+
Ðàáîòà ñ êëèåíòîì, ïîääåðæèâàþùèì FTP ïðîêñè - åñëè 3proxy
+ íå òðåáóåò àâòîðèçàöèè ïî ïàðîëþ, òî íàñòðîéêè ñòàíäàðòíû äëÿ êëèåíòà. Åñëè
+ òðåáóåòñÿ äîñòóï ïî ïàðîëþ, òî â êà÷åñòâå èìåíè ïîëüçîâàòåëÿ óêàçûâàåòñÿ
+ pruser:prpass:ftpuser.
+
- Êàê èñïîëüçîâàòü SMTP ÷åðåç 3proxy
+
+  áîëüøèíñòâå ñëó÷àåâ äîñòàòî÷íî óñòàíîâèòü îòîáðàæåíèå (tcppm) TCP ïîðòà 25 íà
+ àíàëîãè÷íûé ïîðò SMTP ñåðâåðà ïðîâàéäåðà.  êîíôèãóðàöèè êëèåíòà óêàçàòü
+ âíóòðåííèé àäðåñ ïðîêñè â êà÷åñòâå àäðåñà SMTP-ñåðâåðà.
+
- Êàê èñïîëüçîâàòü POP3 proxy
+
+ Ïðåäïîëîæèì, ó âàñ åñòü ñëåäóþùèå íàñòðîéêè äëÿ ïîëó÷åíèÿ ïî÷òû:
+
+ POP3 server: pop3.security.nnov.ru
+ Login: user
+ Password: ********
+ Â íàñòðîéêàõ ïî÷òîâîé ïðîãðàììû ñëåäóåò óêàçàòü:
+
+ POP3 server: (àäðåñ ïðîêñè-ñåðâåðà)
+ Login: user@pop3.security.nnov.ru
+ Password: ********
+
+ Èìÿ ïîëüçîâàòåëÿ ìîæåò ñàìî ïî ñåáå ñîäåðæàòü çíàê '@'. Åñëè â ïðèìåðå âûøå
+ èìÿ ïîëüçîâàòåëÿ user@security.nnov.ru, òî èìÿ ïîëüçâîàòåëÿ äëÿ äîñòóïà ê
+ ïðîêñè-ñåðâåðó äîëæíî áûòü user@security.nnov.ru@pop3.security.nnov.ru. Åñëè
+ pop3pr òðåáóåò àâòîðèçàöèè ïî èìåíè/ïàðîëþ (íàïðèìåð, pruser è prpass), òî èõ
+ íåîáõîäèìî óêàçàòü â íà÷àëå èìåíè ïîëüçîâàòåëÿ, îòäåëèâ çíàêîì ':', ò.å äëÿ
+ ñàìîãî òÿæåëîãî ñëó÷àÿ pruser:prpass:user@security.nnov.ru@pop3.security.nnov.ru
+
+ - Êàê èñïîëüçîâàòü 3proxy ñ ïðîãðàììîé, íå ïîääåðæèâàþùåé ðàáîòó ñ ïðîêñè-ñåðâåðîì
+
+ Ìîæíî èñïîëüçîâàòü ëþáóþ ïðîãðàììó-ðåäèðåêòîð, íàïðèìåð,
+ SocksCAP èëè
+ FreeCAP. 3proxy ïîääåðæèâàåò èñõîäÿùèå
+ è îáðàòíûå TCP è UDP ñîåäèíåíèÿ, íî ðåäèðåêòîðû ìîãóò èìåòü ñâîè îãðàíè÷åíèÿ,
+ êðîìå òîãî, íåêîòîðûå ïëîõî íàïèñàíûå ïðèëîæåíèÿ íå ïîääàþòñÿ "ñîêñèôèêàöèè".
+ Åñëè ïðîãðàììå òðåáóåòñÿ îáðàùàòüñÿ ê íåáîëüøîìó íàáîðó ñåðâåðîâ
+ (íàïðèìåð, èãðîâûõ), òî ïðîáëåìó ìîæíî ðåøèòü ñ ïîìîùüþ ïîðòìàïïèíãà.
+
- Êàê èñïîëüçîâàòü 3proxy ñ èãðàìè
+
+ Îïòèìàëüíûé âàðèíò - èñïîëüçîâàòü ñîêñèôèêàòîð (Êàê èñïîëüçîâàòü
+ 3proxy ñ ïðîãðàììîé, íå ïîääåðæèâàþùåé ðàáîòó ñ ïðîêñè-ñåðâåðîì).
+ FreeCap 3.13 ïðîâåðåí ñ èãðàìè íà äâèæêå
+ Unreal (âêëþ÷àÿ Unreal Tournament), Half-Life (âêëþ÷àÿ Counter-Strike) è
+ äðóãèìè. Åñëè ïî êàêèì-òî ïðè÷èíàì ñîêñèôèêàòîð íå ðàáîòàåò èëè íåäîñòóïåí,
+ òî íåîáõîäèìî èñïîëüçîâàòü îòîáðàæåíèÿ ïîðòîâ (îáû÷íî èãðû,
+ êðîìå mood-ïîäîáíûõ, ðàáîòàþò ïî ïðîòîêîëó UDP, íàäî èñïîëüçîâàòü udppm).
+ Íóæíî èìåòü ââèäó, ÷òî äëÿ udppm òðåáóåòñÿ îòäåëüíûé ìàïïèíã äëÿ êàæäîãî
+ ñåðâåðíîãî ïîðòà è êàæäîãî êëèåíòà. Íàïðèìåð, åñëè åñòü îäèí ñåðâåð ñ ïîðòàìè
+ 2115 è 2116 è òðè êëèåíòà, òî íóæíî ñîçäàòü 6 ðàçíûõ ìàïïèíãîâ, íàïðèìåð
+
+ udppm 12115 server 2115
+ udppm 12115 server 2115
+ udppm 22115 server 2115
+ udppm 32115 server 2115
+ udppm 12116 server 2116
+ udppm 22116 server 2116
+ udppm 32116 server 2116
+ Â èãðîâîì êëèåíòå àäðåñ è ïîðò ñ ìàïïèíãîì ñëåäóåò óêàçûâàòü âìåñòî àäðåñà
+ è ïîðòà ñåðâåðà.
+
+
+
+Àäìèíèñòðèðîâàíèå è àíàëèç èíôîðìàöèè
+
+
+ - Ãäå âçÿòü ñâåæóþ âåðñèþ
+
+ Ñâåæóþ âåðñèþ âñåãäà ìîæíî âçÿòü
+ çäåñü. Îáðàòèòå âíèìàíèå,
+ ÷òî â íîâîé âåðñèè ìîæåò èçìåíèòüñÿ ïîðÿäîê ëèöåíçèðîâàíèÿ èëè êîìàíäû
+ êîíôèãóðàöèè, ïîýòîìó ïðåæäå ÷åì óñòàíàâëèâàòü íîâóþ âåðñèè ïðîãðàììû
+ îáÿçàòåëüíî îçíàêîìüòåñü ñ äîêóìåíòàöèåé.
+
+ - Êàê óïðàâëÿòü ñëóæáîé 3proxy â Windows NT/2000/XP
+
+ Ïðè óñòàíîâêå 3proxy â êà÷åñòâå ñèñòåìíîé ñëóæáû ñåðâåðîì ïîääåðæèâàþòñÿ
+ êîìàíäû çàïóñêà, îñòàíîâêè, âðåìåííîé ïðèîñòàíîâêè è ïðîäîëæåíèÿ.
+ Ïðè âðåìåííîé ïðèîñòàíîâêå ñåðâåð ïåðåñòàåò ïðèíèìàòü íîâûå çàïðîñû îò
+ êëèåíòîâ, íî îáðàáîòêà ðàíåå ïîñòóïèâøèõ çàïðîñîâ ïðîäîëæàåòñÿ. Ñåðâåð íå
+ ïîäåðæèâàåò äèíàìè÷åñêîå èçìåíåíèå êîíôèãóðàöèè, ò.å. ïîñëå èçìåíåíèÿ
+ êîíôèãóðàöèè 3proxy íåîáõîäèìî ïåðåçàïóñòèòü.
+ Óïðàâëÿòü çàïóñêîì, îñòàíîâêîé, ïðèîñòàíîâêîé è ïðîäîëæåíèåì ìîæíî ëèáî
+ ÷åðåç ñëóæåáíóþ ïðîãðàììó "Ñëóæáû" (Services) ëèáî ÷åðåç êîìàíäó net:
+
+ net start 3proxy
+ net stop 3proxy
+ net pause 3proxy
+ net continue 3proxy
+
+ - Êîäû îøèáîê â æóðíàëå
+
+
+ - 0 - îïåðàöèÿ çàâåðøåíà óñïåøíî (â ñëó÷àå óñòàíîâëåííîãî
+ ñîåäèíåíèÿ - ñîåäèíåíèå çàêðûòî êîððåêòíî îäíîé èç
+ ñòîðîí).
+
- 1-9 - îøèáêè àâòîðèçàöèè
+
- 1 - äîñòóï çàêðûò ACL (deny)
+
- 2 - ïåðåíàïðàâëåíèå (íå äîëæíî áûòü â æóðíàëå)
+
- 3 - íåò çàïèñè ACL äëÿ äàííîãî ñîåäèíåíèÿ
+
- 4 - íå îïðåäåëåíî èìÿ ïîëüçîâàòåëÿ äëÿ auth strong
+
- 5 - íå íàéäåíî èìÿ ïîëüçîâàòåëÿ äëÿ auth strong
+
- 6 - íåâåðíûé ïàðîëü (îòêðûòûé òåêñò)
+
- 7 - íåâåðíûé ïàðîëü (crypt)
+
- 8 - íåâåðíûé ïàðîëü (NT)
+
- 9 - íåäîñòàòî÷íî äàííûõ äëÿ ïåðåíàïðàâëåíèÿ (íå äîëæíî áûòü â æóðíàëå)
+
- 10 - ïðåâûøåí ëèìèò òðàôèêà
+
- 11-19 - îøèáêè ñîåäèíåíèÿ
+
- 11 - íåâîçìîæíî ñîçäàòü ñîêåò socket()
+
- 12 - íåâîçìîæíî âûáðàòü èíòåðôåéñ bind()
+
- 13 - ñáîé ïîäêëþ÷åíèÿ connect()
+
- 14 - ñáîé getpeername()
+
- 20-29 - îáùèå îøèáêè
+
- 21 - îøèáêà âûäåëåíèÿ ïàìÿòè
+
- 30-39 - îøèáêè ïåðåíàïðàâëåíèÿ CONNECT
+
- 31 - íåâîçìîæíî ïîñëàòü çàïðîñ ê CONNECT ïðîêñè
+
- 32 - ïðåâûøåíî îæèäàíèå èëè íåêîððåêòíûé îòâåò CONNECT ïðîêñè
+
- 33 - CONNECT ïðîêñè íå ìîæåò óñòàíîâèòü ñîåäèíåíèå
+
- 34 - ïðåâûøåíî îæèäàíèå èëè îáðûâ ñîåäèíåíèÿ ïðè ñîãëàñîâàíèè CONNECT ñîåäèíåíèÿ
+
- 40-49 - îøèáêè ïåðåíàïðàâëåíèÿ SOCKS4
+
- 50-69 - îøèáêè ïåðåíàïðàâëåíèÿ SOCKS5
+
- 70-79 îøèáêè óñòàíîâêè ðîäèòåëüñêîãî ñîåäèíåíèÿ, àíàëîãè÷íû 1x
+
- 90-99 - îøèáêè ðàçðûâà ñîåäèíåíèÿ
+
- 90 - îøèáêà ñîêåòà èëè ñîåäèíåíèå íåîæèäàííî ïðåðâàíî
+
- 91 - îáùèé ñáîé ñòåêà TCP/IP
+
- 92 - ñîåäèíåíèå ïðåðâàíî ïî òàéìàóòó
+
- 93 - îøèáêà ïîëó÷åíèÿ äàííûõ îò ñåðâåðà
+
- 94 - îøèáêà ïîëó÷åíèÿ äàííûõ îò êëèåíòà
+
- 95 - òàéìàóò èç-çà îãðàíè÷åíèÿ bandlimin/bandlimout
+
- 96 - îøèáêà îòïðàâêè äàííûõ êëèåíòó
+
- 97 - îøèáêà îòïðàâêè äàííûõ ñåðâåðó
+
- 98 - èñ÷åðïàí ëèìèò äàííûõ ñåðâåðà (íå äîëæíî áûòü â æóðíàëå)
+
- 99 - èñ÷åðïàí ëèìèò äàííûõ êëèåíòà (íå äîëæíî áûòü â æóðíàëå)
+
- 100 - íå íàéäåí IP àäðåñ ïî çàïðîñó êëèåíòà
+
- 200-299 - îøèáêè UDP portmapper
+
- 300-399 - îøèáêè TCP portmapper
+
- 400-499 - îøèáêè SOCKS proxy
+
- 500-599 - îøèáêè HTTP proxy
+
- 600-699 - îøèáêè POP3 proxy
+
- 999 - ôóíêöèÿ íå ðåàëèçîâàíà
+
+
+
+
+Êàê çàäàòü âîïðîñ, êîòîðîãî íåò â HowTo
+
+Çàäàéòå åãî íà ôîðóìå.
+Òîëüêî íå ïûòàéòåñü çàäàâàòü êàêèå-ëèáî âîïðîñû, åñëè âû ïðîñòî íå ïîíÿëè ýòîò
+HowTo.
+
+
+$Id: howtor.html,v 1.40 2010/01/21 13:34:20 v.dubrovin Exp $
+
\ No newline at end of file
diff --git a/doc/html/index.html b/doc/html/index.html
new file mode 100644
index 0000000..d7786a9
--- /dev/null
+++ b/doc/html/index.html
@@ -0,0 +1,18 @@
+3proxy documentation3proxy documentation
+Security recommendations
+How To (English, very incomplete)
+How To (Russian, Windows1251)
+FAQ (English)
+FAQ (Russian, Windows1251)
+Man pages:
+
3proxy.8
+
ftppr.8
+
icqpr.8
+
pop3p.8
+
proxy.8
+
smtpp.8
+
socks.8
+
tcppm.8
+
udppm.8
+
3proxy.cfg.3
+
diff --git a/doc/html/man3/3proxy.cfg.3.html b/doc/html/man3/3proxy.cfg.3.html
new file mode 100644
index 0000000..27b1761
--- /dev/null
+++ b/doc/html/man3/3proxy.cfg.3.html
@@ -0,0 +1,1300 @@
+
+Manpage of 3proxy.cfg
+
+3proxy.cfg
+Section: Universal proxy server
(3)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+3proxy.cfg
+
+- 3proxy configuration file
+
+DESCRIPTION
+
+
Common structure:
+
+
+Configuration file is a text file 3proxy reads configuration from. Each line
+of the file is a command executed immediately, as it was given from
+console. Sequence of commands is important. Configuration file as actually a
+script for 3proxy executable.
+Each line of the file is treated as a blank (space or tab) separated
+command line. Additional space characters are ignored.
+Think about 3proxy as "application level router" with console interface.
+
+
+
Comments:
+
+
+Any string beginning with space character or '#' character is comment. It's
+ignored. <LF>s are ignored. <CR> is end of command.
+
+
+
+
Quotation:
+
+
+Quotation character is " (double quote). Quotation must be used to quote
+spaces or another special characters. To use quotation character inside
+quotation character must be dubbed (BASIC convention). For example to use
+HELLO "WORLD" as an argument you should use it as "HELLO ""WORLD""".
+Good practice is to quote any argument you use.
+
+
+
File inclusion:
+
+
+You can include file by using $FILENAME macro (replace FILENAME with a path
+to file, for example $/usr/local/etc/3proxy/conf.incl or
+
$"c:\Program Files\3proxy\include.cfg" Quotation is
+required in last example because path contains space character.
+For included file <CR> (end of line characters) is treated as space character
+(arguments delimiter instead of end of command delimiter).
+Thus, include files are only useful to store long signle-line commands
+(like userlist, network lists, etc).
+To use dollar sign somewhere in argument it must be quoted.
+Recursion is not allowed.
+
+
+
Next commands start gateway services:
+
+
+proxy
+
+[options]
+
+
+socks
+
+[options]
+
+
+pop3p
+
+[options]
+
+
+ftppr
+
+[options]
+
+
+admin
+
+[options]
+
+
+dnspr
+
+[options]
+
+
+tcppm
+
+[options]
+<SRCPORT> <DSTADDR> <DSTPORT>
+
+
+udppm
+
+[options]
+<SRCPORT> <DSTADDR> <DSTPORT>
+
+
+
Descriptions:
+
+
+proxy
+
+- HTTP/HTTPS proxy (default port 3128)
+
+
+socks
+
+- SOCKS 4/4.5/5 proxy (default port 1080)
+
+
+pop3p
+
+- POP3 proxy (default port 110)
+
+
+ftppr
+
+- FTP proxy (default port 21)
+
+
+admin
+
+- Web interface (default port 80)
+
+
+dnspr
+
+- caching DNS proxy (default port 53)
+
+
+tcppm
+
+- TCP portmapper
+
+
+udppm
+
+- UDP portmapper
+
+
+
+
Options:
+
+
+-pNUMBER
+
+change default server port to NUMBER
+
+
+-n
+
+disable NTLM authentication (required if passwords are stored in Unix crypt format.
+
+
+-s
+
+(for admin) - allow only secure operations (currently only traffic counters
+view without ability to reset).
+
+
+-a
+
+(for proxy) - anonymous proxy (no information about client reported)
+
+
+-a1
+
+(for proxy) - anonymous proxy (random client information reported)
+
+
+
Also, all options mentioned for
+proxy(8)
+
+socks(8)
+
+pop3p(8)
+
+tcppm(8)
+
+udppm(8)
+
+ftppr(8)
+
+
are also supported.
+
+
+
Portmapping services listen at SRCPORT and connect to DSTADDR:DSTPORT
+HTTP and SOCKS proxies are standard.
+
+
+
POP3 proxy must be configured as POP3 server and requires username in the form of:
+pop3username@pop3server. If POP3 proxy access must be authenticated, you can
+specify username as proxy_username:proxy_password:POP3_username@pop3server
+
+
+
DNS proxy resolves any types of records but only hostnames are cached. It
+requires nserver/nscache to be configured.
+
+
+
FTP proxy can be used as FTP server in any FTP client or configured as FTP
+proxy on a client with FTP proxy support. Username format is one of
+
+
+
FTPuser@FTPServer
+
+
+
FTPuser:FTPpassword@FTPserver
+
+
+
proxyuser:proxypassword:FTPuser:FTPpassword@FTPserver
+
+
+
Please note, if you use FTP client interface for FTP proxy
+do not add FTPpassword and FTPServer to username, because
+FTP client does it for you. That is, if you use 3proxy with
+authentication use
+proxyuser:proxypassword:FTPuser
+as FTP username, otherwise do not change original FTP user name
+
+include
+
+<path>
+
+
+Include config file
+
+
+
+config
+
+<path>
+
+
+Path to configuration file to use on 3proxy restart or to save configuration.
+
+
+
+writable
+
+
+
+ReOpens configuration file for write access via Web interface,
+and re-reads it. Usually should be first command on config file
+but in combination with "config" it can be used anywhere to open
+alternate config file. Think twice before using it.
+
+
+
+end
+
+
+
+End of configuration
+
+
+
+log
+
+[[@|&]logfile] [<LOGTYPE>]
+
+
+sets logfile for all gateways
+
+
+
@ - (for Unix) use syslog, filename is used as ident name
+
+
+
& - use ODBC, filename consists of comma-delimited datasource,username,password (username and password are optional)
+
+
+
LOGTYPE is one of:
+
+
+
M - Monthly
+
+
+
W - Weekly (starting from Sunday)
+
+
+
D - Daily
+
+
+
H - Hourly
+
+
+if logfile is not specified logging goes to stdout. You can specify individual logging options for gateway by using
+-l option in gateway configuration.
+
+
+"log" command supports same format specifications for filename template
+as "logformat" (if filename contains '%' sign it's believed to be template).
+As with "logformat" filename must begin with 'L' or 'G' to specify Local or
+Grinwitch time zone for all time-based format specificators.
+
+
+
+rotate
+
+<n>
+how many archived log files to keep
+
+
+
+logformat
+
+<format>
+
+Format for log record. First symbol in format must be L (local time)
+or G (absolute Grinwitch time).
+It can be preceeded with -XXX+Y where XXX is list of characters to be
+filtered in user input (any non-printable characters are filtered too
+in this case) and Y is replacement character. For example, "-,%+ L" in
+the beginning of logformat means comma and percent are replaced
+with space and all time based elemnts are in local time zone.
+
+
+You can use:
+
+
+
+
%y - Year in 2 digit format
+
+
+
%Y - Year in 4 digit format
+
+
+
%m - Month number
+
+
+
%o - Month abbriviature
+
+
+
%d - Day
+
+
+
%H - Hour
+
+
+
%M - Minute
+
+
+
%S - Second
+
+
+
%t - Timstamp (in seconds since 01-Jan-1970)
+
+
+
%. - milliseconds
+
+
+
%z - timeZone (from Grinvitch)
+
+
+
%D - request duration (in milliseconds)
+
+
+
%b - average send rate per request (in Bytes per second) this speed is typically below connection speed shown by download manager.
+
+
+
%B - average receive rate per request (in Bytes per second) this speed is typically below connection speed shown by download manager.
+
+
+
%U - Username
+
+
+
%N - service Name
+
+
+
%p - service Port
+
+
+
%E - Error code
+
+
+
%C - Client IP
+
+
+
%c - Client port
+
+
+
%R - Remote IP
+
+
+
%r - Remote port
+
+
+
%e - External IP used to establish connection
+
+
+
%Q - Requested IP
+
+
+
%q - Requested port
+
+
+
%n - requested hostname
+
+
+
%I - bytes In
+
+
+
%O - bytes Out
+
+
+
%h - Hops (redirections) count
+
+
+
%T - service specific Text
+
+
+
%N1-N2T - (N1 and N2 are positive numbers) - log only fields from N1 thorugh N2 of service specific text
+
+
+in case of ODBC logging logformat specifies SQL statement, for exmample:
+
+
+
logformat "-'+_Linsert into log (l_date, l_user, l_service, l_in, l_out, l_descr) values ('%d-%m-%Y %H:%M:%S', '%U', '%N', %I, %O, '%T')"
+
+
+
+logdump
+
+<in_traffic_limit> <out_traffic_limit>
+
+
+Immediately creates additional log records if given amount of incoming/outgoing
+traffic is achieved for connection, without waiting for connection to finish.
+It may be useful to prevent information about long-lasting downloads on server
+shutdown.
+
+
+
+archiver
+
+<ext> <commandline>
+
+
+Archiver to use for log files. <ext> is file extension produced by
+archiver. Filename will be last argument to archiver, optionally you
+can use %A as produced archive name and %F as filename.
+
+
+
+timeouts
+
+<BYTE_SHORT> <BYTE_LONG> <STRING_SHORT> <STRING_LONG> <CONNECTION_SHORT> <CONNECTION_LONG> <DNS> <CHAIN>
+
+
+Sets timeout values
+
+
+
BYTE_SHORT - short timeout for single byte, is usually used for receiving single byte from stream.
+
+
+
BYTE_LONG - long timeout for single byte, is usually used for receiving first byte in frame (for example first byte in socks request).
+
+
+
STRING_SHORT - short timeout, for character string within stream (for example to wait between 2 HTTP headers)
+
+
+
STRING_LONG - long timeout, for first string in stream (for example to wait for HTTP request).
+
+
+
CONNECTION_SHORT - inactivity timeout for short connections (HTTP, POP3, etc).
+
+
+
CONNECTION_LONG - inactivity timeout for long connection (SOCKS, portmappers, etc).
+
+
+
DNS - timeout for DNS request before requesting next server
+
+
+
CHAIN - timeout for reading data from chained connection
+
+
+
+
+
+nserver
+
+
<ipaddr>
+
+
+Nameserver to use for name resolutions. If none spcified system
+or name server fails system routines for name resolution will be
+used. It's better to specify nserver because gethostbyname() may
+be thread unsafe.
+
+
+
+nscache
+
+<cachesize>
+
+
+
+Cache <cachesize> records for name resolution. Cachesize usually
+should be large enougth (for example 65536).
+
+
+
+nsrecord
+
+<hostname> <hostaddr>
+
+
+Adds static record to nscache. nscache must be enabled. If 0.0.0.0
+is used as a hostaddr host will never resolve, it can be used to
+blacklist something or together with
+dialer
+
+command to set up UDL for dialing.
+
+
+
+fakeresolve
+
+
+
+All names are resolved to 127.0.0.2 address. Usefull if all requests are
+redirected to parent proxy with http, socks4+, connect+ or socks5+.
+
+
+
+dialer
+
+<progname>
+
+
+Execute progname if external name can't be resolved.
+Hint: if you use nscache, dialer may not work, because names will
+be resolved through cache. In this case you can use something like
+http://dial.right.now/ from browser to set up connection.
+
+
+
+
+internal
+
+<ipaddr>
+
+
+sets ip address of internal interface. This IP address will be used
+to bind gateways. Alternatively you can use -i option for individual
+gateways
+
+
+
+external
+
+<ipaddr>
+
+
+sets ip address of external interface. This IP address will be source
+address for all connections made by proxy. Alternatively you can use
+-e option to specify individual address for gateway.
+
+
+
+maxconn
+
+<number>
+
+
+sets maximum number of simulationeous connections to each services
+started after this command. Default is 100.
+
+
+
+service
+
+
+
+(depricated). Indicates 3proxy to behave as Windows 95/98/NT/2000/XP
+service, no effect for Unix. Not required for 3proxy 0.6 and above. If
+you upgraded from previous version of 3proxy use --remove and --install
+to reinstall service.
+
+
+
+daemon
+
+
+
+Should be specified to close console. Do not use 'daemon' with 'service'.
+At least under FreeBSD 'daemon' should preceed any proxy service
+and log commands to avoid sockets problem. Always place it in the beginning
+of the configuration file.
+
+
+
+auth
+
+<authtype> [...]
+
+
+Type of user authorization. Currently supported:
+
+
+
none - no authentication or authorization required.
+
Note: is auth is none any ip based limitation, redirection, etc will not work.
+
This is default authentication type
+
+
+
iponly - authentication by access control list with username ignored.
+
Appropriate for most cases
+
+
+
useronly - authentication by username without checking for any password with
+authorization by ACLs. Useful for e.g. SOCKSv4 proxy and icqpr (icqpr set UIN /
+AOL screen name as a username)
+
+
+
dnsname - authentication by DNS hostnname with authorization by ACLs.
+DNS hostname is resolved via PTR (reverse) record and validated (resolved
+name must resolve to same IP address). It's recommended to use authcache by
+ip for this authentication.
+NB: there is no any password check, name may be spoofed.
+
+
+
nbname - authentication by NetBIOS name with authorization by ACLs.
+Messanger service should be started on user's machine. Note, that
+Windows 95/98 hosts do not have messanger service by default,
+WinPopup program need to be started. It's recommended to use authcache by
+ip for this authentication.
+NB: there is no any password check, name may be spoofed.
+
+
+
strong - username/password authentication required. It will work with
+SOCKSv5, FTP, POP3 and HTTP proxy.
+
+
+
cache - cached authentication, may be used with 'authcache'.
+
+
+Plugins may add additional authentication types.
+
+
+
+
It's possible to use few authentication types in the same commands. E.g.
+
+
+auth iponly strong
+
+
+In this case 'strong' authentication will be used only in case resource
+access can not be performed with 'iponly' authentication, that is username is
+required in ACL. It's usefull to protect access to some resources with
+password allowing passwordless access to another resources, or to use
+IP-based authentication for dedicated laptops and request username/password for
+shared ones.
+
+
+authcache
+
+<cachtype> <cachtime>
+
+
+Cache authentication information to given amount of time (cachetime) in seconds.
+Cahtype is one of:
+
+
+
ip - after successful authentication all connections during caching time
+from same IP are assigned to the same user, username is not requested.
+
+
+
ip,user username is requested and all connections from the same IP are
+assigned to the same user without actual authentication.
+
+
+
user - same as above, but IP is not checked.
+
+
+
user,password - both username and password are checked against cached ones.
+
+
+Use auth type 'cache' for cached authentication
+
+
+allow
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+<weekdayslist> <timeperiodslist>
+
+
+deny
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+<weekdayslist> <timeperiodslist>
+
+
+Access control entries. All lists are comma-separated, no spaces are
+allowed. Usernames are case sensitive (if used with authtype nbname
+username must be in uppercase). Source and target lists may contain
+IP addresses (W.X.Y.Z) or CIDRs (W.X.Y.Z/L). Since 0.6, targetlist may also
+contain host names, instead of addresses. It's possible to use wildmask in
+the begginning and in the the end of hostname, e.g. *badsite.com or
+*badcontent*. Hostname is only checked if hostname presents in request.
+Targetportlist may contain ports (X) or port ranges lists (X-Y). For any field
+* sign means "ANY" If access list is empty it's assumed to be
+
+
+
allow *
+
+
+
If access list is not empty last item in access list is assumed to be
+
+
+
deny *
+
+
+
You may want explicitly add "deny *" to the end of access list to prevent
+HTTP proxy from requesting user's password.
+Access lists are checked after user have requested any resource.
+If you want 3proxy to reject connections from specific addresses
+immediately without any conditions you should either bind proxy
+to appropriate interface only or to use ip filters.
+
+
+
+Operation is one of:
+
+
+
CONNECT - establish outgoing TCP connection
+
+
+
BIND - bind TCP port for listening
+
+
+
UDPASSOC - make UDP association
+
+
+
ICMPASSOC - make ICMP association (for future use)
+
+
+
HTTP_GET - HTTP GET request
+
+
+
HTTP_PUT - HTTP PUT request
+
+
+
HTTP_POST - HTTP POST request
+
+
+
HTTP_HEAD - HTTP HEAD request
+
+
+
HTTP_CONNECT - HTTP CONNECT request
+
+
+
HTTP_OTHER - over HTTP request
+
+
+
HTTP - matches any HTTP request except HTTP_CONNECT
+
+
+
HTTPS - same as HTTP_CONNECT
+
+
+
FTP_GET - FTP get request
+
+
+
FTP_PUT - FTP put request
+
+
+
FTP_LIST - FTP list request
+
+
+
FTP_DATA - FTP data connection. Note: FTP_DATA requires access to dynamic
+
non-ptivileged (1024-65535) ports on remote side.
+
+
+
FTP - matches any FTP/FTP Data request
+
+
+
ADMIN - access to administration interface
+
+
+
+Weeksdays are week days numbers or periods (0 or 7 means Sunday, 1 is Monday,
+1-5 means Monday through Friday). Timeperiodlists is a list of time
+periods in HH:MM:SS-HH:MM:SS format. For example,
+
00:00:00-08:00:00,17:00:00-24:00:00
+lists non-working hours.
+
+
+
+parent
+
+<weight> <type> <ip> <port> <username> <password>
+
+
+this command must follow "allow" rule. It extends last allow rule to
+build proxy chain. Proxies may be grouped. Proxy inside the
+group is selected randomly. If few groups are specified one proxy
+is randomly picked from each group and chain of proxies is created
+(that is second proxy connected through first one and so on).
+Weight is used to group proxies. Weigt is a number between 1 and 1000.
+Weights are summed and proxies are grouped together untill weight of
+group is 1000. That is:
+
+
+
allow *
+
+
+
parent 500 socks5 192.168.10.1 1080
+
+
+
parent 500 connect 192.168.10.1 3128
+
+
+
makes 3proxy to randomly choose between 2 proxies for all outgoing
+connections. These 2 proxies form 1 group (summarized weight is 1000).
+
+
+
allow * * * 80
+
+
+
parent 1000 socks5 192.168.10.1 1080
+
+
+
parent 1000 connect 192.168.20.1 3128
+
+
+
parent 300 socks4 192.168.30.1 1080
+
+
+
parent 700 socks5 192.168.40.1 1080
+
+
+
creates chain of 3 proxies: 192.168.10.1, 192.168.20.1 and third
+is (192.168.30.1 with probability of 0.3 or 192.168.40.1
+with probability of 0.7) for outgoing web connections.
+
+
+
+
type is one of:
+
+
+
tcp - simply redirect connection. TCP is always last in chain.
+
+
+
http - redirect to HTTP proxy. HTTP is always last chain.
+
+
+
pop3 - redirect to POP3 proxy (only local redirection is supported, can not be
+used for chaining)
+
+
+
ftp - redirect to FTP proxy (only local redirection is supported, can not be
+used for chaining)
+
+
+
connect - parent is HTTP CONNECT method proxy
+
+
+
connect+ - parent is HTTP CONNECT proxy with name resolution
+
+
+
socks4 - parent is SOCKSv4 proxy
+
+
+
socks4+ - parent is SOCKSv4 proxy with name resolution (SOCKSv4a)
+
+
+
socks5 - parent is SOCKSv5 proxy
+
+
+
socks5+ - parent is SOCKSv5 proxy with name resolution
+
+
+
socks4b - parent is SOCKS4b (broken SOCKSv4 implementation with shortened
+server reply. I never saw this kind ofservers byt they say there are).
+Normally you should not use this option. Do not mess this option with
+SOCKSv4a (socks4+).
+
+
+
socks5b - parent is SOCKS5b (broken SOCKSv5 implementation with shortened
+server reply. I think you will never find it useful). Never use this option
+unless you know exactly you need it.
+
+
+
admin - redirect request to local 'admin' service (with -s parameter).
+
+
+
Use "+" proxy only with "fakeresolve" option
+
+
+
+
IP and port are ip addres and port of parent proxy server.
+If IP is zero, ip is taken from original request, only port is changed.
+If port is zero, it's taken from original request, only IP is changed.
+If both IP and port are zero - it's a special case of local redirection,
+it works only with
+socks
+
+proxy. In case of local redirection request is redirected to different service,
+ftp
+
+locally redirects to
+ftppr
+
+pop3
+
+locally redirects to
+pop3p
+
+http
+
+locally redurects to
+proxy
+
+admin
+
+locally redirects to admin -s service.
+
+
+
+
Main purpose of local redirections is to have requested resource
+(URL or POP3 username) logged and protocol-specific filters to be applied.
+In case of local redirection ACLs are revied twice: first, by SOCKS proxy up to
+
+redirected (HTTP, FTP or POP3) after 'parent' command. It means,
+additional 'allow' command is required for redirected requests, for
+example:
+
+
+
allow * * * 80
+
+
+
parent 1000 http 0.0.0.0 0
+
+
+
allow * * * 80 HTTP_GET,HTTP_POST
+
+
+
socks
+
+
+redirects all SOCKS requests with target port 80 to local HTTP proxy,
+local HTTP proxy parses requests and allows only GET and POST requests.
+
+
+
parent 1000 http 1.2.3.4 0
+
+
+Changes external address for given connection to 1.2.3.4
+(an equivalent to -e1.2.3.4)
+
+
Optional username and password are used to authenticate on parent
+proxy. Username of '*' means username must be supplied by user.
+
+
+
+
+nolog
+
+<n>
+extends last allow or deny command to prevent logging, e.g.
+
+
+allow * * 192.168.1.1
+
+
+nolog
+
+
+
+
+weight
+
+<n>
+extends last allow or deny command to set weight for this request
+
+
+allow * * 192.168.1.1
+
+
+weight 100
+
+
+Weight may be used for different purposes.
+
+
+
+bandlimin
+
+<rate> <userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+nobandlimin
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+bandlimout
+
+<rate> <userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+nobandlimout
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+
bandlim sets bandwith limitation filter to <rate> bps (bits per second)
+(if you want to specife bytes per second - multiply your value to 8).
+bandlim rules act in a same manner as allow/deny rules except
+one thing: bandwidth limiting is applied to all services, not to some
+specific service.
+bandlimin and nobandlimin applies to incoming traffic
+bandlimout and nobandlimout applies to outgoing traffic
+If tou want to ratelimit your clients with ip's 192.168.10.16/30 (4
+addresses) to 57600 bps you have to specify 4 rules like
+
+
+
bandlimin 57600 * 192.168.10.16
+
+
+
bandlimin 57600 * 192.168.10.17
+
+
+
bandlimin 57600 * 192.168.10.18
+
+
+
bandlimin 57600 * 192.168.10.19
+
+
+
and every of you clients will have 56K channel. if you specify
+
+
+
bandlimin 57600 * 192.168.10.16/30
+
+
+
you will have 56K channel shared between all clients.
+if you want, for example, to limit all speed ecept access to POP3 you can use
+
+
+
nobandlimin * * * 110
+
+
+
before the rest of bandlim rules.
+
+
+
+counter
+
+<filename> <reporttype> <repotname>
+
+
+countin
+
+<number> <type> <limit> <userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+nocountin
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+countout
+
+<number> <type> <limit> <userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+nocountout
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+
+
counter, countin, nocountin, countout, noucountout commands are
+used to set traffic limit
+in MB for period of time (day, week or month). Filename is a path
+to a special file where traffic information is permanently stored.
+number is sequential number of record in this file. If number is 0
+no traffic information on this counter is saved in file (that is
+if proxy restarted all information is loosed) overwise it should be
+unique sequential number.
+Type specifies a type of counter. Type is one of:
+
+
+
D - counter is resetted daily
+
+
+
W - counter is resetted weekly
+
+
+
M - counter is resetted monthely
+
+
+
reporttype/repotname may be used to generate traffic reports.
+Reporttype is one of D,W,M,H(hourly) and repotname specifies filename
+template for reports. Report is text file with counter values in
+format:
+
+
+
<COUNTERNUMBER> <TRAF*4GB> <TRAF>
+
+
+
The rest of parameters is identical to bandlim/nobandlim.
+
+
+
+users
+
+username[:pwtype:password] ...
+
+
+pwtype is one of:
+
+
+
none (empty) - use system authentication
+
+
+
CL - password is cleartext
+
+
+
CR - password is crypt-style password
+
+
+
NT - password is NT password (in hex)
+
+
+example:
+
+
+
users test1:CL:password1 "test2:CR:$1$lFDGlder$pLRb4cU2D7GAT58YQvY49."
+
+
+
users test3:NT:BD7DFBF29A93F93C63CB84790DA00E63
+
+
+(note: double quotes are requiered because password contains $ sign).
+
+
+
+flush
+
+
+
+empty active access list. Access list must be flushed avery time you creating
+new access list for new service. For example:
+
+
+
allow *
+
+
+
pop3p
+
+
+
flush
+
+
+
allow * 192.168.1.0/24
+
+
+
socks
+
+
+sets different ACLs for
+pop3p
+
+and
+socks
+
+
+
+
+system
+
+
+
+execute system command
+
+
+
+pidfile
+
+<filename>
+
+
+write pid of current process to file. It can be used to manipulate
+3proxy with signals under Unix. Currently next signals are available:
+
+
+
+monitor
+
+<filename>
+
+
+If file monitored changes in modification time or size, 3proxy reloads
+configuration within one minute. Any number of files may be monitored.
+
+
+
+setuid
+
+<uid>
+
+
+calls setuid(uid), uid must be numeric. Unix only. Warning: under some Linux
+kernels setuid() works onle for current thread. It makes it impossible to suid
+for all threads.
+
+
+
+setgid
+
+<gid>
+
+
+calls setgid(gid), gid must be numeric. Unix only.
+
+
+
+chroot
+
+<path>
+
+
+calls chroot(path). Unix only.
+
+PLUGINS
+
+
+
+
+plugin
+
+<path_to_shared_library> <function_to_call> [<arg1> ...]
+
+
+Loads specified library and calls given export function with given arguments,
+as
+
+
+int functions_to_call(struct pluginlink * pl, int argc, char * argv[]);
+
+
+function_to_call must return 0 in case of success, value > 0 to indicate error.
+
+
+
+filtermaxsize
+
+<max_size_of_data_to_filter>
+
+
+If Content-length (or another data length) is greater than given value, no
+data filtering will be performed thorugh filtering plugins to avoid data
+corruption and/or Content-Length chaging. Default is 1MB (1048576).
+
+
+
+SEE ALSO
+
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), tcppm(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+TRIVIA
+
+3APA3A is pronounced as ``zaraza''.
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- DESCRIPTION
-
+
- PLUGINS
-
+
- SEE ALSO
-
+
- TRIVIA
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:57 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/3proxy.8.html b/doc/html/man8/3proxy.8.html
new file mode 100644
index 0000000..2bc8bf3
--- /dev/null
+++ b/doc/html/man8/3proxy.8.html
@@ -0,0 +1,268 @@
+
+Manpage of 3proxy
+
+3proxy
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+3proxy
+
+- 3[APA3A] tiny proxy server, or trivial proxy server, or free proxy
+server
+
+SYNOPSIS
+
+3proxy
+
+[config_file]
+
+
+
+3proxy
+
+[--install]
+
+
+
+3proxy
+
+[--remove]
+
+
+DESCRIPTION
+
+3proxy
+
+is universal proxy server. It can be used to provide internal users wuth
+fully controllable access to external resources or to provide external
+users with access to internal resources. 3proxy is not developed to replace
+squid(8),
+
+but it can extend functionality of existing cashing proxy.
+It can be used to route requests between different types of clients and proxy
+servers. Think about it as application level
+gateway with configuration like hardware router has for network layer.
+It can establish multiple
+gateways with HTTP and HTTPS proxy with FTP over HTTP support, SOCKS v4,
+v4.5 and v5, POP3 proxy, UDP and TCP portmappers. Each gateway is started
+from configuration file like independant service
+proxy(8)
+
+socks(8)
+
+pop3p(8)
+
+tcppm(8)
+
+udppm(8)
+
+ftppr(8)
+
+dnspr
+
+but
+3proxy
+
+is not a kind of wrapper or superserver for this daemons. It just has same
+code compiled in, but provides much more functionality. SOCKSv5
+implementatation allows to use 3proxy with any UDP or TCP based client
+applications designed without
+proxy support (with
+SocksCAP,
+
+FreeCAP
+
+or another client-side redirector under Windows of with socksification library
+under Unix). So you can play your favourite games, listen music, exchange
+files and messages and even accept incoming connections behind proxy server.
+
+
+dnspr
+
+does not exist as independant service. It' DNS caching proxy (it requires
+nscache
+
+and
+nserver
+
+to be set in configuration. Only A-records are cached. Please note, the
+this caching is mostly a 'hack' and has nothing to do with real
+DNS server, but it works perfectly for SOHO networks.
+
+
+
+3proxy supports access control lists (ACL) like network router. Source
+and destination networks and destination port can be specified. In addition,
+usernames and gateway action (for example GET or POST) can be used in ACLs.
+In order to filter request on username basis user must be authenticated somehow. There are few
+authentication types including password authentication and authentication by
+NetBIOS name for Windows clients (it's very like ident authentication).
+Depending on ACL action request can be allowed, denied or redirected to another
+host or to another proxy server or even to a chain of proxy servers.
+
+
+It supports different types of logging: to logfiles,
+syslog(3)
+
+(only under Unix) or to ODBC database. Logging format is turnable to provide
+compatibility with existing log file parsers. It makes it possible to use
+3proxy with IIS, ISA, Apache or Squid log parsers.
+
+
OPTIONS
+
+
+- config_file
+
+
-
+Name of config file. See
+3proxy.cfg(3)
+
+for configuration file format. Under Windows, if config_file is not specified,
+3proxy
+
+looks for file named
+3proxy.cfg
+
+in the default location (in same directory with executable file and in current
+directory). Under Unix, if no config file is specified, 3proxy reads
+configuration from stdin. It makes it possible to use 3proxy.cfg file as
+executable script just by setting +x mode and adding
+
+
+#!/usr/local/3proxy/3proxy
+
+
+as a first line in 3proxy.cfg
+ - --install
+
+
-
+(Windows NT family only) install
+3proxy
+
+as a system service
+
- --remove
+
+
-
+(Windows NT family only) remove
+3proxy
+
+from system services
+
+
+SIGNALS
+
+Under Unix there are few signals
+3proxy
+
+catches. See
+kill(1).
+
+
+- SIGTERM
+
+
-
+cleanup connections and exit
+
- SIGPAUSE
+
+
-
+stop to accept new connections, on second signal - start and re-read
+configuration
+
- SIGCONT
+
+
-
+start to accept new conenctions
+
- SIGUSR1
+
+
-
+reload configuration
+
+
+
+Under Windows, if
+3proxy
+
+is installed as service you can standard service management to start, stop,
+pause and continue 3proxy service, for example:
+
+
+net start 3proxy
+
+
+
+net stop 3proxy
+
+
+
+net pause 3proxy
+
+
+
+net continue 3proxy
+
+
+
+Web admin service can also be used to reload configuration. Use
+wget to automate this task.
+
+
FILES
+
+
+- /usr/local/3proxy/3proxy.cfg (3proxy.cfg)
+
+
-
+3proxy
+
+configuration file
+
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy.cfg(3), proxy(8), ftppr(8), socks(8), pop3p(8), tcppm(8), udppm(8),
+kill(1), syslogd(8),
+
+
+http://3proxy.ru/
+
+TRIVIA
+
+3APA3A is pronounced as ``zaraza''.
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- SIGNALS
-
+
- FILES
-
+
- BUGS
-
+
- SEE ALSO
-
+
- TRIVIA
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:55 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/3proxy.conf.3.html b/doc/html/man8/3proxy.conf.3.html
new file mode 100644
index 0000000..582e181
--- /dev/null
+++ b/doc/html/man8/3proxy.conf.3.html
@@ -0,0 +1,693 @@
+
+Manpage of 3proxy.conf
+
+3proxy.conf
+Section: Universal proxy server
(5)
Updated: December 2004
Index
+Return to Main Contents
+
+
+NAME
+
+3proxy.conf
+
+- 3proxy configuration file
+
+DESCRIPTION
+
+
+
+Common structure:
+
+Configuration file is a text file 3proxy reads configuration from. Each line
+of the file is command and is executed immediately, as it was given from
+console. Each line of the file is treated as a blank (space or tab) separated
+command line. Additional space characters are ignored.
+Think about 3proxy as "application level router" with console interface.
+
+Comments:
+
+Any string beginning with space character or '#' character is comment. It's
+ignored. <LF>s are ignored. <CR> is end of command.
+
+
+Quotation:
+
+Quotation character is spaces or another special characters. To use quotation character inside
+quotation character must be dubbed (BASIC convention). For example to use
+HELLO Good practice is to quote any argument you use.
+
+File inclusion:
+
+You can include file by using $FILENAME macro (replace FILENAME with a path
+to file, for example $/usr/local/etc/3proxy/conf.incl or
+
$"c:\Program Files\3proxy\include.cfg" Quotation is
+required in last example because path contains space character.
+For included file <CR> (end of line characters) is treated as space character
+(arguments delimiter instead of end of command delimiter).
+Thus, include files are only useful to store long signle-line commands
+(like userlist, network lists, etc).
+To use dollar sign somewhere in argument it must be quoted.
+Recursion is not allowed.
+
+Commands:
+
+proxy
+
+[options]
+
+
+socks
+
+[options]
+
+
+pop3p
+
+[options]
+
+
+ftppr
+
+[options]
+
+
+admin
+
+[options]
+
+
+dnspr
+
+[options]
+
+
+tcppm
+
+[options]
+<SRCPORT> <DSTADDR> <DSTPORT>
+
+
+udppm
+
+[options]
+<SRCPORT> <DSTADDR> <DSTPORT>
+
+starts gateway services
+
+proxy
+
+- HTTP/HTTPS proxy (default port 3128)
+
+
+socks
+
+- SOCKS 4/4.5/5 proxy (default port 1080)
+
+
+pop3p
+
+- POP3 proxy (default port 110)
+
+
+ftppr
+
+- FTP proxy (default port 21)
+
+
+admin
+
+- Web interface (default port 80)
+
+
+dnspr
+
+- caching DNS proxy (default port 53)
+
+
+tcppm
+
+- TCP portmapper
+
+
+udppm
+
+- UDP portmapper
+
+Options:
+
+
+-pNUMBER
+
+change default server port to NUMBER
+
+
+-n
+
+disable NTLM authentication (required if passwords are stored in Unix crypt format.
+
+
+Also, all options mentioned for
+proxy(8)
+
+socks(8)
+
+pop3p(8)
+
+tcppm(8)
+
+udppm(8)
+
+ftppr(8)
+
+are also supported.
+
+Portmapping services listen at SRCPORT and connect to DSTADDR:DSTPORT
+HTTP and SOCKS proxies are standard.
+
+POP3 proxy must be configured as POP3 server and requires username in the form of:
+pop3username@pop3server. If POP3 proxy access must be authenticated, you can
+specify username as proxy_username:proxy_password:POP3_username@pop3server
+
+DNS proxy is only capable to resolve hostnames (no MX, PTR, SRV, etc) and
+requires nserver/nscache to be configured.
+
+FTP proxy can be used as FTP server in any FTP client or configured as FTP
+proxy on a client with FTP proxy support. Username format is one of
+
FTPuser@FTPServer
+
FTPuser:FTPpassword@FTPserver
+
proxyuser:proxypassword:FTPuser:FTPpassword@FTPserver
+
+
+Please note, if you use FTP client interface for FTP proxy
+do not add FTPpassword and FTPServer to username, because
+FTP client does it for you. That is, if you use 3proxy with
+authentication use
+proxyuser:proxypassword:FTPuser
+as FTP username, otherwise do not change original FTP user name
+
+config
+
+<path>
+
+
+Path to configuration file to use on 3proxy restart or to save configuration.
+
+writable
+
+
+
+ReOpens configuration file for write access via Web interface,
+and re-reads it. Usually should be first command on config file
+but in combination with "config" it can be used anywhere to open
+alternate config file. Think twice before using it.
+
+end
+
+
+
+End of configuration
+
+log
+
+[[@|&]logfile] [<LOGTYPE>]
+
+
+sets logfile for all gateways
+
@ - (for Unix) use syslog, filename is used as ident name
+
& - use ODBC, filename consists of comma-delimited datasource,username,password (username and password are optional)
+
LOGTYPE is one of:
+
M - Monthly
+
W - Weekly (starting from Sunday)
+
D - Daily
+
H - Hourly
+if logfile is not specified logging goes to stdout. You can specify individual logging options for gateway by using
+-l option in gateway configuration.
+
+rotate
+
+<n>
+how many archived log files to keep
+
+logformat
+
+<format>
+
+Format for log record. First symbol in format must be L (local time)
+or G (absolute Grinwitch time).
+It can be preceeded with -XXX+Y where XXX is list of characters to be
+filtered in user input (any non-printable characters are filtered too
+in this case) and Y is replacement character. For example, "-,%+ L" in
+the beginning of logformat means comma and percent are replaced
+with space and all time based elemnts are in local time zone.
+You can use:
+
+
%y - Year in 2 digit format
+
%Y - Year in 4 digit format
+
%m - Month number
+
%o - Month abbriviature
+
%d - Day
+
%H - Hour
+
%M - Minute
+
%S - Second
+
%t - Timstamp (in seconds since 01-Jan-1970)
+
%. - milliseconds
+
%z - timeZone (from Grinvitch)
+
%D - request duration (in milliseconds)
+
%b - average send rate per request (in Bytes per second) this speed is typically below connection speed shown by download manager.
+
%B - average receive rate per request (in Bytes per second) this speed is typically below connection speed shown by download manager.
+
%U - Username
+
%N - service Name
+
%p - service Port
+
%E - Error code
+
%C - Client IP
+
%c - Client port
+
%R - Remote IP
+
%r - Remote port
+
%n - requested hostname
+
%I - bytes In
+
%O - bytes Out
+
%h - Hops (redirections) count
+
%T - service specific Text
+
%N1-N2T - (N1 and N2 are positive numbers) - log only fields from N1 thorugh N2 of service specific text
+in case of ODBC logging logformat specifies SQL statement, for exmample:
+
logformat "-'+_Linsert into log (l_date, l_user, l_service, l_in, l_out, l_descr) values ('%d-%m-%Y %H:%M:%S', '%U', '%N', %I, %O, '%T')"
+
+archiver
+
+<ext> <commandline>
+
+
+Archiver to use for log files. <ext> is file extension produced by
+archiver. Filename will be last argument to archiver, optionally you
+can use %A as produced archive name and %F as filename.
+
+timeouts
+
+<BYTE_SHORT> <BYTE_LONG> <STRING_SHORT> <STRING_LONG> <CONNECTION_SHORT> <CONNECTION_LONG> <DNS> <CHAIN>
+Sets timeout values
+
BYTE_SHORT - short timeout for single byte, is usually used for receiving single byte from stream.
+
BYTE_LONG - long timeout for single byte, is usually used for receiving first byte in frame (for example first byte in socks request).
+
STRING_SHORT - short timeout, for character string within stream (for example to wait between 2 HTTP headers)
+
STRING_LONG - long timeout, for first string in stream (for example to wait for HTTP request).
+
CONNECTION_SHORT - inactivity timeout for short connections (HTTP, POP3, etc).
+
CONNECTION_LONG - inactivity timeout for long connection (SOCKS, portmappers, etc).
+
DNS - timeout for DNS request before requesting next server
+
CHAIN - timeout for reading data from chained connection
+
+nserver
+
+
<ipaddr>
+
+
+Nameserver to use for name resolutions. If none spcified system
+or name server fails system routines for name resolution will be
+used. It's better to specify nserver because gethostbyname() may
+be thread unsafe.
+
+nscache
+
+<cachesize>
+
+
+
+Cache <cachesize> records for name resolution. Cachesize usually
+should be large enougth (for example 65536).
+
+nsrecord
+
+<hostname> <hostaddr>
+
+
+Adds static record to nscache. nscache must be enabled. If 0.0.0.0
+is used as a hostaddr host will never resolve, it can be used to
+blacklist something or together with
+dialer
+
+command to set up UDL for dialing.
+
+dialer
+
+<progname>
+
+
+Execute progname if external name can't be resolved.
+Hint: if you use nscache, dialer may not work, because names will
+be resolved through cache. In this case you can use something like
+http://dial.right.now/ from browser to set up connection.
+
+
+internal
+
+<ipaddr>
+
+
+sets ip address of internal interface. This IP address will be used
+to bind gateways. Alternatively you can use -i option for individual
+gateways
+
+external
+
+<ipaddr>
+
+
+sets ip address of external interface. This IP address will be source
+address for all connections made by proxy. Alternatively you can use
+-e option to specify individual address for gateway.
+
+maxconn
+
+<number>
+
+
+sets maximum number of simulationeous connections to each services
+started after this command. Default is 100.
+
+service
+
+
+
+(depricated) Should be specified to launch as Windows 95/98/NT/2000/XP service,
+no effect for Unix. Is not reqired since 0.6, but you must re-install 3proxy
+service with --remove and --install.
+
+daemon
+
+
+
+Should be specified to close console (not required for 'service').
+At least under FreeBSD 'daemon' should preceed any proxy service
+and log commands to avoid sockets problem. Always place it in the beginning
+of the configuration file.
+
+auth
+
+
+
+Type of user authorization. Currently supported:
+
none - no authorization required. Note: is auth is none any ip based limitation, redirection, etc will not work.
+
iponly - authorization by source/destination IP and ports. Appropriate for most cases
+
nbname - iponly + authorization by NetBIOS name. Messanger
+service should be started on user's machine. Note, that
+Windows 95/98 hosts do not have messanger service by default,
+WinPopup program need to be started.
+NB: there is no any password check, name may be spoofed.
+Think about it as about ident for Windows.
+
Q: Will ident authorization be implemented?
+
A: Yes, as soon as it will be required by someone.
+
strong - username/password authentication required. It will work with SOCKSv5, FTP, POP3 and HTTP proxy.
+
+allow
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+<weekdayslist> <timeperiodslist>
+
+
+deny
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+<weekdayslist> <timeperiodslist>
+
+
+Access control entries. All lists are comma-separated, no spaces are
+allowed. Usernames are case sensitive (if used with authtype nbname
+username must be in uppercase). Source and target lists may contain
+IP addresses (W.X.Y.Z) or CIDRs (W.X.Y.Z/L). Targetportlist may
+contain ports (X) or port lists (X-Y). For any field * sign means "ANY"
+If access list is empty it's assumed to be
+
allow *
+If access list is not empty last item in access list is assumed to be
+
deny *
+You may want explicitly add "deny *" into the end of access list to prevent
+HTTP proxy from requesting user's password.
+Access lists are checked after user have requested any resource.
+If you want 3proxy to reject connections from specific addresses
+immediately without any conditions you should either bind proxy
+to appropriate interface only or to use ip filters.
+
+Operation is one of:
+
CONNECT - establish outgoing TCP connection
+
BIND - bind TCP port for listening
+
UDPASSOC - make UDP association
+
ICMPASSOC - make ICMP association (for future use)
+
HTTP_GET - HTTP GET request
+
HTTP_PUT - HTTP PUT request
+
HTTP_POST - HTTP POST request
+
HTTP_HEAD - HTTP HEAD request
+
HTTP_CONNECT - HTTP CONNECT request
+
HTTP_OTHER - over HTTP request
+
HTTP - matches any HTTP request except HTTP_CONNECT
+
HTTPS - same as HTTP_CONNECT
+
FTP_GET - FTP get request
+
FTP_PUT - FTP put request
+
FTP_LIST - FTP list request
+
FTP - matches any FTP request
+
+Weeksdays are week days numbers or periods (0 or 7 means Sunday, 1 is Monday,
+1-5 means Monday through Friday). Timeperiodlists is a list of time
+periods in HH:MM:SS-HH:MM:SS format. For example,
+
00:00:00-08:00:00,17:00:00-24:00:00
+lists non-working hours.
+
+parent
+
+<weight> <type> <ip> <port> <username> <password>
+
+
+this command may follow "allow" rule. It extends last allow rule to
+build proxy chain. Proxy may be grouped. Proxy inside the
+group is selected randomely. If few groups are specified one proxy
+is randomely picked from each group and chain of proxies is created
+(that is second proxy connected through first one and so on).
+Weight is used to group proxies. Weigt is a number between 1 and 1000.
+Weights are summed and proxies are grouped together untill weight of
+group is 1000. That is:
+
allow *
+
parent 500 socks5 192.168.10.1 1080
+
parent 500 connect 192.168.10.1 3128
+makes 3proxy to randomely choose between 2 proxies for all outgoing
+connections
+
allow * * * 80
+
parent 1000 socks5 192.168.10.1 1080
+
parent 1000 connect 192.168.20.1 3128
+
parent 300 socks4 192.168.30.1 1080
+
parent 700 socks5 192.168.40.1 1080
+creates chain of 3 proxies: 192.168.10.1, 192.168.20.1 and third
+is (192.168.30.1 with probability of 0.3 or 192.168.40.1
+with probability of 0.7) for outgoing web connections.
+
+type is one of:
+
tcp - simply redirect connection. TCP is always last in chain.
+
http - redirect to HTTP proxy. HTTP is always last chain.
+
pop3 - redirect to POP3 proxy (only local redirection is supported, can not be
+used for chaining)
+
ftp - redirect to FTP proxy (only local redirection is supported, can not be
+used for chaining)
+
connect - parent is HTTP CONNECT method proxy
+
socks4 - parent is SOCKSv4 proxy
+
socks5 - parent is SOCKSv5 proxy
+
+IP and port are ip addres and port of parent proxy server.
+If IP is zero, ip is taken from original request, only port is changed.
+If port is zero, it's taken from original request, only IP is changed.
+If both IP and port are zero - it's a special case of local redirection,
+it works only with
+
+socks
+proxy. In case of local redirection request is redirected to different service,
+
+ftppr
+
+
+pop3p
+
+
+proxy .
+
+
+Main purpose of local redirections is to have requested resource
+(URL or POP3 username) logged and protocol-specific filters to be applied.
+In case of local redirection ACLs are revied twice: first, by SOCKS proxy up to
+
+redirected (HTTP, FTP or POP3) after 'parent' command. It means,
+additional 'allow' command is required for redirected requests, for
+example:
+
allow * * * 80
+
parent 1000 http 0.0.0.0 0
+
allow * * * 80 HTTP_GET,HTTP_POST
+
socks
+redirects all SOCKS requests with target port 80 to local HTTP proxy,
+local HTTP proxy parses requests and allows only GET and POST requests.
+
+Optional username and password are used to authenticate on parent
+proxy. Username of '*' means username must be supplied by user.
+
+bandlimin
+
+<rate> <userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+nobandlimin
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+bandlim sets bandwith limitation filter to <rate> bps (bits per second)
+(if you want to specife bytes per second - multiply your value to 8).
+bandlim rules act in a same manner as allow/deny rules except
+one thing: bandwidth limiting is applied to all services, not to some
+specific service.
+bandlimin and nobandlimin applies to incoming traffic
+bandlimout and nobandlimout applies to outgoing traffic
+If tou want to ratelimit your clients with ip's 192.168.10.16/30 (4
+addresses) to 57600 bps you have to specify 4 rules like
+
bandlimin 57600 * 192.168.10.16
+
bandlimin 57600 * 192.168.10.17
+
bandlimin 57600 * 192.168.10.18
+
bandlimin 57600 * 192.168.10.19
+and every of you clients will have 56K channel. if you specify
+
bandlimin 57600 * 192.168.10.16/30
+you will have 56K channel shared between all clients.
+if you want, for example, to limit all speed ecept access to POP3 you can use
+
nobandlimin * * * 110
+before the rest of bandlim rules.
+
+counter
+
+<filename> <reporttype> <repotname>
+
+
+countin
+
+<number> <type> <limit> <userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+nocountin
+
+<userlist> <sourcelist> <targetlist> <targetportlist> <operationlist>
+
+
+
+counter, countin, nocountin commands are used to set traffic limit
+in MB for period of time (day, week or month). Filename is a path
+to a special file where traffic information is permanently stored.
+number is sequential number of record in this file. If number is 0
+no traffic information on this counter is saved in file (that is
+if proxy restarted all information is loosed) overwise it should be
+unique sequential number.
+Type specifies a type of counter. Type is one of:
+
D - counter is resetted daily
+
W - counter is resetted weekly
+
M - counter is resetted monthely
+reporttype/repotname may be used to generate traffic reports.
+Reporttype is one of D,W,M,H(hourly) and repotname specifies filename
+template for reports. Report is text file with counter values in
+format:
+
<COUNTERNUMBER> <TRAF*4GB> <TRAF>
+The rest of parameters is identical to bandlim/nobandlim.
+
+users
+
+username[:pwtype:password] ...
+
+
+pwtype is one of:
+
none (empty) - use system authentication
+
CL - password is cleartext
+
CR - password is crypt-style password
+
NT - password is NT password (in hex)
+example:
+
users test1:CL:password1 "test2:CR:$1$lFDGlder$pLRb4cU2D7GAT58YQvY49."
+
users test3:NT:BD7DFBF29A93F93C63CB84790DA00E63
+
+
+(note: double quotes are requiered because password contains $ sign).
+
+flush
+
+
+
+empty active access list. Access list must be flushed avery time you creating
+new access list for new service. For example:
+
allow *
+
pop3p
+
flush
+
allow * 192.168.1.0/24
+
socks
+sets different ACLs for
+pop3p
+
+and
+socks
+
+
+system
+
+
+
+execute system command
+
+pidfile
+
+<filename>
+
+
+write pid of current process to file. It can be used to manipulate
+3proxy with signals under Unix. Currently next signals are available:
+
+setuid
+
+<uid>
+
+
+calls setuid(uid), uid must be numeric. Unix only.
+
+setgid
+
+<gid>
+
+
+calls setgid(gid), gid must be numeric. Unix only.
+
+chroot
+
+<path>
+
+
+calls chroot(path). Unix only.
+
+SEE ALSO
+
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), tcppm(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+TRIVIA
+
+3APA3A is pronounced as ``zaraza''.
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- DESCRIPTION
-
+
- SEE ALSO
-
+
- TRIVIA
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: GMT, December 11, 2004
+
+
diff --git a/doc/html/man8/ftppr.8.html b/doc/html/man8/ftppr.8.html
new file mode 100644
index 0000000..c011b0c
--- /dev/null
+++ b/doc/html/man8/ftppr.8.html
@@ -0,0 +1,160 @@
+
+Manpage of ftppr
+
+ftppr
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+ftppr
+
+- FTP proxy gateway service
+
+SYNOPSIS
+
+ftppr [-d]
+
+[-l[[@]logfile]]
+
+[-pport]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+[-hdefault_ip[:port]]
+
+
+DESCRIPTION
+
+ftppr
+
+is FTP gateway service to allow internal users to access external FTP
+servers.
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -u
+
+
-
+Never look for username authentication.
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -h
+
+
-
+Default destination. It's used if targed address is not specified by user.
+
- -p
+
+
-
+Port. Port proxy listens for incoming connections. Default is 21.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
+
+CLIENTS
+
+You can use any FTP client, regardless of FTP proxy support. For client with
+FTP proxy support configure
+internal_ip
+
+and
+port
+
+in FTP proxy parameters.
+For clients without FTP proxy support use
+internal_ip
+
+and
+port
+
+as FTP server. Address of real FTP server must be configured as a part of
+FTP username. Format for username is
+username@server,
+
+where
+server
+
+is address of FTP server and
+username
+
+is user's login on this FTP server. Login itself may contain '@' sign.
+Only cleartext authentication is currently supported.
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), proxy(8), pop3p(8), socks(8), tcppm(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:56 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/icqpr.8.html b/doc/html/man8/icqpr.8.html
new file mode 100644
index 0000000..0535bb3
--- /dev/null
+++ b/doc/html/man8/icqpr.8.html
@@ -0,0 +1,155 @@
+
+Manpage of icqpr
+
+icqpr
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+icqpr
+
+- ICQ (AOL OSCAR) proxy
+
+SYNOPSIS
+
+icqpr [-d]
+
+[-l[[@]logfile]]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+local_port remote_host remote_port
+
+
+DESCRIPTION
+
+icqpr
+
+forwards ICQ connections from local to remote ICQ host. Most usual is
+icqpr 5190 login.icq.com 5190
+
+Also, icqpr adds UIN / AOL screen name as a username. It makes it possible
+to control user's access to ICQ/AOL by UIN/screen name (use
+auth useronly
+
+in 3proxy).
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
+
+ARGUMENTS
+
+
+- local_port
+
+
-
+- port icqpr accepts connection
+
- remote_host
+
+
-
+- IP address of the host connection is forwarded to
+
- remote_port
+
+
-
+- remote port connection is forwarded to
+
+
+CLIENTS
+
+You can use any ICQ/AOL client where server address configuration is supported
+or spoof login server name (e.g. login.icq.com) with IP address of proxy server
+via DNS record or hosts file. Transparent redirection is also possible. Use
+internal_ip
+
+and
+local_port
+
+as a destination in client application. Connection is forwarded to
+remote_host:remote_port
+
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- ARGUMENTS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:56 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/pop3p.8.html b/doc/html/man8/pop3p.8.html
new file mode 100644
index 0000000..88c4a99
--- /dev/null
+++ b/doc/html/man8/pop3p.8.html
@@ -0,0 +1,154 @@
+
+Manpage of pop3p
+
+pop3p
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+pop3p
+
+- POP3 proxy gateway service
+
+SYNOPSIS
+
+pop3p [-d]
+
+[-l[[@]logfile]]
+
+[-pport]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+[-hdefault_ip[:port]]
+
+
+DESCRIPTION
+
+pop3p
+
+is POP3 gateway service to allow internal users to access external POP3
+servers.
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -u
+
+
-
+Never look for username authentication.
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -p
+
+
-
+Port. Port proxy listens for incoming connections. Default is 110.
+
- -h
+
+
-
+Default destination. It's used if targed address is not specified by user.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
+
+CLIENTS
+
+You can use any MUA (Mail User Agent) with POP3 support. Set client to use
+internal_ip
+
+and
+port
+
+as a POP3 server. Address of real POP3 server must be configured as a part of
+POP3 username. Format for username is
+username@server,
+
+where
+server
+
+is address of POP3 server and
+username
+
+is user's login on this POP3 server. Login itself may contain '@' sign.
+Only cleartext authentication is supported, because challenge-response
+authentication (APOP, CRAM-MD5, etc) requires challenge from server before
+we know which server to connect.
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), ftppr(8), proxy(8), socks(8), tcppm(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:56 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/proxy.8.html b/doc/html/man8/proxy.8.html
new file mode 100644
index 0000000..e651354
--- /dev/null
+++ b/doc/html/man8/proxy.8.html
@@ -0,0 +1,147 @@
+
+Manpage of proxy
+
+proxy
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+proxy
+
+- HTTP proxy gateway service
+
+SYNOPSIS
+
+proxy [-d][-a]
+
+[-l[[@]logfile]]
+
+[-pport]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+
+DESCRIPTION
+
+proxy
+
+is HTTP gateway service with HTTPS and FTP over HTTPS support.
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -u
+
+
-
+Never ask for username authentication
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -a
+
+
-
+Anonymous. Hide information about client.
+
- -a1
+
+
-
+Anonymous. Show fake information about client.
+
- -p
+
+
-
+Port. Port proxy listens for incoming connections. Default is 3128.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
+
+CLIENTS
+
+You should use client with HTTP proxy support or configure router to redirect
+HTTP traffic to proxy (transparent proxy). Configure client to connect to
+internal_ip
+
+and
+port.
+
+HTTPS support allows to use almost any TCP based protocol. If you need to
+limit clients, use
+3proxy(8)
+
+instead.
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), ftppr(8), socks(8), pop3p(8), tcppm(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:56 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/smtpp.8.html b/doc/html/man8/smtpp.8.html
new file mode 100644
index 0000000..1fe8e95
--- /dev/null
+++ b/doc/html/man8/smtpp.8.html
@@ -0,0 +1,155 @@
+
+Manpage of smtpp
+
+smtpp
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+smtpp
+
+- SMTP proxy gateway service
+
+SYNOPSIS
+
+smtpp [-d]
+
+[-l[[@]logfile]]
+
+[-pport]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+[-hdefault_ip[:port]]
+
+
+DESCRIPTION
+
+smtpp
+
+is SMTP gateway service to allow internal users to access external SMTP
+servers.
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -u
+
+
-
+Never look for username authentication.
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -p
+
+
-
+Port. Port proxy listens for incoming connections. Default is 25.
+
- -h
+
+
-
+Default destination. It's used if targed address is not specified by user.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
+
+CLIENTS
+
+You can use any MUA (Mail User Agent) with SMTP authentication support.
+Set client to use
+internal_ip
+
+and
+port
+
+as a SMTP server. Address of real SMTP server must be configured as a part of
+SMTP username. Format for username is
+username@server,
+
+where
+server
+
+is address of SMTP server and
+username
+
+is user's login on this SMTP server. Login itself may contain '@' sign.
+Only cleartext authentication is supported, because challenge-response
+authentication (CRAM-MD5, SPA, etc) requires challenge from server before
+we know which server to connect.
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), ftppr(8), proxy(8), socks(8), tcppm(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:56 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/socks.8.html b/doc/html/man8/socks.8.html
new file mode 100644
index 0000000..0190dc3
--- /dev/null
+++ b/doc/html/man8/socks.8.html
@@ -0,0 +1,148 @@
+
+Manpage of socks
+
+socks
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+socks
+
+- SOCKS 4/4.5/5 gateway service
+
+SYNOPSIS
+
+socks [-d]
+
+[-l[[@]logfile]]
+
+[-pport]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+
+DESCRIPTION
+
+socks
+
+is SOCKS server. It supports SOCKSv4, SOCKSv4.5 (extension to v4 for
+server side name resolution) and SOCKSv5. SOCKSv5 specification allows both
+outgoing and reverse TCP connections and UDP portmapping.
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -u
+
+
-
+Never ask for username authentication
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate connections
+from. External IP must be specified if you need incoming connections.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -p
+
+
-
+Port. Port proxy listens for incoming connections. Default is 1080.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
+
+CLIENTS
+
+You should use client with SOCKS support or use some socksification support
+(for example
+SocksCAP
+
+or
+FreeCAP).
+
+Configure client to use
+internal_ip
+
+and
+port.
+
+SOCKS allows to use almost any application protocol without limitation. This
+implementation also allows to open priviledged port on server (if socks has
+sufficient privileges). If you need to control access use
+3proxy(8)
+
+instead.
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), proxy(8), ftppr(8), pop3p(8), tcppm(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:56 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/tcppm.8.html b/doc/html/man8/tcppm.8.html
new file mode 100644
index 0000000..de28989
--- /dev/null
+++ b/doc/html/man8/tcppm.8.html
@@ -0,0 +1,146 @@
+
+Manpage of tcppm
+
+tcppm
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+tcppm
+
+- TCP port mapper
+
+SYNOPSIS
+
+tcppm [-d]
+
+[-l[[@]logfile]]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+local_port remote_host remote_port
+
+
+DESCRIPTION
+
+tcppm
+
+forwards connections from local to remote TCP port
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
+
+ARGUMENTS
+
+
+- local_port
+
+
-
+- port tcppm accepts connection
+
- remote_host
+
+
-
+- IP address of the host connection is forwarded to
+
- remote_port
+
+
-
+- remote port connection is forwarded to
+
+
+CLIENTS
+
+Any TCP based application can be used as a client. Use
+internal_ip
+
+and
+local_port
+
+as a destination in client application. Connection is forwarded to
+remote_host:remote_port
+
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- ARGUMENTS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:57 GMT, April 07, 2014
+
+
diff --git a/doc/html/man8/udppm.8.html b/doc/html/man8/udppm.8.html
new file mode 100644
index 0000000..1ccaa23
--- /dev/null
+++ b/doc/html/man8/udppm.8.html
@@ -0,0 +1,153 @@
+
+Manpage of udppm
+
+udppm
+Section: Universal proxy server (8)
Updated: July 2009
Index
+Return to Main Contents
+
+
+NAME
+
+udppm
+
+- UDP port mapper
+
+SYNOPSIS
+
+pop3p [-ds]
+
+[-l[[@]logfile]]
+
+[-iinternal_ip]
+
+[-eexternal_ip]
+
+local_port remote_host remote_port
+
+
+DESCRIPTION
+
+udppm
+
+forwards datagrams from local to remote UDP port
+
+OPTIONS
+
+
+- -I
+
+
-
+Inetd mode. Standalone service only.
+
- -d
+
+
-
+Daemonise. Detach service from console and run in the background.
+
- -t
+
+
-
+Be silenT. Do not log start/stop/accept error records.
+
- -e
+
+
-
+External address. IP address of interface proxy should initiate datagrams
+from.
+By default system will deside which address to use in accordance
+with routing table.
+
- -i
+
+
-
+Internal address. IP address proxy accepts datagrams to.
+By default connection to any interface is accepted. It's usually unsafe.
+
- -l
+
+
-
+Log. By default logging is to stdout. If
+logfile
+
+is specified logging is to file. Under Unix, if
+'@'
+
+preceeds
+logfile,
+
+syslog is used for logging.
+
- -s
+
+
-
+Single packet. By default only one client can use udppm service, but
+if -s is specified only one packet will be forwarded between client and server.
+It allows to share service between multiple clients for single packet services
+(for example name lookups).
+
+
+ARGUMENTS
+
+
+- local_port
+
+
-
+- port udppm accepts datagrams
+
- remote_host
+
+
-
+- IP address of the host datagrams are forwarded to
+
- remote_port
+
+
-
+- remote port datagrams are forwarded to
+
+
+CLIENTS
+
+Any UDP based application can be used as a client. Use
+internal_ip
+
+and
+local_port
+
+as a destination in client application. All datagrams are forwarded to
+remote_host:remote_port
+
+
+BUGS
+
+Report all bugs to
+3proxy@security.nnov.ru
+
+
+SEE ALSO
+
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), udppm(8), syslogd(8),
+
+
+http://3proxy.ru/
+
+AUTHORS
+
+3proxy is designed by 3APA3A
+(3APA3A@security.nnov.ru),
+
+Vladimir Dubrovin
+(vlad@sandy.ru)
+
+
+
+
+ Index
+
+- NAME
-
+
- SYNOPSIS
-
+
- DESCRIPTION
-
+
- OPTIONS
-
+
- ARGUMENTS
-
+
- CLIENTS
-
+
- BUGS
-
+
- SEE ALSO
-
+
- AUTHORS
-
+
+
+This document was created by
+using the manual pages.
+Time: 21:23:57 GMT, April 07, 2014
+
+
diff --git a/doc/html/securityen.html b/doc/html/securityen.html
new file mode 100644
index 0000000..4a3db7e
--- /dev/null
+++ b/doc/html/securityen.html
@@ -0,0 +1,37 @@
+3proxy security considirations
+
+
+- Never install 3proxy suid. If you need it to run suid write some
+wrapper with fixed configuration file.
+
- Make configuration file only available to account 3proxy starts with.
+
- Under Windows NT/2000/XP/2003 if 3proxy is used as service create new
+unprivileged local account without "logon locally" right. Assign this account
+to 3proxy service.
+
- Under unix use chroot to jail 3proxy (make sure files included in
+configuration file after 'chroot' command, if any, are available from jail)
+
- Under Unix, either start 3proxy with unprivileged account or, if you need
+some privileged ports to be used by 3proxy, use setgid/setuid commands inside
+3proxy.cfg immediately after last occurance of service binded to
+privileged port in configuration file (setgid must preceed setuid).
+
- Allways use full paths in configuration file
+
- Try to avoid 'strong' authentication, because only cleartext
+authentication method is currently available.
+
- Always specify internal and external interfaces.
+
- Always limit connections to internal network and localhost (to 127.0.0.1 and
+all interfaces) with ACLs. Be carefull, because BIND command in SOCKS requies
+BIND method with external interface IP address to be allowed.
+
- Always use nserver and nscache under Unix, overwise DoS attack is possible
+with unreachable DNS server (because gethostbyname will block over threads).
+
- Remember, that 'nbname' authentication is not reliable and can be spoofed.
+
- Keep logs in secure location, because some confidential information from
+user's request can be logged.
+
- Use -xyz+A character filtering sequences for 'logformat', especially with
+ODBC logging to prevent SQL and log record injections.
+
- Immediately report all service crashes to developers
+
- Participate in code audit :)
+
+
+
+
+
+
$Id: securityen.html,v 1.4 2007/05/07 09:16:51 vlad Exp $
\ No newline at end of file
diff --git a/doc/ru/3proxy_for_dummies.rtf b/doc/ru/3proxy_for_dummies.rtf
new file mode 100644
index 0000000..50389d0
--- /dev/null
+++ b/doc/ru/3proxy_for_dummies.rtf
@@ -0,0 +1,1825 @@
+{\rtf1\adeflang1025\ansi\ansicpg1251\uc1\adeff31507\deff0\stshfdbch31505\stshfloch31506\stshfhich31506\stshfbi31507\deflang1049\deflangfe1049\themelang1049\themelangfe0\themelangcs0{\fonttbl{\f0\fbidi \froman\fcharset204\fprq2{\*\panose 02020603050405020304}Times New Roman;}{\f1\fbidi \fswiss\fcharset204\fprq2{\*\panose 020b0604020202020204}Arial;}
+{\f1\fbidi \fswiss\fcharset204\fprq2{\*\panose 020b0604020202020204}Arial;}{\f39\fbidi \fswiss\fcharset204\fprq2{\*\panose 020b0604020202020204}Arial CYR;}{\flomajor\f31500\fbidi \froman\fcharset204\fprq2{\*\panose 02020603050405020304}Times New Roman;}
+{\fdbmajor\f31501\fbidi \froman\fcharset204\fprq2{\*\panose 02020603050405020304}Times New Roman;}{\fhimajor\f31502\fbidi \froman\fcharset204\fprq2{\*\panose 02040503050406030204}Cambria;}
+{\fbimajor\f31503\fbidi \froman\fcharset204\fprq2{\*\panose 02020603050405020304}Times New Roman;}{\flominor\f31504\fbidi \froman\fcharset204\fprq2{\*\panose 02020603050405020304}Times New Roman;}
+{\fdbminor\f31505\fbidi \froman\fcharset204\fprq2{\*\panose 02020603050405020304}Times New Roman;}{\fhiminor\f31506\fbidi \fswiss\fcharset204\fprq2{\*\panose 020f0502020204030204}Calibri;}
+{\fbiminor\f31507\fbidi \froman\fcharset204\fprq2{\*\panose 02020603050405020304}Times New Roman;}{\f44\fbidi \froman\fcharset0\fprq2 Times New Roman;}{\f42\fbidi \froman\fcharset238\fprq2 Times New Roman CE;}
+{\f45\fbidi \froman\fcharset161\fprq2 Times New Roman Greek;}{\f46\fbidi \froman\fcharset162\fprq2 Times New Roman Tur;}{\f47\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\f48\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic);}
+{\f49\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic;}{\f50\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese);}{\f54\fbidi \fswiss\fcharset0\fprq2 Arial;}{\f52\fbidi \fswiss\fcharset238\fprq2 Arial CE;}
+{\f55\fbidi \fswiss\fcharset161\fprq2 Arial Greek;}{\f56\fbidi \fswiss\fcharset162\fprq2 Arial Tur;}{\f57\fbidi \fswiss\fcharset177\fprq2 Arial (Hebrew);}{\f58\fbidi \fswiss\fcharset178\fprq2 Arial (Arabic);}
+{\f59\fbidi \fswiss\fcharset186\fprq2 Arial Baltic;}{\f60\fbidi \fswiss\fcharset163\fprq2 Arial (Vietnamese);}{\f54\fbidi \fswiss\fcharset0\fprq2 Arial;}{\f52\fbidi \fswiss\fcharset238\fprq2 Arial CE;}{\f55\fbidi \fswiss\fcharset161\fprq2 Arial Greek;}
+{\f56\fbidi \fswiss\fcharset162\fprq2 Arial Tur;}{\f57\fbidi \fswiss\fcharset177\fprq2 Arial (Hebrew);}{\f58\fbidi \fswiss\fcharset178\fprq2 Arial (Arabic);}{\f59\fbidi \fswiss\fcharset186\fprq2 Arial Baltic;}
+{\f60\fbidi \fswiss\fcharset163\fprq2 Arial (Vietnamese);}{\f434\fbidi \fswiss\fcharset0\fprq2 Arial CYR;}{\f432\fbidi \fswiss\fcharset238\fprq2 Arial CYR CE;}{\f435\fbidi \fswiss\fcharset161\fprq2 Arial CYR Greek;}
+{\f436\fbidi \fswiss\fcharset162\fprq2 Arial CYR Tur;}{\f437\fbidi \fswiss\fcharset177\fprq2 Arial CYR (Hebrew);}{\f438\fbidi \fswiss\fcharset178\fprq2 Arial CYR (Arabic);}{\f439\fbidi \fswiss\fcharset186\fprq2 Arial CYR Baltic;}
+{\f440\fbidi \fswiss\fcharset163\fprq2 Arial CYR (Vietnamese);}{\flomajor\f31510\fbidi \froman\fcharset0\fprq2 Times New Roman;}{\flomajor\f31508\fbidi \froman\fcharset238\fprq2 Times New Roman CE;}
+{\flomajor\f31511\fbidi \froman\fcharset161\fprq2 Times New Roman Greek;}{\flomajor\f31512\fbidi \froman\fcharset162\fprq2 Times New Roman Tur;}{\flomajor\f31513\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew);}
+{\flomajor\f31514\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic);}{\flomajor\f31515\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic;}{\flomajor\f31516\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese);}
+{\fdbmajor\f31520\fbidi \froman\fcharset0\fprq2 Times New Roman;}{\fdbmajor\f31518\fbidi \froman\fcharset238\fprq2 Times New Roman CE;}{\fdbmajor\f31521\fbidi \froman\fcharset161\fprq2 Times New Roman Greek;}
+{\fdbmajor\f31522\fbidi \froman\fcharset162\fprq2 Times New Roman Tur;}{\fdbmajor\f31523\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\fdbmajor\f31524\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic);}
+{\fdbmajor\f31525\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic;}{\fdbmajor\f31526\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese);}{\fhimajor\f31530\fbidi \froman\fcharset0\fprq2 Cambria;}
+{\fhimajor\f31528\fbidi \froman\fcharset238\fprq2 Cambria CE;}{\fhimajor\f31531\fbidi \froman\fcharset161\fprq2 Cambria Greek;}{\fhimajor\f31532\fbidi \froman\fcharset162\fprq2 Cambria Tur;}
+{\fhimajor\f31535\fbidi \froman\fcharset186\fprq2 Cambria Baltic;}{\fhimajor\f31536\fbidi \froman\fcharset163\fprq2 Cambria (Vietnamese);}{\fbimajor\f31540\fbidi \froman\fcharset0\fprq2 Times New Roman;}
+{\fbimajor\f31538\fbidi \froman\fcharset238\fprq2 Times New Roman CE;}{\fbimajor\f31541\fbidi \froman\fcharset161\fprq2 Times New Roman Greek;}{\fbimajor\f31542\fbidi \froman\fcharset162\fprq2 Times New Roman Tur;}
+{\fbimajor\f31543\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\fbimajor\f31544\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic);}{\fbimajor\f31545\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic;}
+{\fbimajor\f31546\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese);}{\flominor\f31550\fbidi \froman\fcharset0\fprq2 Times New Roman;}{\flominor\f31548\fbidi \froman\fcharset238\fprq2 Times New Roman CE;}
+{\flominor\f31551\fbidi \froman\fcharset161\fprq2 Times New Roman Greek;}{\flominor\f31552\fbidi \froman\fcharset162\fprq2 Times New Roman Tur;}{\flominor\f31553\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew);}
+{\flominor\f31554\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic);}{\flominor\f31555\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic;}{\flominor\f31556\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese);}
+{\fdbminor\f31560\fbidi \froman\fcharset0\fprq2 Times New Roman;}{\fdbminor\f31558\fbidi \froman\fcharset238\fprq2 Times New Roman CE;}{\fdbminor\f31561\fbidi \froman\fcharset161\fprq2 Times New Roman Greek;}
+{\fdbminor\f31562\fbidi \froman\fcharset162\fprq2 Times New Roman Tur;}{\fdbminor\f31563\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\fdbminor\f31564\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic);}
+{\fdbminor\f31565\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic;}{\fdbminor\f31566\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese);}{\fhiminor\f31570\fbidi \fswiss\fcharset0\fprq2 Calibri;}
+{\fhiminor\f31568\fbidi \fswiss\fcharset238\fprq2 Calibri CE;}{\fhiminor\f31571\fbidi \fswiss\fcharset161\fprq2 Calibri Greek;}{\fhiminor\f31572\fbidi \fswiss\fcharset162\fprq2 Calibri Tur;}
+{\fhiminor\f31575\fbidi \fswiss\fcharset186\fprq2 Calibri Baltic;}{\fhiminor\f31576\fbidi \fswiss\fcharset163\fprq2 Calibri (Vietnamese);}{\fbiminor\f31580\fbidi \froman\fcharset0\fprq2 Times New Roman;}
+{\fbiminor\f31578\fbidi \froman\fcharset238\fprq2 Times New Roman CE;}{\fbiminor\f31581\fbidi \froman\fcharset161\fprq2 Times New Roman Greek;}{\fbiminor\f31582\fbidi \froman\fcharset162\fprq2 Times New Roman Tur;}
+{\fbiminor\f31583\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew);}{\fbiminor\f31584\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic);}{\fbiminor\f31585\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic;}
+{\fbiminor\f31586\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese);}}{\colortbl;\red0\green0\blue0;\red0\green0\blue255;\red0\green255\blue255;\red0\green255\blue0;\red255\green0\blue255;\red255\green0\blue0;\red255\green255\blue0;
+\red255\green255\blue255;\red0\green0\blue128;\red0\green128\blue128;\red0\green128\blue0;\red128\green0\blue128;\red128\green0\blue0;\red128\green128\blue0;\red128\green128\blue128;\red192\green192\blue192;}{\*\defchp
+\fs22\loch\af31506\hich\af31506\dbch\af31505 }{\*\defpap \ql \li0\ri0\sa200\sl276\slmult1\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 }\noqfpromote {\stylesheet{\ql \li0\ri0\sa200\sl276\slmult1
+\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af31507\afs22\alang1025 \ltrch\fcs0 \fs22\lang1049\langfe1049\loch\f31506\hich\af31506\dbch\af31505\cgrid\langnp1049\langfenp1049 \snext0 \sqformat \spriority0 Normal;}
+{\*\cs10 \additive \ssemihidden \sunhideused \spriority1 Default Paragraph Font;}{\*
+\ts11\tsrowd\trftsWidthB3\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tblind0\tblindtype3\tsvertalt\tsbrdrt\tsbrdrl\tsbrdrb\tsbrdrr\tsbrdrdgl\tsbrdrdgr\tsbrdrh\tsbrdrv \ql \li0\ri0\sa200\sl276\slmult1
+\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af31507\afs22\alang1025 \ltrch\fcs0 \fs22\lang1049\langfe1049\loch\f31506\hich\af31506\dbch\af31505\cgrid\langnp1049\langfenp1049 \snext11 \ssemihidden \sunhideused
+Normal Table;}}{\*\rsidtbl \rsid3764488\rsid11355186}{\mmathPr\mmathFont34\mbrkBin0\mbrkBinSub0\msmallFrac0\mdispDef1\mlMargin0\mrMargin0\mdefJc1\mwrapIndent1440\mintLim0\mnaryLim1}{\info{\operator vlad}{\creatim\yr2011\mo7\dy9\hr1\min32}
+{\revtim\yr2011\mo7\dy9\hr1\min34}{\version2}{\edmins2}{\nofpages18}{\nofwords7180}{\nofchars40932}{\nofcharsws48016}{\vern49255}}{\*\xmlnstbl {\xmlns1 http://schemas.microsoft.com/office/word/2003/wordml}}
+\paperw12240\paperh15840\margl1701\margr850\margt1134\margb1134\gutter0\ltrsect
+\deftab709\widowctrl\ftnbj\aenddoc\trackmoves0\trackformatting1\donotembedsysfont0\relyonvml0\donotembedlingdata1\grfdocevents0\validatexml0\showplaceholdtext0\ignoremixedcontent0\saveinvalidxml0\showxmlerrors0\horzdoc\dghspace120\dgvspace120
+\dghorigin1701\dgvorigin1984\dghshow0\dgvshow3\jcompress\viewkind1\viewscale100\rsidroot3764488 \fet0{\*\wgrffmtfilter 2450}\ilfomacatclnup0\ltrpar \sectd \ltrsect\linex0\sectdefaultcl\sftnbj {\*\pnseclvl1\pnucrm\pnstart1\pnindent720\pnhang {\pntxta .}}
+{\*\pnseclvl2\pnucltr\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl3\pndec\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl4\pnlcltr\pnstart1\pnindent720\pnhang {\pntxta )}}{\*\pnseclvl5\pndec\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}
+{\*\pnseclvl6\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl7\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl8\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl9
+\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}\pard\plain \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 \rtlch\fcs1 \af31507\afs22\alang1025 \ltrch\fcs0
+\fs22\lang1049\langfe1049\loch\af31506\hich\af31506\dbch\af31505\cgrid\langnp1049\langfenp1049 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+Kurmaeff Halit
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e8\'fe\'ed\'fc}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\hich\af39\dbch\af31505\loch\f39 2006
+\par
+\par \hich\af39\dbch\af31505\loch\f39 halit_at_mail_dot_ru
+\par }{\rtlch\fcs1 \ab\af39\afs20 \ltrch\fcs0 \b\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d1\'e5\'ec\'fc\loch\f39 \hich\f39 \'f1\'eb\'ee\'e5\'e2\loch\f39 \hich\f39 \'ec\'e0\'f2\'f0\'e5\'f8\'ea\'e8\loch\f39 \hich\f39 , \'e8\'eb\'e8
+\loch\f39 \hich\f39 \'cd\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\loch\f39 \hich\f39 3proxy \'e4\'eb\'ff\loch\f39 \hich\f39 \'f7\'e0\'e9\'ed\'e8\'ea\'ee\'e2
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 (\'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 \hich\f39 1.3, \'e8\'f1\'ef\'f0\'e0\'e2\'eb\'e5\'ed\'ed\'e0\'ff\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e4\'ee\'ef\'ee\'eb\'ed\'e5\'ed\'ed\'e0\'ff\loch\f39 \hich\f39 ,
+\'ec\'e0\'f0\'f2\loch\f39 , 2010)
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par \loch\af39\dbch\af31505\hich\f39 \'d5\'ee\'f7\'f3\loch\f39 \hich\f39 \'ef\'ee\'e4\'e5\'eb\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'f1\'e2\'ee\'e8\'ec\loch\f39 \hich\f39 \'ee\'ef\'fb\'f2\'ee\'ec\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'ed\'e0
+\'f1\'f2\'f0\'ee\'e9\'ea\'e5\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'f2\'e5\'eb\'fc\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 \'c7\'e0\'f0\'e0\'e7\'fb
+\loch\f39 \hich\f39 - 3proxy. \'c4\'ee\'eb\'e3\'ee\'e5\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e2\'f0\'e5\'ec\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'eb\'f1\'ff\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'e8\'ec\loch\f39 \hich\f39 \'e8
+\'ed\'f2\'e5\'f0\'e5\'f1\'ed\'fb\'ec\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'ee\'ec\loch\f39 \hich\f39 ES Proxy http://esproxy.org.ua \'ee\'f2\loch\f39 \hich\f39 \'c3\'e5\'ee\'f0\'e3\'e8\'ff\loch\f39 \hich\f39 \'cf\'e0
+\'e2\'eb\'e5\'ed\'ea\'ee\loch\f39 \hich\f39 - \'ec\'e0\'eb\'e5\'ed\'fc\'ea\'ee\'e3\'ee\loch\f39 \hich\f39 (\'e2\'f1\'e5\'e3\'ee\loch\f39 \hich\f39 \'ee\'e4\'e8\'ed\loch\f39 \hich\f39 exe-\'f8\'ed\'e8\'ea\loch\f39 \hich\f39 \'ed\'e0\loch\f39
+\hich\f39 300 \'ea\'c1\loch\f39 \hich\f39 ), \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e5\loch\f39 \hich\f39 \'e8\loch\f39
+\hich\f39 \'ee\'f7\'e5\'ed\'fc\loch\f39 \hich\f39 \'ed\'e5\'f2\'f0\'e5\'e1\'ee\'e2\'e0\'f2\'e5\'eb\'fc\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f0\'e5\'f1\'f3\'f0\'f1\'e0\'ec\loch\f39 \hich\f39 - \'ef\'ee\loch\f39 \hich\f39 \'ea
+\'f0\'e0\'e9\'ed\'e5\'e9\loch\f39 \hich\f39 \'ec\'e5\'f0\'e5\loch\f39 \hich\f39 , \'ef\'f0\'e8\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'e8\loch\f39 \hich\f39 \'f1\'ee\'f2\'ed\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\loch\af39\dbch\af31505\hich\f39 \'fc
+\loch\af39\dbch\af31505\hich\f39 \'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 \'ee\'ed\loch\f39 \hich\f39 \'f3\'ec\'f3\'e4\'f0\'ff\'eb\'f1\'ff\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39
+\hich\f39 \'f1\'f2\'e0\'f0\'e8\'ed\'ed\'ee\'ec\loch\f39 \hich\f39 P133, \'ef\'ee\'f7\'f2\'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0\'f2\'fb\'ea\'e0\'ff\'f1\'fc\loch\f39 \hich\f39 . \'c8\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee
+\loch\f39 \hich\f39 \'e2\'ee\'f2\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 <\'ef\'ee\'f7\'f2\'e8\loch\f39 \hich\f39 > - \'e8\'ed\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea
+\'f1\'e8\'ea\loch\f39 \hich\f39 \'f1\'e0\'ec\'ee\'ef\'f0\'ee\'e8\'e7\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ef\'ee\'e6\'e8\'f0\'e0\'eb\loch\f39 \hich\f39 100% \'ef\'f0\'ee\'f6\'e5\'f1\'f1\'ee\'f0\'e0\loch\f39 \hich\f39 , \'f5\'ee\'f2\'ff
+\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'f0\'ee\'e4\'ee\'eb\'e6\'e0\'eb\loch\f39 \hich\f39 \'f7\'e0\'f1\'f2\'e8\'f7\'ed\'ee\loch\f39 \hich\f39 \'e8\'eb\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'ed\'ee\'f1\'f2\'fc\'fe\loch\f39 \hich\f39 \'f1\'ef
+\'f0\'e0\'e2\'eb\'ff\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'f1\'ee\loch\f39 \hich\f39 \'f1\'e2\'ee\'e8\'ec\'e8\loch\f39 \hich\f39 \'ee\'e1\'ff\'e7\'e0\'ed\'ed\'ee\'f1\'f2\'ff\'ec\'e8\loch\f39 \hich\f39 - \'e0\loch\f39 \hich\f39 \'f2\'e0\'ea\'e6\'e5
+\loch\f39 \hich\f39 \'f2\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'e0\loch\af39\dbch\af31505\hich\f39 \'e2\'f2\'ee\'f0\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'e8\loch\f39 \hich\f39
+ 4 \'e3\'ee\'e4\'e0\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ef\'ee\'e4\'e0\'e5\'f2\loch\f39 \hich\f39 \'ed\'e8\'ea\'e0\'ea\'e8\'f5\loch\f39 \hich\f39 \'ef\'f0\'e8\'e7\'ed\'e0\'ea\'ee\'e2\loch\f39 \hich\f39
+\'e6\'e8\'e7\'ed\'e8\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'e4\'f3\'ea\'f2\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f0\'e0\'e7\'e2\'e8\'f2\'e8\'e8
+\loch\f39 \hich\f39 - \'ef\'f0\'e8\'e2\'e5\'eb\'e8\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'ef\'ee\'e8\'f1\'ea\'e0\'ec\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'e4\'f5\'ee\'e4\'ff\'f9\'e5\'e3\'ee\loch\f39
+\hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 . \'d1\'ea\'e0\'e6\'f3\loch\f39 \hich\f39 \'f1\'f0\'e0\'e7\'f3\loch\f39 \hich\f39 - \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ea\'f0
+\'e0\'f1\'e8\'e2\'fb\'ec\'e8\loch\f39 \hich\f39 GUI \'ec\'e5\'ed\'ff\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'eb\'e5\'ea\'e0\'eb\'e8\loch\f39 \hich\f39 \'ec\'e0\'eb\'ee\loch\f39 \hich\f39 , \'ff\loch\f39 \hich\f39 \'f1\'f2\'ee\'f0\'ee\'ed\'ed\'e8\'ea
+\loch\f39 \hich\f39 \'ef\'f0\'e8\'ed\'f6\'e8\'ef\'e0\loch\f39 \hich\f39 <\'cc\'ed\'e5\loch\f39 \hich\f39 \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'e5\'f5\'e0\'f2\'fc\loch\f39 \hich\f39 >, \'e0\loch\f39 \hich\f39 \'ea\'f0\'e0
+\loch\af39\dbch\af31505\hich\f39 \'f1\loch\af39\dbch\af31505\hich\f39 \'e8\'e2\'fb\'e9\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\loch\f39 \hich\f39 - \'fd\'f2\'ee\loch\f39 \hich\f39 , \'ea\'ee\'ed\'e5\'f7\'ed\'ee\loch\f39 \hich\f39 , \'f5
+\'ee\'f0\'ee\'f8\'ee\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f3\'f9\'e5\'f0\'e1\loch\f39 \hich\f39 \'ef\'f0\'ee\'e8\'e7\'e2\'ee\'e4\'e8\'f2\'e5\'eb\'fc\'ed\'ee\'f1\'f2\'e8\loch\f39
+\hich\f39 . \'cf\'e5\'f0\'e5\'ef\'f0\'ee\'e1\'ee\'e2\'e0\'e2\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 \'f5\'ee\'f0\'ee\'f8\'e5\'e9\loch\f39 \hich\f39 \'e6\'e8\'e7\'ed\'e8\loch\f39 \hich\f39 5-6 \'f0\'e0\'e7\'ed\'fb
+\'f5\loch\f39 \hich\f39 \'ef\'f0\'ee\'e4\'f3\'ea\'f2\'ee\'e2\loch\f39 \hich\f39 (\'f1\'f0\'e5\'e4\'e8\loch\f39 \hich\f39 \'ed\'e8\'f5\loch\f39 \hich\f39 Usergate, Proxy+, Lan4net....) \'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ee\'f1\'f2
+\'e0\'e2\'f8\'e8\'f1\'fc\loch\f39 \hich\f39 \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'fb\'ec\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e0\'e5\'ec\'fb\'ec\'e8\loch\f39 \hich\f39 \'f0\'e5\'e7\'f3\'eb\'fc\'f2\'e0\'f2\'e0\'ec\'e8\loch\f39 \hich\f39 (\'e4\'ee\'eb\'e6
+\'e5\'ed\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e8\'e7\'e2\'e5\'f1\'f2\'ed\'fb\'e9\loch\f39 \hich\f39 \'ef\'f0\'ee\'e4\loch\af39\dbch\af31505\hich\f39 \'f3
+\loch\af39\dbch\af31505\hich\f39 \'ea\'f2\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 Microsoft \'ff\loch\f39 \hich\f39 \'f0\'e5\'f8\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ee\'f2\'ec\'e5\'eb\loch\f39 \hich\f39 \'e2\'e2\'e8\'e4\'f3
+\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'e2\'fb\'f1\'ee\'ea\'ee\'e9\loch\f39 \hich\f39 \'f1\'f2\'ee\'e8\'ec\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 ), \'f0\'e5\'f8\'e8\'eb\loch\f39 \hich\f39 \'ef\'ee\'ef\'f0\'ee\'e1\'ee\'e2\'e0\'f2\'fc
+\loch\f39 \hich\f39 \'f2\'e0\'ea\'e8\loch\f39 \hich\f39 3proxy, \'f2\'e5\'ec\loch\f39 \hich\f39 \'ef\'e0\'f7\'e5\loch\f39 \hich\f39 \'f1\'eb\'fb\'f8\'e0\'eb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'ed\'ee\'ec\loch\f39
+\hich\f39 \'f5\'ee\'f0\'ee\'f8\'e8\'e5\loch\f39 \hich\f39 \'ee\'f2\'ea\'eb\'e8\'ea\'e8\loch\f39 \hich\f39 . \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'ea\'f2\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e6\'e0\'eb\'ee\'e2\'e0\'eb\'f1\'ff\loch\f39
+\hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ed\'e5\'e3\'ee\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'eb\'ee\'e6\'ed\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2
+\'f0\'ee\'e9\'ea\'e8\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'f7\'e5\'ec\loch\f39 \hich\f39 , \'e4\'ee\'eb\'e6\'e5\'ed\loch\f39 \hich\f39 \'f1\'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 , \'ed\'e5\'ec\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e7\'e0
+\'e1\'e5\'e3\'e0\'ff\loch\f39 \hich\f39 \'e2\'ef\'e5\'f0\'e5\'e4\loch\f39 \hich\f39 , \'ff\loch\f39 \hich\f39 \'e8\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'e8\loch\af39\dbch\af31505\hich\f39 \'ec\'e5\'eb\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6
+\'ed\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 \'f3\'e1\'e5\'e4\'e8\'f2\'fc\'f1\'ff\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e0\'e9\'e4\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\'e5\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e0\'e1\'ee\'f2\'f7\'e8\'ea\'e0\loch\f39
+\hich\f39 http://3proxy.ru/, \'ef\'ee\'f7\'e8\'f2\'e0\'eb\loch\f39 \hich\f39 \'ef\'f0\'ee\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 - \'e8\loch\f39 \hich\f39 \'e2\'ee\'e7\'f0\'e0\'e4\'ee\'e2\'e0\'eb\'f1\'ff
+\loch\f39 \hich\f39 . \'d2\'f3\'f2\loch\f39 \hich\f39 \'f2\'e5\'e1\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'e5\loch\f39 \hich\f39 \'eb\'e8\'ec\'e8\'f2\'fb\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'ee
+\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 , \'e8\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'f1\'ea\'ee\'f0\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 , \'e8
+\loch\f39 \hich\f39 FTP, \'e8\loch\f39 \hich\f39 SOCKS, \'e8\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2-\'ec\'e0\'ef\'ef\'e5\'f0\'fb\loch\f39 \hich\f39 , \'e8\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\loch\f39
+\hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'ef\'ee\'e4\loch\f39 Win\hich\af39\dbch\af31505\loch\f39 \hich\f39 dows, \'f2\'e0\'ea\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\'e4\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'ec\'e8\loch\f39 \hich\f39
+\'ed\'e8\'ea\'f1\'e0\'ec\'e8\loch\f39 \hich\f39 . \'c1\'ee\'eb\'e5\'e5\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'e5\'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39 \hich\f39 \'f3
+\'ed\'e8\'ea\'e0\'eb\'fc\'ed\'fb\'e5\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 - \'e2\'f0\'ee\'e4\'e5\loch\f39 \hich\f39 \'e2\'e5\'e4\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e6\'f3\'f0\'ed\'e0\'eb\'ee\'e2
+\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 ODBC \'e8\'eb\'e8\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'e8\'e7\'e2\'ee\'eb\'fc\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\'e0
+\loch\f39 \hich\f39 \'eb\'ee\'e3\'ee\'e2\loch\f39 \hich\f39 , \'f2\'e0\'ea\loch\f39 \hich\f39 \'f7\'f2\'ee\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 <\'f1
+\'ea\'ee\'f0\'ec\'e8\'f2\'fc\loch\f39 \hich\f39 > \'eb\'fe\'e1\'ee\'ec\'f3\loch\f39 \hich\f39 \'eb\'ee\'e3-\'e0\'ed\'e0\'eb\'e8\'e7\'e0\'f2\'ee\'f0\'f3\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39 \'ee\'e1\'f9\'e5\'ec\loch\f39 \hich\f39 , \'e2\'f1\'b8
+\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'ed\'e0\'e4\'ee\'e1\'e8\'f2\'fc\loch\af39\dbch\af31505\hich\f39 \'f1\loch\af39\dbch\af31505\hich\f39 \'ff\loch\f39 \hich\f39 \'f1\'e8\'f1\'f2\'e5\'ec
+\'ed\'ee\'ec\'f3\loch\f39 \hich\f39 \'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e0\'f2\'ee\'f0\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39
+\'f3\'e4\'ee\'e2\'eb\'e5\'f2\'e2\'ee\'f0\'e8\'f2\'fc\loch\f39 \hich\f39 , \'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ef\'f3\'f1\'ea\'e0\'f2\'fc\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'ea\'f3\'e4\'e0
+\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'ee\loch\f39 \hich\f39 ... \'cd\'e5\loch\f39 \hich\f39 \'f5\'e2\'e0\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'f0\'e0\'e7\'e2\'e5\loch\f39 \hich\f39 \'f7\'f2\'ee\loch\f39 \hich\f39 \'ea\'fd
+\'f8\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'e4\'e0\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ef\'e0\'f0\'fb\loch\f39 \hich\f39 \'ec\'e5\'eb\'ee\'f7\'e5\'e9\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'fd\'f2\'ee
+\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'ee\'e1\'e5\'f9\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'ea\'ee\'f0\'ee\'ec\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f9\'e5\'ec\loch\f39
+\hich\f39 , \'e4\'e0\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'f1\'ee\'e4\'e5\'f0\'e6\'e0\'ed\'e8\'fe\loch\f39 \hich\f39 \'f4\'ee\'f0\'f3\'ec\'e0\loch\f39 \hich\f39 , \'ee\'ef\'e5\'f0\'e0\'f2\'e8\'e2\'ed\'fb\'ec
+\loch\f39 \hich\f39 \'ee\'f2\'e2\'e5\'f2\'e0\'ec\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\loch\af39\dbch\af31505\hich\f39 \'f1\loch\af39\dbch\af31505\hich\f39 \'fb\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5
+\'eb\'e5\'e9\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f1\'ee\'e4\'e5\'f0\'e6\'e8\'ec\'ee\'ec\'f3\loch\f39 \hich\f39 changelog'\'e0\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e8\loch\f39 \hich\f39 0.6 \'e2\'e8\'e4\'ed\'ee\loch\f39 \hich\f39 , \'f7
+\'f2\'ee\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\loch\f39 \hich\f39 \'ed\'e0\'e4\loch\f39 \hich\f39 \'f1\'ee\'e2\'e5\'f0\'f8\'e5\'ed\'f1\'f2\'e2\'ee\'e2\'e0\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'e8
+\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'eb\'ed\'fb\'ec\loch\f39 \hich\f39 \'f5\'ee\'e4\'ee\'ec\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'ea\'e0\'f7\'e0\'e2\loch\f39 \hich\f39 \'e4\'e8\'f1\'f2\'f0\'e8\'e1\'f3\'f2\'e8\'e2\loch\f39 \hich\f39 (555 \'ea\'c1\loch\f39 \hich\f39 ! \'e2\loch\f39 \hich\f39 \'e0\'ea\'f2\'f3\'e0\'eb\'fc\'ed\'ee\'e9\loch\f39
+\hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ec\'ee\'ec\'e5\'ed\'f2\loch\f39 \hich\f39 \'ed\'e0\'ef\'e8\'f1\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'fc\'e8\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e8\loch\f39 \hich\f39 devel 0.6), \'ff
+\loch\f39 \hich\f39 \'ef\'ee\'e3\'f0\'f3\'e7\'e8\'eb\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e8\'e7\'f3\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e7\'f6\'e0\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'f3\'f0\'e0\'f6\'e8
+\'ee\'ed\'ed\loch\af39\dbch\af31505\hich\f39 \'ee\'e3\'ee\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'e0\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 \'ef\'f0\'e8\'eb\'e0\'e3\'e0\'eb\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39
+\'ea\'ee\'ec\'ef\'eb\'e5\'ea\'f2\'e5\loch\f39 \hich\f39 . \'cf\'ee\loch\f39 \hich\f39 \'f5\'ee\'e4\'f3\loch\f39 \hich\f39 \'e8\'e7\'f3\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e2\'ee\'e7\'ed\'e8\'ea\'eb\'ee\loch\f39 \hich\f39 \'ed\'e5\'ec\'e0\'eb\'ee
+\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\'ee\'e2\loch\f39 \hich\f39 . \'d1\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'e0\loch\f39 \hich\f39 \'ef\'f0\'e8\'f8\'eb\'ee\'f1\'fc\loch\f39
+\hich\f39 \'f1\'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f0\'e0\'f1\'ef\'e5\'f7\'e0\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ed\'e5\'f1\'ef\'e5\'f8\'ed\'ee\loch\f39 \hich\f39 \'e8\'e7
+\'f3\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 , FAQ \'e8\loch\f39 \hich\f39 HowTo. \'ca\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'fd\'f2\'e8\loch\f39 \hich\f39 \'ec\'e0\'f2\'e5\'f0\'e8\'e0\'eb\'fb\loch\f39 \hich\f39 \'e1\'fb\'eb\'e8
+\loch\f39 \hich\f39 \'e8\'e7\'f3\'f7\'e5\'ed\'fb\loch\f39 \hich\f39 , \'ee\'ea\'e0\'e7\'e0\'eb\'ee\'f1\'fc\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\'ee\'e2\loch\f39 \hich\f39 \'ec\'e5\'ed\'fc\'f8\'e5\loch\f39
+\hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'f2\'e0\'eb\'ee\loch\f39 \hich\f39 . \'cf\'ee\'ef\'fb\'f2\'ea\'e8\hich\af39\dbch\af31505\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'e7\'e0\'ef\'f3\'f1\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1
+\'e8\loch\f39 \hich\f39 \'e1\'fb\'eb\'e8\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2\'ee\'ed\'e0\'f7\'e0\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e1\'e5\'e7\'f3\'f1\'ef\'e5\'f8\'ed\'fb\'ec\'e8\loch\f39 \hich\f39 , \'ef\'f0\'e8\'f8\'eb\'ee\'f1\'fc\loch\f39
+\hich\f39 \'ef\'ee\'f7\'e8\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ec\'e0\'f2\'e5\'f0\'e8\'e0\'eb\'fb\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e5\'f0\'e5\'ed\'f6\'e8\'e8\loch\f39 \hich\f39 , \'e3\'e4\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e1\'fb
+\'eb\loch\f39 \hich\f39 \'ed\'e0\'e9\'e4\'e5\'ed\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e7\'e5\'f6\loch\f39 \hich\f39 \'ee\'f7\'e5\'ed\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'f3\'f0\'e0\'f6
+\'e8\'ee\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'e0\loch\f39 \hich\f39 , \'ef\'ee\'f1\'f2\'f0\'ee\'e5\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\'ed\'f6\'e8\'ef\'f3\loch\f39 \hich\f39 <\'f0\'e0\'e7
+\'f0\'e5\'f8\'e8\'f2\'fc\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e2\'f1\'e5\'ec\loch\f39 \hich\f39 >. \'ca\'f1\'f2\'e0\'f2\'e8\loch\f39 \hich\f39 , \'e2\'ee\'f2\loch\f39 \hich\f39 \'ee\'ed\loch\f39 \hich\f39 (\'e2
+\'e5\'f0\'f1\'e8\'ff\loch\f39 0):
+\par \hich\af39\dbch\af31505\loch\f39 auth none
+\par \hich\af39\dbch\af31505\loch\f39 log
+\par \hich\af39\dbch\af31505\loch\f39 proxy
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'f1\'e5\loch\f39 \hich\f39 \'e3\'e5\'ed\'e8\'e0\'eb\'fc\'ed\'ee\'e5\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39 \hich\f39 \'e3\'ee\'e2\'ee\'f0\'e8\'f2\'f1\'ff\loch\f39 \hich\f39 , \'ef\'f0\'ee\'f1\'f2\'ee\loch\f39
+\hich\f39 . \'c0\loch\f39 \hich\f39 \'ec\'ee\'ff\loch\f39 \hich\f39 \'ee\'f8\'e8\'e1\'ea\'e0\loch\f39 \hich\f39 \'e7\'e0\'ea\'eb\'fe\'f7\'e0\'eb\'e0\'f1\'fc\loch\f39 \hich\f39 , \'ea\'f1\'f2\'e0\'f2\'e8\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39
+\hich\f39 \'f0\'e0\'e7\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f2\'ee\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ff\loch\f39 \hich\f39 \'ef\'fb\'f2\'e0\'eb\'f1\'ff\loch\f39 \hich\f39 \'f1\'f0\'e0\'e7\'f3\loch\f39 \hich\f39 \'ed
+\'e0\'ef\'e8\'f1\'e0\'f2\'fc\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f7\'e8\'e9\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'f1\'ee\loch\f39 \hich\f39 \'e2\'f1\'e5\'ec\'e8\loch\f39 \hich\f39 \'eb\'e8\'ec\'e8\'f2\'e0\'ec\'e8\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'f2.\'e4\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'e0\'e6\'ed\'ee\loch\f39 \hich\f39 ! \'ca\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ee\'e1\'f9\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5
+\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'e5\'ed\loch\f39 \hich\f39 \'ed\'e0\'f5\'ee\'e4\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\'e9\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'e5\loch\f39 \hich\f39 \'f1\loch\f39
+\hich\f39 \'e8\'f1\'ef\'ee\'eb\'ed\'ff\'e5\'ec\'fb\'ec\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'ee\'ec\loch\f39 3proxy.exe \hich\af39\dbch\af31505\loch\f39 \hich\f39 (\'ef\'ee\loch\f39 \hich\f39 \'f3\'ec\'ee\'eb\'f7\'e0\'ed\'e8\'fe\loch\f39 \hich\f39
+\'e2\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'e5\loch\f39 \hich\f39 bin). \'c8\'ed\'e0\'f7\'e5\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e0\'f2\'fc\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'ed\'ff\'e5\'ec\'fb\'e9
+\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'ef\'f3\'f2\'e8\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'f3\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 90% \'f1\'eb\'f3\'f7\'e0\'ff\'f5\loch\f39 \hich\f39 \'fd\'f2\'ee\'f2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2
+\'e0\'f2\'fc\loch\f39 \hich\f39 . \'d0\'e0\'e7\'e1\'e5\'f0\'e5\'ec\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e5\'ec\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2\'ee\'e9\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'e5\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'fb\'e2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e0
+\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'ff\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f2\'f0\'e5\'e1\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 , \'e4\'ee\'f1\'f2\'f3\'ef
+\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e0\'fe\'f2\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'fe\'e7\'e5\'f0\loch\af39\dbch\af31505\hich\f39 \'fb\loch\f39 \hich\f39 \'e1\'e5\'e7\loch\f39 \hich\f39 \'e8\'f1\'ea\'eb\'fe\'f7\'e5\'ed\'e8\'ff
+\loch\f39 \hich\f39 . \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e2\'fb\loch\f39 \hich\f39 \'ef\'ee\'ef\'fb\'f2\'e0\'e5\'f2\'e5\'f1\'fc\loch\f39 \hich\f39 \'e2\'e2\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'fd\'f2\'ee\'e9
+\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 \'ea\'e0\'ea\'e8\'e5-\'f2\'ee\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 , \'f2\'ee\loch\f39
+\hich\f39 \'ee\'ed\'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'f0\'e0\'e1\'ee\'f2\'e0\'fe\'f2\loch\f39 \hich\f39 , \'ee\loch\f39 \hich\f39 \'f7\'e5\'ec\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f1\'ee\'ee\'e1\'f9\'e0\'e5\'f2\'f1\'ff
+\loch\f39 \hich\f39 \'e2\loch\f39 FAQ.
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'ee\loch\f39 \hich\f39 \'e2\'f2\'ee\'f0\'ee\'e9\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e5\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e5\'ec\loch\f39 \hich\f39 \'e2\'e5\'e4\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'eb\'ee
+\'e3\'e0\loch\f39 \hich\f39 , \'ef\'f0\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'fb\'e2\'e0\'e5\'ec\loch\f39 \hich\f39 \'ef\'f3\'f2\'fc\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f4
+\'e0\'e9\'eb\'f3\loch\f39 \hich\f39 , \'f1\'eb\'e5\'e4\'ee\'e2\'e0\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 , \'eb\'ee\'e3\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e2\'fb\'e2\'ee\'e4\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'fd\loch\af39\dbch\af31505\hich\f39 \'ea\'f0\'e0\'ed\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c8\loch\f39 \hich\f39 , \'ed\'e0\'ea\'ee\'ed\'e5\'f6\loch\f39 \hich\f39 , \'e7\'e0\'ef\'f3\'f1\'ea\'e0\'e5\'ec\loch\f39 \hich\f39 \'f1\'e0\'ec\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'f1\'f2\'e0\'ed\'e4\'e0\'f0\'f2\'ed\'ee\'ec\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'f3\loch\f39 3128.
+\par \loch\af39\dbch\af31505\hich\f39 \'cc\'ed\'ee\'e3\'e8\'e5\loch\f39 \hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'fb\loch\f39 \hich\f39 \'ee\'ef\'f3\'f9\'e5\'ed\'fb\loch\f39 \hich\f39 , \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39
+\hich\f39 , \'e4\'eb\'ff\loch\f39 \hich\f39 \'ed\'e8\'f5\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'e2\'ee\'e7\'fc\'ec\'e5\'f2\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39
+\'f3\'ec\'ee\'eb\'f7\'e0\'ed\'e8\'fe\loch\f39 \hich\f39 . \'d2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'f2\'e5\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5
+\'eb\'fc\'f1\'ea\'e8\'f5\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\'f5\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e8\'f2\'fc\loch\f39 \hich\f39 \'e2\'e0\'f8\loch\f39 \hich\f39 \'eb\'fe\'e1\'e8\'ec\'fb\'e9\loch\f39 \hich\f39 \'e1
+\'f0\'e0\'f3\'e7\'e5\'f0\loch\f39 \hich\f39 - \'ed\'e5\loch\f39 \hich\f39 \'e7\'ed\'e0\'fe\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'e2\'e0\loch\af39\dbch\af31505\hich\f39 \'f1\loch\f39 \hich\f39 , \'e0\loch\f39
+\hich\f39 \'f3\loch\f39 \hich\f39 \'ec\'e5\'ed\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'ef\'ee\'f7\'e5\'f2\'ed\'ee\'e5\loch\f39 \hich\f39 \'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'eb\'e5\'f2\loch\f39
+\hich\f39 8 \'e7\'e0\'ed\'e8\'ec\'e0\'e5\'f2\loch\f39 \hich\f39 Opera - \'e2\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'f1\'e5\'f2\'e5\'e2\'fb\'f5\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'ef\'ee\'f1
+\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e3\'e0\'eb\'ee\'f7\'ea\'f3\loch\f39 \hich\f39 "\'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 ", \'e0\loch\f39 \hich\f39 \'e7\'e0\'f2\'e5
+\'ec\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'ef\'f0\'ee\'f2\'ee\'ea\'ee\'eb\'ee\'e2\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 IP \'e2\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39
+\'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 3128.
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e2\'e0\'ec\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ed\'f3\'e6\'e5\'ed\loch\f39 \hich\f39 \'f3\'f7\'e5\'f2\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ea\'ee
+\'ed\'f2\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 , \'ec\'e0\'eb\'ee\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'e5\'f1\'f3\'e5\'f2\loch\f39 \hich\f39 \'e1\'e5\'e7\'ee\'ef\'e0\loch\af39\dbch\af31505\hich\f39 \'f1\'ed\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 \'f1\'e5
+\'f2\'e8\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'e2\'e0\'f1\loch\f39 \hich\f39 \'e1\'e5\'e7\'eb\'e8\'ec\'e8\'f2\'ed\'fb\'e9\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39
+\'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'fd\'f2\'e8\'ec\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 , \'ef\'ee\loch\f39 \hich\f39 \'ea\'f0\'e0\'e9\'ed\'e5\'e9\loch\f39 \hich\f39 \'ec
+\'e5\'f0\'e5\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2\'ee\'e5\loch\f39 \hich\f39 \'e2\'f0\'e5\'ec\'ff\loch\f39 \hich\f39 . \'cc\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'f3\'e4\'e0\'eb\'e8\'f2\'fc
+\loch\f39 \hich\f39 \'e2\'f2\'ee\'f0\'f3\'fe\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'f3\loch\f39 \hich\f39 , \'ee\'ed\'e0\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ee\'e1\'ff\'e7\'e0\'f2\'e5\'eb\'fc\'ed\'e0\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'eb\'e5\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39 \'e1\'fb\loch\f39
+\hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'f3\loch\f39 \hich\f39 service, \'e4\'eb\'ff\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb
+\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e0\'eb\'f1\'ff\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'e0\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39
+\'ed\'e5\loch\f39 \hich\f39 \'ee\'f2\'e4\'e5\'eb\'fc\'ed\'fb\'ec\loch\f39 \hich\f39 \'ef\'f0\'e8\'eb\'ee\'e6\'e5\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39
+\hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'e2\'e0\'f0\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'f3\'f1\'f2\'e0\'ed\'ee\'e2\'e8\'f2\'fc\loch\f39
+\hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'f3\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'ee\'e9\loch\f39 3proxy --install.
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'ef\'e5\'f8\'e8\'f2\'e5\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 ! \'c4\'e5\'eb\'ee\loch\f39
+\hich\f39 \'e2\loch\f39 \hich\f39 \'f2\'ee\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f7\'e8\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f9\'e5\'ed\loch\f39 \hich\f39 \'ef\'f0\'e8\'eb\'ee\'e6\'e5\'ed\'e8\'e5\'ec\loch\f39
+\hich\f39 , 3proxy \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'f1\'f0\'e0\'e7\'f3\loch\f39 \hich\f39 \'e2\'fb\'e4\'e0\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'fd\'ea\'f0\'e0\'ed\loch\f39 \hich\f39 \'f1\'ee\'ee\'e1\'f9\'e5\'ed
+\'e8\'ff\loch\f39 \hich\f39 \'ee\'e1\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ee\'e1\'f0\'e0\'e1\'e0\'f2\'fb\'e2\'e0\'e5\'ec\'fb\'f5\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'e0\'f5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ee\'f8\'e8\'e1
+\'ea\'e0\'f5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e2\'e0\'ec\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\'e4\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1\'ec\'ee\'f2\'f0\'e5\'f2\'fc\loch\f39 \hich\f39 \'f2\'e5\'ea\'f1\'f2\'ee\'e2
+\'fb\'e5\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 . \'cf\'f0\'e8\'f7\'e5\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ee\'f1\'ee\'e1\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'f0\'e0\'e4\'f3\'e5\'f2\loch\f39 \hich\f39 , \'f1
+\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'ea\'ee\'e4\'e0\loch\f39 \hich\f39 \'ee\'f8\'e8\'e1\'ea\'e8\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'ee\'ec\'e5\'f0\'e0\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e8
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 , \'e3\'e4\'e5\loch\f39 \hich\f39 \'fd\'f2\'e0\loch\f39 \hich\f39 \'ee\'f8\'e8\'e1\'ea\'e0\loch\f39 \hich\f39 \'ef\'f0\'e8\'f1\'f3\'f2\'f1\'f2\'e2\'f3\'e5\'f2
+\loch\f39 \hich\f39 . \'c0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'e0\'e4\'e8\'e8\loch\f39 \hich\f39 \'ee\'e1\'f3\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'ee\'f7\'e5\'ed\'fc\loch\f39 \hich\f39 \'ef
+\'ee\'ec\'ee\'e3\'e0\'e5\'f2\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'e0\loch\f39 \hich\f39 , \'e8\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\loch\f39 \hich\f39 \'e2\'e0\'e6\'ed\'ee\'e5\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0
+\loch\af39\dbch\af31505\hich\f39 \'ed\'e8\'e5\loch\f39 \hich\f39 \'ed\'e0\'f1\'f7\'e5\'f2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 - \'ed\'e8\'ea\'e0\'ea\'e8\'f5\loch\f39 \hich\f39 \'eb\'e8\'f8\'ed\'e8\'f5\loch\f39 \hich\f39
+ \'ef\'f0\'ee\'e1\'e5\'eb\'ee\'e2\loch\f39 \hich\f39 , \'f2\'e0\'e1\'f3\'eb\'ff\'f6\'e8\'e9\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f2.\'ef\loch\f39 \hich\f39 . \'e7\'ed\'e0\'ea\'ee\'e2\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0
+\'eb\'e5\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e8\loch\f39 \hich\f39 , \'e8\'ed\'e0\'f7\'e5\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e0\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'f1
+\'f7\'e8\'f2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'e7\'e0\'ea\'ee\'ec\'e5\'ed\'f2\'e8\'f0\'ee\'e2\'e0\'ed\'ed\'ee\'e9\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e8\'f2\loch\f39 \hich\f39 , \'ed\'e5\loch\f39 \hich\f39 \'e1\'f3\'e4
+\'e5\'f2\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e1\'e0\'f2\'fb\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 .
+\par
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'ce\'ef\'e8\'f8\'e5\'ec\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'ef\'ee\'eb\'e0\'e3\'e0\'e5\'ec\'f3\'fe\loch\f39 \hich\f39 \'f1\'e8\'f2\'f3\'e0\'f6\'e8\'fe\loch\f39 \hich\f39 . \'cd\'e0\'e4\'ee\loch\f39 \hich\f39 "\'ef\'f3
+\'f1\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\loch\f39 \hich\f39 " \'ed\'e0\loch\f39 \hich\f39 3 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\loch\f39 \hich\f39 \'f1\hich\af39\dbch\af31505\loch\f39 \hich\f39 IP \'e0\'e4\'f0\'e5
+\'f1\'e0\'ec\'e8\loch\f39 \hich\f39 192.168.0.2,192.168.0.3,192.168.0.4, \'e2\loch\f39 \hich\f39 \'ea\'e0\'f7\'e5\'f1\'f2\'e2\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'e2\'fb\'f1\'f2\'f3\'ef\'e0
+\'e5\'f2\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e4\'e2\'f3\'ec\'ff\loch\f39 \hich\f39 \'f1\'e5\'f2\'e5\'e2\'fb\'ec\'e8\loch\f39 \hich\f39 \'ea\'e0\'f0\'f2\'e0\'ec\'e8\loch\f39 \hich\f39 ,
+\'e2\'ed\'f3\'f2\'f0\'e5\'ed\'ed\'e8\'ec\loch\f39 \hich\f39 IP-\'e0\'e4\'f0\'e5\'f1\'ee\'ec\loch\f39 \hich\f39 192.168.0.1 \'e8\loch\f39 \hich\f39 "\'e2\'ed\'e5\'f8\'ed\'e8\'ec\loch\f39 \hich\f39 ", \'f2\'ee\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc
+\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'ed\'fb\'ec\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 \'ef\'f0\'ee\'e2\'e0\'e9\'e4\'e5\'f0\'e0\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\'ee\'ec\loch\f39 \hich\f39 211.80.11.12. \'ce\'f2\loch\f39
+\hich\f39 \'ef\'f0\'ee\'e2\'e0\'e9\'e4\'e5\'f0\'e0\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'fb\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\loch\af39\dbch\af31505\hich\f39 \'e0\hich\af39\dbch\af31505\loch\f39 \hich\f39
+ DNS-\'f1\'e5\'f0\'e2\'e5\'f0\'ee\'e2\loch\f39 \hich\f39 : 213.153.100.1 \'e8\loch\f39 213.153.101.1.
+\par \loch\af39\dbch\af31505\hich\f39 \'d3\loch\f39 \hich\f39 \'ef\'f0\'ee\'e2\'e0\'e9\'e4\'e5\'f0\'e0\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e5\'ed\loch\f39 \hich\f39 SMTP-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 smtp.provider.ru.
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e0\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e5\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\'e0\'ec\'e8\loch\f39 \hich\f39 192.168.0.2-192.168.0.4 \'f0\'e0\'e1\'ee\'f2\'e0\'fe
+\'f2\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e8\loch\f39 \hich\f39 \'c8\'e2\'e0\'ed\'ee\'e2\loch\f39 \hich\f39 , \'cf\'e5\'f2\'f0\'ee\'e2\loch\f39 \hich\f39 , \'d1\'e8\'e4\'ee\'f0\'ee\'e2\loch\f39 \hich\f39 \'f1\'ee\'ee\'f2\'e2
+\'e5\'f2\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 \'f3\'f1\'f2\'e0\'ed\'ee\'e2\'e8\'ec\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'f3\loch\f39 c:\\\hich\f39 3proxy, \'f5
+\loch\af39\dbch\af31505\hich\f39 \'ee\'f2\'ff\loch\f39 \hich\f39 \'f3\'f1\'f2\'e0\'ed\'ee\'e2\'e8\'ec\loch\f39 \hich\f39 - \'fd\'f2\'ee\loch\f39 \hich\f39 \'e3\'f0\'ee\'ec\'ea\'ee\loch\f39 \hich\f39 \'f1\'ea\'e0\'e7\'e0\'ed\'ee\loch\f39 \hich\f39 ,
+\'e4\'eb\'ff\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'eb\'e0\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\loch\f39 \hich\f39 \'f0\'e0\'f1\'ef\'e0\'ea\'ee\'e2\'e0\'f2\'fc\loch\f39
+\hich\f39 \'e8\'e7\loch\f39 \hich\f39 zip-\'e0\'f0\'f5\'e8\'e2\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'ed\'ed\'f3\'fe\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'f3\loch\f39 \hich\f39 , \'ef\'f3\'f1\'f2\'fc\loch\f39 \hich\f39 \'fd
+\'f2\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 c:\\\hich\f39 3proxy (\'ef\'f0\'ee\loch\f39 \hich\f39 \'e8\'ed\'f1\'f2\'e0\'eb\'eb\'ff\'f6\'e8\'fe\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39
+\hich\f39 \'f1\'ea\'e0\'e7\'e0\'ed\'ee\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\loch\f39 ).
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\'e4\'ee\'e2\'e0\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e7\'e0\'e9\'ec\'e5\'ec\'f1\'ff\loch\f39 \hich\f39 \'e4\'e0\'eb\'fc\'ed\'e5\'e9\'f8\'e8\'ec
+\loch\f39 \hich\f39 \'f3\'eb\'f3\'f7\'f8\'e5\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'f2\'e5\'eb\'fc\'ed\'ee\'e3\'ee\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0
+\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'eb\'ff\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'eb\'e0\loch\f39 \hich\f39 \'f3\'ea\'e0\'e6\'e5\'ec\loch\f39 \hich\f39 \'e2\'ed\'f3\'f2\'f0\'e5\'ed\'ed\'e8\'e9\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'e2\'fb\loch\f39 \hich\f39 \'e2\'e5\'e4\'fc\loch\f39 \hich\f39 \'ef\'ee\'ed\'e8\'ec\'e0\'e5\'f2\'e5\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e7\'e4\'e5\'f1\'fc\loch\f39 \hich\f39 \'e4\'ee\'eb
+\'e6\'e5\'ed\loch\f39 \hich\f39 \'f1\'f2\'ee\'ff\'f2\'fc\loch\f39 \hich\f39 IP \'f1\'e5\'f2\'e5\'e2\'ee\'e9\loch\f39 \hich\f39 \'ea\'e0\'f0\'f2\'fb\loch\f39 \hich\f39 \'c2\'c0\'d8\'c5\'c3\'ce\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39
+\hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 , \'ed\'e0\'f1\'f2\'f0\'ee\'e5\'ed\'ed\'ee\'e9\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'eb\'ee\'ea\'e0\'eb\'fc\'ed\'f3\'fe\loch\f39 \hich\f39 \'f1\'e5\'f2\'fc\loch\f39 \hich\f39 . \'dd
+\'f2\'e0\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e5\'f2\loch\f39 \hich\f39 \'e8\'ec\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'f2\'ee\'f2\loch\f39 \hich\f39 IP \'e0\'e4\'f0\'e5\'f1\loch\f39 \hich\f39 \'e2
+\loch\f39 \hich\f39 \'eb\'ee\'ea\'e0\'eb\'fc\'ed\'ee\'e9\loch\f39 \hich\f39 \'f1\'e5\'f2\'e8\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ea\'ee\'f2\'ee\'f0\'ee\'ec\'f3\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f2\loch\f39 \hich\f39 \'ee
+\loch\af39\dbch\af31505\hich\f39 \'e1\'f0\'e0\'f9\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'fb\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 , \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2
+\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 , \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'f0\'ee\'ef\'e8\'f1\'e0\'ed\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\'e0\'f5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'e0\'f7\'e5
+\'f1\'f2\'e2\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'e8\loch\f39 \hich\f39 \'e2\'ed\'e5\'f8\'ed\'e8\'e9\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\'fb\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0
+\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par }\pard \ltrpar\ql \fi-360\li360\ri0\nowidctlpar\tx360\wrapdefault\hyphpar0\faauto\rin0\lin360\itap0 {\rtlch\fcs1 \af1\afs18 \ltrch\fcs0 \f1\fs18\kerning1\insrsid11355186\charrsid3764488 -\tab }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 \'fd\'f2\'ee\'f2\loch\f39 \hich\f39 IP \'e0\'e4\'f0\'e5\'f1\loch\f39 \hich\f39 \'e2\'fb\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'ed\'fb\loch\f39 \hich\f39 \'e1
+\'fb\'eb\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 \'ef\'f0\'ee\'e2\'e0\'e9\'e4\'e5\'f0\'e0\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39 \hich\f39 \'ef\'f0\'e0\'e2\'e8\'eb\'ee\loch\f39
+\hich\f39 , \'e2\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'e2\'fb\'e4\'e5\'eb\'e5\'ed\'ed\'ee\'e9\loch\f39 \hich\f39 \'eb\loch\af39\dbch\af31505\hich\f39 \'e8\'ed\'e8\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'f2
+\'e0\'ea\loch\f39 \hich\f39 \'ed\'e0\'e7\'fb\'e2\'e0\'e5\'ec\'fb\'e9\loch\f39 \hich\f39 "\'f0\'e5\'e0\'eb\'fc\'ed\'fb\'e9\loch\f39 \hich\f39 " IP, \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'e5\'ed\loch\f39 \hich\f39 \'e1\'fb\'f2
+\'fc\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e5\'ed\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\'e0\loch\f39 \hich\f39 (\'f5\'ee\'f2\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39
+\hich\f39 \'ee\'e1\'ff\'e7\'e0\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 ).
+\par }{\rtlch\fcs1 \af1\afs18 \ltrch\fcs0 \f1\fs18\kerning1\insrsid11355186\charrsid3764488 -\tab }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e6\'e5\loch\f39
+\hich\f39 \'f3\loch\f39 \hich\f39 \'e2\'e0\'f1\loch\f39 \hich\f39 \'ea\'ee\'ec\'ec\'f3\'f2\'e8\'f0\'f3\'e5\'ec\'fb\'e9\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 : dial-up \'e8\'eb\'e8\loch\f39 \hich\f39 vpn \'e8\loch\f39
+\hich\f39 \'e2\'e0\'f8\loch\f39 \hich\f39 \'e2\'ed\'e5\'f8\'ed\'e8\'e9\loch\f39 \hich\f39 IP \'f0\'e5\'e3\'f3\'eb\'ff\'f0\'ed\'ee\loch\f39 \hich\f39 \'ec\'e5\'ed\'ff\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc
+\loch\f39 \hich\f39 2 \'f1\'ef\'ee\'f1\'ee\'e1\'e0\loch\f39 \hich\f39 \'f0\'e5\'f8\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'f0\'ee\'e1\'eb\'e5\'ec\'fb\loch\f39 \hich\f39 . \'cf\'e5\'f0\'e2\'fb\'e9\loch\f39 \hich\f39 \emdash \loch\f39 \hich\f39 \'ed
+\'e0\'ef\'e8\'f1\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\'ea\loch\af39\dbch\af31505\hich\f39 \'f0\'e8\'ef\'f2\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'e4\'f1\'f2\'e0\'e2\'eb\'ff
+\'f2\'fc\loch\f39 \hich\f39 \'e2\'ed\'e5\'f8\'ed\'e8\'e9\loch\f39 \hich\f39 IP \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 include \'eb\'e8\'e1\'ee\loch\f39 \hich\f39 $ (\'fd\'f2\'ee\loch\f39 \hich\f39 \'ec\'fb\loch\f39 \hich\f39 \'ee\'e1\'f1\'f3\'e4
+\'e8\'ec\loch\f39 \hich\f39 \'ef\'ee\'e7\'e6\'e5\loch\f39 \hich\f39 ). \'c2\'f2\'ee\'f0\'ee\'e9\loch\f39 \hich\f39 \emdash \loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39
+
+\par }{\rtlch\fcs1 \af1\afs18 \ltrch\fcs0 \f1\fs18\kerning1\insrsid11355186\charrsid3764488 -\tab }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 external 0.0.0.0
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e5\'ee\'e1\'f5\'ee\'e4\'e8\'ec\'ee\'e5\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 - \'ea\'ee\'ec\'e0\'ed\'e4\'e0\'ec\'e8\loch\f39 \hich\f39 external \'e8\loch\f39 \hich\f39
+ internal \'ec\'fb\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e5\'ec\loch\f39 \hich\f39 \'e2\'ed\'f3\'f2\'f0\'e5\'ed\'ed\'e8\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e2\'ed\'e5\'f8\'ed\'e8\'e5\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1
+\'fb\loch\f39 \hich\f39 , \'f2\'e0\'ea\loch\f39 \hich\f39 \'f1\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 , \'e3\'eb\'ee\'e1\'e0\'eb\'fc\loch\af39\dbch\af31505\hich\f39 \'ed\'ee\loch\f39 \hich\f39 , \'ed\'e0\loch\f39 \hich\f39 \'e2\'e5\'f1\'fc\loch\f39
+\hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 . \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39
+\hich\f39 \'ed\'e5\'ee\'e1\'f5\'ee\'e4\'e8\'ec\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ee\'f2\'e4\'e5\'eb\'fc\'ed\'fb\'f5\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e2\'e0\'f2\'fc
+\loch\f39 \hich\f39 \'f1\'e2\'ee\'e8\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\'fb\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'f1\'e4\'e5\'eb\'e0\'f2\'fc
+\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ef\'ee\'ec\'ee\'f9\'fc\'fe\loch\f39 \hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'ee\'e2\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 -e \'e8\loch\f39 \hich\f39 -i, \'ed\'e0\'ef\'f0\'e8
+\'ec\'e5\'f0\loch\f39 \hich\f39 , \'e0\'ed\'e0\'eb\'ee\'e3\'ee\'ec\loch\f39 \hich\f39 \'f1\'ee\'e2\'ee\'ea\'f3\'ef\'ed\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\loch\f39
+\par
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 proxy
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e1\'f3\'e4\'e5\'f2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 proxy -i192.168.0.1 -e211.80.11.12
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f3\'f1\'ea\'ee\'f0\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'f0\'ee
+\'f6\'e5\'f1\'f1\'e0\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e8\'ec\'e5\'ed\loch\f39 \hich\f39 \'f5\'ee\'f1\'f2\'ee\'e2\loch\f39 \hich\f39 \'f3\'ea\'e0\'e6\'e5\'ec\loch\f39 \hich\f39 DNS-\'f1\'e5\'f0\'e2\'e5
+\'f0\'e0\loch\f39 \hich\f39 - \'eb\'f3\'f7\'f8\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5\'e3\'ee\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 DNS-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'e2\'e0\'f8\'e5\'e3\'ee\loch\f39
+\hich\f39 \'ef\'f0\'ee\'e2\'e0\'e9\'e4\'e5\'f0\'e0\loch\f39 \hich\f39 - \'e8\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'f2\'e8\'ec\loch\f39 \hich\f39 \'ea\'fd\'f8\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'e5\loch\f39 DNS:
+\par
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.100.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nsc\hich\af39\dbch\af31505\loch\f39 ache 65536
+\par \loch\af39\dbch\af31505\hich\f39 \'e3\'e4\'e5\loch\f39 \hich\f39 \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 65536 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'e1\'fb\'f2\'fc\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e5\loch\f39 \hich\f39 , \'e6\'e5\'eb\'e0
+\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'f1\'f2\'e0\'e2\'eb\'ff\'fe\'f9\'e5\'e5\loch\f39 \hich\f39 \'f1\'f2\'e5\'ef\'e5\'ed\'fc\loch\f39 \hich\f39 \'f7\'e8\'f1\'eb\'e0\loch\f39 \hich\f39 2 \'e8\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2
+\'e0\'f2\'ee\'f7\'ed\'ee\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'ee\'e5\loch\f39 \hich\f39 . \'ca\'f1\'f2\'e0\'f2\'e8\loch\f39 \hich\f39 , \'ee\'f2\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 nscache \'ed\'e0\'ef\'f0\'ff\'ec
+\'f3\'fe\loch\f39 \hich\f39 \'e7\'e0\'e2\'e8\'f1\'e8\'f2\loch\f39 \hich\f39 \'ea\'ee\'eb\'e8\'f7\'e5\'f1\'f2\'e2\'ee\loch\f39 \hich\f39 \'ee\'ef\'e5\'f0\'e0\'f2\'e8\'e2\'ed\'ee\'e9\loch\f39 \hich\f39 \'ef\'e0\'ec\'ff\'f2\'e8\loch\f39 \hich\f39 , \'e7
+\'e0\'ed\'e8\'ec\'e0\'e5\'ec\'ee\'e9\loch\f39 \hich\f39 3proxy. \'c8\'f2\'e0\'ea\loch\f39 \hich\f39 , \'ed\'e0\loch\f39 \hich\f39 \'e4\'e0\'ed\'ed\'ee\'ec\loch\f39 \hich\f39 \'fd\'f2\'e0\'ef\'e5\loch\f39 \hich\f39 \'ed\'e0\'f8\loch\f39 \hich\f39 \'ea
+\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'e8\'f2\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'f3\'fe\'f9\'e8\'ec\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e7\'ee\'ec\loch\f39 \hich\f39 (\'e2\'e5\'f0\'f1\'e8\'ff
+\loch\f39 1):
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.100.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nscache 65536
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 log
+\par \hich\af39\dbch\af31505\loch\f39 auth none
+\par \hich\af39\dbch\af31505\loch\f39 proxy
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'e0\'e6\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'ed\'e0\'ec\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f5\'e2\'e0\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'eb\'ed\'ee\'f6\'e5
+\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'ee\'e2\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ee\'f8\'e8\'e1\'ee\'ea\loch\f39
+\hich\f39 , \'e2\'e5\'e4\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'fd\'ea\'f0\'e0\'ed\'e5\loch\f39 \hich\f39 \'eb\'ee\'e3\loch\f39 \hich\f39 \'ee\'f7\'e5\'ed\'fc\loch\f39 \hich\f39 \'e1\'fb\'f1\'f2\'f0\'ee\loch\f39
+\loch\af39\dbch\af31505\hich\f39 \'ef\'f0\'ee\'eb\'e5\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 ! \'cf\'ee\'ec\'e5\'ed\'ff\'e5\'ec\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 \hich\f39 log \'ed\'e0\loch\f39 \hich\f39 \'e1\'ee\'eb\'e5\'e5
+\loch\f39 \hich\f39 \'f0\'e0\'f1\'f8\'e8\'f0\'e5\'ed\'ed\'f3\'fe\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 log c:\\3proxy\\logs\\3proxy.log D
+\par \loch\af39\dbch\af31505\hich\f39 \'d2\'e0\'ea\'e8\'ec\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e7\'ee\'ec\loch\f39 \hich\f39 , \'ec\'fb\loch\f39 \hich\f39 \'e4\'e0\'e5\'ec\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 \hich\f39 \'f1\'ee\'f5\'f0
+\'e0\'ed\'ff\'f2\'fc\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'e5\loch\f39 c:\\3proxy\\\hich\f39 logs \'e8\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'fb\'e9\loch\f39 \hich\f39 \'e4\'e5\'ed\'fc
+\loch\f39 \hich\f39 \'ed\'e0\'f7\'e8\'ed\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'ee\'e2\'fb\'e9\loch\f39 \hich\f39 \'eb\'ee\'e3\loch\f39 \hich\f39 (\'ee\'ef\'f6\'e8\'ff\loch\f39 \hich\f39 D). \'c5\'f9\'e5\loch\f39 \hich\f39 \'f0\'e0\'e7\loch\f39
+\hich\f39 \'ed\'e0\'ef\'ee\'ec\'ed\'fe\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'e0\'e4\'e8\'e8\loch\f39 \hich\f39 \'f2\'e5\'f1\'f2\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'eb\'f3\'f7\'f8
+\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'e6\'e5\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'f1\'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\'fb\'e2\'ee\'e4\loch\f39 \hich\f39 \'eb\'ee\'e3\'ee\'e2\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'fd\'ea\'f0\'e0\'ed\loch\f39 \hich\f39 - \'f2\'e0\'ea\loch\f39 \hich\f39 \'f3\'e4\'ee\'e1\'ed\'e5\'e5\loch\f39 \hich\f39 \'e8\'f1\'ea\'e0\'f2\'fc\loch\f39 \hich\f39 \'ee\'f8\'e8\'e1\'ea\'e8\loch\f39 \hich\f39 . \'c8\loch\f39
+\hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'e4\'ee\'e1\'e0\'e2\'e8\'ec\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 rotate 30
+\par \loch\af39\dbch\af31505\hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'e5\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'eb\'ee\'e3\'e0
+\'ec\'e8\loch\f39 \hich\f39 \'f1\'ee\'f5\'f0\'e0\'ed\'ff\'eb\'e8\'f1\'fc\loch\f39 \hich\f39 \'eb\'e8\'f8\'fc\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\'e4\'ed\'e8\'e5\loch\f39 \hich\f39 30 \'f4\'e0\'e9\'eb\'ee\'e2\loch\f39 \hich\f39 , \'e0\loch\f39
+\hich\f39 \'f2\'ee\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 \hich\f39 \'e1\'fb\'f1\'f2\'f0\'ee\loch\f39 \hich\f39 \'f0\'e0\'f1\'f2\'f3\'f2\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'e4\'e8\'f1\'ea\loch\f39
+\hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f0\'e5\'e7\'e8\'ed\'ee\'e2\'fb\'e9\loch\f39 !
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'f1\'ef\'ee\'ec\'e8\'ed\'e0\'e5\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 3proxy \'ef\'ee\'e7\'e2\'ee\'eb\'ff\'e5\'f2\loch\f39 \hich\f39 \'ed\'e0\'ec\loch\f39 \hich\f39 \'e2\'e8\'e4
+\loch\af39\dbch\af31505\hich\f39 \'ee\'e8\'e7\'ec\'e5\'ed\'e8\'f2\'fc\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\loch\f39 \hich\f39 \'eb\'ee\'e3\'ee\'e2\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39
+\hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e1\'e0\'f2\'fb\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'ec\loch\f39 \hich\f39 \'eb\'ee\'e3-\'e0\'ed\'e0\'eb\'e8\'e7\'e0\'f2\'ee\'f0\'ee\'ec
+\loch\f39 \hich\f39 . \'ca\'f1\'f2\'e0\'f2\'e8\loch\f39 \hich\f39 , \'ec\'ee\'e3\'f3\loch\f39 \hich\f39 \'ef\'ee\'f1\'ee\'e2\'e5\'f2\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f1
+\'e0\'e9\'f2\'e0\loch\f39 \hich\f39 www.wrspy.ru \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\'eb\'e8\'f7\'ed\'fb\'e9\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'f1\'e5\'e9\'f7\'e0\'f1\loch\f39
+\hich\f39 \'ed\'e5\'ec\'e0\'eb\'ee\'e2\'e0\'e6\'ed\'ee\loch\f39 \hich\f39 , \'e1\'e5\'f1\'ef\'eb\'e0\'f2\'ed\'fb\'e9\loch\f39 \hich\f39 \'eb\'ee\'e3-\'e0\'ed\'e0\'eb\'e8\'e7\'e0\'f2\'ee\'f0\loch\f39 \hich\f39 Wrspy \'ed\'e0\'f8\'e5\'e3\'ee\loch\f39
+\hich\f39 \'ee\'f2\'e5\'f7\'e5\'f1\'f2\'e2\'e5\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'e3\'f0\'e0\'ec\'ec\'e8\'f1\'f2\'e0\loch\f39 \hich\f39 . \'d2\'e5\'ec\loch\f39 \hich\f39 \'e1\loch\af39\dbch\af31505\hich\f39 \'ee
+\loch\af39\dbch\af31505\hich\f39 \'eb\'e5\'e5\loch\f39 \hich\f39 \'f7\'f2\'ee\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\loch\f39 \hich\f39 \'e0\'ed\'e0\'eb\'e8\'e7\'e0\'f2\'ee\'f0\'e0\loch\f39 \hich\f39 \'eb\'fe\'e1\'e5\'e7\'ed\'ee\loch\f39 \hich\f39
+\'ef\'ee\'f8\'e5\'eb\loch\f39 \hich\f39 \'ed\'e0\'e2\'f1\'f2\'f0\'e5\'f7\'f3\loch\f39 \hich\f39 \'ec\'ee\'e5\'e9\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'fc\'e1\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'e0\'f7\'e8\'ed\'e0\'ff\loch\f39
+\hich\f39 \'f1\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e8\loch\f39 \hich\f39 1.65 \'ef\'ee\'ff\'e2\'e8\'eb\'e0\'f1\'fc\loch\f39 \hich\f39 , \'ed\'e0\'ea\'ee\'ed\'e5\'f6\loch\f39 \hich\f39 , \'f2\'e0\'ea\loch\f39 \hich\f39 \'f1\'ea\'e0\'e7\'e0\'f2\'fc
+\loch\f39 \hich\f39 , \'ee\'ef\'f2\'e8\'ec\'e8\'e7\'e8\'f0\'ee\'e2\'e0\'ed\'ed\'e0\'ff\loch\f39 \hich\f39 \'ef\'ee\'e4\'e4\'e5\'f0\'e6\'ea\'e0\loch\f39 \hich\f39 3proxy - \'e8\'ec\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'eb
+\'ee\'e3\'ee\'e2\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'e5\'e4\'e5\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'ed\'e8\'e6\'e5\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\'e0\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 logformat "L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I\hich\af39\dbch\af31505\loch\f39 %O %N/%R:%r"
+
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'f0\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e8\'ec\'e5\'f2\'fc\loch\f39 \hich\f39
+\'e2\loch\f39 \hich\f39 \'e2\'e8\'e4\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e4\'e0\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'f2
+\'fc\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e5\'e9\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 0.6.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'f3\'f2\loch\f39 \hich\f39 \'e2\'e8\'e4\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 192.168.0.4 - ivanov - [02/Jun/2006:11:13:56 +0500]
+\par \hich\af39\dbch\af31505\loch\f39 "GET http://svalka.biz/uploads/posts/1147559374_00.jpg HTTP/1.0" 000 17\hich\af39\dbch\af31505\loch\f39 497 457 PROXY/http://svalka.biz:3128
+\par
+\par }\pard \ltrpar\ql \fi-360\li360\ri0\nowidctlpar\tx360\wrapdefault\hyphpar0\faauto\rin0\lin360\itap0 {\rtlch\fcs1 \af1\afs18 \ltrch\fcs0 \f1\fs18\kerning1\insrsid11355186\charrsid3764488 -\tab }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e3\'e4\'e5\loch\f39 \hich\f39 \'e8\'e4\'f3\'f2\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'ef\'ee\'f0\'ff\'e4\'ea\'f3\loch\f39 \hich\f39 : IP \'f0\'e0\'e1\'ee\'f7\'e5\'e9
+\loch\f39 \hich\f39 \'f1\'f2\'e0\'ed\'f6\'e8\'e8\loch\f39 \hich\f39 - \'e8\'ec\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 - \'f7\'e8\'f1\'eb\'ee\loch\f39 \hich\f39 , \'ec\'e5\'f1\'ff\'f6\loch\f39
+\hich\f39 , \'e3\'ee\'e4\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e2\'f0\'e5\'ec\'ff\loch\f39 \hich\f39 - \'e2\'e8\'e4\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'e0\loch\f39 \hich\f39 - URL - \'ed\'ee\'ec\'e5\'f0\loch\f39 \hich\f39 \'ee\'f8
+\'e8\'e1\'ea\'e8\loch\f39 \hich\f39 (\'e5\'f1\'eb\'e8\loch\f39 \hich\f39 000 - \'e7\'ed\'e0\'f7\'e8\'f2\loch\f39 \hich\f39 , \'ee\'f8\'e8\'e1\'ee\'ea\loch\f39 \hich\f39 \'ed\'e5\'f2\loch\f39 \hich\f39 ) - \'ef\'f0\'e8\'ed\'ff\'f2\'ee\loch\f39
+\hich\f39 \'e1\'e0\'e9\'f2\loch\f39 \hich\f39 - \'ee\'f2\'ef\'f0\'e0\'e2\'eb\'e5\'ed\'ee\loch\f39 \hich\f39 \'e1\'e0\'e9\'f2\loch\f39 \hich\f39 - \'f1\'e5\'f0\'e2\'e8\'f1\loch\f39 \hich\f39 - \'f5\'ee\'f1\'f2\loch\f39 \hich\f39 - \'ef\'ee\'f0\'f2
+\loch\f39 \hich\f39 , \'ef\'ee\loch\f39 \hich\f39 \'ea\loch\af39\dbch\af31505\hich\f39 \'ee\'f2\'ee\'f0\'ee\'ec\'f3\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\loch\f39 \hich\f39 \'f1\'e2\'ff\'e7\'e0\'eb\'f1\'ff\loch\f39 \hich\f39 \'f1\loch\f39
+\hich\f39 \'f1\'e5\'f0\'e2\'e8\'f1\'ee\'ec.
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cd\'e5\'ec\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e7\'e0\'e1\'e5
+\'e3\'e0\'ff\loch\f39 \hich\f39 \'e2\'ef\'e5\'f0\'e5\'e4\loch\f39 \hich\f39 , \'f1\'ea\'e0\'e6\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 3proxy \'ef
+\'ee\'e7\'e2\'ee\'eb\'ff\'e5\'f2\loch\f39 \hich\f39 \'f3\'e4\'ee\'e2\'eb\'e5\'f2\'e2\'ee\'f0\'ff\'f2\'fc\loch\f39 \hich\f39 \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'f0\'e0\'e7\'ed\'ee\'ee\'e1\'f0\'e0\'e7\'ed\'fb\'e5\loch\f39 \hich\f39
+\'e7\'e0\'ef\'f0\'ee\'f1\'fb\loch\f39 \hich\f39 , , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e2\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'ee\'f2\'e4\'e5\'eb\'fc\'ed\'fb\'e5\loch\f39
+\hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\loch\f39 \hich\f39 \'e8\'eb\'e8\loch\f39 \hich\f39 \'ee\'f2\'e4\'e5\'eb\'fc\'ed\'fb\'e5\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 \'e4
+\'eb\'ff\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\'e9\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f0\'e0\'e7\'ed\'fb\'ec\'e8\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\'e0\'ec\'e8.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'f3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'e0\'ea\'ee\'ed\'e5\'f6\loch\f39 \hich\f39 , \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e2\'fb\loch\f39 \hich\f39 \'f5\'ee\'f2\'e8\'f2\'e5\loch\f39 \hich\f39 \'e5
+\'f9\'e5\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'e5\loch\f39 \hich\f39 \'f1\'fd\'ea\'ee\'ed\'ee\'ec\'e8\'f2\'fc\loch\f39 \hich\f39 \'ec\'e5\'f1\'f2\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e4\'e8\'f1\'ea\'e5\loch\f39 \hich\f39 \'ef\'ee
+\'e4\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e0\'f0\'f5\'e8\'e2\'e8\'f0\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39
+ \'ef\'ee\'ec\'ee\'f9\'fc\'fe\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e3\'ee\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e0\'f0\'f5\'e8\'e2\'e0\'f2\'ee\'f0\'e0\loch\f39 \hich\f39 , \'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0
+\loch\f39 \hich\f39 , \'e2\'ee\'f2\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 archiver }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \hich\af39\dbch\af31505\loch\f39 rar \loch\af39\dbch\af31505\hich\f39 \'93\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "c:\\Program Files\\WinRAR\\rar.exe}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488
+\loch\af39\dbch\af31505\hich\f39 \'94\loch\af39\dbch\af31505\hich\f39 \'94\hich\af39\dbch\af31505\loch\f39 " }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\hich\af39\dbch\af31505\loch\f39 a -df -inul %A %F
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 (\'ef\'ee\'e4\'f1\'ea\'e0\'e7\'ea\'f3\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ee\'ef\'f6\'e8\'e9\loch\f39 \hich\f39 \'ea
+\'ee\'ec\'e0\'ed\'e4\'ed\'ee\loch\af39\dbch\af31505\hich\f39 \'e9\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e8\loch\f39 \hich\f39 WinRAR \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'ed\'e0\'e9\'f2\'e8\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e5\'e3
+\'ee\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 Help'\'e5\loch\f39 )
+\par \loch\af39\dbch\af31505\hich\f39 \'ce\'e1\'f0\'e0\'f2\'e8\'f2\'e5\loch\f39 \hich\f39 \'e2\'ed\'e8\'ec\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f2\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ef\'f3\'f2\'fc
+\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'f3\loch\f39 \hich\f39 \'e7\'e0\'ea\'eb\'fe\'f7\'e5\'ed\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'ea\'ee\'e1\'ea\'e8\loch\f39 \hich\f39 . \'dd\'f2\'ee\loch\f39 \hich\f39 \'f1\'e2
+\'ff\'e7\'e0\'ed\'ee\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ed\'e0\'eb\'e8\'f7\'e8\'e5\'ec\loch\f39 \hich\f39 \'ef\'f0\'ee\'e1\'e5\'eb\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'f3\'f2\'e8\loch\f39 \hich\f39 . \'c0\'ed\'e0\'eb\'ee\'e3
+\'e8\'f7\'ed\'ee\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e7\'e0\'ea\'eb\'fe\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'e0\'e2\'fb\'f7\'ea\'e8\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'e5\loch\f39 \hich\f39 \'ef\'f3
+\'f2\'e8\loch\f39 \hich\f39 Windows, \'f1\'ee\'e4\'e5\'f0\'e6\'e0\'f9\'e8\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'e5\'e1\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'e1\'e5\'eb\'fb\loch\f39 \hich\f39 \'eb\'e8\'e1\'ee\loch\f39 $.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cc\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'f1\'ee\'e1\'e8\'f0\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'e4\loch\af39\dbch\af31505\hich\f39 \'e2\'e8\'ed\'f3\'f2\'f3\'fe\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'fe
+\loch\f39 \hich\f39 (\'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 \hich\f39 2) \'ed\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.100.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nscache 65536
+\par \hich\af39\dbch\af31505\loch\f39 logformat "L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I %O %N/%R:%r"
+\par \hich\af39\dbch\af31505\loch\f39 log c:\\3proxy\\logs\\3proxy.log D
+\par \hich\af39\dbch\af31505\loch\f39 rotate 30
+\par \hich\af39\dbch\af31505\loch\f39 archiver }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \hich\af39\dbch\af31505\loch\f39 rar \loch\af39\dbch\af31505\hich\f39 \'93\loch\af39\dbch\af31505\hich\f39
+\'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "c:\\Program Files\\WinRAR\\rar.exe}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \loch\af39\dbch\af31505\hich\f39 \'94\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "\hich\af39\dbch\af31505\loch\f39 a -df -inul %A %F
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 auth none
+\par \hich\af39\dbch\af31505\loch\f39 proxy -t
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c7\'e0\'ef\'f3\'f1\'ea\'e0\'e5\'ec\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ee\'ef\'f6\'e8\'e5\'e9\loch\f39 \hich\f39 -t , \'ea\'ee\'f2\'ee\'f0\'e0\'ff\loch\f39
+\hich\f39 \'ef\'ee\'e7\'e2\'ee\'eb\'ff\'e5\'f2\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e2\'fb\'e2\'ee\'e4\'e8\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'eb\'ee\'e3\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e5\'e1\'ed\'fb\'e5\loch\f39
+\hich\f39 \'f1\'ee\'ee\'e1\'f9\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ee\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e5\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\loch\f39 \hich\f39 . \'dd\'f2\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\'e3\'ee\'e4\'e8\'f2\'f1
+\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e4\'e0\'eb\'fc\'ed\'e5\'e9\'f8\'e5\'ec\loch\f39 \hich\f39 , \'ea\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e1\'e0
+\'f2\'fb\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\loch\f39 \hich\f39 \'ea\loch\af39\dbch\af31505\hich\f39 \'e0\'ea\'e8\'ec-\'ed\'e8\'e1\'f3\'e4\'fc\loch\f39 \hich\f39 \'e0\'ed\'e0\'eb\'e8\'e7\'e0\'f2\'ee\'f0\'ee\'ec.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'f1\'e5\loch\f39 \hich\f39 \'eb\'f3\'f7\'f8\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'eb\'f3\'f7\'f8\'e5\loch\f39 \hich\f39 ! \'cf\'f0\'ee\'e4\'ee\'eb\'e6\'e0\'e5\'ec\loch\f39 \hich\f39 . \'cf\'ee\'e4\'f3
+\'ec\'e0\'e5\'ec\loch\f39 \hich\f39 \'ee\loch\f39 \hich\f39 \'f2\'ee\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 \'ec\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 , \'e0
+\loch\f39 \hich\f39 \'ea\'e0\'ed\'e0\'eb\loch\f39 \hich\f39 , \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 , \'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ee\'f7\'e5\'ed\'fc\loch\f39 \hich\f39 \'f2\'ee\'eb\'f1\'f2\'fb\'e9\loch\f39 \hich\f39 , \'f5
+\'ee\'f0\'ee\'f8\'ee\loch\f39 \hich\f39 , \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'f5\'ee\'f2\'ff\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 128 \'ea\'e1\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e4\'e8\'e0
+\'eb\'e0\'ef\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 33.6? \'cd\'e0\'f7\'e8\'ed\'e0\'e5\'ec\loch\f39 \hich\f39 \'f0\'e5\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 , \'f2\'ee\'e2\'e0\'f0\'e8\'f9\'e8\loch\f39 !
+\par
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 240000 * 192.168.0.2,192.168.0\hich\af39\dbch\af31505\loch\f39 .3
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'f0\'e0\'e7\'f0\'e5\'f8\'e0\'e5\'ec\loch\f39 \hich\f39 \'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\'ec\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 IP-\'e0\'e4\'f0
+\'e5\'f1\'e0\'ec\'e8\loch\f39 \hich\f39 192.168.0.2 \'e8\loch\f39 \hich\f39 192.168.0.3 \'f1\'ee\loch\f39 \hich\f39 \'f1\'ea\'ee\'f0\'ee\'f1\'f2\'fc\'fe\loch\f39 \hich\f39 24 \'ea\'e1\'e8\'f2\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'e5\'ea
+\'f3\'ed\'e4\'f3\loch\f39 \hich\f39 , \'ef\'f0\'e8\'f7\'e5\'ec\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 24 \'ea\'e1\'e8\'f2\loch\f39 \hich\f39 \'ef\'f0\'e8\'f5\'ee\'e4\'ff\'f2\'f1\'ff\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'fb\'e9\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'fd\'f2\'e8\'f5\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'ee\'e2\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39
+\'ee\'e1\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'ee\'e2\'ee\'ea\'f3\'ef\'ed\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 , \'f2.\'e5\loch\f39 \hich\f39 . \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'ee\'e1\'e0\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f2
+\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\'e2\'f0\'e5\'ec\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'fb\loch\f39 \hich\f39 \'f1
+\loch\f39 \hich\f39 \'e4\'ee\loch\af39\dbch\af31505\hich\f39 \'f1\'f2\'e0\'f2\'ee\'f7\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'f1\'f2\'f0\'fb\'f5\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'ee\'e2\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4
+\'ee\'ec\'f3\loch\f39 \hich\f39 \'ef\'f0\'e8\'e4\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 12 \'ea\'e1\'e8\'f2\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'e5\'ea\'f3\'ed\'e4\'f3
+\loch\f39 \hich\f39 (\'e7\'e0\'ec\'e5\'f2\'fc\'f2\'e5\loch\f39 \hich\f39 , \'ea\'e8\'eb\'ee\'e1\'e8\'f2\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ea\'e8\'eb\'ee\'e1\'e0\'e9\'f2\loch\f39 \hich\f39 , \'e5\'f1\'eb\'e8
+\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'f1\'f7\'e8\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'e8\'eb\'ee\'e1\'e0\'e9\'f2\'fb\loch\f39 \hich\f39 , \'f0\'e0\'e7\'e4\'e5\'eb\'e8\'f2\'e5\loch\f39
+\hich\f39 \'f7\'e8\'f1\'eb\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 8)
+\par
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 48000 * 192.168.0.4
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'e0\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\'f3\loch\f39 \hich\f39 \'f1\'f7\'e0\'f1\'f2\'eb\'e8\'e2\'f7\'e8\'ea\'f3\loch\f39 \hich\f39 \'e5\'e4\'e8\'ed\'ee\'eb\'e8\'f7\'ed\'ee\loch\f39 \hich\f39 \'f1\'ea\'ee
+\'f0\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 48 \'ea\'e1\'e8\'f2\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'e5\'ea\'f3\'ed\'e4\loch\af39\dbch\af31505\hich\f39 \'f3\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 bandlimout 24000 *
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'e8\'f1\'f5\'ee\'e4\'ff\'f9\'f3\'fe\loch\f39 \hich\f39 \'f1\'ea\'ee\'f0\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 \'f2\'ee\'e6\'e5\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e8\'ec\loch\f39 \hich\f39 \'e2
+\'f1\'e5\'ec\loch\f39 \hich\f39 \'e4\'ee\loch\f39 \hich\f39 24 \'ea\'e8\'eb\'ee\'e1\'e8\'f2\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'e5\'ea\'f3\'ed\'e4\'f3\loch\f39 \hich\f39 (\'f1\'e5\'e9\'f7\'e0\'f1\loch\f39 \hich\f39 \'fd\'f2\'e0
+\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e8\loch\f39 \hich\f39 devel 0.6) \'cd
+\'f3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'e0\'ea\'ee\'ed\'e5\'f6\loch\f39 \hich\f39 , \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e2\'fb\loch\f39 \hich\f39 \'f5\'ee\'f2\'e8\'f2\'e5\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39
+\'fd\'f2\'e8\loch\f39 \hich\f39 \'e6\'e5\'f1\'f2\'ea\'e8\'e5\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ea\'e0\'f1\'e0\'eb\'e8\'f1\'fc\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39
+\'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'f1\'ea\'e0\'f7\'e8\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'f1\'ed\'e8\'ec\'e8\'f2\'e5\hich\af39\dbch\af31505\loch\f39 \hich\f39
+\'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 110:
+\par
+\par \hich\af39\dbch\af31505\loch\f39 nobandlimin * * * 110
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0\'e1\'f3\'e4\'fc\'f2\'e5\loch\f39 \hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'fd\'f2\'f3\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4
+\'f3\loch\f39 \hich\f39 \'cf\'c5\'d0\'c5\'c4\loch\f39 \hich\f39 \'ef\'f0\'ee\'f7\'e8\'ec\'e8\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\'ec\'e8\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'f1\'ea\'ee\'f0
+\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 - \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e1\'e0\'f2\'fb\'e2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\'e4\'ee\'e2\'e0\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e4\'ee
+\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2\'ee\'e3\'ee\loch\f39 \hich\f39 \'f3\'e4\'ee\'e2\'eb\'e5\'f2\'e2\'ee\'f0\'ff\'fe\'f9\'e5\'e3\'ee\loch\f39 \hich\f39 \'f3\'f1\'eb\'ee\'e2\'e8\'ff\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'ea\'ee\'f0\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 \'f1\'ea\'e0\'f7\'e8\'e2\'e0\'ed\'e8\'ff-\'e7\'e0\'ea\'e0\'f7\'e8\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'ec\'fb\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39
+\'e7\'e0\'e4\'e0\'eb\'e8\hich\af39\dbch\af31505\loch\f39 \hich\f39 , \'ef\'f0\'ee\'e4\'ee\'eb\'e6\'e0\'e5\'ec\loch\f39 \hich\f39 \'e7\'e0\'ea\'f0\'f3\'f7\'e8\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'e3\'e0\'e9\'ea\'e8\loch\f39 \hich\f39 . \'c2\loch\f39
+\hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'ed\'e0\'ec\loch\f39 \hich\f39 \'ef\'ee\'ec\'ee\'e3\'f3\'f2\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 deny \'e8\loch\f39 allow
+\par \hich\af39\dbch\af31505\loch\f39 deny * 192.168.200.4 * 110 * 1-5 18:00:00-23:59:59,00:00:00-08:00:00
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'e7\'e0\'ef\'f0\'e5\'f9\'e0\'e5\'ec\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe
+\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 IP .4 \'e2\loch\f39 \hich\f39 \'ed\'e5\'f0\'e0\'e1\'ee\'f7\'e5\'e5\loch\f39 \hich\f39 \'e2\'f0\'e5\'ec\'ff\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'ed\'ff\'ec\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.200.4 * * * 1-5 09:00:00-18:00:00
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'f0\'e0\'e7\'f0\'e5\'f8\'e0\'e5\'ec\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2
+\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 IP .4 \'e8\'f1\'ea\'eb\'fe\'f7\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ef\'ee\'ed\'e5\'e4\'e5\'eb\'fc\'ed\'e8\'ea\'e0\loch\f39 \hich\f39 \'ef\'ee
+\loch\f39 \hich\f39 \'ef\'ff\'f2\'ed\'e8\'f6\'f3\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 9 \'f7\'e0\'f1\'ee\'e2\loch\f39 \hich\f39 \'f3\'f2\'f0\'e0\loch\f39 \hich\f39 \'e4\'ee\loch\f39 \hich\f39 6 \'e2\'e5\'f7\'e5\'f0\'e0\loch\f39 \hich\f39 ,
+\'ed\'ee\loch\f39 \hich\f39 \'e7\'e0\'f2\'ee\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'fb\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'fb\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'e5\loch\f39 \hich\f39 \'ef\'ee\'f0
+\'f2\'fb\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 FTP-\'f1\'e5\'f0\'e2\'e5\'f0\'ee\'e2\loch\f39 \hich\f39 \'ea\'e0
+\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 , \'e8\loch\f39 HTTP\hich\af39\dbch\af31505\loch\f39 \hich\f39 S, \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'f1\'f2\'e0\'f2\'e8\loch\f39 \hich\f39 , \'e4\'eb\'ff\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 \'e4\'ee
+\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 FTP \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'f3\'fe\'f9\'e5\'ec\loch\f39
+\hich\f39 \'ee\'ea\'ed\'e5\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e5\'ea\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\'e0\loch\f39 \hich\f39 (\'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'fb\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2
+\'e5\'f0\'e0\loch\f39 \hich\f39 ) \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e3\'e0\'eb\'ee\'f7\'ea\'f3\loch\f39 \hich\f39 \'ed\'e0\'ef\'f0\'ee\'f2\'e8\'e2\loch\f39 \hich\f39 FTP \'e8\loch\f39
+\hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 IP \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39
+\hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 HTTP (\'e2\loch\f39 \hich\f39 \'ed\'e0\loch\af39\dbch\af31505\hich\f39 \'f8\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3
+\'f7\'e0\'e5\loch\f39 \hich\f39 3128), \'e0\loch\f39 \hich\f39 \'e2\'ee\'e2\'f1\'e5\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 21, \'ea\'e0\'ea\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39 \'ef
+\'ee\'e4\'f3\'ec\'e0\'f2\'fc\loch\f39 \hich\f39 . \'c8\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\loch\f39 \hich\f39 \'e3\'f0\'f3\'f1\'f2\'ed\'ee\'e5\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'ed\'e8\'e5\loch\f39 \hich\f39
+. \'d2\'e5\'ea\'f3\'f9\'e0\'ff\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\'e0\loch\f39 \hich\f39 Opera \'ef\'ee\'e4\loch\f39 \hich\f39 \'ed\'ee\'ec\'e5\'f0\'ee\'ec\loch\f39 \hich\f39 9 \'ed\'e5\'ea\'ee
+\'f0\'f0\'e5\'ea\'f2\'ed\'ee\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f4\'f2\'ef-\'f1\'e5\'f0\'e2\'e5\'f0\'e0
+\'ec\'e8\loch\f39 \hich\f39 , \'f2\'f0\'e5\'e1\'f3\'fe\'f9\'e8\'ec\'e8\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'fe\loch\f39 \hich\f39 , \'f2\'e0\'ea\loch\f39 \hich\f39 \'f7\'f2\'ee\loch\f39 \hich\f39 \'eb\'e8\'e1\'ee\loch\f39
+\hich\f39 \'ef\'f0\'e8\'e4\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e2\'e5\'f0\'ed\'f3\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e8\loch\f39 \hich\f39 8, \'eb\'e8\'e1\loch\af39\dbch\af31505\hich\f39 \'ee
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 IE \'e8\'eb\'e8\loch\f39 FireFox.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3 * 80,443 * 1-7 00:00:00-23:59:59
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'e0\loch\f39 \hich\f39 \'e7\'e4\'e5\'f1\'fc\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e0\'e5\'ec\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 WEB-\'f1\'e5\'f0\'f4\'e8\'ed\'e3\loch\f39
+\hich\f39 , \'e7\'e0\'f2\'ee\loch\f39 \hich\f39 \'ea\'f0\'f3\'e3\'eb\'ee\'f1\'f3\'f2\'ee\'f7\'ed\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e9\loch\f39 \hich\f39 \'e4\'e5\'ed\'fc\loch\f39 \hich\f39 \'ed\'e5\'e4\'e5\'eb\'e8
+\loch\f39
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'f1\'f2\'e0\'f2\'e8\loch\f39 \hich\f39 \'e2\'f1\'ef\'ee\'ec\'e8\'ed\'e0\'e5\'ec\loch\f39 \hich\f39 (\'e2\'fb\loch\f39 \hich\f39 \'e2\'e5\'e4\'fc\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'ec\'e5\'e4\'e8
+\'f2\'e8\'f0\'ee\'e2\'e0\'eb\'e8\loch\f39 \hich\f39 \'ed\'e0\'e4\loch\f39 \hich\f39 man, FAQ \'e8\loch\f39 \hich\f39 HowTO, \'ed\'e5\loch\f39 \hich\f39 \'ef\'f0\'e0\'e2\'e4\'e0\loch\f39 \hich\f39 \'eb\'e8\hich\af39\dbch\af31505\loch\f39 \hich\f39
+?), \'f7\'f2\'ee\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 auth none
+\par \loch\af39\dbch\af31505\hich\f39 \'f1\'ee\'e1\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'ed\'e8\'ea\'e0\'ea\'f3\'fe\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'fe\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e4\'e0\'e5\'f2
+\loch\f39 \hich\f39 , \'f2.\'ea\loch\f39 \hich\f39 . \'ee\'f2\'ea\'eb\'fe\'f7\'e0\'e5\'f2\loch\f39 \hich\f39 \'eb\'fe\'e1\'f3\'fe\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'fe\loch\f39 \hich\f39 \'f1\'ee\'e2\'f1\'e5\'ec\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 allow \'e8\loch\f39 \hich\f39 deny \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'ed\'e5\'e5\loch\f39 \hich\f39 \'f2\'e5\'f0\'ff\'fe\'f2\loch\f39 \hich\f39 \'e2\'f1\'ff
+\'ea\'e8\'e9\loch\f39 \hich\f39 \'f1\'ec\'fb\'f1\'eb\loch\f39 \hich\f39 . \'cf\'ee\'f0\'e0\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'e9\'f2\'e8\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f7\'f2\'ee-\'ed\'e8\'e1\'f3\'e4\'fc\loch\f39 \hich\f39 \'e1
+\'ee\'eb\'e5\'e5\loch\f39 \hich\f39 \'ef\'ee\'e4\'f5\'ee\'e4\'ff\'f9\'e5\'e5\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'e0\'e2\'f2
+\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'ff\loch\f39 \hich\f39 \'ef\'ee\loch\f39 IP:
+\par
+\par \hich\af39\dbch\af31505\loch\f39
+\par \hich\af39\dbch\af31505\loch\f39 auth ip\hich\af39\dbch\af31505\loch\f39 only
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'ed\'ee\'e2\'e0\loch\f39 \hich\f39 \'f1\'ee\'e1\'e8\'f0\'e0\'e5\'ec\loch\f39 \hich\f39 \'ee\'f7\'e5\'f0\'e5\'e4\'ed\'f3\'fe\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'fe\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3
+\'e0\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f3\'f7\'e5\'f2\'ee\'ec\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\'ed\'e0\'ef\'e8\'f1\'e0\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 (\'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 3):
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.100.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nscache 65536
+\par \hich\af39\dbch\af31505\loch\f39 logformat "L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I %O %N/%R:%r"
+\par \hich\af39\dbch\af31505\loch\f39 l\hich\af39\dbch\af31505\loch\f39 og c:\\3proxy\\logs\\3proxy.log D
+\par \hich\af39\dbch\af31505\loch\f39 rotate 30
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0\pararsid3764488 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+archiver }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \hich\af39\dbch\af31505\loch\f39 rar \loch\af39\dbch\af31505\hich\f39 \'93\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "c:\\Program Files\\WinRAR\\rar.exe}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \loch\af39\dbch\af31505\hich\f39 \'94\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "\hich\af39\dbch\af31505\loch\f39 a -df -inul %A %F
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+nobandlimin * * * 110
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 24000 * 192.168.0.2,192.168.0.3
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 48000 * 192.168.0.4
+\par \hich\af39\dbch\af31505\loch\f39 bandlimout 24000 *
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 deny * 192.168.200.4 * 110 * 1-5 18:00:00-23:59:59,00:00:00-08:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.200.4 * * * 1-5 09:00:00-18:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3 * 80,443 * 1-7 00:00:00-23:59:59
+\par \hich\af39\dbch\af31505\loch\f39 deny *
+\par \hich\af39\dbch\af31505\loch\f39 proxy -t
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 ACL (access client list \hich\f39 \emdash \loch\f39 \hich\f39 \'f1\'ef\'e8\'f1
+\'ee\'ea\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 \'ea\'eb\'e8\loch\af39\dbch\af31505\hich\f39 \'e5\'ed\'f2\'ee\'e2\loch\f39 \hich\f39 ), \'f2.\'e5\loch\f39 \hich\f39 . \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 allow \'e8\loch\f39
+\hich\f39 deny \'e4\'ee\'e1\'e0\'e2\'e8\'eb\'e8\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ee\'e4\'e8\'ed\loch\f39 \hich\f39 deny * - \'fd\'f2\'ee\loch\f39 \hich\f39 \'ef\'ee\'e7\'e2\'ee\'eb\'e8\'f2\loch\f39 \hich\f39 \'e8\'e7\'e1\'e0\'e2
+\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\'e5\'e4\'eb\'e8\'e2\'fb\'f5\loch\f39 \hich\f39 \'ee\'ea\'ee\'ed\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'e0\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\'ed\'e0\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'ff\loch\f39 \hich\f39 , \'e2\'fb\'f1\'ea\'e0\'ea\'e8\'e2\'e0\'fe\'f9\'e8\'f5\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'ef\'ee\'ef\'fb\'f2\'ea\'e5\loch\f39 \hich\f39 \'e7\'e0\'e3\'f0
+\'f3\'e7\'ea\'e5\loch\f39 \hich\f39 \'ea\'e0\'ea\'ee\'e3\'ee-\'ed\'e8\'e1\'f3\'e4\'fc\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e5\'f9\'e5\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'f0
+\'e5\'f1\'f3\'f0\'f1\'e0.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'f0\'ee\'e4\'ee\'eb\'e6\'e8\'ec\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\loch\f39 \hich\f39 \'f3\'e2\'eb\'e5\'ea\'e0\'f2\'e5\'eb\'fc\'ed\'ee\'e5\loch\f39 \hich\f39 \'e7\'e0\'ed\'ff\'f2\'e8\'e5\loch\f39 \hich\f39 . \'d3
+\'f7\'e5\'f2\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ea\'ee\loch\af39\dbch\af31505\hich\f39 \'ed\'f2\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 - \'e2\'ee\'f2\loch\f39 \hich\f39 \'ee\'e4\'e8\'ed\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'ee\'f1
+\'ed\'ee\'e2\'ed\'fb\'f5\loch\f39 \hich\f39 \'ed\'e0\'f8\'e8\'f5\loch\f39 \hich\f39 \'ef\'f0\'e8\'ed\'f6\'e8\'ef\'ee\'e2\loch\f39 \hich\f39 . \'c0\loch\f39 \hich\f39 \'ea\'e0\'ea\'ee\'e9\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'f3\'f7\'e5\'f2
+\loch\f39 \hich\f39 \'e1\'e5\'e7\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\'ee\'e2\loch\f39 \hich\f39 ? \'ce\'ed\'e8\loch\f39 \hich\f39 \'ee\'ef\'f0\'e5\'e4\'e5\'eb\'ff\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\'ec\'e8
+\loch\f39 \hich\f39 counter, countin \'e8\loch\f39 nocountin.
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 counter "c:\\3proxy\\3proxy.3cf"
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'fd\'f2\'e8\'ec\loch\f39 \hich\f39 \'ec\'fb\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e5\'ec\loch\f39 \hich\f39 , \'e3\'e4\'e5\loch\f39
+\hich\f39 \'f3\loch\f39 \hich\f39 \'ed\'e0\'f1\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'f5\'f0\'e0\'ed\'e8\'f2\'fc\loch\f39 \hich\f39 \'ee\'e1\'f9\'e8\'e9\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'f5\'f0\'e0\'ed
+\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\'ee\'e2\loch\f39 \hich\f39 . \'ce\'ed\loch\f39 \hich\f39 \'ef\'f0\loch\af39\dbch\af31505\hich\f39 \'e5\'e4\'f1\'f2
+\'e0\'e2\'eb\'ff\'e5\'f2\loch\f39 \hich\f39 \'f1\'ee\'e1\'ee\'e9\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e4\'e2\'ee\'e8\'f7\'ed\'ee\'ec\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\'e5\loch\f39 \hich\f39 , \'ef
+\'f0\'e8\'f7\'e5\'ec\loch\f39 \hich\f39 \'ee\'ed\loch\f39 \hich\f39 \'e2\'f1\'e5\'e3\'e4\'e0\loch\f39 \hich\f39 \'ee\'e4\'e8\'ed\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'dd\'f2\'f3\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'f2\'fc
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\'e5\loch\f39
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 counter "c:\\3proxy\\3proxy.3cf" D "C:\\3proxy\\traf\\traf"
+\par }\pard \ltrpar\ql \fi-360\li360\ri0\nowidctlpar\tx360\wrapdefault\hyphpar0\faauto\rin0\lin360\itap0 {\rtlch\fcs1 \af1\afs18 \ltrch\fcs0 \f1\fs18\kerning1\insrsid11355186\charrsid3764488 -\tab }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'f2\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'fb\'e9\loch\f39 \hich\f39 \'e4\'e5\'ed\'fc\loch\f39 \hich\f39 (\'f7\'e0\'f1\'f2\'ee\'f2\'e0\loch\f39 \hich\f39 \'e7\'e0\'e4
+\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e4\'e0\'ed\'ed\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'ee\'ec\loch\f39 \hich\f39 D(\'e5\'e6\'e5\'e4\'ed\'e5\'e2\'ed\'ee
+\loch\f39 \hich\f39 ) - \'ed\loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 \'ec\'e5\'f1\'f2\'e5\loch\f39 \hich\f39 D \'ec\'ee\'e3\'eb\'e8\loch\f39 \hich\f39 \'e1\'fb\'f2\'fc\loch\f39 \hich\f39 W(\'e5\'e6\'e5\'ed\'e5\'e4\'e5\'eb\'fc\'ed\'ee
+\loch\f39 \hich\f39 ), M(\'e5\'e6\'e5\'ec\'e5\'f1\'ff\'f7\'ed\'ee\loch\f39 \hich\f39 ) \'e8\'eb\'e8\loch\f39 \hich\f39 H(\'e5\'e6\'e5\'f7\'e0\'f1\'ed\'ee\loch\f39 \hich\f39 )) \'e2\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'e5\loch\f39 C:\\3proxy\\traf\\
+\hich\f39 traf \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e3\'e5\'ed\'e5\'f0\'e8\'f0\'ee\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'ee\'f2\'f7\'e5\'f2\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f2\'e5\'ea
+\'f1\'f2\'ee\'e2\'ee\'ec\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\'e5\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 \'ef\'ee\'e7\'e2\'ee\'eb\'e8\'f2\loch\f39 \hich\f39 \'ed\'e0\'ec\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39
+\hich\f39 \'ed\'e5\'ee\'e1\'f5\'ee\'e4\'e8\'ec\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 \'ef\'ee\'f1\'ec\'ee\'f2\'f0\'e5\'f2\'fc\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'e8\'f1\'f2\'e8\'ea\'f3\loch\f39 \hich\f39 \'e7\'e0\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e9
+\loch\f39 \hich\f39 \'e4\'e5\'ed\'fc\loch\f39 \hich\f39 . \'cf\'ee\'f1\'ec\'ee\'f2\'f0\'e8\'f2\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e0\'e5\'ec\'fb\'e5\loch\f39 \hich\f39 \'ee\'f2\'f7\'e5\'f2\'fb\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'e2
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e1\'eb\'ee\'ea\'ed\'ee\'f2\'e5\loch\f39 \hich\f39 , \'f2\'e0\'ec\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'ef\'ee\'ed\'ff\'f2\'ed\'ee.
+\par }\pard \ltrpar\ql \li360\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin360\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d3\'f7\'f2\'e8\'f2\'e5\loch\f39 \hich\f39 , \'f7\'f2\'ee
+\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'ee\'f2\'f7\'e5\'f2\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39
+\'e3\'e5\'ed\'e5\'f0\'e8\'f0\'ee\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f6\'e5\loch\f39 \hich\f39 \'f1\'f3\'f2\'ee\'ea\loch\f39 \hich\f39 , \'ed\'e5\loch\f39 \hich\f39 \'f1\'f2\'ee\'e8\'f2\loch\f39 \hich\f39
+\'e6\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'ff\'e2\'eb\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'f1\'f0\'e0\'e7\'f3\loch\f39 .
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 countin "1/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\loch\af39\dbch\af31505\hich\f39 \'c8\'e2\'e0\'ed\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 50 * 192.168.0.2 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin "2/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'e5\'f2\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 80 * 192.168.0.3 * * *
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 countin "3/\'d1\'e8\'e4\'ee\'f0\'ee\'e2\hich\af39\dbch\af31505\loch\f39 " M 30 * 192.168.0.4 * * *
+\par }\pard \ltrpar\ql \fi-360\li360\ri0\nowidctlpar\tx360\wrapdefault\hyphpar0\faauto\rin0\lin360\itap0 {\rtlch\fcs1 \af1\afs18 \ltrch\fcs0 \f1\fs18\kerning1\insrsid11355186\charrsid3764488 -\tab }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 \'fd\'f2\'e8\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'fe\'f2\loch\f39 \hich\f39 \'f0\'e0\'e7\'ed\'fb\'e5\loch\f39
+\hich\f39 \'ec\'e5\'f1\'ff\'f7\'ed\'fb\'e5\loch\f39 \hich\f39 (M) \'eb\'e8\'ec\'e8\'f2\'fb\loch\f39 \hich\f39 \'e2\'f5\'ee\'e4\'ff\'f9\'e5\'e3\'ee\loch\f39 \hich\f39 (\'f1\'f7\'e5\'f2\'f7\'e8\'ea\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e8
+\'f1\'f5\'ee\'e4\'ff\'f9\'e8\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 , \'ea\'f1\'f2\'e0\'f2\'e8\loch\f39 \hich\f39 , \'e0\'e2\'f2\'ee\'f0\loch\f39 \hich\f39 \'ef\'f0\'ee\'e3\'f0\'e0\'ec\'ec\'fb\loch\f39 \hich\f39 \'f2\'ee\'e6
+\'e5\loch\f39 \hich\f39 \'ee\'e1\'e5\'f9\'e0\'e5\'f2\loch\f39 \hich\f39 \'f1\'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 ) \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ec\'e5\'e3\'e0\'e1\'e0\'e9\'f2\'e0\'f5\loch\f39
+\hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'fb\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 IP-\'e0\'e4\'f0\'e5\'f1\'e0\'ec\'e8\loch\f39 \hich\f39 192.168.0.2-192.168.0.4, \'ef\'f0\'e8\'f7\'e5\'ec\loch\f39 \hich\f39
+\'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\loch\af39\dbch\af31505\hich\f39 \'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'f1\'f7\'e8\'f2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'e0\'f5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'ef\'f0\'ee\'f2\'ee\'ea\'ee\'eb\'ee\'e2.
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c8\'ed\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'ee
+\loch\f39 \hich\f39 \'ea\'e0\'ea\'ee\'ec\'f3-\'f2\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'e5\'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'ed\'fb\'e9\loch\f39
+\hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'e2\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'f3\'f7\'e5\'f2\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8
+\'ea\'e0\loch\f39 \hich\f39 . \'d7\'f2\'ee\loch\f39 \hich\f39 \'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 ? \'d1\'e0\'ec\'ee\'e5\loch\f39
+\hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\'e5\loch\f39 \hich\f39 \'f0\'e5\'f8\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \emdash \loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'f2\'e0
+\'ea\'ee\'e5\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'ee\'e5\loch\f39 \hich\f39 \'ee\loch\af39\dbch\af31505\hich\f39 \'ed\loch\f39 \hich\f39 \'ed\'e5
+\loch\f39 \hich\f39 \'f1\'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'f1\'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'e2\'f1\'e5\'ec\loch\f39 \hich\f39 \'e6\'e5\'eb\'e0\'ed\'e8\'e8\loch\f39 \hich\f39 , \'ed\'e0\'ef\'f0\'e8
+\'ec\'e5\'f0\loch\f39 \hich\f39 , \'ef\'e0\'f0\'f3\loch\f39 \hich\f39 \'f2\'e5\'f0\'e0\'e1\'e0\'e9\'f2\loch\f39 \hich\f39 . \'c8\'eb\'e8\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'ee\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc
+\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'ee\'ef\'f0\'e5\'e4\'e5\'eb\'e5\'ed\'ed\'f3\'fe\loch\f39 \hich\f39 \'ea\'e2\'ee\'f2\'f3\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 , \'ed\'ee
+\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ed\'e5\'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'ef\'e5\'f0\'e8\'ee\'e4\loch\f39 \hich\f39 \'e2\'f0\'e5\'ec\'e5\'ed\'e8\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39 \'f2\'e0
+\'ea\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ef
+\'e5\'f0\'e8\'ee\'e4\'ee\'ec\loch\f39 \hich\f39 \'e4\'e5\'e9\'f1\'f2\'e2\'e8\'ff\loch\f39 \hich\f39 N (\'ed\'e8\'ea\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 ) \'eb\'e8\'e1\'ee\loch\f39 \hich\f39 Y(\'e3\'ee\'e4\loch\f39 ).
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'e0\'e6\'ed\'ee\loch\f39 \hich\f39 - \'ed\'ee\'ec\'e5\'f0\loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\'ee\'e2\loch\f39 \hich\f39 (\'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5
+\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 1,2,3) \'ed\'e5\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'ed\'fb\loch\f39 \hich\f39 \'f1\'ee\'e2\'ef\'e0\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 . \'c8\'ec\'e5\'ed\'e0\loch\f39 \hich\f39 , \'e2
+\'e5\'f0\'ed\'e5\'e5\loch\f39 \hich\f39 , \'f4\'e0\'ec\'e8\'eb\'e8\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\'e0\loch\f39 \hich\f39 , \'e8\'e4\'f3\'f9\'e8\'e5
+\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'ea\'ee\'f1\'ee\'e9\loch\f39 \hich\f39 \'f7\'e5\'f0\'f2\'fb\loch\f39 \hich\f39 - \'ef\'f0\'e8\'e2\'e5\'e4\'e5\'ed\'fb\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f3\'e4\'ee\'e1
+\'f1\'f2\'e2\'e0\loch\f39 \hich\f39 , \'e8\'ec\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'ee\'ed\'e8\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f2\loch\f39 \hich\f39 \'f7\'e8\'f2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0
+\'ed\'e8\'f6\'e5\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'e8\'f1\'f2\'e8\'ea\'e8\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'ef\'ee\'e7\'e6\'e5\loch\f39 ...
+\par \loch\af39\dbch\af31505\hich\f39 \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'e2\'e0\'f1\loch\f39 \hich\f39 \'ef\'ee\'ff\'e2\'e8\'f2\'f1\'ff\loch\f39 \hich\f39 \'e6\'e5\'eb\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'e7\'ed\'e0\'f2\'fc
+\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'f2\'e5\'ea\'f3\'f9\'e8\'e9\loch\f39 \hich\f39 \'ee\'e1\'f9\'e8\'e9\loch\f39 \hich\f39 \'e8\'e7\'f0\'e0\'f1\'f5\'ee\'e4\'ee\'e2\'e0\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39
+\hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'ef\'e5\'f8\'e8\'f2\'e5\loch\f39
+\hich\f39 \'e2\'ee\'ee\'f0\'f3\'e6\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ea\'e0\'eb\'fc\'ea\'f3\'eb\'ff\'f2\'ee\'f0\'ee\'ec\loch\f39 \hich\f39 , \'fd\'f2\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'f1\'e4\'e5\'eb\'e0\'f2\'fc
+\loch\f39 \hich\f39 \'f1\'f0\'e5\'e4\'f1\'f2\'e2\'e0\'ec\'e8\loch\f39 \hich\f39 3proxy. \'c4\'ee\'f1\'f2\'e0\'f2\'ee\'f7\'ed\'ee\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\loch\f39 \hich\f39 , \'f3\'f7
+\'e8\'f2\'fb\'e2\'fe\'f9\'e8\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 , \'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39
+\hich\f39 , \'f2\'e0\'ea\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 countin 100/month M 1000000 *
+\par \hich\af39\dbch\af31505\loch\f39 coun\hich\af39\dbch\af31505\loch\f39 tin 101/day D 1000000 *
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'e5\'f0\'e2\'e0\'ff\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'e0\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e5\'f2\loch\f39 \hich\f39 \'ee\'e1\'f9\'e8\'e9\loch\f39 \hich\f39 \'ec\'e5\'f1\'ff\'f7\'ed\'fb\'e9\loch\f39
+\hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\loch\f39 \hich\f39 , \'e2\'f2\'ee\'f0\'e0\'ff\loch\f39 \hich\f39 \'ee\'e1\'f9\'e8\'e9\loch\f39 \hich\f39 \'e4\'ed\'e5\'e2\'ed\'ee\'e9\loch\f39 \hich\f39 . \'d2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0\'ed\'e8\'f7\'ea\'e5\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'e8\'f1\'f2\'e8\'ea\'e8\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5
+\'eb\'ff\loch\f39 \hich\f39 (\'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e0\'f2\'ee\'f0\'e0\loch\f39 \hich\f39 ) \'ef\'ee\'ff\'e2\'ff\'f2\'f1\'ff\loch\f39
+\hich\f39 \'e4\'e2\'e5\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'e8\loch\f39 \hich\f39 , \'f3\'ea\'e0\'e7\'fb\'e2\'e0\'fe\'f9\'e8\'e5\loch\f39 \hich\f39 \'f2\'e5\'ea\'f3\'f9\'e8\'e5\loch\f39 \hich\f39 \'ec\'e5\'f1\'ff\'f7\'ed\'fb\'e9\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'e4\'ed\'e5\'e2\'ed\'ee\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e8\loch\f39 \hich\f39 , \'ef\'f0\'ee\'f5\'ee\'e4\'ff\'f9\'e8\'e5\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39
+\hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 nocountin, \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 , \'ef\'ee\'e7\'e2\'ee\'eb\'ff\'e5\'f2\loch\f39 \hich\f39 \'ed\'e5\loch\f39
+\hich\f39 \'f1\'f7\'e8\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'ed\'ed\'ee\'ec\'f3\loch\f39 \hich\f39 \'f0\'ff\'e4\'f3\loch\f39 \hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5
+\'f2\'f0\'ee\'e2\loch\f39 \hich\f39 . \'cd\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'ea\'ee\'ec\'e0\'ed\'e4\'ee\'e9\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 nocountin * 192.168.0.4 * 110 *
+\par \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\'ec\'e5\'f9\'e5\'ed\'ed\'ee\'e9\loch\f39 \hich\f39 \'cf\'c5\'d0\'c5\'c4\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\'e0\'ec\'e8\loch\f39 \hich\f39 countin, \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'ee\'f2
+\'ea\'eb\'fe\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'e4\'f1\'f7\'e5\'f2\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\loch\f39 \hich\f39 \'f1\loch\f39
+ \hich\af39\dbch\af31505\loch\f39 \hich\f39 IP .4 \'ef\'f0\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'e8\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 110 \'ef\'ee\'f0\'f2\'f3\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e0\'e4\'ee\loch\f39 \hich\f39 \'e8\'ec\'e5\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e2\'e8\'e4\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'ef\'ee
+\'f1\'eb\'e5\loch\f39 \hich\f39 \'e8\'f1\'f7\'e5\'f0\'ef\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 \'f1\'f3\'f9\'e5\'f1\'f2\'e2\'f3\'fe\'f9\'e8\'e5\loch\f39 \hich\f39 \'f1\'ee\'e5\'e4\'e8\'ed\'e5\'ed\'e8\'ff
+\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ee\'e1\'f0\'fb\'e2\'e0\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'e0\'f1\'fc\'ea
+\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'e8\'e4\'e5\'f2\'fc\loch\f39 \hich\f39 \'e4\'ee\loch\f39 \hich\f39 \'ea\'ee\'ed\'f6\'e0\loch\f39
+\hich\f39 \'e4\'ed\'ff\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'ef\'f0\'e5\'e2\'fb\'f8\'e5\'ed\'e8\'e8\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 . \'c8\'eb\'e8\loch\f39
+\hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e7\'e0\'ea\'e0\'f7\'e0\'f2\'fc\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'ee\'e9\loch\f39 \hich\f39
+\'f4\'e0\'e9\'eb\loch\f39 \hich\f39 , \'e7\'ed\'e0\'f7\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ef\'f0\'e5\'e2\'fb\'f8\'e0\'fe\'f9\'e8\'e9\loch\f39 \hich\f39 \'e2\'fb\'e4\'e5\'eb\'e5\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea
+\loch\f39 \hich\f39 \emdash \loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'f3\'f1\'eb\'ee\'e2\'e8\'e8\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'ec\'ee
+\'e6\'e5\'f2\loch\f39 \hich\f39 \'ee\'ef\'f0\'e5\'e4\'e5\'eb\'e8\'f2\'fc\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'f0\'e0\'e7\'ec\'e5\'f0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'eb\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee
+\'f6\'e5\'f1\'f1\'e0\loch\f39 \hich\f39 \'e7\'e0\'ea\'e0\'f7\'ea\'e8\loch\f39 \hich\f39 . \'c0\loch\f39 \hich\f39 \'e2\'ee\'f2\loch\f39 \hich\f39 \'f1\'ee\'e7\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'ee\'e2\'ee\'e5\loch\f39 \hich\f39 \'f1\'ee\'e5\'e4
+\'e8\'ed\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'ef\'f0\'e5\'e2\'fb\'f8\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'ed\'e5\loch\f39
+\hich\f39 \'f3\'e4\'e0\'f1\'f2\'f1\'ff.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'ed\'ee\'e2\'e0\loch\f39 \hich\f39 \'f1\'ee\'e1\'e8\'f0\'e0\'e5\'ec\loch\f39 \hich\f39 \'ee\'f7\'e5\'f0\'e5\'e4\'ed\'f3\'fe\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'fe\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3
+\'e0\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f3\'f7\'e5\'f2\'ee\'ec\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\'ed\'e0\'ef\'e8\'f1\'e0\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 (\'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 4):
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.100.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nscache 65536
+\par \hich\af39\dbch\af31505\loch\f39 logformat "L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I %O %N/%R:%r"
+\par \hich\af39\dbch\af31505\loch\f39 log c:\\3proxy\\logs\\3proxy.log D
+\par \hich\af39\dbch\af31505\loch\f39 rotate 30
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0\pararsid3764488 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+archiver }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \hich\af39\dbch\af31505\loch\f39 rar \loch\af39\dbch\af31505\hich\f39 \'93\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "c:\\Program Files\\WinRAR\\rar.exe}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \loch\af39\dbch\af31505\hich\f39 \'94\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "\hich\af39\dbch\af31505\loch\f39 a -df -inul %A %F
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+nobandlimin * * * 110
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 24000 * 192.168.0.2,192.168.0.3
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 48000 * 192.168.0.4
+\par \hich\af39\dbch\af31505\loch\f39 bandlimout 24000 *
+\par \hich\af39\dbch\af31505\loch\f39 counter "c:\\3proxy\\3proxy.3cf" D "C:\\3proxy\\traf\\traf"
+\par \hich\af39\dbch\af31505\loch\f39 nocountin * 192.168.0.4\hich\af39\dbch\af31505\loch\f39 * 110 *
+\par \hich\af39\dbch\af31505\loch\f39 countin "1/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c8\'e2\'e0\'ed\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 50 * 192.168.0.2 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin "2/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'e5\'f2\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 80 * 192.168.0.3 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin "3/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d1\'e8\'e4\'ee\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 30 * 192.168.0.4 * * *
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 deny * 192.168.200.4 * 110 * 1-5 18:00:00-23:59:59,00:00:00-08:00:00
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 allow * 192.168.200.4 * * * 1-5 \hich\af39\dbch\af31505\loch\f39 09:00:00-18:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3 * 80,443 * 1-7 00:00:00-23:59:59
+\par \hich\af39\dbch\af31505\loch\f39 proxy -t
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'f3\loch\f39 \hich\f39 \'e2\'ee\'f2\loch\f39 \hich\f39 , \'ec\'fb\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'e8\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0
+\'ee\'e8\'eb\'e8\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'e2\'e5\'e4\'fc\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\loch\f39 \hich\f39 - \'fd\'f2\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39
+\hich\f39 WEB-\'f1\'e5\'f0\'f4\'e8\'ed\'e3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 FTP. \'dd\'eb\'e5\'ea\'f2\'f0\'ee\'ed\'ed\'e0\'ff\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'e0\loch\f39 \hich\f39 ! \'c2\'ee\'f2\loch\f39 \hich\f39 \'e5\'e9\loch\f39
+\hich\f39 \'ec\'fb\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e7\'e0\'e9\'ec\'e5\'ec\'f1\'ff\loch\f39 \hich\f39 . \'c4\'eb\'ff\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'eb\'e0\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e8\'ec\loch\f39 \hich\f39 \'ef
+\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\hich\af39\dbch\af31505\loch\f39 \hich\f39 . \'c4\'eb\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'ee\'f1\'f2\'e0\'e2\'e5\loch\f39
+\hich\f39 3proxy \'e8\'ec\'e5\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1\'e2\'ee\'e9\loch\f39 \hich\f39 pop3-\'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 :
+\par
+\par
+\par \hich\af39\dbch\af31505\loch\f39 pop3p
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e8\'f2\'fc
+\loch\f39 \hich\f39 \'e2\'e0\'f8\'e8\loch\f39 \hich\f39 \'ec\'fd\'e9\'eb-\'ea\'eb\'e8\'e5\'ed\'f2\'fb\loch\f39 \hich\f39 . \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'e4\'eb\'ff
+\loch\f39 \hich\f39 \'ff\'f9\'e8\'ea\'e0\loch\f39 \hich\f39 vasya.pupkin@mail.ru \'e2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'ec\'ee\'e5\'e3\'ee\loch\f39 \hich\f39 \'eb\'fe\'e1\'e8\'ec\'ee\'e3\'ee\loch\f39
+\hich\f39 TheBat! \'e2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'e0\'e2\'ea\'e8\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 (\'e7\'e0\'ea\'eb\'e0\'e4\'ea\'e0\loch\f39 \hich\f39
+\'d2\'f0\'e0\'ed\'f1\'ef\'ee\'f0\'f2\loch\f39 \hich\f39 ) \'f0\'e0\'ed\'fc\'f8\loch\af39\dbch\af31505\hich\f39 \'e5\loch\f39 \hich\f39 \'f1\'f2\'ee\'ff\'eb\'e8\loch\f39 \hich\f39 \'f2\'e0\'ea\'e8\'e5\loch\f39 \hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0
+\'fb\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 pop3-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 : pop.mail.ru
+\par \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\loch\f39 : vasya.pupkin
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'f2\'ee\loch\f39 \hich\f39 \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'f3\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea
+\'f1\'e8\loch\f39 \hich\f39 , \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'ef\'ee\'ec\'e5\'ed\'ff\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'f3\'fe\'f9\'e8\'e5
+\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 pop3-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 : 192.168.0.1
+\par \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\loch\f39 : vasya.pupkin@pop.mail.ru
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'e2\'ed\'e8\'ec\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 , \'e8\'ec\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\'e4\'ee\'e2\'e0\'f2\loch\af39\dbch\af31505\hich\f39 \'e5\'eb\'fc\'ed\'ee\'f1\'f2\'fc
+\loch\f39 \hich\f39 "\'e8\'ec\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 "@"POP3-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 \'e2\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 \'ff\'f9\'e8\'ea\'e0\loch\f39
+\hich\f39 ", \'e0\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e2\'e0\'f8\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'eb\'ff\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'e5\'e9\loch\f39 \hich\f39 \'ed\'e0\'e3\'eb\'ff\'e4\'ed\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 \'f0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e8\'ec\loch\f39 \hich\f39 \'e5\'f9\'e5
+\loch\f39 \hich\f39 \'e2\'e0\'f0\'e8\'e0\'ed\'f2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e8\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'e0\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 pop3-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 : mail.example.com
+\par \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\loch\f39 : vasya.pupkin@example.com
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d2\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'ef\'f0
+\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\af39\dbch\af31505\hich\f39 \'f8\'eb\'ee\'f1\'fc\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 \'ef\'ee\'ec\'e5\'ed\'ff\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e8\loch\f39
+\hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'f3\'fe\'f9\'e8\'e5\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 pop3-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 : 192.168.0.1
+\par \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\loch\f39 : vasya.pupkin@example.com@mail.example.com
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'ea\'e0\'f7\'e5\'f1\'f2\'e2\'e5\loch\f39 \hich\f39 \'f0\'e0\'e7\'e4\'e5\'eb\'e8\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 \'e7\'e4\'e5\'f1\'fc\loch\f39 \hich\f39 \'e2\'fb\'f1\'f2\'f3\'ef\'e0\'e5\'f2
+\loch\f39 \hich\f39 @, \'ed\'ee\loch\f39 \hich\f39 \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'ee\loch\f39 \hich\f39 , \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'e4\'f0\'f3
+\'e3\'ee\'e9\loch\f39 \hich\f39 \'f1\'e8\'ec\'e2\'ee\'eb\loch\f39 \hich\f39 , \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'ff\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 d
+\hich\af39\dbch\af31505\loch\f39 elimchar:
+\par
+\par \hich\af39\dbch\af31505\loch\f39 delimchar #
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d7\'f2\'ee\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'ea\'e0\'f1\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ee\'f2\'ef\'f0\'e0\'e2\'ea\'e8\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 , \'f2\'ee
+\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e0\'e1\'ee\'f2\'f7\'e8\'ea\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'f2\'e5\'eb\'fc\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5
+\'f0\'e0\loch\f39 \hich\f39 \'f0\'e5\'ea\'ee\'ec\'e5\'ed\'e4\'f3\'e5\'f2\loch\f39 \hich\f39 \'e2\'ee\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef
+\'ee\'f0\'f2\'ec\'e0\'ef\'ef\'e8\'ed\'e3\'ee\'ec\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 25 smtp.provider.ru 25
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'f2\'ee\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 , \'ed\'e5\loch\f39 \hich\f39 \'ec\'f3\'e4\'f0\'f1\'f2\'e2\'f3\'ff\loch\f39
+\hich\f39 \'eb\'f3\'ea\'e0\'e2\'ee\loch\f39 \hich\f39 , \'ec\'fb\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\loch\af39\dbch\af31505\hich\f39 \'fb\loch\f39 \hich\f39 \'ef\'ee
+\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'f3\loch\f39 \hich\f39 25, \'ef\'ee\loch\f39 \hich\f39 \'ea\'ee\'f2\'ee\'f0\'ee\'ec\'f3\loch\f39 \hich\f39 , \'f1\'ee\'e1\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 , \'e8\loch\f39 \hich\f39 \'ee\'f2\'ef\'f0
+\'e0\'e2\'eb\'ff\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'ee\'e2\'fb\'e5\loch\f39 \hich\f39 \'f1\'ee\'ee\'e1\'f9\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 , \'ef\'e5\'f0\'e5\'ea\'e8\'e4\'fb\'e2\'e0\'e5\'ec\loch\f39 \hich\f39 \'ed\'e0\loch\f39
+\hich\f39 25-\'fb\'e9\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'ee\'e2\'ee\'e3\'ee\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'ef\'f0\'ee\'e2\'e0\'e9\'e4\'e5\'f0\'e0
+\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'e2\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'ee\'e2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'e0
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f3\'ef\'ee\'ec\'ff\'ed\'f3\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\loch\f39
+\hich\f39 \'ff\'f9\'e8\'ea\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ee\'e1\'f9\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ef\'ee\'ec\'e5\'ed\'ff\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e7\'e0\'ef\'e8\'f1\'fc
+\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 SMTP-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 SMTP-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 : 192.168.0.1
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'ee\'eb\'e6\'e5\'ed\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\'e5\'ec\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'ec
+\'e0\'ef\'ef\'e8\'ed\'e3\'ee\'ec\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39
+\'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee
+\'eb\'fc\'e7\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 2110 pop.mail.ru 110
+\par \loch\af39\dbch\af31505\hich\f39 \'c5\'f1\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'e2\'e0\'f0\'e8\'e0\'ed\'f2\'e5\loch\f39 \hich\f39 \'ee\'e4\'ed\'e0\loch\f39 \hich\f39 \'ed\'e5\'ef\'f0\'e8\'ff\'f2\'ed
+\'e0\'ff\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'f1\'f2\'ee\'f0\'ee\'ed\'e0\loch\f39 \hich\f39 - \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e8\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f2\loch\f39 \hich\f39 \'ef
+\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ff\'f9\'e8\'ea\'e0\'ec\'e8\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f0\'e0\'e7\'ed\'fb\'f5\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'ee\'e2\'fb\'f5\loch\f39 \hich\f39 \'f1\'e5\'f0
+\'e2\'e5\'f0\'e0\'f5\loch\f39 \hich\f39 , \'e1\'eb\'e0\'e3\'ee\loch\f39 \hich\f39 \'f7\'f2\'ee\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'ec\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'f0\'e0\'e7\'e2\'e5\'eb\'ee\'f1\'fc\loch\f39 \hich\f39
+ (yandex, rambler,newmail...), \'f2\'ee\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'ee\'e2\'ee\'e3\'ee\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'ef
+\'f0\'e8\'e4\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e7\'e0\'e2\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'ed\'ee\'e2\'f3\'fe\loch\f39 \hich\f39 \'e7\'e0\'ef\'e8\'f1\'fc\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'ec\'e0\'ef\'ef\'e8\'ed\'e3\'e0\loch\f39 \hich\f39
+\'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'ec\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 tcppm \hich\af39\dbch\af31505\loch\f39 -i192.168.0.1 3110 pop.yandex.ru 110
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c2\'ef\'f0\'ee\'f7\'e5\'ec\loch\f39 \hich\f39 , \'e2\'f0\'ff\'e4\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'f7
+\'e8\'f1\'eb\'ee\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'ee\'ec\loch\f39 \hich\f39 \'ee\'f4\'e8\'f1\'e5\loch\f39 \hich\f39 \'ef\'f0\'e5\'e2\'fb\'f1\'e8\'f2\loch\f39 10-15.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'fb\loch\f39 \hich\f39 \'ff\'f9\'e8\'ea\'e0\loch\f39 \hich\f39 \'e2\loch\f39
+\hich\f39 \'ec\'fd\'e9\'eb-\'ea\'eb\'e8\'e5\'ed\'f2\'e5\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f2\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'f3\'fe\'f9\'e8\'e5\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 pop3-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 : 192.168.0.1
+\par \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\loch\f39 : vasya.pupkin
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'e8\loch\f39 \hich\f39 \'e4\'ee\'ef\'ee\'eb\'ed\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'ec\'e5\'ed\'ff\'f2\'fc
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 2110 \'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0\'e1\'fb\'f2\'fc\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef
+\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\'ec\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'fd\'f2\'ee\'f2\loch\f39 \hich\f39 \'ed\'e5\'f1\'f2\'e0\'ed\'e4\'e0\'f0\'f2\'ed\'fb\'e9
+\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3 * 2110,25,110 * 1-5 00:00:00-20:00:00
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'e0\'ea\'ee\'e9\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'f1\'ef\'ee\'f1\'ee\'e1\'ee\'e2\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39
+\'e2\'fb\'e1\'e8\'f0\'e0\'f2\'fc\loch\f39 \hich\f39 - \'e4\'e5\'eb\'ee\loch\f39 \hich\f39 \'e2\'ea\'f3\'f1\'e0\loch\f39 \hich\f39 , \'ec\'ed\'e5\loch\f39 \hich\f39 \'e1\'ee\'eb\'e5\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'fb\'f7\'e5\'ed\loch\f39
+\hich\f39 \'ef\'ee\'f0\'f2\'ec\'e0\'ef\'ef\'e8\'ed\'e3\loch\f39 \hich\f39 , \'e5\'e3\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'ec\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc
+\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'ef\'f0\'ee\'f7\'e5\'ec\loch\f39 \hich\f39 , \'ef\'f0\'ee\'e3\'f0\'e5\'f1\'f1\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'f2\'ee\'e8\'f2\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ec\'e5\'f1\'f2\'e5
+\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ee\'f2\'ef\'f0\'e0\'e2\'ea\'e8\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39 \hich\f39
+ smtp-\'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 , \'f0\'e0\'e1\'ee\'f2\'e0\'fe\'f9\'e8\'e9\loch\f39 \hich\f39 \'e0\'ed\'e0\'eb\'ee\'e3\'e8\'f7\'ed\'ee\loch\f39 pop3p:
+\par
+\par \hich\af39\dbch\af31505\loch\f39 smtpp
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'ee\'f7\'f2\'ee\'e2\'fb\'e5\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'fb\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'e0\'e8\'e2\'e0\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'e0\'ed\'e0\'eb\'ee\'e3\'e8\'f7\'ed\'ee
+\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e5\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 pop3p: \'ef\'ee\'f0\'f2\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 \'ee\'f1\'f2\'e0\'fe\'f2\'f1\'ff
+\loch\f39 \hich\f39 \'e1\'e5\'e7\loch\f39 \hich\f39 \'e8\'e7\'ec\'e5\'ed\'e5\'ed\'e8\'e9\loch\f39 \hich\f39 , \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 pop3-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'f3\loch\af39\dbch\af31505\hich\f39 \'ea
+\'e0\'e7\'fb\'e2\'e0\'e5\'ec\loch\f39 \hich\f39 IP \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'ee\'eb\'e5\loch\f39 \hich\f39 \'e8\'ec\'e5\'ed\'e8\loch\f39 \hich\f39
+\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 \'e7\'e0\'e1\'e8\'e2\'e0\'e5\'ec\loch\f39 \hich\f39 \'e8\'ec\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 @POP_SERVER.
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e8\'ec\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'e5\loch\f39 \hich\f39 \'ff\'f9\'e8\'ea\'e0\loch\f39 }{\field{\*\fldinst {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39
+HYPERLINK "mailto:ivan@mail.ru"}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid3764488 {\*\datafield
+00d0c9ea79f9bace118c8200aa004ba90b0200000003000000e0c9ea79f9bace118c8200aa004ba90b400000006d00610069006c0074006f003a006900760061006e0040006d00610069006c002e00720075000000795881f43b1d7f48af2c825dc485276300000000a5ab0000}}}{\fldrslt {\rtlch\fcs1
+\af39\afs20 \ltrch\fcs0 \f39\fs20\ul\cf9\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 ivan@mail.ru}}}\sectd \ltrsect\linex0\sectdefaultcl\sftnbj {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\hich\af39\dbch\af31505\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'ef\'ee\'eb\'e5\loch\f39 \hich\f39 \'ab\'d3\'f7\'e5\'f2\'ed\'e0\'ff\loch\f39 \hich\f39 \'e7\'e0\'ef\'e8\'f1\'fc\'bb\loch\f39 \hich\f39 \'e2\'ed\'ee\'f1\'e8\'ec\loch\f39 }{\field{\*\fldinst {
+\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 HYPERLINK "mailto:ivan@smtp.mail.ru"}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid3764488 {\*\datafield
+00d0c9ea79f9bace118c8200aa004ba90b0200000003000000e0c9ea79f9bace118c8200aa004ba90b4a0000006d00610069006c0074006f003a006900760061006e00400073006d00740070002e006d00610069006c002e00720075000000795881f43b1d7f48af2c825dc485276300000000a5ab0000}}}{\fldrslt {
+\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\ul\cf9\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 ivan@smtp.mail.ru}}}\sectd \ltrsect\linex0\sectdefaultcl\sftnbj {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 , \'ef\'ee\'f0\'f2\loch\f39 \hich\f39 25 \'ee\'f1\'f2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e1\'e5\'e7\loch\f39 \hich\f39 \'e8\'e7\'ec\'e5\'ed\'e5\'ed\'e8\'e9\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 . \'c0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'ee\'eb\'e5\loch\f39 \hich\f39 \'ab\'d1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 \'e8\'f1\'f5\'ee\'e4\'ff\'f9\'e5\'e9
+\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\'bb\loch\f39 \hich\f39 \'e7\'e0\'e1\'e8\'e2\'e0\'e5\'ec\loch\f39 \hich\f39 IP \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'ee\'e1\'e8\'f0\'e0\'e5\'ec\loch\f39 \hich\f39 \'ee\'f7\'e5\'f0\'e5\'e4\'ed\'f3\'fe\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'fe\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 \'f1\loch\f39
+\hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 pop3p (\'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 5):
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.10\hich\af39\dbch\af31505\loch\f39 0.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nscache 65536
+\par \hich\af39\dbch\af31505\loch\f39 logformat "L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I %O %N/%R:%r"
+\par \hich\af39\dbch\af31505\loch\f39 log c:\\3proxy\\logs\\3proxy.log D
+\par \hich\af39\dbch\af31505\loch\f39 rotate 30
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0\pararsid3764488 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+archiver }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \hich\af39\dbch\af31505\loch\f39 rar \loch\af39\dbch\af31505\hich\f39 \'93\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "c:\\Program Files\\WinRAR\\rar.exe}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \loch\af39\dbch\af31505\hich\f39 \'94\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "\hich\af39\dbch\af31505\loch\f39 a -df -inul %A %F
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 nobandlimin * * * 110
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 24000 * \hich\af39\dbch\af31505\loch\f39 192.168.0.2,192.168.0.3
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 48000 * 192.168.0.4
+\par \hich\af39\dbch\af31505\loch\f39 bandlimout 24000 *
+\par \hich\af39\dbch\af31505\loch\f39 counter "c:\\3proxy\\3proxy.3cf" D "C:\\3proxy\\traf\\traf"
+\par \hich\af39\dbch\af31505\loch\f39 nocountin * 192.168.0.4 * 110 *
+\par \hich\af39\dbch\af31505\loch\f39 countin "1/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c8\'e2\'e0\'ed\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 50 * 192.168.0.2 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin "2/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'e5\'f2\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 80 * 192.168.0.3 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin \hich\af39\dbch\af31505\loch\f39 "3/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d1\'e8\'e4\'ee\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 30 * 192.168.0.4 * * *
+\par
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.200.4 * * * 1-5 09:00:00-18:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3 * 80,443 * 1-7 00:00:00-23:59:59
+\par \hich\af39\dbch\af31505\loch\f39 proxy
+\par
+\par \hich\af39\dbch\af31505\loch\f39 # }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'ce\'d7\'d2\'c0}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 deny * 192.168.200.4 * 110 * 1-5 18:00:00-23:59:59,00:00:00-08:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3,192.168.0.4 * 25,110 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 25}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186 00}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 smtp.provider.ru 25
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 pop3p
+\par \hich\af39\dbch\af31505\loch\f39 smtpr
+\par \loch\af39\dbch\af31505\hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'fb\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'ef\'ee\'f0
+\'f2\'ec\'e0\'ef\'ef\'e8\'ed\'e3\loch\f39 \hich\f39 \'f1\'e5\'ea\'f6\'e8\'ff\loch\f39 \hich\f39 \'ea\'ee\'ed\loch\af39\dbch\af31505\hich\f39 \'f4\'e8\'e3\'e0\loch\f39 \hich\f39 , \'e8\'e4\'f3\'f9\'e0\'ff\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5
+\loch\f39 \hich\f39 \'ea\'ee\'ec\'e5\'ed\'f2\'e0\'f0\'e8\'ff\loch\f39 \hich\f39 # \'cf\'ce\'d7\'d2\'c0\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'e5\'eb\'e0\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 \'ed\'e5\'ec\'ed\'ee\'e3\'ee\loch\f39
+\hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'ee\'ec\'f3\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 # }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\loch\af39\dbch\af31505\hich\f39 \'cf\'ce\'d7\'d2\'c0}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 deny * 192.168.200.4 * 110 * 1-5 18:00:00-23:59:59,00:00:00-08:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3,192.168.0.4 * 25,110 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192\hich\af39\dbch\af31505\loch\f39 .168.0.1 25}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186 00}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 smtp.provider.ru 25
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 2110 pop.mail.ru 110
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 3110 pop.yandex.ru 110
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c2\'fb\loch\f39 \hich\f39 , \'ed\'e0\'e2\'e5\'f0\'ed\'ee\'e5\loch\f39 \hich\f39 , \'e7\'e0\'ec\'e5\'f2\'e8\'eb\'e8\loch\f39 \hich\f39 \'ed\'ee\'e2
+\'f3\'fe\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 \hich\f39 flush. \'cc\'fb\loch\f39 \hich\f39 \'e5\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'ed\'e8\'eb\'e8\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f1\'e1\'f0\'ee\'f1
+\'e0\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'e0\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39
+\'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39 \'e8\'e7\'ec\'e5\'ed\'e8\'f2\'fc\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'e8\loch\af39\dbch\af31505\hich\f39 \'ff\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0
+\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 . \'c7\'e0\'ec\'e5\'f7\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'f1\'e1\'f0\'ee\'f1\loch\f39 \hich\f39 \'ed
+\'e5\loch\f39 \hich\f39 \'e4\'e5\'e9\'f1\'f2\'e2\'f3\'e5\'f2\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'f1\'ea\'ee\'f0\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'ee
+\'e5\loch\f39 \hich\f39 \'e4\'e5\'e9\'f1\'f2\'e2\'f3\'e5\'f2\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 . \'c8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0
+\'e1\'fb\'e2\'e0\'e5\'ec\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'ed\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\'ef\'ee\'f1\'ee
+\'e1\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'e8\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d3\'f7\'f2\'e8\'f2\'e5\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 smtpr}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\kerning1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'f3\'ec\'ee\'eb\'f7\'e0\'ed\'e8\'fe\loch\f39 \hich\f39 \'e7\'e0\'ed\'e8\'ec\'e0\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 \hich\f39
+ 25, \'ef\'ee\'fd\'f2\'ee\'ec\'f3\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'f3\loch\f39 \hich\f39 \'ed\loch\af39\dbch\af31505\hich\f39 \'e5\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'ed\'fb
+\loch\f39 \hich\f39 \'e2\'e8\'f1\'e5\'f2\'fc\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'e8\'e5\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c8\loch\f39 \hich\f39 \'ed\'e0\'ea\'ee\'ed\'e5\'f6\loch\f39 \hich\f39 , \'f0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e8\'ec\loch\f39 \hich\f39 \'e2\'e0\'e6\'ed\'f3\'fe\loch\f39 \hich\f39 \'f1\'ee\'f1\'f2\'e0\'e2\'eb\'ff\'fe\'f9
+\'f3\'fe\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 - WEB-\'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\loch\f39 \hich\f39 \'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39
+. \'c4\'eb\'ff\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'ed\'e5\'ec\'f3\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ec
+\'e0\'ed\'e4\'f3\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 admin
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'eb\'ff\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\'f3\loch\f39 \hich\f39 \'ef\'f0\'ee\'ef\'e8\'f8\'e8\'f2\'e5\loch\f39
+\hich\f39 \'e2\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\'ed\'ee\'e9\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e5\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\'e0\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'f3\'fe\'f9\'e8\'e9\loch\f39 \hich\f39 \'e0\'e4
+\'f0\'e5\'f1\hich\af39\dbch\af31505\loch\f39 \hich\f39 : http://192.168.0.1:80, \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0\'e1\'fb\'e2\loch\f39 \hich\f39 , \'ea\'ee\'ed\'e5\'f7\'ed\'ee\loch\f39 \hich\f39 , \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0
+\'e5\'f8\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'f1\'f2\'e0\'ed\'e4\'e0\'f0\'f2\'ed
+\'ee\'e3\'ee\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 admin \'ef\'ee\'f0\'f2\'e0\loch\f39 \hich\f39 80. \'c2\loch\f39 \hich\f39 \'ee\'f2\'ea\'f0\'fb\'e2\'f8\'e5\'ec\'f1\'ff\loch\f39 \hich\f39
+\'ee\'ea\'ed\'e5\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'e8\'ed\'f4
+\'ee\'f0\'ec\'e0\'f6\'e8\'e8\loch\f39 \hich\f39 \'ee\loch\f39 \hich\f39 \'ec\'e0\'ea\'f1\'e8\'ec\'e0\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e4\'ee\'ef\'f3\'f1\'f2\'e8\'ec\'ee\'ec\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e5\loch\f39 \hich\f39 \'e8
+\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'f2\'e5\'ea\'f3\'f9\'e5\'ec\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e5\'ed\'e8\'e8\loch\f39 \hich\f39 , \'ef\'ee\'f1\'ec\'ee\'f2\'f0\'e5\loch\af39\dbch\af31505\hich\f39 \'f2
+\loch\af39\dbch\af31505\hich\f39 \'fc\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'f6\'e5\'eb\'e8\'ea\'ee\'ec\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'e7\'e0\'ef\'f3\'f1\'f2
+\'e8\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 . \'cf\'ee\'fd\'f2\'ee\'ec\'f3\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'fd\'f2\'f3
+\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'f3\loch\f39 \hich\f39 \'f0\'e0\'e7\'e4\'e0\'e2\'e0\'e9\'f2\'e5\loch\f39 \hich\f39 \'ea\'f0\'e0\'e9\'ed\'e5\loch\f39 \hich\f39 \'e2\'ed\'e8\'ec\'e0\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 ! \'c2\'ef\'f0\'ee
+\'f7\'e5\'ec\loch\f39 \hich\f39 , \'f3\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 admin \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'ea\'eb\'fe\'f7\loch\f39 \hich\f39 -s, \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 \'ed\'e5\loch\f39
+\hich\f39 \'e4\'e0\'e5\'f2\loch\f39 \hich\f39 \'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'ed\'e8\'f7\'e5\'e3\'ee\loch\f39 \hich\f39 \'ed\'e5\'e4\'ee\'e7\'e2\'ee\'eb\'e5\'ed\'ed\'ee
+\'e3\'ee.
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e0\'e4\'ee\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'e8\'ec\'e5\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e2\'e8\'e4\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39
+\'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'ec\'ee\'f2\'f0\loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'e8\'f1\'f2\'e8\'ea\'e8\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\'e5\loch\f39
+\hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e3\'e0\'eb\'ee\'f7\'ea\'f3
+\loch\f39 \hich\f39 \'cd\'e5\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'f2\'fc
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e8\'e6\'e5\'f1\'f2\'ee\'ff\'f9\'e5\'ec\loch\f39 \hich\f39 \'ef\'ee\'eb\'e5\loch\f39 \hich\f39 \'e0\'e9-\'ef\'e8\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-
+\'f1\'e5\'f0\'e2\'e5\'f0\'e0}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \u8203\'3f}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39
+\hich\f39 , \'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 \'d1\'f7\'e8\'f2\'e0\'fe\loch\f39 \hich\f39 \'f1\'e2\'ee\'e8\'ec\loch\f39 \hich\f39 \'e4\'ee\'eb\'e3\'ee\'ec\loch\f39 \hich\f39 \'f3\'ef\'ee\'ec\'ff\'ed\'f3\'f2\'fc\loch\f39 \hich\f39 \'ee\loch\f39
+\hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e5\loch\f39 \hich\f39 writable, \'ea\'ee\'f2\'ee\'f0\'e0\'ff\loch\f39 \hich\f39 , \'e1\'f3\'e4\'f3\'f7\'e8\loch\f39 \hich\f39 \'f0\'e0\'e7\'ec\'e5\loch\af39\dbch\af31505\hich\f39 \'f9\'e5\'ed\'e0\loch\f39 \hich\f39
+\'e2\loch\f39 \hich\f39 \'f1\'e0\'ec\'ee\'ec\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'eb\'e5\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 , \'e4\'e0\'e5\'f2\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2\'fc\loch\f39
+\hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'f7\'e8\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 WEB-\'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9
+\'f1\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ec\'e5\'ed\'ff\'f2\'fc\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 ! \'c0\'e2\'f2\'ee\'f0\loch\f39 \hich\f39 \'ef\'f0\'ee\'e3\'f0\'e0\'ec\'ec\'fb\loch\f39
+\hich\f39 \'ef\'f0\'e5\'e4\'eb\'e0\'e3\'e0\'e5\'f2\loch\f39 \hich\f39 \'e4\'e2\'e0\'e6\'e4\'fb\loch\f39 \hich\f39 \'ef\'ee\'e4\'f3\'ec\'e0\'f2\'fc\loch\f39 \hich\f39 , \'ef\'f0\'e5\'e6\'e4\'e5\loch\f39 \hich\f39 \'f7\'e5\'ec\loch\f39 \hich\f39 \'e2
+\'ea\'eb\'fe\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'fd\'f2\'f3\loch\f39 \hich\f39 \'ee\'ef\'f6\'e8\'fe\loch\f39 \hich\f39 . \'d7\'f2\'ee\loch\f39 \hich\f39 \'ea\'e0\'f1\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39
+\hich\f39 , \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ee\'e4\'ed\'e0\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'f2\'e5\'eb\'fc\'ed\'e0\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 , \'ec\'e8\'ec
+\'ee\loch\f39 \hich\f39 \'ea\'ee\'f2\'ee\'f0\'ee\'e9\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ff\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ec\'ee\'e3\'f3\loch\f39 \hich\f39 \'ef\'f0\'ee\'e9\'f2\'e8\loch\f39 \hich\f39
+. \'dd\'f2\'ee\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 monitor, \'ea\'ee\'f2\'ee\'f0\'e0\'ff\loch\f39 \hich\f39 \'ef\'ee\'e7\'e2\'ee\'eb\'ff\'e5\'f2\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'f3
+\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'e8\'f2\'fc\loch\f39 \hich\f39 \'e7\'e0\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'ee\'ec\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'f3\'f0\'e0\'f6\'e8\'e8\loch\f39 \hich\f39 (\'e8\loch\f39 \hich\f39 \'ed\'e5
+\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'ed\'fb\'ec\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'ee\'ec\loch\f39 \hich\f39 3proxy.cfg, \'ed\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'ec
+\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'e8\'ec\loch\f39 \hich\f39 , \'e2\'ea\'eb\'fe\'f7\'e0\'e5\'ec\'fb\'ec\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 ) \'e8\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1
+\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ee\'e1\'ed\'e0\'f0\'f3\'e6\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e5\'e9\loch\f39 \hich\f39 \'e8\'e7\'ec\'e5\'ed\'e5\'ed\'e8\'e9\loch\f39 \hich\f39 \'ed\'e5\'e7\'e0\'ec\'e5\'e4\'eb
+\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 (\'ef\'ee\loch\f39 \hich\f39 \'ec\'ee\'e8\'ec\loch\f39 \hich\f39 \'ed\'e0\'e1\'eb\'fe\'e4\'e5\loch\af39\dbch\af31505\hich\f39 \'ed\loch\af39\dbch\af31505\hich\f39 \'e8\'ff\loch\f39 \hich\f39 , \'f7\'e5
+\'f0\'e5\'e7\loch\f39 \hich\f39 2-3 \'f1\'e5\'ea\'f3\'ed\'e4\'fb\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'f1\'ee\'f5\'f0\'e0\'ed\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 ) \'e7\'e0\'e3\'f0\'f3\'e6\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'ee
+\'e2\'f3\'fe\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'f3\'f0\'e0\'f6\'e8\'fe\loch\f39 \hich\f39 . \'cf\'f0\'ee\'f1\'f2\'ee\loch\f39 \hich\f39 \'ee\'f2\'eb\'e8\'f7\'ed\'e0\'ff\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2\'fc\loch\f39
+\hich\f39 , \'ea\'ee\'f2\'ee\'f0\'ee\'e9\loch\f39 \hich\f39 \'ec\'ed\'e5\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f5\'e2\'e0\'f2\'e0\'eb\'ee\loch\f39 \hich\f39 \'e2\loch\f39 ES Proxy!
+\par \loch\af39\dbch\af31505\hich\f39 \'d2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e8\'ec\'e5\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e2\'e8\'e4\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39
+\'fd\'f2\'e8\loch\f39 \hich\f39 \'e4\'e2\'e5\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 \emdash \loch\f39 \hich\f39 writable \'e8\loch\f39 \hich\f39 monitor - \'ed\'e5\'eb\'fc\'e7\'ff\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5
+\'ed\'ff\'f2\'fc\loch\f39 \hich\f39 \'e2\'ec\'e5\'f1\'f2\'e5.
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 monitor "c:\\3proxy\\bin\\\hich\af39\dbch\af31505\loch\f39 3proxy.cfg"
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d0\'e0\'e7\'f3\'ec\'e5\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 \'ec\'ee\'ed\'e8\'f2\'ee\'f0\loch\f39
+\hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'ed\'fb\'ec\loch\f39
+\hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'ee\'ec\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 . \'c4\'e5\'eb\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f2\'ee\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e2\'ea\'eb\'fe\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'ee\'f2\'e4\'e5\'eb\'fc\'ed\'fb\'e5\loch\f39 \hich\f39 \'f2\'e5\'ea
+\'f1\'f2\'ee\'e2\'fb\'e5\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'fb\loch\f39 \hich\f39 \'f1\'ee\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'e0\'ec\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 , \'f1\'e5\'f2
+\'e5\'e9\loch\f39 \hich\f39 , \'ef\'e0\'f0\'ee\'eb\'e5\'e9\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f2.\'e4\loch\f39 \hich\f39 . \'c4\'eb\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'f2\'f1
+\'ff\loch\f39 \hich\f39 \'ec\'e0\'ea\'f0\'ee\'f1\loch\f39 \hich\f39 $. \'cd\'e0\'ef\'f0\'e8\'ec\loch\af39\dbch\af31505\hich\f39 \'e5\'f0\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0\'ef\'e8\'f1\'fb
+\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'ed\'ee\'e9\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'ee\'e9\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ee\'ea\loch\f39 \hich\f39
+ IP \'e0\'e4\'f0\'e5\'f1\'ee\'e2\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'ee\'e2\loch\f39 \hich\f39 , \'e8\'ec\'e5\'fe\'f9\'e8\'f5\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2
+\'e5\loch\f39 \hich\f39 , \'ec\'fb\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'ec\loch\f39 \hich\f39 \'f1\'ee\'e7\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'f2\'e5\'ea\'f1\'f2\'ee\'e2\'ee\'e9\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 IP_list.txt,
+\'e2\loch\f39 \hich\f39 \'ed\'e5\'e3\'ee\loch\f39 \hich\f39 \'e2\'ed\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'e7\'e0\'ef\'ff\'f2\'f3\'fe\loch\f39 \hich\f39 (\'e1\'e5\'e7\loch\f39 \hich\f39 \'ef\'f0\'ee\'e1\'e5\'eb
+\'ee\'e2\loch\f39 \hich\f39 !) \'e2\'f1\'e5\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'fb\'e5\loch\f39 \hich\f39 \'ed\'e0\'ec\loch\f39 \hich\f39 IP, \'f2\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 , \'e7\'e0\'e4\'e0
+\'fe\'f9\'e0\'ff\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ee\'ea\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'ef\loch\af39\dbch\af31505\hich\f39 \'ee\loch\af39\dbch\af31505\hich\f39 \'f7\'f2\'e5\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'ff\'f9\'e0\'ff\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3,192.168.0.4 * 2110,25,110 * 1-5
+\par \hich\af39\dbch\af31505\loch\f39 00:00:00-20:00:00
+\par \loch\af39\dbch\af31505\hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'e1\'fb\'f2\'fc\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'ed\'e5\'ed\'e0\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'ee\'e9\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 allow * $"c:\\3proxy\\IP_list.txt" * 2110,25,110 * 1-5 00:00:00-20:00:00
+\par \loch\af39\dbch\af31505\hich\f39 \'d2\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'ec\'fb\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'ec\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\'eb\'e5\'e6\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'e8
+\loch\f39 \hich\f39 \'e7\'e0\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'ee\'ec\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\loch\af39\dbch\af31505\hich\f39 \'f1\'ee\'e2\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'e0\loch\f39 \hich\f39
+ IP_list.txt \'ea\'ee\'ec\'e0\'ed\'e4\'ee\'e9\loch\f39
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 monitor "c:\\3proxy\\bin\\IP_list.txt"
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c5\'f9\'e5\loch\f39 \hich\f39 \'ee\'e4\'ed\'e0\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'f2\'e5\'eb\'fc\'ed\'e0\'ff\loch\f39 \hich\f39 \'ee
+\'f1\'ee\'e1\'e5\'ed\'ed\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 - \'ef\'f0\'e8\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'ed\'e8\'e8\loch\f39 \hich\f39 \'ea\'ee\'ec
+\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 monitor \'ec\'fb\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'ec\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ea\'ee\'f0\'f0\'e5\'ea\'f2\'e8\'f0\'ee\'e2\'e0\'f2\'fc\loch\f39
+\hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'e8\'e7\'ec\'e5\'ed\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e1\'f3\'e4\'f3\'f2\loch\f39 \hich\f39 \'ef\'f0\'e8\'ed\'e8\'ec\'e0\'f2\'fc\'f1
+\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'eb\'e5\'f2\'f3\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\loch\af39\dbch\af31505\hich\f39 \'f3\loch\f39 \hich\f39 ,
+\'ef\'ee\'e4\'ec\'e5\'ed\'e8\'f2\'fc\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'e8\'ec\loch\f39 \hich\f39 \'e2\'e0\'f0\'e8\'e0\'ed\'f2\'ee\'ec\loch\f39 \hich\f39 , \'f2\'e0\'ea\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39
+\hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e1\'eb\'ee\'ea\'e8\'f0\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'ee\'ec\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39
+\hich\f39 \'ee\'f2\'f1\'eb\'e5\'e6\'e8\'e2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ed\'e0\'eb\'e8\'f7\'e8\'e5\loch\f39 \hich\f39 \'e8\'e7\'ec\'e5\'ed\'e5\'ed\'e8\'e9\loch\f39 \hich\f39 . \'dd\'f2\'ee\loch\f39 \hich\f39
+\'e1\'fb\'e2\'e0\'e5\'f2\loch\f39 \hich\f39 \'ee\'f7\'e5\'ed\'fc\loch\f39 \hich\f39 \'f3\'e4\'ee\'e1\'ed\'ee\loch\f39 \hich\f39 . \'cd\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'f3\loch\f39 \hich\f39 \'ec\'e5\'ed\'ff\loch\f39 \hich\f39 \'e5
+\'f1\'f2\'fc\loch\f39 \hich\f39 \'e4\'e2\'e0\loch\f39 \hich\f39 \'e3\'ee\'f2\'ee\'e2\'fb\'f5\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 - \'ee\'e4\'e8\'ed\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee
+\'f2\'fb\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 ADSL, \'e2\'f2\'ee\'f0\'ee\'e9\loch\f39 \hich\f39 - \'e4\'eb\'ff\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'fb\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'f3\'f1\'ea
+\'ee\'f0\'e8\'f2\'e5\'eb\'fc\loch\f39 \hich\f39 \'f1\'ef\'f3\loch\af39\dbch\af31505\hich\f39 \'f2\loch\af39\dbch\af31505\hich\f39 \'ed\'e8\'ea\'ee\'e2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\'e0\loch\f39 \hich\f39 , \'ea\'ee\'ed
+\'f4\'e8\'e3\'e8\loch\f39 \hich\f39 \'ee\'f2\'eb\'e8\'f7\'e0\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 . \'cf\'f0\'e8\loch\f39 \hich\f39 \'ed
+\'e5\'ee\'e1\'f5\'ee\'e4\'e8\'ec\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'ea\'eb\'fe\'f7\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'ee\'e9\loch\f39 \hich\f39 \'ea\'e0\'ed\'e0\'eb\loch\f39
+\hich\f39 \'ff\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'e8\'ec\'e5\'ed\'ee\'e2\'fb\'e2\'e0\'fe\loch\f39 \hich\f39 (\'e8\'eb\'e8\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'ed\'ee\'f8\'f3\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'f3\'fe
+\loch\f39 \hich\f39 \'ef\'e0\'ef\'ea\'f3\loch\f39 \hich\f39 ) \'e8\'f1\'f5\'ee\'e4\'ed\'fb\'e9\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 , \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'ed\'e5\'e3\'ee\loch\f39 \hich\f39 \'f1\'f2
+\'e0\'e2\'eb\'fe\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'ee\'e9\loch\f39 \hich\f39 - \'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e8\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'ed\'e8\'f7\'e5\'e3\'ee\loch\f39
+\hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f3\'f1\'ef\'e5\'e2\'e0\'fe\'f2\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 , \'f2\'e0\'ea\loch\f39 \hich\f39 \'ea\loch\af39\dbch\af31505\hich\f39 \'e0\loch\af39\dbch\af31505\hich\f39
+\'ea\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'ee\loch\f39 \hich\f39 \'ed\'e8\loch\f39 \hich\f39 \'ee\'f1\'f2\'e0\'ed\'e0\'e2\'eb\'e8\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 , \'ed\'e8
+\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ef\'e0\'f3\'e7\'f3\loch\f39 \hich\f39 . \'ce\'f2\'eb\'e8\'f7\'ed\'e0\'ff\loch\f39 \hich\f39 \'f4\'e8\'f7\'e0
+\loch\f39 \hich\f39 , \'ed\'e5\loch\f39 \hich\f39 \'e7\'ed\'e0\'fe\loch\f39 \hich\f39 \'ed\'e8\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2
+\'e5\'f0\'e0\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f2\'e0\'ea\'ee\'e9\loch\f39 \hich\f39 ! \'cd\'e5\'ee\'e1\'f5\'ee\'e4\'e8\'ec\'ee\'e5\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 : \'fd\'f2\'e0\loch\f39 \hich\f39
+ \'f4\'e8\'f7\'e0\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e8\'e7\'ec\'e5\'ed\'e5\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'eb\'e5\'f2\'f3\loch\f39 \hich\f39 \'ed\'e5
+\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'ee\'f7\'e5\'f2\'e0\'ed\'e8\'e8\loch\f39 \hich\f39 \'f1\loch\f39 writable.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'e0\loch\f39 \hich\f39 , \'f7\'f3\'f2\'fc\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0\'e1\'fb\'eb\'e8\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'e4\'e2\'e5\loch\f39 \hich\f39 \'f1\'eb\'f3
+\loch\af39\dbch\af31505\hich\f39 \'e6\'e1\'fb\loch\f39 \hich\f39 - FTP-\'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 SOCKS-\'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 , \'e7\'e0\'ef\'f3\'f1\'ea\'e0\'e5\'ec\'fb\'e5\loch\f39
+\hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\'ec\'e8\loch\f39
+\par
+\par \hich\af39\dbch\af31505\loch\f39 ftppr
+\par \hich\af39\dbch\af31505\loch\f39 socks
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'ee\loch\f39 \hich\f39 \'f3\'ec\'ee\'eb\'f7\'e0\'ed\'e8\'fe\loch\f39 \hich\f39 \'ee\'ed\'e8\loch\f39 \hich\f39 \'f3\'f1\'f2\'e0\'ed\'e0\'e2\'eb\'e8\'e2\'e0\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39
+\hich\f39 \'ef\'ee\'f0\'f2\'fb\loch\f39 \hich\f39 21 \'e8\loch\f39 \hich\f39 1080 \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'e5\'ed\'ed\'ee.
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 \'d1\'eb\'f3\'e6\'e1\'e0\loch\f39 \hich\f39 ftppr \'ef\'ee\'e7\'e2\'ee\'eb\'ff\'e5\'f2\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 "\'ed\'e0\'f1\'f2\'ee\'ff\'f9\'e8\'e9
+\loch\f39 \hich\f39 " FTP-\'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 , \'f1\loch\f39 \hich\f39 \'ef\'ee\'e4\'e4\'e5\'f0\'e6\'ea\'ee\'e9\loch\f39 \hich\f39 \'e2\'f1\'e5\'e3\'ee\loch\f39 \hich\f39 \'f1\'f2\'e0\'ed\'e4\'e0\'f0\'f2\'ed\'ee\'e3\'ee
+\loch\f39 \hich\f39 \'ed\'e0\'e1\'ee\'f0\'e0\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\loch\f39 \hich\f39 \'ef\'f0\'ee\'f2\'ee\'ea\'ee\'eb\'e0\loch\f39 FTP,\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e7\'e0\'e1\'f3\'e4
+\'fc\'f2\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'e2\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 FTP-\'ea\'eb\'e8\'e5\'ed\'f2\'e0\loch\f39 \hich\f39 (\'e2\loch\f39 \hich\f39 \'ec\'ee\'e5
+\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 FAR) \'f3\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 192.168.0.1 \'ed\'e0
+\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'f3\loch\f39 \hich\f39 21. \'c0\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'e0\loch\f39 \hich\f39 SOCKS \'ef\'ee\'e7\'e2\'ee\'eb\'e8\'f2\loch\f39 \hich\f39 \'e2\'e0\'ec\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee
+\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'e2\'e0\'f8\'e5\'e9\loch\f39 \hich\f39 \'eb\'fe\'e1\'e8\'ec\'ee\'e9\loch\f39 \hich\f39 \'e0\'f1\'fc\'ea\'ee\'e9\loch\f39 \hich\f39
+, \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e5\'e5\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2
+\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'f3\loch\f39 SOCKS5,\hich\af39\dbch\af31505\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 192.168.0.1 \'e8\loch\f39
+\hich\f39 \'ef\'ee\'f0\'f2\loch\f39 1080.
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'ee\loch\f39 \hich\f39 ICQ \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'ef\'f3\'f1\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'f7\'e5\'f0
+\'e5\'e7\loch\f39 \hich\f39 SOCKS, \'ed\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'f1\'ef\'e5\'f6\'e8\'e0\'eb\'fc\'ed\'fb\'e9\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 icqpr. \'cd
+\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39
+\hich\f39 \'ed\'ee\'ec\'e5\'f0\loch\f39 \hich\f39 ICQ 123456789, \'f2\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39
+\'ed\'e0\'ef\'e8\'f1\'e0\'f2\'fc\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth useronly
+\par \hich\af39\dbch\af31505\loch\f39 allow 123456789
+\par \hich\af39\dbch\af31505\loch\f39 icqpr 5190 login.icq.com 5190
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ce\'e1\'f0\'e0\'f2\'e8\'f2\'e5\loch\f39 \hich\f39 \'e2\'ed\'e8\'ec\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'ef\'e5
+\'f6\'e8\'e0\'eb\'fc\'ed\'fb\'e9\loch\f39 \hich\f39 \'e2\'e8\'e4\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'e8\loch\f39 \hich\f39 useronly. \'d2\'e5\loch\f39 \hich\f39 , \'ea\'ee\'ec\'f3\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2
+\loch\f39 \hich\f39 \'eb\'e5\'ed\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ef\'e8\'f1\'fb\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'ee\'ec\'e5\'f0\'e0\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef
+\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 , \'e2\'f2\'ee\'f0\'f3\'fe\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'f3\loch\f39 \hich\f39 \'ec\'ee\'e3\'f3\'f2\loch\f39 \hich\f39 \'ef\'f0\'ee\'ef\'e8\'f1\'e0\'f2\'fc\loch\f39
+\hich\f39 \'f2\'e0\'ea\loch\f39 :
+\par \hich\af39\dbch\af31505\loch\f39 allow *
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 icqpr, \'f2\'ee\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed
+\'f2\'e0\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'f1\'ef\'e5\loch\af39\dbch\af31505\hich\f39 \'f6\'e8\'f4\'e8\'f7\'e5\'f1\'ea\'ee\'e9\loch\f39 \hich\f39 . \'cd\'e5\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'f1\'f2\'e0
+\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e3\'e0\'eb\'ee\'f7\'ea\'f3\loch\f39 \hich\f39 \'ab\'c8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\'bb\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'e2\'ee\'f2
+\loch\f39 \hich\f39 \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'eb\'e0\'e3\'e0\'fe\'f9\'e5\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'f3\'ec\'ee\'eb\'f7\'e0\'ed\'e8\'fe\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0
+\loch\f39 \hich\f39 login.icq.com \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e2\'ed\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 IP \'ed\'e0\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0
+\'e0.\'ce\'f1\'f2\'e0\'eb\'ee\'f1\'fc\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e8\'e2\'f8\'e8\'e9\'f1\'ff\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f7\'e8\'e9\loch\f39 \hich\f39 \'e2\'e0\'f0\'e8\'e0\'ed
+\'f2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 (\'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 6):
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 service
+\par \hich\af39\dbch\af31505\loch\f39 internal 192.16\hich\af39\dbch\af31505\loch\f39 8.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.100.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nscache 65536
+\par \hich\af39\dbch\af31505\loch\f39 monitor "c:\\3proxy\\bin\\3proxy.cfg"
+\par \hich\af39\dbch\af31505\loch\f39 monitor "c:\\3proxy\\IP_list.txt"
+\par \hich\af39\dbch\af31505\loch\f39 logformat "L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I %O %N/%R:%r"
+\par \hich\af39\dbch\af31505\loch\f39 log c:\\3proxy\\logs\\3proxy.log D
+\par \hich\af39\dbch\af31505\loch\f39 r\hich\af39\dbch\af31505\loch\f39 otate 30
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0\pararsid3764488 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+archiver }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \hich\af39\dbch\af31505\loch\f39 rar \loch\af39\dbch\af31505\hich\f39 \'93\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "c:\\Program Files\\WinRAR\\rar.exe}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \loch\af39\dbch\af31505\hich\f39 \'94\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "\hich\af39\dbch\af31505\loch\f39 a -df -inul %A %F
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 nobandlimin * * * 110
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 24000 * 192.168.0.2,192.168.0.3
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 48000 * 192.168.0.4
+\par \hich\af39\dbch\af31505\loch\f39 bandlimout 24000 *
+\par \hich\af39\dbch\af31505\loch\f39 counter "c:\\3proxy\\3proxy.3cf" D "C:\\3proxy\\traf\\traf"
+\par \hich\af39\dbch\af31505\loch\f39 nocountin * 192.168.0.4 * 110 *
+\par \hich\af39\dbch\af31505\loch\f39 countin "1/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c8\'e2\'e0\'ed\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 50 * 192.168.0.2 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin "2/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'e5\'f2\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 80 * 192.168.0.3 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin "3/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d1\'e8\'e4\'ee\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 30 * 192.168.0.4 * * *
+\par
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.200.4 * * * 1-5 09:00:00-18:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168\hich\af39\dbch\af31505\loch\f39 .0.3 * 80,443 * 1-7 00:00:00-23:59:59
+\par \hich\af39\dbch\af31505\loch\f39 proxy
+\par
+\par \hich\af39\dbch\af31505\loch\f39 # }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'ce\'d7\'d2\'c0}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 deny * 192.168.200.4 * 110 * 1-5 18:00:00-23:59:59,00:00:00-08:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3,192.168.0.4 * 25,110 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 2500 smtp.provider\hich\af39\dbch\af31505\loch\f39 .ru 25
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 2110 pop.mail.ru 110
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 3110 pop.yandex.ru 110
+\par \hich\af39\dbch\af31505\loch\f39 pop3p
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3 * 21,1080 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 ftppr
+\par \hich\af39\dbch\af31505\loch\f39 socks
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 allow *
+\par \hich\af39\dbch\af31505\loch\f39 icqpr
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.4 * 80 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 admin
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c7\'e4\'e5\'f1\'fc\loch\f39 \hich\f39 \'ec\'fb\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e0\'e5\'ec\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39
+\hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'eb\'ee\'e6\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'f3\loch\f39 \hich\f39 , \'e4\'eb\'ff
+\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 service. \'cd\'e0\'ef\'ee\'ec\'e8\'ed\'e0\'fe\loch\f39 \hich\f39 , \'f7\'f2
+\'ee\loch\f39 \hich\f39 \'f3\'f1\'f2\'e0\'ed\'ee\'e2\'ea\'e0\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 \'ef\'f0\'ee\'e8\'e7\'e2\'ee\'e4\'e8\'f2\'f1\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'ee\'e9\loch\f39 \hich\f39 \'e8
+\'e7\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'ed\'ee\'e9\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e8\loch\f39 \hich\f39 Windows \'eb\'e8\'e1\'ee\loch\f39 \hich\f39 \'eb\'fe\loch\af39\dbch\af31505\hich\f39 \'e1\'ee\'e3\'ee\loch\f39 \hich\f39 \'f4
+\'e0\'e9\'eb-\'ec\'e5\'ed\'e5\'e4\'e6\'e5\'f0\'e0\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 3proxy --install
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ee\'e1\'ff\'e7\'e0\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'ed\'fb\loch\f39 \hich\f39 \'e2\'e8\'f1\'e5\'f2\'fc\loch\f39
+\hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'e0\'ed\'e4\'e0\'f0\'f2\'ed\'fb\'f5\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'e0\'f5\loch\f39 \hich\f39 , \'eb\'fe\'e1\'f3\'fe\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'ed\'e8\'f5\loch\f39 \hich\f39
+\'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'f1\'ea\'ee\'ed\'f4\'e8\'e3\'f3\'f0\'e8\'f0\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'ee\'e9\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\loch\f39 \hich\f39 \'ee\'ef\'f6\'e8
+\'e5\'e9\loch\f39 \hich\f39 -p\'cd\'ce\'cc\'c5\'d0\loch\f39 \hich\f39 _\'cf\'ce\'d0\'d2\'c0\loch\f39 \hich\f39 , \'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 proxy -p8080
+\par \hich\af39\dbch\af31505\loch\f39 ftppr -p2121
+\par \hich\af39\dbch\af31505\loch\f39 admin -p8081
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d5\'ee\'f7\'f3\loch\f39 \hich\f39 \'ef\'f0\'ee\'ff\'f1\'ed\'e8\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0
+\'e0\'f5\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ee\'e4\'e8\'ed\loch\f39 \hich\f39 \'ec\'ee\'ec\'e5\'ed\'f2\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 \'ff\loch\f39 \hich\f39 \'f1\'e0\'ec
+\loch\f39 \hich\f39 \'ef\'ee\'ed\'ff\'eb\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'f0\'e0\'e7\'f3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\'ed\'e8\'ec\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'ea\'ee\'f2\'ee\'f0\'ee\'e3\'ee
+\loch\f39 \hich\f39 , \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 , \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'e2\'fb\'e7\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'e1\'eb\'e5\'ec\'fb\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f3
+\loch\f39 \hich\f39 \'e2\'e0\'f1\loch\f39 \hich\f39 . \'dd\'f2\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'e8\loch\f39 \hich\f39 auth strong. \'cf\'f0\'e5\'e4
+\'ef\'ee\'eb\'ee\'e6\'e8\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ed\'e0\'ec\loch\f39 \hich\f39 \'f5\'ee\'f7\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ea
+\loch\f39 \hich\f39 WEB-\'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'fe\loch\f39 \hich\f39 \'e1\'fb\'eb\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e5\'ed\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'f1
+\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\loch\f39 192.168.0\hich\af39\dbch\af31505\loch\f39 \hich\f39 .4, \'ef\'f0\'e8\'f7\'e5\'ec\loch\f39 \hich\f39 \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec
+\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e0\'f8\'e8\'e2\'e0\'eb\'f1\'ff\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39
+\'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'f3\'fe\'f9\'e0\'ff\loch\f39 \hich\f39 \'f1\'e5\'ea\'f6\'e8\'ff\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39
+\hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'e5\'f2\'fc\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth strong
+\par \hich\af39\dbch\af31505\loch\f39 allow Administrator 192.168.0.4 * 80 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 deny *
+\par \hich\af39\dbch\af31505\loch\f39 admin
+\par \loch\af39\dbch\af31505\hich\f39 \'c8\loch\f39 \hich\f39 \'f0\'e0\'e7\'f3\'ec\'e5\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'ef\'f0\'e5\'e6\'e4\'e5\loch\f39 \hich\f39 \'f7\'e5\'ec\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\'f1\'ff
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'e5\'e9\loch\f39 \hich\f39 strong, \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e7\'e0\'e2\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff
+\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 Administrator:
+\par
+\par \hich\af39\dbch\af31505\loch\f39 users Administrator:CL:password
+\par \loch\af39\dbch\af31505\hich\f39 \'d2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'ef\'ee\'ef\'fb\'f2\'ea\'e5\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0
+\'ed\'e8\'f6\'f3\loch\f39 \hich\f39 WEB-\'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\loch\f39 \hich\f39 \'d1\'e8\'e4\'ee\'f0\'ee\'e2\'e0
+\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e0\'f8\'e8\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'e8
+\'f5\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\loch\af39\dbch\af31505\hich\f39 \'ef\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'eb\'ed\'ee\'f1\'f2\'fc\'fe\loch\f39
+\hich\f39 \'e7\'e0\'ea\'f0\'fb\'f2\loch\f39 \hich\f39 . \'ca\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 deny * \'e2\'f1\'e5\'e3\'e4\'e0\loch\f39 \hich\f39 \'ef\'f0\'e8\'f1\'f3\'f2\'f1\'f2\'e2\'f3\'e5\'f2\loch\f39 \hich\f39 \'ed\'e5\'ff\'e2\'ed\'ee
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f6\'e5\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e3\'ee\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'e0\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 , \'e8\loch\f39 \hich\f39
+\'e5\'e5\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'fb\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39
+\'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e5\'e5\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39
+\'e7\'e0\'ef\'f0\'e0\'f8\'e8\'e2\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f1\loch\f39
+\hich\f39 \'eb\'fe\'e1\'ee\'e9\loch\f39 \hich\f39 \'ec\'e0\'f8\'e8\'ed\'fb\loch\f39 \hich\f39 , \'f5\'ee\'f2\'ff\loch\f39 \hich\f39 \'ef\'f3\'f1\'f2\'ff\'f2\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'f0\'e0\'e2\'ed\'ee\loch\f39 \hich\f39
+\'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e0\loch\af39\dbch\af31505\hich\f39 \'e4\loch\af39\dbch\af31505\hich\f39 \'f0\'e5\'f1\'e0\loch\f39 \hich\f39 192.168.0.4. \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e6\'e5\loch\f39
+\hich\f39 \'f2\'f0\'e5\'f2\'fc\'ff\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'e5\'e4\'e5\'ed\'ed\'ee\'e9\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\loch\f39 \hich\f39 \'f1\'e5\'ea\'f6\'e8
+\'e8\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'e5\'f2\'fc\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 allow Administrator * * 80 * 1-5 00:00:00-20:00:00
+\par \loch\af39\dbch\af31505\hich\f39 \'f2\'ee\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e8\'f0\'ee\'e2\'e0\'ed\'e8\'fe\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39
+\hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e3\'ee\loch\f39 \hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\loch\f39 \hich\f39 \'ef\'f0\'e8
+\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'fa\'ff\'e2\'eb\'e5\'ed\'e8\'e8\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'ff\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\loch\af39\dbch\af31505\hich\f39 \'f2\'e5\'eb\'ff
+\loch\f39 Administrator.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'e0\'e6\'e4\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39
+\hich\f39 , \'ef\'ee\loch\f39 \hich\f39 \'e2\'f1\'e5\'e9\loch\f39 \hich\f39 \'e2\'e8\'e4\'e8\'ec\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 , \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'e5\'f1\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f2\'f0
+\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 , \'e8\'e7\'f0\'e0\'f1\'f5\'ee\'e4\'ee\'e2\'e0\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'e8\'ec\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f2\'e5\'ea\'f3\'f9\'e8\'e9\loch\f39 \hich\f39 \'ec\'ee\'ec\'e5\'ed\'f2
+\loch\f39 \hich\f39 . \'c4\'eb\'ff\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'f2\'e0\'ea
+\'f3\'fe\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 , \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e2\'f1\'e5\'e3\'ee\loch\f39 \hich\f39 \'eb\'e8\'f8\'fc\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'e5\'ec
+\'f3\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0\'ed\'e8\'f6\'f3\loch\f39 \hich\f39 WEB-\'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e8\'f0\'ee\loch\af39\dbch\af31505\hich\f39 \'e2\'e0\'ed\'e8
+\'ff\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'ed\'fb\'ec\'e8\loch\f39 \hich\f39 \'ef\'f0\'e0\'e2\'e0\'ec\'e8\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ee\'ed
+\loch\f39 \hich\f39 \'ec\'ee\'e3\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ef\'ee\'f1\'ec\'ee\'f2\'f0\'e5\'f2\'fc\loch\f39 \hich\f39 \'f2\'e5\'ea\'f3\'f9\'e8\'e5\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e5\'ed\'e8\'ff\loch\f39
+\hich\f39 \'f1\'e2\'ee\'e5\'e3\'ee\loch\f39 \hich\f39 (\'e8\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'f1\'e2\'ee\'e5\'e3\'ee\loch\f39 \hich\f39 !) \'e8\'e7\'f0\'e0\'f1\'f5\'ee\'e4\'ee\'e2\'e0\'ed\'ed\'ee\'e3\'ee\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'ec\'e0\'ea\'f1\'e8\'ec\'e0\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e4\'ee\'ef\'f3\'f1\'f2\'e8\'ec\'ee\'e3\'ee\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 . \'c4\'eb\'ff\loch\f39 \hich\f39 \'fd
+\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'f3\loch\f39 \hich\f39 admin \'e4\'eb\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39
+ \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'f0\'e0\'e7\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'ee\'ec\loch\f39 \hich\f39 \'ef\'ee
+\'f0\'f2\'f3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f1\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ea\loch\af39\dbch\af31505\hich\f39 \'eb\'fe\'f7\'ee\'ec\loch\f39 \hich\f39 -s (\'f1\'ee\'ea\'f0\'e0\'f9\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ee
+\'f2\loch\f39 \hich\f39 \'f1\'eb\'ee\'e2\'e0\loch\f39 \hich\f39 security), \'e4\'eb\'ff\loch\f39 \hich\f39 \'f7\'e5\'e3\'ee\loch\f39 \hich\f39 \'e4\'ee\'ef\'e8\'f1\'fb\'e2\'e0\'e5\'ec\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8
+\'e3\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'f7\'ea\'e8\loch\f39 :
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow *
+\par \hich\af39\dbch\af31505\loch\f39 admin -p8081 -s
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ea\'e0\'e6\'e4\'fb\'e9\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\loch\f39
+\hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'ee\'f2\'ea\'f0\'fb\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\'e5\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0\'ed\'e8\'f6\'f3\loch\f39 \hich\f39
+ http://192.168.0.1:8081/C \'e8\loch\f39 \hich\f39 \'f3\'e2\'e8\'e4\'e5\'f2\'fc\loch\f39 \hich\f39 \'f2\'e0\'ec\loch\f39 \hich\f39 \'f1\'e2\'ee\'fe\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'e8\'f1\'f2\'e8\'ea\'f3\loch\f39 \hich\f39 . \'c0\loch\f39
+\hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fc\hich\af39\dbch\af31505\loch\f39 \hich\f39 Administrator \'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0\'ed\'e8\'f6\'e5\loch\f39 \hich\f39 http://192.168.0.1:8080/C \'ec\'ee\'e6\'e5\'f2\loch\f39
+\hich\f39 \'ef\'ee\'f1\'ec\'ee\'f2\'f0\'e5\'f2\'fc\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'e8\'f1\'f2\'e8\'ea\'f3\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 . \'cf\'f0\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec
+\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'ee\'ef\'f0\'e5\'e4\'e5\'eb\'e5\'ed\'ed\'e0\'ff\loch\f39 \hich\f39 \'f5\'e8\'f2\'f0\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 : \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2
+\'e5\'eb\'fc\loch\f39 \hich\f39 \'ee\'ef\'f0\'e5\'e4\'e5\'eb\'ff\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 IP-\'e0\'e4\'f0\'e5\'f1\'f3\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5
+\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 , \'f2\'ee\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ee\'ed\loch\f39 \hich\f39 \'e2\'e8\'e4
+\'e5\'eb\loch\f39 \hich\f39 \'e4\'e5\'e9\'f1\'f2\'e2\'e8\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'f1\'e2\'ee\'fe\loch\f39 \hich\f39 \'f1\'f2\'e0\'f2\'e8\'f1\'f2\'e8\'ea\'f3\loch\f39 \hich\f39 , \'ed\'e5\'ee\loch\af39\dbch\af31505\hich\f39 \'e1
+\loch\af39\dbch\af31505\hich\f39 \'f5\'ee\'e4\'e8\'ec\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'e1\'f0\'e0\'f3\'e7\'e5\'f0\'e0\loch\f39
+\hich\f39 (\'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 Internet Explorer) \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 http://192.168.0.1 \'ef\'f0\'ee\'e8\'f1\'f5\'ee\'e4\'e8\'eb\loch\f39 \hich\f39 \'e1\'e5\'e7
+\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 . \'c8\'ed\'e0\'f7\'e5\loch\f39 \hich\f39 \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\'e0\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'e0
+\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'e0\loch\f39 \hich\f39 admin \'f3\'e2\'e8\'e4\'e8\'f2\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\loch\f39 \hich\f39 \'f1\'e0\'ec\'ee\'e3\'ee\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 ,
+\'f2.\'ea\loch\f39 \hich\f39 . \'ea\'eb\'e8\'e5\'ed\'f2\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'f2\'e8\'f2\'f1\'ff\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'ed\'e5\'e9\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1
+\'e8\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ee\'f2\'f0\'e0\'e1\'ee\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'ed\'e5\'ef\'f0\'e0\'e2\'e8\loch\af39\dbch\af31505\hich\f39 \'eb\loch\af39\dbch\af31505\hich\f39 \'fc\'ed\'ee\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c8\'e7\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'e5\'e4\'e5\'ed\'ed\'fb\'f5\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'ee\'e2\loch\f39 \hich\f39 \'f1\'f2\'e0\'ed\'ee\'e2\'e8\'f2\'f1\'ff\loch\f39 \hich\f39 \'ff\'f1\'ed
+\'ee\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'ff\loch\f39 \hich\f39 strong \'ef\'f0\'e5\'e4\'ef\'ee\'eb\'e0\'e3\'e0\'e5\'f2\loch\f39 \hich\f39 \'ef\'f0\'ee\'e2\'e5\'f0\'ea\'f3\loch\f39 \hich\f39
+\'ef\'ee\loch\f39 \hich\f39 \'ed\'e0\'e8\'e1\'ee\'eb\'e5\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'ed\'ee\'ec\'f3\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'f3\loch\f39 \hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'ee\'e2\loch\f39 \hich\f39 : IP \'f0\'e0\'e1
+\'ee\'f7\'e5\'e9\loch\f39 \hich\f39 \'f1\'f2\'e0\'ed\'f6\'e8\'e8\loch\f39 \hich\f39 , \'e8\'ec\'ff\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'e0\'f0\'ee\'eb\'fc\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39
+\hich\f39 , \'f1\'ef\'e8\'f1\'ee\'ea\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'ed\'fb\'f5\loch\f39 \hich\f39 \'f5\'ee\'f1\'f2\'ee\'e2\loch\f39 \hich\f39 , \'ef\'ee\'f0\'f2\'ee\'e2\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f2.\'e4
+\loch\f39 \hich\f39 ., \'e2\loch\f39 \hich\f39 \'ee\'f2\'eb\'e8\'f7\'e8\'e5\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'e8\loch\f39 \hich\f39 iponly, \'ea\'ee\loch\af39\dbch\af31505\hich\f39 \'e3\'e4\'e0
+\loch\f39 \hich\f39 \'e8\'ec\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'e2\'e5\'f0\'ff\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 - \'ed\'ee\loch\f39 \hich\f39 \'e7
+\'e2\'e5\'e7\'e4\'ee\'f7\'ea\'f3\loch\f39 \hich\f39 \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'e8\'ec\'e5\'ed\'e8\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed
+\'e4\'e5\loch\f39 \hich\f39 allow \'ec\'fb\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'e2\'fb\'ed\'f3\'e6\'e4\'e5\'ed\'fb\loch\f39 \hich\f39 \'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39
+\hich\f39 \'f1\'ee\'e2\'ec\'e5\'f1\'f2\'e8\'ec\'ee\'f1\'f2\'e8\loch\f39 !
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c0\loch\f39 \hich\f39 \'f2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'ef\'ee\'eb\'ee\'e6\'e8\'ec\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ed\'e0\'ec\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'ee
+\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'f0\'ff\'e4\'f3\loch\f39 \hich\f39 \'ef\'f0\'e8\'f7\'e8\'ed\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e5\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ed\'e0\loch\f39
+\hich\f39 \'ed\'e5\'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'fb\loch\f39 \hich\f39 , \'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'ee\'e1\'f9\'e5\'e8\'e7\'e2\'e5\'f1\'f2\'ed\'fb\'e9\loch\f39 ww
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 w.anekdot.ru. \'c4\'eb\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'ec\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 nsrecord:
+\par
+\par \hich\af39\dbch\af31505\loch\f39 nsrecord www.anekdot.ru 127.0.0.3
+\par \loch\af39\dbch\af31505\hich\f39 \'f2\'e5\'ec\loch\f39 \hich\f39 \'f1\'e0\'ec\'fb\'ec\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'ed\'e0\'ef\'f0\'e0\'e2\'eb\'ff\'e5\'ec\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'e5\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'fb
+\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'e0\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e0\'ed\'e5\'ea\'e4\'ee\'f2\'e0\'ec\'e8\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'eb\'ee\'ea\'e0\'eb\'fc\'ed\'fb\'e9\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1
+\loch\f39 \hich\f39 . \'cc\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'fd\'f2\'f3\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e1\'ee\'eb\'e5
+\'e5\loch\f39 \hich\f39 \'e8\'e7\'ee\'f9\'f0\'e5\'ed\'ed\'ee\'ec\loch\f39 \hich\f39 \'e2\'e0\'f0\'e8\'e0\'ed\'f2\'e5\loch\f39 \hich\f39 , \'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 ,
+\par
+\par \hich\af39\dbch\af31505\loch\f39 nsrecord www.ane\hich\af39\dbch\af31505\loch\f39 kdot.ru 87.250.251.11
+\par \loch\af39\dbch\af31505\hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'e0\loch\f39 \hich\f39 www.anekdot.ru \'ef\'e5\'f0\'e5\'ed\'e0\'ef\'f0\'e0\'e2\'eb\'ff\'f2\'fc\loch\f39 \hich\f39
+\'ed\'e0\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\loch\f39 \hich\f39 www.yandex.ru. \'c2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'ff\'ed\'e4\'e5\'ea\'f1\'e0\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39 \hich\f39
+\'e1\'fb\loch\f39 \hich\f39 \'f1\'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'ed\'e0\'ef\'f0\'e0\'e2\'eb\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'ed\'e0\loch\f39
+\hich\f39 \'ea\'ee\'f0\'ef\'ee\'f0\'e0\'f2\'e8\'e2\'ed\'fb\'e9\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'ef\'f0\'ee\'f7\'e5\'ec\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e8\loch\f39 \hich\f39 0.6 \'ef\'ee\'ff\'e2\'e8\'eb\'e0\'f1\'fc\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2
+\'fc\loch\f39 \hich\f39 \'e1\'ee\'eb\'e5\'e5\loch\f39 \hich\f39 \'f3\'e4\'ee\'e1\'ed\'ee\loch\f39 \hich\f39 \'f3\'ef\'f0\'e0\'e2\'eb\'ff\'f2\'fc\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'ee\loch\af39\dbch\af31505\hich\f39 \'ec\loch\f39 \hich\f39 \'e4
+\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'fb\loch\f39 \hich\f39 . \'c4\'eb\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc
+\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'f5\'ee\'f0\'ee\'f8\'ee\loch\f39 \hich\f39 \'e7\'ed\'e0\'ea\'ee\'ec\'f3\'fe\loch\f39 \hich\f39 \'ed\'e0\'ec\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39
+\hich\f39 deny \'f1\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'f8\'e0\'e1\'eb\'ee\'ed\'ee\'e2\loch\f39 \hich\f39 , \'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 deny * * www.anekdot.ru *
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'e1\'e5\'e7\'f3\'f1\'eb\'ee\'e2\'ed\'ee\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e5\'f9\'e0\'e5\'f2\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2
+\loch\f39 }{\field{\*\fldinst {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 HYPERLINK "http://www.anekdot.ru/"}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid3764488
+{\*\datafield 00d0c9ea79f9bace118c8200aa004ba90b0200000003000000e0c9ea79f9bace118c8200aa004ba90b4600000068007400740070003a002f002f007700770077002e0061006e0065006b0064006f0074002e00720075002f000000795881f43b1d7f48af2c825dc485276300000000a5ab0000}}
+}{\fldrslt {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\ul\cf9\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 www.anekdot.ru}}}\sectd \ltrsect\linex0\sectdefaultcl\sftnbj {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\kerning1\insrsid11355186
+\par
+\par \hich\af39\dbch\af31505\loch\f39 deny * * anekdot* *
+\par
+\par }\pard \ltrpar\ql \fi-360\li360\ri0\nowidctlpar\tx360\wrapdefault\hyphpar0\faauto\rin0\lin360\itap0 {\rtlch\fcs1 \af1\afs18 \ltrch\fcs0 \f1\fs18\kerning1\insrsid11355186\charrsid3764488 -\tab }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e7\'e0\'ef\'f0\'e5\'f9\'e0\'e5\'f2\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'fb
+\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'ed\'e0\'e7\'e2\'e0\'ed\'e8\'e8\loch\f39 \hich\f39 \'ea\'ee\'f2\'ee\'f0\'fb\'f5\loch\f39 \hich\f39 \'e2\'f1\'f2\'f0\'e5\'f7\'e0\'e5\'f2\'f1\'ff\loch\f39 anekdot.
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'ef\'f0\'ee\'f7\'e5\'ec\loch\f39 \hich\f39 , \'ef\'f0\'ee\'e4\'e2\'e8\'ed\'f3\'f2\'fb\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e8\loch\f39 \hich\f39 \'ec\'ee\'e3\'f3\'f2\loch\f39
+\hich\f39 \'ee\'e1\'ee\'e9\'f2\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'f2\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e5\'f2\loch\f39 \hich\f39 , \'ee\'e1\'f0\'e0\'f9\'e0\'ff\'f1\'fc\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'f3\loch\f39
+\hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'e5\'e3\'ee\loch\f39 \hich\f39 IP \'e8\'eb\'e8\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'ff\loch\f39 \hich\f39 \'e0\'ed\'ee\'ed\'e8\'ec\'ed\'fb\'e5\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'fb.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d3\loch\f39 \hich\f39 \'f1\'e5\'e1\'ff\loch\f39 \hich\f39 \'ff\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'fe\loch\f39 \hich\f39 \'f6\'e5\'eb\'fb\'e9\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ee\'ea\loch\f39
+\hich\f39 \'f8\'e0\'e1\'eb\'ee\'ed\'ee\'e2,\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 , \'ea\'ee\'ec\'f3-\'f2\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\'e3\'ee\'e4\'e8\'f2\'f1\'ff\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39
+deny * * *sex*,*porn*,*adult*,*xxx*,*gamepark*,*vagina*,*mpp3*,*seks*,*virgin*,*pipisk*,*pastushka*,*1xuk.ru*,*teens*,*zaycev*,*lubovmorkov*,*mp3*,*bannerbank*,*yadro*,*dosug.nu*,*lesbo*,*lesbian*,*eroti*,*viporg.ru*,*intim*
+\hich\af39\dbch\af31505\loch\f39
+,*erohost*,*eross*,*teenfant*,*nudist*,*pimpserver*,*banner*,*ads.sup.com*,*rb.mail.ru*,*counter.rambler.ru*,*carol.ru*,*video.mail.ru*,*pelotka*,*akadostream*,*media.kino-govno.com*,*odnoklassniki.ru*,*vkontakte.ru*,*zhuki.mail.ru*,*fishki.net*,*dofiga.n
+\hich\af39\dbch\af31505\loch\f39 e\hich\af39\dbch\af31505\loch\f39 t*
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d7\'f2\'ee\'e1\'fb\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e7\'e0\'e3\'f0\'ee\'ec\'ee\'e6\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e4\'eb\'e8\'ed\'ed\'fb\'ec\'e8
+\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'e0\'ec\'e8\loch\f39 \hich\f39 , \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 \hich\f39 include \'e8
+\loch\f39 \hich\f39 \'ec\'e0\'ea\'f0\'ee\'f1\loch\f39 \hich\f39 $. \'cd\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'ef\'f0\'e5\'e4\'fb\'e4\'f3\'f9\'e0\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 \'ec\'ee\'e3\'eb\'e0
+\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'e5\'f2\'fc\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 :
+\par \hich\af39\dbch\af31505\loch\f39 deny * * $c:\\3proxy\\ban.txt
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'e3\'e4\'e5\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 ban.txt \hich\f39 \emdash \loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'f2\'e5\'ea\'f1\'f2\'ee\'e2\'fb\'e9\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb
+\loch\f39 \hich\f39 , \'f1\'ee\'e4\'e5\'f0\'e6\'e0\'f9\'e8\'e9\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ee\'ea\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e5\'f2\'ed\'fb\'f5\loch\f39 \hich\f39 \'f0\'e5\'f1\'f3\'f0\'f1\'ee\'e2\hich\af39\dbch\af31505\loch\f39
+\hich\f39 (\'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'e7\'e0\'ef\'ff\'f2\'f3\'fe\loch\f39 \hich\f39 , \'e1\'e5\'e7\loch\f39 \hich\f39 \'ef\'f0\'ee\'e1\'e5\'eb\'ee\'e2\loch\f39 )
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'eb\'e8\'e1\'ee}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'f2\'e0\'ea}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 include c\\3proxy\\ban\-include.txt
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e3\'e4\'e5\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 ban_include.txt \'f1\'ee\'e4\'e5\'f0\'e6\'e0\'eb\loch\f39 \hich\f39 \'e1\'fb
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'e5\'e1\'e5\loch\f39 \hich\f39 \'e2\'f1\'fe\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'f3\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'e5
+\'f2\'e0\'ec\'e8.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c6\'e5\'eb\'e0\'fe\'f9\'e8\'e5\loch\f39 \hich\f39 \'ec\'ee\'e3\'f3\'f2\loch\f39 \hich\f39 \'ed\'e0\'e9\'f2\'e8\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'e8\loch\f39 \hich\f39 \'e1\'e0\'ed-\'eb\'e8\'f1\'f2\'ee\'e2
+\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'e0\'e4\'e0\'ef\'f2\'e8\'f0\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\'f3
+\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 3proxy, \'e1\'eb\'e0\'e3\'ee\loch\f39 \hich\f39 \'f7\'f2\'ee\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'e9\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'f0\'e0\'e7\'ec\'e5\'f0\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 \'ed\'e5\'f2\loch\f39 \hich\f39 . \'d2\'e0\'ea\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'ed\'e5
+\'f2\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'e9\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'fb\loch\f39 \hich\f39 , \'e2\'ea\'eb\'fe\'f7\'e5\'ed\'ed\'fb\'e5\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39
+\hich\f39 include. \'cd\'e0\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'fb\loch\f39 \hich\f39 , \'e2\'ea\'eb\'fe\'f7\'e5\'ed\'ed\'fb\'e5\loch\f39 \hich\f39 \'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'ec\'e0\'ea\'f0\'ee\'f1\loch\f39 \hich\f39 $, \'f1\'f3\'f9
+\'e5\'f1\'f2\'e2\'f3\'e5\'f2\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 64 \'ea\'e8\'eb\'ee\'e1\'e0\'e9\'f2\'e0.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'eb\'ff\loch\f39 \hich\f39 \'f3\'e4\'ee\'e1\'f1\'f2\'e2\'e0\loch\f39 \hich\f39 \'e4\'e0\'eb\'fc\'ed\'e5\'e9\'f8\'e5\'e3\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'ea
+\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'f0\'e0\'e7\'e1\'e8\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\'f7\'e5\'f1\'ea\'e8\'e5\loch\f39 \hich\f39 \'f0\'e0\'e7\'e4\'e5\'eb\'fb
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\'ef\'ee\'eb\'ed\'e8\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ec\'ec\'e5\'ed\'f2\'e0\'f0\'e8\'ff\'ec\'e8\loch\f39 \hich\f39 . \'df\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39
+\hich\f39 \'e4\'e5\'eb\'e0\'fe\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ef\'ee\'ec\'ee\'f9\'fc\loch\f39 \hich\f39 \'f1\'e8\'ec\'e2\'ee\'eb\'e0\loch\f39 \hich\f39 #. \'cd\'e0\'ef\'ee\'ec\'ed\'fe\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39
+\hich\f39 \'eb\'fe\'e1\'e0\'ff\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e0\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 , \'ed\'e0\'f7\'e8\'ed\'e0\'fe\'f9\'e0\'ff\'f1\'ff\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'ef\'f0\'ee
+\'e1\'e5\'eb\'e0\loch\f39 \hich\f39 \'e8\'eb\'e8\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f1\'e8\'ec\'e2\'ee\'eb\'e0\loch\f39 \hich\f39 #, \'e2\'ee\'f1\'ef\'f0\'e8\'ed\'e8\'ec\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'ee
+\'ec\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'ea\'ee\'ec\'ec\'e5\'ed\'f2\'e0\'f0\'e8\'e9\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ee\'ea\'ee\'ed\'f7
+\'e0\'f2\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 "\'e2\'fb\'eb\'e8\'e7\'e0\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 " \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'e5\'f2\'fc\loch\f39 \hich\f39
+\'f2\'e0\'ea\loch\f39 \hich\f39 (\'e2\'e5\'f0\'f1\'e8\'ff\loch\f39 7):\hich\af39\dbch\af31505\loch\f39
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \hich\af39\dbch\af31505\loch\f39 # }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ce\'c1\'d9\'c8\'c5}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'c0\'d0\'c0\'cc\'c5\'d2\'d0
+\'db}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par
+\par \hich\af39\dbch\af31505\loch\f39 service
+\par \hich\af39\dbch\af31505\loch\f39 internal 192.168.0.1
+\par \hich\af39\dbch\af31505\loch\f39 external 211.80.11.12
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.100.1
+\par \hich\af39\dbch\af31505\loch\f39 nserver 213.153.101.1
+\par \hich\af39\dbch\af31505\loch\f39 nscache 655\hich\af39\dbch\af31505\loch\f39 36
+\par \hich\af39\dbch\af31505\loch\f39 deny * * anekdot* *monitor "c:\\3proxy\\bin\\3proxy.cfg"
+\par \hich\af39\dbch\af31505\loch\f39 monitor "c:\\3proxy\\IP_list.txt"
+\par \hich\af39\dbch\af31505\loch\f39 logformat "L%C - %U [%d/%o/%Y:%H:%M:%S %z] ""%T"" %E %I %O %N/%R:%r"
+\par \hich\af39\dbch\af31505\loch\f39 log c:\\3proxy\\logs\\3proxy.log D
+\par \hich\af39\dbch\af31505\loch\f39 rotate 30
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0\pararsid3764488 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39
+archiver }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \hich\af39\dbch\af31505\loch\f39 rar \loch\af39\dbch\af31505\hich\f39 \'93\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "c:\\Program Files\\WinRAR\\rar.exe}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488 \loch\af39\dbch\af31505\hich\f39 \'94\loch\af39\dbch\af31505\hich\f39 \'94}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid3764488\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 "\hich\af39\dbch\af31505\loch\f39 a -df -inul %A %F
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 # \'c7\'c0\'c4\'c0\'c5\'cc\loch\f39 \hich\f39 \'cf\'ce\'cb\'dc\'c7\'ce\'c2\'c0\'d2\'c5\'cb\'c5\'c9\loch\f39 \hich\f39 , \'ce\'c3\'d0\'c0\'cd\'c8\'d7\'c5\'cd\'c8\'df\loch\f39 \hich\f39 \'d1\'ca\'ce\'d0\'ce\'d1
+\'d2\'c8\loch\f39 \hich\f39 \'c8\loch\f39 \hich\f39 \'d1\'d7\'c5\'d2\'d7\'c8\'ca\'c8
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par
+\par \hich\af39\dbch\af31505\loch\f39 users Administrator:CL:password
+\par \hich\af39\dbch\af31505\loch\f39 nobandlimin * * * 110
+\par \hich\af39\dbch\af31505\loch\f39 bandli\hich\af39\dbch\af31505\loch\f39 min 24000 * 192.168.0.2,192.168.0.3
+\par \hich\af39\dbch\af31505\loch\f39 bandlimin 48000 * 192.168.0.4
+\par \hich\af39\dbch\af31505\loch\f39 bandlimout 24000 *
+\par \hich\af39\dbch\af31505\loch\f39 counter "c:\\3proxy\\3proxy.3cf" D "C:\\3proxy\\traf\\traf"
+\par \hich\af39\dbch\af31505\loch\f39 nocountin * 192.168.0.4 * 110 *
+\par \hich\af39\dbch\af31505\loch\f39 countin "1/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c8\'e2\'e0\'ed\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 50 * 192.168.0.2 * * *
+\par \hich\af39\dbch\af31505\loch\f39 countin "2/}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'e5\'f2\'f0\'ee\'e2}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 " M 80 * 192.168.0.3 * * *
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 countin "3/\'d1\'e8\'e4\'ee\'f0\'ee\'e2\loch\f39 " M 30 * 192.168.0.4 * * *
+\par
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 # \'d0\'c0\'c7\'c4\'c0\'c5\'cc\loch\f39 WEB
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 deny * * *sex*,*porn*,*adul\hich\af39\dbch\af31505\loch\f39
+t*,*xxx*,*gamepark*,*vagina*,*mpp3*,*seks*,*virgin*,*pipisk*,*pastushka*,*1xuk.ru*,*teens*,*zaycev*,*lubovmorkov*,*mp3*,*bannerbank*,*yadro*,*dosug.nu*,*lesbo*,*lesbian*,*eroti*,*viporg.ru*,*intim*,*erohost*,*eross*,*teenfant*,*nudist*,*pimpserver*,*banne
+\hich\af39\dbch\af31505\loch\f39 r\hich\af39\dbch\af31505\loch\f39
+*,*ads.sup.com*,*rb.mail.ru*,*counter.rambler.ru*,*carol.ru*,*video.mail.ru*,*pelotka*,*akadostream*,*media.kino-govno.com*,*odnoklassniki.ru*,*vkontakte.ru*,*zhuki.mail.ru*,*fishki.net*,*dofiga.net*
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.4 * * * 1-5 09:00:00-18:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow *\hich\af39\dbch\af31505\loch\f39 192.168.0.2,192.168.0.3 * 80,443 * 1-7 00:00:00-23:59:59
+\par \hich\af39\dbch\af31505\loch\f39 proxy \hich\f39 \endash \loch\f39 a -t
+\par
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \hich\af39\dbch\af31505\loch\f39 # }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d0\'c0\'c7\'c4\'c0\'c5\'cc}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'ce\'d7\'d2\'d3}{
+\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 deny * 192.168.200.4 *\hich\af39\dbch\af31505\loch\f39 110 * 1-5 18:00:00-23:59:59,00:00:00-08:00:00
+\par \hich\af39\dbch\af31505\loch\f39 allow * $"c:\\3proxy\\IP_list.txt" * 3110,25,110 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 25 smtp.provider.ru 25
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 2110 pop.mail.ru 110
+\par \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 3110 pop.yandex.ru 110
+\par
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \hich\af39\dbch\af31505\loch\f39 # }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d0\'c0\'c7\'c4\'c0\'c5\'cc}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 FTP }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c8}{\rtlch\fcs1
+\af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c0\'d1
+\'dc\'ca\'d3}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow * 192.168.0.2,192.168.0.3 * 2110,25,110 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 ftppr
+\par \hich\af39\dbch\af31505\loch\f39 socks
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flu\hich\af39\dbch\af31505\loch\f39 sh
+\par \hich\af39\dbch\af31505\loch\f39 allow *
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 icqpr
+\par
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 # \'c0\'c4\'cc\'c8\'cd\'c8\'d1\'d2\'d0\'c0\'d2\'c8\'c2\'cd\'db\'c9\loch\f39 \hich\f39 \'c4\'ce\'d1\'d2\'d3\'cf
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth strong
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 allow Administrator 192.168.0.4 * 80 * 1-5 00:00:00-20:00:00
+\par \hich\af39\dbch\af31505\loch\f39 admi\hich\af39\dbch\af31505\loch\f39 n
+\par
+\par \hich\af39\dbch\af31505\loch\f39 flush
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow *
+\par \hich\af39\dbch\af31505\loch\f39 admin -p8081 -s
+\par \hich\af39\dbch\af31505\loch\f39 dnspr
+\par
+\par \hich\af39\dbch\af31505\loch\f39 end
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 # \'ca\'ce\'cd\'c5\'d6\loch\f39 \hich\f39 \'ca\'ce\'cd\'d4\'c8\'c3\'c0
+\par \hich\af39\dbch\af31505\loch\f39 ###############################################################
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'ee\'e3\'eb\'e0\'f1\'e8\'f2\'e5\'f1\'fc\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'ed\'e0\'ec\'ed\'ee\'e3\'ee\loch\f39
+\hich\f39 \'e8\'ed\'f4\'ee\'f0\'ec\'e0\'f2\'e8\'e2\'ed\'e5\'e5\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'eb\'e5\'e3\loch\af39\dbch\af31505\hich\f39 \'f7\'e5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e2\'ee\'f1\'ef\'f0\'e8\'ff\'f2\'e8\'e8
+\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'eb\'fe\'f7\loch\f39 \hich\f39 -\'e0\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'ef\'ee\'e7\'e2\'ee\'eb\'ff\'e5
+\'f2\loch\f39 \hich\f39 \'f1\'ea\'f0\'fb\'f2\'fc\loch\f39 \hich\f39 \'e2\'ed\'f3\'f2\'f0\'e5\'ed\'ed\'e8\'e9\loch\f39 \hich\f39 IP \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'f7\'e5\'ec\loch\f39
+\hich\f39 \'eb\'e5\'e3\'ea\'ee\loch\f39 \hich\f39 \'f3\'e1\'e5\'e4\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 \hich\f39 , \'e7\'e0\'e9\'e4\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 2ip.ru
+
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f6\'e5\loch\f39 \hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'eb\'e8\loch\f39 \hich\f39 \'ed\'e5\'ee\'e1\'ff\'e7\'e0\'f2\'e5\'eb\'fc\'ed\'f3\'fe\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed
+\'e4\'f3\loch\f39 \hich\f39 end. \'c2\'f1\'e5\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ed\'e0\'f5\'ee\'e4\'e8\'f2\'f1\'ff\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'ed\'e5\'e5\loch\f39 \hich\f39 , \'f1\'e5\'f0\'e2\'e5
+\'f0\'ee\'ec\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e1\'e0\'f2\'fb\'e2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 . \'ca\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 en\hich\af39\dbch\af31505\loch\f39 \hich\f39 d - \'fd\'f2\'ee\loch\f39
+\hich\f39 \'f1\'e2\'ee\'e5\'e3\'ee\loch\f39 \hich\f39 \'f0\'ee\'e4\'e0\loch\f39 \hich\f39 \'e7\'ed\'e0\'ea\loch\f39 \hich\f39 \'e3\'eb\'ee\'e1\'e0\'eb\'fc\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 , \'e4\'ee\loch\f39 \hich\f39 \'ea\'ee\'ed\'f6\'e0\loch\f39
+\hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 , \'ea\'ee\'ec\'ec\'e5\'ed\'f2\'e0\'f0\'e8\'ff\loch\f39 \hich\f39 . \'c1\'fb\'e2\'e0\'e5\'f2\loch\f39 \hich\f39 \'e8\'ed\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'f3\'e4\'ee\'e1\'ed\'ee\loch\f39
+\hich\f39 \'ee\'f2\'ea\'eb\'fe\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'f3\'fe\loch\f39 \hich\f39 \'f7\'e0\'f1\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 , \'ef\'f0\'ee\'f1\'f2\'ee\loch\f39 \hich\f39
+\'ef\'ee\'f1\'f2\'e0\'e2\'e8\'e2\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'e4\loch\f39 \hich\f39 \'ed\'e5\'e9\loch\f39 \hich\f39 \'fd\'f2\'f3\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 .
+\par \loch\af39\dbch\af31505\hich\f39 \'ca\'f0\'ee\'ec\'e5\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'f2\'e8\'eb
+\'e8\loch\f39 \hich\f39 \'ea\'fd\'f8\'e8\'f0\'f3\'fe\'f9\'e8\'e9\loch\f39 \hich\f39 dns \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 dnspr, \'f2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'ed\'e0\loch\f39
+\hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'f1\'ea\'e8\'f5\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ea\'ee\'ec\'ef\'fc\'fe\'f2\'e5\'f0\'e0\'f5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e9\'ea\'e0\'f5\loch\f39 \hich\f39 \'f1\'e5
+\'f2\'e8\loch\f39 \hich\f39 \'ed\'e0\'e7\'ed\'e0\'f7\'e8\'f2\'fc\loch\f39 \hich\f39 IP \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 DNS \'f1\'e5\'f0\'e2\'e5\'f0\loch\f39
+.
+\par \loch\af39\dbch\af31505\hich\f39 \'d0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e8\'ec\loch\f39 \hich\f39 \'f2\'e5\'ef\'e5\'f0\'fc\loch\f39 \hich\f39 \'ed\'e5\'f0\'e5\'e4\'ea\'e8\'e9\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e9\loch\f39 \hich\f39 , \'ea\'ee\'e3\'e4
+\'e0\loch\f39 \hich\f39 \'ed\'f3\'e6\'ed\'ee\loch\f39 \hich\f39 \'f0\'e0\'e7\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed\'e5\'f2\loch\f39 \hich\f39 , \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'ef\'f0\'ee\'e2\'e0\'e9
+\'e4\'e5\'f0\'e0\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\loch\f39 \hich\f39 , \'f2.\'e5\loch\f39 \hich\f39 . \'f1\'eb\'f3\'f7\'e0\'e9\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\'f1\'f2\'ee\'ff\'f9\'e5\'e3\'ee
+\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 . \'ca\'f0\'ee\'ec\'e5\loch\f39 \hich\f39 \'f2\'ee\'e3\'ee\loch\f39 \hich\f39 , \'fd\'f2\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'ef\'f0\'e8\'e3\'ee\'e4\'e8\'f2
+\'fc\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\loch\af39\dbch\af31505\hich\f39 \'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39
+\'f7\'e5\'f0\'e5\'e7\loch\f39 \hich\f39 \'f3\'f1\'ea\'ee\'f0\'e8\'f2\'e5\'eb\'fc\loch\f39 \hich\f39 \'f1\'ef\'f3\'f2\'ed\'e8\'ea\'e0\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39 \hich\f39 \'fd\'f2\'ee\loch\f39 \hich\f39 \'e1\'fb\'eb\'ee\loch\f39
+\hich\f39 \'f3\loch\f39 \hich\f39 \'ec\'e5\'ed\'ff\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1
+\'e2\'ff\'e7\'ea\'e0\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'ed\'e0\'ef\'f0\'e0\'e2\'eb\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 parent \'e8\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 allow. \'d0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e8\'ec
+\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'ea\'ee\'e3\'e4\'e0\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f9\'e5\'ed\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'eb\'ee\'ea\'e0\'eb\'fc
+\'ed\'ee\'ec\loch\f39 \hich\f39 \'f5\'ee\'f1\'f2\'e5\loch\f39 \hich\f39 127.0.0.1, \'ef\'ee\'f0\'f2\loch\f39 3128 \hich\f39 \emdash \loch\f39 \hich\f39 \'f2\'e8\'ef\'e8\'f7\'ed\'fb\'e9\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e9\loch\f39 \hich\f39
+\'e4\'eb\'ff\loch\f39 \hich\f39 \'f3\'f1\'ea\'ee\'f0\'e8\'f2\'e5\'eb\'ff\loch\f39 \hich\f39 \'f1\'ef\'f3\'f2\'ed\'e8\loch\af39\dbch\af31505\hich\f39 \'ea\loch\af39\dbch\af31505\hich\f39 \'ee\'e2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'ed
+\'e5\'f2\'e0\loch\f39 \hich\f39 . \'c2\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'e5\'e9\'f8\'e8\'e9\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e1
+\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e2\'fb\'e3\'eb\'ff\'e4\'e5\'f2\'fc\loch\f39 \hich\f39 \'f2\'e0\'ea\loch\f39 :
+\par
+\par \hich\af39\dbch\af31505\loch\f39 fakeresolve
+\par \hich\af39\dbch\af31505\loch\f39 auth iponly
+\par \hich\af39\dbch\af31505\loch\f39 allow *
+\par \hich\af39\dbch\af31505\loch\f39 parent 1000 http 127.0.0.1 3128
+\par \hich\af39\dbch\af31505\loch\f39 proxy -p8080
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c7\'e4\'e5\'f1\'fc\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 fakeresolve, \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'ec\'e0\'ff
+\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e8\'ec\'e5\'ed\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'eb\'f3\'f7\'e0\'e5\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'ed\'e0\'ef\'f0
+\'e0\'e2\'eb\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'ee\'e2\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\'f1\'f2\'ee\'ff\'f9\'e8\'e9\loch\f39 \hich\f39
+ \'ef\'f0\'ee\'ea\'f1\'e8.
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e5\'ee\'e1\'f5\'ee\'e4\'e8\'ec\'ee\'e5\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\'f1\'eb\'ee\'e2\'e8\'e5
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'f0\'e8\'e2\'e5\'e4\'e5\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'e2\'fb\'f8\'e5\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e1\'eb\'e8\'e7\'ee
+\'ea\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f2\'ee\'ec\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ff\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'fe\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ee\'f4\'e8\'f1\'e5
+\loch\f39 \hich\f39 , \'e7\'e0\loch\f39 \hich\f39 \'e8\'f1\'ea\'eb\'fe\'f7\'e5\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 \'ea\'ee\'eb\'e8\'f7\'e5\'f1\'f2\'e2\'e0\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 \'e8
+\loch\f39 \hich\f39 \'ed\'e5\'ea\'ee\'f2\'ee\'f0\'fb\'f5\loch\f39 \hich\f39 \'f1\'ef\'e5\'f6\'e8\'f4\'e8\'f7\'ed\'fb\'f5\loch\f39 \hich\f39 \'ec\'ee\'ec\'e5\'ed\'f2\'ee\'e2\loch\f39 \hich\f39 . \'cf\'f0\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec
+\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'e8\'ec\'e5\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e2\'e8\'e4\'f3\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'f7\'e0\'f1\'f2\'fc\loch\f39 \hich\f39 \'f4\'f3\'ed\'ea
+\'f6\'e8\'e9\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\hich\af39\dbch\af31505\loch\f39 \hich\f39 , \'f0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e5\'ed\'ed\'fb\'f5\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'e0\'f5\loch\f39 \hich\f39 ,
+\'f0\'e0\'e1\'ee\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e2\'e5\'f0\'f1\'e8\'e8\loch\f39 \hich\f39 0.6, \'f3\'f2\'ee\'f7\'ed\'e8\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39
+\'ea\'ee\'ed\'ea\'f0\'e5\'f2\'ed\'fb\'ec\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\'ec\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e2\loch\f39 changelog: http://3proxy.ru/current/Changelog.txt
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'ee\'eb\'e6\'e5\'ed\loch\f39 \hich\f39 \'ef\'f0\'e8\'e7\'ed\'e0\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'ec\'fb\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f0\'e0\'f1\'f1\'ec\'ee
+\'f2\'f0\'e5\'eb\'e8\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f2\'f0\'e5\'f2\'e8\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'fb\'f5\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e5\'ea\loch\f39 \hich\f39
+\'f1\'e5\'f0\'e2\'e5\'f0\'e0\loch\f39 \hich\f39 . \'c5\'f1\'f2\'fc\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ec\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'f0\'e0\'e7\'ed\'fb\'f5\loch\f39 \hich\f39 \'ea\'ee\'ec\loch\af39\dbch\af31505\hich\f39 \'e0
+\'ed\'e4\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39 \hich\f39 \'e2\'e0\'ec\loch\f39 \hich\f39 \'ec\'ee\'e3\'f3\'f2\loch\f39 \hich\f39 \'ef\'ee\'ed\'e0\'e4\'ee\'e1\'e8\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 - dialer, maxconn, system, i,
+\'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39 \hich\f39 \'ee\'f1\'f2\'e0\'eb\'e8\'f1\'fc\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e5\'ed\'ed\'fb\'ec\'e8\loch\f39 \hich\f39 \'e2\'ee\'ee\'e1\'f9\'e5\loch\f39 \hich\f39 ,
+\'e4\'e0\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f0\'e0\'e7\'ed\'ee\'ee\'e1\'f0\'e0\'e7\'e8\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5\'ec\'ee\'e7\'ec\'ee\'e6\'ed\'fb\'f5\loch\f39 \hich\f39 \'f1\'ee\'f7\'e5\'f2\'e0\'ed\'e8\'e9\loch\f39 \hich\f39 \'f0
+\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e5\'ed\'ed\'fb\'f5\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\loch\f39 \hich\f39 \'ed\'e0\'ec\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e1\'ee\'e3\'e0\'f7\'e5\loch\f39 \hich\f39 . \'cd\'ee\loch\f39 \hich\f39 \'ff\loch\f39
+\hich\f39 \'e8\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'f2\'e0\'e2\'e8\'eb\loch\f39 \hich\f39 \'f1\'e5\'e1\'e5\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'f7\'f3\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'e1\'ee\'eb\'e5\'e5-\'ec
+\'e5\'ed\'e5\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'ed\'ee\'e5\loch\f39 \hich\f39 \'ee\'ef\'e8\'f1\'e0\'ed\'e8\'e5\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\loch\af39\dbch\af31505\hich\f39 \'e3\loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 , \'ee
+\'e3\'f0\'e0\'ed\'e8\'f7\'e8\'e2\'f8\'e8\'f1\'fc\loch\f39 \hich\f39 \'e1\'ee\'eb\'e5\'e5\loch\f39 \hich\f39 \'f1\'ea\'f0\'ee\'ec\'ed\'ee\'e9\loch\f39 \hich\f39 - \'f0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e5\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\loch\f39
+\hich\f39 \'f0\'ff\'e4\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'ee\'e2\loch\f39 \hich\f39 , \'ef\'ee\'f1\'f2\'f0\'ee\'e5\'ed\'ed\'fb\'f5\loch\f39 \hich\f39 \'ea\'e0\'ea\loch\f39 \hich\f39 \'ec\'e0\'f2\'f0\'e5\'f8\'ea\'e0\loch\f39 \hich\f39 -
+\'ee\'f2\loch\f39 \hich\f39 \'f1\'e0\'ec\'ee\'e3\'ee\loch\f39 \hich\f39 \'ec\'e0\'eb\'e5\'ed\'fc\'ea\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'e4\'ee\loch\f39 \hich\f39 \'e4\'ee\'f1
+\'f2\'e0\'f2\'ee\'f7\'ed\'ee\loch\f39 \hich\f39 \'f1\'eb\'ee\'e6\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 "\'ef\'f0\'e0\'e2\'e8\'eb\'fc\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 " - \'ea\'ee\'ed\'f4\'e8\'e3\loch\f39 \hich\f39 , \'f7\'f2\'ee
+\'e1\'fb\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'e5\loch\f39 \hich\f39 \'ef\'ee\'ed\'ff\'f2\'fc\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'ed\'fb\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\'ed\'f6\'e8
+\'ef\'fb\loch\f39 \hich\f39 . \'cd\'e5\'f1\'ec\'ee\'f2\'f0\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ea\'e0\'e6\'f3\'f9\'f3\'fe\'f1\'ff\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2\'fb\'e9\loch\f39 \hich\f39 \'e2\'e7\'e3
+\'eb\'ff\'e4\hich\af39\dbch\af31505\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'f1\'eb\'ee\'e6\'ed\'ee\'f1\'f2\'fc\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\'ea\'e8\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 , \'ed\'e0\'e4\'e5\'fe\'f1
+\'fc\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'ef\'f0\'ee\'f6\'e5\'f1\'f1\'e5\loch\f39 \hich\f39 \'f7\'f2\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'f2\'e5\'ea\'f1\'f2\'e0\loch\f39 \hich\f39 \'e2\'fb\loch\f39
+\hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'f3\'e1\'e5\'e4\'e8\'eb\'e8\'f1\'fc\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e5\'ec\loch\f39 \hich\f39 \'e2\'f1\'e5\loch\f39 \hich\f39 \'e4\'ee\'e2\'ee\'eb\'fc\'ed
+\'ee\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'e3\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\'f7\'ed\'ee\loch\f39 \hich\f39 . \'ce\'ef\'ff\'f2\'fc\loch\f39 \hich\f39 \'e6\'e5\loch\f39 \hich\f39 \'e0\'e2\'f2\'ee\'f0\loch\f39 \hich\f39
+ \'ef\'f0\'ee\'e3\'f0\'e0\'ec\'ec\'fb\loch\f39 \hich\f39 \'ee\'e1\'e5\'f9\'e0\'e5\'f2\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f0\'e5\'eb\'e8\'e7\'f3\loch\f39 \hich\f39 \'f1\'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3
+\loch\f39 \hich\f39 \'e1\'ee\'eb\'e5\'e5\loch\f39 \hich\f39 \'f7\'e8\'f2\'e0\'e5\'ec\'fb\'ec\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'ee\'ed\'ff\'f2\'ed\'fb\'ec\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'e0\'e6\'ed\'ee\loch\f39 \hich\f39 \'ef\'ee\'ed\'ff\'f2\'fc\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e1\'ee\'f2\'f7\'e8\'ea
+\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\hich\af39\dbch\af31505\loch\f39 \hich\f39 . \'ce\'f7\'e5\'ed\'fc\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\loch\f39 \hich\f39 - \'e2\loch\f39 \hich\f39 \'ef\'ee\'f0\'ff\'e4\'ea\'e5\loch\f39 \hich\f39
+ \'f1\'eb\'e5\'e4\'ee\'e2\'e0\'ed\'e8\'ff\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 . \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'f1\'e5\'f0\'e2\'e5\'f0\'f3
+\loch\f39 \hich\f39 \'ed\'e0\'e4\'ee\loch\f39 \hich\f39 \'ee\'ef\'f0\'e5\'e4\'e5\'eb\'e8\'f2\'fc\loch\f39 \hich\f39 , \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'f2\'ee\'f2\loch\f39 \hich\f39 \'e8\'eb\'e8\loch\f39 \hich\f39 \'e8\'ed\'ee\'e9\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\loch\f39 \hich\f39 - \'ee\'ed\loch\f39 \hich\f39 \'e8\'f9\'e5\'f2\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2
+\'ee\'e5\loch\f39 \hich\f39 \'f3\'e4\'ee\'e2\'eb\'e5\'f2\'e2\'ee\'f0\'ff\'fe\'f9\'e5\'e5\loch\f39 \hich\f39 \'ef\'f0\'e0\'e2\'e8\'eb\'ee\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'f1\'ef\'e8\'f1\'ea\'e0\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3
+\'ef\'e0\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'ee\'e2\loch\f39 \hich\f39 (ACL) \'e8\loch\f39 \hich\f39 \'e4\'e5\'e9\'f1\'f2\'e2\'f3\'e5\'f2\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'e8\'e8\loch\f39
+\hich\f39 \'f1\loch\f39 \hich\f39 \'ed\'e8\'ec\loch\f39 \hich\f39 , \'e4\'e0\'e6\'e5\loch\f39 \hich\f39 \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'ed\'e5\'e3\loch\af39\dbch\af31505\hich\f39 \'ee
+\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'e4\'f0\'f3\'e3\'e8\'e5\loch\f39 \hich\f39 \'ef\'f0\'e0\'e2\'e8\'eb\'e0\loch\f39 \hich\f39 . \'c8\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee
+\loch\f39 \hich\f39 - \'e2\'f1\'e5\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'ed\'fb\loch\f39 \hich\f39 \'e1\'fb\'f2\'fc\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'ed\'fb\loch\f39 \hich\f39 \'e2
+\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'c4\'ce\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e0\loch\f39 \hich\f39 \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'f3\'fe\'f9\'e5\'e9\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb
+\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e5\'f1\'f2\'fc\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\'fb\loch\f39 \hich\f39 - \'e4\'ee\'e1\'f0\'ee\loch\f39 \hich\f39 \'ef\'ee\'e6\'e0\'eb\'ee\'e2\'e0\'f2\'fc\loch\f39
+\hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'f4\'ee\'f0\'f3\'ec\loch\f39 \hich\f39 http://3proxy.ru/board.html. \'c2\'ef\'f0\'ee\'f7\'e5\'ec\loch\f39 \hich\f39 , \'e4\'ee\'eb\'e6\'e5\'ed\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'f3\'ef\'f0\'e5\'e4\'e8\'f2\'fc
+\loch\f39 \hich\f39 , \'f7\'f2\'ee\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\'fb\loch\f39 \hich\f39 \'f2\'e8\'ef\'e0\loch\f39 \hich\f39 "\'e0\loch\f39 \hich\f39 \'ef\'ee\'f7\'e5\'ec\'f3\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'ec\'e5\'ed\'ff
+\loch\f39 \hich\f39 \'ed\loch\af39\dbch\af31505\hich\f39 \'e8\'f7\'e5\'e3\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'e5\'f2\loch\f39 \hich\f39 ?" \'e7\'e4\'e5\'f1\'fc\loch\f39 \hich\f39 , \'ea\'e0\'ea\loch\f39
+\hich\f39 \'ef\'f0\'e0\'e2\'e8\'eb\'ee\loch\f39 \hich\f39 , \'ed\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'e5\'f2\'f1\'f2\'e2\'f3\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'e2\'e0\'f0\'e8\'f2\'e5\'eb\'fc\'ed\'ee\'e5
+\loch\f39 \hich\f39 \'f7\'f2\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'f5\'ee\'f2\'ff\loch\f39 \hich\f39 \'e1\'fb\loch\f39 \hich\f39 FAQ \'e8\loch\f39 \hich\f39 HowTO \'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8
+\'e2\'e5\'f2\'f1\'f2\'e2\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ff\'e2\'eb\'ff\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'ee\'e1\'ff\'e7\'e0\'f2\'e5\'eb\'fc\'ed\'fb\'ec\loch\f39 \hich\f39 . \'cd\'e0
+\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'e0\'ed\'e8\'e8\loch\f39 \hich\f39 \'f1\'ee\'e1\'f1\'f2\'e2\'e5\'ed\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 \'ee\'ef\'fb\'f2\'e0\loch\f39 \hich\f39 \'ec\'ee\'e3\'f3\loch\f39 \hich\f39 \'ef\'ee\'f1\'ee\'e2\'e5\'f2
+\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'f0\'f3\'f1\'f1\'ea\'ee\'ff\'e7\'fb\'f7\'ed\'fb\'f5\loch\f39 \hich\f39 FAQ \'e8\loch\f39 \hich\f39 HowTO, \'e7\'e0\'f2\'e5\'ec\loch\f39
+\hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'f1\'f0\loch\af39\dbch\af31505\hich\f39 \'e0\loch\af39\dbch\af31505\hich\f39 \'e2\'ed\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ef\'f0\'ee\'f7\'e8\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'e0\'ed\'e3\'eb\'ee\'ff\'e7
+\'fb\'f7\'ed\'fb\'e5\loch\f39 \hich\f39 FAQ \'e8\loch\f39 \hich\f39 HowTO, \'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'e8\'f5\loch\f39 \hich\f39 \'ed\'e0\'f8\'e5\'eb\loch\f39 \hich\f39 \'ed\'e5\'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39
+\hich\f39 \'e2\'e7\'e0\'e8\'ec\'ee\'e4\'ee\'ef\'ee\'eb\'ed\'ff\'fe\'f9\'e8\'e5\loch\f39 \hich\f39 \'ec\'ee\'ec\'e5\'ed\'f2\'fb\loch\f39 \hich\f39 . \'cd\'f3\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f0\'e0\'e7\'f3\'ec\'e5\'e5\'f2\'f1\'ff\loch\f39
+\hich\f39 , \'ec\'e5\'e4\'e8\'f2\'e0\'f6\'e8\'ff\loch\f39 \hich\f39 \'ed\'e0\'e4\loch\f39 \hich\f39 man (\'f3\'e2\'fb\loch\f39 \hich\f39 , \'ee\'ed\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e0\'ed
+\'e3\'eb\'e8\'e9\'f1\'ea\'ee\'ec\loch\f39 \hich\f39 ) \'e4\'e0\'f1\'f2\loch\f39 \hich\f39 \'e2\'e0\'ec\loch\f39 \hich\f39 \'ee\'f2\'e2\'e5\'f2\'fb\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'e8\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'f1\'e5
+\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\'fb\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\'f3\loch\f39 \hich\f39 \'e7\'e0\'ec\'e5\'f7\'e0\'f2\'e5\'eb\'fc\'ed\'ee\'ec\'f3\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0
+\'e2\'e5\'f0\'f3\loch\f39 \hich\f39 . \'cc\'ee\'e3\'f3\loch\f39 \hich\f39 \'f3\'f2\'e2\'e5\'f0\'e6\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'fd\'f2\loch\af39\dbch\af31505\hich\f39 \'ee\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39
+\'f1\'ee\'e1\'f1\'f2\'e2\'e5\'ed\'ed\'ee\'ec\'f3\loch\f39 \hich\f39 \'ee\'ef\'fb\'f2\'f3\loch\f39 \hich\f39 . \'cd\'e0\loch\f39 \hich\f39 \'ee\'f1\'f2\'e0\'e2\'f8\'e8\'e5\'f1\'ff\loch\f39 \hich\f39 \'e5\'f9\'e5\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee
+\'f1\'fb\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'ed\'e0\'e9\'f2\'e8\loch\f39 \hich\f39 \'ee\'f2\'e2\'e5\'f2\'fb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 changelog, \'ed\'f3\loch\f39
+\hich\f39 \'e0\loch\f39 \hich\f39 \'e5\'f1\'eb\'e8\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'f2\'e0\'ec\loch\f39 \hich\f39 \'e2\'fb\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ed\'e0\'e9\'e4\'e5\'f2\'e5\loch\f39 \hich\f39 \'ee\'f2\'e2\'e5
+\'f2\'e0\loch\f39 \hich\f39 - \'e7\'ed\'e0\'f7\'e8\'f2\loch\f39 \hich\f39 , \'f3\'e6\'e5\loch\f39 \hich\f39 \'ef\'ee\'f0\'e0\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\loch\f39 \hich\f39 \'ed\'e0
+\loch\f39 \hich\f39 \'f4\'ee\'f0\'f3\'ec\'e5\loch\f39 .
+\par
+\par
+\par }{\rtlch\fcs1 \ab\af39\afs20 \ltrch\fcs0 \b\f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'c4\'ee\'ef\'ee\'eb\'ed\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 30 \'ec\'e0\'f0\'f2\'e0\loch\f39 \hich\f39 2010 \'e3
+\'ee\'e4\'e0.
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par \loch\af39\dbch\af31505\hich\f39 \'d0\'e0\'f1\'f1\'ec\'ee\'f2\'f0\'e8\'ec\loch\f39 \hich\f39 \'ed\'e5\'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\'fb\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39 \hich\f39 \'f7
+\'e0\'f9\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5\'e3\loch\af39\dbch\af31505\hich\f39 \'ee\loch\f39 \hich\f39 \'e2\'ee\'e7\'ed\'e8\'ea\'e0\'fe\'f2\loch\f39 \hich\f39 \'f3\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 }{
+\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\kerning1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 3}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 proxy
+}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 . \'c0\loch\f39 \hich\f39 \'f2\'e0\'ea\'e6\'e5\loch\f39 \hich\f39 \'ed\'e5\'ea\'ee\'f2\'ee\'f0\'fb\'e5\loch\f39 \hich\f39 \'e8\'ed\'f2
+\'e5\'f0\'e5\'f1\'ed\'fb\'e5\loch\f39 \hich\f39 , \'ed\'ee\loch\f39 \hich\f39 \'ed\'e5\'ee\'f7\'e5\'e2\'e8\'e4\'ed\'fb\'e5\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2\'e8\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8-\'f1\'e5\'f0\'e2\'e5
+\'f0\'e0.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 1. \'ca\'e0\'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'ff\'e7\'e0\'f2\'fc\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186
+\hich\af1\dbch\af31505\loch\f1 MAC}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\kerning1\insrsid11355186\charrsid3764488 -}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e0\'e4\'f0\'e5\'f1
+\loch\f39 \hich\f39 \'f1\'e5\'f2\'e5\'e2\'ee\'e9\loch\f39 \hich\f39 \'ea\'e0\'f0\'f2\'fb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 ?
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'eb\'ff\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39
+ }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 system}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\kerning1\insrsid11355186\charrsid3764488
+\hich\af1\dbch\af31505\loch\f1 :
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 system arp -s 1.2.3.4 AA:BB:CC:DD:EE:FF}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'fd\'f2\'e0\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\loch\af39\dbch\af31505\hich\f39 \'f7\'ea\'e0\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed
+\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'e4\'e0\'e5\'f2\loch\f39 \hich\f39 \'ee\'f2\'f1\'fb\'eb\'ea\'f3\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f1\'e8\'f1\'f2\'e5\'ec\'ed\'ee\'e9\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e5}{\rtlch\fcs1
+\af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 arp}{\rtlch\fcs1
+\af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'e0\'ff\loch\f39 \hich\f39 \'ef\'f0\'e8\'e2\'ff\'e7\'fb\'e2\'e0\'e5\'f2\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'ed\'ed\'fb\'e9
+\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 IP}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1
+}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e0\'e4\'f0\'e5\'f1\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'ed\'ed\'ee\'ec\'f3\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 MAC}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 -}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186
+\loch\af39\dbch\af31505\hich\f39 \'e0\'e4\'f0\'e5\'f1\'f3.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 2. \'cc\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'f6\'e5\'eb\'fb
+\'e5\loch\f39 \hich\f39 \'f1\'e5\'f2\'ea\'e8\loch\f39 \hich\f39 , \'f2.\'e5\loch\f39 \hich\f39 . \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ec\'e0\'f1\'ea\'f3\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 192.168.100.* }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e2\'ec\'e5\'f1\'f2\'ee\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5
+\'f7\'e8\'f1\'eb\'e5\'ed\'e8\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 IP}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e0\'e4\'f0\'e5\'f1\'ee\'e2\loch\f39 ?
+\par \loch\af39\dbch\af31505\hich\f39 \'c4\'e0\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e8\loch\af39\dbch\af31505\hich\f39 \'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2
+\'fc\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 CIDR}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39
+\hich\f39 , \'ea\loch\f39 \hich\f39 \'ef\'f0\'e8\'ec\'e5\'f0\'f3\loch\f39 :
+\par }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 allow}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1
+ * 192.168.100/32
+\par
+\par \hich\af1\dbch\af31505\loch\f1 3}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 . \'c5\'f1\'f2\'fc\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'e4\'e8\'ed\'e0\'ec\'e8\'f7\'e5\'f1\'ea\'e8
+\'e9\loch\f39 \hich\f39 \'f8\'e5\'e9\'ef\'e5\'f0\loch\f39 \hich\f39 \'e2\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 3}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 proxy}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 , \'f2.\'e5\loch\f39 \hich\f39 . \'ec\'ee\'e6
+\'ed\'ee\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'f0\'e8\'ee\'f0\'e8\'f2\'e5\'f2\'fb\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'f1\'ea\'ee\'f0\'ee\'f1\'f2\'e8\loch\f39 \hich\f39
+\'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 ?
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e0\loch\f39 \hich\f39 \'e4\'e0\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'ec\'ee\'ec\'e5\'ed\'f2\loch\f39 \hich\f39 (\'ec\'e0\'f0\'f2\loch\f39 \hich\f39 2010) \'ed\'e5\'f2\loch\f39 \hich\f39 , \'ed\'ee\loch\f39
+\hich\f39 \'e0\'e2\'f2\'ee\'f0\loch\f39 \hich\f39 \'ee\'e1\'e5\'f9\'e0\'eb\loch\f39 \hich\f39 \'ef\'f0\'e8\'ea\'f0\'f3\'f2\'e8\'f2\'fc.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 4. \'c5\'f1\'f2\'fc\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'e0\'ed\'f2\'e8\'e2\'e8\'f0\'f3\'f1\'ed\'fb\'e9\loch\f39 \hich\f39 \'ec\'ee\'e4\'f3\'eb\'fc\loch\f39 \hich\f39 \'e2\loch\f39 }{\rtlch\fcs1
+\af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 3}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 proxy}{\rtlch\fcs1
+\af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 ?
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'ec\'ee\'f2\'f0\'e8\loch\f39 \hich\f39 \'ee\'f2\'e2\'e5\'f2\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e2\'ee\'ef\'f0\'ee\'f1\loch\f39 3.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 5. \'c3\'e4\'e5\loch\f39 \hich\f39 \'f1\'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'e0\'ed\'e0\'eb\'e8\'e7\'e0\'f2\'ee\'f0\loch\f39 \hich\f39 \'eb\'ee\'e3\'ee\'e2\loch\f39 }{\rtlch\fcs1 \af1\afs20
+\ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 WRSpy}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 :
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 http://www.wrspy.ru/download/WrSpySetup.rar - \'f1\'f1\'fb\'eb\'ea\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'e8\'ed\'f1\'f2\'e0\'eb
+\'eb\'ff\'f2\'ee\'f0
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 http://www.wrspy.ru/download/WrSpyUp166.rar - \'f1\'f1\'fb\'eb\'ea\'e0\loch\f39 \hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\'e4\'ed\'e5\'e5\loch\f39 \hich\f39 \'ee\'e1\'ed\'ee\'e2\'eb\'e5\'ed
+\'e8\'e5.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 6. \'ca\'e0\'ea\loch\f39 \hich\f39 \'ef\'f0\'e0\'e2\'e8\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 \'e3\'eb\'ee\'e1\'e0\'eb\'fc\'ed\'fb\'e5\loch\f39
+\loch\af39\dbch\af31505\hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'fb\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0\loch\f39 \hich\f39 , \'ee\'f2\'ed\'ee\'f1\'ff\'f9\'e8\'e5\'f1\'ff\loch\f39 \hich\f39 \'ea\'ee\loch\f39 \hich\f39 \'e2\'f1\'e5\'ec
+\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e0\'e5\'ec\'fb\'ec\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'e0\'ec\loch\f39 ?
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ca\'ee\'ec\'e0\'ed\'e4\'fb\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e0
+\loch\f39 \hich\f39 \'e2\'fb\'ef\'ee\'eb\'ed\'ff\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'ed\'e5\'ef\'ee\'f1\'f0\'e5\'e4\'f1\'f2\'e2\'e5\'ed\'ed\'ee\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e8\'ff\loch\f39
+\hich\f39 , \'f2.\'e5\loch\f39 \hich\f39 . \'ea\'e0\'ea\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e5\'ed\'e0\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 "proxy" - \'f1\'eb\'f3\'e6\'e1
+\'e0\loch\f39 \hich\f39 \'f1\'f2\'e0\'f0\'f2\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'ed\'ed\'ee\'e9\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'f3\'f0\'e0\'f6\'e8\'e5\'e9\loch\f39 \hich\f39 \'e8\loch\f39
+\hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'fd\'f2\'ee\'e3\'ee\loch\f39 \hich\f39 \'f1\'f7\'e8\'f2\'fb\'e2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'f3\'fe\'f9\'e0\'ff\loch\f39
+\hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 . \'cf\'ee\'fd\'f2\'ee\'ec\'f3\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 \'e2\'f1\'e5\'e3\'e4
+\'e0\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'e5\'ed\loch\f39 \hich\f39 \'e1\'fb\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\'e4\'ed\'e5\'e9\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'ee\'e9\loch\f39 \hich\f39 , \'ef\'ee\'f1\'eb\'e5\loch\f39
+\hich\f39 \'ed\'e5\'e3\'ee\loch\f39 \hich\f39 \'ed\'e8\'f7\'e5\'e3\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'ed\'ee\loch\f39 \hich\f39 \'e1\'fb\'f2\'fc\loch\f39 \hich\f39 , \'ea\'f0\'ee\'ec\'e5\loch\f39 \hich\f39 \'ea\'ee
+\'ed\'f4\'e8\'e3\'f3\'f0\'e0\'f6\'e8\'e8\loch\f39 \hich\f39 \'f1\'eb\'e5\'e4\'f3\'fe\'f9\'e5\'e9\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39 \hich\f39 . \'c5\'f1\'eb\'e8\loch\f39 \hich\f39 \'f7\'f2\'ee-\'f2\'ee\loch\f39 \hich\f39 \'e8
+\loch\f39 \hich\f39 \'ef\'ee\'eb\'f3\'f7\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f3\'ea\'e0\'e7\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e0\loch\f39 \hich\f39 \'f1\'eb\'f3\'e6\'e1\'fb\loch\f39
+\hich\f39 - \'fd\'f2\'ee\loch\f39 \hich\f39 \'ef\'f0\'ee\'f1\'f2\'ee\loch\f39 \hich\f39 \'f1\'ee\'e2\'ef\'e0\'e4\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 , \'e2\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee\'e9\loch\f39 \hich\f39 \'ec\'ee\'ec\'e5\'ed\'f2\loch\f39
+\hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'f1\'f2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f0\'e0\'e1\'ee\'f2\'e0\'f2\'fc.
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 7. \'cc\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'ed\'e5\'f1\'ea\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'e2\'ed\'e5
+\'f8\'ed\'e8\'f5\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\'ee\'e2\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8\loch\f39 ?
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ca\'ee\'ec\'e0\'ed\'e4\'e0\loch\f39 \hich\f39 parent \'f1\loch\f39 \hich\f39
+\'ed\'f3\'eb\'e5\'e2\'fb\'ec\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'ee\'ec\loch\f39 \hich\f39 \'f3\'f1\'f2\'e0\'ed\'e0\'e2\'eb\'e8\'e2\'e0\'e5\'f2\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'ec\'ee
+\'e3\'ee\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\'e0\loch\f39 \hich\f39 . \'cd\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39
+\par \hich\af39\dbch\af31505\loch\f39 allow vasya
+\par \hich\af39\dbch\af31505\loch\f39 parent 1000 http 192.168.1.1 0
+\par \hich\af39\dbch\af31505\loch\f39 allow petya
+\par \hich\af39\dbch\af31505\loch\f39 parent 1000 http 192.168.2.1 0
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'f3\'f1\'f2\'e0\'ed\'e0\'e2\'eb\'e8\'e2\'e0
+\loch\af39\dbch\af31505\hich\f39 \'e5\'f2\loch\f39 \hich\f39 \'e2\'ed\'e5\'f8\'ed\'e8\'e9\loch\f39 \hich\f39 \'e8\'ed\'f2\'e5\'f0\'f4\'e5\'e9\'f1\loch\f39 \hich\f39 192.168.1.1 \'e4\'eb\'ff\loch\f39 \hich\f39 vasya \'e8\loch\f39 \hich\f39
+ 192.168.2.1 \'e4\'eb\'ff\loch\f39 petya
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 8. \'ca\'e0\'ea\loch\f39 \hich\f39 \'ed\'e0\'f1\'f2\'f0\'ee\'e8\'f2\'fc\loch\f39 \hich\f39 \'f4\'e8\'eb\'fc\'f2\'f0\'e0\'f6\'e8\'fe\loch\f39 \hich\f39 \'ed\'e5\'e6\'e5\'eb\'e0\'f2\'e5\'eb\'fc\'ed\'fb\'f5
+\loch\f39 \hich\f39 \'f0\'e5\'f1\'f3\'f0\'f1\'ee\'e2\loch\f39 \hich\f39 (\'ed\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'e4\'eb\'ff\loch\f39 \hich\f39 \'f8\'ea\'ee\'eb\'fb\loch\f39 )?
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'ee\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e9\'f2\'e5\'f1\'fc\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 DNS}{\rtlch\fcs1
+\af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 \'d1\'e8\'f1\'f2\'e5\'ec\'fb\loch\f39 \hich\f39 \'ea\'ee\'ed\'f2\'e5\'ed\'f2\'ed\'ee\'e9\loch\f39 \hich\f39 \'f4\'e8\'eb\'fc\'f2\'f0\'e0\'f6\'e8\'e8
+\loch\f39 :
+\par }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 nserver}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1
+ 81.176.72.82
+\par }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 nserver}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1
+ 81.176.72.83}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par \loch\af39\dbch\af31505\hich\f39 \'c2\'f1\'e5\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'fb\loch\f39 \hich\f39 \'ee\'e1\'f0\'e0\'e1\'e0\'f2\'fb\'e2\'e0\loch\af39\dbch\af31505\hich\f39 \'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'f1\'e8\'f1\'f2\'e5\'ec\'ee
+\'e9\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'f0\'e0\'ea\'f2\'e8\'f7\'e5\'f1\'ea\'e8\loch\f39 \hich\f39 \'ed\'e8\loch\f39 \hich\f39 \'ee\'e4\'ed\'e0\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0\'ed\'e8\'f6\'e0\loch\f39 \hich\f39 \'f1\loch\f39
+\hich\f39 \'ef\'ee\'f0\'ed\'ee\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'ed\'e0.
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'f0\'e0\'e2\'e4\'e0\loch\f39 \hich\f39 , \'f1\'e8\'f1\'f2\'e5\'ec\'e0\loch\f39 \hich\f39 \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'e6\'e5\'f1\'f2\'ea\'ee\loch\f39 \hich\f39 \'f4\'e8\'eb\'fc\'f2\'f0\'f3
+\'e5\'f2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f2\'e5\'ed\'f2\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'ef\'e5\'f0\'e5\'ea\'f0\'fb\'e2\'e0\'e5\'f2\loch\f39 \hich\f39 \'e4\'ee\'e2\'ee\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ec\'ed\'ee\'e3\'ee\loch\f39
+\hich\f39 \'f1\'f0\'e0\'e2\'ed\'e8\'f2\'e5\'fc\'ed\'ee\loch\f39 \hich\f39 \'e1\'e5\'e7\'ee\'ef\'e0\'f1\'ed\'fb\'f5\loch\f39 \hich\f39 \'f1\'e0\'e9\'f2\'ee\'e2.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 9. \'cc\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 \hich\f39 \'f0\'e0\'e7\'e4\'e5\'eb\'e8\'f2\'e5\'eb\'fc\loch\f39 \hich\f39 \'e2
+\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\'ee\'e2\'ee\'ec\loch\f39 \hich\f39 \'ea\'eb\'e8\'e5\'ed\'f2\'e5\loch\f39 \hich\f39 , \'ee\'f2\'eb\'e8\'f7\'ed\'fb\'e9\loch\f39 \hich\f39 \'ee\'f2\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\kerning1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 #}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 ?
+\par \loch\af39\dbch\af31505\hich\f39 \'c8\loch\af39\dbch\af31505\hich\f39 \'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e9\'f2\'e5\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 delimchar}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\kerning1\insrsid11355186\charrsid3764488
+\par
+\par \hich\af1\dbch\af31505\loch\f1 10. }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ca\'e0\'ea\loch\f39 \hich\f39 \'e7\'e0\'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2
+\'e5\'eb\'fe\loch\f39 \hich\f39 \'e1\'e5\'e7\'eb\'e8\'ec\'e8\'f2\'ed\'fb\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 ?
+\par \loch\af39\dbch\af31505\hich\f39 \'c8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e9\'f2\'e5\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'ee\'e5\loch\f39 \hich\f39 \'ee\'ed\loch\f39 \hich\f39 \'ed\'e5\loch\f39
+\hich\f39 \'f1\'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'e2\'fb\'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'f0\'e8\'ed\'f6\'e8\'ef\'e5.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 11. \'ca\'e0\'ea\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'fe\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \hich\f39 \'ee\'ef\'f0\'e5\'e4\'e5\'eb\'e5\'ed\'ed\'fb\'e9\loch\f39 \hich\f39
+\'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 , \'ea\'ee\'f2\'ee\'f0\'fb\'e9\loch\f39 \hich\f39 \'ee\'ed\loch\f39 \hich\f39 \'ec\'ee\'e6\'e5\'f2\loch\f39 \hich\f39 \'f1\'ea\'e0\'f7\'e0\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'eb\'fe\'e1\'ee
+\'e5\loch\f39 \hich\f39 \'e2\'f0\'e5\'ec\'ff\loch\f39 \hich\f39 , \'e0\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f2\'ee\'eb\'fc\'ea\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'e4\'e0\'ed\'ed\'fb\'e9\loch\f39 \hich\f39 \'ec\'e5\'f1\'ff
+\'f6\hich\af39\dbch\af31505\loch\f39 \hich\f39 \'e8\'eb\'e8\loch\f39 \hich\f39 \'e4\'e5\'ed\'fc\loch\f39 ?
+\par \loch\af39\dbch\af31505\hich\f39 \'c8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e9\'f2\'e5}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1
+\af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 Y - }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ed\'e0}{
+\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e3
+\'ee\'e4}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 , N - }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186
+\loch\af39\dbch\af31505\hich\f39 \'ed\'e8\'ea\'ee\'e3\'e4\'e0}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'e4\'eb\'ff}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ef\'e0\'f0\'e0\'ec\'e5\'f2\'f0\'e0}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488
+\hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 type: }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 countin }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 1}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\kerning1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 2}{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 . \'cf\'ee\'f7\'e5\'ec\'f3\loch\f39 \hich\f39 \'ee\'e3\'f0\'e0\'ed\'e8\'f7\'e5\'ed\'e8\'e5\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\'e0\loch\f39 \hich\f39 \'ed
+\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5\'e3\'e4\'e0\loch\f39 \hich\f39 \'e4\'e5\'e9\'f1\'f2\'e2\'f3\'e5\'f2\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'f1\'ea\'e0\'f7\'e8\'e2\'e0\'ed\'e8\'e8\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'ee\'e2\loch\f39
+?
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 3proxy \'ed\'e5\loch\f39 \hich\f39 \'ef\'f0\loch\af39\dbch\af31505\hich\f39 \'e5\'f0\'fb\'e2\'e0\'e5\'f2\loch\f39 \hich\f39 \'e7\'e0\'ea\'e0
+\'f7\'ea\'f3\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'e0\loch\f39 \hich\f39 \'e8\loch\f39 \hich\f39 \'eb\'e8\'ec\'e8\'f2\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ff\'e2\'eb\'ff\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e6\'e5\'f1\'f2\'ea\'e8\'ec
+\loch\f39 \hich\f39 . \'cd\'ee\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'ed\'e0\'f7\'e0\'eb\'e5\loch\f39 \hich\f39 \'e7\'e0\'ea\'e0\'f7\'ea\'e8\loch\f39 \hich\f39 , \'ef\'ee\loch\f39 \hich\f39 \'e2\'ee\'e7\'ec\'ee\'e6\'ed\'ee\'f1\'f2\'e8
+\loch\f39 \hich\f39 , \'ef\'f0\'ee\'e2\'e5\'f0\'ff\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'f3\'ea\'eb\'e0\'e4\'fb\'e2\'e0\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\loch\f39 \hich\f39 \'ef\'ee\loch\f39 \hich\f39 \'f0
+\'e0\'e7\'ec\'e5\'f0\'e0\'ec\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ed\'ee\'f0\'ec\'f3.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 1}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 3}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39
+\hich\f39 . \'ca\'e0\'ea\'ee\'e9\loch\f39 \hich\f39 \'f4\'ee\'f0\'ec\'e0\'f2\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f4\'e0\'e9\'eb\'e0\'f5\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2
+\'f7\'e8\'ea\'ee\'e2\loch\f39 \hich\f39 , \'e7\'e0\'e4\'e0\'e2\'e0\'e5\'ec\'fb\'f5\loch\f39 \hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'ee\'e9\loch\f39 counter ?
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cd\'ee\'ec\'e5\'f0\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\'e0
+\loch\f39 \hich\f39 - \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 *4GB + \'f2\loch\af39\dbch\af31505\hich\f39 \'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 . \'cf\'f0\'ee\'f1\'f2\'ee\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'f6\'e5\'eb\'fb\'e9\loch\f39
+\hich\f39 \'f2\'e8\'ef\loch\f39 \hich\f39 \'e1\'ee\'eb\'fc\'f8\'e5\loch\f39 \hich\f39 4GB \'ed\'e5\loch\f39 \hich\f39 \'e2\'eb\'e0\'e7\'e8\'f2.
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'e0\'ef\'f0\'e8\'ec\'e5\'f0\loch\f39 \hich\f39 , \'f1\'f2\'f0\'ee\'f7\'ea\'e0\loch\f39 \hich\f39 00100 0000000021 3468801478 \'f1\'ee\'ee\'f2\'e2\'e5\'f2\'f1\'f2\'e2\'f3\'e5\'f2\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2
+\'f7\'e8\'ea\'f3\loch\f39 \hich\f39 \'ed\'ee\'ec\'e5\'f0\loch\f39 \hich\f39 100 \'f1\'ee\loch\f39 \hich\f39 \'e7\'ed\'e0\'f7\'e5\'ed\'e8\'e5\'ec\loch\f39 \hich\f39 21*4 + 3=89\'c3\'e1.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 1}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 4}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39
+\hich\f39 . \'cc\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'eb\'e8\loch\f39 \hich\f39 \'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5
+\loch\f39 \hich\f39 \'e7\'e2\'e5\'e7\'e4\'ee\'f7\'ea\'e8\loch\f39 \hich\f39 \'e2\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 ACL}{\rtlch\fcs1 \af1\afs20
+\ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 ?
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 * \'e2\loch\f39 \hich\f39 \'ea\'ee\'ed\'f6\'e5\loch\f39 \hich\f39 ACL \'ec\'ee\'e6\'ed\'ee\loch\f39 \hich\f39 \'e2\'ee\'ee\'e1\'f9\'e5
+\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 \hich\f39 . \'d2\'ee\loch\f39 \hich\f39 \'e5\'f1\'f2\loch\af39\dbch\af31505\hich\f39 \'fc\loch\f39 \hich\f39 \'e2\'ef\'ee\'eb\'ed\'e5\loch\f39 \hich\f39 \'f0\'e0
+\'e1\'ee\'f7\'e5\'e9\loch\f39 \hich\f39 \'e1\'f3\'e4\'e5\'f2\loch\f39 \hich\f39 \'f1\'f2\'f0\'ee\'ea\'e0\loch\f39 \hich\f39 \'e2\'e8\'e4\'e0\loch\f39 :
+\par }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 allow}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{
+\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 user}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488
+\par
+\par \hich\af1\dbch\af31505\loch\f1 15. }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ca\'e0\'ea\loch\f39 \hich\f39 \'e0\'e4\'ec\'e8\'ed\'e8\'f1\'f2\'f0\'e0\'f2\'ee\'f0\'f3\loch\f39 \hich\f39 \'f1\'ec
+\'ee\'f2\'f0\'e5\'f2\'fc\loch\f39 \hich\f39 \'ee\'e1\'f9\'e8\'e9\loch\f39 \hich\f39 (\'e4\'eb\'ff\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'e5\'e9\loch\f39 \hich\f39 ) \'f1\'f3\'f2\'ee\'f7\'ed
+\'fb\'e9\loch\f39 \hich\f39 \'e8\'eb\'e8\loch\f39 \hich\f39 \'ec\'e5\'f1\'ff\'f7\'ed\'fb\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 ?
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 countin 100/month M 1000000 *
+\par \hich\af39\dbch\af31505\loch\f39 countin 101/day D 1000000 *
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 1}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 6}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\cf1\insrsid11355186 .}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ca\'e0
+\'ea\loch\f39 \hich\f39 \'f0\'e0\'e7\'f0\'e5\'f8\'e8\'f2\'fc\loch\f39 \hich\f39 \'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'e5\'eb\'ff\'ec\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'ea\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 ICQ}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 , \'ed\'e5\loch\f39 \hich\f39 \'e4\'e0\'e2\'e0
+\loch\af39\dbch\af31505\hich\f39 \'ff\loch\f39 \hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\'e0\loch\f39 \hich\f39 \'ea\loch\f39 \hich\f39 \'eb\'fe\'e1\'fb\'ec\loch\f39 \hich\f39 \'f1\'e0\'e9
+\'f2\'e0\'ec\loch\f39 ?
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 allow * [\'f1\'ef\'e8\'f1\'ee\'ea\loch\f39 \hich\f39 \'f1\'e2\'ee\'e8\'f5\loch\f39 \hich\f39 \'f1\'e5\'f2\'e5\'e9\loch\f39 ] 64.12.0.0/16,205.188.0.0/16 3190
+\par \hich\af39\dbch\af31505\loch\f39 deny *
+\par \loch\af39\dbch\af31505\hich\f39 \'cd\'ee\loch\f39 \hich\f39 \'eb\'f3\'f7\'f8\'e5\loch\f39 \hich\f39 \'e8\'f1\'ef\'ee\'eb\'fc\'e7\'ee\'e2\'e0\'f2\'fc\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 icqpr}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 .
+\par
+\par \hich\af1\dbch\af31505\loch\f1 17. }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ca\'e0\'ea\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 3proxy \'f0\'e0\'e7\'f0\'e5\'f8\'e8\'f2\'fc\loch\f39
+\hich\f39 \'f0\'e0\'e1\'ee\'f2\'f3\loch\f39 \hich\f39 \'ef\'f0\'ee\'f2\'ee\'ea\'ee\'eb\'e0\loch\f39 \hich\f39 IMAP \'e4\'eb\'ff\loch\f39 outlook?
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'e4\'e5\'eb\'e0\'e9\loch\f39 \hich\f39 tcppm \'e4\'eb\'ff\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'e0\loch\f39 143.
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 18. \'cf\'ee\'f7\'e5\'ec\'f3\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ef\'f0\'e8\'f5\'ee\'e4\'e8\'f2\loch\f39 \hich\f39 \'ef\'ee\'f7\'f2\loch\af39\dbch\af31505\hich\f39 \'e0\loch\f39 \hich\f39 \'ef
+\'f0\'e8\loch\f39 \hich\f39 \'f2\'e0\'ea\'ee\'ec\loch\f39 \hich\f39 \'ea\'ee\'ed\'f4\'e8\'e3\'e5\loch\f39 ?
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186\charrsid3764488 \hich\af39\dbch\af31505\loch\f39 tcppm -i192.168.0.1 25 mail.infobox.ru 25
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 smtpp
+\par
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'d2\'fb\loch\f39 \hich\f39 \'ef\'fb\'f2\'e0\'e5\'f8\'fc\'f1\'ff\loch\f39
+\hich\f39 \'ed\'e0\loch\f39 \hich\f39 \'ee\'e4\'ed\'ee\'ec\loch\f39 \hich\f39 25-\'ee\'ec\loch\f39 \hich\f39 \'ef\'ee\'f0\'f2\'f3\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'f2\'e8\'f2\'fc\loch\f39 \hich\f39 2 \'f0\'e0\'e7\'ed\'fb\'f5\loch\f39
+\hich\f39 \'f1\'e5\'f0\'e2\'e8\'f1\'e0.
+\par
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 19. \'c5\'f1\'f2\'fc\loch\f39 \hich\f39 \'f1\'e5\'f2\'fc\loch\f39 \hich\f39 10.10.1.0/24, \'e4\'eb\'ff\loch\f39 \hich\f39 \'ed\'e5\'e5\loch\f39 \hich\f39 \'e7\'e0\'e2\'e5\'e4\'e5\'ed\loch\f39 \hich\f39 \'f1
+\'f7\'e5\'f2\'f7\'e8\'ea\loch\f39 \hich\f39 : countin "60/\'d5\'d5\'d5\loch\f39 \hich\f39 " M 5000 * 10.10.1.0/24 * * *, \'f2\'f0\'e5\'e1\'f3\'e5\'f2\'f1\'ff\loch\f39 \hich\f39 \'e2\'e5\'f1\'f2\'e8\loch\f39 \hich\f39 \'ef\'ee\'e4\'f1\'f7
+\loch\af39\dbch\af31505\hich\f39 \'e5\'f2\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'e4\'e2\'f3\'f5\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\'ee\'e2\loch\f39 \hich\f39 \'e8\'e7\loch\f39 \hich\f39 \'fd\'f2\'ee\'e9\loch\f39 \hich\f39 \'f1\'e5
+\'f2\'e8\loch\f39 \hich\f39 \'ee\'f2\'e4\'e5\'eb\'fc\'ed\'ee\loch\f39 \hich\f39 \'ee\'f2\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'ed\'ee\'e3\'ee\loch\f39 \hich\f39 . \'cf\'f0\'e8\loch\f39 \hich\f39 \'fd\'f2\'ee\'ec\loch\f39 \hich\f39 , \'e5\'f1\'eb
+\'e8\loch\f39 \hich\f39 \'ee\'f1\'ed\'ee\'e2\'ed\'e0\'ff\loch\f39 \hich\f39 \'f1\'e5\'f2\'fc\loch\f39 \hich\f39 \'f3\'e6\'e5\loch\f39 \hich\f39 \'e2\'fb\'e1\'f0\'e0\'eb\'e0\loch\f39 \hich\f39 \'f1\'e2\'ee\'e9\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8
+\'ea\loch\f39 \hich\f39 , \'f3\loch\f39 \hich\f39 \'fd\'f2\'e8\'f5\loch\f39 \hich\f39 \'e4\'e2\'f3\'f5\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\'ee\'e2\loch\f39 \hich\f39 \'e4\'ee\'f1\'f2\'f3\'ef\loch\f39 \hich\f39 \'e4\'ee\'eb\'e6\'e5\'ed\loch\f39
+\hich\f39 \'f1\'ee\'f5\'f0\'e0\'ed\'ff\'f2\'fc\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'f0\'e5\'e4\'e5\'eb\'e0\'f5\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'f1\'ee\'e1\'f1\'f2\'e2\'e5\'ed\'ed\'fb\'f5\loch\f39 \hich\f39 \'eb
+\'e8\'ec\'e8\'f2\'ee\'e2\loch\f39 .
+\par
+\par \loch\af39\dbch\af31505\hich\f39 \'d1\'e4\'e5\'eb\'e0\'f2\'fc\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2\'fb\'e5\loch\f39 \hich\f39 \'e4\'e2\'e0\loch\f39 \hich\f39 \'f1\'f7\'e5\'f2\'f7\'e8\'ea\'e0\loch\f39 \hich\f39 \'e4\'eb\'ff\loch\f39 \hich\f39 \'e2\'fb
+\'e4\'e5\'eb\'e5\'ed\'ed\'fb\'f5\loch\f39 \hich\f39 \'e0\'e4\'f0\'e5\'f1\'ee\'e2\loch\f39 \hich\f39 , \'e7\'e0\'f2\'e5\'ec\loch\f39 \hich\f39 \'e4\'e0\'f2\'fc\loch\f39 \loch\af39\dbch\af31505\hich\f39 \'ea\'ee\'ec\'e0\'ed\'e4\'f3\loch\f39 nocount}{
+\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 in}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \hich\af39\dbch\af31505\loch\f39 \hich\f39 , \'f7\'f2\'ee
+\'e1\'fb\loch\f39 \hich\f39 \'e8\'f5\loch\f39 \hich\f39 \'f2\'f0\'e0\'f4\'e8\'ea\loch\f39 \hich\f39 \'ed\'e5\loch\f39 \hich\f39 \'ef\'ee\'ef\'e0\'e4\'e0\'eb\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ee\'f1\'f2\'e0\'eb\'fc\'ed\'ee\'e9.
+\par \loch\af39\dbch\af31505\hich\f39 \'cf\'f0\'e0\'e2\'e8\'eb\'e0\loch\f39 \hich\f39 countin \'e8\loch\f39 \hich\f39 nocountin \'ee\'e1\'f0\'e0\'e1\'e0\'f2\'fb\'e2\'e0\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'e2\loch\f39 \hich\f39 \'ef\'ee\'f0\'ff\'e4\'ea\'e5
+\loch\f39 \hich\f39 \'ee\'f7\'e5\'f0\'e5\'e4\'e8\loch\f39 \hich\f39 \'e4\'ee\loch\f39 \hich\f39 \'ef\'e5\'f0\'e2\'ee\'e3\'ee\loch\f39 \hich\f39 \'ef\'f0\'e0\'e2\'e8\'eb\'e0\loch\f39 nocountin/nocountout.
+\par
+\par }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 20. }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'cf\'f0\'e8\loch\f39 \hich\f39 \'e0
+\'e2\'f2\'ee\'f0\'e8\'e7\'e0\'f6\'e8\'e8\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 strong}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ef\'e5\'f0\'e8\'ee\'e4\'e8\'f7\'e5\'f1\'ea\'e8\loch\f39 \hich\f39 \'ef\'f0
+\'e8\loch\f39 \hich\f39 \'e7\'e0\'e3\'f0\'f3\'e7\'ea\'e5\loch\f39 \hich\f39 \'f1\'f2\'f0\'e0\'ed\'e8\'f6\loch\f39 \hich\f39 \'ef\'ee\'ff\'e2\'eb\'ff\'fe\'f2\'f1\'ff\loch\f39 \hich\f39 \'ee\'ea\'ed\'e0\loch\f39 \hich\f39 \'e7\'e0\'ef\'f0\'ee\'f1\'e0
+\loch\f39 \hich\f39 \'eb\'ee\'e3\'e8\'ed\'e0-\'ef\'e0\loch\af39\dbch\af31505\hich\f39 \'f0\'ee\'eb\'ff\loch\f39 \hich\f39 . \'ca\'e0\'ea\loch\f39 \hich\f39 \'e8\'e7\'e1\'e0\'e2\'e8\'f2\'fc\'f1\'ff\loch\f39 ?
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'cf\'ee\'ef\'f0\'ee\'e1\'f3\'e9\'f2\'e5\loch\f39 \hich\f39 \'ef\'ee\'f1\'eb\'e5\loch\f39 \hich\f39 \'e2\'f1\'e5\'f5\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0
+\f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 allow}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0
+\f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ef\'ee\'f1\'f2\'e0\'e2\'e8\'f2\'fc\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 deny}{
+\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 *}{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 .
+\par \hich\af39\dbch\af31505\loch\f39 \hich\f39 - \'c8\'f1\'ef\'ee\'eb\'fc\'e7\'f3\'e9\'f2\'e5\loch\f39 \hich\f39 \'ee\'ef\'f6\'e8\'fe\loch\f39 }{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 -}{\rtlch\fcs1 \af1\afs20
+\ltrch\fcs0 \f1\fs20\cf1\lang1033\langfe1049\langnp1033\insrsid11355186 \hich\af1\dbch\af31505\loch\f1 n}{\rtlch\fcs1 \af1\afs20 \ltrch\fcs0 \f1\fs20\cf1\insrsid11355186\charrsid3764488 \hich\af1\dbch\af31505\loch\f1 }{\rtlch\fcs1 \af39\afs20
+\ltrch\fcs0 \f39\fs20\cf1\insrsid11355186 \loch\af39\dbch\af31505\hich\f39 \'ef\'f0\'e8\loch\f39 \hich\f39 \'e7\'e0\'ef\'f3\'f1\'ea\'e5\loch\f39 \hich\f39 \'ef\'f0\'ee\'ea\'f1\'e8.
+\par
+\par }\pard \ltrpar\ql \li0\ri0\nowidctlpar\wrapdefault\hyphpar0\faauto\rin0\lin0\itap0 {\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\kerning1\insrsid11355186
+\par
+\par }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488 \loch\af39\dbch\af31505\hich\f39 \'a9\loch\f39 2006-2010 by Kurmaeff Halit
+\par \hich\af39\dbch\af31505\loch\f39 }{\rtlch\fcs1 \af39\afs20 \ltrch\fcs0 \f39\fs20\lang1033\langfe1049\kerning1\langnp1033\insrsid11355186\charrsid3764488
+\par }{\*\themedata 504b030414000600080000002100e9de0fbfff0000001c020000130000005b436f6e74656e745f54797065735d2e786d6cac91cb4ec3301045f748fc83e52d4a
+9cb2400825e982c78ec7a27cc0c8992416c9d8b2a755fbf74cd25442a820166c2cd933f79e3be372bd1f07b5c3989ca74aaff2422b24eb1b475da5df374fd9ad
+5689811a183c61a50f98f4babebc2837878049899a52a57be670674cb23d8e90721f90a4d2fa3802cb35762680fd800ecd7551dc18eb899138e3c943d7e503b6
+b01d583deee5f99824e290b4ba3f364eac4a430883b3c092d4eca8f946c916422ecab927f52ea42b89a1cd59c254f919b0e85e6535d135a8de20f20b8c12c3b0
+0c895fcf6720192de6bf3b9e89ecdbd6596cbcdd8eb28e7c365ecc4ec1ff1460f53fe813d3cc7f5b7f020000ffff0300504b030414000600080000002100a5d6
+a7e7c0000000360100000b0000005f72656c732f2e72656c73848fcf6ac3300c87ef85bd83d17d51d2c31825762fa590432fa37d00e1287f68221bdb1bebdb4f
+c7060abb0884a4eff7a93dfeae8bf9e194e720169aaa06c3e2433fcb68e1763dbf7f82c985a4a725085b787086a37bdbb55fbc50d1a33ccd311ba548b6309512
+0f88d94fbc52ae4264d1c910d24a45db3462247fa791715fd71f989e19e0364cd3f51652d73760ae8fa8c9ffb3c330cc9e4fc17faf2ce545046e37944c69e462
+a1a82fe353bd90a865aad41ed0b5b8f9d6fd010000ffff0300504b0304140006000800000021006b799616830000008a0000001c0000007468656d652f746865
+6d652f7468656d654d616e616765722e786d6c0ccc4d0ac3201040e17da17790d93763bb284562b2cbaebbf600439c1a41c7a0d29fdbd7e5e38337cedf14d59b
+4b0d592c9c070d8a65cd2e88b7f07c2ca71ba8da481cc52c6ce1c715e6e97818c9b48d13df49c873517d23d59085adb5dd20d6b52bd521ef2cdd5eb9246a3d8b
+4757e8d3f729e245eb2b260a0238fd010000ffff0300504b030414000600080000002100a55e7d2dc7060000d71b0000160000007468656d652f7468656d652f
+7468656d65312e786d6cec59cf6e1b4518bf23f10ea3bdb7b113278da33a55ecd80db469a3d82dea71bc1eef4e33bbb39a1927f5ad4a8f482044411ca8045c38
+2020528bb8b4efe03e43a0088ad457e09b99ddf54ebca1491b4105cd21de9dfd7dffffcc37bb172fdd8918da2542521e37bceaf98a8748ecf3018d838677a3d7
+39b7ec21a9703cc08cc7a4e18d89f42eadbefbce45bca242121104f4b15cc10d2f542a59999b933e2c63799e27248667432e22ace05604730381f7806fc4e6e6
+2b95a5b908d3d843318e80ede49bc94f93c79303747d38a43ef15633fe6d06426225f582cf4457732719d1d74ff72707932793479383a777e1fa09fc7e6c6807
+3b554d21c7b2c504dac5ace181e801dfeb913bca430c4b050f1a5ec5fc7973ab17e7f04a4ac4d431b405ba8ef94be95282c1cebc9129827e2eb4daa9d52face7
+fc0d80a9595cbbdd6eb5ab393f03c0be0f965b5d8a3c6b9de56a33e35900d9cb59deadca62a5e6e20bfc176674ae379bcdc57aaa8b656a40f6b236835fae2cd5
+d6e61dbc0159fce20cbed65c6bb5961cbc0159fcd20cbe73a1be5473f10614321aefcca075403b9d947b0e1972b6510a5f06f87225854f51900d79b66911431e
+ab93e65e846f73d101024dc8b0a23152e3840cb10f89dec2515f50ac05e215820b4fec922f6796b46c247d4113d5f0de4f3014cd94df8bc7dfbf78fc101dee3f
+3adcfff9f0debdc3fd1f2d23876a03c74191eaf9b79ffcf9e02efae3e157cfef7f568e9745fcaf3f7cf8cb934fcb81504e53759e7d7ef0dba383675f7cf4fb77
+f74be06b02f78bf01e8d8844d7c81edae6111866bce26a4efae27414bd10d322c55a1c481c632da5847f5b850efada18b3343a8e1e4de27af0a680765206bc3c
+baed28dc0dc548d112c957c2c8016e72ce9a5c947ae18a965570736f1407e5c2c5a888dbc678b74c760bc74e7cdba304fa6a96968ee1ad90386a6e311c2b1c90
+9828a49ff11d424aacbb45a9e3d74dea0b2ef950a15b1435312d75498ff69d6c9a126dd008e2322eb319e2edf866f3266a725666f53ad975915015989528df23
+cc71e3653c52382a63d9c3112b3afc2a56619992ddb1f08bb8b65410e980308eda03226519cd7501f616827e0543072b0dfb261b472e5228ba53c6f32ae6bc88
+5ce73bad10474919b64be3b0887d4fee408a62b4c555197c93bb15a2ef210e383e36dc372971c2fdf26e7083068e4ad304d14f46a22496970977f2b73b66434c
+4cab8126eff4ea88c67fd7b81985ce6d259c5de38656f9eccb07257abfa92d7b0d76afb29ad938d2a88fc31d6dcf2d2e06f4cdefceeb78146f112888d92dea6d
+737edb9cbdff7c733eae9ecfbe254fbb3034683d8bd8c1db8ce1d189a7f02165acabc68c5c95661097b0170d3ab0a8f998432ac94f69490897bab241a0830b04
+36344870f501556137c4090cf1554f330964ca3a9028e1120e9366b994b7c6c34140d9a3e8a23ea4d84e22b1dae403bbbca097b3b348cec66815980370266841
+3338a9b0850b2953b0ed558455b55227965635aa9926e948cb4dd62e36877870796e1a2ce6de842107c168045e5e82d7045a341c7e302303ed771ba32c2c260a
+67192219e2014963a4ed9e8d51d50429cb951943b41d3619f4c1f2255e2b48ab6bb6af21ed24412a8aab1d232e8bdeeb4429cbe0699480dbd1726471b138598c
+f61a5e7d717ed1433e4e1ade10cecd7019251075a9e74acc02783fe52b61d3fea5c56caa7c1acd7a66985b0455783562fd3e63b0d3071221d53a96a14d0df328
+4d01166b4956fff94570eb591950d28d4ea6c5c23224c3bfa605f8d10d2d190e89af8ac12eac68dfd9dbb495f29122a21b0ef6509f8dc43686f0eb54057b0654
+c2eb0fd311f40dbcbbd3de368fdce69c165df18d99c1d975cc9210a7ed56976856c9166e1a52ae83b92ba807b695ea6e8c3bbd29a6e4cfc894621affcf4cd1fb
+09bc8d5818e808f8f0365960a42ba5e171a1420e5d2809a9df11304898de01d902ef7fe1312415bcd336bf82ecea5f5b739687296b3854aa6d1a2041613f52a1
+20640bda92c9be9730aba67b9765c9524626a30aeacac4aadd27bb84f5740f5cd27bbb87424875d34dd236607047f3cfbd4f2ba81fe821a7586f4e27cbf75e5b
+03fff4e4638b198c72fbb0196832ffe72ae6e3c17457b5f4863cdb7b8b86e807d331ab965505082b6c05f5b4ec5f5185536eb5b663cd583cbf982907519cb518
+16f3812881774a48ff83fd8f0a9fd9af237a43edf16de8ad083e6e6866903690d5e7ece0817483b48b7d189ceca24d26cdcaba361d9db4d7b2cdfa8c27dd5cee
+11676bcd4e12ef533a3b1fce5c714e2d9ea5b3530f3bbeb66bc7ba1a227bb4446169981d6c4c60cc97b5e2972fdebf0d815e876f0823a6a44926f88e2530ccd0
+5d530750fc56a2215dfd0b0000ffff0300504b0304140006000800000021000dd1909fb60000001b010000270000007468656d652f7468656d652f5f72656c73
+2f7468656d654d616e616765722e786d6c2e72656c73848f4d0ac2301484f78277086f6fd3ba109126dd88d0add40384e4350d363f2451eced0dae2c082e8761
+be9969bb979dc9136332de3168aa1a083ae995719ac16db8ec8e4052164e89d93b64b060828e6f37ed1567914b284d262452282e3198720e274a939cd08a54f9
+80ae38a38f56e422a3a641c8bbd048f7757da0f19b017cc524bd62107bd5001996509affb3fd381a89672f1f165dfe514173d9850528a2c6cce0239baa4c04ca
+5bbabac4df000000ffff0300504b01022d0014000600080000002100e9de0fbfff0000001c0200001300000000000000000000000000000000005b436f6e7465
+6e745f54797065735d2e786d6c504b01022d0014000600080000002100a5d6a7e7c0000000360100000b00000000000000000000000000300100005f72656c73
+2f2e72656c73504b01022d00140006000800000021006b799616830000008a0000001c00000000000000000000000000190200007468656d652f7468656d652f
+7468656d654d616e616765722e786d6c504b01022d0014000600080000002100a55e7d2dc7060000d71b00001600000000000000000000000000d60200007468
+656d652f7468656d652f7468656d65312e786d6c504b01022d00140006000800000021000dd1909fb60000001b0100002700000000000000000000000000d10900007468656d652f7468656d652f5f72656c732f7468656d654d616e616765722e786d6c2e72656c73504b050600000000050005005d010000cc0a00000000}
+{\*\colorschememapping 3c3f786d6c2076657273696f6e3d22312e302220656e636f64696e673d225554462d3822207374616e64616c6f6e653d22796573223f3e0d0a3c613a636c724d
+617020786d6c6e733a613d22687474703a2f2f736368656d61732e6f70656e786d6c666f726d6174732e6f72672f64726177696e676d6c2f323030362f6d6169
+6e22206267313d226c743122207478313d22646b3122206267323d226c743222207478323d22646b322220616363656e74313d22616363656e74312220616363
+656e74323d22616363656e74322220616363656e74333d22616363656e74332220616363656e74343d22616363656e74342220616363656e74353d22616363656e74352220616363656e74363d22616363656e74362220686c696e6b3d22686c696e6b2220666f6c486c696e6b3d22666f6c486c696e6b222f3e}
+{\*\latentstyles\lsdstimax267\lsdlockeddef0\lsdsemihiddendef1\lsdunhideuseddef1\lsdqformatdef0\lsdprioritydef99{\lsdlockedexcept \lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority0 \lsdlocked0 Normal;
+\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority9 \lsdlocked0 heading 1;\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 2;\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 3;\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 4;
+\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 5;\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 6;\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 7;\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 8;\lsdqformat1 \lsdpriority9 \lsdlocked0 heading 9;
+\lsdpriority39 \lsdlocked0 toc 1;\lsdpriority39 \lsdlocked0 toc 2;\lsdpriority39 \lsdlocked0 toc 3;\lsdpriority39 \lsdlocked0 toc 4;\lsdpriority39 \lsdlocked0 toc 5;\lsdpriority39 \lsdlocked0 toc 6;\lsdpriority39 \lsdlocked0 toc 7;
+\lsdpriority39 \lsdlocked0 toc 8;\lsdpriority39 \lsdlocked0 toc 9;\lsdqformat1 \lsdpriority35 \lsdlocked0 caption;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority10 \lsdlocked0 Title;\lsdpriority1 \lsdlocked0 Default Paragraph Font;
+\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority11 \lsdlocked0 Subtitle;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority22 \lsdlocked0 Strong;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority20 \lsdlocked0 Emphasis;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority59 \lsdlocked0 Table Grid;\lsdunhideused0 \lsdlocked0 Placeholder Text;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority1 \lsdlocked0 No Spacing;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority60 \lsdlocked0 Light Shading;\lsdsemihidden0 \lsdunhideused0 \lsdpriority61 \lsdlocked0 Light List;\lsdsemihidden0 \lsdunhideused0 \lsdpriority62 \lsdlocked0 Light Grid;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority63 \lsdlocked0 Medium Shading 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority64 \lsdlocked0 Medium Shading 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority65 \lsdlocked0 Medium List 1;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority66 \lsdlocked0 Medium List 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority67 \lsdlocked0 Medium Grid 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority68 \lsdlocked0 Medium Grid 2;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority69 \lsdlocked0 Medium Grid 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority70 \lsdlocked0 Dark List;\lsdsemihidden0 \lsdunhideused0 \lsdpriority71 \lsdlocked0 Colorful Shading;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority72 \lsdlocked0 Colorful List;\lsdsemihidden0 \lsdunhideused0 \lsdpriority73 \lsdlocked0 Colorful Grid;\lsdsemihidden0 \lsdunhideused0 \lsdpriority60 \lsdlocked0 Light Shading Accent 1;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority61 \lsdlocked0 Light List Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority62 \lsdlocked0 Light Grid Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 1;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority65 \lsdlocked0 Medium List 1 Accent 1;\lsdunhideused0 \lsdlocked0 Revision;
+\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority34 \lsdlocked0 List Paragraph;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority29 \lsdlocked0 Quote;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority30 \lsdlocked0 Intense Quote;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority66 \lsdlocked0 Medium List 2 Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 1;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority70 \lsdlocked0 Dark List Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority71 \lsdlocked0 Colorful Shading Accent 1;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority72 \lsdlocked0 Colorful List Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority73 \lsdlocked0 Colorful Grid Accent 1;\lsdsemihidden0 \lsdunhideused0 \lsdpriority60 \lsdlocked0 Light Shading Accent 2;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority61 \lsdlocked0 Light List Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority62 \lsdlocked0 Light Grid Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 2;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority65 \lsdlocked0 Medium List 1 Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority66 \lsdlocked0 Medium List 2 Accent 2;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 2;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority70 \lsdlocked0 Dark List Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority71 \lsdlocked0 Colorful Shading Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority72 \lsdlocked0 Colorful List Accent 2;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority73 \lsdlocked0 Colorful Grid Accent 2;\lsdsemihidden0 \lsdunhideused0 \lsdpriority60 \lsdlocked0 Light Shading Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority61 \lsdlocked0 Light List Accent 3;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority62 \lsdlocked0 Light Grid Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 3;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority65 \lsdlocked0 Medium List 1 Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority66 \lsdlocked0 Medium List 2 Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 3;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority70 \lsdlocked0 Dark List Accent 3;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority71 \lsdlocked0 Colorful Shading Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority72 \lsdlocked0 Colorful List Accent 3;\lsdsemihidden0 \lsdunhideused0 \lsdpriority73 \lsdlocked0 Colorful Grid Accent 3;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority60 \lsdlocked0 Light Shading Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority61 \lsdlocked0 Light List Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority62 \lsdlocked0 Light Grid Accent 4;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority65 \lsdlocked0 Medium List 1 Accent 4;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority66 \lsdlocked0 Medium List 2 Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 4;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority70 \lsdlocked0 Dark List Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority71 \lsdlocked0 Colorful Shading Accent 4;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority72 \lsdlocked0 Colorful List Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority73 \lsdlocked0 Colorful Grid Accent 4;\lsdsemihidden0 \lsdunhideused0 \lsdpriority60 \lsdlocked0 Light Shading Accent 5;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority61 \lsdlocked0 Light List Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority62 \lsdlocked0 Light Grid Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 5;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority65 \lsdlocked0 Medium List 1 Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority66 \lsdlocked0 Medium List 2 Accent 5;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 5;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority70 \lsdlocked0 Dark List Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority71 \lsdlocked0 Colorful Shading Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority72 \lsdlocked0 Colorful List Accent 5;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority73 \lsdlocked0 Colorful Grid Accent 5;\lsdsemihidden0 \lsdunhideused0 \lsdpriority60 \lsdlocked0 Light Shading Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority61 \lsdlocked0 Light List Accent 6;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority62 \lsdlocked0 Light Grid Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 6;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority65 \lsdlocked0 Medium List 1 Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority66 \lsdlocked0 Medium List 2 Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 6;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority70 \lsdlocked0 Dark List Accent 6;
+\lsdsemihidden0 \lsdunhideused0 \lsdpriority71 \lsdlocked0 Colorful Shading Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority72 \lsdlocked0 Colorful List Accent 6;\lsdsemihidden0 \lsdunhideused0 \lsdpriority73 \lsdlocked0 Colorful Grid Accent 6;
+\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority19 \lsdlocked0 Subtle Emphasis;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority21 \lsdlocked0 Intense Emphasis;
+\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority31 \lsdlocked0 Subtle Reference;\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority32 \lsdlocked0 Intense Reference;
+\lsdsemihidden0 \lsdunhideused0 \lsdqformat1 \lsdpriority33 \lsdlocked0 Book Title;\lsdpriority37 \lsdlocked0 Bibliography;\lsdqformat1 \lsdpriority39 \lsdlocked0 TOC Heading;}}{\*\datastore 010500000200000018000000
+4d73786d6c322e534158584d4c5265616465722e362e3000000000000000000000060000
+d0cf11e0a1b11ae1000000000000000000000000000000003e000300feff090006000000000000000000000001000000010000000000000000100000feffffff00000000feffffff0000000000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+fffffffffffffffffdfffffffeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffff52006f006f007400200045006e00740072007900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000016000500ffffffffffffffffffffffff0c6ad98892f1d411a65f0040963251e5000000000000000000000000002c
+52e2b63dcc01feffffff00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffff00000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000
+000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffff000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000105000000000000}}
\ No newline at end of file
diff --git a/doc/ru/example1.txt b/doc/ru/example1.txt
new file mode 100644
index 0000000..4f7df15
--- /dev/null
+++ b/doc/ru/example1.txt
@@ -0,0 +1,99 @@
+KOI8-R
+
+Kirill Lopuchov, lopuchov at mail ru
+
+<3proxy>
+äÏ×ÏÌØÎÏ ÞÁÓÔÏ ÐÅÒÅÄ ÓÉÓÔÅÍÎÙÍ ÁÄÍÉÎÉÓÔÒÁÔÏÒÏÍ ×ÓÔÁÅÔ ÚÁÄÁÞÁ ÐÒÅÄÏÓÔÁ×ÉÔØ ÄÏÓÔÕÐ Ë Internet-ÒÅÓÕÒÓÁÍ ÇÒÕÐÐÅ ÐÏÌØÚÏ×ÁÔÅÌÅÊ (ÎÅÂÏÌØÛÏÊ ÏÆÉÓ, Internet-ËÁÆÅ). äÁÎÎÕÀ ÚÁÄÁÞÕ ÍÏÖÎÏ ÒÅÛÉÔØ, ÎÁÓÔÒÏÉ× ÎÁ Internet-ÛÌÀÚÅ proxy-ÓÅÒ×ÅÒ, ÓÌÕÖÂÕ NAT (ÔÒÁÎÓÌÑÃÉÑ ÓÅÔÅ×ÙÈ ÁÄÒÅÓÏ×) ÉÌÉ ÒÁÚÄÁÔØ ËÁÖÄÏÍÕ ÐÏÌØÚÏ×ÁÔÅÌÀ ÒÅÁÌØÎÙÊ IP ÁÄÒÅÓ.
+
+äÁ×ÁÊÔÅ ÒÁÓÓÍÏÔÒÉÍ ÓÁÍÙÊ ÐÒÏÓÔÏÊ ÓÐÏÓÏ ÐÏÄËÌÀÞÅÎÉÑ - ÕÓÔÁÎÏ×ËÕ proxy-ÓÅÒ×ÅÒÁ. ôÒÁÄÉÃÉÏÎÎÏ ÄÌÑ ÜÔÉÈ ÃÅÌÅÊ ÐÒÉÍÅÎÑÅÔÓÑ ÐÏÐÕÌÑÒÎÙÊ proxy Squid, ÎÏ ÎÅ ×ÓÅÇÄÁ ÂÙ×ÁÅÔ ÎÅÏÂÈÏÄÉÍÏÓÔØ × ÓÔÏÌØ ÔÑÖÅÌÏ×ÁÔÏÊ ÐÒÏÇÒÁÍÍÅ :), ÄÁ É × squid ÏÔÓÕÔÓÔ×ÕÀÔ ÔÁËÉÅ ÉÎÏÇÄÁ ÎÅÏÂÈÏÄÉÍÙÅ ×ÅÝÉ ËÁË SOCKS4/5-ÓÅÒ×ÅÒ, TCP/UP ÐÏÒÔ-ÍÁÐÐÉÎÇ. ðÏÜÔÏÍÕ ×ÔÏÒÙÍ ÎÏÍÅÒÏÍ ÈÏÞÅÔÓÑ ÐÒÅÄÓÔÁ×ÉÔØ ×ÁÛÅÍÕ ×ÎÉÍÁÎÉÀ PROXY-ÓÅÒ×ÅÒ, ÐÏÄ ÎÁÚ×ÁÎÉÅÍ "3proxy" (http://3proxy.ru/), ÒÁÚÒÁÂÏÔÁÎÎÙÊ ÎÁÛÉÍ ÐÒÏÇÒÁÍÍÉÓÔÏÍ ÉÚ Ç. îÉÖÎÉÊ îÏ×ÇÏÒÏÄ. ïÄÎÉÍ ÉÚ ÇÌÁ×ÎÙÈ ÅÇÏ ÄÏÓÔÏÉÎÓÔ× Ñ×ÌÑÅÔÓÑ ËÏÍÐÁËÔÎÏÓÔØ É ×ÙÓÏËÁÑ ÐÅÒÅÎÏÓÉÍÏÓÔØ. ëÏÄ ÓÅÒ×ÅÒÁ ÎÁÐÉÓÁÎ ÔÁË, ÞÔÏ ÌÅÇËÏ ËÏÍÐÉÌÉÒÕÅÔÓÑ ËÁË ÄÌÑ Win9x/2000/XP ÔÁË É ÄÌÑ Linux É FreeBSD.
+
+óÅÒ×ÅÒ ÐÏÄÄÅÒÖÉ×ÁÅÔ ÓÌÅÄÕÀÝÉÅ ×ÏÚÍÏÖÎÏÓÔÉ:
+
+HTTP(S) proxy;
+FTP over HTTP proxy;
+SOCKS4/5 proxy;
+POP3 proxy;
+TCP & UDP ÍÁÐÐÉÎÇ ÐÏÒÔÏ×;
+ÌÉÓÔÙ ÄÏÓÔÕÐÁ Ë ÒÁÚÌÉÞÎÙÍ ÓÌÕÖÂÁÍ É ÁÄÒÅÓÁÍ;
+ÏÇÒÁÎÉÞÅÎÉÅ ÐÒÏÐÕÓËÎÏÊ ÓÐÏÓÏÂÎÏÓÔÉ ËÁÎÁÌÁ ËÁÖÄÏÇÏ ÐÏÌØÚÏ×ÁÔÅÌÑ (ÞÔÏÂÙ ÐÏÌØÚÏ×ÁÔÅÌØ ÎÅ ÓßÅÌ ×ÅÓØ ËÁÎÁÌ, ËÁÞÁÑ ËÕÞÕ ÆÁÊÌÏ× × ÎÅÓËÏÌØËÏ ÐÏÔÏËÏ× :) );
+ÏÇÒÁÎÉÞÅÎÉÅ ÔÒÁÆÉËÁ ÐÏÌØÚÏ×ÁÔÅÌÑ ÎÁ ÄÅÎØ, ÎÅÄÅÌÀ É ÍÅÓÑÃ;
+Á×ÔÏÒÉÚÁÃÉÀ ÐÏÌØÚÏ×ÁÔÅÌÅÊ ËÏ ×ÓÅÍ proxy-ÓÌÕÖÂÁÍ ÐÏ ÉÍÅÎÉ É ÐÁÒÏÌÀ ÉÌÉ ÐÏ ip ÁÄÒÅÓÁÍ;
+×ÅÄÅÎÉÅ ÖÕÒÎÁÌÏ× ÞÅÒÅÚ ODBC (ÐÏ-ÍÏÅÍÕ, ÔÁËÏÇÏ ÎÅÔ ÎÉ × ÏÄÎÏÍ proxy) É syslog É Ô. Ä.
+
+ë ÎÅÄÏÓÔÁÔËÁÍ ÍÏÖÎÏ ÏÔÎÅÓÔÉ ÏÔÓÕÔÓÔ×ÉÅ ËÜÛÉÒÏ×ÁÎÉÑ ÉÎÆÏÒÍÁÃÉÉ :-|. îÏ × ÐÏÓÌÅÄÎÅÅ ×ÒÅÍÑ Inernet-ËÏÎÔÅÎÔ ÓÔÁÎÏ×ÉÔÓÑ ×ÓÅ ÂÏÌÅÅ ÄÉÎÁÍÉÞÎÙÍ (ÔÏ ÅÓÔØ ÎÅ ÐÏÄÄÁÀÝÉÊÓÑ ËÜÛÉÒÏ×ÁÎÉÀ) É ÍÏÖÅÔ ÂÙÔØ ÄÌÑ ËÏÇÏ-ÔÏ ÜËÏÎÏÍÉÑ × 25% ÔÒÁÆÉËÁ ÚÁ ÓÞÅÔ ÅÇÏ ËÜÛÉÒÏ×ÁÎÉÑ ÎÅ ÂÕÄÅÔ ÓÔÏÌØ ËÒÉÔÉÞÎÁ. äÌÑ ÔÅÈ ÐÏÌØÚÏ×ÁÔÅÌÅÊ, ËÏÍÕ ÏÎÁ ÍÏÖÅÔ ÏËÁÚÁÔØÓÑ ËÒÉÔÉÞÎÏÊ, Á×ÔÏÒ ÐÒÅÄÌÁÇÁÅÔ ÉÓÐÏÌØÚÏ×ÁÔØ ÃÅÐÏÞËÕ ÉÚ 2-È ÓÅÒ×ÅÒÏ× É × ËÁÞÅÓÔ×Å ËÜÛÁ ÔÁËÉÅ ÓÅÒ×ÅÒÁ ËÁË wwwoffle ÉÌÉ ÉÍ ÐÏÄÏÂÎÙÅ, ÌÉÂÏ ÖÄÁÔØ ÐÏÑ×ÌÅÎÉÑ ÐÏÄÄÅÒÖËÉ ËÅÛÁ × 3proxy :)
+
+õÓÔÁÎÏ×ËÁ
+
+# wget http://3proxy.ru/current/3proxy.tgz
+# tar -xvzf 3proxy.tgz
+# cd 3proxy
+# make -f Makefile.unix
+# mkdir /usr/local/3proxy
+# mkdir /usr/local/3proxy/logs
+# mkdir /usr/local/3proxy/stat
+# cp src/3proxy /usr/local/3proxy
+# touch /usr/local/3proxy/3proxy.cfg
+# chown -R nobody:nogroup /usr/local/3proxy
+
+äÁÌÅÅ ÐÒÉ×ÅÄÕ ÎÅÂÏÌØÛÏÊ ÐÒÉÍÅÒ ËÏÎÆÉÇÕÒÁÃÉÏÎÎÏÇÏ ÆÁÊÌÁ 3proxy.cfg Ó
+ËÏÍÍÅÎÔÁÒÉÑÍÉ, ÂÏÌÅÅ ÐÏÄÒÏÂÎÕÀ ÉÎÆÏÒÍÁÃÉÀ ÐÏ ËÏÎÆÉÇÕÒÉÒÏ×ÁÎÉÀ ÍÏÖÎÏ
+ÎÁÊÔÉ ÆÁÊÌÅ 3proxy.cfg.sample ÉÌÉ ×
+HowTo http://3proxy.ru/howtor.asp
+É FAQ http://3proxy.ru/faqr.asp
+
+-------------3proxy.cfg-------------
+# ÷îéíáîéå !! ÎÅ ÄÏÌÖÎÙ ÂÙÔØ ÐÒÏÂÅÌÏ×
+# ÐÅÒÅÄ ÌÀÂÙÍÉ ÏÐÃÉÑÍÉ ËÏÎÆÉÇÕÒÁÃÉÉ !!
+
+# ip-ÁÄÒÅÓ DNS-ÓÅÒ×ÅÒÁ ÐÒÏ×ÁÊÄÅÒÁ ÉÌÉ ÌÏËÁÌØÎÏÇÏ
+nserver 127.0.0.1
+timeouts 1 5 30 60 180 1800 15 60
+
+# óÏÚÄÁÅÍ Ä×ÕÈ ÐÏÌØÚÏ×ÁÔÅÌÅÊ vasia, petia É vova
+# É ÎÁÚÎÁÞÁÅÍ ÉÍ ÐÁÒÏÌÉ 24555, 14656 É 45455 ÓÏÏÔ×ÅÔÓÔ×ÅÎÎÏ
+users vasia:CL:24555
+users petia:CL:14656
+users vova:CL:45455
+
+# ìÏÇ-ÆÁÊÌ ÓÏ ÓÐÉÓËÏÍ ÚÁÐÒÏÓÏ× ÐÏÌØÚÏ×ÁÔÅÌÅÊ
+# ÂÕÄÅÔ ÓÏÚÄÁ×ÁÔØÓÑ ËÁÖÄÙÊ ÄÅÎØ ÎÏ×ÙÊ
+log /usr/local/3proxy/logs/3proxy.log D
+logformat "%d-%m-%Y %H:%M:%S %U %C:%c %R:%r %O %I %T"
+
+# ÷ÎÅÛÎÉÊ ÉÎÔÅÒÆÅÊÓ,
+# ÞÅÒÅÚ ËÏÔÏÒÙÊ ÂÕÄÕÔ ÕÈÏÄÉÔØ ÚÁÐÒÏÓÙ ÏÔ ÓÅÒ×ÅÒÁ
+external 10.1.1.1
+
+# ip-ÁÄÒÅÓ ÉÎÔÅÒÆÅÊÓÁ, ÎÁ ËÏÔÏÒÏÍ ÂÕÄÕÔ ÐÒÉÎÉÍÁÔØÓÑ
+# ÚÁÐÒÏÓÙ ÏÔ ËÌÉÅÎÔÏ×
+internal 192.168.1.1
+
+# õÓÔÁÎÁ×ÌÉ×ÁÅÍ ÔÉÐ Á×ÔÏÒÉÚÁÃÉÉ ÐÏ ÉÍÅÎÉ É ÐÁÒÏÌÀ
+auth strong
+# òÁÚÒÅÛÁÅÍ ÄÏÓÔÕÐ Ë ÐÏÒÔÁÍ 80,8080-8088
+allow * * * 80,8080-8088
+# òÁÓÓËÏÍÅÎÔÉÒÏ×ÁÔØ ÓÅËÃÉÀ parent, ÅÓÌÉ Õ ×ÁÓ ÅÓÔØ ÐÒÏËÓÉ ×ÅÒÈÎÅÇÏ
+# ÕÒÏ×ÎÑ É ÚÁÍÅÎÉÔØ ip, ÐÏÒÔ, ÉÍÑ ÐÏÌØÚÏ×ÁÔÅÌÑ É ÐÁÒÏÌØ ÎÁ Ó×ÏÉ ÚÎÁÞÅÎÉÑ
+# parent 1000 http 192.168.0.1 8080 username passwd
+# allow *
+# úÁÐÕÓËÁÅÍ ÓÌÕÖÂÕ HTTP-proxy ÎÁ ÐÏÒÔÕ (3128) É
+# (-n) c ÏÔËÌÀÞÅÎÎÏÊ NTLM-Á×ÔÏÒÉÚÁÃÉÅÊ)
+proxy -p3128 -n
+
+# ïÇÒÁÎÉÞÉ×ÁÅÍ ÔÏÌÛÉÎÕ ËÁÎÁÌÁ ÄÌÑ ÐÏÌØÚÏ×ÁÔÅÌÅÊ
+# vasia É petia × 20000 bps,
+# Á ÄÌÑ vova 10000 bps
+bandlimin 20000 vasia,petia
+bandlimin 10000 vova
+
+# úÁÐÕÓËÁÅÍ ÓÅÒ×ÅÒ ÏÔ ÐÏÌØÚÏ×ÁÔÅÌÑ nobody
+# (×ÏÚÍÏÖÎÏ × ×ÁÛÅÊ ïó uid É gid ÐÏÌØÚÏ×ÁÔÅÌÑ nobody
+# ÂÕÄÕÔ ÄÒÕÇÉÍÉ. äÌÑ ÉÈ ÏÐÒÅÄÅÌÅÎÉÑ ×ÏÓÐÏÌØÚÕÊÔÅÓØ ËÏÍÍÁÎÄÏÊ id nobody)
+setgid 65534
+setuid 65534
+------------------------------------
+
+ðÏÓÌÅ ÔÏÇÏ ËÁË ÍÙ ÓÏÚÄÁÌÉ ËÏÎÆÉÇÕÒÁÃÉÏÎÎÙÊ ÆÁÊÌ ÓÅÒ×ÅÒÁ, ÚÁÐÕÓËÁÅÍ 3proxy ËÏÍÁÎÄÏÊ:
+/usr/local/3proxy/3proxy /usr/local/3proxy/3proxy.cfg
+
+$Id: example1.txt,v 1.7 2007/04/20 19:58:42 vlad Exp $
diff --git a/doc/ru/iodbc.txt b/doc/ru/iodbc.txt
new file mode 100644
index 0000000..7397978
--- /dev/null
+++ b/doc/ru/iodbc.txt
@@ -0,0 +1,101 @@
+KOI8-R
+
+Kirill Lopuchov, lopuchov at mail ru
+
+÷ÅÄÅÎÉÅ ÌÏÇÏ× ÓÅÒ×ÅÒÁ × SQL-ÂÁÚÅ ÉÍÅÅÔ Ó×ÏÉ ÐÒÉÅÍÕÝÅÓÔ×Á ÐÅÒÅÄ ÏÂÙÞÎÙÍÉ ÔÅËÓÔÏ×ÙÍÉ ÆÁÊÌÁÍÉ. 3proxy ÐÏÄÄÅÒÖÉ×ÁÅÔ ×ÅÄÅÎÉÅ ÌÏÇÏ× ÞÅÒÅÚ ODBC-ÍÅÎÅÄÖÅÒ × ÌÀÂÏÊ ÂÁÚÅ ÄÁÎÎÙÈ, ÉÍÅÀÝÉÈ ODBC-ÄÒÁÊ×ÅÒ. üÔÏÔ ÍÅÎÅÄÖÅÒ ÓÔÁÌ ÓÔÁÎÄÁÒÔÏÍ ÄÅ-ÆÁËÔÏ × ÓÒÅÄÅ Windows, ÞÅÇÏ, Ë ÓÏÖÁÌÅÎÉÀ, ÎÅ ÓËÁÖÅÛØ ÐÒÏ Unix. ðÏÜÔÏÍÕ ÄÁÌÅÅ ÒÁÓÓÍÏÔÒÉÍ ÎÁ ÐÒÉÍÅÒÅ FreeBSD ÎÁÓÔÒÏÊËÕ ×ÅÄÅÎÉÑ ÌÏÇÏ× × ÂÁÚÅ SQLite. üÔÁ ÂÁÚÁ ÄÁÎÎÙÈ ×ÙÂÒÁÎÁ × ËÁÞÅÓÔ×Å ÐÒÉÍÅÒÁ ÐÏÔÏÍÕ, ÞÔÏ ÏÎÁ ÐÒÏÓÔÁ × ÕÓÔÁÎÏ×ËÅ É ÎÁÓÔÒÏËÅ (× ÐÒÉÎÃÉÐÅ ÎÁÓÔÒÏÊËÁ ×ÅÄÅÎÉÑ ÌÏÇÏ× × ÌÀÂÏÊ ÄÒÕÇÏÊ ÂÁÚÅ mysql ÉÌÉ postgresql ÏÔÌÉÞÁÅÔÓÑ ÔÏÌØËÏ ÎÁÓÔÒÏÊËÏÊ ÅÇÏ odbc-ÄÒÁÊ×ÅÒÁ)
+
+ õÓÔÁÎÁ×ÌÉ×ÁÅÍ SQLite
+wget http://www.sqlite.org/sqlite-2.8.14.tar.gz
+tar -xvzf sqlite-2.8.14.tar.gz
+cd sqlite
+./configure
+gmake
+gmake install
+
+ õÓÔÁÎÁ×ÌÉ×ÁÅÍ iODBC ÍÅÎÅÄÖÅÒ
+wget http://www.iodbc.org/libiodbc-3.51.2.tar.gz
+tar -xvzf libiodbc-3.51.2.tar.gz
+cd libiodbc-3.51.2
+./configure --disable-gui --disable-gtktest
+make
+make install
+
+ õÓÔÁÎÁ×ÌÉ×ÁÅÍ odbc ÄÒÁÊ×ÅÒ SQLite
+wget http://www.ch-werner.de/sqliteodbc/sqliteodbc-0.62.tar.gz
+tar -xvzf sqliteodbc-0.62.tar.gz
+cd sqliteodbc-0.62
+
+./configure
+ åÓÌÉ Õ ×ÁÓ ÓËÒÉÐÔ configure ×ÙÄÁÌ ÏÛÉÂËÕ :
+ (configure: error: SQLite library too old)
+ ÔÏ ÅÅ ÍÏÖÎÏ ÐÏÐÒÏÂÏ×ÁÔØ ÏÂÏÊÔÉ, ×ÓÔÁ×É× (SQLITE_COMPILE=1
+ × ÓÔÒ. 5092 ÐÏÓÌÅ ÕÓÌÏ×ÉÑ if endif) × ÆÁÊÌÅ configure
+make
+make install
+
+
+ äÁÌÅÅ ÎÁÓÔÒÁÉ×ÁÅÍ ÚÁÐÉÓÉ ÄÌÑ iODBC ÍÅÎÅÄÖÅÒÁ ×
+ÆÁÊÌÁÈ /etc/odbcinst.ini É /etc/odbc.ini
+
+îÁÓÔÒÁÉ×ÁÅÍ odbc ÄÒÁÊ×ÅÒ
+--------------/etc/odbcinst.ini-------------
+[ODBC Drivers]
+SQLite=Installed
+
+[SQLite]
+Driver=/usr/local/lib/libsqliteodbc.so
+---------------------------------------
+
+óÏÚÄÁÅÍ DSN ÄÌÑ ÂÁÚÙ c ÉÍÅÎÅÍ "sqlite", ËÏÔÏÒÁÑ ÂÕÄÅÔ
+ÒÁÓÐÏÌÁÇÁÔØÓÑ × ËÁÔÁÌÏÇÅ: /usr/local/3proxy/logs.db
+
+--------------/etc/odbc.ini----------------
+[ODBC Data Sources]
+sqlite=SQLite
+
+[sqlite]
+Driver=/usr/local/lib/libsqliteodbc.so
+Description=SQLite test database
+Database=/usr/local/3proxy/logs.db
+# optional lock timeout in milliseconds
+Timeout=2000
+---------------------------------------
+
+óÏÚÄÁÅÍ ÂÁÚÕ ÄÌÑ ÌÏÇÏ× É ÔÁÂÌÉÃÕ × ÆÏÒÍÁÔÅ (logformat
+ÓÍ. ÏÐÉÓÁÎÉÅ × 3proxy.cfg.sample )
+
+sqlite /usr/local/3proxy/logs.db
+
+SQLite version 2.8.14
+Enter ".help" for instructions
+sqlite>create table log (
+ ...> l_date char (11),
+ ...> l_chour char (10),
+ ...> l_user char (30),
+ ...> l_service char (30),
+ ...> l_in integer,
+ ...> l_out integer,
+ ...> l_descr char (64000),
+ ...>);
+
+
+äÏÂÁ×ÌÑÅÍ ÓÌÅÄÕÀÝÉÅ ÚÁÐÉÓÉ × ËÏÎÆÉÇÕÒÁÃÉÏÎÎÙÊ ÆÁÊÌ 3proxy.cfg
+---------------3proxy.cfg-----------------
+log &sqlite
+
+logformat "Linsert into log ( l_date, l_chour, l_user, l_service, l_in, l_out,
+l_descr)
+values ('%d-%m-%Y', '%H:%M:%S', '%U', '%N', %I, %O, '%T')"
+------------------------------------------
+
+CÏÂÒÁÔØ 3proxy c ÐÏÄÄÒÅÖËÏÊ iODBC, ÄÌÑ ÜÔÏÇÏ × Makefile.unix ÐÏÍÅÎÑÔØ
+
+CFLAGS = -Wall -O2 -c -pthread -D_THREAD_SAFE -D_REENTRANT -DWITH_STD_MALLOC -I/usr/local/include
+LIBS = -L /usr/local/lib -lodbc
+
+É ÄÁÔØ ËÏÍÁÎÄÙ
+
+make clean
+make -f Makefile.unix
+
+$Id: iodbc.txt,v 1.3 2006/02/08 17:59:07 vlad Exp $
\ No newline at end of file
diff --git a/doc/ru/odbc.txt b/doc/ru/odbc.txt
new file mode 100644
index 0000000..d0ca46a
--- /dev/null
+++ b/doc/ru/odbc.txt
@@ -0,0 +1,28 @@
+Eugene: Re: 3proxy 0.6 + iODBC + PostgreSQL 22.11.2007 19:04:23
+ Íàêîíåö-òî ÿ ðàçîáðàëñÿ è çàïóñòèë.
+1. ß èñïîëüçîâàë ïàêåò unixODBC.
+2. /etc/unixODBC/odbc.ini
+[proxy]
+Description = PostgreSQL ODBC driver
+Driver = PostgreSQL ODBC driver
+Database = proxy
+ServerName = localhost
+3. /etc/unixODBC/odbcinst.ini
+[PostgreSQL ODBC driver]
+Description = PostgreSQL ODBC driver
+Driver = /usr/local/lib/psqlodbcw.so
+Setup = /usr/lib/libodbcpsqlS.so
+4. Ñîáèðàë âðó÷íóþ psqlodbc-08.02.0500, ñëèòûé ñ postgresql.org (ïîëó÷èëñÿ psqlodbcw.so).
+5. 3proxy.conf
+log &proxy,logger,123
+logformat "LINSERT INTO logger (ldatetime,username,userip,trafin,trafout,service,host,port,
+url) VALUES ('%Y-%m-%d %H:%M:%S','%U','%C',
+'%I','%O','%N',
+'%n','%r','%T');"
+
+Òî åñòü ïàðîëè è ëîãèíû â odbc.ini ïðîïèñûâàòü íå íàäî - ñèñòåìà ïàäàåò íà äðàéâåðå ODBC.
+Èñïîëüçîâàòü libiodbc òîæå íå íàäî - ñèñòåìà ïàäàåò íà libiodbc.so.
+
+Âñå âûøåñêàçàííîå ñïðàâåäëèâî äëÿ unixODBC + psqlodbc ïðîèçâîäñòâà postgresql.org, êàê ñ -DSAFESQL, òàê è áåç îíîãî.
+Ñ myodbc + unixODBC ïðîáëåì íå íàáëþäàëîñü íèêàêèõ.
+Øàìàíñòâî, â îáùåì ;)
\ No newline at end of file
diff --git a/man/3proxy.8 b/man/3proxy.8
new file mode 100644
index 0000000..4e9e712
--- /dev/null
+++ b/man/3proxy.8
@@ -0,0 +1,153 @@
+.TH 3proxy "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B 3proxy
+\- 3[APA3A] tiny proxy server, or trivial proxy server, or free proxy
+server
+.SH SYNOPSIS
+.B 3proxy
+.RI [ config_file ]
+.br
+.B 3proxy
+.RI [ \-\-install ]
+.br
+.B 3proxy
+.RI [ \-\-remove ]
+.SH DESCRIPTION
+.B 3proxy
+is universal proxy server. It can be used to provide internal users wuth
+fully controllable access to external resources or to provide external
+users with access to internal resources. 3proxy is not developed to replace
+.BR squid (8),
+but it can extend functionality of existing cashing proxy.
+It can be used to route requests between different types of clients and proxy
+servers. Think about it as application level
+gateway with configuration like hardware router has for network layer.
+It can establish multiple
+gateways with HTTP and HTTPS proxy with FTP over HTTP support, SOCKS v4,
+v4.5 and v5, POP3 proxy, UDP and TCP portmappers. Each gateway is started
+from configuration file like independant service
+.BR proxy (8)
+.BR socks (8)
+.BR pop3p (8)
+.BR tcppm (8)
+.BR udppm (8)
+.BR ftppr (8)
+.BR dnspr
+but
+.BR 3proxy
+is not a kind of wrapper or superserver for this daemons. It just has same
+code compiled in, but provides much more functionality. SOCKSv5
+implementatation allows to use 3proxy with any UDP or TCP based client
+applications designed without
+proxy support (with
+.IR SocksCAP ,
+.I FreeCAP
+or another client-side redirector under Windows of with socksification library
+under Unix). So you can play your favourite games, listen music, exchange
+files and messages and even accept incoming connections behind proxy server.
+.PP
+.I dnspr
+does not exist as independant service. It\' DNS caching proxy (it requires
+.I nscache
+and
+.I nserver
+to be set in configuration. Only A-records are cached. Please note, the
+this caching is mostly a 'hack' and has nothing to do with real
+DNS server, but it works perfectly for SOHO networks.
+
+.PP
+3proxy supports access control lists (ACL) like network router. Source
+and destination networks and destination port can be specified. In addition,
+usernames and gateway action (for example GET or POST) can be used in ACLs.
+In order to filter request on username basis user must be authenticated somehow. There are few
+authentication types including password authentication and authentication by
+NetBIOS name for Windows clients (it\'s very like ident authentication).
+Depending on ACL action request can be allowed, denied or redirected to another
+host or to another proxy server or even to a chain of proxy servers.
+.PP
+It supports different types of logging: to logfiles,
+.BR syslog (3)
+(only under Unix) or to ODBC database. Logging format is turnable to provide
+compatibility with existing log file parsers. It makes it possible to use
+3proxy with IIS, ISA, Apache or Squid log parsers.
+.SH OPTIONS
+.TP
+.B config_file
+Name of config file. See
+.BR 3proxy.cfg (3)
+for configuration file format. Under Windows, if config_file is not specified,
+.BR 3proxy
+looks for file named
+.I 3proxy.cfg
+in the default location (in same directory with executable file and in current
+directory). Under Unix, if no config file is specified, 3proxy reads
+configuration from stdin. It makes it possible to use 3proxy.cfg file as
+executable script just by setting +x mode and adding
+.br
+#!/usr/local/3proxy/3proxy
+.br
+as a first line in 3proxy.cfg
+.TP
+.B --install
+(Windows NT family only) install
+.BR 3proxy
+as a system service
+.TP
+.B --remove
+(Windows NT family only) remove
+.BR 3proxy
+from system services
+.SH SIGNALS
+Under Unix there are few signals
+.BR 3proxy
+catches. See
+.BR kill (1).
+.TP
+.B SIGTERM
+cleanup connections and exit
+.TP
+.B SIGPAUSE
+stop to accept new connections, on second signal - start and re-read
+configuration
+.TP
+.B SIGCONT
+start to accept new conenctions
+.TP
+.B SIGUSR1
+reload configuration
+.PP
+Under Windows, if
+.BR 3proxy
+is installed as service you can standard service management to start, stop,
+pause and continue 3proxy service, for example:
+.br
+.BR "net start 3proxy"
+.br
+.BR "net stop 3proxy"
+.br
+.BR "net pause 3proxy"
+.br
+.BR "net continue 3proxy"
+.PP
+Web admin service can also be used to reload configuration. Use
+wget to automate this task.
+.SH FILES
+.TP
+.I "/usr/local/3proxy/3proxy.cfg (3proxy.cfg)"
+.BR 3proxy
+configuration file
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy.cfg(3), proxy(8), ftppr(8), socks(8), pop3p(8), tcppm(8), udppm(8),
+kill(1), syslogd(8),
+.br
+http://3proxy.ru/
+.SH TRIVIA
+3APA3A is pronounced as \`\`zaraza\'\'.
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/3proxy.cfg.3 b/man/3proxy.cfg.3
new file mode 100644
index 0000000..5e376ca
--- /dev/null
+++ b/man/3proxy.cfg.3
@@ -0,0 +1,896 @@
+.TH 3proxy.cfg "3" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B 3proxy.cfg
+\- 3proxy configuration file
+.SH DESCRIPTION
+ Common structure:
+.br
+Configuration file is a text file 3proxy reads configuration from. Each line
+of the file is a command executed immediately, as it was given from
+console. Sequence of commands is important. Configuration file as actually a
+script for 3proxy executable.
+Each line of the file is treated as a blank (space or tab) separated
+command line. Additional space characters are ignored.
+Think about 3proxy as "application level router" with console interface.
+.br
+ Comments:
+.br
+Any string beginning with space character or \'#\' character is comment. It\'s
+ignored. s are ignored. is end of command.
+
+.br
+ Quotation:
+.br
+Quotation character is " (double quote). Quotation must be used to quote
+spaces or another special characters. To use quotation character inside
+quotation character must be dubbed (BASIC convention). For example to use
+HELLO "WORLD" as an argument you should use it as "HELLO ""WORLD"""\.
+Good practice is to quote any argument you use.
+.br
+ File inclusion:
+.br
+You can include file by using $FILENAME macro (replace FILENAME with a path
+to file, for example $/usr/local/etc/3proxy/conf.incl or
+ $"c:\\Program Files\\3proxy\\include.cfg" Quotation is
+required in last example because path contains space character.
+For included file (end of line characters) is treated as space character
+(arguments delimiter instead of end of command delimiter).
+Thus, include files are only useful to store long signle-line commands
+(like userlist, network lists, etc).
+To use dollar sign somewhere in argument it must be quoted.
+Recursion is not allowed.
+.br
+ Next commands start gateway services:
+.br
+.B proxy
+[options]
+.br
+.B socks
+[options]
+.br
+.B pop3p
+[options]
+.br
+.B ftppr
+[options]
+.br
+.B admin
+[options]
+.br
+.B dnspr
+[options]
+.br
+.B tcppm
+[options]
+
+.br
+.B udppm
+[options]
+
+.br
+ Descriptions:
+.br
+.B proxy
+\- HTTP/HTTPS proxy (default port 3128)
+.br
+.B socks
+\- SOCKS 4/4.5/5 proxy (default port 1080)
+.br
+.B pop3p
+\- POP3 proxy (default port 110)
+.br
+.B ftppr
+\- FTP proxy (default port 21)
+.br
+.B admin
+\- Web interface (default port 80)
+.br
+.B dnspr
+\- caching DNS proxy (default port 53)
+.br
+.B tcppm
+\- TCP portmapper
+.br
+.B udppm
+\- UDP portmapper
+.br
+
+ Options:
+.br
+.B -pNUMBER
+change default server port to NUMBER
+.br
+.B -n
+disable NTLM authentication (required if passwords are stored in Unix crypt format.
+.br
+.B -s
+(for admin) - allow only secure operations (currently only traffic counters
+view without ability to reset).
+.br
+.B -a
+(for proxy) - anonymous proxy (no information about client reported)
+.br
+.B -a1
+(for proxy) - anonymous proxy (random client information reported)
+.br
+ Also, all options mentioned for
+.BR proxy (8)
+.BR socks (8)
+.BR pop3p (8)
+.BR tcppm (8)
+.BR udppm (8)
+.BR ftppr (8)
+ are also supported.
+.br
+ Portmapping services listen at SRCPORT and connect to DSTADDR:DSTPORT
+HTTP and SOCKS proxies are standard.
+.br
+ POP3 proxy must be configured as POP3 server and requires username in the form of:
+pop3username@pop3server. If POP3 proxy access must be authenticated, you can
+specify username as proxy_username:proxy_password:POP3_username@pop3server
+.br
+ DNS proxy resolves any types of records but only hostnames are cached. It
+requires nserver/nscache to be configured.
+.br
+ FTP proxy can be used as FTP server in any FTP client or configured as FTP
+proxy on a client with FTP proxy support. Username format is one of
+.br
+ FTPuser@FTPServer
+.br
+ FTPuser:FTPpassword@FTPserver
+.br
+ proxyuser:proxypassword:FTPuser:FTPpassword@FTPserver
+.br
+ Please note, if you use FTP client interface for FTP proxy
+do not add FTPpassword and FTPServer to username, because
+FTP client does it for you. That is, if you use 3proxy with
+authentication use
+proxyuser:proxypassword:FTPuser
+as FTP username, otherwise do not change original FTP user name
+
+.B include
+
+.br
+Include config file
+
+.br
+.B config
+
+.br
+Path to configuration file to use on 3proxy restart or to save configuration.
+
+.br
+.B writable
+.br
+ReOpens configuration file for write access via Web interface,
+and re-reads it. Usually should be first command on config file
+but in combination with "config" it can be used anywhere to open
+alternate config file. Think twice before using it.
+
+.br
+.B end
+.br
+End of configuration
+
+.br
+.B log
+[[@|&]logfile] []
+.br
+sets logfile for all gateways
+.br
+ @ - (for Unix) use syslog, filename is used as ident name
+.br
+ & - use ODBC, filename consists of comma-delimited datasource,username,password (username and password are optional)
+.br
+ LOGTYPE is one of:
+.br
+ M - Monthly
+.br
+ W - Weekly (starting from Sunday)
+.br
+ D - Daily
+.br
+ H - Hourly
+.br
+if logfile is not specified logging goes to stdout. You can specify individual logging options for gateway by using
+-l option in gateway configuration.
+.br
+"log" command supports same format specifications for filename template
+as "logformat" (if filename contains '%' sign it's believed to be template).
+As with "logformat" filename must begin with 'L' or 'G' to specify Local or
+Grinwitch time zone for all time-based format specificators.
+
+.br
+.B rotate
+
+how many archived log files to keep
+
+.br
+.B logformat
+
+
+Format for log record. First symbol in format must be L (local time)
+or G (absolute Grinwitch time).
+It can be preceeded with -XXX+Y where XXX is list of characters to be
+filtered in user input (any non-printable characters are filtered too
+in this case) and Y is replacement character. For example, "-,%+ L" in
+the beginning of logformat means comma and percent are replaced
+with space and all time based elemnts are in local time zone.
+.br
+You can use:
+
+.br
+ %y - Year in 2 digit format
+.br
+ %Y - Year in 4 digit format
+.br
+ %m - Month number
+.br
+ %o - Month abbriviature
+.br
+ %d - Day
+.br
+ %H - Hour
+.br
+ %M - Minute
+.br
+ %S - Second
+.br
+ %t - Timstamp (in seconds since 01-Jan-1970)
+.br
+ %. - milliseconds
+.br
+ %z - timeZone (from Grinvitch)
+.br
+ %D - request duration (in milliseconds)
+.br
+ %b - average send rate per request (in Bytes per second) this speed is typically below connection speed shown by download manager.
+.br
+ %B - average receive rate per request (in Bytes per second) this speed is typically below connection speed shown by download manager.
+.br
+ %U - Username
+.br
+ %N - service Name
+.br
+ %p - service Port
+.br
+ %E - Error code
+.br
+ %C - Client IP
+.br
+ %c - Client port
+.br
+ %R - Remote IP
+.br
+ %r - Remote port
+.br
+ %e - External IP used to establish connection
+.br
+ %Q - Requested IP
+.br
+ %q - Requested port
+.br
+ %n - requested hostname
+.br
+ %I - bytes In
+.br
+ %O - bytes Out
+.br
+ %h - Hops (redirections) count
+.br
+ %T - service specific Text
+.br
+ %N1-N2T - (N1 and N2 are positive numbers) - log only fields from N1 thorugh N2 of service specific text
+.br
+in case of ODBC logging logformat specifies SQL statement, for exmample:
+.br
+ logformat "-'+_Linsert into log (l_date, l_user, l_service, l_in, l_out, l_descr) values ('%d-%m-%Y %H:%M:%S', '%U', '%N', %I, %O, '%T')"
+
+.br
+.B logdump
+
+.br
+Immediately creates additional log records if given amount of incoming/outgoing
+traffic is achieved for connection, without waiting for connection to finish.
+It may be useful to prevent information about long-lasting downloads on server
+shutdown.
+
+.br
+.B archiver
+
+.br
+Archiver to use for log files. is file extension produced by
+archiver. Filename will be last argument to archiver, optionally you
+can use %A as produced archive name and %F as filename.
+
+.br
+.B timeouts
+
+.br
+Sets timeout values
+.br
+ BYTE_SHORT - short timeout for single byte, is usually used for receiving single byte from stream.
+.br
+ BYTE_LONG - long timeout for single byte, is usually used for receiving first byte in frame (for example first byte in socks request).
+.br
+ STRING_SHORT - short timeout, for character string within stream (for example to wait between 2 HTTP headers)
+.br
+ STRING_LONG - long timeout, for first string in stream (for example to wait for HTTP request).
+.br
+ CONNECTION_SHORT - inactivity timeout for short connections (HTTP, POP3, etc).
+.br
+ CONNECTION_LONG - inactivity timeout for long connection (SOCKS, portmappers, etc).
+.br
+ DNS - timeout for DNS request before requesting next server
+.br
+ CHAIN - timeout for reading data from chained connection
+.br
+
+.br
+.B nserver
+
+.br
+Nameserver to use for name resolutions. If none spcified system
+or name server fails system routines for name resolution will be
+used. It's better to specify nserver because gethostbyname() may
+be thread unsafe.
+
+.br
+.B nscache
+
+.br
+
+Cache records for name resolution. Cachesize usually
+should be large enougth (for example 65536).
+
+.br
+.B nsrecord
+
+.BR
+Adds static record to nscache. nscache must be enabled. If 0.0.0.0
+is used as a hostaddr host will never resolve, it can be used to
+blacklist something or together with
+.B dialer
+command to set up UDL for dialing.
+
+.br
+.B fakeresolve
+.BR
+All names are resolved to 127.0.0.2 address. Usefull if all requests are
+redirected to parent proxy with http, socks4+, connect+ or socks5+.
+
+.br
+.B dialer
+
+.br
+Execute progname if external name can't be resolved.
+Hint: if you use nscache, dialer may not work, because names will
+be resolved through cache. In this case you can use something like
+http://dial.right.now/ from browser to set up connection.
+
+
+.br
+.B internal
+
+.br
+sets ip address of internal interface. This IP address will be used
+to bind gateways. Alternatively you can use -i option for individual
+gateways
+
+.br
+.B external
+
+.br
+sets ip address of external interface. This IP address will be source
+address for all connections made by proxy. Alternatively you can use
+-e option to specify individual address for gateway.
+
+.br
+.B maxconn
+
+.br
+sets maximum number of simulationeous connections to each services
+started after this command. Default is 100.
+
+.br
+.B service
+.br
+(depricated). Indicates 3proxy to behave as Windows 95/98/NT/2000/XP
+service, no effect for Unix. Not required for 3proxy 0.6 and above. If
+you upgraded from previous version of 3proxy use --remove and --install
+to reinstall service.
+
+.br
+.B daemon
+.br
+Should be specified to close console. Do not use 'daemon' with 'service'.
+At least under FreeBSD 'daemon' should preceed any proxy service
+and log commands to avoid sockets problem. Always place it in the beginning
+of the configuration file.
+
+.br
+.B auth
+ [...]
+.br
+Type of user authorization. Currently supported:
+.br
+ none - no authentication or authorization required.
+ Note: is auth is none any ip based limitation, redirection, etc will not work.
+ This is default authentication type
+.br
+ iponly - authentication by access control list with username ignored.
+ Appropriate for most cases
+.br
+ useronly - authentication by username without checking for any password with
+authorization by ACLs. Useful for e.g. SOCKSv4 proxy and icqpr (icqpr set UIN /
+AOL screen name as a username)
+.br
+ dnsname - authentication by DNS hostnname with authorization by ACLs.
+DNS hostname is resolved via PTR (reverse) record and validated (resolved
+name must resolve to same IP address). It's recommended to use authcache by
+ip for this authentication.
+NB: there is no any password check, name may be spoofed.
+.br
+ nbname - authentication by NetBIOS name with authorization by ACLs.
+Messanger service should be started on user's machine. Note, that
+Windows 95/98 hosts do not have messanger service by default,
+WinPopup program need to be started. It's recommended to use authcache by
+ip for this authentication.
+NB: there is no any password check, name may be spoofed.
+.br
+ strong - username/password authentication required. It will work with
+SOCKSv5, FTP, POP3 and HTTP proxy.
+.br
+ cache - cached authentication, may be used with 'authcache'.
+.br
+Plugins may add additional authentication types.
+.br
+
+ It's possible to use few authentication types in the same commands. E.g.
+.br
+auth iponly strong
+.br
+In this case 'strong' authentication will be used only in case resource
+access can not be performed with 'iponly' authentication, that is username is
+required in ACL. It's usefull to protect access to some resources with
+password allowing passwordless access to another resources, or to use
+IP-based authentication for dedicated laptops and request username/password for
+shared ones.
+.br
+.B authcache
+
+.br
+Cache authentication information to given amount of time (cachetime) in seconds.
+Cahtype is one of:
+.br
+ ip - after successful authentication all connections during caching time
+from same IP are assigned to the same user, username is not requested.
+.br
+ ip,user username is requested and all connections from the same IP are
+assigned to the same user without actual authentication.
+.br
+ user - same as above, but IP is not checked.
+.br
+ user,password - both username and password are checked against cached ones.
+.br
+Use auth type 'cache' for cached authentication
+.br
+.B allow
+
+
+.br
+.B deny
+
+
+.br
+Access control entries. All lists are comma-separated, no spaces are
+allowed. Usernames are case sensitive (if used with authtype nbname
+username must be in uppercase). Source and target lists may contain
+IP addresses (W.X.Y.Z) or CIDRs (W.X.Y.Z/L). Since 0.6, targetlist may also
+contain host names, instead of addresses. It's possible to use wildmask in
+the begginning and in the the end of hostname, e.g. *badsite.com or
+*badcontent*. Hostname is only checked if hostname presents in request.
+Targetportlist may contain ports (X) or port ranges lists (X-Y). For any field
+* sign means "ANY" If access list is empty it's assumed to be
+.br
+ allow *
+.br
+ If access list is not empty last item in access list is assumed to be
+.br
+ deny *
+.br
+ You may want explicitly add "deny *" to the end of access list to prevent
+HTTP proxy from requesting user's password.
+Access lists are checked after user have requested any resource.
+If you want 3proxy to reject connections from specific addresses
+immediately without any conditions you should either bind proxy
+to appropriate interface only or to use ip filters.
+.br
+
+Operation is one of:
+.br
+ CONNECT - establish outgoing TCP connection
+.br
+ BIND - bind TCP port for listening
+.br
+ UDPASSOC - make UDP association
+.br
+ ICMPASSOC - make ICMP association (for future use)
+.br
+ HTTP_GET - HTTP GET request
+.br
+ HTTP_PUT - HTTP PUT request
+.br
+ HTTP_POST - HTTP POST request
+.br
+ HTTP_HEAD - HTTP HEAD request
+.br
+ HTTP_CONNECT - HTTP CONNECT request
+.br
+ HTTP_OTHER - over HTTP request
+.br
+ HTTP - matches any HTTP request except HTTP_CONNECT
+.br
+ HTTPS - same as HTTP_CONNECT
+.br
+ FTP_GET - FTP get request
+.br
+ FTP_PUT - FTP put request
+.br
+ FTP_LIST - FTP list request
+.br
+ FTP_DATA - FTP data connection. Note: FTP_DATA requires access to dynamic
+ non-ptivileged (1024-65535) ports on remote side.
+.br
+ FTP - matches any FTP/FTP Data request
+.br
+ ADMIN - access to administration interface
+.br
+
+Weeksdays are week days numbers or periods (0 or 7 means Sunday, 1 is Monday,
+1-5 means Monday through Friday). Timeperiodlists is a list of time
+periods in HH:MM:SS-HH:MM:SS format. For example,
+ 00:00:00-08:00:00,17:00:00-24:00:00
+lists non-working hours.
+
+.br
+.B parent
+
+.br
+this command must follow "allow" rule. It extends last allow rule to
+build proxy chain. Proxies may be grouped. Proxy inside the
+group is selected randomly. If few groups are specified one proxy
+is randomly picked from each group and chain of proxies is created
+(that is second proxy connected through first one and so on).
+Weight is used to group proxies. Weigt is a number between 1 and 1000.
+Weights are summed and proxies are grouped together untill weight of
+group is 1000. That is:
+.br
+ allow *
+.br
+ parent 500 socks5 192.168.10.1 1080
+.br
+ parent 500 connect 192.168.10.1 3128
+.br
+ makes 3proxy to randomly choose between 2 proxies for all outgoing
+connections. These 2 proxies form 1 group (summarized weight is 1000).
+.br
+ allow * * * 80
+.br
+ parent 1000 socks5 192.168.10.1 1080
+.br
+ parent 1000 connect 192.168.20.1 3128
+.br
+ parent 300 socks4 192.168.30.1 1080
+.br
+ parent 700 socks5 192.168.40.1 1080
+.br
+ creates chain of 3 proxies: 192.168.10.1, 192.168.20.1 and third
+is (192.168.30.1 with probability of 0.3 or 192.168.40.1
+with probability of 0.7) for outgoing web connections.
+
+.br
+ type is one of:
+.br
+ tcp - simply redirect connection. TCP is always last in chain.
+.br
+ http - redirect to HTTP proxy. HTTP is always last chain.
+.br
+ pop3 - redirect to POP3 proxy (only local redirection is supported, can not be
+used for chaining)
+.br
+ ftp - redirect to FTP proxy (only local redirection is supported, can not be
+used for chaining)
+.br
+ connect - parent is HTTP CONNECT method proxy
+.br
+ connect+ - parent is HTTP CONNECT proxy with name resolution
+.br
+ socks4 - parent is SOCKSv4 proxy
+.br
+ socks4+ - parent is SOCKSv4 proxy with name resolution (SOCKSv4a)
+.br
+ socks5 - parent is SOCKSv5 proxy
+.br
+ socks5+ - parent is SOCKSv5 proxy with name resolution
+.br
+ socks4b - parent is SOCKS4b (broken SOCKSv4 implementation with shortened
+server reply. I never saw this kind ofservers byt they say there are).
+Normally you should not use this option. Do not mess this option with
+SOCKSv4a (socks4+).
+.br
+ socks5b - parent is SOCKS5b (broken SOCKSv5 implementation with shortened
+server reply. I think you will never find it useful). Never use this option
+unless you know exactly you need it.
+.br
+ admin - redirect request to local 'admin' service (with -s parameter).
+.br
+ Use "+" proxy only with "fakeresolve" option
+.br
+
+ IP and port are ip addres and port of parent proxy server.
+If IP is zero, ip is taken from original request, only port is changed.
+If port is zero, it's taken from original request, only IP is changed.
+If both IP and port are zero - it's a special case of local redirection,
+it works only with
+.B socks
+proxy. In case of local redirection request is redirected to different service,
+.B ftp
+locally redirects to
+.B ftppr
+.B pop3
+locally redirects to
+.B pop3p
+.B http
+locally redurects to
+.B proxy
+.B admin
+locally redirects to admin -s service.
+.br
+
+ Main purpose of local redirections is to have requested resource
+(URL or POP3 username) logged and protocol-specific filters to be applied.
+In case of local redirection ACLs are revied twice: first, by SOCKS proxy up to
+'parent' command and then with gateway service connection is
+redirected (HTTP, FTP or POP3) after 'parent' command. It means,
+additional 'allow' command is required for redirected requests, for
+example:
+.br
+ allow * * * 80
+.br
+ parent 1000 http 0.0.0.0 0
+.br
+ allow * * * 80 HTTP_GET,HTTP_POST
+.br
+ socks
+.br
+redirects all SOCKS requests with target port 80 to local HTTP proxy,
+local HTTP proxy parses requests and allows only GET and POST requests.
+.br
+ parent 1000 http 1.2.3.4 0
+.br
+Changes external address for given connection to 1.2.3.4
+(an equivalent to -e1.2.3.4)
+
+ Optional username and password are used to authenticate on parent
+proxy. Username of '*' means username must be supplied by user.
+
+
+.br
+.B nolog
+
+extends last allow or deny command to prevent logging, e.g.
+.br
+allow * * 192.168.1.1
+.br
+nolog
+
+
+.br
+.B weight
+
+extends last allow or deny command to set weight for this request
+.br
+allow * * 192.168.1.1
+.br
+weight 100
+.br
+Weight may be used for different purposes.
+
+.br
+.B bandlimin
+
+.br
+.B nobandlimin
+
+.B bandlimout
+
+.br
+.B nobandlimout
+
+.br
+ bandlim sets bandwith limitation filter to bps (bits per second)
+(if you want to specife bytes per second - multiply your value to 8).
+bandlim rules act in a same manner as allow/deny rules except
+one thing: bandwidth limiting is applied to all services, not to some
+specific service.
+bandlimin and nobandlimin applies to incoming traffic
+bandlimout and nobandlimout applies to outgoing traffic
+If tou want to ratelimit your clients with ip's 192.168.10.16/30 (4
+addresses) to 57600 bps you have to specify 4 rules like
+.br
+ bandlimin 57600 * 192.168.10.16
+.br
+ bandlimin 57600 * 192.168.10.17
+.br
+ bandlimin 57600 * 192.168.10.18
+.br
+ bandlimin 57600 * 192.168.10.19
+.br
+ and every of you clients will have 56K channel. if you specify
+.br
+ bandlimin 57600 * 192.168.10.16/30
+.br
+ you will have 56K channel shared between all clients.
+if you want, for example, to limit all speed ecept access to POP3 you can use
+.br
+ nobandlimin * * * 110
+.br
+ before the rest of bandlim rules.
+
+.br
+.B counter
+
+.br
+.B countin
+
+.br
+.B nocountin
+
+.br
+.B countout
+
+.br
+.B nocountout
+
+.br
+
+ counter, countin, nocountin, countout, noucountout commands are
+used to set traffic limit
+in MB for period of time (day, week or month). Filename is a path
+to a special file where traffic information is permanently stored.
+number is sequential number of record in this file. If number is 0
+no traffic information on this counter is saved in file (that is
+if proxy restarted all information is loosed) overwise it should be
+unique sequential number.
+Type specifies a type of counter. Type is one of:
+.br
+ D - counter is resetted daily
+.br
+ W - counter is resetted weekly
+.br
+ M - counter is resetted monthely
+.br
+ reporttype/repotname may be used to generate traffic reports.
+Reporttype is one of D,W,M,H(hourly) and repotname specifies filename
+template for reports. Report is text file with counter values in
+format:
+.br
+
+.br
+ The rest of parameters is identical to bandlim/nobandlim.
+
+.br
+.B users
+username[:pwtype:password] ...
+.br
+pwtype is one of:
+.br
+ none (empty) - use system authentication
+.br
+ CL - password is cleartext
+.br
+ CR - password is crypt-style password
+.br
+ NT - password is NT password (in hex)
+.br
+example:
+.br
+ users test1:CL:password1 "test2:CR:$1$lFDGlder$pLRb4cU2D7GAT58YQvY49."
+.br
+ users test3:NT:BD7DFBF29A93F93C63CB84790DA00E63
+.br
+(note: double quotes are requiered because password contains $ sign).
+
+.br
+.B flush
+.br
+empty active access list. Access list must be flushed avery time you creating
+new access list for new service. For example:
+.br
+ allow *
+.br
+ pop3p
+.br
+ flush
+.br
+ allow * 192.168.1.0/24
+.br
+ socks
+.br
+sets different ACLs for
+.B pop3p
+and
+.B socks
+
+.br
+.B system
+.br
+execute system command
+
+.br
+.B pidfile
+
+.br
+write pid of current process to file. It can be used to manipulate
+3proxy with signals under Unix. Currently next signals are available:
+
+.br
+.B monitor
+
+.br
+If file monitored changes in modification time or size, 3proxy reloads
+configuration within one minute. Any number of files may be monitored.
+
+.br
+.B setuid
+
+.br
+calls setuid(uid), uid must be numeric. Unix only. Warning: under some Linux
+kernels setuid() works onle for current thread. It makes it impossible to suid
+for all threads.
+
+.br
+.B setgid
+
+.br
+calls setgid(gid), gid must be numeric. Unix only.
+
+.br
+.B chroot
+
+.br
+calls chroot(path). Unix only.
+.SH PLUGINS
+
+.br
+.B plugin
+ [ ...]
+.br
+Loads specified library and calls given export function with given arguments,
+as
+.br
+int functions_to_call(struct pluginlink * pl, int argc, char * argv[]);
+.br
+function_to_call must return 0 in case of success, value > 0 to indicate error.
+
+.br
+.B filtermaxsize
+
+.br
+If Content-length (or another data length) is greater than given value, no
+data filtering will be performed thorugh filtering plugins to avoid data
+corruption and/or Content-Length chaging. Default is 1MB (1048576).
+
+
+.SH SEE ALSO
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), tcppm(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH TRIVIA
+3APA3A is pronounced as \`\`zaraza\'\'.
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/ftppr.8 b/man/ftppr.8
new file mode 100644
index 0000000..eee0ace
--- /dev/null
+++ b/man/ftppr.8
@@ -0,0 +1,85 @@
+.TH ftppr "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B ftppr
+\- FTP proxy gateway service
+.SH SYNOPSIS
+.BR "ftppr " [ -d ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -p port\fR]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.IB \fR[ -h default_ip[:port]\fR]
+.SH DESCRIPTION
+.B ftppr
+is FTP gateway service to allow internal users to access external FTP
+servers.
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -u
+Never look for username authentication.
+.TP
+.B -e
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -h
+Default destination. It's used if targed address is not specified by user.
+.TP
+.B -p
+Port. Port proxy listens for incoming connections. Default is 21.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.SH CLIENTS
+You can use any FTP client, regardless of FTP proxy support. For client with
+FTP proxy support configure
+.I internal_ip
+and
+.IR port
+in FTP proxy parameters.
+For clients without FTP proxy support use
+.I internal_ip
+and
+.IR port
+as FTP server. Address of real FTP server must be configured as a part of
+FTP username. Format for username is
+.IR username \fB@ server ,
+where
+.I server
+is address of FTP server and
+.I username
+is user\'s login on this FTP server. Login itself may contain \'@\' sign.
+Only cleartext authentication is currently supported.
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), proxy(8), pop3p(8), socks(8), tcppm(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/icqpr.8 b/man/icqpr.8
new file mode 100644
index 0000000..dded1be
--- /dev/null
+++ b/man/icqpr.8
@@ -0,0 +1,78 @@
+.TH icqpr "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B icqpr
+\- ICQ (AOL OSCAR) proxy
+.SH SYNOPSIS
+.BR "icqpr " [ -d ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.I local_port remote_host remote_port
+.SH DESCRIPTION
+.B icqpr
+forwards ICQ connections from local to remote ICQ host. Most usual is
+.B icqpr 5190 login.icq.com 5190
+Also, icqpr adds UIN / AOL screen name as a username. It makes it possible
+to control user's access to ICQ/AOL by UIN/screen name (use
+.B auth useronly
+in 3proxy).
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -e
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.SH ARGUMENTS
+.TP
+.I local_port
+- port icqpr accepts connection
+.TP
+.I remote_host
+- IP address of the host connection is forwarded to
+.TP
+.I remote_port
+- remote port connection is forwarded to
+.SH CLIENTS
+You can use any ICQ/AOL client where server address configuration is supported
+or spoof login server name (e.g. login.icq.com) with IP address of proxy server
+via DNS record or hosts file. Transparent redirection is also possible. Use
+.I internal_ip
+and
+.I local_port
+as a destination in client application. Connection is forwarded to
+.IR remote_host : remote_port
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/pop3p.8 b/man/pop3p.8
new file mode 100644
index 0000000..3ae67b0
--- /dev/null
+++ b/man/pop3p.8
@@ -0,0 +1,81 @@
+.TH pop3p "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B pop3p
+\- POP3 proxy gateway service
+.SH SYNOPSIS
+.BR "pop3p " [ -d ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -p port\fR]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.IB \fR[ -h default_ip[:port]\fR]
+.SH DESCRIPTION
+.B pop3p
+is POP3 gateway service to allow internal users to access external POP3
+servers.
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -u
+Never look for username authentication.
+.TP
+.B -e
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -p
+Port. Port proxy listens for incoming connections. Default is 110.
+.TP
+.B -h
+Default destination. It's used if targed address is not specified by user.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.SH CLIENTS
+You can use any MUA (Mail User Agent) with POP3 support. Set client to use
+.I internal_ip
+and
+.IR port
+as a POP3 server. Address of real POP3 server must be configured as a part of
+POP3 username. Format for username is
+.IR username \fB@ server ,
+where
+.I server
+is address of POP3 server and
+.I username
+is user\'s login on this POP3 server. Login itself may contain \'@\' sign.
+Only cleartext authentication is supported, because challenge-response
+authentication (APOP, CRAM-MD5, etc) requires challenge from server before
+we know which server to connect.
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), ftppr(8), proxy(8), socks(8), tcppm(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/proxy.8 b/man/proxy.8
new file mode 100644
index 0000000..ed76ed4
--- /dev/null
+++ b/man/proxy.8
@@ -0,0 +1,76 @@
+.TH proxy "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B proxy
+\- HTTP proxy gateway service
+.SH SYNOPSIS
+.BR "proxy " [ -d ][ -a ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -p port\fR]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.SH DESCRIPTION
+.B proxy
+is HTTP gateway service with HTTPS and FTP over HTTPS support.
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -u
+Never ask for username authentication
+.TP
+.B -e
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -a
+Anonymous. Hide information about client.
+.TP
+.B -a1
+Anonymous. Show fake information about client.
+.TP
+.B -p
+Port. Port proxy listens for incoming connections. Default is 3128.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.SH CLIENTS
+You should use client with HTTP proxy support or configure router to redirect
+HTTP traffic to proxy (transparent proxy). Configure client to connect to
+.I internal_ip
+and
+.IR port .
+HTTPS support allows to use almost any TCP based protocol. If you need to
+limit clients, use
+.BR 3proxy (8)
+instead.
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), ftppr(8), socks(8), pop3p(8), tcppm(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/smtpp.8 b/man/smtpp.8
new file mode 100644
index 0000000..eaf83af
--- /dev/null
+++ b/man/smtpp.8
@@ -0,0 +1,82 @@
+.TH smtpp "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B smtpp
+\- SMTP proxy gateway service
+.SH SYNOPSIS
+.BR "smtpp " [ -d ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -p port\fR]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.IB \fR[ -h default_ip[:port]\fR]
+.SH DESCRIPTION
+.B smtpp
+is SMTP gateway service to allow internal users to access external SMTP
+servers.
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -u
+Never look for username authentication.
+.TP
+.B -e
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -p
+Port. Port proxy listens for incoming connections. Default is 25.
+.TP
+.B -h
+Default destination. It's used if targed address is not specified by user.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.SH CLIENTS
+You can use any MUA (Mail User Agent) with SMTP authentication support.
+Set client to use
+.I internal_ip
+and
+.IR port
+as a SMTP server. Address of real SMTP server must be configured as a part of
+SMTP username. Format for username is
+.IR username \fB@ server ,
+where
+.I server
+is address of SMTP server and
+.I username
+is user\'s login on this SMTP server. Login itself may contain \'@\' sign.
+Only cleartext authentication is supported, because challenge-response
+authentication (CRAM-MD5, SPA, etc) requires challenge from server before
+we know which server to connect.
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), ftppr(8), proxy(8), socks(8), tcppm(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/socks.8 b/man/socks.8
new file mode 100644
index 0000000..9da8170
--- /dev/null
+++ b/man/socks.8
@@ -0,0 +1,77 @@
+.TH socks "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B socks
+\- SOCKS 4/4.5/5 gateway service
+.SH SYNOPSIS
+.BR "socks " [ -d ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -p port\fR]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.SH DESCRIPTION
+.B socks
+is SOCKS server. It supports SOCKSv4, SOCKSv4.5 (extension to v4 for
+server side name resolution) and SOCKSv5. SOCKSv5 specification allows both
+outgoing and reverse TCP connections and UDP portmapping.
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -u
+Never ask for username authentication
+.TP
+.B -e
+External address. IP address of interface proxy should initiate connections
+from. External IP must be specified if you need incoming connections.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -p
+Port. Port proxy listens for incoming connections. Default is 1080.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.SH CLIENTS
+You should use client with SOCKS support or use some socksification support
+(for example
+.I SocksCAP
+or
+.IR FreeCAP ).
+Configure client to use
+.I internal_ip
+and
+.IR port .
+SOCKS allows to use almost any application protocol without limitation. This
+implementation also allows to open priviledged port on server (if socks has
+sufficient privileges). If you need to control access use
+.BR 3proxy (8)
+instead.
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), proxy(8), ftppr(8), pop3p(8), tcppm(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/tcppm.8 b/man/tcppm.8
new file mode 100644
index 0000000..80d0fda
--- /dev/null
+++ b/man/tcppm.8
@@ -0,0 +1,71 @@
+.TH tcppm "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B tcppm
+\- TCP port mapper
+.SH SYNOPSIS
+.BR "tcppm " [ -d ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.I local_port remote_host remote_port
+.SH DESCRIPTION
+.B tcppm
+forwards connections from local to remote TCP port
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -e
+External address. IP address of interface proxy should initiate connections
+from.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts connections to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.SH ARGUMENTS
+.TP
+.I local_port
+- port tcppm accepts connection
+.TP
+.I remote_host
+- IP address of the host connection is forwarded to
+.TP
+.I remote_port
+- remote port connection is forwarded to
+.SH CLIENTS
+Any TCP based application can be used as a client. Use
+.I internal_ip
+and
+.I local_port
+as a destination in client application. Connection is forwarded to
+.IR remote_host : remote_port
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/man/udppm.8 b/man/udppm.8
new file mode 100644
index 0000000..9770895
--- /dev/null
+++ b/man/udppm.8
@@ -0,0 +1,77 @@
+.TH udppm "8" "July 2009" "3proxy 0.7" "Universal proxy server"
+.SH NAME
+.B udppm
+\- UDP port mapper
+.SH SYNOPSIS
+.BR "pop3p " [ -ds ]
+.IB \fR[ -l \fR[ \fR[ @ \fR] logfile \fR]]
+.IB \fR[ -i internal_ip\fR]
+.IB \fR[ -e external_ip\fR]
+.I local_port remote_host remote_port
+.SH DESCRIPTION
+.B udppm
+forwards datagrams from local to remote UDP port
+.SH OPTIONS
+.TP
+.B -I
+Inetd mode. Standalone service only.
+.TP
+.B -d
+Daemonise. Detach service from console and run in the background.
+.TP
+.B -t
+Be silenT. Do not log start/stop/accept error records.
+.TP
+.B -e
+External address. IP address of interface proxy should initiate datagrams
+from.
+By default system will deside which address to use in accordance
+with routing table.
+.TP
+.B -i
+Internal address. IP address proxy accepts datagrams to.
+By default connection to any interface is accepted. It\'s usually unsafe.
+.TP
+.B -l
+Log. By default logging is to stdout. If
+.I logfile
+is specified logging is to file. Under Unix, if
+.RI \' @ \'
+preceeds
+.IR logfile ,
+syslog is used for logging.
+.TP
+.B -s
+Single packet. By default only one client can use udppm service, but
+if -s is specified only one packet will be forwarded between client and server.
+It allows to share service between multiple clients for single packet services
+(for example name lookups).
+.SH ARGUMENTS
+.TP
+.I local_port
+- port udppm accepts datagrams
+.TP
+.I remote_host
+- IP address of the host datagrams are forwarded to
+.TP
+.I remote_port
+- remote port datagrams are forwarded to
+.SH CLIENTS
+Any UDP based application can be used as a client. Use
+.I internal_ip
+and
+.I local_port
+as a destination in client application. All datagrams are forwarded to
+.IR remote_host : remote_port
+.SH BUGS
+Report all bugs to
+.BR 3proxy@security.nnov.ru
+.SH SEE ALSO
+3proxy(8), proxy(8), ftppr(8), socks(8), pop3p(8), udppm(8), syslogd(8),
+.br
+http://3proxy.ru/
+.SH AUTHORS
+3proxy is designed by 3APA3A
+.RI ( 3APA3A@security.nnov.ru ),
+Vladimir Dubrovin
+.RI ( vlad@sandy.ru )
diff --git a/news b/news
new file mode 100644
index 0000000..240275f
--- /dev/null
+++ b/news
@@ -0,0 +1,143 @@
+Fixes in 0.5.3g
+! Previous fixes were not backported completely from 0.6
+! Fixed ident string should not be freed for openlog() to prevent garbage in
+ syslog().
+
+Fixes in 0.5.3f
+! Fixed SOCKSv4 for parent proxy
+
+Fixes in 0.5.3e
+! Fixed POST request problem with NTLM authentication
+
+Fixes in 0.5.3d
+! Fixed endless loop on 'udppm -s'
+
+Fixes in 0.5.3c
+! Fixed aborted download on some requests
+
+Fixes in 0.5.3b
+! Fixed double 3xx reply on USER command in ftppr.
+
+Fixes in 0.5.3a
+! 64-bit pointer arythnmetics problem fix applied to ntlm.c
+ (requested by Mike Frysinger)
+
+0.5.3 is bugfix release for 0.5.2:
+Fixes backported from 0.6 as 0.5.3:
+!! Fixed: NTLM authentication doesn't work for NT-encoded passwords and may
+ cause account blocking (reported by boris16 at tut.by)
+! Fixed: offer NTLM authentication before basic
+! Fixed: buffered input may double some data on empty reads
++ FTP diagnostics improved for FTP login problems
+! SOCKS BIND/UDPASSOC problems fixed (based on Artem Rebrov's patch)
+! Fixed: endless loop on configuration parsing if ACL weekdays are given as
+ a comma delimited list (reported by Andrey S. Alexeenko).
+
+
+
+ Known bugs:
+
+ Non-reproduced problem reported with poll() implemenration for some 2.4
+ Linux kernel, may be hardware dependant. As a result 3proxy goes to a loop
+ with 100% CPU utilization soon after start. Compile 3proxy without
+ -DWITH_POLL in Makefile(s) if you observe this behaviour.
+
+ report to 3proxy@security.nnov.ru
+
+
+
+14/10/2006 3[APA3A]tiny proxy 0.5.2
+New features since 0.4 are marked with !.
+
+ Features:
+ 1. General
+ + HTTP/1.1 Proxy with keep-alive client and server support,
+ transparent proxy support.
+ ! Anonymous and random client emulation HTTP proxy mode
+ + FTP over HTTP support.
+ + DNS caching with built-in resolver
+ + HTTPS (CONNECT) proxy
+ + SOCKSv4/4.5 Proxy
+ + SOCKSv5 Proxy
+ ! UDP and bind support for SOCKSv5 (fully compatible with
+ SocksCAP/FreeCAP for UDP)
+ + Transparent SOCKS->HTTP redirection
+ ! Transparent SOCKS->FTP redirection
+ ! Transparent SOCKS->POP3 redirection
+ + POP3 Proxy
+ ! FTP proxy
+ ! DNS proxy
+ + TCP port mapper
+ + UDP port mapper
+ + Threaded application (no child process).
+ ! Web administration and statistics
+ 2. Proxy chaining
+ + Parent proxy support for any type of incoming connection
+ + Username/password authentication for parent proxy(s).
+ + HTTPS/SOCKS4/SOCKS5 and redirection parent support
+ + Random parent selection
+ + Chain building (multihop proxing)
+ 3. Logging
+ + turnable log format compatible with any log parser
+ + stdout logging
+ + file logging
+ + syslog logging (Unix)
+ + ODBC logging (Windows and Unix)
+ + log file rotation (hourly, daily, weekly, monthly)
+ + automatic log file comperssion with external archiver (for files)
+ + automatic removal of older log files
+ ! Character filtering for log files
+ ! different log files for different servces are supported
+ 4. Access control
+ + ACL-driven (user/source/destination/protocol/weekday/daytime or
+ combined) bandwith limitation for incoming and (!)outgoing trafic.
+ + ACL-driven (user/source/destination/protocol/weekday/daytime or
+ combined) traffic limitation per day, week or month
+ + User authorization by NetBIOS messanger name
+ + Access control by username, source IP, destination IP, destination
+ port and destination action (POST, PUT, GET, etc), weekday and daytime.
+ + Access control by username/password for SOCKSv5 and HTTP/HTTPS/FTP
+ + Cleartext or encrypted (crypt/MD5 or NT) passwords.
+ + Connection redirection
+ + Access control by requested action (CONNECT/BIND,
+ HTTP GET/POST/PUT/HEAD/OTHER).
+ ! NTLM authentication for HTTP proxy access
+ ! All access controle entries now support weekday and daytime
+ limitations.
+ 5. Configuration
+ + support for configuration files
+ + support for includes in configuration files
+ + interface binding
+ + running as daemon process
+ + utility for automated networks list building
+ ! configuration reload on any file change
+ Unix
+ + support for chroot
+ + support for setgid
+ + support for setuid
+ ! support for signals
+ Windows NT/2K/XP/2K3
+ + support --install as service
+ + support --remove as service
+ + support for service START, STOP, PAUSE and CONTINUE commands (on
+ PAUSE no new connection accepted, but active connections still in
+ progress, on CONTINUE configuration is reloaded)
+ Windows 95/98/ME
+ ! support --install as service
+ ! support --remove as service
+ 6. Compilation
+ + MSVC (msvcrt.dll)
+ + Intel Windows Compiler (msvcrt.dll)
+ + Windows/gcc (msvcrt.dll)
+ + Cygwin/gcc (cygwin.dll)
+ + Unix/gcc
+ + Unix/ccc
+ ! Solaris
+
+
+ Planned for future (0.6) release:
+ - External modules API
+ - Addon URL, antiviral, HTTP cache filters modules, authentication
+ modules for different protocols (RADIUS, PAM, integrated system, etc).
+
+$Id: news,v 1.2 2007/03/01 16:19:43 vlad Exp $
\ No newline at end of file
diff --git a/scripts/3proxy.cfg b/scripts/3proxy.cfg
new file mode 100644
index 0000000..a2d7a06
--- /dev/null
+++ b/scripts/3proxy.cfg
@@ -0,0 +1,32 @@
+#!/usr/local/etc/3proxy/bin/3proxy
+daemon
+pidfile /usr/local/etc/3proxy/3proxy.pid
+nscache 65536
+nserver 127.0.0.1
+
+config /usr/local/etc/3proxy/3proxy.cfg
+monitor /usr/local/etc/3proxy/3proxy.cfg
+monitor /usr/local/etc/3proxy/counters
+monitor /usr/local/etc/3proxy/passwd
+monitor /usr/local/etc/3proxy/bandlimiters
+
+log /usr/local/etc/3proxy/log/log D
+rotate 60
+counter /usr/local/etc/3proxy/3proxy.3cf
+
+users $/usr/local/etc/3proxy/passwd
+
+include /usr/local/etc/3proxy/counters
+include /usr/local/etc/3proxy/bandlimiters
+
+auth strong
+deny * * 127.0.0.1
+allow *
+proxy -n
+socks
+flush
+allow admin
+
+admin -p8080
+
+
diff --git a/scripts/add3proxyuser.sh b/scripts/add3proxyuser.sh
new file mode 100644
index 0000000..bd63a98
--- /dev/null
+++ b/scripts/add3proxyuser.sh
@@ -0,0 +1,10 @@
+#!/bin/sh
+if [ $4 ]; then
+ echo $1:`/usr/local/etc/3proxy/bin/mycrypt $$ $2` >> /usr/local/etc/3proxy/passwd
+ echo countin \"`wc -l /usr/local/etc/3proxy/counters|awk '{print $1}'`/$1\" D $3 $1 >> /usr/local/etc/3proxy/counters
+ echo bandlimin $4 $1 >> /usr/local/etc/3proxy/bandlimiters
+else
+ echo usage: $0 username password day_limit bandwidth
+ echo " "day_limit - traffic limit in MB per day
+ echo " "bandwidth - bandwith in bits per second 1048576 = 1Mbps
+fi
diff --git a/scripts/install-unix.sh b/scripts/install-unix.sh
new file mode 100644
index 0000000..a165550
--- /dev/null
+++ b/scripts/install-unix.sh
@@ -0,0 +1,21 @@
+#!/bin/sh
+cd ..
+cp Makefile.unix Makefile
+make
+if [ ! -d /usr/local/etc/3proxy/bin ]; then mkdir -p /usr/local/etc/3proxy/bin/; fi
+install src/3proxy /usr/local/etc/3proxy/bin/3proxy
+install src/mycrypt /usr/local/etc/3proxy/bin/mycrypt
+install scripts/rc.d/proxy.sh /usr/local/etc/rc.d/proxy.sh
+install scripts/add3proxyuser.sh /usr/local/etc/3proxy/bin/
+if [ -s /usr/local/etc/3proxy/3proxy.cfg ]; then
+ echo /usr/local/etc/3proxy/3proxy.cfg already exists
+else
+ install scripts/3proxy.cfg /usr/local/etc/3proxy/
+ if [ ! -d /var/log/3proxy/ ]; then
+ mkdir /var/log/3proxy/
+ fi
+ touch /usr/local/etc/3proxy/passwd
+ touch /usr/local/etc/3proxy/counters
+ touch /usr/local/etc/3proxy/bandlimiters
+ echo Run /usr/local/etc/3proxy/bin/add3proxyuser.sh to add \'admin\' user
+fi
diff --git a/scripts/rc.d/proxy.sh b/scripts/rc.d/proxy.sh
new file mode 100644
index 0000000..c157486
--- /dev/null
+++ b/scripts/rc.d/proxy.sh
@@ -0,0 +1,48 @@
+#!/bin/sh
+#
+# chkconfig: 2345 20 80
+# description: 3proxy tiny proxy server
+#
+#
+#
+#
+
+case "$1" in
+ start)
+ echo Starting 3Proxy
+
+ /usr/local/etc/3proxy/bin/3proxy /usr/local/etc/3proxy/3proxy.cfg
+
+ RETVAL=$?
+ echo
+ [ $RETVAL ]
+ ;;
+
+ stop)
+ echo Stopping 3Proxy
+ if [ /usr/local/etc/3proxy/3proxy.pid ]; then
+ /bin/kill `cat /usr/local/etc/3proxy/3proxy.pid`
+ else
+ /usr/bin/killall 3proxy
+ fi
+
+ RETVAL=$?
+ echo
+ [ $RETVAL ]
+ ;;
+
+ restart|reload)
+ echo Reloading 3Proxy
+ if [ /usr/local/etc/3proxy/3proxy.pid ]; then
+ /bin/kill -s USR1 `cat /usr/local/etc/3proxy/3proxy.pid`
+ else
+ /usr/bin/killall -s USR1 3proxy
+ fi
+ ;;
+
+
+ *)
+ echo Usage: $0 "{start|stop|restart}"
+ exit 1
+esac
+exit 0
\ No newline at end of file
diff --git a/src/3proxy.c b/src/3proxy.c
new file mode 100644
index 0000000..ba35112
--- /dev/null
+++ b/src/3proxy.c
@@ -0,0 +1,2027 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: 3proxy.c,v 1.132 2011-08-15 19:52:26 vlad Exp $
+*/
+
+#include "proxy.h"
+#ifndef _WIN32
+#ifndef NOPLUGINS
+#include
+#endif
+#endif
+
+#ifndef DEFAULTCONFIG
+#define DEFAULTCONFIG conf.stringtable[25]
+#endif
+
+typedef int (*MAINFUNC)(int, char**);
+
+pthread_mutex_t bandlim_mutex;
+pthread_mutex_t tc_mutex;
+pthread_mutex_t pwl_mutex;
+pthread_mutex_t hash_mutex;
+
+#ifndef NOODBC
+pthread_mutex_t odbc_mutex;
+#endif
+
+int readconfig(FILE * fp);
+
+
+int haveerror = 0;
+int linenum = 0;
+
+time_t basetime = 0;
+
+void doschedule(void);
+
+struct counter_header {
+ unsigned char sig[4];
+ time_t updated;
+} cheader = {"3CF", (time_t)0};
+
+struct counter_record {
+ unsigned long traf;
+ unsigned long trafgb;
+ time_t cleared;
+ time_t updated;
+} crecord;
+
+
+int mainfunc (int argc, char** argv);
+
+struct proxydef childdef = {NULL, 0, 0, S_NOSERVICE, ""};
+
+#define STRINGBUF 65535
+#define NPARAMS 4096
+
+unsigned char tmpbuf[1024];
+FILE *writable;
+
+extern unsigned char *strings[];
+
+#ifndef _WIN32
+char *chrootp = NULL;
+#endif
+char * curconf = NULL;
+
+FILE * confopen(){
+ curconf = conf.conffile;
+#ifndef _WIN32
+ if(chrootp){
+ if(strstr(curconf, chrootp) == curconf)
+ curconf += strlen(chrootp);
+ }
+#endif
+ if(writable) {
+ rewind(writable);
+ return writable;
+ }
+ return fopen(curconf, "r");
+}
+
+
+void clearall(){
+ freeconf(&conf);
+}
+
+#ifdef _WIN32
+OSVERSIONINFO osv;
+int service = 0;
+
+void cyclestep(void);
+#ifndef _WINCE
+SERVICE_STATUS_HANDLE hSrv;
+DWORD dwCurrState;
+int SetStatus( DWORD dwState, DWORD dwExitCode, DWORD dwProgress )
+{
+ SERVICE_STATUS srvStatus;
+ srvStatus.dwServiceType = SERVICE_WIN32_OWN_PROCESS;
+ srvStatus.dwCurrentState = dwCurrState = dwState;
+ srvStatus.dwControlsAccepted = SERVICE_ACCEPT_STOP | SERVICE_ACCEPT_PAUSE_CONTINUE | SERVICE_ACCEPT_SHUTDOWN;
+ srvStatus.dwWin32ExitCode = dwExitCode;
+ srvStatus.dwServiceSpecificExitCode = 0;
+ srvStatus.dwCheckPoint = dwProgress;
+ srvStatus.dwWaitHint = 3000;
+ return SetServiceStatus( hSrv, &srvStatus );
+}
+
+void __stdcall CommandHandler( DWORD dwCommand )
+{
+ FILE *fp;
+ int error;
+ switch( dwCommand )
+ {
+ case SERVICE_CONTROL_STOP:
+ case SERVICE_CONTROL_SHUTDOWN:
+ SetStatus( SERVICE_STOP_PENDING, 0, 1 );
+ conf.paused++;
+ conf.timetoexit = 1;
+ Sleep(2000);
+ SetStatus( SERVICE_STOPPED, 0, 0 );
+#ifndef NOODBC
+ pthread_mutex_lock(&odbc_mutex);
+ close_sql();
+ pthread_mutex_unlock(&odbc_mutex);
+#endif
+ break;
+ case SERVICE_CONTROL_PAUSE:
+ SetStatus( SERVICE_PAUSE_PENDING, 0, 1 );
+ conf.paused++;
+ SetStatus( SERVICE_PAUSED, 0, 0 );
+ break;
+ case SERVICE_CONTROL_CONTINUE:
+ SetStatus( SERVICE_CONTINUE_PENDING, 0, 1 );
+ clearall();
+ fp = confopen();
+ if(fp){
+ error = readconfig(fp);
+ if(error) {
+ clearall();
+ }
+ if(!writable)fclose(fp);
+ }
+ SetStatus( SERVICE_RUNNING, 0, 0 );
+ break;
+ default: ;
+ }
+}
+
+
+void __stdcall ServiceMain(int argc, unsigned char* argv[] )
+{
+
+ hSrv = RegisterServiceCtrlHandler(conf.stringtable[1], (LPHANDLER_FUNCTION)CommandHandler);
+ if( hSrv == 0 ) return;
+
+ SetStatus( SERVICE_START_PENDING, 0, 1 );
+ SetStatus( SERVICE_RUNNING, 0, 0 );
+ cyclestep();
+}
+#endif
+
+#else
+
+
+void mysigusr1 (int sig){
+ conf.needreload = 1;
+}
+
+int even = 0;
+
+void mysigpause (int sig){
+
+ conf.paused++;
+ even = !even;
+ if(!even){
+ conf.needreload = 1;
+ }
+}
+
+void mysigterm (int sig){
+ conf.paused++;
+ usleep(999*SLEEPTIME);
+ usleep(999*SLEEPTIME);
+#ifndef NOODBC
+ pthread_mutex_lock(&odbc_mutex);
+ close_sql();
+ pthread_mutex_unlock(&odbc_mutex);
+#endif
+ conf.timetoexit = 1;
+}
+
+#endif
+
+void dumpmem(void);
+
+
+int reload (void){
+ FILE *fp;
+ int error = -2;
+
+ conf.paused++;
+ clearall();
+ conf.paused++;
+
+ fp = confopen();
+ if(fp){
+ error = readconfig(fp);
+ if(error) {
+ clearall();
+ }
+ if(!writable)fclose(fp);
+ }
+ return error;
+}
+
+struct schedule *schedule;
+
+#ifdef _WIN32
+DWORD WINAPI startsrv(LPVOID data) {
+#else
+void * startsrv(void * data) {
+#endif
+ struct child *d = (struct child *)data;
+ mainfunc(d->argc, (char **)d->argv);
+ return 0;
+}
+
+int included =0;
+
+int getrotate(char c){
+ switch(c){
+ case 'c':
+ case 'C':
+ return MINUTELY;
+ case 'h':
+ case 'H':
+ return HOURLY;
+ case 'd':
+ case 'D':
+ return DAILY;
+ case 'w':
+ case 'W':
+ return WEEKLY;
+ case 'y':
+ case 'Y':
+ return ANNUALLY;
+ case 'm':
+ case 'M':
+ return MONTHLY;
+ default:
+ return NEVER;
+ }
+}
+
+int parsestr (unsigned char *str, unsigned char **argm, int nitems, unsigned char ** buff, int *inbuf, int *bufsize){
+#define buf (*buff)
+ int argc = 0;
+ int space = 1;
+ int comment = 0;
+ unsigned char * incbegin = 0;
+ int fd;
+ int res, len;
+ int i = 1;
+ unsigned char *str1;
+
+ for(;;str++){
+ if(*str == '\"'){
+ str1 = str;
+ do {
+ *str1 = *(str1 + 1);
+ }while(*(str1++));
+ if(!comment || *str != '\"'){
+ comment = !comment;
+ }
+ }
+ switch(*str){
+ case '\0':
+ if(comment) return -1;
+ argm[argc] = 0;
+ return argc;
+ case '$':
+ if(!comment && !included){
+ incbegin = str;
+ *str = 0;
+ }
+ break;
+ case '\r':
+ case '\n':
+ case '\t':
+ case ' ':
+ if(!comment){
+ *str = 0;
+ space = 1;
+ i = 0;
+ if(incbegin){
+ argc--;
+ if((fd = open((char *)incbegin+1, O_RDONLY)) <= 0){
+ fprintf(stderr, "Failed to open %s\n", incbegin+1);
+ break;
+ }
+ if((*bufsize - *inbuf) = nitems) return argc;
+ space = 0;
+ }
+ }
+ }
+#undef buf
+}
+
+
+unsigned char * dologname (unsigned char *buf, unsigned char *name, const unsigned char *ext, ROTATION lt, time_t t) {
+ struct tm *ts;
+
+ ts = localtime(&t);
+ if(strchr((char *)name, '%')){
+ struct clientparam fakecli;
+
+ memset(&fakecli, 0, sizeof(fakecli));
+ dobuf2(&fakecli, buf, NULL, NULL, ts, (char *)name);
+ return buf;
+ }
+ switch(lt){
+ case NONE:
+ sprintf((char *)buf, "%s", name);
+ break;
+ case ANNUALLY:
+ sprintf((char *)buf, "%s.%04d", name, ts->tm_year+1900);
+ break;
+ case MONTHLY:
+ sprintf((char *)buf, "%s.%04d.%02d", name, ts->tm_year+1900, ts->tm_mon+1);
+ break;
+ case WEEKLY:
+ t = t - (ts->tm_wday * (60*60*24));
+ ts = localtime(&t);
+ sprintf((char *)buf, "%s.%04d.%02d.%02d", name, ts->tm_year+1900, ts->tm_mon+1, ts->tm_mday);
+ break;
+ case DAILY:
+ sprintf((char *)buf, "%s.%04d.%02d.%02d", name, ts->tm_year+1900, ts->tm_mon+1, ts->tm_mday);
+ break;
+ case HOURLY:
+ sprintf((char *)buf, "%s.%04d.%02d.%02d-%02d", name, ts->tm_year+1900, ts->tm_mon+1, ts->tm_mday, ts->tm_hour);
+ break;
+ case MINUTELY:
+ sprintf((char *)buf, "%s.%04d.%02d.%02d-%02d.%02d", name, ts->tm_year+1900, ts->tm_mon+1, ts->tm_mday, ts->tm_hour, ts->tm_min);
+ break;
+ default:
+ break;
+ }
+ if(ext){
+ strcat((char *)buf, ".");
+ strcat((char *)buf, (char *)ext);
+ }
+ return buf;
+}
+
+int wday = 0;
+
+int timechanged (time_t oldtime, time_t newtime, ROTATION lt){
+ struct tm tmold;
+ struct tm *tm;
+ tm = localtime(&oldtime);
+ memcpy(&tmold, tm, sizeof(tmold));
+ tm = localtime(&newtime);
+ switch(lt){
+ case MINUTELY:
+ if(tm->tm_min != tmold.tm_min)return 1;
+ break;
+ case HOURLY:
+ if(tm->tm_hour != tmold.tm_hour)return 1;
+ break;
+ case DAILY:
+ if(tm->tm_yday != tmold.tm_yday)return 1;
+ break;
+ case MONTHLY:
+ if(tm->tm_mon != tmold.tm_mon)return 1;
+ break;
+ case ANNUALLY:
+ if(tm->tm_year != tmold.tm_year)return 1;
+ break;
+ case WEEKLY:
+ if(((newtime - oldtime) > (60*60*24*7))
+ || tm->tm_wday < tmold.tm_wday
+ || (tm->tm_wday == tmold.tm_wday && (newtime - oldtime) > (60*60*24*6))
+ )return 1;
+ break;
+ default:
+ break;
+ }
+ return 0;
+}
+
+void doschedule(void){
+ struct schedule *sched, *prevsched = NULL, *nextsched;
+ int res;
+
+ conf.time = time(0);
+ for(sched=schedule; sched; sched=sched->next){
+ if(conf.needreload || conf.timetoexit || (conf.time > sched->start_time && timechanged(sched->start_time, conf.time, sched->type))){
+ sched->start_time = conf.time;
+ nextsched = sched->next;
+ res = (*sched->function)(sched->data);
+ switch(res){
+ case 1:
+ if(prevsched) prevsched->next = nextsched;
+ else schedule = nextsched;
+ break;
+ }
+ }
+ prevsched = sched;
+ }
+}
+
+void dumpcounters(struct trafcount *tlin, int counterd){
+
+ struct trafcount *tl;
+ if(counterd >= 0 && tlin) {
+
+ conf.time = time(0);
+ if(cheader.updated && conf.countertype && timechanged(cheader.updated, conf.time, conf.countertype)){
+ FILE * cfp;
+
+ cfp = fopen((char *)dologname(tmpbuf, (unsigned char *)conf.counterfile, NULL, conf.countertype, cheader.updated), "w");
+ if(cfp){
+ for(tl = tlin; cfp && tl; tl = tl->next){
+ if(tl->type >= conf.countertype)
+ fprintf(cfp, "%05d %010lu %010lu%s%s\n", tl->number, tl->trafgb, tl->traf, tl->comment?" #" : "", tl->comment? tl->comment : "");
+ }
+ fclose(cfp);
+ }
+ }
+
+
+ cheader.updated = conf.time;
+ lseek(counterd, 0, SEEK_SET);
+ write(counterd, &cheader, sizeof(struct counter_header));
+ for(tl=tlin; tl; tl = tl->next){
+ if(tl->number){
+ lseek(counterd,
+ sizeof(struct counter_header) + (tl->number - 1) * sizeof(struct counter_record),
+ SEEK_SET);
+ crecord.traf = tl->traf;
+ crecord.trafgb = tl->trafgb;
+ crecord.cleared = tl->cleared;
+ crecord.updated = tl->updated;
+ write(counterd, &crecord, sizeof(struct counter_record));
+ }
+ if(tl->type!=NEVER && timechanged(tl->cleared, conf.time, tl->type)){
+ tl->cleared = conf.time;
+ tl->traf = 0;
+ tl->trafgb = 0;
+ }
+ }
+ }
+}
+
+void cyclestep(void){
+ struct tm *tm;
+ time_t minutecounter;
+
+ minutecounter = time(0);
+ for(;;){
+ usleep(SLEEPTIME*999);
+
+ conf.time = time(0);
+ if(conf.needreload) {
+ doschedule();
+ reload();
+ conf.needreload = 0;
+ }
+ doschedule();
+ if(conf.stdlog)fflush(conf.stdlog);
+ if(timechanged(minutecounter, conf.time, MINUTELY)) {
+ struct filemon *fm;
+ struct stat sb;
+
+ for(fm=conf.fmon; fm; fm=fm->next){
+ if(!stat(fm->path, &sb)){
+ if(fm->sb.st_mtime != sb.st_mtime || fm->sb.st_size != sb.st_size){
+ stat(fm->path, &fm->sb);
+ conf.needreload = 1;
+ }
+ }
+ }
+
+ }
+ if(timechanged(basetime, conf.time, DAILY)) {
+ tm = localtime(&conf.time);
+ wday = (1 << tm->tm_wday);
+ tm->tm_hour = tm->tm_min = tm->tm_sec = 0;
+ basetime = mktime(tm);
+ }
+ if(conf.logname) {
+ if(timechanged(conf.logtime, conf.time, conf.logtype)) {
+ FILE *fp, *fp1;
+ fp = fopen((char *)dologname (tmpbuf, conf.logname, NULL, conf.logtype, conf.time), "a");
+ if (fp) {
+ fp1 = conf.stdlog;
+ conf.stdlog = fp;
+ if(fp1) fclose(fp1);
+ }
+ fseek(stdout, 0L, SEEK_END);
+ usleep(SLEEPTIME);
+ conf.logtime = conf.time;
+ if(conf.logtype != NONE && conf.rotate) {
+ int t;
+ t = 1;
+ switch(conf.logtype){
+ case ANNUALLY:
+ t = t * 12;
+ case MONTHLY:
+ t = t * 4;
+ case WEEKLY:
+ t = t * 7;
+ case DAILY:
+ t = t * 24;
+ case HOURLY:
+ t = t * 60;
+ case MINUTELY:
+ t = t * 60;
+ default:
+ break;
+ }
+ dologname (tmpbuf, conf.logname, (conf.archiver)?conf.archiver[1]:NULL, conf.logtype, (conf.logtime - t * conf.rotate));
+ remove ((char *) tmpbuf);
+ if(conf.archiver) {
+ int i;
+ *tmpbuf = 0;
+ for(i = 2; i < conf.archiverc && strlen((char *)tmpbuf) < 512; i++){
+ strcat((char *)tmpbuf, " ");
+ if(!strcmp((char *)conf.archiver[i], "%A")){
+ strcat((char *)tmpbuf, "\"");
+ dologname (tmpbuf + strlen((char *)tmpbuf), conf.logname, conf.archiver[1], conf.logtype, (conf.logtime - t));
+ strcat((char *)tmpbuf, "\"");
+ }
+ else if(!strcmp((char *)conf.archiver[i], "%F")){
+ strcat((char *)tmpbuf, "\"");
+ dologname (tmpbuf+strlen((char *)tmpbuf), conf.logname, NULL, conf.logtype, (conf.logtime-t));
+ strcat((char *)tmpbuf, "\"");
+ }
+ else
+ strcat((char *)tmpbuf, (char *)conf.archiver[i]);
+ }
+ system((char *)tmpbuf+1);
+ }
+ }
+ }
+ }
+ if(conf.counterd >= 0 && conf.trafcounter) {
+ if(timechanged(cheader.updated, conf.time, MINUTELY)){
+ dumpcounters(conf.trafcounter, conf.counterd);
+ }
+ }
+ if(conf.timetoexit){
+ conf.paused++;
+ doschedule();
+ usleep(SLEEPTIME*999);
+ usleep(SLEEPTIME*999);
+ usleep(SLEEPTIME*999);
+ return;
+ }
+
+ }
+}
+
+
+#define RETURN(x) {res = x; goto CLEARRETURN;}
+
+
+int start_proxy_thread(struct child * chp){
+ pthread_t thread;
+#ifdef _WIN32
+ HANDLE h;
+#endif
+
+ conf.threadinit = 1;
+#ifdef _WIN32
+#ifndef _WINCE
+ h = (HANDLE)_beginthreadex((LPSECURITY_ATTRIBUTES )NULL, 16384, startsrv, (void *) chp, (DWORD)0, &thread);
+#else
+ h = (HANDLE)CreateThread((LPSECURITY_ATTRIBUTES )NULL, 16384, startsrv, (void *) chp, (DWORD)0, &thread);
+#endif
+ if(h)CloseHandle(h);
+#else
+ pthread_attr_init(&pa);
+ pthread_attr_setstacksize(&pa,PTHREAD_STACK_MIN + 16384);
+ pthread_attr_setdetachstate(&pa,PTHREAD_CREATE_DETACHED);
+ pthread_create(&thread, &pa, startsrv, (void *)chp);
+#endif
+ while(conf.threadinit)usleep(SLEEPTIME);
+ if(haveerror) {
+ fprintf(stderr, "Service not started on line: %d\n", linenum);
+ return(40);
+ }
+ return 0;
+}
+
+static int h_proxy(int argc, unsigned char ** argv){
+ struct child ch;
+
+ ch.argc = argc;
+ ch.argv = argv;
+ if(!strcmp((char *)argv[0], "proxy")) {
+ childdef.pf = proxychild;
+ childdef.port = 3128;
+ childdef.isudp = 0;
+ childdef.service = S_PROXY;
+ childdef.helpmessage = " -n - no NTLM support\n";
+ }
+ else if(!strcmp((char *)argv[0], "pop3p")) {
+ childdef.pf = pop3pchild;
+ childdef.port = 110;
+ childdef.isudp = 0;
+ childdef.service = S_POP3P;
+ childdef.helpmessage = " -hdefault_host[:port] - use this host and port as default if no host specified\n";
+ }
+ else if(!strcmp((char *)argv[0], "smtpp")) {
+ childdef.pf = smtppchild;
+ childdef.port = 25;
+ childdef.isudp = 0;
+ childdef.service = S_SMTPP;
+ childdef.helpmessage = " -hdefault_host[:port] - use this host and port as default if no host specified\n";
+ }
+ else if(!strcmp((char *)argv[0], "ftppr")) {
+ childdef.pf = ftpprchild;
+ childdef.port = 21;
+ childdef.isudp = 0;
+ childdef.service = S_FTPPR;
+ childdef.helpmessage = " -hdefault_host[:port] - use this host and port as default if no host specified\n";
+ }
+ else if(!strcmp((char *)argv[0], "socks")) {
+ childdef.pf = sockschild;
+ childdef.port = 1080;
+ childdef.isudp = 0;
+ childdef.service = S_SOCKS;
+ childdef.helpmessage = " -n - no NTLM support\n";
+ }
+ else if(!strcmp((char *)argv[0], "tcppm")) {
+ childdef.pf = tcppmchild;
+ childdef.port = 0;
+ childdef.isudp = 0;
+ childdef.service = S_TCPPM;
+ childdef.helpmessage = "";
+ }
+ else if(!strcmp((char *)argv[0], "icqpr")) {
+ childdef.pf = icqprchild;
+ childdef.port = 0;
+ childdef.isudp = 0;
+ childdef.service = S_ICQPR;
+ childdef.helpmessage = "";
+ }
+ else if(!strcmp((char *)argv[0], "msnpr")) {
+ childdef.pf = msnprchild;
+ childdef.port = 0;
+ childdef.isudp = 0;
+ childdef.service = S_MSNPR;
+ childdef.helpmessage = "";
+ }
+ else if(!strcmp((char *)argv[0], "udppm")) {
+ childdef.pf = udppmchild;
+ childdef.port = 0;
+ childdef.isudp = 1;
+ childdef.service = S_UDPPM;
+ childdef.helpmessage = " -s single packet UDP service for request/reply (DNS-like) services\n";
+ }
+ else if(!strcmp((char *)argv[0], "admin")) {
+ childdef.pf = adminchild;
+ childdef.port = 80;
+ childdef.isudp = 0;
+ childdef.service = S_ADMIN;
+ }
+ else if(!strcmp((char *)argv[0], "dnspr")) {
+ childdef.pf = dnsprchild;
+ childdef.port = 53;
+ childdef.isudp = 1;
+ childdef.service = S_DNSPR;
+ }
+ return start_proxy_thread(&ch);
+}
+
+static int h_internal(int argc, unsigned char ** argv){
+ conf.intip = getip(argv[1]);
+ return 0;
+}
+
+static int h_external(int argc, unsigned char ** argv){
+ conf.extip = getip(argv[1]);
+ return 0;
+}
+
+static int h_log(int argc, unsigned char ** argv){
+ conf.logfunc = logstdout;
+ if(conf.logtarget){
+ myfree(conf.logtarget);
+ conf.logtarget = NULL;
+ }
+ if(argc > 1) {
+ conf.logtarget = (unsigned char *)mystrdup((char *)argv[1]);
+ if(*argv[1]=='@'){
+#ifndef _WIN32
+ openlog((char *)conf.logtarget+1, LOG_PID, LOG_DAEMON);
+ conf.logfunc = logsyslog;
+#endif
+ }
+#ifndef NOODBC
+ else if(*argv[1]=='&'){
+ pthread_mutex_lock(&odbc_mutex);
+ close_sql();
+ init_sql((char *)argv[1]+1);
+ pthread_mutex_unlock(&odbc_mutex);
+ conf.logfunc = logsql;
+ }
+#endif
+ else {
+ FILE *fp, *fp1;
+ if(argc > 2) {
+ conf.logtype = getrotate(*argv[2]);
+ }
+ conf.logtime = time(0);
+ if(conf.logname)myfree(conf.logname);
+ conf.logname = (unsigned char *)mystrdup((char *)argv[1]);
+ fp = fopen((char *)dologname (tmpbuf, conf.logname, NULL, conf.logtype, conf.logtime), "a");
+ if(!fp){
+ perror("fopen()");
+ return 1;
+ }
+ else {
+ fp1 = conf.stdlog;
+ conf.stdlog = fp;
+ if(fp1) fclose(fp1);
+#ifdef _WINCE
+ freopen(tmpbuf, "w", stdout);
+ freopen(tmpbuf, "w", stderr);
+#endif
+ }
+ }
+ }
+ return 0;
+}
+
+static int h_service(int argc, unsigned char **argv){
+#ifdef _WIN32
+ if(osv.dwPlatformId == VER_PLATFORM_WIN32_NT) service = 1;
+ else {
+ if(!conf.demon)daemonize();
+ conf.demon = 1;
+ }
+#endif
+ return 0;
+}
+
+static int h_daemon(int argc, unsigned char **argv){
+ if(!conf.demon)daemonize();
+ conf.demon = 1;
+ return 0;
+}
+
+static int h_config(int argc, unsigned char **argv){
+ if(conf.conffile)myfree(conf.conffile);
+ conf.conffile = mystrdup((char *)argv[1]);
+ return 0;
+}
+
+static int h_include(int argc, unsigned char **argv){
+ int res;
+ FILE *fp1;
+
+ fp1 = fopen((char *)argv[1], "r");
+ if(!fp1){
+ fprintf(stderr, "Unable to open included file: %s\n", argv[1]);
+ return 1;
+ }
+ res = readconfig(fp1);
+ fclose(fp1);
+ return res;
+}
+
+static int h_archiver(int argc, unsigned char **argv){
+ int j;
+
+ conf.archiver = myalloc(argc * sizeof(char *));
+ if(conf.archiver) {
+ conf.archiverc = argc;
+ for(j = 0; j < conf.archiverc; j++) conf.archiver[j] = (unsigned char *)mystrdup((char *)argv[j]);
+ }
+ return 0;
+}
+
+static int h_counter(int argc, unsigned char **argv){
+ struct counter_header ch1;
+ if(conf.counterd >=0)close(conf.counterd);
+ if(!conf.trafcountfunc) conf.trafcountfunc = trafcountfunc;
+ conf.counterd = open((char *)argv[1], O_BINARY|O_RDWR|O_CREAT, 0660);
+ if(conf.counterd<0){
+ fprintf(stderr, "Unable to open counter file %s, line %d\n", argv[1], linenum);
+ return 1;
+ }
+ if(read(conf.counterd, &ch1, sizeof(ch1))==sizeof(ch1)){
+ if(memcmp(&ch1, &cheader, 4)){
+ fprintf(stderr, "Not a counter file %s, line %d\n", argv[1], linenum);
+ return 2;
+ }
+#ifdef _MSC_VER
+#ifdef _TIME64_T_DEFINED
+#ifndef _MAX__TIME64_T
+#define _MAX__TIME64_T 0x793406fffi64
+#endif
+#endif
+ if(ch1.updated >= _MAX__TIME64_T){
+ fprintf(stderr, "Invalid or corrupted counter file %s. Use countersutil utility to convert from older version\n", argv[1]);
+ return 3;
+ }
+#endif
+ cheader.updated = ch1.updated;
+ }
+ if(argc >=4) {
+ conf.countertype = getrotate(*argv[2]);
+ if(conf.counterfile) myfree(conf.counterfile);
+ conf.counterfile = mystrdup((char *)argv[3]);
+ }
+ return 0;
+}
+
+static int h_rotate(int argc, unsigned char **argv){
+ conf.rotate = atoi((char *)argv[1]);
+ return 0;
+}
+
+static int h_logformat(int argc, unsigned char **argv){
+ if(conf.logformat) myfree(conf.logformat);
+ conf.logformat = (unsigned char *)mystrdup((char *)argv[1]);
+ return 0;
+}
+
+static int h_timeouts(int argc, unsigned char **argv){
+ int j;
+
+ for(j = 0; conf.timeouts[j] && j + 1 < argc; j++) {
+ if((conf.timeouts[j] = atoi((char *)argv[j + 1])) <= 0 || conf.timeouts[j] > 2000000){
+ fprintf(stderr, "Invalid timeout: %s, line %d\n", argv[j + 1], linenum);
+ return(1);
+ }
+ }
+ return 0;
+}
+
+static int h_noop(int argc, unsigned char **argv){
+ return 0;
+}
+
+static int h_auth(int argc, unsigned char **argv){
+ struct auth *au, * newau;
+
+ freeauth(conf.authfuncs);
+ conf.authfuncs = NULL;
+ if(!conf.bandlimfunc)conf.bandlimfunc = bandlimitfunc;
+ for(argc--; argc; argc--){
+ for(au = authfuncs; au; au=au->next){
+ if(!strcmp((char *)argv[argc], au->desc)){
+ newau = myalloc(sizeof(struct auth));
+ newau->next = conf.authfuncs;
+ conf.authfuncs = newau;
+ conf.authfuncs->desc = au->desc;
+ conf.authfuncs->authenticate = au->authenticate;
+ conf.authfuncs->authorize = au->authorize;
+ break;
+ }
+ }
+ if(!au) return 1;
+ }
+ conf.authfunc = doauth;
+ return 0;
+}
+
+static int h_users(int argc, unsigned char **argv){
+ int j;
+ unsigned char *arg;
+ struct passwords *pwl = NULL;
+
+ for (j = 1; jnext = conf.pwl;
+ conf.pwl = pwl;
+ arg = (unsigned char *)strchr((char *)argv[j], ':');
+ if(!arg||!arg[1]||!arg[2]||arg[3]!=':') {
+ pwl->user = (unsigned char *)mystrdup((char *)argv[j]);
+ pwl->pwtype = SYS;
+ continue;
+ }
+ *arg = 0;
+ pwl->user = (unsigned char *)mystrdup((char *)argv[j]);
+ if((arg[1] == 'C' && arg[2] == 'L' && (pwl->pwtype = CL)) ||
+ (arg[1] == 'C' && arg[2] == 'R' && (pwl->pwtype = CR)) ||
+ (arg[1] == 'N' && arg[2] == 'T' && (pwl->pwtype = NT)) ||
+ (arg[1] == 'L' && arg[2] == 'M' && (pwl->pwtype = LM))){
+ pwl->password = (unsigned char *)mystrdup((char *)arg+4);
+ }
+ else {
+ pwl->password = (unsigned char *) mystrdup((char *)arg + 1);
+ pwl->pwtype = UN;
+ }
+
+ }
+ return 0;
+}
+
+static int h_maxconn(int argc, unsigned char **argv){
+ conf.maxchild = atoi((char *)argv[1]);
+ if(!conf.maxchild) {
+ return(1);
+ }
+ return 0;
+}
+
+static int h_flush(int argc, unsigned char **argv){
+ freeacl(conf.acl);
+ conf.acl = NULL;
+ return 0;
+}
+
+/*
+static int h_flushusers(int argc, unsigned char **argv){
+ freepwl(conf.pwl);
+ conf.pwl = NULL;
+ return 0;
+}
+*/
+
+static int h_nserver(int argc, unsigned char **argv){
+ int res;
+
+ for(res = 0; nservers[res] && res < MAXNSERVERS; res++);
+ if(res < MAXNSERVERS) {
+ nservers[res] = getip(argv[1]);
+ }
+ resolvfunc = myresolver;
+ return 0;
+}
+
+static int h_authnserver(int argc, unsigned char **argv){
+
+ authnserver = getip(argv[1]);
+ return 0;
+}
+
+static int h_fakeresolve(int argc, unsigned char **argv){
+ resolvfunc = fakeresolver;
+ return 0;
+}
+
+static int h_nscache(int argc, unsigned char **argv){
+ int res;
+
+ res = atoi((char *)argv[1]);
+ if(res < 256) {
+ fprintf(stderr, "Invalid NS cache size: %d\n", res);
+ return 1;
+ }
+ if(initdnshashtable((unsigned)res)){
+ fprintf(stderr, "Failed to initialize NS cache\n");
+ return 2;
+ }
+ return 0;
+}
+
+static int h_nsrecord(int argc, unsigned char **argv){
+ hashadd(&dns_table, argv[1], getip(argv[2]), (time_t)0xffffffff);
+ return 0;
+}
+
+static int h_dialer(int argc, unsigned char **argv){
+ if(conf.demanddialprog) myfree(conf.demanddialprog);
+ conf.demanddialprog = mystrdup((char *)argv[1]);
+ return 0;
+}
+
+static int h_system(int argc, unsigned char **argv){
+ int res;
+
+ if((res = system((char *)argv[1])) == -1){
+ fprintf(stderr, "Failed to start %s\n", argv[1]);
+ return(1);
+ }
+ return 0;
+}
+
+static int h_pidfile(int argc, unsigned char **argv){
+ FILE *pidf;
+
+ if(!(pidf = fopen((char *)argv[1], "w"))){
+ fprintf(stderr, "Failed to open pid file %s\n", argv[1]);
+ return(1);
+ }
+ fprintf(pidf,"%u", (unsigned)getpid());
+ fclose(pidf);
+ return 0;
+}
+
+static int h_monitor(int argc, unsigned char **argv){
+ struct filemon * fm;
+
+ fm = myalloc(sizeof (struct filemon));
+ if(stat((char *)argv[1], &fm->sb)){
+ myfree(fm);
+ fprintf(stderr, "Warning: file %s doesn't exist on line %d\n", argv[1], linenum);
+ }
+ else {
+ fm->path = mystrdup((char *)argv[1]);
+ fm->next = conf.fmon;
+ conf.fmon = fm;
+ }
+ return 0;
+}
+
+static int h_parent(int argc, unsigned char **argv){
+ struct ace *acl = NULL;
+ struct chain *chains;
+
+ acl = conf.acl;
+ while(acl && acl->next) acl = acl->next;
+ if(!acl || (acl->action && acl->action != 2)) {
+ fprintf(stderr, "Chaining error: last ACL entry was not \"allow\" or \"redirect\" on line %d\n", linenum);
+ return(1);
+ }
+ acl->action = 2;
+
+ chains = NULL;
+ if(!acl->chains) {
+ chains = acl->chains = myalloc(sizeof(struct chain));
+ }
+ else {
+ chains = acl->chains;
+ while(chains->next)chains = chains->next;
+ chains->next = myalloc(sizeof(struct chain));
+ chains = chains->next;
+ }
+ memset(chains, 0, sizeof(struct chain));
+ if(!chains){
+ fprintf(stderr, "Chainig error: unable to allocate memory for chain\n");
+ return(2);
+ }
+ chains->weight = (unsigned)atoi((char *)argv[1]);
+ if(chains->weight == 0 || chains->weight >1000) {
+ fprintf(stderr, "Chaining error: bad chain weight %u line %d\n", chains->weight, linenum);
+ return(3);
+ }
+ if(!strcmp((char *)argv[2], "tcp"))chains->type = R_TCP;
+ else if(!strcmp((char *)argv[2], "http"))chains->type = R_HTTP;
+ else if(!strcmp((char *)argv[2], "connect"))chains->type = R_CONNECT;
+ else if(!strcmp((char *)argv[2], "socks4"))chains->type = R_SOCKS4;
+ else if(!strcmp((char *)argv[2], "socks5"))chains->type = R_SOCKS5;
+ else if(!strcmp((char *)argv[2], "connect+"))chains->type = R_CONNECTP;
+ else if(!strcmp((char *)argv[2], "socks4+"))chains->type = R_SOCKS4P;
+ else if(!strcmp((char *)argv[2], "socks5+"))chains->type = R_SOCKS5P;
+ else if(!strcmp((char *)argv[2], "socks4b"))chains->type = R_SOCKS4B;
+ else if(!strcmp((char *)argv[2], "socks5b"))chains->type = R_SOCKS5B;
+ else if(!strcmp((char *)argv[2], "pop3"))chains->type = R_POP3;
+ else if(!strcmp((char *)argv[2], "ftp"))chains->type = R_FTP;
+ else if(!strcmp((char *)argv[2], "admin"))chains->type = R_ADMIN;
+ else if(!strcmp((char *)argv[2], "icq"))chains->type = R_ICQ;
+ else if(!strcmp((char *)argv[2], "msn"))chains->type = R_MSN;
+ else {
+ fprintf(stderr, "Chaining error: bad chain type (%s)\n", argv[2]);
+ return(4);
+ }
+ chains->redirip = getip(argv[3]);
+ chains->redirport = htons((unsigned short)atoi((char *)argv[4]));
+ if(argc > 5) chains->extuser = (unsigned char *)mystrdup((char *)argv[5]);
+ if(argc > 6) chains->extpass = (unsigned char *)mystrdup((char *)argv[6]);
+ return 0;
+
+}
+
+static int h_nolog(int argc, unsigned char **argv){
+ struct ace *acl = NULL;
+
+ acl = conf.acl;
+ if(!acl) {
+ fprintf(stderr, "Chaining error: last ACL entry was not \"allow/deny\" on line %d\n", linenum);
+ return(1);
+ }
+ while(acl->next) acl = acl->next;
+ if(!strcmp(argv[0],"nolog")) acl->nolog = 1;
+ else acl->weight = atoi((char*)argv[1]);
+ return 0;
+}
+
+struct ace * make_ace (int argc, unsigned char ** argv){
+ struct ace * acl;
+ unsigned char *arg;
+ struct iplist *ipl=NULL;
+ struct portlist *portl=NULL;
+ struct userlist *userl=NULL;
+ struct hostname *hostnamel=NULL;
+ int res;
+
+ acl = myalloc(sizeof(struct ace));
+ if(!acl) return acl;
+ memset(acl, 0, sizeof(struct ace));
+ if(argc > 0 && strcmp("*", (char *)argv[0])) {
+ arg = argv[0];
+ arg = (unsigned char *)strtok((char *)arg, ",");
+ do {
+ if(!acl->users) {
+ acl->users = userl = myalloc(sizeof(struct userlist));
+ }
+ else {
+ userl->next = myalloc(sizeof(struct userlist));
+ userl = userl -> next;
+ }
+ if(!userl) {
+ fprintf(stderr, "No memory for ACL entry, line %d\n", linenum);
+ return(NULL);
+ }
+ memset(userl, 0, sizeof(struct userlist));
+ userl->user=(unsigned char*)mystrdup((char *)arg);
+ } while((arg = (unsigned char *)strtok((char *)NULL, ",")));
+ }
+ if(argc > 1 && strcmp("*", (char *)argv[1])) {
+ arg = (unsigned char *)strtok((char *)argv[1], ",");
+ do {
+ if(!acl->src) {
+ acl->src = ipl = myalloc(sizeof(struct iplist));
+ }
+ else {
+ ipl->next = myalloc(sizeof(struct iplist));
+ ipl = ipl -> next;
+ }
+ if(!ipl) {
+ fprintf(stderr, "No memory for ACL entry, line %d\n", linenum);
+ return(NULL);
+ }
+ memset(ipl, 0, sizeof(struct iplist));
+ if (!scanaddr(arg, &ipl->ip, &ipl->mask)) {
+ if((ipl->ip = getip(arg)) == 0){
+ fprintf(stderr, "Invalid IP or CIDR, line %d\n", linenum);
+ return(NULL);
+ }
+ ipl->mask = 0xFFFFFFFF;
+ }
+ } while((arg = (unsigned char *)strtok((char *)NULL, ",")));
+ }
+ if(argc > 2 && strcmp("*", (char *)argv[2])) {
+ arg = (unsigned char *)strtok((char *)argv[2], ",");
+ do {
+ int arglen;
+ unsigned char *pattern;
+
+ arglen = (int)strlen((char *)arg);
+ if(arglen > 0 && (arg[arglen-1] < '0' || arg[arglen-1] > '9')){
+ if(!acl->dstnames) {
+ acl->dstnames = hostnamel = myalloc(sizeof(struct hostname));
+ }
+ else {
+ hostnamel->next = myalloc(sizeof(struct hostname));
+ hostnamel = hostnamel -> next;
+ }
+ if(!hostnamel){
+ fprintf(stderr, "No memory for ACL entry, line %d\n", linenum);
+ return(NULL);
+ }
+ memset(hostnamel, 0, sizeof(struct hostname));
+ hostnamel->matchtype = 3;
+ pattern = arg;
+ if(pattern[arglen-1] == '*'){
+ arglen --;
+ pattern[arglen] = 0;
+ hostnamel->matchtype ^= MATCHEND;
+ }
+ if(pattern[0] == '*'){
+ pattern++;
+ arglen--;
+ hostnamel->matchtype ^= MATCHBEGIN;
+ }
+ hostnamel->name = (unsigned char *) mystrdup( (char *)pattern);
+ if(!hostnamel->name) {
+ fprintf(stderr, "No memory for ACL entry, line %d\n", linenum);
+ return(NULL);
+ }
+ }
+ else {
+
+ if(!acl->dst) {
+ acl->dst = ipl = myalloc(sizeof(struct iplist));
+ }
+ else {
+ ipl->next = myalloc(sizeof(struct iplist));
+ ipl = ipl -> next;
+ }
+ if(!ipl) {
+ fprintf(stderr, "No memory for ACL entry, line %d\n", linenum);
+ return(NULL);
+ }
+ memset(ipl, 0, sizeof(struct iplist));
+ if (!scanaddr(arg, &ipl->ip, &ipl->mask)) {
+ fprintf(stderr, "Invalid IP or CIDR, line %d\n", linenum);
+ return(NULL);
+ }
+ }
+ }while((arg = (unsigned char *)strtok((char *)NULL, ",")));
+ }
+ if(argc > 3 && strcmp("*", (char *)argv[3])) {
+ arg = (unsigned char *)strtok((char *)argv[3], ",");
+ do {
+ if(!acl->ports) {
+ acl->ports = portl = myalloc(sizeof(struct portlist));
+ }
+ else {
+ portl->next = myalloc(sizeof(struct portlist));
+ portl = portl -> next;
+ }
+ if(!portl) {
+ fprintf(stderr, "No memory for ACL entry, line %d\n", linenum);
+ return(NULL);
+ }
+ memset(portl, 0, sizeof(struct portlist));
+ res = sscanf((char *)arg, "%hu-%hu", &portl->startport, &portl->endport);
+ if(res < 1) {
+ fprintf(stderr, "Invalid port or port range, line %d\n", linenum);
+ return(NULL);
+ }
+ if (res == 1) portl->endport = portl->startport;
+ } while((arg = (unsigned char *)strtok((char *)NULL, ",")));
+ }
+ if(argc > 4 && strcmp("*", (char *)argv[4])) {
+ arg = (unsigned char *)strtok((char *)argv[4], ",");
+ do {
+ if(!strcmp((char *)arg, "CONNECT")){
+ acl->operation |= CONNECT;
+ }
+ else if(!strcmp((char *)arg, "BIND")){
+ acl->operation |= BIND;
+ }
+ else if(!strcmp((char *)arg, "UDPASSOC")){
+ acl->operation |= UDPASSOC;
+ }
+ else if(!strcmp((char *)arg, "ICMPASSOC")){
+ acl->operation |= ICMPASSOC;
+ }
+ else if(!strcmp((char *)arg, "HTTP_GET")){
+ acl->operation |= HTTP_GET;
+ }
+ else if(!strcmp((char *)arg, "HTTP_PUT")){
+ acl->operation |= HTTP_PUT;
+ }
+ else if(!strcmp((char *)arg, "HTTP_POST")){
+ acl->operation |= HTTP_POST;
+ }
+ else if(!strcmp((char *)arg, "HTTP_HEAD")){
+ acl->operation |= HTTP_HEAD;
+ }
+ else if(!strcmp((char *)arg, "HTTP_OTHER")){
+ acl->operation |= HTTP_OTHER;
+ }
+ else if(!strcmp((char *)arg, "HTTP_CONNECT")){
+ acl->operation |= HTTP_CONNECT;
+ }
+ else if(!strcmp((char *)arg, "HTTP")){
+ acl->operation |= HTTP;
+ }
+ else if(!strcmp((char *)arg, "HTTPS")){
+ acl->operation |= HTTPS;
+ }
+ else if(!strcmp((char *)arg, "FTP_GET")){
+ acl->operation |= FTP_GET;
+ }
+ else if(!strcmp((char *)arg, "FTP_PUT")){
+ acl->operation |= FTP_PUT;
+ }
+ else if(!strcmp((char *)arg, "FTP_LIST")){
+ acl->operation |= FTP_LIST;
+ }
+ else if(!strcmp((char *)arg, "FTP_DATA")){
+ acl->operation |= FTP_DATA;
+ }
+ else if(!strcmp((char *)arg, "FTP")){
+ acl->operation |= FTP;
+ }
+ else if(!strcmp((char *)arg, "ADMIN")){
+ acl->operation |= ADMIN;
+ }
+ else if(!strcmp((char *)arg, "DNSRESOLVE")){
+ acl->operation |= DNSRESOLVE;
+ }
+ else if(!strcmp((char *)arg, "ICQ")){
+ acl->operation |= IM_ICQ;
+ }
+ else {
+ fprintf(stderr, "Unknown operation type: %s line %d\n", arg, linenum);
+ return(NULL);
+ }
+ } while((arg = (unsigned char *)strtok((char *)NULL, ",")));
+ }
+ if(argc > 5){
+ for(arg = argv[5]; *arg;){
+ int val, val1;
+
+ if(!isnumber(*arg)){
+ arg++;
+ continue;
+ }
+ val1 = val = (*arg - '0');
+ arg++;
+ if(*arg == '-' && isnumber(*(arg+1)) && (*(arg+1) - '0') > val) {
+ val1 = (*(arg+1) - '0');
+ arg+=2;
+ }
+ for(; val<=val1; val++) acl->wdays |= (1 << (val % 7));
+ }
+
+ }
+ if(argc > 6){
+ for(arg = argv[6]; strlen((char *)arg) >= 17 &&
+ isdigit(arg[0]) &&
+ isdigit(arg[1]) &&
+ isdigit(arg[3]) &&
+ isdigit(arg[4]) &&
+ isdigit(arg[6]) &&
+ isdigit(arg[7]) &&
+ isdigit(arg[9]) &&
+ isdigit(arg[10]) &&
+ isdigit(arg[12]) &&
+ isdigit(arg[13]) &&
+ isdigit(arg[15]) &&
+ isdigit(arg[16])
+ ; arg+=18){
+
+ int t1, t2;
+ struct period *sp;
+
+ t1 = (arg[0] - '0') * 10 + (arg[1] - '0');
+ t1 = (t1 * 60) + (arg[3] - '0') * 10 + (arg[4] - '0');
+ t1 = (t1 * 60) + (arg[6] - '0') * 10 + (arg[7] - '0');
+ t2 = (arg[9] - '0') * 10 + (arg[10] - '0');
+ t2 = (t2 * 60) + (arg[12] - '0') * 10 + (arg[13] - '0');
+ t2 = (t2 * 60) + (arg[15] - '0') * 10 + (arg[16] - '0');
+ if(t2 < t1) break;
+ sp = myalloc(sizeof(struct period));
+ if(sp){
+ sp->fromtime = t1;
+ sp->totime = t2;
+ sp->next = acl->periods;
+ acl->periods = sp;
+ }
+ if(arg[17]!=',') break;
+ }
+ }
+ if (argc > 7){
+ acl->weight = atoi((char *)argv[7]);
+ }
+
+ return acl;
+}
+
+
+static int h_ace(int argc, unsigned char **argv){
+ int res = 0;
+ int offset = 0;
+ struct ace *acl = NULL;
+ struct bandlim * nbl;
+ struct trafcount * tl;
+
+ if(!strcmp((char *)argv[0], "allow")){
+ res = ALLOW;
+ }
+ else if(!strcmp((char *)argv[0], "deny")){
+ res = DENY;
+ }
+ else if(!strcmp((char *)argv[0], "redirect")){
+ res = REDIRECT;
+ offset = 2;
+ }
+ else if(!strcmp((char *)argv[0], "bandlimin")||!strcmp((char *)argv[0], "bandlimout")){
+ res = BANDLIM;
+ offset = 1;
+ }
+ else if(!strcmp((char *)argv[0], "nobandlimin")||!strcmp((char *)argv[0], "nobandlimout")){
+ res = NOBANDLIM;
+ }
+ else if(!strcmp((char *)argv[0], "countin")){
+ res = COUNTIN;
+ offset = 3;
+ }
+ else if(!strcmp((char *)argv[0], "nocountin")){
+ res = NOCOUNTIN;
+ }
+ else if(!strcmp((char *)argv[0], "countout")){
+ res = COUNTOUT;
+ offset = 3;
+ }
+ else if(!strcmp((char *)argv[0], "nocountout")){
+ res = NOCOUNTOUT;
+ }
+ acl = make_ace(argc - (offset+1), argv + (offset + 1));
+ if(!acl) {
+ fprintf(stderr, "Unable to parse ACL entry, line %d\n", linenum);
+ return(1);
+ }
+ acl->action = res;
+ switch(acl->action){
+ case REDIRECT:
+ acl->chains = myalloc(sizeof(struct chain));
+ if(!acl->chains) {
+ fprintf(stderr, "No memory for ACL entry, line %d\n", linenum);
+ return(2);
+ }
+ acl->chains->type = R_HTTP;
+ acl->chains->redirip = getip(argv[1]);
+ acl->chains->redirport = htons((unsigned short)atoi((char *)argv[2]));
+ acl->chains->weight = 1000;
+ acl->chains->extuser = NULL;
+ acl->chains->extpass = NULL;
+ acl->chains->next = NULL;
+ case ALLOW:
+ case DENY:
+ if(!conf.acl){
+ conf.acl = acl;
+ }
+ else {
+ struct ace * acei;
+
+ for(acei = conf.acl; acei->next; acei = acei->next);
+ acei->next = acl;
+ }
+ break;
+ case BANDLIM:
+ case NOBANDLIM:
+
+ nbl = myalloc(sizeof(struct bandlim));
+ if(!nbl) {
+ fprintf(stderr, "No memory to create band limit filter\n");
+ return(3);
+ }
+ memset(nbl, 0, sizeof(struct bandlim));
+ nbl->ace = acl;
+ if(acl->action == BANDLIM) {
+ sscanf((char *)argv[1], "%u", &nbl->rate);
+ if(nbl->rate < 300) {
+ fprintf(stderr, "Wrong bandwidth specified, line %d\n", linenum);
+ return(4);
+ }
+ }
+ pthread_mutex_lock(&bandlim_mutex);
+ if(!strcmp((char *)argv[0], "bandlimin") || !strcmp((char *)argv[0], "nobandlimin")){
+ if(!conf.bandlimiter){
+ conf.bandlimiter = nbl;
+ }
+ else {
+ struct bandlim * bli;
+
+ for(bli = conf.bandlimiter; bli->next; bli = bli->next);
+ bli->next = nbl;
+ }
+ }
+ else {
+ if(!conf.bandlimiterout){
+ conf.bandlimiterout = nbl;
+ }
+ else {
+ struct bandlim * bli;
+
+ for(bli = conf.bandlimiterout; bli->next; bli = bli->next);
+ bli->next = nbl;
+ }
+ }
+
+ pthread_mutex_unlock(&bandlim_mutex);
+ break;
+
+ case COUNTIN:
+ case NOCOUNTIN:
+ case COUNTOUT:
+ case NOCOUNTOUT:
+ tl = myalloc(sizeof(struct trafcount));
+ if(!tl) {
+ fprintf(stderr, "No memory to create traffic limit filter\n");
+ return(5);
+ }
+ memset(tl, 0, sizeof(struct trafcount));
+ tl->ace = acl;
+
+ if((acl->action == COUNTIN)||(acl->action == COUNTOUT)) {
+ unsigned long lim;
+
+ tl->comment = ( char *)argv[1];
+ while(isdigit(*tl->comment))tl->comment++;
+ if(*tl->comment== '/')tl->comment++;
+ tl->comment = mystrdup(tl->comment);
+
+ sscanf((char *)argv[1], "%u", &tl->number);
+ sscanf((char *)argv[3], "%lu", &lim);
+ tl->traflimgb = (lim/(1024*4));
+ tl->traflim = ((lim - (tl->traflimgb*(1024*4)))*(1024*1024));
+ tl->type = getrotate(*argv[2]);
+ if(!tl->traflim && !tl->traflimgb) {
+ fprintf(stderr, "Wrong traffic limit specified, line %d\n", linenum);
+ return(6);
+ }
+ if(tl->number != 0 && conf.counterd >= 0) {
+ lseek(conf.counterd,
+ sizeof(struct counter_header) + (tl->number - 1) * sizeof(struct counter_record),
+ SEEK_SET);
+ memset(&crecord, 0, sizeof(struct counter_record));
+ read(conf.counterd, &crecord, sizeof(struct counter_record));
+ tl->traf = crecord.traf;
+ tl->trafgb = crecord.trafgb;
+ tl->cleared = crecord.cleared;
+ tl->updated = crecord.updated;
+#ifdef _MAX__TIME64_T
+ if(tl->cleared >= _MAX__TIME64_T || tl->updated >= _MAX__TIME64_T){
+ fprintf(stderr, "Invalid or corrupted counter file. Use countersutil utility to convert from older version\n");
+ return(6);
+ }
+#endif
+ }
+ }
+ pthread_mutex_lock(&tc_mutex);
+ if(!conf.trafcounter){
+ conf.trafcounter = tl;
+ }
+ else {
+ struct trafcount * ntl;
+
+ for(ntl = conf.trafcounter; ntl->next; ntl = ntl->next);
+ ntl->next = tl;
+ }
+ pthread_mutex_unlock(&tc_mutex);
+
+ }
+ return 0;
+}
+
+static int h_logdump(int argc, unsigned char **argv){
+ conf.logdumpsrv = (unsigned) atoi((char *) *(argv + 1));
+ if(argc > 2) conf.logdumpcli = (unsigned) atoi((char *) *(argv + 2));
+ return 0;
+}
+
+
+static int h_filtermaxsize(int argc, unsigned char **argv){
+ conf.filtermaxsize = atoi((char *) *(argv + 1));
+ return 0;
+}
+
+static int h_delimchar(int argc, unsigned char **argv){
+ conf.delimchar = *argv[1];
+ return 0;
+}
+
+static int h_authcache(int argc, unsigned char **argv){
+ conf.authcachetype = 0;
+ if(strstr((char *) *(argv + 1), "ip")) conf.authcachetype |= 1;
+ if(strstr((char *) *(argv + 1), "user")) conf.authcachetype |= 2;
+ if(strstr((char *) *(argv + 1), "pass")) conf.authcachetype |= 4;
+ if(argc > 2) conf.authcachetime = (unsigned) atoi((char *) *(argv + 2));
+ if(!conf.authcachetype) conf.authcachetype = 6;
+ if(!conf.authcachetime) conf.authcachetime = 600;
+ return 0;
+}
+
+static int h_plugin(int argc, unsigned char **argv){
+#ifdef NOPLUGINS
+ return 999;
+#else
+#ifdef _WIN32
+ HINSTANCE hi;
+ FARPROC fp;
+
+#ifdef _WINCE
+ hi = LoadLibraryW((LPCWSTR)CEToUnicode(argv[1]));
+#else
+ hi = LoadLibrary(argv[1]);
+#endif
+ if(!hi) {
+ fprintf(stderr, "Failed to load %s, code %d\n", argv[1], (int)GetLastError());
+ return 1;
+ }
+#ifdef _WINCE
+ fp = GetProcAddressW(hi, (LPCWSTR)CEToUnicode(argv[2]));
+#else
+ fp = GetProcAddress(hi, argv[2]);
+#endif
+ if(!fp) {
+ printf("%s not found in %s, code: %d\n", argv[2], argv[1], (int)GetLastError());
+ return 2;
+ }
+ return (*(PLUGINFUNC)fp)(&pluginlink, argc - 2, (char **)argv + 2);
+#else
+ void *hi, *fp;
+ hi = dlopen((char *)argv[1], RTLD_LAZY);
+ if(!hi) return 1;
+ fp = dlsym(hi, (char *)argv[2]);
+ if(!fp) return 2;
+ return (*(PLUGINFUNC)fp)(&pluginlink, argc - 2, (char **)argv + 2);
+#endif
+#endif
+}
+
+#ifndef _WIN32
+static int h_setuid(int argc, unsigned char **argv){
+ int res;
+ res = atoi((char *)argv[1]);
+ if(!res || setuid(res)) {
+ fprintf(stderr, "Unable to set uid %d", res);
+ return(1);
+ }
+ return 0;
+}
+
+static int h_setgid(int argc, unsigned char **argv){
+ int res;
+
+ res = atoi((char *)argv[1]);
+ if(!res || setgid(res)) {
+ fprintf(stderr, "Unable to set gid %d", res);
+ return(1);
+ }
+ return 0;
+}
+
+
+static int h_chroot(int argc, unsigned char **argv){
+ if(!chrootp){
+ char *p;
+ if(chroot((char *)argv[1])) {
+ fprintf(stderr, "Unable to chroot %s", argv[1]);
+ return(1);
+ }
+ p = (char *)argv[1] + strlen((char *)argv[1]) ;
+ while (p > (char *)argv[1] && p[-1] == '/'){
+ p--;
+ *p = 0;
+ }
+ chrootp = mystrdup((char *)argv[1]);
+ }
+ return 0;
+}
+#endif
+
+
+struct commands specificcommands[]={
+#ifndef _WIN32
+ {specificcommands+1, "setuid", h_setuid, 2, 2},
+ {specificcommands+2, "setgid", h_setgid, 2, 2},
+ {specificcommands+3, "chroot", h_chroot, 2, 2},
+#endif
+ {NULL, "", h_noop, 1, 0}
+};
+
+struct commands commandhandlers[]={
+ {commandhandlers+1, "", h_noop, 1, 0},
+ {commandhandlers+2, "proxy", h_proxy, 1, 0},
+ {commandhandlers+3, "pop3p", h_proxy, 1, 0},
+ {commandhandlers+4, "ftppr", h_proxy, 1, 0},
+ {commandhandlers+5, "socks", h_proxy, 1, 0},
+ {commandhandlers+6, "tcppm", h_proxy, 4, 0},
+ {commandhandlers+7, "udppm", h_proxy, 4, 0},
+ {commandhandlers+8, "admin", h_proxy, 1, 0},
+ {commandhandlers+9, "dnspr", h_proxy, 1, 0},
+ {commandhandlers+10, "internal", h_internal, 2, 2},
+ {commandhandlers+11, "external", h_external, 2, 2},
+ {commandhandlers+12, "log", h_log, 1, 0},
+ {commandhandlers+13, "service", h_service, 1, 1},
+ {commandhandlers+14, "daemon", h_daemon, 1, 1},
+ {commandhandlers+15, "config", h_config, 2, 2},
+ {commandhandlers+16, "include", h_include, 2, 2},
+ {commandhandlers+17, "archiver", h_archiver, 3, 0},
+ {commandhandlers+18, "counter", h_counter, 2, 4},
+ {commandhandlers+19, "rotate", h_rotate, 2, 2},
+ {commandhandlers+20, "logformat", h_logformat, 2, 2},
+ {commandhandlers+21, "timeouts", h_timeouts, 2, 0},
+ {commandhandlers+22, "auth", h_auth, 2, 0},
+ {commandhandlers+23, "users", h_users, 2, 0},
+ {commandhandlers+24, "maxconn", h_maxconn, 2, 2},
+ {commandhandlers+25, "flush", h_flush, 1, 1},
+ {commandhandlers+26, "nserver", h_nserver, 2, 2},
+ {commandhandlers+27, "fakeresolve", h_fakeresolve, 1, 1},
+ {commandhandlers+28, "nscache", h_nscache, 2, 2},
+ {commandhandlers+29, "nsrecord", h_nsrecord, 3, 3},
+ {commandhandlers+30, "dialer", h_dialer, 2, 2},
+ {commandhandlers+31, "system", h_system, 2, 2},
+ {commandhandlers+32, "pidfile", h_pidfile, 2, 2},
+ {commandhandlers+33, "monitor", h_monitor, 2, 2},
+ {commandhandlers+34, "parent", h_parent, 5, 0},
+ {commandhandlers+35, "allow", h_ace, 1, 0},
+ {commandhandlers+36, "deny", h_ace, 1, 0},
+ {commandhandlers+37, "redirect", h_ace, 3, 0},
+ {commandhandlers+38, "bandlimin", h_ace, 2, 0},
+ {commandhandlers+39, "bandlimout", h_ace, 2, 0},
+ {commandhandlers+40, "nobandlimin", h_ace, 1, 0},
+ {commandhandlers+41, "nobandlimout", h_ace, 1, 0},
+ {commandhandlers+42, "countin", h_ace, 4, 0},
+ {commandhandlers+43, "nocountin", h_ace, 1, 0},
+ {commandhandlers+44, "countout", h_ace, 4, 0},
+ {commandhandlers+45, "nocountout", h_ace, 1, 0},
+ {commandhandlers+46, "plugin", h_plugin, 3, 0},
+ {commandhandlers+47, "logdump", h_logdump, 2, 3},
+ {commandhandlers+48, "filtermaxsize", h_filtermaxsize, 2, 2},
+ {commandhandlers+49, "nolog", h_nolog, 1, 1},
+ {commandhandlers+50, "weight", h_nolog, 2, 2},
+ {commandhandlers+51, "authcache", h_authcache, 2, 3},
+ {commandhandlers+52, "smtpp", h_proxy, 1, 0},
+ {commandhandlers+53, "icqpr", h_proxy, 4, 0},
+ {commandhandlers+54, "msnpr", h_proxy, 4, 0},
+ {commandhandlers+55, "delimchar",h_delimchar, 2, 2},
+ {commandhandlers+56, "authnserver", h_authnserver, 2, 2},
+ {specificcommands, "", h_noop, 1, 0}
+};
+
+int readconfig(FILE * fp){
+ unsigned char ** argv = NULL;
+ unsigned char * buf = NULL;
+ int bufsize = STRINGBUF*2;
+ int inbuf = 0;
+ int argc;
+ struct commands * cm;
+ int res = 0;
+
+ if( !(buf = myalloc(bufsize)) || ! (argv = myalloc(NPARAMS * sizeof(unsigned char *) + 1)) ) {
+ fprintf(stderr, "No memory for configuration");
+ return(10);
+ }
+ for (linenum = 1; fgets((char *)buf, STRINGBUF, fp); linenum++){
+ if(!*buf || isspace(*buf) || (*buf) == '#')continue;
+
+ inbuf = (int)(strlen((char *)buf) + 1);
+ argc = parsestr (buf, argv, NPARAMS-1, &buf, &inbuf, &bufsize);
+ if(argc < 1) {
+ fprintf(stderr, "Parse error line %d\n", linenum);
+ return(21);
+ }
+ argv[argc] = NULL;
+ if(!strcmp((char *)argv[0], "end") && argc == 1) {
+ break;
+ }
+ else if(!strcmp((char *)argv[0], "writable") && argc == 1) {
+ if(!writable){
+ writable = freopen(curconf, "r+", fp);
+ if(!writable){
+ fprintf(stderr, "Unable to reopen config for writing: %s\n", curconf);
+ return 1;
+ }
+ }
+ continue;
+ }
+
+ res = 1;
+ for(cm = commandhandlers; cm; cm = cm->next){
+ if(!strcmp((char *)argv[0], (char *)cm->command) && argc >= cm->minargs && (!cm->maxargs || argc <= cm->maxargs)){
+ res = (*cm->handler)(argc, argv);
+ if(res > 0){
+ fprintf(stderr, "Command: '%s' failed with code %d, line %d\n", argv[0], res, linenum);
+ return(linenum);
+ }
+ if(!res) break;
+ }
+ }
+ if(res != 1)continue;
+ fprintf(stderr, "Unknown command: '%s' line %d\n", argv[0], linenum);
+ return(linenum);
+ }
+ myfree(buf);
+ myfree(argv);
+ return 0;
+
+}
+
+
+#ifndef _WINCE
+int main(int argc, char * argv[]) {
+#else
+int WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPWSTR lpCmdLine, int nCmdShow){
+ int argc;
+ char ** argv;
+ WNDCLASS wc;
+ HWND hwnd = 0;
+#endif
+
+ int res = 0;
+ FILE * fp = NULL;
+
+#ifdef _WIN32
+ unsigned char * arg;
+ WSADATA wd;
+
+ WSAStartup(MAKEWORD( 1, 1 ), &wd);
+ osv.dwOSVersionInfoSize = sizeof(osv);
+ GetVersionEx(&osv);
+#endif
+
+
+#ifdef _WINCE
+ argc = ceparseargs((char *)lpCmdLine);
+ argv = ceargv;
+ if(FindWindow(L"3proxy", L"3proxy")) return 0;
+ ZeroMemory(&wc,sizeof(wc));
+ wc.hbrBackground=(HBRUSH)GetStockObject(BLACK_BRUSH);
+ wc.hInstance=hInstance;
+ wc.hCursor=LoadCursor(NULL,IDC_ARROW);
+ wc.lpfnWndProc=DefWindowProc;
+ wc.style=CS_HREDRAW|CS_VREDRAW;
+ wc.lpszClassName=L"3proxy";
+ RegisterClass(&wc);
+
+ hwnd = CreateWindowEx(0,L"3proxy",L"3proxy",WS_VISIBLE|WS_POPUP,0,0,0,0,0,0,hInstance,0);
+#endif
+
+ conf.stringtable = strings;
+#ifdef _WIN32
+#ifndef _WINCE
+ if((argc == 2 || argc == 3)&& !strcmp((char *)argv[1], "--install")) {
+
+ sprintf((char *)tmpbuf, "%s will be installed and started.\n"
+ "By clicking Yes you confirm you read and accepted License Agreement.\n"
+ "You can use Administration/Services to control %s service.",
+ conf.stringtable[1], conf.stringtable[2]);
+ if(MessageBox(NULL, (char *)tmpbuf, conf.stringtable[2], MB_YESNO|MB_ICONASTERISK) != IDYES) return 1;
+
+
+ *tmpbuf = '\"';
+ if (!(res = SearchPath(NULL, argv[0], ".exe", 256, (char *)tmpbuf+1, (LPTSTR*)&arg))) {
+ perror("Failed to find executable filename");
+ RETURN(102);
+ }
+ strcat((char *)tmpbuf, "\" \"");
+ if(!(res = GetFullPathName ((argc == 3)?argv[2]:(char*)DEFAULTCONFIG, 256, (char *)tmpbuf+res+4, (char **)&arg))){
+ perror("Failed to find config filename");
+ RETURN(103);
+ }
+ strcat((char *)tmpbuf, "\" --service");
+ if(osv.dwPlatformId == VER_PLATFORM_WIN32_NT){
+ SC_HANDLE sch;
+
+ if(!(sch = OpenSCManager(NULL, NULL, GENERIC_WRITE|SERVICE_START ))){
+ perror("Failed to open Service Manager");
+ RETURN(101);
+ }
+ if (!(sch = CreateService(sch, conf.stringtable[1], conf.stringtable[2], GENERIC_EXECUTE, SERVICE_WIN32_OWN_PROCESS, SERVICE_AUTO_START, SERVICE_ERROR_IGNORE, (char *)tmpbuf, NULL, NULL, NULL, NULL, NULL))){
+ perror("Failed to create service");
+ RETURN(103);
+ }
+ if (!StartService(sch, 0, NULL)) {
+ perror("Failed to start service");
+ RETURN(103);
+ }
+ }
+ else {
+ HKEY runsrv;
+
+ if(RegOpenKeyEx( HKEY_LOCAL_MACHINE,
+ "Software\\Microsoft\\Windows\\CurrentVersion\\RunServices",
+ 0,
+ KEY_ALL_ACCESS,
+ &runsrv) != ERROR_SUCCESS){
+ perror("Failed to open registry");
+ RETURN(104);
+ }
+ if(RegSetValueEx( runsrv,
+ conf.stringtable[1],
+ 0,
+ REG_EXPAND_SZ,
+ (char *)tmpbuf,
+ (int)strlen((char *)tmpbuf)+1)!=ERROR_SUCCESS){
+ perror("Failed to set registry value");
+ RETURN(105);
+ }
+
+ }
+ return 0;
+ }
+ if((argc == 2 || argc == 3)&& !strcmp((char *)argv[1], "--remove")) {
+
+ if(osv.dwPlatformId == VER_PLATFORM_WIN32_NT){
+ SC_HANDLE sch;
+
+ if(!(sch = OpenSCManager(NULL, NULL, GENERIC_WRITE))){
+ perror("Failed to open Service Manager\n");
+ RETURN(106);
+ }
+ if (!(sch = OpenService(sch, conf.stringtable[1], DELETE))){
+ perror("Failed to open service");
+ RETURN(107);
+ }
+ if (!DeleteService(sch)){
+ perror("Failed to delete service");
+ RETURN(108);
+ }
+ }
+ else {
+ HKEY runsrv;
+ if(RegOpenKeyEx( HKEY_LOCAL_MACHINE,
+ "Software\\Microsoft\\Windows\\CurrentVersion\\RunServices",
+ 0,
+ KEY_ALL_ACCESS,
+ &runsrv) != ERROR_SUCCESS){
+ perror("Failed to open registry");
+ RETURN(109);
+ }
+ if(RegDeleteValue(runsrv, conf.stringtable[1]) != ERROR_SUCCESS){
+ perror("Failed to clear registry");
+ RETURN(110);
+ }
+ }
+ RETURN(0);
+ }
+ if(argc==3 && !strcmp(argv[2], "--service")){
+ service = 1;
+ argc = 2;
+ }
+#endif
+#endif
+ conf.conffile = mystrdup((argc==2)?argv[1]:(char*)DEFAULTCONFIG);
+ if(conf.conffile && *conf.conffile != '-') {
+ fp = confopen();
+#ifndef _WIN32
+ if(!fp) fp = stdin;
+#endif
+ }
+ if(argc > 2 || !(fp)) {
+
+ fprintf(stderr, "Usage: %s [conffile]\n", argv[0]);
+#ifdef _WIN32
+ fprintf(stderr, "\n\t%s --install [conffile]\n\tto install as service\n"
+ "\n\t%s --remove\n\tto remove service\n", argv[0], argv[0]);
+#else
+ fprintf(stderr, "\n if conffile is missing, configuration is expected from stdin\n");
+#endif
+ fprintf(stderr, "\n%s %s\n%s\n", conf.stringtable[2], conf.stringtable[3], copyright);
+
+ return 1;
+ }
+
+ pthread_mutex_init(&bandlim_mutex, NULL);
+ pthread_mutex_init(&hash_mutex, NULL);
+ pthread_mutex_init(&tc_mutex, NULL);
+ pthread_mutex_init(&pwl_mutex, NULL);
+#ifndef NOODBC
+ pthread_mutex_init(&odbc_mutex, NULL);
+#endif
+
+ {
+ char * args[] = {"auth", "iponly", NULL};
+ h_auth(2, args);
+ }
+
+ res = readconfig(fp);
+
+ if(res) RETURN(res);
+ if(!writable)fclose(fp);
+
+#ifdef _WIN32
+
+#ifndef _WINCE
+ if(service){
+ SERVICE_TABLE_ENTRY ste[] =
+ {
+ { conf.stringtable[1], (LPSERVICE_MAIN_FUNCTION)ServiceMain},
+ { NULL, NULL }
+ };
+ if(!StartServiceCtrlDispatcher( ste ))cyclestep();
+ }
+ else
+#endif
+ {
+ cyclestep();
+ }
+
+
+#else
+ signal(SIGCONT, mysigpause);
+ signal(SIGTERM, mysigterm);
+ signal(SIGUSR1, mysigusr1);
+ signal(SIGPIPE, SIG_IGN);
+ cyclestep();
+
+#endif
+
+CLEARRETURN:
+
+ return 0;
+
+}
diff --git a/src/Makefile b/src/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/Makefile.inc b/src/Makefile.inc
new file mode 100644
index 0000000..8571993
--- /dev/null
+++ b/src/Makefile.inc
@@ -0,0 +1,181 @@
+#$Id: Makefile.inc,v 1.19 2008/12/10 13:12:10 vlad Exp $
+#
+# 3 proxy common Makefile
+#
+
+all: pre $(BUILDDIR)3proxy$(EXESUFFICS) $(BUILDDIR)mycrypt$(EXESUFFICS) $(BUILDDIR)dighosts$(EXESUFFICS) $(BUILDDIR)pop3p$(EXESUFFICS) $(BUILDDIR)smtpp$(EXESUFFICS) $(BUILDDIR)ftppr$(EXESUFFICS) $(BUILDDIR)tcppm$(EXESUFFICS) $(BUILDDIR)icqpr$(EXESUFFICS) $(BUILDDIR)msnpr$(EXESUFFICS) $(BUILDDIR)udppm$(EXESUFFICS) $(BUILDDIR)socks$(EXESUFFICS) $(BUILDDIR)proxy$(EXESUFFICS) $(BUILDDIR)countersutil$(EXESUFFICS) allplugins
+
+
+pre:
+ -cd .. && $(TYPECOMMAND) copying
+ $(PREMAKE)
+
+
+sockmap$(OBJSUFFICS): sockmap.c proxy.h structures.h
+ $(CC) $(CFLAGS) sockmap.c
+
+common$(OBJSUFFICS): common.c proxy.h structures.h
+ $(CC) $(CFLAGS) common.c
+
+myalloc$(OBJSUFFICS): myalloc.c proxy.h structures.h
+ $(CC) $(CFLAGS) myalloc.c
+
+plugins$(OBJSUFFICS): plugins.c proxy.h structures.h
+ $(CC) $(CFLAGS) plugins.c
+
+base64$(OBJSUFFICS): base64.c
+ $(CC) $(CFLAGS) base64.c
+
+ftp$(OBJSUFFICS): ftp.c proxy.h structures.h
+ $(CC) $(CFLAGS) ftp.c
+
+#$(COMPATLIBS):
+# $(CC) $(CFLAGS) strncasecmp.c
+
+sockgetchar$(OBJSUFFICS): sockgetchar.c proxy.h structures.h
+ $(CC) $(CFLAGS) sockgetchar.c
+
+proxy$(OBJSUFFICS): proxy.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)NOPORTMAP $(DEFINEOPTION)ANONYMOUS proxy.c
+
+pop3p$(OBJSUFFICS): pop3p.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)NOPORTMAP pop3p.c
+
+smtpp$(OBJSUFFICS): smtpp.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)NOPORTMAP smtpp.c
+
+ftppr$(OBJSUFFICS): ftppr.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)NOPORTMAP ftppr.c
+
+tcppm$(OBJSUFFICS): tcppm.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)PORTMAP tcppm.c
+
+icqpr$(OBJSUFFICS): icqpr.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)PORTMAP icqpr.c
+
+msnpr$(OBJSUFFICS): msnpr.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)PORTMAP msnpr.c
+
+socks$(OBJSUFFICS): socks.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)NOPORTMAP socks.c
+
+udppm$(OBJSUFFICS): udppm.c proxy.h structures.h proxymain.c
+ $(CC) $(CFLAGS) $(DEFINEOPTION)WITHMAIN $(DEFINEOPTION)PORTMAP udppm.c
+
+3proxy$(OBJSUFFICS): 3proxy.c proxy.h structures.h
+ $(CC) $(CFLAGS) 3proxy.c
+
+$(BUILDDIR)proxy$(EXESUFFICS): sockmap$(OBJSUFFICS) proxy$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) base64$(OBJSUFFICS) ftp$(OBJSUFFICS) $(COMPATLIBS)
+ $(LN) $(LNOUT)$(BUILDDIR)proxy$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) proxy$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) base64$(OBJSUFFICS) ftp$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
+
+$(BUILDDIR)pop3p$(EXESUFFICS): sockmap$(OBJSUFFICS) pop3p$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(COMPATLIBS)
+ $(LN) $(LNOUT)$(BUILDDIR)pop3p$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) pop3p$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
+
+$(BUILDDIR)smtpp$(EXESUFFICS): sockmap$(OBJSUFFICS) smtpp$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) base64$(OBJSUFFICS) $(COMPATLIBS)
+ $(LN) $(LNOUT)$(BUILDDIR)smtpp$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) smtpp$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) base64$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
+
+$(BUILDDIR)ftppr$(EXESUFFICS): sockmap$(OBJSUFFICS) ftppr$(OBJSUFFICS) ftp$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(COMPATLIBS)
+ $(LN) $(LNOUT)$(BUILDDIR)ftppr$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) ftppr$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) ftp$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
+
+$(BUILDDIR)socks$(EXESUFFICS): sockmap$(OBJSUFFICS) socks$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS)
+ $(LN) $(LNOUT)$(BUILDDIR)socks$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) socks$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(LIBS)
+
+$(BUILDDIR)tcppm$(EXESUFFICS): sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) tcppm$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS)
+ $(LN) $(LNOUT)$(BUILDDIR)tcppm$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) tcppm$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(LIBS)
+
+$(BUILDDIR)icqpr$(EXESUFFICS): sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) icqpr$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS)
+ $(LN) $(LNOUT)$(BUILDDIR)icqpr$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) icqpr$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(LIBS)
+
+$(BUILDDIR)msnpr$(EXESUFFICS): sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) msnpr$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS)
+ $(LN) $(LNOUT)$(BUILDDIR)msnpr$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) msnpr$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(LIBS)
+
+$(BUILDDIR)udppm$(EXESUFFICS): sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) udppm$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS)
+ $(LN) $(LNOUT)$(BUILDDIR)udppm$(EXESUFFICS) $(LDFLAGS) $(VERFILE) sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) udppm$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(LIBS)
+
+mainfunc$(OBJSUFFICS): proxy.h structures.h proxymain.c
+ $(CC) $(COUT)mainfunc$(OBJSUFFICS) $(CFLAGS) $(DEFINEOPTION)MODULEMAINFUNC=mainfunc proxymain.c
+
+
+
+srvproxy$(OBJSUFFICS): proxy.c proxy.h structures.h
+ $(CC) $(COUT)srvproxy$(OBJSUFFICS) $(CFLAGS) proxy.c
+
+srvpop3p$(OBJSUFFICS): pop3p.c proxy.h structures.h
+ $(CC) $(COUT)srvpop3p$(OBJSUFFICS) $(CFLAGS) pop3p.c
+
+srvsmtpp$(OBJSUFFICS): smtpp.c proxy.h structures.h
+ $(CC) $(COUT)srvsmtpp$(OBJSUFFICS) $(CFLAGS) smtpp.c
+
+srvftppr$(OBJSUFFICS): ftppr.c proxy.h structures.h
+ $(CC) $(COUT)srvftppr$(OBJSUFFICS) $(CFLAGS) ftppr.c
+
+srvtcppm$(OBJSUFFICS): tcppm.c proxy.h structures.h
+ $(CC) $(COUT)srvtcppm$(OBJSUFFICS) $(CFLAGS) tcppm.c
+
+srvicqpr$(OBJSUFFICS): icqpr.c proxy.h structures.h
+ $(CC) $(COUT)srvicqpr$(OBJSUFFICS) $(CFLAGS) icqpr.c
+
+srvmsnpr$(OBJSUFFICS): msnpr.c proxy.h structures.h
+ $(CC) $(COUT)srvmsnpr$(OBJSUFFICS) $(CFLAGS) msnpr.c
+
+srvsocks$(OBJSUFFICS): socks.c proxy.h structures.h
+ $(CC) $(COUT)srvsocks$(OBJSUFFICS) $(CFLAGS) socks.c
+
+srvwebadmin$(OBJSUFFICS): webadmin.c proxy.h structures.h
+ $(CC) $(COUT)srvwebadmin$(OBJSUFFICS) $(CFLAGS) webadmin.c
+
+srvudppm$(OBJSUFFICS): udppm.c proxy.h structures.h
+ $(CC) $(COUT)srvudppm$(OBJSUFFICS) $(CFLAGS) udppm.c
+
+srvdnspr$(OBJSUFFICS): dnspr.c proxy.h structures.h
+ $(CC) $(COUT)srvdnspr$(OBJSUFFICS) $(CFLAGS) dnspr.c
+
+auth$(OBJSUFFICS): auth.c proxy.h structures.h
+ $(CC) $(COUT)auth$(OBJSUFFICS) $(CFLAGS) auth.c
+
+datatypes$(OBJSUFFICS): datatypes.c proxy.h structures.h
+ $(CC) $(COUT)datatypes$(OBJSUFFICS) $(CFLAGS) datatypes.c
+
+mycrypt$(OBJSUFFICS): mycrypt.c
+ $(CC) $(COUT)mycrypt$(OBJSUFFICS) $(CFLAGS) mycrypt.c
+
+dighosts$(OBJSUFFICS): dighosts.c
+ $(CC) $(COUT)dighosts$(OBJSUFFICS) $(CFLAGS) dighosts.c
+
+$(BUILDDIR)dighosts$(EXESUFFICS): dighosts$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(COMPATLIBS)
+ $(LN) $(LNOUT)$(BUILDDIR)dighosts$(EXESUFFICS) $(LDFLAGS) $(VERFILE) dighosts$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
+
+countersutil$(OBJSUFFICS): countersutil.c
+ $(CC) $(COUT)countersutil$(OBJSUFFICS) $(CFLAGS) countersutil.c
+
+$(BUILDDIR)countersutil$(EXESUFFICS): countersutil$(OBJSUFFICS) $(COMPATLIBS)
+ $(LN) $(LNOUT)$(BUILDDIR)countersutil$(EXESUFFICS) $(LDFLAGS) $(VERFILE) countersutil$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
+
+
+mycryptmain$(OBJSUFFICS): mycrypt.c
+ $(CC) $(COUT)mycryptmain$(OBJSUFFICS) $(CFLAGS) $(DEFINEOPTION)WITHMAIN mycrypt.c
+
+$(BUILDDIR)mycrypt$(EXESUFFICS): md4$(OBJSUFFICS) md5$(OBJSUFFICS) mycryptmain$(OBJSUFFICS) base64$(OBJSUFFICS)
+ $(LN) $(LNOUT)$(BUILDDIR)mycrypt$(EXESUFFICS) $(VERFILE) $(LDFLAGS) md4$(OBJSUFFICS) md5$(OBJSUFFICS) base64$(OBJSUFFICS) mycryptmain$(OBJSUFFICS)
+
+
+md4$(OBJSUFFICS): libs/md4.h libs/md4.c
+ $(CC) $(COUT)md4$(OBJSUFFICS) $(CFLAGS) libs/md4.c
+
+smbdes$(OBJSUFFICS): libs/smbdes.c
+ $(CC) $(COUT)smbdes$(OBJSUFFICS) $(CFLAGS) libs/smbdes.c
+
+md5$(OBJSUFFICS): libs/md5.h libs/md5.c
+ $(CC) $(COUT)md5$(OBJSUFFICS) $(CFLAGS) libs/md5.c
+
+ntlm$(OBJSUFFICS): ntlm.c
+ $(CC) $(COUT)ntlm$(OBJSUFFICS) $(CFLAGS) ntlm.c
+
+stringtable$(OBJSUFFICS): stringtable.c
+ $(CC) $(COUT)stringtable$(OBJSUFFICS) $(CFLAGS) stringtable.c
+
+$(BUILDDIR)3proxy$(EXESUFFICS): 3proxy$(OBJSUFFICS) mainfunc$(OBJSUFFICS) srvproxy$(OBJSUFFICS) srvpop3p$(OBJSUFFICS) srvsmtpp$(OBJSUFFICS) srvftppr$(OBJSUFFICS) srvsocks$(OBJSUFFICS) srvtcppm$(OBJSUFFICS) srvicqpr$(OBJSUFFICS) srvmsnpr$(OBJSUFFICS) srvudppm$(OBJSUFFICS) sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) auth$(OBJSUFFICS) datatypes$(OBJSUFFICS) md4$(OBJSUFFICS) md5$(OBJSUFFICS) mycrypt$(OBJSUFFICS) base64$(OBJSUFFICS) ftp$(OBJSUFFICS) smbdes$(OBJSUFFICS) ntlm$(OBJSUFFICS) stringtable$(OBJSUFFICS) srvwebadmin$(OBJSUFFICS) srvdnspr$(OBJSUFFICS) plugins$(OBJSUFFICS) $(COMPATLIBS)
+ $(LN) $(LNOUT)$(BUILDDIR)3proxy$(EXESUFFICS) $(LDFLAGS) $(VERFILE) 3proxy$(OBJSUFFICS) mainfunc$(OBJSUFFICS) auth$(OBJSUFFICS) datatypes$(OBJSUFFICS) srvproxy$(OBJSUFFICS) srvpop3p$(OBJSUFFICS) srvsmtpp$(OBJSUFFICS) srvftppr$(OBJSUFFICS) srvsocks$(OBJSUFFICS) srvtcppm$(OBJSUFFICS) srvicqpr$(OBJSUFFICS) srvmsnpr$(OBJSUFFICS) srvudppm$(OBJSUFFICS) sockmap$(OBJSUFFICS) sockgetchar$(OBJSUFFICS) myalloc$(OBJSUFFICS) common$(OBJSUFFICS) mycrypt$(OBJSUFFICS) md5$(OBJSUFFICS) md4$(OBJSUFFICS) base64$(OBJSUFFICS) ftp$(OBJSUFFICS) smbdes$(OBJSUFFICS) ntlm$(OBJSUFFICS) stringtable$(OBJSUFFICS) srvwebadmin$(OBJSUFFICS) srvdnspr$(OBJSUFFICS) plugins$(OBJSUFFICS) $(COMPATLIBS) $(LIBS)
+
+clean:
+ @$(REMOVECOMMAND) *$(OBJSUFFICS) $(COMPFILES)
diff --git a/src/auth.c b/src/auth.c
new file mode 100644
index 0000000..8b22b11
--- /dev/null
+++ b/src/auth.c
@@ -0,0 +1,1329 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: auth.c,v 1.108 2012-04-11 23:01:18 vlad Exp $
+*/
+
+#include "proxy.h"
+
+#define HEADERSIZE 57
+#define RECORDSIZE 18
+
+unsigned char request[] = {
+ 0xa2, 0x48, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
+ 0x00, 0x00, 0x00, 0x00, 0x20, 0x43, 0x4b, 0x41,
+ 0x41, 0x41, 0x41, 0x41, 0x41, 0x41, 0x41, 0x41,
+ 0x41, 0x41, 0x41, 0x41, 0x41, 0x41, 0x41, 0x41,
+ 0x41, 0x41, 0x41, 0x41, 0x41, 0x41, 0x41, 0x41,
+ 0x41, 0x41, 0x41, 0x41, 0x41, 0x00, 0x00, 0x21,
+ 0x00, 0x01};
+
+unsigned char * getNetBIOSnamebyip(unsigned long ip){
+ unsigned char buf[1024];
+ struct sockaddr_in sins;
+ int res;
+ SOCKET sock;
+ unsigned char * username = NULL;
+ int i;
+ int j;
+ int nnames;
+ int type;
+
+ if ( (sock=so._socket(AF_INET,SOCK_DGRAM,IPPROTO_UDP)) == INVALID_SOCKET) return NULL;
+ memset(&sins, 0, sizeof(sins));
+ sins.sin_family = AF_INET;
+ sins.sin_port = htons(0);
+ sins.sin_addr.s_addr = INADDR_ANY;
+ if(so._bind(sock,(struct sockaddr *)&sins,sizeof(sins))) {
+ so._closesocket(sock);
+ return NULL;
+ }
+ sins.sin_family = AF_INET;
+ sins.sin_addr.s_addr = ip;
+ sins.sin_port = htons(137);
+ res=socksendto(sock, &sins, request, sizeof(request), conf.timeouts[SINGLEBYTE_L]*1000);
+ if(res <= 0) {
+ so._closesocket(sock);
+ return NULL;
+ }
+ res = sockrecvfrom(sock, &sins, buf, sizeof(buf), conf.timeouts[SINGLEBYTE_L]*1000);
+ so._closesocket(sock);
+ if(res < (HEADERSIZE + RECORDSIZE)) {
+ return NULL;
+ }
+ nnames = buf[HEADERSIZE-1];
+ if (res < (HEADERSIZE + (nnames * RECORDSIZE))) return NULL;
+ for (i = 0; i < nnames; i++){
+ type = buf[HEADERSIZE + (i*RECORDSIZE) + 15];
+ if( type == 3) {
+ for(j = 14; j && buf[HEADERSIZE + (i*RECORDSIZE) + j] == ' '; j--)
+ buf[HEADERSIZE + (i*RECORDSIZE) + j] = 0;
+ if(username)myfree(username);
+ username = (unsigned char *)mystrdup((char *)buf + HEADERSIZE + i*RECORDSIZE);
+ }
+ buf[HEADERSIZE + (i*RECORDSIZE) + 15] = 0;
+ }
+ return username;
+}
+
+int clientnegotiate(struct chain * redir, struct clientparam * param, unsigned long ip, unsigned short port){
+ unsigned char buf[1024];
+ struct in_addr ina;
+ int res;
+ int len=0;
+ unsigned char * user, *pass;
+
+ ina.s_addr = ip;
+
+
+ user = redir->extuser;
+ pass = redir->extpass;
+ if(user) {
+ if (*user == '*') {
+ if(!param->username) return 4;
+ user = param->username;
+ pass = param->password;
+ }
+ }
+ switch(redir->type){
+ case R_TCP:
+ case R_HTTP:
+ return 0;
+ case R_CONNECT:
+ case R_CONNECTP:
+ {
+ sprintf((char *)buf, "CONNECT ");
+ if(redir->type == R_CONNECTP && param->hostname) {
+ len = 8 + sprintf((char *)buf + 8, "%.256s", param->hostname);
+ }
+ else {
+ len = 8 + myinet_ntoa(ina, (char *)buf+8);
+ }
+ len += sprintf((char *)buf + len,
+ ":%hu HTTP/1.0\r\nProxy-Connection: keep-alive\r\n", ntohs(port));
+ if(user){
+ unsigned char username[256];
+ len += sprintf((char *)buf + len, "Proxy-authorization: basic ");
+ sprintf((char *)username, "%.128s:%.64s", user, pass?pass:(unsigned char *)"");
+ en64(username, buf+len, (int)strlen((char *)username));
+ len = (int)strlen((char *)buf);
+ len += sprintf((char *)buf + len, "\r\n");
+ }
+ len += sprintf((char *)buf + len, "\r\n");
+ if(socksend(param->remsock, buf, len, conf.timeouts[CHAIN_TO]) != (int)strlen((char *)buf))
+ return 31;
+ param->statssrv+=len;
+ param->nwrites++;
+ if((res = sockgetlinebuf(param, SERVER,buf,13,'\n',conf.timeouts[CHAIN_TO])) < 13)
+ return 32;
+ if(buf[9] != '2') return 33;
+ while((res = sockgetlinebuf(param, SERVER,buf,1023,'\n', conf.timeouts[CHAIN_TO])) > 2);
+ if(res <= 0) return 34;
+ return 0;
+ }
+ case R_SOCKS4:
+ case R_SOCKS4P:
+ case R_SOCKS4B:
+ {
+
+ buf[0] = 4;
+ buf[1] = 1;
+ memcpy(buf+2, &port, 2);
+ if(redir->type == R_SOCKS4P && param->hostname) {
+ buf[4] = buf[5] = buf[6] = 0;
+ buf[7] = 3;
+ }
+ else memcpy(buf+4, &ip, 4);
+ if(!user)user = (unsigned char *)"anonymous";
+ len = (int)strlen((char *)user) + 1;
+ memcpy(buf+8, user, len);
+ len += 8;
+ if(redir->type == R_SOCKS4P && param->hostname) {
+ int hostnamelen;
+
+ hostnamelen = (int)strlen((char *)param->hostname) + 1;
+ if(hostnamelen > 255) hostnamelen = 255;
+ memcpy(buf+len, param->hostname, hostnamelen);
+ len += hostnamelen;
+ }
+ if(socksend(param->remsock, buf, len, conf.timeouts[CHAIN_TO]) < len){
+ return 41;
+ }
+ param->statssrv+=len;
+ param->nwrites++;
+ if((len = sockgetlinebuf(param, SERVER, buf, (redir->type == R_SOCKS4B)? 3:8, EOF, conf.timeouts[CHAIN_TO])) != ((redir->type == R_SOCKS4B)? 3:8)){
+ return 42;
+ }
+ if(buf[1] != 90) {
+ return 43;
+ }
+
+ }
+ return 0;
+
+ case R_SOCKS5:
+ case R_SOCKS5P:
+ case R_SOCKS5B:
+ {
+ int inbuf = 0;
+ buf[0] = 5;
+ buf[1] = 1;
+ buf[2] = user? 2 : 0;
+ if(socksend(param->remsock, buf, 3, conf.timeouts[CHAIN_TO]) != 3){
+ return 51;
+ }
+ param->statssrv+=len;
+ param->nwrites++;
+ if(sockgetlinebuf(param, SERVER, buf, 2, EOF, conf.timeouts[CHAIN_TO]) != 2){
+ return 52;
+ }
+ if(buf[0] != 5) {
+ return 53;
+ }
+ if(buf[1] != 0 && !(buf[1] == 2 && user)){
+ return 54;
+ }
+ if(buf[1] == 2){
+ buf[inbuf++] = 1;
+ buf[inbuf] = (unsigned char)strlen((char *)user);
+ memcpy(buf+inbuf+1, user, buf[inbuf]);
+ inbuf += buf[inbuf] + 1;
+ buf[inbuf] = pass?(unsigned char)strlen((char *)pass):0;
+ if(pass)memcpy(buf+inbuf+1, pass, buf[inbuf]);
+ inbuf += buf[inbuf] + 1;
+ if(socksend(param->remsock, buf, inbuf, conf.timeouts[CHAIN_TO]) != inbuf){
+ return 51;
+ }
+ param->statssrv+=inbuf;
+ param->nwrites++;
+ if(sockgetlinebuf(param, SERVER, buf, 2, EOF, 60) != 2){
+ return 55;
+ }
+ if(buf[0] != 1 || buf[1] != 0) {
+ return 56;
+ }
+ }
+ buf[0] = 5;
+ buf[1] = 1;
+ buf[2] = 0;
+ if(redir->type == R_SOCKS5P && param->hostname) {
+ buf[3] = 3;
+ len = (int)strlen((char *)param->hostname);
+ if(len > 255) len = 255;
+ buf[4] = len;
+ memcpy(buf + 5, param->hostname, len);
+ len += 5;
+ }
+ else {
+ buf[3] = 1;
+ memcpy(buf+4, &ip, 4);
+ len = 8;
+ }
+ memcpy(buf+len, &port, 2);
+ len += 2;
+ if(socksend(param->remsock, buf, len, conf.timeouts[CHAIN_TO]) != len){
+ return 51;
+ }
+ param->statssrv+=len;
+ param->nwrites++;
+ if(sockgetlinebuf(param, SERVER, buf, 4, EOF, conf.timeouts[CHAIN_TO]) != 4){
+ return 57;
+ }
+ if(buf[0] != 5) {
+ return 53;
+ }
+ if(buf[1] != 0) {
+ return 60 + (buf[1] % 10);
+ }
+ if(buf[3] != 1) {
+ return 58;
+ }
+ if (redir->type != R_SOCKS5B && sockgetlinebuf(param, SERVER, buf, 6, EOF, conf.timeouts[CHAIN_TO]) != 6){
+ return 59;
+ }
+ return 0;
+ }
+
+ default:
+
+ return 30;
+ }
+}
+
+
+int handleredirect(struct clientparam * param, struct ace * acentry){
+ int connected = 0;
+ int weight = 1000;
+ int res;
+ int done = 0;
+ struct chain * cur;
+ struct chain * redir = NULL;
+ unsigned long targetip;
+ unsigned short targetport;
+ int r2;
+
+ if(param->remsock != INVALID_SOCKET) {
+ return 0;
+ }
+ targetip = param->req.sin_addr.s_addr;
+ targetport = param->req.sin_port;
+ if(!targetip || !targetport) return 100;
+
+ r2 = (myrand(param, sizeof(struct clientparam))%1000);
+
+ for(cur = acentry->chains; cur; cur=cur->next){
+ if(((weight = weight - cur->weight) > r2)|| done) {
+ if(weight <= 0) {
+ weight += 1000;
+ done = 0;
+ r2 = (myrand(param, sizeof(struct clientparam))%1000);
+ }
+ continue;
+ }
+ param->redirected++;
+ done = 1;
+ if(weight <= 0) {
+ weight += 1000;
+ done = 0;
+ r2 = (myrand(param, sizeof(struct clientparam))%1000);
+ }
+ if(!connected){
+ if(!cur->redirip && !cur->redirport){
+ if(cur->extuser){
+ if(param->extusername)
+ myfree(param->extusername);
+ param->extusername = (unsigned char *)mystrdup((char *)((*cur->extuser == '*' && param->username)? param->username : cur->extuser));
+ if(cur->extpass){
+ if(param->extpassword)
+ myfree(param->extpassword);
+ param->extpassword = (unsigned char *)mystrdup((char *)((*cur->extuser == '*' && param->password)?param->password : cur->extpass));
+ }
+ if(*cur->extuser == '*' && !param->username) return 4;
+ }
+ switch(cur->type){
+ case R_POP3:
+ param->redirectfunc = pop3pchild;
+ break;
+ case R_FTP:
+ param->redirectfunc = ftpprchild;
+ break;
+ case R_ADMIN:
+ param->redirectfunc = adminchild;
+ break;
+ case R_ICQ:
+ param->redirectfunc = icqprchild;
+ break;
+ case R_MSN:
+ param->redirectfunc = msnprchild;
+ break;
+ default:
+ param->redirectfunc = proxychild;
+ }
+ return 0;
+ }
+ else if(!cur->redirip && cur->redirport) param->extport = cur->redirport;
+ else if(!cur->redirport && cur->redirip) param->extip = cur->redirip;
+ else {
+ param->sins.sin_port = cur->redirport;
+ param->sins.sin_addr.s_addr = cur->redirip;
+ }
+
+ if((res = alwaysauth(param))){
+ return (res == 10)? res : 60+res;
+ }
+ }
+ else {
+ res = redir?clientnegotiate(redir, param, cur->redirip, cur->redirport):0;
+ if(res) return res;
+ }
+ redir = cur;
+ param->redirtype = redir->type;
+ if(redir->type == R_TCP || redir->type ==R_HTTP) {
+ if(cur->extuser){
+ if(*cur -> extuser == '*' && !param->username) return 4;
+ if(param->extusername)
+ myfree(param->extusername);
+ param->extusername = (unsigned char *)mystrdup((char *)((*cur->extuser == '*' && param->username)? param->username : cur->extuser));
+ if(cur->extpass){
+ if(param->extpassword)
+ myfree(param->extpassword);
+ param->extpassword = (unsigned char *)mystrdup((char *)((*cur->extuser == '*' && param->password)?param->password : cur->extpass));
+ }
+ }
+ return 0;
+ }
+ connected = 1;
+ }
+
+ if(!connected) return 9;
+ return redir?clientnegotiate(redir, param, targetip, targetport):0;
+}
+
+
+int ACLmatches(struct ace* acentry, struct clientparam * param){
+ struct userlist * userentry;
+ struct iplist *ipentry;
+ struct portlist *portentry;
+ struct period *periodentry;
+ unsigned char * username;
+ struct hostname * hstentry=NULL;
+ int i;
+ int match = 0;
+
+ username = param->username?param->username:(unsigned char *)"-";
+ if(acentry->src) {
+ for(ipentry = acentry->src; ipentry; ipentry = ipentry->next)
+ if(ipentry->ip == (param->sinc.sin_addr.s_addr & ipentry->mask)) {
+ break;
+ }
+ if(!ipentry) return 0;
+ }
+ if((acentry->dst && param->req.sin_addr.s_addr) || (acentry->dstnames && param->hostname)) {
+ for(ipentry = acentry->dst; ipentry; ipentry = ipentry->next)
+ if(ipentry->ip == (param->req.sin_addr.s_addr & ipentry->mask)) {
+ break;
+ }
+ if(!ipentry) {
+ if(acentry->dstnames && param->hostname){
+ for(i=0; param->hostname[i]; i++){
+ param->hostname[i] = tolower(param->hostname[i]);
+ }
+ while(i > 5 && param->hostname[i-1] == '.') param->hostname[i-1] = 0;
+ for(hstentry = acentry->dstnames; hstentry; hstentry = hstentry->next){
+ switch(hstentry->matchtype){
+ case 0:
+ if(strstr(param->hostname, hstentry->name)) match = 1;
+ break;
+
+ case 1:
+ if(strstr(param->hostname, hstentry->name) == (char *)param->hostname) match = 1;
+ break;
+
+ case 2:
+ if(strstr(param->hostname, hstentry->name) == (char *)(param->hostname + i - (strlen(hstentry->name)))) match = 1;
+ break;
+
+ default:
+ if(!strcmp(param->hostname, hstentry->name)) match = 1;
+ break;
+ }
+ if(match) break;
+ }
+ }
+ }
+ if(!ipentry && !hstentry) return 0;
+ }
+ if(acentry->ports && param->req.sin_port) {
+ for (portentry = acentry->ports; portentry; portentry = portentry->next)
+ if(ntohs(param->req.sin_port) >= portentry->startport &&
+ ntohs(param->req.sin_port) <= portentry->endport) {
+ break;
+ }
+ if(!portentry) return 0;
+ }
+ if(acentry->wdays){
+ if(!(acentry -> wdays & wday)) return 0;
+ }
+ if(acentry->periods){
+ int start_time = (int)(param->time_start - basetime);
+ for(periodentry = acentry->periods; periodentry; periodentry = periodentry -> next)
+ if(start_time >= periodentry->fromtime && start_time < periodentry->totime){
+ break;
+ }
+ if(!periodentry) return 0;
+ }
+ if(acentry->users){
+ for(userentry = acentry->users; userentry; userentry = userentry->next)
+ if(!strcmp((char *)username, (char *)userentry->user)){
+ break;
+ }
+ if(!userentry) return 0;
+ }
+ if(acentry->operation) {
+ if((acentry->operation & param->operation) != param->operation){
+ return 0;
+ }
+ }
+ if(acentry->weight && (acentry->weight < param->weight)) return 0;
+ return 1;
+}
+
+static void initbandlims (struct clientparam *param){
+ struct bandlim * be;
+ int i;
+ for(i=0, be = conf.bandlimiter; be && inext) {
+ if(ACLmatches(be->ace, param)){
+ if(be->ace->action == NOBANDLIM) {
+ break;
+ }
+ param->bandlims[i++] = be;
+ param->bandlimfunc = conf.bandlimfunc;
+ }
+ }
+ if(ibandlims[i] = NULL;
+ for(i=0, be = conf.bandlimiterout; be && inext) {
+ if(ACLmatches(be->ace, param)){
+ if(be->ace->action == NOBANDLIM) {
+ break;
+ }
+ param->bandlimsout[i++] = be;
+ param->bandlimfunc = conf.bandlimfunc;
+ }
+ }
+ if(ibandlimsout[i] = NULL;
+}
+
+unsigned bandlimitfunc(struct clientparam *param, unsigned nbytesin, unsigned nbytesout){
+ unsigned sleeptime = 0, nsleeptime;
+ unsigned long sec;
+ unsigned msec;
+ unsigned now;
+ int i;
+
+#ifdef _WIN32
+ struct timeb tb;
+
+ ftime(&tb);
+ sec = (unsigned)tb.time;
+ msec = (unsigned)tb.millitm*1000;
+#else
+ struct timeval tv;
+ gettimeofday(&tv, NULL);
+
+ sec = tv.tv_sec;
+ msec = tv.tv_usec;
+#endif
+ if(!nbytesin && !nbytesout) return 0;
+ pthread_mutex_lock(&bandlim_mutex);
+ if(param->srv->version != conf.paused){
+ initbandlims(param);
+ }
+ for(i=0; nbytesin&& ibandlims[i]; i++){
+ if( !param->bandlims[i]->basetime ||
+ param->bandlims[i]->basetime > sec ||
+ param->bandlims[i]->basetime < (sec - 120)
+ )
+ {
+ param->bandlims[i]->basetime = sec;
+ param->bandlims[i]->nexttime = 0;
+ continue;
+ }
+ now = ((sec - param->bandlims[i]->basetime) * 1000000) + msec;
+ nsleeptime = (param->bandlims[i]->nexttime > now)?
+ param->bandlims[i]->nexttime - now : 0;
+ sleeptime = (nsleeptime > sleeptime)? nsleeptime : sleeptime;
+ param->bandlims[i]->basetime = sec;
+ param->bandlims[i]->nexttime = msec + nsleeptime + ((param->bandlims[i]->rate > 1000000)? ((nbytesin/32)*(256000000/param->bandlims[i]->rate)) : (nbytesin * (8000000/param->bandlims[i]->rate)));
+ }
+ for(i=0; nbytesout && ibandlimsout[i]; i++){
+ if( !param->bandlimsout[i]->basetime ||
+ param->bandlimsout[i]->basetime > sec ||
+ param->bandlimsout[i]->basetime < (sec - 120)
+ )
+ {
+ param->bandlimsout[i]->basetime = sec;
+ param->bandlimsout[i]->nexttime = 0;
+ continue;
+ }
+ now = ((sec - param->bandlimsout[i]->basetime) * 1000000) + msec;
+ nsleeptime = (param->bandlimsout[i]->nexttime > now)?
+ param->bandlimsout[i]->nexttime - now : 0;
+ sleeptime = (nsleeptime > sleeptime)? nsleeptime : sleeptime;
+ param->bandlimsout[i]->basetime = sec;
+ param->bandlimsout[i]->nexttime = msec + nsleeptime + ((param->bandlimsout[i]->rate > 1000000)? ((nbytesout/32)*(256000000/param->bandlimsout[i]->rate)) : (nbytesout * (8000000/param->bandlimsout[i]->rate)));
+ }
+ pthread_mutex_unlock(&bandlim_mutex);
+ return sleeptime/1000;
+}
+
+void trafcountfunc(struct clientparam *param){
+ struct trafcount * tc;
+ unsigned long val;
+ int countout = 0;
+
+ pthread_mutex_lock(&tc_mutex);
+ for(tc = conf.trafcounter; tc; tc = tc->next) {
+ if(ACLmatches(tc->ace, param)){
+ time_t t;
+ if(tc->ace->action == NOCOUNTIN) break;
+ if(tc->ace->action != COUNTIN) {
+ countout = 1;
+ continue;
+ }
+ val = tc->traf + param->statssrv;
+ if(val < tc->traf) tc->trafgb++;
+ tc->traf = val;
+ time(&t);
+ tc->updated = t;
+ }
+ }
+ if(countout) for(tc = conf.trafcounter; tc; tc = tc->next) {
+ if(ACLmatches(tc->ace, param)){
+ time_t t;
+ if(tc->ace->action == NOCOUNTOUT) break;
+ if(tc->ace->action != COUNTOUT) {
+ continue;
+ }
+ val = tc->traf + param->statscli;
+ if(val < tc->traf) tc->trafgb++;
+ tc->traf = val;
+ time(&t);
+ tc->updated = t;
+ }
+ }
+
+ pthread_mutex_unlock(&tc_mutex);
+}
+
+int alwaysauth(struct clientparam * param){
+ int res;
+ struct trafcount * tc;
+ int countout = 0;
+
+ res = doconnect(param);
+ if(!res){
+ if(param->srv->version != conf.paused) return 333;
+ initbandlims(param);
+ for(tc = conf.trafcounter; tc; tc = tc->next) {
+ if(tc->disabled) continue;
+ if(ACLmatches(tc->ace, param)){
+ if(tc->ace->action == NOCOUNTIN) break;
+ if(tc->ace->action != COUNTIN) {
+ countout = 1;
+ continue;
+ }
+
+ if((tc->traflimgb < tc->trafgb) ||
+ ((tc->traflimgb == tc->trafgb) && (tc->traflim < tc->traf))
+ ) return 10;
+ param->trafcountfunc = conf.trafcountfunc;
+ if(tc->traflimgb - tc->trafgb < 1 || ((tc->traflimgb - tc->trafgb) == 1 && tc->traf > tc->traflim)){
+ unsigned maxtraf = tc->traflim - tc->traf;
+ if(!param->maxtrafin || param->maxtrafin > maxtraf) param->maxtrafin = maxtraf;
+ }
+ if((tc->trafgb > tc->traflimgb) || (tc->trafgb == tc->traflimgb && tc->traf >= tc->traflim)) param->maxtrafin = 1;
+ }
+ }
+ if(countout)for(tc = conf.trafcounter; tc; tc = tc->next) {
+ if(tc->disabled) continue;
+ if(ACLmatches(tc->ace, param)){
+ if(tc->ace->action == NOCOUNTOUT) break;
+ if(tc->ace->action != COUNTOUT) {
+ continue;
+ }
+
+ if((tc->traflimgb < tc->trafgb) ||
+ ((tc->traflimgb == tc->trafgb) && (tc->traflim < tc->traf))
+ ) return 10;
+ param->trafcountfunc = conf.trafcountfunc;
+ if(tc->traflimgb - tc->trafgb < 1 || ((tc->traflimgb - tc->trafgb) == 1 && tc->traf > tc->traflim)){
+ unsigned maxtraf = tc->traflim - tc->traf;
+ if(!param->maxtrafout || param->maxtrafout > maxtraf) param->maxtrafout = maxtraf;
+ }
+ if((tc->trafgb > tc->traflimgb) || (tc->trafgb == tc->traflimgb && tc->traf >= tc->traflim)) param->maxtrafout = 1;
+ }
+ }
+
+ }
+ return res;
+}
+
+int checkACL(struct clientparam * param){
+ struct ace* acentry;
+
+ if(!param->srv->acl) {
+ return alwaysauth(param);
+ }
+ for(acentry = param->srv->acl; acentry; acentry = acentry->next) {
+ if(ACLmatches(acentry, param)) {
+ param->nolog = acentry->nolog;
+ param->weight = acentry->weight;
+ if(acentry->action == 2) {
+ struct ace dup;
+
+ if(param->operation < 256 && !(param->operation & CONNECT)){
+ continue;
+ }
+ if(param->redirected && acentry->chains && !acentry->chains->redirip && !acentry->chains->redirport) {
+ continue;
+ }
+ memcpy(&dup, acentry, sizeof(struct ace));
+ return handleredirect(param, &dup);
+ }
+ return acentry->action;
+ }
+ }
+ return 3;
+}
+
+struct authcache {
+ char * username;
+ char * password;
+ time_t expires;
+ unsigned long ip;
+ struct authcache *next;
+} *authc = NULL;
+
+
+int cacheauth(struct clientparam * param){
+ struct authcache *ac, *last=NULL;
+
+ pthread_mutex_lock(&hash_mutex);
+ for(ac = authc; ac; ){
+ if(ac->expires <= conf.time){
+ if(ac->username)myfree(ac->username);
+ if(ac->password)myfree(ac->password);
+ if(!last){
+ authc = ac->next;
+ myfree(ac);
+ ac = authc;
+ }
+ else {
+ last->next = ac->next;
+ myfree(ac);
+ ac = last->next;
+ }
+ continue;
+
+ }
+ if(((!(conf.authcachetype&2)) || (param->username && ac->username && !strcmp(ac->username, param->username))) &&
+ ((!(conf.authcachetype&1)) || ac->ip == param->sinc.sin_addr.s_addr) &&
+ (!(conf.authcachetype&4) || (ac->password && param->password && !strcmp(ac->password, param->password)))) {
+ if(param->username){
+ myfree(param->username);
+ }
+ param->username = mystrdup(ac->username);
+ pthread_mutex_unlock(&hash_mutex);
+ return 0;
+ }
+ last = ac;
+ ac = ac->next;
+ }
+
+ pthread_mutex_unlock(&hash_mutex);
+ return 4;
+}
+
+int doauth(struct clientparam * param){
+ int res = 0;
+ struct auth *authfuncs;
+ struct authcache *ac;
+ char * tmp;
+ int ret = 0;
+
+ for(authfuncs=param->srv->authfuncs; authfuncs; authfuncs=authfuncs->next){
+ res = authfuncs->authenticate?(*authfuncs->authenticate)(param):0;
+ if(!res) {
+ if(authfuncs->authorize &&
+ (res = (*authfuncs->authorize)(param)))
+ return res;
+ if(conf.authcachetype && authfuncs->authenticate && authfuncs->authenticate != cacheauth && param->username && (!(conf.authcachetype&4) || (!param->pwtype && param->password))){
+ pthread_mutex_lock(&hash_mutex);
+ for(ac = authc; ac; ac = ac->next){
+ if((!(conf.authcachetype&2) || !strcmp(ac->username, param->username)) &&
+ (!(conf.authcachetype&1) || ac->ip == param->sinc.sin_addr.s_addr) &&
+ (!(conf.authcachetype&4) || (ac->password && !strcmp(ac->password, param->password)))) {
+ ac->expires = conf.time + conf.authcachetime;
+ if(strcmp(ac->username, param->username)){
+ tmp = ac->username;
+ ac->username = mystrdup(param->username);
+ myfree(tmp);
+ }
+ if((conf.authcachetype&4)){
+ tmp = ac->password;
+ ac->password = mystrdup(param->password);
+ myfree(tmp);
+ }
+ ac->ip = param->sinc.sin_addr.s_addr;
+ break;
+ }
+ }
+ if(!ac){
+ ac = myalloc(sizeof(struct authcache));
+ if(ac){
+ ac->expires = conf.time + conf.authcachetime;
+ ac->username = mystrdup(param->username);
+ ac->ip = param->sinc.sin_addr.s_addr;
+ ac->password = NULL;
+ if((conf.authcachetype&4) && param->password) ac->password = mystrdup(param->password);
+ }
+ ac->next = authc;
+ authc = ac;
+ }
+ pthread_mutex_unlock(&hash_mutex);
+ }
+ break;
+ }
+ if(res > ret) ret = res;
+ }
+ if(!res){
+ return alwaysauth(param);
+ }
+
+ return ret;
+}
+
+
+int ipauth(struct clientparam * param){
+ int res;
+ unsigned char *username;
+ username = param->username;
+ param->username = NULL;
+ res = checkACL(param);
+ param->username = username;
+ return res;
+}
+
+int userauth(struct clientparam * param){
+ return (param->username)? 0:4;
+}
+
+int nbnameauth(struct clientparam * param){
+ unsigned char * name = getNetBIOSnamebyip(param->sinc.sin_addr.s_addr);
+
+ if (param->username) myfree (param->username);
+ param->username = name;
+ return name? 0:4;
+}
+
+int dnsauth(struct clientparam * param){
+ char buf[32];
+ unsigned u = ntohl(param->sinc.sin_addr.s_addr);
+
+ sprintf(buf, "%u.%u.%u.%u.in-addr.arpa",
+
+
+ ((u&0x000000FF)),
+ ((u&0x0000FF00)>>8),
+ ((u&0x00FF0000)>>16),
+ ((u&0xFF000000)>>24));
+
+
+ if(param->sinc.sin_addr.s_addr != udpresolve(buf, NULL, param, 1)) return 6;
+
+ return param->username? 0:4;
+}
+
+int strongauth(struct clientparam * param){
+ struct passwords * pwl;
+ unsigned char buf[256];
+
+
+ if(!param->username) return 4;
+ pthread_mutex_lock(&pwl_mutex);
+ for(pwl = conf.pwl; pwl; pwl=pwl->next){
+ if(!strcmp((char *)pwl->user, (char *)param->username)) switch(pwl->pwtype) {
+ case CL:
+ if(!pwl->password || !*pwl->password){
+ break;
+ }
+ else if (!param->pwtype && param->password && !strcmp((char *)param->password, (char *)pwl->password)){
+ break;
+ }
+#ifndef NOCRYPT
+ else if (param->pwtype == 2 && param->password) {
+ ntpwdhash(buf, pwl->password, 0);
+ mschap(buf, param->password, buf + 16);
+ if(!memcmp(buf+16, param->password+8, 24)) {
+ break;
+ }
+ }
+#endif
+ pthread_mutex_unlock(&pwl_mutex);
+ return 6;
+#ifndef NOCRYPT
+ case CR:
+ if(param->password && !param->pwtype && !strcmp((char *)pwl->password, (char *)mycrypt(param->password, pwl->password,buf))) {
+ break;
+ }
+ pthread_mutex_unlock(&pwl_mutex);
+ return 7;
+ case NT:
+ if(param->password && !param->pwtype && !memcmp(pwl->password, ntpwdhash(buf,param->password, 1), 32)) {
+ break;
+ }
+ else if (param->pwtype == 2){
+ fromhex(pwl->password, buf, 16);
+ mschap(buf, param->password, buf + 16);
+ if(!memcmp(buf + 16, param->password+8, 24)) {
+ break;
+ }
+ }
+ pthread_mutex_unlock(&pwl_mutex);
+ return 8;
+#endif
+ default:
+ pthread_mutex_unlock(&pwl_mutex);
+ return 999;
+ }
+ else continue;
+ pthread_mutex_unlock(&pwl_mutex);
+ return 0;
+ }
+ pthread_mutex_unlock(&pwl_mutex);
+ return 5;
+}
+
+
+struct auth authfuncs[] = {
+ {authfuncs+1, NULL, NULL, ""},
+ {authfuncs+2, ipauth, NULL, "iponly"},
+ {authfuncs+3, userauth, checkACL, "useronly"},
+ {authfuncs+4, nbnameauth, checkACL, "nbname"},
+ {authfuncs+5, dnsauth, checkACL, "dnsname"},
+ {authfuncs+6, strongauth, checkACL, "strong"},
+ {authfuncs+7, cacheauth, checkACL, "cache"},
+ {authfuncs+8, NULL, NULL, "none"},
+
+ {NULL, NULL, NULL, ""}
+};
+
+
+struct hashentry {
+ unsigned char hash[sizeof(unsigned)*4];
+ unsigned long value;
+ time_t expires;
+ struct hashentry *next;
+};
+
+struct hashtable {
+ unsigned hashsize;
+ struct hashentry ** hashtable;
+ struct hashentry * hashvalues;
+ struct hashentry * hashempty;
+};
+
+struct hashtable dns_table = {0, NULL, NULL, NULL};
+
+
+void nametohash(const unsigned char * name, unsigned char *hash){
+ unsigned i, j;
+ memset(hash, 0, sizeof(unsigned)*4);
+ for(i=0, j=0; name[j]; j++){
+ hash[i] += toupper(name[j]) - 32;
+ if(++i == sizeof(unsigned)*4) i = 0;
+ }
+}
+
+unsigned hashindex(struct hashtable *ht, const unsigned char* hash){
+ unsigned t1, t2, t3, t4;
+ t1 = *(unsigned *)hash;
+ t2 = *(unsigned *)(hash + sizeof(unsigned));
+ t3 = *(unsigned *)(hash + (2*sizeof(unsigned)));
+ t4 = *(unsigned *)(hash + (3*sizeof(unsigned)));
+ return (t1 + (t2 * 7) + (t3 * 17) + (t4 * 29) ) % (ht->hashsize >> 2);
+}
+
+
+void destroyhashtable(struct hashtable *ht){
+ pthread_mutex_lock(&hash_mutex);
+ if(ht->hashtable){
+ myfree(ht->hashtable);
+ ht->hashtable = NULL;
+ }
+ if(ht->hashvalues){
+ myfree(ht->hashvalues);
+ ht->hashvalues = NULL;
+ }
+ ht->hashsize = 0;
+ pthread_mutex_unlock(&hash_mutex);
+}
+
+int inithashtable(struct hashtable *ht, unsigned nhashsize){
+ unsigned i;
+
+ if(nhashsize<4) return 1;
+ if(ht->hashtable){
+ myfree(ht->hashtable);
+ ht->hashtable = NULL;
+ }
+ if(ht->hashvalues){
+ myfree(ht->hashvalues);
+ ht->hashvalues = NULL;
+ }
+ ht->hashsize = 0;
+ if(!(ht->hashtable = myalloc((nhashsize>>2) * sizeof(struct hashentry *)))){
+ return 2;
+ }
+ if(!(ht->hashvalues = myalloc(nhashsize * sizeof(struct hashentry)))){
+ myfree(ht->hashtable);
+ ht->hashtable = NULL;
+ return 3;
+ }
+ ht->hashsize = nhashsize;
+ memset(ht->hashtable, 0, (ht->hashsize>>2) * sizeof(struct hashentry *));
+ memset(ht->hashvalues, 0, ht->hashsize * sizeof(struct hashentry));
+ for(i = 0; i< (ht->hashsize - 1); i++) {
+ (ht->hashvalues + i)->next = ht->hashvalues + i + 1;
+ }
+ ht->hashempty = ht->hashvalues;
+ return 0;
+}
+
+int initdnshashtable(unsigned nhashsize){
+ return inithashtable(&dns_table, nhashsize);
+}
+
+void hashadd(struct hashtable *ht, const unsigned char* name, unsigned long value, time_t expires){
+ struct hashentry * he;
+ unsigned index;
+
+ if(!value||!name||!ht->hashtable||!ht->hashempty) return;
+ pthread_mutex_lock(&hash_mutex);
+ he = ht->hashempty;
+ ht->hashempty = ht->hashempty->next;
+ nametohash(name, he->hash);
+ he->value = value;
+ he->expires = expires;
+ he->next = NULL;
+ index = hashindex(ht, he->hash);
+ if(!ht->hashtable[index] || !memcmp(he->hash, ht->hashtable[index]->hash, sizeof(he->hash))){
+ he->next = ht->hashtable[index];
+ ht->hashtable[index] = he;
+ }
+ else {
+ memset(he, 0, sizeof(struct hashentry));
+ he->next = ht->hashempty;
+ ht->hashempty = he;
+ }
+ pthread_mutex_unlock(&hash_mutex);
+}
+
+unsigned long hashresolv(struct hashtable *ht, const unsigned char* name, unsigned *ttl){
+ unsigned char hash[sizeof(unsigned)*4];
+ struct hashentry ** hep;
+ struct hashentry *he;
+ unsigned index;
+ time_t t;
+
+ if(!ht->hashtable || !name) return 0;
+ time(&t);
+ nametohash(name, hash);
+ index = hashindex(ht, hash);
+ pthread_mutex_lock(&hash_mutex);
+ for(hep = ht->hashtable + index; (he = *hep)!=NULL; ){
+ if((unsigned long)he->expires < (unsigned long)t) {
+ (*hep) = he->next;
+ he->expires = 0;
+ he->next = ht->hashempty;
+ ht->hashempty = he;
+ }
+ else if(!memcmp(hash, he->hash, sizeof(unsigned)*4)){
+ pthread_mutex_unlock(&hash_mutex);
+ if(ttl) *ttl = (unsigned)(he->expires - t);
+ return he->value;
+ }
+ else hep=&(he->next);
+ }
+ pthread_mutex_unlock(&hash_mutex);
+ return 0;
+}
+
+unsigned long nservers[MAXNSERVERS] = {0, 0, 0, 0, 0};
+
+unsigned long authnserver;
+
+
+unsigned long udpresolve(unsigned char * name, unsigned *retttl, struct clientparam* param, int makeauth){
+
+ int i;
+ unsigned long retval;
+
+ if((retval = hashresolv(&dns_table, name, retttl))) {
+ return retval;
+ }
+
+ for(i=0; (i<(makeauth && authnserver)? 1 : MAXNSERVERS) && ((makeauth && authnserver) || nservers[i]); i++){
+ unsigned short nquery, nq, na;
+ unsigned char buf[4096], *s1, *s2;
+ int j, k, len, flen;
+ SOCKET sock;
+ unsigned ttl;
+ time_t t;
+ struct sockaddr_in sin, *sinsp;
+
+ memset(&sin, 0, sizeof(sin));
+ sinsp = (param && !makeauth)? ¶m->sins : &sin;
+
+
+ if((sock=so._socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) == INVALID_SOCKET) break;
+ sinsp->sin_family = AF_INET;
+ sinsp->sin_port = htons(0);
+ sinsp->sin_addr.s_addr = htonl(0);
+ if(so._bind(sock,(struct sockaddr *)sinsp,sizeof(struct sockaddr_in))) {
+ so._shutdown(sock, SHUT_RDWR);
+ so._closesocket(sock);
+ break;
+ }
+ sinsp->sin_addr.s_addr = (makeauth && authnserver)?authnserver : nservers[i];
+ sinsp->sin_port = htons(53);
+
+ len = (int)strlen((char *)name);
+ nquery = myrand(name, len);
+ *(unsigned short*)buf = nquery; /* query id */
+ buf[2] = 1; /* recursive */
+ buf[3] = 0;
+ buf[4] = 0;
+ buf[5] = 1; /* 1 request */
+ buf[6] = buf[7] = 0; /* no replies */
+ buf[8] = buf[9] = 0; /* no ns count */
+ buf[10] = buf[11] = 0; /* no additional */
+ if(len > 255) {
+ len = 255;
+ }
+ memcpy(buf + 13, name, len);
+ len += 13;
+ buf[len] = 0;
+ for(s2 = buf + 12; (s1 = (unsigned char *)strchr((char *)s2 + 1, '.')); s2 = s1)*s2 = (unsigned char)((s1 - s2) - 1);
+ *s2 = (len - (int)(s2 - buf)) - 1;
+ len++;
+ buf[len++] = 0;
+ buf[len++] = (makeauth == 1)? 0x0c : 0x01; /* PTR:host address */
+ buf[len++] = 0;
+ buf[len++] = 1; /* INET */
+ if(socksendto(sock, sinsp, buf, len, conf.timeouts[SINGLEBYTE_L]*1000) != len){
+ so._shutdown(sock, SHUT_RDWR);
+ so._closesocket(sock);
+ continue;
+ }
+ if(param) param->statscli += len;
+ len = sockrecvfrom(sock, sinsp, buf, 4096, 15000);
+ so._shutdown(sock, SHUT_RDWR);
+ so._closesocket(sock);
+ if(len <= 13) continue;
+ if(param) param->statssrv += len;
+ if(*(unsigned short *)buf != nquery)continue;
+ if((na = buf[7] + (((unsigned short)buf[6])<<8)) < 1) {
+ return 0;
+ }
+ nq = buf[5] + (((unsigned short)buf[4])<<8);
+ if (nq != 1) {
+ continue; /* we did only 1 request */
+ }
+ for(k = 13; k= len) {
+ continue;
+ }
+ k += 4;
+ if(na > 255) na = 255; /* somebody is very evil */
+ for (j = 0; j < na; j++) { /* now there should be answers */
+ if((k+16) > len) {
+ break;
+ }
+ flen = buf[k+11] + (((unsigned short)buf[k+10])<<8);
+ if((k+12+flen) > len) break;
+ if(makeauth != 1){
+ if(buf[k+2] != 0 || buf[k+3] != 0x01 || flen != 4) {
+ k+= (12 + flen);
+ continue; /* we need A IPv4 */
+ }
+ retval = *(unsigned long *)(buf + k + 12);
+ ttl = ntohl(*(unsigned long *)(buf + k + 6));
+ t = time(0);
+ if(ttl < 60 || ((unsigned)t)+ttl < ttl) ttl = 300;
+ if(ttl){
+ hashadd(&dns_table, name, retval, ((unsigned)t)+ttl);
+ }
+ if(retttl) *retttl = ttl;
+ return retval;
+ }
+ else {
+
+ if(buf[k+2] != 0 || buf[k+3] != 0x0c) {
+ k+= (12 + flen);
+ continue; /* we need A PTR */
+ }
+ for (s2 = buf + k + 12; s2 < (buf + k + 12 + len) && *s2; ){
+ s1 = s2 + ((unsigned)*s2) + 1;
+ *s2 = '.';
+ s2 = s1;
+ }
+ *s2 = 0;
+ if(param->username)myfree(param->username);
+ param->username = mystrdup (buf + k + 13);
+
+ return udpresolve(param->username, NULL, NULL, 2);
+ }
+ }
+ }
+ return 0;
+}
+
+unsigned long myresolver(unsigned char * name){
+ return udpresolve(name, NULL, NULL, 0);
+}
+
+unsigned long fakeresolver (unsigned char *name){
+ return htonl(0x7F000002);
+}
+
+#ifndef NOODBC
+
+SQLHENV henv = NULL;
+SQLHSTMT hstmt = NULL;
+SQLHDBC hdbc = NULL;
+char * sqlstring = NULL;
+
+
+void close_sql(){
+ if(hstmt) {
+ SQLFreeHandle(SQL_HANDLE_STMT, hstmt);
+ hstmt = NULL;
+ }
+ if(hdbc){
+ SQLDisconnect(hdbc);
+ SQLFreeHandle(SQL_HANDLE_DBC, hdbc);
+ hdbc = NULL;
+ }
+ if(henv) {
+ SQLFreeHandle(SQL_HANDLE_ENV, henv);
+ henv = NULL;
+ }
+}
+
+int attempt = 0;
+time_t attempt_time = 0;
+
+int init_sql(char * s){
+ SQLRETURN retcode;
+ char * datasource;
+ char * username;
+ char * password;
+ char * string;
+
+ if(!s) return 0;
+ if(!sqlstring || strcmp(sqlstring, s)){
+ string = sqlstring;
+ sqlstring=mystrdup(s);
+ if(string)myfree(string);
+ }
+
+ if(hstmt || hdbc || henv) close_sql();
+ attempt++;
+ attempt_time = time(0);
+ if(!henv){
+ retcode = SQLAllocHandle(SQL_HANDLE_ENV, SQL_NULL_HANDLE, &henv);
+ if (!henv || (retcode != SQL_SUCCESS && retcode != SQL_SUCCESS_WITH_INFO)){
+ henv = NULL;
+ return 0;
+ }
+ retcode = SQLSetEnvAttr(henv, SQL_ATTR_ODBC_VERSION, (void*)SQL_OV_ODBC3, 0);
+
+ if (retcode != SQL_SUCCESS && retcode != SQL_SUCCESS_WITH_INFO) {
+ return 0;
+ }
+ }
+ if(!hdbc){
+ retcode = SQLAllocHandle(SQL_HANDLE_DBC, henv, &hdbc);
+ if (!hdbc || (retcode != SQL_SUCCESS && retcode != SQL_SUCCESS_WITH_INFO)) {
+ hdbc = NULL;
+ SQLFreeHandle(SQL_HANDLE_ENV, henv);
+ henv = NULL;
+ return 0;
+ }
+ SQLSetConnectAttr(hdbc, SQL_LOGIN_TIMEOUT, (void*)15, 0);
+ }
+ string = mystrdup(sqlstring);
+ if(!string) return 0;
+ datasource = strtok(string, ",");
+ username = strtok(NULL, ",");
+ password = strtok(NULL, ",");
+
+
+ /* Connect to data source */
+ retcode = SQLConnect(hdbc, (SQLCHAR*) datasource, (SQLSMALLINT)strlen(datasource),
+ (SQLCHAR*) username, (SQLSMALLINT)((username)?strlen(username):0),
+ (SQLCHAR*) password, (SQLSMALLINT)((password)?strlen(password):0));
+
+ myfree(string);
+ if (retcode != SQL_SUCCESS && retcode != SQL_SUCCESS_WITH_INFO){
+ SQLFreeHandle(SQL_HANDLE_DBC, hdbc);
+ hdbc = NULL;
+ SQLFreeHandle(SQL_HANDLE_ENV, henv);
+ henv = NULL;
+ return 0;
+ }
+ retcode = SQLAllocHandle(SQL_HANDLE_STMT, hdbc, &hstmt);
+ if (retcode != SQL_SUCCESS && retcode != SQL_SUCCESS_WITH_INFO){
+ close_sql();
+ return 0;
+ }
+ return 1;
+}
+
+void sqlerr (char *buf){
+ if(conf.stdlog){
+ fprintf(conf.stdlog, "%s\n", buf);
+ fflush(conf.stdlog);
+ }
+ pthread_mutex_unlock(&odbc_mutex);
+}
+
+void logsql(struct clientparam * param, const unsigned char *s) {
+ unsigned char buf[4096];
+ SQLRETURN ret;
+ int len;
+
+ len = dobuf(param, buf, s, "\'");
+
+ if(param->nolog) return;
+ pthread_mutex_lock(&odbc_mutex);
+
+ if(attempt > 5){
+ time_t t;
+
+ t = time(0);
+ if (t - attempt_time < 180){
+ sqlerr(buf);
+ return;
+ }
+ }
+ if(!hstmt){
+ if(!init_sql(sqlstring)) {
+ sqlerr(buf);
+ return;
+ }
+ }
+ if(hstmt){
+ ret = SQLExecDirect(hstmt, (SQLCHAR *)buf, (SQLINTEGER)len);
+ if(ret != SQL_SUCCESS && ret != SQL_SUCCESS_WITH_INFO){
+ close_sql();
+ if(!init_sql(sqlstring)){
+ sqlerr(buf);
+ return;
+ }
+ if(hstmt) {
+ ret = SQLExecDirect(hstmt, (SQLCHAR *)buf, (SQLINTEGER)len);
+ if(ret != SQL_SUCCESS && ret != SQL_SUCCESS_WITH_INFO){
+ sqlerr(buf);
+ return;
+ }
+ attempt = 0;
+ }
+ }
+ attempt = 0;
+ }
+ pthread_mutex_unlock(&odbc_mutex);
+}
+
+#endif
+
+#ifdef WITHMAIN
+int main(int argc, unsigned char * argv[]) {
+ unsigned ip = 0;
+ WSADATA wd;
+ WSAStartup(MAKEWORD( 1, 1 ), &wd);
+ if(argc == 2)ip=getip(argv[1]);
+ if(!hp) {
+ printf("Not found");
+ return 0;
+ }
+ printf("Name: '%s'\n", getnamebyip(ip);
+ return 0;
+}
+#endif
diff --git a/src/base64.c b/src/base64.c
new file mode 100644
index 0000000..734daec
--- /dev/null
+++ b/src/base64.c
@@ -0,0 +1,104 @@
+/*
+ * Copyright (c) 2000-2008 3APA3A
+ *
+ * please read License Agreement
+ *
+ * $Id: base64.c,v 1.6 2008/01/08 21:46:36 vlad Exp $
+ */
+
+#include
+
+static const unsigned char base64digits[] =
+ "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+#define BAD 255
+static const unsigned char base64val[] = {
+ BAD,BAD,BAD,BAD, BAD,BAD,BAD,BAD, BAD,BAD,BAD,BAD, BAD,BAD,BAD,BAD,
+ BAD,BAD,BAD,BAD, BAD,BAD,BAD,BAD, BAD,BAD,BAD,BAD, BAD,BAD,BAD,BAD,
+ BAD,BAD,BAD,BAD, BAD,BAD,BAD,BAD, BAD,BAD,BAD, 62, BAD,BAD,BAD, 63,
+ 52, 53, 54, 55, 56, 57, 58, 59, 60, 61,BAD,BAD, BAD,BAD,BAD,BAD,
+ BAD, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+ 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,BAD, BAD,BAD,BAD,BAD,
+ BAD, 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,BAD, BAD,BAD,BAD,BAD
+};
+#define DECODE64(c) ((c > 32 && c<127)? base64val[(int)c] : BAD)
+
+unsigned char* en64 (const unsigned char *in, unsigned char *out, int inlen)
+{
+ for (; inlen > 0; inlen -= 3, in+=3)
+ {
+
+ *out++ = base64digits[in[0] >> 2];
+ *out++ = base64digits[((in[0]&3)<<4) | ((inlen > 1)?(in[1]>>4):0)];
+ *out++ = (inlen > 1)? base64digits[((in[1] << 2) & 0x3c) | ((inlen > 2)? (in[2] >> 6) : 0)]: '=';
+ *out++ = (inlen > 2)? base64digits[in[2] & 0x3f] : '=';
+ }
+ *out = '\0';
+ return out;
+}
+
+int de64 (const char *in, char *out, int maxlen)
+{
+ int len = 0;
+ register unsigned char digit1, digit2, digit3, digit4;
+
+ if (in[0] == '+' && in[1] == ' ')
+ in += 2;
+ if (*in == '\r')
+ return(0);
+
+ do {
+ digit1 = in[0];
+ if (DECODE64(digit1) == BAD)
+ return(-1);
+ digit2 = in[1];
+ if (DECODE64(digit2) == BAD)
+ return(-1);
+ digit3 = in[2];
+ if (digit3 != '=' && DECODE64(digit3) == BAD)
+ return(-1);
+ digit4 = in[3];
+ if (digit4 != '=' && DECODE64(digit4) == BAD)
+ return(-1);
+ in += 4;
+ *out++ = (DECODE64(digit1) << 2) | (DECODE64(digit2) >> 4);
+ ++len;
+ if (digit3 != '=')
+ {
+ *out++ = ((DECODE64(digit2) << 4) & 0xf0) | (DECODE64(digit3) >> 2);
+ ++len;
+ if (digit4 != '=')
+ {
+ *out++ = ((DECODE64(digit3) << 6) & 0xc0) | DECODE64(digit4);
+ ++len;
+ }
+ }
+ } while
+ (*in && *in != '\r' && digit4 != '=' && (maxlen-=4) >= 4);
+
+ return (len);
+}
+
+unsigned char hex[] = "0123456789ABCDEF";
+
+void tohex(unsigned char *in, unsigned char *out, int len){
+ int i;
+
+ for (i=0; i>4)];
+ out[(i<<1) + 1] = hex[(in[i]&0x0F)];
+ }
+ out[(i<<1)] = 0;
+}
+
+void fromhex(unsigned char *in, unsigned char *out, int len){
+ char *c1, *c2;
+ for (; len > 0; len--) {
+ c1 = strchr((char *)hex, *in++);
+ c2 = strchr((char *)hex, *in++);
+ if(c1 && c2){
+ *out++ = ((unsigned char)((unsigned char *)c1 - hex) << 4) + (unsigned char)((unsigned char *)c2 - hex);
+ }
+ }
+}
diff --git a/src/common.c b/src/common.c
new file mode 100644
index 0000000..a2fc23a
--- /dev/null
+++ b/src/common.c
@@ -0,0 +1,721 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: common.c,v 1.94 2014-04-07 21:24:45 vlad Exp $
+*/
+
+
+
+#include "proxy.h"
+
+
+char * copyright = COPYRIGHT;
+
+int randomizer = 1;
+
+#ifndef _WIN32
+ pthread_attr_t pa;
+#endif
+
+unsigned char **stringtable = NULL;
+
+int myinet_ntoa(struct in_addr in, char * buf){
+ unsigned u = ntohl(in.s_addr);
+ return sprintf(buf, "%u.%u.%u.%u",
+ ((u&0xFF000000)>>24),
+ ((u&0x00FF0000)>>16),
+ ((u&0x0000FF00)>>8),
+ ((u&0x000000FF)));
+}
+
+char *rotations[] = {
+ "",
+ "/min",
+ "/hour",
+ "/day",
+ "/week",
+ "/month",
+ "/year",
+ "",
+};
+
+
+struct extparam conf = {
+ {1, 5, 30, 60, 180, 1800, 15, 60, 0, 0},
+ NULL,
+ NULL,
+ NULL, NULL,
+ NULL,
+ NULL,
+ 0, -1, 0, 0, 0, 0, 0, 500, 0, 0, 0,
+ 6, 600,
+ 1048576,
+ NULL, NULL,
+ NONE, NONE,
+ NULL,
+ INADDR_ANY, INADDR_ANY,
+ 0, 0,
+ NULL,
+ NULL,
+ doconnect,
+ lognone,
+ NULL,
+ NULL,
+ NULL, NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ (time_t)0, (time_t)0,
+ 0,0,
+ '@'
+};
+
+int myrand(void * entropy, int len){
+ int i;
+ unsigned short init;
+
+ init = randomizer;
+ for(i=0; i < len/2; i++){
+ init ^= ((unsigned short *)entropy)[i];
+ }
+ srand(init);
+ randomizer = rand();
+ return rand();
+
+}
+
+#ifndef WITH_POLL
+int
+#ifdef _WIN32
+ WINAPI
+#endif
+
+ mypoll(struct mypollfd *fds, unsigned int nfds, int timeout){
+ fd_set readfd;
+ fd_set writefd;
+ fd_set oobfd;
+ struct timeval tv;
+ unsigned i;
+ int num;
+ SOCKET maxfd = 0;
+
+ tv.tv_sec = timeout/1000;
+ tv.tv_usec = (timeout%1000)*1000;
+ FD_ZERO(&readfd);
+ FD_ZERO(&writefd);
+ FD_ZERO(&oobfd);
+ for(i=0; i maxfd) maxfd = fds[i].fd;
+ }
+ if((num = select(((int)(maxfd))+1, &readfd, &writefd, &oobfd, &tv)) < 1) return num;
+ for(i=0; ihostname){
+ if(param->hostname) myfree(param->hostname);
+ param->hostname = (unsigned char *)mystrdup(hostname);
+ }
+ if(sp){
+ port = atoi(sp+1);
+ *sp = ':';
+ }
+ param->req.sin_port=htons(port);
+ param->req.sin_addr.s_addr = getip(param->hostname);
+ param->sins.sin_addr.s_addr = 0;
+ param->sins.sin_port = 0;
+ return 0;
+}
+
+int parseusername(char *username, struct clientparam *param, int extpasswd){
+ char *sb = NULL, *se = NULL, *sp = NULL;
+
+ if(!username || !*username) return 1;
+ if(!param->srv->nouser && (sb = strchr(username, ':')) && (se = strchr(sb + 1, ':')) && (!extpasswd || (sp = strchr(se + 1, ':')))){
+ *sb = 0;
+ *se = 0;
+ if(sp) *sp = 0;
+ if(*(sb+1)) {
+ if(param->password) myfree(param->password);
+ param->password = (unsigned char *)mystrdup(sb+1);
+ }
+ if(*username) {
+ if(param->username) myfree(param->username);
+ param->username = (unsigned char *)mystrdup(username);
+ }
+ username = se+1;
+ }
+ if(extpasswd){
+ if(!sp) sp = strchr(username, ':');
+ if(sp){
+ *sp = 0;
+ if(param->extpassword) myfree(param->extpassword);
+ param->extpassword = (unsigned char *) mystrdup(sp+1);
+ }
+ }
+ if(param->extusername) myfree(param->extusername);
+ param->extusername = (unsigned char *)mystrdup(username);
+ if(sb) *sb = ':';
+ if(se) *se = ':';
+ if(sp) *sp = ':';
+ return 0;
+}
+
+int parseconnusername(char *username, struct clientparam *param, int extpasswd, unsigned short port){
+ char *sb, *se;
+ if(!username || !*username) return 1;
+ if ((sb=strchr(username, conf.delimchar)) == NULL){
+ if(!param->hostname && param->remsock == INVALID_SOCKET) return 2;
+ return parseusername(username, param, extpasswd);
+ }
+ while ((se=strchr(sb+1, conf.delimchar)))sb=se;
+ *(sb) = 0;
+ if(parseusername(username, param, extpasswd)) return 3;
+ *(sb) = conf.delimchar;
+ if(parsehostname(sb+1, param, port)) return 4;
+ return 0;
+}
+
+void clearstat(struct clientparam * param) {
+
+#ifdef _WIN32
+ struct timeb tb;
+
+ ftime(&tb);
+ param->time_start = (time_t)tb.time;
+ param->msec_start = (unsigned)tb.millitm;
+
+#else
+ struct timeval tv;
+ struct timezone tz;
+ gettimeofday(&tv, &tz);
+
+ param->time_start = (time_t)tv.tv_sec;
+ param->msec_start = (tv.tv_usec / 1000);
+#endif
+ param->statscli = param->statssrv = param->nreads = param->nwrites =
+ param->nconnects = 0;
+}
+
+
+char months[12][4] = {
+ "Jan", "Feb", "Mar", "Apr", "May", "Jun",
+ "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
+};
+
+
+int dobuf2(struct clientparam * param, unsigned char * buf, const unsigned char *s, const unsigned char * doublec, struct tm* tm, char * format){
+ int i, j;
+ int len;
+ time_t sec;
+ unsigned msec;
+
+ long timezone;
+ unsigned delay;
+ struct in_addr tmpia;
+
+
+
+#ifdef _WIN32
+ struct timeb tb;
+
+ ftime(&tb);
+ sec = (time_t)tb.time;
+ msec = (unsigned)tb.millitm;
+ timezone = tm->tm_isdst*60 - tb.timezone;
+
+#else
+ struct timeval tv;
+ struct timezone tz;
+ gettimeofday(&tv, &tz);
+
+ sec = (time_t)tv.tv_sec;
+ msec = tv.tv_usec / 1000;
+#ifdef _SOLARIS
+ timezone = -altzone / 60;
+#else
+ timezone = tm->tm_gmtoff / 60;
+#endif
+#endif
+
+ delay = param->time_start?((unsigned) ((sec - param->time_start))*1000 + msec) - param->msec_start : 0;
+ *buf = 0;
+ for(i=0, j=0; format[j] && i < 4040; j++){
+ if(format[j] == '%' && format[j+1]){
+ j++;
+ switch(format[j]){
+ case '%':
+ buf[i++] = '%';
+ break;
+ case 'y':
+ sprintf((char *)buf+i, "%.2d", tm->tm_year%100);
+ i+=2;
+ break;
+ case 'Y':
+ sprintf((char *)buf+i, "%.4d", tm->tm_year+1900);
+ i+=4;
+ break;
+ case 'm':
+ sprintf((char *)buf+i, "%.2d", tm->tm_mon+1);
+ i+=2;
+ break;
+ case 'o':
+ sprintf((char *)buf+i, "%s", months[tm->tm_mon]);
+ i+=3;
+ break;
+ case 'd':
+ sprintf((char *)buf+i, "%.2d", tm->tm_mday);
+ i+=2;
+ break;
+ case 'H':
+ sprintf((char *)buf+i, "%.2d", tm->tm_hour);
+ i+=2;
+ break;
+ case 'M':
+ sprintf((char *)buf+i, "%.2d", tm->tm_min);
+ i+=2;
+ break;
+ case 'S':
+ sprintf((char *)buf+i, "%.2d", tm->tm_sec);
+ i+=2;
+ break;
+ case 't':
+ sprintf((char *)buf+i, "%.10u", (unsigned)sec);
+ i+=10;
+ break;
+ case 'b':
+ i+=sprintf((char *)buf+i, "%u", delay?(unsigned)(param->statscli * 1000./delay):0);
+ break;
+ case 'B':
+ i+=sprintf((char *)buf+i, "%u", delay?(unsigned)(param->statssrv * 1000./delay):0);
+ break;
+ case 'D':
+ i+=sprintf((char *)buf+i, "%u", delay);
+ break;
+ case '.':
+ sprintf((char *)buf+i, "%.3u", msec);
+ i+=3;
+ break;
+ case 'z':
+ sprintf((char *)buf+i, "%+.2ld%.2u", timezone / 60, (unsigned)(timezone%60));
+ i+=5;
+ break;
+ case 'U':
+ if(param->username && *param->username){
+ for(len = 0; i< 4000 && param->username[len]; len++){
+ buf[i] = param->username[len];
+ if(param->srv->nonprintable && (buf[i] < 0x20 || strchr((char *)param->srv->nonprintable, buf[i]))) buf[i] = param->srv->replace;
+ if(doublec && strchr((char *)doublec, buf[i])) {
+ buf[i+1] = buf[i];
+ i++;
+ }
+ i++;
+ }
+ }
+ else {
+ buf[i++] = '-';
+ }
+ break;
+ case 'n':
+ len = param->hostname? (int)strlen((char *)param->hostname) : 0;
+ if (len > 0) for(len = 0; param->hostname[len] && i < 4000; len++, i++){
+ buf[i] = param->hostname[len];
+ if(param->srv->nonprintable && (buf[i] < 0x20 || strchr((char *)param->srv->nonprintable, buf[i]))) buf[i] = param->srv->replace;
+ if(doublec && strchr((char *)doublec, buf[i])) {
+ buf[i+1] = buf[i];
+ i++;
+ }
+ }
+ else i += myinet_ntoa(param->sins.sin_addr, (char *)buf + i);
+ break;
+
+ case 'N':
+ if(param->service >=0 && param->service < 15) {
+ len = (conf.stringtable)? (int)strlen((char *)conf.stringtable[SERVICES + param->service]) : 0;
+ if(len > 20) len = 20;
+ memcpy(buf+i, (len)?conf.stringtable[SERVICES + param->service]:(unsigned char*)"-", (len)?len:1);
+ i += (len)?len:1;
+ }
+ break;
+ case 'E':
+ sprintf((char *)buf+i, "%.05d", param->res);
+ i += 5;
+ break;
+ case 'T':
+ if(s){
+ for(len = 0; i<4000 && s[len]; len++){
+ buf[i] = s[len];
+ if(param->srv->nonprintable && (buf[i] < 0x20 || strchr((char *)param->srv->nonprintable, buf[i]))) buf[i] = param->srv->replace;
+ if(doublec && strchr((char *)doublec, buf[i])) {
+ buf[i+1] = buf[i];
+ i++;
+ }
+ i++;
+ }
+ }
+ break;
+ case 'e':
+ tmpia.s_addr = param->extip;
+ i += myinet_ntoa(tmpia, (char *)buf + i);
+ break;
+ case 'C':
+ i += myinet_ntoa(param->sinc.sin_addr, (char *)buf + i);
+ break;
+ case 'R':
+ i += myinet_ntoa(param->sins.sin_addr, (char *)buf + i);
+ break;
+ case 'Q':
+ i += myinet_ntoa(param->req.sin_addr, (char *)buf + i);
+ break;
+ case 'p':
+ sprintf((char *)buf+i, "%hu", ntohs(param->srv->intport));
+ i += (int)strlen((char *)buf+i);
+ break;
+ case 'c':
+ sprintf((char *)buf+i, "%hu", ntohs(param->sinc.sin_port));
+ i += (int)strlen((char *)buf+i);
+ break;
+ case 'r':
+ sprintf((char *)buf+i, "%hu", ntohs(param->sins.sin_port));
+ i += (int)strlen((char *)buf+i);
+ break;
+ case 'q':
+ sprintf((char *)buf+i, "%hu", ntohs(param->req.sin_port));
+ i += (int)strlen((char *)buf+i);
+ break;
+ case 'I':
+ sprintf((char *)buf+i, "%lu", param->statssrv);
+ i += (int)strlen((char *)buf+i);
+ break;
+ case 'O':
+ sprintf((char *)buf+i, "%lu", param->statscli);
+ i += (int)strlen((char *)buf+i);
+ break;
+ case 'h':
+ sprintf((char *)buf+i, "%d", param->redirected);
+ i += (int)strlen((char *)buf+i);
+ break;
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ {
+ int k, pmin=0, pmax=0;
+ for (k = j; isnumber(format[k]); k++);
+ if(format[k] == '-' && isnumber(format[k+1])){
+ pmin = atoi(format + j) - 1;
+ k++;
+ pmax = atoi(format + k) -1;
+ for (; isnumber(format[k]); k++);
+ j = k;
+ }
+ if(!s || format[k]!='T') break;
+ for(k = 0, len = 0; s[len] && i < 4000; len++){
+ if(isspace(s[len])){
+ k++;
+ while(isspace(s[len+1]))len++;
+ if(k == pmin) continue;
+ }
+ if(k>=pmin && k<=pmax) {
+ buf[i] = s[len];
+ if(param->srv->nonprintable && (buf[i] < 0x20 || strchr((char *)param->srv->nonprintable, buf[i]))) buf[i] = param->srv->replace;
+ if(doublec && strchr((char *)doublec, buf[i])) {
+ buf[i+1] = buf[i];
+ i++;
+ }
+ i++;
+ }
+ }
+ break;
+
+ }
+ default:
+ buf[i++] = format[j];
+ }
+ }
+ else buf[i++] = format[j];
+ }
+ buf[i] = 0;
+ return i;
+}
+
+int dobuf(struct clientparam * param, unsigned char * buf, const unsigned char *s, const unsigned char * doublec){
+ struct tm* tm;
+ int i;
+ char * format;
+ time_t t;
+
+ time(&t);
+ if(!param) return 0;
+ if(param->trafcountfunc)(*param->trafcountfunc)(param);
+ format = (char *)param->srv->logformat;
+ if(!format) format = "G%y%m%d%H%M%S.%. %p %E %U %C:%c %R:%r %O %I %h %T";
+ tm = (*format == 'G' || *format == 'g')?
+ gmtime(&t) : localtime(&t);
+ i = dobuf2(param, buf, s, doublec, tm, format + 1);
+ clearstat(param);
+ return i;
+}
+
+void lognone(struct clientparam * param, const unsigned char *s) {
+ if(param->trafcountfunc)(*param->trafcountfunc)(param);
+ clearstat(param);
+}
+
+
+void logstdout(struct clientparam * param, const unsigned char *s) {
+ unsigned char buf[4096];
+ FILE *log;
+
+ log = param->srv->stdlog?param->srv->stdlog:conf.stdlog?conf.stdlog:stdout;
+ dobuf(param, buf, s, NULL);
+ if(!param->nolog)if(fprintf(log, "%s\n", buf) < 0) {
+ perror("printf()");
+ };
+ if(log != conf.stdlog)fflush(log);
+}
+#ifndef _WIN32
+void logsyslog(struct clientparam * param, const unsigned char *s) {
+ unsigned char buf[4096];
+
+ dobuf(param, buf, s, NULL);
+ if(!param->nolog)syslog(LOG_INFO, "%s", buf);
+}
+#endif
+
+int doconnect(struct clientparam * param){
+ SASIZETYPE size = sizeof(param->sins);
+ struct sockaddr_in bindsa;
+ if (param->operation == ADMIN || param->operation == DNSRESOLVE || param->operation == BIND || param->operation == UDPASSOC)
+ return 0;
+ if (param->remsock != INVALID_SOCKET){
+ if(so._getpeername(param->remsock, (struct sockaddr *)¶m->sins, &size)==-1) {return (15);}
+ }
+ else {
+ struct linger lg;
+
+ if(!param->sins.sin_addr.s_addr)
+ if(!(param->sins.sin_addr.s_addr = param->req.sin_addr.s_addr)) return 100;
+ if(!param->sins.sin_port)param->sins.sin_port = param->req.sin_port;
+ if ((param->remsock=so._socket(AF_INET, SOCK_STREAM, IPPROTO_TCP)) == INVALID_SOCKET) {return (11);}
+ so._setsockopt(param->remsock, SOL_SOCKET, SO_LINGER, (unsigned char *)&lg, sizeof(lg));
+ memset(&bindsa, 0, sizeof(bindsa));
+ bindsa.sin_family = AF_INET;
+ bindsa.sin_port = param->extport;
+ bindsa.sin_addr.s_addr = param->extip;
+ if (param->srv->targetport && !bindsa.sin_port && ntohs(param->sinc.sin_port) > 1023) bindsa.sin_port = param->sinc.sin_port;
+ if(so._bind(param->remsock, (struct sockaddr*)&bindsa, sizeof(bindsa))==-1) {
+ memset(&bindsa, 0, sizeof(bindsa));
+ bindsa.sin_family = AF_INET;
+ bindsa.sin_addr.s_addr = param->extip;
+ bindsa.sin_port = 0;
+ if(so._bind(param->remsock, (struct sockaddr*)&bindsa, sizeof(bindsa))==-1) {
+ return 12;
+ }
+ }
+
+ param->sins.sin_family = AF_INET;
+ if(param->operation >= 256 || (param->operation & CONNECT)){
+#ifdef _WIN32
+ unsigned long ul = 1;
+#endif
+ if(so._connect(param->remsock,(struct sockaddr *)¶m->sins,sizeof(param->sins))) {return (13);}
+ param->nconnects++;
+#ifdef _WIN32
+ ioctlsocket(param->remsock, FIONBIO, &ul);
+#else
+ fcntl(param->remsock,F_SETFL,O_NONBLOCK);
+#endif
+ if(so._getsockname(param->remsock, (struct sockaddr *)&bindsa, &size)==-1) {return (15);}
+ param->extip = bindsa.sin_addr.s_addr;
+ }
+ else {
+ if(so._getsockname(param->remsock, (struct sockaddr *)¶m->sins, &size)==-1) {return (15);}
+ }
+ }
+ return 0;
+}
+
+int scanaddr(const unsigned char *s, unsigned long * ip, unsigned long * mask) {
+ unsigned d1, d2, d3, d4, m;
+ int res;
+ if ((res = sscanf((char *)s, "%u.%u.%u.%u/%u", &d1, &d2, &d3, &d4, &m)) < 4) return 0;
+ if(mask && res == 4) *mask = 0xFFFFFFFF;
+ else if (mask) *mask = htonl(0xFFFFFFFF << (32 - m));
+ *ip = htonl ((d1<<24) ^ (d2<<16) ^ (d3<<8) ^ d4);
+ return res;
+}
+
+RESOLVFUNC resolvfunc = NULL;
+#ifndef _WIN32
+pthread_mutex_t gethostbyname_mutex;
+int ghbn_init = 0;
+#endif
+
+
+#ifdef GETHOSTBYNAME_R
+struct hostent * my_gethostbyname(char *name, char *buf, struct hostent *hp){
+ struct hostent *result;
+ int gherrno;
+
+#ifdef _SOLARIS
+ return gethostbyname_r(name, hp, buf, 1024, &gherrno);
+#else
+ if(gethostbyname_r(name, hp, buf, 1024, &result, &gherrno) != 0)
+ return NULL;
+ return result;
+#endif
+}
+#endif
+
+unsigned long getip(unsigned char *name){
+ unsigned long retval;
+ int i;
+ int ndots = 0;
+ struct hostent *hp=NULL;
+
+#ifdef GETHOSTBYNAME_R
+ struct hostent he;
+ char ghbuf[1024];
+#define gethostbyname(NAME) my_gethostbyname(NAME, ghbuf, &he)
+#endif
+
+ if(strlen((char *)name)>255)name[255] = 0;
+ for(i=0; name[i]; i++){
+ if(name[i] == '.'){
+ if(++ndots > 3) break;
+ continue;
+ }
+ if(name[i] <'0' || name[i] >'9') break;
+ }
+ if(!name[i] && ndots == 3){
+ unsigned long ip;
+ if(scanaddr(name, &ip, NULL) == 4){
+ return ip;
+ }
+ }
+ if(resolvfunc){
+ if((retval = (*resolvfunc)(name))) return retval;
+ if(conf.demanddialprog) system(conf.demanddialprog);
+ return (*resolvfunc)(name);
+ }
+#if !defined(_WIN32) && !defined(GETHOSTBYNAME_R)
+ if(!ghbn_init){
+ pthread_mutex_init(&gethostbyname_mutex, NULL);
+ ghbn_init++;
+ }
+ pthread_mutex_lock(&gethostbyname_mutex);
+#endif
+ hp=gethostbyname((char *)name);
+ if (!hp && conf.demanddialprog) {
+ system(conf.demanddialprog);
+ hp=gethostbyname((char *)name);
+ }
+ retval = hp?*(unsigned long *)hp->h_addr:0;
+#if !defined(_WIN32) && !defined(GETHOSTBYNAME_R)
+ pthread_mutex_unlock(&gethostbyname_mutex);
+#endif
+#ifdef GETHOSTBYNAME_R
+#undef gethostbyname
+#endif
+ return retval;
+}
diff --git a/src/countersutil.c b/src/countersutil.c
new file mode 100644
index 0000000..2d38f39
--- /dev/null
+++ b/src/countersutil.c
@@ -0,0 +1,145 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: common.c,v 1.81 2007/12/18 09:26:44 vlad Exp $
+*/
+
+#include "proxy.h"
+
+struct counter_header {
+ unsigned char sig[4];
+ time_t updated;
+} cheader = {"3CF", (time_t)0};
+
+
+struct counter_record {
+ unsigned long traf;
+ unsigned long trafgb;
+ time_t cleared;
+ time_t updated;
+} crecord;
+
+#ifdef _WIN32
+struct counter_header_old {
+ unsigned char sig[4];
+ DWORD updated;
+} cheader_old = {"3CF", (time_t)0};
+
+
+struct counter_record_old {
+ unsigned long traf;
+ unsigned long trafgb;
+ DWORD cleared;
+ DWORD updated;
+} crecord_old;
+#endif
+
+int main(int argc, char *argv[]){
+ FILE *txt;
+ int bin;
+ int i;
+ long unsigned lu1, lu2;
+ char buf[256];
+ if(argc!=4){
+ fprintf(stderr, "Usage: %s command binary_file text_file\n"
+ " commands are:\n"
+ "\texport - dump counterfile to text\n"
+#ifdef _WIN32
+ "\toldexport - export counterfile from older 3proxy version\n"
+#endif
+ "\timport- import counterfile from text\n"
+ "Examples:\n"
+#ifdef _WIN32
+ " %s oldexport counterfile.3cf tmpfile\n"
+#else
+ " %s export counterfilenew.3cf tmpfile\n"
+#endif
+ " %s import counterfilenew.3cf tmpfile\n"
+ "text file record format:\n"
+ "%%d %%10lu %%10lu %%lu %%lu\n"
+ " 1 - counter number\n"
+ " 2 - traffic (Bytes)\n"
+ " 3 - traffic (GB)\n"
+ " 4 - time counter reset (time_t)\n"
+ " 5 - time counter updated (time_t)\n"
+ ,argv[0] , argv[0], argv[0]);
+ return 1;
+ }
+ if(!strcmp(argv[1], "export")){
+ bin = open((char *)argv[2], O_BINARY|O_RDONLY, 0660);
+ if(bin < 0){
+ fprintf(stderr, "Failed to open %s\n", argv[2]);
+ return 2;
+ }
+ if(read(bin, &cheader, sizeof(cheader)) != sizeof(cheader) ||
+ memcmp(&cheader, "3CF", 4)){
+ fprintf(stderr, "Invalid counter file\n");
+ return 3;
+ }
+ txt = fopen(argv[3], "w");
+ if(!txt) txt = stdout;
+ for(i=1; read(bin, &crecord, sizeof(crecord))==sizeof(crecord); i++)
+ fprintf(txt,"%d %10lu %10lu %lu %lu\n", i,
+ crecord.trafgb,
+ crecord.traf,
+ (unsigned long) crecord.cleared,
+ (unsigned long) crecord.updated);
+ }
+#ifdef _WIN32
+ else if(!strcmp(argv[1], "oldexport")){
+ bin = open((char *)argv[2], O_BINARY|O_RDONLY, 0660);
+ if(bin < 0){
+ fprintf(stderr, "Failed to open %s\n", argv[2]);
+ return 2;
+ }
+ if(read(bin, &cheader_old, sizeof(cheader_old)) != sizeof(cheader_old) ||
+ memcmp(&cheader, "3CF", 4)){
+ fprintf(stderr, "Invalid counter file\n");
+ return 3;
+ }
+ txt = fopen(argv[3], "w");
+ if(!txt) txt = stdout;
+ for(i=1; read(bin, &crecord_old, sizeof(crecord_old))==sizeof(crecord_old); i++)
+ fprintf(txt, "%d %10lu %10lu %lu %lu\n", i,
+ crecord_old.trafgb,
+ crecord_old.traf,
+ (unsigned long) crecord_old.cleared,
+ (unsigned long) crecord_old.updated);
+ }
+#endif
+ else if(!strcmp(argv[1], "import")){
+ bin = open((char *)argv[2], O_BINARY|O_WRONLY|O_CREAT|O_EXCL, 0660);
+ if(bin < 0){
+ fprintf(stderr, "Failed to open %s\n", argv[2]);
+ return 2;
+ }
+ txt = fopen(argv[3], "r");
+ if(!txt) {
+ fprintf(stderr, "Failed to open %s\n", argv[3]);
+ return 3;
+ }
+ cheader.updated = time(0);
+ write(bin, &cheader, sizeof(cheader));
+ while(fgets(buf, 256, txt) &&
+ sscanf(buf, "%d %10lu %10lu %lu %lu\n",
+ &i, &crecord.trafgb, &crecord.traf,
+ &lu1, &lu2) == 5){
+
+ crecord.cleared = (time_t) lu1;
+ crecord.updated = (time_t) lu1;
+ lseek(bin,
+ sizeof(struct counter_header) + (i-1) * sizeof(crecord),
+ SEEK_SET);
+ write(bin, &crecord, sizeof(crecord));
+
+ }
+ }
+ else {
+ fprintf(stderr, "Unknown command: %s\n", argv[1]);
+ return 5;
+ }
+ return 0;
+}
diff --git a/src/datatypes.c b/src/datatypes.c
new file mode 100644
index 0000000..24d5420
--- /dev/null
+++ b/src/datatypes.c
@@ -0,0 +1,834 @@
+/*
+ * Copyright (c) 2000-2008 3APA3A
+ *
+ * please read License Agreement
+ *
+ * $Id: datatypes.c,v 1.28 2009/08/14 09:56:21 v.dubrovin Exp $
+ */
+
+#include "proxy.h"
+
+static void pr_integer(struct node *node, CBFUNC cbf, void*cb){
+ char buf[16];
+ if(node->value)(*cbf)(cb, buf, sprintf(buf, "%d", *(int *)node->value));
+}
+
+static void pr_short(struct node *node, CBFUNC cbf, void*cb){
+ char buf[8];
+ if(node->value)(*cbf)(cb, buf, sprintf(buf, "%hu", *(unsigned short*)node->value));
+}
+
+static void pr_char(struct node *node, CBFUNC cbf, void*cb){
+ if(node->value)(*cbf)(cb, (char *)node->value, 1);
+}
+
+
+static void pr_unsigned(struct node *node, CBFUNC cbf, void*cb){
+ char buf[16];
+ if(node->value)(*cbf)(cb, buf, sprintf(buf, "%u", *(unsigned *)node->value));
+}
+
+static void pr_traffic(struct node *node, CBFUNC cbf, void*cb){
+ char buf[16];
+ unsigned long u1, u2;
+ if(node->value){
+ u1 = ((unsigned long *)node->value)[0];
+ u2 = ((unsigned long *)node->value)[0];
+ (*cbf)(cb, buf, sprintf(buf, "%lu", (u1>>20) + (u2<<10)));
+ }
+}
+
+static void pr_port(struct node *node, CBFUNC cbf, void*cb){
+ char buf[8];
+ if(node->value)(*cbf)(cb, buf, sprintf(buf, "%hu", ntohs(*(unsigned short*)node->value)));
+}
+
+static void pr_datetime(struct node *node, CBFUNC cbf, void*cb){
+ char *s;
+ if(node->value){
+ s = ctime((time_t *)node->value);
+
+ (*cbf)(cb, s, (int)strlen(s)-1);
+ }
+}
+
+int ipprint(char *buf, unsigned uu){
+ unsigned u = ntohl(uu);
+
+ return sprintf(buf, "%u.%u.%u.%u",
+ ((u&0xFF000000)>>24),
+ ((u&0x00FF0000)>>16),
+ ((u&0x0000FF00)>>8),
+ ((u&0x000000FF)));
+}
+
+static void pr_ip(struct node *node, CBFUNC cbf, void*cb){
+ char buf[16];
+ if(node->value)(*cbf)(cb, buf, ipprint(buf, *(unsigned *)node -> value));
+}
+
+static void pr_wdays(struct node *node, CBFUNC cbf, void*cb){
+ char buf[16];
+ int i, found = 0;
+ if(node -> value)for(i = 0; i<8; i++){
+ if( (1< value ) {
+ sprintf(buf, "%s%d", found?",":"", i);
+ (*cbf)(cb, buf, found? 2:1);
+ found = 1;
+ }
+ }
+}
+
+static void pr_time(struct node *node, CBFUNC cbf, void*cb){
+ char buf[16];
+ int t = *(int *)node;
+
+ (*cbf)(cb, buf, sprintf(buf, "%02d:%02d:%02d", (t/3600)%24, (t/60)%60, t%60));
+}
+
+int cidrprint(char *buf, unsigned long u){
+ unsigned long u1 = 0xffffffff;
+ int i;
+
+ u = ntohl(u);
+ for(i = 32; i && (u1!=u); i--){
+ u1 = (u1 << 1);
+ }
+ if (i == 32) {
+ return 0;
+ }
+ return sprintf(buf, "/%d", i);
+}
+
+static void pr_cidr(struct node *node, CBFUNC cbf, void*cb){
+ char buf[4];
+ int i;
+
+ if(node->value){
+ if ((i = cidrprint(buf, *(unsigned *)node -> value)))
+ (*cbf)(cb, buf, i);
+ else (*cbf)(cb, "/32", 3);
+ }
+}
+
+static void pr_string(struct node *node, CBFUNC cbf, void*cb){
+ if(node->value){
+ (*cbf)(cb, (char*)node->value, (int)strlen((char*)node->value));
+ }
+ else (*cbf)(cb, "(NULL)", 6);
+}
+
+static void pr_rotation(struct node *node, CBFUNC cbf, void*cb){
+ char * lstrings[] = {
+ "N", "C", "H", "D", "W", "M", "Y", "N"
+ };
+ int i;
+
+ if(node->value && (i = *(int*)node->value) > 1 && i < 6){
+ (*cbf)(cb, lstrings[i], 1);
+ }
+}
+
+static void pr_operations(struct node *node, CBFUNC cbf, void*cb){
+ char buf[64];
+ int operation;
+ int delim = 0;
+
+ *buf = 0;
+ if(!node->value || !(operation = *(int*)node->value)){
+ (*cbf)(cb, "*", 1);
+ return;
+ }
+ if(operation & HTTP){
+ if((operation & HTTP) == HTTP)
+ (*cbf)(cb, buf, sprintf(buf, "HTTP"));
+ else
+ (*cbf)(cb, buf, sprintf(buf, "%s%s%s%s%s%s%s%s%s",
+ (operation & HTTP_GET)? "HTTP_GET" : "",
+ ((operation & HTTP_GET) && (operation & (HTTP_PUT|HTTP_POST|HTTP_HEAD|HTTP_OTHER)))? "," : "",
+ (operation & HTTP_PUT)? "HTTP_PUT" : "",
+ ((operation & HTTP_PUT) && (operation & (HTTP_POST|HTTP_HEAD|HTTP_OTHER)))? "," : "",
+ (operation & HTTP_POST)? "HTTP_POST" : "",
+ ((operation & HTTP_POST) && (operation & (HTTP_HEAD|HTTP_OTHER)))? "," : "",
+ (operation & HTTP_HEAD)? "HTTP_HEAD" : "",
+ ((operation & HTTP_HEAD) && (operation & HTTP_OTHER))? "," : "",
+ (operation & HTTP_OTHER)? "HTTP_OTHER" : ""));
+ delim = 1;
+ }
+ if(operation & HTTP_CONNECT){
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "HTTP_CONNECT"));
+ delim = 1;
+ }
+ if(operation & FTP) {
+ if((operation & FTP) == FTP)
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "FTP"));
+ else
+ (*cbf)(cb, buf, sprintf(buf, "%s%s%s%s%s%s",
+ delim? ",":"",
+ (operation & FTP_GET)? "FTP_GET" : "",
+ ((operation & FTP_GET) && (operation & (FTP_PUT|FTP_LIST)))? ",":"",
+ (operation & FTP_PUT)? "FTP_PUT" : "",
+ ((operation & FTP_PUT) && (operation & FTP_LIST))? ",":"",
+ (operation & FTP_LIST)? "FTP_LIST" : ""));
+ delim = 1;
+ }
+ if(operation & CONNECT){
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "CONNECT"));
+ delim = 1;
+ }
+ if(operation & BIND){
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "BIND"));
+ delim = 1;
+ }
+ if(operation & UDPASSOC){
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "UDPASSOC"));
+ delim = 1;
+ }
+ if(operation & ICMPASSOC){
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "ICMPASSOC"));
+ delim = 1;
+ }
+ if(operation & DNSRESOLVE){
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "DNSRESOLVE"));
+ delim = 1;
+ }
+ if(operation & ADMIN){
+ (*cbf)(cb, buf, sprintf(buf, "%s%s", delim?",":"", "ADMIN"));
+ }
+}
+
+static void pr_portlist(struct node *node, CBFUNC cbf, void*cb){
+ struct portlist *pl= (struct portlist *)node->value;
+ char buf[16];
+ if(!pl) {
+ (*cbf)(cb, "*", 1);
+ return;
+ }
+ for(; pl; pl = pl->next) {
+ if(pl->startport == pl->endport)
+ (*cbf)(cb, buf, sprintf(buf, "%hu", pl->startport));
+ else
+ (*cbf)(cb, buf, sprintf(buf, "%hu-%hu", pl->startport, pl->endport));
+ if(pl->next)(*cbf)(cb, ",", 1);
+ }
+}
+
+static void pr_userlist(struct node *node, CBFUNC cbf, void*cb){
+ struct userlist *ul= (struct userlist *)node->value;
+ if(!ul) {
+ (*cbf)(cb, "*", 1);
+ return;
+ }
+ for(; ul; ul = ul->next){
+ (*cbf)(cb, (char *)ul->user, (int)strlen((char *)ul->user));
+ if(ul->next)(*cbf)(cb, ",", 1);
+ }
+}
+
+static void pr_iplist(struct node *node, CBFUNC cbf, void*cb){
+ char buf[20];
+ int i;
+ struct iplist *il = (struct iplist *)node->value;
+
+ if(!il) {
+ (*cbf)(cb, "*", 1);
+ return;
+ }
+ for(; il; il = il->next){
+ i = ipprint(buf, il->ip);
+ i += cidrprint(buf+i, il->mask);
+ if(il->next)buf[i++] = ',';
+ (*cbf)(cb, buf, i);
+ }
+}
+
+static void * ef_portlist_next(struct node *node){
+ return (((struct portlist *)node->value) -> next);
+}
+
+
+static void * ef_portlist_start(struct node *node){
+ return &(((struct portlist *)node->value) -> startport);
+}
+
+static void * ef_portlist_end(struct node *node){
+ return &(((struct portlist *)node->value) -> endport);
+}
+
+static void * ef_iplist_next(struct node *node){
+ return (((struct iplist *)node->value) -> next);
+}
+
+static void * ef_iplist_ip(struct node *node){
+ return &(((struct iplist *)node->value) -> ip);
+}
+
+static void * ef_iplist_cidr(struct node *node){
+ return &(((struct iplist *)node->value) -> mask);
+}
+
+static void * ef_iplist_mask(struct node *node){
+ return &(((struct iplist *)node->value) -> mask);
+}
+
+static void * ef_userlist_next(struct node * node){
+ return (((struct userlist *)node->value) -> next);
+}
+
+static void * ef_userlist_user(struct node * node){
+ return (((struct userlist *)node->value) -> user);
+}
+
+static void * ef_pwlist_next(struct node * node){
+ return (((struct passwords *)node->value) -> next);
+}
+
+static void * ef_pwlist_user(struct node * node){
+ return (((struct passwords *)node->value) -> user);
+}
+
+static void * ef_pwlist_password(struct node * node){
+ return (((struct passwords *)node->value) -> password);
+}
+
+static void * ef_pwlist_type(struct node * node){
+ switch (((struct passwords *)node->value) -> pwtype) {
+ case SYS:
+ return "SYS";
+ case CL:
+ return "CL";
+ case CR:
+ return "CR";
+ case NT:
+ return "NT";
+ case LM:
+ return "LM";
+ default:
+ return "UNKNOWN";
+ }
+}
+
+static void * ef_chain_next(struct node * node){
+ return ((struct chain *)node->value) -> next;
+}
+
+static void * ef_chain_type(struct node * node){
+ switch (((struct chain *)node->value) -> type) {
+ case R_TCP:
+ return "tcp";
+ case R_CONNECT:
+ return "connect";
+ case R_SOCKS4:
+ return "socks4";
+ case R_SOCKS5:
+ return "socks5";
+ case R_HTTP:
+ return "http";
+ case R_FTP:
+ return "ftp";
+ case R_POP3:
+ return "pop3";
+ default:
+ return "";
+ }
+}
+
+static void * ef_chain_ip(struct node * node){
+ return &((struct chain *)node->value) -> redirip;
+}
+
+static void * ef_chain_port(struct node * node){
+ return &((struct chain *)node->value) -> redirport;
+}
+
+static void * ef_chain_weight(struct node * node){
+ return &((struct chain *)node->value) -> weight;
+}
+
+static void * ef_chain_user(struct node * node){
+ return ((struct chain *)node->value) -> extuser;
+}
+
+static void * ef_chain_password(struct node * node){
+ return ((struct chain *)node->value) -> extpass;
+}
+
+static void * ef_ace_next(struct node * node){
+ return ((struct ace *)node->value) -> next;
+}
+
+static void * ef_ace_type(struct node * node){
+ switch (((struct ace *)node->value) -> action) {
+ case ALLOW:
+ case REDIRECT:
+ return "allow";
+ case DENY:
+ return "deny";
+ case BANDLIM:
+ return "bandlim";
+ case NOBANDLIM:
+ return "nobandlim";
+ case COUNTIN:
+ return "countin";
+ case NOCOUNTIN:
+ return "nocountin";
+ case COUNTOUT:
+ return "countout";
+ case NOCOUNTOUT:
+ return "nocountout";
+ default:
+ return "unknown";
+ }
+}
+
+
+static void * ef_ace_operations(struct node * node){
+ if(!((struct ace *)node->value) -> operation) return NULL;
+ return &((struct ace *)node->value) -> operation;
+}
+
+static void * ef_ace_users(struct node * node){
+ return ((struct ace *)node->value) -> users;
+}
+
+static void * ef_ace_src(struct node * node){
+ return ((struct ace *)node->value) -> src;
+}
+
+
+static void * ef_ace_dst(struct node * node){
+ return ((struct ace *)node->value) -> dst;
+}
+
+
+static void * ef_ace_ports(struct node * node){
+ return ((struct ace *)node->value) -> ports;
+}
+
+static void * ef_ace_chain(struct node * node){
+ return ((struct ace *)node->value) -> chains;
+}
+
+static void * ef_ace_weekdays(struct node * node){
+ return (((struct ace *)node->value) -> wdays) ? &((struct ace *)node->value) -> wdays : NULL;
+}
+
+static void * ef_ace_period(struct node * node){
+ return ((struct ace *)node->value) -> periods;
+}
+
+
+static void * ef_bandlimit_next(struct node * node){
+ return ((struct bandlim *)node->value) -> next;
+}
+
+static void * ef_bandlimit_ace(struct node * node){
+ return ((struct bandlim *)node->value) -> ace;
+}
+
+static void * ef_bandlimit_rate(struct node * node){
+ return &((struct bandlim *)node->value) -> rate;
+}
+
+static void * ef_trafcounter_next(struct node * node){
+ return ((struct trafcount *)node->value) -> next;
+}
+
+static void * ef_trafcounter_ace(struct node * node){
+ return ((struct trafcount *)node->value) -> ace;
+}
+
+static void * ef_trafcounter_number(struct node * node){
+ return &((struct trafcount *)node->value) -> number;
+}
+
+static void * ef_trafcounter_type(struct node * node){
+ return &((struct trafcount *)node->value) -> type;
+}
+
+static void * ef_trafcounter_traffic(struct node * node){
+ return &((struct trafcount *)node->value) -> traf;
+}
+
+static void * ef_trafcounter_limit(struct node * node){
+ return &((struct trafcount *)node->value) -> traflim;
+}
+
+static void * ef_trafcounter_cleared(struct node * node){
+ return &((struct trafcount *)node->value) -> cleared;
+}
+
+static void * ef_trafcounter_updated(struct node * node){
+ return &((struct trafcount *)node->value) -> updated;
+}
+
+static void * ef_trafcounter_comment(struct node * node){
+ return ((struct trafcount *)node->value) -> comment;
+}
+
+static void * ef_trafcounter_disabled(struct node * node){
+ return &((struct trafcount *)node->value) -> disabled;
+}
+
+static void * ef_server_next(struct node * node){
+ return ((struct srvparam *)node->value) -> next;
+}
+
+static void * ef_server_type(struct node * node){
+ int service = ((struct srvparam *)node->value) -> service;
+ return (service>=0 && service < 15)? (void *)conf.stringtable[SERVICES + service] : (void *)"unknown";
+}
+
+static void * ef_server_child(struct node * node){
+ return ((struct srvparam *)node->value) -> child;
+}
+
+static void * ef_server_auth(struct node * node){
+ AUTHFUNC af = ((struct srvparam *)node->value) -> authfunc;
+
+ if(af == alwaysauth) return "none";
+ if(af == nbnameauth) return "nbname";
+ if(af == ipauth) return "iponly";
+ if(af == strongauth) return "strong";
+ return "uknown";
+}
+
+static void * ef_server_childcount(struct node * node){
+ return &((struct srvparam *)node->value) -> childcount;
+}
+
+static void * ef_server_log(struct node * node){
+ if(((struct srvparam *)node->value) -> logfunc == lognone) return "none";
+ else if(((struct srvparam *)node->value) -> logfunc == logstdout)
+ return (((struct srvparam *)node->value) -> logtarget)?"file":"stdout";
+#ifndef _WIN32
+ else if(((struct srvparam *)node->value) -> logfunc == logsyslog) return "syslog";
+#endif
+#ifndef NOODBC
+ else if(((struct srvparam *)node->value) -> logfunc == logsql) return "odbc";
+#endif
+ return NULL;
+}
+
+static void * ef_server_logformat(struct node * node){
+ return ((struct srvparam *)node->value) -> logformat;
+}
+
+static void * ef_server_nonprintable(struct node * node){
+ return ((struct srvparam *)node->value) -> nonprintable;
+}
+
+static void * ef_server_replacement(struct node * node){
+ if(((struct srvparam *)node->value) -> nonprintable)return &((struct srvparam *)node->value) -> replace;
+ return NULL;
+}
+
+static void * ef_server_logtarget(struct node * node){
+ return ((struct srvparam *)node->value) -> logtarget;
+}
+
+
+static void * ef_server_target(struct node * node){
+ return ((struct srvparam *)node->value) -> target;
+}
+
+static void * ef_server_targetport(struct node * node){
+ return &((struct srvparam *)node->value) -> targetport;
+}
+
+static void * ef_server_intip(struct node * node){
+ return &((struct srvparam *)node->value) -> intip;
+}
+
+static void * ef_server_extip(struct node * node){
+ return &((struct srvparam *)node->value) -> extip;
+}
+
+static void * ef_server_intport(struct node * node){
+ return &((struct srvparam *)node->value) -> intport;
+}
+
+static void * ef_server_extport(struct node * node){
+ return &((struct srvparam *)node->value) -> extport;
+}
+
+static void * ef_server_acl(struct node * node){
+ return ((struct srvparam *)node->value) -> acl;
+}
+
+static void * ef_server_singlepacket(struct node * node){
+ return &((struct srvparam *)node->value) -> singlepacket;
+}
+
+static void * ef_server_usentlm(struct node * node){
+ return &((struct srvparam *)node->value) -> usentlm;
+}
+
+static void * ef_server_starttime(struct node * node){
+ return &((struct srvparam *)node->value) -> time_start;
+}
+
+
+static void * ef_client_next(struct node * node){
+ return ((struct clientparam *)node->value) -> next;
+}
+
+static void * ef_client_maxtrafin(struct node * node){
+ return &((struct clientparam *)node->value) -> maxtrafin;
+}
+
+static void * ef_client_maxtrafout(struct node * node){
+ return &((struct clientparam *)node->value) -> maxtrafout;
+}
+
+static void * ef_client_type(struct node * node){
+ int service = ((struct clientparam *)node->value) -> service;
+ return (service>=0 && service < 15)? (void *)conf.stringtable[SERVICES + service] : (void *)"unknown";
+}
+
+static void * ef_client_operation(struct node * node){
+ if(!((struct clientparam *)node->value) -> operation) return NULL;
+ return &((struct clientparam *)node->value) -> operation;
+
+}
+
+static void * ef_client_redirected(struct node * node){
+ return &((struct clientparam *)node->value) -> redirected;
+
+}
+
+static void * ef_client_hostname(struct node * node){
+ return ((struct clientparam *)node->value) -> hostname;
+}
+
+static void * ef_client_username(struct node * node){
+ return ((struct clientparam *)node->value) -> username;
+}
+
+static void * ef_client_password(struct node * node){
+ return ((struct clientparam *)node->value) -> password;
+}
+
+static void * ef_client_extusername(struct node * node){
+ return ((struct clientparam *)node->value) -> extusername;
+}
+
+static void * ef_client_extpassword(struct node * node){
+ return ((struct clientparam *)node->value) -> extpassword;
+}
+
+static void * ef_client_cliip(struct node * node){
+ return &((struct clientparam *)node->value) -> sinc.sin_addr.s_addr;
+}
+
+static void * ef_client_srvip(struct node * node){
+ return &((struct clientparam *)node->value) -> sins.sin_addr.s_addr;
+}
+
+static void * ef_client_reqip(struct node * node){
+ return &((struct clientparam *)node->value) -> req.sin_addr.s_addr;
+}
+
+static void * ef_client_reqport(struct node * node){
+ return &((struct clientparam *)node->value) -> req.sin_port;
+}
+
+static void * ef_client_srvport(struct node * node){
+ return &((struct clientparam *)node->value) -> sins.sin_port;
+}
+
+static void * ef_client_cliport(struct node * node){
+ return &((struct clientparam *)node->value) -> sinc.sin_port;
+}
+
+static void * ef_client_bytesin(struct node * node){
+ return &((struct clientparam *)node->value) -> statssrv;
+}
+
+static void * ef_client_bytesout(struct node * node){
+ return &((struct clientparam *)node->value) -> statscli;
+}
+
+static void * ef_client_pwtype(struct node * node){
+ return &((struct clientparam *)node->value) -> pwtype;
+}
+
+static void * ef_client_threadid(struct node * node){
+ return &((struct clientparam *)node->value) -> threadid;
+}
+
+static void * ef_client_starttime(struct node * node){
+ return &((struct clientparam *)node->value) -> time_start;
+}
+
+static void * ef_client_starttime_msec(struct node * node){
+ return &((struct clientparam *)node->value) -> msec_start;
+}
+
+static void * ef_period_fromtime(struct node * node){
+ return &((struct period *)node->value) -> fromtime;
+}
+
+static void * ef_period_totime(struct node * node){
+ return &((struct period *)node->value) -> totime;
+}
+
+static void * ef_period_next(struct node * node){
+ return ((struct period *)node->value) -> next;
+}
+
+static struct property prop_portlist[] = {
+ {prop_portlist + 1, "start", ef_portlist_start, TYPE_PORT, "port range start"},
+ {prop_portlist + 2, "end", ef_portlist_end, TYPE_PORT, "port range end"},
+ {NULL, "next", ef_portlist_next, TYPE_PORTLIST, "next"}
+};
+
+static struct property prop_userlist[] = {
+ {prop_userlist+1, "user", ef_userlist_user, TYPE_STRING, "user name"},
+ {NULL, "next", ef_userlist_next, TYPE_USERLIST, "next"}
+};
+
+static struct property prop_pwlist[] = {
+ {prop_pwlist + 1, "user", ef_pwlist_user, TYPE_STRING, "user name"},
+ {prop_pwlist + 2, "password", ef_pwlist_password, TYPE_STRING, "password string"},
+ {prop_pwlist + 3, "type", ef_pwlist_type, TYPE_STRING, "password type"},
+ {NULL, "next", ef_pwlist_next, TYPE_PWLIST, "next"}
+};
+
+static struct property prop_iplist[] = {
+ {prop_iplist + 1, "ip", ef_iplist_ip, TYPE_IP, "ip address"},
+ {prop_iplist + 2, "cidr", ef_iplist_cidr, TYPE_CIDR, "ip mask length"},
+ {prop_iplist + 3, "mask", ef_iplist_mask, TYPE_IP, "ip mask"},
+ {NULL, "next", ef_iplist_next, TYPE_IPLIST, "next"}
+};
+
+static struct property prop_chain[] = {
+ {prop_chain + 1, "ip", ef_chain_ip, TYPE_IP, "parent ip address"},
+ {prop_chain + 2, "port", ef_chain_port, TYPE_PORT, "parent port"},
+ {prop_chain + 3, "type", ef_chain_type, TYPE_STRING, "parent type"},
+ {prop_chain + 4, "weight", ef_chain_weight, TYPE_SHORT, "parent weight 0-1000"},
+ {prop_chain + 5, "user", ef_chain_user, TYPE_STRING, "parent login"},
+ {prop_chain + 6, "password", ef_chain_password, TYPE_STRING, "parent password"},
+ {NULL, "next", ef_chain_next, TYPE_CHAIN, "next"}
+};
+
+static struct property prop_period[] = {
+ {prop_period + 1, "fromtime", ef_period_fromtime, TYPE_TIME, "from time" },
+ {prop_period + 2, "totime", ef_period_totime, TYPE_TIME, "to time" },
+ {NULL, "next", ef_period_next, TYPE_PERIOD, "next"}
+};
+
+static struct property prop_ace[] = {
+ {prop_ace + 1, "type", ef_ace_type, TYPE_STRING, "ace action"},
+ {prop_ace + 2, "operations", ef_ace_operations, TYPE_OPERATIONS, "request type"},
+ {prop_ace + 3, "users", ef_ace_users, TYPE_USERLIST, "list of users"},
+ {prop_ace + 4, "src", ef_ace_src, TYPE_IPLIST, "list of source ips"},
+ {prop_ace + 5, "dst", ef_ace_dst, TYPE_IPLIST, "list of destination ips"},
+ {prop_ace + 6, "ports", ef_ace_ports, TYPE_PORTLIST, "list of destination ports"},
+ {prop_ace + 7, "chain", ef_ace_chain, TYPE_CHAIN, "redirect to parent(s)"},
+ {prop_ace + 8, "wdays", ef_ace_weekdays, TYPE_WEEKDAYS, "days of week"},
+ {prop_ace + 9, "periods", ef_ace_period, TYPE_PERIOD, "time of the day"},
+ {NULL, "next", ef_ace_next, TYPE_ACE, "next"}
+};
+
+static struct property prop_bandlimit[] = {
+ {prop_bandlimit + 1, "ace", ef_bandlimit_ace, TYPE_ACE, "acl to apply"},
+ {prop_bandlimit + 2, "rate", ef_bandlimit_rate, TYPE_UNSIGNED, "max allowed bandwidth"},
+ {NULL, "next", ef_bandlimit_next, TYPE_BANDLIMIT, "next"}
+};
+
+static struct property prop_trafcounter[] = {
+ {prop_trafcounter + 1, "disabled", ef_trafcounter_disabled, TYPE_INTEGER, "counter status"},
+ {prop_trafcounter + 2, "ace", ef_trafcounter_ace, TYPE_ACE, "traffic to count"},
+ {prop_trafcounter + 3, "number", ef_trafcounter_number, TYPE_UNSIGNED, "counter number"},
+ {prop_trafcounter + 4, "type", ef_trafcounter_type, TYPE_ROTATION, "rotation type"},
+ {prop_trafcounter + 5, "traffic", ef_trafcounter_traffic, TYPE_TRAFFIC, "counter value"},
+ {prop_trafcounter + 6, "limit", ef_trafcounter_limit, TYPE_TRAFFIC, "counter limit"},
+ {prop_trafcounter + 7, "cleared", ef_trafcounter_cleared, TYPE_DATETIME, "last rotated"},
+ {prop_trafcounter + 8, "updated", ef_trafcounter_updated, TYPE_DATETIME, "last updated"},
+ {prop_trafcounter + 9, "comment", ef_trafcounter_comment, TYPE_STRING, "counter comment"},
+ {NULL, "next", ef_trafcounter_next, TYPE_TRAFCOUNTER}
+};
+
+/*
+*/
+
+static struct property prop_server[] = {
+ {prop_server + 1, "servicetype", ef_server_type, TYPE_STRING, "type of the service/client"},
+ {prop_server + 2, "target", ef_server_target, TYPE_STRING, "portmapper target ip"},
+ {prop_server + 3, "targetport", ef_server_targetport, TYPE_PORT, "portmapper target port"},
+ {prop_server + 4, "starttime", ef_server_starttime, TYPE_DATETIME, "service started seconds"},
+ {prop_server + 5, "intip", ef_server_intip, TYPE_IP, "ip address of internal interface"},
+ {prop_server + 6, "extip", ef_server_extip, TYPE_IP, "ip address of external interface"},
+ {prop_server + 7, "intport", ef_server_intport, TYPE_PORT, "port to listen"},
+ {prop_server + 8, "extport", ef_server_extport, TYPE_PORT, "port to use for outgoing connection"},
+ {prop_server + 9, "auth", ef_server_auth, TYPE_STRING, "service authentication type"},
+ {prop_server + 10, "acl", ef_server_acl, TYPE_ACE, "access control list"},
+ {prop_server + 11, "singlepacket", ef_server_singlepacket, TYPE_INTEGER, "is single packet redirection"},
+ {prop_server + 12, "usentlm", ef_server_usentlm, TYPE_INTEGER, "allow NTLM authentication"},
+ {prop_server + 13, "log", ef_server_log, TYPE_STRING, "type of logging"},
+ {prop_server + 14, "logtarget", ef_server_logtarget, TYPE_STRING, "log target options"},
+ {prop_server + 15, "logformat", ef_server_logformat, TYPE_STRING, "logging format string"},
+ {prop_server + 16, "nonprintable", ef_server_nonprintable, TYPE_STRING, "non printable characters"},
+ {prop_server + 17, "replacement", ef_server_replacement, TYPE_CHAR, "replacement character"},
+ {prop_server + 18, "childcount", ef_server_childcount, TYPE_INTEGER, "number of servers connected"},
+ {prop_server + 19, "child", ef_server_child, TYPE_CLIENT, "connected clients"},
+ {NULL, "next", ef_server_next, TYPE_SERVER, "next"}
+};
+
+
+static struct property prop_client[] = {
+ {prop_client + 1, "servicetype", ef_client_type, TYPE_STRING, "type of the client"},
+ {prop_client + 2, "threadid", ef_client_threadid, TYPE_INTEGER, "process thread id"},
+ {prop_client + 3, "starttime", ef_client_starttime, TYPE_DATETIME, "client started seconds"},
+ {prop_client + 4, "starttime_msec", ef_client_starttime_msec, TYPE_UNSIGNED, "client started milliseconds"},
+ {prop_client + 5, "redirected", ef_client_redirected, TYPE_INTEGER, "number of redirections"},
+ {prop_client + 6, "operation", ef_client_operation, TYPE_OPERATIONS, "action requested by client"},
+ {prop_client + 7, "hostname", ef_client_hostname, TYPE_STRING, "name of the requested host"},
+ {prop_client + 8, "extusername", ef_client_extusername, TYPE_STRING, "username for requested host"},
+ {prop_client + 9, "extpassword", ef_client_extpassword, TYPE_STRING, "password for requested host"},
+ {prop_client + 10, "username", ef_client_username, TYPE_STRING, "client username"},
+ {prop_client + 11, "password", ef_client_password, TYPE_STRING, "client password"},
+ {prop_client + 12, "cliip", ef_client_cliip, TYPE_IP, "client ip"},
+ {prop_client + 13, "cliport", ef_client_cliport, TYPE_PORT, "client port"},
+ {prop_client + 14, "srvip", ef_client_srvip, TYPE_IP, "target server ip"},
+ {prop_client + 15, "srvport", ef_client_srvport, TYPE_PORT, "target server port"},
+ {prop_client + 16, "reqip", ef_client_reqip, TYPE_IP, "requested server ip"},
+ {prop_client + 17, "reqport", ef_client_reqport, TYPE_PORT, "requested server port"},
+ {prop_client + 18, "bytesin", ef_client_bytesin, TYPE_UNSIGNED, "bytes from server to client"},
+ {prop_client + 19, "bytesout", ef_client_bytesout, TYPE_UNSIGNED, "bytes from client to server"},
+ {prop_client + 20, "pwtype", ef_client_pwtype, TYPE_INTEGER, "type of client password"},
+ {prop_client + 21, "maxtrafin", ef_client_maxtrafin, TYPE_UNSIGNED, "maximum traffic allowed for download"},
+ {prop_client + 22, "maxtrafout", ef_client_maxtrafout, TYPE_UNSIGNED, "maximum traffic allowed for upload"},
+ {NULL, "next", ef_client_next, TYPE_CLIENT, "next"}
+
+
+};
+
+struct datatype datatypes[64] = {
+ {"integer", NULL, pr_integer, NULL},
+ {"short", NULL, pr_short, NULL},
+ {"char", NULL, pr_char, NULL},
+ {"unsigned", NULL, pr_unsigned, NULL},
+ {"traffic", NULL, pr_traffic, NULL},
+ {"port", NULL, pr_port, NULL},
+ {"ip", NULL, pr_ip, NULL},
+ {"cidr", NULL, pr_cidr, NULL},
+ {"string", NULL, pr_string, NULL},
+ {"datetime", NULL, pr_datetime, NULL},
+ {"operations", NULL, pr_operations, NULL},
+ {"rotation", NULL, pr_rotation, NULL},
+ {"portlist", ef_portlist_next, pr_portlist, prop_portlist},
+ {"iplist", ef_iplist_next, pr_iplist, prop_iplist},
+ {"userlist", ef_userlist_next, pr_userlist, prop_userlist},
+ {"pwlist", ef_pwlist_next, NULL, prop_pwlist},
+ {"chain", ef_chain_next, NULL, prop_chain},
+ {"ace", ef_ace_next, NULL, prop_ace},
+ {"bandlimit", ef_bandlimit_next, NULL, prop_bandlimit},
+ {"trafcounter", ef_trafcounter_next, NULL, prop_trafcounter},
+ {"client", ef_client_next, NULL, prop_client},
+ {"weekdays", NULL, pr_wdays, NULL},
+ {"time", NULL, pr_time, NULL},
+ {"period", ef_period_next, NULL, prop_period},
+ {"server", ef_server_next, NULL, prop_server}
+};
diff --git a/src/dighosts.c b/src/dighosts.c
new file mode 100644
index 0000000..0db6a71
--- /dev/null
+++ b/src/dighosts.c
@@ -0,0 +1,142 @@
+/*
+ * Copyright (c) 2000-2008 3APA3A
+ *
+ * please read License Agreement
+ *
+ * $Id: dighosts.c,v 1.10 2009/10/06 08:38:00 v.dubrovin Exp $
+ */
+
+#include "proxy.h"
+
+
+int sockgetchar(SOCKET sock, int timeosec, int timeousec){
+ unsigned char buf;
+ fd_set fds;
+ struct timeval tv;
+
+ tv.tv_sec = timeosec;
+ tv.tv_usec = timeousec;
+ FD_ZERO(&fds);
+ FD_SET(sock, &fds);
+ if (select (((int)sock)+1, &fds, NULL, NULL, &tv)!=1) return EOF;
+ if (recv(sock, &buf, 1, 0)!=1) return EOF;
+ return((int)buf);
+}
+
+
+int sockgetline(SOCKET sock, unsigned char * buf, int bufsize, int delim, int to){
+ int c;
+ int i=0, tos, tou;
+ if(bufsize<2) return 0;
+ c = sockgetchar(sock, to, 0);
+ if (c == EOF) {
+ return 0;
+ }
+ tos = to/16;
+ tou = ((to * 1000) / bufsize)%1000;
+ do {
+ buf[i++] = c;
+ if(delim != EOF && c == delim) break;
+ }while(i < bufsize && (c = sockgetchar(sock, tos, tou)) != EOF);
+ return i;
+}
+
+
+unsigned char request[] = "GET %.1024s HTTP/1.0\r\nHost: %.256s\r\n\r\n";
+
+int main(int argc, char *argv[]){
+ unsigned char *host, *hostend;
+ SOCKET sock;
+ struct sockaddr_in sa;
+ FILE *fp;
+ unsigned char buf[16000];
+ int i;
+ unsigned x,y,z,w,cidr, x1,y1,z1,w1, mask;
+ int first = 1;
+
+#ifdef _WIN32
+ WSADATA wd;
+ WSAStartup(MAKEWORD( 1, 1 ), &wd);
+#endif
+
+ if(argc < 3 || argc > 4 || (argc == 4 && (argv[1][0] != '-' || argv[1][1] != 'm'))) {
+ fprintf(stderr, "Usage: %s [-m] \n"
+ " program retrieves requested and builds comma delimited list of networks\n"
+ " list than stored in \n"
+ " networks are searched in xxx.yyy.zzz.www/cidr format\n"
+ " switches:\n"
+ " -m networks are searched in xxx.yyy.zzz.www mmm.mmm.mmm.mmm format\n"
+ "\n(c)2002 by 3APA3A\n",
+ argv[0]);
+ return 1;
+ }
+ if(strncasecmp(argv[argc-2], "http://", 7)) {
+ fprintf(stderr, "URL must be HTTP://\n");
+ return 2;
+ }
+ hostend = (unsigned char *)strchr((char *)argv[argc-2] + 7, '/');
+ if(!hostend) {
+ fprintf(stderr, "Wrong URL syntaxis\n");
+ return 3;
+ }
+ *hostend = 0;
+ if(!(host = (unsigned char *)strdup((char *)argv[argc-2] + 7))) {
+ return 4;
+ }
+ *hostend = '/';
+ if(!(sa.sin_addr.s_addr = getip(host))) {
+ fprintf(stderr, "Unable to resolve %s\n", host);
+ return 5;
+ }
+ sa.sin_port = htons(80);
+ sa.sin_family = AF_INET;
+ if((sock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP)) == INVALID_SOCKET) return 6;
+ sprintf((char *)buf, (char *)request, hostend, host);
+ if(connect(sock,(struct sockaddr *)&sa,sizeof(sa))) {
+ fprintf(stderr, "Unable to connect: %s\n", host);
+ return 8;
+ }
+ if(send(sock, buf, (int)strlen((char *)buf), 0) != (int)strlen((char *)buf)) return 9;
+ while( (i = sockgetline(sock, buf, sizeof(buf) - 1, '\n', 30)) > 2);
+ if(i<1) return 9;
+ if(!(fp = fopen(argv[argc-1], "w"))) {
+ fprintf(stderr, "Unable to open: %s\n", argv[2]);
+ return 7;
+ }
+ while( (i = sockgetline(sock, buf, sizeof(buf) - 1, '\n', 30)) > 0){
+ buf[i] = 0;
+ for(i = 0; buf[i]; i++){
+ if((buf[i]<'0' || buf[i] > '9') && buf[i] != '.' && buf[i] != '/')buf[i] = ' ';
+ }
+ if(argc == 3){
+ if((i=sscanf((char *)buf, "%u.%u.%u.%u/%u", &x, &y, &z, &w, &cidr)) == 5 &&
+ x<256 && y<256 && z<256 && w<256 &&
+ cidr <= 32){
+ if(!first)fprintf(fp, ",");
+ fprintf(fp, "%u.%u.%u.%u/%u", x, y, z, w, cidr);
+ first = 0;
+ }
+ }
+ else{
+ if((i = sscanf((char *)buf, "%u.%u.%u.%u %u.%u.%u.%u", &x, &y, &z, &w, &x1, &y1, &z1, &w1)) == 8 &&
+ x<256 && y<256 && z<256 && w<256 &&
+ x1<256 && y1<256 && z1<256 && w1<256
+ ){
+ mask = (x1<<24)|(y1<<16)|(z1<<8)|w1;
+ for(cidr = 0; cidr <= 32; cidr++)if((((unsigned long)(0xFFFFFFFF))<<(32-cidr)) == mask) break;
+ if(cidr > 32) continue;
+ if(!first)fprintf(fp, ",");
+ fprintf(fp, "%u.%u.%u.%u/%u", x, y, z, w, cidr);
+ first = 0;
+ }
+ }
+ }
+ shutdown(sock, SHUT_RDWR);
+#ifdef _WIN32
+ closesocket(sock);
+#else
+ close(sock);
+#endif
+ fclose(fp);
+ return 0;
+}
diff --git a/src/dnspr.c b/src/dnspr.c
new file mode 100644
index 0000000..1e008ff
--- /dev/null
+++ b/src/dnspr.c
@@ -0,0 +1,196 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: dnspr.c,v 1.22 2009/09/17 12:21:05 v.dubrovin Exp $
+*/
+
+#include "proxy.h"
+
+#ifndef UDP
+#define UDP
+#endif
+#define RETURN(xxx) { param->res = xxx; goto CLEANRET; }
+
+#define BUFSIZE 4096
+
+
+void * dnsprchild(struct clientparam* param) {
+ unsigned long ip = 0;
+ unsigned char *buf, *s1, *s2;
+ char * host = NULL;
+ unsigned char c;
+ SASIZETYPE size;
+ int res, i;
+ int len;
+ unsigned type=0;
+ unsigned ttl;
+#ifdef _WIN32
+ unsigned long ul = 1;
+#endif
+
+
+ if(!(buf = myalloc(BUFSIZE))){
+ param->srv->fds.events = POLLIN;
+ RETURN (21);
+ }
+ size = sizeof(struct sockaddr_in);
+ i = so._recvfrom(param->srv->srvsock, buf, BUFSIZE, 0, (struct sockaddr *)¶m->sinc, &size);
+#ifdef _WIN32
+ if((param->clisock=so._socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) == INVALID_SOCKET) {
+ RETURN(818);
+ }
+ ioctlsocket(param->clisock, FIONBIO, &ul);
+ size = sizeof(struct sockaddr_in);
+ if(so._getsockname(param->srv->srvsock, (struct sockaddr *)¶m->sins, &size)) {RETURN(21);};
+ if(so._setsockopt(param->clisock, SOL_SOCKET, SO_REUSEADDR, (unsigned char *)&ul, sizeof(int))) {RETURN(820);};
+ if(so._bind(param->clisock,(struct sockaddr *)¶m->sins,sizeof(struct sockaddr_in))) {
+ RETURN(822);
+ }
+
+#else
+ param->clisock = param->srv->srvsock;
+#endif
+ param->srv->fds.events = POLLIN;
+
+ if(i < 0) {
+ RETURN(813);
+ }
+ buf[BUFSIZE - 1] = 0;
+ if(i<=13 || i>1000){
+ RETURN (814);
+ }
+ param->operation = DNSRESOLVE;
+ if((res = (*param->srv->authfunc)(param))) {RETURN(res);}
+
+ if(buf[4]!=0 || buf[5]!=1) RETURN(816);
+ for(len = 12; len (i-4)) {RETURN(817);}
+
+ host = mystrdup((char *)buf+13);
+ if(!host) {RETURN(21);}
+
+ for(s2 = buf + 12; (s1 = (unsigned char *)strchr((char *)s2 + 1, '.')); s2 = s1)*s2 = (unsigned char)((s1 - s2) - 1);
+ *s2 = (len - (int)(s2 - buf)) - 1;
+
+ type = ((unsigned)buf[len+1])*256 + (unsigned)buf[len+2];
+ if(type==1){
+ ip = udpresolve((unsigned char *)host, &ttl, param, 0);
+ }
+
+ len+=5;
+
+ if(ip){
+ buf[2] = 0x85;
+ buf[3] = 0x80;
+ buf[6] = 0;
+ buf[7] = 1;
+ buf[8] = buf[9] = buf[10] = buf[11] = 0;
+ memset(buf+len, 0, 16);
+ buf[len] = 0xc0;
+ buf[len+1] = 0x0c;
+ buf[len+3] = 1;
+ buf[len+5] = 1;
+ ttl = htonl(ttl);
+ memcpy(buf + len + 6, &ttl, 4);
+ buf[len+11] = 4;
+ memcpy(buf+len+12,(void *)&ip,4);
+ len+=16;
+ }
+ if(type == 0x0c) {
+ unsigned a, b, c, d;
+ sscanf(host, "%u.%u.%u.%u", &a, &b, &c, &d);
+ ip = htonl((d<<24) ^ (c<<16) ^ (b<<8) ^ a);
+ if(ip == param->srv->intip){
+ buf[2] = 0x85;
+ buf[3] = 0x80;
+ buf[6] = 0;
+ buf[7] = 1;
+ buf[8] = buf[9] = buf[10] = buf[11] = 0;
+ memset(buf+len, 0, 20);
+ buf[len] = 0xc0;
+ buf[len+1] = 0x0c;
+ buf[len+3] = 0x0c;
+ buf[len+5] = 1;
+ ttl = htonl(3600);
+ memcpy(buf + len + 6, &ttl, 4);
+ buf[len+11] = 7;
+ buf[len+12] = 6;
+ memcpy(buf+len+13,(void *)"3proxy",6);
+ len+=20;
+ }
+ else ip = 0;
+ }
+ if(!ip && nservers[0] && type!=1){
+ if((param->remsock=so._socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) == INVALID_SOCKET) {
+ RETURN(818);
+ }
+#ifdef _WIN32
+ ioctlsocket(param->remsock, FIONBIO, &ul);
+#else
+ fcntl(param->remsock,F_SETFL,O_NONBLOCK);
+#endif
+ param->sins.sin_family = AF_INET;
+ param->sins.sin_port = htons(0);
+ param->sins.sin_addr.s_addr = htonl(0);
+ if(so._bind(param->remsock,(struct sockaddr *)¶m->sins,sizeof(struct sockaddr_in))) {
+ RETURN(819);
+ }
+ param->sins.sin_addr.s_addr = nservers[0];
+ param->sins.sin_port = htons(53);
+ if(socksendto(param->remsock, ¶m->sins, buf, i, conf.timeouts[SINGLEBYTE_L]*1000) != i){
+ RETURN(820);
+ }
+ param->statscli += i;
+ param->nwrites++;
+ len = sockrecvfrom(param->remsock, ¶m->sins, buf, BUFSIZE, 15000);
+ if(len <= 13) {
+ RETURN(821);
+ }
+ param->statssrv += len;
+ param->nreads++;
+ if(buf[6] || buf[7]){
+ if(socksendto(param->clisock, ¶m->sinc, buf, len, conf.timeouts[SINGLEBYTE_L]*1000) != len){
+ RETURN(822);
+ }
+ RETURN(0);
+ }
+
+ }
+ if(!ip) {
+ buf[2] = 0x85;
+ buf[3] = 0x83;
+ }
+ usleep(SLEEPTIME);
+ res = socksendto(param->clisock, ¶m->sinc, buf, len, conf.timeouts[SINGLEBYTE_L]*1000);
+ if(res != len){RETURN(819);}
+ if(!ip) {RETURN(888);}
+
+CLEANRET:
+
+ if(param->res!=813){
+ sprintf((char *)buf, "%04x/%s(%u.%u.%u.%u)",
+ (unsigned)type,
+ host?host:"",
+ (unsigned)(ntohl(ip)&0xff000000)>>24,
+ (unsigned)(ntohl(ip)&0x00ff0000)>>16,
+ (unsigned)(ntohl(ip)&0x0000ff00)>>8,
+ (unsigned)(ntohl(ip)&0x000000ff)
+ );
+ (*param->srv->logfunc)(param, buf);
+ }
+ if(buf)myfree(buf);
+ if(host)myfree(host);
+#ifndef _WIN32
+ param->clisock = INVALID_SOCKET;
+#endif
+ freeparam(param);
+ return (NULL);
+}
+
diff --git a/src/ftp.c b/src/ftp.c
new file mode 100644
index 0000000..710c65b
--- /dev/null
+++ b/src/ftp.c
@@ -0,0 +1,233 @@
+/*
+ * Copyright (c) 2002-2008 3APA3A
+ *
+ * please read License Agreement
+ *
+ * $Id: ftp.c,v 1.34 2009/09/17 12:21:06 v.dubrovin Exp $
+ */
+
+#include "proxy.h"
+
+
+int ftplogin(struct clientparam *param, char *nbuf, int *innbuf) {
+ char tbuf[1024];
+ int i;
+ char *buf;
+ int len;
+ int res;
+
+ buf = nbuf?nbuf:tbuf;
+ len = nbuf?*innbuf:1024;
+
+ if(innbuf)*innbuf = 0;
+ if(len < 48) return 707;
+ while((i = sockgetlinebuf(param, SERVER, (unsigned char *)buf, len - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ if(i < 3) return 706;
+ buf[i] = 0;
+ if(atoi(buf)/100 != 2) {
+ *innbuf = i;
+ return 702;
+ }
+ sprintf(buf, "USER %.32s\r\n", param->extusername?param->extusername:(unsigned char *)"anonymous");
+ if((int)socksend(param->remsock, (unsigned char *)buf, (int)strlen(buf), conf.timeouts[STRING_S]) != (int)strlen(buf)){
+ return 703;
+ }
+ param->statscli += (int)strlen(buf);
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, (unsigned char *)buf, len - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ if(i < 3) return 704;
+ buf[i] = 0;
+ res = atoi(buf)/100;
+ if(res == 3){
+ sprintf(buf, "PASS %.32s\r\n",
+ param->extusername?
+ (param->extpassword?
+ param->extpassword:(unsigned char *)"")
+ :(unsigned char *)"3proxy@");
+ res = (int)strlen(buf);
+ if((int)socksend(param->remsock, (unsigned char *)buf, res, conf.timeouts[STRING_S]) != (int)strlen(buf)){
+ return 705;
+ }
+ param->statscli += res;
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, (unsigned char *)buf, len - 1, '\n', conf.timeouts[STRING_L])) > 0){
+ buf[i] = 0;
+ res = (i>3 && buf[3] != '-')? atoi(buf)/100 : 0;
+ if(res || (nbuf && (len-i) > 256 && i > 3)) {
+ buf += i;
+ len -= i;
+ if(innbuf)*innbuf += i;
+ }
+ if(res) break;
+ }
+ if(i < 3) {
+ return 701;
+ }
+ }
+ if(res != 2) {
+ return 700;
+ }
+ return 0;
+}
+
+int ftpcd(struct clientparam *param, unsigned char* path, char *nbuf, int *innbuf){
+ char buf[1024];
+ int i;
+ int inbuf = 0;
+
+ sprintf(buf, "CWD %.512s\r\n", path);
+ if((int)socksend(param->remsock, (unsigned char *)buf, (int)strlen(buf), conf.timeouts[STRING_S]) != (int)strlen(buf)){
+ return 711;
+ }
+ param->statscli += (int)strlen(buf);
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, (unsigned char *)buf, sizeof(buf) - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ if(nbuf && innbuf && inbuf + i < *innbuf && i > 6) {
+ memcpy(nbuf + inbuf, buf, i);
+ inbuf += i;
+ }
+ }
+ if(innbuf)*innbuf = inbuf;
+ if(i < 3) return 712;
+ buf[3] = 0;
+ if(buf[0] != '2') return 710;
+ return 0;
+}
+
+int ftpres(struct clientparam *param, unsigned char * buf, int l){
+ int i;
+
+ if (l < 16) return 755;
+ while((i = sockgetlinebuf(param, SERVER, buf, l - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ buf[i] = 0;
+ if(i < 3) return 751;
+ if(buf[0] != '2' && buf[0] != '1') return 750;
+ return 0;
+}
+
+int ftpsyst(struct clientparam *param, unsigned char *buf, unsigned len){
+ int i;
+
+ if(socksend(param->remsock, (unsigned char *)"SYST\r\n", 6, conf.timeouts[STRING_S]) != 6){
+ return 721;
+ }
+ param->statscli+=6;
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, buf, len - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ if(i < 7) return 722;
+ buf[3] = 0;
+ if(atoi((char *)buf)/100 != 2) return 723;
+ buf[i-2] = 0;
+ strcpy((char *)buf, (char *)buf+4);
+ return 0;
+}
+
+int ftppwd(struct clientparam *param, unsigned char *buf, unsigned len){
+ int i;
+ char *b, *e;
+
+ if(socksend(param->remsock, (unsigned char *)"PWD\r\n", 5, conf.timeouts[STRING_S]) != 5){
+ return 731;
+ }
+ param->statscli += 5;
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, buf, len - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ if(i < 7) return 732;
+ buf[3] = 0;
+ if(atoi((char *)buf)/100 != 2) return 733;
+ buf[i-2] = 0;
+ b = (char *)buf+4;
+ if(*b == '\"' && (e = strchr(b+1, '\"'))){
+ b++;
+ *e = 0;
+ }
+ strcpy((char *)buf, b);
+ return 0;
+}
+
+int ftptype(struct clientparam *param, unsigned char* f_type){
+ char buf[1024];
+ int i;
+
+ sprintf(buf, "TYPE %.512s\r\n", f_type);
+ if((int)socksend(param->remsock, (unsigned char *)buf, (int)strlen(buf), conf.timeouts[STRING_S]) != (int)strlen(buf)){
+ return 741;
+ }
+ param->statscli += (int)strlen(buf);
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, (unsigned char *)buf, sizeof(buf) - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ if(i < 3) return 742;
+ if(buf[0] != '2') return 740;
+ return 0;
+}
+
+
+SOCKET ftpdata(struct clientparam *param){
+ char buf[1024];
+ int i;
+ char *sb, *se;
+ SOCKET s = INVALID_SOCKET, rem;
+ unsigned long b1, b2, b3, b4;
+ unsigned short b5, b6;
+
+ if(socksend(param->remsock, (unsigned char *)"PASV\r\n", 6, conf.timeouts[STRING_S]) != 6){
+ return INVALID_SOCKET;
+ }
+ param->statscli+=6;
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, (unsigned char *)buf, sizeof(buf) - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ if(i < 7) return INVALID_SOCKET;
+ if(buf[0] != '2') return INVALID_SOCKET;
+ buf[i-2] = 0;
+ if(!(sb = strchr(buf+4, '(')) || !(se= strchr(sb, ')'))) return INVALID_SOCKET;
+ if(sscanf(sb+1, "%lu,%lu,%lu,%lu,%hu,%hu", &b1, &b2, &b3, &b4, &b5, &b6)!=6) return INVALID_SOCKET;
+ rem = param->remsock;
+ param->remsock = INVALID_SOCKET;
+ param->req.sin_family = AF_INET;
+ param->req.sin_port = param->sins.sin_port = htons((unsigned short)((b5<<8)^b6));
+ param->req.sin_addr.s_addr = param->sins.sin_addr.s_addr = htonl((b1<<24)^(b2<<16)^(b3<<8)^b4);
+ i = param->operation;
+ param->operation = FTP_DATA;
+ if((param->res = (*param->srv->authfunc)(param))) return INVALID_SOCKET;
+ param->operation = i;
+ s = param->remsock;
+ param->remsock = rem;
+ return s;
+}
+
+SOCKET ftpcommand(struct clientparam *param, unsigned char * command, unsigned char *arg) {
+ char buf[1024];
+ int i;
+ SOCKET s;
+
+
+ s = ftpdata(param);
+ if(s==INVALID_SOCKET) return INVALID_SOCKET;
+ sprintf(buf, "%.15s%s%.512s\r\n", command, arg?
+ (unsigned char *)" ":(unsigned char *)"",
+ arg?arg:(unsigned char *)"");
+ if((int)socksend(param->remsock, (unsigned char *)buf, (int)strlen(buf), conf.timeouts[STRING_S]) != (int)strlen(buf)){
+ so._closesocket(s);
+ return INVALID_SOCKET;
+ }
+ param->statscli += (int)strlen(buf);
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, (unsigned char *)buf, sizeof(buf) - 1, '\n', conf.timeouts[STRING_L])) > 0 && (i < 3 || !isnumber(*buf) || buf[3] == '-')){
+ }
+ if(i < 3) {
+ so._closesocket(s);
+ return INVALID_SOCKET;
+ }
+ if(buf[0] != '1') {
+ so._closesocket(s);
+ return INVALID_SOCKET;
+ }
+ return s;
+}
diff --git a/src/ftppr.c b/src/ftppr.c
new file mode 100644
index 0000000..90f18c0
--- /dev/null
+++ b/src/ftppr.c
@@ -0,0 +1,329 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: ftppr.c,v 1.45 2011-08-15 19:52:27 vlad Exp $
+*/
+
+#include "proxy.h"
+
+#define RETURN(xxx) { param->res = xxx; goto CLEANRET; }
+#define BUFSIZE 2048
+
+void * ftpprchild(struct clientparam* param) {
+ int i=0, res;
+ unsigned char *buf;
+ unsigned char *se;
+ int status = 0;
+ int inbuf;
+ int pasv = 0;
+ SOCKET sc = INVALID_SOCKET, ss = INVALID_SOCKET, clidatasock = INVALID_SOCKET;
+ SASIZETYPE sasize;
+ char * req = NULL;
+ struct linger lg;
+ struct pollfd fds;
+
+ if(!(buf = myalloc(BUFSIZE))) RETURN(876);
+ param->ctrlsock = param->clisock;
+ param->operation = CONNECT;
+ lg.l_onoff = 1;
+ lg.l_linger = conf.timeouts[STRING_L];;
+ if(socksend(param->ctrlsock, (unsigned char *)"220 Ready\r\n", 11, conf.timeouts[STRING_S])!=11) {RETURN (801);}
+ for(;;){
+ i = sockgetlinebuf(param, CLIENT, buf, BUFSIZE - 10, '\n', conf.timeouts[CONNECTION_S]);
+ if(!i) {
+ RETURN(0);
+ }
+ if(i<4) {RETURN(802);}
+ buf[i] = 0;
+ if ((se=(unsigned char *)strchr((char *)buf, '\r'))) *se = 0;
+ if (req) myfree (req);
+ req = NULL;
+
+(*param->srv->logfunc)(param, buf);
+
+ if (!strncasecmp((char *)buf, "OPEN ", 5)){
+ if(parsehostname((char *)buf+5, param, 21)){RETURN(803);}
+ if(param->remsock != INVALID_SOCKET) {
+ so._shutdown(param->remsock, SHUT_RDWR);
+ so._closesocket(param->remsock);
+ param->remsock = INVALID_SOCKET;
+ }
+ if((res = (*param->srv->authfunc)(param))) {RETURN(res);}
+ param->ctrlsocksrv = param->remsock;
+ if(socksend(param->ctrlsock, (unsigned char *)"220 Ready\r\n", 11, conf.timeouts[STRING_S])!=11) {RETURN (801);}
+ status = 1;
+ }
+ else if (!strncasecmp((char *)buf, "USER ", 5)){
+ if(parseconnusername((char *)buf +5, param, 0, 21)){RETURN(804);}
+ if(!status){
+ if((res = (*param->srv->authfunc)(param))) {RETURN(res);}
+ param->ctrlsocksrv = param->remsock;
+ }
+ if(socksend(param->ctrlsock, (unsigned char *)"331 ok\r\n", 8, conf.timeouts[STRING_S])!=8) {RETURN (807);}
+ status = 2;
+
+ }
+ else if (!strncasecmp((char *)buf, "PASS ", 5)){
+ param->extpassword = (unsigned char *)mystrdup((char *)buf+5);
+ inbuf = BUFSIZE;
+ res = ftplogin(param, (char *)buf, &inbuf);
+ param->res = res;
+ if(inbuf && inbuf != BUFSIZE && socksend(param->ctrlsock, buf, inbuf, conf.timeouts[STRING_S])!=inbuf) {RETURN (807);}
+ if(!res) status = 3;
+ sprintf((char *)buf, "%.64s@%.128s%c%hu", param->extusername, param->hostname, (ntohs(param->sins.sin_port)==21)?0:':', ntohs(param->sins.sin_port));
+ req = mystrdup((char *)buf);
+#ifndef WITHMAIN
+ {
+ int action, reqbufsize, reqsize;
+ reqbufsize = BUFSIZE;
+ reqsize = (int)strlen(buf) + 1;
+
+ action = handlereqfilters(param, &buf, &reqbufsize, 0, &reqsize);
+ if(action == HANDLED){
+ RETURN(0);
+ }
+ if(action != PASS) RETURN(877);
+ }
+#endif
+ }
+ else if (status >= 3 && (
+ (!strncasecmp((char *)buf, "PASV", 4) && (pasv = 1)) ||
+ (!strncasecmp((char *)buf, "PORT ", 5) && !(pasv = 0))
+ )){
+#ifndef WITHMAIN
+ {
+ int action, reqbufsize, reqsize;
+ reqbufsize = BUFSIZE;
+ reqsize = (int)strlen(buf) + 1;
+
+ action = handlehdrfilterscli(param, &buf, &reqbufsize, 0, &reqsize);
+ if(action == HANDLED){
+ RETURN(0);
+ }
+ if(action != PASS) RETURN(878);
+ }
+#endif
+ if(sc != INVALID_SOCKET) {
+ so._shutdown(sc, SHUT_RDWR);
+ so._closesocket(sc);
+ sc = INVALID_SOCKET;
+ }
+ if(ss != INVALID_SOCKET) {
+ so._shutdown(ss, SHUT_RDWR);
+ so._closesocket(ss);
+ ss = INVALID_SOCKET;
+ }
+ if(clidatasock != INVALID_SOCKET) {
+ so._shutdown(clidatasock, SHUT_RDWR);
+ so._closesocket(clidatasock);
+ clidatasock = INVALID_SOCKET;
+ }
+ if ((clidatasock=socket(AF_INET, SOCK_STREAM, IPPROTO_TCP)) == INVALID_SOCKET) {RETURN(821);}
+ sasize = sizeof(struct sockaddr_in);
+ if (pasv) {
+ if(so._getsockname(param->ctrlsock, (struct sockaddr *)¶m->sinc, &sasize)){RETURN(824);}
+ param->sinc.sin_port = 0;
+ if(so._bind(clidatasock, (struct sockaddr *)¶m->sinc, sasize)){RETURN(822);}
+ if(so._listen(clidatasock, 1)) {RETURN(823);}
+ if(so._getsockname(clidatasock, (struct sockaddr *)¶m->sinc, &sasize)){RETURN(824);}
+ sprintf((char *)buf, "227 OK (%u,%u,%u,%u,%u,%u)\r\n",
+ (unsigned)(((unsigned char *)(¶m->sinc.sin_addr.s_addr))[0]),
+ (unsigned)(((unsigned char *)(¶m->sinc.sin_addr.s_addr))[1]),
+ (unsigned)(((unsigned char *)(¶m->sinc.sin_addr.s_addr))[2]),
+ (unsigned)(((unsigned char *)(¶m->sinc.sin_addr.s_addr))[3]),
+ (unsigned)(((unsigned char *)(¶m->sinc.sin_port))[0]),
+ (unsigned)(((unsigned char *)(¶m->sinc.sin_port))[1])
+ );
+param->srv->logfunc(param,buf);
+ }
+ else {
+ unsigned long b1, b2, b3, b4;
+ unsigned short b5, b6;
+
+ if(sscanf((char *)buf+5, "%lu,%lu,%lu,%lu,%hu,%hu", &b1, &b2, &b3, &b4, &b5, &b6)!=6) {RETURN(828);}
+ param->sinc.sin_family = AF_INET;
+ param->sinc.sin_port = htons((unsigned short)((b5<<8)^b6));
+ param->sinc.sin_addr.s_addr = htonl((b1<<24)^(b2<<16)^(b3<<8)^b4);
+ if(so._connect(clidatasock, (struct sockaddr *)¶m->sinc, sasize)) {
+ so._closesocket(clidatasock);
+ clidatasock = INVALID_SOCKET;
+ RETURN(826);
+ }
+ sprintf(buf, "200 OK\r\n");
+ }
+#ifndef WITHMAIN
+ {
+ int action, reqbufsize, reqsize;
+ reqbufsize = BUFSIZE;
+ reqsize = (int)strlen(buf) + 1;
+
+ action = handlehdrfilterssrv(param, &buf, &reqbufsize, 0, &reqsize);
+ if(action == HANDLED){
+ RETURN(0);
+ }
+ if(action != PASS) RETURN(879);
+ }
+#endif
+ if(socksend(param->ctrlsock, buf, (int)strlen((char *)buf), conf.timeouts[STRING_S])!=(int)strlen((char *)buf)) {RETURN (825);}
+ status = 4;
+ }
+ else if (status == 4 && (
+ !(strncasecmp((char *)buf, "RETR ", 5) && (param->operation = FTP_GET)) ||
+ !(strncasecmp((char *)buf, "LIST", 4) && (param->operation = FTP_LIST))||
+ !(strncasecmp((char *)buf, "NLST ", 5) && (param->operation = FTP_LIST)) ||
+ !(strncasecmp((char *)buf, "APPE ", 5) && (param->operation = FTP_PUT)) ||
+ !(strncasecmp((char *)buf, "STOR ", 5) && (param->operation = FTP_PUT))
+ )){
+ int arg = (buf[4] && buf[5])? 1:0;
+ int ressent = 0;
+
+
+#ifndef WITHMAIN
+ {
+ int action, reqbufsize, reqsize;
+ reqbufsize = BUFSIZE;
+ reqsize = (int)strlen(buf) + 1;
+
+ action = handlehdrfilterscli(param, &buf, &reqbufsize, 0, &reqsize);
+ if(action == HANDLED){
+ RETURN(0);
+ }
+ if(action != PASS) RETURN(880);
+ }
+#endif
+ if(clidatasock == INVALID_SOCKET) { RETURN (829);}
+ if(pasv){
+
+ memset(&fds, 0, sizeof(fds));
+ fds.fd = clidatasock;
+ fds.events = POLLIN;
+
+ res = so._poll (&fds, 1, conf.timeouts[STRING_L]*1000);
+ if(res != 1) {
+ RETURN(857);
+ }
+ sasize = sizeof(struct sockaddr_in);
+ ss = so._accept(clidatasock, (struct sockaddr *)¶m->sinc, &sasize);
+ if (ss == INVALID_SOCKET) { RETURN (858);}
+ so._shutdown(clidatasock, SHUT_RDWR);
+ so._closesocket(clidatasock);
+ clidatasock = ss;
+ ss = INVALID_SOCKET;
+ }
+ if(clidatasock == INVALID_SOCKET){RETURN(828);}
+ req = mystrdup((char *)buf);
+ buf[4] = 0;
+ status = 3;
+ ss = ftpcommand(param, buf, arg? buf+5 : NULL);
+ if (ss == INVALID_SOCKET) {
+ so._shutdown(clidatasock, SHUT_RDWR);
+ so._closesocket(clidatasock);
+ clidatasock = INVALID_SOCKET;
+
+ if(socksend(param->ctrlsock, (unsigned char *)"550 err\r\n", 9, conf.timeouts[STRING_S])!=9) {RETURN (831);}
+ continue;
+ }
+
+ if(socksend(param->ctrlsock, (unsigned char *)"125 data\r\n", 10, conf.timeouts[STRING_S]) != 10) {
+ param->remsock = INVALID_SOCKET;
+ RETURN (832);
+ }
+ if(param->srvoffset < param->srvinbuf)while((i = sockgetlinebuf(param, SERVER, buf, BUFSIZE, '\n', 0)) > 3){
+ if(socksend(param->ctrlsock, buf, i, conf.timeouts[STRING_S])!=i) {RETURN(833);}
+ if(isnumber(*buf) && buf[3] != '-') {
+ ressent = 1;
+ break;
+ }
+ }
+ sc = param->remsock;
+ param->remsock = ss;
+ so._setsockopt(param->remsock, SOL_SOCKET, SO_LINGER, (unsigned char *)&lg, sizeof(lg));
+ so._setsockopt(clidatasock, SOL_SOCKET, SO_LINGER, (unsigned char *)&lg, sizeof(lg));
+ param->clisock = clidatasock;
+ res = sockmap(param, conf.timeouts[CONNECTION_S]);
+ if(param->remsock != INVALID_SOCKET) {
+ so._shutdown (param->remsock, SHUT_RDWR);
+ so._closesocket(param->remsock);
+ }
+ if(param->clisock != INVALID_SOCKET) {
+ so._shutdown (param->clisock, SHUT_RDWR);
+ so._closesocket(param->clisock);
+ }
+ param->clisock = param->ctrlsock;
+ param->remsock = sc;
+ sc = INVALID_SOCKET;
+ ss = INVALID_SOCKET;
+ clidatasock = INVALID_SOCKET;
+ if(!ressent){
+ while((i = sockgetlinebuf(param, SERVER, buf, BUFSIZE, '\n', conf.timeouts[STRING_L])) > 3){
+ if(socksend(param->ctrlsock, buf, i, conf.timeouts[STRING_S])!=i) {RETURN(833);}
+ if(isnumber(*buf) && buf[3] != '-') break;
+ }
+ if(i < 3) {RETURN(834);}
+ }
+ }
+ else {
+ if(status < 3) {
+ if(socksend(param->remsock, (unsigned char *)"530 login\r\n", 11, conf.timeouts[STRING_S])!=1) {RETURN (810);}
+ continue;
+ }
+ if(!strncasecmp((char *)buf, "QUIT", 4)) status = 5;
+ if(!strncasecmp((char *)buf, "CWD ", 4)) req = mystrdup((char *)buf);
+ i = (int)strlen((char *)buf);
+ buf[i++] = '\r';
+ buf[i++] = '\n';
+ if(socksend(param->remsock, buf, i, conf.timeouts[STRING_S])!=i) {RETURN (811);}
+ param->statscli += i;
+ param->nwrites++;
+ while((i = sockgetlinebuf(param, SERVER, buf, BUFSIZE, '\n', conf.timeouts[STRING_L])) > 0){
+ if(socksend(param->ctrlsock, buf, i, conf.timeouts[STRING_S])!=i) {RETURN (812);}
+ if(i > 4 && isnumber(*buf) && buf[3] != '-') break;
+ }
+ if(status == 5) {RETURN (0);}
+ if(i < 3) {RETURN (813);}
+ }
+ sasize = sizeof(struct sockaddr_in);
+ if(so._getpeername(param->ctrlsock, (struct sockaddr *)¶m->sinc, &sasize)){RETURN(819);}
+ if(req && (param->statscli || param->statssrv)){
+ (*param->srv->logfunc)(param, (unsigned char *)req);
+ }
+ }
+
+CLEANRET:
+
+ if(sc != INVALID_SOCKET) {
+ so._shutdown(sc, SHUT_RDWR);
+ so._closesocket(sc);
+ }
+ if(ss != INVALID_SOCKET) {
+ so._shutdown(ss, SHUT_RDWR);
+ so._closesocket(ss);
+ }
+ if(clidatasock != INVALID_SOCKET) {
+ so._shutdown(clidatasock, SHUT_RDWR);
+ so._closesocket(clidatasock);
+ }
+ sasize = sizeof(struct sockaddr_in);
+ so._getpeername(param->ctrlsock, (struct sockaddr *)¶m->sinc, &sasize);
+ if(param->res != 0 || param->statscli || param->statssrv ){
+ (*param->srv->logfunc)(param, (unsigned char *)((req && (param->res > 802))? req:NULL));
+ }
+ if(req) myfree(req);
+ if(buf) myfree(buf);
+ freeparam(param);
+ return (NULL);
+}
+
+#ifdef WITHMAIN
+struct proxydef childdef = {
+ ftpprchild,
+ 21,
+ 0,
+ S_FTPPR,
+ " -hdefault_host[:port] - use this host and port as default if no host specified\n"
+};
+#include "proxymain.c"
+#endif
diff --git a/src/icqpr.c b/src/icqpr.c
new file mode 100644
index 0000000..a319da6
--- /dev/null
+++ b/src/icqpr.c
@@ -0,0 +1,533 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: icqpr.c,v 1.30 2012-04-11 23:01:19 vlad Exp $
+*/
+
+#include "proxy.h"
+
+#ifndef PORTMAP
+#define PORTMAP
+#endif
+#define RETURN(xxx) { param->res = xxx; goto CLEANRET; }
+
+static void hexdump(unsigned char *data, int len){
+ for(; len; data++, len--){
+ printf("%02x", (unsigned)*data);
+ }
+ printf("\n");
+}
+
+struct flap_header {
+ unsigned char id;
+ unsigned char chan;
+ unsigned short seq;
+ unsigned short size;
+ char data[0];
+};
+
+struct snack_header {
+ unsigned family;
+ unsigned short flags;
+ unsigned id;
+ char data[0];
+};
+
+struct tlv_header {
+ unsigned short type;
+ unsigned short size;
+ char data[0];
+};
+
+
+typedef enum {
+ ONBEGIN = 0,
+ ONCHAN,
+ ONSEQ1,
+ ONSEQ2,
+ ONSIZE1,
+ ONSIZE2,
+ ONDATA
+} ICQSTATE;
+
+struct icqstate {
+ ICQSTATE state;
+ int leftinstate;
+ unsigned short seq;
+ unsigned short srvseq;
+ unsigned short gotseq;
+ unsigned short resyncseq;
+ char channel;
+};
+
+
+
+
+
+typedef enum {
+ ICQUNKNOWN,
+ ICQCLEAR,
+ ICQMD5,
+ ICQCOOKIE
+} LOGINTYPE;
+
+
+struct icq_cookie {
+ struct icq_cookie *next;
+ char *id;
+ int size;
+ char * cookie;
+ char * connectstring;
+};
+
+static struct icq_cookie *icq_cookies = NULL;
+pthread_mutex_t icq_cookie_mutex;
+int icq_cookie_mutex_init = 0;
+
+
+static void icq_clear(void *fo){
+};
+
+static void addbuffer(int increment, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int * length_p){
+ int bufsize = *length_p + increment + 40;
+ unsigned char *newbuf;
+ int len = 0;
+
+
+ if(bufsize > *bufsize_p){
+ newbuf = myalloc(bufsize);
+ if(!newbuf) return;
+ memcpy(newbuf, *buf_p, *length_p);
+ myfree(*buf_p);
+ *buf_p = newbuf;
+ *bufsize_p = bufsize;
+ }
+ if(increment) len = sockrecvfrom(param->remsock, ¶m->sins, *buf_p + *length_p, increment, conf.timeouts[STRING_S]*1000);
+ if(len > 0) {
+ *length_p += len;
+ param->nreads++;
+ param->statssrv += len;
+ }
+ return;
+}
+
+
+
+static int searchcookie(struct clientparam *param, struct flap_header * flap, int len, int * dif, struct tlv_header *tlv, int extra){
+ struct icq_cookie *ic;
+ char smallbuf[32];
+ struct tlv_header *bostlv = NULL;
+ struct sockaddr_in sa;
+ SASIZETYPE size = sizeof(sa);
+ int movelen = 0;
+
+ if(!icq_cookie_mutex_init){
+ pthread_mutex_init(&icq_cookie_mutex, NULL);
+ icq_cookie_mutex_init = 1;
+ }
+ pthread_mutex_lock(&icq_cookie_mutex);
+ for(ic = icq_cookies; ic; ic = ic->next)if(!strcmp(param->username, ic->id))break;
+ if(!ic){
+ ic = myalloc(sizeof(struct icq_cookie));
+ memset(ic, 0, sizeof(struct icq_cookie));
+ ic->id = mystrdup(param->username);
+ ic->next = icq_cookies;
+ icq_cookies = ic;
+ }
+ for(; ntohs(tlv->size) < 65500 && len >= (ntohs(tlv->size) + 4); len -= (ntohs(tlv->size) + 4), tlv = (struct tlv_header *)(tlv->data + ntohs(tlv->size))){
+ if(ntohs(tlv->type) == 0x0006){
+ if(ic->cookie)myfree(ic->cookie);
+ ic->cookie = myalloc(ntohs(tlv->size));
+ memcpy(ic->cookie, tlv->data, ntohs(tlv->size));
+ ic->size = tlv->size;
+ }
+ else if(ntohs(tlv->type) == 0x0005){
+ if(ic->connectstring)myfree(ic->connectstring);
+ ic->connectstring = myalloc(ntohs(tlv->size)+1);
+ memcpy(ic->connectstring, tlv->data, ntohs(tlv->size));
+ ic->connectstring[ntohs(tlv->size)] = 0;
+ bostlv = tlv;
+ movelen = extra + (len - 4) - ntohs(bostlv->size);
+ }
+
+ }
+ if(!ic->connectstring || !ic->cookie){
+ if(ic->cookie)myfree(ic->cookie);
+ if(ic->connectstring)myfree(ic->connectstring);
+ ic->cookie = NULL;
+ ic->connectstring = NULL;
+ ic->size = 0;
+ bostlv = NULL;
+ }
+ pthread_mutex_unlock(&icq_cookie_mutex);
+ if(bostlv){
+ if(so._getsockname(param->clisock, (struct sockaddr *)&sa, &size)==-1) return 1;
+ len = myinet_ntoa(sa.sin_addr, smallbuf);
+ if(strchr(ic->connectstring, ':'))sprintf(smallbuf+len, ":%hu", ntohs(sa.sin_port));
+ len = (int)strlen(smallbuf);
+ *dif = len - (int)ntohs(bostlv->size);
+ if(*dif != 0 && movelen > 0){
+ memmove(bostlv->data + len, bostlv->data + ntohs(bostlv->size), movelen);
+ }
+ memcpy(bostlv->data, smallbuf, len);
+ bostlv->size = htons(len);
+ len = ((int)ntohs(flap->size)) + *dif;
+ flap->size = htons(len);
+ }
+ return 0;
+}
+
+
+static FILTER_ACTION icq_srv(void *fc, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int ioffset, int * length_p){
+ unsigned char * start = *buf_p + ioffset;
+ int len = *length_p - ioffset;
+ struct icqstate *state = (struct icqstate *)fc;
+ int size;
+ int offset;
+
+ while (len > 0){
+ switch(state->state){
+ case ONBEGIN:
+
+ if((*start) == 0x2A) {
+ if(len < 6){
+ offset = (int)(start - *buf_p);
+ addbuffer(6-len, param, buf_p, bufsize_p, length_p);
+ start = *buf_p + offset;
+ len = (int)(*buf_p + *length_p - start);
+
+ }
+ state->state = ONCHAN;
+ }
+ else {
+ if(!state->leftinstate)param->srv->logfunc(param, "Warning: need resync");
+ state->leftinstate++;
+ if(state->leftinstate > 65535){
+ param->srv->logfunc(param, "Out of Sync");
+ return REJECT;
+ }
+ }
+ start++;
+ len--;
+ break;
+ case ONCHAN:
+ if (*start >= 10){
+ param->srv->logfunc(param, "Warning: Wrong channel");
+ state->state = ONBEGIN;
+ }
+ else {
+ state->state = ONSEQ1;
+ state->channel = *start;
+ start++;
+ len--;
+ }
+ break;
+ case ONSEQ1:
+ state->gotseq = (((unsigned)*start) << 8);
+ state->state = ONSEQ2;
+ *(start) = (state->seq>>8);
+ start++;
+ len--;
+ break;
+ case ONSEQ2:
+ state->gotseq += *start;
+ if(state->gotseq != state->srvseq){
+ char smallbuf[64];
+ if(((state->gotseq < state->srvseq) || ((state->gotseq - state->srvseq) > 10 )) && (!state->resyncseq || state->gotseq != state->resyncseq)){
+ sprintf(smallbuf, "Warning: Wrong sequence, expected: %04hx got: %04hx", state->srvseq, state->gotseq);
+ param->srv->logfunc(param, smallbuf);
+ state->state = ONBEGIN;
+ state->resyncseq = state->gotseq;
+ break;
+ }
+ sprintf(smallbuf, "Warning: %hu flaps are lost on resync", state->gotseq - state->srvseq );
+ param->srv->logfunc(param, smallbuf);
+ state->srvseq = state->gotseq;
+ *(start-1) = (state->seq>>8);
+ }
+ *start = (state->seq & 0x00FF);
+ state->srvseq = state->srvseq + 1;
+ state->seq = state->seq + 1;
+ state->state = ONSIZE1;
+ start++;
+ len--;
+ break;
+ case ONSIZE1:
+ state->leftinstate = (((unsigned)(*start))<<8);
+ state->state = ONSIZE2;
+ start++;
+ len--;
+ break;
+ case ONSIZE2:
+ state->leftinstate += *start;
+ state->state = (state->leftinstate)?ONDATA:ONBEGIN;
+ start++;
+ len--;
+ if(state->leftinstate > 30 && state->channel == 2) {
+
+ if(len < state->leftinstate) {
+ offset = (int)(start - *buf_p);
+ addbuffer(state->leftinstate - len, param, buf_p, bufsize_p, length_p);
+ start = *buf_p + offset;
+ len = (int)(*length_p - offset);
+
+ }
+ size = 0;
+ if ((start[4] & 0x80)) {
+ size = htons(*(unsigned short *)(start+10)) + 2;
+ if(size > 8) size = 0;
+ }
+ if (start[0] == 0 && start[1] == 1 &&
+ ((start[2] == 0 && start[3] == 5) || (start[2] == 1 && start[3] == 2))){
+ int dif = 0;
+
+ offset = (int)(start - *buf_p);
+ addbuffer(0, param, buf_p, bufsize_p, length_p);
+ start = *buf_p + offset;
+ searchcookie(param, (struct flap_header *) (start-6), state->leftinstate-(size+10), &dif, (struct tlv_header *) (start + size + 10), len - state->leftinstate);
+ *length_p += dif;
+ start += (state->leftinstate + dif);
+ len -= state->leftinstate;
+ state->leftinstate = 0;
+ state->state = ONBEGIN;
+ }
+ }
+ break;
+
+ case ONDATA:
+ size = (state->leftinstate > len)? len : state->leftinstate;
+
+ start += size;
+ len -= size;
+ state->leftinstate -= size;
+ if(!state->leftinstate) {
+ state->state = ONBEGIN;
+ }
+ break;
+ }
+ }
+
+ return CONTINUE;
+}
+
+static struct filter icqfilter = {
+ NULL,
+ "icqfilter",
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ *icq_srv,
+ *icq_clear,
+ NULL
+};
+
+
+static int readflap(struct clientparam * param, int direction, unsigned char *buf, int buflen){
+ int i, len;
+
+ struct flap_header *flap = (struct flap_header *)buf;
+
+ i = sockgetlinebuf(param, direction, buf, 6, EOF, conf.timeouts[STRING_L]);
+ if(i!=6) return 1;
+ if(flap->id != 0x2a) return 2;
+ len = ntohs(flap->size);
+ if(len > buflen-6) return 3;
+ i = sockgetlinebuf(param, direction, flap->data, len, EOF, conf.timeouts[STRING_S]);
+ if(len != i) return 4;
+ return 0;
+
+}
+
+#define flap ((struct flap_header *)buf)
+#define snack ((struct snack_header *)(buf+6))
+void * icqprchild(struct clientparam* param) {
+ int res;
+ unsigned char tmpsend[1024];
+ unsigned char *buf;
+ int i,j,len,len1;
+ int offset = 0;
+ int buflen = 16384;
+ LOGINTYPE logintype = ICQUNKNOWN;
+ int greet = 0;
+ struct icq_cookie *ic;
+ struct tlv_header *tlv;
+ struct icqstate mystate = {
+ ONBEGIN,
+ 0, 0, 0,
+ 0
+ };
+ struct filterp icqfilterp = {
+ &icqfilter,
+ (void *)&mystate
+ };
+ struct filterp **newfilters;
+ char handshake[] = {'\052', '\001', '\000', '\000', '\000', '\004', '\000', '\000', '\000', '\001'};
+
+
+
+ memcpy(tmpsend, handshake, 10);
+ if(socksend(param->clisock, tmpsend, 10, conf.timeouts[STRING_S])!=10) {RETURN (1101);}
+ buf = myalloc(65600);
+
+ if((res = readflap(param, CLIENT, buf, 1000))) {RETURN (1180 + res);}
+ if(ntohs(flap->size) == 4 || ntohs(flap->size) == 12){
+ tmpsend[2] = buf[2];
+ tmpsend[3] = buf[3];
+ greet = 1;
+ if(readflap(param, CLIENT, buf, 65550)) {RETURN (110);}
+ }
+ if(flap->chan != 1 && (flap->chan != 2 || snack->family != htonl(0x00170006))){
+ RETURN(1104);
+ }
+
+ len = ntohs(flap->size);
+ if(flap->chan == 1){
+ tlv = (struct tlv_header *)(flap->data + 4);
+ len -= 4;
+ }
+ else {
+ tlv = (struct tlv_header *)(flap->data + 10);
+ len -= 10;
+ }
+
+ for(; len >= (ntohs(tlv->size) + 4); len -= (ntohs(tlv->size) + 4), tlv = (struct tlv_header *)(tlv->data + ntohs(tlv->size))){
+ switch(ntohs(tlv->type)){
+ case 0x0001:
+ if(flap->chan == 2 && !logintype)logintype = ICQMD5;
+ if(!param->username){
+ param->username = myalloc(ntohs(tlv->size) + 1);
+ for(i=0, j=0; i < ntohs(tlv->size); i++){
+ if(!isspace(tlv->data[i]))param->username[j++]=tolower(tlv->data[i]);
+ }
+ param->username[j] = 0;
+ }
+ break;
+ case 0x0002:
+ logintype = ICQCLEAR;
+ break;
+ case 0x0006:
+ logintype = ICQCOOKIE;
+
+ for(ic = icq_cookies; ic; ic=ic->next){
+ if(ic->size && ic->size == tlv->size && !memcmp(ic->cookie, tlv->data, ntohs(tlv->size))){
+ parsehostname((char *)ic->connectstring, param, ntohs(param->srv->targetport));
+ if(!param->username && ic->id) param->username = mystrdup(ic->id);
+ break;
+ }
+ }
+ if(!ic) RETURN(1132);
+ break;
+ }
+ }
+ if(!logintype) RETURN(1133);
+ if(logintype != ICQCOOKIE) {
+ parsehostname((char *)param->srv->target, param, ntohs(param->srv->targetport));
+ }
+ param->operation = CONNECT;
+ res = (*param->srv->authfunc)(param);
+ if(res) {RETURN(res);}
+
+ if(greet){
+ if(socksend(param->remsock, tmpsend, 10, conf.timeouts[STRING_S])!=10) {RETURN (1105);}
+ param->statscli += 10;
+ }
+ if(readflap(param, SERVER, tmpsend, 1024)) {RETURN (1111);}
+ param->statssrv += (ntohs(((struct flap_header *)tmpsend)->size) + 6);
+ mystate.srvseq = ntohs(((struct flap_header *)tmpsend)->seq) + 1;
+ mystate.seq = 1;
+ len = ntohs(flap->size) + 6;
+ if((res=handledatfltcli(param, &buf, &buflen, offset, &len))!=PASS) RETURN(res);
+ if(socksend(param->remsock, buf+offset, len, conf.timeouts[STRING_S])!=(ntohs(flap->size)+6)) {RETURN (1106);}
+ offset = 0;
+ param->statscli += len;
+
+
+
+
+ if(logintype == ICQMD5) {
+ if(readflap(param, SERVER, buf, 65550)) {RETURN (1112);}
+ mystate.srvseq = ntohs(flap->seq) + 1;
+ flap->seq = htons(mystate.seq);
+ mystate.seq++;
+ len = ntohs(flap->size) + 6;
+ if((res=handledatfltsrv(param, &buf, &buflen, offset, &len))!=PASS) RETURN(res);
+ if(socksend(param->clisock, buf+offset, len, conf.timeouts[STRING_S])!=len) {RETURN (1113);}
+ offset = 0;
+
+ if(readflap(param, CLIENT, buf, 65550)) {RETURN (1114);}
+ len = ntohs(flap->size) + 6;
+ if((res=handledatfltcli(param, &buf, &buflen, offset, &len))!=PASS) RETURN(res);
+ if(socksend(param->remsock, buf+offset, len, conf.timeouts[STRING_S])!=len) {RETURN (1115);}
+ param->statscli += len;
+ offset = 0;
+ }
+ if(logintype != ICQCOOKIE) {
+ if(readflap(param, SERVER, buf, 65550)) {RETURN (1116);}
+ mystate.srvseq = ntohs(flap->seq) + 1;
+ flap->seq = htons(mystate.seq);
+ mystate.seq++;
+ len = ntohs(flap->size);
+
+ if(!param->username) {RETURN (1117);}
+ if(flap->chan == 1 || flap->chan == 4){
+ if(flap->data[0] == 0 && flap->data[1] == 0 && flap->data[2] == 0 && flap->data[3] == 1){
+ tlv = (struct tlv_header *)(flap->data + 4);
+ len -= 4;
+ }
+ else
+ tlv = (struct tlv_header *)(flap->data);
+ }
+ else {
+ tlv = (struct tlv_header *)(flap->data + 10);
+ len -= 10;
+ }
+
+ len1 = ntohs(flap->size);
+ if(searchcookie(param, flap, len, &len1, tlv, 0)){RETURN (1118);}
+
+ len = ntohs(flap->size) + 6;
+ if((res=handledatfltsrv(param, &buf, &buflen, offset, &len))!=PASS) RETURN(res);
+ if(socksend(param->clisock, buf+offset, len, conf.timeouts[STRING_S])!=len) {RETURN (1117);}
+ offset = 0;
+ }
+
+ param->ndatfilterssrv++;
+ newfilters = myalloc(param->ndatfilterssrv * sizeof(struct filterp *));
+ if(param->ndatfilterssrv > 1){
+ memcpy(newfilters, param->datfilterssrv, (param->ndatfilterssrv - 1) * sizeof(struct filterp *));
+ myfree(param->datfilterssrv);
+ }
+ param->datfilterssrv = newfilters;
+ newfilters[param->ndatfilterssrv - 1] = &icqfilterp;
+
+ param->res = sockmap(param, conf.timeouts[CONNECTION_L]);
+
+ param->ndatfilterssrv--;
+
+CLEANRET:
+
+
+ (*param->srv->logfunc)(param, NULL);
+ freeparam(param);
+ if(buf) myfree(buf);
+ return (NULL);
+}
+
+#ifdef WITHMAIN
+struct proxydef childdef = {
+ icqprchild,
+ 0,
+ 0,
+ S_ICQPR,
+ ""
+};
+#include "proxymain.c"
+#endif
diff --git a/src/libs/md4.c b/src/libs/md4.c
new file mode 100644
index 0000000..b128f07
--- /dev/null
+++ b/src/libs/md4.c
@@ -0,0 +1,315 @@
+/*
+ * md4c.c MD4 message-digest algorithm
+ *
+ * Version: $Id: md4.c,v 1.1 2010-11-11 11:32:32 v.dubrovin Exp $
+ *
+ * License to copy and use this software is granted provided that it
+ * is identified as the "RSA Data Security, Inc. MD4 Message-Digest
+ * Algorithm" in all material mentioning or referencing this software
+ * or this function.
+ *
+ * License is also granted to make and use derivative works provided
+ * that such works are identified as "derived from the RSA Data
+ * Security, Inc. MD4 Message-Digest Algorithm" in all material
+ * mentioning or referencing the derived work.
+ *
+ * RSA Data Security, Inc. makes no representations concerning either
+ * the merchantability of this software or the suitability of this
+ * software for any particular purpose. It is provided "as is"
+ * without express or implied warranty of any kind.
+ *
+ * These notices must be retained in any copies of any part of this
+ * documentation and/or software.
+ *
+ * Copyright 1990,1991,1992 RSA Data Security, Inc.
+ */
+
+
+#include "md4.h"
+
+/* Constants for MD4Transform routine.
+ */
+#define S11 3
+#define S12 7
+#define S13 11
+#define S14 19
+#define S21 3
+#define S22 5
+#define S23 9
+#define S24 13
+#define S31 3
+#define S32 9
+#define S33 11
+#define S34 15
+
+static void MD4Transform PROTO_LIST ((UINT4 [4], unsigned char [64]));
+static void Encode PROTO_LIST
+ ((unsigned char *, UINT4 *, unsigned int));
+static void Decode PROTO_LIST
+ ((UINT4 *, unsigned char *, unsigned int));
+static void MD4_memcpy PROTO_LIST ((POINTER, POINTER, unsigned int));
+static void MD4_memset PROTO_LIST ((POINTER, int, unsigned int));
+
+static unsigned char PADDING[64] = {
+ 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+};
+
+/* F, G and H are basic MD4 functions.
+ */
+#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
+#define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
+#define H(x, y, z) ((x) ^ (y) ^ (z))
+
+/* ROTATE_LEFT rotates x left n bits.
+ */
+#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
+
+/* FF, GG and HH are transformations for rounds 1, 2 and 3 */
+/* Rotation is separate from addition to prevent recomputation */
+
+#define FF(a, b, c, d, x, s) { \
+ (a) += F ((b), (c), (d)) + (x); \
+ (a) = ROTATE_LEFT ((a), (s)); \
+ }
+#define GG(a, b, c, d, x, s) { \
+ (a) += G ((b), (c), (d)) + (x) + (UINT4)0x5a827999; \
+ (a) = ROTATE_LEFT ((a), (s)); \
+ }
+#define HH(a, b, c, d, x, s) { \
+ (a) += H ((b), (c), (d)) + (x) + (UINT4)0x6ed9eba1; \
+ (a) = ROTATE_LEFT ((a), (s)); \
+ }
+
+void md4_calc(output, input, inlen)
+unsigned char *output;
+unsigned char *input; /* input block */
+unsigned int inlen; /* length of input block */
+{
+ MD4_CTX context;
+
+ MD4Init(&context);
+ MD4Update(&context, input, inlen);
+ MD4Final(output, &context);
+}
+
+/* MD4 initialization. Begins an MD4 operation, writing a new context.
+ */
+void MD4Init (context)
+MD4_CTX *context; /* context */
+{
+ context->count[0] = context->count[1] = 0;
+
+ /* Load magic initialization constants.
+ */
+ context->state[0] = 0x67452301;
+ context->state[1] = 0xefcdab89;
+ context->state[2] = 0x98badcfe;
+ context->state[3] = 0x10325476;
+}
+
+/* MD4 block update operation. Continues an MD4 message-digest
+ operation, processing another message block, and updating the
+ context.
+ */
+void MD4Update (context, input, inputLen)
+MD4_CTX *context; /* context */
+unsigned char *input; /* input block */
+unsigned int inputLen; /* length of input block */
+{
+ unsigned int i, index, partLen;
+
+ /* Compute number of bytes mod 64 */
+ index = (unsigned int)((context->count[0] >> 3) & 0x3F);
+ /* Update number of bits */
+ if ((context->count[0] += ((UINT4)inputLen << 3))
+ < ((UINT4)inputLen << 3))
+ context->count[1]++;
+ context->count[1] += ((UINT4)inputLen >> 29);
+
+ partLen = 64 - index;
+
+ /* Transform as many times as possible.
+ */
+ if (inputLen >= partLen) {
+ MD4_memcpy
+ ((POINTER)&context->buffer[index], (POINTER)input, partLen);
+ MD4Transform (context->state, context->buffer);
+
+ for (i = partLen; i + 63 < inputLen; i += 64)
+ MD4Transform (context->state, &input[i]);
+
+ index = 0;
+ }
+ else
+ i = 0;
+
+ /* Buffer remaining input */
+ MD4_memcpy
+ ((POINTER)&context->buffer[index], (POINTER)&input[i],
+ inputLen-i);
+}
+
+/* MD4 finalization. Ends an MD4 message-digest operation, writing the
+ the message digest and zeroizing the context.
+ */
+void MD4Final (digest, context)
+unsigned char digest[16]; /* message digest */
+MD4_CTX *context; /* context */
+{
+ unsigned char bits[8];
+ unsigned int index, padLen;
+
+ /* Save number of bits */
+ Encode (bits, context->count, 8);
+
+ /* Pad out to 56 mod 64.
+ */
+ index = (unsigned int)((context->count[0] >> 3) & 0x3f);
+ padLen = (index < 56) ? (56 - index) : (120 - index);
+ MD4Update (context, PADDING, padLen);
+
+ /* Append length (before padding) */
+ MD4Update (context, bits, 8);
+ /* Store state in digest */
+ Encode (digest, context->state, 16);
+
+ /* Zeroize sensitive information.
+ */
+ MD4_memset ((POINTER)context, 0, sizeof (*context));
+}
+
+/* MD4 basic transformation. Transforms state based on block.
+ */
+static void MD4Transform (state, block)
+UINT4 state[4];
+unsigned char block[64];
+{
+ UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
+
+ Decode (x, block, 64);
+
+ /* Round 1 */
+ FF (a, b, c, d, x[ 0], S11); /* 1 */
+ FF (d, a, b, c, x[ 1], S12); /* 2 */
+ FF (c, d, a, b, x[ 2], S13); /* 3 */
+ FF (b, c, d, a, x[ 3], S14); /* 4 */
+ FF (a, b, c, d, x[ 4], S11); /* 5 */
+ FF (d, a, b, c, x[ 5], S12); /* 6 */
+ FF (c, d, a, b, x[ 6], S13); /* 7 */
+ FF (b, c, d, a, x[ 7], S14); /* 8 */
+ FF (a, b, c, d, x[ 8], S11); /* 9 */
+ FF (d, a, b, c, x[ 9], S12); /* 10 */
+ FF (c, d, a, b, x[10], S13); /* 11 */
+ FF (b, c, d, a, x[11], S14); /* 12 */
+ FF (a, b, c, d, x[12], S11); /* 13 */
+ FF (d, a, b, c, x[13], S12); /* 14 */
+ FF (c, d, a, b, x[14], S13); /* 15 */
+ FF (b, c, d, a, x[15], S14); /* 16 */
+
+ /* Round 2 */
+ GG (a, b, c, d, x[ 0], S21); /* 17 */
+ GG (d, a, b, c, x[ 4], S22); /* 18 */
+ GG (c, d, a, b, x[ 8], S23); /* 19 */
+ GG (b, c, d, a, x[12], S24); /* 20 */
+ GG (a, b, c, d, x[ 1], S21); /* 21 */
+ GG (d, a, b, c, x[ 5], S22); /* 22 */
+ GG (c, d, a, b, x[ 9], S23); /* 23 */
+ GG (b, c, d, a, x[13], S24); /* 24 */
+ GG (a, b, c, d, x[ 2], S21); /* 25 */
+ GG (d, a, b, c, x[ 6], S22); /* 26 */
+ GG (c, d, a, b, x[10], S23); /* 27 */
+ GG (b, c, d, a, x[14], S24); /* 28 */
+ GG (a, b, c, d, x[ 3], S21); /* 29 */
+ GG (d, a, b, c, x[ 7], S22); /* 30 */
+ GG (c, d, a, b, x[11], S23); /* 31 */
+ GG (b, c, d, a, x[15], S24); /* 32 */
+
+ /* Round 3 */
+ HH (a, b, c, d, x[ 0], S31); /* 33 */
+ HH (d, a, b, c, x[ 8], S32); /* 34 */
+ HH (c, d, a, b, x[ 4], S33); /* 35 */
+ HH (b, c, d, a, x[12], S34); /* 36 */
+ HH (a, b, c, d, x[ 2], S31); /* 37 */
+ HH (d, a, b, c, x[10], S32); /* 38 */
+ HH (c, d, a, b, x[ 6], S33); /* 39 */
+ HH (b, c, d, a, x[14], S34); /* 40 */
+ HH (a, b, c, d, x[ 1], S31); /* 41 */
+ HH (d, a, b, c, x[ 9], S32); /* 42 */
+ HH (c, d, a, b, x[ 5], S33); /* 43 */
+ HH (b, c, d, a, x[13], S34); /* 44 */
+ HH (a, b, c, d, x[ 3], S31); /* 45 */
+ HH (d, a, b, c, x[11], S32); /* 46 */
+ HH (c, d, a, b, x[ 7], S33); /* 47 */
+ HH (b, c, d, a, x[15], S34); /* 48 */
+
+ state[0] += a;
+ state[1] += b;
+ state[2] += c;
+ state[3] += d;
+
+ /* Zeroize sensitive information.
+ */
+ MD4_memset ((POINTER)x, 0, sizeof (x));
+}
+
+/* Encodes input (UINT4) into output (unsigned char). Assumes len is
+ a multiple of 4.
+ */
+static void Encode (output, input, len)
+unsigned char *output;
+UINT4 *input;
+unsigned int len;
+{
+ unsigned int i, j;
+
+ for (i = 0, j = 0; j < len; i++, j += 4) {
+ output[j] = (unsigned char)(input[i] & 0xff);
+ output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
+ output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
+ output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
+ }
+}
+
+/* Decodes input (unsigned char) into output (UINT4). Assumes len is
+ a multiple of 4.
+ */
+static void Decode (output, input, len)
+
+UINT4 *output;
+unsigned char *input;
+unsigned int len;
+{
+ unsigned int i, j;
+
+ for (i = 0, j = 0; j < len; i++, j += 4)
+ output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
+ (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
+}
+
+/* Note: Replace "for loop" with standard memcpy if possible.
+ */
+static void MD4_memcpy (output, input, len)
+POINTER output;
+POINTER input;
+unsigned int len;
+{
+ unsigned int i;
+
+ for (i = 0; i < len; i++)
+ output[i] = input[i];
+}
+
+/* Note: Replace "for loop" with standard memset if possible.
+ */
+static void MD4_memset (output, value, len)
+POINTER output;
+int value;
+unsigned int len;
+{
+ unsigned int i;
+
+ for (i = 0; i < len; i++)
+ ((char *)output)[i] = (char)value;
+}
diff --git a/src/libs/md4.h b/src/libs/md4.h
new file mode 100644
index 0000000..de07d79
--- /dev/null
+++ b/src/libs/md4.h
@@ -0,0 +1,83 @@
+#ifndef _LRAD_MD4_H
+#define _LRAD_MD4_H
+
+#ifndef _LRAD_PROTO_H
+#define _LRAD_PROTO_H
+/* GLOBAL.H - RSAREF types and constants
+ */
+
+/* PROTOTYPES should be set to one if and only if the compiler supports
+ function argument prototyping.
+ The following makes PROTOTYPES default to 0 if it has not already
+ been defined with C compiler flags.
+ */
+#ifndef PROTOTYPES
+# if __STDC__
+# define PROTOTYPES 1
+# else
+# define PROTOTYPES 0
+# endif
+#endif
+
+/* POINTER defines a generic pointer type */
+typedef unsigned char *POINTER;
+#define _POINTER_T
+
+/* UINT2 defines a two byte word */
+typedef unsigned short int UINT2;
+#define _UINT2_T
+
+/* UINT4 defines a four byte word */
+typedef unsigned int UINT4;
+#define _UINT4_T
+
+/* PROTO_LIST is defined depending on how PROTOTYPES is defined above.
+ If using PROTOTYPES, then PROTO_LIST returns the list, otherwise it
+ returns an empty list.
+ */
+#if PROTOTYPES
+#define PROTO_LIST(list) list
+#else
+#define PROTO_LIST(list) ()
+#endif
+#endif /* _LRAD_PROTO_H */
+
+/* MD4.H - header file for MD4C.C
+ */
+
+/* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
+ rights reserved.
+
+ License to copy and use this software is granted provided that it
+ is identified as the "RSA Data Security, Inc. MD4 Message-Digest
+ Algorithm" in all material mentioning or referencing this software
+ or this function.
+
+ License is also granted to make and use derivative works provided
+ that such works are identified as "derived from the RSA Data
+ Security, Inc. MD4 Message-Digest Algorithm" in all material
+ mentioning or referencing the derived work.
+
+ RSA Data Security, Inc. makes no representations concerning either
+ the merchantability of this software or the suitability of this
+ software for any particular purpose. It is provided "as is"
+ without express or implied warranty of any kind.
+
+ These notices must be retained in any copies of any part of this
+ documentation and/or software.
+ */
+
+/* MD4 context. */
+typedef struct {
+ UINT4 state[4]; /* state (ABCD) */
+ UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */
+ unsigned char buffer[64]; /* input buffer */
+} MD4_CTX;
+
+void md4_calc (unsigned char *, unsigned char *, unsigned int);
+void MD4Init PROTO_LIST ((MD4_CTX *));
+void MD4Update PROTO_LIST
+ ((MD4_CTX *, unsigned char *, unsigned int));
+void MD4Final PROTO_LIST ((unsigned char [16], MD4_CTX *));
+
+#endif /* _LRAD_MD4_H */
diff --git a/src/libs/md5.c b/src/libs/md5.c
new file mode 100644
index 0000000..f80abcb
--- /dev/null
+++ b/src/libs/md5.c
@@ -0,0 +1,345 @@
+/* MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
+ */
+
+/* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
+rights reserved.
+
+License to copy and use this software is granted provided that it
+is identified as the "RSA Data Security, Inc. MD5 Message-Digest
+Algorithm" in all material mentioning or referencing this software
+or this function.
+
+License is also granted to make and use derivative works provided
+that such works are identified as "derived from the RSA Data
+Security, Inc. MD5 Message-Digest Algorithm" in all material
+mentioning or referencing the derived work.
+
+RSA Data Security, Inc. makes no representations concerning either
+the merchantability of this software or the suitability of this
+software for any particular purpose. It is provided "as is"
+without express or implied warranty of any kind.
+
+These notices must be retained in any copies of any part of this
+documentation and/or software.
+ */
+
+#include "md5.h"
+
+/* Constants for MD5Transform routine.
+ */
+#define S11 7
+#define S12 12
+#define S13 17
+#define S14 22
+#define S21 5
+#define S22 9
+#define S23 14
+#define S24 20
+#define S31 4
+#define S32 11
+#define S33 16
+#define S34 23
+#define S41 6
+#define S42 10
+#define S43 15
+#define S44 21
+
+void librad_md5_calc(unsigned char *output, unsigned char *input,
+ unsigned int inputlen);
+static void MD5Transform PROTO_LIST ((UINT4 [4], const unsigned char [64]));
+static void Encode PROTO_LIST
+ ((unsigned char *, UINT4 *, unsigned int));
+static void Decode PROTO_LIST
+ ((UINT4 *, const unsigned char *, unsigned int));
+static void MD5_memcpy PROTO_LIST ((POINTER, CONSTPOINTER, unsigned int));
+static void MD5_memset PROTO_LIST ((POINTER, int, unsigned int));
+
+static const unsigned char PADDING[64] = {
+ 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+};
+
+/* F, G, H and I are basic MD5 functions.
+ */
+#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
+#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
+#define H(x, y, z) ((x) ^ (y) ^ (z))
+#define I(x, y, z) ((y) ^ ((x) | (~z)))
+
+/* ROTATE_LEFT rotates x left n bits.
+ */
+#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
+
+/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
+Rotation is separate from addition to prevent recomputation.
+ */
+#define FF(a, b, c, d, x, s, ac) { \
+ (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
+ (a) = ROTATE_LEFT ((a), (s)); \
+ (a) += (b); \
+ }
+#define GG(a, b, c, d, x, s, ac) { \
+ (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
+ (a) = ROTATE_LEFT ((a), (s)); \
+ (a) += (b); \
+ }
+#define HH(a, b, c, d, x, s, ac) { \
+ (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
+ (a) = ROTATE_LEFT ((a), (s)); \
+ (a) += (b); \
+ }
+#define II(a, b, c, d, x, s, ac) { \
+ (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
+ (a) = ROTATE_LEFT ((a), (s)); \
+ (a) += (b); \
+ }
+
+void librad_md5_calc(unsigned char *output, unsigned char *input,
+ unsigned int inlen)
+{
+ MD5_CTX context;
+
+ MD5Init(&context);
+ MD5Update(&context, input, inlen);
+ MD5Final(output, &context);
+}
+
+/* MD5 initialization. Begins an MD5 operation, writing a new context.
+ */
+void MD5Init (context)
+MD5_CTX *context; /* context */
+{
+ context->count[0] = context->count[1] = 0;
+ /* Load magic initialization constants.
+*/
+ context->state[0] = 0x67452301;
+ context->state[1] = 0xefcdab89;
+ context->state[2] = 0x98badcfe;
+ context->state[3] = 0x10325476;
+}
+
+/* MD5 block update operation. Continues an MD5 message-digest
+ operation, processing another message block, and updating the
+ context.
+ */
+void MD5Update (context, input, inputLen)
+MD5_CTX *context; /* context */
+const unsigned char *input; /* input block */
+unsigned int inputLen; /* length of input block */
+{
+ unsigned int i, index, partLen;
+
+ /* Compute number of bytes mod 64 */
+ index = (unsigned int)((context->count[0] >> 3) & 0x3F);
+
+ /* Update number of bits */
+ if ((context->count[0] += ((UINT4)inputLen << 3))
+ < ((UINT4)inputLen << 3))
+ context->count[1]++;
+ context->count[1] += ((UINT4)inputLen >> 29);
+
+ partLen = 64 - index;
+
+ /* Transform as many times as possible.
+*/
+ if (inputLen >= partLen) {
+ MD5_memcpy
+ ((POINTER)&context->buffer[index], (CONSTPOINTER)input, partLen);
+ MD5Transform (context->state, context->buffer);
+
+ for (i = partLen; i + 63 < inputLen; i += 64)
+ MD5Transform (context->state, &input[i]);
+
+ index = 0;
+ }
+ else
+ i = 0;
+
+ /* Buffer remaining input */
+ MD5_memcpy
+ ((POINTER)&context->buffer[index], (CONSTPOINTER)&input[i],
+ inputLen-i);
+}
+
+/* MD5 finalization. Ends an MD5 message-digest operation, writing the
+ the message digest and zeroizing the context.
+ */
+void MD5Final (digest, context)
+unsigned char digest[16]; /* message digest */
+MD5_CTX *context; /* context */
+{
+ unsigned char bits[8];
+ unsigned int index, padLen;
+
+ /* Save number of bits */
+ Encode (bits, context->count, 8);
+
+ /* Pad out to 56 mod 64.
+*/
+ index = (unsigned int)((context->count[0] >> 3) & 0x3f);
+ padLen = (index < 56) ? (56 - index) : (120 - index);
+ MD5Update (context, PADDING, padLen);
+
+ /* Append length (before padding) */
+ MD5Update (context, bits, 8);
+
+ /* Store state in digest */
+ Encode (digest, context->state, 16);
+
+ /* Zeroize sensitive information.
+*/
+ MD5_memset ((POINTER)context, 0, sizeof (*context));
+}
+
+/* MD5 basic transformation. Transforms state based on block.
+ */
+static void MD5Transform (state, block)
+UINT4 state[4];
+const unsigned char block[64];
+{
+ UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
+
+ Decode (x, block, 64);
+
+ /* Round 1 */
+ FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
+ FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
+ FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
+ FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
+ FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
+ FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
+ FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
+ FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
+ FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
+ FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
+ FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
+ FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
+ FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
+ FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
+ FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
+ FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
+
+ /* Round 2 */
+ GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
+ GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
+ GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
+ GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
+ GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
+ GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
+ GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
+ GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
+ GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
+ GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
+ GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
+ GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
+ GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
+ GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
+ GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
+ GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
+
+ /* Round 3 */
+ HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
+ HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
+ HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
+ HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
+ HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
+ HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
+ HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
+ HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
+ HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
+ HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
+ HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
+ HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
+ HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
+ HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
+ HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
+ HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
+
+ /* Round 4 */
+ II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
+ II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
+ II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
+ II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
+ II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
+ II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
+ II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
+ II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
+ II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
+ II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
+ II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
+ II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
+ II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
+ II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
+ II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
+ II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
+
+ state[0] += a;
+ state[1] += b;
+ state[2] += c;
+ state[3] += d;
+
+ /* Zeroize sensitive information.
+*/
+ MD5_memset ((POINTER)x, 0, sizeof (x));
+}
+
+/* Encodes input (UINT4) into output (unsigned char). Assumes len is
+ a multiple of 4.
+ */
+static void Encode (output, input, len)
+unsigned char *output;
+UINT4 *input;
+unsigned int len;
+{
+ unsigned int i, j;
+
+ for (i = 0, j = 0; j < len; i++, j += 4) {
+ output[j] = (unsigned char)(input[i] & 0xff);
+ output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
+ output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
+ output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
+ }
+}
+
+/* Decodes input (unsigned char) into output (UINT4). Assumes len is
+ a multiple of 4.
+ */
+static void Decode (output, input, len)
+UINT4 *output;
+const unsigned char *input;
+unsigned int len;
+{
+ unsigned int i, j;
+
+ for (i = 0, j = 0; j < len; i++, j += 4)
+ output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
+ (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
+}
+
+/* Note: Replace "for loop" with standard memcpy if possible.
+ */
+
+static void MD5_memcpy (output, input, len)
+POINTER output;
+CONSTPOINTER input;
+unsigned int len;
+{
+ unsigned int i;
+
+ for (i = 0; i < len; i++)
+ output[i] = input[i];
+}
+
+/* Note: Replace "for loop" with standard memset if possible.
+ */
+static void MD5_memset (output, value, len)
+POINTER output;
+int value;
+unsigned int len;
+{
+ unsigned int i;
+
+ for (i = 0; i < len; i++)
+ ((char *)output)[i] = (char)value;
+}
diff --git a/src/libs/md5.h b/src/libs/md5.h
new file mode 100644
index 0000000..9209cde
--- /dev/null
+++ b/src/libs/md5.h
@@ -0,0 +1,94 @@
+#ifndef _LRAD_MD5_H
+#define _LRAD_MD5_H
+
+#ifndef _LRAD_PROTO_H
+#define _LRAD_PROTO_H
+/* GLOBAL.H - RSAREF types and constants
+ */
+
+/* PROTOTYPES should be set to one if and only if the compiler supports
+ function argument prototyping.
+ The following makes PROTOTYPES default to 0 if it has not already
+ been defined with C compiler flags.
+ */
+#ifndef PROTOTYPES
+# if __STDC__
+# define PROTOTYPES 1
+# else
+# define PROTOTYPES 0
+# endif
+#endif
+
+/* POINTER defines a generic pointer type */
+#ifndef _POINTER_T
+typedef unsigned char *POINTER;
+#endif
+typedef const unsigned char *CONSTPOINTER;
+
+/* UINT2 defines a two byte word */
+#ifndef _UINT2_T
+typedef unsigned short int UINT2;
+#endif
+
+/* UINT4 defines a four byte word */
+#ifndef _UINT4_T
+typedef unsigned int UINT4;
+#endif
+
+/* PROTO_LIST is defined depending on how PROTOTYPES is defined above.
+ If using PROTOTYPES, then PROTO_LIST returns the list, otherwise it
+ returns an empty list.
+ */
+#if PROTOTYPES
+#define PROTO_LIST(list) list
+#else
+#define PROTO_LIST(list) ()
+#endif
+#endif /* _LRAD_PROTO_H */
+
+/*
+ * FreeRADIUS defines to ensure globally unique MD5 function names,
+ * so that we don't pick up vendor-specific broken MD5 libraries.
+ */
+#define MD5_CTX librad_MD5_CTX
+#define MD5Init librad_MD5Init
+#define MD5Update librad_MD5Update
+#define MD5Final librad_MD5Final
+
+/* MD5.H - header file for MD5C.C
+ */
+
+/* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
+rights reserved.
+
+License to copy and use this software is granted provided that it
+is identified as the "RSA Data Security, Inc. MD5 Message-Digest
+Algorithm" in all material mentioning or referencing this software
+or this function.
+
+License is also granted to make and use derivative works provided
+that such works are identified as "derived from the RSA Data
+Security, Inc. MD5 Message-Digest Algorithm" in all material
+mentioning or referencing the derived work.
+
+RSA Data Security, Inc. makes no representations concerning either
+the merchantability of this software or the suitability of this
+software for any particular purpose. It is provided "as is"
+without express or implied warranty of any kind.
+
+These notices must be retained in any copies of any part of this
+documentation and/or software.
+ */
+
+/* MD5 context. */
+typedef struct {
+ UINT4 state[4]; /* state (ABCD) */
+ UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */
+ unsigned char buffer[64]; /* input buffer */
+} MD5_CTX;
+
+void MD5Init PROTO_LIST ((MD5_CTX *));
+void MD5Update PROTO_LIST
+ ((MD5_CTX *, const unsigned char *, unsigned int));
+void MD5Final PROTO_LIST ((unsigned char [16], MD5_CTX *));
+#endif /* _LRAD_MD5_H */
diff --git a/src/libs/regex.c b/src/libs/regex.c
new file mode 100644
index 0000000..82ae70a
--- /dev/null
+++ b/src/libs/regex.c
@@ -0,0 +1,3821 @@
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+
+#include "regex.h"
+
+/* utility definitions */
+#ifdef _POSIX2_RE_DUP_MAX
+#define DUPMAX _POSIX2_RE_DUP_MAX
+#else
+#define DUPMAX 255
+#endif
+#define INFINITY (DUPMAX + 1)
+#define NC (CHAR_MAX - CHAR_MIN + 1)
+typedef unsigned char uch;
+
+/* for old systems with bcopy() but no memmove() */
+#ifdef USEBCOPY
+#define memmove(d, s, c) bcopy(s, d, c)
+#endif
+
+#define MAGIC1 ((('r'^0200)<<8) | 'e')
+
+/*
+ * The internal representation is a *strip*, a sequence of
+ * operators ending with an endmarker. (Some terminology etc. is a
+ * historical relic of earlier versions which used multiple strips.)
+ * Certain oddities in the representation are there to permit running
+ * the machinery backwards; in particular, any deviation from sequential
+ * flow must be marked at both its source and its destination. Some
+ * fine points:
+ *
+ * - OPLUS_ and O_PLUS are *inside* the loop they create.
+ * - OQUEST_ and O_QUEST are *outside* the bypass they create.
+ * - OCH_ and O_CH are *outside* the multi-way branch they create, while
+ * OOR1 and OOR2 are respectively the end and the beginning of one of
+ * the branches. Note that there is an implicit OOR2 following OCH_
+ * and an implicit OOR1 preceding O_CH.
+ *
+ * In state representations, an operator's bit is on to signify a state
+ * immediately *preceding* "execution" of that operator.
+ */
+typedef long sop; /* strip operator */
+typedef long sopno;
+#define OPRMASK 0x7c000000
+#define OPDMASK 0x03ffffff
+#define OPSHIFT (26)
+#define OP(n) ((n)&OPRMASK)
+#define OPND(n) ((n)&OPDMASK)
+#define SOP(op, opnd) ((op)|(opnd))
+/* operators meaning operand */
+/* (back, fwd are offsets) */
+#define OEND (1< uch [csetsize] */
+ uch mask; /* bit within array */
+ uch hash; /* hash code */
+ size_t smultis;
+ char *multis; /* -> char[smulti] ab\0cd\0ef\0\0 */
+} cset;
+/* note that CHadd and CHsub are unsafe, and CHIN doesn't yield 0/1 */
+#define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c))
+#define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
+#define CHIN(cs, c) ((cs)->ptr[(uch)(c)] & (cs)->mask)
+#define MCadd(p, cs, cp) mcadd(p, cs, cp) /* regcomp() internal fns */
+
+/* stuff for character categories */
+typedef unsigned char cat_t;
+
+/*
+ * main compiled-expression structure
+ */
+struct re_guts {
+ int magic;
+# define MAGIC2 ((('R'^0200)<<8)|'E')
+ sop *strip; /* malloced area for strip */
+ int csetsize; /* number of bits in a cset vector */
+ int ncsets; /* number of csets in use */
+ cset *sets; /* -> cset [ncsets] */
+ uch *setbits; /* -> uch[csetsize][ncsets/CHAR_BIT] */
+ int cflags; /* copy of regcomp() cflags argument */
+ sopno nstates; /* = number of sops */
+ sopno firststate; /* the initial OEND (normally 0) */
+ sopno laststate; /* the final OEND */
+ int iflags; /* internal flags */
+# define USEBOL 01 /* used ^ */
+# define USEEOL 02 /* used $ */
+# define BAD 04 /* something wrong */
+ int nbol; /* number of ^ used */
+ int neol; /* number of $ used */
+ int ncategories; /* how many character categories */
+ cat_t *categories; /* ->catspace[-CHAR_MIN] */
+ char *must; /* match must contain this string */
+ int mlen; /* length of must */
+ size_t nsub; /* copy of re_nsub */
+ int backrefs; /* does it use back references? */
+ sopno nplus; /* how deep does it nest +s? */
+ /* catspace must be last */
+ cat_t catspace[1]; /* actually [NC] */
+};
+
+/* misc utilities */
+#define OUT (CHAR_MAX+1) /* a non-character value */
+#define ISWORD(c) (isalnum(c) || (c) == '_')
+
+
+/* character-class table */
+static struct cclass {
+ char *name;
+ char *chars;
+ char *multis;
+} cclasses[] = {
+ {"alnum","ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",""},
+ {"alpha", "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz", ""},
+ {"blank"," \t", ""},
+ {"cntrl","\007\b\t\n\v\f\r\1\2\3\4\5\6\16\17\20\21\22\23\24\25\26\27\30\31\32\33\34\35\36\37\177",""},
+ {"digit","0123456789",""},
+ {"graph","ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~",""},
+ {"lower","abcdefghijklmnopqrstuvwxyz",""},
+ {"print","ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ ",""},
+ {"punct","!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~",""},
+ {"space","\t\n\v\f\r ", ""},
+ {"upper","ABCDEFGHIJKLMNOPQRSTUVWXYZ",""},
+ {"xdigit","0123456789ABCDEFabcdef",""},
+ {NULL,NULL,""}
+};
+
+/* character-name table */
+static struct cname {
+ char *name;
+ char code;
+} cnames[] = {
+ {"NUL", '\0'},
+ {"SOH", '\001'},
+ {"STX", '\002'},
+ {"ETX", '\003'},
+ {"EOT", '\004'},
+ {"ENQ", '\005'},
+ {"ACK", '\006'},
+ {"BEL", '\007'},
+ {"alert", '\007'},
+ {"BS", '\010'},
+ {"backspace", '\b'},
+ {"HT", '\011'},
+ {"tab", '\t'},
+ {"LF", '\012'},
+ {"newline", '\n'},
+ {"VT", '\013'},
+ {"vertical-tab", '\v'},
+ {"FF", '\014'},
+ {"form-feed", '\f'},
+ {"CR", '\015'},
+ {"carriage-return", '\r'},
+ {"SO", '\016'},
+ {"SI", '\017'},
+ {"DLE", '\020'},
+ {"DC1", '\021'},
+ {"DC2", '\022'},
+ {"DC3", '\023'},
+ {"DC4", '\024'},
+ {"NAK", '\025'},
+ {"SYN", '\026'},
+ {"ETB", '\027'},
+ {"CAN", '\030'},
+ {"EM", '\031'},
+ {"SUB", '\032'},
+ {"ESC", '\033'},
+ {"IS4", '\034'},
+ {"FS", '\034'},
+ {"IS3", '\035'},
+ {"GS", '\035'},
+ {"IS2", '\036'},
+ {"RS", '\036'},
+ {"IS1", '\037'},
+ {"US", '\037'},
+ {"space", ' '},
+ {"exclamation-mark", '!'},
+ {"quotation-mark", '"'},
+ {"number-sign", '#'},
+ {"dollar-sign", '$'},
+ {"percent-sign", '%'},
+ {"ampersand", '&'},
+ {"apostrophe", '\''},
+ {"left-parenthesis", '('},
+ {"right-parenthesis", ')'},
+ {"asterisk", '*'},
+ {"plus-sign", '+'},
+ {"comma", ','},
+ {"hyphen", '-'},
+ {"hyphen-minus", '-'},
+ {"period", '.'},
+ {"full-stop", '.'},
+ {"slash", '/'},
+ {"solidus", '/'},
+ {"zero", '0'},
+ {"one", '1'},
+ {"two", '2'},
+ {"three", '3'},
+ {"four", '4'},
+ {"five", '5'},
+ {"six", '6'},
+ {"seven", '7'},
+ {"eight", '8'},
+ {"nine", '9'},
+ {"colon", ':'},
+ {"semicolon", ';'},
+ {"less-than-sign", '<'},
+ {"equals-sign", '='},
+ {"greater-than-sign", '>'},
+ {"question-mark", '?'},
+ {"commercial-at", '@'},
+ {"left-square-bracket", '['},
+ {"backslash", '\\'},
+ {"reverse-solidus", '\\'},
+ {"right-square-bracket", ']'},
+ {"circumflex", '^'},
+ {"circumflex-accent", '^'},
+ {"underscore", '_'},
+ {"low-line", '_'},
+ {"grave-accent", '`'},
+ {"left-brace", '{'},
+ {"left-curly-bracket", '{'},
+ {"vertical-line", '|'},
+ {"right-brace", '}'},
+ {"right-curly-bracket", '}'},
+ {"tilde", '~'},
+ {"DEL", '\177'},
+ {NULL, 0}
+};
+
+
+/*
+ * parse structure, passed up and down to avoid global variables and
+ * other clumsinesses
+ */
+struct parse {
+ char *next; /* next character in RE */
+ char *end; /* end of string (-> NUL normally) */
+ int error; /* has an error been seen? */
+ sop *strip; /* malloced strip */
+ sopno ssize; /* malloced strip size (allocated) */
+ sopno slen; /* malloced strip length (used) */
+ int ncsalloc; /* number of csets allocated */
+ struct re_guts *g;
+# define NPAREN 10 /* we need to remember () 1-9 for back refs */
+ sopno pbegin[NPAREN]; /* -> ( ([0] unused) */
+ sopno pend[NPAREN]; /* -> ) ([0] unused) */
+};
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+static void p_ere(register struct parse *p, int stop);
+static void p_ere_exp(register struct parse *p);
+static void p_str(register struct parse *p);
+static void p_bre(register struct parse *p, register int end1, register int end2);
+static int p_simp_re(register struct parse *p, int starordinary);
+static int p_count(register struct parse *p);
+static void p_bracket(register struct parse *p);
+static void p_b_term(register struct parse *p, register cset *cs);
+static void p_b_cclass(register struct parse *p, register cset *cs);
+static void p_b_eclass(register struct parse *p, register cset *cs);
+static char p_b_symbol(register struct parse *p);
+static char p_b_coll_elem(register struct parse *p, int endc);
+static char othercase(int ch);
+static void bothcases(register struct parse *p, int ch);
+static void ordinary(register struct parse *p, register int ch);
+static void nonnewline(register struct parse *p);
+static void repeat(register struct parse *p, sopno start, int from, int to);
+static int seterr(register struct parse *p, int e);
+static cset *allocset(register struct parse *p);
+static void freeset(register struct parse *p, register cset *cs);
+static int freezeset(register struct parse *p, register cset *cs);
+static int firstch(register struct parse *p, register cset *cs);
+static int nch(register struct parse *p, register cset *cs);
+static void mcadd(register struct parse *p, register cset *cs, register char *cp);
+static void mcinvert(register struct parse *p, register cset *cs);
+static void mccase(register struct parse *p, register cset *cs);
+static int isinsets(register struct re_guts *g, int c);
+static int samesets(register struct re_guts *g, int c1, int c2);
+static void categorize(struct parse *p, register struct re_guts *g);
+static sopno dupl(register struct parse *p, sopno start, sopno finish);
+static void doemit(register struct parse *p, sop op, size_t opnd);
+static void doinsert(register struct parse *p, sop op, size_t opnd, sopno pos);
+static void dofwd(register struct parse *p, sopno pos, sop value);
+static void enlarge(register struct parse *p, sopno size);
+static void stripsnug(register struct parse *p, register struct re_guts *g);
+static void findmust(register struct parse *p, register struct re_guts *g);
+static sopno pluscount(register struct parse *p, register struct re_guts *g);
+
+#ifdef __cplusplus
+}
+#endif
+
+static char nuls[10]; /* place to point scanner in event of error */
+
+/*
+ * macros for use with parse structure
+ * BEWARE: these know that the parse structure is named `p' !!!
+ */
+#define PEEK() (*p->next)
+#define PEEK2() (*(p->next+1))
+#define MORE() (p->next < p->end)
+#define MORE2() (p->next+1 < p->end)
+#define SEE(c) (MORE() && PEEK() == (c))
+#define SEETWO(a, b) (MORE() && MORE2() && PEEK() == (a) && PEEK2() == (b))
+#define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
+#define EATTWO(a, b) ((SEETWO(a, b)) ? (NEXT2(), 1) : 0)
+#define NEXT() (p->next++)
+#define NEXT2() (p->next += 2)
+#define NEXTn(n) (p->next += (n))
+#define GETNEXT() (*p->next++)
+#define SETERROR(e) seterr(p, (e))
+#define REQUIRE(co, e) ((co) || SETERROR(e))
+#define MUSTSEE(c, e) (REQUIRE(MORE() && PEEK() == (c), e))
+#define MUSTEAT(c, e) (REQUIRE(MORE() && GETNEXT() == (c), e))
+#define MUSTNOTSEE(c, e) (REQUIRE(!MORE() || PEEK() != (c), e))
+#define EMIT(op, sopnd) doemit(p, (sop)(op), (size_t)(sopnd))
+#define INSERT(op, pos) doinsert(p, (sop)(op), HERE()-(pos)+1, pos)
+#define AHEAD(pos) dofwd(p, pos, HERE()-(pos))
+#define ASTERN(sop, pos) EMIT(sop, HERE()-pos)
+#define HERE() (p->slen)
+#define THERE() (p->slen - 1)
+#define THERETHERE() (p->slen - 2)
+#define DROP(n) (p->slen -= (n))
+
+#define never 0 /* some s have bugs too */
+
+int /* 0 success, otherwise REG_something */
+regcomp(preg, pattern, cflags)
+regex_t *preg;
+const char *pattern;
+int cflags;
+{
+ struct parse pa;
+ register struct re_guts *g;
+ register struct parse *p = &pa;
+ register int i;
+ register size_t len;
+#define GOODFLAGS(f) ((f)&~REG_DUMP)
+
+ cflags = GOODFLAGS(cflags);
+ if ((cflags®_EXTENDED) && (cflags®_NOSPEC))
+ return(REG_INVARG);
+
+ if (cflags®_PEND) {
+ if (preg->re_endp < pattern)
+ return(REG_INVARG);
+ len = preg->re_endp - pattern;
+ } else
+ len = strlen((char *)pattern);
+
+ /* do the mallocs early so failure handling is easy */
+ g = (struct re_guts *)malloc(sizeof(struct re_guts) +
+ (NC-1)*sizeof(cat_t));
+ if (g == NULL)
+ return(REG_ESPACE);
+ p->ssize = len/(size_t)2*(size_t)3 + (size_t)1; /* ugh */
+ p->strip = (sop *)malloc(p->ssize * sizeof(sop));
+ p->slen = 0;
+ if (p->strip == NULL) {
+ free((char *)g);
+ return(REG_ESPACE);
+ }
+
+ /* set things up */
+ p->g = g;
+ p->next = (char *)pattern; /* convenience; we do not modify it */
+ p->end = p->next + len;
+ p->error = 0;
+ p->ncsalloc = 0;
+ for (i = 0; i < NPAREN; i++) {
+ p->pbegin[i] = 0;
+ p->pend[i] = 0;
+ }
+ g->csetsize = NC;
+ g->sets = NULL;
+ g->setbits = NULL;
+ g->ncsets = 0;
+ g->cflags = cflags;
+ g->iflags = 0;
+ g->nbol = 0;
+ g->neol = 0;
+ g->must = NULL;
+ g->mlen = 0;
+ g->nsub = 0;
+ g->ncategories = 1; /* category 0 is "everything else" */
+ g->categories = &g->catspace[-(CHAR_MIN)];
+ (void) memset((char *)g->catspace, 0, NC*sizeof(cat_t));
+ g->backrefs = 0;
+
+ /* do it */
+ EMIT(OEND, 0);
+ g->firststate = THERE();
+ if (cflags®_EXTENDED)
+ p_ere(p, OUT);
+ else if (cflags®_NOSPEC)
+ p_str(p);
+ else
+ p_bre(p, OUT, OUT);
+ EMIT(OEND, 0);
+ g->laststate = THERE();
+
+ /* tidy up loose ends and fill things in */
+ categorize(p, g);
+ stripsnug(p, g);
+ findmust(p, g);
+ g->nplus = pluscount(p, g);
+ g->magic = MAGIC2;
+ preg->re_nsub = g->nsub;
+ preg->re_g = g;
+ preg->re_magic = MAGIC1;
+ /* not debugging, so can't rely on the assert() in regexec() */
+ if (g->iflags&BAD)
+ SETERROR(REG_ASSERT);
+
+ /* win or lose, we're done */
+ if (p->error != 0) /* lose */
+ regfree(preg);
+ return(p->error);
+#undef GOODFLAGS
+}
+
+/*
+ - p_ere - ERE parser top level, concatenation and alternation
+ == static void p_ere(register struct parse *p, int stop);
+ */
+static void
+p_ere(p, stop)
+register struct parse *p;
+int stop; /* character this ERE should end at */
+{
+ register char c;
+ register sopno prevback;
+ register sopno prevfwd;
+ register sopno conc;
+ register int first = 1; /* is this the first alternative? */
+
+ for (;;) {
+ /* do a bunch of concatenated expressions */
+ conc = HERE();
+ while (MORE() && (c = PEEK()) != '|' && c != stop)
+ p_ere_exp(p);
+ REQUIRE(HERE() != conc, REG_EMPTY); /* require nonempty */
+
+ if (!EAT('|'))
+ break; /* NOTE BREAK OUT */
+
+ if (first) {
+ INSERT(OCH_, conc); /* offset is wrong */
+ prevfwd = conc;
+ prevback = conc;
+ first = 0;
+ }
+ ASTERN(OOR1, prevback);
+ prevback = THERE();
+ AHEAD(prevfwd); /* fix previous offset */
+ prevfwd = HERE();
+ EMIT(OOR2, 0); /* offset is very wrong */
+ }
+
+ if (!first) { /* tail-end fixups */
+ AHEAD(prevfwd);
+ ASTERN(O_CH, prevback);
+ }
+
+ assert(!MORE() || SEE(stop));
+}
+
+/*
+ - p_ere_exp - parse one subERE, an atom possibly followed by a repetition op
+ == static void p_ere_exp(register struct parse *p);
+ */
+static void
+p_ere_exp(p)
+register struct parse *p;
+{
+ register char c;
+ register sopno pos;
+ register int count;
+ register int count2;
+ register sopno subno;
+ int wascaret = 0;
+
+ assert(MORE()); /* caller should have ensured this */
+ c = GETNEXT();
+
+ pos = HERE();
+ switch (c) {
+ case '(':
+ REQUIRE(MORE(), REG_EPAREN);
+ p->g->nsub++;
+ subno = p->g->nsub;
+ if (subno < NPAREN)
+ p->pbegin[subno] = HERE();
+ EMIT(OLPAREN, subno);
+ if (!SEE(')'))
+ p_ere(p, ')');
+ if (subno < NPAREN) {
+ p->pend[subno] = HERE();
+ assert(p->pend[subno] != 0);
+ }
+ EMIT(ORPAREN, subno);
+ MUSTEAT(')', REG_EPAREN);
+ break;
+ case '^':
+ EMIT(OBOL, 0);
+ p->g->iflags |= USEBOL;
+ p->g->nbol++;
+ wascaret = 1;
+ break;
+ case '$':
+ EMIT(OEOL, 0);
+ p->g->iflags |= USEEOL;
+ p->g->neol++;
+ break;
+ case '|':
+ SETERROR(REG_EMPTY);
+ break;
+ case '*':
+ case '+':
+ case '?':
+ SETERROR(REG_BADRPT);
+ break;
+ case '.':
+ if (p->g->cflags®_NEWLINE)
+ nonnewline(p);
+ else
+ EMIT(OANY, 0);
+ break;
+ case '[':
+ p_bracket(p);
+ break;
+ case '\\':
+ REQUIRE(MORE(), REG_EESCAPE);
+ c = GETNEXT();
+ ordinary(p, c);
+ break;
+ case '{': /* okay as ordinary except if digit follows */
+ REQUIRE(!MORE() || !isdigit(PEEK()), REG_BADRPT);
+ /* FALLTHROUGH */
+ default:
+ ordinary(p, c);
+ break;
+ }
+
+ if (!MORE())
+ return;
+ c = PEEK();
+ /* we call { a repetition if followed by a digit */
+ if (!( c == '*' || c == '+' || c == '?' ||
+ (c == '{' && MORE2() && isdigit(PEEK2())) ))
+ return; /* no repetition, we're done */
+ NEXT();
+
+ REQUIRE(!wascaret, REG_BADRPT);
+ switch (c) {
+ case '*': /* implemented as +? */
+ /* this case does not require the (y|) trick, noKLUDGE */
+ INSERT(OPLUS_, pos);
+ ASTERN(O_PLUS, pos);
+ INSERT(OQUEST_, pos);
+ ASTERN(O_QUEST, pos);
+ break;
+ case '+':
+ INSERT(OPLUS_, pos);
+ ASTERN(O_PLUS, pos);
+ break;
+ case '?':
+ /* KLUDGE: emit y? as (y|) until subtle bug gets fixed */
+ INSERT(OCH_, pos); /* offset slightly wrong */
+ ASTERN(OOR1, pos); /* this one's right */
+ AHEAD(pos); /* fix the OCH_ */
+ EMIT(OOR2, 0); /* offset very wrong... */
+ AHEAD(THERE()); /* ...so fix it */
+ ASTERN(O_CH, THERETHERE());
+ break;
+ case '{':
+ count = p_count(p);
+ if (EAT(',')) {
+ if (isdigit(PEEK())) {
+ count2 = p_count(p);
+ REQUIRE(count <= count2, REG_BADBR);
+ } else /* single number with comma */
+ count2 = INFINITY;
+ } else /* just a single number */
+ count2 = count;
+ repeat(p, pos, count, count2);
+ if (!EAT('}')) { /* error heuristics */
+ while (MORE() && PEEK() != '}')
+ NEXT();
+ REQUIRE(MORE(), REG_EBRACE);
+ SETERROR(REG_BADBR);
+ }
+ break;
+ }
+
+ if (!MORE())
+ return;
+ c = PEEK();
+ if (!( c == '*' || c == '+' || c == '?' ||
+ (c == '{' && MORE2() && isdigit(PEEK2())) ) )
+ return;
+ SETERROR(REG_BADRPT);
+}
+
+/*
+ - p_str - string (no metacharacters) "parser"
+ == static void p_str(register struct parse *p);
+ */
+static void
+p_str(p)
+register struct parse *p;
+{
+ REQUIRE(MORE(), REG_EMPTY);
+ while (MORE())
+ ordinary(p, GETNEXT());
+}
+
+/*
+ - p_bre - BRE parser top level, anchoring and concatenation
+ == static void p_bre(register struct parse *p, register int end1, \
+ == register int end2);
+ * Giving end1 as OUT essentially eliminates the end1/end2 check.
+ *
+ * This implementation is a bit of a kludge, in that a trailing $ is first
+ * taken as an ordinary character and then revised to be an anchor. The
+ * only undesirable side effect is that '$' gets included as a character
+ * category in such cases. This is fairly harmless; not worth fixing.
+ * The amount of lookahead needed to avoid this kludge is excessive.
+ */
+static void
+p_bre(p, end1, end2)
+register struct parse *p;
+register int end1; /* first terminating character */
+register int end2; /* second terminating character */
+{
+ register sopno start = HERE();
+ register int first = 1; /* first subexpression? */
+ register int wasdollar = 0;
+
+ if (EAT('^')) {
+ EMIT(OBOL, 0);
+ p->g->iflags |= USEBOL;
+ p->g->nbol++;
+ }
+ while (MORE() && !SEETWO(end1, end2)) {
+ wasdollar = p_simp_re(p, first);
+ first = 0;
+ }
+ if (wasdollar) { /* oops, that was a trailing anchor */
+ DROP(1);
+ EMIT(OEOL, 0);
+ p->g->iflags |= USEEOL;
+ p->g->neol++;
+ }
+
+ REQUIRE(HERE() != start, REG_EMPTY); /* require nonempty */
+}
+
+/*
+ - p_simp_re - parse a simple RE, an atom possibly followed by a repetition
+ == static int p_simp_re(register struct parse *p, int starordinary);
+ */
+static int /* was the simple RE an unbackslashed $? */
+p_simp_re(p, starordinary)
+register struct parse *p;
+int starordinary; /* is a leading * an ordinary character? */
+{
+ register int c;
+ register int count;
+ register int count2;
+ register sopno pos;
+ register int i;
+ register sopno subno;
+# define BACKSL (1<g->cflags®_NEWLINE)
+ nonnewline(p);
+ else
+ EMIT(OANY, 0);
+ break;
+ case '[':
+ p_bracket(p);
+ break;
+ case BACKSL|'{':
+ SETERROR(REG_BADRPT);
+ break;
+ case BACKSL|'(':
+ p->g->nsub++;
+ subno = p->g->nsub;
+ if (subno < NPAREN)
+ p->pbegin[subno] = HERE();
+ EMIT(OLPAREN, subno);
+ /* the MORE here is an error heuristic */
+ if (MORE() && !SEETWO('\\', ')'))
+ p_bre(p, '\\', ')');
+ if (subno < NPAREN) {
+ p->pend[subno] = HERE();
+ assert(p->pend[subno] != 0);
+ }
+ EMIT(ORPAREN, subno);
+ REQUIRE(EATTWO('\\', ')'), REG_EPAREN);
+ break;
+ case BACKSL|')': /* should not get here -- must be user */
+ case BACKSL|'}':
+ SETERROR(REG_EPAREN);
+ break;
+ case BACKSL|'1':
+ case BACKSL|'2':
+ case BACKSL|'3':
+ case BACKSL|'4':
+ case BACKSL|'5':
+ case BACKSL|'6':
+ case BACKSL|'7':
+ case BACKSL|'8':
+ case BACKSL|'9':
+ i = (c&~BACKSL) - '0';
+ assert(i < NPAREN);
+ if (p->pend[i] != 0) {
+ assert(i <= p->g->nsub);
+ EMIT(OBACK_, i);
+ assert(p->pbegin[i] != 0);
+ assert(OP(p->strip[p->pbegin[i]]) == OLPAREN);
+ assert(OP(p->strip[p->pend[i]]) == ORPAREN);
+ (void) dupl(p, p->pbegin[i]+1, p->pend[i]);
+ EMIT(O_BACK, i);
+ } else
+ SETERROR(REG_ESUBREG);
+ p->g->backrefs = 1;
+ break;
+ case '*':
+ REQUIRE(starordinary, REG_BADRPT);
+ /* FALLTHROUGH */
+ default:
+ ordinary(p, (char)c); /* takes off BACKSL, if any */
+ break;
+ }
+
+ if (EAT('*')) { /* implemented as +? */
+ /* this case does not require the (y|) trick, noKLUDGE */
+ INSERT(OPLUS_, pos);
+ ASTERN(O_PLUS, pos);
+ INSERT(OQUEST_, pos);
+ ASTERN(O_QUEST, pos);
+ } else if (EATTWO('\\', '{')) {
+ count = p_count(p);
+ if (EAT(',')) {
+ if (MORE() && isdigit(PEEK())) {
+ count2 = p_count(p);
+ REQUIRE(count <= count2, REG_BADBR);
+ } else /* single number with comma */
+ count2 = INFINITY;
+ } else /* just a single number */
+ count2 = count;
+ repeat(p, pos, count, count2);
+ if (!EATTWO('\\', '}')) { /* error heuristics */
+ while (MORE() && !SEETWO('\\', '}'))
+ NEXT();
+ REQUIRE(MORE(), REG_EBRACE);
+ SETERROR(REG_BADBR);
+ }
+ } else if (c == (unsigned char)'$') /* $ (but not \$) ends it */
+ return(1);
+
+ return(0);
+}
+
+/*
+ - p_count - parse a repetition count
+ == static int p_count(register struct parse *p);
+ */
+static int /* the value */
+p_count(p)
+register struct parse *p;
+{
+ register int count = 0;
+ register int ndigits = 0;
+
+ while (MORE() && isdigit(PEEK()) && count <= DUPMAX) {
+ count = count*10 + (GETNEXT() - '0');
+ ndigits++;
+ }
+
+ REQUIRE(ndigits > 0 && count <= DUPMAX, REG_BADBR);
+ return(count);
+}
+
+/*
+ - p_bracket - parse a bracketed character list
+ == static void p_bracket(register struct parse *p);
+ *
+ * Note a significant property of this code: if the allocset() did SETERROR,
+ * no set operations are done.
+ */
+static void
+p_bracket(p)
+register struct parse *p;
+{
+ register cset *cs = allocset(p);
+ register int invert = 0;
+
+ /* Dept of Truly Sickening Special-Case Kludges */
+ if (p->next + 5 < p->end && strncmp(p->next, "[:<:]]", 6) == 0) {
+ EMIT(OBOW, 0);
+ NEXTn(6);
+ return;
+ }
+ if (p->next + 5 < p->end && strncmp(p->next, "[:>:]]", 6) == 0) {
+ EMIT(OEOW, 0);
+ NEXTn(6);
+ return;
+ }
+
+ if (EAT('^'))
+ invert++; /* make note to invert set at end */
+ if (EAT(']'))
+ CHadd(cs, ']');
+ else if (EAT('-'))
+ CHadd(cs, '-');
+ while (MORE() && PEEK() != ']' && !SEETWO('-', ']'))
+ p_b_term(p, cs);
+ if (EAT('-'))
+ CHadd(cs, '-');
+ MUSTEAT(']', REG_EBRACK);
+
+ if (p->error != 0) /* don't mess things up further */
+ return;
+
+ if (p->g->cflags®_ICASE) {
+ register int i;
+ register int ci;
+
+ for (i = p->g->csetsize - 1; i >= 0; i--)
+ if (CHIN(cs, i) && isalpha(i)) {
+ ci = othercase(i);
+ if (ci != i)
+ CHadd(cs, ci);
+ }
+ if (cs->multis != NULL)
+ mccase(p, cs);
+ }
+ if (invert) {
+ register int i;
+
+ for (i = p->g->csetsize - 1; i >= 0; i--)
+ if (CHIN(cs, i))
+ CHsub(cs, i);
+ else
+ CHadd(cs, i);
+ if (p->g->cflags®_NEWLINE)
+ CHsub(cs, '\n');
+ if (cs->multis != NULL)
+ mcinvert(p, cs);
+ }
+
+ assert(cs->multis == NULL); /* xxx */
+
+ if (nch(p, cs) == 1) { /* optimize singleton sets */
+ ordinary(p, firstch(p, cs));
+ freeset(p, cs);
+ } else
+ EMIT(OANYOF, freezeset(p, cs));
+}
+
+/*
+ - p_b_term - parse one term of a bracketed character list
+ == static void p_b_term(register struct parse *p, register cset *cs);
+ */
+static void
+p_b_term(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ register char c;
+ register char start, finish;
+ register int i;
+
+ /* classify what we've got */
+ switch ((MORE()) ? PEEK() : '\0') {
+ case '[':
+ c = (MORE2()) ? PEEK2() : '\0';
+ break;
+ case '-':
+ SETERROR(REG_ERANGE);
+ return; /* NOTE RETURN */
+ break;
+ default:
+ c = '\0';
+ break;
+ }
+
+ switch (c) {
+ case ':': /* character class */
+ NEXT2();
+ REQUIRE(MORE(), REG_EBRACK);
+ c = PEEK();
+ REQUIRE(c != '-' && c != ']', REG_ECTYPE);
+ p_b_cclass(p, cs);
+ REQUIRE(MORE(), REG_EBRACK);
+ REQUIRE(EATTWO(':', ']'), REG_ECTYPE);
+ break;
+ case '=': /* equivalence class */
+ NEXT2();
+ REQUIRE(MORE(), REG_EBRACK);
+ c = PEEK();
+ REQUIRE(c != '-' && c != ']', REG_ECOLLATE);
+ p_b_eclass(p, cs);
+ REQUIRE(MORE(), REG_EBRACK);
+ REQUIRE(EATTWO('=', ']'), REG_ECOLLATE);
+ break;
+ default: /* symbol, ordinary character, or range */
+/* xxx revision needed for multichar stuff */
+ start = p_b_symbol(p);
+ if (SEE('-') && MORE2() && PEEK2() != ']') {
+ /* range */
+ NEXT();
+ if (EAT('-'))
+ finish = '-';
+ else
+ finish = p_b_symbol(p);
+ } else
+ finish = start;
+/* xxx what about signed chars here... */
+ REQUIRE(start <= finish, REG_ERANGE);
+ for (i = start; i <= finish; i++)
+ CHadd(cs, i);
+ break;
+ }
+}
+
+/*
+ - p_b_cclass - parse a character-class name and deal with it
+ == static void p_b_cclass(register struct parse *p, register cset *cs);
+ */
+static void
+p_b_cclass(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ register char *sp = p->next;
+ register struct cclass *cp;
+ register size_t len;
+ register char *u;
+ register char c;
+
+ while (MORE() && isalpha(PEEK()))
+ NEXT();
+ len = p->next - sp;
+ for (cp = cclasses; cp->name != NULL; cp++)
+ if (strncmp(cp->name, sp, len) == 0 && cp->name[len] == '\0')
+ break;
+ if (cp->name == NULL) {
+ /* oops, didn't find it */
+ SETERROR(REG_ECTYPE);
+ return;
+ }
+
+ u = cp->chars;
+ while ((c = *u++) != '\0')
+ CHadd(cs, c);
+ for (u = cp->multis; *u != '\0'; u += strlen(u) + 1)
+ MCadd(p, cs, u);
+}
+
+/*
+ - p_b_eclass - parse an equivalence-class name and deal with it
+ == static void p_b_eclass(register struct parse *p, register cset *cs);
+ *
+ * This implementation is incomplete. xxx
+ */
+static void
+p_b_eclass(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ register char c;
+
+ c = p_b_coll_elem(p, '=');
+ CHadd(cs, c);
+}
+
+/*
+ - p_b_symbol - parse a character or [..]ed multicharacter collating symbol
+ == static char p_b_symbol(register struct parse *p);
+ */
+static char /* value of symbol */
+p_b_symbol(p)
+register struct parse *p;
+{
+ register char value;
+
+ REQUIRE(MORE(), REG_EBRACK);
+ if (!EATTWO('[', '.'))
+ return(GETNEXT());
+
+ /* collating symbol */
+ value = p_b_coll_elem(p, '.');
+ REQUIRE(EATTWO('.', ']'), REG_ECOLLATE);
+ return(value);
+}
+
+/*
+ - p_b_coll_elem - parse a collating-element name and look it up
+ == static char p_b_coll_elem(register struct parse *p, int endc);
+ */
+static char /* value of collating element */
+p_b_coll_elem(p, endc)
+register struct parse *p;
+int endc; /* name ended by endc,']' */
+{
+ register char *sp = p->next;
+ register struct cname *cp;
+ register int len;
+
+ while (MORE() && !SEETWO(endc, ']'))
+ NEXT();
+ if (!MORE()) {
+ SETERROR(REG_EBRACK);
+ return(0);
+ }
+ len = p->next - sp;
+ for (cp = cnames; cp->name != NULL; cp++)
+ if (strncmp(cp->name, sp, len) == 0 && cp->name[len] == '\0')
+ return(cp->code); /* known name */
+ if (len == 1)
+ return(*sp); /* single character */
+ SETERROR(REG_ECOLLATE); /* neither */
+ return(0);
+}
+
+/*
+ - othercase - return the case counterpart of an alphabetic
+ == static char othercase(int ch);
+ */
+static char /* if no counterpart, return ch */
+othercase(ch)
+int ch;
+{
+ assert(isalpha(ch));
+ if (isupper(ch))
+ return(tolower(ch));
+ else if (islower(ch))
+ return(toupper(ch));
+ else /* peculiar, but could happen */
+ return(ch);
+}
+
+/*
+ - bothcases - emit a dualcase version of a two-case character
+ == static void bothcases(register struct parse *p, int ch);
+ *
+ * Boy, is this implementation ever a kludge...
+ */
+static void
+bothcases(p, ch)
+register struct parse *p;
+int ch;
+{
+ register char *oldnext = p->next;
+ register char *oldend = p->end;
+ char bracket[3];
+
+ assert(othercase(ch) != ch); /* p_bracket() would recurse */
+ p->next = bracket;
+ p->end = bracket+2;
+ bracket[0] = ch;
+ bracket[1] = ']';
+ bracket[2] = '\0';
+ p_bracket(p);
+ assert(p->next == bracket+2);
+ p->next = oldnext;
+ p->end = oldend;
+}
+
+/*
+ - ordinary - emit an ordinary character
+ == static void ordinary(register struct parse *p, register int ch);
+ */
+static void
+ordinary(p, ch)
+register struct parse *p;
+register int ch;
+{
+ register cat_t *cap = p->g->categories;
+
+ if ((p->g->cflags®_ICASE) && isalpha(ch) && othercase(ch) != ch)
+ bothcases(p, ch);
+ else {
+ EMIT(OCHAR, (unsigned char)ch);
+ if (cap[ch] == 0)
+ cap[ch] = p->g->ncategories++;
+ }
+}
+
+/*
+ - nonnewline - emit REG_NEWLINE version of OANY
+ == static void nonnewline(register struct parse *p);
+ *
+ * Boy, is this implementation ever a kludge...
+ */
+static void
+nonnewline(p)
+register struct parse *p;
+{
+ register char *oldnext = p->next;
+ register char *oldend = p->end;
+ char bracket[4];
+
+ p->next = bracket;
+ p->end = bracket+3;
+ bracket[0] = '^';
+ bracket[1] = '\n';
+ bracket[2] = ']';
+ bracket[3] = '\0';
+ p_bracket(p);
+ assert(p->next == bracket+3);
+ p->next = oldnext;
+ p->end = oldend;
+}
+
+/*
+ - repeat - generate code for a bounded repetition, recursively if needed
+ == static void repeat(register struct parse *p, sopno start, int from, int to);
+ */
+static void
+repeat(p, start, from, to)
+register struct parse *p;
+sopno start; /* operand from here to end of strip */
+int from; /* repeated from this number */
+int to; /* to this number of times (maybe INFINITY) */
+{
+ register sopno finish = HERE();
+# define N 2
+# define INF 3
+# define REP(f, t) ((f)*8 + (t))
+# define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
+ register sopno copy;
+
+ if (p->error != 0) /* head off possible runaway recursion */
+ return;
+
+ assert(from <= to);
+
+ switch (REP(MAP(from), MAP(to))) {
+ case REP(0, 0): /* must be user doing this */
+ DROP(finish-start); /* drop the operand */
+ break;
+ case REP(0, 1): /* as x{1,1}? */
+ case REP(0, N): /* as x{1,n}? */
+ case REP(0, INF): /* as x{1,}? */
+ /* KLUDGE: emit y? as (y|) until subtle bug gets fixed */
+ INSERT(OCH_, start); /* offset is wrong... */
+ repeat(p, start+1, 1, to);
+ ASTERN(OOR1, start);
+ AHEAD(start); /* ... fix it */
+ EMIT(OOR2, 0);
+ AHEAD(THERE());
+ ASTERN(O_CH, THERETHERE());
+ break;
+ case REP(1, 1): /* trivial case */
+ /* done */
+ break;
+ case REP(1, N): /* as x?x{1,n-1} */
+ /* KLUDGE: emit y? as (y|) until subtle bug gets fixed */
+ INSERT(OCH_, start);
+ ASTERN(OOR1, start);
+ AHEAD(start);
+ EMIT(OOR2, 0); /* offset very wrong... */
+ AHEAD(THERE()); /* ...so fix it */
+ ASTERN(O_CH, THERETHERE());
+ copy = dupl(p, start+1, finish+1);
+ assert(copy == finish+4);
+ repeat(p, copy, 1, to-1);
+ break;
+ case REP(1, INF): /* as x+ */
+ INSERT(OPLUS_, start);
+ ASTERN(O_PLUS, start);
+ break;
+ case REP(N, N): /* as xx{m-1,n-1} */
+ copy = dupl(p, start, finish);
+ repeat(p, copy, from-1, to-1);
+ break;
+ case REP(N, INF): /* as xx{n-1,INF} */
+ copy = dupl(p, start, finish);
+ repeat(p, copy, from-1, to);
+ break;
+ default: /* "can't happen" */
+ SETERROR(REG_ASSERT); /* just in case */
+ break;
+ }
+}
+
+/*
+ - seterr - set an error condition
+ == static int seterr(register struct parse *p, int e);
+ */
+static int /* useless but makes type checking happy */
+seterr(p, e)
+register struct parse *p;
+int e;
+{
+ if (p->error == 0) /* keep earliest error condition */
+ p->error = e;
+ p->next = nuls; /* try to bring things to a halt */
+ p->end = nuls;
+ return(0); /* make the return value well-defined */
+}
+
+/*
+ - allocset - allocate a set of characters for []
+ == static cset *allocset(register struct parse *p);
+ */
+static cset *
+allocset(p)
+register struct parse *p;
+{
+ register int no = p->g->ncsets++;
+ register size_t nc;
+ register size_t nbytes;
+ register cset *cs;
+ register size_t css = (size_t)p->g->csetsize;
+ register int i;
+
+ if (no >= p->ncsalloc) { /* need another column of space */
+ p->ncsalloc += CHAR_BIT;
+ nc = p->ncsalloc;
+ assert(nc % CHAR_BIT == 0);
+ nbytes = nc / CHAR_BIT * css;
+ if (p->g->sets == NULL)
+ p->g->sets = (cset *)malloc(nc * sizeof(cset));
+ else
+ p->g->sets = (cset *)realloc((char *)p->g->sets,
+ nc * sizeof(cset));
+ if (p->g->setbits == NULL)
+ p->g->setbits = (uch *)malloc(nbytes);
+ else {
+ p->g->setbits = (uch *)realloc((char *)p->g->setbits,
+ nbytes);
+ /* xxx this isn't right if setbits is now NULL */
+ for (i = 0; i < no; i++)
+ p->g->sets[i].ptr = p->g->setbits + css*(i/CHAR_BIT);
+ }
+ if (p->g->sets != NULL && p->g->setbits != NULL)
+ (void) memset((char *)p->g->setbits + (nbytes - css),
+ 0, css);
+ else {
+ no = 0;
+ SETERROR(REG_ESPACE);
+ /* caller's responsibility not to do set ops */
+ }
+ }
+
+ assert(p->g->sets != NULL); /* xxx */
+ cs = &p->g->sets[no];
+ cs->ptr = p->g->setbits + css*((no)/CHAR_BIT);
+ cs->mask = 1 << ((no) % CHAR_BIT);
+ cs->hash = 0;
+ cs->smultis = 0;
+ cs->multis = NULL;
+
+ return(cs);
+}
+
+/*
+ - freeset - free a now-unused set
+ == static void freeset(register struct parse *p, register cset *cs);
+ */
+static void
+freeset(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ register int i;
+ register cset *top = &p->g->sets[p->g->ncsets];
+ register size_t css = (size_t)p->g->csetsize;
+
+ for (i = 0; i < css; i++)
+ CHsub(cs, i);
+ if (cs == top-1) /* recover only the easy case */
+ p->g->ncsets--;
+}
+
+/*
+ - freezeset - final processing on a set of characters
+ == static int freezeset(register struct parse *p, register cset *cs);
+ *
+ * The main task here is merging identical sets. This is usually a waste
+ * of time (although the hash code minimizes the overhead), but can win
+ * big if REG_ICASE is being used. REG_ICASE, by the way, is why the hash
+ * is done using addition rather than xor -- all ASCII [aA] sets xor to
+ * the same value!
+ */
+static int /* set number */
+freezeset(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ register uch h = cs->hash;
+ register int i;
+ register cset *top = &p->g->sets[p->g->ncsets];
+ register cset *cs2;
+ register size_t css = (size_t)p->g->csetsize;
+
+ /* look for an earlier one which is the same */
+ for (cs2 = &p->g->sets[0]; cs2 < top; cs2++)
+ if (cs2->hash == h && cs2 != cs) {
+ /* maybe */
+ for (i = 0; i < css; i++)
+ if (!!CHIN(cs2, i) != !!CHIN(cs, i))
+ break; /* no */
+ if (i == css)
+ break; /* yes */
+ }
+
+ if (cs2 < top) { /* found one */
+ freeset(p, cs);
+ cs = cs2;
+ }
+
+ return((int)(cs - p->g->sets));
+}
+
+/*
+ - firstch - return first character in a set (which must have at least one)
+ == static int firstch(register struct parse *p, register cset *cs);
+ */
+static int /* character; there is no "none" value */
+firstch(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ register int i;
+ register size_t css = (size_t)p->g->csetsize;
+
+ for (i = 0; i < css; i++)
+ if (CHIN(cs, i))
+ return((char)i);
+ assert(never);
+ return(0); /* arbitrary */
+}
+
+/*
+ - nch - number of characters in a set
+ == static int nch(register struct parse *p, register cset *cs);
+ */
+static int
+nch(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ register int i;
+ register size_t css = (size_t)p->g->csetsize;
+ register int n = 0;
+
+ for (i = 0; i < css; i++)
+ if (CHIN(cs, i))
+ n++;
+ return(n);
+}
+
+/*
+ - mcadd - add a collating element to a cset
+ == static void mcadd(register struct parse *p, register cset *cs, \
+ == register char *cp);
+ */
+static void
+mcadd(p, cs, cp)
+register struct parse *p;
+register cset *cs;
+register char *cp;
+{
+ register size_t oldend = cs->smultis;
+
+ cs->smultis += strlen(cp) + 1;
+ if (cs->multis == NULL)
+ cs->multis = malloc(cs->smultis);
+ else
+ cs->multis = realloc(cs->multis, cs->smultis);
+ if (cs->multis == NULL) {
+ SETERROR(REG_ESPACE);
+ return;
+ }
+
+ (void) strcpy(cs->multis + oldend - 1, cp);
+ cs->multis[cs->smultis - 1] = '\0';
+}
+
+/*
+ - mcinvert - invert the list of collating elements in a cset
+ == static void mcinvert(register struct parse *p, register cset *cs);
+ *
+ * This would have to know the set of possibilities. Implementation
+ * is deferred.
+ */
+static void
+mcinvert(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ assert(cs->multis == NULL); /* xxx */
+}
+
+/*
+ - mccase - add case counterparts of the list of collating elements in a cset
+ == static void mccase(register struct parse *p, register cset *cs);
+ *
+ * This would have to know the set of possibilities. Implementation
+ * is deferred.
+ */
+static void
+mccase(p, cs)
+register struct parse *p;
+register cset *cs;
+{
+ assert(cs->multis == NULL); /* xxx */
+}
+
+/*
+ - isinsets - is this character in any sets?
+ == static int isinsets(register struct re_guts *g, int c);
+ */
+static int /* predicate */
+isinsets(g, c)
+register struct re_guts *g;
+int c;
+{
+ register uch *col;
+ register int i;
+ register int ncols = (g->ncsets+(CHAR_BIT-1)) / CHAR_BIT;
+ register unsigned uc = (unsigned char)c;
+
+ for (i = 0, col = g->setbits; i < ncols; i++, col += g->csetsize)
+ if (col[uc] != 0)
+ return(1);
+ return(0);
+}
+
+/*
+ - samesets - are these two characters in exactly the same sets?
+ == static int samesets(register struct re_guts *g, int c1, int c2);
+ */
+static int /* predicate */
+samesets(g, c1, c2)
+register struct re_guts *g;
+int c1;
+int c2;
+{
+ register uch *col;
+ register int i;
+ register int ncols = (g->ncsets+(CHAR_BIT-1)) / CHAR_BIT;
+ register unsigned uc1 = (unsigned char)c1;
+ register unsigned uc2 = (unsigned char)c2;
+
+ for (i = 0, col = g->setbits; i < ncols; i++, col += g->csetsize)
+ if (col[uc1] != col[uc2])
+ return(0);
+ return(1);
+}
+
+/*
+ - categorize - sort out character categories
+ == static void categorize(struct parse *p, register struct re_guts *g);
+ */
+static void
+categorize(p, g)
+struct parse *p;
+register struct re_guts *g;
+{
+ register cat_t *cats = g->categories;
+ register int c;
+ register int c2;
+ register cat_t cat;
+
+ /* avoid making error situations worse */
+ if (p->error != 0)
+ return;
+
+ for (c = CHAR_MIN; c <= CHAR_MAX; c++)
+ if (cats[c] == 0 && isinsets(g, c)) {
+ cat = g->ncategories++;
+ cats[c] = cat;
+ for (c2 = c+1; c2 <= CHAR_MAX; c2++)
+ if (cats[c2] == 0 && samesets(g, c, c2))
+ cats[c2] = cat;
+ }
+}
+
+/*
+ - dupl - emit a duplicate of a bunch of sops
+ == static sopno dupl(register struct parse *p, sopno start, sopno finish);
+ */
+static sopno /* start of duplicate */
+dupl(p, start, finish)
+register struct parse *p;
+sopno start; /* from here */
+sopno finish; /* to this less one */
+{
+ register sopno ret = HERE();
+ register sopno len = finish - start;
+
+ assert(finish >= start);
+ if (len == 0)
+ return(ret);
+ enlarge(p, p->ssize + len); /* this many unexpected additions */
+ assert(p->ssize >= p->slen + len);
+ (void) memcpy((char *)(p->strip + p->slen),
+ (char *)(p->strip + start), (size_t)len*sizeof(sop));
+ p->slen += len;
+ return(ret);
+}
+
+/*
+ - doemit - emit a strip operator
+ == static void doemit(register struct parse *p, sop op, size_t opnd);
+ *
+ * It might seem better to implement this as a macro with a function as
+ * hard-case backup, but it's just too big and messy unless there are
+ * some changes to the data structures. Maybe later.
+ */
+static void
+doemit(p, op, opnd)
+register struct parse *p;
+sop op;
+size_t opnd;
+{
+ /* avoid making error situations worse */
+ if (p->error != 0)
+ return;
+
+ /* deal with oversize operands ("can't happen", more or less) */
+ assert(opnd < 1<slen >= p->ssize)
+ enlarge(p, (p->ssize+1) / 2 * 3); /* +50% */
+ assert(p->slen < p->ssize);
+
+ /* finally, it's all reduced to the easy case */
+ p->strip[p->slen++] = SOP(op, opnd);
+}
+
+/*
+ - doinsert - insert a sop into the strip
+ == static void doinsert(register struct parse *p, sop op, size_t opnd, sopno pos);
+ */
+static void
+doinsert(p, op, opnd, pos)
+register struct parse *p;
+sop op;
+size_t opnd;
+sopno pos;
+{
+ register sopno sn;
+ register sop s;
+ register int i;
+
+ /* avoid making error situations worse */
+ if (p->error != 0)
+ return;
+
+ sn = HERE();
+ EMIT(op, opnd); /* do checks, ensure space */
+ assert(HERE() == sn+1);
+ s = p->strip[sn];
+
+ /* adjust paren pointers */
+ assert(pos > 0);
+ for (i = 1; i < NPAREN; i++) {
+ if (p->pbegin[i] >= pos) {
+ p->pbegin[i]++;
+ }
+ if (p->pend[i] >= pos) {
+ p->pend[i]++;
+ }
+ }
+
+ memmove((char *)&p->strip[pos+1], (char *)&p->strip[pos],
+ (HERE()-pos-1)*sizeof(sop));
+ p->strip[pos] = s;
+}
+
+/*
+ - dofwd - complete a forward reference
+ == static void dofwd(register struct parse *p, sopno pos, sop value);
+ */
+static void
+dofwd(p, pos, value)
+register struct parse *p;
+register sopno pos;
+sop value;
+{
+ /* avoid making error situations worse */
+ if (p->error != 0)
+ return;
+
+ assert(value < 1<strip[pos] = OP(p->strip[pos]) | value;
+}
+
+/*
+ - enlarge - enlarge the strip
+ == static void enlarge(register struct parse *p, sopno size);
+ */
+static void
+enlarge(p, size)
+register struct parse *p;
+register sopno size;
+{
+ register sop *sp;
+
+ if (p->ssize >= size)
+ return;
+
+ sp = (sop *)realloc(p->strip, size*sizeof(sop));
+ if (sp == NULL) {
+ SETERROR(REG_ESPACE);
+ return;
+ }
+ p->strip = sp;
+ p->ssize = size;
+}
+
+/*
+ - stripsnug - compact the strip
+ == static void stripsnug(register struct parse *p, register struct re_guts *g);
+ */
+static void
+stripsnug(p, g)
+register struct parse *p;
+register struct re_guts *g;
+{
+ g->nstates = p->slen;
+ g->strip = (sop *)realloc((char *)p->strip, p->slen * sizeof(sop));
+ if (g->strip == NULL) {
+ SETERROR(REG_ESPACE);
+ g->strip = p->strip;
+ }
+}
+
+/*
+ - findmust - fill in must and mlen with longest mandatory literal string
+ == static void findmust(register struct parse *p, register struct re_guts *g);
+ *
+ * This algorithm could do fancy things like analyzing the operands of |
+ * for common subsequences. Someday. This code is simple and finds most
+ * of the interesting cases.
+ *
+ * Note that must and mlen got initialized during setup.
+ */
+static void
+findmust(p, g)
+struct parse *p;
+register struct re_guts *g;
+{
+ register sop *scan;
+ sop *start;
+ register sop *newstart;
+ register sopno newlen;
+ register sop s;
+ register char *cp;
+ register sopno i;
+
+ /* avoid making error situations worse */
+ if (p->error != 0)
+ return;
+
+ /* find the longest OCHAR sequence in strip */
+ newlen = 0;
+ scan = g->strip + 1;
+ do {
+ s = *scan++;
+ switch (OP(s)) {
+ case OCHAR: /* sequence member */
+ if (newlen == 0) /* new sequence */
+ newstart = scan - 1;
+ newlen++;
+ break;
+ case OPLUS_: /* things that don't break one */
+ case OLPAREN:
+ case ORPAREN:
+ break;
+ case OQUEST_: /* things that must be skipped */
+ case OCH_:
+ scan--;
+ do {
+ scan += OPND(s);
+ s = *scan;
+ /* assert() interferes w debug printouts */
+ if (OP(s) != O_QUEST && OP(s) != O_CH &&
+ OP(s) != OOR2) {
+ g->iflags |= BAD;
+ return;
+ }
+ } while (OP(s) != O_QUEST && OP(s) != O_CH);
+ /* fallthrough */
+ default: /* things that break a sequence */
+ if (newlen > g->mlen) { /* ends one */
+ start = newstart;
+ g->mlen = newlen;
+ }
+ newlen = 0;
+ break;
+ }
+ } while (OP(s) != OEND);
+
+ if (g->mlen == 0) /* there isn't one */
+ return;
+
+ /* turn it into a character string */
+ g->must = malloc((size_t)g->mlen + 1);
+ if (g->must == NULL) { /* argh; just forget it */
+ g->mlen = 0;
+ return;
+ }
+ cp = g->must;
+ scan = start;
+ for (i = g->mlen; i > 0; i--) {
+ while (OP(s = *scan++) != OCHAR)
+ continue;
+ assert(cp < g->must + g->mlen);
+ *cp++ = (char)OPND(s);
+ }
+ assert(cp == g->must + g->mlen);
+ *cp++ = '\0'; /* just on general principles */
+}
+
+/*
+ - pluscount - count + nesting
+ == static sopno pluscount(register struct parse *p, register struct re_guts *g);
+ */
+static sopno /* nesting depth */
+pluscount(p, g)
+struct parse *p;
+register struct re_guts *g;
+{
+ register sop *scan;
+ register sop s;
+ register sopno plusnest = 0;
+ register sopno maxnest = 0;
+
+ if (p->error != 0)
+ return(0); /* there may not be an OEND */
+
+ scan = g->strip + 1;
+ do {
+ s = *scan++;
+ switch (OP(s)) {
+ case OPLUS_:
+ plusnest++;
+ break;
+ case O_PLUS:
+ if (plusnest > maxnest)
+ maxnest = plusnest;
+ plusnest--;
+ break;
+ }
+ } while (OP(s) != OEND);
+ if (plusnest != 0)
+ g->iflags |= BAD;
+ return(maxnest);
+}
+
+static int nope = 0; /* for use in asserts; shuts lint up */
+
+/* macros for manipulating states, small version */
+#define states unsigned
+#define states1 unsigned /* for later use in regexec() decision */
+#define CLEAR(v) ((v) = 0)
+#define SET0(v, n) ((v) &= ~((unsigned)1 << (n)))
+#define SET1(v, n) ((v) |= (unsigned)1 << (n))
+#define ISSET(v, n) ((v) & ((unsigned)1 << (n)))
+#define ASSIGN(d, s) ((d) = (s))
+#define EQ(a, b) ((a) == (b))
+#define STATEVARS int dummy /* dummy version */
+#define STATESETUP(m, n) /* nothing */
+#define STATETEARDOWN(m) /* nothing */
+#define SETUP(v) ((v) = 0)
+#define onestate unsigned
+#define INIT(o, n) ((o) = (unsigned)1 << (n))
+#define INC(o) ((o) <<= 1)
+#define ISSTATEIN(v, o) ((v) & (o))
+/* some abbreviations; note that some of these know variable names! */
+/* do "if I'm here, I can also be there" etc without branches */
+#define FWD(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) << (n))
+#define BACK(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) >> (n))
+#define ISSETBACK(v, n) ((v) & ((unsigned)here >> (n)))
+/* function names */
+#define SNAMES /* engine.c looks after details */
+
+/*
+ * The matching engine and friends. This file is #included by regexec.c
+ * after suitable #defines of a variety of macros used herein, so that
+ * different state representations can be used without duplicating masses
+ * of code.
+ */
+
+#ifdef SNAMES
+#define matcher smatcher
+#define fast sfast
+#define slow sslow
+#define dissect sdissect
+#define backref sbackref
+#define step sstep
+#define print sprint
+#define at sat
+#define match smat
+#endif
+#ifdef LNAMES
+#define matcher lmatcher
+#define fast lfast
+#define slow lslow
+#define dissect ldissect
+#define backref lbackref
+#define step lstep
+#define print lprint
+#define at lat
+#define match lmat
+#endif
+
+/* another structure passed up and down to avoid zillions of parameters */
+struct match {
+ struct re_guts *g;
+ int eflags;
+ regmatch_t *pmatch; /* [nsub+1] (0 element unused) */
+ char *offp; /* offsets work from here */
+ char *beginp; /* start of string -- virtual NUL precedes */
+ char *endp; /* end of string -- virtual NUL here */
+ char *coldp; /* can be no match starting before here */
+ char **lastpos; /* [nplus+1] */
+ STATEVARS;
+ states st; /* current states */
+ states fresh; /* states for a fresh start */
+ states tmp; /* temporary */
+ states empty; /* empty set of states */
+};
+
+static int matcher(register struct re_guts *g, char *string, size_t nmatch, regmatch_t pmatch[], int eflags);
+static char *dissect(register struct match *m, char *start, char *stop, sopno startst, sopno stopst);
+static char *backref(register struct match *m, char *start, char *stop, sopno startst, sopno stopst, sopno lev);
+static char *fast(register struct match *m, char *start, char *stop, sopno startst, sopno stopst);
+static char *slow(register struct match *m, char *start, char *stop, sopno startst, sopno stopst);
+static states step(register struct re_guts *g, sopno start, sopno stop, register states bef, int ch, register states aft);
+#define BOL (OUT+1)
+#define EOL (BOL+1)
+#define BOLEOL (BOL+2)
+#define NOTHING (BOL+3)
+#define BOW (BOL+4)
+#define EOW (BOL+5)
+#define CODEMAX (BOL+5) /* highest code used */
+#define NONCHAR(c) ((c) > CHAR_MAX)
+#define NNONCHAR (CODEMAX-CHAR_MAX)
+#define SP(t, s, c) /* nothing */
+#define AT(t, p1, p2, s1, s2) /* nothing */
+#define NOTE(s) /* nothing */
+
+/*
+ - matcher - the actual matching engine
+ == static int matcher(register struct re_guts *g, char *string, \
+ == size_t nmatch, regmatch_t pmatch[], int eflags);
+ */
+static int /* 0 success, REG_NOMATCH failure */
+matcher(g, string, nmatch, pmatch, eflags)
+register struct re_guts *g;
+char *string;
+size_t nmatch;
+regmatch_t pmatch[];
+int eflags;
+{
+ register char *endp;
+ register int i;
+ struct match mv;
+ register struct match *m = &mv;
+ register char *dp;
+ const register sopno gf = g->firststate+1; /* +1 for OEND */
+ const register sopno gl = g->laststate;
+ char *start;
+ char *stop;
+
+ /* simplify the situation where possible */
+ if (g->cflags®_NOSUB)
+ nmatch = 0;
+ if (eflags®_STARTEND) {
+ start = string + pmatch[0].rm_so;
+ stop = string + pmatch[0].rm_eo;
+ } else {
+ start = string;
+ stop = start + strlen(start);
+ }
+ if (stop < start)
+ return(REG_INVARG);
+
+ /* prescreening; this does wonders for this rather slow code */
+ if (g->must != NULL) {
+ for (dp = start; dp < stop; dp++)
+ if (*dp == g->must[0] && stop - dp >= g->mlen &&
+ memcmp(dp, g->must, (size_t)g->mlen) == 0)
+ break;
+ if (dp == stop) /* we didn't find g->must */
+ return(REG_NOMATCH);
+ }
+
+ /* match struct setup */
+ m->g = g;
+ m->eflags = eflags;
+ m->pmatch = NULL;
+ m->lastpos = NULL;
+ m->offp = string;
+ m->beginp = start;
+ m->endp = stop;
+ STATESETUP(m, 4);
+ SETUP(m->st);
+ SETUP(m->fresh);
+ SETUP(m->tmp);
+ SETUP(m->empty);
+ CLEAR(m->empty);
+
+ /* this loop does only one repetition except for backrefs */
+ for (;;) {
+ endp = fast(m, start, stop, gf, gl);
+ if (endp == NULL) { /* a miss */
+ STATETEARDOWN(m);
+ return(REG_NOMATCH);
+ }
+ if (nmatch == 0 && !g->backrefs)
+ break; /* no further info needed */
+
+ /* where? */
+ assert(m->coldp != NULL);
+ for (;;) {
+ NOTE("finding start");
+ endp = slow(m, m->coldp, stop, gf, gl);
+ if (endp != NULL)
+ break;
+ assert(m->coldp < m->endp);
+ m->coldp++;
+ }
+ if (nmatch == 1 && !g->backrefs)
+ break; /* no further info needed */
+
+ /* oh my, he wants the subexpressions... */
+ if (m->pmatch == NULL)
+ m->pmatch = (regmatch_t *)malloc((m->g->nsub + 1) *
+ sizeof(regmatch_t));
+ if (m->pmatch == NULL) {
+ STATETEARDOWN(m);
+ return(REG_ESPACE);
+ }
+ for (i = 1; i <= m->g->nsub; i++)
+ m->pmatch[i].rm_so = m->pmatch[i].rm_eo = -1;
+ if (!g->backrefs && !(m->eflags®_BACKR)) {
+ NOTE("dissecting");
+ dp = dissect(m, m->coldp, endp, gf, gl);
+ } else {
+ if (g->nplus > 0 && m->lastpos == NULL)
+ m->lastpos = (char **)malloc((g->nplus+1) *
+ sizeof(char *));
+ if (g->nplus > 0 && m->lastpos == NULL) {
+ free(m->pmatch);
+ STATETEARDOWN(m);
+ return(REG_ESPACE);
+ }
+ NOTE("backref dissect");
+ dp = backref(m, m->coldp, endp, gf, gl, (sopno)0);
+ }
+ if (dp != NULL)
+ break;
+
+ /* uh-oh... we couldn't find a subexpression-level match */
+ assert(g->backrefs); /* must be back references doing it */
+ assert(g->nplus == 0 || m->lastpos != NULL);
+ for (;;) {
+ if (dp != NULL || endp <= m->coldp)
+ break; /* defeat */
+ NOTE("backoff");
+ endp = slow(m, m->coldp, endp-1, gf, gl);
+ if (endp == NULL)
+ break; /* defeat */
+ /* try it on a shorter possibility */
+ NOTE("backoff dissect");
+ dp = backref(m, m->coldp, endp, gf, gl, (sopno)0);
+ }
+ assert(dp == NULL || dp == endp);
+ if (dp != NULL) /* found a shorter one */
+ break;
+
+ /* despite initial appearances, there is no match here */
+ NOTE("false alarm");
+ start = m->coldp + 1; /* recycle starting later */
+ assert(start <= stop);
+ }
+
+ /* fill in the details if requested */
+ if (nmatch > 0) {
+ pmatch[0].rm_so = m->coldp - m->offp;
+ pmatch[0].rm_eo = endp - m->offp;
+ }
+ if (nmatch > 1) {
+ assert(m->pmatch != NULL);
+ for (i = 1; i < nmatch; i++)
+ if (i <= m->g->nsub)
+ pmatch[i] = m->pmatch[i];
+ else {
+ pmatch[i].rm_so = -1;
+ pmatch[i].rm_eo = -1;
+ }
+ }
+
+ if (m->pmatch != NULL)
+ free((char *)m->pmatch);
+ if (m->lastpos != NULL)
+ free((char *)m->lastpos);
+ STATETEARDOWN(m);
+ return(0);
+}
+
+/*
+ - dissect - figure out what matched what, no back references
+ == static char *dissect(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst);
+ */
+static char * /* == stop (success) always */
+dissect(m, start, stop, startst, stopst)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+{
+ register int i;
+ register sopno ss; /* start sop of current subRE */
+ register sopno es; /* end sop of current subRE */
+ register char *sp; /* start of string matched by it */
+ register char *stp; /* string matched by it cannot pass here */
+ register char *rest; /* start of rest of string */
+ register char *tail; /* string unmatched by rest of RE */
+ register sopno ssub; /* start sop of subsubRE */
+ register sopno esub; /* end sop of subsubRE */
+ register char *ssp; /* start of string matched by subsubRE */
+ register char *sep; /* end of string matched by subsubRE */
+ register char *oldssp; /* previous ssp */
+ register char *dp;
+
+ AT("diss", start, stop, startst, stopst);
+ sp = start;
+ for (ss = startst; ss < stopst; ss = es) {
+ /* identify end of subRE */
+ es = ss;
+ switch (OP(m->g->strip[es])) {
+ case OPLUS_:
+ case OQUEST_:
+ es += OPND(m->g->strip[es]);
+ break;
+ case OCH_:
+ while (OP(m->g->strip[es]) != O_CH)
+ es += OPND(m->g->strip[es]);
+ break;
+ }
+ es++;
+
+ /* figure out what it matched */
+ switch (OP(m->g->strip[ss])) {
+ case OEND:
+ assert(nope);
+ break;
+ case OCHAR:
+ sp++;
+ break;
+ case OBOL:
+ case OEOL:
+ case OBOW:
+ case OEOW:
+ break;
+ case OANY:
+ case OANYOF:
+ sp++;
+ break;
+ case OBACK_:
+ case O_BACK:
+ assert(nope);
+ break;
+ /* cases where length of match is hard to find */
+ case OQUEST_:
+ stp = stop;
+ for (;;) {
+ /* how long could this one be? */
+ rest = slow(m, sp, stp, ss, es);
+ assert(rest != NULL); /* it did match */
+ /* could the rest match the rest? */
+ tail = slow(m, rest, stop, es, stopst);
+ if (tail == stop)
+ break; /* yes! */
+ /* no -- try a shorter match for this one */
+ stp = rest - 1;
+ assert(stp >= sp); /* it did work */
+ }
+ ssub = ss + 1;
+ esub = es - 1;
+ /* did innards match? */
+ if (slow(m, sp, rest, ssub, esub) != NULL) {
+ dp = dissect(m, sp, rest, ssub, esub);
+ assert(dp == rest);
+ } else /* no */
+ assert(sp == rest);
+ sp = rest;
+ break;
+ case OPLUS_:
+ stp = stop;
+ for (;;) {
+ /* how long could this one be? */
+ rest = slow(m, sp, stp, ss, es);
+ assert(rest != NULL); /* it did match */
+ /* could the rest match the rest? */
+ tail = slow(m, rest, stop, es, stopst);
+ if (tail == stop)
+ break; /* yes! */
+ /* no -- try a shorter match for this one */
+ stp = rest - 1;
+ assert(stp >= sp); /* it did work */
+ }
+ ssub = ss + 1;
+ esub = es - 1;
+ ssp = sp;
+ oldssp = ssp;
+ for (;;) { /* find last match of innards */
+ sep = slow(m, ssp, rest, ssub, esub);
+ if (sep == NULL || sep == ssp)
+ break; /* failed or matched null */
+ oldssp = ssp; /* on to next try */
+ ssp = sep;
+ }
+ if (sep == NULL) {
+ /* last successful match */
+ sep = ssp;
+ ssp = oldssp;
+ }
+ assert(sep == rest); /* must exhaust substring */
+ assert(slow(m, ssp, sep, ssub, esub) == rest);
+ dp = dissect(m, ssp, sep, ssub, esub);
+ assert(dp == sep);
+ sp = rest;
+ break;
+ case OCH_:
+ stp = stop;
+ for (;;) {
+ /* how long could this one be? */
+ rest = slow(m, sp, stp, ss, es);
+ assert(rest != NULL); /* it did match */
+ /* could the rest match the rest? */
+ tail = slow(m, rest, stop, es, stopst);
+ if (tail == stop)
+ break; /* yes! */
+ /* no -- try a shorter match for this one */
+ stp = rest - 1;
+ assert(stp >= sp); /* it did work */
+ }
+ ssub = ss + 1;
+ esub = ss + OPND(m->g->strip[ss]) - 1;
+ assert(OP(m->g->strip[esub]) == OOR1);
+ for (;;) { /* find first matching branch */
+ if (slow(m, sp, rest, ssub, esub) == rest)
+ break; /* it matched all of it */
+ /* that one missed, try next one */
+ assert(OP(m->g->strip[esub]) == OOR1);
+ esub++;
+ assert(OP(m->g->strip[esub]) == OOR2);
+ ssub = esub + 1;
+ esub += OPND(m->g->strip[esub]);
+ if (OP(m->g->strip[esub]) == OOR2)
+ esub--;
+ else
+ assert(OP(m->g->strip[esub]) == O_CH);
+ }
+ dp = dissect(m, sp, rest, ssub, esub);
+ assert(dp == rest);
+ sp = rest;
+ break;
+ case O_PLUS:
+ case O_QUEST:
+ case OOR1:
+ case OOR2:
+ case O_CH:
+ assert(nope);
+ break;
+ case OLPAREN:
+ i = OPND(m->g->strip[ss]);
+ assert(0 < i && i <= m->g->nsub);
+ m->pmatch[i].rm_so = sp - m->offp;
+ break;
+ case ORPAREN:
+ i = OPND(m->g->strip[ss]);
+ assert(0 < i && i <= m->g->nsub);
+ m->pmatch[i].rm_eo = sp - m->offp;
+ break;
+ default: /* uh oh */
+ assert(nope);
+ break;
+ }
+ }
+
+ assert(sp == stop);
+ return(sp);
+}
+
+/*
+ - backref - figure out what matched what, figuring in back references
+ == static char *backref(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst, sopno lev);
+ */
+static char * /* == stop (success) or NULL (failure) */
+backref(m, start, stop, startst, stopst, lev)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+sopno lev; /* PLUS nesting level */
+{
+ register int i;
+ register sopno ss; /* start sop of current subRE */
+ register char *sp; /* start of string matched by it */
+ register sopno ssub; /* start sop of subsubRE */
+ register sopno esub; /* end sop of subsubRE */
+ register char *ssp; /* start of string matched by subsubRE */
+ register char *dp;
+ register size_t len;
+ register int hard;
+ register sop s;
+ register regoff_t offsave;
+ register cset *cs;
+
+ AT("back", start, stop, startst, stopst);
+ sp = start;
+
+ /* get as far as we can with easy stuff */
+ hard = 0;
+ for (ss = startst; !hard && ss < stopst; ss++)
+ switch (OP(s = m->g->strip[ss])) {
+ case OCHAR:
+ if (sp == stop || *sp++ != (char)OPND(s))
+ return(NULL);
+ break;
+ case OANY:
+ if (sp == stop)
+ return(NULL);
+ sp++;
+ break;
+ case OANYOF:
+ cs = &m->g->sets[OPND(s)];
+ if (sp == stop || !CHIN(cs, *sp++))
+ return(NULL);
+ break;
+ case OBOL:
+ if ( (sp == m->beginp && !(m->eflags®_NOTBOL)) ||
+ (sp < m->endp && *(sp-1) == '\n' &&
+ (m->g->cflags®_NEWLINE)) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case OEOL:
+ if ( (sp == m->endp && !(m->eflags®_NOTEOL)) ||
+ (sp < m->endp && *sp == '\n' &&
+ (m->g->cflags®_NEWLINE)) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case OBOW:
+ if (( (sp == m->beginp && !(m->eflags®_NOTBOL)) ||
+ (sp < m->endp && *(sp-1) == '\n' &&
+ (m->g->cflags®_NEWLINE)) ||
+ (sp > m->beginp &&
+ !ISWORD(*(sp-1))) ) &&
+ (sp < m->endp && ISWORD(*sp)) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case OEOW:
+ if (( (sp == m->endp && !(m->eflags®_NOTEOL)) ||
+ (sp < m->endp && *sp == '\n' &&
+ (m->g->cflags®_NEWLINE)) ||
+ (sp < m->endp && !ISWORD(*sp)) ) &&
+ (sp > m->beginp && ISWORD(*(sp-1))) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case O_QUEST:
+ break;
+ case OOR1: /* matches null but needs to skip */
+ ss++;
+ s = m->g->strip[ss];
+ do {
+ assert(OP(s) == OOR2);
+ ss += OPND(s);
+ } while (OP(s = m->g->strip[ss]) != O_CH);
+ /* note that the ss++ gets us past the O_CH */
+ break;
+ default: /* have to make a choice */
+ hard = 1;
+ break;
+ }
+ if (!hard) { /* that was it! */
+ if (sp != stop)
+ return(NULL);
+ return(sp);
+ }
+ ss--; /* adjust for the for's final increment */
+
+ /* the hard stuff */
+ AT("hard", sp, stop, ss, stopst);
+ s = m->g->strip[ss];
+ switch (OP(s)) {
+ case OBACK_: /* the vilest depths */
+ i = OPND(s);
+ assert(0 < i && i <= m->g->nsub);
+ if (m->pmatch[i].rm_eo == -1)
+ return(NULL);
+ assert(m->pmatch[i].rm_so != -1);
+ len = m->pmatch[i].rm_eo - m->pmatch[i].rm_so;
+ assert(stop - m->beginp >= len);
+ if (sp > stop - len)
+ return(NULL); /* not enough left to match */
+ ssp = m->offp + m->pmatch[i].rm_so;
+ if (memcmp(sp, ssp, len) != 0)
+ return(NULL);
+ while (m->g->strip[ss] != SOP(O_BACK, i))
+ ss++;
+ return(backref(m, sp+len, stop, ss+1, stopst, lev));
+ break;
+ case OQUEST_: /* to null or not */
+ dp = backref(m, sp, stop, ss+1, stopst, lev);
+ if (dp != NULL)
+ return(dp); /* not */
+ return(backref(m, sp, stop, ss+OPND(s)+1, stopst, lev));
+ break;
+ case OPLUS_:
+ assert(m->lastpos != NULL);
+ assert(lev+1 <= m->g->nplus);
+ m->lastpos[lev+1] = sp;
+ return(backref(m, sp, stop, ss+1, stopst, lev+1));
+ break;
+ case O_PLUS:
+ if (sp == m->lastpos[lev]) /* last pass matched null */
+ return(backref(m, sp, stop, ss+1, stopst, lev-1));
+ /* try another pass */
+ m->lastpos[lev] = sp;
+ dp = backref(m, sp, stop, ss-OPND(s)+1, stopst, lev);
+ if (dp == NULL)
+ return(backref(m, sp, stop, ss+1, stopst, lev-1));
+ else
+ return(dp);
+ break;
+ case OCH_: /* find the right one, if any */
+ ssub = ss + 1;
+ esub = ss + OPND(s) - 1;
+ assert(OP(m->g->strip[esub]) == OOR1);
+ for (;;) { /* find first matching branch */
+ dp = backref(m, sp, stop, ssub, esub, lev);
+ if (dp != NULL)
+ return(dp);
+ /* that one missed, try next one */
+ if (OP(m->g->strip[esub]) == O_CH)
+ return(NULL); /* there is none */
+ esub++;
+ assert(OP(m->g->strip[esub]) == OOR2);
+ ssub = esub + 1;
+ esub += OPND(m->g->strip[esub]);
+ if (OP(m->g->strip[esub]) == OOR2)
+ esub--;
+ else
+ assert(OP(m->g->strip[esub]) == O_CH);
+ }
+ break;
+ case OLPAREN: /* must undo assignment if rest fails */
+ i = OPND(s);
+ assert(0 < i && i <= m->g->nsub);
+ offsave = m->pmatch[i].rm_so;
+ m->pmatch[i].rm_so = sp - m->offp;
+ dp = backref(m, sp, stop, ss+1, stopst, lev);
+ if (dp != NULL)
+ return(dp);
+ m->pmatch[i].rm_so = offsave;
+ return(NULL);
+ break;
+ case ORPAREN: /* must undo assignment if rest fails */
+ i = OPND(s);
+ assert(0 < i && i <= m->g->nsub);
+ offsave = m->pmatch[i].rm_eo;
+ m->pmatch[i].rm_eo = sp - m->offp;
+ dp = backref(m, sp, stop, ss+1, stopst, lev);
+ if (dp != NULL)
+ return(dp);
+ m->pmatch[i].rm_eo = offsave;
+ return(NULL);
+ break;
+ default: /* uh oh */
+ assert(nope);
+ break;
+ }
+
+ /* "can't happen" */
+ assert(nope);
+ /* NOTREACHED */
+ return((char *)NULL); /* dummy */
+}
+
+/*
+ - fast - step through the string at top speed
+ == static char *fast(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst);
+ */
+static char * /* where tentative match ended, or NULL */
+fast(m, start, stop, startst, stopst)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+{
+ register states st = m->st;
+ register states fresh = m->fresh;
+ register states tmp = m->tmp;
+ register char *p = start;
+ register int c = (start == m->beginp) ? OUT : *(start-1);
+ register int lastc; /* previous c */
+ register int flagch;
+ register int i;
+ register char *coldp; /* last p after which no match was underway */
+
+ CLEAR(st);
+ SET1(st, startst);
+ st = step(m->g, startst, stopst, st, NOTHING, st);
+ ASSIGN(fresh, st);
+ SP("start", st, *p);
+ coldp = NULL;
+ for (;;) {
+ /* next character */
+ lastc = c;
+ c = (p == m->endp) ? OUT : *p;
+ if (EQ(st, fresh))
+ coldp = p;
+
+ /* is there an EOL and/or BOL between lastc and c? */
+ flagch = '\0';
+ i = 0;
+ if ( (lastc == '\n' && m->g->cflags®_NEWLINE) ||
+ (lastc == OUT && !(m->eflags®_NOTBOL)) ) {
+ flagch = BOL;
+ i = m->g->nbol;
+ }
+ if ( (c == '\n' && m->g->cflags®_NEWLINE) ||
+ (c == OUT && !(m->eflags®_NOTEOL)) ) {
+ flagch = (flagch == BOL) ? BOLEOL : EOL;
+ i += m->g->neol;
+ }
+ if (i != 0) {
+ for (; i > 0; i--)
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("boleol", st, c);
+ }
+
+ /* how about a word boundary? */
+ if ( (flagch == BOL || (lastc != OUT && !ISWORD(lastc))) &&
+ (c != OUT && ISWORD(c)) ) {
+ flagch = BOW;
+ }
+ if ( (lastc != OUT && ISWORD(lastc)) &&
+ (flagch == EOL || (c != OUT && !ISWORD(c))) ) {
+ flagch = EOW;
+ }
+ if (flagch == BOW || flagch == EOW) {
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("boweow", st, c);
+ }
+
+ /* are we done? */
+ if (ISSET(st, stopst) || p == stop)
+ break; /* NOTE BREAK OUT */
+
+ /* no, we must deal with this character */
+ ASSIGN(tmp, st);
+ ASSIGN(st, fresh);
+ assert(c != OUT);
+ st = step(m->g, startst, stopst, tmp, c, st);
+ SP("aft", st, c);
+ assert(EQ(step(m->g, startst, stopst, st, NOTHING, st), st));
+ p++;
+ }
+
+ assert(coldp != NULL);
+ m->coldp = coldp;
+ if (ISSET(st, stopst))
+ return(p+1);
+ else
+ return(NULL);
+}
+
+/*
+ - slow - step through the string more deliberately
+ == static char *slow(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst);
+ */
+static char * /* where it ended */
+slow(m, start, stop, startst, stopst)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+{
+ register states st = m->st;
+ register states empty = m->empty;
+ register states tmp = m->tmp;
+ register char *p = start;
+ register int c = (start == m->beginp) ? OUT : *(start-1);
+ register int lastc; /* previous c */
+ register int flagch;
+ register int i;
+ register char *matchp; /* last p at which a match ended */
+
+ AT("slow", start, stop, startst, stopst);
+ CLEAR(st);
+ SET1(st, startst);
+ SP("sstart", st, *p);
+ st = step(m->g, startst, stopst, st, NOTHING, st);
+ matchp = NULL;
+ for (;;) {
+ /* next character */
+ lastc = c;
+ c = (p == m->endp) ? OUT : *p;
+
+ /* is there an EOL and/or BOL between lastc and c? */
+ flagch = '\0';
+ i = 0;
+ if ( (lastc == '\n' && m->g->cflags®_NEWLINE) ||
+ (lastc == OUT && !(m->eflags®_NOTBOL)) ) {
+ flagch = BOL;
+ i = m->g->nbol;
+ }
+ if ( (c == '\n' && m->g->cflags®_NEWLINE) ||
+ (c == OUT && !(m->eflags®_NOTEOL)) ) {
+ flagch = (flagch == BOL) ? BOLEOL : EOL;
+ i += m->g->neol;
+ }
+ if (i != 0) {
+ for (; i > 0; i--)
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("sboleol", st, c);
+ }
+
+ /* how about a word boundary? */
+ if ( (flagch == BOL || (lastc != OUT && !ISWORD(lastc))) &&
+ (c != OUT && ISWORD(c)) ) {
+ flagch = BOW;
+ }
+ if ( (lastc != OUT && ISWORD(lastc)) &&
+ (flagch == EOL || (c != OUT && !ISWORD(c))) ) {
+ flagch = EOW;
+ }
+ if (flagch == BOW || flagch == EOW) {
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("sboweow", st, c);
+ }
+
+ /* are we done? */
+ if (ISSET(st, stopst))
+ matchp = p;
+ if (EQ(st, empty) || p == stop)
+ break; /* NOTE BREAK OUT */
+
+ /* no, we must deal with this character */
+ ASSIGN(tmp, st);
+ ASSIGN(st, empty);
+ assert(c != OUT);
+ st = step(m->g, startst, stopst, tmp, c, st);
+ SP("saft", st, c);
+ assert(EQ(step(m->g, startst, stopst, st, NOTHING, st), st));
+ p++;
+ }
+
+ return(matchp);
+}
+
+
+/*
+ - step - map set of states reachable before char to set reachable after
+ == static states step(register struct re_guts *g, sopno start, sopno stop, \
+ == register states bef, int ch, register states aft);
+ == #define BOL (OUT+1)
+ == #define EOL (BOL+1)
+ == #define BOLEOL (BOL+2)
+ == #define NOTHING (BOL+3)
+ == #define BOW (BOL+4)
+ == #define EOW (BOL+5)
+ == #define CODEMAX (BOL+5) // highest code used
+ == #define NONCHAR(c) ((c) > CHAR_MAX)
+ == #define NNONCHAR (CODEMAX-CHAR_MAX)
+ */
+static states
+step(g, start, stop, bef, ch, aft)
+register struct re_guts *g;
+sopno start; /* start state within strip */
+sopno stop; /* state after stop state within strip */
+register states bef; /* states reachable before */
+int ch; /* character or NONCHAR code */
+register states aft; /* states already known reachable after */
+{
+ register cset *cs;
+ register sop s;
+ register sopno pc;
+ register onestate here; /* note, macros know this name */
+ register sopno look;
+ register long i;
+
+ for (pc = start, INIT(here, pc); pc != stop; pc++, INC(here)) {
+ s = g->strip[pc];
+ switch (OP(s)) {
+ case OEND:
+ assert(pc == stop-1);
+ break;
+ case OCHAR:
+ /* only characters can match */
+ assert(!NONCHAR(ch) || ch != (char)OPND(s));
+ if (ch == (char)OPND(s))
+ FWD(aft, bef, 1);
+ break;
+ case OBOL:
+ if (ch == BOL || ch == BOLEOL)
+ FWD(aft, bef, 1);
+ break;
+ case OEOL:
+ if (ch == EOL || ch == BOLEOL)
+ FWD(aft, bef, 1);
+ break;
+ case OBOW:
+ if (ch == BOW)
+ FWD(aft, bef, 1);
+ break;
+ case OEOW:
+ if (ch == EOW)
+ FWD(aft, bef, 1);
+ break;
+ case OANY:
+ if (!NONCHAR(ch))
+ FWD(aft, bef, 1);
+ break;
+ case OANYOF:
+ cs = &g->sets[OPND(s)];
+ if (!NONCHAR(ch) && CHIN(cs, ch))
+ FWD(aft, bef, 1);
+ break;
+ case OBACK_: /* ignored here */
+ case O_BACK:
+ FWD(aft, aft, 1);
+ break;
+ case OPLUS_: /* forward, this is just an empty */
+ FWD(aft, aft, 1);
+ break;
+ case O_PLUS: /* both forward and back */
+ FWD(aft, aft, 1);
+ i = ISSETBACK(aft, OPND(s));
+ BACK(aft, aft, OPND(s));
+ if (!i && ISSETBACK(aft, OPND(s))) {
+ /* oho, must reconsider loop body */
+ pc -= OPND(s) + 1;
+ INIT(here, pc);
+ }
+ break;
+ case OQUEST_: /* two branches, both forward */
+ FWD(aft, aft, 1);
+ FWD(aft, aft, OPND(s));
+ break;
+ case O_QUEST: /* just an empty */
+ FWD(aft, aft, 1);
+ break;
+ case OLPAREN: /* not significant here */
+ case ORPAREN:
+ FWD(aft, aft, 1);
+ break;
+ case OCH_: /* mark the first two branches */
+ FWD(aft, aft, 1);
+ assert(OP(g->strip[pc+OPND(s)]) == OOR2);
+ FWD(aft, aft, OPND(s));
+ break;
+ case OOR1: /* done a branch, find the O_CH */
+ if (ISSTATEIN(aft, here)) {
+ for (look = 1;
+ OP(s = g->strip[pc+look]) != O_CH;
+ look += OPND(s))
+ assert(OP(s) == OOR2);
+ FWD(aft, aft, look);
+ }
+ break;
+ case OOR2: /* propagate OCH_'s marking */
+ FWD(aft, aft, 1);
+ if (OP(g->strip[pc+OPND(s)]) != O_CH) {
+ assert(OP(g->strip[pc+OPND(s)]) == OOR2);
+ FWD(aft, aft, OPND(s));
+ }
+ break;
+ case O_CH: /* just empty */
+ FWD(aft, aft, 1);
+ break;
+ default: /* ooooops... */
+ assert(nope);
+ break;
+ }
+ }
+
+ return(aft);
+}
+
+#undef matcher
+#undef fast
+#undef slow
+#undef dissect
+#undef backref
+#undef step
+#undef print
+#undef at
+#undef match
+
+/* now undo things */
+#undef states
+#undef CLEAR
+#undef SET0
+#undef SET1
+#undef ISSET
+#undef ASSIGN
+#undef EQ
+#undef STATEVARS
+#undef STATESETUP
+#undef STATETEARDOWN
+#undef SETUP
+#undef onestate
+#undef INIT
+#undef INC
+#undef ISSTATEIN
+#undef FWD
+#undef BACK
+#undef ISSETBACK
+#undef SNAMES
+
+/* macros for manipulating states, large version */
+#define states char *
+#define CLEAR(v) memset(v, 0, m->g->nstates)
+#define SET0(v, n) ((v)[n] = 0)
+#define SET1(v, n) ((v)[n] = 1)
+#define ISSET(v, n) ((v)[n])
+#define ASSIGN(d, s) memcpy(d, s, m->g->nstates)
+#define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0)
+#define STATEVARS int vn; char *space
+#define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \
+ if ((m)->space == NULL) return(REG_ESPACE); \
+ (m)->vn = 0; }
+#define STATETEARDOWN(m) { free((m)->space); }
+#define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates])
+#define onestate int
+#define INIT(o, n) ((o) = (n))
+#define INC(o) ((o)++)
+#define ISSTATEIN(v, o) ((v)[o])
+/* some abbreviations; note that some of these know variable names! */
+/* do "if I'm here, I can also be there" etc without branches */
+#define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here])
+#define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here])
+#define ISSETBACK(v, n) ((v)[here - (n)])
+/* function names */
+#define LNAMES /* flag */
+
+/*
+ * The matching engine and friends. This file is #included by regexec.c
+ * after suitable #defines of a variety of macros used herein, so that
+ * different state representations can be used without duplicating masses
+ * of code.
+ */
+
+#ifdef SNAMES
+#define matcher smatcher
+#define fast sfast
+#define slow sslow
+#define dissect sdissect
+#define backref sbackref
+#define step sstep
+#define print sprint
+#define at sat
+#define match smat
+#endif
+#ifdef LNAMES
+#define matcher lmatcher
+#define fast lfast
+#define slow lslow
+#define dissect ldissect
+#define backref lbackref
+#define step lstep
+#define print lprint
+#define at lat
+#define match lmat
+#endif
+
+/* another structure passed up and down to avoid zillions of parameters */
+struct match {
+ struct re_guts *g;
+ int eflags;
+ regmatch_t *pmatch; /* [nsub+1] (0 element unused) */
+ char *offp; /* offsets work from here */
+ char *beginp; /* start of string -- virtual NUL precedes */
+ char *endp; /* end of string -- virtual NUL here */
+ char *coldp; /* can be no match starting before here */
+ char **lastpos; /* [nplus+1] */
+ STATEVARS;
+ states st; /* current states */
+ states fresh; /* states for a fresh start */
+ states tmp; /* temporary */
+ states empty; /* empty set of states */
+};
+
+static int matcher(register struct re_guts *g, char *string, size_t nmatch, regmatch_t pmatch[], int eflags);
+static char *dissect(register struct match *m, char *start, char *stop, sopno startst, sopno stopst);
+static char *backref(register struct match *m, char *start, char *stop, sopno startst, sopno stopst, sopno lev);
+static char *fast(register struct match *m, char *start, char *stop, sopno startst, sopno stopst);
+static char *slow(register struct match *m, char *start, char *stop, sopno startst, sopno stopst);
+static states step(register struct re_guts *g, sopno start, sopno stop, register states bef, int ch, register states aft);
+#define BOL (OUT+1)
+#define EOL (BOL+1)
+#define BOLEOL (BOL+2)
+#define NOTHING (BOL+3)
+#define BOW (BOL+4)
+#define EOW (BOL+5)
+#define CODEMAX (BOL+5) /* highest code used */
+#define NONCHAR(c) ((c) > CHAR_MAX)
+#define NNONCHAR (CODEMAX-CHAR_MAX)
+#define SP(t, s, c) /* nothing */
+#define AT(t, p1, p2, s1, s2) /* nothing */
+#define NOTE(s) /* nothing */
+
+/*
+ - matcher - the actual matching engine
+ == static int matcher(register struct re_guts *g, char *string, \
+ == size_t nmatch, regmatch_t pmatch[], int eflags);
+ */
+static int /* 0 success, REG_NOMATCH failure */
+matcher(g, string, nmatch, pmatch, eflags)
+register struct re_guts *g;
+char *string;
+size_t nmatch;
+regmatch_t pmatch[];
+int eflags;
+{
+ register char *endp;
+ register int i;
+ struct match mv;
+ register struct match *m = &mv;
+ register char *dp;
+ const register sopno gf = g->firststate+1; /* +1 for OEND */
+ const register sopno gl = g->laststate;
+ char *start;
+ char *stop;
+
+ /* simplify the situation where possible */
+ if (g->cflags®_NOSUB)
+ nmatch = 0;
+ if (eflags®_STARTEND) {
+ start = string + pmatch[0].rm_so;
+ stop = string + pmatch[0].rm_eo;
+ } else {
+ start = string;
+ stop = start + strlen(start);
+ }
+ if (stop < start)
+ return(REG_INVARG);
+
+ /* prescreening; this does wonders for this rather slow code */
+ if (g->must != NULL) {
+ for (dp = start; dp < stop; dp++)
+ if (*dp == g->must[0] && stop - dp >= g->mlen &&
+ memcmp(dp, g->must, (size_t)g->mlen) == 0)
+ break;
+ if (dp == stop) /* we didn't find g->must */
+ return(REG_NOMATCH);
+ }
+
+ /* match struct setup */
+ m->g = g;
+ m->eflags = eflags;
+ m->pmatch = NULL;
+ m->lastpos = NULL;
+ m->offp = string;
+ m->beginp = start;
+ m->endp = stop;
+ STATESETUP(m, 4);
+ SETUP(m->st);
+ SETUP(m->fresh);
+ SETUP(m->tmp);
+ SETUP(m->empty);
+ CLEAR(m->empty);
+
+ /* this loop does only one repetition except for backrefs */
+ for (;;) {
+ endp = fast(m, start, stop, gf, gl);
+ if (endp == NULL) { /* a miss */
+ STATETEARDOWN(m);
+ return(REG_NOMATCH);
+ }
+ if (nmatch == 0 && !g->backrefs)
+ break; /* no further info needed */
+
+ /* where? */
+ assert(m->coldp != NULL);
+ for (;;) {
+ NOTE("finding start");
+ endp = slow(m, m->coldp, stop, gf, gl);
+ if (endp != NULL)
+ break;
+ assert(m->coldp < m->endp);
+ m->coldp++;
+ }
+ if (nmatch == 1 && !g->backrefs)
+ break; /* no further info needed */
+
+ /* oh my, he wants the subexpressions... */
+ if (m->pmatch == NULL)
+ m->pmatch = (regmatch_t *)malloc((m->g->nsub + 1) *
+ sizeof(regmatch_t));
+ if (m->pmatch == NULL) {
+ STATETEARDOWN(m);
+ return(REG_ESPACE);
+ }
+ for (i = 1; i <= m->g->nsub; i++)
+ m->pmatch[i].rm_so = m->pmatch[i].rm_eo = -1;
+ if (!g->backrefs && !(m->eflags®_BACKR)) {
+ NOTE("dissecting");
+ dp = dissect(m, m->coldp, endp, gf, gl);
+ } else {
+ if (g->nplus > 0 && m->lastpos == NULL)
+ m->lastpos = (char **)malloc((g->nplus+1) *
+ sizeof(char *));
+ if (g->nplus > 0 && m->lastpos == NULL) {
+ free(m->pmatch);
+ STATETEARDOWN(m);
+ return(REG_ESPACE);
+ }
+ NOTE("backref dissect");
+ dp = backref(m, m->coldp, endp, gf, gl, (sopno)0);
+ }
+ if (dp != NULL)
+ break;
+
+ /* uh-oh... we couldn't find a subexpression-level match */
+ assert(g->backrefs); /* must be back references doing it */
+ assert(g->nplus == 0 || m->lastpos != NULL);
+ for (;;) {
+ if (dp != NULL || endp <= m->coldp)
+ break; /* defeat */
+ NOTE("backoff");
+ endp = slow(m, m->coldp, endp-1, gf, gl);
+ if (endp == NULL)
+ break; /* defeat */
+ /* try it on a shorter possibility */
+ NOTE("backoff dissect");
+ dp = backref(m, m->coldp, endp, gf, gl, (sopno)0);
+ }
+ assert(dp == NULL || dp == endp);
+ if (dp != NULL) /* found a shorter one */
+ break;
+
+ /* despite initial appearances, there is no match here */
+ NOTE("false alarm");
+ start = m->coldp + 1; /* recycle starting later */
+ assert(start <= stop);
+ }
+
+ /* fill in the details if requested */
+ if (nmatch > 0) {
+ pmatch[0].rm_so = m->coldp - m->offp;
+ pmatch[0].rm_eo = endp - m->offp;
+ }
+ if (nmatch > 1) {
+ assert(m->pmatch != NULL);
+ for (i = 1; i < nmatch; i++)
+ if (i <= m->g->nsub)
+ pmatch[i] = m->pmatch[i];
+ else {
+ pmatch[i].rm_so = -1;
+ pmatch[i].rm_eo = -1;
+ }
+ }
+
+ if (m->pmatch != NULL)
+ free((char *)m->pmatch);
+ if (m->lastpos != NULL)
+ free((char *)m->lastpos);
+ STATETEARDOWN(m);
+ return(0);
+}
+
+/*
+ - dissect - figure out what matched what, no back references
+ == static char *dissect(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst);
+ */
+static char * /* == stop (success) always */
+dissect(m, start, stop, startst, stopst)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+{
+ register int i;
+ register sopno ss; /* start sop of current subRE */
+ register sopno es; /* end sop of current subRE */
+ register char *sp; /* start of string matched by it */
+ register char *stp; /* string matched by it cannot pass here */
+ register char *rest; /* start of rest of string */
+ register char *tail; /* string unmatched by rest of RE */
+ register sopno ssub; /* start sop of subsubRE */
+ register sopno esub; /* end sop of subsubRE */
+ register char *ssp; /* start of string matched by subsubRE */
+ register char *sep; /* end of string matched by subsubRE */
+ register char *oldssp; /* previous ssp */
+ register char *dp;
+
+ AT("diss", start, stop, startst, stopst);
+ sp = start;
+ for (ss = startst; ss < stopst; ss = es) {
+ /* identify end of subRE */
+ es = ss;
+ switch (OP(m->g->strip[es])) {
+ case OPLUS_:
+ case OQUEST_:
+ es += OPND(m->g->strip[es]);
+ break;
+ case OCH_:
+ while (OP(m->g->strip[es]) != O_CH)
+ es += OPND(m->g->strip[es]);
+ break;
+ }
+ es++;
+
+ /* figure out what it matched */
+ switch (OP(m->g->strip[ss])) {
+ case OEND:
+ assert(nope);
+ break;
+ case OCHAR:
+ sp++;
+ break;
+ case OBOL:
+ case OEOL:
+ case OBOW:
+ case OEOW:
+ break;
+ case OANY:
+ case OANYOF:
+ sp++;
+ break;
+ case OBACK_:
+ case O_BACK:
+ assert(nope);
+ break;
+ /* cases where length of match is hard to find */
+ case OQUEST_:
+ stp = stop;
+ for (;;) {
+ /* how long could this one be? */
+ rest = slow(m, sp, stp, ss, es);
+ assert(rest != NULL); /* it did match */
+ /* could the rest match the rest? */
+ tail = slow(m, rest, stop, es, stopst);
+ if (tail == stop)
+ break; /* yes! */
+ /* no -- try a shorter match for this one */
+ stp = rest - 1;
+ assert(stp >= sp); /* it did work */
+ }
+ ssub = ss + 1;
+ esub = es - 1;
+ /* did innards match? */
+ if (slow(m, sp, rest, ssub, esub) != NULL) {
+ dp = dissect(m, sp, rest, ssub, esub);
+ assert(dp == rest);
+ } else /* no */
+ assert(sp == rest);
+ sp = rest;
+ break;
+ case OPLUS_:
+ stp = stop;
+ for (;;) {
+ /* how long could this one be? */
+ rest = slow(m, sp, stp, ss, es);
+ assert(rest != NULL); /* it did match */
+ /* could the rest match the rest? */
+ tail = slow(m, rest, stop, es, stopst);
+ if (tail == stop)
+ break; /* yes! */
+ /* no -- try a shorter match for this one */
+ stp = rest - 1;
+ assert(stp >= sp); /* it did work */
+ }
+ ssub = ss + 1;
+ esub = es - 1;
+ ssp = sp;
+ oldssp = ssp;
+ for (;;) { /* find last match of innards */
+ sep = slow(m, ssp, rest, ssub, esub);
+ if (sep == NULL || sep == ssp)
+ break; /* failed or matched null */
+ oldssp = ssp; /* on to next try */
+ ssp = sep;
+ }
+ if (sep == NULL) {
+ /* last successful match */
+ sep = ssp;
+ ssp = oldssp;
+ }
+ assert(sep == rest); /* must exhaust substring */
+ assert(slow(m, ssp, sep, ssub, esub) == rest);
+ dp = dissect(m, ssp, sep, ssub, esub);
+ assert(dp == sep);
+ sp = rest;
+ break;
+ case OCH_:
+ stp = stop;
+ for (;;) {
+ /* how long could this one be? */
+ rest = slow(m, sp, stp, ss, es);
+ assert(rest != NULL); /* it did match */
+ /* could the rest match the rest? */
+ tail = slow(m, rest, stop, es, stopst);
+ if (tail == stop)
+ break; /* yes! */
+ /* no -- try a shorter match for this one */
+ stp = rest - 1;
+ assert(stp >= sp); /* it did work */
+ }
+ ssub = ss + 1;
+ esub = ss + OPND(m->g->strip[ss]) - 1;
+ assert(OP(m->g->strip[esub]) == OOR1);
+ for (;;) { /* find first matching branch */
+ if (slow(m, sp, rest, ssub, esub) == rest)
+ break; /* it matched all of it */
+ /* that one missed, try next one */
+ assert(OP(m->g->strip[esub]) == OOR1);
+ esub++;
+ assert(OP(m->g->strip[esub]) == OOR2);
+ ssub = esub + 1;
+ esub += OPND(m->g->strip[esub]);
+ if (OP(m->g->strip[esub]) == OOR2)
+ esub--;
+ else
+ assert(OP(m->g->strip[esub]) == O_CH);
+ }
+ dp = dissect(m, sp, rest, ssub, esub);
+ assert(dp == rest);
+ sp = rest;
+ break;
+ case O_PLUS:
+ case O_QUEST:
+ case OOR1:
+ case OOR2:
+ case O_CH:
+ assert(nope);
+ break;
+ case OLPAREN:
+ i = OPND(m->g->strip[ss]);
+ assert(0 < i && i <= m->g->nsub);
+ m->pmatch[i].rm_so = sp - m->offp;
+ break;
+ case ORPAREN:
+ i = OPND(m->g->strip[ss]);
+ assert(0 < i && i <= m->g->nsub);
+ m->pmatch[i].rm_eo = sp - m->offp;
+ break;
+ default: /* uh oh */
+ assert(nope);
+ break;
+ }
+ }
+
+ assert(sp == stop);
+ return(sp);
+}
+
+/*
+ - backref - figure out what matched what, figuring in back references
+ == static char *backref(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst, sopno lev);
+ */
+static char * /* == stop (success) or NULL (failure) */
+backref(m, start, stop, startst, stopst, lev)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+sopno lev; /* PLUS nesting level */
+{
+ register int i;
+ register sopno ss; /* start sop of current subRE */
+ register char *sp; /* start of string matched by it */
+ register sopno ssub; /* start sop of subsubRE */
+ register sopno esub; /* end sop of subsubRE */
+ register char *ssp; /* start of string matched by subsubRE */
+ register char *dp;
+ register size_t len;
+ register int hard;
+ register sop s;
+ register regoff_t offsave;
+ register cset *cs;
+
+ AT("back", start, stop, startst, stopst);
+ sp = start;
+
+ /* get as far as we can with easy stuff */
+ hard = 0;
+ for (ss = startst; !hard && ss < stopst; ss++)
+ switch (OP(s = m->g->strip[ss])) {
+ case OCHAR:
+ if (sp == stop || *sp++ != (char)OPND(s))
+ return(NULL);
+ break;
+ case OANY:
+ if (sp == stop)
+ return(NULL);
+ sp++;
+ break;
+ case OANYOF:
+ cs = &m->g->sets[OPND(s)];
+ if (sp == stop || !CHIN(cs, *sp++))
+ return(NULL);
+ break;
+ case OBOL:
+ if ( (sp == m->beginp && !(m->eflags®_NOTBOL)) ||
+ (sp < m->endp && *(sp-1) == '\n' &&
+ (m->g->cflags®_NEWLINE)) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case OEOL:
+ if ( (sp == m->endp && !(m->eflags®_NOTEOL)) ||
+ (sp < m->endp && *sp == '\n' &&
+ (m->g->cflags®_NEWLINE)) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case OBOW:
+ if (( (sp == m->beginp && !(m->eflags®_NOTBOL)) ||
+ (sp < m->endp && *(sp-1) == '\n' &&
+ (m->g->cflags®_NEWLINE)) ||
+ (sp > m->beginp &&
+ !ISWORD(*(sp-1))) ) &&
+ (sp < m->endp && ISWORD(*sp)) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case OEOW:
+ if (( (sp == m->endp && !(m->eflags®_NOTEOL)) ||
+ (sp < m->endp && *sp == '\n' &&
+ (m->g->cflags®_NEWLINE)) ||
+ (sp < m->endp && !ISWORD(*sp)) ) &&
+ (sp > m->beginp && ISWORD(*(sp-1))) )
+ { /* yes */ }
+ else
+ return(NULL);
+ break;
+ case O_QUEST:
+ break;
+ case OOR1: /* matches null but needs to skip */
+ ss++;
+ s = m->g->strip[ss];
+ do {
+ assert(OP(s) == OOR2);
+ ss += OPND(s);
+ } while (OP(s = m->g->strip[ss]) != O_CH);
+ /* note that the ss++ gets us past the O_CH */
+ break;
+ default: /* have to make a choice */
+ hard = 1;
+ break;
+ }
+ if (!hard) { /* that was it! */
+ if (sp != stop)
+ return(NULL);
+ return(sp);
+ }
+ ss--; /* adjust for the for's final increment */
+
+ /* the hard stuff */
+ AT("hard", sp, stop, ss, stopst);
+ s = m->g->strip[ss];
+ switch (OP(s)) {
+ case OBACK_: /* the vilest depths */
+ i = OPND(s);
+ assert(0 < i && i <= m->g->nsub);
+ if (m->pmatch[i].rm_eo == -1)
+ return(NULL);
+ assert(m->pmatch[i].rm_so != -1);
+ len = m->pmatch[i].rm_eo - m->pmatch[i].rm_so;
+ assert(stop - m->beginp >= len);
+ if (sp > stop - len)
+ return(NULL); /* not enough left to match */
+ ssp = m->offp + m->pmatch[i].rm_so;
+ if (memcmp(sp, ssp, len) != 0)
+ return(NULL);
+ while (m->g->strip[ss] != SOP(O_BACK, i))
+ ss++;
+ return(backref(m, sp+len, stop, ss+1, stopst, lev));
+ break;
+ case OQUEST_: /* to null or not */
+ dp = backref(m, sp, stop, ss+1, stopst, lev);
+ if (dp != NULL)
+ return(dp); /* not */
+ return(backref(m, sp, stop, ss+OPND(s)+1, stopst, lev));
+ break;
+ case OPLUS_:
+ assert(m->lastpos != NULL);
+ assert(lev+1 <= m->g->nplus);
+ m->lastpos[lev+1] = sp;
+ return(backref(m, sp, stop, ss+1, stopst, lev+1));
+ break;
+ case O_PLUS:
+ if (sp == m->lastpos[lev]) /* last pass matched null */
+ return(backref(m, sp, stop, ss+1, stopst, lev-1));
+ /* try another pass */
+ m->lastpos[lev] = sp;
+ dp = backref(m, sp, stop, ss-OPND(s)+1, stopst, lev);
+ if (dp == NULL)
+ return(backref(m, sp, stop, ss+1, stopst, lev-1));
+ else
+ return(dp);
+ break;
+ case OCH_: /* find the right one, if any */
+ ssub = ss + 1;
+ esub = ss + OPND(s) - 1;
+ assert(OP(m->g->strip[esub]) == OOR1);
+ for (;;) { /* find first matching branch */
+ dp = backref(m, sp, stop, ssub, esub, lev);
+ if (dp != NULL)
+ return(dp);
+ /* that one missed, try next one */
+ if (OP(m->g->strip[esub]) == O_CH)
+ return(NULL); /* there is none */
+ esub++;
+ assert(OP(m->g->strip[esub]) == OOR2);
+ ssub = esub + 1;
+ esub += OPND(m->g->strip[esub]);
+ if (OP(m->g->strip[esub]) == OOR2)
+ esub--;
+ else
+ assert(OP(m->g->strip[esub]) == O_CH);
+ }
+ break;
+ case OLPAREN: /* must undo assignment if rest fails */
+ i = OPND(s);
+ assert(0 < i && i <= m->g->nsub);
+ offsave = m->pmatch[i].rm_so;
+ m->pmatch[i].rm_so = sp - m->offp;
+ dp = backref(m, sp, stop, ss+1, stopst, lev);
+ if (dp != NULL)
+ return(dp);
+ m->pmatch[i].rm_so = offsave;
+ return(NULL);
+ break;
+ case ORPAREN: /* must undo assignment if rest fails */
+ i = OPND(s);
+ assert(0 < i && i <= m->g->nsub);
+ offsave = m->pmatch[i].rm_eo;
+ m->pmatch[i].rm_eo = sp - m->offp;
+ dp = backref(m, sp, stop, ss+1, stopst, lev);
+ if (dp != NULL)
+ return(dp);
+ m->pmatch[i].rm_eo = offsave;
+ return(NULL);
+ break;
+ default: /* uh oh */
+ assert(nope);
+ break;
+ }
+
+ /* "can't happen" */
+ assert(nope);
+ /* NOTREACHED */
+ return((char *)NULL); /* dummy */
+}
+
+/*
+ - fast - step through the string at top speed
+ == static char *fast(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst);
+ */
+static char * /* where tentative match ended, or NULL */
+fast(m, start, stop, startst, stopst)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+{
+ register states st = m->st;
+ register states fresh = m->fresh;
+ register states tmp = m->tmp;
+ register char *p = start;
+ register int c = (start == m->beginp) ? OUT : *(start-1);
+ register int lastc; /* previous c */
+ register int flagch;
+ register int i;
+ register char *coldp; /* last p after which no match was underway */
+
+ CLEAR(st);
+ SET1(st, startst);
+ st = step(m->g, startst, stopst, st, NOTHING, st);
+ ASSIGN(fresh, st);
+ SP("start", st, *p);
+ coldp = NULL;
+ for (;;) {
+ /* next character */
+ lastc = c;
+ c = (p == m->endp) ? OUT : *p;
+ if (EQ(st, fresh))
+ coldp = p;
+
+ /* is there an EOL and/or BOL between lastc and c? */
+ flagch = '\0';
+ i = 0;
+ if ( (lastc == '\n' && m->g->cflags®_NEWLINE) ||
+ (lastc == OUT && !(m->eflags®_NOTBOL)) ) {
+ flagch = BOL;
+ i = m->g->nbol;
+ }
+ if ( (c == '\n' && m->g->cflags®_NEWLINE) ||
+ (c == OUT && !(m->eflags®_NOTEOL)) ) {
+ flagch = (flagch == BOL) ? BOLEOL : EOL;
+ i += m->g->neol;
+ }
+ if (i != 0) {
+ for (; i > 0; i--)
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("boleol", st, c);
+ }
+
+ /* how about a word boundary? */
+ if ( (flagch == BOL || (lastc != OUT && !ISWORD(lastc))) &&
+ (c != OUT && ISWORD(c)) ) {
+ flagch = BOW;
+ }
+ if ( (lastc != OUT && ISWORD(lastc)) &&
+ (flagch == EOL || (c != OUT && !ISWORD(c))) ) {
+ flagch = EOW;
+ }
+ if (flagch == BOW || flagch == EOW) {
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("boweow", st, c);
+ }
+
+ /* are we done? */
+ if (ISSET(st, stopst) || p == stop)
+ break; /* NOTE BREAK OUT */
+
+ /* no, we must deal with this character */
+ ASSIGN(tmp, st);
+ ASSIGN(st, fresh);
+ assert(c != OUT);
+ st = step(m->g, startst, stopst, tmp, c, st);
+ SP("aft", st, c);
+ assert(EQ(step(m->g, startst, stopst, st, NOTHING, st), st));
+ p++;
+ }
+
+ assert(coldp != NULL);
+ m->coldp = coldp;
+ if (ISSET(st, stopst))
+ return(p+1);
+ else
+ return(NULL);
+}
+
+/*
+ - slow - step through the string more deliberately
+ == static char *slow(register struct match *m, char *start, \
+ == char *stop, sopno startst, sopno stopst);
+ */
+static char * /* where it ended */
+slow(m, start, stop, startst, stopst)
+register struct match *m;
+char *start;
+char *stop;
+sopno startst;
+sopno stopst;
+{
+ register states st = m->st;
+ register states empty = m->empty;
+ register states tmp = m->tmp;
+ register char *p = start;
+ register int c = (start == m->beginp) ? OUT : *(start-1);
+ register int lastc; /* previous c */
+ register int flagch;
+ register int i;
+ register char *matchp; /* last p at which a match ended */
+
+ AT("slow", start, stop, startst, stopst);
+ CLEAR(st);
+ SET1(st, startst);
+ SP("sstart", st, *p);
+ st = step(m->g, startst, stopst, st, NOTHING, st);
+ matchp = NULL;
+ for (;;) {
+ /* next character */
+ lastc = c;
+ c = (p == m->endp) ? OUT : *p;
+
+ /* is there an EOL and/or BOL between lastc and c? */
+ flagch = '\0';
+ i = 0;
+ if ( (lastc == '\n' && m->g->cflags®_NEWLINE) ||
+ (lastc == OUT && !(m->eflags®_NOTBOL)) ) {
+ flagch = BOL;
+ i = m->g->nbol;
+ }
+ if ( (c == '\n' && m->g->cflags®_NEWLINE) ||
+ (c == OUT && !(m->eflags®_NOTEOL)) ) {
+ flagch = (flagch == BOL) ? BOLEOL : EOL;
+ i += m->g->neol;
+ }
+ if (i != 0) {
+ for (; i > 0; i--)
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("sboleol", st, c);
+ }
+
+ /* how about a word boundary? */
+ if ( (flagch == BOL || (lastc != OUT && !ISWORD(lastc))) &&
+ (c != OUT && ISWORD(c)) ) {
+ flagch = BOW;
+ }
+ if ( (lastc != OUT && ISWORD(lastc)) &&
+ (flagch == EOL || (c != OUT && !ISWORD(c))) ) {
+ flagch = EOW;
+ }
+ if (flagch == BOW || flagch == EOW) {
+ st = step(m->g, startst, stopst, st, flagch, st);
+ SP("sboweow", st, c);
+ }
+
+ /* are we done? */
+ if (ISSET(st, stopst))
+ matchp = p;
+ if (EQ(st, empty) || p == stop)
+ break; /* NOTE BREAK OUT */
+
+ /* no, we must deal with this character */
+ ASSIGN(tmp, st);
+ ASSIGN(st, empty);
+ assert(c != OUT);
+ st = step(m->g, startst, stopst, tmp, c, st);
+ SP("saft", st, c);
+ assert(EQ(step(m->g, startst, stopst, st, NOTHING, st), st));
+ p++;
+ }
+
+ return(matchp);
+}
+
+
+static states
+step(g, start, stop, bef, ch, aft)
+register struct re_guts *g;
+sopno start; /* start state within strip */
+sopno stop; /* state after stop state within strip */
+register states bef; /* states reachable before */
+int ch; /* character or NONCHAR code */
+register states aft; /* states already known reachable after */
+{
+ register cset *cs;
+ register sop s;
+ register sopno pc;
+ register onestate here; /* note, macros know this name */
+ register sopno look;
+ register long i;
+
+ for (pc = start, INIT(here, pc); pc != stop; pc++, INC(here)) {
+ s = g->strip[pc];
+ switch (OP(s)) {
+ case OEND:
+ assert(pc == stop-1);
+ break;
+ case OCHAR:
+ /* only characters can match */
+ assert(!NONCHAR(ch) || ch != (char)OPND(s));
+ if (ch == (char)OPND(s))
+ FWD(aft, bef, 1);
+ break;
+ case OBOL:
+ if (ch == BOL || ch == BOLEOL)
+ FWD(aft, bef, 1);
+ break;
+ case OEOL:
+ if (ch == EOL || ch == BOLEOL)
+ FWD(aft, bef, 1);
+ break;
+ case OBOW:
+ if (ch == BOW)
+ FWD(aft, bef, 1);
+ break;
+ case OEOW:
+ if (ch == EOW)
+ FWD(aft, bef, 1);
+ break;
+ case OANY:
+ if (!NONCHAR(ch))
+ FWD(aft, bef, 1);
+ break;
+ case OANYOF:
+ cs = &g->sets[OPND(s)];
+ if (!NONCHAR(ch) && CHIN(cs, ch))
+ FWD(aft, bef, 1);
+ break;
+ case OBACK_: /* ignored here */
+ case O_BACK:
+ FWD(aft, aft, 1);
+ break;
+ case OPLUS_: /* forward, this is just an empty */
+ FWD(aft, aft, 1);
+ break;
+ case O_PLUS: /* both forward and back */
+ FWD(aft, aft, 1);
+ i = ISSETBACK(aft, OPND(s));
+ BACK(aft, aft, OPND(s));
+ if (!i && ISSETBACK(aft, OPND(s))) {
+ /* oho, must reconsider loop body */
+ pc -= OPND(s) + 1;
+ INIT(here, pc);
+ }
+ break;
+ case OQUEST_: /* two branches, both forward */
+ FWD(aft, aft, 1);
+ FWD(aft, aft, OPND(s));
+ break;
+ case O_QUEST: /* just an empty */
+ FWD(aft, aft, 1);
+ break;
+ case OLPAREN: /* not significant here */
+ case ORPAREN:
+ FWD(aft, aft, 1);
+ break;
+ case OCH_: /* mark the first two branches */
+ FWD(aft, aft, 1);
+ assert(OP(g->strip[pc+OPND(s)]) == OOR2);
+ FWD(aft, aft, OPND(s));
+ break;
+ case OOR1: /* done a branch, find the O_CH */
+ if (ISSTATEIN(aft, here)) {
+ for (look = 1;
+ OP(s = g->strip[pc+look]) != O_CH;
+ look += OPND(s))
+ assert(OP(s) == OOR2);
+ FWD(aft, aft, look);
+ }
+ break;
+ case OOR2: /* propagate OCH_'s marking */
+ FWD(aft, aft, 1);
+ if (OP(g->strip[pc+OPND(s)]) != O_CH) {
+ assert(OP(g->strip[pc+OPND(s)]) == OOR2);
+ FWD(aft, aft, OPND(s));
+ }
+ break;
+ case O_CH: /* just empty */
+ FWD(aft, aft, 1);
+ break;
+ default: /* ooooops... */
+ assert(nope);
+ break;
+ }
+ }
+
+ return(aft);
+}
+
+#undef matcher
+#undef fast
+#undef slow
+#undef dissect
+#undef backref
+#undef step
+#undef print
+#undef at
+#undef match
+
+int /* 0 success, REG_NOMATCH failure */
+regexec(preg, string, nmatch, pmatch, eflags)
+const regex_t *preg;
+const char *string;
+size_t nmatch;
+regmatch_t pmatch[];
+int eflags;
+{
+ register struct re_guts *g = preg->re_g;
+#define GOODFLAGS(f) ((f)&(REG_NOTBOL|REG_NOTEOL|REG_STARTEND))
+
+ if (preg->re_magic != MAGIC1 || g->magic != MAGIC2)
+ return(REG_BADPAT);
+ assert(!(g->iflags&BAD));
+ if (g->iflags&BAD) /* backstop for no-debug case */
+ return(REG_BADPAT);
+ eflags = GOODFLAGS(eflags);
+
+ if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags®_LARGE))
+ return(smatcher(g, (char *)string, nmatch, pmatch, eflags));
+ else
+ return(lmatcher(g, (char *)string, nmatch, pmatch, eflags));
+#undef GOODFLAGS
+}
+/*
+ - regfree - free everything
+ = extern void regfree(regex_t *);
+ */
+void
+regfree(preg)
+regex_t *preg;
+{
+ register struct re_guts *g;
+
+ if (preg->re_magic != MAGIC1) /* oops */
+ return; /* nice to complain, but hard */
+
+ g = preg->re_g;
+ if (g == NULL || g->magic != MAGIC2) /* oops again */
+ return;
+ preg->re_magic = 0; /* mark it invalid */
+ g->magic = 0; /* mark it invalid */
+
+ if (g->strip != NULL)
+ free((char *)g->strip);
+ if (g->sets != NULL)
+ free((char *)g->sets);
+ if (g->setbits != NULL)
+ free((char *)g->setbits);
+ if (g->must != NULL)
+ free(g->must);
+ free((char *)g);
+}
+
+#ifdef WITH_MAIN
+int main(int argc, char* argv[]){
+ regex_t preg;
+ int i, s;
+ if(argc<2) return 1;
+ if (regcomp(&preg, argv[1], REG_NOSUB)) {
+ fprintf(stderr, "Failed to compile regex\n");
+ return 2;
+ }
+ for (i = 2; i
+#include
+
+
+#define uchar unsigned char
+
+static const uchar perm1[56] = {57, 49, 41, 33, 25, 17, 9,
+ 1, 58, 50, 42, 34, 26, 18,
+ 10, 2, 59, 51, 43, 35, 27,
+ 19, 11, 3, 60, 52, 44, 36,
+ 63, 55, 47, 39, 31, 23, 15,
+ 7, 62, 54, 46, 38, 30, 22,
+ 14, 6, 61, 53, 45, 37, 29,
+ 21, 13, 5, 28, 20, 12, 4};
+
+static const uchar perm2[48] = {14, 17, 11, 24, 1, 5,
+ 3, 28, 15, 6, 21, 10,
+ 23, 19, 12, 4, 26, 8,
+ 16, 7, 27, 20, 13, 2,
+ 41, 52, 31, 37, 47, 55,
+ 30, 40, 51, 45, 33, 48,
+ 44, 49, 39, 56, 34, 53,
+ 46, 42, 50, 36, 29, 32};
+
+static const uchar perm3[64] = {58, 50, 42, 34, 26, 18, 10, 2,
+ 60, 52, 44, 36, 28, 20, 12, 4,
+ 62, 54, 46, 38, 30, 22, 14, 6,
+ 64, 56, 48, 40, 32, 24, 16, 8,
+ 57, 49, 41, 33, 25, 17, 9, 1,
+ 59, 51, 43, 35, 27, 19, 11, 3,
+ 61, 53, 45, 37, 29, 21, 13, 5,
+ 63, 55, 47, 39, 31, 23, 15, 7};
+
+static const uchar perm4[48] = { 32, 1, 2, 3, 4, 5,
+ 4, 5, 6, 7, 8, 9,
+ 8, 9, 10, 11, 12, 13,
+ 12, 13, 14, 15, 16, 17,
+ 16, 17, 18, 19, 20, 21,
+ 20, 21, 22, 23, 24, 25,
+ 24, 25, 26, 27, 28, 29,
+ 28, 29, 30, 31, 32, 1};
+
+static const uchar perm5[32] = { 16, 7, 20, 21,
+ 29, 12, 28, 17,
+ 1, 15, 23, 26,
+ 5, 18, 31, 10,
+ 2, 8, 24, 14,
+ 32, 27, 3, 9,
+ 19, 13, 30, 6,
+ 22, 11, 4, 25};
+
+
+static const uchar perm6[64] ={ 40, 8, 48, 16, 56, 24, 64, 32,
+ 39, 7, 47, 15, 55, 23, 63, 31,
+ 38, 6, 46, 14, 54, 22, 62, 30,
+ 37, 5, 45, 13, 53, 21, 61, 29,
+ 36, 4, 44, 12, 52, 20, 60, 28,
+ 35, 3, 43, 11, 51, 19, 59, 27,
+ 34, 2, 42, 10, 50, 18, 58, 26,
+ 33, 1, 41, 9, 49, 17, 57, 25};
+
+
+static const uchar sc[16] = {1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1};
+
+static const uchar sbox[8][4][16] = {
+ {{14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7},
+ {0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8},
+ {4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0},
+ {15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13}},
+
+ {{15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10},
+ {3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5},
+ {0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15},
+ {13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9}},
+
+ {{10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8},
+ {13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1},
+ {13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7},
+ {1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12}},
+
+ {{7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15},
+ {13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9},
+ {10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4},
+ {3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14}},
+
+ {{2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9},
+ {14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6},
+ {4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14},
+ {11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3}},
+
+ {{12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11},
+ {10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8},
+ {9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6},
+ {4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13}},
+
+ {{4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1},
+ {13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6},
+ {1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2},
+ {6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12}},
+
+ {{13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7},
+ {1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2},
+ {7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8},
+ {2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11}}};
+
+static void permute(char *out, const char *in, const uchar *p, int n)
+{
+ int i;
+ for (i=0;i>1;
+ key[1] = ((str[0]&0x01)<<6) | (str[1]>>2);
+ key[2] = ((str[1]&0x03)<<5) | (str[2]>>3);
+ key[3] = ((str[2]&0x07)<<4) | (str[3]>>4);
+ key[4] = ((str[3]&0x0F)<<3) | (str[4]>>5);
+ key[5] = ((str[4]&0x1F)<<2) | (str[5]>>6);
+ key[6] = ((str[5]&0x3F)<<1) | (str[6]>>7);
+ key[7] = str[6]&0x7F;
+ for (i=0;i<8;i++) {
+ key[i] = (key[i]<<1);
+ }
+}
+
+
+static void smbhash(unsigned char *out, const unsigned char *in, unsigned char *key)
+{
+ int i;
+ char outb[64];
+ char inb[64];
+ char keyb[64];
+ unsigned char key2[8];
+
+ str_to_key(key, key2);
+
+ for (i=0;i<64;i++) {
+ inb[i] = (in[i/8] & (1<<(7-(i%8)))) ? 1 : 0;
+ keyb[i] = (key2[i/8] & (1<<(7-(i%8)))) ? 1 : 0;
+ outb[i] = 0;
+ }
+
+ dohash(outb, inb, keyb);
+
+ for (i=0;i<8;i++) {
+ out[i] = 0;
+ }
+
+ for (i=0;i<64;i++) {
+ if (outb[i])
+ out[i/8] |= (1<<(7-(i%8)));
+ }
+}
+
+/*
+ * Converts the password to uppercase, and creates the LM
+ * password hash.
+ */
+void lmpwdhash(const unsigned char *password,unsigned char *lmhash)
+{
+ int i;
+ unsigned char p14[14];
+ static unsigned char sp8[8] = {0x4b, 0x47, 0x53, 0x21, 0x40, 0x23, 0x24, 0x25};
+
+ memset(p14, 0, sizeof(p14));
+ for (i = 0; i < 14 && password[i]; i++) {
+ p14[i] = toupper((int) password[i]);
+ }
+
+ smbhash(lmhash, sp8, p14);
+ smbhash(lmhash+8, sp8, p14+7);
+}
+
+/*
+ * Take the NT or LM password, and return the MSCHAP response
+ *
+ * The win_password MUST be exactly 16 bytes long.
+ */
+void mschap(const unsigned char *win_password,
+ const unsigned char *challenge, unsigned char *response)
+{
+ unsigned char p21[21];
+
+ memset(p21, 0, sizeof(p21));
+ memcpy(p21, win_password, 16);
+
+ smbhash(response, challenge, p21);
+ smbhash(response+8, challenge, p21+7);
+ smbhash(response+16, challenge, p21+14);
+}
diff --git a/src/msnpr.c b/src/msnpr.c
new file mode 100644
index 0000000..be8e006
--- /dev/null
+++ b/src/msnpr.c
@@ -0,0 +1,234 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: msnpr.c,v 1.3 2012-04-11 23:01:19 vlad Exp $
+*/
+
+#include "proxy.h"
+
+#ifndef PORTMAP
+#define PORTMAP
+#endif
+#define RETURN(xxx) { param->res = xxx; goto CLEANRET; }
+
+struct msn_cookie {
+ struct msn_cookie *next;
+ unsigned char *userid;
+ char * connectstring;
+};
+
+static struct msn_cookie *msn_cookies = NULL;
+pthread_mutex_t msn_cookie_mutex;
+int msn_cookie_mutex_init = 0;
+
+static void msn_clear(void *fo){
+};
+
+static FILTER_ACTION msn_srv(void *fc, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int offset, int * length_p){
+ unsigned char *data = *buf_p + offset;
+ int len = (int)(*length_p - offset);
+ struct sockaddr_in sa;
+ SASIZETYPE size = sizeof(sa);
+ struct msn_cookie *cookie;
+ char tmpbuf[256];
+ char *sp1, *sp2, *sp3;
+
+
+ if(*bufsize_p - *length_p < 32) return CONTINUE;
+ if(len < 10 || len > 220) return CONTINUE;
+
+ data[len] = 0;
+
+
+ sp1 = data + 3;
+ if(data[0] == 'X' && data[1] == 'F' && data[2] == 'R' && data[3] == ' '){
+ if(!(sp2 = strchr(sp1 + 1, ' ')) || !(sp2 = strchr(sp2 + 1, ' '))|| !(sp3 = strchr(sp2 + 1, ' '))) return CONTINUE;
+ }
+ else if(data[0] == 'R' && data[1] == 'N' && data[2] == 'G' && data[3] == ' '){
+ if(!(sp2 = strchr(sp1 + 1, ' ')) || !(sp3 = strchr(sp2 + 1, ' '))) return CONTINUE;
+ }
+ else return CONTINUE;
+
+ *sp2 = 0;
+ *sp3 = 0;
+ if(getsockname(param->clisock, (struct sockaddr *)&sa, &size)==-1) {
+ return CONTINUE;
+ };
+ cookie = myalloc(sizeof(struct msn_cookie));
+ cookie->connectstring = mystrdup(sp2 + 1);
+ cookie->userid = mystrdup(param->username);
+
+ pthread_mutex_lock(&msn_cookie_mutex);
+ cookie->next = msn_cookies;
+ msn_cookies = cookie;
+ pthread_mutex_unlock(&msn_cookie_mutex);
+
+ strcpy(tmpbuf, data);
+ len = (int)strlen(tmpbuf);
+ tmpbuf[len++] = ' ';
+
+ len+=myinet_ntoa(sa.sin_addr, tmpbuf+len);
+ sprintf(tmpbuf+len, ":%hu %s", ntohs(sa.sin_port), sp3 + 1);
+ len = (int)strlen(tmpbuf);
+ memcpy(*buf_p + offset, tmpbuf, len);
+ *length_p = offset + len;
+
+ return CONTINUE;
+}
+
+
+static struct filter msnfilter = {
+ NULL,
+ "msnfilter",
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ *msn_srv,
+ *msn_clear,
+ NULL
+};
+
+
+void * msnprchild(struct clientparam* param) {
+ int res, len;
+ unsigned char *buf;
+ int buflen = 256;
+ char *sp1, *sp2, *sp3;
+ char *verstr = NULL;
+ int id;
+ struct msn_cookie *cookie, *prevcookie=NULL;
+ int sec = 0;
+ struct filterp **newfilters;
+ int skip = 0;
+ struct filterp msnfilterp = {
+ &msnfilter,
+ (void *)&skip
+ };
+
+
+ if(!msn_cookie_mutex_init){
+ msn_cookie_mutex_init = 1;
+ pthread_mutex_init(&msn_cookie_mutex, NULL);
+ }
+
+ buf = myalloc(buflen);
+ res = sockgetlinebuf(param, CLIENT, buf, 240, '\n', conf.timeouts[STRING_S]);
+ if(res < 10) RETURN(1201);
+ buf[res] = 0;
+ if(!(sp1 = strchr(buf, ' ')) || !(sp2 = strchr(sp1 + 1, ' ')) || !(sp3 = strchr(sp2 + 1, ' ')) || ((int)(sp3-sp2)) < 6) RETURN(1202);
+ if((buf[0] == 'U' && buf[1] == 'S' && buf[2] == 'R') ||
+ (buf[0] == 'A' && buf[1] == 'N' && buf[2] == 'S')){
+ len = 1 + (int)(sp3 - sp2);
+ param->username = myalloc(len - 1);
+ memcpy(param->username, sp2 + 1, len - 2);
+ sec = 1;
+
+ }
+ else if(buf[0] != 'V' || buf[1] != 'E' || buf[2] != 'R') {RETURN(1203);}
+ else {
+ id = atoi(sp1 + 1);
+ verstr = mystrdup(buf);
+
+ if(socksend(param->clisock, buf, res, conf.timeouts[STRING_S])!=res) {RETURN (1204);}
+
+ res = sockgetlinebuf(param, CLIENT, buf, 240, '\n', conf.timeouts[STRING_S]);
+ if(res < 10) RETURN(1205);
+ buf[res] = 0;
+ if(buf[0] != 'C' || buf[1] != 'V' || buf[2] != 'R' || !(sp1=strrchr(buf,' ')) || (len = (int)strlen(sp1+1)) < 3) RETURN(1206);
+ param->username = myalloc(len - 1);
+ memcpy(param->username, sp1 + 1, len - 2);
+ }
+ param->username[len - 2] = 0;
+ param->operation = CONNECT;
+
+ pthread_mutex_lock(&msn_cookie_mutex);
+ for(cookie = msn_cookies; cookie; cookie = cookie->next){
+ if(!strcmp(param->username, cookie->userid)){
+ parsehostname(cookie->connectstring, param, ntohs(param->srv->targetport));
+ if(prevcookie)prevcookie->next = cookie->next;
+ else msn_cookies = cookie->next;
+ myfree(cookie->connectstring);
+ myfree(cookie->userid);
+ myfree(cookie);
+ break;
+ }
+ prevcookie = cookie;
+ }
+ pthread_mutex_unlock(&msn_cookie_mutex);
+ if(!cookie) {
+ if(sec) RETURN(1233);
+ parsehostname((char *)param->srv->target, param, ntohs(param->srv->targetport));
+ }
+ res = (*param->srv->authfunc)(param);
+ if(res) {RETURN(res);}
+
+ if(!sec){
+ len = (int)strlen(verstr);
+ if(socksend(param->remsock, verstr, len, conf.timeouts[STRING_S])!= len) {RETURN (1207);}
+ param->statscli += len;
+
+
+ myfree(verstr);
+ verstr = mystrdup(buf);
+
+ len = sockgetlinebuf(param, SERVER, buf, 240, '\n', conf.timeouts[STRING_S]);
+ if(len < 10) RETURN(1208);
+ param->statssrv += len;
+
+ strcpy(buf, verstr);
+ }
+
+ len = (int)strlen(buf);
+ if((res=handledatfltcli(param, &buf, &buflen, 0, &len))!=PASS) RETURN(res);
+ if(socksend(param->remsock, buf, len, conf.timeouts[STRING_S])!= len) {RETURN (1207);}
+
+
+ param->statscli += len;
+
+ if(sec){
+ RETURN(sockmap(param, conf.timeouts[CONNECTION_L]));
+ }
+
+ param->ndatfilterssrv++;
+ newfilters = myalloc(param->ndatfilterssrv * sizeof(struct filterp *));
+ if(param->ndatfilterssrv > 1){
+ memcpy(newfilters, param->datfilterssrv, (param->ndatfilterssrv - 1) * sizeof(struct filterp *));
+ myfree(param->datfilterssrv);
+ }
+ param->datfilterssrv = newfilters;
+ newfilters[param->ndatfilterssrv - 1] = &msnfilterp;
+
+ param->res = sockmap(param, conf.timeouts[CONNECTION_L]);
+
+ param->ndatfilterssrv--;
+
+
+
+CLEANRET:
+
+
+ if(verstr)myfree(verstr);
+ if(buf)myfree(buf);
+ (*param->srv->logfunc)(param, NULL);
+ freeparam(param);
+ return (NULL);
+}
+
+#ifdef WITHMAIN
+struct proxydef childdef = {
+ msnprchild,
+ 0,
+ 0,
+ S_MSNPR,
+ ""
+};
+#include "proxymain.c"
+#endif
diff --git a/src/myalloc.c b/src/myalloc.c
new file mode 100644
index 0000000..a44a48d
--- /dev/null
+++ b/src/myalloc.c
@@ -0,0 +1,367 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: myalloc.c,v 1.5 2008/01/08 21:46:38 vlad Exp $
+*/
+
+#include "proxy.h"
+
+
+#ifndef WITH_STD_MALLOC
+
+#include "proxy.h"
+
+#define MEM64K 65536
+#define MEM16K 16384
+#define MEM4K 4096
+#define MEM1K 1024
+#define MEM256 256
+
+#define DEBUGLEVEL 1
+
+struct mempage{
+ struct mempage *next;
+ unsigned usable;
+ unsigned char bitmap[32];
+ unsigned char data[MEM64K];
+} * pages[] = {NULL, NULL, NULL, NULL, NULL, NULL};
+
+unsigned memsizes[] = {MEM64K, MEM16K, MEM4K, MEM1K, MEM256, 0};
+enum pagesizes {
+ p64k,
+ p16k,
+ p4k,
+ p1k,
+ p256,
+ nomem,
+};
+
+pthread_mutex_t mem_mutex;
+int mem_init = 0;
+#ifdef _WIN32
+HANDLE myheap;
+#define malloc(x) HeapAlloc(myheap, 0, x)
+#define free(x) HeapFree(myheap, 0, x)
+#endif
+
+void init_mem(void) {
+ mem_init++;
+ pthread_mutex_init(&mem_mutex, NULL);
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Memory initialized\n");
+fflush(stderr);
+#endif
+#ifdef _WIN32
+ myheap = HeapCreate(0, MEM64K*16, 0);
+#endif
+}
+
+void * myalloc64k(){
+
+ struct mempage *newpage;
+
+ if(!mem_init)init_mem();
+ if(!(newpage = (struct mempage *)malloc(sizeof(struct mempage)))){
+#if DEBUGLEVEL > 0
+fprintf(stderr, "Failed to allocate p64k\n");
+fflush(stderr);
+#endif
+ return NULL;
+ }
+ memset(newpage->bitmap, 0, 32);
+ newpage->usable = 0;
+ pthread_mutex_lock(&mem_mutex);
+ newpage->next = pages[p64k];
+ pages[p64k] = newpage;
+ pthread_mutex_unlock(&mem_mutex);
+#if DEBUGLEVEL > 2
+fprintf(stderr, "New p64k created, address %X region: %X\n", newpage, newpage->data);
+fflush(stderr);
+#endif
+#if DEBUGLEVEL == 2
+fprintf(stderr, "myalloc64 %p\n", newpage->data);
+fflush(stderr);
+#endif
+
+ return newpage->data;
+}
+
+int alloced = 0;
+
+void * myalloc(size_t size){
+ struct mempage *newpage, *page;
+ unsigned pagesize;
+ unsigned i=0, j, k=0;
+ int p;
+
+
+ alloced++;
+ if(!mem_init)init_mem();
+ for(p = nomem; ; ) {
+ if(!p){
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Page is too large (%u), requesting malloc instead\n", size);
+fflush(stderr);
+#endif
+ return malloc(size);
+ }
+ p--;
+ if(size 2
+fprintf(stderr, "Page will p64k\n");
+fflush(stderr);
+#endif
+ return myalloc64k();
+ }
+
+ pagesize = memsizes[p];
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Calculated pagesize: %u\n", pagesize);
+fflush(stderr);
+#endif
+ pthread_mutex_lock(&mem_mutex);
+ newpage = pages[p];
+ if(newpage && newpage->usable){
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Useful page found: %X,", newpage);
+fflush(stderr);
+#endif
+ for(j=0; j<32; j++){
+ register unsigned c = newpage->bitmap[j];
+ if(c){
+ for(k=0; ;k++)if(c & (1< 2
+fprintf(stderr, "region: %X, offset %u, byte %u, %u, %u\n", newpage->data + i, i, j, k, newpage->bitmap[j]);
+fflush(stderr);
+#endif
+ break;
+ }
+ }
+ }
+ else{
+ if(!(newpage = (struct mempage *)malloc(sizeof(struct mempage)))){
+ pthread_mutex_unlock(&mem_mutex);
+#if DEBUGLEVEL > 0
+fprintf(stderr, "Failed to allocate p64k\n");
+fflush(stderr);
+#endif
+ return NULL;
+ }
+#if DEBUGLEVEL > 2
+fprintf(stderr, "New page used: %X,", newpage);
+fflush(stderr);
+#endif
+ memset(newpage->bitmap, 0, 32);
+ for(i = 0; i> 11);
+ k = ((i & 0x000007FF) >> 8);
+ newpage->bitmap[j] |= (1<next = pages[p];
+ newpage->usable = MEM64K;
+ pages[p] = newpage;
+ }
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Byte was %d/%d/%d\n", j, k, newpage->bitmap[j]);
+fflush(stderr);
+#endif
+ newpage->bitmap[j] ^= (1< 2
+fprintf(stderr, "Byte set %d/%d/%d\n", j, k, newpage->bitmap[j]);
+fflush(stderr);
+#endif
+ newpage->usable -= pagesize;
+#if DEBUGLEVEL > 2
+fprintf(stderr, "usable amount after allocation: %u\n", newpage->usable);
+fflush(stderr);
+#endif
+ if(!newpage->usable){
+#if DEBUGLEVEL > 2
+fprintf(stderr, "No usable amount left\n", newpage->usable);
+fflush(stderr);
+#endif
+ if((page = newpage->next) && page->usable){
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Moving to end of list\n", newpage->usable);
+fflush(stderr);
+#endif
+ pages[p] = page;
+ while(page->next && page->next->usable)page = page->next;
+ newpage->next = page->next;
+ page->next = newpage;
+ }
+ }
+ pthread_mutex_unlock(&mem_mutex);
+#if DEBUGLEVEL > 2
+fprintf(stderr, "All done, returning: %x\n", newpage->data + i);
+fflush(stderr);
+#endif
+#if DEBUGLEVEL == 2
+fprintf(stderr, "malloc %p\n", (void *)(newpage->data + i));
+fflush(stderr);
+#endif
+
+ return (void *)(newpage->data + i);
+}
+
+int myfindsize(void * p, struct mempage ***prevpagep, struct mempage **pagep){
+ int i;
+ struct mempage *prevpage, *page;
+
+ for (i=0; inext){
+ if( p >= (void *)page->data && p < (void *)(page->data + MEM64K))break;
+ prevpage = page;
+ }
+ if(page){
+ if(pagep)*pagep = page;
+ if(prevpagep)*prevpagep = prevpage?&prevpage->next:&pages[i];
+#if DEBUGLEVEL > 2
+fprintf(stderr, "%x belongs to page: %x with data %x\n", p, page, page->data);
+fflush(stderr);
+#endif
+ break;
+ }
+ }
+ return i;
+
+
+}
+
+void myfree(void *p){
+ struct mempage **prevpage, *page;
+ int i;
+ unsigned pagesize;
+ unsigned size, j, k;
+
+ alloced--;
+#if DEBUGLEVEL == 2
+fprintf(stderr, "free %p\n", p);
+fflush(stderr);
+#endif
+ pthread_mutex_lock(&mem_mutex);
+ i = myfindsize(p, &prevpage, &page);
+ if (i == nomem) {
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Page does not exists, trying free()\n");
+fflush(stderr);
+#endif
+ pthread_mutex_unlock(&mem_mutex);
+ free(p);
+ return;
+ }
+ pagesize = memsizes[i];
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Calculated pagesize: %u\n", pagesize);
+fflush(stderr);
+#endif
+ size = (unsigned)((unsigned char*)p - page->data);
+ if(size%pagesize) {
+#if DEBUGLEVEL > 0
+write(2, p, 4);
+fprintf(stderr, "\nGiven address is not block aligned, ignoring\n");
+fflush(stderr);
+#endif
+ pthread_mutex_unlock(&mem_mutex);
+ return; /* Hmmmmm */
+ }
+ *prevpage = page->next;
+ page->usable += pagesize;
+#if DEBUGLEVEL > 2
+fprintf(stderr, "New usable space: %u\n", page->usable);
+fflush(stderr);
+#endif
+ if(page->usable >= MEM64K && ((pagesize == MEM64K) || (pages[i] && pages[i]->usable))) {
+#if DEBUGLEVEL > 2
+fprintf(stderr, "Free this page\n");
+fflush(stderr);
+#endif
+ free(page);
+ }
+ else {
+ j = (size>>11);
+ k = ((size & 0x000007FF) >> 8);
+ k = ('\01'<bitmap[j] & k) {
+#if DEBUGLEVEL > 0
+fprintf(stderr, "Error: double free() %d/%d/%d\n", j, k, page->bitmap[j]);
+fflush(stderr);
+#endif
+ page->usable += pagesize;
+ }
+ page->bitmap[j] |= k;
+ page->next = pages[i];
+ pages[i] = page;
+#if DEBUGLEVEL > 2
+fprintf(stderr, "This page will be reused next time\n");
+fflush(stderr);
+#endif
+ }
+ pthread_mutex_unlock(&mem_mutex);
+}
+
+char * mystrdup(const char *str){
+ unsigned l;
+ char *p;
+
+ if(!str) return NULL;
+ l = ((unsigned)strlen(str))+1;
+ p = myalloc(l);
+ if(p)memcpy(p, str, l);
+#if DEBUGLEVEL == 2
+fprintf(stderr, "strdup %p\n", p);
+fflush(stderr);
+#endif
+ return p;
+}
+
+
+void *myrealloc(void *ptr, size_t size){
+ unsigned l;
+ void * p;
+ l = myfindsize(ptr, NULL, NULL);
+ if(size <= memsizes[l]) return ptr;
+ p = myalloc(size);
+ if(p){
+ memcpy(p,ptr,size);
+ myfree(ptr);
+ }
+ return p;
+}
+
+
+#ifdef WITH_MAIN
+int main(){
+ void *p1, *p2, *p3, *p4, *p5, *p6, *p7, *p8, *p9, *p10, *p11, *p12, *p13;
+ p1 = myalloc(5000);
+ p2 = myalloc(5000);
+ p3 = myalloc(5000);
+ p4 = myalloc(5000);
+ p5 = myalloc(5000);
+ p6 = myalloc(5000);
+ p7 = myalloc(5000);
+ p8 = myalloc(5000);
+ p9 = myalloc(5000);
+ p10 = myalloc(5000);
+ myfree(p2);
+ myfree(p8);
+ p11 = myalloc(5000);
+ p12 = myalloc(5000);
+ p13 = myalloc(5000);
+ p2 = myalloc(5000);
+ p8 = myalloc(5000);
+ myalloc(5000);
+}
+#endif
+
+#endif
diff --git a/src/mycrypt.c b/src/mycrypt.c
new file mode 100644
index 0000000..7cabf38
--- /dev/null
+++ b/src/mycrypt.c
@@ -0,0 +1,200 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: mycrypt.c,v 1.8 2008/01/08 21:46:38 vlad Exp $
+*/
+#include "libs/md5.h"
+#include "libs/md4.h"
+#include
+
+#define MD5_SIZE 16
+
+#ifdef _WIN32
+#pragma warning (disable : 4996)
+#endif
+
+
+void tohex(unsigned char *in, unsigned char *out, int len);
+
+static unsigned char itoa64[] =
+ "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+
+void
+_crypt_to64(unsigned char *s, unsigned long v, int n)
+{
+ while (--n >= 0) {
+ *s++ = itoa64[v&0x3f];
+ v >>= 6;
+ }
+}
+
+
+unsigned char * ntpwdhash (unsigned char *szHash, const unsigned char *szPassword, int ctohex)
+{
+ unsigned char szUnicodePass[513];
+ unsigned int nPasswordLen;
+ MD4_CTX ctx;
+ unsigned int i;
+
+ /*
+ * NT passwords are unicode. Convert plain text password
+ * to unicode by inserting a zero every other byte
+ */
+ nPasswordLen = (int)strlen((char *)szPassword);
+ if(nPasswordLen > 255)nPasswordLen = 255;
+ for (i = 0; i < nPasswordLen; i++) {
+ szUnicodePass[i << 1] = szPassword[i];
+ szUnicodePass[(i << 1) + 1] = 0;
+ }
+
+ /* Encrypt Unicode password to a 16-byte MD4 hash */
+ MD4Init(&ctx);
+ MD4Update(&ctx, szUnicodePass, (nPasswordLen<<1));
+ MD4Final(szUnicodePass, &ctx);
+ if (ctohex){
+ tohex(szUnicodePass, szHash, 16);
+ }
+ else memcpy(szHash, szUnicodePass, 16);
+ return szHash;
+}
+
+
+unsigned char * mycrypt(const unsigned char *pw, const unsigned char *salt, unsigned char *passwd){
+
+ const unsigned char *ep;
+ if(salt[0] == '$' && salt[1] == '1' && salt[2] == '$' && (ep = (unsigned char *)strchr((char *)salt+3, '$'))) {
+ static unsigned char *magic = (unsigned char *)"$1$";
+ unsigned char *p;
+ const unsigned char *sp;
+ unsigned char final[MD5_SIZE];
+ int sl,pl,i;
+ MD5_CTX ctx,ctx1;
+ unsigned long l;
+
+ /* Refine the Salt first */
+ sp = salt +3;
+
+ /* get the length of the true salt */
+ sl = (int)(ep - sp);
+
+ MD5Init(&ctx);
+
+ /* The password first, since that is what is most unknown */
+ MD5Update(&ctx,pw,strlen((char *)pw));
+
+ /* Then our magic string */
+ MD5Update(&ctx,magic,strlen((char *)magic));
+
+ /* Then the raw salt */
+ MD5Update(&ctx,sp,sl);
+
+ /* Then just as many unsigned characters of the MD5(pw,salt,pw) */
+ MD5Init(&ctx1);
+ MD5Update(&ctx1,pw,strlen((char *)pw));
+ MD5Update(&ctx1,sp,sl);
+ MD5Update(&ctx1,pw,strlen((char *)pw));
+ MD5Final(final,&ctx1);
+ for(pl = (int)strlen((char *)pw); pl > 0; pl -= MD5_SIZE)
+ MD5Update(&ctx,final,pl>MD5_SIZE ? MD5_SIZE : pl);
+
+ /* Don't leave anything around in vm they could use. */
+ memset(final,0,sizeof final);
+
+ /* Then something really weird... */
+ for (i = (int)strlen((char *)pw); i ; i >>= 1)
+ if(i&1)
+ MD5Update(&ctx, final, 1);
+ else
+ MD5Update(&ctx, pw, 1);
+
+ /* Now make the output string */
+ strcpy((char *)passwd,(char *)magic);
+ strncat((char *)passwd,(char *)sp,sl);
+ strcat((char *)passwd,"$");
+
+ MD5Final(final,&ctx);
+
+ /*
+ * and now, just to make sure things don't run too fast
+ * On a 60 Mhz Pentium this takes 34 msec, so you would
+ * need 30 seconds to build a 1000 entry dictionary...
+ */
+ for(i=0;i<1000;i++) {
+ MD5Init(&ctx1);
+ if(i & 1)
+ MD5Update(&ctx1,pw,strlen((char *)pw));
+ else
+ MD5Update(&ctx1,final,MD5_SIZE);
+
+ if(i % 3)
+ MD5Update(&ctx1,sp,sl);
+
+ if(i % 7)
+ MD5Update(&ctx1,pw,strlen((char *)pw));
+
+ if(i & 1)
+ MD5Update(&ctx1,final,MD5_SIZE);
+ else
+ MD5Update(&ctx1,pw,strlen((char *)pw));
+ MD5Final(final,&ctx1);
+ }
+
+ p = passwd + strlen((char *)passwd);
+
+ l = (final[ 0]<<16) | (final[ 6]<<8) | final[12];
+ _crypt_to64(p,l,4); p += 4;
+ l = (final[ 1]<<16) | (final[ 7]<<8) | final[13];
+ _crypt_to64(p,l,4); p += 4;
+ l = (final[ 2]<<16) | (final[ 8]<<8) | final[14];
+ _crypt_to64(p,l,4); p += 4;
+ l = (final[ 3]<<16) | (final[ 9]<<8) | final[15];
+ _crypt_to64(p,l,4); p += 4;
+ l = (final[ 4]<<16) | (final[10]<<8) | final[ 5];
+ _crypt_to64(p,l,4); p += 4;
+ l = final[11] ;
+ _crypt_to64(p,l,2); p += 2;
+ *p = '\0';
+
+ /* Don't leave anything around in vm they could use. */
+ memset(final,0,sizeof final);
+ }
+ else {
+ *passwd = 0;
+ }
+ return passwd;
+}
+
+#ifdef WITHMAIN
+
+#include
+int main(int argc, char* argv[]){
+ unsigned char buf[1024];
+ unsigned i;
+ if(argc < 2 || argc > 3) {
+ fprintf(stderr, "usage: \n"
+ "\t%s \n"
+ "\t%s \n"
+ "Performs NT crypt if no salt specified, MD5 crypt with salt\n"
+ "This software uses:\n"
+ " RSA Data Security, Inc. MD4 Message-Digest Algorithm\n"
+ " RSA Data Security, Inc. MD5 Message-Digest Algorithm\n",
+ argv[0],
+ argv[0]);
+ return 1;
+ }
+ if(argc == 2) {
+ printf("NT:%s\n", ntpwdhash(buf, (unsigned char *)argv[1], 1));
+ }
+ else {
+ i = (int)strlen((char *)argv[1]);
+ if (i > 64) argv[1][64] = 0;
+ sprintf((char *)buf, "$1$%s$", argv[1]);
+ printf("CR:%s\n", mycrypt((unsigned char *)argv[2], buf, buf+256));
+ }
+ return 0;
+}
+
+#endif
diff --git a/src/ntlm.c b/src/ntlm.c
new file mode 100644
index 0000000..9f57c92
--- /dev/null
+++ b/src/ntlm.c
@@ -0,0 +1,89 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: ntlm.c,v 1.9 2008/01/08 21:46:38 vlad Exp $
+*/
+
+#include "proxy.h"
+struct ntlmchal {
+ unsigned char sig[8];
+ unsigned char messtype[4];
+ unsigned char dom_len[2];
+ unsigned char dom_max_len[2];
+ unsigned char dom_offset[4];
+ unsigned char flags[4];
+ unsigned char challenge[8];
+ unsigned char reserved[8];
+ unsigned char addr_len[2];
+ unsigned char addr_max_len[2];
+ unsigned char addr_offset[4];
+ unsigned char data[1];
+};
+
+struct ntlmreq {
+ unsigned char sig[8];
+ unsigned char messtype[4];
+ unsigned char flags[4];
+ unsigned char dom_len[2];
+ unsigned char dom_max_len[2];
+ unsigned char dom_offset[4];
+ unsigned char pad1[2];
+ unsigned char host_len[2];
+ unsigned char host_max_len[2];
+ unsigned char host_offset[4];
+ unsigned char pad2[2];
+ unsigned char data[1];
+};
+
+int text2unicode(const char * text, char * buf, int buflen){
+ int count = 0;
+ buflen = ((buflen>>1)<<1);
+ if(!text || !buflen) return 0;
+ do {
+ buf[count++] = toupper(*text++);
+ buf[count++] = '\0';
+ } while (*text && count < buflen);
+ return count;
+}
+
+void unicode2text(const char *unicode, char * buf, int len){
+ int i;
+ if(!unicode || !len) return;
+ for(i=0; isig, "NTLMSSP", 8);
+ chal->messtype[0] = 2;
+ gethostname(hostname, 128);
+ hostname[15] = 0;
+ len = (((int)strlen(hostname)) << 1);
+ chal->dom_len[0] = len;
+ chal->dom_max_len[0] = len;
+ chal->dom_offset[0] = (unsigned char)((unsigned char *)chal->data - (unsigned char *)chal);
+ chal->flags[0] = 0x03;
+ chal->flags[1] = 0x82;
+ chal->flags[2] = 0x81;
+ chal->flags[3] = 0xA0;
+ text2unicode(hostname, (char *)chal->data, 64);
+ time((time_t *)challenge);
+ memcpy(challenge+4, ¶m->sinc.sin_addr.s_addr, 4);
+ challenge[1]^=param->sinc.sin_port;
+ for(i = 0; i < 8; i++) challenge[i] ^= myrand(challenge, 8);
+ memcpy(chal->challenge, challenge, 8);
+ en64((unsigned char *)tmpbuf, (unsigned char *)buf, (int)((unsigned char *)chal->data - (unsigned char *)chal) + len);
+}
diff --git a/src/plugins.c b/src/plugins.c
new file mode 100644
index 0000000..51a602f
--- /dev/null
+++ b/src/plugins.c
@@ -0,0 +1,142 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2002-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: ntlm.c,v 1.8 2007/12/27 13:20:04 vlad Exp $
+*/
+
+#include "proxy.h"
+
+unsigned bandlimitfunc(struct clientparam *param, unsigned nbytesin, unsigned nbytesout);
+void trafcountfunc(struct clientparam *param);
+int checkACL(struct clientparam * param);
+void nametohash(const unsigned char * name, unsigned char *hash);
+unsigned hashindex(const unsigned char* hash);
+void decodeurl(unsigned char *s, int allowcr);
+int parsestr (unsigned char *str, unsigned char **argm, int nitems, unsigned char ** buff, int *inbuf, int *bufsize);
+struct ace * make_ace (int argc, unsigned char ** argv);
+extern char * proxy_stringtable[];
+extern char * admin_stringtable[];
+extern struct schedule * schedule;
+int start_proxy_thread(struct child * chp);
+
+extern int linenum;
+extern char *conffile;
+
+struct symbol symbols[] = {
+ {symbols+1, "conf", (void *) &conf},
+ {symbols+2, "socksend", (void *) socksend},
+ {symbols+3, "socksendto", (void *) socksendto},
+ {symbols+4, "sockrecvfrom", (void *) sockrecvfrom},
+ {symbols+5, "sockgetcharcli", (void *) sockgetcharcli},
+ {symbols+6, "sockgetcharsrv", (void *) sockgetcharsrv},
+ {symbols+7, "sockgetlinebuf", (void *) sockgetlinebuf},
+ {symbols+8, "myinet_ntoa", (void *) myinet_ntoa},
+ {symbols+9, "dobuf", (void *) dobuf},
+ {symbols+10, "scanaddr", (void *) scanaddr},
+ {symbols+11, "getip", (void *) getip},
+ {symbols+12, "sockmap", (void *) sockmap},
+ {symbols+13, "sockfuncs", (void *) &so},
+ {symbols+14, "ACLmatches", (void *) ACLmatches},
+ {symbols+15, "bandlimitfunc", (void *) bandlimitfunc},
+ {symbols+16, "trafcountfunc", (void *) trafcountfunc},
+ {symbols+17, "alwaysauth", (void *) alwaysauth},
+ {symbols+18, "ipauth", (void *) ipauth},
+ {symbols+19, "nbnameauth", (void *) nbnameauth},
+ {symbols+20, "strongauth", (void *) strongauth},
+ {symbols+21, "checkACL", (void *) checkACL},
+ {symbols+22, "nametohash", (void *) nametohash},
+ {symbols+23, "hashindex", (void *) hashindex},
+ {symbols+24, "nservers", (void *) nservers},
+ {symbols+25, "udpresolve", (void *) udpresolve},
+ {symbols+26, "bandlim_mutex", (void *) &bandlim_mutex},
+ {symbols+27, "tc_mutex", (void *) &tc_mutex},
+ {symbols+28, "hash_mutex", (void *) &hash_mutex},
+ {symbols+29, "pwl_mutex", (void *) &pwl_mutex},
+ {symbols+30, "linenum", (void *) &linenum},
+ {symbols+31, "proxy_stringtable", (void *) proxy_stringtable},
+ {symbols+32, "en64", (void *) en64},
+ {symbols+33, "de64", (void *) de64},
+ {symbols+34, "tohex", (void *) tohex},
+ {symbols+35, "fromhex", (void *) fromhex},
+ {symbols+36, "dnspr", (void *) dnsprchild},
+ {symbols+37, "pop3p", (void *) pop3pchild},
+ {symbols+38, "proxy", (void *) proxychild},
+ {symbols+39, "socks", (void *) sockschild},
+ {symbols+40, "tcppm", (void *) tcppmchild},
+ {symbols+41, "udppm", (void *) udppmchild},
+ {symbols+42, "admin", (void *) adminchild},
+ {symbols+43, "ftppr", (void *) ftpprchild},
+ {symbols+44, "smtpp", (void *) smtppchild},
+ {symbols+45, "icqpr", (void *) icqprchild},
+ {symbols+46, "msnpr", (void *) msnprchild},
+ {symbols+47, "authfuncs", (void *) &authfuncs},
+ {symbols+48, "commandhandlers", (void *) &commandhandlers},
+ {symbols+49, "decodeurl", (void *) decodeurl},
+ {symbols+50, "parsestr", (void *) parsestr},
+ {symbols+51, "make_ace", (void *) make_ace},
+ {symbols+52, "freeacl", (void *) freeacl},
+ {NULL, "", NULL}
+};
+
+static void * findbyname(const char *name){
+ struct symbol * symbols;
+ for(symbols = &pluginlink.symbols; symbols; symbols=symbols->next)
+ if(!strcmp(symbols->name, name)) return symbols->value;
+ return NULL;
+}
+
+
+struct pluginlink pluginlink = {
+ {symbols, "", NULL},
+ &conf,
+ nservers,
+ &linenum,
+ authfuncs,
+ commandhandlers,
+ findbyname,
+ socksend,
+ socksendto,
+ sockrecvfrom,
+ sockgetcharcli,
+ sockgetcharsrv,
+ sockgetlinebuf,
+ myinet_ntoa,
+ dobuf,
+ dobuf2,
+ scanaddr,
+ getip,
+ sockmap,
+ ACLmatches,
+ alwaysauth,
+ checkACL,
+ nametohash,
+ hashindex,
+ en64,
+ de64,
+ tohex,
+ fromhex,
+ decodeurl,
+ parsestr,
+ make_ace,
+ myalloc,
+ myfree,
+ myrealloc,
+ mystrdup,
+ trafcountfunc,
+ proxy_stringtable,
+ &schedule,
+ freeacl,
+ admin_stringtable,
+ &childdef,
+ start_proxy_thread,
+ freeparam,
+ parsehostname,
+ parseusername,
+ parseconnusername,
+ &so,
+ dologname
+};
+
diff --git a/src/plugins/CVS/Entries b/src/plugins/CVS/Entries
new file mode 100644
index 0000000..6260c8f
--- /dev/null
+++ b/src/plugins/CVS/Entries
@@ -0,0 +1,7 @@
+D/WindowsAuthentication////
+D/TrafficPlugin////
+D/PCREPlugin////
+D/FilePlugin////
+D/TransparentPlugin////
+D/utf8tocp1251////
+D/SSLPlugin////
diff --git a/src/plugins/CVS/Repository b/src/plugins/CVS/Repository
new file mode 100644
index 0000000..4ff3345
--- /dev/null
+++ b/src/plugins/CVS/Repository
@@ -0,0 +1 @@
+3proxy-0.5a/src/plugins
diff --git a/src/plugins/CVS/Root b/src/plugins/CVS/Root
new file mode 100644
index 0000000..43e0a15
--- /dev/null
+++ b/src/plugins/CVS/Root
@@ -0,0 +1 @@
+/cygdrive/m/MEDIA/H/CVS
diff --git a/src/plugins/FilePlugin/CVS/Entries b/src/plugins/FilePlugin/CVS/Entries
new file mode 100644
index 0000000..1e1fafe
--- /dev/null
+++ b/src/plugins/FilePlugin/CVS/Entries
@@ -0,0 +1,4 @@
+/Makefile.inc/1.1/Sun Sep 20 17:13:29 2009//
+/FilePlugin.h/1.4/Fri Oct 9 11:36:00 2009//
+/FilePlugin.c/1.8/Wed Apr 11 23:01:22 2012//
+D
diff --git a/src/plugins/FilePlugin/CVS/Repository b/src/plugins/FilePlugin/CVS/Repository
new file mode 100644
index 0000000..d6343a9
--- /dev/null
+++ b/src/plugins/FilePlugin/CVS/Repository
@@ -0,0 +1 @@
+3proxy-0.5a/src/plugins/FilePlugin
diff --git a/src/plugins/FilePlugin/CVS/Root b/src/plugins/FilePlugin/CVS/Root
new file mode 100644
index 0000000..43e0a15
--- /dev/null
+++ b/src/plugins/FilePlugin/CVS/Root
@@ -0,0 +1 @@
+/cygdrive/m/MEDIA/H/CVS
diff --git a/src/plugins/FilePlugin/FilePlugin.c b/src/plugins/FilePlugin/FilePlugin.c
new file mode 100644
index 0000000..2558d61
--- /dev/null
+++ b/src/plugins/FilePlugin/FilePlugin.c
@@ -0,0 +1,895 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2007-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: FilePlugin.c,v 1.8 2012-04-11 23:01:22 vlad Exp $
+*/
+
+#include "../../structures.h"
+#include "FilePlugin.h"
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#ifdef _WIN32
+#ifndef _WINCE
+#include
+#else
+#include
+#endif
+#else
+#include
+#ifndef O_BINARY
+#define O_BINARY (0)
+#endif
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+#ifndef _WIN32
+#define WINAPI
+#define fp_size_t size_t
+#else
+#define fp_size_t int
+#endif
+
+static struct pluginlink * pl;
+
+static pthread_mutex_t file_mutex;
+
+unsigned long preview = 0;
+
+char path[256];
+
+static int counter = 0;
+static int timeo = 0;
+
+static char * fp_stringtable[] = {
+/* 0 */ "HTTP/1.0 503 Service Unavailable\r\n"
+ "Proxy-Connection: close\r\n"
+ "Content-type: text/html; charset=us-ascii\r\n"
+ "\r\n"
+ "503 Service Unavailable\r\n"
+ "503 Service Unavailable
HTTP policy violation: you have no permission to perform this action. Please conatct helpdesk or Administrator.
\r\n",
+/* 1 */ "421 SMTP policy violation: you have no permission to perform this action. Please conatct helpdesk or Administrator.\r\n",
+/* 2 */ "421 FTP policy violation: you have no permission to perform this action. Please conatct helpdesk or Administrator.\r\n",
+ NULL
+};
+
+enum states {
+ STATE_INITIAL = 0,
+ GOT_HTTP_REQUEST,
+ GOT_HTTP_CLI_HDR,
+ GOT_HTTP_SRV_HDR,
+ GOT_HTTP_CLI_HDR2,
+ GOT_HTTP_SRV_HDR2,
+ GOT_HTTP_CLIDATA,
+ GOT_HTTP_SRVDATA,
+ GOT_SMTP_REQ,
+ GOT_SMTP_DATA,
+ GOT_FTP_REQ,
+ GOT_FTP_CLIDATA,
+ GOT_FTP_SRVDATA,
+ FLUSH_DATA
+};
+
+struct fp_callback {
+ struct fp_callback *next;
+ FP_CALLBACK callback;
+ void * data;
+ int what;
+ int preview_size;
+ int max_size;
+};
+
+struct fp_stream {
+ struct fp_stream *next;
+ char * buf;
+ int state;
+ int what;
+ int needsrvconnect;
+ int preview_size;
+ long bufsize;
+ unsigned long clihdrwritten, clientwritten, clientsent, srvhdrwritten, serverwritten, serversent;
+ struct fp_callback *callbacks;
+ struct fp_filedata fpd;
+} *fp_streams = NULL;
+
+struct sockfuncs sso;
+
+
+static void genpaths(struct fp_stream *fps){
+
+ if(fps->what & (FP_CLIDATA|FP_CLIHEADER)){
+ if(fps->fpd.path_cli) free(fps->fpd.path_cli);
+ fps->fpd.path_cli = malloc(strlen(path) + 10);
+ sprintf(fps->fpd.path_cli, path, counter++);
+ }
+ if(fps->what & (FP_SRVDATA|FP_SRVHEADER)){
+ if(fps->fpd.path_srv) free(fps->fpd.path_srv);
+ fps->fpd.path_srv = malloc(strlen(path) + 10);
+ sprintf(fps->fpd.path_srv, path, counter++);
+ }
+
+}
+
+static
+#ifdef _WIN32
+ HANDLE
+#else
+ int
+#endif
+ initclientfile(struct fp_stream *fps){
+
+ fps->clientwritten = fps->clientsent = 0;
+#ifdef _WIN32
+ if(fps->fpd.h_cli != INVALID_HANDLE_VALUE){
+ CloseHandle(fps->fpd.h_cli);
+ }
+ fps->fpd.h_cli = CreateFile(fps->fpd.path_cli, GENERIC_READ | GENERIC_WRITE, (fps->what & FP_SHAREFILE)? FILE_SHARE_DELETE|FILE_SHARE_READ|FILE_SHARE_WRITE:0, NULL, CREATE_ALWAYS, (fps->what & (FP_KEEPFILE|FP_SHAREFILE))? FILE_ATTRIBUTE_TEMPORARY : FILE_ATTRIBUTE_TEMPORARY | FILE_FLAG_DELETE_ON_CLOSE, NULL);
+ return fps->fpd.h_cli;
+#else
+ if(fps->fpd.fd_cli != -1) close(fps->fpd.fd_cli);
+ fps->fpd.fd_cli = open(fps->fpd.path_cli, O_BINARY|O_RDWR|O_CREAT|O_TRUNC, 0600);
+ return fps->fpd.fd_cli;
+#endif
+}
+
+static
+#ifdef _WIN32
+ HANDLE
+#else
+ int
+#endif
+ initserverfile(struct fp_stream *fps){
+ fps->serverwritten = fps->serversent = 0;
+#ifdef _WIN32
+ if(fps->fpd.h_srv != INVALID_HANDLE_VALUE){
+ CloseHandle(fps->fpd.h_srv);
+ }
+ fps->fpd.h_srv = CreateFile(fps->fpd.path_srv, GENERIC_READ | GENERIC_WRITE, (fps->what & FP_SHAREFILE)? FILE_SHARE_DELETE|FILE_SHARE_READ|FILE_SHARE_WRITE:0, NULL, CREATE_ALWAYS, (fps->what & (FP_KEEPFILE|FP_SHAREFILE))? FILE_ATTRIBUTE_TEMPORARY : FILE_ATTRIBUTE_TEMPORARY | FILE_FLAG_DELETE_ON_CLOSE, NULL);
+ return fps->fpd.h_srv;
+#else
+ if(fps->fpd.fd_srv != -1) close(fps->fpd.fd_srv);
+ fps->fpd.fd_srv = open(fps->fpd.path_srv, O_BINARY|O_RDWR|O_CREAT|O_TRUNC, 0600);
+ return fps->fpd.fd_srv;
+#endif
+}
+
+static void closefiles(struct fp_stream *fps){
+#ifdef _WIN32
+ if(fps->fpd.h_cli != INVALID_HANDLE_VALUE) {
+ CloseHandle(fps->fpd.h_cli);
+ fps->fpd.h_cli = INVALID_HANDLE_VALUE;
+
+ if((fps->what & FP_SHAREFILE) && !(fps->what & FP_KEEPFILE)) DeleteFile(fps->fpd.path_cli);
+ }
+ if(fps->fpd.h_srv != INVALID_HANDLE_VALUE) {
+ CloseHandle(fps->fpd.h_srv);
+ fps->fpd.h_srv = INVALID_HANDLE_VALUE;
+
+ if((fps->what & FP_SHAREFILE) && !(fps->what & FP_KEEPFILE)) DeleteFile(fps->fpd.path_cli);
+ }
+#else
+ if(fps->fpd.fd_cli != -1) {
+ close(fps->fpd.fd_cli);
+ fps->fpd.fd_cli = -1;
+
+ if(!(fps->what & FP_KEEPFILE)) unlink(fps->fpd.path_cli);
+ }
+ if(fps->fpd.fd_srv != -1) {
+ close(fps->fpd.fd_srv);
+ fps->fpd.fd_srv = -1;
+ if(!(fps->what & FP_KEEPFILE)) unlink(fps->fpd.path_srv);
+ }
+#endif
+ if(fps->fpd.path_cli) {
+ free(fps->fpd.path_cli);
+ fps->fpd.path_cli = NULL;
+ }
+ if(fps->fpd.path_srv) {
+ free(fps->fpd.path_srv);
+ fps->fpd.path_srv = NULL;
+ }
+ fps->clihdrwritten = fps->clientwritten = fps->clientsent = fps->srvhdrwritten = fps->serverwritten = fps->serversent = 0;
+}
+
+static int searchsocket(SOCKET s, struct fp_stream **pfps){
+ struct fp_stream *fps = NULL;
+ int ret = 0;
+ pthread_mutex_lock(&file_mutex);
+ for(fps = fp_streams; fps; fps = fps->next){
+ if(fps->fpd.cp->clisock == s) {
+ ret = 1;
+ break;
+ }
+ if(fps->fpd.cp->remsock == s) {
+ ret = 2;
+ break;
+ }
+ if(fps->fpd.cp->ctrlsock == s) {
+ ret = 3;
+ break;
+ }
+ }
+ pthread_mutex_unlock(&file_mutex);
+ *pfps = fps;
+ return ret;
+}
+
+static void freecallback(struct fp_stream * fps, struct fp_callback * fpc){
+ if(fpc->next) freecallback(fps, fpc->next);
+ if(fpc->what & FP_CALLONREMOVE) (*fpc->callback)(FP_CALLONREMOVE, fpc->data, &fps->fpd, NULL, 0);
+ free(fpc);
+}
+
+static void removefps(struct fp_stream * fps){
+ if(!fp_streams) return;
+ pthread_mutex_lock(&file_mutex);
+ if(fp_streams == fps)fp_streams = fps->next;
+ else {
+ struct fp_stream *fps2;
+
+ for(fps2 = fp_streams; fps2->next; fps2 = fps2->next){
+ if(fps2->next == fps){
+ fps2->next = fps->next;
+ break;
+ }
+ }
+
+ }
+ pthread_mutex_unlock(&file_mutex);
+ if(fps->callbacks){
+ freecallback(fps, fps->callbacks);
+ fps->callbacks = 0;
+ }
+ closefiles(fps);
+ if(fps->buf) {
+ free(fps->buf);
+ fps->buf = NULL;
+ }
+ fps->state = 0;
+}
+
+static int WINAPI fp_connect(SOCKET s, const struct sockaddr *name, fp_size_t namelen){
+ return sso._connect(s, name, namelen);
+}
+
+void processcallbacks(struct fp_stream *fps, int what, char *msg, int size){
+ struct fp_callback *cb;
+ int state;
+
+ state = fps->state;
+ if(fps->what & what) {
+ fps->what = 0;
+ for(cb = fps->callbacks; cb; cb=cb->next){
+ if(cb->what & what){
+ cb->what = (*cb->callback)(what, cb->data, &(fps->fpd), msg, size);
+ }
+ fps->what |= cb->what;
+ }
+ }
+ if(fps->what & FP_REJECT){
+ switch(state){
+/*
+ Fixme: handle different states
+*/
+ case GOT_SMTP_REQ:
+ case GOT_SMTP_DATA:
+ fps->state = FLUSH_DATA;
+ pl->socksend(fps->fpd.cp->clisock, fp_stringtable[1], (int)strlen(fp_stringtable[1]), pl->conf->timeouts[STRING_S]);
+ fps->state = state;
+ break;
+ case GOT_HTTP_REQUEST:
+ case GOT_HTTP_CLI_HDR:
+ case GOT_HTTP_SRV_HDR:
+ case GOT_HTTP_CLI_HDR2:
+ case GOT_HTTP_SRV_HDR2:
+ case GOT_HTTP_CLIDATA:
+ case GOT_HTTP_SRVDATA:
+ if(!fps->serversent){
+ fps->state = FLUSH_DATA;
+ pl->socksend(fps->fpd.cp->clisock, fp_stringtable[0], (int)strlen(fp_stringtable[0]), pl->conf->timeouts[STRING_S]);
+ fps->state = state;
+ }
+ break;
+ case GOT_FTP_CLIDATA:
+ case GOT_FTP_REQ:
+ case GOT_FTP_SRVDATA:
+ fps->state = FLUSH_DATA;
+ pl->socksend(fps->fpd.cp->ctrlsock, fp_stringtable[1], (int)strlen(fp_stringtable[1]), pl->conf->timeouts[STRING_S]);
+ fps->state = state;
+ break;
+ default:
+ break;
+ }
+ if(fps->fpd.cp->remsock != INVALID_SOCKET)sso._closesocket(fps->fpd.cp->remsock);
+ fps->fpd.cp->remsock = INVALID_SOCKET;
+ if(fps->fpd.cp->clisock != INVALID_SOCKET)sso._closesocket(fps->fpd.cp->clisock);
+ fps->fpd.cp->clisock = INVALID_SOCKET;
+ }
+}
+
+static int copyfdtosock(struct fp_stream * fps, DIRECTION which, long len){
+ int res;
+ long toread;
+ int state;
+#ifdef _WIN32
+ HANDLE h;
+#else
+ int fd;
+#endif
+ SOCKET sock;
+ long offset;
+ int sendchunk = 0;
+
+ state = fps->state;
+ fps->state = FLUSH_DATA;
+ if(!fps->buf){
+ fps->buf = malloc(2048);
+ if(!fps->buf) return -2;
+ fps->bufsize = 2048;
+ }
+ if(which == SERVER){
+ offset = fps->clientsent;
+ fps->clientsent += len;
+#ifdef _WIN32
+ h = fps->fpd.h_cli;
+#else
+ fd = fps->fpd.fd_cli;
+#endif
+ sock = fps->fpd.cp->remsock;
+ }
+ else {
+ if(fps->fpd.cp->chunked){
+ if(fps->serversent < fps->srvhdrwritten && (fps->serversent + len) > fps->srvhdrwritten){
+ len -= fps->srvhdrwritten - fps->serversent;
+ if ((res = copyfdtosock(fps, which, fps->srvhdrwritten - fps->serversent))) return res;
+ }
+ if(fps->serversent >= fps->srvhdrwritten){
+ sprintf(fps->buf, "%lx\r\n", len);
+ sendchunk = (int)strlen(fps->buf);
+ if(pl->socksend(fps->fpd.cp->clisock, fps->buf, sendchunk, pl->conf->timeouts[STRING_S]) != sendchunk){
+ return -4;
+ }
+ }
+ }
+ offset = fps->serversent;
+ fps->serversent += len;
+#ifdef _WIN32
+ h = fps->fpd.h_srv;
+#else
+ fd = fps->fpd.fd_srv;
+#endif
+ sock = fps->fpd.cp->clisock;
+ }
+#ifdef _WIN32
+ if(SetFilePointer(h,offset,0,FILE_BEGIN)!=offset){
+ return -1;
+ }
+#else
+ if(lseek(fd, offset, SEEK_SET) < 0) {
+ return -1;
+ }
+#endif
+
+
+ while(len > 0){
+
+
+/*
+ Fixme: prevent client/server timeouts
+*/
+ toread = (len > fps->bufsize)? fps->bufsize:len;
+#ifdef _WIN32
+ if(!ReadFile(h, fps->buf, (DWORD)toread,(DWORD *)&res,NULL)) {
+#else
+ if((res = read(fd, fps->buf, toread)) <= 0) {
+#endif
+ return -3;
+ }
+ if(pl->socksend(sock, fps->buf, res, pl->conf->timeouts[STRING_S]) != res) {
+ return -4;
+ }
+ len -= res;
+ }
+ if(sendchunk){
+ if(pl->socksend(sock, "\r\n", 2, pl->conf->timeouts[STRING_S]) != 2)
+ return -4;
+ }
+ fps->state = state;
+ return 0;
+}
+
+static int WINAPI fp_poll(struct pollfd *fds, unsigned int nfds, int timeout){
+ struct fp_stream *fps = NULL;
+ int res;
+ unsigned i;
+ int to;
+
+ for(i = 0; istate == GOT_SMTP_DATA){
+ if(fds[i].events & POLLOUT){
+ fds[i].revents = POLLOUT;
+ return 1;
+ }
+ }
+ else if(res == 2 && (((fps->what & FP_CLIHEADER) && (fps->state == GOT_HTTP_REQUEST || fps->state == GOT_HTTP_CLI_HDR2)) || ((fps->what & FP_CLIDATA) && fps->state == GOT_HTTP_CLIDATA))){
+
+ if(fds[i].events & POLLIN){
+ processcallbacks(fps, (fps->state == GOT_HTTP_CLIDATA)?FP_CLIDATA:FP_CALLAFTERCLIHEADERS, NULL, 0);
+ if(fps->clihdrwritten + fps->clientwritten > fps->clientsent) {
+ if(copyfdtosock(fps, SERVER, (fps->clihdrwritten + fps->clientwritten) - fps->clientsent))
+ return -2;
+ }
+ if(fps->state) {
+ if(fps->what & FP_SRVHEADER) initserverfile(fps);
+ fps->state = GOT_HTTP_SRV_HDR;
+ }
+ }
+
+ else if(fds[i].events & POLLOUT){
+ fds[i].revents = POLLOUT;
+ return 1;
+ }
+
+ }
+ else if(res == 1 && (fps->state == GOT_HTTP_SRVDATA || fps->state == GOT_HTTP_SRV_HDR || fps->state == GOT_HTTP_SRV_HDR2)&& (fds[i].events & POLLIN)){
+ processcallbacks(fps, (fps->state == GOT_HTTP_SRVDATA)? FP_SRVDATA:FP_CALLAFTERSRVHEADERS, NULL, 0);
+ if(fps->srvhdrwritten + fps->serverwritten > fps->serversent) {
+ if(copyfdtosock(fps, CLIENT, (fps->srvhdrwritten + fps->serverwritten) - fps->serversent))
+ return -2;
+ }
+ closefiles(fps);
+ fps->state = 0;
+ }
+
+ }
+ return sso._poll(fds, nfds, timeout);
+}
+
+static int WINAPI fp_send(SOCKET s, const char *msg, fp_size_t len, int flags){
+ struct fp_stream *fps = NULL;
+ int res;
+ res = searchsocket(s, &fps);
+ if(res == 2){
+ if(fps->state == GOT_SMTP_DATA) {
+ if(fps->clihdrwritten + fps->clientwritten > fps->clientsent) {
+ processcallbacks(fps, FP_CLIDATA, NULL, 0);
+ if(copyfdtosock(fps, SERVER, (fps->clihdrwritten + fps->clientwritten) - fps->clientsent)) {
+ return -1;
+ }
+ fps->state = 0;
+ }
+ closefiles(fps);
+ fps->state = 0;
+ return sso._send(s, msg, len, flags);
+ }
+ if((((fps->what & FP_CLIHEADER) && (fps->state == GOT_HTTP_REQUEST || fps->state == GOT_HTTP_CLI_HDR2)) || ((fps->what & FP_CLIDATA) && fps->state == GOT_HTTP_CLIDATA))){
+#ifdef _WIN32
+ if(SetFilePointer(fps->fpd.h_cli, fps->clientwritten + fps->clihdrwritten, 0, FILE_BEGIN) != (fps->clientwritten + fps->clihdrwritten)){
+ return -1;
+ }
+ if(!WriteFile(fps->fpd.h_cli, msg, (DWORD)len,(DWORD *)&res,NULL) || res != len){
+ return -1;
+ }
+#else
+ if(lseek(fps->fpd.fd_cli, fps->clientwritten + fps->clihdrwritten, SEEK_SET) < 0) {
+ return -1;
+ }
+ if((res = write(fps->fpd.fd_cli, msg, len) != len)) return -1;
+#endif
+ if(fps->state == GOT_HTTP_CLIDATA)fps->clientwritten += res;
+ else fps->clihdrwritten += res;
+ return res;
+ }
+ }
+ if(res == 1){
+ if(((fps->what & FP_SRVDATA) && (fps->state == GOT_HTTP_SRVDATA || fps->state == GOT_HTTP_SRV_HDR) && fps->fpd.cp->chunked && len < 16 )){
+ int hasnonzero = 0, i;
+
+ for(i=0; i < len; i++){
+ char c = msg[i];
+
+ if(c == '\r' || c == '\n') continue;
+ if((c<'0'|| c>'9') && (c<'A' || c>'F') && (c<'a' || c>'f')) {
+ return sso._send(s, msg, len, flags);
+ }
+ if(c != '0') hasnonzero = 1;
+ }
+ if(i>2 && !hasnonzero){
+
+ if(fps->srvhdrwritten + fps->serverwritten > fps->serversent) {
+ processcallbacks(fps, FP_SRVDATA, NULL, 0);
+ if(copyfdtosock(fps, CLIENT, (fps->srvhdrwritten + fps->serverwritten) - fps->serversent)) {
+ return -1;
+ }
+ fps->state = 0;
+ }
+ closefiles(fps);
+ fps->state = 0;
+ return sso._send(s, msg, len, flags);
+ }
+ return len;
+ }
+ if(((fps->what & FP_SRVHEADER) && (fps->state == GOT_HTTP_SRV_HDR || fps->state == GOT_HTTP_SRV_HDR2))){
+#ifdef _WIN32
+ if(SetFilePointer(fps->fpd.h_srv, fps->serverwritten + fps->srvhdrwritten, 0, FILE_BEGIN) != (fps->serverwritten + fps->srvhdrwritten)){
+ return -1;
+ }
+ if(!WriteFile(fps->fpd.h_srv, msg, (DWORD)len,(DWORD *)&res,NULL) || res !=len){
+ return -1;
+ }
+#else
+ if(lseek(fps->fpd.fd_srv, fps->serverwritten + fps->srvhdrwritten, SEEK_SET) < 0) {
+ return -1;
+ }
+ if((res = write(fps->fpd.fd_srv, msg, len) != len)) return -1;
+#endif
+ fps->srvhdrwritten += res;
+ return res;
+ }
+ }
+ return sso._send(s, msg, len, flags);
+}
+static int WINAPI fp_sendto(SOCKET s, const void *msg, int len, int flags, const struct sockaddr *to, fp_size_t tolen){
+ struct fp_stream *fps = NULL;
+ int res;
+ res = searchsocket(s, &fps);
+ if(res == 2) {
+ switch(fps->state){
+ case GOT_SMTP_REQ:
+ if(!(fps->what & FP_CLIDATA)) break;
+ fps->state = GOT_SMTP_DATA;
+ initclientfile(fps);
+ case GOT_FTP_REQ:
+ if(fps->state == GOT_FTP_REQ){
+ if(!(fps->what & FP_CLIDATA)) break;
+ fps->state = GOT_FTP_CLIDATA;
+ initclientfile(fps);
+ }
+ case GOT_HTTP_CLI_HDR2:
+ if(fps->state == GOT_HTTP_CLI_HDR2){
+ processcallbacks(fps, FP_CALLAFTERCLIHEADERS, NULL, 0);
+ if ((fps->what & FP_REJECT)) return -1;
+ if((fps->what & FP_CLIDATA) && !(fps->what & FP_CLIHEADER)) initclientfile(fps);
+ else if(!(fps->what & FP_CLIDATA) && (fps->what & FP_CLIHEADER)){
+ if(fps->clihdrwritten + fps->clientwritten > fps->clientsent) {
+ if(copyfdtosock(fps, SERVER, (fps->clihdrwritten + fps->clientwritten) - fps->clientsent))
+ return -2;
+ }
+ }
+ fps->state = GOT_HTTP_CLIDATA;
+ }
+ case GOT_HTTP_REQUEST:
+ if(fps->state == GOT_HTTP_REQUEST && !(fps->what & FP_CLIHEADER)) break;
+ case GOT_SMTP_DATA:
+ case GOT_FTP_CLIDATA:
+ case GOT_FTP_SRVDATA:
+ case GOT_HTTP_CLIDATA:
+ if((!fps->what & FP_CLIDATA)) break;
+#ifdef _WIN32
+ if(SetFilePointer(fps->fpd.h_cli, fps->clientwritten + fps->clihdrwritten, 0, FILE_BEGIN) != (fps->clientwritten + fps->clihdrwritten)){
+ return -1;
+ }
+ if(!WriteFile(fps->fpd.h_cli, msg, (DWORD)len,(DWORD *)&res,NULL) || res != len) {
+ return -1;
+ }
+#else
+ if(lseek(fps->fpd.fd_cli, fps->clientwritten + fps->clihdrwritten, SEEK_SET) < 0) {
+ return -1;
+ }
+ if((res = write(fps->fpd.fd_cli, msg, len) != len)) return -1;
+#endif
+ if(fps->state == GOT_HTTP_REQUEST)fps->clihdrwritten += res;
+ else fps->clientwritten += res;
+ if(fps->preview_size && ((fps->clihdrwritten + fps->clientwritten) > (fps->clientsent + fps->preview_size))){
+ if(!fps->clientsent){
+ processcallbacks(fps, FP_PREVIEWCLI, NULL, 0);
+ if ((fps->what & FP_REJECT)) return -1;
+ }
+ if(copyfdtosock(fps, SERVER, (fps->clihdrwritten + fps->clientwritten) - (fps->clientsent + fps->preview_size)))
+ return -1;
+
+ }
+ return res;
+ }
+
+ }
+ else if(res == 1){
+ switch(fps->state){
+ case GOT_HTTP_SRV_HDR2:
+ processcallbacks(fps, FP_CALLAFTERSRVHEADERS, NULL, 0);
+ if ((fps->what & FP_REJECT)) return REJECT;
+ if((fps->what & FP_SRVDATA) && !(fps->what & FP_SRVHEADER)) initserverfile(fps);
+ else if(!(fps->what & FP_SRVDATA) && (fps->what & FP_SRVHEADER)){
+ if(fps->srvhdrwritten + fps->serverwritten > fps->serversent) {
+ if(copyfdtosock(fps, CLIENT, (fps->srvhdrwritten + fps->serverwritten) - fps->serversent))
+ return -2;
+ }
+ }
+ fps->state = GOT_HTTP_SRVDATA;
+ case GOT_FTP_REQ:
+ if(fps->state == GOT_FTP_REQ){
+ if(!(fps->what & FP_SRVDATA)) break;
+ fps->state = GOT_FTP_SRVDATA;
+ initserverfile(fps);
+ }
+ case GOT_HTTP_SRV_HDR:
+ if(fps->state == GOT_HTTP_SRV_HDR && !(fps->what & FP_SRVHEADER)) break;
+ case GOT_HTTP_SRVDATA:
+ case GOT_FTP_SRVDATA:
+ case GOT_FTP_CLIDATA:
+ if(!(fps->what & FP_SRVDATA)) break;
+#ifdef _WIN32
+ if(SetFilePointer(fps->fpd.h_srv, fps->serverwritten + fps->srvhdrwritten, 0, FILE_BEGIN) != (fps->serverwritten + fps->srvhdrwritten)){
+ return -1;
+ }
+ if(!WriteFile(fps->fpd.h_srv, msg, (DWORD)len,(DWORD *)&res,NULL) || res != len){
+ return -1;
+ }
+#else
+ if(lseek(fps->fpd.fd_srv, fps->serverwritten + fps->srvhdrwritten, SEEK_SET) < 0) {
+ return -1;
+ }
+ if((res = write(fps->fpd.fd_srv, msg, len) != len)) return -1;
+#endif
+ if(fps->state == GOT_HTTP_SRV_HDR)fps->srvhdrwritten += res;
+ else fps->serverwritten += res;
+ if(fps->preview_size && ((fps->srvhdrwritten + fps->serverwritten) > (fps->serversent + fps->preview_size))){
+ if(!fps->serversent){
+ processcallbacks(fps, FP_PREVIEWSRV, NULL, 0);
+ if ((fps->what & FP_REJECT)) return -1;
+ }
+ if(copyfdtosock(fps, CLIENT, (fps->srvhdrwritten + fps->serverwritten) - (fps->serversent + fps->preview_size)))
+ return -1;
+
+ }
+ return res;
+ }
+ }
+ return sso._sendto(s, msg, len, flags, to, tolen);
+}
+static int WINAPI fp_recv(SOCKET s, void *buf, fp_size_t len, int flags){
+ return sso._recv(s, buf, len, flags);
+}
+static int WINAPI fp_recvfrom(SOCKET s, void * buf, fp_size_t len, int flags, struct sockaddr * from, fp_size_t * fromlen){
+ return sso._recvfrom(s, buf, len, flags, from, fromlen);
+}
+static int WINAPI fp_shutdown(SOCKET s, int how){
+ struct fp_stream *fps = NULL;
+
+ int res;
+ res = searchsocket(s, &fps);
+ if(res){
+ if(fps->state == GOT_HTTP_SRV_HDR || fps->state == GOT_HTTP_SRVDATA || fps->state == GOT_FTP_SRVDATA){
+ if(fps->srvhdrwritten + fps->serverwritten > fps->serversent) {
+ processcallbacks(fps, FP_SRVDATA, NULL, 0);
+ copyfdtosock(fps, CLIENT, (fps->srvhdrwritten + fps->serverwritten) - fps->serversent);
+ }
+ closefiles(fps);
+ fps->state = 0;
+ }
+ else if(fps->state == GOT_FTP_CLIDATA){
+ if(fps->clihdrwritten + fps->clientwritten > fps->clientsent) {
+ processcallbacks(fps, FP_CLIDATA, NULL, 0);
+ copyfdtosock(fps, SERVER, (fps->clihdrwritten + fps->clientwritten) - fps->clientsent);
+ }
+ closefiles(fps);
+ fps->state = 0;
+ }
+ }
+
+ return sso._shutdown(s, how);
+}
+static int WINAPI fp_closesocket(SOCKET s){
+ return sso._closesocket(s);
+}
+
+
+
+struct fp_stream * addfps(struct clientparam *cp){
+ struct fp_stream *fps;
+
+ for(fps = fp_streams; fps && fps->fpd.cp != cp; fps = fps->next);
+ if(!fps) {
+ fps = malloc(sizeof(struct fp_stream));
+ if(!fps){
+ return NULL;
+ }
+ memset(fps, 0, sizeof(struct fp_stream));
+ fps->fpd.cp = cp;
+ fps->next = fp_streams;
+ fp_streams = fps;
+#ifdef _WIN32
+ fps->fpd.h_cli = fps->fpd.h_srv = INVALID_HANDLE_VALUE;
+#else
+ fps->fpd.fd_cli = fps->fpd.fd_srv = -1;
+#endif
+ }
+ return fps;
+}
+
+static int fp_registercallback (int what, int max_size, int preview_size, struct clientparam *cp, FP_CALLBACK cb, void *data){
+ struct fp_callback * fpc;
+ struct fp_stream *fps;
+
+ fpc = malloc(sizeof(struct fp_callback));
+ if(!fpc) return 0;
+ fpc->what = what;
+ fpc->preview_size = preview_size;
+ fpc->max_size = max_size;
+ fpc->data = data;
+ fpc->callback = cb;
+ pthread_mutex_lock(&file_mutex);
+ fps = addfps(cp);
+ if(fps){
+ fpc->next = fps->callbacks;
+ fps->callbacks = fpc;
+ fps->what |= fpc->what;
+ if(preview_size > fps->preview_size) fps->preview_size = preview_size;
+ }
+ else free(fpc);
+ pthread_mutex_unlock(&file_mutex);
+ return fps?1:0;
+}
+
+
+static void * fp_open(void * idata, struct srvparam * param){
+ return idata;
+}
+
+
+#define FC ((struct fp_stream *)fc)
+
+static FILTER_ACTION fp_client(void *fo, struct clientparam * param, void** fc){
+
+ pthread_mutex_lock(&file_mutex);
+ (*fc) = (void *)addfps(param);
+ pthread_mutex_unlock(&file_mutex);
+ return CONTINUE;
+}
+
+static FILTER_ACTION fp_request(void *fc, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int offset, int * length_p){
+ if(fc && (param->service == S_PROXY)){
+ if(FC->state) {
+ closefiles(FC);
+ FC->state = 0;
+ }
+ processcallbacks(FC, FP_CALLONREQUEST, *buf_p + offset, *length_p - offset);
+ if(FC->what &FP_REJECT) return REJECT;
+ FC->state = GOT_HTTP_REQUEST;
+ genpaths(FC);
+ if(FC->what & FP_CLIHEADER) initclientfile(FC);
+
+ }
+ return CONTINUE;
+}
+
+static FILTER_ACTION fp_hcli(void *fc, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int offset, int * length_p){
+ if(fc && param->service == S_SMTPP) {
+ processcallbacks(FC, FP_CALLONREQUEST, *buf_p + offset, *length_p - offset);
+ if(FC->what & FP_REJECT) return REJECT;
+ if(!FC->state)genpaths(FC);
+ FC->state = GOT_SMTP_REQ;
+ }
+ if(fc && param->service == S_FTPPR) {
+ processcallbacks(FC, FP_CALLONREQUEST, *buf_p + offset, *length_p - offset);
+ if(FC->what & FP_REJECT) return REJECT;
+ genpaths(FC);
+ FC->state = GOT_FTP_REQ;
+ }
+ return CONTINUE;
+}
+
+static FILTER_ACTION fp_hsrv(void *fc, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int offset, int * length_p){
+ if(fc && param->service == S_PROXY && (FC->state == GOT_HTTP_REQUEST || FC->state == GOT_HTTP_CLI_HDR || FC->state == GOT_HTTP_CLIDATA)){
+ if(FC->what & FP_SRVHEADER) initserverfile(FC);
+ FC->state = GOT_HTTP_SRV_HDR;
+
+ }
+ return CONTINUE;
+}
+
+static FILTER_ACTION fp_dcli(void *fc, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int offset, int * length_p){
+ if(fc && FC->state == GOT_HTTP_REQUEST){
+ FC->state = GOT_HTTP_CLI_HDR2;
+ }
+ return CONTINUE;
+}
+
+
+static FILTER_ACTION fp_dsrv(void *fc, struct clientparam * param, unsigned char ** buf_p, int * bufsize_p, int offset, int * length_p){
+ if(fc && (FC->state == GOT_HTTP_REQUEST || FC->state == GOT_HTTP_CLI_HDR || FC->state == GOT_HTTP_CLIDATA || FC->state == GOT_HTTP_CLIDATA || FC->state == GOT_HTTP_SRV_HDR)){
+ FC->state = GOT_HTTP_SRV_HDR2;
+ }
+ return CONTINUE;
+}
+
+static void fp_clear(void *fc){
+ removefps(FC);
+ free(fc);
+}
+
+static void fp_close(void *fo){
+}
+
+
+static struct filter fp_filter = {
+ NULL,
+ "filefilter",
+ "filefilter",
+ fp_open,
+ fp_client,
+ fp_request,
+ fp_hcli,
+ fp_hsrv,
+ NULL,
+ fp_dcli,
+ fp_dsrv,
+ fp_clear,
+ fp_close,
+};
+
+static struct symbol fp_symbols[] = {
+ {fp_symbols + 1, "fp_registercallback", (void*) fp_registercallback},
+ {NULL, "fp_stringtable", (void*) fp_stringtable}
+};
+
+static int file_loaded=0;
+
+
+#ifdef _WIN32
+__declspec(dllexport)
+#endif
+
+
+ int file_plugin (struct pluginlink * pluginlink,
+ int argc, char** argv){
+
+ char * dirp;
+ if(!file_loaded){
+ pthread_mutex_init(&file_mutex, NULL);
+ file_loaded = 1;
+ pl = pluginlink;
+ memcpy(&sso, pl->so, sizeof(struct sockfuncs));
+ pl->so->_poll = fp_poll;
+ pl->so->_send = fp_send;
+ pl->so->_sendto = fp_sendto;
+ pl->so->_recv = fp_recv;
+ pl->so->_recvfrom = fp_recvfrom;
+ pl->so->_shutdown = fp_shutdown;
+ pl->so->_closesocket = fp_closesocket;
+ fp_filter.next = pl->conf->filters;
+ pl->conf->filters = &fp_filter;
+ fp_symbols[1].next = pl->symbols.next;
+ pl->symbols.next = fp_symbols;
+ }
+ if(path) free(path);
+ dirp = (argc > 1)? argv[1] : getenv("TEMP");
+ if(strlen(dirp) > 200 || strchr(dirp, '%')) return (13001);
+#ifdef _WIN32
+ sprintf(path, "%s\\%%d.tmp", dirp);
+#else
+ sprintf(path, "%s/%%d.tmp", dirp);
+#endif
+ if(argc > 2) preview = atoi(argv[2]);
+ if(!preview) preview = 32768;
+
+ return 0;
+
+ }
+#ifdef __cplusplus
+}
+#endif
diff --git a/src/plugins/FilePlugin/FilePlugin.h b/src/plugins/FilePlugin/FilePlugin.h
new file mode 100644
index 0000000..149d56c
--- /dev/null
+++ b/src/plugins/FilePlugin/FilePlugin.h
@@ -0,0 +1,41 @@
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+#define FP_OK 0
+#define FP_REJECT 65536
+
+#define FP_CLIDATA 1
+#define FP_SRVDATA 2
+#define FP_CLIHEADER 4
+#define FP_SRVHEADER 8
+#define FP_KEEPFILE 16
+#define FP_SHAREFILE 32
+#define FP_PREVIEWCLI 64
+#define FP_PREVIEWSRV 128
+#define FP_CALLONREQUEST 256
+#define FP_CALLAFTERCLIHEADERS 512
+#define FP_CALLAFTERSRVHEADERS 1024
+#define FP_CALLONREMOVE 2048
+
+struct fp_filedata {
+ struct clientparam *cp;
+#ifdef _WIN32
+ HANDLE h_cli, h_srv;
+#else
+ int fd_cli, fd_srv;
+#endif
+ char *path_cli;
+ char *path_srv;
+};
+
+
+typedef int (*FP_CALLBACK)(int what, void *data, struct fp_filedata *fpd, char *buf, int size);
+
+typedef int (*FP_REGISTERCALBACK) (int what, int max_size, int preview_size, struct clientparam *cp, FP_CALLBACK cb, void *data);
+
+
+#ifdef __cplusplus
+}
+#endif
diff --git a/src/plugins/FilePlugin/Makefile b/src/plugins/FilePlugin/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/plugins/FilePlugin/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/plugins/FilePlugin/Makefile.inc b/src/plugins/FilePlugin/Makefile.inc
new file mode 100644
index 0000000..882a59a
--- /dev/null
+++ b/src/plugins/FilePlugin/Makefile.inc
@@ -0,0 +1,7 @@
+all: $(BUILDDIR)FilePlugin$(DLSUFFICS)
+
+FilePlugin$(OBJSUFFICS): FilePlugin.c
+ $(CC) $(DCFLAGS) $(CFLAGS) FilePlugin.c
+
+$(BUILDDIR)FilePlugin$(DLSUFFICS): FilePlugin$(OBJSUFFICS)
+ $(LN) $(LNOUT)../../$(BUILDDIR)FilePlugin$(DLSUFFICS) $(LDFLAGS) $(DLFLAGS) FilePlugin$(OBJSUFFICS)
diff --git a/src/plugins/FilePlugin/Makefile.var b/src/plugins/FilePlugin/Makefile.var
new file mode 100644
index 0000000..6e2c41c
--- /dev/null
+++ b/src/plugins/FilePlugin/Makefile.var
@@ -0,0 +1,37 @@
+VERFILE = version.obj ../3proxy.RES
+#$Id: Makefile.msvc,v 1.17 2010-11-11 14:44:11 v.dubrovin Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin lastFripper FilePlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/src/plugins/LastFRipper/Makefile b/src/plugins/LastFRipper/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/plugins/LastFRipper/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/plugins/LastFRipper/Makefile.inc b/src/plugins/LastFRipper/Makefile.inc
new file mode 100644
index 0000000..962f012
--- /dev/null
+++ b/src/plugins/LastFRipper/Makefile.inc
@@ -0,0 +1,7 @@
+all: $(BUILDDIR)lastFripper$(DLSUFFICS)
+
+lastFripper$(OBJSUFFICS): lastFripper.c
+ $(CC) $(DCFLAGS) $(CFLAGS) lastFripper.c
+
+$(BUILDDIR)lastFripper$(DLSUFFICS): lastFripper$(OBJSUFFICS)
+ $(LN) $(LNOUT)../../$(BUILDDIR)lastFripper$(DLSUFFICS) $(LDFLAGS) $(DLFLAGS) lastFripper$(OBJSUFFICS)
diff --git a/src/plugins/LastFRipper/Makefile.var b/src/plugins/LastFRipper/Makefile.var
new file mode 100644
index 0000000..6e2c41c
--- /dev/null
+++ b/src/plugins/LastFRipper/Makefile.var
@@ -0,0 +1,37 @@
+VERFILE = version.obj ../3proxy.RES
+#$Id: Makefile.msvc,v 1.17 2010-11-11 14:44:11 v.dubrovin Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin lastFripper FilePlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/src/plugins/LastFRipper/lastFripper.c b/src/plugins/LastFRipper/lastFripper.c
new file mode 100644
index 0000000..d5eea85
--- /dev/null
+++ b/src/plugins/LastFRipper/lastFripper.c
@@ -0,0 +1,704 @@
+/*
+ released as a public domain
+ std.denis, 2009
+*/
+#include "../../structures.h"
+#include "lastFripper.h"
+
+#define strdup _strdup
+#define strnicmp _strnicmp
+#define ltoa _ltoa
+
+#define mkdir _mkdir
+
+#define PART_SUFFIX "_partial"
+
+void my_mkdir( char* name )
+{
+ char* pdir = name;
+
+ while( 1 ) {
+ char ch;
+ char* pnext = pdir;
+ while( *pnext && *pnext != '\\' && *pnext != '/' )
+ pnext++;
+ if( *pnext == 0 )
+ break;
+
+ ch = *pnext;
+ *pnext = 0;
+ mkdir( name );
+ *pnext = ch;
+
+ pdir = pnext + 1;
+ }
+ mkdir( name );
+}
+
+
+__inline void myOutputDebugStringA1( char* str )
+{
+/* char fname[128];
+ ltoa( GetCurrentThreadId(), fname, 10 );
+ FILE* fp = fopen( fname, "ab" );
+ fputs( str, fp );
+ fputs( "\r\n", fp );
+ fflush( fp );
+ fclose( fp );
+*/
+}
+
+__inline void myOutputDebugStringA( void* buf, int len )
+{
+/* char fname[128];
+ ltoa( GetCurrentThreadId(), fname, 10 );
+ FILE* fp = fopen( fname, "ab" );
+ fwrite( buf, len, 1, fp );
+ fputs( "\r\n", fp );
+ fflush( fp );
+ fclose( fp ); */
+}
+
+#ifndef isnumber
+#define isnumber(i_n_arg) ((i_n_arg>='0')&&(i_n_arg<='9'))
+#endif
+
+#define sizearr(x) (sizeof(x)/sizeof(x[0]))
+#define xmalloc( type, len ) ((type*)malloc( (len) * sizeof(type) ) )
+#define xcalloc( type, len ) ((type*)calloc( (len), sizeof(type) ) )
+
+int clean_filename( char* filename )
+{
+ int i;
+ for( i = 0; filename[i]; i++ )
+ switch( filename[i] ) {
+ case '*':
+ case '?':
+ case '<':
+ case '>':
+ case '\\':
+ case '/':
+ case ':':
+ case '"':
+ filename[i] = '_';
+ break;
+ }
+ return i;
+}
+
+
+static struct pluginlink * pl;
+static int lfm_loaded = 0;
+static char* g_folder = 0;
+static char* g_format = 0;
+
+static int lfm_format_filename( struct playlist_item* p_item, char* p_filename, int n_filename )
+{
+ int i = 0, j;
+ char ch;
+ char* fmt;
+ char *ff = NULL;
+
+ if( g_folder && *g_folder ) {
+ strncpy( p_filename, g_folder, n_filename );
+ i = strlen( p_filename );
+ if( i < n_filename-1 && p_filename[i-1] != '\\' )
+ p_filename[i++] = '\\';
+ }
+
+ fmt = g_format;
+ if( fmt == NULL ) fmt = "%a\\%t.mp3";
+ while( ( ch = *fmt++ ) != 0 ) {
+ if( ch == '%' ) {
+ char* p_sz = NULL;
+ char a_sz[32];
+ ch = *fmt++;
+ switch( ch ) {
+ case 0:
+ fmt--; break;
+ case '%':
+ p_sz = "%";
+ break;
+ case 'n': {
+ static unsigned ndx = 0;
+ ltoa( ndx++, a_sz, 10 );
+ p_sz = a_sz;
+ break;
+ }
+ case 'a':
+ p_sz = p_item->artist;
+ break;
+ case 't':
+ p_sz = p_item->title;
+ break;
+ case 'l':
+ p_sz = p_item->album;
+ break;
+ }
+ if( p_sz ) {
+ strncpy( p_filename+i, p_sz, n_filename-i );
+ p_filename[n_filename-1] = 0;
+ i += clean_filename( p_filename+i );
+ }
+ } else
+ if( i < n_filename ) p_filename[i++] = ch;
+ }
+
+ for( j = i-1; j >= 0; j-- )
+ if( p_filename[j] == '\\' || p_filename[j] == '/' ) {
+ ff = p_filename + j;
+ break;
+ }
+ if( ff ) {
+ char ch = *ff;
+ *ff = 0;
+ my_mkdir( p_filename );
+ *ff = ch;
+ }
+
+ return i;
+}
+
+static void lfm_close_request( struct lfm_client_data* p_client )
+{
+ struct lfm_filter_data* p_data;
+ if( p_client == NULL ) return;
+ p_data = p_client->p_data;
+ if( p_data == NULL ) return;
+
+ if( p_client->req_type == LFM_PLAYLIST ) {
+ free( p_client->pl_xml );
+ } else if( p_client->req_type == LFM_GET && p_client->fp ) {
+ struct playlist_item* p_item = p_client->pl_item;
+ if( p_item ) {
+ char id3v1[128];
+ memset( id3v1, 0, 128 );
+ strcpy( id3v1, "TAG" );
+ strncpy( id3v1+3, p_item->title, 30 );
+ strncpy( id3v1+33, p_item->artist, 30 );
+ strncpy( id3v1+63, p_item->album, 30 );
+ id3v1[127] = -1;
+ fwrite( id3v1, 128, 1, p_client->fp );
+ }
+ fclose( p_client->fp );
+/*
+ if( p_item ) {
+ char filename_part[512], filename[512];
+ int i = lfm_format_filename( p_item, filename_part, sizearr(filename_part) );
+ memcpy( filename, filename_part, sizeof(filename) );
+ strncpy( filename_part+i, PART_SUFFIX, sizearr(filename_part)-i );
+ rename( filename_part, filename );
+ }
+*/
+ pthread_mutex_lock( &p_data->mutex );
+ if( p_data->playlist != NULL && p_item != NULL ) {
+ if( p_data->playlist == p_item )
+ p_data->playlist = p_item->next;
+ else {
+ struct playlist_item *p_last = p_data->playlist;
+
+ while( p_last->next != NULL && p_last->next != p_item )
+ p_last = p_last->next;
+
+ if( p_last->next )
+ p_last->next = p_item->next;
+ }
+ if( p_item->artist ) free( p_item->artist );
+ if( p_item->title ) free( p_item->title );
+ if( p_item->album ) free( p_item->album );
+ if( p_item->url ) free( p_item->url );
+ free( p_item );
+ }
+ pthread_mutex_unlock( &p_data->mutex );
+ }
+ p_client->req_type = LFM_NONE;
+}
+
+static void* lfm_filter_open( void * idata, struct srvparam * param ){
+ struct lfm_filter_data* pdata = (struct lfm_filter_data*)idata;
+ if( pdata ){
+ pthread_mutex_lock( &pdata->mutex );
+ pdata->refs++;
+ pthread_mutex_unlock( &pdata->mutex );
+ } else {
+ if( ( pdata = xcalloc( struct lfm_filter_data, 1 ) ) != NULL ) {
+ pthread_mutex_init( &pdata->mutex, NULL );
+ pdata->playlist = NULL;
+ pdata->refs++;
+ }
+ }
+ return pdata;
+}
+
+static FILTER_ACTION lfm_filter_client( void *fo, struct clientparam* param, void** fc )
+{
+ struct lfm_filter_data* p_data;
+ struct lfm_client_data* p_client;
+ *fc = NULL;
+ if( fo == NULL ) return PASS;
+
+ p_data = (struct lfm_filter_data*)fo;
+ p_client = xcalloc( struct lfm_client_data, 1 );
+ if( p_client == NULL ) return PASS;
+
+ p_client->p_data = p_data;
+ p_client->req_type = LFM_NONE;
+
+ *fc = p_client;
+ return CONTINUE;
+}
+
+static void lfm_filter_clear( void *fc )
+{
+ struct lfm_client_data* p_client;
+
+ p_client = (struct lfm_client_data*)fc;
+ if( p_client == NULL ) return;
+
+ lfm_close_request( p_client );
+
+ free( p_client );
+}
+
+static void lfm_filter_close(void *fo){
+ struct lfm_filter_data* p_data;
+ struct playlist_item* p_item;
+
+ p_data = (struct lfm_filter_data*)fo;
+ if( p_data == NULL ) return;
+
+ if( --p_data->refs > 0 ) return;
+
+ pthread_mutex_destroy( &p_data->mutex );
+ p_item = p_data->playlist;
+ while( p_item ) {
+ struct playlist_item* p_old = p_item;
+ p_item = p_item->next;
+
+ if( p_old->artist ) free( p_old->artist );
+ if( p_old->title ) free( p_old->title );
+ if( p_old->album ) free( p_old->album );
+ if( p_old->url ) free( p_old->url );
+ free( p_old );
+ }
+
+ free( p_data );
+}
+
+static FILTER_ACTION lfm_filter_request( void *fc, struct clientparam *param, unsigned char** buf_p, int* bufsize_p, int offset, int* length_p )
+{
+ char* p_buf = (char*)( *buf_p + offset );
+ int n_buf = *length_p - offset;
+ struct lfm_client_data* p_client;
+ struct lfm_filter_data* p_data;
+
+ if( p_buf == NULL || n_buf < 5 ) return CONTINUE;
+
+ p_client = (struct lfm_client_data*)fc;
+ if( p_client == NULL ) return CONTINUE;
+ p_data = p_client->p_data;
+ if( p_data == NULL ) return CONTINUE;
+
+ pl->conf->filtermaxsize = 0;
+
+ lfm_close_request( p_client );
+
+ p_client->req_type = LFM_NONE;
+ p_client->fp = NULL;
+
+ if( strncasecmp( p_buf, "GET ", 4 ) != 0 ) return CONTINUE;
+
+ p_buf += 4;
+
+ if( strncasecmp( p_buf, "http://ws.audioscrobbler.com/radio/xspf.php?", 44 ) == 0 ) {
+ myOutputDebugStringA1( "getting a playlist" );
+ p_client->req_type = LFM_PLAYLIST;
+ } else {
+ char zzz[256];
+ int i;
+ struct playlist_item* p_item;
+ for( i = 0; i < n_buf && i < 256; i++ ) {
+ if( p_buf[i] == '\r' ) break;
+ zzz[i] = p_buf[i];
+ }
+ zzz[i] = 0;
+ myOutputDebugStringA1( zzz );
+ pthread_mutex_lock( &p_data->mutex );
+ p_item = p_data->playlist;
+ while( p_item ) {
+ if( strncasecmp( p_buf, p_item->url, p_item->url_len ) == 0 )
+ break;
+ p_item = p_item->next;
+ }
+ pthread_mutex_unlock( &p_data->mutex );
+ if( p_item ) {
+ myOutputDebugStringA1( "getting a known url: " );
+ myOutputDebugStringA1( p_item->title );
+ p_client->req_type = LFM_GET;
+ p_client->pl_item = p_item;
+ }
+ }
+
+ return CONTINUE;
+}
+
+static FILTER_ACTION lfm_filter_header_srv( void *fc, struct clientparam *param, unsigned char** buf_p, int* bufsize_p, int offset, int* length_p )
+{
+ char* p_buf = (char*)( *buf_p + offset );
+ struct lfm_client_data* p_client;
+ int n_buf = *length_p - offset;
+ struct lfm_filter_data* p_data;
+ char zzz[100];
+ int code;
+
+ if( p_buf == NULL || n_buf < 9 ) return CONTINUE;
+
+ p_client = (struct lfm_client_data*)fc;
+ if( p_client == NULL ) return CONTINUE;
+ p_data = p_client->p_data;
+ if( p_data == NULL ) return CONTINUE;
+
+ code = atoi( p_buf + 9 );
+ sprintf( zzz, "http code: %d", code );
+ myOutputDebugStringA1( zzz );
+ myOutputDebugStringA( p_buf, n_buf );
+ if( p_client->req_type == LFM_GET && ( code > 300 && code < 304 || code == 307 ) ) {
+ p_client->req_type = LFM_REDIR;
+ do {
+ char* p_line = p_buf;
+ int n_line;
+
+ for(; n_buf > 0 && *p_buf != '\r'; p_buf++, n_buf-- ) {};
+ n_line = p_buf - p_line;
+ if( n_line <= 0 ) break;
+ if( n_line > 10 && strncasecmp( p_line, "location: ", 10 ) == 0 ) {
+ myOutputDebugStringA1( "redir/location: " );
+ myOutputDebugStringA( p_line + 10, n_line - 10 );
+ if( p_client->pl_item ) {
+ char* p_url = p_line + 10;
+ int n_url = n_line - 10;
+ pthread_mutex_lock( &p_data->mutex );
+ if( p_client->pl_item->url ) free( p_client->pl_item->url );
+ p_client->pl_item->url = xmalloc( char, n_url + 1 + 1 );
+ memcpy( p_client->pl_item->url, p_url, n_url );
+ p_client->pl_item->url[n_url] = ' ';
+ p_client->pl_item->url[n_url+1] = 0;
+ p_client->pl_item->url_len = n_url + 1;
+ myOutputDebugStringA1( "got a url: " );
+ myOutputDebugStringA1( p_client->pl_item->url );
+ pthread_mutex_unlock( &p_data->mutex );
+ }
+ p_client->req_type = LFM_NONE;
+ }
+ for(; n_buf > 0 && ( *p_buf == '\n' || *p_buf == '\r' ); p_buf++, n_buf-- ) {};
+ } while( n_buf > 0 );
+ }
+
+ if( code == 200 && p_client->req_type == LFM_GET ) {
+ struct playlist_item* p_item = p_client->pl_item;
+ char filename[512];
+ int i = lfm_format_filename( p_item, filename, sizearr(filename) );
+ /*
+ strncpy( filename + i, PART_SUFFIX, sizearr(filename)-i );
+ */
+ p_client->fp = fopen( filename, "wb" );
+ }
+ else if( code == 200 && p_client->req_type == LFM_PLAYLIST ) {
+ p_client->pl_xml = xcalloc( struct xml_state, 1 );
+ }
+
+ return CONTINUE;
+}
+
+void playlist_analyze( struct lfm_client_data* p_client, const char* p_buf, int len );
+static FILTER_ACTION lfm_filter_data_srv( void *fc, struct clientparam *param, unsigned char** buf_p, int* bufsize_p, int offset, int* length_p )
+{
+ char* p_buf = (char*)( *buf_p + offset );
+ int n_buf = *length_p - offset;
+ struct lfm_client_data* p_client;
+ struct lfm_filter_data* p_data;
+
+
+ myOutputDebugStringA1( "filter_data_srv" );
+ myOutputDebugStringA( p_buf, n_buf );
+
+ if( p_buf == NULL || n_buf < 1 ) return CONTINUE;
+
+ p_client = (struct lfm_client_data*)fc;
+ if( p_client == NULL ) return CONTINUE;
+ p_data = p_client->p_data;
+ if( p_data == NULL ) return CONTINUE;
+
+ if( p_client->req_type == LFM_PLAYLIST )
+ myOutputDebugStringA1( "filter_data_srv: playlist" );
+ else if( p_client->req_type == LFM_GET ) {
+ myOutputDebugStringA1( "filter_data_srv: retrieving" );
+ if( p_client->fp == NULL )
+ myOutputDebugStringA1( "but no file allocated" );
+ }
+
+ if( p_client->req_type == LFM_PLAYLIST )
+ playlist_analyze( p_client, p_buf, n_buf );
+ if( p_client->fp )
+ fwrite( p_buf, n_buf, 1, p_client->fp );
+
+ return CONTINUE;
+}
+
+enum XmlState
+{
+ XML_TEXT,
+ XML_TAGNAME,
+ XML_ATTRNAME_W,
+ XML_ATTRNAME,
+ XML_ATTRVALUE_W,
+ XML_ATTRVALUE,
+ XML_TAGCLOSE,
+ XML_TAGOPENCLOSE,
+};
+
+int xml_get_token_id( char** table, char* token )
+{
+ int i;
+ char* psz;
+ for( psz = token; *psz; psz++ )
+ *psz = tolower( *psz );
+ for( i = 0; *table; i++, table++ )
+ if( strcmp( *table, token ) == 0 ) return i;
+
+ return -1;
+}
+
+enum {
+ XT_PLAYLIST,
+ XT_TRACK_LIST,
+ XT_TRACK,
+ XT_LOCATION,
+ XT_CREATOR,
+ XT_ALBUM,
+ XT_TITLE
+};
+
+char* xt_list[] = {
+ "playlist",
+ "tracklist",
+ "track",
+ "location",
+ "creator",
+ "album",
+ "title",
+ NULL
+};
+
+void playlist_analyze( struct lfm_client_data* p_client, const char* p_buf, int len )
+{
+ struct xml_state* xs = p_client->pl_xml;
+ int n_buf = len;
+
+ if( xs == NULL ) return;
+
+ while( n_buf > 0 ) {
+ enum {
+ XMS_NONE,
+ XMS_TAG,
+ XMS_ATTR_NAME,
+ XMS_ATTR_VALUE,
+ XMS_TEXT
+ } gotta = XMS_NONE;
+ char ch = *p_buf++;
+ n_buf--;
+lbl_retry:
+ switch( xs->state ) {
+ case XML_TAGNAME:
+ if( ch == '>' ) {
+ xs->state = XML_TEXT;
+ gotta = XMS_TAG;
+ break;
+ } else if( ch == '/' ) {
+ if( xs->n_token == 0 )
+ xs->closing = 1;
+ else {
+ xs->state = XML_ATTRNAME_W;
+ gotta = XMS_TAG;
+ xs->n_token--;
+ }
+ break;
+ } else if( isspace( ch ) ) {
+ xs->state = XML_ATTRNAME_W;
+ gotta = XMS_TAG;
+ break;
+ }
+ if( xs->n_token < TOKEN_MAXLEN ) xs->p_token[xs->n_token++] = ch;
+ break;
+ case XML_ATTRNAME_W:
+ if( ch == '>' ) {
+ xs->state = XML_TEXT;
+ break;
+ } else if( ch == '/' ) {
+ xs->closing = 1;
+ xs->state = XML_TEXT;
+ gotta = XMS_TAG;
+ break;
+ } else if( !isspace( ch ) ) {
+ xs->state = XML_ATTRNAME;
+ goto lbl_retry;
+ }
+ break;
+ case XML_ATTRNAME:
+ if( ch == '=' ) {
+ xs->state = XML_ATTRVALUE_W;
+ gotta = XMS_ATTR_NAME;
+ break;
+ }
+ if( xs->n_token < TOKEN_MAXLEN ) xs->p_token[xs->n_token++] = ch;
+ break;
+ case XML_ATTRVALUE_W:
+ if( ch == '"' || ch == '\'' ) {
+ xs->sep = ch;
+ xs->state = XML_ATTRVALUE;
+ break;
+ }
+ break;
+ case XML_ATTRVALUE:
+ if( ch == xs->sep ) {
+ xs->state = XML_ATTRNAME_W;
+ gotta = XMS_ATTR_VALUE;
+ break;
+ }
+ if( xs->n_token < TOKEN_MAXLEN ) xs->p_token[xs->n_token++] = ch;
+ break;
+ case XML_TEXT:
+ if( ch == '<' ) {
+ xs->state = XML_TAGNAME;
+ gotta = XMS_TEXT;
+ break;
+ }
+ if( xs->n_token < TOKEN_MAXLEN ) xs->p_token[xs->n_token++] = ch;
+ break;
+ }
+
+ if( gotta != XMS_NONE ) {
+ xs->p_token[xs->n_token] = 0;
+
+ switch( gotta ) {
+ case XMS_TAG: {
+ int id = xml_get_token_id( xt_list, xs->p_token );
+ if( !xs->closing ) {
+ if( xs->level < sizeof(xs->tree) ) xs->tree[xs->level] = id;
+ xs->level++;
+
+ if( id == XT_TRACK && xs->level == 3 && xs->tree[1] == XT_TRACK_LIST )
+ xs->p_item = xcalloc( struct playlist_item, 1 );
+ } else {
+ if( xs->level > 0 ) xs->level--;
+ if( id == XT_TRACK && xs->level == 2 && xs->tree[1] == XT_TRACK_LIST ) {
+ char zzz[1024];
+ _snprintf( zzz, 1024, "artist: <%s>, title: <%s>, url: <%s>",
+ xs->p_item->artist, xs->p_item->title, xs->p_item->url );
+ myOutputDebugStringA1( zzz );
+ pthread_mutex_lock( &p_client->p_data->mutex );
+ xs->p_item->next = p_client->p_data->playlist;
+ p_client->p_data->playlist = xs->p_item;
+ pthread_mutex_unlock( &p_client->p_data->mutex );
+ }
+ xs->closing = 0;
+ }
+
+ break;
+ }
+ case XMS_ATTR_NAME:
+ break;
+ case XMS_ATTR_VALUE:
+ break;
+ case XMS_TEXT:
+ if( xs->level == 4 && xs->tree[1] == XT_TRACK_LIST && xs->tree[2] == XT_TRACK ) {
+ struct playlist_item* item = xs->p_item;
+ if( item )
+ switch( xs->tree[3] ) {
+ case XT_LOCATION:
+ item->url_len = xs->n_token;
+ item->url = xmalloc( char, item->url_len + 1 + 1);
+ memcpy( item->url, xs->p_token, item->url_len );
+ item->url[item->url_len++] = ' ';
+ item->url[item->url_len] = 0;
+ break;
+ case XT_CREATOR:
+ item->artist = strdup( xs->p_token );
+ break;
+ case XT_ALBUM:
+ item->album = strdup( xs->p_token );
+ break;
+ case XT_TITLE:
+ item->title = strdup( xs->p_token );
+ break;
+ }
+ }
+ break;
+ }
+ xs->n_token = 0;
+ }
+ }
+}
+
+
+static struct filter lfm_filter = {
+ NULL,
+ "last.fm spy",
+ NULL,
+
+ lfm_filter_open,
+ lfm_filter_client,
+ lfm_filter_request,
+ NULL,
+ lfm_filter_header_srv,
+ NULL,
+ NULL,
+ lfm_filter_data_srv,
+ lfm_filter_clear,
+ lfm_filter_close
+};
+
+static int h_lfm_folder( int argc, unsigned char **argv )
+{
+ if( g_folder ) free( g_folder );
+ g_folder = strdup( (char*)argv[1] );
+ return 0;
+}
+
+static int h_lfm_format( int argc, unsigned char **argv )
+{
+ if( g_format ) free( g_format );
+ g_format = strdup( (char*)argv[1] );
+ return 0;
+}
+
+static struct commands lfm_commandhandlers[] = {
+ {lfm_commandhandlers+1, "lfm_folder", h_lfm_folder, 2, 2},
+ {NULL, "lfm_format", h_lfm_format, 2, 2}
+};
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#ifdef _WIN32
+__declspec(dllexport)
+#endif
+int lfm_plugin( struct pluginlink * pluginlink, int argc, char** argv )
+{
+ pl = pluginlink;
+ myOutputDebugStringA1( "lfm_plugin" );
+ if( !lfm_loaded ) {
+ lfm_loaded = 1;
+
+ lfm_filter.next = pl->conf->filters;
+ pl->conf->filters = &lfm_filter;
+
+ lfm_commandhandlers[1].next = pl->commandhandlers->next;
+ pl->commandhandlers->next = lfm_commandhandlers;
+ }
+ return 0;
+}
+
+#ifdef __cplusplus
+}
+#endif
diff --git a/src/plugins/LastFRipper/lastFripper.h b/src/plugins/LastFRipper/lastFripper.h
new file mode 100644
index 0000000..cd1e88b
--- /dev/null
+++ b/src/plugins/LastFRipper/lastFripper.h
@@ -0,0 +1,66 @@
+//
+// released as a public domain
+// std.denis, 2009
+//
+/*
+ #include "direct.h"
+*/
+
+#ifdef _WIN32
+#define strcasecmp stricmp
+#define strncasecmp strnicmp
+#else
+#define closesocket close
+extern pthread_attr_t pa;
+#endif
+
+#ifndef SOCKET_ERROR
+#define SOCKET_ERROR -1
+#endif
+
+
+typedef enum {
+ LFM_NONE,
+ LFM_PLAYLIST, // GET http://ws.audioscrobbler.com/radio/adjust.php(...)
+ LFM_REDIR, // GET http://play.last.fm/user/(...)
+ LFM_GET
+} LFM_CLASS;
+
+struct playlist_item {
+ struct playlist_item* next;
+
+ char* artist;
+ char* title;
+ char* album;
+ char* url;
+ int url_len;
+};
+
+#define TOKEN_MAXLEN 1024
+struct xml_state {
+ int state;
+ int closing;
+ char sep;
+
+ int level;
+ char tree[128]; // 128 levels nesting
+
+ int n_token;
+ char p_token[TOKEN_MAXLEN];
+
+ struct playlist_item* p_item;
+};
+
+struct lfm_filter_data {
+ pthread_mutex_t mutex;
+ struct playlist_item* playlist;
+ int refs;
+};
+struct lfm_client_data {
+ struct lfm_filter_data* p_data;
+
+ int req_type;
+ struct xml_state* pl_xml;
+ struct playlist_item* pl_item;
+ FILE* fp;
+};
diff --git a/src/plugins/LdapPlugin/com-unix.sh b/src/plugins/LdapPlugin/com-unix.sh
new file mode 100644
index 0000000..41ec9f0
--- /dev/null
+++ b/src/plugins/LdapPlugin/com-unix.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+gcc -shared -o libldapauth.so ldapauth_new.c -DNOODBC -I/usr/include -L/usr/lib -lldap
+
diff --git a/src/plugins/LdapPlugin/com-win32.bat b/src/plugins/LdapPlugin/com-win32.bat
new file mode 100644
index 0000000..a19ebf0
--- /dev/null
+++ b/src/plugins/LdapPlugin/com-win32.bat
@@ -0,0 +1,4 @@
+del ldapauth.dll
+gcc -o getldapuser getldapuser.c -DWIN32 -I"./ldapwindev" -L"./ldapwindev" -lldap
+gcc -shared -o ldapauth.dll ldapauth.c -DWIN32 -I"./ldapwindev" -L"./ldapwindev" -lldap
+
diff --git a/src/plugins/LdapPlugin/getldapuser.c b/src/plugins/LdapPlugin/getldapuser.c
new file mode 100644
index 0000000..e5e0904
--- /dev/null
+++ b/src/plugins/LdapPlugin/getldapuser.c
@@ -0,0 +1,105 @@
+/* Create list user for 3proxy ACL from LDAP server
+ (c) Kirill Lopuchov lopuchov@mail.ru
+*/
+#include
+#include
+
+/*Create list user for 3proxy ACL from LDAP server*/
+
+/* argv[1] = server
+ argv[2] = basedn
+ argv[3] = user_attribute
+ argv[4] = filter
+ argv[5] = user
+ argv[6] = password
+*/
+
+main(int argc, char *argv[])
+
+{
+ LDAP *ld = NULL;
+ LDAPMessage *res = NULL;
+ LDAPMessage *msg = NULL;
+ BerElement *ber;
+ char *getattr,**vals;
+
+
+ char *attrs[] = { NULL, NULL };
+ int i, rc = -1;
+ int lderrno;
+ unsigned char tmpbuf[1000];
+
+ if ( argc < 6 )
+ {
+ printf ("Create 3proxy ACL userlist from ldap server.\ngetldapuser < ldapserver sbasedn user_attribute filter user password > \n");
+ printf ("Example: getldapuser 192.168.0.1 dc=domain,dc=com cn (memberOf=cn=internet,cn=Users,dc=domain,dc=com) cn=admin,cn=users,dc=domain,dc=com password \n");
+ }
+
+ else
+ {
+ attrs[0]=strdup(argv[3]);
+
+ /* init ldap ------------------------ */
+ ld = ldap_init( argv[1] , 389 );
+
+ if ( ld == NULL )
+ {
+ /*perror( "ldap_init" );*/
+ printf("Error init ldap") ;
+ exit(1);
+ }
+
+
+
+ /* connect ------------------------ */
+
+ rc = ldap_bind_s( ld, argv[5], argv[6], LDAP_AUTH_SIMPLE );
+
+ if ( rc != LDAP_SUCCESS )
+ {
+ ldap_perror( ld, "Error ldap_bind" );
+ }
+
+
+
+ /* search ------------------------ */
+
+ rc = ldap_search_s( ld,argv[2], LDAP_SCOPE_SUBTREE,
+ argv[4], attrs, 0, &res );
+
+ /* get val ------------------------*/
+ rc=ldap_count_entries(ld,res);
+
+ if (rc > 0)
+ {
+
+ msg=ldap_first_entry(ld, res);
+ getattr=ldap_first_attribute(ld, msg, &ber);
+ while (rc > 0)
+ {
+ vals=ldap_get_values(ld, msg, getattr);
+ if (vals != NULL && vals[0] != NULL )
+ {
+ i=ldap_count_values(vals);
+ while(i>0)
+ {
+ printf("%s",vals[0]);
+ i--;
+ if (rc > 1) { printf(",",vals[0]); }
+ }
+ ldap_value_free(vals);
+ }
+
+ msg=ldap_next_entry(ld, msg);
+ rc--;
+ }
+
+ } //end if (rc>0)
+
+ ldap_memfree(res);
+
+ ldap_unbind(ld);
+
+ }/*end else*/
+
+}
diff --git a/src/plugins/LdapPlugin/ldapauth.c b/src/plugins/LdapPlugin/ldapauth.c
new file mode 100644
index 0000000..ad5da1a
--- /dev/null
+++ b/src/plugins/LdapPlugin/ldapauth.c
@@ -0,0 +1,575 @@
+#include
+#include
+#include
+#include
+#include
+
+#ifndef _WIN32
+
+#include
+#endif
+
+#include "../../proxy.h"
+#include "../../structures.h"
+
+struct counter_record
+{
+ unsigned long traf;
+ unsigned long trafgb;
+ time_t cleared;
+ time_t updated;
+};
+
+
+int already_loaded = 0;
+
+static struct auth myalwaysauth;
+static struct commands ldap_serv_auth_handler;
+static struct commands ldap_access_handler;
+static struct commands ldap_sbase_handler;
+static struct commands ldap_userenv_handler;
+static struct commands ldap_trafgroup_handler;
+static struct commands ldap_attrsgroup_handler;
+static struct commands ldap_dircount_handler;
+
+static char *attrs[] = { NULL, NULL};
+static char *ldap_group_attr;
+static char *ldap_access;
+static char *ldap_sbase;
+static char *ldap_serv;
+static char *ldap_user;
+static char *ldap_pass;
+static char *ldap_userenv;
+ int ldap_userenv_size;
+static char *ldap_trafgroup;
+static char *ldap_dircount;
+static int usercaselow = 0;
+
+struct pluginlink * mypluginlink;
+struct schedule myschedule;
+
+#ifndef _WIN32
+void lower (char *string)
+{
+ int length, i;
+
+ length = strlen(string);
+ for (i=0; iconf->trafcounter;
+ struct trafcount *tcd;
+ struct counter_record wcounter;
+ FILE *f;
+ unsigned char *tmpbuf,pat_file[]="%s%s.lc";
+
+
+ /* timetoexit !=0 - áóäåì çàâåðøàòüñÿ.*/
+ while (tc != NULL)
+ {
+ tcd = tc;
+ tc = tc->next;
+ f=NULL;
+ if(strcmp(tcd->comment,"ldapcounters")==0) {
+ tmpbuf=mypluginlink->myalloc(strlen(pat_file)+strlen(ldap_dircount)+strlen(tcd->ace->users->user));
+ sprintf(tmpbuf,pat_file,ldap_dircount,tcd->ace->users->user);
+ f=fopen(tmpbuf,"w+b");
+ fseek(f,0,SEEK_SET);
+ fprintf(f,"%10lu %10lu %lu %lu\n",tcd->trafgb,tcd->traf,
+ tcd->cleared,tcd->updated);
+
+ fclose(f);
+ mypluginlink->myfree(tmpbuf);
+
+ }
+ }
+
+
+ /*return 1 delete job , return 0 no delete job*/
+ if (mypluginlink->conf->needreload !=0 )
+ {
+ return (0);
+ }
+
+ return (0);
+}
+/*--------------------------------------------------------------------------*/
+
+#ifdef _WIN32
+__declspec(dllexport) int start(struct pluginlink * pluginlink,
+ int argc, char** argv);
+BOOL APIENTRY DllMain( HMODULE hModule,
+ DWORD ul_reason_for_call,
+ LPVOID lpReserved
+ )
+{
+ return TRUE;
+}
+#else
+
+int start(struct pluginlink * pluginlink,
+ int argc, char** argv);
+
+#endif
+
+/* --------------------------------------------------------------------------*/
+static int ldapfunc(struct clientparam *param)
+ {
+
+ LDAP *ld = NULL;
+ LDAPMessage *res = NULL;
+ int rc = -1;
+ char tmpbuf[1024];
+
+
+ /* init ldap ---------------------- */
+ ld = ldap_init( ldap_serv, 389 );
+ if ( ld == NULL )
+ {
+ param->srv->logfunc(param,"Error ldap_init: No init lib ldap");
+ /*ldap_perror( ld, "Error ldap_init" ); */
+ return 7;
+ }
+
+ /* test proxy user auth ------------------------*/
+ if(!param->username || !param->password) return 4;
+ if(strlen(param->password)==0) return 4;
+
+ /* this code for Active Directory LDAP catalog :(
+ detail see documentation for plugin */
+ if (usercaselow > 0)
+ #ifdef _WIN32
+ { CharLower(param->username); }
+ #else
+ { lower(param->username); }
+ #endif
+
+
+ /* create user for test auth */
+ sprintf(tmpbuf,"%.200s=%.200s,%.200s",attrs[0],param->username,ldap_userenv);
+
+ rc = ldap_bind_s( ld, tmpbuf, param->password, LDAP_AUTH_SIMPLE );
+
+
+ if ( rc != LDAP_SUCCESS )
+ {
+ param->srv->logfunc(param,"Error ldap_bind: No connect ldap catalog");
+ ldap_unbind_s(ld);
+ return 7;
+ }
+
+ ldap_unbind_s(ld);
+
+ ld = ldap_init( ldap_serv, 389 );
+ rc = ldap_bind_s( ld, ldap_user, ldap_pass, LDAP_AUTH_SIMPLE );
+
+ if ( rc != LDAP_SUCCESS )
+ {
+ param->srv->logfunc(param, "Error ldap_bind: Not authorize in ldap\
+ catalog, checked option \'ldapconnect\' ");
+ ldap_unbind_s(ld);
+ return 7;
+ }
+
+ /* test enter user in filter ------------------------------
+ create filter for search*/
+
+ sprintf(tmpbuf,"(&(%.200s=%.200s)(%.200s=%.200s))",attrs[0],param->username,
+ ldap_group_attr,ldap_access);
+
+
+ /* search */
+ rc = ldap_search_s( ld, ldap_sbase, LDAP_SCOPE_SUBTREE,
+ tmpbuf, attrs, 0, &res );
+
+ rc=ldap_count_entries(ld,res);
+
+ ldap_msgfree(res);
+ ldap_unbind_s(ld);
+
+ /* user not found */
+ if (rc == 0)
+ { return 5; }
+
+ return 0;
+ }
+
+/* --------------------------------------------------------------------------
+ handle command ldapserv */
+int h_ldapconnect(int argc, unsigned char ** argv)
+{
+ LDAP *ld = NULL;
+
+ if (argc < 2)
+ {
+ fprintf(stderr, "Error in ldapconnect: See documentation of ldapauth plugin.\n");
+ return 1;
+ }
+
+ ldap_serv=mypluginlink->mystrdup(argv[1]);
+ ldap_user=mypluginlink->mystrdup(argv[2]);
+
+ ld = ldap_init( ldap_serv, 389 );
+ ldap_unbind_s(ld);
+
+ if (argc == 4)
+ {
+ ldap_pass= mypluginlink->mystrdup(argv[3]);
+ }
+ else
+ {
+ ldap_pass=NULL;
+ }
+
+ return 0;
+}
+/* --------------------------------------------------------------------------
+ handle command ldapaccess */
+int h_access(int argc, unsigned char ** argv)
+{
+ if (argc < 1)
+ {
+ fprintf(stderr, "Error in ldapaccess: See documentation of ldapauth plugin.\n");
+ return 1;
+ }
+ ldap_access=mypluginlink->mystrdup(argv[1]);
+ return 0;
+}
+/* --------------------------------------------------------------------------
+ handle command ldapsbase
+ searching base */
+int h_sbase(int argc, unsigned char ** argv)
+{
+ if (argc < 1)
+ {
+ fprintf(stderr, "Error in ldapsbase: See documentation of ldapauth plugin.\n");
+ return 1;
+ }
+ ldap_sbase=mypluginlink->mystrdup(argv[1]);
+ return 0;
+}
+/* --------------------------------------------------------------------------
+ handle command ldapuserenv */
+int h_userenv(int argc, unsigned char ** argv)
+{
+ if (argc < 1)
+ {
+ fprintf(stderr, "Error in ldapsbase: See documentation of ldapauth plugin.\n");
+ return 1;
+ }
+ ldap_userenv=mypluginlink->mystrdup(argv[1]);
+ return 0;
+}
+/* --------------------------------------------------------------------------
+ handle command ldaptrafgroup */
+int h_trafgroup(int argc, unsigned char ** argv)
+{
+ struct trafcount *newtrafcount;
+ struct bandlim *newbandlim;
+ static struct ace *newace;
+ static struct userlist *newuserlist;
+ struct counter_record rcounter;
+
+ LDAP *ld = NULL;
+ LDAPMessage *res = NULL;
+ LDAPMessage *msg = NULL;
+ BerElement *ber = NULL;
+ int rc = -1;
+ char *tmpbuf,pat_file[]="%s%s.lc",pat_group[]="(%s=%s)";
+ char *getattr,**vals,buf[256];
+ ROTATION rtype;
+ unsigned long traflimit;
+ int bandwidth ;
+
+ FILE *f;
+
+ if (argc < 3)
+ {
+ fprintf(stderr, "Error in ldaptrafgroup: See documentation of ldapauth plugin.\n");
+ return 1;
+ }
+
+ ld = ldap_init( ldap_serv, 389 );
+
+ if ( ld == NULL )
+ {
+ fprintf(stderr,"Error in ldaptrafgroup: ldap_init: No init lib ldap");
+ return 7;
+ }
+
+ rc = ldap_bind_s( ld, ldap_user, ldap_pass, LDAP_AUTH_SIMPLE );
+
+ if ( rc != LDAP_SUCCESS )
+ {
+ fprintf(stderr, "Error in ldaptrafgroup: ldap_bind: Not authorize in ldap\
+ catalog, checked option \'ldapconnect\' ");
+ ldap_unbind_s(ld);
+ return 7;
+ }
+
+ /* type traf limit */
+ if(strcmp(argv[2],"MONTHLY")==0||strcmp(argv[2],"monthly")==0)
+ {rtype=MONTHLY;}
+
+ if(strcmp(argv[2],"DAILY")==0||strcmp(argv[2],"daily")==0)
+ {rtype=DAILY;}
+
+ if(strcmp(argv[2],"WEEKLY")==0||strcmp(argv[2],"weekly")==0)
+ {rtype=WEEKLY;}
+
+ traflimit = atol((char *)argv[3]);
+ bandwidth = atoi((char *)argv[4]);
+
+ /* name ldap group */
+ tmpbuf=mypluginlink->myalloc(strlen(pat_group)+strlen(ldap_group_attr)+strlen(argv[1]));
+ sprintf(tmpbuf,pat_group,ldap_group_attr,argv[1]);
+ rc = ldap_search_s( ld, ldap_sbase, LDAP_SCOPE_SUBTREE,
+ tmpbuf, attrs, 0, &res );
+ mypluginlink->myfree(tmpbuf);
+
+ rc=ldap_count_entries(ld,res);
+
+ /* users found */
+ if (rc > 0)
+ {
+ msg=ldap_first_entry(ld, res);
+ getattr=ldap_first_attribute(ld, msg, &ber);
+
+ while (rc > 0)
+ {
+ vals=ldap_get_values(ld, msg, getattr);
+ if (vals != NULL && vals[0] != NULL )
+ {
+
+ /* -------------bandlim----------
+ create user list */
+ newuserlist = (*mypluginlink->myalloc)(sizeof (struct userlist));
+ if (usercaselow > 0)
+ #ifdef _WIN32
+ { CharLower(vals[0]); }
+ #else
+ { lower(vals[0]); }
+ #endif
+
+ newuserlist->user = (*mypluginlink->mystrdup)(vals[0]);
+ newuserlist->next = NULL;
+ /*create user rule */
+ newace = (*mypluginlink->myalloc)(sizeof (struct ace));
+ memset(newace, 0, sizeof(struct ace));
+ newace->users = newuserlist;
+ newace->action = BANDLIM;
+ /*create user bandlim */
+ newbandlim =(*mypluginlink->myalloc)(sizeof (struct bandlim));
+ memset(newbandlim, 0, sizeof(struct bandlim));
+ newbandlim->rate = bandwidth;
+ newbandlim->ace = newace;
+ newbandlim->next = mypluginlink->conf->bandlimiter;
+ mypluginlink->conf->bandlimiter = newbandlim;
+
+ /* -------------counters----------
+ create user list */
+ newuserlist = (*mypluginlink->myalloc)(sizeof (struct userlist));
+ if (usercaselow > 0)
+ #ifdef _WIN32
+ { CharLower(vals[0]); }
+ #else
+ { lower(vals[0]); }
+ #endif
+ newuserlist->user = (*mypluginlink->mystrdup)(vals[0]);
+ newuserlist->next = NULL;
+ /*create user rule */
+ newace = (*mypluginlink->myalloc)(sizeof (struct ace));
+ memset(newace, 0, sizeof(struct ace));
+ newace->users = newuserlist;
+ newace->action = COUNTIN;
+ /*create user counter */
+ newtrafcount =(*mypluginlink->myalloc)(sizeof (struct trafcount));
+ memset(newtrafcount, 0, sizeof(struct trafcount));
+ newtrafcount->ace = newace;
+ newtrafcount->type=rtype;
+ newtrafcount->traflimgb =(traflimit/(1024*4));
+ newtrafcount->traflim = ((traflimit - (newtrafcount->traflimgb*(1024*4)))*(1024*1024));
+ newtrafcount->comment=(*mypluginlink->mystrdup)("ldapcounters");
+ newtrafcount->number=0;
+ tmpbuf=(*mypluginlink->myalloc)(strlen(pat_file)+strlen(ldap_dircount)+strlen(vals[0]));
+ sprintf(tmpbuf,pat_file,ldap_dircount,vals[0]);
+ f=NULL;
+ f=fopen(tmpbuf,"rb");
+ if(f!=NULL)
+ {
+
+ fseek(f,0,SEEK_SET);
+ fgets(buf, 256, f);
+ sscanf(buf,"%10lu %10lu %lu %lu\n",&rcounter.trafgb, &rcounter.traf,
+ &rcounter.cleared, &rcounter.updated);
+
+
+ newtrafcount->trafgb=rcounter.trafgb;
+ newtrafcount->traf=rcounter.traf;
+ newtrafcount->cleared=rcounter.cleared;
+ newtrafcount->updated=rcounter.updated;
+ fclose(f);
+ }
+ mypluginlink->myfree(tmpbuf);
+
+ newtrafcount->next = mypluginlink->conf->trafcounter;
+ mypluginlink->conf->trafcounter = newtrafcount;
+
+ ldap_value_free(vals);
+ }
+ msg=ldap_next_entry(ld, msg);
+ rc--;
+ }
+
+ }/* end if (rc > 0) */
+
+ ldap_unbind_s(ld);
+
+ return 0;
+}
+/* --------------------------------------------------------------------------
+ handle command ldapattrsgroup */
+int h_attrsgroup(int argc, unsigned char ** argv)
+{
+ if (argc < 1)
+ {
+ fprintf(stderr, "Error in ldapattr: See documentation of ldapauth plugin.\n");
+ return 1;
+ }
+ attrs[0]=mypluginlink->mystrdup(argv[1]);
+ ldap_group_attr=mypluginlink->mystrdup(argv[2]);
+
+ if(argc == 4)
+ { usercaselow=atoi(argv[3]); }
+
+ return 0;
+}
+/* --------------------------------------------------------------------------
+ handle command ldapdircount */
+int h_dircount(int argc, unsigned char ** argv)
+{
+ if (argc < 1)
+ {
+ fprintf(stderr, "Error in ldapdircount: See documentation of ldapauth plugin.\n");
+ return 1;
+ }
+ ldap_dircount=mypluginlink->mystrdup(argv[1]);
+ return 0;
+}
+
+/*------------------------------- MAIN --------------------------------------
+ start plugin init */
+int start(struct pluginlink * pluginlink, int argc, char** argv)
+{
+
+
+ if (already_loaded != 0)
+ {
+ pluginlink->myfree(ldap_access);
+ pluginlink->myfree(ldap_sbase);
+ pluginlink->myfree(ldap_serv);
+ pluginlink->myfree(ldap_user);
+ pluginlink->myfree(ldap_pass);
+ pluginlink->myfree(ldap_userenv);
+ pluginlink->myfree(ldap_dircount);
+ pluginlink->myfree(ldap_group_attr);
+ pluginlink->myfree(attrs[0]);
+ return (0);
+ }
+
+ already_loaded = 1;
+
+ mypluginlink=pluginlink;
+
+ ldap_access=NULL;
+ ldap_sbase=NULL;
+ ldap_serv=NULL;
+ ldap_user=NULL;
+ ldap_pass=NULL;
+ ldap_userenv=NULL;
+ ldap_trafgroup=NULL;
+ ldap_dircount=NULL;
+ ldap_group_attr=NULL;
+
+
+
+ myalwaysauth.authenticate = ldapfunc;
+ myalwaysauth.authorize = pluginlink->checkACL;
+ myalwaysauth.desc = "ldap";
+ myalwaysauth.next = pluginlink->authfuncs->next;
+ pluginlink->authfuncs->next = &myalwaysauth;
+
+ /* add command: ldapconnect ipserv user_serv pass_serv */
+ ldap_serv_auth_handler.minargs = 3;
+ ldap_serv_auth_handler.maxargs = 4;
+ ldap_serv_auth_handler.command = "ldapconnect";
+ ldap_serv_auth_handler.handler = h_ldapconnect;
+ ldap_serv_auth_handler.next = pluginlink->commandhandlers->next;
+ pluginlink->commandhandlers->next = &ldap_serv_auth_handler;
+
+ /* add command: ldapaccess cn=internet,cn=users,dc=domain,dc=ru */
+ ldap_access_handler.minargs = 2;
+ ldap_access_handler.maxargs = 2;
+ ldap_access_handler.command = "ldapaccess";
+ ldap_access_handler.handler = h_access;
+ ldap_access_handler.next = pluginlink->commandhandlers->next;
+ pluginlink->commandhandlers->next = &ldap_access_handler;
+
+ /* add command: ldapsbase cn=users,dc=domain,dc=ru */
+ ldap_sbase_handler.minargs = 2;
+ ldap_sbase_handler.maxargs = 2;
+ ldap_sbase_handler.command = "ldapsbase";
+ ldap_sbase_handler.handler = h_sbase;
+ ldap_sbase_handler.next = pluginlink->commandhandlers->next;
+ pluginlink->commandhandlers->next = &ldap_sbase_handler;
+
+ /* add command: ldapuserenv (cn=users,dc=domain,dc=ru) */
+ ldap_userenv_handler.minargs = 2;
+ ldap_userenv_handler.maxargs = 2;
+ ldap_userenv_handler.command = "ldapuserenv";
+ ldap_userenv_handler.handler = h_userenv;
+ ldap_userenv_handler.next = pluginlink->commandhandlers->next;
+ pluginlink->commandhandlers->next = &ldap_userenv_handler;
+
+ /* add command: ldaptrafgroup cn=traf500,cn=users,dc=domain,dc=ru M 500 333 */
+ ldap_trafgroup_handler.minargs = 5;
+ ldap_trafgroup_handler.maxargs = 5;
+ ldap_trafgroup_handler.command = "ldaptrafgroup";
+ ldap_trafgroup_handler.handler = h_trafgroup;
+ ldap_trafgroup_handler.next = pluginlink->commandhandlers->next;
+ pluginlink->commandhandlers->next = &ldap_trafgroup_handler;
+
+ /* add command: ldapattr cn memberOf usercaselow=1 */
+ ldap_attrsgroup_handler.minargs = 3;
+ ldap_attrsgroup_handler.maxargs = 4;
+ ldap_attrsgroup_handler.command = "ldapattr";
+ ldap_attrsgroup_handler.handler = h_attrsgroup;
+ ldap_attrsgroup_handler.next = pluginlink->commandhandlers->next;
+ pluginlink->commandhandlers->next = &ldap_attrsgroup_handler;
+
+ /* add command: ldapdircount c:\3proxy\ */
+ ldap_dircount_handler.minargs = 2;
+ ldap_dircount_handler.maxargs = 2;
+ ldap_dircount_handler.command = "ldapdircount";
+ ldap_dircount_handler.handler = h_dircount;
+ ldap_dircount_handler.next = pluginlink->commandhandlers->next;
+ pluginlink->commandhandlers->next = &ldap_dircount_handler;
+
+ /*create job shedule for processing reload, save counters to file */
+ memset(&myschedule,0,sizeof(struct schedule));
+ myschedule.type=MINUTELY;
+ myschedule.function=savecouters;
+ myschedule.next = *pluginlink->schedule;
+ *pluginlink->schedule=&myschedule;
+
+ return 0;
+}
+
+
diff --git a/src/plugins/LdapPlugin/ldapauth.txt b/src/plugins/LdapPlugin/ldapauth.txt
new file mode 100644
index 0000000..0c23a6e
--- /dev/null
+++ b/src/plugins/LdapPlugin/ldapauth.txt
@@ -0,0 +1,602 @@
+----------------------------win1251------------------------------
+Ïëàãèí àóòåíòèôèêàöèè â LDAP äëÿ ñåðâåðà 3proxó (ÎÑ windows,unix)
+(c) Lopuchov Kirill lopuchov@mail.ru
+
+ 1. Êðàòêîå îïèñàíèå
+
+* Ïîääåðæèâàåòñÿ òîëüêî àóòåíòèôèêàöèÿ îòêðûòûì òåêñòîì (basic)
+* Ïîääåðæèâàåòñÿ ñîçäàíèå ëèìèòîâ ïî òðàôèêó äëÿ ãðóïï ïîëüçîâàòåëåé
+ (â äåíü,ìåñÿö,íåäåëþ)
+* Ïîääåðæèâàåòñÿ ñîçäàíèå ëèìèòîâ ïî ñêîðîñòè äëÿ ãðóïï ïîëüçîâàòåëåé
+ (ïîêà ëèìèòû òîëüêî íà âõîäÿùèé òðàôèê)
+
+* Îòñóòcòâóåò êåøèðîâàíèå èìåí ïîëüçîâàòåëåé.
+
+  êà÷åñòâå èíòåðôåéñà äîñòóïà ê ldap èñïîëüçóåòñÿ áèáëèîòåêà openldap,
+ïîýòîìó ïëàãèí ìîæåò êîìïèëèðîâàòüñÿ è ðàáîòàòü êàê íà Windows 98/2000/XP
+òàê è íà ðàçëè÷íûõ unix ïîäîáíûõ ñèñòåìàõ íàïðèìåð Linux,FreeBSD.
+Âñå òåñòû ðàáîòîñïîñîáíîñòè ïðîâîäèëèñü íà ñåðâåðå ñ Active Directory â
+åå ðåàëèçàöèè ldap íî â ïðèíöèïå äîëæíî ðàáîòàòü è íà äðóãèõ ldap ñèñòåìàõ.
+
+Äëÿ êîìïèëÿöèè è òåñòèðîâàíèÿ ïîä ÎÑ Windows èñïîëüçîâàëñÿ ïàêåò Dev-C++
+http://www.bloodshed.net/dev/ è ÷àñòü áèáëèîòåê OpenLDAP for Windows
+http://lucas.bergmans.us/hacks/openldap/
+âåðñèÿ openldap-2.2.29-db-4.3.29-openssl-0.9.8a-win32_Setup.exe,
+âåðñèÿ ýòîé æå áèáëèîòåêè èäåò â êîìïëåêòå ê ïëàãèíó.
+
+ïîä unix ïîäîáíîé ÎÑ (Freebsd) èñïîëüçîâàëñÿ ñòàíäàðòíûé gcc.
+è áèáëèîòåêè openldap-client.
+
+!!!! Âíèìàíèå ïðè ðàáîòå ïëàãèíà âîçìîæíà óòå÷êà ïàìÿòè !!!!
+Ó ìåíÿ íà Win 2000 Serv è îêîëà 600 ïîëüçîâàòåëÿõ ïðè êàíàëå 500 êáèò/ñåê .
+ïðîöåññ 3proxy çà ñóòêè âûðîñòàåò äî 40 ìá . Ëå÷èòñÿ ðåñòàðòîì ñåðâèñà.
+Åñëè êòî òî çíàåò õîðîøî Open Ldap api è ìîæåò óêàçàòü íà îøèáêó â ïëàãèíå
+ñ ðàäîñòüþ âûñëóøàþ :) .
+
+
+ 2. Íàñòðîéêà ïëàãèíà.
+
+ 2.1 Äëÿ ïîäêëþ÷åíèÿ ê LDAP ñåðâåðó èñïîëüçóåòñÿ êîììàíäà ldapconnect .
+Ïåðâûé ïàðàìåòð îïðåäåëÿò ip àäðåñ èëè host èìÿ LDAP ñåðâåðà ,
+âòîðîé ïàðàìåòð èìÿ ïîëüçîâàòåëÿ îò èìåíè êîðîãî áóäóò ñîâåðøèòüñÿ
+âñÿ äàëüíåéøàÿ ðàáîòà ñ ldap êàòàëîãîì òàêàÿ êàê ïîèñê ïîëüçîâàòåëåé
+è ïðîâåðêà èõ ïðèíàäëåæíîñòè ê òîé èëè èíîé ãðóïïå, òðåòèé ïàðàìåòð ýòî
+ïàðîëü äëÿ ýòîãî ïîëüçîâàòåëÿ.
+
+Ó òàêîãî ïîëüçîâàòå â êîíòåêñòåò Active Directory ìîãóò îòñóòñâîâàòü
+ïðàâà àäìèíèñòðàòîðà äëÿ íîðìàëüíîé ðàáîòû ïëàãèíà.  êëàññè÷åñêèõ Open Ldap
+ñåðâåðàõ ïîä xNIX òàêèì ïîëüçîâàòåëåì ìîæåò âûñòóïàòü anonymous.
+
+Ïðèìåð:
+ldapconnect 192.160.0.1 cn=ldap,cn=users,dc=domain,dc=ru ldap
+
+ 2.2 Äëÿ îïðåäåëåíèÿ â êàêîì êîíòåêñòå èñêàòü ïîëüçîâàòåëåé è ãðóïïû
+ñëóæèò êîììàíäà ldapsbase
+Ïðèìåð:
+ldapsbase cn=users,dc=domain,dc=ru
+
+ 2.3 Êîììàíäà ldapattr ñëóæèò äëÿ îïðåäåëíèÿ ðàçëè÷íûõ ïàðàìåòðîâ ïëàãèíà.
+a)ïåðâûé ïàðàìåòð îïðåäåëÿåò àòðèáóò "ïîëüçîâàòåëü" â êîíòåêñòå ldap êàòàëîãà
+ â Active Directory ýòî êàê ïðàâèëî "cn" , â äðóãèõ ldap ñåðâåðàõ "uid".
+b)âòîðîé ïàðàìåòð îïåðåäåëÿåò àòðèáóò "ãðóïïà" â êîíòåêñòå ldap êàòàëîãà
+ â Active Directory ýòî êàê ïðàâèëî "memberof" , â äðóãèõ ldap ñåðâåðàõ "ou".
+c)òðåòèé ïàðàìåòð ìîæåò íå îáÿçàòåëüíûé è ìîæåò ñîäåðæàòü 0 èëè 1
+ 1 - îçíà÷àåò, ÷òî ïðè àâòîðèçàöèè ïîëüçîâàòåëÿ èëè ñîçäàíèè äëÿ íåãî
+ îðãðàíè÷åíèÿ ïî òðàôèêó åãî èìÿ áóäåò ïðèâîäèòñÿ ê íèæíåìó ðåãèñòðó
+ (ïðèìå÷àíèå: òîëüêî äëÿ èìåí ïîëüçîâàòåëåé íà àíãëèéñêîì) .
+ Ýòîò ïàðàìåòð ñîçäàí äëÿ èñêëþ÷åíèÿ ñëó÷àåâ êîãäà LDAP êàòàëîã ïðè
+ àâòîðèçàöèè íå îòëè÷àåò èìåí ïîëüçîâàòåëåé â ðåãèñòðàõ.
+
+Ïðèìåð:
+ldapattr cn memberof 1
+
+ 2.4 Êîììàíäà ldapaccess ñëóæèò äëÿ îïðåäåëåíèÿ "ïðèçíàêà" äîñòóïíîñòè
+ïîëüçîâàòåëþ âîîáùå ïðîéòè àâòîðèçàöèþ íà proxy ñåðâåðå. Â êîíòåêñòå
+ldap êàòàëîãà ýòî ÇÍÀ×ÅÍÈÅ àòðèáóòà "ãðóïïû" îïèñàííîé â êîììàíäå ldapattr.
+
+Ïðèìåð:
+ldapaccess CN=internet,CN=Users,DC=domain,DC=ru
+
+Íàïðèìåð: äëÿ Active Directory ýòî áóäåò ïîëüçîâàòåëü âõîäÿùèé â ãðóïïó
+internet. Òîåñòü ïðè ïðîâåðêå ìîæíî ëè ïîëüçîâàòåëþ ðàáîòàòü ñ proxy
+ôîðìèðóåòñÿ ôèëüòð îí äîëæåí ïîïàñòü â ñëåäóþùèé ôèëüòð:
+(&(cn=èìÿïîëüçîâàòåëÿ)(memberof=CN=internet,CN=Users,DC=domain,DC=ru))
+
+ 2.5 Êîììàíäà ldapuserenv ñëóæèò äëÿ ôîðìèðîâàíèÿ ñòðîêè èìåíè ïîëüçîâàòåëÿ
+êîòîðûé ïûòàåòñÿ ïðîéòè àâòîðèçàöèþ â ldap. Òîåñòü ôàêòè÷åñêè ýòî base DN
+äëÿ ïîëüçîâàòåëÿ.
+
+Ïðèìåð:
+ldapuserenv cn=users,dc=domain,dc=ru
+
+
+ 2.7 Êîììàíäà ldaptrafgroup ñëóæèò äëÿ ñîçäàíèÿ ëèìèòîâ
+ÎÍÈ ÎÁßÇÀÒÅËÜÍÎ ÄÎËÆÍÀ ÈÄÒÈ ÏÎÑËÅ ÂÑÅÕ îñòàëüíûõ êîììàíä ïëàãèíà.
+a) ïåðâûé ïàðàìåòð ýòî íàçâàíèå ãðóïïû (çíà÷åíèå ldap àòðèáóòà ) â êîòîðóþ
+ âõîäèò ïîëüçîâàòåëü.
+b) âòîðîé ïàðàìåòð íà êàêîé ïåðèîä íàêëàäûâàåòñÿ îãðàíè÷åíèå ïî îáúåìó
+òðàôèêà . Ìîæåò èìåòü îäíî èç ñëåäóþùèõ çíà÷åíèé "MONTHLY","DAILY","WEEKLY".
+ñ) òðåòèé ïàðàìåòð ýòî ðàçìåð ëèìèòà â ìåãàáàéòàõ .
+â) ÷åòâåðòûé ïàðàìåòð ýòî îãðàíè÷åíèå ïî ñêîðîñòè â áèò/ñåê.
+
+Ëèìèòû íàêëàäûâàþòñÿ ïåðñîíàëüíî íà ïîëüçîâàòåëÿ âõîäÿùåãî â ãðóïïó,
+à íå ÍÀ ãðóïïó â öåëîì.
+Â äàííîì ïðèìåðå â Active Directory ñîçäàíà ãðóïïà ñ èìåíåì traf200m
+êóäà êëþ÷åííû âñå ïîëüçîâàòåëè êòîðûì íåîáõîäèì äàííûé ëèìèò 200 Ìáàéò,
+â ìåñÿö ñ âõîäÿùåé ïîëîñîé 60000 áèò/ñåê ÍÀ ÊÀÆÄÎÃÎ ÏÎËÜÇÎÂÀÒÅËß.
+
+Ïðèìåð:
+ldaptrafgroup CN=traf200m,CN=Users,DC=domain,DC=ru MONTHLY 200 60000
+
+
+Ñ÷åò÷èêè õðàíÿòüñÿ äëÿ êàæäîãî ïîëüçîâàòåëÿ â îòäåëüíîì ôàéëå,èìÿ êîòîðûõ
+ôîðìèðóåòñÿ, êàê èìÿ ïîëüçîâàòåëÿ è ðàñøèðåíèå lc. Ñîõðàíåíèå ñ÷åò÷èêîâ
+ïðîèñõîäèò ðàç â ìèíóòó.
+
+ 2.6 Êîììàíäà ldapdircount ñëóæèò äëÿ óêàçàíèÿ äèðåêòîðèè êóäà áóäóò
+ñîõðàíÿòüñÿ ôàéëû ñ ïîëüçîâàòåëüñêèìè ñ÷åò÷èêàìè. Ïóòü ê äèðåêòîðèè
+íàäî çàêàí÷èâàòü ñëýøåì, ïðÿìîé èëè îáðàòíûé â çàâèñèìîñòè îò ÎÑ.
+
+Ïðèìåð:
+ldapdircount c:\3proxy\counter\
+ldapdircount /usr/3proxy/counter/
+
+
+Íàñòðîéêà 3proxy
+---------------------
+# ÂÍÈÌÀÍÈÅ ! Íå çàáûâàéòå ÷òî daemon èëè service äîëæåí èäòè ïåðâîé ñòðîêîé
+# êîíôèãóðàöèîííîãî ôàéëà,òî åñòü äî çàãðóçêè ëþáûõ ïëàãèíîâ
+daemon
+
+# äëÿ win32
+plugin "ñ:\3proxy\ldapauth.dll" start
+# äëÿ unix
+plugin "/3proxy/libldapauth.so" start
+
+ldapconnect 192.160.0.1 cn=ldap,cn=users,dc=domain,dc=ru ldap
+ldapsbase cn=users,dc=domain,dc=ru
+ldapaccess CN=internet,CN=Users,DC=domain,DC=ru
+ldapuserenv cn=users,dc=domain,dc=ru
+ldapdircount /3proxy/counter/
+ldapattr cn memberof 1
+
+ldaptrafgroup CN=traf200m,CN=Users,DC=domain,DC=ru MONTHLY 200 60000
+ldaptrafgroup CN=traf60d,CN=Users,DC=domain,DC=ru DAILY 60 80000
+ldaptrafgroup CN=traf100w,CN=Users,DC=domain,DC=ru WEEKLY 100 80000
+
+auth ldap
+allow * * * *
+proxy -p3128 -n
+--------------------
+
+Òàê æå âîçìîæíà ñëåäóþùàÿ êîíôèãóðàöèÿ áåç ó÷åòà òðàôèêà è îãðàíè÷åíèé
+ïî ñêîðîñòè.
+---------------------
+service
+
+plugin "ñ:\3proxy\ldapauth.dll" start
+ldapconnect 192.160.0.1 cn=ldap,cn=users,dc=domain,dc=ru ldap
+ldapsbase cn=users,dc=domain,dc=ru
+ldapaccess CN=internet,CN=Users,DC=domain,DC=ru
+ldapuserenv cn=users,dc=domain,dc=ru
+ldapattr cn memberof 1
+auth ldap
+allow * * * *
+proxy -p3128 -n
+---------------------
+
+ Ñîçäàíèå ñïèñêîâ äîñòóïà
+
+×òîáû ìîæíî áûëî ñîçäàâàòü ACL íà îñíîâå ñïèñêîâ ïîëüçîâàòåëåé âõîäÿùèõ
+â ðàçëè÷íûå ãðóïïû êàòàëîãà ldap ñóùåñòâóåò óòèëèòà getldapuser
+Äàííîé óòèëèòå ìîãóò ïåðåäàíû 5 ïàðàìåòðîâ :
+
+getldapuser < ldapserver basedn user_attribute filter user password >
+
+ldapserver - èìÿ èëè ip àäðåñ LDAP ñåðâåðà
+basedn - êîíòåêñò ïîäêëþ÷åíèÿ ê LDAP (íàïðèìåð: cn=users,dc=domain,dc=com)
+user_attribute - íàçâàíèå ïîëüçîâàòåëüñêîãî àòðèáóòà (íàïðèìåð:
+ â Active Directory ýòî cn â äðóãèõ LDAP êàòàëîãàõ îí ìîæåò
+ áûò ou)
+filter - ôèëüòð ïî êàêîìó ïîëüçîâàòåëè áóäóò îòáèðàòüñÿ èç LDAP (íàïðèìåð:
+ äëÿ Active Directory âûâåñòè âñåõ ïîëüçîâàòåëåé âõîäÿùèõ â ãðóïïó
+ internet áóäåò ñëåäóþùàÿ ñòðîêà
+ (memberOf=cn=internet,cn=Users,dc=domain,dc=com) )
+
+user - èìÿ ïîëüçîâàòåëÿ äëÿ ïîäêëþ÷åíèÿ ê ñåðâåðó
+password - ïàðîëü (åñëè åñòü)
+
+ Ïðèìåð èñïîëüçîâàíèÿ getldapuser â 3proxy.
+
+Íåîáõîäèìî äàòü äîñòóï ê icq òîëüêî îïðåäåëåííûì ïîëüçîâàòëÿì . Cîçäàåì
+â AD ãðóïïó icquser çàíîñèì òóäà íóæíûõ ïîëüçîâàòåëåé.
+Ñîçäàåì bat ôàéë ñëåäóþùåãî ñîäåðæàíèÿ êîòîðûé áóäåò ôîðìèðîâàòü ôàéë
+c:\3proxy\icquser ñî ñïèñêîì ïîëüçîâàòåëåé:
+-------------------------------------------
+getldapuser 192.168.0.1 dc=domain,dc=com cn (memberOf=cn=icquser,cn=Users,dc=domain,dc=com)
+cn=admin,cn=users,dc=domain,dc=com password > c:\3proxy\icquser
+-------------------------------------------
+Âñòàâëÿåì äàííûé bat ôàéë íà ïåðèîäè÷åñêîå âûïîëíåíèå.
+
+Äàëåå ïðîïèñûâàåì 3proxy.cfg ñëåä ñòðîêè
+-------------------------------------------------
+monitor "c:\3proxy\icquser"
+
+auth ldap
+allow $"c:\3proxy\icquser" * *icq.com
+deny * * *icq.com
+allow *
+proxy -n
+-------------------------------------------------
+
+
+ Êîìïèëÿöèÿ ïëàãèíà íà ðàçëè÷íûõ ÎÑ
+
+ 1) Win32 (windows 98/NT/XP/2000/2003)
+Äëÿ ñáîðêè è ðàáîòû ïëàãèíà â àðõèâå ñ íèì óæå èäóò â êàòàëîãå ldapwindev
+ñëåäóþùèå áèáëèîòåêè (âåðñèÿ 2.2.29).
+
+ libcrypto.dll
+ liblber.dll
+ libldap.dll
+ libssl.dll
+è çàãîëîâî÷íûå ôàéëû
+ lber.h
+ lber_types.h
+ ldap.h
+ ldap_cdefs.h
+ ldap_features.h
+ ldap_schema.h
+ ldap_utf8.h
+
+Äàëåå âàì íåîáõîäèìî ñêà÷àòü è óñòàíîâèòü êîìïèëÿòîð Dev-Cpp ñ ñàéòà
+http://www.bloodshed.net/dev/
+
+Äàëåå ñêà÷àòü èñõîäíûå òåêñòû 3proxy îòñþäà:
+http://3proxy.ru/current/3proxy-0.6-devel.tgz è ðàñïàêîâàòü.
+Â êàòàëîã \src\plugins ñêîïèðîâàòü êàòàëîã ñ èñõîäíûìè òåêñòàìè
+ïëàãèíà. Ñêîððåêòèðîâàòü com-win32.bat ôàéë ñ ó÷åòîì òîãî ãäå ó Âàñ óñòàíîâëåí
+êîìïèëÿòîð gcc , íàïðèìåð:
+-------------com-win32.bat----------------
+c:\Dev-Cpp\bin\gcc -shared -o ldapauth.dll ldapauth.c -DWIN32 -I"./ldapwindev" -L"./ldapwindev" -lldap
+------------------------------------------
+È çàïóñòèòü íà âûïîëíåíèå com-win32.bat ïîñëå ýòîãî ó Âàñ äîëæíà ïîÿâèòñÿ
+áèáëèîòåêà ldapauth.dll è èñïîëíÿåìûé ôàéë getldapuser.exe .
+Äëÿ äàëüíåéøåé ðàáîòû ïîëó÷èâøèåñÿ ôàéëû è âñå áèáëèîòåêè dll èç êàòàëîãà
+ldapwindev ñêîïèðîâàòü â êàòàëîã ñ 3proxy.
+
+ 2) xNIX (linux,freebsd è ò.ï. )
+
+Ïåðåä êîìïèëÿöèåé íóæíî ïðîâåðèòü ÷òîáû â ñèñòåìå áûë ócòàíîâëåí
+OpenLDAP client. Â ñèñòåìå äîëæíû ïðèñóòâîâàòü ñëåäóþùèå
+áèáëèîòåêè:
+
+ liblber.a
+ libldap.a
+ liblber.so
+ libldap.so
+
+è çàãîëîâî÷íûå ôàéëû
+ lber.h
+ lber_types.h
+ ldap.h
+ ldap_cdefs.h
+ ldap_features.h
+ ldap_schema.h
+ ldap_utf8.h
+
+Óñòàíîâêà êëèåíòà ïîä ðàçíûìè ÎÑ ýòî äåëàåòñÿ ëèáî èíñòàëÿöèåé ãîòîâîãî ïàêåòà
+ëèáî ñàìîñòîÿòåëüíàÿ ñáîðêà äàííîãî êëèåíòà èç èñõîäíûõ òåêñòîâ êîòîðûå
+ðàñïîëîæåííû òóò ftp://ftp.openldap.org/pub/OpenLDAP/openldap-release/
+
+×òîáû ñîáðàòü ïàêåò, íåîáõîäèìî ñêà÷àòü àðõèâ
+wget ftp://ftp.openldap.org/pub/OpenLDAP/openldap-release/openldap-2.3.9.tgz
+
+ðàñïàêîâûâàåì àðõèâ
+tar xvzf openldap-2.3.9.tgz
+
+è çàïóñêàåì ñêðèïò àâòîêîíôèãóðàöèè ñî ñëåäóþùèìè
+ïàðàìåòðàìè:
+./configure --enable-backends=no --enable-slapd=no
+
+äàëåå
+
+make
+make install
+
+Äàëåå ñêà÷àòü èñõîäíûå òåêñòû 3proxy îòñþäà:
+http://3proxy.ru/current/3proxy-0.6-devel.tgz è ðàñïàêîâàòü.
+Â êàòàëîã \src\plugins ñêîïèðîâàòü êàòàëîã ñ èñõîäíûìè òåêñòàìè
+ïëàãèíà. Èçìåíèòü ïóòè â ôàéëå com-unix.sh ïàðàìåòðàõ êîìïèëÿöèè -I è -L
+ê çàãîëîâî÷íûì è áèáëèîòå÷íûì ôàéëàì ldap äëÿ Âàøåé ñèñòåìû.
+
+Âûïîëíèòü ñëåäóþùèå êîììàíäû:
+chmod +x com-unix.sh
+com-unix.sh
+
+È çàïóñòèòü íà âûïîëíåíèå com-unix.sh ïîñëå ýòîãî ó Âàñ äîëæíà ïîÿâèòñÿ
+áèáëèîòåêà ldapauth.so è èñïîëíÿåìûé ôàéë getldapuser.
+
+Ïîëó÷èâøèåñÿ ôàéëû ñêîïèðîâàòü â êàòàëîã ñ 3proxy.
+----------------------------win1251------------------------------
+----------------------------KOI8-R------------------------------
+ðÌÁÇÉÎ ÁÕÔÅÎÔÉÆÉËÁÃÉÉ × LDAP ÄÌÑ ÓÅÒ×ÅÒÁ 3proxÕ (ïó windows,unix)
+(c) Lopuchov Kirill lopuchov@mail.ru
+
+ 1. ëÒÁÔËÏÅ ÏÐÉÓÁÎÉÅ
+
+* ðÏÄÄÅÒÖÉ×ÁÅÔÓÑ ÔÏÌØËÏ ÁÕÔÅÎÔÉÆÉËÁÃÉÑ ÏÔËÒÙÔÙÍ ÔÅËÓÔÏÍ (basic)
+* ðÏÄÄÅÒÖÉ×ÁÅÔÓÑ ÓÏÚÄÁÎÉÅ ÌÉÍÉÔÏ× ÐÏ ÔÒÁÆÉËÕ ÄÌÑ ÇÒÕÐÐ ÐÏÌØÚÏ×ÁÔÅÌÅÊ
+ (× ÄÅÎØ,ÍÅÓÑÃ,ÎÅÄÅÌÀ)
+* ðÏÄÄÅÒÖÉ×ÁÅÔÓÑ ÓÏÚÄÁÎÉÅ ÌÉÍÉÔÏ× ÐÏ ÓËÏÒÏÓÔÉ ÄÌÑ ÇÒÕÐÐ ÐÏÌØÚÏ×ÁÔÅÌÅÊ
+ (ÐÏËÁ ÌÉÍÉÔÙ ÔÏÌØËÏ ÎÁ ×ÈÏÄÑÝÉÊ ÔÒÁÆÉË)
+
+* ïÔÓÕÔcÔ×ÕÅÔ ËÅÛÉÒÏ×ÁÎÉÅ ÉÍÅÎ ÐÏÌØÚÏ×ÁÔÅÌÅÊ.
+
+ ÷ ËÁÞÅÓÔ×Å ÉÎÔÅÒÆÅÊÓÁ ÄÏÓÔÕÐÁ Ë ldap ÉÓÐÏÌØÚÕÅÔÓÑ ÂÉÂÌÉÏÔÅËÁ openldap,
+ÐÏÜÔÏÍÕ ÐÌÁÇÉÎ ÍÏÖÅÔ ËÏÍÐÉÌÉÒÏ×ÁÔØÓÑ É ÒÁÂÏÔÁÔØ ËÁË ÎÁ Windows 98/2000/XP
+ÔÁË É ÎÁ ÒÁÚÌÉÞÎÙÈ unix ÐÏÄÏÂÎÙÈ ÓÉÓÔÅÍÁÈ ÎÁÐÒÉÍÅÒ Linux,FreeBSD.
+÷ÓÅ ÔÅÓÔÙ ÒÁÂÏÔÏÓÐÏÓÏÂÎÏÓÔÉ ÐÒÏ×ÏÄÉÌÉÓØ ÎÁ ÓÅÒ×ÅÒÅ Ó Active Directory ×
+ÅÅ ÒÅÁÌÉÚÁÃÉÉ ldap ÎÏ × ÐÒÉÎÃÉÐÅ ÄÏÌÖÎÏ ÒÁÂÏÔÁÔØ É ÎÁ ÄÒÕÇÉÈ ldap ÓÉÓÔÅÍÁÈ.
+
+äÌÑ ËÏÍÐÉÌÑÃÉÉ É ÔÅÓÔÉÒÏ×ÁÎÉÑ ÐÏÄ ïó Windows ÉÓÐÏÌØÚÏ×ÁÌÓÑ ÐÁËÅÔ Dev-C++
+http://www.bloodshed.net/dev/ É ÞÁÓÔØ ÂÉÂÌÉÏÔÅË OpenLDAP for Windows
+http://lucas.bergmans.us/hacks/openldap/
+×ÅÒÓÉÑ openldap-2.2.29-db-4.3.29-openssl-0.9.8a-win32_Setup.exe,
+×ÅÒÓÉÑ ÜÔÏÊ ÖÅ ÂÉÂÌÉÏÔÅËÉ ÉÄÅÔ × ËÏÍÐÌÅËÔÅ Ë ÐÌÁÇÉÎÕ.
+
+ÐÏÄ unix ÐÏÄÏÂÎÏÊ ïó (Freebsd) ÉÓÐÏÌØÚÏ×ÁÌÓÑ ÓÔÁÎÄÁÒÔÎÙÊ gcc.
+É ÂÉÂÌÉÏÔÅËÉ openldap-client.
+
+!!!! ÷ÎÉÍÁÎÉÅ ÐÒÉ ÒÁÂÏÔÅ ÐÌÁÇÉÎÁ ×ÏÚÍÏÖÎÁ ÕÔÅÞËÁ ÐÁÍÑÔÉ !!!!
+õ ÍÅÎÑ ÎÁ Win 2000 Serv É ÏËÏÌÁ 600 ÐÏÌØÚÏ×ÁÔÅÌÑÈ ÐÒÉ ËÁÎÁÌÅ 500 ËÂÉÔ/ÓÅË .
+ÐÒÏÃÅÓÓ 3proxy ÚÁ ÓÕÔËÉ ×ÙÒÏÓÔÁÅÔ ÄÏ 40 Í . ìÅÞÉÔÓÑ ÒÅÓÔÁÒÔÏÍ ÓÅÒ×ÉÓÁ.
+åÓÌÉ ËÔÏ ÔÏ ÚÎÁÅÔ ÈÏÒÏÛÏ Open Ldap api É ÍÏÖÅÔ ÕËÁÚÁÔØ ÎÁ ÏÛÉÂËÕ × ÐÌÁÇÉÎÅ
+Ó ÒÁÄÏÓÔØÀ ×ÙÓÌÕÛÁÀ :) .
+
+
+ 2. îÁÓÔÒÏÊËÁ ÐÌÁÇÉÎÁ.
+
+ 2.1 äÌÑ ÐÏÄËÌÀÞÅÎÉÑ Ë LDAP ÓÅÒ×ÅÒÕ ÉÓÐÏÌØÚÕÅÔÓÑ ËÏÍÍÁÎÄÁ ldapconnect .
+ðÅÒ×ÙÊ ÐÁÒÁÍÅÔÒ ÏÐÒÅÄÅÌÑÔ ip ÁÄÒÅÓ ÉÌÉ host ÉÍÑ LDAP ÓÅÒ×ÅÒÁ ,
+×ÔÏÒÏÊ ÐÁÒÁÍÅÔÒ ÉÍÑ ÐÏÌØÚÏ×ÁÔÅÌÑ ÏÔ ÉÍÅÎÉ ËÏÒÏÇÏ ÂÕÄÕÔ ÓÏ×ÅÒÛÉÔØÓÑ
+×ÓÑ ÄÁÌØÎÅÊÛÁÑ ÒÁÂÏÔÁ Ó ldap ËÁÔÁÌÏÇÏÍ ÔÁËÁÑ ËÁË ÐÏÉÓË ÐÏÌØÚÏ×ÁÔÅÌÅÊ
+É ÐÒÏ×ÅÒËÁ ÉÈ ÐÒÉÎÁÄÌÅÖÎÏÓÔÉ Ë ÔÏÊ ÉÌÉ ÉÎÏÊ ÇÒÕÐÐÅ, ÔÒÅÔÉÊ ÐÁÒÁÍÅÔÒ ÜÔÏ
+ÐÁÒÏÌØ ÄÌÑ ÜÔÏÇÏ ÐÏÌØÚÏ×ÁÔÅÌÑ.
+
+õ ÔÁËÏÇÏ ÐÏÌØÚÏ×ÁÔÅ × ËÏÎÔÅËÓÔÅÔ Active Directory ÍÏÇÕÔ ÏÔÓÕÔÓ×Ï×ÁÔØ
+ÐÒÁ×Á ÁÄÍÉÎÉÓÔÒÁÔÏÒÁ ÄÌÑ ÎÏÒÍÁÌØÎÏÊ ÒÁÂÏÔÙ ÐÌÁÇÉÎÁ. ÷ ËÌÁÓÓÉÞÅÓËÉÈ Open Ldap
+ÓÅÒ×ÅÒÁÈ ÐÏÄ xNIX ÔÁËÉÍ ÐÏÌØÚÏ×ÁÔÅÌÅÍ ÍÏÖÅÔ ×ÙÓÔÕÐÁÔØ anonymous.
+
+ðÒÉÍÅÒ:
+ldapconnect 192.160.0.1 cn=ldap,cn=users,dc=domain,dc=ru ldap
+
+ 2.2 äÌÑ ÏÐÒÅÄÅÌÅÎÉÑ × ËÁËÏÍ ËÏÎÔÅËÓÔÅ ÉÓËÁÔØ ÐÏÌØÚÏ×ÁÔÅÌÅÊ É ÇÒÕÐÐÙ
+ÓÌÕÖÉÔ ËÏÍÍÁÎÄÁ ldapsbase
+ðÒÉÍÅÒ:
+ldapsbase cn=users,dc=domain,dc=ru
+
+ 2.3 ëÏÍÍÁÎÄÁ ldapattr ÓÌÕÖÉÔ ÄÌÑ ÏÐÒÅÄÅÌÎÉÑ ÒÁÚÌÉÞÎÙÈ ÐÁÒÁÍÅÔÒÏ× ÐÌÁÇÉÎÁ.
+a)ÐÅÒ×ÙÊ ÐÁÒÁÍÅÔÒ ÏÐÒÅÄÅÌÑÅÔ ÁÔÒÉÂÕÔ "ÐÏÌØÚÏ×ÁÔÅÌØ" × ËÏÎÔÅËÓÔÅ ldap ËÁÔÁÌÏÇÁ
+ × Active Directory ÜÔÏ ËÁË ÐÒÁ×ÉÌÏ "cn" , × ÄÒÕÇÉÈ ldap ÓÅÒ×ÅÒÁÈ "uid".
+b)×ÔÏÒÏÊ ÐÁÒÁÍÅÔÒ ÏÐÅÒÅÄÅÌÑÅÔ ÁÔÒÉÂÕÔ "ÇÒÕÐÐÁ" × ËÏÎÔÅËÓÔÅ ldap ËÁÔÁÌÏÇÁ
+ × Active Directory ÜÔÏ ËÁË ÐÒÁ×ÉÌÏ "memberof" , × ÄÒÕÇÉÈ ldap ÓÅÒ×ÅÒÁÈ "ou".
+c)ÔÒÅÔÉÊ ÐÁÒÁÍÅÔÒ ÍÏÖÅÔ ÎÅ ÏÂÑÚÁÔÅÌØÎÙÊ É ÍÏÖÅÔ ÓÏÄÅÒÖÁÔØ 0 ÉÌÉ 1
+ 1 - ÏÚÎÁÞÁÅÔ, ÞÔÏ ÐÒÉ Á×ÔÏÒÉÚÁÃÉÉ ÐÏÌØÚÏ×ÁÔÅÌÑ ÉÌÉ ÓÏÚÄÁÎÉÉ ÄÌÑ ÎÅÇÏ
+ ÏÒÇÒÁÎÉÞÅÎÉÑ ÐÏ ÔÒÁÆÉËÕ ÅÇÏ ÉÍÑ ÂÕÄÅÔ ÐÒÉ×ÏÄÉÔÓÑ Ë ÎÉÖÎÅÍÕ ÒÅÇÉÓÔÒÕ
+ (ÐÒÉÍÅÞÁÎÉÅ: ÔÏÌØËÏ ÄÌÑ ÉÍÅÎ ÐÏÌØÚÏ×ÁÔÅÌÅÊ ÎÁ ÁÎÇÌÉÊÓËÏÍ) .
+ üÔÏÔ ÐÁÒÁÍÅÔÒ ÓÏÚÄÁÎ ÄÌÑ ÉÓËÌÀÞÅÎÉÑ ÓÌÕÞÁÅ× ËÏÇÄÁ LDAP ËÁÔÁÌÏÇ ÐÒÉ
+ Á×ÔÏÒÉÚÁÃÉÉ ÎÅ ÏÔÌÉÞÁÅÔ ÉÍÅÎ ÐÏÌØÚÏ×ÁÔÅÌÅÊ × ÒÅÇÉÓÔÒÁÈ.
+
+ðÒÉÍÅÒ:
+ldapattr cn memberof 1
+
+ 2.4 ëÏÍÍÁÎÄÁ ldapaccess ÓÌÕÖÉÔ ÄÌÑ ÏÐÒÅÄÅÌÅÎÉÑ "ÐÒÉÚÎÁËÁ" ÄÏÓÔÕÐÎÏÓÔÉ
+ÐÏÌØÚÏ×ÁÔÅÌÀ ×ÏÏÂÝÅ ÐÒÏÊÔÉ Á×ÔÏÒÉÚÁÃÉÀ ÎÁ proxy ÓÅÒ×ÅÒÅ. ÷ ËÏÎÔÅËÓÔÅ
+ldap ËÁÔÁÌÏÇÁ ÜÔÏ úîáþåîéå ÁÔÒÉÂÕÔÁ "ÇÒÕÐÐÙ" ÏÐÉÓÁÎÎÏÊ × ËÏÍÍÁÎÄÅ ldapattr.
+
+ðÒÉÍÅÒ:
+ldapaccess CN=internet,CN=Users,DC=domain,DC=ru
+
+îÁÐÒÉÍÅÒ: ÄÌÑ Active Directory ÜÔÏ ÂÕÄÅÔ ÐÏÌØÚÏ×ÁÔÅÌØ ×ÈÏÄÑÝÉÊ × ÇÒÕÐÐÕ
+internet. ôÏÅÓÔØ ÐÒÉ ÐÒÏ×ÅÒËÅ ÍÏÖÎÏ ÌÉ ÐÏÌØÚÏ×ÁÔÅÌÀ ÒÁÂÏÔÁÔØ Ó proxy
+ÆÏÒÍÉÒÕÅÔÓÑ ÆÉÌØÔÒ ÏÎ ÄÏÌÖÅÎ ÐÏÐÁÓÔØ × ÓÌÅÄÕÀÝÉÊ ÆÉÌØÔÒ:
+(&(cn=ÉÍÑÐÏÌØÚÏ×ÁÔÅÌÑ)(memberof=CN=internet,CN=Users,DC=domain,DC=ru))
+
+ 2.5 ëÏÍÍÁÎÄÁ ldapuserenv ÓÌÕÖÉÔ ÄÌÑ ÆÏÒÍÉÒÏ×ÁÎÉÑ ÓÔÒÏËÉ ÉÍÅÎÉ ÐÏÌØÚÏ×ÁÔÅÌÑ
+ËÏÔÏÒÙÊ ÐÙÔÁÅÔÓÑ ÐÒÏÊÔÉ Á×ÔÏÒÉÚÁÃÉÀ × ldap. ôÏÅÓÔØ ÆÁËÔÉÞÅÓËÉ ÜÔÏ base DN
+ÄÌÑ ÐÏÌØÚÏ×ÁÔÅÌÑ.
+
+ðÒÉÍÅÒ:
+ldapuserenv cn=users,dc=domain,dc=ru
+
+
+ 2.7 ëÏÍÍÁÎÄÁ ldaptrafgroup ÓÌÕÖÉÔ ÄÌÑ ÓÏÚÄÁÎÉÑ ÌÉÍÉÔÏ×
+ïîé ïâñúáôåìøîï äïìöîá éäôé ðïóìå ÷óåè ÏÓÔÁÌØÎÙÈ ËÏÍÍÁÎÄ ÐÌÁÇÉÎÁ.
+a) ÐÅÒ×ÙÊ ÐÁÒÁÍÅÔÒ ÜÔÏ ÎÁÚ×ÁÎÉÅ ÇÒÕÐÐÙ (ÚÎÁÞÅÎÉÅ ldap ÁÔÒÉÂÕÔÁ ) × ËÏÔÏÒÕÀ
+ ×ÈÏÄÉÔ ÐÏÌØÚÏ×ÁÔÅÌØ.
+b) ×ÔÏÒÏÊ ÐÁÒÁÍÅÔÒ ÎÁ ËÁËÏÊ ÐÅÒÉÏÄ ÎÁËÌÁÄÙ×ÁÅÔÓÑ ÏÇÒÁÎÉÞÅÎÉÅ ÐÏ ÏÂßÅÍÕ
+ÔÒÁÆÉËÁ . íÏÖÅÔ ÉÍÅÔØ ÏÄÎÏ ÉÚ ÓÌÅÄÕÀÝÉÈ ÚÎÁÞÅÎÉÊ "MONTHLY","DAILY","WEEKLY".
+Ó) ÔÒÅÔÉÊ ÐÁÒÁÍÅÔÒ ÜÔÏ ÒÁÚÍÅÒ ÌÉÍÉÔÁ × ÍÅÇÁÂÁÊÔÁÈ .
+×) ÞÅÔ×ÅÒÔÙÊ ÐÁÒÁÍÅÔÒ ÜÔÏ ÏÇÒÁÎÉÞÅÎÉÅ ÐÏ ÓËÏÒÏÓÔÉ × ÂÉÔ/ÓÅË.
+
+ìÉÍÉÔÙ ÎÁËÌÁÄÙ×ÁÀÔÓÑ ÐÅÒÓÏÎÁÌØÎÏ ÎÁ ÐÏÌØÚÏ×ÁÔÅÌÑ ×ÈÏÄÑÝÅÇÏ × ÇÒÕÐÐÕ,
+Á ÎÅ îá ÇÒÕÐÐÕ × ÃÅÌÏÍ.
+÷ ÄÁÎÎÏÍ ÐÒÉÍÅÒÅ × Active Directory ÓÏÚÄÁÎÁ ÇÒÕÐÐÁ Ó ÉÍÅÎÅÍ traf200m
+ËÕÄÁ ËÌÀÞÅÎÎÙ ×ÓÅ ÐÏÌØÚÏ×ÁÔÅÌÉ ËÔÏÒÙÍ ÎÅÏÂÈÏÄÉÍ ÄÁÎÎÙÊ ÌÉÍÉÔ 200 íÂÁÊÔ,
+× ÍÅÓÑÃ Ó ×ÈÏÄÑÝÅÊ ÐÏÌÏÓÏÊ 60000 ÂÉÔ/ÓÅË îá ëáöäïçï ðïìøúï÷áôåìñ.
+
+ðÒÉÍÅÒ:
+ldaptrafgroup CN=traf200m,CN=Users,DC=domain,DC=ru MONTHLY 200 60000
+
+
+óÞÅÔÞÉËÉ ÈÒÁÎÑÔØÓÑ ÄÌÑ ËÁÖÄÏÇÏ ÐÏÌØÚÏ×ÁÔÅÌÑ × ÏÔÄÅÌØÎÏÍ ÆÁÊÌÅ,ÉÍÑ ËÏÔÏÒÙÈ
+ÆÏÒÍÉÒÕÅÔÓÑ, ËÁË ÉÍÑ ÐÏÌØÚÏ×ÁÔÅÌÑ É ÒÁÓÛÉÒÅÎÉÅ lc. óÏÈÒÁÎÅÎÉÅ ÓÞÅÔÞÉËÏ×
+ÐÒÏÉÓÈÏÄÉÔ ÒÁÚ × ÍÉÎÕÔÕ.
+
+ 2.6 ëÏÍÍÁÎÄÁ ldapdircount ÓÌÕÖÉÔ ÄÌÑ ÕËÁÚÁÎÉÑ ÄÉÒÅËÔÏÒÉÉ ËÕÄÁ ÂÕÄÕÔ
+ÓÏÈÒÁÎÑÔØÓÑ ÆÁÊÌÙ Ó ÐÏÌØÚÏ×ÁÔÅÌØÓËÉÍÉ ÓÞÅÔÞÉËÁÍÉ. ðÕÔØ Ë ÄÉÒÅËÔÏÒÉÉ
+ÎÁÄÏ ÚÁËÁÎÞÉ×ÁÔØ ÓÌÜÛÅÍ, ÐÒÑÍÏÊ ÉÌÉ ÏÂÒÁÔÎÙÊ × ÚÁ×ÉÓÉÍÏÓÔÉ ÏÔ ïó.
+
+ðÒÉÍÅÒ:
+ldapdircount c:\3proxy\counter\
+ldapdircount /usr/3proxy/counter/
+
+
+îÁÓÔÒÏÊËÁ 3proxy
+---------------------
+# ÷îéíáîéå ! îÅ ÚÁÂÙ×ÁÊÔÅ ÞÔÏ daemon ÉÌÉ service ÄÏÌÖÅÎ ÉÄÔÉ ÐÅÒ×ÏÊ ÓÔÒÏËÏÊ
+# ËÏÎÆÉÇÕÒÁÃÉÏÎÎÏÇÏ ÆÁÊÌÁ,ÔÏ ÅÓÔØ ÄÏ ÚÁÇÒÕÚËÉ ÌÀÂÙÈ ÐÌÁÇÉÎÏ×
+daemon
+
+# ÄÌÑ win32
+plugin "Ó:\3proxy\ldapauth.dll" start
+# ÄÌÑ unix
+plugin "/3proxy/libldapauth.so" start
+
+ldapconnect 192.160.0.1 cn=ldap,cn=users,dc=domain,dc=ru ldap
+ldapsbase cn=users,dc=domain,dc=ru
+ldapaccess CN=internet,CN=Users,DC=domain,DC=ru
+ldapuserenv cn=users,dc=domain,dc=ru
+ldapdircount /3proxy/counter/
+ldapattr cn memberof 1
+
+ldaptrafgroup CN=traf200m,CN=Users,DC=domain,DC=ru MONTHLY 200 60000
+ldaptrafgroup CN=traf60d,CN=Users,DC=domain,DC=ru DAILY 60 80000
+ldaptrafgroup CN=traf100w,CN=Users,DC=domain,DC=ru WEEKLY 100 80000
+
+auth ldap
+allow * * * *
+proxy -p3128 -n
+--------------------
+
+ôÁË ÖÅ ×ÏÚÍÏÖÎÁ ÓÌÅÄÕÀÝÁÑ ËÏÎÆÉÇÕÒÁÃÉÑ ÂÅÚ ÕÞÅÔÁ ÔÒÁÆÉËÁ É ÏÇÒÁÎÉÞÅÎÉÊ
+ÐÏ ÓËÏÒÏÓÔÉ.
+---------------------
+service
+
+plugin "Ó:\3proxy\ldapauth.dll" start
+ldapconnect 192.160.0.1 cn=ldap,cn=users,dc=domain,dc=ru ldap
+ldapsbase cn=users,dc=domain,dc=ru
+ldapaccess CN=internet,CN=Users,DC=domain,DC=ru
+ldapuserenv cn=users,dc=domain,dc=ru
+ldapattr cn memberof 1
+auth ldap
+allow * * * *
+proxy -p3128 -n
+---------------------
+
+ óÏÚÄÁÎÉÅ ÓÐÉÓËÏ× ÄÏÓÔÕÐÁ
+
+þÔÏÂÙ ÍÏÖÎÏ ÂÙÌÏ ÓÏÚÄÁ×ÁÔØ ACL ÎÁ ÏÓÎÏ×Å ÓÐÉÓËÏ× ÐÏÌØÚÏ×ÁÔÅÌÅÊ ×ÈÏÄÑÝÉÈ
+× ÒÁÚÌÉÞÎÙÅ ÇÒÕÐÐÙ ËÁÔÁÌÏÇÁ ldap ÓÕÝÅÓÔ×ÕÅÔ ÕÔÉÌÉÔÁ getldapuser
+äÁÎÎÏÊ ÕÔÉÌÉÔÅ ÍÏÇÕÔ ÐÅÒÅÄÁÎÙ 5 ÐÁÒÁÍÅÔÒÏ× :
+
+getldapuser < ldapserver basedn user_attribute filter user password >
+
+ldapserver - ÉÍÑ ÉÌÉ ip ÁÄÒÅÓ LDAP ÓÅÒ×ÅÒÁ
+basedn - ËÏÎÔÅËÓÔ ÐÏÄËÌÀÞÅÎÉÑ Ë LDAP (ÎÁÐÒÉÍÅÒ: cn=users,dc=domain,dc=com)
+user_attribute - ÎÁÚ×ÁÎÉÅ ÐÏÌØÚÏ×ÁÔÅÌØÓËÏÇÏ ÁÔÒÉÂÕÔÁ (ÎÁÐÒÉÍÅÒ:
+ × Active Directory ÜÔÏ cn × ÄÒÕÇÉÈ LDAP ËÁÔÁÌÏÇÁÈ ÏÎ ÍÏÖÅÔ
+ ÂÙÔ ou)
+filter - ÆÉÌØÔÒ ÐÏ ËÁËÏÍÕ ÐÏÌØÚÏ×ÁÔÅÌÉ ÂÕÄÕÔ ÏÔÂÉÒÁÔØÓÑ ÉÚ LDAP (ÎÁÐÒÉÍÅÒ:
+ ÄÌÑ Active Directory ×Ù×ÅÓÔÉ ×ÓÅÈ ÐÏÌØÚÏ×ÁÔÅÌÅÊ ×ÈÏÄÑÝÉÈ × ÇÒÕÐÐÕ
+ internet ÂÕÄÅÔ ÓÌÅÄÕÀÝÁÑ ÓÔÒÏËÁ
+ (memberOf=cn=internet,cn=Users,dc=domain,dc=com) )
+
+user - ÉÍÑ ÐÏÌØÚÏ×ÁÔÅÌÑ ÄÌÑ ÐÏÄËÌÀÞÅÎÉÑ Ë ÓÅÒ×ÅÒÕ
+password - ÐÁÒÏÌØ (ÅÓÌÉ ÅÓÔØ)
+
+ ðÒÉÍÅÒ ÉÓÐÏÌØÚÏ×ÁÎÉÑ getldapuser × 3proxy.
+
+îÅÏÂÈÏÄÉÍÏ ÄÁÔØ ÄÏÓÔÕÐ Ë icq ÔÏÌØËÏ ÏÐÒÅÄÅÌÅÎÎÙÍ ÐÏÌØÚÏ×ÁÔÌÑÍ . CÏÚÄÁÅÍ
+× AD ÇÒÕÐÐÕ icquser ÚÁÎÏÓÉÍ ÔÕÄÁ ÎÕÖÎÙÈ ÐÏÌØÚÏ×ÁÔÅÌÅÊ.
+óÏÚÄÁÅÍ bat ÆÁÊÌ ÓÌÅÄÕÀÝÅÇÏ ÓÏÄÅÒÖÁÎÉÑ ËÏÔÏÒÙÊ ÂÕÄÅÔ ÆÏÒÍÉÒÏ×ÁÔØ ÆÁÊÌ
+c:\3proxy\icquser ÓÏ ÓÐÉÓËÏÍ ÐÏÌØÚÏ×ÁÔÅÌÅÊ:
+-------------------------------------------
+getldapuser 192.168.0.1 dc=domain,dc=com cn (memberOf=cn=icquser,cn=Users,dc=domain,dc=com)
+cn=admin,cn=users,dc=domain,dc=com password > c:\3proxy\icquser
+-------------------------------------------
+÷ÓÔÁ×ÌÑÅÍ ÄÁÎÎÙÊ bat ÆÁÊÌ ÎÁ ÐÅÒÉÏÄÉÞÅÓËÏÅ ×ÙÐÏÌÎÅÎÉÅ.
+
+äÁÌÅÅ ÐÒÏÐÉÓÙ×ÁÅÍ 3proxy.cfg ÓÌÅÄ ÓÔÒÏËÉ
+-------------------------------------------------
+monitor "c:\3proxy\icquser"
+
+auth ldap
+allow $"c:\3proxy\icquser" * *icq.com
+deny * * *icq.com
+allow *
+proxy -n
+-------------------------------------------------
+
+
+ ëÏÍÐÉÌÑÃÉÑ ÐÌÁÇÉÎÁ ÎÁ ÒÁÚÌÉÞÎÙÈ ïó
+
+ 1) Win32 (windows 98/NT/XP/2000/2003)
+äÌÑ ÓÂÏÒËÉ É ÒÁÂÏÔÙ ÐÌÁÇÉÎÁ × ÁÒÈÉ×Å Ó ÎÉÍ ÕÖÅ ÉÄÕÔ × ËÁÔÁÌÏÇÅ ldapwindev
+ÓÌÅÄÕÀÝÉÅ ÂÉÂÌÉÏÔÅËÉ (×ÅÒÓÉÑ 2.2.29).
+
+ libcrypto.dll
+ liblber.dll
+ libldap.dll
+ libssl.dll
+É ÚÁÇÏÌÏ×ÏÞÎÙÅ ÆÁÊÌÙ
+ lber.h
+ lber_types.h
+ ldap.h
+ ldap_cdefs.h
+ ldap_features.h
+ ldap_schema.h
+ ldap_utf8.h
+
+äÁÌÅÅ ×ÁÍ ÎÅÏÂÈÏÄÉÍÏ ÓËÁÞÁÔØ É ÕÓÔÁÎÏ×ÉÔØ ËÏÍÐÉÌÑÔÏÒ Dev-Cpp Ó ÓÁÊÔÁ
+http://www.bloodshed.net/dev/
+
+äÁÌÅÅ ÓËÁÞÁÔØ ÉÓÈÏÄÎÙÅ ÔÅËÓÔÙ 3proxy ÏÔÓÀÄÁ:
+http://3proxy.ru/current/3proxy-0.6-devel.tgz É ÒÁÓÐÁËÏ×ÁÔØ.
+÷ ËÁÔÁÌÏÇ \src\plugins ÓËÏÐÉÒÏ×ÁÔØ ËÁÔÁÌÏÇ Ó ÉÓÈÏÄÎÙÍÉ ÔÅËÓÔÁÍÉ
+ÐÌÁÇÉÎÁ. óËÏÒÒÅËÔÉÒÏ×ÁÔØ com-win32.bat ÆÁÊÌ Ó ÕÞÅÔÏÍ ÔÏÇÏ ÇÄÅ Õ ÷ÁÓ ÕÓÔÁÎÏ×ÌÅÎ
+ËÏÍÐÉÌÑÔÏÒ gcc , ÎÁÐÒÉÍÅÒ:
+-------------com-win32.bat----------------
+c:\Dev-Cpp\bin\gcc -shared -o ldapauth.dll ldapauth.c -DWIN32 -I"./ldapwindev" -L"./ldapwindev" -lldap
+------------------------------------------
+é ÚÁÐÕÓÔÉÔØ ÎÁ ×ÙÐÏÌÎÅÎÉÅ com-win32.bat ÐÏÓÌÅ ÜÔÏÇÏ Õ ÷ÁÓ ÄÏÌÖÎÁ ÐÏÑ×ÉÔÓÑ
+ÂÉÂÌÉÏÔÅËÁ ldapauth.dll É ÉÓÐÏÌÎÑÅÍÙÊ ÆÁÊÌ getldapuser.exe .
+äÌÑ ÄÁÌØÎÅÊÛÅÊ ÒÁÂÏÔÙ ÐÏÌÕÞÉ×ÛÉÅÓÑ ÆÁÊÌÙ É ×ÓÅ ÂÉÂÌÉÏÔÅËÉ dll ÉÚ ËÁÔÁÌÏÇÁ
+ldapwindev ÓËÏÐÉÒÏ×ÁÔØ × ËÁÔÁÌÏÇ Ó 3proxy.
+
+ 2) xNIX (linux,freebsd É Ô.Ð. )
+
+ðÅÒÅÄ ËÏÍÐÉÌÑÃÉÅÊ ÎÕÖÎÏ ÐÒÏ×ÅÒÉÔØ ÞÔÏÂÙ × ÓÉÓÔÅÍÅ ÂÙÌ ÕcÔÁÎÏ×ÌÅÎ
+OpenLDAP client. ÷ ÓÉÓÔÅÍÅ ÄÏÌÖÎÙ ÐÒÉÓÕÔ×Ï×ÁÔØ ÓÌÅÄÕÀÝÉÅ
+ÂÉÂÌÉÏÔÅËÉ:
+
+ liblber.a
+ libldap.a
+ liblber.so
+ libldap.so
+
+É ÚÁÇÏÌÏ×ÏÞÎÙÅ ÆÁÊÌÙ
+ lber.h
+ lber_types.h
+ ldap.h
+ ldap_cdefs.h
+ ldap_features.h
+ ldap_schema.h
+ ldap_utf8.h
+
+õÓÔÁÎÏ×ËÁ ËÌÉÅÎÔÁ ÐÏÄ ÒÁÚÎÙÍÉ ïó ÜÔÏ ÄÅÌÁÅÔÓÑ ÌÉÂÏ ÉÎÓÔÁÌÑÃÉÅÊ ÇÏÔÏ×ÏÇÏ ÐÁËÅÔÁ
+ÌÉÂÏ ÓÁÍÏÓÔÏÑÔÅÌØÎÁÑ ÓÂÏÒËÁ ÄÁÎÎÏÇÏ ËÌÉÅÎÔÁ ÉÚ ÉÓÈÏÄÎÙÈ ÔÅËÓÔÏ× ËÏÔÏÒÙÅ
+ÒÁÓÐÏÌÏÖÅÎÎÙ ÔÕÔ ftp://ftp.openldap.org/pub/OpenLDAP/openldap-release/
+
+þÔÏÂÙ ÓÏÂÒÁÔØ ÐÁËÅÔ, ÎÅÏÂÈÏÄÉÍÏ ÓËÁÞÁÔØ ÁÒÈÉ×
+wget ftp://ftp.openldap.org/pub/OpenLDAP/openldap-release/openldap-2.3.9.tgz
+
+ÒÁÓÐÁËÏ×Ù×ÁÅÍ ÁÒÈÉ×
+tar xvzf openldap-2.3.9.tgz
+
+É ÚÁÐÕÓËÁÅÍ ÓËÒÉÐÔ Á×ÔÏËÏÎÆÉÇÕÒÁÃÉÉ ÓÏ ÓÌÅÄÕÀÝÉÍÉ
+ÐÁÒÁÍÅÔÒÁÍÉ:
+./configure --enable-backends=no --enable-slapd=no
+
+ÄÁÌÅÅ
+
+make
+make install
+
+äÁÌÅÅ ÓËÁÞÁÔØ ÉÓÈÏÄÎÙÅ ÔÅËÓÔÙ 3proxy ÏÔÓÀÄÁ:
+http://3proxy.ru/current/3proxy-0.6-devel.tgz É ÒÁÓÐÁËÏ×ÁÔØ.
+÷ ËÁÔÁÌÏÇ \src\plugins ÓËÏÐÉÒÏ×ÁÔØ ËÁÔÁÌÏÇ Ó ÉÓÈÏÄÎÙÍÉ ÔÅËÓÔÁÍÉ
+ÐÌÁÇÉÎÁ. éÚÍÅÎÉÔØ ÐÕÔÉ × ÆÁÊÌÅ com-unix.sh ÐÁÒÁÍÅÔÒÁÈ ËÏÍÐÉÌÑÃÉÉ -I É -L
+Ë ÚÁÇÏÌÏ×ÏÞÎÙÍ É ÂÉÂÌÉÏÔÅÞÎÙÍ ÆÁÊÌÁÍ ldap ÄÌÑ ÷ÁÛÅÊ ÓÉÓÔÅÍÙ.
+
+÷ÙÐÏÌÎÉÔØ ÓÌÅÄÕÀÝÉÅ ËÏÍÍÁÎÄÙ:
+chmod +x com-unix.sh
+com-unix.sh
+
+é ÚÁÐÕÓÔÉÔØ ÎÁ ×ÙÐÏÌÎÅÎÉÅ com-unix.sh ÐÏÓÌÅ ÜÔÏÇÏ Õ ÷ÁÓ ÄÏÌÖÎÁ ÐÏÑ×ÉÔÓÑ
+ÂÉÂÌÉÏÔÅËÁ ldapauth.so É ÉÓÐÏÌÎÑÅÍÙÊ ÆÁÊÌ getldapuser.
+
+ðÏÌÕÞÉ×ÛÉÅÓÑ ÆÁÊÌÙ ÓËÏÐÉÒÏ×ÁÔØ × ËÁÔÁÌÏÇ Ó 3proxy.
+----------------------------KOI8-R------------------------------
\ No newline at end of file
diff --git a/src/plugins/PCREPlugin/CVS/Entries b/src/plugins/PCREPlugin/CVS/Entries
new file mode 100644
index 0000000..d5307d3
--- /dev/null
+++ b/src/plugins/PCREPlugin/CVS/Entries
@@ -0,0 +1,2 @@
+/pcre_plugin.c/1.11/Wed Apr 25 18:17:22 2012//
+D
diff --git a/src/plugins/PCREPlugin/CVS/Repository b/src/plugins/PCREPlugin/CVS/Repository
new file mode 100644
index 0000000..469b5dc
--- /dev/null
+++ b/src/plugins/PCREPlugin/CVS/Repository
@@ -0,0 +1 @@
+3proxy-0.5a/src/plugins/PCREPlugin
diff --git a/src/plugins/PCREPlugin/CVS/Root b/src/plugins/PCREPlugin/CVS/Root
new file mode 100644
index 0000000..43e0a15
--- /dev/null
+++ b/src/plugins/PCREPlugin/CVS/Root
@@ -0,0 +1 @@
+/cygdrive/m/MEDIA/H/CVS
diff --git a/src/plugins/PCREPlugin/Makefile b/src/plugins/PCREPlugin/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/plugins/PCREPlugin/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/plugins/PCREPlugin/Makefile.inc b/src/plugins/PCREPlugin/Makefile.inc
new file mode 100644
index 0000000..7dd3d4f
--- /dev/null
+++ b/src/plugins/PCREPlugin/Makefile.inc
@@ -0,0 +1,71 @@
+all: $(BUILDDIR)PCREPlugin$(DLSUFFICS)
+
+
+pcre_compile$(OBJSUFFICS): pcre_compile.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_compile.c
+
+pcre_config$(OBJSUFFICS): pcre_config.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_config.c
+
+pcre_dfa_exec$(OBJSUFFICS): pcre_dfa_exec.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_dfa_exec.c
+
+pcre_exec$(OBJSUFFICS): pcre_exec.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_exec.c
+
+pcre_fullinfo$(OBJSUFFICS): pcre_fullinfo.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_fullinfo.c
+
+pcre_get$(OBJSUFFICS): pcre_get.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_get.c
+
+pcre_globals$(OBJSUFFICS): pcre_globals.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_globals.c
+
+pcre_info$(OBJSUFFICS): pcre_info.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_info.c
+
+pcre_maketables$(OBJSUFFICS): pcre_maketables.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_maketables.c
+
+pcre_newline$(OBJSUFFICS): pcre_newline.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_newline.c
+
+pcre_ord2utf8$(OBJSUFFICS): pcre_ord2utf8.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_ord2utf8.c
+
+pcre_refcount$(OBJSUFFICS): pcre_refcount.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_refcount.c
+
+pcre_study$(OBJSUFFICS): pcre_study.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_study.c
+
+pcre_tables$(OBJSUFFICS): pcre_tables.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_tables.c
+
+pcre_try_flipped$(OBJSUFFICS): pcre_try_flipped.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_try_flipped.c
+
+pcre_ucp_searchfuncs$(OBJSUFFICS): pcre_ucp_searchfuncs.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_ucp_searchfuncs.c
+
+pcre_valid_utf8$(OBJSUFFICS): pcre_valid_utf8.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_valid_utf8.c
+
+pcre_version$(OBJSUFFICS): pcre_version.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_version.c
+
+pcre_xclass$(OBJSUFFICS): pcre_xclass.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_xclass.c
+
+pcre_dftables$(OBJSUFFICS): pcre_dftables.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_dftables.c
+
+pcre_plugin$(OBJSUFFICS): pcre_plugin.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcre_plugin.c
+
+pcreposix$(OBJSUFFICS): pcreposix.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pcreposix.c
+
+$(BUILDDIR)PCREPlugin$(DLSUFFICS): pcre_compile$(OBJSUFFICS) pcre_config$(OBJSUFFICS) pcre_dfa_exec$(OBJSUFFICS) pcre_exec$(OBJSUFFICS) pcre_fullinfo$(OBJSUFFICS) pcre_get$(OBJSUFFICS) pcre_globals$(OBJSUFFICS) pcre_info$(OBJSUFFICS) pcre_maketables$(OBJSUFFICS) pcre_newline$(OBJSUFFICS) pcre_ord2utf8$(OBJSUFFICS) pcre_refcount$(OBJSUFFICS) pcre_study$(OBJSUFFICS) pcre_tables$(OBJSUFFICS) pcre_try_flipped$(OBJSUFFICS) pcre_ucp_searchfuncs$(OBJSUFFICS) pcre_valid_utf8$(OBJSUFFICS) pcre_version$(OBJSUFFICS) pcre_xclass$(OBJSUFFICS) pcre_dftables$(OBJSUFFICS) pcre_plugin$(OBJSUFFICS) pcreposix$(OBJSUFFICS)
+ $(LN) $(LNOUT)../../$(BUILDDIR)PCREPlugin$(DLSUFFICS) $(LDFLAGS) $(DLFLAGS) pcre_compile$(OBJSUFFICS) pcre_config$(OBJSUFFICS) pcre_dfa_exec$(OBJSUFFICS) pcre_exec$(OBJSUFFICS) pcre_fullinfo$(OBJSUFFICS) pcre_get$(OBJSUFFICS) pcre_globals$(OBJSUFFICS) pcre_info$(OBJSUFFICS) pcre_maketables$(OBJSUFFICS) pcre_newline$(OBJSUFFICS) pcre_ord2utf8$(OBJSUFFICS) pcre_refcount$(OBJSUFFICS) pcre_study$(OBJSUFFICS) pcre_tables$(OBJSUFFICS) pcre_try_flipped$(OBJSUFFICS) pcre_ucp_searchfuncs$(OBJSUFFICS) pcre_valid_utf8$(OBJSUFFICS) pcre_version$(OBJSUFFICS) pcre_xclass$(OBJSUFFICS) pcre_dftables$(OBJSUFFICS) pcre_plugin$(OBJSUFFICS) pcreposix$(OBJSUFFICS)
diff --git a/src/plugins/PCREPlugin/Makefile.var b/src/plugins/PCREPlugin/Makefile.var
new file mode 100644
index 0000000..6e2c41c
--- /dev/null
+++ b/src/plugins/PCREPlugin/Makefile.var
@@ -0,0 +1,37 @@
+VERFILE = version.obj ../3proxy.RES
+#$Id: Makefile.msvc,v 1.17 2010-11-11 14:44:11 v.dubrovin Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin lastFripper FilePlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/src/plugins/PCREPlugin/config.h b/src/plugins/PCREPlugin/config.h
new file mode 100644
index 0000000..a149626
--- /dev/null
+++ b/src/plugins/PCREPlugin/config.h
@@ -0,0 +1,145 @@
+
+/* On Unix-like systems config.in is converted by "configure" into config.h.
+Some other environments also support the use of "configure". PCRE is written in
+Standard C, but there are a few non-standard things it can cope with, allowing
+it to run on SunOS4 and other "close to standard" systems.
+
+On a non-Unix-like system you should just copy this file into config.h, and set
+up the macros the way you need them. You should normally change the definitions
+of HAVE_STRERROR and HAVE_MEMMOVE to 1. Unfortunately, because of the way
+autoconf works, these cannot be made the defaults. If your system has bcopy()
+and not memmove(), change the definition of HAVE_BCOPY instead of HAVE_MEMMOVE.
+If your system has neither bcopy() nor memmove(), leave them both as 0; an
+emulation function will be used. */
+
+/* If you are compiling for a system that uses EBCDIC instead of ASCII
+character codes, define this macro as 1. On systems that can use "configure",
+this can be done via --enable-ebcdic. */
+
+#ifndef EBCDIC
+#define EBCDIC 0
+#endif
+
+#define PCRE_STATIC
+
+/* If you are compiling for a system other than a Unix-like system or Win32,
+and it needs some magic to be inserted before the definition of a function that
+is exported by the library, define this macro to contain the relevant magic. If
+you do not define this macro, it defaults to "extern" for a C compiler and
+"extern C" for a C++ compiler on non-Win32 systems. This macro apears at the
+start of every exported function that is part of the external API. It does not
+appear on functions that are "external" in the C sense, but which are internal
+to the library. */
+
+/* #define PCRE_DATA_SCOPE */
+
+/* Define the following macro to empty if the "const" keyword does not work. */
+
+#undef const
+
+/* Define the following macro to "unsigned" if does not define
+size_t. */
+
+#undef size_t
+
+/* The following two definitions are mainly for the benefit of SunOS4, which
+does not have the strerror() or memmove() functions that should be present in
+all Standard C libraries. The macros HAVE_STRERROR and HAVE_MEMMOVE should
+normally be defined with the value 1 for other systems, but unfortunately we
+cannot make this the default because "configure" files generated by autoconf
+will only change 0 to 1; they won't change 1 to 0 if the functions are not
+found. */
+
+#define HAVE_STRERROR 0
+#define HAVE_MEMMOVE 0
+
+/* There are some non-Unix-like systems that don't even have bcopy(). If this
+macro is false, an emulation is used. If HAVE_MEMMOVE is set to 1, the value of
+HAVE_BCOPY is not relevant. */
+
+#define HAVE_BCOPY 0
+
+/* The value of NEWLINE determines the newline character. The default is to
+leave it up to the compiler, but some sites want to force a particular value.
+On Unix-like systems, "configure" can be used to override this default. */
+
+#ifndef NEWLINE
+#define NEWLINE '\n'
+#endif
+
+/* The value of LINK_SIZE determines the number of bytes used to store links as
+offsets within the compiled regex. The default is 2, which allows for compiled
+patterns up to 64K long. This covers the vast majority of cases. However, PCRE
+can also be compiled to use 3 or 4 bytes instead. This allows for longer
+patterns in extreme cases. On systems that support it, "configure" can be used
+to override this default. */
+
+#ifndef LINK_SIZE
+#define LINK_SIZE 2
+#endif
+
+/* When calling PCRE via the POSIX interface, additional working storage is
+required for holding the pointers to capturing substrings because PCRE requires
+three integers per substring, whereas the POSIX interface provides only two. If
+the number of expected substrings is small, the wrapper function uses space on
+the stack, because this is faster than using malloc() for each call. The
+threshold above which the stack is no longer used is defined by POSIX_MALLOC_
+THRESHOLD. On systems that support it, "configure" can be used to override this
+default. */
+
+#ifndef POSIX_MALLOC_THRESHOLD
+#define POSIX_MALLOC_THRESHOLD 10
+#endif
+
+/* PCRE uses recursive function calls to handle backtracking while matching.
+This can sometimes be a problem on systems that have stacks of limited size.
+Define NO_RECURSE to get a version that doesn't use recursion in the match()
+function; instead it creates its own stack by steam using pcre_recurse_malloc()
+to obtain memory from the heap. For more detail, see the comments and other
+stuff just above the match() function. On systems that support it, "configure"
+can be used to set this in the Makefile (use --disable-stack-for-recursion). */
+
+/* #define NO_RECURSE */
+
+/* The value of MATCH_LIMIT determines the default number of times the internal
+match() function can be called during a single execution of pcre_exec(). There
+is a runtime interface for setting a different limit. The limit exists in order
+to catch runaway regular expressions that take for ever to determine that they
+do not match. The default is set very large so that it does not accidentally
+catch legitimate cases. On systems that support it, "configure" can be used to
+override this default default. */
+
+#ifndef MATCH_LIMIT
+#define MATCH_LIMIT 10000000
+#endif
+
+/* The above limit applies to all calls of match(), whether or not they
+increase the recursion depth. In some environments it is desirable to limit the
+depth of recursive calls of match() more strictly, in order to restrict the
+maximum amount of stack (or heap, if NO_RECURSE is defined) that is used. The
+value of MATCH_LIMIT_RECURSION applies only to recursive calls of match(). To
+have any useful effect, it must be less than the value of MATCH_LIMIT. There is
+a runtime method for setting a different limit. On systems that support it,
+"configure" can be used to override this default default. */
+
+#ifndef MATCH_LIMIT_RECURSION
+#define MATCH_LIMIT_RECURSION MATCH_LIMIT
+#endif
+
+/* These three limits are parameterized just in case anybody ever wants to
+change them. Care must be taken if they are increased, because they guard
+against integer overflow caused by enormously large patterns. */
+
+#ifndef MAX_NAME_SIZE
+#define MAX_NAME_SIZE 32
+#endif
+
+#ifndef MAX_NAME_COUNT
+#define MAX_NAME_COUNT 10000
+#endif
+
+#ifndef MAX_DUPLENGTH
+#define MAX_DUPLENGTH 30000
+#endif
+
+/* End */
diff --git a/src/plugins/PCREPlugin/pcre.h b/src/plugins/PCREPlugin/pcre.h
new file mode 100644
index 0000000..9064ee0
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre.h
@@ -0,0 +1,304 @@
+#include "config.h"
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* This is the public header file for the PCRE library, to be #included by
+applications that call the PCRE functions.
+
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+#ifndef _PCRE_H
+#define _PCRE_H
+
+/* The current PCRE version information. */
+
+#define PCRE_MAJOR 7
+#define PCRE_MINOR 4
+#define PCRE_PRERELEASE
+#define PCRE_DATE 2007-09-21
+
+/* When an application links to a PCRE DLL in Windows, the symbols that are
+imported have to be identified as such. When building PCRE, the appropriate
+export setting is defined in pcre_internal.h, which includes this file. So we
+don't change existing definitions of PCRE_EXP_DECL and PCRECPP_EXP_DECL. */
+
+#if defined(_WIN32) && !defined(PCRE_STATIC)
+# ifndef PCRE_EXP_DECL
+# define PCRE_EXP_DECL extern __declspec(dllimport)
+# endif
+# ifdef __cplusplus
+# ifndef PCRECPP_EXP_DECL
+# define PCRECPP_EXP_DECL extern __declspec(dllimport)
+# endif
+# ifndef PCRECPP_EXP_DEFN
+# define PCRECPP_EXP_DEFN __declspec(dllimport)
+# endif
+# endif
+#endif
+
+/* By default, we use the standard "extern" declarations. */
+
+#ifndef PCRE_EXP_DECL
+# ifdef __cplusplus
+# define PCRE_EXP_DECL extern "C"
+# else
+# define PCRE_EXP_DECL extern
+# endif
+#endif
+
+#ifdef __cplusplus
+# ifndef PCRECPP_EXP_DECL
+# define PCRECPP_EXP_DECL extern
+# endif
+# ifndef PCRECPP_EXP_DEFN
+# define PCRECPP_EXP_DEFN
+# endif
+#endif
+
+/* Have to include stdlib.h in order to ensure that size_t is defined;
+it is needed here for malloc. */
+
+#include
+
+/* Allow for C++ users */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* Options */
+
+#define PCRE_CASELESS 0x00000001
+#define PCRE_MULTILINE 0x00000002
+#define PCRE_DOTALL 0x00000004
+#define PCRE_EXTENDED 0x00000008
+#define PCRE_ANCHORED 0x00000010
+#define PCRE_DOLLAR_ENDONLY 0x00000020
+#define PCRE_EXTRA 0x00000040
+#define PCRE_NOTBOL 0x00000080
+#define PCRE_NOTEOL 0x00000100
+#define PCRE_UNGREEDY 0x00000200
+#define PCRE_NOTEMPTY 0x00000400
+#define PCRE_UTF8 0x00000800
+#define PCRE_NO_AUTO_CAPTURE 0x00001000
+#define PCRE_NO_UTF8_CHECK 0x00002000
+#define PCRE_AUTO_CALLOUT 0x00004000
+#define PCRE_PARTIAL 0x00008000
+#define PCRE_DFA_SHORTEST 0x00010000
+#define PCRE_DFA_RESTART 0x00020000
+#define PCRE_FIRSTLINE 0x00040000
+#define PCRE_DUPNAMES 0x00080000
+#define PCRE_NEWLINE_CR 0x00100000
+#define PCRE_NEWLINE_LF 0x00200000
+#define PCRE_NEWLINE_CRLF 0x00300000
+#define PCRE_NEWLINE_ANY 0x00400000
+#define PCRE_NEWLINE_ANYCRLF 0x00500000
+#define PCRE_BSR_ANYCRLF 0x00800000
+#define PCRE_BSR_UNICODE 0x01000000
+
+/* Exec-time and get/set-time error codes */
+
+#define PCRE_ERROR_NOMATCH (-1)
+#define PCRE_ERROR_NULL (-2)
+#define PCRE_ERROR_BADOPTION (-3)
+#define PCRE_ERROR_BADMAGIC (-4)
+#define PCRE_ERROR_UNKNOWN_OPCODE (-5)
+#define PCRE_ERROR_UNKNOWN_NODE (-5) /* For backward compatibility */
+#define PCRE_ERROR_NOMEMORY (-6)
+#define PCRE_ERROR_NOSUBSTRING (-7)
+#define PCRE_ERROR_MATCHLIMIT (-8)
+#define PCRE_ERROR_CALLOUT (-9) /* Never used by PCRE itself */
+#define PCRE_ERROR_BADUTF8 (-10)
+#define PCRE_ERROR_BADUTF8_OFFSET (-11)
+#define PCRE_ERROR_PARTIAL (-12)
+#define PCRE_ERROR_BADPARTIAL (-13)
+#define PCRE_ERROR_INTERNAL (-14)
+#define PCRE_ERROR_BADCOUNT (-15)
+#define PCRE_ERROR_DFA_UITEM (-16)
+#define PCRE_ERROR_DFA_UCOND (-17)
+#define PCRE_ERROR_DFA_UMLIMIT (-18)
+#define PCRE_ERROR_DFA_WSSIZE (-19)
+#define PCRE_ERROR_DFA_RECURSE (-20)
+#define PCRE_ERROR_RECURSIONLIMIT (-21)
+#define PCRE_ERROR_NULLWSLIMIT (-22) /* No longer actually used */
+#define PCRE_ERROR_BADNEWLINE (-23)
+
+/* Request types for pcre_fullinfo() */
+
+#define PCRE_INFO_OPTIONS 0
+#define PCRE_INFO_SIZE 1
+#define PCRE_INFO_CAPTURECOUNT 2
+#define PCRE_INFO_BACKREFMAX 3
+#define PCRE_INFO_FIRSTBYTE 4
+#define PCRE_INFO_FIRSTCHAR 4 /* For backwards compatibility */
+#define PCRE_INFO_FIRSTTABLE 5
+#define PCRE_INFO_LASTLITERAL 6
+#define PCRE_INFO_NAMEENTRYSIZE 7
+#define PCRE_INFO_NAMECOUNT 8
+#define PCRE_INFO_NAMETABLE 9
+#define PCRE_INFO_STUDYSIZE 10
+#define PCRE_INFO_DEFAULT_TABLES 11
+#define PCRE_INFO_OKPARTIAL 12
+#define PCRE_INFO_JCHANGED 13
+#define PCRE_INFO_HASCRORLF 14
+
+/* Request types for pcre_config(). Do not re-arrange, in order to remain
+compatible. */
+
+#define PCRE_CONFIG_UTF8 0
+#define PCRE_CONFIG_NEWLINE 1
+#define PCRE_CONFIG_LINK_SIZE 2
+#define PCRE_CONFIG_POSIX_MALLOC_THRESHOLD 3
+#define PCRE_CONFIG_MATCH_LIMIT 4
+#define PCRE_CONFIG_STACKRECURSE 5
+#define PCRE_CONFIG_UNICODE_PROPERTIES 6
+#define PCRE_CONFIG_MATCH_LIMIT_RECURSION 7
+#define PCRE_CONFIG_BSR 8
+
+/* Bit flags for the pcre_extra structure. Do not re-arrange or redefine
+these bits, just add new ones on the end, in order to remain compatible. */
+
+#define PCRE_EXTRA_STUDY_DATA 0x0001
+#define PCRE_EXTRA_MATCH_LIMIT 0x0002
+#define PCRE_EXTRA_CALLOUT_DATA 0x0004
+#define PCRE_EXTRA_TABLES 0x0008
+#define PCRE_EXTRA_MATCH_LIMIT_RECURSION 0x0010
+
+/* Types */
+
+struct real_pcre; /* declaration; the definition is private */
+typedef struct real_pcre pcre;
+
+/* When PCRE is compiled as a C++ library, the subject pointer type can be
+replaced with a custom type. For conventional use, the public interface is a
+const char *. */
+
+#ifndef PCRE_SPTR
+#define PCRE_SPTR const char *
+#endif
+
+/* The structure for passing additional data to pcre_exec(). This is defined in
+such as way as to be extensible. Always add new fields at the end, in order to
+remain compatible. */
+
+typedef struct pcre_extra {
+ unsigned long int flags; /* Bits for which fields are set */
+ void *study_data; /* Opaque data from pcre_study() */
+ unsigned long int match_limit; /* Maximum number of calls to match() */
+ void *callout_data; /* Data passed back in callouts */
+ const unsigned char *tables; /* Pointer to character tables */
+ unsigned long int match_limit_recursion; /* Max recursive calls to match() */
+} pcre_extra;
+
+/* The structure for passing out data via the pcre_callout_function. We use a
+structure so that new fields can be added on the end in future versions,
+without changing the API of the function, thereby allowing old clients to work
+without modification. */
+
+typedef struct pcre_callout_block {
+ int version; /* Identifies version of block */
+ /* ------------------------ Version 0 ------------------------------- */
+ int callout_number; /* Number compiled into pattern */
+ int *offset_vector; /* The offset vector */
+ PCRE_SPTR subject; /* The subject being matched */
+ int subject_length; /* The length of the subject */
+ int start_match; /* Offset to start of this match attempt */
+ int current_position; /* Where we currently are in the subject */
+ int capture_top; /* Max current capture */
+ int capture_last; /* Most recently closed capture */
+ void *callout_data; /* Data passed in with the call */
+ /* ------------------- Added for Version 1 -------------------------- */
+ int pattern_position; /* Offset to next item in the pattern */
+ int next_item_length; /* Length of next item in the pattern */
+ /* ------------------------------------------------------------------ */
+} pcre_callout_block;
+
+/* Indirection for store get and free functions. These can be set to
+alternative malloc/free functions if required. Special ones are used in the
+non-recursive case for "frames". There is also an optional callout function
+that is triggered by the (?) regex item. For Virtual Pascal, these definitions
+have to take another form. */
+
+#ifndef VPCOMPAT
+PCRE_EXP_DECL void *(*pcre_malloc)(size_t);
+PCRE_EXP_DECL void (*pcre_free)(void *);
+PCRE_EXP_DECL void *(*pcre_stack_malloc)(size_t);
+PCRE_EXP_DECL void (*pcre_stack_free)(void *);
+PCRE_EXP_DECL int (*pcre_callout)(pcre_callout_block *);
+#else /* VPCOMPAT */
+PCRE_EXP_DECL void *pcre_malloc(size_t);
+PCRE_EXP_DECL void pcre_free(void *);
+PCRE_EXP_DECL void *pcre_stack_malloc(size_t);
+PCRE_EXP_DECL void pcre_stack_free(void *);
+PCRE_EXP_DECL int pcre_callout(pcre_callout_block *);
+#endif /* VPCOMPAT */
+
+/* Exported PCRE functions */
+
+PCRE_EXP_DECL pcre *pcre_compile(const char *, int, const char **, int *,
+ const unsigned char *);
+PCRE_EXP_DECL pcre *pcre_compile2(const char *, int, int *, const char **,
+ int *, const unsigned char *);
+PCRE_EXP_DECL int pcre_config(int, void *);
+PCRE_EXP_DECL int pcre_copy_named_substring(const pcre *, const char *,
+ int *, int, const char *, char *, int);
+PCRE_EXP_DECL int pcre_copy_substring(const char *, int *, int, int, char *,
+ int);
+PCRE_EXP_DECL int pcre_dfa_exec(const pcre *, const pcre_extra *,
+ const char *, int, int, int, int *, int , int *, int);
+PCRE_EXP_DECL int pcre_exec(const pcre *, const pcre_extra *, PCRE_SPTR,
+ int, int, int, int *, int);
+PCRE_EXP_DECL void pcre_free_substring(const char *);
+PCRE_EXP_DECL void pcre_free_substring_list(const char **);
+PCRE_EXP_DECL int pcre_fullinfo(const pcre *, const pcre_extra *, int,
+ void *);
+PCRE_EXP_DECL int pcre_get_named_substring(const pcre *, const char *,
+ int *, int, const char *, const char **);
+PCRE_EXP_DECL int pcre_get_stringnumber(const pcre *, const char *);
+PCRE_EXP_DECL int pcre_get_stringtable_entries(const pcre *, const char *,
+ char **, char **);
+PCRE_EXP_DECL int pcre_get_substring(const char *, int *, int, int,
+ const char **);
+PCRE_EXP_DECL int pcre_get_substring_list(const char *, int *, int,
+ const char ***);
+PCRE_EXP_DECL int pcre_info(const pcre *, int *, int *);
+PCRE_EXP_DECL const unsigned char *pcre_maketables(void);
+PCRE_EXP_DECL int pcre_refcount(pcre *, int);
+PCRE_EXP_DECL pcre_extra *pcre_study(const pcre *, int, const char **);
+PCRE_EXP_DECL const char *pcre_version(void);
+
+#ifdef __cplusplus
+} /* extern "C" */
+#endif
+
+#endif /* End of pcre.h */
diff --git a/src/plugins/PCREPlugin/pcre_compile.c b/src/plugins/PCREPlugin/pcre_compile.c
new file mode 100644
index 0000000..3994781
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_compile.c
@@ -0,0 +1,6145 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_compile(), along with
+supporting internal functions that are not used by other modules. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#define NLBLOCK cd /* Block containing newline information */
+#define PSSTART start_pattern /* Field containing processed string start */
+#define PSEND end_pattern /* Field containing processed string end */
+
+#include "pcre_internal.h"
+
+
+/* When DEBUG is defined, we need the pcre_printint() function, which is also
+used by pcretest. DEBUG is not defined when building a production library. */
+
+#ifdef DEBUG
+#include "pcre_printint.src"
+#endif
+
+
+/* Macro for setting individual bits in class bitmaps. */
+
+#define SETBIT(a,b) a[b/8] |= (1 << (b%8))
+
+/* Maximum length value to check against when making sure that the integer that
+holds the compiled pattern length does not overflow. We make it a bit less than
+INT_MAX to allow for adding in group terminating bytes, so that we don't have
+to check them every time. */
+
+#define OFLOW_MAX (INT_MAX - 20)
+
+
+/*************************************************
+* Code parameters and static tables *
+*************************************************/
+
+/* This value specifies the size of stack workspace that is used during the
+first pre-compile phase that determines how much memory is required. The regex
+is partly compiled into this space, but the compiled parts are discarded as
+soon as they can be, so that hopefully there will never be an overrun. The code
+does, however, check for an overrun. The largest amount I've seen used is 218,
+so this number is very generous.
+
+The same workspace is used during the second, actual compile phase for
+remembering forward references to groups so that they can be filled in at the
+end. Each entry in this list occupies LINK_SIZE bytes, so even when LINK_SIZE
+is 4 there is plenty of room. */
+
+#define COMPILE_WORK_SIZE (4096)
+
+
+/* Table for handling escaped characters in the range '0'-'z'. Positive returns
+are simple data values; negative values are for special things like \d and so
+on. Zero means further processing is needed (for things like \x), or the escape
+is invalid. */
+
+#ifndef EBCDIC /* This is the "normal" table for ASCII systems */
+static const short int escapes[] = {
+ 0, 0, 0, 0, 0, 0, 0, 0, /* 0 - 7 */
+ 0, 0, ':', ';', '<', '=', '>', '?', /* 8 - ? */
+ '@', -ESC_A, -ESC_B, -ESC_C, -ESC_D, -ESC_E, 0, -ESC_G, /* @ - G */
+-ESC_H, 0, 0, -ESC_K, 0, 0, 0, 0, /* H - O */
+-ESC_P, -ESC_Q, -ESC_R, -ESC_S, 0, 0, -ESC_V, -ESC_W, /* P - W */
+-ESC_X, 0, -ESC_Z, '[', '\\', ']', '^', '_', /* X - _ */
+ '`', 7, -ESC_b, 0, -ESC_d, ESC_e, ESC_f, 0, /* ` - g */
+-ESC_h, 0, 0, -ESC_k, 0, 0, ESC_n, 0, /* h - o */
+-ESC_p, 0, ESC_r, -ESC_s, ESC_tee, 0, -ESC_v, -ESC_w, /* p - w */
+ 0, 0, -ESC_z /* x - z */
+};
+
+#else /* This is the "abnormal" table for EBCDIC systems */
+static const short int escapes[] = {
+/* 48 */ 0, 0, 0, '.', '<', '(', '+', '|',
+/* 50 */ '&', 0, 0, 0, 0, 0, 0, 0,
+/* 58 */ 0, 0, '!', '$', '*', ')', ';', '~',
+/* 60 */ '-', '/', 0, 0, 0, 0, 0, 0,
+/* 68 */ 0, 0, '|', ',', '%', '_', '>', '?',
+/* 70 */ 0, 0, 0, 0, 0, 0, 0, 0,
+/* 78 */ 0, '`', ':', '#', '@', '\'', '=', '"',
+/* 80 */ 0, 7, -ESC_b, 0, -ESC_d, ESC_e, ESC_f, 0,
+/* 88 */-ESC_h, 0, 0, '{', 0, 0, 0, 0,
+/* 90 */ 0, 0, -ESC_k, 'l', 0, ESC_n, 0, -ESC_p,
+/* 98 */ 0, ESC_r, 0, '}', 0, 0, 0, 0,
+/* A0 */ 0, '~', -ESC_s, ESC_tee, 0,-ESC_v, -ESC_w, 0,
+/* A8 */ 0,-ESC_z, 0, 0, 0, '[', 0, 0,
+/* B0 */ 0, 0, 0, 0, 0, 0, 0, 0,
+/* B8 */ 0, 0, 0, 0, 0, ']', '=', '-',
+/* C0 */ '{',-ESC_A, -ESC_B, -ESC_C, -ESC_D,-ESC_E, 0, -ESC_G,
+/* C8 */-ESC_H, 0, 0, 0, 0, 0, 0, 0,
+/* D0 */ '}', 0, -ESC_K, 0, 0, 0, 0, -ESC_P,
+/* D8 */-ESC_Q,-ESC_R, 0, 0, 0, 0, 0, 0,
+/* E0 */ '\\', 0, -ESC_S, 0, 0,-ESC_V, -ESC_W, -ESC_X,
+/* E8 */ 0,-ESC_Z, 0, 0, 0, 0, 0, 0,
+/* F0 */ 0, 0, 0, 0, 0, 0, 0, 0,
+/* F8 */ 0, 0, 0, 0, 0, 0, 0, 0
+};
+#endif
+
+
+/* Table of special "verbs" like (*PRUNE). This is a short table, so it is
+searched linearly. Put all the names into a single string, in order to reduce
+the number of relocations when a shared library is dynamically linked. */
+
+typedef struct verbitem {
+ int len;
+ int op;
+} verbitem;
+
+static const char verbnames[] =
+ "ACCEPT\0"
+ "COMMIT\0"
+ "F\0"
+ "FAIL\0"
+ "PRUNE\0"
+ "SKIP\0"
+ "THEN";
+
+static verbitem verbs[] = {
+ { 6, OP_ACCEPT },
+ { 6, OP_COMMIT },
+ { 1, OP_FAIL },
+ { 4, OP_FAIL },
+ { 5, OP_PRUNE },
+ { 4, OP_SKIP },
+ { 4, OP_THEN }
+};
+
+static int verbcount = sizeof(verbs)/sizeof(verbitem);
+
+
+/* Tables of names of POSIX character classes and their lengths. The names are
+now all in a single string, to reduce the number of relocations when a shared
+library is dynamically loaded. The list of lengths is terminated by a zero
+length entry. The first three must be alpha, lower, upper, as this is assumed
+for handling case independence. */
+
+static const char posix_names[] =
+ "alpha\0" "lower\0" "upper\0" "alnum\0" "ascii\0" "blank\0"
+ "cntrl\0" "digit\0" "graph\0" "print\0" "punct\0" "space\0"
+ "word\0" "xdigit";
+
+static const uschar posix_name_lengths[] = {
+ 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 6, 0 };
+
+/* Table of class bit maps for each POSIX class. Each class is formed from a
+base map, with an optional addition or removal of another map. Then, for some
+classes, there is some additional tweaking: for [:blank:] the vertical space
+characters are removed, and for [:alpha:] and [:alnum:] the underscore
+character is removed. The triples in the table consist of the base map offset,
+second map offset or -1 if no second map, and a non-negative value for map
+addition or a negative value for map subtraction (if there are two maps). The
+absolute value of the third field has these meanings: 0 => no tweaking, 1 =>
+remove vertical space characters, 2 => remove underscore. */
+
+static const int posix_class_maps[] = {
+ cbit_word, cbit_digit, -2, /* alpha */
+ cbit_lower, -1, 0, /* lower */
+ cbit_upper, -1, 0, /* upper */
+ cbit_word, -1, 2, /* alnum - word without underscore */
+ cbit_print, cbit_cntrl, 0, /* ascii */
+ cbit_space, -1, 1, /* blank - a GNU extension */
+ cbit_cntrl, -1, 0, /* cntrl */
+ cbit_digit, -1, 0, /* digit */
+ cbit_graph, -1, 0, /* graph */
+ cbit_print, -1, 0, /* print */
+ cbit_punct, -1, 0, /* punct */
+ cbit_space, -1, 0, /* space */
+ cbit_word, -1, 0, /* word - a Perl extension */
+ cbit_xdigit,-1, 0 /* xdigit */
+};
+
+
+#define STRING(a) # a
+#define XSTRING(s) STRING(s)
+
+/* The texts of compile-time error messages. These are "char *" because they
+are passed to the outside world. Do not ever re-use any error number, because
+they are documented. Always add a new error instead. Messages marked DEAD below
+are no longer used. This used to be a table of strings, but in order to reduce
+the number of relocations needed when a shared library is loaded dynamically,
+it is now one long string. We cannot use a table of offsets, because the
+lengths of inserts such as XSTRING(MAX_NAME_SIZE) are not known. Instead, we
+simply count through to the one we want - this isn't a performance issue
+because these strings are used only when there is a compilation error. */
+
+static const char error_texts[] =
+ "no error\0"
+ "\\ at end of pattern\0"
+ "\\c at end of pattern\0"
+ "unrecognized character follows \\\0"
+ "numbers out of order in {} quantifier\0"
+ /* 5 */
+ "number too big in {} quantifier\0"
+ "missing terminating ] for character class\0"
+ "invalid escape sequence in character class\0"
+ "range out of order in character class\0"
+ "nothing to repeat\0"
+ /* 10 */
+ "operand of unlimited repeat could match the empty string\0" /** DEAD **/
+ "internal error: unexpected repeat\0"
+ "unrecognized character after (?\0"
+ "POSIX named classes are supported only within a class\0"
+ "missing )\0"
+ /* 15 */
+ "reference to non-existent subpattern\0"
+ "erroffset passed as NULL\0"
+ "unknown option bit(s) set\0"
+ "missing ) after comment\0"
+ "parentheses nested too deeply\0" /** DEAD **/
+ /* 20 */
+ "regular expression is too large\0"
+ "failed to get memory\0"
+ "unmatched parentheses\0"
+ "internal error: code overflow\0"
+ "unrecognized character after (?<\0"
+ /* 25 */
+ "lookbehind assertion is not fixed length\0"
+ "malformed number or name after (?(\0"
+ "conditional group contains more than two branches\0"
+ "assertion expected after (?(\0"
+ "(?R or (?[+-]digits must be followed by )\0"
+ /* 30 */
+ "unknown POSIX class name\0"
+ "POSIX collating elements are not supported\0"
+ "this version of PCRE is not compiled with PCRE_UTF8 support\0"
+ "spare error\0" /** DEAD **/
+ "character value in \\x{...} sequence is too large\0"
+ /* 35 */
+ "invalid condition (?(0)\0"
+ "\\C not allowed in lookbehind assertion\0"
+ "PCRE does not support \\L, \\l, \\N, \\U, or \\u\0"
+ "number after (?C is > 255\0"
+ "closing ) for (?C expected\0"
+ /* 40 */
+ "recursive call could loop indefinitely\0"
+ "unrecognized character after (?P\0"
+ "syntax error in subpattern name (missing terminator)\0"
+ "two named subpatterns have the same name\0"
+ "invalid UTF-8 string\0"
+ /* 45 */
+ "support for \\P, \\p, and \\X has not been compiled\0"
+ "malformed \\P or \\p sequence\0"
+ "unknown property name after \\P or \\p\0"
+ "subpattern name is too long (maximum " XSTRING(MAX_NAME_SIZE) " characters)\0"
+ "too many named subpatterns (maximum " XSTRING(MAX_NAME_COUNT) ")\0"
+ /* 50 */
+ "repeated subpattern is too long\0" /** DEAD **/
+ "octal value is greater than \\377 (not in UTF-8 mode)\0"
+ "internal error: overran compiling workspace\0"
+ "internal error: previously-checked referenced subpattern not found\0"
+ "DEFINE group contains more than one branch\0"
+ /* 55 */
+ "repeating a DEFINE group is not allowed\0"
+ "inconsistent NEWLINE options\0"
+ "\\g is not followed by a braced name or an optionally braced non-zero number\0"
+ "(?+ or (?- or (?(+ or (?(- must be followed by a non-zero number\0"
+ "(*VERB) with an argument is not supported\0"
+ /* 60 */
+ "(*VERB) not recognized\0"
+ "number is too big";
+
+
+/* Table to identify digits and hex digits. This is used when compiling
+patterns. Note that the tables in chartables are dependent on the locale, and
+may mark arbitrary characters as digits - but the PCRE compiling code expects
+to handle only 0-9, a-z, and A-Z as digits when compiling. That is why we have
+a private table here. It costs 256 bytes, but it is a lot faster than doing
+character value tests (at least in some simple cases I timed), and in some
+applications one wants PCRE to compile efficiently as well as match
+efficiently.
+
+For convenience, we use the same bit definitions as in chartables:
+
+ 0x04 decimal digit
+ 0x08 hexadecimal digit
+
+Then we can use ctype_digit and ctype_xdigit in the code. */
+
+#ifndef EBCDIC /* This is the "normal" case, for ASCII systems */
+static const unsigned char digitab[] =
+ {
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 8- 15 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - ' */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ( - / */
+ 0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c, /* 0 - 7 */
+ 0x0c,0x0c,0x00,0x00,0x00,0x00,0x00,0x00, /* 8 - ? */
+ 0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* @ - G */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* H - O */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* P - W */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* X - _ */
+ 0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* ` - g */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* h - o */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* p - w */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* x -127 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */
+
+#else /* This is the "abnormal" case, for EBCDIC systems */
+static const unsigned char digitab[] =
+ {
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 0 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 8- 15 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 10 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 32- 39 20 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 40- 47 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 48- 55 30 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 56- 63 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - 71 40 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 72- | */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* & - 87 50 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 88- 95 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - -103 60 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 104- ? */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 112-119 70 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 120- " */
+ 0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* 128- g 80 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* h -143 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144- p 90 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* q -159 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160- x A0 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* y -175 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ^ -183 B0 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
+ 0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* { - G C0 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* H -207 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* } - P D0 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* Q -223 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* \ - X E0 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* Y -239 */
+ 0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c, /* 0 - 7 F0 */
+ 0x0c,0x0c,0x00,0x00,0x00,0x00,0x00,0x00};/* 8 -255 */
+
+static const unsigned char ebcdic_chartab[] = { /* chartable partial dup */
+ 0x80,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /* 0- 7 */
+ 0x00,0x00,0x00,0x00,0x01,0x01,0x00,0x00, /* 8- 15 */
+ 0x00,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /* 16- 23 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */
+ 0x00,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /* 32- 39 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 40- 47 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 48- 55 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 56- 63 */
+ 0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - 71 */
+ 0x00,0x00,0x00,0x80,0x00,0x80,0x80,0x80, /* 72- | */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* & - 87 */
+ 0x00,0x00,0x00,0x80,0x80,0x80,0x00,0x00, /* 88- 95 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - -103 */
+ 0x00,0x00,0x00,0x00,0x00,0x10,0x00,0x80, /* 104- ? */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 112-119 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 120- " */
+ 0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* 128- g */
+ 0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* h -143 */
+ 0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* 144- p */
+ 0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* q -159 */
+ 0x00,0x00,0x12,0x12,0x12,0x12,0x12,0x12, /* 160- x */
+ 0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* y -175 */
+ 0x80,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ^ -183 */
+ 0x00,0x00,0x80,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
+ 0x80,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* { - G */
+ 0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* H -207 */
+ 0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* } - P */
+ 0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* Q -223 */
+ 0x00,0x00,0x12,0x12,0x12,0x12,0x12,0x12, /* \ - X */
+ 0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* Y -239 */
+ 0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c, /* 0 - 7 */
+ 0x1c,0x1c,0x00,0x00,0x00,0x00,0x00,0x00};/* 8 -255 */
+#endif
+
+
+/* Definition to allow mutual recursion */
+
+static BOOL
+ compile_regex(int, int, uschar **, const uschar **, int *, BOOL, BOOL, int,
+ int *, int *, branch_chain *, compile_data *, int *);
+
+
+
+/*************************************************
+* Find an error text *
+*************************************************/
+
+/* The error texts are now all in one long string, to save on relocations. As
+some of the text is of unknown length, we can't use a table of offsets.
+Instead, just count through the strings. This is not a performance issue
+because it happens only when there has been a compilation error.
+
+Argument: the error number
+Returns: pointer to the error string
+*/
+
+static const char *
+find_error_text(int n)
+{
+const char *s = error_texts;
+for (; n > 0; n--) while (*s++ != 0);
+return s;
+}
+
+
+/*************************************************
+* Handle escapes *
+*************************************************/
+
+/* This function is called when a \ has been encountered. It either returns a
+positive value for a simple escape such as \n, or a negative value which
+encodes one of the more complicated things such as \d. A backreference to group
+n is returned as -(ESC_REF + n); ESC_REF is the highest ESC_xxx macro. When
+UTF-8 is enabled, a positive value greater than 255 may be returned. On entry,
+ptr is pointing at the \. On exit, it is on the final character of the escape
+sequence.
+
+Arguments:
+ ptrptr points to the pattern position pointer
+ errorcodeptr points to the errorcode variable
+ bracount number of previous extracting brackets
+ options the options bits
+ isclass TRUE if inside a character class
+
+Returns: zero or positive => a data character
+ negative => a special escape sequence
+ on error, errorcodeptr is set
+*/
+
+static int
+check_escape(const uschar **ptrptr, int *errorcodeptr, int bracount,
+ int options, BOOL isclass)
+{
+BOOL utf8 = (options & PCRE_UTF8) != 0;
+const uschar *ptr = *ptrptr + 1;
+int c, i;
+
+GETCHARINCTEST(c, ptr); /* Get character value, increment pointer */
+ptr--; /* Set pointer back to the last byte */
+
+/* If backslash is at the end of the pattern, it's an error. */
+
+if (c == 0) *errorcodeptr = ERR1;
+
+/* Non-alphamerics are literals. For digits or letters, do an initial lookup in
+a table. A non-zero result is something that can be returned immediately.
+Otherwise further processing may be required. */
+
+#ifndef EBCDIC /* ASCII coding */
+else if (c < '0' || c > 'z') {} /* Not alphameric */
+else if ((i = escapes[c - '0']) != 0) c = i;
+
+#else /* EBCDIC coding */
+else if (c < 'a' || (ebcdic_chartab[c] & 0x0E) == 0) {} /* Not alphameric */
+else if ((i = escapes[c - 0x48]) != 0) c = i;
+#endif
+
+/* Escapes that need further processing, or are illegal. */
+
+else
+ {
+ const uschar *oldptr;
+ BOOL braced, negated;
+
+ switch (c)
+ {
+ /* A number of Perl escapes are not handled by PCRE. We give an explicit
+ error. */
+
+ case 'l':
+ case 'L':
+ case 'N':
+ case 'u':
+ case 'U':
+ *errorcodeptr = ERR37;
+ break;
+
+ /* \g must be followed by a number, either plain or braced. If positive, it
+ is an absolute backreference. If negative, it is a relative backreference.
+ This is a Perl 5.10 feature. Perl 5.10 also supports \g{name} as a
+ reference to a named group. This is part of Perl's movement towards a
+ unified syntax for back references. As this is synonymous with \k{name}, we
+ fudge it up by pretending it really was \k. */
+
+ case 'g':
+ if (ptr[1] == '{')
+ {
+ const uschar *p;
+ for (p = ptr+2; *p != 0 && *p != '}'; p++)
+ if (*p != '-' && (digitab[*p] & ctype_digit) == 0) break;
+ if (*p != 0 && *p != '}')
+ {
+ c = -ESC_k;
+ break;
+ }
+ braced = TRUE;
+ ptr++;
+ }
+ else braced = FALSE;
+
+ if (ptr[1] == '-')
+ {
+ negated = TRUE;
+ ptr++;
+ }
+ else negated = FALSE;
+
+ c = 0;
+ while ((digitab[ptr[1]] & ctype_digit) != 0)
+ c = c * 10 + *(++ptr) - '0';
+
+ if (c < 0)
+ {
+ *errorcodeptr = ERR61;
+ break;
+ }
+
+ if (c == 0 || (braced && *(++ptr) != '}'))
+ {
+ *errorcodeptr = ERR57;
+ break;
+ }
+
+ if (negated)
+ {
+ if (c > bracount)
+ {
+ *errorcodeptr = ERR15;
+ break;
+ }
+ c = bracount - (c - 1);
+ }
+
+ c = -(ESC_REF + c);
+ break;
+
+ /* The handling of escape sequences consisting of a string of digits
+ starting with one that is not zero is not straightforward. By experiment,
+ the way Perl works seems to be as follows:
+
+ Outside a character class, the digits are read as a decimal number. If the
+ number is less than 10, or if there are that many previous extracting
+ left brackets, then it is a back reference. Otherwise, up to three octal
+ digits are read to form an escaped byte. Thus \123 is likely to be octal
+ 123 (cf \0123, which is octal 012 followed by the literal 3). If the octal
+ value is greater than 377, the least significant 8 bits are taken. Inside a
+ character class, \ followed by a digit is always an octal number. */
+
+ case '1': case '2': case '3': case '4': case '5':
+ case '6': case '7': case '8': case '9':
+
+ if (!isclass)
+ {
+ oldptr = ptr;
+ c -= '0';
+ while ((digitab[ptr[1]] & ctype_digit) != 0)
+ c = c * 10 + *(++ptr) - '0';
+ if (c < 0)
+ {
+ *errorcodeptr = ERR61;
+ break;
+ }
+ if (c < 10 || c <= bracount)
+ {
+ c = -(ESC_REF + c);
+ break;
+ }
+ ptr = oldptr; /* Put the pointer back and fall through */
+ }
+
+ /* Handle an octal number following \. If the first digit is 8 or 9, Perl
+ generates a binary zero byte and treats the digit as a following literal.
+ Thus we have to pull back the pointer by one. */
+
+ if ((c = *ptr) >= '8')
+ {
+ ptr--;
+ c = 0;
+ break;
+ }
+
+ /* \0 always starts an octal number, but we may drop through to here with a
+ larger first octal digit. The original code used just to take the least
+ significant 8 bits of octal numbers (I think this is what early Perls used
+ to do). Nowadays we allow for larger numbers in UTF-8 mode, but no more
+ than 3 octal digits. */
+
+ case '0':
+ c -= '0';
+ while(i++ < 2 && ptr[1] >= '0' && ptr[1] <= '7')
+ c = c * 8 + *(++ptr) - '0';
+ if (!utf8 && c > 255) *errorcodeptr = ERR51;
+ break;
+
+ /* \x is complicated. \x{ddd} is a character number which can be greater
+ than 0xff in utf8 mode, but only if the ddd are hex digits. If not, { is
+ treated as a data character. */
+
+ case 'x':
+ if (ptr[1] == '{')
+ {
+ const uschar *pt = ptr + 2;
+ int count = 0;
+
+ c = 0;
+ while ((digitab[*pt] & ctype_xdigit) != 0)
+ {
+ register int cc = *pt++;
+ if (c == 0 && cc == '0') continue; /* Leading zeroes */
+ count++;
+
+#ifndef EBCDIC /* ASCII coding */
+ if (cc >= 'a') cc -= 32; /* Convert to upper case */
+ c = (c << 4) + cc - ((cc < 'A')? '0' : ('A' - 10));
+#else /* EBCDIC coding */
+ if (cc >= 'a' && cc <= 'z') cc += 64; /* Convert to upper case */
+ c = (c << 4) + cc - ((cc >= '0')? '0' : ('A' - 10));
+#endif
+ }
+
+ if (*pt == '}')
+ {
+ if (c < 0 || count > (utf8? 8 : 2)) *errorcodeptr = ERR34;
+ ptr = pt;
+ break;
+ }
+
+ /* If the sequence of hex digits does not end with '}', then we don't
+ recognize this construct; fall through to the normal \x handling. */
+ }
+
+ /* Read just a single-byte hex-defined char */
+
+ c = 0;
+ while (i++ < 2 && (digitab[ptr[1]] & ctype_xdigit) != 0)
+ {
+ int cc; /* Some compilers don't like ++ */
+ cc = *(++ptr); /* in initializers */
+#ifndef EBCDIC /* ASCII coding */
+ if (cc >= 'a') cc -= 32; /* Convert to upper case */
+ c = c * 16 + cc - ((cc < 'A')? '0' : ('A' - 10));
+#else /* EBCDIC coding */
+ if (cc <= 'z') cc += 64; /* Convert to upper case */
+ c = c * 16 + cc - ((cc >= '0')? '0' : ('A' - 10));
+#endif
+ }
+ break;
+
+ /* For \c, a following letter is upper-cased; then the 0x40 bit is flipped.
+ This coding is ASCII-specific, but then the whole concept of \cx is
+ ASCII-specific. (However, an EBCDIC equivalent has now been added.) */
+
+ case 'c':
+ c = *(++ptr);
+ if (c == 0)
+ {
+ *errorcodeptr = ERR2;
+ break;
+ }
+
+#ifndef EBCDIC /* ASCII coding */
+ if (c >= 'a' && c <= 'z') c -= 32;
+ c ^= 0x40;
+#else /* EBCDIC coding */
+ if (c >= 'a' && c <= 'z') c += 64;
+ c ^= 0xC0;
+#endif
+ break;
+
+ /* PCRE_EXTRA enables extensions to Perl in the matter of escapes. Any
+ other alphameric following \ is an error if PCRE_EXTRA was set; otherwise,
+ for Perl compatibility, it is a literal. This code looks a bit odd, but
+ there used to be some cases other than the default, and there may be again
+ in future, so I haven't "optimized" it. */
+
+ default:
+ if ((options & PCRE_EXTRA) != 0) switch(c)
+ {
+ default:
+ *errorcodeptr = ERR3;
+ break;
+ }
+ break;
+ }
+ }
+
+*ptrptr = ptr;
+return c;
+}
+
+
+
+#ifdef SUPPORT_UCP
+/*************************************************
+* Handle \P and \p *
+*************************************************/
+
+/* This function is called after \P or \p has been encountered, provided that
+PCRE is compiled with support for Unicode properties. On entry, ptrptr is
+pointing at the P or p. On exit, it is pointing at the final character of the
+escape sequence.
+
+Argument:
+ ptrptr points to the pattern position pointer
+ negptr points to a boolean that is set TRUE for negation else FALSE
+ dptr points to an int that is set to the detailed property value
+ errorcodeptr points to the error code variable
+
+Returns: type value from ucp_type_table, or -1 for an invalid type
+*/
+
+static int
+get_ucp(const uschar **ptrptr, BOOL *negptr, int *dptr, int *errorcodeptr)
+{
+int c, i, bot, top;
+const uschar *ptr = *ptrptr;
+char name[32];
+
+c = *(++ptr);
+if (c == 0) goto ERROR_RETURN;
+
+*negptr = FALSE;
+
+/* \P or \p can be followed by a name in {}, optionally preceded by ^ for
+negation. */
+
+if (c == '{')
+ {
+ if (ptr[1] == '^')
+ {
+ *negptr = TRUE;
+ ptr++;
+ }
+ for (i = 0; i < (int)sizeof(name) - 1; i++)
+ {
+ c = *(++ptr);
+ if (c == 0) goto ERROR_RETURN;
+ if (c == '}') break;
+ name[i] = c;
+ }
+ if (c !='}') goto ERROR_RETURN;
+ name[i] = 0;
+ }
+
+/* Otherwise there is just one following character */
+
+else
+ {
+ name[0] = c;
+ name[1] = 0;
+ }
+
+*ptrptr = ptr;
+
+/* Search for a recognized property name using binary chop */
+
+bot = 0;
+top = _pcre_utt_size;
+
+while (bot < top)
+ {
+ i = (bot + top) >> 1;
+ c = strcmp(name, _pcre_utt_names + _pcre_utt[i].name_offset);
+ if (c == 0)
+ {
+ *dptr = _pcre_utt[i].value;
+ return _pcre_utt[i].type;
+ }
+ if (c > 0) bot = i + 1; else top = i;
+ }
+
+*errorcodeptr = ERR47;
+*ptrptr = ptr;
+return -1;
+
+ERROR_RETURN:
+*errorcodeptr = ERR46;
+*ptrptr = ptr;
+return -1;
+}
+#endif
+
+
+
+
+/*************************************************
+* Check for counted repeat *
+*************************************************/
+
+/* This function is called when a '{' is encountered in a place where it might
+start a quantifier. It looks ahead to see if it really is a quantifier or not.
+It is only a quantifier if it is one of the forms {ddd} {ddd,} or {ddd,ddd}
+where the ddds are digits.
+
+Arguments:
+ p pointer to the first char after '{'
+
+Returns: TRUE or FALSE
+*/
+
+static BOOL
+is_counted_repeat(const uschar *p)
+{
+if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
+while ((digitab[*p] & ctype_digit) != 0) p++;
+if (*p == '}') return TRUE;
+
+if (*p++ != ',') return FALSE;
+if (*p == '}') return TRUE;
+
+if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
+while ((digitab[*p] & ctype_digit) != 0) p++;
+
+return (*p == '}');
+}
+
+
+
+/*************************************************
+* Read repeat counts *
+*************************************************/
+
+/* Read an item of the form {n,m} and return the values. This is called only
+after is_counted_repeat() has confirmed that a repeat-count quantifier exists,
+so the syntax is guaranteed to be correct, but we need to check the values.
+
+Arguments:
+ p pointer to first char after '{'
+ minp pointer to int for min
+ maxp pointer to int for max
+ returned as -1 if no max
+ errorcodeptr points to error code variable
+
+Returns: pointer to '}' on success;
+ current ptr on error, with errorcodeptr set non-zero
+*/
+
+static const uschar *
+read_repeat_counts(const uschar *p, int *minp, int *maxp, int *errorcodeptr)
+{
+int min = 0;
+int max = -1;
+
+/* Read the minimum value and do a paranoid check: a negative value indicates
+an integer overflow. */
+
+while ((digitab[*p] & ctype_digit) != 0) min = min * 10 + *p++ - '0';
+if (min < 0 || min > 65535)
+ {
+ *errorcodeptr = ERR5;
+ return p;
+ }
+
+/* Read the maximum value if there is one, and again do a paranoid on its size.
+Also, max must not be less than min. */
+
+if (*p == '}') max = min; else
+ {
+ if (*(++p) != '}')
+ {
+ max = 0;
+ while((digitab[*p] & ctype_digit) != 0) max = max * 10 + *p++ - '0';
+ if (max < 0 || max > 65535)
+ {
+ *errorcodeptr = ERR5;
+ return p;
+ }
+ if (max < min)
+ {
+ *errorcodeptr = ERR4;
+ return p;
+ }
+ }
+ }
+
+/* Fill in the required variables, and pass back the pointer to the terminating
+'}'. */
+
+*minp = min;
+*maxp = max;
+return p;
+}
+
+
+
+/*************************************************
+* Find forward referenced subpattern *
+*************************************************/
+
+/* This function scans along a pattern's text looking for capturing
+subpatterns, and counting them. If it finds a named pattern that matches the
+name it is given, it returns its number. Alternatively, if the name is NULL, it
+returns when it reaches a given numbered subpattern. This is used for forward
+references to subpatterns. We know that if (?P< is encountered, the name will
+be terminated by '>' because that is checked in the first pass.
+
+Arguments:
+ ptr current position in the pattern
+ count current count of capturing parens so far encountered
+ name name to seek, or NULL if seeking a numbered subpattern
+ lorn name length, or subpattern number if name is NULL
+ xmode TRUE if we are in /x mode
+
+Returns: the number of the named subpattern, or -1 if not found
+*/
+
+static int
+find_parens(const uschar *ptr, int count, const uschar *name, int lorn,
+ BOOL xmode)
+{
+const uschar *thisname;
+
+for (; *ptr != 0; ptr++)
+ {
+ int term;
+
+ /* Skip over backslashed characters and also entire \Q...\E */
+
+ if (*ptr == '\\')
+ {
+ if (*(++ptr) == 0) return -1;
+ if (*ptr == 'Q') for (;;)
+ {
+ while (*(++ptr) != 0 && *ptr != '\\');
+ if (*ptr == 0) return -1;
+ if (*(++ptr) == 'E') break;
+ }
+ continue;
+ }
+
+ /* Skip over character classes */
+
+ if (*ptr == '[')
+ {
+ while (*(++ptr) != ']')
+ {
+ if (*ptr == 0) return -1;
+ if (*ptr == '\\')
+ {
+ if (*(++ptr) == 0) return -1;
+ if (*ptr == 'Q') for (;;)
+ {
+ while (*(++ptr) != 0 && *ptr != '\\');
+ if (*ptr == 0) return -1;
+ if (*(++ptr) == 'E') break;
+ }
+ continue;
+ }
+ }
+ continue;
+ }
+
+ /* Skip comments in /x mode */
+
+ if (xmode && *ptr == '#')
+ {
+ while (*(++ptr) != 0 && *ptr != '\n');
+ if (*ptr == 0) return -1;
+ continue;
+ }
+
+ /* An opening parens must now be a real metacharacter */
+
+ if (*ptr != '(') continue;
+ if (ptr[1] != '?' && ptr[1] != '*')
+ {
+ count++;
+ if (name == NULL && count == lorn) return count;
+ continue;
+ }
+
+ ptr += 2;
+ if (*ptr == 'P') ptr++; /* Allow optional P */
+
+ /* We have to disambiguate (? */
+
+ if ((*ptr != '<' || ptr[1] == '!' || ptr[1] == '=') &&
+ *ptr != '\'')
+ continue;
+
+ count++;
+
+ if (name == NULL && count == lorn) return count;
+ term = *ptr++;
+ if (term == '<') term = '>';
+ thisname = ptr;
+ while (*ptr != term) ptr++;
+ if (name != NULL && lorn == ptr - thisname &&
+ strncmp((const char *)name, (const char *)thisname, lorn) == 0)
+ return count;
+ }
+
+return -1;
+}
+
+
+
+/*************************************************
+* Find first significant op code *
+*************************************************/
+
+/* This is called by several functions that scan a compiled expression looking
+for a fixed first character, or an anchoring op code etc. It skips over things
+that do not influence this. For some calls, a change of option is important.
+For some calls, it makes sense to skip negative forward and all backward
+assertions, and also the \b assertion; for others it does not.
+
+Arguments:
+ code pointer to the start of the group
+ options pointer to external options
+ optbit the option bit whose changing is significant, or
+ zero if none are
+ skipassert TRUE if certain assertions are to be skipped
+
+Returns: pointer to the first significant opcode
+*/
+
+static const uschar*
+first_significant_code(const uschar *code, int *options, int optbit,
+ BOOL skipassert)
+{
+for (;;)
+ {
+ switch ((int)*code)
+ {
+ case OP_OPT:
+ if (optbit > 0 && ((int)code[1] & optbit) != (*options & optbit))
+ *options = (int)code[1];
+ code += 2;
+ break;
+
+ case OP_ASSERT_NOT:
+ case OP_ASSERTBACK:
+ case OP_ASSERTBACK_NOT:
+ if (!skipassert) return code;
+ do code += GET(code, 1); while (*code == OP_ALT);
+ code += _pcre_OP_lengths[*code];
+ break;
+
+ case OP_WORD_BOUNDARY:
+ case OP_NOT_WORD_BOUNDARY:
+ if (!skipassert) return code;
+ /* Fall through */
+
+ case OP_CALLOUT:
+ case OP_CREF:
+ case OP_RREF:
+ case OP_DEF:
+ code += _pcre_OP_lengths[*code];
+ break;
+
+ default:
+ return code;
+ }
+ }
+/* Control never reaches here */
+}
+
+
+
+
+/*************************************************
+* Find the fixed length of a pattern *
+*************************************************/
+
+/* Scan a pattern and compute the fixed length of subject that will match it,
+if the length is fixed. This is needed for dealing with backward assertions.
+In UTF8 mode, the result is in characters rather than bytes.
+
+Arguments:
+ code points to the start of the pattern (the bracket)
+ options the compiling options
+
+Returns: the fixed length, or -1 if there is no fixed length,
+ or -2 if \C was encountered
+*/
+
+static int
+find_fixedlength(uschar *code, int options)
+{
+int length = -1;
+
+register int branchlength = 0;
+register uschar *cc = code + 1 + LINK_SIZE;
+
+/* Scan along the opcodes for this branch. If we get to the end of the
+branch, check the length against that of the other branches. */
+
+for (;;)
+ {
+ int d;
+ register int op = *cc;
+ switch (op)
+ {
+ case OP_CBRA:
+ case OP_BRA:
+ case OP_ONCE:
+ case OP_COND:
+ d = find_fixedlength(cc + ((op == OP_CBRA)? 2:0), options);
+ if (d < 0) return d;
+ branchlength += d;
+ do cc += GET(cc, 1); while (*cc == OP_ALT);
+ cc += 1 + LINK_SIZE;
+ break;
+
+ /* Reached end of a branch; if it's a ket it is the end of a nested
+ call. If it's ALT it is an alternation in a nested call. If it is
+ END it's the end of the outer call. All can be handled by the same code. */
+
+ case OP_ALT:
+ case OP_KET:
+ case OP_KETRMAX:
+ case OP_KETRMIN:
+ case OP_END:
+ if (length < 0) length = branchlength;
+ else if (length != branchlength) return -1;
+ if (*cc != OP_ALT) return length;
+ cc += 1 + LINK_SIZE;
+ branchlength = 0;
+ break;
+
+ /* Skip over assertive subpatterns */
+
+ case OP_ASSERT:
+ case OP_ASSERT_NOT:
+ case OP_ASSERTBACK:
+ case OP_ASSERTBACK_NOT:
+ do cc += GET(cc, 1); while (*cc == OP_ALT);
+ /* Fall through */
+
+ /* Skip over things that don't match chars */
+
+ case OP_REVERSE:
+ case OP_CREF:
+ case OP_RREF:
+ case OP_DEF:
+ case OP_OPT:
+ case OP_CALLOUT:
+ case OP_SOD:
+ case OP_SOM:
+ case OP_EOD:
+ case OP_EODN:
+ case OP_CIRC:
+ case OP_DOLL:
+ case OP_NOT_WORD_BOUNDARY:
+ case OP_WORD_BOUNDARY:
+ cc += _pcre_OP_lengths[*cc];
+ break;
+
+ /* Handle literal characters */
+
+ case OP_CHAR:
+ case OP_CHARNC:
+ case OP_NOT:
+ branchlength++;
+ cc += 2;
+#ifdef SUPPORT_UTF8
+ if ((options & PCRE_UTF8) != 0)
+ {
+ while ((*cc & 0xc0) == 0x80) cc++;
+ }
+#endif
+ break;
+
+ /* Handle exact repetitions. The count is already in characters, but we
+ need to skip over a multibyte character in UTF8 mode. */
+
+ case OP_EXACT:
+ branchlength += GET2(cc,1);
+ cc += 4;
+#ifdef SUPPORT_UTF8
+ if ((options & PCRE_UTF8) != 0)
+ {
+ while((*cc & 0x80) == 0x80) cc++;
+ }
+#endif
+ break;
+
+ case OP_TYPEEXACT:
+ branchlength += GET2(cc,1);
+ if (cc[3] == OP_PROP || cc[3] == OP_NOTPROP) cc += 2;
+ cc += 4;
+ break;
+
+ /* Handle single-char matchers */
+
+ case OP_PROP:
+ case OP_NOTPROP:
+ cc += 2;
+ /* Fall through */
+
+ case OP_NOT_DIGIT:
+ case OP_DIGIT:
+ case OP_NOT_WHITESPACE:
+ case OP_WHITESPACE:
+ case OP_NOT_WORDCHAR:
+ case OP_WORDCHAR:
+ case OP_ANY:
+ branchlength++;
+ cc++;
+ break;
+
+ /* The single-byte matcher isn't allowed */
+
+ case OP_ANYBYTE:
+ return -2;
+
+ /* Check a class for variable quantification */
+
+#ifdef SUPPORT_UTF8
+ case OP_XCLASS:
+ cc += GET(cc, 1) - 33;
+ /* Fall through */
+#endif
+
+ case OP_CLASS:
+ case OP_NCLASS:
+ cc += 33;
+
+ switch (*cc)
+ {
+ case OP_CRSTAR:
+ case OP_CRMINSTAR:
+ case OP_CRQUERY:
+ case OP_CRMINQUERY:
+ return -1;
+
+ case OP_CRRANGE:
+ case OP_CRMINRANGE:
+ if (GET2(cc,1) != GET2(cc,3)) return -1;
+ branchlength += GET2(cc,1);
+ cc += 5;
+ break;
+
+ default:
+ branchlength++;
+ }
+ break;
+
+ /* Anything else is variable length */
+
+ default:
+ return -1;
+ }
+ }
+/* Control never gets here */
+}
+
+
+
+
+/*************************************************
+* Scan compiled regex for numbered bracket *
+*************************************************/
+
+/* This little function scans through a compiled pattern until it finds a
+capturing bracket with the given number.
+
+Arguments:
+ code points to start of expression
+ utf8 TRUE in UTF-8 mode
+ number the required bracket number
+
+Returns: pointer to the opcode for the bracket, or NULL if not found
+*/
+
+static const uschar *
+find_bracket(const uschar *code, BOOL utf8, int number)
+{
+for (;;)
+ {
+ register int c = *code;
+ if (c == OP_END) return NULL;
+
+ /* XCLASS is used for classes that cannot be represented just by a bit
+ map. This includes negated single high-valued characters. The length in
+ the table is zero; the actual length is stored in the compiled code. */
+
+ if (c == OP_XCLASS) code += GET(code, 1);
+
+ /* Handle capturing bracket */
+
+ else if (c == OP_CBRA)
+ {
+ int n = GET2(code, 1+LINK_SIZE);
+ if (n == number) return (uschar *)code;
+ code += _pcre_OP_lengths[c];
+ }
+
+ /* Otherwise, we can get the item's length from the table, except that for
+ repeated character types, we have to test for \p and \P, which have an extra
+ two bytes of parameters. */
+
+ else
+ {
+ switch(c)
+ {
+ case OP_TYPESTAR:
+ case OP_TYPEMINSTAR:
+ case OP_TYPEPLUS:
+ case OP_TYPEMINPLUS:
+ case OP_TYPEQUERY:
+ case OP_TYPEMINQUERY:
+ case OP_TYPEPOSSTAR:
+ case OP_TYPEPOSPLUS:
+ case OP_TYPEPOSQUERY:
+ if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
+ break;
+
+ case OP_TYPEUPTO:
+ case OP_TYPEMINUPTO:
+ case OP_TYPEEXACT:
+ case OP_TYPEPOSUPTO:
+ if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
+ break;
+ }
+
+ /* Add in the fixed length from the table */
+
+ code += _pcre_OP_lengths[c];
+
+ /* In UTF-8 mode, opcodes that are followed by a character may be followed by
+ a multi-byte character. The length in the table is a minimum, so we have to
+ arrange to skip the extra bytes. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8) switch(c)
+ {
+ case OP_CHAR:
+ case OP_CHARNC:
+ case OP_EXACT:
+ case OP_UPTO:
+ case OP_MINUPTO:
+ case OP_POSUPTO:
+ case OP_STAR:
+ case OP_MINSTAR:
+ case OP_POSSTAR:
+ case OP_PLUS:
+ case OP_MINPLUS:
+ case OP_POSPLUS:
+ case OP_QUERY:
+ case OP_MINQUERY:
+ case OP_POSQUERY:
+ if (code[-1] >= 0xc0) code += _pcre_utf8_table4[code[-1] & 0x3f];
+ break;
+ }
+#endif
+ }
+ }
+}
+
+
+
+/*************************************************
+* Scan compiled regex for recursion reference *
+*************************************************/
+
+/* This little function scans through a compiled pattern until it finds an
+instance of OP_RECURSE.
+
+Arguments:
+ code points to start of expression
+ utf8 TRUE in UTF-8 mode
+
+Returns: pointer to the opcode for OP_RECURSE, or NULL if not found
+*/
+
+static const uschar *
+find_recurse(const uschar *code, BOOL utf8)
+{
+for (;;)
+ {
+ register int c = *code;
+ if (c == OP_END) return NULL;
+ if (c == OP_RECURSE) return code;
+
+ /* XCLASS is used for classes that cannot be represented just by a bit
+ map. This includes negated single high-valued characters. The length in
+ the table is zero; the actual length is stored in the compiled code. */
+
+ if (c == OP_XCLASS) code += GET(code, 1);
+
+ /* Otherwise, we can get the item's length from the table, except that for
+ repeated character types, we have to test for \p and \P, which have an extra
+ two bytes of parameters. */
+
+ else
+ {
+ switch(c)
+ {
+ case OP_TYPESTAR:
+ case OP_TYPEMINSTAR:
+ case OP_TYPEPLUS:
+ case OP_TYPEMINPLUS:
+ case OP_TYPEQUERY:
+ case OP_TYPEMINQUERY:
+ case OP_TYPEPOSSTAR:
+ case OP_TYPEPOSPLUS:
+ case OP_TYPEPOSQUERY:
+ if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
+ break;
+
+ case OP_TYPEPOSUPTO:
+ case OP_TYPEUPTO:
+ case OP_TYPEMINUPTO:
+ case OP_TYPEEXACT:
+ if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
+ break;
+ }
+
+ /* Add in the fixed length from the table */
+
+ code += _pcre_OP_lengths[c];
+
+ /* In UTF-8 mode, opcodes that are followed by a character may be followed
+ by a multi-byte character. The length in the table is a minimum, so we have
+ to arrange to skip the extra bytes. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8) switch(c)
+ {
+ case OP_CHAR:
+ case OP_CHARNC:
+ case OP_EXACT:
+ case OP_UPTO:
+ case OP_MINUPTO:
+ case OP_POSUPTO:
+ case OP_STAR:
+ case OP_MINSTAR:
+ case OP_POSSTAR:
+ case OP_PLUS:
+ case OP_MINPLUS:
+ case OP_POSPLUS:
+ case OP_QUERY:
+ case OP_MINQUERY:
+ case OP_POSQUERY:
+ if (code[-1] >= 0xc0) code += _pcre_utf8_table4[code[-1] & 0x3f];
+ break;
+ }
+#endif
+ }
+ }
+}
+
+
+
+/*************************************************
+* Scan compiled branch for non-emptiness *
+*************************************************/
+
+/* This function scans through a branch of a compiled pattern to see whether it
+can match the empty string or not. It is called from could_be_empty()
+below and from compile_branch() when checking for an unlimited repeat of a
+group that can match nothing. Note that first_significant_code() skips over
+assertions. If we hit an unclosed bracket, we return "empty" - this means we've
+struck an inner bracket whose current branch will already have been scanned.
+
+Arguments:
+ code points to start of search
+ endcode points to where to stop
+ utf8 TRUE if in UTF8 mode
+
+Returns: TRUE if what is matched could be empty
+*/
+
+static BOOL
+could_be_empty_branch(const uschar *code, const uschar *endcode, BOOL utf8)
+{
+register int c;
+for (code = first_significant_code(code + _pcre_OP_lengths[*code], NULL, 0, TRUE);
+ code < endcode;
+ code = first_significant_code(code + _pcre_OP_lengths[c], NULL, 0, TRUE))
+ {
+ const uschar *ccode;
+
+ c = *code;
+
+ /* Groups with zero repeats can of course be empty; skip them. */
+
+ if (c == OP_BRAZERO || c == OP_BRAMINZERO)
+ {
+ code += _pcre_OP_lengths[c];
+ do code += GET(code, 1); while (*code == OP_ALT);
+ c = *code;
+ continue;
+ }
+
+ /* For other groups, scan the branches. */
+
+ if (c == OP_BRA || c == OP_CBRA || c == OP_ONCE || c == OP_COND)
+ {
+ BOOL empty_branch;
+ if (GET(code, 1) == 0) return TRUE; /* Hit unclosed bracket */
+
+ /* Scan a closed bracket */
+
+ empty_branch = FALSE;
+ do
+ {
+ if (!empty_branch && could_be_empty_branch(code, endcode, utf8))
+ empty_branch = TRUE;
+ code += GET(code, 1);
+ }
+ while (*code == OP_ALT);
+ if (!empty_branch) return FALSE; /* All branches are non-empty */
+ c = *code;
+ continue;
+ }
+
+ /* Handle the other opcodes */
+
+ switch (c)
+ {
+ /* Check for quantifiers after a class. XCLASS is used for classes that
+ cannot be represented just by a bit map. This includes negated single
+ high-valued characters. The length in _pcre_OP_lengths[] is zero; the
+ actual length is stored in the compiled code, so we must update "code"
+ here. */
+
+#ifdef SUPPORT_UTF8
+ case OP_XCLASS:
+ ccode = code += GET(code, 1);
+ goto CHECK_CLASS_REPEAT;
+#endif
+
+ case OP_CLASS:
+ case OP_NCLASS:
+ ccode = code + 33;
+
+#ifdef SUPPORT_UTF8
+ CHECK_CLASS_REPEAT:
+#endif
+
+ switch (*ccode)
+ {
+ case OP_CRSTAR: /* These could be empty; continue */
+ case OP_CRMINSTAR:
+ case OP_CRQUERY:
+ case OP_CRMINQUERY:
+ break;
+
+ default: /* Non-repeat => class must match */
+ case OP_CRPLUS: /* These repeats aren't empty */
+ case OP_CRMINPLUS:
+ return FALSE;
+
+ case OP_CRRANGE:
+ case OP_CRMINRANGE:
+ if (GET2(ccode, 1) > 0) return FALSE; /* Minimum > 0 */
+ break;
+ }
+ break;
+
+ /* Opcodes that must match a character */
+
+ case OP_PROP:
+ case OP_NOTPROP:
+ case OP_EXTUNI:
+ case OP_NOT_DIGIT:
+ case OP_DIGIT:
+ case OP_NOT_WHITESPACE:
+ case OP_WHITESPACE:
+ case OP_NOT_WORDCHAR:
+ case OP_WORDCHAR:
+ case OP_ANY:
+ case OP_ANYBYTE:
+ case OP_CHAR:
+ case OP_CHARNC:
+ case OP_NOT:
+ case OP_PLUS:
+ case OP_MINPLUS:
+ case OP_POSPLUS:
+ case OP_EXACT:
+ case OP_NOTPLUS:
+ case OP_NOTMINPLUS:
+ case OP_NOTPOSPLUS:
+ case OP_NOTEXACT:
+ case OP_TYPEPLUS:
+ case OP_TYPEMINPLUS:
+ case OP_TYPEPOSPLUS:
+ case OP_TYPEEXACT:
+ return FALSE;
+
+ /* These are going to continue, as they may be empty, but we have to
+ fudge the length for the \p and \P cases. */
+
+ case OP_TYPESTAR:
+ case OP_TYPEMINSTAR:
+ case OP_TYPEPOSSTAR:
+ case OP_TYPEQUERY:
+ case OP_TYPEMINQUERY:
+ case OP_TYPEPOSQUERY:
+ if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
+ break;
+
+ /* Same for these */
+
+ case OP_TYPEUPTO:
+ case OP_TYPEMINUPTO:
+ case OP_TYPEPOSUPTO:
+ if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
+ break;
+
+ /* End of branch */
+
+ case OP_KET:
+ case OP_KETRMAX:
+ case OP_KETRMIN:
+ case OP_ALT:
+ return TRUE;
+
+ /* In UTF-8 mode, STAR, MINSTAR, POSSTAR, QUERY, MINQUERY, POSQUERY, UPTO,
+ MINUPTO, and POSUPTO may be followed by a multibyte character */
+
+#ifdef SUPPORT_UTF8
+ case OP_STAR:
+ case OP_MINSTAR:
+ case OP_POSSTAR:
+ case OP_QUERY:
+ case OP_MINQUERY:
+ case OP_POSQUERY:
+ case OP_UPTO:
+ case OP_MINUPTO:
+ case OP_POSUPTO:
+ if (utf8) while ((code[2] & 0xc0) == 0x80) code++;
+ break;
+#endif
+ }
+ }
+
+return TRUE;
+}
+
+
+
+/*************************************************
+* Scan compiled regex for non-emptiness *
+*************************************************/
+
+/* This function is called to check for left recursive calls. We want to check
+the current branch of the current pattern to see if it could match the empty
+string. If it could, we must look outwards for branches at other levels,
+stopping when we pass beyond the bracket which is the subject of the recursion.
+
+Arguments:
+ code points to start of the recursion
+ endcode points to where to stop (current RECURSE item)
+ bcptr points to the chain of current (unclosed) branch starts
+ utf8 TRUE if in UTF-8 mode
+
+Returns: TRUE if what is matched could be empty
+*/
+
+static BOOL
+could_be_empty(const uschar *code, const uschar *endcode, branch_chain *bcptr,
+ BOOL utf8)
+{
+while (bcptr != NULL && bcptr->current >= code)
+ {
+ if (!could_be_empty_branch(bcptr->current, endcode, utf8)) return FALSE;
+ bcptr = bcptr->outer;
+ }
+return TRUE;
+}
+
+
+
+/*************************************************
+* Check for POSIX class syntax *
+*************************************************/
+
+/* This function is called when the sequence "[:" or "[." or "[=" is
+encountered in a character class. It checks whether this is followed by an
+optional ^ and then a sequence of letters, terminated by a matching ":]" or
+".]" or "=]".
+
+Argument:
+ ptr pointer to the initial [
+ endptr where to return the end pointer
+ cd pointer to compile data
+
+Returns: TRUE or FALSE
+*/
+
+static BOOL
+check_posix_syntax(const uschar *ptr, const uschar **endptr, compile_data *cd)
+{
+int terminator; /* Don't combine these lines; the Solaris cc */
+terminator = *(++ptr); /* compiler warns about "non-constant" initializer. */
+if (*(++ptr) == '^') ptr++;
+while ((cd->ctypes[*ptr] & ctype_letter) != 0) ptr++;
+if (*ptr == terminator && ptr[1] == ']')
+ {
+ *endptr = ptr;
+ return TRUE;
+ }
+return FALSE;
+}
+
+
+
+
+/*************************************************
+* Check POSIX class name *
+*************************************************/
+
+/* This function is called to check the name given in a POSIX-style class entry
+such as [:alnum:].
+
+Arguments:
+ ptr points to the first letter
+ len the length of the name
+
+Returns: a value representing the name, or -1 if unknown
+*/
+
+static int
+check_posix_name(const uschar *ptr, int len)
+{
+const char *pn = posix_names;
+register int yield = 0;
+while (posix_name_lengths[yield] != 0)
+ {
+ if (len == posix_name_lengths[yield] &&
+ strncmp((const char *)ptr, pn, len) == 0) return yield;
+ pn += posix_name_lengths[yield] + 1;
+ yield++;
+ }
+return -1;
+}
+
+
+/*************************************************
+* Adjust OP_RECURSE items in repeated group *
+*************************************************/
+
+/* OP_RECURSE items contain an offset from the start of the regex to the group
+that is referenced. This means that groups can be replicated for fixed
+repetition simply by copying (because the recursion is allowed to refer to
+earlier groups that are outside the current group). However, when a group is
+optional (i.e. the minimum quantifier is zero), OP_BRAZERO is inserted before
+it, after it has been compiled. This means that any OP_RECURSE items within it
+that refer to the group itself or any contained groups have to have their
+offsets adjusted. That one of the jobs of this function. Before it is called,
+the partially compiled regex must be temporarily terminated with OP_END.
+
+This function has been extended with the possibility of forward references for
+recursions and subroutine calls. It must also check the list of such references
+for the group we are dealing with. If it finds that one of the recursions in
+the current group is on this list, it adjusts the offset in the list, not the
+value in the reference (which is a group number).
+
+Arguments:
+ group points to the start of the group
+ adjust the amount by which the group is to be moved
+ utf8 TRUE in UTF-8 mode
+ cd contains pointers to tables etc.
+ save_hwm the hwm forward reference pointer at the start of the group
+
+Returns: nothing
+*/
+
+static void
+adjust_recurse(uschar *group, int adjust, BOOL utf8, compile_data *cd,
+ uschar *save_hwm)
+{
+uschar *ptr = group;
+
+while ((ptr = (uschar *)find_recurse(ptr, utf8)) != NULL)
+ {
+ int offset;
+ uschar *hc;
+
+ /* See if this recursion is on the forward reference list. If so, adjust the
+ reference. */
+
+ for (hc = save_hwm; hc < cd->hwm; hc += LINK_SIZE)
+ {
+ offset = GET(hc, 0);
+ if (cd->start_code + offset == ptr + 1)
+ {
+ PUT(hc, 0, offset + adjust);
+ break;
+ }
+ }
+
+ /* Otherwise, adjust the recursion offset if it's after the start of this
+ group. */
+
+ if (hc >= cd->hwm)
+ {
+ offset = GET(ptr, 1);
+ if (cd->start_code + offset >= group) PUT(ptr, 1, offset + adjust);
+ }
+
+ ptr += 1 + LINK_SIZE;
+ }
+}
+
+
+
+/*************************************************
+* Insert an automatic callout point *
+*************************************************/
+
+/* This function is called when the PCRE_AUTO_CALLOUT option is set, to insert
+callout points before each pattern item.
+
+Arguments:
+ code current code pointer
+ ptr current pattern pointer
+ cd pointers to tables etc
+
+Returns: new code pointer
+*/
+
+static uschar *
+auto_callout(uschar *code, const uschar *ptr, compile_data *cd)
+{
+*code++ = OP_CALLOUT;
+*code++ = 255;
+PUT(code, 0, ptr - cd->start_pattern); /* Pattern offset */
+PUT(code, LINK_SIZE, 0); /* Default length */
+return code + 2*LINK_SIZE;
+}
+
+
+
+/*************************************************
+* Complete a callout item *
+*************************************************/
+
+/* A callout item contains the length of the next item in the pattern, which
+we can't fill in till after we have reached the relevant point. This is used
+for both automatic and manual callouts.
+
+Arguments:
+ previous_callout points to previous callout item
+ ptr current pattern pointer
+ cd pointers to tables etc
+
+Returns: nothing
+*/
+
+static void
+complete_callout(uschar *previous_callout, const uschar *ptr, compile_data *cd)
+{
+int length = ptr - cd->start_pattern - GET(previous_callout, 2);
+PUT(previous_callout, 2 + LINK_SIZE, length);
+}
+
+
+
+#ifdef SUPPORT_UCP
+/*************************************************
+* Get othercase range *
+*************************************************/
+
+/* This function is passed the start and end of a class range, in UTF-8 mode
+with UCP support. It searches up the characters, looking for internal ranges of
+characters in the "other" case. Each call returns the next one, updating the
+start address.
+
+Arguments:
+ cptr points to starting character value; updated
+ d end value
+ ocptr where to put start of othercase range
+ odptr where to put end of othercase range
+
+Yield: TRUE when range returned; FALSE when no more
+*/
+
+static BOOL
+get_othercase_range(unsigned int *cptr, unsigned int d, unsigned int *ocptr,
+ unsigned int *odptr)
+{
+unsigned int c, othercase, next;
+
+for (c = *cptr; c <= d; c++)
+ { if ((othercase = _pcre_ucp_othercase(c)) != NOTACHAR) break; }
+
+if (c > d) return FALSE;
+
+*ocptr = othercase;
+next = othercase + 1;
+
+for (++c; c <= d; c++)
+ {
+ if (_pcre_ucp_othercase(c) != next) break;
+ next++;
+ }
+
+*odptr = next - 1;
+*cptr = c;
+
+return TRUE;
+}
+#endif /* SUPPORT_UCP */
+
+
+
+/*************************************************
+* Check if auto-possessifying is possible *
+*************************************************/
+
+/* This function is called for unlimited repeats of certain items, to see
+whether the next thing could possibly match the repeated item. If not, it makes
+sense to automatically possessify the repeated item.
+
+Arguments:
+ op_code the repeated op code
+ this data for this item, depends on the opcode
+ utf8 TRUE in UTF-8 mode
+ utf8_char used for utf8 character bytes, NULL if not relevant
+ ptr next character in pattern
+ options options bits
+ cd contains pointers to tables etc.
+
+Returns: TRUE if possessifying is wanted
+*/
+
+static BOOL
+check_auto_possessive(int op_code, int item, BOOL utf8, uschar *utf8_char,
+ const uschar *ptr, int options, compile_data *cd)
+{
+int next;
+
+/* Skip whitespace and comments in extended mode */
+
+if ((options & PCRE_EXTENDED) != 0)
+ {
+ for (;;)
+ {
+ while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++;
+ if (*ptr == '#')
+ {
+ while (*(++ptr) != 0)
+ if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; }
+ }
+ else break;
+ }
+ }
+
+/* If the next item is one that we can handle, get its value. A non-negative
+value is a character, a negative value is an escape value. */
+
+if (*ptr == '\\')
+ {
+ int temperrorcode = 0;
+ next = check_escape(&ptr, &temperrorcode, cd->bracount, options, FALSE);
+ if (temperrorcode != 0) return FALSE;
+ ptr++; /* Point after the escape sequence */
+ }
+
+else if ((cd->ctypes[*ptr] & ctype_meta) == 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8) { GETCHARINC(next, ptr); } else
+#endif
+ next = *ptr++;
+ }
+
+else return FALSE;
+
+/* Skip whitespace and comments in extended mode */
+
+if ((options & PCRE_EXTENDED) != 0)
+ {
+ for (;;)
+ {
+ while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++;
+ if (*ptr == '#')
+ {
+ while (*(++ptr) != 0)
+ if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; }
+ }
+ else break;
+ }
+ }
+
+/* If the next thing is itself optional, we have to give up. */
+
+if (*ptr == '*' || *ptr == '?' || strncmp((char *)ptr, "{0,", 3) == 0)
+ return FALSE;
+
+/* Now compare the next item with the previous opcode. If the previous is a
+positive single character match, "item" either contains the character or, if
+"item" is greater than 127 in utf8 mode, the character's bytes are in
+utf8_char. */
+
+
+/* Handle cases when the next item is a character. */
+
+if (next >= 0) switch(op_code)
+ {
+ case OP_CHAR:
+#ifdef SUPPORT_UTF8
+ if (utf8 && item > 127) { GETCHAR(item, utf8_char); }
+#endif
+ return item != next;
+
+ /* For CHARNC (caseless character) we must check the other case. If we have
+ Unicode property support, we can use it to test the other case of
+ high-valued characters. */
+
+ case OP_CHARNC:
+#ifdef SUPPORT_UTF8
+ if (utf8 && item > 127) { GETCHAR(item, utf8_char); }
+#endif
+ if (item == next) return FALSE;
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ unsigned int othercase;
+ if (next < 128) othercase = cd->fcc[next]; else
+#ifdef SUPPORT_UCP
+ othercase = _pcre_ucp_othercase((unsigned int)next);
+#else
+ othercase = NOTACHAR;
+#endif
+ return (unsigned int)item != othercase;
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+ return (item != cd->fcc[next]); /* Non-UTF-8 mode */
+
+ /* For OP_NOT, "item" must be a single-byte character. */
+
+ case OP_NOT:
+ if (next < 0) return FALSE; /* Not a character */
+ if (item == next) return TRUE;
+ if ((options & PCRE_CASELESS) == 0) return FALSE;
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ unsigned int othercase;
+ if (next < 128) othercase = cd->fcc[next]; else
+#ifdef SUPPORT_UCP
+ othercase = _pcre_ucp_othercase(next);
+#else
+ othercase = NOTACHAR;
+#endif
+ return (unsigned int)item == othercase;
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+ return (item == cd->fcc[next]); /* Non-UTF-8 mode */
+
+ case OP_DIGIT:
+ return next > 127 || (cd->ctypes[next] & ctype_digit) == 0;
+
+ case OP_NOT_DIGIT:
+ return next <= 127 && (cd->ctypes[next] & ctype_digit) != 0;
+
+ case OP_WHITESPACE:
+ return next > 127 || (cd->ctypes[next] & ctype_space) == 0;
+
+ case OP_NOT_WHITESPACE:
+ return next <= 127 && (cd->ctypes[next] & ctype_space) != 0;
+
+ case OP_WORDCHAR:
+ return next > 127 || (cd->ctypes[next] & ctype_word) == 0;
+
+ case OP_NOT_WORDCHAR:
+ return next <= 127 && (cd->ctypes[next] & ctype_word) != 0;
+
+ case OP_HSPACE:
+ case OP_NOT_HSPACE:
+ switch(next)
+ {
+ case 0x09:
+ case 0x20:
+ case 0xa0:
+ case 0x1680:
+ case 0x180e:
+ case 0x2000:
+ case 0x2001:
+ case 0x2002:
+ case 0x2003:
+ case 0x2004:
+ case 0x2005:
+ case 0x2006:
+ case 0x2007:
+ case 0x2008:
+ case 0x2009:
+ case 0x200A:
+ case 0x202f:
+ case 0x205f:
+ case 0x3000:
+ return op_code != OP_HSPACE;
+ default:
+ return op_code == OP_HSPACE;
+ }
+
+ case OP_VSPACE:
+ case OP_NOT_VSPACE:
+ switch(next)
+ {
+ case 0x0a:
+ case 0x0b:
+ case 0x0c:
+ case 0x0d:
+ case 0x85:
+ case 0x2028:
+ case 0x2029:
+ return op_code != OP_VSPACE;
+ default:
+ return op_code == OP_VSPACE;
+ }
+
+ default:
+ return FALSE;
+ }
+
+
+/* Handle the case when the next item is \d, \s, etc. */
+
+switch(op_code)
+ {
+ case OP_CHAR:
+ case OP_CHARNC:
+#ifdef SUPPORT_UTF8
+ if (utf8 && item > 127) { GETCHAR(item, utf8_char); }
+#endif
+ switch(-next)
+ {
+ case ESC_d:
+ return item > 127 || (cd->ctypes[item] & ctype_digit) == 0;
+
+ case ESC_D:
+ return item <= 127 && (cd->ctypes[item] & ctype_digit) != 0;
+
+ case ESC_s:
+ return item > 127 || (cd->ctypes[item] & ctype_space) == 0;
+
+ case ESC_S:
+ return item <= 127 && (cd->ctypes[item] & ctype_space) != 0;
+
+ case ESC_w:
+ return item > 127 || (cd->ctypes[item] & ctype_word) == 0;
+
+ case ESC_W:
+ return item <= 127 && (cd->ctypes[item] & ctype_word) != 0;
+
+ case ESC_h:
+ case ESC_H:
+ switch(item)
+ {
+ case 0x09:
+ case 0x20:
+ case 0xa0:
+ case 0x1680:
+ case 0x180e:
+ case 0x2000:
+ case 0x2001:
+ case 0x2002:
+ case 0x2003:
+ case 0x2004:
+ case 0x2005:
+ case 0x2006:
+ case 0x2007:
+ case 0x2008:
+ case 0x2009:
+ case 0x200A:
+ case 0x202f:
+ case 0x205f:
+ case 0x3000:
+ return -next != ESC_h;
+ default:
+ return -next == ESC_h;
+ }
+
+ case ESC_v:
+ case ESC_V:
+ switch(item)
+ {
+ case 0x0a:
+ case 0x0b:
+ case 0x0c:
+ case 0x0d:
+ case 0x85:
+ case 0x2028:
+ case 0x2029:
+ return -next != ESC_v;
+ default:
+ return -next == ESC_v;
+ }
+
+ default:
+ return FALSE;
+ }
+
+ case OP_DIGIT:
+ return next == -ESC_D || next == -ESC_s || next == -ESC_W ||
+ next == -ESC_h || next == -ESC_v;
+
+ case OP_NOT_DIGIT:
+ return next == -ESC_d;
+
+ case OP_WHITESPACE:
+ return next == -ESC_S || next == -ESC_d || next == -ESC_w;
+
+ case OP_NOT_WHITESPACE:
+ return next == -ESC_s || next == -ESC_h || next == -ESC_v;
+
+ case OP_HSPACE:
+ return next == -ESC_S || next == -ESC_H || next == -ESC_d || next == -ESC_w;
+
+ case OP_NOT_HSPACE:
+ return next == -ESC_h;
+
+ /* Can't have \S in here because VT matches \S (Perl anomaly) */
+ case OP_VSPACE:
+ return next == -ESC_V || next == -ESC_d || next == -ESC_w;
+
+ case OP_NOT_VSPACE:
+ return next == -ESC_v;
+
+ case OP_WORDCHAR:
+ return next == -ESC_W || next == -ESC_s || next == -ESC_h || next == -ESC_v;
+
+ case OP_NOT_WORDCHAR:
+ return next == -ESC_w || next == -ESC_d;
+
+ default:
+ return FALSE;
+ }
+
+/* Control does not reach here */
+}
+
+
+
+/*************************************************
+* Compile one branch *
+*************************************************/
+
+/* Scan the pattern, compiling it into the a vector. If the options are
+changed during the branch, the pointer is used to change the external options
+bits. This function is used during the pre-compile phase when we are trying
+to find out the amount of memory needed, as well as during the real compile
+phase. The value of lengthptr distinguishes the two phases.
+
+Arguments:
+ optionsptr pointer to the option bits
+ codeptr points to the pointer to the current code point
+ ptrptr points to the current pattern pointer
+ errorcodeptr points to error code variable
+ firstbyteptr set to initial literal character, or < 0 (REQ_UNSET, REQ_NONE)
+ reqbyteptr set to the last literal character required, else < 0
+ bcptr points to current branch chain
+ cd contains pointers to tables etc.
+ lengthptr NULL during the real compile phase
+ points to length accumulator during pre-compile phase
+
+Returns: TRUE on success
+ FALSE, with *errorcodeptr set non-zero on error
+*/
+
+static BOOL
+compile_branch(int *optionsptr, uschar **codeptr, const uschar **ptrptr,
+ int *errorcodeptr, int *firstbyteptr, int *reqbyteptr, branch_chain *bcptr,
+ compile_data *cd, int *lengthptr)
+{
+int repeat_type, op_type;
+int repeat_min = 0, repeat_max = 0; /* To please picky compilers */
+int bravalue = 0;
+int greedy_default, greedy_non_default;
+int firstbyte, reqbyte;
+int zeroreqbyte, zerofirstbyte;
+int req_caseopt, reqvary, tempreqvary;
+int options = *optionsptr;
+int after_manual_callout = 0;
+int length_prevgroup = 0;
+register int c;
+register uschar *code = *codeptr;
+uschar *last_code = code;
+uschar *orig_code = code;
+uschar *tempcode;
+BOOL inescq = FALSE;
+BOOL groupsetfirstbyte = FALSE;
+const uschar *ptr = *ptrptr;
+const uschar *tempptr;
+uschar *previous = NULL;
+uschar *previous_callout = NULL;
+uschar *save_hwm = NULL;
+uschar classbits[32];
+
+#ifdef SUPPORT_UTF8
+BOOL class_utf8;
+BOOL utf8 = (options & PCRE_UTF8) != 0;
+uschar *class_utf8data;
+uschar utf8_char[6];
+#else
+BOOL utf8 = FALSE;
+uschar *utf8_char = NULL;
+#endif
+
+#ifdef DEBUG
+if (lengthptr != NULL) DPRINTF((">> start branch\n"));
+#endif
+
+/* Set up the default and non-default settings for greediness */
+
+greedy_default = ((options & PCRE_UNGREEDY) != 0);
+greedy_non_default = greedy_default ^ 1;
+
+/* Initialize no first byte, no required byte. REQ_UNSET means "no char
+matching encountered yet". It gets changed to REQ_NONE if we hit something that
+matches a non-fixed char first char; reqbyte just remains unset if we never
+find one.
+
+When we hit a repeat whose minimum is zero, we may have to adjust these values
+to take the zero repeat into account. This is implemented by setting them to
+zerofirstbyte and zeroreqbyte when such a repeat is encountered. The individual
+item types that can be repeated set these backoff variables appropriately. */
+
+firstbyte = reqbyte = zerofirstbyte = zeroreqbyte = REQ_UNSET;
+
+/* The variable req_caseopt contains either the REQ_CASELESS value or zero,
+according to the current setting of the caseless flag. REQ_CASELESS is a bit
+value > 255. It is added into the firstbyte or reqbyte variables to record the
+case status of the value. This is used only for ASCII characters. */
+
+req_caseopt = ((options & PCRE_CASELESS) != 0)? REQ_CASELESS : 0;
+
+/* Switch on next character until the end of the branch */
+
+for (;; ptr++)
+ {
+ BOOL negate_class;
+ BOOL possessive_quantifier;
+ BOOL is_quantifier;
+ BOOL is_recurse;
+ BOOL reset_bracount;
+ int class_charcount;
+ int class_lastchar;
+ int newoptions;
+ int recno;
+ int refsign;
+ int skipbytes;
+ int subreqbyte;
+ int subfirstbyte;
+ int terminator;
+ int mclength;
+ uschar mcbuffer[8];
+
+ /* Get next byte in the pattern */
+
+ c = *ptr;
+
+ /* If we are in the pre-compile phase, accumulate the length used for the
+ previous cycle of this loop. */
+
+ if (lengthptr != NULL)
+ {
+#ifdef DEBUG
+ if (code > cd->hwm) cd->hwm = code; /* High water info */
+#endif
+ if (code > cd->start_workspace + COMPILE_WORK_SIZE) /* Check for overrun */
+ {
+ *errorcodeptr = ERR52;
+ goto FAILED;
+ }
+
+ /* There is at least one situation where code goes backwards: this is the
+ case of a zero quantifier after a class (e.g. [ab]{0}). At compile time,
+ the class is simply eliminated. However, it is created first, so we have to
+ allow memory for it. Therefore, don't ever reduce the length at this point.
+ */
+
+ if (code < last_code) code = last_code;
+
+ /* Paranoid check for integer overflow */
+
+ if (OFLOW_MAX - *lengthptr < code - last_code)
+ {
+ *errorcodeptr = ERR20;
+ goto FAILED;
+ }
+
+ *lengthptr += code - last_code;
+ DPRINTF(("length=%d added %d c=%c\n", *lengthptr, code - last_code, c));
+
+ /* If "previous" is set and it is not at the start of the work space, move
+ it back to there, in order to avoid filling up the work space. Otherwise,
+ if "previous" is NULL, reset the current code pointer to the start. */
+
+ if (previous != NULL)
+ {
+ if (previous > orig_code)
+ {
+ memmove(orig_code, previous, code - previous);
+ code -= previous - orig_code;
+ previous = orig_code;
+ }
+ }
+ else code = orig_code;
+
+ /* Remember where this code item starts so we can pick up the length
+ next time round. */
+
+ last_code = code;
+ }
+
+ /* In the real compile phase, just check the workspace used by the forward
+ reference list. */
+
+ else if (cd->hwm > cd->start_workspace + COMPILE_WORK_SIZE)
+ {
+ *errorcodeptr = ERR52;
+ goto FAILED;
+ }
+
+ /* If in \Q...\E, check for the end; if not, we have a literal */
+
+ if (inescq && c != 0)
+ {
+ if (c == '\\' && ptr[1] == 'E')
+ {
+ inescq = FALSE;
+ ptr++;
+ continue;
+ }
+ else
+ {
+ if (previous_callout != NULL)
+ {
+ if (lengthptr == NULL) /* Don't attempt in pre-compile phase */
+ complete_callout(previous_callout, ptr, cd);
+ previous_callout = NULL;
+ }
+ if ((options & PCRE_AUTO_CALLOUT) != 0)
+ {
+ previous_callout = code;
+ code = auto_callout(code, ptr, cd);
+ }
+ goto NORMAL_CHAR;
+ }
+ }
+
+ /* Fill in length of a previous callout, except when the next thing is
+ a quantifier. */
+
+ is_quantifier = c == '*' || c == '+' || c == '?' ||
+ (c == '{' && is_counted_repeat(ptr+1));
+
+ if (!is_quantifier && previous_callout != NULL &&
+ after_manual_callout-- <= 0)
+ {
+ if (lengthptr == NULL) /* Don't attempt in pre-compile phase */
+ complete_callout(previous_callout, ptr, cd);
+ previous_callout = NULL;
+ }
+
+ /* In extended mode, skip white space and comments */
+
+ if ((options & PCRE_EXTENDED) != 0)
+ {
+ if ((cd->ctypes[c] & ctype_space) != 0) continue;
+ if (c == '#')
+ {
+ while (*(++ptr) != 0)
+ {
+ if (IS_NEWLINE(ptr)) { ptr += cd->nllen - 1; break; }
+ }
+ if (*ptr != 0) continue;
+
+ /* Else fall through to handle end of string */
+ c = 0;
+ }
+ }
+
+ /* No auto callout for quantifiers. */
+
+ if ((options & PCRE_AUTO_CALLOUT) != 0 && !is_quantifier)
+ {
+ previous_callout = code;
+ code = auto_callout(code, ptr, cd);
+ }
+
+ switch(c)
+ {
+ /* ===================================================================*/
+ case 0: /* The branch terminates at string end */
+ case '|': /* or | or ) */
+ case ')':
+ *firstbyteptr = firstbyte;
+ *reqbyteptr = reqbyte;
+ *codeptr = code;
+ *ptrptr = ptr;
+ if (lengthptr != NULL)
+ {
+ if (OFLOW_MAX - *lengthptr < code - last_code)
+ {
+ *errorcodeptr = ERR20;
+ goto FAILED;
+ }
+ *lengthptr += code - last_code; /* To include callout length */
+ DPRINTF((">> end branch\n"));
+ }
+ return TRUE;
+
+
+ /* ===================================================================*/
+ /* Handle single-character metacharacters. In multiline mode, ^ disables
+ the setting of any following char as a first character. */
+
+ case '^':
+ if ((options & PCRE_MULTILINE) != 0)
+ {
+ if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+ }
+ previous = NULL;
+ *code++ = OP_CIRC;
+ break;
+
+ case '$':
+ previous = NULL;
+ *code++ = OP_DOLL;
+ break;
+
+ /* There can never be a first char if '.' is first, whatever happens about
+ repeats. The value of reqbyte doesn't change either. */
+
+ case '.':
+ if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+ zerofirstbyte = firstbyte;
+ zeroreqbyte = reqbyte;
+ previous = code;
+ *code++ = OP_ANY;
+ break;
+
+
+ /* ===================================================================*/
+ /* Character classes. If the included characters are all < 256, we build a
+ 32-byte bitmap of the permitted characters, except in the special case
+ where there is only one such character. For negated classes, we build the
+ map as usual, then invert it at the end. However, we use a different opcode
+ so that data characters > 255 can be handled correctly.
+
+ If the class contains characters outside the 0-255 range, a different
+ opcode is compiled. It may optionally have a bit map for characters < 256,
+ but those above are are explicitly listed afterwards. A flag byte tells
+ whether the bitmap is present, and whether this is a negated class or not.
+ */
+
+ case '[':
+ previous = code;
+
+ /* PCRE supports POSIX class stuff inside a class. Perl gives an error if
+ they are encountered at the top level, so we'll do that too. */
+
+ if ((ptr[1] == ':' || ptr[1] == '.' || ptr[1] == '=') &&
+ check_posix_syntax(ptr, &tempptr, cd))
+ {
+ *errorcodeptr = (ptr[1] == ':')? ERR13 : ERR31;
+ goto FAILED;
+ }
+
+ /* If the first character is '^', set the negation flag and skip it. Also,
+ if the first few characters (either before or after ^) are \Q\E or \E we
+ skip them too. This makes for compatibility with Perl. */
+
+ negate_class = FALSE;
+ for (;;)
+ {
+ c = *(++ptr);
+ if (c == '\\')
+ {
+ if (ptr[1] == 'E') ptr++;
+ else if (strncmp((const char *)ptr+1, "Q\\E", 3) == 0) ptr += 3;
+ else break;
+ }
+ else if (!negate_class && c == '^')
+ negate_class = TRUE;
+ else break;
+ }
+
+ /* Keep a count of chars with values < 256 so that we can optimize the case
+ of just a single character (as long as it's < 256). However, For higher
+ valued UTF-8 characters, we don't yet do any optimization. */
+
+ class_charcount = 0;
+ class_lastchar = -1;
+
+ /* Initialize the 32-char bit map to all zeros. We build the map in a
+ temporary bit of memory, in case the class contains only 1 character (less
+ than 256), because in that case the compiled code doesn't use the bit map.
+ */
+
+ memset(classbits, 0, 32 * sizeof(uschar));
+
+#ifdef SUPPORT_UTF8
+ class_utf8 = FALSE; /* No chars >= 256 */
+ class_utf8data = code + LINK_SIZE + 2; /* For UTF-8 items */
+#endif
+
+ /* Process characters until ] is reached. By writing this as a "do" it
+ means that an initial ] is taken as a data character. At the start of the
+ loop, c contains the first byte of the character. */
+
+ if (c != 0) do
+ {
+ const uschar *oldptr;
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && c > 127)
+ { /* Braces are required because the */
+ GETCHARLEN(c, ptr, ptr); /* macro generates multiple statements */
+ }
+#endif
+
+ /* Inside \Q...\E everything is literal except \E */
+
+ if (inescq)
+ {
+ if (c == '\\' && ptr[1] == 'E') /* If we are at \E */
+ {
+ inescq = FALSE; /* Reset literal state */
+ ptr++; /* Skip the 'E' */
+ continue; /* Carry on with next */
+ }
+ goto CHECK_RANGE; /* Could be range if \E follows */
+ }
+
+ /* Handle POSIX class names. Perl allows a negation extension of the
+ form [:^name:]. A square bracket that doesn't match the syntax is
+ treated as a literal. We also recognize the POSIX constructions
+ [.ch.] and [=ch=] ("collating elements") and fault them, as Perl
+ 5.6 and 5.8 do. */
+
+ if (c == '[' &&
+ (ptr[1] == ':' || ptr[1] == '.' || ptr[1] == '=') &&
+ check_posix_syntax(ptr, &tempptr, cd))
+ {
+ BOOL local_negate = FALSE;
+ int posix_class, taboffset, tabopt;
+ register const uschar *cbits = cd->cbits;
+ uschar pbits[32];
+
+ if (ptr[1] != ':')
+ {
+ *errorcodeptr = ERR31;
+ goto FAILED;
+ }
+
+ ptr += 2;
+ if (*ptr == '^')
+ {
+ local_negate = TRUE;
+ ptr++;
+ }
+
+ posix_class = check_posix_name(ptr, tempptr - ptr);
+ if (posix_class < 0)
+ {
+ *errorcodeptr = ERR30;
+ goto FAILED;
+ }
+
+ /* If matching is caseless, upper and lower are converted to
+ alpha. This relies on the fact that the class table starts with
+ alpha, lower, upper as the first 3 entries. */
+
+ if ((options & PCRE_CASELESS) != 0 && posix_class <= 2)
+ posix_class = 0;
+
+ /* We build the bit map for the POSIX class in a chunk of local store
+ because we may be adding and subtracting from it, and we don't want to
+ subtract bits that may be in the main map already. At the end we or the
+ result into the bit map that is being built. */
+
+ posix_class *= 3;
+
+ /* Copy in the first table (always present) */
+
+ memcpy(pbits, cbits + posix_class_maps[posix_class],
+ 32 * sizeof(uschar));
+
+ /* If there is a second table, add or remove it as required. */
+
+ taboffset = posix_class_maps[posix_class + 1];
+ tabopt = posix_class_maps[posix_class + 2];
+
+ if (taboffset >= 0)
+ {
+ if (tabopt >= 0)
+ for (c = 0; c < 32; c++) pbits[c] |= cbits[c + taboffset];
+ else
+ for (c = 0; c < 32; c++) pbits[c] &= ~cbits[c + taboffset];
+ }
+
+ /* Not see if we need to remove any special characters. An option
+ value of 1 removes vertical space and 2 removes underscore. */
+
+ if (tabopt < 0) tabopt = -tabopt;
+ if (tabopt == 1) pbits[1] &= ~0x3c;
+ else if (tabopt == 2) pbits[11] &= 0x7f;
+
+ /* Add the POSIX table or its complement into the main table that is
+ being built and we are done. */
+
+ if (local_negate)
+ for (c = 0; c < 32; c++) classbits[c] |= ~pbits[c];
+ else
+ for (c = 0; c < 32; c++) classbits[c] |= pbits[c];
+
+ ptr = tempptr + 1;
+ class_charcount = 10; /* Set > 1; assumes more than 1 per class */
+ continue; /* End of POSIX syntax handling */
+ }
+
+ /* Backslash may introduce a single character, or it may introduce one
+ of the specials, which just set a flag. The sequence \b is a special
+ case. Inside a class (and only there) it is treated as backspace.
+ Elsewhere it marks a word boundary. Other escapes have preset maps ready
+ to 'or' into the one we are building. We assume they have more than one
+ character in them, so set class_charcount bigger than one. */
+
+ if (c == '\\')
+ {
+ c = check_escape(&ptr, errorcodeptr, cd->bracount, options, TRUE);
+ if (*errorcodeptr != 0) goto FAILED;
+
+ if (-c == ESC_b) c = '\b'; /* \b is backslash in a class */
+ else if (-c == ESC_X) c = 'X'; /* \X is literal X in a class */
+ else if (-c == ESC_R) c = 'R'; /* \R is literal R in a class */
+ else if (-c == ESC_Q) /* Handle start of quoted string */
+ {
+ if (ptr[1] == '\\' && ptr[2] == 'E')
+ {
+ ptr += 2; /* avoid empty string */
+ }
+ else inescq = TRUE;
+ continue;
+ }
+ else if (-c == ESC_E) continue; /* Ignore orphan \E */
+
+ if (c < 0)
+ {
+ register const uschar *cbits = cd->cbits;
+ class_charcount += 2; /* Greater than 1 is what matters */
+
+ /* Save time by not doing this in the pre-compile phase. */
+
+ if (lengthptr == NULL) switch (-c)
+ {
+ case ESC_d:
+ for (c = 0; c < 32; c++) classbits[c] |= cbits[c+cbit_digit];
+ continue;
+
+ case ESC_D:
+ for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_digit];
+ continue;
+
+ case ESC_w:
+ for (c = 0; c < 32; c++) classbits[c] |= cbits[c+cbit_word];
+ continue;
+
+ case ESC_W:
+ for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_word];
+ continue;
+
+ case ESC_s:
+ for (c = 0; c < 32; c++) classbits[c] |= cbits[c+cbit_space];
+ classbits[1] &= ~0x08; /* Perl 5.004 onwards omits VT from \s */
+ continue;
+
+ case ESC_S:
+ for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_space];
+ classbits[1] |= 0x08; /* Perl 5.004 onwards omits VT from \s */
+ continue;
+
+ case ESC_E: /* Perl ignores an orphan \E */
+ continue;
+
+ default: /* Not recognized; fall through */
+ break; /* Need "default" setting to stop compiler warning. */
+ }
+
+ /* In the pre-compile phase, just do the recognition. */
+
+ else if (c == -ESC_d || c == -ESC_D || c == -ESC_w ||
+ c == -ESC_W || c == -ESC_s || c == -ESC_S) continue;
+
+ /* We need to deal with \H, \h, \V, and \v in both phases because
+ they use extra memory. */
+
+ if (-c == ESC_h)
+ {
+ SETBIT(classbits, 0x09); /* VT */
+ SETBIT(classbits, 0x20); /* SPACE */
+ SETBIT(classbits, 0xa0); /* NSBP */
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ class_utf8 = TRUE;
+ *class_utf8data++ = XCL_SINGLE;
+ class_utf8data += _pcre_ord2utf8(0x1680, class_utf8data);
+ *class_utf8data++ = XCL_SINGLE;
+ class_utf8data += _pcre_ord2utf8(0x180e, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x2000, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x200A, class_utf8data);
+ *class_utf8data++ = XCL_SINGLE;
+ class_utf8data += _pcre_ord2utf8(0x202f, class_utf8data);
+ *class_utf8data++ = XCL_SINGLE;
+ class_utf8data += _pcre_ord2utf8(0x205f, class_utf8data);
+ *class_utf8data++ = XCL_SINGLE;
+ class_utf8data += _pcre_ord2utf8(0x3000, class_utf8data);
+ }
+#endif
+ continue;
+ }
+
+ if (-c == ESC_H)
+ {
+ for (c = 0; c < 32; c++)
+ {
+ int x = 0xff;
+ switch (c)
+ {
+ case 0x09/8: x ^= 1 << (0x09%8); break;
+ case 0x20/8: x ^= 1 << (0x20%8); break;
+ case 0xa0/8: x ^= 1 << (0xa0%8); break;
+ default: break;
+ }
+ classbits[c] |= x;
+ }
+
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ class_utf8 = TRUE;
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x0100, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x167f, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x1681, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x180d, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x180f, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x1fff, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x200B, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x202e, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x2030, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x205e, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x2060, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x2fff, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x3001, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x7fffffff, class_utf8data);
+ }
+#endif
+ continue;
+ }
+
+ if (-c == ESC_v)
+ {
+ SETBIT(classbits, 0x0a); /* LF */
+ SETBIT(classbits, 0x0b); /* VT */
+ SETBIT(classbits, 0x0c); /* FF */
+ SETBIT(classbits, 0x0d); /* CR */
+ SETBIT(classbits, 0x85); /* NEL */
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ class_utf8 = TRUE;
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x2028, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x2029, class_utf8data);
+ }
+#endif
+ continue;
+ }
+
+ if (-c == ESC_V)
+ {
+ for (c = 0; c < 32; c++)
+ {
+ int x = 0xff;
+ switch (c)
+ {
+ case 0x0a/8: x ^= 1 << (0x0a%8);
+ x ^= 1 << (0x0b%8);
+ x ^= 1 << (0x0c%8);
+ x ^= 1 << (0x0d%8);
+ break;
+ case 0x85/8: x ^= 1 << (0x85%8); break;
+ default: break;
+ }
+ classbits[c] |= x;
+ }
+
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ class_utf8 = TRUE;
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x0100, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x2027, class_utf8data);
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(0x2029, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(0x7fffffff, class_utf8data);
+ }
+#endif
+ continue;
+ }
+
+ /* We need to deal with \P and \p in both phases. */
+
+#ifdef SUPPORT_UCP
+ if (-c == ESC_p || -c == ESC_P)
+ {
+ BOOL negated;
+ int pdata;
+ int ptype = get_ucp(&ptr, &negated, &pdata, errorcodeptr);
+ if (ptype < 0) goto FAILED;
+ class_utf8 = TRUE;
+ *class_utf8data++ = ((-c == ESC_p) != negated)?
+ XCL_PROP : XCL_NOTPROP;
+ *class_utf8data++ = ptype;
+ *class_utf8data++ = pdata;
+ class_charcount -= 2; /* Not a < 256 character */
+ continue;
+ }
+#endif
+ /* Unrecognized escapes are faulted if PCRE is running in its
+ strict mode. By default, for compatibility with Perl, they are
+ treated as literals. */
+
+ if ((options & PCRE_EXTRA) != 0)
+ {
+ *errorcodeptr = ERR7;
+ goto FAILED;
+ }
+
+ class_charcount -= 2; /* Undo the default count from above */
+ c = *ptr; /* Get the final character and fall through */
+ }
+
+ /* Fall through if we have a single character (c >= 0). This may be
+ greater than 256 in UTF-8 mode. */
+
+ } /* End of backslash handling */
+
+ /* A single character may be followed by '-' to form a range. However,
+ Perl does not permit ']' to be the end of the range. A '-' character
+ at the end is treated as a literal. Perl ignores orphaned \E sequences
+ entirely. The code for handling \Q and \E is messy. */
+
+ CHECK_RANGE:
+ while (ptr[1] == '\\' && ptr[2] == 'E')
+ {
+ inescq = FALSE;
+ ptr += 2;
+ }
+
+ oldptr = ptr;
+
+ /* Remember \r or \n */
+
+ if (c == '\r' || c == '\n') cd->external_flags |= PCRE_HASCRORLF;
+
+ /* Check for range */
+
+ if (!inescq && ptr[1] == '-')
+ {
+ int d;
+ ptr += 2;
+ while (*ptr == '\\' && ptr[1] == 'E') ptr += 2;
+
+ /* If we hit \Q (not followed by \E) at this point, go into escaped
+ mode. */
+
+ while (*ptr == '\\' && ptr[1] == 'Q')
+ {
+ ptr += 2;
+ if (*ptr == '\\' && ptr[1] == 'E') { ptr += 2; continue; }
+ inescq = TRUE;
+ break;
+ }
+
+ if (*ptr == 0 || (!inescq && *ptr == ']'))
+ {
+ ptr = oldptr;
+ goto LONE_SINGLE_CHARACTER;
+ }
+
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ { /* Braces are required because the */
+ GETCHARLEN(d, ptr, ptr); /* macro generates multiple statements */
+ }
+ else
+#endif
+ d = *ptr; /* Not UTF-8 mode */
+
+ /* The second part of a range can be a single-character escape, but
+ not any of the other escapes. Perl 5.6 treats a hyphen as a literal
+ in such circumstances. */
+
+ if (!inescq && d == '\\')
+ {
+ d = check_escape(&ptr, errorcodeptr, cd->bracount, options, TRUE);
+ if (*errorcodeptr != 0) goto FAILED;
+
+ /* \b is backslash; \X is literal X; \R is literal R; any other
+ special means the '-' was literal */
+
+ if (d < 0)
+ {
+ if (d == -ESC_b) d = '\b';
+ else if (d == -ESC_X) d = 'X';
+ else if (d == -ESC_R) d = 'R'; else
+ {
+ ptr = oldptr;
+ goto LONE_SINGLE_CHARACTER; /* A few lines below */
+ }
+ }
+ }
+
+ /* Check that the two values are in the correct order. Optimize
+ one-character ranges */
+
+ if (d < c)
+ {
+ *errorcodeptr = ERR8;
+ goto FAILED;
+ }
+
+ if (d == c) goto LONE_SINGLE_CHARACTER; /* A few lines below */
+
+ /* Remember \r or \n */
+
+ if (d == '\r' || d == '\n') cd->external_flags |= PCRE_HASCRORLF;
+
+ /* In UTF-8 mode, if the upper limit is > 255, or > 127 for caseless
+ matching, we have to use an XCLASS with extra data items. Caseless
+ matching for characters > 127 is available only if UCP support is
+ available. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && (d > 255 || ((options & PCRE_CASELESS) != 0 && d > 127)))
+ {
+ class_utf8 = TRUE;
+
+ /* With UCP support, we can find the other case equivalents of
+ the relevant characters. There may be several ranges. Optimize how
+ they fit with the basic range. */
+
+#ifdef SUPPORT_UCP
+ if ((options & PCRE_CASELESS) != 0)
+ {
+ unsigned int occ, ocd;
+ unsigned int cc = c;
+ unsigned int origd = d;
+ while (get_othercase_range(&cc, origd, &occ, &ocd))
+ {
+ if (occ >= (unsigned int)c &&
+ ocd <= (unsigned int)d)
+ continue; /* Skip embedded ranges */
+
+ if (occ < (unsigned int)c &&
+ ocd >= (unsigned int)c - 1) /* Extend the basic range */
+ { /* if there is overlap, */
+ c = occ; /* noting that if occ < c */
+ continue; /* we can't have ocd > d */
+ } /* because a subrange is */
+ if (ocd > (unsigned int)d &&
+ occ <= (unsigned int)d + 1) /* always shorter than */
+ { /* the basic range. */
+ d = ocd;
+ continue;
+ }
+
+ if (occ == ocd)
+ {
+ *class_utf8data++ = XCL_SINGLE;
+ }
+ else
+ {
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(occ, class_utf8data);
+ }
+ class_utf8data += _pcre_ord2utf8(ocd, class_utf8data);
+ }
+ }
+#endif /* SUPPORT_UCP */
+
+ /* Now record the original range, possibly modified for UCP caseless
+ overlapping ranges. */
+
+ *class_utf8data++ = XCL_RANGE;
+ class_utf8data += _pcre_ord2utf8(c, class_utf8data);
+ class_utf8data += _pcre_ord2utf8(d, class_utf8data);
+
+ /* With UCP support, we are done. Without UCP support, there is no
+ caseless matching for UTF-8 characters > 127; we can use the bit map
+ for the smaller ones. */
+
+#ifdef SUPPORT_UCP
+ continue; /* With next character in the class */
+#else
+ if ((options & PCRE_CASELESS) == 0 || c > 127) continue;
+
+ /* Adjust upper limit and fall through to set up the map */
+
+ d = 127;
+
+#endif /* SUPPORT_UCP */
+ }
+#endif /* SUPPORT_UTF8 */
+
+ /* We use the bit map for all cases when not in UTF-8 mode; else
+ ranges that lie entirely within 0-127 when there is UCP support; else
+ for partial ranges without UCP support. */
+
+ class_charcount += d - c + 1;
+ class_lastchar = d;
+
+ /* We can save a bit of time by skipping this in the pre-compile. */
+
+ if (lengthptr == NULL) for (; c <= d; c++)
+ {
+ classbits[c/8] |= (1 << (c&7));
+ if ((options & PCRE_CASELESS) != 0)
+ {
+ int uc = cd->fcc[c]; /* flip case */
+ classbits[uc/8] |= (1 << (uc&7));
+ }
+ }
+
+ continue; /* Go get the next char in the class */
+ }
+
+ /* Handle a lone single character - we can get here for a normal
+ non-escape char, or after \ that introduces a single character or for an
+ apparent range that isn't. */
+
+ LONE_SINGLE_CHARACTER:
+
+ /* Handle a character that cannot go in the bit map */
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && (c > 255 || ((options & PCRE_CASELESS) != 0 && c > 127)))
+ {
+ class_utf8 = TRUE;
+ *class_utf8data++ = XCL_SINGLE;
+ class_utf8data += _pcre_ord2utf8(c, class_utf8data);
+
+#ifdef SUPPORT_UCP
+ if ((options & PCRE_CASELESS) != 0)
+ {
+ unsigned int othercase;
+ if ((othercase = _pcre_ucp_othercase(c)) != NOTACHAR)
+ {
+ *class_utf8data++ = XCL_SINGLE;
+ class_utf8data += _pcre_ord2utf8(othercase, class_utf8data);
+ }
+ }
+#endif /* SUPPORT_UCP */
+
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+
+ /* Handle a single-byte character */
+ {
+ classbits[c/8] |= (1 << (c&7));
+ if ((options & PCRE_CASELESS) != 0)
+ {
+ c = cd->fcc[c]; /* flip case */
+ classbits[c/8] |= (1 << (c&7));
+ }
+ class_charcount++;
+ class_lastchar = c;
+ }
+ }
+
+ /* Loop until ']' reached. This "while" is the end of the "do" above. */
+
+ while ((c = *(++ptr)) != 0 && (c != ']' || inescq));
+
+ if (c == 0) /* Missing terminating ']' */
+ {
+ *errorcodeptr = ERR6;
+ goto FAILED;
+ }
+
+
+/* This code has been disabled because it would mean that \s counts as
+an explicit \r or \n reference, and that's not really what is wanted. Now
+we set the flag only if there is a literal "\r" or "\n" in the class. */
+
+#if 0
+ /* Remember whether \r or \n are in this class */
+
+ if (negate_class)
+ {
+ if ((classbits[1] & 0x24) != 0x24) cd->external_flags |= PCRE_HASCRORLF;
+ }
+ else
+ {
+ if ((classbits[1] & 0x24) != 0) cd->external_flags |= PCRE_HASCRORLF;
+ }
+#endif
+
+
+ /* If class_charcount is 1, we saw precisely one character whose value is
+ less than 256. As long as there were no characters >= 128 and there was no
+ use of \p or \P, in other words, no use of any XCLASS features, we can
+ optimize.
+
+ In UTF-8 mode, we can optimize the negative case only if there were no
+ characters >= 128 because OP_NOT and the related opcodes like OP_NOTSTAR
+ operate on single-bytes only. This is an historical hangover. Maybe one day
+ we can tidy these opcodes to handle multi-byte characters.
+
+ The optimization throws away the bit map. We turn the item into a
+ 1-character OP_CHAR[NC] if it's positive, or OP_NOT if it's negative. Note
+ that OP_NOT does not support multibyte characters. In the positive case, it
+ can cause firstbyte to be set. Otherwise, there can be no first char if
+ this item is first, whatever repeat count may follow. In the case of
+ reqbyte, save the previous value for reinstating. */
+
+#ifdef SUPPORT_UTF8
+ if (class_charcount == 1 && !class_utf8 &&
+ (!utf8 || !negate_class || class_lastchar < 128))
+#else
+ if (class_charcount == 1)
+#endif
+ {
+ zeroreqbyte = reqbyte;
+
+ /* The OP_NOT opcode works on one-byte characters only. */
+
+ if (negate_class)
+ {
+ if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+ zerofirstbyte = firstbyte;
+ *code++ = OP_NOT;
+ *code++ = class_lastchar;
+ break;
+ }
+
+ /* For a single, positive character, get the value into mcbuffer, and
+ then we can handle this with the normal one-character code. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && class_lastchar > 127)
+ mclength = _pcre_ord2utf8(class_lastchar, mcbuffer);
+ else
+#endif
+ {
+ mcbuffer[0] = class_lastchar;
+ mclength = 1;
+ }
+ goto ONE_CHAR;
+ } /* End of 1-char optimization */
+
+ /* The general case - not the one-char optimization. If this is the first
+ thing in the branch, there can be no first char setting, whatever the
+ repeat count. Any reqbyte setting must remain unchanged after any kind of
+ repeat. */
+
+ if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+ zerofirstbyte = firstbyte;
+ zeroreqbyte = reqbyte;
+
+ /* If there are characters with values > 255, we have to compile an
+ extended class, with its own opcode. If there are no characters < 256,
+ we can omit the bitmap in the actual compiled code. */
+
+#ifdef SUPPORT_UTF8
+ if (class_utf8)
+ {
+ *class_utf8data++ = XCL_END; /* Marks the end of extra data */
+ *code++ = OP_XCLASS;
+ code += LINK_SIZE;
+ *code = negate_class? XCL_NOT : 0;
+
+ /* If the map is required, move up the extra data to make room for it;
+ otherwise just move the code pointer to the end of the extra data. */
+
+ if (class_charcount > 0)
+ {
+ *code++ |= XCL_MAP;
+ memmove(code + 32, code, class_utf8data - code);
+ memcpy(code, classbits, 32);
+ code = class_utf8data + 32;
+ }
+ else code = class_utf8data;
+
+ /* Now fill in the complete length of the item */
+
+ PUT(previous, 1, code - previous);
+ break; /* End of class handling */
+ }
+#endif
+
+ /* If there are no characters > 255, negate the 32-byte map if necessary,
+ and copy it into the code vector. If this is the first thing in the branch,
+ there can be no first char setting, whatever the repeat count. Any reqbyte
+ setting must remain unchanged after any kind of repeat. */
+
+ if (negate_class)
+ {
+ *code++ = OP_NCLASS;
+ if (lengthptr == NULL) /* Save time in the pre-compile phase */
+ for (c = 0; c < 32; c++) code[c] = ~classbits[c];
+ }
+ else
+ {
+ *code++ = OP_CLASS;
+ memcpy(code, classbits, 32);
+ }
+ code += 32;
+ break;
+
+
+ /* ===================================================================*/
+ /* Various kinds of repeat; '{' is not necessarily a quantifier, but this
+ has been tested above. */
+
+ case '{':
+ if (!is_quantifier) goto NORMAL_CHAR;
+ ptr = read_repeat_counts(ptr+1, &repeat_min, &repeat_max, errorcodeptr);
+ if (*errorcodeptr != 0) goto FAILED;
+ goto REPEAT;
+
+ case '*':
+ repeat_min = 0;
+ repeat_max = -1;
+ goto REPEAT;
+
+ case '+':
+ repeat_min = 1;
+ repeat_max = -1;
+ goto REPEAT;
+
+ case '?':
+ repeat_min = 0;
+ repeat_max = 1;
+
+ REPEAT:
+ if (previous == NULL)
+ {
+ *errorcodeptr = ERR9;
+ goto FAILED;
+ }
+
+ if (repeat_min == 0)
+ {
+ firstbyte = zerofirstbyte; /* Adjust for zero repeat */
+ reqbyte = zeroreqbyte; /* Ditto */
+ }
+
+ /* Remember whether this is a variable length repeat */
+
+ reqvary = (repeat_min == repeat_max)? 0 : REQ_VARY;
+
+ op_type = 0; /* Default single-char op codes */
+ possessive_quantifier = FALSE; /* Default not possessive quantifier */
+
+ /* Save start of previous item, in case we have to move it up to make space
+ for an inserted OP_ONCE for the additional '+' extension. */
+
+ tempcode = previous;
+
+ /* If the next character is '+', we have a possessive quantifier. This
+ implies greediness, whatever the setting of the PCRE_UNGREEDY option.
+ If the next character is '?' this is a minimizing repeat, by default,
+ but if PCRE_UNGREEDY is set, it works the other way round. We change the
+ repeat type to the non-default. */
+
+ if (ptr[1] == '+')
+ {
+ repeat_type = 0; /* Force greedy */
+ possessive_quantifier = TRUE;
+ ptr++;
+ }
+ else if (ptr[1] == '?')
+ {
+ repeat_type = greedy_non_default;
+ ptr++;
+ }
+ else repeat_type = greedy_default;
+
+ /* If previous was a character match, abolish the item and generate a
+ repeat item instead. If a char item has a minumum of more than one, ensure
+ that it is set in reqbyte - it might not be if a sequence such as x{3} is
+ the first thing in a branch because the x will have gone into firstbyte
+ instead. */
+
+ if (*previous == OP_CHAR || *previous == OP_CHARNC)
+ {
+ /* Deal with UTF-8 characters that take up more than one byte. It's
+ easier to write this out separately than try to macrify it. Use c to
+ hold the length of the character in bytes, plus 0x80 to flag that it's a
+ length rather than a small character. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && (code[-1] & 0x80) != 0)
+ {
+ uschar *lastchar = code - 1;
+ while((*lastchar & 0xc0) == 0x80) lastchar--;
+ c = code - lastchar; /* Length of UTF-8 character */
+ memcpy(utf8_char, lastchar, c); /* Save the char */
+ c |= 0x80; /* Flag c as a length */
+ }
+ else
+#endif
+
+ /* Handle the case of a single byte - either with no UTF8 support, or
+ with UTF-8 disabled, or for a UTF-8 character < 128. */
+
+ {
+ c = code[-1];
+ if (repeat_min > 1) reqbyte = c | req_caseopt | cd->req_varyopt;
+ }
+
+ /* If the repetition is unlimited, it pays to see if the next thing on
+ the line is something that cannot possibly match this character. If so,
+ automatically possessifying this item gains some performance in the case
+ where the match fails. */
+
+ if (!possessive_quantifier &&
+ repeat_max < 0 &&
+ check_auto_possessive(*previous, c, utf8, utf8_char, ptr + 1,
+ options, cd))
+ {
+ repeat_type = 0; /* Force greedy */
+ possessive_quantifier = TRUE;
+ }
+
+ goto OUTPUT_SINGLE_REPEAT; /* Code shared with single character types */
+ }
+
+ /* If previous was a single negated character ([^a] or similar), we use
+ one of the special opcodes, replacing it. The code is shared with single-
+ character repeats by setting opt_type to add a suitable offset into
+ repeat_type. We can also test for auto-possessification. OP_NOT is
+ currently used only for single-byte chars. */
+
+ else if (*previous == OP_NOT)
+ {
+ op_type = OP_NOTSTAR - OP_STAR; /* Use "not" opcodes */
+ c = previous[1];
+ if (!possessive_quantifier &&
+ repeat_max < 0 &&
+ check_auto_possessive(OP_NOT, c, utf8, NULL, ptr + 1, options, cd))
+ {
+ repeat_type = 0; /* Force greedy */
+ possessive_quantifier = TRUE;
+ }
+ goto OUTPUT_SINGLE_REPEAT;
+ }
+
+ /* If previous was a character type match (\d or similar), abolish it and
+ create a suitable repeat item. The code is shared with single-character
+ repeats by setting op_type to add a suitable offset into repeat_type. Note
+ the the Unicode property types will be present only when SUPPORT_UCP is
+ defined, but we don't wrap the little bits of code here because it just
+ makes it horribly messy. */
+
+ else if (*previous < OP_EODN)
+ {
+ uschar *oldcode;
+ int prop_type, prop_value;
+ op_type = OP_TYPESTAR - OP_STAR; /* Use type opcodes */
+ c = *previous;
+
+ if (!possessive_quantifier &&
+ repeat_max < 0 &&
+ check_auto_possessive(c, 0, utf8, NULL, ptr + 1, options, cd))
+ {
+ repeat_type = 0; /* Force greedy */
+ possessive_quantifier = TRUE;
+ }
+
+ OUTPUT_SINGLE_REPEAT:
+ if (*previous == OP_PROP || *previous == OP_NOTPROP)
+ {
+ prop_type = previous[1];
+ prop_value = previous[2];
+ }
+ else prop_type = prop_value = -1;
+
+ oldcode = code;
+ code = previous; /* Usually overwrite previous item */
+
+ /* If the maximum is zero then the minimum must also be zero; Perl allows
+ this case, so we do too - by simply omitting the item altogether. */
+
+ if (repeat_max == 0) goto END_REPEAT;
+
+ /* All real repeats make it impossible to handle partial matching (maybe
+ one day we will be able to remove this restriction). */
+
+ if (repeat_max != 1) cd->external_flags |= PCRE_NOPARTIAL;
+
+ /* Combine the op_type with the repeat_type */
+
+ repeat_type += op_type;
+
+ /* A minimum of zero is handled either as the special case * or ?, or as
+ an UPTO, with the maximum given. */
+
+ if (repeat_min == 0)
+ {
+ if (repeat_max == -1) *code++ = OP_STAR + repeat_type;
+ else if (repeat_max == 1) *code++ = OP_QUERY + repeat_type;
+ else
+ {
+ *code++ = OP_UPTO + repeat_type;
+ PUT2INC(code, 0, repeat_max);
+ }
+ }
+
+ /* A repeat minimum of 1 is optimized into some special cases. If the
+ maximum is unlimited, we use OP_PLUS. Otherwise, the original item is
+ left in place and, if the maximum is greater than 1, we use OP_UPTO with
+ one less than the maximum. */
+
+ else if (repeat_min == 1)
+ {
+ if (repeat_max == -1)
+ *code++ = OP_PLUS + repeat_type;
+ else
+ {
+ code = oldcode; /* leave previous item in place */
+ if (repeat_max == 1) goto END_REPEAT;
+ *code++ = OP_UPTO + repeat_type;
+ PUT2INC(code, 0, repeat_max - 1);
+ }
+ }
+
+ /* The case {n,n} is just an EXACT, while the general case {n,m} is
+ handled as an EXACT followed by an UPTO. */
+
+ else
+ {
+ *code++ = OP_EXACT + op_type; /* NB EXACT doesn't have repeat_type */
+ PUT2INC(code, 0, repeat_min);
+
+ /* If the maximum is unlimited, insert an OP_STAR. Before doing so,
+ we have to insert the character for the previous code. For a repeated
+ Unicode property match, there are two extra bytes that define the
+ required property. In UTF-8 mode, long characters have their length in
+ c, with the 0x80 bit as a flag. */
+
+ if (repeat_max < 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8 && c >= 128)
+ {
+ memcpy(code, utf8_char, c & 7);
+ code += c & 7;
+ }
+ else
+#endif
+ {
+ *code++ = c;
+ if (prop_type >= 0)
+ {
+ *code++ = prop_type;
+ *code++ = prop_value;
+ }
+ }
+ *code++ = OP_STAR + repeat_type;
+ }
+
+ /* Else insert an UPTO if the max is greater than the min, again
+ preceded by the character, for the previously inserted code. If the
+ UPTO is just for 1 instance, we can use QUERY instead. */
+
+ else if (repeat_max != repeat_min)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8 && c >= 128)
+ {
+ memcpy(code, utf8_char, c & 7);
+ code += c & 7;
+ }
+ else
+#endif
+ *code++ = c;
+ if (prop_type >= 0)
+ {
+ *code++ = prop_type;
+ *code++ = prop_value;
+ }
+ repeat_max -= repeat_min;
+
+ if (repeat_max == 1)
+ {
+ *code++ = OP_QUERY + repeat_type;
+ }
+ else
+ {
+ *code++ = OP_UPTO + repeat_type;
+ PUT2INC(code, 0, repeat_max);
+ }
+ }
+ }
+
+ /* The character or character type itself comes last in all cases. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && c >= 128)
+ {
+ memcpy(code, utf8_char, c & 7);
+ code += c & 7;
+ }
+ else
+#endif
+ *code++ = c;
+
+ /* For a repeated Unicode property match, there are two extra bytes that
+ define the required property. */
+
+#ifdef SUPPORT_UCP
+ if (prop_type >= 0)
+ {
+ *code++ = prop_type;
+ *code++ = prop_value;
+ }
+#endif
+ }
+
+ /* If previous was a character class or a back reference, we put the repeat
+ stuff after it, but just skip the item if the repeat was {0,0}. */
+
+ else if (*previous == OP_CLASS ||
+ *previous == OP_NCLASS ||
+#ifdef SUPPORT_UTF8
+ *previous == OP_XCLASS ||
+#endif
+ *previous == OP_REF)
+ {
+ if (repeat_max == 0)
+ {
+ code = previous;
+ goto END_REPEAT;
+ }
+
+ /* All real repeats make it impossible to handle partial matching (maybe
+ one day we will be able to remove this restriction). */
+
+ if (repeat_max != 1) cd->external_flags |= PCRE_NOPARTIAL;
+
+ if (repeat_min == 0 && repeat_max == -1)
+ *code++ = OP_CRSTAR + repeat_type;
+ else if (repeat_min == 1 && repeat_max == -1)
+ *code++ = OP_CRPLUS + repeat_type;
+ else if (repeat_min == 0 && repeat_max == 1)
+ *code++ = OP_CRQUERY + repeat_type;
+ else
+ {
+ *code++ = OP_CRRANGE + repeat_type;
+ PUT2INC(code, 0, repeat_min);
+ if (repeat_max == -1) repeat_max = 0; /* 2-byte encoding for max */
+ PUT2INC(code, 0, repeat_max);
+ }
+ }
+
+ /* If previous was a bracket group, we may have to replicate it in certain
+ cases. */
+
+ else if (*previous == OP_BRA || *previous == OP_CBRA ||
+ *previous == OP_ONCE || *previous == OP_COND)
+ {
+ register int i;
+ int ketoffset = 0;
+ int len = code - previous;
+ uschar *bralink = NULL;
+
+ /* Repeating a DEFINE group is pointless */
+
+ if (*previous == OP_COND && previous[LINK_SIZE+1] == OP_DEF)
+ {
+ *errorcodeptr = ERR55;
+ goto FAILED;
+ }
+
+ /* If the maximum repeat count is unlimited, find the end of the bracket
+ by scanning through from the start, and compute the offset back to it
+ from the current code pointer. There may be an OP_OPT setting following
+ the final KET, so we can't find the end just by going back from the code
+ pointer. */
+
+ if (repeat_max == -1)
+ {
+ register uschar *ket = previous;
+ do ket += GET(ket, 1); while (*ket != OP_KET);
+ ketoffset = code - ket;
+ }
+
+ /* The case of a zero minimum is special because of the need to stick
+ OP_BRAZERO in front of it, and because the group appears once in the
+ data, whereas in other cases it appears the minimum number of times. For
+ this reason, it is simplest to treat this case separately, as otherwise
+ the code gets far too messy. There are several special subcases when the
+ minimum is zero. */
+
+ if (repeat_min == 0)
+ {
+ /* If the maximum is also zero, we just omit the group from the output
+ altogether. */
+
+ if (repeat_max == 0)
+ {
+ code = previous;
+ goto END_REPEAT;
+ }
+
+ /* If the maximum is 1 or unlimited, we just have to stick in the
+ BRAZERO and do no more at this point. However, we do need to adjust
+ any OP_RECURSE calls inside the group that refer to the group itself or
+ any internal or forward referenced group, because the offset is from
+ the start of the whole regex. Temporarily terminate the pattern while
+ doing this. */
+
+ if (repeat_max <= 1)
+ {
+ *code = OP_END;
+ adjust_recurse(previous, 1, utf8, cd, save_hwm);
+ memmove(previous+1, previous, len);
+ code++;
+ *previous++ = OP_BRAZERO + repeat_type;
+ }
+
+ /* If the maximum is greater than 1 and limited, we have to replicate
+ in a nested fashion, sticking OP_BRAZERO before each set of brackets.
+ The first one has to be handled carefully because it's the original
+ copy, which has to be moved up. The remainder can be handled by code
+ that is common with the non-zero minimum case below. We have to
+ adjust the value or repeat_max, since one less copy is required. Once
+ again, we may have to adjust any OP_RECURSE calls inside the group. */
+
+ else
+ {
+ int offset;
+ *code = OP_END;
+ adjust_recurse(previous, 2 + LINK_SIZE, utf8, cd, save_hwm);
+ memmove(previous + 2 + LINK_SIZE, previous, len);
+ code += 2 + LINK_SIZE;
+ *previous++ = OP_BRAZERO + repeat_type;
+ *previous++ = OP_BRA;
+
+ /* We chain together the bracket offset fields that have to be
+ filled in later when the ends of the brackets are reached. */
+
+ offset = (bralink == NULL)? 0 : previous - bralink;
+ bralink = previous;
+ PUTINC(previous, 0, offset);
+ }
+
+ repeat_max--;
+ }
+
+ /* If the minimum is greater than zero, replicate the group as many
+ times as necessary, and adjust the maximum to the number of subsequent
+ copies that we need. If we set a first char from the group, and didn't
+ set a required char, copy the latter from the former. If there are any
+ forward reference subroutine calls in the group, there will be entries on
+ the workspace list; replicate these with an appropriate increment. */
+
+ else
+ {
+ if (repeat_min > 1)
+ {
+ /* In the pre-compile phase, we don't actually do the replication. We
+ just adjust the length as if we had. Do some paranoid checks for
+ potential integer overflow. */
+
+ if (lengthptr != NULL)
+ {
+ int delta = (repeat_min - 1)*length_prevgroup;
+ if ((double)(repeat_min - 1)*(double)length_prevgroup >
+ (double)INT_MAX ||
+ OFLOW_MAX - *lengthptr < delta)
+ {
+ *errorcodeptr = ERR20;
+ goto FAILED;
+ }
+ *lengthptr += delta;
+ }
+
+ /* This is compiling for real */
+
+ else
+ {
+ if (groupsetfirstbyte && reqbyte < 0) reqbyte = firstbyte;
+ for (i = 1; i < repeat_min; i++)
+ {
+ uschar *hc;
+ uschar *this_hwm = cd->hwm;
+ memcpy(code, previous, len);
+ for (hc = save_hwm; hc < this_hwm; hc += LINK_SIZE)
+ {
+ PUT(cd->hwm, 0, GET(hc, 0) + len);
+ cd->hwm += LINK_SIZE;
+ }
+ save_hwm = this_hwm;
+ code += len;
+ }
+ }
+ }
+
+ if (repeat_max > 0) repeat_max -= repeat_min;
+ }
+
+ /* This code is common to both the zero and non-zero minimum cases. If
+ the maximum is limited, it replicates the group in a nested fashion,
+ remembering the bracket starts on a stack. In the case of a zero minimum,
+ the first one was set up above. In all cases the repeat_max now specifies
+ the number of additional copies needed. Again, we must remember to
+ replicate entries on the forward reference list. */
+
+ if (repeat_max >= 0)
+ {
+ /* In the pre-compile phase, we don't actually do the replication. We
+ just adjust the length as if we had. For each repetition we must add 1
+ to the length for BRAZERO and for all but the last repetition we must
+ add 2 + 2*LINKSIZE to allow for the nesting that occurs. Do some
+ paranoid checks to avoid integer overflow. */
+
+ if (lengthptr != NULL && repeat_max > 0)
+ {
+ int delta = repeat_max * (length_prevgroup + 1 + 2 + 2*LINK_SIZE) -
+ 2 - 2*LINK_SIZE; /* Last one doesn't nest */
+ if ((double)repeat_max *
+ (double)(length_prevgroup + 1 + 2 + 2*LINK_SIZE)
+ > (double)INT_MAX ||
+ OFLOW_MAX - *lengthptr < delta)
+ {
+ *errorcodeptr = ERR20;
+ goto FAILED;
+ }
+ *lengthptr += delta;
+ }
+
+ /* This is compiling for real */
+
+ else for (i = repeat_max - 1; i >= 0; i--)
+ {
+ uschar *hc;
+ uschar *this_hwm = cd->hwm;
+
+ *code++ = OP_BRAZERO + repeat_type;
+
+ /* All but the final copy start a new nesting, maintaining the
+ chain of brackets outstanding. */
+
+ if (i != 0)
+ {
+ int offset;
+ *code++ = OP_BRA;
+ offset = (bralink == NULL)? 0 : code - bralink;
+ bralink = code;
+ PUTINC(code, 0, offset);
+ }
+
+ memcpy(code, previous, len);
+ for (hc = save_hwm; hc < this_hwm; hc += LINK_SIZE)
+ {
+ PUT(cd->hwm, 0, GET(hc, 0) + len + ((i != 0)? 2+LINK_SIZE : 1));
+ cd->hwm += LINK_SIZE;
+ }
+ save_hwm = this_hwm;
+ code += len;
+ }
+
+ /* Now chain through the pending brackets, and fill in their length
+ fields (which are holding the chain links pro tem). */
+
+ while (bralink != NULL)
+ {
+ int oldlinkoffset;
+ int offset = code - bralink + 1;
+ uschar *bra = code - offset;
+ oldlinkoffset = GET(bra, 1);
+ bralink = (oldlinkoffset == 0)? NULL : bralink - oldlinkoffset;
+ *code++ = OP_KET;
+ PUTINC(code, 0, offset);
+ PUT(bra, 1, offset);
+ }
+ }
+
+ /* If the maximum is unlimited, set a repeater in the final copy. We
+ can't just offset backwards from the current code point, because we
+ don't know if there's been an options resetting after the ket. The
+ correct offset was computed above.
+
+ Then, when we are doing the actual compile phase, check to see whether
+ this group is a non-atomic one that could match an empty string. If so,
+ convert the initial operator to the S form (e.g. OP_BRA -> OP_SBRA) so
+ that runtime checking can be done. [This check is also applied to
+ atomic groups at runtime, but in a different way.] */
+
+ else
+ {
+ uschar *ketcode = code - ketoffset;
+ uschar *bracode = ketcode - GET(ketcode, 1);
+ *ketcode = OP_KETRMAX + repeat_type;
+ if (lengthptr == NULL && *bracode != OP_ONCE)
+ {
+ uschar *scode = bracode;
+ do
+ {
+ if (could_be_empty_branch(scode, ketcode, utf8))
+ {
+ *bracode += OP_SBRA - OP_BRA;
+ break;
+ }
+ scode += GET(scode, 1);
+ }
+ while (*scode == OP_ALT);
+ }
+ }
+ }
+
+ /* Else there's some kind of shambles */
+
+ else
+ {
+ *errorcodeptr = ERR11;
+ goto FAILED;
+ }
+
+ /* If the character following a repeat is '+', or if certain optimization
+ tests above succeeded, possessive_quantifier is TRUE. For some of the
+ simpler opcodes, there is an special alternative opcode for this. For
+ anything else, we wrap the entire repeated item inside OP_ONCE brackets.
+ The '+' notation is just syntactic sugar, taken from Sun's Java package,
+ but the special opcodes can optimize it a bit. The repeated item starts at
+ tempcode, not at previous, which might be the first part of a string whose
+ (former) last char we repeated.
+
+ Possessifying an 'exact' quantifier has no effect, so we can ignore it. But
+ an 'upto' may follow. We skip over an 'exact' item, and then test the
+ length of what remains before proceeding. */
+
+ if (possessive_quantifier)
+ {
+ int len;
+ if (*tempcode == OP_EXACT || *tempcode == OP_TYPEEXACT ||
+ *tempcode == OP_NOTEXACT)
+ tempcode += _pcre_OP_lengths[*tempcode];
+ len = code - tempcode;
+ if (len > 0) switch (*tempcode)
+ {
+ case OP_STAR: *tempcode = OP_POSSTAR; break;
+ case OP_PLUS: *tempcode = OP_POSPLUS; break;
+ case OP_QUERY: *tempcode = OP_POSQUERY; break;
+ case OP_UPTO: *tempcode = OP_POSUPTO; break;
+
+ case OP_TYPESTAR: *tempcode = OP_TYPEPOSSTAR; break;
+ case OP_TYPEPLUS: *tempcode = OP_TYPEPOSPLUS; break;
+ case OP_TYPEQUERY: *tempcode = OP_TYPEPOSQUERY; break;
+ case OP_TYPEUPTO: *tempcode = OP_TYPEPOSUPTO; break;
+
+ case OP_NOTSTAR: *tempcode = OP_NOTPOSSTAR; break;
+ case OP_NOTPLUS: *tempcode = OP_NOTPOSPLUS; break;
+ case OP_NOTQUERY: *tempcode = OP_NOTPOSQUERY; break;
+ case OP_NOTUPTO: *tempcode = OP_NOTPOSUPTO; break;
+
+ default:
+ memmove(tempcode + 1+LINK_SIZE, tempcode, len);
+ code += 1 + LINK_SIZE;
+ len += 1 + LINK_SIZE;
+ tempcode[0] = OP_ONCE;
+ *code++ = OP_KET;
+ PUTINC(code, 0, len);
+ PUT(tempcode, 1, len);
+ break;
+ }
+ }
+
+ /* In all case we no longer have a previous item. We also set the
+ "follows varying string" flag for subsequently encountered reqbytes if
+ it isn't already set and we have just passed a varying length item. */
+
+ END_REPEAT:
+ previous = NULL;
+ cd->req_varyopt |= reqvary;
+ break;
+
+
+ /* ===================================================================*/
+ /* Start of nested parenthesized sub-expression, or comment or lookahead or
+ lookbehind or option setting or condition or all the other extended
+ parenthesis forms. */
+
+ case '(':
+ newoptions = options;
+ skipbytes = 0;
+ bravalue = OP_CBRA;
+ save_hwm = cd->hwm;
+ reset_bracount = FALSE;
+
+ /* First deal with various "verbs" that can be introduced by '*'. */
+
+ if (*(++ptr) == '*' && (cd->ctypes[ptr[1]] & ctype_letter) != 0)
+ {
+ int i, namelen;
+ const char *vn = verbnames;
+ const uschar *name = ++ptr;
+ previous = NULL;
+ while ((cd->ctypes[*++ptr] & ctype_letter) != 0);
+ if (*ptr == ':')
+ {
+ *errorcodeptr = ERR59; /* Not supported */
+ goto FAILED;
+ }
+ if (*ptr != ')')
+ {
+ *errorcodeptr = ERR60;
+ goto FAILED;
+ }
+ namelen = ptr - name;
+ for (i = 0; i < verbcount; i++)
+ {
+ if (namelen == verbs[i].len &&
+ strncmp((char *)name, vn, namelen) == 0)
+ {
+ *code = verbs[i].op;
+ if (*code++ == OP_ACCEPT) cd->had_accept = TRUE;
+ break;
+ }
+ vn += verbs[i].len + 1;
+ }
+ if (i < verbcount) continue;
+ *errorcodeptr = ERR60;
+ goto FAILED;
+ }
+
+ /* Deal with the extended parentheses; all are introduced by '?', and the
+ appearance of any of them means that this is not a capturing group. */
+
+ else if (*ptr == '?')
+ {
+ int i, set, unset, namelen;
+ int *optset;
+ const uschar *name;
+ uschar *slot;
+
+ switch (*(++ptr))
+ {
+ case '#': /* Comment; skip to ket */
+ ptr++;
+ while (*ptr != 0 && *ptr != ')') ptr++;
+ if (*ptr == 0)
+ {
+ *errorcodeptr = ERR18;
+ goto FAILED;
+ }
+ continue;
+
+
+ /* ------------------------------------------------------------ */
+ case '|': /* Reset capture count for each branch */
+ reset_bracount = TRUE;
+ /* Fall through */
+
+ /* ------------------------------------------------------------ */
+ case ':': /* Non-capturing bracket */
+ bravalue = OP_BRA;
+ ptr++;
+ break;
+
+
+ /* ------------------------------------------------------------ */
+ case '(':
+ bravalue = OP_COND; /* Conditional group */
+
+ /* A condition can be an assertion, a number (referring to a numbered
+ group), a name (referring to a named group), or 'R', referring to
+ recursion. R and R&name are also permitted for recursion tests.
+
+ There are several syntaxes for testing a named group: (?(name)) is used
+ by Python; Perl 5.10 onwards uses (?() or (?('name')).
+
+ There are two unfortunate ambiguities, caused by history. (a) 'R' can
+ be the recursive thing or the name 'R' (and similarly for 'R' followed
+ by digits), and (b) a number could be a name that consists of digits.
+ In both cases, we look for a name first; if not found, we try the other
+ cases. */
+
+ /* For conditions that are assertions, check the syntax, and then exit
+ the switch. This will take control down to where bracketed groups,
+ including assertions, are processed. */
+
+ if (ptr[1] == '?' && (ptr[2] == '=' || ptr[2] == '!' || ptr[2] == '<'))
+ break;
+
+ /* Most other conditions use OP_CREF (a couple change to OP_RREF
+ below), and all need to skip 3 bytes at the start of the group. */
+
+ code[1+LINK_SIZE] = OP_CREF;
+ skipbytes = 3;
+ refsign = -1;
+
+ /* Check for a test for recursion in a named group. */
+
+ if (ptr[1] == 'R' && ptr[2] == '&')
+ {
+ terminator = -1;
+ ptr += 2;
+ code[1+LINK_SIZE] = OP_RREF; /* Change the type of test */
+ }
+
+ /* Check for a test for a named group's having been set, using the Perl
+ syntax (?() or (?('name') */
+
+ else if (ptr[1] == '<')
+ {
+ terminator = '>';
+ ptr++;
+ }
+ else if (ptr[1] == '\'')
+ {
+ terminator = '\'';
+ ptr++;
+ }
+ else
+ {
+ terminator = 0;
+ if (ptr[1] == '-' || ptr[1] == '+') refsign = *(++ptr);
+ }
+
+ /* We now expect to read a name; any thing else is an error */
+
+ if ((cd->ctypes[ptr[1]] & ctype_word) == 0)
+ {
+ ptr += 1; /* To get the right offset */
+ *errorcodeptr = ERR28;
+ goto FAILED;
+ }
+
+ /* Read the name, but also get it as a number if it's all digits */
+
+ recno = 0;
+ name = ++ptr;
+ while ((cd->ctypes[*ptr] & ctype_word) != 0)
+ {
+ if (recno >= 0)
+ recno = ((digitab[*ptr] & ctype_digit) != 0)?
+ recno * 10 + *ptr - '0' : -1;
+ ptr++;
+ }
+ namelen = ptr - name;
+
+ if ((terminator > 0 && *ptr++ != terminator) || *ptr++ != ')')
+ {
+ ptr--; /* Error offset */
+ *errorcodeptr = ERR26;
+ goto FAILED;
+ }
+
+ /* Do no further checking in the pre-compile phase. */
+
+ if (lengthptr != NULL) break;
+
+ /* In the real compile we do the work of looking for the actual
+ reference. If the string started with "+" or "-" we require the rest to
+ be digits, in which case recno will be set. */
+
+ if (refsign > 0)
+ {
+ if (recno <= 0)
+ {
+ *errorcodeptr = ERR58;
+ goto FAILED;
+ }
+ if (refsign == '-')
+ {
+ recno = cd->bracount - recno + 1;
+ if (recno <= 0)
+ {
+ *errorcodeptr = ERR15;
+ goto FAILED;
+ }
+ }
+ else recno += cd->bracount;
+ PUT2(code, 2+LINK_SIZE, recno);
+ break;
+ }
+
+ /* Otherwise (did not start with "+" or "-"), start by looking for the
+ name. */
+
+ slot = cd->name_table;
+ for (i = 0; i < cd->names_found; i++)
+ {
+ if (strncmp((char *)name, (char *)slot+2, namelen) == 0) break;
+ slot += cd->name_entry_size;
+ }
+
+ /* Found a previous named subpattern */
+
+ if (i < cd->names_found)
+ {
+ recno = GET2(slot, 0);
+ PUT2(code, 2+LINK_SIZE, recno);
+ }
+
+ /* Search the pattern for a forward reference */
+
+ else if ((i = find_parens(ptr, cd->bracount, name, namelen,
+ (options & PCRE_EXTENDED) != 0)) > 0)
+ {
+ PUT2(code, 2+LINK_SIZE, i);
+ }
+
+ /* If terminator == 0 it means that the name followed directly after
+ the opening parenthesis [e.g. (?(abc)...] and in this case there are
+ some further alternatives to try. For the cases where terminator != 0
+ [things like (?(... or (?('name')... or (?(R&name)... ] we have
+ now checked all the possibilities, so give an error. */
+
+ else if (terminator != 0)
+ {
+ *errorcodeptr = ERR15;
+ goto FAILED;
+ }
+
+ /* Check for (?(R) for recursion. Allow digits after R to specify a
+ specific group number. */
+
+ else if (*name == 'R')
+ {
+ recno = 0;
+ for (i = 1; i < namelen; i++)
+ {
+ if ((digitab[name[i]] & ctype_digit) == 0)
+ {
+ *errorcodeptr = ERR15;
+ goto FAILED;
+ }
+ recno = recno * 10 + name[i] - '0';
+ }
+ if (recno == 0) recno = RREF_ANY;
+ code[1+LINK_SIZE] = OP_RREF; /* Change test type */
+ PUT2(code, 2+LINK_SIZE, recno);
+ }
+
+ /* Similarly, check for the (?(DEFINE) "condition", which is always
+ false. */
+
+ else if (namelen == 6 && strncmp((char *)name, "DEFINE", 6) == 0)
+ {
+ code[1+LINK_SIZE] = OP_DEF;
+ skipbytes = 1;
+ }
+
+ /* Check for the "name" actually being a subpattern number. */
+
+ else if (recno > 0)
+ {
+ PUT2(code, 2+LINK_SIZE, recno);
+ }
+
+ /* Either an unidentified subpattern, or a reference to (?(0) */
+
+ else
+ {
+ *errorcodeptr = (recno == 0)? ERR35: ERR15;
+ goto FAILED;
+ }
+ break;
+
+
+ /* ------------------------------------------------------------ */
+ case '=': /* Positive lookahead */
+ bravalue = OP_ASSERT;
+ ptr++;
+ break;
+
+
+ /* ------------------------------------------------------------ */
+ case '!': /* Negative lookahead */
+ ptr++;
+ if (*ptr == ')') /* Optimize (?!) */
+ {
+ *code++ = OP_FAIL;
+ previous = NULL;
+ continue;
+ }
+ bravalue = OP_ASSERT_NOT;
+ break;
+
+
+ /* ------------------------------------------------------------ */
+ case '<': /* Lookbehind or named define */
+ switch (ptr[1])
+ {
+ case '=': /* Positive lookbehind */
+ bravalue = OP_ASSERTBACK;
+ ptr += 2;
+ break;
+
+ case '!': /* Negative lookbehind */
+ bravalue = OP_ASSERTBACK_NOT;
+ ptr += 2;
+ break;
+
+ default: /* Could be name define, else bad */
+ if ((cd->ctypes[ptr[1]] & ctype_word) != 0) goto DEFINE_NAME;
+ ptr++; /* Correct offset for error */
+ *errorcodeptr = ERR24;
+ goto FAILED;
+ }
+ break;
+
+
+ /* ------------------------------------------------------------ */
+ case '>': /* One-time brackets */
+ bravalue = OP_ONCE;
+ ptr++;
+ break;
+
+
+ /* ------------------------------------------------------------ */
+ case 'C': /* Callout - may be followed by digits; */
+ previous_callout = code; /* Save for later completion */
+ after_manual_callout = 1; /* Skip one item before completing */
+ *code++ = OP_CALLOUT;
+ {
+ int n = 0;
+ while ((digitab[*(++ptr)] & ctype_digit) != 0)
+ n = n * 10 + *ptr - '0';
+ if (*ptr != ')')
+ {
+ *errorcodeptr = ERR39;
+ goto FAILED;
+ }
+ if (n > 255)
+ {
+ *errorcodeptr = ERR38;
+ goto FAILED;
+ }
+ *code++ = n;
+ PUT(code, 0, ptr - cd->start_pattern + 1); /* Pattern offset */
+ PUT(code, LINK_SIZE, 0); /* Default length */
+ code += 2 * LINK_SIZE;
+ }
+ previous = NULL;
+ continue;
+
+
+ /* ------------------------------------------------------------ */
+ case 'P': /* Python-style named subpattern handling */
+ if (*(++ptr) == '=' || *ptr == '>') /* Reference or recursion */
+ {
+ is_recurse = *ptr == '>';
+ terminator = ')';
+ goto NAMED_REF_OR_RECURSE;
+ }
+ else if (*ptr != '<') /* Test for Python-style definition */
+ {
+ *errorcodeptr = ERR41;
+ goto FAILED;
+ }
+ /* Fall through to handle (?P< as (?< is handled */
+
+
+ /* ------------------------------------------------------------ */
+ DEFINE_NAME: /* Come here from (?< handling */
+ case '\'':
+ {
+ terminator = (*ptr == '<')? '>' : '\'';
+ name = ++ptr;
+
+ while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++;
+ namelen = ptr - name;
+
+ /* In the pre-compile phase, just do a syntax check. */
+
+ if (lengthptr != NULL)
+ {
+ if (*ptr != terminator)
+ {
+ *errorcodeptr = ERR42;
+ goto FAILED;
+ }
+ if (cd->names_found >= MAX_NAME_COUNT)
+ {
+ *errorcodeptr = ERR49;
+ goto FAILED;
+ }
+ if (namelen + 3 > cd->name_entry_size)
+ {
+ cd->name_entry_size = namelen + 3;
+ if (namelen > MAX_NAME_SIZE)
+ {
+ *errorcodeptr = ERR48;
+ goto FAILED;
+ }
+ }
+ }
+
+ /* In the real compile, create the entry in the table */
+
+ else
+ {
+ slot = cd->name_table;
+ for (i = 0; i < cd->names_found; i++)
+ {
+ int crc = memcmp(name, slot+2, namelen);
+ if (crc == 0)
+ {
+ if (slot[2+namelen] == 0)
+ {
+ if ((options & PCRE_DUPNAMES) == 0)
+ {
+ *errorcodeptr = ERR43;
+ goto FAILED;
+ }
+ }
+ else crc = -1; /* Current name is substring */
+ }
+ if (crc < 0)
+ {
+ memmove(slot + cd->name_entry_size, slot,
+ (cd->names_found - i) * cd->name_entry_size);
+ break;
+ }
+ slot += cd->name_entry_size;
+ }
+
+ PUT2(slot, 0, cd->bracount + 1);
+ memcpy(slot + 2, name, namelen);
+ slot[2+namelen] = 0;
+ }
+ }
+
+ /* In both cases, count the number of names we've encountered. */
+
+ ptr++; /* Move past > or ' */
+ cd->names_found++;
+ goto NUMBERED_GROUP;
+
+
+ /* ------------------------------------------------------------ */
+ case '&': /* Perl recursion/subroutine syntax */
+ terminator = ')';
+ is_recurse = TRUE;
+ /* Fall through */
+
+ /* We come here from the Python syntax above that handles both
+ references (?P=name) and recursion (?P>name), as well as falling
+ through from the Perl recursion syntax (?&name). */
+
+ NAMED_REF_OR_RECURSE:
+ name = ++ptr;
+ while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++;
+ namelen = ptr - name;
+
+ /* In the pre-compile phase, do a syntax check and set a dummy
+ reference number. */
+
+ if (lengthptr != NULL)
+ {
+ if (*ptr != terminator)
+ {
+ *errorcodeptr = ERR42;
+ goto FAILED;
+ }
+ if (namelen > MAX_NAME_SIZE)
+ {
+ *errorcodeptr = ERR48;
+ goto FAILED;
+ }
+ recno = 0;
+ }
+
+ /* In the real compile, seek the name in the table */
+
+ else
+ {
+ slot = cd->name_table;
+ for (i = 0; i < cd->names_found; i++)
+ {
+ if (strncmp((char *)name, (char *)slot+2, namelen) == 0) break;
+ slot += cd->name_entry_size;
+ }
+
+ if (i < cd->names_found) /* Back reference */
+ {
+ recno = GET2(slot, 0);
+ }
+ else if ((recno = /* Forward back reference */
+ find_parens(ptr, cd->bracount, name, namelen,
+ (options & PCRE_EXTENDED) != 0)) <= 0)
+ {
+ *errorcodeptr = ERR15;
+ goto FAILED;
+ }
+ }
+
+ /* In both phases, we can now go to the code than handles numerical
+ recursion or backreferences. */
+
+ if (is_recurse) goto HANDLE_RECURSION;
+ else goto HANDLE_REFERENCE;
+
+
+ /* ------------------------------------------------------------ */
+ case 'R': /* Recursion */
+ ptr++; /* Same as (?0) */
+ /* Fall through */
+
+
+ /* ------------------------------------------------------------ */
+ case '-': case '+':
+ case '0': case '1': case '2': case '3': case '4': /* Recursion or */
+ case '5': case '6': case '7': case '8': case '9': /* subroutine */
+ {
+ const uschar *called;
+
+ if ((refsign = *ptr) == '+') ptr++;
+ else if (refsign == '-')
+ {
+ if ((digitab[ptr[1]] & ctype_digit) == 0)
+ goto OTHER_CHAR_AFTER_QUERY;
+ ptr++;
+ }
+
+ recno = 0;
+ while((digitab[*ptr] & ctype_digit) != 0)
+ recno = recno * 10 + *ptr++ - '0';
+
+ if (*ptr != ')')
+ {
+ *errorcodeptr = ERR29;
+ goto FAILED;
+ }
+
+ if (refsign == '-')
+ {
+ if (recno == 0)
+ {
+ *errorcodeptr = ERR58;
+ goto FAILED;
+ }
+ recno = cd->bracount - recno + 1;
+ if (recno <= 0)
+ {
+ *errorcodeptr = ERR15;
+ goto FAILED;
+ }
+ }
+ else if (refsign == '+')
+ {
+ if (recno == 0)
+ {
+ *errorcodeptr = ERR58;
+ goto FAILED;
+ }
+ recno += cd->bracount;
+ }
+
+ /* Come here from code above that handles a named recursion */
+
+ HANDLE_RECURSION:
+
+ previous = code;
+ called = cd->start_code;
+
+ /* When we are actually compiling, find the bracket that is being
+ referenced. Temporarily end the regex in case it doesn't exist before
+ this point. If we end up with a forward reference, first check that
+ the bracket does occur later so we can give the error (and position)
+ now. Then remember this forward reference in the workspace so it can
+ be filled in at the end. */
+
+ if (lengthptr == NULL)
+ {
+ *code = OP_END;
+ if (recno != 0) called = find_bracket(cd->start_code, utf8, recno);
+
+ /* Forward reference */
+
+ if (called == NULL)
+ {
+ if (find_parens(ptr, cd->bracount, NULL, recno,
+ (options & PCRE_EXTENDED) != 0) < 0)
+ {
+ *errorcodeptr = ERR15;
+ goto FAILED;
+ }
+ called = cd->start_code + recno;
+ PUTINC(cd->hwm, 0, code + 2 + LINK_SIZE - cd->start_code);
+ }
+
+ /* If not a forward reference, and the subpattern is still open,
+ this is a recursive call. We check to see if this is a left
+ recursion that could loop for ever, and diagnose that case. */
+
+ else if (GET(called, 1) == 0 &&
+ could_be_empty(called, code, bcptr, utf8))
+ {
+ *errorcodeptr = ERR40;
+ goto FAILED;
+ }
+ }
+
+ /* Insert the recursion/subroutine item, automatically wrapped inside
+ "once" brackets. Set up a "previous group" length so that a
+ subsequent quantifier will work. */
+
+ *code = OP_ONCE;
+ PUT(code, 1, 2 + 2*LINK_SIZE);
+ code += 1 + LINK_SIZE;
+
+ *code = OP_RECURSE;
+ PUT(code, 1, called - cd->start_code);
+ code += 1 + LINK_SIZE;
+
+ *code = OP_KET;
+ PUT(code, 1, 2 + 2*LINK_SIZE);
+ code += 1 + LINK_SIZE;
+
+ length_prevgroup = 3 + 3*LINK_SIZE;
+ }
+
+ /* Can't determine a first byte now */
+
+ if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+ continue;
+
+
+ /* ------------------------------------------------------------ */
+ default: /* Other characters: check option setting */
+ OTHER_CHAR_AFTER_QUERY:
+ set = unset = 0;
+ optset = &set;
+
+ while (*ptr != ')' && *ptr != ':')
+ {
+ switch (*ptr++)
+ {
+ case '-': optset = &unset; break;
+
+ case 'J': /* Record that it changed in the external options */
+ *optset |= PCRE_DUPNAMES;
+ cd->external_flags |= PCRE_JCHANGED;
+ break;
+
+ case 'i': *optset |= PCRE_CASELESS; break;
+ case 'm': *optset |= PCRE_MULTILINE; break;
+ case 's': *optset |= PCRE_DOTALL; break;
+ case 'x': *optset |= PCRE_EXTENDED; break;
+ case 'U': *optset |= PCRE_UNGREEDY; break;
+ case 'X': *optset |= PCRE_EXTRA; break;
+
+ default: *errorcodeptr = ERR12;
+ ptr--; /* Correct the offset */
+ goto FAILED;
+ }
+ }
+
+ /* Set up the changed option bits, but don't change anything yet. */
+
+ newoptions = (options | set) & (~unset);
+
+ /* If the options ended with ')' this is not the start of a nested
+ group with option changes, so the options change at this level. If this
+ item is right at the start of the pattern, the options can be
+ abstracted and made external in the pre-compile phase, and ignored in
+ the compile phase. This can be helpful when matching -- for instance in
+ caseless checking of required bytes.
+
+ If the code pointer is not (cd->start_code + 1 + LINK_SIZE), we are
+ definitely *not* at the start of the pattern because something has been
+ compiled. In the pre-compile phase, however, the code pointer can have
+ that value after the start, because it gets reset as code is discarded
+ during the pre-compile. However, this can happen only at top level - if
+ we are within parentheses, the starting BRA will still be present. At
+ any parenthesis level, the length value can be used to test if anything
+ has been compiled at that level. Thus, a test for both these conditions
+ is necessary to ensure we correctly detect the start of the pattern in
+ both phases.
+
+ If we are not at the pattern start, compile code to change the ims
+ options if this setting actually changes any of them. We also pass the
+ new setting back so that it can be put at the start of any following
+ branches, and when this group ends (if we are in a group), a resetting
+ item can be compiled. */
+
+ if (*ptr == ')')
+ {
+ if (code == cd->start_code + 1 + LINK_SIZE &&
+ (lengthptr == NULL || *lengthptr == 2 + 2*LINK_SIZE))
+ {
+ cd->external_options = newoptions;
+ options = newoptions;
+ }
+ else
+ {
+ if ((options & PCRE_IMS) != (newoptions & PCRE_IMS))
+ {
+ *code++ = OP_OPT;
+ *code++ = newoptions & PCRE_IMS;
+ }
+
+ /* Change options at this level, and pass them back for use
+ in subsequent branches. Reset the greedy defaults and the case
+ value for firstbyte and reqbyte. */
+
+ *optionsptr = options = newoptions;
+ greedy_default = ((newoptions & PCRE_UNGREEDY) != 0);
+ greedy_non_default = greedy_default ^ 1;
+ req_caseopt = ((options & PCRE_CASELESS) != 0)? REQ_CASELESS : 0;
+ }
+
+ previous = NULL; /* This item can't be repeated */
+ continue; /* It is complete */
+ }
+
+ /* If the options ended with ':' we are heading into a nested group
+ with possible change of options. Such groups are non-capturing and are
+ not assertions of any kind. All we need to do is skip over the ':';
+ the newoptions value is handled below. */
+
+ bravalue = OP_BRA;
+ ptr++;
+ } /* End of switch for character following (? */
+ } /* End of (? handling */
+
+ /* Opening parenthesis not followed by '?'. If PCRE_NO_AUTO_CAPTURE is set,
+ all unadorned brackets become non-capturing and behave like (?:...)
+ brackets. */
+
+ else if ((options & PCRE_NO_AUTO_CAPTURE) != 0)
+ {
+ bravalue = OP_BRA;
+ }
+
+ /* Else we have a capturing group. */
+
+ else
+ {
+ NUMBERED_GROUP:
+ cd->bracount += 1;
+ PUT2(code, 1+LINK_SIZE, cd->bracount);
+ skipbytes = 2;
+ }
+
+ /* Process nested bracketed regex. Assertions may not be repeated, but
+ other kinds can be. All their opcodes are >= OP_ONCE. We copy code into a
+ non-register variable in order to be able to pass its address because some
+ compilers complain otherwise. Pass in a new setting for the ims options if
+ they have changed. */
+
+ previous = (bravalue >= OP_ONCE)? code : NULL;
+ *code = bravalue;
+ tempcode = code;
+ tempreqvary = cd->req_varyopt; /* Save value before bracket */
+ length_prevgroup = 0; /* Initialize for pre-compile phase */
+
+ if (!compile_regex(
+ newoptions, /* The complete new option state */
+ options & PCRE_IMS, /* The previous ims option state */
+ &tempcode, /* Where to put code (updated) */
+ &ptr, /* Input pointer (updated) */
+ errorcodeptr, /* Where to put an error message */
+ (bravalue == OP_ASSERTBACK ||
+ bravalue == OP_ASSERTBACK_NOT), /* TRUE if back assert */
+ reset_bracount, /* True if (?| group */
+ skipbytes, /* Skip over bracket number */
+ &subfirstbyte, /* For possible first char */
+ &subreqbyte, /* For possible last char */
+ bcptr, /* Current branch chain */
+ cd, /* Tables block */
+ (lengthptr == NULL)? NULL : /* Actual compile phase */
+ &length_prevgroup /* Pre-compile phase */
+ ))
+ goto FAILED;
+
+ /* At the end of compiling, code is still pointing to the start of the
+ group, while tempcode has been updated to point past the end of the group
+ and any option resetting that may follow it. The pattern pointer (ptr)
+ is on the bracket. */
+
+ /* If this is a conditional bracket, check that there are no more than
+ two branches in the group, or just one if it's a DEFINE group. We do this
+ in the real compile phase, not in the pre-pass, where the whole group may
+ not be available. */
+
+ if (bravalue == OP_COND && lengthptr == NULL)
+ {
+ uschar *tc = code;
+ int condcount = 0;
+
+ do {
+ condcount++;
+ tc += GET(tc,1);
+ }
+ while (*tc != OP_KET);
+
+ /* A DEFINE group is never obeyed inline (the "condition" is always
+ false). It must have only one branch. */
+
+ if (code[LINK_SIZE+1] == OP_DEF)
+ {
+ if (condcount > 1)
+ {
+ *errorcodeptr = ERR54;
+ goto FAILED;
+ }
+ bravalue = OP_DEF; /* Just a flag to suppress char handling below */
+ }
+
+ /* A "normal" conditional group. If there is just one branch, we must not
+ make use of its firstbyte or reqbyte, because this is equivalent to an
+ empty second branch. */
+
+ else
+ {
+ if (condcount > 2)
+ {
+ *errorcodeptr = ERR27;
+ goto FAILED;
+ }
+ if (condcount == 1) subfirstbyte = subreqbyte = REQ_NONE;
+ }
+ }
+
+ /* Error if hit end of pattern */
+
+ if (*ptr != ')')
+ {
+ *errorcodeptr = ERR14;
+ goto FAILED;
+ }
+
+ /* In the pre-compile phase, update the length by the length of the group,
+ less the brackets at either end. Then reduce the compiled code to just a
+ set of non-capturing brackets so that it doesn't use much memory if it is
+ duplicated by a quantifier.*/
+
+ if (lengthptr != NULL)
+ {
+ if (OFLOW_MAX - *lengthptr < length_prevgroup - 2 - 2*LINK_SIZE)
+ {
+ *errorcodeptr = ERR20;
+ goto FAILED;
+ }
+ *lengthptr += length_prevgroup - 2 - 2*LINK_SIZE;
+ *code++ = OP_BRA;
+ PUTINC(code, 0, 1 + LINK_SIZE);
+ *code++ = OP_KET;
+ PUTINC(code, 0, 1 + LINK_SIZE);
+ break; /* No need to waste time with special character handling */
+ }
+
+ /* Otherwise update the main code pointer to the end of the group. */
+
+ code = tempcode;
+
+ /* For a DEFINE group, required and first character settings are not
+ relevant. */
+
+ if (bravalue == OP_DEF) break;
+
+ /* Handle updating of the required and first characters for other types of
+ group. Update for normal brackets of all kinds, and conditions with two
+ branches (see code above). If the bracket is followed by a quantifier with
+ zero repeat, we have to back off. Hence the definition of zeroreqbyte and
+ zerofirstbyte outside the main loop so that they can be accessed for the
+ back off. */
+
+ zeroreqbyte = reqbyte;
+ zerofirstbyte = firstbyte;
+ groupsetfirstbyte = FALSE;
+
+ if (bravalue >= OP_ONCE)
+ {
+ /* If we have not yet set a firstbyte in this branch, take it from the
+ subpattern, remembering that it was set here so that a repeat of more
+ than one can replicate it as reqbyte if necessary. If the subpattern has
+ no firstbyte, set "none" for the whole branch. In both cases, a zero
+ repeat forces firstbyte to "none". */
+
+ if (firstbyte == REQ_UNSET)
+ {
+ if (subfirstbyte >= 0)
+ {
+ firstbyte = subfirstbyte;
+ groupsetfirstbyte = TRUE;
+ }
+ else firstbyte = REQ_NONE;
+ zerofirstbyte = REQ_NONE;
+ }
+
+ /* If firstbyte was previously set, convert the subpattern's firstbyte
+ into reqbyte if there wasn't one, using the vary flag that was in
+ existence beforehand. */
+
+ else if (subfirstbyte >= 0 && subreqbyte < 0)
+ subreqbyte = subfirstbyte | tempreqvary;
+
+ /* If the subpattern set a required byte (or set a first byte that isn't
+ really the first byte - see above), set it. */
+
+ if (subreqbyte >= 0) reqbyte = subreqbyte;
+ }
+
+ /* For a forward assertion, we take the reqbyte, if set. This can be
+ helpful if the pattern that follows the assertion doesn't set a different
+ char. For example, it's useful for /(?=abcde).+/. We can't set firstbyte
+ for an assertion, however because it leads to incorrect effect for patterns
+ such as /(?=a)a.+/ when the "real" "a" would then become a reqbyte instead
+ of a firstbyte. This is overcome by a scan at the end if there's no
+ firstbyte, looking for an asserted first char. */
+
+ else if (bravalue == OP_ASSERT && subreqbyte >= 0) reqbyte = subreqbyte;
+ break; /* End of processing '(' */
+
+
+ /* ===================================================================*/
+ /* Handle metasequences introduced by \. For ones like \d, the ESC_ values
+ are arranged to be the negation of the corresponding OP_values. For the
+ back references, the values are ESC_REF plus the reference number. Only
+ back references and those types that consume a character may be repeated.
+ We can test for values between ESC_b and ESC_Z for the latter; this may
+ have to change if any new ones are ever created. */
+
+ case '\\':
+ tempptr = ptr;
+ c = check_escape(&ptr, errorcodeptr, cd->bracount, options, FALSE);
+ if (*errorcodeptr != 0) goto FAILED;
+
+ if (c < 0)
+ {
+ if (-c == ESC_Q) /* Handle start of quoted string */
+ {
+ if (ptr[1] == '\\' && ptr[2] == 'E') ptr += 2; /* avoid empty string */
+ else inescq = TRUE;
+ continue;
+ }
+
+ if (-c == ESC_E) continue; /* Perl ignores an orphan \E */
+
+ /* For metasequences that actually match a character, we disable the
+ setting of a first character if it hasn't already been set. */
+
+ if (firstbyte == REQ_UNSET && -c > ESC_b && -c < ESC_Z)
+ firstbyte = REQ_NONE;
+
+ /* Set values to reset to if this is followed by a zero repeat. */
+
+ zerofirstbyte = firstbyte;
+ zeroreqbyte = reqbyte;
+
+ /* \k or \k'name' is a back reference by name (Perl syntax).
+ We also support \k{name} (.NET syntax) */
+
+ if (-c == ESC_k && (ptr[1] == '<' || ptr[1] == '\'' || ptr[1] == '{'))
+ {
+ is_recurse = FALSE;
+ terminator = (*(++ptr) == '<')? '>' : (*ptr == '\'')? '\'' : '}';
+ goto NAMED_REF_OR_RECURSE;
+ }
+
+ /* Back references are handled specially; must disable firstbyte if
+ not set to cope with cases like (?=(\w+))\1: which would otherwise set
+ ':' later. */
+
+ if (-c >= ESC_REF)
+ {
+ recno = -c - ESC_REF;
+
+ HANDLE_REFERENCE: /* Come here from named backref handling */
+ if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
+ previous = code;
+ *code++ = OP_REF;
+ PUT2INC(code, 0, recno);
+ cd->backref_map |= (recno < 32)? (1 << recno) : 1;
+ if (recno > cd->top_backref) cd->top_backref = recno;
+ }
+
+ /* So are Unicode property matches, if supported. */
+
+#ifdef SUPPORT_UCP
+ else if (-c == ESC_P || -c == ESC_p)
+ {
+ BOOL negated;
+ int pdata;
+ int ptype = get_ucp(&ptr, &negated, &pdata, errorcodeptr);
+ if (ptype < 0) goto FAILED;
+ previous = code;
+ *code++ = ((-c == ESC_p) != negated)? OP_PROP : OP_NOTPROP;
+ *code++ = ptype;
+ *code++ = pdata;
+ }
+#else
+
+ /* If Unicode properties are not supported, \X, \P, and \p are not
+ allowed. */
+
+ else if (-c == ESC_X || -c == ESC_P || -c == ESC_p)
+ {
+ *errorcodeptr = ERR45;
+ goto FAILED;
+ }
+#endif
+
+ /* For the rest (including \X when Unicode properties are supported), we
+ can obtain the OP value by negating the escape value. */
+
+ else
+ {
+ previous = (-c > ESC_b && -c < ESC_Z)? code : NULL;
+ *code++ = -c;
+ }
+ continue;
+ }
+
+ /* We have a data character whose value is in c. In UTF-8 mode it may have
+ a value > 127. We set its representation in the length/buffer, and then
+ handle it as a data character. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && c > 127)
+ mclength = _pcre_ord2utf8(c, mcbuffer);
+ else
+#endif
+
+ {
+ mcbuffer[0] = c;
+ mclength = 1;
+ }
+ goto ONE_CHAR;
+
+
+ /* ===================================================================*/
+ /* Handle a literal character. It is guaranteed not to be whitespace or #
+ when the extended flag is set. If we are in UTF-8 mode, it may be a
+ multi-byte literal character. */
+
+ default:
+ NORMAL_CHAR:
+ mclength = 1;
+ mcbuffer[0] = c;
+
+#ifdef SUPPORT_UTF8
+ if (utf8 && c >= 0xc0)
+ {
+ while ((ptr[1] & 0xc0) == 0x80)
+ mcbuffer[mclength++] = *(++ptr);
+ }
+#endif
+
+ /* At this point we have the character's bytes in mcbuffer, and the length
+ in mclength. When not in UTF-8 mode, the length is always 1. */
+
+ ONE_CHAR:
+ previous = code;
+ *code++ = ((options & PCRE_CASELESS) != 0)? OP_CHARNC : OP_CHAR;
+ for (c = 0; c < mclength; c++) *code++ = mcbuffer[c];
+
+ /* Remember if \r or \n were seen */
+
+ if (mcbuffer[0] == '\r' || mcbuffer[0] == '\n')
+ cd->external_flags |= PCRE_HASCRORLF;
+
+ /* Set the first and required bytes appropriately. If no previous first
+ byte, set it from this character, but revert to none on a zero repeat.
+ Otherwise, leave the firstbyte value alone, and don't change it on a zero
+ repeat. */
+
+ if (firstbyte == REQ_UNSET)
+ {
+ zerofirstbyte = REQ_NONE;
+ zeroreqbyte = reqbyte;
+
+ /* If the character is more than one byte long, we can set firstbyte
+ only if it is not to be matched caselessly. */
+
+ if (mclength == 1 || req_caseopt == 0)
+ {
+ firstbyte = mcbuffer[0] | req_caseopt;
+ if (mclength != 1) reqbyte = code[-1] | cd->req_varyopt;
+ }
+ else firstbyte = reqbyte = REQ_NONE;
+ }
+
+ /* firstbyte was previously set; we can set reqbyte only the length is
+ 1 or the matching is caseful. */
+
+ else
+ {
+ zerofirstbyte = firstbyte;
+ zeroreqbyte = reqbyte;
+ if (mclength == 1 || req_caseopt == 0)
+ reqbyte = code[-1] | req_caseopt | cd->req_varyopt;
+ }
+
+ break; /* End of literal character handling */
+ }
+ } /* end of big loop */
+
+
+/* Control never reaches here by falling through, only by a goto for all the
+error states. Pass back the position in the pattern so that it can be displayed
+to the user for diagnosing the error. */
+
+FAILED:
+*ptrptr = ptr;
+return FALSE;
+}
+
+
+
+
+/*************************************************
+* Compile sequence of alternatives *
+*************************************************/
+
+/* On entry, ptr is pointing past the bracket character, but on return it
+points to the closing bracket, or vertical bar, or end of string. The code
+variable is pointing at the byte into which the BRA operator has been stored.
+If the ims options are changed at the start (for a (?ims: group) or during any
+branch, we need to insert an OP_OPT item at the start of every following branch
+to ensure they get set correctly at run time, and also pass the new options
+into every subsequent branch compile.
+
+This function is used during the pre-compile phase when we are trying to find
+out the amount of memory needed, as well as during the real compile phase. The
+value of lengthptr distinguishes the two phases.
+
+Arguments:
+ options option bits, including any changes for this subpattern
+ oldims previous settings of ims option bits
+ codeptr -> the address of the current code pointer
+ ptrptr -> the address of the current pattern pointer
+ errorcodeptr -> pointer to error code variable
+ lookbehind TRUE if this is a lookbehind assertion
+ reset_bracount TRUE to reset the count for each branch
+ skipbytes skip this many bytes at start (for brackets and OP_COND)
+ firstbyteptr place to put the first required character, or a negative number
+ reqbyteptr place to put the last required character, or a negative number
+ bcptr pointer to the chain of currently open branches
+ cd points to the data block with tables pointers etc.
+ lengthptr NULL during the real compile phase
+ points to length accumulator during pre-compile phase
+
+Returns: TRUE on success
+*/
+
+static BOOL
+compile_regex(int options, int oldims, uschar **codeptr, const uschar **ptrptr,
+ int *errorcodeptr, BOOL lookbehind, BOOL reset_bracount, int skipbytes,
+ int *firstbyteptr, int *reqbyteptr, branch_chain *bcptr, compile_data *cd,
+ int *lengthptr)
+{
+const uschar *ptr = *ptrptr;
+uschar *code = *codeptr;
+uschar *last_branch = code;
+uschar *start_bracket = code;
+uschar *reverse_count = NULL;
+int firstbyte, reqbyte;
+int branchfirstbyte, branchreqbyte;
+int length;
+int orig_bracount;
+int max_bracount;
+branch_chain bc;
+
+bc.outer = bcptr;
+bc.current = code;
+
+firstbyte = reqbyte = REQ_UNSET;
+
+/* Accumulate the length for use in the pre-compile phase. Start with the
+length of the BRA and KET and any extra bytes that are required at the
+beginning. We accumulate in a local variable to save frequent testing of
+lenthptr for NULL. We cannot do this by looking at the value of code at the
+start and end of each alternative, because compiled items are discarded during
+the pre-compile phase so that the work space is not exceeded. */
+
+length = 2 + 2*LINK_SIZE + skipbytes;
+
+/* WARNING: If the above line is changed for any reason, you must also change
+the code that abstracts option settings at the start of the pattern and makes
+them global. It tests the value of length for (2 + 2*LINK_SIZE) in the
+pre-compile phase to find out whether anything has yet been compiled or not. */
+
+/* Offset is set zero to mark that this bracket is still open */
+
+PUT(code, 1, 0);
+code += 1 + LINK_SIZE + skipbytes;
+
+/* Loop for each alternative branch */
+
+orig_bracount = max_bracount = cd->bracount;
+for (;;)
+ {
+ /* For a (?| group, reset the capturing bracket count so that each branch
+ uses the same numbers. */
+
+ if (reset_bracount) cd->bracount = orig_bracount;
+
+ /* Handle a change of ims options at the start of the branch */
+
+ if ((options & PCRE_IMS) != oldims)
+ {
+ *code++ = OP_OPT;
+ *code++ = options & PCRE_IMS;
+ length += 2;
+ }
+
+ /* Set up dummy OP_REVERSE if lookbehind assertion */
+
+ if (lookbehind)
+ {
+ *code++ = OP_REVERSE;
+ reverse_count = code;
+ PUTINC(code, 0, 0);
+ length += 1 + LINK_SIZE;
+ }
+
+ /* Now compile the branch; in the pre-compile phase its length gets added
+ into the length. */
+
+ if (!compile_branch(&options, &code, &ptr, errorcodeptr, &branchfirstbyte,
+ &branchreqbyte, &bc, cd, (lengthptr == NULL)? NULL : &length))
+ {
+ *ptrptr = ptr;
+ return FALSE;
+ }
+
+ /* Keep the highest bracket count in case (?| was used and some branch
+ has fewer than the rest. */
+
+ if (cd->bracount > max_bracount) max_bracount = cd->bracount;
+
+ /* In the real compile phase, there is some post-processing to be done. */
+
+ if (lengthptr == NULL)
+ {
+ /* If this is the first branch, the firstbyte and reqbyte values for the
+ branch become the values for the regex. */
+
+ if (*last_branch != OP_ALT)
+ {
+ firstbyte = branchfirstbyte;
+ reqbyte = branchreqbyte;
+ }
+
+ /* If this is not the first branch, the first char and reqbyte have to
+ match the values from all the previous branches, except that if the
+ previous value for reqbyte didn't have REQ_VARY set, it can still match,
+ and we set REQ_VARY for the regex. */
+
+ else
+ {
+ /* If we previously had a firstbyte, but it doesn't match the new branch,
+ we have to abandon the firstbyte for the regex, but if there was
+ previously no reqbyte, it takes on the value of the old firstbyte. */
+
+ if (firstbyte >= 0 && firstbyte != branchfirstbyte)
+ {
+ if (reqbyte < 0) reqbyte = firstbyte;
+ firstbyte = REQ_NONE;
+ }
+
+ /* If we (now or from before) have no firstbyte, a firstbyte from the
+ branch becomes a reqbyte if there isn't a branch reqbyte. */
+
+ if (firstbyte < 0 && branchfirstbyte >= 0 && branchreqbyte < 0)
+ branchreqbyte = branchfirstbyte;
+
+ /* Now ensure that the reqbytes match */
+
+ if ((reqbyte & ~REQ_VARY) != (branchreqbyte & ~REQ_VARY))
+ reqbyte = REQ_NONE;
+ else reqbyte |= branchreqbyte; /* To "or" REQ_VARY */
+ }
+
+ /* If lookbehind, check that this branch matches a fixed-length string, and
+ put the length into the OP_REVERSE item. Temporarily mark the end of the
+ branch with OP_END. */
+
+ if (lookbehind)
+ {
+ int fixed_length;
+ *code = OP_END;
+ fixed_length = find_fixedlength(last_branch, options);
+ DPRINTF(("fixed length = %d\n", fixed_length));
+ if (fixed_length < 0)
+ {
+ *errorcodeptr = (fixed_length == -2)? ERR36 : ERR25;
+ *ptrptr = ptr;
+ return FALSE;
+ }
+ PUT(reverse_count, 0, fixed_length);
+ }
+ }
+
+ /* Reached end of expression, either ')' or end of pattern. In the real
+ compile phase, go back through the alternative branches and reverse the chain
+ of offsets, with the field in the BRA item now becoming an offset to the
+ first alternative. If there are no alternatives, it points to the end of the
+ group. The length in the terminating ket is always the length of the whole
+ bracketed item. If any of the ims options were changed inside the group,
+ compile a resetting op-code following, except at the very end of the pattern.
+ Return leaving the pointer at the terminating char. */
+
+ if (*ptr != '|')
+ {
+ if (lengthptr == NULL)
+ {
+ int branch_length = code - last_branch;
+ do
+ {
+ int prev_length = GET(last_branch, 1);
+ PUT(last_branch, 1, branch_length);
+ branch_length = prev_length;
+ last_branch -= branch_length;
+ }
+ while (branch_length > 0);
+ }
+
+ /* Fill in the ket */
+
+ *code = OP_KET;
+ PUT(code, 1, code - start_bracket);
+ code += 1 + LINK_SIZE;
+
+ /* Resetting option if needed */
+
+ if ((options & PCRE_IMS) != oldims && *ptr == ')')
+ {
+ *code++ = OP_OPT;
+ *code++ = oldims;
+ length += 2;
+ }
+
+ /* Retain the highest bracket number, in case resetting was used. */
+
+ cd->bracount = max_bracount;
+
+ /* Set values to pass back */
+
+ *codeptr = code;
+ *ptrptr = ptr;
+ *firstbyteptr = firstbyte;
+ *reqbyteptr = reqbyte;
+ if (lengthptr != NULL)
+ {
+ if (OFLOW_MAX - *lengthptr < length)
+ {
+ *errorcodeptr = ERR20;
+ return FALSE;
+ }
+ *lengthptr += length;
+ }
+ return TRUE;
+ }
+
+ /* Another branch follows. In the pre-compile phase, we can move the code
+ pointer back to where it was for the start of the first branch. (That is,
+ pretend that each branch is the only one.)
+
+ In the real compile phase, insert an ALT node. Its length field points back
+ to the previous branch while the bracket remains open. At the end the chain
+ is reversed. It's done like this so that the start of the bracket has a
+ zero offset until it is closed, making it possible to detect recursion. */
+
+ if (lengthptr != NULL)
+ {
+ code = *codeptr + 1 + LINK_SIZE + skipbytes;
+ length += 1 + LINK_SIZE;
+ }
+ else
+ {
+ *code = OP_ALT;
+ PUT(code, 1, code - last_branch);
+ bc.current = last_branch = code;
+ code += 1 + LINK_SIZE;
+ }
+
+ ptr++;
+ }
+/* Control never reaches here */
+}
+
+
+
+
+/*************************************************
+* Check for anchored expression *
+*************************************************/
+
+/* Try to find out if this is an anchored regular expression. Consider each
+alternative branch. If they all start with OP_SOD or OP_CIRC, or with a bracket
+all of whose alternatives start with OP_SOD or OP_CIRC (recurse ad lib), then
+it's anchored. However, if this is a multiline pattern, then only OP_SOD
+counts, since OP_CIRC can match in the middle.
+
+We can also consider a regex to be anchored if OP_SOM starts all its branches.
+This is the code for \G, which means "match at start of match position, taking
+into account the match offset".
+
+A branch is also implicitly anchored if it starts with .* and DOTALL is set,
+because that will try the rest of the pattern at all possible matching points,
+so there is no point trying again.... er ....
+
+.... except when the .* appears inside capturing parentheses, and there is a
+subsequent back reference to those parentheses. We haven't enough information
+to catch that case precisely.
+
+At first, the best we could do was to detect when .* was in capturing brackets
+and the highest back reference was greater than or equal to that level.
+However, by keeping a bitmap of the first 31 back references, we can catch some
+of the more common cases more precisely.
+
+Arguments:
+ code points to start of expression (the bracket)
+ options points to the options setting
+ bracket_map a bitmap of which brackets we are inside while testing; this
+ handles up to substring 31; after that we just have to take
+ the less precise approach
+ backref_map the back reference bitmap
+
+Returns: TRUE or FALSE
+*/
+
+static BOOL
+is_anchored(register const uschar *code, int *options, unsigned int bracket_map,
+ unsigned int backref_map)
+{
+do {
+ const uschar *scode = first_significant_code(code + _pcre_OP_lengths[*code],
+ options, PCRE_MULTILINE, FALSE);
+ register int op = *scode;
+
+ /* Non-capturing brackets */
+
+ if (op == OP_BRA)
+ {
+ if (!is_anchored(scode, options, bracket_map, backref_map)) return FALSE;
+ }
+
+ /* Capturing brackets */
+
+ else if (op == OP_CBRA)
+ {
+ int n = GET2(scode, 1+LINK_SIZE);
+ int new_map = bracket_map | ((n < 32)? (1 << n) : 1);
+ if (!is_anchored(scode, options, new_map, backref_map)) return FALSE;
+ }
+
+ /* Other brackets */
+
+ else if (op == OP_ASSERT || op == OP_ONCE || op == OP_COND)
+ {
+ if (!is_anchored(scode, options, bracket_map, backref_map)) return FALSE;
+ }
+
+ /* .* is not anchored unless DOTALL is set and it isn't in brackets that
+ are or may be referenced. */
+
+ else if ((op == OP_TYPESTAR || op == OP_TYPEMINSTAR ||
+ op == OP_TYPEPOSSTAR) &&
+ (*options & PCRE_DOTALL) != 0)
+ {
+ if (scode[1] != OP_ANY || (bracket_map & backref_map) != 0) return FALSE;
+ }
+
+ /* Check for explicit anchoring */
+
+ else if (op != OP_SOD && op != OP_SOM &&
+ ((*options & PCRE_MULTILINE) != 0 || op != OP_CIRC))
+ return FALSE;
+ code += GET(code, 1);
+ }
+while (*code == OP_ALT); /* Loop for each alternative */
+return TRUE;
+}
+
+
+
+/*************************************************
+* Check for starting with ^ or .* *
+*************************************************/
+
+/* This is called to find out if every branch starts with ^ or .* so that
+"first char" processing can be done to speed things up in multiline
+matching and for non-DOTALL patterns that start with .* (which must start at
+the beginning or after \n). As in the case of is_anchored() (see above), we
+have to take account of back references to capturing brackets that contain .*
+because in that case we can't make the assumption.
+
+Arguments:
+ code points to start of expression (the bracket)
+ bracket_map a bitmap of which brackets we are inside while testing; this
+ handles up to substring 31; after that we just have to take
+ the less precise approach
+ backref_map the back reference bitmap
+
+Returns: TRUE or FALSE
+*/
+
+static BOOL
+is_startline(const uschar *code, unsigned int bracket_map,
+ unsigned int backref_map)
+{
+do {
+ const uschar *scode = first_significant_code(code + _pcre_OP_lengths[*code],
+ NULL, 0, FALSE);
+ register int op = *scode;
+
+ /* Non-capturing brackets */
+
+ if (op == OP_BRA)
+ {
+ if (!is_startline(scode, bracket_map, backref_map)) return FALSE;
+ }
+
+ /* Capturing brackets */
+
+ else if (op == OP_CBRA)
+ {
+ int n = GET2(scode, 1+LINK_SIZE);
+ int new_map = bracket_map | ((n < 32)? (1 << n) : 1);
+ if (!is_startline(scode, new_map, backref_map)) return FALSE;
+ }
+
+ /* Other brackets */
+
+ else if (op == OP_ASSERT || op == OP_ONCE || op == OP_COND)
+ { if (!is_startline(scode, bracket_map, backref_map)) return FALSE; }
+
+ /* .* means "start at start or after \n" if it isn't in brackets that
+ may be referenced. */
+
+ else if (op == OP_TYPESTAR || op == OP_TYPEMINSTAR || op == OP_TYPEPOSSTAR)
+ {
+ if (scode[1] != OP_ANY || (bracket_map & backref_map) != 0) return FALSE;
+ }
+
+ /* Check for explicit circumflex */
+
+ else if (op != OP_CIRC) return FALSE;
+
+ /* Move on to the next alternative */
+
+ code += GET(code, 1);
+ }
+while (*code == OP_ALT); /* Loop for each alternative */
+return TRUE;
+}
+
+
+
+/*************************************************
+* Check for asserted fixed first char *
+*************************************************/
+
+/* During compilation, the "first char" settings from forward assertions are
+discarded, because they can cause conflicts with actual literals that follow.
+However, if we end up without a first char setting for an unanchored pattern,
+it is worth scanning the regex to see if there is an initial asserted first
+char. If all branches start with the same asserted char, or with a bracket all
+of whose alternatives start with the same asserted char (recurse ad lib), then
+we return that char, otherwise -1.
+
+Arguments:
+ code points to start of expression (the bracket)
+ options pointer to the options (used to check casing changes)
+ inassert TRUE if in an assertion
+
+Returns: -1 or the fixed first char
+*/
+
+static int
+find_firstassertedchar(const uschar *code, int *options, BOOL inassert)
+{
+register int c = -1;
+do {
+ int d;
+ const uschar *scode =
+ first_significant_code(code + 1+LINK_SIZE, options, PCRE_CASELESS, TRUE);
+ register int op = *scode;
+
+ switch(op)
+ {
+ default:
+ return -1;
+
+ case OP_BRA:
+ case OP_CBRA:
+ case OP_ASSERT:
+ case OP_ONCE:
+ case OP_COND:
+ if ((d = find_firstassertedchar(scode, options, op == OP_ASSERT)) < 0)
+ return -1;
+ if (c < 0) c = d; else if (c != d) return -1;
+ break;
+
+ case OP_EXACT: /* Fall through */
+ scode += 2;
+
+ case OP_CHAR:
+ case OP_CHARNC:
+ case OP_PLUS:
+ case OP_MINPLUS:
+ case OP_POSPLUS:
+ if (!inassert) return -1;
+ if (c < 0)
+ {
+ c = scode[1];
+ if ((*options & PCRE_CASELESS) != 0) c |= REQ_CASELESS;
+ }
+ else if (c != scode[1]) return -1;
+ break;
+ }
+
+ code += GET(code, 1);
+ }
+while (*code == OP_ALT);
+return c;
+}
+
+
+
+/*************************************************
+* Compile a Regular Expression *
+*************************************************/
+
+/* This function takes a string and returns a pointer to a block of store
+holding a compiled version of the expression. The original API for this
+function had no error code return variable; it is retained for backwards
+compatibility. The new function is given a new name.
+
+Arguments:
+ pattern the regular expression
+ options various option bits
+ errorcodeptr pointer to error code variable (pcre_compile2() only)
+ can be NULL if you don't want a code value
+ errorptr pointer to pointer to error text
+ erroroffset ptr offset in pattern where error was detected
+ tables pointer to character tables or NULL
+
+Returns: pointer to compiled data block, or NULL on error,
+ with errorptr and erroroffset set
+*/
+
+PCRE_EXP_DEFN pcre *
+pcre_compile(const char *pattern, int options, const char **errorptr,
+ int *erroroffset, const unsigned char *tables)
+{
+return pcre_compile2(pattern, options, NULL, errorptr, erroroffset, tables);
+}
+
+
+PCRE_EXP_DEFN pcre *
+pcre_compile2(const char *pattern, int options, int *errorcodeptr,
+ const char **errorptr, int *erroroffset, const unsigned char *tables)
+{
+real_pcre *re;
+int length = 1; /* For final END opcode */
+int firstbyte, reqbyte, newline;
+int errorcode = 0;
+int skipatstart = 0;
+#ifdef SUPPORT_UTF8
+BOOL utf8;
+#endif
+size_t size;
+uschar *code;
+const uschar *codestart;
+const uschar *ptr;
+compile_data compile_block;
+compile_data *cd = &compile_block;
+
+/* This space is used for "compiling" into during the first phase, when we are
+computing the amount of memory that is needed. Compiled items are thrown away
+as soon as possible, so that a fairly large buffer should be sufficient for
+this purpose. The same space is used in the second phase for remembering where
+to fill in forward references to subpatterns. */
+
+uschar cworkspace[COMPILE_WORK_SIZE];
+
+
+/* Set this early so that early errors get offset 0. */
+
+ptr = (const uschar *)pattern;
+
+/* We can't pass back an error message if errorptr is NULL; I guess the best we
+can do is just return NULL, but we can set a code value if there is a code
+pointer. */
+
+if (errorptr == NULL)
+ {
+ if (errorcodeptr != NULL) *errorcodeptr = 99;
+ return NULL;
+ }
+
+*errorptr = NULL;
+if (errorcodeptr != NULL) *errorcodeptr = ERR0;
+
+/* However, we can give a message for this error */
+
+if (erroroffset == NULL)
+ {
+ errorcode = ERR16;
+ goto PCRE_EARLY_ERROR_RETURN2;
+ }
+
+*erroroffset = 0;
+
+/* Can't support UTF8 unless PCRE has been compiled to include the code. */
+
+#ifdef SUPPORT_UTF8
+utf8 = (options & PCRE_UTF8) != 0;
+if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0 &&
+ (*erroroffset = _pcre_valid_utf8((uschar *)pattern, -1)) >= 0)
+ {
+ errorcode = ERR44;
+ goto PCRE_EARLY_ERROR_RETURN2;
+ }
+#else
+if ((options & PCRE_UTF8) != 0)
+ {
+ errorcode = ERR32;
+ goto PCRE_EARLY_ERROR_RETURN;
+ }
+#endif
+
+if ((options & ~PUBLIC_OPTIONS) != 0)
+ {
+ errorcode = ERR17;
+ goto PCRE_EARLY_ERROR_RETURN;
+ }
+
+/* Set up pointers to the individual character tables */
+
+if (tables == NULL) tables = _pcre_default_tables;
+cd->lcc = tables + lcc_offset;
+cd->fcc = tables + fcc_offset;
+cd->cbits = tables + cbits_offset;
+cd->ctypes = tables + ctypes_offset;
+
+/* Check for global one-time settings at the start of the pattern, and remember
+the offset for later. */
+
+while (ptr[skipatstart] == '(' && ptr[skipatstart+1] == '*')
+ {
+ int newnl = 0;
+ int newbsr = 0;
+
+ if (strncmp((char *)(ptr+skipatstart+2), "CR)", 3) == 0)
+ { skipatstart += 5; newnl = PCRE_NEWLINE_CR; }
+ else if (strncmp((char *)(ptr+skipatstart+2), "LF)", 3) == 0)
+ { skipatstart += 5; newnl = PCRE_NEWLINE_LF; }
+ else if (strncmp((char *)(ptr+skipatstart+2), "CRLF)", 5) == 0)
+ { skipatstart += 7; newnl = PCRE_NEWLINE_CR + PCRE_NEWLINE_LF; }
+ else if (strncmp((char *)(ptr+skipatstart+2), "ANY)", 4) == 0)
+ { skipatstart += 6; newnl = PCRE_NEWLINE_ANY; }
+ else if (strncmp((char *)(ptr+skipatstart+2), "ANYCRLF)", 8) == 0)
+ { skipatstart += 10; newnl = PCRE_NEWLINE_ANYCRLF; }
+
+ else if (strncmp((char *)(ptr+skipatstart+2), "BSR_ANYCRLF)", 12) == 0)
+ { skipatstart += 14; newbsr = PCRE_BSR_ANYCRLF; }
+ else if (strncmp((char *)(ptr+skipatstart+2), "BSR_UNICODE)", 12) == 0)
+ { skipatstart += 14; newbsr = PCRE_BSR_UNICODE; }
+
+ if (newnl != 0)
+ options = (options & ~PCRE_NEWLINE_BITS) | newnl;
+ else if (newbsr != 0)
+ options = (options & ~(PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) | newbsr;
+ else break;
+ }
+
+/* Check validity of \R options. */
+
+switch (options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE))
+ {
+ case 0:
+ case PCRE_BSR_ANYCRLF:
+ case PCRE_BSR_UNICODE:
+ break;
+ default: errorcode = ERR56; goto PCRE_EARLY_ERROR_RETURN;
+ }
+
+/* Handle different types of newline. The three bits give seven cases. The
+current code allows for fixed one- or two-byte sequences, plus "any" and
+"anycrlf". */
+
+switch (options & PCRE_NEWLINE_BITS)
+ {
+ case 0: newline = NEWLINE; break; /* Build-time default */
+ case PCRE_NEWLINE_CR: newline = '\r'; break;
+ case PCRE_NEWLINE_LF: newline = '\n'; break;
+ case PCRE_NEWLINE_CR+
+ PCRE_NEWLINE_LF: newline = ('\r' << 8) | '\n'; break;
+ case PCRE_NEWLINE_ANY: newline = -1; break;
+ case PCRE_NEWLINE_ANYCRLF: newline = -2; break;
+ default: errorcode = ERR56; goto PCRE_EARLY_ERROR_RETURN;
+ }
+
+if (newline == -2)
+ {
+ cd->nltype = NLTYPE_ANYCRLF;
+ }
+else if (newline < 0)
+ {
+ cd->nltype = NLTYPE_ANY;
+ }
+else
+ {
+ cd->nltype = NLTYPE_FIXED;
+ if (newline > 255)
+ {
+ cd->nllen = 2;
+ cd->nl[0] = (newline >> 8) & 255;
+ cd->nl[1] = newline & 255;
+ }
+ else
+ {
+ cd->nllen = 1;
+ cd->nl[0] = newline;
+ }
+ }
+
+/* Maximum back reference and backref bitmap. The bitmap records up to 31 back
+references to help in deciding whether (.*) can be treated as anchored or not.
+*/
+
+cd->top_backref = 0;
+cd->backref_map = 0;
+
+/* Reflect pattern for debugging output */
+
+DPRINTF(("------------------------------------------------------------------\n"));
+DPRINTF(("%s\n", pattern));
+
+/* Pretend to compile the pattern while actually just accumulating the length
+of memory required. This behaviour is triggered by passing a non-NULL final
+argument to compile_regex(). We pass a block of workspace (cworkspace) for it
+to compile parts of the pattern into; the compiled code is discarded when it is
+no longer needed, so hopefully this workspace will never overflow, though there
+is a test for its doing so. */
+
+cd->bracount = 0;
+cd->names_found = 0;
+cd->name_entry_size = 0;
+cd->name_table = NULL;
+cd->start_workspace = cworkspace;
+cd->start_code = cworkspace;
+cd->hwm = cworkspace;
+cd->start_pattern = (const uschar *)pattern;
+cd->end_pattern = (const uschar *)(pattern + strlen(pattern));
+cd->req_varyopt = 0;
+cd->external_options = options;
+cd->external_flags = 0;
+
+/* Now do the pre-compile. On error, errorcode will be set non-zero, so we
+don't need to look at the result of the function here. The initial options have
+been put into the cd block so that they can be changed if an option setting is
+found within the regex right at the beginning. Bringing initial option settings
+outside can help speed up starting point checks. */
+
+ptr += skipatstart;
+code = cworkspace;
+*code = OP_BRA;
+(void)compile_regex(cd->external_options, cd->external_options & PCRE_IMS,
+ &code, &ptr, &errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd,
+ &length);
+if (errorcode != 0) goto PCRE_EARLY_ERROR_RETURN;
+
+DPRINTF(("end pre-compile: length=%d workspace=%d\n", length,
+ cd->hwm - cworkspace));
+
+if (length > MAX_PATTERN_SIZE)
+ {
+ errorcode = ERR20;
+ goto PCRE_EARLY_ERROR_RETURN;
+ }
+
+/* Compute the size of data block needed and get it, either from malloc or
+externally provided function. Integer overflow should no longer be possible
+because nowadays we limit the maximum value of cd->names_found and
+cd->name_entry_size. */
+
+size = length + sizeof(real_pcre) + cd->names_found * (cd->name_entry_size + 3);
+re = (real_pcre *)(pcre_malloc)(size);
+
+if (re == NULL)
+ {
+ errorcode = ERR21;
+ goto PCRE_EARLY_ERROR_RETURN;
+ }
+
+/* Put in the magic number, and save the sizes, initial options, internal
+flags, and character table pointer. NULL is used for the default character
+tables. The nullpad field is at the end; it's there to help in the case when a
+regex compiled on a system with 4-byte pointers is run on another with 8-byte
+pointers. */
+
+re->magic_number = MAGIC_NUMBER;
+re->size = size;
+re->options = cd->external_options;
+re->flags = cd->external_flags;
+re->dummy1 = 0;
+re->first_byte = 0;
+re->req_byte = 0;
+re->name_table_offset = sizeof(real_pcre);
+re->name_entry_size = cd->name_entry_size;
+re->name_count = cd->names_found;
+re->ref_count = 0;
+re->tables = (tables == _pcre_default_tables)? NULL : tables;
+re->nullpad = NULL;
+
+/* The starting points of the name/number translation table and of the code are
+passed around in the compile data block. The start/end pattern and initial
+options are already set from the pre-compile phase, as is the name_entry_size
+field. Reset the bracket count and the names_found field. Also reset the hwm
+field; this time it's used for remembering forward references to subpatterns.
+*/
+
+cd->bracount = 0;
+cd->names_found = 0;
+cd->name_table = (uschar *)re + re->name_table_offset;
+codestart = cd->name_table + re->name_entry_size * re->name_count;
+cd->start_code = codestart;
+cd->hwm = cworkspace;
+cd->req_varyopt = 0;
+cd->had_accept = FALSE;
+
+/* Set up a starting, non-extracting bracket, then compile the expression. On
+error, errorcode will be set non-zero, so we don't need to look at the result
+of the function here. */
+
+ptr = (const uschar *)pattern + skipatstart;
+code = (uschar *)codestart;
+*code = OP_BRA;
+(void)compile_regex(re->options, re->options & PCRE_IMS, &code, &ptr,
+ &errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd, NULL);
+re->top_bracket = cd->bracount;
+re->top_backref = cd->top_backref;
+re->flags = cd->external_flags;
+
+if (cd->had_accept) reqbyte = -1; /* Must disable after (*ACCEPT) */
+
+/* If not reached end of pattern on success, there's an excess bracket. */
+
+if (errorcode == 0 && *ptr != 0) errorcode = ERR22;
+
+/* Fill in the terminating state and check for disastrous overflow, but
+if debugging, leave the test till after things are printed out. */
+
+*code++ = OP_END;
+
+#ifndef DEBUG
+if (code - codestart > length) errorcode = ERR23;
+#endif
+
+/* Fill in any forward references that are required. */
+
+while (errorcode == 0 && cd->hwm > cworkspace)
+ {
+ int offset, recno;
+ const uschar *groupptr;
+ cd->hwm -= LINK_SIZE;
+ offset = GET(cd->hwm, 0);
+ recno = GET(codestart, offset);
+ groupptr = find_bracket(codestart, (re->options & PCRE_UTF8) != 0, recno);
+ if (groupptr == NULL) errorcode = ERR53;
+ else PUT(((uschar *)codestart), offset, groupptr - codestart);
+ }
+
+/* Give an error if there's back reference to a non-existent capturing
+subpattern. */
+
+if (errorcode == 0 && re->top_backref > re->top_bracket) errorcode = ERR15;
+
+/* Failed to compile, or error while post-processing */
+
+if (errorcode != 0)
+ {
+ (pcre_free)(re);
+ PCRE_EARLY_ERROR_RETURN:
+ *erroroffset = ptr - (const uschar *)pattern;
+ PCRE_EARLY_ERROR_RETURN2:
+ *errorptr = find_error_text(errorcode);
+ if (errorcodeptr != NULL) *errorcodeptr = errorcode;
+ return NULL;
+ }
+
+/* If the anchored option was not passed, set the flag if we can determine that
+the pattern is anchored by virtue of ^ characters or \A or anything else (such
+as starting with .* when DOTALL is set).
+
+Otherwise, if we know what the first byte has to be, save it, because that
+speeds up unanchored matches no end. If not, see if we can set the
+PCRE_STARTLINE flag. This is helpful for multiline matches when all branches
+start with ^. and also when all branches start with .* for non-DOTALL matches.
+*/
+
+if ((re->options & PCRE_ANCHORED) == 0)
+ {
+ int temp_options = re->options; /* May get changed during these scans */
+ if (is_anchored(codestart, &temp_options, 0, cd->backref_map))
+ re->options |= PCRE_ANCHORED;
+ else
+ {
+ if (firstbyte < 0)
+ firstbyte = find_firstassertedchar(codestart, &temp_options, FALSE);
+ if (firstbyte >= 0) /* Remove caseless flag for non-caseable chars */
+ {
+ int ch = firstbyte & 255;
+ re->first_byte = ((firstbyte & REQ_CASELESS) != 0 &&
+ cd->fcc[ch] == ch)? ch : firstbyte;
+ re->flags |= PCRE_FIRSTSET;
+ }
+ else if (is_startline(codestart, 0, cd->backref_map))
+ re->flags |= PCRE_STARTLINE;
+ }
+ }
+
+/* For an anchored pattern, we use the "required byte" only if it follows a
+variable length item in the regex. Remove the caseless flag for non-caseable
+bytes. */
+
+if (reqbyte >= 0 &&
+ ((re->options & PCRE_ANCHORED) == 0 || (reqbyte & REQ_VARY) != 0))
+ {
+ int ch = reqbyte & 255;
+ re->req_byte = ((reqbyte & REQ_CASELESS) != 0 &&
+ cd->fcc[ch] == ch)? (reqbyte & ~REQ_CASELESS) : reqbyte;
+ re->flags |= PCRE_REQCHSET;
+ }
+
+/* Print out the compiled data if debugging is enabled. This is never the
+case when building a production library. */
+
+#ifdef DEBUG
+
+printf("Length = %d top_bracket = %d top_backref = %d\n",
+ length, re->top_bracket, re->top_backref);
+
+printf("Options=%08x\n", re->options);
+
+if ((re->flags & PCRE_FIRSTSET) != 0)
+ {
+ int ch = re->first_byte & 255;
+ const char *caseless = ((re->first_byte & REQ_CASELESS) == 0)?
+ "" : " (caseless)";
+ if (isprint(ch)) printf("First char = %c%s\n", ch, caseless);
+ else printf("First char = \\x%02x%s\n", ch, caseless);
+ }
+
+if ((re->flags & PCRE_REQCHSET) != 0)
+ {
+ int ch = re->req_byte & 255;
+ const char *caseless = ((re->req_byte & REQ_CASELESS) == 0)?
+ "" : " (caseless)";
+ if (isprint(ch)) printf("Req char = %c%s\n", ch, caseless);
+ else printf("Req char = \\x%02x%s\n", ch, caseless);
+ }
+
+pcre_printint(re, stdout, TRUE);
+
+/* This check is done here in the debugging case so that the code that
+was compiled can be seen. */
+
+if (code - codestart > length)
+ {
+ (pcre_free)(re);
+ *errorptr = find_error_text(ERR23);
+ *erroroffset = ptr - (uschar *)pattern;
+ if (errorcodeptr != NULL) *errorcodeptr = ERR23;
+ return NULL;
+ }
+#endif /* DEBUG */
+
+return (pcre *)re;
+}
+
+/* End of pcre_compile.c */
diff --git a/src/plugins/PCREPlugin/pcre_config.c b/src/plugins/PCREPlugin/pcre_config.c
new file mode 100644
index 0000000..220ef93
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_config.c
@@ -0,0 +1,128 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_config(). */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Return info about what features are configured *
+*************************************************/
+
+/* This function has an extensible interface so that additional items can be
+added compatibly.
+
+Arguments:
+ what what information is required
+ where where to put the information
+
+Returns: 0 if data returned, negative on error
+*/
+
+PCRE_EXP_DEFN int
+pcre_config(int what, void *where)
+{
+switch (what)
+ {
+ case PCRE_CONFIG_UTF8:
+#ifdef SUPPORT_UTF8
+ *((int *)where) = 1;
+#else
+ *((int *)where) = 0;
+#endif
+ break;
+
+ case PCRE_CONFIG_UNICODE_PROPERTIES:
+#ifdef SUPPORT_UCP
+ *((int *)where) = 1;
+#else
+ *((int *)where) = 0;
+#endif
+ break;
+
+ case PCRE_CONFIG_NEWLINE:
+ *((int *)where) = NEWLINE;
+ break;
+
+ case PCRE_CONFIG_BSR:
+#ifdef BSR_ANYCRLF
+ *((int *)where) = 1;
+#else
+ *((int *)where) = 0;
+#endif
+ break;
+
+ case PCRE_CONFIG_LINK_SIZE:
+ *((int *)where) = LINK_SIZE;
+ break;
+
+ case PCRE_CONFIG_POSIX_MALLOC_THRESHOLD:
+ *((int *)where) = POSIX_MALLOC_THRESHOLD;
+ break;
+
+ case PCRE_CONFIG_MATCH_LIMIT:
+ *((unsigned int *)where) = MATCH_LIMIT;
+ break;
+
+ case PCRE_CONFIG_MATCH_LIMIT_RECURSION:
+ *((unsigned int *)where) = MATCH_LIMIT_RECURSION;
+ break;
+
+ case PCRE_CONFIG_STACKRECURSE:
+#ifdef NO_RECURSE
+ *((int *)where) = 0;
+#else
+ *((int *)where) = 1;
+#endif
+ break;
+
+ default: return PCRE_ERROR_BADOPTION;
+ }
+
+return 0;
+}
+
+/* End of pcre_config.c */
diff --git a/src/plugins/PCREPlugin/pcre_dfa_exec.c b/src/plugins/PCREPlugin/pcre_dfa_exec.c
new file mode 100644
index 0000000..e590fbb
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_dfa_exec.c
@@ -0,0 +1,2896 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_dfa_exec(), which is an
+alternative matching function that uses a sort of DFA algorithm (not a true
+FSM). This is NOT Perl- compatible, but it has advantages in certain
+applications. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#define NLBLOCK md /* Block containing newline information */
+#define PSSTART start_subject /* Field containing processed string start */
+#define PSEND end_subject /* Field containing processed string end */
+
+#include "pcre_internal.h"
+
+
+/* For use to indent debugging output */
+
+#define SP " "
+
+
+
+/*************************************************
+* Code parameters and static tables *
+*************************************************/
+
+/* These are offsets that are used to turn the OP_TYPESTAR and friends opcodes
+into others, under special conditions. A gap of 20 between the blocks should be
+enough. The resulting opcodes don't have to be less than 256 because they are
+never stored, so we push them well clear of the normal opcodes. */
+
+#define OP_PROP_EXTRA 300
+#define OP_EXTUNI_EXTRA 320
+#define OP_ANYNL_EXTRA 340
+#define OP_HSPACE_EXTRA 360
+#define OP_VSPACE_EXTRA 380
+
+
+/* This table identifies those opcodes that are followed immediately by a
+character that is to be tested in some way. This makes is possible to
+centralize the loading of these characters. In the case of Type * etc, the
+"character" is the opcode for \D, \d, \S, \s, \W, or \w, which will always be a
+small value. ***NOTE*** If the start of this table is modified, the two tables
+that follow must also be modified. */
+
+static uschar coptable[] = {
+ 0, /* End */
+ 0, 0, 0, 0, 0, /* \A, \G, \K, \B, \b */
+ 0, 0, 0, 0, 0, 0, /* \D, \d, \S, \s, \W, \w */
+ 0, 0, /* Any, Anybyte */
+ 0, 0, 0, /* NOTPROP, PROP, EXTUNI */
+ 0, 0, 0, 0, 0, /* \R, \H, \h, \V, \v */
+ 0, 0, 0, 0, 0, /* \Z, \z, Opt, ^, $ */
+ 1, /* Char */
+ 1, /* Charnc */
+ 1, /* not */
+ /* Positive single-char repeats */
+ 1, 1, 1, 1, 1, 1, /* *, *?, +, +?, ?, ?? */
+ 3, 3, 3, /* upto, minupto, exact */
+ 1, 1, 1, 3, /* *+, ++, ?+, upto+ */
+ /* Negative single-char repeats - only for chars < 256 */
+ 1, 1, 1, 1, 1, 1, /* NOT *, *?, +, +?, ?, ?? */
+ 3, 3, 3, /* NOT upto, minupto, exact */
+ 1, 1, 1, 3, /* NOT *+, ++, ?+, updo+ */
+ /* Positive type repeats */
+ 1, 1, 1, 1, 1, 1, /* Type *, *?, +, +?, ?, ?? */
+ 3, 3, 3, /* Type upto, minupto, exact */
+ 1, 1, 1, 3, /* Type *+, ++, ?+, upto+ */
+ /* Character class & ref repeats */
+ 0, 0, 0, 0, 0, 0, /* *, *?, +, +?, ?, ?? */
+ 0, 0, /* CRRANGE, CRMINRANGE */
+ 0, /* CLASS */
+ 0, /* NCLASS */
+ 0, /* XCLASS - variable length */
+ 0, /* REF */
+ 0, /* RECURSE */
+ 0, /* CALLOUT */
+ 0, /* Alt */
+ 0, /* Ket */
+ 0, /* KetRmax */
+ 0, /* KetRmin */
+ 0, /* Assert */
+ 0, /* Assert not */
+ 0, /* Assert behind */
+ 0, /* Assert behind not */
+ 0, /* Reverse */
+ 0, 0, 0, 0, /* ONCE, BRA, CBRA, COND */
+ 0, 0, 0, /* SBRA, SCBRA, SCOND */
+ 0, /* CREF */
+ 0, /* RREF */
+ 0, /* DEF */
+ 0, 0, /* BRAZERO, BRAMINZERO */
+ 0, 0, 0, 0, /* PRUNE, SKIP, THEN, COMMIT */
+ 0, 0 /* FAIL, ACCEPT */
+};
+
+/* These 2 tables allow for compact code for testing for \D, \d, \S, \s, \W,
+and \w */
+
+static uschar toptable1[] = {
+ 0, 0, 0, 0, 0, 0,
+ ctype_digit, ctype_digit,
+ ctype_space, ctype_space,
+ ctype_word, ctype_word,
+ 0 /* OP_ANY */
+};
+
+static uschar toptable2[] = {
+ 0, 0, 0, 0, 0, 0,
+ ctype_digit, 0,
+ ctype_space, 0,
+ ctype_word, 0,
+ 1 /* OP_ANY */
+};
+
+
+/* Structure for holding data about a particular state, which is in effect the
+current data for an active path through the match tree. It must consist
+entirely of ints because the working vector we are passed, and which we put
+these structures in, is a vector of ints. */
+
+typedef struct stateblock {
+ int offset; /* Offset to opcode */
+ int count; /* Count for repeats */
+ int ims; /* ims flag bits */
+ int data; /* Some use extra data */
+} stateblock;
+
+#define INTS_PER_STATEBLOCK (sizeof(stateblock)/sizeof(int))
+
+
+#ifdef DEBUG
+/*************************************************
+* Print character string *
+*************************************************/
+
+/* Character string printing function for debugging.
+
+Arguments:
+ p points to string
+ length number of bytes
+ f where to print
+
+Returns: nothing
+*/
+
+static void
+pchars(unsigned char *p, int length, FILE *f)
+{
+int c;
+while (length-- > 0)
+ {
+ if (isprint(c = *(p++)))
+ fprintf(f, "%c", c);
+ else
+ fprintf(f, "\\x%02x", c);
+ }
+}
+#endif
+
+
+
+/*************************************************
+* Execute a Regular Expression - DFA engine *
+*************************************************/
+
+/* This internal function applies a compiled pattern to a subject string,
+starting at a given point, using a DFA engine. This function is called from the
+external one, possibly multiple times if the pattern is not anchored. The
+function calls itself recursively for some kinds of subpattern.
+
+Arguments:
+ md the match_data block with fixed information
+ this_start_code the opening bracket of this subexpression's code
+ current_subject where we currently are in the subject string
+ start_offset start offset in the subject string
+ offsets vector to contain the matching string offsets
+ offsetcount size of same
+ workspace vector of workspace
+ wscount size of same
+ ims the current ims flags
+ rlevel function call recursion level
+ recursing regex recursive call level
+
+Returns: > 0 =>
+ = 0 =>
+ -1 => failed to match
+ < -1 => some kind of unexpected problem
+
+The following macros are used for adding states to the two state vectors (one
+for the current character, one for the following character). */
+
+#define ADD_ACTIVE(x,y) \
+ if (active_count++ < wscount) \
+ { \
+ next_active_state->offset = (x); \
+ next_active_state->count = (y); \
+ next_active_state->ims = ims; \
+ next_active_state++; \
+ DPRINTF(("%.*sADD_ACTIVE(%d,%d)\n", rlevel*2-2, SP, (x), (y))); \
+ } \
+ else return PCRE_ERROR_DFA_WSSIZE
+
+#define ADD_ACTIVE_DATA(x,y,z) \
+ if (active_count++ < wscount) \
+ { \
+ next_active_state->offset = (x); \
+ next_active_state->count = (y); \
+ next_active_state->ims = ims; \
+ next_active_state->data = (z); \
+ next_active_state++; \
+ DPRINTF(("%.*sADD_ACTIVE_DATA(%d,%d,%d)\n", rlevel*2-2, SP, (x), (y), (z))); \
+ } \
+ else return PCRE_ERROR_DFA_WSSIZE
+
+#define ADD_NEW(x,y) \
+ if (new_count++ < wscount) \
+ { \
+ next_new_state->offset = (x); \
+ next_new_state->count = (y); \
+ next_new_state->ims = ims; \
+ next_new_state++; \
+ DPRINTF(("%.*sADD_NEW(%d,%d)\n", rlevel*2-2, SP, (x), (y))); \
+ } \
+ else return PCRE_ERROR_DFA_WSSIZE
+
+#define ADD_NEW_DATA(x,y,z) \
+ if (new_count++ < wscount) \
+ { \
+ next_new_state->offset = (x); \
+ next_new_state->count = (y); \
+ next_new_state->ims = ims; \
+ next_new_state->data = (z); \
+ next_new_state++; \
+ DPRINTF(("%.*sADD_NEW_DATA(%d,%d,%d)\n", rlevel*2-2, SP, (x), (y), (z))); \
+ } \
+ else return PCRE_ERROR_DFA_WSSIZE
+
+/* And now, here is the code */
+
+static int
+internal_dfa_exec(
+ dfa_match_data *md,
+ const uschar *this_start_code,
+ const uschar *current_subject,
+ int start_offset,
+ int *offsets,
+ int offsetcount,
+ int *workspace,
+ int wscount,
+ int ims,
+ int rlevel,
+ int recursing)
+{
+stateblock *active_states, *new_states, *temp_states;
+stateblock *next_active_state, *next_new_state;
+
+const uschar *ctypes, *lcc, *fcc;
+const uschar *ptr;
+const uschar *end_code, *first_op;
+
+int active_count, new_count, match_count;
+
+/* Some fields in the md block are frequently referenced, so we load them into
+independent variables in the hope that this will perform better. */
+
+const uschar *start_subject = md->start_subject;
+const uschar *end_subject = md->end_subject;
+const uschar *start_code = md->start_code;
+
+#ifdef SUPPORT_UTF8
+BOOL utf8 = (md->poptions & PCRE_UTF8) != 0;
+#else
+BOOL utf8 = FALSE;
+#endif
+
+rlevel++;
+offsetcount &= (-2);
+
+wscount -= 2;
+wscount = (wscount - (wscount % (INTS_PER_STATEBLOCK * 2))) /
+ (2 * INTS_PER_STATEBLOCK);
+
+DPRINTF(("\n%.*s---------------------\n"
+ "%.*sCall to internal_dfa_exec f=%d r=%d\n",
+ rlevel*2-2, SP, rlevel*2-2, SP, rlevel, recursing));
+
+ctypes = md->tables + ctypes_offset;
+lcc = md->tables + lcc_offset;
+fcc = md->tables + fcc_offset;
+
+match_count = PCRE_ERROR_NOMATCH; /* A negative number */
+
+active_states = (stateblock *)(workspace + 2);
+next_new_state = new_states = active_states + wscount;
+new_count = 0;
+
+first_op = this_start_code + 1 + LINK_SIZE +
+ ((*this_start_code == OP_CBRA || *this_start_code == OP_SCBRA)? 2:0);
+
+/* The first thing in any (sub) pattern is a bracket of some sort. Push all
+the alternative states onto the list, and find out where the end is. This
+makes is possible to use this function recursively, when we want to stop at a
+matching internal ket rather than at the end.
+
+If the first opcode in the first alternative is OP_REVERSE, we are dealing with
+a backward assertion. In that case, we have to find out the maximum amount to
+move back, and set up each alternative appropriately. */
+
+if (*first_op == OP_REVERSE)
+ {
+ int max_back = 0;
+ int gone_back;
+
+ end_code = this_start_code;
+ do
+ {
+ int back = GET(end_code, 2+LINK_SIZE);
+ if (back > max_back) max_back = back;
+ end_code += GET(end_code, 1);
+ }
+ while (*end_code == OP_ALT);
+
+ /* If we can't go back the amount required for the longest lookbehind
+ pattern, go back as far as we can; some alternatives may still be viable. */
+
+#ifdef SUPPORT_UTF8
+ /* In character mode we have to step back character by character */
+
+ if (utf8)
+ {
+ for (gone_back = 0; gone_back < max_back; gone_back++)
+ {
+ if (current_subject <= start_subject) break;
+ current_subject--;
+ while (current_subject > start_subject &&
+ (*current_subject & 0xc0) == 0x80)
+ current_subject--;
+ }
+ }
+ else
+#endif
+
+ /* In byte-mode we can do this quickly. */
+
+ {
+ gone_back = (current_subject - max_back < start_subject)?
+ current_subject - start_subject : max_back;
+ current_subject -= gone_back;
+ }
+
+ /* Now we can process the individual branches. */
+
+ end_code = this_start_code;
+ do
+ {
+ int back = GET(end_code, 2+LINK_SIZE);
+ if (back <= gone_back)
+ {
+ int bstate = end_code - start_code + 2 + 2*LINK_SIZE;
+ ADD_NEW_DATA(-bstate, 0, gone_back - back);
+ }
+ end_code += GET(end_code, 1);
+ }
+ while (*end_code == OP_ALT);
+ }
+
+/* This is the code for a "normal" subpattern (not a backward assertion). The
+start of a whole pattern is always one of these. If we are at the top level,
+we may be asked to restart matching from the same point that we reached for a
+previous partial match. We still have to scan through the top-level branches to
+find the end state. */
+
+else
+ {
+ end_code = this_start_code;
+
+ /* Restarting */
+
+ if (rlevel == 1 && (md->moptions & PCRE_DFA_RESTART) != 0)
+ {
+ do { end_code += GET(end_code, 1); } while (*end_code == OP_ALT);
+ new_count = workspace[1];
+ if (!workspace[0])
+ memcpy(new_states, active_states, new_count * sizeof(stateblock));
+ }
+
+ /* Not restarting */
+
+ else
+ {
+ int length = 1 + LINK_SIZE +
+ ((*this_start_code == OP_CBRA || *this_start_code == OP_SCBRA)? 2:0);
+ do
+ {
+ ADD_NEW(end_code - start_code + length, 0);
+ end_code += GET(end_code, 1);
+ length = 1 + LINK_SIZE;
+ }
+ while (*end_code == OP_ALT);
+ }
+ }
+
+workspace[0] = 0; /* Bit indicating which vector is current */
+
+DPRINTF(("%.*sEnd state = %d\n", rlevel*2-2, SP, end_code - start_code));
+
+/* Loop for scanning the subject */
+
+ptr = current_subject;
+for (;;)
+ {
+ int i, j;
+ int clen, dlen;
+ unsigned int c, d;
+
+ /* Make the new state list into the active state list and empty the
+ new state list. */
+
+ temp_states = active_states;
+ active_states = new_states;
+ new_states = temp_states;
+ active_count = new_count;
+ new_count = 0;
+
+ workspace[0] ^= 1; /* Remember for the restarting feature */
+ workspace[1] = active_count;
+
+#ifdef DEBUG
+ printf("%.*sNext character: rest of subject = \"", rlevel*2-2, SP);
+ pchars((uschar *)ptr, strlen((char *)ptr), stdout);
+ printf("\"\n");
+
+ printf("%.*sActive states: ", rlevel*2-2, SP);
+ for (i = 0; i < active_count; i++)
+ printf("%d/%d ", active_states[i].offset, active_states[i].count);
+ printf("\n");
+#endif
+
+ /* Set the pointers for adding new states */
+
+ next_active_state = active_states + active_count;
+ next_new_state = new_states;
+
+ /* Load the current character from the subject outside the loop, as many
+ different states may want to look at it, and we assume that at least one
+ will. */
+
+ if (ptr < end_subject)
+ {
+ clen = 1; /* Number of bytes in the character */
+#ifdef SUPPORT_UTF8
+ if (utf8) { GETCHARLEN(c, ptr, clen); } else
+#endif /* SUPPORT_UTF8 */
+ c = *ptr;
+ }
+ else
+ {
+ clen = 0; /* This indicates the end of the subject */
+ c = NOTACHAR; /* This value should never actually be used */
+ }
+
+ /* Scan up the active states and act on each one. The result of an action
+ may be to add more states to the currently active list (e.g. on hitting a
+ parenthesis) or it may be to put states on the new list, for considering
+ when we move the character pointer on. */
+
+ for (i = 0; i < active_count; i++)
+ {
+ stateblock *current_state = active_states + i;
+ const uschar *code;
+ int state_offset = current_state->offset;
+ int count, codevalue;
+#ifdef SUPPORT_UCP
+ int chartype, script;
+#endif
+
+#ifdef DEBUG
+ printf ("%.*sProcessing state %d c=", rlevel*2-2, SP, state_offset);
+ if (clen == 0) printf("EOL\n");
+ else if (c > 32 && c < 127) printf("'%c'\n", c);
+ else printf("0x%02x\n", c);
+#endif
+
+ /* This variable is referred to implicity in the ADD_xxx macros. */
+
+ ims = current_state->ims;
+
+ /* A negative offset is a special case meaning "hold off going to this
+ (negated) state until the number of characters in the data field have
+ been skipped". */
+
+ if (state_offset < 0)
+ {
+ if (current_state->data > 0)
+ {
+ DPRINTF(("%.*sSkipping this character\n", rlevel*2-2, SP));
+ ADD_NEW_DATA(state_offset, current_state->count,
+ current_state->data - 1);
+ continue;
+ }
+ else
+ {
+ current_state->offset = state_offset = -state_offset;
+ }
+ }
+
+ /* Check for a duplicate state with the same count, and skip if found. */
+
+ for (j = 0; j < i; j++)
+ {
+ if (active_states[j].offset == state_offset &&
+ active_states[j].count == current_state->count)
+ {
+ DPRINTF(("%.*sDuplicate state: skipped\n", rlevel*2-2, SP));
+ goto NEXT_ACTIVE_STATE;
+ }
+ }
+
+ /* The state offset is the offset to the opcode */
+
+ code = start_code + state_offset;
+ codevalue = *code;
+
+ /* If this opcode is followed by an inline character, load it. It is
+ tempting to test for the presence of a subject character here, but that
+ is wrong, because sometimes zero repetitions of the subject are
+ permitted.
+
+ We also use this mechanism for opcodes such as OP_TYPEPLUS that take an
+ argument that is not a data character - but is always one byte long. We
+ have to take special action to deal with \P, \p, \H, \h, \V, \v and \X in
+ this case. To keep the other cases fast, convert these ones to new opcodes.
+ */
+
+ if (coptable[codevalue] > 0)
+ {
+ dlen = 1;
+#ifdef SUPPORT_UTF8
+ if (utf8) { GETCHARLEN(d, (code + coptable[codevalue]), dlen); } else
+#endif /* SUPPORT_UTF8 */
+ d = code[coptable[codevalue]];
+ if (codevalue >= OP_TYPESTAR)
+ {
+ switch(d)
+ {
+ case OP_ANYBYTE: return PCRE_ERROR_DFA_UITEM;
+ case OP_NOTPROP:
+ case OP_PROP: codevalue += OP_PROP_EXTRA; break;
+ case OP_ANYNL: codevalue += OP_ANYNL_EXTRA; break;
+ case OP_EXTUNI: codevalue += OP_EXTUNI_EXTRA; break;
+ case OP_NOT_HSPACE:
+ case OP_HSPACE: codevalue += OP_HSPACE_EXTRA; break;
+ case OP_NOT_VSPACE:
+ case OP_VSPACE: codevalue += OP_VSPACE_EXTRA; break;
+ default: break;
+ }
+ }
+ }
+ else
+ {
+ dlen = 0; /* Not strictly necessary, but compilers moan */
+ d = NOTACHAR; /* if these variables are not set. */
+ }
+
+
+ /* Now process the individual opcodes */
+
+ switch (codevalue)
+ {
+
+/* ========================================================================== */
+ /* Reached a closing bracket. If not at the end of the pattern, carry
+ on with the next opcode. Otherwise, unless we have an empty string and
+ PCRE_NOTEMPTY is set, save the match data, shifting up all previous
+ matches so we always have the longest first. */
+
+ case OP_KET:
+ case OP_KETRMIN:
+ case OP_KETRMAX:
+ if (code != end_code)
+ {
+ ADD_ACTIVE(state_offset + 1 + LINK_SIZE, 0);
+ if (codevalue != OP_KET)
+ {
+ ADD_ACTIVE(state_offset - GET(code, 1), 0);
+ }
+ }
+ else if (ptr > current_subject || (md->moptions & PCRE_NOTEMPTY) == 0)
+ {
+ if (match_count < 0) match_count = (offsetcount >= 2)? 1 : 0;
+ else if (match_count > 0 && ++match_count * 2 >= offsetcount)
+ match_count = 0;
+ count = ((match_count == 0)? offsetcount : match_count * 2) - 2;
+ if (count > 0) memmove(offsets + 2, offsets, count * sizeof(int));
+ if (offsetcount >= 2)
+ {
+ offsets[0] = current_subject - start_subject;
+ offsets[1] = ptr - start_subject;
+ DPRINTF(("%.*sSet matched string = \"%.*s\"\n", rlevel*2-2, SP,
+ offsets[1] - offsets[0], current_subject));
+ }
+ if ((md->moptions & PCRE_DFA_SHORTEST) != 0)
+ {
+ DPRINTF(("%.*sEnd of internal_dfa_exec %d: returning %d\n"
+ "%.*s---------------------\n\n", rlevel*2-2, SP, rlevel,
+ match_count, rlevel*2-2, SP));
+ return match_count;
+ }
+ }
+ break;
+
+/* ========================================================================== */
+ /* These opcodes add to the current list of states without looking
+ at the current character. */
+
+ /*-----------------------------------------------------------------*/
+ case OP_ALT:
+ do { code += GET(code, 1); } while (*code == OP_ALT);
+ ADD_ACTIVE(code - start_code, 0);
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_BRA:
+ case OP_SBRA:
+ do
+ {
+ ADD_ACTIVE(code - start_code + 1 + LINK_SIZE, 0);
+ code += GET(code, 1);
+ }
+ while (*code == OP_ALT);
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_CBRA:
+ case OP_SCBRA:
+ ADD_ACTIVE(code - start_code + 3 + LINK_SIZE, 0);
+ code += GET(code, 1);
+ while (*code == OP_ALT)
+ {
+ ADD_ACTIVE(code - start_code + 1 + LINK_SIZE, 0);
+ code += GET(code, 1);
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_BRAZERO:
+ case OP_BRAMINZERO:
+ ADD_ACTIVE(state_offset + 1, 0);
+ code += 1 + GET(code, 2);
+ while (*code == OP_ALT) code += GET(code, 1);
+ ADD_ACTIVE(code - start_code + 1 + LINK_SIZE, 0);
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_CIRC:
+ if ((ptr == start_subject && (md->moptions & PCRE_NOTBOL) == 0) ||
+ ((ims & PCRE_MULTILINE) != 0 &&
+ ptr != end_subject &&
+ WAS_NEWLINE(ptr)))
+ { ADD_ACTIVE(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_EOD:
+ if (ptr >= end_subject) { ADD_ACTIVE(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_OPT:
+ ims = code[1];
+ ADD_ACTIVE(state_offset + 2, 0);
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_SOD:
+ if (ptr == start_subject) { ADD_ACTIVE(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_SOM:
+ if (ptr == start_subject + start_offset) { ADD_ACTIVE(state_offset + 1, 0); }
+ break;
+
+
+/* ========================================================================== */
+ /* These opcodes inspect the next subject character, and sometimes
+ the previous one as well, but do not have an argument. The variable
+ clen contains the length of the current character and is zero if we are
+ at the end of the subject. */
+
+ /*-----------------------------------------------------------------*/
+ case OP_ANY:
+ if (clen > 0 && ((ims & PCRE_DOTALL) != 0 || !IS_NEWLINE(ptr)))
+ { ADD_NEW(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_EODN:
+ if (clen == 0 || (IS_NEWLINE(ptr) && ptr == end_subject - md->nllen))
+ { ADD_ACTIVE(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_DOLL:
+ if ((md->moptions & PCRE_NOTEOL) == 0)
+ {
+ if (clen == 0 ||
+ (IS_NEWLINE(ptr) &&
+ ((ims & PCRE_MULTILINE) != 0 || ptr == end_subject - md->nllen)
+ ))
+ { ADD_ACTIVE(state_offset + 1, 0); }
+ }
+ else if ((ims & PCRE_MULTILINE) != 0 && IS_NEWLINE(ptr))
+ { ADD_ACTIVE(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+
+ case OP_DIGIT:
+ case OP_WHITESPACE:
+ case OP_WORDCHAR:
+ if (clen > 0 && c < 256 &&
+ ((ctypes[c] & toptable1[codevalue]) ^ toptable2[codevalue]) != 0)
+ { ADD_NEW(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_NOT_DIGIT:
+ case OP_NOT_WHITESPACE:
+ case OP_NOT_WORDCHAR:
+ if (clen > 0 && (c >= 256 ||
+ ((ctypes[c] & toptable1[codevalue]) ^ toptable2[codevalue]) != 0))
+ { ADD_NEW(state_offset + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_WORD_BOUNDARY:
+ case OP_NOT_WORD_BOUNDARY:
+ {
+ int left_word, right_word;
+
+ if (ptr > start_subject)
+ {
+ const uschar *temp = ptr - 1;
+#ifdef SUPPORT_UTF8
+ if (utf8) BACKCHAR(temp);
+#endif
+ GETCHARTEST(d, temp);
+ left_word = d < 256 && (ctypes[d] & ctype_word) != 0;
+ }
+ else left_word = 0;
+
+ if (clen > 0) right_word = c < 256 && (ctypes[c] & ctype_word) != 0;
+ else right_word = 0;
+
+ if ((left_word == right_word) == (codevalue == OP_NOT_WORD_BOUNDARY))
+ { ADD_ACTIVE(state_offset + 1, 0); }
+ }
+ break;
+
+
+ /*-----------------------------------------------------------------*/
+ /* Check the next character by Unicode property. We will get here only
+ if the support is in the binary; otherwise a compile-time error occurs.
+ */
+
+#ifdef SUPPORT_UCP
+ case OP_PROP:
+ case OP_NOTPROP:
+ if (clen > 0)
+ {
+ BOOL OK;
+ int category = _pcre_ucp_findprop(c, &chartype, &script);
+ switch(code[1])
+ {
+ case PT_ANY:
+ OK = TRUE;
+ break;
+
+ case PT_LAMP:
+ OK = chartype == ucp_Lu || chartype == ucp_Ll || chartype == ucp_Lt;
+ break;
+
+ case PT_GC:
+ OK = category == code[2];
+ break;
+
+ case PT_PC:
+ OK = chartype == code[2];
+ break;
+
+ case PT_SC:
+ OK = script == code[2];
+ break;
+
+ /* Should never occur, but keep compilers from grumbling. */
+
+ default:
+ OK = codevalue != OP_PROP;
+ break;
+ }
+
+ if (OK == (codevalue == OP_PROP)) { ADD_NEW(state_offset + 3, 0); }
+ }
+ break;
+#endif
+
+
+
+/* ========================================================================== */
+ /* These opcodes likewise inspect the subject character, but have an
+ argument that is not a data character. It is one of these opcodes:
+ OP_ANY, OP_DIGIT, OP_NOT_DIGIT, OP_WHITESPACE, OP_NOT_SPACE, OP_WORDCHAR,
+ OP_NOT_WORDCHAR. The value is loaded into d. */
+
+ case OP_TYPEPLUS:
+ case OP_TYPEMINPLUS:
+ case OP_TYPEPOSPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
+ if (clen > 0)
+ {
+ if ((c >= 256 && d != OP_DIGIT && d != OP_WHITESPACE && d != OP_WORDCHAR) ||
+ (c < 256 &&
+ (d != OP_ANY ||
+ (ims & PCRE_DOTALL) != 0 ||
+ !IS_NEWLINE(ptr)
+ ) &&
+ ((ctypes[c] & toptable1[d]) ^ toptable2[d]) != 0))
+ {
+ if (count > 0 && codevalue == OP_TYPEPOSPLUS)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ count++;
+ ADD_NEW(state_offset, count);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_TYPEQUERY:
+ case OP_TYPEMINQUERY:
+ case OP_TYPEPOSQUERY:
+ ADD_ACTIVE(state_offset + 2, 0);
+ if (clen > 0)
+ {
+ if ((c >= 256 && d != OP_DIGIT && d != OP_WHITESPACE && d != OP_WORDCHAR) ||
+ (c < 256 &&
+ (d != OP_ANY ||
+ (ims & PCRE_DOTALL) != 0 ||
+ !IS_NEWLINE(ptr)
+ ) &&
+ ((ctypes[c] & toptable1[d]) ^ toptable2[d]) != 0))
+ {
+ if (codevalue == OP_TYPEPOSQUERY)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW(state_offset + 2, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_TYPESTAR:
+ case OP_TYPEMINSTAR:
+ case OP_TYPEPOSSTAR:
+ ADD_ACTIVE(state_offset + 2, 0);
+ if (clen > 0)
+ {
+ if ((c >= 256 && d != OP_DIGIT && d != OP_WHITESPACE && d != OP_WORDCHAR) ||
+ (c < 256 &&
+ (d != OP_ANY ||
+ (ims & PCRE_DOTALL) != 0 ||
+ !IS_NEWLINE(ptr)
+ ) &&
+ ((ctypes[c] & toptable1[d]) ^ toptable2[d]) != 0))
+ {
+ if (codevalue == OP_TYPEPOSSTAR)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW(state_offset, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_TYPEEXACT:
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ if ((c >= 256 && d != OP_DIGIT && d != OP_WHITESPACE && d != OP_WORDCHAR) ||
+ (c < 256 &&
+ (d != OP_ANY ||
+ (ims & PCRE_DOTALL) != 0 ||
+ !IS_NEWLINE(ptr)
+ ) &&
+ ((ctypes[c] & toptable1[d]) ^ toptable2[d]) != 0))
+ {
+ if (++count >= GET2(code, 1))
+ { ADD_NEW(state_offset + 4, 0); }
+ else
+ { ADD_NEW(state_offset, count); }
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_TYPEUPTO:
+ case OP_TYPEMINUPTO:
+ case OP_TYPEPOSUPTO:
+ ADD_ACTIVE(state_offset + 4, 0);
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ if ((c >= 256 && d != OP_DIGIT && d != OP_WHITESPACE && d != OP_WORDCHAR) ||
+ (c < 256 &&
+ (d != OP_ANY ||
+ (ims & PCRE_DOTALL) != 0 ||
+ !IS_NEWLINE(ptr)
+ ) &&
+ ((ctypes[c] & toptable1[d]) ^ toptable2[d]) != 0))
+ {
+ if (codevalue == OP_TYPEPOSUPTO)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ if (++count >= GET2(code, 1))
+ { ADD_NEW(state_offset + 4, 0); }
+ else
+ { ADD_NEW(state_offset, count); }
+ }
+ }
+ break;
+
+/* ========================================================================== */
+ /* These are virtual opcodes that are used when something like
+ OP_TYPEPLUS has OP_PROP, OP_NOTPROP, OP_ANYNL, or OP_EXTUNI as its
+ argument. It keeps the code above fast for the other cases. The argument
+ is in the d variable. */
+
+#ifdef SUPPORT_UCP
+ case OP_PROP_EXTRA + OP_TYPEPLUS:
+ case OP_PROP_EXTRA + OP_TYPEMINPLUS:
+ case OP_PROP_EXTRA + OP_TYPEPOSPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(state_offset + 4, 0); }
+ if (clen > 0)
+ {
+ BOOL OK;
+ int category = _pcre_ucp_findprop(c, &chartype, &script);
+ switch(code[2])
+ {
+ case PT_ANY:
+ OK = TRUE;
+ break;
+
+ case PT_LAMP:
+ OK = chartype == ucp_Lu || chartype == ucp_Ll || chartype == ucp_Lt;
+ break;
+
+ case PT_GC:
+ OK = category == code[3];
+ break;
+
+ case PT_PC:
+ OK = chartype == code[3];
+ break;
+
+ case PT_SC:
+ OK = script == code[3];
+ break;
+
+ /* Should never occur, but keep compilers from grumbling. */
+
+ default:
+ OK = codevalue != OP_PROP;
+ break;
+ }
+
+ if (OK == (d == OP_PROP))
+ {
+ if (count > 0 && codevalue == OP_PROP_EXTRA + OP_TYPEPOSPLUS)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ count++;
+ ADD_NEW(state_offset, count);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_EXTUNI_EXTRA + OP_TYPEPLUS:
+ case OP_EXTUNI_EXTRA + OP_TYPEMINPLUS:
+ case OP_EXTUNI_EXTRA + OP_TYPEPOSPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
+ if (clen > 0 && _pcre_ucp_findprop(c, &chartype, &script) != ucp_M)
+ {
+ const uschar *nptr = ptr + clen;
+ int ncount = 0;
+ if (count > 0 && codevalue == OP_EXTUNI_EXTRA + OP_TYPEPOSPLUS)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ while (nptr < end_subject)
+ {
+ int nd;
+ int ndlen = 1;
+ GETCHARLEN(nd, nptr, ndlen);
+ if (_pcre_ucp_findprop(nd, &chartype, &script) != ucp_M) break;
+ ncount++;
+ nptr += ndlen;
+ }
+ count++;
+ ADD_NEW_DATA(-state_offset, count, ncount);
+ }
+ break;
+#endif
+
+ /*-----------------------------------------------------------------*/
+ case OP_ANYNL_EXTRA + OP_TYPEPLUS:
+ case OP_ANYNL_EXTRA + OP_TYPEMINPLUS:
+ case OP_ANYNL_EXTRA + OP_TYPEPOSPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
+ if (clen > 0)
+ {
+ int ncount = 0;
+ switch (c)
+ {
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ if ((md->moptions & PCRE_BSR_ANYCRLF) != 0) break;
+ goto ANYNL01;
+
+ case 0x000d:
+ if (ptr + 1 < end_subject && ptr[1] == 0x0a) ncount = 1;
+ /* Fall through */
+
+ ANYNL01:
+ case 0x000a:
+ if (count > 0 && codevalue == OP_ANYNL_EXTRA + OP_TYPEPOSPLUS)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ count++;
+ ADD_NEW_DATA(-state_offset, count, ncount);
+ break;
+
+ default:
+ break;
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_VSPACE_EXTRA + OP_TYPEPLUS:
+ case OP_VSPACE_EXTRA + OP_TYPEMINPLUS:
+ case OP_VSPACE_EXTRA + OP_TYPEPOSPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
+ if (clen > 0)
+ {
+ BOOL OK;
+ switch (c)
+ {
+ case 0x000a:
+ case 0x000b:
+ case 0x000c:
+ case 0x000d:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ OK = TRUE;
+ break;
+
+ default:
+ OK = FALSE;
+ break;
+ }
+
+ if (OK == (d == OP_VSPACE))
+ {
+ if (count > 0 && codevalue == OP_VSPACE_EXTRA + OP_TYPEPOSPLUS)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ count++;
+ ADD_NEW_DATA(-state_offset, count, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_HSPACE_EXTRA + OP_TYPEPLUS:
+ case OP_HSPACE_EXTRA + OP_TYPEMINPLUS:
+ case OP_HSPACE_EXTRA + OP_TYPEPOSPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
+ if (clen > 0)
+ {
+ BOOL OK;
+ switch (c)
+ {
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ OK = TRUE;
+ break;
+
+ default:
+ OK = FALSE;
+ break;
+ }
+
+ if (OK == (d == OP_HSPACE))
+ {
+ if (count > 0 && codevalue == OP_HSPACE_EXTRA + OP_TYPEPOSPLUS)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ count++;
+ ADD_NEW_DATA(-state_offset, count, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+#ifdef SUPPORT_UCP
+ case OP_PROP_EXTRA + OP_TYPEQUERY:
+ case OP_PROP_EXTRA + OP_TYPEMINQUERY:
+ case OP_PROP_EXTRA + OP_TYPEPOSQUERY:
+ count = 4;
+ goto QS1;
+
+ case OP_PROP_EXTRA + OP_TYPESTAR:
+ case OP_PROP_EXTRA + OP_TYPEMINSTAR:
+ case OP_PROP_EXTRA + OP_TYPEPOSSTAR:
+ count = 0;
+
+ QS1:
+
+ ADD_ACTIVE(state_offset + 4, 0);
+ if (clen > 0)
+ {
+ BOOL OK;
+ int category = _pcre_ucp_findprop(c, &chartype, &script);
+ switch(code[2])
+ {
+ case PT_ANY:
+ OK = TRUE;
+ break;
+
+ case PT_LAMP:
+ OK = chartype == ucp_Lu || chartype == ucp_Ll || chartype == ucp_Lt;
+ break;
+
+ case PT_GC:
+ OK = category == code[3];
+ break;
+
+ case PT_PC:
+ OK = chartype == code[3];
+ break;
+
+ case PT_SC:
+ OK = script == code[3];
+ break;
+
+ /* Should never occur, but keep compilers from grumbling. */
+
+ default:
+ OK = codevalue != OP_PROP;
+ break;
+ }
+
+ if (OK == (d == OP_PROP))
+ {
+ if (codevalue == OP_PROP_EXTRA + OP_TYPEPOSSTAR ||
+ codevalue == OP_PROP_EXTRA + OP_TYPEPOSQUERY)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW(state_offset + count, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_EXTUNI_EXTRA + OP_TYPEQUERY:
+ case OP_EXTUNI_EXTRA + OP_TYPEMINQUERY:
+ case OP_EXTUNI_EXTRA + OP_TYPEPOSQUERY:
+ count = 2;
+ goto QS2;
+
+ case OP_EXTUNI_EXTRA + OP_TYPESTAR:
+ case OP_EXTUNI_EXTRA + OP_TYPEMINSTAR:
+ case OP_EXTUNI_EXTRA + OP_TYPEPOSSTAR:
+ count = 0;
+
+ QS2:
+
+ ADD_ACTIVE(state_offset + 2, 0);
+ if (clen > 0 && _pcre_ucp_findprop(c, &chartype, &script) != ucp_M)
+ {
+ const uschar *nptr = ptr + clen;
+ int ncount = 0;
+ if (codevalue == OP_EXTUNI_EXTRA + OP_TYPEPOSSTAR ||
+ codevalue == OP_EXTUNI_EXTRA + OP_TYPEPOSQUERY)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ while (nptr < end_subject)
+ {
+ int nd;
+ int ndlen = 1;
+ GETCHARLEN(nd, nptr, ndlen);
+ if (_pcre_ucp_findprop(nd, &chartype, &script) != ucp_M) break;
+ ncount++;
+ nptr += ndlen;
+ }
+ ADD_NEW_DATA(-(state_offset + count), 0, ncount);
+ }
+ break;
+#endif
+
+ /*-----------------------------------------------------------------*/
+ case OP_ANYNL_EXTRA + OP_TYPEQUERY:
+ case OP_ANYNL_EXTRA + OP_TYPEMINQUERY:
+ case OP_ANYNL_EXTRA + OP_TYPEPOSQUERY:
+ count = 2;
+ goto QS3;
+
+ case OP_ANYNL_EXTRA + OP_TYPESTAR:
+ case OP_ANYNL_EXTRA + OP_TYPEMINSTAR:
+ case OP_ANYNL_EXTRA + OP_TYPEPOSSTAR:
+ count = 0;
+
+ QS3:
+ ADD_ACTIVE(state_offset + 2, 0);
+ if (clen > 0)
+ {
+ int ncount = 0;
+ switch (c)
+ {
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ if ((md->moptions & PCRE_BSR_ANYCRLF) != 0) break;
+ goto ANYNL02;
+
+ case 0x000d:
+ if (ptr + 1 < end_subject && ptr[1] == 0x0a) ncount = 1;
+ /* Fall through */
+
+ ANYNL02:
+ case 0x000a:
+ if (codevalue == OP_ANYNL_EXTRA + OP_TYPEPOSSTAR ||
+ codevalue == OP_ANYNL_EXTRA + OP_TYPEPOSQUERY)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW_DATA(-(state_offset + count), 0, ncount);
+ break;
+
+ default:
+ break;
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_VSPACE_EXTRA + OP_TYPEQUERY:
+ case OP_VSPACE_EXTRA + OP_TYPEMINQUERY:
+ case OP_VSPACE_EXTRA + OP_TYPEPOSQUERY:
+ count = 2;
+ goto QS4;
+
+ case OP_VSPACE_EXTRA + OP_TYPESTAR:
+ case OP_VSPACE_EXTRA + OP_TYPEMINSTAR:
+ case OP_VSPACE_EXTRA + OP_TYPEPOSSTAR:
+ count = 0;
+
+ QS4:
+ ADD_ACTIVE(state_offset + 2, 0);
+ if (clen > 0)
+ {
+ BOOL OK;
+ switch (c)
+ {
+ case 0x000a:
+ case 0x000b:
+ case 0x000c:
+ case 0x000d:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ OK = TRUE;
+ break;
+
+ default:
+ OK = FALSE;
+ break;
+ }
+ if (OK == (d == OP_VSPACE))
+ {
+ if (codevalue == OP_VSPACE_EXTRA + OP_TYPEPOSSTAR ||
+ codevalue == OP_VSPACE_EXTRA + OP_TYPEPOSQUERY)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW_DATA(-(state_offset + count), 0, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_HSPACE_EXTRA + OP_TYPEQUERY:
+ case OP_HSPACE_EXTRA + OP_TYPEMINQUERY:
+ case OP_HSPACE_EXTRA + OP_TYPEPOSQUERY:
+ count = 2;
+ goto QS5;
+
+ case OP_HSPACE_EXTRA + OP_TYPESTAR:
+ case OP_HSPACE_EXTRA + OP_TYPEMINSTAR:
+ case OP_HSPACE_EXTRA + OP_TYPEPOSSTAR:
+ count = 0;
+
+ QS5:
+ ADD_ACTIVE(state_offset + 2, 0);
+ if (clen > 0)
+ {
+ BOOL OK;
+ switch (c)
+ {
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ OK = TRUE;
+ break;
+
+ default:
+ OK = FALSE;
+ break;
+ }
+
+ if (OK == (d == OP_HSPACE))
+ {
+ if (codevalue == OP_HSPACE_EXTRA + OP_TYPEPOSSTAR ||
+ codevalue == OP_HSPACE_EXTRA + OP_TYPEPOSQUERY)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW_DATA(-(state_offset + count), 0, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+#ifdef SUPPORT_UCP
+ case OP_PROP_EXTRA + OP_TYPEEXACT:
+ case OP_PROP_EXTRA + OP_TYPEUPTO:
+ case OP_PROP_EXTRA + OP_TYPEMINUPTO:
+ case OP_PROP_EXTRA + OP_TYPEPOSUPTO:
+ if (codevalue != OP_PROP_EXTRA + OP_TYPEEXACT)
+ { ADD_ACTIVE(state_offset + 6, 0); }
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ BOOL OK;
+ int category = _pcre_ucp_findprop(c, &chartype, &script);
+ switch(code[4])
+ {
+ case PT_ANY:
+ OK = TRUE;
+ break;
+
+ case PT_LAMP:
+ OK = chartype == ucp_Lu || chartype == ucp_Ll || chartype == ucp_Lt;
+ break;
+
+ case PT_GC:
+ OK = category == code[5];
+ break;
+
+ case PT_PC:
+ OK = chartype == code[5];
+ break;
+
+ case PT_SC:
+ OK = script == code[5];
+ break;
+
+ /* Should never occur, but keep compilers from grumbling. */
+
+ default:
+ OK = codevalue != OP_PROP;
+ break;
+ }
+
+ if (OK == (d == OP_PROP))
+ {
+ if (codevalue == OP_PROP_EXTRA + OP_TYPEPOSUPTO)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ if (++count >= GET2(code, 1))
+ { ADD_NEW(state_offset + 6, 0); }
+ else
+ { ADD_NEW(state_offset, count); }
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_EXTUNI_EXTRA + OP_TYPEEXACT:
+ case OP_EXTUNI_EXTRA + OP_TYPEUPTO:
+ case OP_EXTUNI_EXTRA + OP_TYPEMINUPTO:
+ case OP_EXTUNI_EXTRA + OP_TYPEPOSUPTO:
+ if (codevalue != OP_EXTUNI_EXTRA + OP_TYPEEXACT)
+ { ADD_ACTIVE(state_offset + 4, 0); }
+ count = current_state->count; /* Number already matched */
+ if (clen > 0 && _pcre_ucp_findprop(c, &chartype, &script) != ucp_M)
+ {
+ const uschar *nptr = ptr + clen;
+ int ncount = 0;
+ if (codevalue == OP_EXTUNI_EXTRA + OP_TYPEPOSUPTO)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ while (nptr < end_subject)
+ {
+ int nd;
+ int ndlen = 1;
+ GETCHARLEN(nd, nptr, ndlen);
+ if (_pcre_ucp_findprop(nd, &chartype, &script) != ucp_M) break;
+ ncount++;
+ nptr += ndlen;
+ }
+ if (++count >= GET2(code, 1))
+ { ADD_NEW_DATA(-(state_offset + 4), 0, ncount); }
+ else
+ { ADD_NEW_DATA(-state_offset, count, ncount); }
+ }
+ break;
+#endif
+
+ /*-----------------------------------------------------------------*/
+ case OP_ANYNL_EXTRA + OP_TYPEEXACT:
+ case OP_ANYNL_EXTRA + OP_TYPEUPTO:
+ case OP_ANYNL_EXTRA + OP_TYPEMINUPTO:
+ case OP_ANYNL_EXTRA + OP_TYPEPOSUPTO:
+ if (codevalue != OP_ANYNL_EXTRA + OP_TYPEEXACT)
+ { ADD_ACTIVE(state_offset + 4, 0); }
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ int ncount = 0;
+ switch (c)
+ {
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ if ((md->moptions & PCRE_BSR_ANYCRLF) != 0) break;
+ goto ANYNL03;
+
+ case 0x000d:
+ if (ptr + 1 < end_subject && ptr[1] == 0x0a) ncount = 1;
+ /* Fall through */
+
+ ANYNL03:
+ case 0x000a:
+ if (codevalue == OP_ANYNL_EXTRA + OP_TYPEPOSUPTO)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ if (++count >= GET2(code, 1))
+ { ADD_NEW_DATA(-(state_offset + 4), 0, ncount); }
+ else
+ { ADD_NEW_DATA(-state_offset, count, ncount); }
+ break;
+
+ default:
+ break;
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_VSPACE_EXTRA + OP_TYPEEXACT:
+ case OP_VSPACE_EXTRA + OP_TYPEUPTO:
+ case OP_VSPACE_EXTRA + OP_TYPEMINUPTO:
+ case OP_VSPACE_EXTRA + OP_TYPEPOSUPTO:
+ if (codevalue != OP_VSPACE_EXTRA + OP_TYPEEXACT)
+ { ADD_ACTIVE(state_offset + 4, 0); }
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ BOOL OK;
+ switch (c)
+ {
+ case 0x000a:
+ case 0x000b:
+ case 0x000c:
+ case 0x000d:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ OK = TRUE;
+ break;
+
+ default:
+ OK = FALSE;
+ }
+
+ if (OK == (d == OP_VSPACE))
+ {
+ if (codevalue == OP_VSPACE_EXTRA + OP_TYPEPOSUPTO)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ if (++count >= GET2(code, 1))
+ { ADD_NEW_DATA(-(state_offset + 4), 0, 0); }
+ else
+ { ADD_NEW_DATA(-state_offset, count, 0); }
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_HSPACE_EXTRA + OP_TYPEEXACT:
+ case OP_HSPACE_EXTRA + OP_TYPEUPTO:
+ case OP_HSPACE_EXTRA + OP_TYPEMINUPTO:
+ case OP_HSPACE_EXTRA + OP_TYPEPOSUPTO:
+ if (codevalue != OP_HSPACE_EXTRA + OP_TYPEEXACT)
+ { ADD_ACTIVE(state_offset + 4, 0); }
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ BOOL OK;
+ switch (c)
+ {
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ OK = TRUE;
+ break;
+
+ default:
+ OK = FALSE;
+ break;
+ }
+
+ if (OK == (d == OP_HSPACE))
+ {
+ if (codevalue == OP_HSPACE_EXTRA + OP_TYPEPOSUPTO)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ if (++count >= GET2(code, 1))
+ { ADD_NEW_DATA(-(state_offset + 4), 0, 0); }
+ else
+ { ADD_NEW_DATA(-state_offset, count, 0); }
+ }
+ }
+ break;
+
+/* ========================================================================== */
+ /* These opcodes are followed by a character that is usually compared
+ to the current subject character; it is loaded into d. We still get
+ here even if there is no subject character, because in some cases zero
+ repetitions are permitted. */
+
+ /*-----------------------------------------------------------------*/
+ case OP_CHAR:
+ if (clen > 0 && c == d) { ADD_NEW(state_offset + dlen + 1, 0); }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_CHARNC:
+ if (clen == 0) break;
+
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ if (c == d) { ADD_NEW(state_offset + dlen + 1, 0); } else
+ {
+ unsigned int othercase;
+ if (c < 128) othercase = fcc[c]; else
+
+ /* If we have Unicode property support, we can use it to test the
+ other case of the character. */
+
+#ifdef SUPPORT_UCP
+ othercase = _pcre_ucp_othercase(c);
+#else
+ othercase = NOTACHAR;
+#endif
+
+ if (d == othercase) { ADD_NEW(state_offset + dlen + 1, 0); }
+ }
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+
+ /* Non-UTF-8 mode */
+ {
+ if (lcc[c] == lcc[d]) { ADD_NEW(state_offset + 2, 0); }
+ }
+ break;
+
+
+#ifdef SUPPORT_UCP
+ /*-----------------------------------------------------------------*/
+ /* This is a tricky one because it can match more than one character.
+ Find out how many characters to skip, and then set up a negative state
+ to wait for them to pass before continuing. */
+
+ case OP_EXTUNI:
+ if (clen > 0 && _pcre_ucp_findprop(c, &chartype, &script) != ucp_M)
+ {
+ const uschar *nptr = ptr + clen;
+ int ncount = 0;
+ while (nptr < end_subject)
+ {
+ int nclen = 1;
+ GETCHARLEN(c, nptr, nclen);
+ if (_pcre_ucp_findprop(c, &chartype, &script) != ucp_M) break;
+ ncount++;
+ nptr += nclen;
+ }
+ ADD_NEW_DATA(-(state_offset + 1), 0, ncount);
+ }
+ break;
+#endif
+
+ /*-----------------------------------------------------------------*/
+ /* This is a tricky like EXTUNI because it too can match more than one
+ character (when CR is followed by LF). In this case, set up a negative
+ state to wait for one character to pass before continuing. */
+
+ case OP_ANYNL:
+ if (clen > 0) switch(c)
+ {
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ if ((md->moptions & PCRE_BSR_ANYCRLF) != 0) break;
+
+ case 0x000a:
+ ADD_NEW(state_offset + 1, 0);
+ break;
+
+ case 0x000d:
+ if (ptr + 1 < end_subject && ptr[1] == 0x0a)
+ {
+ ADD_NEW_DATA(-(state_offset + 1), 0, 1);
+ }
+ else
+ {
+ ADD_NEW(state_offset + 1, 0);
+ }
+ break;
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_NOT_VSPACE:
+ if (clen > 0) switch(c)
+ {
+ case 0x000a:
+ case 0x000b:
+ case 0x000c:
+ case 0x000d:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ break;
+
+ default:
+ ADD_NEW(state_offset + 1, 0);
+ break;
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_VSPACE:
+ if (clen > 0) switch(c)
+ {
+ case 0x000a:
+ case 0x000b:
+ case 0x000c:
+ case 0x000d:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ ADD_NEW(state_offset + 1, 0);
+ break;
+
+ default: break;
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_NOT_HSPACE:
+ if (clen > 0) switch(c)
+ {
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ break;
+
+ default:
+ ADD_NEW(state_offset + 1, 0);
+ break;
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_HSPACE:
+ if (clen > 0) switch(c)
+ {
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ ADD_NEW(state_offset + 1, 0);
+ break;
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ /* Match a negated single character. This is only used for one-byte
+ characters, that is, we know that d < 256. The character we are
+ checking (c) can be multibyte. */
+
+ case OP_NOT:
+ if (clen > 0)
+ {
+ unsigned int otherd = ((ims & PCRE_CASELESS) != 0)? fcc[d] : d;
+ if (c != d && c != otherd) { ADD_NEW(state_offset + dlen + 1, 0); }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_PLUS:
+ case OP_MINPLUS:
+ case OP_POSPLUS:
+ case OP_NOTPLUS:
+ case OP_NOTMINPLUS:
+ case OP_NOTPOSPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(state_offset + dlen + 1, 0); }
+ if (clen > 0)
+ {
+ unsigned int otherd = NOTACHAR;
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8 && d >= 128)
+ {
+#ifdef SUPPORT_UCP
+ otherd = _pcre_ucp_othercase(d);
+#endif /* SUPPORT_UCP */
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+ otherd = fcc[d];
+ }
+ if ((c == d || c == otherd) == (codevalue < OP_NOTSTAR))
+ {
+ if (count > 0 &&
+ (codevalue == OP_POSPLUS || codevalue == OP_NOTPOSPLUS))
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ count++;
+ ADD_NEW(state_offset, count);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_QUERY:
+ case OP_MINQUERY:
+ case OP_POSQUERY:
+ case OP_NOTQUERY:
+ case OP_NOTMINQUERY:
+ case OP_NOTPOSQUERY:
+ ADD_ACTIVE(state_offset + dlen + 1, 0);
+ if (clen > 0)
+ {
+ unsigned int otherd = NOTACHAR;
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8 && d >= 128)
+ {
+#ifdef SUPPORT_UCP
+ otherd = _pcre_ucp_othercase(d);
+#endif /* SUPPORT_UCP */
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+ otherd = fcc[d];
+ }
+ if ((c == d || c == otherd) == (codevalue < OP_NOTSTAR))
+ {
+ if (codevalue == OP_POSQUERY || codevalue == OP_NOTPOSQUERY)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW(state_offset + dlen + 1, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_STAR:
+ case OP_MINSTAR:
+ case OP_POSSTAR:
+ case OP_NOTSTAR:
+ case OP_NOTMINSTAR:
+ case OP_NOTPOSSTAR:
+ ADD_ACTIVE(state_offset + dlen + 1, 0);
+ if (clen > 0)
+ {
+ unsigned int otherd = NOTACHAR;
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8 && d >= 128)
+ {
+#ifdef SUPPORT_UCP
+ otherd = _pcre_ucp_othercase(d);
+#endif /* SUPPORT_UCP */
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+ otherd = fcc[d];
+ }
+ if ((c == d || c == otherd) == (codevalue < OP_NOTSTAR))
+ {
+ if (codevalue == OP_POSSTAR || codevalue == OP_NOTPOSSTAR)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ ADD_NEW(state_offset, 0);
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_EXACT:
+ case OP_NOTEXACT:
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ unsigned int otherd = NOTACHAR;
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8 && d >= 128)
+ {
+#ifdef SUPPORT_UCP
+ otherd = _pcre_ucp_othercase(d);
+#endif /* SUPPORT_UCP */
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+ otherd = fcc[d];
+ }
+ if ((c == d || c == otherd) == (codevalue < OP_NOTSTAR))
+ {
+ if (++count >= GET2(code, 1))
+ { ADD_NEW(state_offset + dlen + 3, 0); }
+ else
+ { ADD_NEW(state_offset, count); }
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_UPTO:
+ case OP_MINUPTO:
+ case OP_POSUPTO:
+ case OP_NOTUPTO:
+ case OP_NOTMINUPTO:
+ case OP_NOTPOSUPTO:
+ ADD_ACTIVE(state_offset + dlen + 3, 0);
+ count = current_state->count; /* Number already matched */
+ if (clen > 0)
+ {
+ unsigned int otherd = NOTACHAR;
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (utf8 && d >= 128)
+ {
+#ifdef SUPPORT_UCP
+ otherd = _pcre_ucp_othercase(d);
+#endif /* SUPPORT_UCP */
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+ otherd = fcc[d];
+ }
+ if ((c == d || c == otherd) == (codevalue < OP_NOTSTAR))
+ {
+ if (codevalue == OP_POSUPTO || codevalue == OP_NOTPOSUPTO)
+ {
+ active_count--; /* Remove non-match possibility */
+ next_active_state--;
+ }
+ if (++count >= GET2(code, 1))
+ { ADD_NEW(state_offset + dlen + 3, 0); }
+ else
+ { ADD_NEW(state_offset, count); }
+ }
+ }
+ break;
+
+
+/* ========================================================================== */
+ /* These are the class-handling opcodes */
+
+ case OP_CLASS:
+ case OP_NCLASS:
+ case OP_XCLASS:
+ {
+ BOOL isinclass = FALSE;
+ int next_state_offset;
+ const uschar *ecode;
+
+ /* For a simple class, there is always just a 32-byte table, and we
+ can set isinclass from it. */
+
+ if (codevalue != OP_XCLASS)
+ {
+ ecode = code + 33;
+ if (clen > 0)
+ {
+ isinclass = (c > 255)? (codevalue == OP_NCLASS) :
+ ((code[1 + c/8] & (1 << (c&7))) != 0);
+ }
+ }
+
+ /* An extended class may have a table or a list of single characters,
+ ranges, or both, and it may be positive or negative. There's a
+ function that sorts all this out. */
+
+ else
+ {
+ ecode = code + GET(code, 1);
+ if (clen > 0) isinclass = _pcre_xclass(c, code + 1 + LINK_SIZE);
+ }
+
+ /* At this point, isinclass is set for all kinds of class, and ecode
+ points to the byte after the end of the class. If there is a
+ quantifier, this is where it will be. */
+
+ next_state_offset = ecode - start_code;
+
+ switch (*ecode)
+ {
+ case OP_CRSTAR:
+ case OP_CRMINSTAR:
+ ADD_ACTIVE(next_state_offset + 1, 0);
+ if (isinclass) { ADD_NEW(state_offset, 0); }
+ break;
+
+ case OP_CRPLUS:
+ case OP_CRMINPLUS:
+ count = current_state->count; /* Already matched */
+ if (count > 0) { ADD_ACTIVE(next_state_offset + 1, 0); }
+ if (isinclass) { count++; ADD_NEW(state_offset, count); }
+ break;
+
+ case OP_CRQUERY:
+ case OP_CRMINQUERY:
+ ADD_ACTIVE(next_state_offset + 1, 0);
+ if (isinclass) { ADD_NEW(next_state_offset + 1, 0); }
+ break;
+
+ case OP_CRRANGE:
+ case OP_CRMINRANGE:
+ count = current_state->count; /* Already matched */
+ if (count >= GET2(ecode, 1))
+ { ADD_ACTIVE(next_state_offset + 5, 0); }
+ if (isinclass)
+ {
+ int max = GET2(ecode, 3);
+ if (++count >= max && max != 0) /* Max 0 => no limit */
+ { ADD_NEW(next_state_offset + 5, 0); }
+ else
+ { ADD_NEW(state_offset, count); }
+ }
+ break;
+
+ default:
+ if (isinclass) { ADD_NEW(next_state_offset, 0); }
+ break;
+ }
+ }
+ break;
+
+/* ========================================================================== */
+ /* These are the opcodes for fancy brackets of various kinds. We have
+ to use recursion in order to handle them. */
+
+ case OP_ASSERT:
+ case OP_ASSERT_NOT:
+ case OP_ASSERTBACK:
+ case OP_ASSERTBACK_NOT:
+ {
+ int rc;
+ int local_offsets[2];
+ int local_workspace[1000];
+ const uschar *endasscode = code + GET(code, 1);
+
+ while (*endasscode == OP_ALT) endasscode += GET(endasscode, 1);
+
+ rc = internal_dfa_exec(
+ md, /* static match data */
+ code, /* this subexpression's code */
+ ptr, /* where we currently are */
+ ptr - start_subject, /* start offset */
+ local_offsets, /* offset vector */
+ sizeof(local_offsets)/sizeof(int), /* size of same */
+ local_workspace, /* workspace vector */
+ sizeof(local_workspace)/sizeof(int), /* size of same */
+ ims, /* the current ims flags */
+ rlevel, /* function recursion level */
+ recursing); /* pass on regex recursion */
+
+ if ((rc >= 0) == (codevalue == OP_ASSERT || codevalue == OP_ASSERTBACK))
+ { ADD_ACTIVE(endasscode + LINK_SIZE + 1 - start_code, 0); }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_COND:
+ case OP_SCOND:
+ {
+ int local_offsets[1000];
+ int local_workspace[1000];
+ int condcode = code[LINK_SIZE+1];
+
+ /* Back reference conditions are not supported */
+
+ if (condcode == OP_CREF) return PCRE_ERROR_DFA_UCOND;
+
+ /* The DEFINE condition is always false */
+
+ if (condcode == OP_DEF)
+ {
+ ADD_ACTIVE(state_offset + GET(code, 1) + LINK_SIZE + 1, 0);
+ }
+
+ /* The only supported version of OP_RREF is for the value RREF_ANY,
+ which means "test if in any recursion". We can't test for specifically
+ recursed groups. */
+
+ else if (condcode == OP_RREF)
+ {
+ int value = GET2(code, LINK_SIZE+2);
+ if (value != RREF_ANY) return PCRE_ERROR_DFA_UCOND;
+ if (recursing > 0) { ADD_ACTIVE(state_offset + LINK_SIZE + 4, 0); }
+ else { ADD_ACTIVE(state_offset + GET(code, 1) + LINK_SIZE + 1, 0); }
+ }
+
+ /* Otherwise, the condition is an assertion */
+
+ else
+ {
+ int rc;
+ const uschar *asscode = code + LINK_SIZE + 1;
+ const uschar *endasscode = asscode + GET(asscode, 1);
+
+ while (*endasscode == OP_ALT) endasscode += GET(endasscode, 1);
+
+ rc = internal_dfa_exec(
+ md, /* fixed match data */
+ asscode, /* this subexpression's code */
+ ptr, /* where we currently are */
+ ptr - start_subject, /* start offset */
+ local_offsets, /* offset vector */
+ sizeof(local_offsets)/sizeof(int), /* size of same */
+ local_workspace, /* workspace vector */
+ sizeof(local_workspace)/sizeof(int), /* size of same */
+ ims, /* the current ims flags */
+ rlevel, /* function recursion level */
+ recursing); /* pass on regex recursion */
+
+ if ((rc >= 0) ==
+ (condcode == OP_ASSERT || condcode == OP_ASSERTBACK))
+ { ADD_ACTIVE(endasscode + LINK_SIZE + 1 - start_code, 0); }
+ else
+ { ADD_ACTIVE(state_offset + GET(code, 1) + LINK_SIZE + 1, 0); }
+ }
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_RECURSE:
+ {
+ int local_offsets[1000];
+ int local_workspace[1000];
+ int rc;
+
+ DPRINTF(("%.*sStarting regex recursion %d\n", rlevel*2-2, SP,
+ recursing + 1));
+
+ rc = internal_dfa_exec(
+ md, /* fixed match data */
+ start_code + GET(code, 1), /* this subexpression's code */
+ ptr, /* where we currently are */
+ ptr - start_subject, /* start offset */
+ local_offsets, /* offset vector */
+ sizeof(local_offsets)/sizeof(int), /* size of same */
+ local_workspace, /* workspace vector */
+ sizeof(local_workspace)/sizeof(int), /* size of same */
+ ims, /* the current ims flags */
+ rlevel, /* function recursion level */
+ recursing + 1); /* regex recurse level */
+
+ DPRINTF(("%.*sReturn from regex recursion %d: rc=%d\n", rlevel*2-2, SP,
+ recursing + 1, rc));
+
+ /* Ran out of internal offsets */
+
+ if (rc == 0) return PCRE_ERROR_DFA_RECURSE;
+
+ /* For each successful matched substring, set up the next state with a
+ count of characters to skip before trying it. Note that the count is in
+ characters, not bytes. */
+
+ if (rc > 0)
+ {
+ for (rc = rc*2 - 2; rc >= 0; rc -= 2)
+ {
+ const uschar *p = start_subject + local_offsets[rc];
+ const uschar *pp = start_subject + local_offsets[rc+1];
+ int charcount = local_offsets[rc+1] - local_offsets[rc];
+ while (p < pp) if ((*p++ & 0xc0) == 0x80) charcount--;
+ if (charcount > 0)
+ {
+ ADD_NEW_DATA(-(state_offset + LINK_SIZE + 1), 0, (charcount - 1));
+ }
+ else
+ {
+ ADD_ACTIVE(state_offset + LINK_SIZE + 1, 0);
+ }
+ }
+ }
+ else if (rc != PCRE_ERROR_NOMATCH) return rc;
+ }
+ break;
+
+ /*-----------------------------------------------------------------*/
+ case OP_ONCE:
+ {
+ int local_offsets[2];
+ int local_workspace[1000];
+
+ int rc = internal_dfa_exec(
+ md, /* fixed match data */
+ code, /* this subexpression's code */
+ ptr, /* where we currently are */
+ ptr - start_subject, /* start offset */
+ local_offsets, /* offset vector */
+ sizeof(local_offsets)/sizeof(int), /* size of same */
+ local_workspace, /* workspace vector */
+ sizeof(local_workspace)/sizeof(int), /* size of same */
+ ims, /* the current ims flags */
+ rlevel, /* function recursion level */
+ recursing); /* pass on regex recursion */
+
+ if (rc >= 0)
+ {
+ const uschar *end_subpattern = code;
+ int charcount = local_offsets[1] - local_offsets[0];
+ int next_state_offset, repeat_state_offset;
+
+ do { end_subpattern += GET(end_subpattern, 1); }
+ while (*end_subpattern == OP_ALT);
+ next_state_offset = end_subpattern - start_code + LINK_SIZE + 1;
+
+ /* If the end of this subpattern is KETRMAX or KETRMIN, we must
+ arrange for the repeat state also to be added to the relevant list.
+ Calculate the offset, or set -1 for no repeat. */
+
+ repeat_state_offset = (*end_subpattern == OP_KETRMAX ||
+ *end_subpattern == OP_KETRMIN)?
+ end_subpattern - start_code - GET(end_subpattern, 1) : -1;
+
+ /* If we have matched an empty string, add the next state at the
+ current character pointer. This is important so that the duplicate
+ checking kicks in, which is what breaks infinite loops that match an
+ empty string. */
+
+ if (charcount == 0)
+ {
+ ADD_ACTIVE(next_state_offset, 0);
+ }
+
+ /* Optimization: if there are no more active states, and there
+ are no new states yet set up, then skip over the subject string
+ right here, to save looping. Otherwise, set up the new state to swing
+ into action when the end of the substring is reached. */
+
+ else if (i + 1 >= active_count && new_count == 0)
+ {
+ ptr += charcount;
+ clen = 0;
+ ADD_NEW(next_state_offset, 0);
+
+ /* If we are adding a repeat state at the new character position,
+ we must fudge things so that it is the only current state.
+ Otherwise, it might be a duplicate of one we processed before, and
+ that would cause it to be skipped. */
+
+ if (repeat_state_offset >= 0)
+ {
+ next_active_state = active_states;
+ active_count = 0;
+ i = -1;
+ ADD_ACTIVE(repeat_state_offset, 0);
+ }
+ }
+ else
+ {
+ const uschar *p = start_subject + local_offsets[0];
+ const uschar *pp = start_subject + local_offsets[1];
+ while (p < pp) if ((*p++ & 0xc0) == 0x80) charcount--;
+ ADD_NEW_DATA(-next_state_offset, 0, (charcount - 1));
+ if (repeat_state_offset >= 0)
+ { ADD_NEW_DATA(-repeat_state_offset, 0, (charcount - 1)); }
+ }
+
+ }
+ else if (rc != PCRE_ERROR_NOMATCH) return rc;
+ }
+ break;
+
+
+/* ========================================================================== */
+ /* Handle callouts */
+
+ case OP_CALLOUT:
+ if (pcre_callout != NULL)
+ {
+ int rrc;
+ pcre_callout_block cb;
+ cb.version = 1; /* Version 1 of the callout block */
+ cb.callout_number = code[1];
+ cb.offset_vector = offsets;
+ cb.subject = (PCRE_SPTR)start_subject;
+ cb.subject_length = end_subject - start_subject;
+ cb.start_match = current_subject - start_subject;
+ cb.current_position = ptr - start_subject;
+ cb.pattern_position = GET(code, 2);
+ cb.next_item_length = GET(code, 2 + LINK_SIZE);
+ cb.capture_top = 1;
+ cb.capture_last = -1;
+ cb.callout_data = md->callout_data;
+ if ((rrc = (*pcre_callout)(&cb)) < 0) return rrc; /* Abandon */
+ if (rrc == 0) { ADD_ACTIVE(state_offset + 2 + 2*LINK_SIZE, 0); }
+ }
+ break;
+
+
+/* ========================================================================== */
+ default: /* Unsupported opcode */
+ return PCRE_ERROR_DFA_UITEM;
+ }
+
+ NEXT_ACTIVE_STATE: continue;
+
+ } /* End of loop scanning active states */
+
+ /* We have finished the processing at the current subject character. If no
+ new states have been set for the next character, we have found all the
+ matches that we are going to find. If we are at the top level and partial
+ matching has been requested, check for appropriate conditions. */
+
+ if (new_count <= 0)
+ {
+ if (match_count < 0 && /* No matches found */
+ rlevel == 1 && /* Top level match function */
+ (md->moptions & PCRE_PARTIAL) != 0 && /* Want partial matching */
+ ptr >= end_subject && /* Reached end of subject */
+ ptr > current_subject) /* Matched non-empty string */
+ {
+ if (offsetcount >= 2)
+ {
+ offsets[0] = current_subject - start_subject;
+ offsets[1] = end_subject - start_subject;
+ }
+ match_count = PCRE_ERROR_PARTIAL;
+ }
+
+ DPRINTF(("%.*sEnd of internal_dfa_exec %d: returning %d\n"
+ "%.*s---------------------\n\n", rlevel*2-2, SP, rlevel, match_count,
+ rlevel*2-2, SP));
+ break; /* In effect, "return", but see the comment below */
+ }
+
+ /* One or more states are active for the next character. */
+
+ ptr += clen; /* Advance to next subject character */
+ } /* Loop to move along the subject string */
+
+/* Control gets here from "break" a few lines above. We do it this way because
+if we use "return" above, we have compiler trouble. Some compilers warn if
+there's nothing here because they think the function doesn't return a value. On
+the other hand, if we put a dummy statement here, some more clever compilers
+complain that it can't be reached. Sigh. */
+
+return match_count;
+}
+
+
+
+
+/*************************************************
+* Execute a Regular Expression - DFA engine *
+*************************************************/
+
+/* This external function applies a compiled re to a subject string using a DFA
+engine. This function calls the internal function multiple times if the pattern
+is not anchored.
+
+Arguments:
+ argument_re points to the compiled expression
+ extra_data points to extra data or is NULL
+ subject points to the subject string
+ length length of subject string (may contain binary zeros)
+ start_offset where to start in the subject string
+ options option bits
+ offsets vector of match offsets
+ offsetcount size of same
+ workspace workspace vector
+ wscount size of same
+
+Returns: > 0 => number of match offset pairs placed in offsets
+ = 0 => offsets overflowed; longest matches are present
+ -1 => failed to match
+ < -1 => some kind of unexpected problem
+*/
+
+PCRE_EXP_DEFN int
+pcre_dfa_exec(const pcre *argument_re, const pcre_extra *extra_data,
+ const char *subject, int length, int start_offset, int options, int *offsets,
+ int offsetcount, int *workspace, int wscount)
+{
+real_pcre *re = (real_pcre *)argument_re;
+dfa_match_data match_block;
+dfa_match_data *md = &match_block;
+BOOL utf8, anchored, startline, firstline;
+const uschar *current_subject, *end_subject, *lcc;
+
+pcre_study_data internal_study;
+const pcre_study_data *study = NULL;
+real_pcre internal_re;
+
+const uschar *req_byte_ptr;
+const uschar *start_bits = NULL;
+BOOL first_byte_caseless = FALSE;
+BOOL req_byte_caseless = FALSE;
+int first_byte = -1;
+int req_byte = -1;
+int req_byte2 = -1;
+int newline;
+
+/* Plausibility checks */
+
+if ((options & ~PUBLIC_DFA_EXEC_OPTIONS) != 0) return PCRE_ERROR_BADOPTION;
+if (re == NULL || subject == NULL || workspace == NULL ||
+ (offsets == NULL && offsetcount > 0)) return PCRE_ERROR_NULL;
+if (offsetcount < 0) return PCRE_ERROR_BADCOUNT;
+if (wscount < 20) return PCRE_ERROR_DFA_WSSIZE;
+
+/* We need to find the pointer to any study data before we test for byte
+flipping, so we scan the extra_data block first. This may set two fields in the
+match block, so we must initialize them beforehand. However, the other fields
+in the match block must not be set until after the byte flipping. */
+
+md->tables = re->tables;
+md->callout_data = NULL;
+
+if (extra_data != NULL)
+ {
+ unsigned int flags = extra_data->flags;
+ if ((flags & PCRE_EXTRA_STUDY_DATA) != 0)
+ study = (const pcre_study_data *)extra_data->study_data;
+ if ((flags & PCRE_EXTRA_MATCH_LIMIT) != 0) return PCRE_ERROR_DFA_UMLIMIT;
+ if ((flags & PCRE_EXTRA_MATCH_LIMIT_RECURSION) != 0)
+ return PCRE_ERROR_DFA_UMLIMIT;
+ if ((flags & PCRE_EXTRA_CALLOUT_DATA) != 0)
+ md->callout_data = extra_data->callout_data;
+ if ((flags & PCRE_EXTRA_TABLES) != 0)
+ md->tables = extra_data->tables;
+ }
+
+/* Check that the first field in the block is the magic number. If it is not,
+test for a regex that was compiled on a host of opposite endianness. If this is
+the case, flipped values are put in internal_re and internal_study if there was
+study data too. */
+
+if (re->magic_number != MAGIC_NUMBER)
+ {
+ re = _pcre_try_flipped(re, &internal_re, study, &internal_study);
+ if (re == NULL) return PCRE_ERROR_BADMAGIC;
+ if (study != NULL) study = &internal_study;
+ }
+
+/* Set some local values */
+
+current_subject = (const unsigned char *)subject + start_offset;
+end_subject = (const unsigned char *)subject + length;
+req_byte_ptr = current_subject - 1;
+
+#ifdef SUPPORT_UTF8
+utf8 = (re->options & PCRE_UTF8) != 0;
+#else
+utf8 = FALSE;
+#endif
+
+anchored = (options & (PCRE_ANCHORED|PCRE_DFA_RESTART)) != 0 ||
+ (re->options & PCRE_ANCHORED) != 0;
+
+/* The remaining fixed data for passing around. */
+
+md->start_code = (const uschar *)argument_re +
+ re->name_table_offset + re->name_count * re->name_entry_size;
+md->start_subject = (const unsigned char *)subject;
+md->end_subject = end_subject;
+md->moptions = options;
+md->poptions = re->options;
+
+/* If the BSR option is not set at match time, copy what was set
+at compile time. */
+
+if ((md->moptions & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) == 0)
+ {
+ if ((re->options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) != 0)
+ md->moptions |= re->options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE);
+#ifdef BSR_ANYCRLF
+ else md->moptions |= PCRE_BSR_ANYCRLF;
+#endif
+ }
+
+/* Handle different types of newline. The three bits give eight cases. If
+nothing is set at run time, whatever was used at compile time applies. */
+
+switch ((((options & PCRE_NEWLINE_BITS) == 0)? re->options : (pcre_uint32)options) &
+ PCRE_NEWLINE_BITS)
+ {
+ case 0: newline = NEWLINE; break; /* Compile-time default */
+ case PCRE_NEWLINE_CR: newline = '\r'; break;
+ case PCRE_NEWLINE_LF: newline = '\n'; break;
+ case PCRE_NEWLINE_CR+
+ PCRE_NEWLINE_LF: newline = ('\r' << 8) | '\n'; break;
+ case PCRE_NEWLINE_ANY: newline = -1; break;
+ case PCRE_NEWLINE_ANYCRLF: newline = -2; break;
+ default: return PCRE_ERROR_BADNEWLINE;
+ }
+
+if (newline == -2)
+ {
+ md->nltype = NLTYPE_ANYCRLF;
+ }
+else if (newline < 0)
+ {
+ md->nltype = NLTYPE_ANY;
+ }
+else
+ {
+ md->nltype = NLTYPE_FIXED;
+ if (newline > 255)
+ {
+ md->nllen = 2;
+ md->nl[0] = (newline >> 8) & 255;
+ md->nl[1] = newline & 255;
+ }
+ else
+ {
+ md->nllen = 1;
+ md->nl[0] = newline;
+ }
+ }
+
+/* Check a UTF-8 string if required. Unfortunately there's no way of passing
+back the character offset. */
+
+#ifdef SUPPORT_UTF8
+if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0)
+ {
+ if (_pcre_valid_utf8((uschar *)subject, length) >= 0)
+ return PCRE_ERROR_BADUTF8;
+ if (start_offset > 0 && start_offset < length)
+ {
+ int tb = ((uschar *)subject)[start_offset];
+ if (tb > 127)
+ {
+ tb &= 0xc0;
+ if (tb != 0 && tb != 0xc0) return PCRE_ERROR_BADUTF8_OFFSET;
+ }
+ }
+ }
+#endif
+
+/* If the exec call supplied NULL for tables, use the inbuilt ones. This
+is a feature that makes it possible to save compiled regex and re-use them
+in other programs later. */
+
+if (md->tables == NULL) md->tables = _pcre_default_tables;
+
+/* The lower casing table and the "must be at the start of a line" flag are
+used in a loop when finding where to start. */
+
+lcc = md->tables + lcc_offset;
+startline = (re->flags & PCRE_STARTLINE) != 0;
+firstline = (re->options & PCRE_FIRSTLINE) != 0;
+
+/* Set up the first character to match, if available. The first_byte value is
+never set for an anchored regular expression, but the anchoring may be forced
+at run time, so we have to test for anchoring. The first char may be unset for
+an unanchored pattern, of course. If there's no first char and the pattern was
+studied, there may be a bitmap of possible first characters. */
+
+if (!anchored)
+ {
+ if ((re->flags & PCRE_FIRSTSET) != 0)
+ {
+ first_byte = re->first_byte & 255;
+ if ((first_byte_caseless = ((re->first_byte & REQ_CASELESS) != 0)) == TRUE)
+ first_byte = lcc[first_byte];
+ }
+ else
+ {
+ if (startline && study != NULL &&
+ (study->options & PCRE_STUDY_MAPPED) != 0)
+ start_bits = study->start_bits;
+ }
+ }
+
+/* For anchored or unanchored matches, there may be a "last known required
+character" set. */
+
+if ((re->flags & PCRE_REQCHSET) != 0)
+ {
+ req_byte = re->req_byte & 255;
+ req_byte_caseless = (re->req_byte & REQ_CASELESS) != 0;
+ req_byte2 = (md->tables + fcc_offset)[req_byte]; /* case flipped */
+ }
+
+/* Call the main matching function, looping for a non-anchored regex after a
+failed match. Unless restarting, optimize by moving to the first match
+character if possible, when not anchored. Then unless wanting a partial match,
+check for a required later character. */
+
+for (;;)
+ {
+ int rc;
+
+ if ((options & PCRE_DFA_RESTART) == 0)
+ {
+ const uschar *save_end_subject = end_subject;
+
+ /* Advance to a unique first char if possible. If firstline is TRUE, the
+ start of the match is constrained to the first line of a multiline string.
+ Implement this by temporarily adjusting end_subject so that we stop
+ scanning at a newline. If the match fails at the newline, later code breaks
+ this loop. */
+
+ if (firstline)
+ {
+ const uschar *t = current_subject;
+ while (t < md->end_subject && !IS_NEWLINE(t)) t++;
+ end_subject = t;
+ }
+
+ if (first_byte >= 0)
+ {
+ if (first_byte_caseless)
+ while (current_subject < end_subject &&
+ lcc[*current_subject] != first_byte)
+ current_subject++;
+ else
+ while (current_subject < end_subject && *current_subject != first_byte)
+ current_subject++;
+ }
+
+ /* Or to just after a linebreak for a multiline match if possible */
+
+ else if (startline)
+ {
+ if (current_subject > md->start_subject + start_offset)
+ {
+ while (current_subject <= end_subject && !WAS_NEWLINE(current_subject))
+ current_subject++;
+
+ /* If we have just passed a CR and the newline option is ANY or
+ ANYCRLF, and we are now at a LF, advance the match position by one more
+ character. */
+
+ if (current_subject[-1] == '\r' &&
+ (md->nltype == NLTYPE_ANY || md->nltype == NLTYPE_ANYCRLF) &&
+ current_subject < end_subject &&
+ *current_subject == '\n')
+ current_subject++;
+ }
+ }
+
+ /* Or to a non-unique first char after study */
+
+ else if (start_bits != NULL)
+ {
+ while (current_subject < end_subject)
+ {
+ register unsigned int c = *current_subject;
+ if ((start_bits[c/8] & (1 << (c&7))) == 0) current_subject++;
+ else break;
+ }
+ }
+
+ /* Restore fudged end_subject */
+
+ end_subject = save_end_subject;
+ }
+
+ /* If req_byte is set, we know that that character must appear in the subject
+ for the match to succeed. If the first character is set, req_byte must be
+ later in the subject; otherwise the test starts at the match point. This
+ optimization can save a huge amount of work in patterns with nested unlimited
+ repeats that aren't going to match. Writing separate code for cased/caseless
+ versions makes it go faster, as does using an autoincrement and backing off
+ on a match.
+
+ HOWEVER: when the subject string is very, very long, searching to its end can
+ take a long time, and give bad performance on quite ordinary patterns. This
+ showed up when somebody was matching /^C/ on a 32-megabyte string... so we
+ don't do this when the string is sufficiently long.
+
+ ALSO: this processing is disabled when partial matching is requested.
+ */
+
+ if (req_byte >= 0 &&
+ end_subject - current_subject < REQ_BYTE_MAX &&
+ (options & PCRE_PARTIAL) == 0)
+ {
+ register const uschar *p = current_subject + ((first_byte >= 0)? 1 : 0);
+
+ /* We don't need to repeat the search if we haven't yet reached the
+ place we found it at last time. */
+
+ if (p > req_byte_ptr)
+ {
+ if (req_byte_caseless)
+ {
+ while (p < end_subject)
+ {
+ register int pp = *p++;
+ if (pp == req_byte || pp == req_byte2) { p--; break; }
+ }
+ }
+ else
+ {
+ while (p < end_subject)
+ {
+ if (*p++ == req_byte) { p--; break; }
+ }
+ }
+
+ /* If we can't find the required character, break the matching loop,
+ which will cause a return or PCRE_ERROR_NOMATCH. */
+
+ if (p >= end_subject) break;
+
+ /* If we have found the required character, save the point where we
+ found it, so that we don't search again next time round the loop if
+ the start hasn't passed this character yet. */
+
+ req_byte_ptr = p;
+ }
+ }
+
+ /* OK, now we can do the business */
+
+ rc = internal_dfa_exec(
+ md, /* fixed match data */
+ md->start_code, /* this subexpression's code */
+ current_subject, /* where we currently are */
+ start_offset, /* start offset in subject */
+ offsets, /* offset vector */
+ offsetcount, /* size of same */
+ workspace, /* workspace vector */
+ wscount, /* size of same */
+ re->options & (PCRE_CASELESS|PCRE_MULTILINE|PCRE_DOTALL), /* ims flags */
+ 0, /* function recurse level */
+ 0); /* regex recurse level */
+
+ /* Anything other than "no match" means we are done, always; otherwise, carry
+ on only if not anchored. */
+
+ if (rc != PCRE_ERROR_NOMATCH || anchored) return rc;
+
+ /* Advance to the next subject character unless we are at the end of a line
+ and firstline is set. */
+
+ if (firstline && IS_NEWLINE(current_subject)) break;
+ current_subject++;
+ if (utf8)
+ {
+ while (current_subject < end_subject && (*current_subject & 0xc0) == 0x80)
+ current_subject++;
+ }
+ if (current_subject > end_subject) break;
+
+ /* If we have just passed a CR and we are now at a LF, and the pattern does
+ not contain any explicit matches for \r or \n, and the newline option is CRLF
+ or ANY or ANYCRLF, advance the match position by one more character. */
+
+ if (current_subject[-1] == '\r' &&
+ current_subject < end_subject &&
+ *current_subject == '\n' &&
+ (re->flags & PCRE_HASCRORLF) == 0 &&
+ (md->nltype == NLTYPE_ANY ||
+ md->nltype == NLTYPE_ANYCRLF ||
+ md->nllen == 2))
+ current_subject++;
+
+ } /* "Bumpalong" loop */
+
+return PCRE_ERROR_NOMATCH;
+}
+
+/* End of pcre_dfa_exec.c */
diff --git a/src/plugins/PCREPlugin/pcre_dftables.c b/src/plugins/PCREPlugin/pcre_dftables.c
new file mode 100644
index 0000000..ae3e3ef
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_dftables.c
@@ -0,0 +1,192 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* This file is automatically written by the dftables auxiliary
+program. If you edit it by hand, you might like to edit the Makefile to
+prevent its ever being regenerated.
+
+This file contains the default tables for characters with codes less than
+128 (ASCII characters). These tables are used when no external tables are
+passed to PCRE.
+
+The following #include is present because without it gcc 4.x may remove
+the array definition from the final binary if PCRE is built into a static
+library and dead code stripping is activated. This leads to link errors.
+Pulling in the header ensures that the array gets flagged as "someone
+outside this compilation unit might reference this" and so it will always
+be supplied to the linker. */
+
+#include "pcre_internal.h"
+
+const unsigned char _pcre_default_tables[] = {
+
+/* This table is a lower casing table. */
+
+ 0, 1, 2, 3, 4, 5, 6, 7,
+ 8, 9, 10, 11, 12, 13, 14, 15,
+ 16, 17, 18, 19, 20, 21, 22, 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,
+ 56, 57, 58, 59, 60, 61, 62, 63,
+ 64, 97, 98, 99,100,101,102,103,
+ 104,105,106,107,108,109,110,111,
+ 112,113,114,115,116,117,118,119,
+ 120,121,122, 91, 92, 93, 94, 95,
+ 96, 97, 98, 99,100,101,102,103,
+ 104,105,106,107,108,109,110,111,
+ 112,113,114,115,116,117,118,119,
+ 120,121,122,123,124,125,126,127,
+ 128,129,130,131,132,133,134,135,
+ 136,137,138,139,140,141,142,143,
+ 144,145,146,147,148,149,150,151,
+ 152,153,154,155,156,157,158,159,
+ 160,161,162,163,164,165,166,167,
+ 168,169,170,171,172,173,174,175,
+ 176,177,178,179,180,181,182,183,
+ 184,185,186,187,188,189,190,191,
+ 192,193,194,195,196,197,198,199,
+ 200,201,202,203,204,205,206,207,
+ 208,209,210,211,212,213,214,215,
+ 216,217,218,219,220,221,222,223,
+ 224,225,226,227,228,229,230,231,
+ 232,233,234,235,236,237,238,239,
+ 240,241,242,243,244,245,246,247,
+ 248,249,250,251,252,253,254,255,
+
+/* This table is a case flipping table. */
+
+ 0, 1, 2, 3, 4, 5, 6, 7,
+ 8, 9, 10, 11, 12, 13, 14, 15,
+ 16, 17, 18, 19, 20, 21, 22, 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,
+ 56, 57, 58, 59, 60, 61, 62, 63,
+ 64, 97, 98, 99,100,101,102,103,
+ 104,105,106,107,108,109,110,111,
+ 112,113,114,115,116,117,118,119,
+ 120,121,122, 91, 92, 93, 94, 95,
+ 96, 65, 66, 67, 68, 69, 70, 71,
+ 72, 73, 74, 75, 76, 77, 78, 79,
+ 80, 81, 82, 83, 84, 85, 86, 87,
+ 88, 89, 90,123,124,125,126,127,
+ 128,129,130,131,132,133,134,135,
+ 136,137,138,139,140,141,142,143,
+ 144,145,146,147,148,149,150,151,
+ 152,153,154,155,156,157,158,159,
+ 160,161,162,163,164,165,166,167,
+ 168,169,170,171,172,173,174,175,
+ 176,177,178,179,180,181,182,183,
+ 184,185,186,187,188,189,190,191,
+ 192,193,194,195,196,197,198,199,
+ 200,201,202,203,204,205,206,207,
+ 208,209,210,211,212,213,214,215,
+ 216,217,218,219,220,221,222,223,
+ 224,225,226,227,228,229,230,231,
+ 232,233,234,235,236,237,238,239,
+ 240,241,242,243,244,245,246,247,
+ 248,249,250,251,252,253,254,255,
+
+/* This table contains bit maps for various character classes.
+Each map is 32 bytes long and the bits run from the least
+significant end of each byte. The classes that have their own
+maps are: space, xdigit, digit, upper, lower, word, graph
+print, punct, and cntrl. Other classes are built from combinations. */
+
+ 0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03,
+ 0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03,
+ 0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff,
+ 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff,
+ 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc,
+ 0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+ 0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
+
+/* This table identifies various classes of character by individual bits:
+ 0x01 white space character
+ 0x02 letter
+ 0x04 decimal digit
+ 0x08 hexadecimal digit
+ 0x10 alphanumeric or '_'
+ 0x80 regular expression metacharacter or binary zero
+*/
+
+ 0x80,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */
+ 0x00,0x01,0x01,0x00,0x01,0x01,0x00,0x00, /* 8- 15 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */
+ 0x01,0x00,0x00,0x00,0x80,0x00,0x00,0x00, /* - ' */
+ 0x80,0x80,0x80,0x80,0x00,0x00,0x80,0x00, /* ( - / */
+ 0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c, /* 0 - 7 */
+ 0x1c,0x1c,0x00,0x00,0x00,0x00,0x00,0x80, /* 8 - ? */
+ 0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* @ - G */
+ 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* H - O */
+ 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* P - W */
+ 0x12,0x12,0x12,0x80,0x80,0x00,0x80,0x10, /* X - _ */
+ 0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* ` - g */
+ 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* h - o */
+ 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* p - w */
+ 0x12,0x12,0x12,0x80,0x80,0x00,0x00,0x00, /* x -127 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */
+ 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */
+
+/* End of chartables.c */
diff --git a/src/plugins/PCREPlugin/pcre_exec.c b/src/plugins/PCREPlugin/pcre_exec.c
new file mode 100644
index 0000000..6db7c35
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_exec.c
@@ -0,0 +1,4938 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains pcre_exec(), the externally visible function that does
+pattern matching using an NFA algorithm, trying to mimic Perl as closely as
+possible. There are also some static supporting functions. */
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#define NLBLOCK md /* Block containing newline information */
+#define PSSTART start_subject /* Field containing processed string start */
+#define PSEND end_subject /* Field containing processed string end */
+
+#include "pcre_internal.h"
+
+/* Undefine some potentially clashing cpp symbols */
+
+#undef min
+#undef max
+
+/* Flag bits for the match() function */
+
+#define match_condassert 0x01 /* Called to check a condition assertion */
+#define match_cbegroup 0x02 /* Could-be-empty unlimited repeat group */
+
+/* Non-error returns from the match() function. Error returns are externally
+defined PCRE_ERROR_xxx codes, which are all negative. */
+
+#define MATCH_MATCH 1
+#define MATCH_NOMATCH 0
+
+/* Special internal returns from the match() function. Make them sufficiently
+negative to avoid the external error codes. */
+
+#define MATCH_COMMIT (-999)
+#define MATCH_PRUNE (-998)
+#define MATCH_SKIP (-997)
+#define MATCH_THEN (-996)
+
+/* Maximum number of ints of offset to save on the stack for recursive calls.
+If the offset vector is bigger, malloc is used. This should be a multiple of 3,
+because the offset vector is always a multiple of 3 long. */
+
+#define REC_STACK_SAVE_MAX 30
+
+/* Min and max values for the common repeats; for the maxima, 0 => infinity */
+
+static const char rep_min[] = { 0, 0, 1, 1, 0, 0 };
+static const char rep_max[] = { 0, 0, 0, 0, 1, 1 };
+
+
+
+#ifdef DEBUG
+/*************************************************
+* Debugging function to print chars *
+*************************************************/
+
+/* Print a sequence of chars in printable format, stopping at the end of the
+subject if the requested.
+
+Arguments:
+ p points to characters
+ length number to print
+ is_subject TRUE if printing from within md->start_subject
+ md pointer to matching data block, if is_subject is TRUE
+
+Returns: nothing
+*/
+
+static void
+pchars(const uschar *p, int length, BOOL is_subject, match_data *md)
+{
+unsigned int c;
+if (is_subject && length > md->end_subject - p) length = md->end_subject - p;
+while (length-- > 0)
+ if (isprint(c = *(p++))) printf("%c", c); else printf("\\x%02x", c);
+}
+#endif
+
+
+
+/*************************************************
+* Match a back-reference *
+*************************************************/
+
+/* If a back reference hasn't been set, the length that is passed is greater
+than the number of characters left in the string, so the match fails.
+
+Arguments:
+ offset index into the offset vector
+ eptr points into the subject
+ length length to be matched
+ md points to match data block
+ ims the ims flags
+
+Returns: TRUE if matched
+*/
+
+static BOOL
+match_ref(int offset, register USPTR eptr, int length, match_data *md,
+ unsigned long int ims)
+{
+USPTR p = md->start_subject + md->offset_vector[offset];
+
+#ifdef DEBUG
+if (eptr >= md->end_subject)
+ printf("matching subject ");
+else
+ {
+ printf("matching subject ");
+ pchars(eptr, length, TRUE, md);
+ }
+printf(" against backref ");
+pchars(p, length, FALSE, md);
+printf("\n");
+#endif
+
+/* Always fail if not enough characters left */
+
+if (length > md->end_subject - eptr) return FALSE;
+
+/* Separate the caselesss case for speed */
+
+if ((ims & PCRE_CASELESS) != 0)
+ {
+ while (length-- > 0)
+ if (md->lcc[*p++] != md->lcc[*eptr++]) return FALSE;
+ }
+else
+ { while (length-- > 0) if (*p++ != *eptr++) return FALSE; }
+
+return TRUE;
+}
+
+
+
+/***************************************************************************
+****************************************************************************
+ RECURSION IN THE match() FUNCTION
+
+The match() function is highly recursive, though not every recursive call
+increases the recursive depth. Nevertheless, some regular expressions can cause
+it to recurse to a great depth. I was writing for Unix, so I just let it call
+itself recursively. This uses the stack for saving everything that has to be
+saved for a recursive call. On Unix, the stack can be large, and this works
+fine.
+
+It turns out that on some non-Unix-like systems there are problems with
+programs that use a lot of stack. (This despite the fact that every last chip
+has oodles of memory these days, and techniques for extending the stack have
+been known for decades.) So....
+
+There is a fudge, triggered by defining NO_RECURSE, which avoids recursive
+calls by keeping local variables that need to be preserved in blocks of memory
+obtained from malloc() instead instead of on the stack. Macros are used to
+achieve this so that the actual code doesn't look very different to what it
+always used to.
+
+The original heap-recursive code used longjmp(). However, it seems that this
+can be very slow on some operating systems. Following a suggestion from Stan
+Switzer, the use of longjmp() has been abolished, at the cost of having to
+provide a unique number for each call to RMATCH. There is no way of generating
+a sequence of numbers at compile time in C. I have given them names, to make
+them stand out more clearly.
+
+Crude tests on x86 Linux show a small speedup of around 5-8%. However, on
+FreeBSD, avoiding longjmp() more than halves the time taken to run the standard
+tests. Furthermore, not using longjmp() means that local dynamic variables
+don't have indeterminate values; this has meant that the frame size can be
+reduced because the result can be "passed back" by straight setting of the
+variable instead of being passed in the frame.
+****************************************************************************
+***************************************************************************/
+
+/* Numbers for RMATCH calls. When this list is changed, the code at HEAP_RETURN
+below must be updated in sync. */
+
+enum { RM1=1, RM2, RM3, RM4, RM5, RM6, RM7, RM8, RM9, RM10,
+ RM11, RM12, RM13, RM14, RM15, RM16, RM17, RM18, RM19, RM20,
+ RM21, RM22, RM23, RM24, RM25, RM26, RM27, RM28, RM29, RM30,
+ RM31, RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40,
+ RM41, RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50,
+ RM51, RM52, RM53, RM54 };
+
+/* These versions of the macros use the stack, as normal. There are debugging
+versions and production versions. Note that the "rw" argument of RMATCH isn't
+actuall used in this definition. */
+
+#ifndef NO_RECURSE
+#define REGISTER register
+
+#ifdef DEBUG
+#define RMATCH(ra,rb,rc,rd,re,rf,rg,rw) \
+ { \
+ printf("match() called in line %d\n", __LINE__); \
+ rrc = match(ra,rb,mstart,rc,rd,re,rf,rg,rdepth+1); \
+ printf("to line %d\n", __LINE__); \
+ }
+#define RRETURN(ra) \
+ { \
+ printf("match() returned %d from line %d ", ra, __LINE__); \
+ return ra; \
+ }
+#else
+#define RMATCH(ra,rb,rc,rd,re,rf,rg,rw) \
+ rrc = match(ra,rb,mstart,rc,rd,re,rf,rg,rdepth+1)
+#define RRETURN(ra) return ra
+#endif
+
+#else
+
+
+/* These versions of the macros manage a private stack on the heap. Note that
+the "rd" argument of RMATCH isn't actually used in this definition. It's the md
+argument of match(), which never changes. */
+
+#define REGISTER
+
+#define RMATCH(ra,rb,rc,rd,re,rf,rg,rw)\
+ {\
+ heapframe *newframe = (pcre_stack_malloc)(sizeof(heapframe));\
+ frame->Xwhere = rw; \
+ newframe->Xeptr = ra;\
+ newframe->Xecode = rb;\
+ newframe->Xmstart = mstart;\
+ newframe->Xoffset_top = rc;\
+ newframe->Xims = re;\
+ newframe->Xeptrb = rf;\
+ newframe->Xflags = rg;\
+ newframe->Xrdepth = frame->Xrdepth + 1;\
+ newframe->Xprevframe = frame;\
+ frame = newframe;\
+ DPRINTF(("restarting from line %d\n", __LINE__));\
+ goto HEAP_RECURSE;\
+ L_##rw:\
+ DPRINTF(("jumped back to line %d\n", __LINE__));\
+ }
+
+#define RRETURN(ra)\
+ {\
+ heapframe *newframe = frame;\
+ frame = newframe->Xprevframe;\
+ (pcre_stack_free)(newframe);\
+ if (frame != NULL)\
+ {\
+ rrc = ra;\
+ goto HEAP_RETURN;\
+ }\
+ return ra;\
+ }
+
+
+/* Structure for remembering the local variables in a private frame */
+
+typedef struct heapframe {
+ struct heapframe *Xprevframe;
+
+ /* Function arguments that may change */
+
+ const uschar *Xeptr;
+ const uschar *Xecode;
+ const uschar *Xmstart;
+ int Xoffset_top;
+ long int Xims;
+ eptrblock *Xeptrb;
+ int Xflags;
+ unsigned int Xrdepth;
+
+ /* Function local variables */
+
+ const uschar *Xcallpat;
+ const uschar *Xcharptr;
+ const uschar *Xdata;
+ const uschar *Xnext;
+ const uschar *Xpp;
+ const uschar *Xprev;
+ const uschar *Xsaved_eptr;
+
+ recursion_info Xnew_recursive;
+
+ BOOL Xcur_is_word;
+ BOOL Xcondition;
+ BOOL Xprev_is_word;
+
+ unsigned long int Xoriginal_ims;
+
+#ifdef SUPPORT_UCP
+ int Xprop_type;
+ int Xprop_value;
+ int Xprop_fail_result;
+ int Xprop_category;
+ int Xprop_chartype;
+ int Xprop_script;
+ int Xoclength;
+ uschar Xocchars[8];
+#endif
+
+ int Xctype;
+ unsigned int Xfc;
+ int Xfi;
+ int Xlength;
+ int Xmax;
+ int Xmin;
+ int Xnumber;
+ int Xoffset;
+ int Xop;
+ int Xsave_capture_last;
+ int Xsave_offset1, Xsave_offset2, Xsave_offset3;
+ int Xstacksave[REC_STACK_SAVE_MAX];
+
+ eptrblock Xnewptrb;
+
+ /* Where to jump back to */
+
+ int Xwhere;
+
+} heapframe;
+
+#endif
+
+
+/***************************************************************************
+***************************************************************************/
+
+
+
+/*************************************************
+* Match from current position *
+*************************************************/
+
+/* This function is called recursively in many circumstances. Whenever it
+returns a negative (error) response, the outer incarnation must also return the
+same response.
+
+Performance note: It might be tempting to extract commonly used fields from the
+md structure (e.g. utf8, end_subject) into individual variables to improve
+performance. Tests using gcc on a SPARC disproved this; in the first case, it
+made performance worse.
+
+Arguments:
+ eptr pointer to current character in subject
+ ecode pointer to current position in compiled code
+ mstart pointer to the current match start position (can be modified
+ by encountering \K)
+ offset_top current top pointer
+ md pointer to "static" info for the match
+ ims current /i, /m, and /s options
+ eptrb pointer to chain of blocks containing eptr at start of
+ brackets - for testing for empty matches
+ flags can contain
+ match_condassert - this is an assertion condition
+ match_cbegroup - this is the start of an unlimited repeat
+ group that can match an empty string
+ rdepth the recursion depth
+
+Returns: MATCH_MATCH if matched ) these values are >= 0
+ MATCH_NOMATCH if failed to match )
+ a negative PCRE_ERROR_xxx value if aborted by an error condition
+ (e.g. stopped by repeated call or recursion limit)
+*/
+
+static int
+match(REGISTER USPTR eptr, REGISTER const uschar *ecode, const uschar *mstart,
+ int offset_top, match_data *md, unsigned long int ims, eptrblock *eptrb,
+ int flags, unsigned int rdepth)
+{
+/* These variables do not need to be preserved over recursion in this function,
+so they can be ordinary variables in all cases. Mark some of them with
+"register" because they are used a lot in loops. */
+
+register int rrc; /* Returns from recursive calls */
+register int i; /* Used for loops not involving calls to RMATCH() */
+register unsigned int c; /* Character values not kept over RMATCH() calls */
+register BOOL utf8; /* Local copy of UTF-8 flag for speed */
+
+BOOL minimize, possessive; /* Quantifier options */
+
+/* When recursion is not being used, all "local" variables that have to be
+preserved over calls to RMATCH() are part of a "frame" which is obtained from
+heap storage. Set up the top-level frame here; others are obtained from the
+heap whenever RMATCH() does a "recursion". See the macro definitions above. */
+
+#ifdef NO_RECURSE
+heapframe *frame = (pcre_stack_malloc)(sizeof(heapframe));
+frame->Xprevframe = NULL; /* Marks the top level */
+
+/* Copy in the original argument variables */
+
+frame->Xeptr = eptr;
+frame->Xecode = ecode;
+frame->Xmstart = mstart;
+frame->Xoffset_top = offset_top;
+frame->Xims = ims;
+frame->Xeptrb = eptrb;
+frame->Xflags = flags;
+frame->Xrdepth = rdepth;
+
+/* This is where control jumps back to to effect "recursion" */
+
+HEAP_RECURSE:
+
+/* Macros make the argument variables come from the current frame */
+
+#define eptr frame->Xeptr
+#define ecode frame->Xecode
+#define mstart frame->Xmstart
+#define offset_top frame->Xoffset_top
+#define ims frame->Xims
+#define eptrb frame->Xeptrb
+#define flags frame->Xflags
+#define rdepth frame->Xrdepth
+
+/* Ditto for the local variables */
+
+#ifdef SUPPORT_UTF8
+#define charptr frame->Xcharptr
+#endif
+#define callpat frame->Xcallpat
+#define data frame->Xdata
+#define next frame->Xnext
+#define pp frame->Xpp
+#define prev frame->Xprev
+#define saved_eptr frame->Xsaved_eptr
+
+#define new_recursive frame->Xnew_recursive
+
+#define cur_is_word frame->Xcur_is_word
+#define condition frame->Xcondition
+#define prev_is_word frame->Xprev_is_word
+
+#define original_ims frame->Xoriginal_ims
+
+#ifdef SUPPORT_UCP
+#define prop_type frame->Xprop_type
+#define prop_value frame->Xprop_value
+#define prop_fail_result frame->Xprop_fail_result
+#define prop_category frame->Xprop_category
+#define prop_chartype frame->Xprop_chartype
+#define prop_script frame->Xprop_script
+#define oclength frame->Xoclength
+#define occhars frame->Xocchars
+#endif
+
+#define ctype frame->Xctype
+#define fc frame->Xfc
+#define fi frame->Xfi
+#define length frame->Xlength
+#define max frame->Xmax
+#define min frame->Xmin
+#define number frame->Xnumber
+#define offset frame->Xoffset
+#define op frame->Xop
+#define save_capture_last frame->Xsave_capture_last
+#define save_offset1 frame->Xsave_offset1
+#define save_offset2 frame->Xsave_offset2
+#define save_offset3 frame->Xsave_offset3
+#define stacksave frame->Xstacksave
+
+#define newptrb frame->Xnewptrb
+
+/* When recursion is being used, local variables are allocated on the stack and
+get preserved during recursion in the normal way. In this environment, fi and
+i, and fc and c, can be the same variables. */
+
+#else /* NO_RECURSE not defined */
+#define fi i
+#define fc c
+
+
+#ifdef SUPPORT_UTF8 /* Many of these variables are used only */
+const uschar *charptr; /* in small blocks of the code. My normal */
+#endif /* style of coding would have declared */
+const uschar *callpat; /* them within each of those blocks. */
+const uschar *data; /* However, in order to accommodate the */
+const uschar *next; /* version of this code that uses an */
+USPTR pp; /* external "stack" implemented on the */
+const uschar *prev; /* heap, it is easier to declare them all */
+USPTR saved_eptr; /* here, so the declarations can be cut */
+ /* out in a block. The only declarations */
+recursion_info new_recursive; /* within blocks below are for variables */
+ /* that do not have to be preserved over */
+BOOL cur_is_word; /* a recursive call to RMATCH(). */
+BOOL condition;
+BOOL prev_is_word;
+
+unsigned long int original_ims;
+
+#ifdef SUPPORT_UCP
+int prop_type;
+int prop_value;
+int prop_fail_result;
+int prop_category;
+int prop_chartype;
+int prop_script;
+int oclength;
+uschar occhars[8];
+#endif
+
+int ctype;
+int length;
+int max;
+int min;
+int number;
+int offset;
+int op;
+int save_capture_last;
+int save_offset1, save_offset2, save_offset3;
+int stacksave[REC_STACK_SAVE_MAX];
+
+eptrblock newptrb;
+#endif /* NO_RECURSE */
+
+/* These statements are here to stop the compiler complaining about unitialized
+variables. */
+
+#ifdef SUPPORT_UCP
+prop_value = 0;
+prop_fail_result = 0;
+#endif
+
+
+/* This label is used for tail recursion, which is used in a few cases even
+when NO_RECURSE is not defined, in order to reduce the amount of stack that is
+used. Thanks to Ian Taylor for noticing this possibility and sending the
+original patch. */
+
+TAIL_RECURSE:
+
+/* OK, now we can get on with the real code of the function. Recursive calls
+are specified by the macro RMATCH and RRETURN is used to return. When
+NO_RECURSE is *not* defined, these just turn into a recursive call to match()
+and a "return", respectively (possibly with some debugging if DEBUG is
+defined). However, RMATCH isn't like a function call because it's quite a
+complicated macro. It has to be used in one particular way. This shouldn't,
+however, impact performance when true recursion is being used. */
+
+#ifdef SUPPORT_UTF8
+utf8 = md->utf8; /* Local copy of the flag */
+#else
+utf8 = FALSE;
+#endif
+
+/* First check that we haven't called match() too many times, or that we
+haven't exceeded the recursive call limit. */
+
+if (md->match_call_count++ >= md->match_limit) RRETURN(PCRE_ERROR_MATCHLIMIT);
+if (rdepth >= md->match_limit_recursion) RRETURN(PCRE_ERROR_RECURSIONLIMIT);
+
+original_ims = ims; /* Save for resetting on ')' */
+
+/* At the start of a group with an unlimited repeat that may match an empty
+string, the match_cbegroup flag is set. When this is the case, add the current
+subject pointer to the chain of such remembered pointers, to be checked when we
+hit the closing ket, in order to break infinite loops that match no characters.
+When match() is called in other circumstances, don't add to the chain. The
+match_cbegroup flag must NOT be used with tail recursion, because the memory
+block that is used is on the stack, so a new one may be required for each
+match(). */
+
+if ((flags & match_cbegroup) != 0)
+ {
+ newptrb.epb_saved_eptr = eptr;
+ newptrb.epb_prev = eptrb;
+ eptrb = &newptrb;
+ }
+
+/* Now start processing the opcodes. */
+
+for (;;)
+ {
+ minimize = possessive = FALSE;
+ op = *ecode;
+
+ /* For partial matching, remember if we ever hit the end of the subject after
+ matching at least one subject character. */
+
+ if (md->partial &&
+ eptr >= md->end_subject &&
+ eptr > mstart)
+ md->hitend = TRUE;
+
+ switch(op)
+ {
+ case OP_FAIL:
+ RRETURN(MATCH_NOMATCH);
+
+ case OP_PRUNE:
+ RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
+ ims, eptrb, flags, RM51);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ RRETURN(MATCH_PRUNE);
+
+ case OP_COMMIT:
+ RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
+ ims, eptrb, flags, RM52);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ RRETURN(MATCH_COMMIT);
+
+ case OP_SKIP:
+ RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
+ ims, eptrb, flags, RM53);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ md->start_match_ptr = eptr; /* Pass back current position */
+ RRETURN(MATCH_SKIP);
+
+ case OP_THEN:
+ RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
+ ims, eptrb, flags, RM54);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ RRETURN(MATCH_THEN);
+
+ /* Handle a capturing bracket. If there is space in the offset vector, save
+ the current subject position in the working slot at the top of the vector.
+ We mustn't change the current values of the data slot, because they may be
+ set from a previous iteration of this group, and be referred to by a
+ reference inside the group.
+
+ If the bracket fails to match, we need to restore this value and also the
+ values of the final offsets, in case they were set by a previous iteration
+ of the same bracket.
+
+ If there isn't enough space in the offset vector, treat this as if it were
+ a non-capturing bracket. Don't worry about setting the flag for the error
+ case here; that is handled in the code for KET. */
+
+ case OP_CBRA:
+ case OP_SCBRA:
+ number = GET2(ecode, 1+LINK_SIZE);
+ offset = number << 1;
+
+#ifdef DEBUG
+ printf("start bracket %d\n", number);
+ printf("subject=");
+ pchars(eptr, 16, TRUE, md);
+ printf("\n");
+#endif
+
+ if (offset < md->offset_max)
+ {
+ save_offset1 = md->offset_vector[offset];
+ save_offset2 = md->offset_vector[offset+1];
+ save_offset3 = md->offset_vector[md->offset_end - number];
+ save_capture_last = md->capture_last;
+
+ DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));
+ md->offset_vector[md->offset_end - number] = eptr - md->start_subject;
+
+ flags = (op == OP_SCBRA)? match_cbegroup : 0;
+ do
+ {
+ RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
+ ims, eptrb, flags, RM1);
+ if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
+ md->capture_last = save_capture_last;
+ ecode += GET(ecode, 1);
+ }
+ while (*ecode == OP_ALT);
+
+ DPRINTF(("bracket %d failed\n", number));
+
+ md->offset_vector[offset] = save_offset1;
+ md->offset_vector[offset+1] = save_offset2;
+ md->offset_vector[md->offset_end - number] = save_offset3;
+
+ RRETURN(MATCH_NOMATCH);
+ }
+
+ /* FALL THROUGH ... Insufficient room for saving captured contents. Treat
+ as a non-capturing bracket. */
+
+ /* VVVVVVVVVVVVVVVVVVVVVVVVV */
+ /* VVVVVVVVVVVVVVVVVVVVVVVVV */
+
+ DPRINTF(("insufficient capture room: treat as non-capturing\n"));
+
+ /* VVVVVVVVVVVVVVVVVVVVVVVVV */
+ /* VVVVVVVVVVVVVVVVVVVVVVVVV */
+
+ /* Non-capturing bracket. Loop for all the alternatives. When we get to the
+ final alternative within the brackets, we would return the result of a
+ recursive call to match() whatever happened. We can reduce stack usage by
+ turning this into a tail recursion, except in the case when match_cbegroup
+ is set.*/
+
+ case OP_BRA:
+ case OP_SBRA:
+ DPRINTF(("start non-capturing bracket\n"));
+ flags = (op >= OP_SBRA)? match_cbegroup : 0;
+ for (;;)
+ {
+ if (ecode[GET(ecode, 1)] != OP_ALT) /* Final alternative */
+ {
+ if (flags == 0) /* Not a possibly empty group */
+ {
+ ecode += _pcre_OP_lengths[*ecode];
+ DPRINTF(("bracket 0 tail recursion\n"));
+ goto TAIL_RECURSE;
+ }
+
+ /* Possibly empty group; can't use tail recursion. */
+
+ RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, ims,
+ eptrb, flags, RM48);
+ RRETURN(rrc);
+ }
+
+ /* For non-final alternatives, continue the loop for a NOMATCH result;
+ otherwise return. */
+
+ RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, ims,
+ eptrb, flags, RM2);
+ if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
+ ecode += GET(ecode, 1);
+ }
+ /* Control never reaches here. */
+
+ /* Conditional group: compilation checked that there are no more than
+ two branches. If the condition is false, skipping the first branch takes us
+ past the end if there is only one branch, but that's OK because that is
+ exactly what going to the ket would do. As there is only one branch to be
+ obeyed, we can use tail recursion to avoid using another stack frame. */
+
+ case OP_COND:
+ case OP_SCOND:
+ if (ecode[LINK_SIZE+1] == OP_RREF) /* Recursion test */
+ {
+ offset = GET2(ecode, LINK_SIZE + 2); /* Recursion group number*/
+ condition = md->recursive != NULL &&
+ (offset == RREF_ANY || offset == md->recursive->group_num);
+ ecode += condition? 3 : GET(ecode, 1);
+ }
+
+ else if (ecode[LINK_SIZE+1] == OP_CREF) /* Group used test */
+ {
+ offset = GET2(ecode, LINK_SIZE+2) << 1; /* Doubled ref number */
+ condition = offset < offset_top && md->offset_vector[offset] >= 0;
+ ecode += condition? 3 : GET(ecode, 1);
+ }
+
+ else if (ecode[LINK_SIZE+1] == OP_DEF) /* DEFINE - always false */
+ {
+ condition = FALSE;
+ ecode += GET(ecode, 1);
+ }
+
+ /* The condition is an assertion. Call match() to evaluate it - setting
+ the final argument match_condassert causes it to stop at the end of an
+ assertion. */
+
+ else
+ {
+ RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL,
+ match_condassert, RM3);
+ if (rrc == MATCH_MATCH)
+ {
+ condition = TRUE;
+ ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2);
+ while (*ecode == OP_ALT) ecode += GET(ecode, 1);
+ }
+ else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN)
+ {
+ RRETURN(rrc); /* Need braces because of following else */
+ }
+ else
+ {
+ condition = FALSE;
+ ecode += GET(ecode, 1);
+ }
+ }
+
+ /* We are now at the branch that is to be obeyed. As there is only one,
+ we can use tail recursion to avoid using another stack frame, except when
+ match_cbegroup is required for an unlimited repeat of a possibly empty
+ group. If the second alternative doesn't exist, we can just plough on. */
+
+ if (condition || *ecode == OP_ALT)
+ {
+ ecode += 1 + LINK_SIZE;
+ if (op == OP_SCOND) /* Possibly empty group */
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, match_cbegroup, RM49);
+ RRETURN(rrc);
+ }
+ else /* Group must match something */
+ {
+ flags = 0;
+ goto TAIL_RECURSE;
+ }
+ }
+ else /* Condition false & no 2nd alternative */
+ {
+ ecode += 1 + LINK_SIZE;
+ }
+ break;
+
+
+ /* End of the pattern, either real or forced. If we are in a top-level
+ recursion, we should restore the offsets appropriately and continue from
+ after the call. */
+
+ case OP_ACCEPT:
+ case OP_END:
+ if (md->recursive != NULL && md->recursive->group_num == 0)
+ {
+ recursion_info *rec = md->recursive;
+ DPRINTF(("End of pattern in a (?0) recursion\n"));
+ md->recursive = rec->prevrec;
+ memmove(md->offset_vector, rec->offset_save,
+ rec->saved_max * sizeof(int));
+ mstart = rec->save_start;
+ ims = original_ims;
+ ecode = rec->after_call;
+ break;
+ }
+
+ /* Otherwise, if PCRE_NOTEMPTY is set, fail if we have matched an empty
+ string - backtracking will then try other alternatives, if any. */
+
+ if (md->notempty && eptr == mstart) RRETURN(MATCH_NOMATCH);
+ md->end_match_ptr = eptr; /* Record where we ended */
+ md->end_offset_top = offset_top; /* and how many extracts were taken */
+ md->start_match_ptr = mstart; /* and the start (\K can modify) */
+ RRETURN(MATCH_MATCH);
+
+ /* Change option settings */
+
+ case OP_OPT:
+ ims = ecode[1];
+ ecode += 2;
+ DPRINTF(("ims set to %02lx\n", ims));
+ break;
+
+ /* Assertion brackets. Check the alternative branches in turn - the
+ matching won't pass the KET for an assertion. If any one branch matches,
+ the assertion is true. Lookbehind assertions have an OP_REVERSE item at the
+ start of each branch to move the current point backwards, so the code at
+ this level is identical to the lookahead case. */
+
+ case OP_ASSERT:
+ case OP_ASSERTBACK:
+ do
+ {
+ RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0,
+ RM4);
+ if (rrc == MATCH_MATCH) break;
+ if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
+ ecode += GET(ecode, 1);
+ }
+ while (*ecode == OP_ALT);
+ if (*ecode == OP_KET) RRETURN(MATCH_NOMATCH);
+
+ /* If checking an assertion for a condition, return MATCH_MATCH. */
+
+ if ((flags & match_condassert) != 0) RRETURN(MATCH_MATCH);
+
+ /* Continue from after the assertion, updating the offsets high water
+ mark, since extracts may have been taken during the assertion. */
+
+ do ecode += GET(ecode,1); while (*ecode == OP_ALT);
+ ecode += 1 + LINK_SIZE;
+ offset_top = md->end_offset_top;
+ continue;
+
+ /* Negative assertion: all branches must fail to match */
+
+ case OP_ASSERT_NOT:
+ case OP_ASSERTBACK_NOT:
+ do
+ {
+ RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0,
+ RM5);
+ if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH);
+ if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
+ ecode += GET(ecode,1);
+ }
+ while (*ecode == OP_ALT);
+
+ if ((flags & match_condassert) != 0) RRETURN(MATCH_MATCH);
+
+ ecode += 1 + LINK_SIZE;
+ continue;
+
+ /* Move the subject pointer back. This occurs only at the start of
+ each branch of a lookbehind assertion. If we are too close to the start to
+ move back, this match function fails. When working with UTF-8 we move
+ back a number of characters, not bytes. */
+
+ case OP_REVERSE:
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ i = GET(ecode, 1);
+ while (i-- > 0)
+ {
+ eptr--;
+ if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH);
+ BACKCHAR(eptr);
+ }
+ }
+ else
+#endif
+
+ /* No UTF-8 support, or not in UTF-8 mode: count is byte count */
+
+ {
+ eptr -= GET(ecode, 1);
+ if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH);
+ }
+
+ /* Skip to next op code */
+
+ ecode += 1 + LINK_SIZE;
+ break;
+
+ /* The callout item calls an external function, if one is provided, passing
+ details of the match so far. This is mainly for debugging, though the
+ function is able to force a failure. */
+
+ case OP_CALLOUT:
+ if (pcre_callout != NULL)
+ {
+ pcre_callout_block cb;
+ cb.version = 1; /* Version 1 of the callout block */
+ cb.callout_number = ecode[1];
+ cb.offset_vector = md->offset_vector;
+ cb.subject = (PCRE_SPTR)md->start_subject;
+ cb.subject_length = md->end_subject - md->start_subject;
+ cb.start_match = mstart - md->start_subject;
+ cb.current_position = eptr - md->start_subject;
+ cb.pattern_position = GET(ecode, 2);
+ cb.next_item_length = GET(ecode, 2 + LINK_SIZE);
+ cb.capture_top = offset_top/2;
+ cb.capture_last = md->capture_last;
+ cb.callout_data = md->callout_data;
+ if ((rrc = (*pcre_callout)(&cb)) > 0) RRETURN(MATCH_NOMATCH);
+ if (rrc < 0) RRETURN(rrc);
+ }
+ ecode += 2 + 2*LINK_SIZE;
+ break;
+
+ /* Recursion either matches the current regex, or some subexpression. The
+ offset data is the offset to the starting bracket from the start of the
+ whole pattern. (This is so that it works from duplicated subpatterns.)
+
+ If there are any capturing brackets started but not finished, we have to
+ save their starting points and reinstate them after the recursion. However,
+ we don't know how many such there are (offset_top records the completed
+ total) so we just have to save all the potential data. There may be up to
+ 65535 such values, which is too large to put on the stack, but using malloc
+ for small numbers seems expensive. As a compromise, the stack is used when
+ there are no more than REC_STACK_SAVE_MAX values to store; otherwise malloc
+ is used. A problem is what to do if the malloc fails ... there is no way of
+ returning to the top level with an error. Save the top REC_STACK_SAVE_MAX
+ values on the stack, and accept that the rest may be wrong.
+
+ There are also other values that have to be saved. We use a chained
+ sequence of blocks that actually live on the stack. Thanks to Robin Houston
+ for the original version of this logic. */
+
+ case OP_RECURSE:
+ {
+ callpat = md->start_code + GET(ecode, 1);
+ new_recursive.group_num = (callpat == md->start_code)? 0 :
+ GET2(callpat, 1 + LINK_SIZE);
+
+ /* Add to "recursing stack" */
+
+ new_recursive.prevrec = md->recursive;
+ md->recursive = &new_recursive;
+
+ /* Find where to continue from afterwards */
+
+ ecode += 1 + LINK_SIZE;
+ new_recursive.after_call = ecode;
+
+ /* Now save the offset data. */
+
+ new_recursive.saved_max = md->offset_end;
+ if (new_recursive.saved_max <= REC_STACK_SAVE_MAX)
+ new_recursive.offset_save = stacksave;
+ else
+ {
+ new_recursive.offset_save =
+ (int *)(pcre_malloc)(new_recursive.saved_max * sizeof(int));
+ if (new_recursive.offset_save == NULL) RRETURN(PCRE_ERROR_NOMEMORY);
+ }
+
+ memcpy(new_recursive.offset_save, md->offset_vector,
+ new_recursive.saved_max * sizeof(int));
+ new_recursive.save_start = mstart;
+ mstart = eptr;
+
+ /* OK, now we can do the recursion. For each top-level alternative we
+ restore the offset and recursion data. */
+
+ DPRINTF(("Recursing into group %d\n", new_recursive.group_num));
+ flags = (*callpat >= OP_SBRA)? match_cbegroup : 0;
+ do
+ {
+ RMATCH(eptr, callpat + _pcre_OP_lengths[*callpat], offset_top,
+ md, ims, eptrb, flags, RM6);
+ if (rrc == MATCH_MATCH)
+ {
+ DPRINTF(("Recursion matched\n"));
+ md->recursive = new_recursive.prevrec;
+ if (new_recursive.offset_save != stacksave)
+ (pcre_free)(new_recursive.offset_save);
+ RRETURN(MATCH_MATCH);
+ }
+ else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN)
+ {
+ DPRINTF(("Recursion gave error %d\n", rrc));
+ RRETURN(rrc);
+ }
+
+ md->recursive = &new_recursive;
+ memcpy(md->offset_vector, new_recursive.offset_save,
+ new_recursive.saved_max * sizeof(int));
+ callpat += GET(callpat, 1);
+ }
+ while (*callpat == OP_ALT);
+
+ DPRINTF(("Recursion didn't match\n"));
+ md->recursive = new_recursive.prevrec;
+ if (new_recursive.offset_save != stacksave)
+ (pcre_free)(new_recursive.offset_save);
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never reaches here */
+
+ /* "Once" brackets are like assertion brackets except that after a match,
+ the point in the subject string is not moved back. Thus there can never be
+ a move back into the brackets. Friedl calls these "atomic" subpatterns.
+ Check the alternative branches in turn - the matching won't pass the KET
+ for this kind of subpattern. If any one branch matches, we carry on as at
+ the end of a normal bracket, leaving the subject pointer. */
+
+ case OP_ONCE:
+ prev = ecode;
+ saved_eptr = eptr;
+
+ do
+ {
+ RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM7);
+ if (rrc == MATCH_MATCH) break;
+ if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
+ ecode += GET(ecode,1);
+ }
+ while (*ecode == OP_ALT);
+
+ /* If hit the end of the group (which could be repeated), fail */
+
+ if (*ecode != OP_ONCE && *ecode != OP_ALT) RRETURN(MATCH_NOMATCH);
+
+ /* Continue as from after the assertion, updating the offsets high water
+ mark, since extracts may have been taken. */
+
+ do ecode += GET(ecode, 1); while (*ecode == OP_ALT);
+
+ offset_top = md->end_offset_top;
+ eptr = md->end_match_ptr;
+
+ /* For a non-repeating ket, just continue at this level. This also
+ happens for a repeating ket if no characters were matched in the group.
+ This is the forcible breaking of infinite loops as implemented in Perl
+ 5.005. If there is an options reset, it will get obeyed in the normal
+ course of events. */
+
+ if (*ecode == OP_KET || eptr == saved_eptr)
+ {
+ ecode += 1+LINK_SIZE;
+ break;
+ }
+
+ /* The repeating kets try the rest of the pattern or restart from the
+ preceding bracket, in the appropriate order. The second "call" of match()
+ uses tail recursion, to avoid using another stack frame. We need to reset
+ any options that changed within the bracket before re-running it, so
+ check the next opcode. */
+
+ if (ecode[1+LINK_SIZE] == OP_OPT)
+ {
+ ims = (ims & ~PCRE_IMS) | ecode[4];
+ DPRINTF(("ims set to %02lx at group repeat\n", ims));
+ }
+
+ if (*ecode == OP_KETRMIN)
+ {
+ RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM8);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ ecode = prev;
+ flags = 0;
+ goto TAIL_RECURSE;
+ }
+ else /* OP_KETRMAX */
+ {
+ RMATCH(eptr, prev, offset_top, md, ims, eptrb, match_cbegroup, RM9);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ ecode += 1 + LINK_SIZE;
+ flags = 0;
+ goto TAIL_RECURSE;
+ }
+ /* Control never gets here */
+
+ /* An alternation is the end of a branch; scan along to find the end of the
+ bracketed group and go to there. */
+
+ case OP_ALT:
+ do ecode += GET(ecode,1); while (*ecode == OP_ALT);
+ break;
+
+ /* BRAZERO and BRAMINZERO occur just before a bracket group, indicating
+ that it may occur zero times. It may repeat infinitely, or not at all -
+ i.e. it could be ()* or ()? in the pattern. Brackets with fixed upper
+ repeat limits are compiled as a number of copies, with the optional ones
+ preceded by BRAZERO or BRAMINZERO. */
+
+ case OP_BRAZERO:
+ {
+ next = ecode+1;
+ RMATCH(eptr, next, offset_top, md, ims, eptrb, 0, RM10);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ do next += GET(next,1); while (*next == OP_ALT);
+ ecode = next + 1 + LINK_SIZE;
+ }
+ break;
+
+ case OP_BRAMINZERO:
+ {
+ next = ecode+1;
+ do next += GET(next, 1); while (*next == OP_ALT);
+ RMATCH(eptr, next + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0, RM11);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ ecode++;
+ }
+ break;
+
+ /* End of a group, repeated or non-repeating. */
+
+ case OP_KET:
+ case OP_KETRMIN:
+ case OP_KETRMAX:
+ prev = ecode - GET(ecode, 1);
+
+ /* If this was a group that remembered the subject start, in order to break
+ infinite repeats of empty string matches, retrieve the subject start from
+ the chain. Otherwise, set it NULL. */
+
+ if (*prev >= OP_SBRA)
+ {
+ saved_eptr = eptrb->epb_saved_eptr; /* Value at start of group */
+ eptrb = eptrb->epb_prev; /* Backup to previous group */
+ }
+ else saved_eptr = NULL;
+
+ /* If we are at the end of an assertion group, stop matching and return
+ MATCH_MATCH, but record the current high water mark for use by positive
+ assertions. Do this also for the "once" (atomic) groups. */
+
+ if (*prev == OP_ASSERT || *prev == OP_ASSERT_NOT ||
+ *prev == OP_ASSERTBACK || *prev == OP_ASSERTBACK_NOT ||
+ *prev == OP_ONCE)
+ {
+ md->end_match_ptr = eptr; /* For ONCE */
+ md->end_offset_top = offset_top;
+ RRETURN(MATCH_MATCH);
+ }
+
+ /* For capturing groups we have to check the group number back at the start
+ and if necessary complete handling an extraction by setting the offsets and
+ bumping the high water mark. Note that whole-pattern recursion is coded as
+ a recurse into group 0, so it won't be picked up here. Instead, we catch it
+ when the OP_END is reached. Other recursion is handled here. */
+
+ if (*prev == OP_CBRA || *prev == OP_SCBRA)
+ {
+ number = GET2(prev, 1+LINK_SIZE);
+ offset = number << 1;
+
+#ifdef DEBUG
+ printf("end bracket %d", number);
+ printf("\n");
+#endif
+
+ md->capture_last = number;
+ if (offset >= md->offset_max) md->offset_overflow = TRUE; else
+ {
+ md->offset_vector[offset] =
+ md->offset_vector[md->offset_end - number];
+ md->offset_vector[offset+1] = eptr - md->start_subject;
+ if (offset_top <= offset) offset_top = offset + 2;
+ }
+
+ /* Handle a recursively called group. Restore the offsets
+ appropriately and continue from after the call. */
+
+ if (md->recursive != NULL && md->recursive->group_num == number)
+ {
+ recursion_info *rec = md->recursive;
+ DPRINTF(("Recursion (%d) succeeded - continuing\n", number));
+ md->recursive = rec->prevrec;
+ mstart = rec->save_start;
+ memcpy(md->offset_vector, rec->offset_save,
+ rec->saved_max * sizeof(int));
+ ecode = rec->after_call;
+ ims = original_ims;
+ break;
+ }
+ }
+
+ /* For both capturing and non-capturing groups, reset the value of the ims
+ flags, in case they got changed during the group. */
+
+ ims = original_ims;
+ DPRINTF(("ims reset to %02lx\n", ims));
+
+ /* For a non-repeating ket, just continue at this level. This also
+ happens for a repeating ket if no characters were matched in the group.
+ This is the forcible breaking of infinite loops as implemented in Perl
+ 5.005. If there is an options reset, it will get obeyed in the normal
+ course of events. */
+
+ if (*ecode == OP_KET || eptr == saved_eptr)
+ {
+ ecode += 1 + LINK_SIZE;
+ break;
+ }
+
+ /* The repeating kets try the rest of the pattern or restart from the
+ preceding bracket, in the appropriate order. In the second case, we can use
+ tail recursion to avoid using another stack frame, unless we have an
+ unlimited repeat of a group that can match an empty string. */
+
+ flags = (*prev >= OP_SBRA)? match_cbegroup : 0;
+
+ if (*ecode == OP_KETRMIN)
+ {
+ RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM12);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (flags != 0) /* Could match an empty string */
+ {
+ RMATCH(eptr, prev, offset_top, md, ims, eptrb, flags, RM50);
+ RRETURN(rrc);
+ }
+ ecode = prev;
+ goto TAIL_RECURSE;
+ }
+ else /* OP_KETRMAX */
+ {
+ RMATCH(eptr, prev, offset_top, md, ims, eptrb, flags, RM13);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ ecode += 1 + LINK_SIZE;
+ flags = 0;
+ goto TAIL_RECURSE;
+ }
+ /* Control never gets here */
+
+ /* Start of subject unless notbol, or after internal newline if multiline */
+
+ case OP_CIRC:
+ if (md->notbol && eptr == md->start_subject) RRETURN(MATCH_NOMATCH);
+ if ((ims & PCRE_MULTILINE) != 0)
+ {
+ if (eptr != md->start_subject &&
+ (eptr == md->end_subject || !WAS_NEWLINE(eptr)))
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+ }
+ /* ... else fall through */
+
+ /* Start of subject assertion */
+
+ case OP_SOD:
+ if (eptr != md->start_subject) RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ /* Start of match assertion */
+
+ case OP_SOM:
+ if (eptr != md->start_subject + md->start_offset) RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ /* Reset the start of match point */
+
+ case OP_SET_SOM:
+ mstart = eptr;
+ ecode++;
+ break;
+
+ /* Assert before internal newline if multiline, or before a terminating
+ newline unless endonly is set, else end of subject unless noteol is set. */
+
+ case OP_DOLL:
+ if ((ims & PCRE_MULTILINE) != 0)
+ {
+ if (eptr < md->end_subject)
+ { if (!IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); }
+ else
+ { if (md->noteol) RRETURN(MATCH_NOMATCH); }
+ ecode++;
+ break;
+ }
+ else
+ {
+ if (md->noteol) RRETURN(MATCH_NOMATCH);
+ if (!md->endonly)
+ {
+ if (eptr != md->end_subject &&
+ (!IS_NEWLINE(eptr) || eptr != md->end_subject - md->nllen))
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+ }
+ }
+ /* ... else fall through for endonly */
+
+ /* End of subject assertion (\z) */
+
+ case OP_EOD:
+ if (eptr < md->end_subject) RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ /* End of subject or ending \n assertion (\Z) */
+
+ case OP_EODN:
+ if (eptr != md->end_subject &&
+ (!IS_NEWLINE(eptr) || eptr != md->end_subject - md->nllen))
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ /* Word boundary assertions */
+
+ case OP_NOT_WORD_BOUNDARY:
+ case OP_WORD_BOUNDARY:
+ {
+
+ /* Find out if the previous and current characters are "word" characters.
+ It takes a bit more work in UTF-8 mode. Characters > 255 are assumed to
+ be "non-word" characters. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ if (eptr == md->start_subject) prev_is_word = FALSE; else
+ {
+ const uschar *lastptr = eptr - 1;
+ while((*lastptr & 0xc0) == 0x80) lastptr--;
+ GETCHAR(c, lastptr);
+ prev_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0;
+ }
+ if (eptr >= md->end_subject) cur_is_word = FALSE; else
+ {
+ GETCHAR(c, eptr);
+ cur_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0;
+ }
+ }
+ else
+#endif
+
+ /* More streamlined when not in UTF-8 mode */
+
+ {
+ prev_is_word = (eptr != md->start_subject) &&
+ ((md->ctypes[eptr[-1]] & ctype_word) != 0);
+ cur_is_word = (eptr < md->end_subject) &&
+ ((md->ctypes[*eptr] & ctype_word) != 0);
+ }
+
+ /* Now see if the situation is what we want */
+
+ if ((*ecode++ == OP_WORD_BOUNDARY)?
+ cur_is_word == prev_is_word : cur_is_word != prev_is_word)
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ /* Match a single character type; inline for speed */
+
+ case OP_ANY:
+ if ((ims & PCRE_DOTALL) == 0)
+ {
+ if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
+ }
+ if (eptr++ >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ if (utf8)
+ while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+ ecode++;
+ break;
+
+ /* Match a single byte, even in UTF-8 mode. This opcode really does match
+ any byte, even newline, independent of the setting of PCRE_DOTALL. */
+
+ case OP_ANYBYTE:
+ if (eptr++ >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ case OP_NOT_DIGIT:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ if (
+#ifdef SUPPORT_UTF8
+ c < 256 &&
+#endif
+ (md->ctypes[c] & ctype_digit) != 0
+ )
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ case OP_DIGIT:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ if (
+#ifdef SUPPORT_UTF8
+ c >= 256 ||
+#endif
+ (md->ctypes[c] & ctype_digit) == 0
+ )
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ case OP_NOT_WHITESPACE:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ if (
+#ifdef SUPPORT_UTF8
+ c < 256 &&
+#endif
+ (md->ctypes[c] & ctype_space) != 0
+ )
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ case OP_WHITESPACE:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ if (
+#ifdef SUPPORT_UTF8
+ c >= 256 ||
+#endif
+ (md->ctypes[c] & ctype_space) == 0
+ )
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ case OP_NOT_WORDCHAR:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ if (
+#ifdef SUPPORT_UTF8
+ c < 256 &&
+#endif
+ (md->ctypes[c] & ctype_word) != 0
+ )
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ case OP_WORDCHAR:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ if (
+#ifdef SUPPORT_UTF8
+ c >= 256 ||
+#endif
+ (md->ctypes[c] & ctype_word) == 0
+ )
+ RRETURN(MATCH_NOMATCH);
+ ecode++;
+ break;
+
+ case OP_ANYNL:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x000d:
+ if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
+ break;
+
+ case 0x000a:
+ break;
+
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
+ break;
+ }
+ ecode++;
+ break;
+
+ case OP_NOT_HSPACE:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ switch(c)
+ {
+ default: break;
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ RRETURN(MATCH_NOMATCH);
+ }
+ ecode++;
+ break;
+
+ case OP_HSPACE:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ break;
+ }
+ ecode++;
+ break;
+
+ case OP_NOT_VSPACE:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ switch(c)
+ {
+ default: break;
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ case 0x2028: /* LINE SEPARATOR */
+ case 0x2029: /* PARAGRAPH SEPARATOR */
+ RRETURN(MATCH_NOMATCH);
+ }
+ ecode++;
+ break;
+
+ case OP_VSPACE:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ case 0x2028: /* LINE SEPARATOR */
+ case 0x2029: /* PARAGRAPH SEPARATOR */
+ break;
+ }
+ ecode++;
+ break;
+
+#ifdef SUPPORT_UCP
+ /* Check the next character by Unicode property. We will get here only
+ if the support is in the binary; otherwise a compile-time error occurs. */
+
+ case OP_PROP:
+ case OP_NOTPROP:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ {
+ int chartype, script;
+ int category = _pcre_ucp_findprop(c, &chartype, &script);
+
+ switch(ecode[1])
+ {
+ case PT_ANY:
+ if (op == OP_NOTPROP) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case PT_LAMP:
+ if ((chartype == ucp_Lu ||
+ chartype == ucp_Ll ||
+ chartype == ucp_Lt) == (op == OP_NOTPROP))
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case PT_GC:
+ if ((ecode[2] != category) == (op == OP_PROP))
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case PT_PC:
+ if ((ecode[2] != chartype) == (op == OP_PROP))
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case PT_SC:
+ if ((ecode[2] != script) == (op == OP_PROP))
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+
+ ecode += 3;
+ }
+ break;
+
+ /* Match an extended Unicode sequence. We will get here only if the support
+ is in the binary; otherwise a compile-time error occurs. */
+
+ case OP_EXTUNI:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ {
+ int chartype, script;
+ int category = _pcre_ucp_findprop(c, &chartype, &script);
+ if (category == ucp_M) RRETURN(MATCH_NOMATCH);
+ while (eptr < md->end_subject)
+ {
+ int len = 1;
+ if (!utf8) c = *eptr; else
+ {
+ GETCHARLEN(c, eptr, len);
+ }
+ category = _pcre_ucp_findprop(c, &chartype, &script);
+ if (category != ucp_M) break;
+ eptr += len;
+ }
+ }
+ ecode++;
+ break;
+#endif
+
+
+ /* Match a back reference, possibly repeatedly. Look past the end of the
+ item to see if there is repeat information following. The code is similar
+ to that for character classes, but repeated for efficiency. Then obey
+ similar code to character type repeats - written out again for speed.
+ However, if the referenced string is the empty string, always treat
+ it as matched, any number of times (otherwise there could be infinite
+ loops). */
+
+ case OP_REF:
+ {
+ offset = GET2(ecode, 1) << 1; /* Doubled ref number */
+ ecode += 3; /* Advance past item */
+
+ /* If the reference is unset, set the length to be longer than the amount
+ of subject left; this ensures that every attempt at a match fails. We
+ can't just fail here, because of the possibility of quantifiers with zero
+ minima. */
+
+ length = (offset >= offset_top || md->offset_vector[offset] < 0)?
+ md->end_subject - eptr + 1 :
+ md->offset_vector[offset+1] - md->offset_vector[offset];
+
+ /* Set up for repetition, or handle the non-repeated case */
+
+ switch (*ecode)
+ {
+ case OP_CRSTAR:
+ case OP_CRMINSTAR:
+ case OP_CRPLUS:
+ case OP_CRMINPLUS:
+ case OP_CRQUERY:
+ case OP_CRMINQUERY:
+ c = *ecode++ - OP_CRSTAR;
+ minimize = (c & 1) != 0;
+ min = rep_min[c]; /* Pick up values from tables; */
+ max = rep_max[c]; /* zero for max => infinity */
+ if (max == 0) max = INT_MAX;
+ break;
+
+ case OP_CRRANGE:
+ case OP_CRMINRANGE:
+ minimize = (*ecode == OP_CRMINRANGE);
+ min = GET2(ecode, 1);
+ max = GET2(ecode, 3);
+ if (max == 0) max = INT_MAX;
+ ecode += 5;
+ break;
+
+ default: /* No repeat follows */
+ if (!match_ref(offset, eptr, length, md, ims)) RRETURN(MATCH_NOMATCH);
+ eptr += length;
+ continue; /* With the main loop */
+ }
+
+ /* If the length of the reference is zero, just continue with the
+ main loop. */
+
+ if (length == 0) continue;
+
+ /* First, ensure the minimum number of matches are present. We get back
+ the length of the reference string explicitly rather than passing the
+ address of eptr, so that eptr can be a register variable. */
+
+ for (i = 1; i <= min; i++)
+ {
+ if (!match_ref(offset, eptr, length, md, ims)) RRETURN(MATCH_NOMATCH);
+ eptr += length;
+ }
+
+ /* If min = max, continue at the same level without recursion.
+ They are not both allowed to be zero. */
+
+ if (min == max) continue;
+
+ /* If minimizing, keep trying and advancing the pointer */
+
+ if (minimize)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM14);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || !match_ref(offset, eptr, length, md, ims))
+ RRETURN(MATCH_NOMATCH);
+ eptr += length;
+ }
+ /* Control never gets here */
+ }
+
+ /* If maximizing, find the longest string and work backwards */
+
+ else
+ {
+ pp = eptr;
+ for (i = min; i < max; i++)
+ {
+ if (!match_ref(offset, eptr, length, md, ims)) break;
+ eptr += length;
+ }
+ while (eptr >= pp)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM15);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ eptr -= length;
+ }
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ /* Control never gets here */
+
+
+
+ /* Match a bit-mapped character class, possibly repeatedly. This op code is
+ used when all the characters in the class have values in the range 0-255,
+ and either the matching is caseful, or the characters are in the range
+ 0-127 when UTF-8 processing is enabled. The only difference between
+ OP_CLASS and OP_NCLASS occurs when a data character outside the range is
+ encountered.
+
+ First, look past the end of the item to see if there is repeat information
+ following. Then obey similar code to character type repeats - written out
+ again for speed. */
+
+ case OP_NCLASS:
+ case OP_CLASS:
+ {
+ data = ecode + 1; /* Save for matching */
+ ecode += 33; /* Advance past the item */
+
+ switch (*ecode)
+ {
+ case OP_CRSTAR:
+ case OP_CRMINSTAR:
+ case OP_CRPLUS:
+ case OP_CRMINPLUS:
+ case OP_CRQUERY:
+ case OP_CRMINQUERY:
+ c = *ecode++ - OP_CRSTAR;
+ minimize = (c & 1) != 0;
+ min = rep_min[c]; /* Pick up values from tables; */
+ max = rep_max[c]; /* zero for max => infinity */
+ if (max == 0) max = INT_MAX;
+ break;
+
+ case OP_CRRANGE:
+ case OP_CRMINRANGE:
+ minimize = (*ecode == OP_CRMINRANGE);
+ min = GET2(ecode, 1);
+ max = GET2(ecode, 3);
+ if (max == 0) max = INT_MAX;
+ ecode += 5;
+ break;
+
+ default: /* No repeat follows */
+ min = max = 1;
+ break;
+ }
+
+ /* First, ensure the minimum number of matches are present. */
+
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ if (c > 255)
+ {
+ if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
+ }
+ else
+ {
+ if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+ }
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ c = *eptr++;
+ if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+ }
+ }
+
+ /* If max == min we can continue with the main loop without the
+ need to recurse. */
+
+ if (min == max) continue;
+
+ /* If minimizing, keep testing the rest of the expression and advancing
+ the pointer while it matches the class. */
+
+ if (minimize)
+ {
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM16);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ if (c > 255)
+ {
+ if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
+ }
+ else
+ {
+ if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+ }
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM17);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ c = *eptr++;
+ if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
+ }
+ }
+ /* Control never gets here */
+ }
+
+ /* If maximizing, find the longest possible run, then work backwards. */
+
+ else
+ {
+ pp = eptr;
+
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c > 255)
+ {
+ if (op == OP_CLASS) break;
+ }
+ else
+ {
+ if ((data[c/8] & (1 << (c&7))) == 0) break;
+ }
+ eptr += len;
+ }
+ for (;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM18);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr-- == pp) break; /* Stop if tried at original pos */
+ BACKCHAR(eptr);
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ c = *eptr;
+ if ((data[c/8] & (1 << (c&7))) == 0) break;
+ eptr++;
+ }
+ while (eptr >= pp)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM19);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ eptr--;
+ }
+ }
+
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ /* Control never gets here */
+
+
+ /* Match an extended character class. This opcode is encountered only
+ in UTF-8 mode, because that's the only time it is compiled. */
+
+#ifdef SUPPORT_UTF8
+ case OP_XCLASS:
+ {
+ data = ecode + 1 + LINK_SIZE; /* Save for matching */
+ ecode += GET(ecode, 1); /* Advance past the item */
+
+ switch (*ecode)
+ {
+ case OP_CRSTAR:
+ case OP_CRMINSTAR:
+ case OP_CRPLUS:
+ case OP_CRMINPLUS:
+ case OP_CRQUERY:
+ case OP_CRMINQUERY:
+ c = *ecode++ - OP_CRSTAR;
+ minimize = (c & 1) != 0;
+ min = rep_min[c]; /* Pick up values from tables; */
+ max = rep_max[c]; /* zero for max => infinity */
+ if (max == 0) max = INT_MAX;
+ break;
+
+ case OP_CRRANGE:
+ case OP_CRMINRANGE:
+ minimize = (*ecode == OP_CRMINRANGE);
+ min = GET2(ecode, 1);
+ max = GET2(ecode, 3);
+ if (max == 0) max = INT_MAX;
+ ecode += 5;
+ break;
+
+ default: /* No repeat follows */
+ min = max = 1;
+ break;
+ }
+
+ /* First, ensure the minimum number of matches are present. */
+
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH);
+ }
+
+ /* If max == min we can continue with the main loop without the
+ need to recurse. */
+
+ if (min == max) continue;
+
+ /* If minimizing, keep testing the rest of the expression and advancing
+ the pointer while it matches the class. */
+
+ if (minimize)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM20);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+ }
+
+ /* If maximizing, find the longest possible run, then work backwards. */
+
+ else
+ {
+ pp = eptr;
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (!_pcre_xclass(c, data)) break;
+ eptr += len;
+ }
+ for(;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM21);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr-- == pp) break; /* Stop if tried at original pos */
+ if (utf8) BACKCHAR(eptr);
+ }
+ RRETURN(MATCH_NOMATCH);
+ }
+
+ /* Control never gets here */
+ }
+#endif /* End of XCLASS */
+
+ /* Match a single character, casefully */
+
+ case OP_CHAR:
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ length = 1;
+ ecode++;
+ GETCHARLEN(fc, ecode, length);
+ if (length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+ while (length-- > 0) if (*ecode++ != *eptr++) RRETURN(MATCH_NOMATCH);
+ }
+ else
+#endif
+
+ /* Non-UTF-8 mode */
+ {
+ if (md->end_subject - eptr < 1) RRETURN(MATCH_NOMATCH);
+ if (ecode[1] != *eptr++) RRETURN(MATCH_NOMATCH);
+ ecode += 2;
+ }
+ break;
+
+ /* Match a single character, caselessly */
+
+ case OP_CHARNC:
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ length = 1;
+ ecode++;
+ GETCHARLEN(fc, ecode, length);
+
+ if (length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+
+ /* If the pattern character's value is < 128, we have only one byte, and
+ can use the fast lookup table. */
+
+ if (fc < 128)
+ {
+ if (md->lcc[*ecode++] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+ }
+
+ /* Otherwise we must pick up the subject character */
+
+ else
+ {
+ unsigned int dc;
+ GETCHARINC(dc, eptr);
+ ecode += length;
+
+ /* If we have Unicode property support, we can use it to test the other
+ case of the character, if there is one. */
+
+ if (fc != dc)
+ {
+#ifdef SUPPORT_UCP
+ if (dc != _pcre_ucp_othercase(fc))
+#endif
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+
+ /* Non-UTF-8 mode */
+ {
+ if (md->end_subject - eptr < 1) RRETURN(MATCH_NOMATCH);
+ if (md->lcc[ecode[1]] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+ ecode += 2;
+ }
+ break;
+
+ /* Match a single character repeatedly. */
+
+ case OP_EXACT:
+ min = max = GET2(ecode, 1);
+ ecode += 3;
+ goto REPEATCHAR;
+
+ case OP_POSUPTO:
+ possessive = TRUE;
+ /* Fall through */
+
+ case OP_UPTO:
+ case OP_MINUPTO:
+ min = 0;
+ max = GET2(ecode, 1);
+ minimize = *ecode == OP_MINUPTO;
+ ecode += 3;
+ goto REPEATCHAR;
+
+ case OP_POSSTAR:
+ possessive = TRUE;
+ min = 0;
+ max = INT_MAX;
+ ecode++;
+ goto REPEATCHAR;
+
+ case OP_POSPLUS:
+ possessive = TRUE;
+ min = 1;
+ max = INT_MAX;
+ ecode++;
+ goto REPEATCHAR;
+
+ case OP_POSQUERY:
+ possessive = TRUE;
+ min = 0;
+ max = 1;
+ ecode++;
+ goto REPEATCHAR;
+
+ case OP_STAR:
+ case OP_MINSTAR:
+ case OP_PLUS:
+ case OP_MINPLUS:
+ case OP_QUERY:
+ case OP_MINQUERY:
+ c = *ecode++ - OP_STAR;
+ minimize = (c & 1) != 0;
+ min = rep_min[c]; /* Pick up values from tables; */
+ max = rep_max[c]; /* zero for max => infinity */
+ if (max == 0) max = INT_MAX;
+
+ /* Common code for all repeated single-character matches. We can give
+ up quickly if there are fewer than the minimum number of characters left in
+ the subject. */
+
+ REPEATCHAR:
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ length = 1;
+ charptr = ecode;
+ GETCHARLEN(fc, ecode, length);
+ if (min * length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+ ecode += length;
+
+ /* Handle multibyte character matching specially here. There is
+ support for caseless matching if UCP support is present. */
+
+ if (length > 1)
+ {
+#ifdef SUPPORT_UCP
+ unsigned int othercase;
+ if ((ims & PCRE_CASELESS) != 0 &&
+ (othercase = _pcre_ucp_othercase(fc)) != NOTACHAR)
+ oclength = _pcre_ord2utf8(othercase, occhars);
+ else oclength = 0;
+#endif /* SUPPORT_UCP */
+
+ for (i = 1; i <= min; i++)
+ {
+ if (memcmp(eptr, charptr, length) == 0) eptr += length;
+#ifdef SUPPORT_UCP
+ /* Need braces because of following else */
+ else if (oclength == 0) { RRETURN(MATCH_NOMATCH); }
+ else
+ {
+ if (memcmp(eptr, occhars, oclength) != 0) RRETURN(MATCH_NOMATCH);
+ eptr += oclength;
+ }
+#else /* without SUPPORT_UCP */
+ else { RRETURN(MATCH_NOMATCH); }
+#endif /* SUPPORT_UCP */
+ }
+
+ if (min == max) continue;
+
+ if (minimize)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM22);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ if (memcmp(eptr, charptr, length) == 0) eptr += length;
+#ifdef SUPPORT_UCP
+ /* Need braces because of following else */
+ else if (oclength == 0) { RRETURN(MATCH_NOMATCH); }
+ else
+ {
+ if (memcmp(eptr, occhars, oclength) != 0) RRETURN(MATCH_NOMATCH);
+ eptr += oclength;
+ }
+#else /* without SUPPORT_UCP */
+ else { RRETURN (MATCH_NOMATCH); }
+#endif /* SUPPORT_UCP */
+ }
+ /* Control never gets here */
+ }
+
+ else /* Maximize */
+ {
+ pp = eptr;
+ for (i = min; i < max; i++)
+ {
+ if (eptr > md->end_subject - length) break;
+ if (memcmp(eptr, charptr, length) == 0) eptr += length;
+#ifdef SUPPORT_UCP
+ else if (oclength == 0) break;
+ else
+ {
+ if (memcmp(eptr, occhars, oclength) != 0) break;
+ eptr += oclength;
+ }
+#else /* without SUPPORT_UCP */
+ else break;
+#endif /* SUPPORT_UCP */
+ }
+
+ if (possessive) continue;
+ for(;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM23);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr == pp) RRETURN(MATCH_NOMATCH);
+#ifdef SUPPORT_UCP
+ eptr--;
+ BACKCHAR(eptr);
+#else /* without SUPPORT_UCP */
+ eptr -= length;
+#endif /* SUPPORT_UCP */
+ }
+ }
+ /* Control never gets here */
+ }
+
+ /* If the length of a UTF-8 character is 1, we fall through here, and
+ obey the code as for non-UTF-8 characters below, though in this case the
+ value of fc will always be < 128. */
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+
+ /* When not in UTF-8 mode, load a single-byte character. */
+ {
+ if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+ fc = *ecode++;
+ }
+
+ /* The value of fc at this point is always less than 256, though we may or
+ may not be in UTF-8 mode. The code is duplicated for the caseless and
+ caseful cases, for speed, since matching characters is likely to be quite
+ common. First, ensure the minimum number of matches are present. If min =
+ max, continue at the same level without recursing. Otherwise, if
+ minimizing, keep trying the rest of the expression and advancing one
+ matching character if failing, up to the maximum. Alternatively, if
+ maximizing, find the maximum number of characters and work backwards. */
+
+ DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
+ max, eptr));
+
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+ fc = md->lcc[fc];
+ for (i = 1; i <= min; i++)
+ if (fc != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+ if (min == max) continue;
+ if (minimize)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM24);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject ||
+ fc != md->lcc[*eptr++])
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+ }
+ else /* Maximize */
+ {
+ pp = eptr;
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || fc != md->lcc[*eptr]) break;
+ eptr++;
+ }
+ if (possessive) continue;
+ while (eptr >= pp)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM25);
+ eptr--;
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ }
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+ }
+
+ /* Caseful comparisons (includes all multi-byte characters) */
+
+ else
+ {
+ for (i = 1; i <= min; i++) if (fc != *eptr++) RRETURN(MATCH_NOMATCH);
+ if (min == max) continue;
+ if (minimize)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM26);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject || fc != *eptr++)
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+ }
+ else /* Maximize */
+ {
+ pp = eptr;
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || fc != *eptr) break;
+ eptr++;
+ }
+ if (possessive) continue;
+ while (eptr >= pp)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM27);
+ eptr--;
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ }
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ /* Control never gets here */
+
+ /* Match a negated single one-byte character. The character we are
+ checking can be multibyte. */
+
+ case OP_NOT:
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ ecode++;
+ GETCHARINCTEST(c, eptr);
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+#ifdef SUPPORT_UTF8
+ if (c < 256)
+#endif
+ c = md->lcc[c];
+ if (md->lcc[*ecode++] == c) RRETURN(MATCH_NOMATCH);
+ }
+ else
+ {
+ if (*ecode++ == c) RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ /* Match a negated single one-byte character repeatedly. This is almost a
+ repeat of the code for a repeated single character, but I haven't found a
+ nice way of commoning these up that doesn't require a test of the
+ positive/negative option for each character match. Maybe that wouldn't add
+ very much to the time taken, but character matching *is* what this is all
+ about... */
+
+ case OP_NOTEXACT:
+ min = max = GET2(ecode, 1);
+ ecode += 3;
+ goto REPEATNOTCHAR;
+
+ case OP_NOTUPTO:
+ case OP_NOTMINUPTO:
+ min = 0;
+ max = GET2(ecode, 1);
+ minimize = *ecode == OP_NOTMINUPTO;
+ ecode += 3;
+ goto REPEATNOTCHAR;
+
+ case OP_NOTPOSSTAR:
+ possessive = TRUE;
+ min = 0;
+ max = INT_MAX;
+ ecode++;
+ goto REPEATNOTCHAR;
+
+ case OP_NOTPOSPLUS:
+ possessive = TRUE;
+ min = 1;
+ max = INT_MAX;
+ ecode++;
+ goto REPEATNOTCHAR;
+
+ case OP_NOTPOSQUERY:
+ possessive = TRUE;
+ min = 0;
+ max = 1;
+ ecode++;
+ goto REPEATNOTCHAR;
+
+ case OP_NOTPOSUPTO:
+ possessive = TRUE;
+ min = 0;
+ max = GET2(ecode, 1);
+ ecode += 3;
+ goto REPEATNOTCHAR;
+
+ case OP_NOTSTAR:
+ case OP_NOTMINSTAR:
+ case OP_NOTPLUS:
+ case OP_NOTMINPLUS:
+ case OP_NOTQUERY:
+ case OP_NOTMINQUERY:
+ c = *ecode++ - OP_NOTSTAR;
+ minimize = (c & 1) != 0;
+ min = rep_min[c]; /* Pick up values from tables; */
+ max = rep_max[c]; /* zero for max => infinity */
+ if (max == 0) max = INT_MAX;
+
+ /* Common code for all repeated single-byte matches. We can give up quickly
+ if there are fewer than the minimum number of bytes left in the
+ subject. */
+
+ REPEATNOTCHAR:
+ if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+ fc = *ecode++;
+
+ /* The code is duplicated for the caseless and caseful cases, for speed,
+ since matching characters is likely to be quite common. First, ensure the
+ minimum number of matches are present. If min = max, continue at the same
+ level without recursing. Otherwise, if minimizing, keep trying the rest of
+ the expression and advancing one matching character if failing, up to the
+ maximum. Alternatively, if maximizing, find the maximum number of
+ characters and work backwards. */
+
+ DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
+ max, eptr));
+
+ if ((ims & PCRE_CASELESS) != 0)
+ {
+ fc = md->lcc[fc];
+
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ register unsigned int d;
+ for (i = 1; i <= min; i++)
+ {
+ GETCHARINC(d, eptr);
+ if (d < 256) d = md->lcc[d];
+ if (fc == d) RRETURN(MATCH_NOMATCH);
+ }
+ }
+ else
+#endif
+
+ /* Not UTF-8 mode */
+ {
+ for (i = 1; i <= min; i++)
+ if (fc == md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);
+ }
+
+ if (min == max) continue;
+
+ if (minimize)
+ {
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ register unsigned int d;
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM28);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ GETCHARINC(d, eptr);
+ if (d < 256) d = md->lcc[d];
+ if (fi >= max || eptr >= md->end_subject || fc == d)
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM29);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject || fc == md->lcc[*eptr++])
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ /* Control never gets here */
+ }
+
+ /* Maximize case */
+
+ else
+ {
+ pp = eptr;
+
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ register unsigned int d;
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(d, eptr, len);
+ if (d < 256) d = md->lcc[d];
+ if (fc == d) break;
+ eptr += len;
+ }
+ if (possessive) continue;
+ for(;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM30);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr-- == pp) break; /* Stop if tried at original pos */
+ BACKCHAR(eptr);
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || fc == md->lcc[*eptr]) break;
+ eptr++;
+ }
+ if (possessive) continue;
+ while (eptr >= pp)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM31);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ eptr--;
+ }
+ }
+
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+ }
+
+ /* Caseful comparisons */
+
+ else
+ {
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ register unsigned int d;
+ for (i = 1; i <= min; i++)
+ {
+ GETCHARINC(d, eptr);
+ if (fc == d) RRETURN(MATCH_NOMATCH);
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (i = 1; i <= min; i++)
+ if (fc == *eptr++) RRETURN(MATCH_NOMATCH);
+ }
+
+ if (min == max) continue;
+
+ if (minimize)
+ {
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ register unsigned int d;
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM32);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ GETCHARINC(d, eptr);
+ if (fi >= max || eptr >= md->end_subject || fc == d)
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM33);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject || fc == *eptr++)
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ /* Control never gets here */
+ }
+
+ /* Maximize case */
+
+ else
+ {
+ pp = eptr;
+
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ register unsigned int d;
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(d, eptr, len);
+ if (fc == d) break;
+ eptr += len;
+ }
+ if (possessive) continue;
+ for(;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM34);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr-- == pp) break; /* Stop if tried at original pos */
+ BACKCHAR(eptr);
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || fc == *eptr) break;
+ eptr++;
+ }
+ if (possessive) continue;
+ while (eptr >= pp)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM35);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ eptr--;
+ }
+ }
+
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ /* Control never gets here */
+
+ /* Match a single character type repeatedly; several different opcodes
+ share code. This is very similar to the code for single characters, but we
+ repeat it in the interests of efficiency. */
+
+ case OP_TYPEEXACT:
+ min = max = GET2(ecode, 1);
+ minimize = TRUE;
+ ecode += 3;
+ goto REPEATTYPE;
+
+ case OP_TYPEUPTO:
+ case OP_TYPEMINUPTO:
+ min = 0;
+ max = GET2(ecode, 1);
+ minimize = *ecode == OP_TYPEMINUPTO;
+ ecode += 3;
+ goto REPEATTYPE;
+
+ case OP_TYPEPOSSTAR:
+ possessive = TRUE;
+ min = 0;
+ max = INT_MAX;
+ ecode++;
+ goto REPEATTYPE;
+
+ case OP_TYPEPOSPLUS:
+ possessive = TRUE;
+ min = 1;
+ max = INT_MAX;
+ ecode++;
+ goto REPEATTYPE;
+
+ case OP_TYPEPOSQUERY:
+ possessive = TRUE;
+ min = 0;
+ max = 1;
+ ecode++;
+ goto REPEATTYPE;
+
+ case OP_TYPEPOSUPTO:
+ possessive = TRUE;
+ min = 0;
+ max = GET2(ecode, 1);
+ ecode += 3;
+ goto REPEATTYPE;
+
+ case OP_TYPESTAR:
+ case OP_TYPEMINSTAR:
+ case OP_TYPEPLUS:
+ case OP_TYPEMINPLUS:
+ case OP_TYPEQUERY:
+ case OP_TYPEMINQUERY:
+ c = *ecode++ - OP_TYPESTAR;
+ minimize = (c & 1) != 0;
+ min = rep_min[c]; /* Pick up values from tables; */
+ max = rep_max[c]; /* zero for max => infinity */
+ if (max == 0) max = INT_MAX;
+
+ /* Common code for all repeated single character type matches. Note that
+ in UTF-8 mode, '.' matches a character of any length, but for the other
+ character types, the valid characters are all one-byte long. */
+
+ REPEATTYPE:
+ ctype = *ecode++; /* Code for the character type */
+
+#ifdef SUPPORT_UCP
+ if (ctype == OP_PROP || ctype == OP_NOTPROP)
+ {
+ prop_fail_result = ctype == OP_NOTPROP;
+ prop_type = *ecode++;
+ prop_value = *ecode++;
+ }
+ else prop_type = -1;
+#endif
+
+ /* First, ensure the minimum number of matches are present. Use inline
+ code for maximizing the speed, and do the type test once at the start
+ (i.e. keep it out of the loop). Also we can test that there are at least
+ the minimum number of bytes before we start. This isn't as effective in
+ UTF-8 mode, but it does no harm. Separate the UTF-8 code completely as that
+ is tidier. Also separate the UCP code, which can be the same for both UTF-8
+ and single-bytes. */
+
+ if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH);
+ if (min > 0)
+ {
+#ifdef SUPPORT_UCP
+ if (prop_type >= 0)
+ {
+ switch(prop_type)
+ {
+ case PT_ANY:
+ if (prop_fail_result) RRETURN(MATCH_NOMATCH);
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ }
+ break;
+
+ case PT_LAMP:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_chartype == ucp_Lu ||
+ prop_chartype == ucp_Ll ||
+ prop_chartype == ucp_Lt) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case PT_GC:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_category == prop_value) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case PT_PC:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_chartype == prop_value) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case PT_SC:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_script == prop_value) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+ }
+
+ /* Match extended Unicode sequences. We will get here only if the
+ support is in the binary; otherwise a compile-time error occurs. */
+
+ else if (ctype == OP_EXTUNI)
+ {
+ for (i = 1; i <= min; i++)
+ {
+ GETCHARINCTEST(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH);
+ while (eptr < md->end_subject)
+ {
+ int len = 1;
+ if (!utf8) c = *eptr; else
+ {
+ GETCHARLEN(c, eptr, len);
+ }
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if (prop_category != ucp_M) break;
+ eptr += len;
+ }
+ }
+ }
+
+ else
+#endif /* SUPPORT_UCP */
+
+/* Handle all other cases when the coding is UTF-8 */
+
+#ifdef SUPPORT_UTF8
+ if (utf8) switch(ctype)
+ {
+ case OP_ANY:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject ||
+ ((ims & PCRE_DOTALL) == 0 && IS_NEWLINE(eptr)))
+ RRETURN(MATCH_NOMATCH);
+ eptr++;
+ while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+ }
+ break;
+
+ case OP_ANYBYTE:
+ eptr += min;
+ break;
+
+ case OP_ANYNL:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x000d:
+ if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
+ break;
+
+ case 0x000a:
+ break;
+
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
+ break;
+ }
+ }
+ break;
+
+ case OP_NOT_HSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ switch(c)
+ {
+ default: break;
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ break;
+
+ case OP_HSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ break;
+ }
+ }
+ break;
+
+ case OP_NOT_VSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ switch(c)
+ {
+ default: break;
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ case 0x2028: /* LINE SEPARATOR */
+ case 0x2029: /* PARAGRAPH SEPARATOR */
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ break;
+
+ case OP_VSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ case 0x2028: /* LINE SEPARATOR */
+ case 0x2029: /* PARAGRAPH SEPARATOR */
+ break;
+ }
+ }
+ break;
+
+ case OP_NOT_DIGIT:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ if (c < 128 && (md->ctypes[c] & ctype_digit) != 0)
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case OP_DIGIT:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject ||
+ *eptr >= 128 || (md->ctypes[*eptr++] & ctype_digit) == 0)
+ RRETURN(MATCH_NOMATCH);
+ /* No need to skip more bytes - we know it's a 1-byte character */
+ }
+ break;
+
+ case OP_NOT_WHITESPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject ||
+ (*eptr < 128 && (md->ctypes[*eptr] & ctype_space) != 0))
+ RRETURN(MATCH_NOMATCH);
+ while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80);
+ }
+ break;
+
+ case OP_WHITESPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject ||
+ *eptr >= 128 || (md->ctypes[*eptr++] & ctype_space) == 0)
+ RRETURN(MATCH_NOMATCH);
+ /* No need to skip more bytes - we know it's a 1-byte character */
+ }
+ break;
+
+ case OP_NOT_WORDCHAR:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject ||
+ (*eptr < 128 && (md->ctypes[*eptr] & ctype_word) != 0))
+ RRETURN(MATCH_NOMATCH);
+ while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80);
+ }
+ break;
+
+ case OP_WORDCHAR:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject ||
+ *eptr >= 128 || (md->ctypes[*eptr++] & ctype_word) == 0)
+ RRETURN(MATCH_NOMATCH);
+ /* No need to skip more bytes - we know it's a 1-byte character */
+ }
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ } /* End switch(ctype) */
+
+ else
+#endif /* SUPPORT_UTF8 */
+
+ /* Code for the non-UTF-8 case for minimum matching of operators other
+ than OP_PROP and OP_NOTPROP. We can assume that there are the minimum
+ number of bytes present, as this was tested above. */
+
+ switch(ctype)
+ {
+ case OP_ANY:
+ if ((ims & PCRE_DOTALL) == 0)
+ {
+ for (i = 1; i <= min; i++)
+ {
+ if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
+ eptr++;
+ }
+ }
+ else eptr += min;
+ break;
+
+ case OP_ANYBYTE:
+ eptr += min;
+ break;
+
+ /* Because of the CRLF case, we can't assume the minimum number of
+ bytes are present in this case. */
+
+ case OP_ANYNL:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ switch(*eptr++)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x000d:
+ if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
+ break;
+ case 0x000a:
+ break;
+
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
+ break;
+ }
+ }
+ break;
+
+ case OP_NOT_HSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ switch(*eptr++)
+ {
+ default: break;
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ break;
+
+ case OP_HSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ switch(*eptr++)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ break;
+ }
+ }
+ break;
+
+ case OP_NOT_VSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ switch(*eptr++)
+ {
+ default: break;
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ RRETURN(MATCH_NOMATCH);
+ }
+ }
+ break;
+
+ case OP_VSPACE:
+ for (i = 1; i <= min; i++)
+ {
+ if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ switch(*eptr++)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ break;
+ }
+ }
+ break;
+
+ case OP_NOT_DIGIT:
+ for (i = 1; i <= min; i++)
+ if ((md->ctypes[*eptr++] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_DIGIT:
+ for (i = 1; i <= min; i++)
+ if ((md->ctypes[*eptr++] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_NOT_WHITESPACE:
+ for (i = 1; i <= min; i++)
+ if ((md->ctypes[*eptr++] & ctype_space) != 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_WHITESPACE:
+ for (i = 1; i <= min; i++)
+ if ((md->ctypes[*eptr++] & ctype_space) == 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_NOT_WORDCHAR:
+ for (i = 1; i <= min; i++)
+ if ((md->ctypes[*eptr++] & ctype_word) != 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_WORDCHAR:
+ for (i = 1; i <= min; i++)
+ if ((md->ctypes[*eptr++] & ctype_word) == 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+ }
+
+ /* If min = max, continue at the same level without recursing */
+
+ if (min == max) continue;
+
+ /* If minimizing, we have to test the rest of the pattern before each
+ subsequent match. Again, separate the UTF-8 case for speed, and also
+ separate the UCP cases. */
+
+ if (minimize)
+ {
+#ifdef SUPPORT_UCP
+ if (prop_type >= 0)
+ {
+ switch(prop_type)
+ {
+ case PT_ANY:
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM36);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ if (prop_fail_result) RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+
+ case PT_LAMP:
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM37);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_chartype == ucp_Lu ||
+ prop_chartype == ucp_Ll ||
+ prop_chartype == ucp_Lt) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+
+ case PT_GC:
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM38);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_category == prop_value) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+
+ case PT_PC:
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM39);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_chartype == prop_value) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+
+ case PT_SC:
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM40);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINC(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_script == prop_value) == prop_fail_result)
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+ }
+
+ /* Match extended Unicode sequences. We will get here only if the
+ support is in the binary; otherwise a compile-time error occurs. */
+
+ else if (ctype == OP_EXTUNI)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM41);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH);
+ GETCHARINCTEST(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH);
+ while (eptr < md->end_subject)
+ {
+ int len = 1;
+ if (!utf8) c = *eptr; else
+ {
+ GETCHARLEN(c, eptr, len);
+ }
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if (prop_category != ucp_M) break;
+ eptr += len;
+ }
+ }
+ }
+
+ else
+#endif /* SUPPORT_UCP */
+
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+ if (utf8)
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM42);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject ||
+ (ctype == OP_ANY && (ims & PCRE_DOTALL) == 0 &&
+ IS_NEWLINE(eptr)))
+ RRETURN(MATCH_NOMATCH);
+
+ GETCHARINC(c, eptr);
+ switch(ctype)
+ {
+ case OP_ANY: /* This is the DOTALL case */
+ break;
+
+ case OP_ANYBYTE:
+ break;
+
+ case OP_ANYNL:
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x000d:
+ if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
+ break;
+ case 0x000a:
+ break;
+
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ case 0x2028:
+ case 0x2029:
+ if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
+ break;
+ }
+ break;
+
+ case OP_NOT_HSPACE:
+ switch(c)
+ {
+ default: break;
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case OP_HSPACE:
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ break;
+ }
+ break;
+
+ case OP_NOT_VSPACE:
+ switch(c)
+ {
+ default: break;
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ case 0x2028: /* LINE SEPARATOR */
+ case 0x2029: /* PARAGRAPH SEPARATOR */
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case OP_VSPACE:
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ case 0x2028: /* LINE SEPARATOR */
+ case 0x2029: /* PARAGRAPH SEPARATOR */
+ break;
+ }
+ break;
+
+ case OP_NOT_DIGIT:
+ if (c < 256 && (md->ctypes[c] & ctype_digit) != 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_DIGIT:
+ if (c >= 256 || (md->ctypes[c] & ctype_digit) == 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_NOT_WHITESPACE:
+ if (c < 256 && (md->ctypes[c] & ctype_space) != 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_WHITESPACE:
+ if (c >= 256 || (md->ctypes[c] & ctype_space) == 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_NOT_WORDCHAR:
+ if (c < 256 && (md->ctypes[c] & ctype_word) != 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_WORDCHAR:
+ if (c >= 256 || (md->ctypes[c] & ctype_word) == 0)
+ RRETURN(MATCH_NOMATCH);
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+ }
+ }
+ else
+#endif
+ /* Not UTF-8 mode */
+ {
+ for (fi = min;; fi++)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM43);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (fi >= max || eptr >= md->end_subject ||
+ ((ims & PCRE_DOTALL) == 0 && IS_NEWLINE(eptr)))
+ RRETURN(MATCH_NOMATCH);
+
+ c = *eptr++;
+ switch(ctype)
+ {
+ case OP_ANY: /* This is the DOTALL case */
+ break;
+
+ case OP_ANYBYTE:
+ break;
+
+ case OP_ANYNL:
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x000d:
+ if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
+ break;
+
+ case 0x000a:
+ break;
+
+ case 0x000b:
+ case 0x000c:
+ case 0x0085:
+ if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
+ break;
+ }
+ break;
+
+ case OP_NOT_HSPACE:
+ switch(c)
+ {
+ default: break;
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case OP_HSPACE:
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ break;
+ }
+ break;
+
+ case OP_NOT_VSPACE:
+ switch(c)
+ {
+ default: break;
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ RRETURN(MATCH_NOMATCH);
+ }
+ break;
+
+ case OP_VSPACE:
+ switch(c)
+ {
+ default: RRETURN(MATCH_NOMATCH);
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ break;
+ }
+ break;
+
+ case OP_NOT_DIGIT:
+ if ((md->ctypes[c] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_DIGIT:
+ if ((md->ctypes[c] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_NOT_WHITESPACE:
+ if ((md->ctypes[c] & ctype_space) != 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_WHITESPACE:
+ if ((md->ctypes[c] & ctype_space) == 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_NOT_WORDCHAR:
+ if ((md->ctypes[c] & ctype_word) != 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ case OP_WORDCHAR:
+ if ((md->ctypes[c] & ctype_word) == 0) RRETURN(MATCH_NOMATCH);
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+ }
+ }
+ /* Control never gets here */
+ }
+
+ /* If maximizing, it is worth using inline code for speed, doing the type
+ test once at the start (i.e. keep it out of the loop). Again, keep the
+ UTF-8 and UCP stuff separate. */
+
+ else
+ {
+ pp = eptr; /* Remember where we started */
+
+#ifdef SUPPORT_UCP
+ if (prop_type >= 0)
+ {
+ switch(prop_type)
+ {
+ case PT_ANY:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (prop_fail_result) break;
+ eptr+= len;
+ }
+ break;
+
+ case PT_LAMP:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_chartype == ucp_Lu ||
+ prop_chartype == ucp_Ll ||
+ prop_chartype == ucp_Lt) == prop_fail_result)
+ break;
+ eptr+= len;
+ }
+ break;
+
+ case PT_GC:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_category == prop_value) == prop_fail_result)
+ break;
+ eptr+= len;
+ }
+ break;
+
+ case PT_PC:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_chartype == prop_value) == prop_fail_result)
+ break;
+ eptr+= len;
+ }
+ break;
+
+ case PT_SC:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if ((prop_script == prop_value) == prop_fail_result)
+ break;
+ eptr+= len;
+ }
+ break;
+ }
+
+ /* eptr is now past the end of the maximum run */
+
+ if (possessive) continue;
+ for(;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM44);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr-- == pp) break; /* Stop if tried at original pos */
+ if (utf8) BACKCHAR(eptr);
+ }
+ }
+
+ /* Match extended Unicode sequences. We will get here only if the
+ support is in the binary; otherwise a compile-time error occurs. */
+
+ else if (ctype == OP_EXTUNI)
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ GETCHARINCTEST(c, eptr);
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if (prop_category == ucp_M) break;
+ while (eptr < md->end_subject)
+ {
+ int len = 1;
+ if (!utf8) c = *eptr; else
+ {
+ GETCHARLEN(c, eptr, len);
+ }
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if (prop_category != ucp_M) break;
+ eptr += len;
+ }
+ }
+
+ /* eptr is now past the end of the maximum run */
+
+ if (possessive) continue;
+ for(;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM45);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr-- == pp) break; /* Stop if tried at original pos */
+ for (;;) /* Move back over one extended */
+ {
+ int len = 1;
+ if (!utf8) c = *eptr; else
+ {
+ BACKCHAR(eptr);
+ GETCHARLEN(c, eptr, len);
+ }
+ prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script);
+ if (prop_category != ucp_M) break;
+ eptr--;
+ }
+ }
+ }
+
+ else
+#endif /* SUPPORT_UCP */
+
+#ifdef SUPPORT_UTF8
+ /* UTF-8 mode */
+
+ if (utf8)
+ {
+ switch(ctype)
+ {
+ case OP_ANY:
+ if (max < INT_MAX)
+ {
+ if ((ims & PCRE_DOTALL) == 0)
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || IS_NEWLINE(eptr)) break;
+ eptr++;
+ while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+ }
+ }
+ else
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ eptr++;
+ while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+ }
+ }
+ }
+
+ /* Handle unlimited UTF-8 repeat */
+
+ else
+ {
+ if ((ims & PCRE_DOTALL) == 0)
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || IS_NEWLINE(eptr)) break;
+ eptr++;
+ while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;
+ }
+ }
+ else
+ {
+ eptr = md->end_subject;
+ }
+ }
+ break;
+
+ /* The byte case is the same as non-UTF8 */
+
+ case OP_ANYBYTE:
+ c = max - min;
+ if (c > (unsigned int)(md->end_subject - eptr))
+ c = md->end_subject - eptr;
+ eptr += c;
+ break;
+
+ case OP_ANYNL:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c == 0x000d)
+ {
+ if (++eptr >= md->end_subject) break;
+ if (*eptr == 0x000a) eptr++;
+ }
+ else
+ {
+ if (c != 0x000a &&
+ (md->bsr_anycrlf ||
+ (c != 0x000b && c != 0x000c &&
+ c != 0x0085 && c != 0x2028 && c != 0x2029)))
+ break;
+ eptr += len;
+ }
+ }
+ break;
+
+ case OP_NOT_HSPACE:
+ case OP_HSPACE:
+ for (i = min; i < max; i++)
+ {
+ BOOL gotspace;
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ switch(c)
+ {
+ default: gotspace = FALSE; break;
+ case 0x09: /* HT */
+ case 0x20: /* SPACE */
+ case 0xa0: /* NBSP */
+ case 0x1680: /* OGHAM SPACE MARK */
+ case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
+ case 0x2000: /* EN QUAD */
+ case 0x2001: /* EM QUAD */
+ case 0x2002: /* EN SPACE */
+ case 0x2003: /* EM SPACE */
+ case 0x2004: /* THREE-PER-EM SPACE */
+ case 0x2005: /* FOUR-PER-EM SPACE */
+ case 0x2006: /* SIX-PER-EM SPACE */
+ case 0x2007: /* FIGURE SPACE */
+ case 0x2008: /* PUNCTUATION SPACE */
+ case 0x2009: /* THIN SPACE */
+ case 0x200A: /* HAIR SPACE */
+ case 0x202f: /* NARROW NO-BREAK SPACE */
+ case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
+ case 0x3000: /* IDEOGRAPHIC SPACE */
+ gotspace = TRUE;
+ break;
+ }
+ if (gotspace == (ctype == OP_NOT_HSPACE)) break;
+ eptr += len;
+ }
+ break;
+
+ case OP_NOT_VSPACE:
+ case OP_VSPACE:
+ for (i = min; i < max; i++)
+ {
+ BOOL gotspace;
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ switch(c)
+ {
+ default: gotspace = FALSE; break;
+ case 0x0a: /* LF */
+ case 0x0b: /* VT */
+ case 0x0c: /* FF */
+ case 0x0d: /* CR */
+ case 0x85: /* NEL */
+ case 0x2028: /* LINE SEPARATOR */
+ case 0x2029: /* PARAGRAPH SEPARATOR */
+ gotspace = TRUE;
+ break;
+ }
+ if (gotspace == (ctype == OP_NOT_VSPACE)) break;
+ eptr += len;
+ }
+ break;
+
+ case OP_NOT_DIGIT:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c < 256 && (md->ctypes[c] & ctype_digit) != 0) break;
+ eptr+= len;
+ }
+ break;
+
+ case OP_DIGIT:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c >= 256 ||(md->ctypes[c] & ctype_digit) == 0) break;
+ eptr+= len;
+ }
+ break;
+
+ case OP_NOT_WHITESPACE:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c < 256 && (md->ctypes[c] & ctype_space) != 0) break;
+ eptr+= len;
+ }
+ break;
+
+ case OP_WHITESPACE:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c >= 256 ||(md->ctypes[c] & ctype_space) == 0) break;
+ eptr+= len;
+ }
+ break;
+
+ case OP_NOT_WORDCHAR:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c < 256 && (md->ctypes[c] & ctype_word) != 0) break;
+ eptr+= len;
+ }
+ break;
+
+ case OP_WORDCHAR:
+ for (i = min; i < max; i++)
+ {
+ int len = 1;
+ if (eptr >= md->end_subject) break;
+ GETCHARLEN(c, eptr, len);
+ if (c >= 256 || (md->ctypes[c] & ctype_word) == 0) break;
+ eptr+= len;
+ }
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+
+ /* eptr is now past the end of the maximum run */
+
+ if (possessive) continue;
+ for(;;)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM46);
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ if (eptr-- == pp) break; /* Stop if tried at original pos */
+ BACKCHAR(eptr);
+ }
+ }
+ else
+#endif /* SUPPORT_UTF8 */
+
+ /* Not UTF-8 mode */
+ {
+ switch(ctype)
+ {
+ case OP_ANY:
+ if ((ims & PCRE_DOTALL) == 0)
+ {
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || IS_NEWLINE(eptr)) break;
+ eptr++;
+ }
+ break;
+ }
+ /* For DOTALL case, fall through and treat as \C */
+
+ case OP_ANYBYTE:
+ c = max - min;
+ if (c > (unsigned int)(md->end_subject - eptr))
+ c = md->end_subject - eptr;
+ eptr += c;
+ break;
+
+ case OP_ANYNL:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ c = *eptr;
+ if (c == 0x000d)
+ {
+ if (++eptr >= md->end_subject) break;
+ if (*eptr == 0x000a) eptr++;
+ }
+ else
+ {
+ if (c != 0x000a &&
+ (md->bsr_anycrlf ||
+ (c != 0x000b && c != 0x000c && c != 0x0085)))
+ break;
+ eptr++;
+ }
+ }
+ break;
+
+ case OP_NOT_HSPACE:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ c = *eptr;
+ if (c == 0x09 || c == 0x20 || c == 0xa0) break;
+ eptr++;
+ }
+ break;
+
+ case OP_HSPACE:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ c = *eptr;
+ if (c != 0x09 && c != 0x20 && c != 0xa0) break;
+ eptr++;
+ }
+ break;
+
+ case OP_NOT_VSPACE:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ c = *eptr;
+ if (c == 0x0a || c == 0x0b || c == 0x0c || c == 0x0d || c == 0x85)
+ break;
+ eptr++;
+ }
+ break;
+
+ case OP_VSPACE:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject) break;
+ c = *eptr;
+ if (c != 0x0a && c != 0x0b && c != 0x0c && c != 0x0d && c != 0x85)
+ break;
+ eptr++;
+ }
+ break;
+
+ case OP_NOT_DIGIT:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_digit) != 0)
+ break;
+ eptr++;
+ }
+ break;
+
+ case OP_DIGIT:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_digit) == 0)
+ break;
+ eptr++;
+ }
+ break;
+
+ case OP_NOT_WHITESPACE:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_space) != 0)
+ break;
+ eptr++;
+ }
+ break;
+
+ case OP_WHITESPACE:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_space) == 0)
+ break;
+ eptr++;
+ }
+ break;
+
+ case OP_NOT_WORDCHAR:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_word) != 0)
+ break;
+ eptr++;
+ }
+ break;
+
+ case OP_WORDCHAR:
+ for (i = min; i < max; i++)
+ {
+ if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_word) == 0)
+ break;
+ eptr++;
+ }
+ break;
+
+ default:
+ RRETURN(PCRE_ERROR_INTERNAL);
+ }
+
+ /* eptr is now past the end of the maximum run */
+
+ if (possessive) continue;
+ while (eptr >= pp)
+ {
+ RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM47);
+ eptr--;
+ if (rrc != MATCH_NOMATCH) RRETURN(rrc);
+ }
+ }
+
+ /* Get here if we can't make it match with any permitted repetitions */
+
+ RRETURN(MATCH_NOMATCH);
+ }
+ /* Control never gets here */
+
+ /* There's been some horrible disaster. Arrival here can only mean there is
+ something seriously wrong in the code above or the OP_xxx definitions. */
+
+ default:
+ DPRINTF(("Unknown opcode %d\n", *ecode));
+ RRETURN(PCRE_ERROR_UNKNOWN_OPCODE);
+ }
+
+ /* Do not stick any code in here without much thought; it is assumed
+ that "continue" in the code above comes out to here to repeat the main
+ loop. */
+
+ } /* End of main loop */
+/* Control never reaches here */
+
+
+/* When compiling to use the heap rather than the stack for recursive calls to
+match(), the RRETURN() macro jumps here. The number that is saved in
+frame->Xwhere indicates which label we actually want to return to. */
+
+#ifdef NO_RECURSE
+#define LBL(val) case val: goto L_RM##val;
+HEAP_RETURN:
+switch (frame->Xwhere)
+ {
+ LBL( 1) LBL( 2) LBL( 3) LBL( 4) LBL( 5) LBL( 6) LBL( 7) LBL( 8)
+ LBL( 9) LBL(10) LBL(11) LBL(12) LBL(13) LBL(14) LBL(15) LBL(17)
+ LBL(19) LBL(24) LBL(25) LBL(26) LBL(27) LBL(29) LBL(31) LBL(33)
+ LBL(35) LBL(43) LBL(47) LBL(48) LBL(49) LBL(50) LBL(51) LBL(52)
+ LBL(53) LBL(54)
+#ifdef SUPPORT_UTF8
+ LBL(16) LBL(18) LBL(20) LBL(21) LBL(22) LBL(23) LBL(28) LBL(30)
+ LBL(32) LBL(34) LBL(42) LBL(46)
+#ifdef SUPPORT_UCP
+ LBL(36) LBL(37) LBL(38) LBL(39) LBL(40) LBL(41) LBL(44) LBL(45)
+#endif /* SUPPORT_UCP */
+#endif /* SUPPORT_UTF8 */
+ default:
+ DPRINTF(("jump error in pcre match: label %d non-existent\n", frame->Xwhere));
+ return PCRE_ERROR_INTERNAL;
+ }
+#undef LBL
+#endif /* NO_RECURSE */
+}
+
+
+/***************************************************************************
+****************************************************************************
+ RECURSION IN THE match() FUNCTION
+
+Undefine all the macros that were defined above to handle this. */
+
+#ifdef NO_RECURSE
+#undef eptr
+#undef ecode
+#undef mstart
+#undef offset_top
+#undef ims
+#undef eptrb
+#undef flags
+
+#undef callpat
+#undef charptr
+#undef data
+#undef next
+#undef pp
+#undef prev
+#undef saved_eptr
+
+#undef new_recursive
+
+#undef cur_is_word
+#undef condition
+#undef prev_is_word
+
+#undef original_ims
+
+#undef ctype
+#undef length
+#undef max
+#undef min
+#undef number
+#undef offset
+#undef op
+#undef save_capture_last
+#undef save_offset1
+#undef save_offset2
+#undef save_offset3
+#undef stacksave
+
+#undef newptrb
+
+#endif
+
+/* These two are defined as macros in both cases */
+
+#undef fc
+#undef fi
+
+/***************************************************************************
+***************************************************************************/
+
+
+
+/*************************************************
+* Execute a Regular Expression *
+*************************************************/
+
+/* This function applies a compiled re to a subject string and picks out
+portions of the string if it matches. Two elements in the vector are set for
+each substring: the offsets to the start and end of the substring.
+
+Arguments:
+ argument_re points to the compiled expression
+ extra_data points to extra data or is NULL
+ subject points to the subject string
+ length length of subject string (may contain binary zeros)
+ start_offset where to start in the subject string
+ options option bits
+ offsets points to a vector of ints to be filled in with offsets
+ offsetcount the number of elements in the vector
+
+Returns: > 0 => success; value is the number of elements filled in
+ = 0 => success, but offsets is not big enough
+ -1 => failed to match
+ < -1 => some kind of unexpected problem
+*/
+
+PCRE_EXP_DEFN int
+pcre_exec(const pcre *argument_re, const pcre_extra *extra_data,
+ PCRE_SPTR subject, int length, int start_offset, int options, int *offsets,
+ int offsetcount)
+{
+int rc, resetcount, ocount;
+int first_byte = -1;
+int req_byte = -1;
+int req_byte2 = -1;
+int newline;
+unsigned long int ims;
+BOOL using_temporary_offsets = FALSE;
+BOOL anchored;
+BOOL startline;
+BOOL firstline;
+BOOL first_byte_caseless = FALSE;
+BOOL req_byte_caseless = FALSE;
+BOOL utf8;
+match_data match_block;
+match_data *md = &match_block;
+const uschar *tables;
+const uschar *start_bits = NULL;
+USPTR start_match = (USPTR)subject + start_offset;
+USPTR end_subject;
+USPTR req_byte_ptr = start_match - 1;
+
+pcre_study_data internal_study;
+const pcre_study_data *study;
+
+real_pcre internal_re;
+const real_pcre *external_re = (const real_pcre *)argument_re;
+const real_pcre *re = external_re;
+
+/* Plausibility checks */
+
+if ((options & ~PUBLIC_EXEC_OPTIONS) != 0) return PCRE_ERROR_BADOPTION;
+if (re == NULL || subject == NULL ||
+ (offsets == NULL && offsetcount > 0)) return PCRE_ERROR_NULL;
+if (offsetcount < 0) return PCRE_ERROR_BADCOUNT;
+
+/* Fish out the optional data from the extra_data structure, first setting
+the default values. */
+
+study = NULL;
+md->match_limit = MATCH_LIMIT;
+md->match_limit_recursion = MATCH_LIMIT_RECURSION;
+md->callout_data = NULL;
+
+/* The table pointer is always in native byte order. */
+
+tables = external_re->tables;
+
+if (extra_data != NULL)
+ {
+ register unsigned int flags = extra_data->flags;
+ if ((flags & PCRE_EXTRA_STUDY_DATA) != 0)
+ study = (const pcre_study_data *)extra_data->study_data;
+ if ((flags & PCRE_EXTRA_MATCH_LIMIT) != 0)
+ md->match_limit = extra_data->match_limit;
+ if ((flags & PCRE_EXTRA_MATCH_LIMIT_RECURSION) != 0)
+ md->match_limit_recursion = extra_data->match_limit_recursion;
+ if ((flags & PCRE_EXTRA_CALLOUT_DATA) != 0)
+ md->callout_data = extra_data->callout_data;
+ if ((flags & PCRE_EXTRA_TABLES) != 0) tables = extra_data->tables;
+ }
+
+/* If the exec call supplied NULL for tables, use the inbuilt ones. This
+is a feature that makes it possible to save compiled regex and re-use them
+in other programs later. */
+
+if (tables == NULL) tables = _pcre_default_tables;
+
+/* Check that the first field in the block is the magic number. If it is not,
+test for a regex that was compiled on a host of opposite endianness. If this is
+the case, flipped values are put in internal_re and internal_study if there was
+study data too. */
+
+if (re->magic_number != MAGIC_NUMBER)
+ {
+ re = _pcre_try_flipped(re, &internal_re, study, &internal_study);
+ if (re == NULL) return PCRE_ERROR_BADMAGIC;
+ if (study != NULL) study = &internal_study;
+ }
+
+/* Set up other data */
+
+anchored = ((re->options | options) & PCRE_ANCHORED) != 0;
+startline = (re->flags & PCRE_STARTLINE) != 0;
+firstline = (re->options & PCRE_FIRSTLINE) != 0;
+
+/* The code starts after the real_pcre block and the capture name table. */
+
+md->start_code = (const uschar *)external_re + re->name_table_offset +
+ re->name_count * re->name_entry_size;
+
+md->start_subject = (USPTR)subject;
+md->start_offset = start_offset;
+md->end_subject = md->start_subject + length;
+end_subject = md->end_subject;
+
+md->endonly = (re->options & PCRE_DOLLAR_ENDONLY) != 0;
+utf8 = md->utf8 = (re->options & PCRE_UTF8) != 0;
+
+md->notbol = (options & PCRE_NOTBOL) != 0;
+md->noteol = (options & PCRE_NOTEOL) != 0;
+md->notempty = (options & PCRE_NOTEMPTY) != 0;
+md->partial = (options & PCRE_PARTIAL) != 0;
+md->hitend = FALSE;
+
+md->recursive = NULL; /* No recursion at top level */
+
+md->lcc = tables + lcc_offset;
+md->ctypes = tables + ctypes_offset;
+
+/* Handle different \R options. */
+
+switch (options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE))
+ {
+ case 0:
+ if ((re->options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) != 0)
+ md->bsr_anycrlf = (re->options & PCRE_BSR_ANYCRLF) != 0;
+ else
+#ifdef BSR_ANYCRLF
+ md->bsr_anycrlf = TRUE;
+#else
+ md->bsr_anycrlf = FALSE;
+#endif
+ break;
+
+ case PCRE_BSR_ANYCRLF:
+ md->bsr_anycrlf = TRUE;
+ break;
+
+ case PCRE_BSR_UNICODE:
+ md->bsr_anycrlf = FALSE;
+ break;
+
+ default: return PCRE_ERROR_BADNEWLINE;
+ }
+
+/* Handle different types of newline. The three bits give eight cases. If
+nothing is set at run time, whatever was used at compile time applies. */
+
+switch ((((options & PCRE_NEWLINE_BITS) == 0)? re->options :
+ (pcre_uint32)options) & PCRE_NEWLINE_BITS)
+ {
+ case 0: newline = NEWLINE; break; /* Compile-time default */
+ case PCRE_NEWLINE_CR: newline = '\r'; break;
+ case PCRE_NEWLINE_LF: newline = '\n'; break;
+ case PCRE_NEWLINE_CR+
+ PCRE_NEWLINE_LF: newline = ('\r' << 8) | '\n'; break;
+ case PCRE_NEWLINE_ANY: newline = -1; break;
+ case PCRE_NEWLINE_ANYCRLF: newline = -2; break;
+ default: return PCRE_ERROR_BADNEWLINE;
+ }
+
+if (newline == -2)
+ {
+ md->nltype = NLTYPE_ANYCRLF;
+ }
+else if (newline < 0)
+ {
+ md->nltype = NLTYPE_ANY;
+ }
+else
+ {
+ md->nltype = NLTYPE_FIXED;
+ if (newline > 255)
+ {
+ md->nllen = 2;
+ md->nl[0] = (newline >> 8) & 255;
+ md->nl[1] = newline & 255;
+ }
+ else
+ {
+ md->nllen = 1;
+ md->nl[0] = newline;
+ }
+ }
+
+/* Partial matching is supported only for a restricted set of regexes at the
+moment. */
+
+if (md->partial && (re->flags & PCRE_NOPARTIAL) != 0)
+ return PCRE_ERROR_BADPARTIAL;
+
+/* Check a UTF-8 string if required. Unfortunately there's no way of passing
+back the character offset. */
+
+#ifdef SUPPORT_UTF8
+if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0)
+ {
+ if (_pcre_valid_utf8((uschar *)subject, length) >= 0)
+ return PCRE_ERROR_BADUTF8;
+ if (start_offset > 0 && start_offset < length)
+ {
+ int tb = ((uschar *)subject)[start_offset];
+ if (tb > 127)
+ {
+ tb &= 0xc0;
+ if (tb != 0 && tb != 0xc0) return PCRE_ERROR_BADUTF8_OFFSET;
+ }
+ }
+ }
+#endif
+
+/* The ims options can vary during the matching as a result of the presence
+of (?ims) items in the pattern. They are kept in a local variable so that
+restoring at the exit of a group is easy. */
+
+ims = re->options & (PCRE_CASELESS|PCRE_MULTILINE|PCRE_DOTALL);
+
+/* If the expression has got more back references than the offsets supplied can
+hold, we get a temporary chunk of working store to use during the matching.
+Otherwise, we can use the vector supplied, rounding down its size to a multiple
+of 3. */
+
+ocount = offsetcount - (offsetcount % 3);
+
+if (re->top_backref > 0 && re->top_backref >= ocount/3)
+ {
+ ocount = re->top_backref * 3 + 3;
+ md->offset_vector = (int *)(pcre_malloc)(ocount * sizeof(int));
+ if (md->offset_vector == NULL) return PCRE_ERROR_NOMEMORY;
+ using_temporary_offsets = TRUE;
+ DPRINTF(("Got memory to hold back references\n"));
+ }
+else md->offset_vector = offsets;
+
+md->offset_end = ocount;
+md->offset_max = (2*ocount)/3;
+md->offset_overflow = FALSE;
+md->capture_last = -1;
+
+/* Compute the minimum number of offsets that we need to reset each time. Doing
+this makes a huge difference to execution time when there aren't many brackets
+in the pattern. */
+
+resetcount = 2 + re->top_bracket * 2;
+if (resetcount > offsetcount) resetcount = ocount;
+
+/* Reset the working variable associated with each extraction. These should
+never be used unless previously set, but they get saved and restored, and so we
+initialize them to avoid reading uninitialized locations. */
+
+if (md->offset_vector != NULL)
+ {
+ register int *iptr = md->offset_vector + ocount;
+ register int *iend = iptr - resetcount/2 + 1;
+ while (--iptr >= iend) *iptr = -1;
+ }
+
+/* Set up the first character to match, if available. The first_byte value is
+never set for an anchored regular expression, but the anchoring may be forced
+at run time, so we have to test for anchoring. The first char may be unset for
+an unanchored pattern, of course. If there's no first char and the pattern was
+studied, there may be a bitmap of possible first characters. */
+
+if (!anchored)
+ {
+ if ((re->flags & PCRE_FIRSTSET) != 0)
+ {
+ first_byte = re->first_byte & 255;
+ if ((first_byte_caseless = ((re->first_byte & REQ_CASELESS) != 0)) == TRUE)
+ first_byte = md->lcc[first_byte];
+ }
+ else
+ if (!startline && study != NULL &&
+ (study->options & PCRE_STUDY_MAPPED) != 0)
+ start_bits = study->start_bits;
+ }
+
+/* For anchored or unanchored matches, there may be a "last known required
+character" set. */
+
+if ((re->flags & PCRE_REQCHSET) != 0)
+ {
+ req_byte = re->req_byte & 255;
+ req_byte_caseless = (re->req_byte & REQ_CASELESS) != 0;
+ req_byte2 = (tables + fcc_offset)[req_byte]; /* case flipped */
+ }
+
+
+/* ==========================================================================*/
+
+/* Loop for handling unanchored repeated matching attempts; for anchored regexs
+the loop runs just once. */
+
+for(;;)
+ {
+ USPTR save_end_subject = end_subject;
+ USPTR new_start_match;
+
+ /* Reset the maximum number of extractions we might see. */
+
+ if (md->offset_vector != NULL)
+ {
+ register int *iptr = md->offset_vector;
+ register int *iend = iptr + resetcount;
+ while (iptr < iend) *iptr++ = -1;
+ }
+
+ /* Advance to a unique first char if possible. If firstline is TRUE, the
+ start of the match is constrained to the first line of a multiline string.
+ That is, the match must be before or at the first newline. Implement this by
+ temporarily adjusting end_subject so that we stop scanning at a newline. If
+ the match fails at the newline, later code breaks this loop. */
+
+ if (firstline)
+ {
+ USPTR t = start_match;
+ while (t < md->end_subject && !IS_NEWLINE(t)) t++;
+ end_subject = t;
+ }
+
+ /* Now test for a unique first byte */
+
+ if (first_byte >= 0)
+ {
+ if (first_byte_caseless)
+ while (start_match < end_subject &&
+ md->lcc[*start_match] != first_byte)
+ start_match++;
+ else
+ while (start_match < end_subject && *start_match != first_byte)
+ start_match++;
+ }
+
+ /* Or to just after a linebreak for a multiline match if possible */
+
+ else if (startline)
+ {
+ if (start_match > md->start_subject + start_offset)
+ {
+ while (start_match <= end_subject && !WAS_NEWLINE(start_match))
+ start_match++;
+
+ /* If we have just passed a CR and the newline option is ANY or ANYCRLF,
+ and we are now at a LF, advance the match position by one more character.
+ */
+
+ if (start_match[-1] == '\r' &&
+ (md->nltype == NLTYPE_ANY || md->nltype == NLTYPE_ANYCRLF) &&
+ start_match < end_subject &&
+ *start_match == '\n')
+ start_match++;
+ }
+ }
+
+ /* Or to a non-unique first char after study */
+
+ else if (start_bits != NULL)
+ {
+ while (start_match < end_subject)
+ {
+ register unsigned int c = *start_match;
+ if ((start_bits[c/8] & (1 << (c&7))) == 0) start_match++; else break;
+ }
+ }
+
+ /* Restore fudged end_subject */
+
+ end_subject = save_end_subject;
+
+#ifdef DEBUG /* Sigh. Some compilers never learn. */
+ printf(">>>> Match against: ");
+ pchars(start_match, end_subject - start_match, TRUE, md);
+ printf("\n");
+#endif
+
+ /* If req_byte is set, we know that that character must appear in the subject
+ for the match to succeed. If the first character is set, req_byte must be
+ later in the subject; otherwise the test starts at the match point. This
+ optimization can save a huge amount of backtracking in patterns with nested
+ unlimited repeats that aren't going to match. Writing separate code for
+ cased/caseless versions makes it go faster, as does using an autoincrement
+ and backing off on a match.
+
+ HOWEVER: when the subject string is very, very long, searching to its end can
+ take a long time, and give bad performance on quite ordinary patterns. This
+ showed up when somebody was matching something like /^\d+C/ on a 32-megabyte
+ string... so we don't do this when the string is sufficiently long.
+
+ ALSO: this processing is disabled when partial matching is requested.
+ */
+
+ if (req_byte >= 0 &&
+ end_subject - start_match < REQ_BYTE_MAX &&
+ !md->partial)
+ {
+ register USPTR p = start_match + ((first_byte >= 0)? 1 : 0);
+
+ /* We don't need to repeat the search if we haven't yet reached the
+ place we found it at last time. */
+
+ if (p > req_byte_ptr)
+ {
+ if (req_byte_caseless)
+ {
+ while (p < end_subject)
+ {
+ register int pp = *p++;
+ if (pp == req_byte || pp == req_byte2) { p--; break; }
+ }
+ }
+ else
+ {
+ while (p < end_subject)
+ {
+ if (*p++ == req_byte) { p--; break; }
+ }
+ }
+
+ /* If we can't find the required character, break the matching loop,
+ forcing a match failure. */
+
+ if (p >= end_subject)
+ {
+ rc = MATCH_NOMATCH;
+ break;
+ }
+
+ /* If we have found the required character, save the point where we
+ found it, so that we don't search again next time round the loop if
+ the start hasn't passed this character yet. */
+
+ req_byte_ptr = p;
+ }
+ }
+
+ /* OK, we can now run the match. */
+
+ md->start_match_ptr = start_match;
+ md->match_call_count = 0;
+ rc = match(start_match, md->start_code, start_match, 2, md, ims, NULL, 0, 0);
+
+ switch(rc)
+ {
+ /* NOMATCH and PRUNE advance by one character. THEN at this level acts
+ exactly like PRUNE. */
+
+ case MATCH_NOMATCH:
+ case MATCH_PRUNE:
+ case MATCH_THEN:
+ new_start_match = start_match + 1;
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ while(new_start_match < end_subject && (*new_start_match & 0xc0) == 0x80)
+ new_start_match++;
+#endif
+ break;
+
+ /* SKIP passes back the next starting point explicitly. */
+
+ case MATCH_SKIP:
+ new_start_match = md->start_match_ptr;
+ break;
+
+ /* COMMIT disables the bumpalong, but otherwise behaves as NOMATCH. */
+
+ case MATCH_COMMIT:
+ rc = MATCH_NOMATCH;
+ goto ENDLOOP;
+
+ /* Any other return is some kind of error. */
+
+ default:
+ goto ENDLOOP;
+ }
+
+ /* Control reaches here for the various types of "no match at this point"
+ result. Reset the code to MATCH_NOMATCH for subsequent checking. */
+
+ rc = MATCH_NOMATCH;
+
+ /* If PCRE_FIRSTLINE is set, the match must happen before or at the first
+ newline in the subject (though it may continue over the newline). Therefore,
+ if we have just failed to match, starting at a newline, do not continue. */
+
+ if (firstline && IS_NEWLINE(start_match)) break;
+
+ /* Advance to new matching position */
+
+ start_match = new_start_match;
+
+ /* Break the loop if the pattern is anchored or if we have passed the end of
+ the subject. */
+
+ if (anchored || start_match > end_subject) break;
+
+ /* If we have just passed a CR and we are now at a LF, and the pattern does
+ not contain any explicit matches for \r or \n, and the newline option is CRLF
+ or ANY or ANYCRLF, advance the match position by one more character. */
+
+ if (start_match[-1] == '\r' &&
+ start_match < end_subject &&
+ *start_match == '\n' &&
+ (re->flags & PCRE_HASCRORLF) == 0 &&
+ (md->nltype == NLTYPE_ANY ||
+ md->nltype == NLTYPE_ANYCRLF ||
+ md->nllen == 2))
+ start_match++;
+
+ } /* End of for(;;) "bumpalong" loop */
+
+/* ==========================================================================*/
+
+/* We reach here when rc is not MATCH_NOMATCH, or if one of the stopping
+conditions is true:
+
+(1) The pattern is anchored or the match was failed by (*COMMIT);
+
+(2) We are past the end of the subject;
+
+(3) PCRE_FIRSTLINE is set and we have failed to match at a newline, because
+ this option requests that a match occur at or before the first newline in
+ the subject.
+
+When we have a match and the offset vector is big enough to deal with any
+backreferences, captured substring offsets will already be set up. In the case
+where we had to get some local store to hold offsets for backreference
+processing, copy those that we can. In this case there need not be overflow if
+certain parts of the pattern were not used, even though there are more
+capturing parentheses than vector slots. */
+
+ENDLOOP:
+
+if (rc == MATCH_MATCH)
+ {
+ if (using_temporary_offsets)
+ {
+ if (offsetcount >= 4)
+ {
+ memcpy(offsets + 2, md->offset_vector + 2,
+ (offsetcount - 2) * sizeof(int));
+ DPRINTF(("Copied offsets from temporary memory\n"));
+ }
+ if (md->end_offset_top > offsetcount) md->offset_overflow = TRUE;
+ DPRINTF(("Freeing temporary memory\n"));
+ (pcre_free)(md->offset_vector);
+ }
+
+ /* Set the return code to the number of captured strings, or 0 if there are
+ too many to fit into the vector. */
+
+ rc = md->offset_overflow? 0 : md->end_offset_top/2;
+
+ /* If there is space, set up the whole thing as substring 0. The value of
+ md->start_match_ptr might be modified if \K was encountered on the success
+ matching path. */
+
+ if (offsetcount < 2) rc = 0; else
+ {
+ offsets[0] = md->start_match_ptr - md->start_subject;
+ offsets[1] = md->end_match_ptr - md->start_subject;
+ }
+
+ DPRINTF((">>>> returning %d\n", rc));
+ return rc;
+ }
+
+/* Control gets here if there has been an error, or if the overall match
+attempt has failed at all permitted starting positions. */
+
+if (using_temporary_offsets)
+ {
+ DPRINTF(("Freeing temporary memory\n"));
+ (pcre_free)(md->offset_vector);
+ }
+
+if (rc != MATCH_NOMATCH)
+ {
+ DPRINTF((">>>> error: returning %d\n", rc));
+ return rc;
+ }
+else if (md->partial && md->hitend)
+ {
+ DPRINTF((">>>> returning PCRE_ERROR_PARTIAL\n"));
+ return PCRE_ERROR_PARTIAL;
+ }
+else
+ {
+ DPRINTF((">>>> returning PCRE_ERROR_NOMATCH\n"));
+ return PCRE_ERROR_NOMATCH;
+ }
+}
+
+/* End of pcre_exec.c */
diff --git a/src/plugins/PCREPlugin/pcre_fullinfo.c b/src/plugins/PCREPlugin/pcre_fullinfo.c
new file mode 100644
index 0000000..04e31f6
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_fullinfo.c
@@ -0,0 +1,165 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/*PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_fullinfo(), which returns
+information about a compiled pattern. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Return info about compiled pattern *
+*************************************************/
+
+/* This is a newer "info" function which has an extensible interface so
+that additional items can be added compatibly.
+
+Arguments:
+ argument_re points to compiled code
+ extra_data points extra data, or NULL
+ what what information is required
+ where where to put the information
+
+Returns: 0 if data returned, negative on error
+*/
+
+PCRE_EXP_DEFN int
+pcre_fullinfo(const pcre *argument_re, const pcre_extra *extra_data, int what,
+ void *where)
+{
+real_pcre internal_re;
+pcre_study_data internal_study;
+const real_pcre *re = (const real_pcre *)argument_re;
+const pcre_study_data *study = NULL;
+
+if (re == NULL || where == NULL) return PCRE_ERROR_NULL;
+
+if (extra_data != NULL && (extra_data->flags & PCRE_EXTRA_STUDY_DATA) != 0)
+ study = (const pcre_study_data *)extra_data->study_data;
+
+if (re->magic_number != MAGIC_NUMBER)
+ {
+ re = _pcre_try_flipped(re, &internal_re, study, &internal_study);
+ if (re == NULL) return PCRE_ERROR_BADMAGIC;
+ if (study != NULL) study = &internal_study;
+ }
+
+switch (what)
+ {
+ case PCRE_INFO_OPTIONS:
+ *((unsigned long int *)where) = re->options & PUBLIC_OPTIONS;
+ break;
+
+ case PCRE_INFO_SIZE:
+ *((size_t *)where) = re->size;
+ break;
+
+ case PCRE_INFO_STUDYSIZE:
+ *((size_t *)where) = (study == NULL)? 0 : study->size;
+ break;
+
+ case PCRE_INFO_CAPTURECOUNT:
+ *((int *)where) = re->top_bracket;
+ break;
+
+ case PCRE_INFO_BACKREFMAX:
+ *((int *)where) = re->top_backref;
+ break;
+
+ case PCRE_INFO_FIRSTBYTE:
+ *((int *)where) =
+ ((re->flags & PCRE_FIRSTSET) != 0)? re->first_byte :
+ ((re->flags & PCRE_STARTLINE) != 0)? -1 : -2;
+ break;
+
+ /* Make sure we pass back the pointer to the bit vector in the external
+ block, not the internal copy (with flipped integer fields). */
+
+ case PCRE_INFO_FIRSTTABLE:
+ *((const uschar **)where) =
+ (study != NULL && (study->options & PCRE_STUDY_MAPPED) != 0)?
+ ((const pcre_study_data *)extra_data->study_data)->start_bits : NULL;
+ break;
+
+ case PCRE_INFO_LASTLITERAL:
+ *((int *)where) =
+ ((re->flags & PCRE_REQCHSET) != 0)? re->req_byte : -1;
+ break;
+
+ case PCRE_INFO_NAMEENTRYSIZE:
+ *((int *)where) = re->name_entry_size;
+ break;
+
+ case PCRE_INFO_NAMECOUNT:
+ *((int *)where) = re->name_count;
+ break;
+
+ case PCRE_INFO_NAMETABLE:
+ *((const uschar **)where) = (const uschar *)re + re->name_table_offset;
+ break;
+
+ case PCRE_INFO_DEFAULT_TABLES:
+ *((const uschar **)where) = (const uschar *)(_pcre_default_tables);
+ break;
+
+ case PCRE_INFO_OKPARTIAL:
+ *((int *)where) = (re->flags & PCRE_NOPARTIAL) == 0;
+ break;
+
+ case PCRE_INFO_JCHANGED:
+ *((int *)where) = (re->flags & PCRE_JCHANGED) != 0;
+ break;
+
+ case PCRE_INFO_HASCRORLF:
+ *((int *)where) = (re->flags & PCRE_HASCRORLF) != 0;
+ break;
+
+ default: return PCRE_ERROR_BADOPTION;
+ }
+
+return 0;
+}
+
+/* End of pcre_fullinfo.c */
diff --git a/src/plugins/PCREPlugin/pcre_get.c b/src/plugins/PCREPlugin/pcre_get.c
new file mode 100644
index 0000000..fc283c8
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_get.c
@@ -0,0 +1,465 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains some convenience functions for extracting substrings
+from the subject string after a regex match has succeeded. The original idea
+for these functions came from Scott Wimer. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Find number for named string *
+*************************************************/
+
+/* This function is used by the get_first_set() function below, as well
+as being generally available. It assumes that names are unique.
+
+Arguments:
+ code the compiled regex
+ stringname the name whose number is required
+
+Returns: the number of the named parentheses, or a negative number
+ (PCRE_ERROR_NOSUBSTRING) if not found
+*/
+
+int
+pcre_get_stringnumber(const pcre *code, const char *stringname)
+{
+int rc;
+int entrysize;
+int top, bot;
+uschar *nametable;
+
+if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
+ return rc;
+if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
+
+if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMEENTRYSIZE, &entrysize)) != 0)
+ return rc;
+if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMETABLE, &nametable)) != 0)
+ return rc;
+
+bot = 0;
+while (top > bot)
+ {
+ int mid = (top + bot) / 2;
+ uschar *entry = nametable + entrysize*mid;
+ int c = strcmp(stringname, (char *)(entry + 2));
+ if (c == 0) return (entry[0] << 8) + entry[1];
+ if (c > 0) bot = mid + 1; else top = mid;
+ }
+
+return PCRE_ERROR_NOSUBSTRING;
+}
+
+
+
+/*************************************************
+* Find (multiple) entries for named string *
+*************************************************/
+
+/* This is used by the get_first_set() function below, as well as being
+generally available. It is used when duplicated names are permitted.
+
+Arguments:
+ code the compiled regex
+ stringname the name whose entries required
+ firstptr where to put the pointer to the first entry
+ lastptr where to put the pointer to the last entry
+
+Returns: the length of each entry, or a negative number
+ (PCRE_ERROR_NOSUBSTRING) if not found
+*/
+
+int
+pcre_get_stringtable_entries(const pcre *code, const char *stringname,
+ char **firstptr, char **lastptr)
+{
+int rc;
+int entrysize;
+int top, bot;
+uschar *nametable, *lastentry;
+
+if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0)
+ return rc;
+if (top <= 0) return PCRE_ERROR_NOSUBSTRING;
+
+if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMEENTRYSIZE, &entrysize)) != 0)
+ return rc;
+if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMETABLE, &nametable)) != 0)
+ return rc;
+
+lastentry = nametable + entrysize * (top - 1);
+bot = 0;
+while (top > bot)
+ {
+ int mid = (top + bot) / 2;
+ uschar *entry = nametable + entrysize*mid;
+ int c = strcmp(stringname, (char *)(entry + 2));
+ if (c == 0)
+ {
+ uschar *first = entry;
+ uschar *last = entry;
+ while (first > nametable)
+ {
+ if (strcmp(stringname, (char *)(first - entrysize + 2)) != 0) break;
+ first -= entrysize;
+ }
+ while (last < lastentry)
+ {
+ if (strcmp(stringname, (char *)(last + entrysize + 2)) != 0) break;
+ last += entrysize;
+ }
+ *firstptr = (char *)first;
+ *lastptr = (char *)last;
+ return entrysize;
+ }
+ if (c > 0) bot = mid + 1; else top = mid;
+ }
+
+return PCRE_ERROR_NOSUBSTRING;
+}
+
+
+
+/*************************************************
+* Find first set of multiple named strings *
+*************************************************/
+
+/* This function allows for duplicate names in the table of named substrings.
+It returns the number of the first one that was set in a pattern match.
+
+Arguments:
+ code the compiled regex
+ stringname the name of the capturing substring
+ ovector the vector of matched substrings
+
+Returns: the number of the first that is set,
+ or the number of the last one if none are set,
+ or a negative number on error
+*/
+
+static int
+get_first_set(const pcre *code, const char *stringname, int *ovector)
+{
+const real_pcre *re = (const real_pcre *)code;
+int entrysize;
+char *first, *last;
+uschar *entry;
+if ((re->options & PCRE_DUPNAMES) == 0 && (re->flags & PCRE_JCHANGED) == 0)
+ return pcre_get_stringnumber(code, stringname);
+entrysize = pcre_get_stringtable_entries(code, stringname, &first, &last);
+if (entrysize <= 0) return entrysize;
+for (entry = (uschar *)first; entry <= (uschar *)last; entry += entrysize)
+ {
+ int n = (entry[0] << 8) + entry[1];
+ if (ovector[n*2] >= 0) return n;
+ }
+return (first[0] << 8) + first[1];
+}
+
+
+
+
+/*************************************************
+* Copy captured string to given buffer *
+*************************************************/
+
+/* This function copies a single captured substring into a given buffer.
+Note that we use memcpy() rather than strncpy() in case there are binary zeros
+in the string.
+
+Arguments:
+ subject the subject string that was matched
+ ovector pointer to the offsets table
+ stringcount the number of substrings that were captured
+ (i.e. the yield of the pcre_exec call, unless
+ that was zero, in which case it should be 1/3
+ of the offset table size)
+ stringnumber the number of the required substring
+ buffer where to put the substring
+ size the size of the buffer
+
+Returns: if successful:
+ the length of the copied string, not including the zero
+ that is put on the end; can be zero
+ if not successful:
+ PCRE_ERROR_NOMEMORY (-6) buffer too small
+ PCRE_ERROR_NOSUBSTRING (-7) no such captured substring
+*/
+
+int
+pcre_copy_substring(const char *subject, int *ovector, int stringcount,
+ int stringnumber, char *buffer, int size)
+{
+int yield;
+if (stringnumber < 0 || stringnumber >= stringcount)
+ return PCRE_ERROR_NOSUBSTRING;
+stringnumber *= 2;
+yield = ovector[stringnumber+1] - ovector[stringnumber];
+if (size < yield + 1) return PCRE_ERROR_NOMEMORY;
+memcpy(buffer, subject + ovector[stringnumber], yield);
+buffer[yield] = 0;
+return yield;
+}
+
+
+
+/*************************************************
+* Copy named captured string to given buffer *
+*************************************************/
+
+/* This function copies a single captured substring into a given buffer,
+identifying it by name. If the regex permits duplicate names, the first
+substring that is set is chosen.
+
+Arguments:
+ code the compiled regex
+ subject the subject string that was matched
+ ovector pointer to the offsets table
+ stringcount the number of substrings that were captured
+ (i.e. the yield of the pcre_exec call, unless
+ that was zero, in which case it should be 1/3
+ of the offset table size)
+ stringname the name of the required substring
+ buffer where to put the substring
+ size the size of the buffer
+
+Returns: if successful:
+ the length of the copied string, not including the zero
+ that is put on the end; can be zero
+ if not successful:
+ PCRE_ERROR_NOMEMORY (-6) buffer too small
+ PCRE_ERROR_NOSUBSTRING (-7) no such captured substring
+*/
+
+int
+pcre_copy_named_substring(const pcre *code, const char *subject, int *ovector,
+ int stringcount, const char *stringname, char *buffer, int size)
+{
+int n = get_first_set(code, stringname, ovector);
+if (n <= 0) return n;
+return pcre_copy_substring(subject, ovector, stringcount, n, buffer, size);
+}
+
+
+
+/*************************************************
+* Copy all captured strings to new store *
+*************************************************/
+
+/* This function gets one chunk of store and builds a list of pointers and all
+of the captured substrings in it. A NULL pointer is put on the end of the list.
+
+Arguments:
+ subject the subject string that was matched
+ ovector pointer to the offsets table
+ stringcount the number of substrings that were captured
+ (i.e. the yield of the pcre_exec call, unless
+ that was zero, in which case it should be 1/3
+ of the offset table size)
+ listptr set to point to the list of pointers
+
+Returns: if successful: 0
+ if not successful:
+ PCRE_ERROR_NOMEMORY (-6) failed to get store
+*/
+
+int
+pcre_get_substring_list(const char *subject, int *ovector, int stringcount,
+ const char ***listptr)
+{
+int i;
+int size = sizeof(char *);
+int double_count = stringcount * 2;
+char **stringlist;
+char *p;
+
+for (i = 0; i < double_count; i += 2)
+ size += sizeof(char *) + ovector[i+1] - ovector[i] + 1;
+
+stringlist = (char **)(pcre_malloc)(size);
+if (stringlist == NULL) return PCRE_ERROR_NOMEMORY;
+
+*listptr = (const char **)stringlist;
+p = (char *)(stringlist + stringcount + 1);
+
+for (i = 0; i < double_count; i += 2)
+ {
+ int len = ovector[i+1] - ovector[i];
+ memcpy(p, subject + ovector[i], len);
+ *stringlist++ = p;
+ p += len;
+ *p++ = 0;
+ }
+
+*stringlist = NULL;
+return 0;
+}
+
+
+
+/*************************************************
+* Free store obtained by get_substring_list *
+*************************************************/
+
+/* This function exists for the benefit of people calling PCRE from non-C
+programs that can call its functions, but not free() or (pcre_free)() directly.
+
+Argument: the result of a previous pcre_get_substring_list()
+Returns: nothing
+*/
+
+void
+pcre_free_substring_list(const char **pointer)
+{
+(pcre_free)((void *)pointer);
+}
+
+
+
+/*************************************************
+* Copy captured string to new store *
+*************************************************/
+
+/* This function copies a single captured substring into a piece of new
+store
+
+Arguments:
+ subject the subject string that was matched
+ ovector pointer to the offsets table
+ stringcount the number of substrings that were captured
+ (i.e. the yield of the pcre_exec call, unless
+ that was zero, in which case it should be 1/3
+ of the offset table size)
+ stringnumber the number of the required substring
+ stringptr where to put a pointer to the substring
+
+Returns: if successful:
+ the length of the string, not including the zero that
+ is put on the end; can be zero
+ if not successful:
+ PCRE_ERROR_NOMEMORY (-6) failed to get store
+ PCRE_ERROR_NOSUBSTRING (-7) substring not present
+*/
+
+int
+pcre_get_substring(const char *subject, int *ovector, int stringcount,
+ int stringnumber, const char **stringptr)
+{
+int yield;
+char *substring;
+if (stringnumber < 0 || stringnumber >= stringcount)
+ return PCRE_ERROR_NOSUBSTRING;
+stringnumber *= 2;
+yield = ovector[stringnumber+1] - ovector[stringnumber];
+substring = (char *)(pcre_malloc)(yield + 1);
+if (substring == NULL) return PCRE_ERROR_NOMEMORY;
+memcpy(substring, subject + ovector[stringnumber], yield);
+substring[yield] = 0;
+*stringptr = substring;
+return yield;
+}
+
+
+
+/*************************************************
+* Copy named captured string to new store *
+*************************************************/
+
+/* This function copies a single captured substring, identified by name, into
+new store. If the regex permits duplicate names, the first substring that is
+set is chosen.
+
+Arguments:
+ code the compiled regex
+ subject the subject string that was matched
+ ovector pointer to the offsets table
+ stringcount the number of substrings that were captured
+ (i.e. the yield of the pcre_exec call, unless
+ that was zero, in which case it should be 1/3
+ of the offset table size)
+ stringname the name of the required substring
+ stringptr where to put the pointer
+
+Returns: if successful:
+ the length of the copied string, not including the zero
+ that is put on the end; can be zero
+ if not successful:
+ PCRE_ERROR_NOMEMORY (-6) couldn't get memory
+ PCRE_ERROR_NOSUBSTRING (-7) no such captured substring
+*/
+
+int
+pcre_get_named_substring(const pcre *code, const char *subject, int *ovector,
+ int stringcount, const char *stringname, const char **stringptr)
+{
+int n = get_first_set(code, stringname, ovector);
+if (n <= 0) return n;
+return pcre_get_substring(subject, ovector, stringcount, n, stringptr);
+}
+
+
+
+
+/*************************************************
+* Free store obtained by get_substring *
+*************************************************/
+
+/* This function exists for the benefit of people calling PCRE from non-C
+programs that can call its functions, but not free() or (pcre_free)() directly.
+
+Argument: the result of a previous pcre_get_substring()
+Returns: nothing
+*/
+
+void
+pcre_free_substring(const char *pointer)
+{
+(pcre_free)((void *)pointer);
+}
+
+/* End of pcre_get.c */
diff --git a/src/plugins/PCREPlugin/pcre_globals.c b/src/plugins/PCREPlugin/pcre_globals.c
new file mode 100644
index 0000000..4794819
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_globals.c
@@ -0,0 +1,63 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains global variables that are exported by the PCRE library.
+PCRE is thread-clean and doesn't use any global variables in the normal sense.
+However, it calls memory allocation and freeing functions via the four
+indirections below, and it can optionally do callouts, using the fifth
+indirection. These values can be changed by the caller, but are shared between
+all threads. However, when compiling for Virtual Pascal, things are done
+differently, and global variables are not used (see pcre.in). */
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+#ifndef VPCOMPAT
+PCRE_EXP_DATA_DEFN void *(*pcre_malloc)(size_t) = malloc;
+PCRE_EXP_DATA_DEFN void (*pcre_free)(void *) = free;
+PCRE_EXP_DATA_DEFN void *(*pcre_stack_malloc)(size_t) = malloc;
+PCRE_EXP_DATA_DEFN void (*pcre_stack_free)(void *) = free;
+PCRE_EXP_DATA_DEFN int (*pcre_callout)(pcre_callout_block *) = NULL;
+#endif
+
+/* End of pcre_globals.c */
diff --git a/src/plugins/PCREPlugin/pcre_info.c b/src/plugins/PCREPlugin/pcre_info.c
new file mode 100644
index 0000000..9bcccbc
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_info.c
@@ -0,0 +1,93 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_info(), which gives some
+information about a compiled pattern. However, use of this function is now
+deprecated, as it has been superseded by pcre_fullinfo(). */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* (Obsolete) Return info about compiled pattern *
+*************************************************/
+
+/* This is the original "info" function. It picks potentially useful data out
+of the private structure, but its interface was too rigid. It remains for
+backwards compatibility. The public options are passed back in an int - though
+the re->options field has been expanded to a long int, all the public options
+at the low end of it, and so even on 16-bit systems this will still be OK.
+Therefore, I haven't changed the API for pcre_info().
+
+Arguments:
+ argument_re points to compiled code
+ optptr where to pass back the options
+ first_byte where to pass back the first character,
+ or -1 if multiline and all branches start ^,
+ or -2 otherwise
+
+Returns: number of capturing subpatterns
+ or negative values on error
+*/
+
+PCRE_EXP_DEFN int
+pcre_info(const pcre *argument_re, int *optptr, int *first_byte)
+{
+real_pcre internal_re;
+const real_pcre *re = (const real_pcre *)argument_re;
+if (re == NULL) return PCRE_ERROR_NULL;
+if (re->magic_number != MAGIC_NUMBER)
+ {
+ re = _pcre_try_flipped(re, &internal_re, NULL, NULL);
+ if (re == NULL) return PCRE_ERROR_BADMAGIC;
+ }
+if (optptr != NULL) *optptr = (int)(re->options & PUBLIC_OPTIONS);
+if (first_byte != NULL)
+ *first_byte = ((re->flags & PCRE_FIRSTSET) != 0)? re->first_byte :
+ ((re->flags & PCRE_STARTLINE) != 0)? -1 : -2;
+return re->top_bracket;
+}
+
+/* End of pcre_info.c */
diff --git a/src/plugins/PCREPlugin/pcre_internal.h b/src/plugins/PCREPlugin/pcre_internal.h
new file mode 100644
index 0000000..1d691c3
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_internal.h
@@ -0,0 +1,1118 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+#include "config.h"
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+/* This header contains definitions that are shared between the different
+modules, but which are not relevant to the exported API. This includes some
+functions whose names all begin with "_pcre_". */
+
+#ifndef PCRE_INTERNAL_H
+#define PCRE_INTERNAL_H
+
+/* Define DEBUG to get debugging output on stdout. */
+
+#if 0
+#define DEBUG
+#endif
+
+/* Use a macro for debugging printing, 'cause that eliminates the use of #ifdef
+inline, and there are *still* stupid compilers about that don't like indented
+pre-processor statements, or at least there were when I first wrote this. After
+all, it had only been about 10 years then...
+
+It turns out that the Mac Debugging.h header also defines the macro DPRINTF, so
+be absolutely sure we get our version. */
+
+#undef DPRINTF
+#ifdef DEBUG
+#define DPRINTF(p) printf p
+#else
+#define DPRINTF(p) /* Nothing */
+#endif
+
+
+/* Standard C headers plus the external interface definition. The only time
+setjmp and stdarg are used is when NO_RECURSE is set. */
+
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+
+/* When compiling a DLL for Windows, the exported symbols have to be declared
+using some MS magic. I found some useful information on this web page:
+http://msdn2.microsoft.com/en-us/library/y4h7bcy6(VS.80).aspx. According to the
+information there, using __declspec(dllexport) without "extern" we have a
+definition; with "extern" we have a declaration. The settings here override the
+setting in pcre.h (which is included below); it defines only PCRE_EXP_DECL,
+which is all that is needed for applications (they just import the symbols). We
+use:
+
+ PCRE_EXP_DECL for declarations
+ PCRE_EXP_DEFN for definitions of exported functions
+ PCRE_EXP_DATA_DEFN for definitions of exported variables
+
+The reason for the two DEFN macros is that in non-Windows environments, one
+does not want to have "extern" before variable definitions because it leads to
+compiler warnings. So we distinguish between functions and variables. In
+Windows, the two should always be the same.
+
+The reason for wrapping this in #ifndef PCRE_EXP_DECL is so that pcretest,
+which is an application, but needs to import this file in order to "peek" at
+internals, can #include pcre.h first to get an application's-eye view.
+
+In principle, people compiling for non-Windows, non-Unix-like (i.e. uncommon,
+special-purpose environments) might want to stick other stuff in front of
+exported symbols. That's why, in the non-Windows case, we set PCRE_EXP_DEFN and
+PCRE_EXP_DATA_DEFN only if they are not already set. */
+
+#ifndef PCRE_EXP_DECL
+# ifdef _WIN32
+# ifndef PCRE_STATIC
+# define PCRE_EXP_DECL extern __declspec(dllexport)
+# define PCRE_EXP_DEFN __declspec(dllexport)
+# define PCRE_EXP_DATA_DEFN __declspec(dllexport)
+# else
+# define PCRE_EXP_DECL extern
+# define PCRE_EXP_DEFN
+# define PCRE_EXP_DATA_DEFN
+# endif
+# else
+# ifdef __cplusplus
+# define PCRE_EXP_DECL extern "C"
+# else
+# define PCRE_EXP_DECL extern
+# endif
+# ifndef PCRE_EXP_DEFN
+# define PCRE_EXP_DEFN PCRE_EXP_DECL
+# endif
+# ifndef PCRE_EXP_DATA_DEFN
+# define PCRE_EXP_DATA_DEFN
+# endif
+# endif
+#endif
+
+/* We need to have types that specify unsigned 16-bit and 32-bit integers. We
+cannot determine these outside the compilation (e.g. by running a program as
+part of "configure") because PCRE is often cross-compiled for use on other
+systems. Instead we make use of the maximum sizes that are available at
+preprocessor time in standard C environments. */
+
+#if USHRT_MAX == 65535
+ typedef unsigned short pcre_uint16;
+#elif UINT_MAX == 65535
+ typedef unsigned int pcre_uint16;
+#else
+ #error Cannot determine a type for 16-bit unsigned integers
+#endif
+
+#if UINT_MAX == 4294967295
+ typedef unsigned int pcre_uint32;
+#elif ULONG_MAX == 4294967295
+ typedef unsigned long int pcre_uint32;
+#else
+ #error Cannot determine a type for 32-bit unsigned integers
+#endif
+
+/* All character handling must be done as unsigned characters. Otherwise there
+are problems with top-bit-set characters and functions such as isspace().
+However, we leave the interface to the outside world as char *, because that
+should make things easier for callers. We define a short type for unsigned char
+to save lots of typing. I tried "uchar", but it causes problems on Digital
+Unix, where it is defined in sys/types, so use "uschar" instead. */
+
+typedef unsigned char uschar;
+
+/* This is an unsigned int value that no character can ever have. UTF-8
+characters only go up to 0x7fffffff (though Unicode doesn't go beyond
+0x0010ffff). */
+
+#define NOTACHAR 0xffffffff
+
+/* PCRE is able to support several different kinds of newline (CR, LF, CRLF,
+"any" and "anycrlf" at present). The following macros are used to package up
+testing for newlines. NLBLOCK, PSSTART, and PSEND are defined in the various
+modules to indicate in which datablock the parameters exist, and what the
+start/end of string field names are. */
+
+#define NLTYPE_FIXED 0 /* Newline is a fixed length string */
+#define NLTYPE_ANY 1 /* Newline is any Unicode line ending */
+#define NLTYPE_ANYCRLF 2 /* Newline is CR, LF, or CRLF */
+
+/* This macro checks for a newline at the given position */
+
+#define IS_NEWLINE(p) \
+ ((NLBLOCK->nltype != NLTYPE_FIXED)? \
+ ((p) < NLBLOCK->PSEND && \
+ _pcre_is_newline((p), NLBLOCK->nltype, NLBLOCK->PSEND, &(NLBLOCK->nllen),\
+ utf8)) \
+ : \
+ ((p) <= NLBLOCK->PSEND - NLBLOCK->nllen && \
+ (p)[0] == NLBLOCK->nl[0] && \
+ (NLBLOCK->nllen == 1 || (p)[1] == NLBLOCK->nl[1]) \
+ ) \
+ )
+
+/* This macro checks for a newline immediately preceding the given position */
+
+#define WAS_NEWLINE(p) \
+ ((NLBLOCK->nltype != NLTYPE_FIXED)? \
+ ((p) > NLBLOCK->PSSTART && \
+ _pcre_was_newline((p), NLBLOCK->nltype, NLBLOCK->PSSTART, \
+ &(NLBLOCK->nllen), utf8)) \
+ : \
+ ((p) >= NLBLOCK->PSSTART + NLBLOCK->nllen && \
+ (p)[-NLBLOCK->nllen] == NLBLOCK->nl[0] && \
+ (NLBLOCK->nllen == 1 || (p)[-NLBLOCK->nllen+1] == NLBLOCK->nl[1]) \
+ ) \
+ )
+
+/* When PCRE is compiled as a C++ library, the subject pointer can be replaced
+with a custom type. This makes it possible, for example, to allow pcre_exec()
+to process subject strings that are discontinuous by using a smart pointer
+class. It must always be possible to inspect all of the subject string in
+pcre_exec() because of the way it backtracks. Two macros are required in the
+normal case, for sign-unspecified and unsigned char pointers. The former is
+used for the external interface and appears in pcre.h, which is why its name
+must begin with PCRE_. */
+
+#ifdef CUSTOM_SUBJECT_PTR
+#define PCRE_SPTR CUSTOM_SUBJECT_PTR
+#define USPTR CUSTOM_SUBJECT_PTR
+#else
+#define PCRE_SPTR const char *
+#define USPTR const unsigned char *
+#endif
+
+
+
+/* Include the public PCRE header and the definitions of UCP character property
+values. */
+
+#include "pcre.h"
+#include "ucp.h"
+
+/* When compiling for use with the Virtual Pascal compiler, these functions
+need to have their names changed. PCRE must be compiled with the -DVPCOMPAT
+option on the command line. */
+
+#ifdef VPCOMPAT
+#define strlen(s) _strlen(s)
+#define strncmp(s1,s2,m) _strncmp(s1,s2,m)
+#define memcmp(s,c,n) _memcmp(s,c,n)
+#define memcpy(d,s,n) _memcpy(d,s,n)
+#define memmove(d,s,n) _memmove(d,s,n)
+#define memset(s,c,n) _memset(s,c,n)
+#else /* VPCOMPAT */
+
+/* To cope with SunOS4 and other systems that lack memmove() but have bcopy(),
+define a macro for memmove() if HAVE_MEMMOVE is false, provided that HAVE_BCOPY
+is set. Otherwise, include an emulating function for those systems that have
+neither (there some non-Unix environments where this is the case). */
+
+#ifndef HAVE_MEMMOVE
+#undef memmove /* some systems may have a macro */
+#ifdef HAVE_BCOPY
+#define memmove(a, b, c) bcopy(b, a, c)
+#else /* HAVE_BCOPY */
+static void *
+pcre_memmove(void *d, const void *s, size_t n)
+{
+size_t i;
+unsigned char *dest = (unsigned char *)d;
+const unsigned char *src = (const unsigned char *)s;
+if (dest > src)
+ {
+ dest += n;
+ src += n;
+ for (i = 0; i < n; ++i) *(--dest) = *(--src);
+ return (void *)dest;
+ }
+else
+ {
+ for (i = 0; i < n; ++i) *dest++ = *src++;
+ return (void *)(dest - n);
+ }
+}
+#define memmove(a, b, c) pcre_memmove(a, b, c)
+#endif /* not HAVE_BCOPY */
+#endif /* not HAVE_MEMMOVE */
+#endif /* not VPCOMPAT */
+
+
+/* PCRE keeps offsets in its compiled code as 2-byte quantities (always stored
+in big-endian order) by default. These are used, for example, to link from the
+start of a subpattern to its alternatives and its end. The use of 2 bytes per
+offset limits the size of the compiled regex to around 64K, which is big enough
+for almost everybody. However, I received a request for an even bigger limit.
+For this reason, and also to make the code easier to maintain, the storing and
+loading of offsets from the byte string is now handled by the macros that are
+defined here.
+
+The macros are controlled by the value of LINK_SIZE. This defaults to 2 in
+the config.h file, but can be overridden by using -D on the command line. This
+is automated on Unix systems via the "configure" command. */
+
+#if LINK_SIZE == 2
+
+#define PUT(a,n,d) \
+ (a[n] = (d) >> 8), \
+ (a[(n)+1] = (d) & 255)
+
+#define GET(a,n) \
+ (((a)[n] << 8) | (a)[(n)+1])
+
+#define MAX_PATTERN_SIZE (1 << 16)
+
+
+#elif LINK_SIZE == 3
+
+#define PUT(a,n,d) \
+ (a[n] = (d) >> 16), \
+ (a[(n)+1] = (d) >> 8), \
+ (a[(n)+2] = (d) & 255)
+
+#define GET(a,n) \
+ (((a)[n] << 16) | ((a)[(n)+1] << 8) | (a)[(n)+2])
+
+#define MAX_PATTERN_SIZE (1 << 24)
+
+
+#elif LINK_SIZE == 4
+
+#define PUT(a,n,d) \
+ (a[n] = (d) >> 24), \
+ (a[(n)+1] = (d) >> 16), \
+ (a[(n)+2] = (d) >> 8), \
+ (a[(n)+3] = (d) & 255)
+
+#define GET(a,n) \
+ (((a)[n] << 24) | ((a)[(n)+1] << 16) | ((a)[(n)+2] << 8) | (a)[(n)+3])
+
+#define MAX_PATTERN_SIZE (1 << 30) /* Keep it positive */
+
+
+#else
+#error LINK_SIZE must be either 2, 3, or 4
+#endif
+
+
+/* Convenience macro defined in terms of the others */
+
+#define PUTINC(a,n,d) PUT(a,n,d), a += LINK_SIZE
+
+
+/* PCRE uses some other 2-byte quantities that do not change when the size of
+offsets changes. There are used for repeat counts and for other things such as
+capturing parenthesis numbers in back references. */
+
+#define PUT2(a,n,d) \
+ a[n] = (d) >> 8; \
+ a[(n)+1] = (d) & 255
+
+#define GET2(a,n) \
+ (((a)[n] << 8) | (a)[(n)+1])
+
+#define PUT2INC(a,n,d) PUT2(a,n,d), a += 2
+
+
+/* When UTF-8 encoding is being used, a character is no longer just a single
+byte. The macros for character handling generate simple sequences when used in
+byte-mode, and more complicated ones for UTF-8 characters. BACKCHAR should
+never be called in byte mode. To make sure it can never even appear when UTF-8
+support is omitted, we don't even define it. */
+
+#ifndef SUPPORT_UTF8
+#define GETCHAR(c, eptr) c = *eptr;
+#define GETCHARTEST(c, eptr) c = *eptr;
+#define GETCHARINC(c, eptr) c = *eptr++;
+#define GETCHARINCTEST(c, eptr) c = *eptr++;
+#define GETCHARLEN(c, eptr, len) c = *eptr;
+/* #define BACKCHAR(eptr) */
+
+#else /* SUPPORT_UTF8 */
+
+/* Get the next UTF-8 character, not advancing the pointer. This is called when
+we know we are in UTF-8 mode. */
+
+#define GETCHAR(c, eptr) \
+ c = *eptr; \
+ if (c >= 0xc0) \
+ { \
+ int gcii; \
+ int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
+ int gcss = 6*gcaa; \
+ c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
+ for (gcii = 1; gcii <= gcaa; gcii++) \
+ { \
+ gcss -= 6; \
+ c |= (eptr[gcii] & 0x3f) << gcss; \
+ } \
+ }
+
+/* Get the next UTF-8 character, testing for UTF-8 mode, and not advancing the
+pointer. */
+
+#define GETCHARTEST(c, eptr) \
+ c = *eptr; \
+ if (utf8 && c >= 0xc0) \
+ { \
+ int gcii; \
+ int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
+ int gcss = 6*gcaa; \
+ c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
+ for (gcii = 1; gcii <= gcaa; gcii++) \
+ { \
+ gcss -= 6; \
+ c |= (eptr[gcii] & 0x3f) << gcss; \
+ } \
+ }
+
+/* Get the next UTF-8 character, advancing the pointer. This is called when we
+know we are in UTF-8 mode. */
+
+#define GETCHARINC(c, eptr) \
+ c = *eptr++; \
+ if (c >= 0xc0) \
+ { \
+ int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
+ int gcss = 6*gcaa; \
+ c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
+ while (gcaa-- > 0) \
+ { \
+ gcss -= 6; \
+ c |= (*eptr++ & 0x3f) << gcss; \
+ } \
+ }
+
+/* Get the next character, testing for UTF-8 mode, and advancing the pointer */
+
+#define GETCHARINCTEST(c, eptr) \
+ c = *eptr++; \
+ if (utf8 && c >= 0xc0) \
+ { \
+ int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
+ int gcss = 6*gcaa; \
+ c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
+ while (gcaa-- > 0) \
+ { \
+ gcss -= 6; \
+ c |= (*eptr++ & 0x3f) << gcss; \
+ } \
+ }
+
+/* Get the next UTF-8 character, not advancing the pointer, incrementing length
+if there are extra bytes. This is called when we know we are in UTF-8 mode. */
+
+#define GETCHARLEN(c, eptr, len) \
+ c = *eptr; \
+ if (c >= 0xc0) \
+ { \
+ int gcii; \
+ int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
+ int gcss = 6*gcaa; \
+ c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
+ for (gcii = 1; gcii <= gcaa; gcii++) \
+ { \
+ gcss -= 6; \
+ c |= (eptr[gcii] & 0x3f) << gcss; \
+ } \
+ len += gcaa; \
+ }
+
+/* If the pointer is not at the start of a character, move it back until
+it is. This is called only in UTF-8 mode - we don't put a test within the macro
+because almost all calls are already within a block of UTF-8 only code. */
+
+#define BACKCHAR(eptr) while((*eptr & 0xc0) == 0x80) eptr--
+
+#endif
+
+
+/* In case there is no definition of offsetof() provided - though any proper
+Standard C system should have one. */
+
+#ifndef offsetof
+#define offsetof(p_type,field) ((size_t)&(((p_type *)0)->field))
+#endif
+
+
+/* These are the public options that can change during matching. */
+
+#define PCRE_IMS (PCRE_CASELESS|PCRE_MULTILINE|PCRE_DOTALL)
+
+/* Private flags containing information about the compiled regex. They used to
+live at the top end of the options word, but that got almost full, so now they
+are in a 16-bit flags word. */
+
+#define PCRE_NOPARTIAL 0x0001 /* can't use partial with this regex */
+#define PCRE_FIRSTSET 0x0002 /* first_byte is set */
+#define PCRE_REQCHSET 0x0004 /* req_byte is set */
+#define PCRE_STARTLINE 0x0008 /* start after \n for multiline */
+#define PCRE_JCHANGED 0x0010 /* j option used in regex */
+#define PCRE_HASCRORLF 0x0020 /* explicit \r or \n in pattern */
+
+/* Options for the "extra" block produced by pcre_study(). */
+
+#define PCRE_STUDY_MAPPED 0x01 /* a map of starting chars exists */
+
+/* Masks for identifying the public options that are permitted at compile
+time, run time, or study time, respectively. */
+
+#define PCRE_NEWLINE_BITS (PCRE_NEWLINE_CR|PCRE_NEWLINE_LF|PCRE_NEWLINE_ANY| \
+ PCRE_NEWLINE_ANYCRLF)
+
+#define PUBLIC_OPTIONS \
+ (PCRE_CASELESS|PCRE_EXTENDED|PCRE_ANCHORED|PCRE_MULTILINE| \
+ PCRE_DOTALL|PCRE_DOLLAR_ENDONLY|PCRE_EXTRA|PCRE_UNGREEDY|PCRE_UTF8| \
+ PCRE_NO_AUTO_CAPTURE|PCRE_NO_UTF8_CHECK|PCRE_AUTO_CALLOUT|PCRE_FIRSTLINE| \
+ PCRE_DUPNAMES|PCRE_NEWLINE_BITS|PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)
+
+#define PUBLIC_EXEC_OPTIONS \
+ (PCRE_ANCHORED|PCRE_NOTBOL|PCRE_NOTEOL|PCRE_NOTEMPTY|PCRE_NO_UTF8_CHECK| \
+ PCRE_PARTIAL|PCRE_NEWLINE_BITS|PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)
+
+#define PUBLIC_DFA_EXEC_OPTIONS \
+ (PCRE_ANCHORED|PCRE_NOTBOL|PCRE_NOTEOL|PCRE_NOTEMPTY|PCRE_NO_UTF8_CHECK| \
+ PCRE_PARTIAL|PCRE_DFA_SHORTEST|PCRE_DFA_RESTART|PCRE_NEWLINE_BITS| \
+ PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)
+
+#define PUBLIC_STUDY_OPTIONS 0 /* None defined */
+
+/* Magic number to provide a small check against being handed junk. Also used
+to detect whether a pattern was compiled on a host of different endianness. */
+
+#define MAGIC_NUMBER 0x50435245UL /* 'PCRE' */
+
+/* Negative values for the firstchar and reqchar variables */
+
+#define REQ_UNSET (-2)
+#define REQ_NONE (-1)
+
+/* The maximum remaining length of subject we are prepared to search for a
+req_byte match. */
+
+#define REQ_BYTE_MAX 1000
+
+/* Flags added to firstbyte or reqbyte; a "non-literal" item is either a
+variable-length repeat, or a anything other than literal characters. */
+
+#define REQ_CASELESS 0x0100 /* indicates caselessness */
+#define REQ_VARY 0x0200 /* reqbyte followed non-literal item */
+
+/* Miscellaneous definitions */
+
+typedef int BOOL;
+
+#define FALSE 0
+#define TRUE 1
+
+/* Escape items that are just an encoding of a particular data value. */
+
+#ifndef ESC_e
+#define ESC_e 27
+#endif
+
+#ifndef ESC_f
+#define ESC_f '\f'
+#endif
+
+#ifndef ESC_n
+#define ESC_n '\n'
+#endif
+
+#ifndef ESC_r
+#define ESC_r '\r'
+#endif
+
+/* We can't officially use ESC_t because it is a POSIX reserved identifier
+(presumably because of all the others like size_t). */
+
+#ifndef ESC_tee
+#define ESC_tee '\t'
+#endif
+
+/* Codes for different types of Unicode property */
+
+#define PT_ANY 0 /* Any property - matches all chars */
+#define PT_LAMP 1 /* L& - the union of Lu, Ll, Lt */
+#define PT_GC 2 /* General characteristic (e.g. L) */
+#define PT_PC 3 /* Particular characteristic (e.g. Lu) */
+#define PT_SC 4 /* Script (e.g. Han) */
+
+/* Flag bits and data types for the extended class (OP_XCLASS) for classes that
+contain UTF-8 characters with values greater than 255. */
+
+#define XCL_NOT 0x01 /* Flag: this is a negative class */
+#define XCL_MAP 0x02 /* Flag: a 32-byte map is present */
+
+#define XCL_END 0 /* Marks end of individual items */
+#define XCL_SINGLE 1 /* Single item (one multibyte char) follows */
+#define XCL_RANGE 2 /* A range (two multibyte chars) follows */
+#define XCL_PROP 3 /* Unicode property (2-byte property code follows) */
+#define XCL_NOTPROP 4 /* Unicode inverted property (ditto) */
+
+/* These are escaped items that aren't just an encoding of a particular data
+value such as \n. They must have non-zero values, as check_escape() returns
+their negation. Also, they must appear in the same order as in the opcode
+definitions below, up to ESC_z. There's a dummy for OP_ANY because it
+corresponds to "." rather than an escape sequence. The final one must be
+ESC_REF as subsequent values are used for backreferences (\1, \2, \3, etc).
+There are two tests in the code for an escape greater than ESC_b and less than
+ESC_Z to detect the types that may be repeated. These are the types that
+consume characters. If any new escapes are put in between that don't consume a
+character, that code will have to change. */
+
+enum { ESC_A = 1, ESC_G, ESC_K, ESC_B, ESC_b, ESC_D, ESC_d, ESC_S, ESC_s,
+ ESC_W, ESC_w, ESC_dum1, ESC_C, ESC_P, ESC_p, ESC_R, ESC_H, ESC_h,
+ ESC_V, ESC_v, ESC_X, ESC_Z, ESC_z, ESC_E, ESC_Q, ESC_k, ESC_REF };
+
+
+/* Opcode table: Starting from 1 (i.e. after OP_END), the values up to
+OP_EOD must correspond in order to the list of escapes immediately above.
+
+*** NOTE NOTE NOTE *** Whenever this list is updated, the two macro definitions
+that follow must also be updated to match. There is also a table called
+"coptable" in pcre_dfa_exec.c that must be updated. */
+
+enum {
+ OP_END, /* 0 End of pattern */
+
+ /* Values corresponding to backslashed metacharacters */
+
+ OP_SOD, /* 1 Start of data: \A */
+ OP_SOM, /* 2 Start of match (subject + offset): \G */
+ OP_SET_SOM, /* 3 Set start of match (\K) */
+ OP_NOT_WORD_BOUNDARY, /* 4 \B */
+ OP_WORD_BOUNDARY, /* 5 \b */
+ OP_NOT_DIGIT, /* 6 \D */
+ OP_DIGIT, /* 7 \d */
+ OP_NOT_WHITESPACE, /* 8 \S */
+ OP_WHITESPACE, /* 9 \s */
+ OP_NOT_WORDCHAR, /* 10 \W */
+ OP_WORDCHAR, /* 11 \w */
+ OP_ANY, /* 12 Match any character */
+ OP_ANYBYTE, /* 13 Match any byte (\C); different to OP_ANY for UTF-8 */
+ OP_NOTPROP, /* 14 \P (not Unicode property) */
+ OP_PROP, /* 15 \p (Unicode property) */
+ OP_ANYNL, /* 16 \R (any newline sequence) */
+ OP_NOT_HSPACE, /* 17 \H (not horizontal whitespace) */
+ OP_HSPACE, /* 18 \h (horizontal whitespace) */
+ OP_NOT_VSPACE, /* 19 \V (not vertical whitespace) */
+ OP_VSPACE, /* 20 \v (vertical whitespace) */
+ OP_EXTUNI, /* 21 \X (extended Unicode sequence */
+ OP_EODN, /* 22 End of data or \n at end of data: \Z. */
+ OP_EOD, /* 23 End of data: \z */
+
+ OP_OPT, /* 24 Set runtime options */
+ OP_CIRC, /* 25 Start of line - varies with multiline switch */
+ OP_DOLL, /* 26 End of line - varies with multiline switch */
+ OP_CHAR, /* 27 Match one character, casefully */
+ OP_CHARNC, /* 28 Match one character, caselessly */
+ OP_NOT, /* 29 Match one character, not the following one */
+
+ OP_STAR, /* 30 The maximizing and minimizing versions of */
+ OP_MINSTAR, /* 31 these six opcodes must come in pairs, with */
+ OP_PLUS, /* 32 the minimizing one second. */
+ OP_MINPLUS, /* 33 This first set applies to single characters.*/
+ OP_QUERY, /* 34 */
+ OP_MINQUERY, /* 35 */
+
+ OP_UPTO, /* 36 From 0 to n matches */
+ OP_MINUPTO, /* 37 */
+ OP_EXACT, /* 38 Exactly n matches */
+
+ OP_POSSTAR, /* 39 Possessified star */
+ OP_POSPLUS, /* 40 Possessified plus */
+ OP_POSQUERY, /* 41 Posesssified query */
+ OP_POSUPTO, /* 42 Possessified upto */
+
+ OP_NOTSTAR, /* 43 The maximizing and minimizing versions of */
+ OP_NOTMINSTAR, /* 44 these six opcodes must come in pairs, with */
+ OP_NOTPLUS, /* 45 the minimizing one second. They must be in */
+ OP_NOTMINPLUS, /* 46 exactly the same order as those above. */
+ OP_NOTQUERY, /* 47 This set applies to "not" single characters. */
+ OP_NOTMINQUERY, /* 48 */
+
+ OP_NOTUPTO, /* 49 From 0 to n matches */
+ OP_NOTMINUPTO, /* 50 */
+ OP_NOTEXACT, /* 51 Exactly n matches */
+
+ OP_NOTPOSSTAR, /* 52 Possessified versions */
+ OP_NOTPOSPLUS, /* 53 */
+ OP_NOTPOSQUERY, /* 54 */
+ OP_NOTPOSUPTO, /* 55 */
+
+ OP_TYPESTAR, /* 56 The maximizing and minimizing versions of */
+ OP_TYPEMINSTAR, /* 57 these six opcodes must come in pairs, with */
+ OP_TYPEPLUS, /* 58 the minimizing one second. These codes must */
+ OP_TYPEMINPLUS, /* 59 be in exactly the same order as those above. */
+ OP_TYPEQUERY, /* 60 This set applies to character types such as \d */
+ OP_TYPEMINQUERY, /* 61 */
+
+ OP_TYPEUPTO, /* 62 From 0 to n matches */
+ OP_TYPEMINUPTO, /* 63 */
+ OP_TYPEEXACT, /* 64 Exactly n matches */
+
+ OP_TYPEPOSSTAR, /* 65 Possessified versions */
+ OP_TYPEPOSPLUS, /* 66 */
+ OP_TYPEPOSQUERY, /* 67 */
+ OP_TYPEPOSUPTO, /* 68 */
+
+ OP_CRSTAR, /* 69 The maximizing and minimizing versions of */
+ OP_CRMINSTAR, /* 70 all these opcodes must come in pairs, with */
+ OP_CRPLUS, /* 71 the minimizing one second. These codes must */
+ OP_CRMINPLUS, /* 72 be in exactly the same order as those above. */
+ OP_CRQUERY, /* 73 These are for character classes and back refs */
+ OP_CRMINQUERY, /* 74 */
+ OP_CRRANGE, /* 75 These are different to the three sets above. */
+ OP_CRMINRANGE, /* 76 */
+
+ OP_CLASS, /* 77 Match a character class, chars < 256 only */
+ OP_NCLASS, /* 78 Same, but the bitmap was created from a negative
+ class - the difference is relevant only when a UTF-8
+ character > 255 is encountered. */
+
+ OP_XCLASS, /* 79 Extended class for handling UTF-8 chars within the
+ class. This does both positive and negative. */
+
+ OP_REF, /* 80 Match a back reference */
+ OP_RECURSE, /* 81 Match a numbered subpattern (possibly recursive) */
+ OP_CALLOUT, /* 82 Call out to external function if provided */
+
+ OP_ALT, /* 83 Start of alternation */
+ OP_KET, /* 84 End of group that doesn't have an unbounded repeat */
+ OP_KETRMAX, /* 85 These two must remain together and in this */
+ OP_KETRMIN, /* 86 order. They are for groups the repeat for ever. */
+
+ /* The assertions must come before BRA, CBRA, ONCE, and COND.*/
+
+ OP_ASSERT, /* 87 Positive lookahead */
+ OP_ASSERT_NOT, /* 88 Negative lookahead */
+ OP_ASSERTBACK, /* 89 Positive lookbehind */
+ OP_ASSERTBACK_NOT, /* 90 Negative lookbehind */
+ OP_REVERSE, /* 91 Move pointer back - used in lookbehind assertions */
+
+ /* ONCE, BRA, CBRA, and COND must come after the assertions, with ONCE first,
+ as there's a test for >= ONCE for a subpattern that isn't an assertion. */
+
+ OP_ONCE, /* 92 Atomic group */
+ OP_BRA, /* 93 Start of non-capturing bracket */
+ OP_CBRA, /* 94 Start of capturing bracket */
+ OP_COND, /* 95 Conditional group */
+
+ /* These three must follow the previous three, in the same order. There's a
+ check for >= SBRA to distinguish the two sets. */
+
+ OP_SBRA, /* 96 Start of non-capturing bracket, check empty */
+ OP_SCBRA, /* 97 Start of capturing bracket, check empty */
+ OP_SCOND, /* 98 Conditional group, check empty */
+
+ OP_CREF, /* 99 Used to hold a capture number as condition */
+ OP_RREF, /* 100 Used to hold a recursion number as condition */
+ OP_DEF, /* 101 The DEFINE condition */
+
+ OP_BRAZERO, /* 102 These two must remain together and in this */
+ OP_BRAMINZERO, /* 103 order. */
+
+ /* These are backtracking control verbs */
+
+ OP_PRUNE, /* 104 */
+ OP_SKIP, /* 105 */
+ OP_THEN, /* 106 */
+ OP_COMMIT, /* 107 */
+
+ /* These are forced failure and success verbs */
+
+ OP_FAIL, /* 108 */
+ OP_ACCEPT /* 109 */
+};
+
+
+/* This macro defines textual names for all the opcodes. These are used only
+for debugging. The macro is referenced only in pcre_printint.c. */
+
+#define OP_NAME_LIST \
+ "End", "\\A", "\\G", "\\K", "\\B", "\\b", "\\D", "\\d", \
+ "\\S", "\\s", "\\W", "\\w", "Any", "Anybyte", \
+ "notprop", "prop", "\\R", "\\H", "\\h", "\\V", "\\v", \
+ "extuni", "\\Z", "\\z", \
+ "Opt", "^", "$", "char", "charnc", "not", \
+ "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
+ "*+","++", "?+", "{", \
+ "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
+ "*+","++", "?+", "{", \
+ "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
+ "*+","++", "?+", "{", \
+ "*", "*?", "+", "+?", "?", "??", "{", "{", \
+ "class", "nclass", "xclass", "Ref", "Recurse", "Callout", \
+ "Alt", "Ket", "KetRmax", "KetRmin", "Assert", "Assert not", \
+ "AssertB", "AssertB not", "Reverse", \
+ "Once", "Bra", "CBra", "Cond", "SBra", "SCBra", "SCond", \
+ "Cond ref", "Cond rec", "Cond def", "Brazero", "Braminzero", \
+ "*PRUNE", "*SKIP", "*THEN", "*COMMIT", "*FAIL", "*ACCEPT"
+
+
+/* This macro defines the length of fixed length operations in the compiled
+regex. The lengths are used when searching for specific things, and also in the
+debugging printing of a compiled regex. We use a macro so that it can be
+defined close to the definitions of the opcodes themselves.
+
+As things have been extended, some of these are no longer fixed lenths, but are
+minima instead. For example, the length of a single-character repeat may vary
+in UTF-8 mode. The code that uses this table must know about such things. */
+
+#define OP_LENGTHS \
+ 1, /* End */ \
+ 1, 1, 1, 1, 1, /* \A, \G, \K, \B, \b */ \
+ 1, 1, 1, 1, 1, 1, /* \D, \d, \S, \s, \W, \w */ \
+ 1, 1, /* Any, Anybyte */ \
+ 3, 3, 1, /* NOTPROP, PROP, EXTUNI */ \
+ 1, 1, 1, 1, 1, /* \R, \H, \h, \V, \v */ \
+ 1, 1, 2, 1, 1, /* \Z, \z, Opt, ^, $ */ \
+ 2, /* Char - the minimum length */ \
+ 2, /* Charnc - the minimum length */ \
+ 2, /* not */ \
+ /* Positive single-char repeats ** These are */ \
+ 2, 2, 2, 2, 2, 2, /* *, *?, +, +?, ?, ?? ** minima in */ \
+ 4, 4, 4, /* upto, minupto, exact ** UTF-8 mode */ \
+ 2, 2, 2, 4, /* *+, ++, ?+, upto+ */ \
+ /* Negative single-char repeats - only for chars < 256 */ \
+ 2, 2, 2, 2, 2, 2, /* NOT *, *?, +, +?, ?, ?? */ \
+ 4, 4, 4, /* NOT upto, minupto, exact */ \
+ 2, 2, 2, 4, /* Possessive *, +, ?, upto */ \
+ /* Positive type repeats */ \
+ 2, 2, 2, 2, 2, 2, /* Type *, *?, +, +?, ?, ?? */ \
+ 4, 4, 4, /* Type upto, minupto, exact */ \
+ 2, 2, 2, 4, /* Possessive *+, ++, ?+, upto+ */ \
+ /* Character class & ref repeats */ \
+ 1, 1, 1, 1, 1, 1, /* *, *?, +, +?, ?, ?? */ \
+ 5, 5, /* CRRANGE, CRMINRANGE */ \
+ 33, /* CLASS */ \
+ 33, /* NCLASS */ \
+ 0, /* XCLASS - variable length */ \
+ 3, /* REF */ \
+ 1+LINK_SIZE, /* RECURSE */ \
+ 2+2*LINK_SIZE, /* CALLOUT */ \
+ 1+LINK_SIZE, /* Alt */ \
+ 1+LINK_SIZE, /* Ket */ \
+ 1+LINK_SIZE, /* KetRmax */ \
+ 1+LINK_SIZE, /* KetRmin */ \
+ 1+LINK_SIZE, /* Assert */ \
+ 1+LINK_SIZE, /* Assert not */ \
+ 1+LINK_SIZE, /* Assert behind */ \
+ 1+LINK_SIZE, /* Assert behind not */ \
+ 1+LINK_SIZE, /* Reverse */ \
+ 1+LINK_SIZE, /* ONCE */ \
+ 1+LINK_SIZE, /* BRA */ \
+ 3+LINK_SIZE, /* CBRA */ \
+ 1+LINK_SIZE, /* COND */ \
+ 1+LINK_SIZE, /* SBRA */ \
+ 3+LINK_SIZE, /* SCBRA */ \
+ 1+LINK_SIZE, /* SCOND */ \
+ 3, /* CREF */ \
+ 3, /* RREF */ \
+ 1, /* DEF */ \
+ 1, 1, /* BRAZERO, BRAMINZERO */ \
+ 1, 1, 1, 1, /* PRUNE, SKIP, THEN, COMMIT, */ \
+ 1, 1 /* FAIL, ACCEPT */
+
+
+/* A magic value for OP_RREF to indicate the "any recursion" condition. */
+
+#define RREF_ANY 0xffff
+
+/* Error code numbers. They are given names so that they can more easily be
+tracked. */
+
+enum { ERR0, ERR1, ERR2, ERR3, ERR4, ERR5, ERR6, ERR7, ERR8, ERR9,
+ ERR10, ERR11, ERR12, ERR13, ERR14, ERR15, ERR16, ERR17, ERR18, ERR19,
+ ERR20, ERR21, ERR22, ERR23, ERR24, ERR25, ERR26, ERR27, ERR28, ERR29,
+ ERR30, ERR31, ERR32, ERR33, ERR34, ERR35, ERR36, ERR37, ERR38, ERR39,
+ ERR40, ERR41, ERR42, ERR43, ERR44, ERR45, ERR46, ERR47, ERR48, ERR49,
+ ERR50, ERR51, ERR52, ERR53, ERR54, ERR55, ERR56, ERR57, ERR58, ERR59,
+ ERR60, ERR61 };
+
+/* The real format of the start of the pcre block; the index of names and the
+code vector run on as long as necessary after the end. We store an explicit
+offset to the name table so that if a regex is compiled on one host, saved, and
+then run on another where the size of pointers is different, all might still
+be well. For the case of compiled-on-4 and run-on-8, we include an extra
+pointer that is always NULL. For future-proofing, a few dummy fields were
+originally included - even though you can never get this planning right - but
+there is only one left now.
+
+NOTE NOTE NOTE:
+Because people can now save and re-use compiled patterns, any additions to this
+structure should be made at the end, and something earlier (e.g. a new
+flag in the options or one of the dummy fields) should indicate that the new
+fields are present. Currently PCRE always sets the dummy fields to zero.
+NOTE NOTE NOTE:
+*/
+
+typedef struct real_pcre {
+ pcre_uint32 magic_number;
+ pcre_uint32 size; /* Total that was malloced */
+ pcre_uint32 options; /* Public options */
+ pcre_uint16 flags; /* Private flags */
+ pcre_uint16 dummy1; /* For future use */
+ pcre_uint16 top_bracket;
+ pcre_uint16 top_backref;
+ pcre_uint16 first_byte;
+ pcre_uint16 req_byte;
+ pcre_uint16 name_table_offset; /* Offset to name table that follows */
+ pcre_uint16 name_entry_size; /* Size of any name items */
+ pcre_uint16 name_count; /* Number of name items */
+ pcre_uint16 ref_count; /* Reference count */
+
+ const unsigned char *tables; /* Pointer to tables or NULL for std */
+ const unsigned char *nullpad; /* NULL padding */
+} real_pcre;
+
+/* The format of the block used to store data from pcre_study(). The same
+remark (see NOTE above) about extending this structure applies. */
+
+typedef struct pcre_study_data {
+ pcre_uint32 size; /* Total that was malloced */
+ pcre_uint32 options;
+ uschar start_bits[32];
+} pcre_study_data;
+
+/* Structure for passing "static" information around between the functions
+doing the compiling, so that they are thread-safe. */
+
+typedef struct compile_data {
+ const uschar *lcc; /* Points to lower casing table */
+ const uschar *fcc; /* Points to case-flipping table */
+ const uschar *cbits; /* Points to character type table */
+ const uschar *ctypes; /* Points to table of type maps */
+ const uschar *start_workspace;/* The start of working space */
+ const uschar *start_code; /* The start of the compiled code */
+ const uschar *start_pattern; /* The start of the pattern */
+ const uschar *end_pattern; /* The end of the pattern */
+ uschar *hwm; /* High watermark of workspace */
+ uschar *name_table; /* The name/number table */
+ int names_found; /* Number of entries so far */
+ int name_entry_size; /* Size of each entry */
+ int bracount; /* Count of capturing parens */
+ int top_backref; /* Maximum back reference */
+ unsigned int backref_map; /* Bitmap of low back refs */
+ int external_options; /* External (initial) options */
+ int external_flags; /* External flag bits to be set */
+ int req_varyopt; /* "After variable item" flag for reqbyte */
+ BOOL had_accept; /* (*ACCEPT) encountered */
+ int nltype; /* Newline type */
+ int nllen; /* Newline string length */
+ uschar nl[4]; /* Newline string when fixed length */
+} compile_data;
+
+/* Structure for maintaining a chain of pointers to the currently incomplete
+branches, for testing for left recursion. */
+
+typedef struct branch_chain {
+ struct branch_chain *outer;
+ uschar *current;
+} branch_chain;
+
+/* Structure for items in a linked list that represents an explicit recursive
+call within the pattern. */
+
+typedef struct recursion_info {
+ struct recursion_info *prevrec; /* Previous recursion record (or NULL) */
+ int group_num; /* Number of group that was called */
+ const uschar *after_call; /* "Return value": points after the call in the expr */
+ USPTR save_start; /* Old value of mstart */
+ int *offset_save; /* Pointer to start of saved offsets */
+ int saved_max; /* Number of saved offsets */
+} recursion_info;
+
+/* Structure for building a chain of data for holding the values of the subject
+pointer at the start of each subpattern, so as to detect when an empty string
+has been matched by a subpattern - to break infinite loops. */
+
+typedef struct eptrblock {
+ struct eptrblock *epb_prev;
+ USPTR epb_saved_eptr;
+} eptrblock;
+
+
+/* Structure for passing "static" information around between the functions
+doing traditional NFA matching, so that they are thread-safe. */
+
+typedef struct match_data {
+ unsigned long int match_call_count; /* As it says */
+ unsigned long int match_limit; /* As it says */
+ unsigned long int match_limit_recursion; /* As it says */
+ int *offset_vector; /* Offset vector */
+ int offset_end; /* One past the end */
+ int offset_max; /* The maximum usable for return data */
+ int nltype; /* Newline type */
+ int nllen; /* Newline string length */
+ uschar nl[4]; /* Newline string when fixed */
+ const uschar *lcc; /* Points to lower casing table */
+ const uschar *ctypes; /* Points to table of type maps */
+ BOOL offset_overflow; /* Set if too many extractions */
+ BOOL notbol; /* NOTBOL flag */
+ BOOL noteol; /* NOTEOL flag */
+ BOOL utf8; /* UTF8 flag */
+ BOOL endonly; /* Dollar not before final \n */
+ BOOL notempty; /* Empty string match not wanted */
+ BOOL partial; /* PARTIAL flag */
+ BOOL hitend; /* Hit the end of the subject at some point */
+ BOOL bsr_anycrlf; /* \R is just any CRLF, not full Unicode */
+ const uschar *start_code; /* For use when recursing */
+ USPTR start_subject; /* Start of the subject string */
+ USPTR end_subject; /* End of the subject string */
+ USPTR start_match_ptr; /* Start of matched string */
+ USPTR end_match_ptr; /* Subject position at end match */
+ int end_offset_top; /* Highwater mark at end of match */
+ int capture_last; /* Most recent capture number */
+ int start_offset; /* The start offset value */
+ eptrblock *eptrchain; /* Chain of eptrblocks for tail recursions */
+ int eptrn; /* Next free eptrblock */
+ recursion_info *recursive; /* Linked list of recursion data */
+ void *callout_data; /* To pass back to callouts */
+} match_data;
+
+/* A similar structure is used for the same purpose by the DFA matching
+functions. */
+
+typedef struct dfa_match_data {
+ const uschar *start_code; /* Start of the compiled pattern */
+ const uschar *start_subject; /* Start of the subject string */
+ const uschar *end_subject; /* End of subject string */
+ const uschar *tables; /* Character tables */
+ int moptions; /* Match options */
+ int poptions; /* Pattern options */
+ int nltype; /* Newline type */
+ int nllen; /* Newline string length */
+ uschar nl[4]; /* Newline string when fixed */
+ void *callout_data; /* To pass back to callouts */
+} dfa_match_data;
+
+/* Bit definitions for entries in the pcre_ctypes table. */
+
+#define ctype_space 0x01
+#define ctype_letter 0x02
+#define ctype_digit 0x04
+#define ctype_xdigit 0x08
+#define ctype_word 0x10 /* alphameric or '_' */
+#define ctype_meta 0x80 /* regexp meta char or zero (end pattern) */
+
+/* Offsets for the bitmap tables in pcre_cbits. Each table contains a set
+of bits for a class map. Some classes are built by combining these tables. */
+
+#define cbit_space 0 /* [:space:] or \s */
+#define cbit_xdigit 32 /* [:xdigit:] */
+#define cbit_digit 64 /* [:digit:] or \d */
+#define cbit_upper 96 /* [:upper:] */
+#define cbit_lower 128 /* [:lower:] */
+#define cbit_word 160 /* [:word:] or \w */
+#define cbit_graph 192 /* [:graph:] */
+#define cbit_print 224 /* [:print:] */
+#define cbit_punct 256 /* [:punct:] */
+#define cbit_cntrl 288 /* [:cntrl:] */
+#define cbit_length 320 /* Length of the cbits table */
+
+/* Offsets of the various tables from the base tables pointer, and
+total length. */
+
+#define lcc_offset 0
+#define fcc_offset 256
+#define cbits_offset 512
+#define ctypes_offset (cbits_offset + cbit_length)
+#define tables_length (ctypes_offset + 256)
+
+/* Layout of the UCP type table that translates property names into types and
+codes. Each entry used to point directly to a name, but to reduce the number of
+relocations in shared libraries, it now has an offset into a single string
+instead. */
+
+typedef struct {
+ pcre_uint16 name_offset;
+ pcre_uint16 type;
+ pcre_uint16 value;
+} ucp_type_table;
+
+
+/* Internal shared data tables. These are tables that are used by more than one
+of the exported public functions. They have to be "external" in the C sense,
+but are not part of the PCRE public API. The data for these tables is in the
+pcre_tables.c module. */
+
+extern const int _pcre_utf8_table1[];
+extern const int _pcre_utf8_table2[];
+extern const int _pcre_utf8_table3[];
+extern const uschar _pcre_utf8_table4[];
+
+extern const int _pcre_utf8_table1_size;
+
+extern const char _pcre_utt_names[];
+extern const ucp_type_table _pcre_utt[];
+extern const int _pcre_utt_size;
+
+extern const uschar _pcre_default_tables[];
+
+extern const uschar _pcre_OP_lengths[];
+
+
+/* Internal shared functions. These are functions that are used by more than
+one of the exported public functions. They have to be "external" in the C
+sense, but are not part of the PCRE public API. */
+
+extern BOOL _pcre_is_newline(const uschar *, int, const uschar *,
+ int *, BOOL);
+extern int _pcre_ord2utf8(int, uschar *);
+extern real_pcre *_pcre_try_flipped(const real_pcre *, real_pcre *,
+ const pcre_study_data *, pcre_study_data *);
+extern int _pcre_ucp_findprop(const unsigned int, int *, int *);
+extern unsigned int _pcre_ucp_othercase(const unsigned int);
+extern int _pcre_valid_utf8(const uschar *, int);
+extern BOOL _pcre_was_newline(const uschar *, int, const uschar *,
+ int *, BOOL);
+extern BOOL _pcre_xclass(int, const uschar *);
+
+#endif
+
+/* End of pcre_internal.h */
diff --git a/src/plugins/PCREPlugin/pcre_maketables.c b/src/plugins/PCREPlugin/pcre_maketables.c
new file mode 100644
index 0000000..352bea9
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_maketables.c
@@ -0,0 +1,143 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_maketables(), which builds
+character tables for PCRE in the current locale. The file is compiled on its
+own as part of the PCRE library. However, it is also included in the
+compilation of dftables.c, in which case the macro DFTABLES is defined. */
+
+
+#ifndef DFTABLES
+# ifdef HAVE_CONFIG_H
+# include "config.h"
+# endif
+# include "pcre_internal.h"
+#endif
+
+
+/*************************************************
+* Create PCRE character tables *
+*************************************************/
+
+/* This function builds a set of character tables for use by PCRE and returns
+a pointer to them. They are build using the ctype functions, and consequently
+their contents will depend upon the current locale setting. When compiled as
+part of the library, the store is obtained via pcre_malloc(), but when compiled
+inside dftables, use malloc().
+
+Arguments: none
+Returns: pointer to the contiguous block of data
+*/
+
+const unsigned char *
+pcre_maketables(void)
+{
+unsigned char *yield, *p;
+int i;
+
+#ifndef DFTABLES
+yield = (unsigned char*)(pcre_malloc)(tables_length);
+#else
+yield = (unsigned char*)malloc(tables_length);
+#endif
+
+if (yield == NULL) return NULL;
+p = yield;
+
+/* First comes the lower casing table */
+
+for (i = 0; i < 256; i++) *p++ = tolower(i);
+
+/* Next the case-flipping table */
+
+for (i = 0; i < 256; i++) *p++ = islower(i)? toupper(i) : tolower(i);
+
+/* Then the character class tables. Don't try to be clever and save effort on
+exclusive ones - in some locales things may be different. Note that the table
+for "space" includes everything "isspace" gives, including VT in the default
+locale. This makes it work for the POSIX class [:space:]. Note also that it is
+possible for a character to be alnum or alpha without being lower or upper,
+such as "male and female ordinals" (\xAA and \xBA) in the fr_FR locale (at
+least under Debian Linux's locales as of 12/2005). So we must test for alnum
+specially. */
+
+memset(p, 0, cbit_length);
+for (i = 0; i < 256; i++)
+ {
+ if (isdigit(i)) p[cbit_digit + i/8] |= 1 << (i&7);
+ if (isupper(i)) p[cbit_upper + i/8] |= 1 << (i&7);
+ if (islower(i)) p[cbit_lower + i/8] |= 1 << (i&7);
+ if (isalnum(i)) p[cbit_word + i/8] |= 1 << (i&7);
+ if (i == '_') p[cbit_word + i/8] |= 1 << (i&7);
+ if (isspace(i)) p[cbit_space + i/8] |= 1 << (i&7);
+ if (isxdigit(i))p[cbit_xdigit + i/8] |= 1 << (i&7);
+ if (isgraph(i)) p[cbit_graph + i/8] |= 1 << (i&7);
+ if (isprint(i)) p[cbit_print + i/8] |= 1 << (i&7);
+ if (ispunct(i)) p[cbit_punct + i/8] |= 1 << (i&7);
+ if (iscntrl(i)) p[cbit_cntrl + i/8] |= 1 << (i&7);
+ }
+p += cbit_length;
+
+/* Finally, the character type table. In this, we exclude VT from the white
+space chars, because Perl doesn't recognize it as such for \s and for comments
+within regexes. */
+
+for (i = 0; i < 256; i++)
+ {
+ int x = 0;
+ if (i != 0x0b && isspace(i)) x += ctype_space;
+ if (isalpha(i)) x += ctype_letter;
+ if (isdigit(i)) x += ctype_digit;
+ if (isxdigit(i)) x += ctype_xdigit;
+ if (isalnum(i) || i == '_') x += ctype_word;
+
+ /* Note: strchr includes the terminating zero in the characters it considers.
+ In this instance, that is ok because we want binary zero to be flagged as a
+ meta-character, which in this sense is any character that terminates a run
+ of data characters. */
+
+ if (strchr("\\*+?{^.$|()[", i) != 0) x += ctype_meta;
+ *p++ = x;
+ }
+
+return yield;
+}
+
+/* End of pcre_maketables.c */
diff --git a/src/plugins/PCREPlugin/pcre_newline.c b/src/plugins/PCREPlugin/pcre_newline.c
new file mode 100644
index 0000000..1708d93
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_newline.c
@@ -0,0 +1,164 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains internal functions for testing newlines when more than
+one kind of newline is to be recognized. When a newline is found, its length is
+returned. In principle, we could implement several newline "types", each
+referring to a different set of newline characters. At present, PCRE supports
+only NLTYPE_FIXED, which gets handled without these functions, NLTYPE_ANYCRLF,
+and NLTYPE_ANY. The full list of Unicode newline characters is taken from
+http://unicode.org/unicode/reports/tr18/. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+
+/*************************************************
+* Check for newline at given position *
+*************************************************/
+
+/* It is guaranteed that the initial value of ptr is less than the end of the
+string that is being processed.
+
+Arguments:
+ ptr pointer to possible newline
+ type the newline type
+ endptr pointer to the end of the string
+ lenptr where to return the length
+ utf8 TRUE if in utf8 mode
+
+Returns: TRUE or FALSE
+*/
+
+BOOL
+_pcre_is_newline(const uschar *ptr, int type, const uschar *endptr,
+ int *lenptr, BOOL utf8)
+{
+int c;
+if (utf8) { GETCHAR(c, ptr); } else c = *ptr;
+
+if (type == NLTYPE_ANYCRLF) switch(c)
+ {
+ case 0x000a: *lenptr = 1; return TRUE; /* LF */
+ case 0x000d: *lenptr = (ptr < endptr - 1 && ptr[1] == 0x0a)? 2 : 1;
+ return TRUE; /* CR */
+ default: return FALSE;
+ }
+
+/* NLTYPE_ANY */
+
+else switch(c)
+ {
+ case 0x000a: /* LF */
+ case 0x000b: /* VT */
+ case 0x000c: *lenptr = 1; return TRUE; /* FF */
+ case 0x000d: *lenptr = (ptr < endptr - 1 && ptr[1] == 0x0a)? 2 : 1;
+ return TRUE; /* CR */
+ case 0x0085: *lenptr = utf8? 2 : 1; return TRUE; /* NEL */
+ case 0x2028: /* LS */
+ case 0x2029: *lenptr = 3; return TRUE; /* PS */
+ default: return FALSE;
+ }
+}
+
+
+
+/*************************************************
+* Check for newline at previous position *
+*************************************************/
+
+/* It is guaranteed that the initial value of ptr is greater than the start of
+the string that is being processed.
+
+Arguments:
+ ptr pointer to possible newline
+ type the newline type
+ startptr pointer to the start of the string
+ lenptr where to return the length
+ utf8 TRUE if in utf8 mode
+
+Returns: TRUE or FALSE
+*/
+
+BOOL
+_pcre_was_newline(const uschar *ptr, int type, const uschar *startptr,
+ int *lenptr, BOOL utf8)
+{
+int c;
+ptr--;
+#ifdef SUPPORT_UTF8
+if (utf8)
+ {
+ BACKCHAR(ptr);
+ GETCHAR(c, ptr);
+ }
+else c = *ptr;
+#else /* no UTF-8 support */
+c = *ptr;
+#endif /* SUPPORT_UTF8 */
+
+if (type == NLTYPE_ANYCRLF) switch(c)
+ {
+ case 0x000a: *lenptr = (ptr > startptr && ptr[-1] == 0x0d)? 2 : 1;
+ return TRUE; /* LF */
+ case 0x000d: *lenptr = 1; return TRUE; /* CR */
+ default: return FALSE;
+ }
+
+else switch(c)
+ {
+ case 0x000a: *lenptr = (ptr > startptr && ptr[-1] == 0x0d)? 2 : 1;
+ return TRUE; /* LF */
+ case 0x000b: /* VT */
+ case 0x000c: /* FF */
+ case 0x000d: *lenptr = 1; return TRUE; /* CR */
+ case 0x0085: *lenptr = utf8? 2 : 1; return TRUE; /* NEL */
+ case 0x2028: /* LS */
+ case 0x2029: *lenptr = 3; return TRUE; /* PS */
+ default: return FALSE;
+ }
+}
+
+/* End of pcre_newline.c */
diff --git a/src/plugins/PCREPlugin/pcre_ord2utf8.c b/src/plugins/PCREPlugin/pcre_ord2utf8.c
new file mode 100644
index 0000000..d3904c6
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_ord2utf8.c
@@ -0,0 +1,85 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This file contains a private PCRE function that converts an ordinal
+character value into a UTF8 string. */
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Convert character value to UTF-8 *
+*************************************************/
+
+/* This function takes an integer value in the range 0 - 0x7fffffff
+and encodes it as a UTF-8 character in 0 to 6 bytes.
+
+Arguments:
+ cvalue the character value
+ buffer pointer to buffer for result - at least 6 bytes long
+
+Returns: number of characters placed in the buffer
+*/
+
+int
+_pcre_ord2utf8(int cvalue, uschar *buffer)
+{
+#ifdef SUPPORT_UTF8
+register int i, j;
+for (i = 0; i < _pcre_utf8_table1_size; i++)
+ if (cvalue <= _pcre_utf8_table1[i]) break;
+buffer += i;
+for (j = i; j > 0; j--)
+ {
+ *buffer-- = 0x80 | (cvalue & 0x3f);
+ cvalue >>= 6;
+ }
+*buffer = _pcre_utf8_table2[i] | cvalue;
+return i + 1;
+#else
+return 0; /* Keep compiler happy; this function won't ever be */
+#endif /* called when SUPPORT_UTF8 is not defined. */
+}
+
+/* End of pcre_ord2utf8.c */
diff --git a/src/plugins/PCREPlugin/pcre_plugin.c b/src/plugins/PCREPlugin/pcre_plugin.c
new file mode 100644
index 0000000..05515dc
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_plugin.c
@@ -0,0 +1,400 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2007-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: pcre_plugin.c,v 1.11 2012-04-25 18:17:22 vlad Exp $
+*/
+
+#include "../../structures.h"
+#include
+#include "pcre.h"
+#include "pcreposix.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifndef isnumber
+#define isnumber(i_n_arg) ((i_n_arg>='0')&&(i_n_arg<='9'))
+#endif
+
+static struct pluginlink * pl;
+
+static pthread_mutex_t pcre_mutex;
+
+
+static struct filter pcre_first_filter = {
+ NULL,
+ "Fake filter",
+ NULL, NULL,
+ NULL, NULL,
+ NULL, NULL, NULL,
+ NULL, NULL
+};
+
+static struct filter *pcre_last_filter;
+static int pcre_loaded = 0;
+static int pcre_options = 0;
+
+static struct pcreopt {
+ char * name;
+ int value;
+} pcreopts[]= {
+
+ {"PCRE_CASELESS", 0x00000001},
+ {"PCRE_MULTILINE", 0x00000002},
+ {"PCRE_DOTALL", 0x00000004},
+ {"PCRE_EXTENDED", 0x00000008},
+ {"PCRE_ANCHORED", 0x00000010},
+ {"PCRE_DOLLAR_ENDONLY", 0x00000020},
+ {"PCRE_EXTRA", 0x00000040},
+ {"PCRE_NOTBOL", 0x00000080},
+ {"PCRE_NOTEOL", 0x00000100},
+ {"PCRE_UNGREEDY", 0x00000200},
+ {"PCRE_NOTEMPTY", 0x00000400},
+ {"PCRE_UTF8", 0x00000800},
+ {"PCRE_NO_AUTO_CAPTURE", 0x00001000},
+ {"PCRE_NO_UTF8_CHECK", 0x00002000},
+ {"PCRE_AUTO_CALLOUT", 0x00004000},
+ {"PCRE_PARTIAL", 0x00008000},
+ {"PCRE_DFA_SHORTEST", 0x00010000},
+ {"PCRE_DFA_RESTART", 0x00020000},
+ {"PCRE_FIRSTLINE", 0x00040000},
+ {"PCRE_DUPNAMES", 0x00080000},
+ {"PCRE_NEWLINE_CR", 0x00100000},
+ {"PCRE_NEWLINE_LF", 0x00200000},
+ {"PCRE_NEWLINE_CRLF", 0x00300000},
+ {"PCRE_NEWLINE_ANY", 0x00400000},
+ {"PCRE_NEWLINE_ANYCRLF", 0x00500000},
+ {"PCRE_BSR_ANYCRLF", 0x00800000},
+ {"PCRE_BSR_UNICODE", 0x01000000},
+ {NULL, 0}
+};
+
+struct pcre_filter_data {
+ int users;
+ pcre * re;
+ int action;
+ char * replace;
+ struct ace *acl;
+};
+
+static void pcre_data_free(struct pcre_filter_data *pcrefd){
+ pthread_mutex_lock(&pcre_mutex);
+ pcrefd->users--;
+ if(!pcrefd->users){
+ if(pcrefd->re) pl->myfree(pcrefd->re);
+ if(pcrefd->acl) pl->freeacl(pcrefd->acl);
+ if(pcrefd->replace) pl->myfree(pcrefd->replace);
+ pl->myfree(pcrefd);
+ }
+ pthread_mutex_unlock(&pcre_mutex);
+}
+
+
+
+
+static void* pcre_filter_open(void * idata, struct srvparam * param){
+#define pcrefd ((struct pcre_filter_data *)idata)
+ if(idata){
+ pthread_mutex_lock(&pcre_mutex);
+ pcrefd->users++;
+ pthread_mutex_unlock(&pcre_mutex);
+ }
+#undef pcrefd
+ return idata;
+}
+
+
+
+static FILTER_ACTION pcre_filter_client(void *fo, struct clientparam * param, void** fc){
+ int res;
+ struct ace tmpace;
+
+ *fc = fo;
+ if(!fo) return PASS;
+#define pcrefd ((struct pcre_filter_data *)fo)
+ if(!pcrefd->acl) return CONTINUE;
+ memset (&tmpace, 0, sizeof(struct ace));
+ tmpace.src = pcrefd->acl->src;
+ res = pl->ACLMatches(&tmpace, param);
+#undef pcrefd
+ return (res)? CONTINUE:PASS;
+}
+
+static FILTER_ACTION pcre_filter_buffer(void *fc, struct clientparam *param, unsigned char ** buf_p, int * bufsize_p, int offset, int * length_p){
+ int ovector[48];
+ int count = 0;
+ struct ace *acl;
+ int match = 0;
+ int replen, num;
+ char * replace;
+ char * tmpbuf, *target, *newbuf;
+ int nreplaces=0;
+#define pcrefd ((struct pcre_filter_data *)fc)
+
+ for(acl = pcrefd->acl; acl; acl=acl->next){
+ if(pl->ACLMatches(pcrefd->acl, param)){
+ match = 1;
+ break;
+ }
+ }
+ if(!match) return CONTINUE;
+ if(!pcrefd->re) return pcrefd->action;
+ for(; offset < *length_p; nreplaces++){
+
+ count = pcre_exec(pcrefd->re, NULL, *buf_p, *length_p, offset, 0, ovector, 48);
+ if(count <= 0) break;
+ if(!(replace = pcrefd->replace) || param->nooverwritefilter) return pcrefd->action;
+
+ replen = *length_p - ovector[1];
+ while(*replace){
+ if(*replace == '\\' && *(replace +1)){
+ replace+=2;
+ ++replen;
+ }
+ else if(*replace == '$' && isnumber(*(replace+1))){
+ replace ++;
+ num = atoi(replace);
+ while(isnumber(*replace)) replace++;
+ if(num > (count - 1)) continue;
+ replen += (ovector[(num<<1) + 1] - ovector[(num<<1)]);
+ }
+ else {
+ replace++;
+ replen++;
+ }
+ }
+
+ tmpbuf = (*pl->myalloc)(replen);
+ if(!tmpbuf) return CONTINUE;
+ for(target = tmpbuf, replace = pcrefd->replace; *replace; ){
+ if(*replace == '\\' && *(replace +1)){
+ *target++ = replace[1];
+ replace+=2;
+ }
+ else if(*replace == '$' && isnumber(*(replace+1))){
+ replace ++;
+ num = atoi(replace);
+ if(num > (count - 1)) continue;
+ memcpy(target, *buf_p + ovector[(num<<1)], ovector[(num<<1) + 1] - ovector[(num<<1)]);
+ target += (ovector[(num<<1) + 1] - ovector[(num<<1)]);
+ while(isnumber(*replace)) replace++;
+ }
+ else {
+ *target++ = *replace++;
+ }
+ }
+ memcpy(target, *buf_p + ovector[1], *length_p - ovector[1]);
+ if((ovector[0] + replen + 1) > *bufsize_p){
+ newbuf = (*pl->myalloc)(ovector[0] + replen + 1);
+ if(!newbuf){
+ (*pl->myfree)(tmpbuf);
+ return CONTINUE;
+ }
+ memcpy(newbuf, *buf_p, ovector[0]);
+ (*pl->myfree)(*buf_p);
+ *buf_p = newbuf;
+ *bufsize_p = ovector[0] + replen + 1;
+ }
+ memcpy(*buf_p + ovector[0], tmpbuf, replen);
+ (*pl->myfree)(tmpbuf);
+ (*buf_p)[ovector[0] + replen] = 0;
+ *length_p = ovector[0] + replen;
+ if(ovector[0] + replen <= offset){
+ break;
+ }
+ offset = ovector[0] + (int)strlen(pcrefd->replace);
+ }
+ return nreplaces? pcrefd->action : CONTINUE;
+#undef pcrefd
+}
+
+static void pcre_filter_clear(void *fo){
+}
+
+static void pcre_filter_close(void *fo){
+ if(!fo) return;
+ pcre_data_free((struct pcre_filter_data *)fo);
+}
+
+static int h_pcre(int argc, unsigned char **argv){
+ int action = 0;
+ pcre *re = NULL;
+ struct ace *acl;
+ int offset = 4;
+ const char * errptr;
+ struct pcre_filter_data *flt;
+ struct filter *newf;
+ char *replace = NULL;
+
+ if(!strcmp(argv[2], "allow")) action = PASS;
+ else if(!strcmp(argv[2], "deny")) action = REJECT;
+ else if(!strcmp(argv[2], "remove")) action = REMOVE;
+ else if(!strcmp(argv[2], "dunno")) action = CONTINUE;
+ else return 1;
+ if(!strcmp(argv[0], "pcre_rewrite")) {
+ int i,j;
+ offset = 5;
+ replace = pl->mystrdup(argv[4]);
+ if(!replace) return 9;
+ for(i=0, j=0; replace[i]; i++, j++){
+ if(replace[i] == '\\'){
+ switch(replace[i+1]){
+ case 'r':
+ i++;
+ replace[j] = '\r';
+ break;
+ case 'n':
+ i++;
+ replace[j] = '\n';
+ break;
+ case '0':
+ i++;
+ replace[j] = 0;
+ break;
+ case '\\':
+ i++;
+ default:
+ replace[j] = '\\';
+ break;
+ }
+ }
+ else replace[j] = replace[i];
+ }
+ replace[j] = 0;
+ }
+ if(!(acl = pl->make_ace(argc - offset, argv + offset))) return 2;
+ if(*argv[3] && !(*argv[3] == '*' && !argv[3][1]) ){
+ re = pcre_compile((char *)argv[3], pcre_options, &errptr, &offset, NULL);
+ if(!re) {
+ pl->myfree(acl);
+ if(replace) pl->myfree(replace);
+ return 3;
+ }
+ }
+ flt = pl->myalloc(sizeof(struct pcre_filter_data));
+ newf = pl->myalloc(sizeof(struct filter));
+
+ if(!flt || !newf) {
+ pl->myfree(acl);
+ pl->myfree(re);
+ if(replace) pl->myfree(replace);
+ if(flt) pl->myfree(flt);
+ return 4;
+ }
+ memset(flt, 0, sizeof(struct pcre_filter_data));
+ memset(newf, 0, sizeof(struct filter));
+ flt->action = action;
+ flt->re = re;
+ flt->acl = acl;
+ flt->replace = replace;
+ flt->users = 1;
+ newf->instance = "pcre";
+ newf->data = flt;
+ newf->filter_open = pcre_filter_open;
+ newf->filter_client = pcre_filter_client;
+ if(strstr(argv[1], "request"))newf->filter_request = pcre_filter_buffer;
+ if(strstr(argv[1], "cliheader"))newf->filter_header_cli = pcre_filter_buffer;
+ if(strstr(argv[1], "clidata"))newf->filter_data_cli = pcre_filter_buffer;
+ if(strstr(argv[1], "srvheader"))newf->filter_header_srv = pcre_filter_buffer;
+ if(strstr(argv[1], "srvdata"))newf->filter_data_srv = pcre_filter_buffer;
+ newf->filter_clear = pcre_filter_clear;
+ newf->filter_close = pcre_filter_close;
+
+ if(!pcre_last_filter){
+ newf->next = pcre_first_filter.next;
+ pcre_first_filter.next=newf;
+ }
+ else {
+ newf->next = pcre_last_filter->next;
+ pcre_last_filter->next = newf;
+ }
+ pcre_last_filter=newf;
+
+ return 0;
+}
+
+static int h_pcre_extend(int argc, unsigned char **argv){
+ struct ace *acl;
+ if(!pcre_last_filter || !pcre_last_filter->data) return 1;
+ acl = ((struct pcre_filter_data *)pcre_last_filter->data)->acl;
+ if(!acl) return 2;
+ for(; acl->next; acl=acl->next);
+ acl->next = (*pl->make_ace)(argc - 1, argv + 1);
+ if(!acl->next) return 3;
+ return 0;
+}
+
+static int h_pcre_options(int argc, unsigned char **argv){
+ int i,j;
+
+ pcre_options = 0;
+ for(j=1; jmyalloc;
+ pcre_free = pl->myfree;
+ pcre_loaded = 1;
+ pthread_mutex_init(&pcre_mutex, NULL);
+ regexp_symbols[6].value = pl->myfree;
+ regexp_symbols[6].next = pl->symbols.next;
+ pl->symbols.next = regexp_symbols;
+ pcre_commandhandlers[3].next = pl->commandhandlers->next;
+ pl->commandhandlers->next = pcre_commandhandlers;
+ pcre_first_filter.next = pl->conf->filters;
+ pl->conf->filters = &pcre_first_filter;
+ }
+ else if(pcre_last_filter){
+ pcre_first_filter.next = pcre_last_filter->next;
+ flt = pcre_first_filter.next;
+ for(; flt; flt = tmpflt){
+ tmpflt = flt->next;
+ if(flt->data)
+ pcre_data_free((struct pcre_filter_data *)flt->data);
+ pl->myfree(flt);
+ if(flt == pcre_last_filter) break;
+ }
+ }
+ pcre_last_filter = NULL;
+ return 0;
+
+ }
+#ifdef __cplusplus
+}
+#endif
diff --git a/src/plugins/PCREPlugin/pcre_refcount.c b/src/plugins/PCREPlugin/pcre_refcount.c
new file mode 100644
index 0000000..b14103c
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_refcount.c
@@ -0,0 +1,82 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_refcount(), which is an
+auxiliary function that can be used to maintain a reference count in a compiled
+pattern data block. This might be helpful in applications where the block is
+shared by different users. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Maintain reference count *
+*************************************************/
+
+/* The reference count is a 16-bit field, initialized to zero. It is not
+possible to transfer a non-zero count from one host to a different host that
+has a different byte order - though I can't see why anyone in their right mind
+would ever want to do that!
+
+Arguments:
+ argument_re points to compiled code
+ adjust value to add to the count
+
+Returns: the (possibly updated) count value (a non-negative number), or
+ a negative error number
+*/
+
+PCRE_EXP_DEFN int
+pcre_refcount(pcre *argument_re, int adjust)
+{
+real_pcre *re = (real_pcre *)argument_re;
+if (re == NULL) return PCRE_ERROR_NULL;
+re->ref_count = (-adjust > re->ref_count)? 0 :
+ (adjust + re->ref_count > 65535)? 65535 :
+ re->ref_count + adjust;
+return re->ref_count;
+}
+
+/* End of pcre_refcount.c */
diff --git a/src/plugins/PCREPlugin/pcre_study.c b/src/plugins/PCREPlugin/pcre_study.c
new file mode 100644
index 0000000..1c28384
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_study.c
@@ -0,0 +1,579 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_study(), along with local
+supporting functions. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/* Returns from set_start_bits() */
+
+enum { SSB_FAIL, SSB_DONE, SSB_CONTINUE };
+
+
+/*************************************************
+* Set a bit and maybe its alternate case *
+*************************************************/
+
+/* Given a character, set its bit in the table, and also the bit for the other
+version of a letter if we are caseless.
+
+Arguments:
+ start_bits points to the bit map
+ c is the character
+ caseless the caseless flag
+ cd the block with char table pointers
+
+Returns: nothing
+*/
+
+static void
+set_bit(uschar *start_bits, unsigned int c, BOOL caseless, compile_data *cd)
+{
+start_bits[c/8] |= (1 << (c&7));
+if (caseless && (cd->ctypes[c] & ctype_letter) != 0)
+ start_bits[cd->fcc[c]/8] |= (1 << (cd->fcc[c]&7));
+}
+
+
+
+/*************************************************
+* Create bitmap of starting bytes *
+*************************************************/
+
+/* This function scans a compiled unanchored expression recursively and
+attempts to build a bitmap of the set of possible starting bytes. As time goes
+by, we may be able to get more clever at doing this. The SSB_CONTINUE return is
+useful for parenthesized groups in patterns such as (a*)b where the group
+provides some optional starting bytes but scanning must continue at the outer
+level to find at least one mandatory byte. At the outermost level, this
+function fails unless the result is SSB_DONE.
+
+Arguments:
+ code points to an expression
+ start_bits points to a 32-byte table, initialized to 0
+ caseless the current state of the caseless flag
+ utf8 TRUE if in UTF-8 mode
+ cd the block with char table pointers
+
+Returns: SSB_FAIL => Failed to find any starting bytes
+ SSB_DONE => Found mandatory starting bytes
+ SSB_CONTINUE => Found optional starting bytes
+*/
+
+static int
+set_start_bits(const uschar *code, uschar *start_bits, BOOL caseless,
+ BOOL utf8, compile_data *cd)
+{
+register int c;
+int yield = SSB_DONE;
+
+#if 0
+/* ========================================================================= */
+/* The following comment and code was inserted in January 1999. In May 2006,
+when it was observed to cause compiler warnings about unused values, I took it
+out again. If anybody is still using OS/2, they will have to put it back
+manually. */
+
+/* This next statement and the later reference to dummy are here in order to
+trick the optimizer of the IBM C compiler for OS/2 into generating correct
+code. Apparently IBM isn't going to fix the problem, and we would rather not
+disable optimization (in this module it actually makes a big difference, and
+the pcre module can use all the optimization it can get). */
+
+volatile int dummy;
+/* ========================================================================= */
+#endif
+
+do
+ {
+ const uschar *tcode = code + (((int)*code == OP_CBRA)? 3:1) + LINK_SIZE;
+ BOOL try_next = TRUE;
+
+ while (try_next) /* Loop for items in this branch */
+ {
+ int rc;
+ switch(*tcode)
+ {
+ /* Fail if we reach something we don't understand */
+
+ default:
+ return SSB_FAIL;
+
+ /* If we hit a bracket or a positive lookahead assertion, recurse to set
+ bits from within the subpattern. If it can't find anything, we have to
+ give up. If it finds some mandatory character(s), we are done for this
+ branch. Otherwise, carry on scanning after the subpattern. */
+
+ case OP_BRA:
+ case OP_SBRA:
+ case OP_CBRA:
+ case OP_SCBRA:
+ case OP_ONCE:
+ case OP_ASSERT:
+ rc = set_start_bits(tcode, start_bits, caseless, utf8, cd);
+ if (rc == SSB_FAIL) return SSB_FAIL;
+ if (rc == SSB_DONE) try_next = FALSE; else
+ {
+ do tcode += GET(tcode, 1); while (*tcode == OP_ALT);
+ tcode += 1 + LINK_SIZE;
+ }
+ break;
+
+ /* If we hit ALT or KET, it means we haven't found anything mandatory in
+ this branch, though we might have found something optional. For ALT, we
+ continue with the next alternative, but we have to arrange that the final
+ result from subpattern is SSB_CONTINUE rather than SSB_DONE. For KET,
+ return SSB_CONTINUE: if this is the top level, that indicates failure,
+ but after a nested subpattern, it causes scanning to continue. */
+
+ case OP_ALT:
+ yield = SSB_CONTINUE;
+ try_next = FALSE;
+ break;
+
+ case OP_KET:
+ case OP_KETRMAX:
+ case OP_KETRMIN:
+ return SSB_CONTINUE;
+
+ /* Skip over callout */
+
+ case OP_CALLOUT:
+ tcode += 2 + 2*LINK_SIZE;
+ break;
+
+ /* Skip over lookbehind and negative lookahead assertions */
+
+ case OP_ASSERT_NOT:
+ case OP_ASSERTBACK:
+ case OP_ASSERTBACK_NOT:
+ do tcode += GET(tcode, 1); while (*tcode == OP_ALT);
+ tcode += 1 + LINK_SIZE;
+ break;
+
+ /* Skip over an option setting, changing the caseless flag */
+
+ case OP_OPT:
+ caseless = (tcode[1] & PCRE_CASELESS) != 0;
+ tcode += 2;
+ break;
+
+ /* BRAZERO does the bracket, but carries on. */
+
+ case OP_BRAZERO:
+ case OP_BRAMINZERO:
+ if (set_start_bits(++tcode, start_bits, caseless, utf8, cd) == SSB_FAIL)
+ return SSB_FAIL;
+/* =========================================================================
+ See the comment at the head of this function concerning the next line,
+ which was an old fudge for the benefit of OS/2.
+ dummy = 1;
+ ========================================================================= */
+ do tcode += GET(tcode,1); while (*tcode == OP_ALT);
+ tcode += 1 + LINK_SIZE;
+ break;
+
+ /* Single-char * or ? sets the bit and tries the next item */
+
+ case OP_STAR:
+ case OP_MINSTAR:
+ case OP_POSSTAR:
+ case OP_QUERY:
+ case OP_MINQUERY:
+ case OP_POSQUERY:
+ set_bit(start_bits, tcode[1], caseless, cd);
+ tcode += 2;
+#ifdef SUPPORT_UTF8
+ if (utf8 && tcode[-1] >= 0xc0)
+ tcode += _pcre_utf8_table4[tcode[-1] & 0x3f];
+#endif
+ break;
+
+ /* Single-char upto sets the bit and tries the next */
+
+ case OP_UPTO:
+ case OP_MINUPTO:
+ case OP_POSUPTO:
+ set_bit(start_bits, tcode[3], caseless, cd);
+ tcode += 4;
+#ifdef SUPPORT_UTF8
+ if (utf8 && tcode[-1] >= 0xc0)
+ tcode += _pcre_utf8_table4[tcode[-1] & 0x3f];
+#endif
+ break;
+
+ /* At least one single char sets the bit and stops */
+
+ case OP_EXACT: /* Fall through */
+ tcode += 2;
+
+ case OP_CHAR:
+ case OP_CHARNC:
+ case OP_PLUS:
+ case OP_MINPLUS:
+ case OP_POSPLUS:
+ set_bit(start_bits, tcode[1], caseless, cd);
+ try_next = FALSE;
+ break;
+
+ /* Single character type sets the bits and stops */
+
+ case OP_NOT_DIGIT:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= ~cd->cbits[c+cbit_digit];
+ try_next = FALSE;
+ break;
+
+ case OP_DIGIT:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= cd->cbits[c+cbit_digit];
+ try_next = FALSE;
+ break;
+
+ /* The cbit_space table has vertical tab as whitespace; we have to
+ discard it. */
+
+ case OP_NOT_WHITESPACE:
+ for (c = 0; c < 32; c++)
+ {
+ int d = cd->cbits[c+cbit_space];
+ if (c == 1) d &= ~0x08;
+ start_bits[c] |= ~d;
+ }
+ try_next = FALSE;
+ break;
+
+ /* The cbit_space table has vertical tab as whitespace; we have to
+ discard it. */
+
+ case OP_WHITESPACE:
+ for (c = 0; c < 32; c++)
+ {
+ int d = cd->cbits[c+cbit_space];
+ if (c == 1) d &= ~0x08;
+ start_bits[c] |= d;
+ }
+ try_next = FALSE;
+ break;
+
+ case OP_NOT_WORDCHAR:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= ~cd->cbits[c+cbit_word];
+ try_next = FALSE;
+ break;
+
+ case OP_WORDCHAR:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= cd->cbits[c+cbit_word];
+ try_next = FALSE;
+ break;
+
+ /* One or more character type fudges the pointer and restarts, knowing
+ it will hit a single character type and stop there. */
+
+ case OP_TYPEPLUS:
+ case OP_TYPEMINPLUS:
+ tcode++;
+ break;
+
+ case OP_TYPEEXACT:
+ tcode += 3;
+ break;
+
+ /* Zero or more repeats of character types set the bits and then
+ try again. */
+
+ case OP_TYPEUPTO:
+ case OP_TYPEMINUPTO:
+ case OP_TYPEPOSUPTO:
+ tcode += 2; /* Fall through */
+
+ case OP_TYPESTAR:
+ case OP_TYPEMINSTAR:
+ case OP_TYPEPOSSTAR:
+ case OP_TYPEQUERY:
+ case OP_TYPEMINQUERY:
+ case OP_TYPEPOSQUERY:
+ switch(tcode[1])
+ {
+ case OP_ANY:
+ return SSB_FAIL;
+
+ case OP_NOT_DIGIT:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= ~cd->cbits[c+cbit_digit];
+ break;
+
+ case OP_DIGIT:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= cd->cbits[c+cbit_digit];
+ break;
+
+ /* The cbit_space table has vertical tab as whitespace; we have to
+ discard it. */
+
+ case OP_NOT_WHITESPACE:
+ for (c = 0; c < 32; c++)
+ {
+ int d = cd->cbits[c+cbit_space];
+ if (c == 1) d &= ~0x08;
+ start_bits[c] |= ~d;
+ }
+ break;
+
+ /* The cbit_space table has vertical tab as whitespace; we have to
+ discard it. */
+
+ case OP_WHITESPACE:
+ for (c = 0; c < 32; c++)
+ {
+ int d = cd->cbits[c+cbit_space];
+ if (c == 1) d &= ~0x08;
+ start_bits[c] |= d;
+ }
+ break;
+
+ case OP_NOT_WORDCHAR:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= ~cd->cbits[c+cbit_word];
+ break;
+
+ case OP_WORDCHAR:
+ for (c = 0; c < 32; c++)
+ start_bits[c] |= cd->cbits[c+cbit_word];
+ break;
+ }
+
+ tcode += 2;
+ break;
+
+ /* Character class where all the information is in a bit map: set the
+ bits and either carry on or not, according to the repeat count. If it was
+ a negative class, and we are operating with UTF-8 characters, any byte
+ with a value >= 0xc4 is a potentially valid starter because it starts a
+ character with a value > 255. */
+
+ case OP_NCLASS:
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ start_bits[24] |= 0xf0; /* Bits for 0xc4 - 0xc8 */
+ memset(start_bits+25, 0xff, 7); /* Bits for 0xc9 - 0xff */
+ }
+#endif
+ /* Fall through */
+
+ case OP_CLASS:
+ {
+ tcode++;
+
+ /* In UTF-8 mode, the bits in a bit map correspond to character
+ values, not to byte values. However, the bit map we are constructing is
+ for byte values. So we have to do a conversion for characters whose
+ value is > 127. In fact, there are only two possible starting bytes for
+ characters in the range 128 - 255. */
+
+#ifdef SUPPORT_UTF8
+ if (utf8)
+ {
+ for (c = 0; c < 16; c++) start_bits[c] |= tcode[c];
+ for (c = 128; c < 256; c++)
+ {
+ if ((tcode[c/8] && (1 << (c&7))) != 0)
+ {
+ int d = (c >> 6) | 0xc0; /* Set bit for this starter */
+ start_bits[d/8] |= (1 << (d&7)); /* and then skip on to the */
+ c = (c & 0xc0) + 0x40 - 1; /* next relevant character. */
+ }
+ }
+ }
+
+ /* In non-UTF-8 mode, the two bit maps are completely compatible. */
+
+ else
+#endif
+ {
+ for (c = 0; c < 32; c++) start_bits[c] |= tcode[c];
+ }
+
+ /* Advance past the bit map, and act on what follows */
+
+ tcode += 32;
+ switch (*tcode)
+ {
+ case OP_CRSTAR:
+ case OP_CRMINSTAR:
+ case OP_CRQUERY:
+ case OP_CRMINQUERY:
+ tcode++;
+ break;
+
+ case OP_CRRANGE:
+ case OP_CRMINRANGE:
+ if (((tcode[1] << 8) + tcode[2]) == 0) tcode += 5;
+ else try_next = FALSE;
+ break;
+
+ default:
+ try_next = FALSE;
+ break;
+ }
+ }
+ break; /* End of bitmap class handling */
+
+ } /* End of switch */
+ } /* End of try_next loop */
+
+ code += GET(code, 1); /* Advance to next branch */
+ }
+while (*code == OP_ALT);
+return yield;
+}
+
+
+
+/*************************************************
+* Study a compiled expression *
+*************************************************/
+
+/* This function is handed a compiled expression that it must study to produce
+information that will speed up the matching. It returns a pcre_extra block
+which then gets handed back to pcre_exec().
+
+Arguments:
+ re points to the compiled expression
+ options contains option bits
+ errorptr points to where to place error messages;
+ set NULL unless error
+
+Returns: pointer to a pcre_extra block, with study_data filled in and the
+ appropriate flag set;
+ NULL on error or if no optimization possible
+*/
+
+PCRE_EXP_DEFN pcre_extra *
+pcre_study(const pcre *external_re, int options, const char **errorptr)
+{
+uschar start_bits[32];
+pcre_extra *extra;
+pcre_study_data *study;
+const uschar *tables;
+uschar *code;
+compile_data compile_block;
+const real_pcre *re = (const real_pcre *)external_re;
+
+*errorptr = NULL;
+
+if (re == NULL || re->magic_number != MAGIC_NUMBER)
+ {
+ *errorptr = "argument is not a compiled regular expression";
+ return NULL;
+ }
+
+if ((options & ~PUBLIC_STUDY_OPTIONS) != 0)
+ {
+ *errorptr = "unknown or incorrect option bit(s) set";
+ return NULL;
+ }
+
+code = (uschar *)re + re->name_table_offset +
+ (re->name_count * re->name_entry_size);
+
+/* For an anchored pattern, or an unanchored pattern that has a first char, or
+a multiline pattern that matches only at "line starts", no further processing
+at present. */
+
+if ((re->options & PCRE_ANCHORED) != 0 ||
+ (re->flags & (PCRE_FIRSTSET|PCRE_STARTLINE)) != 0)
+ return NULL;
+
+/* Set the character tables in the block that is passed around */
+
+tables = re->tables;
+if (tables == NULL)
+ (void)pcre_fullinfo(external_re, NULL, PCRE_INFO_DEFAULT_TABLES,
+ (void *)(&tables));
+
+compile_block.lcc = tables + lcc_offset;
+compile_block.fcc = tables + fcc_offset;
+compile_block.cbits = tables + cbits_offset;
+compile_block.ctypes = tables + ctypes_offset;
+
+/* See if we can find a fixed set of initial characters for the pattern. */
+
+memset(start_bits, 0, 32 * sizeof(uschar));
+if (set_start_bits(code, start_bits, (re->options & PCRE_CASELESS) != 0,
+ (re->options & PCRE_UTF8) != 0, &compile_block) != SSB_DONE) return NULL;
+
+/* Get a pcre_extra block and a pcre_study_data block. The study data is put in
+the latter, which is pointed to by the former, which may also get additional
+data set later by the calling program. At the moment, the size of
+pcre_study_data is fixed. We nevertheless save it in a field for returning via
+the pcre_fullinfo() function so that if it becomes variable in the future, we
+don't have to change that code. */
+
+extra = (pcre_extra *)(pcre_malloc)
+ (sizeof(pcre_extra) + sizeof(pcre_study_data));
+
+if (extra == NULL)
+ {
+ *errorptr = "failed to get memory";
+ return NULL;
+ }
+
+study = (pcre_study_data *)((char *)extra + sizeof(pcre_extra));
+extra->flags = PCRE_EXTRA_STUDY_DATA;
+extra->study_data = study;
+
+study->size = sizeof(pcre_study_data);
+study->options = PCRE_STUDY_MAPPED;
+memcpy(study->start_bits, start_bits, sizeof(start_bits));
+
+return extra;
+}
+
+/* End of pcre_study.c */
diff --git a/src/plugins/PCREPlugin/pcre_tables.c b/src/plugins/PCREPlugin/pcre_tables.c
new file mode 100644
index 0000000..4b14fd1
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_tables.c
@@ -0,0 +1,318 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains some fixed tables that are used by more than one of the
+PCRE code modules. The tables are also #included by the pcretest program, which
+uses macros to change their names from _pcre_xxx to xxxx, thereby avoiding name
+clashes with the library. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/* Table of sizes for the fixed-length opcodes. It's defined in a macro so that
+the definition is next to the definition of the opcodes in pcre_internal.h. */
+
+const uschar _pcre_OP_lengths[] = { OP_LENGTHS };
+
+
+
+/*************************************************
+* Tables for UTF-8 support *
+*************************************************/
+
+/* These are the breakpoints for different numbers of bytes in a UTF-8
+character. */
+
+#ifdef SUPPORT_UTF8
+
+const int _pcre_utf8_table1[] =
+ { 0x7f, 0x7ff, 0xffff, 0x1fffff, 0x3ffffff, 0x7fffffff};
+
+const int _pcre_utf8_table1_size = sizeof(_pcre_utf8_table1)/sizeof(int);
+
+/* These are the indicator bits and the mask for the data bits to set in the
+first byte of a character, indexed by the number of additional bytes. */
+
+const int _pcre_utf8_table2[] = { 0, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc};
+const int _pcre_utf8_table3[] = { 0xff, 0x1f, 0x0f, 0x07, 0x03, 0x01};
+
+/* Table of the number of extra bytes, indexed by the first byte masked with
+0x3f. The highest number for a valid UTF-8 first byte is in fact 0x3d. */
+
+const uschar _pcre_utf8_table4[] = {
+ 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,
+ 3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5 };
+
+/* The pcre_utt[] table below translates Unicode property names into type and
+code values. It is searched by binary chop, so must be in collating sequence of
+name. Originally, the table contained pointers to the name strings in the first
+field of each entry. However, that leads to a large number of relocations when
+a shared library is dynamically loaded. A significant reduction is made by
+putting all the names into a single, large string and then using offsets in the
+table itself. Maintenance is more error-prone, but frequent changes to this
+data is unlikely. */
+
+const char _pcre_utt_names[] =
+ "Any\0"
+ "Arabic\0"
+ "Armenian\0"
+ "Balinese\0"
+ "Bengali\0"
+ "Bopomofo\0"
+ "Braille\0"
+ "Buginese\0"
+ "Buhid\0"
+ "C\0"
+ "Canadian_Aboriginal\0"
+ "Cc\0"
+ "Cf\0"
+ "Cherokee\0"
+ "Cn\0"
+ "Co\0"
+ "Common\0"
+ "Coptic\0"
+ "Cs\0"
+ "Cuneiform\0"
+ "Cypriot\0"
+ "Cyrillic\0"
+ "Deseret\0"
+ "Devanagari\0"
+ "Ethiopic\0"
+ "Georgian\0"
+ "Glagolitic\0"
+ "Gothic\0"
+ "Greek\0"
+ "Gujarati\0"
+ "Gurmukhi\0"
+ "Han\0"
+ "Hangul\0"
+ "Hanunoo\0"
+ "Hebrew\0"
+ "Hiragana\0"
+ "Inherited\0"
+ "Kannada\0"
+ "Katakana\0"
+ "Kharoshthi\0"
+ "Khmer\0"
+ "L\0"
+ "L&\0"
+ "Lao\0"
+ "Latin\0"
+ "Limbu\0"
+ "Linear_B\0"
+ "Ll\0"
+ "Lm\0"
+ "Lo\0"
+ "Lt\0"
+ "Lu\0"
+ "M\0"
+ "Malayalam\0"
+ "Mc\0"
+ "Me\0"
+ "Mn\0"
+ "Mongolian\0"
+ "Myanmar\0"
+ "N\0"
+ "Nd\0"
+ "New_Tai_Lue\0"
+ "Nko\0"
+ "Nl\0"
+ "No\0"
+ "Ogham\0"
+ "Old_Italic\0"
+ "Old_Persian\0"
+ "Oriya\0"
+ "Osmanya\0"
+ "P\0"
+ "Pc\0"
+ "Pd\0"
+ "Pe\0"
+ "Pf\0"
+ "Phags_Pa\0"
+ "Phoenician\0"
+ "Pi\0"
+ "Po\0"
+ "Ps\0"
+ "Runic\0"
+ "S\0"
+ "Sc\0"
+ "Shavian\0"
+ "Sinhala\0"
+ "Sk\0"
+ "Sm\0"
+ "So\0"
+ "Syloti_Nagri\0"
+ "Syriac\0"
+ "Tagalog\0"
+ "Tagbanwa\0"
+ "Tai_Le\0"
+ "Tamil\0"
+ "Telugu\0"
+ "Thaana\0"
+ "Thai\0"
+ "Tibetan\0"
+ "Tifinagh\0"
+ "Ugaritic\0"
+ "Yi\0"
+ "Z\0"
+ "Zl\0"
+ "Zp\0"
+ "Zs\0";
+
+const ucp_type_table _pcre_utt[] = {
+ { 0, PT_ANY, 0 },
+ { 4, PT_SC, ucp_Arabic },
+ { 11, PT_SC, ucp_Armenian },
+ { 20, PT_SC, ucp_Balinese },
+ { 29, PT_SC, ucp_Bengali },
+ { 37, PT_SC, ucp_Bopomofo },
+ { 46, PT_SC, ucp_Braille },
+ { 54, PT_SC, ucp_Buginese },
+ { 63, PT_SC, ucp_Buhid },
+ { 69, PT_GC, ucp_C },
+ { 71, PT_SC, ucp_Canadian_Aboriginal },
+ { 91, PT_PC, ucp_Cc },
+ { 94, PT_PC, ucp_Cf },
+ { 97, PT_SC, ucp_Cherokee },
+ { 106, PT_PC, ucp_Cn },
+ { 109, PT_PC, ucp_Co },
+ { 112, PT_SC, ucp_Common },
+ { 119, PT_SC, ucp_Coptic },
+ { 126, PT_PC, ucp_Cs },
+ { 129, PT_SC, ucp_Cuneiform },
+ { 139, PT_SC, ucp_Cypriot },
+ { 147, PT_SC, ucp_Cyrillic },
+ { 156, PT_SC, ucp_Deseret },
+ { 164, PT_SC, ucp_Devanagari },
+ { 175, PT_SC, ucp_Ethiopic },
+ { 184, PT_SC, ucp_Georgian },
+ { 193, PT_SC, ucp_Glagolitic },
+ { 204, PT_SC, ucp_Gothic },
+ { 211, PT_SC, ucp_Greek },
+ { 217, PT_SC, ucp_Gujarati },
+ { 226, PT_SC, ucp_Gurmukhi },
+ { 235, PT_SC, ucp_Han },
+ { 239, PT_SC, ucp_Hangul },
+ { 246, PT_SC, ucp_Hanunoo },
+ { 254, PT_SC, ucp_Hebrew },
+ { 261, PT_SC, ucp_Hiragana },
+ { 270, PT_SC, ucp_Inherited },
+ { 280, PT_SC, ucp_Kannada },
+ { 288, PT_SC, ucp_Katakana },
+ { 297, PT_SC, ucp_Kharoshthi },
+ { 308, PT_SC, ucp_Khmer },
+ { 314, PT_GC, ucp_L },
+ { 316, PT_LAMP, 0 },
+ { 319, PT_SC, ucp_Lao },
+ { 323, PT_SC, ucp_Latin },
+ { 329, PT_SC, ucp_Limbu },
+ { 335, PT_SC, ucp_Linear_B },
+ { 344, PT_PC, ucp_Ll },
+ { 347, PT_PC, ucp_Lm },
+ { 350, PT_PC, ucp_Lo },
+ { 353, PT_PC, ucp_Lt },
+ { 356, PT_PC, ucp_Lu },
+ { 359, PT_GC, ucp_M },
+ { 361, PT_SC, ucp_Malayalam },
+ { 371, PT_PC, ucp_Mc },
+ { 374, PT_PC, ucp_Me },
+ { 377, PT_PC, ucp_Mn },
+ { 380, PT_SC, ucp_Mongolian },
+ { 390, PT_SC, ucp_Myanmar },
+ { 398, PT_GC, ucp_N },
+ { 400, PT_PC, ucp_Nd },
+ { 403, PT_SC, ucp_New_Tai_Lue },
+ { 415, PT_SC, ucp_Nko },
+ { 419, PT_PC, ucp_Nl },
+ { 422, PT_PC, ucp_No },
+ { 425, PT_SC, ucp_Ogham },
+ { 431, PT_SC, ucp_Old_Italic },
+ { 442, PT_SC, ucp_Old_Persian },
+ { 454, PT_SC, ucp_Oriya },
+ { 460, PT_SC, ucp_Osmanya },
+ { 468, PT_GC, ucp_P },
+ { 470, PT_PC, ucp_Pc },
+ { 473, PT_PC, ucp_Pd },
+ { 476, PT_PC, ucp_Pe },
+ { 479, PT_PC, ucp_Pf },
+ { 482, PT_SC, ucp_Phags_Pa },
+ { 491, PT_SC, ucp_Phoenician },
+ { 502, PT_PC, ucp_Pi },
+ { 505, PT_PC, ucp_Po },
+ { 508, PT_PC, ucp_Ps },
+ { 511, PT_SC, ucp_Runic },
+ { 517, PT_GC, ucp_S },
+ { 519, PT_PC, ucp_Sc },
+ { 522, PT_SC, ucp_Shavian },
+ { 530, PT_SC, ucp_Sinhala },
+ { 538, PT_PC, ucp_Sk },
+ { 541, PT_PC, ucp_Sm },
+ { 544, PT_PC, ucp_So },
+ { 547, PT_SC, ucp_Syloti_Nagri },
+ { 560, PT_SC, ucp_Syriac },
+ { 567, PT_SC, ucp_Tagalog },
+ { 575, PT_SC, ucp_Tagbanwa },
+ { 584, PT_SC, ucp_Tai_Le },
+ { 591, PT_SC, ucp_Tamil },
+ { 597, PT_SC, ucp_Telugu },
+ { 604, PT_SC, ucp_Thaana },
+ { 611, PT_SC, ucp_Thai },
+ { 616, PT_SC, ucp_Tibetan },
+ { 624, PT_SC, ucp_Tifinagh },
+ { 633, PT_SC, ucp_Ugaritic },
+ { 642, PT_SC, ucp_Yi },
+ { 645, PT_GC, ucp_Z },
+ { 647, PT_PC, ucp_Zl },
+ { 650, PT_PC, ucp_Zp },
+ { 653, PT_PC, ucp_Zs }
+};
+
+const int _pcre_utt_size = sizeof(_pcre_utt)/sizeof(ucp_type_table);
+
+#endif /* SUPPORT_UTF8 */
+
+/* End of pcre_tables.c */
diff --git a/src/plugins/PCREPlugin/pcre_try_flipped.c b/src/plugins/PCREPlugin/pcre_try_flipped.c
new file mode 100644
index 0000000..412902b
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_try_flipped.c
@@ -0,0 +1,137 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains an internal function that tests a compiled pattern to
+see if it was compiled with the opposite endianness. If so, it uses an
+auxiliary local function to flip the appropriate bytes. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Flip bytes in an integer *
+*************************************************/
+
+/* This function is called when the magic number in a regex doesn't match, in
+order to flip its bytes to see if we are dealing with a pattern that was
+compiled on a host of different endianness. If so, this function is used to
+flip other byte values.
+
+Arguments:
+ value the number to flip
+ n the number of bytes to flip (assumed to be 2 or 4)
+
+Returns: the flipped value
+*/
+
+static unsigned long int
+byteflip(unsigned long int value, int n)
+{
+if (n == 2) return ((value & 0x00ff) << 8) | ((value & 0xff00) >> 8);
+return ((value & 0x000000ff) << 24) |
+ ((value & 0x0000ff00) << 8) |
+ ((value & 0x00ff0000) >> 8) |
+ ((value & 0xff000000) >> 24);
+}
+
+
+
+/*************************************************
+* Test for a byte-flipped compiled regex *
+*************************************************/
+
+/* This function is called from pcre_exec(), pcre_dfa_exec(), and also from
+pcre_fullinfo(). Its job is to test whether the regex is byte-flipped - that
+is, it was compiled on a system of opposite endianness. The function is called
+only when the native MAGIC_NUMBER test fails. If the regex is indeed flipped,
+we flip all the relevant values into a different data block, and return it.
+
+Arguments:
+ re points to the regex
+ study points to study data, or NULL
+ internal_re points to a new regex block
+ internal_study points to a new study block
+
+Returns: the new block if is is indeed a byte-flipped regex
+ NULL if it is not
+*/
+
+real_pcre *
+_pcre_try_flipped(const real_pcre *re, real_pcre *internal_re,
+ const pcre_study_data *study, pcre_study_data *internal_study)
+{
+if (byteflip(re->magic_number, sizeof(re->magic_number)) != MAGIC_NUMBER)
+ return NULL;
+
+*internal_re = *re; /* To copy other fields */
+internal_re->size = byteflip(re->size, sizeof(re->size));
+internal_re->options = byteflip(re->options, sizeof(re->options));
+internal_re->flags = (pcre_uint16)byteflip(re->flags, sizeof(re->flags));
+internal_re->top_bracket =
+ (pcre_uint16)byteflip(re->top_bracket, sizeof(re->top_bracket));
+internal_re->top_backref =
+ (pcre_uint16)byteflip(re->top_backref, sizeof(re->top_backref));
+internal_re->first_byte =
+ (pcre_uint16)byteflip(re->first_byte, sizeof(re->first_byte));
+internal_re->req_byte =
+ (pcre_uint16)byteflip(re->req_byte, sizeof(re->req_byte));
+internal_re->name_table_offset =
+ (pcre_uint16)byteflip(re->name_table_offset, sizeof(re->name_table_offset));
+internal_re->name_entry_size =
+ (pcre_uint16)byteflip(re->name_entry_size, sizeof(re->name_entry_size));
+internal_re->name_count =
+ (pcre_uint16)byteflip(re->name_count, sizeof(re->name_count));
+
+if (study != NULL)
+ {
+ *internal_study = *study; /* To copy other fields */
+ internal_study->size = byteflip(study->size, sizeof(study->size));
+ internal_study->options = byteflip(study->options, sizeof(study->options));
+ }
+
+return internal_re;
+}
+
+/* End of pcre_tryflipped.c */
diff --git a/src/plugins/PCREPlugin/pcre_ucp_searchfuncs.c b/src/plugins/PCREPlugin/pcre_ucp_searchfuncs.c
new file mode 100644
index 0000000..316163e
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_ucp_searchfuncs.c
@@ -0,0 +1,179 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains code for searching the table of Unicode character
+properties. */
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+#include "ucp.h" /* Category definitions */
+#include "ucpinternal.h" /* Internal table details */
+#include "ucptable.h" /* The table itself */
+
+
+/* Table to translate from particular type value to the general value. */
+
+static const int ucp_gentype[] = {
+ ucp_C, ucp_C, ucp_C, ucp_C, ucp_C, /* Cc, Cf, Cn, Co, Cs */
+ ucp_L, ucp_L, ucp_L, ucp_L, ucp_L, /* Ll, Lu, Lm, Lo, Lt */
+ ucp_M, ucp_M, ucp_M, /* Mc, Me, Mn */
+ ucp_N, ucp_N, ucp_N, /* Nd, Nl, No */
+ ucp_P, ucp_P, ucp_P, ucp_P, ucp_P, /* Pc, Pd, Pe, Pf, Pi */
+ ucp_P, ucp_P, /* Ps, Po */
+ ucp_S, ucp_S, ucp_S, ucp_S, /* Sc, Sk, Sm, So */
+ ucp_Z, ucp_Z, ucp_Z /* Zl, Zp, Zs */
+};
+
+
+
+/*************************************************
+* Search table and return type *
+*************************************************/
+
+/* Three values are returned: the category is ucp_C, ucp_L, etc. The detailed
+character type is ucp_Lu, ucp_Nd, etc. The script is ucp_Latin, etc.
+
+Arguments:
+ c the character value
+ type_ptr the detailed character type is returned here
+ script_ptr the script is returned here
+
+Returns: the character type category
+*/
+
+int
+_pcre_ucp_findprop(const unsigned int c, int *type_ptr, int *script_ptr)
+{
+int bot = 0;
+int top = sizeof(ucp_table)/sizeof(cnode);
+int mid;
+
+/* The table is searched using a binary chop. You might think that using
+intermediate variables to hold some of the common expressions would speed
+things up, but tests with gcc 3.4.4 on Linux showed that, on the contrary, it
+makes things a lot slower. */
+
+for (;;)
+ {
+ if (top <= bot)
+ {
+ *type_ptr = ucp_Cn;
+ *script_ptr = ucp_Common;
+ return ucp_C;
+ }
+ mid = (bot + top) >> 1;
+ if (c == (ucp_table[mid].f0 & f0_charmask)) break;
+ if (c < (ucp_table[mid].f0 & f0_charmask)) top = mid;
+ else
+ {
+ if ((ucp_table[mid].f0 & f0_rangeflag) != 0 &&
+ c <= (ucp_table[mid].f0 & f0_charmask) +
+ (ucp_table[mid].f1 & f1_rangemask)) break;
+ bot = mid + 1;
+ }
+ }
+
+/* Found an entry in the table. Set the script and detailed type values, and
+return the general type. */
+
+*script_ptr = (ucp_table[mid].f0 & f0_scriptmask) >> f0_scriptshift;
+*type_ptr = (ucp_table[mid].f1 & f1_typemask) >> f1_typeshift;
+
+return ucp_gentype[*type_ptr];
+}
+
+
+
+/*************************************************
+* Search table and return other case *
+*************************************************/
+
+/* If the given character is a letter, and there is another case for the
+letter, return the other case. Otherwise, return -1.
+
+Arguments:
+ c the character value
+
+Returns: the other case or NOTACHAR if none
+*/
+
+unsigned int
+_pcre_ucp_othercase(const unsigned int c)
+{
+int bot = 0;
+int top = sizeof(ucp_table)/sizeof(cnode);
+int mid, offset;
+
+/* The table is searched using a binary chop. You might think that using
+intermediate variables to hold some of the common expressions would speed
+things up, but tests with gcc 3.4.4 on Linux showed that, on the contrary, it
+makes things a lot slower. */
+
+for (;;)
+ {
+ if (top <= bot) return -1;
+ mid = (bot + top) >> 1;
+ if (c == (ucp_table[mid].f0 & f0_charmask)) break;
+ if (c < (ucp_table[mid].f0 & f0_charmask)) top = mid;
+ else
+ {
+ if ((ucp_table[mid].f0 & f0_rangeflag) != 0 &&
+ c <= (ucp_table[mid].f0 & f0_charmask) +
+ (ucp_table[mid].f1 & f1_rangemask)) break;
+ bot = mid + 1;
+ }
+ }
+
+/* Found an entry in the table. Return NOTACHAR for a range entry. Otherwise
+return the other case if there is one, else NOTACHAR. */
+
+if ((ucp_table[mid].f0 & f0_rangeflag) != 0) return NOTACHAR;
+
+offset = ucp_table[mid].f1 & f1_casemask;
+if ((offset & f1_caseneg) != 0) offset |= f1_caseneg;
+return (offset == 0)? NOTACHAR : c + offset;
+}
+
+
+/* End of pcre_ucp_searchfuncs.c */
diff --git a/src/plugins/PCREPlugin/pcre_valid_utf8.c b/src/plugins/PCREPlugin/pcre_valid_utf8.c
new file mode 100644
index 0000000..1899142
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_valid_utf8.c
@@ -0,0 +1,162 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains an internal function for validating UTF-8 character
+strings. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Validate a UTF-8 string *
+*************************************************/
+
+/* This function is called (optionally) at the start of compile or match, to
+validate that a supposed UTF-8 string is actually valid. The early check means
+that subsequent code can assume it is dealing with a valid string. The check
+can be turned off for maximum performance, but the consequences of supplying
+an invalid string are then undefined.
+
+Originally, this function checked according to RFC 2279, allowing for values in
+the range 0 to 0x7fffffff, up to 6 bytes long, but ensuring that they were in
+the canonical format. Once somebody had pointed out RFC 3629 to me (it
+obsoletes 2279), additional restrictions were applies. The values are now
+limited to be between 0 and 0x0010ffff, no more than 4 bytes long, and the
+subrange 0xd000 to 0xdfff is excluded.
+
+Arguments:
+ string points to the string
+ length length of string, or -1 if the string is zero-terminated
+
+Returns: < 0 if the string is a valid UTF-8 string
+ >= 0 otherwise; the value is the offset of the bad byte
+*/
+
+int
+_pcre_valid_utf8(const uschar *string, int length)
+{
+#ifdef SUPPORT_UTF8
+register const uschar *p;
+
+if (length < 0)
+ {
+ for (p = string; *p != 0; p++);
+ length = p - string;
+ }
+
+for (p = string; length-- > 0; p++)
+ {
+ register int ab;
+ register int c = *p;
+ if (c < 128) continue;
+ if (c < 0xc0) return p - string;
+ ab = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */
+ if (length < ab || ab > 3) return p - string;
+ length -= ab;
+
+ /* Check top bits in the second byte */
+ if ((*(++p) & 0xc0) != 0x80) return p - string;
+
+ /* Check for overlong sequences for each different length, and for the
+ excluded range 0xd000 to 0xdfff. */
+
+ switch (ab)
+ {
+ /* Check for xx00 000x (overlong sequence) */
+
+ case 1:
+ if ((c & 0x3e) == 0) return p - string;
+ continue; /* We know there aren't any more bytes to check */
+
+ /* Check for 1110 0000, xx0x xxxx (overlong sequence) or
+ 1110 1101, 1010 xxxx (0xd000 - 0xdfff) */
+
+ case 2:
+ if ((c == 0xe0 && (*p & 0x20) == 0) ||
+ (c == 0xed && *p >= 0xa0))
+ return p - string;
+ break;
+
+ /* Check for 1111 0000, xx00 xxxx (overlong sequence) or
+ greater than 0x0010ffff (f4 8f bf bf) */
+
+ case 3:
+ if ((c == 0xf0 && (*p & 0x30) == 0) ||
+ (c > 0xf4 ) ||
+ (c == 0xf4 && *p > 0x8f))
+ return p - string;
+ break;
+
+#if 0
+ /* These cases can no longer occur, as we restrict to a maximum of four
+ bytes nowadays. Leave the code here in case we ever want to add an option
+ for longer sequences. */
+
+ /* Check for 1111 1000, xx00 0xxx */
+ case 4:
+ if (c == 0xf8 && (*p & 0x38) == 0) return p - string;
+ break;
+
+ /* Check for leading 0xfe or 0xff, and then for 1111 1100, xx00 00xx */
+ case 5:
+ if (c == 0xfe || c == 0xff ||
+ (c == 0xfc && (*p & 0x3c) == 0)) return p - string;
+ break;
+#endif
+
+ }
+
+ /* Check for valid bytes after the 2nd, if any; all must start 10 */
+ while (--ab > 0)
+ {
+ if ((*(++p) & 0xc0) != 0x80) return p - string;
+ }
+ }
+#endif
+
+return -1;
+}
+
+/* End of pcre_valid_utf8.c */
diff --git a/src/plugins/PCREPlugin/pcre_version.c b/src/plugins/PCREPlugin/pcre_version.c
new file mode 100644
index 0000000..425ab21
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_version.c
@@ -0,0 +1,90 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains the external function pcre_version(), which returns a
+string that identifies the PCRE version that is in use. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Return version string *
+*************************************************/
+
+/* These macros are the standard way of turning unquoted text into C strings.
+They allow macros like PCRE_MAJOR to be defined without quotes, which is
+convenient for user programs that want to test its value. */
+
+#define STRING(a) # a
+#define XSTRING(s) STRING(s)
+
+/* A problem turned up with PCRE_PRERELEASE, which is defined empty for
+production releases. Originally, it was used naively in this code:
+
+ return XSTRING(PCRE_MAJOR)
+ "." XSTRING(PCRE_MINOR)
+ XSTRING(PCRE_PRERELEASE)
+ " " XSTRING(PCRE_DATE);
+
+However, when PCRE_PRERELEASE is empty, this leads to an attempted expansion of
+STRING(). The C standard states: "If (before argument substitution) any
+argument consists of no preprocessing tokens, the behavior is undefined." It
+turns out the gcc treats this case as a single empty string - which is what we
+really want - but Visual C grumbles about the lack of an argument for the
+macro. Unfortunately, both are within their rights. To cope with both ways of
+handling this, I had resort to some messy hackery that does a test at run time.
+I could find no way of detecting that a macro is defined as an empty string at
+pre-processor time. This hack uses a standard trick for avoiding calling
+the STRING macro with an empty argument when doing the test. */
+
+PCRE_EXP_DEFN const char *
+pcre_version(void)
+{
+return (XSTRING(Z PCRE_PRERELEASE)[1] == 0)?
+ XSTRING(PCRE_MAJOR.PCRE_MINOR PCRE_DATE) :
+ XSTRING(PCRE_MAJOR.PCRE_MINOR) XSTRING(PCRE_PRERELEASE PCRE_DATE);
+}
+
+/* End of pcre_version.c */
diff --git a/src/plugins/PCREPlugin/pcre_xclass.c b/src/plugins/PCREPlugin/pcre_xclass.c
new file mode 100644
index 0000000..cdf1af1
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcre_xclass.c
@@ -0,0 +1,148 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module contains an internal function that is used to match an extended
+class (one that contains characters whose values are > 255). It is used by both
+pcre_exec() and pcre_def_exec(). */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "pcre_internal.h"
+
+
+/*************************************************
+* Match character against an XCLASS *
+*************************************************/
+
+/* This function is called to match a character against an extended class that
+might contain values > 255.
+
+Arguments:
+ c the character
+ data points to the flag byte of the XCLASS data
+
+Returns: TRUE if character matches, else FALSE
+*/
+
+BOOL
+_pcre_xclass(int c, const uschar *data)
+{
+int t;
+BOOL negated = (*data & XCL_NOT) != 0;
+
+/* Character values < 256 are matched against a bitmap, if one is present. If
+not, we still carry on, because there may be ranges that start below 256 in the
+additional data. */
+
+if (c < 256)
+ {
+ if ((*data & XCL_MAP) != 0 && (data[1 + c/8] & (1 << (c&7))) != 0)
+ return !negated; /* char found */
+ }
+
+/* First skip the bit map if present. Then match against the list of Unicode
+properties or large chars or ranges that end with a large char. We won't ever
+encounter XCL_PROP or XCL_NOTPROP when UCP support is not compiled. */
+
+if ((*data++ & XCL_MAP) != 0) data += 32;
+
+while ((t = *data++) != XCL_END)
+ {
+ int x, y;
+ if (t == XCL_SINGLE)
+ {
+ GETCHARINC(x, data);
+ if (c == x) return !negated;
+ }
+ else if (t == XCL_RANGE)
+ {
+ GETCHARINC(x, data);
+ GETCHARINC(y, data);
+ if (c >= x && c <= y) return !negated;
+ }
+
+#ifdef SUPPORT_UCP
+ else /* XCL_PROP & XCL_NOTPROP */
+ {
+ int chartype, script;
+ int category = _pcre_ucp_findprop(c, &chartype, &script);
+
+ switch(*data)
+ {
+ case PT_ANY:
+ if (t == XCL_PROP) return !negated;
+ break;
+
+ case PT_LAMP:
+ if ((chartype == ucp_Lu || chartype == ucp_Ll || chartype == ucp_Lt) ==
+ (t == XCL_PROP)) return !negated;
+ break;
+
+ case PT_GC:
+ if ((data[1] == category) == (t == XCL_PROP)) return !negated;
+ break;
+
+ case PT_PC:
+ if ((data[1] == chartype) == (t == XCL_PROP)) return !negated;
+ break;
+
+ case PT_SC:
+ if ((data[1] == script) == (t == XCL_PROP)) return !negated;
+ break;
+
+ /* This should never occur, but compilers may mutter if there is no
+ default. */
+
+ default:
+ return FALSE;
+ }
+
+ data += 2;
+ }
+#endif /* SUPPORT_UCP */
+ }
+
+return negated; /* char did not match */
+}
+
+/* End of pcre_xclass.c */
diff --git a/src/plugins/PCREPlugin/pcreposix.c b/src/plugins/PCREPlugin/pcreposix.c
new file mode 100644
index 0000000..0f73774
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcreposix.c
@@ -0,0 +1,337 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+/* PCRE is a library of functions to support regular expressions whose syntax
+and semantics are as close as possible to those of the Perl 5 language.
+
+ Written by Philip Hazel
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+
+/* This module is a wrapper that provides a POSIX API to the underlying PCRE
+functions. */
+
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+
+/* Ensure that the PCREPOSIX_EXP_xxx macros are set appropriately for
+compiling these functions. This must come before including pcreposix.h, where
+they are set for an application (using these functions) if they have not
+previously been set. */
+
+#if defined(_WIN32) && !defined(PCRE_STATIC)
+# define PCREPOSIX_EXP_DECL extern __declspec(dllexport)
+# define PCREPOSIX_EXP_DEFN __declspec(dllexport)
+#endif
+
+#include "pcre.h"
+#include "pcre_internal.h"
+#include "pcreposix.h"
+
+
+/* Table to translate PCRE compile time error codes into POSIX error codes. */
+
+static const int eint[] = {
+ 0, /* no error */
+ REG_EESCAPE, /* \ at end of pattern */
+ REG_EESCAPE, /* \c at end of pattern */
+ REG_EESCAPE, /* unrecognized character follows \ */
+ REG_BADBR, /* numbers out of order in {} quantifier */
+ REG_BADBR, /* number too big in {} quantifier */
+ REG_EBRACK, /* missing terminating ] for character class */
+ REG_ECTYPE, /* invalid escape sequence in character class */
+ REG_ERANGE, /* range out of order in character class */
+ REG_BADRPT, /* nothing to repeat */
+ REG_BADRPT, /* operand of unlimited repeat could match the empty string */
+ REG_ASSERT, /* internal error: unexpected repeat */
+ REG_BADPAT, /* unrecognized character after (? */
+ REG_BADPAT, /* POSIX named classes are supported only within a class */
+ REG_EPAREN, /* missing ) */
+ REG_ESUBREG, /* reference to non-existent subpattern */
+ REG_INVARG, /* erroffset passed as NULL */
+ REG_INVARG, /* unknown option bit(s) set */
+ REG_EPAREN, /* missing ) after comment */
+ REG_ESIZE, /* parentheses nested too deeply */
+ REG_ESIZE, /* regular expression too large */
+ REG_ESPACE, /* failed to get memory */
+ REG_EPAREN, /* unmatched brackets */
+ REG_ASSERT, /* internal error: code overflow */
+ REG_BADPAT, /* unrecognized character after (?< */
+ REG_BADPAT, /* lookbehind assertion is not fixed length */
+ REG_BADPAT, /* malformed number or name after (?( */
+ REG_BADPAT, /* conditional group contains more than two branches */
+ REG_BADPAT, /* assertion expected after (?( */
+ REG_BADPAT, /* (?R or (?[+-]digits must be followed by ) */
+ REG_ECTYPE, /* unknown POSIX class name */
+ REG_BADPAT, /* POSIX collating elements are not supported */
+ REG_INVARG, /* this version of PCRE is not compiled with PCRE_UTF8 support */
+ REG_BADPAT, /* spare error */
+ REG_BADPAT, /* character value in \x{...} sequence is too large */
+ REG_BADPAT, /* invalid condition (?(0) */
+ REG_BADPAT, /* \C not allowed in lookbehind assertion */
+ REG_EESCAPE, /* PCRE does not support \L, \l, \N, \U, or \u */
+ REG_BADPAT, /* number after (?C is > 255 */
+ REG_BADPAT, /* closing ) for (?C expected */
+ REG_BADPAT, /* recursive call could loop indefinitely */
+ REG_BADPAT, /* unrecognized character after (?P */
+ REG_BADPAT, /* syntax error in subpattern name (missing terminator) */
+ REG_BADPAT, /* two named subpatterns have the same name */
+ REG_BADPAT, /* invalid UTF-8 string */
+ REG_BADPAT, /* support for \P, \p, and \X has not been compiled */
+ REG_BADPAT, /* malformed \P or \p sequence */
+ REG_BADPAT, /* unknown property name after \P or \p */
+ REG_BADPAT, /* subpattern name is too long (maximum 32 characters) */
+ REG_BADPAT, /* too many named subpatterns (maximum 10,000) */
+ REG_BADPAT, /* repeated subpattern is too long */
+ REG_BADPAT, /* octal value is greater than \377 (not in UTF-8 mode) */
+ REG_BADPAT, /* internal error: overran compiling workspace */
+ REG_BADPAT, /* internal error: previously-checked referenced subpattern not found */
+ REG_BADPAT, /* DEFINE group contains more than one branch */
+ REG_BADPAT, /* repeating a DEFINE group is not allowed */
+ REG_INVARG, /* inconsistent NEWLINE options */
+ REG_BADPAT, /* \g is not followed followed by an (optionally braced) non-zero number */
+ REG_BADPAT, /* (?+ or (?- must be followed by a non-zero number */
+ REG_BADPAT /* number is too big */
+};
+
+/* Table of texts corresponding to POSIX error codes */
+
+static const char *const pstring[] = {
+ "", /* Dummy for value 0 */
+ "internal error", /* REG_ASSERT */
+ "invalid repeat counts in {}", /* BADBR */
+ "pattern error", /* BADPAT */
+ "? * + invalid", /* BADRPT */
+ "unbalanced {}", /* EBRACE */
+ "unbalanced []", /* EBRACK */
+ "collation error - not relevant", /* ECOLLATE */
+ "bad class", /* ECTYPE */
+ "bad escape sequence", /* EESCAPE */
+ "empty expression", /* EMPTY */
+ "unbalanced ()", /* EPAREN */
+ "bad range inside []", /* ERANGE */
+ "expression too big", /* ESIZE */
+ "failed to get memory", /* ESPACE */
+ "bad back reference", /* ESUBREG */
+ "bad argument", /* INVARG */
+ "match failed" /* NOMATCH */
+};
+
+
+
+
+/*************************************************
+* Translate error code to string *
+*************************************************/
+
+PCREPOSIX_EXP_DEFN size_t
+regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)
+{
+const char *message, *addmessage;
+size_t length, addlength;
+
+message = (errcode >= (int)(sizeof(pstring)/sizeof(char *)))?
+ "unknown error code" : pstring[errcode];
+length = strlen(message) + 1;
+
+addmessage = " at offset ";
+addlength = (preg != NULL && (int)preg->re_erroffset != -1)?
+ strlen(addmessage) + 6 : 0;
+
+if (errbuf_size > 0)
+ {
+ if (addlength > 0 && errbuf_size >= length + addlength)
+ sprintf(errbuf, "%s%s%-6d", message, addmessage, (int)preg->re_erroffset);
+ else
+ {
+ strncpy(errbuf, message, errbuf_size - 1);
+ errbuf[errbuf_size-1] = 0;
+ }
+ }
+
+return length + addlength;
+}
+
+
+
+
+/*************************************************
+* Free store held by a regex *
+*************************************************/
+
+PCREPOSIX_EXP_DEFN void
+regfree(regex_t *preg)
+{
+(pcre_free)(preg->re_pcre);
+}
+
+
+
+
+/*************************************************
+* Compile a regular expression *
+*************************************************/
+
+/*
+Arguments:
+ preg points to a structure for recording the compiled expression
+ pattern the pattern to compile
+ cflags compilation flags
+
+Returns: 0 on success
+ various non-zero codes on failure
+*/
+
+PCREPOSIX_EXP_DEFN int
+regcomp(regex_t *preg, const char *pattern, int cflags)
+{
+const char *errorptr;
+int erroffset;
+int errorcode;
+int options = 0;
+
+if ((cflags & REG_ICASE) != 0) options |= PCRE_CASELESS;
+if ((cflags & REG_NEWLINE) != 0) options |= PCRE_MULTILINE;
+if ((cflags & REG_DOTALL) != 0) options |= PCRE_DOTALL;
+if ((cflags & REG_NOSUB) != 0) options |= PCRE_NO_AUTO_CAPTURE;
+if ((cflags & REG_UTF8) != 0) options |= PCRE_UTF8;
+
+preg->re_pcre = pcre_compile2(pattern, options, &errorcode, &errorptr,
+ &erroffset, NULL);
+preg->re_erroffset = erroffset;
+
+if (preg->re_pcre == NULL) return eint[errorcode];
+
+preg->re_nsub = pcre_info((const pcre *)preg->re_pcre, NULL, NULL);
+return 0;
+}
+
+
+
+
+/*************************************************
+* Match a regular expression *
+*************************************************/
+
+/* Unfortunately, PCRE requires 3 ints of working space for each captured
+substring, so we have to get and release working store instead of just using
+the POSIX structures as was done in earlier releases when PCRE needed only 2
+ints. However, if the number of possible capturing brackets is small, use a
+block of store on the stack, to reduce the use of malloc/free. The threshold is
+in a macro that can be changed at configure time.
+
+If REG_NOSUB was specified at compile time, the PCRE_NO_AUTO_CAPTURE flag will
+be set. When this is the case, the nmatch and pmatch arguments are ignored, and
+the only result is yes/no/error. */
+
+PCREPOSIX_EXP_DEFN int
+regexec(const regex_t *preg, const char *string, size_t nmatch,
+ regmatch_t pmatch[], int eflags)
+{
+int rc;
+int options = 0;
+int *ovector = NULL;
+int small_ovector[POSIX_MALLOC_THRESHOLD * 3];
+BOOL allocated_ovector = FALSE;
+BOOL nosub =
+ (((const pcre *)preg->re_pcre)->options & PCRE_NO_AUTO_CAPTURE) != 0;
+
+if ((eflags & REG_NOTBOL) != 0) options |= PCRE_NOTBOL;
+if ((eflags & REG_NOTEOL) != 0) options |= PCRE_NOTEOL;
+
+((regex_t *)preg)->re_erroffset = (size_t)(-1); /* Only has meaning after compile */
+
+/* When no string data is being returned, ensure that nmatch is zero.
+Otherwise, ensure the vector for holding the return data is large enough. */
+
+if (nosub) nmatch = 0;
+
+else if (nmatch > 0)
+ {
+ if (nmatch <= POSIX_MALLOC_THRESHOLD)
+ {
+ ovector = &(small_ovector[0]);
+ }
+ else
+ {
+ if (nmatch > INT_MAX/(sizeof(int) * 3)) return REG_ESPACE;
+ ovector = (int *)malloc(sizeof(int) * nmatch * 3);
+ if (ovector == NULL) return REG_ESPACE;
+ allocated_ovector = TRUE;
+ }
+ }
+
+rc = pcre_exec((const pcre *)preg->re_pcre, NULL, string, (int)strlen(string),
+ 0, options, ovector, nmatch * 3);
+
+if (rc == 0) rc = nmatch; /* All captured slots were filled in */
+
+if (rc >= 0)
+ {
+ size_t i;
+ if (!nosub)
+ {
+ for (i = 0; i < (size_t)rc; i++)
+ {
+ pmatch[i].rm_so = ovector[i*2];
+ pmatch[i].rm_eo = ovector[i*2+1];
+ }
+ if (allocated_ovector) free(ovector);
+ for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1;
+ }
+ return 0;
+ }
+
+else
+ {
+ if (allocated_ovector) free(ovector);
+ switch(rc)
+ {
+ case PCRE_ERROR_NOMATCH: return REG_NOMATCH;
+ case PCRE_ERROR_NULL: return REG_INVARG;
+ case PCRE_ERROR_BADOPTION: return REG_INVARG;
+ case PCRE_ERROR_BADMAGIC: return REG_INVARG;
+ case PCRE_ERROR_UNKNOWN_NODE: return REG_ASSERT;
+ case PCRE_ERROR_NOMEMORY: return REG_ESPACE;
+ case PCRE_ERROR_MATCHLIMIT: return REG_ESPACE;
+ case PCRE_ERROR_BADUTF8: return REG_INVARG;
+ case PCRE_ERROR_BADUTF8_OFFSET: return REG_INVARG;
+ default: return REG_ASSERT;
+ }
+ }
+}
+
+/* End of pcreposix.c */
diff --git a/src/plugins/PCREPlugin/pcreposix.h b/src/plugins/PCREPlugin/pcreposix.h
new file mode 100644
index 0000000..875e1ff
--- /dev/null
+++ b/src/plugins/PCREPlugin/pcreposix.h
@@ -0,0 +1,142 @@
+/*************************************************
+* Perl-Compatible Regular Expressions *
+*************************************************/
+
+#ifndef _PCREPOSIX_H
+#define _PCREPOSIX_H
+
+/* This is the header for the POSIX wrapper interface to the PCRE Perl-
+Compatible Regular Expression library. It defines the things POSIX says should
+be there. I hope.
+
+ Copyright (c) 1997-2007 University of Cambridge
+
+-----------------------------------------------------------------------------
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ * 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.
+
+ * Neither the name of the University of Cambridge nor the names of its
+ contributors may be used to endorse or promote products derived from
+ this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
+-----------------------------------------------------------------------------
+*/
+
+/* Have to include stdlib.h in order to ensure that size_t is defined. */
+
+#include
+
+/* Allow for C++ users */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* Options, mostly defined by POSIX, but with a couple of extras. */
+
+#define REG_ICASE 0x0001
+#define REG_NEWLINE 0x0002
+#define REG_NOTBOL 0x0004
+#define REG_NOTEOL 0x0008
+#define REG_DOTALL 0x0010 /* NOT defined by POSIX. */
+#define REG_NOSUB 0x0020
+#define REG_UTF8 0x0040 /* NOT defined by POSIX. */
+
+/* This is not used by PCRE, but by defining it we make it easier
+to slot PCRE into existing programs that make POSIX calls. */
+
+#define REG_EXTENDED 0
+
+/* Error values. Not all these are relevant or used by the wrapper. */
+
+enum {
+ REG_ASSERT = 1, /* internal error ? */
+ REG_BADBR, /* invalid repeat counts in {} */
+ REG_BADPAT, /* pattern error */
+ REG_BADRPT, /* ? * + invalid */
+ REG_EBRACE, /* unbalanced {} */
+ REG_EBRACK, /* unbalanced [] */
+ REG_ECOLLATE, /* collation error - not relevant */
+ REG_ECTYPE, /* bad class */
+ REG_EESCAPE, /* bad escape sequence */
+ REG_EMPTY, /* empty expression */
+ REG_EPAREN, /* unbalanced () */
+ REG_ERANGE, /* bad range inside [] */
+ REG_ESIZE, /* expression too big */
+ REG_ESPACE, /* failed to get memory */
+ REG_ESUBREG, /* bad back reference */
+ REG_INVARG, /* bad argument */
+ REG_NOMATCH /* match failed */
+};
+
+
+/* The structure representing a compiled regular expression. */
+
+typedef struct {
+ void *re_pcre;
+ size_t re_nsub;
+ size_t re_erroffset;
+} regex_t;
+
+/* The structure in which a captured offset is returned. */
+
+typedef int regoff_t;
+
+typedef struct {
+ regoff_t rm_so;
+ regoff_t rm_eo;
+} regmatch_t;
+
+/* When an application links to a PCRE DLL in Windows, the symbols that are
+imported have to be identified as such. When building PCRE, the appropriate
+export settings are needed, and are set in pcreposix.c before including this
+file. */
+
+#if defined(_WIN32) && !defined(PCRE_STATIC) && !defined(PCREPOSIX_EXP_DECL)
+# define PCREPOSIX_EXP_DECL extern __declspec(dllimport)
+# define PCREPOSIX_EXP_DEFN __declspec(dllimport)
+#endif
+
+/* By default, we use the standard "extern" declarations. */
+
+#ifndef PCREPOSIX_EXP_DECL
+# ifdef __cplusplus
+# define PCREPOSIX_EXP_DECL extern "C"
+# define PCREPOSIX_EXP_DEFN extern "C"
+# else
+# define PCREPOSIX_EXP_DECL extern
+# define PCREPOSIX_EXP_DEFN extern
+# endif
+#endif
+
+/* The functions */
+
+PCREPOSIX_EXP_DECL int regcomp(regex_t *, const char *, int);
+PCREPOSIX_EXP_DECL int regexec(const regex_t *, const char *, size_t,
+ regmatch_t *, int);
+PCREPOSIX_EXP_DECL size_t regerror(int, const regex_t *, char *, size_t);
+PCREPOSIX_EXP_DECL void regfree(regex_t *);
+
+#ifdef __cplusplus
+} /* extern "C" */
+#endif
+
+#endif /* End of pcreposix.h */
diff --git a/src/plugins/PCREPlugin/ucp.h b/src/plugins/PCREPlugin/ucp.h
new file mode 100644
index 0000000..3a4179b
--- /dev/null
+++ b/src/plugins/PCREPlugin/ucp.h
@@ -0,0 +1,133 @@
+/*************************************************
+* Unicode Property Table handler *
+*************************************************/
+
+#ifndef _UCP_H
+#define _UCP_H
+
+/* This file contains definitions of the property values that are returned by
+the function _pcre_ucp_findprop(). New values that are added for new releases
+of Unicode should always be at the end of each enum, for backwards
+compatibility. */
+
+/* These are the general character categories. */
+
+enum {
+ ucp_C, /* Other */
+ ucp_L, /* Letter */
+ ucp_M, /* Mark */
+ ucp_N, /* Number */
+ ucp_P, /* Punctuation */
+ ucp_S, /* Symbol */
+ ucp_Z /* Separator */
+};
+
+/* These are the particular character types. */
+
+enum {
+ ucp_Cc, /* Control */
+ ucp_Cf, /* Format */
+ ucp_Cn, /* Unassigned */
+ ucp_Co, /* Private use */
+ ucp_Cs, /* Surrogate */
+ ucp_Ll, /* Lower case letter */
+ ucp_Lm, /* Modifier letter */
+ ucp_Lo, /* Other letter */
+ ucp_Lt, /* Title case letter */
+ ucp_Lu, /* Upper case letter */
+ ucp_Mc, /* Spacing mark */
+ ucp_Me, /* Enclosing mark */
+ ucp_Mn, /* Non-spacing mark */
+ ucp_Nd, /* Decimal number */
+ ucp_Nl, /* Letter number */
+ ucp_No, /* Other number */
+ ucp_Pc, /* Connector punctuation */
+ ucp_Pd, /* Dash punctuation */
+ ucp_Pe, /* Close punctuation */
+ ucp_Pf, /* Final punctuation */
+ ucp_Pi, /* Initial punctuation */
+ ucp_Po, /* Other punctuation */
+ ucp_Ps, /* Open punctuation */
+ ucp_Sc, /* Currency symbol */
+ ucp_Sk, /* Modifier symbol */
+ ucp_Sm, /* Mathematical symbol */
+ ucp_So, /* Other symbol */
+ ucp_Zl, /* Line separator */
+ ucp_Zp, /* Paragraph separator */
+ ucp_Zs /* Space separator */
+};
+
+/* These are the script identifications. */
+
+enum {
+ ucp_Arabic,
+ ucp_Armenian,
+ ucp_Bengali,
+ ucp_Bopomofo,
+ ucp_Braille,
+ ucp_Buginese,
+ ucp_Buhid,
+ ucp_Canadian_Aboriginal,
+ ucp_Cherokee,
+ ucp_Common,
+ ucp_Coptic,
+ ucp_Cypriot,
+ ucp_Cyrillic,
+ ucp_Deseret,
+ ucp_Devanagari,
+ ucp_Ethiopic,
+ ucp_Georgian,
+ ucp_Glagolitic,
+ ucp_Gothic,
+ ucp_Greek,
+ ucp_Gujarati,
+ ucp_Gurmukhi,
+ ucp_Han,
+ ucp_Hangul,
+ ucp_Hanunoo,
+ ucp_Hebrew,
+ ucp_Hiragana,
+ ucp_Inherited,
+ ucp_Kannada,
+ ucp_Katakana,
+ ucp_Kharoshthi,
+ ucp_Khmer,
+ ucp_Lao,
+ ucp_Latin,
+ ucp_Limbu,
+ ucp_Linear_B,
+ ucp_Malayalam,
+ ucp_Mongolian,
+ ucp_Myanmar,
+ ucp_New_Tai_Lue,
+ ucp_Ogham,
+ ucp_Old_Italic,
+ ucp_Old_Persian,
+ ucp_Oriya,
+ ucp_Osmanya,
+ ucp_Runic,
+ ucp_Shavian,
+ ucp_Sinhala,
+ ucp_Syloti_Nagri,
+ ucp_Syriac,
+ ucp_Tagalog,
+ ucp_Tagbanwa,
+ ucp_Tai_Le,
+ ucp_Tamil,
+ ucp_Telugu,
+ ucp_Thaana,
+ ucp_Thai,
+ ucp_Tibetan,
+ ucp_Tifinagh,
+ ucp_Ugaritic,
+ ucp_Yi,
+ ucp_Balinese, /* New for Unicode 5.0.0 */
+ ucp_Cuneiform, /* New for Unicode 5.0.0 */
+ ucp_Nko, /* New for Unicode 5.0.0 */
+ ucp_Phags_Pa, /* New for Unicode 5.0.0 */
+ ucp_Phoenician /* New for Unicode 5.0.0 */
+};
+
+#endif
+
+/* End of ucp.h */
diff --git a/src/plugins/PCREPlugin/ucpinternal.h b/src/plugins/PCREPlugin/ucpinternal.h
new file mode 100644
index 0000000..811a373
--- /dev/null
+++ b/src/plugins/PCREPlugin/ucpinternal.h
@@ -0,0 +1,92 @@
+/*************************************************
+* Unicode Property Table handler *
+*************************************************/
+
+#ifndef _UCPINTERNAL_H
+#define _UCPINTERNAL_H
+
+/* Internal header file defining the layout of the bits in each pair of 32-bit
+words that form a data item in the table. */
+
+typedef struct cnode {
+ pcre_uint32 f0;
+ pcre_uint32 f1;
+} cnode;
+
+/* Things for the f0 field */
+
+#define f0_scriptmask 0xff000000 /* Mask for script field */
+#define f0_scriptshift 24 /* Shift for script value */
+#define f0_rangeflag 0x00f00000 /* Flag for a range item */
+#define f0_charmask 0x001fffff /* Mask for code point value */
+
+/* Things for the f1 field */
+
+#define f1_typemask 0xfc000000 /* Mask for char type field */
+#define f1_typeshift 26 /* Shift for the type field */
+#define f1_rangemask 0x0000ffff /* Mask for a range offset */
+#define f1_casemask 0x0000ffff /* Mask for a case offset */
+#define f1_caseneg 0xffff8000 /* Bits for negation */
+
+/* The data consists of a vector of structures of type cnode. The two unsigned
+32-bit integers are used as follows:
+
+(f0) (1) The most significant byte holds the script number. The numbers are
+ defined by the enum in ucp.h.
+
+ (2) The 0x00800000 bit is set if this entry defines a range of characters.
+ It is not set if this entry defines a single character
+
+ (3) The 0x00600000 bits are spare.
+
+ (4) The 0x001fffff bits contain the code point. No Unicode code point will
+ ever be greater than 0x0010ffff, so this should be OK for ever.
+
+(f1) (1) The 0xfc000000 bits contain the character type number. The numbers are
+ defined by an enum in ucp.h.
+
+ (2) The 0x03ff0000 bits are spare.
+
+ (3) The 0x0000ffff bits contain EITHER the unsigned offset to the top of
+ range if this entry defines a range, OR the *signed* offset to the
+ character's "other case" partner if this entry defines a single
+ character. There is no partner if the value is zero.
+
+-------------------------------------------------------------------------------
+| script (8) |.|.|.| codepoint (21) || type (6) |.|.| spare (8) | offset (16) |
+-------------------------------------------------------------------------------
+ | | | | |
+ | | |-> spare | |-> spare
+ | | |
+ | |-> spare |-> spare
+ |
+ |-> range flag
+
+The upper/lower casing information is set only for characters that come in
+pairs. The non-one-to-one mappings in the Unicode data are ignored.
+
+When searching the data, proceed as follows:
+
+(1) Set up for a binary chop search.
+
+(2) If the top is not greater than the bottom, the character is not in the
+ table. Its type must therefore be "Cn" ("Undefined").
+
+(3) Find the middle vector element.
+
+(4) Extract the code point and compare. If equal, we are done.
+
+(5) If the test character is smaller, set the top to the current point, and
+ goto (2).
+
+(6) If the current entry defines a range, compute the last character by adding
+ the offset, and see if the test character is within the range. If it is,
+ we are done.
+
+(7) Otherwise, set the bottom to one element past the current point and goto
+ (2).
+*/
+
+#endif /* _UCPINTERNAL_H */
+
+/* End of ucpinternal.h */
diff --git a/src/plugins/PCREPlugin/ucptable.c b/src/plugins/PCREPlugin/ucptable.c
new file mode 100644
index 0000000..0b17906
--- /dev/null
+++ b/src/plugins/PCREPlugin/ucptable.c
@@ -0,0 +1,3068 @@
+/* This source module is automatically generated from the Unicode
+property table. See ucpinternal.h for a description of the layout.
+This version was made from the Unicode 5.0.0 tables. */
+
+static cnode ucp_table[] = {
+ { 0x09800000, 0x0000001f },
+ { 0x09000020, 0x74000000 },
+ { 0x09800021, 0x54000002 },
+ { 0x09000024, 0x5c000000 },
+ { 0x09800025, 0x54000002 },
+ { 0x09000028, 0x58000000 },
+ { 0x09000029, 0x48000000 },
+ { 0x0900002a, 0x54000000 },
+ { 0x0900002b, 0x64000000 },
+ { 0x0900002c, 0x54000000 },
+ { 0x0900002d, 0x44000000 },
+ { 0x0980002e, 0x54000001 },
+ { 0x09800030, 0x34000009 },
+ { 0x0980003a, 0x54000001 },
+ { 0x0980003c, 0x64000002 },
+ { 0x0980003f, 0x54000001 },
+ { 0x21000041, 0x24000020 },
+ { 0x21000042, 0x24000020 },
+ { 0x21000043, 0x24000020 },
+ { 0x21000044, 0x24000020 },
+ { 0x21000045, 0x24000020 },
+ { 0x21000046, 0x24000020 },
+ { 0x21000047, 0x24000020 },
+ { 0x21000048, 0x24000020 },
+ { 0x21000049, 0x24000020 },
+ { 0x2100004a, 0x24000020 },
+ { 0x2100004b, 0x24000020 },
+ { 0x2100004c, 0x24000020 },
+ { 0x2100004d, 0x24000020 },
+ { 0x2100004e, 0x24000020 },
+ { 0x2100004f, 0x24000020 },
+ { 0x21000050, 0x24000020 },
+ { 0x21000051, 0x24000020 },
+ { 0x21000052, 0x24000020 },
+ { 0x21000053, 0x24000020 },
+ { 0x21000054, 0x24000020 },
+ { 0x21000055, 0x24000020 },
+ { 0x21000056, 0x24000020 },
+ { 0x21000057, 0x24000020 },
+ { 0x21000058, 0x24000020 },
+ { 0x21000059, 0x24000020 },
+ { 0x2100005a, 0x24000020 },
+ { 0x0900005b, 0x58000000 },
+ { 0x0900005c, 0x54000000 },
+ { 0x0900005d, 0x48000000 },
+ { 0x0900005e, 0x60000000 },
+ { 0x0900005f, 0x40000000 },
+ { 0x09000060, 0x60000000 },
+ { 0x21000061, 0x1400ffe0 },
+ { 0x21000062, 0x1400ffe0 },
+ { 0x21000063, 0x1400ffe0 },
+ { 0x21000064, 0x1400ffe0 },
+ { 0x21000065, 0x1400ffe0 },
+ { 0x21000066, 0x1400ffe0 },
+ { 0x21000067, 0x1400ffe0 },
+ { 0x21000068, 0x1400ffe0 },
+ { 0x21000069, 0x1400ffe0 },
+ { 0x2100006a, 0x1400ffe0 },
+ { 0x2100006b, 0x1400ffe0 },
+ { 0x2100006c, 0x1400ffe0 },
+ { 0x2100006d, 0x1400ffe0 },
+ { 0x2100006e, 0x1400ffe0 },
+ { 0x2100006f, 0x1400ffe0 },
+ { 0x21000070, 0x1400ffe0 },
+ { 0x21000071, 0x1400ffe0 },
+ { 0x21000072, 0x1400ffe0 },
+ { 0x21000073, 0x1400ffe0 },
+ { 0x21000074, 0x1400ffe0 },
+ { 0x21000075, 0x1400ffe0 },
+ { 0x21000076, 0x1400ffe0 },
+ { 0x21000077, 0x1400ffe0 },
+ { 0x21000078, 0x1400ffe0 },
+ { 0x21000079, 0x1400ffe0 },
+ { 0x2100007a, 0x1400ffe0 },
+ { 0x0900007b, 0x58000000 },
+ { 0x0900007c, 0x64000000 },
+ { 0x0900007d, 0x48000000 },
+ { 0x0900007e, 0x64000000 },
+ { 0x0980007f, 0x00000020 },
+ { 0x090000a0, 0x74000000 },
+ { 0x090000a1, 0x54000000 },
+ { 0x098000a2, 0x5c000003 },
+ { 0x098000a6, 0x68000001 },
+ { 0x090000a8, 0x60000000 },
+ { 0x090000a9, 0x68000000 },
+ { 0x210000aa, 0x14000000 },
+ { 0x090000ab, 0x50000000 },
+ { 0x090000ac, 0x64000000 },
+ { 0x090000ad, 0x04000000 },
+ { 0x090000ae, 0x68000000 },
+ { 0x090000af, 0x60000000 },
+ { 0x090000b0, 0x68000000 },
+ { 0x090000b1, 0x64000000 },
+ { 0x098000b2, 0x3c000001 },
+ { 0x090000b4, 0x60000000 },
+ { 0x090000b5, 0x140002e7 },
+ { 0x090000b6, 0x68000000 },
+ { 0x090000b7, 0x54000000 },
+ { 0x090000b8, 0x60000000 },
+ { 0x090000b9, 0x3c000000 },
+ { 0x210000ba, 0x14000000 },
+ { 0x090000bb, 0x4c000000 },
+ { 0x098000bc, 0x3c000002 },
+ { 0x090000bf, 0x54000000 },
+ { 0x210000c0, 0x24000020 },
+ { 0x210000c1, 0x24000020 },
+ { 0x210000c2, 0x24000020 },
+ { 0x210000c3, 0x24000020 },
+ { 0x210000c4, 0x24000020 },
+ { 0x210000c5, 0x24000020 },
+ { 0x210000c6, 0x24000020 },
+ { 0x210000c7, 0x24000020 },
+ { 0x210000c8, 0x24000020 },
+ { 0x210000c9, 0x24000020 },
+ { 0x210000ca, 0x24000020 },
+ { 0x210000cb, 0x24000020 },
+ { 0x210000cc, 0x24000020 },
+ { 0x210000cd, 0x24000020 },
+ { 0x210000ce, 0x24000020 },
+ { 0x210000cf, 0x24000020 },
+ { 0x210000d0, 0x24000020 },
+ { 0x210000d1, 0x24000020 },
+ { 0x210000d2, 0x24000020 },
+ { 0x210000d3, 0x24000020 },
+ { 0x210000d4, 0x24000020 },
+ { 0x210000d5, 0x24000020 },
+ { 0x210000d6, 0x24000020 },
+ { 0x090000d7, 0x64000000 },
+ { 0x210000d8, 0x24000020 },
+ { 0x210000d9, 0x24000020 },
+ { 0x210000da, 0x24000020 },
+ { 0x210000db, 0x24000020 },
+ { 0x210000dc, 0x24000020 },
+ { 0x210000dd, 0x24000020 },
+ { 0x210000de, 0x24000020 },
+ { 0x210000df, 0x14000000 },
+ { 0x210000e0, 0x1400ffe0 },
+ { 0x210000e1, 0x1400ffe0 },
+ { 0x210000e2, 0x1400ffe0 },
+ { 0x210000e3, 0x1400ffe0 },
+ { 0x210000e4, 0x1400ffe0 },
+ { 0x210000e5, 0x1400ffe0 },
+ { 0x210000e6, 0x1400ffe0 },
+ { 0x210000e7, 0x1400ffe0 },
+ { 0x210000e8, 0x1400ffe0 },
+ { 0x210000e9, 0x1400ffe0 },
+ { 0x210000ea, 0x1400ffe0 },
+ { 0x210000eb, 0x1400ffe0 },
+ { 0x210000ec, 0x1400ffe0 },
+ { 0x210000ed, 0x1400ffe0 },
+ { 0x210000ee, 0x1400ffe0 },
+ { 0x210000ef, 0x1400ffe0 },
+ { 0x210000f0, 0x1400ffe0 },
+ { 0x210000f1, 0x1400ffe0 },
+ { 0x210000f2, 0x1400ffe0 },
+ { 0x210000f3, 0x1400ffe0 },
+ { 0x210000f4, 0x1400ffe0 },
+ { 0x210000f5, 0x1400ffe0 },
+ { 0x210000f6, 0x1400ffe0 },
+ { 0x090000f7, 0x64000000 },
+ { 0x210000f8, 0x1400ffe0 },
+ { 0x210000f9, 0x1400ffe0 },
+ { 0x210000fa, 0x1400ffe0 },
+ { 0x210000fb, 0x1400ffe0 },
+ { 0x210000fc, 0x1400ffe0 },
+ { 0x210000fd, 0x1400ffe0 },
+ { 0x210000fe, 0x1400ffe0 },
+ { 0x210000ff, 0x14000079 },
+ { 0x21000100, 0x24000001 },
+ { 0x21000101, 0x1400ffff },
+ { 0x21000102, 0x24000001 },
+ { 0x21000103, 0x1400ffff },
+ { 0x21000104, 0x24000001 },
+ { 0x21000105, 0x1400ffff },
+ { 0x21000106, 0x24000001 },
+ { 0x21000107, 0x1400ffff },
+ { 0x21000108, 0x24000001 },
+ { 0x21000109, 0x1400ffff },
+ { 0x2100010a, 0x24000001 },
+ { 0x2100010b, 0x1400ffff },
+ { 0x2100010c, 0x24000001 },
+ { 0x2100010d, 0x1400ffff },
+ { 0x2100010e, 0x24000001 },
+ { 0x2100010f, 0x1400ffff },
+ { 0x21000110, 0x24000001 },
+ { 0x21000111, 0x1400ffff },
+ { 0x21000112, 0x24000001 },
+ { 0x21000113, 0x1400ffff },
+ { 0x21000114, 0x24000001 },
+ { 0x21000115, 0x1400ffff },
+ { 0x21000116, 0x24000001 },
+ { 0x21000117, 0x1400ffff },
+ { 0x21000118, 0x24000001 },
+ { 0x21000119, 0x1400ffff },
+ { 0x2100011a, 0x24000001 },
+ { 0x2100011b, 0x1400ffff },
+ { 0x2100011c, 0x24000001 },
+ { 0x2100011d, 0x1400ffff },
+ { 0x2100011e, 0x24000001 },
+ { 0x2100011f, 0x1400ffff },
+ { 0x21000120, 0x24000001 },
+ { 0x21000121, 0x1400ffff },
+ { 0x21000122, 0x24000001 },
+ { 0x21000123, 0x1400ffff },
+ { 0x21000124, 0x24000001 },
+ { 0x21000125, 0x1400ffff },
+ { 0x21000126, 0x24000001 },
+ { 0x21000127, 0x1400ffff },
+ { 0x21000128, 0x24000001 },
+ { 0x21000129, 0x1400ffff },
+ { 0x2100012a, 0x24000001 },
+ { 0x2100012b, 0x1400ffff },
+ { 0x2100012c, 0x24000001 },
+ { 0x2100012d, 0x1400ffff },
+ { 0x2100012e, 0x24000001 },
+ { 0x2100012f, 0x1400ffff },
+ { 0x21000130, 0x2400ff39 },
+ { 0x21000131, 0x1400ff18 },
+ { 0x21000132, 0x24000001 },
+ { 0x21000133, 0x1400ffff },
+ { 0x21000134, 0x24000001 },
+ { 0x21000135, 0x1400ffff },
+ { 0x21000136, 0x24000001 },
+ { 0x21000137, 0x1400ffff },
+ { 0x21000138, 0x14000000 },
+ { 0x21000139, 0x24000001 },
+ { 0x2100013a, 0x1400ffff },
+ { 0x2100013b, 0x24000001 },
+ { 0x2100013c, 0x1400ffff },
+ { 0x2100013d, 0x24000001 },
+ { 0x2100013e, 0x1400ffff },
+ { 0x2100013f, 0x24000001 },
+ { 0x21000140, 0x1400ffff },
+ { 0x21000141, 0x24000001 },
+ { 0x21000142, 0x1400ffff },
+ { 0x21000143, 0x24000001 },
+ { 0x21000144, 0x1400ffff },
+ { 0x21000145, 0x24000001 },
+ { 0x21000146, 0x1400ffff },
+ { 0x21000147, 0x24000001 },
+ { 0x21000148, 0x1400ffff },
+ { 0x21000149, 0x14000000 },
+ { 0x2100014a, 0x24000001 },
+ { 0x2100014b, 0x1400ffff },
+ { 0x2100014c, 0x24000001 },
+ { 0x2100014d, 0x1400ffff },
+ { 0x2100014e, 0x24000001 },
+ { 0x2100014f, 0x1400ffff },
+ { 0x21000150, 0x24000001 },
+ { 0x21000151, 0x1400ffff },
+ { 0x21000152, 0x24000001 },
+ { 0x21000153, 0x1400ffff },
+ { 0x21000154, 0x24000001 },
+ { 0x21000155, 0x1400ffff },
+ { 0x21000156, 0x24000001 },
+ { 0x21000157, 0x1400ffff },
+ { 0x21000158, 0x24000001 },
+ { 0x21000159, 0x1400ffff },
+ { 0x2100015a, 0x24000001 },
+ { 0x2100015b, 0x1400ffff },
+ { 0x2100015c, 0x24000001 },
+ { 0x2100015d, 0x1400ffff },
+ { 0x2100015e, 0x24000001 },
+ { 0x2100015f, 0x1400ffff },
+ { 0x21000160, 0x24000001 },
+ { 0x21000161, 0x1400ffff },
+ { 0x21000162, 0x24000001 },
+ { 0x21000163, 0x1400ffff },
+ { 0x21000164, 0x24000001 },
+ { 0x21000165, 0x1400ffff },
+ { 0x21000166, 0x24000001 },
+ { 0x21000167, 0x1400ffff },
+ { 0x21000168, 0x24000001 },
+ { 0x21000169, 0x1400ffff },
+ { 0x2100016a, 0x24000001 },
+ { 0x2100016b, 0x1400ffff },
+ { 0x2100016c, 0x24000001 },
+ { 0x2100016d, 0x1400ffff },
+ { 0x2100016e, 0x24000001 },
+ { 0x2100016f, 0x1400ffff },
+ { 0x21000170, 0x24000001 },
+ { 0x21000171, 0x1400ffff },
+ { 0x21000172, 0x24000001 },
+ { 0x21000173, 0x1400ffff },
+ { 0x21000174, 0x24000001 },
+ { 0x21000175, 0x1400ffff },
+ { 0x21000176, 0x24000001 },
+ { 0x21000177, 0x1400ffff },
+ { 0x21000178, 0x2400ff87 },
+ { 0x21000179, 0x24000001 },
+ { 0x2100017a, 0x1400ffff },
+ { 0x2100017b, 0x24000001 },
+ { 0x2100017c, 0x1400ffff },
+ { 0x2100017d, 0x24000001 },
+ { 0x2100017e, 0x1400ffff },
+ { 0x2100017f, 0x1400fed4 },
+ { 0x21000180, 0x140000c3 },
+ { 0x21000181, 0x240000d2 },
+ { 0x21000182, 0x24000001 },
+ { 0x21000183, 0x1400ffff },
+ { 0x21000184, 0x24000001 },
+ { 0x21000185, 0x1400ffff },
+ { 0x21000186, 0x240000ce },
+ { 0x21000187, 0x24000001 },
+ { 0x21000188, 0x1400ffff },
+ { 0x21000189, 0x240000cd },
+ { 0x2100018a, 0x240000cd },
+ { 0x2100018b, 0x24000001 },
+ { 0x2100018c, 0x1400ffff },
+ { 0x2100018d, 0x14000000 },
+ { 0x2100018e, 0x2400004f },
+ { 0x2100018f, 0x240000ca },
+ { 0x21000190, 0x240000cb },
+ { 0x21000191, 0x24000001 },
+ { 0x21000192, 0x1400ffff },
+ { 0x21000193, 0x240000cd },
+ { 0x21000194, 0x240000cf },
+ { 0x21000195, 0x14000061 },
+ { 0x21000196, 0x240000d3 },
+ { 0x21000197, 0x240000d1 },
+ { 0x21000198, 0x24000001 },
+ { 0x21000199, 0x1400ffff },
+ { 0x2100019a, 0x140000a3 },
+ { 0x2100019b, 0x14000000 },
+ { 0x2100019c, 0x240000d3 },
+ { 0x2100019d, 0x240000d5 },
+ { 0x2100019e, 0x14000082 },
+ { 0x2100019f, 0x240000d6 },
+ { 0x210001a0, 0x24000001 },
+ { 0x210001a1, 0x1400ffff },
+ { 0x210001a2, 0x24000001 },
+ { 0x210001a3, 0x1400ffff },
+ { 0x210001a4, 0x24000001 },
+ { 0x210001a5, 0x1400ffff },
+ { 0x210001a6, 0x240000da },
+ { 0x210001a7, 0x24000001 },
+ { 0x210001a8, 0x1400ffff },
+ { 0x210001a9, 0x240000da },
+ { 0x218001aa, 0x14000001 },
+ { 0x210001ac, 0x24000001 },
+ { 0x210001ad, 0x1400ffff },
+ { 0x210001ae, 0x240000da },
+ { 0x210001af, 0x24000001 },
+ { 0x210001b0, 0x1400ffff },
+ { 0x210001b1, 0x240000d9 },
+ { 0x210001b2, 0x240000d9 },
+ { 0x210001b3, 0x24000001 },
+ { 0x210001b4, 0x1400ffff },
+ { 0x210001b5, 0x24000001 },
+ { 0x210001b6, 0x1400ffff },
+ { 0x210001b7, 0x240000db },
+ { 0x210001b8, 0x24000001 },
+ { 0x210001b9, 0x1400ffff },
+ { 0x210001ba, 0x14000000 },
+ { 0x210001bb, 0x1c000000 },
+ { 0x210001bc, 0x24000001 },
+ { 0x210001bd, 0x1400ffff },
+ { 0x210001be, 0x14000000 },
+ { 0x210001bf, 0x14000038 },
+ { 0x218001c0, 0x1c000003 },
+ { 0x210001c4, 0x24000002 },
+ { 0x210001c5, 0x2000ffff },
+ { 0x210001c6, 0x1400fffe },
+ { 0x210001c7, 0x24000002 },
+ { 0x210001c8, 0x2000ffff },
+ { 0x210001c9, 0x1400fffe },
+ { 0x210001ca, 0x24000002 },
+ { 0x210001cb, 0x2000ffff },
+ { 0x210001cc, 0x1400fffe },
+ { 0x210001cd, 0x24000001 },
+ { 0x210001ce, 0x1400ffff },
+ { 0x210001cf, 0x24000001 },
+ { 0x210001d0, 0x1400ffff },
+ { 0x210001d1, 0x24000001 },
+ { 0x210001d2, 0x1400ffff },
+ { 0x210001d3, 0x24000001 },
+ { 0x210001d4, 0x1400ffff },
+ { 0x210001d5, 0x24000001 },
+ { 0x210001d6, 0x1400ffff },
+ { 0x210001d7, 0x24000001 },
+ { 0x210001d8, 0x1400ffff },
+ { 0x210001d9, 0x24000001 },
+ { 0x210001da, 0x1400ffff },
+ { 0x210001db, 0x24000001 },
+ { 0x210001dc, 0x1400ffff },
+ { 0x210001dd, 0x1400ffb1 },
+ { 0x210001de, 0x24000001 },
+ { 0x210001df, 0x1400ffff },
+ { 0x210001e0, 0x24000001 },
+ { 0x210001e1, 0x1400ffff },
+ { 0x210001e2, 0x24000001 },
+ { 0x210001e3, 0x1400ffff },
+ { 0x210001e4, 0x24000001 },
+ { 0x210001e5, 0x1400ffff },
+ { 0x210001e6, 0x24000001 },
+ { 0x210001e7, 0x1400ffff },
+ { 0x210001e8, 0x24000001 },
+ { 0x210001e9, 0x1400ffff },
+ { 0x210001ea, 0x24000001 },
+ { 0x210001eb, 0x1400ffff },
+ { 0x210001ec, 0x24000001 },
+ { 0x210001ed, 0x1400ffff },
+ { 0x210001ee, 0x24000001 },
+ { 0x210001ef, 0x1400ffff },
+ { 0x210001f0, 0x14000000 },
+ { 0x210001f1, 0x24000002 },
+ { 0x210001f2, 0x2000ffff },
+ { 0x210001f3, 0x1400fffe },
+ { 0x210001f4, 0x24000001 },
+ { 0x210001f5, 0x1400ffff },
+ { 0x210001f6, 0x2400ff9f },
+ { 0x210001f7, 0x2400ffc8 },
+ { 0x210001f8, 0x24000001 },
+ { 0x210001f9, 0x1400ffff },
+ { 0x210001fa, 0x24000001 },
+ { 0x210001fb, 0x1400ffff },
+ { 0x210001fc, 0x24000001 },
+ { 0x210001fd, 0x1400ffff },
+ { 0x210001fe, 0x24000001 },
+ { 0x210001ff, 0x1400ffff },
+ { 0x21000200, 0x24000001 },
+ { 0x21000201, 0x1400ffff },
+ { 0x21000202, 0x24000001 },
+ { 0x21000203, 0x1400ffff },
+ { 0x21000204, 0x24000001 },
+ { 0x21000205, 0x1400ffff },
+ { 0x21000206, 0x24000001 },
+ { 0x21000207, 0x1400ffff },
+ { 0x21000208, 0x24000001 },
+ { 0x21000209, 0x1400ffff },
+ { 0x2100020a, 0x24000001 },
+ { 0x2100020b, 0x1400ffff },
+ { 0x2100020c, 0x24000001 },
+ { 0x2100020d, 0x1400ffff },
+ { 0x2100020e, 0x24000001 },
+ { 0x2100020f, 0x1400ffff },
+ { 0x21000210, 0x24000001 },
+ { 0x21000211, 0x1400ffff },
+ { 0x21000212, 0x24000001 },
+ { 0x21000213, 0x1400ffff },
+ { 0x21000214, 0x24000001 },
+ { 0x21000215, 0x1400ffff },
+ { 0x21000216, 0x24000001 },
+ { 0x21000217, 0x1400ffff },
+ { 0x21000218, 0x24000001 },
+ { 0x21000219, 0x1400ffff },
+ { 0x2100021a, 0x24000001 },
+ { 0x2100021b, 0x1400ffff },
+ { 0x2100021c, 0x24000001 },
+ { 0x2100021d, 0x1400ffff },
+ { 0x2100021e, 0x24000001 },
+ { 0x2100021f, 0x1400ffff },
+ { 0x21000220, 0x2400ff7e },
+ { 0x21000221, 0x14000000 },
+ { 0x21000222, 0x24000001 },
+ { 0x21000223, 0x1400ffff },
+ { 0x21000224, 0x24000001 },
+ { 0x21000225, 0x1400ffff },
+ { 0x21000226, 0x24000001 },
+ { 0x21000227, 0x1400ffff },
+ { 0x21000228, 0x24000001 },
+ { 0x21000229, 0x1400ffff },
+ { 0x2100022a, 0x24000001 },
+ { 0x2100022b, 0x1400ffff },
+ { 0x2100022c, 0x24000001 },
+ { 0x2100022d, 0x1400ffff },
+ { 0x2100022e, 0x24000001 },
+ { 0x2100022f, 0x1400ffff },
+ { 0x21000230, 0x24000001 },
+ { 0x21000231, 0x1400ffff },
+ { 0x21000232, 0x24000001 },
+ { 0x21000233, 0x1400ffff },
+ { 0x21800234, 0x14000005 },
+ { 0x2100023a, 0x24002a2b },
+ { 0x2100023b, 0x24000001 },
+ { 0x2100023c, 0x1400ffff },
+ { 0x2100023d, 0x2400ff5d },
+ { 0x2100023e, 0x24002a28 },
+ { 0x2180023f, 0x14000001 },
+ { 0x21000241, 0x24000001 },
+ { 0x21000242, 0x1400ffff },
+ { 0x21000243, 0x2400ff3d },
+ { 0x21000244, 0x24000045 },
+ { 0x21000245, 0x24000047 },
+ { 0x21000246, 0x24000001 },
+ { 0x21000247, 0x1400ffff },
+ { 0x21000248, 0x24000001 },
+ { 0x21000249, 0x1400ffff },
+ { 0x2100024a, 0x24000001 },
+ { 0x2100024b, 0x1400ffff },
+ { 0x2100024c, 0x24000001 },
+ { 0x2100024d, 0x1400ffff },
+ { 0x2100024e, 0x24000001 },
+ { 0x2100024f, 0x1400ffff },
+ { 0x21800250, 0x14000002 },
+ { 0x21000253, 0x1400ff2e },
+ { 0x21000254, 0x1400ff32 },
+ { 0x21000255, 0x14000000 },
+ { 0x21000256, 0x1400ff33 },
+ { 0x21000257, 0x1400ff33 },
+ { 0x21000258, 0x14000000 },
+ { 0x21000259, 0x1400ff36 },
+ { 0x2100025a, 0x14000000 },
+ { 0x2100025b, 0x1400ff35 },
+ { 0x2180025c, 0x14000003 },
+ { 0x21000260, 0x1400ff33 },
+ { 0x21800261, 0x14000001 },
+ { 0x21000263, 0x1400ff31 },
+ { 0x21800264, 0x14000003 },
+ { 0x21000268, 0x1400ff2f },
+ { 0x21000269, 0x1400ff2d },
+ { 0x2100026a, 0x14000000 },
+ { 0x2100026b, 0x140029f7 },
+ { 0x2180026c, 0x14000002 },
+ { 0x2100026f, 0x1400ff2d },
+ { 0x21800270, 0x14000001 },
+ { 0x21000272, 0x1400ff2b },
+ { 0x21800273, 0x14000001 },
+ { 0x21000275, 0x1400ff2a },
+ { 0x21800276, 0x14000006 },
+ { 0x2100027d, 0x140029e7 },
+ { 0x2180027e, 0x14000001 },
+ { 0x21000280, 0x1400ff26 },
+ { 0x21800281, 0x14000001 },
+ { 0x21000283, 0x1400ff26 },
+ { 0x21800284, 0x14000003 },
+ { 0x21000288, 0x1400ff26 },
+ { 0x21000289, 0x1400ffbb },
+ { 0x2100028a, 0x1400ff27 },
+ { 0x2100028b, 0x1400ff27 },
+ { 0x2100028c, 0x1400ffb9 },
+ { 0x2180028d, 0x14000004 },
+ { 0x21000292, 0x1400ff25 },
+ { 0x21000293, 0x14000000 },
+ { 0x21000294, 0x1c000000 },
+ { 0x21800295, 0x1400001a },
+ { 0x218002b0, 0x18000011 },
+ { 0x098002c2, 0x60000003 },
+ { 0x098002c6, 0x1800000b },
+ { 0x098002d2, 0x6000000d },
+ { 0x218002e0, 0x18000004 },
+ { 0x098002e5, 0x60000008 },
+ { 0x090002ee, 0x18000000 },
+ { 0x098002ef, 0x60000010 },
+ { 0x1b800300, 0x30000044 },
+ { 0x1b000345, 0x30000054 },
+ { 0x1b800346, 0x30000029 },
+ { 0x13800374, 0x60000001 },
+ { 0x1300037a, 0x18000000 },
+ { 0x1300037b, 0x14000082 },
+ { 0x1300037c, 0x14000082 },
+ { 0x1300037d, 0x14000082 },
+ { 0x0900037e, 0x54000000 },
+ { 0x13800384, 0x60000001 },
+ { 0x13000386, 0x24000026 },
+ { 0x09000387, 0x54000000 },
+ { 0x13000388, 0x24000025 },
+ { 0x13000389, 0x24000025 },
+ { 0x1300038a, 0x24000025 },
+ { 0x1300038c, 0x24000040 },
+ { 0x1300038e, 0x2400003f },
+ { 0x1300038f, 0x2400003f },
+ { 0x13000390, 0x14000000 },
+ { 0x13000391, 0x24000020 },
+ { 0x13000392, 0x24000020 },
+ { 0x13000393, 0x24000020 },
+ { 0x13000394, 0x24000020 },
+ { 0x13000395, 0x24000020 },
+ { 0x13000396, 0x24000020 },
+ { 0x13000397, 0x24000020 },
+ { 0x13000398, 0x24000020 },
+ { 0x13000399, 0x24000020 },
+ { 0x1300039a, 0x24000020 },
+ { 0x1300039b, 0x24000020 },
+ { 0x1300039c, 0x24000020 },
+ { 0x1300039d, 0x24000020 },
+ { 0x1300039e, 0x24000020 },
+ { 0x1300039f, 0x24000020 },
+ { 0x130003a0, 0x24000020 },
+ { 0x130003a1, 0x24000020 },
+ { 0x130003a3, 0x24000020 },
+ { 0x130003a4, 0x24000020 },
+ { 0x130003a5, 0x24000020 },
+ { 0x130003a6, 0x24000020 },
+ { 0x130003a7, 0x24000020 },
+ { 0x130003a8, 0x24000020 },
+ { 0x130003a9, 0x24000020 },
+ { 0x130003aa, 0x24000020 },
+ { 0x130003ab, 0x24000020 },
+ { 0x130003ac, 0x1400ffda },
+ { 0x130003ad, 0x1400ffdb },
+ { 0x130003ae, 0x1400ffdb },
+ { 0x130003af, 0x1400ffdb },
+ { 0x130003b0, 0x14000000 },
+ { 0x130003b1, 0x1400ffe0 },
+ { 0x130003b2, 0x1400ffe0 },
+ { 0x130003b3, 0x1400ffe0 },
+ { 0x130003b4, 0x1400ffe0 },
+ { 0x130003b5, 0x1400ffe0 },
+ { 0x130003b6, 0x1400ffe0 },
+ { 0x130003b7, 0x1400ffe0 },
+ { 0x130003b8, 0x1400ffe0 },
+ { 0x130003b9, 0x1400ffe0 },
+ { 0x130003ba, 0x1400ffe0 },
+ { 0x130003bb, 0x1400ffe0 },
+ { 0x130003bc, 0x1400ffe0 },
+ { 0x130003bd, 0x1400ffe0 },
+ { 0x130003be, 0x1400ffe0 },
+ { 0x130003bf, 0x1400ffe0 },
+ { 0x130003c0, 0x1400ffe0 },
+ { 0x130003c1, 0x1400ffe0 },
+ { 0x130003c2, 0x1400ffe1 },
+ { 0x130003c3, 0x1400ffe0 },
+ { 0x130003c4, 0x1400ffe0 },
+ { 0x130003c5, 0x1400ffe0 },
+ { 0x130003c6, 0x1400ffe0 },
+ { 0x130003c7, 0x1400ffe0 },
+ { 0x130003c8, 0x1400ffe0 },
+ { 0x130003c9, 0x1400ffe0 },
+ { 0x130003ca, 0x1400ffe0 },
+ { 0x130003cb, 0x1400ffe0 },
+ { 0x130003cc, 0x1400ffc0 },
+ { 0x130003cd, 0x1400ffc1 },
+ { 0x130003ce, 0x1400ffc1 },
+ { 0x130003d0, 0x1400ffc2 },
+ { 0x130003d1, 0x1400ffc7 },
+ { 0x138003d2, 0x24000002 },
+ { 0x130003d5, 0x1400ffd1 },
+ { 0x130003d6, 0x1400ffca },
+ { 0x130003d7, 0x14000000 },
+ { 0x130003d8, 0x24000001 },
+ { 0x130003d9, 0x1400ffff },
+ { 0x130003da, 0x24000001 },
+ { 0x130003db, 0x1400ffff },
+ { 0x130003dc, 0x24000001 },
+ { 0x130003dd, 0x1400ffff },
+ { 0x130003de, 0x24000001 },
+ { 0x130003df, 0x1400ffff },
+ { 0x130003e0, 0x24000001 },
+ { 0x130003e1, 0x1400ffff },
+ { 0x0a0003e2, 0x24000001 },
+ { 0x0a0003e3, 0x1400ffff },
+ { 0x0a0003e4, 0x24000001 },
+ { 0x0a0003e5, 0x1400ffff },
+ { 0x0a0003e6, 0x24000001 },
+ { 0x0a0003e7, 0x1400ffff },
+ { 0x0a0003e8, 0x24000001 },
+ { 0x0a0003e9, 0x1400ffff },
+ { 0x0a0003ea, 0x24000001 },
+ { 0x0a0003eb, 0x1400ffff },
+ { 0x0a0003ec, 0x24000001 },
+ { 0x0a0003ed, 0x1400ffff },
+ { 0x0a0003ee, 0x24000001 },
+ { 0x0a0003ef, 0x1400ffff },
+ { 0x130003f0, 0x1400ffaa },
+ { 0x130003f1, 0x1400ffb0 },
+ { 0x130003f2, 0x14000007 },
+ { 0x130003f3, 0x14000000 },
+ { 0x130003f4, 0x2400ffc4 },
+ { 0x130003f5, 0x1400ffa0 },
+ { 0x130003f6, 0x64000000 },
+ { 0x130003f7, 0x24000001 },
+ { 0x130003f8, 0x1400ffff },
+ { 0x130003f9, 0x2400fff9 },
+ { 0x130003fa, 0x24000001 },
+ { 0x130003fb, 0x1400ffff },
+ { 0x130003fc, 0x14000000 },
+ { 0x130003fd, 0x2400ff7e },
+ { 0x130003fe, 0x2400ff7e },
+ { 0x130003ff, 0x2400ff7e },
+ { 0x0c000400, 0x24000050 },
+ { 0x0c000401, 0x24000050 },
+ { 0x0c000402, 0x24000050 },
+ { 0x0c000403, 0x24000050 },
+ { 0x0c000404, 0x24000050 },
+ { 0x0c000405, 0x24000050 },
+ { 0x0c000406, 0x24000050 },
+ { 0x0c000407, 0x24000050 },
+ { 0x0c000408, 0x24000050 },
+ { 0x0c000409, 0x24000050 },
+ { 0x0c00040a, 0x24000050 },
+ { 0x0c00040b, 0x24000050 },
+ { 0x0c00040c, 0x24000050 },
+ { 0x0c00040d, 0x24000050 },
+ { 0x0c00040e, 0x24000050 },
+ { 0x0c00040f, 0x24000050 },
+ { 0x0c000410, 0x24000020 },
+ { 0x0c000411, 0x24000020 },
+ { 0x0c000412, 0x24000020 },
+ { 0x0c000413, 0x24000020 },
+ { 0x0c000414, 0x24000020 },
+ { 0x0c000415, 0x24000020 },
+ { 0x0c000416, 0x24000020 },
+ { 0x0c000417, 0x24000020 },
+ { 0x0c000418, 0x24000020 },
+ { 0x0c000419, 0x24000020 },
+ { 0x0c00041a, 0x24000020 },
+ { 0x0c00041b, 0x24000020 },
+ { 0x0c00041c, 0x24000020 },
+ { 0x0c00041d, 0x24000020 },
+ { 0x0c00041e, 0x24000020 },
+ { 0x0c00041f, 0x24000020 },
+ { 0x0c000420, 0x24000020 },
+ { 0x0c000421, 0x24000020 },
+ { 0x0c000422, 0x24000020 },
+ { 0x0c000423, 0x24000020 },
+ { 0x0c000424, 0x24000020 },
+ { 0x0c000425, 0x24000020 },
+ { 0x0c000426, 0x24000020 },
+ { 0x0c000427, 0x24000020 },
+ { 0x0c000428, 0x24000020 },
+ { 0x0c000429, 0x24000020 },
+ { 0x0c00042a, 0x24000020 },
+ { 0x0c00042b, 0x24000020 },
+ { 0x0c00042c, 0x24000020 },
+ { 0x0c00042d, 0x24000020 },
+ { 0x0c00042e, 0x24000020 },
+ { 0x0c00042f, 0x24000020 },
+ { 0x0c000430, 0x1400ffe0 },
+ { 0x0c000431, 0x1400ffe0 },
+ { 0x0c000432, 0x1400ffe0 },
+ { 0x0c000433, 0x1400ffe0 },
+ { 0x0c000434, 0x1400ffe0 },
+ { 0x0c000435, 0x1400ffe0 },
+ { 0x0c000436, 0x1400ffe0 },
+ { 0x0c000437, 0x1400ffe0 },
+ { 0x0c000438, 0x1400ffe0 },
+ { 0x0c000439, 0x1400ffe0 },
+ { 0x0c00043a, 0x1400ffe0 },
+ { 0x0c00043b, 0x1400ffe0 },
+ { 0x0c00043c, 0x1400ffe0 },
+ { 0x0c00043d, 0x1400ffe0 },
+ { 0x0c00043e, 0x1400ffe0 },
+ { 0x0c00043f, 0x1400ffe0 },
+ { 0x0c000440, 0x1400ffe0 },
+ { 0x0c000441, 0x1400ffe0 },
+ { 0x0c000442, 0x1400ffe0 },
+ { 0x0c000443, 0x1400ffe0 },
+ { 0x0c000444, 0x1400ffe0 },
+ { 0x0c000445, 0x1400ffe0 },
+ { 0x0c000446, 0x1400ffe0 },
+ { 0x0c000447, 0x1400ffe0 },
+ { 0x0c000448, 0x1400ffe0 },
+ { 0x0c000449, 0x1400ffe0 },
+ { 0x0c00044a, 0x1400ffe0 },
+ { 0x0c00044b, 0x1400ffe0 },
+ { 0x0c00044c, 0x1400ffe0 },
+ { 0x0c00044d, 0x1400ffe0 },
+ { 0x0c00044e, 0x1400ffe0 },
+ { 0x0c00044f, 0x1400ffe0 },
+ { 0x0c000450, 0x1400ffb0 },
+ { 0x0c000451, 0x1400ffb0 },
+ { 0x0c000452, 0x1400ffb0 },
+ { 0x0c000453, 0x1400ffb0 },
+ { 0x0c000454, 0x1400ffb0 },
+ { 0x0c000455, 0x1400ffb0 },
+ { 0x0c000456, 0x1400ffb0 },
+ { 0x0c000457, 0x1400ffb0 },
+ { 0x0c000458, 0x1400ffb0 },
+ { 0x0c000459, 0x1400ffb0 },
+ { 0x0c00045a, 0x1400ffb0 },
+ { 0x0c00045b, 0x1400ffb0 },
+ { 0x0c00045c, 0x1400ffb0 },
+ { 0x0c00045d, 0x1400ffb0 },
+ { 0x0c00045e, 0x1400ffb0 },
+ { 0x0c00045f, 0x1400ffb0 },
+ { 0x0c000460, 0x24000001 },
+ { 0x0c000461, 0x1400ffff },
+ { 0x0c000462, 0x24000001 },
+ { 0x0c000463, 0x1400ffff },
+ { 0x0c000464, 0x24000001 },
+ { 0x0c000465, 0x1400ffff },
+ { 0x0c000466, 0x24000001 },
+ { 0x0c000467, 0x1400ffff },
+ { 0x0c000468, 0x24000001 },
+ { 0x0c000469, 0x1400ffff },
+ { 0x0c00046a, 0x24000001 },
+ { 0x0c00046b, 0x1400ffff },
+ { 0x0c00046c, 0x24000001 },
+ { 0x0c00046d, 0x1400ffff },
+ { 0x0c00046e, 0x24000001 },
+ { 0x0c00046f, 0x1400ffff },
+ { 0x0c000470, 0x24000001 },
+ { 0x0c000471, 0x1400ffff },
+ { 0x0c000472, 0x24000001 },
+ { 0x0c000473, 0x1400ffff },
+ { 0x0c000474, 0x24000001 },
+ { 0x0c000475, 0x1400ffff },
+ { 0x0c000476, 0x24000001 },
+ { 0x0c000477, 0x1400ffff },
+ { 0x0c000478, 0x24000001 },
+ { 0x0c000479, 0x1400ffff },
+ { 0x0c00047a, 0x24000001 },
+ { 0x0c00047b, 0x1400ffff },
+ { 0x0c00047c, 0x24000001 },
+ { 0x0c00047d, 0x1400ffff },
+ { 0x0c00047e, 0x24000001 },
+ { 0x0c00047f, 0x1400ffff },
+ { 0x0c000480, 0x24000001 },
+ { 0x0c000481, 0x1400ffff },
+ { 0x0c000482, 0x68000000 },
+ { 0x0c800483, 0x30000003 },
+ { 0x0c800488, 0x2c000001 },
+ { 0x0c00048a, 0x24000001 },
+ { 0x0c00048b, 0x1400ffff },
+ { 0x0c00048c, 0x24000001 },
+ { 0x0c00048d, 0x1400ffff },
+ { 0x0c00048e, 0x24000001 },
+ { 0x0c00048f, 0x1400ffff },
+ { 0x0c000490, 0x24000001 },
+ { 0x0c000491, 0x1400ffff },
+ { 0x0c000492, 0x24000001 },
+ { 0x0c000493, 0x1400ffff },
+ { 0x0c000494, 0x24000001 },
+ { 0x0c000495, 0x1400ffff },
+ { 0x0c000496, 0x24000001 },
+ { 0x0c000497, 0x1400ffff },
+ { 0x0c000498, 0x24000001 },
+ { 0x0c000499, 0x1400ffff },
+ { 0x0c00049a, 0x24000001 },
+ { 0x0c00049b, 0x1400ffff },
+ { 0x0c00049c, 0x24000001 },
+ { 0x0c00049d, 0x1400ffff },
+ { 0x0c00049e, 0x24000001 },
+ { 0x0c00049f, 0x1400ffff },
+ { 0x0c0004a0, 0x24000001 },
+ { 0x0c0004a1, 0x1400ffff },
+ { 0x0c0004a2, 0x24000001 },
+ { 0x0c0004a3, 0x1400ffff },
+ { 0x0c0004a4, 0x24000001 },
+ { 0x0c0004a5, 0x1400ffff },
+ { 0x0c0004a6, 0x24000001 },
+ { 0x0c0004a7, 0x1400ffff },
+ { 0x0c0004a8, 0x24000001 },
+ { 0x0c0004a9, 0x1400ffff },
+ { 0x0c0004aa, 0x24000001 },
+ { 0x0c0004ab, 0x1400ffff },
+ { 0x0c0004ac, 0x24000001 },
+ { 0x0c0004ad, 0x1400ffff },
+ { 0x0c0004ae, 0x24000001 },
+ { 0x0c0004af, 0x1400ffff },
+ { 0x0c0004b0, 0x24000001 },
+ { 0x0c0004b1, 0x1400ffff },
+ { 0x0c0004b2, 0x24000001 },
+ { 0x0c0004b3, 0x1400ffff },
+ { 0x0c0004b4, 0x24000001 },
+ { 0x0c0004b5, 0x1400ffff },
+ { 0x0c0004b6, 0x24000001 },
+ { 0x0c0004b7, 0x1400ffff },
+ { 0x0c0004b8, 0x24000001 },
+ { 0x0c0004b9, 0x1400ffff },
+ { 0x0c0004ba, 0x24000001 },
+ { 0x0c0004bb, 0x1400ffff },
+ { 0x0c0004bc, 0x24000001 },
+ { 0x0c0004bd, 0x1400ffff },
+ { 0x0c0004be, 0x24000001 },
+ { 0x0c0004bf, 0x1400ffff },
+ { 0x0c0004c0, 0x2400000f },
+ { 0x0c0004c1, 0x24000001 },
+ { 0x0c0004c2, 0x1400ffff },
+ { 0x0c0004c3, 0x24000001 },
+ { 0x0c0004c4, 0x1400ffff },
+ { 0x0c0004c5, 0x24000001 },
+ { 0x0c0004c6, 0x1400ffff },
+ { 0x0c0004c7, 0x24000001 },
+ { 0x0c0004c8, 0x1400ffff },
+ { 0x0c0004c9, 0x24000001 },
+ { 0x0c0004ca, 0x1400ffff },
+ { 0x0c0004cb, 0x24000001 },
+ { 0x0c0004cc, 0x1400ffff },
+ { 0x0c0004cd, 0x24000001 },
+ { 0x0c0004ce, 0x1400ffff },
+ { 0x0c0004cf, 0x1400fff1 },
+ { 0x0c0004d0, 0x24000001 },
+ { 0x0c0004d1, 0x1400ffff },
+ { 0x0c0004d2, 0x24000001 },
+ { 0x0c0004d3, 0x1400ffff },
+ { 0x0c0004d4, 0x24000001 },
+ { 0x0c0004d5, 0x1400ffff },
+ { 0x0c0004d6, 0x24000001 },
+ { 0x0c0004d7, 0x1400ffff },
+ { 0x0c0004d8, 0x24000001 },
+ { 0x0c0004d9, 0x1400ffff },
+ { 0x0c0004da, 0x24000001 },
+ { 0x0c0004db, 0x1400ffff },
+ { 0x0c0004dc, 0x24000001 },
+ { 0x0c0004dd, 0x1400ffff },
+ { 0x0c0004de, 0x24000001 },
+ { 0x0c0004df, 0x1400ffff },
+ { 0x0c0004e0, 0x24000001 },
+ { 0x0c0004e1, 0x1400ffff },
+ { 0x0c0004e2, 0x24000001 },
+ { 0x0c0004e3, 0x1400ffff },
+ { 0x0c0004e4, 0x24000001 },
+ { 0x0c0004e5, 0x1400ffff },
+ { 0x0c0004e6, 0x24000001 },
+ { 0x0c0004e7, 0x1400ffff },
+ { 0x0c0004e8, 0x24000001 },
+ { 0x0c0004e9, 0x1400ffff },
+ { 0x0c0004ea, 0x24000001 },
+ { 0x0c0004eb, 0x1400ffff },
+ { 0x0c0004ec, 0x24000001 },
+ { 0x0c0004ed, 0x1400ffff },
+ { 0x0c0004ee, 0x24000001 },
+ { 0x0c0004ef, 0x1400ffff },
+ { 0x0c0004f0, 0x24000001 },
+ { 0x0c0004f1, 0x1400ffff },
+ { 0x0c0004f2, 0x24000001 },
+ { 0x0c0004f3, 0x1400ffff },
+ { 0x0c0004f4, 0x24000001 },
+ { 0x0c0004f5, 0x1400ffff },
+ { 0x0c0004f6, 0x24000001 },
+ { 0x0c0004f7, 0x1400ffff },
+ { 0x0c0004f8, 0x24000001 },
+ { 0x0c0004f9, 0x1400ffff },
+ { 0x0c0004fa, 0x24000001 },
+ { 0x0c0004fb, 0x1400ffff },
+ { 0x0c0004fc, 0x24000001 },
+ { 0x0c0004fd, 0x1400ffff },
+ { 0x0c0004fe, 0x24000001 },
+ { 0x0c0004ff, 0x1400ffff },
+ { 0x0c000500, 0x24000001 },
+ { 0x0c000501, 0x1400ffff },
+ { 0x0c000502, 0x24000001 },
+ { 0x0c000503, 0x1400ffff },
+ { 0x0c000504, 0x24000001 },
+ { 0x0c000505, 0x1400ffff },
+ { 0x0c000506, 0x24000001 },
+ { 0x0c000507, 0x1400ffff },
+ { 0x0c000508, 0x24000001 },
+ { 0x0c000509, 0x1400ffff },
+ { 0x0c00050a, 0x24000001 },
+ { 0x0c00050b, 0x1400ffff },
+ { 0x0c00050c, 0x24000001 },
+ { 0x0c00050d, 0x1400ffff },
+ { 0x0c00050e, 0x24000001 },
+ { 0x0c00050f, 0x1400ffff },
+ { 0x0c000510, 0x24000001 },
+ { 0x0c000511, 0x1400ffff },
+ { 0x0c000512, 0x24000001 },
+ { 0x0c000513, 0x1400ffff },
+ { 0x01000531, 0x24000030 },
+ { 0x01000532, 0x24000030 },
+ { 0x01000533, 0x24000030 },
+ { 0x01000534, 0x24000030 },
+ { 0x01000535, 0x24000030 },
+ { 0x01000536, 0x24000030 },
+ { 0x01000537, 0x24000030 },
+ { 0x01000538, 0x24000030 },
+ { 0x01000539, 0x24000030 },
+ { 0x0100053a, 0x24000030 },
+ { 0x0100053b, 0x24000030 },
+ { 0x0100053c, 0x24000030 },
+ { 0x0100053d, 0x24000030 },
+ { 0x0100053e, 0x24000030 },
+ { 0x0100053f, 0x24000030 },
+ { 0x01000540, 0x24000030 },
+ { 0x01000541, 0x24000030 },
+ { 0x01000542, 0x24000030 },
+ { 0x01000543, 0x24000030 },
+ { 0x01000544, 0x24000030 },
+ { 0x01000545, 0x24000030 },
+ { 0x01000546, 0x24000030 },
+ { 0x01000547, 0x24000030 },
+ { 0x01000548, 0x24000030 },
+ { 0x01000549, 0x24000030 },
+ { 0x0100054a, 0x24000030 },
+ { 0x0100054b, 0x24000030 },
+ { 0x0100054c, 0x24000030 },
+ { 0x0100054d, 0x24000030 },
+ { 0x0100054e, 0x24000030 },
+ { 0x0100054f, 0x24000030 },
+ { 0x01000550, 0x24000030 },
+ { 0x01000551, 0x24000030 },
+ { 0x01000552, 0x24000030 },
+ { 0x01000553, 0x24000030 },
+ { 0x01000554, 0x24000030 },
+ { 0x01000555, 0x24000030 },
+ { 0x01000556, 0x24000030 },
+ { 0x01000559, 0x18000000 },
+ { 0x0180055a, 0x54000005 },
+ { 0x01000561, 0x1400ffd0 },
+ { 0x01000562, 0x1400ffd0 },
+ { 0x01000563, 0x1400ffd0 },
+ { 0x01000564, 0x1400ffd0 },
+ { 0x01000565, 0x1400ffd0 },
+ { 0x01000566, 0x1400ffd0 },
+ { 0x01000567, 0x1400ffd0 },
+ { 0x01000568, 0x1400ffd0 },
+ { 0x01000569, 0x1400ffd0 },
+ { 0x0100056a, 0x1400ffd0 },
+ { 0x0100056b, 0x1400ffd0 },
+ { 0x0100056c, 0x1400ffd0 },
+ { 0x0100056d, 0x1400ffd0 },
+ { 0x0100056e, 0x1400ffd0 },
+ { 0x0100056f, 0x1400ffd0 },
+ { 0x01000570, 0x1400ffd0 },
+ { 0x01000571, 0x1400ffd0 },
+ { 0x01000572, 0x1400ffd0 },
+ { 0x01000573, 0x1400ffd0 },
+ { 0x01000574, 0x1400ffd0 },
+ { 0x01000575, 0x1400ffd0 },
+ { 0x01000576, 0x1400ffd0 },
+ { 0x01000577, 0x1400ffd0 },
+ { 0x01000578, 0x1400ffd0 },
+ { 0x01000579, 0x1400ffd0 },
+ { 0x0100057a, 0x1400ffd0 },
+ { 0x0100057b, 0x1400ffd0 },
+ { 0x0100057c, 0x1400ffd0 },
+ { 0x0100057d, 0x1400ffd0 },
+ { 0x0100057e, 0x1400ffd0 },
+ { 0x0100057f, 0x1400ffd0 },
+ { 0x01000580, 0x1400ffd0 },
+ { 0x01000581, 0x1400ffd0 },
+ { 0x01000582, 0x1400ffd0 },
+ { 0x01000583, 0x1400ffd0 },
+ { 0x01000584, 0x1400ffd0 },
+ { 0x01000585, 0x1400ffd0 },
+ { 0x01000586, 0x1400ffd0 },
+ { 0x01000587, 0x14000000 },
+ { 0x09000589, 0x54000000 },
+ { 0x0100058a, 0x44000000 },
+ { 0x19800591, 0x3000002c },
+ { 0x190005be, 0x54000000 },
+ { 0x190005bf, 0x30000000 },
+ { 0x190005c0, 0x54000000 },
+ { 0x198005c1, 0x30000001 },
+ { 0x190005c3, 0x54000000 },
+ { 0x198005c4, 0x30000001 },
+ { 0x190005c6, 0x54000000 },
+ { 0x190005c7, 0x30000000 },
+ { 0x198005d0, 0x1c00001a },
+ { 0x198005f0, 0x1c000002 },
+ { 0x198005f3, 0x54000001 },
+ { 0x09800600, 0x04000003 },
+ { 0x0000060b, 0x5c000000 },
+ { 0x0980060c, 0x54000001 },
+ { 0x0080060e, 0x68000001 },
+ { 0x00800610, 0x30000005 },
+ { 0x0900061b, 0x54000000 },
+ { 0x0080061e, 0x54000001 },
+ { 0x00800621, 0x1c000019 },
+ { 0x09000640, 0x18000000 },
+ { 0x00800641, 0x1c000009 },
+ { 0x1b80064b, 0x30000013 },
+ { 0x09800660, 0x34000009 },
+ { 0x0080066a, 0x54000003 },
+ { 0x0080066e, 0x1c000001 },
+ { 0x1b000670, 0x30000000 },
+ { 0x00800671, 0x1c000062 },
+ { 0x000006d4, 0x54000000 },
+ { 0x000006d5, 0x1c000000 },
+ { 0x008006d6, 0x30000006 },
+ { 0x090006dd, 0x04000000 },
+ { 0x000006de, 0x2c000000 },
+ { 0x008006df, 0x30000005 },
+ { 0x008006e5, 0x18000001 },
+ { 0x008006e7, 0x30000001 },
+ { 0x000006e9, 0x68000000 },
+ { 0x008006ea, 0x30000003 },
+ { 0x008006ee, 0x1c000001 },
+ { 0x008006f0, 0x34000009 },
+ { 0x008006fa, 0x1c000002 },
+ { 0x008006fd, 0x68000001 },
+ { 0x000006ff, 0x1c000000 },
+ { 0x31800700, 0x5400000d },
+ { 0x3100070f, 0x04000000 },
+ { 0x31000710, 0x1c000000 },
+ { 0x31000711, 0x30000000 },
+ { 0x31800712, 0x1c00001d },
+ { 0x31800730, 0x3000001a },
+ { 0x3180074d, 0x1c000020 },
+ { 0x37800780, 0x1c000025 },
+ { 0x378007a6, 0x3000000a },
+ { 0x370007b1, 0x1c000000 },
+ { 0x3f8007c0, 0x34000009 },
+ { 0x3f8007ca, 0x1c000020 },
+ { 0x3f8007eb, 0x30000008 },
+ { 0x3f8007f4, 0x18000001 },
+ { 0x3f0007f6, 0x68000000 },
+ { 0x3f8007f7, 0x54000002 },
+ { 0x3f0007fa, 0x18000000 },
+ { 0x0e800901, 0x30000001 },
+ { 0x0e000903, 0x28000000 },
+ { 0x0e800904, 0x1c000035 },
+ { 0x0e00093c, 0x30000000 },
+ { 0x0e00093d, 0x1c000000 },
+ { 0x0e80093e, 0x28000002 },
+ { 0x0e800941, 0x30000007 },
+ { 0x0e800949, 0x28000003 },
+ { 0x0e00094d, 0x30000000 },
+ { 0x0e000950, 0x1c000000 },
+ { 0x0e800951, 0x30000003 },
+ { 0x0e800958, 0x1c000009 },
+ { 0x0e800962, 0x30000001 },
+ { 0x09800964, 0x54000001 },
+ { 0x0e800966, 0x34000009 },
+ { 0x09000970, 0x54000000 },
+ { 0x0e80097b, 0x1c000004 },
+ { 0x02000981, 0x30000000 },
+ { 0x02800982, 0x28000001 },
+ { 0x02800985, 0x1c000007 },
+ { 0x0280098f, 0x1c000001 },
+ { 0x02800993, 0x1c000015 },
+ { 0x028009aa, 0x1c000006 },
+ { 0x020009b2, 0x1c000000 },
+ { 0x028009b6, 0x1c000003 },
+ { 0x020009bc, 0x30000000 },
+ { 0x020009bd, 0x1c000000 },
+ { 0x028009be, 0x28000002 },
+ { 0x028009c1, 0x30000003 },
+ { 0x028009c7, 0x28000001 },
+ { 0x028009cb, 0x28000001 },
+ { 0x020009cd, 0x30000000 },
+ { 0x020009ce, 0x1c000000 },
+ { 0x020009d7, 0x28000000 },
+ { 0x028009dc, 0x1c000001 },
+ { 0x028009df, 0x1c000002 },
+ { 0x028009e2, 0x30000001 },
+ { 0x028009e6, 0x34000009 },
+ { 0x028009f0, 0x1c000001 },
+ { 0x028009f2, 0x5c000001 },
+ { 0x028009f4, 0x3c000005 },
+ { 0x020009fa, 0x68000000 },
+ { 0x15800a01, 0x30000001 },
+ { 0x15000a03, 0x28000000 },
+ { 0x15800a05, 0x1c000005 },
+ { 0x15800a0f, 0x1c000001 },
+ { 0x15800a13, 0x1c000015 },
+ { 0x15800a2a, 0x1c000006 },
+ { 0x15800a32, 0x1c000001 },
+ { 0x15800a35, 0x1c000001 },
+ { 0x15800a38, 0x1c000001 },
+ { 0x15000a3c, 0x30000000 },
+ { 0x15800a3e, 0x28000002 },
+ { 0x15800a41, 0x30000001 },
+ { 0x15800a47, 0x30000001 },
+ { 0x15800a4b, 0x30000002 },
+ { 0x15800a59, 0x1c000003 },
+ { 0x15000a5e, 0x1c000000 },
+ { 0x15800a66, 0x34000009 },
+ { 0x15800a70, 0x30000001 },
+ { 0x15800a72, 0x1c000002 },
+ { 0x14800a81, 0x30000001 },
+ { 0x14000a83, 0x28000000 },
+ { 0x14800a85, 0x1c000008 },
+ { 0x14800a8f, 0x1c000002 },
+ { 0x14800a93, 0x1c000015 },
+ { 0x14800aaa, 0x1c000006 },
+ { 0x14800ab2, 0x1c000001 },
+ { 0x14800ab5, 0x1c000004 },
+ { 0x14000abc, 0x30000000 },
+ { 0x14000abd, 0x1c000000 },
+ { 0x14800abe, 0x28000002 },
+ { 0x14800ac1, 0x30000004 },
+ { 0x14800ac7, 0x30000001 },
+ { 0x14000ac9, 0x28000000 },
+ { 0x14800acb, 0x28000001 },
+ { 0x14000acd, 0x30000000 },
+ { 0x14000ad0, 0x1c000000 },
+ { 0x14800ae0, 0x1c000001 },
+ { 0x14800ae2, 0x30000001 },
+ { 0x14800ae6, 0x34000009 },
+ { 0x14000af1, 0x5c000000 },
+ { 0x2b000b01, 0x30000000 },
+ { 0x2b800b02, 0x28000001 },
+ { 0x2b800b05, 0x1c000007 },
+ { 0x2b800b0f, 0x1c000001 },
+ { 0x2b800b13, 0x1c000015 },
+ { 0x2b800b2a, 0x1c000006 },
+ { 0x2b800b32, 0x1c000001 },
+ { 0x2b800b35, 0x1c000004 },
+ { 0x2b000b3c, 0x30000000 },
+ { 0x2b000b3d, 0x1c000000 },
+ { 0x2b000b3e, 0x28000000 },
+ { 0x2b000b3f, 0x30000000 },
+ { 0x2b000b40, 0x28000000 },
+ { 0x2b800b41, 0x30000002 },
+ { 0x2b800b47, 0x28000001 },
+ { 0x2b800b4b, 0x28000001 },
+ { 0x2b000b4d, 0x30000000 },
+ { 0x2b000b56, 0x30000000 },
+ { 0x2b000b57, 0x28000000 },
+ { 0x2b800b5c, 0x1c000001 },
+ { 0x2b800b5f, 0x1c000002 },
+ { 0x2b800b66, 0x34000009 },
+ { 0x2b000b70, 0x68000000 },
+ { 0x2b000b71, 0x1c000000 },
+ { 0x35000b82, 0x30000000 },
+ { 0x35000b83, 0x1c000000 },
+ { 0x35800b85, 0x1c000005 },
+ { 0x35800b8e, 0x1c000002 },
+ { 0x35800b92, 0x1c000003 },
+ { 0x35800b99, 0x1c000001 },
+ { 0x35000b9c, 0x1c000000 },
+ { 0x35800b9e, 0x1c000001 },
+ { 0x35800ba3, 0x1c000001 },
+ { 0x35800ba8, 0x1c000002 },
+ { 0x35800bae, 0x1c00000b },
+ { 0x35800bbe, 0x28000001 },
+ { 0x35000bc0, 0x30000000 },
+ { 0x35800bc1, 0x28000001 },
+ { 0x35800bc6, 0x28000002 },
+ { 0x35800bca, 0x28000002 },
+ { 0x35000bcd, 0x30000000 },
+ { 0x35000bd7, 0x28000000 },
+ { 0x35800be6, 0x34000009 },
+ { 0x35800bf0, 0x3c000002 },
+ { 0x35800bf3, 0x68000005 },
+ { 0x35000bf9, 0x5c000000 },
+ { 0x35000bfa, 0x68000000 },
+ { 0x36800c01, 0x28000002 },
+ { 0x36800c05, 0x1c000007 },
+ { 0x36800c0e, 0x1c000002 },
+ { 0x36800c12, 0x1c000016 },
+ { 0x36800c2a, 0x1c000009 },
+ { 0x36800c35, 0x1c000004 },
+ { 0x36800c3e, 0x30000002 },
+ { 0x36800c41, 0x28000003 },
+ { 0x36800c46, 0x30000002 },
+ { 0x36800c4a, 0x30000003 },
+ { 0x36800c55, 0x30000001 },
+ { 0x36800c60, 0x1c000001 },
+ { 0x36800c66, 0x34000009 },
+ { 0x1c800c82, 0x28000001 },
+ { 0x1c800c85, 0x1c000007 },
+ { 0x1c800c8e, 0x1c000002 },
+ { 0x1c800c92, 0x1c000016 },
+ { 0x1c800caa, 0x1c000009 },
+ { 0x1c800cb5, 0x1c000004 },
+ { 0x1c000cbc, 0x30000000 },
+ { 0x1c000cbd, 0x1c000000 },
+ { 0x1c000cbe, 0x28000000 },
+ { 0x1c000cbf, 0x30000000 },
+ { 0x1c800cc0, 0x28000004 },
+ { 0x1c000cc6, 0x30000000 },
+ { 0x1c800cc7, 0x28000001 },
+ { 0x1c800cca, 0x28000001 },
+ { 0x1c800ccc, 0x30000001 },
+ { 0x1c800cd5, 0x28000001 },
+ { 0x1c000cde, 0x1c000000 },
+ { 0x1c800ce0, 0x1c000001 },
+ { 0x1c800ce2, 0x30000001 },
+ { 0x1c800ce6, 0x34000009 },
+ { 0x1c800cf1, 0x68000001 },
+ { 0x24800d02, 0x28000001 },
+ { 0x24800d05, 0x1c000007 },
+ { 0x24800d0e, 0x1c000002 },
+ { 0x24800d12, 0x1c000016 },
+ { 0x24800d2a, 0x1c00000f },
+ { 0x24800d3e, 0x28000002 },
+ { 0x24800d41, 0x30000002 },
+ { 0x24800d46, 0x28000002 },
+ { 0x24800d4a, 0x28000002 },
+ { 0x24000d4d, 0x30000000 },
+ { 0x24000d57, 0x28000000 },
+ { 0x24800d60, 0x1c000001 },
+ { 0x24800d66, 0x34000009 },
+ { 0x2f800d82, 0x28000001 },
+ { 0x2f800d85, 0x1c000011 },
+ { 0x2f800d9a, 0x1c000017 },
+ { 0x2f800db3, 0x1c000008 },
+ { 0x2f000dbd, 0x1c000000 },
+ { 0x2f800dc0, 0x1c000006 },
+ { 0x2f000dca, 0x30000000 },
+ { 0x2f800dcf, 0x28000002 },
+ { 0x2f800dd2, 0x30000002 },
+ { 0x2f000dd6, 0x30000000 },
+ { 0x2f800dd8, 0x28000007 },
+ { 0x2f800df2, 0x28000001 },
+ { 0x2f000df4, 0x54000000 },
+ { 0x38800e01, 0x1c00002f },
+ { 0x38000e31, 0x30000000 },
+ { 0x38800e32, 0x1c000001 },
+ { 0x38800e34, 0x30000006 },
+ { 0x09000e3f, 0x5c000000 },
+ { 0x38800e40, 0x1c000005 },
+ { 0x38000e46, 0x18000000 },
+ { 0x38800e47, 0x30000007 },
+ { 0x38000e4f, 0x54000000 },
+ { 0x38800e50, 0x34000009 },
+ { 0x38800e5a, 0x54000001 },
+ { 0x20800e81, 0x1c000001 },
+ { 0x20000e84, 0x1c000000 },
+ { 0x20800e87, 0x1c000001 },
+ { 0x20000e8a, 0x1c000000 },
+ { 0x20000e8d, 0x1c000000 },
+ { 0x20800e94, 0x1c000003 },
+ { 0x20800e99, 0x1c000006 },
+ { 0x20800ea1, 0x1c000002 },
+ { 0x20000ea5, 0x1c000000 },
+ { 0x20000ea7, 0x1c000000 },
+ { 0x20800eaa, 0x1c000001 },
+ { 0x20800ead, 0x1c000003 },
+ { 0x20000eb1, 0x30000000 },
+ { 0x20800eb2, 0x1c000001 },
+ { 0x20800eb4, 0x30000005 },
+ { 0x20800ebb, 0x30000001 },
+ { 0x20000ebd, 0x1c000000 },
+ { 0x20800ec0, 0x1c000004 },
+ { 0x20000ec6, 0x18000000 },
+ { 0x20800ec8, 0x30000005 },
+ { 0x20800ed0, 0x34000009 },
+ { 0x20800edc, 0x1c000001 },
+ { 0x39000f00, 0x1c000000 },
+ { 0x39800f01, 0x68000002 },
+ { 0x39800f04, 0x5400000e },
+ { 0x39800f13, 0x68000004 },
+ { 0x39800f18, 0x30000001 },
+ { 0x39800f1a, 0x68000005 },
+ { 0x39800f20, 0x34000009 },
+ { 0x39800f2a, 0x3c000009 },
+ { 0x39000f34, 0x68000000 },
+ { 0x39000f35, 0x30000000 },
+ { 0x39000f36, 0x68000000 },
+ { 0x39000f37, 0x30000000 },
+ { 0x39000f38, 0x68000000 },
+ { 0x39000f39, 0x30000000 },
+ { 0x39000f3a, 0x58000000 },
+ { 0x39000f3b, 0x48000000 },
+ { 0x39000f3c, 0x58000000 },
+ { 0x39000f3d, 0x48000000 },
+ { 0x39800f3e, 0x28000001 },
+ { 0x39800f40, 0x1c000007 },
+ { 0x39800f49, 0x1c000021 },
+ { 0x39800f71, 0x3000000d },
+ { 0x39000f7f, 0x28000000 },
+ { 0x39800f80, 0x30000004 },
+ { 0x39000f85, 0x54000000 },
+ { 0x39800f86, 0x30000001 },
+ { 0x39800f88, 0x1c000003 },
+ { 0x39800f90, 0x30000007 },
+ { 0x39800f99, 0x30000023 },
+ { 0x39800fbe, 0x68000007 },
+ { 0x39000fc6, 0x30000000 },
+ { 0x39800fc7, 0x68000005 },
+ { 0x39000fcf, 0x68000000 },
+ { 0x39800fd0, 0x54000001 },
+ { 0x26801000, 0x1c000021 },
+ { 0x26801023, 0x1c000004 },
+ { 0x26801029, 0x1c000001 },
+ { 0x2600102c, 0x28000000 },
+ { 0x2680102d, 0x30000003 },
+ { 0x26001031, 0x28000000 },
+ { 0x26001032, 0x30000000 },
+ { 0x26801036, 0x30000001 },
+ { 0x26001038, 0x28000000 },
+ { 0x26001039, 0x30000000 },
+ { 0x26801040, 0x34000009 },
+ { 0x2680104a, 0x54000005 },
+ { 0x26801050, 0x1c000005 },
+ { 0x26801056, 0x28000001 },
+ { 0x26801058, 0x30000001 },
+ { 0x100010a0, 0x24001c60 },
+ { 0x100010a1, 0x24001c60 },
+ { 0x100010a2, 0x24001c60 },
+ { 0x100010a3, 0x24001c60 },
+ { 0x100010a4, 0x24001c60 },
+ { 0x100010a5, 0x24001c60 },
+ { 0x100010a6, 0x24001c60 },
+ { 0x100010a7, 0x24001c60 },
+ { 0x100010a8, 0x24001c60 },
+ { 0x100010a9, 0x24001c60 },
+ { 0x100010aa, 0x24001c60 },
+ { 0x100010ab, 0x24001c60 },
+ { 0x100010ac, 0x24001c60 },
+ { 0x100010ad, 0x24001c60 },
+ { 0x100010ae, 0x24001c60 },
+ { 0x100010af, 0x24001c60 },
+ { 0x100010b0, 0x24001c60 },
+ { 0x100010b1, 0x24001c60 },
+ { 0x100010b2, 0x24001c60 },
+ { 0x100010b3, 0x24001c60 },
+ { 0x100010b4, 0x24001c60 },
+ { 0x100010b5, 0x24001c60 },
+ { 0x100010b6, 0x24001c60 },
+ { 0x100010b7, 0x24001c60 },
+ { 0x100010b8, 0x24001c60 },
+ { 0x100010b9, 0x24001c60 },
+ { 0x100010ba, 0x24001c60 },
+ { 0x100010bb, 0x24001c60 },
+ { 0x100010bc, 0x24001c60 },
+ { 0x100010bd, 0x24001c60 },
+ { 0x100010be, 0x24001c60 },
+ { 0x100010bf, 0x24001c60 },
+ { 0x100010c0, 0x24001c60 },
+ { 0x100010c1, 0x24001c60 },
+ { 0x100010c2, 0x24001c60 },
+ { 0x100010c3, 0x24001c60 },
+ { 0x100010c4, 0x24001c60 },
+ { 0x100010c5, 0x24001c60 },
+ { 0x108010d0, 0x1c00002a },
+ { 0x090010fb, 0x54000000 },
+ { 0x100010fc, 0x18000000 },
+ { 0x17801100, 0x1c000059 },
+ { 0x1780115f, 0x1c000043 },
+ { 0x178011a8, 0x1c000051 },
+ { 0x0f801200, 0x1c000048 },
+ { 0x0f80124a, 0x1c000003 },
+ { 0x0f801250, 0x1c000006 },
+ { 0x0f001258, 0x1c000000 },
+ { 0x0f80125a, 0x1c000003 },
+ { 0x0f801260, 0x1c000028 },
+ { 0x0f80128a, 0x1c000003 },
+ { 0x0f801290, 0x1c000020 },
+ { 0x0f8012b2, 0x1c000003 },
+ { 0x0f8012b8, 0x1c000006 },
+ { 0x0f0012c0, 0x1c000000 },
+ { 0x0f8012c2, 0x1c000003 },
+ { 0x0f8012c8, 0x1c00000e },
+ { 0x0f8012d8, 0x1c000038 },
+ { 0x0f801312, 0x1c000003 },
+ { 0x0f801318, 0x1c000042 },
+ { 0x0f00135f, 0x30000000 },
+ { 0x0f001360, 0x68000000 },
+ { 0x0f801361, 0x54000007 },
+ { 0x0f801369, 0x3c000013 },
+ { 0x0f801380, 0x1c00000f },
+ { 0x0f801390, 0x68000009 },
+ { 0x088013a0, 0x1c000054 },
+ { 0x07801401, 0x1c00026b },
+ { 0x0780166d, 0x54000001 },
+ { 0x0780166f, 0x1c000007 },
+ { 0x28001680, 0x74000000 },
+ { 0x28801681, 0x1c000019 },
+ { 0x2800169b, 0x58000000 },
+ { 0x2800169c, 0x48000000 },
+ { 0x2d8016a0, 0x1c00004a },
+ { 0x098016eb, 0x54000002 },
+ { 0x2d8016ee, 0x38000002 },
+ { 0x32801700, 0x1c00000c },
+ { 0x3280170e, 0x1c000003 },
+ { 0x32801712, 0x30000002 },
+ { 0x18801720, 0x1c000011 },
+ { 0x18801732, 0x30000002 },
+ { 0x09801735, 0x54000001 },
+ { 0x06801740, 0x1c000011 },
+ { 0x06801752, 0x30000001 },
+ { 0x33801760, 0x1c00000c },
+ { 0x3380176e, 0x1c000002 },
+ { 0x33801772, 0x30000001 },
+ { 0x1f801780, 0x1c000033 },
+ { 0x1f8017b4, 0x04000001 },
+ { 0x1f0017b6, 0x28000000 },
+ { 0x1f8017b7, 0x30000006 },
+ { 0x1f8017be, 0x28000007 },
+ { 0x1f0017c6, 0x30000000 },
+ { 0x1f8017c7, 0x28000001 },
+ { 0x1f8017c9, 0x3000000a },
+ { 0x1f8017d4, 0x54000002 },
+ { 0x1f0017d7, 0x18000000 },
+ { 0x1f8017d8, 0x54000002 },
+ { 0x1f0017db, 0x5c000000 },
+ { 0x1f0017dc, 0x1c000000 },
+ { 0x1f0017dd, 0x30000000 },
+ { 0x1f8017e0, 0x34000009 },
+ { 0x1f8017f0, 0x3c000009 },
+ { 0x25801800, 0x54000005 },
+ { 0x25001806, 0x44000000 },
+ { 0x25801807, 0x54000003 },
+ { 0x2580180b, 0x30000002 },
+ { 0x2500180e, 0x74000000 },
+ { 0x25801810, 0x34000009 },
+ { 0x25801820, 0x1c000022 },
+ { 0x25001843, 0x18000000 },
+ { 0x25801844, 0x1c000033 },
+ { 0x25801880, 0x1c000028 },
+ { 0x250018a9, 0x30000000 },
+ { 0x22801900, 0x1c00001c },
+ { 0x22801920, 0x30000002 },
+ { 0x22801923, 0x28000003 },
+ { 0x22801927, 0x30000001 },
+ { 0x22801929, 0x28000002 },
+ { 0x22801930, 0x28000001 },
+ { 0x22001932, 0x30000000 },
+ { 0x22801933, 0x28000005 },
+ { 0x22801939, 0x30000002 },
+ { 0x22001940, 0x68000000 },
+ { 0x22801944, 0x54000001 },
+ { 0x22801946, 0x34000009 },
+ { 0x34801950, 0x1c00001d },
+ { 0x34801970, 0x1c000004 },
+ { 0x27801980, 0x1c000029 },
+ { 0x278019b0, 0x28000010 },
+ { 0x278019c1, 0x1c000006 },
+ { 0x278019c8, 0x28000001 },
+ { 0x278019d0, 0x34000009 },
+ { 0x278019de, 0x54000001 },
+ { 0x1f8019e0, 0x6800001f },
+ { 0x05801a00, 0x1c000016 },
+ { 0x05801a17, 0x30000001 },
+ { 0x05801a19, 0x28000002 },
+ { 0x05801a1e, 0x54000001 },
+ { 0x3d801b00, 0x30000003 },
+ { 0x3d001b04, 0x28000000 },
+ { 0x3d801b05, 0x1c00002e },
+ { 0x3d001b34, 0x30000000 },
+ { 0x3d001b35, 0x28000000 },
+ { 0x3d801b36, 0x30000004 },
+ { 0x3d001b3b, 0x28000000 },
+ { 0x3d001b3c, 0x30000000 },
+ { 0x3d801b3d, 0x28000004 },
+ { 0x3d001b42, 0x30000000 },
+ { 0x3d801b43, 0x28000001 },
+ { 0x3d801b45, 0x1c000006 },
+ { 0x3d801b50, 0x34000009 },
+ { 0x3d801b5a, 0x54000006 },
+ { 0x3d801b61, 0x68000009 },
+ { 0x3d801b6b, 0x30000008 },
+ { 0x3d801b74, 0x68000008 },
+ { 0x21801d00, 0x1400002b },
+ { 0x21801d2c, 0x18000035 },
+ { 0x21801d62, 0x14000015 },
+ { 0x0c001d78, 0x18000000 },
+ { 0x21801d79, 0x14000003 },
+ { 0x21001d7d, 0x14000ee6 },
+ { 0x21801d7e, 0x1400001c },
+ { 0x21801d9b, 0x18000024 },
+ { 0x1b801dc0, 0x3000000a },
+ { 0x1b801dfe, 0x30000001 },
+ { 0x21001e00, 0x24000001 },
+ { 0x21001e01, 0x1400ffff },
+ { 0x21001e02, 0x24000001 },
+ { 0x21001e03, 0x1400ffff },
+ { 0x21001e04, 0x24000001 },
+ { 0x21001e05, 0x1400ffff },
+ { 0x21001e06, 0x24000001 },
+ { 0x21001e07, 0x1400ffff },
+ { 0x21001e08, 0x24000001 },
+ { 0x21001e09, 0x1400ffff },
+ { 0x21001e0a, 0x24000001 },
+ { 0x21001e0b, 0x1400ffff },
+ { 0x21001e0c, 0x24000001 },
+ { 0x21001e0d, 0x1400ffff },
+ { 0x21001e0e, 0x24000001 },
+ { 0x21001e0f, 0x1400ffff },
+ { 0x21001e10, 0x24000001 },
+ { 0x21001e11, 0x1400ffff },
+ { 0x21001e12, 0x24000001 },
+ { 0x21001e13, 0x1400ffff },
+ { 0x21001e14, 0x24000001 },
+ { 0x21001e15, 0x1400ffff },
+ { 0x21001e16, 0x24000001 },
+ { 0x21001e17, 0x1400ffff },
+ { 0x21001e18, 0x24000001 },
+ { 0x21001e19, 0x1400ffff },
+ { 0x21001e1a, 0x24000001 },
+ { 0x21001e1b, 0x1400ffff },
+ { 0x21001e1c, 0x24000001 },
+ { 0x21001e1d, 0x1400ffff },
+ { 0x21001e1e, 0x24000001 },
+ { 0x21001e1f, 0x1400ffff },
+ { 0x21001e20, 0x24000001 },
+ { 0x21001e21, 0x1400ffff },
+ { 0x21001e22, 0x24000001 },
+ { 0x21001e23, 0x1400ffff },
+ { 0x21001e24, 0x24000001 },
+ { 0x21001e25, 0x1400ffff },
+ { 0x21001e26, 0x24000001 },
+ { 0x21001e27, 0x1400ffff },
+ { 0x21001e28, 0x24000001 },
+ { 0x21001e29, 0x1400ffff },
+ { 0x21001e2a, 0x24000001 },
+ { 0x21001e2b, 0x1400ffff },
+ { 0x21001e2c, 0x24000001 },
+ { 0x21001e2d, 0x1400ffff },
+ { 0x21001e2e, 0x24000001 },
+ { 0x21001e2f, 0x1400ffff },
+ { 0x21001e30, 0x24000001 },
+ { 0x21001e31, 0x1400ffff },
+ { 0x21001e32, 0x24000001 },
+ { 0x21001e33, 0x1400ffff },
+ { 0x21001e34, 0x24000001 },
+ { 0x21001e35, 0x1400ffff },
+ { 0x21001e36, 0x24000001 },
+ { 0x21001e37, 0x1400ffff },
+ { 0x21001e38, 0x24000001 },
+ { 0x21001e39, 0x1400ffff },
+ { 0x21001e3a, 0x24000001 },
+ { 0x21001e3b, 0x1400ffff },
+ { 0x21001e3c, 0x24000001 },
+ { 0x21001e3d, 0x1400ffff },
+ { 0x21001e3e, 0x24000001 },
+ { 0x21001e3f, 0x1400ffff },
+ { 0x21001e40, 0x24000001 },
+ { 0x21001e41, 0x1400ffff },
+ { 0x21001e42, 0x24000001 },
+ { 0x21001e43, 0x1400ffff },
+ { 0x21001e44, 0x24000001 },
+ { 0x21001e45, 0x1400ffff },
+ { 0x21001e46, 0x24000001 },
+ { 0x21001e47, 0x1400ffff },
+ { 0x21001e48, 0x24000001 },
+ { 0x21001e49, 0x1400ffff },
+ { 0x21001e4a, 0x24000001 },
+ { 0x21001e4b, 0x1400ffff },
+ { 0x21001e4c, 0x24000001 },
+ { 0x21001e4d, 0x1400ffff },
+ { 0x21001e4e, 0x24000001 },
+ { 0x21001e4f, 0x1400ffff },
+ { 0x21001e50, 0x24000001 },
+ { 0x21001e51, 0x1400ffff },
+ { 0x21001e52, 0x24000001 },
+ { 0x21001e53, 0x1400ffff },
+ { 0x21001e54, 0x24000001 },
+ { 0x21001e55, 0x1400ffff },
+ { 0x21001e56, 0x24000001 },
+ { 0x21001e57, 0x1400ffff },
+ { 0x21001e58, 0x24000001 },
+ { 0x21001e59, 0x1400ffff },
+ { 0x21001e5a, 0x24000001 },
+ { 0x21001e5b, 0x1400ffff },
+ { 0x21001e5c, 0x24000001 },
+ { 0x21001e5d, 0x1400ffff },
+ { 0x21001e5e, 0x24000001 },
+ { 0x21001e5f, 0x1400ffff },
+ { 0x21001e60, 0x24000001 },
+ { 0x21001e61, 0x1400ffff },
+ { 0x21001e62, 0x24000001 },
+ { 0x21001e63, 0x1400ffff },
+ { 0x21001e64, 0x24000001 },
+ { 0x21001e65, 0x1400ffff },
+ { 0x21001e66, 0x24000001 },
+ { 0x21001e67, 0x1400ffff },
+ { 0x21001e68, 0x24000001 },
+ { 0x21001e69, 0x1400ffff },
+ { 0x21001e6a, 0x24000001 },
+ { 0x21001e6b, 0x1400ffff },
+ { 0x21001e6c, 0x24000001 },
+ { 0x21001e6d, 0x1400ffff },
+ { 0x21001e6e, 0x24000001 },
+ { 0x21001e6f, 0x1400ffff },
+ { 0x21001e70, 0x24000001 },
+ { 0x21001e71, 0x1400ffff },
+ { 0x21001e72, 0x24000001 },
+ { 0x21001e73, 0x1400ffff },
+ { 0x21001e74, 0x24000001 },
+ { 0x21001e75, 0x1400ffff },
+ { 0x21001e76, 0x24000001 },
+ { 0x21001e77, 0x1400ffff },
+ { 0x21001e78, 0x24000001 },
+ { 0x21001e79, 0x1400ffff },
+ { 0x21001e7a, 0x24000001 },
+ { 0x21001e7b, 0x1400ffff },
+ { 0x21001e7c, 0x24000001 },
+ { 0x21001e7d, 0x1400ffff },
+ { 0x21001e7e, 0x24000001 },
+ { 0x21001e7f, 0x1400ffff },
+ { 0x21001e80, 0x24000001 },
+ { 0x21001e81, 0x1400ffff },
+ { 0x21001e82, 0x24000001 },
+ { 0x21001e83, 0x1400ffff },
+ { 0x21001e84, 0x24000001 },
+ { 0x21001e85, 0x1400ffff },
+ { 0x21001e86, 0x24000001 },
+ { 0x21001e87, 0x1400ffff },
+ { 0x21001e88, 0x24000001 },
+ { 0x21001e89, 0x1400ffff },
+ { 0x21001e8a, 0x24000001 },
+ { 0x21001e8b, 0x1400ffff },
+ { 0x21001e8c, 0x24000001 },
+ { 0x21001e8d, 0x1400ffff },
+ { 0x21001e8e, 0x24000001 },
+ { 0x21001e8f, 0x1400ffff },
+ { 0x21001e90, 0x24000001 },
+ { 0x21001e91, 0x1400ffff },
+ { 0x21001e92, 0x24000001 },
+ { 0x21001e93, 0x1400ffff },
+ { 0x21001e94, 0x24000001 },
+ { 0x21001e95, 0x1400ffff },
+ { 0x21801e96, 0x14000004 },
+ { 0x21001e9b, 0x1400ffc5 },
+ { 0x21001ea0, 0x24000001 },
+ { 0x21001ea1, 0x1400ffff },
+ { 0x21001ea2, 0x24000001 },
+ { 0x21001ea3, 0x1400ffff },
+ { 0x21001ea4, 0x24000001 },
+ { 0x21001ea5, 0x1400ffff },
+ { 0x21001ea6, 0x24000001 },
+ { 0x21001ea7, 0x1400ffff },
+ { 0x21001ea8, 0x24000001 },
+ { 0x21001ea9, 0x1400ffff },
+ { 0x21001eaa, 0x24000001 },
+ { 0x21001eab, 0x1400ffff },
+ { 0x21001eac, 0x24000001 },
+ { 0x21001ead, 0x1400ffff },
+ { 0x21001eae, 0x24000001 },
+ { 0x21001eaf, 0x1400ffff },
+ { 0x21001eb0, 0x24000001 },
+ { 0x21001eb1, 0x1400ffff },
+ { 0x21001eb2, 0x24000001 },
+ { 0x21001eb3, 0x1400ffff },
+ { 0x21001eb4, 0x24000001 },
+ { 0x21001eb5, 0x1400ffff },
+ { 0x21001eb6, 0x24000001 },
+ { 0x21001eb7, 0x1400ffff },
+ { 0x21001eb8, 0x24000001 },
+ { 0x21001eb9, 0x1400ffff },
+ { 0x21001eba, 0x24000001 },
+ { 0x21001ebb, 0x1400ffff },
+ { 0x21001ebc, 0x24000001 },
+ { 0x21001ebd, 0x1400ffff },
+ { 0x21001ebe, 0x24000001 },
+ { 0x21001ebf, 0x1400ffff },
+ { 0x21001ec0, 0x24000001 },
+ { 0x21001ec1, 0x1400ffff },
+ { 0x21001ec2, 0x24000001 },
+ { 0x21001ec3, 0x1400ffff },
+ { 0x21001ec4, 0x24000001 },
+ { 0x21001ec5, 0x1400ffff },
+ { 0x21001ec6, 0x24000001 },
+ { 0x21001ec7, 0x1400ffff },
+ { 0x21001ec8, 0x24000001 },
+ { 0x21001ec9, 0x1400ffff },
+ { 0x21001eca, 0x24000001 },
+ { 0x21001ecb, 0x1400ffff },
+ { 0x21001ecc, 0x24000001 },
+ { 0x21001ecd, 0x1400ffff },
+ { 0x21001ece, 0x24000001 },
+ { 0x21001ecf, 0x1400ffff },
+ { 0x21001ed0, 0x24000001 },
+ { 0x21001ed1, 0x1400ffff },
+ { 0x21001ed2, 0x24000001 },
+ { 0x21001ed3, 0x1400ffff },
+ { 0x21001ed4, 0x24000001 },
+ { 0x21001ed5, 0x1400ffff },
+ { 0x21001ed6, 0x24000001 },
+ { 0x21001ed7, 0x1400ffff },
+ { 0x21001ed8, 0x24000001 },
+ { 0x21001ed9, 0x1400ffff },
+ { 0x21001eda, 0x24000001 },
+ { 0x21001edb, 0x1400ffff },
+ { 0x21001edc, 0x24000001 },
+ { 0x21001edd, 0x1400ffff },
+ { 0x21001ede, 0x24000001 },
+ { 0x21001edf, 0x1400ffff },
+ { 0x21001ee0, 0x24000001 },
+ { 0x21001ee1, 0x1400ffff },
+ { 0x21001ee2, 0x24000001 },
+ { 0x21001ee3, 0x1400ffff },
+ { 0x21001ee4, 0x24000001 },
+ { 0x21001ee5, 0x1400ffff },
+ { 0x21001ee6, 0x24000001 },
+ { 0x21001ee7, 0x1400ffff },
+ { 0x21001ee8, 0x24000001 },
+ { 0x21001ee9, 0x1400ffff },
+ { 0x21001eea, 0x24000001 },
+ { 0x21001eeb, 0x1400ffff },
+ { 0x21001eec, 0x24000001 },
+ { 0x21001eed, 0x1400ffff },
+ { 0x21001eee, 0x24000001 },
+ { 0x21001eef, 0x1400ffff },
+ { 0x21001ef0, 0x24000001 },
+ { 0x21001ef1, 0x1400ffff },
+ { 0x21001ef2, 0x24000001 },
+ { 0x21001ef3, 0x1400ffff },
+ { 0x21001ef4, 0x24000001 },
+ { 0x21001ef5, 0x1400ffff },
+ { 0x21001ef6, 0x24000001 },
+ { 0x21001ef7, 0x1400ffff },
+ { 0x21001ef8, 0x24000001 },
+ { 0x21001ef9, 0x1400ffff },
+ { 0x13001f00, 0x14000008 },
+ { 0x13001f01, 0x14000008 },
+ { 0x13001f02, 0x14000008 },
+ { 0x13001f03, 0x14000008 },
+ { 0x13001f04, 0x14000008 },
+ { 0x13001f05, 0x14000008 },
+ { 0x13001f06, 0x14000008 },
+ { 0x13001f07, 0x14000008 },
+ { 0x13001f08, 0x2400fff8 },
+ { 0x13001f09, 0x2400fff8 },
+ { 0x13001f0a, 0x2400fff8 },
+ { 0x13001f0b, 0x2400fff8 },
+ { 0x13001f0c, 0x2400fff8 },
+ { 0x13001f0d, 0x2400fff8 },
+ { 0x13001f0e, 0x2400fff8 },
+ { 0x13001f0f, 0x2400fff8 },
+ { 0x13001f10, 0x14000008 },
+ { 0x13001f11, 0x14000008 },
+ { 0x13001f12, 0x14000008 },
+ { 0x13001f13, 0x14000008 },
+ { 0x13001f14, 0x14000008 },
+ { 0x13001f15, 0x14000008 },
+ { 0x13001f18, 0x2400fff8 },
+ { 0x13001f19, 0x2400fff8 },
+ { 0x13001f1a, 0x2400fff8 },
+ { 0x13001f1b, 0x2400fff8 },
+ { 0x13001f1c, 0x2400fff8 },
+ { 0x13001f1d, 0x2400fff8 },
+ { 0x13001f20, 0x14000008 },
+ { 0x13001f21, 0x14000008 },
+ { 0x13001f22, 0x14000008 },
+ { 0x13001f23, 0x14000008 },
+ { 0x13001f24, 0x14000008 },
+ { 0x13001f25, 0x14000008 },
+ { 0x13001f26, 0x14000008 },
+ { 0x13001f27, 0x14000008 },
+ { 0x13001f28, 0x2400fff8 },
+ { 0x13001f29, 0x2400fff8 },
+ { 0x13001f2a, 0x2400fff8 },
+ { 0x13001f2b, 0x2400fff8 },
+ { 0x13001f2c, 0x2400fff8 },
+ { 0x13001f2d, 0x2400fff8 },
+ { 0x13001f2e, 0x2400fff8 },
+ { 0x13001f2f, 0x2400fff8 },
+ { 0x13001f30, 0x14000008 },
+ { 0x13001f31, 0x14000008 },
+ { 0x13001f32, 0x14000008 },
+ { 0x13001f33, 0x14000008 },
+ { 0x13001f34, 0x14000008 },
+ { 0x13001f35, 0x14000008 },
+ { 0x13001f36, 0x14000008 },
+ { 0x13001f37, 0x14000008 },
+ { 0x13001f38, 0x2400fff8 },
+ { 0x13001f39, 0x2400fff8 },
+ { 0x13001f3a, 0x2400fff8 },
+ { 0x13001f3b, 0x2400fff8 },
+ { 0x13001f3c, 0x2400fff8 },
+ { 0x13001f3d, 0x2400fff8 },
+ { 0x13001f3e, 0x2400fff8 },
+ { 0x13001f3f, 0x2400fff8 },
+ { 0x13001f40, 0x14000008 },
+ { 0x13001f41, 0x14000008 },
+ { 0x13001f42, 0x14000008 },
+ { 0x13001f43, 0x14000008 },
+ { 0x13001f44, 0x14000008 },
+ { 0x13001f45, 0x14000008 },
+ { 0x13001f48, 0x2400fff8 },
+ { 0x13001f49, 0x2400fff8 },
+ { 0x13001f4a, 0x2400fff8 },
+ { 0x13001f4b, 0x2400fff8 },
+ { 0x13001f4c, 0x2400fff8 },
+ { 0x13001f4d, 0x2400fff8 },
+ { 0x13001f50, 0x14000000 },
+ { 0x13001f51, 0x14000008 },
+ { 0x13001f52, 0x14000000 },
+ { 0x13001f53, 0x14000008 },
+ { 0x13001f54, 0x14000000 },
+ { 0x13001f55, 0x14000008 },
+ { 0x13001f56, 0x14000000 },
+ { 0x13001f57, 0x14000008 },
+ { 0x13001f59, 0x2400fff8 },
+ { 0x13001f5b, 0x2400fff8 },
+ { 0x13001f5d, 0x2400fff8 },
+ { 0x13001f5f, 0x2400fff8 },
+ { 0x13001f60, 0x14000008 },
+ { 0x13001f61, 0x14000008 },
+ { 0x13001f62, 0x14000008 },
+ { 0x13001f63, 0x14000008 },
+ { 0x13001f64, 0x14000008 },
+ { 0x13001f65, 0x14000008 },
+ { 0x13001f66, 0x14000008 },
+ { 0x13001f67, 0x14000008 },
+ { 0x13001f68, 0x2400fff8 },
+ { 0x13001f69, 0x2400fff8 },
+ { 0x13001f6a, 0x2400fff8 },
+ { 0x13001f6b, 0x2400fff8 },
+ { 0x13001f6c, 0x2400fff8 },
+ { 0x13001f6d, 0x2400fff8 },
+ { 0x13001f6e, 0x2400fff8 },
+ { 0x13001f6f, 0x2400fff8 },
+ { 0x13001f70, 0x1400004a },
+ { 0x13001f71, 0x1400004a },
+ { 0x13001f72, 0x14000056 },
+ { 0x13001f73, 0x14000056 },
+ { 0x13001f74, 0x14000056 },
+ { 0x13001f75, 0x14000056 },
+ { 0x13001f76, 0x14000064 },
+ { 0x13001f77, 0x14000064 },
+ { 0x13001f78, 0x14000080 },
+ { 0x13001f79, 0x14000080 },
+ { 0x13001f7a, 0x14000070 },
+ { 0x13001f7b, 0x14000070 },
+ { 0x13001f7c, 0x1400007e },
+ { 0x13001f7d, 0x1400007e },
+ { 0x13001f80, 0x14000008 },
+ { 0x13001f81, 0x14000008 },
+ { 0x13001f82, 0x14000008 },
+ { 0x13001f83, 0x14000008 },
+ { 0x13001f84, 0x14000008 },
+ { 0x13001f85, 0x14000008 },
+ { 0x13001f86, 0x14000008 },
+ { 0x13001f87, 0x14000008 },
+ { 0x13001f88, 0x2000fff8 },
+ { 0x13001f89, 0x2000fff8 },
+ { 0x13001f8a, 0x2000fff8 },
+ { 0x13001f8b, 0x2000fff8 },
+ { 0x13001f8c, 0x2000fff8 },
+ { 0x13001f8d, 0x2000fff8 },
+ { 0x13001f8e, 0x2000fff8 },
+ { 0x13001f8f, 0x2000fff8 },
+ { 0x13001f90, 0x14000008 },
+ { 0x13001f91, 0x14000008 },
+ { 0x13001f92, 0x14000008 },
+ { 0x13001f93, 0x14000008 },
+ { 0x13001f94, 0x14000008 },
+ { 0x13001f95, 0x14000008 },
+ { 0x13001f96, 0x14000008 },
+ { 0x13001f97, 0x14000008 },
+ { 0x13001f98, 0x2000fff8 },
+ { 0x13001f99, 0x2000fff8 },
+ { 0x13001f9a, 0x2000fff8 },
+ { 0x13001f9b, 0x2000fff8 },
+ { 0x13001f9c, 0x2000fff8 },
+ { 0x13001f9d, 0x2000fff8 },
+ { 0x13001f9e, 0x2000fff8 },
+ { 0x13001f9f, 0x2000fff8 },
+ { 0x13001fa0, 0x14000008 },
+ { 0x13001fa1, 0x14000008 },
+ { 0x13001fa2, 0x14000008 },
+ { 0x13001fa3, 0x14000008 },
+ { 0x13001fa4, 0x14000008 },
+ { 0x13001fa5, 0x14000008 },
+ { 0x13001fa6, 0x14000008 },
+ { 0x13001fa7, 0x14000008 },
+ { 0x13001fa8, 0x2000fff8 },
+ { 0x13001fa9, 0x2000fff8 },
+ { 0x13001faa, 0x2000fff8 },
+ { 0x13001fab, 0x2000fff8 },
+ { 0x13001fac, 0x2000fff8 },
+ { 0x13001fad, 0x2000fff8 },
+ { 0x13001fae, 0x2000fff8 },
+ { 0x13001faf, 0x2000fff8 },
+ { 0x13001fb0, 0x14000008 },
+ { 0x13001fb1, 0x14000008 },
+ { 0x13001fb2, 0x14000000 },
+ { 0x13001fb3, 0x14000009 },
+ { 0x13001fb4, 0x14000000 },
+ { 0x13801fb6, 0x14000001 },
+ { 0x13001fb8, 0x2400fff8 },
+ { 0x13001fb9, 0x2400fff8 },
+ { 0x13001fba, 0x2400ffb6 },
+ { 0x13001fbb, 0x2400ffb6 },
+ { 0x13001fbc, 0x2000fff7 },
+ { 0x13001fbd, 0x60000000 },
+ { 0x13001fbe, 0x1400e3db },
+ { 0x13801fbf, 0x60000002 },
+ { 0x13001fc2, 0x14000000 },
+ { 0x13001fc3, 0x14000009 },
+ { 0x13001fc4, 0x14000000 },
+ { 0x13801fc6, 0x14000001 },
+ { 0x13001fc8, 0x2400ffaa },
+ { 0x13001fc9, 0x2400ffaa },
+ { 0x13001fca, 0x2400ffaa },
+ { 0x13001fcb, 0x2400ffaa },
+ { 0x13001fcc, 0x2000fff7 },
+ { 0x13801fcd, 0x60000002 },
+ { 0x13001fd0, 0x14000008 },
+ { 0x13001fd1, 0x14000008 },
+ { 0x13801fd2, 0x14000001 },
+ { 0x13801fd6, 0x14000001 },
+ { 0x13001fd8, 0x2400fff8 },
+ { 0x13001fd9, 0x2400fff8 },
+ { 0x13001fda, 0x2400ff9c },
+ { 0x13001fdb, 0x2400ff9c },
+ { 0x13801fdd, 0x60000002 },
+ { 0x13001fe0, 0x14000008 },
+ { 0x13001fe1, 0x14000008 },
+ { 0x13801fe2, 0x14000002 },
+ { 0x13001fe5, 0x14000007 },
+ { 0x13801fe6, 0x14000001 },
+ { 0x13001fe8, 0x2400fff8 },
+ { 0x13001fe9, 0x2400fff8 },
+ { 0x13001fea, 0x2400ff90 },
+ { 0x13001feb, 0x2400ff90 },
+ { 0x13001fec, 0x2400fff9 },
+ { 0x13801fed, 0x60000002 },
+ { 0x13001ff2, 0x14000000 },
+ { 0x13001ff3, 0x14000009 },
+ { 0x13001ff4, 0x14000000 },
+ { 0x13801ff6, 0x14000001 },
+ { 0x13001ff8, 0x2400ff80 },
+ { 0x13001ff9, 0x2400ff80 },
+ { 0x13001ffa, 0x2400ff82 },
+ { 0x13001ffb, 0x2400ff82 },
+ { 0x13001ffc, 0x2000fff7 },
+ { 0x13801ffd, 0x60000001 },
+ { 0x09802000, 0x7400000a },
+ { 0x0980200b, 0x04000004 },
+ { 0x09802010, 0x44000005 },
+ { 0x09802016, 0x54000001 },
+ { 0x09002018, 0x50000000 },
+ { 0x09002019, 0x4c000000 },
+ { 0x0900201a, 0x58000000 },
+ { 0x0980201b, 0x50000001 },
+ { 0x0900201d, 0x4c000000 },
+ { 0x0900201e, 0x58000000 },
+ { 0x0900201f, 0x50000000 },
+ { 0x09802020, 0x54000007 },
+ { 0x09002028, 0x6c000000 },
+ { 0x09002029, 0x70000000 },
+ { 0x0980202a, 0x04000004 },
+ { 0x0900202f, 0x74000000 },
+ { 0x09802030, 0x54000008 },
+ { 0x09002039, 0x50000000 },
+ { 0x0900203a, 0x4c000000 },
+ { 0x0980203b, 0x54000003 },
+ { 0x0980203f, 0x40000001 },
+ { 0x09802041, 0x54000002 },
+ { 0x09002044, 0x64000000 },
+ { 0x09002045, 0x58000000 },
+ { 0x09002046, 0x48000000 },
+ { 0x09802047, 0x5400000a },
+ { 0x09002052, 0x64000000 },
+ { 0x09002053, 0x54000000 },
+ { 0x09002054, 0x40000000 },
+ { 0x09802055, 0x54000009 },
+ { 0x0900205f, 0x74000000 },
+ { 0x09802060, 0x04000003 },
+ { 0x0980206a, 0x04000005 },
+ { 0x09002070, 0x3c000000 },
+ { 0x21002071, 0x14000000 },
+ { 0x09802074, 0x3c000005 },
+ { 0x0980207a, 0x64000002 },
+ { 0x0900207d, 0x58000000 },
+ { 0x0900207e, 0x48000000 },
+ { 0x2100207f, 0x14000000 },
+ { 0x09802080, 0x3c000009 },
+ { 0x0980208a, 0x64000002 },
+ { 0x0900208d, 0x58000000 },
+ { 0x0900208e, 0x48000000 },
+ { 0x21802090, 0x18000004 },
+ { 0x098020a0, 0x5c000015 },
+ { 0x1b8020d0, 0x3000000c },
+ { 0x1b8020dd, 0x2c000003 },
+ { 0x1b0020e1, 0x30000000 },
+ { 0x1b8020e2, 0x2c000002 },
+ { 0x1b8020e5, 0x3000000a },
+ { 0x09802100, 0x68000001 },
+ { 0x09002102, 0x24000000 },
+ { 0x09802103, 0x68000003 },
+ { 0x09002107, 0x24000000 },
+ { 0x09802108, 0x68000001 },
+ { 0x0900210a, 0x14000000 },
+ { 0x0980210b, 0x24000002 },
+ { 0x0980210e, 0x14000001 },
+ { 0x09802110, 0x24000002 },
+ { 0x09002113, 0x14000000 },
+ { 0x09002114, 0x68000000 },
+ { 0x09002115, 0x24000000 },
+ { 0x09802116, 0x68000002 },
+ { 0x09802119, 0x24000004 },
+ { 0x0980211e, 0x68000005 },
+ { 0x09002124, 0x24000000 },
+ { 0x09002125, 0x68000000 },
+ { 0x13002126, 0x2400e2a3 },
+ { 0x09002127, 0x68000000 },
+ { 0x09002128, 0x24000000 },
+ { 0x09002129, 0x68000000 },
+ { 0x2100212a, 0x2400df41 },
+ { 0x2100212b, 0x2400dfba },
+ { 0x0980212c, 0x24000001 },
+ { 0x0900212e, 0x68000000 },
+ { 0x0900212f, 0x14000000 },
+ { 0x09802130, 0x24000001 },
+ { 0x21002132, 0x2400001c },
+ { 0x09002133, 0x24000000 },
+ { 0x09002134, 0x14000000 },
+ { 0x09802135, 0x1c000003 },
+ { 0x09002139, 0x14000000 },
+ { 0x0980213a, 0x68000001 },
+ { 0x0980213c, 0x14000001 },
+ { 0x0980213e, 0x24000001 },
+ { 0x09802140, 0x64000004 },
+ { 0x09002145, 0x24000000 },
+ { 0x09802146, 0x14000003 },
+ { 0x0900214a, 0x68000000 },
+ { 0x0900214b, 0x64000000 },
+ { 0x0980214c, 0x68000001 },
+ { 0x2100214e, 0x1400ffe4 },
+ { 0x09802153, 0x3c00000c },
+ { 0x09002160, 0x38000010 },
+ { 0x09002161, 0x38000010 },
+ { 0x09002162, 0x38000010 },
+ { 0x09002163, 0x38000010 },
+ { 0x09002164, 0x38000010 },
+ { 0x09002165, 0x38000010 },
+ { 0x09002166, 0x38000010 },
+ { 0x09002167, 0x38000010 },
+ { 0x09002168, 0x38000010 },
+ { 0x09002169, 0x38000010 },
+ { 0x0900216a, 0x38000010 },
+ { 0x0900216b, 0x38000010 },
+ { 0x0900216c, 0x38000010 },
+ { 0x0900216d, 0x38000010 },
+ { 0x0900216e, 0x38000010 },
+ { 0x0900216f, 0x38000010 },
+ { 0x09002170, 0x3800fff0 },
+ { 0x09002171, 0x3800fff0 },
+ { 0x09002172, 0x3800fff0 },
+ { 0x09002173, 0x3800fff0 },
+ { 0x09002174, 0x3800fff0 },
+ { 0x09002175, 0x3800fff0 },
+ { 0x09002176, 0x3800fff0 },
+ { 0x09002177, 0x3800fff0 },
+ { 0x09002178, 0x3800fff0 },
+ { 0x09002179, 0x3800fff0 },
+ { 0x0900217a, 0x3800fff0 },
+ { 0x0900217b, 0x3800fff0 },
+ { 0x0900217c, 0x3800fff0 },
+ { 0x0900217d, 0x3800fff0 },
+ { 0x0900217e, 0x3800fff0 },
+ { 0x0900217f, 0x3800fff0 },
+ { 0x09802180, 0x38000002 },
+ { 0x09002183, 0x24000001 },
+ { 0x21002184, 0x1400ffff },
+ { 0x09802190, 0x64000004 },
+ { 0x09802195, 0x68000004 },
+ { 0x0980219a, 0x64000001 },
+ { 0x0980219c, 0x68000003 },
+ { 0x090021a0, 0x64000000 },
+ { 0x098021a1, 0x68000001 },
+ { 0x090021a3, 0x64000000 },
+ { 0x098021a4, 0x68000001 },
+ { 0x090021a6, 0x64000000 },
+ { 0x098021a7, 0x68000006 },
+ { 0x090021ae, 0x64000000 },
+ { 0x098021af, 0x6800001e },
+ { 0x098021ce, 0x64000001 },
+ { 0x098021d0, 0x68000001 },
+ { 0x090021d2, 0x64000000 },
+ { 0x090021d3, 0x68000000 },
+ { 0x090021d4, 0x64000000 },
+ { 0x098021d5, 0x6800001e },
+ { 0x098021f4, 0x6400010b },
+ { 0x09802300, 0x68000007 },
+ { 0x09802308, 0x64000003 },
+ { 0x0980230c, 0x68000013 },
+ { 0x09802320, 0x64000001 },
+ { 0x09802322, 0x68000006 },
+ { 0x09002329, 0x58000000 },
+ { 0x0900232a, 0x48000000 },
+ { 0x0980232b, 0x68000050 },
+ { 0x0900237c, 0x64000000 },
+ { 0x0980237d, 0x6800001d },
+ { 0x0980239b, 0x64000018 },
+ { 0x098023b4, 0x68000027 },
+ { 0x098023dc, 0x64000005 },
+ { 0x098023e2, 0x68000005 },
+ { 0x09802400, 0x68000026 },
+ { 0x09802440, 0x6800000a },
+ { 0x09802460, 0x3c00003b },
+ { 0x0980249c, 0x68000019 },
+ { 0x090024b6, 0x6800001a },
+ { 0x090024b7, 0x6800001a },
+ { 0x090024b8, 0x6800001a },
+ { 0x090024b9, 0x6800001a },
+ { 0x090024ba, 0x6800001a },
+ { 0x090024bb, 0x6800001a },
+ { 0x090024bc, 0x6800001a },
+ { 0x090024bd, 0x6800001a },
+ { 0x090024be, 0x6800001a },
+ { 0x090024bf, 0x6800001a },
+ { 0x090024c0, 0x6800001a },
+ { 0x090024c1, 0x6800001a },
+ { 0x090024c2, 0x6800001a },
+ { 0x090024c3, 0x6800001a },
+ { 0x090024c4, 0x6800001a },
+ { 0x090024c5, 0x6800001a },
+ { 0x090024c6, 0x6800001a },
+ { 0x090024c7, 0x6800001a },
+ { 0x090024c8, 0x6800001a },
+ { 0x090024c9, 0x6800001a },
+ { 0x090024ca, 0x6800001a },
+ { 0x090024cb, 0x6800001a },
+ { 0x090024cc, 0x6800001a },
+ { 0x090024cd, 0x6800001a },
+ { 0x090024ce, 0x6800001a },
+ { 0x090024cf, 0x6800001a },
+ { 0x090024d0, 0x6800ffe6 },
+ { 0x090024d1, 0x6800ffe6 },
+ { 0x090024d2, 0x6800ffe6 },
+ { 0x090024d3, 0x6800ffe6 },
+ { 0x090024d4, 0x6800ffe6 },
+ { 0x090024d5, 0x6800ffe6 },
+ { 0x090024d6, 0x6800ffe6 },
+ { 0x090024d7, 0x6800ffe6 },
+ { 0x090024d8, 0x6800ffe6 },
+ { 0x090024d9, 0x6800ffe6 },
+ { 0x090024da, 0x6800ffe6 },
+ { 0x090024db, 0x6800ffe6 },
+ { 0x090024dc, 0x6800ffe6 },
+ { 0x090024dd, 0x6800ffe6 },
+ { 0x090024de, 0x6800ffe6 },
+ { 0x090024df, 0x6800ffe6 },
+ { 0x090024e0, 0x6800ffe6 },
+ { 0x090024e1, 0x6800ffe6 },
+ { 0x090024e2, 0x6800ffe6 },
+ { 0x090024e3, 0x6800ffe6 },
+ { 0x090024e4, 0x6800ffe6 },
+ { 0x090024e5, 0x6800ffe6 },
+ { 0x090024e6, 0x6800ffe6 },
+ { 0x090024e7, 0x6800ffe6 },
+ { 0x090024e8, 0x6800ffe6 },
+ { 0x090024e9, 0x6800ffe6 },
+ { 0x098024ea, 0x3c000015 },
+ { 0x09802500, 0x680000b6 },
+ { 0x090025b7, 0x64000000 },
+ { 0x098025b8, 0x68000008 },
+ { 0x090025c1, 0x64000000 },
+ { 0x098025c2, 0x68000035 },
+ { 0x098025f8, 0x64000007 },
+ { 0x09802600, 0x6800006e },
+ { 0x0900266f, 0x64000000 },
+ { 0x09802670, 0x6800002c },
+ { 0x098026a0, 0x68000012 },
+ { 0x09802701, 0x68000003 },
+ { 0x09802706, 0x68000003 },
+ { 0x0980270c, 0x6800001b },
+ { 0x09802729, 0x68000022 },
+ { 0x0900274d, 0x68000000 },
+ { 0x0980274f, 0x68000003 },
+ { 0x09002756, 0x68000000 },
+ { 0x09802758, 0x68000006 },
+ { 0x09802761, 0x68000006 },
+ { 0x09002768, 0x58000000 },
+ { 0x09002769, 0x48000000 },
+ { 0x0900276a, 0x58000000 },
+ { 0x0900276b, 0x48000000 },
+ { 0x0900276c, 0x58000000 },
+ { 0x0900276d, 0x48000000 },
+ { 0x0900276e, 0x58000000 },
+ { 0x0900276f, 0x48000000 },
+ { 0x09002770, 0x58000000 },
+ { 0x09002771, 0x48000000 },
+ { 0x09002772, 0x58000000 },
+ { 0x09002773, 0x48000000 },
+ { 0x09002774, 0x58000000 },
+ { 0x09002775, 0x48000000 },
+ { 0x09802776, 0x3c00001d },
+ { 0x09002794, 0x68000000 },
+ { 0x09802798, 0x68000017 },
+ { 0x098027b1, 0x6800000d },
+ { 0x098027c0, 0x64000004 },
+ { 0x090027c5, 0x58000000 },
+ { 0x090027c6, 0x48000000 },
+ { 0x098027c7, 0x64000003 },
+ { 0x098027d0, 0x64000015 },
+ { 0x090027e6, 0x58000000 },
+ { 0x090027e7, 0x48000000 },
+ { 0x090027e8, 0x58000000 },
+ { 0x090027e9, 0x48000000 },
+ { 0x090027ea, 0x58000000 },
+ { 0x090027eb, 0x48000000 },
+ { 0x098027f0, 0x6400000f },
+ { 0x04802800, 0x680000ff },
+ { 0x09802900, 0x64000082 },
+ { 0x09002983, 0x58000000 },
+ { 0x09002984, 0x48000000 },
+ { 0x09002985, 0x58000000 },
+ { 0x09002986, 0x48000000 },
+ { 0x09002987, 0x58000000 },
+ { 0x09002988, 0x48000000 },
+ { 0x09002989, 0x58000000 },
+ { 0x0900298a, 0x48000000 },
+ { 0x0900298b, 0x58000000 },
+ { 0x0900298c, 0x48000000 },
+ { 0x0900298d, 0x58000000 },
+ { 0x0900298e, 0x48000000 },
+ { 0x0900298f, 0x58000000 },
+ { 0x09002990, 0x48000000 },
+ { 0x09002991, 0x58000000 },
+ { 0x09002992, 0x48000000 },
+ { 0x09002993, 0x58000000 },
+ { 0x09002994, 0x48000000 },
+ { 0x09002995, 0x58000000 },
+ { 0x09002996, 0x48000000 },
+ { 0x09002997, 0x58000000 },
+ { 0x09002998, 0x48000000 },
+ { 0x09802999, 0x6400003e },
+ { 0x090029d8, 0x58000000 },
+ { 0x090029d9, 0x48000000 },
+ { 0x090029da, 0x58000000 },
+ { 0x090029db, 0x48000000 },
+ { 0x098029dc, 0x6400001f },
+ { 0x090029fc, 0x58000000 },
+ { 0x090029fd, 0x48000000 },
+ { 0x098029fe, 0x64000101 },
+ { 0x09802b00, 0x6800001a },
+ { 0x09802b20, 0x68000003 },
+ { 0x11002c00, 0x24000030 },
+ { 0x11002c01, 0x24000030 },
+ { 0x11002c02, 0x24000030 },
+ { 0x11002c03, 0x24000030 },
+ { 0x11002c04, 0x24000030 },
+ { 0x11002c05, 0x24000030 },
+ { 0x11002c06, 0x24000030 },
+ { 0x11002c07, 0x24000030 },
+ { 0x11002c08, 0x24000030 },
+ { 0x11002c09, 0x24000030 },
+ { 0x11002c0a, 0x24000030 },
+ { 0x11002c0b, 0x24000030 },
+ { 0x11002c0c, 0x24000030 },
+ { 0x11002c0d, 0x24000030 },
+ { 0x11002c0e, 0x24000030 },
+ { 0x11002c0f, 0x24000030 },
+ { 0x11002c10, 0x24000030 },
+ { 0x11002c11, 0x24000030 },
+ { 0x11002c12, 0x24000030 },
+ { 0x11002c13, 0x24000030 },
+ { 0x11002c14, 0x24000030 },
+ { 0x11002c15, 0x24000030 },
+ { 0x11002c16, 0x24000030 },
+ { 0x11002c17, 0x24000030 },
+ { 0x11002c18, 0x24000030 },
+ { 0x11002c19, 0x24000030 },
+ { 0x11002c1a, 0x24000030 },
+ { 0x11002c1b, 0x24000030 },
+ { 0x11002c1c, 0x24000030 },
+ { 0x11002c1d, 0x24000030 },
+ { 0x11002c1e, 0x24000030 },
+ { 0x11002c1f, 0x24000030 },
+ { 0x11002c20, 0x24000030 },
+ { 0x11002c21, 0x24000030 },
+ { 0x11002c22, 0x24000030 },
+ { 0x11002c23, 0x24000030 },
+ { 0x11002c24, 0x24000030 },
+ { 0x11002c25, 0x24000030 },
+ { 0x11002c26, 0x24000030 },
+ { 0x11002c27, 0x24000030 },
+ { 0x11002c28, 0x24000030 },
+ { 0x11002c29, 0x24000030 },
+ { 0x11002c2a, 0x24000030 },
+ { 0x11002c2b, 0x24000030 },
+ { 0x11002c2c, 0x24000030 },
+ { 0x11002c2d, 0x24000030 },
+ { 0x11002c2e, 0x24000030 },
+ { 0x11002c30, 0x1400ffd0 },
+ { 0x11002c31, 0x1400ffd0 },
+ { 0x11002c32, 0x1400ffd0 },
+ { 0x11002c33, 0x1400ffd0 },
+ { 0x11002c34, 0x1400ffd0 },
+ { 0x11002c35, 0x1400ffd0 },
+ { 0x11002c36, 0x1400ffd0 },
+ { 0x11002c37, 0x1400ffd0 },
+ { 0x11002c38, 0x1400ffd0 },
+ { 0x11002c39, 0x1400ffd0 },
+ { 0x11002c3a, 0x1400ffd0 },
+ { 0x11002c3b, 0x1400ffd0 },
+ { 0x11002c3c, 0x1400ffd0 },
+ { 0x11002c3d, 0x1400ffd0 },
+ { 0x11002c3e, 0x1400ffd0 },
+ { 0x11002c3f, 0x1400ffd0 },
+ { 0x11002c40, 0x1400ffd0 },
+ { 0x11002c41, 0x1400ffd0 },
+ { 0x11002c42, 0x1400ffd0 },
+ { 0x11002c43, 0x1400ffd0 },
+ { 0x11002c44, 0x1400ffd0 },
+ { 0x11002c45, 0x1400ffd0 },
+ { 0x11002c46, 0x1400ffd0 },
+ { 0x11002c47, 0x1400ffd0 },
+ { 0x11002c48, 0x1400ffd0 },
+ { 0x11002c49, 0x1400ffd0 },
+ { 0x11002c4a, 0x1400ffd0 },
+ { 0x11002c4b, 0x1400ffd0 },
+ { 0x11002c4c, 0x1400ffd0 },
+ { 0x11002c4d, 0x1400ffd0 },
+ { 0x11002c4e, 0x1400ffd0 },
+ { 0x11002c4f, 0x1400ffd0 },
+ { 0x11002c50, 0x1400ffd0 },
+ { 0x11002c51, 0x1400ffd0 },
+ { 0x11002c52, 0x1400ffd0 },
+ { 0x11002c53, 0x1400ffd0 },
+ { 0x11002c54, 0x1400ffd0 },
+ { 0x11002c55, 0x1400ffd0 },
+ { 0x11002c56, 0x1400ffd0 },
+ { 0x11002c57, 0x1400ffd0 },
+ { 0x11002c58, 0x1400ffd0 },
+ { 0x11002c59, 0x1400ffd0 },
+ { 0x11002c5a, 0x1400ffd0 },
+ { 0x11002c5b, 0x1400ffd0 },
+ { 0x11002c5c, 0x1400ffd0 },
+ { 0x11002c5d, 0x1400ffd0 },
+ { 0x11002c5e, 0x1400ffd0 },
+ { 0x21002c60, 0x24000001 },
+ { 0x21002c61, 0x1400ffff },
+ { 0x21002c62, 0x2400d609 },
+ { 0x21002c63, 0x2400f11a },
+ { 0x21002c64, 0x2400d619 },
+ { 0x21002c65, 0x1400d5d5 },
+ { 0x21002c66, 0x1400d5d8 },
+ { 0x21002c67, 0x24000001 },
+ { 0x21002c68, 0x1400ffff },
+ { 0x21002c69, 0x24000001 },
+ { 0x21002c6a, 0x1400ffff },
+ { 0x21002c6b, 0x24000001 },
+ { 0x21002c6c, 0x1400ffff },
+ { 0x21002c74, 0x14000000 },
+ { 0x21002c75, 0x24000001 },
+ { 0x21002c76, 0x1400ffff },
+ { 0x21002c77, 0x14000000 },
+ { 0x0a002c80, 0x24000001 },
+ { 0x0a002c81, 0x1400ffff },
+ { 0x0a002c82, 0x24000001 },
+ { 0x0a002c83, 0x1400ffff },
+ { 0x0a002c84, 0x24000001 },
+ { 0x0a002c85, 0x1400ffff },
+ { 0x0a002c86, 0x24000001 },
+ { 0x0a002c87, 0x1400ffff },
+ { 0x0a002c88, 0x24000001 },
+ { 0x0a002c89, 0x1400ffff },
+ { 0x0a002c8a, 0x24000001 },
+ { 0x0a002c8b, 0x1400ffff },
+ { 0x0a002c8c, 0x24000001 },
+ { 0x0a002c8d, 0x1400ffff },
+ { 0x0a002c8e, 0x24000001 },
+ { 0x0a002c8f, 0x1400ffff },
+ { 0x0a002c90, 0x24000001 },
+ { 0x0a002c91, 0x1400ffff },
+ { 0x0a002c92, 0x24000001 },
+ { 0x0a002c93, 0x1400ffff },
+ { 0x0a002c94, 0x24000001 },
+ { 0x0a002c95, 0x1400ffff },
+ { 0x0a002c96, 0x24000001 },
+ { 0x0a002c97, 0x1400ffff },
+ { 0x0a002c98, 0x24000001 },
+ { 0x0a002c99, 0x1400ffff },
+ { 0x0a002c9a, 0x24000001 },
+ { 0x0a002c9b, 0x1400ffff },
+ { 0x0a002c9c, 0x24000001 },
+ { 0x0a002c9d, 0x1400ffff },
+ { 0x0a002c9e, 0x24000001 },
+ { 0x0a002c9f, 0x1400ffff },
+ { 0x0a002ca0, 0x24000001 },
+ { 0x0a002ca1, 0x1400ffff },
+ { 0x0a002ca2, 0x24000001 },
+ { 0x0a002ca3, 0x1400ffff },
+ { 0x0a002ca4, 0x24000001 },
+ { 0x0a002ca5, 0x1400ffff },
+ { 0x0a002ca6, 0x24000001 },
+ { 0x0a002ca7, 0x1400ffff },
+ { 0x0a002ca8, 0x24000001 },
+ { 0x0a002ca9, 0x1400ffff },
+ { 0x0a002caa, 0x24000001 },
+ { 0x0a002cab, 0x1400ffff },
+ { 0x0a002cac, 0x24000001 },
+ { 0x0a002cad, 0x1400ffff },
+ { 0x0a002cae, 0x24000001 },
+ { 0x0a002caf, 0x1400ffff },
+ { 0x0a002cb0, 0x24000001 },
+ { 0x0a002cb1, 0x1400ffff },
+ { 0x0a002cb2, 0x24000001 },
+ { 0x0a002cb3, 0x1400ffff },
+ { 0x0a002cb4, 0x24000001 },
+ { 0x0a002cb5, 0x1400ffff },
+ { 0x0a002cb6, 0x24000001 },
+ { 0x0a002cb7, 0x1400ffff },
+ { 0x0a002cb8, 0x24000001 },
+ { 0x0a002cb9, 0x1400ffff },
+ { 0x0a002cba, 0x24000001 },
+ { 0x0a002cbb, 0x1400ffff },
+ { 0x0a002cbc, 0x24000001 },
+ { 0x0a002cbd, 0x1400ffff },
+ { 0x0a002cbe, 0x24000001 },
+ { 0x0a002cbf, 0x1400ffff },
+ { 0x0a002cc0, 0x24000001 },
+ { 0x0a002cc1, 0x1400ffff },
+ { 0x0a002cc2, 0x24000001 },
+ { 0x0a002cc3, 0x1400ffff },
+ { 0x0a002cc4, 0x24000001 },
+ { 0x0a002cc5, 0x1400ffff },
+ { 0x0a002cc6, 0x24000001 },
+ { 0x0a002cc7, 0x1400ffff },
+ { 0x0a002cc8, 0x24000001 },
+ { 0x0a002cc9, 0x1400ffff },
+ { 0x0a002cca, 0x24000001 },
+ { 0x0a002ccb, 0x1400ffff },
+ { 0x0a002ccc, 0x24000001 },
+ { 0x0a002ccd, 0x1400ffff },
+ { 0x0a002cce, 0x24000001 },
+ { 0x0a002ccf, 0x1400ffff },
+ { 0x0a002cd0, 0x24000001 },
+ { 0x0a002cd1, 0x1400ffff },
+ { 0x0a002cd2, 0x24000001 },
+ { 0x0a002cd3, 0x1400ffff },
+ { 0x0a002cd4, 0x24000001 },
+ { 0x0a002cd5, 0x1400ffff },
+ { 0x0a002cd6, 0x24000001 },
+ { 0x0a002cd7, 0x1400ffff },
+ { 0x0a002cd8, 0x24000001 },
+ { 0x0a002cd9, 0x1400ffff },
+ { 0x0a002cda, 0x24000001 },
+ { 0x0a002cdb, 0x1400ffff },
+ { 0x0a002cdc, 0x24000001 },
+ { 0x0a002cdd, 0x1400ffff },
+ { 0x0a002cde, 0x24000001 },
+ { 0x0a002cdf, 0x1400ffff },
+ { 0x0a002ce0, 0x24000001 },
+ { 0x0a002ce1, 0x1400ffff },
+ { 0x0a002ce2, 0x24000001 },
+ { 0x0a002ce3, 0x1400ffff },
+ { 0x0a002ce4, 0x14000000 },
+ { 0x0a802ce5, 0x68000005 },
+ { 0x0a802cf9, 0x54000003 },
+ { 0x0a002cfd, 0x3c000000 },
+ { 0x0a802cfe, 0x54000001 },
+ { 0x10002d00, 0x1400e3a0 },
+ { 0x10002d01, 0x1400e3a0 },
+ { 0x10002d02, 0x1400e3a0 },
+ { 0x10002d03, 0x1400e3a0 },
+ { 0x10002d04, 0x1400e3a0 },
+ { 0x10002d05, 0x1400e3a0 },
+ { 0x10002d06, 0x1400e3a0 },
+ { 0x10002d07, 0x1400e3a0 },
+ { 0x10002d08, 0x1400e3a0 },
+ { 0x10002d09, 0x1400e3a0 },
+ { 0x10002d0a, 0x1400e3a0 },
+ { 0x10002d0b, 0x1400e3a0 },
+ { 0x10002d0c, 0x1400e3a0 },
+ { 0x10002d0d, 0x1400e3a0 },
+ { 0x10002d0e, 0x1400e3a0 },
+ { 0x10002d0f, 0x1400e3a0 },
+ { 0x10002d10, 0x1400e3a0 },
+ { 0x10002d11, 0x1400e3a0 },
+ { 0x10002d12, 0x1400e3a0 },
+ { 0x10002d13, 0x1400e3a0 },
+ { 0x10002d14, 0x1400e3a0 },
+ { 0x10002d15, 0x1400e3a0 },
+ { 0x10002d16, 0x1400e3a0 },
+ { 0x10002d17, 0x1400e3a0 },
+ { 0x10002d18, 0x1400e3a0 },
+ { 0x10002d19, 0x1400e3a0 },
+ { 0x10002d1a, 0x1400e3a0 },
+ { 0x10002d1b, 0x1400e3a0 },
+ { 0x10002d1c, 0x1400e3a0 },
+ { 0x10002d1d, 0x1400e3a0 },
+ { 0x10002d1e, 0x1400e3a0 },
+ { 0x10002d1f, 0x1400e3a0 },
+ { 0x10002d20, 0x1400e3a0 },
+ { 0x10002d21, 0x1400e3a0 },
+ { 0x10002d22, 0x1400e3a0 },
+ { 0x10002d23, 0x1400e3a0 },
+ { 0x10002d24, 0x1400e3a0 },
+ { 0x10002d25, 0x1400e3a0 },
+ { 0x3a802d30, 0x1c000035 },
+ { 0x3a002d6f, 0x18000000 },
+ { 0x0f802d80, 0x1c000016 },
+ { 0x0f802da0, 0x1c000006 },
+ { 0x0f802da8, 0x1c000006 },
+ { 0x0f802db0, 0x1c000006 },
+ { 0x0f802db8, 0x1c000006 },
+ { 0x0f802dc0, 0x1c000006 },
+ { 0x0f802dc8, 0x1c000006 },
+ { 0x0f802dd0, 0x1c000006 },
+ { 0x0f802dd8, 0x1c000006 },
+ { 0x09802e00, 0x54000001 },
+ { 0x09002e02, 0x50000000 },
+ { 0x09002e03, 0x4c000000 },
+ { 0x09002e04, 0x50000000 },
+ { 0x09002e05, 0x4c000000 },
+ { 0x09802e06, 0x54000002 },
+ { 0x09002e09, 0x50000000 },
+ { 0x09002e0a, 0x4c000000 },
+ { 0x09002e0b, 0x54000000 },
+ { 0x09002e0c, 0x50000000 },
+ { 0x09002e0d, 0x4c000000 },
+ { 0x09802e0e, 0x54000008 },
+ { 0x09002e17, 0x44000000 },
+ { 0x09002e1c, 0x50000000 },
+ { 0x09002e1d, 0x4c000000 },
+ { 0x16802e80, 0x68000019 },
+ { 0x16802e9b, 0x68000058 },
+ { 0x16802f00, 0x680000d5 },
+ { 0x09802ff0, 0x6800000b },
+ { 0x09003000, 0x74000000 },
+ { 0x09803001, 0x54000002 },
+ { 0x09003004, 0x68000000 },
+ { 0x16003005, 0x18000000 },
+ { 0x09003006, 0x1c000000 },
+ { 0x16003007, 0x38000000 },
+ { 0x09003008, 0x58000000 },
+ { 0x09003009, 0x48000000 },
+ { 0x0900300a, 0x58000000 },
+ { 0x0900300b, 0x48000000 },
+ { 0x0900300c, 0x58000000 },
+ { 0x0900300d, 0x48000000 },
+ { 0x0900300e, 0x58000000 },
+ { 0x0900300f, 0x48000000 },
+ { 0x09003010, 0x58000000 },
+ { 0x09003011, 0x48000000 },
+ { 0x09803012, 0x68000001 },
+ { 0x09003014, 0x58000000 },
+ { 0x09003015, 0x48000000 },
+ { 0x09003016, 0x58000000 },
+ { 0x09003017, 0x48000000 },
+ { 0x09003018, 0x58000000 },
+ { 0x09003019, 0x48000000 },
+ { 0x0900301a, 0x58000000 },
+ { 0x0900301b, 0x48000000 },
+ { 0x0900301c, 0x44000000 },
+ { 0x0900301d, 0x58000000 },
+ { 0x0980301e, 0x48000001 },
+ { 0x09003020, 0x68000000 },
+ { 0x16803021, 0x38000008 },
+ { 0x1b80302a, 0x30000005 },
+ { 0x09003030, 0x44000000 },
+ { 0x09803031, 0x18000004 },
+ { 0x09803036, 0x68000001 },
+ { 0x16803038, 0x38000002 },
+ { 0x1600303b, 0x18000000 },
+ { 0x0900303c, 0x1c000000 },
+ { 0x0900303d, 0x54000000 },
+ { 0x0980303e, 0x68000001 },
+ { 0x1a803041, 0x1c000055 },
+ { 0x1b803099, 0x30000001 },
+ { 0x0980309b, 0x60000001 },
+ { 0x1a80309d, 0x18000001 },
+ { 0x1a00309f, 0x1c000000 },
+ { 0x090030a0, 0x44000000 },
+ { 0x1d8030a1, 0x1c000059 },
+ { 0x090030fb, 0x54000000 },
+ { 0x098030fc, 0x18000002 },
+ { 0x1d0030ff, 0x1c000000 },
+ { 0x03803105, 0x1c000027 },
+ { 0x17803131, 0x1c00005d },
+ { 0x09803190, 0x68000001 },
+ { 0x09803192, 0x3c000003 },
+ { 0x09803196, 0x68000009 },
+ { 0x038031a0, 0x1c000017 },
+ { 0x098031c0, 0x6800000f },
+ { 0x1d8031f0, 0x1c00000f },
+ { 0x17803200, 0x6800001e },
+ { 0x09803220, 0x3c000009 },
+ { 0x0980322a, 0x68000019 },
+ { 0x09003250, 0x68000000 },
+ { 0x09803251, 0x3c00000e },
+ { 0x17803260, 0x6800001f },
+ { 0x09803280, 0x3c000009 },
+ { 0x0980328a, 0x68000026 },
+ { 0x098032b1, 0x3c00000e },
+ { 0x098032c0, 0x6800003e },
+ { 0x09803300, 0x680000ff },
+ { 0x16803400, 0x1c0019b5 },
+ { 0x09804dc0, 0x6800003f },
+ { 0x16804e00, 0x1c0051bb },
+ { 0x3c80a000, 0x1c000014 },
+ { 0x3c00a015, 0x18000000 },
+ { 0x3c80a016, 0x1c000476 },
+ { 0x3c80a490, 0x68000036 },
+ { 0x0980a700, 0x60000016 },
+ { 0x0980a717, 0x18000003 },
+ { 0x0980a720, 0x60000001 },
+ { 0x3080a800, 0x1c000001 },
+ { 0x3000a802, 0x28000000 },
+ { 0x3080a803, 0x1c000002 },
+ { 0x3000a806, 0x30000000 },
+ { 0x3080a807, 0x1c000003 },
+ { 0x3000a80b, 0x30000000 },
+ { 0x3080a80c, 0x1c000016 },
+ { 0x3080a823, 0x28000001 },
+ { 0x3080a825, 0x30000001 },
+ { 0x3000a827, 0x28000000 },
+ { 0x3080a828, 0x68000003 },
+ { 0x4080a840, 0x1c000033 },
+ { 0x4080a874, 0x54000003 },
+ { 0x1780ac00, 0x1c002ba3 },
+ { 0x0980d800, 0x1000037f },
+ { 0x0980db80, 0x1000007f },
+ { 0x0980dc00, 0x100003ff },
+ { 0x0980e000, 0x0c0018ff },
+ { 0x1680f900, 0x1c00012d },
+ { 0x1680fa30, 0x1c00003a },
+ { 0x1680fa70, 0x1c000069 },
+ { 0x2180fb00, 0x14000006 },
+ { 0x0180fb13, 0x14000004 },
+ { 0x1900fb1d, 0x1c000000 },
+ { 0x1900fb1e, 0x30000000 },
+ { 0x1980fb1f, 0x1c000009 },
+ { 0x1900fb29, 0x64000000 },
+ { 0x1980fb2a, 0x1c00000c },
+ { 0x1980fb38, 0x1c000004 },
+ { 0x1900fb3e, 0x1c000000 },
+ { 0x1980fb40, 0x1c000001 },
+ { 0x1980fb43, 0x1c000001 },
+ { 0x1980fb46, 0x1c00006b },
+ { 0x0080fbd3, 0x1c00016a },
+ { 0x0900fd3e, 0x58000000 },
+ { 0x0900fd3f, 0x48000000 },
+ { 0x0080fd50, 0x1c00003f },
+ { 0x0080fd92, 0x1c000035 },
+ { 0x0080fdf0, 0x1c00000b },
+ { 0x0000fdfc, 0x5c000000 },
+ { 0x0900fdfd, 0x68000000 },
+ { 0x1b80fe00, 0x3000000f },
+ { 0x0980fe10, 0x54000006 },
+ { 0x0900fe17, 0x58000000 },
+ { 0x0900fe18, 0x48000000 },
+ { 0x0900fe19, 0x54000000 },
+ { 0x1b80fe20, 0x30000003 },
+ { 0x0900fe30, 0x54000000 },
+ { 0x0980fe31, 0x44000001 },
+ { 0x0980fe33, 0x40000001 },
+ { 0x0900fe35, 0x58000000 },
+ { 0x0900fe36, 0x48000000 },
+ { 0x0900fe37, 0x58000000 },
+ { 0x0900fe38, 0x48000000 },
+ { 0x0900fe39, 0x58000000 },
+ { 0x0900fe3a, 0x48000000 },
+ { 0x0900fe3b, 0x58000000 },
+ { 0x0900fe3c, 0x48000000 },
+ { 0x0900fe3d, 0x58000000 },
+ { 0x0900fe3e, 0x48000000 },
+ { 0x0900fe3f, 0x58000000 },
+ { 0x0900fe40, 0x48000000 },
+ { 0x0900fe41, 0x58000000 },
+ { 0x0900fe42, 0x48000000 },
+ { 0x0900fe43, 0x58000000 },
+ { 0x0900fe44, 0x48000000 },
+ { 0x0980fe45, 0x54000001 },
+ { 0x0900fe47, 0x58000000 },
+ { 0x0900fe48, 0x48000000 },
+ { 0x0980fe49, 0x54000003 },
+ { 0x0980fe4d, 0x40000002 },
+ { 0x0980fe50, 0x54000002 },
+ { 0x0980fe54, 0x54000003 },
+ { 0x0900fe58, 0x44000000 },
+ { 0x0900fe59, 0x58000000 },
+ { 0x0900fe5a, 0x48000000 },
+ { 0x0900fe5b, 0x58000000 },
+ { 0x0900fe5c, 0x48000000 },
+ { 0x0900fe5d, 0x58000000 },
+ { 0x0900fe5e, 0x48000000 },
+ { 0x0980fe5f, 0x54000002 },
+ { 0x0900fe62, 0x64000000 },
+ { 0x0900fe63, 0x44000000 },
+ { 0x0980fe64, 0x64000002 },
+ { 0x0900fe68, 0x54000000 },
+ { 0x0900fe69, 0x5c000000 },
+ { 0x0980fe6a, 0x54000001 },
+ { 0x0080fe70, 0x1c000004 },
+ { 0x0080fe76, 0x1c000086 },
+ { 0x0900feff, 0x04000000 },
+ { 0x0980ff01, 0x54000002 },
+ { 0x0900ff04, 0x5c000000 },
+ { 0x0980ff05, 0x54000002 },
+ { 0x0900ff08, 0x58000000 },
+ { 0x0900ff09, 0x48000000 },
+ { 0x0900ff0a, 0x54000000 },
+ { 0x0900ff0b, 0x64000000 },
+ { 0x0900ff0c, 0x54000000 },
+ { 0x0900ff0d, 0x44000000 },
+ { 0x0980ff0e, 0x54000001 },
+ { 0x0980ff10, 0x34000009 },
+ { 0x0980ff1a, 0x54000001 },
+ { 0x0980ff1c, 0x64000002 },
+ { 0x0980ff1f, 0x54000001 },
+ { 0x2100ff21, 0x24000020 },
+ { 0x2100ff22, 0x24000020 },
+ { 0x2100ff23, 0x24000020 },
+ { 0x2100ff24, 0x24000020 },
+ { 0x2100ff25, 0x24000020 },
+ { 0x2100ff26, 0x24000020 },
+ { 0x2100ff27, 0x24000020 },
+ { 0x2100ff28, 0x24000020 },
+ { 0x2100ff29, 0x24000020 },
+ { 0x2100ff2a, 0x24000020 },
+ { 0x2100ff2b, 0x24000020 },
+ { 0x2100ff2c, 0x24000020 },
+ { 0x2100ff2d, 0x24000020 },
+ { 0x2100ff2e, 0x24000020 },
+ { 0x2100ff2f, 0x24000020 },
+ { 0x2100ff30, 0x24000020 },
+ { 0x2100ff31, 0x24000020 },
+ { 0x2100ff32, 0x24000020 },
+ { 0x2100ff33, 0x24000020 },
+ { 0x2100ff34, 0x24000020 },
+ { 0x2100ff35, 0x24000020 },
+ { 0x2100ff36, 0x24000020 },
+ { 0x2100ff37, 0x24000020 },
+ { 0x2100ff38, 0x24000020 },
+ { 0x2100ff39, 0x24000020 },
+ { 0x2100ff3a, 0x24000020 },
+ { 0x0900ff3b, 0x58000000 },
+ { 0x0900ff3c, 0x54000000 },
+ { 0x0900ff3d, 0x48000000 },
+ { 0x0900ff3e, 0x60000000 },
+ { 0x0900ff3f, 0x40000000 },
+ { 0x0900ff40, 0x60000000 },
+ { 0x2100ff41, 0x1400ffe0 },
+ { 0x2100ff42, 0x1400ffe0 },
+ { 0x2100ff43, 0x1400ffe0 },
+ { 0x2100ff44, 0x1400ffe0 },
+ { 0x2100ff45, 0x1400ffe0 },
+ { 0x2100ff46, 0x1400ffe0 },
+ { 0x2100ff47, 0x1400ffe0 },
+ { 0x2100ff48, 0x1400ffe0 },
+ { 0x2100ff49, 0x1400ffe0 },
+ { 0x2100ff4a, 0x1400ffe0 },
+ { 0x2100ff4b, 0x1400ffe0 },
+ { 0x2100ff4c, 0x1400ffe0 },
+ { 0x2100ff4d, 0x1400ffe0 },
+ { 0x2100ff4e, 0x1400ffe0 },
+ { 0x2100ff4f, 0x1400ffe0 },
+ { 0x2100ff50, 0x1400ffe0 },
+ { 0x2100ff51, 0x1400ffe0 },
+ { 0x2100ff52, 0x1400ffe0 },
+ { 0x2100ff53, 0x1400ffe0 },
+ { 0x2100ff54, 0x1400ffe0 },
+ { 0x2100ff55, 0x1400ffe0 },
+ { 0x2100ff56, 0x1400ffe0 },
+ { 0x2100ff57, 0x1400ffe0 },
+ { 0x2100ff58, 0x1400ffe0 },
+ { 0x2100ff59, 0x1400ffe0 },
+ { 0x2100ff5a, 0x1400ffe0 },
+ { 0x0900ff5b, 0x58000000 },
+ { 0x0900ff5c, 0x64000000 },
+ { 0x0900ff5d, 0x48000000 },
+ { 0x0900ff5e, 0x64000000 },
+ { 0x0900ff5f, 0x58000000 },
+ { 0x0900ff60, 0x48000000 },
+ { 0x0900ff61, 0x54000000 },
+ { 0x0900ff62, 0x58000000 },
+ { 0x0900ff63, 0x48000000 },
+ { 0x0980ff64, 0x54000001 },
+ { 0x1d80ff66, 0x1c000009 },
+ { 0x0900ff70, 0x18000000 },
+ { 0x1d80ff71, 0x1c00002c },
+ { 0x0980ff9e, 0x18000001 },
+ { 0x1780ffa0, 0x1c00001e },
+ { 0x1780ffc2, 0x1c000005 },
+ { 0x1780ffca, 0x1c000005 },
+ { 0x1780ffd2, 0x1c000005 },
+ { 0x1780ffda, 0x1c000002 },
+ { 0x0980ffe0, 0x5c000001 },
+ { 0x0900ffe2, 0x64000000 },
+ { 0x0900ffe3, 0x60000000 },
+ { 0x0900ffe4, 0x68000000 },
+ { 0x0980ffe5, 0x5c000001 },
+ { 0x0900ffe8, 0x68000000 },
+ { 0x0980ffe9, 0x64000003 },
+ { 0x0980ffed, 0x68000001 },
+ { 0x0980fff9, 0x04000002 },
+ { 0x0980fffc, 0x68000001 },
+ { 0x23810000, 0x1c00000b },
+ { 0x2381000d, 0x1c000019 },
+ { 0x23810028, 0x1c000012 },
+ { 0x2381003c, 0x1c000001 },
+ { 0x2381003f, 0x1c00000e },
+ { 0x23810050, 0x1c00000d },
+ { 0x23810080, 0x1c00007a },
+ { 0x09810100, 0x54000001 },
+ { 0x09010102, 0x68000000 },
+ { 0x09810107, 0x3c00002c },
+ { 0x09810137, 0x68000008 },
+ { 0x13810140, 0x38000034 },
+ { 0x13810175, 0x3c000003 },
+ { 0x13810179, 0x68000010 },
+ { 0x1301018a, 0x3c000000 },
+ { 0x29810300, 0x1c00001e },
+ { 0x29810320, 0x3c000003 },
+ { 0x12810330, 0x1c000010 },
+ { 0x12010341, 0x38000000 },
+ { 0x12810342, 0x1c000007 },
+ { 0x1201034a, 0x38000000 },
+ { 0x3b810380, 0x1c00001d },
+ { 0x3b01039f, 0x54000000 },
+ { 0x2a8103a0, 0x1c000023 },
+ { 0x2a8103c8, 0x1c000007 },
+ { 0x2a0103d0, 0x54000000 },
+ { 0x2a8103d1, 0x38000004 },
+ { 0x0d010400, 0x24000028 },
+ { 0x0d010401, 0x24000028 },
+ { 0x0d010402, 0x24000028 },
+ { 0x0d010403, 0x24000028 },
+ { 0x0d010404, 0x24000028 },
+ { 0x0d010405, 0x24000028 },
+ { 0x0d010406, 0x24000028 },
+ { 0x0d010407, 0x24000028 },
+ { 0x0d010408, 0x24000028 },
+ { 0x0d010409, 0x24000028 },
+ { 0x0d01040a, 0x24000028 },
+ { 0x0d01040b, 0x24000028 },
+ { 0x0d01040c, 0x24000028 },
+ { 0x0d01040d, 0x24000028 },
+ { 0x0d01040e, 0x24000028 },
+ { 0x0d01040f, 0x24000028 },
+ { 0x0d010410, 0x24000028 },
+ { 0x0d010411, 0x24000028 },
+ { 0x0d010412, 0x24000028 },
+ { 0x0d010413, 0x24000028 },
+ { 0x0d010414, 0x24000028 },
+ { 0x0d010415, 0x24000028 },
+ { 0x0d010416, 0x24000028 },
+ { 0x0d010417, 0x24000028 },
+ { 0x0d010418, 0x24000028 },
+ { 0x0d010419, 0x24000028 },
+ { 0x0d01041a, 0x24000028 },
+ { 0x0d01041b, 0x24000028 },
+ { 0x0d01041c, 0x24000028 },
+ { 0x0d01041d, 0x24000028 },
+ { 0x0d01041e, 0x24000028 },
+ { 0x0d01041f, 0x24000028 },
+ { 0x0d010420, 0x24000028 },
+ { 0x0d010421, 0x24000028 },
+ { 0x0d010422, 0x24000028 },
+ { 0x0d010423, 0x24000028 },
+ { 0x0d010424, 0x24000028 },
+ { 0x0d010425, 0x24000028 },
+ { 0x0d010426, 0x24000028 },
+ { 0x0d010427, 0x24000028 },
+ { 0x0d010428, 0x1400ffd8 },
+ { 0x0d010429, 0x1400ffd8 },
+ { 0x0d01042a, 0x1400ffd8 },
+ { 0x0d01042b, 0x1400ffd8 },
+ { 0x0d01042c, 0x1400ffd8 },
+ { 0x0d01042d, 0x1400ffd8 },
+ { 0x0d01042e, 0x1400ffd8 },
+ { 0x0d01042f, 0x1400ffd8 },
+ { 0x0d010430, 0x1400ffd8 },
+ { 0x0d010431, 0x1400ffd8 },
+ { 0x0d010432, 0x1400ffd8 },
+ { 0x0d010433, 0x1400ffd8 },
+ { 0x0d010434, 0x1400ffd8 },
+ { 0x0d010435, 0x1400ffd8 },
+ { 0x0d010436, 0x1400ffd8 },
+ { 0x0d010437, 0x1400ffd8 },
+ { 0x0d010438, 0x1400ffd8 },
+ { 0x0d010439, 0x1400ffd8 },
+ { 0x0d01043a, 0x1400ffd8 },
+ { 0x0d01043b, 0x1400ffd8 },
+ { 0x0d01043c, 0x1400ffd8 },
+ { 0x0d01043d, 0x1400ffd8 },
+ { 0x0d01043e, 0x1400ffd8 },
+ { 0x0d01043f, 0x1400ffd8 },
+ { 0x0d010440, 0x1400ffd8 },
+ { 0x0d010441, 0x1400ffd8 },
+ { 0x0d010442, 0x1400ffd8 },
+ { 0x0d010443, 0x1400ffd8 },
+ { 0x0d010444, 0x1400ffd8 },
+ { 0x0d010445, 0x1400ffd8 },
+ { 0x0d010446, 0x1400ffd8 },
+ { 0x0d010447, 0x1400ffd8 },
+ { 0x0d010448, 0x1400ffd8 },
+ { 0x0d010449, 0x1400ffd8 },
+ { 0x0d01044a, 0x1400ffd8 },
+ { 0x0d01044b, 0x1400ffd8 },
+ { 0x0d01044c, 0x1400ffd8 },
+ { 0x0d01044d, 0x1400ffd8 },
+ { 0x0d01044e, 0x1400ffd8 },
+ { 0x0d01044f, 0x1400ffd8 },
+ { 0x2e810450, 0x1c00004d },
+ { 0x2c8104a0, 0x34000009 },
+ { 0x0b810800, 0x1c000005 },
+ { 0x0b010808, 0x1c000000 },
+ { 0x0b81080a, 0x1c00002b },
+ { 0x0b810837, 0x1c000001 },
+ { 0x0b01083c, 0x1c000000 },
+ { 0x0b01083f, 0x1c000000 },
+ { 0x41810900, 0x1c000015 },
+ { 0x41810916, 0x3c000003 },
+ { 0x4101091f, 0x54000000 },
+ { 0x1e010a00, 0x1c000000 },
+ { 0x1e810a01, 0x30000002 },
+ { 0x1e810a05, 0x30000001 },
+ { 0x1e810a0c, 0x30000003 },
+ { 0x1e810a10, 0x1c000003 },
+ { 0x1e810a15, 0x1c000002 },
+ { 0x1e810a19, 0x1c00001a },
+ { 0x1e810a38, 0x30000002 },
+ { 0x1e010a3f, 0x30000000 },
+ { 0x1e810a40, 0x3c000007 },
+ { 0x1e810a50, 0x54000008 },
+ { 0x3e812000, 0x1c00036e },
+ { 0x3e812400, 0x38000062 },
+ { 0x3e812470, 0x54000003 },
+ { 0x0981d000, 0x680000f5 },
+ { 0x0981d100, 0x68000026 },
+ { 0x0981d12a, 0x6800003a },
+ { 0x0981d165, 0x28000001 },
+ { 0x1b81d167, 0x30000002 },
+ { 0x0981d16a, 0x68000002 },
+ { 0x0981d16d, 0x28000005 },
+ { 0x0981d173, 0x04000007 },
+ { 0x1b81d17b, 0x30000007 },
+ { 0x0981d183, 0x68000001 },
+ { 0x1b81d185, 0x30000006 },
+ { 0x0981d18c, 0x6800001d },
+ { 0x1b81d1aa, 0x30000003 },
+ { 0x0981d1ae, 0x6800002f },
+ { 0x1381d200, 0x68000041 },
+ { 0x1381d242, 0x30000002 },
+ { 0x1301d245, 0x68000000 },
+ { 0x0981d300, 0x68000056 },
+ { 0x0981d360, 0x3c000011 },
+ { 0x0981d400, 0x24000019 },
+ { 0x0981d41a, 0x14000019 },
+ { 0x0981d434, 0x24000019 },
+ { 0x0981d44e, 0x14000006 },
+ { 0x0981d456, 0x14000011 },
+ { 0x0981d468, 0x24000019 },
+ { 0x0981d482, 0x14000019 },
+ { 0x0901d49c, 0x24000000 },
+ { 0x0981d49e, 0x24000001 },
+ { 0x0901d4a2, 0x24000000 },
+ { 0x0981d4a5, 0x24000001 },
+ { 0x0981d4a9, 0x24000003 },
+ { 0x0981d4ae, 0x24000007 },
+ { 0x0981d4b6, 0x14000003 },
+ { 0x0901d4bb, 0x14000000 },
+ { 0x0981d4bd, 0x14000006 },
+ { 0x0981d4c5, 0x1400000a },
+ { 0x0981d4d0, 0x24000019 },
+ { 0x0981d4ea, 0x14000019 },
+ { 0x0981d504, 0x24000001 },
+ { 0x0981d507, 0x24000003 },
+ { 0x0981d50d, 0x24000007 },
+ { 0x0981d516, 0x24000006 },
+ { 0x0981d51e, 0x14000019 },
+ { 0x0981d538, 0x24000001 },
+ { 0x0981d53b, 0x24000003 },
+ { 0x0981d540, 0x24000004 },
+ { 0x0901d546, 0x24000000 },
+ { 0x0981d54a, 0x24000006 },
+ { 0x0981d552, 0x14000019 },
+ { 0x0981d56c, 0x24000019 },
+ { 0x0981d586, 0x14000019 },
+ { 0x0981d5a0, 0x24000019 },
+ { 0x0981d5ba, 0x14000019 },
+ { 0x0981d5d4, 0x24000019 },
+ { 0x0981d5ee, 0x14000019 },
+ { 0x0981d608, 0x24000019 },
+ { 0x0981d622, 0x14000019 },
+ { 0x0981d63c, 0x24000019 },
+ { 0x0981d656, 0x14000019 },
+ { 0x0981d670, 0x24000019 },
+ { 0x0981d68a, 0x1400001b },
+ { 0x0981d6a8, 0x24000018 },
+ { 0x0901d6c1, 0x64000000 },
+ { 0x0981d6c2, 0x14000018 },
+ { 0x0901d6db, 0x64000000 },
+ { 0x0981d6dc, 0x14000005 },
+ { 0x0981d6e2, 0x24000018 },
+ { 0x0901d6fb, 0x64000000 },
+ { 0x0981d6fc, 0x14000018 },
+ { 0x0901d715, 0x64000000 },
+ { 0x0981d716, 0x14000005 },
+ { 0x0981d71c, 0x24000018 },
+ { 0x0901d735, 0x64000000 },
+ { 0x0981d736, 0x14000018 },
+ { 0x0901d74f, 0x64000000 },
+ { 0x0981d750, 0x14000005 },
+ { 0x0981d756, 0x24000018 },
+ { 0x0901d76f, 0x64000000 },
+ { 0x0981d770, 0x14000018 },
+ { 0x0901d789, 0x64000000 },
+ { 0x0981d78a, 0x14000005 },
+ { 0x0981d790, 0x24000018 },
+ { 0x0901d7a9, 0x64000000 },
+ { 0x0981d7aa, 0x14000018 },
+ { 0x0901d7c3, 0x64000000 },
+ { 0x0981d7c4, 0x14000005 },
+ { 0x0901d7ca, 0x24000000 },
+ { 0x0901d7cb, 0x14000000 },
+ { 0x0981d7ce, 0x34000031 },
+ { 0x16820000, 0x1c00a6d6 },
+ { 0x1682f800, 0x1c00021d },
+ { 0x090e0001, 0x04000000 },
+ { 0x098e0020, 0x0400005f },
+ { 0x1b8e0100, 0x300000ef },
+ { 0x098f0000, 0x0c00fffd },
+ { 0x09900000, 0x0c00fffd },
+};
diff --git a/src/plugins/PCREPlugin/ucptable.h b/src/plugins/PCREPlugin/ucptable.h
new file mode 100644
index 0000000..07eaced
--- /dev/null
+++ b/src/plugins/PCREPlugin/ucptable.h
@@ -0,0 +1,3068 @@
+/* This source module is automatically generated from the Unicode
+property table. See ucpinternal.h for a description of the layout.
+This version was made from the Unicode 5.0.0 tables. */
+
+static const cnode ucp_table[] = {
+ { 0x09800000, 0x0000001f },
+ { 0x09000020, 0x74000000 },
+ { 0x09800021, 0x54000002 },
+ { 0x09000024, 0x5c000000 },
+ { 0x09800025, 0x54000002 },
+ { 0x09000028, 0x58000000 },
+ { 0x09000029, 0x48000000 },
+ { 0x0900002a, 0x54000000 },
+ { 0x0900002b, 0x64000000 },
+ { 0x0900002c, 0x54000000 },
+ { 0x0900002d, 0x44000000 },
+ { 0x0980002e, 0x54000001 },
+ { 0x09800030, 0x34000009 },
+ { 0x0980003a, 0x54000001 },
+ { 0x0980003c, 0x64000002 },
+ { 0x0980003f, 0x54000001 },
+ { 0x21000041, 0x24000020 },
+ { 0x21000042, 0x24000020 },
+ { 0x21000043, 0x24000020 },
+ { 0x21000044, 0x24000020 },
+ { 0x21000045, 0x24000020 },
+ { 0x21000046, 0x24000020 },
+ { 0x21000047, 0x24000020 },
+ { 0x21000048, 0x24000020 },
+ { 0x21000049, 0x24000020 },
+ { 0x2100004a, 0x24000020 },
+ { 0x2100004b, 0x24000020 },
+ { 0x2100004c, 0x24000020 },
+ { 0x2100004d, 0x24000020 },
+ { 0x2100004e, 0x24000020 },
+ { 0x2100004f, 0x24000020 },
+ { 0x21000050, 0x24000020 },
+ { 0x21000051, 0x24000020 },
+ { 0x21000052, 0x24000020 },
+ { 0x21000053, 0x24000020 },
+ { 0x21000054, 0x24000020 },
+ { 0x21000055, 0x24000020 },
+ { 0x21000056, 0x24000020 },
+ { 0x21000057, 0x24000020 },
+ { 0x21000058, 0x24000020 },
+ { 0x21000059, 0x24000020 },
+ { 0x2100005a, 0x24000020 },
+ { 0x0900005b, 0x58000000 },
+ { 0x0900005c, 0x54000000 },
+ { 0x0900005d, 0x48000000 },
+ { 0x0900005e, 0x60000000 },
+ { 0x0900005f, 0x40000000 },
+ { 0x09000060, 0x60000000 },
+ { 0x21000061, 0x1400ffe0 },
+ { 0x21000062, 0x1400ffe0 },
+ { 0x21000063, 0x1400ffe0 },
+ { 0x21000064, 0x1400ffe0 },
+ { 0x21000065, 0x1400ffe0 },
+ { 0x21000066, 0x1400ffe0 },
+ { 0x21000067, 0x1400ffe0 },
+ { 0x21000068, 0x1400ffe0 },
+ { 0x21000069, 0x1400ffe0 },
+ { 0x2100006a, 0x1400ffe0 },
+ { 0x2100006b, 0x1400ffe0 },
+ { 0x2100006c, 0x1400ffe0 },
+ { 0x2100006d, 0x1400ffe0 },
+ { 0x2100006e, 0x1400ffe0 },
+ { 0x2100006f, 0x1400ffe0 },
+ { 0x21000070, 0x1400ffe0 },
+ { 0x21000071, 0x1400ffe0 },
+ { 0x21000072, 0x1400ffe0 },
+ { 0x21000073, 0x1400ffe0 },
+ { 0x21000074, 0x1400ffe0 },
+ { 0x21000075, 0x1400ffe0 },
+ { 0x21000076, 0x1400ffe0 },
+ { 0x21000077, 0x1400ffe0 },
+ { 0x21000078, 0x1400ffe0 },
+ { 0x21000079, 0x1400ffe0 },
+ { 0x2100007a, 0x1400ffe0 },
+ { 0x0900007b, 0x58000000 },
+ { 0x0900007c, 0x64000000 },
+ { 0x0900007d, 0x48000000 },
+ { 0x0900007e, 0x64000000 },
+ { 0x0980007f, 0x00000020 },
+ { 0x090000a0, 0x74000000 },
+ { 0x090000a1, 0x54000000 },
+ { 0x098000a2, 0x5c000003 },
+ { 0x098000a6, 0x68000001 },
+ { 0x090000a8, 0x60000000 },
+ { 0x090000a9, 0x68000000 },
+ { 0x210000aa, 0x14000000 },
+ { 0x090000ab, 0x50000000 },
+ { 0x090000ac, 0x64000000 },
+ { 0x090000ad, 0x04000000 },
+ { 0x090000ae, 0x68000000 },
+ { 0x090000af, 0x60000000 },
+ { 0x090000b0, 0x68000000 },
+ { 0x090000b1, 0x64000000 },
+ { 0x098000b2, 0x3c000001 },
+ { 0x090000b4, 0x60000000 },
+ { 0x090000b5, 0x140002e7 },
+ { 0x090000b6, 0x68000000 },
+ { 0x090000b7, 0x54000000 },
+ { 0x090000b8, 0x60000000 },
+ { 0x090000b9, 0x3c000000 },
+ { 0x210000ba, 0x14000000 },
+ { 0x090000bb, 0x4c000000 },
+ { 0x098000bc, 0x3c000002 },
+ { 0x090000bf, 0x54000000 },
+ { 0x210000c0, 0x24000020 },
+ { 0x210000c1, 0x24000020 },
+ { 0x210000c2, 0x24000020 },
+ { 0x210000c3, 0x24000020 },
+ { 0x210000c4, 0x24000020 },
+ { 0x210000c5, 0x24000020 },
+ { 0x210000c6, 0x24000020 },
+ { 0x210000c7, 0x24000020 },
+ { 0x210000c8, 0x24000020 },
+ { 0x210000c9, 0x24000020 },
+ { 0x210000ca, 0x24000020 },
+ { 0x210000cb, 0x24000020 },
+ { 0x210000cc, 0x24000020 },
+ { 0x210000cd, 0x24000020 },
+ { 0x210000ce, 0x24000020 },
+ { 0x210000cf, 0x24000020 },
+ { 0x210000d0, 0x24000020 },
+ { 0x210000d1, 0x24000020 },
+ { 0x210000d2, 0x24000020 },
+ { 0x210000d3, 0x24000020 },
+ { 0x210000d4, 0x24000020 },
+ { 0x210000d5, 0x24000020 },
+ { 0x210000d6, 0x24000020 },
+ { 0x090000d7, 0x64000000 },
+ { 0x210000d8, 0x24000020 },
+ { 0x210000d9, 0x24000020 },
+ { 0x210000da, 0x24000020 },
+ { 0x210000db, 0x24000020 },
+ { 0x210000dc, 0x24000020 },
+ { 0x210000dd, 0x24000020 },
+ { 0x210000de, 0x24000020 },
+ { 0x210000df, 0x14000000 },
+ { 0x210000e0, 0x1400ffe0 },
+ { 0x210000e1, 0x1400ffe0 },
+ { 0x210000e2, 0x1400ffe0 },
+ { 0x210000e3, 0x1400ffe0 },
+ { 0x210000e4, 0x1400ffe0 },
+ { 0x210000e5, 0x1400ffe0 },
+ { 0x210000e6, 0x1400ffe0 },
+ { 0x210000e7, 0x1400ffe0 },
+ { 0x210000e8, 0x1400ffe0 },
+ { 0x210000e9, 0x1400ffe0 },
+ { 0x210000ea, 0x1400ffe0 },
+ { 0x210000eb, 0x1400ffe0 },
+ { 0x210000ec, 0x1400ffe0 },
+ { 0x210000ed, 0x1400ffe0 },
+ { 0x210000ee, 0x1400ffe0 },
+ { 0x210000ef, 0x1400ffe0 },
+ { 0x210000f0, 0x1400ffe0 },
+ { 0x210000f1, 0x1400ffe0 },
+ { 0x210000f2, 0x1400ffe0 },
+ { 0x210000f3, 0x1400ffe0 },
+ { 0x210000f4, 0x1400ffe0 },
+ { 0x210000f5, 0x1400ffe0 },
+ { 0x210000f6, 0x1400ffe0 },
+ { 0x090000f7, 0x64000000 },
+ { 0x210000f8, 0x1400ffe0 },
+ { 0x210000f9, 0x1400ffe0 },
+ { 0x210000fa, 0x1400ffe0 },
+ { 0x210000fb, 0x1400ffe0 },
+ { 0x210000fc, 0x1400ffe0 },
+ { 0x210000fd, 0x1400ffe0 },
+ { 0x210000fe, 0x1400ffe0 },
+ { 0x210000ff, 0x14000079 },
+ { 0x21000100, 0x24000001 },
+ { 0x21000101, 0x1400ffff },
+ { 0x21000102, 0x24000001 },
+ { 0x21000103, 0x1400ffff },
+ { 0x21000104, 0x24000001 },
+ { 0x21000105, 0x1400ffff },
+ { 0x21000106, 0x24000001 },
+ { 0x21000107, 0x1400ffff },
+ { 0x21000108, 0x24000001 },
+ { 0x21000109, 0x1400ffff },
+ { 0x2100010a, 0x24000001 },
+ { 0x2100010b, 0x1400ffff },
+ { 0x2100010c, 0x24000001 },
+ { 0x2100010d, 0x1400ffff },
+ { 0x2100010e, 0x24000001 },
+ { 0x2100010f, 0x1400ffff },
+ { 0x21000110, 0x24000001 },
+ { 0x21000111, 0x1400ffff },
+ { 0x21000112, 0x24000001 },
+ { 0x21000113, 0x1400ffff },
+ { 0x21000114, 0x24000001 },
+ { 0x21000115, 0x1400ffff },
+ { 0x21000116, 0x24000001 },
+ { 0x21000117, 0x1400ffff },
+ { 0x21000118, 0x24000001 },
+ { 0x21000119, 0x1400ffff },
+ { 0x2100011a, 0x24000001 },
+ { 0x2100011b, 0x1400ffff },
+ { 0x2100011c, 0x24000001 },
+ { 0x2100011d, 0x1400ffff },
+ { 0x2100011e, 0x24000001 },
+ { 0x2100011f, 0x1400ffff },
+ { 0x21000120, 0x24000001 },
+ { 0x21000121, 0x1400ffff },
+ { 0x21000122, 0x24000001 },
+ { 0x21000123, 0x1400ffff },
+ { 0x21000124, 0x24000001 },
+ { 0x21000125, 0x1400ffff },
+ { 0x21000126, 0x24000001 },
+ { 0x21000127, 0x1400ffff },
+ { 0x21000128, 0x24000001 },
+ { 0x21000129, 0x1400ffff },
+ { 0x2100012a, 0x24000001 },
+ { 0x2100012b, 0x1400ffff },
+ { 0x2100012c, 0x24000001 },
+ { 0x2100012d, 0x1400ffff },
+ { 0x2100012e, 0x24000001 },
+ { 0x2100012f, 0x1400ffff },
+ { 0x21000130, 0x2400ff39 },
+ { 0x21000131, 0x1400ff18 },
+ { 0x21000132, 0x24000001 },
+ { 0x21000133, 0x1400ffff },
+ { 0x21000134, 0x24000001 },
+ { 0x21000135, 0x1400ffff },
+ { 0x21000136, 0x24000001 },
+ { 0x21000137, 0x1400ffff },
+ { 0x21000138, 0x14000000 },
+ { 0x21000139, 0x24000001 },
+ { 0x2100013a, 0x1400ffff },
+ { 0x2100013b, 0x24000001 },
+ { 0x2100013c, 0x1400ffff },
+ { 0x2100013d, 0x24000001 },
+ { 0x2100013e, 0x1400ffff },
+ { 0x2100013f, 0x24000001 },
+ { 0x21000140, 0x1400ffff },
+ { 0x21000141, 0x24000001 },
+ { 0x21000142, 0x1400ffff },
+ { 0x21000143, 0x24000001 },
+ { 0x21000144, 0x1400ffff },
+ { 0x21000145, 0x24000001 },
+ { 0x21000146, 0x1400ffff },
+ { 0x21000147, 0x24000001 },
+ { 0x21000148, 0x1400ffff },
+ { 0x21000149, 0x14000000 },
+ { 0x2100014a, 0x24000001 },
+ { 0x2100014b, 0x1400ffff },
+ { 0x2100014c, 0x24000001 },
+ { 0x2100014d, 0x1400ffff },
+ { 0x2100014e, 0x24000001 },
+ { 0x2100014f, 0x1400ffff },
+ { 0x21000150, 0x24000001 },
+ { 0x21000151, 0x1400ffff },
+ { 0x21000152, 0x24000001 },
+ { 0x21000153, 0x1400ffff },
+ { 0x21000154, 0x24000001 },
+ { 0x21000155, 0x1400ffff },
+ { 0x21000156, 0x24000001 },
+ { 0x21000157, 0x1400ffff },
+ { 0x21000158, 0x24000001 },
+ { 0x21000159, 0x1400ffff },
+ { 0x2100015a, 0x24000001 },
+ { 0x2100015b, 0x1400ffff },
+ { 0x2100015c, 0x24000001 },
+ { 0x2100015d, 0x1400ffff },
+ { 0x2100015e, 0x24000001 },
+ { 0x2100015f, 0x1400ffff },
+ { 0x21000160, 0x24000001 },
+ { 0x21000161, 0x1400ffff },
+ { 0x21000162, 0x24000001 },
+ { 0x21000163, 0x1400ffff },
+ { 0x21000164, 0x24000001 },
+ { 0x21000165, 0x1400ffff },
+ { 0x21000166, 0x24000001 },
+ { 0x21000167, 0x1400ffff },
+ { 0x21000168, 0x24000001 },
+ { 0x21000169, 0x1400ffff },
+ { 0x2100016a, 0x24000001 },
+ { 0x2100016b, 0x1400ffff },
+ { 0x2100016c, 0x24000001 },
+ { 0x2100016d, 0x1400ffff },
+ { 0x2100016e, 0x24000001 },
+ { 0x2100016f, 0x1400ffff },
+ { 0x21000170, 0x24000001 },
+ { 0x21000171, 0x1400ffff },
+ { 0x21000172, 0x24000001 },
+ { 0x21000173, 0x1400ffff },
+ { 0x21000174, 0x24000001 },
+ { 0x21000175, 0x1400ffff },
+ { 0x21000176, 0x24000001 },
+ { 0x21000177, 0x1400ffff },
+ { 0x21000178, 0x2400ff87 },
+ { 0x21000179, 0x24000001 },
+ { 0x2100017a, 0x1400ffff },
+ { 0x2100017b, 0x24000001 },
+ { 0x2100017c, 0x1400ffff },
+ { 0x2100017d, 0x24000001 },
+ { 0x2100017e, 0x1400ffff },
+ { 0x2100017f, 0x1400fed4 },
+ { 0x21000180, 0x140000c3 },
+ { 0x21000181, 0x240000d2 },
+ { 0x21000182, 0x24000001 },
+ { 0x21000183, 0x1400ffff },
+ { 0x21000184, 0x24000001 },
+ { 0x21000185, 0x1400ffff },
+ { 0x21000186, 0x240000ce },
+ { 0x21000187, 0x24000001 },
+ { 0x21000188, 0x1400ffff },
+ { 0x21000189, 0x240000cd },
+ { 0x2100018a, 0x240000cd },
+ { 0x2100018b, 0x24000001 },
+ { 0x2100018c, 0x1400ffff },
+ { 0x2100018d, 0x14000000 },
+ { 0x2100018e, 0x2400004f },
+ { 0x2100018f, 0x240000ca },
+ { 0x21000190, 0x240000cb },
+ { 0x21000191, 0x24000001 },
+ { 0x21000192, 0x1400ffff },
+ { 0x21000193, 0x240000cd },
+ { 0x21000194, 0x240000cf },
+ { 0x21000195, 0x14000061 },
+ { 0x21000196, 0x240000d3 },
+ { 0x21000197, 0x240000d1 },
+ { 0x21000198, 0x24000001 },
+ { 0x21000199, 0x1400ffff },
+ { 0x2100019a, 0x140000a3 },
+ { 0x2100019b, 0x14000000 },
+ { 0x2100019c, 0x240000d3 },
+ { 0x2100019d, 0x240000d5 },
+ { 0x2100019e, 0x14000082 },
+ { 0x2100019f, 0x240000d6 },
+ { 0x210001a0, 0x24000001 },
+ { 0x210001a1, 0x1400ffff },
+ { 0x210001a2, 0x24000001 },
+ { 0x210001a3, 0x1400ffff },
+ { 0x210001a4, 0x24000001 },
+ { 0x210001a5, 0x1400ffff },
+ { 0x210001a6, 0x240000da },
+ { 0x210001a7, 0x24000001 },
+ { 0x210001a8, 0x1400ffff },
+ { 0x210001a9, 0x240000da },
+ { 0x218001aa, 0x14000001 },
+ { 0x210001ac, 0x24000001 },
+ { 0x210001ad, 0x1400ffff },
+ { 0x210001ae, 0x240000da },
+ { 0x210001af, 0x24000001 },
+ { 0x210001b0, 0x1400ffff },
+ { 0x210001b1, 0x240000d9 },
+ { 0x210001b2, 0x240000d9 },
+ { 0x210001b3, 0x24000001 },
+ { 0x210001b4, 0x1400ffff },
+ { 0x210001b5, 0x24000001 },
+ { 0x210001b6, 0x1400ffff },
+ { 0x210001b7, 0x240000db },
+ { 0x210001b8, 0x24000001 },
+ { 0x210001b9, 0x1400ffff },
+ { 0x210001ba, 0x14000000 },
+ { 0x210001bb, 0x1c000000 },
+ { 0x210001bc, 0x24000001 },
+ { 0x210001bd, 0x1400ffff },
+ { 0x210001be, 0x14000000 },
+ { 0x210001bf, 0x14000038 },
+ { 0x218001c0, 0x1c000003 },
+ { 0x210001c4, 0x24000002 },
+ { 0x210001c5, 0x2000ffff },
+ { 0x210001c6, 0x1400fffe },
+ { 0x210001c7, 0x24000002 },
+ { 0x210001c8, 0x2000ffff },
+ { 0x210001c9, 0x1400fffe },
+ { 0x210001ca, 0x24000002 },
+ { 0x210001cb, 0x2000ffff },
+ { 0x210001cc, 0x1400fffe },
+ { 0x210001cd, 0x24000001 },
+ { 0x210001ce, 0x1400ffff },
+ { 0x210001cf, 0x24000001 },
+ { 0x210001d0, 0x1400ffff },
+ { 0x210001d1, 0x24000001 },
+ { 0x210001d2, 0x1400ffff },
+ { 0x210001d3, 0x24000001 },
+ { 0x210001d4, 0x1400ffff },
+ { 0x210001d5, 0x24000001 },
+ { 0x210001d6, 0x1400ffff },
+ { 0x210001d7, 0x24000001 },
+ { 0x210001d8, 0x1400ffff },
+ { 0x210001d9, 0x24000001 },
+ { 0x210001da, 0x1400ffff },
+ { 0x210001db, 0x24000001 },
+ { 0x210001dc, 0x1400ffff },
+ { 0x210001dd, 0x1400ffb1 },
+ { 0x210001de, 0x24000001 },
+ { 0x210001df, 0x1400ffff },
+ { 0x210001e0, 0x24000001 },
+ { 0x210001e1, 0x1400ffff },
+ { 0x210001e2, 0x24000001 },
+ { 0x210001e3, 0x1400ffff },
+ { 0x210001e4, 0x24000001 },
+ { 0x210001e5, 0x1400ffff },
+ { 0x210001e6, 0x24000001 },
+ { 0x210001e7, 0x1400ffff },
+ { 0x210001e8, 0x24000001 },
+ { 0x210001e9, 0x1400ffff },
+ { 0x210001ea, 0x24000001 },
+ { 0x210001eb, 0x1400ffff },
+ { 0x210001ec, 0x24000001 },
+ { 0x210001ed, 0x1400ffff },
+ { 0x210001ee, 0x24000001 },
+ { 0x210001ef, 0x1400ffff },
+ { 0x210001f0, 0x14000000 },
+ { 0x210001f1, 0x24000002 },
+ { 0x210001f2, 0x2000ffff },
+ { 0x210001f3, 0x1400fffe },
+ { 0x210001f4, 0x24000001 },
+ { 0x210001f5, 0x1400ffff },
+ { 0x210001f6, 0x2400ff9f },
+ { 0x210001f7, 0x2400ffc8 },
+ { 0x210001f8, 0x24000001 },
+ { 0x210001f9, 0x1400ffff },
+ { 0x210001fa, 0x24000001 },
+ { 0x210001fb, 0x1400ffff },
+ { 0x210001fc, 0x24000001 },
+ { 0x210001fd, 0x1400ffff },
+ { 0x210001fe, 0x24000001 },
+ { 0x210001ff, 0x1400ffff },
+ { 0x21000200, 0x24000001 },
+ { 0x21000201, 0x1400ffff },
+ { 0x21000202, 0x24000001 },
+ { 0x21000203, 0x1400ffff },
+ { 0x21000204, 0x24000001 },
+ { 0x21000205, 0x1400ffff },
+ { 0x21000206, 0x24000001 },
+ { 0x21000207, 0x1400ffff },
+ { 0x21000208, 0x24000001 },
+ { 0x21000209, 0x1400ffff },
+ { 0x2100020a, 0x24000001 },
+ { 0x2100020b, 0x1400ffff },
+ { 0x2100020c, 0x24000001 },
+ { 0x2100020d, 0x1400ffff },
+ { 0x2100020e, 0x24000001 },
+ { 0x2100020f, 0x1400ffff },
+ { 0x21000210, 0x24000001 },
+ { 0x21000211, 0x1400ffff },
+ { 0x21000212, 0x24000001 },
+ { 0x21000213, 0x1400ffff },
+ { 0x21000214, 0x24000001 },
+ { 0x21000215, 0x1400ffff },
+ { 0x21000216, 0x24000001 },
+ { 0x21000217, 0x1400ffff },
+ { 0x21000218, 0x24000001 },
+ { 0x21000219, 0x1400ffff },
+ { 0x2100021a, 0x24000001 },
+ { 0x2100021b, 0x1400ffff },
+ { 0x2100021c, 0x24000001 },
+ { 0x2100021d, 0x1400ffff },
+ { 0x2100021e, 0x24000001 },
+ { 0x2100021f, 0x1400ffff },
+ { 0x21000220, 0x2400ff7e },
+ { 0x21000221, 0x14000000 },
+ { 0x21000222, 0x24000001 },
+ { 0x21000223, 0x1400ffff },
+ { 0x21000224, 0x24000001 },
+ { 0x21000225, 0x1400ffff },
+ { 0x21000226, 0x24000001 },
+ { 0x21000227, 0x1400ffff },
+ { 0x21000228, 0x24000001 },
+ { 0x21000229, 0x1400ffff },
+ { 0x2100022a, 0x24000001 },
+ { 0x2100022b, 0x1400ffff },
+ { 0x2100022c, 0x24000001 },
+ { 0x2100022d, 0x1400ffff },
+ { 0x2100022e, 0x24000001 },
+ { 0x2100022f, 0x1400ffff },
+ { 0x21000230, 0x24000001 },
+ { 0x21000231, 0x1400ffff },
+ { 0x21000232, 0x24000001 },
+ { 0x21000233, 0x1400ffff },
+ { 0x21800234, 0x14000005 },
+ { 0x2100023a, 0x24002a2b },
+ { 0x2100023b, 0x24000001 },
+ { 0x2100023c, 0x1400ffff },
+ { 0x2100023d, 0x2400ff5d },
+ { 0x2100023e, 0x24002a28 },
+ { 0x2180023f, 0x14000001 },
+ { 0x21000241, 0x24000001 },
+ { 0x21000242, 0x1400ffff },
+ { 0x21000243, 0x2400ff3d },
+ { 0x21000244, 0x24000045 },
+ { 0x21000245, 0x24000047 },
+ { 0x21000246, 0x24000001 },
+ { 0x21000247, 0x1400ffff },
+ { 0x21000248, 0x24000001 },
+ { 0x21000249, 0x1400ffff },
+ { 0x2100024a, 0x24000001 },
+ { 0x2100024b, 0x1400ffff },
+ { 0x2100024c, 0x24000001 },
+ { 0x2100024d, 0x1400ffff },
+ { 0x2100024e, 0x24000001 },
+ { 0x2100024f, 0x1400ffff },
+ { 0x21800250, 0x14000002 },
+ { 0x21000253, 0x1400ff2e },
+ { 0x21000254, 0x1400ff32 },
+ { 0x21000255, 0x14000000 },
+ { 0x21000256, 0x1400ff33 },
+ { 0x21000257, 0x1400ff33 },
+ { 0x21000258, 0x14000000 },
+ { 0x21000259, 0x1400ff36 },
+ { 0x2100025a, 0x14000000 },
+ { 0x2100025b, 0x1400ff35 },
+ { 0x2180025c, 0x14000003 },
+ { 0x21000260, 0x1400ff33 },
+ { 0x21800261, 0x14000001 },
+ { 0x21000263, 0x1400ff31 },
+ { 0x21800264, 0x14000003 },
+ { 0x21000268, 0x1400ff2f },
+ { 0x21000269, 0x1400ff2d },
+ { 0x2100026a, 0x14000000 },
+ { 0x2100026b, 0x140029f7 },
+ { 0x2180026c, 0x14000002 },
+ { 0x2100026f, 0x1400ff2d },
+ { 0x21800270, 0x14000001 },
+ { 0x21000272, 0x1400ff2b },
+ { 0x21800273, 0x14000001 },
+ { 0x21000275, 0x1400ff2a },
+ { 0x21800276, 0x14000006 },
+ { 0x2100027d, 0x140029e7 },
+ { 0x2180027e, 0x14000001 },
+ { 0x21000280, 0x1400ff26 },
+ { 0x21800281, 0x14000001 },
+ { 0x21000283, 0x1400ff26 },
+ { 0x21800284, 0x14000003 },
+ { 0x21000288, 0x1400ff26 },
+ { 0x21000289, 0x1400ffbb },
+ { 0x2100028a, 0x1400ff27 },
+ { 0x2100028b, 0x1400ff27 },
+ { 0x2100028c, 0x1400ffb9 },
+ { 0x2180028d, 0x14000004 },
+ { 0x21000292, 0x1400ff25 },
+ { 0x21000293, 0x14000000 },
+ { 0x21000294, 0x1c000000 },
+ { 0x21800295, 0x1400001a },
+ { 0x218002b0, 0x18000011 },
+ { 0x098002c2, 0x60000003 },
+ { 0x098002c6, 0x1800000b },
+ { 0x098002d2, 0x6000000d },
+ { 0x218002e0, 0x18000004 },
+ { 0x098002e5, 0x60000008 },
+ { 0x090002ee, 0x18000000 },
+ { 0x098002ef, 0x60000010 },
+ { 0x1b800300, 0x30000044 },
+ { 0x1b000345, 0x30000054 },
+ { 0x1b800346, 0x30000029 },
+ { 0x13800374, 0x60000001 },
+ { 0x1300037a, 0x18000000 },
+ { 0x1300037b, 0x14000082 },
+ { 0x1300037c, 0x14000082 },
+ { 0x1300037d, 0x14000082 },
+ { 0x0900037e, 0x54000000 },
+ { 0x13800384, 0x60000001 },
+ { 0x13000386, 0x24000026 },
+ { 0x09000387, 0x54000000 },
+ { 0x13000388, 0x24000025 },
+ { 0x13000389, 0x24000025 },
+ { 0x1300038a, 0x24000025 },
+ { 0x1300038c, 0x24000040 },
+ { 0x1300038e, 0x2400003f },
+ { 0x1300038f, 0x2400003f },
+ { 0x13000390, 0x14000000 },
+ { 0x13000391, 0x24000020 },
+ { 0x13000392, 0x24000020 },
+ { 0x13000393, 0x24000020 },
+ { 0x13000394, 0x24000020 },
+ { 0x13000395, 0x24000020 },
+ { 0x13000396, 0x24000020 },
+ { 0x13000397, 0x24000020 },
+ { 0x13000398, 0x24000020 },
+ { 0x13000399, 0x24000020 },
+ { 0x1300039a, 0x24000020 },
+ { 0x1300039b, 0x24000020 },
+ { 0x1300039c, 0x24000020 },
+ { 0x1300039d, 0x24000020 },
+ { 0x1300039e, 0x24000020 },
+ { 0x1300039f, 0x24000020 },
+ { 0x130003a0, 0x24000020 },
+ { 0x130003a1, 0x24000020 },
+ { 0x130003a3, 0x24000020 },
+ { 0x130003a4, 0x24000020 },
+ { 0x130003a5, 0x24000020 },
+ { 0x130003a6, 0x24000020 },
+ { 0x130003a7, 0x24000020 },
+ { 0x130003a8, 0x24000020 },
+ { 0x130003a9, 0x24000020 },
+ { 0x130003aa, 0x24000020 },
+ { 0x130003ab, 0x24000020 },
+ { 0x130003ac, 0x1400ffda },
+ { 0x130003ad, 0x1400ffdb },
+ { 0x130003ae, 0x1400ffdb },
+ { 0x130003af, 0x1400ffdb },
+ { 0x130003b0, 0x14000000 },
+ { 0x130003b1, 0x1400ffe0 },
+ { 0x130003b2, 0x1400ffe0 },
+ { 0x130003b3, 0x1400ffe0 },
+ { 0x130003b4, 0x1400ffe0 },
+ { 0x130003b5, 0x1400ffe0 },
+ { 0x130003b6, 0x1400ffe0 },
+ { 0x130003b7, 0x1400ffe0 },
+ { 0x130003b8, 0x1400ffe0 },
+ { 0x130003b9, 0x1400ffe0 },
+ { 0x130003ba, 0x1400ffe0 },
+ { 0x130003bb, 0x1400ffe0 },
+ { 0x130003bc, 0x1400ffe0 },
+ { 0x130003bd, 0x1400ffe0 },
+ { 0x130003be, 0x1400ffe0 },
+ { 0x130003bf, 0x1400ffe0 },
+ { 0x130003c0, 0x1400ffe0 },
+ { 0x130003c1, 0x1400ffe0 },
+ { 0x130003c2, 0x1400ffe1 },
+ { 0x130003c3, 0x1400ffe0 },
+ { 0x130003c4, 0x1400ffe0 },
+ { 0x130003c5, 0x1400ffe0 },
+ { 0x130003c6, 0x1400ffe0 },
+ { 0x130003c7, 0x1400ffe0 },
+ { 0x130003c8, 0x1400ffe0 },
+ { 0x130003c9, 0x1400ffe0 },
+ { 0x130003ca, 0x1400ffe0 },
+ { 0x130003cb, 0x1400ffe0 },
+ { 0x130003cc, 0x1400ffc0 },
+ { 0x130003cd, 0x1400ffc1 },
+ { 0x130003ce, 0x1400ffc1 },
+ { 0x130003d0, 0x1400ffc2 },
+ { 0x130003d1, 0x1400ffc7 },
+ { 0x138003d2, 0x24000002 },
+ { 0x130003d5, 0x1400ffd1 },
+ { 0x130003d6, 0x1400ffca },
+ { 0x130003d7, 0x14000000 },
+ { 0x130003d8, 0x24000001 },
+ { 0x130003d9, 0x1400ffff },
+ { 0x130003da, 0x24000001 },
+ { 0x130003db, 0x1400ffff },
+ { 0x130003dc, 0x24000001 },
+ { 0x130003dd, 0x1400ffff },
+ { 0x130003de, 0x24000001 },
+ { 0x130003df, 0x1400ffff },
+ { 0x130003e0, 0x24000001 },
+ { 0x130003e1, 0x1400ffff },
+ { 0x0a0003e2, 0x24000001 },
+ { 0x0a0003e3, 0x1400ffff },
+ { 0x0a0003e4, 0x24000001 },
+ { 0x0a0003e5, 0x1400ffff },
+ { 0x0a0003e6, 0x24000001 },
+ { 0x0a0003e7, 0x1400ffff },
+ { 0x0a0003e8, 0x24000001 },
+ { 0x0a0003e9, 0x1400ffff },
+ { 0x0a0003ea, 0x24000001 },
+ { 0x0a0003eb, 0x1400ffff },
+ { 0x0a0003ec, 0x24000001 },
+ { 0x0a0003ed, 0x1400ffff },
+ { 0x0a0003ee, 0x24000001 },
+ { 0x0a0003ef, 0x1400ffff },
+ { 0x130003f0, 0x1400ffaa },
+ { 0x130003f1, 0x1400ffb0 },
+ { 0x130003f2, 0x14000007 },
+ { 0x130003f3, 0x14000000 },
+ { 0x130003f4, 0x2400ffc4 },
+ { 0x130003f5, 0x1400ffa0 },
+ { 0x130003f6, 0x64000000 },
+ { 0x130003f7, 0x24000001 },
+ { 0x130003f8, 0x1400ffff },
+ { 0x130003f9, 0x2400fff9 },
+ { 0x130003fa, 0x24000001 },
+ { 0x130003fb, 0x1400ffff },
+ { 0x130003fc, 0x14000000 },
+ { 0x130003fd, 0x2400ff7e },
+ { 0x130003fe, 0x2400ff7e },
+ { 0x130003ff, 0x2400ff7e },
+ { 0x0c000400, 0x24000050 },
+ { 0x0c000401, 0x24000050 },
+ { 0x0c000402, 0x24000050 },
+ { 0x0c000403, 0x24000050 },
+ { 0x0c000404, 0x24000050 },
+ { 0x0c000405, 0x24000050 },
+ { 0x0c000406, 0x24000050 },
+ { 0x0c000407, 0x24000050 },
+ { 0x0c000408, 0x24000050 },
+ { 0x0c000409, 0x24000050 },
+ { 0x0c00040a, 0x24000050 },
+ { 0x0c00040b, 0x24000050 },
+ { 0x0c00040c, 0x24000050 },
+ { 0x0c00040d, 0x24000050 },
+ { 0x0c00040e, 0x24000050 },
+ { 0x0c00040f, 0x24000050 },
+ { 0x0c000410, 0x24000020 },
+ { 0x0c000411, 0x24000020 },
+ { 0x0c000412, 0x24000020 },
+ { 0x0c000413, 0x24000020 },
+ { 0x0c000414, 0x24000020 },
+ { 0x0c000415, 0x24000020 },
+ { 0x0c000416, 0x24000020 },
+ { 0x0c000417, 0x24000020 },
+ { 0x0c000418, 0x24000020 },
+ { 0x0c000419, 0x24000020 },
+ { 0x0c00041a, 0x24000020 },
+ { 0x0c00041b, 0x24000020 },
+ { 0x0c00041c, 0x24000020 },
+ { 0x0c00041d, 0x24000020 },
+ { 0x0c00041e, 0x24000020 },
+ { 0x0c00041f, 0x24000020 },
+ { 0x0c000420, 0x24000020 },
+ { 0x0c000421, 0x24000020 },
+ { 0x0c000422, 0x24000020 },
+ { 0x0c000423, 0x24000020 },
+ { 0x0c000424, 0x24000020 },
+ { 0x0c000425, 0x24000020 },
+ { 0x0c000426, 0x24000020 },
+ { 0x0c000427, 0x24000020 },
+ { 0x0c000428, 0x24000020 },
+ { 0x0c000429, 0x24000020 },
+ { 0x0c00042a, 0x24000020 },
+ { 0x0c00042b, 0x24000020 },
+ { 0x0c00042c, 0x24000020 },
+ { 0x0c00042d, 0x24000020 },
+ { 0x0c00042e, 0x24000020 },
+ { 0x0c00042f, 0x24000020 },
+ { 0x0c000430, 0x1400ffe0 },
+ { 0x0c000431, 0x1400ffe0 },
+ { 0x0c000432, 0x1400ffe0 },
+ { 0x0c000433, 0x1400ffe0 },
+ { 0x0c000434, 0x1400ffe0 },
+ { 0x0c000435, 0x1400ffe0 },
+ { 0x0c000436, 0x1400ffe0 },
+ { 0x0c000437, 0x1400ffe0 },
+ { 0x0c000438, 0x1400ffe0 },
+ { 0x0c000439, 0x1400ffe0 },
+ { 0x0c00043a, 0x1400ffe0 },
+ { 0x0c00043b, 0x1400ffe0 },
+ { 0x0c00043c, 0x1400ffe0 },
+ { 0x0c00043d, 0x1400ffe0 },
+ { 0x0c00043e, 0x1400ffe0 },
+ { 0x0c00043f, 0x1400ffe0 },
+ { 0x0c000440, 0x1400ffe0 },
+ { 0x0c000441, 0x1400ffe0 },
+ { 0x0c000442, 0x1400ffe0 },
+ { 0x0c000443, 0x1400ffe0 },
+ { 0x0c000444, 0x1400ffe0 },
+ { 0x0c000445, 0x1400ffe0 },
+ { 0x0c000446, 0x1400ffe0 },
+ { 0x0c000447, 0x1400ffe0 },
+ { 0x0c000448, 0x1400ffe0 },
+ { 0x0c000449, 0x1400ffe0 },
+ { 0x0c00044a, 0x1400ffe0 },
+ { 0x0c00044b, 0x1400ffe0 },
+ { 0x0c00044c, 0x1400ffe0 },
+ { 0x0c00044d, 0x1400ffe0 },
+ { 0x0c00044e, 0x1400ffe0 },
+ { 0x0c00044f, 0x1400ffe0 },
+ { 0x0c000450, 0x1400ffb0 },
+ { 0x0c000451, 0x1400ffb0 },
+ { 0x0c000452, 0x1400ffb0 },
+ { 0x0c000453, 0x1400ffb0 },
+ { 0x0c000454, 0x1400ffb0 },
+ { 0x0c000455, 0x1400ffb0 },
+ { 0x0c000456, 0x1400ffb0 },
+ { 0x0c000457, 0x1400ffb0 },
+ { 0x0c000458, 0x1400ffb0 },
+ { 0x0c000459, 0x1400ffb0 },
+ { 0x0c00045a, 0x1400ffb0 },
+ { 0x0c00045b, 0x1400ffb0 },
+ { 0x0c00045c, 0x1400ffb0 },
+ { 0x0c00045d, 0x1400ffb0 },
+ { 0x0c00045e, 0x1400ffb0 },
+ { 0x0c00045f, 0x1400ffb0 },
+ { 0x0c000460, 0x24000001 },
+ { 0x0c000461, 0x1400ffff },
+ { 0x0c000462, 0x24000001 },
+ { 0x0c000463, 0x1400ffff },
+ { 0x0c000464, 0x24000001 },
+ { 0x0c000465, 0x1400ffff },
+ { 0x0c000466, 0x24000001 },
+ { 0x0c000467, 0x1400ffff },
+ { 0x0c000468, 0x24000001 },
+ { 0x0c000469, 0x1400ffff },
+ { 0x0c00046a, 0x24000001 },
+ { 0x0c00046b, 0x1400ffff },
+ { 0x0c00046c, 0x24000001 },
+ { 0x0c00046d, 0x1400ffff },
+ { 0x0c00046e, 0x24000001 },
+ { 0x0c00046f, 0x1400ffff },
+ { 0x0c000470, 0x24000001 },
+ { 0x0c000471, 0x1400ffff },
+ { 0x0c000472, 0x24000001 },
+ { 0x0c000473, 0x1400ffff },
+ { 0x0c000474, 0x24000001 },
+ { 0x0c000475, 0x1400ffff },
+ { 0x0c000476, 0x24000001 },
+ { 0x0c000477, 0x1400ffff },
+ { 0x0c000478, 0x24000001 },
+ { 0x0c000479, 0x1400ffff },
+ { 0x0c00047a, 0x24000001 },
+ { 0x0c00047b, 0x1400ffff },
+ { 0x0c00047c, 0x24000001 },
+ { 0x0c00047d, 0x1400ffff },
+ { 0x0c00047e, 0x24000001 },
+ { 0x0c00047f, 0x1400ffff },
+ { 0x0c000480, 0x24000001 },
+ { 0x0c000481, 0x1400ffff },
+ { 0x0c000482, 0x68000000 },
+ { 0x0c800483, 0x30000003 },
+ { 0x0c800488, 0x2c000001 },
+ { 0x0c00048a, 0x24000001 },
+ { 0x0c00048b, 0x1400ffff },
+ { 0x0c00048c, 0x24000001 },
+ { 0x0c00048d, 0x1400ffff },
+ { 0x0c00048e, 0x24000001 },
+ { 0x0c00048f, 0x1400ffff },
+ { 0x0c000490, 0x24000001 },
+ { 0x0c000491, 0x1400ffff },
+ { 0x0c000492, 0x24000001 },
+ { 0x0c000493, 0x1400ffff },
+ { 0x0c000494, 0x24000001 },
+ { 0x0c000495, 0x1400ffff },
+ { 0x0c000496, 0x24000001 },
+ { 0x0c000497, 0x1400ffff },
+ { 0x0c000498, 0x24000001 },
+ { 0x0c000499, 0x1400ffff },
+ { 0x0c00049a, 0x24000001 },
+ { 0x0c00049b, 0x1400ffff },
+ { 0x0c00049c, 0x24000001 },
+ { 0x0c00049d, 0x1400ffff },
+ { 0x0c00049e, 0x24000001 },
+ { 0x0c00049f, 0x1400ffff },
+ { 0x0c0004a0, 0x24000001 },
+ { 0x0c0004a1, 0x1400ffff },
+ { 0x0c0004a2, 0x24000001 },
+ { 0x0c0004a3, 0x1400ffff },
+ { 0x0c0004a4, 0x24000001 },
+ { 0x0c0004a5, 0x1400ffff },
+ { 0x0c0004a6, 0x24000001 },
+ { 0x0c0004a7, 0x1400ffff },
+ { 0x0c0004a8, 0x24000001 },
+ { 0x0c0004a9, 0x1400ffff },
+ { 0x0c0004aa, 0x24000001 },
+ { 0x0c0004ab, 0x1400ffff },
+ { 0x0c0004ac, 0x24000001 },
+ { 0x0c0004ad, 0x1400ffff },
+ { 0x0c0004ae, 0x24000001 },
+ { 0x0c0004af, 0x1400ffff },
+ { 0x0c0004b0, 0x24000001 },
+ { 0x0c0004b1, 0x1400ffff },
+ { 0x0c0004b2, 0x24000001 },
+ { 0x0c0004b3, 0x1400ffff },
+ { 0x0c0004b4, 0x24000001 },
+ { 0x0c0004b5, 0x1400ffff },
+ { 0x0c0004b6, 0x24000001 },
+ { 0x0c0004b7, 0x1400ffff },
+ { 0x0c0004b8, 0x24000001 },
+ { 0x0c0004b9, 0x1400ffff },
+ { 0x0c0004ba, 0x24000001 },
+ { 0x0c0004bb, 0x1400ffff },
+ { 0x0c0004bc, 0x24000001 },
+ { 0x0c0004bd, 0x1400ffff },
+ { 0x0c0004be, 0x24000001 },
+ { 0x0c0004bf, 0x1400ffff },
+ { 0x0c0004c0, 0x2400000f },
+ { 0x0c0004c1, 0x24000001 },
+ { 0x0c0004c2, 0x1400ffff },
+ { 0x0c0004c3, 0x24000001 },
+ { 0x0c0004c4, 0x1400ffff },
+ { 0x0c0004c5, 0x24000001 },
+ { 0x0c0004c6, 0x1400ffff },
+ { 0x0c0004c7, 0x24000001 },
+ { 0x0c0004c8, 0x1400ffff },
+ { 0x0c0004c9, 0x24000001 },
+ { 0x0c0004ca, 0x1400ffff },
+ { 0x0c0004cb, 0x24000001 },
+ { 0x0c0004cc, 0x1400ffff },
+ { 0x0c0004cd, 0x24000001 },
+ { 0x0c0004ce, 0x1400ffff },
+ { 0x0c0004cf, 0x1400fff1 },
+ { 0x0c0004d0, 0x24000001 },
+ { 0x0c0004d1, 0x1400ffff },
+ { 0x0c0004d2, 0x24000001 },
+ { 0x0c0004d3, 0x1400ffff },
+ { 0x0c0004d4, 0x24000001 },
+ { 0x0c0004d5, 0x1400ffff },
+ { 0x0c0004d6, 0x24000001 },
+ { 0x0c0004d7, 0x1400ffff },
+ { 0x0c0004d8, 0x24000001 },
+ { 0x0c0004d9, 0x1400ffff },
+ { 0x0c0004da, 0x24000001 },
+ { 0x0c0004db, 0x1400ffff },
+ { 0x0c0004dc, 0x24000001 },
+ { 0x0c0004dd, 0x1400ffff },
+ { 0x0c0004de, 0x24000001 },
+ { 0x0c0004df, 0x1400ffff },
+ { 0x0c0004e0, 0x24000001 },
+ { 0x0c0004e1, 0x1400ffff },
+ { 0x0c0004e2, 0x24000001 },
+ { 0x0c0004e3, 0x1400ffff },
+ { 0x0c0004e4, 0x24000001 },
+ { 0x0c0004e5, 0x1400ffff },
+ { 0x0c0004e6, 0x24000001 },
+ { 0x0c0004e7, 0x1400ffff },
+ { 0x0c0004e8, 0x24000001 },
+ { 0x0c0004e9, 0x1400ffff },
+ { 0x0c0004ea, 0x24000001 },
+ { 0x0c0004eb, 0x1400ffff },
+ { 0x0c0004ec, 0x24000001 },
+ { 0x0c0004ed, 0x1400ffff },
+ { 0x0c0004ee, 0x24000001 },
+ { 0x0c0004ef, 0x1400ffff },
+ { 0x0c0004f0, 0x24000001 },
+ { 0x0c0004f1, 0x1400ffff },
+ { 0x0c0004f2, 0x24000001 },
+ { 0x0c0004f3, 0x1400ffff },
+ { 0x0c0004f4, 0x24000001 },
+ { 0x0c0004f5, 0x1400ffff },
+ { 0x0c0004f6, 0x24000001 },
+ { 0x0c0004f7, 0x1400ffff },
+ { 0x0c0004f8, 0x24000001 },
+ { 0x0c0004f9, 0x1400ffff },
+ { 0x0c0004fa, 0x24000001 },
+ { 0x0c0004fb, 0x1400ffff },
+ { 0x0c0004fc, 0x24000001 },
+ { 0x0c0004fd, 0x1400ffff },
+ { 0x0c0004fe, 0x24000001 },
+ { 0x0c0004ff, 0x1400ffff },
+ { 0x0c000500, 0x24000001 },
+ { 0x0c000501, 0x1400ffff },
+ { 0x0c000502, 0x24000001 },
+ { 0x0c000503, 0x1400ffff },
+ { 0x0c000504, 0x24000001 },
+ { 0x0c000505, 0x1400ffff },
+ { 0x0c000506, 0x24000001 },
+ { 0x0c000507, 0x1400ffff },
+ { 0x0c000508, 0x24000001 },
+ { 0x0c000509, 0x1400ffff },
+ { 0x0c00050a, 0x24000001 },
+ { 0x0c00050b, 0x1400ffff },
+ { 0x0c00050c, 0x24000001 },
+ { 0x0c00050d, 0x1400ffff },
+ { 0x0c00050e, 0x24000001 },
+ { 0x0c00050f, 0x1400ffff },
+ { 0x0c000510, 0x24000001 },
+ { 0x0c000511, 0x1400ffff },
+ { 0x0c000512, 0x24000001 },
+ { 0x0c000513, 0x1400ffff },
+ { 0x01000531, 0x24000030 },
+ { 0x01000532, 0x24000030 },
+ { 0x01000533, 0x24000030 },
+ { 0x01000534, 0x24000030 },
+ { 0x01000535, 0x24000030 },
+ { 0x01000536, 0x24000030 },
+ { 0x01000537, 0x24000030 },
+ { 0x01000538, 0x24000030 },
+ { 0x01000539, 0x24000030 },
+ { 0x0100053a, 0x24000030 },
+ { 0x0100053b, 0x24000030 },
+ { 0x0100053c, 0x24000030 },
+ { 0x0100053d, 0x24000030 },
+ { 0x0100053e, 0x24000030 },
+ { 0x0100053f, 0x24000030 },
+ { 0x01000540, 0x24000030 },
+ { 0x01000541, 0x24000030 },
+ { 0x01000542, 0x24000030 },
+ { 0x01000543, 0x24000030 },
+ { 0x01000544, 0x24000030 },
+ { 0x01000545, 0x24000030 },
+ { 0x01000546, 0x24000030 },
+ { 0x01000547, 0x24000030 },
+ { 0x01000548, 0x24000030 },
+ { 0x01000549, 0x24000030 },
+ { 0x0100054a, 0x24000030 },
+ { 0x0100054b, 0x24000030 },
+ { 0x0100054c, 0x24000030 },
+ { 0x0100054d, 0x24000030 },
+ { 0x0100054e, 0x24000030 },
+ { 0x0100054f, 0x24000030 },
+ { 0x01000550, 0x24000030 },
+ { 0x01000551, 0x24000030 },
+ { 0x01000552, 0x24000030 },
+ { 0x01000553, 0x24000030 },
+ { 0x01000554, 0x24000030 },
+ { 0x01000555, 0x24000030 },
+ { 0x01000556, 0x24000030 },
+ { 0x01000559, 0x18000000 },
+ { 0x0180055a, 0x54000005 },
+ { 0x01000561, 0x1400ffd0 },
+ { 0x01000562, 0x1400ffd0 },
+ { 0x01000563, 0x1400ffd0 },
+ { 0x01000564, 0x1400ffd0 },
+ { 0x01000565, 0x1400ffd0 },
+ { 0x01000566, 0x1400ffd0 },
+ { 0x01000567, 0x1400ffd0 },
+ { 0x01000568, 0x1400ffd0 },
+ { 0x01000569, 0x1400ffd0 },
+ { 0x0100056a, 0x1400ffd0 },
+ { 0x0100056b, 0x1400ffd0 },
+ { 0x0100056c, 0x1400ffd0 },
+ { 0x0100056d, 0x1400ffd0 },
+ { 0x0100056e, 0x1400ffd0 },
+ { 0x0100056f, 0x1400ffd0 },
+ { 0x01000570, 0x1400ffd0 },
+ { 0x01000571, 0x1400ffd0 },
+ { 0x01000572, 0x1400ffd0 },
+ { 0x01000573, 0x1400ffd0 },
+ { 0x01000574, 0x1400ffd0 },
+ { 0x01000575, 0x1400ffd0 },
+ { 0x01000576, 0x1400ffd0 },
+ { 0x01000577, 0x1400ffd0 },
+ { 0x01000578, 0x1400ffd0 },
+ { 0x01000579, 0x1400ffd0 },
+ { 0x0100057a, 0x1400ffd0 },
+ { 0x0100057b, 0x1400ffd0 },
+ { 0x0100057c, 0x1400ffd0 },
+ { 0x0100057d, 0x1400ffd0 },
+ { 0x0100057e, 0x1400ffd0 },
+ { 0x0100057f, 0x1400ffd0 },
+ { 0x01000580, 0x1400ffd0 },
+ { 0x01000581, 0x1400ffd0 },
+ { 0x01000582, 0x1400ffd0 },
+ { 0x01000583, 0x1400ffd0 },
+ { 0x01000584, 0x1400ffd0 },
+ { 0x01000585, 0x1400ffd0 },
+ { 0x01000586, 0x1400ffd0 },
+ { 0x01000587, 0x14000000 },
+ { 0x09000589, 0x54000000 },
+ { 0x0100058a, 0x44000000 },
+ { 0x19800591, 0x3000002c },
+ { 0x190005be, 0x54000000 },
+ { 0x190005bf, 0x30000000 },
+ { 0x190005c0, 0x54000000 },
+ { 0x198005c1, 0x30000001 },
+ { 0x190005c3, 0x54000000 },
+ { 0x198005c4, 0x30000001 },
+ { 0x190005c6, 0x54000000 },
+ { 0x190005c7, 0x30000000 },
+ { 0x198005d0, 0x1c00001a },
+ { 0x198005f0, 0x1c000002 },
+ { 0x198005f3, 0x54000001 },
+ { 0x09800600, 0x04000003 },
+ { 0x0000060b, 0x5c000000 },
+ { 0x0980060c, 0x54000001 },
+ { 0x0080060e, 0x68000001 },
+ { 0x00800610, 0x30000005 },
+ { 0x0900061b, 0x54000000 },
+ { 0x0080061e, 0x54000001 },
+ { 0x00800621, 0x1c000019 },
+ { 0x09000640, 0x18000000 },
+ { 0x00800641, 0x1c000009 },
+ { 0x1b80064b, 0x30000013 },
+ { 0x09800660, 0x34000009 },
+ { 0x0080066a, 0x54000003 },
+ { 0x0080066e, 0x1c000001 },
+ { 0x1b000670, 0x30000000 },
+ { 0x00800671, 0x1c000062 },
+ { 0x000006d4, 0x54000000 },
+ { 0x000006d5, 0x1c000000 },
+ { 0x008006d6, 0x30000006 },
+ { 0x090006dd, 0x04000000 },
+ { 0x000006de, 0x2c000000 },
+ { 0x008006df, 0x30000005 },
+ { 0x008006e5, 0x18000001 },
+ { 0x008006e7, 0x30000001 },
+ { 0x000006e9, 0x68000000 },
+ { 0x008006ea, 0x30000003 },
+ { 0x008006ee, 0x1c000001 },
+ { 0x008006f0, 0x34000009 },
+ { 0x008006fa, 0x1c000002 },
+ { 0x008006fd, 0x68000001 },
+ { 0x000006ff, 0x1c000000 },
+ { 0x31800700, 0x5400000d },
+ { 0x3100070f, 0x04000000 },
+ { 0x31000710, 0x1c000000 },
+ { 0x31000711, 0x30000000 },
+ { 0x31800712, 0x1c00001d },
+ { 0x31800730, 0x3000001a },
+ { 0x3180074d, 0x1c000020 },
+ { 0x37800780, 0x1c000025 },
+ { 0x378007a6, 0x3000000a },
+ { 0x370007b1, 0x1c000000 },
+ { 0x3f8007c0, 0x34000009 },
+ { 0x3f8007ca, 0x1c000020 },
+ { 0x3f8007eb, 0x30000008 },
+ { 0x3f8007f4, 0x18000001 },
+ { 0x3f0007f6, 0x68000000 },
+ { 0x3f8007f7, 0x54000002 },
+ { 0x3f0007fa, 0x18000000 },
+ { 0x0e800901, 0x30000001 },
+ { 0x0e000903, 0x28000000 },
+ { 0x0e800904, 0x1c000035 },
+ { 0x0e00093c, 0x30000000 },
+ { 0x0e00093d, 0x1c000000 },
+ { 0x0e80093e, 0x28000002 },
+ { 0x0e800941, 0x30000007 },
+ { 0x0e800949, 0x28000003 },
+ { 0x0e00094d, 0x30000000 },
+ { 0x0e000950, 0x1c000000 },
+ { 0x0e800951, 0x30000003 },
+ { 0x0e800958, 0x1c000009 },
+ { 0x0e800962, 0x30000001 },
+ { 0x09800964, 0x54000001 },
+ { 0x0e800966, 0x34000009 },
+ { 0x09000970, 0x54000000 },
+ { 0x0e80097b, 0x1c000004 },
+ { 0x02000981, 0x30000000 },
+ { 0x02800982, 0x28000001 },
+ { 0x02800985, 0x1c000007 },
+ { 0x0280098f, 0x1c000001 },
+ { 0x02800993, 0x1c000015 },
+ { 0x028009aa, 0x1c000006 },
+ { 0x020009b2, 0x1c000000 },
+ { 0x028009b6, 0x1c000003 },
+ { 0x020009bc, 0x30000000 },
+ { 0x020009bd, 0x1c000000 },
+ { 0x028009be, 0x28000002 },
+ { 0x028009c1, 0x30000003 },
+ { 0x028009c7, 0x28000001 },
+ { 0x028009cb, 0x28000001 },
+ { 0x020009cd, 0x30000000 },
+ { 0x020009ce, 0x1c000000 },
+ { 0x020009d7, 0x28000000 },
+ { 0x028009dc, 0x1c000001 },
+ { 0x028009df, 0x1c000002 },
+ { 0x028009e2, 0x30000001 },
+ { 0x028009e6, 0x34000009 },
+ { 0x028009f0, 0x1c000001 },
+ { 0x028009f2, 0x5c000001 },
+ { 0x028009f4, 0x3c000005 },
+ { 0x020009fa, 0x68000000 },
+ { 0x15800a01, 0x30000001 },
+ { 0x15000a03, 0x28000000 },
+ { 0x15800a05, 0x1c000005 },
+ { 0x15800a0f, 0x1c000001 },
+ { 0x15800a13, 0x1c000015 },
+ { 0x15800a2a, 0x1c000006 },
+ { 0x15800a32, 0x1c000001 },
+ { 0x15800a35, 0x1c000001 },
+ { 0x15800a38, 0x1c000001 },
+ { 0x15000a3c, 0x30000000 },
+ { 0x15800a3e, 0x28000002 },
+ { 0x15800a41, 0x30000001 },
+ { 0x15800a47, 0x30000001 },
+ { 0x15800a4b, 0x30000002 },
+ { 0x15800a59, 0x1c000003 },
+ { 0x15000a5e, 0x1c000000 },
+ { 0x15800a66, 0x34000009 },
+ { 0x15800a70, 0x30000001 },
+ { 0x15800a72, 0x1c000002 },
+ { 0x14800a81, 0x30000001 },
+ { 0x14000a83, 0x28000000 },
+ { 0x14800a85, 0x1c000008 },
+ { 0x14800a8f, 0x1c000002 },
+ { 0x14800a93, 0x1c000015 },
+ { 0x14800aaa, 0x1c000006 },
+ { 0x14800ab2, 0x1c000001 },
+ { 0x14800ab5, 0x1c000004 },
+ { 0x14000abc, 0x30000000 },
+ { 0x14000abd, 0x1c000000 },
+ { 0x14800abe, 0x28000002 },
+ { 0x14800ac1, 0x30000004 },
+ { 0x14800ac7, 0x30000001 },
+ { 0x14000ac9, 0x28000000 },
+ { 0x14800acb, 0x28000001 },
+ { 0x14000acd, 0x30000000 },
+ { 0x14000ad0, 0x1c000000 },
+ { 0x14800ae0, 0x1c000001 },
+ { 0x14800ae2, 0x30000001 },
+ { 0x14800ae6, 0x34000009 },
+ { 0x14000af1, 0x5c000000 },
+ { 0x2b000b01, 0x30000000 },
+ { 0x2b800b02, 0x28000001 },
+ { 0x2b800b05, 0x1c000007 },
+ { 0x2b800b0f, 0x1c000001 },
+ { 0x2b800b13, 0x1c000015 },
+ { 0x2b800b2a, 0x1c000006 },
+ { 0x2b800b32, 0x1c000001 },
+ { 0x2b800b35, 0x1c000004 },
+ { 0x2b000b3c, 0x30000000 },
+ { 0x2b000b3d, 0x1c000000 },
+ { 0x2b000b3e, 0x28000000 },
+ { 0x2b000b3f, 0x30000000 },
+ { 0x2b000b40, 0x28000000 },
+ { 0x2b800b41, 0x30000002 },
+ { 0x2b800b47, 0x28000001 },
+ { 0x2b800b4b, 0x28000001 },
+ { 0x2b000b4d, 0x30000000 },
+ { 0x2b000b56, 0x30000000 },
+ { 0x2b000b57, 0x28000000 },
+ { 0x2b800b5c, 0x1c000001 },
+ { 0x2b800b5f, 0x1c000002 },
+ { 0x2b800b66, 0x34000009 },
+ { 0x2b000b70, 0x68000000 },
+ { 0x2b000b71, 0x1c000000 },
+ { 0x35000b82, 0x30000000 },
+ { 0x35000b83, 0x1c000000 },
+ { 0x35800b85, 0x1c000005 },
+ { 0x35800b8e, 0x1c000002 },
+ { 0x35800b92, 0x1c000003 },
+ { 0x35800b99, 0x1c000001 },
+ { 0x35000b9c, 0x1c000000 },
+ { 0x35800b9e, 0x1c000001 },
+ { 0x35800ba3, 0x1c000001 },
+ { 0x35800ba8, 0x1c000002 },
+ { 0x35800bae, 0x1c00000b },
+ { 0x35800bbe, 0x28000001 },
+ { 0x35000bc0, 0x30000000 },
+ { 0x35800bc1, 0x28000001 },
+ { 0x35800bc6, 0x28000002 },
+ { 0x35800bca, 0x28000002 },
+ { 0x35000bcd, 0x30000000 },
+ { 0x35000bd7, 0x28000000 },
+ { 0x35800be6, 0x34000009 },
+ { 0x35800bf0, 0x3c000002 },
+ { 0x35800bf3, 0x68000005 },
+ { 0x35000bf9, 0x5c000000 },
+ { 0x35000bfa, 0x68000000 },
+ { 0x36800c01, 0x28000002 },
+ { 0x36800c05, 0x1c000007 },
+ { 0x36800c0e, 0x1c000002 },
+ { 0x36800c12, 0x1c000016 },
+ { 0x36800c2a, 0x1c000009 },
+ { 0x36800c35, 0x1c000004 },
+ { 0x36800c3e, 0x30000002 },
+ { 0x36800c41, 0x28000003 },
+ { 0x36800c46, 0x30000002 },
+ { 0x36800c4a, 0x30000003 },
+ { 0x36800c55, 0x30000001 },
+ { 0x36800c60, 0x1c000001 },
+ { 0x36800c66, 0x34000009 },
+ { 0x1c800c82, 0x28000001 },
+ { 0x1c800c85, 0x1c000007 },
+ { 0x1c800c8e, 0x1c000002 },
+ { 0x1c800c92, 0x1c000016 },
+ { 0x1c800caa, 0x1c000009 },
+ { 0x1c800cb5, 0x1c000004 },
+ { 0x1c000cbc, 0x30000000 },
+ { 0x1c000cbd, 0x1c000000 },
+ { 0x1c000cbe, 0x28000000 },
+ { 0x1c000cbf, 0x30000000 },
+ { 0x1c800cc0, 0x28000004 },
+ { 0x1c000cc6, 0x30000000 },
+ { 0x1c800cc7, 0x28000001 },
+ { 0x1c800cca, 0x28000001 },
+ { 0x1c800ccc, 0x30000001 },
+ { 0x1c800cd5, 0x28000001 },
+ { 0x1c000cde, 0x1c000000 },
+ { 0x1c800ce0, 0x1c000001 },
+ { 0x1c800ce2, 0x30000001 },
+ { 0x1c800ce6, 0x34000009 },
+ { 0x1c800cf1, 0x68000001 },
+ { 0x24800d02, 0x28000001 },
+ { 0x24800d05, 0x1c000007 },
+ { 0x24800d0e, 0x1c000002 },
+ { 0x24800d12, 0x1c000016 },
+ { 0x24800d2a, 0x1c00000f },
+ { 0x24800d3e, 0x28000002 },
+ { 0x24800d41, 0x30000002 },
+ { 0x24800d46, 0x28000002 },
+ { 0x24800d4a, 0x28000002 },
+ { 0x24000d4d, 0x30000000 },
+ { 0x24000d57, 0x28000000 },
+ { 0x24800d60, 0x1c000001 },
+ { 0x24800d66, 0x34000009 },
+ { 0x2f800d82, 0x28000001 },
+ { 0x2f800d85, 0x1c000011 },
+ { 0x2f800d9a, 0x1c000017 },
+ { 0x2f800db3, 0x1c000008 },
+ { 0x2f000dbd, 0x1c000000 },
+ { 0x2f800dc0, 0x1c000006 },
+ { 0x2f000dca, 0x30000000 },
+ { 0x2f800dcf, 0x28000002 },
+ { 0x2f800dd2, 0x30000002 },
+ { 0x2f000dd6, 0x30000000 },
+ { 0x2f800dd8, 0x28000007 },
+ { 0x2f800df2, 0x28000001 },
+ { 0x2f000df4, 0x54000000 },
+ { 0x38800e01, 0x1c00002f },
+ { 0x38000e31, 0x30000000 },
+ { 0x38800e32, 0x1c000001 },
+ { 0x38800e34, 0x30000006 },
+ { 0x09000e3f, 0x5c000000 },
+ { 0x38800e40, 0x1c000005 },
+ { 0x38000e46, 0x18000000 },
+ { 0x38800e47, 0x30000007 },
+ { 0x38000e4f, 0x54000000 },
+ { 0x38800e50, 0x34000009 },
+ { 0x38800e5a, 0x54000001 },
+ { 0x20800e81, 0x1c000001 },
+ { 0x20000e84, 0x1c000000 },
+ { 0x20800e87, 0x1c000001 },
+ { 0x20000e8a, 0x1c000000 },
+ { 0x20000e8d, 0x1c000000 },
+ { 0x20800e94, 0x1c000003 },
+ { 0x20800e99, 0x1c000006 },
+ { 0x20800ea1, 0x1c000002 },
+ { 0x20000ea5, 0x1c000000 },
+ { 0x20000ea7, 0x1c000000 },
+ { 0x20800eaa, 0x1c000001 },
+ { 0x20800ead, 0x1c000003 },
+ { 0x20000eb1, 0x30000000 },
+ { 0x20800eb2, 0x1c000001 },
+ { 0x20800eb4, 0x30000005 },
+ { 0x20800ebb, 0x30000001 },
+ { 0x20000ebd, 0x1c000000 },
+ { 0x20800ec0, 0x1c000004 },
+ { 0x20000ec6, 0x18000000 },
+ { 0x20800ec8, 0x30000005 },
+ { 0x20800ed0, 0x34000009 },
+ { 0x20800edc, 0x1c000001 },
+ { 0x39000f00, 0x1c000000 },
+ { 0x39800f01, 0x68000002 },
+ { 0x39800f04, 0x5400000e },
+ { 0x39800f13, 0x68000004 },
+ { 0x39800f18, 0x30000001 },
+ { 0x39800f1a, 0x68000005 },
+ { 0x39800f20, 0x34000009 },
+ { 0x39800f2a, 0x3c000009 },
+ { 0x39000f34, 0x68000000 },
+ { 0x39000f35, 0x30000000 },
+ { 0x39000f36, 0x68000000 },
+ { 0x39000f37, 0x30000000 },
+ { 0x39000f38, 0x68000000 },
+ { 0x39000f39, 0x30000000 },
+ { 0x39000f3a, 0x58000000 },
+ { 0x39000f3b, 0x48000000 },
+ { 0x39000f3c, 0x58000000 },
+ { 0x39000f3d, 0x48000000 },
+ { 0x39800f3e, 0x28000001 },
+ { 0x39800f40, 0x1c000007 },
+ { 0x39800f49, 0x1c000021 },
+ { 0x39800f71, 0x3000000d },
+ { 0x39000f7f, 0x28000000 },
+ { 0x39800f80, 0x30000004 },
+ { 0x39000f85, 0x54000000 },
+ { 0x39800f86, 0x30000001 },
+ { 0x39800f88, 0x1c000003 },
+ { 0x39800f90, 0x30000007 },
+ { 0x39800f99, 0x30000023 },
+ { 0x39800fbe, 0x68000007 },
+ { 0x39000fc6, 0x30000000 },
+ { 0x39800fc7, 0x68000005 },
+ { 0x39000fcf, 0x68000000 },
+ { 0x39800fd0, 0x54000001 },
+ { 0x26801000, 0x1c000021 },
+ { 0x26801023, 0x1c000004 },
+ { 0x26801029, 0x1c000001 },
+ { 0x2600102c, 0x28000000 },
+ { 0x2680102d, 0x30000003 },
+ { 0x26001031, 0x28000000 },
+ { 0x26001032, 0x30000000 },
+ { 0x26801036, 0x30000001 },
+ { 0x26001038, 0x28000000 },
+ { 0x26001039, 0x30000000 },
+ { 0x26801040, 0x34000009 },
+ { 0x2680104a, 0x54000005 },
+ { 0x26801050, 0x1c000005 },
+ { 0x26801056, 0x28000001 },
+ { 0x26801058, 0x30000001 },
+ { 0x100010a0, 0x24001c60 },
+ { 0x100010a1, 0x24001c60 },
+ { 0x100010a2, 0x24001c60 },
+ { 0x100010a3, 0x24001c60 },
+ { 0x100010a4, 0x24001c60 },
+ { 0x100010a5, 0x24001c60 },
+ { 0x100010a6, 0x24001c60 },
+ { 0x100010a7, 0x24001c60 },
+ { 0x100010a8, 0x24001c60 },
+ { 0x100010a9, 0x24001c60 },
+ { 0x100010aa, 0x24001c60 },
+ { 0x100010ab, 0x24001c60 },
+ { 0x100010ac, 0x24001c60 },
+ { 0x100010ad, 0x24001c60 },
+ { 0x100010ae, 0x24001c60 },
+ { 0x100010af, 0x24001c60 },
+ { 0x100010b0, 0x24001c60 },
+ { 0x100010b1, 0x24001c60 },
+ { 0x100010b2, 0x24001c60 },
+ { 0x100010b3, 0x24001c60 },
+ { 0x100010b4, 0x24001c60 },
+ { 0x100010b5, 0x24001c60 },
+ { 0x100010b6, 0x24001c60 },
+ { 0x100010b7, 0x24001c60 },
+ { 0x100010b8, 0x24001c60 },
+ { 0x100010b9, 0x24001c60 },
+ { 0x100010ba, 0x24001c60 },
+ { 0x100010bb, 0x24001c60 },
+ { 0x100010bc, 0x24001c60 },
+ { 0x100010bd, 0x24001c60 },
+ { 0x100010be, 0x24001c60 },
+ { 0x100010bf, 0x24001c60 },
+ { 0x100010c0, 0x24001c60 },
+ { 0x100010c1, 0x24001c60 },
+ { 0x100010c2, 0x24001c60 },
+ { 0x100010c3, 0x24001c60 },
+ { 0x100010c4, 0x24001c60 },
+ { 0x100010c5, 0x24001c60 },
+ { 0x108010d0, 0x1c00002a },
+ { 0x090010fb, 0x54000000 },
+ { 0x100010fc, 0x18000000 },
+ { 0x17801100, 0x1c000059 },
+ { 0x1780115f, 0x1c000043 },
+ { 0x178011a8, 0x1c000051 },
+ { 0x0f801200, 0x1c000048 },
+ { 0x0f80124a, 0x1c000003 },
+ { 0x0f801250, 0x1c000006 },
+ { 0x0f001258, 0x1c000000 },
+ { 0x0f80125a, 0x1c000003 },
+ { 0x0f801260, 0x1c000028 },
+ { 0x0f80128a, 0x1c000003 },
+ { 0x0f801290, 0x1c000020 },
+ { 0x0f8012b2, 0x1c000003 },
+ { 0x0f8012b8, 0x1c000006 },
+ { 0x0f0012c0, 0x1c000000 },
+ { 0x0f8012c2, 0x1c000003 },
+ { 0x0f8012c8, 0x1c00000e },
+ { 0x0f8012d8, 0x1c000038 },
+ { 0x0f801312, 0x1c000003 },
+ { 0x0f801318, 0x1c000042 },
+ { 0x0f00135f, 0x30000000 },
+ { 0x0f001360, 0x68000000 },
+ { 0x0f801361, 0x54000007 },
+ { 0x0f801369, 0x3c000013 },
+ { 0x0f801380, 0x1c00000f },
+ { 0x0f801390, 0x68000009 },
+ { 0x088013a0, 0x1c000054 },
+ { 0x07801401, 0x1c00026b },
+ { 0x0780166d, 0x54000001 },
+ { 0x0780166f, 0x1c000007 },
+ { 0x28001680, 0x74000000 },
+ { 0x28801681, 0x1c000019 },
+ { 0x2800169b, 0x58000000 },
+ { 0x2800169c, 0x48000000 },
+ { 0x2d8016a0, 0x1c00004a },
+ { 0x098016eb, 0x54000002 },
+ { 0x2d8016ee, 0x38000002 },
+ { 0x32801700, 0x1c00000c },
+ { 0x3280170e, 0x1c000003 },
+ { 0x32801712, 0x30000002 },
+ { 0x18801720, 0x1c000011 },
+ { 0x18801732, 0x30000002 },
+ { 0x09801735, 0x54000001 },
+ { 0x06801740, 0x1c000011 },
+ { 0x06801752, 0x30000001 },
+ { 0x33801760, 0x1c00000c },
+ { 0x3380176e, 0x1c000002 },
+ { 0x33801772, 0x30000001 },
+ { 0x1f801780, 0x1c000033 },
+ { 0x1f8017b4, 0x04000001 },
+ { 0x1f0017b6, 0x28000000 },
+ { 0x1f8017b7, 0x30000006 },
+ { 0x1f8017be, 0x28000007 },
+ { 0x1f0017c6, 0x30000000 },
+ { 0x1f8017c7, 0x28000001 },
+ { 0x1f8017c9, 0x3000000a },
+ { 0x1f8017d4, 0x54000002 },
+ { 0x1f0017d7, 0x18000000 },
+ { 0x1f8017d8, 0x54000002 },
+ { 0x1f0017db, 0x5c000000 },
+ { 0x1f0017dc, 0x1c000000 },
+ { 0x1f0017dd, 0x30000000 },
+ { 0x1f8017e0, 0x34000009 },
+ { 0x1f8017f0, 0x3c000009 },
+ { 0x25801800, 0x54000005 },
+ { 0x25001806, 0x44000000 },
+ { 0x25801807, 0x54000003 },
+ { 0x2580180b, 0x30000002 },
+ { 0x2500180e, 0x74000000 },
+ { 0x25801810, 0x34000009 },
+ { 0x25801820, 0x1c000022 },
+ { 0x25001843, 0x18000000 },
+ { 0x25801844, 0x1c000033 },
+ { 0x25801880, 0x1c000028 },
+ { 0x250018a9, 0x30000000 },
+ { 0x22801900, 0x1c00001c },
+ { 0x22801920, 0x30000002 },
+ { 0x22801923, 0x28000003 },
+ { 0x22801927, 0x30000001 },
+ { 0x22801929, 0x28000002 },
+ { 0x22801930, 0x28000001 },
+ { 0x22001932, 0x30000000 },
+ { 0x22801933, 0x28000005 },
+ { 0x22801939, 0x30000002 },
+ { 0x22001940, 0x68000000 },
+ { 0x22801944, 0x54000001 },
+ { 0x22801946, 0x34000009 },
+ { 0x34801950, 0x1c00001d },
+ { 0x34801970, 0x1c000004 },
+ { 0x27801980, 0x1c000029 },
+ { 0x278019b0, 0x28000010 },
+ { 0x278019c1, 0x1c000006 },
+ { 0x278019c8, 0x28000001 },
+ { 0x278019d0, 0x34000009 },
+ { 0x278019de, 0x54000001 },
+ { 0x1f8019e0, 0x6800001f },
+ { 0x05801a00, 0x1c000016 },
+ { 0x05801a17, 0x30000001 },
+ { 0x05801a19, 0x28000002 },
+ { 0x05801a1e, 0x54000001 },
+ { 0x3d801b00, 0x30000003 },
+ { 0x3d001b04, 0x28000000 },
+ { 0x3d801b05, 0x1c00002e },
+ { 0x3d001b34, 0x30000000 },
+ { 0x3d001b35, 0x28000000 },
+ { 0x3d801b36, 0x30000004 },
+ { 0x3d001b3b, 0x28000000 },
+ { 0x3d001b3c, 0x30000000 },
+ { 0x3d801b3d, 0x28000004 },
+ { 0x3d001b42, 0x30000000 },
+ { 0x3d801b43, 0x28000001 },
+ { 0x3d801b45, 0x1c000006 },
+ { 0x3d801b50, 0x34000009 },
+ { 0x3d801b5a, 0x54000006 },
+ { 0x3d801b61, 0x68000009 },
+ { 0x3d801b6b, 0x30000008 },
+ { 0x3d801b74, 0x68000008 },
+ { 0x21801d00, 0x1400002b },
+ { 0x21801d2c, 0x18000035 },
+ { 0x21801d62, 0x14000015 },
+ { 0x0c001d78, 0x18000000 },
+ { 0x21801d79, 0x14000003 },
+ { 0x21001d7d, 0x14000ee6 },
+ { 0x21801d7e, 0x1400001c },
+ { 0x21801d9b, 0x18000024 },
+ { 0x1b801dc0, 0x3000000a },
+ { 0x1b801dfe, 0x30000001 },
+ { 0x21001e00, 0x24000001 },
+ { 0x21001e01, 0x1400ffff },
+ { 0x21001e02, 0x24000001 },
+ { 0x21001e03, 0x1400ffff },
+ { 0x21001e04, 0x24000001 },
+ { 0x21001e05, 0x1400ffff },
+ { 0x21001e06, 0x24000001 },
+ { 0x21001e07, 0x1400ffff },
+ { 0x21001e08, 0x24000001 },
+ { 0x21001e09, 0x1400ffff },
+ { 0x21001e0a, 0x24000001 },
+ { 0x21001e0b, 0x1400ffff },
+ { 0x21001e0c, 0x24000001 },
+ { 0x21001e0d, 0x1400ffff },
+ { 0x21001e0e, 0x24000001 },
+ { 0x21001e0f, 0x1400ffff },
+ { 0x21001e10, 0x24000001 },
+ { 0x21001e11, 0x1400ffff },
+ { 0x21001e12, 0x24000001 },
+ { 0x21001e13, 0x1400ffff },
+ { 0x21001e14, 0x24000001 },
+ { 0x21001e15, 0x1400ffff },
+ { 0x21001e16, 0x24000001 },
+ { 0x21001e17, 0x1400ffff },
+ { 0x21001e18, 0x24000001 },
+ { 0x21001e19, 0x1400ffff },
+ { 0x21001e1a, 0x24000001 },
+ { 0x21001e1b, 0x1400ffff },
+ { 0x21001e1c, 0x24000001 },
+ { 0x21001e1d, 0x1400ffff },
+ { 0x21001e1e, 0x24000001 },
+ { 0x21001e1f, 0x1400ffff },
+ { 0x21001e20, 0x24000001 },
+ { 0x21001e21, 0x1400ffff },
+ { 0x21001e22, 0x24000001 },
+ { 0x21001e23, 0x1400ffff },
+ { 0x21001e24, 0x24000001 },
+ { 0x21001e25, 0x1400ffff },
+ { 0x21001e26, 0x24000001 },
+ { 0x21001e27, 0x1400ffff },
+ { 0x21001e28, 0x24000001 },
+ { 0x21001e29, 0x1400ffff },
+ { 0x21001e2a, 0x24000001 },
+ { 0x21001e2b, 0x1400ffff },
+ { 0x21001e2c, 0x24000001 },
+ { 0x21001e2d, 0x1400ffff },
+ { 0x21001e2e, 0x24000001 },
+ { 0x21001e2f, 0x1400ffff },
+ { 0x21001e30, 0x24000001 },
+ { 0x21001e31, 0x1400ffff },
+ { 0x21001e32, 0x24000001 },
+ { 0x21001e33, 0x1400ffff },
+ { 0x21001e34, 0x24000001 },
+ { 0x21001e35, 0x1400ffff },
+ { 0x21001e36, 0x24000001 },
+ { 0x21001e37, 0x1400ffff },
+ { 0x21001e38, 0x24000001 },
+ { 0x21001e39, 0x1400ffff },
+ { 0x21001e3a, 0x24000001 },
+ { 0x21001e3b, 0x1400ffff },
+ { 0x21001e3c, 0x24000001 },
+ { 0x21001e3d, 0x1400ffff },
+ { 0x21001e3e, 0x24000001 },
+ { 0x21001e3f, 0x1400ffff },
+ { 0x21001e40, 0x24000001 },
+ { 0x21001e41, 0x1400ffff },
+ { 0x21001e42, 0x24000001 },
+ { 0x21001e43, 0x1400ffff },
+ { 0x21001e44, 0x24000001 },
+ { 0x21001e45, 0x1400ffff },
+ { 0x21001e46, 0x24000001 },
+ { 0x21001e47, 0x1400ffff },
+ { 0x21001e48, 0x24000001 },
+ { 0x21001e49, 0x1400ffff },
+ { 0x21001e4a, 0x24000001 },
+ { 0x21001e4b, 0x1400ffff },
+ { 0x21001e4c, 0x24000001 },
+ { 0x21001e4d, 0x1400ffff },
+ { 0x21001e4e, 0x24000001 },
+ { 0x21001e4f, 0x1400ffff },
+ { 0x21001e50, 0x24000001 },
+ { 0x21001e51, 0x1400ffff },
+ { 0x21001e52, 0x24000001 },
+ { 0x21001e53, 0x1400ffff },
+ { 0x21001e54, 0x24000001 },
+ { 0x21001e55, 0x1400ffff },
+ { 0x21001e56, 0x24000001 },
+ { 0x21001e57, 0x1400ffff },
+ { 0x21001e58, 0x24000001 },
+ { 0x21001e59, 0x1400ffff },
+ { 0x21001e5a, 0x24000001 },
+ { 0x21001e5b, 0x1400ffff },
+ { 0x21001e5c, 0x24000001 },
+ { 0x21001e5d, 0x1400ffff },
+ { 0x21001e5e, 0x24000001 },
+ { 0x21001e5f, 0x1400ffff },
+ { 0x21001e60, 0x24000001 },
+ { 0x21001e61, 0x1400ffff },
+ { 0x21001e62, 0x24000001 },
+ { 0x21001e63, 0x1400ffff },
+ { 0x21001e64, 0x24000001 },
+ { 0x21001e65, 0x1400ffff },
+ { 0x21001e66, 0x24000001 },
+ { 0x21001e67, 0x1400ffff },
+ { 0x21001e68, 0x24000001 },
+ { 0x21001e69, 0x1400ffff },
+ { 0x21001e6a, 0x24000001 },
+ { 0x21001e6b, 0x1400ffff },
+ { 0x21001e6c, 0x24000001 },
+ { 0x21001e6d, 0x1400ffff },
+ { 0x21001e6e, 0x24000001 },
+ { 0x21001e6f, 0x1400ffff },
+ { 0x21001e70, 0x24000001 },
+ { 0x21001e71, 0x1400ffff },
+ { 0x21001e72, 0x24000001 },
+ { 0x21001e73, 0x1400ffff },
+ { 0x21001e74, 0x24000001 },
+ { 0x21001e75, 0x1400ffff },
+ { 0x21001e76, 0x24000001 },
+ { 0x21001e77, 0x1400ffff },
+ { 0x21001e78, 0x24000001 },
+ { 0x21001e79, 0x1400ffff },
+ { 0x21001e7a, 0x24000001 },
+ { 0x21001e7b, 0x1400ffff },
+ { 0x21001e7c, 0x24000001 },
+ { 0x21001e7d, 0x1400ffff },
+ { 0x21001e7e, 0x24000001 },
+ { 0x21001e7f, 0x1400ffff },
+ { 0x21001e80, 0x24000001 },
+ { 0x21001e81, 0x1400ffff },
+ { 0x21001e82, 0x24000001 },
+ { 0x21001e83, 0x1400ffff },
+ { 0x21001e84, 0x24000001 },
+ { 0x21001e85, 0x1400ffff },
+ { 0x21001e86, 0x24000001 },
+ { 0x21001e87, 0x1400ffff },
+ { 0x21001e88, 0x24000001 },
+ { 0x21001e89, 0x1400ffff },
+ { 0x21001e8a, 0x24000001 },
+ { 0x21001e8b, 0x1400ffff },
+ { 0x21001e8c, 0x24000001 },
+ { 0x21001e8d, 0x1400ffff },
+ { 0x21001e8e, 0x24000001 },
+ { 0x21001e8f, 0x1400ffff },
+ { 0x21001e90, 0x24000001 },
+ { 0x21001e91, 0x1400ffff },
+ { 0x21001e92, 0x24000001 },
+ { 0x21001e93, 0x1400ffff },
+ { 0x21001e94, 0x24000001 },
+ { 0x21001e95, 0x1400ffff },
+ { 0x21801e96, 0x14000004 },
+ { 0x21001e9b, 0x1400ffc5 },
+ { 0x21001ea0, 0x24000001 },
+ { 0x21001ea1, 0x1400ffff },
+ { 0x21001ea2, 0x24000001 },
+ { 0x21001ea3, 0x1400ffff },
+ { 0x21001ea4, 0x24000001 },
+ { 0x21001ea5, 0x1400ffff },
+ { 0x21001ea6, 0x24000001 },
+ { 0x21001ea7, 0x1400ffff },
+ { 0x21001ea8, 0x24000001 },
+ { 0x21001ea9, 0x1400ffff },
+ { 0x21001eaa, 0x24000001 },
+ { 0x21001eab, 0x1400ffff },
+ { 0x21001eac, 0x24000001 },
+ { 0x21001ead, 0x1400ffff },
+ { 0x21001eae, 0x24000001 },
+ { 0x21001eaf, 0x1400ffff },
+ { 0x21001eb0, 0x24000001 },
+ { 0x21001eb1, 0x1400ffff },
+ { 0x21001eb2, 0x24000001 },
+ { 0x21001eb3, 0x1400ffff },
+ { 0x21001eb4, 0x24000001 },
+ { 0x21001eb5, 0x1400ffff },
+ { 0x21001eb6, 0x24000001 },
+ { 0x21001eb7, 0x1400ffff },
+ { 0x21001eb8, 0x24000001 },
+ { 0x21001eb9, 0x1400ffff },
+ { 0x21001eba, 0x24000001 },
+ { 0x21001ebb, 0x1400ffff },
+ { 0x21001ebc, 0x24000001 },
+ { 0x21001ebd, 0x1400ffff },
+ { 0x21001ebe, 0x24000001 },
+ { 0x21001ebf, 0x1400ffff },
+ { 0x21001ec0, 0x24000001 },
+ { 0x21001ec1, 0x1400ffff },
+ { 0x21001ec2, 0x24000001 },
+ { 0x21001ec3, 0x1400ffff },
+ { 0x21001ec4, 0x24000001 },
+ { 0x21001ec5, 0x1400ffff },
+ { 0x21001ec6, 0x24000001 },
+ { 0x21001ec7, 0x1400ffff },
+ { 0x21001ec8, 0x24000001 },
+ { 0x21001ec9, 0x1400ffff },
+ { 0x21001eca, 0x24000001 },
+ { 0x21001ecb, 0x1400ffff },
+ { 0x21001ecc, 0x24000001 },
+ { 0x21001ecd, 0x1400ffff },
+ { 0x21001ece, 0x24000001 },
+ { 0x21001ecf, 0x1400ffff },
+ { 0x21001ed0, 0x24000001 },
+ { 0x21001ed1, 0x1400ffff },
+ { 0x21001ed2, 0x24000001 },
+ { 0x21001ed3, 0x1400ffff },
+ { 0x21001ed4, 0x24000001 },
+ { 0x21001ed5, 0x1400ffff },
+ { 0x21001ed6, 0x24000001 },
+ { 0x21001ed7, 0x1400ffff },
+ { 0x21001ed8, 0x24000001 },
+ { 0x21001ed9, 0x1400ffff },
+ { 0x21001eda, 0x24000001 },
+ { 0x21001edb, 0x1400ffff },
+ { 0x21001edc, 0x24000001 },
+ { 0x21001edd, 0x1400ffff },
+ { 0x21001ede, 0x24000001 },
+ { 0x21001edf, 0x1400ffff },
+ { 0x21001ee0, 0x24000001 },
+ { 0x21001ee1, 0x1400ffff },
+ { 0x21001ee2, 0x24000001 },
+ { 0x21001ee3, 0x1400ffff },
+ { 0x21001ee4, 0x24000001 },
+ { 0x21001ee5, 0x1400ffff },
+ { 0x21001ee6, 0x24000001 },
+ { 0x21001ee7, 0x1400ffff },
+ { 0x21001ee8, 0x24000001 },
+ { 0x21001ee9, 0x1400ffff },
+ { 0x21001eea, 0x24000001 },
+ { 0x21001eeb, 0x1400ffff },
+ { 0x21001eec, 0x24000001 },
+ { 0x21001eed, 0x1400ffff },
+ { 0x21001eee, 0x24000001 },
+ { 0x21001eef, 0x1400ffff },
+ { 0x21001ef0, 0x24000001 },
+ { 0x21001ef1, 0x1400ffff },
+ { 0x21001ef2, 0x24000001 },
+ { 0x21001ef3, 0x1400ffff },
+ { 0x21001ef4, 0x24000001 },
+ { 0x21001ef5, 0x1400ffff },
+ { 0x21001ef6, 0x24000001 },
+ { 0x21001ef7, 0x1400ffff },
+ { 0x21001ef8, 0x24000001 },
+ { 0x21001ef9, 0x1400ffff },
+ { 0x13001f00, 0x14000008 },
+ { 0x13001f01, 0x14000008 },
+ { 0x13001f02, 0x14000008 },
+ { 0x13001f03, 0x14000008 },
+ { 0x13001f04, 0x14000008 },
+ { 0x13001f05, 0x14000008 },
+ { 0x13001f06, 0x14000008 },
+ { 0x13001f07, 0x14000008 },
+ { 0x13001f08, 0x2400fff8 },
+ { 0x13001f09, 0x2400fff8 },
+ { 0x13001f0a, 0x2400fff8 },
+ { 0x13001f0b, 0x2400fff8 },
+ { 0x13001f0c, 0x2400fff8 },
+ { 0x13001f0d, 0x2400fff8 },
+ { 0x13001f0e, 0x2400fff8 },
+ { 0x13001f0f, 0x2400fff8 },
+ { 0x13001f10, 0x14000008 },
+ { 0x13001f11, 0x14000008 },
+ { 0x13001f12, 0x14000008 },
+ { 0x13001f13, 0x14000008 },
+ { 0x13001f14, 0x14000008 },
+ { 0x13001f15, 0x14000008 },
+ { 0x13001f18, 0x2400fff8 },
+ { 0x13001f19, 0x2400fff8 },
+ { 0x13001f1a, 0x2400fff8 },
+ { 0x13001f1b, 0x2400fff8 },
+ { 0x13001f1c, 0x2400fff8 },
+ { 0x13001f1d, 0x2400fff8 },
+ { 0x13001f20, 0x14000008 },
+ { 0x13001f21, 0x14000008 },
+ { 0x13001f22, 0x14000008 },
+ { 0x13001f23, 0x14000008 },
+ { 0x13001f24, 0x14000008 },
+ { 0x13001f25, 0x14000008 },
+ { 0x13001f26, 0x14000008 },
+ { 0x13001f27, 0x14000008 },
+ { 0x13001f28, 0x2400fff8 },
+ { 0x13001f29, 0x2400fff8 },
+ { 0x13001f2a, 0x2400fff8 },
+ { 0x13001f2b, 0x2400fff8 },
+ { 0x13001f2c, 0x2400fff8 },
+ { 0x13001f2d, 0x2400fff8 },
+ { 0x13001f2e, 0x2400fff8 },
+ { 0x13001f2f, 0x2400fff8 },
+ { 0x13001f30, 0x14000008 },
+ { 0x13001f31, 0x14000008 },
+ { 0x13001f32, 0x14000008 },
+ { 0x13001f33, 0x14000008 },
+ { 0x13001f34, 0x14000008 },
+ { 0x13001f35, 0x14000008 },
+ { 0x13001f36, 0x14000008 },
+ { 0x13001f37, 0x14000008 },
+ { 0x13001f38, 0x2400fff8 },
+ { 0x13001f39, 0x2400fff8 },
+ { 0x13001f3a, 0x2400fff8 },
+ { 0x13001f3b, 0x2400fff8 },
+ { 0x13001f3c, 0x2400fff8 },
+ { 0x13001f3d, 0x2400fff8 },
+ { 0x13001f3e, 0x2400fff8 },
+ { 0x13001f3f, 0x2400fff8 },
+ { 0x13001f40, 0x14000008 },
+ { 0x13001f41, 0x14000008 },
+ { 0x13001f42, 0x14000008 },
+ { 0x13001f43, 0x14000008 },
+ { 0x13001f44, 0x14000008 },
+ { 0x13001f45, 0x14000008 },
+ { 0x13001f48, 0x2400fff8 },
+ { 0x13001f49, 0x2400fff8 },
+ { 0x13001f4a, 0x2400fff8 },
+ { 0x13001f4b, 0x2400fff8 },
+ { 0x13001f4c, 0x2400fff8 },
+ { 0x13001f4d, 0x2400fff8 },
+ { 0x13001f50, 0x14000000 },
+ { 0x13001f51, 0x14000008 },
+ { 0x13001f52, 0x14000000 },
+ { 0x13001f53, 0x14000008 },
+ { 0x13001f54, 0x14000000 },
+ { 0x13001f55, 0x14000008 },
+ { 0x13001f56, 0x14000000 },
+ { 0x13001f57, 0x14000008 },
+ { 0x13001f59, 0x2400fff8 },
+ { 0x13001f5b, 0x2400fff8 },
+ { 0x13001f5d, 0x2400fff8 },
+ { 0x13001f5f, 0x2400fff8 },
+ { 0x13001f60, 0x14000008 },
+ { 0x13001f61, 0x14000008 },
+ { 0x13001f62, 0x14000008 },
+ { 0x13001f63, 0x14000008 },
+ { 0x13001f64, 0x14000008 },
+ { 0x13001f65, 0x14000008 },
+ { 0x13001f66, 0x14000008 },
+ { 0x13001f67, 0x14000008 },
+ { 0x13001f68, 0x2400fff8 },
+ { 0x13001f69, 0x2400fff8 },
+ { 0x13001f6a, 0x2400fff8 },
+ { 0x13001f6b, 0x2400fff8 },
+ { 0x13001f6c, 0x2400fff8 },
+ { 0x13001f6d, 0x2400fff8 },
+ { 0x13001f6e, 0x2400fff8 },
+ { 0x13001f6f, 0x2400fff8 },
+ { 0x13001f70, 0x1400004a },
+ { 0x13001f71, 0x1400004a },
+ { 0x13001f72, 0x14000056 },
+ { 0x13001f73, 0x14000056 },
+ { 0x13001f74, 0x14000056 },
+ { 0x13001f75, 0x14000056 },
+ { 0x13001f76, 0x14000064 },
+ { 0x13001f77, 0x14000064 },
+ { 0x13001f78, 0x14000080 },
+ { 0x13001f79, 0x14000080 },
+ { 0x13001f7a, 0x14000070 },
+ { 0x13001f7b, 0x14000070 },
+ { 0x13001f7c, 0x1400007e },
+ { 0x13001f7d, 0x1400007e },
+ { 0x13001f80, 0x14000008 },
+ { 0x13001f81, 0x14000008 },
+ { 0x13001f82, 0x14000008 },
+ { 0x13001f83, 0x14000008 },
+ { 0x13001f84, 0x14000008 },
+ { 0x13001f85, 0x14000008 },
+ { 0x13001f86, 0x14000008 },
+ { 0x13001f87, 0x14000008 },
+ { 0x13001f88, 0x2000fff8 },
+ { 0x13001f89, 0x2000fff8 },
+ { 0x13001f8a, 0x2000fff8 },
+ { 0x13001f8b, 0x2000fff8 },
+ { 0x13001f8c, 0x2000fff8 },
+ { 0x13001f8d, 0x2000fff8 },
+ { 0x13001f8e, 0x2000fff8 },
+ { 0x13001f8f, 0x2000fff8 },
+ { 0x13001f90, 0x14000008 },
+ { 0x13001f91, 0x14000008 },
+ { 0x13001f92, 0x14000008 },
+ { 0x13001f93, 0x14000008 },
+ { 0x13001f94, 0x14000008 },
+ { 0x13001f95, 0x14000008 },
+ { 0x13001f96, 0x14000008 },
+ { 0x13001f97, 0x14000008 },
+ { 0x13001f98, 0x2000fff8 },
+ { 0x13001f99, 0x2000fff8 },
+ { 0x13001f9a, 0x2000fff8 },
+ { 0x13001f9b, 0x2000fff8 },
+ { 0x13001f9c, 0x2000fff8 },
+ { 0x13001f9d, 0x2000fff8 },
+ { 0x13001f9e, 0x2000fff8 },
+ { 0x13001f9f, 0x2000fff8 },
+ { 0x13001fa0, 0x14000008 },
+ { 0x13001fa1, 0x14000008 },
+ { 0x13001fa2, 0x14000008 },
+ { 0x13001fa3, 0x14000008 },
+ { 0x13001fa4, 0x14000008 },
+ { 0x13001fa5, 0x14000008 },
+ { 0x13001fa6, 0x14000008 },
+ { 0x13001fa7, 0x14000008 },
+ { 0x13001fa8, 0x2000fff8 },
+ { 0x13001fa9, 0x2000fff8 },
+ { 0x13001faa, 0x2000fff8 },
+ { 0x13001fab, 0x2000fff8 },
+ { 0x13001fac, 0x2000fff8 },
+ { 0x13001fad, 0x2000fff8 },
+ { 0x13001fae, 0x2000fff8 },
+ { 0x13001faf, 0x2000fff8 },
+ { 0x13001fb0, 0x14000008 },
+ { 0x13001fb1, 0x14000008 },
+ { 0x13001fb2, 0x14000000 },
+ { 0x13001fb3, 0x14000009 },
+ { 0x13001fb4, 0x14000000 },
+ { 0x13801fb6, 0x14000001 },
+ { 0x13001fb8, 0x2400fff8 },
+ { 0x13001fb9, 0x2400fff8 },
+ { 0x13001fba, 0x2400ffb6 },
+ { 0x13001fbb, 0x2400ffb6 },
+ { 0x13001fbc, 0x2000fff7 },
+ { 0x13001fbd, 0x60000000 },
+ { 0x13001fbe, 0x1400e3db },
+ { 0x13801fbf, 0x60000002 },
+ { 0x13001fc2, 0x14000000 },
+ { 0x13001fc3, 0x14000009 },
+ { 0x13001fc4, 0x14000000 },
+ { 0x13801fc6, 0x14000001 },
+ { 0x13001fc8, 0x2400ffaa },
+ { 0x13001fc9, 0x2400ffaa },
+ { 0x13001fca, 0x2400ffaa },
+ { 0x13001fcb, 0x2400ffaa },
+ { 0x13001fcc, 0x2000fff7 },
+ { 0x13801fcd, 0x60000002 },
+ { 0x13001fd0, 0x14000008 },
+ { 0x13001fd1, 0x14000008 },
+ { 0x13801fd2, 0x14000001 },
+ { 0x13801fd6, 0x14000001 },
+ { 0x13001fd8, 0x2400fff8 },
+ { 0x13001fd9, 0x2400fff8 },
+ { 0x13001fda, 0x2400ff9c },
+ { 0x13001fdb, 0x2400ff9c },
+ { 0x13801fdd, 0x60000002 },
+ { 0x13001fe0, 0x14000008 },
+ { 0x13001fe1, 0x14000008 },
+ { 0x13801fe2, 0x14000002 },
+ { 0x13001fe5, 0x14000007 },
+ { 0x13801fe6, 0x14000001 },
+ { 0x13001fe8, 0x2400fff8 },
+ { 0x13001fe9, 0x2400fff8 },
+ { 0x13001fea, 0x2400ff90 },
+ { 0x13001feb, 0x2400ff90 },
+ { 0x13001fec, 0x2400fff9 },
+ { 0x13801fed, 0x60000002 },
+ { 0x13001ff2, 0x14000000 },
+ { 0x13001ff3, 0x14000009 },
+ { 0x13001ff4, 0x14000000 },
+ { 0x13801ff6, 0x14000001 },
+ { 0x13001ff8, 0x2400ff80 },
+ { 0x13001ff9, 0x2400ff80 },
+ { 0x13001ffa, 0x2400ff82 },
+ { 0x13001ffb, 0x2400ff82 },
+ { 0x13001ffc, 0x2000fff7 },
+ { 0x13801ffd, 0x60000001 },
+ { 0x09802000, 0x7400000a },
+ { 0x0980200b, 0x04000004 },
+ { 0x09802010, 0x44000005 },
+ { 0x09802016, 0x54000001 },
+ { 0x09002018, 0x50000000 },
+ { 0x09002019, 0x4c000000 },
+ { 0x0900201a, 0x58000000 },
+ { 0x0980201b, 0x50000001 },
+ { 0x0900201d, 0x4c000000 },
+ { 0x0900201e, 0x58000000 },
+ { 0x0900201f, 0x50000000 },
+ { 0x09802020, 0x54000007 },
+ { 0x09002028, 0x6c000000 },
+ { 0x09002029, 0x70000000 },
+ { 0x0980202a, 0x04000004 },
+ { 0x0900202f, 0x74000000 },
+ { 0x09802030, 0x54000008 },
+ { 0x09002039, 0x50000000 },
+ { 0x0900203a, 0x4c000000 },
+ { 0x0980203b, 0x54000003 },
+ { 0x0980203f, 0x40000001 },
+ { 0x09802041, 0x54000002 },
+ { 0x09002044, 0x64000000 },
+ { 0x09002045, 0x58000000 },
+ { 0x09002046, 0x48000000 },
+ { 0x09802047, 0x5400000a },
+ { 0x09002052, 0x64000000 },
+ { 0x09002053, 0x54000000 },
+ { 0x09002054, 0x40000000 },
+ { 0x09802055, 0x54000009 },
+ { 0x0900205f, 0x74000000 },
+ { 0x09802060, 0x04000003 },
+ { 0x0980206a, 0x04000005 },
+ { 0x09002070, 0x3c000000 },
+ { 0x21002071, 0x14000000 },
+ { 0x09802074, 0x3c000005 },
+ { 0x0980207a, 0x64000002 },
+ { 0x0900207d, 0x58000000 },
+ { 0x0900207e, 0x48000000 },
+ { 0x2100207f, 0x14000000 },
+ { 0x09802080, 0x3c000009 },
+ { 0x0980208a, 0x64000002 },
+ { 0x0900208d, 0x58000000 },
+ { 0x0900208e, 0x48000000 },
+ { 0x21802090, 0x18000004 },
+ { 0x098020a0, 0x5c000015 },
+ { 0x1b8020d0, 0x3000000c },
+ { 0x1b8020dd, 0x2c000003 },
+ { 0x1b0020e1, 0x30000000 },
+ { 0x1b8020e2, 0x2c000002 },
+ { 0x1b8020e5, 0x3000000a },
+ { 0x09802100, 0x68000001 },
+ { 0x09002102, 0x24000000 },
+ { 0x09802103, 0x68000003 },
+ { 0x09002107, 0x24000000 },
+ { 0x09802108, 0x68000001 },
+ { 0x0900210a, 0x14000000 },
+ { 0x0980210b, 0x24000002 },
+ { 0x0980210e, 0x14000001 },
+ { 0x09802110, 0x24000002 },
+ { 0x09002113, 0x14000000 },
+ { 0x09002114, 0x68000000 },
+ { 0x09002115, 0x24000000 },
+ { 0x09802116, 0x68000002 },
+ { 0x09802119, 0x24000004 },
+ { 0x0980211e, 0x68000005 },
+ { 0x09002124, 0x24000000 },
+ { 0x09002125, 0x68000000 },
+ { 0x13002126, 0x2400e2a3 },
+ { 0x09002127, 0x68000000 },
+ { 0x09002128, 0x24000000 },
+ { 0x09002129, 0x68000000 },
+ { 0x2100212a, 0x2400df41 },
+ { 0x2100212b, 0x2400dfba },
+ { 0x0980212c, 0x24000001 },
+ { 0x0900212e, 0x68000000 },
+ { 0x0900212f, 0x14000000 },
+ { 0x09802130, 0x24000001 },
+ { 0x21002132, 0x2400001c },
+ { 0x09002133, 0x24000000 },
+ { 0x09002134, 0x14000000 },
+ { 0x09802135, 0x1c000003 },
+ { 0x09002139, 0x14000000 },
+ { 0x0980213a, 0x68000001 },
+ { 0x0980213c, 0x14000001 },
+ { 0x0980213e, 0x24000001 },
+ { 0x09802140, 0x64000004 },
+ { 0x09002145, 0x24000000 },
+ { 0x09802146, 0x14000003 },
+ { 0x0900214a, 0x68000000 },
+ { 0x0900214b, 0x64000000 },
+ { 0x0980214c, 0x68000001 },
+ { 0x2100214e, 0x1400ffe4 },
+ { 0x09802153, 0x3c00000c },
+ { 0x09002160, 0x38000010 },
+ { 0x09002161, 0x38000010 },
+ { 0x09002162, 0x38000010 },
+ { 0x09002163, 0x38000010 },
+ { 0x09002164, 0x38000010 },
+ { 0x09002165, 0x38000010 },
+ { 0x09002166, 0x38000010 },
+ { 0x09002167, 0x38000010 },
+ { 0x09002168, 0x38000010 },
+ { 0x09002169, 0x38000010 },
+ { 0x0900216a, 0x38000010 },
+ { 0x0900216b, 0x38000010 },
+ { 0x0900216c, 0x38000010 },
+ { 0x0900216d, 0x38000010 },
+ { 0x0900216e, 0x38000010 },
+ { 0x0900216f, 0x38000010 },
+ { 0x09002170, 0x3800fff0 },
+ { 0x09002171, 0x3800fff0 },
+ { 0x09002172, 0x3800fff0 },
+ { 0x09002173, 0x3800fff0 },
+ { 0x09002174, 0x3800fff0 },
+ { 0x09002175, 0x3800fff0 },
+ { 0x09002176, 0x3800fff0 },
+ { 0x09002177, 0x3800fff0 },
+ { 0x09002178, 0x3800fff0 },
+ { 0x09002179, 0x3800fff0 },
+ { 0x0900217a, 0x3800fff0 },
+ { 0x0900217b, 0x3800fff0 },
+ { 0x0900217c, 0x3800fff0 },
+ { 0x0900217d, 0x3800fff0 },
+ { 0x0900217e, 0x3800fff0 },
+ { 0x0900217f, 0x3800fff0 },
+ { 0x09802180, 0x38000002 },
+ { 0x09002183, 0x24000001 },
+ { 0x21002184, 0x1400ffff },
+ { 0x09802190, 0x64000004 },
+ { 0x09802195, 0x68000004 },
+ { 0x0980219a, 0x64000001 },
+ { 0x0980219c, 0x68000003 },
+ { 0x090021a0, 0x64000000 },
+ { 0x098021a1, 0x68000001 },
+ { 0x090021a3, 0x64000000 },
+ { 0x098021a4, 0x68000001 },
+ { 0x090021a6, 0x64000000 },
+ { 0x098021a7, 0x68000006 },
+ { 0x090021ae, 0x64000000 },
+ { 0x098021af, 0x6800001e },
+ { 0x098021ce, 0x64000001 },
+ { 0x098021d0, 0x68000001 },
+ { 0x090021d2, 0x64000000 },
+ { 0x090021d3, 0x68000000 },
+ { 0x090021d4, 0x64000000 },
+ { 0x098021d5, 0x6800001e },
+ { 0x098021f4, 0x6400010b },
+ { 0x09802300, 0x68000007 },
+ { 0x09802308, 0x64000003 },
+ { 0x0980230c, 0x68000013 },
+ { 0x09802320, 0x64000001 },
+ { 0x09802322, 0x68000006 },
+ { 0x09002329, 0x58000000 },
+ { 0x0900232a, 0x48000000 },
+ { 0x0980232b, 0x68000050 },
+ { 0x0900237c, 0x64000000 },
+ { 0x0980237d, 0x6800001d },
+ { 0x0980239b, 0x64000018 },
+ { 0x098023b4, 0x68000027 },
+ { 0x098023dc, 0x64000005 },
+ { 0x098023e2, 0x68000005 },
+ { 0x09802400, 0x68000026 },
+ { 0x09802440, 0x6800000a },
+ { 0x09802460, 0x3c00003b },
+ { 0x0980249c, 0x68000019 },
+ { 0x090024b6, 0x6800001a },
+ { 0x090024b7, 0x6800001a },
+ { 0x090024b8, 0x6800001a },
+ { 0x090024b9, 0x6800001a },
+ { 0x090024ba, 0x6800001a },
+ { 0x090024bb, 0x6800001a },
+ { 0x090024bc, 0x6800001a },
+ { 0x090024bd, 0x6800001a },
+ { 0x090024be, 0x6800001a },
+ { 0x090024bf, 0x6800001a },
+ { 0x090024c0, 0x6800001a },
+ { 0x090024c1, 0x6800001a },
+ { 0x090024c2, 0x6800001a },
+ { 0x090024c3, 0x6800001a },
+ { 0x090024c4, 0x6800001a },
+ { 0x090024c5, 0x6800001a },
+ { 0x090024c6, 0x6800001a },
+ { 0x090024c7, 0x6800001a },
+ { 0x090024c8, 0x6800001a },
+ { 0x090024c9, 0x6800001a },
+ { 0x090024ca, 0x6800001a },
+ { 0x090024cb, 0x6800001a },
+ { 0x090024cc, 0x6800001a },
+ { 0x090024cd, 0x6800001a },
+ { 0x090024ce, 0x6800001a },
+ { 0x090024cf, 0x6800001a },
+ { 0x090024d0, 0x6800ffe6 },
+ { 0x090024d1, 0x6800ffe6 },
+ { 0x090024d2, 0x6800ffe6 },
+ { 0x090024d3, 0x6800ffe6 },
+ { 0x090024d4, 0x6800ffe6 },
+ { 0x090024d5, 0x6800ffe6 },
+ { 0x090024d6, 0x6800ffe6 },
+ { 0x090024d7, 0x6800ffe6 },
+ { 0x090024d8, 0x6800ffe6 },
+ { 0x090024d9, 0x6800ffe6 },
+ { 0x090024da, 0x6800ffe6 },
+ { 0x090024db, 0x6800ffe6 },
+ { 0x090024dc, 0x6800ffe6 },
+ { 0x090024dd, 0x6800ffe6 },
+ { 0x090024de, 0x6800ffe6 },
+ { 0x090024df, 0x6800ffe6 },
+ { 0x090024e0, 0x6800ffe6 },
+ { 0x090024e1, 0x6800ffe6 },
+ { 0x090024e2, 0x6800ffe6 },
+ { 0x090024e3, 0x6800ffe6 },
+ { 0x090024e4, 0x6800ffe6 },
+ { 0x090024e5, 0x6800ffe6 },
+ { 0x090024e6, 0x6800ffe6 },
+ { 0x090024e7, 0x6800ffe6 },
+ { 0x090024e8, 0x6800ffe6 },
+ { 0x090024e9, 0x6800ffe6 },
+ { 0x098024ea, 0x3c000015 },
+ { 0x09802500, 0x680000b6 },
+ { 0x090025b7, 0x64000000 },
+ { 0x098025b8, 0x68000008 },
+ { 0x090025c1, 0x64000000 },
+ { 0x098025c2, 0x68000035 },
+ { 0x098025f8, 0x64000007 },
+ { 0x09802600, 0x6800006e },
+ { 0x0900266f, 0x64000000 },
+ { 0x09802670, 0x6800002c },
+ { 0x098026a0, 0x68000012 },
+ { 0x09802701, 0x68000003 },
+ { 0x09802706, 0x68000003 },
+ { 0x0980270c, 0x6800001b },
+ { 0x09802729, 0x68000022 },
+ { 0x0900274d, 0x68000000 },
+ { 0x0980274f, 0x68000003 },
+ { 0x09002756, 0x68000000 },
+ { 0x09802758, 0x68000006 },
+ { 0x09802761, 0x68000006 },
+ { 0x09002768, 0x58000000 },
+ { 0x09002769, 0x48000000 },
+ { 0x0900276a, 0x58000000 },
+ { 0x0900276b, 0x48000000 },
+ { 0x0900276c, 0x58000000 },
+ { 0x0900276d, 0x48000000 },
+ { 0x0900276e, 0x58000000 },
+ { 0x0900276f, 0x48000000 },
+ { 0x09002770, 0x58000000 },
+ { 0x09002771, 0x48000000 },
+ { 0x09002772, 0x58000000 },
+ { 0x09002773, 0x48000000 },
+ { 0x09002774, 0x58000000 },
+ { 0x09002775, 0x48000000 },
+ { 0x09802776, 0x3c00001d },
+ { 0x09002794, 0x68000000 },
+ { 0x09802798, 0x68000017 },
+ { 0x098027b1, 0x6800000d },
+ { 0x098027c0, 0x64000004 },
+ { 0x090027c5, 0x58000000 },
+ { 0x090027c6, 0x48000000 },
+ { 0x098027c7, 0x64000003 },
+ { 0x098027d0, 0x64000015 },
+ { 0x090027e6, 0x58000000 },
+ { 0x090027e7, 0x48000000 },
+ { 0x090027e8, 0x58000000 },
+ { 0x090027e9, 0x48000000 },
+ { 0x090027ea, 0x58000000 },
+ { 0x090027eb, 0x48000000 },
+ { 0x098027f0, 0x6400000f },
+ { 0x04802800, 0x680000ff },
+ { 0x09802900, 0x64000082 },
+ { 0x09002983, 0x58000000 },
+ { 0x09002984, 0x48000000 },
+ { 0x09002985, 0x58000000 },
+ { 0x09002986, 0x48000000 },
+ { 0x09002987, 0x58000000 },
+ { 0x09002988, 0x48000000 },
+ { 0x09002989, 0x58000000 },
+ { 0x0900298a, 0x48000000 },
+ { 0x0900298b, 0x58000000 },
+ { 0x0900298c, 0x48000000 },
+ { 0x0900298d, 0x58000000 },
+ { 0x0900298e, 0x48000000 },
+ { 0x0900298f, 0x58000000 },
+ { 0x09002990, 0x48000000 },
+ { 0x09002991, 0x58000000 },
+ { 0x09002992, 0x48000000 },
+ { 0x09002993, 0x58000000 },
+ { 0x09002994, 0x48000000 },
+ { 0x09002995, 0x58000000 },
+ { 0x09002996, 0x48000000 },
+ { 0x09002997, 0x58000000 },
+ { 0x09002998, 0x48000000 },
+ { 0x09802999, 0x6400003e },
+ { 0x090029d8, 0x58000000 },
+ { 0x090029d9, 0x48000000 },
+ { 0x090029da, 0x58000000 },
+ { 0x090029db, 0x48000000 },
+ { 0x098029dc, 0x6400001f },
+ { 0x090029fc, 0x58000000 },
+ { 0x090029fd, 0x48000000 },
+ { 0x098029fe, 0x64000101 },
+ { 0x09802b00, 0x6800001a },
+ { 0x09802b20, 0x68000003 },
+ { 0x11002c00, 0x24000030 },
+ { 0x11002c01, 0x24000030 },
+ { 0x11002c02, 0x24000030 },
+ { 0x11002c03, 0x24000030 },
+ { 0x11002c04, 0x24000030 },
+ { 0x11002c05, 0x24000030 },
+ { 0x11002c06, 0x24000030 },
+ { 0x11002c07, 0x24000030 },
+ { 0x11002c08, 0x24000030 },
+ { 0x11002c09, 0x24000030 },
+ { 0x11002c0a, 0x24000030 },
+ { 0x11002c0b, 0x24000030 },
+ { 0x11002c0c, 0x24000030 },
+ { 0x11002c0d, 0x24000030 },
+ { 0x11002c0e, 0x24000030 },
+ { 0x11002c0f, 0x24000030 },
+ { 0x11002c10, 0x24000030 },
+ { 0x11002c11, 0x24000030 },
+ { 0x11002c12, 0x24000030 },
+ { 0x11002c13, 0x24000030 },
+ { 0x11002c14, 0x24000030 },
+ { 0x11002c15, 0x24000030 },
+ { 0x11002c16, 0x24000030 },
+ { 0x11002c17, 0x24000030 },
+ { 0x11002c18, 0x24000030 },
+ { 0x11002c19, 0x24000030 },
+ { 0x11002c1a, 0x24000030 },
+ { 0x11002c1b, 0x24000030 },
+ { 0x11002c1c, 0x24000030 },
+ { 0x11002c1d, 0x24000030 },
+ { 0x11002c1e, 0x24000030 },
+ { 0x11002c1f, 0x24000030 },
+ { 0x11002c20, 0x24000030 },
+ { 0x11002c21, 0x24000030 },
+ { 0x11002c22, 0x24000030 },
+ { 0x11002c23, 0x24000030 },
+ { 0x11002c24, 0x24000030 },
+ { 0x11002c25, 0x24000030 },
+ { 0x11002c26, 0x24000030 },
+ { 0x11002c27, 0x24000030 },
+ { 0x11002c28, 0x24000030 },
+ { 0x11002c29, 0x24000030 },
+ { 0x11002c2a, 0x24000030 },
+ { 0x11002c2b, 0x24000030 },
+ { 0x11002c2c, 0x24000030 },
+ { 0x11002c2d, 0x24000030 },
+ { 0x11002c2e, 0x24000030 },
+ { 0x11002c30, 0x1400ffd0 },
+ { 0x11002c31, 0x1400ffd0 },
+ { 0x11002c32, 0x1400ffd0 },
+ { 0x11002c33, 0x1400ffd0 },
+ { 0x11002c34, 0x1400ffd0 },
+ { 0x11002c35, 0x1400ffd0 },
+ { 0x11002c36, 0x1400ffd0 },
+ { 0x11002c37, 0x1400ffd0 },
+ { 0x11002c38, 0x1400ffd0 },
+ { 0x11002c39, 0x1400ffd0 },
+ { 0x11002c3a, 0x1400ffd0 },
+ { 0x11002c3b, 0x1400ffd0 },
+ { 0x11002c3c, 0x1400ffd0 },
+ { 0x11002c3d, 0x1400ffd0 },
+ { 0x11002c3e, 0x1400ffd0 },
+ { 0x11002c3f, 0x1400ffd0 },
+ { 0x11002c40, 0x1400ffd0 },
+ { 0x11002c41, 0x1400ffd0 },
+ { 0x11002c42, 0x1400ffd0 },
+ { 0x11002c43, 0x1400ffd0 },
+ { 0x11002c44, 0x1400ffd0 },
+ { 0x11002c45, 0x1400ffd0 },
+ { 0x11002c46, 0x1400ffd0 },
+ { 0x11002c47, 0x1400ffd0 },
+ { 0x11002c48, 0x1400ffd0 },
+ { 0x11002c49, 0x1400ffd0 },
+ { 0x11002c4a, 0x1400ffd0 },
+ { 0x11002c4b, 0x1400ffd0 },
+ { 0x11002c4c, 0x1400ffd0 },
+ { 0x11002c4d, 0x1400ffd0 },
+ { 0x11002c4e, 0x1400ffd0 },
+ { 0x11002c4f, 0x1400ffd0 },
+ { 0x11002c50, 0x1400ffd0 },
+ { 0x11002c51, 0x1400ffd0 },
+ { 0x11002c52, 0x1400ffd0 },
+ { 0x11002c53, 0x1400ffd0 },
+ { 0x11002c54, 0x1400ffd0 },
+ { 0x11002c55, 0x1400ffd0 },
+ { 0x11002c56, 0x1400ffd0 },
+ { 0x11002c57, 0x1400ffd0 },
+ { 0x11002c58, 0x1400ffd0 },
+ { 0x11002c59, 0x1400ffd0 },
+ { 0x11002c5a, 0x1400ffd0 },
+ { 0x11002c5b, 0x1400ffd0 },
+ { 0x11002c5c, 0x1400ffd0 },
+ { 0x11002c5d, 0x1400ffd0 },
+ { 0x11002c5e, 0x1400ffd0 },
+ { 0x21002c60, 0x24000001 },
+ { 0x21002c61, 0x1400ffff },
+ { 0x21002c62, 0x2400d609 },
+ { 0x21002c63, 0x2400f11a },
+ { 0x21002c64, 0x2400d619 },
+ { 0x21002c65, 0x1400d5d5 },
+ { 0x21002c66, 0x1400d5d8 },
+ { 0x21002c67, 0x24000001 },
+ { 0x21002c68, 0x1400ffff },
+ { 0x21002c69, 0x24000001 },
+ { 0x21002c6a, 0x1400ffff },
+ { 0x21002c6b, 0x24000001 },
+ { 0x21002c6c, 0x1400ffff },
+ { 0x21002c74, 0x14000000 },
+ { 0x21002c75, 0x24000001 },
+ { 0x21002c76, 0x1400ffff },
+ { 0x21002c77, 0x14000000 },
+ { 0x0a002c80, 0x24000001 },
+ { 0x0a002c81, 0x1400ffff },
+ { 0x0a002c82, 0x24000001 },
+ { 0x0a002c83, 0x1400ffff },
+ { 0x0a002c84, 0x24000001 },
+ { 0x0a002c85, 0x1400ffff },
+ { 0x0a002c86, 0x24000001 },
+ { 0x0a002c87, 0x1400ffff },
+ { 0x0a002c88, 0x24000001 },
+ { 0x0a002c89, 0x1400ffff },
+ { 0x0a002c8a, 0x24000001 },
+ { 0x0a002c8b, 0x1400ffff },
+ { 0x0a002c8c, 0x24000001 },
+ { 0x0a002c8d, 0x1400ffff },
+ { 0x0a002c8e, 0x24000001 },
+ { 0x0a002c8f, 0x1400ffff },
+ { 0x0a002c90, 0x24000001 },
+ { 0x0a002c91, 0x1400ffff },
+ { 0x0a002c92, 0x24000001 },
+ { 0x0a002c93, 0x1400ffff },
+ { 0x0a002c94, 0x24000001 },
+ { 0x0a002c95, 0x1400ffff },
+ { 0x0a002c96, 0x24000001 },
+ { 0x0a002c97, 0x1400ffff },
+ { 0x0a002c98, 0x24000001 },
+ { 0x0a002c99, 0x1400ffff },
+ { 0x0a002c9a, 0x24000001 },
+ { 0x0a002c9b, 0x1400ffff },
+ { 0x0a002c9c, 0x24000001 },
+ { 0x0a002c9d, 0x1400ffff },
+ { 0x0a002c9e, 0x24000001 },
+ { 0x0a002c9f, 0x1400ffff },
+ { 0x0a002ca0, 0x24000001 },
+ { 0x0a002ca1, 0x1400ffff },
+ { 0x0a002ca2, 0x24000001 },
+ { 0x0a002ca3, 0x1400ffff },
+ { 0x0a002ca4, 0x24000001 },
+ { 0x0a002ca5, 0x1400ffff },
+ { 0x0a002ca6, 0x24000001 },
+ { 0x0a002ca7, 0x1400ffff },
+ { 0x0a002ca8, 0x24000001 },
+ { 0x0a002ca9, 0x1400ffff },
+ { 0x0a002caa, 0x24000001 },
+ { 0x0a002cab, 0x1400ffff },
+ { 0x0a002cac, 0x24000001 },
+ { 0x0a002cad, 0x1400ffff },
+ { 0x0a002cae, 0x24000001 },
+ { 0x0a002caf, 0x1400ffff },
+ { 0x0a002cb0, 0x24000001 },
+ { 0x0a002cb1, 0x1400ffff },
+ { 0x0a002cb2, 0x24000001 },
+ { 0x0a002cb3, 0x1400ffff },
+ { 0x0a002cb4, 0x24000001 },
+ { 0x0a002cb5, 0x1400ffff },
+ { 0x0a002cb6, 0x24000001 },
+ { 0x0a002cb7, 0x1400ffff },
+ { 0x0a002cb8, 0x24000001 },
+ { 0x0a002cb9, 0x1400ffff },
+ { 0x0a002cba, 0x24000001 },
+ { 0x0a002cbb, 0x1400ffff },
+ { 0x0a002cbc, 0x24000001 },
+ { 0x0a002cbd, 0x1400ffff },
+ { 0x0a002cbe, 0x24000001 },
+ { 0x0a002cbf, 0x1400ffff },
+ { 0x0a002cc0, 0x24000001 },
+ { 0x0a002cc1, 0x1400ffff },
+ { 0x0a002cc2, 0x24000001 },
+ { 0x0a002cc3, 0x1400ffff },
+ { 0x0a002cc4, 0x24000001 },
+ { 0x0a002cc5, 0x1400ffff },
+ { 0x0a002cc6, 0x24000001 },
+ { 0x0a002cc7, 0x1400ffff },
+ { 0x0a002cc8, 0x24000001 },
+ { 0x0a002cc9, 0x1400ffff },
+ { 0x0a002cca, 0x24000001 },
+ { 0x0a002ccb, 0x1400ffff },
+ { 0x0a002ccc, 0x24000001 },
+ { 0x0a002ccd, 0x1400ffff },
+ { 0x0a002cce, 0x24000001 },
+ { 0x0a002ccf, 0x1400ffff },
+ { 0x0a002cd0, 0x24000001 },
+ { 0x0a002cd1, 0x1400ffff },
+ { 0x0a002cd2, 0x24000001 },
+ { 0x0a002cd3, 0x1400ffff },
+ { 0x0a002cd4, 0x24000001 },
+ { 0x0a002cd5, 0x1400ffff },
+ { 0x0a002cd6, 0x24000001 },
+ { 0x0a002cd7, 0x1400ffff },
+ { 0x0a002cd8, 0x24000001 },
+ { 0x0a002cd9, 0x1400ffff },
+ { 0x0a002cda, 0x24000001 },
+ { 0x0a002cdb, 0x1400ffff },
+ { 0x0a002cdc, 0x24000001 },
+ { 0x0a002cdd, 0x1400ffff },
+ { 0x0a002cde, 0x24000001 },
+ { 0x0a002cdf, 0x1400ffff },
+ { 0x0a002ce0, 0x24000001 },
+ { 0x0a002ce1, 0x1400ffff },
+ { 0x0a002ce2, 0x24000001 },
+ { 0x0a002ce3, 0x1400ffff },
+ { 0x0a002ce4, 0x14000000 },
+ { 0x0a802ce5, 0x68000005 },
+ { 0x0a802cf9, 0x54000003 },
+ { 0x0a002cfd, 0x3c000000 },
+ { 0x0a802cfe, 0x54000001 },
+ { 0x10002d00, 0x1400e3a0 },
+ { 0x10002d01, 0x1400e3a0 },
+ { 0x10002d02, 0x1400e3a0 },
+ { 0x10002d03, 0x1400e3a0 },
+ { 0x10002d04, 0x1400e3a0 },
+ { 0x10002d05, 0x1400e3a0 },
+ { 0x10002d06, 0x1400e3a0 },
+ { 0x10002d07, 0x1400e3a0 },
+ { 0x10002d08, 0x1400e3a0 },
+ { 0x10002d09, 0x1400e3a0 },
+ { 0x10002d0a, 0x1400e3a0 },
+ { 0x10002d0b, 0x1400e3a0 },
+ { 0x10002d0c, 0x1400e3a0 },
+ { 0x10002d0d, 0x1400e3a0 },
+ { 0x10002d0e, 0x1400e3a0 },
+ { 0x10002d0f, 0x1400e3a0 },
+ { 0x10002d10, 0x1400e3a0 },
+ { 0x10002d11, 0x1400e3a0 },
+ { 0x10002d12, 0x1400e3a0 },
+ { 0x10002d13, 0x1400e3a0 },
+ { 0x10002d14, 0x1400e3a0 },
+ { 0x10002d15, 0x1400e3a0 },
+ { 0x10002d16, 0x1400e3a0 },
+ { 0x10002d17, 0x1400e3a0 },
+ { 0x10002d18, 0x1400e3a0 },
+ { 0x10002d19, 0x1400e3a0 },
+ { 0x10002d1a, 0x1400e3a0 },
+ { 0x10002d1b, 0x1400e3a0 },
+ { 0x10002d1c, 0x1400e3a0 },
+ { 0x10002d1d, 0x1400e3a0 },
+ { 0x10002d1e, 0x1400e3a0 },
+ { 0x10002d1f, 0x1400e3a0 },
+ { 0x10002d20, 0x1400e3a0 },
+ { 0x10002d21, 0x1400e3a0 },
+ { 0x10002d22, 0x1400e3a0 },
+ { 0x10002d23, 0x1400e3a0 },
+ { 0x10002d24, 0x1400e3a0 },
+ { 0x10002d25, 0x1400e3a0 },
+ { 0x3a802d30, 0x1c000035 },
+ { 0x3a002d6f, 0x18000000 },
+ { 0x0f802d80, 0x1c000016 },
+ { 0x0f802da0, 0x1c000006 },
+ { 0x0f802da8, 0x1c000006 },
+ { 0x0f802db0, 0x1c000006 },
+ { 0x0f802db8, 0x1c000006 },
+ { 0x0f802dc0, 0x1c000006 },
+ { 0x0f802dc8, 0x1c000006 },
+ { 0x0f802dd0, 0x1c000006 },
+ { 0x0f802dd8, 0x1c000006 },
+ { 0x09802e00, 0x54000001 },
+ { 0x09002e02, 0x50000000 },
+ { 0x09002e03, 0x4c000000 },
+ { 0x09002e04, 0x50000000 },
+ { 0x09002e05, 0x4c000000 },
+ { 0x09802e06, 0x54000002 },
+ { 0x09002e09, 0x50000000 },
+ { 0x09002e0a, 0x4c000000 },
+ { 0x09002e0b, 0x54000000 },
+ { 0x09002e0c, 0x50000000 },
+ { 0x09002e0d, 0x4c000000 },
+ { 0x09802e0e, 0x54000008 },
+ { 0x09002e17, 0x44000000 },
+ { 0x09002e1c, 0x50000000 },
+ { 0x09002e1d, 0x4c000000 },
+ { 0x16802e80, 0x68000019 },
+ { 0x16802e9b, 0x68000058 },
+ { 0x16802f00, 0x680000d5 },
+ { 0x09802ff0, 0x6800000b },
+ { 0x09003000, 0x74000000 },
+ { 0x09803001, 0x54000002 },
+ { 0x09003004, 0x68000000 },
+ { 0x16003005, 0x18000000 },
+ { 0x09003006, 0x1c000000 },
+ { 0x16003007, 0x38000000 },
+ { 0x09003008, 0x58000000 },
+ { 0x09003009, 0x48000000 },
+ { 0x0900300a, 0x58000000 },
+ { 0x0900300b, 0x48000000 },
+ { 0x0900300c, 0x58000000 },
+ { 0x0900300d, 0x48000000 },
+ { 0x0900300e, 0x58000000 },
+ { 0x0900300f, 0x48000000 },
+ { 0x09003010, 0x58000000 },
+ { 0x09003011, 0x48000000 },
+ { 0x09803012, 0x68000001 },
+ { 0x09003014, 0x58000000 },
+ { 0x09003015, 0x48000000 },
+ { 0x09003016, 0x58000000 },
+ { 0x09003017, 0x48000000 },
+ { 0x09003018, 0x58000000 },
+ { 0x09003019, 0x48000000 },
+ { 0x0900301a, 0x58000000 },
+ { 0x0900301b, 0x48000000 },
+ { 0x0900301c, 0x44000000 },
+ { 0x0900301d, 0x58000000 },
+ { 0x0980301e, 0x48000001 },
+ { 0x09003020, 0x68000000 },
+ { 0x16803021, 0x38000008 },
+ { 0x1b80302a, 0x30000005 },
+ { 0x09003030, 0x44000000 },
+ { 0x09803031, 0x18000004 },
+ { 0x09803036, 0x68000001 },
+ { 0x16803038, 0x38000002 },
+ { 0x1600303b, 0x18000000 },
+ { 0x0900303c, 0x1c000000 },
+ { 0x0900303d, 0x54000000 },
+ { 0x0980303e, 0x68000001 },
+ { 0x1a803041, 0x1c000055 },
+ { 0x1b803099, 0x30000001 },
+ { 0x0980309b, 0x60000001 },
+ { 0x1a80309d, 0x18000001 },
+ { 0x1a00309f, 0x1c000000 },
+ { 0x090030a0, 0x44000000 },
+ { 0x1d8030a1, 0x1c000059 },
+ { 0x090030fb, 0x54000000 },
+ { 0x098030fc, 0x18000002 },
+ { 0x1d0030ff, 0x1c000000 },
+ { 0x03803105, 0x1c000027 },
+ { 0x17803131, 0x1c00005d },
+ { 0x09803190, 0x68000001 },
+ { 0x09803192, 0x3c000003 },
+ { 0x09803196, 0x68000009 },
+ { 0x038031a0, 0x1c000017 },
+ { 0x098031c0, 0x6800000f },
+ { 0x1d8031f0, 0x1c00000f },
+ { 0x17803200, 0x6800001e },
+ { 0x09803220, 0x3c000009 },
+ { 0x0980322a, 0x68000019 },
+ { 0x09003250, 0x68000000 },
+ { 0x09803251, 0x3c00000e },
+ { 0x17803260, 0x6800001f },
+ { 0x09803280, 0x3c000009 },
+ { 0x0980328a, 0x68000026 },
+ { 0x098032b1, 0x3c00000e },
+ { 0x098032c0, 0x6800003e },
+ { 0x09803300, 0x680000ff },
+ { 0x16803400, 0x1c0019b5 },
+ { 0x09804dc0, 0x6800003f },
+ { 0x16804e00, 0x1c0051bb },
+ { 0x3c80a000, 0x1c000014 },
+ { 0x3c00a015, 0x18000000 },
+ { 0x3c80a016, 0x1c000476 },
+ { 0x3c80a490, 0x68000036 },
+ { 0x0980a700, 0x60000016 },
+ { 0x0980a717, 0x18000003 },
+ { 0x0980a720, 0x60000001 },
+ { 0x3080a800, 0x1c000001 },
+ { 0x3000a802, 0x28000000 },
+ { 0x3080a803, 0x1c000002 },
+ { 0x3000a806, 0x30000000 },
+ { 0x3080a807, 0x1c000003 },
+ { 0x3000a80b, 0x30000000 },
+ { 0x3080a80c, 0x1c000016 },
+ { 0x3080a823, 0x28000001 },
+ { 0x3080a825, 0x30000001 },
+ { 0x3000a827, 0x28000000 },
+ { 0x3080a828, 0x68000003 },
+ { 0x4080a840, 0x1c000033 },
+ { 0x4080a874, 0x54000003 },
+ { 0x1780ac00, 0x1c002ba3 },
+ { 0x0980d800, 0x1000037f },
+ { 0x0980db80, 0x1000007f },
+ { 0x0980dc00, 0x100003ff },
+ { 0x0980e000, 0x0c0018ff },
+ { 0x1680f900, 0x1c00012d },
+ { 0x1680fa30, 0x1c00003a },
+ { 0x1680fa70, 0x1c000069 },
+ { 0x2180fb00, 0x14000006 },
+ { 0x0180fb13, 0x14000004 },
+ { 0x1900fb1d, 0x1c000000 },
+ { 0x1900fb1e, 0x30000000 },
+ { 0x1980fb1f, 0x1c000009 },
+ { 0x1900fb29, 0x64000000 },
+ { 0x1980fb2a, 0x1c00000c },
+ { 0x1980fb38, 0x1c000004 },
+ { 0x1900fb3e, 0x1c000000 },
+ { 0x1980fb40, 0x1c000001 },
+ { 0x1980fb43, 0x1c000001 },
+ { 0x1980fb46, 0x1c00006b },
+ { 0x0080fbd3, 0x1c00016a },
+ { 0x0900fd3e, 0x58000000 },
+ { 0x0900fd3f, 0x48000000 },
+ { 0x0080fd50, 0x1c00003f },
+ { 0x0080fd92, 0x1c000035 },
+ { 0x0080fdf0, 0x1c00000b },
+ { 0x0000fdfc, 0x5c000000 },
+ { 0x0900fdfd, 0x68000000 },
+ { 0x1b80fe00, 0x3000000f },
+ { 0x0980fe10, 0x54000006 },
+ { 0x0900fe17, 0x58000000 },
+ { 0x0900fe18, 0x48000000 },
+ { 0x0900fe19, 0x54000000 },
+ { 0x1b80fe20, 0x30000003 },
+ { 0x0900fe30, 0x54000000 },
+ { 0x0980fe31, 0x44000001 },
+ { 0x0980fe33, 0x40000001 },
+ { 0x0900fe35, 0x58000000 },
+ { 0x0900fe36, 0x48000000 },
+ { 0x0900fe37, 0x58000000 },
+ { 0x0900fe38, 0x48000000 },
+ { 0x0900fe39, 0x58000000 },
+ { 0x0900fe3a, 0x48000000 },
+ { 0x0900fe3b, 0x58000000 },
+ { 0x0900fe3c, 0x48000000 },
+ { 0x0900fe3d, 0x58000000 },
+ { 0x0900fe3e, 0x48000000 },
+ { 0x0900fe3f, 0x58000000 },
+ { 0x0900fe40, 0x48000000 },
+ { 0x0900fe41, 0x58000000 },
+ { 0x0900fe42, 0x48000000 },
+ { 0x0900fe43, 0x58000000 },
+ { 0x0900fe44, 0x48000000 },
+ { 0x0980fe45, 0x54000001 },
+ { 0x0900fe47, 0x58000000 },
+ { 0x0900fe48, 0x48000000 },
+ { 0x0980fe49, 0x54000003 },
+ { 0x0980fe4d, 0x40000002 },
+ { 0x0980fe50, 0x54000002 },
+ { 0x0980fe54, 0x54000003 },
+ { 0x0900fe58, 0x44000000 },
+ { 0x0900fe59, 0x58000000 },
+ { 0x0900fe5a, 0x48000000 },
+ { 0x0900fe5b, 0x58000000 },
+ { 0x0900fe5c, 0x48000000 },
+ { 0x0900fe5d, 0x58000000 },
+ { 0x0900fe5e, 0x48000000 },
+ { 0x0980fe5f, 0x54000002 },
+ { 0x0900fe62, 0x64000000 },
+ { 0x0900fe63, 0x44000000 },
+ { 0x0980fe64, 0x64000002 },
+ { 0x0900fe68, 0x54000000 },
+ { 0x0900fe69, 0x5c000000 },
+ { 0x0980fe6a, 0x54000001 },
+ { 0x0080fe70, 0x1c000004 },
+ { 0x0080fe76, 0x1c000086 },
+ { 0x0900feff, 0x04000000 },
+ { 0x0980ff01, 0x54000002 },
+ { 0x0900ff04, 0x5c000000 },
+ { 0x0980ff05, 0x54000002 },
+ { 0x0900ff08, 0x58000000 },
+ { 0x0900ff09, 0x48000000 },
+ { 0x0900ff0a, 0x54000000 },
+ { 0x0900ff0b, 0x64000000 },
+ { 0x0900ff0c, 0x54000000 },
+ { 0x0900ff0d, 0x44000000 },
+ { 0x0980ff0e, 0x54000001 },
+ { 0x0980ff10, 0x34000009 },
+ { 0x0980ff1a, 0x54000001 },
+ { 0x0980ff1c, 0x64000002 },
+ { 0x0980ff1f, 0x54000001 },
+ { 0x2100ff21, 0x24000020 },
+ { 0x2100ff22, 0x24000020 },
+ { 0x2100ff23, 0x24000020 },
+ { 0x2100ff24, 0x24000020 },
+ { 0x2100ff25, 0x24000020 },
+ { 0x2100ff26, 0x24000020 },
+ { 0x2100ff27, 0x24000020 },
+ { 0x2100ff28, 0x24000020 },
+ { 0x2100ff29, 0x24000020 },
+ { 0x2100ff2a, 0x24000020 },
+ { 0x2100ff2b, 0x24000020 },
+ { 0x2100ff2c, 0x24000020 },
+ { 0x2100ff2d, 0x24000020 },
+ { 0x2100ff2e, 0x24000020 },
+ { 0x2100ff2f, 0x24000020 },
+ { 0x2100ff30, 0x24000020 },
+ { 0x2100ff31, 0x24000020 },
+ { 0x2100ff32, 0x24000020 },
+ { 0x2100ff33, 0x24000020 },
+ { 0x2100ff34, 0x24000020 },
+ { 0x2100ff35, 0x24000020 },
+ { 0x2100ff36, 0x24000020 },
+ { 0x2100ff37, 0x24000020 },
+ { 0x2100ff38, 0x24000020 },
+ { 0x2100ff39, 0x24000020 },
+ { 0x2100ff3a, 0x24000020 },
+ { 0x0900ff3b, 0x58000000 },
+ { 0x0900ff3c, 0x54000000 },
+ { 0x0900ff3d, 0x48000000 },
+ { 0x0900ff3e, 0x60000000 },
+ { 0x0900ff3f, 0x40000000 },
+ { 0x0900ff40, 0x60000000 },
+ { 0x2100ff41, 0x1400ffe0 },
+ { 0x2100ff42, 0x1400ffe0 },
+ { 0x2100ff43, 0x1400ffe0 },
+ { 0x2100ff44, 0x1400ffe0 },
+ { 0x2100ff45, 0x1400ffe0 },
+ { 0x2100ff46, 0x1400ffe0 },
+ { 0x2100ff47, 0x1400ffe0 },
+ { 0x2100ff48, 0x1400ffe0 },
+ { 0x2100ff49, 0x1400ffe0 },
+ { 0x2100ff4a, 0x1400ffe0 },
+ { 0x2100ff4b, 0x1400ffe0 },
+ { 0x2100ff4c, 0x1400ffe0 },
+ { 0x2100ff4d, 0x1400ffe0 },
+ { 0x2100ff4e, 0x1400ffe0 },
+ { 0x2100ff4f, 0x1400ffe0 },
+ { 0x2100ff50, 0x1400ffe0 },
+ { 0x2100ff51, 0x1400ffe0 },
+ { 0x2100ff52, 0x1400ffe0 },
+ { 0x2100ff53, 0x1400ffe0 },
+ { 0x2100ff54, 0x1400ffe0 },
+ { 0x2100ff55, 0x1400ffe0 },
+ { 0x2100ff56, 0x1400ffe0 },
+ { 0x2100ff57, 0x1400ffe0 },
+ { 0x2100ff58, 0x1400ffe0 },
+ { 0x2100ff59, 0x1400ffe0 },
+ { 0x2100ff5a, 0x1400ffe0 },
+ { 0x0900ff5b, 0x58000000 },
+ { 0x0900ff5c, 0x64000000 },
+ { 0x0900ff5d, 0x48000000 },
+ { 0x0900ff5e, 0x64000000 },
+ { 0x0900ff5f, 0x58000000 },
+ { 0x0900ff60, 0x48000000 },
+ { 0x0900ff61, 0x54000000 },
+ { 0x0900ff62, 0x58000000 },
+ { 0x0900ff63, 0x48000000 },
+ { 0x0980ff64, 0x54000001 },
+ { 0x1d80ff66, 0x1c000009 },
+ { 0x0900ff70, 0x18000000 },
+ { 0x1d80ff71, 0x1c00002c },
+ { 0x0980ff9e, 0x18000001 },
+ { 0x1780ffa0, 0x1c00001e },
+ { 0x1780ffc2, 0x1c000005 },
+ { 0x1780ffca, 0x1c000005 },
+ { 0x1780ffd2, 0x1c000005 },
+ { 0x1780ffda, 0x1c000002 },
+ { 0x0980ffe0, 0x5c000001 },
+ { 0x0900ffe2, 0x64000000 },
+ { 0x0900ffe3, 0x60000000 },
+ { 0x0900ffe4, 0x68000000 },
+ { 0x0980ffe5, 0x5c000001 },
+ { 0x0900ffe8, 0x68000000 },
+ { 0x0980ffe9, 0x64000003 },
+ { 0x0980ffed, 0x68000001 },
+ { 0x0980fff9, 0x04000002 },
+ { 0x0980fffc, 0x68000001 },
+ { 0x23810000, 0x1c00000b },
+ { 0x2381000d, 0x1c000019 },
+ { 0x23810028, 0x1c000012 },
+ { 0x2381003c, 0x1c000001 },
+ { 0x2381003f, 0x1c00000e },
+ { 0x23810050, 0x1c00000d },
+ { 0x23810080, 0x1c00007a },
+ { 0x09810100, 0x54000001 },
+ { 0x09010102, 0x68000000 },
+ { 0x09810107, 0x3c00002c },
+ { 0x09810137, 0x68000008 },
+ { 0x13810140, 0x38000034 },
+ { 0x13810175, 0x3c000003 },
+ { 0x13810179, 0x68000010 },
+ { 0x1301018a, 0x3c000000 },
+ { 0x29810300, 0x1c00001e },
+ { 0x29810320, 0x3c000003 },
+ { 0x12810330, 0x1c000010 },
+ { 0x12010341, 0x38000000 },
+ { 0x12810342, 0x1c000007 },
+ { 0x1201034a, 0x38000000 },
+ { 0x3b810380, 0x1c00001d },
+ { 0x3b01039f, 0x54000000 },
+ { 0x2a8103a0, 0x1c000023 },
+ { 0x2a8103c8, 0x1c000007 },
+ { 0x2a0103d0, 0x54000000 },
+ { 0x2a8103d1, 0x38000004 },
+ { 0x0d010400, 0x24000028 },
+ { 0x0d010401, 0x24000028 },
+ { 0x0d010402, 0x24000028 },
+ { 0x0d010403, 0x24000028 },
+ { 0x0d010404, 0x24000028 },
+ { 0x0d010405, 0x24000028 },
+ { 0x0d010406, 0x24000028 },
+ { 0x0d010407, 0x24000028 },
+ { 0x0d010408, 0x24000028 },
+ { 0x0d010409, 0x24000028 },
+ { 0x0d01040a, 0x24000028 },
+ { 0x0d01040b, 0x24000028 },
+ { 0x0d01040c, 0x24000028 },
+ { 0x0d01040d, 0x24000028 },
+ { 0x0d01040e, 0x24000028 },
+ { 0x0d01040f, 0x24000028 },
+ { 0x0d010410, 0x24000028 },
+ { 0x0d010411, 0x24000028 },
+ { 0x0d010412, 0x24000028 },
+ { 0x0d010413, 0x24000028 },
+ { 0x0d010414, 0x24000028 },
+ { 0x0d010415, 0x24000028 },
+ { 0x0d010416, 0x24000028 },
+ { 0x0d010417, 0x24000028 },
+ { 0x0d010418, 0x24000028 },
+ { 0x0d010419, 0x24000028 },
+ { 0x0d01041a, 0x24000028 },
+ { 0x0d01041b, 0x24000028 },
+ { 0x0d01041c, 0x24000028 },
+ { 0x0d01041d, 0x24000028 },
+ { 0x0d01041e, 0x24000028 },
+ { 0x0d01041f, 0x24000028 },
+ { 0x0d010420, 0x24000028 },
+ { 0x0d010421, 0x24000028 },
+ { 0x0d010422, 0x24000028 },
+ { 0x0d010423, 0x24000028 },
+ { 0x0d010424, 0x24000028 },
+ { 0x0d010425, 0x24000028 },
+ { 0x0d010426, 0x24000028 },
+ { 0x0d010427, 0x24000028 },
+ { 0x0d010428, 0x1400ffd8 },
+ { 0x0d010429, 0x1400ffd8 },
+ { 0x0d01042a, 0x1400ffd8 },
+ { 0x0d01042b, 0x1400ffd8 },
+ { 0x0d01042c, 0x1400ffd8 },
+ { 0x0d01042d, 0x1400ffd8 },
+ { 0x0d01042e, 0x1400ffd8 },
+ { 0x0d01042f, 0x1400ffd8 },
+ { 0x0d010430, 0x1400ffd8 },
+ { 0x0d010431, 0x1400ffd8 },
+ { 0x0d010432, 0x1400ffd8 },
+ { 0x0d010433, 0x1400ffd8 },
+ { 0x0d010434, 0x1400ffd8 },
+ { 0x0d010435, 0x1400ffd8 },
+ { 0x0d010436, 0x1400ffd8 },
+ { 0x0d010437, 0x1400ffd8 },
+ { 0x0d010438, 0x1400ffd8 },
+ { 0x0d010439, 0x1400ffd8 },
+ { 0x0d01043a, 0x1400ffd8 },
+ { 0x0d01043b, 0x1400ffd8 },
+ { 0x0d01043c, 0x1400ffd8 },
+ { 0x0d01043d, 0x1400ffd8 },
+ { 0x0d01043e, 0x1400ffd8 },
+ { 0x0d01043f, 0x1400ffd8 },
+ { 0x0d010440, 0x1400ffd8 },
+ { 0x0d010441, 0x1400ffd8 },
+ { 0x0d010442, 0x1400ffd8 },
+ { 0x0d010443, 0x1400ffd8 },
+ { 0x0d010444, 0x1400ffd8 },
+ { 0x0d010445, 0x1400ffd8 },
+ { 0x0d010446, 0x1400ffd8 },
+ { 0x0d010447, 0x1400ffd8 },
+ { 0x0d010448, 0x1400ffd8 },
+ { 0x0d010449, 0x1400ffd8 },
+ { 0x0d01044a, 0x1400ffd8 },
+ { 0x0d01044b, 0x1400ffd8 },
+ { 0x0d01044c, 0x1400ffd8 },
+ { 0x0d01044d, 0x1400ffd8 },
+ { 0x0d01044e, 0x1400ffd8 },
+ { 0x0d01044f, 0x1400ffd8 },
+ { 0x2e810450, 0x1c00004d },
+ { 0x2c8104a0, 0x34000009 },
+ { 0x0b810800, 0x1c000005 },
+ { 0x0b010808, 0x1c000000 },
+ { 0x0b81080a, 0x1c00002b },
+ { 0x0b810837, 0x1c000001 },
+ { 0x0b01083c, 0x1c000000 },
+ { 0x0b01083f, 0x1c000000 },
+ { 0x41810900, 0x1c000015 },
+ { 0x41810916, 0x3c000003 },
+ { 0x4101091f, 0x54000000 },
+ { 0x1e010a00, 0x1c000000 },
+ { 0x1e810a01, 0x30000002 },
+ { 0x1e810a05, 0x30000001 },
+ { 0x1e810a0c, 0x30000003 },
+ { 0x1e810a10, 0x1c000003 },
+ { 0x1e810a15, 0x1c000002 },
+ { 0x1e810a19, 0x1c00001a },
+ { 0x1e810a38, 0x30000002 },
+ { 0x1e010a3f, 0x30000000 },
+ { 0x1e810a40, 0x3c000007 },
+ { 0x1e810a50, 0x54000008 },
+ { 0x3e812000, 0x1c00036e },
+ { 0x3e812400, 0x38000062 },
+ { 0x3e812470, 0x54000003 },
+ { 0x0981d000, 0x680000f5 },
+ { 0x0981d100, 0x68000026 },
+ { 0x0981d12a, 0x6800003a },
+ { 0x0981d165, 0x28000001 },
+ { 0x1b81d167, 0x30000002 },
+ { 0x0981d16a, 0x68000002 },
+ { 0x0981d16d, 0x28000005 },
+ { 0x0981d173, 0x04000007 },
+ { 0x1b81d17b, 0x30000007 },
+ { 0x0981d183, 0x68000001 },
+ { 0x1b81d185, 0x30000006 },
+ { 0x0981d18c, 0x6800001d },
+ { 0x1b81d1aa, 0x30000003 },
+ { 0x0981d1ae, 0x6800002f },
+ { 0x1381d200, 0x68000041 },
+ { 0x1381d242, 0x30000002 },
+ { 0x1301d245, 0x68000000 },
+ { 0x0981d300, 0x68000056 },
+ { 0x0981d360, 0x3c000011 },
+ { 0x0981d400, 0x24000019 },
+ { 0x0981d41a, 0x14000019 },
+ { 0x0981d434, 0x24000019 },
+ { 0x0981d44e, 0x14000006 },
+ { 0x0981d456, 0x14000011 },
+ { 0x0981d468, 0x24000019 },
+ { 0x0981d482, 0x14000019 },
+ { 0x0901d49c, 0x24000000 },
+ { 0x0981d49e, 0x24000001 },
+ { 0x0901d4a2, 0x24000000 },
+ { 0x0981d4a5, 0x24000001 },
+ { 0x0981d4a9, 0x24000003 },
+ { 0x0981d4ae, 0x24000007 },
+ { 0x0981d4b6, 0x14000003 },
+ { 0x0901d4bb, 0x14000000 },
+ { 0x0981d4bd, 0x14000006 },
+ { 0x0981d4c5, 0x1400000a },
+ { 0x0981d4d0, 0x24000019 },
+ { 0x0981d4ea, 0x14000019 },
+ { 0x0981d504, 0x24000001 },
+ { 0x0981d507, 0x24000003 },
+ { 0x0981d50d, 0x24000007 },
+ { 0x0981d516, 0x24000006 },
+ { 0x0981d51e, 0x14000019 },
+ { 0x0981d538, 0x24000001 },
+ { 0x0981d53b, 0x24000003 },
+ { 0x0981d540, 0x24000004 },
+ { 0x0901d546, 0x24000000 },
+ { 0x0981d54a, 0x24000006 },
+ { 0x0981d552, 0x14000019 },
+ { 0x0981d56c, 0x24000019 },
+ { 0x0981d586, 0x14000019 },
+ { 0x0981d5a0, 0x24000019 },
+ { 0x0981d5ba, 0x14000019 },
+ { 0x0981d5d4, 0x24000019 },
+ { 0x0981d5ee, 0x14000019 },
+ { 0x0981d608, 0x24000019 },
+ { 0x0981d622, 0x14000019 },
+ { 0x0981d63c, 0x24000019 },
+ { 0x0981d656, 0x14000019 },
+ { 0x0981d670, 0x24000019 },
+ { 0x0981d68a, 0x1400001b },
+ { 0x0981d6a8, 0x24000018 },
+ { 0x0901d6c1, 0x64000000 },
+ { 0x0981d6c2, 0x14000018 },
+ { 0x0901d6db, 0x64000000 },
+ { 0x0981d6dc, 0x14000005 },
+ { 0x0981d6e2, 0x24000018 },
+ { 0x0901d6fb, 0x64000000 },
+ { 0x0981d6fc, 0x14000018 },
+ { 0x0901d715, 0x64000000 },
+ { 0x0981d716, 0x14000005 },
+ { 0x0981d71c, 0x24000018 },
+ { 0x0901d735, 0x64000000 },
+ { 0x0981d736, 0x14000018 },
+ { 0x0901d74f, 0x64000000 },
+ { 0x0981d750, 0x14000005 },
+ { 0x0981d756, 0x24000018 },
+ { 0x0901d76f, 0x64000000 },
+ { 0x0981d770, 0x14000018 },
+ { 0x0901d789, 0x64000000 },
+ { 0x0981d78a, 0x14000005 },
+ { 0x0981d790, 0x24000018 },
+ { 0x0901d7a9, 0x64000000 },
+ { 0x0981d7aa, 0x14000018 },
+ { 0x0901d7c3, 0x64000000 },
+ { 0x0981d7c4, 0x14000005 },
+ { 0x0901d7ca, 0x24000000 },
+ { 0x0901d7cb, 0x14000000 },
+ { 0x0981d7ce, 0x34000031 },
+ { 0x16820000, 0x1c00a6d6 },
+ { 0x1682f800, 0x1c00021d },
+ { 0x090e0001, 0x04000000 },
+ { 0x098e0020, 0x0400005f },
+ { 0x1b8e0100, 0x300000ef },
+ { 0x098f0000, 0x0c00fffd },
+ { 0x09900000, 0x0c00fffd },
+};
diff --git a/src/plugins/PamAuth/Makefile b/src/plugins/PamAuth/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/plugins/PamAuth/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/plugins/PamAuth/Makefile.inc b/src/plugins/PamAuth/Makefile.inc
new file mode 100644
index 0000000..07ce480
--- /dev/null
+++ b/src/plugins/PamAuth/Makefile.inc
@@ -0,0 +1,7 @@
+all: $(BUILDDIR)pamauth$(DLSUFFICS)
+
+pamauth$(OBJSUFFICS): pamauth.c
+ $(CC) $(DCFLAGS) $(CFLAGS) pamauth.c
+
+$(BUILDDIR)pamauth$(DLSUFFICS): pamauth$(OBJSUFFICS)
+ $(LN) $(LNOUT)../../$(BUILDDIR)pamauth$(DLSUFFICS) $(LDFLAGS) $(DLFLAGS) -lpam pamauth$(OBJSUFFICS)
diff --git a/src/plugins/PamAuth/PAMAUTH.TXT b/src/plugins/PamAuth/PAMAUTH.TXT
new file mode 100644
index 0000000..82b5bf4
--- /dev/null
+++ b/src/plugins/PamAuth/PAMAUTH.TXT
@@ -0,0 +1,30 @@
+ðÌÁÇÉÎ PAM Á×ÔÏÒÉÚÁÃÉÉ ÄÌÑ 3proxy (ïó *NIX)
+(c) Kirill Lopuchov lopuchov@mail.ru
+
+
+ ïÐÉÓÁÎÉÅ
+òÁÂÏÔÁÅÔ ÔÏÌØËÏ ÎÁ *NIX ÓÉÓÔÅÍÁÈ . òÁÂÏÔÏÓÐÏÓÏÂÎÏÓÔØ ÐÒÏ×ÅÒÑÌÁÓØ ÎÁ
+freebsd 5.2 É Linux Debian 4.
+
+
+ îÁÓÔÒÏÊËÁ PAM
+
+îÁÓÔÒÁÉ×ÁÅÍ PAM ÓÅÒ×ÉÓ ÄÌÑ 3proxy ÎÁ ÐÒÉÍÅÒÅ ÄÌÑ Linux debian 4 , ÓÏÚÄÁÅÍ ÆÁÊÌ
+/etc/pam.d/3proxy. ðÒÏÐÉÓÙ×ÁÅÍ × ÎÅÍ ÓÌÅÄÕÀÝÕÀ ÓÔÒÏËÕ
+
+@include common-auth
+ îÁÓÔÒÏÊËÁ ÐÌÁÇÉÎÁ
+
+----------------------------3proxy.cfg-------------------------------
+# start - ÉÍÑ ÐÒÏÃÅÄÕÒÙ ÉÎÉÃÉÁÌÉÚÁÃÉÉ ÐÌÁÇÉÎÁ
+# 3proxy - ÉÍÑ ÓÅÒ×ÉÓÁ PAM
+
+plugin "pamauth.so" start 3proxy
+
+# ÒÅËÏÍÅÎÄÕÅÔÓÑ ×ËÌÀÞÁÔØ ËÅÛÉÒÏ×ÁÎÉÅ Á×ÔÏÒÉÚÁÃÉÉ
+authcache user,password 60
+auth cache pam
+allow *
+proxy -p3128
+
+----------------------------3proxy.cfg-------------------------------
\ No newline at end of file
diff --git a/src/plugins/PamAuth/pamauth.c b/src/plugins/PamAuth/pamauth.c
new file mode 100644
index 0000000..252fadb
--- /dev/null
+++ b/src/plugins/PamAuth/pamauth.c
@@ -0,0 +1,140 @@
+/* plugin for 3proxy with PAM auth only for *NIX (linux,*bsd)
+Kirill Lopuchov
+
+ Compile with: gcc -shared -o pamauth.so pamauth.c -lpam -DNOODBC
+*/
+
+#include "../../structures.h"
+#include
+#include
+#include
+#include
+#include
+
+
+
+
+static int already_loaded = 0;
+
+static struct auth pamauth;
+#ifdef USERCASE
+static int usercaselow = 0;
+#edif
+static unsigned char *service=NULL;
+static struct pluginlink * pl;
+
+
+
+
+static char *password = NULL;
+
+
+static int password_conversation ( int num_msg, const struct pam_message **msg,
+ struct pam_response **resp,
+ void *appdata_ptr)
+ {
+ if (num_msg != 1 || msg[0]->msg_style != PAM_PROMPT_ECHO_OFF)
+ {
+ return PAM_CONV_ERR;
+ }
+ if (!appdata_ptr) appdata_ptr = password;
+ if (!appdata_ptr)
+ {
+ return PAM_CONV_ERR;
+ }
+ *resp = calloc (num_msg, sizeof (struct pam_response));
+ if (!*resp)
+ {
+ return PAM_CONV_ERR;
+ }
+ (*resp)[0].resp = strdup ((char *) appdata_ptr);
+ (*resp)[0].resp_retcode = 0;
+ return ((*resp)[0].resp ? PAM_SUCCESS : PAM_CONV_ERR);
+ }
+
+#ifdef USERCASE
+static void lower (char *string)
+{
+ int length, i;
+
+ length = strlen(string);
+ for (i=0; iusername || !param->password) return 4;
+ /*if(strlen(param->password)==0) return 4;*/
+
+ #ifdef USERCASE
+ if (usercaselow > 0)
+ { lower(param->username); }
+ #endif
+
+ /*start process auth */
+ conv.appdata_ptr = (char *) param->password;
+
+ if (!pamh)
+ {
+ retval = pam_start ((char *)service, "3proxy@" , &conv, &pamh);
+ }
+ if (retval == PAM_SUCCESS)
+ retval = pam_set_item (pamh, PAM_USER, param->username);
+/*fprintf(stderr,"pam_set_item1 rc=%d\n",retval);*/
+ if (retval == PAM_SUCCESS)
+ retval = pam_set_item (pamh, PAM_CONV, &conv);
+/*fprintf(stderr,"pam_set_item2 rc=%d\n",retval); */
+ if (retval == PAM_SUCCESS)
+ retval = pam_authenticate (pamh, 0);
+/*fprintf(stderr,"pam_authenticate rc=%d\n",retval);*/
+
+ if (retval == PAM_SUCCESS) { /*auth OK*/ rc=0; }
+ else { /*auth ERR*/ rc=5; }
+
+ if (pamh)
+ retval = pam_end (pamh, retval);
+ if (retval != PAM_SUCCESS)
+ { pamh = NULL; }
+
+ return rc;
+
+}
+
+/*------------------------------- MAIN --------------------------------------
+ start plugin init */
+int start(struct pluginlink * pluginlink, int argc, unsigned char** argv)
+{
+
+
+ if(argc < 2) return 1;
+ pl = pluginlink;
+ if(service) pl->myfree(service);
+ service=pl->mystrdup(argv[1]);
+
+ if (already_loaded) { return (0); }
+
+ already_loaded = 1;
+
+ pamauth.authenticate = pamfunc;
+ pamauth.authorize = pluginlink->checkACL;
+ pamauth.desc = "pam";
+ pamauth.next = pluginlink->authfuncs->next;
+ pluginlink->authfuncs->next = &pamauth;
+
+ return 0;
+}
diff --git a/src/plugins/SSLPlugin/CVS/Entries b/src/plugins/SSLPlugin/CVS/Entries
new file mode 100644
index 0000000..1784810
--- /dev/null
+++ b/src/plugins/SSLPlugin/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/src/plugins/SSLPlugin/CVS/Repository b/src/plugins/SSLPlugin/CVS/Repository
new file mode 100644
index 0000000..08dc566
--- /dev/null
+++ b/src/plugins/SSLPlugin/CVS/Repository
@@ -0,0 +1 @@
+3proxy-0.5a/src/plugins/SSLPlugin
diff --git a/src/plugins/SSLPlugin/CVS/Root b/src/plugins/SSLPlugin/CVS/Root
new file mode 100644
index 0000000..43e0a15
--- /dev/null
+++ b/src/plugins/SSLPlugin/CVS/Root
@@ -0,0 +1 @@
+/cygdrive/m/MEDIA/H/CVS
diff --git a/src/plugins/SSLPlugin/Makefile b/src/plugins/SSLPlugin/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/plugins/SSLPlugin/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/plugins/SSLPlugin/Makefile.inc b/src/plugins/SSLPlugin/Makefile.inc
new file mode 100644
index 0000000..1afc984
--- /dev/null
+++ b/src/plugins/SSLPlugin/Makefile.inc
@@ -0,0 +1,14 @@
+all: $(BUILDDIR)SSLPlugin$(DLSUFFICS)
+
+
+
+ssl_plugin$(OBJSUFFICS): ssl_plugin.c
+ $(CC) $(DCFLAGS) $(CFLAGS) ssl_plugin.c
+
+my_ssl$(OBJSUFFICS): my_ssl.c
+ $(CC) $(DCFLAGS) $(CFLAGS) my_ssl.c
+
+
+$(BUILDDIR)SSLPlugin$(DLSUFFICS): ssl_plugin$(OBJSUFFICS) my_ssl$(OBJSUFFICS)
+ $(LN) $(LNOUT)../../$(BUILDDIR)SSLPlugin$(DLSUFFICS) $(LDFLAGS) $(DLFLAGS) ssl_plugin$(OBJSUFFICS) my_ssl$(OBJSUFFICS) $(LIBS)
+
\ No newline at end of file
diff --git a/src/plugins/SSLPlugin/Makefile.var b/src/plugins/SSLPlugin/Makefile.var
new file mode 100644
index 0000000..cc48314
--- /dev/null
+++ b/src/plugins/SSLPlugin/Makefile.var
@@ -0,0 +1,37 @@
+VERFILE = version.obj ../3proxy.RES
+#$Id: Makefile.msvc,v 1.17 2010-11-11 14:44:11 v.dubrovin Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin lastFripper FilePlugin SSLPlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/src/plugins/SSLPlugin/my_ssl.c b/src/plugins/SSLPlugin/my_ssl.c
new file mode 100644
index 0000000..d3a4799
--- /dev/null
+++ b/src/plugins/SSLPlugin/my_ssl.c
@@ -0,0 +1,453 @@
+
+#define _CRT_SECURE_NO_WARNINGS
+
+#include "../../structures.h"
+#include "../../proxy.h"
+#include "my_ssl.h"
+
+#include
+#include
+#include
+
+#include
+#include
+#include
+#include
+#include
+#include
+
+typedef struct _ssl_conn {
+ SSL_CTX *ctx;
+ SSL *ssl;
+} ssl_conn;
+
+static X509 *CA_cert = NULL;
+static EVP_PKEY *CA_key = NULL;
+static EVP_PKEY *server_key = NULL;
+static X509_NAME *name = NULL;
+
+pthread_mutex_t ssl_file_mutex;
+
+
+static char errbuf[256];
+
+static char hexMap[] = {
+ '0', '1', '2', '3', '4', '5', '6', '7',
+ '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'
+ };
+
+static BIO *bio_err=NULL;
+
+
+static size_t bin2hex (const unsigned char* bin, size_t bin_length, char* str, size_t str_length)
+{
+ char *p;
+ size_t i;
+
+ if ( str_length < ( bin_length+1) )
+ return 0;
+
+ p = str;
+ for ( i=0; i < bin_length; ++i )
+ {
+ *p++ = hexMap[*bin >> 4];
+ *p++ = hexMap[*bin & 0xf];
+ ++bin;
+ }
+
+ *p = 0;
+
+ return p - str;
+}
+
+static int add_ext(X509 *cert, int nid, char *value)
+{
+ X509_EXTENSION *ex;
+ X509V3_CTX ctx;
+ /* This sets the 'context' of the extensions. */
+ /* No configuration database */
+ X509V3_set_ctx_nodb(&ctx);
+ /* Issuer and subject certs: both the target since it is self signed,
+ * no request and no CRL
+ */
+ X509V3_set_ctx(&ctx, cert, cert, NULL, NULL, 0);
+ ex = X509V3_EXT_conf_nid(NULL, &ctx, nid, value);
+ if (!ex)
+ return 0;
+
+ X509_add_ext(cert,ex,-1);
+ X509_EXTENSION_free(ex);
+ return 1;
+}
+
+extern char *cert_path;
+
+void del_ext(X509 *dst_cert, int nid, int where){
+ int ex;
+
+ ex = X509_get_ext_by_NID(dst_cert, nid, where);
+ if(ex>=0){
+ X509_EXTENSION *ext;
+ if((ext = X509_delete_ext(dst_cert, ex))) X509_EXTENSION_free(ext);
+ }
+
+}
+
+SSL_CERT ssl_copy_cert(SSL_CERT cert)
+{
+ int err = -1;
+ FILE *fcache;
+ X509 *src_cert = (X509 *) cert;
+ X509 *dst_cert = NULL;
+
+ EVP_PKEY *pk = NULL;
+ RSA *rsa = NULL;
+
+ unsigned char p1[] = "RU";
+ unsigned char p2[] = "3proxy";
+ unsigned char p3[] = "3proxy CA";
+
+ static char hash_name[sizeof(src_cert->sha1_hash)*2 + 1];
+ static char cache_name[200];
+
+ pthread_mutex_lock(&ssl_file_mutex);
+ bin2hex(src_cert->sha1_hash, sizeof(src_cert->sha1_hash), hash_name, sizeof(hash_name));
+ sprintf(cache_name, "%s%s.pem", cert_path, hash_name);
+ /* check if certificate is already cached */
+ fcache = fopen(cache_name, "rb");
+ if ( fcache != NULL ) {
+ dst_cert = PEM_read_X509(fcache, &dst_cert, NULL, NULL);
+ fclose(fcache);
+ if ( dst_cert != NULL ){
+ pthread_mutex_unlock(&ssl_file_mutex);
+ return dst_cert;
+ }
+ }
+ pthread_mutex_unlock(&ssl_file_mutex);
+
+ /* proceed if certificate is not cached */
+ dst_cert = X509_dup(src_cert);
+ if ( dst_cert == NULL ) {
+ return NULL;
+ }
+ del_ext(dst_cert, NID_crl_distribution_points, -1);
+ del_ext(dst_cert, NID_info_access, -1);
+ del_ext(dst_cert, NID_authority_key_identifier, -1);
+ del_ext(dst_cert, NID_certificate_policies, 0);
+
+ err = X509_set_pubkey(dst_cert, server_key);
+ if ( err == 0 ) {
+ X509_free(dst_cert);
+ return NULL;
+ }
+
+
+ /* Its self signed so set the issuer name to be the same as the
+ * subject.
+ */
+ err = X509_set_issuer_name(dst_cert, name);
+ if(!err){
+ X509_free(dst_cert);
+ return NULL;
+ }
+ err = X509_digest(dst_cert, EVP_sha1(), dst_cert->sha1_hash, NULL);
+ if(!err){
+ X509_free(dst_cert);
+ return NULL;
+ }
+ err = X509_sign(dst_cert, CA_key, EVP_sha1());
+ if(!err){
+ X509_free(dst_cert);
+ return NULL;
+ }
+
+ /* write to cache */
+
+ pthread_mutex_lock(&ssl_file_mutex);
+ fcache = fopen(cache_name, "wb");
+ if ( fcache != NULL ) {
+ PEM_write_X509(fcache, dst_cert);
+ fclose(fcache);
+ }
+ pthread_mutex_unlock(&ssl_file_mutex);
+ return dst_cert;
+}
+
+
+SSL_CONN ssl_handshake_to_server(SOCKET s, SSL_CERT *server_cert, char **errSSL)
+{
+ int err = 0;
+ X509 *cert;
+ ssl_conn *conn;
+
+ *errSSL = NULL;
+
+ conn = (ssl_conn *)malloc(sizeof(ssl_conn));
+ if ( conn == NULL ){
+ return NULL;
+ }
+
+ conn->ctx = SSL_CTX_new(SSLv23_client_method());
+ if ( conn->ctx == NULL ) {
+ free(conn);
+ return NULL;
+ }
+
+ conn->ssl = SSL_new(conn->ctx);
+ if ( conn->ssl == NULL ) {
+ SSL_CTX_free(conn->ctx);
+ free(conn);
+ return NULL;
+ }
+
+ if(!SSL_set_fd(conn->ssl, s)){
+ ssl_conn_free(conn);
+ return NULL;
+ }
+ err = SSL_connect(conn->ssl);
+ if ( err == -1 ) {
+ *errSSL = ERR_error_string(ERR_get_error(), errbuf);
+ ssl_conn_free(conn);
+ return NULL;
+ }
+
+ cert = SSL_get_peer_certificate(conn->ssl);
+
+ /* TODO: Verify certificate */
+
+ *server_cert = cert;
+
+ return conn;
+}
+
+SSL_CONN ssl_handshake_to_client(SOCKET s, SSL_CERT server_cert, char** errSSL)
+{
+ int err = 0;
+ X509 *cert;
+ ssl_conn *conn;
+
+ *errSSL = NULL;
+
+ conn = (ssl_conn *)malloc(sizeof(ssl_conn));
+ if ( conn == NULL )
+ return NULL;
+
+ conn->ctx = SSL_CTX_new(SSLv23_server_method());
+ if ( conn->ctx == NULL ) {
+ free(conn);
+ return NULL;
+ }
+
+ err = SSL_CTX_use_certificate(conn->ctx, (X509 *) server_cert);
+ if ( err <= 0 ) {
+ SSL_CTX_free(conn->ctx);
+ free(conn);
+ return NULL;
+ }
+
+ err = SSL_CTX_use_PrivateKey(conn->ctx, server_key);
+ if ( err <= 0 ) {
+ SSL_CTX_free(conn->ctx);
+ free(conn);
+ return NULL;
+ }
+/*
+ err = SSL_CTX_load_verify_locations(conn->ctx, "3proxy.pem",
+ NULL);
+ if ( err <= 0 ) {
+ SSL_CTX_free(conn->ctx);
+ free(conn);
+ return NULL;
+ }
+*/
+
+ conn->ssl = SSL_new(conn->ctx);
+ if ( conn->ssl == NULL ) {
+ SSL_CTX_free(conn->ctx);
+ free(conn);
+ return NULL;
+ }
+
+ SSL_set_fd(conn->ssl, (int)s);
+ err = SSL_accept(conn->ssl);
+ if ( err <= 0 ) {
+ *errSSL = ERR_error_string(ERR_get_error(), errbuf);
+ ssl_conn_free(conn);
+ return NULL;
+ }
+
+ //
+ // client certificate
+ // TODO: is it required?
+ //
+ cert = SSL_get_peer_certificate(conn->ssl);
+
+ if ( cert != NULL )
+ X509_free(cert);
+
+ return conn;
+}
+
+int ssl_read(SSL_CONN connection, void * buf, int bufsize)
+{
+ ssl_conn *conn = (ssl_conn *) connection;
+
+ return SSL_read(conn->ssl, buf, bufsize);
+}
+
+int ssl_write(SSL_CONN connection, void * buf, int bufsize)
+{
+ ssl_conn *conn = (ssl_conn *) connection;
+
+ return SSL_write(conn->ssl, buf, bufsize);
+}
+int ssl_pending(SSL_CONN connection)
+{
+ ssl_conn *conn = (ssl_conn *) connection;
+
+ return SSL_pending(conn->ssl);
+}
+
+void ssl_conn_free(SSL_CONN connection)
+{
+ ssl_conn *conn = (ssl_conn *) connection;
+
+ SSL_shutdown(conn->ssl);
+ SSL_free(conn->ssl);
+ SSL_CTX_free(conn->ctx);
+ free(conn);
+}
+
+void _ssl_cert_free(SSL_CERT cert)
+{
+ X509_free((X509 *)cert);
+}
+
+
+
+/* This array will store all of the mutexes available to OpenSSL. */
+static pthread_mutex_t *mutex_buf= NULL;
+
+
+static void locking_function(int mode, int n, const char * file, int line)
+{
+ if (mode & CRYPTO_LOCK)
+ pthread_mutex_lock(mutex_buf + n);
+ else
+ pthread_mutex_unlock(mutex_buf + n);
+}
+
+static unsigned long id_function(void)
+{
+#ifdef _WIN32
+ return ((unsigned long)GetCurrentThreadId());
+#else
+ return ((unsigned long)pthread_self());
+#endif
+}
+
+int thread_setup(void)
+{
+ int i;
+
+ mutex_buf = malloc(CRYPTO_num_locks( ) * sizeof(pthread_mutex_t));
+ if (!mutex_buf)
+ return 0;
+ for (i = 0; i < CRYPTO_num_locks( ); i++)
+ pthread_mutex_init(mutex_buf +i, NULL);
+ CRYPTO_set_id_callback(id_function);
+ CRYPTO_set_locking_callback(locking_function);
+ return 1;
+}
+
+int thread_cleanup(void)
+{
+ int i;
+
+ if (!mutex_buf)
+ return 0;
+ CRYPTO_set_id_callback(NULL);
+ CRYPTO_set_locking_callback(NULL);
+ for (i = 0; i < CRYPTO_num_locks( ); i++)
+ pthread_mutex_destroy(mutex_buf +i);
+ free(mutex_buf);
+ mutex_buf = NULL;
+ return 1;
+}
+
+
+
+int ssl_file_init = 0;
+
+
+void ssl_init(void)
+{
+ FILE *f;
+ static char fname[200];
+
+ if(!ssl_file_init++)pthread_mutex_init(&ssl_file_mutex, NULL);
+
+ pthread_mutex_lock(&ssl_file_mutex);
+ thread_setup();
+
+ SSLeay_add_ssl_algorithms();
+ SSL_load_error_strings();
+
+ sprintf(fname, "%.128s3proxy.pem", cert_path);
+ f = fopen(fname, "r");
+ if ( f != NULL ) {
+ PEM_read_X509(f, &CA_cert, NULL, NULL);
+ fclose(f);
+ }
+ else {
+ fprintf(stderr, "failed to open: %s\n", fname);
+ }
+ name = X509_get_subject_name(CA_cert);
+
+ sprintf(fname, "%.128s3proxy.key", cert_path);
+ f = fopen(fname, "rb");
+ if ( f != NULL ) {
+ CA_key = PEM_read_PrivateKey(f, &CA_key, NULL, NULL);
+ fclose(f);
+ }
+ else {
+ fprintf(stderr, "failed to open: %s\n", fname);
+ }
+
+ sprintf(fname, "%.128sserver.key", cert_path);
+ f = fopen(fname, "rb");
+ if ( f != NULL ) {
+ server_key = PEM_read_PrivateKey(f, &server_key, NULL, NULL);
+ fclose(f);
+ }
+ else {
+ fprintf(stderr, "failed to open: %s\n", fname);
+ }
+ if(!CA_cert || !CA_key || !server_key){
+ fprintf(stderr, "failed to init SSL certificate / keys\n");
+ }
+
+ bio_err=BIO_new_fp(stderr,BIO_NOCLOSE);
+ pthread_mutex_unlock(&ssl_file_mutex);
+}
+
+void ssl_release(void)
+{
+ pthread_mutex_lock(&ssl_file_mutex);
+ if ( CA_cert != NULL ) {
+ X509_free(CA_cert);
+ CA_cert = NULL;
+ }
+
+ if ( CA_key != NULL ) {
+ EVP_PKEY_free(CA_key);
+ CA_key = NULL;
+ }
+
+ if ( server_key != NULL ) {
+ EVP_PKEY_free(server_key);
+ server_key = NULL;
+ }
+ thread_cleanup();
+ pthread_mutex_unlock(&ssl_file_mutex);
+}
diff --git a/src/plugins/SSLPlugin/my_ssl.h b/src/plugins/SSLPlugin/my_ssl.h
new file mode 100644
index 0000000..6e41929
--- /dev/null
+++ b/src/plugins/SSLPlugin/my_ssl.h
@@ -0,0 +1,43 @@
+#ifndef __my_ssl_h__
+#define __my_ssl_h__
+
+//
+// opaque connection structure
+//
+typedef void *SSL_CONN;
+//
+// opaque certificate structure
+//
+typedef void *SSL_CERT;
+
+//
+// Create copy of certificate signed by "other" CA
+//
+SSL_CERT ssl_copy_cert(SSL_CERT cert);
+
+//
+// SSL/TLS handshakes
+//
+SSL_CONN ssl_handshake_to_server(SOCKET s, SSL_CERT *server_cert, char **errSSL);
+SSL_CONN ssl_handshake_to_client(SOCKET s, SSL_CERT server_cert, char **errSSL);
+
+//
+// SSL/TLS Read/Write
+//
+int ssl_read(SSL_CONN connection, void * buf, int bufsize);
+int ssl_write(SSL_CONN connection, void * buf, int bufsize);
+int ssl_pending(SSL_CONN connection);
+
+//
+// Release of opaque structures
+//
+void ssl_conn_free(SSL_CONN connection);
+void _ssl_cert_free(SSL_CERT cert);
+
+//
+// Global (de)initialization
+//
+void ssl_init(void);
+void ssl_release(void);
+
+#endif // __my_ssl_h__
\ No newline at end of file
diff --git a/src/plugins/SSLPlugin/ssl_plugin.c b/src/plugins/SSLPlugin/ssl_plugin.c
new file mode 100644
index 0000000..ffdee78
--- /dev/null
+++ b/src/plugins/SSLPlugin/ssl_plugin.c
@@ -0,0 +1,371 @@
+/*
+ 3APA3A simpliest proxy server
+ (c) 2007-2008 by ZARAZA <3APA3A@security.nnov.ru>
+
+ please read License Agreement
+
+ $Id: ssl_plugin.c,v 1.9 2010-11-11 11:32:33 v.dubrovin Exp $
+*/
+
+#include "../../structures.h"
+#include "../../proxy.h"
+#include /* SSLeay stuff */
+#include
+#include
+#include
+#include
+#include
+#include "my_ssl.h"
+
+#ifndef _WIN32
+#define WINAPI
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifndef isnumber
+#define isnumber(i_n_arg) ((i_n_arg>='0')&&(i_n_arg<='9'))
+#endif
+
+PROXYFUNC tcppmfunc, proxyfunc, smtppfunc, ftpprfunc;
+
+static struct pluginlink * pl;
+
+pthread_mutex_t ssl_mutex;
+
+static int ssl_loaded = 0;
+static int ssl_connect_timeout = 0;
+char *cert_path = "";
+
+typedef struct _ssl_conn {
+ struct SSL_CTX *ctx;
+ struct SSL *ssl;
+} ssl_conn;
+
+struct SSLqueue {
+ struct SSLqueue *next;
+ SOCKET s;
+ SSL_CERT cert;
+ SSL_CONN conn;
+ struct clientparam* param;
+} *SSLq = NULL;
+
+
+/*
+ Todo: use hashtable
+*/
+static struct SSLqueue *searchSSL(SOCKET s){
+ struct SSLqueue *sslq;
+ for(sslq = SSLq; sslq; sslq = sslq->next)
+ if(sslq->s == s) return sslq;
+ return NULL;
+}
+
+static void addSSL(SOCKET s, SSL_CERT cert, SSL_CONN conn, struct clientparam* param){
+ struct SSLqueue *sslq;
+ sslq = (struct SSLqueue *) malloc(sizeof(struct SSLqueue));
+ sslq->s = s;
+ sslq->cert = cert;
+ sslq->conn = conn;
+ pthread_mutex_lock(&ssl_mutex);
+ sslq->next = SSLq;
+ sslq->param = param;
+ SSLq = sslq;
+ pthread_mutex_unlock(&ssl_mutex);
+}
+
+int delSSL(SOCKET s){
+ struct SSLqueue *sqi, *sqt = NULL;
+ if(!SSLq) return 0;
+ pthread_mutex_lock(&ssl_mutex);
+ if(SSLq){
+ if(SSLq->s == s){
+ sqt = SSLq;
+ SSLq = SSLq->next;
+ }
+ else for(sqi = SSLq; sqi->next; sqi = sqi->next){
+ if (sqi->next->s == s){
+ sqt = sqi->next;
+ sqi->next = sqt->next;
+ break;
+ }
+ }
+ }
+ pthread_mutex_unlock(&ssl_mutex);
+ if(sqt) {
+ _ssl_cert_free(sqt->cert);
+ ssl_conn_free(sqt->conn);
+ free(sqt);
+ return 1;
+ }
+ return 0;
+}
+
+struct sockfuncs sso;
+
+#ifdef _WIN32
+static int WINAPI ssl_send(SOCKET s, const void *msg, int len, int flags){
+#else
+static int ssl_send(SOCKET s, const void *msg, size_t len, int flags){
+#endif
+ struct SSLqueue *sslq;
+
+ if ((sslq = searchSSL(s))){
+ int i=0, res, err;
+ do {
+ if((res = ssl_write(sslq->conn, (void *)msg, len)) < 0) {
+ err = SSL_get_error((SSL *)((ssl_conn*)sslq->conn)->ssl, res);
+ usleep(10*SLEEPTIME);
+ }
+ } while (res < 0 && (err == SSL_ERROR_WANT_READ || err == SSL_ERROR_WANT_WRITE) && ++i < 100);
+ return res;
+ }
+
+ return sso._send(s, msg, len, flags);
+}
+
+
+#ifdef _WIN32
+static int WINAPI ssl_sendto(SOCKET s, const void *msg, int len, int flags, const struct sockaddr *to, int tolen){
+#else
+static int ssl_sendto(SOCKET s, const void *msg, size_t len, int flags, const struct sockaddr *to, SASIZETYPE tolen){
+#endif
+ struct SSLqueue *sslq;
+
+ if ((sslq = searchSSL(s))){
+ int i=0, res, err;
+ do {
+ if((res = ssl_write(sslq->conn, (void *)msg, len)) < 0) {
+ err = SSL_get_error((SSL *)((ssl_conn*)sslq->conn)->ssl, res);
+ usleep(10*SLEEPTIME);
+ }
+ } while (res < 0 && (err == SSL_ERROR_WANT_READ || err == SSL_ERROR_WANT_WRITE) && ++i < 100);
+ return res;
+ }
+
+ return sso._sendto(s, msg, len, flags, to, tolen);
+}
+
+#ifdef _WIN32
+static int WINAPI ssl_recvfrom(SOCKET s, void *msg, int len, int flags, struct sockaddr *from, int *fromlen){
+#else
+static int ssl_recvfrom(SOCKET s, void *msg, size_t len, int flags, struct sockaddr *from, SASIZETYPE *fromlen){
+#endif
+ struct SSLqueue *sslq;
+
+ if ((sslq = searchSSL(s))){
+ int i=0, res, err;
+ do {
+ if((res = ssl_read(sslq->conn, (void *)msg, len)) < 0) {
+ err = SSL_get_error((SSL *)((ssl_conn*)sslq->conn)->ssl, res);
+ usleep(10*SLEEPTIME);
+ }
+ } while (res < 0 && (err == SSL_ERROR_WANT_READ || err == SSL_ERROR_WANT_WRITE) && ++i < 100);
+ return res;
+ }
+
+ return sso._recvfrom(s, msg, len, flags, from, fromlen);
+}
+
+#ifdef _WIN32
+static int WINAPI ssl_recv(SOCKET s, void *msg, int len, int flags){
+#else
+static int WINAPI ssl_recv(SOCKET s, void *msg, size_t len, int flags){
+#endif
+ struct SSLqueue *sslq;
+
+ if ((sslq = searchSSL(s))){
+ int i=0, res, err;
+ do {
+ if((res = ssl_read(sslq->conn, (void *)msg, len)) < 0) {
+ err = SSL_get_error((SSL *)((ssl_conn*)sslq->conn)->ssl, res);
+ usleep(10*SLEEPTIME);
+ }
+ } while (res < 0 && (err == SSL_ERROR_WANT_READ || err == SSL_ERROR_WANT_WRITE) && ++i < 100);
+ return res;
+ }
+
+ return sso._recv(s, msg, len, flags);
+}
+
+static int WINAPI ssl_closesocket(SOCKET s){
+ delSSL(s);
+ return sso._closesocket(s);
+}
+
+static int WINAPI ssl_poll(struct pollfd *fds, unsigned int nfds, int timeout){
+ struct SSLqueue *sslq = NULL;
+ unsigned int i;
+ int ret = 0;
+ for(i = 0; i < nfds; i++){
+ if((fds[i].events & POLLIN) && (sslq = searchSSL(fds[i].fd)) && ssl_pending(sslq->conn)){
+ fds[i].revents = POLLIN;
+ ret++;
+ }
+ else fds[i].revents = 0;
+ }
+ if(ret) return ret;
+
+ ret = sso._poll(fds, nfds, timeout);
+ return ret;
+}
+
+
+int dossl(struct clientparam* param, SSL_CONN* ServerConnp, SSL_CONN* ClientConnp){
+ SSL_CERT ServerCert=NULL, FakeCert=NULL;
+ SSL_CONN ServerConn, ClientConn;
+ char *errSSL=NULL;
+ unsigned long ul;
+
+#ifdef _WIN32
+ ul = 0;
+ ioctlsocket(param->remsock, FIONBIO, &ul);
+ ul = 0;
+ ioctlsocket(param->clisock, FIONBIO, &ul);
+#else
+ fcntl(param->remsock,F_SETFL,0);
+ fcntl(param->clisock,F_SETFL,0);
+#endif
+
+ if(ssl_connect_timeout){
+ ul = ((unsigned long)ssl_connect_timeout)*1000;
+ setsockopt(param->remsock, SOL_SOCKET, SO_RCVTIMEO, (char *)&ul, 4);
+ ul = ((unsigned long)ssl_connect_timeout)*1000;
+ setsockopt(param->remsock, SOL_SOCKET, SO_SNDTIMEO, (char *)&ul, 4);
+ }
+ ServerConn = ssl_handshake_to_server(param->remsock, &ServerCert, &errSSL);
+ if ( ServerConn == NULL || ServerCert == NULL ) {
+ param->res = 8011;
+ param->srv->logfunc(param, (unsigned char *)"SSL handshake to server failed");
+ if(ServerConn == NULL) param->srv->logfunc(param, (unsigned char *)"ServerConn is NULL");
+ if(ServerCert == NULL) param->srv->logfunc(param, (unsigned char *)"ServerCert is NULL");
+ if(errSSL)param->srv->logfunc(param, (unsigned char *)errSSL);
+ return 1;
+ }
+ FakeCert = ssl_copy_cert(ServerCert);
+ if ( FakeCert == NULL ) {
+ param->res = 8012;
+ _ssl_cert_free(ServerCert);
+ param->srv->logfunc(param, (unsigned char *)"Failed to create certificate copy");
+ ssl_conn_free(ServerConn);
+ return 2;
+ }
+ ClientConn = ssl_handshake_to_client(param->clisock, FakeCert, &errSSL);
+ if ( ClientConn == NULL ) {
+ param->res = 8012;
+ param->srv->logfunc(param, (unsigned char *)"Handshake to client failed");
+ if(errSSL)param->srv->logfunc(param, (unsigned char *)errSSL);
+ _ssl_cert_free(ServerCert);
+ _ssl_cert_free(FakeCert);
+ ssl_conn_free(ServerConn);
+ return 3;
+ }
+
+#ifdef _WIN32
+ ul = 1;
+ ioctlsocket(param->remsock, FIONBIO, &ul);
+ ul = 1;
+ ioctlsocket(param->clisock, FIONBIO, &ul);
+#else
+ fcntl(param->remsock,F_SETFL,O_NONBLOCK);
+ fcntl(param->clisock,F_SETFL,O_NONBLOCK);
+#endif
+
+
+ SSL_set_mode((SSL *)((ssl_conn *)ServerConn)->ssl, SSL_MODE_ENABLE_PARTIAL_WRITE|SSL_MODE_AUTO_RETRY);
+ SSL_set_mode((SSL *)((ssl_conn *)ClientConn)->ssl, SSL_MODE_ENABLE_PARTIAL_WRITE|SSL_MODE_AUTO_RETRY);
+ SSL_set_read_ahead((SSL *)((ssl_conn *)ServerConn)->ssl, 0);
+ SSL_set_read_ahead((SSL *)((ssl_conn *)ClientConn)->ssl, 0);
+ addSSL(param->remsock, ServerCert, ServerConn, param);
+ addSSL(param->clisock, FakeCert, ClientConn, param);
+ if(ServerConnp)*ServerConnp = ServerConn;
+ if(ClientConnp)*ClientConnp = ClientConn;
+
+
+ return 0;
+}
+
+
+static void* ssl_filter_open(void * idata, struct srvparam * param){
+ return idata;
+}
+
+
+
+static FILTER_ACTION ssl_filter_client(void *fo, struct clientparam * param, void** fc){
+ return CONTINUE;
+}
+
+static FILTER_ACTION ssl_filter_predata(void *fo, struct clientparam * param){
+ if(param->operation != HTTP_CONNECT) return PASS;
+ if(dossl(param, NULL, NULL)) {
+ return REJECT;
+ }
+ param->redirectfunc = proxyfunc;
+ return HANDLED;
+}
+
+
+static void ssl_filter_clear(void *fo){
+}
+
+static void ssl_filter_close(void *fo){
+}
+
+static struct filter ssl_filter = {
+ NULL,
+ "ssl filter",
+ "ssl filter",
+ ssl_filter_open,
+ ssl_filter_client,
+ NULL, NULL, NULL, ssl_filter_predata, NULL, NULL,
+ ssl_filter_clear,
+ ssl_filter_close
+};
+
+
+#ifdef _WIN32
+__declspec(dllexport)
+#endif
+
+ int ssl_plugin (struct pluginlink * pluginlink,
+ int argc, char** argv){
+ pl = pluginlink;
+ if(argc > 1) {
+ if(cert_path && *cert_path) free(cert_path);
+ cert_path = strdup(argv[1]);
+ }
+ if(!ssl_loaded){
+ ssl_loaded = 1;
+ pthread_mutex_init(&ssl_mutex, NULL);
+ ssl_filter.next = pl->conf->filters;
+ pl->conf->filters = &ssl_filter;
+ memcpy(&sso, pl->so, sizeof(struct sockfuncs));
+ pl->so->_send = ssl_send;
+ pl->so->_recv = ssl_recv;
+ pl->so->_sendto = ssl_sendto;
+ pl->so->_recvfrom = ssl_recvfrom;
+ pl->so->_closesocket = ssl_closesocket;
+ pl->so->_poll = ssl_poll;
+ }
+ else{
+ ssl_release();
+ }
+ ssl_init();
+ tcppmfunc = (PROXYFUNC)pl->findbyname("tcppm");
+ if(!tcppmfunc){return 13;}
+ proxyfunc = (PROXYFUNC)pl->findbyname("proxy");
+ if(!proxyfunc)proxyfunc = tcppmfunc;
+ smtppfunc = (PROXYFUNC)pl->findbyname("smtpp");
+ if(!smtppfunc)smtppfunc = tcppmfunc;
+ ftpprfunc = (PROXYFUNC)pl->findbyname("ftppr");
+ if(!ftpprfunc)ftpprfunc = tcppmfunc;
+
+ return 0;
+
+ }
+#ifdef __cplusplus
+}
+#endif
diff --git a/src/plugins/StringsPlugin/CVS/Entries b/src/plugins/StringsPlugin/CVS/Entries
new file mode 100644
index 0000000..affb4be
--- /dev/null
+++ b/src/plugins/StringsPlugin/CVS/Entries
@@ -0,0 +1,2 @@
+/TrafficPlugin.c/1.4/Mon Mar 19 10:24:40 2007//
+D
diff --git a/src/plugins/StringsPlugin/CVS/Repository b/src/plugins/StringsPlugin/CVS/Repository
new file mode 100644
index 0000000..503dd21
--- /dev/null
+++ b/src/plugins/StringsPlugin/CVS/Repository
@@ -0,0 +1 @@
+3proxy-0.5a/src/plugins/TrafficPlugin
diff --git a/src/plugins/StringsPlugin/CVS/Root b/src/plugins/StringsPlugin/CVS/Root
new file mode 100644
index 0000000..43e0a15
--- /dev/null
+++ b/src/plugins/StringsPlugin/CVS/Root
@@ -0,0 +1 @@
+/cygdrive/m/MEDIA/H/CVS
diff --git a/src/plugins/StringsPlugin/Makefile b/src/plugins/StringsPlugin/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/plugins/StringsPlugin/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/plugins/StringsPlugin/Makefile.inc b/src/plugins/StringsPlugin/Makefile.inc
new file mode 100644
index 0000000..0e43d46
--- /dev/null
+++ b/src/plugins/StringsPlugin/Makefile.inc
@@ -0,0 +1,7 @@
+all: $(BUILDDIR)StringsPlugin$(DLSUFFICS)
+
+StringsPlugin$(OBJSUFFICS): StringsPlugin.c
+ $(CC) $(DCFLAGS) $(CFLAGS) StringsPlugin.c
+
+$(BUILDDIR)StringsPlugin$(DLSUFFICS): StringsPlugin$(OBJSUFFICS)
+ $(LN) $(LNOUT)../../$(BUILDDIR)StringsPlugin$(DLSUFFICS) $(LDFLAGS) $(DLFLAGS) StringsPlugin$(OBJSUFFICS)
diff --git a/src/plugins/StringsPlugin/Makefile.var b/src/plugins/StringsPlugin/Makefile.var
new file mode 100644
index 0000000..6e2c41c
--- /dev/null
+++ b/src/plugins/StringsPlugin/Makefile.var
@@ -0,0 +1,37 @@
+VERFILE = version.obj ../3proxy.RES
+#$Id: Makefile.msvc,v 1.17 2010-11-11 14:44:11 v.dubrovin Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin lastFripper FilePlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/src/plugins/StringsPlugin/ReadMe.txt b/src/plugins/StringsPlugin/ReadMe.txt
new file mode 100644
index 0000000..39d41c7
--- /dev/null
+++ b/src/plugins/StringsPlugin/ReadMe.txt
@@ -0,0 +1,63 @@
+-------------------------windows-1251------------------------
+Ïëàãèí ïîäìåíÿþùèé ñòðîêè â ñåðâåðå 3proxó (ÎÑ windows,unix)
+(c) Lopuchov Kirill lopuchov@mail.ru
+
+ 1. Êðàòêîå îïèñàíèå îïèñàíèå
+
+ Èñïîëüçóåòñÿ äëÿ ðóññèôèêàöèè ñîîáùåíèé âûäàâàåìûõ 3proxy.
+Äëÿ êîððåêòíîé ðàáîòû òðåáóåòñÿ ïîñëåäíÿÿ 0.6 âåðñèÿ 3proxy (â èíòåðôåéñå
+plugin api êîòîðîé ïîÿâèëñÿ job schedule ). Âñå ñîîáùåíèÿ áûëè âçÿòû èç
+äèñòðèáóòèâà 3proxy è âûíåñåííû â îòäåëüíûé ôàéë. Ïðèìåð ôàéëà rus-win1251.3ps.
+Äëÿ êàæäîãî ñåðâèñà ñóùåñòâóþò ñâîè áëîêè ñîîáùåíèé. Íà÷àëî è êîíåö áëîêà
+ðàçäåëåíû , íà ïðèìåð äëÿ ñåðâèñà ADMIN íà÷àëî "[--admin--]" êîíåö [/--admin--].
+Ñàìè ñîîáùåíèÿ îòäåëåíû ìåæäó ñîáîé ñòðîêîé "[end]", íîâàÿ ñòðîêà îïðåäåëÿåòñÿ
+ñòðîêîé "\n" .
+ Îò âåðñèè ê âåðñèè êîëè÷åñòâî ñîîáùåíèé â 3proxy ìîæåò ìåíÿòñÿ.
+ ýòîì ñëó÷àå íåîáõîäèìî ëèáî äîáàâèòü ñàìîñòîÿòåëüíî íîâûå ñòðîêè â
+ñîîòâåòñâåþùèå áëîêè rus-win1251.3ps, èëè æäàòü îáíîâëåíèÿ :)
+
+
+Äëÿ êîìïèëÿöèè è òåñòèðîâàíèÿ ïîä ÎÑ Windows èñïîëüçîâàëñÿ ïàêåò Dev-C++
+http://www.bloodshed.net/dev/
+Äëÿ êîìïèëÿöèè è òåñòèðîâàíèÿ ïîä unix ïîäîáíûìè èñïîëüçîâàëñÿ gcc
+
+
+Íàñòðîéêà 3proxy
+---------------------
+
+plugin "string.dll" start c:\3proxy\rus-win1251.3ps
+
+-------------------------windows-1251------------------------
+
+---------------------------KOI8-R---------------------------
+ðÌÁÇÉÎ ÐÏÄÍÅÎÑÀÝÉÊ ÓÔÒÏËÉ × ÓÅÒ×ÅÒÅ 3proxÕ (ïó windows,unix)
+(c) Lopuchov Kirill lopuchov@mail.ru
+
+ 1. ëÒÁÔËÏÅ ÏÐÉÓÁÎÉÅ ÏÐÉÓÁÎÉÅ
+
+ éÓÐÏÌØÚÕÅÔÓÑ ÄÌÑ ÒÕÓÓÉÆÉËÁÃÉÉ ÓÏÏÂÝÅÎÉÊ ×ÙÄÁ×ÁÅÍÙÈ 3proxy.
+äÌÑ ËÏÒÒÅËÔÎÏÊ ÒÁÂÏÔÙ ÔÒÅÂÕÅÔÓÑ ÐÏÓÌÅÄÎÑÑ 0.6 ×ÅÒÓÉÑ 3proxy (× ÉÎÔÅÒÆÅÊÓÅ
+plugin api ËÏÔÏÒÏÊ ÐÏÑ×ÉÌÓÑ job schedule ). ÷ÓÅ ÓÏÏÂÝÅÎÉÑ ÂÙÌÉ ×ÚÑÔÙ ÉÚ
+ÄÉÓÔÒÉÂÕÔÉ×Á 3proxy É ×ÙÎÅÓÅÎÎÙ × ÏÔÄÅÌØÎÙÊ ÆÁÊÌ. ðÒÉÍÅÒ ÆÁÊÌÁ rus-win1251.3ps.
+äÌÑ ËÁÖÄÏÇÏ ÓÅÒ×ÉÓÁ ÓÕÝÅÓÔ×ÕÀÔ Ó×ÏÉ ÂÌÏËÉ ÓÏÏÂÝÅÎÉÊ. îÁÞÁÌÏ É ËÏÎÅà ÂÌÏËÁ
+ÒÁÚÄÅÌÅÎÙ , ÎÁ ÐÒÉÍÅÒ ÄÌÑ ÓÅÒ×ÉÓÁ ADMIN ÎÁÞÁÌÏ "[--admin--]" ËÏÎÅà [/--admin--].
+óÁÍÉ ÓÏÏÂÝÅÎÉÑ ÏÔÄÅÌÅÎÙ ÍÅÖÄÕ ÓÏÂÏÊ ÓÔÒÏËÏÊ "[end]", ÎÏ×ÁÑ ÓÔÒÏËÁ ÏÐÒÅÄÅÌÑÅÔÓÑ
+ÓÔÒÏËÏÊ "\n" .
+ ïÔ ×ÅÒÓÉÉ Ë ×ÅÒÓÉÉ ËÏÌÉÞÅÓÔ×Ï ÓÏÏÂÝÅÎÉÊ × 3proxy ÍÏÖÅÔ ÍÅÎÑÔÓÑ.
+÷ ÜÔÏÍ ÓÌÕÞÁÅ ÎÅÏÂÈÏÄÉÍÏ ÌÉÂÏ ÄÏÂÁ×ÉÔØ ÓÁÍÏÓÔÏÑÔÅÌØÎÏ ÎÏ×ÙÅ ÓÔÒÏËÉ ×
+ÓÏÏÔ×ÅÔÓ×ÅÀÝÉÅ ÂÌÏËÉ rus-win1251.3ps, ÉÌÉ ÖÄÁÔØ ÏÂÎÏ×ÌÅÎÉÑ :)
+
+
+äÌÑ ËÏÍÐÉÌÑÃÉÉ É ÔÅÓÔÉÒÏ×ÁÎÉÑ ÐÏÄ ïó Windows ÉÓÐÏÌØÚÏ×ÁÌÓÑ ÐÁËÅÔ Dev-C++
+http://www.bloodshed.net/dev/
+äÌÑ ËÏÍÐÉÌÑÃÉÉ É ÔÅÓÔÉÒÏ×ÁÎÉÑ ÐÏÄ unix ÐÏÄÏÂÎÙÍÉ ÉÓÐÏÌØÚÏ×ÁÌÓÑ gcc
+
+
+îÁÓÔÒÏÊËÁ 3proxy
+---------------------
+
+plugin "string.dll" start c:\3proxy\rus-win1251.3ps
+
+---------------------------KOI8-R---------------------------
+
+
diff --git a/src/plugins/StringsPlugin/StringsPlugin.c b/src/plugins/StringsPlugin/StringsPlugin.c
new file mode 100644
index 0000000..0aa938b
--- /dev/null
+++ b/src/plugins/StringsPlugin/StringsPlugin.c
@@ -0,0 +1,254 @@
+#include "../../structures.h"
+#include
+#include
+#include
+#include
+
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct pluginlink * mypl;
+int count_load_str_proxy_from_file=0,count_load_str_admin_from_file=0;
+int count_str_proxy_in_3proxy=0,count_str_admin_in_3proxy=0;
+char ** old_proxy_table=NULL;
+char ** old_admin_table=NULL;
+struct schedule myschedule;
+
+
+char **load_string(FILE *f,int max_count_str, int *countloadstr,
+ char *start,char *stop,char **table_3proxy)
+{
+ int cstr=0,i=0;
+ char tmpbuf1[1024],*rstr,*pt=NULL,*p=NULL;
+ char **old_table;
+
+ tmpbuf1[0]='\0';
+
+ fseek(f,0,SEEK_SET);
+
+ /*find start service section*/
+ while(!feof(f))
+ {
+ fgets(tmpbuf1, 1023,f);
+ if ((strstr(tmpbuf1,start))!=NULL) { i++; break; }
+ tmpbuf1[0]='\0';
+ }
+
+ if (i==0){
+ fprintf(stderr,"Error StringsPlugin: No start section %s strings! \n",start);
+ return NULL;
+ }
+
+
+ /*create table for old strings */
+ old_table=(char **)mypl->myalloc(max_count_str*sizeof(char *));
+ memset(old_table,0,max_count_str*sizeof(char *));
+
+ /*load from file new strings */
+ i=0;
+ while ( !feof(f) || i< max_count_str)
+ {
+ fgets(tmpbuf1, 1023,f);
+
+ if ((strstr(tmpbuf1,stop))!=NULL) { break; }
+
+ if (strstr(tmpbuf1,"[end]")==NULL)
+ {
+ /* find and replace \n \r*/
+ rstr = tmpbuf1;
+ while (*rstr!='\0')
+ {
+ if (*rstr=='\r' || *rstr=='\n' )
+ { *rstr='\0'; rstr++; }
+ rstr++;
+ }
+
+ while ((rstr=strstr(tmpbuf1,"\\n")))
+ {
+ if (rstr!=NULL){ *rstr='\r'; rstr++; *rstr='\n'; }
+ }
+
+
+ /* add string */
+ if (pt!=NULL) { cstr=cstr+(int)strlen(pt); }
+
+ cstr=cstr+(int)strlen(tmpbuf1)+1;
+
+ p = (char *)mypl->myalloc(cstr);
+
+ if (pt!=NULL)
+ {
+ strcpy(p, pt);
+ strcat(p, tmpbuf1);
+ mypl->myfree(pt);
+ }
+ else
+ { strcpy(p, tmpbuf1); }
+
+ pt=p; cstr=0;
+
+ }
+ else
+ {
+ /* save old string */
+ old_table[i]=table_3proxy[i];
+ /* replace string */
+ table_3proxy[i]=pt;
+ pt=NULL; i++;
+ }
+
+
+ }
+
+
+ if(pt)mypl->myfree(pt);
+ *countloadstr=i;
+ if (i==0) { mypl->myfree(old_table); old_table=NULL; }
+
+ return old_table;
+
+}
+
+/*-------------------------------------------------------------------*/
+static int restore_old_table(void * v)
+{
+ int i; char *p=NULL;
+
+ /* restore old proxy table */
+ if(old_proxy_table)
+ {
+
+ for(i=0; i < count_str_proxy_in_3proxy; i++){
+ p=mypl->proxy_table[i];
+ mypl->proxy_table[i]=old_proxy_table[i];
+ mypl->myfree(p);
+ }
+ mypl->myfree(old_proxy_table);
+ old_proxy_table = NULL;
+
+ }
+
+ p=NULL;
+
+ /* restore old admin table */
+ if(old_admin_table)
+ {
+
+ for(i=0; i < count_str_admin_in_3proxy; i++){
+ p=mypl->admin_table[i];
+ mypl->admin_table[i]=old_admin_table[i];
+ mypl->myfree(p);
+ }
+ mypl->myfree(old_admin_table);
+ old_admin_table = NULL;
+ }
+ /*return 1 delete job, 0 no delete!!! :)*/
+ return 1;
+}
+/*-------------------------------------------------------------------*/
+
+#ifdef _WIN32
+__declspec(dllexport) int start(struct pluginlink * pluginlink,
+ int argc, char** argv);
+BOOL APIENTRY DllMain( HMODULE hModule,
+ DWORD ul_reason_for_call,
+ LPVOID lpReserved
+ )
+{
+ if (ul_reason_for_call == DLL_PROCESS_DETACH)
+ {
+ if(old_proxy_table) { restore_old_table(NULL); }
+
+ }
+ return TRUE;
+}
+#else
+
+int start(struct pluginlink * pluginlink,
+ int argc, char** argv);
+
+#endif
+
+
+
+/*---------------------- start plugin init ------------------------------ */
+int start(struct pluginlink * pluginlink, int argc, char** argv)
+{
+ FILE *f=NULL;
+
+ mypl=pluginlink;
+
+ if(old_proxy_table||old_admin_table) restore_old_table(NULL);
+
+ if(!(f=fopen(argv[1],"r"))) return 1001;
+
+ /*count string service PROXY in 3proxy */
+ count_str_proxy_in_3proxy=0;
+ while( mypl->proxy_table[count_str_proxy_in_3proxy] != NULL )
+ { count_str_proxy_in_3proxy++; }
+
+ /*count string service ADMIN in 3proxy */
+ count_str_admin_in_3proxy=0;
+ while( mypl->admin_table[count_str_admin_in_3proxy] != NULL )
+ { count_str_admin_in_3proxy++; }
+
+ /*---- load string for PROXY service ----*/
+ old_proxy_table=load_string(f,count_str_proxy_in_3proxy,
+ &count_load_str_proxy_from_file,
+ "[--proxy--]","[/--proxy--]",
+ mypl->proxy_table);
+
+
+ if (old_proxy_table == NULL)
+ {
+ fprintf(stderr,"Error StringsPlugin: No load string from file %s \
+ for service PROXY !\n",argv[1]);
+ }
+
+ if(count_str_proxy_in_3proxy!= count_load_str_proxy_from_file)
+ {
+ fprintf(stderr,"Warning StringsPlugin: Count string for service PROXY in\
+ 3proxy not equality count string in file %s \n",argv[1]);
+ }
+
+
+ /*---- load string for ADMIN service ----*/
+ old_admin_table=load_string(f,count_str_admin_in_3proxy,
+ &count_load_str_admin_from_file,
+ "[--admin--]","[/--admin--]",
+ mypl->admin_table);
+
+
+ if (old_admin_table == NULL)
+ {
+ fprintf(stderr,"Error StringsPlugin: No load string from file %s \
+ for service ADMIN !\n",argv[1]);
+ }
+
+ if(count_str_admin_in_3proxy!= count_load_str_admin_from_file)
+ {
+ fprintf(stderr,"Warning StringsPlugin: Count string for service ADMIN in\
+ 3proxy not equality count string in file %s\n",argv[1]);
+ }
+
+ fclose(f);
+
+ /* create job shedule for processing reload */
+ if(*pluginlink->schedule!=&myschedule){
+ memset(&myschedule,0,sizeof(struct schedule));
+ myschedule.type=NONE;
+ myschedule.function=restore_old_table;
+ myschedule.next = *pluginlink->schedule;
+ *pluginlink->schedule=&myschedule;
+ }
+
+ return 0;
+}
+
+
+#ifdef __cplusplus
+extern }
+#endif
diff --git a/src/plugins/TrafficPlugin/CVS/Entries b/src/plugins/TrafficPlugin/CVS/Entries
new file mode 100644
index 0000000..21e7def
--- /dev/null
+++ b/src/plugins/TrafficPlugin/CVS/Entries
@@ -0,0 +1,2 @@
+/TrafficPlugin.c/1.11/Fri Aug 14 10:20:01 2009//
+D
diff --git a/src/plugins/TrafficPlugin/CVS/Repository b/src/plugins/TrafficPlugin/CVS/Repository
new file mode 100644
index 0000000..503dd21
--- /dev/null
+++ b/src/plugins/TrafficPlugin/CVS/Repository
@@ -0,0 +1 @@
+3proxy-0.5a/src/plugins/TrafficPlugin
diff --git a/src/plugins/TrafficPlugin/CVS/Root b/src/plugins/TrafficPlugin/CVS/Root
new file mode 100644
index 0000000..43e0a15
--- /dev/null
+++ b/src/plugins/TrafficPlugin/CVS/Root
@@ -0,0 +1 @@
+/cygdrive/m/MEDIA/H/CVS
diff --git a/src/plugins/TrafficPlugin/Changelog.txt b/src/plugins/TrafficPlugin/Changelog.txt
new file mode 100644
index 0000000..696b2de
--- /dev/null
+++ b/src/plugins/TrafficPlugin/Changelog.txt
@@ -0,0 +1,13 @@
+========================================================================
+ 3proxy traffic plugin Changelog
+========================================================================
+v0.1.2 (2 ÿíâàðÿ 2007 ãîäà)
+- Ïëóãèí îáíîâë¸í â ñîîòâåòñòâèè ñ îáíîâëåíèåì 3proxy.
+- Äîáàâëåíà îïöèÿ debug.
+
+v0.1.1
+- Òåïåðü udp íåëüçÿ çàäàâàòü proxy, tcppm, pop3p
+- Èñïðàâëåíà îøèáêà ñ âûáîðîì òèïà ñîåäèíåíèÿ.
+
+v0.1.0 beta (10 èþëÿ 2006)
+Ïåðâûé ðåëèç.
\ No newline at end of file
diff --git a/src/plugins/TrafficPlugin/Makefile b/src/plugins/TrafficPlugin/Makefile
new file mode 100644
index 0000000..e7c51ad
--- /dev/null
+++ b/src/plugins/TrafficPlugin/Makefile
@@ -0,0 +1 @@
+include Makefile.var
diff --git a/src/plugins/TrafficPlugin/Makefile.inc b/src/plugins/TrafficPlugin/Makefile.inc
new file mode 100644
index 0000000..4aed3db
--- /dev/null
+++ b/src/plugins/TrafficPlugin/Makefile.inc
@@ -0,0 +1,7 @@
+all: $(BUILDDIR)TrafficPlugin$(DLSUFFICS)
+
+TrafficPlugin$(OBJSUFFICS): TrafficPlugin.c
+ $(CC) $(DCFLAGS) $(CFLAGS) TrafficPlugin.c
+
+$(BUILDDIR)TrafficPlugin$(DLSUFFICS): TrafficPlugin$(OBJSUFFICS)
+ $(LN) $(LNOUT)../../$(BUILDDIR)TrafficPlugin$(DLSUFFICS) $(LDFLAGS) $(DLFLAGS) TrafficPlugin$(OBJSUFFICS)
diff --git a/src/plugins/TrafficPlugin/Makefile.var b/src/plugins/TrafficPlugin/Makefile.var
new file mode 100644
index 0000000..6e2c41c
--- /dev/null
+++ b/src/plugins/TrafficPlugin/Makefile.var
@@ -0,0 +1,37 @@
+VERFILE = version.obj ../3proxy.RES
+#$Id: Makefile.msvc,v 1.17 2010-11-11 14:44:11 v.dubrovin Exp $
+#
+# 3 proxy Makefile for Microsoft Visual C compiler (for both make and nmake)
+#
+# You can try to remove -DWITH_STD_MALLOC to CFLAGS to use optimized malloc
+# libraries
+#
+# Add /DSAFESQL to CFLAGS if you are using poorely written/tested ODBC driver
+
+BUILDDIR = ../bin/
+CC = cl
+CFLAGS = /nologo /MT /W3 /Ox /GS /EHs- /GA /GF /D "MSVC" /D "WITH_STD_MALLOC" /D "NDEBUG" /D "WIN32" /D "_CONSOLE" /D "_MBCS" /D "_WIN32" /Fp"proxy.pch" /FD /c
+COUT = /Fo
+LN = link
+LDFLAGS = /nologo /subsystem:console /incremental:no /machine:I386
+DLFLAGS = /DLL
+DLSUFFICS = .dll
+LIBS = ws2_32.lib advapi32.lib odbc32.lib user32.lib kernel32.lib Gdi32.lib libeay32MT.lib ssleay32MT.lib
+LIBEXT = .lib
+LNOUT = /out:
+EXESUFFICS = .exe
+OBJSUFFICS = .obj
+DEFINEOPTION = /D
+COMPFILES = *.pch *.idb
+REMOVECOMMAND = del 2>NUL >NUL
+TYPECOMMAND = type
+COMPATLIBS =
+MAKEFILE = Makefile.msvc
+PLUGINS = utf8tocp1251 WindowsAuthentication TrafficPlugin StringsPlugin PCREPlugin lastFripper FilePlugin
+
+
+include Makefile.inc
+
+allplugins:
+ for /D %%i in ($(PLUGINS)) do (copy Makefile plugins\%%i && copy Makefile.var plugins\%%i && cd plugins\%%i && nmake && del *.obj *.idb &&cd ..\..)
+
\ No newline at end of file
diff --git a/src/plugins/TrafficPlugin/ReadMe.txt b/src/plugins/TrafficPlugin/ReadMe.txt
new file mode 100644
index 0000000..c4f4fb1
--- /dev/null
+++ b/src/plugins/TrafficPlugin/ReadMe.txt
@@ -0,0 +1,67 @@
+========================================================================
+ 3proxy traffic plugin
+========================================================================
+Êàê èçâåñòíî 3proxy ñ÷èòàåò òðàôôèê íå ñåòåâîé, à ïðèêëàäíîé.
+Îáû÷íî ïðèêëàäíîé òðàôôèê íåìíîãî ìåíüøå (ïðèìåðíî íà 10%) ÷åì ñåòåâîé,
+îäíàêî â íåêîòîðûõ ñëó÷àÿõ, íàïðèìåð êîãäà ïîëüçîâàòåëè ñåòè èãðàþò â
+èãðû, ñåòåâîé òðàôôèê ìîæåò ïðåâûñèòü ïðèêëàäíîé â 4-5 ðàç. Ýòî äîâîëüíî íåïðèÿòíî,
+òàê êàê ïîëó÷àåòñÿ, ÷òî îíè çà ýòî íå ïëàòÿò.
+
+Ïðîèñõîäèò ýòî ïîòîìó, ÷òî â êàæäîì ïîñëàíîì ïàêåòå åñòü çàãîëîâîê+äàííûå. Çàãîëîâîê
+âåñèò ïîðÿäêà 50-60 áàéò à êîëëè÷åñòâî äàííûõ ìîæåò ìåíÿòüñÿ îò 15-20 áàéò (÷òî õàðàêòåðíî äëÿ èãð)
+äî 800-900 áàéò (ó IE). Òàêæå êîëëè÷åñòâî äàííûõ â ïàêåòå çàâèñèò îò çàãðóçêè ñåòè,
+óäàë¸ííîñòè ñåðâåðà è ïðî÷èõ ïðè÷èí.
+
+Äàííûé ïëàãèí ìîæåò èñïðàâèòü òàêóþ ñèòóàöèþ. Îí ìîæåò óìíîæàòü ñ÷¸ò÷èê òðàôôèêà
+ïðè îêîí÷àíèè ñîåäèíåíèÿ íà íåêîòîðûé êîýôôèöèåíò ëèáî äîáàâëÿòü ê äàííûì ðàçìåðû çàãîëîâêîâ ïàêåòîâ,
+êîòîðûå ïðîøëè ïî ñåòè.
+
+Êàê èñïîëüçîâàòü ïëàãèí:
+
+çàãðóçêà ïëàãèíà:
+plugin "TrafficPlugin.dll" start
+
+Äàëåå íåäîõîäèìî äîáàâèòü ïðàâèëà:
+ÄËß ÐÅÆÈÌÀ ÄÎÌÍÎÆÅÍÈß ÒÐÀÔÔÈÊÀ ÍÀ ×ÈÑËÎ:
+trafcorrect m <ñåðâèñ> <èñõîäÿùèé ïîðò> <êîýôôèöèåíò>
+ãäå: <ñåðâèñ> ìîæåò áûòü proxy, socks4, socks45, socks5, tcppm, udppm, pop3p
+ åñëè ñåðâèñ óêàçàí íåâåðíî òî ñ÷èòàåòñÿ, ÷òî ýòî ìîæåò áûòü ëþáîé ñåðâèñ.
+ ìîæíî èñïîëüçîâàòü *, òîãäà ïðàâèëî áóäåò ñ÷èòàòüñÿ äëÿ ëþáîãî ñåðâèñà.
+ <èñõîäÿùèé ïîðò> - ïîðò, ê êîòîðîìó ïîäêëþ÷àåòñÿ ïðîêñè ñåðâåð. * - ëþáîé
+ <êîýôôèöèåíò> - ÷èñëî íà êàîòîðîå äîìíàæàåòñÿ òðàôôèê. Îáÿçàòåëüíûé ïàðàìåòð.
+ Äîëæåí áûòü îò áîëüøå 0 è ìåíüøå 100
+
+ÄËß ÐÅÆÈÌÀ Ñ ÓרÒÎÌ ÐÀÇÌÅÐÀ ÇÀÃÎËÎÂÊΠÏÀÊÅÒÎÂ:
+trafcorrect p <ñåðâèñ> <èñõîäÿùèé ïîðò> [ðàçìåð ïóñòîãî ïàêåòà]
+ - ïðîòîêîë, ïî êîòîðîìó îñóùåñòâëÿåòñÿ ñîåäèíåíèå.
+ [ðàçìåð ïàêåòà] - ñðåäíèé ðàçìåð ïóñòîãî ïàêåòà. Ìîæíî îïðåäåëèòü çàõâàòèâ
+äàííûå ïðè ïîìîùè òàêîé óòèëèòû êàê Ethernal. Ïàðàìåòð íåîáÿçàòåëåí. Åñëè îòñóòñòâóåò,
+òî ðàçìåð ïàêåòà áóäåò ñ÷èòàòüñÿ ðàâíûì 66 áàéò.
+
+Ðåæèìû ìîæíî ñìåøèâàòü.
+Ñëåäóåò ó÷èòûâàòü, ÷òî ïëóãèí ñîçäà¸ò ñïèñîê âñåõ ïðàâèë èçìåíåíèÿ òðàôôèêà.
+Êîãäà ïðîèñõîäèò îêîí÷àíèå ñîåäèíåíèÿ âûïîëíÿåòñÿ ïåðâîå ïîäõîäÿùåå ïðàâèëî.
+
+Ïðèìåð:
+plugin "TrafficPlugin.dll" start
+trafcorrect m socks5 6112 4.5
+trafcorrect m socks5 * 1.1
+
+ñëåäóþùåå íåâåðíî:
+plugin "TrafficPlugin.dll" start
+trafcorrect m socks5 * 1.1
+trafcorrect m socks5 6112 4.5
+Âòîðàÿ ñòðî÷êà âûïîëíåíà íèêîãäà íå áóäåò. Òàê êàê 1 èìååò áîëåå øèðîêîå íàçíà÷åíèå.
+
+ÐÅÆÈÌ ÎÒËÀÄÊÈ ÏÐÀÂÈË:
+1. Çàïóñêàåò ïðîêñè â îêîííîì ðåæèìå (÷òîáû âèäåòü stdout).
+2. Çàãðóçêà ïëàãèíà äîëæíà âûãëÿäåòü ñë. îáðàçîì:
+plugin "TrafficPlugin.dll" start debug
+3. Â îêíå ïðîêñè ñåðâåðà áóäåò íàïèñàíà èíôîðìàöèÿ î ïðîõîæäåíèè ïðàâèë êîððåêöèè òðàôôèêà.
+Ïðàâèëà íóìåðóþòñÿ ñ 1.
+
+/////////////////////////////////////////////////////////////////////////////
+Copyright:
+ (c) Maslov Michael aka Flexx(rus) All rights reserved.
+ Plugin was writen on Visual C++ 6.0 SP5
+ Using structures.h from 3proxy distr.
\ No newline at end of file
diff --git a/src/plugins/TrafficPlugin/TrafficPlugin.c b/src/plugins/TrafficPlugin/TrafficPlugin.c
new file mode 100644
index 0000000..a745112
--- /dev/null
+++ b/src/plugins/TrafficPlugin/TrafficPlugin.c
@@ -0,0 +1,282 @@
+/*
+ 3proxy Traffic correct plugin v0.1 beta
+
+ Íàïèñàë Maslov Michael aka Flexx(rus)
+ Ôîðìóëà ðàñ÷¸òà òðàôôèêà ïî ðàçìåðó ïàêåòà by 3APA3A
+ email: flexx_rus@mail.ru
+ ICQ: 299132764
+ http://3proxy.ru/
+
+ Êàê ðàáîòàåò íå çíàþ (ìíîãîå çàâèñèò îò âàøèõ íàñòðîåê). Íèêàêèõ ãàðàíòèé.
+ Ñ ïëóãèíîì ìîæåòå äåëàòü âñ¸, ÷òî çàõî÷åòñÿ.
+ Äîæåí ðàñïðîñòðîíÿòüñÿ òîëüêî ñ èñõîäíûìè êîäàìè èëè âìåñòå ñ 3proxy.
+ Óäàëÿòü äàííûé Copyright çàïðåùåíî.
+*/
+
+#include "../../structures.h"
+#include
+
+#include